{"version":3,"file":"embed.iife.js","sources":["../../../node_modules/.pnpm/react@18.2.0/node_modules/react/cjs/react.development.js","../../../node_modules/.pnpm/react@18.2.0/node_modules/react/index.js","../../../node_modules/.pnpm/react@18.2.0/node_modules/react/cjs/react-jsx-runtime.development.js","../../../node_modules/.pnpm/react@18.2.0/node_modules/react/jsx-runtime.js","../../../node_modules/.pnpm/@lezer+common@1.0.3/node_modules/@lezer/common/dist/index.js","../../../node_modules/.pnpm/@lezer+lr@1.3.9/node_modules/@lezer/lr/dist/index.js","../../../node_modules/.pnpm/@lezer+highlight@1.1.6/node_modules/@lezer/highlight/dist/index.js","../../../node_modules/.pnpm/@lezer+rust@1.0.1/node_modules/@lezer/rust/dist/index.js","../../../node_modules/.pnpm/@codemirror+state@6.2.1/node_modules/@codemirror/state/dist/index.js","../../../node_modules/.pnpm/style-mod@4.0.3/node_modules/style-mod/src/style-mod.js","../../../node_modules/.pnpm/w3c-keyname@2.2.8/node_modules/w3c-keyname/index.js","../../../node_modules/.pnpm/@codemirror+view@6.14.1/node_modules/@codemirror/view/dist/index.js","../../../node_modules/.pnpm/@codemirror+language@6.8.0/node_modules/@codemirror/language/dist/index.js","../../../node_modules/.pnpm/@codemirror+lang-rust@6.0.1/node_modules/@codemirror/lang-rust/dist/index.js","../../../node_modules/.pnpm/scheduler@0.23.0/node_modules/scheduler/cjs/scheduler.development.js","../../../node_modules/.pnpm/scheduler@0.23.0/node_modules/scheduler/index.js","../../../node_modules/.pnpm/react-dom@18.2.0_react@18.2.0/node_modules/react-dom/cjs/react-dom.development.js","../../../node_modules/.pnpm/react-dom@18.2.0_react@18.2.0/node_modules/react-dom/index.js","../../../node_modules/.pnpm/react-dom@18.2.0_react@18.2.0/node_modules/react-dom/client.js","../../../node_modules/.pnpm/classnames@2.3.2/node_modules/classnames/index.js","../../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/lodash.js","../../aquascope-editor/dist/editor-utils/misc.js","../../aquascope-editor/dist/editor-utils/boundaries.js","../../../node_modules/.pnpm/leader-line-new@1.1.9/node_modules/leader-line-new/leader-line.min.js","../../aquascope-editor/dist/editor-utils/interpreter.js","../../aquascope-editor/dist/editor-utils/stepper.js","../../aquascope-editor/dist/editor-utils/permissions.js","../../aquascope-editor/dist/lib.js","../../../node_modules/.pnpm/@floating-ui+core@1.3.1/node_modules/@floating-ui/core/dist/floating-ui.core.browser.min.mjs","../../../node_modules/.pnpm/@floating-ui+dom@1.4.5/node_modules/@floating-ui/dom/dist/floating-ui.dom.browser.min.mjs","../../../node_modules/.pnpm/@floating-ui+react-dom@1.3.0_react-dom@18.2.0_react@18.2.0__react@18.2.0/node_modules/@floating-ui/react-dom/dist/floating-ui.react-dom.esm.js","../../../node_modules/.pnpm/@codemirror+commands@6.1.2/node_modules/@codemirror/commands/dist/index.js","../src/setup.ts","../src/main.tsx"],"sourcesContent":["/**\n * @license React\n * react.development.js\n *\n * Copyright (c) Facebook, Inc. and its affiliates.\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\n'use strict';\n\nif (process.env.NODE_ENV !== \"production\") {\n  (function() {\n\n          'use strict';\n\n/* global __REACT_DEVTOOLS_GLOBAL_HOOK__ */\nif (\n  typeof __REACT_DEVTOOLS_GLOBAL_HOOK__ !== 'undefined' &&\n  typeof __REACT_DEVTOOLS_GLOBAL_HOOK__.registerInternalModuleStart ===\n    'function'\n) {\n  __REACT_DEVTOOLS_GLOBAL_HOOK__.registerInternalModuleStart(new Error());\n}\n          var ReactVersion = '18.2.0';\n\n// ATTENTION\n// When adding new symbols to this file,\n// Please consider also adding to 'react-devtools-shared/src/backend/ReactSymbols'\n// The Symbol used to tag the ReactElement-like types.\nvar REACT_ELEMENT_TYPE = Symbol.for('react.element');\nvar REACT_PORTAL_TYPE = Symbol.for('react.portal');\nvar REACT_FRAGMENT_TYPE = Symbol.for('react.fragment');\nvar REACT_STRICT_MODE_TYPE = Symbol.for('react.strict_mode');\nvar REACT_PROFILER_TYPE = Symbol.for('react.profiler');\nvar REACT_PROVIDER_TYPE = Symbol.for('react.provider');\nvar REACT_CONTEXT_TYPE = Symbol.for('react.context');\nvar REACT_FORWARD_REF_TYPE = Symbol.for('react.forward_ref');\nvar REACT_SUSPENSE_TYPE = Symbol.for('react.suspense');\nvar REACT_SUSPENSE_LIST_TYPE = Symbol.for('react.suspense_list');\nvar REACT_MEMO_TYPE = Symbol.for('react.memo');\nvar REACT_LAZY_TYPE = Symbol.for('react.lazy');\nvar REACT_OFFSCREEN_TYPE = Symbol.for('react.offscreen');\nvar MAYBE_ITERATOR_SYMBOL = Symbol.iterator;\nvar FAUX_ITERATOR_SYMBOL = '@@iterator';\nfunction getIteratorFn(maybeIterable) {\n  if (maybeIterable === null || typeof maybeIterable !== 'object') {\n    return null;\n  }\n\n  var maybeIterator = MAYBE_ITERATOR_SYMBOL && maybeIterable[MAYBE_ITERATOR_SYMBOL] || maybeIterable[FAUX_ITERATOR_SYMBOL];\n\n  if (typeof maybeIterator === 'function') {\n    return maybeIterator;\n  }\n\n  return null;\n}\n\n/**\n * Keeps track of the current dispatcher.\n */\nvar ReactCurrentDispatcher = {\n  /**\n   * @internal\n   * @type {ReactComponent}\n   */\n  current: null\n};\n\n/**\n * Keeps track of the current batch's configuration such as how long an update\n * should suspend for if it needs to.\n */\nvar ReactCurrentBatchConfig = {\n  transition: null\n};\n\nvar ReactCurrentActQueue = {\n  current: null,\n  // Used to reproduce behavior of `batchedUpdates` in legacy mode.\n  isBatchingLegacy: false,\n  didScheduleLegacyUpdate: false\n};\n\n/**\n * Keeps track of the current owner.\n *\n * The current owner is the component who should own any components that are\n * currently being constructed.\n */\nvar ReactCurrentOwner = {\n  /**\n   * @internal\n   * @type {ReactComponent}\n   */\n  current: null\n};\n\nvar ReactDebugCurrentFrame = {};\nvar currentExtraStackFrame = null;\nfunction setExtraStackFrame(stack) {\n  {\n    currentExtraStackFrame = stack;\n  }\n}\n\n{\n  ReactDebugCurrentFrame.setExtraStackFrame = function (stack) {\n    {\n      currentExtraStackFrame = stack;\n    }\n  }; // Stack implementation injected by the current renderer.\n\n\n  ReactDebugCurrentFrame.getCurrentStack = null;\n\n  ReactDebugCurrentFrame.getStackAddendum = function () {\n    var stack = ''; // Add an extra top frame while an element is being validated\n\n    if (currentExtraStackFrame) {\n      stack += currentExtraStackFrame;\n    } // Delegate to the injected renderer-specific implementation\n\n\n    var impl = ReactDebugCurrentFrame.getCurrentStack;\n\n    if (impl) {\n      stack += impl() || '';\n    }\n\n    return stack;\n  };\n}\n\n// -----------------------------------------------------------------------------\n\nvar enableScopeAPI = false; // Experimental Create Event Handle API.\nvar enableCacheElement = false;\nvar enableTransitionTracing = false; // No known bugs, but needs performance testing\n\nvar enableLegacyHidden = false; // Enables unstable_avoidThisFallback feature in Fiber\n// stuff. Intended to enable React core members to more easily debug scheduling\n// issues in DEV builds.\n\nvar enableDebugTracing = false; // Track which Fiber(s) schedule render work.\n\nvar ReactSharedInternals = {\n  ReactCurrentDispatcher: ReactCurrentDispatcher,\n  ReactCurrentBatchConfig: ReactCurrentBatchConfig,\n  ReactCurrentOwner: ReactCurrentOwner\n};\n\n{\n  ReactSharedInternals.ReactDebugCurrentFrame = ReactDebugCurrentFrame;\n  ReactSharedInternals.ReactCurrentActQueue = ReactCurrentActQueue;\n}\n\n// by calls to these methods by a Babel plugin.\n//\n// In PROD (or in packages without access to React internals),\n// they are left as they are instead.\n\nfunction warn(format) {\n  {\n    {\n      for (var _len = arguments.length, args = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {\n        args[_key - 1] = arguments[_key];\n      }\n\n      printWarning('warn', format, args);\n    }\n  }\n}\nfunction error(format) {\n  {\n    {\n      for (var _len2 = arguments.length, args = new Array(_len2 > 1 ? _len2 - 1 : 0), _key2 = 1; _key2 < _len2; _key2++) {\n        args[_key2 - 1] = arguments[_key2];\n      }\n\n      printWarning('error', format, args);\n    }\n  }\n}\n\nfunction printWarning(level, format, args) {\n  // When changing this logic, you might want to also\n  // update consoleWithStackDev.www.js as well.\n  {\n    var ReactDebugCurrentFrame = ReactSharedInternals.ReactDebugCurrentFrame;\n    var stack = ReactDebugCurrentFrame.getStackAddendum();\n\n    if (stack !== '') {\n      format += '%s';\n      args = args.concat([stack]);\n    } // eslint-disable-next-line react-internal/safe-string-coercion\n\n\n    var argsWithFormat = args.map(function (item) {\n      return String(item);\n    }); // Careful: RN currently depends on this prefix\n\n    argsWithFormat.unshift('Warning: ' + format); // We intentionally don't use spread (or .apply) directly because it\n    // breaks IE9: https://github.com/facebook/react/issues/13610\n    // eslint-disable-next-line react-internal/no-production-logging\n\n    Function.prototype.apply.call(console[level], console, argsWithFormat);\n  }\n}\n\nvar didWarnStateUpdateForUnmountedComponent = {};\n\nfunction warnNoop(publicInstance, callerName) {\n  {\n    var _constructor = publicInstance.constructor;\n    var componentName = _constructor && (_constructor.displayName || _constructor.name) || 'ReactClass';\n    var warningKey = componentName + \".\" + callerName;\n\n    if (didWarnStateUpdateForUnmountedComponent[warningKey]) {\n      return;\n    }\n\n    error(\"Can't call %s on a component that is not yet mounted. \" + 'This is a no-op, but it might indicate a bug in your application. ' + 'Instead, assign to `this.state` directly or define a `state = {};` ' + 'class property with the desired state in the %s component.', callerName, componentName);\n\n    didWarnStateUpdateForUnmountedComponent[warningKey] = true;\n  }\n}\n/**\n * This is the abstract API for an update queue.\n */\n\n\nvar ReactNoopUpdateQueue = {\n  /**\n   * Checks whether or not this composite component is mounted.\n   * @param {ReactClass} publicInstance The instance we want to test.\n   * @return {boolean} True if mounted, false otherwise.\n   * @protected\n   * @final\n   */\n  isMounted: function (publicInstance) {\n    return false;\n  },\n\n  /**\n   * Forces an update. This should only be invoked when it is known with\n   * certainty that we are **not** in a DOM transaction.\n   *\n   * You may want to call this when you know that some deeper aspect of the\n   * component's state has changed but `setState` was not called.\n   *\n   * This will not invoke `shouldComponentUpdate`, but it will invoke\n   * `componentWillUpdate` and `componentDidUpdate`.\n   *\n   * @param {ReactClass} publicInstance The instance that should rerender.\n   * @param {?function} callback Called after component is updated.\n   * @param {?string} callerName name of the calling function in the public API.\n   * @internal\n   */\n  enqueueForceUpdate: function (publicInstance, callback, callerName) {\n    warnNoop(publicInstance, 'forceUpdate');\n  },\n\n  /**\n   * Replaces all of the state. Always use this or `setState` to mutate state.\n   * You should treat `this.state` as immutable.\n   *\n   * There is no guarantee that `this.state` will be immediately updated, so\n   * accessing `this.state` after calling this method may return the old value.\n   *\n   * @param {ReactClass} publicInstance The instance that should rerender.\n   * @param {object} completeState Next state.\n   * @param {?function} callback Called after component is updated.\n   * @param {?string} callerName name of the calling function in the public API.\n   * @internal\n   */\n  enqueueReplaceState: function (publicInstance, completeState, callback, callerName) {\n    warnNoop(publicInstance, 'replaceState');\n  },\n\n  /**\n   * Sets a subset of the state. This only exists because _pendingState is\n   * internal. This provides a merging strategy that is not available to deep\n   * properties which is confusing. TODO: Expose pendingState or don't use it\n   * during the merge.\n   *\n   * @param {ReactClass} publicInstance The instance that should rerender.\n   * @param {object} partialState Next partial state to be merged with state.\n   * @param {?function} callback Called after component is updated.\n   * @param {?string} Name of the calling function in the public API.\n   * @internal\n   */\n  enqueueSetState: function (publicInstance, partialState, callback, callerName) {\n    warnNoop(publicInstance, 'setState');\n  }\n};\n\nvar assign = Object.assign;\n\nvar emptyObject = {};\n\n{\n  Object.freeze(emptyObject);\n}\n/**\n * Base class helpers for the updating state of a component.\n */\n\n\nfunction Component(props, context, updater) {\n  this.props = props;\n  this.context = context; // If a component has string refs, we will assign a different object later.\n\n  this.refs = emptyObject; // We initialize the default updater but the real one gets injected by the\n  // renderer.\n\n  this.updater = updater || ReactNoopUpdateQueue;\n}\n\nComponent.prototype.isReactComponent = {};\n/**\n * Sets a subset of the state. Always use this to mutate\n * state. You should treat `this.state` as immutable.\n *\n * There is no guarantee that `this.state` will be immediately updated, so\n * accessing `this.state` after calling this method may return the old value.\n *\n * There is no guarantee that calls to `setState` will run synchronously,\n * as they may eventually be batched together.  You can provide an optional\n * callback that will be executed when the call to setState is actually\n * completed.\n *\n * When a function is provided to setState, it will be called at some point in\n * the future (not synchronously). It will be called with the up to date\n * component arguments (state, props, context). These values can be different\n * from this.* because your function may be called after receiveProps but before\n * shouldComponentUpdate, and this new state, props, and context will not yet be\n * assigned to this.\n *\n * @param {object|function} partialState Next partial state or function to\n *        produce next partial state to be merged with current state.\n * @param {?function} callback Called after state is updated.\n * @final\n * @protected\n */\n\nComponent.prototype.setState = function (partialState, callback) {\n  if (typeof partialState !== 'object' && typeof partialState !== 'function' && partialState != null) {\n    throw new Error('setState(...): takes an object of state variables to update or a ' + 'function which returns an object of state variables.');\n  }\n\n  this.updater.enqueueSetState(this, partialState, callback, 'setState');\n};\n/**\n * Forces an update. This should only be invoked when it is known with\n * certainty that we are **not** in a DOM transaction.\n *\n * You may want to call this when you know that some deeper aspect of the\n * component's state has changed but `setState` was not called.\n *\n * This will not invoke `shouldComponentUpdate`, but it will invoke\n * `componentWillUpdate` and `componentDidUpdate`.\n *\n * @param {?function} callback Called after update is complete.\n * @final\n * @protected\n */\n\n\nComponent.prototype.forceUpdate = function (callback) {\n  this.updater.enqueueForceUpdate(this, callback, 'forceUpdate');\n};\n/**\n * Deprecated APIs. These APIs used to exist on classic React classes but since\n * we would like to deprecate them, we're not going to move them over to this\n * modern base class. Instead, we define a getter that warns if it's accessed.\n */\n\n\n{\n  var deprecatedAPIs = {\n    isMounted: ['isMounted', 'Instead, make sure to clean up subscriptions and pending requests in ' + 'componentWillUnmount to prevent memory leaks.'],\n    replaceState: ['replaceState', 'Refactor your code to use setState instead (see ' + 'https://github.com/facebook/react/issues/3236).']\n  };\n\n  var defineDeprecationWarning = function (methodName, info) {\n    Object.defineProperty(Component.prototype, methodName, {\n      get: function () {\n        warn('%s(...) is deprecated in plain JavaScript React classes. %s', info[0], info[1]);\n\n        return undefined;\n      }\n    });\n  };\n\n  for (var fnName in deprecatedAPIs) {\n    if (deprecatedAPIs.hasOwnProperty(fnName)) {\n      defineDeprecationWarning(fnName, deprecatedAPIs[fnName]);\n    }\n  }\n}\n\nfunction ComponentDummy() {}\n\nComponentDummy.prototype = Component.prototype;\n/**\n * Convenience component with default shallow equality check for sCU.\n */\n\nfunction PureComponent(props, context, updater) {\n  this.props = props;\n  this.context = context; // If a component has string refs, we will assign a different object later.\n\n  this.refs = emptyObject;\n  this.updater = updater || ReactNoopUpdateQueue;\n}\n\nvar pureComponentPrototype = PureComponent.prototype = new ComponentDummy();\npureComponentPrototype.constructor = PureComponent; // Avoid an extra prototype jump for these methods.\n\nassign(pureComponentPrototype, Component.prototype);\npureComponentPrototype.isPureReactComponent = true;\n\n// an immutable object with a single mutable value\nfunction createRef() {\n  var refObject = {\n    current: null\n  };\n\n  {\n    Object.seal(refObject);\n  }\n\n  return refObject;\n}\n\nvar isArrayImpl = Array.isArray; // eslint-disable-next-line no-redeclare\n\nfunction isArray(a) {\n  return isArrayImpl(a);\n}\n\n/*\n * The `'' + value` pattern (used in in perf-sensitive code) throws for Symbol\n * and Temporal.* types. See https://github.com/facebook/react/pull/22064.\n *\n * The functions in this module will throw an easier-to-understand,\n * easier-to-debug exception with a clear errors message message explaining the\n * problem. (Instead of a confusing exception thrown inside the implementation\n * of the `value` object).\n */\n// $FlowFixMe only called in DEV, so void return is not possible.\nfunction typeName(value) {\n  {\n    // toStringTag is needed for namespaced types like Temporal.Instant\n    var hasToStringTag = typeof Symbol === 'function' && Symbol.toStringTag;\n    var type = hasToStringTag && value[Symbol.toStringTag] || value.constructor.name || 'Object';\n    return type;\n  }\n} // $FlowFixMe only called in DEV, so void return is not possible.\n\n\nfunction willCoercionThrow(value) {\n  {\n    try {\n      testStringCoercion(value);\n      return false;\n    } catch (e) {\n      return true;\n    }\n  }\n}\n\nfunction testStringCoercion(value) {\n  // If you ended up here by following an exception call stack, here's what's\n  // happened: you supplied an object or symbol value to React (as a prop, key,\n  // DOM attribute, CSS property, string ref, etc.) and when React tried to\n  // coerce it to a string using `'' + value`, an exception was thrown.\n  //\n  // The most common types that will cause this exception are `Symbol` instances\n  // and Temporal objects like `Temporal.Instant`. But any object that has a\n  // `valueOf` or `[Symbol.toPrimitive]` method that throws will also cause this\n  // exception. (Library authors do this to prevent users from using built-in\n  // numeric operators like `+` or comparison operators like `>=` because custom\n  // methods are needed to perform accurate arithmetic or comparison.)\n  //\n  // To fix the problem, coerce this object or symbol value to a string before\n  // passing it to React. The most reliable way is usually `String(value)`.\n  //\n  // To find which value is throwing, check the browser or debugger console.\n  // Before this exception was thrown, there should be `console.error` output\n  // that shows the type (Symbol, Temporal.PlainDate, etc.) that caused the\n  // problem and how that type was used: key, atrribute, input value prop, etc.\n  // In most cases, this console output also shows the component and its\n  // ancestor components where the exception happened.\n  //\n  // eslint-disable-next-line react-internal/safe-string-coercion\n  return '' + value;\n}\nfunction checkKeyStringCoercion(value) {\n  {\n    if (willCoercionThrow(value)) {\n      error('The provided key is an unsupported type %s.' + ' This value must be coerced to a string before before using it here.', typeName(value));\n\n      return testStringCoercion(value); // throw (to help callers find troubleshooting comments)\n    }\n  }\n}\n\nfunction getWrappedName(outerType, innerType, wrapperName) {\n  var displayName = outerType.displayName;\n\n  if (displayName) {\n    return displayName;\n  }\n\n  var functionName = innerType.displayName || innerType.name || '';\n  return functionName !== '' ? wrapperName + \"(\" + functionName + \")\" : wrapperName;\n} // Keep in sync with react-reconciler/getComponentNameFromFiber\n\n\nfunction getContextName(type) {\n  return type.displayName || 'Context';\n} // Note that the reconciler package should generally prefer to use getComponentNameFromFiber() instead.\n\n\nfunction getComponentNameFromType(type) {\n  if (type == null) {\n    // Host root, text node or just invalid type.\n    return null;\n  }\n\n  {\n    if (typeof type.tag === 'number') {\n      error('Received an unexpected object in getComponentNameFromType(). ' + 'This is likely a bug in React. Please file an issue.');\n    }\n  }\n\n  if (typeof type === 'function') {\n    return type.displayName || type.name || null;\n  }\n\n  if (typeof type === 'string') {\n    return type;\n  }\n\n  switch (type) {\n    case REACT_FRAGMENT_TYPE:\n      return 'Fragment';\n\n    case REACT_PORTAL_TYPE:\n      return 'Portal';\n\n    case REACT_PROFILER_TYPE:\n      return 'Profiler';\n\n    case REACT_STRICT_MODE_TYPE:\n      return 'StrictMode';\n\n    case REACT_SUSPENSE_TYPE:\n      return 'Suspense';\n\n    case REACT_SUSPENSE_LIST_TYPE:\n      return 'SuspenseList';\n\n  }\n\n  if (typeof type === 'object') {\n    switch (type.$$typeof) {\n      case REACT_CONTEXT_TYPE:\n        var context = type;\n        return getContextName(context) + '.Consumer';\n\n      case REACT_PROVIDER_TYPE:\n        var provider = type;\n        return getContextName(provider._context) + '.Provider';\n\n      case REACT_FORWARD_REF_TYPE:\n        return getWrappedName(type, type.render, 'ForwardRef');\n\n      case REACT_MEMO_TYPE:\n        var outerName = type.displayName || null;\n\n        if (outerName !== null) {\n          return outerName;\n        }\n\n        return getComponentNameFromType(type.type) || 'Memo';\n\n      case REACT_LAZY_TYPE:\n        {\n          var lazyComponent = type;\n          var payload = lazyComponent._payload;\n          var init = lazyComponent._init;\n\n          try {\n            return getComponentNameFromType(init(payload));\n          } catch (x) {\n            return null;\n          }\n        }\n\n      // eslint-disable-next-line no-fallthrough\n    }\n  }\n\n  return null;\n}\n\nvar hasOwnProperty = Object.prototype.hasOwnProperty;\n\nvar RESERVED_PROPS = {\n  key: true,\n  ref: true,\n  __self: true,\n  __source: true\n};\nvar specialPropKeyWarningShown, specialPropRefWarningShown, didWarnAboutStringRefs;\n\n{\n  didWarnAboutStringRefs = {};\n}\n\nfunction hasValidRef(config) {\n  {\n    if (hasOwnProperty.call(config, 'ref')) {\n      var getter = Object.getOwnPropertyDescriptor(config, 'ref').get;\n\n      if (getter && getter.isReactWarning) {\n        return false;\n      }\n    }\n  }\n\n  return config.ref !== undefined;\n}\n\nfunction hasValidKey(config) {\n  {\n    if (hasOwnProperty.call(config, 'key')) {\n      var getter = Object.getOwnPropertyDescriptor(config, 'key').get;\n\n      if (getter && getter.isReactWarning) {\n        return false;\n      }\n    }\n  }\n\n  return config.key !== undefined;\n}\n\nfunction defineKeyPropWarningGetter(props, displayName) {\n  var warnAboutAccessingKey = function () {\n    {\n      if (!specialPropKeyWarningShown) {\n        specialPropKeyWarningShown = true;\n\n        error('%s: `key` is not a prop. Trying to access it will result ' + 'in `undefined` being returned. If you need to access the same ' + 'value within the child component, you should pass it as a different ' + 'prop. (https://reactjs.org/link/special-props)', displayName);\n      }\n    }\n  };\n\n  warnAboutAccessingKey.isReactWarning = true;\n  Object.defineProperty(props, 'key', {\n    get: warnAboutAccessingKey,\n    configurable: true\n  });\n}\n\nfunction defineRefPropWarningGetter(props, displayName) {\n  var warnAboutAccessingRef = function () {\n    {\n      if (!specialPropRefWarningShown) {\n        specialPropRefWarningShown = true;\n\n        error('%s: `ref` is not a prop. Trying to access it will result ' + 'in `undefined` being returned. If you need to access the same ' + 'value within the child component, you should pass it as a different ' + 'prop. (https://reactjs.org/link/special-props)', displayName);\n      }\n    }\n  };\n\n  warnAboutAccessingRef.isReactWarning = true;\n  Object.defineProperty(props, 'ref', {\n    get: warnAboutAccessingRef,\n    configurable: true\n  });\n}\n\nfunction warnIfStringRefCannotBeAutoConverted(config) {\n  {\n    if (typeof config.ref === 'string' && ReactCurrentOwner.current && config.__self && ReactCurrentOwner.current.stateNode !== config.__self) {\n      var componentName = getComponentNameFromType(ReactCurrentOwner.current.type);\n\n      if (!didWarnAboutStringRefs[componentName]) {\n        error('Component \"%s\" contains the string ref \"%s\". ' + 'Support for string refs will be removed in a future major release. ' + 'This case cannot be automatically converted to an arrow function. ' + 'We ask you to manually fix this case by using useRef() or createRef() instead. ' + 'Learn more about using refs safely here: ' + 'https://reactjs.org/link/strict-mode-string-ref', componentName, config.ref);\n\n        didWarnAboutStringRefs[componentName] = true;\n      }\n    }\n  }\n}\n/**\n * Factory method to create a new React element. This no longer adheres to\n * the class pattern, so do not use new to call it. Also, instanceof check\n * will not work. Instead test $$typeof field against Symbol.for('react.element') to check\n * if something is a React Element.\n *\n * @param {*} type\n * @param {*} props\n * @param {*} key\n * @param {string|object} ref\n * @param {*} owner\n * @param {*} self A *temporary* helper to detect places where `this` is\n * different from the `owner` when React.createElement is called, so that we\n * can warn. We want to get rid of owner and replace string `ref`s with arrow\n * functions, and as long as `this` and owner are the same, there will be no\n * change in behavior.\n * @param {*} source An annotation object (added by a transpiler or otherwise)\n * indicating filename, line number, and/or other information.\n * @internal\n */\n\n\nvar ReactElement = function (type, key, ref, self, source, owner, props) {\n  var element = {\n    // This tag allows us to uniquely identify this as a React Element\n    $$typeof: REACT_ELEMENT_TYPE,\n    // Built-in properties that belong on the element\n    type: type,\n    key: key,\n    ref: ref,\n    props: props,\n    // Record the component responsible for creating this element.\n    _owner: owner\n  };\n\n  {\n    // The validation flag is currently mutative. We put it on\n    // an external backing store so that we can freeze the whole object.\n    // This can be replaced with a WeakMap once they are implemented in\n    // commonly used development environments.\n    element._store = {}; // To make comparing ReactElements easier for testing purposes, we make\n    // the validation flag non-enumerable (where possible, which should\n    // include every environment we run tests in), so the test framework\n    // ignores it.\n\n    Object.defineProperty(element._store, 'validated', {\n      configurable: false,\n      enumerable: false,\n      writable: true,\n      value: false\n    }); // self and source are DEV only properties.\n\n    Object.defineProperty(element, '_self', {\n      configurable: false,\n      enumerable: false,\n      writable: false,\n      value: self\n    }); // Two elements created in two different places should be considered\n    // equal for testing purposes and therefore we hide it from enumeration.\n\n    Object.defineProperty(element, '_source', {\n      configurable: false,\n      enumerable: false,\n      writable: false,\n      value: source\n    });\n\n    if (Object.freeze) {\n      Object.freeze(element.props);\n      Object.freeze(element);\n    }\n  }\n\n  return element;\n};\n/**\n * Create and return a new ReactElement of the given type.\n * See https://reactjs.org/docs/react-api.html#createelement\n */\n\nfunction createElement(type, config, children) {\n  var propName; // Reserved names are extracted\n\n  var props = {};\n  var key = null;\n  var ref = null;\n  var self = null;\n  var source = null;\n\n  if (config != null) {\n    if (hasValidRef(config)) {\n      ref = config.ref;\n\n      {\n        warnIfStringRefCannotBeAutoConverted(config);\n      }\n    }\n\n    if (hasValidKey(config)) {\n      {\n        checkKeyStringCoercion(config.key);\n      }\n\n      key = '' + config.key;\n    }\n\n    self = config.__self === undefined ? null : config.__self;\n    source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n    for (propName in config) {\n      if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n        props[propName] = config[propName];\n      }\n    }\n  } // Children can be more than one argument, and those are transferred onto\n  // the newly allocated props object.\n\n\n  var childrenLength = arguments.length - 2;\n\n  if (childrenLength === 1) {\n    props.children = children;\n  } else if (childrenLength > 1) {\n    var childArray = Array(childrenLength);\n\n    for (var i = 0; i < childrenLength; i++) {\n      childArray[i] = arguments[i + 2];\n    }\n\n    {\n      if (Object.freeze) {\n        Object.freeze(childArray);\n      }\n    }\n\n    props.children = childArray;\n  } // Resolve default props\n\n\n  if (type && type.defaultProps) {\n    var defaultProps = type.defaultProps;\n\n    for (propName in defaultProps) {\n      if (props[propName] === undefined) {\n        props[propName] = defaultProps[propName];\n      }\n    }\n  }\n\n  {\n    if (key || ref) {\n      var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n      if (key) {\n        defineKeyPropWarningGetter(props, displayName);\n      }\n\n      if (ref) {\n        defineRefPropWarningGetter(props, displayName);\n      }\n    }\n  }\n\n  return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}\nfunction cloneAndReplaceKey(oldElement, newKey) {\n  var newElement = ReactElement(oldElement.type, newKey, oldElement.ref, oldElement._self, oldElement._source, oldElement._owner, oldElement.props);\n  return newElement;\n}\n/**\n * Clone and return a new ReactElement using element as the starting point.\n * See https://reactjs.org/docs/react-api.html#cloneelement\n */\n\nfunction cloneElement(element, config, children) {\n  if (element === null || element === undefined) {\n    throw new Error(\"React.cloneElement(...): The argument must be a React element, but you passed \" + element + \".\");\n  }\n\n  var propName; // Original props are copied\n\n  var props = assign({}, element.props); // Reserved names are extracted\n\n  var key = element.key;\n  var ref = element.ref; // Self is preserved since the owner is preserved.\n\n  var self = element._self; // Source is preserved since cloneElement is unlikely to be targeted by a\n  // transpiler, and the original source is probably a better indicator of the\n  // true owner.\n\n  var source = element._source; // Owner will be preserved, unless ref is overridden\n\n  var owner = element._owner;\n\n  if (config != null) {\n    if (hasValidRef(config)) {\n      // Silently steal the ref from the parent.\n      ref = config.ref;\n      owner = ReactCurrentOwner.current;\n    }\n\n    if (hasValidKey(config)) {\n      {\n        checkKeyStringCoercion(config.key);\n      }\n\n      key = '' + config.key;\n    } // Remaining properties override existing props\n\n\n    var defaultProps;\n\n    if (element.type && element.type.defaultProps) {\n      defaultProps = element.type.defaultProps;\n    }\n\n    for (propName in config) {\n      if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n        if (config[propName] === undefined && defaultProps !== undefined) {\n          // Resolve default props\n          props[propName] = defaultProps[propName];\n        } else {\n          props[propName] = config[propName];\n        }\n      }\n    }\n  } // Children can be more than one argument, and those are transferred onto\n  // the newly allocated props object.\n\n\n  var childrenLength = arguments.length - 2;\n\n  if (childrenLength === 1) {\n    props.children = children;\n  } else if (childrenLength > 1) {\n    var childArray = Array(childrenLength);\n\n    for (var i = 0; i < childrenLength; i++) {\n      childArray[i] = arguments[i + 2];\n    }\n\n    props.children = childArray;\n  }\n\n  return ReactElement(element.type, key, ref, self, source, owner, props);\n}\n/**\n * Verifies the object is a ReactElement.\n * See https://reactjs.org/docs/react-api.html#isvalidelement\n * @param {?object} object\n * @return {boolean} True if `object` is a ReactElement.\n * @final\n */\n\nfunction isValidElement(object) {\n  return typeof object === 'object' && object !== null && object.$$typeof === REACT_ELEMENT_TYPE;\n}\n\nvar SEPARATOR = '.';\nvar SUBSEPARATOR = ':';\n/**\n * Escape and wrap key so it is safe to use as a reactid\n *\n * @param {string} key to be escaped.\n * @return {string} the escaped key.\n */\n\nfunction escape(key) {\n  var escapeRegex = /[=:]/g;\n  var escaperLookup = {\n    '=': '=0',\n    ':': '=2'\n  };\n  var escapedString = key.replace(escapeRegex, function (match) {\n    return escaperLookup[match];\n  });\n  return '$' + escapedString;\n}\n/**\n * TODO: Test that a single child and an array with one item have the same key\n * pattern.\n */\n\n\nvar didWarnAboutMaps = false;\nvar userProvidedKeyEscapeRegex = /\\/+/g;\n\nfunction escapeUserProvidedKey(text) {\n  return text.replace(userProvidedKeyEscapeRegex, '$&/');\n}\n/**\n * Generate a key string that identifies a element within a set.\n *\n * @param {*} element A element that could contain a manual key.\n * @param {number} index Index that is used if a manual key is not provided.\n * @return {string}\n */\n\n\nfunction getElementKey(element, index) {\n  // Do some typechecking here since we call this blindly. We want to ensure\n  // that we don't block potential future ES APIs.\n  if (typeof element === 'object' && element !== null && element.key != null) {\n    // Explicit key\n    {\n      checkKeyStringCoercion(element.key);\n    }\n\n    return escape('' + element.key);\n  } // Implicit key determined by the index in the set\n\n\n  return index.toString(36);\n}\n\nfunction mapIntoArray(children, array, escapedPrefix, nameSoFar, callback) {\n  var type = typeof children;\n\n  if (type === 'undefined' || type === 'boolean') {\n    // All of the above are perceived as null.\n    children = null;\n  }\n\n  var invokeCallback = false;\n\n  if (children === null) {\n    invokeCallback = true;\n  } else {\n    switch (type) {\n      case 'string':\n      case 'number':\n        invokeCallback = true;\n        break;\n\n      case 'object':\n        switch (children.$$typeof) {\n          case REACT_ELEMENT_TYPE:\n          case REACT_PORTAL_TYPE:\n            invokeCallback = true;\n        }\n\n    }\n  }\n\n  if (invokeCallback) {\n    var _child = children;\n    var mappedChild = callback(_child); // If it's the only child, treat the name as if it was wrapped in an array\n    // so that it's consistent if the number of children grows:\n\n    var childKey = nameSoFar === '' ? SEPARATOR + getElementKey(_child, 0) : nameSoFar;\n\n    if (isArray(mappedChild)) {\n      var escapedChildKey = '';\n\n      if (childKey != null) {\n        escapedChildKey = escapeUserProvidedKey(childKey) + '/';\n      }\n\n      mapIntoArray(mappedChild, array, escapedChildKey, '', function (c) {\n        return c;\n      });\n    } else if (mappedChild != null) {\n      if (isValidElement(mappedChild)) {\n        {\n          // The `if` statement here prevents auto-disabling of the safe\n          // coercion ESLint rule, so we must manually disable it below.\n          // $FlowFixMe Flow incorrectly thinks React.Portal doesn't have a key\n          if (mappedChild.key && (!_child || _child.key !== mappedChild.key)) {\n            checkKeyStringCoercion(mappedChild.key);\n          }\n        }\n\n        mappedChild = cloneAndReplaceKey(mappedChild, // Keep both the (mapped) and old keys if they differ, just as\n        // traverseAllChildren used to do for objects as children\n        escapedPrefix + ( // $FlowFixMe Flow incorrectly thinks React.Portal doesn't have a key\n        mappedChild.key && (!_child || _child.key !== mappedChild.key) ? // $FlowFixMe Flow incorrectly thinks existing element's key can be a number\n        // eslint-disable-next-line react-internal/safe-string-coercion\n        escapeUserProvidedKey('' + mappedChild.key) + '/' : '') + childKey);\n      }\n\n      array.push(mappedChild);\n    }\n\n    return 1;\n  }\n\n  var child;\n  var nextName;\n  var subtreeCount = 0; // Count of children found in the current subtree.\n\n  var nextNamePrefix = nameSoFar === '' ? SEPARATOR : nameSoFar + SUBSEPARATOR;\n\n  if (isArray(children)) {\n    for (var i = 0; i < children.length; i++) {\n      child = children[i];\n      nextName = nextNamePrefix + getElementKey(child, i);\n      subtreeCount += mapIntoArray(child, array, escapedPrefix, nextName, callback);\n    }\n  } else {\n    var iteratorFn = getIteratorFn(children);\n\n    if (typeof iteratorFn === 'function') {\n      var iterableChildren = children;\n\n      {\n        // Warn about using Maps as children\n        if (iteratorFn === iterableChildren.entries) {\n          if (!didWarnAboutMaps) {\n            warn('Using Maps as children is not supported. ' + 'Use an array of keyed ReactElements instead.');\n          }\n\n          didWarnAboutMaps = true;\n        }\n      }\n\n      var iterator = iteratorFn.call(iterableChildren);\n      var step;\n      var ii = 0;\n\n      while (!(step = iterator.next()).done) {\n        child = step.value;\n        nextName = nextNamePrefix + getElementKey(child, ii++);\n        subtreeCount += mapIntoArray(child, array, escapedPrefix, nextName, callback);\n      }\n    } else if (type === 'object') {\n      // eslint-disable-next-line react-internal/safe-string-coercion\n      var childrenString = String(children);\n      throw new Error(\"Objects are not valid as a React child (found: \" + (childrenString === '[object Object]' ? 'object with keys {' + Object.keys(children).join(', ') + '}' : childrenString) + \"). \" + 'If you meant to render a collection of children, use an array ' + 'instead.');\n    }\n  }\n\n  return subtreeCount;\n}\n\n/**\n * Maps children that are typically specified as `props.children`.\n *\n * See https://reactjs.org/docs/react-api.html#reactchildrenmap\n *\n * The provided mapFunction(child, index) will be called for each\n * leaf child.\n *\n * @param {?*} children Children tree container.\n * @param {function(*, int)} func The map function.\n * @param {*} context Context for mapFunction.\n * @return {object} Object containing the ordered map of results.\n */\nfunction mapChildren(children, func, context) {\n  if (children == null) {\n    return children;\n  }\n\n  var result = [];\n  var count = 0;\n  mapIntoArray(children, result, '', '', function (child) {\n    return func.call(context, child, count++);\n  });\n  return result;\n}\n/**\n * Count the number of children that are typically specified as\n * `props.children`.\n *\n * See https://reactjs.org/docs/react-api.html#reactchildrencount\n *\n * @param {?*} children Children tree container.\n * @return {number} The number of children.\n */\n\n\nfunction countChildren(children) {\n  var n = 0;\n  mapChildren(children, function () {\n    n++; // Don't return anything\n  });\n  return n;\n}\n\n/**\n * Iterates through children that are typically specified as `props.children`.\n *\n * See https://reactjs.org/docs/react-api.html#reactchildrenforeach\n *\n * The provided forEachFunc(child, index) will be called for each\n * leaf child.\n *\n * @param {?*} children Children tree container.\n * @param {function(*, int)} forEachFunc\n * @param {*} forEachContext Context for forEachContext.\n */\nfunction forEachChildren(children, forEachFunc, forEachContext) {\n  mapChildren(children, function () {\n    forEachFunc.apply(this, arguments); // Don't return anything.\n  }, forEachContext);\n}\n/**\n * Flatten a children object (typically specified as `props.children`) and\n * return an array with appropriately re-keyed children.\n *\n * See https://reactjs.org/docs/react-api.html#reactchildrentoarray\n */\n\n\nfunction toArray(children) {\n  return mapChildren(children, function (child) {\n    return child;\n  }) || [];\n}\n/**\n * Returns the first child in a collection of children and verifies that there\n * is only one child in the collection.\n *\n * See https://reactjs.org/docs/react-api.html#reactchildrenonly\n *\n * The current implementation of this function assumes that a single child gets\n * passed without a wrapper, but the purpose of this helper function is to\n * abstract away the particular structure of children.\n *\n * @param {?object} children Child collection structure.\n * @return {ReactElement} The first and only `ReactElement` contained in the\n * structure.\n */\n\n\nfunction onlyChild(children) {\n  if (!isValidElement(children)) {\n    throw new Error('React.Children.only expected to receive a single React element child.');\n  }\n\n  return children;\n}\n\nfunction createContext(defaultValue) {\n  // TODO: Second argument used to be an optional `calculateChangedBits`\n  // function. Warn to reserve for future use?\n  var context = {\n    $$typeof: REACT_CONTEXT_TYPE,\n    // As a workaround to support multiple concurrent renderers, we categorize\n    // some renderers as primary and others as secondary. We only expect\n    // there to be two concurrent renderers at most: React Native (primary) and\n    // Fabric (secondary); React DOM (primary) and React ART (secondary).\n    // Secondary renderers store their context values on separate fields.\n    _currentValue: defaultValue,\n    _currentValue2: defaultValue,\n    // Used to track how many concurrent renderers this context currently\n    // supports within in a single renderer. Such as parallel server rendering.\n    _threadCount: 0,\n    // These are circular\n    Provider: null,\n    Consumer: null,\n    // Add these to use same hidden class in VM as ServerContext\n    _defaultValue: null,\n    _globalName: null\n  };\n  context.Provider = {\n    $$typeof: REACT_PROVIDER_TYPE,\n    _context: context\n  };\n  var hasWarnedAboutUsingNestedContextConsumers = false;\n  var hasWarnedAboutUsingConsumerProvider = false;\n  var hasWarnedAboutDisplayNameOnConsumer = false;\n\n  {\n    // A separate object, but proxies back to the original context object for\n    // backwards compatibility. It has a different $$typeof, so we can properly\n    // warn for the incorrect usage of Context as a Consumer.\n    var Consumer = {\n      $$typeof: REACT_CONTEXT_TYPE,\n      _context: context\n    }; // $FlowFixMe: Flow complains about not setting a value, which is intentional here\n\n    Object.defineProperties(Consumer, {\n      Provider: {\n        get: function () {\n          if (!hasWarnedAboutUsingConsumerProvider) {\n            hasWarnedAboutUsingConsumerProvider = true;\n\n            error('Rendering <Context.Consumer.Provider> is not supported and will be removed in ' + 'a future major release. Did you mean to render <Context.Provider> instead?');\n          }\n\n          return context.Provider;\n        },\n        set: function (_Provider) {\n          context.Provider = _Provider;\n        }\n      },\n      _currentValue: {\n        get: function () {\n          return context._currentValue;\n        },\n        set: function (_currentValue) {\n          context._currentValue = _currentValue;\n        }\n      },\n      _currentValue2: {\n        get: function () {\n          return context._currentValue2;\n        },\n        set: function (_currentValue2) {\n          context._currentValue2 = _currentValue2;\n        }\n      },\n      _threadCount: {\n        get: function () {\n          return context._threadCount;\n        },\n        set: function (_threadCount) {\n          context._threadCount = _threadCount;\n        }\n      },\n      Consumer: {\n        get: function () {\n          if (!hasWarnedAboutUsingNestedContextConsumers) {\n            hasWarnedAboutUsingNestedContextConsumers = true;\n\n            error('Rendering <Context.Consumer.Consumer> is not supported and will be removed in ' + 'a future major release. Did you mean to render <Context.Consumer> instead?');\n          }\n\n          return context.Consumer;\n        }\n      },\n      displayName: {\n        get: function () {\n          return context.displayName;\n        },\n        set: function (displayName) {\n          if (!hasWarnedAboutDisplayNameOnConsumer) {\n            warn('Setting `displayName` on Context.Consumer has no effect. ' + \"You should set it directly on the context with Context.displayName = '%s'.\", displayName);\n\n            hasWarnedAboutDisplayNameOnConsumer = true;\n          }\n        }\n      }\n    }); // $FlowFixMe: Flow complains about missing properties because it doesn't understand defineProperty\n\n    context.Consumer = Consumer;\n  }\n\n  {\n    context._currentRenderer = null;\n    context._currentRenderer2 = null;\n  }\n\n  return context;\n}\n\nvar Uninitialized = -1;\nvar Pending = 0;\nvar Resolved = 1;\nvar Rejected = 2;\n\nfunction lazyInitializer(payload) {\n  if (payload._status === Uninitialized) {\n    var ctor = payload._result;\n    var thenable = ctor(); // Transition to the next state.\n    // This might throw either because it's missing or throws. If so, we treat it\n    // as still uninitialized and try again next time. Which is the same as what\n    // happens if the ctor or any wrappers processing the ctor throws. This might\n    // end up fixing it if the resolution was a concurrency bug.\n\n    thenable.then(function (moduleObject) {\n      if (payload._status === Pending || payload._status === Uninitialized) {\n        // Transition to the next state.\n        var resolved = payload;\n        resolved._status = Resolved;\n        resolved._result = moduleObject;\n      }\n    }, function (error) {\n      if (payload._status === Pending || payload._status === Uninitialized) {\n        // Transition to the next state.\n        var rejected = payload;\n        rejected._status = Rejected;\n        rejected._result = error;\n      }\n    });\n\n    if (payload._status === Uninitialized) {\n      // In case, we're still uninitialized, then we're waiting for the thenable\n      // to resolve. Set it as pending in the meantime.\n      var pending = payload;\n      pending._status = Pending;\n      pending._result = thenable;\n    }\n  }\n\n  if (payload._status === Resolved) {\n    var moduleObject = payload._result;\n\n    {\n      if (moduleObject === undefined) {\n        error('lazy: Expected the result of a dynamic imp' + 'ort() call. ' + 'Instead received: %s\\n\\nYour code should look like: \\n  ' + // Break up imports to avoid accidentally parsing them as dependencies.\n        'const MyComponent = lazy(() => imp' + \"ort('./MyComponent'))\\n\\n\" + 'Did you accidentally put curly braces around the import?', moduleObject);\n      }\n    }\n\n    {\n      if (!('default' in moduleObject)) {\n        error('lazy: Expected the result of a dynamic imp' + 'ort() call. ' + 'Instead received: %s\\n\\nYour code should look like: \\n  ' + // Break up imports to avoid accidentally parsing them as dependencies.\n        'const MyComponent = lazy(() => imp' + \"ort('./MyComponent'))\", moduleObject);\n      }\n    }\n\n    return moduleObject.default;\n  } else {\n    throw payload._result;\n  }\n}\n\nfunction lazy(ctor) {\n  var payload = {\n    // We use these fields to store the result.\n    _status: Uninitialized,\n    _result: ctor\n  };\n  var lazyType = {\n    $$typeof: REACT_LAZY_TYPE,\n    _payload: payload,\n    _init: lazyInitializer\n  };\n\n  {\n    // In production, this would just set it on the object.\n    var defaultProps;\n    var propTypes; // $FlowFixMe\n\n    Object.defineProperties(lazyType, {\n      defaultProps: {\n        configurable: true,\n        get: function () {\n          return defaultProps;\n        },\n        set: function (newDefaultProps) {\n          error('React.lazy(...): It is not supported to assign `defaultProps` to ' + 'a lazy component import. Either specify them where the component ' + 'is defined, or create a wrapping component around it.');\n\n          defaultProps = newDefaultProps; // Match production behavior more closely:\n          // $FlowFixMe\n\n          Object.defineProperty(lazyType, 'defaultProps', {\n            enumerable: true\n          });\n        }\n      },\n      propTypes: {\n        configurable: true,\n        get: function () {\n          return propTypes;\n        },\n        set: function (newPropTypes) {\n          error('React.lazy(...): It is not supported to assign `propTypes` to ' + 'a lazy component import. Either specify them where the component ' + 'is defined, or create a wrapping component around it.');\n\n          propTypes = newPropTypes; // Match production behavior more closely:\n          // $FlowFixMe\n\n          Object.defineProperty(lazyType, 'propTypes', {\n            enumerable: true\n          });\n        }\n      }\n    });\n  }\n\n  return lazyType;\n}\n\nfunction forwardRef(render) {\n  {\n    if (render != null && render.$$typeof === REACT_MEMO_TYPE) {\n      error('forwardRef requires a render function but received a `memo` ' + 'component. Instead of forwardRef(memo(...)), use ' + 'memo(forwardRef(...)).');\n    } else if (typeof render !== 'function') {\n      error('forwardRef requires a render function but was given %s.', render === null ? 'null' : typeof render);\n    } else {\n      if (render.length !== 0 && render.length !== 2) {\n        error('forwardRef render functions accept exactly two parameters: props and ref. %s', render.length === 1 ? 'Did you forget to use the ref parameter?' : 'Any additional parameter will be undefined.');\n      }\n    }\n\n    if (render != null) {\n      if (render.defaultProps != null || render.propTypes != null) {\n        error('forwardRef render functions do not support propTypes or defaultProps. ' + 'Did you accidentally pass a React component?');\n      }\n    }\n  }\n\n  var elementType = {\n    $$typeof: REACT_FORWARD_REF_TYPE,\n    render: render\n  };\n\n  {\n    var ownName;\n    Object.defineProperty(elementType, 'displayName', {\n      enumerable: false,\n      configurable: true,\n      get: function () {\n        return ownName;\n      },\n      set: function (name) {\n        ownName = name; // The inner component shouldn't inherit this display name in most cases,\n        // because the component may be used elsewhere.\n        // But it's nice for anonymous functions to inherit the name,\n        // so that our component-stack generation logic will display their frames.\n        // An anonymous function generally suggests a pattern like:\n        //   React.forwardRef((props, ref) => {...});\n        // This kind of inner function is not used elsewhere so the side effect is okay.\n\n        if (!render.name && !render.displayName) {\n          render.displayName = name;\n        }\n      }\n    });\n  }\n\n  return elementType;\n}\n\nvar REACT_MODULE_REFERENCE;\n\n{\n  REACT_MODULE_REFERENCE = Symbol.for('react.module.reference');\n}\n\nfunction isValidElementType(type) {\n  if (typeof type === 'string' || typeof type === 'function') {\n    return true;\n  } // Note: typeof might be other than 'symbol' or 'number' (e.g. if it's a polyfill).\n\n\n  if (type === REACT_FRAGMENT_TYPE || type === REACT_PROFILER_TYPE || enableDebugTracing  || type === REACT_STRICT_MODE_TYPE || type === REACT_SUSPENSE_TYPE || type === REACT_SUSPENSE_LIST_TYPE || enableLegacyHidden  || type === REACT_OFFSCREEN_TYPE || enableScopeAPI  || enableCacheElement  || enableTransitionTracing ) {\n    return true;\n  }\n\n  if (typeof type === 'object' && type !== null) {\n    if (type.$$typeof === REACT_LAZY_TYPE || type.$$typeof === REACT_MEMO_TYPE || type.$$typeof === REACT_PROVIDER_TYPE || type.$$typeof === REACT_CONTEXT_TYPE || type.$$typeof === REACT_FORWARD_REF_TYPE || // This needs to include all possible module reference object\n    // types supported by any Flight configuration anywhere since\n    // we don't know which Flight build this will end up being used\n    // with.\n    type.$$typeof === REACT_MODULE_REFERENCE || type.getModuleId !== undefined) {\n      return true;\n    }\n  }\n\n  return false;\n}\n\nfunction memo(type, compare) {\n  {\n    if (!isValidElementType(type)) {\n      error('memo: The first argument must be a component. Instead ' + 'received: %s', type === null ? 'null' : typeof type);\n    }\n  }\n\n  var elementType = {\n    $$typeof: REACT_MEMO_TYPE,\n    type: type,\n    compare: compare === undefined ? null : compare\n  };\n\n  {\n    var ownName;\n    Object.defineProperty(elementType, 'displayName', {\n      enumerable: false,\n      configurable: true,\n      get: function () {\n        return ownName;\n      },\n      set: function (name) {\n        ownName = name; // The inner component shouldn't inherit this display name in most cases,\n        // because the component may be used elsewhere.\n        // But it's nice for anonymous functions to inherit the name,\n        // so that our component-stack generation logic will display their frames.\n        // An anonymous function generally suggests a pattern like:\n        //   React.memo((props) => {...});\n        // This kind of inner function is not used elsewhere so the side effect is okay.\n\n        if (!type.name && !type.displayName) {\n          type.displayName = name;\n        }\n      }\n    });\n  }\n\n  return elementType;\n}\n\nfunction resolveDispatcher() {\n  var dispatcher = ReactCurrentDispatcher.current;\n\n  {\n    if (dispatcher === null) {\n      error('Invalid hook call. Hooks can only be called inside of the body of a function component. This could happen for' + ' one of the following reasons:\\n' + '1. You might have mismatching versions of React and the renderer (such as React DOM)\\n' + '2. You might be breaking the Rules of Hooks\\n' + '3. You might have more than one copy of React in the same app\\n' + 'See https://reactjs.org/link/invalid-hook-call for tips about how to debug and fix this problem.');\n    }\n  } // Will result in a null access error if accessed outside render phase. We\n  // intentionally don't throw our own error because this is in a hot path.\n  // Also helps ensure this is inlined.\n\n\n  return dispatcher;\n}\nfunction useContext(Context) {\n  var dispatcher = resolveDispatcher();\n\n  {\n    // TODO: add a more generic warning for invalid values.\n    if (Context._context !== undefined) {\n      var realContext = Context._context; // Don't deduplicate because this legitimately causes bugs\n      // and nobody should be using this in existing code.\n\n      if (realContext.Consumer === Context) {\n        error('Calling useContext(Context.Consumer) is not supported, may cause bugs, and will be ' + 'removed in a future major release. Did you mean to call useContext(Context) instead?');\n      } else if (realContext.Provider === Context) {\n        error('Calling useContext(Context.Provider) is not supported. ' + 'Did you mean to call useContext(Context) instead?');\n      }\n    }\n  }\n\n  return dispatcher.useContext(Context);\n}\nfunction useState(initialState) {\n  var dispatcher = resolveDispatcher();\n  return dispatcher.useState(initialState);\n}\nfunction useReducer(reducer, initialArg, init) {\n  var dispatcher = resolveDispatcher();\n  return dispatcher.useReducer(reducer, initialArg, init);\n}\nfunction useRef(initialValue) {\n  var dispatcher = resolveDispatcher();\n  return dispatcher.useRef(initialValue);\n}\nfunction useEffect(create, deps) {\n  var dispatcher = resolveDispatcher();\n  return dispatcher.useEffect(create, deps);\n}\nfunction useInsertionEffect(create, deps) {\n  var dispatcher = resolveDispatcher();\n  return dispatcher.useInsertionEffect(create, deps);\n}\nfunction useLayoutEffect(create, deps) {\n  var dispatcher = resolveDispatcher();\n  return dispatcher.useLayoutEffect(create, deps);\n}\nfunction useCallback(callback, deps) {\n  var dispatcher = resolveDispatcher();\n  return dispatcher.useCallback(callback, deps);\n}\nfunction useMemo(create, deps) {\n  var dispatcher = resolveDispatcher();\n  return dispatcher.useMemo(create, deps);\n}\nfunction useImperativeHandle(ref, create, deps) {\n  var dispatcher = resolveDispatcher();\n  return dispatcher.useImperativeHandle(ref, create, deps);\n}\nfunction useDebugValue(value, formatterFn) {\n  {\n    var dispatcher = resolveDispatcher();\n    return dispatcher.useDebugValue(value, formatterFn);\n  }\n}\nfunction useTransition() {\n  var dispatcher = resolveDispatcher();\n  return dispatcher.useTransition();\n}\nfunction useDeferredValue(value) {\n  var dispatcher = resolveDispatcher();\n  return dispatcher.useDeferredValue(value);\n}\nfunction useId() {\n  var dispatcher = resolveDispatcher();\n  return dispatcher.useId();\n}\nfunction useSyncExternalStore(subscribe, getSnapshot, getServerSnapshot) {\n  var dispatcher = resolveDispatcher();\n  return dispatcher.useSyncExternalStore(subscribe, getSnapshot, getServerSnapshot);\n}\n\n// Helpers to patch console.logs to avoid logging during side-effect free\n// replaying on render function. This currently only patches the object\n// lazily which won't cover if the log function was extracted eagerly.\n// We could also eagerly patch the method.\nvar disabledDepth = 0;\nvar prevLog;\nvar prevInfo;\nvar prevWarn;\nvar prevError;\nvar prevGroup;\nvar prevGroupCollapsed;\nvar prevGroupEnd;\n\nfunction disabledLog() {}\n\ndisabledLog.__reactDisabledLog = true;\nfunction disableLogs() {\n  {\n    if (disabledDepth === 0) {\n      /* eslint-disable react-internal/no-production-logging */\n      prevLog = console.log;\n      prevInfo = console.info;\n      prevWarn = console.warn;\n      prevError = console.error;\n      prevGroup = console.group;\n      prevGroupCollapsed = console.groupCollapsed;\n      prevGroupEnd = console.groupEnd; // https://github.com/facebook/react/issues/19099\n\n      var props = {\n        configurable: true,\n        enumerable: true,\n        value: disabledLog,\n        writable: true\n      }; // $FlowFixMe Flow thinks console is immutable.\n\n      Object.defineProperties(console, {\n        info: props,\n        log: props,\n        warn: props,\n        error: props,\n        group: props,\n        groupCollapsed: props,\n        groupEnd: props\n      });\n      /* eslint-enable react-internal/no-production-logging */\n    }\n\n    disabledDepth++;\n  }\n}\nfunction reenableLogs() {\n  {\n    disabledDepth--;\n\n    if (disabledDepth === 0) {\n      /* eslint-disable react-internal/no-production-logging */\n      var props = {\n        configurable: true,\n        enumerable: true,\n        writable: true\n      }; // $FlowFixMe Flow thinks console is immutable.\n\n      Object.defineProperties(console, {\n        log: assign({}, props, {\n          value: prevLog\n        }),\n        info: assign({}, props, {\n          value: prevInfo\n        }),\n        warn: assign({}, props, {\n          value: prevWarn\n        }),\n        error: assign({}, props, {\n          value: prevError\n        }),\n        group: assign({}, props, {\n          value: prevGroup\n        }),\n        groupCollapsed: assign({}, props, {\n          value: prevGroupCollapsed\n        }),\n        groupEnd: assign({}, props, {\n          value: prevGroupEnd\n        })\n      });\n      /* eslint-enable react-internal/no-production-logging */\n    }\n\n    if (disabledDepth < 0) {\n      error('disabledDepth fell below zero. ' + 'This is a bug in React. Please file an issue.');\n    }\n  }\n}\n\nvar ReactCurrentDispatcher$1 = ReactSharedInternals.ReactCurrentDispatcher;\nvar prefix;\nfunction describeBuiltInComponentFrame(name, source, ownerFn) {\n  {\n    if (prefix === undefined) {\n      // Extract the VM specific prefix used by each line.\n      try {\n        throw Error();\n      } catch (x) {\n        var match = x.stack.trim().match(/\\n( *(at )?)/);\n        prefix = match && match[1] || '';\n      }\n    } // We use the prefix to ensure our stacks line up with native stack frames.\n\n\n    return '\\n' + prefix + name;\n  }\n}\nvar reentry = false;\nvar componentFrameCache;\n\n{\n  var PossiblyWeakMap = typeof WeakMap === 'function' ? WeakMap : Map;\n  componentFrameCache = new PossiblyWeakMap();\n}\n\nfunction describeNativeComponentFrame(fn, construct) {\n  // If something asked for a stack inside a fake render, it should get ignored.\n  if ( !fn || reentry) {\n    return '';\n  }\n\n  {\n    var frame = componentFrameCache.get(fn);\n\n    if (frame !== undefined) {\n      return frame;\n    }\n  }\n\n  var control;\n  reentry = true;\n  var previousPrepareStackTrace = Error.prepareStackTrace; // $FlowFixMe It does accept undefined.\n\n  Error.prepareStackTrace = undefined;\n  var previousDispatcher;\n\n  {\n    previousDispatcher = ReactCurrentDispatcher$1.current; // Set the dispatcher in DEV because this might be call in the render function\n    // for warnings.\n\n    ReactCurrentDispatcher$1.current = null;\n    disableLogs();\n  }\n\n  try {\n    // This should throw.\n    if (construct) {\n      // Something should be setting the props in the constructor.\n      var Fake = function () {\n        throw Error();\n      }; // $FlowFixMe\n\n\n      Object.defineProperty(Fake.prototype, 'props', {\n        set: function () {\n          // We use a throwing setter instead of frozen or non-writable props\n          // because that won't throw in a non-strict mode function.\n          throw Error();\n        }\n      });\n\n      if (typeof Reflect === 'object' && Reflect.construct) {\n        // We construct a different control for this case to include any extra\n        // frames added by the construct call.\n        try {\n          Reflect.construct(Fake, []);\n        } catch (x) {\n          control = x;\n        }\n\n        Reflect.construct(fn, [], Fake);\n      } else {\n        try {\n          Fake.call();\n        } catch (x) {\n          control = x;\n        }\n\n        fn.call(Fake.prototype);\n      }\n    } else {\n      try {\n        throw Error();\n      } catch (x) {\n        control = x;\n      }\n\n      fn();\n    }\n  } catch (sample) {\n    // This is inlined manually because closure doesn't do it for us.\n    if (sample && control && typeof sample.stack === 'string') {\n      // This extracts the first frame from the sample that isn't also in the control.\n      // Skipping one frame that we assume is the frame that calls the two.\n      var sampleLines = sample.stack.split('\\n');\n      var controlLines = control.stack.split('\\n');\n      var s = sampleLines.length - 1;\n      var c = controlLines.length - 1;\n\n      while (s >= 1 && c >= 0 && sampleLines[s] !== controlLines[c]) {\n        // We expect at least one stack frame to be shared.\n        // Typically this will be the root most one. However, stack frames may be\n        // cut off due to maximum stack limits. In this case, one maybe cut off\n        // earlier than the other. We assume that the sample is longer or the same\n        // and there for cut off earlier. So we should find the root most frame in\n        // the sample somewhere in the control.\n        c--;\n      }\n\n      for (; s >= 1 && c >= 0; s--, c--) {\n        // Next we find the first one that isn't the same which should be the\n        // frame that called our sample function and the control.\n        if (sampleLines[s] !== controlLines[c]) {\n          // In V8, the first line is describing the message but other VMs don't.\n          // If we're about to return the first line, and the control is also on the same\n          // line, that's a pretty good indicator that our sample threw at same line as\n          // the control. I.e. before we entered the sample frame. So we ignore this result.\n          // This can happen if you passed a class to function component, or non-function.\n          if (s !== 1 || c !== 1) {\n            do {\n              s--;\n              c--; // We may still have similar intermediate frames from the construct call.\n              // The next one that isn't the same should be our match though.\n\n              if (c < 0 || sampleLines[s] !== controlLines[c]) {\n                // V8 adds a \"new\" prefix for native classes. Let's remove it to make it prettier.\n                var _frame = '\\n' + sampleLines[s].replace(' at new ', ' at '); // If our component frame is labeled \"<anonymous>\"\n                // but we have a user-provided \"displayName\"\n                // splice it in to make the stack more readable.\n\n\n                if (fn.displayName && _frame.includes('<anonymous>')) {\n                  _frame = _frame.replace('<anonymous>', fn.displayName);\n                }\n\n                {\n                  if (typeof fn === 'function') {\n                    componentFrameCache.set(fn, _frame);\n                  }\n                } // Return the line we found.\n\n\n                return _frame;\n              }\n            } while (s >= 1 && c >= 0);\n          }\n\n          break;\n        }\n      }\n    }\n  } finally {\n    reentry = false;\n\n    {\n      ReactCurrentDispatcher$1.current = previousDispatcher;\n      reenableLogs();\n    }\n\n    Error.prepareStackTrace = previousPrepareStackTrace;\n  } // Fallback to just using the name if we couldn't make it throw.\n\n\n  var name = fn ? fn.displayName || fn.name : '';\n  var syntheticFrame = name ? describeBuiltInComponentFrame(name) : '';\n\n  {\n    if (typeof fn === 'function') {\n      componentFrameCache.set(fn, syntheticFrame);\n    }\n  }\n\n  return syntheticFrame;\n}\nfunction describeFunctionComponentFrame(fn, source, ownerFn) {\n  {\n    return describeNativeComponentFrame(fn, false);\n  }\n}\n\nfunction shouldConstruct(Component) {\n  var prototype = Component.prototype;\n  return !!(prototype && prototype.isReactComponent);\n}\n\nfunction describeUnknownElementTypeFrameInDEV(type, source, ownerFn) {\n\n  if (type == null) {\n    return '';\n  }\n\n  if (typeof type === 'function') {\n    {\n      return describeNativeComponentFrame(type, shouldConstruct(type));\n    }\n  }\n\n  if (typeof type === 'string') {\n    return describeBuiltInComponentFrame(type);\n  }\n\n  switch (type) {\n    case REACT_SUSPENSE_TYPE:\n      return describeBuiltInComponentFrame('Suspense');\n\n    case REACT_SUSPENSE_LIST_TYPE:\n      return describeBuiltInComponentFrame('SuspenseList');\n  }\n\n  if (typeof type === 'object') {\n    switch (type.$$typeof) {\n      case REACT_FORWARD_REF_TYPE:\n        return describeFunctionComponentFrame(type.render);\n\n      case REACT_MEMO_TYPE:\n        // Memo may contain any component type so we recursively resolve it.\n        return describeUnknownElementTypeFrameInDEV(type.type, source, ownerFn);\n\n      case REACT_LAZY_TYPE:\n        {\n          var lazyComponent = type;\n          var payload = lazyComponent._payload;\n          var init = lazyComponent._init;\n\n          try {\n            // Lazy may contain any component type so we recursively resolve it.\n            return describeUnknownElementTypeFrameInDEV(init(payload), source, ownerFn);\n          } catch (x) {}\n        }\n    }\n  }\n\n  return '';\n}\n\nvar loggedTypeFailures = {};\nvar ReactDebugCurrentFrame$1 = ReactSharedInternals.ReactDebugCurrentFrame;\n\nfunction setCurrentlyValidatingElement(element) {\n  {\n    if (element) {\n      var owner = element._owner;\n      var stack = describeUnknownElementTypeFrameInDEV(element.type, element._source, owner ? owner.type : null);\n      ReactDebugCurrentFrame$1.setExtraStackFrame(stack);\n    } else {\n      ReactDebugCurrentFrame$1.setExtraStackFrame(null);\n    }\n  }\n}\n\nfunction checkPropTypes(typeSpecs, values, location, componentName, element) {\n  {\n    // $FlowFixMe This is okay but Flow doesn't know it.\n    var has = Function.call.bind(hasOwnProperty);\n\n    for (var typeSpecName in typeSpecs) {\n      if (has(typeSpecs, typeSpecName)) {\n        var error$1 = void 0; // Prop type validation may throw. In case they do, we don't want to\n        // fail the render phase where it didn't fail before. So we log it.\n        // After these have been cleaned up, we'll let them throw.\n\n        try {\n          // This is intentionally an invariant that gets caught. It's the same\n          // behavior as without this statement except with a better message.\n          if (typeof typeSpecs[typeSpecName] !== 'function') {\n            // eslint-disable-next-line react-internal/prod-error-codes\n            var err = Error((componentName || 'React class') + ': ' + location + ' type `' + typeSpecName + '` is invalid; ' + 'it must be a function, usually from the `prop-types` package, but received `' + typeof typeSpecs[typeSpecName] + '`.' + 'This often happens because of typos such as `PropTypes.function` instead of `PropTypes.func`.');\n            err.name = 'Invariant Violation';\n            throw err;\n          }\n\n          error$1 = typeSpecs[typeSpecName](values, typeSpecName, componentName, location, null, 'SECRET_DO_NOT_PASS_THIS_OR_YOU_WILL_BE_FIRED');\n        } catch (ex) {\n          error$1 = ex;\n        }\n\n        if (error$1 && !(error$1 instanceof Error)) {\n          setCurrentlyValidatingElement(element);\n\n          error('%s: type specification of %s' + ' `%s` is invalid; the type checker ' + 'function must return `null` or an `Error` but returned a %s. ' + 'You may have forgotten to pass an argument to the type checker ' + 'creator (arrayOf, instanceOf, objectOf, oneOf, oneOfType, and ' + 'shape all require an argument).', componentName || 'React class', location, typeSpecName, typeof error$1);\n\n          setCurrentlyValidatingElement(null);\n        }\n\n        if (error$1 instanceof Error && !(error$1.message in loggedTypeFailures)) {\n          // Only monitor this failure once because there tends to be a lot of the\n          // same error.\n          loggedTypeFailures[error$1.message] = true;\n          setCurrentlyValidatingElement(element);\n\n          error('Failed %s type: %s', location, error$1.message);\n\n          setCurrentlyValidatingElement(null);\n        }\n      }\n    }\n  }\n}\n\nfunction setCurrentlyValidatingElement$1(element) {\n  {\n    if (element) {\n      var owner = element._owner;\n      var stack = describeUnknownElementTypeFrameInDEV(element.type, element._source, owner ? owner.type : null);\n      setExtraStackFrame(stack);\n    } else {\n      setExtraStackFrame(null);\n    }\n  }\n}\n\nvar propTypesMisspellWarningShown;\n\n{\n  propTypesMisspellWarningShown = false;\n}\n\nfunction getDeclarationErrorAddendum() {\n  if (ReactCurrentOwner.current) {\n    var name = getComponentNameFromType(ReactCurrentOwner.current.type);\n\n    if (name) {\n      return '\\n\\nCheck the render method of `' + name + '`.';\n    }\n  }\n\n  return '';\n}\n\nfunction getSourceInfoErrorAddendum(source) {\n  if (source !== undefined) {\n    var fileName = source.fileName.replace(/^.*[\\\\\\/]/, '');\n    var lineNumber = source.lineNumber;\n    return '\\n\\nCheck your code at ' + fileName + ':' + lineNumber + '.';\n  }\n\n  return '';\n}\n\nfunction getSourceInfoErrorAddendumForProps(elementProps) {\n  if (elementProps !== null && elementProps !== undefined) {\n    return getSourceInfoErrorAddendum(elementProps.__source);\n  }\n\n  return '';\n}\n/**\n * Warn if there's no key explicitly set on dynamic arrays of children or\n * object keys are not valid. This allows us to keep track of children between\n * updates.\n */\n\n\nvar ownerHasKeyUseWarning = {};\n\nfunction getCurrentComponentErrorInfo(parentType) {\n  var info = getDeclarationErrorAddendum();\n\n  if (!info) {\n    var parentName = typeof parentType === 'string' ? parentType : parentType.displayName || parentType.name;\n\n    if (parentName) {\n      info = \"\\n\\nCheck the top-level render call using <\" + parentName + \">.\";\n    }\n  }\n\n  return info;\n}\n/**\n * Warn if the element doesn't have an explicit key assigned to it.\n * This element is in an array. The array could grow and shrink or be\n * reordered. All children that haven't already been validated are required to\n * have a \"key\" property assigned to it. Error statuses are cached so a warning\n * will only be shown once.\n *\n * @internal\n * @param {ReactElement} element Element that requires a key.\n * @param {*} parentType element's parent's type.\n */\n\n\nfunction validateExplicitKey(element, parentType) {\n  if (!element._store || element._store.validated || element.key != null) {\n    return;\n  }\n\n  element._store.validated = true;\n  var currentComponentErrorInfo = getCurrentComponentErrorInfo(parentType);\n\n  if (ownerHasKeyUseWarning[currentComponentErrorInfo]) {\n    return;\n  }\n\n  ownerHasKeyUseWarning[currentComponentErrorInfo] = true; // Usually the current owner is the offender, but if it accepts children as a\n  // property, it may be the creator of the child that's responsible for\n  // assigning it a key.\n\n  var childOwner = '';\n\n  if (element && element._owner && element._owner !== ReactCurrentOwner.current) {\n    // Give the component that originally created this child.\n    childOwner = \" It was passed a child from \" + getComponentNameFromType(element._owner.type) + \".\";\n  }\n\n  {\n    setCurrentlyValidatingElement$1(element);\n\n    error('Each child in a list should have a unique \"key\" prop.' + '%s%s See https://reactjs.org/link/warning-keys for more information.', currentComponentErrorInfo, childOwner);\n\n    setCurrentlyValidatingElement$1(null);\n  }\n}\n/**\n * Ensure that every element either is passed in a static location, in an\n * array with an explicit keys property defined, or in an object literal\n * with valid key property.\n *\n * @internal\n * @param {ReactNode} node Statically passed child of any type.\n * @param {*} parentType node's parent's type.\n */\n\n\nfunction validateChildKeys(node, parentType) {\n  if (typeof node !== 'object') {\n    return;\n  }\n\n  if (isArray(node)) {\n    for (var i = 0; i < node.length; i++) {\n      var child = node[i];\n\n      if (isValidElement(child)) {\n        validateExplicitKey(child, parentType);\n      }\n    }\n  } else if (isValidElement(node)) {\n    // This element was passed in a valid location.\n    if (node._store) {\n      node._store.validated = true;\n    }\n  } else if (node) {\n    var iteratorFn = getIteratorFn(node);\n\n    if (typeof iteratorFn === 'function') {\n      // Entry iterators used to provide implicit keys,\n      // but now we print a separate warning for them later.\n      if (iteratorFn !== node.entries) {\n        var iterator = iteratorFn.call(node);\n        var step;\n\n        while (!(step = iterator.next()).done) {\n          if (isValidElement(step.value)) {\n            validateExplicitKey(step.value, parentType);\n          }\n        }\n      }\n    }\n  }\n}\n/**\n * Given an element, validate that its props follow the propTypes definition,\n * provided by the type.\n *\n * @param {ReactElement} element\n */\n\n\nfunction validatePropTypes(element) {\n  {\n    var type = element.type;\n\n    if (type === null || type === undefined || typeof type === 'string') {\n      return;\n    }\n\n    var propTypes;\n\n    if (typeof type === 'function') {\n      propTypes = type.propTypes;\n    } else if (typeof type === 'object' && (type.$$typeof === REACT_FORWARD_REF_TYPE || // Note: Memo only checks outer props here.\n    // Inner props are checked in the reconciler.\n    type.$$typeof === REACT_MEMO_TYPE)) {\n      propTypes = type.propTypes;\n    } else {\n      return;\n    }\n\n    if (propTypes) {\n      // Intentionally inside to avoid triggering lazy initializers:\n      var name = getComponentNameFromType(type);\n      checkPropTypes(propTypes, element.props, 'prop', name, element);\n    } else if (type.PropTypes !== undefined && !propTypesMisspellWarningShown) {\n      propTypesMisspellWarningShown = true; // Intentionally inside to avoid triggering lazy initializers:\n\n      var _name = getComponentNameFromType(type);\n\n      error('Component %s declared `PropTypes` instead of `propTypes`. Did you misspell the property assignment?', _name || 'Unknown');\n    }\n\n    if (typeof type.getDefaultProps === 'function' && !type.getDefaultProps.isReactClassApproved) {\n      error('getDefaultProps is only used on classic React.createClass ' + 'definitions. Use a static property named `defaultProps` instead.');\n    }\n  }\n}\n/**\n * Given a fragment, validate that it can only be provided with fragment props\n * @param {ReactElement} fragment\n */\n\n\nfunction validateFragmentProps(fragment) {\n  {\n    var keys = Object.keys(fragment.props);\n\n    for (var i = 0; i < keys.length; i++) {\n      var key = keys[i];\n\n      if (key !== 'children' && key !== 'key') {\n        setCurrentlyValidatingElement$1(fragment);\n\n        error('Invalid prop `%s` supplied to `React.Fragment`. ' + 'React.Fragment can only have `key` and `children` props.', key);\n\n        setCurrentlyValidatingElement$1(null);\n        break;\n      }\n    }\n\n    if (fragment.ref !== null) {\n      setCurrentlyValidatingElement$1(fragment);\n\n      error('Invalid attribute `ref` supplied to `React.Fragment`.');\n\n      setCurrentlyValidatingElement$1(null);\n    }\n  }\n}\nfunction createElementWithValidation(type, props, children) {\n  var validType = isValidElementType(type); // We warn in this case but don't throw. We expect the element creation to\n  // succeed and there will likely be errors in render.\n\n  if (!validType) {\n    var info = '';\n\n    if (type === undefined || typeof type === 'object' && type !== null && Object.keys(type).length === 0) {\n      info += ' You likely forgot to export your component from the file ' + \"it's defined in, or you might have mixed up default and named imports.\";\n    }\n\n    var sourceInfo = getSourceInfoErrorAddendumForProps(props);\n\n    if (sourceInfo) {\n      info += sourceInfo;\n    } else {\n      info += getDeclarationErrorAddendum();\n    }\n\n    var typeString;\n\n    if (type === null) {\n      typeString = 'null';\n    } else if (isArray(type)) {\n      typeString = 'array';\n    } else if (type !== undefined && type.$$typeof === REACT_ELEMENT_TYPE) {\n      typeString = \"<\" + (getComponentNameFromType(type.type) || 'Unknown') + \" />\";\n      info = ' Did you accidentally export a JSX literal instead of a component?';\n    } else {\n      typeString = typeof type;\n    }\n\n    {\n      error('React.createElement: type is invalid -- expected a string (for ' + 'built-in components) or a class/function (for composite ' + 'components) but got: %s.%s', typeString, info);\n    }\n  }\n\n  var element = createElement.apply(this, arguments); // The result can be nullish if a mock or a custom function is used.\n  // TODO: Drop this when these are no longer allowed as the type argument.\n\n  if (element == null) {\n    return element;\n  } // Skip key warning if the type isn't valid since our key validation logic\n  // doesn't expect a non-string/function type and can throw confusing errors.\n  // We don't want exception behavior to differ between dev and prod.\n  // (Rendering will throw with a helpful message and as soon as the type is\n  // fixed, the key warnings will appear.)\n\n\n  if (validType) {\n    for (var i = 2; i < arguments.length; i++) {\n      validateChildKeys(arguments[i], type);\n    }\n  }\n\n  if (type === REACT_FRAGMENT_TYPE) {\n    validateFragmentProps(element);\n  } else {\n    validatePropTypes(element);\n  }\n\n  return element;\n}\nvar didWarnAboutDeprecatedCreateFactory = false;\nfunction createFactoryWithValidation(type) {\n  var validatedFactory = createElementWithValidation.bind(null, type);\n  validatedFactory.type = type;\n\n  {\n    if (!didWarnAboutDeprecatedCreateFactory) {\n      didWarnAboutDeprecatedCreateFactory = true;\n\n      warn('React.createFactory() is deprecated and will be removed in ' + 'a future major release. Consider using JSX ' + 'or use React.createElement() directly instead.');\n    } // Legacy hook: remove it\n\n\n    Object.defineProperty(validatedFactory, 'type', {\n      enumerable: false,\n      get: function () {\n        warn('Factory.type is deprecated. Access the class directly ' + 'before passing it to createFactory.');\n\n        Object.defineProperty(this, 'type', {\n          value: type\n        });\n        return type;\n      }\n    });\n  }\n\n  return validatedFactory;\n}\nfunction cloneElementWithValidation(element, props, children) {\n  var newElement = cloneElement.apply(this, arguments);\n\n  for (var i = 2; i < arguments.length; i++) {\n    validateChildKeys(arguments[i], newElement.type);\n  }\n\n  validatePropTypes(newElement);\n  return newElement;\n}\n\nfunction startTransition(scope, options) {\n  var prevTransition = ReactCurrentBatchConfig.transition;\n  ReactCurrentBatchConfig.transition = {};\n  var currentTransition = ReactCurrentBatchConfig.transition;\n\n  {\n    ReactCurrentBatchConfig.transition._updatedFibers = new Set();\n  }\n\n  try {\n    scope();\n  } finally {\n    ReactCurrentBatchConfig.transition = prevTransition;\n\n    {\n      if (prevTransition === null && currentTransition._updatedFibers) {\n        var updatedFibersCount = currentTransition._updatedFibers.size;\n\n        if (updatedFibersCount > 10) {\n          warn('Detected a large number of updates inside startTransition. ' + 'If this is due to a subscription please re-write it to use React provided hooks. ' + 'Otherwise concurrent mode guarantees are off the table.');\n        }\n\n        currentTransition._updatedFibers.clear();\n      }\n    }\n  }\n}\n\nvar didWarnAboutMessageChannel = false;\nvar enqueueTaskImpl = null;\nfunction enqueueTask(task) {\n  if (enqueueTaskImpl === null) {\n    try {\n      // read require off the module object to get around the bundlers.\n      // we don't want them to detect a require and bundle a Node polyfill.\n      var requireString = ('require' + Math.random()).slice(0, 7);\n      var nodeRequire = module && module[requireString]; // assuming we're in node, let's try to get node's\n      // version of setImmediate, bypassing fake timers if any.\n\n      enqueueTaskImpl = nodeRequire.call(module, 'timers').setImmediate;\n    } catch (_err) {\n      // we're in a browser\n      // we can't use regular timers because they may still be faked\n      // so we try MessageChannel+postMessage instead\n      enqueueTaskImpl = function (callback) {\n        {\n          if (didWarnAboutMessageChannel === false) {\n            didWarnAboutMessageChannel = true;\n\n            if (typeof MessageChannel === 'undefined') {\n              error('This browser does not have a MessageChannel implementation, ' + 'so enqueuing tasks via await act(async () => ...) will fail. ' + 'Please file an issue at https://github.com/facebook/react/issues ' + 'if you encounter this warning.');\n            }\n          }\n        }\n\n        var channel = new MessageChannel();\n        channel.port1.onmessage = callback;\n        channel.port2.postMessage(undefined);\n      };\n    }\n  }\n\n  return enqueueTaskImpl(task);\n}\n\nvar actScopeDepth = 0;\nvar didWarnNoAwaitAct = false;\nfunction act(callback) {\n  {\n    // `act` calls can be nested, so we track the depth. This represents the\n    // number of `act` scopes on the stack.\n    var prevActScopeDepth = actScopeDepth;\n    actScopeDepth++;\n\n    if (ReactCurrentActQueue.current === null) {\n      // This is the outermost `act` scope. Initialize the queue. The reconciler\n      // will detect the queue and use it instead of Scheduler.\n      ReactCurrentActQueue.current = [];\n    }\n\n    var prevIsBatchingLegacy = ReactCurrentActQueue.isBatchingLegacy;\n    var result;\n\n    try {\n      // Used to reproduce behavior of `batchedUpdates` in legacy mode. Only\n      // set to `true` while the given callback is executed, not for updates\n      // triggered during an async event, because this is how the legacy\n      // implementation of `act` behaved.\n      ReactCurrentActQueue.isBatchingLegacy = true;\n      result = callback(); // Replicate behavior of original `act` implementation in legacy mode,\n      // which flushed updates immediately after the scope function exits, even\n      // if it's an async function.\n\n      if (!prevIsBatchingLegacy && ReactCurrentActQueue.didScheduleLegacyUpdate) {\n        var queue = ReactCurrentActQueue.current;\n\n        if (queue !== null) {\n          ReactCurrentActQueue.didScheduleLegacyUpdate = false;\n          flushActQueue(queue);\n        }\n      }\n    } catch (error) {\n      popActScope(prevActScopeDepth);\n      throw error;\n    } finally {\n      ReactCurrentActQueue.isBatchingLegacy = prevIsBatchingLegacy;\n    }\n\n    if (result !== null && typeof result === 'object' && typeof result.then === 'function') {\n      var thenableResult = result; // The callback is an async function (i.e. returned a promise). Wait\n      // for it to resolve before exiting the current scope.\n\n      var wasAwaited = false;\n      var thenable = {\n        then: function (resolve, reject) {\n          wasAwaited = true;\n          thenableResult.then(function (returnValue) {\n            popActScope(prevActScopeDepth);\n\n            if (actScopeDepth === 0) {\n              // We've exited the outermost act scope. Recursively flush the\n              // queue until there's no remaining work.\n              recursivelyFlushAsyncActWork(returnValue, resolve, reject);\n            } else {\n              resolve(returnValue);\n            }\n          }, function (error) {\n            // The callback threw an error.\n            popActScope(prevActScopeDepth);\n            reject(error);\n          });\n        }\n      };\n\n      {\n        if (!didWarnNoAwaitAct && typeof Promise !== 'undefined') {\n          // eslint-disable-next-line no-undef\n          Promise.resolve().then(function () {}).then(function () {\n            if (!wasAwaited) {\n              didWarnNoAwaitAct = true;\n\n              error('You called act(async () => ...) without await. ' + 'This could lead to unexpected testing behaviour, ' + 'interleaving multiple act calls and mixing their ' + 'scopes. ' + 'You should - await act(async () => ...);');\n            }\n          });\n        }\n      }\n\n      return thenable;\n    } else {\n      var returnValue = result; // The callback is not an async function. Exit the current scope\n      // immediately, without awaiting.\n\n      popActScope(prevActScopeDepth);\n\n      if (actScopeDepth === 0) {\n        // Exiting the outermost act scope. Flush the queue.\n        var _queue = ReactCurrentActQueue.current;\n\n        if (_queue !== null) {\n          flushActQueue(_queue);\n          ReactCurrentActQueue.current = null;\n        } // Return a thenable. If the user awaits it, we'll flush again in\n        // case additional work was scheduled by a microtask.\n\n\n        var _thenable = {\n          then: function (resolve, reject) {\n            // Confirm we haven't re-entered another `act` scope, in case\n            // the user does something weird like await the thenable\n            // multiple times.\n            if (ReactCurrentActQueue.current === null) {\n              // Recursively flush the queue until there's no remaining work.\n              ReactCurrentActQueue.current = [];\n              recursivelyFlushAsyncActWork(returnValue, resolve, reject);\n            } else {\n              resolve(returnValue);\n            }\n          }\n        };\n        return _thenable;\n      } else {\n        // Since we're inside a nested `act` scope, the returned thenable\n        // immediately resolves. The outer scope will flush the queue.\n        var _thenable2 = {\n          then: function (resolve, reject) {\n            resolve(returnValue);\n          }\n        };\n        return _thenable2;\n      }\n    }\n  }\n}\n\nfunction popActScope(prevActScopeDepth) {\n  {\n    if (prevActScopeDepth !== actScopeDepth - 1) {\n      error('You seem to have overlapping act() calls, this is not supported. ' + 'Be sure to await previous act() calls before making a new one. ');\n    }\n\n    actScopeDepth = prevActScopeDepth;\n  }\n}\n\nfunction recursivelyFlushAsyncActWork(returnValue, resolve, reject) {\n  {\n    var queue = ReactCurrentActQueue.current;\n\n    if (queue !== null) {\n      try {\n        flushActQueue(queue);\n        enqueueTask(function () {\n          if (queue.length === 0) {\n            // No additional work was scheduled. Finish.\n            ReactCurrentActQueue.current = null;\n            resolve(returnValue);\n          } else {\n            // Keep flushing work until there's none left.\n            recursivelyFlushAsyncActWork(returnValue, resolve, reject);\n          }\n        });\n      } catch (error) {\n        reject(error);\n      }\n    } else {\n      resolve(returnValue);\n    }\n  }\n}\n\nvar isFlushing = false;\n\nfunction flushActQueue(queue) {\n  {\n    if (!isFlushing) {\n      // Prevent re-entrance.\n      isFlushing = true;\n      var i = 0;\n\n      try {\n        for (; i < queue.length; i++) {\n          var callback = queue[i];\n\n          do {\n            callback = callback(true);\n          } while (callback !== null);\n        }\n\n        queue.length = 0;\n      } catch (error) {\n        // If something throws, leave the remaining callbacks on the queue.\n        queue = queue.slice(i + 1);\n        throw error;\n      } finally {\n        isFlushing = false;\n      }\n    }\n  }\n}\n\nvar createElement$1 =  createElementWithValidation ;\nvar cloneElement$1 =  cloneElementWithValidation ;\nvar createFactory =  createFactoryWithValidation ;\nvar Children = {\n  map: mapChildren,\n  forEach: forEachChildren,\n  count: countChildren,\n  toArray: toArray,\n  only: onlyChild\n};\n\nexports.Children = Children;\nexports.Component = Component;\nexports.Fragment = REACT_FRAGMENT_TYPE;\nexports.Profiler = REACT_PROFILER_TYPE;\nexports.PureComponent = PureComponent;\nexports.StrictMode = REACT_STRICT_MODE_TYPE;\nexports.Suspense = REACT_SUSPENSE_TYPE;\nexports.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED = ReactSharedInternals;\nexports.cloneElement = cloneElement$1;\nexports.createContext = createContext;\nexports.createElement = createElement$1;\nexports.createFactory = createFactory;\nexports.createRef = createRef;\nexports.forwardRef = forwardRef;\nexports.isValidElement = isValidElement;\nexports.lazy = lazy;\nexports.memo = memo;\nexports.startTransition = startTransition;\nexports.unstable_act = act;\nexports.useCallback = useCallback;\nexports.useContext = useContext;\nexports.useDebugValue = useDebugValue;\nexports.useDeferredValue = useDeferredValue;\nexports.useEffect = useEffect;\nexports.useId = useId;\nexports.useImperativeHandle = useImperativeHandle;\nexports.useInsertionEffect = useInsertionEffect;\nexports.useLayoutEffect = useLayoutEffect;\nexports.useMemo = useMemo;\nexports.useReducer = useReducer;\nexports.useRef = useRef;\nexports.useState = useState;\nexports.useSyncExternalStore = useSyncExternalStore;\nexports.useTransition = useTransition;\nexports.version = ReactVersion;\n          /* global __REACT_DEVTOOLS_GLOBAL_HOOK__ */\nif (\n  typeof __REACT_DEVTOOLS_GLOBAL_HOOK__ !== 'undefined' &&\n  typeof __REACT_DEVTOOLS_GLOBAL_HOOK__.registerInternalModuleStop ===\n    'function'\n) {\n  __REACT_DEVTOOLS_GLOBAL_HOOK__.registerInternalModuleStop(new Error());\n}\n        \n  })();\n}\n","'use strict';\n\nif (process.env.NODE_ENV === 'production') {\n  module.exports = require('./cjs/react.production.min.js');\n} else {\n  module.exports = require('./cjs/react.development.js');\n}\n","/**\n * @license React\n * react-jsx-runtime.development.js\n *\n * Copyright (c) Facebook, Inc. and its affiliates.\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\n'use strict';\n\nif (process.env.NODE_ENV !== \"production\") {\n  (function() {\n'use strict';\n\nvar React = require('react');\n\n// ATTENTION\n// When adding new symbols to this file,\n// Please consider also adding to 'react-devtools-shared/src/backend/ReactSymbols'\n// The Symbol used to tag the ReactElement-like types.\nvar REACT_ELEMENT_TYPE = Symbol.for('react.element');\nvar REACT_PORTAL_TYPE = Symbol.for('react.portal');\nvar REACT_FRAGMENT_TYPE = Symbol.for('react.fragment');\nvar REACT_STRICT_MODE_TYPE = Symbol.for('react.strict_mode');\nvar REACT_PROFILER_TYPE = Symbol.for('react.profiler');\nvar REACT_PROVIDER_TYPE = Symbol.for('react.provider');\nvar REACT_CONTEXT_TYPE = Symbol.for('react.context');\nvar REACT_FORWARD_REF_TYPE = Symbol.for('react.forward_ref');\nvar REACT_SUSPENSE_TYPE = Symbol.for('react.suspense');\nvar REACT_SUSPENSE_LIST_TYPE = Symbol.for('react.suspense_list');\nvar REACT_MEMO_TYPE = Symbol.for('react.memo');\nvar REACT_LAZY_TYPE = Symbol.for('react.lazy');\nvar REACT_OFFSCREEN_TYPE = Symbol.for('react.offscreen');\nvar MAYBE_ITERATOR_SYMBOL = Symbol.iterator;\nvar FAUX_ITERATOR_SYMBOL = '@@iterator';\nfunction getIteratorFn(maybeIterable) {\n  if (maybeIterable === null || typeof maybeIterable !== 'object') {\n    return null;\n  }\n\n  var maybeIterator = MAYBE_ITERATOR_SYMBOL && maybeIterable[MAYBE_ITERATOR_SYMBOL] || maybeIterable[FAUX_ITERATOR_SYMBOL];\n\n  if (typeof maybeIterator === 'function') {\n    return maybeIterator;\n  }\n\n  return null;\n}\n\nvar ReactSharedInternals = React.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED;\n\nfunction error(format) {\n  {\n    {\n      for (var _len2 = arguments.length, args = new Array(_len2 > 1 ? _len2 - 1 : 0), _key2 = 1; _key2 < _len2; _key2++) {\n        args[_key2 - 1] = arguments[_key2];\n      }\n\n      printWarning('error', format, args);\n    }\n  }\n}\n\nfunction printWarning(level, format, args) {\n  // When changing this logic, you might want to also\n  // update consoleWithStackDev.www.js as well.\n  {\n    var ReactDebugCurrentFrame = ReactSharedInternals.ReactDebugCurrentFrame;\n    var stack = ReactDebugCurrentFrame.getStackAddendum();\n\n    if (stack !== '') {\n      format += '%s';\n      args = args.concat([stack]);\n    } // eslint-disable-next-line react-internal/safe-string-coercion\n\n\n    var argsWithFormat = args.map(function (item) {\n      return String(item);\n    }); // Careful: RN currently depends on this prefix\n\n    argsWithFormat.unshift('Warning: ' + format); // We intentionally don't use spread (or .apply) directly because it\n    // breaks IE9: https://github.com/facebook/react/issues/13610\n    // eslint-disable-next-line react-internal/no-production-logging\n\n    Function.prototype.apply.call(console[level], console, argsWithFormat);\n  }\n}\n\n// -----------------------------------------------------------------------------\n\nvar enableScopeAPI = false; // Experimental Create Event Handle API.\nvar enableCacheElement = false;\nvar enableTransitionTracing = false; // No known bugs, but needs performance testing\n\nvar enableLegacyHidden = false; // Enables unstable_avoidThisFallback feature in Fiber\n// stuff. Intended to enable React core members to more easily debug scheduling\n// issues in DEV builds.\n\nvar enableDebugTracing = false; // Track which Fiber(s) schedule render work.\n\nvar REACT_MODULE_REFERENCE;\n\n{\n  REACT_MODULE_REFERENCE = Symbol.for('react.module.reference');\n}\n\nfunction isValidElementType(type) {\n  if (typeof type === 'string' || typeof type === 'function') {\n    return true;\n  } // Note: typeof might be other than 'symbol' or 'number' (e.g. if it's a polyfill).\n\n\n  if (type === REACT_FRAGMENT_TYPE || type === REACT_PROFILER_TYPE || enableDebugTracing  || type === REACT_STRICT_MODE_TYPE || type === REACT_SUSPENSE_TYPE || type === REACT_SUSPENSE_LIST_TYPE || enableLegacyHidden  || type === REACT_OFFSCREEN_TYPE || enableScopeAPI  || enableCacheElement  || enableTransitionTracing ) {\n    return true;\n  }\n\n  if (typeof type === 'object' && type !== null) {\n    if (type.$$typeof === REACT_LAZY_TYPE || type.$$typeof === REACT_MEMO_TYPE || type.$$typeof === REACT_PROVIDER_TYPE || type.$$typeof === REACT_CONTEXT_TYPE || type.$$typeof === REACT_FORWARD_REF_TYPE || // This needs to include all possible module reference object\n    // types supported by any Flight configuration anywhere since\n    // we don't know which Flight build this will end up being used\n    // with.\n    type.$$typeof === REACT_MODULE_REFERENCE || type.getModuleId !== undefined) {\n      return true;\n    }\n  }\n\n  return false;\n}\n\nfunction getWrappedName(outerType, innerType, wrapperName) {\n  var displayName = outerType.displayName;\n\n  if (displayName) {\n    return displayName;\n  }\n\n  var functionName = innerType.displayName || innerType.name || '';\n  return functionName !== '' ? wrapperName + \"(\" + functionName + \")\" : wrapperName;\n} // Keep in sync with react-reconciler/getComponentNameFromFiber\n\n\nfunction getContextName(type) {\n  return type.displayName || 'Context';\n} // Note that the reconciler package should generally prefer to use getComponentNameFromFiber() instead.\n\n\nfunction getComponentNameFromType(type) {\n  if (type == null) {\n    // Host root, text node or just invalid type.\n    return null;\n  }\n\n  {\n    if (typeof type.tag === 'number') {\n      error('Received an unexpected object in getComponentNameFromType(). ' + 'This is likely a bug in React. Please file an issue.');\n    }\n  }\n\n  if (typeof type === 'function') {\n    return type.displayName || type.name || null;\n  }\n\n  if (typeof type === 'string') {\n    return type;\n  }\n\n  switch (type) {\n    case REACT_FRAGMENT_TYPE:\n      return 'Fragment';\n\n    case REACT_PORTAL_TYPE:\n      return 'Portal';\n\n    case REACT_PROFILER_TYPE:\n      return 'Profiler';\n\n    case REACT_STRICT_MODE_TYPE:\n      return 'StrictMode';\n\n    case REACT_SUSPENSE_TYPE:\n      return 'Suspense';\n\n    case REACT_SUSPENSE_LIST_TYPE:\n      return 'SuspenseList';\n\n  }\n\n  if (typeof type === 'object') {\n    switch (type.$$typeof) {\n      case REACT_CONTEXT_TYPE:\n        var context = type;\n        return getContextName(context) + '.Consumer';\n\n      case REACT_PROVIDER_TYPE:\n        var provider = type;\n        return getContextName(provider._context) + '.Provider';\n\n      case REACT_FORWARD_REF_TYPE:\n        return getWrappedName(type, type.render, 'ForwardRef');\n\n      case REACT_MEMO_TYPE:\n        var outerName = type.displayName || null;\n\n        if (outerName !== null) {\n          return outerName;\n        }\n\n        return getComponentNameFromType(type.type) || 'Memo';\n\n      case REACT_LAZY_TYPE:\n        {\n          var lazyComponent = type;\n          var payload = lazyComponent._payload;\n          var init = lazyComponent._init;\n\n          try {\n            return getComponentNameFromType(init(payload));\n          } catch (x) {\n            return null;\n          }\n        }\n\n      // eslint-disable-next-line no-fallthrough\n    }\n  }\n\n  return null;\n}\n\nvar assign = Object.assign;\n\n// Helpers to patch console.logs to avoid logging during side-effect free\n// replaying on render function. This currently only patches the object\n// lazily which won't cover if the log function was extracted eagerly.\n// We could also eagerly patch the method.\nvar disabledDepth = 0;\nvar prevLog;\nvar prevInfo;\nvar prevWarn;\nvar prevError;\nvar prevGroup;\nvar prevGroupCollapsed;\nvar prevGroupEnd;\n\nfunction disabledLog() {}\n\ndisabledLog.__reactDisabledLog = true;\nfunction disableLogs() {\n  {\n    if (disabledDepth === 0) {\n      /* eslint-disable react-internal/no-production-logging */\n      prevLog = console.log;\n      prevInfo = console.info;\n      prevWarn = console.warn;\n      prevError = console.error;\n      prevGroup = console.group;\n      prevGroupCollapsed = console.groupCollapsed;\n      prevGroupEnd = console.groupEnd; // https://github.com/facebook/react/issues/19099\n\n      var props = {\n        configurable: true,\n        enumerable: true,\n        value: disabledLog,\n        writable: true\n      }; // $FlowFixMe Flow thinks console is immutable.\n\n      Object.defineProperties(console, {\n        info: props,\n        log: props,\n        warn: props,\n        error: props,\n        group: props,\n        groupCollapsed: props,\n        groupEnd: props\n      });\n      /* eslint-enable react-internal/no-production-logging */\n    }\n\n    disabledDepth++;\n  }\n}\nfunction reenableLogs() {\n  {\n    disabledDepth--;\n\n    if (disabledDepth === 0) {\n      /* eslint-disable react-internal/no-production-logging */\n      var props = {\n        configurable: true,\n        enumerable: true,\n        writable: true\n      }; // $FlowFixMe Flow thinks console is immutable.\n\n      Object.defineProperties(console, {\n        log: assign({}, props, {\n          value: prevLog\n        }),\n        info: assign({}, props, {\n          value: prevInfo\n        }),\n        warn: assign({}, props, {\n          value: prevWarn\n        }),\n        error: assign({}, props, {\n          value: prevError\n        }),\n        group: assign({}, props, {\n          value: prevGroup\n        }),\n        groupCollapsed: assign({}, props, {\n          value: prevGroupCollapsed\n        }),\n        groupEnd: assign({}, props, {\n          value: prevGroupEnd\n        })\n      });\n      /* eslint-enable react-internal/no-production-logging */\n    }\n\n    if (disabledDepth < 0) {\n      error('disabledDepth fell below zero. ' + 'This is a bug in React. Please file an issue.');\n    }\n  }\n}\n\nvar ReactCurrentDispatcher = ReactSharedInternals.ReactCurrentDispatcher;\nvar prefix;\nfunction describeBuiltInComponentFrame(name, source, ownerFn) {\n  {\n    if (prefix === undefined) {\n      // Extract the VM specific prefix used by each line.\n      try {\n        throw Error();\n      } catch (x) {\n        var match = x.stack.trim().match(/\\n( *(at )?)/);\n        prefix = match && match[1] || '';\n      }\n    } // We use the prefix to ensure our stacks line up with native stack frames.\n\n\n    return '\\n' + prefix + name;\n  }\n}\nvar reentry = false;\nvar componentFrameCache;\n\n{\n  var PossiblyWeakMap = typeof WeakMap === 'function' ? WeakMap : Map;\n  componentFrameCache = new PossiblyWeakMap();\n}\n\nfunction describeNativeComponentFrame(fn, construct) {\n  // If something asked for a stack inside a fake render, it should get ignored.\n  if ( !fn || reentry) {\n    return '';\n  }\n\n  {\n    var frame = componentFrameCache.get(fn);\n\n    if (frame !== undefined) {\n      return frame;\n    }\n  }\n\n  var control;\n  reentry = true;\n  var previousPrepareStackTrace = Error.prepareStackTrace; // $FlowFixMe It does accept undefined.\n\n  Error.prepareStackTrace = undefined;\n  var previousDispatcher;\n\n  {\n    previousDispatcher = ReactCurrentDispatcher.current; // Set the dispatcher in DEV because this might be call in the render function\n    // for warnings.\n\n    ReactCurrentDispatcher.current = null;\n    disableLogs();\n  }\n\n  try {\n    // This should throw.\n    if (construct) {\n      // Something should be setting the props in the constructor.\n      var Fake = function () {\n        throw Error();\n      }; // $FlowFixMe\n\n\n      Object.defineProperty(Fake.prototype, 'props', {\n        set: function () {\n          // We use a throwing setter instead of frozen or non-writable props\n          // because that won't throw in a non-strict mode function.\n          throw Error();\n        }\n      });\n\n      if (typeof Reflect === 'object' && Reflect.construct) {\n        // We construct a different control for this case to include any extra\n        // frames added by the construct call.\n        try {\n          Reflect.construct(Fake, []);\n        } catch (x) {\n          control = x;\n        }\n\n        Reflect.construct(fn, [], Fake);\n      } else {\n        try {\n          Fake.call();\n        } catch (x) {\n          control = x;\n        }\n\n        fn.call(Fake.prototype);\n      }\n    } else {\n      try {\n        throw Error();\n      } catch (x) {\n        control = x;\n      }\n\n      fn();\n    }\n  } catch (sample) {\n    // This is inlined manually because closure doesn't do it for us.\n    if (sample && control && typeof sample.stack === 'string') {\n      // This extracts the first frame from the sample that isn't also in the control.\n      // Skipping one frame that we assume is the frame that calls the two.\n      var sampleLines = sample.stack.split('\\n');\n      var controlLines = control.stack.split('\\n');\n      var s = sampleLines.length - 1;\n      var c = controlLines.length - 1;\n\n      while (s >= 1 && c >= 0 && sampleLines[s] !== controlLines[c]) {\n        // We expect at least one stack frame to be shared.\n        // Typically this will be the root most one. However, stack frames may be\n        // cut off due to maximum stack limits. In this case, one maybe cut off\n        // earlier than the other. We assume that the sample is longer or the same\n        // and there for cut off earlier. So we should find the root most frame in\n        // the sample somewhere in the control.\n        c--;\n      }\n\n      for (; s >= 1 && c >= 0; s--, c--) {\n        // Next we find the first one that isn't the same which should be the\n        // frame that called our sample function and the control.\n        if (sampleLines[s] !== controlLines[c]) {\n          // In V8, the first line is describing the message but other VMs don't.\n          // If we're about to return the first line, and the control is also on the same\n          // line, that's a pretty good indicator that our sample threw at same line as\n          // the control. I.e. before we entered the sample frame. So we ignore this result.\n          // This can happen if you passed a class to function component, or non-function.\n          if (s !== 1 || c !== 1) {\n            do {\n              s--;\n              c--; // We may still have similar intermediate frames from the construct call.\n              // The next one that isn't the same should be our match though.\n\n              if (c < 0 || sampleLines[s] !== controlLines[c]) {\n                // V8 adds a \"new\" prefix for native classes. Let's remove it to make it prettier.\n                var _frame = '\\n' + sampleLines[s].replace(' at new ', ' at '); // If our component frame is labeled \"<anonymous>\"\n                // but we have a user-provided \"displayName\"\n                // splice it in to make the stack more readable.\n\n\n                if (fn.displayName && _frame.includes('<anonymous>')) {\n                  _frame = _frame.replace('<anonymous>', fn.displayName);\n                }\n\n                {\n                  if (typeof fn === 'function') {\n                    componentFrameCache.set(fn, _frame);\n                  }\n                } // Return the line we found.\n\n\n                return _frame;\n              }\n            } while (s >= 1 && c >= 0);\n          }\n\n          break;\n        }\n      }\n    }\n  } finally {\n    reentry = false;\n\n    {\n      ReactCurrentDispatcher.current = previousDispatcher;\n      reenableLogs();\n    }\n\n    Error.prepareStackTrace = previousPrepareStackTrace;\n  } // Fallback to just using the name if we couldn't make it throw.\n\n\n  var name = fn ? fn.displayName || fn.name : '';\n  var syntheticFrame = name ? describeBuiltInComponentFrame(name) : '';\n\n  {\n    if (typeof fn === 'function') {\n      componentFrameCache.set(fn, syntheticFrame);\n    }\n  }\n\n  return syntheticFrame;\n}\nfunction describeFunctionComponentFrame(fn, source, ownerFn) {\n  {\n    return describeNativeComponentFrame(fn, false);\n  }\n}\n\nfunction shouldConstruct(Component) {\n  var prototype = Component.prototype;\n  return !!(prototype && prototype.isReactComponent);\n}\n\nfunction describeUnknownElementTypeFrameInDEV(type, source, ownerFn) {\n\n  if (type == null) {\n    return '';\n  }\n\n  if (typeof type === 'function') {\n    {\n      return describeNativeComponentFrame(type, shouldConstruct(type));\n    }\n  }\n\n  if (typeof type === 'string') {\n    return describeBuiltInComponentFrame(type);\n  }\n\n  switch (type) {\n    case REACT_SUSPENSE_TYPE:\n      return describeBuiltInComponentFrame('Suspense');\n\n    case REACT_SUSPENSE_LIST_TYPE:\n      return describeBuiltInComponentFrame('SuspenseList');\n  }\n\n  if (typeof type === 'object') {\n    switch (type.$$typeof) {\n      case REACT_FORWARD_REF_TYPE:\n        return describeFunctionComponentFrame(type.render);\n\n      case REACT_MEMO_TYPE:\n        // Memo may contain any component type so we recursively resolve it.\n        return describeUnknownElementTypeFrameInDEV(type.type, source, ownerFn);\n\n      case REACT_LAZY_TYPE:\n        {\n          var lazyComponent = type;\n          var payload = lazyComponent._payload;\n          var init = lazyComponent._init;\n\n          try {\n            // Lazy may contain any component type so we recursively resolve it.\n            return describeUnknownElementTypeFrameInDEV(init(payload), source, ownerFn);\n          } catch (x) {}\n        }\n    }\n  }\n\n  return '';\n}\n\nvar hasOwnProperty = Object.prototype.hasOwnProperty;\n\nvar loggedTypeFailures = {};\nvar ReactDebugCurrentFrame = ReactSharedInternals.ReactDebugCurrentFrame;\n\nfunction setCurrentlyValidatingElement(element) {\n  {\n    if (element) {\n      var owner = element._owner;\n      var stack = describeUnknownElementTypeFrameInDEV(element.type, element._source, owner ? owner.type : null);\n      ReactDebugCurrentFrame.setExtraStackFrame(stack);\n    } else {\n      ReactDebugCurrentFrame.setExtraStackFrame(null);\n    }\n  }\n}\n\nfunction checkPropTypes(typeSpecs, values, location, componentName, element) {\n  {\n    // $FlowFixMe This is okay but Flow doesn't know it.\n    var has = Function.call.bind(hasOwnProperty);\n\n    for (var typeSpecName in typeSpecs) {\n      if (has(typeSpecs, typeSpecName)) {\n        var error$1 = void 0; // Prop type validation may throw. In case they do, we don't want to\n        // fail the render phase where it didn't fail before. So we log it.\n        // After these have been cleaned up, we'll let them throw.\n\n        try {\n          // This is intentionally an invariant that gets caught. It's the same\n          // behavior as without this statement except with a better message.\n          if (typeof typeSpecs[typeSpecName] !== 'function') {\n            // eslint-disable-next-line react-internal/prod-error-codes\n            var err = Error((componentName || 'React class') + ': ' + location + ' type `' + typeSpecName + '` is invalid; ' + 'it must be a function, usually from the `prop-types` package, but received `' + typeof typeSpecs[typeSpecName] + '`.' + 'This often happens because of typos such as `PropTypes.function` instead of `PropTypes.func`.');\n            err.name = 'Invariant Violation';\n            throw err;\n          }\n\n          error$1 = typeSpecs[typeSpecName](values, typeSpecName, componentName, location, null, 'SECRET_DO_NOT_PASS_THIS_OR_YOU_WILL_BE_FIRED');\n        } catch (ex) {\n          error$1 = ex;\n        }\n\n        if (error$1 && !(error$1 instanceof Error)) {\n          setCurrentlyValidatingElement(element);\n\n          error('%s: type specification of %s' + ' `%s` is invalid; the type checker ' + 'function must return `null` or an `Error` but returned a %s. ' + 'You may have forgotten to pass an argument to the type checker ' + 'creator (arrayOf, instanceOf, objectOf, oneOf, oneOfType, and ' + 'shape all require an argument).', componentName || 'React class', location, typeSpecName, typeof error$1);\n\n          setCurrentlyValidatingElement(null);\n        }\n\n        if (error$1 instanceof Error && !(error$1.message in loggedTypeFailures)) {\n          // Only monitor this failure once because there tends to be a lot of the\n          // same error.\n          loggedTypeFailures[error$1.message] = true;\n          setCurrentlyValidatingElement(element);\n\n          error('Failed %s type: %s', location, error$1.message);\n\n          setCurrentlyValidatingElement(null);\n        }\n      }\n    }\n  }\n}\n\nvar isArrayImpl = Array.isArray; // eslint-disable-next-line no-redeclare\n\nfunction isArray(a) {\n  return isArrayImpl(a);\n}\n\n/*\n * The `'' + value` pattern (used in in perf-sensitive code) throws for Symbol\n * and Temporal.* types. See https://github.com/facebook/react/pull/22064.\n *\n * The functions in this module will throw an easier-to-understand,\n * easier-to-debug exception with a clear errors message message explaining the\n * problem. (Instead of a confusing exception thrown inside the implementation\n * of the `value` object).\n */\n// $FlowFixMe only called in DEV, so void return is not possible.\nfunction typeName(value) {\n  {\n    // toStringTag is needed for namespaced types like Temporal.Instant\n    var hasToStringTag = typeof Symbol === 'function' && Symbol.toStringTag;\n    var type = hasToStringTag && value[Symbol.toStringTag] || value.constructor.name || 'Object';\n    return type;\n  }\n} // $FlowFixMe only called in DEV, so void return is not possible.\n\n\nfunction willCoercionThrow(value) {\n  {\n    try {\n      testStringCoercion(value);\n      return false;\n    } catch (e) {\n      return true;\n    }\n  }\n}\n\nfunction testStringCoercion(value) {\n  // If you ended up here by following an exception call stack, here's what's\n  // happened: you supplied an object or symbol value to React (as a prop, key,\n  // DOM attribute, CSS property, string ref, etc.) and when React tried to\n  // coerce it to a string using `'' + value`, an exception was thrown.\n  //\n  // The most common types that will cause this exception are `Symbol` instances\n  // and Temporal objects like `Temporal.Instant`. But any object that has a\n  // `valueOf` or `[Symbol.toPrimitive]` method that throws will also cause this\n  // exception. (Library authors do this to prevent users from using built-in\n  // numeric operators like `+` or comparison operators like `>=` because custom\n  // methods are needed to perform accurate arithmetic or comparison.)\n  //\n  // To fix the problem, coerce this object or symbol value to a string before\n  // passing it to React. The most reliable way is usually `String(value)`.\n  //\n  // To find which value is throwing, check the browser or debugger console.\n  // Before this exception was thrown, there should be `console.error` output\n  // that shows the type (Symbol, Temporal.PlainDate, etc.) that caused the\n  // problem and how that type was used: key, atrribute, input value prop, etc.\n  // In most cases, this console output also shows the component and its\n  // ancestor components where the exception happened.\n  //\n  // eslint-disable-next-line react-internal/safe-string-coercion\n  return '' + value;\n}\nfunction checkKeyStringCoercion(value) {\n  {\n    if (willCoercionThrow(value)) {\n      error('The provided key is an unsupported type %s.' + ' This value must be coerced to a string before before using it here.', typeName(value));\n\n      return testStringCoercion(value); // throw (to help callers find troubleshooting comments)\n    }\n  }\n}\n\nvar ReactCurrentOwner = ReactSharedInternals.ReactCurrentOwner;\nvar RESERVED_PROPS = {\n  key: true,\n  ref: true,\n  __self: true,\n  __source: true\n};\nvar specialPropKeyWarningShown;\nvar specialPropRefWarningShown;\nvar didWarnAboutStringRefs;\n\n{\n  didWarnAboutStringRefs = {};\n}\n\nfunction hasValidRef(config) {\n  {\n    if (hasOwnProperty.call(config, 'ref')) {\n      var getter = Object.getOwnPropertyDescriptor(config, 'ref').get;\n\n      if (getter && getter.isReactWarning) {\n        return false;\n      }\n    }\n  }\n\n  return config.ref !== undefined;\n}\n\nfunction hasValidKey(config) {\n  {\n    if (hasOwnProperty.call(config, 'key')) {\n      var getter = Object.getOwnPropertyDescriptor(config, 'key').get;\n\n      if (getter && getter.isReactWarning) {\n        return false;\n      }\n    }\n  }\n\n  return config.key !== undefined;\n}\n\nfunction warnIfStringRefCannotBeAutoConverted(config, self) {\n  {\n    if (typeof config.ref === 'string' && ReactCurrentOwner.current && self && ReactCurrentOwner.current.stateNode !== self) {\n      var componentName = getComponentNameFromType(ReactCurrentOwner.current.type);\n\n      if (!didWarnAboutStringRefs[componentName]) {\n        error('Component \"%s\" contains the string ref \"%s\". ' + 'Support for string refs will be removed in a future major release. ' + 'This case cannot be automatically converted to an arrow function. ' + 'We ask you to manually fix this case by using useRef() or createRef() instead. ' + 'Learn more about using refs safely here: ' + 'https://reactjs.org/link/strict-mode-string-ref', getComponentNameFromType(ReactCurrentOwner.current.type), config.ref);\n\n        didWarnAboutStringRefs[componentName] = true;\n      }\n    }\n  }\n}\n\nfunction defineKeyPropWarningGetter(props, displayName) {\n  {\n    var warnAboutAccessingKey = function () {\n      if (!specialPropKeyWarningShown) {\n        specialPropKeyWarningShown = true;\n\n        error('%s: `key` is not a prop. Trying to access it will result ' + 'in `undefined` being returned. If you need to access the same ' + 'value within the child component, you should pass it as a different ' + 'prop. (https://reactjs.org/link/special-props)', displayName);\n      }\n    };\n\n    warnAboutAccessingKey.isReactWarning = true;\n    Object.defineProperty(props, 'key', {\n      get: warnAboutAccessingKey,\n      configurable: true\n    });\n  }\n}\n\nfunction defineRefPropWarningGetter(props, displayName) {\n  {\n    var warnAboutAccessingRef = function () {\n      if (!specialPropRefWarningShown) {\n        specialPropRefWarningShown = true;\n\n        error('%s: `ref` is not a prop. Trying to access it will result ' + 'in `undefined` being returned. If you need to access the same ' + 'value within the child component, you should pass it as a different ' + 'prop. (https://reactjs.org/link/special-props)', displayName);\n      }\n    };\n\n    warnAboutAccessingRef.isReactWarning = true;\n    Object.defineProperty(props, 'ref', {\n      get: warnAboutAccessingRef,\n      configurable: true\n    });\n  }\n}\n/**\n * Factory method to create a new React element. This no longer adheres to\n * the class pattern, so do not use new to call it. Also, instanceof check\n * will not work. Instead test $$typeof field against Symbol.for('react.element') to check\n * if something is a React Element.\n *\n * @param {*} type\n * @param {*} props\n * @param {*} key\n * @param {string|object} ref\n * @param {*} owner\n * @param {*} self A *temporary* helper to detect places where `this` is\n * different from the `owner` when React.createElement is called, so that we\n * can warn. We want to get rid of owner and replace string `ref`s with arrow\n * functions, and as long as `this` and owner are the same, there will be no\n * change in behavior.\n * @param {*} source An annotation object (added by a transpiler or otherwise)\n * indicating filename, line number, and/or other information.\n * @internal\n */\n\n\nvar ReactElement = function (type, key, ref, self, source, owner, props) {\n  var element = {\n    // This tag allows us to uniquely identify this as a React Element\n    $$typeof: REACT_ELEMENT_TYPE,\n    // Built-in properties that belong on the element\n    type: type,\n    key: key,\n    ref: ref,\n    props: props,\n    // Record the component responsible for creating this element.\n    _owner: owner\n  };\n\n  {\n    // The validation flag is currently mutative. We put it on\n    // an external backing store so that we can freeze the whole object.\n    // This can be replaced with a WeakMap once they are implemented in\n    // commonly used development environments.\n    element._store = {}; // To make comparing ReactElements easier for testing purposes, we make\n    // the validation flag non-enumerable (where possible, which should\n    // include every environment we run tests in), so the test framework\n    // ignores it.\n\n    Object.defineProperty(element._store, 'validated', {\n      configurable: false,\n      enumerable: false,\n      writable: true,\n      value: false\n    }); // self and source are DEV only properties.\n\n    Object.defineProperty(element, '_self', {\n      configurable: false,\n      enumerable: false,\n      writable: false,\n      value: self\n    }); // Two elements created in two different places should be considered\n    // equal for testing purposes and therefore we hide it from enumeration.\n\n    Object.defineProperty(element, '_source', {\n      configurable: false,\n      enumerable: false,\n      writable: false,\n      value: source\n    });\n\n    if (Object.freeze) {\n      Object.freeze(element.props);\n      Object.freeze(element);\n    }\n  }\n\n  return element;\n};\n/**\n * https://github.com/reactjs/rfcs/pull/107\n * @param {*} type\n * @param {object} props\n * @param {string} key\n */\n\nfunction jsxDEV(type, config, maybeKey, source, self) {\n  {\n    var propName; // Reserved names are extracted\n\n    var props = {};\n    var key = null;\n    var ref = null; // Currently, key can be spread in as a prop. This causes a potential\n    // issue if key is also explicitly declared (ie. <div {...props} key=\"Hi\" />\n    // or <div key=\"Hi\" {...props} /> ). We want to deprecate key spread,\n    // but as an intermediary step, we will use jsxDEV for everything except\n    // <div {...props} key=\"Hi\" />, because we aren't currently able to tell if\n    // key is explicitly declared to be undefined or not.\n\n    if (maybeKey !== undefined) {\n      {\n        checkKeyStringCoercion(maybeKey);\n      }\n\n      key = '' + maybeKey;\n    }\n\n    if (hasValidKey(config)) {\n      {\n        checkKeyStringCoercion(config.key);\n      }\n\n      key = '' + config.key;\n    }\n\n    if (hasValidRef(config)) {\n      ref = config.ref;\n      warnIfStringRefCannotBeAutoConverted(config, self);\n    } // Remaining properties are added to a new props object\n\n\n    for (propName in config) {\n      if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n        props[propName] = config[propName];\n      }\n    } // Resolve default props\n\n\n    if (type && type.defaultProps) {\n      var defaultProps = type.defaultProps;\n\n      for (propName in defaultProps) {\n        if (props[propName] === undefined) {\n          props[propName] = defaultProps[propName];\n        }\n      }\n    }\n\n    if (key || ref) {\n      var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n      if (key) {\n        defineKeyPropWarningGetter(props, displayName);\n      }\n\n      if (ref) {\n        defineRefPropWarningGetter(props, displayName);\n      }\n    }\n\n    return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n  }\n}\n\nvar ReactCurrentOwner$1 = ReactSharedInternals.ReactCurrentOwner;\nvar ReactDebugCurrentFrame$1 = ReactSharedInternals.ReactDebugCurrentFrame;\n\nfunction setCurrentlyValidatingElement$1(element) {\n  {\n    if (element) {\n      var owner = element._owner;\n      var stack = describeUnknownElementTypeFrameInDEV(element.type, element._source, owner ? owner.type : null);\n      ReactDebugCurrentFrame$1.setExtraStackFrame(stack);\n    } else {\n      ReactDebugCurrentFrame$1.setExtraStackFrame(null);\n    }\n  }\n}\n\nvar propTypesMisspellWarningShown;\n\n{\n  propTypesMisspellWarningShown = false;\n}\n/**\n * Verifies the object is a ReactElement.\n * See https://reactjs.org/docs/react-api.html#isvalidelement\n * @param {?object} object\n * @return {boolean} True if `object` is a ReactElement.\n * @final\n */\n\n\nfunction isValidElement(object) {\n  {\n    return typeof object === 'object' && object !== null && object.$$typeof === REACT_ELEMENT_TYPE;\n  }\n}\n\nfunction getDeclarationErrorAddendum() {\n  {\n    if (ReactCurrentOwner$1.current) {\n      var name = getComponentNameFromType(ReactCurrentOwner$1.current.type);\n\n      if (name) {\n        return '\\n\\nCheck the render method of `' + name + '`.';\n      }\n    }\n\n    return '';\n  }\n}\n\nfunction getSourceInfoErrorAddendum(source) {\n  {\n    if (source !== undefined) {\n      var fileName = source.fileName.replace(/^.*[\\\\\\/]/, '');\n      var lineNumber = source.lineNumber;\n      return '\\n\\nCheck your code at ' + fileName + ':' + lineNumber + '.';\n    }\n\n    return '';\n  }\n}\n/**\n * Warn if there's no key explicitly set on dynamic arrays of children or\n * object keys are not valid. This allows us to keep track of children between\n * updates.\n */\n\n\nvar ownerHasKeyUseWarning = {};\n\nfunction getCurrentComponentErrorInfo(parentType) {\n  {\n    var info = getDeclarationErrorAddendum();\n\n    if (!info) {\n      var parentName = typeof parentType === 'string' ? parentType : parentType.displayName || parentType.name;\n\n      if (parentName) {\n        info = \"\\n\\nCheck the top-level render call using <\" + parentName + \">.\";\n      }\n    }\n\n    return info;\n  }\n}\n/**\n * Warn if the element doesn't have an explicit key assigned to it.\n * This element is in an array. The array could grow and shrink or be\n * reordered. All children that haven't already been validated are required to\n * have a \"key\" property assigned to it. Error statuses are cached so a warning\n * will only be shown once.\n *\n * @internal\n * @param {ReactElement} element Element that requires a key.\n * @param {*} parentType element's parent's type.\n */\n\n\nfunction validateExplicitKey(element, parentType) {\n  {\n    if (!element._store || element._store.validated || element.key != null) {\n      return;\n    }\n\n    element._store.validated = true;\n    var currentComponentErrorInfo = getCurrentComponentErrorInfo(parentType);\n\n    if (ownerHasKeyUseWarning[currentComponentErrorInfo]) {\n      return;\n    }\n\n    ownerHasKeyUseWarning[currentComponentErrorInfo] = true; // Usually the current owner is the offender, but if it accepts children as a\n    // property, it may be the creator of the child that's responsible for\n    // assigning it a key.\n\n    var childOwner = '';\n\n    if (element && element._owner && element._owner !== ReactCurrentOwner$1.current) {\n      // Give the component that originally created this child.\n      childOwner = \" It was passed a child from \" + getComponentNameFromType(element._owner.type) + \".\";\n    }\n\n    setCurrentlyValidatingElement$1(element);\n\n    error('Each child in a list should have a unique \"key\" prop.' + '%s%s See https://reactjs.org/link/warning-keys for more information.', currentComponentErrorInfo, childOwner);\n\n    setCurrentlyValidatingElement$1(null);\n  }\n}\n/**\n * Ensure that every element either is passed in a static location, in an\n * array with an explicit keys property defined, or in an object literal\n * with valid key property.\n *\n * @internal\n * @param {ReactNode} node Statically passed child of any type.\n * @param {*} parentType node's parent's type.\n */\n\n\nfunction validateChildKeys(node, parentType) {\n  {\n    if (typeof node !== 'object') {\n      return;\n    }\n\n    if (isArray(node)) {\n      for (var i = 0; i < node.length; i++) {\n        var child = node[i];\n\n        if (isValidElement(child)) {\n          validateExplicitKey(child, parentType);\n        }\n      }\n    } else if (isValidElement(node)) {\n      // This element was passed in a valid location.\n      if (node._store) {\n        node._store.validated = true;\n      }\n    } else if (node) {\n      var iteratorFn = getIteratorFn(node);\n\n      if (typeof iteratorFn === 'function') {\n        // Entry iterators used to provide implicit keys,\n        // but now we print a separate warning for them later.\n        if (iteratorFn !== node.entries) {\n          var iterator = iteratorFn.call(node);\n          var step;\n\n          while (!(step = iterator.next()).done) {\n            if (isValidElement(step.value)) {\n              validateExplicitKey(step.value, parentType);\n            }\n          }\n        }\n      }\n    }\n  }\n}\n/**\n * Given an element, validate that its props follow the propTypes definition,\n * provided by the type.\n *\n * @param {ReactElement} element\n */\n\n\nfunction validatePropTypes(element) {\n  {\n    var type = element.type;\n\n    if (type === null || type === undefined || typeof type === 'string') {\n      return;\n    }\n\n    var propTypes;\n\n    if (typeof type === 'function') {\n      propTypes = type.propTypes;\n    } else if (typeof type === 'object' && (type.$$typeof === REACT_FORWARD_REF_TYPE || // Note: Memo only checks outer props here.\n    // Inner props are checked in the reconciler.\n    type.$$typeof === REACT_MEMO_TYPE)) {\n      propTypes = type.propTypes;\n    } else {\n      return;\n    }\n\n    if (propTypes) {\n      // Intentionally inside to avoid triggering lazy initializers:\n      var name = getComponentNameFromType(type);\n      checkPropTypes(propTypes, element.props, 'prop', name, element);\n    } else if (type.PropTypes !== undefined && !propTypesMisspellWarningShown) {\n      propTypesMisspellWarningShown = true; // Intentionally inside to avoid triggering lazy initializers:\n\n      var _name = getComponentNameFromType(type);\n\n      error('Component %s declared `PropTypes` instead of `propTypes`. Did you misspell the property assignment?', _name || 'Unknown');\n    }\n\n    if (typeof type.getDefaultProps === 'function' && !type.getDefaultProps.isReactClassApproved) {\n      error('getDefaultProps is only used on classic React.createClass ' + 'definitions. Use a static property named `defaultProps` instead.');\n    }\n  }\n}\n/**\n * Given a fragment, validate that it can only be provided with fragment props\n * @param {ReactElement} fragment\n */\n\n\nfunction validateFragmentProps(fragment) {\n  {\n    var keys = Object.keys(fragment.props);\n\n    for (var i = 0; i < keys.length; i++) {\n      var key = keys[i];\n\n      if (key !== 'children' && key !== 'key') {\n        setCurrentlyValidatingElement$1(fragment);\n\n        error('Invalid prop `%s` supplied to `React.Fragment`. ' + 'React.Fragment can only have `key` and `children` props.', key);\n\n        setCurrentlyValidatingElement$1(null);\n        break;\n      }\n    }\n\n    if (fragment.ref !== null) {\n      setCurrentlyValidatingElement$1(fragment);\n\n      error('Invalid attribute `ref` supplied to `React.Fragment`.');\n\n      setCurrentlyValidatingElement$1(null);\n    }\n  }\n}\n\nfunction jsxWithValidation(type, props, key, isStaticChildren, source, self) {\n  {\n    var validType = isValidElementType(type); // We warn in this case but don't throw. We expect the element creation to\n    // succeed and there will likely be errors in render.\n\n    if (!validType) {\n      var info = '';\n\n      if (type === undefined || typeof type === 'object' && type !== null && Object.keys(type).length === 0) {\n        info += ' You likely forgot to export your component from the file ' + \"it's defined in, or you might have mixed up default and named imports.\";\n      }\n\n      var sourceInfo = getSourceInfoErrorAddendum(source);\n\n      if (sourceInfo) {\n        info += sourceInfo;\n      } else {\n        info += getDeclarationErrorAddendum();\n      }\n\n      var typeString;\n\n      if (type === null) {\n        typeString = 'null';\n      } else if (isArray(type)) {\n        typeString = 'array';\n      } else if (type !== undefined && type.$$typeof === REACT_ELEMENT_TYPE) {\n        typeString = \"<\" + (getComponentNameFromType(type.type) || 'Unknown') + \" />\";\n        info = ' Did you accidentally export a JSX literal instead of a component?';\n      } else {\n        typeString = typeof type;\n      }\n\n      error('React.jsx: type is invalid -- expected a string (for ' + 'built-in components) or a class/function (for composite ' + 'components) but got: %s.%s', typeString, info);\n    }\n\n    var element = jsxDEV(type, props, key, source, self); // The result can be nullish if a mock or a custom function is used.\n    // TODO: Drop this when these are no longer allowed as the type argument.\n\n    if (element == null) {\n      return element;\n    } // Skip key warning if the type isn't valid since our key validation logic\n    // doesn't expect a non-string/function type and can throw confusing errors.\n    // We don't want exception behavior to differ between dev and prod.\n    // (Rendering will throw with a helpful message and as soon as the type is\n    // fixed, the key warnings will appear.)\n\n\n    if (validType) {\n      var children = props.children;\n\n      if (children !== undefined) {\n        if (isStaticChildren) {\n          if (isArray(children)) {\n            for (var i = 0; i < children.length; i++) {\n              validateChildKeys(children[i], type);\n            }\n\n            if (Object.freeze) {\n              Object.freeze(children);\n            }\n          } else {\n            error('React.jsx: Static children should always be an array. ' + 'You are likely explicitly calling React.jsxs or React.jsxDEV. ' + 'Use the Babel transform instead.');\n          }\n        } else {\n          validateChildKeys(children, type);\n        }\n      }\n    }\n\n    if (type === REACT_FRAGMENT_TYPE) {\n      validateFragmentProps(element);\n    } else {\n      validatePropTypes(element);\n    }\n\n    return element;\n  }\n} // These two functions exist to still get child warnings in dev\n// even with the prod transform. This means that jsxDEV is purely\n// opt-in behavior for better messages but that we won't stop\n// giving you warnings if you use production apis.\n\nfunction jsxWithValidationStatic(type, props, key) {\n  {\n    return jsxWithValidation(type, props, key, true);\n  }\n}\nfunction jsxWithValidationDynamic(type, props, key) {\n  {\n    return jsxWithValidation(type, props, key, false);\n  }\n}\n\nvar jsx =  jsxWithValidationDynamic ; // we may want to special case jsxs internally to take advantage of static children.\n// for now we can ship identical prod functions\n\nvar jsxs =  jsxWithValidationStatic ;\n\nexports.Fragment = REACT_FRAGMENT_TYPE;\nexports.jsx = jsx;\nexports.jsxs = jsxs;\n  })();\n}\n","'use strict';\n\nif (process.env.NODE_ENV === 'production') {\n  module.exports = require('./cjs/react-jsx-runtime.production.min.js');\n} else {\n  module.exports = require('./cjs/react-jsx-runtime.development.js');\n}\n","// FIXME profile adding a per-Tree TreeNode cache, validating it by\n// parent pointer\n/// The default maximum length of a `TreeBuffer` node.\nconst DefaultBufferLength = 1024;\nlet nextPropID = 0;\nclass Range {\n    constructor(from, to) {\n        this.from = from;\n        this.to = to;\n    }\n}\n/// Each [node type](#common.NodeType) or [individual tree](#common.Tree)\n/// can have metadata associated with it in props. Instances of this\n/// class represent prop names.\nclass NodeProp {\n    /// Create a new node prop type.\n    constructor(config = {}) {\n        this.id = nextPropID++;\n        this.perNode = !!config.perNode;\n        this.deserialize = config.deserialize || (() => {\n            throw new Error(\"This node type doesn't define a deserialize function\");\n        });\n    }\n    /// This is meant to be used with\n    /// [`NodeSet.extend`](#common.NodeSet.extend) or\n    /// [`LRParser.configure`](#lr.ParserConfig.props) to compute\n    /// prop values for each node type in the set. Takes a [match\n    /// object](#common.NodeType^match) or function that returns undefined\n    /// if the node type doesn't get this prop, and the prop's value if\n    /// it does.\n    add(match) {\n        if (this.perNode)\n            throw new RangeError(\"Can't add per-node props to node types\");\n        if (typeof match != \"function\")\n            match = NodeType.match(match);\n        return (type) => {\n            let result = match(type);\n            return result === undefined ? null : [this, result];\n        };\n    }\n}\n/// Prop that is used to describe matching delimiters. For opening\n/// delimiters, this holds an array of node names (written as a\n/// space-separated string when declaring this prop in a grammar)\n/// for the node types of closing delimiters that match it.\nNodeProp.closedBy = new NodeProp({ deserialize: str => str.split(\" \") });\n/// The inverse of [`closedBy`](#common.NodeProp^closedBy). This is\n/// attached to closing delimiters, holding an array of node names\n/// of types of matching opening delimiters.\nNodeProp.openedBy = new NodeProp({ deserialize: str => str.split(\" \") });\n/// Used to assign node types to groups (for example, all node\n/// types that represent an expression could be tagged with an\n/// `\"Expression\"` group).\nNodeProp.group = new NodeProp({ deserialize: str => str.split(\" \") });\n/// The hash of the [context](#lr.ContextTracker.constructor)\n/// that the node was parsed in, if any. Used to limit reuse of\n/// contextual nodes.\nNodeProp.contextHash = new NodeProp({ perNode: true });\n/// The distance beyond the end of the node that the tokenizer\n/// looked ahead for any of the tokens inside the node. (The LR\n/// parser only stores this when it is larger than 25, for\n/// efficiency reasons.)\nNodeProp.lookAhead = new NodeProp({ perNode: true });\n/// This per-node prop is used to replace a given node, or part of a\n/// node, with another tree. This is useful to include trees from\n/// different languages in mixed-language parsers.\nNodeProp.mounted = new NodeProp({ perNode: true });\n/// A mounted tree, which can be [stored](#common.NodeProp^mounted) on\n/// a tree node to indicate that parts of its content are\n/// represented by another tree.\nclass MountedTree {\n    constructor(\n    /// The inner tree.\n    tree, \n    /// If this is null, this tree replaces the entire node (it will\n    /// be included in the regular iteration instead of its host\n    /// node). If not, only the given ranges are considered to be\n    /// covered by this tree. This is used for trees that are mixed in\n    /// a way that isn't strictly hierarchical. Such mounted trees are\n    /// only entered by [`resolveInner`](#common.Tree.resolveInner)\n    /// and [`enter`](#common.SyntaxNode.enter).\n    overlay, \n    /// The parser used to create this subtree.\n    parser) {\n        this.tree = tree;\n        this.overlay = overlay;\n        this.parser = parser;\n    }\n}\nconst noProps = Object.create(null);\n/// Each node in a syntax tree has a node type associated with it.\nclass NodeType {\n    /// @internal\n    constructor(\n    /// The name of the node type. Not necessarily unique, but if the\n    /// grammar was written properly, different node types with the\n    /// same name within a node set should play the same semantic\n    /// role.\n    name, \n    /// @internal\n    props, \n    /// The id of this node in its set. Corresponds to the term ids\n    /// used in the parser.\n    id, \n    /// @internal\n    flags = 0) {\n        this.name = name;\n        this.props = props;\n        this.id = id;\n        this.flags = flags;\n    }\n    /// Define a node type.\n    static define(spec) {\n        let props = spec.props && spec.props.length ? Object.create(null) : noProps;\n        let flags = (spec.top ? 1 /* NodeFlag.Top */ : 0) | (spec.skipped ? 2 /* NodeFlag.Skipped */ : 0) |\n            (spec.error ? 4 /* NodeFlag.Error */ : 0) | (spec.name == null ? 8 /* NodeFlag.Anonymous */ : 0);\n        let type = new NodeType(spec.name || \"\", props, spec.id, flags);\n        if (spec.props)\n            for (let src of spec.props) {\n                if (!Array.isArray(src))\n                    src = src(type);\n                if (src) {\n                    if (src[0].perNode)\n                        throw new RangeError(\"Can't store a per-node prop on a node type\");\n                    props[src[0].id] = src[1];\n                }\n            }\n        return type;\n    }\n    /// Retrieves a node prop for this type. Will return `undefined` if\n    /// the prop isn't present on this node.\n    prop(prop) { return this.props[prop.id]; }\n    /// True when this is the top node of a grammar.\n    get isTop() { return (this.flags & 1 /* NodeFlag.Top */) > 0; }\n    /// True when this node is produced by a skip rule.\n    get isSkipped() { return (this.flags & 2 /* NodeFlag.Skipped */) > 0; }\n    /// Indicates whether this is an error node.\n    get isError() { return (this.flags & 4 /* NodeFlag.Error */) > 0; }\n    /// When true, this node type doesn't correspond to a user-declared\n    /// named node, for example because it is used to cache repetition.\n    get isAnonymous() { return (this.flags & 8 /* NodeFlag.Anonymous */) > 0; }\n    /// Returns true when this node's name or one of its\n    /// [groups](#common.NodeProp^group) matches the given string.\n    is(name) {\n        if (typeof name == 'string') {\n            if (this.name == name)\n                return true;\n            let group = this.prop(NodeProp.group);\n            return group ? group.indexOf(name) > -1 : false;\n        }\n        return this.id == name;\n    }\n    /// Create a function from node types to arbitrary values by\n    /// specifying an object whose property names are node or\n    /// [group](#common.NodeProp^group) names. Often useful with\n    /// [`NodeProp.add`](#common.NodeProp.add). You can put multiple\n    /// names, separated by spaces, in a single property name to map\n    /// multiple node names to a single value.\n    static match(map) {\n        let direct = Object.create(null);\n        for (let prop in map)\n            for (let name of prop.split(\" \"))\n                direct[name] = map[prop];\n        return (node) => {\n            for (let groups = node.prop(NodeProp.group), i = -1; i < (groups ? groups.length : 0); i++) {\n                let found = direct[i < 0 ? node.name : groups[i]];\n                if (found)\n                    return found;\n            }\n        };\n    }\n}\n/// An empty dummy node type to use when no actual type is available.\nNodeType.none = new NodeType(\"\", Object.create(null), 0, 8 /* NodeFlag.Anonymous */);\n/// A node set holds a collection of node types. It is used to\n/// compactly represent trees by storing their type ids, rather than a\n/// full pointer to the type object, in a numeric array. Each parser\n/// [has](#lr.LRParser.nodeSet) a node set, and [tree\n/// buffers](#common.TreeBuffer) can only store collections of nodes\n/// from the same set. A set can have a maximum of 2**16 (65536) node\n/// types in it, so that the ids fit into 16-bit typed array slots.\nclass NodeSet {\n    /// Create a set with the given types. The `id` property of each\n    /// type should correspond to its position within the array.\n    constructor(\n    /// The node types in this set, by id.\n    types) {\n        this.types = types;\n        for (let i = 0; i < types.length; i++)\n            if (types[i].id != i)\n                throw new RangeError(\"Node type ids should correspond to array positions when creating a node set\");\n    }\n    /// Create a copy of this set with some node properties added. The\n    /// arguments to this method can be created with\n    /// [`NodeProp.add`](#common.NodeProp.add).\n    extend(...props) {\n        let newTypes = [];\n        for (let type of this.types) {\n            let newProps = null;\n            for (let source of props) {\n                let add = source(type);\n                if (add) {\n                    if (!newProps)\n                        newProps = Object.assign({}, type.props);\n                    newProps[add[0].id] = add[1];\n                }\n            }\n            newTypes.push(newProps ? new NodeType(type.name, newProps, type.id, type.flags) : type);\n        }\n        return new NodeSet(newTypes);\n    }\n}\nconst CachedNode = new WeakMap(), CachedInnerNode = new WeakMap();\n/// Options that control iteration. Can be combined with the `|`\n/// operator to enable multiple ones.\nvar IterMode;\n(function (IterMode) {\n    /// When enabled, iteration will only visit [`Tree`](#common.Tree)\n    /// objects, not nodes packed into\n    /// [`TreeBuffer`](#common.TreeBuffer)s.\n    IterMode[IterMode[\"ExcludeBuffers\"] = 1] = \"ExcludeBuffers\";\n    /// Enable this to make iteration include anonymous nodes (such as\n    /// the nodes that wrap repeated grammar constructs into a balanced\n    /// tree).\n    IterMode[IterMode[\"IncludeAnonymous\"] = 2] = \"IncludeAnonymous\";\n    /// By default, regular [mounted](#common.NodeProp^mounted) nodes\n    /// replace their base node in iteration. Enable this to ignore them\n    /// instead.\n    IterMode[IterMode[\"IgnoreMounts\"] = 4] = \"IgnoreMounts\";\n    /// This option only applies in\n    /// [`enter`](#common.SyntaxNode.enter)-style methods. It tells the\n    /// library to not enter mounted overlays if one covers the given\n    /// position.\n    IterMode[IterMode[\"IgnoreOverlays\"] = 8] = \"IgnoreOverlays\";\n})(IterMode || (IterMode = {}));\n/// A piece of syntax tree. There are two ways to approach these\n/// trees: the way they are actually stored in memory, and the\n/// convenient way.\n///\n/// Syntax trees are stored as a tree of `Tree` and `TreeBuffer`\n/// objects. By packing detail information into `TreeBuffer` leaf\n/// nodes, the representation is made a lot more memory-efficient.\n///\n/// However, when you want to actually work with tree nodes, this\n/// representation is very awkward, so most client code will want to\n/// use the [`TreeCursor`](#common.TreeCursor) or\n/// [`SyntaxNode`](#common.SyntaxNode) interface instead, which provides\n/// a view on some part of this data structure, and can be used to\n/// move around to adjacent nodes.\nclass Tree {\n    /// Construct a new tree. See also [`Tree.build`](#common.Tree^build).\n    constructor(\n    /// The type of the top node.\n    type, \n    /// This node's child nodes.\n    children, \n    /// The positions (offsets relative to the start of this tree) of\n    /// the children.\n    positions, \n    /// The total length of this tree\n    length, \n    /// Per-node [node props](#common.NodeProp) to associate with this node.\n    props) {\n        this.type = type;\n        this.children = children;\n        this.positions = positions;\n        this.length = length;\n        /// @internal\n        this.props = null;\n        if (props && props.length) {\n            this.props = Object.create(null);\n            for (let [prop, value] of props)\n                this.props[typeof prop == \"number\" ? prop : prop.id] = value;\n        }\n    }\n    /// @internal\n    toString() {\n        let mounted = this.prop(NodeProp.mounted);\n        if (mounted && !mounted.overlay)\n            return mounted.tree.toString();\n        let children = \"\";\n        for (let ch of this.children) {\n            let str = ch.toString();\n            if (str) {\n                if (children)\n                    children += \",\";\n                children += str;\n            }\n        }\n        return !this.type.name ? children :\n            (/\\W/.test(this.type.name) && !this.type.isError ? JSON.stringify(this.type.name) : this.type.name) +\n                (children.length ? \"(\" + children + \")\" : \"\");\n    }\n    /// Get a [tree cursor](#common.TreeCursor) positioned at the top of\n    /// the tree. Mode can be used to [control](#common.IterMode) which\n    /// nodes the cursor visits.\n    cursor(mode = 0) {\n        return new TreeCursor(this.topNode, mode);\n    }\n    /// Get a [tree cursor](#common.TreeCursor) pointing into this tree\n    /// at the given position and side (see\n    /// [`moveTo`](#common.TreeCursor.moveTo).\n    cursorAt(pos, side = 0, mode = 0) {\n        let scope = CachedNode.get(this) || this.topNode;\n        let cursor = new TreeCursor(scope);\n        cursor.moveTo(pos, side);\n        CachedNode.set(this, cursor._tree);\n        return cursor;\n    }\n    /// Get a [syntax node](#common.SyntaxNode) object for the top of the\n    /// tree.\n    get topNode() {\n        return new TreeNode(this, 0, 0, null);\n    }\n    /// Get the [syntax node](#common.SyntaxNode) at the given position.\n    /// If `side` is -1, this will move into nodes that end at the\n    /// position. If 1, it'll move into nodes that start at the\n    /// position. With 0, it'll only enter nodes that cover the position\n    /// from both sides.\n    ///\n    /// Note that this will not enter\n    /// [overlays](#common.MountedTree.overlay), and you often want\n    /// [`resolveInner`](#common.Tree.resolveInner) instead.\n    resolve(pos, side = 0) {\n        let node = resolveNode(CachedNode.get(this) || this.topNode, pos, side, false);\n        CachedNode.set(this, node);\n        return node;\n    }\n    /// Like [`resolve`](#common.Tree.resolve), but will enter\n    /// [overlaid](#common.MountedTree.overlay) nodes, producing a syntax node\n    /// pointing into the innermost overlaid tree at the given position\n    /// (with parent links going through all parent structure, including\n    /// the host trees).\n    resolveInner(pos, side = 0) {\n        let node = resolveNode(CachedInnerNode.get(this) || this.topNode, pos, side, true);\n        CachedInnerNode.set(this, node);\n        return node;\n    }\n    /// Iterate over the tree and its children, calling `enter` for any\n    /// node that touches the `from`/`to` region (if given) before\n    /// running over such a node's children, and `leave` (if given) when\n    /// leaving the node. When `enter` returns `false`, that node will\n    /// not have its children iterated over (or `leave` called).\n    iterate(spec) {\n        let { enter, leave, from = 0, to = this.length } = spec;\n        let mode = spec.mode || 0, anon = (mode & IterMode.IncludeAnonymous) > 0;\n        for (let c = this.cursor(mode | IterMode.IncludeAnonymous);;) {\n            let entered = false;\n            if (c.from <= to && c.to >= from && (!anon && c.type.isAnonymous || enter(c) !== false)) {\n                if (c.firstChild())\n                    continue;\n                entered = true;\n            }\n            for (;;) {\n                if (entered && leave && (anon || !c.type.isAnonymous))\n                    leave(c);\n                if (c.nextSibling())\n                    break;\n                if (!c.parent())\n                    return;\n                entered = true;\n            }\n        }\n    }\n    /// Get the value of the given [node prop](#common.NodeProp) for this\n    /// node. Works with both per-node and per-type props.\n    prop(prop) {\n        return !prop.perNode ? this.type.prop(prop) : this.props ? this.props[prop.id] : undefined;\n    }\n    /// Returns the node's [per-node props](#common.NodeProp.perNode) in a\n    /// format that can be passed to the [`Tree`](#common.Tree)\n    /// constructor.\n    get propValues() {\n        let result = [];\n        if (this.props)\n            for (let id in this.props)\n                result.push([+id, this.props[id]]);\n        return result;\n    }\n    /// Balance the direct children of this tree, producing a copy of\n    /// which may have children grouped into subtrees with type\n    /// [`NodeType.none`](#common.NodeType^none).\n    balance(config = {}) {\n        return this.children.length <= 8 /* Balance.BranchFactor */ ? this :\n            balanceRange(NodeType.none, this.children, this.positions, 0, this.children.length, 0, this.length, (children, positions, length) => new Tree(this.type, children, positions, length, this.propValues), config.makeTree || ((children, positions, length) => new Tree(NodeType.none, children, positions, length)));\n    }\n    /// Build a tree from a postfix-ordered buffer of node information,\n    /// or a cursor over such a buffer.\n    static build(data) { return buildTree(data); }\n}\n/// The empty tree\nTree.empty = new Tree(NodeType.none, [], [], 0);\nclass FlatBufferCursor {\n    constructor(buffer, index) {\n        this.buffer = buffer;\n        this.index = index;\n    }\n    get id() { return this.buffer[this.index - 4]; }\n    get start() { return this.buffer[this.index - 3]; }\n    get end() { return this.buffer[this.index - 2]; }\n    get size() { return this.buffer[this.index - 1]; }\n    get pos() { return this.index; }\n    next() { this.index -= 4; }\n    fork() { return new FlatBufferCursor(this.buffer, this.index); }\n}\n/// Tree buffers contain (type, start, end, endIndex) quads for each\n/// node. In such a buffer, nodes are stored in prefix order (parents\n/// before children, with the endIndex of the parent indicating which\n/// children belong to it).\nclass TreeBuffer {\n    /// Create a tree buffer.\n    constructor(\n    /// The buffer's content.\n    buffer, \n    /// The total length of the group of nodes in the buffer.\n    length, \n    /// The node set used in this buffer.\n    set) {\n        this.buffer = buffer;\n        this.length = length;\n        this.set = set;\n    }\n    /// @internal\n    get type() { return NodeType.none; }\n    /// @internal\n    toString() {\n        let result = [];\n        for (let index = 0; index < this.buffer.length;) {\n            result.push(this.childString(index));\n            index = this.buffer[index + 3];\n        }\n        return result.join(\",\");\n    }\n    /// @internal\n    childString(index) {\n        let id = this.buffer[index], endIndex = this.buffer[index + 3];\n        let type = this.set.types[id], result = type.name;\n        if (/\\W/.test(result) && !type.isError)\n            result = JSON.stringify(result);\n        index += 4;\n        if (endIndex == index)\n            return result;\n        let children = [];\n        while (index < endIndex) {\n            children.push(this.childString(index));\n            index = this.buffer[index + 3];\n        }\n        return result + \"(\" + children.join(\",\") + \")\";\n    }\n    /// @internal\n    findChild(startIndex, endIndex, dir, pos, side) {\n        let { buffer } = this, pick = -1;\n        for (let i = startIndex; i != endIndex; i = buffer[i + 3]) {\n            if (checkSide(side, pos, buffer[i + 1], buffer[i + 2])) {\n                pick = i;\n                if (dir > 0)\n                    break;\n            }\n        }\n        return pick;\n    }\n    /// @internal\n    slice(startI, endI, from) {\n        let b = this.buffer;\n        let copy = new Uint16Array(endI - startI), len = 0;\n        for (let i = startI, j = 0; i < endI;) {\n            copy[j++] = b[i++];\n            copy[j++] = b[i++] - from;\n            let to = copy[j++] = b[i++] - from;\n            copy[j++] = b[i++] - startI;\n            len = Math.max(len, to);\n        }\n        return new TreeBuffer(copy, len, this.set);\n    }\n}\nfunction checkSide(side, pos, from, to) {\n    switch (side) {\n        case -2 /* Side.Before */: return from < pos;\n        case -1 /* Side.AtOrBefore */: return to >= pos && from < pos;\n        case 0 /* Side.Around */: return from < pos && to > pos;\n        case 1 /* Side.AtOrAfter */: return from <= pos && to > pos;\n        case 2 /* Side.After */: return to > pos;\n        case 4 /* Side.DontCare */: return true;\n    }\n}\nfunction enterUnfinishedNodesBefore(node, pos) {\n    let scan = node.childBefore(pos);\n    while (scan) {\n        let last = scan.lastChild;\n        if (!last || last.to != scan.to)\n            break;\n        if (last.type.isError && last.from == last.to) {\n            node = scan;\n            scan = last.prevSibling;\n        }\n        else {\n            scan = last;\n        }\n    }\n    return node;\n}\nfunction resolveNode(node, pos, side, overlays) {\n    var _a;\n    // Move up to a node that actually holds the position, if possible\n    while (node.from == node.to ||\n        (side < 1 ? node.from >= pos : node.from > pos) ||\n        (side > -1 ? node.to <= pos : node.to < pos)) {\n        let parent = !overlays && node instanceof TreeNode && node.index < 0 ? null : node.parent;\n        if (!parent)\n            return node;\n        node = parent;\n    }\n    let mode = overlays ? 0 : IterMode.IgnoreOverlays;\n    // Must go up out of overlays when those do not overlap with pos\n    if (overlays)\n        for (let scan = node, parent = scan.parent; parent; scan = parent, parent = scan.parent) {\n            if (scan instanceof TreeNode && scan.index < 0 && ((_a = parent.enter(pos, side, mode)) === null || _a === void 0 ? void 0 : _a.from) != scan.from)\n                node = parent;\n        }\n    for (;;) {\n        let inner = node.enter(pos, side, mode);\n        if (!inner)\n            return node;\n        node = inner;\n    }\n}\nclass TreeNode {\n    constructor(_tree, from, \n    // Index in parent node, set to -1 if the node is not a direct child of _parent.node (overlay)\n    index, _parent) {\n        this._tree = _tree;\n        this.from = from;\n        this.index = index;\n        this._parent = _parent;\n    }\n    get type() { return this._tree.type; }\n    get name() { return this._tree.type.name; }\n    get to() { return this.from + this._tree.length; }\n    nextChild(i, dir, pos, side, mode = 0) {\n        for (let parent = this;;) {\n            for (let { children, positions } = parent._tree, e = dir > 0 ? children.length : -1; i != e; i += dir) {\n                let next = children[i], start = positions[i] + parent.from;\n                if (!checkSide(side, pos, start, start + next.length))\n                    continue;\n                if (next instanceof TreeBuffer) {\n                    if (mode & IterMode.ExcludeBuffers)\n                        continue;\n                    let index = next.findChild(0, next.buffer.length, dir, pos - start, side);\n                    if (index > -1)\n                        return new BufferNode(new BufferContext(parent, next, i, start), null, index);\n                }\n                else if ((mode & IterMode.IncludeAnonymous) || (!next.type.isAnonymous || hasChild(next))) {\n                    let mounted;\n                    if (!(mode & IterMode.IgnoreMounts) &&\n                        next.props && (mounted = next.prop(NodeProp.mounted)) && !mounted.overlay)\n                        return new TreeNode(mounted.tree, start, i, parent);\n                    let inner = new TreeNode(next, start, i, parent);\n                    return (mode & IterMode.IncludeAnonymous) || !inner.type.isAnonymous ? inner\n                        : inner.nextChild(dir < 0 ? next.children.length - 1 : 0, dir, pos, side);\n                }\n            }\n            if ((mode & IterMode.IncludeAnonymous) || !parent.type.isAnonymous)\n                return null;\n            if (parent.index >= 0)\n                i = parent.index + dir;\n            else\n                i = dir < 0 ? -1 : parent._parent._tree.children.length;\n            parent = parent._parent;\n            if (!parent)\n                return null;\n        }\n    }\n    get firstChild() { return this.nextChild(0, 1, 0, 4 /* Side.DontCare */); }\n    get lastChild() { return this.nextChild(this._tree.children.length - 1, -1, 0, 4 /* Side.DontCare */); }\n    childAfter(pos) { return this.nextChild(0, 1, pos, 2 /* Side.After */); }\n    childBefore(pos) { return this.nextChild(this._tree.children.length - 1, -1, pos, -2 /* Side.Before */); }\n    enter(pos, side, mode = 0) {\n        let mounted;\n        if (!(mode & IterMode.IgnoreOverlays) && (mounted = this._tree.prop(NodeProp.mounted)) && mounted.overlay) {\n            let rPos = pos - this.from;\n            for (let { from, to } of mounted.overlay) {\n                if ((side > 0 ? from <= rPos : from < rPos) &&\n                    (side < 0 ? to >= rPos : to > rPos))\n                    return new TreeNode(mounted.tree, mounted.overlay[0].from + this.from, -1, this);\n            }\n        }\n        return this.nextChild(0, 1, pos, side, mode);\n    }\n    nextSignificantParent() {\n        let val = this;\n        while (val.type.isAnonymous && val._parent)\n            val = val._parent;\n        return val;\n    }\n    get parent() {\n        return this._parent ? this._parent.nextSignificantParent() : null;\n    }\n    get nextSibling() {\n        return this._parent && this.index >= 0 ? this._parent.nextChild(this.index + 1, 1, 0, 4 /* Side.DontCare */) : null;\n    }\n    get prevSibling() {\n        return this._parent && this.index >= 0 ? this._parent.nextChild(this.index - 1, -1, 0, 4 /* Side.DontCare */) : null;\n    }\n    cursor(mode = 0) { return new TreeCursor(this, mode); }\n    get tree() { return this._tree; }\n    toTree() { return this._tree; }\n    resolve(pos, side = 0) {\n        return resolveNode(this, pos, side, false);\n    }\n    resolveInner(pos, side = 0) {\n        return resolveNode(this, pos, side, true);\n    }\n    enterUnfinishedNodesBefore(pos) { return enterUnfinishedNodesBefore(this, pos); }\n    getChild(type, before = null, after = null) {\n        let r = getChildren(this, type, before, after);\n        return r.length ? r[0] : null;\n    }\n    getChildren(type, before = null, after = null) {\n        return getChildren(this, type, before, after);\n    }\n    /// @internal\n    toString() { return this._tree.toString(); }\n    get node() { return this; }\n    matchContext(context) { return matchNodeContext(this, context); }\n}\nfunction getChildren(node, type, before, after) {\n    let cur = node.cursor(), result = [];\n    if (!cur.firstChild())\n        return result;\n    if (before != null)\n        while (!cur.type.is(before))\n            if (!cur.nextSibling())\n                return result;\n    for (;;) {\n        if (after != null && cur.type.is(after))\n            return result;\n        if (cur.type.is(type))\n            result.push(cur.node);\n        if (!cur.nextSibling())\n            return after == null ? result : [];\n    }\n}\nfunction matchNodeContext(node, context, i = context.length - 1) {\n    for (let p = node.parent; i >= 0; p = p.parent) {\n        if (!p)\n            return false;\n        if (!p.type.isAnonymous) {\n            if (context[i] && context[i] != p.name)\n                return false;\n            i--;\n        }\n    }\n    return true;\n}\nclass BufferContext {\n    constructor(parent, buffer, index, start) {\n        this.parent = parent;\n        this.buffer = buffer;\n        this.index = index;\n        this.start = start;\n    }\n}\nclass BufferNode {\n    get name() { return this.type.name; }\n    get from() { return this.context.start + this.context.buffer.buffer[this.index + 1]; }\n    get to() { return this.context.start + this.context.buffer.buffer[this.index + 2]; }\n    constructor(context, _parent, index) {\n        this.context = context;\n        this._parent = _parent;\n        this.index = index;\n        this.type = context.buffer.set.types[context.buffer.buffer[index]];\n    }\n    child(dir, pos, side) {\n        let { buffer } = this.context;\n        let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], dir, pos - this.context.start, side);\n        return index < 0 ? null : new BufferNode(this.context, this, index);\n    }\n    get firstChild() { return this.child(1, 0, 4 /* Side.DontCare */); }\n    get lastChild() { return this.child(-1, 0, 4 /* Side.DontCare */); }\n    childAfter(pos) { return this.child(1, pos, 2 /* Side.After */); }\n    childBefore(pos) { return this.child(-1, pos, -2 /* Side.Before */); }\n    enter(pos, side, mode = 0) {\n        if (mode & IterMode.ExcludeBuffers)\n            return null;\n        let { buffer } = this.context;\n        let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], side > 0 ? 1 : -1, pos - this.context.start, side);\n        return index < 0 ? null : new BufferNode(this.context, this, index);\n    }\n    get parent() {\n        return this._parent || this.context.parent.nextSignificantParent();\n    }\n    externalSibling(dir) {\n        return this._parent ? null : this.context.parent.nextChild(this.context.index + dir, dir, 0, 4 /* Side.DontCare */);\n    }\n    get nextSibling() {\n        let { buffer } = this.context;\n        let after = buffer.buffer[this.index + 3];\n        if (after < (this._parent ? buffer.buffer[this._parent.index + 3] : buffer.buffer.length))\n            return new BufferNode(this.context, this._parent, after);\n        return this.externalSibling(1);\n    }\n    get prevSibling() {\n        let { buffer } = this.context;\n        let parentStart = this._parent ? this._parent.index + 4 : 0;\n        if (this.index == parentStart)\n            return this.externalSibling(-1);\n        return new BufferNode(this.context, this._parent, buffer.findChild(parentStart, this.index, -1, 0, 4 /* Side.DontCare */));\n    }\n    cursor(mode = 0) { return new TreeCursor(this, mode); }\n    get tree() { return null; }\n    toTree() {\n        let children = [], positions = [];\n        let { buffer } = this.context;\n        let startI = this.index + 4, endI = buffer.buffer[this.index + 3];\n        if (endI > startI) {\n            let from = buffer.buffer[this.index + 1];\n            children.push(buffer.slice(startI, endI, from));\n            positions.push(0);\n        }\n        return new Tree(this.type, children, positions, this.to - this.from);\n    }\n    resolve(pos, side = 0) {\n        return resolveNode(this, pos, side, false);\n    }\n    resolveInner(pos, side = 0) {\n        return resolveNode(this, pos, side, true);\n    }\n    enterUnfinishedNodesBefore(pos) { return enterUnfinishedNodesBefore(this, pos); }\n    /// @internal\n    toString() { return this.context.buffer.childString(this.index); }\n    getChild(type, before = null, after = null) {\n        let r = getChildren(this, type, before, after);\n        return r.length ? r[0] : null;\n    }\n    getChildren(type, before = null, after = null) {\n        return getChildren(this, type, before, after);\n    }\n    get node() { return this; }\n    matchContext(context) { return matchNodeContext(this, context); }\n}\n/// A tree cursor object focuses on a given node in a syntax tree, and\n/// allows you to move to adjacent nodes.\nclass TreeCursor {\n    /// Shorthand for `.type.name`.\n    get name() { return this.type.name; }\n    /// @internal\n    constructor(node, \n    /// @internal\n    mode = 0) {\n        this.mode = mode;\n        /// @internal\n        this.buffer = null;\n        this.stack = [];\n        /// @internal\n        this.index = 0;\n        this.bufferNode = null;\n        if (node instanceof TreeNode) {\n            this.yieldNode(node);\n        }\n        else {\n            this._tree = node.context.parent;\n            this.buffer = node.context;\n            for (let n = node._parent; n; n = n._parent)\n                this.stack.unshift(n.index);\n            this.bufferNode = node;\n            this.yieldBuf(node.index);\n        }\n    }\n    yieldNode(node) {\n        if (!node)\n            return false;\n        this._tree = node;\n        this.type = node.type;\n        this.from = node.from;\n        this.to = node.to;\n        return true;\n    }\n    yieldBuf(index, type) {\n        this.index = index;\n        let { start, buffer } = this.buffer;\n        this.type = type || buffer.set.types[buffer.buffer[index]];\n        this.from = start + buffer.buffer[index + 1];\n        this.to = start + buffer.buffer[index + 2];\n        return true;\n    }\n    yield(node) {\n        if (!node)\n            return false;\n        if (node instanceof TreeNode) {\n            this.buffer = null;\n            return this.yieldNode(node);\n        }\n        this.buffer = node.context;\n        return this.yieldBuf(node.index, node.type);\n    }\n    /// @internal\n    toString() {\n        return this.buffer ? this.buffer.buffer.childString(this.index) : this._tree.toString();\n    }\n    /// @internal\n    enterChild(dir, pos, side) {\n        if (!this.buffer)\n            return this.yield(this._tree.nextChild(dir < 0 ? this._tree._tree.children.length - 1 : 0, dir, pos, side, this.mode));\n        let { buffer } = this.buffer;\n        let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], dir, pos - this.buffer.start, side);\n        if (index < 0)\n            return false;\n        this.stack.push(this.index);\n        return this.yieldBuf(index);\n    }\n    /// Move the cursor to this node's first child. When this returns\n    /// false, the node has no child, and the cursor has not been moved.\n    firstChild() { return this.enterChild(1, 0, 4 /* Side.DontCare */); }\n    /// Move the cursor to this node's last child.\n    lastChild() { return this.enterChild(-1, 0, 4 /* Side.DontCare */); }\n    /// Move the cursor to the first child that ends after `pos`.\n    childAfter(pos) { return this.enterChild(1, pos, 2 /* Side.After */); }\n    /// Move to the last child that starts before `pos`.\n    childBefore(pos) { return this.enterChild(-1, pos, -2 /* Side.Before */); }\n    /// Move the cursor to the child around `pos`. If side is -1 the\n    /// child may end at that position, when 1 it may start there. This\n    /// will also enter [overlaid](#common.MountedTree.overlay)\n    /// [mounted](#common.NodeProp^mounted) trees unless `overlays` is\n    /// set to false.\n    enter(pos, side, mode = this.mode) {\n        if (!this.buffer)\n            return this.yield(this._tree.enter(pos, side, mode));\n        return mode & IterMode.ExcludeBuffers ? false : this.enterChild(1, pos, side);\n    }\n    /// Move to the node's parent node, if this isn't the top node.\n    parent() {\n        if (!this.buffer)\n            return this.yieldNode((this.mode & IterMode.IncludeAnonymous) ? this._tree._parent : this._tree.parent);\n        if (this.stack.length)\n            return this.yieldBuf(this.stack.pop());\n        let parent = (this.mode & IterMode.IncludeAnonymous) ? this.buffer.parent : this.buffer.parent.nextSignificantParent();\n        this.buffer = null;\n        return this.yieldNode(parent);\n    }\n    /// @internal\n    sibling(dir) {\n        if (!this.buffer)\n            return !this._tree._parent ? false\n                : this.yield(this._tree.index < 0 ? null\n                    : this._tree._parent.nextChild(this._tree.index + dir, dir, 0, 4 /* Side.DontCare */, this.mode));\n        let { buffer } = this.buffer, d = this.stack.length - 1;\n        if (dir < 0) {\n            let parentStart = d < 0 ? 0 : this.stack[d] + 4;\n            if (this.index != parentStart)\n                return this.yieldBuf(buffer.findChild(parentStart, this.index, -1, 0, 4 /* Side.DontCare */));\n        }\n        else {\n            let after = buffer.buffer[this.index + 3];\n            if (after < (d < 0 ? buffer.buffer.length : buffer.buffer[this.stack[d] + 3]))\n                return this.yieldBuf(after);\n        }\n        return d < 0 ? this.yield(this.buffer.parent.nextChild(this.buffer.index + dir, dir, 0, 4 /* Side.DontCare */, this.mode)) : false;\n    }\n    /// Move to this node's next sibling, if any.\n    nextSibling() { return this.sibling(1); }\n    /// Move to this node's previous sibling, if any.\n    prevSibling() { return this.sibling(-1); }\n    atLastNode(dir) {\n        let index, parent, { buffer } = this;\n        if (buffer) {\n            if (dir > 0) {\n                if (this.index < buffer.buffer.buffer.length)\n                    return false;\n            }\n            else {\n                for (let i = 0; i < this.index; i++)\n                    if (buffer.buffer.buffer[i + 3] < this.index)\n                        return false;\n            }\n            ({ index, parent } = buffer);\n        }\n        else {\n            ({ index, _parent: parent } = this._tree);\n        }\n        for (; parent; { index, _parent: parent } = parent) {\n            if (index > -1)\n                for (let i = index + dir, e = dir < 0 ? -1 : parent._tree.children.length; i != e; i += dir) {\n                    let child = parent._tree.children[i];\n                    if ((this.mode & IterMode.IncludeAnonymous) ||\n                        child instanceof TreeBuffer ||\n                        !child.type.isAnonymous ||\n                        hasChild(child))\n                        return false;\n                }\n        }\n        return true;\n    }\n    move(dir, enter) {\n        if (enter && this.enterChild(dir, 0, 4 /* Side.DontCare */))\n            return true;\n        for (;;) {\n            if (this.sibling(dir))\n                return true;\n            if (this.atLastNode(dir) || !this.parent())\n                return false;\n        }\n    }\n    /// Move to the next node in a\n    /// [pre-order](https://en.wikipedia.org/wiki/Tree_traversal#Pre-order,_NLR)\n    /// traversal, going from a node to its first child or, if the\n    /// current node is empty or `enter` is false, its next sibling or\n    /// the next sibling of the first parent node that has one.\n    next(enter = true) { return this.move(1, enter); }\n    /// Move to the next node in a last-to-first pre-order traveral. A\n    /// node is followed by its last child or, if it has none, its\n    /// previous sibling or the previous sibling of the first parent\n    /// node that has one.\n    prev(enter = true) { return this.move(-1, enter); }\n    /// Move the cursor to the innermost node that covers `pos`. If\n    /// `side` is -1, it will enter nodes that end at `pos`. If it is 1,\n    /// it will enter nodes that start at `pos`.\n    moveTo(pos, side = 0) {\n        // Move up to a node that actually holds the position, if possible\n        while (this.from == this.to ||\n            (side < 1 ? this.from >= pos : this.from > pos) ||\n            (side > -1 ? this.to <= pos : this.to < pos))\n            if (!this.parent())\n                break;\n        // Then scan down into child nodes as far as possible\n        while (this.enterChild(1, pos, side)) { }\n        return this;\n    }\n    /// Get a [syntax node](#common.SyntaxNode) at the cursor's current\n    /// position.\n    get node() {\n        if (!this.buffer)\n            return this._tree;\n        let cache = this.bufferNode, result = null, depth = 0;\n        if (cache && cache.context == this.buffer) {\n            scan: for (let index = this.index, d = this.stack.length; d >= 0;) {\n                for (let c = cache; c; c = c._parent)\n                    if (c.index == index) {\n                        if (index == this.index)\n                            return c;\n                        result = c;\n                        depth = d + 1;\n                        break scan;\n                    }\n                index = this.stack[--d];\n            }\n        }\n        for (let i = depth; i < this.stack.length; i++)\n            result = new BufferNode(this.buffer, result, this.stack[i]);\n        return this.bufferNode = new BufferNode(this.buffer, result, this.index);\n    }\n    /// Get the [tree](#common.Tree) that represents the current node, if\n    /// any. Will return null when the node is in a [tree\n    /// buffer](#common.TreeBuffer).\n    get tree() {\n        return this.buffer ? null : this._tree._tree;\n    }\n    /// Iterate over the current node and all its descendants, calling\n    /// `enter` when entering a node and `leave`, if given, when leaving\n    /// one. When `enter` returns `false`, any children of that node are\n    /// skipped, and `leave` isn't called for it.\n    iterate(enter, leave) {\n        for (let depth = 0;;) {\n            let mustLeave = false;\n            if (this.type.isAnonymous || enter(this) !== false) {\n                if (this.firstChild()) {\n                    depth++;\n                    continue;\n                }\n                if (!this.type.isAnonymous)\n                    mustLeave = true;\n            }\n            for (;;) {\n                if (mustLeave && leave)\n                    leave(this);\n                mustLeave = this.type.isAnonymous;\n                if (this.nextSibling())\n                    break;\n                if (!depth)\n                    return;\n                this.parent();\n                depth--;\n                mustLeave = true;\n            }\n        }\n    }\n    /// Test whether the current node matches a given context—a sequence\n    /// of direct parent node names. Empty strings in the context array\n    /// are treated as wildcards.\n    matchContext(context) {\n        if (!this.buffer)\n            return matchNodeContext(this.node, context);\n        let { buffer } = this.buffer, { types } = buffer.set;\n        for (let i = context.length - 1, d = this.stack.length - 1; i >= 0; d--) {\n            if (d < 0)\n                return matchNodeContext(this.node, context, i);\n            let type = types[buffer.buffer[this.stack[d]]];\n            if (!type.isAnonymous) {\n                if (context[i] && context[i] != type.name)\n                    return false;\n                i--;\n            }\n        }\n        return true;\n    }\n}\nfunction hasChild(tree) {\n    return tree.children.some(ch => ch instanceof TreeBuffer || !ch.type.isAnonymous || hasChild(ch));\n}\nfunction buildTree(data) {\n    var _a;\n    let { buffer, nodeSet, maxBufferLength = DefaultBufferLength, reused = [], minRepeatType = nodeSet.types.length } = data;\n    let cursor = Array.isArray(buffer) ? new FlatBufferCursor(buffer, buffer.length) : buffer;\n    let types = nodeSet.types;\n    let contextHash = 0, lookAhead = 0;\n    function takeNode(parentStart, minPos, children, positions, inRepeat) {\n        let { id, start, end, size } = cursor;\n        let lookAheadAtStart = lookAhead;\n        while (size < 0) {\n            cursor.next();\n            if (size == -1 /* SpecialRecord.Reuse */) {\n                let node = reused[id];\n                children.push(node);\n                positions.push(start - parentStart);\n                return;\n            }\n            else if (size == -3 /* SpecialRecord.ContextChange */) { // Context change\n                contextHash = id;\n                return;\n            }\n            else if (size == -4 /* SpecialRecord.LookAhead */) {\n                lookAhead = id;\n                return;\n            }\n            else {\n                throw new RangeError(`Unrecognized record size: ${size}`);\n            }\n        }\n        let type = types[id], node, buffer;\n        let startPos = start - parentStart;\n        if (end - start <= maxBufferLength && (buffer = findBufferSize(cursor.pos - minPos, inRepeat))) {\n            // Small enough for a buffer, and no reused nodes inside\n            let data = new Uint16Array(buffer.size - buffer.skip);\n            let endPos = cursor.pos - buffer.size, index = data.length;\n            while (cursor.pos > endPos)\n                index = copyToBuffer(buffer.start, data, index);\n            node = new TreeBuffer(data, end - buffer.start, nodeSet);\n            startPos = buffer.start - parentStart;\n        }\n        else { // Make it a node\n            let endPos = cursor.pos - size;\n            cursor.next();\n            let localChildren = [], localPositions = [];\n            let localInRepeat = id >= minRepeatType ? id : -1;\n            let lastGroup = 0, lastEnd = end;\n            while (cursor.pos > endPos) {\n                if (localInRepeat >= 0 && cursor.id == localInRepeat && cursor.size >= 0) {\n                    if (cursor.end <= lastEnd - maxBufferLength) {\n                        makeRepeatLeaf(localChildren, localPositions, start, lastGroup, cursor.end, lastEnd, localInRepeat, lookAheadAtStart);\n                        lastGroup = localChildren.length;\n                        lastEnd = cursor.end;\n                    }\n                    cursor.next();\n                }\n                else {\n                    takeNode(start, endPos, localChildren, localPositions, localInRepeat);\n                }\n            }\n            if (localInRepeat >= 0 && lastGroup > 0 && lastGroup < localChildren.length)\n                makeRepeatLeaf(localChildren, localPositions, start, lastGroup, start, lastEnd, localInRepeat, lookAheadAtStart);\n            localChildren.reverse();\n            localPositions.reverse();\n            if (localInRepeat > -1 && lastGroup > 0) {\n                let make = makeBalanced(type);\n                node = balanceRange(type, localChildren, localPositions, 0, localChildren.length, 0, end - start, make, make);\n            }\n            else {\n                node = makeTree(type, localChildren, localPositions, end - start, lookAheadAtStart - end);\n            }\n        }\n        children.push(node);\n        positions.push(startPos);\n    }\n    function makeBalanced(type) {\n        return (children, positions, length) => {\n            let lookAhead = 0, lastI = children.length - 1, last, lookAheadProp;\n            if (lastI >= 0 && (last = children[lastI]) instanceof Tree) {\n                if (!lastI && last.type == type && last.length == length)\n                    return last;\n                if (lookAheadProp = last.prop(NodeProp.lookAhead))\n                    lookAhead = positions[lastI] + last.length + lookAheadProp;\n            }\n            return makeTree(type, children, positions, length, lookAhead);\n        };\n    }\n    function makeRepeatLeaf(children, positions, base, i, from, to, type, lookAhead) {\n        let localChildren = [], localPositions = [];\n        while (children.length > i) {\n            localChildren.push(children.pop());\n            localPositions.push(positions.pop() + base - from);\n        }\n        children.push(makeTree(nodeSet.types[type], localChildren, localPositions, to - from, lookAhead - to));\n        positions.push(from - base);\n    }\n    function makeTree(type, children, positions, length, lookAhead = 0, props) {\n        if (contextHash) {\n            let pair = [NodeProp.contextHash, contextHash];\n            props = props ? [pair].concat(props) : [pair];\n        }\n        if (lookAhead > 25) {\n            let pair = [NodeProp.lookAhead, lookAhead];\n            props = props ? [pair].concat(props) : [pair];\n        }\n        return new Tree(type, children, positions, length, props);\n    }\n    function findBufferSize(maxSize, inRepeat) {\n        // Scan through the buffer to find previous siblings that fit\n        // together in a TreeBuffer, and don't contain any reused nodes\n        // (which can't be stored in a buffer).\n        // If `inRepeat` is > -1, ignore node boundaries of that type for\n        // nesting, but make sure the end falls either at the start\n        // (`maxSize`) or before such a node.\n        let fork = cursor.fork();\n        let size = 0, start = 0, skip = 0, minStart = fork.end - maxBufferLength;\n        let result = { size: 0, start: 0, skip: 0 };\n        scan: for (let minPos = fork.pos - maxSize; fork.pos > minPos;) {\n            let nodeSize = fork.size;\n            // Pretend nested repeat nodes of the same type don't exist\n            if (fork.id == inRepeat && nodeSize >= 0) {\n                // Except that we store the current state as a valid return\n                // value.\n                result.size = size;\n                result.start = start;\n                result.skip = skip;\n                skip += 4;\n                size += 4;\n                fork.next();\n                continue;\n            }\n            let startPos = fork.pos - nodeSize;\n            if (nodeSize < 0 || startPos < minPos || fork.start < minStart)\n                break;\n            let localSkipped = fork.id >= minRepeatType ? 4 : 0;\n            let nodeStart = fork.start;\n            fork.next();\n            while (fork.pos > startPos) {\n                if (fork.size < 0) {\n                    if (fork.size == -3 /* SpecialRecord.ContextChange */)\n                        localSkipped += 4;\n                    else\n                        break scan;\n                }\n                else if (fork.id >= minRepeatType) {\n                    localSkipped += 4;\n                }\n                fork.next();\n            }\n            start = nodeStart;\n            size += nodeSize;\n            skip += localSkipped;\n        }\n        if (inRepeat < 0 || size == maxSize) {\n            result.size = size;\n            result.start = start;\n            result.skip = skip;\n        }\n        return result.size > 4 ? result : undefined;\n    }\n    function copyToBuffer(bufferStart, buffer, index) {\n        let { id, start, end, size } = cursor;\n        cursor.next();\n        if (size >= 0 && id < minRepeatType) {\n            let startIndex = index;\n            if (size > 4) {\n                let endPos = cursor.pos - (size - 4);\n                while (cursor.pos > endPos)\n                    index = copyToBuffer(bufferStart, buffer, index);\n            }\n            buffer[--index] = startIndex;\n            buffer[--index] = end - bufferStart;\n            buffer[--index] = start - bufferStart;\n            buffer[--index] = id;\n        }\n        else if (size == -3 /* SpecialRecord.ContextChange */) {\n            contextHash = id;\n        }\n        else if (size == -4 /* SpecialRecord.LookAhead */) {\n            lookAhead = id;\n        }\n        return index;\n    }\n    let children = [], positions = [];\n    while (cursor.pos > 0)\n        takeNode(data.start || 0, data.bufferStart || 0, children, positions, -1);\n    let length = (_a = data.length) !== null && _a !== void 0 ? _a : (children.length ? positions[0] + children[0].length : 0);\n    return new Tree(types[data.topID], children.reverse(), positions.reverse(), length);\n}\nconst nodeSizeCache = new WeakMap;\nfunction nodeSize(balanceType, node) {\n    if (!balanceType.isAnonymous || node instanceof TreeBuffer || node.type != balanceType)\n        return 1;\n    let size = nodeSizeCache.get(node);\n    if (size == null) {\n        size = 1;\n        for (let child of node.children) {\n            if (child.type != balanceType || !(child instanceof Tree)) {\n                size = 1;\n                break;\n            }\n            size += nodeSize(balanceType, child);\n        }\n        nodeSizeCache.set(node, size);\n    }\n    return size;\n}\nfunction balanceRange(\n// The type the balanced tree's inner nodes.\nbalanceType, \n// The direct children and their positions\nchildren, positions, \n// The index range in children/positions to use\nfrom, to, \n// The start position of the nodes, relative to their parent.\nstart, \n// Length of the outer node\nlength, \n// Function to build the top node of the balanced tree\nmkTop, \n// Function to build internal nodes for the balanced tree\nmkTree) {\n    let total = 0;\n    for (let i = from; i < to; i++)\n        total += nodeSize(balanceType, children[i]);\n    let maxChild = Math.ceil((total * 1.5) / 8 /* Balance.BranchFactor */);\n    let localChildren = [], localPositions = [];\n    function divide(children, positions, from, to, offset) {\n        for (let i = from; i < to;) {\n            let groupFrom = i, groupStart = positions[i], groupSize = nodeSize(balanceType, children[i]);\n            i++;\n            for (; i < to; i++) {\n                let nextSize = nodeSize(balanceType, children[i]);\n                if (groupSize + nextSize >= maxChild)\n                    break;\n                groupSize += nextSize;\n            }\n            if (i == groupFrom + 1) {\n                if (groupSize > maxChild) {\n                    let only = children[groupFrom]; // Only trees can have a size > 1\n                    divide(only.children, only.positions, 0, only.children.length, positions[groupFrom] + offset);\n                    continue;\n                }\n                localChildren.push(children[groupFrom]);\n            }\n            else {\n                let length = positions[i - 1] + children[i - 1].length - groupStart;\n                localChildren.push(balanceRange(balanceType, children, positions, groupFrom, i, groupStart, length, null, mkTree));\n            }\n            localPositions.push(groupStart + offset - start);\n        }\n    }\n    divide(children, positions, from, to, 0);\n    return (mkTop || mkTree)(localChildren, localPositions, length);\n}\n/// Provides a way to associate values with pieces of trees. As long\n/// as that part of the tree is reused, the associated values can be\n/// retrieved from an updated tree.\nclass NodeWeakMap {\n    constructor() {\n        this.map = new WeakMap();\n    }\n    setBuffer(buffer, index, value) {\n        let inner = this.map.get(buffer);\n        if (!inner)\n            this.map.set(buffer, inner = new Map);\n        inner.set(index, value);\n    }\n    getBuffer(buffer, index) {\n        let inner = this.map.get(buffer);\n        return inner && inner.get(index);\n    }\n    /// Set the value for this syntax node.\n    set(node, value) {\n        if (node instanceof BufferNode)\n            this.setBuffer(node.context.buffer, node.index, value);\n        else if (node instanceof TreeNode)\n            this.map.set(node.tree, value);\n    }\n    /// Retrieve value for this syntax node, if it exists in the map.\n    get(node) {\n        return node instanceof BufferNode ? this.getBuffer(node.context.buffer, node.index)\n            : node instanceof TreeNode ? this.map.get(node.tree) : undefined;\n    }\n    /// Set the value for the node that a cursor currently points to.\n    cursorSet(cursor, value) {\n        if (cursor.buffer)\n            this.setBuffer(cursor.buffer.buffer, cursor.index, value);\n        else\n            this.map.set(cursor.tree, value);\n    }\n    /// Retrieve the value for the node that a cursor currently points\n    /// to.\n    cursorGet(cursor) {\n        return cursor.buffer ? this.getBuffer(cursor.buffer.buffer, cursor.index) : this.map.get(cursor.tree);\n    }\n}\n\n/// Tree fragments are used during [incremental\n/// parsing](#common.Parser.startParse) to track parts of old trees\n/// that can be reused in a new parse. An array of fragments is used\n/// to track regions of an old tree whose nodes might be reused in new\n/// parses. Use the static\n/// [`applyChanges`](#common.TreeFragment^applyChanges) method to\n/// update fragments for document changes.\nclass TreeFragment {\n    /// Construct a tree fragment. You'll usually want to use\n    /// [`addTree`](#common.TreeFragment^addTree) and\n    /// [`applyChanges`](#common.TreeFragment^applyChanges) instead of\n    /// calling this directly.\n    constructor(\n    /// The start of the unchanged range pointed to by this fragment.\n    /// This refers to an offset in the _updated_ document (as opposed\n    /// to the original tree).\n    from, \n    /// The end of the unchanged range.\n    to, \n    /// The tree that this fragment is based on.\n    tree, \n    /// The offset between the fragment's tree and the document that\n    /// this fragment can be used against. Add this when going from\n    /// document to tree positions, subtract it to go from tree to\n    /// document positions.\n    offset, openStart = false, openEnd = false) {\n        this.from = from;\n        this.to = to;\n        this.tree = tree;\n        this.offset = offset;\n        this.open = (openStart ? 1 /* Open.Start */ : 0) | (openEnd ? 2 /* Open.End */ : 0);\n    }\n    /// Whether the start of the fragment represents the start of a\n    /// parse, or the end of a change. (In the second case, it may not\n    /// be safe to reuse some nodes at the start, depending on the\n    /// parsing algorithm.)\n    get openStart() { return (this.open & 1 /* Open.Start */) > 0; }\n    /// Whether the end of the fragment represents the end of a\n    /// full-document parse, or the start of a change.\n    get openEnd() { return (this.open & 2 /* Open.End */) > 0; }\n    /// Create a set of fragments from a freshly parsed tree, or update\n    /// an existing set of fragments by replacing the ones that overlap\n    /// with a tree with content from the new tree. When `partial` is\n    /// true, the parse is treated as incomplete, and the resulting\n    /// fragment has [`openEnd`](#common.TreeFragment.openEnd) set to\n    /// true.\n    static addTree(tree, fragments = [], partial = false) {\n        let result = [new TreeFragment(0, tree.length, tree, 0, false, partial)];\n        for (let f of fragments)\n            if (f.to > tree.length)\n                result.push(f);\n        return result;\n    }\n    /// Apply a set of edits to an array of fragments, removing or\n    /// splitting fragments as necessary to remove edited ranges, and\n    /// adjusting offsets for fragments that moved.\n    static applyChanges(fragments, changes, minGap = 128) {\n        if (!changes.length)\n            return fragments;\n        let result = [];\n        let fI = 1, nextF = fragments.length ? fragments[0] : null;\n        for (let cI = 0, pos = 0, off = 0;; cI++) {\n            let nextC = cI < changes.length ? changes[cI] : null;\n            let nextPos = nextC ? nextC.fromA : 1e9;\n            if (nextPos - pos >= minGap)\n                while (nextF && nextF.from < nextPos) {\n                    let cut = nextF;\n                    if (pos >= cut.from || nextPos <= cut.to || off) {\n                        let fFrom = Math.max(cut.from, pos) - off, fTo = Math.min(cut.to, nextPos) - off;\n                        cut = fFrom >= fTo ? null : new TreeFragment(fFrom, fTo, cut.tree, cut.offset + off, cI > 0, !!nextC);\n                    }\n                    if (cut)\n                        result.push(cut);\n                    if (nextF.to > nextPos)\n                        break;\n                    nextF = fI < fragments.length ? fragments[fI++] : null;\n                }\n            if (!nextC)\n                break;\n            pos = nextC.toA;\n            off = nextC.toA - nextC.toB;\n        }\n        return result;\n    }\n}\n/// A superclass that parsers should extend.\nclass Parser {\n    /// Start a parse, returning a [partial parse](#common.PartialParse)\n    /// object. [`fragments`](#common.TreeFragment) can be passed in to\n    /// make the parse incremental.\n    ///\n    /// By default, the entire input is parsed. You can pass `ranges`,\n    /// which should be a sorted array of non-empty, non-overlapping\n    /// ranges, to parse only those ranges. The tree returned in that\n    /// case will start at `ranges[0].from`.\n    startParse(input, fragments, ranges) {\n        if (typeof input == \"string\")\n            input = new StringInput(input);\n        ranges = !ranges ? [new Range(0, input.length)] : ranges.length ? ranges.map(r => new Range(r.from, r.to)) : [new Range(0, 0)];\n        return this.createParse(input, fragments || [], ranges);\n    }\n    /// Run a full parse, returning the resulting tree.\n    parse(input, fragments, ranges) {\n        let parse = this.startParse(input, fragments, ranges);\n        for (;;) {\n            let done = parse.advance();\n            if (done)\n                return done;\n        }\n    }\n}\nclass StringInput {\n    constructor(string) {\n        this.string = string;\n    }\n    get length() { return this.string.length; }\n    chunk(from) { return this.string.slice(from); }\n    get lineChunks() { return false; }\n    read(from, to) { return this.string.slice(from, to); }\n}\n\n/// Create a parse wrapper that, after the inner parse completes,\n/// scans its tree for mixed language regions with the `nest`\n/// function, runs the resulting [inner parses](#common.NestedParse),\n/// and then [mounts](#common.NodeProp^mounted) their results onto the\n/// tree.\nfunction parseMixed(nest) {\n    return (parse, input, fragments, ranges) => new MixedParse(parse, nest, input, fragments, ranges);\n}\nclass InnerParse {\n    constructor(parser, parse, overlay, target, ranges) {\n        this.parser = parser;\n        this.parse = parse;\n        this.overlay = overlay;\n        this.target = target;\n        this.ranges = ranges;\n        if (!ranges.length || ranges.some(r => r.from >= r.to))\n            throw new RangeError(\"Invalid inner parse ranges given: \" + JSON.stringify(ranges));\n    }\n}\nclass ActiveOverlay {\n    constructor(parser, predicate, mounts, index, start, target, prev) {\n        this.parser = parser;\n        this.predicate = predicate;\n        this.mounts = mounts;\n        this.index = index;\n        this.start = start;\n        this.target = target;\n        this.prev = prev;\n        this.depth = 0;\n        this.ranges = [];\n    }\n}\nconst stoppedInner = new NodeProp({ perNode: true });\nclass MixedParse {\n    constructor(base, nest, input, fragments, ranges) {\n        this.nest = nest;\n        this.input = input;\n        this.fragments = fragments;\n        this.ranges = ranges;\n        this.inner = [];\n        this.innerDone = 0;\n        this.baseTree = null;\n        this.stoppedAt = null;\n        this.baseParse = base;\n    }\n    advance() {\n        if (this.baseParse) {\n            let done = this.baseParse.advance();\n            if (!done)\n                return null;\n            this.baseParse = null;\n            this.baseTree = done;\n            this.startInner();\n            if (this.stoppedAt != null)\n                for (let inner of this.inner)\n                    inner.parse.stopAt(this.stoppedAt);\n        }\n        if (this.innerDone == this.inner.length) {\n            let result = this.baseTree;\n            if (this.stoppedAt != null)\n                result = new Tree(result.type, result.children, result.positions, result.length, result.propValues.concat([[stoppedInner, this.stoppedAt]]));\n            return result;\n        }\n        let inner = this.inner[this.innerDone], done = inner.parse.advance();\n        if (done) {\n            this.innerDone++;\n            // This is a somewhat dodgy but super helpful hack where we\n            // patch up nodes created by the inner parse (and thus\n            // presumably not aliased anywhere else) to hold the information\n            // about the inner parse.\n            let props = Object.assign(Object.create(null), inner.target.props);\n            props[NodeProp.mounted.id] = new MountedTree(done, inner.overlay, inner.parser);\n            inner.target.props = props;\n        }\n        return null;\n    }\n    get parsedPos() {\n        if (this.baseParse)\n            return 0;\n        let pos = this.input.length;\n        for (let i = this.innerDone; i < this.inner.length; i++) {\n            if (this.inner[i].ranges[0].from < pos)\n                pos = Math.min(pos, this.inner[i].parse.parsedPos);\n        }\n        return pos;\n    }\n    stopAt(pos) {\n        this.stoppedAt = pos;\n        if (this.baseParse)\n            this.baseParse.stopAt(pos);\n        else\n            for (let i = this.innerDone; i < this.inner.length; i++)\n                this.inner[i].parse.stopAt(pos);\n    }\n    startInner() {\n        let fragmentCursor = new FragmentCursor(this.fragments);\n        let overlay = null;\n        let covered = null;\n        let cursor = new TreeCursor(new TreeNode(this.baseTree, this.ranges[0].from, 0, null), IterMode.IncludeAnonymous | IterMode.IgnoreMounts);\n        scan: for (let nest, isCovered; this.stoppedAt == null || cursor.from < this.stoppedAt;) {\n            let enter = true, range;\n            if (fragmentCursor.hasNode(cursor)) {\n                if (overlay) {\n                    let match = overlay.mounts.find(m => m.frag.from <= cursor.from && m.frag.to >= cursor.to && m.mount.overlay);\n                    if (match)\n                        for (let r of match.mount.overlay) {\n                            let from = r.from + match.pos, to = r.to + match.pos;\n                            if (from >= cursor.from && to <= cursor.to && !overlay.ranges.some(r => r.from < to && r.to > from))\n                                overlay.ranges.push({ from, to });\n                        }\n                }\n                enter = false;\n            }\n            else if (covered && (isCovered = checkCover(covered.ranges, cursor.from, cursor.to))) {\n                enter = isCovered != 2 /* Cover.Full */;\n            }\n            else if (!cursor.type.isAnonymous && cursor.from < cursor.to && (nest = this.nest(cursor, this.input))) {\n                if (!cursor.tree)\n                    materialize(cursor);\n                let oldMounts = fragmentCursor.findMounts(cursor.from, nest.parser);\n                if (typeof nest.overlay == \"function\") {\n                    overlay = new ActiveOverlay(nest.parser, nest.overlay, oldMounts, this.inner.length, cursor.from, cursor.tree, overlay);\n                }\n                else {\n                    let ranges = punchRanges(this.ranges, nest.overlay || [new Range(cursor.from, cursor.to)]);\n                    if (ranges.length)\n                        this.inner.push(new InnerParse(nest.parser, nest.parser.startParse(this.input, enterFragments(oldMounts, ranges), ranges), nest.overlay ? nest.overlay.map(r => new Range(r.from - cursor.from, r.to - cursor.from)) : null, cursor.tree, ranges));\n                    if (!nest.overlay)\n                        enter = false;\n                    else if (ranges.length)\n                        covered = { ranges, depth: 0, prev: covered };\n                }\n            }\n            else if (overlay && (range = overlay.predicate(cursor))) {\n                if (range === true)\n                    range = new Range(cursor.from, cursor.to);\n                if (range.from < range.to)\n                    overlay.ranges.push(range);\n            }\n            if (enter && cursor.firstChild()) {\n                if (overlay)\n                    overlay.depth++;\n                if (covered)\n                    covered.depth++;\n            }\n            else {\n                for (;;) {\n                    if (cursor.nextSibling())\n                        break;\n                    if (!cursor.parent())\n                        break scan;\n                    if (overlay && !--overlay.depth) {\n                        let ranges = punchRanges(this.ranges, overlay.ranges);\n                        if (ranges.length)\n                            this.inner.splice(overlay.index, 0, new InnerParse(overlay.parser, overlay.parser.startParse(this.input, enterFragments(overlay.mounts, ranges), ranges), overlay.ranges.map(r => new Range(r.from - overlay.start, r.to - overlay.start)), overlay.target, ranges));\n                        overlay = overlay.prev;\n                    }\n                    if (covered && !--covered.depth)\n                        covered = covered.prev;\n                }\n            }\n        }\n    }\n}\nfunction checkCover(covered, from, to) {\n    for (let range of covered) {\n        if (range.from >= to)\n            break;\n        if (range.to > from)\n            return range.from <= from && range.to >= to ? 2 /* Cover.Full */ : 1 /* Cover.Partial */;\n    }\n    return 0 /* Cover.None */;\n}\n// Take a piece of buffer and convert it into a stand-alone\n// TreeBuffer.\nfunction sliceBuf(buf, startI, endI, nodes, positions, off) {\n    if (startI < endI) {\n        let from = buf.buffer[startI + 1];\n        nodes.push(buf.slice(startI, endI, from));\n        positions.push(from - off);\n    }\n}\n// This function takes a node that's in a buffer, and converts it, and\n// its parent buffer nodes, into a Tree. This is again acting on the\n// assumption that the trees and buffers have been constructed by the\n// parse that was ran via the mix parser, and thus aren't shared with\n// any other code, making violations of the immutability safe.\nfunction materialize(cursor) {\n    let { node } = cursor, depth = 0;\n    // Scan up to the nearest tree\n    do {\n        cursor.parent();\n        depth++;\n    } while (!cursor.tree);\n    // Find the index of the buffer in that tree\n    let i = 0, base = cursor.tree, off = 0;\n    for (;; i++) {\n        off = base.positions[i] + cursor.from;\n        if (off <= node.from && off + base.children[i].length >= node.to)\n            break;\n    }\n    let buf = base.children[i], b = buf.buffer;\n    // Split a level in the buffer, putting the nodes before and after\n    // the child that contains `node` into new buffers.\n    function split(startI, endI, type, innerOffset, length) {\n        let i = startI;\n        while (b[i + 2] + off <= node.from)\n            i = b[i + 3];\n        let children = [], positions = [];\n        sliceBuf(buf, startI, i, children, positions, innerOffset);\n        let from = b[i + 1], to = b[i + 2];\n        let isTarget = from + off == node.from && to + off == node.to && b[i] == node.type.id;\n        children.push(isTarget ? node.toTree() : split(i + 4, b[i + 3], buf.set.types[b[i]], from, to - from));\n        positions.push(from - innerOffset);\n        sliceBuf(buf, b[i + 3], endI, children, positions, innerOffset);\n        return new Tree(type, children, positions, length);\n    }\n    base.children[i] = split(0, b.length, NodeType.none, 0, buf.length);\n    // Move the cursor back to the target node\n    for (let d = 0; d <= depth; d++)\n        cursor.childAfter(node.from);\n}\nclass StructureCursor {\n    constructor(root, offset) {\n        this.offset = offset;\n        this.done = false;\n        this.cursor = root.cursor(IterMode.IncludeAnonymous | IterMode.IgnoreMounts);\n    }\n    // Move to the first node (in pre-order) that starts at or after `pos`.\n    moveTo(pos) {\n        let { cursor } = this, p = pos - this.offset;\n        while (!this.done && cursor.from < p) {\n            if (cursor.to >= pos && cursor.enter(p, 1, IterMode.IgnoreOverlays | IterMode.ExcludeBuffers)) ;\n            else if (!cursor.next(false))\n                this.done = true;\n        }\n    }\n    hasNode(cursor) {\n        this.moveTo(cursor.from);\n        if (!this.done && this.cursor.from + this.offset == cursor.from && this.cursor.tree) {\n            for (let tree = this.cursor.tree;;) {\n                if (tree == cursor.tree)\n                    return true;\n                if (tree.children.length && tree.positions[0] == 0 && tree.children[0] instanceof Tree)\n                    tree = tree.children[0];\n                else\n                    break;\n            }\n        }\n        return false;\n    }\n}\nclass FragmentCursor {\n    constructor(fragments) {\n        var _a;\n        this.fragments = fragments;\n        this.curTo = 0;\n        this.fragI = 0;\n        if (fragments.length) {\n            let first = this.curFrag = fragments[0];\n            this.curTo = (_a = first.tree.prop(stoppedInner)) !== null && _a !== void 0 ? _a : first.to;\n            this.inner = new StructureCursor(first.tree, -first.offset);\n        }\n        else {\n            this.curFrag = this.inner = null;\n        }\n    }\n    hasNode(node) {\n        while (this.curFrag && node.from >= this.curTo)\n            this.nextFrag();\n        return this.curFrag && this.curFrag.from <= node.from && this.curTo >= node.to && this.inner.hasNode(node);\n    }\n    nextFrag() {\n        var _a;\n        this.fragI++;\n        if (this.fragI == this.fragments.length) {\n            this.curFrag = this.inner = null;\n        }\n        else {\n            let frag = this.curFrag = this.fragments[this.fragI];\n            this.curTo = (_a = frag.tree.prop(stoppedInner)) !== null && _a !== void 0 ? _a : frag.to;\n            this.inner = new StructureCursor(frag.tree, -frag.offset);\n        }\n    }\n    findMounts(pos, parser) {\n        var _a;\n        let result = [];\n        if (this.inner) {\n            this.inner.cursor.moveTo(pos, 1);\n            for (let pos = this.inner.cursor.node; pos; pos = pos.parent) {\n                let mount = (_a = pos.tree) === null || _a === void 0 ? void 0 : _a.prop(NodeProp.mounted);\n                if (mount && mount.parser == parser) {\n                    for (let i = this.fragI; i < this.fragments.length; i++) {\n                        let frag = this.fragments[i];\n                        if (frag.from >= pos.to)\n                            break;\n                        if (frag.tree == this.curFrag.tree)\n                            result.push({\n                                frag,\n                                pos: pos.from - frag.offset,\n                                mount\n                            });\n                    }\n                }\n            }\n        }\n        return result;\n    }\n}\nfunction punchRanges(outer, ranges) {\n    let copy = null, current = ranges;\n    for (let i = 1, j = 0; i < outer.length; i++) {\n        let gapFrom = outer[i - 1].to, gapTo = outer[i].from;\n        for (; j < current.length; j++) {\n            let r = current[j];\n            if (r.from >= gapTo)\n                break;\n            if (r.to <= gapFrom)\n                continue;\n            if (!copy)\n                current = copy = ranges.slice();\n            if (r.from < gapFrom) {\n                copy[j] = new Range(r.from, gapFrom);\n                if (r.to > gapTo)\n                    copy.splice(j + 1, 0, new Range(gapTo, r.to));\n            }\n            else if (r.to > gapTo) {\n                copy[j--] = new Range(gapTo, r.to);\n            }\n            else {\n                copy.splice(j--, 1);\n            }\n        }\n    }\n    return current;\n}\nfunction findCoverChanges(a, b, from, to) {\n    let iA = 0, iB = 0, inA = false, inB = false, pos = -1e9;\n    let result = [];\n    for (;;) {\n        let nextA = iA == a.length ? 1e9 : inA ? a[iA].to : a[iA].from;\n        let nextB = iB == b.length ? 1e9 : inB ? b[iB].to : b[iB].from;\n        if (inA != inB) {\n            let start = Math.max(pos, from), end = Math.min(nextA, nextB, to);\n            if (start < end)\n                result.push(new Range(start, end));\n        }\n        pos = Math.min(nextA, nextB);\n        if (pos == 1e9)\n            break;\n        if (nextA == pos) {\n            if (!inA)\n                inA = true;\n            else {\n                inA = false;\n                iA++;\n            }\n        }\n        if (nextB == pos) {\n            if (!inB)\n                inB = true;\n            else {\n                inB = false;\n                iB++;\n            }\n        }\n    }\n    return result;\n}\n// Given a number of fragments for the outer tree, and a set of ranges\n// to parse, find fragments for inner trees mounted around those\n// ranges, if any.\nfunction enterFragments(mounts, ranges) {\n    let result = [];\n    for (let { pos, mount, frag } of mounts) {\n        let startPos = pos + (mount.overlay ? mount.overlay[0].from : 0), endPos = startPos + mount.tree.length;\n        let from = Math.max(frag.from, startPos), to = Math.min(frag.to, endPos);\n        if (mount.overlay) {\n            let overlay = mount.overlay.map(r => new Range(r.from + pos, r.to + pos));\n            let changes = findCoverChanges(ranges, overlay, from, to);\n            for (let i = 0, pos = from;; i++) {\n                let last = i == changes.length, end = last ? to : changes[i].from;\n                if (end > pos)\n                    result.push(new TreeFragment(pos, end, mount.tree, -startPos, frag.from >= pos || frag.openStart, frag.to <= end || frag.openEnd));\n                if (last)\n                    break;\n                pos = changes[i].to;\n            }\n        }\n        else {\n            result.push(new TreeFragment(from, to, mount.tree, -startPos, frag.from >= startPos || frag.openStart, frag.to <= endPos || frag.openEnd));\n        }\n    }\n    return result;\n}\n\nexport { DefaultBufferLength, IterMode, MountedTree, NodeProp, NodeSet, NodeType, NodeWeakMap, Parser, Tree, TreeBuffer, TreeCursor, TreeFragment, parseMixed };\n","import { Parser, NodeProp, NodeSet, NodeType, DefaultBufferLength, Tree, IterMode } from '@lezer/common';\n\n/// A parse stack. These are used internally by the parser to track\n/// parsing progress. They also provide some properties and methods\n/// that external code such as a tokenizer can use to get information\n/// about the parse state.\nclass Stack {\n    /// @internal\n    constructor(\n    /// The parse that this stack is part of @internal\n    p, \n    /// Holds state, input pos, buffer index triplets for all but the\n    /// top state @internal\n    stack, \n    /// The current parse state @internal\n    state, \n    // The position at which the next reduce should take place. This\n    // can be less than `this.pos` when skipped expressions have been\n    // added to the stack (which should be moved outside of the next\n    // reduction)\n    /// @internal\n    reducePos, \n    /// The input position up to which this stack has parsed.\n    pos, \n    /// The dynamic score of the stack, including dynamic precedence\n    /// and error-recovery penalties\n    /// @internal\n    score, \n    // The output buffer. Holds (type, start, end, size) quads\n    // representing nodes created by the parser, where `size` is\n    // amount of buffer array entries covered by this node.\n    /// @internal\n    buffer, \n    // The base offset of the buffer. When stacks are split, the split\n    // instance shared the buffer history with its parent up to\n    // `bufferBase`, which is the absolute offset (including the\n    // offset of previous splits) into the buffer at which this stack\n    // starts writing.\n    /// @internal\n    bufferBase, \n    /// @internal\n    curContext, \n    /// @internal\n    lookAhead = 0, \n    // A parent stack from which this was split off, if any. This is\n    // set up so that it always points to a stack that has some\n    // additional buffer content, never to a stack with an equal\n    // `bufferBase`.\n    /// @internal\n    parent) {\n        this.p = p;\n        this.stack = stack;\n        this.state = state;\n        this.reducePos = reducePos;\n        this.pos = pos;\n        this.score = score;\n        this.buffer = buffer;\n        this.bufferBase = bufferBase;\n        this.curContext = curContext;\n        this.lookAhead = lookAhead;\n        this.parent = parent;\n    }\n    /// @internal\n    toString() {\n        return `[${this.stack.filter((_, i) => i % 3 == 0).concat(this.state)}]@${this.pos}${this.score ? \"!\" + this.score : \"\"}`;\n    }\n    // Start an empty stack\n    /// @internal\n    static start(p, state, pos = 0) {\n        let cx = p.parser.context;\n        return new Stack(p, [], state, pos, pos, 0, [], 0, cx ? new StackContext(cx, cx.start) : null, 0, null);\n    }\n    /// The stack's current [context](#lr.ContextTracker) value, if\n    /// any. Its type will depend on the context tracker's type\n    /// parameter, or it will be `null` if there is no context\n    /// tracker.\n    get context() { return this.curContext ? this.curContext.context : null; }\n    // Push a state onto the stack, tracking its start position as well\n    // as the buffer base at that point.\n    /// @internal\n    pushState(state, start) {\n        this.stack.push(this.state, start, this.bufferBase + this.buffer.length);\n        this.state = state;\n    }\n    // Apply a reduce action\n    /// @internal\n    reduce(action) {\n        var _a;\n        let depth = action >> 19 /* Action.ReduceDepthShift */, type = action & 65535 /* Action.ValueMask */;\n        let { parser } = this.p;\n        let dPrec = parser.dynamicPrecedence(type);\n        if (dPrec)\n            this.score += dPrec;\n        if (depth == 0) {\n            this.pushState(parser.getGoto(this.state, type, true), this.reducePos);\n            // Zero-depth reductions are a special case—they add stuff to\n            // the stack without popping anything off.\n            if (type < parser.minRepeatTerm)\n                this.storeNode(type, this.reducePos, this.reducePos, 4, true);\n            this.reduceContext(type, this.reducePos);\n            return;\n        }\n        // Find the base index into `this.stack`, content after which will\n        // be dropped. Note that with `StayFlag` reductions we need to\n        // consume two extra frames (the dummy parent node for the skipped\n        // expression and the state that we'll be staying in, which should\n        // be moved to `this.state`).\n        let base = this.stack.length - ((depth - 1) * 3) - (action & 262144 /* Action.StayFlag */ ? 6 : 0);\n        let start = base ? this.stack[base - 2] : this.p.ranges[0].from, size = this.reducePos - start;\n        // This is a kludge to try and detect overly deep left-associative\n        // trees, which will not increase the parse stack depth and thus\n        // won't be caught by the regular stack-depth limit check.\n        if (size >= 2000 /* Recover.MinBigReduction */ && !((_a = this.p.parser.nodeSet.types[type]) === null || _a === void 0 ? void 0 : _a.isAnonymous)) {\n            if (start == this.p.lastBigReductionStart) {\n                this.p.bigReductionCount++;\n                this.p.lastBigReductionSize = size;\n            }\n            else if (this.p.lastBigReductionSize < size) {\n                this.p.bigReductionCount = 1;\n                this.p.lastBigReductionStart = start;\n                this.p.lastBigReductionSize = size;\n            }\n        }\n        let bufferBase = base ? this.stack[base - 1] : 0, count = this.bufferBase + this.buffer.length - bufferBase;\n        // Store normal terms or `R -> R R` repeat reductions\n        if (type < parser.minRepeatTerm || (action & 131072 /* Action.RepeatFlag */)) {\n            let pos = parser.stateFlag(this.state, 1 /* StateFlag.Skipped */) ? this.pos : this.reducePos;\n            this.storeNode(type, start, pos, count + 4, true);\n        }\n        if (action & 262144 /* Action.StayFlag */) {\n            this.state = this.stack[base];\n        }\n        else {\n            let baseStateID = this.stack[base - 3];\n            this.state = parser.getGoto(baseStateID, type, true);\n        }\n        while (this.stack.length > base)\n            this.stack.pop();\n        this.reduceContext(type, start);\n    }\n    // Shift a value into the buffer\n    /// @internal\n    storeNode(term, start, end, size = 4, isReduce = false) {\n        if (term == 0 /* Term.Err */ &&\n            (!this.stack.length || this.stack[this.stack.length - 1] < this.buffer.length + this.bufferBase)) {\n            // Try to omit/merge adjacent error nodes\n            let cur = this, top = this.buffer.length;\n            if (top == 0 && cur.parent) {\n                top = cur.bufferBase - cur.parent.bufferBase;\n                cur = cur.parent;\n            }\n            if (top > 0 && cur.buffer[top - 4] == 0 /* Term.Err */ && cur.buffer[top - 1] > -1) {\n                if (start == end)\n                    return;\n                if (cur.buffer[top - 2] >= start) {\n                    cur.buffer[top - 2] = end;\n                    return;\n                }\n            }\n        }\n        if (!isReduce || this.pos == end) { // Simple case, just append\n            this.buffer.push(term, start, end, size);\n        }\n        else { // There may be skipped nodes that have to be moved forward\n            let index = this.buffer.length;\n            if (index > 0 && this.buffer[index - 4] != 0 /* Term.Err */)\n                while (index > 0 && this.buffer[index - 2] > end) {\n                    // Move this record forward\n                    this.buffer[index] = this.buffer[index - 4];\n                    this.buffer[index + 1] = this.buffer[index - 3];\n                    this.buffer[index + 2] = this.buffer[index - 2];\n                    this.buffer[index + 3] = this.buffer[index - 1];\n                    index -= 4;\n                    if (size > 4)\n                        size -= 4;\n                }\n            this.buffer[index] = term;\n            this.buffer[index + 1] = start;\n            this.buffer[index + 2] = end;\n            this.buffer[index + 3] = size;\n        }\n    }\n    // Apply a shift action\n    /// @internal\n    shift(action, next, nextEnd) {\n        let start = this.pos;\n        if (action & 131072 /* Action.GotoFlag */) {\n            this.pushState(action & 65535 /* Action.ValueMask */, this.pos);\n        }\n        else if ((action & 262144 /* Action.StayFlag */) == 0) { // Regular shift\n            let nextState = action, { parser } = this.p;\n            if (nextEnd > this.pos || next <= parser.maxNode) {\n                this.pos = nextEnd;\n                if (!parser.stateFlag(nextState, 1 /* StateFlag.Skipped */))\n                    this.reducePos = nextEnd;\n            }\n            this.pushState(nextState, start);\n            this.shiftContext(next, start);\n            if (next <= parser.maxNode)\n                this.buffer.push(next, start, nextEnd, 4);\n        }\n        else { // Shift-and-stay, which means this is a skipped token\n            this.pos = nextEnd;\n            this.shiftContext(next, start);\n            if (next <= this.p.parser.maxNode)\n                this.buffer.push(next, start, nextEnd, 4);\n        }\n    }\n    // Apply an action\n    /// @internal\n    apply(action, next, nextEnd) {\n        if (action & 65536 /* Action.ReduceFlag */)\n            this.reduce(action);\n        else\n            this.shift(action, next, nextEnd);\n    }\n    // Add a prebuilt (reused) node into the buffer.\n    /// @internal\n    useNode(value, next) {\n        let index = this.p.reused.length - 1;\n        if (index < 0 || this.p.reused[index] != value) {\n            this.p.reused.push(value);\n            index++;\n        }\n        let start = this.pos;\n        this.reducePos = this.pos = start + value.length;\n        this.pushState(next, start);\n        this.buffer.push(index, start, this.reducePos, -1 /* size == -1 means this is a reused value */);\n        if (this.curContext)\n            this.updateContext(this.curContext.tracker.reuse(this.curContext.context, value, this, this.p.stream.reset(this.pos - value.length)));\n    }\n    // Split the stack. Due to the buffer sharing and the fact\n    // that `this.stack` tends to stay quite shallow, this isn't very\n    // expensive.\n    /// @internal\n    split() {\n        let parent = this;\n        let off = parent.buffer.length;\n        // Because the top of the buffer (after this.pos) may be mutated\n        // to reorder reductions and skipped tokens, and shared buffers\n        // should be immutable, this copies any outstanding skipped tokens\n        // to the new buffer, and puts the base pointer before them.\n        while (off > 0 && parent.buffer[off - 2] > parent.reducePos)\n            off -= 4;\n        let buffer = parent.buffer.slice(off), base = parent.bufferBase + off;\n        // Make sure parent points to an actual parent with content, if there is such a parent.\n        while (parent && base == parent.bufferBase)\n            parent = parent.parent;\n        return new Stack(this.p, this.stack.slice(), this.state, this.reducePos, this.pos, this.score, buffer, base, this.curContext, this.lookAhead, parent);\n    }\n    // Try to recover from an error by 'deleting' (ignoring) one token.\n    /// @internal\n    recoverByDelete(next, nextEnd) {\n        let isNode = next <= this.p.parser.maxNode;\n        if (isNode)\n            this.storeNode(next, this.pos, nextEnd, 4);\n        this.storeNode(0 /* Term.Err */, this.pos, nextEnd, isNode ? 8 : 4);\n        this.pos = this.reducePos = nextEnd;\n        this.score -= 190 /* Recover.Delete */;\n    }\n    /// Check if the given term would be able to be shifted (optionally\n    /// after some reductions) on this stack. This can be useful for\n    /// external tokenizers that want to make sure they only provide a\n    /// given token when it applies.\n    canShift(term) {\n        for (let sim = new SimulatedStack(this);;) {\n            let action = this.p.parser.stateSlot(sim.state, 4 /* ParseState.DefaultReduce */) || this.p.parser.hasAction(sim.state, term);\n            if (action == 0)\n                return false;\n            if ((action & 65536 /* Action.ReduceFlag */) == 0)\n                return true;\n            sim.reduce(action);\n        }\n    }\n    // Apply up to Recover.MaxNext recovery actions that conceptually\n    // inserts some missing token or rule.\n    /// @internal\n    recoverByInsert(next) {\n        if (this.stack.length >= 300 /* Recover.MaxInsertStackDepth */)\n            return [];\n        let nextStates = this.p.parser.nextStates(this.state);\n        if (nextStates.length > 4 /* Recover.MaxNext */ << 1 || this.stack.length >= 120 /* Recover.DampenInsertStackDepth */) {\n            let best = [];\n            for (let i = 0, s; i < nextStates.length; i += 2) {\n                if ((s = nextStates[i + 1]) != this.state && this.p.parser.hasAction(s, next))\n                    best.push(nextStates[i], s);\n            }\n            if (this.stack.length < 120 /* Recover.DampenInsertStackDepth */)\n                for (let i = 0; best.length < 4 /* Recover.MaxNext */ << 1 && i < nextStates.length; i += 2) {\n                    let s = nextStates[i + 1];\n                    if (!best.some((v, i) => (i & 1) && v == s))\n                        best.push(nextStates[i], s);\n                }\n            nextStates = best;\n        }\n        let result = [];\n        for (let i = 0; i < nextStates.length && result.length < 4 /* Recover.MaxNext */; i += 2) {\n            let s = nextStates[i + 1];\n            if (s == this.state)\n                continue;\n            let stack = this.split();\n            stack.pushState(s, this.pos);\n            stack.storeNode(0 /* Term.Err */, stack.pos, stack.pos, 4, true);\n            stack.shiftContext(nextStates[i], this.pos);\n            stack.score -= 200 /* Recover.Insert */;\n            result.push(stack);\n        }\n        return result;\n    }\n    // Force a reduce, if possible. Return false if that can't\n    // be done.\n    /// @internal\n    forceReduce() {\n        let { parser } = this.p;\n        let reduce = parser.stateSlot(this.state, 5 /* ParseState.ForcedReduce */);\n        if ((reduce & 65536 /* Action.ReduceFlag */) == 0)\n            return false;\n        if (!parser.validAction(this.state, reduce)) {\n            let depth = reduce >> 19 /* Action.ReduceDepthShift */, term = reduce & 65535 /* Action.ValueMask */;\n            let target = this.stack.length - depth * 3;\n            if (target < 0 || parser.getGoto(this.stack[target], term, false) < 0) {\n                let backup = this.findForcedReduction();\n                if (backup == null)\n                    return false;\n                reduce = backup;\n            }\n            this.storeNode(0 /* Term.Err */, this.pos, this.pos, 4, true);\n            this.score -= 100 /* Recover.Reduce */;\n        }\n        this.reducePos = this.pos;\n        this.reduce(reduce);\n        return true;\n    }\n    /// Try to scan through the automaton to find some kind of reduction\n    /// that can be applied. Used when the regular ForcedReduce field\n    /// isn't a valid action. @internal\n    findForcedReduction() {\n        let { parser } = this.p, seen = [];\n        let explore = (state, depth) => {\n            if (seen.includes(state))\n                return;\n            seen.push(state);\n            return parser.allActions(state, (action) => {\n                if (action & (262144 /* Action.StayFlag */ | 131072 /* Action.GotoFlag */)) ;\n                else if (action & 65536 /* Action.ReduceFlag */) {\n                    let rDepth = (action >> 19 /* Action.ReduceDepthShift */) - depth;\n                    if (rDepth > 1) {\n                        let term = action & 65535 /* Action.ValueMask */, target = this.stack.length - rDepth * 3;\n                        if (target >= 0 && parser.getGoto(this.stack[target], term, false) >= 0)\n                            return (rDepth << 19 /* Action.ReduceDepthShift */) | 65536 /* Action.ReduceFlag */ | term;\n                    }\n                }\n                else {\n                    let found = explore(action, depth + 1);\n                    if (found != null)\n                        return found;\n                }\n            });\n        };\n        return explore(this.state, 0);\n    }\n    /// @internal\n    forceAll() {\n        while (!this.p.parser.stateFlag(this.state, 2 /* StateFlag.Accepting */)) {\n            if (!this.forceReduce()) {\n                this.storeNode(0 /* Term.Err */, this.pos, this.pos, 4, true);\n                break;\n            }\n        }\n        return this;\n    }\n    /// Check whether this state has no further actions (assumed to be a direct descendant of the\n    /// top state, since any other states must be able to continue\n    /// somehow). @internal\n    get deadEnd() {\n        if (this.stack.length != 3)\n            return false;\n        let { parser } = this.p;\n        return parser.data[parser.stateSlot(this.state, 1 /* ParseState.Actions */)] == 65535 /* Seq.End */ &&\n            !parser.stateSlot(this.state, 4 /* ParseState.DefaultReduce */);\n    }\n    /// Restart the stack (put it back in its start state). Only safe\n    /// when this.stack.length == 3 (state is directly below the top\n    /// state). @internal\n    restart() {\n        this.state = this.stack[0];\n        this.stack.length = 0;\n    }\n    /// @internal\n    sameState(other) {\n        if (this.state != other.state || this.stack.length != other.stack.length)\n            return false;\n        for (let i = 0; i < this.stack.length; i += 3)\n            if (this.stack[i] != other.stack[i])\n                return false;\n        return true;\n    }\n    /// Get the parser used by this stack.\n    get parser() { return this.p.parser; }\n    /// Test whether a given dialect (by numeric ID, as exported from\n    /// the terms file) is enabled.\n    dialectEnabled(dialectID) { return this.p.parser.dialect.flags[dialectID]; }\n    shiftContext(term, start) {\n        if (this.curContext)\n            this.updateContext(this.curContext.tracker.shift(this.curContext.context, term, this, this.p.stream.reset(start)));\n    }\n    reduceContext(term, start) {\n        if (this.curContext)\n            this.updateContext(this.curContext.tracker.reduce(this.curContext.context, term, this, this.p.stream.reset(start)));\n    }\n    /// @internal\n    emitContext() {\n        let last = this.buffer.length - 1;\n        if (last < 0 || this.buffer[last] != -3)\n            this.buffer.push(this.curContext.hash, this.pos, this.pos, -3);\n    }\n    /// @internal\n    emitLookAhead() {\n        let last = this.buffer.length - 1;\n        if (last < 0 || this.buffer[last] != -4)\n            this.buffer.push(this.lookAhead, this.pos, this.pos, -4);\n    }\n    updateContext(context) {\n        if (context != this.curContext.context) {\n            let newCx = new StackContext(this.curContext.tracker, context);\n            if (newCx.hash != this.curContext.hash)\n                this.emitContext();\n            this.curContext = newCx;\n        }\n    }\n    /// @internal\n    setLookAhead(lookAhead) {\n        if (lookAhead > this.lookAhead) {\n            this.emitLookAhead();\n            this.lookAhead = lookAhead;\n        }\n    }\n    /// @internal\n    close() {\n        if (this.curContext && this.curContext.tracker.strict)\n            this.emitContext();\n        if (this.lookAhead > 0)\n            this.emitLookAhead();\n    }\n}\nclass StackContext {\n    constructor(tracker, context) {\n        this.tracker = tracker;\n        this.context = context;\n        this.hash = tracker.strict ? tracker.hash(context) : 0;\n    }\n}\nvar Recover;\n(function (Recover) {\n    Recover[Recover[\"Insert\"] = 200] = \"Insert\";\n    Recover[Recover[\"Delete\"] = 190] = \"Delete\";\n    Recover[Recover[\"Reduce\"] = 100] = \"Reduce\";\n    Recover[Recover[\"MaxNext\"] = 4] = \"MaxNext\";\n    Recover[Recover[\"MaxInsertStackDepth\"] = 300] = \"MaxInsertStackDepth\";\n    Recover[Recover[\"DampenInsertStackDepth\"] = 120] = \"DampenInsertStackDepth\";\n    Recover[Recover[\"MinBigReduction\"] = 2000] = \"MinBigReduction\";\n})(Recover || (Recover = {}));\n// Used to cheaply run some reductions to scan ahead without mutating\n// an entire stack\nclass SimulatedStack {\n    constructor(start) {\n        this.start = start;\n        this.state = start.state;\n        this.stack = start.stack;\n        this.base = this.stack.length;\n    }\n    reduce(action) {\n        let term = action & 65535 /* Action.ValueMask */, depth = action >> 19 /* Action.ReduceDepthShift */;\n        if (depth == 0) {\n            if (this.stack == this.start.stack)\n                this.stack = this.stack.slice();\n            this.stack.push(this.state, 0, 0);\n            this.base += 3;\n        }\n        else {\n            this.base -= (depth - 1) * 3;\n        }\n        let goto = this.start.p.parser.getGoto(this.stack[this.base - 3], term, true);\n        this.state = goto;\n    }\n}\n// This is given to `Tree.build` to build a buffer, and encapsulates\n// the parent-stack-walking necessary to read the nodes.\nclass StackBufferCursor {\n    constructor(stack, pos, index) {\n        this.stack = stack;\n        this.pos = pos;\n        this.index = index;\n        this.buffer = stack.buffer;\n        if (this.index == 0)\n            this.maybeNext();\n    }\n    static create(stack, pos = stack.bufferBase + stack.buffer.length) {\n        return new StackBufferCursor(stack, pos, pos - stack.bufferBase);\n    }\n    maybeNext() {\n        let next = this.stack.parent;\n        if (next != null) {\n            this.index = this.stack.bufferBase - next.bufferBase;\n            this.stack = next;\n            this.buffer = next.buffer;\n        }\n    }\n    get id() { return this.buffer[this.index - 4]; }\n    get start() { return this.buffer[this.index - 3]; }\n    get end() { return this.buffer[this.index - 2]; }\n    get size() { return this.buffer[this.index - 1]; }\n    next() {\n        this.index -= 4;\n        this.pos -= 4;\n        if (this.index == 0)\n            this.maybeNext();\n    }\n    fork() {\n        return new StackBufferCursor(this.stack, this.pos, this.index);\n    }\n}\n\n// See lezer-generator/src/encode.ts for comments about the encoding\n// used here\nfunction decodeArray(input, Type = Uint16Array) {\n    if (typeof input != \"string\")\n        return input;\n    let array = null;\n    for (let pos = 0, out = 0; pos < input.length;) {\n        let value = 0;\n        for (;;) {\n            let next = input.charCodeAt(pos++), stop = false;\n            if (next == 126 /* Encode.BigValCode */) {\n                value = 65535 /* Encode.BigVal */;\n                break;\n            }\n            if (next >= 92 /* Encode.Gap2 */)\n                next--;\n            if (next >= 34 /* Encode.Gap1 */)\n                next--;\n            let digit = next - 32 /* Encode.Start */;\n            if (digit >= 46 /* Encode.Base */) {\n                digit -= 46 /* Encode.Base */;\n                stop = true;\n            }\n            value += digit;\n            if (stop)\n                break;\n            value *= 46 /* Encode.Base */;\n        }\n        if (array)\n            array[out++] = value;\n        else\n            array = new Type(value);\n    }\n    return array;\n}\n\nclass CachedToken {\n    constructor() {\n        this.start = -1;\n        this.value = -1;\n        this.end = -1;\n        this.extended = -1;\n        this.lookAhead = 0;\n        this.mask = 0;\n        this.context = 0;\n    }\n}\nconst nullToken = new CachedToken;\n/// [Tokenizers](#lr.ExternalTokenizer) interact with the input\n/// through this interface. It presents the input as a stream of\n/// characters, tracking lookahead and hiding the complexity of\n/// [ranges](#common.Parser.parse^ranges) from tokenizer code.\nclass InputStream {\n    /// @internal\n    constructor(\n    /// @internal\n    input, \n    /// @internal\n    ranges) {\n        this.input = input;\n        this.ranges = ranges;\n        /// @internal\n        this.chunk = \"\";\n        /// @internal\n        this.chunkOff = 0;\n        /// Backup chunk\n        this.chunk2 = \"\";\n        this.chunk2Pos = 0;\n        /// The character code of the next code unit in the input, or -1\n        /// when the stream is at the end of the input.\n        this.next = -1;\n        /// @internal\n        this.token = nullToken;\n        this.rangeIndex = 0;\n        this.pos = this.chunkPos = ranges[0].from;\n        this.range = ranges[0];\n        this.end = ranges[ranges.length - 1].to;\n        this.readNext();\n    }\n    /// @internal\n    resolveOffset(offset, assoc) {\n        let range = this.range, index = this.rangeIndex;\n        let pos = this.pos + offset;\n        while (pos < range.from) {\n            if (!index)\n                return null;\n            let next = this.ranges[--index];\n            pos -= range.from - next.to;\n            range = next;\n        }\n        while (assoc < 0 ? pos > range.to : pos >= range.to) {\n            if (index == this.ranges.length - 1)\n                return null;\n            let next = this.ranges[++index];\n            pos += next.from - range.to;\n            range = next;\n        }\n        return pos;\n    }\n    /// @internal\n    clipPos(pos) {\n        if (pos >= this.range.from && pos < this.range.to)\n            return pos;\n        for (let range of this.ranges)\n            if (range.to > pos)\n                return Math.max(pos, range.from);\n        return this.end;\n    }\n    /// Look at a code unit near the stream position. `.peek(0)` equals\n    /// `.next`, `.peek(-1)` gives you the previous character, and so\n    /// on.\n    ///\n    /// Note that looking around during tokenizing creates dependencies\n    /// on potentially far-away content, which may reduce the\n    /// effectiveness incremental parsing—when looking forward—or even\n    /// cause invalid reparses when looking backward more than 25 code\n    /// units, since the library does not track lookbehind.\n    peek(offset) {\n        let idx = this.chunkOff + offset, pos, result;\n        if (idx >= 0 && idx < this.chunk.length) {\n            pos = this.pos + offset;\n            result = this.chunk.charCodeAt(idx);\n        }\n        else {\n            let resolved = this.resolveOffset(offset, 1);\n            if (resolved == null)\n                return -1;\n            pos = resolved;\n            if (pos >= this.chunk2Pos && pos < this.chunk2Pos + this.chunk2.length) {\n                result = this.chunk2.charCodeAt(pos - this.chunk2Pos);\n            }\n            else {\n                let i = this.rangeIndex, range = this.range;\n                while (range.to <= pos)\n                    range = this.ranges[++i];\n                this.chunk2 = this.input.chunk(this.chunk2Pos = pos);\n                if (pos + this.chunk2.length > range.to)\n                    this.chunk2 = this.chunk2.slice(0, range.to - pos);\n                result = this.chunk2.charCodeAt(0);\n            }\n        }\n        if (pos >= this.token.lookAhead)\n            this.token.lookAhead = pos + 1;\n        return result;\n    }\n    /// Accept a token. By default, the end of the token is set to the\n    /// current stream position, but you can pass an offset (relative to\n    /// the stream position) to change that.\n    acceptToken(token, endOffset = 0) {\n        let end = endOffset ? this.resolveOffset(endOffset, -1) : this.pos;\n        if (end == null || end < this.token.start)\n            throw new RangeError(\"Token end out of bounds\");\n        this.token.value = token;\n        this.token.end = end;\n    }\n    getChunk() {\n        if (this.pos >= this.chunk2Pos && this.pos < this.chunk2Pos + this.chunk2.length) {\n            let { chunk, chunkPos } = this;\n            this.chunk = this.chunk2;\n            this.chunkPos = this.chunk2Pos;\n            this.chunk2 = chunk;\n            this.chunk2Pos = chunkPos;\n            this.chunkOff = this.pos - this.chunkPos;\n        }\n        else {\n            this.chunk2 = this.chunk;\n            this.chunk2Pos = this.chunkPos;\n            let nextChunk = this.input.chunk(this.pos);\n            let end = this.pos + nextChunk.length;\n            this.chunk = end > this.range.to ? nextChunk.slice(0, this.range.to - this.pos) : nextChunk;\n            this.chunkPos = this.pos;\n            this.chunkOff = 0;\n        }\n    }\n    readNext() {\n        if (this.chunkOff >= this.chunk.length) {\n            this.getChunk();\n            if (this.chunkOff == this.chunk.length)\n                return this.next = -1;\n        }\n        return this.next = this.chunk.charCodeAt(this.chunkOff);\n    }\n    /// Move the stream forward N (defaults to 1) code units. Returns\n    /// the new value of [`next`](#lr.InputStream.next).\n    advance(n = 1) {\n        this.chunkOff += n;\n        while (this.pos + n >= this.range.to) {\n            if (this.rangeIndex == this.ranges.length - 1)\n                return this.setDone();\n            n -= this.range.to - this.pos;\n            this.range = this.ranges[++this.rangeIndex];\n            this.pos = this.range.from;\n        }\n        this.pos += n;\n        if (this.pos >= this.token.lookAhead)\n            this.token.lookAhead = this.pos + 1;\n        return this.readNext();\n    }\n    setDone() {\n        this.pos = this.chunkPos = this.end;\n        this.range = this.ranges[this.rangeIndex = this.ranges.length - 1];\n        this.chunk = \"\";\n        return this.next = -1;\n    }\n    /// @internal\n    reset(pos, token) {\n        if (token) {\n            this.token = token;\n            token.start = pos;\n            token.lookAhead = pos + 1;\n            token.value = token.extended = -1;\n        }\n        else {\n            this.token = nullToken;\n        }\n        if (this.pos != pos) {\n            this.pos = pos;\n            if (pos == this.end) {\n                this.setDone();\n                return this;\n            }\n            while (pos < this.range.from)\n                this.range = this.ranges[--this.rangeIndex];\n            while (pos >= this.range.to)\n                this.range = this.ranges[++this.rangeIndex];\n            if (pos >= this.chunkPos && pos < this.chunkPos + this.chunk.length) {\n                this.chunkOff = pos - this.chunkPos;\n            }\n            else {\n                this.chunk = \"\";\n                this.chunkOff = 0;\n            }\n            this.readNext();\n        }\n        return this;\n    }\n    /// @internal\n    read(from, to) {\n        if (from >= this.chunkPos && to <= this.chunkPos + this.chunk.length)\n            return this.chunk.slice(from - this.chunkPos, to - this.chunkPos);\n        if (from >= this.chunk2Pos && to <= this.chunk2Pos + this.chunk2.length)\n            return this.chunk2.slice(from - this.chunk2Pos, to - this.chunk2Pos);\n        if (from >= this.range.from && to <= this.range.to)\n            return this.input.read(from, to);\n        let result = \"\";\n        for (let r of this.ranges) {\n            if (r.from >= to)\n                break;\n            if (r.to > from)\n                result += this.input.read(Math.max(r.from, from), Math.min(r.to, to));\n        }\n        return result;\n    }\n}\n/// @internal\nclass TokenGroup {\n    constructor(data, id) {\n        this.data = data;\n        this.id = id;\n    }\n    token(input, stack) {\n        let { parser } = stack.p;\n        readToken(this.data, input, stack, this.id, parser.data, parser.tokenPrecTable);\n    }\n}\nTokenGroup.prototype.contextual = TokenGroup.prototype.fallback = TokenGroup.prototype.extend = false;\n/// @hide\nclass LocalTokenGroup {\n    constructor(data, precTable, elseToken) {\n        this.precTable = precTable;\n        this.elseToken = elseToken;\n        this.data = typeof data == \"string\" ? decodeArray(data) : data;\n    }\n    token(input, stack) {\n        let start = input.pos, skipped = 0;\n        for (;;) {\n            let atEof = input.next < 0, nextPos = input.resolveOffset(1, 1);\n            readToken(this.data, input, stack, 0, this.data, this.precTable);\n            if (input.token.value > -1)\n                break;\n            if (this.elseToken == null)\n                return;\n            if (!atEof)\n                skipped++;\n            if (nextPos == null)\n                break;\n            input.reset(nextPos, input.token);\n        }\n        if (skipped) {\n            input.reset(start, input.token);\n            input.acceptToken(this.elseToken, skipped);\n        }\n    }\n}\nLocalTokenGroup.prototype.contextual = TokenGroup.prototype.fallback = TokenGroup.prototype.extend = false;\n/// `@external tokens` declarations in the grammar should resolve to\n/// an instance of this class.\nclass ExternalTokenizer {\n    /// Create a tokenizer. The first argument is the function that,\n    /// given an input stream, scans for the types of tokens it\n    /// recognizes at the stream's position, and calls\n    /// [`acceptToken`](#lr.InputStream.acceptToken) when it finds\n    /// one.\n    constructor(\n    /// @internal\n    token, options = {}) {\n        this.token = token;\n        this.contextual = !!options.contextual;\n        this.fallback = !!options.fallback;\n        this.extend = !!options.extend;\n    }\n}\n// Tokenizer data is stored a big uint16 array containing, for each\n// state:\n//\n//  - A group bitmask, indicating what token groups are reachable from\n//    this state, so that paths that can only lead to tokens not in\n//    any of the current groups can be cut off early.\n//\n//  - The position of the end of the state's sequence of accepting\n//    tokens\n//\n//  - The number of outgoing edges for the state\n//\n//  - The accepting tokens, as (token id, group mask) pairs\n//\n//  - The outgoing edges, as (start character, end character, state\n//    index) triples, with end character being exclusive\n//\n// This function interprets that data, running through a stream as\n// long as new states with the a matching group mask can be reached,\n// and updating `input.token` when it matches a token.\nfunction readToken(data, input, stack, group, precTable, precOffset) {\n    let state = 0, groupMask = 1 << group, { dialect } = stack.p.parser;\n    scan: for (;;) {\n        if ((groupMask & data[state]) == 0)\n            break;\n        let accEnd = data[state + 1];\n        // Check whether this state can lead to a token in the current group\n        // Accept tokens in this state, possibly overwriting\n        // lower-precedence / shorter tokens\n        for (let i = state + 3; i < accEnd; i += 2)\n            if ((data[i + 1] & groupMask) > 0) {\n                let term = data[i];\n                if (dialect.allows(term) &&\n                    (input.token.value == -1 || input.token.value == term ||\n                        overrides(term, input.token.value, precTable, precOffset))) {\n                    input.acceptToken(term);\n                    break;\n                }\n            }\n        let next = input.next, low = 0, high = data[state + 2];\n        // Special case for EOF\n        if (input.next < 0 && high > low && data[accEnd + high * 3 - 3] == 65535 /* Seq.End */ && data[accEnd + high * 3 - 3] == 65535 /* Seq.End */) {\n            state = data[accEnd + high * 3 - 1];\n            continue scan;\n        }\n        // Do a binary search on the state's edges\n        for (; low < high;) {\n            let mid = (low + high) >> 1;\n            let index = accEnd + mid + (mid << 1);\n            let from = data[index], to = data[index + 1] || 0x10000;\n            if (next < from)\n                high = mid;\n            else if (next >= to)\n                low = mid + 1;\n            else {\n                state = data[index + 2];\n                input.advance();\n                continue scan;\n            }\n        }\n        break;\n    }\n}\nfunction findOffset(data, start, term) {\n    for (let i = start, next; (next = data[i]) != 65535 /* Seq.End */; i++)\n        if (next == term)\n            return i - start;\n    return -1;\n}\nfunction overrides(token, prev, tableData, tableOffset) {\n    let iPrev = findOffset(tableData, tableOffset, prev);\n    return iPrev < 0 || findOffset(tableData, tableOffset, token) < iPrev;\n}\n\n// Environment variable used to control console output\nconst verbose = typeof process != \"undefined\" && process.env && /\\bparse\\b/.test(process.env.LOG);\nlet stackIDs = null;\nvar Safety;\n(function (Safety) {\n    Safety[Safety[\"Margin\"] = 25] = \"Margin\";\n})(Safety || (Safety = {}));\nfunction cutAt(tree, pos, side) {\n    let cursor = tree.cursor(IterMode.IncludeAnonymous);\n    cursor.moveTo(pos);\n    for (;;) {\n        if (!(side < 0 ? cursor.childBefore(pos) : cursor.childAfter(pos)))\n            for (;;) {\n                if ((side < 0 ? cursor.to < pos : cursor.from > pos) && !cursor.type.isError)\n                    return side < 0 ? Math.max(0, Math.min(cursor.to - 1, pos - 25 /* Safety.Margin */))\n                        : Math.min(tree.length, Math.max(cursor.from + 1, pos + 25 /* Safety.Margin */));\n                if (side < 0 ? cursor.prevSibling() : cursor.nextSibling())\n                    break;\n                if (!cursor.parent())\n                    return side < 0 ? 0 : tree.length;\n            }\n    }\n}\nclass FragmentCursor {\n    constructor(fragments, nodeSet) {\n        this.fragments = fragments;\n        this.nodeSet = nodeSet;\n        this.i = 0;\n        this.fragment = null;\n        this.safeFrom = -1;\n        this.safeTo = -1;\n        this.trees = [];\n        this.start = [];\n        this.index = [];\n        this.nextFragment();\n    }\n    nextFragment() {\n        let fr = this.fragment = this.i == this.fragments.length ? null : this.fragments[this.i++];\n        if (fr) {\n            this.safeFrom = fr.openStart ? cutAt(fr.tree, fr.from + fr.offset, 1) - fr.offset : fr.from;\n            this.safeTo = fr.openEnd ? cutAt(fr.tree, fr.to + fr.offset, -1) - fr.offset : fr.to;\n            while (this.trees.length) {\n                this.trees.pop();\n                this.start.pop();\n                this.index.pop();\n            }\n            this.trees.push(fr.tree);\n            this.start.push(-fr.offset);\n            this.index.push(0);\n            this.nextStart = this.safeFrom;\n        }\n        else {\n            this.nextStart = 1e9;\n        }\n    }\n    // `pos` must be >= any previously given `pos` for this cursor\n    nodeAt(pos) {\n        if (pos < this.nextStart)\n            return null;\n        while (this.fragment && this.safeTo <= pos)\n            this.nextFragment();\n        if (!this.fragment)\n            return null;\n        for (;;) {\n            let last = this.trees.length - 1;\n            if (last < 0) { // End of tree\n                this.nextFragment();\n                return null;\n            }\n            let top = this.trees[last], index = this.index[last];\n            if (index == top.children.length) {\n                this.trees.pop();\n                this.start.pop();\n                this.index.pop();\n                continue;\n            }\n            let next = top.children[index];\n            let start = this.start[last] + top.positions[index];\n            if (start > pos) {\n                this.nextStart = start;\n                return null;\n            }\n            if (next instanceof Tree) {\n                if (start == pos) {\n                    if (start < this.safeFrom)\n                        return null;\n                    let end = start + next.length;\n                    if (end <= this.safeTo) {\n                        let lookAhead = next.prop(NodeProp.lookAhead);\n                        if (!lookAhead || end + lookAhead < this.fragment.to)\n                            return next;\n                    }\n                }\n                this.index[last]++;\n                if (start + next.length >= Math.max(this.safeFrom, pos)) { // Enter this node\n                    this.trees.push(next);\n                    this.start.push(start);\n                    this.index.push(0);\n                }\n            }\n            else {\n                this.index[last]++;\n                this.nextStart = start + next.length;\n            }\n        }\n    }\n}\nclass TokenCache {\n    constructor(parser, stream) {\n        this.stream = stream;\n        this.tokens = [];\n        this.mainToken = null;\n        this.actions = [];\n        this.tokens = parser.tokenizers.map(_ => new CachedToken);\n    }\n    getActions(stack) {\n        let actionIndex = 0;\n        let main = null;\n        let { parser } = stack.p, { tokenizers } = parser;\n        let mask = parser.stateSlot(stack.state, 3 /* ParseState.TokenizerMask */);\n        let context = stack.curContext ? stack.curContext.hash : 0;\n        let lookAhead = 0;\n        for (let i = 0; i < tokenizers.length; i++) {\n            if (((1 << i) & mask) == 0)\n                continue;\n            let tokenizer = tokenizers[i], token = this.tokens[i];\n            if (main && !tokenizer.fallback)\n                continue;\n            if (tokenizer.contextual || token.start != stack.pos || token.mask != mask || token.context != context) {\n                this.updateCachedToken(token, tokenizer, stack);\n                token.mask = mask;\n                token.context = context;\n            }\n            if (token.lookAhead > token.end + 25 /* Safety.Margin */)\n                lookAhead = Math.max(token.lookAhead, lookAhead);\n            if (token.value != 0 /* Term.Err */) {\n                let startIndex = actionIndex;\n                if (token.extended > -1)\n                    actionIndex = this.addActions(stack, token.extended, token.end, actionIndex);\n                actionIndex = this.addActions(stack, token.value, token.end, actionIndex);\n                if (!tokenizer.extend) {\n                    main = token;\n                    if (actionIndex > startIndex)\n                        break;\n                }\n            }\n        }\n        while (this.actions.length > actionIndex)\n            this.actions.pop();\n        if (lookAhead)\n            stack.setLookAhead(lookAhead);\n        if (!main && stack.pos == this.stream.end) {\n            main = new CachedToken;\n            main.value = stack.p.parser.eofTerm;\n            main.start = main.end = stack.pos;\n            actionIndex = this.addActions(stack, main.value, main.end, actionIndex);\n        }\n        this.mainToken = main;\n        return this.actions;\n    }\n    getMainToken(stack) {\n        if (this.mainToken)\n            return this.mainToken;\n        let main = new CachedToken, { pos, p } = stack;\n        main.start = pos;\n        main.end = Math.min(pos + 1, p.stream.end);\n        main.value = pos == p.stream.end ? p.parser.eofTerm : 0 /* Term.Err */;\n        return main;\n    }\n    updateCachedToken(token, tokenizer, stack) {\n        let start = this.stream.clipPos(stack.pos);\n        tokenizer.token(this.stream.reset(start, token), stack);\n        if (token.value > -1) {\n            let { parser } = stack.p;\n            for (let i = 0; i < parser.specialized.length; i++)\n                if (parser.specialized[i] == token.value) {\n                    let result = parser.specializers[i](this.stream.read(token.start, token.end), stack);\n                    if (result >= 0 && stack.p.parser.dialect.allows(result >> 1)) {\n                        if ((result & 1) == 0 /* Specialize.Specialize */)\n                            token.value = result >> 1;\n                        else\n                            token.extended = result >> 1;\n                        break;\n                    }\n                }\n        }\n        else {\n            token.value = 0 /* Term.Err */;\n            token.end = this.stream.clipPos(start + 1);\n        }\n    }\n    putAction(action, token, end, index) {\n        // Don't add duplicate actions\n        for (let i = 0; i < index; i += 3)\n            if (this.actions[i] == action)\n                return index;\n        this.actions[index++] = action;\n        this.actions[index++] = token;\n        this.actions[index++] = end;\n        return index;\n    }\n    addActions(stack, token, end, index) {\n        let { state } = stack, { parser } = stack.p, { data } = parser;\n        for (let set = 0; set < 2; set++) {\n            for (let i = parser.stateSlot(state, set ? 2 /* ParseState.Skip */ : 1 /* ParseState.Actions */);; i += 3) {\n                if (data[i] == 65535 /* Seq.End */) {\n                    if (data[i + 1] == 1 /* Seq.Next */) {\n                        i = pair(data, i + 2);\n                    }\n                    else {\n                        if (index == 0 && data[i + 1] == 2 /* Seq.Other */)\n                            index = this.putAction(pair(data, i + 2), token, end, index);\n                        break;\n                    }\n                }\n                if (data[i] == token)\n                    index = this.putAction(pair(data, i + 1), token, end, index);\n            }\n        }\n        return index;\n    }\n}\nvar Rec;\n(function (Rec) {\n    Rec[Rec[\"Distance\"] = 5] = \"Distance\";\n    Rec[Rec[\"MaxRemainingPerStep\"] = 3] = \"MaxRemainingPerStep\";\n    // When two stacks have been running independently long enough to\n    // add this many elements to their buffers, prune one.\n    Rec[Rec[\"MinBufferLengthPrune\"] = 500] = \"MinBufferLengthPrune\";\n    Rec[Rec[\"ForceReduceLimit\"] = 10] = \"ForceReduceLimit\";\n    // Once a stack reaches this depth (in .stack.length) force-reduce\n    // it back to CutTo to avoid creating trees that overflow the stack\n    // on recursive traversal.\n    Rec[Rec[\"CutDepth\"] = 15000] = \"CutDepth\";\n    Rec[Rec[\"CutTo\"] = 9000] = \"CutTo\";\n    Rec[Rec[\"MaxLeftAssociativeReductionCount\"] = 300] = \"MaxLeftAssociativeReductionCount\";\n    // The maximum number of non-recovering stacks to explore (to avoid\n    // getting bogged down with exponentially multiplying stacks in\n    // ambiguous content)\n    Rec[Rec[\"MaxStackCount\"] = 12] = \"MaxStackCount\";\n})(Rec || (Rec = {}));\nclass Parse {\n    constructor(parser, input, fragments, ranges) {\n        this.parser = parser;\n        this.input = input;\n        this.ranges = ranges;\n        this.recovering = 0;\n        this.nextStackID = 0x2654; // ♔, ♕, ♖, ♗, ♘, ♙, ♠, ♡, ♢, ♣, ♤, ♥, ♦, ♧\n        this.minStackPos = 0;\n        this.reused = [];\n        this.stoppedAt = null;\n        this.lastBigReductionStart = -1;\n        this.lastBigReductionSize = 0;\n        this.bigReductionCount = 0;\n        this.stream = new InputStream(input, ranges);\n        this.tokens = new TokenCache(parser, this.stream);\n        this.topTerm = parser.top[1];\n        let { from } = ranges[0];\n        this.stacks = [Stack.start(this, parser.top[0], from)];\n        this.fragments = fragments.length && this.stream.end - from > parser.bufferLength * 4\n            ? new FragmentCursor(fragments, parser.nodeSet) : null;\n    }\n    get parsedPos() {\n        return this.minStackPos;\n    }\n    // Move the parser forward. This will process all parse stacks at\n    // `this.pos` and try to advance them to a further position. If no\n    // stack for such a position is found, it'll start error-recovery.\n    //\n    // When the parse is finished, this will return a syntax tree. When\n    // not, it returns `null`.\n    advance() {\n        let stacks = this.stacks, pos = this.minStackPos;\n        // This will hold stacks beyond `pos`.\n        let newStacks = this.stacks = [];\n        let stopped, stoppedTokens;\n        // If a large amount of reductions happened with the same start\n        // position, force the stack out of that production in order to\n        // avoid creating a tree too deep to recurse through.\n        // (This is an ugly kludge, because unfortunately there is no\n        // straightforward, cheap way to check for this happening, due to\n        // the history of reductions only being available in an\n        // expensive-to-access format in the stack buffers.)\n        if (this.bigReductionCount > 300 /* Rec.MaxLeftAssociativeReductionCount */ && stacks.length == 1) {\n            let [s] = stacks;\n            while (s.forceReduce() && s.stack.length && s.stack[s.stack.length - 2] >= this.lastBigReductionStart) { }\n            this.bigReductionCount = this.lastBigReductionSize = 0;\n        }\n        // Keep advancing any stacks at `pos` until they either move\n        // forward or can't be advanced. Gather stacks that can't be\n        // advanced further in `stopped`.\n        for (let i = 0; i < stacks.length; i++) {\n            let stack = stacks[i];\n            for (;;) {\n                this.tokens.mainToken = null;\n                if (stack.pos > pos) {\n                    newStacks.push(stack);\n                }\n                else if (this.advanceStack(stack, newStacks, stacks)) {\n                    continue;\n                }\n                else {\n                    if (!stopped) {\n                        stopped = [];\n                        stoppedTokens = [];\n                    }\n                    stopped.push(stack);\n                    let tok = this.tokens.getMainToken(stack);\n                    stoppedTokens.push(tok.value, tok.end);\n                }\n                break;\n            }\n        }\n        if (!newStacks.length) {\n            let finished = stopped && findFinished(stopped);\n            if (finished)\n                return this.stackToTree(finished);\n            if (this.parser.strict) {\n                if (verbose && stopped)\n                    console.log(\"Stuck with token \" + (this.tokens.mainToken ? this.parser.getName(this.tokens.mainToken.value) : \"none\"));\n                throw new SyntaxError(\"No parse at \" + pos);\n            }\n            if (!this.recovering)\n                this.recovering = 5 /* Rec.Distance */;\n        }\n        if (this.recovering && stopped) {\n            let finished = this.stoppedAt != null && stopped[0].pos > this.stoppedAt ? stopped[0]\n                : this.runRecovery(stopped, stoppedTokens, newStacks);\n            if (finished)\n                return this.stackToTree(finished.forceAll());\n        }\n        if (this.recovering) {\n            let maxRemaining = this.recovering == 1 ? 1 : this.recovering * 3 /* Rec.MaxRemainingPerStep */;\n            if (newStacks.length > maxRemaining) {\n                newStacks.sort((a, b) => b.score - a.score);\n                while (newStacks.length > maxRemaining)\n                    newStacks.pop();\n            }\n            if (newStacks.some(s => s.reducePos > pos))\n                this.recovering--;\n        }\n        else if (newStacks.length > 1) {\n            // Prune stacks that are in the same state, or that have been\n            // running without splitting for a while, to avoid getting stuck\n            // with multiple successful stacks running endlessly on.\n            outer: for (let i = 0; i < newStacks.length - 1; i++) {\n                let stack = newStacks[i];\n                for (let j = i + 1; j < newStacks.length; j++) {\n                    let other = newStacks[j];\n                    if (stack.sameState(other) ||\n                        stack.buffer.length > 500 /* Rec.MinBufferLengthPrune */ && other.buffer.length > 500 /* Rec.MinBufferLengthPrune */) {\n                        if (((stack.score - other.score) || (stack.buffer.length - other.buffer.length)) > 0) {\n                            newStacks.splice(j--, 1);\n                        }\n                        else {\n                            newStacks.splice(i--, 1);\n                            continue outer;\n                        }\n                    }\n                }\n            }\n            if (newStacks.length > 12 /* Rec.MaxStackCount */)\n                newStacks.splice(12 /* Rec.MaxStackCount */, newStacks.length - 12 /* Rec.MaxStackCount */);\n        }\n        this.minStackPos = newStacks[0].pos;\n        for (let i = 1; i < newStacks.length; i++)\n            if (newStacks[i].pos < this.minStackPos)\n                this.minStackPos = newStacks[i].pos;\n        return null;\n    }\n    stopAt(pos) {\n        if (this.stoppedAt != null && this.stoppedAt < pos)\n            throw new RangeError(\"Can't move stoppedAt forward\");\n        this.stoppedAt = pos;\n    }\n    // Returns an updated version of the given stack, or null if the\n    // stack can't advance normally. When `split` and `stacks` are\n    // given, stacks split off by ambiguous operations will be pushed to\n    // `split`, or added to `stacks` if they move `pos` forward.\n    advanceStack(stack, stacks, split) {\n        let start = stack.pos, { parser } = this;\n        let base = verbose ? this.stackID(stack) + \" -> \" : \"\";\n        if (this.stoppedAt != null && start > this.stoppedAt)\n            return stack.forceReduce() ? stack : null;\n        if (this.fragments) {\n            let strictCx = stack.curContext && stack.curContext.tracker.strict, cxHash = strictCx ? stack.curContext.hash : 0;\n            for (let cached = this.fragments.nodeAt(start); cached;) {\n                let match = this.parser.nodeSet.types[cached.type.id] == cached.type ? parser.getGoto(stack.state, cached.type.id) : -1;\n                if (match > -1 && cached.length && (!strictCx || (cached.prop(NodeProp.contextHash) || 0) == cxHash)) {\n                    stack.useNode(cached, match);\n                    if (verbose)\n                        console.log(base + this.stackID(stack) + ` (via reuse of ${parser.getName(cached.type.id)})`);\n                    return true;\n                }\n                if (!(cached instanceof Tree) || cached.children.length == 0 || cached.positions[0] > 0)\n                    break;\n                let inner = cached.children[0];\n                if (inner instanceof Tree && cached.positions[0] == 0)\n                    cached = inner;\n                else\n                    break;\n            }\n        }\n        let defaultReduce = parser.stateSlot(stack.state, 4 /* ParseState.DefaultReduce */);\n        if (defaultReduce > 0) {\n            stack.reduce(defaultReduce);\n            if (verbose)\n                console.log(base + this.stackID(stack) + ` (via always-reduce ${parser.getName(defaultReduce & 65535 /* Action.ValueMask */)})`);\n            return true;\n        }\n        if (stack.stack.length >= 15000 /* Rec.CutDepth */) {\n            while (stack.stack.length > 9000 /* Rec.CutTo */ && stack.forceReduce()) { }\n        }\n        let actions = this.tokens.getActions(stack);\n        for (let i = 0; i < actions.length;) {\n            let action = actions[i++], term = actions[i++], end = actions[i++];\n            let last = i == actions.length || !split;\n            let localStack = last ? stack : stack.split();\n            localStack.apply(action, term, end);\n            if (verbose)\n                console.log(base + this.stackID(localStack) + ` (via ${(action & 65536 /* Action.ReduceFlag */) == 0 ? \"shift\"\n                    : `reduce of ${parser.getName(action & 65535 /* Action.ValueMask */)}`} for ${parser.getName(term)} @ ${start}${localStack == stack ? \"\" : \", split\"})`);\n            if (last)\n                return true;\n            else if (localStack.pos > start)\n                stacks.push(localStack);\n            else\n                split.push(localStack);\n        }\n        return false;\n    }\n    // Advance a given stack forward as far as it will go. Returns the\n    // (possibly updated) stack if it got stuck, or null if it moved\n    // forward and was given to `pushStackDedup`.\n    advanceFully(stack, newStacks) {\n        let pos = stack.pos;\n        for (;;) {\n            if (!this.advanceStack(stack, null, null))\n                return false;\n            if (stack.pos > pos) {\n                pushStackDedup(stack, newStacks);\n                return true;\n            }\n        }\n    }\n    runRecovery(stacks, tokens, newStacks) {\n        let finished = null, restarted = false;\n        for (let i = 0; i < stacks.length; i++) {\n            let stack = stacks[i], token = tokens[i << 1], tokenEnd = tokens[(i << 1) + 1];\n            let base = verbose ? this.stackID(stack) + \" -> \" : \"\";\n            if (stack.deadEnd) {\n                if (restarted)\n                    continue;\n                restarted = true;\n                stack.restart();\n                if (verbose)\n                    console.log(base + this.stackID(stack) + \" (restarted)\");\n                let done = this.advanceFully(stack, newStacks);\n                if (done)\n                    continue;\n            }\n            let force = stack.split(), forceBase = base;\n            for (let j = 0; force.forceReduce() && j < 10 /* Rec.ForceReduceLimit */; j++) {\n                if (verbose)\n                    console.log(forceBase + this.stackID(force) + \" (via force-reduce)\");\n                let done = this.advanceFully(force, newStacks);\n                if (done)\n                    break;\n                if (verbose)\n                    forceBase = this.stackID(force) + \" -> \";\n            }\n            for (let insert of stack.recoverByInsert(token)) {\n                if (verbose)\n                    console.log(base + this.stackID(insert) + \" (via recover-insert)\");\n                this.advanceFully(insert, newStacks);\n            }\n            if (this.stream.end > stack.pos) {\n                if (tokenEnd == stack.pos) {\n                    tokenEnd++;\n                    token = 0 /* Term.Err */;\n                }\n                stack.recoverByDelete(token, tokenEnd);\n                if (verbose)\n                    console.log(base + this.stackID(stack) + ` (via recover-delete ${this.parser.getName(token)})`);\n                pushStackDedup(stack, newStacks);\n            }\n            else if (!finished || finished.score < stack.score) {\n                finished = stack;\n            }\n        }\n        return finished;\n    }\n    // Convert the stack's buffer to a syntax tree.\n    stackToTree(stack) {\n        stack.close();\n        return Tree.build({ buffer: StackBufferCursor.create(stack),\n            nodeSet: this.parser.nodeSet,\n            topID: this.topTerm,\n            maxBufferLength: this.parser.bufferLength,\n            reused: this.reused,\n            start: this.ranges[0].from,\n            length: stack.pos - this.ranges[0].from,\n            minRepeatType: this.parser.minRepeatTerm });\n    }\n    stackID(stack) {\n        let id = (stackIDs || (stackIDs = new WeakMap)).get(stack);\n        if (!id)\n            stackIDs.set(stack, id = String.fromCodePoint(this.nextStackID++));\n        return id + stack;\n    }\n}\nfunction pushStackDedup(stack, newStacks) {\n    for (let i = 0; i < newStacks.length; i++) {\n        let other = newStacks[i];\n        if (other.pos == stack.pos && other.sameState(stack)) {\n            if (newStacks[i].score < stack.score)\n                newStacks[i] = stack;\n            return;\n        }\n    }\n    newStacks.push(stack);\n}\nclass Dialect {\n    constructor(source, flags, disabled) {\n        this.source = source;\n        this.flags = flags;\n        this.disabled = disabled;\n    }\n    allows(term) { return !this.disabled || this.disabled[term] == 0; }\n}\nconst id = x => x;\n/// Context trackers are used to track stateful context (such as\n/// indentation in the Python grammar, or parent elements in the XML\n/// grammar) needed by external tokenizers. You declare them in a\n/// grammar file as `@context exportName from \"module\"`.\n///\n/// Context values should be immutable, and can be updated (replaced)\n/// on shift or reduce actions.\n///\n/// The export used in a `@context` declaration should be of this\n/// type.\nclass ContextTracker {\n    /// Define a context tracker.\n    constructor(spec) {\n        this.start = spec.start;\n        this.shift = spec.shift || id;\n        this.reduce = spec.reduce || id;\n        this.reuse = spec.reuse || id;\n        this.hash = spec.hash || (() => 0);\n        this.strict = spec.strict !== false;\n    }\n}\n/// Holds the parse tables for a given grammar, as generated by\n/// `lezer-generator`, and provides [methods](#common.Parser) to parse\n/// content with.\nclass LRParser extends Parser {\n    /// @internal\n    constructor(spec) {\n        super();\n        /// @internal\n        this.wrappers = [];\n        if (spec.version != 14 /* File.Version */)\n            throw new RangeError(`Parser version (${spec.version}) doesn't match runtime version (${14 /* File.Version */})`);\n        let nodeNames = spec.nodeNames.split(\" \");\n        this.minRepeatTerm = nodeNames.length;\n        for (let i = 0; i < spec.repeatNodeCount; i++)\n            nodeNames.push(\"\");\n        let topTerms = Object.keys(spec.topRules).map(r => spec.topRules[r][1]);\n        let nodeProps = [];\n        for (let i = 0; i < nodeNames.length; i++)\n            nodeProps.push([]);\n        function setProp(nodeID, prop, value) {\n            nodeProps[nodeID].push([prop, prop.deserialize(String(value))]);\n        }\n        if (spec.nodeProps)\n            for (let propSpec of spec.nodeProps) {\n                let prop = propSpec[0];\n                if (typeof prop == \"string\")\n                    prop = NodeProp[prop];\n                for (let i = 1; i < propSpec.length;) {\n                    let next = propSpec[i++];\n                    if (next >= 0) {\n                        setProp(next, prop, propSpec[i++]);\n                    }\n                    else {\n                        let value = propSpec[i + -next];\n                        for (let j = -next; j > 0; j--)\n                            setProp(propSpec[i++], prop, value);\n                        i++;\n                    }\n                }\n            }\n        this.nodeSet = new NodeSet(nodeNames.map((name, i) => NodeType.define({\n            name: i >= this.minRepeatTerm ? undefined : name,\n            id: i,\n            props: nodeProps[i],\n            top: topTerms.indexOf(i) > -1,\n            error: i == 0,\n            skipped: spec.skippedNodes && spec.skippedNodes.indexOf(i) > -1\n        })));\n        if (spec.propSources)\n            this.nodeSet = this.nodeSet.extend(...spec.propSources);\n        this.strict = false;\n        this.bufferLength = DefaultBufferLength;\n        let tokenArray = decodeArray(spec.tokenData);\n        this.context = spec.context;\n        this.specializerSpecs = spec.specialized || [];\n        this.specialized = new Uint16Array(this.specializerSpecs.length);\n        for (let i = 0; i < this.specializerSpecs.length; i++)\n            this.specialized[i] = this.specializerSpecs[i].term;\n        this.specializers = this.specializerSpecs.map(getSpecializer);\n        this.states = decodeArray(spec.states, Uint32Array);\n        this.data = decodeArray(spec.stateData);\n        this.goto = decodeArray(spec.goto);\n        this.maxTerm = spec.maxTerm;\n        this.tokenizers = spec.tokenizers.map(value => typeof value == \"number\" ? new TokenGroup(tokenArray, value) : value);\n        this.topRules = spec.topRules;\n        this.dialects = spec.dialects || {};\n        this.dynamicPrecedences = spec.dynamicPrecedences || null;\n        this.tokenPrecTable = spec.tokenPrec;\n        this.termNames = spec.termNames || null;\n        this.maxNode = this.nodeSet.types.length - 1;\n        this.dialect = this.parseDialect();\n        this.top = this.topRules[Object.keys(this.topRules)[0]];\n    }\n    createParse(input, fragments, ranges) {\n        let parse = new Parse(this, input, fragments, ranges);\n        for (let w of this.wrappers)\n            parse = w(parse, input, fragments, ranges);\n        return parse;\n    }\n    /// Get a goto table entry @internal\n    getGoto(state, term, loose = false) {\n        let table = this.goto;\n        if (term >= table[0])\n            return -1;\n        for (let pos = table[term + 1];;) {\n            let groupTag = table[pos++], last = groupTag & 1;\n            let target = table[pos++];\n            if (last && loose)\n                return target;\n            for (let end = pos + (groupTag >> 1); pos < end; pos++)\n                if (table[pos] == state)\n                    return target;\n            if (last)\n                return -1;\n        }\n    }\n    /// Check if this state has an action for a given terminal @internal\n    hasAction(state, terminal) {\n        let data = this.data;\n        for (let set = 0; set < 2; set++) {\n            for (let i = this.stateSlot(state, set ? 2 /* ParseState.Skip */ : 1 /* ParseState.Actions */), next;; i += 3) {\n                if ((next = data[i]) == 65535 /* Seq.End */) {\n                    if (data[i + 1] == 1 /* Seq.Next */)\n                        next = data[i = pair(data, i + 2)];\n                    else if (data[i + 1] == 2 /* Seq.Other */)\n                        return pair(data, i + 2);\n                    else\n                        break;\n                }\n                if (next == terminal || next == 0 /* Term.Err */)\n                    return pair(data, i + 1);\n            }\n        }\n        return 0;\n    }\n    /// @internal\n    stateSlot(state, slot) {\n        return this.states[(state * 6 /* ParseState.Size */) + slot];\n    }\n    /// @internal\n    stateFlag(state, flag) {\n        return (this.stateSlot(state, 0 /* ParseState.Flags */) & flag) > 0;\n    }\n    /// @internal\n    validAction(state, action) {\n        return !!this.allActions(state, a => a == action ? true : null);\n    }\n    /// @internal\n    allActions(state, action) {\n        let deflt = this.stateSlot(state, 4 /* ParseState.DefaultReduce */);\n        let result = deflt ? action(deflt) : undefined;\n        for (let i = this.stateSlot(state, 1 /* ParseState.Actions */); result == null; i += 3) {\n            if (this.data[i] == 65535 /* Seq.End */) {\n                if (this.data[i + 1] == 1 /* Seq.Next */)\n                    i = pair(this.data, i + 2);\n                else\n                    break;\n            }\n            result = action(pair(this.data, i + 1));\n        }\n        return result;\n    }\n    /// Get the states that can follow this one through shift actions or\n    /// goto jumps. @internal\n    nextStates(state) {\n        let result = [];\n        for (let i = this.stateSlot(state, 1 /* ParseState.Actions */);; i += 3) {\n            if (this.data[i] == 65535 /* Seq.End */) {\n                if (this.data[i + 1] == 1 /* Seq.Next */)\n                    i = pair(this.data, i + 2);\n                else\n                    break;\n            }\n            if ((this.data[i + 2] & (65536 /* Action.ReduceFlag */ >> 16)) == 0) {\n                let value = this.data[i + 1];\n                if (!result.some((v, i) => (i & 1) && v == value))\n                    result.push(this.data[i], value);\n            }\n        }\n        return result;\n    }\n    /// Configure the parser. Returns a new parser instance that has the\n    /// given settings modified. Settings not provided in `config` are\n    /// kept from the original parser.\n    configure(config) {\n        // Hideous reflection-based kludge to make it easy to create a\n        // slightly modified copy of a parser.\n        let copy = Object.assign(Object.create(LRParser.prototype), this);\n        if (config.props)\n            copy.nodeSet = this.nodeSet.extend(...config.props);\n        if (config.top) {\n            let info = this.topRules[config.top];\n            if (!info)\n                throw new RangeError(`Invalid top rule name ${config.top}`);\n            copy.top = info;\n        }\n        if (config.tokenizers)\n            copy.tokenizers = this.tokenizers.map(t => {\n                let found = config.tokenizers.find(r => r.from == t);\n                return found ? found.to : t;\n            });\n        if (config.specializers) {\n            copy.specializers = this.specializers.slice();\n            copy.specializerSpecs = this.specializerSpecs.map((s, i) => {\n                let found = config.specializers.find(r => r.from == s.external);\n                if (!found)\n                    return s;\n                let spec = Object.assign(Object.assign({}, s), { external: found.to });\n                copy.specializers[i] = getSpecializer(spec);\n                return spec;\n            });\n        }\n        if (config.contextTracker)\n            copy.context = config.contextTracker;\n        if (config.dialect)\n            copy.dialect = this.parseDialect(config.dialect);\n        if (config.strict != null)\n            copy.strict = config.strict;\n        if (config.wrap)\n            copy.wrappers = copy.wrappers.concat(config.wrap);\n        if (config.bufferLength != null)\n            copy.bufferLength = config.bufferLength;\n        return copy;\n    }\n    /// Tells you whether any [parse wrappers](#lr.ParserConfig.wrap)\n    /// are registered for this parser.\n    hasWrappers() {\n        return this.wrappers.length > 0;\n    }\n    /// Returns the name associated with a given term. This will only\n    /// work for all terms when the parser was generated with the\n    /// `--names` option. By default, only the names of tagged terms are\n    /// stored.\n    getName(term) {\n        return this.termNames ? this.termNames[term] : String(term <= this.maxNode && this.nodeSet.types[term].name || term);\n    }\n    /// The eof term id is always allocated directly after the node\n    /// types. @internal\n    get eofTerm() { return this.maxNode + 1; }\n    /// The type of top node produced by the parser.\n    get topNode() { return this.nodeSet.types[this.top[1]]; }\n    /// @internal\n    dynamicPrecedence(term) {\n        let prec = this.dynamicPrecedences;\n        return prec == null ? 0 : prec[term] || 0;\n    }\n    /// @internal\n    parseDialect(dialect) {\n        let values = Object.keys(this.dialects), flags = values.map(() => false);\n        if (dialect)\n            for (let part of dialect.split(\" \")) {\n                let id = values.indexOf(part);\n                if (id >= 0)\n                    flags[id] = true;\n            }\n        let disabled = null;\n        for (let i = 0; i < values.length; i++)\n            if (!flags[i]) {\n                for (let j = this.dialects[values[i]], id; (id = this.data[j++]) != 65535 /* Seq.End */;)\n                    (disabled || (disabled = new Uint8Array(this.maxTerm + 1)))[id] = 1;\n            }\n        return new Dialect(dialect, flags, disabled);\n    }\n    /// Used by the output of the parser generator. Not available to\n    /// user code. @hide\n    static deserialize(spec) {\n        return new LRParser(spec);\n    }\n}\nfunction pair(data, off) { return data[off] | (data[off + 1] << 16); }\nfunction findFinished(stacks) {\n    let best = null;\n    for (let stack of stacks) {\n        let stopped = stack.p.stoppedAt;\n        if ((stack.pos == stack.p.stream.end || stopped != null && stack.pos > stopped) &&\n            stack.p.parser.stateFlag(stack.state, 2 /* StateFlag.Accepting */) &&\n            (!best || best.score < stack.score))\n            best = stack;\n    }\n    return best;\n}\nfunction getSpecializer(spec) {\n    if (spec.external) {\n        let mask = spec.extend ? 1 /* Specialize.Extend */ : 0 /* Specialize.Specialize */;\n        return (value, stack) => (spec.external(value, stack) << 1) | mask;\n    }\n    return spec.get;\n}\n\nexport { ContextTracker, ExternalTokenizer, InputStream, LRParser, LocalTokenGroup, Stack };\n","import { NodeProp } from '@lezer/common';\n\nlet nextTagID = 0;\n/**\nHighlighting tags are markers that denote a highlighting category.\nThey are [associated](#highlight.styleTags) with parts of a syntax\ntree by a language mode, and then mapped to an actual CSS style by\na [highlighter](#highlight.Highlighter).\n\nBecause syntax tree node types and highlight styles have to be\nable to talk the same language, CodeMirror uses a mostly _closed_\n[vocabulary](#highlight.tags) of syntax tags (as opposed to\ntraditional open string-based systems, which make it hard for\nhighlighting themes to cover all the tokens produced by the\nvarious languages).\n\nIt _is_ possible to [define](#highlight.Tag^define) your own\nhighlighting tags for system-internal use (where you control both\nthe language package and the highlighter), but such tags will not\nbe picked up by regular highlighters (though you can derive them\nfrom standard tags to allow highlighters to fall back to those).\n*/\nclass Tag {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    The set of this tag and all its parent tags, starting with\n    this one itself and sorted in order of decreasing specificity.\n    */\n    set, \n    /**\n    The base unmodified tag that this one is based on, if it's\n    modified @internal\n    */\n    base, \n    /**\n    The modifiers applied to this.base @internal\n    */\n    modified) {\n        this.set = set;\n        this.base = base;\n        this.modified = modified;\n        /**\n        @internal\n        */\n        this.id = nextTagID++;\n    }\n    /**\n    Define a new tag. If `parent` is given, the tag is treated as a\n    sub-tag of that parent, and\n    [highlighters](#highlight.tagHighlighter) that don't mention\n    this tag will try to fall back to the parent tag (or grandparent\n    tag, etc).\n    */\n    static define(parent) {\n        if (parent === null || parent === void 0 ? void 0 : parent.base)\n            throw new Error(\"Can not derive from a modified tag\");\n        let tag = new Tag([], null, []);\n        tag.set.push(tag);\n        if (parent)\n            for (let t of parent.set)\n                tag.set.push(t);\n        return tag;\n    }\n    /**\n    Define a tag _modifier_, which is a function that, given a tag,\n    will return a tag that is a subtag of the original. Applying the\n    same modifier to a twice tag will return the same value (`m1(t1)\n    == m1(t1)`) and applying multiple modifiers will, regardless or\n    order, produce the same tag (`m1(m2(t1)) == m2(m1(t1))`).\n    \n    When multiple modifiers are applied to a given base tag, each\n    smaller set of modifiers is registered as a parent, so that for\n    example `m1(m2(m3(t1)))` is a subtype of `m1(m2(t1))`,\n    `m1(m3(t1)`, and so on.\n    */\n    static defineModifier() {\n        let mod = new Modifier;\n        return (tag) => {\n            if (tag.modified.indexOf(mod) > -1)\n                return tag;\n            return Modifier.get(tag.base || tag, tag.modified.concat(mod).sort((a, b) => a.id - b.id));\n        };\n    }\n}\nlet nextModifierID = 0;\nclass Modifier {\n    constructor() {\n        this.instances = [];\n        this.id = nextModifierID++;\n    }\n    static get(base, mods) {\n        if (!mods.length)\n            return base;\n        let exists = mods[0].instances.find(t => t.base == base && sameArray(mods, t.modified));\n        if (exists)\n            return exists;\n        let set = [], tag = new Tag(set, base, mods);\n        for (let m of mods)\n            m.instances.push(tag);\n        let configs = powerSet(mods);\n        for (let parent of base.set)\n            if (!parent.modified.length)\n                for (let config of configs)\n                    set.push(Modifier.get(parent, config));\n        return tag;\n    }\n}\nfunction sameArray(a, b) {\n    return a.length == b.length && a.every((x, i) => x == b[i]);\n}\nfunction powerSet(array) {\n    let sets = [[]];\n    for (let i = 0; i < array.length; i++) {\n        for (let j = 0, e = sets.length; j < e; j++) {\n            sets.push(sets[j].concat(array[i]));\n        }\n    }\n    return sets.sort((a, b) => b.length - a.length);\n}\n/**\nThis function is used to add a set of tags to a language syntax\nvia [`NodeSet.extend`](#common.NodeSet.extend) or\n[`LRParser.configure`](#lr.LRParser.configure).\n\nThe argument object maps node selectors to [highlighting\ntags](#highlight.Tag) or arrays of tags.\n\nNode selectors may hold one or more (space-separated) node paths.\nSuch a path can be a [node name](#common.NodeType.name), or\nmultiple node names (or `*` wildcards) separated by slash\ncharacters, as in `\"Block/Declaration/VariableName\"`. Such a path\nmatches the final node but only if its direct parent nodes are the\nother nodes mentioned. A `*` in such a path matches any parent,\nbut only a single level—wildcards that match multiple parents\naren't supported, both for efficiency reasons and because Lezer\ntrees make it rather hard to reason about what they would match.)\n\nA path can be ended with `/...` to indicate that the tag assigned\nto the node should also apply to all child nodes, even if they\nmatch their own style (by default, only the innermost style is\nused).\n\nWhen a path ends in `!`, as in `Attribute!`, no further matching\nhappens for the node's child nodes, and the entire node gets the\ngiven style.\n\nIn this notation, node names that contain `/`, `!`, `*`, or `...`\nmust be quoted as JSON strings.\n\nFor example:\n\n```javascript\nparser.withProps(\n  styleTags({\n    // Style Number and BigNumber nodes\n    \"Number BigNumber\": tags.number,\n    // Style Escape nodes whose parent is String\n    \"String/Escape\": tags.escape,\n    // Style anything inside Attributes nodes\n    \"Attributes!\": tags.meta,\n    // Add a style to all content inside Italic nodes\n    \"Italic/...\": tags.emphasis,\n    // Style InvalidString nodes as both `string` and `invalid`\n    \"InvalidString\": [tags.string, tags.invalid],\n    // Style the node named \"/\" as punctuation\n    '\"/\"': tags.punctuation\n  })\n)\n```\n*/\nfunction styleTags(spec) {\n    let byName = Object.create(null);\n    for (let prop in spec) {\n        let tags = spec[prop];\n        if (!Array.isArray(tags))\n            tags = [tags];\n        for (let part of prop.split(\" \"))\n            if (part) {\n                let pieces = [], mode = 2 /* Normal */, rest = part;\n                for (let pos = 0;;) {\n                    if (rest == \"...\" && pos > 0 && pos + 3 == part.length) {\n                        mode = 1 /* Inherit */;\n                        break;\n                    }\n                    let m = /^\"(?:[^\"\\\\]|\\\\.)*?\"|[^\\/!]+/.exec(rest);\n                    if (!m)\n                        throw new RangeError(\"Invalid path: \" + part);\n                    pieces.push(m[0] == \"*\" ? \"\" : m[0][0] == '\"' ? JSON.parse(m[0]) : m[0]);\n                    pos += m[0].length;\n                    if (pos == part.length)\n                        break;\n                    let next = part[pos++];\n                    if (pos == part.length && next == \"!\") {\n                        mode = 0 /* Opaque */;\n                        break;\n                    }\n                    if (next != \"/\")\n                        throw new RangeError(\"Invalid path: \" + part);\n                    rest = part.slice(pos);\n                }\n                let last = pieces.length - 1, inner = pieces[last];\n                if (!inner)\n                    throw new RangeError(\"Invalid path: \" + part);\n                let rule = new Rule(tags, mode, last > 0 ? pieces.slice(0, last) : null);\n                byName[inner] = rule.sort(byName[inner]);\n            }\n    }\n    return ruleNodeProp.add(byName);\n}\nconst ruleNodeProp = new NodeProp();\nclass Rule {\n    constructor(tags, mode, context, next) {\n        this.tags = tags;\n        this.mode = mode;\n        this.context = context;\n        this.next = next;\n    }\n    get opaque() { return this.mode == 0 /* Opaque */; }\n    get inherit() { return this.mode == 1 /* Inherit */; }\n    sort(other) {\n        if (!other || other.depth < this.depth) {\n            this.next = other;\n            return this;\n        }\n        other.next = this.sort(other.next);\n        return other;\n    }\n    get depth() { return this.context ? this.context.length : 0; }\n}\nRule.empty = new Rule([], 2 /* Normal */, null);\n/**\nDefine a [highlighter](#highlight.Highlighter) from an array of\ntag/class pairs. Classes associated with more specific tags will\ntake precedence.\n*/\nfunction tagHighlighter(tags, options) {\n    let map = Object.create(null);\n    for (let style of tags) {\n        if (!Array.isArray(style.tag))\n            map[style.tag.id] = style.class;\n        else\n            for (let tag of style.tag)\n                map[tag.id] = style.class;\n    }\n    let { scope, all = null } = options || {};\n    return {\n        style: (tags) => {\n            let cls = all;\n            for (let tag of tags) {\n                for (let sub of tag.set) {\n                    let tagClass = map[sub.id];\n                    if (tagClass) {\n                        cls = cls ? cls + \" \" + tagClass : tagClass;\n                        break;\n                    }\n                }\n            }\n            return cls;\n        },\n        scope\n    };\n}\nfunction highlightTags(highlighters, tags) {\n    let result = null;\n    for (let highlighter of highlighters) {\n        let value = highlighter.style(tags);\n        if (value)\n            result = result ? result + \" \" + value : value;\n    }\n    return result;\n}\n/**\nHighlight the given [tree](#common.Tree) with the given\n[highlighter](#highlight.Highlighter).\n*/\nfunction highlightTree(tree, highlighter, \n/**\nAssign styling to a region of the text. Will be called, in order\nof position, for any ranges where more than zero classes apply.\n`classes` is a space separated string of CSS classes.\n*/\nputStyle, \n/**\nThe start of the range to highlight.\n*/\nfrom = 0, \n/**\nThe end of the range.\n*/\nto = tree.length) {\n    let builder = new HighlightBuilder(from, Array.isArray(highlighter) ? highlighter : [highlighter], putStyle);\n    builder.highlightRange(tree.cursor(), from, to, \"\", builder.highlighters);\n    builder.flush(to);\n}\nclass HighlightBuilder {\n    constructor(at, highlighters, span) {\n        this.at = at;\n        this.highlighters = highlighters;\n        this.span = span;\n        this.class = \"\";\n    }\n    startSpan(at, cls) {\n        if (cls != this.class) {\n            this.flush(at);\n            if (at > this.at)\n                this.at = at;\n            this.class = cls;\n        }\n    }\n    flush(to) {\n        if (to > this.at && this.class)\n            this.span(this.at, to, this.class);\n    }\n    highlightRange(cursor, from, to, inheritedClass, highlighters) {\n        let { type, from: start, to: end } = cursor;\n        if (start >= to || end <= from)\n            return;\n        if (type.isTop)\n            highlighters = this.highlighters.filter(h => !h.scope || h.scope(type));\n        let cls = inheritedClass;\n        let rule = getStyleTags(cursor) || Rule.empty;\n        let tagCls = highlightTags(highlighters, rule.tags);\n        if (tagCls) {\n            if (cls)\n                cls += \" \";\n            cls += tagCls;\n            if (rule.mode == 1 /* Inherit */)\n                inheritedClass += (inheritedClass ? \" \" : \"\") + tagCls;\n        }\n        this.startSpan(Math.max(from, start), cls);\n        if (rule.opaque)\n            return;\n        let mounted = cursor.tree && cursor.tree.prop(NodeProp.mounted);\n        if (mounted && mounted.overlay) {\n            let inner = cursor.node.enter(mounted.overlay[0].from + start, 1);\n            let innerHighlighters = this.highlighters.filter(h => !h.scope || h.scope(mounted.tree.type));\n            let hasChild = cursor.firstChild();\n            for (let i = 0, pos = start;; i++) {\n                let next = i < mounted.overlay.length ? mounted.overlay[i] : null;\n                let nextPos = next ? next.from + start : end;\n                let rangeFrom = Math.max(from, pos), rangeTo = Math.min(to, nextPos);\n                if (rangeFrom < rangeTo && hasChild) {\n                    while (cursor.from < rangeTo) {\n                        this.highlightRange(cursor, rangeFrom, rangeTo, inheritedClass, highlighters);\n                        this.startSpan(Math.min(rangeTo, cursor.to), cls);\n                        if (cursor.to >= nextPos || !cursor.nextSibling())\n                            break;\n                    }\n                }\n                if (!next || nextPos > to)\n                    break;\n                pos = next.to + start;\n                if (pos > from) {\n                    this.highlightRange(inner.cursor(), Math.max(from, next.from + start), Math.min(to, pos), \"\", innerHighlighters);\n                    this.startSpan(Math.min(to, pos), cls);\n                }\n            }\n            if (hasChild)\n                cursor.parent();\n        }\n        else if (cursor.firstChild()) {\n            if (mounted)\n                inheritedClass = \"\";\n            do {\n                if (cursor.to <= from)\n                    continue;\n                if (cursor.from >= to)\n                    break;\n                this.highlightRange(cursor, from, to, inheritedClass, highlighters);\n                this.startSpan(Math.min(to, cursor.to), cls);\n            } while (cursor.nextSibling());\n            cursor.parent();\n        }\n    }\n}\n/**\nMatch a syntax node's [highlight rules](#highlight.styleTags). If\nthere's a match, return its set of tags, and whether it is\nopaque (uses a `!`) or applies to all child nodes (`/...`).\n*/\nfunction getStyleTags(node) {\n    let rule = node.type.prop(ruleNodeProp);\n    while (rule && rule.context && !node.matchContext(rule.context))\n        rule = rule.next;\n    return rule || null;\n}\nconst t = Tag.define;\nconst comment = t(), name = t(), typeName = t(name), propertyName = t(name), literal = t(), string = t(literal), number = t(literal), content = t(), heading = t(content), keyword = t(), operator = t(), punctuation = t(), bracket = t(punctuation), meta = t();\n/**\nThe default set of highlighting [tags](#highlight.Tag).\n\nThis collection is heavily biased towards programming languages,\nand necessarily incomplete. A full ontology of syntactic\nconstructs would fill a stack of books, and be impractical to\nwrite themes for. So try to make do with this set. If all else\nfails, [open an\nissue](https://github.com/codemirror/codemirror.next) to propose a\nnew tag, or [define](#highlight.Tag^define) a local custom tag for\nyour use case.\n\nNote that it is not obligatory to always attach the most specific\ntag possible to an element—if your grammar can't easily\ndistinguish a certain type of element (such as a local variable),\nit is okay to style it as its more general variant (a variable).\n\nFor tags that extend some parent tag, the documentation links to\nthe parent.\n*/\nconst tags = {\n    /**\n    A comment.\n    */\n    comment,\n    /**\n    A line [comment](#highlight.tags.comment).\n    */\n    lineComment: t(comment),\n    /**\n    A block [comment](#highlight.tags.comment).\n    */\n    blockComment: t(comment),\n    /**\n    A documentation [comment](#highlight.tags.comment).\n    */\n    docComment: t(comment),\n    /**\n    Any kind of identifier.\n    */\n    name,\n    /**\n    The [name](#highlight.tags.name) of a variable.\n    */\n    variableName: t(name),\n    /**\n    A type [name](#highlight.tags.name).\n    */\n    typeName: typeName,\n    /**\n    A tag name (subtag of [`typeName`](#highlight.tags.typeName)).\n    */\n    tagName: t(typeName),\n    /**\n    A property or field [name](#highlight.tags.name).\n    */\n    propertyName: propertyName,\n    /**\n    An attribute name (subtag of [`propertyName`](#highlight.tags.propertyName)).\n    */\n    attributeName: t(propertyName),\n    /**\n    The [name](#highlight.tags.name) of a class.\n    */\n    className: t(name),\n    /**\n    A label [name](#highlight.tags.name).\n    */\n    labelName: t(name),\n    /**\n    A namespace [name](#highlight.tags.name).\n    */\n    namespace: t(name),\n    /**\n    The [name](#highlight.tags.name) of a macro.\n    */\n    macroName: t(name),\n    /**\n    A literal value.\n    */\n    literal,\n    /**\n    A string [literal](#highlight.tags.literal).\n    */\n    string,\n    /**\n    A documentation [string](#highlight.tags.string).\n    */\n    docString: t(string),\n    /**\n    A character literal (subtag of [string](#highlight.tags.string)).\n    */\n    character: t(string),\n    /**\n    An attribute value (subtag of [string](#highlight.tags.string)).\n    */\n    attributeValue: t(string),\n    /**\n    A number [literal](#highlight.tags.literal).\n    */\n    number,\n    /**\n    An integer [number](#highlight.tags.number) literal.\n    */\n    integer: t(number),\n    /**\n    A floating-point [number](#highlight.tags.number) literal.\n    */\n    float: t(number),\n    /**\n    A boolean [literal](#highlight.tags.literal).\n    */\n    bool: t(literal),\n    /**\n    Regular expression [literal](#highlight.tags.literal).\n    */\n    regexp: t(literal),\n    /**\n    An escape [literal](#highlight.tags.literal), for example a\n    backslash escape in a string.\n    */\n    escape: t(literal),\n    /**\n    A color [literal](#highlight.tags.literal).\n    */\n    color: t(literal),\n    /**\n    A URL [literal](#highlight.tags.literal).\n    */\n    url: t(literal),\n    /**\n    A language keyword.\n    */\n    keyword,\n    /**\n    The [keyword](#highlight.tags.keyword) for the self or this\n    object.\n    */\n    self: t(keyword),\n    /**\n    The [keyword](#highlight.tags.keyword) for null.\n    */\n    null: t(keyword),\n    /**\n    A [keyword](#highlight.tags.keyword) denoting some atomic value.\n    */\n    atom: t(keyword),\n    /**\n    A [keyword](#highlight.tags.keyword) that represents a unit.\n    */\n    unit: t(keyword),\n    /**\n    A modifier [keyword](#highlight.tags.keyword).\n    */\n    modifier: t(keyword),\n    /**\n    A [keyword](#highlight.tags.keyword) that acts as an operator.\n    */\n    operatorKeyword: t(keyword),\n    /**\n    A control-flow related [keyword](#highlight.tags.keyword).\n    */\n    controlKeyword: t(keyword),\n    /**\n    A [keyword](#highlight.tags.keyword) that defines something.\n    */\n    definitionKeyword: t(keyword),\n    /**\n    A [keyword](#highlight.tags.keyword) related to defining or\n    interfacing with modules.\n    */\n    moduleKeyword: t(keyword),\n    /**\n    An operator.\n    */\n    operator,\n    /**\n    An [operator](#highlight.tags.operator) that dereferences something.\n    */\n    derefOperator: t(operator),\n    /**\n    Arithmetic-related [operator](#highlight.tags.operator).\n    */\n    arithmeticOperator: t(operator),\n    /**\n    Logical [operator](#highlight.tags.operator).\n    */\n    logicOperator: t(operator),\n    /**\n    Bit [operator](#highlight.tags.operator).\n    */\n    bitwiseOperator: t(operator),\n    /**\n    Comparison [operator](#highlight.tags.operator).\n    */\n    compareOperator: t(operator),\n    /**\n    [Operator](#highlight.tags.operator) that updates its operand.\n    */\n    updateOperator: t(operator),\n    /**\n    [Operator](#highlight.tags.operator) that defines something.\n    */\n    definitionOperator: t(operator),\n    /**\n    Type-related [operator](#highlight.tags.operator).\n    */\n    typeOperator: t(operator),\n    /**\n    Control-flow [operator](#highlight.tags.operator).\n    */\n    controlOperator: t(operator),\n    /**\n    Program or markup punctuation.\n    */\n    punctuation,\n    /**\n    [Punctuation](#highlight.tags.punctuation) that separates\n    things.\n    */\n    separator: t(punctuation),\n    /**\n    Bracket-style [punctuation](#highlight.tags.punctuation).\n    */\n    bracket,\n    /**\n    Angle [brackets](#highlight.tags.bracket) (usually `<` and `>`\n    tokens).\n    */\n    angleBracket: t(bracket),\n    /**\n    Square [brackets](#highlight.tags.bracket) (usually `[` and `]`\n    tokens).\n    */\n    squareBracket: t(bracket),\n    /**\n    Parentheses (usually `(` and `)` tokens). Subtag of\n    [bracket](#highlight.tags.bracket).\n    */\n    paren: t(bracket),\n    /**\n    Braces (usually `{` and `}` tokens). Subtag of\n    [bracket](#highlight.tags.bracket).\n    */\n    brace: t(bracket),\n    /**\n    Content, for example plain text in XML or markup documents.\n    */\n    content,\n    /**\n    [Content](#highlight.tags.content) that represents a heading.\n    */\n    heading,\n    /**\n    A level 1 [heading](#highlight.tags.heading).\n    */\n    heading1: t(heading),\n    /**\n    A level 2 [heading](#highlight.tags.heading).\n    */\n    heading2: t(heading),\n    /**\n    A level 3 [heading](#highlight.tags.heading).\n    */\n    heading3: t(heading),\n    /**\n    A level 4 [heading](#highlight.tags.heading).\n    */\n    heading4: t(heading),\n    /**\n    A level 5 [heading](#highlight.tags.heading).\n    */\n    heading5: t(heading),\n    /**\n    A level 6 [heading](#highlight.tags.heading).\n    */\n    heading6: t(heading),\n    /**\n    A prose separator (such as a horizontal rule).\n    */\n    contentSeparator: t(content),\n    /**\n    [Content](#highlight.tags.content) that represents a list.\n    */\n    list: t(content),\n    /**\n    [Content](#highlight.tags.content) that represents a quote.\n    */\n    quote: t(content),\n    /**\n    [Content](#highlight.tags.content) that is emphasized.\n    */\n    emphasis: t(content),\n    /**\n    [Content](#highlight.tags.content) that is styled strong.\n    */\n    strong: t(content),\n    /**\n    [Content](#highlight.tags.content) that is part of a link.\n    */\n    link: t(content),\n    /**\n    [Content](#highlight.tags.content) that is styled as code or\n    monospace.\n    */\n    monospace: t(content),\n    /**\n    [Content](#highlight.tags.content) that has a strike-through\n    style.\n    */\n    strikethrough: t(content),\n    /**\n    Inserted text in a change-tracking format.\n    */\n    inserted: t(),\n    /**\n    Deleted text.\n    */\n    deleted: t(),\n    /**\n    Changed text.\n    */\n    changed: t(),\n    /**\n    An invalid or unsyntactic element.\n    */\n    invalid: t(),\n    /**\n    Metadata or meta-instruction.\n    */\n    meta,\n    /**\n    [Metadata](#highlight.tags.meta) that applies to the entire\n    document.\n    */\n    documentMeta: t(meta),\n    /**\n    [Metadata](#highlight.tags.meta) that annotates or adds\n    attributes to a given syntactic element.\n    */\n    annotation: t(meta),\n    /**\n    Processing instruction or preprocessor directive. Subtag of\n    [meta](#highlight.tags.meta).\n    */\n    processingInstruction: t(meta),\n    /**\n    [Modifier](#highlight.Tag^defineModifier) that indicates that a\n    given element is being defined. Expected to be used with the\n    various [name](#highlight.tags.name) tags.\n    */\n    definition: Tag.defineModifier(),\n    /**\n    [Modifier](#highlight.Tag^defineModifier) that indicates that\n    something is constant. Mostly expected to be used with\n    [variable names](#highlight.tags.variableName).\n    */\n    constant: Tag.defineModifier(),\n    /**\n    [Modifier](#highlight.Tag^defineModifier) used to indicate that\n    a [variable](#highlight.tags.variableName) or [property\n    name](#highlight.tags.propertyName) is being called or defined\n    as a function.\n    */\n    function: Tag.defineModifier(),\n    /**\n    [Modifier](#highlight.Tag^defineModifier) that can be applied to\n    [names](#highlight.tags.name) to indicate that they belong to\n    the language's standard environment.\n    */\n    standard: Tag.defineModifier(),\n    /**\n    [Modifier](#highlight.Tag^defineModifier) that indicates a given\n    [names](#highlight.tags.name) is local to some scope.\n    */\n    local: Tag.defineModifier(),\n    /**\n    A generic variant [modifier](#highlight.Tag^defineModifier) that\n    can be used to tag language-specific alternative variants of\n    some common tag. It is recommended for themes to define special\n    forms of at least the [string](#highlight.tags.string) and\n    [variable name](#highlight.tags.variableName) tags, since those\n    come up a lot.\n    */\n    special: Tag.defineModifier()\n};\n/**\nThis is a highlighter that adds stable, predictable classes to\ntokens, for styling with external CSS.\n\nThe following tags are mapped to their name prefixed with `\"tok-\"`\n(for example `\"tok-comment\"`):\n\n* [`link`](#highlight.tags.link)\n* [`heading`](#highlight.tags.heading)\n* [`emphasis`](#highlight.tags.emphasis)\n* [`strong`](#highlight.tags.strong)\n* [`keyword`](#highlight.tags.keyword)\n* [`atom`](#highlight.tags.atom)\n* [`bool`](#highlight.tags.bool)\n* [`url`](#highlight.tags.url)\n* [`labelName`](#highlight.tags.labelName)\n* [`inserted`](#highlight.tags.inserted)\n* [`deleted`](#highlight.tags.deleted)\n* [`literal`](#highlight.tags.literal)\n* [`string`](#highlight.tags.string)\n* [`number`](#highlight.tags.number)\n* [`variableName`](#highlight.tags.variableName)\n* [`typeName`](#highlight.tags.typeName)\n* [`namespace`](#highlight.tags.namespace)\n* [`className`](#highlight.tags.className)\n* [`macroName`](#highlight.tags.macroName)\n* [`propertyName`](#highlight.tags.propertyName)\n* [`operator`](#highlight.tags.operator)\n* [`comment`](#highlight.tags.comment)\n* [`meta`](#highlight.tags.meta)\n* [`punctuation`](#highlight.tags.punctuation)\n* [`invalid`](#highlight.tags.invalid)\n\nIn addition, these mappings are provided:\n\n* [`regexp`](#highlight.tags.regexp),\n  [`escape`](#highlight.tags.escape), and\n  [`special`](#highlight.tags.special)[`(string)`](#highlight.tags.string)\n  are mapped to `\"tok-string2\"`\n* [`special`](#highlight.tags.special)[`(variableName)`](#highlight.tags.variableName)\n  to `\"tok-variableName2\"`\n* [`local`](#highlight.tags.local)[`(variableName)`](#highlight.tags.variableName)\n  to `\"tok-variableName tok-local\"`\n* [`definition`](#highlight.tags.definition)[`(variableName)`](#highlight.tags.variableName)\n  to `\"tok-variableName tok-definition\"`\n* [`definition`](#highlight.tags.definition)[`(propertyName)`](#highlight.tags.propertyName)\n  to `\"tok-propertyName tok-definition\"`\n*/\nconst classHighlighter = tagHighlighter([\n    { tag: tags.link, class: \"tok-link\" },\n    { tag: tags.heading, class: \"tok-heading\" },\n    { tag: tags.emphasis, class: \"tok-emphasis\" },\n    { tag: tags.strong, class: \"tok-strong\" },\n    { tag: tags.keyword, class: \"tok-keyword\" },\n    { tag: tags.atom, class: \"tok-atom\" },\n    { tag: tags.bool, class: \"tok-bool\" },\n    { tag: tags.url, class: \"tok-url\" },\n    { tag: tags.labelName, class: \"tok-labelName\" },\n    { tag: tags.inserted, class: \"tok-inserted\" },\n    { tag: tags.deleted, class: \"tok-deleted\" },\n    { tag: tags.literal, class: \"tok-literal\" },\n    { tag: tags.string, class: \"tok-string\" },\n    { tag: tags.number, class: \"tok-number\" },\n    { tag: [tags.regexp, tags.escape, tags.special(tags.string)], class: \"tok-string2\" },\n    { tag: tags.variableName, class: \"tok-variableName\" },\n    { tag: tags.local(tags.variableName), class: \"tok-variableName tok-local\" },\n    { tag: tags.definition(tags.variableName), class: \"tok-variableName tok-definition\" },\n    { tag: tags.special(tags.variableName), class: \"tok-variableName2\" },\n    { tag: tags.definition(tags.propertyName), class: \"tok-propertyName tok-definition\" },\n    { tag: tags.typeName, class: \"tok-typeName\" },\n    { tag: tags.namespace, class: \"tok-namespace\" },\n    { tag: tags.className, class: \"tok-className\" },\n    { tag: tags.macroName, class: \"tok-macroName\" },\n    { tag: tags.propertyName, class: \"tok-propertyName\" },\n    { tag: tags.operator, class: \"tok-operator\" },\n    { tag: tags.comment, class: \"tok-comment\" },\n    { tag: tags.meta, class: \"tok-meta\" },\n    { tag: tags.invalid, class: \"tok-invalid\" },\n    { tag: tags.punctuation, class: \"tok-punctuation\" }\n]);\n\nexport { Tag, classHighlighter, getStyleTags, highlightTree, styleTags, tagHighlighter, tags };\n","import { ExternalTokenizer, LRParser } from '@lezer/lr';\nimport { styleTags, tags } from '@lezer/highlight';\n\n// This file was generated by lezer-generator. You probably shouldn't edit it.\nconst closureParamDelim = 1,\n  tpOpen = 2,\n  tpClose = 3,\n  RawString = 4,\n  Float = 5;\n\nconst _b = 98, _e = 101, _f = 102, _r = 114, _E = 69, Zero = 48,\n      Dot = 46, Plus = 43, Minus = 45, Hash = 35, Quote = 34, Pipe = 124, LessThan = 60, GreaterThan = 62;\n\nfunction isNum(ch) { return ch >= 48 && ch <= 57 }\nfunction isNum_(ch) { return isNum(ch) || ch == 95 }\n\nconst literalTokens = new ExternalTokenizer((input, stack) => {\n  if (isNum(input.next)) {\n    let isFloat = false;\n    do { input.advance(); } while (isNum_(input.next))\n    if (input.next == Dot) {\n      isFloat = true;\n      input.advance();\n      if (isNum(input.next)) {\n        do { input.advance(); } while (isNum_(input.next))\n      } else if (input.next == Dot || input.next > 0x7f || /\\w/.test(String.fromCharCode(input.next))) {\n        return\n      }\n    }\n    if (input.next == _e || input.next == _E) {\n      isFloat = true;\n      input.advance();\n      if (input.next == Plus || input.next == Minus) input.advance();\n      if (!isNum_(input.next)) return\n      do { input.advance(); } while (isNum_(input.next))\n    }\n    if (input.next == _f) {\n      let after = input.peek(1);\n      if (after == Zero + 3 && input.peek(2) == Zero + 2 ||\n          after == Zero + 6 && input.peek(2) == Zero + 4) {\n        input.advance(3);\n        isFloat = true;\n      } else {\n        return\n      }\n    }\n    if (isFloat) input.acceptToken(Float);\n  } else if (input.next == _b || input.next == _r) {\n    if (input.next == _b) input.advance();\n    if (input.next != _r) return\n    input.advance();\n    let count = 0;\n    while (input.next == Hash) { count++; input.advance(); }\n    if (input.next != Quote) return\n    input.advance();\n    content: for (;;) {\n      if (input.next < 0) return\n      let isQuote = input.next == Quote;\n      input.advance();\n      if (isQuote) {\n        for (let i = 0; i < count; i++) {\n          if (input.next != Hash) continue content\n          input.advance();\n        }\n        input.acceptToken(RawString);\n        return\n      }\n    }\n  }\n});\n\nconst closureParam = new ExternalTokenizer(input => {\n  if (input.next == Pipe) input.acceptToken(closureParamDelim, 1);\n});\n\nconst tpDelim = new ExternalTokenizer(input => {\n  if (input.next == LessThan) input.acceptToken(tpOpen, 1);\n  else if (input.next == GreaterThan) input.acceptToken(tpClose, 1);\n});\n\nconst rustHighlighting = styleTags({\n  \"const macro_rules struct union enum type fn impl trait let static\": tags.definitionKeyword,\n  \"mod use crate\": tags.moduleKeyword,\n  \"pub unsafe async mut extern default move\": tags.modifier,\n  \"for if else loop while match continue break return await\": tags.controlKeyword,\n  \"as in ref\": tags.operatorKeyword,\n  \"where _ crate super dyn\": tags.keyword,\n  \"self\": tags.self,\n  String: tags.string,\n  Char: tags.character,\n  RawString: tags.special(tags.string),\n  Boolean: tags.bool,\n  Identifier: tags.variableName,\n  \"CallExpression/Identifier\": tags.function(tags.variableName),\n  BoundIdentifier: tags.definition(tags.variableName),\n  \"FunctionItem/BoundIdentifier\": tags.function(tags.definition(tags.variableName)),\n  LoopLabel: tags.labelName,\n  FieldIdentifier: tags.propertyName,\n  \"CallExpression/FieldExpression/FieldIdentifier\": tags.function(tags.propertyName),\n  Lifetime: tags.special(tags.variableName),\n  ScopeIdentifier: tags.namespace,\n  TypeIdentifier: tags.typeName,\n  \"MacroInvocation/Identifier MacroInvocation/ScopedIdentifier/Identifier\": tags.macroName,\n  \"MacroInvocation/TypeIdentifier MacroInvocation/ScopedIdentifier/TypeIdentifier\": tags.macroName,\n  \"\\\"!\\\"\": tags.macroName,\n  UpdateOp: tags.updateOperator,\n  LineComment: tags.lineComment,\n  BlockComment: tags.blockComment,\n  Integer: tags.integer,\n  Float: tags.float,\n  ArithOp: tags.arithmeticOperator,\n  LogicOp: tags.logicOperator,\n  BitOp: tags.bitwiseOperator,\n  CompareOp: tags.compareOperator,\n  \"=\": tags.definitionOperator,\n  \".. ... => ->\": tags.punctuation,\n  \"( )\": tags.paren,\n  \"[ ]\": tags.squareBracket,\n  \"{ }\": tags.brace,\n  \". DerefOp\": tags.derefOperator,\n  \"&\": tags.operator,\n  \", ; ::\": tags.separator,\n  \"Attribute/...\": tags.meta,\n});\n\n// This file was generated by lezer-generator. You probably shouldn't edit it.\nconst spec_identifier = {__proto__:null,self:28, super:32, crate:34, impl:46, true:72, false:72, pub:88, in:92, const:96, unsafe:104, async:108, move:110, if:114, let:118, ref:142, mut:144, _:198, else:200, match:204, as:248, return:252, await:262, break:270, continue:276, while:312, loop:316, for:320, macro_rules:327, mod:334, extern:342, struct:346, where:364, union:379, enum:382, type:390, default:395, fn:396, trait:412, use:420, static:438, dyn:476};\nconst parser = LRParser.deserialize({\n  version: 14,\n  states: \"$2xQ]Q_OOP$wOWOOO&sQWO'#CnO)WQWO'#I`OOQP'#I`'#I`OOQQ'#Ie'#IeO)hO`O'#C}OOQR'#Ih'#IhO)sQWO'#IuOOQO'#Hk'#HkO)xQWO'#DpOOQR'#Iw'#IwO)xQWO'#DpO*ZQWO'#DpOOQO'#Iv'#IvO,SQWO'#J`O,ZQWO'#EiOOQV'#Hp'#HpO,cQYO'#F{OOQV'#El'#ElOOQV'#Em'#EmOOQV'#En'#EnO.YQ_O'#EkO0_Q_O'#EoO2gQWOOO4QQ_O'#FPO7hQWO'#J`OOQV'#FY'#FYO7{Q_O'#F^O:WQ_O'#FaOOQO'#F`'#F`O=sQ_O'#FcO=}Q_O'#FbO@VQWO'#FgOOQO'#J`'#J`OOQV'#Io'#IoOA]Q_O'#InOEPQWO'#InOOQV'#Fw'#FwOF[QWO'#JuOFcQWO'#F|OOQO'#IO'#IOOGrQWO'#GhOOQV'#Im'#ImOOQV'#Il'#IlOOQV'#Hj'#HjQGyQ_OOOKeQ_O'#DUOKlQYO'#CqOOQP'#I_'#I_OOQV'#Hg'#HgQ]Q_OOOLuQWO'#I`ONsQYO'#DXO!!eQWO'#JuO!!lQWO'#JuO!!vQ_O'#DfO!%]Q_O'#E}O!(sQ_O'#FWO!,ZQWO'#FZO!.^QXO'#FbO!.cQ_O'#EeO!!vQ_O'#FmO!0uQWO'#FoO!0zQWO'#FoO!1PQ^O'#FqO!1WQWO'#JuO!1_QWO'#FtO!1dQWO'#FxO!2WQWO'#JjO!2_QWO'#GOO!2_QWO'#G`O!2_QWO'#GbO!2_QWO'#GsOOQO'#Ju'#JuO!2dQWO'#GhO!2lQYO'#GpO!2_QWO'#GqO!3uQ^O'#GtO!3|QWO'#GuO!4hQWO'#HOP!4sOpO'#CcPOOO)CC})CC}OOOO'#Hi'#HiO!5OO`O,59iOOQV,59i,59iO!5ZQYO,5?aOOQO-E;i-E;iOOQO,5:[,5:[OOQP,59Z,59ZO)xQWO,5:[O)xQWO,5:[O!5oQWO,5?kO!5zQYO,5;qO!6PQYO,5;TO!6hQWO,59QO!7kQXO'#CnO!7xQXO'#I`O!9SQWO'#CoO,^QWO'#EiOOQV-E;n-E;nO!9eQWO'#FsOOQV,5<g,5<gO!9SQWO'#CoO!9jQWO'#CoO!9oQWO'#I`O! yQWO'#JuO!9yQWO'#J`O!:aQWO,5;VOOQO'#In'#InO!0zQWO'#DaO!<aQWO'#DcO!<iQWO,5;ZO.YQ_O,5;ZOOQO,5;[,5;[OOQV'#Er'#ErOOQV'#Es'#EsOOQV'#Et'#EtOOQV'#Eu'#EuOOQV'#Ev'#EvOOQV'#Ew'#EwOOQV'#Ex'#ExOOQV'#Ey'#EyO.YQ_O,5;]O.YQ_O,5;]O.YQ_O,5;]O.YQ_O,5;]O.YQ_O,5;]O.YQ_O,5;]O.YQ_O,5;]O.YQ_O,5;]O.YQ_O,5;]O.YQ_O,5;fO!=PQ_O,5;kO!@gQ_O'#FROOQO,5;l,5;lO!BrQWO,5;pO.YQ_O,5;wOKlQYO,5;gO!D_QWO,5;kO!EOQWO,5;xOOQO,5;x,5;xO!E]QWO,5;xO!EbQ_O,5;xO!GmQWO'#CfO!GrQWO,5<QO!G|Q_O,5<QOOQO,5;{,5;{O!JjQXO'#CnO!K{QXO'#I`OOQS'#Dk'#DkOOQP'#Ir'#IrO!LuQ[O'#IrO!L}QXO'#DjO!M{QWO'#DnO!M{QWO'#DnO!N^QWO'#DnOOQP'#It'#ItO!NcQXO'#ItO# ^Q^O'#DoO# hQWO'#DrO# pQ^O'#DzO# zQ^O'#D|O#!RQWO'#EPO#!^QXO'#FdOOQP'#ES'#ESOOQP'#Iq'#IqO#!lQXO'#JfOOQP'#Je'#JeO#!tQXO,5;}O#!yQXO'#I`O!1PQ^O'#DyO!1PQ^O'#FdO##sQWO,5;|OOQO,5;|,5;|OKlQYO,5;|O#$ZQWO'#FhOOQO,5<R,5<ROOQV,5=l,5=lO#&`QYO'#FzOOQV,5<h,5<hO#&gQWO,5<hO#&nQWO,5=SO!1WQWO,59rO!1dQWO,5<dO#&uQWO,5=iO!2_QWO,5<jO!2_QWO,5<zO!2_QWO,5<|O!2_QWO,5=QO#&|QWO,5=]O#'TQWO,5=SO!2_QWO,5=]O!3|QWO,5=aO#']QWO,5=jOOQO-E;|-E;|O#'hQWO'#JjOOQV-E;h-E;hO#(PQWO'#HRO#(WQ_O,59pOOQV,59p,59pO#(_QWO,59pO#(dQ_O,59pO#)SQZO'#CuO#+[QZO'#CvOOQV'#C|'#C|O#-wQWO'#HTO#.OQYO'#IdOOQO'#Hh'#HhO#.WQWO'#CwO#.WQWO'#CwO#.iQWO'#CwOOQR'#Ic'#IcO#.nQZO'#IbO#1TQYO'#HTO#1qQYO'#H[O#2}QYO'#H_OKlQYO'#H`OOQR'#Hb'#HbO#4ZQWO'#HeO#4`QYO,59]OOQR'#Ib'#IbO#5PQZO'#CtO#7[QYO'#HUO#7aQWO'#HTO#7fQYO'#CrO#8VQWO'#H]O#7fQYO'#HcOOQV-E;e-E;eO#8_QWO,59sOOQV,59{,59{O#8mQYO,5=[OOQV,59},59}O!0zQWO,59}O#;aQWO'#IpOOQO'#Ip'#IpO!1PQ^O'#DhO!0zQWO,5:QO#;hQWO,5;iO#<OQWO,5;rO#<fQ_O,5;rOOQO,5;u,5;uO#@PQ_O,5;|O#BXQWO,5;PO!0zQWO,5<XO#B`QWO,5<ZOOQV,5<Z,5<ZO#BkQWO,5<]O!1PQ^O'#EOOOQQ'#D_'#D_O#BsQWO,59rO#BxQWO,5<`O#B}QWO,5<dOOQO,5@U,5@UO#CVQWO,5=iOOQQ'#Cv'#CvO#C[QYO,5<jO#CmQYO,5<zO#CxQYO,5<|O#DTQYO,5=_O#DcQYO,5=SO#E{QYO'#GQO#FYQYO,5=[O#FmQWO,5=[O#F{QYO,5=[O#HUQYO,5=]O#HdQWO,5=`O!1PQ^O,5=`O#HrQWO'#CnO#ITQWO'#I`OOQO'#Jy'#JyO#IfQWO'#IQO#IkQWO'#GwOOQO'#Jz'#JzO#JSQWO'#GzOOQO'#G|'#G|OOQO'#Jx'#JxO#IkQWO'#GwO#JZQWO'#GxO#J`QWO,5=aO#JeQWO,5=jO!1dQWO,5=jO#'`QWO,5=jPOOO'#Hf'#HfP#JjOpO,58}POOO,58},58}OOOO-E;g-E;gOOQV1G/T1G/TO#JuQWO1G4{O#JzQ^O'#CyPOQQ'#Cx'#CxOOQO1G/v1G/vOOQP1G.u1G.uO)xQWO1G/vO#NTQ!fO'#ETO#N[Q!fO'#EaO#NcQ!fO'#EbO$ kQWO1G1yO$!_Q_O1G1yOOQP1G5V1G5VOOQO1G1]1G1]O$&RQWO1G0oO$&WQWO'#CiO!7xQXO'#I`O!6PQYO1G.lO!5oQWO,5<_O!9SQWO,59ZO!9SQWO,59ZO!5oQWO,5?kO$&iQWO1G0uO$(vQWO1G0wO$*nQWO1G0wO$+UQWO1G0wO$-YQWO1G0wO$-aQWO1G0wO$/bQWO1G0wO$/iQWO1G0wO$1jQWO1G0wO$1qQWO1G0wO$3YQWO1G1QO$5ZQWO1G1VO$5zQ_O'#JcO$8SQWO'#JcOOQO'#Jb'#JbO$8^QWO,5;mOOQO'#Dw'#DwOOQO1G1[1G1[OOQO1G1Y1G1YO$8cQWO1G1cOOQO1G1R1G1RO$8jQ_O'#HrO$:xQWO,5@OO.YQ_O1G1dOOQO1G1d1G1dO$;QQWO1G1dO$;_QWO1G1dO$;dQWO1G1eOOQO1G1l1G1lO$;lQWO1G1lOOQP,5?^,5?^O$;vQ^O,5:kO$<aQXO,5:YO!M{QWO,5:YO!M{QWO,5:YO!1PQ^O,5:gO$=bQWO'#IyOOQO'#Ix'#IxO$=pQWO,5:ZO# ^Q^O,5:ZO$=uQWO'#DsOOQP,5:^,5:^O$>WQWO,5:fOOQP,5:h,5:hO!1PQ^O,5:hO!1PQ^O,5:mO$>]QYO,5<OO$>gQ_O'#HsO$>tQXO,5@QOOQV1G1i1G1iOOQP,5:e,5:eO$>|QXO,5<OO$?[QWO1G1hO$?dQWO'#CnO$?oQWO'#FiOOQO'#Fi'#FiO$?wQWO'#FjO.YQ_O'#FkOOQO'#Ji'#JiO$?|QWO'#JhOOQO'#Jg'#JgO$@UQWO,5<SOOQQ'#Hv'#HvO$@ZQYO,5<fOOQV,5<f,5<fO$@bQYO,5<fOOQV1G2S1G2SO$@iQWO1G2nO$@qQWO1G/^O$@vQWO1G2OO#CVQWO1G3TO$AOQYO1G2UO#CmQYO1G2fO#CxQYO1G2hO$AaQYO1G2lO!2_QWO1G2wO#DcQYO1G2nO#HUQYO1G2wO$AiQWO1G2{O$AnQWO1G3UO!1dQWO1G3UO$AsQWO1G3UOOQV1G/[1G/[O$A{QWO1G/[O$BQQ_O1G/[O#7aQWO,5=oO$BXQYO,5?OO$BmQWO,5?OO$BrQZO'#IeOOQO-E;f-E;fOOQR,59c,59cO#.WQWO,59cO#.WQWO,59cOOQR,5=n,5=nO$E_QYO'#HVO$FwQZO,5=oO!5oQWO,5={O$IZQWO,5=oO$IbQZO,5=vO$KqQYO,5=vO$>]QYO,5=vO$LRQWO'#KRO$L^QWO,5=xOOQR,5=y,5=yO$LcQWO,5=zO$>]QYO,5>PO$>]QYO,5>POOQO1G.w1G.wO$>]QYO1G.wO$LnQYO,5=pO$LvQZO,59^OOQR,59^,59^O$>]QYO,5=wO% YQZO,5=}OOQR,5=},5=}O%#lQWO1G/_O!6PQYO1G/_O#FYQYO1G2vO%#qQWO1G2vO%$PQYO1G2vOOQV1G/i1G/iO%%YQWO,5:SO%%bQ_O1G/lO%*kQWO1G1^O%+RQWO1G1hOOQO1G1h1G1hO$>]QYO1G1hO%+iQ^O'#EgOOQV1G0k1G0kOOQV1G1s1G1sO!!vQ_O1G1sO!0zQWO1G1uO!1PQ^O1G1wO!.cQ_O1G1wOOQP,5:j,5:jO$>]QYO1G/^OOQO'#Cn'#CnO%+vQWO1G1zOOQV1G2O1G2OO%,OQWO'#CnO%,WQWO1G3TO%,]QWO1G3TO%,bQYO'#GQO%,sQWO'#G]O%-UQYO'#G_O%.hQYO'#GXOOQV1G2U1G2UO%/wQWO1G2UO%/|QWO1G2UO$ARQWO1G2UOOQV1G2f1G2fO%/wQWO1G2fO#CpQWO1G2fO%0UQWO'#GdOOQV1G2h1G2hO%0gQWO1G2hO#C{QWO1G2hO%0lQYO'#GSO$>]QYO1G2lO$AdQWO1G2lOOQV1G2y1G2yO%1xQWO1G2yO%3hQ^O'#GkO%3rQWO1G2nO#DfQWO1G2nO%4QQYO,5<lO%4[QYO,5<lO%4jQYO,5<lO%5XQYO,5<lOOQQ,5<l,5<lO!1WQWO'#JuO%5dQYO,5<lO%5lQWO1G2vOOQV1G2v1G2vO%5tQWO1G2vO$>]QYO1G2vOOQV1G2w1G2wO%5tQWO1G2wO%5yQWO1G2wO#HXQWO1G2wOOQV1G2z1G2zO.YQ_O1G2zO$>]QYO1G2zO%6RQWO1G2zOOQO,5>l,5>lOOQO-E<O-E<OOOQO,5=c,5=cOOQO,5=e,5=eOOQO,5=g,5=gOOQO,5=h,5=hO%6aQWO'#J|OOQO'#J{'#J{O%6iQWO,5=fO%6nQWO,5=cO!1dQWO,5=dOOQV1G2{1G2{O$>]QYO1G3UPOOO-E;d-E;dPOOO1G.i1G.iOOQO7+*g7+*gO%7VQYO'#IcO%7nQYO'#IfO%7yQYO'#IfO%8RQYO'#IfO%8^QYO,59eOOQO7+%b7+%bOOQP7+$a7+$aO%8cQ!fO'#JTOOQS'#EX'#EXOOQS'#EY'#EYOOQS'#EZ'#EZOOQS'#JT'#JTO%;UQWO'#EWOOQS'#E`'#E`OOQS'#JR'#JROOQS'#Hn'#HnO%;ZQ!fO,5:oOOQV,5:o,5:oOOQV'#JQ'#JQO%;bQ!fO,5:{OOQV,5:{,5:{O%;iQ!fO,5:|OOQV,5:|,5:|OOQV7+'e7+'eOOQV7+&Z7+&ZO%;pQ!fO,59TOOQO,59T,59TO%>YQWO7+$WO%>_QWO1G1yOOQV1G1y1G1yO!9SQWO1G.uO%>dQWO,5?}O%>nQ_O'#HqO%@|QWO,5?}OOQO1G1X1G1XOOQO7+&}7+&}O%AUQWO,5>^OOQO-E;p-E;pO%AcQWO7+'OO.YQ_O7+'OOOQO7+'O7+'OOOQO7+'P7+'PO%AjQWO7+'POOQO7+'W7+'WOOQP1G0V1G0VO%ArQXO1G/tO!M{QWO1G/tO%BsQXO1G0RO%CkQ^O'#HlO%C{QWO,5?eOOQP1G/u1G/uO%DWQWO1G/uO%D]QWO'#D_OOQO'#Dt'#DtO%DhQWO'#DtO%DmQWO'#I{OOQO'#Iz'#IzO%DuQWO,5:_O%DzQWO'#DtO%EPQWO'#DtOOQP1G0Q1G0QOOQP1G0S1G0SOOQP1G0X1G0XO%EXQXO1G1jO%EdQXO'#FeOOQP,5>_,5>_O!1PQ^O'#FeOOQP-E;q-E;qO$>]QYO1G1jOOQO7+'S7+'SOOQO,5<T,5<TO%ErQWO,5<UO.YQ_O,5<UO%EwQWO,5<VO%FRQWO'#HtO%FdQWO,5@SOOQO1G1n1G1nOOQQ-E;t-E;tOOQV1G2Q1G2QO%FlQYO1G2QO#DcQYO7+(YO$>]QYO7+$xOOQV7+'j7+'jO%FsQWO7+(oO%FxQWO7+(oOOQV7+'p7+'pO%/wQWO7+'pO%F}QWO7+'pO%GVQWO7+'pOOQV7+(Q7+(QO%/wQWO7+(QO#CpQWO7+(QOOQV7+(S7+(SO%0gQWO7+(SO#C{QWO7+(SO$>]QYO7+(WO%GeQWO7+(WO#HUQYO7+(cO%GjQWO7+(YO#DfQWO7+(YOOQV7+(c7+(cO%5tQWO7+(cO%5yQWO7+(cO#HXQWO7+(cOOQV7+(g7+(gO$>]QYO7+(pO%GxQWO7+(pO!1dQWO7+(pOOQV7+$v7+$vO%G}QWO7+$vO%HSQZO1G3ZO%JfQWO1G4jOOQO1G4j1G4jOOQR1G.}1G.}O#.WQWO1G.}O%JkQWO'#KQOOQO'#HW'#HWO%J|QWO'#HXO%KXQWO'#KQOOQO'#KP'#KPO%KaQWO,5=qO%KfQYO'#H[O%LrQWO'#GmO%L}QYO'#CtO%MXQWO'#GmO$>]QYO1G3ZOOQR1G3g1G3gO#7aQWO1G3ZO%M^QZO1G3bO$>]QYO1G3bO& mQYO'#IVO& }QWO,5@mOOQR1G3d1G3dOOQR1G3f1G3fO.YQ_O1G3fOOQR1G3k1G3kO&!VQYO7+$cO&!_QYO'#KOOOQQ'#J}'#J}O&!gQYO1G3[O&!lQZO1G3cOOQQ7+$y7+$yO&${QWO7+$yO&%QQWO7+(bOOQV7+(b7+(bO%5tQWO7+(bO$>]QYO7+(bO#FYQYO7+(bO&%YQWO7+(bO!.cQ_O1G/nO&%hQWO7+%WO$?[QWO7+'SO&%pQWO'#EhO&%{Q^O'#EhOOQU'#Ho'#HoO&%{Q^O,5;ROOQV,5;R,5;RO&&VQWO,5;RO&&[Q^O,5;RO!0zQWO7+'_OOQV7+'a7+'aO&&iQWO7+'cO&&qQWO7+'cO&&xQWO7+$xO&'TQ!fO7+'fO&'[Q!fO7+'fOOQV7+(o7+(oO!1dQWO7+(oO&'cQYO,5<lO&'nQYO,5<lO!1dQWO'#GWO&'|QWO'#JpO&([QWO'#G^O!BxQWO'#G^O&(aQWO'#JpOOQO'#Jo'#JoO&(iQWO,5<wOOQO'#DX'#DXO&(nQYO'#JrO&)}QWO'#JrO$>]QYO'#JrOOQO'#Jq'#JqO&*YQWO,5<yO&*_QWO'#GZO#D^QWO'#G[O&*gQWO'#G[O&*oQWO'#JmOOQO'#Jl'#JlO&*zQYO'#GTOOQO,5<s,5<sO&+PQWO7+'pO&+UQWO'#JtO&+dQWO'#GeO#BxQWO'#GeO&+uQWO'#JtOOQO'#Js'#JsO&+}QWO,5=OO$>]QYO'#GUO&,SQYO'#JkOOQQ,5<n,5<nO&,kQWO7+(WOOQV7+(e7+(eO&.TQ^O'#D|O&._QWO'#GlO&.gQ^O'#JwOOQO'#Gn'#GnO&.nQWO'#JwOOQO'#Jv'#JvO&.vQWO,5=VO&.{QWO'#I`O&/]Q^O'#GmO&/dQWO'#IqO&/rQWO'#GmOOQV7+(Y7+(YO&/zQWO7+(YO$>]QYO7+(YO&0SQYO'#HxO&0hQYO1G2WOOQQ1G2W1G2WOOQQ,5<m,5<mO$>]QYO,5<qO&0pQWO,5<rO&0uQWO7+(bO&1QQWO7+(fO&1XQWO7+(fOOQV7+(f7+(fO.YQ_O7+(fO$>]QYO7+(fO&1dQWO'#IRO&1nQWO,5@hOOQO1G3Q1G3QOOQO1G2}1G2}OOQO1G3P1G3POOQO1G3R1G3ROOQO1G3S1G3SOOQO1G3O1G3OO&1vQWO7+(pO$>]QYO,59fO&2RQ^O'#ISO&2xQYO,5?QOOQR1G/P1G/PO&3QQ!bO,5:pO&3VQ!fO,5:rOOQS-E;l-E;lOOQV1G0Z1G0ZOOQV1G0g1G0gOOQV1G0h1G0hO&3^QWO'#JTOOQO1G.o1G.oOOQV<<Gr<<GrO&3iQWO1G5iO$5zQ_O,5>]O&3qQWO,5>]OOQO-E;o-E;oOOQO<<Jj<<JjO&3{QWO<<JjOOQO<<Jk<<JkO&4SQXO7+%`O&5TQWO,5>WOOQO-E;j-E;jOOQP7+%a7+%aO!1PQ^O,5:`O&5cQWO'#HmO&5wQWO,5?gOOQP1G/y1G/yOOQO,5:`,5:`O&6PQWO,5:`O%DzQWO,5:`O$>]QYO,5<PO&6UQXO,5<PO&6dQXO7+'UO.YQ_O1G1pO&6oQWO1G1pOOQO,5>`,5>`OOQO-E;r-E;rOOQV7+'l7+'lO&6yQWO<<KtO#DfQWO<<KtO&7XQWO<<HdOOQV<<LZ<<LZO!1dQWO<<LZOOQV<<K[<<K[O&7dQWO<<K[O%/wQWO<<K[O&7iQWO<<K[OOQV<<Kl<<KlO%/wQWO<<KlOOQV<<Kn<<KnO%0gQWO<<KnO&7qQWO<<KrO$>]QYO<<KrOOQV<<K}<<K}O%5tQWO<<K}O%5yQWO<<K}O#HXQWO<<K}OOQV<<Kt<<KtO&7yQWO<<KtO$>]QYO<<KtO&8RQWO<<L[O$>]QYO<<L[O&8^QWO<<L[OOQV<<Hb<<HbO$>]QYO7+(uOOQO7+*U7+*UOOQR7+$i7+$iO&8cQWO,5@lOOQO'#Gm'#GmO&8kQWO'#GmO&8vQYO'#IUO&8cQWO,5@lOOQR1G3]1G3]O&:cQYO,5=vO&;rQYO,5=XO&;|QWO,5=XOOQO,5=X,5=XOOQR7+(u7+(uO&<RQZO7+(uO&>eQZO7+(|O&@tQWO,5>qOOQO-E<T-E<TO&APQWO7+)QOOQO<<G}<<G}O&AWQYO'#ITO&AcQYO,5@jOOQQ7+(v7+(vOOQQ<<He<<HeO$>]QYO<<K|OOQV<<K|<<K|O&0uQWO<<K|O&AkQWO<<K|O%5tQWO<<K|O&AsQWO7+%YOOQV<<Hr<<HrOOQO<<Jn<<JnO.YQ_O,5;SO&AzQWO,5;SO.YQ_O'#EjO&BPQWO,5;SOOQU-E;m-E;mO&B[QWO1G0mOOQV1G0m1G0mO&%{Q^O1G0mOOQV<<Jy<<JyO!.cQ_O<<J}OOQV<<J}<<J}OOQV<<Hd<<HdO.YQ_O<<HdO&BaQWO'#FvO&BfQWO<<KQO&BnQ!fO<<KQO&BuQWO<<KQO&BzQWO<<KQO&CSQ!fO<<KQOOQV<<KQ<<KQO&CZQWO<<LZO&C`QWO,5@[O$>]QYO,5<xO&ChQWO,5<xO&CmQWO'#H{O&C`QWO,5@[OOQV1G2c1G2cO&DRQWO,5@^O$>]QYO,5@^O&D^QYO'#H|O&EsQWO,5@^OOQO1G2e1G2eO%,nQWO,5<uOOQO,5<v,5<vO&E{QYO'#HzO&G_QWO,5@XO%,bQYO,5=pO$>]QYO,5<oO&GjQWO,5@`O.YQ_O,5=PO&GrQWO,5=PO&G}QWO,5=PO&H`QWO'#H}O&GjQWO,5@`OOQV1G2j1G2jO&HtQYO,5<pO%0lQYO,5>PO&I]QYO,5@VOOQV<<Kr<<KrO&ItQWO,5=XO&KfQ^O,5:hO&KmQWO,5=XO$>]QYO,5=WO&KuQWO,5@cO&K}QWO,5@cO&MvQ^O'#IPO&KuQWO,5@cOOQO1G2q1G2qO&NTQWO,5=WO&N]QWO<<KtO&NkQYO,5>oO&NvQYO,5>dO' UQYO,5>dOOQQ,5>d,5>dOOQQ-E;v-E;vOOQQ7+'r7+'rO' aQYO1G2]O$>]QYO1G2^OOQV<<LQ<<LQO.YQ_O<<LQO' lQWO<<LQO' sQWO<<LQOOQO,5>m,5>mOOQO-E<P-E<POOQV<<L[<<L[O.YQ_O<<L[O'!OQYO1G/QO'!ZQYO,5>nOOQQ,5>n,5>nO'!fQYO,5>nOOQQ-E<Q-E<QOOQS1G0[1G0[O'$tQ!fO1G0^O'%RQ!fO1G0^O'%YQWO1G3wOOQOAN@UAN@UO'%dQWO1G/zOOQO,5>X,5>XOOQO-E;k-E;kO!1PQ^O1G/zOOQO1G/z1G/zO'%oQWO1G/zO'%tQXO1G1kO$>]QYO1G1kO'&PQWO7+'[OOQVANA`ANA`O'&ZQWOANA`O$>]QYOANA`O'&cQWOANA`OOQVAN>OAN>OO.YQ_OAN>OO'&qQWOANAuOOQVAN@vAN@vO'&vQWOAN@vOOQVANAWANAWOOQVANAYANAYOOQVANA^ANA^O'&{QWOANA^OOQVANAiANAiO%5tQWOANAiO%5yQWOANAiO''TQWOANA`OOQVANAvANAvO.YQ_OANAvO''cQWOANAvO$>]QYOANAvOOQR<<La<<LaO''nQWO1G6WO%JkQWO,5>pOOQO'#HY'#HYO''vQWO'#HZOOQO,5>p,5>pOOQO-E<S-E<SO'(RQYO1G2sO'(]QWO1G2sOOQO1G2s1G2sO$>]QYO<<LaOOQR<<Ll<<LlOOQQ,5>o,5>oOOQQ-E<R-E<RO&0uQWOANAhOOQVANAhANAhO%5tQWOANAhO$>]QYOANAhO'(bQWO1G1rO')UQ^O1G0nO.YQ_O1G0nO'*zQWO,5;UO'+RQWO1G0nP'+WQWO'#ERP&%{Q^O'#HpOOQV7+&X7+&XO'+cQWO7+&XO&&qQWOAN@iO'+hQWOAN>OO!5oQWO,5<bOOQS,5>a,5>aO'+oQWOAN@lO'+tQWOAN@lOOQS-E;s-E;sOOQVAN@lAN@lO'+|QWOAN@lOOQVANAuANAuO',UQWO1G5vO',^QWO1G2dO$>]QYO1G2dO&'|QWO,5>gOOQO,5>g,5>gOOQO-E;y-E;yO',iQWO1G5xO',qQWO1G5xO&(nQYO,5>hO',|QWO,5>hO$>]QYO,5>hOOQO-E;z-E;zO'-XQWO'#JnOOQO1G2a1G2aOOQO,5>f,5>fOOQO-E;x-E;xO&'cQYO,5<lO'-gQYO1G2ZO'.RQWO1G5zO'.ZQWO1G2kO.YQ_O1G2kO'.eQWO1G2kO&+UQWO,5>iOOQO,5>i,5>iOOQO-E;{-E;{OOQQ,5>c,5>cOOQQ-E;u-E;uO'.pQWO1G2sO'/QQWO1G2rO'/]QWO1G5}O'/eQ^O,5>kOOQO'#Go'#GoOOQO,5>k,5>kO'/lQWO,5>kOOQO-E;}-E;}O$>]QYO1G2rO'/zQYO7+'xO'0VQWOANAlOOQVANAlANAlO.YQ_OANAlO'0^QWOANAvOOQS7+%x7+%xO'0eQWO7+%xO'0pQ!fO7+%xO'0}QWO7+%fO!1PQ^O7+%fO'1YQXO7+'VOOQVG26zG26zO'1eQWOG26zO'1sQWOG26zO$>]QYOG26zO'1{QWOG23jOOQVG27aG27aOOQVG26bG26bOOQVG26xG26xOOQVG27TG27TO%5tQWOG27TO'2SQWOG27bOOQVG27bG27bO.YQ_OG27bO'2ZQWOG27bOOQO1G4[1G4[OOQO7+(_7+(_OOQRANA{ANA{OOQVG27SG27SO%5tQWOG27SO&0uQWOG27SO'2fQ^O7+&YO'4PQWO7+'^O'4sQ^O7+&YO.YQ_O7+&YP.YQ_O,5;SP'6PQWO,5;SP'6UQWO,5;SOOQV<<Is<<IsOOQVG26TG26TOOQVG23jG23jOOQO1G1|1G1|OOQVG26WG26WO'6aQWOG26WP&B}QWO'#HuO'6fQWO7+(OOOQO1G4R1G4RO'6qQWO7++dO'6yQWO1G4SO$>]QYO1G4SO%,nQWO'#HyO'7UQWO,5@YO'7dQWO7+(VO.YQ_O7+(VOOQO1G4T1G4TOOQO1G4V1G4VO'7nQWO1G4VO'7|QWO7+(^OOQVG27WG27WO'8XQWOG27WOOQS<<Id<<IdO'8`QWO<<IdO'8kQWO<<IQOOQVLD,fLD,fO'8vQWOLD,fO'9OQWOLD,fOOQVLD)ULD)UOOQVLD,oLD,oOOQVLD,|LD,|O'9^QWOLD,|O.YQ_OLD,|OOQVLD,nLD,nO%5tQWOLD,nO'9eQ^O<<ItO';OQWO<<JxO';rQ^O<<ItP'=OQWO1G0nP'=oQ^O1G0nP.YQ_O1G0nP'?bQWO1G0nOOQVLD+rLD+rO'?gQWO7+)nOOQO,5>e,5>eOOQO-E;w-E;wO'?rQWO<<KqOOQVLD,rLD,rOOQSAN?OAN?OOOQV!$(!Q!$(!QO'?|QWO!$(!QOOQV!$(!h!$(!hO'@UQWO!$(!hOOQV!$(!Y!$(!YO'@]Q^OAN?`POQU7+&Y7+&YP'AvQWO7+&YP'BgQ^O7+&YP.YQ_O7+&YOOQV!)9El!)9ElOOQV!)9FS!)9FSPOQU<<It<<ItP'DYQWO<<ItP'DyQ^O<<ItPOQUAN?`AN?`O'FlQWO'#CnO'FsQXO'#CnO'GlQWO'#I`O'IRQXO'#I`O'IxQWO'#DpO'IxQWO'#DpO!.cQ_O'#EkO'JZQ_O'#EoO'JbQ_O'#FPO'MfQ_O'#FbO'MmQXO'#I`O'NdQ_O'#E}O( gQ_O'#FWO'IxQWO,5:[O'IxQWO,5:[O!.cQ_O,5;ZO!.cQ_O,5;]O!.cQ_O,5;]O!.cQ_O,5;]O!.cQ_O,5;]O!.cQ_O,5;]O!.cQ_O,5;]O!.cQ_O,5;]O!.cQ_O,5;]O!.cQ_O,5;]O!.cQ_O,5;fO(!jQ_O,5;kO(%nQWO,5;kO(&OQWO,5;|O(&VQYO'#CuO(&bQYO'#CvO(&mQWO'#CwO(&mQWO'#CwO('OQYO'#CtO('ZQWO,5;iO('bQWO,5;rO('iQ_O,5;rO((oQ_O,5;|O'IxQWO1G/vO((vQWO1G0uO(*eQWO1G0wO(*oQWO1G0wO(,dQWO1G0wO(,kQWO1G0wO(.]QWO1G0wO(.dQWO1G0wO(0UQWO1G0wO(0]QWO1G0wO(0dQWO1G1QO(0tQWO1G1VO(1UQYO'#IeO(&mQWO,59cO(&mQWO,59cO(1aQWO1G1^O(1hQWO1G1hO(&mQWO1G.}O(1oQWO'#DpO!.^QXO'#FbO(1tQWO,5;ZO(1{QWO'#Cw\",\n  stateData: \"(2_~O&|OSUOS&}PQ~OPoOQ!QOSVOTVOZeO[lO^RO_RO`ROa!UOd[Og!nOsVOtVOuVOw!POyvO|!VO}mO!Q!dO!U!WO!W!XO!X!^O!Z!YO!]!pO!liO!qgO!tiO#Y!_O#r!ZO#{![O$O!]O$b!`O$d!bO$f!cO$i!eO$m!fO$q!gO$s!hO%T!iO%V!jO%Z!kO%]!lO%^!mO%f!oO%j!qO%s!rO'Q`O'TQO'ZkO'^UO'gcO'qiO(QdO~O&}!sO~OZbX[bXdbXdlXobXwjX}bX!lbX!qbX!tbX#ObX#PbX#pbX'gbX'qbX'rbX'xbX'ybX'zbX'{bX'|bX'}bX(ObX(PbX(QbX(RbX(TbX~OybXXbX!ebX!PbXvbX#RbX~P$|OZ'SX['SXd'SXd'XXo'SXw'kXy'SX}'SX!l'SX!q'SX!t'SX#O'SX#P'SX#p'SX'g'SX'q'SX'r'SX'x'SX'y'SX'z'SX'{'SX'|'SX'}'SX(O'SX(P'SX(Q'SX(R'SX(T'SXv'SX~OX'SX!e'SX!P'SX#R'SX~P'ZOr!uO']!wO'_!uO~Od!xO~O^RO_RO`ROaRO'TQO~Od!}O~Od#PO[(SXo(SXy(SX}(SX!l(SX!q(SX!t(SX#O(SX#P(SX#p(SX'g(SX'q(SX'r(SX'x(SX'y(SX'z(SX'{(SX'|(SX'}(SX(O(SX(P(SX(Q(SX(R(SX(T(SXv(SX~OZ#OO~P*`OZ#RO[#QO~OQ!QO^#TO_#TO`#TOa#]Od#ZOg!nOyvO|!VO!Q!dO!U#^O!W!lO!]!pO$i!eO$m!fO$q!gO$s!hO%T!iO%V!jO%Z!kO%]!lO%^!mO%f!oO%j!qO%s!rO'Q#VO'T#SO~OPoOQ!QOSVOTVOZeO[lOd[OsVOtVOuVOw!PO}mO!U#bO!W#cO!X!^O!Z!YO!liO!qgO!tiO#Y!_O#r!ZO#{![O$O!]O$b!`O$d!bO$f!cO'ZkO'^UO'gcO'qiO(QdO~P)xOPoOQ!QOSVOTVOZeO[lOd[OsVOtVOuVOw!PO}mO!U#bO!W#cO!X!^O!Z!YO!j#eO!liO!qgO!tiO#Y!_O#r!ZO#{![O$O!]O$b!`O$d!bO$f!cO'ZkO'^UO'gcO'qiO(QdO~P)xO[#}Oo#xO}#zO!l#yO!q#jO!t#yO#O#xO#P#uO#p$OO'g#gO'q#yO'r#lO'x#hO'y#iO'z#iO'{#kO'|#nO'}#mO(O#|O(P#gO(Q#hO(R#fO(T#hO~OPoOQ!QOSVOTVOZeOd[OsVOtVOuVOw!PO!U#bO!W#cO!X!^O!Z!YO#Y!_O#r!ZO#{![O$O!]O$b!`O$d!bO$f!cO'ZkO'^UO[#sXo#sXy#sX}#sX!l#sX!q#sX!t#sX#O#sX#P#sX#p#sX'g#sX'q#sX'r#sX'x#sX'y#sX'z#sX'{#sX'|#sX'}#sX(O#sX(P#sX(Q#sX(R#sX(T#sXX#sX!e#sX!P#sXv#sX#R#sX~P)xOX(SX!e(SX!P(SXw(SX#R(SX~P*`OPoOQ!QOSVOTVOX$ROZeO[lOd[OsVOtVOuVOw!PO}mO!U#bO!W#cO!X!^O!Z!YO!liO!qgO!tiO#Y!_O#r!ZO#{![O$O!]O$b!`O$d!bO$f!cO'Q$UO'ZkO'^UO'gcO'qiO(QdO~P)xOPoOQ!QOSVOTVOZeO[lOd[OsVOtVOuVOw!PO}mO!P$XO!U#bO!W#cO!X!^O!Z!YO!liO!qgO!tiO#Y!_O#r!ZO#{![O$O!]O$b!`O$d!bO$f!cO'Q$UO'ZkO'^UO'gcO'qiO(QdO~P)xOQ!QOSVOTVO[$gO^$pO_$ZO`9yOa9yOd$aOsVOtVOuVO}$eO!i$qO!l$lO!q$hO#V$lO'T$YO'^UO'g$[O~O!j$rOP(XP~P<cOPoOQ!QOSVOTVOZeO[lOd[OsVOtVOuVOw!PO}mO!U#bO!W#cO!X!^O!Z!YO!liO!qgO!tiO#Q$uO#Y!_O#r!ZO#{![O$O!]O$b!`O$d!bO$f!cO'ZkO'^UO'gcO'qiO(QdO~P)xOw$vO~Oo'bX#O'bX#P'bX#p'bX'r'bX'x'bX'y'bX'z'bX'{'bX'|'bX'}'bX(O'bX(P'bX(R'bX(T'bX~OP%tXQ%tXS%tXT%tXZ%tX[%tX^%tX_%tX`%tXa%tXd%tXg%tXs%tXt%tXu%tXw%tXy%tX|%tX}%tX!Q%tX!U%tX!W%tX!X%tX!Z%tX!]%tX!l%tX!q%tX!t%tX#Y%tX#r%tX#{%tX$O%tX$b%tX$d%tX$f%tX$i%tX$m%tX$q%tX$s%tX%T%tX%V%tX%Z%tX%]%tX%^%tX%f%tX%j%tX%s%tX&z%tX'Q%tX'T%tX'Z%tX'^%tX'g%tX'q%tX(Q%tXv%tX~P@[Oy$xO['bX}'bX!l'bX!q'bX!t'bX'g'bX'q'bX(Q'bXv'bX~P@[Ow$yO!Q(iX!U(iX!W(iX$q(iX%](iX%^(iX~Oy$zO~PEsO!Q$}O!U%UO!W!lO$m%OO$q%PO$s%QO%T%RO%V%SO%Z%TO%]!lO%^%VO%f%WO%j%XO%s%YO~O!Q!lO!U!lO!W!lO$q%[O%]!lO~O%^%VO~PGaOPoOQ!QOSVOTVOZeO[lO^RO_RO`ROa!UOd[Og!nOsVOtVOuVOw!POyvO|!VO}mO!Q!dO!U!WO!W!XO!X!^O!Z!YO!]!pO!liO!qgO!tiO#Y!_O#r!ZO#{![O$O!]O$b!`O$d!bO$f!cO$i!eO$m!fO$q!gO$s!hO%T!iO%V!jO%Z!kO%]!lO%^!mO%f!oO%j!qO%s!rO'Q#VO'TQO'ZkO'^UO'gcO'qiO(QdO~Ov%`O~P]OQ!QOZ%rO[%qO^%vO_%cO`TOaTOd%jOg%yO}%pO!q%oO$f%wO%^%xO&W%{O'T%dO'Z%eO(Q%zO~PGaO!Q{X!U{X!W{X$m{X$q{X$s{X%T{X%V{X%Z{X%]{X%^{X%f{X%j{X%s{X~P'ZO!Q{X!U{X!W{X$m{X$q{X$s{X%T{X%V{X%Z{X%]{X%^{X%f{X%j{X%s{X~O}%}O'T{XQ{XZ{X[{X^{X_{X`{Xa{Xd{Xg{X!q{X$f{X&W{X'Z{X(Q{X~PMuOg&PO%f%WO!Q(iX!U(iX!W(iX$q(iX%](iX%^(iX~Ow!PO~P! yOw!PO!X&RO~PEvOPoOQ!QOSVOTVOZeO[lO^9qO_9qO`9qOa9qOd9tOsVOtVOuVOw!PO}mO!U#bO!W#cO!X:zO!Z!YO!]&UO!l9wO!q9vO!t9wO#Y!_O#r9zO#{9{O$O!]O$b!`O$d!bO$f!cO'T9oO'ZkO'^UO'gcO'q9wO(QdO~OPoOQ!QOSVOTVOZeO[lOd[OsVOtVOuVOw!PO}mO!U#bO!W#cO!X!^O!Z!YO!liO!qgO!tiO#Y!_O#r!ZO#{![O$O!]O$b!`O$d!bO$f!cO'ZkO'^UO'gcO'qiO(QdOo#qXy#qX#O#qX#P#qX#p#qX'r#qX'x#qX'y#qX'z#qX'{#qX'|#qX'}#qX(O#qX(P#qX(R#qX(T#qXX#qX!e#qX!P#qXv#qX#R#qX~P)xOPoOQ!QOSVOTVOZeO[lOd[OsVOtVOuVOw!PO}mO!U#bO!W#cO!X!^O!Z!YO!liO!qgO!tiO#Y!_O#r!ZO#{![O$O!]O$b!`O$d!bO$f!cO'ZkO'^UO'gcO'qiO(QdOo#zXy#zX#O#zX#P#zX#p#zX'r#zX'x#zX'y#zX'z#zX'{#zX'|#zX'}#zX(O#zX(P#zX(R#zX(T#zXX#zX!e#zX!P#zXv#zX#R#zX~P)xO'ZkO[#}Xo#}Xy#}X}#}X!l#}X!q#}X!t#}X#O#}X#P#}X#p#}X'g#}X'q#}X'r#}X'x#}X'y#}X'z#}X'{#}X'|#}X'}#}X(O#}X(P#}X(Q#}X(R#}X(T#}XX#}X!e#}X!P#}Xv#}Xw#}X#R#}X~OPoO~OPoOQ!QOSVOTVOZeO[lO^9qO_9qO`9qOa9qOd9tOsVOtVOuVOw!PO}mO!U#bO!W#cO!X:zO!Z!YO!l9wO!q9vO!t9wO#Y!_O#r9zO#{9{O$O!]O$b!`O$d!bO$f!cO'T9oO'ZkO'^UO'gcO'q9wO(QdO~O!S&_O~Ow!PO~O!j&bO~P<cO'T&cO~PEvOZ&eO~O'T&cO~O'^UOw(^Xy(^X!Q(^X!U(^X!W(^X$q(^X%](^X%^(^X~Oa&hO~P!1iO'T&iO~O_&nO'T&cO~OQ&oOZ&pO[%qO^%vO_%cO`TOaTOd%jOg%yO}%pO!q%oO$f%wO%^%xO&W%{O'T%dO'Z%eO(Q%zO~PGaO!j&uO~P<cO^&wO_&wO`&wOa&wOd'POw&|O'T&vO(Q&}O~O!i'UO!j'TO'T&cO~O&}!sO'O'VO'P'XO~Or!uO']'ZO'_!uO~OQ']O^'ia_'ia`'iaa'ia'T'ia~O['cOw'dO}'bO~OQ']O~OQ!QO^#TO_#TO`#TOa'kOd#ZO'T#SO~O['lO~OZbXdlXXbXobXPbX!SbX!ebX'rbX!PbX!ObXybX!ZbX#RbXvbX~O[bXwbX}bX~P!6mOZ'SXd'XXX'SX['SXo'SXw'SX}'SX#p'SXP'SX!S'SX!e'SX'r'SX!P'SX!O'SXy'SX!Z'SX#R'SXv'SX~O^#TO_#TO`#TOa'kO'T#SO~OZ'mO~Od'oO~OZ'SXd'XX~PMuOZ'pOX(SX!e(SX!P(SXw(SX#R(SX~P*`O[#}O}#zO(O#|O(R#fOo#_ay#_a!l#_a!q#_a!t#_a#O#_a#P#_a#p#_a'g#_a'q#_a'r#_a'x#_a'y#_a'z#_a'{#_a'|#_a'}#_a(P#_a(Q#_a(T#_aX#_a!e#_a!P#_av#_aw#_a#R#_a~Ow!PO!X&RO~Oy#caX#ca!e#ca!P#cav#ca#R#ca~P2gOPoOQ!QOSVOTVOZeOd[OsVOtVOuVOw!PO!U#bO!W#cO!X!^O!Z!YO#Y!_O#r!ZO#{![O$O!]O$b!`O$d!bO$f!cO'ZkO'^UO[#sao#say#sa}#sa!l#sa!q#sa!t#sa#O#sa#P#sa#p#sa'g#sa'q#sa'r#sa'x#sa'y#sa'z#sa'{#sa'|#sa'}#sa(O#sa(P#sa(Q#sa(R#sa(T#saX#sa!e#sa!P#sav#sa#R#sa~P)xOPoOQ!QOSVOTVOZeO[lOd[OsVOtVOuVOw!PO}mO!U#bO!W#cO!X!^O!Z!YO!liO!qgO!tiO#Y!_O#r!ZO#{![O$O!]O$b!`O$d!bO$f!cO'Q#VO'ZkO'^UO'gcO'qiO(QdO!P(UP~P)xOu(SO#w(TO'T(RO~O[#}O}#zO!q#jO'g#gO'r#lO'x#hO'y#iO'z#iO'{#kO'|#nO'}#mO(O#|O(P#gO(Q#hO(R#fO(T#hO!l#sa!t#sa#p#sa'q#sa~Oo#xO#O#xO#P#uOy#saX#sa!e#sa!P#sav#sa#R#sa~P!B}Oy(YO!e(WOX(WX~P2gOX(ZO~OPoOQ!QOSVOTVOX(ZOZeO[lOd[OsVOtVOuVOw!PO}mO!U#bO!W#cO!X!^O!Z!YO!liO!qgO!tiO#Y!_O#r!ZO#{![O$O!]O$b!`O$d!bO$f!cO'Q$UO'ZkO'^UO'gcO'qiO(QdO~P)xOZ#RO~O!P(_O!e(WO~P2gOPoOQ!QOSVOTVOZeO[lOd[OsVOtVOuVOw!PO}mO!U#bO!W#cO!X!^O!Z!YO!liO!qgO!tiO#Y!_O#r!ZO#{![O$O!]O$b!`O$d!bO$f!cO'Q$UO'ZkO'^UO'gcO'qiO(QdO~P)xOZbXdlXwjX}jX!tbX'qbX~OP!RX!S!RX!e!RX'p!RX'r!RX!O!RXo!RXy!RX!P!RXX!RX!Z!RX#R!RXv!RX~P!JUOZ'SXd'XXw'kX}'kX!t'SX'q'SX~OP!`X!S!`X!e!`X'r!`X!O!`Xo!`Xy!`X!P!`XX!`X!Z!`X#R!`Xv!`X~P!KgOT(aOu(aO~O!t(bO'q(bOP!^X!S!^X!e!^X'r!^X!O!^Xo!^Xy!^X!P!^XX!^X!Z!^X#R!^Xv!^X~O^9rO_9rO`9yOa9yO'T9pO~Od(eO~O'p(fOP'hX!S'hX!e'hX'r'hX!O'hXo'hXy'hX!P'hXX'hX!Z'hX#R'hXv'hX~O!j&bO!P'lP~P<cOw(kO}(jO~O!j&bOX'lP~P<cO!j(oO~P<cOZ'pO!t(bO'q(bO~O!S(qO'r(pOP$WX!e$WX~O!e(rOP(YX~OP(tO~OP!aX!S!aX!e!aX'r!aX!O!aXo!aXy!aX!P!aXX!aX!Z!aX#R!aXv!aX~P!KgOy$UaX$Ua!e$Ua!P$Uav$Ua#R$Ua~P2gO!l(|O'Q#VO'T(xOv(ZP~OQ!QO^#TO_#TO`#TOa#]Od#ZOg!nOyvO|!VO!Q!dO!U#^O!W!lO!]!pO$i!eO$m!fO$q!gO$s!hO%T!iO%V!jO%Z!kO%]!lO%^!mO%f!oO%j!qO%s!rO'Q`O'T#SO~Ov)TO~P#$iOy)VO~PEsO%^)WO~PGaOa)ZO~P!1iO%f)`O~PEvO_)aO'T&cO~O!i)fO!j)eO'T&cO~O'^UO!Q(^X!U(^X!W(^X$q(^X%](^X%^(^X~Ov%uX~P2gOv)gO~PGyOv)gO~Ov)gO~P]OQiXQ'XXZiXd'XX}iX#piX(PiX~ORiXwiX$fiX$|iX[iXoiXyiX!liX!qiX!tiX#OiX#PiX'giX'qiX'riX'xiX'yiX'ziX'{iX'|iX'}iX(OiX(QiX(RiX(TiX!PiX!eiXXiXPiXviX!SiX#RiX~P#(kOQjXQlXRjXZjXdlX}jX#pjX(PjXwjX$fjX$|jX[jXojXyjX!ljX!qjX!tjX#OjX#PjX'gjX'qjX'rjX'xjX'yjX'zjX'{jX'|jX'}jX(OjX(QjX(RjX(TjX!PjX!ejXXjX!SjXPjXvjX#RjX~O%^)jO~PGaOQ']Od)kO~O^)mO_)mO`)mOa)mO'T%dO~Od)qO~OQ']OZ)uO})sOR'UX#p'UX(P'UXw'UX$f'UX$|'UX['UXo'UXy'UX!l'UX!q'UX!t'UX#O'UX#P'UX'g'UX'q'UX'r'UX'x'UX'y'UX'z'UX'{'UX'|'UX'}'UX(O'UX(Q'UX(R'UX(T'UX!P'UX!e'UXX'UXP'UXv'UX!S'UX#R'UX~OQ!QO^:bO_:^O`TOaTOd:aO%^)jO'T:_O~PGaOQ!QOZ%rO[%qO^%vO_%cO`TOaTOd%jOg%yO}%pO!j)yO!q%oO$f%wO%^%xO&W%{O'T%dO'Z%eO(Q%zO~PGaOQ!QOZ%rO[%qO^%vO_%cO`TOaTOd%jOg%yO}%pO!P)|O!q%oO$f%wO%^%xO&W%{O'T%dO'Z%eO(Q%zO~PGaO(P*OO~OR*QO#p*RO(P*PO~OQhXQ'XXZhXd'XX}hX(PhX~ORhX#phXwhX$fhX$|hX[hXohXyhX!lhX!qhX!thX#OhX#PhX'ghX'qhX'rhX'xhX'yhX'zhX'{hX'|hX'}hX(OhX(QhX(RhX(ThX!PhX!ehXXhXPhXvhX!ShX#RhX~P#4kOQ*SO~O})sO~OQ!QO^%vO_%cO`TOaTOd%jO$f%wO%^%xO'T%dO~PGaO!Q*VO!j*VO~O^*YO`*YOa*YO!O*ZO~OQ&oOZ*[O[%qO^%vO_%cO`TOaTOd%jOg%yO}%pO!q%oO$f%wO%^%xO&W%{O'T%dO'Z%eO(Q%zO~PGaO[#}Oo:YO}#zO!l:ZO!q#jO!t:ZO#O:YO#P:VO#p$OO'g#gO'q:ZO'r#lO'x#hO'y#iO'z#iO'{#kO'|#nO'}#mO(O#|O(P#gO(Q#hO(R#fO(T#hO~Ow'dX~P#9vOy#qaX#qa!e#qa!P#qav#qa#R#qa~P2gOy#zaX#za!e#za!P#zav#za#R#za~P2gOPoOQ!QOSVOTVOZeO[lOd[OsVOtVOuVOw!PO}mO!S&_O!U#bO!W#cO!X!^O!Z!YO!liO!qgO!tiO#Y!_O#r!ZO#{![O$O!]O$b!`O$d!bO$f!cO'ZkO'^UO'gcO'qiO(QdOo#zay#za#O#za#P#za#p#za'r#za'x#za'y#za'z#za'{#za'|#za'}#za(O#za(P#za(R#za(T#zaX#za!e#za!P#zav#za#R#za~P)xOPoOQ!QOSVOTVOZeO[lOd[OsVOtVOuVOw!PO}mO!U#bO!W#cO!X!^O!Z!YO!liO!qgO!tiO#Q*eO#Y!_O#r!ZO#{![O$O!]O$b!`O$d!bO$f!cO'ZkO'^UO'gcO'qiO(QdO~P)xOw*fO~P#9vO$b*iO$d*jO$f*kO~O!O*lO'r(pO~O!S*nO~O'T*oO~Ow$yOy*qO~O'T*rO~OQ*uOw*vOy*yO}*wO$|*xO~OQ*uOw*vO$|*xO~OQ*uOw+QO$|*xO~OQ*uOo+VOy+XO!S+UO~OQ*uO}+ZO~OQ!QOZ%rO[%qO^%vO`TOaTOd%jOg%yO}%pO!U!lO!W!lO!q%oO$f%wO$q%[O%]!lO%^%xO&W%{O'T%dO'Z%eO(Q%zO~OR+bO_+^O!Q+cO~P#DkO_%cO!Q!lOw&UX$|&UX(P&UX~P#DkOw$yO$f+hO$|*xO(P*PO~OQ!QOZ*[O[%qO^%vO_%cO`TOaTOd%jOg%yO}%pO!q%oO$f%wO%^%xO&W%{O'T%dO'Z%eO(Q%zO~PGaOQ*uOw$yO!S+UO$|*xO~Oo+nOy+mO!S+oO'r(pO~OdlXy!RX#pbXv!RX!e!RX~Od'XXy(mX#p'SXv(mX!e(mX~Od+qO~O^#TO_#TO`#TOa'kOw&|O'T&vO(Q+vO~Ov(oP~P!3|O#p+{O~Oy+|O~O!S+}O~O&}!sO'O'VO'P,PO~Od,QO~OSVOTVO_%cOsVOtVOuVOw!PO!Q!lO'^UO~P#DkOS,^OT,^OZ,^O['cO_,YOd,^Oo,^Os,^Ou,^Ow'dOy,^O}'bO!S,^O!e,^O!l,^O!q,[O!t,^O!y,^O#O,^O#P,^O#Q,^O#R,^O'Q,^O'Z%eO'^UO'g,ZO'r,[O'v,_O'x,ZO'y,[O'z,[O'{,[O'|,]O'},]O(O,^O(P,`O(Q,`O(R,aO~O!P,dO~P#KkOX,gO~P#KkOv,iO~P#KkOo'tX#O'tX#P'tX#p'tX'r'tX'x'tX'y'tX'z'tX'{'tX'|'tX'}'tX(O'tX(P'tX(R'tX(T'tX~Oy,jO['tX}'tX!l'tX!q'tX!t'tX'g'tX'q'tX(Q'tXv'tX~P#NjOP$giQ$giS$giT$giZ$gi[$gi^$gi_$gi`$gia$gid$gig$gis$git$giu$giw$giy$gi|$gi}$gi!Q$gi!U$gi!W$gi!X$gi!Z$gi!]$gi!l$gi!q$gi!t$gi#Y$gi#r$gi#{$gi$O$gi$b$gi$d$gi$f$gi$i$gi$m$gi$q$gi$s$gi%T$gi%V$gi%Z$gi%]$gi%^$gi%f$gi%j$gi%s$gi&z$gi'Q$gi'T$gi'Z$gi'^$gi'g$gi'q$gi(Q$giv$gi~P#NjOX,kO~O['cOo,lOw'dO}'bOX]X~Oy#ciX#ci!e#ci!P#civ#ci#R#ci~P2gO[#}O}#zO'x#hO(O#|O(Q#hO(R#fO(T#hOo#eiy#ei!l#ei!q#ei!t#ei#O#ei#P#ei#p#ei'q#ei'r#ei'y#ei'z#ei'{#ei'|#ei'}#eiX#ei!e#ei!P#eiv#ei#R#ei~O'g#ei(P#ei~P$'PO[#}O}#zO(O#|O(R#fOo#eiy#ei!l#ei!q#ei!t#ei#O#ei#P#ei#p#ei'q#ei'r#ei'y#ei'z#ei'{#ei'|#ei'}#eiX#ei!e#ei!P#eiv#ei#R#ei~O'g#ei'x#ei(P#ei(Q#ei(T#eiw#ei~P$)QO'g#gO(P#gO~P$'PO[#}O}#zO'g#gO'x#hO'y#iO'z#iO(O#|O(P#gO(Q#hO(R#fO(T#hOo#eiy#ei!l#ei!t#ei#O#ei#P#ei#p#ei'q#ei'r#ei'{#ei'|#ei'}#eiX#ei!e#ei!P#eiv#ei#R#ei~O!q#ei~P$+`O!q#jO~P$+`O[#}O}#zO!q#jO'g#gO'x#hO'y#iO'z#iO'{#kO(O#|O(P#gO(Q#hO(R#fO(T#hOo#eiy#ei!l#ei!t#ei#O#ei#P#ei#p#ei'q#ei'|#ei'}#eiX#ei!e#ei!P#eiv#ei#R#ei~O'r#ei~P$-hO'r#lO~P$-hO[#}O}#zO!q#jO#P#uO'g#gO'r#lO'x#hO'y#iO'z#iO'{#kO(O#|O(P#gO(Q#hO(R#fO(T#hOo#eiy#ei!l#ei!t#ei#O#ei#p#ei'q#ei'|#eiX#ei!e#ei!P#eiv#ei#R#ei~O'}#ei~P$/pO'}#mO~P$/pO[#}O}#zO!q#jO'g#gO'r#lO'x#hO'y#iO'z#iO'{#kO'|#nO'}#mO(O#|O(P#gO(Q#hO(R#fO(T#hO!l#ni!t#ni#p#ni'q#ni~Oo#xO#O#xO#P#uOy#niX#ni!e#ni!P#niv#ni#R#ni~P$1xO[#}O}#zO!q#jO'g#gO'r#lO'x#hO'y#iO'z#iO'{#kO'|#nO'}#mO(O#|O(P#gO(Q#hO(R#fO(T#hO!l#si!t#si#p#si'q#si~Oo#xO#O#xO#P#uOy#siX#si!e#si!P#siv#si#R#si~P$3yOPoOQ!QOSVOTVOZeO[lOd[OsVOtVOuVOw!PO}mO!U#bO!W#cO!X!^O!Z!YO!liO!qgO!tiO#Y!_O#r!ZO#{![O$O!]O$b!`O$d!bO$f!cO'Q#VO'ZkO'^UO'gcO'qiO(QdO~P)xO!e,sO!P(VX~P2gO!P,uO~OX,vO~P2gOPoOQ!QOSVOTVOZeO[lOd[OsVOtVOuVOw!PO}mO!U#bO!W#cO!X!^O!Z!YO!liO!qgO!tiO#Y!_O#r!ZO#{![O$O!]O$b!`O$d!bO$f!cO'ZkO'^UO'gcO'qiO(QdOX&fX!e&fX!P&fX~P)xO!e(WOX(Wa~Oy,zO!e(WOX(WX~P2gOX,{O~O!P,|O!e(WO~O!P-OO!e(WO~P2gOSVOTVOsVOtVOuVO'^UO'g$[O~P!6POP!baZca!S!ba!e!ba!tca'qca'r!ba!O!bao!bay!ba!P!baX!ba!Z!ba#R!bav!ba~O!e-TO'r(pO!P'mXX'mX~O!P-VO~O!i-`O!j-_O!l-[O'T-XOv'nP~OX-aO~O_%cO!Q!lO~P#DkO!j-gOP&gX!e&gX~P<cO!e(rOP(Ya~O!S-iO'r(pOP$Wa!e$Wa~Ow!PO(P*PO~OvbX!S!kX!ebX~O'Q#VO'T(xO~O!S-mO~O!e-oOv([X~Ov-qO~Ov-sO~P,cOv-sO~P#$iO_-uO'T&cO~O!S-vO~Ow$yOy-wO~OQ*uOw*vOy-zO}*wO$|*xO~OQ*uOo.UO~Oy._O~O!S.`O~O!j.bO'T&cO~Ov.cO~Ov.cO~PGyOQ']O^'Wa_'Wa`'Waa'Wa'T'Wa~Od.gO~OQ'XXQ'kXR'kXZ'kXd'XX}'kX#p'kX(P'kXw'kX$f'kX$|'kX['kXo'kXy'kX!l'kX!q'kX!t'kX#O'kX#P'kX'g'kX'q'kX'r'kX'x'kX'y'kX'z'kX'{'kX'|'kX'}'kX(O'kX(Q'kX(R'kX(T'kX!P'kX!e'kXX'kXP'kXv'kX!S'kX#R'kX~OQ!QOZ%rO[%qO^.rO_%cO`TOaTOd%jOg%yO}%pO!j.sO!q.pO!t.kO#V.mO$f%wO%^%xO&W%{O'Q#VO'T%dO'Z%eO(Q%zO!P(sP~PGaO#Q.tOR%wa#p%wa(P%waw%wa$f%wa$|%wa[%wao%way%wa}%wa!l%wa!q%wa!t%wa#O%wa#P%wa'g%wa'q%wa'r%wa'x%wa'y%wa'z%wa'{%wa'|%wa'}%wa(O%wa(Q%wa(R%wa(T%wa!P%wa!e%waX%waP%wav%wa!S%wa#R%wa~O%^.vO~PGaO(P*POR&Oa#p&Oaw&Oa$f&Oa$|&Oa[&Oao&Oay&Oa}&Oa!l&Oa!q&Oa!t&Oa#O&Oa#P&Oa'g&Oa'q&Oa'r&Oa'x&Oa'y&Oa'z&Oa'{&Oa'|&Oa'}&Oa(O&Oa(Q&Oa(R&Oa(T&Oa!P&Oa!e&OaX&OaP&Oav&Oa!S&Oa#R&Oa~O_%cO!Q!lO!j.xO(P*OO~P#DkO!e.yO(P*PO!P(uX~O!P.{O~OX.|Oy.}O(P*PO~O'Z%eOR(qP~OQ']O})sORfa#pfa(Pfawfa$ffa$|fa[faofayfa!lfa!qfa!tfa#Ofa#Pfa'gfa'qfa'rfa'xfa'yfa'zfa'{fa'|fa'}fa(Ofa(Qfa(Rfa(Tfa!Pfa!efaXfaPfavfa!Sfa#Rfa~OQ']O})sOR&Va#p&Va(P&Vaw&Va$f&Va$|&Va[&Vao&Vay&Va!l&Va!q&Va!t&Va#O&Va#P&Va'g&Va'q&Va'r&Va'x&Va'y&Va'z&Va'{&Va'|&Va'}&Va(O&Va(Q&Va(R&Va(T&Va!P&Va!e&VaX&VaP&Vav&Va!S&Va#R&Va~O!P/UO~Ow$yO$f/ZO$|*xO(P*PO~OQ!QOZ/[O[%qO^%vO_%cO`TOaTOd%jOg%yO}%pO!q%oO$f%wO%^%xO&W%{O'T%dO'Z%eO(Q%zO~PGaOo/^O'r(pO~O#W/_OP!YiQ!YiS!YiT!YiZ!Yi[!Yi^!Yi_!Yi`!Yia!Yid!Yig!Yio!Yis!Yit!Yiu!Yiw!Yiy!Yi|!Yi}!Yi!Q!Yi!U!Yi!W!Yi!X!Yi!Z!Yi!]!Yi!l!Yi!q!Yi!t!Yi#O!Yi#P!Yi#Y!Yi#p!Yi#r!Yi#{!Yi$O!Yi$b!Yi$d!Yi$f!Yi$i!Yi$m!Yi$q!Yi$s!Yi%T!Yi%V!Yi%Z!Yi%]!Yi%^!Yi%f!Yi%j!Yi%s!Yi&z!Yi'Q!Yi'T!Yi'Z!Yi'^!Yi'g!Yi'q!Yi'r!Yi'x!Yi'y!Yi'z!Yi'{!Yi'|!Yi'}!Yi(O!Yi(P!Yi(Q!Yi(R!Yi(T!YiX!Yi!e!Yi!P!Yiv!Yi!i!Yi!j!Yi#V!Yi#R!Yi~Oy#ziX#zi!e#zi!P#ziv#zi#R#zi~P2gOy$UiX$Ui!e$Ui!P$Uiv$Ui#R$Ui~P2gOv/eO!j&bO'Q`O~P<cOw/nO}/mO~Oy!RX#pbX~Oy/oO~O#p/pO~OR+bO_+dO!Q/sO'T&iO'Z%eO~Oa/zO|!VO'Q#VO'T(ROv(cP~OQ!QOZ%rO[%qO^%vO_%cO`TOa/zOd%jOg%yO|!VO}%pO!q%oO$f%wO%^%xO&W%{O'Q#VO'T%dO'Z%eO(Q%zO!P(eP~PGaOQ!QOZ%rO[%qO^%vO_%cO`TOaTOd%jOg%yO}%pO!q%oO$f0VO%^%xO&W%{O'T%dO'Z%eO(Q%zOw(`Py(`P~PGaOw*vO~Oy-zO$|*xO~Oa/zO|!VO'Q#VO'T*oOv(gP~Ow+QO~OQ!QOZ%rO[%qO^%vO_%cO`TOaTOd%jOg%yO}%pO!q%oO$f0VO%^%xO&W%{O'T%dO'Z%eO(Q%zO(R0`O~PGaOy0dO~OQ!QOSVOTVO[$gO^0lO_$ZO`9yOa9yOd$aOsVOtVOuVO}$eO!i$qO!j0mO!l$lO!q0eO!t0hO'Q#VO'T$YO'Z%eO'^UO'g$[O~O#V0nO!P(jP~P%1}Ow!POy0pO#Q0rO$|*xO~OR0uO!e0sO~P#(kOR0uO!S+UO!e0sO(P*OO~OR0uOo0wO!S+UO!e0sOQ'VXZ'VX}'VX#p'VX(P'VX~OR0uOo0wO!e0sO~OR0uO!e0sO~O$f/ZO(P*PO~Ow$yO~Ow$yO$|*xO~Oo0}Oy0|O!S1OO'r(pO~O!e1POv(pX~Ov1RO~O^#TO_#TO`#TOa'kOw&|O'T&vO(Q1VO~Oo1YOQ'VXR'VXZ'VX}'VX!e'VX(P'VX~O!e1ZO(P*POR'YX~O!e1ZOR'YX~O!e1ZO(P*OOR'YX~OR1]O~O!S1^OS'wXT'wXZ'wX['wX_'wXd'wXo'wXs'wXu'wXw'wXy'wX}'wX!P'wX!e'wX!l'wX!q'wX!t'wX!y'wX#O'wX#P'wX#Q'wX#R'wX'Q'wX'Z'wX'^'wX'g'wX'r'wX'v'wX'x'wX'y'wX'z'wX'{'wX'|'wX'}'wX(O'wX(P'wX(Q'wX(R'wXX'wXv'wX~O}1_O~O!P1aO~P#KkOX1bO~P#KkOv1cO~P#KkOS,^OT,^OZ,^O['cO_1dOd,^Oo,^Os,^Ou,^Ow'dOy,^O}'bO!S,^O!e,^O!l,^O!q,[O!t,^O!y,^O#O,^O#P,^O#Q,^O#R,^O'Q,^O'Z%eO'^UO'g,ZO'r,[O'v,_O'x,ZO'y,[O'z,[O'{,[O'|,]O'},]O(O,^O(P,`O(Q,`O(R,aO~OX1fO~Oy,jO~O!e,sO!P(Va~P2gOPoOQ!QOSVOTVOZeO[lOd[OsVOtVOuVOw!PO}mO!U#bO!W#cO!X!^O!Z!YO!liO!qgO!tiO#Y!_O#r!ZO#{![O$O!]O$b!`O$d!bO$f!cO'Q#VO'ZkO'^UO'gcO'qiO(QdO!P&eX!e&eX~P)xO!e,sO!P(Va~OX&fa!e&fa!P&fa~P2gOX1kO~P2gO!P1mO!e(WO~OP!biZci!S!bi!e!bi!tci'qci'r!bi!O!bio!biy!bi!P!biX!bi!Z!bi#R!biv!bi~O'r(pOP!oi!S!oi!e!oi!O!oio!oiy!oi!P!oiX!oi!Z!oi#R!oiv!oi~O!j&bO!P&`X!e&`XX&`X~P<cO!e-TO!P'maX'ma~O!P1qO~Ov!RX!S!kX!e!RX~O!S1rO~O!e1sOv'oX~Ov1uO~O'T-XO~O!j1xO'T-XO~O(P*POP$Wi!e$Wi~O!S1yO'r(pOP$XX!e$XX~O!S1|O~Ov$_a!e$_a~P2gO!l(|O'Q#VO'T(xOv&hX!e&hX~O!e-oOv([a~Ov2QO~P,cOy2UO~O#p2VO~Oy2WO$|*xO~Ow*vOy2WO}*wO$|*xO~Oo2aO~Ow!POy2fO#Q2hO$|*xO~O!S2jO~Ov2lO~O#Q2mOR%wi#p%wi(P%wiw%wi$f%wi$|%wi[%wio%wiy%wi}%wi!l%wi!q%wi!t%wi#O%wi#P%wi'g%wi'q%wi'r%wi'x%wi'y%wi'z%wi'{%wi'|%wi'}%wi(O%wi(Q%wi(R%wi(T%wi!P%wi!e%wiX%wiP%wiv%wi!S%wi#R%wi~Od2nO~O^2qO!j.sO!q2rO'Q#VO'Z%eO~O(P*PO!P%{X!e%{X~O!e2sO!P(tX~O!P2uO~OQ!QOZ%rO[%qO^2wO_%cO`TOaTOd%jOg%yO}%pO!j2xO!q%oO$f%wO%^%xO&W%{O'T%dO'Z%eO(Q%zO~PGaO^2yO!j2xO(P*OO~O!P%aX!e%aX~P#4kO^2yO~O(P*POR&Oi#p&Oiw&Oi$f&Oi$|&Oi[&Oio&Oiy&Oi}&Oi!l&Oi!q&Oi!t&Oi#O&Oi#P&Oi'g&Oi'q&Oi'r&Oi'x&Oi'y&Oi'z&Oi'{&Oi'|&Oi'}&Oi(O&Oi(Q&Oi(R&Oi(T&Oi!P&Oi!e&OiX&OiP&Oiv&Oi!S&Oi#R&Oi~O_%cO!Q!lO!P&yX!e&yX~P#DkO!e.yO!P(ua~OR3QO(P*PO~O!e3ROR(rX~OR3TO~O(P*POR&Pi#p&Piw&Pi$f&Pi$|&Pi[&Pio&Piy&Pi}&Pi!l&Pi!q&Pi!t&Pi#O&Pi#P&Pi'g&Pi'q&Pi'r&Pi'x&Pi'y&Pi'z&Pi'{&Pi'|&Pi'}&Pi(O&Pi(Q&Pi(R&Pi(T&Pi!P&Pi!e&PiX&PiP&Piv&Pi!S&Pi#R&Pi~O!P3UO~O$f3VO(P*PO~Ow$yO$f3VO$|*xO(P*PO~Ow!PO!Z!YO~O!Z3aO#R3_O'r(pO~O!j&bO'Q#VO~P<cOv3eO~Ov3eO!j&bO'Q`O~P<cO!O3hO'r(pO~Ow!PO~P#9vOo3kOy3jO(P*PO~O!P3oO~P%;pOv3rO~P%;pOR0uO!S+UO!e0sO~OR0uOo0wO!S+UO!e0sO~Oa/zO|!VO'Q#VO'T(RO~O!S3uO~O!e3wOv(dX~Ov3yO~OQ!QOZ%rO[%qO^%vO_%cO`TOa/zOd%jOg%yO|!VO}%pO!q%oO$f%wO%^%xO&W%{O'Q#VO'T%dO'Z%eO(Q%zO~PGaO!e3|O(P*PO!P(fX~O!P4OO~O!S4PO(P*OO~O!S+UO(P*PO~O!e4ROw(aXy(aX~OQ4TO~Oy2WO~Oa/zO|!VO'Q#VO'T*oO~Oo4WOw*vO}*wOv%XX!e%XX~O!e4ZOv(hX~Ov4]O~O(P4_Oy(_Xw(_X$|(_XR(_Xo(_X!e(_X~Oy4aO(P*PO~OQ!QOSVOTVO[$gO^4bO_$ZO`9yOa9yOd$aOsVOtVOuVO}$eO!i$qO!l$lO!q$hO#V$lO'T$YO'^UO'g$[O~O!j4cO'Z%eO~P&,sO!S4eO'r(pO~O#V4gO~P%1}O!e4hO!P(kX~O!P4jO~O!P%aX!S!aX!e%aX'r!aX~P!KgO!j&bO~P&,sO!e4hO!P(kX!S'eX'r'eX~O^2yO!j2xO~Ow!POy2fO~O_4pO!Q/sO'T&iO'Z%eOR&lX!e&lX~OR4rO!e0sO~O!S4tO~Ow$yO$|*xO(P*PO~Oy4uO~P2gOo4vOy4uO(P*PO~Ov&uX!e&uX~P!3|O!e1POv(pa~Oo4|Oy4{O(P*PO~OSVOTVO_%cOsVOtVOuVOw!PO!Q!lO'^UOR&vX!e&vX~P#DkO!e1ZOR'Ya~O!y5SO~O!P5TO~P#KkO!S1^OX'wX#R'wX~O!e,sO!P(Vi~O!P&ea!e&ea~P2gOX5WO~P2gOP!bqZcq!S!bq!e!bq!tcq'qcq'r!bq!O!bqo!bqy!bq!P!bqX!bq!Z!bq#R!bqv!bq~O'r(pO!P&`a!e&`aX&`a~O!i-`O!j-_O!l5YO'T-XOv&aX!e&aX~O!e1sOv'oa~O!S5[O~O!S5`O'r(pOP$Xa!e$Xa~O(P*POP$Wq!e$Wq~Ov$^i!e$^i~P2gOw!POy5bO#Q5dO$|*xO~Oo5gOy5fO(P*PO~Oy5iO~Oy5iO$|*xO~Oy5mO(P*PO~Ow!POy5bO~Oo5tOy5sO(P*PO~O!S5vO~O!e2sO!P(ta~O^2yO!j2xO'Z%eO~OQ!QOZ%rO[%qO^.rO_%cO`TOaTOd%jOg%yO}%pO!j.sO!q.pO!t5zO#V5|O$f%wO%^%xO&W%{O'Q#VO'T%dO'Z%eO(Q%zO!P&xX!e&xX~PGaOQ!QOZ%rO[%qO^6OO_%cO`TOaTOd%jOg%yO}%pO!j6PO!q%oO$f%wO%^%xO&W%{O'T%dO'Z%eO(P*OO(Q%zO~PGaO!P%aa!e%aa~P#4kO^6QO~O#Q6ROR%wq#p%wq(P%wqw%wq$f%wq$|%wq[%wqo%wqy%wq}%wq!l%wq!q%wq!t%wq#O%wq#P%wq'g%wq'q%wq'r%wq'x%wq'y%wq'z%wq'{%wq'|%wq'}%wq(O%wq(Q%wq(R%wq(T%wq!P%wq!e%wqX%wqP%wqv%wq!S%wq#R%wq~O(P*POR&Oq#p&Oqw&Oq$f&Oq$|&Oq[&Oqo&Oqy&Oq}&Oq!l&Oq!q&Oq!t&Oq#O&Oq#P&Oq'g&Oq'q&Oq'r&Oq'x&Oq'y&Oq'z&Oq'{&Oq'|&Oq'}&Oq(O&Oq(Q&Oq(R&Oq(T&Oq!P&Oq!e&OqX&OqP&Oqv&Oq!S&Oq#R&Oq~O(P*PO!P&ya!e&ya~OX6SO~P2gO'Z%eOR&wX!e&wX~O!e3ROR(ra~O$f6YO(P*PO~Ow![q~P#9vO#R6]O~O!Z3aO#R6]O'r(pO~Ov6bO~O#R6fO~Oy6gO!P6hO~O!P6hO~P%;pOy6kO~Ov6kOy6gO~Ov6kO~P%;pOy6mO~O!e3wOv(da~O!S6pO~Oa/zO|!VO'Q#VO'T(ROv&oX!e&oX~O!e3|O(P*PO!P(fa~OQ!QOZ%rO[%qO^%vO_%cO`TOa/zOd%jOg%yO|!VO}%pO!q%oO$f%wO%^%xO&W%{O'Q#VO'T%dO'Z%eO(Q%zO!P&pX!e&pX~PGaO!e3|O!P(fa~OQ!QOZ%rO[%qO^%vO_%cO`TOaTOd%jOg%yO}%pO!q%oO$f0VO%^%xO&W%{O'T%dO'Z%eO(Q%zOw&nX!e&nXy&nX~PGaO!e4ROw(aay(aa~O!e4ZOv(ha~Oo7SOv%Xa!e%Xa~Oo7SOw*vO}*wOv%Xa!e%Xa~Oa/zO|!VO'Q#VO'T*oOv&qX!e&qX~O(P*POy$xaw$xa$|$xaR$xao$xa!e$xa~O(P4_Oy(_aw(_a$|(_aR(_ao(_a!e(_a~O!P%aa!S!aX!e%aa'r!aX~P!KgOQ!QOSVOTVO[$gO_$ZO`9yOa9yOd$aOsVOtVOuVO}$eO!i$qO!j&bO!l$lO!q$hO#V$lO'T$YO'^UO'g$[O~O^7ZO~P&JUO^6QO!j6PO~O!e4hO!P(ka~O!e4hO!P(ka!S'eX'r'eX~OQ!QOSVOTVO[$gO^0lO_$ZO`9yOa9yOd$aOsVOtVOuVO}$eO!i$qO!j0mO!l$lO!q0eO!t7_O'Q#VO'T$YO'Z%eO'^UO'g$[O~O#V7aO!P&sX!e&sX~P&L]O!S7cO'r(pO~Ow!POy5bO$|*xO(P*PO~O!S+UOR&la!e&la~Oo0wO!S+UOR&la!e&la~Oo0wOR&la!e&la~O(P*POR$yi!e$yi~Oy7fO~P2gOo7gOy7fO(P*PO~O(P*PORni!eni~O(P*POR&va!e&va~O(P*OOR&va!e&va~OS,^OT,^OZ,^O_,^Od,^Oo,^Os,^Ou,^Oy,^O!S,^O!e,^O!l,^O!q,[O!t,^O!y,^O#O,^O#P,^O#Q,^O#R,^O'Q,^O'Z%eO'^UO'g,ZO'r,[O'x,ZO'y,[O'z,[O'{,[O'|,]O'},]O(O,^O~O(P7iO(Q7iO(R7iO~P'!qO!P7kO~P#KkO!P&ei!e&ei~P2gO'r(pOv!hi!e!hi~O!S7mO~O(P*POP$Xi!e$Xi~Ov$^q!e$^q~P2gOw!POy7oO~Ow!POy7oO#Q7rO$|*xO~Oy7tO~Oy7uO~Oy7vO(P*PO~Ow!POy7oO$|*xO(P*PO~Oo7{Oy7zO(P*PO~O!e2sO!P(ti~O(P*PO!P%}X!e%}X~O!P%ai!e%ai~P#4kO^8OO~O!e8TO['bXv$`i}'bX!l'bX!q'bX!t'bX'g'bX'q'bX(Q'bX~P@[OQ#[iS#[iT#[i[#[i^#[i_#[i`#[ia#[id#[is#[it#[iu#[iv$`i}#[i!i#[i!j#[i!l#[i!q#[i!t'bX#V#[i'Q#[i'T#[i'^#[i'g#[i'q'bX(Q'bX~P@[O#R#^a~P2gO#R8WO~O!Z3aO#R8XO'r(pO~Ov8[O~Oy8^O~P2gOy8`O~Oy6gO!P8aO~Ov8`Oy6gO~O!e3wOv(di~O(P*POv%Qi!e%Qi~O!e3|O!P(fi~O!e3|O(P*PO!P(fi~O(P*PO!P&pa!e&pa~O(P8hOw(bX!e(bXy(bX~O(P*PO!S$wiy$wiw$wi$|$wiR$wio$wi!e$wi~O!e4ZOv(hi~Ov%Xi!e%Xi~P2gOo8kOv%Xi!e%Xi~O!P%ai!S!aX!e%ai'r!aX~P!KgO(P*PO!P%`i!e%`i~O!e4hO!P(ki~O#V8nO~P&L]O!P&sa!S'eX!e&sa'r'eX~O(P*POR$zq!e$zq~Oy8pO~P2gOy7zO~P2gO(P8rO(Q8rO(R8rO~O(P8rO(Q8rO(R8rO~P'!qO'r(pOv!hq!e!hq~O(P*POP$Xq!e$Xq~Ow!POy8uO$|*xO(P*PO~Ow!POy8uO~Oy8xO~P2gOy8zO~P2gOo8|Oy8zO(P*PO~OQ#[qS#[qT#[q[#[q^#[q_#[q`#[qa#[qd#[qs#[qt#[qu#[qv$`q}#[q!i#[q!j#[q!l#[q!q#[q#V#[q'Q#[q'T#[q'^#[q'g#[q~O!e9PO['bXv$`q}'bX!l'bX!q'bX!t'bX'g'bX'q'bX(Q'bX~P@[Oo'bX!t'bX#O'bX#P'bX#p'bX'q'bX'r'bX'x'bX'y'bX'z'bX'{'bX'|'bX'}'bX(O'bX(P'bX(Q'bX(R'bX(T'bX~P'2fO#R9UO~O!Z3aO#R9UO'r(pO~Oy9WO~O(P*POv%Qq!e%Qq~O!e3|O!P(fq~O(P*PO!P&pi!e&pi~O(P8hOw(ba!e(bay(ba~Ov%Xq!e%Xq~P2gO!P&si!S'eX!e&si'r'eX~O(P*PO!P%`q!e%`q~Oy9]O~P2gO(P9^O(Q9^O(R9^O~O'r(pOv!hy!e!hy~Ow!POy9_O~Ow!POy9_O$|*xO(P*PO~Oy9aO~P2gOQ#[yS#[yT#[y[#[y^#[y_#[y`#[ya#[yd#[ys#[yt#[yu#[yv$`y}#[y!i#[y!j#[y!l#[y!q#[y#V#[y'Q#[y'T#[y'^#[y'g#[y~O!e9dO['bXv$`y}'bX!l'bX!q'bX!t'bX'g'bX'q'bX(Q'bX~P@[Oo'bX!t'bX#O'bX#P'bX#p'bX'q'bX'r'bX'x'bX'y'bX'z'bX'{'bX'|'bX'}'bX(O'bX(P'bX(Q'bX(R'bX(T'bX~P'9eO!e9eO['bX}'bX!l'bX!q'bX!t'bX'g'bX'q'bX(Q'bX~P@[OQ#[iS#[iT#[i[#[i^#[i_#[i`#[ia#[id#[is#[it#[iu#[i}#[i!i#[i!j#[i!l#[i!q#[i!t'bX#V#[i'Q#[i'T#[i'^#[i'g#[i'q'bX(Q'bX~P@[O#R9hO~O(P*PO!P&pq!e&pq~Ov%Xy!e%Xy~P2gOw!POy9iO~Oy9jO~P2gOQ#[!RS#[!RT#[!R[#[!R^#[!R_#[!R`#[!Ra#[!Rd#[!Rs#[!Rt#[!Ru#[!Rv$`!R}#[!R!i#[!R!j#[!R!l#[!R!q#[!R#V#[!R'Q#[!R'T#[!R'^#[!R'g#[!R~O!e9kO['bX}'bX!l'bX!q'bX!t'bX'g'bX'q'bX(Q'bX~P@[OQ#[qS#[qT#[q[#[q^#[q_#[q`#[qa#[qd#[qs#[qt#[qu#[q}#[q!i#[q!j#[q!l#[q!q#[q!t'bX#V#[q'Q#[q'T#[q'^#[q'g#[q'q'bX(Q'bX~P@[O!e9nO['bX}'bX!l'bX!q'bX!t'bX'g'bX'q'bX(Q'bX~P@[OQ#[yS#[yT#[y[#[y^#[y_#[y`#[ya#[yd#[ys#[yt#[yu#[y}#[y!i#[y!j#[y!l#[y!q#[y!t'bX#V#[y'Q#[y'T#[y'^#[y'g#[y'q'bX(Q'bX~P@[OwbX~P$|OwjX}jX!tbX'qbX~P!6mOZ'SXd'XXo'SXw'kX!t'SX'q'SX'r'SX~O['SXd'SXw'SX}'SX!l'SX!q'SX#O'SX#P'SX#p'SX'g'SX'x'SX'y'SX'z'SX'{'SX'|'SX'}'SX(O'SX(P'SX(Q'SX(R'SX(T'SX~P'GTOP'SX}'kX!S'SX!e'SX!O'SXy'SX!P'SXX'SX!Z'SX#R'SXv'SX~P'GTO^9qO_9qO`9qOa9qO'T9oO~O!j:OO~P!.cOPoOQ!QOSVOTVOZeOd9tOsVOtVOuVO!U#bO!W#cO!X:zO!Z!YO#Y!_O#r9zO#{9{O$O!]O$b!`O$d!bO$f!cO'ZkO'^UO[#sXo#sXw#sX}#sX!l#sX!q#sX!t#sX#O#sX#P#sX#p#sX'g#sX'q#sX'r#sX'x#sX'y#sX'z#sX'{#sX'|#sX'}#sX(O#sX(P#sX(Q#sX(R#sX(T#sX~P'IxO#Q$uO~P!.cO}'kXP'SX!S'SX!e'SX!O'SXy'SX!P'SXX'SX!Z'SX#R'SXv'SX~P'GTOo#qX#O#qX#P#qX#p#qX'r#qX'x#qX'y#qX'z#qX'{#qX'|#qX'}#qX(O#qX(P#qX(R#qX(T#qX~P!.cOo#zX#O#zX#P#zX#p#zX'r#zX'x#zX'y#zX'z#zX'{#zX'|#zX'}#zX(O#zX(P#zX(R#zX(T#zX~P!.cOPoOQ!QOSVOTVOZeOd9tOsVOtVOuVO!U#bO!W#cO!X:zO!Z!YO#Y!_O#r9zO#{9{O$O!]O$b!`O$d!bO$f!cO'ZkO'^UO[#sao#saw#sa}#sa!l#sa!q#sa!t#sa#O#sa#P#sa#p#sa'g#sa'q#sa'r#sa'x#sa'y#sa'z#sa'{#sa'|#sa'}#sa(O#sa(P#sa(Q#sa(R#sa(T#sa~P'IxOo:YO#O:YO#P:VOw#sa~P!B}Ow$Ua~P#9vOQ'XXd'XX}iX~OQlXdlX}jX~O^:sO_:sO`:sOa:sO'T:_O~OQ'XXd'XX}hX~Ow#qa~P#9vOw#za~P#9vO!S&_Oo#za#O#za#P#za#p#za'r#za'x#za'y#za'z#za'{#za'|#za'}#za(O#za(P#za(R#za(T#za~P!.cO#Q*eO~P!.cOw#ci~P#9vO[#}O}#zO'x#hO(O#|O(Q#hO(R#fO(T#hOo#eiw#ei!l#ei!q#ei!t#ei#O#ei#P#ei#p#ei'q#ei'r#ei'y#ei'z#ei'{#ei'|#ei'}#ei~O'g#ei(P#ei~P((}O'g#gO(P#gO~P((}O[#}O}#zO'g#gO'x#hO'y#iO'z#iO(O#|O(P#gO(Q#hO(R#fO(T#hOo#eiw#ei!l#ei!t#ei#O#ei#P#ei#p#ei'q#ei'r#ei'{#ei'|#ei'}#ei~O!q#ei~P(*yO!q#jO~P(*yO[#}O}#zO!q#jO'g#gO'x#hO'y#iO'z#iO'{#kO(O#|O(P#gO(Q#hO(R#fO(T#hOo#eiw#ei!l#ei!t#ei#O#ei#P#ei#p#ei'q#ei'|#ei'}#ei~O'r#ei~P(,rO'r#lO~P(,rO[#}O}#zO!q#jO#P:VO'g#gO'r#lO'x#hO'y#iO'z#iO'{#kO(O#|O(P#gO(Q#hO(R#fO(T#hOo#eiw#ei!l#ei!t#ei#O#ei#p#ei'q#ei'|#ei~O'}#ei~P(.kO'}#mO~P(.kOo:YO#O:YO#P:VOw#ni~P$1xOo:YO#O:YO#P:VOw#si~P$3yOQ'XXd'XX}'kX~Ow#zi~P#9vOw$Ui~P#9vOd9}O~Ow#ca~P#9vOd:uO~OU'x_'v'P'O'^s!y'^'T'Z~\",\n  goto: \"$Ku(vPPPPPPP(wPP)OPP)^PPPP)d-hP0f5aP7R7R8v7R>wD_DpPDvHQPPPPPPK`P! P! _PPPPP!!VP!$oP!$oPP!&oP!(rP!(w!)n!*f!*f!*f!(w!+]P!(w!.Q!.TPP!.ZP!(w!(w!(w!(wP!(w!(wP!(w!(w!.y!/dP!/dJ}J}J}PPPP!/d!.y!/sPP!$oP!0^!0a!0g!1h!1t!3t!3t!5r!7t!1t!1t!9p!;_!=O!>k!@U!Am!CS!De!1t!1tP!1tP!1t!1t!Et!1tP!Ge!1t!1tP!Ie!1tP!1t!7t!7t!1t!7t!1t!Kl!Mt!Mw!7t!1t!Mz!M}!M}!M}!NR!$oP!$oP!$oP! P! PP!N]! P! PP!Ni# }! PP! PP#!^##c##k#$Z#$_#$e#$e#$mP#&s#&s#&y#'o#'{! PP! PP#(]#(l! PP! PPP#(x#)W#)d#)|#)^! P! PP! P! P! PP#*S#*S#*Y#*`#*S#*S! P! PP#*m#*v#+Q#+Q#,x#.l#.x#.x#.{#.{5a5a5a5a5a5a5a5aP5a#/O#/U#/p#1{#2R#2b#6^#6d#6j#6|#7W#8w#9R#9b#9h#9n#9x#:S#:Y#:g#:m#:s#:}#;]#;g#=u#>R#>`#>f#>n#>u#?PPPPPPPP#?V#BaP#F^#Jx#Ls#Nr$&^P$&aPPP$)_$)h$)z$/U$1d$1m$3fP!(w$4`$7r$:i$>T$>^$>c$>fPPP$>i$A`$A|P$BaPPPPPPPPPP$BvP$EU$EX$E[$Eb$Ee$Eh$Ek$En$Et$HO$HR$HU$HX$H[$H_$Hb$He$Hh$Hk$Hn$Jt$Jw$Jz#*S$KW$K^$Ka$Kd$Kh$Kl$Ko$KrQ!tPT'V!s'Wi!SOlm!P!T$T$W$y%b)U*f/gQ'i#QR,n'l(OSOY[bfgilmop!O!P!T!Y!Z![!_!`!c!p!q!|!}#Q#U#Z#e#o#p#q#r#s#t#u#v#w#x#y#z#}$T$W$`$a$e$g$h$q$r$y%X%_%b&U&Y&[&b&u&z&|'P'a'l'n'o'}(W(Y(b(d(e(f(j(o(p(r(|)S)U)i*Z*f*i*k*l+Z+n+z,q,s,z-R-T-g-m-t.}/^/b/d/g0e0g0m0}1P1h1r1|3_3a3f3h3k4W4c4h4v4|5[5g5t6]6a7S7^7g7m7{8W8X8k8|9U9h9s9t9u9v9w9x9z9{9|9}:O:P:Q:R:S:T:U:V:W:X:Y:Z:e:f:gS(z$v-oQ*p&eQ*t&hQ-k(yQ-y)ZW0Z+Q0Y4Z7UR4Y0[&w!RObfgilmop!O!P!T!Y!Z![!_!`!c!p#Q#e#o#p#q#r#s#t#u#v#w#x#y#z#}$T$W$e$g$h$q$r$y%_%b&U&Y&[&b&u'l'}(W(Y(b(f(j(o(p(r(|)S)U)i*Z*f*i*k*l+Z+n,s,z-T-g-m-t.}/^/b/d/g0e0g0m0}1h1r1|3_3a3f3h3k4W4c4h4v4|5[5g5t6]6a7S7^7g7m7{8W8X8k8|9U9h9u9v9w9x9z9{:O:P:Q:R:S:T:U:V:W:X:Y:Z:e:f#r]Ofgilmp!O!P!T!Z![#e#o#p#q#r#s#t#u#v#w#x#y#z#}$T$W%_%b&Y&['}(W(Y(|)i+n,s,z-m.}0}1h1|3_3a3k4W4v4|5g5t6]7S7g7{8W8X8k8|9U9hb#[b#Q$y'l(b)S)U*Z-t!h$bo!c!p$e$g$h$q$r&U&b&u(f(j(o(p(r*f*k+Z-T-g/b/d/g0e0g0m1r3f4c4h5[6a7^7m$b%k!Q!n$O$u%o%p%q%y%{&P&o&p&r'](q)s)x)y*O*P*R*V*[*^*e*n*w*x+U+V+h+o+}-i-v.U.`.p.t.x.y/Z/[/{/}0`0r0w1O1Y1Z1y2a2h2j2m2s2v3V3u3{3|4R4U4_4e4t5`5d5v6R6Y6p6v6x7c7r8g!W:y!Y!_!`*i*l/^3h9u9v9w9x9z9{:O:P:Q:R:S:T:U:V:W:X:Y:Z:e:fR:|%n$_%u!Q!n$O$u%o%p%q&P&o&p&r'](q)s)x)y*O*P*R*V*[*^*e*n*w*x+U+V+h+o+}-i-v.U.`.p.t.x.y/Z/[/{/}0`0r0w1O1Y1Z1y2a2h2j2m2s2v3V3u3{3|4R4U4_4e4t5`5d5v6R6Y6p6v6x7c7r8g$e%l!Q!n$O$u%n%o%p%q%y%{&P&o&p&r'](q)s)x)y*O*P*R*V*[*^*e*n*w*x+U+V+h+o+}-i-v.U.`.p.t.x.y/Z/[/{/}0`0r0w1O1Y1Z1y2a2h2j2m2s2v3V3u3{3|4R4U4_4e4t5`5d5v6R6Y6p6v6x7c7r8g'hZOY[fgilmop!O!P!T!Y!Z![!_!`!c!p!|!}#e#o#p#q#r#s#t#u#v#w#x#y#z#}$T$W$`$a$e$g$h$q$r%_%b%i%j&U&Y&[&b&u'a'}(W(Y(d(e(f(j(o(p(r(|)i)p)q*f*i*k*l+Z+n,s,z-R-T-g-m.i.}/^/b/d/g0e0g0m0}1h1r1|3_3a3f3h3k4W4c4h4v4|5[5g5t6]6a7S7^7g7m7{8W8X8k8|9U9h9s9t9u9v9w9x9z9{9|9}:O:P:Q:R:S:T:U:V:W:X:Y:Z:`:a:e:f:g:t:u:x$^%l!Q!n$O$u%n%o%p%q%y%{&P&p&r(q)s)x)y*O*P*R*V*[*^*e*n*w*x+U+V+h+o+}-i-v.U.`.p.t.x.y/Z/[/{/}0`0r0w1O1Y1y2a2h2j2m2s2v3V3u3{3|4R4U4_4e4t5`5d5v6R6Y6p6v6x7c7r8gQ&j!hQ&k!iQ&l!jQ&m!kQ&s!oQ)[%QQ)]%RQ)^%SQ)_%TQ)b%WQ+`&oS,R']1ZQ.W)`S/r*u4TR4n0s+yTOY[bfgilmop!O!P!Q!T!Y!Z![!_!`!c!n!p!q!|!}#Q#U#Z#e#o#p#q#r#s#t#u#v#w#x#y#z#}$O$T$W$`$a$e$g$h$q$r$u$y%X%_%b%i%j%n%o%p%q%y%{&P&U&Y&[&b&o&p&r&u&z&|'P']'a'l'n'o'}(W(Y(b(d(e(f(j(o(p(q(r(|)S)U)i)p)q)s)x)y*O*P*R*V*Z*[*^*e*f*i*k*l*n*w*x+U+V+Z+h+n+o+z+},q,s,z-R-T-g-i-m-t-v.U.`.i.p.t.x.y.}/Z/[/^/b/d/g/{/}0`0e0g0m0r0w0}1O1P1Y1Z1h1r1y1|2a2h2j2m2s2v3V3_3a3f3h3k3u3{3|4R4U4W4_4c4e4h4t4v4|5[5`5d5g5t5v6R6Y6]6a6p6v6x7S7^7c7g7m7r7{8W8X8g8k8|9U9h9s9t9u9v9w9x9z9{9|9}:O:P:Q:R:S:T:U:V:W:X:Y:Z:`:a:e:f:g:t:u:xQ'[!xQ'h#PQ)l%gU)r%m*T*WR.f)kQ,T']R5P1Z#t%s!Q!n$O$u%p%q&P&p&r(q)x)y*O*R*V*[*^*e*n*w+V+h+o+}-i-v.U.`.t.x.y/Z/[/{/}0`0r0w1O1Y1y2a2h2j2m2v3V3u3{3|4U4e4t5`5d5v6R6Y6p6v6x7c7r8gQ)x%oQ+_&oQ,U']n,^'b'c'd,c,f,h,l/m/n1_3n3q5T5U7kS.q)s2sQ/O*PQ/Q*SQ/q*uS0Q*x4RQ0a+U[0o+Z.j0g4h5y7^Q2v.pS4d0e2rQ4m0sQ5Q1ZQ6T3RQ6z4PQ7O4TQ7X4_R9Y8h&jVOfgilmop!O!P!T!Y!Z![!_!`!c!p#e#o#p#q#r#s#t#u#v#w#x#y#z#}$T$W$e$g$h$q$r%_%b&U&Y&[&b&u']'}(W(Y(b(f(j(o(p(r(|)i*f*i*k*l+Z+n,s,z-T-g-m.}/^/b/d/g0e0g0m0}1Z1h1r1|3_3a3f3h3k4W4c4h4v4|5[5g5t6]6a7S7^7g7m7{8W8X8k8|9U9h9u9v9w9x9z9{:O:P:Q:R:S:T:U:V:W:X:Y:Z:e:fU&g!g%P%[o,^'b'c'd,c,f,h,l/m/n1_3n3q5T5U7k$nsOfgilm!O!P!T!Y!Z![!_!`#e#o#p#q#r#s#t#u#v#w#x#y#z#}$T$W%_%b&Y'}(W(Y(|)i*i*l+n,s,z-m.}/^0}1h1|3_3a3h3k4W4v4|5g5t6]7S7g7{8W8X8k8|9U9h9u9v9z9{:O:P:Q:R:S:T:U:V:W:X:Y:eS$tp9xS&O!W#bS&Q!X#cQ&`!bQ*_&RQ*a&VS*d&[:fQ*h&^Q,T']Q-j(wQ/i*jQ0p+[S2f.X0qQ3]/_Q3^/`Q3g/hQ3i/kQ5P1ZU5b2R2g4lU7o5c5e5rQ8]6dS8u7p7qS9_8v8wR9i9`i{Ob!O!P!T$y%_%b)S)U)i-thxOb!O!P!T$y%_%b)S)U)i-tW/v*v/t3w6qQ/}*wW0[+Q0Y4Z7UQ3{/{Q6x3|R8g6v!h$do!c!p$e$g$h$q$r&U&b&u(f(j(o(p(r*f*k+Z-T-g/b/d/g0e0g0m1r3f4c4h5[6a7^7mQ&d!dQ&f!fQ&n!mW&x!q%X&|1PQ'S!rQ)X$}Q)Y%OQ)a%VU)d%Y'T'UQ*s&hS+s&z'PS-Y(k1sQ-u)WQ-x)ZS.a)e)fS0x+c/sQ1S+zQ1W+{S1v-_-`Q2k.bQ3s/pQ5]1xR5h2V${sOfgilmp!O!P!T!Y!Z![!_!`#e#o#p#q#r#s#t#u#v#w#x#y#z#}$T$W%_%b&Y&['}(W(Y(|)i*i*l+n,s,z-m.}/^0}1h1|3_3a3h3k4W4v4|5g5t6]7S7g7{8W8X8k8|9U9h9u9v9w9x9z9{:O:P:Q:R:S:T:U:V:W:X:Y:Z:e:f$zsOfgilmp!O!P!T!Y!Z![!_!`#e#o#p#q#r#s#t#u#v#w#x#y#z#}$T$W%_%b&Y&['}(W(Y(|)i*i*l+n,s,z-m.}/^0}1h1|3_3a3h3k4W4v4|5g5t6]7S7g7{8W8X8k8|9U9h9u9v9w9x9z9{:O:P:Q:R:S:T:U:V:W:X:Y:Z:e:fR3]/_V&T!Y!`*i!i$lo!c!p$e$g$h$q$r&U&b&u(f(j(o(p(r*f*k+Z-T-g/b/d/g0e0g0m1r3f4c4h5[6a7^7m!k$^o!c!p$e$g$h$q$r&U&b&u(b(f(j(o(p(r*f*k+Z-T-g/b/d/g0e0g0m1r3f4c4h5[6a7^7m!i$co!c!p$e$g$h$q$r&U&b&u(f(j(o(p(r*f*k+Z-T-g/b/d/g0e0g0m1r3f4c4h5[6a7^7m&e^Ofgilmop!O!P!T!Y!Z![!_!`!c!p#e#o#p#q#r#s#t#u#v#w#x#y#z#}$T$W$e$g$h$q$r%_%b&U&Y&[&b&u'}(W(Y(f(j(o(p(r(|)i*f*i*k*l+Z+n,s,z-T-g-m.}/^/b/d/g0e0g0m0}1h1r1|3_3a3f3h3k4W4c4h4v4|5[5g5t6]6a7S7^7g7m7{8W8X8k8|9U9h9u9v9w9x9z9{:O:P:Q:R:S:T:U:V:W:X:Y:Z:e:fR(l$fQ-[(kR5Y1sQ(S#|S({$v-oS-Z(k1sQ-l(yW/u*v/t3w6qS1w-_-`Q3v/vR5^1xQ'e#Or,e'b'c'd'j'p)u,c,f,h,l/m/n1_3n3q5U6fR,o'mk,a'b'c'd,c,f,h,l/m/n1_3n3q5UQ'f#Or,e'b'c'd'j'p)u,c,f,h,l/m/n1_3n3q5U6fR,p'mR*g&]X/c*f/d/g3f!}aOb!O!P!T#z$v$y%_%b'}(y)S)U)i)s*f*v*w+Q+Z,s-o-t.j/b/d/g/t/{0Y0g1h2s3f3w3|4Z4h5y6a6q6v7U7^Q3`/aQ6_3bQ8Y6`R9V8Z${rOfgilmp!O!P!T!Y!Z![!_!`#e#o#p#q#r#s#t#u#v#w#x#y#z#}$T$W%_%b&Y&['}(W(Y(|)i*i*l+n,s,z-m.}/^0}1h1|3_3a3h3k4W4v4|5g5t6]7S7g7{8W8X8k8|9U9h9u9v9w9x9z9{:O:P:Q:R:S:T:U:V:W:X:Y:Z:e:f#nfOfglmp!O!P!T!Z![#e#o#p#q#r#s#t#u#v#w#x#z#}$T$W%_%b&Y&['}(W(Y(|)i+n,s,z-m.}0}1h1|3_3a3k4W4v4|5g5t6]7S7g7{8W8X8k8|9U9h!T9u!Y!_!`*i*l/^3h9u9v9x9z9{:O:P:Q:R:S:T:U:V:W:X:Y:e:f#rfOfgilmp!O!P!T!Z![#e#o#p#q#r#s#t#u#v#w#x#y#z#}$T$W%_%b&Y&['}(W(Y(|)i+n,s,z-m.}0}1h1|3_3a3k4W4v4|5g5t6]7S7g7{8W8X8k8|9U9h!X9u!Y!_!`*i*l/^3h9u9v9w9x9z9{:O:P:Q:R:S:T:U:V:W:X:Y:Z:e:f$srOfglmp!O!P!T!Y!Z![!_!`#e#o#p#q#r#s#t#u#v#w#x#z#}$T$W%_%b&Y&['}(W(Y(|)i*i*l+n,s,z-m.}/^0}1h1|3_3a3h3k4W4v4|5g5t6]7S7g7{8W8X8k8|9U9h9u9v9x9z9{:O:P:Q:R:S:T:U:V:W:X:Y:e:f#U#oh#d$P$Q$V$s%^&W&X'q't'u'v'w'x'y'z'{'|(O(U([(`*b*c,r,w,y-n0z1i1l1}3P4w5V5a6^6e7R7e7h7s7y8j8q8{9[9b}:P&S&]/k3[6d:[:]:c:d:h:j:k:l:m:n:o:p:q:r:v:w:{#W#ph#d$P$Q$V$s%^&W&X'q'r't'u'v'w'x'y'z'{'|(O(U([(`*b*c,r,w,y-n0z1i1l1}3P4w5V5a6^6e7R7e7h7s7y8j8q8{9[9b!P:Q&S&]/k3[6d:[:]:c:d:h:i:j:k:l:m:n:o:p:q:r:v:w:{#S#qh#d$P$Q$V$s%^&W&X'q'u'v'w'x'y'z'{'|(O(U([(`*b*c,r,w,y-n0z1i1l1}3P4w5V5a6^6e7R7e7h7s7y8j8q8{9[9b{:R&S&]/k3[6d:[:]:c:d:h:k:l:m:n:o:p:q:r:v:w:{#Q#rh#d$P$Q$V$s%^&W&X'q'v'w'x'y'z'{'|(O(U([(`*b*c,r,w,y-n0z1i1l1}3P4w5V5a6^6e7R7e7h7s7y8j8q8{9[9by:S&S&]/k3[6d:[:]:c:d:h:l:m:n:o:p:q:r:v:w:{#O#sh#d$P$Q$V$s%^&W&X'q'w'x'y'z'{'|(O(U([(`*b*c,r,w,y-n0z1i1l1}3P4w5V5a6^6e7R7e7h7s7y8j8q8{9[9bw:T&S&]/k3[6d:[:]:c:d:h:m:n:o:p:q:r:v:w:{!|#th#d$P$Q$V$s%^&W&X'q'x'y'z'{'|(O(U([(`*b*c,r,w,y-n0z1i1l1}3P4w5V5a6^6e7R7e7h7s7y8j8q8{9[9bu:U&S&]/k3[6d:[:]:c:d:h:n:o:p:q:r:v:w:{!x#vh#d$P$Q$V$s%^&W&X'q'z'{'|(O(U([(`*b*c,r,w,y-n0z1i1l1}3P4w5V5a6^6e7R7e7h7s7y8j8q8{9[9bq:W&S&]/k3[6d:[:]:c:d:h:p:q:r:v:w:{!v#wh#d$P$Q$V$s%^&W&X'q'{'|(O(U([(`*b*c,r,w,y-n0z1i1l1}3P4w5V5a6^6e7R7e7h7s7y8j8q8{9[9bo:X&S&]/k3[6d:[:]:c:d:h:q:r:v:w:{$]#{h#`#d$P$Q$V$s%^&S&W&X&]'q'r's't'u'v'w'x'y'z'{'|(O(U([(`*b*c,r,w,y-n/k0z1i1l1}3P3[4w5V5a6^6d6e7R7e7h7s7y8j8q8{9[9b:[:]:c:d:h:i:j:k:l:m:n:o:p:q:r:v:w:{${jOfgilmp!O!P!T!Y!Z![!_!`#e#o#p#q#r#s#t#u#v#w#x#y#z#}$T$W%_%b&Y&['}(W(Y(|)i*i*l+n,s,z-m.}/^0}1h1|3_3a3h3k4W4v4|5g5t6]7S7g7{8W8X8k8|9U9h9u9v9w9x9z9{:O:P:Q:R:S:T:U:V:W:X:Y:Z:e:f$v!aOfgilmp!O!P!T!Y!Z!_!`#e#o#p#q#r#s#t#u#v#w#x#y#z#}$T$W%_%b&Y&['}(W(Y(|)i*i*l+n,s,z-m.}/^0}1h1|3_3a3h3k4W4v4|5g5t6]7S7g7{8W8X8k8|9U9h9u9v9w9x9z:O:P:Q:R:S:T:U:V:W:X:Y:Z:e:fQ&Y![Q&Z!]R:e9{#rpOfgilmp!O!P!T!Z![#e#o#p#q#r#s#t#u#v#w#x#y#z#}$T$W%_%b&Y&['}(W(Y(|)i+n,s,z-m.}0}1h1|3_3a3k4W4v4|5g5t6]7S7g7{8W8X8k8|9U9hQ&[!^!W9x!Y!_!`*i*l/^3h9u9v9w9x9z9{:O:P:Q:R:S:T:U:V:W:X:Y:Z:e:fR:f:zR$moR-f(rR$wqT(}$v-oQ/f*fS3d/d/gR6c3fQ3m/mQ3p/nQ6i3nR6l3qQ$zwQ)V${Q*q&fQ+f&qQ+i&sQ-w)YW.Z)b+j+k+lS/X*]+gW2b.W.[.].^U3W/Y/]0yU5o2c2d2eS6W3X3ZS7w5p5qS8Q6V6XQ8y7xS8}8R8SR9c9O^|O!O!P!T%_%b)iX)R$y)S)U-tQ&r!nQ*^&PQ*|&jQ+P&kQ+T&lQ+W&mQ+]&nQ+l&sQ-})[Q.Q)]Q.T)^Q.V)_Q.Y)aQ.^)bQ2S-uQ2e.WR4U0VU+a&o*u4TR4o0sQ+Y&mQ+k&sS.])b+l^0v+_+`/q/r4m4n7OS2d.W.^S4Q0R0SR5q2eS0R*x4RQ0a+UR7X4_U+d&o*u4TR4p0sQ*z&jQ+O&kQ+S&lQ+g&qQ+j&sS-{)[*|S.P)]+PS.S)^+TU.[)b+k+lQ/Y*]Q0X*{Q0q+[Q2X-|Q2Y-}Q2].QQ2_.TU2c.W.].^Q2g.XS3Z/]0yS5c2R4lQ5j2ZS5p2d2eQ6X3XS7q5e5rQ7x5qQ8R6VQ8v7pQ9O8SR9`8wQ0T*xR6|4RQ*y&jQ*}&kU-z)[*z*|U.O)]+O+PS2W-{-}S2[.P.QQ4X0ZQ5i2YQ5k2]R7T4YQ/w*vQ3t/tQ6r3wR8d6qQ*{&jS-|)[*|Q2Z-}Q4X0ZR7T4YQ+R&lU.R)^+S+TS2^.S.TR5l2_Q0]+QQ4V0YQ7V4ZR8l7UQ+[&nS.X)a+]S2R-u.YR5e2SQ0i+ZQ4f0gQ7`4hR8m7^Q.m)sQ0i+ZQ2p.jQ4f0gQ5|2sQ7`4hQ7}5yR8m7^Q0i+ZR4f0gX'O!q%X&|1PX&{!q%X&|1PW'O!q%X&|1PS+u&z'PR1U+z_|O!O!P!T%_%b)iQ%a!PS)h%_%bR.d)i$^%u!Q!n$O$u%o%p%q&P&o&p&r'](q)s)x)y*O*P*R*V*[*^*e*n*w*x+U+V+h+o+}-i-v.U.`.p.t.x.y/Z/[/{/}0`0r0w1O1Y1Z1y2a2h2j2m2s2v3V3u3{3|4R4U4_4e4t5`5d5v6R6Y6p6v6x7c7r8gQ*U%yR*X%{$c%n!Q!n$O$u%o%p%q%y%{&P&o&p&r'](q)s)x)y*O*P*R*V*[*^*e*n*w*x+U+V+h+o+}-i-v.U.`.p.t.x.y/Z/[/{/}0`0r0w1O1Y1Z1y2a2h2j2m2s2v3V3u3{3|4R4U4_4e4t5`5d5v6R6Y6p6v6x7c7r8gW)t%m%x*T*WQ.e)jR2{.vR.m)sR5|2sQ'W!sR,O'WQ!TOQ$TlQ$WmQ%b!P[%|!T$T$W%b)U/gQ)U$yR/g*f$b%i!Q!n$O$u%o%p%q%y%{&P&o&p&r'](q)s)x)y*O*P*R*V*[*^*e*n*w*x+U+V+h+o+}-i-v.U.`.p.t.x.y/Z/[/{/}0`0r0w1O1Y1Z1y2a2h2j2m2s2v3V3u3{3|4R4U4_4e4t5`5d5v6R6Y6p6v6x7c7r8g[)n%i)p.i:`:t:xQ)p%jQ.i)qQ:`%nQ:t:aR:x:uQ!vUR'Y!vS!OO!TU%]!O%_)iQ%_!PR)i%b#rYOfgilmp!O!P!T!Z![#e#o#p#q#r#s#t#u#v#w#x#y#z#}$T$W%_%b&Y&['}(W(Y(|)i+n,s,z-m.}0}1h1|3_3a3k4W4v4|5g5t6]7S7g7{8W8X8k8|9U9hh!yY!|#U$`'a'n(d,q-R9s9|:gQ!|[b#Ub#Q$y'l(b)S)U*Z-t!h$`o!c!p$e$g$h$q$r&U&b&u(f(j(o(p(r*f*k+Z-T-g/b/d/g0e0g0m1r3f4c4h5[6a7^7mQ'a!}Q'n#ZQ(d$aQ,q'oQ-R(e!W9s!Y!_!`*i*l/^3h9u9v9w9x9z9{:O:P:Q:R:S:T:U:V:W:X:Y:Z:e:fQ9|9tR:g9}Q-U(gR1p-UQ1t-[R5Z1tQ,c'bQ,f'cQ,h'dW1`,c,f,h5UR5U1_Q/d*fS3c/d3fR3f/gfbO!O!P!T$y%_%b)S)U)i-tp#Wb'}(y.j/b/t/{0Y0g1h5y6a6q6v7U7^Q'}#zS(y$v-oQ.j)sW/b*f/d/g3fQ/t*vQ/{*wQ0Y+QQ0g+ZQ1h,sQ5y2sQ6q3wQ6v3|Q7U4ZR7^4hQ,t(OQ1g,rT1j,t1gS(X$Q([Q(^$VU,x(X(^,}R,}(`Q(s$mR-h(sQ-p)OR2P-pQ3n/mQ3q/nT6j3n3qQ)S$yS-r)S-tR-t)UQ4`0aR7Y4``0t+^+_+`+a+d/q/r7OR4q0tQ8i6zR9Z8iQ4S0TR6}4SQ3x/wQ6n3tT6s3x6nQ3}/|Q6t3zU6y3}6t8eR8e6uQ4[0]Q7Q4VT7W4[7QhzOb!O!P!T$y%_%b)S)U)i-tQ$|xW%Zz$|%f)v$b%f!Q!n$O$u%o%p%q%y%{&P&o&p&r'](q)s)x)y*O*P*R*V*[*^*e*n*w*x+U+V+h+o+}-i-v.U.`.p.t.x.y/Z/[/{/}0`0r0w1O1Y1Z1y2a2h2j2m2s2v3V3u3{3|4R4U4_4e4t5`5d5v6R6Y6p6v6x7c7r8gR)v%nS4i0i0nS7]4f4gT7b4i7]W&z!q%X&|1PS+r&z+zR+z'PQ1Q+wR4z1QU1[,S,T,UR5R1[S3S/Q7OR6U3SQ2t.mQ5x2pT5}2t5xQ.z)zR3O.z^_O!O!P!T%_%b)iY#Xb$y)S)U-t$l#_fgilmp!Y!Z![!_!`#e#o#p#q#r#s#t#u#v#w#x#y#z#}$T$W&Y&['}(W(Y(|*i*l+n,s,z-m.}/^0}1h1|3_3a3h3k4W4v4|5g5t6]7S7g7{8W8X8k8|9U9h9u9v9w9x9z9{:O:P:Q:R:S:T:U:V:W:X:Y:Z:e:f!h$io!c!p$e$g$h$q$r&U&b&u(f(j(o(p(r*f*k+Z-T-g/b/d/g0e0g0m1r3f4c4h5[6a7^7mS'j#Q'lQ-P(bR/V*Z&v!RObfgilmop!O!P!T!Y!Z![!_!`!c!p#Q#e#o#p#q#r#s#t#u#v#w#x#y#z#}$T$W$e$g$h$q$r$y%_%b&U&Y&[&b&u'l'}(W(Y(b(f(j(o(p(r(|)S)U)i*Z*f*i*k*l+Z+n,s,z-T-g-m-t.}/^/b/d/g0e0g0m0}1h1r1|3_3a3f3h3k4W4c4h4v4|5[5g5t6]6a7S7^7g7m7{8W8X8k8|9U9h9u9v9w9x9z9{:O:P:Q:R:S:T:U:V:W:X:Y:Z:e:f[!{Y[#U#Z9s9tW&{!q%X&|1P['`!|!}'n'o9|9}S(c$`$aS+t&z'PU,X'a,q:gS-Q(d(eQ1T+zR1n-RS%t!Q&oQ&q!nQ(V$OQ(w$uS)w%o.pQ)z%pQ)}%qS*]&P&rQ+e&pQ,S']Q-d(qQ.l)sU.w)x)y2vS/O*O*PQ/P*RQ/T*VQ/W*[Q/]*^Q/`*eQ/l*nQ/|*wS0S*x4RQ0a+UQ0c+VQ0y+hQ0{+oQ1X+}Q1{-iQ2T-vQ2`.UQ2i.`Q2z.tQ2|.xQ2}.yQ3X/ZQ3Y/[S3z/{/}Q4^0`Q4l0rQ4s0wQ4x1OQ4}1YQ5O1ZQ5_1yQ5n2aQ5r2hQ5u2jQ5w2mQ5{2sQ6V3VQ6o3uQ6u3{Q6w3|Q7P4UQ7X4_Q7[4eQ7d4tQ7n5`Q7p5dQ7|5vQ8P6RQ8S6YQ8c6pS8f6v6xQ8o7cQ8w7rR9X8g$^%m!Q!n$O$u%o%p%q&P&o&p&r'](q)s)x)y*O*P*R*V*[*^*e*n*w*x+U+V+h+o+}-i-v.U.`.p.t.x.y/Z/[/{/}0`0r0w1O1Y1Z1y2a2h2j2m2s2v3V3u3{3|4R4U4_4e4t5`5d5v6R6Y6p6v6x7c7r8gQ)j%nQ*T%yR*W%{$y%h!Q!n$O$u%i%j%n%o%p%q%y%{&P&o&p&r'](q)p)q)s)x)y*O*P*R*V*[*^*e*n*w*x+U+V+h+o+}-i-v.U.`.i.p.t.x.y/Z/[/{/}0`0r0w1O1Y1Z1y2a2h2j2m2s2v3V3u3{3|4R4U4_4e4t5`5d5v6R6Y6p6v6x7c7r8g:`:a:t:u:x'pWOY[bfgilmop!O!P!T!Y!Z![!_!`!c!p!|!}#Q#U#Z#e#o#p#q#r#s#t#u#v#w#x#y#z#}$T$W$`$a$e$g$h$q$r$y%_%b&U&Y&[&b&u'a'l'n'o'}(W(Y(b(d(e(f(j(o(p(r(|)S)U)i*Z*f*i*k*l+Z+n,q,s,z-R-T-g-m-t.}/^/b/d/g0e0g0m0}1h1r1|3_3a3f3h3k4W4c4h4v4|5[5g5t6]6a7S7^7g7m7{8W8X8k8|9U9h9s9t9u9v9w9x9z9{9|9}:O:P:Q:R:S:T:U:V:W:X:Y:Z:e:f:g$x%g!Q!n$O$u%i%j%n%o%p%q%y%{&P&o&p&r'](q)p)q)s)x)y*O*P*R*V*[*^*e*n*w*x+U+V+h+o+}-i-v.U.`.i.p.t.x.y/Z/[/{/}0`0r0w1O1Y1Z1y2a2h2j2m2s2v3V3u3{3|4R4U4_4e4t5`5d5v6R6Y6p6v6x7c7r8g:`:a:t:u:x_&y!q%X&z&|'P+z1PR,V']$zrOfgilmp!O!P!T!Y!Z![!_!`#e#o#p#q#r#s#t#u#v#w#x#y#z#}$T$W%_%b&Y&['}(W(Y(|)i*i*l+n,s,z-m.}/^0}1h1|3_3a3h3k4W4v4|5g5t6]7S7g7{8W8X8k8|9U9h9u9v9w9x9z9{:O:P:Q:R:S:T:U:V:W:X:Y:Z:e:f!j$]o!c!p$e$g$h$q$r&U&b&u(b(f(j(o(p(r*f*k+Z-T-g/b/d/g0e0g0m1r3f4c4h5[6a7^7mQ,T']R5P1Z_}O!O!P!T%_%b)i^|O!O!P!T%_%b)iQ#YbX)R$y)S)U-tbhO!O!T3_6]8W8X9U9hS#`f9uQ#dgQ$PiQ$QlQ$VmQ$spW%^!P%_%b)iU&S!Y!`*iQ&W!ZQ&X![Q&]!_Q'q#eQ'r#oS's#p:QQ't#qQ'u#rQ'v#sQ'w#tQ'x#uQ'y#vQ'z#wQ'{#xQ'|#yQ(O#zQ(U#}Q([$TQ(`$WQ*b&YQ*c&[Q,r'}Q,w(WQ,y(YQ-n(|Q/k*lQ0z+nQ1i,sQ1l,zQ1}-mQ3P.}Q3[/^Q4w0}Q5V1hQ5a1|Q6^3aQ6d3hQ6e3kQ7R4WQ7e4vQ7h4|Q7s5gQ7y5tQ8j7SQ8q7gQ8{7{Q9[8kQ9b8|Q:[9wQ:]9xQ:c9zQ:d9{Q:h:OQ:i:PQ:j:RQ:k:SQ:l:TQ:m:UQ:n:VQ:o:WQ:p:XQ:q:YQ:r:ZQ:v:eQ:w:fR:{9v^tO!O!P!T%_%b)i$`#afgilmp!Y!Z![!_!`#e#o#p#q#r#s#t#u#v#w#x#y#z#}$T$W&Y&['}(W(Y(|*i*l+n,s,z-m.}/^0}1h1|3a3h3k4W4v4|5g5t7S7g7{8k8|9u9v9w9x9z9{:O:P:Q:R:S:T:U:V:W:X:Y:Z:e:fQ6[3_Q8V6]Q9R8WQ9T8XQ9g9UR9m9hQ&V!YQ&^!`R/h*iQ$joQ&a!cQ&t!pU(g$e$g(jS(n$h0eQ(u$qQ(v$rQ*`&UQ*m&bQ+p&uQ-S(fS-b(o4cQ-c(pQ-e(rW/a*f/d/g3fQ/j*kW0f+Z0g4h7^Q1o-TQ1z-gQ3b/bQ4k0mQ5X1rQ7l5[Q8Z6aR8t7m!h$_o!c!p$e$g$h$q$r&U&b&u(f(j(o(p(r*f*k+Z-T-g/b/d/g0e0g0m1r3f4c4h5[6a7^7mR-P(b'qXOY[bfgilmop!O!P!T!Y!Z![!_!`!c!p!|!}#Q#U#Z#e#o#p#q#r#s#t#u#v#w#x#y#z#}$T$W$`$a$e$g$h$q$r$y%_%b&U&Y&[&b&u'a'l'n'o'}(W(Y(b(d(e(f(j(o(p(r(|)S)U)i*Z*f*i*k*l+Z+n,q,s,z-R-T-g-m-t.}/^/b/d/g0e0g0m0}1h1r1|3_3a3f3h3k4W4c4h4v4|5[5g5t6]6a7S7^7g7m7{8W8X8k8|9U9h9s9t9u9v9w9x9z9{9|9}:O:P:Q:R:S:T:U:V:W:X:Y:Z:e:f:g$zqOfgilmp!O!P!T!Y!Z![!_!`#e#o#p#q#r#s#t#u#v#w#x#y#z#}$T$W%_%b&Y&['}(W(Y(|)i*i*l+n,s,z-m.}/^0}1h1|3_3a3h3k4W4v4|5g5t6]7S7g7{8W8X8k8|9U9h9u9v9w9x9z9{:O:P:Q:R:S:T:U:V:W:X:Y:Z:e:f!i$fo!c!p$e$g$h$q$r&U&b&u(f(j(o(p(r*f*k+Z-T-g/b/d/g0e0g0m1r3f4c4h5[6a7^7m&d^Ofgilmop!O!P!T!Y!Z![!_!`!c!p#e#o#p#q#r#s#t#u#v#w#x#y#z#}$T$W$e$g$h$q$r%_%b&U&Y&[&b&u'}(W(Y(f(j(o(p(r(|)i*f*i*k*l+Z+n,s,z-T-g-m.}/^/b/d/g0e0g0m0}1h1r1|3_3a3f3h3k4W4c4h4v4|5[5g5t6]6a7S7^7g7m7{8W8X8k8|9U9h9u9v9w9x9z9{:O:P:Q:R:S:T:U:V:W:X:Y:Z:e:f[!zY[$`$a9s9t['_!|!}(d(e9|9}W)o%i%j:`:aU,W'a-R:gW.h)p)q:t:uT2o.i:xQ(i$eQ(m$gR-W(jV(h$e$g(jR-^(kR-](k$znOfgilmp!O!P!T!Y!Z![!_!`#e#o#p#q#r#s#t#u#v#w#x#y#z#}$T$W%_%b&Y&['}(W(Y(|)i*i*l+n,s,z-m.}/^0}1h1|3_3a3h3k4W4v4|5g5t6]7S7g7{8W8X8k8|9U9h9u9v9w9x9z9{:O:P:Q:R:S:T:U:V:W:X:Y:Z:e:f!i$ko!c!p$e$g$h$q$r&U&b&u(f(j(o(p(r*f*k+Z-T-g/b/d/g0e0g0m1r3f4c4h5[6a7^7mS'g#O'pj,a'b'c'd,c,f,h,l/m/n1_3n3q5UQ,m'jQ.u)uR8_6f`,b'b'c'd,c,f,h1_5UQ1e,lX3l/m/n3n3qj,a'b'c'd,c,f,h,l/m/n1_3n3q5UQ7j5TR8s7k^uO!O!P!T%_%b)i$`#afgilmp!Y!Z![!_!`#e#o#p#q#r#s#t#u#v#w#x#y#z#}$T$W&Y&['}(W(Y(|*i*l+n,s,z-m.}/^0}1h1|3a3h3k4W4v4|5g5t7S7g7{8k8|9u9v9w9x9z9{:O:P:Q:R:S:T:U:V:W:X:Y:Z:e:fQ6Z3_Q8U6]Q9Q8WQ9S8XQ9f9UR9l9hR(Q#zR(P#zQ$SlR(]$TR$ooR$noR)Q$vR)P$vQ)O$vR2O-ohwOb!O!P!T$y%_%b)S)U)i-t$l!lz!Q!n$O$u$|%f%n%o%p%q%y%{&P&o&p&r'](q)s)v)x)y*O*P*R*V*[*^*e*n*w*x+U+V+h+o+}-i-v.U.`.p.t.x.y/Z/[/{/}0`0r0w1O1Y1Z1y2a2h2j2m2s2v3V3u3{3|4R4U4_4e4t5`5d5v6R6Y6p6v6x7c7r8gR${xR0b+UR0W*xR0U*xR6{4PR/y*vR/x*vR0P*wR0O*wR0_+QR0^+Q%XyObxz!O!P!Q!T!n$O$u$y$|%_%b%f%n%o%p%q%y%{&P&o&p&r'](q)S)U)i)s)v)x)y*O*P*R*V*[*^*e*n*w*x+U+V+h+o+}-i-t-v.U.`.p.t.x.y/Z/[/{/}0`0r0w1O1Y1Z1y2a2h2j2m2s2v3V3u3{3|4R4U4_4e4t5`5d5v6R6Y6p6v6x7c7r8gR0k+ZR0j+ZQ'R!qQ)c%XQ+w&|R4y1PX'Q!q%X&|1PR+y&|R+x&|T/S*S4TT/R*S4TR.o)sR.n)sR){%p\",\n  nodeNames: \"⚠ | < > RawString Float LineComment BlockComment SourceFile ] InnerAttribute ! [ MetaItem self Metavariable super crate Identifier ScopedIdentifier :: QualifiedScope AbstractType impl SelfType MetaType TypeIdentifier ScopedTypeIdentifier ScopeIdentifier TypeArgList TypeBinding = Lifetime String Escape Char Boolean Integer } { Block ; ConstItem Vis pub ( in ) const BoundIdentifier : UnsafeBlock unsafe AsyncBlock async move IfExpression if LetDeclaration let LiteralPattern ArithOp MetaPattern SelfPattern ScopedIdentifier TuplePattern ScopedTypeIdentifier , StructPattern FieldPatternList FieldPattern ref mut FieldIdentifier .. RefPattern SlicePattern CapturedPattern ReferencePattern & MutPattern RangePattern ... OrPattern MacroPattern ParenthesizedTokens TokenBinding Identifier TokenRepetition ArithOp BitOp LogicOp UpdateOp CompareOp -> => ArithOp BracketedTokens BracedTokens _ else MatchExpression match MatchBlock MatchArm Attribute Guard UnaryExpression ArithOp DerefOp LogicOp ReferenceExpression TryExpression BinaryExpression ArithOp ArithOp BitOp BitOp BitOp BitOp LogicOp LogicOp AssignmentExpression TypeCastExpression as ReturnExpression return RangeExpression CallExpression ArgList AwaitExpression await FieldExpression GenericFunction BreakExpression break LoopLabel ContinueExpression continue IndexExpression ArrayExpression TupleExpression MacroInvocation UnitExpression ClosureExpression ParamList Parameter Parameter ParenthesizedExpression StructExpression FieldInitializerList ShorthandFieldInitializer FieldInitializer BaseFieldInitializer MatchArm WhileExpression while LoopExpression loop ForExpression for MacroInvocation MacroDefinition macro_rules MacroRule EmptyStatement ModItem mod DeclarationList AttributeItem ForeignModItem extern StructItem struct TypeParamList ConstrainedTypeParameter TraitBounds HigherRankedTraitBound RemovedTraitBound OptionalTypeParameter ConstParameter WhereClause where LifetimeClause TypeBoundClause FieldDeclarationList FieldDeclaration OrderedFieldDeclarationList UnionItem union EnumItem enum EnumVariantList EnumVariant TypeItem type FunctionItem default fn ParamList Parameter SelfParameter VariadicParameter VariadicParameter ImplItem TraitItem trait AssociatedType LetDeclaration UseDeclaration use ScopedIdentifier UseAsClause ScopedIdentifier UseList ScopedUseList UseWildcard ExternCrateDeclaration StaticItem static ExpressionStatement ExpressionStatement GenericType FunctionType ForLifetimes ParamList VariadicParameter Parameter VariadicParameter Parameter ReferenceType PointerType TupleType UnitType ArrayType MacroInvocation EmptyType DynamicType dyn BoundedType\",\n  maxTerm: 359,\n  nodeProps: [\n    [\"group\", -42,4,5,14,15,16,17,18,19,33,35,36,37,40,51,53,56,101,107,111,112,113,122,123,125,127,128,130,132,133,134,137,139,140,141,142,143,144,148,149,155,157,159,\"Expression\",-16,22,24,25,26,27,222,223,230,231,232,233,234,235,236,237,239,\"Type\",-20,42,161,162,165,166,169,170,172,188,190,194,196,204,205,207,208,209,217,218,220,\"Statement\",-17,49,60,62,63,64,65,68,74,75,76,77,78,80,81,83,84,99,\"Pattern\"],\n    [\"openedBy\", 9,\"[\",38,\"{\",47,\"(\"],\n    [\"closedBy\", 12,\"]\",39,\"}\",45,\")\"]\n  ],\n  propSources: [rustHighlighting],\n  skippedNodes: [0,6,7,240],\n  repeatNodeCount: 32,\n  tokenData: \"$%h_R!XOX$nXY5gYZ6iZ]$n]^5g^p$npq5gqr7Xrs9cst:Rtu;Tuv>vvwAQwxCbxy!+Tyz!,Vz{!-X{|!/_|}!0g}!O!1i!O!P!3v!P!Q!8[!Q!R!Bw!R![!Dr![!]#+q!]!^#-{!^!_#.}!_!`#1b!`!a#3o!a!b#6S!b!c#7U!c!}#8W!}#O#:T#O#P#;V#P#Q#Cb#Q#R#Dd#R#S#8W#S#T$n#T#U#8W#U#V#El#V#f#8W#f#g#Ic#g#o#8W#o#p$ S#p#q$!U#q#r$$f#r${$n${$|#8W$|4w$n4w5b#8W5b5i$n5i6S#8W6S;'S$n;'S;=`4s<%lO$nU$u]'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$nU%uV'_Q'OSOz&[z{&v{!P&[!P!Q'x!Q;'S&[;'S;=`*s<%lO&[S&aV'OSOz&[z{&v{!P&[!P!Q'x!Q;'S&[;'S;=`*s<%lO&[S&yVOz'`z{&v{!P'`!P!Q*y!Q;'S'`;'S;=`*m<%lO'`S'cVOz&[z{&v{!P&[!P!Q'x!Q;'S&[;'S;=`*s<%lO&[S'{UOz'`{!P'`!P!Q(_!Q;'S'`;'S;=`*m<%lO'`S(bUOz(t{!P(t!P!Q(_!Q;'S(t;'S;=`*a<%lO(tS(wVOz)^z{)z{!P)^!P!Q(_!Q;'S)^;'S;=`*g<%lO)^S)eV'PS'OSOz)^z{)z{!P)^!P!Q(_!Q;'S)^;'S;=`*g<%lO)^S)}UOz(tz{)z{!P(t!Q;'S(t;'S;=`*a<%lO(tS*dP;=`<%l(tS*jP;=`<%l)^S*pP;=`<%l'`S*vP;=`<%l&[S+OO'PSU+T]'_QOY+|YZ-xZr+|rs'`sz+|z{+O{!P+|!P!Q4y!Q#O+|#O#P'`#P;'S+|;'S;=`4m<%lO+|U,R]'_QOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$nU-P]'_QOY+|YZ-xZr+|rs'`sz+|z{.d{!P+|!P!Q/Z!Q#O+|#O#P'`#P;'S+|;'S;=`4m<%lO+|U-}V'_QOz&[z{&v{!P&[!P!Q'x!Q;'S&[;'S;=`*s<%lO&[Q.iV'_QOY.dYZ/OZr.ds#O.d#P;'S.d;'S;=`/T<%lO.dQ/TO'_QQ/WP;=`<%l.dU/`]'_QOY0XYZ3uZr0Xrs(tsz0Xz{.d{!P0X!P!Q/Z!Q#O0X#O#P(t#P;'S0X;'S;=`4a<%lO0XU0^]'_QOY1VYZ2XZr1Vrs)^sz1Vz{2w{!P1V!P!Q/Z!Q#O1V#O#P)^#P;'S1V;'S;=`4g<%lO1VU1`]'_Q'PS'OSOY1VYZ2XZr1Vrs)^sz1Vz{2w{!P1V!P!Q/Z!Q#O1V#O#P)^#P;'S1V;'S;=`4g<%lO1VU2bV'_Q'PS'OSOz)^z{)z{!P)^!P!Q(_!Q;'S)^;'S;=`*g<%lO)^U2|]'_QOY0XYZ3uZr0Xrs(tsz0Xz{2w{!P0X!P!Q.d!Q#O0X#O#P(t#P;'S0X;'S;=`4a<%lO0XU3zV'_QOz)^z{)z{!P)^!P!Q(_!Q;'S)^;'S;=`*g<%lO)^U4dP;=`<%l0XU4jP;=`<%l1VU4pP;=`<%l+|U4vP;=`<%l$nU5QV'_Q'PSOY.dYZ/OZr.ds#O.d#P;'S.d;'S;=`/T<%lO.d_5p]'_Q&|X'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_6rV'_Q&|X'OSOz&[z{&v{!P&[!P!Q'x!Q;'S&[;'S;=`*s<%lO&[_7b_ZX'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q!_$n!_!`8a!`#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_8j]#PX'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_9lV']Q'OS'^XOz&[z{&v{!P&[!P!Q'x!Q;'S&[;'S;=`*s<%lO&[_:[]'QX'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_;^i'_Q'vW'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q!c$n!c!}<{!}#O$n#O#P&[#P#R$n#R#S<{#S#T$n#T#o<{#o${$n${$|<{$|4w$n4w5b<{5b5i$n5i6S<{6S;'S$n;'S;=`4s<%lO$n_=Uj'_Q_X'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q![<{![!c$n!c!}<{!}#O$n#O#P&[#P#R$n#R#S<{#S#T$n#T#o<{#o${$n${$|<{$|4w$n4w5b<{5b5i$n5i6S<{6S;'S$n;'S;=`4s<%lO$n_?P_(TP'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q!_$n!_!`@O!`#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_@X]#OX'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_AZa!qX'_Q'OSOY$nYZ%nZr$nrs&[sv$nvwB`wz$nz{+O{!P$n!P!Q,z!Q!_$n!_!`@O!`#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_Bi]'}X'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_Cik'_Q'OSOYE^YZGfZrE^rsHvswE^wxFdxzE^z{Ih{!PE^!P!QKl!Q!cE^!c!}Lp!}#OE^#O#P!!l#P#RE^#R#SLp#S#TE^#T#oLp#o${E^${$|Lp$|4wE^4w5bLp5b5iE^5i6SLp6S;'SE^;'S;=`!*}<%lOE^_Ee_'_Q'OSOY$nYZ%nZr$nrs&[sw$nwxFdxz$nz{+O{!P$n!P!Q,z!Q#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_Fm]'_Q'OSsXOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_GmX'_Q'OSOw&[wxHYxz&[z{&v{!P&[!P!Q'x!Q;'S&[;'S;=`*s<%lO&[]HaV'OSsXOz&[z{&v{!P&[!P!Q'x!Q;'S&[;'S;=`*s<%lO&[]H{X'OSOw&[wxHYxz&[z{&v{!P&[!P!Q'x!Q;'S&[;'S;=`*s<%lO&[_Im_'_QOY+|YZ-xZr+|rs'`sw+|wxJlxz+|z{+O{!P+|!P!Q4y!Q#O+|#O#P'`#P;'S+|;'S;=`4m<%lO+|_Js]'_QsXOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_Kq_'_QOY+|YZ-xZr+|rs'`sw+|wxJlxz+|z{.d{!P+|!P!Q/Z!Q#O+|#O#P'`#P;'S+|;'S;=`4m<%lO+|_Lyl'_Q'OS'ZXOY$nYZ%nZr$nrs&[sw$nwxFdxz$nz{+O{!P$n!P!Q,z!Q![Nq![!c$n!c!}Nq!}#O$n#O#P&[#P#R$n#R#SNq#S#T$n#T#oNq#o${$n${$|Nq$|4w$n4w5bNq5b5i$n5i6SNq6S;'S$n;'S;=`4s<%lO$n_Nzj'_Q'OS'ZXOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q![Nq![!c$n!c!}Nq!}#O$n#O#P&[#P#R$n#R#SNq#S#T$n#T#oNq#o${$n${$|Nq$|4w$n4w5bNq5b5i$n5i6SNq6S;'S$n;'S;=`4s<%lO$n]!!qZ'OSOzHvz{!#d{!PHv!P!Q!$n!Q#iHv#i#j!%Z#j#lHv#l#m!'V#m;'SHv;'S;=`!*w<%lOHv]!#gXOw'`wx!$Sxz'`z{&v{!P'`!P!Q*y!Q;'S'`;'S;=`*m<%lO'`]!$XVsXOz&[z{&v{!P&[!P!Q'x!Q;'S&[;'S;=`*s<%lO&[]!$qWOw'`wx!$Sxz'`{!P'`!P!Q(_!Q;'S'`;'S;=`*m<%lO'`]!%`^'OSOz&[z{&v{!P&[!P!Q'x!Q![!&[![!c&[!c!i!&[!i#T&[#T#Z!&[#Z#o&[#o#p!({#p;'S&[;'S;=`*s<%lO&[]!&a['OSOz&[z{&v{!P&[!P!Q'x!Q![!'V![!c&[!c!i!'V!i#T&[#T#Z!'V#Z;'S&[;'S;=`*s<%lO&[]!'[['OSOz&[z{&v{!P&[!P!Q'x!Q![!(Q![!c&[!c!i!(Q!i#T&[#T#Z!(Q#Z;'S&[;'S;=`*s<%lO&[]!(V['OSOz&[z{&v{!P&[!P!Q'x!Q![Hv![!c&[!c!iHv!i#T&[#T#ZHv#Z;'S&[;'S;=`*s<%lO&[]!)Q['OSOz&[z{&v{!P&[!P!Q'x!Q![!)v![!c&[!c!i!)v!i#T&[#T#Z!)v#Z;'S&[;'S;=`*s<%lO&[]!){^'OSOz&[z{&v{!P&[!P!Q'x!Q![!)v![!c&[!c!i!)v!i#T&[#T#Z!)v#Z#q&[#q#rHv#r;'S&[;'S;=`*s<%lO&[]!*zP;=`<%lHv_!+QP;=`<%lE^_!+^]}X'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_!,`]!PX'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_!-`_(QX'_QOY+|YZ-xZr+|rs'`sz+|z{+O{!P+|!P!Q4y!Q!_+|!_!`!._!`#O+|#O#P'`#P;'S+|;'S;=`4m<%lO+|_!.f]#OX'_QOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_!/h_(PX'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q!_$n!_!`@O!`#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_!0p]!eX'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_!1r`'gX'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q!_$n!_!`@O!`!a!2t!a#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_!2}]#QX'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_!4P^(OX'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!O$n!O!P!4{!P!Q,z!Q#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_!5U`!lX'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!O$n!O!P!6W!P!Q,z!Q!_$n!_!`!7Y!`#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_!6a]!tX'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$nV!7c]'qP'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_!8c_'_Q'xXOY+|YZ-xZr+|rs'`sz+|z{!9b{!P+|!P!Q!:O!Q!_+|!_!`!._!`#O+|#O#P'`#P;'S+|;'S;=`4m<%lO+|_!9iV&}]'_QOY.dYZ/OZr.ds#O.d#P;'S.d;'S;=`/T<%lO.d_!:V]'_QUXOY!;OYZ3uZr!;Ors!>jsz!;Oz{!Aq{!P!;O!P!Q!:O!Q#O!;O#O#P!>j#P;'S!;O;'S;=`!Bk<%lO!;O_!;V]'_QUXOY!<OYZ2XZr!<Ors!=Ssz!<Oz{!@q{!P!<O!P!Q!:O!Q#O!<O#O#P!=S#P;'S!<O;'S;=`!Bq<%lO!<O_!<Z]'_QUX'PS'OSOY!<OYZ2XZr!<Ors!=Ssz!<Oz{!@q{!P!<O!P!Q!:O!Q#O!<O#O#P!=S#P;'S!<O;'S;=`!Bq<%lO!<O]!=]XUX'PS'OSOY!=SYZ)^Zz!=Sz{!=x{!P!=S!P!Q!?[!Q;'S!=S;'S;=`!@k<%lO!=S]!=}XUXOY!>jYZ(tZz!>jz{!=x{!P!>j!P!Q!?|!Q;'S!>j;'S;=`!@e<%lO!>j]!>oXUXOY!=SYZ)^Zz!=Sz{!=x{!P!=S!P!Q!?[!Q;'S!=S;'S;=`!@k<%lO!=S]!?aXUXOY!>jYZ(tZz!>jz{!?|{!P!>j!P!Q!?[!Q;'S!>j;'S;=`!@e<%lO!>jX!@RSUXOY!?|Z;'S!?|;'S;=`!@_<%lO!?|X!@bP;=`<%l!?|]!@hP;=`<%l!>j]!@nP;=`<%l!=S_!@x]'_QUXOY!;OYZ3uZr!;Ors!>jsz!;Oz{!@q{!P!;O!P!Q!Aq!Q#O!;O#O#P!>j#P;'S!;O;'S;=`!Bk<%lO!;OZ!AxX'_QUXOY!AqYZ/OZr!Aqrs!?|s#O!Aq#O#P!?|#P;'S!Aq;'S;=`!Be<%lO!AqZ!BhP;=`<%l!Aq_!BnP;=`<%l!;O_!BtP;=`<%l!<O_!CQjuX'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q![!Dr![#O$n#O#P&[#P#R$n#R#S!Dr#S#U$n#U#V#!}#V#]$n#]#^!FZ#^#c$n#c#d#%u#d#i$n#i#j!FZ#j#l$n#l#m#(g#m;'S$n;'S;=`4s<%lO$n_!D{duX'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q![!Dr![#O$n#O#P&[#P#R$n#R#S!Dr#S#]$n#]#^!FZ#^#i$n#i#j!FZ#j;'S$n;'S;=`4s<%lO$n_!Fbg'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q!R$n!R!S!Gy!S!T$n!T!U!K_!U!W$n!W!X!Le!X!Y$n!Y!Z!J]!Z#O$n#O#P&[#P#g$n#g#h!Mk#h;'S$n;'S;=`4s<%lO$n_!HQa'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q!S$n!S!T!IV!T!W$n!W!X!J]!X#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_!I^_'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q!Y$n!Y!Z!J]!Z#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_!Jf]uX'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_!Kf_'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q!S$n!S!T!J]!T#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_!Ll_'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q!U$n!U!V!J]!V#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_!Mr_'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q#O$n#O#P&[#P#]$n#]#^!Nq#^;'S$n;'S;=`4s<%lO$n_!Nx_'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q#O$n#O#P&[#P#n$n#n#o# w#o;'S$n;'S;=`4s<%lO$n_#!O_'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q#O$n#O#P&[#P#X$n#X#Y!J]#Y;'S$n;'S;=`4s<%lO$n_##Ua'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q!R#$Z!R!S#$Z!S#O$n#O#P&[#P#R$n#R#S#$Z#S;'S$n;'S;=`4s<%lO$n_#$deuX'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q!R#$Z!R!S#$Z!S#O$n#O#P&[#P#R$n#R#S#$Z#S#]$n#]#^!FZ#^#i$n#i#j!FZ#j;'S$n;'S;=`4s<%lO$n_#%|`'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q!Y#'O!Y#O$n#O#P&[#P#R$n#R#S#'O#S;'S$n;'S;=`4s<%lO$n_#'XduX'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q!Y#'O!Y#O$n#O#P&[#P#R$n#R#S#'O#S#]$n#]#^!FZ#^#i$n#i#j!FZ#j;'S$n;'S;=`4s<%lO$n_#(nd'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q![#)|![!c$n!c!i#)|!i#O$n#O#P&[#P#R$n#R#S#)|#S#T$n#T#Z#)|#Z;'S$n;'S;=`4s<%lO$n_#*VhuX'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q![#)|![!c$n!c!i#)|!i#O$n#O#P&[#P#R$n#R#S#)|#S#T$n#T#Z#)|#Z#]$n#]#^!FZ#^#i$n#i#j!FZ#j;'S$n;'S;=`4s<%lO$n_#+z_!SX'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q![$n![!]#,y!]#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_#-S]dX'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_#.U]yX'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_#/W`#PX'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q!^$n!^!_#0Y!_!`8a!`#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_#0c_'yX'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q!_$n!_!`@O!`#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_#1k`oX'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q!_$n!_!`8a!`!a#2m!a#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_#2v]#RX'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_#3x`#PX'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q!_$n!_!`8a!`!a#4z!a#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_#5T_'zX'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q!_$n!_!`@O!`#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_#6]](RX'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$nV#7_]'pP'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_#8cj'_Q'OS!yW'TPOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q![#8W![!c$n!c!}#8W!}#O$n#O#P&[#P#R$n#R#S#8W#S#T$n#T#o#8W#o${$n${$|#8W$|4w$n4w5b#8W5b5i$n5i6S#8W6S;'S$n;'S;=`4s<%lO$n_#:^][X'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$nU#;[Z'OSOz#;}z{#<k{!P#;}!P!Q#=V!Q#i#;}#i#j#=n#j#l#;}#l#m#?j#m;'S#;};'S;=`#C[<%lO#;}U#<UVrQ'OSOz&[z{&v{!P&[!P!Q'x!Q;'S&[;'S;=`*s<%lO&[U#<pVrQOz'`z{&v{!P'`!P!Q*y!Q;'S'`;'S;=`*m<%lO'`U#=[UrQOz'`{!P'`!P!Q(_!Q;'S'`;'S;=`*m<%lO'`U#=s^'OSOz&[z{&v{!P&[!P!Q'x!Q![#>o![!c&[!c!i#>o!i#T&[#T#Z#>o#Z#o&[#o#p#A`#p;'S&[;'S;=`*s<%lO&[U#>t['OSOz&[z{&v{!P&[!P!Q'x!Q![#?j![!c&[!c!i#?j!i#T&[#T#Z#?j#Z;'S&[;'S;=`*s<%lO&[U#?o['OSOz&[z{&v{!P&[!P!Q'x!Q![#@e![!c&[!c!i#@e!i#T&[#T#Z#@e#Z;'S&[;'S;=`*s<%lO&[U#@j['OSOz&[z{&v{!P&[!P!Q'x!Q![#;}![!c&[!c!i#;}!i#T&[#T#Z#;}#Z;'S&[;'S;=`*s<%lO&[U#Ae['OSOz&[z{&v{!P&[!P!Q'x!Q![#BZ![!c&[!c!i#BZ!i#T&[#T#Z#BZ#Z;'S&[;'S;=`*s<%lO&[U#B`^'OSOz&[z{&v{!P&[!P!Q'x!Q![#BZ![!c&[!c!i#BZ!i#T&[#T#Z#BZ#Z#q&[#q#r#;}#r;'S&[;'S;=`*s<%lO&[U#C_P;=`<%l#;}_#Ck]XX'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_#Dm_'{X'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q!_$n!_!`@O!`#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_#Ewl'_Q'OS!yW'TPOY$nYZ%nZr$nrs#Gosw$nwx#H]xz$nz{+O{!P$n!P!Q,z!Q![#8W![!c$n!c!}#8W!}#O$n#O#P&[#P#R$n#R#S#8W#S#T$n#T#o#8W#o${$n${$|#8W$|4w$n4w5b#8W5b5i$n5i6S#8W6S;'S$n;'S;=`4s<%lO$n]#GvV'OS'^XOz&[z{&v{!P&[!P!Q'x!Q;'S&[;'S;=`*s<%lO&[_#Hd_'_Q'OSOYE^YZGfZrE^rsHvswE^wxFdxzE^z{Ih{!PE^!P!QKl!Q#OE^#O#P!!l#P;'SE^;'S;=`!*}<%lOE^_#Ink'_Q'OS!yW'TPOY$nYZ%nZr$nrs&[st#Kctz$nz{+O{!P$n!P!Q,z!Q![#8W![!c$n!c!}#8W!}#O$n#O#P&[#P#R$n#R#S#8W#S#T$n#T#o#8W#o${$n${$|#8W$|4w$n4w5b#8W5b5i$n5i6S#8W6S;'S$n;'S;=`4s<%lO$nV#Kji'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q!c$n!c!}#MX!}#O$n#O#P&[#P#R$n#R#S#MX#S#T$n#T#o#MX#o${$n${$|#MX$|4w$n4w5b#MX5b5i$n5i6S#MX6S;'S$n;'S;=`4s<%lO$nV#Mbj'_Q'OS'TPOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q![#MX![!c$n!c!}#MX!}#O$n#O#P&[#P#R$n#R#S#MX#S#T$n#T#o#MX#o${$n${$|#MX$|4w$n4w5b#MX5b5i$n5i6S#MX6S;'S$n;'S;=`4s<%lO$n_$ ]]wX'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_$!_a'rX'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q!_$n!_!`@O!`#O$n#O#P&[#P#p$n#p#q$#d#q;'S$n;'S;=`4s<%lO$n_$#m]'|X'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n_$$o]vX'_Q'OSOY$nYZ%nZr$nrs&[sz$nz{+O{!P$n!P!Q,z!Q#O$n#O#P&[#P;'S$n;'S;=`4s<%lO$n\",\n  tokenizers: [closureParam, tpDelim, literalTokens, 0, 1, 2, 3],\n  topRules: {\"SourceFile\":[0,8]},\n  specialized: [{term: 281, get: value => spec_identifier[value] || -1}],\n  tokenPrec: 15596\n});\n\nexport { parser };\n","/**\nThe data structure for documents. @nonabstract\n*/\nclass Text {\n    /**\n    Get the line description around the given position.\n    */\n    lineAt(pos) {\n        if (pos < 0 || pos > this.length)\n            throw new RangeError(`Invalid position ${pos} in document of length ${this.length}`);\n        return this.lineInner(pos, false, 1, 0);\n    }\n    /**\n    Get the description for the given (1-based) line number.\n    */\n    line(n) {\n        if (n < 1 || n > this.lines)\n            throw new RangeError(`Invalid line number ${n} in ${this.lines}-line document`);\n        return this.lineInner(n, true, 1, 0);\n    }\n    /**\n    Replace a range of the text with the given content.\n    */\n    replace(from, to, text) {\n        let parts = [];\n        this.decompose(0, from, parts, 2 /* Open.To */);\n        if (text.length)\n            text.decompose(0, text.length, parts, 1 /* Open.From */ | 2 /* Open.To */);\n        this.decompose(to, this.length, parts, 1 /* Open.From */);\n        return TextNode.from(parts, this.length - (to - from) + text.length);\n    }\n    /**\n    Append another document to this one.\n    */\n    append(other) {\n        return this.replace(this.length, this.length, other);\n    }\n    /**\n    Retrieve the text between the given points.\n    */\n    slice(from, to = this.length) {\n        let parts = [];\n        this.decompose(from, to, parts, 0);\n        return TextNode.from(parts, to - from);\n    }\n    /**\n    Test whether this text is equal to another instance.\n    */\n    eq(other) {\n        if (other == this)\n            return true;\n        if (other.length != this.length || other.lines != this.lines)\n            return false;\n        let start = this.scanIdentical(other, 1), end = this.length - this.scanIdentical(other, -1);\n        let a = new RawTextCursor(this), b = new RawTextCursor(other);\n        for (let skip = start, pos = start;;) {\n            a.next(skip);\n            b.next(skip);\n            skip = 0;\n            if (a.lineBreak != b.lineBreak || a.done != b.done || a.value != b.value)\n                return false;\n            pos += a.value.length;\n            if (a.done || pos >= end)\n                return true;\n        }\n    }\n    /**\n    Iterate over the text. When `dir` is `-1`, iteration happens\n    from end to start. This will return lines and the breaks between\n    them as separate strings.\n    */\n    iter(dir = 1) { return new RawTextCursor(this, dir); }\n    /**\n    Iterate over a range of the text. When `from` > `to`, the\n    iterator will run in reverse.\n    */\n    iterRange(from, to = this.length) { return new PartialTextCursor(this, from, to); }\n    /**\n    Return a cursor that iterates over the given range of lines,\n    _without_ returning the line breaks between, and yielding empty\n    strings for empty lines.\n    \n    When `from` and `to` are given, they should be 1-based line numbers.\n    */\n    iterLines(from, to) {\n        let inner;\n        if (from == null) {\n            inner = this.iter();\n        }\n        else {\n            if (to == null)\n                to = this.lines + 1;\n            let start = this.line(from).from;\n            inner = this.iterRange(start, Math.max(start, to == this.lines + 1 ? this.length : to <= 1 ? 0 : this.line(to - 1).to));\n        }\n        return new LineCursor(inner);\n    }\n    /**\n    Return the document as a string, using newline characters to\n    separate lines.\n    */\n    toString() { return this.sliceString(0); }\n    /**\n    Convert the document to an array of lines (which can be\n    deserialized again via [`Text.of`](https://codemirror.net/6/docs/ref/#state.Text^of)).\n    */\n    toJSON() {\n        let lines = [];\n        this.flatten(lines);\n        return lines;\n    }\n    /**\n    @internal\n    */\n    constructor() { }\n    /**\n    Create a `Text` instance for the given array of lines.\n    */\n    static of(text) {\n        if (text.length == 0)\n            throw new RangeError(\"A document must have at least one line\");\n        if (text.length == 1 && !text[0])\n            return Text.empty;\n        return text.length <= 32 /* Tree.Branch */ ? new TextLeaf(text) : TextNode.from(TextLeaf.split(text, []));\n    }\n}\n// Leaves store an array of line strings. There are always line breaks\n// between these strings. Leaves are limited in size and have to be\n// contained in TextNode instances for bigger documents.\nclass TextLeaf extends Text {\n    constructor(text, length = textLength(text)) {\n        super();\n        this.text = text;\n        this.length = length;\n    }\n    get lines() { return this.text.length; }\n    get children() { return null; }\n    lineInner(target, isLine, line, offset) {\n        for (let i = 0;; i++) {\n            let string = this.text[i], end = offset + string.length;\n            if ((isLine ? line : end) >= target)\n                return new Line(offset, end, line, string);\n            offset = end + 1;\n            line++;\n        }\n    }\n    decompose(from, to, target, open) {\n        let text = from <= 0 && to >= this.length ? this\n            : new TextLeaf(sliceText(this.text, from, to), Math.min(to, this.length) - Math.max(0, from));\n        if (open & 1 /* Open.From */) {\n            let prev = target.pop();\n            let joined = appendText(text.text, prev.text.slice(), 0, text.length);\n            if (joined.length <= 32 /* Tree.Branch */) {\n                target.push(new TextLeaf(joined, prev.length + text.length));\n            }\n            else {\n                let mid = joined.length >> 1;\n                target.push(new TextLeaf(joined.slice(0, mid)), new TextLeaf(joined.slice(mid)));\n            }\n        }\n        else {\n            target.push(text);\n        }\n    }\n    replace(from, to, text) {\n        if (!(text instanceof TextLeaf))\n            return super.replace(from, to, text);\n        let lines = appendText(this.text, appendText(text.text, sliceText(this.text, 0, from)), to);\n        let newLen = this.length + text.length - (to - from);\n        if (lines.length <= 32 /* Tree.Branch */)\n            return new TextLeaf(lines, newLen);\n        return TextNode.from(TextLeaf.split(lines, []), newLen);\n    }\n    sliceString(from, to = this.length, lineSep = \"\\n\") {\n        let result = \"\";\n        for (let pos = 0, i = 0; pos <= to && i < this.text.length; i++) {\n            let line = this.text[i], end = pos + line.length;\n            if (pos > from && i)\n                result += lineSep;\n            if (from < end && to > pos)\n                result += line.slice(Math.max(0, from - pos), to - pos);\n            pos = end + 1;\n        }\n        return result;\n    }\n    flatten(target) {\n        for (let line of this.text)\n            target.push(line);\n    }\n    scanIdentical() { return 0; }\n    static split(text, target) {\n        let part = [], len = -1;\n        for (let line of text) {\n            part.push(line);\n            len += line.length + 1;\n            if (part.length == 32 /* Tree.Branch */) {\n                target.push(new TextLeaf(part, len));\n                part = [];\n                len = -1;\n            }\n        }\n        if (len > -1)\n            target.push(new TextLeaf(part, len));\n        return target;\n    }\n}\n// Nodes provide the tree structure of the `Text` type. They store a\n// number of other nodes or leaves, taking care to balance themselves\n// on changes. There are implied line breaks _between_ the children of\n// a node (but not before the first or after the last child).\nclass TextNode extends Text {\n    constructor(children, length) {\n        super();\n        this.children = children;\n        this.length = length;\n        this.lines = 0;\n        for (let child of children)\n            this.lines += child.lines;\n    }\n    lineInner(target, isLine, line, offset) {\n        for (let i = 0;; i++) {\n            let child = this.children[i], end = offset + child.length, endLine = line + child.lines - 1;\n            if ((isLine ? endLine : end) >= target)\n                return child.lineInner(target, isLine, line, offset);\n            offset = end + 1;\n            line = endLine + 1;\n        }\n    }\n    decompose(from, to, target, open) {\n        for (let i = 0, pos = 0; pos <= to && i < this.children.length; i++) {\n            let child = this.children[i], end = pos + child.length;\n            if (from <= end && to >= pos) {\n                let childOpen = open & ((pos <= from ? 1 /* Open.From */ : 0) | (end >= to ? 2 /* Open.To */ : 0));\n                if (pos >= from && end <= to && !childOpen)\n                    target.push(child);\n                else\n                    child.decompose(from - pos, to - pos, target, childOpen);\n            }\n            pos = end + 1;\n        }\n    }\n    replace(from, to, text) {\n        if (text.lines < this.lines)\n            for (let i = 0, pos = 0; i < this.children.length; i++) {\n                let child = this.children[i], end = pos + child.length;\n                // Fast path: if the change only affects one child and the\n                // child's size remains in the acceptable range, only update\n                // that child\n                if (from >= pos && to <= end) {\n                    let updated = child.replace(from - pos, to - pos, text);\n                    let totalLines = this.lines - child.lines + updated.lines;\n                    if (updated.lines < (totalLines >> (5 /* Tree.BranchShift */ - 1)) &&\n                        updated.lines > (totalLines >> (5 /* Tree.BranchShift */ + 1))) {\n                        let copy = this.children.slice();\n                        copy[i] = updated;\n                        return new TextNode(copy, this.length - (to - from) + text.length);\n                    }\n                    return super.replace(pos, end, updated);\n                }\n                pos = end + 1;\n            }\n        return super.replace(from, to, text);\n    }\n    sliceString(from, to = this.length, lineSep = \"\\n\") {\n        let result = \"\";\n        for (let i = 0, pos = 0; i < this.children.length && pos <= to; i++) {\n            let child = this.children[i], end = pos + child.length;\n            if (pos > from && i)\n                result += lineSep;\n            if (from < end && to > pos)\n                result += child.sliceString(from - pos, to - pos, lineSep);\n            pos = end + 1;\n        }\n        return result;\n    }\n    flatten(target) {\n        for (let child of this.children)\n            child.flatten(target);\n    }\n    scanIdentical(other, dir) {\n        if (!(other instanceof TextNode))\n            return 0;\n        let length = 0;\n        let [iA, iB, eA, eB] = dir > 0 ? [0, 0, this.children.length, other.children.length]\n            : [this.children.length - 1, other.children.length - 1, -1, -1];\n        for (;; iA += dir, iB += dir) {\n            if (iA == eA || iB == eB)\n                return length;\n            let chA = this.children[iA], chB = other.children[iB];\n            if (chA != chB)\n                return length + chA.scanIdentical(chB, dir);\n            length += chA.length + 1;\n        }\n    }\n    static from(children, length = children.reduce((l, ch) => l + ch.length + 1, -1)) {\n        let lines = 0;\n        for (let ch of children)\n            lines += ch.lines;\n        if (lines < 32 /* Tree.Branch */) {\n            let flat = [];\n            for (let ch of children)\n                ch.flatten(flat);\n            return new TextLeaf(flat, length);\n        }\n        let chunk = Math.max(32 /* Tree.Branch */, lines >> 5 /* Tree.BranchShift */), maxChunk = chunk << 1, minChunk = chunk >> 1;\n        let chunked = [], currentLines = 0, currentLen = -1, currentChunk = [];\n        function add(child) {\n            let last;\n            if (child.lines > maxChunk && child instanceof TextNode) {\n                for (let node of child.children)\n                    add(node);\n            }\n            else if (child.lines > minChunk && (currentLines > minChunk || !currentLines)) {\n                flush();\n                chunked.push(child);\n            }\n            else if (child instanceof TextLeaf && currentLines &&\n                (last = currentChunk[currentChunk.length - 1]) instanceof TextLeaf &&\n                child.lines + last.lines <= 32 /* Tree.Branch */) {\n                currentLines += child.lines;\n                currentLen += child.length + 1;\n                currentChunk[currentChunk.length - 1] = new TextLeaf(last.text.concat(child.text), last.length + 1 + child.length);\n            }\n            else {\n                if (currentLines + child.lines > chunk)\n                    flush();\n                currentLines += child.lines;\n                currentLen += child.length + 1;\n                currentChunk.push(child);\n            }\n        }\n        function flush() {\n            if (currentLines == 0)\n                return;\n            chunked.push(currentChunk.length == 1 ? currentChunk[0] : TextNode.from(currentChunk, currentLen));\n            currentLen = -1;\n            currentLines = currentChunk.length = 0;\n        }\n        for (let child of children)\n            add(child);\n        flush();\n        return chunked.length == 1 ? chunked[0] : new TextNode(chunked, length);\n    }\n}\nText.empty = /*@__PURE__*/new TextLeaf([\"\"], 0);\nfunction textLength(text) {\n    let length = -1;\n    for (let line of text)\n        length += line.length + 1;\n    return length;\n}\nfunction appendText(text, target, from = 0, to = 1e9) {\n    for (let pos = 0, i = 0, first = true; i < text.length && pos <= to; i++) {\n        let line = text[i], end = pos + line.length;\n        if (end >= from) {\n            if (end > to)\n                line = line.slice(0, to - pos);\n            if (pos < from)\n                line = line.slice(from - pos);\n            if (first) {\n                target[target.length - 1] += line;\n                first = false;\n            }\n            else\n                target.push(line);\n        }\n        pos = end + 1;\n    }\n    return target;\n}\nfunction sliceText(text, from, to) {\n    return appendText(text, [\"\"], from, to);\n}\nclass RawTextCursor {\n    constructor(text, dir = 1) {\n        this.dir = dir;\n        this.done = false;\n        this.lineBreak = false;\n        this.value = \"\";\n        this.nodes = [text];\n        this.offsets = [dir > 0 ? 1 : (text instanceof TextLeaf ? text.text.length : text.children.length) << 1];\n    }\n    nextInner(skip, dir) {\n        this.done = this.lineBreak = false;\n        for (;;) {\n            let last = this.nodes.length - 1;\n            let top = this.nodes[last], offsetValue = this.offsets[last], offset = offsetValue >> 1;\n            let size = top instanceof TextLeaf ? top.text.length : top.children.length;\n            if (offset == (dir > 0 ? size : 0)) {\n                if (last == 0) {\n                    this.done = true;\n                    this.value = \"\";\n                    return this;\n                }\n                if (dir > 0)\n                    this.offsets[last - 1]++;\n                this.nodes.pop();\n                this.offsets.pop();\n            }\n            else if ((offsetValue & 1) == (dir > 0 ? 0 : 1)) {\n                this.offsets[last] += dir;\n                if (skip == 0) {\n                    this.lineBreak = true;\n                    this.value = \"\\n\";\n                    return this;\n                }\n                skip--;\n            }\n            else if (top instanceof TextLeaf) {\n                // Move to the next string\n                let next = top.text[offset + (dir < 0 ? -1 : 0)];\n                this.offsets[last] += dir;\n                if (next.length > Math.max(0, skip)) {\n                    this.value = skip == 0 ? next : dir > 0 ? next.slice(skip) : next.slice(0, next.length - skip);\n                    return this;\n                }\n                skip -= next.length;\n            }\n            else {\n                let next = top.children[offset + (dir < 0 ? -1 : 0)];\n                if (skip > next.length) {\n                    skip -= next.length;\n                    this.offsets[last] += dir;\n                }\n                else {\n                    if (dir < 0)\n                        this.offsets[last]--;\n                    this.nodes.push(next);\n                    this.offsets.push(dir > 0 ? 1 : (next instanceof TextLeaf ? next.text.length : next.children.length) << 1);\n                }\n            }\n        }\n    }\n    next(skip = 0) {\n        if (skip < 0) {\n            this.nextInner(-skip, (-this.dir));\n            skip = this.value.length;\n        }\n        return this.nextInner(skip, this.dir);\n    }\n}\nclass PartialTextCursor {\n    constructor(text, start, end) {\n        this.value = \"\";\n        this.done = false;\n        this.cursor = new RawTextCursor(text, start > end ? -1 : 1);\n        this.pos = start > end ? text.length : 0;\n        this.from = Math.min(start, end);\n        this.to = Math.max(start, end);\n    }\n    nextInner(skip, dir) {\n        if (dir < 0 ? this.pos <= this.from : this.pos >= this.to) {\n            this.value = \"\";\n            this.done = true;\n            return this;\n        }\n        skip += Math.max(0, dir < 0 ? this.pos - this.to : this.from - this.pos);\n        let limit = dir < 0 ? this.pos - this.from : this.to - this.pos;\n        if (skip > limit)\n            skip = limit;\n        limit -= skip;\n        let { value } = this.cursor.next(skip);\n        this.pos += (value.length + skip) * dir;\n        this.value = value.length <= limit ? value : dir < 0 ? value.slice(value.length - limit) : value.slice(0, limit);\n        this.done = !this.value;\n        return this;\n    }\n    next(skip = 0) {\n        if (skip < 0)\n            skip = Math.max(skip, this.from - this.pos);\n        else if (skip > 0)\n            skip = Math.min(skip, this.to - this.pos);\n        return this.nextInner(skip, this.cursor.dir);\n    }\n    get lineBreak() { return this.cursor.lineBreak && this.value != \"\"; }\n}\nclass LineCursor {\n    constructor(inner) {\n        this.inner = inner;\n        this.afterBreak = true;\n        this.value = \"\";\n        this.done = false;\n    }\n    next(skip = 0) {\n        let { done, lineBreak, value } = this.inner.next(skip);\n        if (done) {\n            this.done = true;\n            this.value = \"\";\n        }\n        else if (lineBreak) {\n            if (this.afterBreak) {\n                this.value = \"\";\n            }\n            else {\n                this.afterBreak = true;\n                this.next();\n            }\n        }\n        else {\n            this.value = value;\n            this.afterBreak = false;\n        }\n        return this;\n    }\n    get lineBreak() { return false; }\n}\nif (typeof Symbol != \"undefined\") {\n    Text.prototype[Symbol.iterator] = function () { return this.iter(); };\n    RawTextCursor.prototype[Symbol.iterator] = PartialTextCursor.prototype[Symbol.iterator] =\n        LineCursor.prototype[Symbol.iterator] = function () { return this; };\n}\n/**\nThis type describes a line in the document. It is created\non-demand when lines are [queried](https://codemirror.net/6/docs/ref/#state.Text.lineAt).\n*/\nclass Line {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    The position of the start of the line.\n    */\n    from, \n    /**\n    The position at the end of the line (_before_ the line break,\n    or at the end of document for the last line).\n    */\n    to, \n    /**\n    This line's line number (1-based).\n    */\n    number, \n    /**\n    The line's content.\n    */\n    text) {\n        this.from = from;\n        this.to = to;\n        this.number = number;\n        this.text = text;\n    }\n    /**\n    The length of the line (not including any line break after it).\n    */\n    get length() { return this.to - this.from; }\n}\n\n// Compressed representation of the Grapheme_Cluster_Break=Extend\n// information from\n// http://www.unicode.org/Public/13.0.0/ucd/auxiliary/GraphemeBreakProperty.txt.\n// Each pair of elements represents a range, as an offet from the\n// previous range and a length. Numbers are in base-36, with the empty\n// string being a shorthand for 1.\nlet extend = /*@__PURE__*/\"lc,34,7n,7,7b,19,,,,2,,2,,,20,b,1c,l,g,,2t,7,2,6,2,2,,4,z,,u,r,2j,b,1m,9,9,,o,4,,9,,3,,5,17,3,3b,f,,w,1j,,,,4,8,4,,3,7,a,2,t,,1m,,,,2,4,8,,9,,a,2,q,,2,2,1l,,4,2,4,2,2,3,3,,u,2,3,,b,2,1l,,4,5,,2,4,,k,2,m,6,,,1m,,,2,,4,8,,7,3,a,2,u,,1n,,,,c,,9,,14,,3,,1l,3,5,3,,4,7,2,b,2,t,,1m,,2,,2,,3,,5,2,7,2,b,2,s,2,1l,2,,,2,4,8,,9,,a,2,t,,20,,4,,2,3,,,8,,29,,2,7,c,8,2q,,2,9,b,6,22,2,r,,,,,,1j,e,,5,,2,5,b,,10,9,,2u,4,,6,,2,2,2,p,2,4,3,g,4,d,,2,2,6,,f,,jj,3,qa,3,t,3,t,2,u,2,1s,2,,7,8,,2,b,9,,19,3,3b,2,y,,3a,3,4,2,9,,6,3,63,2,2,,1m,,,7,,,,,2,8,6,a,2,,1c,h,1r,4,1c,7,,,5,,14,9,c,2,w,4,2,2,,3,1k,,,2,3,,,3,1m,8,2,2,48,3,,d,,7,4,,6,,3,2,5i,1m,,5,ek,,5f,x,2da,3,3x,,2o,w,fe,6,2x,2,n9w,4,,a,w,2,28,2,7k,,3,,4,,p,2,5,,47,2,q,i,d,,12,8,p,b,1a,3,1c,,2,4,2,2,13,,1v,6,2,2,2,2,c,,8,,1b,,1f,,,3,2,2,5,2,,,16,2,8,,6m,,2,,4,,fn4,,kh,g,g,g,a6,2,gt,,6a,,45,5,1ae,3,,2,5,4,14,3,4,,4l,2,fx,4,ar,2,49,b,4w,,1i,f,1k,3,1d,4,2,2,1x,3,10,5,,8,1q,,c,2,1g,9,a,4,2,,2n,3,2,,,2,6,,4g,,3,8,l,2,1l,2,,,,,m,,e,7,3,5,5f,8,2,3,,,n,,29,,2,6,,,2,,,2,,2,6j,,2,4,6,2,,2,r,2,2d,8,2,,,2,2y,,,,2,6,,,2t,3,2,4,,5,77,9,,2,6t,,a,2,,,4,,40,4,2,2,4,,w,a,14,6,2,4,8,,9,6,2,3,1a,d,,2,ba,7,,6,,,2a,m,2,7,,2,,2,3e,6,3,,,2,,7,,,20,2,3,,,,9n,2,f0b,5,1n,7,t4,,1r,4,29,,f5k,2,43q,,,3,4,5,8,8,2,7,u,4,44,3,1iz,1j,4,1e,8,,e,,m,5,,f,11s,7,,h,2,7,,2,,5,79,7,c5,4,15s,7,31,7,240,5,gx7k,2o,3k,6o\".split(\",\").map(s => s ? parseInt(s, 36) : 1);\n// Convert offsets into absolute values\nfor (let i = 1; i < extend.length; i++)\n    extend[i] += extend[i - 1];\nfunction isExtendingChar(code) {\n    for (let i = 1; i < extend.length; i += 2)\n        if (extend[i] > code)\n            return extend[i - 1] <= code;\n    return false;\n}\nfunction isRegionalIndicator(code) {\n    return code >= 0x1F1E6 && code <= 0x1F1FF;\n}\nconst ZWJ = 0x200d;\n/**\nReturns a next grapheme cluster break _after_ (not equal to)\n`pos`, if `forward` is true, or before otherwise. Returns `pos`\nitself if no further cluster break is available in the string.\nMoves across surrogate pairs, extending characters (when\n`includeExtending` is true), characters joined with zero-width\njoiners, and flag emoji.\n*/\nfunction findClusterBreak(str, pos, forward = true, includeExtending = true) {\n    return (forward ? nextClusterBreak : prevClusterBreak)(str, pos, includeExtending);\n}\nfunction nextClusterBreak(str, pos, includeExtending) {\n    if (pos == str.length)\n        return pos;\n    // If pos is in the middle of a surrogate pair, move to its start\n    if (pos && surrogateLow(str.charCodeAt(pos)) && surrogateHigh(str.charCodeAt(pos - 1)))\n        pos--;\n    let prev = codePointAt(str, pos);\n    pos += codePointSize(prev);\n    while (pos < str.length) {\n        let next = codePointAt(str, pos);\n        if (prev == ZWJ || next == ZWJ || includeExtending && isExtendingChar(next)) {\n            pos += codePointSize(next);\n            prev = next;\n        }\n        else if (isRegionalIndicator(next)) {\n            let countBefore = 0, i = pos - 2;\n            while (i >= 0 && isRegionalIndicator(codePointAt(str, i))) {\n                countBefore++;\n                i -= 2;\n            }\n            if (countBefore % 2 == 0)\n                break;\n            else\n                pos += 2;\n        }\n        else {\n            break;\n        }\n    }\n    return pos;\n}\nfunction prevClusterBreak(str, pos, includeExtending) {\n    while (pos > 0) {\n        let found = nextClusterBreak(str, pos - 2, includeExtending);\n        if (found < pos)\n            return found;\n        pos--;\n    }\n    return 0;\n}\nfunction surrogateLow(ch) { return ch >= 0xDC00 && ch < 0xE000; }\nfunction surrogateHigh(ch) { return ch >= 0xD800 && ch < 0xDC00; }\n/**\nFind the code point at the given position in a string (like the\n[`codePointAt`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/codePointAt)\nstring method).\n*/\nfunction codePointAt(str, pos) {\n    let code0 = str.charCodeAt(pos);\n    if (!surrogateHigh(code0) || pos + 1 == str.length)\n        return code0;\n    let code1 = str.charCodeAt(pos + 1);\n    if (!surrogateLow(code1))\n        return code0;\n    return ((code0 - 0xd800) << 10) + (code1 - 0xdc00) + 0x10000;\n}\n/**\nGiven a Unicode codepoint, return the JavaScript string that\nrespresents it (like\n[`String.fromCodePoint`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/fromCodePoint)).\n*/\nfunction fromCodePoint(code) {\n    if (code <= 0xffff)\n        return String.fromCharCode(code);\n    code -= 0x10000;\n    return String.fromCharCode((code >> 10) + 0xd800, (code & 1023) + 0xdc00);\n}\n/**\nThe amount of positions a character takes up a JavaScript string.\n*/\nfunction codePointSize(code) { return code < 0x10000 ? 1 : 2; }\n\nconst DefaultSplit = /\\r\\n?|\\n/;\n/**\nDistinguishes different ways in which positions can be mapped.\n*/\nvar MapMode = /*@__PURE__*/(function (MapMode) {\n    /**\n    Map a position to a valid new position, even when its context\n    was deleted.\n    */\n    MapMode[MapMode[\"Simple\"] = 0] = \"Simple\";\n    /**\n    Return null if deletion happens across the position.\n    */\n    MapMode[MapMode[\"TrackDel\"] = 1] = \"TrackDel\";\n    /**\n    Return null if the character _before_ the position is deleted.\n    */\n    MapMode[MapMode[\"TrackBefore\"] = 2] = \"TrackBefore\";\n    /**\n    Return null if the character _after_ the position is deleted.\n    */\n    MapMode[MapMode[\"TrackAfter\"] = 3] = \"TrackAfter\";\nreturn MapMode})(MapMode || (MapMode = {}));\n/**\nA change description is a variant of [change set](https://codemirror.net/6/docs/ref/#state.ChangeSet)\nthat doesn't store the inserted text. As such, it can't be\napplied, but is cheaper to store and manipulate.\n*/\nclass ChangeDesc {\n    // Sections are encoded as pairs of integers. The first is the\n    // length in the current document, and the second is -1 for\n    // unaffected sections, and the length of the replacement content\n    // otherwise. So an insertion would be (0, n>0), a deletion (n>0,\n    // 0), and a replacement two positive numbers.\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    @internal\n    */\n    sections) {\n        this.sections = sections;\n    }\n    /**\n    The length of the document before the change.\n    */\n    get length() {\n        let result = 0;\n        for (let i = 0; i < this.sections.length; i += 2)\n            result += this.sections[i];\n        return result;\n    }\n    /**\n    The length of the document after the change.\n    */\n    get newLength() {\n        let result = 0;\n        for (let i = 0; i < this.sections.length; i += 2) {\n            let ins = this.sections[i + 1];\n            result += ins < 0 ? this.sections[i] : ins;\n        }\n        return result;\n    }\n    /**\n    False when there are actual changes in this set.\n    */\n    get empty() { return this.sections.length == 0 || this.sections.length == 2 && this.sections[1] < 0; }\n    /**\n    Iterate over the unchanged parts left by these changes. `posA`\n    provides the position of the range in the old document, `posB`\n    the new position in the changed document.\n    */\n    iterGaps(f) {\n        for (let i = 0, posA = 0, posB = 0; i < this.sections.length;) {\n            let len = this.sections[i++], ins = this.sections[i++];\n            if (ins < 0) {\n                f(posA, posB, len);\n                posB += len;\n            }\n            else {\n                posB += ins;\n            }\n            posA += len;\n        }\n    }\n    /**\n    Iterate over the ranges changed by these changes. (See\n    [`ChangeSet.iterChanges`](https://codemirror.net/6/docs/ref/#state.ChangeSet.iterChanges) for a\n    variant that also provides you with the inserted text.)\n    `fromA`/`toA` provides the extent of the change in the starting\n    document, `fromB`/`toB` the extent of the replacement in the\n    changed document.\n    \n    When `individual` is true, adjacent changes (which are kept\n    separate for [position mapping](https://codemirror.net/6/docs/ref/#state.ChangeDesc.mapPos)) are\n    reported separately.\n    */\n    iterChangedRanges(f, individual = false) {\n        iterChanges(this, f, individual);\n    }\n    /**\n    Get a description of the inverted form of these changes.\n    */\n    get invertedDesc() {\n        let sections = [];\n        for (let i = 0; i < this.sections.length;) {\n            let len = this.sections[i++], ins = this.sections[i++];\n            if (ins < 0)\n                sections.push(len, ins);\n            else\n                sections.push(ins, len);\n        }\n        return new ChangeDesc(sections);\n    }\n    /**\n    Compute the combined effect of applying another set of changes\n    after this one. The length of the document after this set should\n    match the length before `other`.\n    */\n    composeDesc(other) { return this.empty ? other : other.empty ? this : composeSets(this, other); }\n    /**\n    Map this description, which should start with the same document\n    as `other`, over another set of changes, so that it can be\n    applied after it. When `before` is true, map as if the changes\n    in `other` happened before the ones in `this`.\n    */\n    mapDesc(other, before = false) { return other.empty ? this : mapSet(this, other, before); }\n    mapPos(pos, assoc = -1, mode = MapMode.Simple) {\n        let posA = 0, posB = 0;\n        for (let i = 0; i < this.sections.length;) {\n            let len = this.sections[i++], ins = this.sections[i++], endA = posA + len;\n            if (ins < 0) {\n                if (endA > pos)\n                    return posB + (pos - posA);\n                posB += len;\n            }\n            else {\n                if (mode != MapMode.Simple && endA >= pos &&\n                    (mode == MapMode.TrackDel && posA < pos && endA > pos ||\n                        mode == MapMode.TrackBefore && posA < pos ||\n                        mode == MapMode.TrackAfter && endA > pos))\n                    return null;\n                if (endA > pos || endA == pos && assoc < 0 && !len)\n                    return pos == posA || assoc < 0 ? posB : posB + ins;\n                posB += ins;\n            }\n            posA = endA;\n        }\n        if (pos > posA)\n            throw new RangeError(`Position ${pos} is out of range for changeset of length ${posA}`);\n        return posB;\n    }\n    /**\n    Check whether these changes touch a given range. When one of the\n    changes entirely covers the range, the string `\"cover\"` is\n    returned.\n    */\n    touchesRange(from, to = from) {\n        for (let i = 0, pos = 0; i < this.sections.length && pos <= to;) {\n            let len = this.sections[i++], ins = this.sections[i++], end = pos + len;\n            if (ins >= 0 && pos <= to && end >= from)\n                return pos < from && end > to ? \"cover\" : true;\n            pos = end;\n        }\n        return false;\n    }\n    /**\n    @internal\n    */\n    toString() {\n        let result = \"\";\n        for (let i = 0; i < this.sections.length;) {\n            let len = this.sections[i++], ins = this.sections[i++];\n            result += (result ? \" \" : \"\") + len + (ins >= 0 ? \":\" + ins : \"\");\n        }\n        return result;\n    }\n    /**\n    Serialize this change desc to a JSON-representable value.\n    */\n    toJSON() { return this.sections; }\n    /**\n    Create a change desc from its JSON representation (as produced\n    by [`toJSON`](https://codemirror.net/6/docs/ref/#state.ChangeDesc.toJSON).\n    */\n    static fromJSON(json) {\n        if (!Array.isArray(json) || json.length % 2 || json.some(a => typeof a != \"number\"))\n            throw new RangeError(\"Invalid JSON representation of ChangeDesc\");\n        return new ChangeDesc(json);\n    }\n    /**\n    @internal\n    */\n    static create(sections) { return new ChangeDesc(sections); }\n}\n/**\nA change set represents a group of modifications to a document. It\nstores the document length, and can only be applied to documents\nwith exactly that length.\n*/\nclass ChangeSet extends ChangeDesc {\n    constructor(sections, \n    /**\n    @internal\n    */\n    inserted) {\n        super(sections);\n        this.inserted = inserted;\n    }\n    /**\n    Apply the changes to a document, returning the modified\n    document.\n    */\n    apply(doc) {\n        if (this.length != doc.length)\n            throw new RangeError(\"Applying change set to a document with the wrong length\");\n        iterChanges(this, (fromA, toA, fromB, _toB, text) => doc = doc.replace(fromB, fromB + (toA - fromA), text), false);\n        return doc;\n    }\n    mapDesc(other, before = false) { return mapSet(this, other, before, true); }\n    /**\n    Given the document as it existed _before_ the changes, return a\n    change set that represents the inverse of this set, which could\n    be used to go from the document created by the changes back to\n    the document as it existed before the changes.\n    */\n    invert(doc) {\n        let sections = this.sections.slice(), inserted = [];\n        for (let i = 0, pos = 0; i < sections.length; i += 2) {\n            let len = sections[i], ins = sections[i + 1];\n            if (ins >= 0) {\n                sections[i] = ins;\n                sections[i + 1] = len;\n                let index = i >> 1;\n                while (inserted.length < index)\n                    inserted.push(Text.empty);\n                inserted.push(len ? doc.slice(pos, pos + len) : Text.empty);\n            }\n            pos += len;\n        }\n        return new ChangeSet(sections, inserted);\n    }\n    /**\n    Combine two subsequent change sets into a single set. `other`\n    must start in the document produced by `this`. If `this` goes\n    `docA` → `docB` and `other` represents `docB` → `docC`, the\n    returned value will represent the change `docA` → `docC`.\n    */\n    compose(other) { return this.empty ? other : other.empty ? this : composeSets(this, other, true); }\n    /**\n    Given another change set starting in the same document, maps this\n    change set over the other, producing a new change set that can be\n    applied to the document produced by applying `other`. When\n    `before` is `true`, order changes as if `this` comes before\n    `other`, otherwise (the default) treat `other` as coming first.\n    \n    Given two changes `A` and `B`, `A.compose(B.map(A))` and\n    `B.compose(A.map(B, true))` will produce the same document. This\n    provides a basic form of [operational\n    transformation](https://en.wikipedia.org/wiki/Operational_transformation),\n    and can be used for collaborative editing.\n    */\n    map(other, before = false) { return other.empty ? this : mapSet(this, other, before, true); }\n    /**\n    Iterate over the changed ranges in the document, calling `f` for\n    each, with the range in the original document (`fromA`-`toA`)\n    and the range that replaces it in the new document\n    (`fromB`-`toB`).\n    \n    When `individual` is true, adjacent changes are reported\n    separately.\n    */\n    iterChanges(f, individual = false) {\n        iterChanges(this, f, individual);\n    }\n    /**\n    Get a [change description](https://codemirror.net/6/docs/ref/#state.ChangeDesc) for this change\n    set.\n    */\n    get desc() { return ChangeDesc.create(this.sections); }\n    /**\n    @internal\n    */\n    filter(ranges) {\n        let resultSections = [], resultInserted = [], filteredSections = [];\n        let iter = new SectionIter(this);\n        done: for (let i = 0, pos = 0;;) {\n            let next = i == ranges.length ? 1e9 : ranges[i++];\n            while (pos < next || pos == next && iter.len == 0) {\n                if (iter.done)\n                    break done;\n                let len = Math.min(iter.len, next - pos);\n                addSection(filteredSections, len, -1);\n                let ins = iter.ins == -1 ? -1 : iter.off == 0 ? iter.ins : 0;\n                addSection(resultSections, len, ins);\n                if (ins > 0)\n                    addInsert(resultInserted, resultSections, iter.text);\n                iter.forward(len);\n                pos += len;\n            }\n            let end = ranges[i++];\n            while (pos < end) {\n                if (iter.done)\n                    break done;\n                let len = Math.min(iter.len, end - pos);\n                addSection(resultSections, len, -1);\n                addSection(filteredSections, len, iter.ins == -1 ? -1 : iter.off == 0 ? iter.ins : 0);\n                iter.forward(len);\n                pos += len;\n            }\n        }\n        return { changes: new ChangeSet(resultSections, resultInserted),\n            filtered: ChangeDesc.create(filteredSections) };\n    }\n    /**\n    Serialize this change set to a JSON-representable value.\n    */\n    toJSON() {\n        let parts = [];\n        for (let i = 0; i < this.sections.length; i += 2) {\n            let len = this.sections[i], ins = this.sections[i + 1];\n            if (ins < 0)\n                parts.push(len);\n            else if (ins == 0)\n                parts.push([len]);\n            else\n                parts.push([len].concat(this.inserted[i >> 1].toJSON()));\n        }\n        return parts;\n    }\n    /**\n    Create a change set for the given changes, for a document of the\n    given length, using `lineSep` as line separator.\n    */\n    static of(changes, length, lineSep) {\n        let sections = [], inserted = [], pos = 0;\n        let total = null;\n        function flush(force = false) {\n            if (!force && !sections.length)\n                return;\n            if (pos < length)\n                addSection(sections, length - pos, -1);\n            let set = new ChangeSet(sections, inserted);\n            total = total ? total.compose(set.map(total)) : set;\n            sections = [];\n            inserted = [];\n            pos = 0;\n        }\n        function process(spec) {\n            if (Array.isArray(spec)) {\n                for (let sub of spec)\n                    process(sub);\n            }\n            else if (spec instanceof ChangeSet) {\n                if (spec.length != length)\n                    throw new RangeError(`Mismatched change set length (got ${spec.length}, expected ${length})`);\n                flush();\n                total = total ? total.compose(spec.map(total)) : spec;\n            }\n            else {\n                let { from, to = from, insert } = spec;\n                if (from > to || from < 0 || to > length)\n                    throw new RangeError(`Invalid change range ${from} to ${to} (in doc of length ${length})`);\n                let insText = !insert ? Text.empty : typeof insert == \"string\" ? Text.of(insert.split(lineSep || DefaultSplit)) : insert;\n                let insLen = insText.length;\n                if (from == to && insLen == 0)\n                    return;\n                if (from < pos)\n                    flush();\n                if (from > pos)\n                    addSection(sections, from - pos, -1);\n                addSection(sections, to - from, insLen);\n                addInsert(inserted, sections, insText);\n                pos = to;\n            }\n        }\n        process(changes);\n        flush(!total);\n        return total;\n    }\n    /**\n    Create an empty changeset of the given length.\n    */\n    static empty(length) {\n        return new ChangeSet(length ? [length, -1] : [], []);\n    }\n    /**\n    Create a changeset from its JSON representation (as produced by\n    [`toJSON`](https://codemirror.net/6/docs/ref/#state.ChangeSet.toJSON).\n    */\n    static fromJSON(json) {\n        if (!Array.isArray(json))\n            throw new RangeError(\"Invalid JSON representation of ChangeSet\");\n        let sections = [], inserted = [];\n        for (let i = 0; i < json.length; i++) {\n            let part = json[i];\n            if (typeof part == \"number\") {\n                sections.push(part, -1);\n            }\n            else if (!Array.isArray(part) || typeof part[0] != \"number\" || part.some((e, i) => i && typeof e != \"string\")) {\n                throw new RangeError(\"Invalid JSON representation of ChangeSet\");\n            }\n            else if (part.length == 1) {\n                sections.push(part[0], 0);\n            }\n            else {\n                while (inserted.length < i)\n                    inserted.push(Text.empty);\n                inserted[i] = Text.of(part.slice(1));\n                sections.push(part[0], inserted[i].length);\n            }\n        }\n        return new ChangeSet(sections, inserted);\n    }\n    /**\n    @internal\n    */\n    static createSet(sections, inserted) {\n        return new ChangeSet(sections, inserted);\n    }\n}\nfunction addSection(sections, len, ins, forceJoin = false) {\n    if (len == 0 && ins <= 0)\n        return;\n    let last = sections.length - 2;\n    if (last >= 0 && ins <= 0 && ins == sections[last + 1])\n        sections[last] += len;\n    else if (len == 0 && sections[last] == 0)\n        sections[last + 1] += ins;\n    else if (forceJoin) {\n        sections[last] += len;\n        sections[last + 1] += ins;\n    }\n    else\n        sections.push(len, ins);\n}\nfunction addInsert(values, sections, value) {\n    if (value.length == 0)\n        return;\n    let index = (sections.length - 2) >> 1;\n    if (index < values.length) {\n        values[values.length - 1] = values[values.length - 1].append(value);\n    }\n    else {\n        while (values.length < index)\n            values.push(Text.empty);\n        values.push(value);\n    }\n}\nfunction iterChanges(desc, f, individual) {\n    let inserted = desc.inserted;\n    for (let posA = 0, posB = 0, i = 0; i < desc.sections.length;) {\n        let len = desc.sections[i++], ins = desc.sections[i++];\n        if (ins < 0) {\n            posA += len;\n            posB += len;\n        }\n        else {\n            let endA = posA, endB = posB, text = Text.empty;\n            for (;;) {\n                endA += len;\n                endB += ins;\n                if (ins && inserted)\n                    text = text.append(inserted[(i - 2) >> 1]);\n                if (individual || i == desc.sections.length || desc.sections[i + 1] < 0)\n                    break;\n                len = desc.sections[i++];\n                ins = desc.sections[i++];\n            }\n            f(posA, endA, posB, endB, text);\n            posA = endA;\n            posB = endB;\n        }\n    }\n}\nfunction mapSet(setA, setB, before, mkSet = false) {\n    // Produce a copy of setA that applies to the document after setB\n    // has been applied (assuming both start at the same document).\n    let sections = [], insert = mkSet ? [] : null;\n    let a = new SectionIter(setA), b = new SectionIter(setB);\n    // Iterate over both sets in parallel. inserted tracks, for changes\n    // in A that have to be processed piece-by-piece, whether their\n    // content has been inserted already, and refers to the section\n    // index.\n    for (let inserted = -1;;) {\n        if (a.ins == -1 && b.ins == -1) {\n            // Move across ranges skipped by both sets.\n            let len = Math.min(a.len, b.len);\n            addSection(sections, len, -1);\n            a.forward(len);\n            b.forward(len);\n        }\n        else if (b.ins >= 0 && (a.ins < 0 || inserted == a.i || a.off == 0 && (b.len < a.len || b.len == a.len && !before))) {\n            // If there's a change in B that comes before the next change in\n            // A (ordered by start pos, then len, then before flag), skip\n            // that (and process any changes in A it covers).\n            let len = b.len;\n            addSection(sections, b.ins, -1);\n            while (len) {\n                let piece = Math.min(a.len, len);\n                if (a.ins >= 0 && inserted < a.i && a.len <= piece) {\n                    addSection(sections, 0, a.ins);\n                    if (insert)\n                        addInsert(insert, sections, a.text);\n                    inserted = a.i;\n                }\n                a.forward(piece);\n                len -= piece;\n            }\n            b.next();\n        }\n        else if (a.ins >= 0) {\n            // Process the part of a change in A up to the start of the next\n            // non-deletion change in B (if overlapping).\n            let len = 0, left = a.len;\n            while (left) {\n                if (b.ins == -1) {\n                    let piece = Math.min(left, b.len);\n                    len += piece;\n                    left -= piece;\n                    b.forward(piece);\n                }\n                else if (b.ins == 0 && b.len < left) {\n                    left -= b.len;\n                    b.next();\n                }\n                else {\n                    break;\n                }\n            }\n            addSection(sections, len, inserted < a.i ? a.ins : 0);\n            if (insert && inserted < a.i)\n                addInsert(insert, sections, a.text);\n            inserted = a.i;\n            a.forward(a.len - left);\n        }\n        else if (a.done && b.done) {\n            return insert ? ChangeSet.createSet(sections, insert) : ChangeDesc.create(sections);\n        }\n        else {\n            throw new Error(\"Mismatched change set lengths\");\n        }\n    }\n}\nfunction composeSets(setA, setB, mkSet = false) {\n    let sections = [];\n    let insert = mkSet ? [] : null;\n    let a = new SectionIter(setA), b = new SectionIter(setB);\n    for (let open = false;;) {\n        if (a.done && b.done) {\n            return insert ? ChangeSet.createSet(sections, insert) : ChangeDesc.create(sections);\n        }\n        else if (a.ins == 0) { // Deletion in A\n            addSection(sections, a.len, 0, open);\n            a.next();\n        }\n        else if (b.len == 0 && !b.done) { // Insertion in B\n            addSection(sections, 0, b.ins, open);\n            if (insert)\n                addInsert(insert, sections, b.text);\n            b.next();\n        }\n        else if (a.done || b.done) {\n            throw new Error(\"Mismatched change set lengths\");\n        }\n        else {\n            let len = Math.min(a.len2, b.len), sectionLen = sections.length;\n            if (a.ins == -1) {\n                let insB = b.ins == -1 ? -1 : b.off ? 0 : b.ins;\n                addSection(sections, len, insB, open);\n                if (insert && insB)\n                    addInsert(insert, sections, b.text);\n            }\n            else if (b.ins == -1) {\n                addSection(sections, a.off ? 0 : a.len, len, open);\n                if (insert)\n                    addInsert(insert, sections, a.textBit(len));\n            }\n            else {\n                addSection(sections, a.off ? 0 : a.len, b.off ? 0 : b.ins, open);\n                if (insert && !b.off)\n                    addInsert(insert, sections, b.text);\n            }\n            open = (a.ins > len || b.ins >= 0 && b.len > len) && (open || sections.length > sectionLen);\n            a.forward2(len);\n            b.forward(len);\n        }\n    }\n}\nclass SectionIter {\n    constructor(set) {\n        this.set = set;\n        this.i = 0;\n        this.next();\n    }\n    next() {\n        let { sections } = this.set;\n        if (this.i < sections.length) {\n            this.len = sections[this.i++];\n            this.ins = sections[this.i++];\n        }\n        else {\n            this.len = 0;\n            this.ins = -2;\n        }\n        this.off = 0;\n    }\n    get done() { return this.ins == -2; }\n    get len2() { return this.ins < 0 ? this.len : this.ins; }\n    get text() {\n        let { inserted } = this.set, index = (this.i - 2) >> 1;\n        return index >= inserted.length ? Text.empty : inserted[index];\n    }\n    textBit(len) {\n        let { inserted } = this.set, index = (this.i - 2) >> 1;\n        return index >= inserted.length && !len ? Text.empty\n            : inserted[index].slice(this.off, len == null ? undefined : this.off + len);\n    }\n    forward(len) {\n        if (len == this.len)\n            this.next();\n        else {\n            this.len -= len;\n            this.off += len;\n        }\n    }\n    forward2(len) {\n        if (this.ins == -1)\n            this.forward(len);\n        else if (len == this.ins)\n            this.next();\n        else {\n            this.ins -= len;\n            this.off += len;\n        }\n    }\n}\n\n/**\nA single selection range. When\n[`allowMultipleSelections`](https://codemirror.net/6/docs/ref/#state.EditorState^allowMultipleSelections)\nis enabled, a [selection](https://codemirror.net/6/docs/ref/#state.EditorSelection) may hold\nmultiple ranges. By default, selections hold exactly one range.\n*/\nclass SelectionRange {\n    constructor(\n    /**\n    The lower boundary of the range.\n    */\n    from, \n    /**\n    The upper boundary of the range.\n    */\n    to, flags) {\n        this.from = from;\n        this.to = to;\n        this.flags = flags;\n    }\n    /**\n    The anchor of the range—the side that doesn't move when you\n    extend it.\n    */\n    get anchor() { return this.flags & 16 /* RangeFlag.Inverted */ ? this.to : this.from; }\n    /**\n    The head of the range, which is moved when the range is\n    [extended](https://codemirror.net/6/docs/ref/#state.SelectionRange.extend).\n    */\n    get head() { return this.flags & 16 /* RangeFlag.Inverted */ ? this.from : this.to; }\n    /**\n    True when `anchor` and `head` are at the same position.\n    */\n    get empty() { return this.from == this.to; }\n    /**\n    If this is a cursor that is explicitly associated with the\n    character on one of its sides, this returns the side. -1 means\n    the character before its position, 1 the character after, and 0\n    means no association.\n    */\n    get assoc() { return this.flags & 4 /* RangeFlag.AssocBefore */ ? -1 : this.flags & 8 /* RangeFlag.AssocAfter */ ? 1 : 0; }\n    /**\n    The bidirectional text level associated with this cursor, if\n    any.\n    */\n    get bidiLevel() {\n        let level = this.flags & 3 /* RangeFlag.BidiLevelMask */;\n        return level == 3 ? null : level;\n    }\n    /**\n    The goal column (stored vertical offset) associated with a\n    cursor. This is used to preserve the vertical position when\n    [moving](https://codemirror.net/6/docs/ref/#view.EditorView.moveVertically) across\n    lines of different length.\n    */\n    get goalColumn() {\n        let value = this.flags >> 5 /* RangeFlag.GoalColumnOffset */;\n        return value == 33554431 /* RangeFlag.NoGoalColumn */ ? undefined : value;\n    }\n    /**\n    Map this range through a change, producing a valid range in the\n    updated document.\n    */\n    map(change, assoc = -1) {\n        let from, to;\n        if (this.empty) {\n            from = to = change.mapPos(this.from, assoc);\n        }\n        else {\n            from = change.mapPos(this.from, 1);\n            to = change.mapPos(this.to, -1);\n        }\n        return from == this.from && to == this.to ? this : new SelectionRange(from, to, this.flags);\n    }\n    /**\n    Extend this range to cover at least `from` to `to`.\n    */\n    extend(from, to = from) {\n        if (from <= this.anchor && to >= this.anchor)\n            return EditorSelection.range(from, to);\n        let head = Math.abs(from - this.anchor) > Math.abs(to - this.anchor) ? from : to;\n        return EditorSelection.range(this.anchor, head);\n    }\n    /**\n    Compare this range to another range.\n    */\n    eq(other) {\n        return this.anchor == other.anchor && this.head == other.head;\n    }\n    /**\n    Return a JSON-serializable object representing the range.\n    */\n    toJSON() { return { anchor: this.anchor, head: this.head }; }\n    /**\n    Convert a JSON representation of a range to a `SelectionRange`\n    instance.\n    */\n    static fromJSON(json) {\n        if (!json || typeof json.anchor != \"number\" || typeof json.head != \"number\")\n            throw new RangeError(\"Invalid JSON representation for SelectionRange\");\n        return EditorSelection.range(json.anchor, json.head);\n    }\n    /**\n    @internal\n    */\n    static create(from, to, flags) {\n        return new SelectionRange(from, to, flags);\n    }\n}\n/**\nAn editor selection holds one or more selection ranges.\n*/\nclass EditorSelection {\n    constructor(\n    /**\n    The ranges in the selection, sorted by position. Ranges cannot\n    overlap (but they may touch, if they aren't empty).\n    */\n    ranges, \n    /**\n    The index of the _main_ range in the selection (which is\n    usually the range that was added last).\n    */\n    mainIndex) {\n        this.ranges = ranges;\n        this.mainIndex = mainIndex;\n    }\n    /**\n    Map a selection through a change. Used to adjust the selection\n    position for changes.\n    */\n    map(change, assoc = -1) {\n        if (change.empty)\n            return this;\n        return EditorSelection.create(this.ranges.map(r => r.map(change, assoc)), this.mainIndex);\n    }\n    /**\n    Compare this selection to another selection.\n    */\n    eq(other) {\n        if (this.ranges.length != other.ranges.length ||\n            this.mainIndex != other.mainIndex)\n            return false;\n        for (let i = 0; i < this.ranges.length; i++)\n            if (!this.ranges[i].eq(other.ranges[i]))\n                return false;\n        return true;\n    }\n    /**\n    Get the primary selection range. Usually, you should make sure\n    your code applies to _all_ ranges, by using methods like\n    [`changeByRange`](https://codemirror.net/6/docs/ref/#state.EditorState.changeByRange).\n    */\n    get main() { return this.ranges[this.mainIndex]; }\n    /**\n    Make sure the selection only has one range. Returns a selection\n    holding only the main range from this selection.\n    */\n    asSingle() {\n        return this.ranges.length == 1 ? this : new EditorSelection([this.main], 0);\n    }\n    /**\n    Extend this selection with an extra range.\n    */\n    addRange(range, main = true) {\n        return EditorSelection.create([range].concat(this.ranges), main ? 0 : this.mainIndex + 1);\n    }\n    /**\n    Replace a given range with another range, and then normalize the\n    selection to merge and sort ranges if necessary.\n    */\n    replaceRange(range, which = this.mainIndex) {\n        let ranges = this.ranges.slice();\n        ranges[which] = range;\n        return EditorSelection.create(ranges, this.mainIndex);\n    }\n    /**\n    Convert this selection to an object that can be serialized to\n    JSON.\n    */\n    toJSON() {\n        return { ranges: this.ranges.map(r => r.toJSON()), main: this.mainIndex };\n    }\n    /**\n    Create a selection from a JSON representation.\n    */\n    static fromJSON(json) {\n        if (!json || !Array.isArray(json.ranges) || typeof json.main != \"number\" || json.main >= json.ranges.length)\n            throw new RangeError(\"Invalid JSON representation for EditorSelection\");\n        return new EditorSelection(json.ranges.map((r) => SelectionRange.fromJSON(r)), json.main);\n    }\n    /**\n    Create a selection holding a single range.\n    */\n    static single(anchor, head = anchor) {\n        return new EditorSelection([EditorSelection.range(anchor, head)], 0);\n    }\n    /**\n    Sort and merge the given set of ranges, creating a valid\n    selection.\n    */\n    static create(ranges, mainIndex = 0) {\n        if (ranges.length == 0)\n            throw new RangeError(\"A selection needs at least one range\");\n        for (let pos = 0, i = 0; i < ranges.length; i++) {\n            let range = ranges[i];\n            if (range.empty ? range.from <= pos : range.from < pos)\n                return EditorSelection.normalized(ranges.slice(), mainIndex);\n            pos = range.to;\n        }\n        return new EditorSelection(ranges, mainIndex);\n    }\n    /**\n    Create a cursor selection range at the given position. You can\n    safely ignore the optional arguments in most situations.\n    */\n    static cursor(pos, assoc = 0, bidiLevel, goalColumn) {\n        return SelectionRange.create(pos, pos, (assoc == 0 ? 0 : assoc < 0 ? 4 /* RangeFlag.AssocBefore */ : 8 /* RangeFlag.AssocAfter */) |\n            (bidiLevel == null ? 3 : Math.min(2, bidiLevel)) |\n            ((goalColumn !== null && goalColumn !== void 0 ? goalColumn : 33554431 /* RangeFlag.NoGoalColumn */) << 5 /* RangeFlag.GoalColumnOffset */));\n    }\n    /**\n    Create a selection range.\n    */\n    static range(anchor, head, goalColumn, bidiLevel) {\n        let flags = ((goalColumn !== null && goalColumn !== void 0 ? goalColumn : 33554431 /* RangeFlag.NoGoalColumn */) << 5 /* RangeFlag.GoalColumnOffset */) |\n            (bidiLevel == null ? 3 : Math.min(2, bidiLevel));\n        return head < anchor ? SelectionRange.create(head, anchor, 16 /* RangeFlag.Inverted */ | 8 /* RangeFlag.AssocAfter */ | flags)\n            : SelectionRange.create(anchor, head, (head > anchor ? 4 /* RangeFlag.AssocBefore */ : 0) | flags);\n    }\n    /**\n    @internal\n    */\n    static normalized(ranges, mainIndex = 0) {\n        let main = ranges[mainIndex];\n        ranges.sort((a, b) => a.from - b.from);\n        mainIndex = ranges.indexOf(main);\n        for (let i = 1; i < ranges.length; i++) {\n            let range = ranges[i], prev = ranges[i - 1];\n            if (range.empty ? range.from <= prev.to : range.from < prev.to) {\n                let from = prev.from, to = Math.max(range.to, prev.to);\n                if (i <= mainIndex)\n                    mainIndex--;\n                ranges.splice(--i, 2, range.anchor > range.head ? EditorSelection.range(to, from) : EditorSelection.range(from, to));\n            }\n        }\n        return new EditorSelection(ranges, mainIndex);\n    }\n}\nfunction checkSelection(selection, docLength) {\n    for (let range of selection.ranges)\n        if (range.to > docLength)\n            throw new RangeError(\"Selection points outside of document\");\n}\n\nlet nextID = 0;\n/**\nA facet is a labeled value that is associated with an editor\nstate. It takes inputs from any number of extensions, and combines\nthose into a single output value.\n\nExamples of uses of facets are the [tab\nsize](https://codemirror.net/6/docs/ref/#state.EditorState^tabSize), [editor\nattributes](https://codemirror.net/6/docs/ref/#view.EditorView^editorAttributes), and [update\nlisteners](https://codemirror.net/6/docs/ref/#view.EditorView^updateListener).\n*/\nclass Facet {\n    constructor(\n    /**\n    @internal\n    */\n    combine, \n    /**\n    @internal\n    */\n    compareInput, \n    /**\n    @internal\n    */\n    compare, isStatic, enables) {\n        this.combine = combine;\n        this.compareInput = compareInput;\n        this.compare = compare;\n        this.isStatic = isStatic;\n        /**\n        @internal\n        */\n        this.id = nextID++;\n        this.default = combine([]);\n        this.extensions = typeof enables == \"function\" ? enables(this) : enables;\n    }\n    /**\n    Define a new facet.\n    */\n    static define(config = {}) {\n        return new Facet(config.combine || ((a) => a), config.compareInput || ((a, b) => a === b), config.compare || (!config.combine ? sameArray : (a, b) => a === b), !!config.static, config.enables);\n    }\n    /**\n    Returns an extension that adds the given value to this facet.\n    */\n    of(value) {\n        return new FacetProvider([], this, 0 /* Provider.Static */, value);\n    }\n    /**\n    Create an extension that computes a value for the facet from a\n    state. You must take care to declare the parts of the state that\n    this value depends on, since your function is only called again\n    for a new state when one of those parts changed.\n    \n    In cases where your value depends only on a single field, you'll\n    want to use the [`from`](https://codemirror.net/6/docs/ref/#state.Facet.from) method instead.\n    */\n    compute(deps, get) {\n        if (this.isStatic)\n            throw new Error(\"Can't compute a static facet\");\n        return new FacetProvider(deps, this, 1 /* Provider.Single */, get);\n    }\n    /**\n    Create an extension that computes zero or more values for this\n    facet from a state.\n    */\n    computeN(deps, get) {\n        if (this.isStatic)\n            throw new Error(\"Can't compute a static facet\");\n        return new FacetProvider(deps, this, 2 /* Provider.Multi */, get);\n    }\n    from(field, get) {\n        if (!get)\n            get = x => x;\n        return this.compute([field], state => get(state.field(field)));\n    }\n}\nfunction sameArray(a, b) {\n    return a == b || a.length == b.length && a.every((e, i) => e === b[i]);\n}\nclass FacetProvider {\n    constructor(dependencies, facet, type, value) {\n        this.dependencies = dependencies;\n        this.facet = facet;\n        this.type = type;\n        this.value = value;\n        this.id = nextID++;\n    }\n    dynamicSlot(addresses) {\n        var _a;\n        let getter = this.value;\n        let compare = this.facet.compareInput;\n        let id = this.id, idx = addresses[id] >> 1, multi = this.type == 2 /* Provider.Multi */;\n        let depDoc = false, depSel = false, depAddrs = [];\n        for (let dep of this.dependencies) {\n            if (dep == \"doc\")\n                depDoc = true;\n            else if (dep == \"selection\")\n                depSel = true;\n            else if ((((_a = addresses[dep.id]) !== null && _a !== void 0 ? _a : 1) & 1) == 0)\n                depAddrs.push(addresses[dep.id]);\n        }\n        return {\n            create(state) {\n                state.values[idx] = getter(state);\n                return 1 /* SlotStatus.Changed */;\n            },\n            update(state, tr) {\n                if ((depDoc && tr.docChanged) || (depSel && (tr.docChanged || tr.selection)) || ensureAll(state, depAddrs)) {\n                    let newVal = getter(state);\n                    if (multi ? !compareArray(newVal, state.values[idx], compare) : !compare(newVal, state.values[idx])) {\n                        state.values[idx] = newVal;\n                        return 1 /* SlotStatus.Changed */;\n                    }\n                }\n                return 0;\n            },\n            reconfigure: (state, oldState) => {\n                let newVal, oldAddr = oldState.config.address[id];\n                if (oldAddr != null) {\n                    let oldVal = getAddr(oldState, oldAddr);\n                    if (this.dependencies.every(dep => {\n                        return dep instanceof Facet ? oldState.facet(dep) === state.facet(dep) :\n                            dep instanceof StateField ? oldState.field(dep, false) == state.field(dep, false) : true;\n                    }) || (multi ? compareArray(newVal = getter(state), oldVal, compare) : compare(newVal = getter(state), oldVal))) {\n                        state.values[idx] = oldVal;\n                        return 0;\n                    }\n                }\n                else {\n                    newVal = getter(state);\n                }\n                state.values[idx] = newVal;\n                return 1 /* SlotStatus.Changed */;\n            }\n        };\n    }\n}\nfunction compareArray(a, b, compare) {\n    if (a.length != b.length)\n        return false;\n    for (let i = 0; i < a.length; i++)\n        if (!compare(a[i], b[i]))\n            return false;\n    return true;\n}\nfunction ensureAll(state, addrs) {\n    let changed = false;\n    for (let addr of addrs)\n        if (ensureAddr(state, addr) & 1 /* SlotStatus.Changed */)\n            changed = true;\n    return changed;\n}\nfunction dynamicFacetSlot(addresses, facet, providers) {\n    let providerAddrs = providers.map(p => addresses[p.id]);\n    let providerTypes = providers.map(p => p.type);\n    let dynamic = providerAddrs.filter(p => !(p & 1));\n    let idx = addresses[facet.id] >> 1;\n    function get(state) {\n        let values = [];\n        for (let i = 0; i < providerAddrs.length; i++) {\n            let value = getAddr(state, providerAddrs[i]);\n            if (providerTypes[i] == 2 /* Provider.Multi */)\n                for (let val of value)\n                    values.push(val);\n            else\n                values.push(value);\n        }\n        return facet.combine(values);\n    }\n    return {\n        create(state) {\n            for (let addr of providerAddrs)\n                ensureAddr(state, addr);\n            state.values[idx] = get(state);\n            return 1 /* SlotStatus.Changed */;\n        },\n        update(state, tr) {\n            if (!ensureAll(state, dynamic))\n                return 0;\n            let value = get(state);\n            if (facet.compare(value, state.values[idx]))\n                return 0;\n            state.values[idx] = value;\n            return 1 /* SlotStatus.Changed */;\n        },\n        reconfigure(state, oldState) {\n            let depChanged = ensureAll(state, providerAddrs);\n            let oldProviders = oldState.config.facets[facet.id], oldValue = oldState.facet(facet);\n            if (oldProviders && !depChanged && sameArray(providers, oldProviders)) {\n                state.values[idx] = oldValue;\n                return 0;\n            }\n            let value = get(state);\n            if (facet.compare(value, oldValue)) {\n                state.values[idx] = oldValue;\n                return 0;\n            }\n            state.values[idx] = value;\n            return 1 /* SlotStatus.Changed */;\n        }\n    };\n}\nconst initField = /*@__PURE__*/Facet.define({ static: true });\n/**\nFields can store additional information in an editor state, and\nkeep it in sync with the rest of the state.\n*/\nclass StateField {\n    constructor(\n    /**\n    @internal\n    */\n    id, createF, updateF, compareF, \n    /**\n    @internal\n    */\n    spec) {\n        this.id = id;\n        this.createF = createF;\n        this.updateF = updateF;\n        this.compareF = compareF;\n        this.spec = spec;\n        /**\n        @internal\n        */\n        this.provides = undefined;\n    }\n    /**\n    Define a state field.\n    */\n    static define(config) {\n        let field = new StateField(nextID++, config.create, config.update, config.compare || ((a, b) => a === b), config);\n        if (config.provide)\n            field.provides = config.provide(field);\n        return field;\n    }\n    create(state) {\n        let init = state.facet(initField).find(i => i.field == this);\n        return ((init === null || init === void 0 ? void 0 : init.create) || this.createF)(state);\n    }\n    /**\n    @internal\n    */\n    slot(addresses) {\n        let idx = addresses[this.id] >> 1;\n        return {\n            create: (state) => {\n                state.values[idx] = this.create(state);\n                return 1 /* SlotStatus.Changed */;\n            },\n            update: (state, tr) => {\n                let oldVal = state.values[idx];\n                let value = this.updateF(oldVal, tr);\n                if (this.compareF(oldVal, value))\n                    return 0;\n                state.values[idx] = value;\n                return 1 /* SlotStatus.Changed */;\n            },\n            reconfigure: (state, oldState) => {\n                if (oldState.config.address[this.id] != null) {\n                    state.values[idx] = oldState.field(this);\n                    return 0;\n                }\n                state.values[idx] = this.create(state);\n                return 1 /* SlotStatus.Changed */;\n            }\n        };\n    }\n    /**\n    Returns an extension that enables this field and overrides the\n    way it is initialized. Can be useful when you need to provide a\n    non-default starting value for the field.\n    */\n    init(create) {\n        return [this, initField.of({ field: this, create })];\n    }\n    /**\n    State field instances can be used as\n    [`Extension`](https://codemirror.net/6/docs/ref/#state.Extension) values to enable the field in a\n    given state.\n    */\n    get extension() { return this; }\n}\nconst Prec_ = { lowest: 4, low: 3, default: 2, high: 1, highest: 0 };\nfunction prec(value) {\n    return (ext) => new PrecExtension(ext, value);\n}\n/**\nBy default extensions are registered in the order they are found\nin the flattened form of nested array that was provided.\nIndividual extension values can be assigned a precedence to\noverride this. Extensions that do not have a precedence set get\nthe precedence of the nearest parent with a precedence, or\n[`default`](https://codemirror.net/6/docs/ref/#state.Prec.default) if there is no such parent. The\nfinal ordering of extensions is determined by first sorting by\nprecedence and then by order within each precedence.\n*/\nconst Prec = {\n    /**\n    The highest precedence level, for extensions that should end up\n    near the start of the precedence ordering.\n    */\n    highest: /*@__PURE__*/prec(Prec_.highest),\n    /**\n    A higher-than-default precedence, for extensions that should\n    come before those with default precedence.\n    */\n    high: /*@__PURE__*/prec(Prec_.high),\n    /**\n    The default precedence, which is also used for extensions\n    without an explicit precedence.\n    */\n    default: /*@__PURE__*/prec(Prec_.default),\n    /**\n    A lower-than-default precedence.\n    */\n    low: /*@__PURE__*/prec(Prec_.low),\n    /**\n    The lowest precedence level. Meant for things that should end up\n    near the end of the extension order.\n    */\n    lowest: /*@__PURE__*/prec(Prec_.lowest)\n};\nclass PrecExtension {\n    constructor(inner, prec) {\n        this.inner = inner;\n        this.prec = prec;\n    }\n}\n/**\nExtension compartments can be used to make a configuration\ndynamic. By [wrapping](https://codemirror.net/6/docs/ref/#state.Compartment.of) part of your\nconfiguration in a compartment, you can later\n[replace](https://codemirror.net/6/docs/ref/#state.Compartment.reconfigure) that part through a\ntransaction.\n*/\nclass Compartment {\n    /**\n    Create an instance of this compartment to add to your [state\n    configuration](https://codemirror.net/6/docs/ref/#state.EditorStateConfig.extensions).\n    */\n    of(ext) { return new CompartmentInstance(this, ext); }\n    /**\n    Create an [effect](https://codemirror.net/6/docs/ref/#state.TransactionSpec.effects) that\n    reconfigures this compartment.\n    */\n    reconfigure(content) {\n        return Compartment.reconfigure.of({ compartment: this, extension: content });\n    }\n    /**\n    Get the current content of the compartment in the state, or\n    `undefined` if it isn't present.\n    */\n    get(state) {\n        return state.config.compartments.get(this);\n    }\n}\nclass CompartmentInstance {\n    constructor(compartment, inner) {\n        this.compartment = compartment;\n        this.inner = inner;\n    }\n}\nclass Configuration {\n    constructor(base, compartments, dynamicSlots, address, staticValues, facets) {\n        this.base = base;\n        this.compartments = compartments;\n        this.dynamicSlots = dynamicSlots;\n        this.address = address;\n        this.staticValues = staticValues;\n        this.facets = facets;\n        this.statusTemplate = [];\n        while (this.statusTemplate.length < dynamicSlots.length)\n            this.statusTemplate.push(0 /* SlotStatus.Unresolved */);\n    }\n    staticFacet(facet) {\n        let addr = this.address[facet.id];\n        return addr == null ? facet.default : this.staticValues[addr >> 1];\n    }\n    static resolve(base, compartments, oldState) {\n        let fields = [];\n        let facets = Object.create(null);\n        let newCompartments = new Map();\n        for (let ext of flatten(base, compartments, newCompartments)) {\n            if (ext instanceof StateField)\n                fields.push(ext);\n            else\n                (facets[ext.facet.id] || (facets[ext.facet.id] = [])).push(ext);\n        }\n        let address = Object.create(null);\n        let staticValues = [];\n        let dynamicSlots = [];\n        for (let field of fields) {\n            address[field.id] = dynamicSlots.length << 1;\n            dynamicSlots.push(a => field.slot(a));\n        }\n        let oldFacets = oldState === null || oldState === void 0 ? void 0 : oldState.config.facets;\n        for (let id in facets) {\n            let providers = facets[id], facet = providers[0].facet;\n            let oldProviders = oldFacets && oldFacets[id] || [];\n            if (providers.every(p => p.type == 0 /* Provider.Static */)) {\n                address[facet.id] = (staticValues.length << 1) | 1;\n                if (sameArray(oldProviders, providers)) {\n                    staticValues.push(oldState.facet(facet));\n                }\n                else {\n                    let value = facet.combine(providers.map(p => p.value));\n                    staticValues.push(oldState && facet.compare(value, oldState.facet(facet)) ? oldState.facet(facet) : value);\n                }\n            }\n            else {\n                for (let p of providers) {\n                    if (p.type == 0 /* Provider.Static */) {\n                        address[p.id] = (staticValues.length << 1) | 1;\n                        staticValues.push(p.value);\n                    }\n                    else {\n                        address[p.id] = dynamicSlots.length << 1;\n                        dynamicSlots.push(a => p.dynamicSlot(a));\n                    }\n                }\n                address[facet.id] = dynamicSlots.length << 1;\n                dynamicSlots.push(a => dynamicFacetSlot(a, facet, providers));\n            }\n        }\n        let dynamic = dynamicSlots.map(f => f(address));\n        return new Configuration(base, newCompartments, dynamic, address, staticValues, facets);\n    }\n}\nfunction flatten(extension, compartments, newCompartments) {\n    let result = [[], [], [], [], []];\n    let seen = new Map();\n    function inner(ext, prec) {\n        let known = seen.get(ext);\n        if (known != null) {\n            if (known <= prec)\n                return;\n            let found = result[known].indexOf(ext);\n            if (found > -1)\n                result[known].splice(found, 1);\n            if (ext instanceof CompartmentInstance)\n                newCompartments.delete(ext.compartment);\n        }\n        seen.set(ext, prec);\n        if (Array.isArray(ext)) {\n            for (let e of ext)\n                inner(e, prec);\n        }\n        else if (ext instanceof CompartmentInstance) {\n            if (newCompartments.has(ext.compartment))\n                throw new RangeError(`Duplicate use of compartment in extensions`);\n            let content = compartments.get(ext.compartment) || ext.inner;\n            newCompartments.set(ext.compartment, content);\n            inner(content, prec);\n        }\n        else if (ext instanceof PrecExtension) {\n            inner(ext.inner, ext.prec);\n        }\n        else if (ext instanceof StateField) {\n            result[prec].push(ext);\n            if (ext.provides)\n                inner(ext.provides, prec);\n        }\n        else if (ext instanceof FacetProvider) {\n            result[prec].push(ext);\n            if (ext.facet.extensions)\n                inner(ext.facet.extensions, Prec_.default);\n        }\n        else {\n            let content = ext.extension;\n            if (!content)\n                throw new Error(`Unrecognized extension value in extension set (${ext}). This sometimes happens because multiple instances of @codemirror/state are loaded, breaking instanceof checks.`);\n            inner(content, prec);\n        }\n    }\n    inner(extension, Prec_.default);\n    return result.reduce((a, b) => a.concat(b));\n}\nfunction ensureAddr(state, addr) {\n    if (addr & 1)\n        return 2 /* SlotStatus.Computed */;\n    let idx = addr >> 1;\n    let status = state.status[idx];\n    if (status == 4 /* SlotStatus.Computing */)\n        throw new Error(\"Cyclic dependency between fields and/or facets\");\n    if (status & 2 /* SlotStatus.Computed */)\n        return status;\n    state.status[idx] = 4 /* SlotStatus.Computing */;\n    let changed = state.computeSlot(state, state.config.dynamicSlots[idx]);\n    return state.status[idx] = 2 /* SlotStatus.Computed */ | changed;\n}\nfunction getAddr(state, addr) {\n    return addr & 1 ? state.config.staticValues[addr >> 1] : state.values[addr >> 1];\n}\n\nconst languageData = /*@__PURE__*/Facet.define();\nconst allowMultipleSelections = /*@__PURE__*/Facet.define({\n    combine: values => values.some(v => v),\n    static: true\n});\nconst lineSeparator = /*@__PURE__*/Facet.define({\n    combine: values => values.length ? values[0] : undefined,\n    static: true\n});\nconst changeFilter = /*@__PURE__*/Facet.define();\nconst transactionFilter = /*@__PURE__*/Facet.define();\nconst transactionExtender = /*@__PURE__*/Facet.define();\nconst readOnly = /*@__PURE__*/Facet.define({\n    combine: values => values.length ? values[0] : false\n});\n\n/**\nAnnotations are tagged values that are used to add metadata to\ntransactions in an extensible way. They should be used to model\nthings that effect the entire transaction (such as its [time\nstamp](https://codemirror.net/6/docs/ref/#state.Transaction^time) or information about its\n[origin](https://codemirror.net/6/docs/ref/#state.Transaction^userEvent)). For effects that happen\n_alongside_ the other changes made by the transaction, [state\neffects](https://codemirror.net/6/docs/ref/#state.StateEffect) are more appropriate.\n*/\nclass Annotation {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    The annotation type.\n    */\n    type, \n    /**\n    The value of this annotation.\n    */\n    value) {\n        this.type = type;\n        this.value = value;\n    }\n    /**\n    Define a new type of annotation.\n    */\n    static define() { return new AnnotationType(); }\n}\n/**\nMarker that identifies a type of [annotation](https://codemirror.net/6/docs/ref/#state.Annotation).\n*/\nclass AnnotationType {\n    /**\n    Create an instance of this annotation.\n    */\n    of(value) { return new Annotation(this, value); }\n}\n/**\nRepresentation of a type of state effect. Defined with\n[`StateEffect.define`](https://codemirror.net/6/docs/ref/#state.StateEffect^define).\n*/\nclass StateEffectType {\n    /**\n    @internal\n    */\n    constructor(\n    // The `any` types in these function types are there to work\n    // around TypeScript issue #37631, where the type guard on\n    // `StateEffect.is` mysteriously stops working when these properly\n    // have type `Value`.\n    /**\n    @internal\n    */\n    map) {\n        this.map = map;\n    }\n    /**\n    Create a [state effect](https://codemirror.net/6/docs/ref/#state.StateEffect) instance of this\n    type.\n    */\n    of(value) { return new StateEffect(this, value); }\n}\n/**\nState effects can be used to represent additional effects\nassociated with a [transaction](https://codemirror.net/6/docs/ref/#state.Transaction.effects). They\nare often useful to model changes to custom [state\nfields](https://codemirror.net/6/docs/ref/#state.StateField), when those changes aren't implicit in\ndocument or selection changes.\n*/\nclass StateEffect {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    @internal\n    */\n    type, \n    /**\n    The value of this effect.\n    */\n    value) {\n        this.type = type;\n        this.value = value;\n    }\n    /**\n    Map this effect through a position mapping. Will return\n    `undefined` when that ends up deleting the effect.\n    */\n    map(mapping) {\n        let mapped = this.type.map(this.value, mapping);\n        return mapped === undefined ? undefined : mapped == this.value ? this : new StateEffect(this.type, mapped);\n    }\n    /**\n    Tells you whether this effect object is of a given\n    [type](https://codemirror.net/6/docs/ref/#state.StateEffectType).\n    */\n    is(type) { return this.type == type; }\n    /**\n    Define a new effect type. The type parameter indicates the type\n    of values that his effect holds. It should be a type that\n    doesn't include `undefined`, since that is used in\n    [mapping](https://codemirror.net/6/docs/ref/#state.StateEffect.map) to indicate that an effect is\n    removed.\n    */\n    static define(spec = {}) {\n        return new StateEffectType(spec.map || (v => v));\n    }\n    /**\n    Map an array of effects through a change set.\n    */\n    static mapEffects(effects, mapping) {\n        if (!effects.length)\n            return effects;\n        let result = [];\n        for (let effect of effects) {\n            let mapped = effect.map(mapping);\n            if (mapped)\n                result.push(mapped);\n        }\n        return result;\n    }\n}\n/**\nThis effect can be used to reconfigure the root extensions of\nthe editor. Doing this will discard any extensions\n[appended](https://codemirror.net/6/docs/ref/#state.StateEffect^appendConfig), but does not reset\nthe content of [reconfigured](https://codemirror.net/6/docs/ref/#state.Compartment.reconfigure)\ncompartments.\n*/\nStateEffect.reconfigure = /*@__PURE__*/StateEffect.define();\n/**\nAppend extensions to the top-level configuration of the editor.\n*/\nStateEffect.appendConfig = /*@__PURE__*/StateEffect.define();\n/**\nChanges to the editor state are grouped into transactions.\nTypically, a user action creates a single transaction, which may\ncontain any number of document changes, may change the selection,\nor have other effects. Create a transaction by calling\n[`EditorState.update`](https://codemirror.net/6/docs/ref/#state.EditorState.update), or immediately\ndispatch one by calling\n[`EditorView.dispatch`](https://codemirror.net/6/docs/ref/#view.EditorView.dispatch).\n*/\nclass Transaction {\n    constructor(\n    /**\n    The state from which the transaction starts.\n    */\n    startState, \n    /**\n    The document changes made by this transaction.\n    */\n    changes, \n    /**\n    The selection set by this transaction, or undefined if it\n    doesn't explicitly set a selection.\n    */\n    selection, \n    /**\n    The effects added to the transaction.\n    */\n    effects, \n    /**\n    @internal\n    */\n    annotations, \n    /**\n    Whether the selection should be scrolled into view after this\n    transaction is dispatched.\n    */\n    scrollIntoView) {\n        this.startState = startState;\n        this.changes = changes;\n        this.selection = selection;\n        this.effects = effects;\n        this.annotations = annotations;\n        this.scrollIntoView = scrollIntoView;\n        /**\n        @internal\n        */\n        this._doc = null;\n        /**\n        @internal\n        */\n        this._state = null;\n        if (selection)\n            checkSelection(selection, changes.newLength);\n        if (!annotations.some((a) => a.type == Transaction.time))\n            this.annotations = annotations.concat(Transaction.time.of(Date.now()));\n    }\n    /**\n    @internal\n    */\n    static create(startState, changes, selection, effects, annotations, scrollIntoView) {\n        return new Transaction(startState, changes, selection, effects, annotations, scrollIntoView);\n    }\n    /**\n    The new document produced by the transaction. Contrary to\n    [`.state`](https://codemirror.net/6/docs/ref/#state.Transaction.state)`.doc`, accessing this won't\n    force the entire new state to be computed right away, so it is\n    recommended that [transaction\n    filters](https://codemirror.net/6/docs/ref/#state.EditorState^transactionFilter) use this getter\n    when they need to look at the new document.\n    */\n    get newDoc() {\n        return this._doc || (this._doc = this.changes.apply(this.startState.doc));\n    }\n    /**\n    The new selection produced by the transaction. If\n    [`this.selection`](https://codemirror.net/6/docs/ref/#state.Transaction.selection) is undefined,\n    this will [map](https://codemirror.net/6/docs/ref/#state.EditorSelection.map) the start state's\n    current selection through the changes made by the transaction.\n    */\n    get newSelection() {\n        return this.selection || this.startState.selection.map(this.changes);\n    }\n    /**\n    The new state created by the transaction. Computed on demand\n    (but retained for subsequent access), so it is recommended not to\n    access it in [transaction\n    filters](https://codemirror.net/6/docs/ref/#state.EditorState^transactionFilter) when possible.\n    */\n    get state() {\n        if (!this._state)\n            this.startState.applyTransaction(this);\n        return this._state;\n    }\n    /**\n    Get the value of the given annotation type, if any.\n    */\n    annotation(type) {\n        for (let ann of this.annotations)\n            if (ann.type == type)\n                return ann.value;\n        return undefined;\n    }\n    /**\n    Indicates whether the transaction changed the document.\n    */\n    get docChanged() { return !this.changes.empty; }\n    /**\n    Indicates whether this transaction reconfigures the state\n    (through a [configuration compartment](https://codemirror.net/6/docs/ref/#state.Compartment) or\n    with a top-level configuration\n    [effect](https://codemirror.net/6/docs/ref/#state.StateEffect^reconfigure).\n    */\n    get reconfigured() { return this.startState.config != this.state.config; }\n    /**\n    Returns true if the transaction has a [user\n    event](https://codemirror.net/6/docs/ref/#state.Transaction^userEvent) annotation that is equal to\n    or more specific than `event`. For example, if the transaction\n    has `\"select.pointer\"` as user event, `\"select\"` and\n    `\"select.pointer\"` will match it.\n    */\n    isUserEvent(event) {\n        let e = this.annotation(Transaction.userEvent);\n        return !!(e && (e == event || e.length > event.length && e.slice(0, event.length) == event && e[event.length] == \".\"));\n    }\n}\n/**\nAnnotation used to store transaction timestamps. Automatically\nadded to every transaction, holding `Date.now()`.\n*/\nTransaction.time = /*@__PURE__*/Annotation.define();\n/**\nAnnotation used to associate a transaction with a user interface\nevent. Holds a string identifying the event, using a\ndot-separated format to support attaching more specific\ninformation. The events used by the core libraries are:\n\n - `\"input\"` when content is entered\n   - `\"input.type\"` for typed input\n     - `\"input.type.compose\"` for composition\n   - `\"input.paste\"` for pasted input\n   - `\"input.drop\"` when adding content with drag-and-drop\n   - `\"input.complete\"` when autocompleting\n - `\"delete\"` when the user deletes content\n   - `\"delete.selection\"` when deleting the selection\n   - `\"delete.forward\"` when deleting forward from the selection\n   - `\"delete.backward\"` when deleting backward from the selection\n   - `\"delete.cut\"` when cutting to the clipboard\n - `\"move\"` when content is moved\n   - `\"move.drop\"` when content is moved within the editor through drag-and-drop\n - `\"select\"` when explicitly changing the selection\n   - `\"select.pointer\"` when selecting with a mouse or other pointing device\n - `\"undo\"` and `\"redo\"` for history actions\n\nUse [`isUserEvent`](https://codemirror.net/6/docs/ref/#state.Transaction.isUserEvent) to check\nwhether the annotation matches a given event.\n*/\nTransaction.userEvent = /*@__PURE__*/Annotation.define();\n/**\nAnnotation indicating whether a transaction should be added to\nthe undo history or not.\n*/\nTransaction.addToHistory = /*@__PURE__*/Annotation.define();\n/**\nAnnotation indicating (when present and true) that a transaction\nrepresents a change made by some other actor, not the user. This\nis used, for example, to tag other people's changes in\ncollaborative editing.\n*/\nTransaction.remote = /*@__PURE__*/Annotation.define();\nfunction joinRanges(a, b) {\n    let result = [];\n    for (let iA = 0, iB = 0;;) {\n        let from, to;\n        if (iA < a.length && (iB == b.length || b[iB] >= a[iA])) {\n            from = a[iA++];\n            to = a[iA++];\n        }\n        else if (iB < b.length) {\n            from = b[iB++];\n            to = b[iB++];\n        }\n        else\n            return result;\n        if (!result.length || result[result.length - 1] < from)\n            result.push(from, to);\n        else if (result[result.length - 1] < to)\n            result[result.length - 1] = to;\n    }\n}\nfunction mergeTransaction(a, b, sequential) {\n    var _a;\n    let mapForA, mapForB, changes;\n    if (sequential) {\n        mapForA = b.changes;\n        mapForB = ChangeSet.empty(b.changes.length);\n        changes = a.changes.compose(b.changes);\n    }\n    else {\n        mapForA = b.changes.map(a.changes);\n        mapForB = a.changes.mapDesc(b.changes, true);\n        changes = a.changes.compose(mapForA);\n    }\n    return {\n        changes,\n        selection: b.selection ? b.selection.map(mapForB) : (_a = a.selection) === null || _a === void 0 ? void 0 : _a.map(mapForA),\n        effects: StateEffect.mapEffects(a.effects, mapForA).concat(StateEffect.mapEffects(b.effects, mapForB)),\n        annotations: a.annotations.length ? a.annotations.concat(b.annotations) : b.annotations,\n        scrollIntoView: a.scrollIntoView || b.scrollIntoView\n    };\n}\nfunction resolveTransactionInner(state, spec, docSize) {\n    let sel = spec.selection, annotations = asArray(spec.annotations);\n    if (spec.userEvent)\n        annotations = annotations.concat(Transaction.userEvent.of(spec.userEvent));\n    return {\n        changes: spec.changes instanceof ChangeSet ? spec.changes\n            : ChangeSet.of(spec.changes || [], docSize, state.facet(lineSeparator)),\n        selection: sel && (sel instanceof EditorSelection ? sel : EditorSelection.single(sel.anchor, sel.head)),\n        effects: asArray(spec.effects),\n        annotations,\n        scrollIntoView: !!spec.scrollIntoView\n    };\n}\nfunction resolveTransaction(state, specs, filter) {\n    let s = resolveTransactionInner(state, specs.length ? specs[0] : {}, state.doc.length);\n    if (specs.length && specs[0].filter === false)\n        filter = false;\n    for (let i = 1; i < specs.length; i++) {\n        if (specs[i].filter === false)\n            filter = false;\n        let seq = !!specs[i].sequential;\n        s = mergeTransaction(s, resolveTransactionInner(state, specs[i], seq ? s.changes.newLength : state.doc.length), seq);\n    }\n    let tr = Transaction.create(state, s.changes, s.selection, s.effects, s.annotations, s.scrollIntoView);\n    return extendTransaction(filter ? filterTransaction(tr) : tr);\n}\n// Finish a transaction by applying filters if necessary.\nfunction filterTransaction(tr) {\n    let state = tr.startState;\n    // Change filters\n    let result = true;\n    for (let filter of state.facet(changeFilter)) {\n        let value = filter(tr);\n        if (value === false) {\n            result = false;\n            break;\n        }\n        if (Array.isArray(value))\n            result = result === true ? value : joinRanges(result, value);\n    }\n    if (result !== true) {\n        let changes, back;\n        if (result === false) {\n            back = tr.changes.invertedDesc;\n            changes = ChangeSet.empty(state.doc.length);\n        }\n        else {\n            let filtered = tr.changes.filter(result);\n            changes = filtered.changes;\n            back = filtered.filtered.mapDesc(filtered.changes).invertedDesc;\n        }\n        tr = Transaction.create(state, changes, tr.selection && tr.selection.map(back), StateEffect.mapEffects(tr.effects, back), tr.annotations, tr.scrollIntoView);\n    }\n    // Transaction filters\n    let filters = state.facet(transactionFilter);\n    for (let i = filters.length - 1; i >= 0; i--) {\n        let filtered = filters[i](tr);\n        if (filtered instanceof Transaction)\n            tr = filtered;\n        else if (Array.isArray(filtered) && filtered.length == 1 && filtered[0] instanceof Transaction)\n            tr = filtered[0];\n        else\n            tr = resolveTransaction(state, asArray(filtered), false);\n    }\n    return tr;\n}\nfunction extendTransaction(tr) {\n    let state = tr.startState, extenders = state.facet(transactionExtender), spec = tr;\n    for (let i = extenders.length - 1; i >= 0; i--) {\n        let extension = extenders[i](tr);\n        if (extension && Object.keys(extension).length)\n            spec = mergeTransaction(spec, resolveTransactionInner(state, extension, tr.changes.newLength), true);\n    }\n    return spec == tr ? tr : Transaction.create(state, tr.changes, tr.selection, spec.effects, spec.annotations, spec.scrollIntoView);\n}\nconst none = [];\nfunction asArray(value) {\n    return value == null ? none : Array.isArray(value) ? value : [value];\n}\n\n/**\nThe categories produced by a [character\ncategorizer](https://codemirror.net/6/docs/ref/#state.EditorState.charCategorizer). These are used\ndo things like selecting by word.\n*/\nvar CharCategory = /*@__PURE__*/(function (CharCategory) {\n    /**\n    Word characters.\n    */\n    CharCategory[CharCategory[\"Word\"] = 0] = \"Word\";\n    /**\n    Whitespace.\n    */\n    CharCategory[CharCategory[\"Space\"] = 1] = \"Space\";\n    /**\n    Anything else.\n    */\n    CharCategory[CharCategory[\"Other\"] = 2] = \"Other\";\nreturn CharCategory})(CharCategory || (CharCategory = {}));\nconst nonASCIISingleCaseWordChar = /[\\u00df\\u0587\\u0590-\\u05f4\\u0600-\\u06ff\\u3040-\\u309f\\u30a0-\\u30ff\\u3400-\\u4db5\\u4e00-\\u9fcc\\uac00-\\ud7af]/;\nlet wordChar;\ntry {\n    wordChar = /*@__PURE__*/new RegExp(\"[\\\\p{Alphabetic}\\\\p{Number}_]\", \"u\");\n}\ncatch (_) { }\nfunction hasWordChar(str) {\n    if (wordChar)\n        return wordChar.test(str);\n    for (let i = 0; i < str.length; i++) {\n        let ch = str[i];\n        if (/\\w/.test(ch) || ch > \"\\x80\" && (ch.toUpperCase() != ch.toLowerCase() || nonASCIISingleCaseWordChar.test(ch)))\n            return true;\n    }\n    return false;\n}\nfunction makeCategorizer(wordChars) {\n    return (char) => {\n        if (!/\\S/.test(char))\n            return CharCategory.Space;\n        if (hasWordChar(char))\n            return CharCategory.Word;\n        for (let i = 0; i < wordChars.length; i++)\n            if (char.indexOf(wordChars[i]) > -1)\n                return CharCategory.Word;\n        return CharCategory.Other;\n    };\n}\n\n/**\nThe editor state class is a persistent (immutable) data structure.\nTo update a state, you [create](https://codemirror.net/6/docs/ref/#state.EditorState.update) a\n[transaction](https://codemirror.net/6/docs/ref/#state.Transaction), which produces a _new_ state\ninstance, without modifying the original object.\n\nAs such, _never_ mutate properties of a state directly. That'll\njust break things.\n*/\nclass EditorState {\n    constructor(\n    /**\n    @internal\n    */\n    config, \n    /**\n    The current document.\n    */\n    doc, \n    /**\n    The current selection.\n    */\n    selection, \n    /**\n    @internal\n    */\n    values, computeSlot, tr) {\n        this.config = config;\n        this.doc = doc;\n        this.selection = selection;\n        this.values = values;\n        this.status = config.statusTemplate.slice();\n        this.computeSlot = computeSlot;\n        // Fill in the computed state immediately, so that further queries\n        // for it made during the update return this state\n        if (tr)\n            tr._state = this;\n        for (let i = 0; i < this.config.dynamicSlots.length; i++)\n            ensureAddr(this, i << 1);\n        this.computeSlot = null;\n    }\n    field(field, require = true) {\n        let addr = this.config.address[field.id];\n        if (addr == null) {\n            if (require)\n                throw new RangeError(\"Field is not present in this state\");\n            return undefined;\n        }\n        ensureAddr(this, addr);\n        return getAddr(this, addr);\n    }\n    /**\n    Create a [transaction](https://codemirror.net/6/docs/ref/#state.Transaction) that updates this\n    state. Any number of [transaction specs](https://codemirror.net/6/docs/ref/#state.TransactionSpec)\n    can be passed. Unless\n    [`sequential`](https://codemirror.net/6/docs/ref/#state.TransactionSpec.sequential) is set, the\n    [changes](https://codemirror.net/6/docs/ref/#state.TransactionSpec.changes) (if any) of each spec\n    are assumed to start in the _current_ document (not the document\n    produced by previous specs), and its\n    [selection](https://codemirror.net/6/docs/ref/#state.TransactionSpec.selection) and\n    [effects](https://codemirror.net/6/docs/ref/#state.TransactionSpec.effects) are assumed to refer\n    to the document created by its _own_ changes. The resulting\n    transaction contains the combined effect of all the different\n    specs. For [selection](https://codemirror.net/6/docs/ref/#state.TransactionSpec.selection), later\n    specs take precedence over earlier ones.\n    */\n    update(...specs) {\n        return resolveTransaction(this, specs, true);\n    }\n    /**\n    @internal\n    */\n    applyTransaction(tr) {\n        let conf = this.config, { base, compartments } = conf;\n        for (let effect of tr.effects) {\n            if (effect.is(Compartment.reconfigure)) {\n                if (conf) {\n                    compartments = new Map;\n                    conf.compartments.forEach((val, key) => compartments.set(key, val));\n                    conf = null;\n                }\n                compartments.set(effect.value.compartment, effect.value.extension);\n            }\n            else if (effect.is(StateEffect.reconfigure)) {\n                conf = null;\n                base = effect.value;\n            }\n            else if (effect.is(StateEffect.appendConfig)) {\n                conf = null;\n                base = asArray(base).concat(effect.value);\n            }\n        }\n        let startValues;\n        if (!conf) {\n            conf = Configuration.resolve(base, compartments, this);\n            let intermediateState = new EditorState(conf, this.doc, this.selection, conf.dynamicSlots.map(() => null), (state, slot) => slot.reconfigure(state, this), null);\n            startValues = intermediateState.values;\n        }\n        else {\n            startValues = tr.startState.values.slice();\n        }\n        new EditorState(conf, tr.newDoc, tr.newSelection, startValues, (state, slot) => slot.update(state, tr), tr);\n    }\n    /**\n    Create a [transaction spec](https://codemirror.net/6/docs/ref/#state.TransactionSpec) that\n    replaces every selection range with the given content.\n    */\n    replaceSelection(text) {\n        if (typeof text == \"string\")\n            text = this.toText(text);\n        return this.changeByRange(range => ({ changes: { from: range.from, to: range.to, insert: text },\n            range: EditorSelection.cursor(range.from + text.length) }));\n    }\n    /**\n    Create a set of changes and a new selection by running the given\n    function for each range in the active selection. The function\n    can return an optional set of changes (in the coordinate space\n    of the start document), plus an updated range (in the coordinate\n    space of the document produced by the call's own changes). This\n    method will merge all the changes and ranges into a single\n    changeset and selection, and return it as a [transaction\n    spec](https://codemirror.net/6/docs/ref/#state.TransactionSpec), which can be passed to\n    [`update`](https://codemirror.net/6/docs/ref/#state.EditorState.update).\n    */\n    changeByRange(f) {\n        let sel = this.selection;\n        let result1 = f(sel.ranges[0]);\n        let changes = this.changes(result1.changes), ranges = [result1.range];\n        let effects = asArray(result1.effects);\n        for (let i = 1; i < sel.ranges.length; i++) {\n            let result = f(sel.ranges[i]);\n            let newChanges = this.changes(result.changes), newMapped = newChanges.map(changes);\n            for (let j = 0; j < i; j++)\n                ranges[j] = ranges[j].map(newMapped);\n            let mapBy = changes.mapDesc(newChanges, true);\n            ranges.push(result.range.map(mapBy));\n            changes = changes.compose(newMapped);\n            effects = StateEffect.mapEffects(effects, newMapped).concat(StateEffect.mapEffects(asArray(result.effects), mapBy));\n        }\n        return {\n            changes,\n            selection: EditorSelection.create(ranges, sel.mainIndex),\n            effects\n        };\n    }\n    /**\n    Create a [change set](https://codemirror.net/6/docs/ref/#state.ChangeSet) from the given change\n    description, taking the state's document length and line\n    separator into account.\n    */\n    changes(spec = []) {\n        if (spec instanceof ChangeSet)\n            return spec;\n        return ChangeSet.of(spec, this.doc.length, this.facet(EditorState.lineSeparator));\n    }\n    /**\n    Using the state's [line\n    separator](https://codemirror.net/6/docs/ref/#state.EditorState^lineSeparator), create a\n    [`Text`](https://codemirror.net/6/docs/ref/#state.Text) instance from the given string.\n    */\n    toText(string) {\n        return Text.of(string.split(this.facet(EditorState.lineSeparator) || DefaultSplit));\n    }\n    /**\n    Return the given range of the document as a string.\n    */\n    sliceDoc(from = 0, to = this.doc.length) {\n        return this.doc.sliceString(from, to, this.lineBreak);\n    }\n    /**\n    Get the value of a state [facet](https://codemirror.net/6/docs/ref/#state.Facet).\n    */\n    facet(facet) {\n        let addr = this.config.address[facet.id];\n        if (addr == null)\n            return facet.default;\n        ensureAddr(this, addr);\n        return getAddr(this, addr);\n    }\n    /**\n    Convert this state to a JSON-serializable object. When custom\n    fields should be serialized, you can pass them in as an object\n    mapping property names (in the resulting object, which should\n    not use `doc` or `selection`) to fields.\n    */\n    toJSON(fields) {\n        let result = {\n            doc: this.sliceDoc(),\n            selection: this.selection.toJSON()\n        };\n        if (fields)\n            for (let prop in fields) {\n                let value = fields[prop];\n                if (value instanceof StateField && this.config.address[value.id] != null)\n                    result[prop] = value.spec.toJSON(this.field(fields[prop]), this);\n            }\n        return result;\n    }\n    /**\n    Deserialize a state from its JSON representation. When custom\n    fields should be deserialized, pass the same object you passed\n    to [`toJSON`](https://codemirror.net/6/docs/ref/#state.EditorState.toJSON) when serializing as\n    third argument.\n    */\n    static fromJSON(json, config = {}, fields) {\n        if (!json || typeof json.doc != \"string\")\n            throw new RangeError(\"Invalid JSON representation for EditorState\");\n        let fieldInit = [];\n        if (fields)\n            for (let prop in fields) {\n                if (Object.prototype.hasOwnProperty.call(json, prop)) {\n                    let field = fields[prop], value = json[prop];\n                    fieldInit.push(field.init(state => field.spec.fromJSON(value, state)));\n                }\n            }\n        return EditorState.create({\n            doc: json.doc,\n            selection: EditorSelection.fromJSON(json.selection),\n            extensions: config.extensions ? fieldInit.concat([config.extensions]) : fieldInit\n        });\n    }\n    /**\n    Create a new state. You'll usually only need this when\n    initializing an editor—updated states are created by applying\n    transactions.\n    */\n    static create(config = {}) {\n        let configuration = Configuration.resolve(config.extensions || [], new Map);\n        let doc = config.doc instanceof Text ? config.doc\n            : Text.of((config.doc || \"\").split(configuration.staticFacet(EditorState.lineSeparator) || DefaultSplit));\n        let selection = !config.selection ? EditorSelection.single(0)\n            : config.selection instanceof EditorSelection ? config.selection\n                : EditorSelection.single(config.selection.anchor, config.selection.head);\n        checkSelection(selection, doc.length);\n        if (!configuration.staticFacet(allowMultipleSelections))\n            selection = selection.asSingle();\n        return new EditorState(configuration, doc, selection, configuration.dynamicSlots.map(() => null), (state, slot) => slot.create(state), null);\n    }\n    /**\n    The size (in columns) of a tab in the document, determined by\n    the [`tabSize`](https://codemirror.net/6/docs/ref/#state.EditorState^tabSize) facet.\n    */\n    get tabSize() { return this.facet(EditorState.tabSize); }\n    /**\n    Get the proper [line-break](https://codemirror.net/6/docs/ref/#state.EditorState^lineSeparator)\n    string for this state.\n    */\n    get lineBreak() { return this.facet(EditorState.lineSeparator) || \"\\n\"; }\n    /**\n    Returns true when the editor is\n    [configured](https://codemirror.net/6/docs/ref/#state.EditorState^readOnly) to be read-only.\n    */\n    get readOnly() { return this.facet(readOnly); }\n    /**\n    Look up a translation for the given phrase (via the\n    [`phrases`](https://codemirror.net/6/docs/ref/#state.EditorState^phrases) facet), or return the\n    original string if no translation is found.\n    \n    If additional arguments are passed, they will be inserted in\n    place of markers like `$1` (for the first value) and `$2`, etc.\n    A single `$` is equivalent to `$1`, and `$$` will produce a\n    literal dollar sign.\n    */\n    phrase(phrase, ...insert) {\n        for (let map of this.facet(EditorState.phrases))\n            if (Object.prototype.hasOwnProperty.call(map, phrase)) {\n                phrase = map[phrase];\n                break;\n            }\n        if (insert.length)\n            phrase = phrase.replace(/\\$(\\$|\\d*)/g, (m, i) => {\n                if (i == \"$\")\n                    return \"$\";\n                let n = +(i || 1);\n                return !n || n > insert.length ? m : insert[n - 1];\n            });\n        return phrase;\n    }\n    /**\n    Find the values for a given language data field, provided by the\n    the [`languageData`](https://codemirror.net/6/docs/ref/#state.EditorState^languageData) facet.\n    \n    Examples of language data fields are...\n    \n    - [`\"commentTokens\"`](https://codemirror.net/6/docs/ref/#commands.CommentTokens) for specifying\n      comment syntax.\n    - [`\"autocomplete\"`](https://codemirror.net/6/docs/ref/#autocomplete.autocompletion^config.override)\n      for providing language-specific completion sources.\n    - [`\"wordChars\"`](https://codemirror.net/6/docs/ref/#state.EditorState.charCategorizer) for adding\n      characters that should be considered part of words in this\n      language.\n    - [`\"closeBrackets\"`](https://codemirror.net/6/docs/ref/#autocomplete.CloseBracketConfig) controls\n      bracket closing behavior.\n    */\n    languageDataAt(name, pos, side = -1) {\n        let values = [];\n        for (let provider of this.facet(languageData)) {\n            for (let result of provider(this, pos, side)) {\n                if (Object.prototype.hasOwnProperty.call(result, name))\n                    values.push(result[name]);\n            }\n        }\n        return values;\n    }\n    /**\n    Return a function that can categorize strings (expected to\n    represent a single [grapheme cluster](https://codemirror.net/6/docs/ref/#state.findClusterBreak))\n    into one of:\n    \n     - Word (contains an alphanumeric character or a character\n       explicitly listed in the local language's `\"wordChars\"`\n       language data, which should be a string)\n     - Space (contains only whitespace)\n     - Other (anything else)\n    */\n    charCategorizer(at) {\n        return makeCategorizer(this.languageDataAt(\"wordChars\", at).join(\"\"));\n    }\n    /**\n    Find the word at the given position, meaning the range\n    containing all [word](https://codemirror.net/6/docs/ref/#state.CharCategory.Word) characters\n    around it. If no word characters are adjacent to the position,\n    this returns null.\n    */\n    wordAt(pos) {\n        let { text, from, length } = this.doc.lineAt(pos);\n        let cat = this.charCategorizer(pos);\n        let start = pos - from, end = pos - from;\n        while (start > 0) {\n            let prev = findClusterBreak(text, start, false);\n            if (cat(text.slice(prev, start)) != CharCategory.Word)\n                break;\n            start = prev;\n        }\n        while (end < length) {\n            let next = findClusterBreak(text, end);\n            if (cat(text.slice(end, next)) != CharCategory.Word)\n                break;\n            end = next;\n        }\n        return start == end ? null : EditorSelection.range(start + from, end + from);\n    }\n}\n/**\nA facet that, when enabled, causes the editor to allow multiple\nranges to be selected. Be careful though, because by default the\neditor relies on the native DOM selection, which cannot handle\nmultiple selections. An extension like\n[`drawSelection`](https://codemirror.net/6/docs/ref/#view.drawSelection) can be used to make\nsecondary selections visible to the user.\n*/\nEditorState.allowMultipleSelections = allowMultipleSelections;\n/**\nConfigures the tab size to use in this state. The first\n(highest-precedence) value of the facet is used. If no value is\ngiven, this defaults to 4.\n*/\nEditorState.tabSize = /*@__PURE__*/Facet.define({\n    combine: values => values.length ? values[0] : 4\n});\n/**\nThe line separator to use. By default, any of `\"\\n\"`, `\"\\r\\n\"`\nand `\"\\r\"` is treated as a separator when splitting lines, and\nlines are joined with `\"\\n\"`.\n\nWhen you configure a value here, only that precise separator\nwill be used, allowing you to round-trip documents through the\neditor without normalizing line separators.\n*/\nEditorState.lineSeparator = lineSeparator;\n/**\nThis facet controls the value of the\n[`readOnly`](https://codemirror.net/6/docs/ref/#state.EditorState.readOnly) getter, which is\nconsulted by commands and extensions that implement editing\nfunctionality to determine whether they should apply. It\ndefaults to false, but when its highest-precedence value is\n`true`, such functionality disables itself.\n\nNot to be confused with\n[`EditorView.editable`](https://codemirror.net/6/docs/ref/#view.EditorView^editable), which\ncontrols whether the editor's DOM is set to be editable (and\nthus focusable).\n*/\nEditorState.readOnly = readOnly;\n/**\nRegisters translation phrases. The\n[`phrase`](https://codemirror.net/6/docs/ref/#state.EditorState.phrase) method will look through\nall objects registered with this facet to find translations for\nits argument.\n*/\nEditorState.phrases = /*@__PURE__*/Facet.define({\n    compare(a, b) {\n        let kA = Object.keys(a), kB = Object.keys(b);\n        return kA.length == kB.length && kA.every(k => a[k] == b[k]);\n    }\n});\n/**\nA facet used to register [language\ndata](https://codemirror.net/6/docs/ref/#state.EditorState.languageDataAt) providers.\n*/\nEditorState.languageData = languageData;\n/**\nFacet used to register change filters, which are called for each\ntransaction (unless explicitly\n[disabled](https://codemirror.net/6/docs/ref/#state.TransactionSpec.filter)), and can suppress\npart of the transaction's changes.\n\nSuch a function can return `true` to indicate that it doesn't\nwant to do anything, `false` to completely stop the changes in\nthe transaction, or a set of ranges in which changes should be\nsuppressed. Such ranges are represented as an array of numbers,\nwith each pair of two numbers indicating the start and end of a\nrange. So for example `[10, 20, 100, 110]` suppresses changes\nbetween 10 and 20, and between 100 and 110.\n*/\nEditorState.changeFilter = changeFilter;\n/**\nFacet used to register a hook that gets a chance to update or\nreplace transaction specs before they are applied. This will\nonly be applied for transactions that don't have\n[`filter`](https://codemirror.net/6/docs/ref/#state.TransactionSpec.filter) set to `false`. You\ncan either return a single transaction spec (possibly the input\ntransaction), or an array of specs (which will be combined in\nthe same way as the arguments to\n[`EditorState.update`](https://codemirror.net/6/docs/ref/#state.EditorState.update)).\n\nWhen possible, it is recommended to avoid accessing\n[`Transaction.state`](https://codemirror.net/6/docs/ref/#state.Transaction.state) in a filter,\nsince it will force creation of a state that will then be\ndiscarded again, if the transaction is actually filtered.\n\n(This functionality should be used with care. Indiscriminately\nmodifying transaction is likely to break something or degrade\nthe user experience.)\n*/\nEditorState.transactionFilter = transactionFilter;\n/**\nThis is a more limited form of\n[`transactionFilter`](https://codemirror.net/6/docs/ref/#state.EditorState^transactionFilter),\nwhich can only add\n[annotations](https://codemirror.net/6/docs/ref/#state.TransactionSpec.annotations) and\n[effects](https://codemirror.net/6/docs/ref/#state.TransactionSpec.effects). _But_, this type\nof filter runs even if the transaction has disabled regular\n[filtering](https://codemirror.net/6/docs/ref/#state.TransactionSpec.filter), making it suitable\nfor effects that don't need to touch the changes or selection,\nbut do want to process every transaction.\n\nExtenders run _after_ filters, when both are present.\n*/\nEditorState.transactionExtender = transactionExtender;\nCompartment.reconfigure = /*@__PURE__*/StateEffect.define();\n\n/**\nUtility function for combining behaviors to fill in a config\nobject from an array of provided configs. `defaults` should hold\ndefault values for all optional fields in `Config`.\n\nThe function will, by default, error\nwhen a field gets two values that aren't `===`-equal, but you can\nprovide combine functions per field to do something else.\n*/\nfunction combineConfig(configs, defaults, // Should hold only the optional properties of Config, but I haven't managed to express that\ncombine = {}) {\n    let result = {};\n    for (let config of configs)\n        for (let key of Object.keys(config)) {\n            let value = config[key], current = result[key];\n            if (current === undefined)\n                result[key] = value;\n            else if (current === value || value === undefined) ; // No conflict\n            else if (Object.hasOwnProperty.call(combine, key))\n                result[key] = combine[key](current, value);\n            else\n                throw new Error(\"Config merge conflict for field \" + key);\n        }\n    for (let key in defaults)\n        if (result[key] === undefined)\n            result[key] = defaults[key];\n    return result;\n}\n\n/**\nEach range is associated with a value, which must inherit from\nthis class.\n*/\nclass RangeValue {\n    /**\n    Compare this value with another value. Used when comparing\n    rangesets. The default implementation compares by identity.\n    Unless you are only creating a fixed number of unique instances\n    of your value type, it is a good idea to implement this\n    properly.\n    */\n    eq(other) { return this == other; }\n    /**\n    Create a [range](https://codemirror.net/6/docs/ref/#state.Range) with this value.\n    */\n    range(from, to = from) { return Range.create(from, to, this); }\n}\nRangeValue.prototype.startSide = RangeValue.prototype.endSide = 0;\nRangeValue.prototype.point = false;\nRangeValue.prototype.mapMode = MapMode.TrackDel;\n/**\nA range associates a value with a range of positions.\n*/\nclass Range {\n    constructor(\n    /**\n    The range's start position.\n    */\n    from, \n    /**\n    Its end position.\n    */\n    to, \n    /**\n    The value associated with this range.\n    */\n    value) {\n        this.from = from;\n        this.to = to;\n        this.value = value;\n    }\n    /**\n    @internal\n    */\n    static create(from, to, value) {\n        return new Range(from, to, value);\n    }\n}\nfunction cmpRange(a, b) {\n    return a.from - b.from || a.value.startSide - b.value.startSide;\n}\nclass Chunk {\n    constructor(from, to, value, \n    // Chunks are marked with the largest point that occurs\n    // in them (or -1 for no points), so that scans that are\n    // only interested in points (such as the\n    // heightmap-related logic) can skip range-only chunks.\n    maxPoint) {\n        this.from = from;\n        this.to = to;\n        this.value = value;\n        this.maxPoint = maxPoint;\n    }\n    get length() { return this.to[this.to.length - 1]; }\n    // Find the index of the given position and side. Use the ranges'\n    // `from` pos when `end == false`, `to` when `end == true`.\n    findIndex(pos, side, end, startAt = 0) {\n        let arr = end ? this.to : this.from;\n        for (let lo = startAt, hi = arr.length;;) {\n            if (lo == hi)\n                return lo;\n            let mid = (lo + hi) >> 1;\n            let diff = arr[mid] - pos || (end ? this.value[mid].endSide : this.value[mid].startSide) - side;\n            if (mid == lo)\n                return diff >= 0 ? lo : hi;\n            if (diff >= 0)\n                hi = mid;\n            else\n                lo = mid + 1;\n        }\n    }\n    between(offset, from, to, f) {\n        for (let i = this.findIndex(from, -1000000000 /* C.Far */, true), e = this.findIndex(to, 1000000000 /* C.Far */, false, i); i < e; i++)\n            if (f(this.from[i] + offset, this.to[i] + offset, this.value[i]) === false)\n                return false;\n    }\n    map(offset, changes) {\n        let value = [], from = [], to = [], newPos = -1, maxPoint = -1;\n        for (let i = 0; i < this.value.length; i++) {\n            let val = this.value[i], curFrom = this.from[i] + offset, curTo = this.to[i] + offset, newFrom, newTo;\n            if (curFrom == curTo) {\n                let mapped = changes.mapPos(curFrom, val.startSide, val.mapMode);\n                if (mapped == null)\n                    continue;\n                newFrom = newTo = mapped;\n                if (val.startSide != val.endSide) {\n                    newTo = changes.mapPos(curFrom, val.endSide);\n                    if (newTo < newFrom)\n                        continue;\n                }\n            }\n            else {\n                newFrom = changes.mapPos(curFrom, val.startSide);\n                newTo = changes.mapPos(curTo, val.endSide);\n                if (newFrom > newTo || newFrom == newTo && val.startSide > 0 && val.endSide <= 0)\n                    continue;\n            }\n            if ((newTo - newFrom || val.endSide - val.startSide) < 0)\n                continue;\n            if (newPos < 0)\n                newPos = newFrom;\n            if (val.point)\n                maxPoint = Math.max(maxPoint, newTo - newFrom);\n            value.push(val);\n            from.push(newFrom - newPos);\n            to.push(newTo - newPos);\n        }\n        return { mapped: value.length ? new Chunk(from, to, value, maxPoint) : null, pos: newPos };\n    }\n}\n/**\nA range set stores a collection of [ranges](https://codemirror.net/6/docs/ref/#state.Range) in a\nway that makes them efficient to [map](https://codemirror.net/6/docs/ref/#state.RangeSet.map) and\n[update](https://codemirror.net/6/docs/ref/#state.RangeSet.update). This is an immutable data\nstructure.\n*/\nclass RangeSet {\n    constructor(\n    /**\n    @internal\n    */\n    chunkPos, \n    /**\n    @internal\n    */\n    chunk, \n    /**\n    @internal\n    */\n    nextLayer, \n    /**\n    @internal\n    */\n    maxPoint) {\n        this.chunkPos = chunkPos;\n        this.chunk = chunk;\n        this.nextLayer = nextLayer;\n        this.maxPoint = maxPoint;\n    }\n    /**\n    @internal\n    */\n    static create(chunkPos, chunk, nextLayer, maxPoint) {\n        return new RangeSet(chunkPos, chunk, nextLayer, maxPoint);\n    }\n    /**\n    @internal\n    */\n    get length() {\n        let last = this.chunk.length - 1;\n        return last < 0 ? 0 : Math.max(this.chunkEnd(last), this.nextLayer.length);\n    }\n    /**\n    The number of ranges in the set.\n    */\n    get size() {\n        if (this.isEmpty)\n            return 0;\n        let size = this.nextLayer.size;\n        for (let chunk of this.chunk)\n            size += chunk.value.length;\n        return size;\n    }\n    /**\n    @internal\n    */\n    chunkEnd(index) {\n        return this.chunkPos[index] + this.chunk[index].length;\n    }\n    /**\n    Update the range set, optionally adding new ranges or filtering\n    out existing ones.\n    \n    (Note: The type parameter is just there as a kludge to work\n    around TypeScript variance issues that prevented `RangeSet<X>`\n    from being a subtype of `RangeSet<Y>` when `X` is a subtype of\n    `Y`.)\n    */\n    update(updateSpec) {\n        let { add = [], sort = false, filterFrom = 0, filterTo = this.length } = updateSpec;\n        let filter = updateSpec.filter;\n        if (add.length == 0 && !filter)\n            return this;\n        if (sort)\n            add = add.slice().sort(cmpRange);\n        if (this.isEmpty)\n            return add.length ? RangeSet.of(add) : this;\n        let cur = new LayerCursor(this, null, -1).goto(0), i = 0, spill = [];\n        let builder = new RangeSetBuilder();\n        while (cur.value || i < add.length) {\n            if (i < add.length && (cur.from - add[i].from || cur.startSide - add[i].value.startSide) >= 0) {\n                let range = add[i++];\n                if (!builder.addInner(range.from, range.to, range.value))\n                    spill.push(range);\n            }\n            else if (cur.rangeIndex == 1 && cur.chunkIndex < this.chunk.length &&\n                (i == add.length || this.chunkEnd(cur.chunkIndex) < add[i].from) &&\n                (!filter || filterFrom > this.chunkEnd(cur.chunkIndex) || filterTo < this.chunkPos[cur.chunkIndex]) &&\n                builder.addChunk(this.chunkPos[cur.chunkIndex], this.chunk[cur.chunkIndex])) {\n                cur.nextChunk();\n            }\n            else {\n                if (!filter || filterFrom > cur.to || filterTo < cur.from || filter(cur.from, cur.to, cur.value)) {\n                    if (!builder.addInner(cur.from, cur.to, cur.value))\n                        spill.push(Range.create(cur.from, cur.to, cur.value));\n                }\n                cur.next();\n            }\n        }\n        return builder.finishInner(this.nextLayer.isEmpty && !spill.length ? RangeSet.empty\n            : this.nextLayer.update({ add: spill, filter, filterFrom, filterTo }));\n    }\n    /**\n    Map this range set through a set of changes, return the new set.\n    */\n    map(changes) {\n        if (changes.empty || this.isEmpty)\n            return this;\n        let chunks = [], chunkPos = [], maxPoint = -1;\n        for (let i = 0; i < this.chunk.length; i++) {\n            let start = this.chunkPos[i], chunk = this.chunk[i];\n            let touch = changes.touchesRange(start, start + chunk.length);\n            if (touch === false) {\n                maxPoint = Math.max(maxPoint, chunk.maxPoint);\n                chunks.push(chunk);\n                chunkPos.push(changes.mapPos(start));\n            }\n            else if (touch === true) {\n                let { mapped, pos } = chunk.map(start, changes);\n                if (mapped) {\n                    maxPoint = Math.max(maxPoint, mapped.maxPoint);\n                    chunks.push(mapped);\n                    chunkPos.push(pos);\n                }\n            }\n        }\n        let next = this.nextLayer.map(changes);\n        return chunks.length == 0 ? next : new RangeSet(chunkPos, chunks, next || RangeSet.empty, maxPoint);\n    }\n    /**\n    Iterate over the ranges that touch the region `from` to `to`,\n    calling `f` for each. There is no guarantee that the ranges will\n    be reported in any specific order. When the callback returns\n    `false`, iteration stops.\n    */\n    between(from, to, f) {\n        if (this.isEmpty)\n            return;\n        for (let i = 0; i < this.chunk.length; i++) {\n            let start = this.chunkPos[i], chunk = this.chunk[i];\n            if (to >= start && from <= start + chunk.length &&\n                chunk.between(start, from - start, to - start, f) === false)\n                return;\n        }\n        this.nextLayer.between(from, to, f);\n    }\n    /**\n    Iterate over the ranges in this set, in order, including all\n    ranges that end at or after `from`.\n    */\n    iter(from = 0) {\n        return HeapCursor.from([this]).goto(from);\n    }\n    /**\n    @internal\n    */\n    get isEmpty() { return this.nextLayer == this; }\n    /**\n    Iterate over the ranges in a collection of sets, in order,\n    starting from `from`.\n    */\n    static iter(sets, from = 0) {\n        return HeapCursor.from(sets).goto(from);\n    }\n    /**\n    Iterate over two groups of sets, calling methods on `comparator`\n    to notify it of possible differences.\n    */\n    static compare(oldSets, newSets, \n    /**\n    This indicates how the underlying data changed between these\n    ranges, and is needed to synchronize the iteration.\n    */\n    textDiff, comparator, \n    /**\n    Can be used to ignore all non-point ranges, and points below\n    the given size. When -1, all ranges are compared.\n    */\n    minPointSize = -1) {\n        let a = oldSets.filter(set => set.maxPoint > 0 || !set.isEmpty && set.maxPoint >= minPointSize);\n        let b = newSets.filter(set => set.maxPoint > 0 || !set.isEmpty && set.maxPoint >= minPointSize);\n        let sharedChunks = findSharedChunks(a, b, textDiff);\n        let sideA = new SpanCursor(a, sharedChunks, minPointSize);\n        let sideB = new SpanCursor(b, sharedChunks, minPointSize);\n        textDiff.iterGaps((fromA, fromB, length) => compare(sideA, fromA, sideB, fromB, length, comparator));\n        if (textDiff.empty && textDiff.length == 0)\n            compare(sideA, 0, sideB, 0, 0, comparator);\n    }\n    /**\n    Compare the contents of two groups of range sets, returning true\n    if they are equivalent in the given range.\n    */\n    static eq(oldSets, newSets, from = 0, to) {\n        if (to == null)\n            to = 1000000000 /* C.Far */ - 1;\n        let a = oldSets.filter(set => !set.isEmpty && newSets.indexOf(set) < 0);\n        let b = newSets.filter(set => !set.isEmpty && oldSets.indexOf(set) < 0);\n        if (a.length != b.length)\n            return false;\n        if (!a.length)\n            return true;\n        let sharedChunks = findSharedChunks(a, b);\n        let sideA = new SpanCursor(a, sharedChunks, 0).goto(from), sideB = new SpanCursor(b, sharedChunks, 0).goto(from);\n        for (;;) {\n            if (sideA.to != sideB.to ||\n                !sameValues(sideA.active, sideB.active) ||\n                sideA.point && (!sideB.point || !sideA.point.eq(sideB.point)))\n                return false;\n            if (sideA.to > to)\n                return true;\n            sideA.next();\n            sideB.next();\n        }\n    }\n    /**\n    Iterate over a group of range sets at the same time, notifying\n    the iterator about the ranges covering every given piece of\n    content. Returns the open count (see\n    [`SpanIterator.span`](https://codemirror.net/6/docs/ref/#state.SpanIterator.span)) at the end\n    of the iteration.\n    */\n    static spans(sets, from, to, iterator, \n    /**\n    When given and greater than -1, only points of at least this\n    size are taken into account.\n    */\n    minPointSize = -1) {\n        let cursor = new SpanCursor(sets, null, minPointSize).goto(from), pos = from;\n        let openRanges = cursor.openStart;\n        for (;;) {\n            let curTo = Math.min(cursor.to, to);\n            if (cursor.point) {\n                let active = cursor.activeForPoint(cursor.to);\n                let openCount = cursor.pointFrom < from ? active.length + 1 : Math.min(active.length, openRanges);\n                iterator.point(pos, curTo, cursor.point, active, openCount, cursor.pointRank);\n                openRanges = Math.min(cursor.openEnd(curTo), active.length);\n            }\n            else if (curTo > pos) {\n                iterator.span(pos, curTo, cursor.active, openRanges);\n                openRanges = cursor.openEnd(curTo);\n            }\n            if (cursor.to > to)\n                return openRanges + (cursor.point && cursor.to > to ? 1 : 0);\n            pos = cursor.to;\n            cursor.next();\n        }\n    }\n    /**\n    Create a range set for the given range or array of ranges. By\n    default, this expects the ranges to be _sorted_ (by start\n    position and, if two start at the same position,\n    `value.startSide`). You can pass `true` as second argument to\n    cause the method to sort them.\n    */\n    static of(ranges, sort = false) {\n        let build = new RangeSetBuilder();\n        for (let range of ranges instanceof Range ? [ranges] : sort ? lazySort(ranges) : ranges)\n            build.add(range.from, range.to, range.value);\n        return build.finish();\n    }\n}\n/**\nThe empty set of ranges.\n*/\nRangeSet.empty = /*@__PURE__*/new RangeSet([], [], null, -1);\nfunction lazySort(ranges) {\n    if (ranges.length > 1)\n        for (let prev = ranges[0], i = 1; i < ranges.length; i++) {\n            let cur = ranges[i];\n            if (cmpRange(prev, cur) > 0)\n                return ranges.slice().sort(cmpRange);\n            prev = cur;\n        }\n    return ranges;\n}\nRangeSet.empty.nextLayer = RangeSet.empty;\n/**\nA range set builder is a data structure that helps build up a\n[range set](https://codemirror.net/6/docs/ref/#state.RangeSet) directly, without first allocating\nan array of [`Range`](https://codemirror.net/6/docs/ref/#state.Range) objects.\n*/\nclass RangeSetBuilder {\n    finishChunk(newArrays) {\n        this.chunks.push(new Chunk(this.from, this.to, this.value, this.maxPoint));\n        this.chunkPos.push(this.chunkStart);\n        this.chunkStart = -1;\n        this.setMaxPoint = Math.max(this.setMaxPoint, this.maxPoint);\n        this.maxPoint = -1;\n        if (newArrays) {\n            this.from = [];\n            this.to = [];\n            this.value = [];\n        }\n    }\n    /**\n    Create an empty builder.\n    */\n    constructor() {\n        this.chunks = [];\n        this.chunkPos = [];\n        this.chunkStart = -1;\n        this.last = null;\n        this.lastFrom = -1000000000 /* C.Far */;\n        this.lastTo = -1000000000 /* C.Far */;\n        this.from = [];\n        this.to = [];\n        this.value = [];\n        this.maxPoint = -1;\n        this.setMaxPoint = -1;\n        this.nextLayer = null;\n    }\n    /**\n    Add a range. Ranges should be added in sorted (by `from` and\n    `value.startSide`) order.\n    */\n    add(from, to, value) {\n        if (!this.addInner(from, to, value))\n            (this.nextLayer || (this.nextLayer = new RangeSetBuilder)).add(from, to, value);\n    }\n    /**\n    @internal\n    */\n    addInner(from, to, value) {\n        let diff = from - this.lastTo || value.startSide - this.last.endSide;\n        if (diff <= 0 && (from - this.lastFrom || value.startSide - this.last.startSide) < 0)\n            throw new Error(\"Ranges must be added sorted by `from` position and `startSide`\");\n        if (diff < 0)\n            return false;\n        if (this.from.length == 250 /* C.ChunkSize */)\n            this.finishChunk(true);\n        if (this.chunkStart < 0)\n            this.chunkStart = from;\n        this.from.push(from - this.chunkStart);\n        this.to.push(to - this.chunkStart);\n        this.last = value;\n        this.lastFrom = from;\n        this.lastTo = to;\n        this.value.push(value);\n        if (value.point)\n            this.maxPoint = Math.max(this.maxPoint, to - from);\n        return true;\n    }\n    /**\n    @internal\n    */\n    addChunk(from, chunk) {\n        if ((from - this.lastTo || chunk.value[0].startSide - this.last.endSide) < 0)\n            return false;\n        if (this.from.length)\n            this.finishChunk(true);\n        this.setMaxPoint = Math.max(this.setMaxPoint, chunk.maxPoint);\n        this.chunks.push(chunk);\n        this.chunkPos.push(from);\n        let last = chunk.value.length - 1;\n        this.last = chunk.value[last];\n        this.lastFrom = chunk.from[last] + from;\n        this.lastTo = chunk.to[last] + from;\n        return true;\n    }\n    /**\n    Finish the range set. Returns the new set. The builder can't be\n    used anymore after this has been called.\n    */\n    finish() { return this.finishInner(RangeSet.empty); }\n    /**\n    @internal\n    */\n    finishInner(next) {\n        if (this.from.length)\n            this.finishChunk(false);\n        if (this.chunks.length == 0)\n            return next;\n        let result = RangeSet.create(this.chunkPos, this.chunks, this.nextLayer ? this.nextLayer.finishInner(next) : next, this.setMaxPoint);\n        this.from = null; // Make sure further `add` calls produce errors\n        return result;\n    }\n}\nfunction findSharedChunks(a, b, textDiff) {\n    let inA = new Map();\n    for (let set of a)\n        for (let i = 0; i < set.chunk.length; i++)\n            if (set.chunk[i].maxPoint <= 0)\n                inA.set(set.chunk[i], set.chunkPos[i]);\n    let shared = new Set();\n    for (let set of b)\n        for (let i = 0; i < set.chunk.length; i++) {\n            let known = inA.get(set.chunk[i]);\n            if (known != null && (textDiff ? textDiff.mapPos(known) : known) == set.chunkPos[i] &&\n                !(textDiff === null || textDiff === void 0 ? void 0 : textDiff.touchesRange(known, known + set.chunk[i].length)))\n                shared.add(set.chunk[i]);\n        }\n    return shared;\n}\nclass LayerCursor {\n    constructor(layer, skip, minPoint, rank = 0) {\n        this.layer = layer;\n        this.skip = skip;\n        this.minPoint = minPoint;\n        this.rank = rank;\n    }\n    get startSide() { return this.value ? this.value.startSide : 0; }\n    get endSide() { return this.value ? this.value.endSide : 0; }\n    goto(pos, side = -1000000000 /* C.Far */) {\n        this.chunkIndex = this.rangeIndex = 0;\n        this.gotoInner(pos, side, false);\n        return this;\n    }\n    gotoInner(pos, side, forward) {\n        while (this.chunkIndex < this.layer.chunk.length) {\n            let next = this.layer.chunk[this.chunkIndex];\n            if (!(this.skip && this.skip.has(next) ||\n                this.layer.chunkEnd(this.chunkIndex) < pos ||\n                next.maxPoint < this.minPoint))\n                break;\n            this.chunkIndex++;\n            forward = false;\n        }\n        if (this.chunkIndex < this.layer.chunk.length) {\n            let rangeIndex = this.layer.chunk[this.chunkIndex].findIndex(pos - this.layer.chunkPos[this.chunkIndex], side, true);\n            if (!forward || this.rangeIndex < rangeIndex)\n                this.setRangeIndex(rangeIndex);\n        }\n        this.next();\n    }\n    forward(pos, side) {\n        if ((this.to - pos || this.endSide - side) < 0)\n            this.gotoInner(pos, side, true);\n    }\n    next() {\n        for (;;) {\n            if (this.chunkIndex == this.layer.chunk.length) {\n                this.from = this.to = 1000000000 /* C.Far */;\n                this.value = null;\n                break;\n            }\n            else {\n                let chunkPos = this.layer.chunkPos[this.chunkIndex], chunk = this.layer.chunk[this.chunkIndex];\n                let from = chunkPos + chunk.from[this.rangeIndex];\n                this.from = from;\n                this.to = chunkPos + chunk.to[this.rangeIndex];\n                this.value = chunk.value[this.rangeIndex];\n                this.setRangeIndex(this.rangeIndex + 1);\n                if (this.minPoint < 0 || this.value.point && this.to - this.from >= this.minPoint)\n                    break;\n            }\n        }\n    }\n    setRangeIndex(index) {\n        if (index == this.layer.chunk[this.chunkIndex].value.length) {\n            this.chunkIndex++;\n            if (this.skip) {\n                while (this.chunkIndex < this.layer.chunk.length && this.skip.has(this.layer.chunk[this.chunkIndex]))\n                    this.chunkIndex++;\n            }\n            this.rangeIndex = 0;\n        }\n        else {\n            this.rangeIndex = index;\n        }\n    }\n    nextChunk() {\n        this.chunkIndex++;\n        this.rangeIndex = 0;\n        this.next();\n    }\n    compare(other) {\n        return this.from - other.from || this.startSide - other.startSide || this.rank - other.rank ||\n            this.to - other.to || this.endSide - other.endSide;\n    }\n}\nclass HeapCursor {\n    constructor(heap) {\n        this.heap = heap;\n    }\n    static from(sets, skip = null, minPoint = -1) {\n        let heap = [];\n        for (let i = 0; i < sets.length; i++) {\n            for (let cur = sets[i]; !cur.isEmpty; cur = cur.nextLayer) {\n                if (cur.maxPoint >= minPoint)\n                    heap.push(new LayerCursor(cur, skip, minPoint, i));\n            }\n        }\n        return heap.length == 1 ? heap[0] : new HeapCursor(heap);\n    }\n    get startSide() { return this.value ? this.value.startSide : 0; }\n    goto(pos, side = -1000000000 /* C.Far */) {\n        for (let cur of this.heap)\n            cur.goto(pos, side);\n        for (let i = this.heap.length >> 1; i >= 0; i--)\n            heapBubble(this.heap, i);\n        this.next();\n        return this;\n    }\n    forward(pos, side) {\n        for (let cur of this.heap)\n            cur.forward(pos, side);\n        for (let i = this.heap.length >> 1; i >= 0; i--)\n            heapBubble(this.heap, i);\n        if ((this.to - pos || this.value.endSide - side) < 0)\n            this.next();\n    }\n    next() {\n        if (this.heap.length == 0) {\n            this.from = this.to = 1000000000 /* C.Far */;\n            this.value = null;\n            this.rank = -1;\n        }\n        else {\n            let top = this.heap[0];\n            this.from = top.from;\n            this.to = top.to;\n            this.value = top.value;\n            this.rank = top.rank;\n            if (top.value)\n                top.next();\n            heapBubble(this.heap, 0);\n        }\n    }\n}\nfunction heapBubble(heap, index) {\n    for (let cur = heap[index];;) {\n        let childIndex = (index << 1) + 1;\n        if (childIndex >= heap.length)\n            break;\n        let child = heap[childIndex];\n        if (childIndex + 1 < heap.length && child.compare(heap[childIndex + 1]) >= 0) {\n            child = heap[childIndex + 1];\n            childIndex++;\n        }\n        if (cur.compare(child) < 0)\n            break;\n        heap[childIndex] = cur;\n        heap[index] = child;\n        index = childIndex;\n    }\n}\nclass SpanCursor {\n    constructor(sets, skip, minPoint) {\n        this.minPoint = minPoint;\n        this.active = [];\n        this.activeTo = [];\n        this.activeRank = [];\n        this.minActive = -1;\n        // A currently active point range, if any\n        this.point = null;\n        this.pointFrom = 0;\n        this.pointRank = 0;\n        this.to = -1000000000 /* C.Far */;\n        this.endSide = 0;\n        // The amount of open active ranges at the start of the iterator.\n        // Not including points.\n        this.openStart = -1;\n        this.cursor = HeapCursor.from(sets, skip, minPoint);\n    }\n    goto(pos, side = -1000000000 /* C.Far */) {\n        this.cursor.goto(pos, side);\n        this.active.length = this.activeTo.length = this.activeRank.length = 0;\n        this.minActive = -1;\n        this.to = pos;\n        this.endSide = side;\n        this.openStart = -1;\n        this.next();\n        return this;\n    }\n    forward(pos, side) {\n        while (this.minActive > -1 && (this.activeTo[this.minActive] - pos || this.active[this.minActive].endSide - side) < 0)\n            this.removeActive(this.minActive);\n        this.cursor.forward(pos, side);\n    }\n    removeActive(index) {\n        remove(this.active, index);\n        remove(this.activeTo, index);\n        remove(this.activeRank, index);\n        this.minActive = findMinIndex(this.active, this.activeTo);\n    }\n    addActive(trackOpen) {\n        let i = 0, { value, to, rank } = this.cursor;\n        while (i < this.activeRank.length && this.activeRank[i] <= rank)\n            i++;\n        insert(this.active, i, value);\n        insert(this.activeTo, i, to);\n        insert(this.activeRank, i, rank);\n        if (trackOpen)\n            insert(trackOpen, i, this.cursor.from);\n        this.minActive = findMinIndex(this.active, this.activeTo);\n    }\n    // After calling this, if `this.point` != null, the next range is a\n    // point. Otherwise, it's a regular range, covered by `this.active`.\n    next() {\n        let from = this.to, wasPoint = this.point;\n        this.point = null;\n        let trackOpen = this.openStart < 0 ? [] : null;\n        for (;;) {\n            let a = this.minActive;\n            if (a > -1 && (this.activeTo[a] - this.cursor.from || this.active[a].endSide - this.cursor.startSide) < 0) {\n                if (this.activeTo[a] > from) {\n                    this.to = this.activeTo[a];\n                    this.endSide = this.active[a].endSide;\n                    break;\n                }\n                this.removeActive(a);\n                if (trackOpen)\n                    remove(trackOpen, a);\n            }\n            else if (!this.cursor.value) {\n                this.to = this.endSide = 1000000000 /* C.Far */;\n                break;\n            }\n            else if (this.cursor.from > from) {\n                this.to = this.cursor.from;\n                this.endSide = this.cursor.startSide;\n                break;\n            }\n            else {\n                let nextVal = this.cursor.value;\n                if (!nextVal.point) { // Opening a range\n                    this.addActive(trackOpen);\n                    this.cursor.next();\n                }\n                else if (wasPoint && this.cursor.to == this.to && this.cursor.from < this.cursor.to) {\n                    // Ignore any non-empty points that end precisely at the end of the prev point\n                    this.cursor.next();\n                }\n                else { // New point\n                    this.point = nextVal;\n                    this.pointFrom = this.cursor.from;\n                    this.pointRank = this.cursor.rank;\n                    this.to = this.cursor.to;\n                    this.endSide = nextVal.endSide;\n                    this.cursor.next();\n                    this.forward(this.to, this.endSide);\n                    break;\n                }\n            }\n        }\n        if (trackOpen) {\n            this.openStart = 0;\n            for (let i = trackOpen.length - 1; i >= 0 && trackOpen[i] < from; i--)\n                this.openStart++;\n        }\n    }\n    activeForPoint(to) {\n        if (!this.active.length)\n            return this.active;\n        let active = [];\n        for (let i = this.active.length - 1; i >= 0; i--) {\n            if (this.activeRank[i] < this.pointRank)\n                break;\n            if (this.activeTo[i] > to || this.activeTo[i] == to && this.active[i].endSide >= this.point.endSide)\n                active.push(this.active[i]);\n        }\n        return active.reverse();\n    }\n    openEnd(to) {\n        let open = 0;\n        for (let i = this.activeTo.length - 1; i >= 0 && this.activeTo[i] > to; i--)\n            open++;\n        return open;\n    }\n}\nfunction compare(a, startA, b, startB, length, comparator) {\n    a.goto(startA);\n    b.goto(startB);\n    let endB = startB + length;\n    let pos = startB, dPos = startB - startA;\n    for (;;) {\n        let diff = (a.to + dPos) - b.to || a.endSide - b.endSide;\n        let end = diff < 0 ? a.to + dPos : b.to, clipEnd = Math.min(end, endB);\n        if (a.point || b.point) {\n            if (!(a.point && b.point && (a.point == b.point || a.point.eq(b.point)) &&\n                sameValues(a.activeForPoint(a.to), b.activeForPoint(b.to))))\n                comparator.comparePoint(pos, clipEnd, a.point, b.point);\n        }\n        else {\n            if (clipEnd > pos && !sameValues(a.active, b.active))\n                comparator.compareRange(pos, clipEnd, a.active, b.active);\n        }\n        if (end > endB)\n            break;\n        pos = end;\n        if (diff <= 0)\n            a.next();\n        if (diff >= 0)\n            b.next();\n    }\n}\nfunction sameValues(a, b) {\n    if (a.length != b.length)\n        return false;\n    for (let i = 0; i < a.length; i++)\n        if (a[i] != b[i] && !a[i].eq(b[i]))\n            return false;\n    return true;\n}\nfunction remove(array, index) {\n    for (let i = index, e = array.length - 1; i < e; i++)\n        array[i] = array[i + 1];\n    array.pop();\n}\nfunction insert(array, index, value) {\n    for (let i = array.length - 1; i >= index; i--)\n        array[i + 1] = array[i];\n    array[index] = value;\n}\nfunction findMinIndex(value, array) {\n    let found = -1, foundPos = 1000000000 /* C.Far */;\n    for (let i = 0; i < array.length; i++)\n        if ((array[i] - foundPos || value[i].endSide - value[found].endSide) < 0) {\n            found = i;\n            foundPos = array[i];\n        }\n    return found;\n}\n\n/**\nCount the column position at the given offset into the string,\ntaking extending characters and tab size into account.\n*/\nfunction countColumn(string, tabSize, to = string.length) {\n    let n = 0;\n    for (let i = 0; i < to;) {\n        if (string.charCodeAt(i) == 9) {\n            n += tabSize - (n % tabSize);\n            i++;\n        }\n        else {\n            n++;\n            i = findClusterBreak(string, i);\n        }\n    }\n    return n;\n}\n/**\nFind the offset that corresponds to the given column position in a\nstring, taking extending characters and tab size into account. By\ndefault, the string length is returned when it is too short to\nreach the column. Pass `strict` true to make it return -1 in that\nsituation.\n*/\nfunction findColumn(string, col, tabSize, strict) {\n    for (let i = 0, n = 0;;) {\n        if (n >= col)\n            return i;\n        if (i == string.length)\n            break;\n        n += string.charCodeAt(i) == 9 ? tabSize - (n % tabSize) : 1;\n        i = findClusterBreak(string, i);\n    }\n    return strict === true ? -1 : string.length;\n}\n\nexport { Annotation, AnnotationType, ChangeDesc, ChangeSet, CharCategory, Compartment, EditorSelection, EditorState, Facet, Line, MapMode, Prec, Range, RangeSet, RangeSetBuilder, RangeValue, SelectionRange, StateEffect, StateEffectType, StateField, Text, Transaction, codePointAt, codePointSize, combineConfig, countColumn, findClusterBreak, findColumn, fromCodePoint };\n","const C = \"\\u037c\"\nconst COUNT = typeof Symbol == \"undefined\" ? \"__\" + C : Symbol.for(C)\nconst SET = typeof Symbol == \"undefined\" ? \"__styleSet\" + Math.floor(Math.random() * 1e8) : Symbol(\"styleSet\")\nconst top = typeof globalThis != \"undefined\" ? globalThis : typeof window != \"undefined\" ? window : {}\n\n// :: - Style modules encapsulate a set of CSS rules defined from\n// JavaScript. Their definitions are only available in a given DOM\n// root after it has been _mounted_ there with `StyleModule.mount`.\n//\n// Style modules should be created once and stored somewhere, as\n// opposed to re-creating them every time you need them. The amount of\n// CSS rules generated for a given DOM root is bounded by the amount\n// of style modules that were used. So to avoid leaking rules, don't\n// create these dynamically, but treat them as one-time allocations.\nexport class StyleModule {\n  // :: (Object<Style>, ?{finish: ?(string) → string})\n  // Create a style module from the given spec.\n  //\n  // When `finish` is given, it is called on regular (non-`@`)\n  // selectors (after `&` expansion) to compute the final selector.\n  constructor(spec, options) {\n    this.rules = []\n    let {finish} = options || {}\n\n    function splitSelector(selector) {\n      return /^@/.test(selector) ? [selector] : selector.split(/,\\s*/)\n    }\n\n    function render(selectors, spec, target, isKeyframes) {\n      let local = [], isAt = /^@(\\w+)\\b/.exec(selectors[0]), keyframes = isAt && isAt[1] == \"keyframes\"\n      if (isAt && spec == null) return target.push(selectors[0] + \";\")\n      for (let prop in spec) {\n        let value = spec[prop]\n        if (/&/.test(prop)) {\n          render(prop.split(/,\\s*/).map(part => selectors.map(sel => part.replace(/&/, sel))).reduce((a, b) => a.concat(b)),\n                 value, target)\n        } else if (value && typeof value == \"object\") {\n          if (!isAt) throw new RangeError(\"The value of a property (\" + prop + \") should be a primitive value.\")\n          render(splitSelector(prop), value, local, keyframes)\n        } else if (value != null) {\n          local.push(prop.replace(/_.*/, \"\").replace(/[A-Z]/g, l => \"-\" + l.toLowerCase()) + \": \" + value + \";\")\n        }\n      }\n      if (local.length || keyframes) {\n        target.push((finish && !isAt && !isKeyframes ? selectors.map(finish) : selectors).join(\", \") +\n                    \" {\" + local.join(\" \") + \"}\")\n      }\n    }\n\n    for (let prop in spec) render(splitSelector(prop), spec[prop], this.rules)\n  }\n\n  // :: () → string\n  // Returns a string containing the module's CSS rules.\n  getRules() { return this.rules.join(\"\\n\") }\n\n  // :: () → string\n  // Generate a new unique CSS class name.\n  static newName() {\n    let id = top[COUNT] || 1\n    top[COUNT] = id + 1\n    return C + id.toString(36)\n  }\n\n  // :: (union<Document, ShadowRoot>, union<[StyleModule], StyleModule>)\n  //\n  // Mount the given set of modules in the given DOM root, which ensures\n  // that the CSS rules defined by the module are available in that\n  // context.\n  //\n  // Rules are only added to the document once per root.\n  //\n  // Rule order will follow the order of the modules, so that rules from\n  // modules later in the array take precedence of those from earlier\n  // modules. If you call this function multiple times for the same root\n  // in a way that changes the order of already mounted modules, the old\n  // order will be changed.\n  static mount(root, modules) {\n    (root[SET] || new StyleSet(root)).mount(Array.isArray(modules) ? modules : [modules])\n  }\n}\n\nlet adoptedSet = new Map //<Document, StyleSet>\n\nclass StyleSet {\n  constructor(root) {\n    let doc = root.ownerDocument || root, win = doc.defaultView\n    if (!root.head && root.adoptedStyleSheets && win.CSSStyleSheet) {\n      let adopted = adoptedSet.get(doc)\n      if (adopted) {\n        root.adoptedStyleSheets = [adopted.sheet, ...root.adoptedStyleSheets]\n        return root[SET] = adopted\n      }\n      this.sheet = new win.CSSStyleSheet\n      root.adoptedStyleSheets = [this.sheet, ...root.adoptedStyleSheets]\n      adoptedSet.set(doc, this)\n    } else {\n      this.styleTag = doc.createElement(\"style\")\n      let target = root.head || root\n      target.insertBefore(this.styleTag, target.firstChild)\n    }\n    this.modules = []\n    root[SET] = this\n  }\n\n  mount(modules) {\n    let sheet = this.sheet\n    let pos = 0 /* Current rule offset */, j = 0 /* Index into this.modules */\n    for (let i = 0; i < modules.length; i++) {\n      let mod = modules[i], index = this.modules.indexOf(mod)\n      if (index < j && index > -1) { // Ordering conflict\n        this.modules.splice(index, 1)\n        j--\n        index = -1\n      }\n      if (index == -1) {\n        this.modules.splice(j++, 0, mod)\n        if (sheet) for (let k = 0; k < mod.rules.length; k++)\n          sheet.insertRule(mod.rules[k], pos++)\n      } else {\n        while (j < index) pos += this.modules[j++].rules.length\n        pos += mod.rules.length\n        j++\n      }\n    }\n\n    if (!sheet) {\n      let text = \"\"\n      for (let i = 0; i < this.modules.length; i++)\n        text += this.modules[i].getRules() + \"\\n\"\n      this.styleTag.textContent = text\n    }\n  }\n}\n\n// Style::Object<union<Style,string>>\n//\n// A style is an object that, in the simple case, maps CSS property\n// names to strings holding their values, as in `{color: \"red\",\n// fontWeight: \"bold\"}`. The property names can be given in\n// camel-case—the library will insert a dash before capital letters\n// when converting them to CSS.\n//\n// If you include an underscore in a property name, it and everything\n// after it will be removed from the output, which can be useful when\n// providing a property multiple times, for browser compatibility\n// reasons.\n//\n// A property in a style object can also be a sub-selector, which\n// extends the current context to add a pseudo-selector or a child\n// selector. Such a property should contain a `&` character, which\n// will be replaced by the current selector. For example `{\"&:before\":\n// {content: '\"hi\"'}}`. Sub-selectors and regular properties can\n// freely be mixed in a given object. Any property containing a `&` is\n// assumed to be a sub-selector.\n//\n// Finally, a property can specify an @-block to be wrapped around the\n// styles defined inside the object that's the property's value. For\n// example to create a media query you can do `{\"@media screen and\n// (min-width: 400px)\": {...}}`.\n","export var base = {\n  8: \"Backspace\",\n  9: \"Tab\",\n  10: \"Enter\",\n  12: \"NumLock\",\n  13: \"Enter\",\n  16: \"Shift\",\n  17: \"Control\",\n  18: \"Alt\",\n  20: \"CapsLock\",\n  27: \"Escape\",\n  32: \" \",\n  33: \"PageUp\",\n  34: \"PageDown\",\n  35: \"End\",\n  36: \"Home\",\n  37: \"ArrowLeft\",\n  38: \"ArrowUp\",\n  39: \"ArrowRight\",\n  40: \"ArrowDown\",\n  44: \"PrintScreen\",\n  45: \"Insert\",\n  46: \"Delete\",\n  59: \";\",\n  61: \"=\",\n  91: \"Meta\",\n  92: \"Meta\",\n  106: \"*\",\n  107: \"+\",\n  108: \",\",\n  109: \"-\",\n  110: \".\",\n  111: \"/\",\n  144: \"NumLock\",\n  145: \"ScrollLock\",\n  160: \"Shift\",\n  161: \"Shift\",\n  162: \"Control\",\n  163: \"Control\",\n  164: \"Alt\",\n  165: \"Alt\",\n  173: \"-\",\n  186: \";\",\n  187: \"=\",\n  188: \",\",\n  189: \"-\",\n  190: \".\",\n  191: \"/\",\n  192: \"`\",\n  219: \"[\",\n  220: \"\\\\\",\n  221: \"]\",\n  222: \"'\"\n}\n\nexport var shift = {\n  48: \")\",\n  49: \"!\",\n  50: \"@\",\n  51: \"#\",\n  52: \"$\",\n  53: \"%\",\n  54: \"^\",\n  55: \"&\",\n  56: \"*\",\n  57: \"(\",\n  59: \":\",\n  61: \"+\",\n  173: \"_\",\n  186: \":\",\n  187: \"+\",\n  188: \"<\",\n  189: \"_\",\n  190: \">\",\n  191: \"?\",\n  192: \"~\",\n  219: \"{\",\n  220: \"|\",\n  221: \"}\",\n  222: \"\\\"\"\n}\n\nvar mac = typeof navigator != \"undefined\" && /Mac/.test(navigator.platform)\nvar ie = typeof navigator != \"undefined\" && /MSIE \\d|Trident\\/(?:[7-9]|\\d{2,})\\..*rv:(\\d+)/.exec(navigator.userAgent)\n\n// Fill in the digit keys\nfor (var i = 0; i < 10; i++) base[48 + i] = base[96 + i] = String(i)\n\n// The function keys\nfor (var i = 1; i <= 24; i++) base[i + 111] = \"F\" + i\n\n// And the alphabetic keys\nfor (var i = 65; i <= 90; i++) {\n  base[i] = String.fromCharCode(i + 32)\n  shift[i] = String.fromCharCode(i)\n}\n\n// For each code that doesn't have a shift-equivalent, copy the base name\nfor (var code in base) if (!shift.hasOwnProperty(code)) shift[code] = base[code]\n\nexport function keyName(event) {\n  // On macOS, keys held with Shift and Cmd don't reflect the effect of Shift in `.key`.\n  // On IE, shift effect is never included in `.key`.\n  var ignoreKey = mac && event.metaKey && event.shiftKey && !event.ctrlKey && !event.altKey ||\n      ie && event.shiftKey && event.key && event.key.length == 1 ||\n      event.key == \"Unidentified\"\n  var name = (!ignoreKey && event.key) ||\n    (event.shiftKey ? shift : base)[event.keyCode] ||\n    event.key || \"Unidentified\"\n  // Edge sometimes produces wrong names (Issue #3)\n  if (name == \"Esc\") name = \"Escape\"\n  if (name == \"Del\") name = \"Delete\"\n  // https://developer.microsoft.com/en-us/microsoft-edge/platform/issues/8860571/\n  if (name == \"Left\") name = \"ArrowLeft\"\n  if (name == \"Up\") name = \"ArrowUp\"\n  if (name == \"Right\") name = \"ArrowRight\"\n  if (name == \"Down\") name = \"ArrowDown\"\n  return name\n}\n","import { Text, RangeSet, MapMode, RangeValue, Facet, StateEffect, ChangeSet, findClusterBreak, EditorSelection, EditorState, findColumn, CharCategory, Annotation, Prec, Transaction, codePointAt, codePointSize, combineConfig, StateField, RangeSetBuilder, countColumn } from '@codemirror/state';\nimport { StyleModule } from 'style-mod';\nimport { keyName, base, shift } from 'w3c-keyname';\n\nfunction getSelection(root) {\n    let target;\n    // Browsers differ on whether shadow roots have a getSelection\n    // method. If it exists, use that, otherwise, call it on the\n    // document.\n    if (root.nodeType == 11) { // Shadow root\n        target = root.getSelection ? root : root.ownerDocument;\n    }\n    else {\n        target = root;\n    }\n    return target.getSelection();\n}\nfunction contains(dom, node) {\n    return node ? dom == node || dom.contains(node.nodeType != 1 ? node.parentNode : node) : false;\n}\nfunction deepActiveElement(doc) {\n    let elt = doc.activeElement;\n    while (elt && elt.shadowRoot)\n        elt = elt.shadowRoot.activeElement;\n    return elt;\n}\nfunction hasSelection(dom, selection) {\n    if (!selection.anchorNode)\n        return false;\n    try {\n        // Firefox will raise 'permission denied' errors when accessing\n        // properties of `sel.anchorNode` when it's in a generated CSS\n        // element.\n        return contains(dom, selection.anchorNode);\n    }\n    catch (_) {\n        return false;\n    }\n}\nfunction clientRectsFor(dom) {\n    if (dom.nodeType == 3)\n        return textRange(dom, 0, dom.nodeValue.length).getClientRects();\n    else if (dom.nodeType == 1)\n        return dom.getClientRects();\n    else\n        return [];\n}\n// Scans forward and backward through DOM positions equivalent to the\n// given one to see if the two are in the same place (i.e. after a\n// text node vs at the end of that text node)\nfunction isEquivalentPosition(node, off, targetNode, targetOff) {\n    return targetNode ? (scanFor(node, off, targetNode, targetOff, -1) ||\n        scanFor(node, off, targetNode, targetOff, 1)) : false;\n}\nfunction domIndex(node) {\n    for (var index = 0;; index++) {\n        node = node.previousSibling;\n        if (!node)\n            return index;\n    }\n}\nfunction scanFor(node, off, targetNode, targetOff, dir) {\n    for (;;) {\n        if (node == targetNode && off == targetOff)\n            return true;\n        if (off == (dir < 0 ? 0 : maxOffset(node))) {\n            if (node.nodeName == \"DIV\")\n                return false;\n            let parent = node.parentNode;\n            if (!parent || parent.nodeType != 1)\n                return false;\n            off = domIndex(node) + (dir < 0 ? 0 : 1);\n            node = parent;\n        }\n        else if (node.nodeType == 1) {\n            node = node.childNodes[off + (dir < 0 ? -1 : 0)];\n            if (node.nodeType == 1 && node.contentEditable == \"false\")\n                return false;\n            off = dir < 0 ? maxOffset(node) : 0;\n        }\n        else {\n            return false;\n        }\n    }\n}\nfunction maxOffset(node) {\n    return node.nodeType == 3 ? node.nodeValue.length : node.childNodes.length;\n}\nfunction flattenRect(rect, left) {\n    let x = left ? rect.left : rect.right;\n    return { left: x, right: x, top: rect.top, bottom: rect.bottom };\n}\nfunction windowRect(win) {\n    return { left: 0, right: win.innerWidth,\n        top: 0, bottom: win.innerHeight };\n}\nfunction scrollRectIntoView(dom, rect, side, x, y, xMargin, yMargin, ltr) {\n    let doc = dom.ownerDocument, win = doc.defaultView || window;\n    for (let cur = dom; cur;) {\n        if (cur.nodeType == 1) { // Element\n            let bounding, top = cur == doc.body;\n            if (top) {\n                bounding = windowRect(win);\n            }\n            else {\n                if (cur.scrollHeight <= cur.clientHeight && cur.scrollWidth <= cur.clientWidth) {\n                    cur = cur.assignedSlot || cur.parentNode;\n                    continue;\n                }\n                let rect = cur.getBoundingClientRect();\n                // Make sure scrollbar width isn't included in the rectangle\n                bounding = { left: rect.left, right: rect.left + cur.clientWidth,\n                    top: rect.top, bottom: rect.top + cur.clientHeight };\n            }\n            let moveX = 0, moveY = 0;\n            if (y == \"nearest\") {\n                if (rect.top < bounding.top) {\n                    moveY = -(bounding.top - rect.top + yMargin);\n                    if (side > 0 && rect.bottom > bounding.bottom + moveY)\n                        moveY = rect.bottom - bounding.bottom + moveY + yMargin;\n                }\n                else if (rect.bottom > bounding.bottom) {\n                    moveY = rect.bottom - bounding.bottom + yMargin;\n                    if (side < 0 && (rect.top - moveY) < bounding.top)\n                        moveY = -(bounding.top + moveY - rect.top + yMargin);\n                }\n            }\n            else {\n                let rectHeight = rect.bottom - rect.top, boundingHeight = bounding.bottom - bounding.top;\n                let targetTop = y == \"center\" && rectHeight <= boundingHeight ? rect.top + rectHeight / 2 - boundingHeight / 2 :\n                    y == \"start\" || y == \"center\" && side < 0 ? rect.top - yMargin :\n                        rect.bottom - boundingHeight + yMargin;\n                moveY = targetTop - bounding.top;\n            }\n            if (x == \"nearest\") {\n                if (rect.left < bounding.left) {\n                    moveX = -(bounding.left - rect.left + xMargin);\n                    if (side > 0 && rect.right > bounding.right + moveX)\n                        moveX = rect.right - bounding.right + moveX + xMargin;\n                }\n                else if (rect.right > bounding.right) {\n                    moveX = rect.right - bounding.right + xMargin;\n                    if (side < 0 && rect.left < bounding.left + moveX)\n                        moveX = -(bounding.left + moveX - rect.left + xMargin);\n                }\n            }\n            else {\n                let targetLeft = x == \"center\" ? rect.left + (rect.right - rect.left) / 2 - (bounding.right - bounding.left) / 2 :\n                    (x == \"start\") == ltr ? rect.left - xMargin :\n                        rect.right - (bounding.right - bounding.left) + xMargin;\n                moveX = targetLeft - bounding.left;\n            }\n            if (moveX || moveY) {\n                if (top) {\n                    win.scrollBy(moveX, moveY);\n                }\n                else {\n                    let movedX = 0, movedY = 0;\n                    if (moveY) {\n                        let start = cur.scrollTop;\n                        cur.scrollTop += moveY;\n                        movedY = cur.scrollTop - start;\n                    }\n                    if (moveX) {\n                        let start = cur.scrollLeft;\n                        cur.scrollLeft += moveX;\n                        movedX = cur.scrollLeft - start;\n                    }\n                    rect = { left: rect.left - movedX, top: rect.top - movedY,\n                        right: rect.right - movedX, bottom: rect.bottom - movedY };\n                    if (movedX && Math.abs(movedX - moveX) < 1)\n                        x = \"nearest\";\n                    if (movedY && Math.abs(movedY - moveY) < 1)\n                        y = \"nearest\";\n                }\n            }\n            if (top)\n                break;\n            cur = cur.assignedSlot || cur.parentNode;\n        }\n        else if (cur.nodeType == 11) { // A shadow root\n            cur = cur.host;\n        }\n        else {\n            break;\n        }\n    }\n}\nfunction scrollableParent(dom) {\n    let doc = dom.ownerDocument;\n    for (let cur = dom.parentNode; cur;) {\n        if (cur == doc.body) {\n            break;\n        }\n        else if (cur.nodeType == 1) {\n            if (cur.scrollHeight > cur.clientHeight || cur.scrollWidth > cur.clientWidth)\n                return cur;\n            cur = cur.assignedSlot || cur.parentNode;\n        }\n        else if (cur.nodeType == 11) {\n            cur = cur.host;\n        }\n        else {\n            break;\n        }\n    }\n    return null;\n}\nclass DOMSelectionState {\n    constructor() {\n        this.anchorNode = null;\n        this.anchorOffset = 0;\n        this.focusNode = null;\n        this.focusOffset = 0;\n    }\n    eq(domSel) {\n        return this.anchorNode == domSel.anchorNode && this.anchorOffset == domSel.anchorOffset &&\n            this.focusNode == domSel.focusNode && this.focusOffset == domSel.focusOffset;\n    }\n    setRange(range) {\n        let { anchorNode, focusNode } = range;\n        // Clip offsets to node size to avoid crashes when Safari reports bogus offsets (#1152)\n        this.set(anchorNode, Math.min(range.anchorOffset, anchorNode ? maxOffset(anchorNode) : 0), focusNode, Math.min(range.focusOffset, focusNode ? maxOffset(focusNode) : 0));\n    }\n    set(anchorNode, anchorOffset, focusNode, focusOffset) {\n        this.anchorNode = anchorNode;\n        this.anchorOffset = anchorOffset;\n        this.focusNode = focusNode;\n        this.focusOffset = focusOffset;\n    }\n}\nlet preventScrollSupported = null;\n// Feature-detects support for .focus({preventScroll: true}), and uses\n// a fallback kludge when not supported.\nfunction focusPreventScroll(dom) {\n    if (dom.setActive)\n        return dom.setActive(); // in IE\n    if (preventScrollSupported)\n        return dom.focus(preventScrollSupported);\n    let stack = [];\n    for (let cur = dom; cur; cur = cur.parentNode) {\n        stack.push(cur, cur.scrollTop, cur.scrollLeft);\n        if (cur == cur.ownerDocument)\n            break;\n    }\n    dom.focus(preventScrollSupported == null ? {\n        get preventScroll() {\n            preventScrollSupported = { preventScroll: true };\n            return true;\n        }\n    } : undefined);\n    if (!preventScrollSupported) {\n        preventScrollSupported = false;\n        for (let i = 0; i < stack.length;) {\n            let elt = stack[i++], top = stack[i++], left = stack[i++];\n            if (elt.scrollTop != top)\n                elt.scrollTop = top;\n            if (elt.scrollLeft != left)\n                elt.scrollLeft = left;\n        }\n    }\n}\nlet scratchRange;\nfunction textRange(node, from, to = from) {\n    let range = scratchRange || (scratchRange = document.createRange());\n    range.setEnd(node, to);\n    range.setStart(node, from);\n    return range;\n}\nfunction dispatchKey(elt, name, code) {\n    let options = { key: name, code: name, keyCode: code, which: code, cancelable: true };\n    let down = new KeyboardEvent(\"keydown\", options);\n    down.synthetic = true;\n    elt.dispatchEvent(down);\n    let up = new KeyboardEvent(\"keyup\", options);\n    up.synthetic = true;\n    elt.dispatchEvent(up);\n    return down.defaultPrevented || up.defaultPrevented;\n}\nfunction getRoot(node) {\n    while (node) {\n        if (node && (node.nodeType == 9 || node.nodeType == 11 && node.host))\n            return node;\n        node = node.assignedSlot || node.parentNode;\n    }\n    return null;\n}\nfunction clearAttributes(node) {\n    while (node.attributes.length)\n        node.removeAttributeNode(node.attributes[0]);\n}\nfunction atElementStart(doc, selection) {\n    let node = selection.focusNode, offset = selection.focusOffset;\n    if (!node || selection.anchorNode != node || selection.anchorOffset != offset)\n        return false;\n    // Safari can report bogus offsets (#1152)\n    offset = Math.min(offset, maxOffset(node));\n    for (;;) {\n        if (offset) {\n            if (node.nodeType != 1)\n                return false;\n            let prev = node.childNodes[offset - 1];\n            if (prev.contentEditable == \"false\")\n                offset--;\n            else {\n                node = prev;\n                offset = maxOffset(node);\n            }\n        }\n        else if (node == doc) {\n            return true;\n        }\n        else {\n            offset = domIndex(node);\n            node = node.parentNode;\n        }\n    }\n}\nfunction isScrolledToBottom(elt) {\n    return elt.scrollTop > Math.max(1, elt.scrollHeight - elt.clientHeight - 4);\n}\n\nclass DOMPos {\n    constructor(node, offset, precise = true) {\n        this.node = node;\n        this.offset = offset;\n        this.precise = precise;\n    }\n    static before(dom, precise) { return new DOMPos(dom.parentNode, domIndex(dom), precise); }\n    static after(dom, precise) { return new DOMPos(dom.parentNode, domIndex(dom) + 1, precise); }\n}\nconst noChildren = [];\nclass ContentView {\n    constructor() {\n        this.parent = null;\n        this.dom = null;\n        this.dirty = 2 /* Node */;\n    }\n    get overrideDOMText() { return null; }\n    get posAtStart() {\n        return this.parent ? this.parent.posBefore(this) : 0;\n    }\n    get posAtEnd() {\n        return this.posAtStart + this.length;\n    }\n    posBefore(view) {\n        let pos = this.posAtStart;\n        for (let child of this.children) {\n            if (child == view)\n                return pos;\n            pos += child.length + child.breakAfter;\n        }\n        throw new RangeError(\"Invalid child in posBefore\");\n    }\n    posAfter(view) {\n        return this.posBefore(view) + view.length;\n    }\n    sync(view, track) {\n        if (this.dirty & 2 /* Node */) {\n            let parent = this.dom;\n            let prev = null, next;\n            for (let child of this.children) {\n                if (child.dirty) {\n                    if (!child.dom && (next = prev ? prev.nextSibling : parent.firstChild) && next != view.docView.compositionNode) {\n                        let contentView = ContentView.get(next);\n                        if (!contentView || !contentView.parent && contentView.canReuseDOM(child))\n                            child.reuseDOM(next);\n                    }\n                    child.sync(view, track);\n                    child.dirty = 0 /* Not */;\n                }\n                next = prev ? prev.nextSibling : parent.firstChild;\n                if (track && !track.written && track.node == parent && next != child.dom)\n                    track.written = true;\n                if (child.dom.parentNode == parent) {\n                    while (next && next != child.dom)\n                        next = rm$1(next);\n                }\n                else {\n                    parent.insertBefore(child.dom, next);\n                }\n                prev = child.dom;\n            }\n            next = prev ? prev.nextSibling : parent.firstChild;\n            if (next && track && track.node == parent)\n                track.written = true;\n            while (next)\n                next = rm$1(next);\n        }\n        else if (this.dirty & 1 /* Child */) {\n            for (let child of this.children)\n                if (child.dirty) {\n                    child.sync(view, track);\n                    child.dirty = 0 /* Not */;\n                }\n        }\n    }\n    reuseDOM(_dom) { }\n    localPosFromDOM(node, offset) {\n        let after;\n        if (node == this.dom) {\n            after = this.dom.childNodes[offset];\n        }\n        else {\n            let bias = maxOffset(node) == 0 ? 0 : offset == 0 ? -1 : 1;\n            for (;;) {\n                let parent = node.parentNode;\n                if (parent == this.dom)\n                    break;\n                if (bias == 0 && parent.firstChild != parent.lastChild) {\n                    if (node == parent.firstChild)\n                        bias = -1;\n                    else\n                        bias = 1;\n                }\n                node = parent;\n            }\n            if (bias < 0)\n                after = node;\n            else\n                after = node.nextSibling;\n        }\n        if (after == this.dom.firstChild)\n            return 0;\n        while (after && !ContentView.get(after))\n            after = after.nextSibling;\n        if (!after)\n            return this.length;\n        for (let i = 0, pos = 0;; i++) {\n            let child = this.children[i];\n            if (child.dom == after)\n                return pos;\n            pos += child.length + child.breakAfter;\n        }\n    }\n    domBoundsAround(from, to, offset = 0) {\n        let fromI = -1, fromStart = -1, toI = -1, toEnd = -1;\n        for (let i = 0, pos = offset, prevEnd = offset; i < this.children.length; i++) {\n            let child = this.children[i], end = pos + child.length;\n            if (pos < from && end > to)\n                return child.domBoundsAround(from, to, pos);\n            if (end >= from && fromI == -1) {\n                fromI = i;\n                fromStart = pos;\n            }\n            if (pos > to && child.dom.parentNode == this.dom) {\n                toI = i;\n                toEnd = prevEnd;\n                break;\n            }\n            prevEnd = end;\n            pos = end + child.breakAfter;\n        }\n        return { from: fromStart, to: toEnd < 0 ? offset + this.length : toEnd,\n            startDOM: (fromI ? this.children[fromI - 1].dom.nextSibling : null) || this.dom.firstChild,\n            endDOM: toI < this.children.length && toI >= 0 ? this.children[toI].dom : null };\n    }\n    markDirty(andParent = false) {\n        this.dirty |= 2 /* Node */;\n        this.markParentsDirty(andParent);\n    }\n    markParentsDirty(childList) {\n        for (let parent = this.parent; parent; parent = parent.parent) {\n            if (childList)\n                parent.dirty |= 2 /* Node */;\n            if (parent.dirty & 1 /* Child */)\n                return;\n            parent.dirty |= 1 /* Child */;\n            childList = false;\n        }\n    }\n    setParent(parent) {\n        if (this.parent != parent) {\n            this.parent = parent;\n            if (this.dirty)\n                this.markParentsDirty(true);\n        }\n    }\n    setDOM(dom) {\n        if (this.dom)\n            this.dom.cmView = null;\n        this.dom = dom;\n        dom.cmView = this;\n    }\n    get rootView() {\n        for (let v = this;;) {\n            let parent = v.parent;\n            if (!parent)\n                return v;\n            v = parent;\n        }\n    }\n    replaceChildren(from, to, children = noChildren) {\n        this.markDirty();\n        for (let i = from; i < to; i++) {\n            let child = this.children[i];\n            if (child.parent == this)\n                child.destroy();\n        }\n        this.children.splice(from, to - from, ...children);\n        for (let i = 0; i < children.length; i++)\n            children[i].setParent(this);\n    }\n    ignoreMutation(_rec) { return false; }\n    ignoreEvent(_event) { return false; }\n    childCursor(pos = this.length) {\n        return new ChildCursor(this.children, pos, this.children.length);\n    }\n    childPos(pos, bias = 1) {\n        return this.childCursor().findPos(pos, bias);\n    }\n    toString() {\n        let name = this.constructor.name.replace(\"View\", \"\");\n        return name + (this.children.length ? \"(\" + this.children.join() + \")\" :\n            this.length ? \"[\" + (name == \"Text\" ? this.text : this.length) + \"]\" : \"\") +\n            (this.breakAfter ? \"#\" : \"\");\n    }\n    static get(node) { return node.cmView; }\n    get isEditable() { return true; }\n    get isWidget() { return false; }\n    get isHidden() { return false; }\n    merge(from, to, source, hasStart, openStart, openEnd) {\n        return false;\n    }\n    become(other) { return false; }\n    canReuseDOM(other) { return other.constructor == this.constructor; }\n    // When this is a zero-length view with a side, this should return a\n    // number <= 0 to indicate it is before its position, or a\n    // number > 0 when after its position.\n    getSide() { return 0; }\n    destroy() {\n        this.parent = null;\n    }\n}\nContentView.prototype.breakAfter = 0;\n// Remove a DOM node and return its next sibling.\nfunction rm$1(dom) {\n    let next = dom.nextSibling;\n    dom.parentNode.removeChild(dom);\n    return next;\n}\nclass ChildCursor {\n    constructor(children, pos, i) {\n        this.children = children;\n        this.pos = pos;\n        this.i = i;\n        this.off = 0;\n    }\n    findPos(pos, bias = 1) {\n        for (;;) {\n            if (pos > this.pos || pos == this.pos &&\n                (bias > 0 || this.i == 0 || this.children[this.i - 1].breakAfter)) {\n                this.off = pos - this.pos;\n                return this;\n            }\n            let next = this.children[--this.i];\n            this.pos -= next.length + next.breakAfter;\n        }\n    }\n}\nfunction replaceRange(parent, fromI, fromOff, toI, toOff, insert, breakAtStart, openStart, openEnd) {\n    let { children } = parent;\n    let before = children.length ? children[fromI] : null;\n    let last = insert.length ? insert[insert.length - 1] : null;\n    let breakAtEnd = last ? last.breakAfter : breakAtStart;\n    // Change within a single child\n    if (fromI == toI && before && !breakAtStart && !breakAtEnd && insert.length < 2 &&\n        before.merge(fromOff, toOff, insert.length ? last : null, fromOff == 0, openStart, openEnd))\n        return;\n    if (toI < children.length) {\n        let after = children[toI];\n        // Make sure the end of the child after the update is preserved in `after`\n        if (after && toOff < after.length) {\n            // If we're splitting a child, separate part of it to avoid that\n            // being mangled when updating the child before the update.\n            if (fromI == toI) {\n                after = after.split(toOff);\n                toOff = 0;\n            }\n            // If the element after the replacement should be merged with\n            // the last replacing element, update `content`\n            if (!breakAtEnd && last && after.merge(0, toOff, last, true, 0, openEnd)) {\n                insert[insert.length - 1] = after;\n            }\n            else {\n                // Remove the start of the after element, if necessary, and\n                // add it to `content`.\n                if (toOff)\n                    after.merge(0, toOff, null, false, 0, openEnd);\n                insert.push(after);\n            }\n        }\n        else if (after === null || after === void 0 ? void 0 : after.breakAfter) {\n            // The element at `toI` is entirely covered by this range.\n            // Preserve its line break, if any.\n            if (last)\n                last.breakAfter = 1;\n            else\n                breakAtStart = 1;\n        }\n        // Since we've handled the next element from the current elements\n        // now, make sure `toI` points after that.\n        toI++;\n    }\n    if (before) {\n        before.breakAfter = breakAtStart;\n        if (fromOff > 0) {\n            if (!breakAtStart && insert.length && before.merge(fromOff, before.length, insert[0], false, openStart, 0)) {\n                before.breakAfter = insert.shift().breakAfter;\n            }\n            else if (fromOff < before.length || before.children.length && before.children[before.children.length - 1].length == 0) {\n                before.merge(fromOff, before.length, null, false, openStart, 0);\n            }\n            fromI++;\n        }\n    }\n    // Try to merge widgets on the boundaries of the replacement\n    while (fromI < toI && insert.length) {\n        if (children[toI - 1].become(insert[insert.length - 1])) {\n            toI--;\n            insert.pop();\n            openEnd = insert.length ? 0 : openStart;\n        }\n        else if (children[fromI].become(insert[0])) {\n            fromI++;\n            insert.shift();\n            openStart = insert.length ? 0 : openEnd;\n        }\n        else {\n            break;\n        }\n    }\n    if (!insert.length && fromI && toI < children.length && !children[fromI - 1].breakAfter &&\n        children[toI].merge(0, 0, children[fromI - 1], false, openStart, openEnd))\n        fromI--;\n    if (fromI < toI || insert.length)\n        parent.replaceChildren(fromI, toI, insert);\n}\nfunction mergeChildrenInto(parent, from, to, insert, openStart, openEnd) {\n    let cur = parent.childCursor();\n    let { i: toI, off: toOff } = cur.findPos(to, 1);\n    let { i: fromI, off: fromOff } = cur.findPos(from, -1);\n    let dLen = from - to;\n    for (let view of insert)\n        dLen += view.length;\n    parent.length += dLen;\n    replaceRange(parent, fromI, fromOff, toI, toOff, insert, 0, openStart, openEnd);\n}\n\nlet nav = typeof navigator != \"undefined\" ? navigator : { userAgent: \"\", vendor: \"\", platform: \"\" };\nlet doc = typeof document != \"undefined\" ? document : { documentElement: { style: {} } };\nconst ie_edge = /*@__PURE__*//Edge\\/(\\d+)/.exec(nav.userAgent);\nconst ie_upto10 = /*@__PURE__*//MSIE \\d/.test(nav.userAgent);\nconst ie_11up = /*@__PURE__*//Trident\\/(?:[7-9]|\\d{2,})\\..*rv:(\\d+)/.exec(nav.userAgent);\nconst ie = !!(ie_upto10 || ie_11up || ie_edge);\nconst gecko = !ie && /*@__PURE__*//gecko\\/(\\d+)/i.test(nav.userAgent);\nconst chrome = !ie && /*@__PURE__*//Chrome\\/(\\d+)/.exec(nav.userAgent);\nconst webkit = \"webkitFontSmoothing\" in doc.documentElement.style;\nconst safari = !ie && /*@__PURE__*//Apple Computer/.test(nav.vendor);\nconst ios = safari && (/*@__PURE__*//Mobile\\/\\w+/.test(nav.userAgent) || nav.maxTouchPoints > 2);\nvar browser = {\n    mac: ios || /*@__PURE__*//Mac/.test(nav.platform),\n    windows: /*@__PURE__*//Win/.test(nav.platform),\n    linux: /*@__PURE__*//Linux|X11/.test(nav.platform),\n    ie,\n    ie_version: ie_upto10 ? doc.documentMode || 6 : ie_11up ? +ie_11up[1] : ie_edge ? +ie_edge[1] : 0,\n    gecko,\n    gecko_version: gecko ? +(/*@__PURE__*//Firefox\\/(\\d+)/.exec(nav.userAgent) || [0, 0])[1] : 0,\n    chrome: !!chrome,\n    chrome_version: chrome ? +chrome[1] : 0,\n    ios,\n    android: /*@__PURE__*//Android\\b/.test(nav.userAgent),\n    webkit,\n    safari,\n    webkit_version: webkit ? +(/*@__PURE__*//\\bAppleWebKit\\/(\\d+)/.exec(navigator.userAgent) || [0, 0])[1] : 0,\n    tabSize: doc.documentElement.style.tabSize != null ? \"tab-size\" : \"-moz-tab-size\"\n};\n\nconst MaxJoinLen = 256;\nclass TextView extends ContentView {\n    constructor(text) {\n        super();\n        this.text = text;\n    }\n    get length() { return this.text.length; }\n    createDOM(textDOM) {\n        this.setDOM(textDOM || document.createTextNode(this.text));\n    }\n    sync(view, track) {\n        if (!this.dom)\n            this.createDOM();\n        if (this.dom.nodeValue != this.text) {\n            if (track && track.node == this.dom)\n                track.written = true;\n            this.dom.nodeValue = this.text;\n        }\n    }\n    reuseDOM(dom) {\n        if (dom.nodeType == 3)\n            this.createDOM(dom);\n    }\n    merge(from, to, source) {\n        if (source && (!(source instanceof TextView) || this.length - (to - from) + source.length > MaxJoinLen))\n            return false;\n        this.text = this.text.slice(0, from) + (source ? source.text : \"\") + this.text.slice(to);\n        this.markDirty();\n        return true;\n    }\n    split(from) {\n        let result = new TextView(this.text.slice(from));\n        this.text = this.text.slice(0, from);\n        this.markDirty();\n        return result;\n    }\n    localPosFromDOM(node, offset) {\n        return node == this.dom ? offset : offset ? this.text.length : 0;\n    }\n    domAtPos(pos) { return new DOMPos(this.dom, pos); }\n    domBoundsAround(_from, _to, offset) {\n        return { from: offset, to: offset + this.length, startDOM: this.dom, endDOM: this.dom.nextSibling };\n    }\n    coordsAt(pos, side) {\n        return textCoords(this.dom, pos, side);\n    }\n}\nclass MarkView extends ContentView {\n    constructor(mark, children = [], length = 0) {\n        super();\n        this.mark = mark;\n        this.children = children;\n        this.length = length;\n        for (let ch of children)\n            ch.setParent(this);\n    }\n    setAttrs(dom) {\n        clearAttributes(dom);\n        if (this.mark.class)\n            dom.className = this.mark.class;\n        if (this.mark.attrs)\n            for (let name in this.mark.attrs)\n                dom.setAttribute(name, this.mark.attrs[name]);\n        return dom;\n    }\n    reuseDOM(node) {\n        if (node.nodeName == this.mark.tagName.toUpperCase()) {\n            this.setDOM(node);\n            this.dirty |= 4 /* Attrs */ | 2 /* Node */;\n        }\n    }\n    sync(view, track) {\n        if (!this.dom)\n            this.setDOM(this.setAttrs(document.createElement(this.mark.tagName)));\n        else if (this.dirty & 4 /* Attrs */)\n            this.setAttrs(this.dom);\n        super.sync(view, track);\n    }\n    merge(from, to, source, _hasStart, openStart, openEnd) {\n        if (source && (!(source instanceof MarkView && source.mark.eq(this.mark)) ||\n            (from && openStart <= 0) || (to < this.length && openEnd <= 0)))\n            return false;\n        mergeChildrenInto(this, from, to, source ? source.children : [], openStart - 1, openEnd - 1);\n        this.markDirty();\n        return true;\n    }\n    split(from) {\n        let result = [], off = 0, detachFrom = -1, i = 0;\n        for (let elt of this.children) {\n            let end = off + elt.length;\n            if (end > from)\n                result.push(off < from ? elt.split(from - off) : elt);\n            if (detachFrom < 0 && off >= from)\n                detachFrom = i;\n            off = end;\n            i++;\n        }\n        let length = this.length - from;\n        this.length = from;\n        if (detachFrom > -1) {\n            this.children.length = detachFrom;\n            this.markDirty();\n        }\n        return new MarkView(this.mark, result, length);\n    }\n    domAtPos(pos) {\n        return inlineDOMAtPos(this, pos);\n    }\n    coordsAt(pos, side) {\n        return coordsInChildren(this, pos, side);\n    }\n}\nfunction textCoords(text, pos, side) {\n    let length = text.nodeValue.length;\n    if (pos > length)\n        pos = length;\n    let from = pos, to = pos, flatten = 0;\n    if (pos == 0 && side < 0 || pos == length && side >= 0) {\n        if (!(browser.chrome || browser.gecko)) { // These browsers reliably return valid rectangles for empty ranges\n            if (pos) {\n                from--;\n                flatten = 1;\n            } // FIXME this is wrong in RTL text\n            else if (to < length) {\n                to++;\n                flatten = -1;\n            }\n        }\n    }\n    else {\n        if (side < 0)\n            from--;\n        else if (to < length)\n            to++;\n    }\n    let rects = textRange(text, from, to).getClientRects();\n    if (!rects.length)\n        return null;\n    let rect = rects[(flatten ? flatten < 0 : side >= 0) ? 0 : rects.length - 1];\n    if (browser.safari && !flatten && rect.width == 0)\n        rect = Array.prototype.find.call(rects, r => r.width) || rect;\n    return flatten ? flattenRect(rect, flatten < 0) : rect || null;\n}\n// Also used for collapsed ranges that don't have a placeholder widget!\nclass WidgetView extends ContentView {\n    constructor(widget, length, side) {\n        super();\n        this.widget = widget;\n        this.length = length;\n        this.side = side;\n        this.prevWidget = null;\n    }\n    static create(widget, length, side) {\n        return new (widget.customView || WidgetView)(widget, length, side);\n    }\n    split(from) {\n        let result = WidgetView.create(this.widget, this.length - from, this.side);\n        this.length -= from;\n        return result;\n    }\n    sync(view) {\n        if (!this.dom || !this.widget.updateDOM(this.dom, view)) {\n            if (this.dom && this.prevWidget)\n                this.prevWidget.destroy(this.dom);\n            this.prevWidget = null;\n            this.setDOM(this.widget.toDOM(view));\n            this.dom.contentEditable = \"false\";\n        }\n    }\n    getSide() { return this.side; }\n    merge(from, to, source, hasStart, openStart, openEnd) {\n        if (source && (!(source instanceof WidgetView) || !this.widget.compare(source.widget) ||\n            from > 0 && openStart <= 0 || to < this.length && openEnd <= 0))\n            return false;\n        this.length = from + (source ? source.length : 0) + (this.length - to);\n        return true;\n    }\n    become(other) {\n        if (other instanceof WidgetView && other.side == this.side &&\n            this.widget.constructor == other.widget.constructor) {\n            if (!this.widget.compare(other.widget))\n                this.markDirty(true);\n            if (this.dom && !this.prevWidget)\n                this.prevWidget = this.widget;\n            this.widget = other.widget;\n            this.length = other.length;\n            return true;\n        }\n        return false;\n    }\n    ignoreMutation() { return true; }\n    ignoreEvent(event) { return this.widget.ignoreEvent(event); }\n    get overrideDOMText() {\n        if (this.length == 0)\n            return Text.empty;\n        let top = this;\n        while (top.parent)\n            top = top.parent;\n        let { view } = top, text = view && view.state.doc, start = this.posAtStart;\n        return text ? text.slice(start, start + this.length) : Text.empty;\n    }\n    domAtPos(pos) {\n        return (this.length ? pos == 0 : this.side > 0)\n            ? DOMPos.before(this.dom)\n            : DOMPos.after(this.dom, pos == this.length);\n    }\n    domBoundsAround() { return null; }\n    coordsAt(pos, side) {\n        let custom = this.widget.coordsAt(this.dom, pos, side);\n        if (custom)\n            return custom;\n        let rects = this.dom.getClientRects(), rect = null;\n        if (!rects.length)\n            return null;\n        let fromBack = this.side ? this.side < 0 : pos > 0;\n        for (let i = fromBack ? rects.length - 1 : 0;; i += (fromBack ? -1 : 1)) {\n            rect = rects[i];\n            if (pos > 0 ? i == 0 : i == rects.length - 1 || rect.top < rect.bottom)\n                break;\n        }\n        return flattenRect(rect, !fromBack);\n    }\n    get isEditable() { return false; }\n    get isWidget() { return true; }\n    get isHidden() { return this.widget.isHidden; }\n    destroy() {\n        super.destroy();\n        if (this.dom)\n            this.widget.destroy(this.dom);\n    }\n}\nclass CompositionView extends WidgetView {\n    domAtPos(pos) {\n        let { topView, text } = this.widget;\n        if (!topView)\n            return new DOMPos(text, Math.min(pos, text.nodeValue.length));\n        return scanCompositionTree(pos, 0, topView, text, this.length - topView.length, (v, p) => v.domAtPos(p), (text, p) => new DOMPos(text, Math.min(p, text.nodeValue.length)));\n    }\n    sync() { this.setDOM(this.widget.toDOM()); }\n    localPosFromDOM(node, offset) {\n        let { topView, text } = this.widget;\n        if (!topView)\n            return Math.min(offset, this.length);\n        return posFromDOMInCompositionTree(node, offset, topView, text, this.length - topView.length);\n    }\n    ignoreMutation() { return false; }\n    get overrideDOMText() { return null; }\n    coordsAt(pos, side) {\n        let { topView, text } = this.widget;\n        if (!topView)\n            return textCoords(text, pos, side);\n        return scanCompositionTree(pos, side, topView, text, this.length - topView.length, (v, pos, side) => v.coordsAt(pos, side), (text, pos, side) => textCoords(text, pos, side));\n    }\n    destroy() {\n        var _a;\n        super.destroy();\n        (_a = this.widget.topView) === null || _a === void 0 ? void 0 : _a.destroy();\n    }\n    get isEditable() { return true; }\n    canReuseDOM() { return true; }\n}\n// Uses the old structure of a chunk of content view frozen for\n// composition to try and find a reasonable DOM location for the given\n// offset.\nfunction scanCompositionTree(pos, side, view, text, dLen, enterView, fromText) {\n    if (view instanceof MarkView) {\n        for (let child = view.dom.firstChild; child; child = child.nextSibling) {\n            let desc = ContentView.get(child);\n            if (!desc) {\n                let inner = scanCompositionNode(pos, side, child, fromText);\n                if (typeof inner != \"number\")\n                    return inner;\n                pos = inner;\n            }\n            else {\n                let hasComp = contains(child, text);\n                let len = desc.length + (hasComp ? dLen : 0);\n                if (pos < len || pos == len && desc.getSide() <= 0)\n                    return hasComp ? scanCompositionTree(pos, side, desc, text, dLen, enterView, fromText) : enterView(desc, pos, side);\n                pos -= len;\n            }\n        }\n        return enterView(view, view.length, -1);\n    }\n    else if (view.dom == text) {\n        return fromText(text, pos, side);\n    }\n    else {\n        return enterView(view, pos, side);\n    }\n}\nfunction scanCompositionNode(pos, side, node, fromText) {\n    if (node.nodeType == 3) {\n        let len = node.nodeValue.length;\n        if (pos <= len)\n            return fromText(node, pos, side);\n        pos -= len;\n    }\n    else if (node.nodeType == 1 && node.contentEditable != \"false\") {\n        for (let child = node.firstChild; child; child = child.nextSibling) {\n            let inner = scanCompositionNode(pos, side, child, fromText);\n            if (typeof inner != \"number\")\n                return inner;\n            pos = inner;\n        }\n    }\n    return pos;\n}\nfunction posFromDOMInCompositionTree(node, offset, view, text, dLen) {\n    if (view instanceof MarkView) {\n        let pos = 0;\n        for (let child = view.dom.firstChild; child; child = child.nextSibling) {\n            let childView = ContentView.get(child);\n            if (childView) {\n                let hasComp = contains(child, text);\n                if (contains(child, node))\n                    return pos + (hasComp ? posFromDOMInCompositionTree(node, offset, childView, text, dLen)\n                        : childView.localPosFromDOM(node, offset));\n                pos += childView.length + (hasComp ? dLen : 0);\n            }\n            else {\n                let inner = posFromDOMInOpaqueNode(node, offset, child);\n                if (inner.result != null)\n                    return pos + inner.result;\n                pos += inner.size;\n            }\n        }\n    }\n    else if (view.dom == text) {\n        return Math.min(offset, text.nodeValue.length);\n    }\n    return view.localPosFromDOM(node, offset);\n}\nfunction posFromDOMInOpaqueNode(node, offset, target) {\n    if (target.nodeType == 3) {\n        return node == target ? { result: offset } : { size: target.nodeValue.length };\n    }\n    else if (target.nodeType == 1 && target.contentEditable != \"false\") {\n        let pos = 0;\n        for (let child = target.firstChild, i = 0;; child = child.nextSibling, i++) {\n            if (node == target && i == offset)\n                return { result: pos };\n            if (!child)\n                return { size: pos };\n            let inner = posFromDOMInOpaqueNode(node, offset, child);\n            if (inner.result != null)\n                return { result: offset + inner.result };\n            pos += inner.size;\n        }\n    }\n    else {\n        return target.contains(node) ? { result: 0 } : { size: 0 };\n    }\n}\n// These are drawn around uneditable widgets to avoid a number of\n// browser bugs that show up when the cursor is directly next to\n// uneditable inline content.\nclass WidgetBufferView extends ContentView {\n    constructor(side) {\n        super();\n        this.side = side;\n    }\n    get length() { return 0; }\n    merge() { return false; }\n    become(other) {\n        return other instanceof WidgetBufferView && other.side == this.side;\n    }\n    split() { return new WidgetBufferView(this.side); }\n    sync() {\n        if (!this.dom) {\n            let dom = document.createElement(\"img\");\n            dom.className = \"cm-widgetBuffer\";\n            dom.setAttribute(\"aria-hidden\", \"true\");\n            this.setDOM(dom);\n        }\n    }\n    getSide() { return this.side; }\n    domAtPos(pos) { return this.side > 0 ? DOMPos.before(this.dom) : DOMPos.after(this.dom); }\n    localPosFromDOM() { return 0; }\n    domBoundsAround() { return null; }\n    coordsAt(pos) {\n        return this.dom.getBoundingClientRect();\n    }\n    get overrideDOMText() {\n        return Text.empty;\n    }\n    get isHidden() { return true; }\n}\nTextView.prototype.children = WidgetView.prototype.children = WidgetBufferView.prototype.children = noChildren;\nfunction inlineDOMAtPos(parent, pos) {\n    let dom = parent.dom, { children } = parent, i = 0;\n    for (let off = 0; i < children.length; i++) {\n        let child = children[i], end = off + child.length;\n        if (end == off && child.getSide() <= 0)\n            continue;\n        if (pos > off && pos < end && child.dom.parentNode == dom)\n            return child.domAtPos(pos - off);\n        if (pos <= off)\n            break;\n        off = end;\n    }\n    for (let j = i; j > 0; j--) {\n        let prev = children[j - 1];\n        if (prev.dom.parentNode == dom)\n            return prev.domAtPos(prev.length);\n    }\n    for (let j = i; j < children.length; j++) {\n        let next = children[j];\n        if (next.dom.parentNode == dom)\n            return next.domAtPos(0);\n    }\n    return new DOMPos(dom, 0);\n}\n// Assumes `view`, if a mark view, has precisely 1 child.\nfunction joinInlineInto(parent, view, open) {\n    let last, { children } = parent;\n    if (open > 0 && view instanceof MarkView && children.length &&\n        (last = children[children.length - 1]) instanceof MarkView && last.mark.eq(view.mark)) {\n        joinInlineInto(last, view.children[0], open - 1);\n    }\n    else {\n        children.push(view);\n        view.setParent(parent);\n    }\n    parent.length += view.length;\n}\nfunction coordsInChildren(view, pos, side) {\n    let before = null, beforePos = -1, after = null, afterPos = -1;\n    function scan(view, pos) {\n        for (let i = 0, off = 0; i < view.children.length && off <= pos; i++) {\n            let child = view.children[i], end = off + child.length;\n            if (end >= pos) {\n                if (child.children.length) {\n                    scan(child, pos - off);\n                }\n                else if ((!after || after.isHidden && side > 0) &&\n                    (end > pos || off == end && child.getSide() > 0)) {\n                    after = child;\n                    afterPos = pos - off;\n                }\n                else if (off < pos || (off == end && child.getSide() < 0) && !child.isHidden) {\n                    before = child;\n                    beforePos = pos - off;\n                }\n            }\n            off = end;\n        }\n    }\n    scan(view, pos);\n    let target = (side < 0 ? before : after) || before || after;\n    if (target)\n        return target.coordsAt(Math.max(0, target == before ? beforePos : afterPos), side);\n    return fallbackRect(view);\n}\nfunction fallbackRect(view) {\n    let last = view.dom.lastChild;\n    if (!last)\n        return view.dom.getBoundingClientRect();\n    let rects = clientRectsFor(last);\n    return rects[rects.length - 1] || null;\n}\n\nfunction combineAttrs(source, target) {\n    for (let name in source) {\n        if (name == \"class\" && target.class)\n            target.class += \" \" + source.class;\n        else if (name == \"style\" && target.style)\n            target.style += \";\" + source.style;\n        else\n            target[name] = source[name];\n    }\n    return target;\n}\nfunction attrsEq(a, b) {\n    if (a == b)\n        return true;\n    if (!a || !b)\n        return false;\n    let keysA = Object.keys(a), keysB = Object.keys(b);\n    if (keysA.length != keysB.length)\n        return false;\n    for (let key of keysA) {\n        if (keysB.indexOf(key) == -1 || a[key] !== b[key])\n            return false;\n    }\n    return true;\n}\nfunction updateAttrs(dom, prev, attrs) {\n    let changed = null;\n    if (prev)\n        for (let name in prev)\n            if (!(attrs && name in attrs))\n                dom.removeAttribute(changed = name);\n    if (attrs)\n        for (let name in attrs)\n            if (!(prev && prev[name] == attrs[name]))\n                dom.setAttribute(changed = name, attrs[name]);\n    return !!changed;\n}\n\n/**\nWidgets added to the content are described by subclasses of this\nclass. Using a description object like that makes it possible to\ndelay creating of the DOM structure for a widget until it is\nneeded, and to avoid redrawing widgets even if the decorations\nthat define them are recreated.\n*/\nclass WidgetType {\n    /**\n    Compare this instance to another instance of the same type.\n    (TypeScript can't express this, but only instances of the same\n    specific class will be passed to this method.) This is used to\n    avoid redrawing widgets when they are replaced by a new\n    decoration of the same type. The default implementation just\n    returns `false`, which will cause new instances of the widget to\n    always be redrawn.\n    */\n    eq(widget) { return false; }\n    /**\n    Update a DOM element created by a widget of the same type (but\n    different, non-`eq` content) to reflect this widget. May return\n    true to indicate that it could update, false to indicate it\n    couldn't (in which case the widget will be redrawn). The default\n    implementation just returns false.\n    */\n    updateDOM(dom, view) { return false; }\n    /**\n    @internal\n    */\n    compare(other) {\n        return this == other || this.constructor == other.constructor && this.eq(other);\n    }\n    /**\n    The estimated height this widget will have, to be used when\n    estimating the height of content that hasn't been drawn. May\n    return -1 to indicate you don't know. The default implementation\n    returns -1.\n    */\n    get estimatedHeight() { return -1; }\n    /**\n    For inline widgets that are displayed inline (as opposed to\n    `inline-block`) and introduce line breaks (through `<br>` tags\n    or textual newlines), this must indicate the amount of line\n    breaks they introduce. Defaults to 0.\n    */\n    get lineBreaks() { return 0; }\n    /**\n    Can be used to configure which kinds of events inside the widget\n    should be ignored by the editor. The default is to ignore all\n    events.\n    */\n    ignoreEvent(event) { return true; }\n    /**\n    Override the way screen coordinates for positions at/in the\n    widget are found. `pos` will be the offset into the widget, and\n    `side` the side of the position that is being queried—less than\n    zero for before, greater than zero for after, and zero for\n    directly at that position.\n    */\n    coordsAt(dom, pos, side) { return null; }\n    /**\n    @internal\n    */\n    get customView() { return null; }\n    /**\n    @internal\n    */\n    get isHidden() { return false; }\n    /**\n    This is called when the an instance of the widget is removed\n    from the editor view.\n    */\n    destroy(dom) { }\n}\n/**\nThe different types of blocks that can occur in an editor view.\n*/\nvar BlockType = /*@__PURE__*/(function (BlockType) {\n    /**\n    A line of text.\n    */\n    BlockType[BlockType[\"Text\"] = 0] = \"Text\";\n    /**\n    A block widget associated with the position after it.\n    */\n    BlockType[BlockType[\"WidgetBefore\"] = 1] = \"WidgetBefore\";\n    /**\n    A block widget associated with the position before it.\n    */\n    BlockType[BlockType[\"WidgetAfter\"] = 2] = \"WidgetAfter\";\n    /**\n    A block widget [replacing](https://codemirror.net/6/docs/ref/#view.Decoration^replace) a range of content.\n    */\n    BlockType[BlockType[\"WidgetRange\"] = 3] = \"WidgetRange\";\nreturn BlockType})(BlockType || (BlockType = {}));\n/**\nA decoration provides information on how to draw or style a piece\nof content. You'll usually use it wrapped in a\n[`Range`](https://codemirror.net/6/docs/ref/#state.Range), which adds a start and end position.\n@nonabstract\n*/\nclass Decoration extends RangeValue {\n    constructor(\n    /**\n    @internal\n    */\n    startSide, \n    /**\n    @internal\n    */\n    endSide, \n    /**\n    @internal\n    */\n    widget, \n    /**\n    The config object used to create this decoration. You can\n    include additional properties in there to store metadata about\n    your decoration.\n    */\n    spec) {\n        super();\n        this.startSide = startSide;\n        this.endSide = endSide;\n        this.widget = widget;\n        this.spec = spec;\n    }\n    /**\n    @internal\n    */\n    get heightRelevant() { return false; }\n    /**\n    Create a mark decoration, which influences the styling of the\n    content in its range. Nested mark decorations will cause nested\n    DOM elements to be created. Nesting order is determined by\n    precedence of the [facet](https://codemirror.net/6/docs/ref/#view.EditorView^decorations), with\n    the higher-precedence decorations creating the inner DOM nodes.\n    Such elements are split on line boundaries and on the boundaries\n    of lower-precedence decorations.\n    */\n    static mark(spec) {\n        return new MarkDecoration(spec);\n    }\n    /**\n    Create a widget decoration, which displays a DOM element at the\n    given position.\n    */\n    static widget(spec) {\n        let side = Math.max(-10000, Math.min(10000, spec.side || 0)), block = !!spec.block;\n        side += (block && !spec.inlineOrder)\n            ? (side > 0 ? 300000000 /* BlockAfter */ : -400000000 /* BlockBefore */)\n            : (side > 0 ? 100000000 /* InlineAfter */ : -100000000 /* InlineBefore */);\n        return new PointDecoration(spec, side, side, block, spec.widget || null, false);\n    }\n    /**\n    Create a replace decoration which replaces the given range with\n    a widget, or simply hides it.\n    */\n    static replace(spec) {\n        let block = !!spec.block, startSide, endSide;\n        if (spec.isBlockGap) {\n            startSide = -500000000 /* GapStart */;\n            endSide = 400000000 /* GapEnd */;\n        }\n        else {\n            let { start, end } = getInclusive(spec, block);\n            startSide = (start ? (block ? -300000000 /* BlockIncStart */ : -1 /* InlineIncStart */) : 500000000 /* NonIncStart */) - 1;\n            endSide = (end ? (block ? 200000000 /* BlockIncEnd */ : 1 /* InlineIncEnd */) : -600000000 /* NonIncEnd */) + 1;\n        }\n        return new PointDecoration(spec, startSide, endSide, block, spec.widget || null, true);\n    }\n    /**\n    Create a line decoration, which can add DOM attributes to the\n    line starting at the given position.\n    */\n    static line(spec) {\n        return new LineDecoration(spec);\n    }\n    /**\n    Build a [`DecorationSet`](https://codemirror.net/6/docs/ref/#view.DecorationSet) from the given\n    decorated range or ranges. If the ranges aren't already sorted,\n    pass `true` for `sort` to make the library sort them for you.\n    */\n    static set(of, sort = false) {\n        return RangeSet.of(of, sort);\n    }\n    /**\n    @internal\n    */\n    hasHeight() { return this.widget ? this.widget.estimatedHeight > -1 : false; }\n}\n/**\nThe empty set of decorations.\n*/\nDecoration.none = RangeSet.empty;\nclass MarkDecoration extends Decoration {\n    constructor(spec) {\n        let { start, end } = getInclusive(spec);\n        super(start ? -1 /* InlineIncStart */ : 500000000 /* NonIncStart */, end ? 1 /* InlineIncEnd */ : -600000000 /* NonIncEnd */, null, spec);\n        this.tagName = spec.tagName || \"span\";\n        this.class = spec.class || \"\";\n        this.attrs = spec.attributes || null;\n    }\n    eq(other) {\n        return this == other ||\n            other instanceof MarkDecoration &&\n                this.tagName == other.tagName &&\n                this.class == other.class &&\n                attrsEq(this.attrs, other.attrs);\n    }\n    range(from, to = from) {\n        if (from >= to)\n            throw new RangeError(\"Mark decorations may not be empty\");\n        return super.range(from, to);\n    }\n}\nMarkDecoration.prototype.point = false;\nclass LineDecoration extends Decoration {\n    constructor(spec) {\n        super(-200000000 /* Line */, -200000000 /* Line */, null, spec);\n    }\n    eq(other) {\n        return other instanceof LineDecoration &&\n            this.spec.class == other.spec.class &&\n            attrsEq(this.spec.attributes, other.spec.attributes);\n    }\n    range(from, to = from) {\n        if (to != from)\n            throw new RangeError(\"Line decoration ranges must be zero-length\");\n        return super.range(from, to);\n    }\n}\nLineDecoration.prototype.mapMode = MapMode.TrackBefore;\nLineDecoration.prototype.point = true;\nclass PointDecoration extends Decoration {\n    constructor(spec, startSide, endSide, block, widget, isReplace) {\n        super(startSide, endSide, widget, spec);\n        this.block = block;\n        this.isReplace = isReplace;\n        this.mapMode = !block ? MapMode.TrackDel : startSide <= 0 ? MapMode.TrackBefore : MapMode.TrackAfter;\n    }\n    // Only relevant when this.block == true\n    get type() {\n        return this.startSide < this.endSide ? BlockType.WidgetRange\n            : this.startSide <= 0 ? BlockType.WidgetBefore : BlockType.WidgetAfter;\n    }\n    get heightRelevant() {\n        return this.block || !!this.widget && (this.widget.estimatedHeight >= 5 || this.widget.lineBreaks > 0);\n    }\n    eq(other) {\n        return other instanceof PointDecoration &&\n            widgetsEq(this.widget, other.widget) &&\n            this.block == other.block &&\n            this.startSide == other.startSide && this.endSide == other.endSide;\n    }\n    range(from, to = from) {\n        if (this.isReplace && (from > to || (from == to && this.startSide > 0 && this.endSide <= 0)))\n            throw new RangeError(\"Invalid range for replacement decoration\");\n        if (!this.isReplace && to != from)\n            throw new RangeError(\"Widget decorations can only have zero-length ranges\");\n        return super.range(from, to);\n    }\n}\nPointDecoration.prototype.point = true;\nfunction getInclusive(spec, block = false) {\n    let { inclusiveStart: start, inclusiveEnd: end } = spec;\n    if (start == null)\n        start = spec.inclusive;\n    if (end == null)\n        end = spec.inclusive;\n    return { start: start !== null && start !== void 0 ? start : block, end: end !== null && end !== void 0 ? end : block };\n}\nfunction widgetsEq(a, b) {\n    return a == b || !!(a && b && a.compare(b));\n}\nfunction addRange(from, to, ranges, margin = 0) {\n    let last = ranges.length - 1;\n    if (last >= 0 && ranges[last] + margin >= from)\n        ranges[last] = Math.max(ranges[last], to);\n    else\n        ranges.push(from, to);\n}\n\nclass LineView extends ContentView {\n    constructor() {\n        super(...arguments);\n        this.children = [];\n        this.length = 0;\n        this.prevAttrs = undefined;\n        this.attrs = null;\n        this.breakAfter = 0;\n    }\n    // Consumes source\n    merge(from, to, source, hasStart, openStart, openEnd) {\n        if (source) {\n            if (!(source instanceof LineView))\n                return false;\n            if (!this.dom)\n                source.transferDOM(this); // Reuse source.dom when appropriate\n        }\n        if (hasStart)\n            this.setDeco(source ? source.attrs : null);\n        mergeChildrenInto(this, from, to, source ? source.children : [], openStart, openEnd);\n        return true;\n    }\n    split(at) {\n        let end = new LineView;\n        end.breakAfter = this.breakAfter;\n        if (this.length == 0)\n            return end;\n        let { i, off } = this.childPos(at);\n        if (off) {\n            end.append(this.children[i].split(off), 0);\n            this.children[i].merge(off, this.children[i].length, null, false, 0, 0);\n            i++;\n        }\n        for (let j = i; j < this.children.length; j++)\n            end.append(this.children[j], 0);\n        while (i > 0 && this.children[i - 1].length == 0)\n            this.children[--i].destroy();\n        this.children.length = i;\n        this.markDirty();\n        this.length = at;\n        return end;\n    }\n    transferDOM(other) {\n        if (!this.dom)\n            return;\n        this.markDirty();\n        other.setDOM(this.dom);\n        other.prevAttrs = this.prevAttrs === undefined ? this.attrs : this.prevAttrs;\n        this.prevAttrs = undefined;\n        this.dom = null;\n    }\n    setDeco(attrs) {\n        if (!attrsEq(this.attrs, attrs)) {\n            if (this.dom) {\n                this.prevAttrs = this.attrs;\n                this.markDirty();\n            }\n            this.attrs = attrs;\n        }\n    }\n    append(child, openStart) {\n        joinInlineInto(this, child, openStart);\n    }\n    // Only called when building a line view in ContentBuilder\n    addLineDeco(deco) {\n        let attrs = deco.spec.attributes, cls = deco.spec.class;\n        if (attrs)\n            this.attrs = combineAttrs(attrs, this.attrs || {});\n        if (cls)\n            this.attrs = combineAttrs({ class: cls }, this.attrs || {});\n    }\n    domAtPos(pos) {\n        return inlineDOMAtPos(this, pos);\n    }\n    reuseDOM(node) {\n        if (node.nodeName == \"DIV\") {\n            this.setDOM(node);\n            this.dirty |= 4 /* Attrs */ | 2 /* Node */;\n        }\n    }\n    sync(view, track) {\n        var _a;\n        if (!this.dom) {\n            this.setDOM(document.createElement(\"div\"));\n            this.dom.className = \"cm-line\";\n            this.prevAttrs = this.attrs ? null : undefined;\n        }\n        else if (this.dirty & 4 /* Attrs */) {\n            clearAttributes(this.dom);\n            this.dom.className = \"cm-line\";\n            this.prevAttrs = this.attrs ? null : undefined;\n        }\n        if (this.prevAttrs !== undefined) {\n            updateAttrs(this.dom, this.prevAttrs, this.attrs);\n            this.dom.classList.add(\"cm-line\");\n            this.prevAttrs = undefined;\n        }\n        super.sync(view, track);\n        let last = this.dom.lastChild;\n        while (last && ContentView.get(last) instanceof MarkView)\n            last = last.lastChild;\n        if (!last || !this.length ||\n            last.nodeName != \"BR\" && ((_a = ContentView.get(last)) === null || _a === void 0 ? void 0 : _a.isEditable) == false &&\n                (!browser.ios || !this.children.some(ch => ch instanceof TextView))) {\n            let hack = document.createElement(\"BR\");\n            hack.cmIgnore = true;\n            this.dom.appendChild(hack);\n        }\n    }\n    measureTextSize() {\n        if (this.children.length == 0 || this.length > 20)\n            return null;\n        let totalWidth = 0, textHeight;\n        for (let child of this.children) {\n            if (!(child instanceof TextView) || /[^ -~]/.test(child.text))\n                return null;\n            let rects = clientRectsFor(child.dom);\n            if (rects.length != 1)\n                return null;\n            totalWidth += rects[0].width;\n            textHeight = rects[0].height;\n        }\n        return !totalWidth ? null : {\n            lineHeight: this.dom.getBoundingClientRect().height,\n            charWidth: totalWidth / this.length,\n            textHeight\n        };\n    }\n    coordsAt(pos, side) {\n        let rect = coordsInChildren(this, pos, side);\n        // Correct rectangle height for empty lines when the returned\n        // height is larger than the text height.\n        if (!this.children.length && rect && this.parent) {\n            let { heightOracle } = this.parent.view.viewState, height = rect.bottom - rect.top;\n            if (Math.abs(height - heightOracle.lineHeight) < 2 && heightOracle.textHeight < height) {\n                let dist = (height - heightOracle.textHeight) / 2;\n                return { top: rect.top + dist, bottom: rect.bottom - dist, left: rect.left, right: rect.left };\n            }\n        }\n        return rect;\n    }\n    become(_other) { return false; }\n    get type() { return BlockType.Text; }\n    static find(docView, pos) {\n        for (let i = 0, off = 0; i < docView.children.length; i++) {\n            let block = docView.children[i], end = off + block.length;\n            if (end >= pos) {\n                if (block instanceof LineView)\n                    return block;\n                if (end > pos)\n                    break;\n            }\n            off = end + block.breakAfter;\n        }\n        return null;\n    }\n}\nclass BlockWidgetView extends ContentView {\n    constructor(widget, length, type) {\n        super();\n        this.widget = widget;\n        this.length = length;\n        this.type = type;\n        this.breakAfter = 0;\n        this.prevWidget = null;\n    }\n    merge(from, to, source, _takeDeco, openStart, openEnd) {\n        if (source && (!(source instanceof BlockWidgetView) || !this.widget.compare(source.widget) ||\n            from > 0 && openStart <= 0 || to < this.length && openEnd <= 0))\n            return false;\n        this.length = from + (source ? source.length : 0) + (this.length - to);\n        return true;\n    }\n    domAtPos(pos) {\n        return pos == 0 ? DOMPos.before(this.dom) : DOMPos.after(this.dom, pos == this.length);\n    }\n    split(at) {\n        let len = this.length - at;\n        this.length = at;\n        let end = new BlockWidgetView(this.widget, len, this.type);\n        end.breakAfter = this.breakAfter;\n        return end;\n    }\n    get children() { return noChildren; }\n    sync(view) {\n        if (!this.dom || !this.widget.updateDOM(this.dom, view)) {\n            if (this.dom && this.prevWidget)\n                this.prevWidget.destroy(this.dom);\n            this.prevWidget = null;\n            this.setDOM(this.widget.toDOM(view));\n            this.dom.contentEditable = \"false\";\n        }\n    }\n    get overrideDOMText() {\n        return this.parent ? this.parent.view.state.doc.slice(this.posAtStart, this.posAtEnd) : Text.empty;\n    }\n    domBoundsAround() { return null; }\n    become(other) {\n        if (other instanceof BlockWidgetView &&\n            other.widget.constructor == this.widget.constructor) {\n            if (!other.widget.compare(this.widget))\n                this.markDirty(true);\n            if (this.dom && !this.prevWidget)\n                this.prevWidget = this.widget;\n            this.widget = other.widget;\n            this.length = other.length;\n            this.type = other.type;\n            this.breakAfter = other.breakAfter;\n            return true;\n        }\n        return false;\n    }\n    ignoreMutation() { return true; }\n    ignoreEvent(event) { return this.widget.ignoreEvent(event); }\n    get isEditable() { return false; }\n    get isWidget() { return true; }\n    coordsAt(pos, side) {\n        return this.widget.coordsAt(this.dom, pos, side);\n    }\n    destroy() {\n        super.destroy();\n        if (this.dom)\n            this.widget.destroy(this.dom);\n    }\n}\n\nclass ContentBuilder {\n    constructor(doc, pos, end, disallowBlockEffectsFor) {\n        this.doc = doc;\n        this.pos = pos;\n        this.end = end;\n        this.disallowBlockEffectsFor = disallowBlockEffectsFor;\n        this.content = [];\n        this.curLine = null;\n        this.breakAtStart = 0;\n        this.pendingBuffer = 0 /* No */;\n        this.bufferMarks = [];\n        // Set to false directly after a widget that covers the position after it\n        this.atCursorPos = true;\n        this.openStart = -1;\n        this.openEnd = -1;\n        this.text = \"\";\n        this.textOff = 0;\n        this.cursor = doc.iter();\n        this.skip = pos;\n    }\n    posCovered() {\n        if (this.content.length == 0)\n            return !this.breakAtStart && this.doc.lineAt(this.pos).from != this.pos;\n        let last = this.content[this.content.length - 1];\n        return !last.breakAfter && !(last instanceof BlockWidgetView && last.type == BlockType.WidgetBefore);\n    }\n    getLine() {\n        if (!this.curLine) {\n            this.content.push(this.curLine = new LineView);\n            this.atCursorPos = true;\n        }\n        return this.curLine;\n    }\n    flushBuffer(active = this.bufferMarks) {\n        if (this.pendingBuffer) {\n            this.curLine.append(wrapMarks(new WidgetBufferView(-1), active), active.length);\n            this.pendingBuffer = 0 /* No */;\n        }\n    }\n    addBlockWidget(view) {\n        this.flushBuffer();\n        this.curLine = null;\n        this.content.push(view);\n    }\n    finish(openEnd) {\n        if (this.pendingBuffer && openEnd <= this.bufferMarks.length)\n            this.flushBuffer();\n        else\n            this.pendingBuffer = 0 /* No */;\n        if (!this.posCovered())\n            this.getLine();\n    }\n    buildText(length, active, openStart) {\n        while (length > 0) {\n            if (this.textOff == this.text.length) {\n                let { value, lineBreak, done } = this.cursor.next(this.skip);\n                this.skip = 0;\n                if (done)\n                    throw new Error(\"Ran out of text content when drawing inline views\");\n                if (lineBreak) {\n                    if (!this.posCovered())\n                        this.getLine();\n                    if (this.content.length)\n                        this.content[this.content.length - 1].breakAfter = 1;\n                    else\n                        this.breakAtStart = 1;\n                    this.flushBuffer();\n                    this.curLine = null;\n                    this.atCursorPos = true;\n                    length--;\n                    continue;\n                }\n                else {\n                    this.text = value;\n                    this.textOff = 0;\n                }\n            }\n            let take = Math.min(this.text.length - this.textOff, length, 512 /* Chunk */);\n            this.flushBuffer(active.slice(active.length - openStart));\n            this.getLine().append(wrapMarks(new TextView(this.text.slice(this.textOff, this.textOff + take)), active), openStart);\n            this.atCursorPos = true;\n            this.textOff += take;\n            length -= take;\n            openStart = 0;\n        }\n    }\n    span(from, to, active, openStart) {\n        this.buildText(to - from, active, openStart);\n        this.pos = to;\n        if (this.openStart < 0)\n            this.openStart = openStart;\n    }\n    point(from, to, deco, active, openStart, index) {\n        if (this.disallowBlockEffectsFor[index] && deco instanceof PointDecoration) {\n            if (deco.block)\n                throw new RangeError(\"Block decorations may not be specified via plugins\");\n            if (to > this.doc.lineAt(this.pos).to)\n                throw new RangeError(\"Decorations that replace line breaks may not be specified via plugins\");\n        }\n        let len = to - from;\n        if (deco instanceof PointDecoration) {\n            if (deco.block) {\n                let { type } = deco;\n                if (type == BlockType.WidgetAfter && !this.posCovered())\n                    this.getLine();\n                this.addBlockWidget(new BlockWidgetView(deco.widget || new NullWidget(\"div\"), len, type));\n            }\n            else {\n                let view = WidgetView.create(deco.widget || new NullWidget(\"span\"), len, len ? 0 : deco.startSide);\n                let cursorBefore = this.atCursorPos && !view.isEditable && openStart <= active.length &&\n                    (from < to || deco.startSide > 0);\n                let cursorAfter = !view.isEditable && (from < to || openStart > active.length || deco.startSide <= 0);\n                let line = this.getLine();\n                if (this.pendingBuffer == 2 /* IfCursor */ && !cursorBefore && !view.isEditable)\n                    this.pendingBuffer = 0 /* No */;\n                this.flushBuffer(active);\n                if (cursorBefore) {\n                    line.append(wrapMarks(new WidgetBufferView(1), active), openStart);\n                    openStart = active.length + Math.max(0, openStart - active.length);\n                }\n                line.append(wrapMarks(view, active), openStart);\n                this.atCursorPos = cursorAfter;\n                this.pendingBuffer = !cursorAfter ? 0 /* No */ : from < to || openStart > active.length ? 1 /* Yes */ : 2 /* IfCursor */;\n                if (this.pendingBuffer)\n                    this.bufferMarks = active.slice();\n            }\n        }\n        else if (this.doc.lineAt(this.pos).from == this.pos) { // Line decoration\n            this.getLine().addLineDeco(deco);\n        }\n        if (len) {\n            // Advance the iterator past the replaced content\n            if (this.textOff + len <= this.text.length) {\n                this.textOff += len;\n            }\n            else {\n                this.skip += len - (this.text.length - this.textOff);\n                this.text = \"\";\n                this.textOff = 0;\n            }\n            this.pos = to;\n        }\n        if (this.openStart < 0)\n            this.openStart = openStart;\n    }\n    static build(text, from, to, decorations, dynamicDecorationMap) {\n        let builder = new ContentBuilder(text, from, to, dynamicDecorationMap);\n        builder.openEnd = RangeSet.spans(decorations, from, to, builder);\n        if (builder.openStart < 0)\n            builder.openStart = builder.openEnd;\n        builder.finish(builder.openEnd);\n        return builder;\n    }\n}\nfunction wrapMarks(view, active) {\n    for (let mark of active)\n        view = new MarkView(mark, [view], view.length);\n    return view;\n}\nclass NullWidget extends WidgetType {\n    constructor(tag) {\n        super();\n        this.tag = tag;\n    }\n    eq(other) { return other.tag == this.tag; }\n    toDOM() { return document.createElement(this.tag); }\n    updateDOM(elt) { return elt.nodeName.toLowerCase() == this.tag; }\n    get isHidden() { return true; }\n}\n\nconst clickAddsSelectionRange = /*@__PURE__*/Facet.define();\nconst dragMovesSelection$1 = /*@__PURE__*/Facet.define();\nconst mouseSelectionStyle = /*@__PURE__*/Facet.define();\nconst exceptionSink = /*@__PURE__*/Facet.define();\nconst updateListener = /*@__PURE__*/Facet.define();\nconst inputHandler = /*@__PURE__*/Facet.define();\nconst focusChangeEffect = /*@__PURE__*/Facet.define();\nconst perLineTextDirection = /*@__PURE__*/Facet.define({\n    combine: values => values.some(x => x)\n});\nconst nativeSelectionHidden = /*@__PURE__*/Facet.define({\n    combine: values => values.some(x => x)\n});\nclass ScrollTarget {\n    constructor(range, y = \"nearest\", x = \"nearest\", yMargin = 5, xMargin = 5) {\n        this.range = range;\n        this.y = y;\n        this.x = x;\n        this.yMargin = yMargin;\n        this.xMargin = xMargin;\n    }\n    map(changes) {\n        return changes.empty ? this : new ScrollTarget(this.range.map(changes), this.y, this.x, this.yMargin, this.xMargin);\n    }\n}\nconst scrollIntoView = /*@__PURE__*/StateEffect.define({ map: (t, ch) => t.map(ch) });\n/**\nLog or report an unhandled exception in client code. Should\nprobably only be used by extension code that allows client code to\nprovide functions, and calls those functions in a context where an\nexception can't be propagated to calling code in a reasonable way\n(for example when in an event handler).\n\nEither calls a handler registered with\n[`EditorView.exceptionSink`](https://codemirror.net/6/docs/ref/#view.EditorView^exceptionSink),\n`window.onerror`, if defined, or `console.error` (in which case\nit'll pass `context`, when given, as first argument).\n*/\nfunction logException(state, exception, context) {\n    let handler = state.facet(exceptionSink);\n    if (handler.length)\n        handler[0](exception);\n    else if (window.onerror)\n        window.onerror(String(exception), context, undefined, undefined, exception);\n    else if (context)\n        console.error(context + \":\", exception);\n    else\n        console.error(exception);\n}\nconst editable = /*@__PURE__*/Facet.define({ combine: values => values.length ? values[0] : true });\nlet nextPluginID = 0;\nconst viewPlugin = /*@__PURE__*/Facet.define();\n/**\nView plugins associate stateful values with a view. They can\ninfluence the way the content is drawn, and are notified of things\nthat happen in the view.\n*/\nclass ViewPlugin {\n    constructor(\n    /**\n    @internal\n    */\n    id, \n    /**\n    @internal\n    */\n    create, \n    /**\n    @internal\n    */\n    domEventHandlers, buildExtensions) {\n        this.id = id;\n        this.create = create;\n        this.domEventHandlers = domEventHandlers;\n        this.extension = buildExtensions(this);\n    }\n    /**\n    Define a plugin from a constructor function that creates the\n    plugin's value, given an editor view.\n    */\n    static define(create, spec) {\n        const { eventHandlers, provide, decorations: deco } = spec || {};\n        return new ViewPlugin(nextPluginID++, create, eventHandlers, plugin => {\n            let ext = [viewPlugin.of(plugin)];\n            if (deco)\n                ext.push(decorations.of(view => {\n                    let pluginInst = view.plugin(plugin);\n                    return pluginInst ? deco(pluginInst) : Decoration.none;\n                }));\n            if (provide)\n                ext.push(provide(plugin));\n            return ext;\n        });\n    }\n    /**\n    Create a plugin for a class whose constructor takes a single\n    editor view as argument.\n    */\n    static fromClass(cls, spec) {\n        return ViewPlugin.define(view => new cls(view), spec);\n    }\n}\nclass PluginInstance {\n    constructor(spec) {\n        this.spec = spec;\n        // When starting an update, all plugins have this field set to the\n        // update object, indicating they need to be updated. When finished\n        // updating, it is set to `false`. Retrieving a plugin that needs to\n        // be updated with `view.plugin` forces an eager update.\n        this.mustUpdate = null;\n        // This is null when the plugin is initially created, but\n        // initialized on the first update.\n        this.value = null;\n    }\n    update(view) {\n        if (!this.value) {\n            if (this.spec) {\n                try {\n                    this.value = this.spec.create(view);\n                }\n                catch (e) {\n                    logException(view.state, e, \"CodeMirror plugin crashed\");\n                    this.deactivate();\n                }\n            }\n        }\n        else if (this.mustUpdate) {\n            let update = this.mustUpdate;\n            this.mustUpdate = null;\n            if (this.value.update) {\n                try {\n                    this.value.update(update);\n                }\n                catch (e) {\n                    logException(update.state, e, \"CodeMirror plugin crashed\");\n                    if (this.value.destroy)\n                        try {\n                            this.value.destroy();\n                        }\n                        catch (_) { }\n                    this.deactivate();\n                }\n            }\n        }\n        return this;\n    }\n    destroy(view) {\n        var _a;\n        if ((_a = this.value) === null || _a === void 0 ? void 0 : _a.destroy) {\n            try {\n                this.value.destroy();\n            }\n            catch (e) {\n                logException(view.state, e, \"CodeMirror plugin crashed\");\n            }\n        }\n    }\n    deactivate() {\n        this.spec = this.value = null;\n    }\n}\nconst editorAttributes = /*@__PURE__*/Facet.define();\nconst contentAttributes = /*@__PURE__*/Facet.define();\n// Provide decorations\nconst decorations = /*@__PURE__*/Facet.define();\nconst atomicRanges = /*@__PURE__*/Facet.define();\nconst scrollMargins = /*@__PURE__*/Facet.define();\nfunction getScrollMargins(view) {\n    let left = 0, right = 0, top = 0, bottom = 0;\n    for (let source of view.state.facet(scrollMargins)) {\n        let m = source(view);\n        if (m) {\n            if (m.left != null)\n                left = Math.max(left, m.left);\n            if (m.right != null)\n                right = Math.max(right, m.right);\n            if (m.top != null)\n                top = Math.max(top, m.top);\n            if (m.bottom != null)\n                bottom = Math.max(bottom, m.bottom);\n        }\n    }\n    return { left, right, top, bottom };\n}\nconst styleModule = /*@__PURE__*/Facet.define();\nclass ChangedRange {\n    constructor(fromA, toA, fromB, toB) {\n        this.fromA = fromA;\n        this.toA = toA;\n        this.fromB = fromB;\n        this.toB = toB;\n    }\n    join(other) {\n        return new ChangedRange(Math.min(this.fromA, other.fromA), Math.max(this.toA, other.toA), Math.min(this.fromB, other.fromB), Math.max(this.toB, other.toB));\n    }\n    addToSet(set) {\n        let i = set.length, me = this;\n        for (; i > 0; i--) {\n            let range = set[i - 1];\n            if (range.fromA > me.toA)\n                continue;\n            if (range.toA < me.fromA)\n                break;\n            me = me.join(range);\n            set.splice(i - 1, 1);\n        }\n        set.splice(i, 0, me);\n        return set;\n    }\n    static extendWithRanges(diff, ranges) {\n        if (ranges.length == 0)\n            return diff;\n        let result = [];\n        for (let dI = 0, rI = 0, posA = 0, posB = 0;; dI++) {\n            let next = dI == diff.length ? null : diff[dI], off = posA - posB;\n            let end = next ? next.fromB : 1e9;\n            while (rI < ranges.length && ranges[rI] < end) {\n                let from = ranges[rI], to = ranges[rI + 1];\n                let fromB = Math.max(posB, from), toB = Math.min(end, to);\n                if (fromB <= toB)\n                    new ChangedRange(fromB + off, toB + off, fromB, toB).addToSet(result);\n                if (to > end)\n                    break;\n                else\n                    rI += 2;\n            }\n            if (!next)\n                return result;\n            new ChangedRange(next.fromA, next.toA, next.fromB, next.toB).addToSet(result);\n            posA = next.toA;\n            posB = next.toB;\n        }\n    }\n}\n/**\nView [plugins](https://codemirror.net/6/docs/ref/#view.ViewPlugin) are given instances of this\nclass, which describe what happened, whenever the view is updated.\n*/\nclass ViewUpdate {\n    constructor(\n    /**\n    The editor view that the update is associated with.\n    */\n    view, \n    /**\n    The new editor state.\n    */\n    state, \n    /**\n    The transactions involved in the update. May be empty.\n    */\n    transactions) {\n        this.view = view;\n        this.state = state;\n        this.transactions = transactions;\n        /**\n        @internal\n        */\n        this.flags = 0;\n        this.startState = view.state;\n        this.changes = ChangeSet.empty(this.startState.doc.length);\n        for (let tr of transactions)\n            this.changes = this.changes.compose(tr.changes);\n        let changedRanges = [];\n        this.changes.iterChangedRanges((fromA, toA, fromB, toB) => changedRanges.push(new ChangedRange(fromA, toA, fromB, toB)));\n        this.changedRanges = changedRanges;\n    }\n    /**\n    @internal\n    */\n    static create(view, state, transactions) {\n        return new ViewUpdate(view, state, transactions);\n    }\n    /**\n    Tells you whether the [viewport](https://codemirror.net/6/docs/ref/#view.EditorView.viewport) or\n    [visible ranges](https://codemirror.net/6/docs/ref/#view.EditorView.visibleRanges) changed in this\n    update.\n    */\n    get viewportChanged() {\n        return (this.flags & 4 /* Viewport */) > 0;\n    }\n    /**\n    Indicates whether the height of a block element in the editor\n    changed in this update.\n    */\n    get heightChanged() {\n        return (this.flags & 2 /* Height */) > 0;\n    }\n    /**\n    Returns true when the document was modified or the size of the\n    editor, or elements within the editor, changed.\n    */\n    get geometryChanged() {\n        return this.docChanged || (this.flags & (8 /* Geometry */ | 2 /* Height */)) > 0;\n    }\n    /**\n    True when this update indicates a focus change.\n    */\n    get focusChanged() {\n        return (this.flags & 1 /* Focus */) > 0;\n    }\n    /**\n    Whether the document changed in this update.\n    */\n    get docChanged() {\n        return !this.changes.empty;\n    }\n    /**\n    Whether the selection was explicitly set in this update.\n    */\n    get selectionSet() {\n        return this.transactions.some(tr => tr.selection);\n    }\n    /**\n    @internal\n    */\n    get empty() { return this.flags == 0 && this.transactions.length == 0; }\n}\n\n/**\nUsed to indicate [text direction](https://codemirror.net/6/docs/ref/#view.EditorView.textDirection).\n*/\nvar Direction = /*@__PURE__*/(function (Direction) {\n    // (These are chosen to match the base levels, in bidi algorithm\n    // terms, of spans in that direction.)\n    /**\n    Left-to-right.\n    */\n    Direction[Direction[\"LTR\"] = 0] = \"LTR\";\n    /**\n    Right-to-left.\n    */\n    Direction[Direction[\"RTL\"] = 1] = \"RTL\";\nreturn Direction})(Direction || (Direction = {}));\nconst LTR = Direction.LTR, RTL = Direction.RTL;\n// Decode a string with each type encoded as log2(type)\nfunction dec(str) {\n    let result = [];\n    for (let i = 0; i < str.length; i++)\n        result.push(1 << +str[i]);\n    return result;\n}\n// Character types for codepoints 0 to 0xf8\nconst LowTypes = /*@__PURE__*/dec(\"88888888888888888888888888888888888666888888787833333333337888888000000000000000000000000008888880000000000000000000000000088888888888888888888888888888888888887866668888088888663380888308888800000000000000000000000800000000000000000000000000000008\");\n// Character types for codepoints 0x600 to 0x6f9\nconst ArabicTypes = /*@__PURE__*/dec(\"4444448826627288999999999992222222222222222222222222222222222222222222222229999999999999999999994444444444644222822222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222999999949999999229989999223333333333\");\nconst Brackets = /*@__PURE__*/Object.create(null), BracketStack = [];\n// There's a lot more in\n// https://www.unicode.org/Public/UCD/latest/ucd/BidiBrackets.txt,\n// which are left out to keep code size down.\nfor (let p of [\"()\", \"[]\", \"{}\"]) {\n    let l = /*@__PURE__*/p.charCodeAt(0), r = /*@__PURE__*/p.charCodeAt(1);\n    Brackets[l] = r;\n    Brackets[r] = -l;\n}\nfunction charType(ch) {\n    return ch <= 0xf7 ? LowTypes[ch] :\n        0x590 <= ch && ch <= 0x5f4 ? 2 /* R */ :\n            0x600 <= ch && ch <= 0x6f9 ? ArabicTypes[ch - 0x600] :\n                0x6ee <= ch && ch <= 0x8ac ? 4 /* AL */ :\n                    0x2000 <= ch && ch <= 0x200b ? 256 /* NI */ :\n                        0xfb50 <= ch && ch <= 0xfdff ? 4 /* AL */ :\n                            ch == 0x200c ? 256 /* NI */ : 1 /* L */;\n}\nconst BidiRE = /[\\u0590-\\u05f4\\u0600-\\u06ff\\u0700-\\u08ac\\ufb50-\\ufdff]/;\n/**\nRepresents a contiguous range of text that has a single direction\n(as in left-to-right or right-to-left).\n*/\nclass BidiSpan {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    The start of the span (relative to the start of the line).\n    */\n    from, \n    /**\n    The end of the span.\n    */\n    to, \n    /**\n    The [\"bidi\n    level\"](https://unicode.org/reports/tr9/#Basic_Display_Algorithm)\n    of the span (in this context, 0 means\n    left-to-right, 1 means right-to-left, 2 means left-to-right\n    number inside right-to-left text).\n    */\n    level) {\n        this.from = from;\n        this.to = to;\n        this.level = level;\n    }\n    /**\n    The direction of this span.\n    */\n    get dir() { return this.level % 2 ? RTL : LTR; }\n    /**\n    @internal\n    */\n    side(end, dir) { return (this.dir == dir) == end ? this.to : this.from; }\n    /**\n    @internal\n    */\n    static find(order, index, level, assoc) {\n        let maybe = -1;\n        for (let i = 0; i < order.length; i++) {\n            let span = order[i];\n            if (span.from <= index && span.to >= index) {\n                if (span.level == level)\n                    return i;\n                // When multiple spans match, if assoc != 0, take the one that\n                // covers that side, otherwise take the one with the minimum\n                // level.\n                if (maybe < 0 || (assoc != 0 ? (assoc < 0 ? span.from < index : span.to > index) : order[maybe].level > span.level))\n                    maybe = i;\n            }\n        }\n        if (maybe < 0)\n            throw new RangeError(\"Index out of range\");\n        return maybe;\n    }\n}\n// Reused array of character types\nconst types = [];\nfunction computeOrder(line, direction) {\n    let len = line.length, outerType = direction == LTR ? 1 /* L */ : 2 /* R */, oppositeType = direction == LTR ? 2 /* R */ : 1 /* L */;\n    if (!line || outerType == 1 /* L */ && !BidiRE.test(line))\n        return trivialOrder(len);\n    // W1. Examine each non-spacing mark (NSM) in the level run, and\n    // change the type of the NSM to the type of the previous\n    // character. If the NSM is at the start of the level run, it will\n    // get the type of sor.\n    // W2. Search backwards from each instance of a European number\n    // until the first strong type (R, L, AL, or sor) is found. If an\n    // AL is found, change the type of the European number to Arabic\n    // number.\n    // W3. Change all ALs to R.\n    // (Left after this: L, R, EN, AN, ET, CS, NI)\n    for (let i = 0, prev = outerType, prevStrong = outerType; i < len; i++) {\n        let type = charType(line.charCodeAt(i));\n        if (type == 512 /* NSM */)\n            type = prev;\n        else if (type == 8 /* EN */ && prevStrong == 4 /* AL */)\n            type = 16 /* AN */;\n        types[i] = type == 4 /* AL */ ? 2 /* R */ : type;\n        if (type & 7 /* Strong */)\n            prevStrong = type;\n        prev = type;\n    }\n    // W5. A sequence of European terminators adjacent to European\n    // numbers changes to all European numbers.\n    // W6. Otherwise, separators and terminators change to Other\n    // Neutral.\n    // W7. Search backwards from each instance of a European number\n    // until the first strong type (R, L, or sor) is found. If an L is\n    // found, then change the type of the European number to L.\n    // (Left after this: L, R, EN+AN, NI)\n    for (let i = 0, prev = outerType, prevStrong = outerType; i < len; i++) {\n        let type = types[i];\n        if (type == 128 /* CS */) {\n            if (i < len - 1 && prev == types[i + 1] && (prev & 24 /* Num */))\n                type = types[i] = prev;\n            else\n                types[i] = 256 /* NI */;\n        }\n        else if (type == 64 /* ET */) {\n            let end = i + 1;\n            while (end < len && types[end] == 64 /* ET */)\n                end++;\n            let replace = (i && prev == 8 /* EN */) || (end < len && types[end] == 8 /* EN */) ? (prevStrong == 1 /* L */ ? 1 /* L */ : 8 /* EN */) : 256 /* NI */;\n            for (let j = i; j < end; j++)\n                types[j] = replace;\n            i = end - 1;\n        }\n        else if (type == 8 /* EN */ && prevStrong == 1 /* L */) {\n            types[i] = 1 /* L */;\n        }\n        prev = type;\n        if (type & 7 /* Strong */)\n            prevStrong = type;\n    }\n    // N0. Process bracket pairs in an isolating run sequence\n    // sequentially in the logical order of the text positions of the\n    // opening paired brackets using the logic given below. Within this\n    // scope, bidirectional types EN and AN are treated as R.\n    for (let i = 0, sI = 0, context = 0, ch, br, type; i < len; i++) {\n        // Keeps [startIndex, type, strongSeen] triples for each open\n        // bracket on BracketStack.\n        if (br = Brackets[ch = line.charCodeAt(i)]) {\n            if (br < 0) { // Closing bracket\n                for (let sJ = sI - 3; sJ >= 0; sJ -= 3) {\n                    if (BracketStack[sJ + 1] == -br) {\n                        let flags = BracketStack[sJ + 2];\n                        let type = (flags & 2 /* EmbedInside */) ? outerType :\n                            !(flags & 4 /* OppositeInside */) ? 0 :\n                                (flags & 1 /* OppositeBefore */) ? oppositeType : outerType;\n                        if (type)\n                            types[i] = types[BracketStack[sJ]] = type;\n                        sI = sJ;\n                        break;\n                    }\n                }\n            }\n            else if (BracketStack.length == 189 /* MaxDepth */) {\n                break;\n            }\n            else {\n                BracketStack[sI++] = i;\n                BracketStack[sI++] = ch;\n                BracketStack[sI++] = context;\n            }\n        }\n        else if ((type = types[i]) == 2 /* R */ || type == 1 /* L */) {\n            let embed = type == outerType;\n            context = embed ? 0 : 1 /* OppositeBefore */;\n            for (let sJ = sI - 3; sJ >= 0; sJ -= 3) {\n                let cur = BracketStack[sJ + 2];\n                if (cur & 2 /* EmbedInside */)\n                    break;\n                if (embed) {\n                    BracketStack[sJ + 2] |= 2 /* EmbedInside */;\n                }\n                else {\n                    if (cur & 4 /* OppositeInside */)\n                        break;\n                    BracketStack[sJ + 2] |= 4 /* OppositeInside */;\n                }\n            }\n        }\n    }\n    // N1. A sequence of neutrals takes the direction of the\n    // surrounding strong text if the text on both sides has the same\n    // direction. European and Arabic numbers act as if they were R in\n    // terms of their influence on neutrals. Start-of-level-run (sor)\n    // and end-of-level-run (eor) are used at level run boundaries.\n    // N2. Any remaining neutrals take the embedding direction.\n    // (Left after this: L, R, EN+AN)\n    for (let i = 0; i < len; i++) {\n        if (types[i] == 256 /* NI */) {\n            let end = i + 1;\n            while (end < len && types[end] == 256 /* NI */)\n                end++;\n            let beforeL = (i ? types[i - 1] : outerType) == 1 /* L */;\n            let afterL = (end < len ? types[end] : outerType) == 1 /* L */;\n            let replace = beforeL == afterL ? (beforeL ? 1 /* L */ : 2 /* R */) : outerType;\n            for (let j = i; j < end; j++)\n                types[j] = replace;\n            i = end - 1;\n        }\n    }\n    // Here we depart from the documented algorithm, in order to avoid\n    // building up an actual levels array. Since there are only three\n    // levels (0, 1, 2) in an implementation that doesn't take\n    // explicit embedding into account, we can build up the order on\n    // the fly, without following the level-based algorithm.\n    let order = [];\n    if (outerType == 1 /* L */) {\n        for (let i = 0; i < len;) {\n            let start = i, rtl = types[i++] != 1 /* L */;\n            while (i < len && rtl == (types[i] != 1 /* L */))\n                i++;\n            if (rtl) {\n                for (let j = i; j > start;) {\n                    let end = j, l = types[--j] != 2 /* R */;\n                    while (j > start && l == (types[j - 1] != 2 /* R */))\n                        j--;\n                    order.push(new BidiSpan(j, end, l ? 2 : 1));\n                }\n            }\n            else {\n                order.push(new BidiSpan(start, i, 0));\n            }\n        }\n    }\n    else {\n        for (let i = 0; i < len;) {\n            let start = i, rtl = types[i++] == 2 /* R */;\n            while (i < len && rtl == (types[i] == 2 /* R */))\n                i++;\n            order.push(new BidiSpan(start, i, rtl ? 1 : 2));\n        }\n    }\n    return order;\n}\nfunction trivialOrder(length) {\n    return [new BidiSpan(0, length, 0)];\n}\nlet movedOver = \"\";\nfunction moveVisually(line, order, dir, start, forward) {\n    var _a;\n    let startIndex = start.head - line.from, spanI = -1;\n    if (startIndex == 0) {\n        if (!forward || !line.length)\n            return null;\n        if (order[0].level != dir) {\n            startIndex = order[0].side(false, dir);\n            spanI = 0;\n        }\n    }\n    else if (startIndex == line.length) {\n        if (forward)\n            return null;\n        let last = order[order.length - 1];\n        if (last.level != dir) {\n            startIndex = last.side(true, dir);\n            spanI = order.length - 1;\n        }\n    }\n    if (spanI < 0)\n        spanI = BidiSpan.find(order, startIndex, (_a = start.bidiLevel) !== null && _a !== void 0 ? _a : -1, start.assoc);\n    let span = order[spanI];\n    // End of span. (But not end of line--that was checked for above.)\n    if (startIndex == span.side(forward, dir)) {\n        span = order[spanI += forward ? 1 : -1];\n        startIndex = span.side(!forward, dir);\n    }\n    let indexForward = forward == (span.dir == dir);\n    let nextIndex = findClusterBreak(line.text, startIndex, indexForward);\n    movedOver = line.text.slice(Math.min(startIndex, nextIndex), Math.max(startIndex, nextIndex));\n    if (nextIndex != span.side(forward, dir))\n        return EditorSelection.cursor(nextIndex + line.from, indexForward ? -1 : 1, span.level);\n    let nextSpan = spanI == (forward ? order.length - 1 : 0) ? null : order[spanI + (forward ? 1 : -1)];\n    if (!nextSpan && span.level != dir)\n        return EditorSelection.cursor(forward ? line.to : line.from, forward ? -1 : 1, dir);\n    if (nextSpan && nextSpan.level < span.level)\n        return EditorSelection.cursor(nextSpan.side(!forward, dir) + line.from, forward ? 1 : -1, nextSpan.level);\n    return EditorSelection.cursor(nextIndex + line.from, forward ? -1 : 1, span.level);\n}\n\nconst LineBreakPlaceholder = \"\\uffff\";\nclass DOMReader {\n    constructor(points, state) {\n        this.points = points;\n        this.text = \"\";\n        this.lineSeparator = state.facet(EditorState.lineSeparator);\n    }\n    append(text) {\n        this.text += text;\n    }\n    lineBreak() {\n        this.text += LineBreakPlaceholder;\n    }\n    readRange(start, end) {\n        if (!start)\n            return this;\n        let parent = start.parentNode;\n        for (let cur = start;;) {\n            this.findPointBefore(parent, cur);\n            let oldLen = this.text.length;\n            this.readNode(cur);\n            let next = cur.nextSibling;\n            if (next == end)\n                break;\n            let view = ContentView.get(cur), nextView = ContentView.get(next);\n            if (view && nextView ? view.breakAfter :\n                (view ? view.breakAfter : isBlockElement(cur)) ||\n                    (isBlockElement(next) && (cur.nodeName != \"BR\" || cur.cmIgnore) && this.text.length > oldLen))\n                this.lineBreak();\n            cur = next;\n        }\n        this.findPointBefore(parent, end);\n        return this;\n    }\n    readTextNode(node) {\n        let text = node.nodeValue;\n        for (let point of this.points)\n            if (point.node == node)\n                point.pos = this.text.length + Math.min(point.offset, text.length);\n        for (let off = 0, re = this.lineSeparator ? null : /\\r\\n?|\\n/g;;) {\n            let nextBreak = -1, breakSize = 1, m;\n            if (this.lineSeparator) {\n                nextBreak = text.indexOf(this.lineSeparator, off);\n                breakSize = this.lineSeparator.length;\n            }\n            else if (m = re.exec(text)) {\n                nextBreak = m.index;\n                breakSize = m[0].length;\n            }\n            this.append(text.slice(off, nextBreak < 0 ? text.length : nextBreak));\n            if (nextBreak < 0)\n                break;\n            this.lineBreak();\n            if (breakSize > 1)\n                for (let point of this.points)\n                    if (point.node == node && point.pos > this.text.length)\n                        point.pos -= breakSize - 1;\n            off = nextBreak + breakSize;\n        }\n    }\n    readNode(node) {\n        if (node.cmIgnore)\n            return;\n        let view = ContentView.get(node);\n        let fromView = view && view.overrideDOMText;\n        if (fromView != null) {\n            this.findPointInside(node, fromView.length);\n            for (let i = fromView.iter(); !i.next().done;) {\n                if (i.lineBreak)\n                    this.lineBreak();\n                else\n                    this.append(i.value);\n            }\n        }\n        else if (node.nodeType == 3) {\n            this.readTextNode(node);\n        }\n        else if (node.nodeName == \"BR\") {\n            if (node.nextSibling)\n                this.lineBreak();\n        }\n        else if (node.nodeType == 1) {\n            this.readRange(node.firstChild, null);\n        }\n    }\n    findPointBefore(node, next) {\n        for (let point of this.points)\n            if (point.node == node && node.childNodes[point.offset] == next)\n                point.pos = this.text.length;\n    }\n    findPointInside(node, maxLen) {\n        for (let point of this.points)\n            if (node.nodeType == 3 ? point.node == node : node.contains(point.node))\n                point.pos = this.text.length + Math.min(maxLen, point.offset);\n    }\n}\nfunction isBlockElement(node) {\n    return node.nodeType == 1 && /^(DIV|P|LI|UL|OL|BLOCKQUOTE|DD|DT|H\\d|SECTION|PRE)$/.test(node.nodeName);\n}\nclass DOMPoint {\n    constructor(node, offset) {\n        this.node = node;\n        this.offset = offset;\n        this.pos = -1;\n    }\n}\n\nclass DocView extends ContentView {\n    constructor(view) {\n        super();\n        this.view = view;\n        this.compositionDeco = Decoration.none;\n        this.compositionNode = null;\n        this.decorations = [];\n        this.dynamicDecorationMap = [];\n        // Track a minimum width for the editor. When measuring sizes in\n        // measureVisibleLineHeights, this is updated to point at the width\n        // of a given element and its extent in the document. When a change\n        // happens in that range, these are reset. That way, once we've seen\n        // a line/element of a given length, we keep the editor wide enough\n        // to fit at least that element, until it is changed, at which point\n        // we forget it again.\n        this.minWidth = 0;\n        this.minWidthFrom = 0;\n        this.minWidthTo = 0;\n        // Track whether the DOM selection was set in a lossy way, so that\n        // we don't mess it up when reading it back it\n        this.impreciseAnchor = null;\n        this.impreciseHead = null;\n        this.forceSelection = false;\n        // Used by the resize observer to ignore resizes that we caused\n        // ourselves\n        this.lastUpdate = Date.now();\n        this.setDOM(view.contentDOM);\n        this.children = [new LineView];\n        this.children[0].setParent(this);\n        this.updateDeco();\n        this.updateInner([new ChangedRange(0, 0, 0, view.state.doc.length)], 0);\n    }\n    get length() { return this.view.state.doc.length; }\n    // Update the document view to a given state.\n    update(update) {\n        let changedRanges = update.changedRanges;\n        if (this.minWidth > 0 && changedRanges.length) {\n            if (!changedRanges.every(({ fromA, toA }) => toA < this.minWidthFrom || fromA > this.minWidthTo)) {\n                this.minWidth = this.minWidthFrom = this.minWidthTo = 0;\n            }\n            else {\n                this.minWidthFrom = update.changes.mapPos(this.minWidthFrom, 1);\n                this.minWidthTo = update.changes.mapPos(this.minWidthTo, 1);\n            }\n        }\n        ({ deco: this.compositionDeco, node: this.compositionNode } =\n            this.view.inputState.composing < 0 ? noComp : computeCompositionDeco(this.view, update.changes));\n        // When the DOM nodes around the selection are moved to another\n        // parent, Chrome sometimes reports a different selection through\n        // getSelection than the one that it actually shows to the user.\n        // This forces a selection update when lines are joined to work\n        // around that. Issue #54\n        if ((browser.ie || browser.chrome) && !this.compositionDeco.size && update &&\n            update.state.doc.lines != update.startState.doc.lines)\n            this.forceSelection = true;\n        let prevDeco = this.decorations, deco = this.updateDeco();\n        let decoDiff = findChangedDeco(prevDeco, deco, update.changes);\n        changedRanges = ChangedRange.extendWithRanges(changedRanges, decoDiff);\n        if (this.dirty == 0 /* Not */ && changedRanges.length == 0) {\n            return false;\n        }\n        else {\n            this.updateInner(changedRanges, update.startState.doc.length);\n            if (update.transactions.length)\n                this.lastUpdate = Date.now();\n            return true;\n        }\n    }\n    // Used by update and the constructor do perform the actual DOM\n    // update\n    updateInner(changes, oldLength) {\n        this.view.viewState.mustMeasureContent = true;\n        this.updateChildren(changes, oldLength);\n        let { observer } = this.view;\n        observer.ignore(() => {\n            // Lock the height during redrawing, since Chrome sometimes\n            // messes with the scroll position during DOM mutation (though\n            // no relayout is triggered and I cannot imagine how it can\n            // recompute the scroll position without a layout)\n            this.dom.style.height = this.view.viewState.contentHeight + \"px\";\n            this.dom.style.flexBasis = this.minWidth ? this.minWidth + \"px\" : \"\";\n            // Chrome will sometimes, when DOM mutations occur directly\n            // around the selection, get confused and report a different\n            // selection from the one it displays (issue #218). This tries\n            // to detect that situation.\n            let track = browser.chrome || browser.ios ? { node: observer.selectionRange.focusNode, written: false } : undefined;\n            this.sync(this.view, track);\n            this.dirty = 0 /* Not */;\n            if (track && (track.written || observer.selectionRange.focusNode != track.node))\n                this.forceSelection = true;\n            this.dom.style.height = \"\";\n        });\n        let gaps = [];\n        if (this.view.viewport.from || this.view.viewport.to < this.view.state.doc.length)\n            for (let child of this.children)\n                if (child instanceof BlockWidgetView && child.widget instanceof BlockGapWidget)\n                    gaps.push(child.dom);\n        observer.updateGaps(gaps);\n    }\n    updateChildren(changes, oldLength) {\n        let cursor = this.childCursor(oldLength);\n        for (let i = changes.length - 1;; i--) {\n            let next = i >= 0 ? changes[i] : null;\n            if (!next)\n                break;\n            let { fromA, toA, fromB, toB } = next;\n            let { content, breakAtStart, openStart, openEnd } = ContentBuilder.build(this.view.state.doc, fromB, toB, this.decorations, this.dynamicDecorationMap);\n            let { i: toI, off: toOff } = cursor.findPos(toA, 1);\n            let { i: fromI, off: fromOff } = cursor.findPos(fromA, -1);\n            replaceRange(this, fromI, fromOff, toI, toOff, content, breakAtStart, openStart, openEnd);\n        }\n    }\n    // Sync the DOM selection to this.state.selection\n    updateSelection(mustRead = false, fromPointer = false) {\n        if (mustRead || !this.view.observer.selectionRange.focusNode)\n            this.view.observer.readSelectionRange();\n        let activeElt = this.view.root.activeElement, focused = activeElt == this.dom;\n        let selectionNotFocus = !focused &&\n            hasSelection(this.dom, this.view.observer.selectionRange) && !(activeElt && this.dom.contains(activeElt));\n        if (!(focused || fromPointer || selectionNotFocus))\n            return;\n        let force = this.forceSelection;\n        this.forceSelection = false;\n        let main = this.view.state.selection.main;\n        // FIXME need to handle the case where the selection falls inside a block range\n        let anchor = this.domAtPos(main.anchor);\n        let head = main.empty ? anchor : this.domAtPos(main.head);\n        // Always reset on Firefox when next to an uneditable node to\n        // avoid invisible cursor bugs (#111)\n        if (browser.gecko && main.empty && !this.compositionDeco.size && betweenUneditable(anchor)) {\n            let dummy = document.createTextNode(\"\");\n            this.view.observer.ignore(() => anchor.node.insertBefore(dummy, anchor.node.childNodes[anchor.offset] || null));\n            anchor = head = new DOMPos(dummy, 0);\n            force = true;\n        }\n        let domSel = this.view.observer.selectionRange;\n        // If the selection is already here, or in an equivalent position, don't touch it\n        if (force || !domSel.focusNode ||\n            !isEquivalentPosition(anchor.node, anchor.offset, domSel.anchorNode, domSel.anchorOffset) ||\n            !isEquivalentPosition(head.node, head.offset, domSel.focusNode, domSel.focusOffset)) {\n            this.view.observer.ignore(() => {\n                // Chrome Android will hide the virtual keyboard when tapping\n                // inside an uneditable node, and not bring it back when we\n                // move the cursor to its proper position. This tries to\n                // restore the keyboard by cycling focus.\n                if (browser.android && browser.chrome && this.dom.contains(domSel.focusNode) &&\n                    inUneditable(domSel.focusNode, this.dom)) {\n                    this.dom.blur();\n                    this.dom.focus({ preventScroll: true });\n                }\n                let rawSel = getSelection(this.view.root);\n                if (!rawSel) ;\n                else if (main.empty) {\n                    // Work around https://bugzilla.mozilla.org/show_bug.cgi?id=1612076\n                    if (browser.gecko) {\n                        let nextTo = nextToUneditable(anchor.node, anchor.offset);\n                        if (nextTo && nextTo != (1 /* Before */ | 2 /* After */)) {\n                            let text = nearbyTextNode(anchor.node, anchor.offset, nextTo == 1 /* Before */ ? 1 : -1);\n                            if (text)\n                                anchor = new DOMPos(text, nextTo == 1 /* Before */ ? 0 : text.nodeValue.length);\n                        }\n                    }\n                    rawSel.collapse(anchor.node, anchor.offset);\n                    if (main.bidiLevel != null && domSel.cursorBidiLevel != null)\n                        domSel.cursorBidiLevel = main.bidiLevel;\n                }\n                else if (rawSel.extend) {\n                    // Selection.extend can be used to create an 'inverted' selection\n                    // (one where the focus is before the anchor), but not all\n                    // browsers support it yet.\n                    rawSel.collapse(anchor.node, anchor.offset);\n                    // Safari will ignore the call above when the editor is\n                    // hidden, and then raise an error on the call to extend\n                    // (#940).\n                    try {\n                        rawSel.extend(head.node, head.offset);\n                    }\n                    catch (_) { }\n                }\n                else {\n                    // Primitive (IE) way\n                    let range = document.createRange();\n                    if (main.anchor > main.head)\n                        [anchor, head] = [head, anchor];\n                    range.setEnd(head.node, head.offset);\n                    range.setStart(anchor.node, anchor.offset);\n                    rawSel.removeAllRanges();\n                    rawSel.addRange(range);\n                }\n                if (selectionNotFocus && this.view.root.activeElement == this.dom) {\n                    this.dom.blur();\n                    if (activeElt)\n                        activeElt.focus();\n                }\n            });\n            this.view.observer.setSelectionRange(anchor, head);\n        }\n        this.impreciseAnchor = anchor.precise ? null : new DOMPos(domSel.anchorNode, domSel.anchorOffset);\n        this.impreciseHead = head.precise ? null : new DOMPos(domSel.focusNode, domSel.focusOffset);\n    }\n    enforceCursorAssoc() {\n        if (this.compositionDeco.size)\n            return;\n        let { view } = this, cursor = view.state.selection.main;\n        let sel = getSelection(view.root);\n        let { anchorNode, anchorOffset } = view.observer.selectionRange;\n        if (!sel || !cursor.empty || !cursor.assoc || !sel.modify)\n            return;\n        let line = LineView.find(this, cursor.head);\n        if (!line)\n            return;\n        let lineStart = line.posAtStart;\n        if (cursor.head == lineStart || cursor.head == lineStart + line.length)\n            return;\n        let before = this.coordsAt(cursor.head, -1), after = this.coordsAt(cursor.head, 1);\n        if (!before || !after || before.bottom > after.top)\n            return;\n        let dom = this.domAtPos(cursor.head + cursor.assoc);\n        sel.collapse(dom.node, dom.offset);\n        sel.modify(\"move\", cursor.assoc < 0 ? \"forward\" : \"backward\", \"lineboundary\");\n        // This can go wrong in corner cases like single-character lines,\n        // so check and reset if necessary.\n        view.observer.readSelectionRange();\n        let newRange = view.observer.selectionRange;\n        if (view.docView.posFromDOM(newRange.anchorNode, newRange.anchorOffset) != cursor.from)\n            sel.collapse(anchorNode, anchorOffset);\n    }\n    nearest(dom) {\n        for (let cur = dom; cur;) {\n            let domView = ContentView.get(cur);\n            if (domView && domView.rootView == this)\n                return domView;\n            cur = cur.parentNode;\n        }\n        return null;\n    }\n    posFromDOM(node, offset) {\n        let view = this.nearest(node);\n        if (!view)\n            throw new RangeError(\"Trying to find position for a DOM position outside of the document\");\n        return view.localPosFromDOM(node, offset) + view.posAtStart;\n    }\n    domAtPos(pos) {\n        let { i, off } = this.childCursor().findPos(pos, -1);\n        for (; i < this.children.length - 1;) {\n            let child = this.children[i];\n            if (off < child.length || child instanceof LineView)\n                break;\n            i++;\n            off = 0;\n        }\n        return this.children[i].domAtPos(off);\n    }\n    coordsAt(pos, side) {\n        for (let off = this.length, i = this.children.length - 1;; i--) {\n            let child = this.children[i], start = off - child.breakAfter - child.length;\n            if (pos > start ||\n                (pos == start && child.type != BlockType.WidgetBefore && child.type != BlockType.WidgetAfter &&\n                    (!i || side == 2 || this.children[i - 1].breakAfter ||\n                        (this.children[i - 1].type == BlockType.WidgetBefore && side > -2))))\n                return child.coordsAt(pos - start, side);\n            off = start;\n        }\n    }\n    measureVisibleLineHeights(viewport) {\n        let result = [], { from, to } = viewport;\n        let contentWidth = this.view.contentDOM.clientWidth;\n        let isWider = contentWidth > Math.max(this.view.scrollDOM.clientWidth, this.minWidth) + 1;\n        let widest = -1, ltr = this.view.textDirection == Direction.LTR;\n        for (let pos = 0, i = 0; i < this.children.length; i++) {\n            let child = this.children[i], end = pos + child.length;\n            if (end > to)\n                break;\n            if (pos >= from) {\n                let childRect = child.dom.getBoundingClientRect();\n                result.push(childRect.height);\n                if (isWider) {\n                    let last = child.dom.lastChild;\n                    let rects = last ? clientRectsFor(last) : [];\n                    if (rects.length) {\n                        let rect = rects[rects.length - 1];\n                        let width = ltr ? rect.right - childRect.left : childRect.right - rect.left;\n                        if (width > widest) {\n                            widest = width;\n                            this.minWidth = contentWidth;\n                            this.minWidthFrom = pos;\n                            this.minWidthTo = end;\n                        }\n                    }\n                }\n            }\n            pos = end + child.breakAfter;\n        }\n        return result;\n    }\n    textDirectionAt(pos) {\n        let { i } = this.childPos(pos, 1);\n        return getComputedStyle(this.children[i].dom).direction == \"rtl\" ? Direction.RTL : Direction.LTR;\n    }\n    measureTextSize() {\n        for (let child of this.children) {\n            if (child instanceof LineView) {\n                let measure = child.measureTextSize();\n                if (measure)\n                    return measure;\n            }\n        }\n        // If no workable line exists, force a layout of a measurable element\n        let dummy = document.createElement(\"div\"), lineHeight, charWidth, textHeight;\n        dummy.className = \"cm-line\";\n        dummy.style.width = \"99999px\";\n        dummy.textContent = \"abc def ghi jkl mno pqr stu\";\n        this.view.observer.ignore(() => {\n            this.dom.appendChild(dummy);\n            let rect = clientRectsFor(dummy.firstChild)[0];\n            lineHeight = dummy.getBoundingClientRect().height;\n            charWidth = rect ? rect.width / 27 : 7;\n            textHeight = rect ? rect.height : lineHeight;\n            dummy.remove();\n        });\n        return { lineHeight, charWidth, textHeight };\n    }\n    childCursor(pos = this.length) {\n        // Move back to start of last element when possible, so that\n        // `ChildCursor.findPos` doesn't have to deal with the edge case\n        // of being after the last element.\n        let i = this.children.length;\n        if (i)\n            pos -= this.children[--i].length;\n        return new ChildCursor(this.children, pos, i);\n    }\n    computeBlockGapDeco() {\n        let deco = [], vs = this.view.viewState;\n        for (let pos = 0, i = 0;; i++) {\n            let next = i == vs.viewports.length ? null : vs.viewports[i];\n            let end = next ? next.from - 1 : this.length;\n            if (end > pos) {\n                let height = vs.lineBlockAt(end).bottom - vs.lineBlockAt(pos).top;\n                deco.push(Decoration.replace({\n                    widget: new BlockGapWidget(height),\n                    block: true,\n                    inclusive: true,\n                    isBlockGap: true,\n                }).range(pos, end));\n            }\n            if (!next)\n                break;\n            pos = next.to + 1;\n        }\n        return Decoration.set(deco);\n    }\n    updateDeco() {\n        let allDeco = this.view.state.facet(decorations).map((d, i) => {\n            let dynamic = this.dynamicDecorationMap[i] = typeof d == \"function\";\n            return dynamic ? d(this.view) : d;\n        });\n        for (let i = allDeco.length; i < allDeco.length + 3; i++)\n            this.dynamicDecorationMap[i] = false;\n        return this.decorations = [\n            ...allDeco,\n            this.compositionDeco,\n            this.computeBlockGapDeco(),\n            this.view.viewState.lineGapDeco\n        ];\n    }\n    scrollIntoView(target) {\n        let { range } = target;\n        let rect = this.coordsAt(range.head, range.empty ? range.assoc : range.head > range.anchor ? -1 : 1), other;\n        if (!rect)\n            return;\n        if (!range.empty && (other = this.coordsAt(range.anchor, range.anchor > range.head ? -1 : 1)))\n            rect = { left: Math.min(rect.left, other.left), top: Math.min(rect.top, other.top),\n                right: Math.max(rect.right, other.right), bottom: Math.max(rect.bottom, other.bottom) };\n        let margins = getScrollMargins(this.view);\n        let targetRect = {\n            left: rect.left - margins.left, top: rect.top - margins.top,\n            right: rect.right + margins.right, bottom: rect.bottom + margins.bottom\n        };\n        scrollRectIntoView(this.view.scrollDOM, targetRect, range.head < range.anchor ? -1 : 1, target.x, target.y, target.xMargin, target.yMargin, this.view.textDirection == Direction.LTR);\n    }\n}\nfunction betweenUneditable(pos) {\n    return pos.node.nodeType == 1 && pos.node.firstChild &&\n        (pos.offset == 0 || pos.node.childNodes[pos.offset - 1].contentEditable == \"false\") &&\n        (pos.offset == pos.node.childNodes.length || pos.node.childNodes[pos.offset].contentEditable == \"false\");\n}\nclass BlockGapWidget extends WidgetType {\n    constructor(height) {\n        super();\n        this.height = height;\n    }\n    toDOM() {\n        let elt = document.createElement(\"div\");\n        this.updateDOM(elt);\n        return elt;\n    }\n    eq(other) { return other.height == this.height; }\n    updateDOM(elt) {\n        elt.style.height = this.height + \"px\";\n        return true;\n    }\n    get estimatedHeight() { return this.height; }\n}\nfunction compositionSurroundingNode(view) {\n    let sel = view.observer.selectionRange;\n    let textNode = sel.focusNode && nearbyTextNode(sel.focusNode, sel.focusOffset, 0);\n    if (!textNode)\n        return null;\n    let cView = view.docView.nearest(textNode);\n    if (!cView)\n        return null;\n    if (cView instanceof LineView) {\n        let topNode = textNode;\n        while (topNode.parentNode != cView.dom)\n            topNode = topNode.parentNode;\n        let prev = topNode.previousSibling;\n        while (prev && !ContentView.get(prev))\n            prev = prev.previousSibling;\n        let pos = prev ? ContentView.get(prev).posAtEnd : cView.posAtStart;\n        return { from: pos, to: pos, node: topNode, text: textNode };\n    }\n    else {\n        for (;;) {\n            let { parent } = cView;\n            if (!parent)\n                return null;\n            if (parent instanceof LineView)\n                break;\n            cView = parent;\n        }\n        let from = cView.posAtStart;\n        return { from, to: from + cView.length, node: cView.dom, text: textNode };\n    }\n}\nconst noComp = { deco: Decoration.none, node: null };\nfunction computeCompositionDeco(view, changes) {\n    let surrounding = compositionSurroundingNode(view);\n    if (!surrounding)\n        return noComp;\n    let { from, to, node, text: textNode } = surrounding;\n    let newFrom = changes.mapPos(from, 1), newTo = Math.max(newFrom, changes.mapPos(to, -1));\n    let { state } = view, reader = new DOMReader([], state);\n    if (node.nodeType == 3)\n        reader.readTextNode(node);\n    else\n        reader.readRange(node.firstChild, null);\n    let { text } = reader;\n    if (text.indexOf(LineBreakPlaceholder) > -1)\n        return noComp; // Don't try to preserve multi-line compositions\n    if (newTo - newFrom < text.length) {\n        if (state.doc.sliceString(newFrom, Math.min(state.doc.length, newFrom + text.length)) == text)\n            newTo = newFrom + text.length;\n        else if (state.doc.sliceString(Math.max(0, newTo - text.length), newTo) == text)\n            newFrom = newTo - text.length;\n        else\n            return noComp;\n    }\n    else if (state.doc.sliceString(newFrom, newTo) != text) {\n        return noComp;\n    }\n    let topView = ContentView.get(node);\n    if (topView instanceof CompositionView)\n        topView = topView.widget.topView;\n    else if (topView)\n        topView.parent = null;\n    let deco = Decoration.set(Decoration.replace({ widget: new CompositionWidget(node, textNode, topView), inclusive: true })\n        .range(newFrom, newTo));\n    return { deco, node };\n}\nclass CompositionWidget extends WidgetType {\n    constructor(top, text, topView) {\n        super();\n        this.top = top;\n        this.text = text;\n        this.topView = topView;\n    }\n    eq(other) { return this.top == other.top && this.text == other.text; }\n    toDOM() { return this.top; }\n    ignoreEvent() { return false; }\n    get customView() { return CompositionView; }\n}\nfunction nearbyTextNode(startNode, startOffset, side) {\n    if (side <= 0)\n        for (let node = startNode, offset = startOffset;;) {\n            if (node.nodeType == 3)\n                return node;\n            if (node.nodeType == 1 && offset > 0) {\n                node = node.childNodes[offset - 1];\n                offset = maxOffset(node);\n            }\n            else {\n                break;\n            }\n        }\n    if (side >= 0)\n        for (let node = startNode, offset = startOffset;;) {\n            if (node.nodeType == 3)\n                return node;\n            if (node.nodeType == 1 && offset < node.childNodes.length && side >= 0) {\n                node = node.childNodes[offset];\n                offset = 0;\n            }\n            else {\n                break;\n            }\n        }\n    return null;\n}\nfunction nextToUneditable(node, offset) {\n    if (node.nodeType != 1)\n        return 0;\n    return (offset && node.childNodes[offset - 1].contentEditable == \"false\" ? 1 /* Before */ : 0) |\n        (offset < node.childNodes.length && node.childNodes[offset].contentEditable == \"false\" ? 2 /* After */ : 0);\n}\nclass DecorationComparator$1 {\n    constructor() {\n        this.changes = [];\n    }\n    compareRange(from, to) { addRange(from, to, this.changes); }\n    comparePoint(from, to) { addRange(from, to, this.changes); }\n}\nfunction findChangedDeco(a, b, diff) {\n    let comp = new DecorationComparator$1;\n    RangeSet.compare(a, b, diff, comp);\n    return comp.changes;\n}\nfunction inUneditable(node, inside) {\n    for (let cur = node; cur && cur != inside; cur = cur.assignedSlot || cur.parentNode) {\n        if (cur.nodeType == 1 && cur.contentEditable == 'false') {\n            return true;\n        }\n    }\n    return false;\n}\n\nfunction groupAt(state, pos, bias = 1) {\n    let categorize = state.charCategorizer(pos);\n    let line = state.doc.lineAt(pos), linePos = pos - line.from;\n    if (line.length == 0)\n        return EditorSelection.cursor(pos);\n    if (linePos == 0)\n        bias = 1;\n    else if (linePos == line.length)\n        bias = -1;\n    let from = linePos, to = linePos;\n    if (bias < 0)\n        from = findClusterBreak(line.text, linePos, false);\n    else\n        to = findClusterBreak(line.text, linePos);\n    let cat = categorize(line.text.slice(from, to));\n    while (from > 0) {\n        let prev = findClusterBreak(line.text, from, false);\n        if (categorize(line.text.slice(prev, from)) != cat)\n            break;\n        from = prev;\n    }\n    while (to < line.length) {\n        let next = findClusterBreak(line.text, to);\n        if (categorize(line.text.slice(to, next)) != cat)\n            break;\n        to = next;\n    }\n    return EditorSelection.range(from + line.from, to + line.from);\n}\n// Search the DOM for the {node, offset} position closest to the given\n// coordinates. Very inefficient and crude, but can usually be avoided\n// by calling caret(Position|Range)FromPoint instead.\nfunction getdx(x, rect) {\n    return rect.left > x ? rect.left - x : Math.max(0, x - rect.right);\n}\nfunction getdy(y, rect) {\n    return rect.top > y ? rect.top - y : Math.max(0, y - rect.bottom);\n}\nfunction yOverlap(a, b) {\n    return a.top < b.bottom - 1 && a.bottom > b.top + 1;\n}\nfunction upTop(rect, top) {\n    return top < rect.top ? { top, left: rect.left, right: rect.right, bottom: rect.bottom } : rect;\n}\nfunction upBot(rect, bottom) {\n    return bottom > rect.bottom ? { top: rect.top, left: rect.left, right: rect.right, bottom } : rect;\n}\nfunction domPosAtCoords(parent, x, y) {\n    let closest, closestRect, closestX, closestY, closestOverlap = false;\n    let above, below, aboveRect, belowRect;\n    for (let child = parent.firstChild; child; child = child.nextSibling) {\n        let rects = clientRectsFor(child);\n        for (let i = 0; i < rects.length; i++) {\n            let rect = rects[i];\n            if (closestRect && yOverlap(closestRect, rect))\n                rect = upTop(upBot(rect, closestRect.bottom), closestRect.top);\n            let dx = getdx(x, rect), dy = getdy(y, rect);\n            if (dx == 0 && dy == 0)\n                return child.nodeType == 3 ? domPosInText(child, x, y) : domPosAtCoords(child, x, y);\n            if (!closest || closestY > dy || closestY == dy && closestX > dx) {\n                closest = child;\n                closestRect = rect;\n                closestX = dx;\n                closestY = dy;\n                let side = dy ? (y < rect.top ? -1 : 1) : dx ? (x < rect.left ? -1 : 1) : 0;\n                closestOverlap = !side || (side > 0 ? i < rects.length - 1 : i > 0);\n            }\n            if (dx == 0) {\n                if (y > rect.bottom && (!aboveRect || aboveRect.bottom < rect.bottom)) {\n                    above = child;\n                    aboveRect = rect;\n                }\n                else if (y < rect.top && (!belowRect || belowRect.top > rect.top)) {\n                    below = child;\n                    belowRect = rect;\n                }\n            }\n            else if (aboveRect && yOverlap(aboveRect, rect)) {\n                aboveRect = upBot(aboveRect, rect.bottom);\n            }\n            else if (belowRect && yOverlap(belowRect, rect)) {\n                belowRect = upTop(belowRect, rect.top);\n            }\n        }\n    }\n    if (aboveRect && aboveRect.bottom >= y) {\n        closest = above;\n        closestRect = aboveRect;\n    }\n    else if (belowRect && belowRect.top <= y) {\n        closest = below;\n        closestRect = belowRect;\n    }\n    if (!closest)\n        return { node: parent, offset: 0 };\n    let clipX = Math.max(closestRect.left, Math.min(closestRect.right, x));\n    if (closest.nodeType == 3)\n        return domPosInText(closest, clipX, y);\n    if (closestOverlap && closest.contentEditable != \"false\")\n        return domPosAtCoords(closest, clipX, y);\n    let offset = Array.prototype.indexOf.call(parent.childNodes, closest) +\n        (x >= (closestRect.left + closestRect.right) / 2 ? 1 : 0);\n    return { node: parent, offset };\n}\nfunction domPosInText(node, x, y) {\n    let len = node.nodeValue.length;\n    let closestOffset = -1, closestDY = 1e9, generalSide = 0;\n    for (let i = 0; i < len; i++) {\n        let rects = textRange(node, i, i + 1).getClientRects();\n        for (let j = 0; j < rects.length; j++) {\n            let rect = rects[j];\n            if (rect.top == rect.bottom)\n                continue;\n            if (!generalSide)\n                generalSide = x - rect.left;\n            let dy = (rect.top > y ? rect.top - y : y - rect.bottom) - 1;\n            if (rect.left - 1 <= x && rect.right + 1 >= x && dy < closestDY) {\n                let right = x >= (rect.left + rect.right) / 2, after = right;\n                if (browser.chrome || browser.gecko) {\n                    // Check for RTL on browsers that support getting client\n                    // rects for empty ranges.\n                    let rectBefore = textRange(node, i).getBoundingClientRect();\n                    if (rectBefore.left == rect.right)\n                        after = !right;\n                }\n                if (dy <= 0)\n                    return { node, offset: i + (after ? 1 : 0) };\n                closestOffset = i + (after ? 1 : 0);\n                closestDY = dy;\n            }\n        }\n    }\n    return { node, offset: closestOffset > -1 ? closestOffset : generalSide > 0 ? node.nodeValue.length : 0 };\n}\nfunction posAtCoords(view, coords, precise, bias = -1) {\n    var _a, _b;\n    let content = view.contentDOM.getBoundingClientRect(), docTop = content.top + view.viewState.paddingTop;\n    let block, { docHeight } = view.viewState;\n    let { x, y } = coords, yOffset = y - docTop;\n    if (yOffset < 0)\n        return 0;\n    if (yOffset > docHeight)\n        return view.state.doc.length;\n    // Scan for a text block near the queried y position\n    for (let halfLine = view.viewState.heightOracle.textHeight / 2, bounced = false;;) {\n        block = view.elementAtHeight(yOffset);\n        if (block.type == BlockType.Text)\n            break;\n        for (;;) {\n            // Move the y position out of this block\n            yOffset = bias > 0 ? block.bottom + halfLine : block.top - halfLine;\n            if (yOffset >= 0 && yOffset <= docHeight)\n                break;\n            // If the document consists entirely of replaced widgets, we\n            // won't find a text block, so return 0\n            if (bounced)\n                return precise ? null : 0;\n            bounced = true;\n            bias = -bias;\n        }\n    }\n    y = docTop + yOffset;\n    let lineStart = block.from;\n    // If this is outside of the rendered viewport, we can't determine a position\n    if (lineStart < view.viewport.from)\n        return view.viewport.from == 0 ? 0 : precise ? null : posAtCoordsImprecise(view, content, block, x, y);\n    if (lineStart > view.viewport.to)\n        return view.viewport.to == view.state.doc.length ? view.state.doc.length :\n            precise ? null : posAtCoordsImprecise(view, content, block, x, y);\n    // Prefer ShadowRootOrDocument.elementFromPoint if present, fall back to document if not\n    let doc = view.dom.ownerDocument;\n    let root = view.root.elementFromPoint ? view.root : doc;\n    let element = root.elementFromPoint(x, y);\n    if (element && !view.contentDOM.contains(element))\n        element = null;\n    // If the element is unexpected, clip x at the sides of the content area and try again\n    if (!element) {\n        x = Math.max(content.left + 1, Math.min(content.right - 1, x));\n        element = root.elementFromPoint(x, y);\n        if (element && !view.contentDOM.contains(element))\n            element = null;\n    }\n    // There's visible editor content under the point, so we can try\n    // using caret(Position|Range)FromPoint as a shortcut\n    let node, offset = -1;\n    if (element && ((_a = view.docView.nearest(element)) === null || _a === void 0 ? void 0 : _a.isEditable) != false) {\n        if (doc.caretPositionFromPoint) {\n            let pos = doc.caretPositionFromPoint(x, y);\n            if (pos)\n                ({ offsetNode: node, offset } = pos);\n        }\n        else if (doc.caretRangeFromPoint) {\n            let range = doc.caretRangeFromPoint(x, y);\n            if (range) {\n                ({ startContainer: node, startOffset: offset } = range);\n                if (!view.contentDOM.contains(node) ||\n                    browser.safari && isSuspiciousSafariCaretResult(node, offset, x) ||\n                    browser.chrome && isSuspiciousChromeCaretResult(node, offset, x))\n                    node = undefined;\n            }\n        }\n    }\n    // No luck, do our own (potentially expensive) search\n    if (!node || !view.docView.dom.contains(node)) {\n        let line = LineView.find(view.docView, lineStart);\n        if (!line)\n            return yOffset > block.top + block.height / 2 ? block.to : block.from;\n        ({ node, offset } = domPosAtCoords(line.dom, x, y));\n    }\n    let nearest = view.docView.nearest(node);\n    if (!nearest)\n        return null;\n    if (nearest.isWidget && ((_b = nearest.dom) === null || _b === void 0 ? void 0 : _b.nodeType) == 1) {\n        let rect = nearest.dom.getBoundingClientRect();\n        return coords.y < rect.top || coords.y <= rect.bottom && coords.x <= (rect.left + rect.right) / 2\n            ? nearest.posAtStart : nearest.posAtEnd;\n    }\n    else {\n        return nearest.localPosFromDOM(node, offset) + nearest.posAtStart;\n    }\n}\nfunction posAtCoordsImprecise(view, contentRect, block, x, y) {\n    let into = Math.round((x - contentRect.left) * view.defaultCharacterWidth);\n    if (view.lineWrapping && block.height > view.defaultLineHeight * 1.5) {\n        let textHeight = view.viewState.heightOracle.textHeight;\n        let line = Math.floor((y - block.top - (view.defaultLineHeight - textHeight) * 0.5) / textHeight);\n        into += line * view.viewState.heightOracle.lineLength;\n    }\n    let content = view.state.sliceDoc(block.from, block.to);\n    return block.from + findColumn(content, into, view.state.tabSize);\n}\n// In case of a high line height, Safari's caretRangeFromPoint treats\n// the space between lines as belonging to the last character of the\n// line before. This is used to detect such a result so that it can be\n// ignored (issue #401).\nfunction isSuspiciousSafariCaretResult(node, offset, x) {\n    let len;\n    if (node.nodeType != 3 || offset != (len = node.nodeValue.length))\n        return false;\n    for (let next = node.nextSibling; next; next = next.nextSibling)\n        if (next.nodeType != 1 || next.nodeName != \"BR\")\n            return false;\n    return textRange(node, len - 1, len).getBoundingClientRect().left > x;\n}\n// Chrome will move positions between lines to the start of the next line\nfunction isSuspiciousChromeCaretResult(node, offset, x) {\n    if (offset != 0)\n        return false;\n    for (let cur = node;;) {\n        let parent = cur.parentNode;\n        if (!parent || parent.nodeType != 1 || parent.firstChild != cur)\n            return false;\n        if (parent.classList.contains(\"cm-line\"))\n            break;\n        cur = parent;\n    }\n    let rect = node.nodeType == 1 ? node.getBoundingClientRect()\n        : textRange(node, 0, Math.max(node.nodeValue.length, 1)).getBoundingClientRect();\n    return x - rect.left > 5;\n}\nfunction blockAt(view, pos) {\n    let line = view.lineBlockAt(pos);\n    if (Array.isArray(line.type))\n        for (let l of line.type) {\n            if (l.to > pos || l.to == pos && (l.to == line.to || l.type == BlockType.Text))\n                return l;\n        }\n    return line;\n}\nfunction moveToLineBoundary(view, start, forward, includeWrap) {\n    let line = blockAt(view, start.head);\n    let coords = !includeWrap || line.type != BlockType.Text || !(view.lineWrapping || line.widgetLineBreaks) ? null\n        : view.coordsAtPos(start.assoc < 0 && start.head > line.from ? start.head - 1 : start.head);\n    if (coords) {\n        let editorRect = view.dom.getBoundingClientRect();\n        let direction = view.textDirectionAt(line.from);\n        let pos = view.posAtCoords({ x: forward == (direction == Direction.LTR) ? editorRect.right - 1 : editorRect.left + 1,\n            y: (coords.top + coords.bottom) / 2 });\n        if (pos != null)\n            return EditorSelection.cursor(pos, forward ? -1 : 1);\n    }\n    return EditorSelection.cursor(forward ? line.to : line.from, forward ? -1 : 1);\n}\nfunction moveByChar(view, start, forward, by) {\n    let line = view.state.doc.lineAt(start.head), spans = view.bidiSpans(line);\n    let direction = view.textDirectionAt(line.from);\n    for (let cur = start, check = null;;) {\n        let next = moveVisually(line, spans, direction, cur, forward), char = movedOver;\n        if (!next) {\n            if (line.number == (forward ? view.state.doc.lines : 1))\n                return cur;\n            char = \"\\n\";\n            line = view.state.doc.line(line.number + (forward ? 1 : -1));\n            spans = view.bidiSpans(line);\n            next = EditorSelection.cursor(forward ? line.from : line.to);\n        }\n        if (!check) {\n            if (!by)\n                return next;\n            check = by(char);\n        }\n        else if (!check(char)) {\n            return cur;\n        }\n        cur = next;\n    }\n}\nfunction byGroup(view, pos, start) {\n    let categorize = view.state.charCategorizer(pos);\n    let cat = categorize(start);\n    return (next) => {\n        let nextCat = categorize(next);\n        if (cat == CharCategory.Space)\n            cat = nextCat;\n        return cat == nextCat;\n    };\n}\nfunction moveVertically(view, start, forward, distance) {\n    let startPos = start.head, dir = forward ? 1 : -1;\n    if (startPos == (forward ? view.state.doc.length : 0))\n        return EditorSelection.cursor(startPos, start.assoc);\n    let goal = start.goalColumn, startY;\n    let rect = view.contentDOM.getBoundingClientRect();\n    let startCoords = view.coordsAtPos(startPos), docTop = view.documentTop;\n    if (startCoords) {\n        if (goal == null)\n            goal = startCoords.left - rect.left;\n        startY = dir < 0 ? startCoords.top : startCoords.bottom;\n    }\n    else {\n        let line = view.viewState.lineBlockAt(startPos);\n        if (goal == null)\n            goal = Math.min(rect.right - rect.left, view.defaultCharacterWidth * (startPos - line.from));\n        startY = (dir < 0 ? line.top : line.bottom) + docTop;\n    }\n    let resolvedGoal = rect.left + goal;\n    let dist = distance !== null && distance !== void 0 ? distance : (view.viewState.heightOracle.textHeight >> 1);\n    for (let extra = 0;; extra += 10) {\n        let curY = startY + (dist + extra) * dir;\n        let pos = posAtCoords(view, { x: resolvedGoal, y: curY }, false, dir);\n        if (curY < rect.top || curY > rect.bottom || (dir < 0 ? pos < startPos : pos > startPos))\n            return EditorSelection.cursor(pos, start.assoc, undefined, goal);\n    }\n}\nfunction skipAtomicRanges(atoms, pos, bias) {\n    for (;;) {\n        let moved = 0;\n        for (let set of atoms) {\n            set.between(pos - 1, pos + 1, (from, to, value) => {\n                if (pos > from && pos < to) {\n                    let side = moved || bias || (pos - from < to - pos ? -1 : 1);\n                    pos = side < 0 ? from : to;\n                    moved = side;\n                }\n            });\n        }\n        if (!moved)\n            return pos;\n    }\n}\nfunction skipAtoms(view, oldPos, pos) {\n    let newPos = skipAtomicRanges(view.state.facet(atomicRanges).map(f => f(view)), pos.from, oldPos.head > pos.from ? -1 : 1);\n    return newPos == pos.from ? pos : EditorSelection.cursor(newPos, newPos < pos.from ? 1 : -1);\n}\n\n// This will also be where dragging info and such goes\nclass InputState {\n    constructor(view) {\n        this.lastKeyCode = 0;\n        this.lastKeyTime = 0;\n        this.lastTouchTime = 0;\n        this.lastFocusTime = 0;\n        this.lastScrollTop = 0;\n        this.lastScrollLeft = 0;\n        this.chromeScrollHack = -1;\n        // On iOS, some keys need to have their default behavior happen\n        // (after which we retroactively handle them and reset the DOM) to\n        // avoid messing up the virtual keyboard state.\n        this.pendingIOSKey = undefined;\n        this.lastSelectionOrigin = null;\n        this.lastSelectionTime = 0;\n        this.lastEscPress = 0;\n        this.lastContextMenu = 0;\n        this.scrollHandlers = [];\n        this.registeredEvents = [];\n        this.customHandlers = [];\n        // -1 means not in a composition. Otherwise, this counts the number\n        // of changes made during the composition. The count is used to\n        // avoid treating the start state of the composition, before any\n        // changes have been made, as part of the composition.\n        this.composing = -1;\n        // Tracks whether the next change should be marked as starting the\n        // composition (null means no composition, true means next is the\n        // first, false means first has already been marked for this\n        // composition)\n        this.compositionFirstChange = null;\n        // End time of the previous composition\n        this.compositionEndedAt = 0;\n        // Used in a kludge to detect when an Enter keypress should be\n        // considered part of the composition on Safari, which fires events\n        // in the wrong order\n        this.compositionPendingKey = false;\n        // Used to categorize changes as part of a composition, even when\n        // the mutation events fire shortly after the compositionend event\n        this.compositionPendingChange = false;\n        this.mouseSelection = null;\n        let handleEvent = (handler, event) => {\n            if (this.ignoreDuringComposition(event))\n                return;\n            if (event.type == \"keydown\" && this.keydown(view, event))\n                return;\n            if (this.mustFlushObserver(event))\n                view.observer.forceFlush();\n            if (this.runCustomHandlers(event.type, view, event))\n                event.preventDefault();\n            else\n                handler(view, event);\n        };\n        for (let type in handlers) {\n            let handler = handlers[type];\n            view.contentDOM.addEventListener(type, event => {\n                if (eventBelongsToEditor(view, event))\n                    handleEvent(handler, event);\n            }, handlerOptions[type]);\n            this.registeredEvents.push(type);\n        }\n        view.scrollDOM.addEventListener(\"mousedown\", (event) => {\n            if (event.target == view.scrollDOM && event.clientY > view.contentDOM.getBoundingClientRect().bottom) {\n                handleEvent(handlers.mousedown, event);\n                if (!event.defaultPrevented && event.button == 2) {\n                    // Make sure the content covers the entire scroller height, in order\n                    // to catch a native context menu click below it\n                    let start = view.contentDOM.style.minHeight;\n                    view.contentDOM.style.minHeight = \"100%\";\n                    setTimeout(() => view.contentDOM.style.minHeight = start, 200);\n                }\n            }\n        });\n        view.scrollDOM.addEventListener(\"drop\", (event) => {\n            if (event.target == view.scrollDOM && event.clientY > view.contentDOM.getBoundingClientRect().bottom)\n                handleEvent(handlers.drop, event);\n        });\n        if (browser.chrome && browser.chrome_version == 102) { // FIXME remove at some point\n            // On Chrome 102, viewport updates somehow stop wheel-based\n            // scrolling. Turning off pointer events during the scroll seems\n            // to avoid the issue.\n            view.scrollDOM.addEventListener(\"wheel\", () => {\n                if (this.chromeScrollHack < 0)\n                    view.contentDOM.style.pointerEvents = \"none\";\n                else\n                    window.clearTimeout(this.chromeScrollHack);\n                this.chromeScrollHack = setTimeout(() => {\n                    this.chromeScrollHack = -1;\n                    view.contentDOM.style.pointerEvents = \"\";\n                }, 100);\n            }, { passive: true });\n        }\n        this.notifiedFocused = view.hasFocus;\n        // On Safari adding an input event handler somehow prevents an\n        // issue where the composition vanishes when you press enter.\n        if (browser.safari)\n            view.contentDOM.addEventListener(\"input\", () => null);\n    }\n    setSelectionOrigin(origin) {\n        this.lastSelectionOrigin = origin;\n        this.lastSelectionTime = Date.now();\n    }\n    ensureHandlers(view, plugins) {\n        var _a;\n        let handlers;\n        this.customHandlers = [];\n        for (let plugin of plugins)\n            if (handlers = (_a = plugin.update(view).spec) === null || _a === void 0 ? void 0 : _a.domEventHandlers) {\n                this.customHandlers.push({ plugin: plugin.value, handlers });\n                for (let type in handlers)\n                    if (this.registeredEvents.indexOf(type) < 0 && type != \"scroll\") {\n                        this.registeredEvents.push(type);\n                        view.contentDOM.addEventListener(type, (event) => {\n                            if (!eventBelongsToEditor(view, event))\n                                return;\n                            if (this.runCustomHandlers(type, view, event))\n                                event.preventDefault();\n                        });\n                    }\n            }\n    }\n    runCustomHandlers(type, view, event) {\n        for (let set of this.customHandlers) {\n            let handler = set.handlers[type];\n            if (handler) {\n                try {\n                    if (handler.call(set.plugin, event, view) || event.defaultPrevented)\n                        return true;\n                }\n                catch (e) {\n                    logException(view.state, e);\n                }\n            }\n        }\n        return false;\n    }\n    runScrollHandlers(view, event) {\n        this.lastScrollTop = view.scrollDOM.scrollTop;\n        this.lastScrollLeft = view.scrollDOM.scrollLeft;\n        for (let set of this.customHandlers) {\n            let handler = set.handlers.scroll;\n            if (handler) {\n                try {\n                    handler.call(set.plugin, event, view);\n                }\n                catch (e) {\n                    logException(view.state, e);\n                }\n            }\n        }\n    }\n    keydown(view, event) {\n        // Must always run, even if a custom handler handled the event\n        this.lastKeyCode = event.keyCode;\n        this.lastKeyTime = Date.now();\n        if (event.keyCode == 9 && Date.now() < this.lastEscPress + 2000)\n            return true;\n        if (event.keyCode != 27 && modifierCodes.indexOf(event.keyCode) < 0)\n            view.inputState.lastEscPress = 0;\n        // Chrome for Android usually doesn't fire proper key events, but\n        // occasionally does, usually surrounded by a bunch of complicated\n        // composition changes. When an enter or backspace key event is\n        // seen, hold off on handling DOM events for a bit, and then\n        // dispatch it.\n        if (browser.android && browser.chrome && !event.synthetic &&\n            (event.keyCode == 13 || event.keyCode == 8)) {\n            view.observer.delayAndroidKey(event.key, event.keyCode);\n            return true;\n        }\n        // Prevent the default behavior of Enter on iOS makes the\n        // virtual keyboard get stuck in the wrong (lowercase)\n        // state. So we let it go through, and then, in\n        // applyDOMChange, notify key handlers of it and reset to\n        // the state they produce.\n        let pending;\n        if (browser.ios && !event.synthetic && !event.altKey && !event.metaKey &&\n            ((pending = PendingKeys.find(key => key.keyCode == event.keyCode)) && !event.ctrlKey ||\n                EmacsyPendingKeys.indexOf(event.key) > -1 && event.ctrlKey && !event.shiftKey)) {\n            this.pendingIOSKey = pending || event;\n            setTimeout(() => this.flushIOSKey(view), 250);\n            return true;\n        }\n        return false;\n    }\n    flushIOSKey(view) {\n        let key = this.pendingIOSKey;\n        if (!key)\n            return false;\n        this.pendingIOSKey = undefined;\n        return dispatchKey(view.contentDOM, key.key, key.keyCode);\n    }\n    ignoreDuringComposition(event) {\n        if (!/^key/.test(event.type))\n            return false;\n        if (this.composing > 0)\n            return true;\n        // See https://www.stum.de/2016/06/24/handling-ime-events-in-javascript/.\n        // On some input method editors (IMEs), the Enter key is used to\n        // confirm character selection. On Safari, when Enter is pressed,\n        // compositionend and keydown events are sometimes emitted in the\n        // wrong order. The key event should still be ignored, even when\n        // it happens after the compositionend event.\n        if (browser.safari && !browser.ios && this.compositionPendingKey && Date.now() - this.compositionEndedAt < 100) {\n            this.compositionPendingKey = false;\n            return true;\n        }\n        return false;\n    }\n    mustFlushObserver(event) {\n        return event.type == \"keydown\" && event.keyCode != 229;\n    }\n    startMouseSelection(mouseSelection) {\n        if (this.mouseSelection)\n            this.mouseSelection.destroy();\n        this.mouseSelection = mouseSelection;\n    }\n    update(update) {\n        if (this.mouseSelection)\n            this.mouseSelection.update(update);\n        if (update.transactions.length)\n            this.lastKeyCode = this.lastSelectionTime = 0;\n    }\n    destroy() {\n        if (this.mouseSelection)\n            this.mouseSelection.destroy();\n    }\n}\nconst PendingKeys = [\n    { key: \"Backspace\", keyCode: 8, inputType: \"deleteContentBackward\" },\n    { key: \"Enter\", keyCode: 13, inputType: \"insertParagraph\" },\n    { key: \"Enter\", keyCode: 13, inputType: \"insertLineBreak\" },\n    { key: \"Delete\", keyCode: 46, inputType: \"deleteContentForward\" }\n];\nconst EmacsyPendingKeys = \"dthko\";\n// Key codes for modifier keys\nconst modifierCodes = [16, 17, 18, 20, 91, 92, 224, 225];\nconst dragScrollMargin = 6;\nfunction dragScrollSpeed(dist) {\n    return Math.max(0, dist) * 0.7 + 8;\n}\nclass MouseSelection {\n    constructor(view, startEvent, style, mustSelect) {\n        this.view = view;\n        this.style = style;\n        this.mustSelect = mustSelect;\n        this.scrollSpeed = { x: 0, y: 0 };\n        this.scrolling = -1;\n        this.lastEvent = startEvent;\n        this.scrollParent = scrollableParent(view.contentDOM);\n        this.atoms = view.state.facet(atomicRanges).map(f => f(view));\n        let doc = view.contentDOM.ownerDocument;\n        doc.addEventListener(\"mousemove\", this.move = this.move.bind(this));\n        doc.addEventListener(\"mouseup\", this.up = this.up.bind(this));\n        this.extend = startEvent.shiftKey;\n        this.multiple = view.state.facet(EditorState.allowMultipleSelections) && addsSelectionRange(view, startEvent);\n        this.dragging = isInPrimarySelection(view, startEvent) && getClickType(startEvent) == 1 ? null : false;\n    }\n    start(event) {\n        // When clicking outside of the selection, immediately apply the\n        // effect of starting the selection\n        if (this.dragging === false) {\n            event.preventDefault();\n            this.select(event);\n        }\n    }\n    move(event) {\n        var _a;\n        if (event.buttons == 0)\n            return this.destroy();\n        if (this.dragging !== false)\n            return;\n        this.select(this.lastEvent = event);\n        let sx = 0, sy = 0;\n        let rect = ((_a = this.scrollParent) === null || _a === void 0 ? void 0 : _a.getBoundingClientRect())\n            || { left: 0, top: 0, right: this.view.win.innerWidth, bottom: this.view.win.innerHeight };\n        let margins = getScrollMargins(this.view);\n        if (event.clientX - margins.left <= rect.left + dragScrollMargin)\n            sx = -dragScrollSpeed(rect.left - event.clientX);\n        else if (event.clientX + margins.right >= rect.right - dragScrollMargin)\n            sx = dragScrollSpeed(event.clientX - rect.right);\n        if (event.clientY - margins.top <= rect.top + dragScrollMargin)\n            sy = -dragScrollSpeed(rect.top - event.clientY);\n        else if (event.clientY + margins.bottom >= rect.bottom - dragScrollMargin)\n            sy = dragScrollSpeed(event.clientY - rect.bottom);\n        this.setScrollSpeed(sx, sy);\n    }\n    up(event) {\n        if (this.dragging == null)\n            this.select(this.lastEvent);\n        if (!this.dragging)\n            event.preventDefault();\n        this.destroy();\n    }\n    destroy() {\n        this.setScrollSpeed(0, 0);\n        let doc = this.view.contentDOM.ownerDocument;\n        doc.removeEventListener(\"mousemove\", this.move);\n        doc.removeEventListener(\"mouseup\", this.up);\n        this.view.inputState.mouseSelection = null;\n    }\n    setScrollSpeed(sx, sy) {\n        this.scrollSpeed = { x: sx, y: sy };\n        if (sx || sy) {\n            if (this.scrolling < 0)\n                this.scrolling = setInterval(() => this.scroll(), 50);\n        }\n        else if (this.scrolling > -1) {\n            clearInterval(this.scrolling);\n            this.scrolling = -1;\n        }\n    }\n    scroll() {\n        if (this.scrollParent) {\n            this.scrollParent.scrollLeft += this.scrollSpeed.x;\n            this.scrollParent.scrollTop += this.scrollSpeed.y;\n        }\n        else {\n            this.view.win.scrollBy(this.scrollSpeed.x, this.scrollSpeed.y);\n        }\n        if (this.dragging === false)\n            this.select(this.lastEvent);\n    }\n    skipAtoms(sel) {\n        let ranges = null;\n        for (let i = 0; i < sel.ranges.length; i++) {\n            let range = sel.ranges[i], updated = null;\n            if (range.empty) {\n                let pos = skipAtomicRanges(this.atoms, range.from, 0);\n                if (pos != range.from)\n                    updated = EditorSelection.cursor(pos, -1);\n            }\n            else {\n                let from = skipAtomicRanges(this.atoms, range.from, -1);\n                let to = skipAtomicRanges(this.atoms, range.to, 1);\n                if (from != range.from || to != range.to)\n                    updated = EditorSelection.range(range.from == range.anchor ? from : to, range.from == range.head ? from : to);\n            }\n            if (updated) {\n                if (!ranges)\n                    ranges = sel.ranges.slice();\n                ranges[i] = updated;\n            }\n        }\n        return ranges ? EditorSelection.create(ranges, sel.mainIndex) : sel;\n    }\n    select(event) {\n        let { view } = this, selection = this.skipAtoms(this.style.get(event, this.extend, this.multiple));\n        if (this.mustSelect || !selection.eq(view.state.selection) ||\n            selection.main.assoc != view.state.selection.main.assoc)\n            this.view.dispatch({\n                selection,\n                userEvent: \"select.pointer\"\n            });\n        this.mustSelect = false;\n    }\n    update(update) {\n        if (update.docChanged && this.dragging)\n            this.dragging = this.dragging.map(update.changes);\n        if (this.style.update(update))\n            setTimeout(() => this.select(this.lastEvent), 20);\n    }\n}\nfunction addsSelectionRange(view, event) {\n    let facet = view.state.facet(clickAddsSelectionRange);\n    return facet.length ? facet[0](event) : browser.mac ? event.metaKey : event.ctrlKey;\n}\nfunction dragMovesSelection(view, event) {\n    let facet = view.state.facet(dragMovesSelection$1);\n    return facet.length ? facet[0](event) : browser.mac ? !event.altKey : !event.ctrlKey;\n}\nfunction isInPrimarySelection(view, event) {\n    let { main } = view.state.selection;\n    if (main.empty)\n        return false;\n    // On boundary clicks, check whether the coordinates are inside the\n    // selection's client rectangles\n    let sel = getSelection(view.root);\n    if (!sel || sel.rangeCount == 0)\n        return true;\n    let rects = sel.getRangeAt(0).getClientRects();\n    for (let i = 0; i < rects.length; i++) {\n        let rect = rects[i];\n        if (rect.left <= event.clientX && rect.right >= event.clientX &&\n            rect.top <= event.clientY && rect.bottom >= event.clientY)\n            return true;\n    }\n    return false;\n}\nfunction eventBelongsToEditor(view, event) {\n    if (!event.bubbles)\n        return true;\n    if (event.defaultPrevented)\n        return false;\n    for (let node = event.target, cView; node != view.contentDOM; node = node.parentNode)\n        if (!node || node.nodeType == 11 || ((cView = ContentView.get(node)) && cView.ignoreEvent(event)))\n            return false;\n    return true;\n}\nconst handlers = /*@__PURE__*/Object.create(null);\nconst handlerOptions = /*@__PURE__*/Object.create(null);\n// This is very crude, but unfortunately both these browsers _pretend_\n// that they have a clipboard API—all the objects and methods are\n// there, they just don't work, and they are hard to test.\nconst brokenClipboardAPI = (browser.ie && browser.ie_version < 15) ||\n    (browser.ios && browser.webkit_version < 604);\nfunction capturePaste(view) {\n    let parent = view.dom.parentNode;\n    if (!parent)\n        return;\n    let target = parent.appendChild(document.createElement(\"textarea\"));\n    target.style.cssText = \"position: fixed; left: -10000px; top: 10px\";\n    target.focus();\n    setTimeout(() => {\n        view.focus();\n        target.remove();\n        doPaste(view, target.value);\n    }, 50);\n}\nfunction doPaste(view, input) {\n    let { state } = view, changes, i = 1, text = state.toText(input);\n    let byLine = text.lines == state.selection.ranges.length;\n    let linewise = lastLinewiseCopy != null && state.selection.ranges.every(r => r.empty) && lastLinewiseCopy == text.toString();\n    if (linewise) {\n        let lastLine = -1;\n        changes = state.changeByRange(range => {\n            let line = state.doc.lineAt(range.from);\n            if (line.from == lastLine)\n                return { range };\n            lastLine = line.from;\n            let insert = state.toText((byLine ? text.line(i++).text : input) + state.lineBreak);\n            return { changes: { from: line.from, insert },\n                range: EditorSelection.cursor(range.from + insert.length) };\n        });\n    }\n    else if (byLine) {\n        changes = state.changeByRange(range => {\n            let line = text.line(i++);\n            return { changes: { from: range.from, to: range.to, insert: line.text },\n                range: EditorSelection.cursor(range.from + line.length) };\n        });\n    }\n    else {\n        changes = state.replaceSelection(text);\n    }\n    view.dispatch(changes, {\n        userEvent: \"input.paste\",\n        scrollIntoView: true\n    });\n}\nhandlers.keydown = (view, event) => {\n    view.inputState.setSelectionOrigin(\"select\");\n    if (event.keyCode == 27)\n        view.inputState.lastEscPress = Date.now();\n};\nhandlers.touchstart = (view, e) => {\n    view.inputState.lastTouchTime = Date.now();\n    view.inputState.setSelectionOrigin(\"select.pointer\");\n};\nhandlers.touchmove = view => {\n    view.inputState.setSelectionOrigin(\"select.pointer\");\n};\nhandlerOptions.touchstart = handlerOptions.touchmove = { passive: true };\nhandlers.mousedown = (view, event) => {\n    view.observer.flush();\n    if (view.inputState.lastTouchTime > Date.now() - 2000)\n        return; // Ignore touch interaction\n    let style = null;\n    for (let makeStyle of view.state.facet(mouseSelectionStyle)) {\n        style = makeStyle(view, event);\n        if (style)\n            break;\n    }\n    if (!style && event.button == 0)\n        style = basicMouseSelection(view, event);\n    if (style) {\n        let mustFocus = !view.hasFocus;\n        view.inputState.startMouseSelection(new MouseSelection(view, event, style, mustFocus));\n        if (mustFocus)\n            view.observer.ignore(() => focusPreventScroll(view.contentDOM));\n        if (view.inputState.mouseSelection)\n            view.inputState.mouseSelection.start(event);\n    }\n};\nfunction rangeForClick(view, pos, bias, type) {\n    if (type == 1) { // Single click\n        return EditorSelection.cursor(pos, bias);\n    }\n    else if (type == 2) { // Double click\n        return groupAt(view.state, pos, bias);\n    }\n    else { // Triple click\n        let visual = LineView.find(view.docView, pos), line = view.state.doc.lineAt(visual ? visual.posAtEnd : pos);\n        let from = visual ? visual.posAtStart : line.from, to = visual ? visual.posAtEnd : line.to;\n        if (to < view.state.doc.length && to == line.to)\n            to++;\n        return EditorSelection.range(from, to);\n    }\n}\nlet insideY = (y, rect) => y >= rect.top && y <= rect.bottom;\nlet inside = (x, y, rect) => insideY(y, rect) && x >= rect.left && x <= rect.right;\n// Try to determine, for the given coordinates, associated with the\n// given position, whether they are related to the element before or\n// the element after the position.\nfunction findPositionSide(view, pos, x, y) {\n    let line = LineView.find(view.docView, pos);\n    if (!line)\n        return 1;\n    let off = pos - line.posAtStart;\n    // Line boundaries point into the line\n    if (off == 0)\n        return 1;\n    if (off == line.length)\n        return -1;\n    // Positions on top of an element point at that element\n    let before = line.coordsAt(off, -1);\n    if (before && inside(x, y, before))\n        return -1;\n    let after = line.coordsAt(off, 1);\n    if (after && inside(x, y, after))\n        return 1;\n    // This is probably a line wrap point. Pick before if the point is\n    // beside it.\n    return before && insideY(y, before) ? -1 : 1;\n}\nfunction queryPos(view, event) {\n    let pos = view.posAtCoords({ x: event.clientX, y: event.clientY }, false);\n    return { pos, bias: findPositionSide(view, pos, event.clientX, event.clientY) };\n}\nconst BadMouseDetail = browser.ie && browser.ie_version <= 11;\nlet lastMouseDown = null, lastMouseDownCount = 0, lastMouseDownTime = 0;\nfunction getClickType(event) {\n    if (!BadMouseDetail)\n        return event.detail;\n    let last = lastMouseDown, lastTime = lastMouseDownTime;\n    lastMouseDown = event;\n    lastMouseDownTime = Date.now();\n    return lastMouseDownCount = !last || (lastTime > Date.now() - 400 && Math.abs(last.clientX - event.clientX) < 2 &&\n        Math.abs(last.clientY - event.clientY) < 2) ? (lastMouseDownCount + 1) % 3 : 1;\n}\nfunction basicMouseSelection(view, event) {\n    let start = queryPos(view, event), type = getClickType(event);\n    let startSel = view.state.selection;\n    return {\n        update(update) {\n            if (update.docChanged) {\n                start.pos = update.changes.mapPos(start.pos);\n                startSel = startSel.map(update.changes);\n            }\n        },\n        get(event, extend, multiple) {\n            let cur = queryPos(view, event), removed;\n            let range = rangeForClick(view, cur.pos, cur.bias, type);\n            if (start.pos != cur.pos && !extend) {\n                let startRange = rangeForClick(view, start.pos, start.bias, type);\n                let from = Math.min(startRange.from, range.from), to = Math.max(startRange.to, range.to);\n                range = from < range.from ? EditorSelection.range(from, to) : EditorSelection.range(to, from);\n            }\n            if (extend)\n                return startSel.replaceRange(startSel.main.extend(range.from, range.to));\n            else if (multiple && type == 1 && startSel.ranges.length > 1 && (removed = removeRangeAround(startSel, cur.pos)))\n                return removed;\n            else if (multiple)\n                return startSel.addRange(range);\n            else\n                return EditorSelection.create([range]);\n        }\n    };\n}\nfunction removeRangeAround(sel, pos) {\n    for (let i = 0; i < sel.ranges.length; i++) {\n        let { from, to } = sel.ranges[i];\n        if (from <= pos && to >= pos)\n            return EditorSelection.create(sel.ranges.slice(0, i).concat(sel.ranges.slice(i + 1)), sel.mainIndex == i ? 0 : sel.mainIndex - (sel.mainIndex > i ? 1 : 0));\n    }\n    return null;\n}\nhandlers.dragstart = (view, event) => {\n    let { selection: { main } } = view.state;\n    let { mouseSelection } = view.inputState;\n    if (mouseSelection)\n        mouseSelection.dragging = main;\n    if (event.dataTransfer) {\n        event.dataTransfer.setData(\"Text\", view.state.sliceDoc(main.from, main.to));\n        event.dataTransfer.effectAllowed = \"copyMove\";\n    }\n};\nfunction dropText(view, event, text, direct) {\n    if (!text)\n        return;\n    let dropPos = view.posAtCoords({ x: event.clientX, y: event.clientY }, false);\n    event.preventDefault();\n    let { mouseSelection } = view.inputState;\n    let del = direct && mouseSelection && mouseSelection.dragging && dragMovesSelection(view, event) ?\n        { from: mouseSelection.dragging.from, to: mouseSelection.dragging.to } : null;\n    let ins = { from: dropPos, insert: text };\n    let changes = view.state.changes(del ? [del, ins] : ins);\n    view.focus();\n    view.dispatch({\n        changes,\n        selection: { anchor: changes.mapPos(dropPos, -1), head: changes.mapPos(dropPos, 1) },\n        userEvent: del ? \"move.drop\" : \"input.drop\"\n    });\n}\nhandlers.drop = (view, event) => {\n    if (!event.dataTransfer)\n        return;\n    if (view.state.readOnly)\n        return event.preventDefault();\n    let files = event.dataTransfer.files;\n    if (files && files.length) { // For a file drop, read the file's text.\n        event.preventDefault();\n        let text = Array(files.length), read = 0;\n        let finishFile = () => {\n            if (++read == files.length)\n                dropText(view, event, text.filter(s => s != null).join(view.state.lineBreak), false);\n        };\n        for (let i = 0; i < files.length; i++) {\n            let reader = new FileReader;\n            reader.onerror = finishFile;\n            reader.onload = () => {\n                if (!/[\\x00-\\x08\\x0e-\\x1f]{2}/.test(reader.result))\n                    text[i] = reader.result;\n                finishFile();\n            };\n            reader.readAsText(files[i]);\n        }\n    }\n    else {\n        dropText(view, event, event.dataTransfer.getData(\"Text\"), true);\n    }\n};\nhandlers.paste = (view, event) => {\n    if (view.state.readOnly)\n        return event.preventDefault();\n    view.observer.flush();\n    let data = brokenClipboardAPI ? null : event.clipboardData;\n    if (data) {\n        doPaste(view, data.getData(\"text/plain\") || data.getData(\"text/uri-text\"));\n        event.preventDefault();\n    }\n    else {\n        capturePaste(view);\n    }\n};\nfunction captureCopy(view, text) {\n    // The extra wrapper is somehow necessary on IE/Edge to prevent the\n    // content from being mangled when it is put onto the clipboard\n    let parent = view.dom.parentNode;\n    if (!parent)\n        return;\n    let target = parent.appendChild(document.createElement(\"textarea\"));\n    target.style.cssText = \"position: fixed; left: -10000px; top: 10px\";\n    target.value = text;\n    target.focus();\n    target.selectionEnd = text.length;\n    target.selectionStart = 0;\n    setTimeout(() => {\n        target.remove();\n        view.focus();\n    }, 50);\n}\nfunction copiedRange(state) {\n    let content = [], ranges = [], linewise = false;\n    for (let range of state.selection.ranges)\n        if (!range.empty) {\n            content.push(state.sliceDoc(range.from, range.to));\n            ranges.push(range);\n        }\n    if (!content.length) {\n        // Nothing selected, do a line-wise copy\n        let upto = -1;\n        for (let { from } of state.selection.ranges) {\n            let line = state.doc.lineAt(from);\n            if (line.number > upto) {\n                content.push(line.text);\n                ranges.push({ from: line.from, to: Math.min(state.doc.length, line.to + 1) });\n            }\n            upto = line.number;\n        }\n        linewise = true;\n    }\n    return { text: content.join(state.lineBreak), ranges, linewise };\n}\nlet lastLinewiseCopy = null;\nhandlers.copy = handlers.cut = (view, event) => {\n    let { text, ranges, linewise } = copiedRange(view.state);\n    if (!text && !linewise)\n        return;\n    lastLinewiseCopy = linewise ? text : null;\n    let data = brokenClipboardAPI ? null : event.clipboardData;\n    if (data) {\n        event.preventDefault();\n        data.clearData();\n        data.setData(\"text/plain\", text);\n    }\n    else {\n        captureCopy(view, text);\n    }\n    if (event.type == \"cut\" && !view.state.readOnly)\n        view.dispatch({\n            changes: ranges,\n            scrollIntoView: true,\n            userEvent: \"delete.cut\"\n        });\n};\nconst isFocusChange = /*@__PURE__*/Annotation.define();\nfunction focusChangeTransaction(state, focus) {\n    let effects = [];\n    for (let getEffect of state.facet(focusChangeEffect)) {\n        let effect = getEffect(state, focus);\n        if (effect)\n            effects.push(effect);\n    }\n    return effects ? state.update({ effects, annotations: isFocusChange.of(true) }) : null;\n}\nfunction updateForFocusChange(view) {\n    setTimeout(() => {\n        let focus = view.hasFocus;\n        if (focus != view.inputState.notifiedFocused) {\n            let tr = focusChangeTransaction(view.state, focus);\n            if (tr)\n                view.dispatch(tr);\n            else\n                view.update([]);\n        }\n    }, 10);\n}\nhandlers.focus = view => {\n    view.inputState.lastFocusTime = Date.now();\n    // When focusing reset the scroll position, move it back to where it was\n    if (!view.scrollDOM.scrollTop && (view.inputState.lastScrollTop || view.inputState.lastScrollLeft)) {\n        view.scrollDOM.scrollTop = view.inputState.lastScrollTop;\n        view.scrollDOM.scrollLeft = view.inputState.lastScrollLeft;\n    }\n    updateForFocusChange(view);\n};\nhandlers.blur = view => {\n    view.observer.clearSelectionRange();\n    updateForFocusChange(view);\n};\nhandlers.compositionstart = handlers.compositionupdate = view => {\n    if (view.inputState.compositionFirstChange == null)\n        view.inputState.compositionFirstChange = true;\n    if (view.inputState.composing < 0) {\n        // FIXME possibly set a timeout to clear it again on Android\n        view.inputState.composing = 0;\n    }\n};\nhandlers.compositionend = view => {\n    view.inputState.composing = -1;\n    view.inputState.compositionEndedAt = Date.now();\n    view.inputState.compositionPendingKey = true;\n    view.inputState.compositionPendingChange = view.observer.pendingRecords().length > 0;\n    view.inputState.compositionFirstChange = null;\n    if (browser.chrome && browser.android) {\n        // Delay flushing for a bit on Android because it'll often fire a\n        // bunch of contradictory changes in a row at end of compositon\n        view.observer.flushSoon();\n    }\n    else if (view.inputState.compositionPendingChange) {\n        // If we found pending records, schedule a flush.\n        Promise.resolve().then(() => view.observer.flush());\n    }\n    else {\n        // Otherwise, make sure that, if no changes come in soon, the\n        // composition view is cleared.\n        setTimeout(() => {\n            if (view.inputState.composing < 0 && view.docView.compositionDeco.size)\n                view.update([]);\n        }, 50);\n    }\n};\nhandlers.contextmenu = view => {\n    view.inputState.lastContextMenu = Date.now();\n};\nhandlers.beforeinput = (view, event) => {\n    var _a;\n    // Because Chrome Android doesn't fire useful key events, use\n    // beforeinput to detect backspace (and possibly enter and delete,\n    // but those usually don't even seem to fire beforeinput events at\n    // the moment) and fake a key event for it.\n    //\n    // (preventDefault on beforeinput, though supported in the spec,\n    // seems to do nothing at all on Chrome).\n    let pending;\n    if (browser.chrome && browser.android && (pending = PendingKeys.find(key => key.inputType == event.inputType))) {\n        view.observer.delayAndroidKey(pending.key, pending.keyCode);\n        if (pending.key == \"Backspace\" || pending.key == \"Delete\") {\n            let startViewHeight = ((_a = window.visualViewport) === null || _a === void 0 ? void 0 : _a.height) || 0;\n            setTimeout(() => {\n                var _a;\n                // Backspacing near uneditable nodes on Chrome Android sometimes\n                // closes the virtual keyboard. This tries to crudely detect\n                // that and refocus to get it back.\n                if ((((_a = window.visualViewport) === null || _a === void 0 ? void 0 : _a.height) || 0) > startViewHeight + 10 && view.hasFocus) {\n                    view.contentDOM.blur();\n                    view.focus();\n                }\n            }, 100);\n        }\n    }\n};\n\nconst wrappingWhiteSpace = [\"pre-wrap\", \"normal\", \"pre-line\", \"break-spaces\"];\nclass HeightOracle {\n    constructor(lineWrapping) {\n        this.lineWrapping = lineWrapping;\n        this.doc = Text.empty;\n        this.heightSamples = {};\n        this.lineHeight = 14; // The height of an entire line (line-height)\n        this.charWidth = 7;\n        this.textHeight = 14; // The height of the actual font (font-size)\n        this.lineLength = 30;\n        // Used to track, during updateHeight, if any actual heights changed\n        this.heightChanged = false;\n    }\n    heightForGap(from, to) {\n        let lines = this.doc.lineAt(to).number - this.doc.lineAt(from).number + 1;\n        if (this.lineWrapping)\n            lines += Math.max(0, Math.ceil(((to - from) - (lines * this.lineLength * 0.5)) / this.lineLength));\n        return this.lineHeight * lines;\n    }\n    heightForLine(length) {\n        if (!this.lineWrapping)\n            return this.lineHeight;\n        let lines = 1 + Math.max(0, Math.ceil((length - this.lineLength) / (this.lineLength - 5)));\n        return lines * this.lineHeight;\n    }\n    setDoc(doc) { this.doc = doc; return this; }\n    mustRefreshForWrapping(whiteSpace) {\n        return (wrappingWhiteSpace.indexOf(whiteSpace) > -1) != this.lineWrapping;\n    }\n    mustRefreshForHeights(lineHeights) {\n        let newHeight = false;\n        for (let i = 0; i < lineHeights.length; i++) {\n            let h = lineHeights[i];\n            if (h < 0) {\n                i++;\n            }\n            else if (!this.heightSamples[Math.floor(h * 10)]) { // Round to .1 pixels\n                newHeight = true;\n                this.heightSamples[Math.floor(h * 10)] = true;\n            }\n        }\n        return newHeight;\n    }\n    refresh(whiteSpace, lineHeight, charWidth, textHeight, lineLength, knownHeights) {\n        let lineWrapping = wrappingWhiteSpace.indexOf(whiteSpace) > -1;\n        let changed = Math.round(lineHeight) != Math.round(this.lineHeight) || this.lineWrapping != lineWrapping;\n        this.lineWrapping = lineWrapping;\n        this.lineHeight = lineHeight;\n        this.charWidth = charWidth;\n        this.textHeight = textHeight;\n        this.lineLength = lineLength;\n        if (changed) {\n            this.heightSamples = {};\n            for (let i = 0; i < knownHeights.length; i++) {\n                let h = knownHeights[i];\n                if (h < 0)\n                    i++;\n                else\n                    this.heightSamples[Math.floor(h * 10)] = true;\n            }\n        }\n        return changed;\n    }\n}\n// This object is used by `updateHeight` to make DOM measurements\n// arrive at the right nides. The `heights` array is a sequence of\n// block heights, starting from position `from`.\nclass MeasuredHeights {\n    constructor(from, heights) {\n        this.from = from;\n        this.heights = heights;\n        this.index = 0;\n    }\n    get more() { return this.index < this.heights.length; }\n}\n/**\nRecord used to represent information about a block-level element\nin the editor view.\n*/\nclass BlockInfo {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    The start of the element in the document.\n    */\n    from, \n    /**\n    The length of the element.\n    */\n    length, \n    /**\n    The top position of the element (relative to the top of the\n    document).\n    */\n    top, \n    /**\n    Its height.\n    */\n    height, \n    /**\n    @internal Weird packed field that holds an array of children\n    for composite blocks, a decoration for block widgets, and a\n    number indicating the amount of widget-create line breaks for\n    text blocks.\n    */\n    _content) {\n        this.from = from;\n        this.length = length;\n        this.top = top;\n        this.height = height;\n        this._content = _content;\n    }\n    /**\n    The type of element this is. When querying lines, this may be\n    an array of all the blocks that make up the line.\n    */\n    get type() {\n        return typeof this._content == \"number\" ? BlockType.Text :\n            Array.isArray(this._content) ? this._content : this._content.type;\n    }\n    /**\n    The end of the element as a document position.\n    */\n    get to() { return this.from + this.length; }\n    /**\n    The bottom position of the element.\n    */\n    get bottom() { return this.top + this.height; }\n    /**\n    If this is a widget block, this will return the widget\n    associated with it.\n    */\n    get widget() {\n        return this._content instanceof PointDecoration ? this._content.widget : null;\n    }\n    /**\n    If this is a textblock, this holds the number of line breaks\n    that appear in widgets inside the block.\n    */\n    get widgetLineBreaks() {\n        return typeof this._content == \"number\" ? this._content : 0;\n    }\n    /**\n    @internal\n    */\n    join(other) {\n        let content = (Array.isArray(this._content) ? this._content : [this])\n            .concat(Array.isArray(other._content) ? other._content : [other]);\n        return new BlockInfo(this.from, this.length + other.length, this.top, this.height + other.height, content);\n    }\n}\nvar QueryType = /*@__PURE__*/(function (QueryType) {\n    QueryType[QueryType[\"ByPos\"] = 0] = \"ByPos\";\n    QueryType[QueryType[\"ByHeight\"] = 1] = \"ByHeight\";\n    QueryType[QueryType[\"ByPosNoHeight\"] = 2] = \"ByPosNoHeight\";\nreturn QueryType})(QueryType || (QueryType = {}));\nconst Epsilon = 1e-3;\nclass HeightMap {\n    constructor(length, // The number of characters covered\n    height, // Height of this part of the document\n    flags = 2 /* Outdated */) {\n        this.length = length;\n        this.height = height;\n        this.flags = flags;\n    }\n    get outdated() { return (this.flags & 2 /* Outdated */) > 0; }\n    set outdated(value) { this.flags = (value ? 2 /* Outdated */ : 0) | (this.flags & ~2 /* Outdated */); }\n    setHeight(oracle, height) {\n        if (this.height != height) {\n            if (Math.abs(this.height - height) > Epsilon)\n                oracle.heightChanged = true;\n            this.height = height;\n        }\n    }\n    // Base case is to replace a leaf node, which simply builds a tree\n    // from the new nodes and returns that (HeightMapBranch and\n    // HeightMapGap override this to actually use from/to)\n    replace(_from, _to, nodes) {\n        return HeightMap.of(nodes);\n    }\n    // Again, these are base cases, and are overridden for branch and gap nodes.\n    decomposeLeft(_to, result) { result.push(this); }\n    decomposeRight(_from, result) { result.push(this); }\n    applyChanges(decorations, oldDoc, oracle, changes) {\n        let me = this, doc = oracle.doc;\n        for (let i = changes.length - 1; i >= 0; i--) {\n            let { fromA, toA, fromB, toB } = changes[i];\n            let start = me.lineAt(fromA, QueryType.ByPosNoHeight, oracle.setDoc(oldDoc), 0, 0);\n            let end = start.to >= toA ? start : me.lineAt(toA, QueryType.ByPosNoHeight, oracle, 0, 0);\n            toB += end.to - toA;\n            toA = end.to;\n            while (i > 0 && start.from <= changes[i - 1].toA) {\n                fromA = changes[i - 1].fromA;\n                fromB = changes[i - 1].fromB;\n                i--;\n                if (fromA < start.from)\n                    start = me.lineAt(fromA, QueryType.ByPosNoHeight, oracle, 0, 0);\n            }\n            fromB += start.from - fromA;\n            fromA = start.from;\n            let nodes = NodeBuilder.build(oracle.setDoc(doc), decorations, fromB, toB);\n            me = me.replace(fromA, toA, nodes);\n        }\n        return me.updateHeight(oracle, 0);\n    }\n    static empty() { return new HeightMapText(0, 0); }\n    // nodes uses null values to indicate the position of line breaks.\n    // There are never line breaks at the start or end of the array, or\n    // two line breaks next to each other, and the array isn't allowed\n    // to be empty (same restrictions as return value from the builder).\n    static of(nodes) {\n        if (nodes.length == 1)\n            return nodes[0];\n        let i = 0, j = nodes.length, before = 0, after = 0;\n        for (;;) {\n            if (i == j) {\n                if (before > after * 2) {\n                    let split = nodes[i - 1];\n                    if (split.break)\n                        nodes.splice(--i, 1, split.left, null, split.right);\n                    else\n                        nodes.splice(--i, 1, split.left, split.right);\n                    j += 1 + split.break;\n                    before -= split.size;\n                }\n                else if (after > before * 2) {\n                    let split = nodes[j];\n                    if (split.break)\n                        nodes.splice(j, 1, split.left, null, split.right);\n                    else\n                        nodes.splice(j, 1, split.left, split.right);\n                    j += 2 + split.break;\n                    after -= split.size;\n                }\n                else {\n                    break;\n                }\n            }\n            else if (before < after) {\n                let next = nodes[i++];\n                if (next)\n                    before += next.size;\n            }\n            else {\n                let next = nodes[--j];\n                if (next)\n                    after += next.size;\n            }\n        }\n        let brk = 0;\n        if (nodes[i - 1] == null) {\n            brk = 1;\n            i--;\n        }\n        else if (nodes[i] == null) {\n            brk = 1;\n            j++;\n        }\n        return new HeightMapBranch(HeightMap.of(nodes.slice(0, i)), brk, HeightMap.of(nodes.slice(j)));\n    }\n}\nHeightMap.prototype.size = 1;\nclass HeightMapBlock extends HeightMap {\n    constructor(length, height, deco) {\n        super(length, height);\n        this.deco = deco;\n    }\n    blockAt(_height, _oracle, top, offset) {\n        return new BlockInfo(offset, this.length, top, this.height, this.deco || 0);\n    }\n    lineAt(_value, _type, oracle, top, offset) {\n        return this.blockAt(0, oracle, top, offset);\n    }\n    forEachLine(from, to, oracle, top, offset, f) {\n        if (from <= offset + this.length && to >= offset)\n            f(this.blockAt(0, oracle, top, offset));\n    }\n    updateHeight(oracle, offset = 0, _force = false, measured) {\n        if (measured && measured.from <= offset && measured.more)\n            this.setHeight(oracle, measured.heights[measured.index++]);\n        this.outdated = false;\n        return this;\n    }\n    toString() { return `block(${this.length})`; }\n}\nclass HeightMapText extends HeightMapBlock {\n    constructor(length, height) {\n        super(length, height, null);\n        this.collapsed = 0; // Amount of collapsed content in the line\n        this.widgetHeight = 0; // Maximum inline widget height\n        this.breaks = 0; // Number of widget-introduced line breaks on the line\n    }\n    blockAt(_height, _oracle, top, offset) {\n        return new BlockInfo(offset, this.length, top, this.height, this.breaks);\n    }\n    replace(_from, _to, nodes) {\n        let node = nodes[0];\n        if (nodes.length == 1 && (node instanceof HeightMapText || node instanceof HeightMapGap && (node.flags & 4 /* SingleLine */)) &&\n            Math.abs(this.length - node.length) < 10) {\n            if (node instanceof HeightMapGap)\n                node = new HeightMapText(node.length, this.height);\n            else\n                node.height = this.height;\n            if (!this.outdated)\n                node.outdated = false;\n            return node;\n        }\n        else {\n            return HeightMap.of(nodes);\n        }\n    }\n    updateHeight(oracle, offset = 0, force = false, measured) {\n        if (measured && measured.from <= offset && measured.more)\n            this.setHeight(oracle, measured.heights[measured.index++]);\n        else if (force || this.outdated)\n            this.setHeight(oracle, Math.max(this.widgetHeight, oracle.heightForLine(this.length - this.collapsed)) +\n                this.breaks * oracle.lineHeight);\n        this.outdated = false;\n        return this;\n    }\n    toString() {\n        return `line(${this.length}${this.collapsed ? -this.collapsed : \"\"}${this.widgetHeight ? \":\" + this.widgetHeight : \"\"})`;\n    }\n}\nclass HeightMapGap extends HeightMap {\n    constructor(length) { super(length, 0); }\n    heightMetrics(oracle, offset) {\n        let firstLine = oracle.doc.lineAt(offset).number, lastLine = oracle.doc.lineAt(offset + this.length).number;\n        let lines = lastLine - firstLine + 1;\n        let perLine, perChar = 0;\n        if (oracle.lineWrapping) {\n            let totalPerLine = Math.min(this.height, oracle.lineHeight * lines);\n            perLine = totalPerLine / lines;\n            if (this.length > lines + 1)\n                perChar = (this.height - totalPerLine) / (this.length - lines - 1);\n        }\n        else {\n            perLine = this.height / lines;\n        }\n        return { firstLine, lastLine, perLine, perChar };\n    }\n    blockAt(height, oracle, top, offset) {\n        let { firstLine, lastLine, perLine, perChar } = this.heightMetrics(oracle, offset);\n        if (oracle.lineWrapping) {\n            let guess = offset + Math.round(Math.max(0, Math.min(1, (height - top) / this.height)) * this.length);\n            let line = oracle.doc.lineAt(guess), lineHeight = perLine + line.length * perChar;\n            let lineTop = Math.max(top, height - lineHeight / 2);\n            return new BlockInfo(line.from, line.length, lineTop, lineHeight, 0);\n        }\n        else {\n            let line = Math.max(0, Math.min(lastLine - firstLine, Math.floor((height - top) / perLine)));\n            let { from, length } = oracle.doc.line(firstLine + line);\n            return new BlockInfo(from, length, top + perLine * line, perLine, 0);\n        }\n    }\n    lineAt(value, type, oracle, top, offset) {\n        if (type == QueryType.ByHeight)\n            return this.blockAt(value, oracle, top, offset);\n        if (type == QueryType.ByPosNoHeight) {\n            let { from, to } = oracle.doc.lineAt(value);\n            return new BlockInfo(from, to - from, 0, 0, 0);\n        }\n        let { firstLine, perLine, perChar } = this.heightMetrics(oracle, offset);\n        let line = oracle.doc.lineAt(value), lineHeight = perLine + line.length * perChar;\n        let linesAbove = line.number - firstLine;\n        let lineTop = top + perLine * linesAbove + perChar * (line.from - offset - linesAbove);\n        return new BlockInfo(line.from, line.length, Math.max(top, Math.min(lineTop, top + this.height - lineHeight)), lineHeight, 0);\n    }\n    forEachLine(from, to, oracle, top, offset, f) {\n        from = Math.max(from, offset);\n        to = Math.min(to, offset + this.length);\n        let { firstLine, perLine, perChar } = this.heightMetrics(oracle, offset);\n        for (let pos = from, lineTop = top; pos <= to;) {\n            let line = oracle.doc.lineAt(pos);\n            if (pos == from) {\n                let linesAbove = line.number - firstLine;\n                lineTop += perLine * linesAbove + perChar * (from - offset - linesAbove);\n            }\n            let lineHeight = perLine + perChar * line.length;\n            f(new BlockInfo(line.from, line.length, lineTop, lineHeight, 0));\n            lineTop += lineHeight;\n            pos = line.to + 1;\n        }\n    }\n    replace(from, to, nodes) {\n        let after = this.length - to;\n        if (after > 0) {\n            let last = nodes[nodes.length - 1];\n            if (last instanceof HeightMapGap)\n                nodes[nodes.length - 1] = new HeightMapGap(last.length + after);\n            else\n                nodes.push(null, new HeightMapGap(after - 1));\n        }\n        if (from > 0) {\n            let first = nodes[0];\n            if (first instanceof HeightMapGap)\n                nodes[0] = new HeightMapGap(from + first.length);\n            else\n                nodes.unshift(new HeightMapGap(from - 1), null);\n        }\n        return HeightMap.of(nodes);\n    }\n    decomposeLeft(to, result) {\n        result.push(new HeightMapGap(to - 1), null);\n    }\n    decomposeRight(from, result) {\n        result.push(null, new HeightMapGap(this.length - from - 1));\n    }\n    updateHeight(oracle, offset = 0, force = false, measured) {\n        let end = offset + this.length;\n        if (measured && measured.from <= offset + this.length && measured.more) {\n            // Fill in part of this gap with measured lines. We know there\n            // can't be widgets or collapsed ranges in those lines, because\n            // they would already have been added to the heightmap (gaps\n            // only contain plain text).\n            let nodes = [], pos = Math.max(offset, measured.from), singleHeight = -1;\n            if (measured.from > offset)\n                nodes.push(new HeightMapGap(measured.from - offset - 1).updateHeight(oracle, offset));\n            while (pos <= end && measured.more) {\n                let len = oracle.doc.lineAt(pos).length;\n                if (nodes.length)\n                    nodes.push(null);\n                let height = measured.heights[measured.index++];\n                if (singleHeight == -1)\n                    singleHeight = height;\n                else if (Math.abs(height - singleHeight) >= Epsilon)\n                    singleHeight = -2;\n                let line = new HeightMapText(len, height);\n                line.outdated = false;\n                nodes.push(line);\n                pos += len + 1;\n            }\n            if (pos <= end)\n                nodes.push(null, new HeightMapGap(end - pos).updateHeight(oracle, pos));\n            let result = HeightMap.of(nodes);\n            if (singleHeight < 0 || Math.abs(result.height - this.height) >= Epsilon ||\n                Math.abs(singleHeight - this.heightMetrics(oracle, offset).perLine) >= Epsilon)\n                oracle.heightChanged = true;\n            return result;\n        }\n        else if (force || this.outdated) {\n            this.setHeight(oracle, oracle.heightForGap(offset, offset + this.length));\n            this.outdated = false;\n        }\n        return this;\n    }\n    toString() { return `gap(${this.length})`; }\n}\nclass HeightMapBranch extends HeightMap {\n    constructor(left, brk, right) {\n        super(left.length + brk + right.length, left.height + right.height, brk | (left.outdated || right.outdated ? 2 /* Outdated */ : 0));\n        this.left = left;\n        this.right = right;\n        this.size = left.size + right.size;\n    }\n    get break() { return this.flags & 1 /* Break */; }\n    blockAt(height, oracle, top, offset) {\n        let mid = top + this.left.height;\n        return height < mid ? this.left.blockAt(height, oracle, top, offset)\n            : this.right.blockAt(height, oracle, mid, offset + this.left.length + this.break);\n    }\n    lineAt(value, type, oracle, top, offset) {\n        let rightTop = top + this.left.height, rightOffset = offset + this.left.length + this.break;\n        let left = type == QueryType.ByHeight ? value < rightTop : value < rightOffset;\n        let base = left ? this.left.lineAt(value, type, oracle, top, offset)\n            : this.right.lineAt(value, type, oracle, rightTop, rightOffset);\n        if (this.break || (left ? base.to < rightOffset : base.from > rightOffset))\n            return base;\n        let subQuery = type == QueryType.ByPosNoHeight ? QueryType.ByPosNoHeight : QueryType.ByPos;\n        if (left)\n            return base.join(this.right.lineAt(rightOffset, subQuery, oracle, rightTop, rightOffset));\n        else\n            return this.left.lineAt(rightOffset, subQuery, oracle, top, offset).join(base);\n    }\n    forEachLine(from, to, oracle, top, offset, f) {\n        let rightTop = top + this.left.height, rightOffset = offset + this.left.length + this.break;\n        if (this.break) {\n            if (from < rightOffset)\n                this.left.forEachLine(from, to, oracle, top, offset, f);\n            if (to >= rightOffset)\n                this.right.forEachLine(from, to, oracle, rightTop, rightOffset, f);\n        }\n        else {\n            let mid = this.lineAt(rightOffset, QueryType.ByPos, oracle, top, offset);\n            if (from < mid.from)\n                this.left.forEachLine(from, mid.from - 1, oracle, top, offset, f);\n            if (mid.to >= from && mid.from <= to)\n                f(mid);\n            if (to > mid.to)\n                this.right.forEachLine(mid.to + 1, to, oracle, rightTop, rightOffset, f);\n        }\n    }\n    replace(from, to, nodes) {\n        let rightStart = this.left.length + this.break;\n        if (to < rightStart)\n            return this.balanced(this.left.replace(from, to, nodes), this.right);\n        if (from > this.left.length)\n            return this.balanced(this.left, this.right.replace(from - rightStart, to - rightStart, nodes));\n        let result = [];\n        if (from > 0)\n            this.decomposeLeft(from, result);\n        let left = result.length;\n        for (let node of nodes)\n            result.push(node);\n        if (from > 0)\n            mergeGaps(result, left - 1);\n        if (to < this.length) {\n            let right = result.length;\n            this.decomposeRight(to, result);\n            mergeGaps(result, right);\n        }\n        return HeightMap.of(result);\n    }\n    decomposeLeft(to, result) {\n        let left = this.left.length;\n        if (to <= left)\n            return this.left.decomposeLeft(to, result);\n        result.push(this.left);\n        if (this.break) {\n            left++;\n            if (to >= left)\n                result.push(null);\n        }\n        if (to > left)\n            this.right.decomposeLeft(to - left, result);\n    }\n    decomposeRight(from, result) {\n        let left = this.left.length, right = left + this.break;\n        if (from >= right)\n            return this.right.decomposeRight(from - right, result);\n        if (from < left)\n            this.left.decomposeRight(from, result);\n        if (this.break && from < right)\n            result.push(null);\n        result.push(this.right);\n    }\n    balanced(left, right) {\n        if (left.size > 2 * right.size || right.size > 2 * left.size)\n            return HeightMap.of(this.break ? [left, null, right] : [left, right]);\n        this.left = left;\n        this.right = right;\n        this.height = left.height + right.height;\n        this.outdated = left.outdated || right.outdated;\n        this.size = left.size + right.size;\n        this.length = left.length + this.break + right.length;\n        return this;\n    }\n    updateHeight(oracle, offset = 0, force = false, measured) {\n        let { left, right } = this, rightStart = offset + left.length + this.break, rebalance = null;\n        if (measured && measured.from <= offset + left.length && measured.more)\n            rebalance = left = left.updateHeight(oracle, offset, force, measured);\n        else\n            left.updateHeight(oracle, offset, force);\n        if (measured && measured.from <= rightStart + right.length && measured.more)\n            rebalance = right = right.updateHeight(oracle, rightStart, force, measured);\n        else\n            right.updateHeight(oracle, rightStart, force);\n        if (rebalance)\n            return this.balanced(left, right);\n        this.height = this.left.height + this.right.height;\n        this.outdated = false;\n        return this;\n    }\n    toString() { return this.left + (this.break ? \" \" : \"-\") + this.right; }\n}\nfunction mergeGaps(nodes, around) {\n    let before, after;\n    if (nodes[around] == null &&\n        (before = nodes[around - 1]) instanceof HeightMapGap &&\n        (after = nodes[around + 1]) instanceof HeightMapGap)\n        nodes.splice(around - 1, 3, new HeightMapGap(before.length + 1 + after.length));\n}\nconst relevantWidgetHeight = 5;\nclass NodeBuilder {\n    constructor(pos, oracle) {\n        this.pos = pos;\n        this.oracle = oracle;\n        this.nodes = [];\n        this.lineStart = -1;\n        this.lineEnd = -1;\n        this.covering = null;\n        this.writtenTo = pos;\n    }\n    get isCovered() {\n        return this.covering && this.nodes[this.nodes.length - 1] == this.covering;\n    }\n    span(_from, to) {\n        if (this.lineStart > -1) {\n            let end = Math.min(to, this.lineEnd), last = this.nodes[this.nodes.length - 1];\n            if (last instanceof HeightMapText)\n                last.length += end - this.pos;\n            else if (end > this.pos || !this.isCovered)\n                this.nodes.push(new HeightMapText(end - this.pos, -1));\n            this.writtenTo = end;\n            if (to > end) {\n                this.nodes.push(null);\n                this.writtenTo++;\n                this.lineStart = -1;\n            }\n        }\n        this.pos = to;\n    }\n    point(from, to, deco) {\n        if (from < to || deco.heightRelevant) {\n            let height = deco.widget ? deco.widget.estimatedHeight : 0;\n            let breaks = deco.widget ? deco.widget.lineBreaks : 0;\n            if (height < 0)\n                height = this.oracle.lineHeight;\n            let len = to - from;\n            if (deco.block) {\n                this.addBlock(new HeightMapBlock(len, height, deco));\n            }\n            else if (len || breaks || height >= relevantWidgetHeight) {\n                this.addLineDeco(height, breaks, len);\n            }\n        }\n        else if (to > from) {\n            this.span(from, to);\n        }\n        if (this.lineEnd > -1 && this.lineEnd < this.pos)\n            this.lineEnd = this.oracle.doc.lineAt(this.pos).to;\n    }\n    enterLine() {\n        if (this.lineStart > -1)\n            return;\n        let { from, to } = this.oracle.doc.lineAt(this.pos);\n        this.lineStart = from;\n        this.lineEnd = to;\n        if (this.writtenTo < from) {\n            if (this.writtenTo < from - 1 || this.nodes[this.nodes.length - 1] == null)\n                this.nodes.push(this.blankContent(this.writtenTo, from - 1));\n            this.nodes.push(null);\n        }\n        if (this.pos > from)\n            this.nodes.push(new HeightMapText(this.pos - from, -1));\n        this.writtenTo = this.pos;\n    }\n    blankContent(from, to) {\n        let gap = new HeightMapGap(to - from);\n        if (this.oracle.doc.lineAt(from).to == to)\n            gap.flags |= 4 /* SingleLine */;\n        return gap;\n    }\n    ensureLine() {\n        this.enterLine();\n        let last = this.nodes.length ? this.nodes[this.nodes.length - 1] : null;\n        if (last instanceof HeightMapText)\n            return last;\n        let line = new HeightMapText(0, -1);\n        this.nodes.push(line);\n        return line;\n    }\n    addBlock(block) {\n        var _a;\n        this.enterLine();\n        let type = (_a = block.deco) === null || _a === void 0 ? void 0 : _a.type;\n        if (type == BlockType.WidgetAfter && !this.isCovered)\n            this.ensureLine();\n        this.nodes.push(block);\n        this.writtenTo = this.pos = this.pos + block.length;\n        if (type != BlockType.WidgetBefore)\n            this.covering = block;\n    }\n    addLineDeco(height, breaks, length) {\n        let line = this.ensureLine();\n        line.length += length;\n        line.collapsed += length;\n        line.widgetHeight = Math.max(line.widgetHeight, height);\n        line.breaks += breaks;\n        this.writtenTo = this.pos = this.pos + length;\n    }\n    finish(from) {\n        let last = this.nodes.length == 0 ? null : this.nodes[this.nodes.length - 1];\n        if (this.lineStart > -1 && !(last instanceof HeightMapText) && !this.isCovered)\n            this.nodes.push(new HeightMapText(0, -1));\n        else if (this.writtenTo < this.pos || last == null)\n            this.nodes.push(this.blankContent(this.writtenTo, this.pos));\n        let pos = from;\n        for (let node of this.nodes) {\n            if (node instanceof HeightMapText)\n                node.updateHeight(this.oracle, pos);\n            pos += node ? node.length : 1;\n        }\n        return this.nodes;\n    }\n    // Always called with a region that on both sides either stretches\n    // to a line break or the end of the document.\n    // The returned array uses null to indicate line breaks, but never\n    // starts or ends in a line break, or has multiple line breaks next\n    // to each other.\n    static build(oracle, decorations, from, to) {\n        let builder = new NodeBuilder(from, oracle);\n        RangeSet.spans(decorations, from, to, builder, 0);\n        return builder.finish(from);\n    }\n}\nfunction heightRelevantDecoChanges(a, b, diff) {\n    let comp = new DecorationComparator;\n    RangeSet.compare(a, b, diff, comp, 0);\n    return comp.changes;\n}\nclass DecorationComparator {\n    constructor() {\n        this.changes = [];\n    }\n    compareRange() { }\n    comparePoint(from, to, a, b) {\n        if (from < to || a && a.heightRelevant || b && b.heightRelevant)\n            addRange(from, to, this.changes, 5);\n    }\n}\n\nfunction visiblePixelRange(dom, paddingTop) {\n    let rect = dom.getBoundingClientRect();\n    let doc = dom.ownerDocument, win = doc.defaultView || window;\n    let left = Math.max(0, rect.left), right = Math.min(win.innerWidth, rect.right);\n    let top = Math.max(0, rect.top), bottom = Math.min(win.innerHeight, rect.bottom);\n    for (let parent = dom.parentNode; parent && parent != doc.body;) {\n        if (parent.nodeType == 1) {\n            let elt = parent;\n            let style = window.getComputedStyle(elt);\n            if ((elt.scrollHeight > elt.clientHeight || elt.scrollWidth > elt.clientWidth) &&\n                style.overflow != \"visible\") {\n                let parentRect = elt.getBoundingClientRect();\n                left = Math.max(left, parentRect.left);\n                right = Math.min(right, parentRect.right);\n                top = Math.max(top, parentRect.top);\n                bottom = parent == dom.parentNode ? parentRect.bottom : Math.min(bottom, parentRect.bottom);\n            }\n            parent = style.position == \"absolute\" || style.position == \"fixed\" ? elt.offsetParent : elt.parentNode;\n        }\n        else if (parent.nodeType == 11) { // Shadow root\n            parent = parent.host;\n        }\n        else {\n            break;\n        }\n    }\n    return { left: left - rect.left, right: Math.max(left, right) - rect.left,\n        top: top - (rect.top + paddingTop), bottom: Math.max(top, bottom) - (rect.top + paddingTop) };\n}\nfunction fullPixelRange(dom, paddingTop) {\n    let rect = dom.getBoundingClientRect();\n    return { left: 0, right: rect.right - rect.left,\n        top: paddingTop, bottom: rect.bottom - (rect.top + paddingTop) };\n}\n// Line gaps are placeholder widgets used to hide pieces of overlong\n// lines within the viewport, as a kludge to keep the editor\n// responsive when a ridiculously long line is loaded into it.\nclass LineGap {\n    constructor(from, to, size) {\n        this.from = from;\n        this.to = to;\n        this.size = size;\n    }\n    static same(a, b) {\n        if (a.length != b.length)\n            return false;\n        for (let i = 0; i < a.length; i++) {\n            let gA = a[i], gB = b[i];\n            if (gA.from != gB.from || gA.to != gB.to || gA.size != gB.size)\n                return false;\n        }\n        return true;\n    }\n    draw(wrapping) {\n        return Decoration.replace({ widget: new LineGapWidget(this.size, wrapping) }).range(this.from, this.to);\n    }\n}\nclass LineGapWidget extends WidgetType {\n    constructor(size, vertical) {\n        super();\n        this.size = size;\n        this.vertical = vertical;\n    }\n    eq(other) { return other.size == this.size && other.vertical == this.vertical; }\n    toDOM() {\n        let elt = document.createElement(\"div\");\n        if (this.vertical) {\n            elt.style.height = this.size + \"px\";\n        }\n        else {\n            elt.style.width = this.size + \"px\";\n            elt.style.height = \"2px\";\n            elt.style.display = \"inline-block\";\n        }\n        return elt;\n    }\n    get estimatedHeight() { return this.vertical ? this.size : -1; }\n}\nclass ViewState {\n    constructor(state) {\n        this.state = state;\n        // These are contentDOM-local coordinates\n        this.pixelViewport = { left: 0, right: window.innerWidth, top: 0, bottom: 0 };\n        this.inView = true;\n        this.paddingTop = 0;\n        this.paddingBottom = 0;\n        this.contentDOMWidth = 0;\n        this.contentDOMHeight = 0;\n        this.editorHeight = 0;\n        this.editorWidth = 0;\n        this.scrollTop = 0;\n        this.scrolledToBottom = true;\n        // The vertical position (document-relative) to which to anchor the\n        // scroll position. -1 means anchor to the end of the document.\n        this.scrollAnchorPos = 0;\n        // The height at the anchor position. Set by the DOM update phase.\n        // -1 means no height available.\n        this.scrollAnchorHeight = -1;\n        // See VP.MaxDOMHeight\n        this.scaler = IdScaler;\n        this.scrollTarget = null;\n        // Briefly set to true when printing, to disable viewport limiting\n        this.printing = false;\n        // Flag set when editor content was redrawn, so that the next\n        // measure stage knows it must read DOM layout\n        this.mustMeasureContent = true;\n        this.defaultTextDirection = Direction.LTR;\n        this.visibleRanges = [];\n        // Cursor 'assoc' is only significant when the cursor is on a line\n        // wrap point, where it must stick to the character that it is\n        // associated with. Since browsers don't provide a reasonable\n        // interface to set or query this, when a selection is set that\n        // might cause this to be significant, this flag is set. The next\n        // measure phase will check whether the cursor is on a line-wrapping\n        // boundary and, if so, reset it to make sure it is positioned in\n        // the right place.\n        this.mustEnforceCursorAssoc = false;\n        let guessWrapping = state.facet(contentAttributes).some(v => typeof v != \"function\" && v.class == \"cm-lineWrapping\");\n        this.heightOracle = new HeightOracle(guessWrapping);\n        this.stateDeco = state.facet(decorations).filter(d => typeof d != \"function\");\n        this.heightMap = HeightMap.empty().applyChanges(this.stateDeco, Text.empty, this.heightOracle.setDoc(state.doc), [new ChangedRange(0, 0, 0, state.doc.length)]);\n        this.viewport = this.getViewport(0, null);\n        this.updateViewportLines();\n        this.updateForViewport();\n        this.lineGaps = this.ensureLineGaps([]);\n        this.lineGapDeco = Decoration.set(this.lineGaps.map(gap => gap.draw(false)));\n        this.computeVisibleRanges();\n    }\n    updateForViewport() {\n        let viewports = [this.viewport], { main } = this.state.selection;\n        for (let i = 0; i <= 1; i++) {\n            let pos = i ? main.head : main.anchor;\n            if (!viewports.some(({ from, to }) => pos >= from && pos <= to)) {\n                let { from, to } = this.lineBlockAt(pos);\n                viewports.push(new Viewport(from, to));\n            }\n        }\n        this.viewports = viewports.sort((a, b) => a.from - b.from);\n        this.scaler = this.heightMap.height <= 7000000 /* MaxDOMHeight */ ? IdScaler :\n            new BigScaler(this.heightOracle, this.heightMap, this.viewports);\n    }\n    updateViewportLines() {\n        this.viewportLines = [];\n        this.heightMap.forEachLine(this.viewport.from, this.viewport.to, this.heightOracle.setDoc(this.state.doc), 0, 0, block => {\n            this.viewportLines.push(this.scaler.scale == 1 ? block : scaleBlock(block, this.scaler));\n        });\n    }\n    update(update, scrollTarget = null) {\n        this.state = update.state;\n        let prevDeco = this.stateDeco;\n        this.stateDeco = this.state.facet(decorations).filter(d => typeof d != \"function\");\n        let contentChanges = update.changedRanges;\n        let heightChanges = ChangedRange.extendWithRanges(contentChanges, heightRelevantDecoChanges(prevDeco, this.stateDeco, update ? update.changes : ChangeSet.empty(this.state.doc.length)));\n        let prevHeight = this.heightMap.height;\n        let scrollAnchor = this.scrolledToBottom ? null : this.scrollAnchorAt(this.scrollTop);\n        this.heightMap = this.heightMap.applyChanges(this.stateDeco, update.startState.doc, this.heightOracle.setDoc(this.state.doc), heightChanges);\n        if (this.heightMap.height != prevHeight)\n            update.flags |= 2 /* Height */;\n        if (scrollAnchor) {\n            this.scrollAnchorPos = update.changes.mapPos(scrollAnchor.from, -1);\n            this.scrollAnchorHeight = scrollAnchor.top;\n        }\n        else {\n            this.scrollAnchorPos = -1;\n            this.scrollAnchorHeight = this.heightMap.height;\n        }\n        let viewport = heightChanges.length ? this.mapViewport(this.viewport, update.changes) : this.viewport;\n        if (scrollTarget && (scrollTarget.range.head < viewport.from || scrollTarget.range.head > viewport.to) ||\n            !this.viewportIsAppropriate(viewport))\n            viewport = this.getViewport(0, scrollTarget);\n        let updateLines = !update.changes.empty || (update.flags & 2 /* Height */) ||\n            viewport.from != this.viewport.from || viewport.to != this.viewport.to;\n        this.viewport = viewport;\n        this.updateForViewport();\n        if (updateLines)\n            this.updateViewportLines();\n        if (this.lineGaps.length || this.viewport.to - this.viewport.from > (2000 /* Margin */ << 1))\n            this.updateLineGaps(this.ensureLineGaps(this.mapLineGaps(this.lineGaps, update.changes)));\n        update.flags |= this.computeVisibleRanges();\n        if (scrollTarget)\n            this.scrollTarget = scrollTarget;\n        if (!this.mustEnforceCursorAssoc && update.selectionSet && update.view.lineWrapping &&\n            update.state.selection.main.empty && update.state.selection.main.assoc &&\n            !update.state.facet(nativeSelectionHidden))\n            this.mustEnforceCursorAssoc = true;\n    }\n    measure(view) {\n        let dom = view.contentDOM, style = window.getComputedStyle(dom);\n        let oracle = this.heightOracle;\n        let whiteSpace = style.whiteSpace;\n        this.defaultTextDirection = style.direction == \"rtl\" ? Direction.RTL : Direction.LTR;\n        let refresh = this.heightOracle.mustRefreshForWrapping(whiteSpace);\n        let domRect = dom.getBoundingClientRect();\n        let measureContent = refresh || this.mustMeasureContent || this.contentDOMHeight != domRect.height;\n        this.contentDOMHeight = domRect.height;\n        this.mustMeasureContent = false;\n        let result = 0, bias = 0;\n        // Vertical padding\n        let paddingTop = parseInt(style.paddingTop) || 0, paddingBottom = parseInt(style.paddingBottom) || 0;\n        if (this.paddingTop != paddingTop || this.paddingBottom != paddingBottom) {\n            this.paddingTop = paddingTop;\n            this.paddingBottom = paddingBottom;\n            result |= 8 /* Geometry */ | 2 /* Height */;\n        }\n        if (this.editorWidth != view.scrollDOM.clientWidth) {\n            if (oracle.lineWrapping)\n                measureContent = true;\n            this.editorWidth = view.scrollDOM.clientWidth;\n            result |= 8 /* Geometry */;\n        }\n        if (this.scrollTop != view.scrollDOM.scrollTop) {\n            this.scrollAnchorHeight = -1;\n            this.scrollTop = view.scrollDOM.scrollTop;\n        }\n        this.scrolledToBottom = isScrolledToBottom(view.scrollDOM);\n        // Pixel viewport\n        let pixelViewport = (this.printing ? fullPixelRange : visiblePixelRange)(dom, this.paddingTop);\n        let dTop = pixelViewport.top - this.pixelViewport.top, dBottom = pixelViewport.bottom - this.pixelViewport.bottom;\n        this.pixelViewport = pixelViewport;\n        let inView = this.pixelViewport.bottom > this.pixelViewport.top && this.pixelViewport.right > this.pixelViewport.left;\n        if (inView != this.inView) {\n            this.inView = inView;\n            if (inView)\n                measureContent = true;\n        }\n        if (!this.inView && !this.scrollTarget)\n            return 0;\n        let contentWidth = domRect.width;\n        if (this.contentDOMWidth != contentWidth || this.editorHeight != view.scrollDOM.clientHeight) {\n            this.contentDOMWidth = domRect.width;\n            this.editorHeight = view.scrollDOM.clientHeight;\n            result |= 8 /* Geometry */;\n        }\n        if (measureContent) {\n            let lineHeights = view.docView.measureVisibleLineHeights(this.viewport);\n            if (oracle.mustRefreshForHeights(lineHeights))\n                refresh = true;\n            if (refresh || oracle.lineWrapping && Math.abs(contentWidth - this.contentDOMWidth) > oracle.charWidth) {\n                let { lineHeight, charWidth, textHeight } = view.docView.measureTextSize();\n                refresh = lineHeight > 0 && oracle.refresh(whiteSpace, lineHeight, charWidth, textHeight, contentWidth / charWidth, lineHeights);\n                if (refresh) {\n                    view.docView.minWidth = 0;\n                    result |= 8 /* Geometry */;\n                }\n            }\n            if (dTop > 0 && dBottom > 0)\n                bias = Math.max(dTop, dBottom);\n            else if (dTop < 0 && dBottom < 0)\n                bias = Math.min(dTop, dBottom);\n            oracle.heightChanged = false;\n            for (let vp of this.viewports) {\n                let heights = vp.from == this.viewport.from ? lineHeights : view.docView.measureVisibleLineHeights(vp);\n                this.heightMap = (refresh ? HeightMap.empty().applyChanges(this.stateDeco, Text.empty, this.heightOracle, [new ChangedRange(0, 0, 0, view.state.doc.length)]) : this.heightMap).updateHeight(oracle, 0, refresh, new MeasuredHeights(vp.from, heights));\n            }\n            if (oracle.heightChanged)\n                result |= 2 /* Height */;\n        }\n        let viewportChange = !this.viewportIsAppropriate(this.viewport, bias) ||\n            this.scrollTarget && (this.scrollTarget.range.head < this.viewport.from ||\n                this.scrollTarget.range.head > this.viewport.to);\n        if (viewportChange)\n            this.viewport = this.getViewport(bias, this.scrollTarget);\n        this.updateForViewport();\n        if ((result & 2 /* Height */) || viewportChange)\n            this.updateViewportLines();\n        if (this.lineGaps.length || this.viewport.to - this.viewport.from > (2000 /* Margin */ << 1))\n            this.updateLineGaps(this.ensureLineGaps(refresh ? [] : this.lineGaps, view));\n        result |= this.computeVisibleRanges();\n        if (this.mustEnforceCursorAssoc) {\n            this.mustEnforceCursorAssoc = false;\n            // This is done in the read stage, because moving the selection\n            // to a line end is going to trigger a layout anyway, so it\n            // can't be a pure write. It should be rare that it does any\n            // writing.\n            view.docView.enforceCursorAssoc();\n        }\n        return result;\n    }\n    get visibleTop() { return this.scaler.fromDOM(this.pixelViewport.top); }\n    get visibleBottom() { return this.scaler.fromDOM(this.pixelViewport.bottom); }\n    getViewport(bias, scrollTarget) {\n        // This will divide VP.Margin between the top and the\n        // bottom, depending on the bias (the change in viewport position\n        // since the last update). It'll hold a number between 0 and 1\n        let marginTop = 0.5 - Math.max(-0.5, Math.min(0.5, bias / 1000 /* Margin */ / 2));\n        let map = this.heightMap, oracle = this.heightOracle;\n        let { visibleTop, visibleBottom } = this;\n        let viewport = new Viewport(map.lineAt(visibleTop - marginTop * 1000 /* Margin */, QueryType.ByHeight, oracle, 0, 0).from, map.lineAt(visibleBottom + (1 - marginTop) * 1000 /* Margin */, QueryType.ByHeight, oracle, 0, 0).to);\n        // If scrollTarget is given, make sure the viewport includes that position\n        if (scrollTarget) {\n            let { head } = scrollTarget.range;\n            if (head < viewport.from || head > viewport.to) {\n                let viewHeight = Math.min(this.editorHeight, this.pixelViewport.bottom - this.pixelViewport.top);\n                let block = map.lineAt(head, QueryType.ByPos, oracle, 0, 0), topPos;\n                if (scrollTarget.y == \"center\")\n                    topPos = (block.top + block.bottom) / 2 - viewHeight / 2;\n                else if (scrollTarget.y == \"start\" || scrollTarget.y == \"nearest\" && head < viewport.from)\n                    topPos = block.top;\n                else\n                    topPos = block.bottom - viewHeight;\n                viewport = new Viewport(map.lineAt(topPos - 1000 /* Margin */ / 2, QueryType.ByHeight, oracle, 0, 0).from, map.lineAt(topPos + viewHeight + 1000 /* Margin */ / 2, QueryType.ByHeight, oracle, 0, 0).to);\n            }\n        }\n        return viewport;\n    }\n    mapViewport(viewport, changes) {\n        let from = changes.mapPos(viewport.from, -1), to = changes.mapPos(viewport.to, 1);\n        return new Viewport(this.heightMap.lineAt(from, QueryType.ByPos, this.heightOracle, 0, 0).from, this.heightMap.lineAt(to, QueryType.ByPos, this.heightOracle, 0, 0).to);\n    }\n    // Checks if a given viewport covers the visible part of the\n    // document and not too much beyond that.\n    viewportIsAppropriate({ from, to }, bias = 0) {\n        if (!this.inView)\n            return true;\n        let { top } = this.heightMap.lineAt(from, QueryType.ByPos, this.heightOracle, 0, 0);\n        let { bottom } = this.heightMap.lineAt(to, QueryType.ByPos, this.heightOracle, 0, 0);\n        let { visibleTop, visibleBottom } = this;\n        return (from == 0 || top <= visibleTop - Math.max(10 /* MinCoverMargin */, Math.min(-bias, 250 /* MaxCoverMargin */))) &&\n            (to == this.state.doc.length ||\n                bottom >= visibleBottom + Math.max(10 /* MinCoverMargin */, Math.min(bias, 250 /* MaxCoverMargin */))) &&\n            (top > visibleTop - 2 * 1000 /* Margin */ && bottom < visibleBottom + 2 * 1000 /* Margin */);\n    }\n    mapLineGaps(gaps, changes) {\n        if (!gaps.length || changes.empty)\n            return gaps;\n        let mapped = [];\n        for (let gap of gaps)\n            if (!changes.touchesRange(gap.from, gap.to))\n                mapped.push(new LineGap(changes.mapPos(gap.from), changes.mapPos(gap.to), gap.size));\n        return mapped;\n    }\n    // Computes positions in the viewport where the start or end of a\n    // line should be hidden, trying to reuse existing line gaps when\n    // appropriate to avoid unneccesary redraws.\n    // Uses crude character-counting for the positioning and sizing,\n    // since actual DOM coordinates aren't always available and\n    // predictable. Relies on generous margins (see LG.Margin) to hide\n    // the artifacts this might produce from the user.\n    ensureLineGaps(current, mayMeasure) {\n        let wrapping = this.heightOracle.lineWrapping;\n        let margin = wrapping ? 10000 /* MarginWrap */ : 2000 /* Margin */, halfMargin = margin >> 1, doubleMargin = margin << 1;\n        // The non-wrapping logic won't work at all in predominantly right-to-left text.\n        if (this.defaultTextDirection != Direction.LTR && !wrapping)\n            return [];\n        let gaps = [];\n        let addGap = (from, to, line, structure) => {\n            if (to - from < halfMargin)\n                return;\n            let sel = this.state.selection.main, avoid = [sel.from];\n            if (!sel.empty)\n                avoid.push(sel.to);\n            for (let pos of avoid) {\n                if (pos > from && pos < to) {\n                    addGap(from, pos - 10 /* SelectionMargin */, line, structure);\n                    addGap(pos + 10 /* SelectionMargin */, to, line, structure);\n                    return;\n                }\n            }\n            let gap = find(current, gap => gap.from >= line.from && gap.to <= line.to &&\n                Math.abs(gap.from - from) < halfMargin && Math.abs(gap.to - to) < halfMargin &&\n                !avoid.some(pos => gap.from < pos && gap.to > pos));\n            if (!gap) {\n                // When scrolling down, snap gap ends to line starts to avoid shifts in wrapping\n                if (to < line.to && mayMeasure && wrapping &&\n                    mayMeasure.visibleRanges.some(r => r.from <= to && r.to >= to)) {\n                    let lineStart = mayMeasure.moveToLineBoundary(EditorSelection.cursor(to), false, true).head;\n                    if (lineStart > from)\n                        to = lineStart;\n                }\n                gap = new LineGap(from, to, this.gapSize(line, from, to, structure));\n            }\n            gaps.push(gap);\n        };\n        for (let line of this.viewportLines) {\n            if (line.length < doubleMargin)\n                continue;\n            let structure = lineStructure(line.from, line.to, this.stateDeco);\n            if (structure.total < doubleMargin)\n                continue;\n            let target = this.scrollTarget ? this.scrollTarget.range.head : null;\n            let viewFrom, viewTo;\n            if (wrapping) {\n                let marginHeight = (margin / this.heightOracle.lineLength) * this.heightOracle.lineHeight;\n                let top, bot;\n                if (target != null) {\n                    let targetFrac = findFraction(structure, target);\n                    let spaceFrac = ((this.visibleBottom - this.visibleTop) / 2 + marginHeight) / line.height;\n                    top = targetFrac - spaceFrac;\n                    bot = targetFrac + spaceFrac;\n                }\n                else {\n                    top = (this.visibleTop - line.top - marginHeight) / line.height;\n                    bot = (this.visibleBottom - line.top + marginHeight) / line.height;\n                }\n                viewFrom = findPosition(structure, top);\n                viewTo = findPosition(structure, bot);\n            }\n            else {\n                let totalWidth = structure.total * this.heightOracle.charWidth;\n                let marginWidth = margin * this.heightOracle.charWidth;\n                let left, right;\n                if (target != null) {\n                    let targetFrac = findFraction(structure, target);\n                    let spaceFrac = ((this.pixelViewport.right - this.pixelViewport.left) / 2 + marginWidth) / totalWidth;\n                    left = targetFrac - spaceFrac;\n                    right = targetFrac + spaceFrac;\n                }\n                else {\n                    left = (this.pixelViewport.left - marginWidth) / totalWidth;\n                    right = (this.pixelViewport.right + marginWidth) / totalWidth;\n                }\n                viewFrom = findPosition(structure, left);\n                viewTo = findPosition(structure, right);\n            }\n            if (viewFrom > line.from)\n                addGap(line.from, viewFrom, line, structure);\n            if (viewTo < line.to)\n                addGap(viewTo, line.to, line, structure);\n        }\n        return gaps;\n    }\n    gapSize(line, from, to, structure) {\n        let fraction = findFraction(structure, to) - findFraction(structure, from);\n        if (this.heightOracle.lineWrapping) {\n            return line.height * fraction;\n        }\n        else {\n            return structure.total * this.heightOracle.charWidth * fraction;\n        }\n    }\n    updateLineGaps(gaps) {\n        if (!LineGap.same(gaps, this.lineGaps)) {\n            this.lineGaps = gaps;\n            this.lineGapDeco = Decoration.set(gaps.map(gap => gap.draw(this.heightOracle.lineWrapping)));\n        }\n    }\n    computeVisibleRanges() {\n        let deco = this.stateDeco;\n        if (this.lineGaps.length)\n            deco = deco.concat(this.lineGapDeco);\n        let ranges = [];\n        RangeSet.spans(deco, this.viewport.from, this.viewport.to, {\n            span(from, to) { ranges.push({ from, to }); },\n            point() { }\n        }, 20);\n        let changed = ranges.length != this.visibleRanges.length ||\n            this.visibleRanges.some((r, i) => r.from != ranges[i].from || r.to != ranges[i].to);\n        this.visibleRanges = ranges;\n        return changed ? 4 /* Viewport */ : 0;\n    }\n    lineBlockAt(pos) {\n        return (pos >= this.viewport.from && pos <= this.viewport.to && this.viewportLines.find(b => b.from <= pos && b.to >= pos)) ||\n            scaleBlock(this.heightMap.lineAt(pos, QueryType.ByPos, this.heightOracle, 0, 0), this.scaler);\n    }\n    lineBlockAtHeight(height) {\n        return scaleBlock(this.heightMap.lineAt(this.scaler.fromDOM(height), QueryType.ByHeight, this.heightOracle, 0, 0), this.scaler);\n    }\n    scrollAnchorAt(scrollTop) {\n        let block = this.lineBlockAtHeight(scrollTop + 8);\n        return block.from >= this.viewport.from || this.viewportLines[0].top - scrollTop > 200 ? block : this.viewportLines[0];\n    }\n    elementAtHeight(height) {\n        return scaleBlock(this.heightMap.blockAt(this.scaler.fromDOM(height), this.heightOracle, 0, 0), this.scaler);\n    }\n    get docHeight() {\n        return this.scaler.toDOM(this.heightMap.height);\n    }\n    get contentHeight() {\n        return this.docHeight + this.paddingTop + this.paddingBottom;\n    }\n}\nclass Viewport {\n    constructor(from, to) {\n        this.from = from;\n        this.to = to;\n    }\n}\nfunction lineStructure(from, to, stateDeco) {\n    let ranges = [], pos = from, total = 0;\n    RangeSet.spans(stateDeco, from, to, {\n        span() { },\n        point(from, to) {\n            if (from > pos) {\n                ranges.push({ from: pos, to: from });\n                total += from - pos;\n            }\n            pos = to;\n        }\n    }, 20); // We're only interested in collapsed ranges of a significant size\n    if (pos < to) {\n        ranges.push({ from: pos, to });\n        total += to - pos;\n    }\n    return { total, ranges };\n}\nfunction findPosition({ total, ranges }, ratio) {\n    if (ratio <= 0)\n        return ranges[0].from;\n    if (ratio >= 1)\n        return ranges[ranges.length - 1].to;\n    let dist = Math.floor(total * ratio);\n    for (let i = 0;; i++) {\n        let { from, to } = ranges[i], size = to - from;\n        if (dist <= size)\n            return from + dist;\n        dist -= size;\n    }\n}\nfunction findFraction(structure, pos) {\n    let counted = 0;\n    for (let { from, to } of structure.ranges) {\n        if (pos <= to) {\n            counted += pos - from;\n            break;\n        }\n        counted += to - from;\n    }\n    return counted / structure.total;\n}\nfunction find(array, f) {\n    for (let val of array)\n        if (f(val))\n            return val;\n    return undefined;\n}\n// Don't scale when the document height is within the range of what\n// the DOM can handle.\nconst IdScaler = {\n    toDOM(n) { return n; },\n    fromDOM(n) { return n; },\n    scale: 1\n};\n// When the height is too big (> VP.MaxDOMHeight), scale down the\n// regions outside the viewports so that the total height is\n// VP.MaxDOMHeight.\nclass BigScaler {\n    constructor(oracle, heightMap, viewports) {\n        let vpHeight = 0, base = 0, domBase = 0;\n        this.viewports = viewports.map(({ from, to }) => {\n            let top = heightMap.lineAt(from, QueryType.ByPos, oracle, 0, 0).top;\n            let bottom = heightMap.lineAt(to, QueryType.ByPos, oracle, 0, 0).bottom;\n            vpHeight += bottom - top;\n            return { from, to, top, bottom, domTop: 0, domBottom: 0 };\n        });\n        this.scale = (7000000 /* MaxDOMHeight */ - vpHeight) / (heightMap.height - vpHeight);\n        for (let obj of this.viewports) {\n            obj.domTop = domBase + (obj.top - base) * this.scale;\n            domBase = obj.domBottom = obj.domTop + (obj.bottom - obj.top);\n            base = obj.bottom;\n        }\n    }\n    toDOM(n) {\n        for (let i = 0, base = 0, domBase = 0;; i++) {\n            let vp = i < this.viewports.length ? this.viewports[i] : null;\n            if (!vp || n < vp.top)\n                return domBase + (n - base) * this.scale;\n            if (n <= vp.bottom)\n                return vp.domTop + (n - vp.top);\n            base = vp.bottom;\n            domBase = vp.domBottom;\n        }\n    }\n    fromDOM(n) {\n        for (let i = 0, base = 0, domBase = 0;; i++) {\n            let vp = i < this.viewports.length ? this.viewports[i] : null;\n            if (!vp || n < vp.domTop)\n                return base + (n - domBase) / this.scale;\n            if (n <= vp.domBottom)\n                return vp.top + (n - vp.domTop);\n            base = vp.bottom;\n            domBase = vp.domBottom;\n        }\n    }\n}\nfunction scaleBlock(block, scaler) {\n    if (scaler.scale == 1)\n        return block;\n    let bTop = scaler.toDOM(block.top), bBottom = scaler.toDOM(block.bottom);\n    return new BlockInfo(block.from, block.length, bTop, bBottom - bTop, Array.isArray(block._content) ? block._content.map(b => scaleBlock(b, scaler)) : block._content);\n}\n\nconst theme = /*@__PURE__*/Facet.define({ combine: strs => strs.join(\" \") });\nconst darkTheme = /*@__PURE__*/Facet.define({ combine: values => values.indexOf(true) > -1 });\nconst baseThemeID = /*@__PURE__*/StyleModule.newName(), baseLightID = /*@__PURE__*/StyleModule.newName(), baseDarkID = /*@__PURE__*/StyleModule.newName();\nconst lightDarkIDs = { \"&light\": \".\" + baseLightID, \"&dark\": \".\" + baseDarkID };\nfunction buildTheme(main, spec, scopes) {\n    return new StyleModule(spec, {\n        finish(sel) {\n            return /&/.test(sel) ? sel.replace(/&\\w*/, m => {\n                if (m == \"&\")\n                    return main;\n                if (!scopes || !scopes[m])\n                    throw new RangeError(`Unsupported selector: ${m}`);\n                return scopes[m];\n            }) : main + \" \" + sel;\n        }\n    });\n}\nconst baseTheme$1 = /*@__PURE__*/buildTheme(\".\" + baseThemeID, {\n    \"&\": {\n        position: \"relative !important\",\n        boxSizing: \"border-box\",\n        \"&.cm-focused\": {\n            // Provide a simple default outline to make sure a focused\n            // editor is visually distinct. Can't leave the default behavior\n            // because that will apply to the content element, which is\n            // inside the scrollable container and doesn't include the\n            // gutters. We also can't use an 'auto' outline, since those\n            // are, for some reason, drawn behind the element content, which\n            // will cause things like the active line background to cover\n            // the outline (#297).\n            outline: \"1px dotted #212121\"\n        },\n        display: \"flex !important\",\n        flexDirection: \"column\"\n    },\n    \".cm-scroller\": {\n        display: \"flex !important\",\n        alignItems: \"flex-start !important\",\n        fontFamily: \"monospace\",\n        lineHeight: 1.4,\n        height: \"100%\",\n        overflowX: \"auto\",\n        position: \"relative\",\n        zIndex: 0\n    },\n    \".cm-content\": {\n        margin: 0,\n        flexGrow: 2,\n        flexShrink: 0,\n        display: \"block\",\n        whiteSpace: \"pre\",\n        wordWrap: \"normal\",\n        boxSizing: \"border-box\",\n        padding: \"4px 0\",\n        outline: \"none\",\n        \"&[contenteditable=true]\": {\n            WebkitUserModify: \"read-write-plaintext-only\",\n        }\n    },\n    \".cm-lineWrapping\": {\n        whiteSpace_fallback: \"pre-wrap\",\n        whiteSpace: \"break-spaces\",\n        wordBreak: \"break-word\",\n        overflowWrap: \"anywhere\",\n        flexShrink: 1\n    },\n    \"&light .cm-content\": { caretColor: \"black\" },\n    \"&dark .cm-content\": { caretColor: \"white\" },\n    \".cm-line\": {\n        display: \"block\",\n        padding: \"0 2px 0 6px\"\n    },\n    \".cm-layer\": {\n        position: \"absolute\",\n        left: 0,\n        top: 0,\n        contain: \"size style\",\n        \"& > *\": {\n            position: \"absolute\"\n        }\n    },\n    \"&light .cm-selectionBackground\": {\n        background: \"#d9d9d9\"\n    },\n    \"&dark .cm-selectionBackground\": {\n        background: \"#222\"\n    },\n    \"&light.cm-focused > .cm-scroller > .cm-selectionLayer .cm-selectionBackground\": {\n        background: \"#d7d4f0\"\n    },\n    \"&dark.cm-focused > .cm-scroller > .cm-selectionLayer .cm-selectionBackground\": {\n        background: \"#233\"\n    },\n    \".cm-cursorLayer\": {\n        pointerEvents: \"none\"\n    },\n    \"&.cm-focused > .cm-scroller > .cm-cursorLayer\": {\n        animation: \"steps(1) cm-blink 1.2s infinite\"\n    },\n    // Two animations defined so that we can switch between them to\n    // restart the animation without forcing another style\n    // recomputation.\n    \"@keyframes cm-blink\": { \"0%\": {}, \"50%\": { opacity: 0 }, \"100%\": {} },\n    \"@keyframes cm-blink2\": { \"0%\": {}, \"50%\": { opacity: 0 }, \"100%\": {} },\n    \".cm-cursor, .cm-dropCursor\": {\n        borderLeft: \"1.2px solid black\",\n        marginLeft: \"-0.6px\",\n        pointerEvents: \"none\",\n    },\n    \".cm-cursor\": {\n        display: \"none\"\n    },\n    \"&dark .cm-cursor\": {\n        borderLeftColor: \"#444\"\n    },\n    \".cm-dropCursor\": {\n        position: \"absolute\"\n    },\n    \"&.cm-focused > .cm-scroller > .cm-cursorLayer .cm-cursor\": {\n        display: \"block\"\n    },\n    \"&light .cm-activeLine\": { backgroundColor: \"#cceeff44\" },\n    \"&dark .cm-activeLine\": { backgroundColor: \"#99eeff33\" },\n    \"&light .cm-specialChar\": { color: \"red\" },\n    \"&dark .cm-specialChar\": { color: \"#f78\" },\n    \".cm-gutters\": {\n        flexShrink: 0,\n        display: \"flex\",\n        height: \"100%\",\n        boxSizing: \"border-box\",\n        left: 0,\n        zIndex: 200\n    },\n    \"&light .cm-gutters\": {\n        backgroundColor: \"#f5f5f5\",\n        color: \"#6c6c6c\",\n        borderRight: \"1px solid #ddd\"\n    },\n    \"&dark .cm-gutters\": {\n        backgroundColor: \"#333338\",\n        color: \"#ccc\"\n    },\n    \".cm-gutter\": {\n        display: \"flex !important\",\n        flexDirection: \"column\",\n        flexShrink: 0,\n        boxSizing: \"border-box\",\n        minHeight: \"100%\",\n        overflow: \"hidden\"\n    },\n    \".cm-gutterElement\": {\n        boxSizing: \"border-box\"\n    },\n    \".cm-lineNumbers .cm-gutterElement\": {\n        padding: \"0 3px 0 5px\",\n        minWidth: \"20px\",\n        textAlign: \"right\",\n        whiteSpace: \"nowrap\"\n    },\n    \"&light .cm-activeLineGutter\": {\n        backgroundColor: \"#e2f2ff\"\n    },\n    \"&dark .cm-activeLineGutter\": {\n        backgroundColor: \"#222227\"\n    },\n    \".cm-panels\": {\n        boxSizing: \"border-box\",\n        position: \"sticky\",\n        left: 0,\n        right: 0\n    },\n    \"&light .cm-panels\": {\n        backgroundColor: \"#f5f5f5\",\n        color: \"black\"\n    },\n    \"&light .cm-panels-top\": {\n        borderBottom: \"1px solid #ddd\"\n    },\n    \"&light .cm-panels-bottom\": {\n        borderTop: \"1px solid #ddd\"\n    },\n    \"&dark .cm-panels\": {\n        backgroundColor: \"#333338\",\n        color: \"white\"\n    },\n    \".cm-tab\": {\n        display: \"inline-block\",\n        overflow: \"hidden\",\n        verticalAlign: \"bottom\"\n    },\n    \".cm-widgetBuffer\": {\n        verticalAlign: \"text-top\",\n        height: \"1em\",\n        width: 0,\n        display: \"inline\"\n    },\n    \".cm-placeholder\": {\n        color: \"#888\",\n        display: \"inline-block\",\n        verticalAlign: \"top\",\n    },\n    \".cm-highlightSpace:before\": {\n        content: \"attr(data-display)\",\n        position: \"absolute\",\n        pointerEvents: \"none\",\n        color: \"#888\"\n    },\n    \".cm-highlightTab\": {\n        backgroundImage: `url('data:image/svg+xml,<svg xmlns=\"http://www.w3.org/2000/svg\" width=\"200\" height=\"20\"><path stroke=\"%23888\" stroke-width=\"1\" fill=\"none\" d=\"M1 10H196L190 5M190 15L196 10M197 4L197 16\"/></svg>')`,\n        backgroundSize: \"auto 100%\",\n        backgroundPosition: \"right 90%\",\n        backgroundRepeat: \"no-repeat\"\n    },\n    \".cm-trailingSpace\": {\n        backgroundColor: \"#ff332255\"\n    },\n    \".cm-button\": {\n        verticalAlign: \"middle\",\n        color: \"inherit\",\n        fontSize: \"70%\",\n        padding: \".2em 1em\",\n        borderRadius: \"1px\"\n    },\n    \"&light .cm-button\": {\n        backgroundImage: \"linear-gradient(#eff1f5, #d9d9df)\",\n        border: \"1px solid #888\",\n        \"&:active\": {\n            backgroundImage: \"linear-gradient(#b4b4b4, #d0d3d6)\"\n        }\n    },\n    \"&dark .cm-button\": {\n        backgroundImage: \"linear-gradient(#393939, #111)\",\n        border: \"1px solid #888\",\n        \"&:active\": {\n            backgroundImage: \"linear-gradient(#111, #333)\"\n        }\n    },\n    \".cm-textfield\": {\n        verticalAlign: \"middle\",\n        color: \"inherit\",\n        fontSize: \"70%\",\n        border: \"1px solid silver\",\n        padding: \".2em .5em\"\n    },\n    \"&light .cm-textfield\": {\n        backgroundColor: \"white\"\n    },\n    \"&dark .cm-textfield\": {\n        border: \"1px solid #555\",\n        backgroundColor: \"inherit\"\n    }\n}, lightDarkIDs);\n\nclass DOMChange {\n    constructor(view, start, end, typeOver) {\n        this.typeOver = typeOver;\n        this.bounds = null;\n        this.text = \"\";\n        let { impreciseHead: iHead, impreciseAnchor: iAnchor } = view.docView;\n        if (view.state.readOnly && start > -1) {\n            // Ignore changes when the editor is read-only\n            this.newSel = null;\n        }\n        else if (start > -1 && (this.bounds = view.docView.domBoundsAround(start, end, 0))) {\n            let selPoints = iHead || iAnchor ? [] : selectionPoints(view);\n            let reader = new DOMReader(selPoints, view.state);\n            reader.readRange(this.bounds.startDOM, this.bounds.endDOM);\n            this.text = reader.text;\n            this.newSel = selectionFromPoints(selPoints, this.bounds.from);\n        }\n        else {\n            let domSel = view.observer.selectionRange;\n            let head = iHead && iHead.node == domSel.focusNode && iHead.offset == domSel.focusOffset ||\n                !contains(view.contentDOM, domSel.focusNode)\n                ? view.state.selection.main.head\n                : view.docView.posFromDOM(domSel.focusNode, domSel.focusOffset);\n            let anchor = iAnchor && iAnchor.node == domSel.anchorNode && iAnchor.offset == domSel.anchorOffset ||\n                !contains(view.contentDOM, domSel.anchorNode)\n                ? view.state.selection.main.anchor\n                : view.docView.posFromDOM(domSel.anchorNode, domSel.anchorOffset);\n            this.newSel = EditorSelection.single(anchor, head);\n        }\n    }\n}\nfunction applyDOMChange(view, domChange) {\n    let change;\n    let { newSel } = domChange, sel = view.state.selection.main;\n    let lastKey = view.inputState.lastKeyTime > Date.now() - 100 ? view.inputState.lastKeyCode : -1;\n    if (domChange.bounds) {\n        let { from, to } = domChange.bounds;\n        let preferredPos = sel.from, preferredSide = null;\n        // Prefer anchoring to end when Backspace is pressed (or, on\n        // Android, when something was deleted)\n        if (lastKey === 8 || browser.android && domChange.text.length < to - from) {\n            preferredPos = sel.to;\n            preferredSide = \"end\";\n        }\n        let diff = findDiff(view.state.doc.sliceString(from, to, LineBreakPlaceholder), domChange.text, preferredPos - from, preferredSide);\n        if (diff) {\n            // Chrome inserts two newlines when pressing shift-enter at the\n            // end of a line. DomChange drops one of those.\n            if (browser.chrome && lastKey == 13 &&\n                diff.toB == diff.from + 2 && domChange.text.slice(diff.from, diff.toB) == LineBreakPlaceholder + LineBreakPlaceholder)\n                diff.toB--;\n            change = { from: from + diff.from, to: from + diff.toA,\n                insert: Text.of(domChange.text.slice(diff.from, diff.toB).split(LineBreakPlaceholder)) };\n        }\n    }\n    else if (newSel && (!view.hasFocus && view.state.facet(editable) || newSel.main.eq(sel))) {\n        newSel = null;\n    }\n    if (!change && !newSel)\n        return false;\n    if (!change && domChange.typeOver && !sel.empty && newSel && newSel.main.empty) {\n        // Heuristic to notice typing over a selected character\n        change = { from: sel.from, to: sel.to, insert: view.state.doc.slice(sel.from, sel.to) };\n    }\n    else if (change && change.from >= sel.from && change.to <= sel.to &&\n        (change.from != sel.from || change.to != sel.to) &&\n        (sel.to - sel.from) - (change.to - change.from) <= 4) {\n        // If the change is inside the selection and covers most of it,\n        // assume it is a selection replace (with identical characters at\n        // the start/end not included in the diff)\n        change = {\n            from: sel.from, to: sel.to,\n            insert: view.state.doc.slice(sel.from, change.from).append(change.insert).append(view.state.doc.slice(change.to, sel.to))\n        };\n    }\n    else if ((browser.mac || browser.android) && change && change.from == change.to && change.from == sel.head - 1 &&\n        /^\\. ?$/.test(change.insert.toString()) && view.contentDOM.getAttribute(\"autocorrect\") == \"off\") {\n        // Detect insert-period-on-double-space Mac and Android behavior,\n        // and transform it into a regular space insert.\n        if (newSel && change.insert.length == 2)\n            newSel = EditorSelection.single(newSel.main.anchor - 1, newSel.main.head - 1);\n        change = { from: sel.from, to: sel.to, insert: Text.of([\" \"]) };\n    }\n    else if (browser.chrome && change && change.from == change.to && change.from == sel.head &&\n        change.insert.toString() == \"\\n \" && view.lineWrapping) {\n        // In Chrome, if you insert a space at the start of a wrapped\n        // line, it will actually insert a newline and a space, causing a\n        // bogus new line to be created in CodeMirror (#968)\n        if (newSel)\n            newSel = EditorSelection.single(newSel.main.anchor - 1, newSel.main.head - 1);\n        change = { from: sel.from, to: sel.to, insert: Text.of([\" \"]) };\n    }\n    if (change) {\n        let startState = view.state;\n        if (browser.ios && view.inputState.flushIOSKey(view))\n            return true;\n        // Android browsers don't fire reasonable key events for enter,\n        // backspace, or delete. So this detects changes that look like\n        // they're caused by those keys, and reinterprets them as key\n        // events. (Some of these keys are also handled by beforeinput\n        // events and the pendingAndroidKey mechanism, but that's not\n        // reliable in all situations.)\n        if (browser.android &&\n            ((change.from == sel.from && change.to == sel.to &&\n                change.insert.length == 1 && change.insert.lines == 2 &&\n                dispatchKey(view.contentDOM, \"Enter\", 13)) ||\n                ((change.from == sel.from - 1 && change.to == sel.to && change.insert.length == 0 ||\n                    lastKey == 8 && change.insert.length < change.to - change.from) &&\n                    dispatchKey(view.contentDOM, \"Backspace\", 8)) ||\n                (change.from == sel.from && change.to == sel.to + 1 && change.insert.length == 0 &&\n                    dispatchKey(view.contentDOM, \"Delete\", 46))))\n            return true;\n        let text = change.insert.toString();\n        if (view.state.facet(inputHandler).some(h => h(view, change.from, change.to, text)))\n            return true;\n        if (view.inputState.composing >= 0)\n            view.inputState.composing++;\n        let tr;\n        if (change.from >= sel.from && change.to <= sel.to && change.to - change.from >= (sel.to - sel.from) / 3 &&\n            (!newSel || newSel.main.empty && newSel.main.from == change.from + change.insert.length) &&\n            view.inputState.composing < 0) {\n            let before = sel.from < change.from ? startState.sliceDoc(sel.from, change.from) : \"\";\n            let after = sel.to > change.to ? startState.sliceDoc(change.to, sel.to) : \"\";\n            tr = startState.replaceSelection(view.state.toText(before + change.insert.sliceString(0, undefined, view.state.lineBreak) + after));\n        }\n        else {\n            let changes = startState.changes(change);\n            let mainSel = newSel && newSel.main.to <= changes.newLength ? newSel.main : undefined;\n            // Try to apply a composition change to all cursors\n            if (startState.selection.ranges.length > 1 && view.inputState.composing >= 0 &&\n                change.to <= sel.to && change.to >= sel.to - 10) {\n                let replaced = view.state.sliceDoc(change.from, change.to);\n                let compositionRange = compositionSurroundingNode(view) || view.state.doc.lineAt(sel.head);\n                let offset = sel.to - change.to, size = sel.to - sel.from;\n                tr = startState.changeByRange(range => {\n                    if (range.from == sel.from && range.to == sel.to)\n                        return { changes, range: mainSel || range.map(changes) };\n                    let to = range.to - offset, from = to - replaced.length;\n                    if (range.to - range.from != size || view.state.sliceDoc(from, to) != replaced ||\n                        // Unfortunately, there's no way to make multiple\n                        // changes in the same node work without aborting\n                        // composition, so cursors in the composition range are\n                        // ignored.\n                        compositionRange && range.to >= compositionRange.from && range.from <= compositionRange.to)\n                        return { range };\n                    let rangeChanges = startState.changes({ from, to, insert: change.insert }), selOff = range.to - sel.to;\n                    return {\n                        changes: rangeChanges,\n                        range: !mainSel ? range.map(rangeChanges) :\n                            EditorSelection.range(Math.max(0, mainSel.anchor + selOff), Math.max(0, mainSel.head + selOff))\n                    };\n                });\n            }\n            else {\n                tr = {\n                    changes,\n                    selection: mainSel && startState.selection.replaceRange(mainSel)\n                };\n            }\n        }\n        let userEvent = \"input.type\";\n        if (view.composing ||\n            view.inputState.compositionPendingChange && view.inputState.compositionEndedAt > Date.now() - 50) {\n            view.inputState.compositionPendingChange = false;\n            userEvent += \".compose\";\n            if (view.inputState.compositionFirstChange) {\n                userEvent += \".start\";\n                view.inputState.compositionFirstChange = false;\n            }\n        }\n        view.dispatch(tr, { scrollIntoView: true, userEvent });\n        return true;\n    }\n    else if (newSel && !newSel.main.eq(sel)) {\n        let scrollIntoView = false, userEvent = \"select\";\n        if (view.inputState.lastSelectionTime > Date.now() - 50) {\n            if (view.inputState.lastSelectionOrigin == \"select\")\n                scrollIntoView = true;\n            userEvent = view.inputState.lastSelectionOrigin;\n        }\n        view.dispatch({ selection: newSel, scrollIntoView, userEvent });\n        return true;\n    }\n    else {\n        return false;\n    }\n}\nfunction findDiff(a, b, preferredPos, preferredSide) {\n    let minLen = Math.min(a.length, b.length);\n    let from = 0;\n    while (from < minLen && a.charCodeAt(from) == b.charCodeAt(from))\n        from++;\n    if (from == minLen && a.length == b.length)\n        return null;\n    let toA = a.length, toB = b.length;\n    while (toA > 0 && toB > 0 && a.charCodeAt(toA - 1) == b.charCodeAt(toB - 1)) {\n        toA--;\n        toB--;\n    }\n    if (preferredSide == \"end\") {\n        let adjust = Math.max(0, from - Math.min(toA, toB));\n        preferredPos -= toA + adjust - from;\n    }\n    if (toA < from && a.length < b.length) {\n        let move = preferredPos <= from && preferredPos >= toA ? from - preferredPos : 0;\n        from -= move;\n        toB = from + (toB - toA);\n        toA = from;\n    }\n    else if (toB < from) {\n        let move = preferredPos <= from && preferredPos >= toB ? from - preferredPos : 0;\n        from -= move;\n        toA = from + (toA - toB);\n        toB = from;\n    }\n    return { from, toA, toB };\n}\nfunction selectionPoints(view) {\n    let result = [];\n    if (view.root.activeElement != view.contentDOM)\n        return result;\n    let { anchorNode, anchorOffset, focusNode, focusOffset } = view.observer.selectionRange;\n    if (anchorNode) {\n        result.push(new DOMPoint(anchorNode, anchorOffset));\n        if (focusNode != anchorNode || focusOffset != anchorOffset)\n            result.push(new DOMPoint(focusNode, focusOffset));\n    }\n    return result;\n}\nfunction selectionFromPoints(points, base) {\n    if (points.length == 0)\n        return null;\n    let anchor = points[0].pos, head = points.length == 2 ? points[1].pos : anchor;\n    return anchor > -1 && head > -1 ? EditorSelection.single(anchor + base, head + base) : null;\n}\n\nconst observeOptions = {\n    childList: true,\n    characterData: true,\n    subtree: true,\n    attributes: true,\n    characterDataOldValue: true\n};\n// IE11 has very broken mutation observers, so we also listen to\n// DOMCharacterDataModified there\nconst useCharData = browser.ie && browser.ie_version <= 11;\nclass DOMObserver {\n    constructor(view) {\n        this.view = view;\n        this.active = false;\n        // The known selection. Kept in our own object, as opposed to just\n        // directly accessing the selection because:\n        //  - Safari doesn't report the right selection in shadow DOM\n        //  - Reading from the selection forces a DOM layout\n        //  - This way, we can ignore selectionchange events if we have\n        //    already seen the 'new' selection\n        this.selectionRange = new DOMSelectionState;\n        // Set when a selection change is detected, cleared on flush\n        this.selectionChanged = false;\n        this.delayedFlush = -1;\n        this.resizeTimeout = -1;\n        this.queue = [];\n        this.delayedAndroidKey = null;\n        this.flushingAndroidKey = -1;\n        this.lastChange = 0;\n        this.scrollTargets = [];\n        this.intersection = null;\n        this.resizeScroll = null;\n        this.resizeContent = null;\n        this.intersecting = false;\n        this.gapIntersection = null;\n        this.gaps = [];\n        // Timeout for scheduling check of the parents that need scroll handlers\n        this.parentCheck = -1;\n        this.dom = view.contentDOM;\n        this.observer = new MutationObserver(mutations => {\n            for (let mut of mutations)\n                this.queue.push(mut);\n            // IE11 will sometimes (on typing over a selection or\n            // backspacing out a single character text node) call the\n            // observer callback before actually updating the DOM.\n            //\n            // Unrelatedly, iOS Safari will, when ending a composition,\n            // sometimes first clear it, deliver the mutations, and then\n            // reinsert the finished text. CodeMirror's handling of the\n            // deletion will prevent the reinsertion from happening,\n            // breaking composition.\n            if ((browser.ie && browser.ie_version <= 11 || browser.ios && view.composing) &&\n                mutations.some(m => m.type == \"childList\" && m.removedNodes.length ||\n                    m.type == \"characterData\" && m.oldValue.length > m.target.nodeValue.length))\n                this.flushSoon();\n            else\n                this.flush();\n        });\n        if (useCharData)\n            this.onCharData = (event) => {\n                this.queue.push({ target: event.target,\n                    type: \"characterData\",\n                    oldValue: event.prevValue });\n                this.flushSoon();\n            };\n        this.onSelectionChange = this.onSelectionChange.bind(this);\n        this.onResize = this.onResize.bind(this);\n        this.onPrint = this.onPrint.bind(this);\n        this.onScroll = this.onScroll.bind(this);\n        if (typeof ResizeObserver == \"function\") {\n            this.resizeScroll = new ResizeObserver(() => {\n                var _a;\n                if (((_a = this.view.docView) === null || _a === void 0 ? void 0 : _a.lastUpdate) < Date.now() - 75)\n                    this.onResize();\n            });\n            this.resizeScroll.observe(view.scrollDOM);\n            this.resizeContent = new ResizeObserver(() => this.view.requestMeasure());\n            this.resizeContent.observe(view.contentDOM);\n        }\n        this.addWindowListeners(this.win = view.win);\n        this.start();\n        if (typeof IntersectionObserver == \"function\") {\n            this.intersection = new IntersectionObserver(entries => {\n                if (this.parentCheck < 0)\n                    this.parentCheck = setTimeout(this.listenForScroll.bind(this), 1000);\n                if (entries.length > 0 && (entries[entries.length - 1].intersectionRatio > 0) != this.intersecting) {\n                    this.intersecting = !this.intersecting;\n                    if (this.intersecting != this.view.inView)\n                        this.onScrollChanged(document.createEvent(\"Event\"));\n                }\n            }, { threshold: [0, .001] });\n            this.intersection.observe(this.dom);\n            this.gapIntersection = new IntersectionObserver(entries => {\n                if (entries.length > 0 && entries[entries.length - 1].intersectionRatio > 0)\n                    this.onScrollChanged(document.createEvent(\"Event\"));\n            }, {});\n        }\n        this.listenForScroll();\n        this.readSelectionRange();\n    }\n    onScrollChanged(e) {\n        this.view.inputState.runScrollHandlers(this.view, e);\n        if (this.intersecting)\n            this.view.measure();\n    }\n    onScroll(e) {\n        if (this.intersecting)\n            this.flush(false);\n        this.onScrollChanged(e);\n    }\n    onResize() {\n        if (this.resizeTimeout < 0)\n            this.resizeTimeout = setTimeout(() => {\n                this.resizeTimeout = -1;\n                this.view.requestMeasure();\n            }, 50);\n    }\n    onPrint() {\n        this.view.viewState.printing = true;\n        this.view.measure();\n        setTimeout(() => {\n            this.view.viewState.printing = false;\n            this.view.requestMeasure();\n        }, 500);\n    }\n    updateGaps(gaps) {\n        if (this.gapIntersection && (gaps.length != this.gaps.length || this.gaps.some((g, i) => g != gaps[i]))) {\n            this.gapIntersection.disconnect();\n            for (let gap of gaps)\n                this.gapIntersection.observe(gap);\n            this.gaps = gaps;\n        }\n    }\n    onSelectionChange(event) {\n        let wasChanged = this.selectionChanged;\n        if (!this.readSelectionRange() || this.delayedAndroidKey)\n            return;\n        let { view } = this, sel = this.selectionRange;\n        if (view.state.facet(editable) ? view.root.activeElement != this.dom : !hasSelection(view.dom, sel))\n            return;\n        let context = sel.anchorNode && view.docView.nearest(sel.anchorNode);\n        if (context && context.ignoreEvent(event)) {\n            if (!wasChanged)\n                this.selectionChanged = false;\n            return;\n        }\n        // Deletions on IE11 fire their events in the wrong order, giving\n        // us a selection change event before the DOM changes are\n        // reported.\n        // Chrome Android has a similar issue when backspacing out a\n        // selection (#645).\n        if ((browser.ie && browser.ie_version <= 11 || browser.android && browser.chrome) && !view.state.selection.main.empty &&\n            // (Selection.isCollapsed isn't reliable on IE)\n            sel.focusNode && isEquivalentPosition(sel.focusNode, sel.focusOffset, sel.anchorNode, sel.anchorOffset))\n            this.flushSoon();\n        else\n            this.flush(false);\n    }\n    readSelectionRange() {\n        let { view } = this;\n        // The Selection object is broken in shadow roots in Safari. See\n        // https://github.com/codemirror/dev/issues/414\n        let range = browser.safari && view.root.nodeType == 11 &&\n            deepActiveElement(this.dom.ownerDocument) == this.dom &&\n            safariSelectionRangeHack(this.view) || getSelection(view.root);\n        if (!range || this.selectionRange.eq(range))\n            return false;\n        let local = hasSelection(this.dom, range);\n        // Detect the situation where the browser has, on focus, moved the\n        // selection to the start of the content element. Reset it to the\n        // position from the editor state.\n        if (local && !this.selectionChanged &&\n            view.inputState.lastFocusTime > Date.now() - 200 &&\n            view.inputState.lastTouchTime < Date.now() - 300 &&\n            atElementStart(this.dom, range)) {\n            this.view.inputState.lastFocusTime = 0;\n            view.docView.updateSelection();\n            return false;\n        }\n        this.selectionRange.setRange(range);\n        if (local)\n            this.selectionChanged = true;\n        return true;\n    }\n    setSelectionRange(anchor, head) {\n        this.selectionRange.set(anchor.node, anchor.offset, head.node, head.offset);\n        this.selectionChanged = false;\n    }\n    clearSelectionRange() {\n        this.selectionRange.set(null, 0, null, 0);\n    }\n    listenForScroll() {\n        this.parentCheck = -1;\n        let i = 0, changed = null;\n        for (let dom = this.dom; dom;) {\n            if (dom.nodeType == 1) {\n                if (!changed && i < this.scrollTargets.length && this.scrollTargets[i] == dom)\n                    i++;\n                else if (!changed)\n                    changed = this.scrollTargets.slice(0, i);\n                if (changed)\n                    changed.push(dom);\n                dom = dom.assignedSlot || dom.parentNode;\n            }\n            else if (dom.nodeType == 11) { // Shadow root\n                dom = dom.host;\n            }\n            else {\n                break;\n            }\n        }\n        if (i < this.scrollTargets.length && !changed)\n            changed = this.scrollTargets.slice(0, i);\n        if (changed) {\n            for (let dom of this.scrollTargets)\n                dom.removeEventListener(\"scroll\", this.onScroll);\n            for (let dom of this.scrollTargets = changed)\n                dom.addEventListener(\"scroll\", this.onScroll);\n        }\n    }\n    ignore(f) {\n        if (!this.active)\n            return f();\n        try {\n            this.stop();\n            return f();\n        }\n        finally {\n            this.start();\n            this.clear();\n        }\n    }\n    start() {\n        if (this.active)\n            return;\n        this.observer.observe(this.dom, observeOptions);\n        if (useCharData)\n            this.dom.addEventListener(\"DOMCharacterDataModified\", this.onCharData);\n        this.active = true;\n    }\n    stop() {\n        if (!this.active)\n            return;\n        this.active = false;\n        this.observer.disconnect();\n        if (useCharData)\n            this.dom.removeEventListener(\"DOMCharacterDataModified\", this.onCharData);\n    }\n    // Throw away any pending changes\n    clear() {\n        this.processRecords();\n        this.queue.length = 0;\n        this.selectionChanged = false;\n    }\n    // Chrome Android, especially in combination with GBoard, not only\n    // doesn't reliably fire regular key events, but also often\n    // surrounds the effect of enter or backspace with a bunch of\n    // composition events that, when interrupted, cause text duplication\n    // or other kinds of corruption. This hack makes the editor back off\n    // from handling DOM changes for a moment when such a key is\n    // detected (via beforeinput or keydown), and then tries to flush\n    // them or, if that has no effect, dispatches the given key.\n    delayAndroidKey(key, keyCode) {\n        var _a;\n        if (!this.delayedAndroidKey) {\n            let flush = () => {\n                let key = this.delayedAndroidKey;\n                if (key) {\n                    this.clearDelayedAndroidKey();\n                    this.view.inputState.lastKeyCode = key.keyCode;\n                    this.view.inputState.lastKeyTime = Date.now();\n                    let flushed = this.flush();\n                    if (!flushed && key.force)\n                        dispatchKey(this.dom, key.key, key.keyCode);\n                }\n            };\n            this.flushingAndroidKey = this.view.win.requestAnimationFrame(flush);\n        }\n        // Since backspace beforeinput is sometimes signalled spuriously,\n        // Enter always takes precedence.\n        if (!this.delayedAndroidKey || key == \"Enter\")\n            this.delayedAndroidKey = {\n                key, keyCode,\n                // Only run the key handler when no changes are detected if\n                // this isn't coming right after another change, in which case\n                // it is probably part of a weird chain of updates, and should\n                // be ignored if it returns the DOM to its previous state.\n                force: this.lastChange < Date.now() - 50 || !!((_a = this.delayedAndroidKey) === null || _a === void 0 ? void 0 : _a.force)\n            };\n    }\n    clearDelayedAndroidKey() {\n        this.win.cancelAnimationFrame(this.flushingAndroidKey);\n        this.delayedAndroidKey = null;\n        this.flushingAndroidKey = -1;\n    }\n    flushSoon() {\n        if (this.delayedFlush < 0)\n            this.delayedFlush = this.view.win.requestAnimationFrame(() => { this.delayedFlush = -1; this.flush(); });\n    }\n    forceFlush() {\n        if (this.delayedFlush >= 0) {\n            this.view.win.cancelAnimationFrame(this.delayedFlush);\n            this.delayedFlush = -1;\n        }\n        this.flush();\n    }\n    pendingRecords() {\n        for (let mut of this.observer.takeRecords())\n            this.queue.push(mut);\n        return this.queue;\n    }\n    processRecords() {\n        let records = this.pendingRecords();\n        if (records.length)\n            this.queue = [];\n        let from = -1, to = -1, typeOver = false;\n        for (let record of records) {\n            let range = this.readMutation(record);\n            if (!range)\n                continue;\n            if (range.typeOver)\n                typeOver = true;\n            if (from == -1) {\n                ({ from, to } = range);\n            }\n            else {\n                from = Math.min(range.from, from);\n                to = Math.max(range.to, to);\n            }\n        }\n        return { from, to, typeOver };\n    }\n    readChange() {\n        let { from, to, typeOver } = this.processRecords();\n        let newSel = this.selectionChanged && hasSelection(this.dom, this.selectionRange);\n        if (from < 0 && !newSel)\n            return null;\n        if (from > -1)\n            this.lastChange = Date.now();\n        this.view.inputState.lastFocusTime = 0;\n        this.selectionChanged = false;\n        return new DOMChange(this.view, from, to, typeOver);\n    }\n    // Apply pending changes, if any\n    flush(readSelection = true) {\n        // Completely hold off flushing when pending keys are set—the code\n        // managing those will make sure processRecords is called and the\n        // view is resynchronized after\n        if (this.delayedFlush >= 0 || this.delayedAndroidKey)\n            return false;\n        if (readSelection)\n            this.readSelectionRange();\n        let domChange = this.readChange();\n        if (!domChange)\n            return false;\n        let startState = this.view.state;\n        let handled = applyDOMChange(this.view, domChange);\n        // The view wasn't updated\n        if (this.view.state == startState)\n            this.view.update([]);\n        return handled;\n    }\n    readMutation(rec) {\n        let cView = this.view.docView.nearest(rec.target);\n        if (!cView || cView.ignoreMutation(rec))\n            return null;\n        cView.markDirty(rec.type == \"attributes\");\n        if (rec.type == \"attributes\")\n            cView.dirty |= 4 /* Attrs */;\n        if (rec.type == \"childList\") {\n            let childBefore = findChild(cView, rec.previousSibling || rec.target.previousSibling, -1);\n            let childAfter = findChild(cView, rec.nextSibling || rec.target.nextSibling, 1);\n            return { from: childBefore ? cView.posAfter(childBefore) : cView.posAtStart,\n                to: childAfter ? cView.posBefore(childAfter) : cView.posAtEnd, typeOver: false };\n        }\n        else if (rec.type == \"characterData\") {\n            return { from: cView.posAtStart, to: cView.posAtEnd, typeOver: rec.target.nodeValue == rec.oldValue };\n        }\n        else {\n            return null;\n        }\n    }\n    setWindow(win) {\n        if (win != this.win) {\n            this.removeWindowListeners(this.win);\n            this.win = win;\n            this.addWindowListeners(this.win);\n        }\n    }\n    addWindowListeners(win) {\n        win.addEventListener(\"resize\", this.onResize);\n        win.addEventListener(\"beforeprint\", this.onPrint);\n        win.addEventListener(\"scroll\", this.onScroll);\n        win.document.addEventListener(\"selectionchange\", this.onSelectionChange);\n    }\n    removeWindowListeners(win) {\n        win.removeEventListener(\"scroll\", this.onScroll);\n        win.removeEventListener(\"resize\", this.onResize);\n        win.removeEventListener(\"beforeprint\", this.onPrint);\n        win.document.removeEventListener(\"selectionchange\", this.onSelectionChange);\n    }\n    destroy() {\n        var _a, _b, _c, _d;\n        this.stop();\n        (_a = this.intersection) === null || _a === void 0 ? void 0 : _a.disconnect();\n        (_b = this.gapIntersection) === null || _b === void 0 ? void 0 : _b.disconnect();\n        (_c = this.resizeScroll) === null || _c === void 0 ? void 0 : _c.disconnect();\n        (_d = this.resizeContent) === null || _d === void 0 ? void 0 : _d.disconnect();\n        for (let dom of this.scrollTargets)\n            dom.removeEventListener(\"scroll\", this.onScroll);\n        this.removeWindowListeners(this.win);\n        clearTimeout(this.parentCheck);\n        clearTimeout(this.resizeTimeout);\n        this.win.cancelAnimationFrame(this.delayedFlush);\n        this.win.cancelAnimationFrame(this.flushingAndroidKey);\n    }\n}\nfunction findChild(cView, dom, dir) {\n    while (dom) {\n        let curView = ContentView.get(dom);\n        if (curView && curView.parent == cView)\n            return curView;\n        let parent = dom.parentNode;\n        dom = parent != cView.dom ? parent : dir > 0 ? dom.nextSibling : dom.previousSibling;\n    }\n    return null;\n}\n// Used to work around a Safari Selection/shadow DOM bug (#414)\nfunction safariSelectionRangeHack(view) {\n    let found = null;\n    // Because Safari (at least in 2018-2021) doesn't provide regular\n    // access to the selection inside a shadowroot, we have to perform a\n    // ridiculous hack to get at it—using `execCommand` to trigger a\n    // `beforeInput` event so that we can read the target range from the\n    // event.\n    function read(event) {\n        event.preventDefault();\n        event.stopImmediatePropagation();\n        found = event.getTargetRanges()[0];\n    }\n    view.contentDOM.addEventListener(\"beforeinput\", read, true);\n    view.dom.ownerDocument.execCommand(\"indent\");\n    view.contentDOM.removeEventListener(\"beforeinput\", read, true);\n    if (!found)\n        return null;\n    let anchorNode = found.startContainer, anchorOffset = found.startOffset;\n    let focusNode = found.endContainer, focusOffset = found.endOffset;\n    let curAnchor = view.docView.domAtPos(view.state.selection.main.anchor);\n    // Since such a range doesn't distinguish between anchor and head,\n    // use a heuristic that flips it around if its end matches the\n    // current anchor.\n    if (isEquivalentPosition(curAnchor.node, curAnchor.offset, focusNode, focusOffset))\n        [anchorNode, anchorOffset, focusNode, focusOffset] = [focusNode, focusOffset, anchorNode, anchorOffset];\n    return { anchorNode, anchorOffset, focusNode, focusOffset };\n}\n\n// The editor's update state machine looks something like this:\n//\n//     Idle → Updating ⇆ Idle (unchecked) → Measuring → Idle\n//                                         ↑      ↓\n//                                         Updating (measure)\n//\n// The difference between 'Idle' and 'Idle (unchecked)' lies in\n// whether a layout check has been scheduled. A regular update through\n// the `update` method updates the DOM in a write-only fashion, and\n// relies on a check (scheduled with `requestAnimationFrame`) to make\n// sure everything is where it should be and the viewport covers the\n// visible code. That check continues to measure and then optionally\n// update until it reaches a coherent state.\n/**\nAn editor view represents the editor's user interface. It holds\nthe editable DOM surface, and possibly other elements such as the\nline number gutter. It handles events and dispatches state\ntransactions for editing actions.\n*/\nclass EditorView {\n    /**\n    Construct a new view. You'll want to either provide a `parent`\n    option, or put `view.dom` into your document after creating a\n    view, so that the user can see the editor.\n    */\n    constructor(config = {}) {\n        this.plugins = [];\n        this.pluginMap = new Map;\n        this.editorAttrs = {};\n        this.contentAttrs = {};\n        this.bidiCache = [];\n        this.destroyed = false;\n        /**\n        @internal\n        */\n        this.updateState = 2 /* Updating */;\n        /**\n        @internal\n        */\n        this.measureScheduled = -1;\n        /**\n        @internal\n        */\n        this.measureRequests = [];\n        this.contentDOM = document.createElement(\"div\");\n        this.scrollDOM = document.createElement(\"div\");\n        this.scrollDOM.tabIndex = -1;\n        this.scrollDOM.className = \"cm-scroller\";\n        this.scrollDOM.appendChild(this.contentDOM);\n        this.announceDOM = document.createElement(\"div\");\n        this.announceDOM.style.cssText = \"position: fixed; top: -10000px\";\n        this.announceDOM.setAttribute(\"aria-live\", \"polite\");\n        this.dom = document.createElement(\"div\");\n        this.dom.appendChild(this.announceDOM);\n        this.dom.appendChild(this.scrollDOM);\n        this._dispatch = config.dispatch || ((tr) => this.update([tr]));\n        this.dispatch = this.dispatch.bind(this);\n        this._root = (config.root || getRoot(config.parent) || document);\n        this.viewState = new ViewState(config.state || EditorState.create(config));\n        this.plugins = this.state.facet(viewPlugin).map(spec => new PluginInstance(spec));\n        for (let plugin of this.plugins)\n            plugin.update(this);\n        this.observer = new DOMObserver(this);\n        this.inputState = new InputState(this);\n        this.inputState.ensureHandlers(this, this.plugins);\n        this.docView = new DocView(this);\n        this.mountStyles();\n        this.updateAttrs();\n        this.updateState = 0 /* Idle */;\n        this.requestMeasure();\n        if (config.parent)\n            config.parent.appendChild(this.dom);\n    }\n    /**\n    The current editor state.\n    */\n    get state() { return this.viewState.state; }\n    /**\n    To be able to display large documents without consuming too much\n    memory or overloading the browser, CodeMirror only draws the\n    code that is visible (plus a margin around it) to the DOM. This\n    property tells you the extent of the current drawn viewport, in\n    document positions.\n    */\n    get viewport() { return this.viewState.viewport; }\n    /**\n    When there are, for example, large collapsed ranges in the\n    viewport, its size can be a lot bigger than the actual visible\n    content. Thus, if you are doing something like styling the\n    content in the viewport, it is preferable to only do so for\n    these ranges, which are the subset of the viewport that is\n    actually drawn.\n    */\n    get visibleRanges() { return this.viewState.visibleRanges; }\n    /**\n    Returns false when the editor is entirely scrolled out of view\n    or otherwise hidden.\n    */\n    get inView() { return this.viewState.inView; }\n    /**\n    Indicates whether the user is currently composing text via\n    [IME](https://en.wikipedia.org/wiki/Input_method), and at least\n    one change has been made in the current composition.\n    */\n    get composing() { return this.inputState.composing > 0; }\n    /**\n    Indicates whether the user is currently in composing state. Note\n    that on some platforms, like Android, this will be the case a\n    lot, since just putting the cursor on a word starts a\n    composition there.\n    */\n    get compositionStarted() { return this.inputState.composing >= 0; }\n    /**\n    The document or shadow root that the view lives in.\n    */\n    get root() { return this._root; }\n    /**\n    @internal\n    */\n    get win() { return this.dom.ownerDocument.defaultView || window; }\n    dispatch(...input) {\n        let tr = input.length == 1 && input[0] instanceof Transaction ? input[0]\n            : this.state.update(...input);\n        this._dispatch(tr, this);\n    }\n    /**\n    Update the view for the given array of transactions. This will\n    update the visible document and selection to match the state\n    produced by the transactions, and notify view plugins of the\n    change. You should usually call\n    [`dispatch`](https://codemirror.net/6/docs/ref/#view.EditorView.dispatch) instead, which uses this\n    as a primitive.\n    */\n    update(transactions) {\n        if (this.updateState != 0 /* Idle */)\n            throw new Error(\"Calls to EditorView.update are not allowed while an update is in progress\");\n        let redrawn = false, attrsChanged = false, update;\n        let state = this.state;\n        for (let tr of transactions) {\n            if (tr.startState != state)\n                throw new RangeError(\"Trying to update state with a transaction that doesn't start from the previous state.\");\n            state = tr.state;\n        }\n        if (this.destroyed) {\n            this.viewState.state = state;\n            return;\n        }\n        let focus = this.hasFocus, focusFlag = 0, dispatchFocus = null;\n        if (transactions.some(tr => tr.annotation(isFocusChange))) {\n            this.inputState.notifiedFocused = focus;\n            // If a focus-change transaction is being dispatched, set this update flag.\n            focusFlag = 1 /* Focus */;\n        }\n        else if (focus != this.inputState.notifiedFocused) {\n            this.inputState.notifiedFocused = focus;\n            // Schedule a separate focus transaction if necessary, otherwise\n            // add a flag to this update\n            dispatchFocus = focusChangeTransaction(state, focus);\n            if (!dispatchFocus)\n                focusFlag = 1 /* Focus */;\n        }\n        // If there was a pending DOM change, eagerly read it and try to\n        // apply it after the given transactions.\n        let pendingKey = this.observer.delayedAndroidKey, domChange = null;\n        if (pendingKey) {\n            this.observer.clearDelayedAndroidKey();\n            domChange = this.observer.readChange();\n            // Only try to apply DOM changes if the transactions didn't\n            // change the doc or selection.\n            if (domChange && !this.state.doc.eq(state.doc) || !this.state.selection.eq(state.selection))\n                domChange = null;\n        }\n        else {\n            this.observer.clear();\n        }\n        // When the phrases change, redraw the editor\n        if (state.facet(EditorState.phrases) != this.state.facet(EditorState.phrases))\n            return this.setState(state);\n        update = ViewUpdate.create(this, state, transactions);\n        update.flags |= focusFlag;\n        let scrollTarget = this.viewState.scrollTarget;\n        try {\n            this.updateState = 2 /* Updating */;\n            for (let tr of transactions) {\n                if (scrollTarget)\n                    scrollTarget = scrollTarget.map(tr.changes);\n                if (tr.scrollIntoView) {\n                    let { main } = tr.state.selection;\n                    scrollTarget = new ScrollTarget(main.empty ? main : EditorSelection.cursor(main.head, main.head > main.anchor ? -1 : 1));\n                }\n                for (let e of tr.effects)\n                    if (e.is(scrollIntoView))\n                        scrollTarget = e.value;\n            }\n            this.viewState.update(update, scrollTarget);\n            this.bidiCache = CachedOrder.update(this.bidiCache, update.changes);\n            if (!update.empty) {\n                this.updatePlugins(update);\n                this.inputState.update(update);\n            }\n            redrawn = this.docView.update(update);\n            if (this.state.facet(styleModule) != this.styleModules)\n                this.mountStyles();\n            attrsChanged = this.updateAttrs();\n            this.showAnnouncements(transactions);\n            this.docView.updateSelection(redrawn, transactions.some(tr => tr.isUserEvent(\"select.pointer\")));\n        }\n        finally {\n            this.updateState = 0 /* Idle */;\n        }\n        if (update.startState.facet(theme) != update.state.facet(theme))\n            this.viewState.mustMeasureContent = true;\n        if (redrawn || attrsChanged || scrollTarget || this.viewState.mustEnforceCursorAssoc || this.viewState.mustMeasureContent)\n            this.requestMeasure();\n        if (!update.empty)\n            for (let listener of this.state.facet(updateListener))\n                listener(update);\n        if (dispatchFocus || domChange)\n            Promise.resolve().then(() => {\n                if (dispatchFocus && this.state == dispatchFocus.startState)\n                    this.dispatch(dispatchFocus);\n                if (domChange) {\n                    if (!applyDOMChange(this, domChange) && pendingKey.force)\n                        dispatchKey(this.contentDOM, pendingKey.key, pendingKey.keyCode);\n                }\n            });\n    }\n    /**\n    Reset the view to the given state. (This will cause the entire\n    document to be redrawn and all view plugins to be reinitialized,\n    so you should probably only use it when the new state isn't\n    derived from the old state. Otherwise, use\n    [`dispatch`](https://codemirror.net/6/docs/ref/#view.EditorView.dispatch) instead.)\n    */\n    setState(newState) {\n        if (this.updateState != 0 /* Idle */)\n            throw new Error(\"Calls to EditorView.setState are not allowed while an update is in progress\");\n        if (this.destroyed) {\n            this.viewState.state = newState;\n            return;\n        }\n        this.updateState = 2 /* Updating */;\n        let hadFocus = this.hasFocus;\n        try {\n            for (let plugin of this.plugins)\n                plugin.destroy(this);\n            this.viewState = new ViewState(newState);\n            this.plugins = newState.facet(viewPlugin).map(spec => new PluginInstance(spec));\n            this.pluginMap.clear();\n            for (let plugin of this.plugins)\n                plugin.update(this);\n            this.docView = new DocView(this);\n            this.inputState.ensureHandlers(this, this.plugins);\n            this.mountStyles();\n            this.updateAttrs();\n            this.bidiCache = [];\n        }\n        finally {\n            this.updateState = 0 /* Idle */;\n        }\n        if (hadFocus)\n            this.focus();\n        this.requestMeasure();\n    }\n    updatePlugins(update) {\n        let prevSpecs = update.startState.facet(viewPlugin), specs = update.state.facet(viewPlugin);\n        if (prevSpecs != specs) {\n            let newPlugins = [];\n            for (let spec of specs) {\n                let found = prevSpecs.indexOf(spec);\n                if (found < 0) {\n                    newPlugins.push(new PluginInstance(spec));\n                }\n                else {\n                    let plugin = this.plugins[found];\n                    plugin.mustUpdate = update;\n                    newPlugins.push(plugin);\n                }\n            }\n            for (let plugin of this.plugins)\n                if (plugin.mustUpdate != update)\n                    plugin.destroy(this);\n            this.plugins = newPlugins;\n            this.pluginMap.clear();\n            this.inputState.ensureHandlers(this, this.plugins);\n        }\n        else {\n            for (let p of this.plugins)\n                p.mustUpdate = update;\n        }\n        for (let i = 0; i < this.plugins.length; i++)\n            this.plugins[i].update(this);\n    }\n    /**\n    @internal\n    */\n    measure(flush = true) {\n        if (this.destroyed)\n            return;\n        if (this.measureScheduled > -1)\n            this.win.cancelAnimationFrame(this.measureScheduled);\n        this.measureScheduled = 0; // Prevent requestMeasure calls from scheduling another animation frame\n        if (flush)\n            this.observer.forceFlush();\n        let updated = null;\n        let sDOM = this.scrollDOM, { scrollTop } = sDOM;\n        let { scrollAnchorPos, scrollAnchorHeight } = this.viewState;\n        if (scrollTop != this.viewState.scrollTop)\n            scrollAnchorHeight = -1;\n        this.viewState.scrollAnchorHeight = -1;\n        try {\n            for (let i = 0;; i++) {\n                if (scrollAnchorHeight < 0) {\n                    if (isScrolledToBottom(sDOM)) {\n                        scrollAnchorPos = -1;\n                        scrollAnchorHeight = this.viewState.heightMap.height;\n                    }\n                    else {\n                        let block = this.viewState.scrollAnchorAt(scrollTop);\n                        scrollAnchorPos = block.from;\n                        scrollAnchorHeight = block.top;\n                    }\n                }\n                this.updateState = 1 /* Measuring */;\n                let changed = this.viewState.measure(this);\n                if (!changed && !this.measureRequests.length && this.viewState.scrollTarget == null)\n                    break;\n                if (i > 5) {\n                    console.warn(this.measureRequests.length\n                        ? \"Measure loop restarted more than 5 times\"\n                        : \"Viewport failed to stabilize\");\n                    break;\n                }\n                let measuring = [];\n                // Only run measure requests in this cycle when the viewport didn't change\n                if (!(changed & 4 /* Viewport */))\n                    [this.measureRequests, measuring] = [measuring, this.measureRequests];\n                let measured = measuring.map(m => {\n                    try {\n                        return m.read(this);\n                    }\n                    catch (e) {\n                        logException(this.state, e);\n                        return BadMeasure;\n                    }\n                });\n                let update = ViewUpdate.create(this, this.state, []), redrawn = false;\n                update.flags |= changed;\n                if (!updated)\n                    updated = update;\n                else\n                    updated.flags |= changed;\n                this.updateState = 2 /* Updating */;\n                if (!update.empty) {\n                    this.updatePlugins(update);\n                    this.inputState.update(update);\n                    this.updateAttrs();\n                    redrawn = this.docView.update(update);\n                }\n                for (let i = 0; i < measuring.length; i++)\n                    if (measured[i] != BadMeasure) {\n                        try {\n                            let m = measuring[i];\n                            if (m.write)\n                                m.write(measured[i], this);\n                        }\n                        catch (e) {\n                            logException(this.state, e);\n                        }\n                    }\n                if (redrawn)\n                    this.docView.updateSelection(true);\n                if (!update.viewportChanged && this.measureRequests.length == 0) {\n                    if (this.viewState.editorHeight) {\n                        if (this.viewState.scrollTarget) {\n                            this.docView.scrollIntoView(this.viewState.scrollTarget);\n                            this.viewState.scrollTarget = null;\n                            continue;\n                        }\n                        else {\n                            let newAnchorHeight = scrollAnchorPos < 0 ? this.viewState.heightMap.height :\n                                this.viewState.lineBlockAt(scrollAnchorPos).top;\n                            let diff = newAnchorHeight - scrollAnchorHeight;\n                            if (diff > 1 || diff < -1) {\n                                scrollTop = sDOM.scrollTop = scrollTop + diff;\n                                scrollAnchorHeight = -1;\n                                continue;\n                            }\n                        }\n                    }\n                    break;\n                }\n            }\n        }\n        finally {\n            this.updateState = 0 /* Idle */;\n            this.measureScheduled = -1;\n        }\n        if (updated && !updated.empty)\n            for (let listener of this.state.facet(updateListener))\n                listener(updated);\n    }\n    /**\n    Get the CSS classes for the currently active editor themes.\n    */\n    get themeClasses() {\n        return baseThemeID + \" \" +\n            (this.state.facet(darkTheme) ? baseDarkID : baseLightID) + \" \" +\n            this.state.facet(theme);\n    }\n    updateAttrs() {\n        let editorAttrs = attrsFromFacet(this, editorAttributes, {\n            class: \"cm-editor\" + (this.hasFocus ? \" cm-focused \" : \" \") + this.themeClasses\n        });\n        let contentAttrs = {\n            spellcheck: \"false\",\n            autocorrect: \"off\",\n            autocapitalize: \"off\",\n            translate: \"no\",\n            contenteditable: !this.state.facet(editable) ? \"false\" : \"true\",\n            class: \"cm-content\",\n            style: `${browser.tabSize}: ${this.state.tabSize}`,\n            role: \"textbox\",\n            \"aria-multiline\": \"true\"\n        };\n        if (this.state.readOnly)\n            contentAttrs[\"aria-readonly\"] = \"true\";\n        attrsFromFacet(this, contentAttributes, contentAttrs);\n        let changed = this.observer.ignore(() => {\n            let changedContent = updateAttrs(this.contentDOM, this.contentAttrs, contentAttrs);\n            let changedEditor = updateAttrs(this.dom, this.editorAttrs, editorAttrs);\n            return changedContent || changedEditor;\n        });\n        this.editorAttrs = editorAttrs;\n        this.contentAttrs = contentAttrs;\n        return changed;\n    }\n    showAnnouncements(trs) {\n        let first = true;\n        for (let tr of trs)\n            for (let effect of tr.effects)\n                if (effect.is(EditorView.announce)) {\n                    if (first)\n                        this.announceDOM.textContent = \"\";\n                    first = false;\n                    let div = this.announceDOM.appendChild(document.createElement(\"div\"));\n                    div.textContent = effect.value;\n                }\n    }\n    mountStyles() {\n        this.styleModules = this.state.facet(styleModule);\n        StyleModule.mount(this.root, this.styleModules.concat(baseTheme$1).reverse());\n    }\n    readMeasured() {\n        if (this.updateState == 2 /* Updating */)\n            throw new Error(\"Reading the editor layout isn't allowed during an update\");\n        if (this.updateState == 0 /* Idle */ && this.measureScheduled > -1)\n            this.measure(false);\n    }\n    /**\n    Schedule a layout measurement, optionally providing callbacks to\n    do custom DOM measuring followed by a DOM write phase. Using\n    this is preferable reading DOM layout directly from, for\n    example, an event handler, because it'll make sure measuring and\n    drawing done by other components is synchronized, avoiding\n    unnecessary DOM layout computations.\n    */\n    requestMeasure(request) {\n        if (this.measureScheduled < 0)\n            this.measureScheduled = this.win.requestAnimationFrame(() => this.measure());\n        if (request) {\n            if (this.measureRequests.indexOf(request) > -1)\n                return;\n            if (request.key != null)\n                for (let i = 0; i < this.measureRequests.length; i++) {\n                    if (this.measureRequests[i].key === request.key) {\n                        this.measureRequests[i] = request;\n                        return;\n                    }\n                }\n            this.measureRequests.push(request);\n        }\n    }\n    /**\n    Get the value of a specific plugin, if present. Note that\n    plugins that crash can be dropped from a view, so even when you\n    know you registered a given plugin, it is recommended to check\n    the return value of this method.\n    */\n    plugin(plugin) {\n        let known = this.pluginMap.get(plugin);\n        if (known === undefined || known && known.spec != plugin)\n            this.pluginMap.set(plugin, known = this.plugins.find(p => p.spec == plugin) || null);\n        return known && known.update(this).value;\n    }\n    /**\n    The top position of the document, in screen coordinates. This\n    may be negative when the editor is scrolled down. Points\n    directly to the top of the first line, not above the padding.\n    */\n    get documentTop() {\n        return this.contentDOM.getBoundingClientRect().top + this.viewState.paddingTop;\n    }\n    /**\n    Reports the padding above and below the document.\n    */\n    get documentPadding() {\n        return { top: this.viewState.paddingTop, bottom: this.viewState.paddingBottom };\n    }\n    /**\n    Find the text line or block widget at the given vertical\n    position (which is interpreted as relative to the [top of the\n    document](https://codemirror.net/6/docs/ref/#view.EditorView.documentTop)).\n    */\n    elementAtHeight(height) {\n        this.readMeasured();\n        return this.viewState.elementAtHeight(height);\n    }\n    /**\n    Find the line block (see\n    [`lineBlockAt`](https://codemirror.net/6/docs/ref/#view.EditorView.lineBlockAt) at the given\n    height, again interpreted relative to the [top of the\n    document](https://codemirror.net/6/docs/ref/#view.EditorView.documentTop).\n    */\n    lineBlockAtHeight(height) {\n        this.readMeasured();\n        return this.viewState.lineBlockAtHeight(height);\n    }\n    /**\n    Get the extent and vertical position of all [line\n    blocks](https://codemirror.net/6/docs/ref/#view.EditorView.lineBlockAt) in the viewport. Positions\n    are relative to the [top of the\n    document](https://codemirror.net/6/docs/ref/#view.EditorView.documentTop);\n    */\n    get viewportLineBlocks() {\n        return this.viewState.viewportLines;\n    }\n    /**\n    Find the line block around the given document position. A line\n    block is a range delimited on both sides by either a\n    non-[hidden](https://codemirror.net/6/docs/ref/#view.Decoration^replace) line breaks, or the\n    start/end of the document. It will usually just hold a line of\n    text, but may be broken into multiple textblocks by block\n    widgets.\n    */\n    lineBlockAt(pos) {\n        return this.viewState.lineBlockAt(pos);\n    }\n    /**\n    The editor's total content height.\n    */\n    get contentHeight() {\n        return this.viewState.contentHeight;\n    }\n    /**\n    Move a cursor position by [grapheme\n    cluster](https://codemirror.net/6/docs/ref/#state.findClusterBreak). `forward` determines whether\n    the motion is away from the line start, or towards it. In\n    bidirectional text, the line is traversed in visual order, using\n    the editor's [text direction](https://codemirror.net/6/docs/ref/#view.EditorView.textDirection).\n    When the start position was the last one on the line, the\n    returned position will be across the line break. If there is no\n    further line, the original position is returned.\n    \n    By default, this method moves over a single cluster. The\n    optional `by` argument can be used to move across more. It will\n    be called with the first cluster as argument, and should return\n    a predicate that determines, for each subsequent cluster,\n    whether it should also be moved over.\n    */\n    moveByChar(start, forward, by) {\n        return skipAtoms(this, start, moveByChar(this, start, forward, by));\n    }\n    /**\n    Move a cursor position across the next group of either\n    [letters](https://codemirror.net/6/docs/ref/#state.EditorState.charCategorizer) or non-letter\n    non-whitespace characters.\n    */\n    moveByGroup(start, forward) {\n        return skipAtoms(this, start, moveByChar(this, start, forward, initial => byGroup(this, start.head, initial)));\n    }\n    /**\n    Move to the next line boundary in the given direction. If\n    `includeWrap` is true, line wrapping is on, and there is a\n    further wrap point on the current line, the wrap point will be\n    returned. Otherwise this function will return the start or end\n    of the line.\n    */\n    moveToLineBoundary(start, forward, includeWrap = true) {\n        return moveToLineBoundary(this, start, forward, includeWrap);\n    }\n    /**\n    Move a cursor position vertically. When `distance` isn't given,\n    it defaults to moving to the next line (including wrapped\n    lines). Otherwise, `distance` should provide a positive distance\n    in pixels.\n    \n    When `start` has a\n    [`goalColumn`](https://codemirror.net/6/docs/ref/#state.SelectionRange.goalColumn), the vertical\n    motion will use that as a target horizontal position. Otherwise,\n    the cursor's own horizontal position is used. The returned\n    cursor will have its goal column set to whichever column was\n    used.\n    */\n    moveVertically(start, forward, distance) {\n        return skipAtoms(this, start, moveVertically(this, start, forward, distance));\n    }\n    /**\n    Find the DOM parent node and offset (child offset if `node` is\n    an element, character offset when it is a text node) at the\n    given document position.\n    \n    Note that for positions that aren't currently in\n    `visibleRanges`, the resulting DOM position isn't necessarily\n    meaningful (it may just point before or after a placeholder\n    element).\n    */\n    domAtPos(pos) {\n        return this.docView.domAtPos(pos);\n    }\n    /**\n    Find the document position at the given DOM node. Can be useful\n    for associating positions with DOM events. Will raise an error\n    when `node` isn't part of the editor content.\n    */\n    posAtDOM(node, offset = 0) {\n        return this.docView.posFromDOM(node, offset);\n    }\n    posAtCoords(coords, precise = true) {\n        this.readMeasured();\n        return posAtCoords(this, coords, precise);\n    }\n    /**\n    Get the screen coordinates at the given document position.\n    `side` determines whether the coordinates are based on the\n    element before (-1) or after (1) the position (if no element is\n    available on the given side, the method will transparently use\n    another strategy to get reasonable coordinates).\n    */\n    coordsAtPos(pos, side = 1) {\n        this.readMeasured();\n        let rect = this.docView.coordsAt(pos, side);\n        if (!rect || rect.left == rect.right)\n            return rect;\n        let line = this.state.doc.lineAt(pos), order = this.bidiSpans(line);\n        let span = order[BidiSpan.find(order, pos - line.from, -1, side)];\n        return flattenRect(rect, (span.dir == Direction.LTR) == (side > 0));\n    }\n    /**\n    The default width of a character in the editor. May not\n    accurately reflect the width of all characters (given variable\n    width fonts or styling of invididual ranges).\n    */\n    get defaultCharacterWidth() { return this.viewState.heightOracle.charWidth; }\n    /**\n    The default height of a line in the editor. May not be accurate\n    for all lines.\n    */\n    get defaultLineHeight() { return this.viewState.heightOracle.lineHeight; }\n    /**\n    The text direction\n    ([`direction`](https://developer.mozilla.org/en-US/docs/Web/CSS/direction)\n    CSS property) of the editor's content element.\n    */\n    get textDirection() { return this.viewState.defaultTextDirection; }\n    /**\n    Find the text direction of the block at the given position, as\n    assigned by CSS. If\n    [`perLineTextDirection`](https://codemirror.net/6/docs/ref/#view.EditorView^perLineTextDirection)\n    isn't enabled, or the given position is outside of the viewport,\n    this will always return the same as\n    [`textDirection`](https://codemirror.net/6/docs/ref/#view.EditorView.textDirection). Note that\n    this may trigger a DOM layout.\n    */\n    textDirectionAt(pos) {\n        let perLine = this.state.facet(perLineTextDirection);\n        if (!perLine || pos < this.viewport.from || pos > this.viewport.to)\n            return this.textDirection;\n        this.readMeasured();\n        return this.docView.textDirectionAt(pos);\n    }\n    /**\n    Whether this editor [wraps lines](https://codemirror.net/6/docs/ref/#view.EditorView.lineWrapping)\n    (as determined by the\n    [`white-space`](https://developer.mozilla.org/en-US/docs/Web/CSS/white-space)\n    CSS property of its content element).\n    */\n    get lineWrapping() { return this.viewState.heightOracle.lineWrapping; }\n    /**\n    Returns the bidirectional text structure of the given line\n    (which should be in the current document) as an array of span\n    objects. The order of these spans matches the [text\n    direction](https://codemirror.net/6/docs/ref/#view.EditorView.textDirection)—if that is\n    left-to-right, the leftmost spans come first, otherwise the\n    rightmost spans come first.\n    */\n    bidiSpans(line) {\n        if (line.length > MaxBidiLine)\n            return trivialOrder(line.length);\n        let dir = this.textDirectionAt(line.from);\n        for (let entry of this.bidiCache)\n            if (entry.from == line.from && entry.dir == dir)\n                return entry.order;\n        let order = computeOrder(line.text, dir);\n        this.bidiCache.push(new CachedOrder(line.from, line.to, dir, order));\n        return order;\n    }\n    /**\n    Check whether the editor has focus.\n    */\n    get hasFocus() {\n        var _a;\n        // Safari return false for hasFocus when the context menu is open\n        // or closing, which leads us to ignore selection changes from the\n        // context menu because it looks like the editor isn't focused.\n        // This kludges around that.\n        return (this.dom.ownerDocument.hasFocus() || browser.safari && ((_a = this.inputState) === null || _a === void 0 ? void 0 : _a.lastContextMenu) > Date.now() - 3e4) &&\n            this.root.activeElement == this.contentDOM;\n    }\n    /**\n    Put focus on the editor.\n    */\n    focus() {\n        this.observer.ignore(() => {\n            focusPreventScroll(this.contentDOM);\n            this.docView.updateSelection();\n        });\n    }\n    /**\n    Update the [root](https://codemirror.net/6/docs/ref/##view.EditorViewConfig.root) in which the editor lives. This is only\n    necessary when moving the editor's existing DOM to a new window or shadow root.\n    */\n    setRoot(root) {\n        if (this._root != root) {\n            this._root = root;\n            this.observer.setWindow((root.nodeType == 9 ? root : root.ownerDocument).defaultView || window);\n            this.mountStyles();\n        }\n    }\n    /**\n    Clean up this editor view, removing its element from the\n    document, unregistering event handlers, and notifying\n    plugins. The view instance can no longer be used after\n    calling this.\n    */\n    destroy() {\n        for (let plugin of this.plugins)\n            plugin.destroy(this);\n        this.plugins = [];\n        this.inputState.destroy();\n        this.dom.remove();\n        this.observer.destroy();\n        if (this.measureScheduled > -1)\n            this.win.cancelAnimationFrame(this.measureScheduled);\n        this.destroyed = true;\n    }\n    /**\n    Returns an effect that can be\n    [added](https://codemirror.net/6/docs/ref/#state.TransactionSpec.effects) to a transaction to\n    cause it to scroll the given position or range into view.\n    */\n    static scrollIntoView(pos, options = {}) {\n        return scrollIntoView.of(new ScrollTarget(typeof pos == \"number\" ? EditorSelection.cursor(pos) : pos, options.y, options.x, options.yMargin, options.xMargin));\n    }\n    /**\n    Returns an extension that can be used to add DOM event handlers.\n    The value should be an object mapping event names to handler\n    functions. For any given event, such functions are ordered by\n    extension precedence, and the first handler to return true will\n    be assumed to have handled that event, and no other handlers or\n    built-in behavior will be activated for it. These are registered\n    on the [content element](https://codemirror.net/6/docs/ref/#view.EditorView.contentDOM), except\n    for `scroll` handlers, which will be called any time the\n    editor's [scroll element](https://codemirror.net/6/docs/ref/#view.EditorView.scrollDOM) or one of\n    its parent nodes is scrolled.\n    */\n    static domEventHandlers(handlers) {\n        return ViewPlugin.define(() => ({}), { eventHandlers: handlers });\n    }\n    /**\n    Create a theme extension. The first argument can be a\n    [`style-mod`](https://github.com/marijnh/style-mod#documentation)\n    style spec providing the styles for the theme. These will be\n    prefixed with a generated class for the style.\n    \n    Because the selectors will be prefixed with a scope class, rule\n    that directly match the editor's [wrapper\n    element](https://codemirror.net/6/docs/ref/#view.EditorView.dom)—to which the scope class will be\n    added—need to be explicitly differentiated by adding an `&` to\n    the selector for that element—for example\n    `&.cm-focused`.\n    \n    When `dark` is set to true, the theme will be marked as dark,\n    which will cause the `&dark` rules from [base\n    themes](https://codemirror.net/6/docs/ref/#view.EditorView^baseTheme) to be used (as opposed to\n    `&light` when a light theme is active).\n    */\n    static theme(spec, options) {\n        let prefix = StyleModule.newName();\n        let result = [theme.of(prefix), styleModule.of(buildTheme(`.${prefix}`, spec))];\n        if (options && options.dark)\n            result.push(darkTheme.of(true));\n        return result;\n    }\n    /**\n    Create an extension that adds styles to the base theme. Like\n    with [`theme`](https://codemirror.net/6/docs/ref/#view.EditorView^theme), use `&` to indicate the\n    place of the editor wrapper element when directly targeting\n    that. You can also use `&dark` or `&light` instead to only\n    target editors with a dark or light theme.\n    */\n    static baseTheme(spec) {\n        return Prec.lowest(styleModule.of(buildTheme(\".\" + baseThemeID, spec, lightDarkIDs)));\n    }\n    /**\n    Retrieve an editor view instance from the view's DOM\n    representation.\n    */\n    static findFromDOM(dom) {\n        var _a;\n        let content = dom.querySelector(\".cm-content\");\n        let cView = content && ContentView.get(content) || ContentView.get(dom);\n        return ((_a = cView === null || cView === void 0 ? void 0 : cView.rootView) === null || _a === void 0 ? void 0 : _a.view) || null;\n    }\n}\n/**\nFacet to add a [style\nmodule](https://github.com/marijnh/style-mod#documentation) to\nan editor view. The view will ensure that the module is\nmounted in its [document\nroot](https://codemirror.net/6/docs/ref/#view.EditorView.constructor^config.root).\n*/\nEditorView.styleModule = styleModule;\n/**\nAn input handler can override the way changes to the editable\nDOM content are handled. Handlers are passed the document\npositions between which the change was found, and the new\ncontent. When one returns true, no further input handlers are\ncalled and the default behavior is prevented.\n*/\nEditorView.inputHandler = inputHandler;\n/**\nThis facet can be used to provide functions that create effects\nto be dispatched when the editor's focus state changes.\n*/\nEditorView.focusChangeEffect = focusChangeEffect;\n/**\nBy default, the editor assumes all its content has the same\n[text direction](https://codemirror.net/6/docs/ref/#view.Direction). Configure this with a `true`\nvalue to make it read the text direction of every (rendered)\nline separately.\n*/\nEditorView.perLineTextDirection = perLineTextDirection;\n/**\nAllows you to provide a function that should be called when the\nlibrary catches an exception from an extension (mostly from view\nplugins, but may be used by other extensions to route exceptions\nfrom user-code-provided callbacks). This is mostly useful for\ndebugging and logging. See [`logException`](https://codemirror.net/6/docs/ref/#view.logException).\n*/\nEditorView.exceptionSink = exceptionSink;\n/**\nA facet that can be used to register a function to be called\nevery time the view updates.\n*/\nEditorView.updateListener = updateListener;\n/**\nFacet that controls whether the editor content DOM is editable.\nWhen its highest-precedence value is `false`, the element will\nnot have its `contenteditable` attribute set. (Note that this\ndoesn't affect API calls that change the editor content, even\nwhen those are bound to keys or buttons. See the\n[`readOnly`](https://codemirror.net/6/docs/ref/#state.EditorState.readOnly) facet for that.)\n*/\nEditorView.editable = editable;\n/**\nAllows you to influence the way mouse selection happens. The\nfunctions in this facet will be called for a `mousedown` event\non the editor, and can return an object that overrides the way a\nselection is computed from that mouse click or drag.\n*/\nEditorView.mouseSelectionStyle = mouseSelectionStyle;\n/**\nFacet used to configure whether a given selection drag event\nshould move or copy the selection. The given predicate will be\ncalled with the `mousedown` event, and can return `true` when\nthe drag should move the content.\n*/\nEditorView.dragMovesSelection = dragMovesSelection$1;\n/**\nFacet used to configure whether a given selecting click adds a\nnew range to the existing selection or replaces it entirely. The\ndefault behavior is to check `event.metaKey` on macOS, and\n`event.ctrlKey` elsewhere.\n*/\nEditorView.clickAddsSelectionRange = clickAddsSelectionRange;\n/**\nA facet that determines which [decorations](https://codemirror.net/6/docs/ref/#view.Decoration)\nare shown in the view. Decorations can be provided in two\nways—directly, or via a function that takes an editor view.\n\nOnly decoration sets provided directly are allowed to influence\nthe editor's vertical layout structure. The ones provided as\nfunctions are called _after_ the new viewport has been computed,\nand thus **must not** introduce block widgets or replacing\ndecorations that cover line breaks.\n\nIf you want decorated ranges to behave like atomic units for\ncursor motion and deletion purposes, also provide the range set\ncontaining the decorations to\n[`EditorView.atomicRanges`](https://codemirror.net/6/docs/ref/#view.EditorView^atomicRanges).\n*/\nEditorView.decorations = decorations;\n/**\nUsed to provide ranges that should be treated as atoms as far as\ncursor motion is concerned. This causes methods like\n[`moveByChar`](https://codemirror.net/6/docs/ref/#view.EditorView.moveByChar) and\n[`moveVertically`](https://codemirror.net/6/docs/ref/#view.EditorView.moveVertically) (and the\ncommands built on top of them) to skip across such regions when\na selection endpoint would enter them. This does _not_ prevent\ndirect programmatic [selection\nupdates](https://codemirror.net/6/docs/ref/#state.TransactionSpec.selection) from moving into such\nregions.\n*/\nEditorView.atomicRanges = atomicRanges;\n/**\nFacet that allows extensions to provide additional scroll\nmargins (space around the sides of the scrolling element that\nshould be considered invisible). This can be useful when the\nplugin introduces elements that cover part of that element (for\nexample a horizontally fixed gutter).\n*/\nEditorView.scrollMargins = scrollMargins;\n/**\nThis facet records whether a dark theme is active. The extension\nreturned by [`theme`](https://codemirror.net/6/docs/ref/#view.EditorView^theme) automatically\nincludes an instance of this when the `dark` option is set to\ntrue.\n*/\nEditorView.darkTheme = darkTheme;\n/**\nFacet that provides additional DOM attributes for the editor's\neditable DOM element.\n*/\nEditorView.contentAttributes = contentAttributes;\n/**\nFacet that provides DOM attributes for the editor's outer\nelement.\n*/\nEditorView.editorAttributes = editorAttributes;\n/**\nAn extension that enables line wrapping in the editor (by\nsetting CSS `white-space` to `pre-wrap` in the content).\n*/\nEditorView.lineWrapping = /*@__PURE__*/EditorView.contentAttributes.of({ \"class\": \"cm-lineWrapping\" });\n/**\nState effect used to include screen reader announcements in a\ntransaction. These will be added to the DOM in a visually hidden\nelement with `aria-live=\"polite\"` set, and should be used to\ndescribe effects that are visually obvious but may not be\nnoticed by screen reader users (such as moving to the next\nsearch match).\n*/\nEditorView.announce = /*@__PURE__*/StateEffect.define();\n// Maximum line length for which we compute accurate bidi info\nconst MaxBidiLine = 4096;\nconst BadMeasure = {};\nclass CachedOrder {\n    constructor(from, to, dir, order) {\n        this.from = from;\n        this.to = to;\n        this.dir = dir;\n        this.order = order;\n    }\n    static update(cache, changes) {\n        if (changes.empty)\n            return cache;\n        let result = [], lastDir = cache.length ? cache[cache.length - 1].dir : Direction.LTR;\n        for (let i = Math.max(0, cache.length - 10); i < cache.length; i++) {\n            let entry = cache[i];\n            if (entry.dir == lastDir && !changes.touchesRange(entry.from, entry.to))\n                result.push(new CachedOrder(changes.mapPos(entry.from, 1), changes.mapPos(entry.to, -1), entry.dir, entry.order));\n        }\n        return result;\n    }\n}\nfunction attrsFromFacet(view, facet, base) {\n    for (let sources = view.state.facet(facet), i = sources.length - 1; i >= 0; i--) {\n        let source = sources[i], value = typeof source == \"function\" ? source(view) : source;\n        if (value)\n            combineAttrs(value, base);\n    }\n    return base;\n}\n\nconst currentPlatform = browser.mac ? \"mac\" : browser.windows ? \"win\" : browser.linux ? \"linux\" : \"key\";\nfunction normalizeKeyName(name, platform) {\n    const parts = name.split(/-(?!$)/);\n    let result = parts[parts.length - 1];\n    if (result == \"Space\")\n        result = \" \";\n    let alt, ctrl, shift, meta;\n    for (let i = 0; i < parts.length - 1; ++i) {\n        const mod = parts[i];\n        if (/^(cmd|meta|m)$/i.test(mod))\n            meta = true;\n        else if (/^a(lt)?$/i.test(mod))\n            alt = true;\n        else if (/^(c|ctrl|control)$/i.test(mod))\n            ctrl = true;\n        else if (/^s(hift)?$/i.test(mod))\n            shift = true;\n        else if (/^mod$/i.test(mod)) {\n            if (platform == \"mac\")\n                meta = true;\n            else\n                ctrl = true;\n        }\n        else\n            throw new Error(\"Unrecognized modifier name: \" + mod);\n    }\n    if (alt)\n        result = \"Alt-\" + result;\n    if (ctrl)\n        result = \"Ctrl-\" + result;\n    if (meta)\n        result = \"Meta-\" + result;\n    if (shift)\n        result = \"Shift-\" + result;\n    return result;\n}\nfunction modifiers(name, event, shift) {\n    if (event.altKey)\n        name = \"Alt-\" + name;\n    if (event.ctrlKey)\n        name = \"Ctrl-\" + name;\n    if (event.metaKey)\n        name = \"Meta-\" + name;\n    if (shift !== false && event.shiftKey)\n        name = \"Shift-\" + name;\n    return name;\n}\nconst handleKeyEvents = /*@__PURE__*/Prec.default(/*@__PURE__*/EditorView.domEventHandlers({\n    keydown(event, view) {\n        return runHandlers(getKeymap(view.state), event, view, \"editor\");\n    }\n}));\n/**\nFacet used for registering keymaps.\n\nYou can add multiple keymaps to an editor. Their priorities\ndetermine their precedence (the ones specified early or with high\npriority get checked first). When a handler has returned `true`\nfor a given key, no further handlers are called.\n*/\nconst keymap = /*@__PURE__*/Facet.define({ enables: handleKeyEvents });\nconst Keymaps = /*@__PURE__*/new WeakMap();\n// This is hidden behind an indirection, rather than directly computed\n// by the facet, to keep internal types out of the facet's type.\nfunction getKeymap(state) {\n    let bindings = state.facet(keymap);\n    let map = Keymaps.get(bindings);\n    if (!map)\n        Keymaps.set(bindings, map = buildKeymap(bindings.reduce((a, b) => a.concat(b), [])));\n    return map;\n}\n/**\nRun the key handlers registered for a given scope. The event\nobject should be a `\"keydown\"` event. Returns true if any of the\nhandlers handled it.\n*/\nfunction runScopeHandlers(view, event, scope) {\n    return runHandlers(getKeymap(view.state), event, view, scope);\n}\nlet storedPrefix = null;\nconst PrefixTimeout = 4000;\nfunction buildKeymap(bindings, platform = currentPlatform) {\n    let bound = Object.create(null);\n    let isPrefix = Object.create(null);\n    let checkPrefix = (name, is) => {\n        let current = isPrefix[name];\n        if (current == null)\n            isPrefix[name] = is;\n        else if (current != is)\n            throw new Error(\"Key binding \" + name + \" is used both as a regular binding and as a multi-stroke prefix\");\n    };\n    let add = (scope, key, command, preventDefault) => {\n        var _a, _b;\n        let scopeObj = bound[scope] || (bound[scope] = Object.create(null));\n        let parts = key.split(/ (?!$)/).map(k => normalizeKeyName(k, platform));\n        for (let i = 1; i < parts.length; i++) {\n            let prefix = parts.slice(0, i).join(\" \");\n            checkPrefix(prefix, true);\n            if (!scopeObj[prefix])\n                scopeObj[prefix] = {\n                    preventDefault: true,\n                    run: [(view) => {\n                            let ourObj = storedPrefix = { view, prefix, scope };\n                            setTimeout(() => { if (storedPrefix == ourObj)\n                                storedPrefix = null; }, PrefixTimeout);\n                            return true;\n                        }]\n                };\n        }\n        let full = parts.join(\" \");\n        checkPrefix(full, false);\n        let binding = scopeObj[full] || (scopeObj[full] = { preventDefault: false, run: ((_b = (_a = scopeObj._any) === null || _a === void 0 ? void 0 : _a.run) === null || _b === void 0 ? void 0 : _b.slice()) || [] });\n        if (command)\n            binding.run.push(command);\n        if (preventDefault)\n            binding.preventDefault = true;\n    };\n    for (let b of bindings) {\n        let scopes = b.scope ? b.scope.split(\" \") : [\"editor\"];\n        if (b.any)\n            for (let scope of scopes) {\n                let scopeObj = bound[scope] || (bound[scope] = Object.create(null));\n                if (!scopeObj._any)\n                    scopeObj._any = { preventDefault: false, run: [] };\n                for (let key in scopeObj)\n                    scopeObj[key].run.push(b.any);\n            }\n        let name = b[platform] || b.key;\n        if (!name)\n            continue;\n        for (let scope of scopes) {\n            add(scope, name, b.run, b.preventDefault);\n            if (b.shift)\n                add(scope, \"Shift-\" + name, b.shift, b.preventDefault);\n        }\n    }\n    return bound;\n}\nfunction runHandlers(map, event, view, scope) {\n    let name = keyName(event);\n    let charCode = codePointAt(name, 0), isChar = codePointSize(charCode) == name.length && name != \" \";\n    let prefix = \"\", fallthrough = false;\n    if (storedPrefix && storedPrefix.view == view && storedPrefix.scope == scope) {\n        prefix = storedPrefix.prefix + \" \";\n        if (fallthrough = modifierCodes.indexOf(event.keyCode) < 0)\n            storedPrefix = null;\n    }\n    let ran = new Set;\n    let runFor = (binding) => {\n        if (binding) {\n            for (let cmd of binding.run)\n                if (!ran.has(cmd)) {\n                    ran.add(cmd);\n                    if (cmd(view, event))\n                        return true;\n                }\n            if (binding.preventDefault)\n                fallthrough = true;\n        }\n        return false;\n    };\n    let scopeObj = map[scope], baseName, shiftName;\n    if (scopeObj) {\n        if (runFor(scopeObj[prefix + modifiers(name, event, !isChar)]))\n            return true;\n        if (isChar && (event.altKey || event.metaKey || event.ctrlKey) &&\n            // Ctrl-Alt may be used for AltGr on Windows\n            !(browser.windows && event.ctrlKey && event.altKey) &&\n            (baseName = base[event.keyCode]) && baseName != name) {\n            if (runFor(scopeObj[prefix + modifiers(baseName, event, true)]))\n                return true;\n            else if (event.shiftKey && (shiftName = shift[event.keyCode]) != name && shiftName != baseName &&\n                runFor(scopeObj[prefix + modifiers(shiftName, event, false)]))\n                return true;\n        }\n        else if (isChar && event.shiftKey) {\n            if (runFor(scopeObj[prefix + modifiers(name, event, true)]))\n                return true;\n        }\n        if (runFor(scopeObj._any))\n            return true;\n    }\n    return fallthrough;\n}\n\n/**\nImplementation of [`LayerMarker`](https://codemirror.net/6/docs/ref/#view.LayerMarker) that creates\na rectangle at a given set of coordinates.\n*/\nclass RectangleMarker {\n    /**\n    Create a marker with the given class and dimensions. If `width`\n    is null, the DOM element will get no width style.\n    */\n    constructor(className, left, top, width, height) {\n        this.className = className;\n        this.left = left;\n        this.top = top;\n        this.width = width;\n        this.height = height;\n    }\n    draw() {\n        let elt = document.createElement(\"div\");\n        elt.className = this.className;\n        this.adjust(elt);\n        return elt;\n    }\n    update(elt, prev) {\n        if (prev.className != this.className)\n            return false;\n        this.adjust(elt);\n        return true;\n    }\n    adjust(elt) {\n        elt.style.left = this.left + \"px\";\n        elt.style.top = this.top + \"px\";\n        if (this.width != null)\n            elt.style.width = this.width + \"px\";\n        elt.style.height = this.height + \"px\";\n    }\n    eq(p) {\n        return this.left == p.left && this.top == p.top && this.width == p.width && this.height == p.height &&\n            this.className == p.className;\n    }\n    /**\n    Create a set of rectangles for the given selection range,\n    assigning them theclass`className`. Will create a single\n    rectangle for empty ranges, and a set of selection-style\n    rectangles covering the range's content (in a bidi-aware\n    way) for non-empty ones.\n    */\n    static forRange(view, className, range) {\n        if (range.empty) {\n            let pos = view.coordsAtPos(range.head, range.assoc || 1);\n            if (!pos)\n                return [];\n            let base = getBase(view);\n            return [new RectangleMarker(className, pos.left - base.left, pos.top - base.top, null, pos.bottom - pos.top)];\n        }\n        else {\n            return rectanglesForRange(view, className, range);\n        }\n    }\n}\nfunction getBase(view) {\n    let rect = view.scrollDOM.getBoundingClientRect();\n    let left = view.textDirection == Direction.LTR ? rect.left : rect.right - view.scrollDOM.clientWidth;\n    return { left: left - view.scrollDOM.scrollLeft, top: rect.top - view.scrollDOM.scrollTop };\n}\nfunction wrappedLine(view, pos, inside) {\n    let range = EditorSelection.cursor(pos);\n    return { from: Math.max(inside.from, view.moveToLineBoundary(range, false, true).from),\n        to: Math.min(inside.to, view.moveToLineBoundary(range, true, true).from),\n        type: BlockType.Text };\n}\nfunction rectanglesForRange(view, className, range) {\n    if (range.to <= view.viewport.from || range.from >= view.viewport.to)\n        return [];\n    let from = Math.max(range.from, view.viewport.from), to = Math.min(range.to, view.viewport.to);\n    let ltr = view.textDirection == Direction.LTR;\n    let content = view.contentDOM, contentRect = content.getBoundingClientRect(), base = getBase(view);\n    let lineElt = content.querySelector(\".cm-line\"), lineStyle = lineElt && window.getComputedStyle(lineElt);\n    let leftSide = contentRect.left +\n        (lineStyle ? parseInt(lineStyle.paddingLeft) + Math.min(0, parseInt(lineStyle.textIndent)) : 0);\n    let rightSide = contentRect.right - (lineStyle ? parseInt(lineStyle.paddingRight) : 0);\n    let startBlock = blockAt(view, from), endBlock = blockAt(view, to);\n    let visualStart = startBlock.type == BlockType.Text ? startBlock : null;\n    let visualEnd = endBlock.type == BlockType.Text ? endBlock : null;\n    if (visualStart && (view.lineWrapping || startBlock.widgetLineBreaks))\n        visualStart = wrappedLine(view, from, visualStart);\n    if (visualEnd && (view.lineWrapping || endBlock.widgetLineBreaks))\n        visualEnd = wrappedLine(view, to, visualEnd);\n    if (visualStart && visualEnd && visualStart.from == visualEnd.from) {\n        return pieces(drawForLine(range.from, range.to, visualStart));\n    }\n    else {\n        let top = visualStart ? drawForLine(range.from, null, visualStart) : drawForWidget(startBlock, false);\n        let bottom = visualEnd ? drawForLine(null, range.to, visualEnd) : drawForWidget(endBlock, true);\n        let between = [];\n        if ((visualStart || startBlock).to < (visualEnd || endBlock).from - (visualStart && visualEnd ? 1 : 0) ||\n            startBlock.widgetLineBreaks > 1 && top.bottom + view.defaultLineHeight / 2 < bottom.top)\n            between.push(piece(leftSide, top.bottom, rightSide, bottom.top));\n        else if (top.bottom < bottom.top && view.elementAtHeight((top.bottom + bottom.top) / 2).type == BlockType.Text)\n            top.bottom = bottom.top = (top.bottom + bottom.top) / 2;\n        return pieces(top).concat(between).concat(pieces(bottom));\n    }\n    function piece(left, top, right, bottom) {\n        return new RectangleMarker(className, left - base.left, top - base.top - 0.01 /* Epsilon */, right - left, bottom - top + 0.01 /* Epsilon */);\n    }\n    function pieces({ top, bottom, horizontal }) {\n        let pieces = [];\n        for (let i = 0; i < horizontal.length; i += 2)\n            pieces.push(piece(horizontal[i], top, horizontal[i + 1], bottom));\n        return pieces;\n    }\n    // Gets passed from/to in line-local positions\n    function drawForLine(from, to, line) {\n        let top = 1e9, bottom = -1e9, horizontal = [];\n        function addSpan(from, fromOpen, to, toOpen, dir) {\n            // Passing 2/-2 is a kludge to force the view to return\n            // coordinates on the proper side of block widgets, since\n            // normalizing the side there, though appropriate for most\n            // coordsAtPos queries, would break selection drawing.\n            let fromCoords = view.coordsAtPos(from, (from == line.to ? -2 : 2));\n            let toCoords = view.coordsAtPos(to, (to == line.from ? 2 : -2));\n            if (!fromCoords || !toCoords)\n                return;\n            top = Math.min(fromCoords.top, toCoords.top, top);\n            bottom = Math.max(fromCoords.bottom, toCoords.bottom, bottom);\n            if (dir == Direction.LTR)\n                horizontal.push(ltr && fromOpen ? leftSide : fromCoords.left, ltr && toOpen ? rightSide : toCoords.right);\n            else\n                horizontal.push(!ltr && toOpen ? leftSide : toCoords.left, !ltr && fromOpen ? rightSide : fromCoords.right);\n        }\n        let start = from !== null && from !== void 0 ? from : line.from, end = to !== null && to !== void 0 ? to : line.to;\n        // Split the range by visible range and document line\n        for (let r of view.visibleRanges)\n            if (r.to > start && r.from < end) {\n                for (let pos = Math.max(r.from, start), endPos = Math.min(r.to, end);;) {\n                    let docLine = view.state.doc.lineAt(pos);\n                    for (let span of view.bidiSpans(docLine)) {\n                        let spanFrom = span.from + docLine.from, spanTo = span.to + docLine.from;\n                        if (spanFrom >= endPos)\n                            break;\n                        if (spanTo > pos)\n                            addSpan(Math.max(spanFrom, pos), from == null && spanFrom <= start, Math.min(spanTo, endPos), to == null && spanTo >= end, span.dir);\n                    }\n                    pos = docLine.to + 1;\n                    if (pos >= endPos)\n                        break;\n                }\n            }\n        if (horizontal.length == 0)\n            addSpan(start, from == null, end, to == null, view.textDirection);\n        return { top, bottom, horizontal };\n    }\n    function drawForWidget(block, top) {\n        let y = contentRect.top + (top ? block.top : block.bottom);\n        return { top: y, bottom: y, horizontal: [] };\n    }\n}\nfunction sameMarker(a, b) {\n    return a.constructor == b.constructor && a.eq(b);\n}\nclass LayerView {\n    constructor(view, layer) {\n        this.view = view;\n        this.layer = layer;\n        this.drawn = [];\n        this.measureReq = { read: this.measure.bind(this), write: this.draw.bind(this) };\n        this.dom = view.scrollDOM.appendChild(document.createElement(\"div\"));\n        this.dom.classList.add(\"cm-layer\");\n        if (layer.above)\n            this.dom.classList.add(\"cm-layer-above\");\n        if (layer.class)\n            this.dom.classList.add(layer.class);\n        this.dom.setAttribute(\"aria-hidden\", \"true\");\n        this.setOrder(view.state);\n        view.requestMeasure(this.measureReq);\n        if (layer.mount)\n            layer.mount(this.dom, view);\n    }\n    update(update) {\n        if (update.startState.facet(layerOrder) != update.state.facet(layerOrder))\n            this.setOrder(update.state);\n        if (this.layer.update(update, this.dom) || update.geometryChanged)\n            update.view.requestMeasure(this.measureReq);\n    }\n    setOrder(state) {\n        let pos = 0, order = state.facet(layerOrder);\n        while (pos < order.length && order[pos] != this.layer)\n            pos++;\n        this.dom.style.zIndex = String((this.layer.above ? 150 : -1) - pos);\n    }\n    measure() {\n        return this.layer.markers(this.view);\n    }\n    draw(markers) {\n        if (markers.length != this.drawn.length || markers.some((p, i) => !sameMarker(p, this.drawn[i]))) {\n            let old = this.dom.firstChild, oldI = 0;\n            for (let marker of markers) {\n                if (marker.update && old && marker.constructor && this.drawn[oldI].constructor &&\n                    marker.update(old, this.drawn[oldI])) {\n                    old = old.nextSibling;\n                    oldI++;\n                }\n                else {\n                    this.dom.insertBefore(marker.draw(), old);\n                }\n            }\n            while (old) {\n                let next = old.nextSibling;\n                old.remove();\n                old = next;\n            }\n            this.drawn = markers;\n        }\n    }\n    destroy() {\n        if (this.layer.destroy)\n            this.layer.destroy(this.dom, this.view);\n        this.dom.remove();\n    }\n}\nconst layerOrder = /*@__PURE__*/Facet.define();\n/**\nDefine a layer.\n*/\nfunction layer(config) {\n    return [\n        ViewPlugin.define(v => new LayerView(v, config)),\n        layerOrder.of(config)\n    ];\n}\n\nconst CanHidePrimary = !browser.ios; // FIXME test IE\nconst selectionConfig = /*@__PURE__*/Facet.define({\n    combine(configs) {\n        return combineConfig(configs, {\n            cursorBlinkRate: 1200,\n            drawRangeCursor: true\n        }, {\n            cursorBlinkRate: (a, b) => Math.min(a, b),\n            drawRangeCursor: (a, b) => a || b\n        });\n    }\n});\n/**\nReturns an extension that hides the browser's native selection and\ncursor, replacing the selection with a background behind the text\n(with the `cm-selectionBackground` class), and the\ncursors with elements overlaid over the code (using\n`cm-cursor-primary` and `cm-cursor-secondary`).\n\nThis allows the editor to display secondary selection ranges, and\ntends to produce a type of selection more in line with that users\nexpect in a text editor (the native selection styling will often\nleave gaps between lines and won't fill the horizontal space after\na line when the selection continues past it).\n\nIt does have a performance cost, in that it requires an extra DOM\nlayout cycle for many updates (the selection is drawn based on DOM\nlayout information that's only available after laying out the\ncontent).\n*/\nfunction drawSelection(config = {}) {\n    return [\n        selectionConfig.of(config),\n        cursorLayer,\n        selectionLayer,\n        hideNativeSelection,\n        nativeSelectionHidden.of(true)\n    ];\n}\nfunction configChanged(update) {\n    return update.startState.facet(selectionConfig) != update.state.facet(selectionConfig);\n}\nconst cursorLayer = /*@__PURE__*/layer({\n    above: true,\n    markers(view) {\n        let { state } = view, conf = state.facet(selectionConfig);\n        let cursors = [];\n        for (let r of state.selection.ranges) {\n            let prim = r == state.selection.main;\n            if (r.empty ? !prim || CanHidePrimary : conf.drawRangeCursor) {\n                let className = prim ? \"cm-cursor cm-cursor-primary\" : \"cm-cursor cm-cursor-secondary\";\n                let cursor = r.empty ? r : EditorSelection.cursor(r.head, r.head > r.anchor ? -1 : 1);\n                for (let piece of RectangleMarker.forRange(view, className, cursor))\n                    cursors.push(piece);\n            }\n        }\n        return cursors;\n    },\n    update(update, dom) {\n        if (update.transactions.some(tr => tr.selection))\n            dom.style.animationName = dom.style.animationName == \"cm-blink\" ? \"cm-blink2\" : \"cm-blink\";\n        let confChange = configChanged(update);\n        if (confChange)\n            setBlinkRate(update.state, dom);\n        return update.docChanged || update.selectionSet || confChange;\n    },\n    mount(dom, view) {\n        setBlinkRate(view.state, dom);\n    },\n    class: \"cm-cursorLayer\"\n});\nfunction setBlinkRate(state, dom) {\n    dom.style.animationDuration = state.facet(selectionConfig).cursorBlinkRate + \"ms\";\n}\nconst selectionLayer = /*@__PURE__*/layer({\n    above: false,\n    markers(view) {\n        return view.state.selection.ranges.map(r => r.empty ? [] : RectangleMarker.forRange(view, \"cm-selectionBackground\", r))\n            .reduce((a, b) => a.concat(b));\n    },\n    update(update, dom) {\n        return update.docChanged || update.selectionSet || update.viewportChanged || configChanged(update);\n    },\n    class: \"cm-selectionLayer\"\n});\nconst themeSpec = {\n    \".cm-line\": {\n        \"& ::selection\": { backgroundColor: \"transparent !important\" },\n        \"&::selection\": { backgroundColor: \"transparent !important\" }\n    }\n};\nif (CanHidePrimary)\n    themeSpec[\".cm-line\"].caretColor = \"transparent !important\";\nconst hideNativeSelection = /*@__PURE__*/Prec.highest(/*@__PURE__*/EditorView.theme(themeSpec));\n\nconst setDropCursorPos = /*@__PURE__*/StateEffect.define({\n    map(pos, mapping) { return pos == null ? null : mapping.mapPos(pos); }\n});\nconst dropCursorPos = /*@__PURE__*/StateField.define({\n    create() { return null; },\n    update(pos, tr) {\n        if (pos != null)\n            pos = tr.changes.mapPos(pos);\n        return tr.effects.reduce((pos, e) => e.is(setDropCursorPos) ? e.value : pos, pos);\n    }\n});\nconst drawDropCursor = /*@__PURE__*/ViewPlugin.fromClass(class {\n    constructor(view) {\n        this.view = view;\n        this.cursor = null;\n        this.measureReq = { read: this.readPos.bind(this), write: this.drawCursor.bind(this) };\n    }\n    update(update) {\n        var _a;\n        let cursorPos = update.state.field(dropCursorPos);\n        if (cursorPos == null) {\n            if (this.cursor != null) {\n                (_a = this.cursor) === null || _a === void 0 ? void 0 : _a.remove();\n                this.cursor = null;\n            }\n        }\n        else {\n            if (!this.cursor) {\n                this.cursor = this.view.scrollDOM.appendChild(document.createElement(\"div\"));\n                this.cursor.className = \"cm-dropCursor\";\n            }\n            if (update.startState.field(dropCursorPos) != cursorPos || update.docChanged || update.geometryChanged)\n                this.view.requestMeasure(this.measureReq);\n        }\n    }\n    readPos() {\n        let pos = this.view.state.field(dropCursorPos);\n        let rect = pos != null && this.view.coordsAtPos(pos);\n        if (!rect)\n            return null;\n        let outer = this.view.scrollDOM.getBoundingClientRect();\n        return {\n            left: rect.left - outer.left + this.view.scrollDOM.scrollLeft,\n            top: rect.top - outer.top + this.view.scrollDOM.scrollTop,\n            height: rect.bottom - rect.top\n        };\n    }\n    drawCursor(pos) {\n        if (this.cursor) {\n            if (pos) {\n                this.cursor.style.left = pos.left + \"px\";\n                this.cursor.style.top = pos.top + \"px\";\n                this.cursor.style.height = pos.height + \"px\";\n            }\n            else {\n                this.cursor.style.left = \"-100000px\";\n            }\n        }\n    }\n    destroy() {\n        if (this.cursor)\n            this.cursor.remove();\n    }\n    setDropPos(pos) {\n        if (this.view.state.field(dropCursorPos) != pos)\n            this.view.dispatch({ effects: setDropCursorPos.of(pos) });\n    }\n}, {\n    eventHandlers: {\n        dragover(event) {\n            this.setDropPos(this.view.posAtCoords({ x: event.clientX, y: event.clientY }));\n        },\n        dragleave(event) {\n            if (event.target == this.view.contentDOM || !this.view.contentDOM.contains(event.relatedTarget))\n                this.setDropPos(null);\n        },\n        dragend() {\n            this.setDropPos(null);\n        },\n        drop() {\n            this.setDropPos(null);\n        }\n    }\n});\n/**\nDraws a cursor at the current drop position when something is\ndragged over the editor.\n*/\nfunction dropCursor() {\n    return [dropCursorPos, drawDropCursor];\n}\n\nfunction iterMatches(doc, re, from, to, f) {\n    re.lastIndex = 0;\n    for (let cursor = doc.iterRange(from, to), pos = from, m; !cursor.next().done; pos += cursor.value.length) {\n        if (!cursor.lineBreak)\n            while (m = re.exec(cursor.value))\n                f(pos + m.index, m);\n    }\n}\nfunction matchRanges(view, maxLength) {\n    let visible = view.visibleRanges;\n    if (visible.length == 1 && visible[0].from == view.viewport.from &&\n        visible[0].to == view.viewport.to)\n        return visible;\n    let result = [];\n    for (let { from, to } of visible) {\n        from = Math.max(view.state.doc.lineAt(from).from, from - maxLength);\n        to = Math.min(view.state.doc.lineAt(to).to, to + maxLength);\n        if (result.length && result[result.length - 1].to >= from)\n            result[result.length - 1].to = to;\n        else\n            result.push({ from, to });\n    }\n    return result;\n}\n/**\nHelper class used to make it easier to maintain decorations on\nvisible code that matches a given regular expression. To be used\nin a [view plugin](https://codemirror.net/6/docs/ref/#view.ViewPlugin). Instances of this object\nrepresent a matching configuration.\n*/\nclass MatchDecorator {\n    /**\n    Create a decorator.\n    */\n    constructor(config) {\n        const { regexp, decoration, decorate, boundary, maxLength = 1000 } = config;\n        if (!regexp.global)\n            throw new RangeError(\"The regular expression given to MatchDecorator should have its 'g' flag set\");\n        this.regexp = regexp;\n        if (decorate) {\n            this.addMatch = (match, view, from, add) => decorate(add, from, from + match[0].length, match, view);\n        }\n        else if (typeof decoration == \"function\") {\n            this.addMatch = (match, view, from, add) => {\n                let deco = decoration(match, view, from);\n                if (deco)\n                    add(from, from + match[0].length, deco);\n            };\n        }\n        else if (decoration) {\n            this.addMatch = (match, _view, from, add) => add(from, from + match[0].length, decoration);\n        }\n        else {\n            throw new RangeError(\"Either 'decorate' or 'decoration' should be provided to MatchDecorator\");\n        }\n        this.boundary = boundary;\n        this.maxLength = maxLength;\n    }\n    /**\n    Compute the full set of decorations for matches in the given\n    view's viewport. You'll want to call this when initializing your\n    plugin.\n    */\n    createDeco(view) {\n        let build = new RangeSetBuilder(), add = build.add.bind(build);\n        for (let { from, to } of matchRanges(view, this.maxLength))\n            iterMatches(view.state.doc, this.regexp, from, to, (from, m) => this.addMatch(m, view, from, add));\n        return build.finish();\n    }\n    /**\n    Update a set of decorations for a view update. `deco` _must_ be\n    the set of decorations produced by _this_ `MatchDecorator` for\n    the view state before the update.\n    */\n    updateDeco(update, deco) {\n        let changeFrom = 1e9, changeTo = -1;\n        if (update.docChanged)\n            update.changes.iterChanges((_f, _t, from, to) => {\n                if (to > update.view.viewport.from && from < update.view.viewport.to) {\n                    changeFrom = Math.min(from, changeFrom);\n                    changeTo = Math.max(to, changeTo);\n                }\n            });\n        if (update.viewportChanged || changeTo - changeFrom > 1000)\n            return this.createDeco(update.view);\n        if (changeTo > -1)\n            return this.updateRange(update.view, deco.map(update.changes), changeFrom, changeTo);\n        return deco;\n    }\n    updateRange(view, deco, updateFrom, updateTo) {\n        for (let r of view.visibleRanges) {\n            let from = Math.max(r.from, updateFrom), to = Math.min(r.to, updateTo);\n            if (to > from) {\n                let fromLine = view.state.doc.lineAt(from), toLine = fromLine.to < to ? view.state.doc.lineAt(to) : fromLine;\n                let start = Math.max(r.from, fromLine.from), end = Math.min(r.to, toLine.to);\n                if (this.boundary) {\n                    for (; from > fromLine.from; from--)\n                        if (this.boundary.test(fromLine.text[from - 1 - fromLine.from])) {\n                            start = from;\n                            break;\n                        }\n                    for (; to < toLine.to; to++)\n                        if (this.boundary.test(toLine.text[to - toLine.from])) {\n                            end = to;\n                            break;\n                        }\n                }\n                let ranges = [], m;\n                let add = (from, to, deco) => ranges.push(deco.range(from, to));\n                if (fromLine == toLine) {\n                    this.regexp.lastIndex = start - fromLine.from;\n                    while ((m = this.regexp.exec(fromLine.text)) && m.index < end - fromLine.from)\n                        this.addMatch(m, view, m.index + fromLine.from, add);\n                }\n                else {\n                    iterMatches(view.state.doc, this.regexp, start, end, (from, m) => this.addMatch(m, view, from, add));\n                }\n                deco = deco.update({ filterFrom: start, filterTo: end, filter: (from, to) => from < start || to > end, add: ranges });\n            }\n        }\n        return deco;\n    }\n}\n\nconst UnicodeRegexpSupport = /x/.unicode != null ? \"gu\" : \"g\";\nconst Specials = /*@__PURE__*/new RegExp(\"[\\u0000-\\u0008\\u000a-\\u001f\\u007f-\\u009f\\u00ad\\u061c\\u200b\\u200e\\u200f\\u2028\\u2029\\u202d\\u202e\\u2066\\u2067\\u2069\\ufeff\\ufff9-\\ufffc]\", UnicodeRegexpSupport);\nconst Names = {\n    0: \"null\",\n    7: \"bell\",\n    8: \"backspace\",\n    10: \"newline\",\n    11: \"vertical tab\",\n    13: \"carriage return\",\n    27: \"escape\",\n    8203: \"zero width space\",\n    8204: \"zero width non-joiner\",\n    8205: \"zero width joiner\",\n    8206: \"left-to-right mark\",\n    8207: \"right-to-left mark\",\n    8232: \"line separator\",\n    8237: \"left-to-right override\",\n    8238: \"right-to-left override\",\n    8294: \"left-to-right isolate\",\n    8295: \"right-to-left isolate\",\n    8297: \"pop directional isolate\",\n    8233: \"paragraph separator\",\n    65279: \"zero width no-break space\",\n    65532: \"object replacement\"\n};\nlet _supportsTabSize = null;\nfunction supportsTabSize() {\n    var _a;\n    if (_supportsTabSize == null && typeof document != \"undefined\" && document.body) {\n        let styles = document.body.style;\n        _supportsTabSize = ((_a = styles.tabSize) !== null && _a !== void 0 ? _a : styles.MozTabSize) != null;\n    }\n    return _supportsTabSize || false;\n}\nconst specialCharConfig = /*@__PURE__*/Facet.define({\n    combine(configs) {\n        let config = combineConfig(configs, {\n            render: null,\n            specialChars: Specials,\n            addSpecialChars: null\n        });\n        if (config.replaceTabs = !supportsTabSize())\n            config.specialChars = new RegExp(\"\\t|\" + config.specialChars.source, UnicodeRegexpSupport);\n        if (config.addSpecialChars)\n            config.specialChars = new RegExp(config.specialChars.source + \"|\" + config.addSpecialChars.source, UnicodeRegexpSupport);\n        return config;\n    }\n});\n/**\nReturns an extension that installs highlighting of special\ncharacters.\n*/\nfunction highlightSpecialChars(\n/**\nConfiguration options.\n*/\nconfig = {}) {\n    return [specialCharConfig.of(config), specialCharPlugin()];\n}\nlet _plugin = null;\nfunction specialCharPlugin() {\n    return _plugin || (_plugin = ViewPlugin.fromClass(class {\n        constructor(view) {\n            this.view = view;\n            this.decorations = Decoration.none;\n            this.decorationCache = Object.create(null);\n            this.decorator = this.makeDecorator(view.state.facet(specialCharConfig));\n            this.decorations = this.decorator.createDeco(view);\n        }\n        makeDecorator(conf) {\n            return new MatchDecorator({\n                regexp: conf.specialChars,\n                decoration: (m, view, pos) => {\n                    let { doc } = view.state;\n                    let code = codePointAt(m[0], 0);\n                    if (code == 9) {\n                        let line = doc.lineAt(pos);\n                        let size = view.state.tabSize, col = countColumn(line.text, size, pos - line.from);\n                        return Decoration.replace({ widget: new TabWidget((size - (col % size)) * this.view.defaultCharacterWidth) });\n                    }\n                    return this.decorationCache[code] ||\n                        (this.decorationCache[code] = Decoration.replace({ widget: new SpecialCharWidget(conf, code) }));\n                },\n                boundary: conf.replaceTabs ? undefined : /[^]/\n            });\n        }\n        update(update) {\n            let conf = update.state.facet(specialCharConfig);\n            if (update.startState.facet(specialCharConfig) != conf) {\n                this.decorator = this.makeDecorator(conf);\n                this.decorations = this.decorator.createDeco(update.view);\n            }\n            else {\n                this.decorations = this.decorator.updateDeco(update, this.decorations);\n            }\n        }\n    }, {\n        decorations: v => v.decorations\n    }));\n}\nconst DefaultPlaceholder = \"\\u2022\";\n// Assigns placeholder characters from the Control Pictures block to\n// ASCII control characters\nfunction placeholder$1(code) {\n    if (code >= 32)\n        return DefaultPlaceholder;\n    if (code == 10)\n        return \"\\u2424\";\n    return String.fromCharCode(9216 + code);\n}\nclass SpecialCharWidget extends WidgetType {\n    constructor(options, code) {\n        super();\n        this.options = options;\n        this.code = code;\n    }\n    eq(other) { return other.code == this.code; }\n    toDOM(view) {\n        let ph = placeholder$1(this.code);\n        let desc = view.state.phrase(\"Control character\") + \" \" + (Names[this.code] || \"0x\" + this.code.toString(16));\n        let custom = this.options.render && this.options.render(this.code, desc, ph);\n        if (custom)\n            return custom;\n        let span = document.createElement(\"span\");\n        span.textContent = ph;\n        span.title = desc;\n        span.setAttribute(\"aria-label\", desc);\n        span.className = \"cm-specialChar\";\n        return span;\n    }\n    ignoreEvent() { return false; }\n}\nclass TabWidget extends WidgetType {\n    constructor(width) {\n        super();\n        this.width = width;\n    }\n    eq(other) { return other.width == this.width; }\n    toDOM() {\n        let span = document.createElement(\"span\");\n        span.textContent = \"\\t\";\n        span.className = \"cm-tab\";\n        span.style.width = this.width + \"px\";\n        return span;\n    }\n    ignoreEvent() { return false; }\n}\n\nconst plugin = /*@__PURE__*/ViewPlugin.fromClass(class {\n    constructor() {\n        this.height = 1000;\n        this.attrs = { style: \"padding-bottom: 1000px\" };\n    }\n    update(update) {\n        let { view } = update;\n        let height = view.viewState.editorHeight - view.defaultLineHeight - view.documentPadding.top - 0.5;\n        if (height >= 0 && height != this.height) {\n            this.height = height;\n            this.attrs = { style: `padding-bottom: ${height}px` };\n        }\n    }\n});\n/**\nReturns an extension that makes sure the content has a bottom\nmargin equivalent to the height of the editor, minus one line\nheight, so that every line in the document can be scrolled to the\ntop of the editor.\n\nThis is only meaningful when the editor is scrollable, and should\nnot be enabled in editors that take the size of their content.\n*/\nfunction scrollPastEnd() {\n    return [plugin, contentAttributes.of(view => { var _a; return ((_a = view.plugin(plugin)) === null || _a === void 0 ? void 0 : _a.attrs) || null; })];\n}\n\n/**\nMark lines that have a cursor on them with the `\"cm-activeLine\"`\nDOM class.\n*/\nfunction highlightActiveLine() {\n    return activeLineHighlighter;\n}\nconst lineDeco = /*@__PURE__*/Decoration.line({ class: \"cm-activeLine\" });\nconst activeLineHighlighter = /*@__PURE__*/ViewPlugin.fromClass(class {\n    constructor(view) {\n        this.decorations = this.getDeco(view);\n    }\n    update(update) {\n        if (update.docChanged || update.selectionSet)\n            this.decorations = this.getDeco(update.view);\n    }\n    getDeco(view) {\n        let lastLineStart = -1, deco = [];\n        for (let r of view.state.selection.ranges) {\n            let line = view.lineBlockAt(r.head);\n            if (line.from > lastLineStart) {\n                deco.push(lineDeco.range(line.from));\n                lastLineStart = line.from;\n            }\n        }\n        return Decoration.set(deco);\n    }\n}, {\n    decorations: v => v.decorations\n});\n\nclass Placeholder extends WidgetType {\n    constructor(content) {\n        super();\n        this.content = content;\n    }\n    toDOM() {\n        let wrap = document.createElement(\"span\");\n        wrap.className = \"cm-placeholder\";\n        wrap.style.pointerEvents = \"none\";\n        wrap.appendChild(typeof this.content == \"string\" ? document.createTextNode(this.content) : this.content);\n        if (typeof this.content == \"string\")\n            wrap.setAttribute(\"aria-label\", \"placeholder \" + this.content);\n        else\n            wrap.setAttribute(\"aria-hidden\", \"true\");\n        return wrap;\n    }\n    coordsAt(dom) {\n        let rects = dom.firstChild ? clientRectsFor(dom.firstChild) : [];\n        if (!rects.length)\n            return null;\n        let style = window.getComputedStyle(dom.parentNode);\n        let rect = flattenRect(rects[0], style.direction != \"rtl\");\n        let lineHeight = parseInt(style.lineHeight);\n        if (rect.bottom - rect.top > lineHeight * 1.5)\n            return { left: rect.left, right: rect.right, top: rect.top, bottom: rect.top + lineHeight };\n        return rect;\n    }\n    ignoreEvent() { return false; }\n}\n/**\nExtension that enables a placeholder—a piece of example content\nto show when the editor is empty.\n*/\nfunction placeholder(content) {\n    return ViewPlugin.fromClass(class {\n        constructor(view) {\n            this.view = view;\n            this.placeholder = Decoration.set([Decoration.widget({ widget: new Placeholder(content), side: 1 }).range(0)]);\n        }\n        get decorations() { return this.view.state.doc.length ? Decoration.none : this.placeholder; }\n    }, { decorations: v => v.decorations });\n}\n\n// Don't compute precise column positions for line offsets above this\n// (since it could get expensive). Assume offset==column for them.\nconst MaxOff = 2000;\nfunction rectangleFor(state, a, b) {\n    let startLine = Math.min(a.line, b.line), endLine = Math.max(a.line, b.line);\n    let ranges = [];\n    if (a.off > MaxOff || b.off > MaxOff || a.col < 0 || b.col < 0) {\n        let startOff = Math.min(a.off, b.off), endOff = Math.max(a.off, b.off);\n        for (let i = startLine; i <= endLine; i++) {\n            let line = state.doc.line(i);\n            if (line.length <= endOff)\n                ranges.push(EditorSelection.range(line.from + startOff, line.to + endOff));\n        }\n    }\n    else {\n        let startCol = Math.min(a.col, b.col), endCol = Math.max(a.col, b.col);\n        for (let i = startLine; i <= endLine; i++) {\n            let line = state.doc.line(i);\n            let start = findColumn(line.text, startCol, state.tabSize, true);\n            if (start < 0) {\n                ranges.push(EditorSelection.cursor(line.to));\n            }\n            else {\n                let end = findColumn(line.text, endCol, state.tabSize);\n                ranges.push(EditorSelection.range(line.from + start, line.from + end));\n            }\n        }\n    }\n    return ranges;\n}\nfunction absoluteColumn(view, x) {\n    let ref = view.coordsAtPos(view.viewport.from);\n    return ref ? Math.round(Math.abs((ref.left - x) / view.defaultCharacterWidth)) : -1;\n}\nfunction getPos(view, event) {\n    let offset = view.posAtCoords({ x: event.clientX, y: event.clientY }, false);\n    let line = view.state.doc.lineAt(offset), off = offset - line.from;\n    let col = off > MaxOff ? -1\n        : off == line.length ? absoluteColumn(view, event.clientX)\n            : countColumn(line.text, view.state.tabSize, offset - line.from);\n    return { line: line.number, col, off };\n}\nfunction rectangleSelectionStyle(view, event) {\n    let start = getPos(view, event), startSel = view.state.selection;\n    if (!start)\n        return null;\n    return {\n        update(update) {\n            if (update.docChanged) {\n                let newStart = update.changes.mapPos(update.startState.doc.line(start.line).from);\n                let newLine = update.state.doc.lineAt(newStart);\n                start = { line: newLine.number, col: start.col, off: Math.min(start.off, newLine.length) };\n                startSel = startSel.map(update.changes);\n            }\n        },\n        get(event, _extend, multiple) {\n            let cur = getPos(view, event);\n            if (!cur)\n                return startSel;\n            let ranges = rectangleFor(view.state, start, cur);\n            if (!ranges.length)\n                return startSel;\n            if (multiple)\n                return EditorSelection.create(ranges.concat(startSel.ranges));\n            else\n                return EditorSelection.create(ranges);\n        }\n    };\n}\n/**\nCreate an extension that enables rectangular selections. By\ndefault, it will react to left mouse drag with the Alt key held\ndown. When such a selection occurs, the text within the rectangle\nthat was dragged over will be selected, as one selection\n[range](https://codemirror.net/6/docs/ref/#state.SelectionRange) per line.\n*/\nfunction rectangularSelection(options) {\n    let filter = (options === null || options === void 0 ? void 0 : options.eventFilter) || (e => e.altKey && e.button == 0);\n    return EditorView.mouseSelectionStyle.of((view, event) => filter(event) ? rectangleSelectionStyle(view, event) : null);\n}\nconst keys = {\n    Alt: [18, e => !!e.altKey],\n    Control: [17, e => !!e.ctrlKey],\n    Shift: [16, e => !!e.shiftKey],\n    Meta: [91, e => !!e.metaKey]\n};\nconst showCrosshair = { style: \"cursor: crosshair\" };\n/**\nReturns an extension that turns the pointer cursor into a\ncrosshair when a given modifier key, defaulting to Alt, is held\ndown. Can serve as a visual hint that rectangular selection is\ngoing to happen when paired with\n[`rectangularSelection`](https://codemirror.net/6/docs/ref/#view.rectangularSelection).\n*/\nfunction crosshairCursor(options = {}) {\n    let [code, getter] = keys[options.key || \"Alt\"];\n    let plugin = ViewPlugin.fromClass(class {\n        constructor(view) {\n            this.view = view;\n            this.isDown = false;\n        }\n        set(isDown) {\n            if (this.isDown != isDown) {\n                this.isDown = isDown;\n                this.view.update([]);\n            }\n        }\n    }, {\n        eventHandlers: {\n            keydown(e) {\n                this.set(e.keyCode == code || getter(e));\n            },\n            keyup(e) {\n                if (e.keyCode == code || !getter(e))\n                    this.set(false);\n            },\n            mousemove(e) {\n                this.set(getter(e));\n            }\n        }\n    });\n    return [\n        plugin,\n        EditorView.contentAttributes.of(view => { var _a; return ((_a = view.plugin(plugin)) === null || _a === void 0 ? void 0 : _a.isDown) ? showCrosshair : null; })\n    ];\n}\n\nconst Outside = \"-10000px\";\nclass TooltipViewManager {\n    constructor(view, facet, createTooltipView) {\n        this.facet = facet;\n        this.createTooltipView = createTooltipView;\n        this.input = view.state.facet(facet);\n        this.tooltips = this.input.filter(t => t);\n        this.tooltipViews = this.tooltips.map(createTooltipView);\n    }\n    update(update) {\n        var _a;\n        let input = update.state.facet(this.facet);\n        let tooltips = input.filter(x => x);\n        if (input === this.input) {\n            for (let t of this.tooltipViews)\n                if (t.update)\n                    t.update(update);\n            return false;\n        }\n        let tooltipViews = [];\n        for (let i = 0; i < tooltips.length; i++) {\n            let tip = tooltips[i], known = -1;\n            if (!tip)\n                continue;\n            for (let i = 0; i < this.tooltips.length; i++) {\n                let other = this.tooltips[i];\n                if (other && other.create == tip.create)\n                    known = i;\n            }\n            if (known < 0) {\n                tooltipViews[i] = this.createTooltipView(tip);\n            }\n            else {\n                let tooltipView = tooltipViews[i] = this.tooltipViews[known];\n                if (tooltipView.update)\n                    tooltipView.update(update);\n            }\n        }\n        for (let t of this.tooltipViews)\n            if (tooltipViews.indexOf(t) < 0) {\n                t.dom.remove();\n                (_a = t.destroy) === null || _a === void 0 ? void 0 : _a.call(t);\n            }\n        this.input = input;\n        this.tooltips = tooltips;\n        this.tooltipViews = tooltipViews;\n        return true;\n    }\n}\n/**\nCreates an extension that configures tooltip behavior.\n*/\nfunction tooltips(config = {}) {\n    return tooltipConfig.of(config);\n}\nfunction windowSpace(view) {\n    let { win } = view;\n    return { top: 0, left: 0, bottom: win.innerHeight, right: win.innerWidth };\n}\nconst tooltipConfig = /*@__PURE__*/Facet.define({\n    combine: values => {\n        var _a, _b, _c;\n        return ({\n            position: browser.ios ? \"absolute\" : ((_a = values.find(conf => conf.position)) === null || _a === void 0 ? void 0 : _a.position) || \"fixed\",\n            parent: ((_b = values.find(conf => conf.parent)) === null || _b === void 0 ? void 0 : _b.parent) || null,\n            tooltipSpace: ((_c = values.find(conf => conf.tooltipSpace)) === null || _c === void 0 ? void 0 : _c.tooltipSpace) || windowSpace,\n        });\n    }\n});\nconst knownHeight = /*@__PURE__*/new WeakMap();\nconst tooltipPlugin = /*@__PURE__*/ViewPlugin.fromClass(class {\n    constructor(view) {\n        this.view = view;\n        this.inView = true;\n        this.lastTransaction = 0;\n        this.measureTimeout = -1;\n        let config = view.state.facet(tooltipConfig);\n        this.position = config.position;\n        this.parent = config.parent;\n        this.classes = view.themeClasses;\n        this.createContainer();\n        this.measureReq = { read: this.readMeasure.bind(this), write: this.writeMeasure.bind(this), key: this };\n        this.manager = new TooltipViewManager(view, showTooltip, t => this.createTooltip(t));\n        this.intersectionObserver = typeof IntersectionObserver == \"function\" ? new IntersectionObserver(entries => {\n            if (Date.now() > this.lastTransaction - 50 &&\n                entries.length > 0 && entries[entries.length - 1].intersectionRatio < 1)\n                this.measureSoon();\n        }, { threshold: [1] }) : null;\n        this.observeIntersection();\n        view.win.addEventListener(\"resize\", this.measureSoon = this.measureSoon.bind(this));\n        this.maybeMeasure();\n    }\n    createContainer() {\n        if (this.parent) {\n            this.container = document.createElement(\"div\");\n            this.container.style.position = \"relative\";\n            this.container.className = this.view.themeClasses;\n            this.parent.appendChild(this.container);\n        }\n        else {\n            this.container = this.view.dom;\n        }\n    }\n    observeIntersection() {\n        if (this.intersectionObserver) {\n            this.intersectionObserver.disconnect();\n            for (let tooltip of this.manager.tooltipViews)\n                this.intersectionObserver.observe(tooltip.dom);\n        }\n    }\n    measureSoon() {\n        if (this.measureTimeout < 0)\n            this.measureTimeout = setTimeout(() => {\n                this.measureTimeout = -1;\n                this.maybeMeasure();\n            }, 50);\n    }\n    update(update) {\n        if (update.transactions.length)\n            this.lastTransaction = Date.now();\n        let updated = this.manager.update(update);\n        if (updated)\n            this.observeIntersection();\n        let shouldMeasure = updated || update.geometryChanged;\n        let newConfig = update.state.facet(tooltipConfig);\n        if (newConfig.position != this.position) {\n            this.position = newConfig.position;\n            for (let t of this.manager.tooltipViews)\n                t.dom.style.position = this.position;\n            shouldMeasure = true;\n        }\n        if (newConfig.parent != this.parent) {\n            if (this.parent)\n                this.container.remove();\n            this.parent = newConfig.parent;\n            this.createContainer();\n            for (let t of this.manager.tooltipViews)\n                this.container.appendChild(t.dom);\n            shouldMeasure = true;\n        }\n        else if (this.parent && this.view.themeClasses != this.classes) {\n            this.classes = this.container.className = this.view.themeClasses;\n        }\n        if (shouldMeasure)\n            this.maybeMeasure();\n    }\n    createTooltip(tooltip) {\n        let tooltipView = tooltip.create(this.view);\n        tooltipView.dom.classList.add(\"cm-tooltip\");\n        if (tooltip.arrow && !tooltipView.dom.querySelector(\".cm-tooltip > .cm-tooltip-arrow\")) {\n            let arrow = document.createElement(\"div\");\n            arrow.className = \"cm-tooltip-arrow\";\n            tooltipView.dom.appendChild(arrow);\n        }\n        tooltipView.dom.style.position = this.position;\n        tooltipView.dom.style.top = Outside;\n        this.container.appendChild(tooltipView.dom);\n        if (tooltipView.mount)\n            tooltipView.mount(this.view);\n        return tooltipView;\n    }\n    destroy() {\n        var _a, _b;\n        this.view.win.removeEventListener(\"resize\", this.measureSoon);\n        for (let tooltipView of this.manager.tooltipViews) {\n            tooltipView.dom.remove();\n            (_a = tooltipView.destroy) === null || _a === void 0 ? void 0 : _a.call(tooltipView);\n        }\n        (_b = this.intersectionObserver) === null || _b === void 0 ? void 0 : _b.disconnect();\n        clearTimeout(this.measureTimeout);\n    }\n    readMeasure() {\n        let editor = this.view.dom.getBoundingClientRect();\n        return {\n            editor,\n            parent: this.parent ? this.container.getBoundingClientRect() : editor,\n            pos: this.manager.tooltips.map((t, i) => {\n                let tv = this.manager.tooltipViews[i];\n                return tv.getCoords ? tv.getCoords(t.pos) : this.view.coordsAtPos(t.pos);\n            }),\n            size: this.manager.tooltipViews.map(({ dom }) => dom.getBoundingClientRect()),\n            space: this.view.state.facet(tooltipConfig).tooltipSpace(this.view),\n        };\n    }\n    writeMeasure(measured) {\n        var _a;\n        let { editor, space } = measured;\n        let others = [];\n        for (let i = 0; i < this.manager.tooltips.length; i++) {\n            let tooltip = this.manager.tooltips[i], tView = this.manager.tooltipViews[i], { dom } = tView;\n            let pos = measured.pos[i], size = measured.size[i];\n            // Hide tooltips that are outside of the editor.\n            if (!pos || pos.bottom <= Math.max(editor.top, space.top) ||\n                pos.top >= Math.min(editor.bottom, space.bottom) ||\n                pos.right < Math.max(editor.left, space.left) - .1 ||\n                pos.left > Math.min(editor.right, space.right) + .1) {\n                dom.style.top = Outside;\n                continue;\n            }\n            let arrow = tooltip.arrow ? tView.dom.querySelector(\".cm-tooltip-arrow\") : null;\n            let arrowHeight = arrow ? 7 /* Size */ : 0;\n            let width = size.right - size.left, height = (_a = knownHeight.get(tView)) !== null && _a !== void 0 ? _a : size.bottom - size.top;\n            let offset = tView.offset || noOffset, ltr = this.view.textDirection == Direction.LTR;\n            let left = size.width > space.right - space.left ? (ltr ? space.left : space.right - size.width)\n                : ltr ? Math.min(pos.left - (arrow ? 14 /* Offset */ : 0) + offset.x, space.right - width)\n                    : Math.max(space.left, pos.left - width + (arrow ? 14 /* Offset */ : 0) - offset.x);\n            let above = !!tooltip.above;\n            if (!tooltip.strictSide && (above\n                ? pos.top - (size.bottom - size.top) - offset.y < space.top\n                : pos.bottom + (size.bottom - size.top) + offset.y > space.bottom) &&\n                above == (space.bottom - pos.bottom > pos.top - space.top))\n                above = !above;\n            let spaceVert = (above ? pos.top - space.top : space.bottom - pos.bottom) - arrowHeight;\n            if (spaceVert < height && tView.resize !== false) {\n                if (spaceVert < this.view.defaultLineHeight) {\n                    dom.style.top = Outside;\n                    continue;\n                }\n                knownHeight.set(tView, height);\n                dom.style.height = (height = spaceVert) + \"px\";\n            }\n            else if (dom.style.height) {\n                dom.style.height = \"\";\n            }\n            let top = above ? pos.top - height - arrowHeight - offset.y : pos.bottom + arrowHeight + offset.y;\n            let right = left + width;\n            if (tView.overlap !== true)\n                for (let r of others)\n                    if (r.left < right && r.right > left && r.top < top + height && r.bottom > top)\n                        top = above ? r.top - height - 2 - arrowHeight : r.bottom + arrowHeight + 2;\n            if (this.position == \"absolute\") {\n                dom.style.top = (top - measured.parent.top) + \"px\";\n                dom.style.left = (left - measured.parent.left) + \"px\";\n            }\n            else {\n                dom.style.top = top + \"px\";\n                dom.style.left = left + \"px\";\n            }\n            if (arrow)\n                arrow.style.left = `${pos.left + (ltr ? offset.x : -offset.x) - (left + 14 /* Offset */ - 7 /* Size */)}px`;\n            if (tView.overlap !== true)\n                others.push({ left, top, right, bottom: top + height });\n            dom.classList.toggle(\"cm-tooltip-above\", above);\n            dom.classList.toggle(\"cm-tooltip-below\", !above);\n            if (tView.positioned)\n                tView.positioned(measured.space);\n        }\n    }\n    maybeMeasure() {\n        if (this.manager.tooltips.length) {\n            if (this.view.inView)\n                this.view.requestMeasure(this.measureReq);\n            if (this.inView != this.view.inView) {\n                this.inView = this.view.inView;\n                if (!this.inView)\n                    for (let tv of this.manager.tooltipViews)\n                        tv.dom.style.top = Outside;\n            }\n        }\n    }\n}, {\n    eventHandlers: {\n        scroll() { this.maybeMeasure(); }\n    }\n});\nconst baseTheme = /*@__PURE__*/EditorView.baseTheme({\n    \".cm-tooltip\": {\n        zIndex: 100,\n        boxSizing: \"border-box\"\n    },\n    \"&light .cm-tooltip\": {\n        border: \"1px solid #bbb\",\n        backgroundColor: \"#f5f5f5\"\n    },\n    \"&light .cm-tooltip-section:not(:first-child)\": {\n        borderTop: \"1px solid #bbb\",\n    },\n    \"&dark .cm-tooltip\": {\n        backgroundColor: \"#333338\",\n        color: \"white\"\n    },\n    \".cm-tooltip-arrow\": {\n        height: `${7 /* Size */}px`,\n        width: `${7 /* Size */ * 2}px`,\n        position: \"absolute\",\n        zIndex: -1,\n        overflow: \"hidden\",\n        \"&:before, &:after\": {\n            content: \"''\",\n            position: \"absolute\",\n            width: 0,\n            height: 0,\n            borderLeft: `${7 /* Size */}px solid transparent`,\n            borderRight: `${7 /* Size */}px solid transparent`,\n        },\n        \".cm-tooltip-above &\": {\n            bottom: `-${7 /* Size */}px`,\n            \"&:before\": {\n                borderTop: `${7 /* Size */}px solid #bbb`,\n            },\n            \"&:after\": {\n                borderTop: `${7 /* Size */}px solid #f5f5f5`,\n                bottom: \"1px\"\n            }\n        },\n        \".cm-tooltip-below &\": {\n            top: `-${7 /* Size */}px`,\n            \"&:before\": {\n                borderBottom: `${7 /* Size */}px solid #bbb`,\n            },\n            \"&:after\": {\n                borderBottom: `${7 /* Size */}px solid #f5f5f5`,\n                top: \"1px\"\n            }\n        },\n    },\n    \"&dark .cm-tooltip .cm-tooltip-arrow\": {\n        \"&:before\": {\n            borderTopColor: \"#333338\",\n            borderBottomColor: \"#333338\"\n        },\n        \"&:after\": {\n            borderTopColor: \"transparent\",\n            borderBottomColor: \"transparent\"\n        }\n    }\n});\nconst noOffset = { x: 0, y: 0 };\n/**\nFacet to which an extension can add a value to show a tooltip.\n*/\nconst showTooltip = /*@__PURE__*/Facet.define({\n    enables: [tooltipPlugin, baseTheme]\n});\nconst showHoverTooltip = /*@__PURE__*/Facet.define();\nclass HoverTooltipHost {\n    constructor(view) {\n        this.view = view;\n        this.mounted = false;\n        this.dom = document.createElement(\"div\");\n        this.dom.classList.add(\"cm-tooltip-hover\");\n        this.manager = new TooltipViewManager(view, showHoverTooltip, t => this.createHostedView(t));\n    }\n    // Needs to be static so that host tooltip instances always match\n    static create(view) {\n        return new HoverTooltipHost(view);\n    }\n    createHostedView(tooltip) {\n        let hostedView = tooltip.create(this.view);\n        hostedView.dom.classList.add(\"cm-tooltip-section\");\n        this.dom.appendChild(hostedView.dom);\n        if (this.mounted && hostedView.mount)\n            hostedView.mount(this.view);\n        return hostedView;\n    }\n    mount(view) {\n        for (let hostedView of this.manager.tooltipViews) {\n            if (hostedView.mount)\n                hostedView.mount(view);\n        }\n        this.mounted = true;\n    }\n    positioned(space) {\n        for (let hostedView of this.manager.tooltipViews) {\n            if (hostedView.positioned)\n                hostedView.positioned(space);\n        }\n    }\n    update(update) {\n        this.manager.update(update);\n    }\n    destroy() {\n        var _a;\n        for (let t of this.manager.tooltipViews)\n            (_a = t.destroy) === null || _a === void 0 ? void 0 : _a.call(t);\n    }\n}\nconst showHoverTooltipHost = /*@__PURE__*/showTooltip.compute([showHoverTooltip], state => {\n    let tooltips = state.facet(showHoverTooltip).filter(t => t);\n    if (tooltips.length === 0)\n        return null;\n    return {\n        pos: Math.min(...tooltips.map(t => t.pos)),\n        end: Math.max(...tooltips.filter(t => t.end != null).map(t => t.end)),\n        create: HoverTooltipHost.create,\n        above: tooltips[0].above,\n        arrow: tooltips.some(t => t.arrow),\n    };\n});\nclass HoverPlugin {\n    constructor(view, source, field, setHover, hoverTime) {\n        this.view = view;\n        this.source = source;\n        this.field = field;\n        this.setHover = setHover;\n        this.hoverTime = hoverTime;\n        this.hoverTimeout = -1;\n        this.restartTimeout = -1;\n        this.pending = null;\n        this.lastMove = { x: 0, y: 0, target: view.dom, time: 0 };\n        this.checkHover = this.checkHover.bind(this);\n        view.dom.addEventListener(\"mouseleave\", this.mouseleave = this.mouseleave.bind(this));\n        view.dom.addEventListener(\"mousemove\", this.mousemove = this.mousemove.bind(this));\n    }\n    update() {\n        if (this.pending) {\n            this.pending = null;\n            clearTimeout(this.restartTimeout);\n            this.restartTimeout = setTimeout(() => this.startHover(), 20);\n        }\n    }\n    get active() {\n        return this.view.state.field(this.field);\n    }\n    checkHover() {\n        this.hoverTimeout = -1;\n        if (this.active)\n            return;\n        let hovered = Date.now() - this.lastMove.time;\n        if (hovered < this.hoverTime)\n            this.hoverTimeout = setTimeout(this.checkHover, this.hoverTime - hovered);\n        else\n            this.startHover();\n    }\n    startHover() {\n        clearTimeout(this.restartTimeout);\n        let { lastMove } = this;\n        let pos = this.view.contentDOM.contains(lastMove.target) ? this.view.posAtCoords(lastMove) : null;\n        if (pos == null)\n            return;\n        let posCoords = this.view.coordsAtPos(pos);\n        if (posCoords == null || lastMove.y < posCoords.top || lastMove.y > posCoords.bottom ||\n            lastMove.x < posCoords.left - this.view.defaultCharacterWidth ||\n            lastMove.x > posCoords.right + this.view.defaultCharacterWidth)\n            return;\n        let bidi = this.view.bidiSpans(this.view.state.doc.lineAt(pos)).find(s => s.from <= pos && s.to >= pos);\n        let rtl = bidi && bidi.dir == Direction.RTL ? -1 : 1;\n        let open = this.source(this.view, pos, (lastMove.x < posCoords.left ? -rtl : rtl));\n        if (open === null || open === void 0 ? void 0 : open.then) {\n            let pending = this.pending = { pos };\n            open.then(result => {\n                if (this.pending == pending) {\n                    this.pending = null;\n                    if (result)\n                        this.view.dispatch({ effects: this.setHover.of(result) });\n                }\n            }, e => logException(this.view.state, e, \"hover tooltip\"));\n        }\n        else if (open) {\n            this.view.dispatch({ effects: this.setHover.of(open) });\n        }\n    }\n    mousemove(event) {\n        var _a;\n        this.lastMove = { x: event.clientX, y: event.clientY, target: event.target, time: Date.now() };\n        if (this.hoverTimeout < 0)\n            this.hoverTimeout = setTimeout(this.checkHover, this.hoverTime);\n        let tooltip = this.active;\n        if (tooltip && !isInTooltip(this.lastMove.target) || this.pending) {\n            let { pos } = tooltip || this.pending, end = (_a = tooltip === null || tooltip === void 0 ? void 0 : tooltip.end) !== null && _a !== void 0 ? _a : pos;\n            if ((pos == end ? this.view.posAtCoords(this.lastMove) != pos\n                : !isOverRange(this.view, pos, end, event.clientX, event.clientY, 6 /* MaxDist */))) {\n                this.view.dispatch({ effects: this.setHover.of(null) });\n                this.pending = null;\n            }\n        }\n    }\n    mouseleave(e) {\n        clearTimeout(this.hoverTimeout);\n        this.hoverTimeout = -1;\n        if (this.active && !isInTooltip(e.relatedTarget))\n            this.view.dispatch({ effects: this.setHover.of(null) });\n    }\n    destroy() {\n        clearTimeout(this.hoverTimeout);\n        this.view.dom.removeEventListener(\"mouseleave\", this.mouseleave);\n        this.view.dom.removeEventListener(\"mousemove\", this.mousemove);\n    }\n}\nfunction isInTooltip(elt) {\n    for (let cur = elt; cur; cur = cur.parentNode)\n        if (cur.nodeType == 1 && cur.classList.contains(\"cm-tooltip\"))\n            return true;\n    return false;\n}\nfunction isOverRange(view, from, to, x, y, margin) {\n    let range = document.createRange();\n    let fromDOM = view.domAtPos(from), toDOM = view.domAtPos(to);\n    range.setEnd(toDOM.node, toDOM.offset);\n    range.setStart(fromDOM.node, fromDOM.offset);\n    let rects = range.getClientRects();\n    range.detach();\n    for (let i = 0; i < rects.length; i++) {\n        let rect = rects[i];\n        let dist = Math.max(rect.top - y, y - rect.bottom, rect.left - x, x - rect.right);\n        if (dist <= margin)\n            return true;\n    }\n    return false;\n}\n/**\nSet up a hover tooltip, which shows up when the pointer hovers\nover ranges of text. The callback is called when the mouse hovers\nover the document text. It should, if there is a tooltip\nassociated with position `pos`, return the tooltip description\n(either directly or in a promise). The `side` argument indicates\non which side of the position the pointer is—it will be -1 if the\npointer is before the position, 1 if after the position.\n\nNote that all hover tooltips are hosted within a single tooltip\ncontainer element. This allows multiple tooltips over the same\nrange to be \"merged\" together without overlapping.\n*/\nfunction hoverTooltip(source, options = {}) {\n    let setHover = StateEffect.define();\n    let hoverState = StateField.define({\n        create() { return null; },\n        update(value, tr) {\n            if (value && (options.hideOnChange && (tr.docChanged || tr.selection) ||\n                options.hideOn && options.hideOn(tr, value)))\n                return null;\n            if (value && tr.docChanged) {\n                let newPos = tr.changes.mapPos(value.pos, -1, MapMode.TrackDel);\n                if (newPos == null)\n                    return null;\n                let copy = Object.assign(Object.create(null), value);\n                copy.pos = newPos;\n                if (value.end != null)\n                    copy.end = tr.changes.mapPos(value.end);\n                value = copy;\n            }\n            for (let effect of tr.effects) {\n                if (effect.is(setHover))\n                    value = effect.value;\n                if (effect.is(closeHoverTooltipEffect))\n                    value = null;\n            }\n            return value;\n        },\n        provide: f => showHoverTooltip.from(f)\n    });\n    return [\n        hoverState,\n        ViewPlugin.define(view => new HoverPlugin(view, source, hoverState, setHover, options.hoverTime || 300 /* Time */)),\n        showHoverTooltipHost\n    ];\n}\n/**\nGet the active tooltip view for a given tooltip, if available.\n*/\nfunction getTooltip(view, tooltip) {\n    let plugin = view.plugin(tooltipPlugin);\n    if (!plugin)\n        return null;\n    let found = plugin.manager.tooltips.indexOf(tooltip);\n    return found < 0 ? null : plugin.manager.tooltipViews[found];\n}\n/**\nReturns true if any hover tooltips are currently active.\n*/\nfunction hasHoverTooltips(state) {\n    return state.facet(showHoverTooltip).some(x => x);\n}\nconst closeHoverTooltipEffect = /*@__PURE__*/StateEffect.define();\n/**\nTransaction effect that closes all hover tooltips.\n*/\nconst closeHoverTooltips = /*@__PURE__*/closeHoverTooltipEffect.of(null);\n/**\nTell the tooltip extension to recompute the position of the active\ntooltips. This can be useful when something happens (such as a\nre-positioning or CSS change affecting the editor) that could\ninvalidate the existing tooltip positions.\n*/\nfunction repositionTooltips(view) {\n    var _a;\n    (_a = view.plugin(tooltipPlugin)) === null || _a === void 0 ? void 0 : _a.maybeMeasure();\n}\n\nconst panelConfig = /*@__PURE__*/Facet.define({\n    combine(configs) {\n        let topContainer, bottomContainer;\n        for (let c of configs) {\n            topContainer = topContainer || c.topContainer;\n            bottomContainer = bottomContainer || c.bottomContainer;\n        }\n        return { topContainer, bottomContainer };\n    }\n});\n/**\nConfigures the panel-managing extension.\n*/\nfunction panels(config) {\n    return config ? [panelConfig.of(config)] : [];\n}\n/**\nGet the active panel created by the given constructor, if any.\nThis can be useful when you need access to your panels' DOM\nstructure.\n*/\nfunction getPanel(view, panel) {\n    let plugin = view.plugin(panelPlugin);\n    let index = plugin ? plugin.specs.indexOf(panel) : -1;\n    return index > -1 ? plugin.panels[index] : null;\n}\nconst panelPlugin = /*@__PURE__*/ViewPlugin.fromClass(class {\n    constructor(view) {\n        this.input = view.state.facet(showPanel);\n        this.specs = this.input.filter(s => s);\n        this.panels = this.specs.map(spec => spec(view));\n        let conf = view.state.facet(panelConfig);\n        this.top = new PanelGroup(view, true, conf.topContainer);\n        this.bottom = new PanelGroup(view, false, conf.bottomContainer);\n        this.top.sync(this.panels.filter(p => p.top));\n        this.bottom.sync(this.panels.filter(p => !p.top));\n        for (let p of this.panels) {\n            p.dom.classList.add(\"cm-panel\");\n            if (p.mount)\n                p.mount();\n        }\n    }\n    update(update) {\n        let conf = update.state.facet(panelConfig);\n        if (this.top.container != conf.topContainer) {\n            this.top.sync([]);\n            this.top = new PanelGroup(update.view, true, conf.topContainer);\n        }\n        if (this.bottom.container != conf.bottomContainer) {\n            this.bottom.sync([]);\n            this.bottom = new PanelGroup(update.view, false, conf.bottomContainer);\n        }\n        this.top.syncClasses();\n        this.bottom.syncClasses();\n        let input = update.state.facet(showPanel);\n        if (input != this.input) {\n            let specs = input.filter(x => x);\n            let panels = [], top = [], bottom = [], mount = [];\n            for (let spec of specs) {\n                let known = this.specs.indexOf(spec), panel;\n                if (known < 0) {\n                    panel = spec(update.view);\n                    mount.push(panel);\n                }\n                else {\n                    panel = this.panels[known];\n                    if (panel.update)\n                        panel.update(update);\n                }\n                panels.push(panel);\n                (panel.top ? top : bottom).push(panel);\n            }\n            this.specs = specs;\n            this.panels = panels;\n            this.top.sync(top);\n            this.bottom.sync(bottom);\n            for (let p of mount) {\n                p.dom.classList.add(\"cm-panel\");\n                if (p.mount)\n                    p.mount();\n            }\n        }\n        else {\n            for (let p of this.panels)\n                if (p.update)\n                    p.update(update);\n        }\n    }\n    destroy() {\n        this.top.sync([]);\n        this.bottom.sync([]);\n    }\n}, {\n    provide: plugin => EditorView.scrollMargins.of(view => {\n        let value = view.plugin(plugin);\n        return value && { top: value.top.scrollMargin(), bottom: value.bottom.scrollMargin() };\n    })\n});\nclass PanelGroup {\n    constructor(view, top, container) {\n        this.view = view;\n        this.top = top;\n        this.container = container;\n        this.dom = undefined;\n        this.classes = \"\";\n        this.panels = [];\n        this.syncClasses();\n    }\n    sync(panels) {\n        for (let p of this.panels)\n            if (p.destroy && panels.indexOf(p) < 0)\n                p.destroy();\n        this.panels = panels;\n        this.syncDOM();\n    }\n    syncDOM() {\n        if (this.panels.length == 0) {\n            if (this.dom) {\n                this.dom.remove();\n                this.dom = undefined;\n            }\n            return;\n        }\n        if (!this.dom) {\n            this.dom = document.createElement(\"div\");\n            this.dom.className = this.top ? \"cm-panels cm-panels-top\" : \"cm-panels cm-panels-bottom\";\n            this.dom.style[this.top ? \"top\" : \"bottom\"] = \"0\";\n            let parent = this.container || this.view.dom;\n            parent.insertBefore(this.dom, this.top ? parent.firstChild : null);\n        }\n        let curDOM = this.dom.firstChild;\n        for (let panel of this.panels) {\n            if (panel.dom.parentNode == this.dom) {\n                while (curDOM != panel.dom)\n                    curDOM = rm(curDOM);\n                curDOM = curDOM.nextSibling;\n            }\n            else {\n                this.dom.insertBefore(panel.dom, curDOM);\n            }\n        }\n        while (curDOM)\n            curDOM = rm(curDOM);\n    }\n    scrollMargin() {\n        return !this.dom || this.container ? 0\n            : Math.max(0, this.top ?\n                this.dom.getBoundingClientRect().bottom - Math.max(0, this.view.scrollDOM.getBoundingClientRect().top) :\n                Math.min(innerHeight, this.view.scrollDOM.getBoundingClientRect().bottom) - this.dom.getBoundingClientRect().top);\n    }\n    syncClasses() {\n        if (!this.container || this.classes == this.view.themeClasses)\n            return;\n        for (let cls of this.classes.split(\" \"))\n            if (cls)\n                this.container.classList.remove(cls);\n        for (let cls of (this.classes = this.view.themeClasses).split(\" \"))\n            if (cls)\n                this.container.classList.add(cls);\n    }\n}\nfunction rm(node) {\n    let next = node.nextSibling;\n    node.remove();\n    return next;\n}\n/**\nOpening a panel is done by providing a constructor function for\nthe panel through this facet. (The panel is closed again when its\nconstructor is no longer provided.) Values of `null` are ignored.\n*/\nconst showPanel = /*@__PURE__*/Facet.define({\n    enables: panelPlugin\n});\n\n/**\nA gutter marker represents a bit of information attached to a line\nin a specific gutter. Your own custom markers have to extend this\nclass.\n*/\nclass GutterMarker extends RangeValue {\n    /**\n    @internal\n    */\n    compare(other) {\n        return this == other || this.constructor == other.constructor && this.eq(other);\n    }\n    /**\n    Compare this marker to another marker of the same type.\n    */\n    eq(other) { return false; }\n    /**\n    Called if the marker has a `toDOM` method and its representation\n    was removed from a gutter.\n    */\n    destroy(dom) { }\n}\nGutterMarker.prototype.elementClass = \"\";\nGutterMarker.prototype.toDOM = undefined;\nGutterMarker.prototype.mapMode = MapMode.TrackBefore;\nGutterMarker.prototype.startSide = GutterMarker.prototype.endSide = -1;\nGutterMarker.prototype.point = true;\n/**\nFacet used to add a class to all gutter elements for a given line.\nMarkers given to this facet should _only_ define an\n[`elementclass`](https://codemirror.net/6/docs/ref/#view.GutterMarker.elementClass), not a\n[`toDOM`](https://codemirror.net/6/docs/ref/#view.GutterMarker.toDOM) (or the marker will appear\nin all gutters for the line).\n*/\nconst gutterLineClass = /*@__PURE__*/Facet.define();\nconst defaults = {\n    class: \"\",\n    renderEmptyElements: false,\n    elementStyle: \"\",\n    markers: () => RangeSet.empty,\n    lineMarker: () => null,\n    widgetMarker: () => null,\n    lineMarkerChange: null,\n    initialSpacer: null,\n    updateSpacer: null,\n    domEventHandlers: {}\n};\nconst activeGutters = /*@__PURE__*/Facet.define();\n/**\nDefine an editor gutter. The order in which the gutters appear is\ndetermined by their extension priority.\n*/\nfunction gutter(config) {\n    return [gutters(), activeGutters.of(Object.assign(Object.assign({}, defaults), config))];\n}\nconst unfixGutters = /*@__PURE__*/Facet.define({\n    combine: values => values.some(x => x)\n});\n/**\nThe gutter-drawing plugin is automatically enabled when you add a\ngutter, but you can use this function to explicitly configure it.\n\nUnless `fixed` is explicitly set to `false`, the gutters are\nfixed, meaning they don't scroll along with the content\nhorizontally (except on Internet Explorer, which doesn't support\nCSS [`position:\nsticky`](https://developer.mozilla.org/en-US/docs/Web/CSS/position#sticky)).\n*/\nfunction gutters(config) {\n    let result = [\n        gutterView,\n    ];\n    if (config && config.fixed === false)\n        result.push(unfixGutters.of(true));\n    return result;\n}\nconst gutterView = /*@__PURE__*/ViewPlugin.fromClass(class {\n    constructor(view) {\n        this.view = view;\n        this.prevViewport = view.viewport;\n        this.dom = document.createElement(\"div\");\n        this.dom.className = \"cm-gutters\";\n        this.dom.setAttribute(\"aria-hidden\", \"true\");\n        this.dom.style.minHeight = this.view.contentHeight + \"px\";\n        this.gutters = view.state.facet(activeGutters).map(conf => new SingleGutterView(view, conf));\n        for (let gutter of this.gutters)\n            this.dom.appendChild(gutter.dom);\n        this.fixed = !view.state.facet(unfixGutters);\n        if (this.fixed) {\n            // FIXME IE11 fallback, which doesn't support position: sticky,\n            // by using position: relative + event handlers that realign the\n            // gutter (or just force fixed=false on IE11?)\n            this.dom.style.position = \"sticky\";\n        }\n        this.syncGutters(false);\n        view.scrollDOM.insertBefore(this.dom, view.contentDOM);\n    }\n    update(update) {\n        if (this.updateGutters(update)) {\n            // Detach during sync when the viewport changed significantly\n            // (such as during scrolling), since for large updates that is\n            // faster.\n            let vpA = this.prevViewport, vpB = update.view.viewport;\n            let vpOverlap = Math.min(vpA.to, vpB.to) - Math.max(vpA.from, vpB.from);\n            this.syncGutters(vpOverlap < (vpB.to - vpB.from) * 0.8);\n        }\n        if (update.geometryChanged)\n            this.dom.style.minHeight = this.view.contentHeight + \"px\";\n        if (this.view.state.facet(unfixGutters) != !this.fixed) {\n            this.fixed = !this.fixed;\n            this.dom.style.position = this.fixed ? \"sticky\" : \"\";\n        }\n        this.prevViewport = update.view.viewport;\n    }\n    syncGutters(detach) {\n        let after = this.dom.nextSibling;\n        if (detach)\n            this.dom.remove();\n        let lineClasses = RangeSet.iter(this.view.state.facet(gutterLineClass), this.view.viewport.from);\n        let classSet = [];\n        let contexts = this.gutters.map(gutter => new UpdateContext(gutter, this.view.viewport, -this.view.documentPadding.top));\n        for (let line of this.view.viewportLineBlocks) {\n            if (classSet.length)\n                classSet = [];\n            if (Array.isArray(line.type)) {\n                let first = true;\n                for (let b of line.type) {\n                    if (b.type == BlockType.Text && first) {\n                        advanceCursor(lineClasses, classSet, b.from);\n                        for (let cx of contexts)\n                            cx.line(this.view, b, classSet);\n                        first = false;\n                    }\n                    else if (b.widget) {\n                        for (let cx of contexts)\n                            cx.widget(this.view, b);\n                    }\n                }\n            }\n            else if (line.type == BlockType.Text) {\n                advanceCursor(lineClasses, classSet, line.from);\n                for (let cx of contexts)\n                    cx.line(this.view, line, classSet);\n            }\n        }\n        for (let cx of contexts)\n            cx.finish();\n        if (detach)\n            this.view.scrollDOM.insertBefore(this.dom, after);\n    }\n    updateGutters(update) {\n        let prev = update.startState.facet(activeGutters), cur = update.state.facet(activeGutters);\n        let change = update.docChanged || update.heightChanged || update.viewportChanged ||\n            !RangeSet.eq(update.startState.facet(gutterLineClass), update.state.facet(gutterLineClass), update.view.viewport.from, update.view.viewport.to);\n        if (prev == cur) {\n            for (let gutter of this.gutters)\n                if (gutter.update(update))\n                    change = true;\n        }\n        else {\n            change = true;\n            let gutters = [];\n            for (let conf of cur) {\n                let known = prev.indexOf(conf);\n                if (known < 0) {\n                    gutters.push(new SingleGutterView(this.view, conf));\n                }\n                else {\n                    this.gutters[known].update(update);\n                    gutters.push(this.gutters[known]);\n                }\n            }\n            for (let g of this.gutters) {\n                g.dom.remove();\n                if (gutters.indexOf(g) < 0)\n                    g.destroy();\n            }\n            for (let g of gutters)\n                this.dom.appendChild(g.dom);\n            this.gutters = gutters;\n        }\n        return change;\n    }\n    destroy() {\n        for (let view of this.gutters)\n            view.destroy();\n        this.dom.remove();\n    }\n}, {\n    provide: plugin => EditorView.scrollMargins.of(view => {\n        let value = view.plugin(plugin);\n        if (!value || value.gutters.length == 0 || !value.fixed)\n            return null;\n        return view.textDirection == Direction.LTR ? { left: value.dom.offsetWidth } : { right: value.dom.offsetWidth };\n    })\n});\nfunction asArray(val) { return (Array.isArray(val) ? val : [val]); }\nfunction advanceCursor(cursor, collect, pos) {\n    while (cursor.value && cursor.from <= pos) {\n        if (cursor.from == pos)\n            collect.push(cursor.value);\n        cursor.next();\n    }\n}\nclass UpdateContext {\n    constructor(gutter, viewport, height) {\n        this.gutter = gutter;\n        this.height = height;\n        this.i = 0;\n        this.cursor = RangeSet.iter(gutter.markers, viewport.from);\n    }\n    addElement(view, block, markers) {\n        let { gutter } = this, above = block.top - this.height;\n        if (this.i == gutter.elements.length) {\n            let newElt = new GutterElement(view, block.height, above, markers);\n            gutter.elements.push(newElt);\n            gutter.dom.appendChild(newElt.dom);\n        }\n        else {\n            gutter.elements[this.i].update(view, block.height, above, markers);\n        }\n        this.height = block.bottom;\n        this.i++;\n    }\n    line(view, line, extraMarkers) {\n        let localMarkers = [];\n        advanceCursor(this.cursor, localMarkers, line.from);\n        if (extraMarkers.length)\n            localMarkers = localMarkers.concat(extraMarkers);\n        let forLine = this.gutter.config.lineMarker(view, line, localMarkers);\n        if (forLine)\n            localMarkers.unshift(forLine);\n        let gutter = this.gutter;\n        if (localMarkers.length == 0 && !gutter.config.renderEmptyElements)\n            return;\n        this.addElement(view, line, localMarkers);\n    }\n    widget(view, block) {\n        let marker = this.gutter.config.widgetMarker(view, block.widget, block);\n        if (marker)\n            this.addElement(view, block, [marker]);\n    }\n    finish() {\n        let gutter = this.gutter;\n        while (gutter.elements.length > this.i) {\n            let last = gutter.elements.pop();\n            gutter.dom.removeChild(last.dom);\n            last.destroy();\n        }\n    }\n}\nclass SingleGutterView {\n    constructor(view, config) {\n        this.view = view;\n        this.config = config;\n        this.elements = [];\n        this.spacer = null;\n        this.dom = document.createElement(\"div\");\n        this.dom.className = \"cm-gutter\" + (this.config.class ? \" \" + this.config.class : \"\");\n        for (let prop in config.domEventHandlers) {\n            this.dom.addEventListener(prop, (event) => {\n                let target = event.target, y;\n                if (target != this.dom && this.dom.contains(target)) {\n                    while (target.parentNode != this.dom)\n                        target = target.parentNode;\n                    let rect = target.getBoundingClientRect();\n                    y = (rect.top + rect.bottom) / 2;\n                }\n                else {\n                    y = event.clientY;\n                }\n                let line = view.lineBlockAtHeight(y - view.documentTop);\n                if (config.domEventHandlers[prop](view, line, event))\n                    event.preventDefault();\n            });\n        }\n        this.markers = asArray(config.markers(view));\n        if (config.initialSpacer) {\n            this.spacer = new GutterElement(view, 0, 0, [config.initialSpacer(view)]);\n            this.dom.appendChild(this.spacer.dom);\n            this.spacer.dom.style.cssText += \"visibility: hidden; pointer-events: none\";\n        }\n    }\n    update(update) {\n        let prevMarkers = this.markers;\n        this.markers = asArray(this.config.markers(update.view));\n        if (this.spacer && this.config.updateSpacer) {\n            let updated = this.config.updateSpacer(this.spacer.markers[0], update);\n            if (updated != this.spacer.markers[0])\n                this.spacer.update(update.view, 0, 0, [updated]);\n        }\n        let vp = update.view.viewport;\n        return !RangeSet.eq(this.markers, prevMarkers, vp.from, vp.to) ||\n            (this.config.lineMarkerChange ? this.config.lineMarkerChange(update) : false);\n    }\n    destroy() {\n        for (let elt of this.elements)\n            elt.destroy();\n    }\n}\nclass GutterElement {\n    constructor(view, height, above, markers) {\n        this.height = -1;\n        this.above = 0;\n        this.markers = [];\n        this.dom = document.createElement(\"div\");\n        this.dom.className = \"cm-gutterElement\";\n        this.update(view, height, above, markers);\n    }\n    update(view, height, above, markers) {\n        if (this.height != height)\n            this.dom.style.height = (this.height = height) + \"px\";\n        if (this.above != above)\n            this.dom.style.marginTop = (this.above = above) ? above + \"px\" : \"\";\n        if (!sameMarkers(this.markers, markers))\n            this.setMarkers(view, markers);\n    }\n    setMarkers(view, markers) {\n        let cls = \"cm-gutterElement\", domPos = this.dom.firstChild;\n        for (let iNew = 0, iOld = 0;;) {\n            let skipTo = iOld, marker = iNew < markers.length ? markers[iNew++] : null, matched = false;\n            if (marker) {\n                let c = marker.elementClass;\n                if (c)\n                    cls += \" \" + c;\n                for (let i = iOld; i < this.markers.length; i++)\n                    if (this.markers[i].compare(marker)) {\n                        skipTo = i;\n                        matched = true;\n                        break;\n                    }\n            }\n            else {\n                skipTo = this.markers.length;\n            }\n            while (iOld < skipTo) {\n                let next = this.markers[iOld++];\n                if (next.toDOM) {\n                    next.destroy(domPos);\n                    let after = domPos.nextSibling;\n                    domPos.remove();\n                    domPos = after;\n                }\n            }\n            if (!marker)\n                break;\n            if (marker.toDOM) {\n                if (matched)\n                    domPos = domPos.nextSibling;\n                else\n                    this.dom.insertBefore(marker.toDOM(view), domPos);\n            }\n            if (matched)\n                iOld++;\n        }\n        this.dom.className = cls;\n        this.markers = markers;\n    }\n    destroy() {\n        this.setMarkers(null, []); // First argument not used unless creating markers\n    }\n}\nfunction sameMarkers(a, b) {\n    if (a.length != b.length)\n        return false;\n    for (let i = 0; i < a.length; i++)\n        if (!a[i].compare(b[i]))\n            return false;\n    return true;\n}\n/**\nFacet used to provide markers to the line number gutter.\n*/\nconst lineNumberMarkers = /*@__PURE__*/Facet.define();\nconst lineNumberConfig = /*@__PURE__*/Facet.define({\n    combine(values) {\n        return combineConfig(values, { formatNumber: String, domEventHandlers: {} }, {\n            domEventHandlers(a, b) {\n                let result = Object.assign({}, a);\n                for (let event in b) {\n                    let exists = result[event], add = b[event];\n                    result[event] = exists ? (view, line, event) => exists(view, line, event) || add(view, line, event) : add;\n                }\n                return result;\n            }\n        });\n    }\n});\nclass NumberMarker extends GutterMarker {\n    constructor(number) {\n        super();\n        this.number = number;\n    }\n    eq(other) { return this.number == other.number; }\n    toDOM() { return document.createTextNode(this.number); }\n}\nfunction formatNumber(view, number) {\n    return view.state.facet(lineNumberConfig).formatNumber(number, view.state);\n}\nconst lineNumberGutter = /*@__PURE__*/activeGutters.compute([lineNumberConfig], state => ({\n    class: \"cm-lineNumbers\",\n    renderEmptyElements: false,\n    markers(view) { return view.state.facet(lineNumberMarkers); },\n    lineMarker(view, line, others) {\n        if (others.some(m => m.toDOM))\n            return null;\n        return new NumberMarker(formatNumber(view, view.state.doc.lineAt(line.from).number));\n    },\n    widgetMarker: () => null,\n    lineMarkerChange: update => update.startState.facet(lineNumberConfig) != update.state.facet(lineNumberConfig),\n    initialSpacer(view) {\n        return new NumberMarker(formatNumber(view, maxLineNumber(view.state.doc.lines)));\n    },\n    updateSpacer(spacer, update) {\n        let max = formatNumber(update.view, maxLineNumber(update.view.state.doc.lines));\n        return max == spacer.number ? spacer : new NumberMarker(max);\n    },\n    domEventHandlers: state.facet(lineNumberConfig).domEventHandlers\n}));\n/**\nCreate a line number gutter extension.\n*/\nfunction lineNumbers(config = {}) {\n    return [\n        lineNumberConfig.of(config),\n        gutters(),\n        lineNumberGutter\n    ];\n}\nfunction maxLineNumber(lines) {\n    let last = 9;\n    while (last < lines)\n        last = last * 10 + 9;\n    return last;\n}\nconst activeLineGutterMarker = /*@__PURE__*/new class extends GutterMarker {\n    constructor() {\n        super(...arguments);\n        this.elementClass = \"cm-activeLineGutter\";\n    }\n};\nconst activeLineGutterHighlighter = /*@__PURE__*/gutterLineClass.compute([\"selection\"], state => {\n    let marks = [], last = -1;\n    for (let range of state.selection.ranges) {\n        let linePos = state.doc.lineAt(range.head).from;\n        if (linePos > last) {\n            last = linePos;\n            marks.push(activeLineGutterMarker.range(linePos));\n        }\n    }\n    return RangeSet.of(marks);\n});\n/**\nReturns an extension that adds a `cm-activeLineGutter` class to\nall gutter elements on the [active\nline](https://codemirror.net/6/docs/ref/#view.highlightActiveLine).\n*/\nfunction highlightActiveLineGutter() {\n    return activeLineGutterHighlighter;\n}\n\nconst WhitespaceDeco = /*@__PURE__*/new Map();\nfunction getWhitespaceDeco(space) {\n    let deco = WhitespaceDeco.get(space);\n    if (!deco)\n        WhitespaceDeco.set(space, deco = Decoration.mark({\n            attributes: space === \"\\t\" ? {\n                class: \"cm-highlightTab\",\n            } : {\n                class: \"cm-highlightSpace\",\n                \"data-display\": space.replace(/ /g, \"·\")\n            }\n        }));\n    return deco;\n}\nfunction matcher(decorator) {\n    return ViewPlugin.define(view => ({\n        decorations: decorator.createDeco(view),\n        update(u) {\n            this.decorations = decorator.updateDeco(u, this.decorations);\n        },\n    }), {\n        decorations: v => v.decorations\n    });\n}\nconst whitespaceHighlighter = /*@__PURE__*/matcher(/*@__PURE__*/new MatchDecorator({\n    regexp: /\\t| +/g,\n    decoration: match => getWhitespaceDeco(match[0]),\n    boundary: /\\S/,\n}));\n/**\nReturns an extension that highlights whitespace, adding a\n`cm-highlightSpace` class to stretches of spaces, and a\n`cm-highlightTab` class to individual tab characters. By default,\nthe former are shown as faint dots, and the latter as arrows.\n*/\nfunction highlightWhitespace() {\n    return whitespaceHighlighter;\n}\nconst trailingHighlighter = /*@__PURE__*/matcher(/*@__PURE__*/new MatchDecorator({\n    regexp: /\\s+$/g,\n    decoration: /*@__PURE__*/Decoration.mark({ class: \"cm-trailingSpace\" }),\n    boundary: /\\S/,\n}));\n/**\nReturns an extension that adds a `cm-trailingSpace` class to all\ntrailing whitespace.\n*/\nfunction highlightTrailingWhitespace() {\n    return trailingHighlighter;\n}\n\n/**\n@internal\n*/\nconst __test = { HeightMap, HeightOracle, MeasuredHeights, QueryType, ChangedRange, computeOrder, moveVisually };\n\nexport { BidiSpan, BlockInfo, BlockType, Decoration, Direction, EditorView, GutterMarker, MatchDecorator, RectangleMarker, ViewPlugin, ViewUpdate, WidgetType, __test, closeHoverTooltips, crosshairCursor, drawSelection, dropCursor, getPanel, getTooltip, gutter, gutterLineClass, gutters, hasHoverTooltips, highlightActiveLine, highlightActiveLineGutter, highlightSpecialChars, highlightTrailingWhitespace, highlightWhitespace, hoverTooltip, keymap, layer, lineNumberMarkers, lineNumbers, logException, panels, placeholder, rectangularSelection, repositionTooltips, runScopeHandlers, scrollPastEnd, showPanel, showTooltip, tooltips };\n","import { NodeProp, Tree, IterMode, TreeFragment, Parser, NodeType, NodeSet } from '@lezer/common';\nimport { StateEffect, StateField, Facet, EditorState, countColumn, combineConfig, RangeSet, RangeSetBuilder, Prec } from '@codemirror/state';\nimport { ViewPlugin, logException, EditorView, Decoration, WidgetType, gutter, GutterMarker } from '@codemirror/view';\nimport { tags, tagHighlighter, highlightTree, styleTags } from '@lezer/highlight';\nimport { StyleModule } from 'style-mod';\n\nvar _a;\n/**\nNode prop stored in a parser's top syntax node to provide the\nfacet that stores language-specific data for that language.\n*/\nconst languageDataProp = /*@__PURE__*/new NodeProp();\n/**\nHelper function to define a facet (to be added to the top syntax\nnode(s) for a language via\n[`languageDataProp`](https://codemirror.net/6/docs/ref/#language.languageDataProp)), that will be\nused to associate language data with the language. You\nprobably only need this when subclassing\n[`Language`](https://codemirror.net/6/docs/ref/#language.Language).\n*/\nfunction defineLanguageFacet(baseData) {\n    return Facet.define({\n        combine: baseData ? values => values.concat(baseData) : undefined\n    });\n}\n/**\nSyntax node prop used to register sublanguages. Should be added to\nthe top level node type for the language.\n*/\nconst sublanguageProp = /*@__PURE__*/new NodeProp();\n/**\nA language object manages parsing and per-language\n[metadata](https://codemirror.net/6/docs/ref/#state.EditorState.languageDataAt). Parse data is\nmanaged as a [Lezer](https://lezer.codemirror.net) tree. The class\ncan be used directly, via the [`LRLanguage`](https://codemirror.net/6/docs/ref/#language.LRLanguage)\nsubclass for [Lezer](https://lezer.codemirror.net/) LR parsers, or\nvia the [`StreamLanguage`](https://codemirror.net/6/docs/ref/#language.StreamLanguage) subclass\nfor stream parsers.\n*/\nclass Language {\n    /**\n    Construct a language object. If you need to invoke this\n    directly, first define a data facet with\n    [`defineLanguageFacet`](https://codemirror.net/6/docs/ref/#language.defineLanguageFacet), and then\n    configure your parser to [attach](https://codemirror.net/6/docs/ref/#language.languageDataProp) it\n    to the language's outer syntax node.\n    */\n    constructor(\n    /**\n    The [language data](https://codemirror.net/6/docs/ref/#state.EditorState.languageDataAt) facet\n    used for this language.\n    */\n    data, parser, extraExtensions = [], \n    /**\n    A language name.\n    */\n    name = \"\") {\n        this.data = data;\n        this.name = name;\n        // Kludge to define EditorState.tree as a debugging helper,\n        // without the EditorState package actually knowing about\n        // languages and lezer trees.\n        if (!EditorState.prototype.hasOwnProperty(\"tree\"))\n            Object.defineProperty(EditorState.prototype, \"tree\", { get() { return syntaxTree(this); } });\n        this.parser = parser;\n        this.extension = [\n            language.of(this),\n            EditorState.languageData.of((state, pos, side) => {\n                let top = topNodeAt(state, pos, side), data = top.type.prop(languageDataProp);\n                if (!data)\n                    return [];\n                let base = state.facet(data), sub = top.type.prop(sublanguageProp);\n                if (sub) {\n                    let innerNode = top.resolve(pos - top.from, side);\n                    for (let sublang of sub)\n                        if (sublang.test(innerNode, state)) {\n                            let data = state.facet(sublang.facet);\n                            return sublang.type == \"replace\" ? data : data.concat(base);\n                        }\n                }\n                return base;\n            })\n        ].concat(extraExtensions);\n    }\n    /**\n    Query whether this language is active at the given position.\n    */\n    isActiveAt(state, pos, side = -1) {\n        return topNodeAt(state, pos, side).type.prop(languageDataProp) == this.data;\n    }\n    /**\n    Find the document regions that were parsed using this language.\n    The returned regions will _include_ any nested languages rooted\n    in this language, when those exist.\n    */\n    findRegions(state) {\n        let lang = state.facet(language);\n        if ((lang === null || lang === void 0 ? void 0 : lang.data) == this.data)\n            return [{ from: 0, to: state.doc.length }];\n        if (!lang || !lang.allowsNesting)\n            return [];\n        let result = [];\n        let explore = (tree, from) => {\n            if (tree.prop(languageDataProp) == this.data) {\n                result.push({ from, to: from + tree.length });\n                return;\n            }\n            let mount = tree.prop(NodeProp.mounted);\n            if (mount) {\n                if (mount.tree.prop(languageDataProp) == this.data) {\n                    if (mount.overlay)\n                        for (let r of mount.overlay)\n                            result.push({ from: r.from + from, to: r.to + from });\n                    else\n                        result.push({ from: from, to: from + tree.length });\n                    return;\n                }\n                else if (mount.overlay) {\n                    let size = result.length;\n                    explore(mount.tree, mount.overlay[0].from + from);\n                    if (result.length > size)\n                        return;\n                }\n            }\n            for (let i = 0; i < tree.children.length; i++) {\n                let ch = tree.children[i];\n                if (ch instanceof Tree)\n                    explore(ch, tree.positions[i] + from);\n            }\n        };\n        explore(syntaxTree(state), 0);\n        return result;\n    }\n    /**\n    Indicates whether this language allows nested languages. The\n    default implementation returns true.\n    */\n    get allowsNesting() { return true; }\n}\n/**\n@internal\n*/\nLanguage.setState = /*@__PURE__*/StateEffect.define();\nfunction topNodeAt(state, pos, side) {\n    let topLang = state.facet(language), tree = syntaxTree(state).topNode;\n    if (!topLang || topLang.allowsNesting) {\n        for (let node = tree; node; node = node.enter(pos, side, IterMode.ExcludeBuffers))\n            if (node.type.isTop)\n                tree = node;\n    }\n    return tree;\n}\n/**\nA subclass of [`Language`](https://codemirror.net/6/docs/ref/#language.Language) for use with Lezer\n[LR parsers](https://lezer.codemirror.net/docs/ref#lr.LRParser)\nparsers.\n*/\nclass LRLanguage extends Language {\n    constructor(data, parser, name) {\n        super(data, parser, [], name);\n        this.parser = parser;\n    }\n    /**\n    Define a language from a parser.\n    */\n    static define(spec) {\n        let data = defineLanguageFacet(spec.languageData);\n        return new LRLanguage(data, spec.parser.configure({\n            props: [languageDataProp.add(type => type.isTop ? data : undefined)]\n        }), spec.name);\n    }\n    /**\n    Create a new instance of this language with a reconfigured\n    version of its parser and optionally a new name.\n    */\n    configure(options, name) {\n        return new LRLanguage(this.data, this.parser.configure(options), name || this.name);\n    }\n    get allowsNesting() { return this.parser.hasWrappers(); }\n}\n/**\nGet the syntax tree for a state, which is the current (possibly\nincomplete) parse tree of the active\n[language](https://codemirror.net/6/docs/ref/#language.Language), or the empty tree if there is no\nlanguage available.\n*/\nfunction syntaxTree(state) {\n    let field = state.field(Language.state, false);\n    return field ? field.tree : Tree.empty;\n}\n/**\nTry to get a parse tree that spans at least up to `upto`. The\nmethod will do at most `timeout` milliseconds of work to parse\nup to that point if the tree isn't already available.\n*/\nfunction ensureSyntaxTree(state, upto, timeout = 50) {\n    var _a;\n    let parse = (_a = state.field(Language.state, false)) === null || _a === void 0 ? void 0 : _a.context;\n    if (!parse)\n        return null;\n    let oldVieport = parse.viewport;\n    parse.updateViewport({ from: 0, to: upto });\n    let result = parse.isDone(upto) || parse.work(timeout, upto) ? parse.tree : null;\n    parse.updateViewport(oldVieport);\n    return result;\n}\n/**\nQueries whether there is a full syntax tree available up to the\ngiven document position. If there isn't, the background parse\nprocess _might_ still be working and update the tree further, but\nthere is no guarantee of that—the parser will [stop\nworking](https://codemirror.net/6/docs/ref/#language.syntaxParserRunning) when it has spent a\ncertain amount of time or has moved beyond the visible viewport.\nAlways returns false if no language has been enabled.\n*/\nfunction syntaxTreeAvailable(state, upto = state.doc.length) {\n    var _a;\n    return ((_a = state.field(Language.state, false)) === null || _a === void 0 ? void 0 : _a.context.isDone(upto)) || false;\n}\n/**\nMove parsing forward, and update the editor state afterwards to\nreflect the new tree. Will work for at most `timeout`\nmilliseconds. Returns true if the parser managed get to the given\nposition in that time.\n*/\nfunction forceParsing(view, upto = view.viewport.to, timeout = 100) {\n    let success = ensureSyntaxTree(view.state, upto, timeout);\n    if (success != syntaxTree(view.state))\n        view.dispatch({});\n    return !!success;\n}\n/**\nTells you whether the language parser is planning to do more\nparsing work (in a `requestIdleCallback` pseudo-thread) or has\nstopped running, either because it parsed the entire document,\nbecause it spent too much time and was cut off, or because there\nis no language parser enabled.\n*/\nfunction syntaxParserRunning(view) {\n    var _a;\n    return ((_a = view.plugin(parseWorker)) === null || _a === void 0 ? void 0 : _a.isWorking()) || false;\n}\n/**\nLezer-style\n[`Input`](https://lezer.codemirror.net/docs/ref#common.Input)\nobject for a [`Text`](https://codemirror.net/6/docs/ref/#state.Text) object.\n*/\nclass DocInput {\n    /**\n    Create an input object for the given document.\n    */\n    constructor(doc) {\n        this.doc = doc;\n        this.cursorPos = 0;\n        this.string = \"\";\n        this.cursor = doc.iter();\n    }\n    get length() { return this.doc.length; }\n    syncTo(pos) {\n        this.string = this.cursor.next(pos - this.cursorPos).value;\n        this.cursorPos = pos + this.string.length;\n        return this.cursorPos - this.string.length;\n    }\n    chunk(pos) {\n        this.syncTo(pos);\n        return this.string;\n    }\n    get lineChunks() { return true; }\n    read(from, to) {\n        let stringStart = this.cursorPos - this.string.length;\n        if (from < stringStart || to >= this.cursorPos)\n            return this.doc.sliceString(from, to);\n        else\n            return this.string.slice(from - stringStart, to - stringStart);\n    }\n}\nlet currentContext = null;\n/**\nA parse context provided to parsers working on the editor content.\n*/\nclass ParseContext {\n    constructor(parser, \n    /**\n    The current editor state.\n    */\n    state, \n    /**\n    Tree fragments that can be reused by incremental re-parses.\n    */\n    fragments = [], \n    /**\n    @internal\n    */\n    tree, \n    /**\n    @internal\n    */\n    treeLen, \n    /**\n    The current editor viewport (or some overapproximation\n    thereof). Intended to be used for opportunistically avoiding\n    work (in which case\n    [`skipUntilInView`](https://codemirror.net/6/docs/ref/#language.ParseContext.skipUntilInView)\n    should be called to make sure the parser is restarted when the\n    skipped region becomes visible).\n    */\n    viewport, \n    /**\n    @internal\n    */\n    skipped, \n    /**\n    This is where skipping parsers can register a promise that,\n    when resolved, will schedule a new parse. It is cleared when\n    the parse worker picks up the promise. @internal\n    */\n    scheduleOn) {\n        this.parser = parser;\n        this.state = state;\n        this.fragments = fragments;\n        this.tree = tree;\n        this.treeLen = treeLen;\n        this.viewport = viewport;\n        this.skipped = skipped;\n        this.scheduleOn = scheduleOn;\n        this.parse = null;\n        /**\n        @internal\n        */\n        this.tempSkipped = [];\n    }\n    /**\n    @internal\n    */\n    static create(parser, state, viewport) {\n        return new ParseContext(parser, state, [], Tree.empty, 0, viewport, [], null);\n    }\n    startParse() {\n        return this.parser.startParse(new DocInput(this.state.doc), this.fragments);\n    }\n    /**\n    @internal\n    */\n    work(until, upto) {\n        if (upto != null && upto >= this.state.doc.length)\n            upto = undefined;\n        if (this.tree != Tree.empty && this.isDone(upto !== null && upto !== void 0 ? upto : this.state.doc.length)) {\n            this.takeTree();\n            return true;\n        }\n        return this.withContext(() => {\n            var _a;\n            if (typeof until == \"number\") {\n                let endTime = Date.now() + until;\n                until = () => Date.now() > endTime;\n            }\n            if (!this.parse)\n                this.parse = this.startParse();\n            if (upto != null && (this.parse.stoppedAt == null || this.parse.stoppedAt > upto) &&\n                upto < this.state.doc.length)\n                this.parse.stopAt(upto);\n            for (;;) {\n                let done = this.parse.advance();\n                if (done) {\n                    this.fragments = this.withoutTempSkipped(TreeFragment.addTree(done, this.fragments, this.parse.stoppedAt != null));\n                    this.treeLen = (_a = this.parse.stoppedAt) !== null && _a !== void 0 ? _a : this.state.doc.length;\n                    this.tree = done;\n                    this.parse = null;\n                    if (this.treeLen < (upto !== null && upto !== void 0 ? upto : this.state.doc.length))\n                        this.parse = this.startParse();\n                    else\n                        return true;\n                }\n                if (until())\n                    return false;\n            }\n        });\n    }\n    /**\n    @internal\n    */\n    takeTree() {\n        let pos, tree;\n        if (this.parse && (pos = this.parse.parsedPos) >= this.treeLen) {\n            if (this.parse.stoppedAt == null || this.parse.stoppedAt > pos)\n                this.parse.stopAt(pos);\n            this.withContext(() => { while (!(tree = this.parse.advance())) { } });\n            this.treeLen = pos;\n            this.tree = tree;\n            this.fragments = this.withoutTempSkipped(TreeFragment.addTree(this.tree, this.fragments, true));\n            this.parse = null;\n        }\n    }\n    withContext(f) {\n        let prev = currentContext;\n        currentContext = this;\n        try {\n            return f();\n        }\n        finally {\n            currentContext = prev;\n        }\n    }\n    withoutTempSkipped(fragments) {\n        for (let r; r = this.tempSkipped.pop();)\n            fragments = cutFragments(fragments, r.from, r.to);\n        return fragments;\n    }\n    /**\n    @internal\n    */\n    changes(changes, newState) {\n        let { fragments, tree, treeLen, viewport, skipped } = this;\n        this.takeTree();\n        if (!changes.empty) {\n            let ranges = [];\n            changes.iterChangedRanges((fromA, toA, fromB, toB) => ranges.push({ fromA, toA, fromB, toB }));\n            fragments = TreeFragment.applyChanges(fragments, ranges);\n            tree = Tree.empty;\n            treeLen = 0;\n            viewport = { from: changes.mapPos(viewport.from, -1), to: changes.mapPos(viewport.to, 1) };\n            if (this.skipped.length) {\n                skipped = [];\n                for (let r of this.skipped) {\n                    let from = changes.mapPos(r.from, 1), to = changes.mapPos(r.to, -1);\n                    if (from < to)\n                        skipped.push({ from, to });\n                }\n            }\n        }\n        return new ParseContext(this.parser, newState, fragments, tree, treeLen, viewport, skipped, this.scheduleOn);\n    }\n    /**\n    @internal\n    */\n    updateViewport(viewport) {\n        if (this.viewport.from == viewport.from && this.viewport.to == viewport.to)\n            return false;\n        this.viewport = viewport;\n        let startLen = this.skipped.length;\n        for (let i = 0; i < this.skipped.length; i++) {\n            let { from, to } = this.skipped[i];\n            if (from < viewport.to && to > viewport.from) {\n                this.fragments = cutFragments(this.fragments, from, to);\n                this.skipped.splice(i--, 1);\n            }\n        }\n        if (this.skipped.length >= startLen)\n            return false;\n        this.reset();\n        return true;\n    }\n    /**\n    @internal\n    */\n    reset() {\n        if (this.parse) {\n            this.takeTree();\n            this.parse = null;\n        }\n    }\n    /**\n    Notify the parse scheduler that the given region was skipped\n    because it wasn't in view, and the parse should be restarted\n    when it comes into view.\n    */\n    skipUntilInView(from, to) {\n        this.skipped.push({ from, to });\n    }\n    /**\n    Returns a parser intended to be used as placeholder when\n    asynchronously loading a nested parser. It'll skip its input and\n    mark it as not-really-parsed, so that the next update will parse\n    it again.\n    \n    When `until` is given, a reparse will be scheduled when that\n    promise resolves.\n    */\n    static getSkippingParser(until) {\n        return new class extends Parser {\n            createParse(input, fragments, ranges) {\n                let from = ranges[0].from, to = ranges[ranges.length - 1].to;\n                let parser = {\n                    parsedPos: from,\n                    advance() {\n                        let cx = currentContext;\n                        if (cx) {\n                            for (let r of ranges)\n                                cx.tempSkipped.push(r);\n                            if (until)\n                                cx.scheduleOn = cx.scheduleOn ? Promise.all([cx.scheduleOn, until]) : until;\n                        }\n                        this.parsedPos = to;\n                        return new Tree(NodeType.none, [], [], to - from);\n                    },\n                    stoppedAt: null,\n                    stopAt() { }\n                };\n                return parser;\n            }\n        };\n    }\n    /**\n    @internal\n    */\n    isDone(upto) {\n        upto = Math.min(upto, this.state.doc.length);\n        let frags = this.fragments;\n        return this.treeLen >= upto && frags.length && frags[0].from == 0 && frags[0].to >= upto;\n    }\n    /**\n    Get the context for the current parse, or `null` if no editor\n    parse is in progress.\n    */\n    static get() { return currentContext; }\n}\nfunction cutFragments(fragments, from, to) {\n    return TreeFragment.applyChanges(fragments, [{ fromA: from, toA: to, fromB: from, toB: to }]);\n}\nclass LanguageState {\n    constructor(\n    // A mutable parse state that is used to preserve work done during\n    // the lifetime of a state when moving to the next state.\n    context) {\n        this.context = context;\n        this.tree = context.tree;\n    }\n    apply(tr) {\n        if (!tr.docChanged && this.tree == this.context.tree)\n            return this;\n        let newCx = this.context.changes(tr.changes, tr.state);\n        // If the previous parse wasn't done, go forward only up to its\n        // end position or the end of the viewport, to avoid slowing down\n        // state updates with parse work beyond the viewport.\n        let upto = this.context.treeLen == tr.startState.doc.length ? undefined\n            : Math.max(tr.changes.mapPos(this.context.treeLen), newCx.viewport.to);\n        if (!newCx.work(20 /* Apply */, upto))\n            newCx.takeTree();\n        return new LanguageState(newCx);\n    }\n    static init(state) {\n        let vpTo = Math.min(3000 /* InitViewport */, state.doc.length);\n        let parseState = ParseContext.create(state.facet(language).parser, state, { from: 0, to: vpTo });\n        if (!parseState.work(20 /* Apply */, vpTo))\n            parseState.takeTree();\n        return new LanguageState(parseState);\n    }\n}\nLanguage.state = /*@__PURE__*/StateField.define({\n    create: LanguageState.init,\n    update(value, tr) {\n        for (let e of tr.effects)\n            if (e.is(Language.setState))\n                return e.value;\n        if (tr.startState.facet(language) != tr.state.facet(language))\n            return LanguageState.init(tr.state);\n        return value.apply(tr);\n    }\n});\nlet requestIdle = (callback) => {\n    let timeout = setTimeout(() => callback(), 500 /* MaxPause */);\n    return () => clearTimeout(timeout);\n};\nif (typeof requestIdleCallback != \"undefined\")\n    requestIdle = (callback) => {\n        let idle = -1, timeout = setTimeout(() => {\n            idle = requestIdleCallback(callback, { timeout: 500 /* MaxPause */ - 100 /* MinPause */ });\n        }, 100 /* MinPause */);\n        return () => idle < 0 ? clearTimeout(timeout) : cancelIdleCallback(idle);\n    };\nconst isInputPending = typeof navigator != \"undefined\" && ((_a = navigator.scheduling) === null || _a === void 0 ? void 0 : _a.isInputPending)\n    ? () => navigator.scheduling.isInputPending() : null;\nconst parseWorker = /*@__PURE__*/ViewPlugin.fromClass(class ParseWorker {\n    constructor(view) {\n        this.view = view;\n        this.working = null;\n        this.workScheduled = 0;\n        // End of the current time chunk\n        this.chunkEnd = -1;\n        // Milliseconds of budget left for this chunk\n        this.chunkBudget = -1;\n        this.work = this.work.bind(this);\n        this.scheduleWork();\n    }\n    update(update) {\n        let cx = this.view.state.field(Language.state).context;\n        if (cx.updateViewport(update.view.viewport) || this.view.viewport.to > cx.treeLen)\n            this.scheduleWork();\n        if (update.docChanged) {\n            if (this.view.hasFocus)\n                this.chunkBudget += 50 /* ChangeBonus */;\n            this.scheduleWork();\n        }\n        this.checkAsyncSchedule(cx);\n    }\n    scheduleWork() {\n        if (this.working)\n            return;\n        let { state } = this.view, field = state.field(Language.state);\n        if (field.tree != field.context.tree || !field.context.isDone(state.doc.length))\n            this.working = requestIdle(this.work);\n    }\n    work(deadline) {\n        this.working = null;\n        let now = Date.now();\n        if (this.chunkEnd < now && (this.chunkEnd < 0 || this.view.hasFocus)) { // Start a new chunk\n            this.chunkEnd = now + 30000 /* ChunkTime */;\n            this.chunkBudget = 3000 /* ChunkBudget */;\n        }\n        if (this.chunkBudget <= 0)\n            return; // No more budget\n        let { state, viewport: { to: vpTo } } = this.view, field = state.field(Language.state);\n        if (field.tree == field.context.tree && field.context.isDone(vpTo + 100000 /* MaxParseAhead */))\n            return;\n        let endTime = Date.now() + Math.min(this.chunkBudget, 100 /* Slice */, deadline && !isInputPending ? Math.max(25 /* MinSlice */, deadline.timeRemaining() - 5) : 1e9);\n        let viewportFirst = field.context.treeLen < vpTo && state.doc.length > vpTo + 1000;\n        let done = field.context.work(() => {\n            return isInputPending && isInputPending() || Date.now() > endTime;\n        }, vpTo + (viewportFirst ? 0 : 100000 /* MaxParseAhead */));\n        this.chunkBudget -= Date.now() - now;\n        if (done || this.chunkBudget <= 0) {\n            field.context.takeTree();\n            this.view.dispatch({ effects: Language.setState.of(new LanguageState(field.context)) });\n        }\n        if (this.chunkBudget > 0 && !(done && !viewportFirst))\n            this.scheduleWork();\n        this.checkAsyncSchedule(field.context);\n    }\n    checkAsyncSchedule(cx) {\n        if (cx.scheduleOn) {\n            this.workScheduled++;\n            cx.scheduleOn\n                .then(() => this.scheduleWork())\n                .catch(err => logException(this.view.state, err))\n                .then(() => this.workScheduled--);\n            cx.scheduleOn = null;\n        }\n    }\n    destroy() {\n        if (this.working)\n            this.working();\n    }\n    isWorking() {\n        return !!(this.working || this.workScheduled > 0);\n    }\n}, {\n    eventHandlers: { focus() { this.scheduleWork(); } }\n});\n/**\nThe facet used to associate a language with an editor state. Used\nby `Language` object's `extension` property (so you don't need to\nmanually wrap your languages in this). Can be used to access the\ncurrent language on a state.\n*/\nconst language = /*@__PURE__*/Facet.define({\n    combine(languages) { return languages.length ? languages[0] : null; },\n    enables: language => [\n        Language.state,\n        parseWorker,\n        EditorView.contentAttributes.compute([language], state => {\n            let lang = state.facet(language);\n            return lang && lang.name ? { \"data-language\": lang.name } : {};\n        })\n    ]\n});\n/**\nThis class bundles a [language](https://codemirror.net/6/docs/ref/#language.Language) with an\noptional set of supporting extensions. Language packages are\nencouraged to export a function that optionally takes a\nconfiguration object and returns a `LanguageSupport` instance, as\nthe main way for client code to use the package.\n*/\nclass LanguageSupport {\n    /**\n    Create a language support object.\n    */\n    constructor(\n    /**\n    The language object.\n    */\n    language, \n    /**\n    An optional set of supporting extensions. When nesting a\n    language in another language, the outer language is encouraged\n    to include the supporting extensions for its inner languages\n    in its own set of support extensions.\n    */\n    support = []) {\n        this.language = language;\n        this.support = support;\n        this.extension = [language, support];\n    }\n}\n/**\nLanguage descriptions are used to store metadata about languages\nand to dynamically load them. Their main role is finding the\nappropriate language for a filename or dynamically loading nested\nparsers.\n*/\nclass LanguageDescription {\n    constructor(\n    /**\n    The name of this language.\n    */\n    name, \n    /**\n    Alternative names for the mode (lowercased, includes `this.name`).\n    */\n    alias, \n    /**\n    File extensions associated with this language.\n    */\n    extensions, \n    /**\n    Optional filename pattern that should be associated with this\n    language.\n    */\n    filename, loadFunc, \n    /**\n    If the language has been loaded, this will hold its value.\n    */\n    support = undefined) {\n        this.name = name;\n        this.alias = alias;\n        this.extensions = extensions;\n        this.filename = filename;\n        this.loadFunc = loadFunc;\n        this.support = support;\n        this.loading = null;\n    }\n    /**\n    Start loading the the language. Will return a promise that\n    resolves to a [`LanguageSupport`](https://codemirror.net/6/docs/ref/#language.LanguageSupport)\n    object when the language successfully loads.\n    */\n    load() {\n        return this.loading || (this.loading = this.loadFunc().then(support => this.support = support, err => { this.loading = null; throw err; }));\n    }\n    /**\n    Create a language description.\n    */\n    static of(spec) {\n        let { load, support } = spec;\n        if (!load) {\n            if (!support)\n                throw new RangeError(\"Must pass either 'load' or 'support' to LanguageDescription.of\");\n            load = () => Promise.resolve(support);\n        }\n        return new LanguageDescription(spec.name, (spec.alias || []).concat(spec.name).map(s => s.toLowerCase()), spec.extensions || [], spec.filename, load, support);\n    }\n    /**\n    Look for a language in the given array of descriptions that\n    matches the filename. Will first match\n    [`filename`](https://codemirror.net/6/docs/ref/#language.LanguageDescription.filename) patterns,\n    and then [extensions](https://codemirror.net/6/docs/ref/#language.LanguageDescription.extensions),\n    and return the first language that matches.\n    */\n    static matchFilename(descs, filename) {\n        for (let d of descs)\n            if (d.filename && d.filename.test(filename))\n                return d;\n        let ext = /\\.([^.]+)$/.exec(filename);\n        if (ext)\n            for (let d of descs)\n                if (d.extensions.indexOf(ext[1]) > -1)\n                    return d;\n        return null;\n    }\n    /**\n    Look for a language whose name or alias matches the the given\n    name (case-insensitively). If `fuzzy` is true, and no direct\n    matchs is found, this'll also search for a language whose name\n    or alias occurs in the string (for names shorter than three\n    characters, only when surrounded by non-word characters).\n    */\n    static matchLanguageName(descs, name, fuzzy = true) {\n        name = name.toLowerCase();\n        for (let d of descs)\n            if (d.alias.some(a => a == name))\n                return d;\n        if (fuzzy)\n            for (let d of descs)\n                for (let a of d.alias) {\n                    let found = name.indexOf(a);\n                    if (found > -1 && (a.length > 2 || !/\\w/.test(name[found - 1]) && !/\\w/.test(name[found + a.length])))\n                        return d;\n                }\n        return null;\n    }\n}\n\n/**\nFacet that defines a way to provide a function that computes the\nappropriate indentation depth, as a column number (see\n[`indentString`](https://codemirror.net/6/docs/ref/#language.indentString)), at the start of a given\nline. A return value of `null` indicates no indentation can be\ndetermined, and the line should inherit the indentation of the one\nabove it. A return value of `undefined` defers to the next indent\nservice.\n*/\nconst indentService = /*@__PURE__*/Facet.define();\n/**\nFacet for overriding the unit by which indentation happens. Should\nbe a string consisting either entirely of the same whitespace\ncharacter. When not set, this defaults to 2 spaces.\n*/\nconst indentUnit = /*@__PURE__*/Facet.define({\n    combine: values => {\n        if (!values.length)\n            return \"  \";\n        let unit = values[0];\n        if (!unit || /\\S/.test(unit) || Array.from(unit).some(e => e != unit[0]))\n            throw new Error(\"Invalid indent unit: \" + JSON.stringify(values[0]));\n        return unit;\n    }\n});\n/**\nReturn the _column width_ of an indent unit in the state.\nDetermined by the [`indentUnit`](https://codemirror.net/6/docs/ref/#language.indentUnit)\nfacet, and [`tabSize`](https://codemirror.net/6/docs/ref/#state.EditorState^tabSize) when that\ncontains tabs.\n*/\nfunction getIndentUnit(state) {\n    let unit = state.facet(indentUnit);\n    return unit.charCodeAt(0) == 9 ? state.tabSize * unit.length : unit.length;\n}\n/**\nCreate an indentation string that covers columns 0 to `cols`.\nWill use tabs for as much of the columns as possible when the\n[`indentUnit`](https://codemirror.net/6/docs/ref/#language.indentUnit) facet contains\ntabs.\n*/\nfunction indentString(state, cols) {\n    let result = \"\", ts = state.tabSize, ch = state.facet(indentUnit)[0];\n    if (ch == \"\\t\") {\n        while (cols >= ts) {\n            result += \"\\t\";\n            cols -= ts;\n        }\n        ch = \" \";\n    }\n    for (let i = 0; i < cols; i++)\n        result += ch;\n    return result;\n}\n/**\nGet the indentation, as a column number, at the given position.\nWill first consult any [indent services](https://codemirror.net/6/docs/ref/#language.indentService)\nthat are registered, and if none of those return an indentation,\nthis will check the syntax tree for the [indent node\nprop](https://codemirror.net/6/docs/ref/#language.indentNodeProp) and use that if found. Returns a\nnumber when an indentation could be determined, and null\notherwise.\n*/\nfunction getIndentation(context, pos) {\n    if (context instanceof EditorState)\n        context = new IndentContext(context);\n    for (let service of context.state.facet(indentService)) {\n        let result = service(context, pos);\n        if (result !== undefined)\n            return result;\n    }\n    let tree = syntaxTree(context.state);\n    return tree ? syntaxIndentation(context, tree, pos) : null;\n}\n/**\nCreate a change set that auto-indents all lines touched by the\ngiven document range.\n*/\nfunction indentRange(state, from, to) {\n    let updated = Object.create(null);\n    let context = new IndentContext(state, { overrideIndentation: start => { var _a; return (_a = updated[start]) !== null && _a !== void 0 ? _a : -1; } });\n    let changes = [];\n    for (let pos = from; pos <= to;) {\n        let line = state.doc.lineAt(pos);\n        pos = line.to + 1;\n        let indent = getIndentation(context, line.from);\n        if (indent == null)\n            continue;\n        if (!/\\S/.test(line.text))\n            indent = 0;\n        let cur = /^\\s*/.exec(line.text)[0];\n        let norm = indentString(state, indent);\n        if (cur != norm) {\n            updated[line.from] = indent;\n            changes.push({ from: line.from, to: line.from + cur.length, insert: norm });\n        }\n    }\n    return state.changes(changes);\n}\n/**\nIndentation contexts are used when calling [indentation\nservices](https://codemirror.net/6/docs/ref/#language.indentService). They provide helper utilities\nuseful in indentation logic, and can selectively override the\nindentation reported for some lines.\n*/\nclass IndentContext {\n    /**\n    Create an indent context.\n    */\n    constructor(\n    /**\n    The editor state.\n    */\n    state, \n    /**\n    @internal\n    */\n    options = {}) {\n        this.state = state;\n        this.options = options;\n        this.unit = getIndentUnit(state);\n    }\n    /**\n    Get a description of the line at the given position, taking\n    [simulated line\n    breaks](https://codemirror.net/6/docs/ref/#language.IndentContext.constructor^options.simulateBreak)\n    into account. If there is such a break at `pos`, the `bias`\n    argument determines whether the part of the line line before or\n    after the break is used.\n    */\n    lineAt(pos, bias = 1) {\n        let line = this.state.doc.lineAt(pos);\n        let { simulateBreak, simulateDoubleBreak } = this.options;\n        if (simulateBreak != null && simulateBreak >= line.from && simulateBreak <= line.to) {\n            if (simulateDoubleBreak && simulateBreak == pos)\n                return { text: \"\", from: pos };\n            else if (bias < 0 ? simulateBreak < pos : simulateBreak <= pos)\n                return { text: line.text.slice(simulateBreak - line.from), from: simulateBreak };\n            else\n                return { text: line.text.slice(0, simulateBreak - line.from), from: line.from };\n        }\n        return line;\n    }\n    /**\n    Get the text directly after `pos`, either the entire line\n    or the next 100 characters, whichever is shorter.\n    */\n    textAfterPos(pos, bias = 1) {\n        if (this.options.simulateDoubleBreak && pos == this.options.simulateBreak)\n            return \"\";\n        let { text, from } = this.lineAt(pos, bias);\n        return text.slice(pos - from, Math.min(text.length, pos + 100 - from));\n    }\n    /**\n    Find the column for the given position.\n    */\n    column(pos, bias = 1) {\n        let { text, from } = this.lineAt(pos, bias);\n        let result = this.countColumn(text, pos - from);\n        let override = this.options.overrideIndentation ? this.options.overrideIndentation(from) : -1;\n        if (override > -1)\n            result += override - this.countColumn(text, text.search(/\\S|$/));\n        return result;\n    }\n    /**\n    Find the column position (taking tabs into account) of the given\n    position in the given string.\n    */\n    countColumn(line, pos = line.length) {\n        return countColumn(line, this.state.tabSize, pos);\n    }\n    /**\n    Find the indentation column of the line at the given point.\n    */\n    lineIndent(pos, bias = 1) {\n        let { text, from } = this.lineAt(pos, bias);\n        let override = this.options.overrideIndentation;\n        if (override) {\n            let overriden = override(from);\n            if (overriden > -1)\n                return overriden;\n        }\n        return this.countColumn(text, text.search(/\\S|$/));\n    }\n    /**\n    Returns the [simulated line\n    break](https://codemirror.net/6/docs/ref/#language.IndentContext.constructor^options.simulateBreak)\n    for this context, if any.\n    */\n    get simulatedBreak() {\n        return this.options.simulateBreak || null;\n    }\n}\n/**\nA syntax tree node prop used to associate indentation strategies\nwith node types. Such a strategy is a function from an indentation\ncontext to a column number (see also\n[`indentString`](https://codemirror.net/6/docs/ref/#language.indentString)) or null, where null\nindicates that no definitive indentation can be determined.\n*/\nconst indentNodeProp = /*@__PURE__*/new NodeProp();\n// Compute the indentation for a given position from the syntax tree.\nfunction syntaxIndentation(cx, ast, pos) {\n    return indentFrom(ast.resolveInner(pos).enterUnfinishedNodesBefore(pos), pos, cx);\n}\nfunction ignoreClosed(cx) {\n    return cx.pos == cx.options.simulateBreak && cx.options.simulateDoubleBreak;\n}\nfunction indentStrategy(tree) {\n    let strategy = tree.type.prop(indentNodeProp);\n    if (strategy)\n        return strategy;\n    let first = tree.firstChild, close;\n    if (first && (close = first.type.prop(NodeProp.closedBy))) {\n        let last = tree.lastChild, closed = last && close.indexOf(last.name) > -1;\n        return cx => delimitedStrategy(cx, true, 1, undefined, closed && !ignoreClosed(cx) ? last.from : undefined);\n    }\n    return tree.parent == null ? topIndent : null;\n}\nfunction indentFrom(node, pos, base) {\n    for (; node; node = node.parent) {\n        let strategy = indentStrategy(node);\n        if (strategy)\n            return strategy(TreeIndentContext.create(base, pos, node));\n    }\n    return null;\n}\nfunction topIndent() { return 0; }\n/**\nObjects of this type provide context information and helper\nmethods to indentation functions registered on syntax nodes.\n*/\nclass TreeIndentContext extends IndentContext {\n    constructor(base, \n    /**\n    The position at which indentation is being computed.\n    */\n    pos, \n    /**\n    The syntax tree node to which the indentation strategy\n    applies.\n    */\n    node) {\n        super(base.state, base.options);\n        this.base = base;\n        this.pos = pos;\n        this.node = node;\n    }\n    /**\n    @internal\n    */\n    static create(base, pos, node) {\n        return new TreeIndentContext(base, pos, node);\n    }\n    /**\n    Get the text directly after `this.pos`, either the entire line\n    or the next 100 characters, whichever is shorter.\n    */\n    get textAfter() {\n        return this.textAfterPos(this.pos);\n    }\n    /**\n    Get the indentation at the reference line for `this.node`, which\n    is the line on which it starts, unless there is a node that is\n    _not_ a parent of this node covering the start of that line. If\n    so, the line at the start of that node is tried, again skipping\n    on if it is covered by another such node.\n    */\n    get baseIndent() {\n        return this.baseIndentFor(this.node);\n    }\n    /**\n    Get the indentation for the reference line of the given node\n    (see [`baseIndent`](https://codemirror.net/6/docs/ref/#language.TreeIndentContext.baseIndent)).\n    */\n    baseIndentFor(node) {\n        let line = this.state.doc.lineAt(node.from);\n        // Skip line starts that are covered by a sibling (or cousin, etc)\n        for (;;) {\n            let atBreak = node.resolve(line.from);\n            while (atBreak.parent && atBreak.parent.from == atBreak.from)\n                atBreak = atBreak.parent;\n            if (isParent(atBreak, node))\n                break;\n            line = this.state.doc.lineAt(atBreak.from);\n        }\n        return this.lineIndent(line.from);\n    }\n    /**\n    Continue looking for indentations in the node's parent nodes,\n    and return the result of that.\n    */\n    continue() {\n        let parent = this.node.parent;\n        return parent ? indentFrom(parent, this.pos, this.base) : 0;\n    }\n}\nfunction isParent(parent, of) {\n    for (let cur = of; cur; cur = cur.parent)\n        if (parent == cur)\n            return true;\n    return false;\n}\n// Check whether a delimited node is aligned (meaning there are\n// non-skipped nodes on the same line as the opening delimiter). And\n// if so, return the opening token.\nfunction bracketedAligned(context) {\n    let tree = context.node;\n    let openToken = tree.childAfter(tree.from), last = tree.lastChild;\n    if (!openToken)\n        return null;\n    let sim = context.options.simulateBreak;\n    let openLine = context.state.doc.lineAt(openToken.from);\n    let lineEnd = sim == null || sim <= openLine.from ? openLine.to : Math.min(openLine.to, sim);\n    for (let pos = openToken.to;;) {\n        let next = tree.childAfter(pos);\n        if (!next || next == last)\n            return null;\n        if (!next.type.isSkipped)\n            return next.from < lineEnd ? openToken : null;\n        pos = next.to;\n    }\n}\n/**\nAn indentation strategy for delimited (usually bracketed) nodes.\nWill, by default, indent one unit more than the parent's base\nindent unless the line starts with a closing token. When `align`\nis true and there are non-skipped nodes on the node's opening\nline, the content of the node will be aligned with the end of the\nopening node, like this:\n\n    foo(bar,\n        baz)\n*/\nfunction delimitedIndent({ closing, align = true, units = 1 }) {\n    return (context) => delimitedStrategy(context, align, units, closing);\n}\nfunction delimitedStrategy(context, align, units, closing, closedAt) {\n    let after = context.textAfter, space = after.match(/^\\s*/)[0].length;\n    let closed = closing && after.slice(space, space + closing.length) == closing || closedAt == context.pos + space;\n    let aligned = align ? bracketedAligned(context) : null;\n    if (aligned)\n        return closed ? context.column(aligned.from) : context.column(aligned.to);\n    return context.baseIndent + (closed ? 0 : context.unit * units);\n}\n/**\nAn indentation strategy that aligns a node's content to its base\nindentation.\n*/\nconst flatIndent = (context) => context.baseIndent;\n/**\nCreates an indentation strategy that, by default, indents\ncontinued lines one unit more than the node's base indentation.\nYou can provide `except` to prevent indentation of lines that\nmatch a pattern (for example `/^else\\b/` in `if`/`else`\nconstructs), and you can change the amount of units used with the\n`units` option.\n*/\nfunction continuedIndent({ except, units = 1 } = {}) {\n    return (context) => {\n        let matchExcept = except && except.test(context.textAfter);\n        return context.baseIndent + (matchExcept ? 0 : units * context.unit);\n    };\n}\nconst DontIndentBeyond = 200;\n/**\nEnables reindentation on input. When a language defines an\n`indentOnInput` field in its [language\ndata](https://codemirror.net/6/docs/ref/#state.EditorState.languageDataAt), which must hold a regular\nexpression, the line at the cursor will be reindented whenever new\ntext is typed and the input from the start of the line up to the\ncursor matches that regexp.\n\nTo avoid unneccesary reindents, it is recommended to start the\nregexp with `^` (usually followed by `\\s*`), and end it with `$`.\nFor example, `/^\\s*\\}$/` will reindent when a closing brace is\nadded at the start of a line.\n*/\nfunction indentOnInput() {\n    return EditorState.transactionFilter.of(tr => {\n        if (!tr.docChanged || !tr.isUserEvent(\"input.type\") && !tr.isUserEvent(\"input.complete\"))\n            return tr;\n        let rules = tr.startState.languageDataAt(\"indentOnInput\", tr.startState.selection.main.head);\n        if (!rules.length)\n            return tr;\n        let doc = tr.newDoc, { head } = tr.newSelection.main, line = doc.lineAt(head);\n        if (head > line.from + DontIndentBeyond)\n            return tr;\n        let lineStart = doc.sliceString(line.from, head);\n        if (!rules.some(r => r.test(lineStart)))\n            return tr;\n        let { state } = tr, last = -1, changes = [];\n        for (let { head } of state.selection.ranges) {\n            let line = state.doc.lineAt(head);\n            if (line.from == last)\n                continue;\n            last = line.from;\n            let indent = getIndentation(state, line.from);\n            if (indent == null)\n                continue;\n            let cur = /^\\s*/.exec(line.text)[0];\n            let norm = indentString(state, indent);\n            if (cur != norm)\n                changes.push({ from: line.from, to: line.from + cur.length, insert: norm });\n        }\n        return changes.length ? [tr, { changes, sequential: true }] : tr;\n    });\n}\n\n/**\nA facet that registers a code folding service. When called with\nthe extent of a line, such a function should return a foldable\nrange that starts on that line (but continues beyond it), if one\ncan be found.\n*/\nconst foldService = /*@__PURE__*/Facet.define();\n/**\nThis node prop is used to associate folding information with\nsyntax node types. Given a syntax node, it should check whether\nthat tree is foldable and return the range that can be collapsed\nwhen it is.\n*/\nconst foldNodeProp = /*@__PURE__*/new NodeProp();\n/**\n[Fold](https://codemirror.net/6/docs/ref/#language.foldNodeProp) function that folds everything but\nthe first and the last child of a syntax node. Useful for nodes\nthat start and end with delimiters.\n*/\nfunction foldInside(node) {\n    let first = node.firstChild, last = node.lastChild;\n    return first && first.to < last.from ? { from: first.to, to: last.type.isError ? node.to : last.from } : null;\n}\nfunction syntaxFolding(state, start, end) {\n    let tree = syntaxTree(state);\n    if (tree.length < end)\n        return null;\n    let inner = tree.resolveInner(end, 1);\n    let found = null;\n    for (let cur = inner; cur; cur = cur.parent) {\n        if (cur.to <= end || cur.from > end)\n            continue;\n        if (found && cur.from < start)\n            break;\n        let prop = cur.type.prop(foldNodeProp);\n        if (prop && (cur.to < tree.length - 50 || tree.length == state.doc.length || !isUnfinished(cur))) {\n            let value = prop(cur, state);\n            if (value && value.from <= end && value.from >= start && value.to > end)\n                found = value;\n        }\n    }\n    return found;\n}\nfunction isUnfinished(node) {\n    let ch = node.lastChild;\n    return ch && ch.to == node.to && ch.type.isError;\n}\n/**\nCheck whether the given line is foldable. First asks any fold\nservices registered through\n[`foldService`](https://codemirror.net/6/docs/ref/#language.foldService), and if none of them return\na result, tries to query the [fold node\nprop](https://codemirror.net/6/docs/ref/#language.foldNodeProp) of syntax nodes that cover the end\nof the line.\n*/\nfunction foldable(state, lineStart, lineEnd) {\n    for (let service of state.facet(foldService)) {\n        let result = service(state, lineStart, lineEnd);\n        if (result)\n            return result;\n    }\n    return syntaxFolding(state, lineStart, lineEnd);\n}\nfunction mapRange(range, mapping) {\n    let from = mapping.mapPos(range.from, 1), to = mapping.mapPos(range.to, -1);\n    return from >= to ? undefined : { from, to };\n}\n/**\nState effect that can be attached to a transaction to fold the\ngiven range. (You probably only need this in exceptional\ncircumstances—usually you'll just want to let\n[`foldCode`](https://codemirror.net/6/docs/ref/#language.foldCode) and the [fold\ngutter](https://codemirror.net/6/docs/ref/#language.foldGutter) create the transactions.)\n*/\nconst foldEffect = /*@__PURE__*/StateEffect.define({ map: mapRange });\n/**\nState effect that unfolds the given range (if it was folded).\n*/\nconst unfoldEffect = /*@__PURE__*/StateEffect.define({ map: mapRange });\nfunction selectedLines(view) {\n    let lines = [];\n    for (let { head } of view.state.selection.ranges) {\n        if (lines.some(l => l.from <= head && l.to >= head))\n            continue;\n        lines.push(view.lineBlockAt(head));\n    }\n    return lines;\n}\n/**\nThe state field that stores the folded ranges (as a [decoration\nset](https://codemirror.net/6/docs/ref/#view.DecorationSet)). Can be passed to\n[`EditorState.toJSON`](https://codemirror.net/6/docs/ref/#state.EditorState.toJSON) and\n[`fromJSON`](https://codemirror.net/6/docs/ref/#state.EditorState^fromJSON) to serialize the fold\nstate.\n*/\nconst foldState = /*@__PURE__*/StateField.define({\n    create() {\n        return Decoration.none;\n    },\n    update(folded, tr) {\n        folded = folded.map(tr.changes);\n        for (let e of tr.effects) {\n            if (e.is(foldEffect) && !foldExists(folded, e.value.from, e.value.to))\n                folded = folded.update({ add: [foldWidget.range(e.value.from, e.value.to)] });\n            else if (e.is(unfoldEffect))\n                folded = folded.update({ filter: (from, to) => e.value.from != from || e.value.to != to,\n                    filterFrom: e.value.from, filterTo: e.value.to });\n        }\n        // Clear folded ranges that cover the selection head\n        if (tr.selection) {\n            let onSelection = false, { head } = tr.selection.main;\n            folded.between(head, head, (a, b) => { if (a < head && b > head)\n                onSelection = true; });\n            if (onSelection)\n                folded = folded.update({\n                    filterFrom: head,\n                    filterTo: head,\n                    filter: (a, b) => b <= head || a >= head\n                });\n        }\n        return folded;\n    },\n    provide: f => EditorView.decorations.from(f),\n    toJSON(folded, state) {\n        let ranges = [];\n        folded.between(0, state.doc.length, (from, to) => { ranges.push(from, to); });\n        return ranges;\n    },\n    fromJSON(value) {\n        if (!Array.isArray(value) || value.length % 2)\n            throw new RangeError(\"Invalid JSON for fold state\");\n        let ranges = [];\n        for (let i = 0; i < value.length;) {\n            let from = value[i++], to = value[i++];\n            if (typeof from != \"number\" || typeof to != \"number\")\n                throw new RangeError(\"Invalid JSON for fold state\");\n            ranges.push(foldWidget.range(from, to));\n        }\n        return Decoration.set(ranges, true);\n    }\n});\n/**\nGet a [range set](https://codemirror.net/6/docs/ref/#state.RangeSet) containing the folded ranges\nin the given state.\n*/\nfunction foldedRanges(state) {\n    return state.field(foldState, false) || RangeSet.empty;\n}\nfunction findFold(state, from, to) {\n    var _a;\n    let found = null;\n    (_a = state.field(foldState, false)) === null || _a === void 0 ? void 0 : _a.between(from, to, (from, to) => {\n        if (!found || found.from > from)\n            found = { from, to };\n    });\n    return found;\n}\nfunction foldExists(folded, from, to) {\n    let found = false;\n    folded.between(from, from, (a, b) => { if (a == from && b == to)\n        found = true; });\n    return found;\n}\nfunction maybeEnable(state, other) {\n    return state.field(foldState, false) ? other : other.concat(StateEffect.appendConfig.of(codeFolding()));\n}\n/**\nFold the lines that are selected, if possible.\n*/\nconst foldCode = view => {\n    for (let line of selectedLines(view)) {\n        let range = foldable(view.state, line.from, line.to);\n        if (range) {\n            view.dispatch({ effects: maybeEnable(view.state, [foldEffect.of(range), announceFold(view, range)]) });\n            return true;\n        }\n    }\n    return false;\n};\n/**\nUnfold folded ranges on selected lines.\n*/\nconst unfoldCode = view => {\n    if (!view.state.field(foldState, false))\n        return false;\n    let effects = [];\n    for (let line of selectedLines(view)) {\n        let folded = findFold(view.state, line.from, line.to);\n        if (folded)\n            effects.push(unfoldEffect.of(folded), announceFold(view, folded, false));\n    }\n    if (effects.length)\n        view.dispatch({ effects });\n    return effects.length > 0;\n};\nfunction announceFold(view, range, fold = true) {\n    let lineFrom = view.state.doc.lineAt(range.from).number, lineTo = view.state.doc.lineAt(range.to).number;\n    return EditorView.announce.of(`${view.state.phrase(fold ? \"Folded lines\" : \"Unfolded lines\")} ${lineFrom} ${view.state.phrase(\"to\")} ${lineTo}.`);\n}\n/**\nFold all top-level foldable ranges. Note that, in most cases,\nfolding information will depend on the [syntax\ntree](https://codemirror.net/6/docs/ref/#language.syntaxTree), and folding everything may not work\nreliably when the document hasn't been fully parsed (either\nbecause the editor state was only just initialized, or because the\ndocument is so big that the parser decided not to parse it\nentirely).\n*/\nconst foldAll = view => {\n    let { state } = view, effects = [];\n    for (let pos = 0; pos < state.doc.length;) {\n        let line = view.lineBlockAt(pos), range = foldable(state, line.from, line.to);\n        if (range)\n            effects.push(foldEffect.of(range));\n        pos = (range ? view.lineBlockAt(range.to) : line).to + 1;\n    }\n    if (effects.length)\n        view.dispatch({ effects: maybeEnable(view.state, effects) });\n    return !!effects.length;\n};\n/**\nUnfold all folded code.\n*/\nconst unfoldAll = view => {\n    let field = view.state.field(foldState, false);\n    if (!field || !field.size)\n        return false;\n    let effects = [];\n    field.between(0, view.state.doc.length, (from, to) => { effects.push(unfoldEffect.of({ from, to })); });\n    view.dispatch({ effects });\n    return true;\n};\n// Find the foldable region containing the given line, if one exists\nfunction foldableContainer(view, lineBlock) {\n    // Look backwards through line blocks until we find a foldable region that\n    // intersects with the line\n    for (let line = lineBlock;;) {\n        let foldableRegion = foldable(view.state, line.from, line.to);\n        if (foldableRegion && foldableRegion.to > lineBlock.from)\n            return foldableRegion;\n        if (!line.from)\n            return null;\n        line = view.lineBlockAt(line.from - 1);\n    }\n}\n/**\nToggle folding at cursors. Unfolds if there is an existing fold\nstarting in that line, tries to find a foldable range around it\notherwise.\n*/\nconst toggleFold = (view) => {\n    let effects = [];\n    for (let line of selectedLines(view)) {\n        let folded = findFold(view.state, line.from, line.to);\n        if (folded) {\n            effects.push(unfoldEffect.of(folded), announceFold(view, folded, false));\n        }\n        else {\n            let foldRange = foldableContainer(view, line);\n            if (foldRange)\n                effects.push(foldEffect.of(foldRange), announceFold(view, foldRange));\n        }\n    }\n    if (effects.length > 0)\n        view.dispatch({ effects: maybeEnable(view.state, effects) });\n    return !!effects.length;\n};\n/**\nDefault fold-related key bindings.\n\n - Ctrl-Shift-[ (Cmd-Alt-[ on macOS): [`foldCode`](https://codemirror.net/6/docs/ref/#language.foldCode).\n - Ctrl-Shift-] (Cmd-Alt-] on macOS): [`unfoldCode`](https://codemirror.net/6/docs/ref/#language.unfoldCode).\n - Ctrl-Alt-[: [`foldAll`](https://codemirror.net/6/docs/ref/#language.foldAll).\n - Ctrl-Alt-]: [`unfoldAll`](https://codemirror.net/6/docs/ref/#language.unfoldAll).\n*/\nconst foldKeymap = [\n    { key: \"Ctrl-Shift-[\", mac: \"Cmd-Alt-[\", run: foldCode },\n    { key: \"Ctrl-Shift-]\", mac: \"Cmd-Alt-]\", run: unfoldCode },\n    { key: \"Ctrl-Alt-[\", run: foldAll },\n    { key: \"Ctrl-Alt-]\", run: unfoldAll }\n];\nconst defaultConfig = {\n    placeholderDOM: null,\n    placeholderText: \"…\"\n};\nconst foldConfig = /*@__PURE__*/Facet.define({\n    combine(values) { return combineConfig(values, defaultConfig); }\n});\n/**\nCreate an extension that configures code folding.\n*/\nfunction codeFolding(config) {\n    let result = [foldState, baseTheme$1];\n    if (config)\n        result.push(foldConfig.of(config));\n    return result;\n}\nconst foldWidget = /*@__PURE__*/Decoration.replace({ widget: /*@__PURE__*/new class extends WidgetType {\n        toDOM(view) {\n            let { state } = view, conf = state.facet(foldConfig);\n            let onclick = (event) => {\n                let line = view.lineBlockAt(view.posAtDOM(event.target));\n                let folded = findFold(view.state, line.from, line.to);\n                if (folded)\n                    view.dispatch({ effects: unfoldEffect.of(folded) });\n                event.preventDefault();\n            };\n            if (conf.placeholderDOM)\n                return conf.placeholderDOM(view, onclick);\n            let element = document.createElement(\"span\");\n            element.textContent = conf.placeholderText;\n            element.setAttribute(\"aria-label\", state.phrase(\"folded code\"));\n            element.title = state.phrase(\"unfold\");\n            element.className = \"cm-foldPlaceholder\";\n            element.onclick = onclick;\n            return element;\n        }\n    } });\nconst foldGutterDefaults = {\n    openText: \"⌄\",\n    closedText: \"›\",\n    markerDOM: null,\n    domEventHandlers: {},\n    foldingChanged: () => false\n};\nclass FoldMarker extends GutterMarker {\n    constructor(config, open) {\n        super();\n        this.config = config;\n        this.open = open;\n    }\n    eq(other) { return this.config == other.config && this.open == other.open; }\n    toDOM(view) {\n        if (this.config.markerDOM)\n            return this.config.markerDOM(this.open);\n        let span = document.createElement(\"span\");\n        span.textContent = this.open ? this.config.openText : this.config.closedText;\n        span.title = view.state.phrase(this.open ? \"Fold line\" : \"Unfold line\");\n        return span;\n    }\n}\n/**\nCreate an extension that registers a fold gutter, which shows a\nfold status indicator before foldable lines (which can be clicked\nto fold or unfold the line).\n*/\nfunction foldGutter(config = {}) {\n    let fullConfig = Object.assign(Object.assign({}, foldGutterDefaults), config);\n    let canFold = new FoldMarker(fullConfig, true), canUnfold = new FoldMarker(fullConfig, false);\n    let markers = ViewPlugin.fromClass(class {\n        constructor(view) {\n            this.from = view.viewport.from;\n            this.markers = this.buildMarkers(view);\n        }\n        update(update) {\n            if (update.docChanged || update.viewportChanged ||\n                update.startState.facet(language) != update.state.facet(language) ||\n                update.startState.field(foldState, false) != update.state.field(foldState, false) ||\n                syntaxTree(update.startState) != syntaxTree(update.state) ||\n                fullConfig.foldingChanged(update))\n                this.markers = this.buildMarkers(update.view);\n        }\n        buildMarkers(view) {\n            let builder = new RangeSetBuilder();\n            for (let line of view.viewportLineBlocks) {\n                let mark = findFold(view.state, line.from, line.to) ? canUnfold\n                    : foldable(view.state, line.from, line.to) ? canFold : null;\n                if (mark)\n                    builder.add(line.from, line.from, mark);\n            }\n            return builder.finish();\n        }\n    });\n    let { domEventHandlers } = fullConfig;\n    return [\n        markers,\n        gutter({\n            class: \"cm-foldGutter\",\n            markers(view) { var _a; return ((_a = view.plugin(markers)) === null || _a === void 0 ? void 0 : _a.markers) || RangeSet.empty; },\n            initialSpacer() {\n                return new FoldMarker(fullConfig, false);\n            },\n            domEventHandlers: Object.assign(Object.assign({}, domEventHandlers), { click: (view, line, event) => {\n                    if (domEventHandlers.click && domEventHandlers.click(view, line, event))\n                        return true;\n                    let folded = findFold(view.state, line.from, line.to);\n                    if (folded) {\n                        view.dispatch({ effects: unfoldEffect.of(folded) });\n                        return true;\n                    }\n                    let range = foldable(view.state, line.from, line.to);\n                    if (range) {\n                        view.dispatch({ effects: foldEffect.of(range) });\n                        return true;\n                    }\n                    return false;\n                } })\n        }),\n        codeFolding()\n    ];\n}\nconst baseTheme$1 = /*@__PURE__*/EditorView.baseTheme({\n    \".cm-foldPlaceholder\": {\n        backgroundColor: \"#eee\",\n        border: \"1px solid #ddd\",\n        color: \"#888\",\n        borderRadius: \".2em\",\n        margin: \"0 1px\",\n        padding: \"0 1px\",\n        cursor: \"pointer\"\n    },\n    \".cm-foldGutter span\": {\n        padding: \"0 1px\",\n        cursor: \"pointer\"\n    }\n});\n\n/**\nA highlight style associates CSS styles with higlighting\n[tags](https://lezer.codemirror.net/docs/ref#highlight.Tag).\n*/\nclass HighlightStyle {\n    constructor(\n    /**\n    The tag styles used to create this highlight style.\n    */\n    specs, options) {\n        this.specs = specs;\n        let modSpec;\n        function def(spec) {\n            let cls = StyleModule.newName();\n            (modSpec || (modSpec = Object.create(null)))[\".\" + cls] = spec;\n            return cls;\n        }\n        const all = typeof options.all == \"string\" ? options.all : options.all ? def(options.all) : undefined;\n        const scopeOpt = options.scope;\n        this.scope = scopeOpt instanceof Language ? (type) => type.prop(languageDataProp) == scopeOpt.data\n            : scopeOpt ? (type) => type == scopeOpt : undefined;\n        this.style = tagHighlighter(specs.map(style => ({\n            tag: style.tag,\n            class: style.class || def(Object.assign({}, style, { tag: null }))\n        })), {\n            all,\n        }).style;\n        this.module = modSpec ? new StyleModule(modSpec) : null;\n        this.themeType = options.themeType;\n    }\n    /**\n    Create a highlighter style that associates the given styles to\n    the given tags. The specs must be objects that hold a style tag\n    or array of tags in their `tag` property, and either a single\n    `class` property providing a static CSS class (for highlighter\n    that rely on external styling), or a\n    [`style-mod`](https://github.com/marijnh/style-mod#documentation)-style\n    set of CSS properties (which define the styling for those tags).\n    \n    The CSS rules created for a highlighter will be emitted in the\n    order of the spec's properties. That means that for elements that\n    have multiple tags associated with them, styles defined further\n    down in the list will have a higher CSS precedence than styles\n    defined earlier.\n    */\n    static define(specs, options) {\n        return new HighlightStyle(specs, options || {});\n    }\n}\nconst highlighterFacet = /*@__PURE__*/Facet.define();\nconst fallbackHighlighter = /*@__PURE__*/Facet.define({\n    combine(values) { return values.length ? [values[0]] : null; }\n});\nfunction getHighlighters(state) {\n    let main = state.facet(highlighterFacet);\n    return main.length ? main : state.facet(fallbackHighlighter);\n}\n/**\nWrap a highlighter in an editor extension that uses it to apply\nsyntax highlighting to the editor content.\n\nWhen multiple (non-fallback) styles are provided, the styling\napplied is the union of the classes they emit.\n*/\nfunction syntaxHighlighting(highlighter, options) {\n    let ext = [treeHighlighter], themeType;\n    if (highlighter instanceof HighlightStyle) {\n        if (highlighter.module)\n            ext.push(EditorView.styleModule.of(highlighter.module));\n        themeType = highlighter.themeType;\n    }\n    if (options === null || options === void 0 ? void 0 : options.fallback)\n        ext.push(fallbackHighlighter.of(highlighter));\n    else if (themeType)\n        ext.push(highlighterFacet.computeN([EditorView.darkTheme], state => {\n            return state.facet(EditorView.darkTheme) == (themeType == \"dark\") ? [highlighter] : [];\n        }));\n    else\n        ext.push(highlighterFacet.of(highlighter));\n    return ext;\n}\n/**\nReturns the CSS classes (if any) that the highlighters active in\nthe state would assign to the given style\n[tags](https://lezer.codemirror.net/docs/ref#highlight.Tag) and\n(optional) language\n[scope](https://codemirror.net/6/docs/ref/#language.HighlightStyle^define^options.scope).\n*/\nfunction highlightingFor(state, tags, scope) {\n    let highlighters = getHighlighters(state);\n    let result = null;\n    if (highlighters)\n        for (let highlighter of highlighters) {\n            if (!highlighter.scope || scope && highlighter.scope(scope)) {\n                let cls = highlighter.style(tags);\n                if (cls)\n                    result = result ? result + \" \" + cls : cls;\n            }\n        }\n    return result;\n}\nclass TreeHighlighter {\n    constructor(view) {\n        this.markCache = Object.create(null);\n        this.tree = syntaxTree(view.state);\n        this.decorations = this.buildDeco(view, getHighlighters(view.state));\n    }\n    update(update) {\n        let tree = syntaxTree(update.state), highlighters = getHighlighters(update.state);\n        let styleChange = highlighters != getHighlighters(update.startState);\n        if (tree.length < update.view.viewport.to && !styleChange && tree.type == this.tree.type) {\n            this.decorations = this.decorations.map(update.changes);\n        }\n        else if (tree != this.tree || update.viewportChanged || styleChange) {\n            this.tree = tree;\n            this.decorations = this.buildDeco(update.view, highlighters);\n        }\n    }\n    buildDeco(view, highlighters) {\n        if (!highlighters || !this.tree.length)\n            return Decoration.none;\n        let builder = new RangeSetBuilder();\n        for (let { from, to } of view.visibleRanges) {\n            highlightTree(this.tree, highlighters, (from, to, style) => {\n                builder.add(from, to, this.markCache[style] || (this.markCache[style] = Decoration.mark({ class: style })));\n            }, from, to);\n        }\n        return builder.finish();\n    }\n}\nconst treeHighlighter = /*@__PURE__*/Prec.high(/*@__PURE__*/ViewPlugin.fromClass(TreeHighlighter, {\n    decorations: v => v.decorations\n}));\n/**\nA default highlight style (works well with light themes).\n*/\nconst defaultHighlightStyle = /*@__PURE__*/HighlightStyle.define([\n    { tag: tags.meta,\n        color: \"#404740\" },\n    { tag: tags.link,\n        textDecoration: \"underline\" },\n    { tag: tags.heading,\n        textDecoration: \"underline\",\n        fontWeight: \"bold\" },\n    { tag: tags.emphasis,\n        fontStyle: \"italic\" },\n    { tag: tags.strong,\n        fontWeight: \"bold\" },\n    { tag: tags.strikethrough,\n        textDecoration: \"line-through\" },\n    { tag: tags.keyword,\n        color: \"#708\" },\n    { tag: [tags.atom, tags.bool, tags.url, tags.contentSeparator, tags.labelName],\n        color: \"#219\" },\n    { tag: [tags.literal, tags.inserted],\n        color: \"#164\" },\n    { tag: [tags.string, tags.deleted],\n        color: \"#a11\" },\n    { tag: [tags.regexp, tags.escape, /*@__PURE__*/tags.special(tags.string)],\n        color: \"#e40\" },\n    { tag: /*@__PURE__*/tags.definition(tags.variableName),\n        color: \"#00f\" },\n    { tag: /*@__PURE__*/tags.local(tags.variableName),\n        color: \"#30a\" },\n    { tag: [tags.typeName, tags.namespace],\n        color: \"#085\" },\n    { tag: tags.className,\n        color: \"#167\" },\n    { tag: [/*@__PURE__*/tags.special(tags.variableName), tags.macroName],\n        color: \"#256\" },\n    { tag: /*@__PURE__*/tags.definition(tags.propertyName),\n        color: \"#00c\" },\n    { tag: tags.comment,\n        color: \"#940\" },\n    { tag: tags.invalid,\n        color: \"#f00\" }\n]);\n\nconst baseTheme = /*@__PURE__*/EditorView.baseTheme({\n    \"&.cm-focused .cm-matchingBracket\": { backgroundColor: \"#328c8252\" },\n    \"&.cm-focused .cm-nonmatchingBracket\": { backgroundColor: \"#bb555544\" }\n});\nconst DefaultScanDist = 10000, DefaultBrackets = \"()[]{}\";\nconst bracketMatchingConfig = /*@__PURE__*/Facet.define({\n    combine(configs) {\n        return combineConfig(configs, {\n            afterCursor: true,\n            brackets: DefaultBrackets,\n            maxScanDistance: DefaultScanDist,\n            renderMatch: defaultRenderMatch\n        });\n    }\n});\nconst matchingMark = /*@__PURE__*/Decoration.mark({ class: \"cm-matchingBracket\" }), nonmatchingMark = /*@__PURE__*/Decoration.mark({ class: \"cm-nonmatchingBracket\" });\nfunction defaultRenderMatch(match) {\n    let decorations = [];\n    let mark = match.matched ? matchingMark : nonmatchingMark;\n    decorations.push(mark.range(match.start.from, match.start.to));\n    if (match.end)\n        decorations.push(mark.range(match.end.from, match.end.to));\n    return decorations;\n}\nconst bracketMatchingState = /*@__PURE__*/StateField.define({\n    create() { return Decoration.none; },\n    update(deco, tr) {\n        if (!tr.docChanged && !tr.selection)\n            return deco;\n        let decorations = [];\n        let config = tr.state.facet(bracketMatchingConfig);\n        for (let range of tr.state.selection.ranges) {\n            if (!range.empty)\n                continue;\n            let match = matchBrackets(tr.state, range.head, -1, config)\n                || (range.head > 0 && matchBrackets(tr.state, range.head - 1, 1, config))\n                || (config.afterCursor &&\n                    (matchBrackets(tr.state, range.head, 1, config) ||\n                        (range.head < tr.state.doc.length && matchBrackets(tr.state, range.head + 1, -1, config))));\n            if (match)\n                decorations = decorations.concat(config.renderMatch(match, tr.state));\n        }\n        return Decoration.set(decorations, true);\n    },\n    provide: f => EditorView.decorations.from(f)\n});\nconst bracketMatchingUnique = [\n    bracketMatchingState,\n    baseTheme\n];\n/**\nCreate an extension that enables bracket matching. Whenever the\ncursor is next to a bracket, that bracket and the one it matches\nare highlighted. Or, when no matching bracket is found, another\nhighlighting style is used to indicate this.\n*/\nfunction bracketMatching(config = {}) {\n    return [bracketMatchingConfig.of(config), bracketMatchingUnique];\n}\n/**\nWhen larger syntax nodes, such as HTML tags, are marked as\nopening/closing, it can be a bit messy to treat the whole node as\na matchable bracket. This node prop allows you to define, for such\na node, a ‘handle’—the part of the node that is highlighted, and\nthat the cursor must be on to activate highlighting in the first\nplace.\n*/\nconst bracketMatchingHandle = /*@__PURE__*/new NodeProp();\nfunction matchingNodes(node, dir, brackets) {\n    let byProp = node.prop(dir < 0 ? NodeProp.openedBy : NodeProp.closedBy);\n    if (byProp)\n        return byProp;\n    if (node.name.length == 1) {\n        let index = brackets.indexOf(node.name);\n        if (index > -1 && index % 2 == (dir < 0 ? 1 : 0))\n            return [brackets[index + dir]];\n    }\n    return null;\n}\nfunction findHandle(node) {\n    let hasHandle = node.type.prop(bracketMatchingHandle);\n    return hasHandle ? hasHandle(node.node) : node;\n}\n/**\nFind the matching bracket for the token at `pos`, scanning\ndirection `dir`. Only the `brackets` and `maxScanDistance`\nproperties are used from `config`, if given. Returns null if no\nbracket was found at `pos`, or a match result otherwise.\n*/\nfunction matchBrackets(state, pos, dir, config = {}) {\n    let maxScanDistance = config.maxScanDistance || DefaultScanDist, brackets = config.brackets || DefaultBrackets;\n    let tree = syntaxTree(state), node = tree.resolveInner(pos, dir);\n    for (let cur = node; cur; cur = cur.parent) {\n        let matches = matchingNodes(cur.type, dir, brackets);\n        if (matches && cur.from < cur.to) {\n            let handle = findHandle(cur);\n            if (handle && (dir > 0 ? pos >= handle.from && pos < handle.to : pos > handle.from && pos <= handle.to))\n                return matchMarkedBrackets(state, pos, dir, cur, handle, matches, brackets);\n        }\n    }\n    return matchPlainBrackets(state, pos, dir, tree, node.type, maxScanDistance, brackets);\n}\nfunction matchMarkedBrackets(_state, _pos, dir, token, handle, matching, brackets) {\n    let parent = token.parent, firstToken = { from: handle.from, to: handle.to };\n    let depth = 0, cursor = parent === null || parent === void 0 ? void 0 : parent.cursor();\n    if (cursor && (dir < 0 ? cursor.childBefore(token.from) : cursor.childAfter(token.to)))\n        do {\n            if (dir < 0 ? cursor.to <= token.from : cursor.from >= token.to) {\n                if (depth == 0 && matching.indexOf(cursor.type.name) > -1 && cursor.from < cursor.to) {\n                    let endHandle = findHandle(cursor);\n                    return { start: firstToken, end: endHandle ? { from: endHandle.from, to: endHandle.to } : undefined, matched: true };\n                }\n                else if (matchingNodes(cursor.type, dir, brackets)) {\n                    depth++;\n                }\n                else if (matchingNodes(cursor.type, -dir, brackets)) {\n                    if (depth == 0) {\n                        let endHandle = findHandle(cursor);\n                        return {\n                            start: firstToken,\n                            end: endHandle && endHandle.from < endHandle.to ? { from: endHandle.from, to: endHandle.to } : undefined,\n                            matched: false\n                        };\n                    }\n                    depth--;\n                }\n            }\n        } while (dir < 0 ? cursor.prevSibling() : cursor.nextSibling());\n    return { start: firstToken, matched: false };\n}\nfunction matchPlainBrackets(state, pos, dir, tree, tokenType, maxScanDistance, brackets) {\n    let startCh = dir < 0 ? state.sliceDoc(pos - 1, pos) : state.sliceDoc(pos, pos + 1);\n    let bracket = brackets.indexOf(startCh);\n    if (bracket < 0 || (bracket % 2 == 0) != (dir > 0))\n        return null;\n    let startToken = { from: dir < 0 ? pos - 1 : pos, to: dir > 0 ? pos + 1 : pos };\n    let iter = state.doc.iterRange(pos, dir > 0 ? state.doc.length : 0), depth = 0;\n    for (let distance = 0; !(iter.next()).done && distance <= maxScanDistance;) {\n        let text = iter.value;\n        if (dir < 0)\n            distance += text.length;\n        let basePos = pos + distance * dir;\n        for (let pos = dir > 0 ? 0 : text.length - 1, end = dir > 0 ? text.length : -1; pos != end; pos += dir) {\n            let found = brackets.indexOf(text[pos]);\n            if (found < 0 || tree.resolveInner(basePos + pos, 1).type != tokenType)\n                continue;\n            if ((found % 2 == 0) == (dir > 0)) {\n                depth++;\n            }\n            else if (depth == 1) { // Closing\n                return { start: startToken, end: { from: basePos + pos, to: basePos + pos + 1 }, matched: (found >> 1) == (bracket >> 1) };\n            }\n            else {\n                depth--;\n            }\n        }\n        if (dir > 0)\n            distance += text.length;\n    }\n    return iter.done ? { start: startToken, matched: false } : null;\n}\n\n// Counts the column offset in a string, taking tabs into account.\n// Used mostly to find indentation.\nfunction countCol(string, end, tabSize, startIndex = 0, startValue = 0) {\n    if (end == null) {\n        end = string.search(/[^\\s\\u00a0]/);\n        if (end == -1)\n            end = string.length;\n    }\n    let n = startValue;\n    for (let i = startIndex; i < end; i++) {\n        if (string.charCodeAt(i) == 9)\n            n += tabSize - (n % tabSize);\n        else\n            n++;\n    }\n    return n;\n}\n/**\nEncapsulates a single line of input. Given to stream syntax code,\nwhich uses it to tokenize the content.\n*/\nclass StringStream {\n    /**\n    Create a stream.\n    */\n    constructor(\n    /**\n    The line.\n    */\n    string, tabSize, \n    /**\n    The current indent unit size.\n    */\n    indentUnit, overrideIndent) {\n        this.string = string;\n        this.tabSize = tabSize;\n        this.indentUnit = indentUnit;\n        this.overrideIndent = overrideIndent;\n        /**\n        The current position on the line.\n        */\n        this.pos = 0;\n        /**\n        The start position of the current token.\n        */\n        this.start = 0;\n        this.lastColumnPos = 0;\n        this.lastColumnValue = 0;\n    }\n    /**\n    True if we are at the end of the line.\n    */\n    eol() { return this.pos >= this.string.length; }\n    /**\n    True if we are at the start of the line.\n    */\n    sol() { return this.pos == 0; }\n    /**\n    Get the next code unit after the current position, or undefined\n    if we're at the end of the line.\n    */\n    peek() { return this.string.charAt(this.pos) || undefined; }\n    /**\n    Read the next code unit and advance `this.pos`.\n    */\n    next() {\n        if (this.pos < this.string.length)\n            return this.string.charAt(this.pos++);\n    }\n    /**\n    Match the next character against the given string, regular\n    expression, or predicate. Consume and return it if it matches.\n    */\n    eat(match) {\n        let ch = this.string.charAt(this.pos);\n        let ok;\n        if (typeof match == \"string\")\n            ok = ch == match;\n        else\n            ok = ch && (match instanceof RegExp ? match.test(ch) : match(ch));\n        if (ok) {\n            ++this.pos;\n            return ch;\n        }\n    }\n    /**\n    Continue matching characters that match the given string,\n    regular expression, or predicate function. Return true if any\n    characters were consumed.\n    */\n    eatWhile(match) {\n        let start = this.pos;\n        while (this.eat(match)) { }\n        return this.pos > start;\n    }\n    /**\n    Consume whitespace ahead of `this.pos`. Return true if any was\n    found.\n    */\n    eatSpace() {\n        let start = this.pos;\n        while (/[\\s\\u00a0]/.test(this.string.charAt(this.pos)))\n            ++this.pos;\n        return this.pos > start;\n    }\n    /**\n    Move to the end of the line.\n    */\n    skipToEnd() { this.pos = this.string.length; }\n    /**\n    Move to directly before the given character, if found on the\n    current line.\n    */\n    skipTo(ch) {\n        let found = this.string.indexOf(ch, this.pos);\n        if (found > -1) {\n            this.pos = found;\n            return true;\n        }\n    }\n    /**\n    Move back `n` characters.\n    */\n    backUp(n) { this.pos -= n; }\n    /**\n    Get the column position at `this.pos`.\n    */\n    column() {\n        if (this.lastColumnPos < this.start) {\n            this.lastColumnValue = countCol(this.string, this.start, this.tabSize, this.lastColumnPos, this.lastColumnValue);\n            this.lastColumnPos = this.start;\n        }\n        return this.lastColumnValue;\n    }\n    /**\n    Get the indentation column of the current line.\n    */\n    indentation() {\n        var _a;\n        return (_a = this.overrideIndent) !== null && _a !== void 0 ? _a : countCol(this.string, null, this.tabSize);\n    }\n    /**\n    Match the input against the given string or regular expression\n    (which should start with a `^`). Return true or the regexp match\n    if it matches.\n    \n    Unless `consume` is set to `false`, this will move `this.pos`\n    past the matched text.\n    \n    When matching a string `caseInsensitive` can be set to true to\n    make the match case-insensitive.\n    */\n    match(pattern, consume, caseInsensitive) {\n        if (typeof pattern == \"string\") {\n            let cased = (str) => caseInsensitive ? str.toLowerCase() : str;\n            let substr = this.string.substr(this.pos, pattern.length);\n            if (cased(substr) == cased(pattern)) {\n                if (consume !== false)\n                    this.pos += pattern.length;\n                return true;\n            }\n            else\n                return null;\n        }\n        else {\n            let match = this.string.slice(this.pos).match(pattern);\n            if (match && match.index > 0)\n                return null;\n            if (match && consume !== false)\n                this.pos += match[0].length;\n            return match;\n        }\n    }\n    /**\n    Get the current token.\n    */\n    current() { return this.string.slice(this.start, this.pos); }\n}\n\nfunction fullParser(spec) {\n    return {\n        name: spec.name || \"\",\n        token: spec.token,\n        blankLine: spec.blankLine || (() => { }),\n        startState: spec.startState || (() => true),\n        copyState: spec.copyState || defaultCopyState,\n        indent: spec.indent || (() => null),\n        languageData: spec.languageData || {},\n        tokenTable: spec.tokenTable || noTokens\n    };\n}\nfunction defaultCopyState(state) {\n    if (typeof state != \"object\")\n        return state;\n    let newState = {};\n    for (let prop in state) {\n        let val = state[prop];\n        newState[prop] = (val instanceof Array ? val.slice() : val);\n    }\n    return newState;\n}\nconst IndentedFrom = /*@__PURE__*/new WeakMap();\n/**\nA [language](https://codemirror.net/6/docs/ref/#language.Language) class based on a CodeMirror\n5-style [streaming parser](https://codemirror.net/6/docs/ref/#language.StreamParser).\n*/\nclass StreamLanguage extends Language {\n    constructor(parser) {\n        let data = defineLanguageFacet(parser.languageData);\n        let p = fullParser(parser), self;\n        let impl = new class extends Parser {\n            createParse(input, fragments, ranges) {\n                return new Parse(self, input, fragments, ranges);\n            }\n        };\n        super(data, impl, [indentService.of((cx, pos) => this.getIndent(cx, pos))], parser.name);\n        this.topNode = docID(data);\n        self = this;\n        this.streamParser = p;\n        this.stateAfter = new NodeProp({ perNode: true });\n        this.tokenTable = parser.tokenTable ? new TokenTable(p.tokenTable) : defaultTokenTable;\n    }\n    /**\n    Define a stream language.\n    */\n    static define(spec) { return new StreamLanguage(spec); }\n    getIndent(cx, pos) {\n        let tree = syntaxTree(cx.state), at = tree.resolve(pos);\n        while (at && at.type != this.topNode)\n            at = at.parent;\n        if (!at)\n            return null;\n        let from = undefined;\n        let { overrideIndentation } = cx.options;\n        if (overrideIndentation) {\n            from = IndentedFrom.get(cx.state);\n            if (from != null && from < pos - 1e4)\n                from = undefined;\n        }\n        let start = findState(this, tree, 0, at.from, from !== null && from !== void 0 ? from : pos), statePos, state;\n        if (start) {\n            state = start.state;\n            statePos = start.pos + 1;\n        }\n        else {\n            state = this.streamParser.startState(cx.unit);\n            statePos = 0;\n        }\n        if (pos - statePos > 10000 /* MaxIndentScanDist */)\n            return null;\n        while (statePos < pos) {\n            let line = cx.state.doc.lineAt(statePos), end = Math.min(pos, line.to);\n            if (line.length) {\n                let indentation = overrideIndentation ? overrideIndentation(line.from) : -1;\n                let stream = new StringStream(line.text, cx.state.tabSize, cx.unit, indentation < 0 ? undefined : indentation);\n                while (stream.pos < end - line.from)\n                    readToken(this.streamParser.token, stream, state);\n            }\n            else {\n                this.streamParser.blankLine(state, cx.unit);\n            }\n            if (end == pos)\n                break;\n            statePos = line.to + 1;\n        }\n        let line = cx.lineAt(pos);\n        if (overrideIndentation && from == null)\n            IndentedFrom.set(cx.state, line.from);\n        return this.streamParser.indent(state, /^\\s*(.*)/.exec(line.text)[1], cx);\n    }\n    get allowsNesting() { return false; }\n}\nfunction findState(lang, tree, off, startPos, before) {\n    let state = off >= startPos && off + tree.length <= before && tree.prop(lang.stateAfter);\n    if (state)\n        return { state: lang.streamParser.copyState(state), pos: off + tree.length };\n    for (let i = tree.children.length - 1; i >= 0; i--) {\n        let child = tree.children[i], pos = off + tree.positions[i];\n        let found = child instanceof Tree && pos < before && findState(lang, child, pos, startPos, before);\n        if (found)\n            return found;\n    }\n    return null;\n}\nfunction cutTree(lang, tree, from, to, inside) {\n    if (inside && from <= 0 && to >= tree.length)\n        return tree;\n    if (!inside && tree.type == lang.topNode)\n        inside = true;\n    for (let i = tree.children.length - 1; i >= 0; i--) {\n        let pos = tree.positions[i], child = tree.children[i], inner;\n        if (pos < to && child instanceof Tree) {\n            if (!(inner = cutTree(lang, child, from - pos, to - pos, inside)))\n                break;\n            return !inside ? inner\n                : new Tree(tree.type, tree.children.slice(0, i).concat(inner), tree.positions.slice(0, i + 1), pos + inner.length);\n        }\n    }\n    return null;\n}\nfunction findStartInFragments(lang, fragments, startPos, editorState) {\n    for (let f of fragments) {\n        let from = f.from + (f.openStart ? 25 : 0), to = f.to - (f.openEnd ? 25 : 0);\n        let found = from <= startPos && to > startPos && findState(lang, f.tree, 0 - f.offset, startPos, to), tree;\n        if (found && (tree = cutTree(lang, f.tree, startPos + f.offset, found.pos + f.offset, false)))\n            return { state: found.state, tree };\n    }\n    return { state: lang.streamParser.startState(editorState ? getIndentUnit(editorState) : 4), tree: Tree.empty };\n}\nclass Parse {\n    constructor(lang, input, fragments, ranges) {\n        this.lang = lang;\n        this.input = input;\n        this.fragments = fragments;\n        this.ranges = ranges;\n        this.stoppedAt = null;\n        this.chunks = [];\n        this.chunkPos = [];\n        this.chunk = [];\n        this.chunkReused = undefined;\n        this.rangeIndex = 0;\n        this.to = ranges[ranges.length - 1].to;\n        let context = ParseContext.get(), from = ranges[0].from;\n        let { state, tree } = findStartInFragments(lang, fragments, from, context === null || context === void 0 ? void 0 : context.state);\n        this.state = state;\n        this.parsedPos = this.chunkStart = from + tree.length;\n        for (let i = 0; i < tree.children.length; i++) {\n            this.chunks.push(tree.children[i]);\n            this.chunkPos.push(tree.positions[i]);\n        }\n        if (context && this.parsedPos < context.viewport.from - 100000 /* MaxDistanceBeforeViewport */) {\n            this.state = this.lang.streamParser.startState(getIndentUnit(context.state));\n            context.skipUntilInView(this.parsedPos, context.viewport.from);\n            this.parsedPos = context.viewport.from;\n        }\n        this.moveRangeIndex();\n    }\n    advance() {\n        let context = ParseContext.get();\n        let parseEnd = this.stoppedAt == null ? this.to : Math.min(this.to, this.stoppedAt);\n        let end = Math.min(parseEnd, this.chunkStart + 2048 /* ChunkSize */);\n        if (context)\n            end = Math.min(end, context.viewport.to);\n        while (this.parsedPos < end)\n            this.parseLine(context);\n        if (this.chunkStart < this.parsedPos)\n            this.finishChunk();\n        if (this.parsedPos >= parseEnd)\n            return this.finish();\n        if (context && this.parsedPos >= context.viewport.to) {\n            context.skipUntilInView(this.parsedPos, parseEnd);\n            return this.finish();\n        }\n        return null;\n    }\n    stopAt(pos) {\n        this.stoppedAt = pos;\n    }\n    lineAfter(pos) {\n        let chunk = this.input.chunk(pos);\n        if (!this.input.lineChunks) {\n            let eol = chunk.indexOf(\"\\n\");\n            if (eol > -1)\n                chunk = chunk.slice(0, eol);\n        }\n        else if (chunk == \"\\n\") {\n            chunk = \"\";\n        }\n        return pos + chunk.length <= this.to ? chunk : chunk.slice(0, this.to - pos);\n    }\n    nextLine() {\n        let from = this.parsedPos, line = this.lineAfter(from), end = from + line.length;\n        for (let index = this.rangeIndex;;) {\n            let rangeEnd = this.ranges[index].to;\n            if (rangeEnd >= end)\n                break;\n            line = line.slice(0, rangeEnd - (end - line.length));\n            index++;\n            if (index == this.ranges.length)\n                break;\n            let rangeStart = this.ranges[index].from;\n            let after = this.lineAfter(rangeStart);\n            line += after;\n            end = rangeStart + after.length;\n        }\n        return { line, end };\n    }\n    skipGapsTo(pos, offset, side) {\n        for (;;) {\n            let end = this.ranges[this.rangeIndex].to, offPos = pos + offset;\n            if (side > 0 ? end > offPos : end >= offPos)\n                break;\n            let start = this.ranges[++this.rangeIndex].from;\n            offset += start - end;\n        }\n        return offset;\n    }\n    moveRangeIndex() {\n        while (this.ranges[this.rangeIndex].to < this.parsedPos)\n            this.rangeIndex++;\n    }\n    emitToken(id, from, to, size, offset) {\n        if (this.ranges.length > 1) {\n            offset = this.skipGapsTo(from, offset, 1);\n            from += offset;\n            let len0 = this.chunk.length;\n            offset = this.skipGapsTo(to, offset, -1);\n            to += offset;\n            size += this.chunk.length - len0;\n        }\n        this.chunk.push(id, from, to, size);\n        return offset;\n    }\n    parseLine(context) {\n        let { line, end } = this.nextLine(), offset = 0, { streamParser } = this.lang;\n        let stream = new StringStream(line, context ? context.state.tabSize : 4, context ? getIndentUnit(context.state) : 2);\n        if (stream.eol()) {\n            streamParser.blankLine(this.state, stream.indentUnit);\n        }\n        else {\n            while (!stream.eol()) {\n                let token = readToken(streamParser.token, stream, this.state);\n                if (token)\n                    offset = this.emitToken(this.lang.tokenTable.resolve(token), this.parsedPos + stream.start, this.parsedPos + stream.pos, 4, offset);\n                if (stream.start > 10000 /* MaxLineLength */)\n                    break;\n            }\n        }\n        this.parsedPos = end;\n        this.moveRangeIndex();\n        if (this.parsedPos < this.to)\n            this.parsedPos++;\n    }\n    finishChunk() {\n        let tree = Tree.build({\n            buffer: this.chunk,\n            start: this.chunkStart,\n            length: this.parsedPos - this.chunkStart,\n            nodeSet,\n            topID: 0,\n            maxBufferLength: 2048 /* ChunkSize */,\n            reused: this.chunkReused\n        });\n        tree = new Tree(tree.type, tree.children, tree.positions, tree.length, [[this.lang.stateAfter, this.lang.streamParser.copyState(this.state)]]);\n        this.chunks.push(tree);\n        this.chunkPos.push(this.chunkStart - this.ranges[0].from);\n        this.chunk = [];\n        this.chunkReused = undefined;\n        this.chunkStart = this.parsedPos;\n    }\n    finish() {\n        return new Tree(this.lang.topNode, this.chunks, this.chunkPos, this.parsedPos - this.ranges[0].from).balance();\n    }\n}\nfunction readToken(token, stream, state) {\n    stream.start = stream.pos;\n    for (let i = 0; i < 10; i++) {\n        let result = token(stream, state);\n        if (stream.pos > stream.start)\n            return result;\n    }\n    throw new Error(\"Stream parser failed to advance stream.\");\n}\nconst noTokens = /*@__PURE__*/Object.create(null);\nconst typeArray = [NodeType.none];\nconst nodeSet = /*@__PURE__*/new NodeSet(typeArray);\nconst warned = [];\nconst defaultTable = /*@__PURE__*/Object.create(null);\nfor (let [legacyName, name] of [\n    [\"variable\", \"variableName\"],\n    [\"variable-2\", \"variableName.special\"],\n    [\"string-2\", \"string.special\"],\n    [\"def\", \"variableName.definition\"],\n    [\"tag\", \"tagName\"],\n    [\"attribute\", \"attributeName\"],\n    [\"type\", \"typeName\"],\n    [\"builtin\", \"variableName.standard\"],\n    [\"qualifier\", \"modifier\"],\n    [\"error\", \"invalid\"],\n    [\"header\", \"heading\"],\n    [\"property\", \"propertyName\"]\n])\n    defaultTable[legacyName] = /*@__PURE__*/createTokenType(noTokens, name);\nclass TokenTable {\n    constructor(extra) {\n        this.extra = extra;\n        this.table = Object.assign(Object.create(null), defaultTable);\n    }\n    resolve(tag) {\n        return !tag ? 0 : this.table[tag] || (this.table[tag] = createTokenType(this.extra, tag));\n    }\n}\nconst defaultTokenTable = /*@__PURE__*/new TokenTable(noTokens);\nfunction warnForPart(part, msg) {\n    if (warned.indexOf(part) > -1)\n        return;\n    warned.push(part);\n    console.warn(msg);\n}\nfunction createTokenType(extra, tagStr) {\n    let tag = null;\n    for (let part of tagStr.split(\".\")) {\n        let value = (extra[part] || tags[part]);\n        if (!value) {\n            warnForPart(part, `Unknown highlighting tag ${part}`);\n        }\n        else if (typeof value == \"function\") {\n            if (!tag)\n                warnForPart(part, `Modifier ${part} used at start of tag`);\n            else\n                tag = value(tag);\n        }\n        else {\n            if (tag)\n                warnForPart(part, `Tag ${part} used as modifier`);\n            else\n                tag = value;\n        }\n    }\n    if (!tag)\n        return 0;\n    let name = tagStr.replace(/ /g, \"_\"), type = NodeType.define({\n        id: typeArray.length,\n        name,\n        props: [styleTags({ [name]: tag })]\n    });\n    typeArray.push(type);\n    return type.id;\n}\nfunction docID(data) {\n    let type = NodeType.define({ id: typeArray.length, name: \"Document\", props: [languageDataProp.add(() => data)] });\n    typeArray.push(type);\n    return type;\n}\n\nexport { DocInput, HighlightStyle, IndentContext, LRLanguage, Language, LanguageDescription, LanguageSupport, ParseContext, StreamLanguage, StringStream, TreeIndentContext, bracketMatching, bracketMatchingHandle, codeFolding, continuedIndent, defaultHighlightStyle, defineLanguageFacet, delimitedIndent, ensureSyntaxTree, flatIndent, foldAll, foldCode, foldEffect, foldGutter, foldInside, foldKeymap, foldNodeProp, foldService, foldState, foldable, foldedRanges, forceParsing, getIndentUnit, getIndentation, highlightingFor, indentNodeProp, indentOnInput, indentRange, indentService, indentString, indentUnit, language, languageDataProp, matchBrackets, sublanguageProp, syntaxHighlighting, syntaxParserRunning, syntaxTree, syntaxTreeAvailable, toggleFold, unfoldAll, unfoldCode, unfoldEffect };\n","import { parser } from '@lezer/rust';\nimport { LRLanguage, indentNodeProp, continuedIndent, foldNodeProp, foldInside, LanguageSupport } from '@codemirror/language';\n\n/**\nA syntax provider based on the [Lezer Rust\nparser](https://github.com/lezer-parser/rust), extended with\nhighlighting and indentation information.\n*/\nconst rustLanguage = /*@__PURE__*/LRLanguage.define({\n    name: \"rust\",\n    parser: /*@__PURE__*/parser.configure({\n        props: [\n            /*@__PURE__*/indentNodeProp.add({\n                IfExpression: /*@__PURE__*/continuedIndent({ except: /^\\s*({|else\\b)/ }),\n                \"String BlockComment\": () => null,\n                \"AttributeItem\": cx => cx.continue(),\n                \"Statement MatchArm\": /*@__PURE__*/continuedIndent()\n            }),\n            /*@__PURE__*/foldNodeProp.add(type => {\n                if (/(Block|edTokens|List)$/.test(type.name))\n                    return foldInside;\n                if (type.name == \"BlockComment\")\n                    return tree => ({ from: tree.from + 2, to: tree.to - 2 });\n                return undefined;\n            })\n        ]\n    }),\n    languageData: {\n        commentTokens: { line: \"//\", block: { open: \"/*\", close: \"*/\" } },\n        indentOnInput: /^\\s*(?:\\{|\\})$/,\n        closeBrackets: { stringPrefixes: [\"b\", \"r\", \"br\"] }\n    }\n});\n/**\nRust language support\n*/\nfunction rust() {\n    return new LanguageSupport(rustLanguage);\n}\n\nexport { rust, rustLanguage };\n","/**\n * @license React\n * scheduler.development.js\n *\n * Copyright (c) Facebook, Inc. and its affiliates.\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\n'use strict';\n\nif (process.env.NODE_ENV !== \"production\") {\n  (function() {\n\n          'use strict';\n\n/* global __REACT_DEVTOOLS_GLOBAL_HOOK__ */\nif (\n  typeof __REACT_DEVTOOLS_GLOBAL_HOOK__ !== 'undefined' &&\n  typeof __REACT_DEVTOOLS_GLOBAL_HOOK__.registerInternalModuleStart ===\n    'function'\n) {\n  __REACT_DEVTOOLS_GLOBAL_HOOK__.registerInternalModuleStart(new Error());\n}\n          var enableSchedulerDebugging = false;\nvar enableProfiling = false;\nvar frameYieldMs = 5;\n\nfunction push(heap, node) {\n  var index = heap.length;\n  heap.push(node);\n  siftUp(heap, node, index);\n}\nfunction peek(heap) {\n  return heap.length === 0 ? null : heap[0];\n}\nfunction pop(heap) {\n  if (heap.length === 0) {\n    return null;\n  }\n\n  var first = heap[0];\n  var last = heap.pop();\n\n  if (last !== first) {\n    heap[0] = last;\n    siftDown(heap, last, 0);\n  }\n\n  return first;\n}\n\nfunction siftUp(heap, node, i) {\n  var index = i;\n\n  while (index > 0) {\n    var parentIndex = index - 1 >>> 1;\n    var parent = heap[parentIndex];\n\n    if (compare(parent, node) > 0) {\n      // The parent is larger. Swap positions.\n      heap[parentIndex] = node;\n      heap[index] = parent;\n      index = parentIndex;\n    } else {\n      // The parent is smaller. Exit.\n      return;\n    }\n  }\n}\n\nfunction siftDown(heap, node, i) {\n  var index = i;\n  var length = heap.length;\n  var halfLength = length >>> 1;\n\n  while (index < halfLength) {\n    var leftIndex = (index + 1) * 2 - 1;\n    var left = heap[leftIndex];\n    var rightIndex = leftIndex + 1;\n    var right = heap[rightIndex]; // If the left or right node is smaller, swap with the smaller of those.\n\n    if (compare(left, node) < 0) {\n      if (rightIndex < length && compare(right, left) < 0) {\n        heap[index] = right;\n        heap[rightIndex] = node;\n        index = rightIndex;\n      } else {\n        heap[index] = left;\n        heap[leftIndex] = node;\n        index = leftIndex;\n      }\n    } else if (rightIndex < length && compare(right, node) < 0) {\n      heap[index] = right;\n      heap[rightIndex] = node;\n      index = rightIndex;\n    } else {\n      // Neither child is smaller. Exit.\n      return;\n    }\n  }\n}\n\nfunction compare(a, b) {\n  // Compare sort index first, then task id.\n  var diff = a.sortIndex - b.sortIndex;\n  return diff !== 0 ? diff : a.id - b.id;\n}\n\n// TODO: Use symbols?\nvar ImmediatePriority = 1;\nvar UserBlockingPriority = 2;\nvar NormalPriority = 3;\nvar LowPriority = 4;\nvar IdlePriority = 5;\n\nfunction markTaskErrored(task, ms) {\n}\n\n/* eslint-disable no-var */\n\nvar hasPerformanceNow = typeof performance === 'object' && typeof performance.now === 'function';\n\nif (hasPerformanceNow) {\n  var localPerformance = performance;\n\n  exports.unstable_now = function () {\n    return localPerformance.now();\n  };\n} else {\n  var localDate = Date;\n  var initialTime = localDate.now();\n\n  exports.unstable_now = function () {\n    return localDate.now() - initialTime;\n  };\n} // Max 31 bit integer. The max integer size in V8 for 32-bit systems.\n// Math.pow(2, 30) - 1\n// 0b111111111111111111111111111111\n\n\nvar maxSigned31BitInt = 1073741823; // Times out immediately\n\nvar IMMEDIATE_PRIORITY_TIMEOUT = -1; // Eventually times out\n\nvar USER_BLOCKING_PRIORITY_TIMEOUT = 250;\nvar NORMAL_PRIORITY_TIMEOUT = 5000;\nvar LOW_PRIORITY_TIMEOUT = 10000; // Never times out\n\nvar IDLE_PRIORITY_TIMEOUT = maxSigned31BitInt; // Tasks are stored on a min heap\n\nvar taskQueue = [];\nvar timerQueue = []; // Incrementing id counter. Used to maintain insertion order.\n\nvar taskIdCounter = 1; // Pausing the scheduler is useful for debugging.\nvar currentTask = null;\nvar currentPriorityLevel = NormalPriority; // This is set while performing work, to prevent re-entrance.\n\nvar isPerformingWork = false;\nvar isHostCallbackScheduled = false;\nvar isHostTimeoutScheduled = false; // Capture local references to native APIs, in case a polyfill overrides them.\n\nvar localSetTimeout = typeof setTimeout === 'function' ? setTimeout : null;\nvar localClearTimeout = typeof clearTimeout === 'function' ? clearTimeout : null;\nvar localSetImmediate = typeof setImmediate !== 'undefined' ? setImmediate : null; // IE and Node.js + jsdom\n\nvar isInputPending = typeof navigator !== 'undefined' && navigator.scheduling !== undefined && navigator.scheduling.isInputPending !== undefined ? navigator.scheduling.isInputPending.bind(navigator.scheduling) : null;\n\nfunction advanceTimers(currentTime) {\n  // Check for tasks that are no longer delayed and add them to the queue.\n  var timer = peek(timerQueue);\n\n  while (timer !== null) {\n    if (timer.callback === null) {\n      // Timer was cancelled.\n      pop(timerQueue);\n    } else if (timer.startTime <= currentTime) {\n      // Timer fired. Transfer to the task queue.\n      pop(timerQueue);\n      timer.sortIndex = timer.expirationTime;\n      push(taskQueue, timer);\n    } else {\n      // Remaining timers are pending.\n      return;\n    }\n\n    timer = peek(timerQueue);\n  }\n}\n\nfunction handleTimeout(currentTime) {\n  isHostTimeoutScheduled = false;\n  advanceTimers(currentTime);\n\n  if (!isHostCallbackScheduled) {\n    if (peek(taskQueue) !== null) {\n      isHostCallbackScheduled = true;\n      requestHostCallback(flushWork);\n    } else {\n      var firstTimer = peek(timerQueue);\n\n      if (firstTimer !== null) {\n        requestHostTimeout(handleTimeout, firstTimer.startTime - currentTime);\n      }\n    }\n  }\n}\n\nfunction flushWork(hasTimeRemaining, initialTime) {\n\n\n  isHostCallbackScheduled = false;\n\n  if (isHostTimeoutScheduled) {\n    // We scheduled a timeout but it's no longer needed. Cancel it.\n    isHostTimeoutScheduled = false;\n    cancelHostTimeout();\n  }\n\n  isPerformingWork = true;\n  var previousPriorityLevel = currentPriorityLevel;\n\n  try {\n    if (enableProfiling) {\n      try {\n        return workLoop(hasTimeRemaining, initialTime);\n      } catch (error) {\n        if (currentTask !== null) {\n          var currentTime = exports.unstable_now();\n          markTaskErrored(currentTask, currentTime);\n          currentTask.isQueued = false;\n        }\n\n        throw error;\n      }\n    } else {\n      // No catch in prod code path.\n      return workLoop(hasTimeRemaining, initialTime);\n    }\n  } finally {\n    currentTask = null;\n    currentPriorityLevel = previousPriorityLevel;\n    isPerformingWork = false;\n  }\n}\n\nfunction workLoop(hasTimeRemaining, initialTime) {\n  var currentTime = initialTime;\n  advanceTimers(currentTime);\n  currentTask = peek(taskQueue);\n\n  while (currentTask !== null && !(enableSchedulerDebugging )) {\n    if (currentTask.expirationTime > currentTime && (!hasTimeRemaining || shouldYieldToHost())) {\n      // This currentTask hasn't expired, and we've reached the deadline.\n      break;\n    }\n\n    var callback = currentTask.callback;\n\n    if (typeof callback === 'function') {\n      currentTask.callback = null;\n      currentPriorityLevel = currentTask.priorityLevel;\n      var didUserCallbackTimeout = currentTask.expirationTime <= currentTime;\n\n      var continuationCallback = callback(didUserCallbackTimeout);\n      currentTime = exports.unstable_now();\n\n      if (typeof continuationCallback === 'function') {\n        currentTask.callback = continuationCallback;\n      } else {\n\n        if (currentTask === peek(taskQueue)) {\n          pop(taskQueue);\n        }\n      }\n\n      advanceTimers(currentTime);\n    } else {\n      pop(taskQueue);\n    }\n\n    currentTask = peek(taskQueue);\n  } // Return whether there's additional work\n\n\n  if (currentTask !== null) {\n    return true;\n  } else {\n    var firstTimer = peek(timerQueue);\n\n    if (firstTimer !== null) {\n      requestHostTimeout(handleTimeout, firstTimer.startTime - currentTime);\n    }\n\n    return false;\n  }\n}\n\nfunction unstable_runWithPriority(priorityLevel, eventHandler) {\n  switch (priorityLevel) {\n    case ImmediatePriority:\n    case UserBlockingPriority:\n    case NormalPriority:\n    case LowPriority:\n    case IdlePriority:\n      break;\n\n    default:\n      priorityLevel = NormalPriority;\n  }\n\n  var previousPriorityLevel = currentPriorityLevel;\n  currentPriorityLevel = priorityLevel;\n\n  try {\n    return eventHandler();\n  } finally {\n    currentPriorityLevel = previousPriorityLevel;\n  }\n}\n\nfunction unstable_next(eventHandler) {\n  var priorityLevel;\n\n  switch (currentPriorityLevel) {\n    case ImmediatePriority:\n    case UserBlockingPriority:\n    case NormalPriority:\n      // Shift down to normal priority\n      priorityLevel = NormalPriority;\n      break;\n\n    default:\n      // Anything lower than normal priority should remain at the current level.\n      priorityLevel = currentPriorityLevel;\n      break;\n  }\n\n  var previousPriorityLevel = currentPriorityLevel;\n  currentPriorityLevel = priorityLevel;\n\n  try {\n    return eventHandler();\n  } finally {\n    currentPriorityLevel = previousPriorityLevel;\n  }\n}\n\nfunction unstable_wrapCallback(callback) {\n  var parentPriorityLevel = currentPriorityLevel;\n  return function () {\n    // This is a fork of runWithPriority, inlined for performance.\n    var previousPriorityLevel = currentPriorityLevel;\n    currentPriorityLevel = parentPriorityLevel;\n\n    try {\n      return callback.apply(this, arguments);\n    } finally {\n      currentPriorityLevel = previousPriorityLevel;\n    }\n  };\n}\n\nfunction unstable_scheduleCallback(priorityLevel, callback, options) {\n  var currentTime = exports.unstable_now();\n  var startTime;\n\n  if (typeof options === 'object' && options !== null) {\n    var delay = options.delay;\n\n    if (typeof delay === 'number' && delay > 0) {\n      startTime = currentTime + delay;\n    } else {\n      startTime = currentTime;\n    }\n  } else {\n    startTime = currentTime;\n  }\n\n  var timeout;\n\n  switch (priorityLevel) {\n    case ImmediatePriority:\n      timeout = IMMEDIATE_PRIORITY_TIMEOUT;\n      break;\n\n    case UserBlockingPriority:\n      timeout = USER_BLOCKING_PRIORITY_TIMEOUT;\n      break;\n\n    case IdlePriority:\n      timeout = IDLE_PRIORITY_TIMEOUT;\n      break;\n\n    case LowPriority:\n      timeout = LOW_PRIORITY_TIMEOUT;\n      break;\n\n    case NormalPriority:\n    default:\n      timeout = NORMAL_PRIORITY_TIMEOUT;\n      break;\n  }\n\n  var expirationTime = startTime + timeout;\n  var newTask = {\n    id: taskIdCounter++,\n    callback: callback,\n    priorityLevel: priorityLevel,\n    startTime: startTime,\n    expirationTime: expirationTime,\n    sortIndex: -1\n  };\n\n  if (startTime > currentTime) {\n    // This is a delayed task.\n    newTask.sortIndex = startTime;\n    push(timerQueue, newTask);\n\n    if (peek(taskQueue) === null && newTask === peek(timerQueue)) {\n      // All tasks are delayed, and this is the task with the earliest delay.\n      if (isHostTimeoutScheduled) {\n        // Cancel an existing timeout.\n        cancelHostTimeout();\n      } else {\n        isHostTimeoutScheduled = true;\n      } // Schedule a timeout.\n\n\n      requestHostTimeout(handleTimeout, startTime - currentTime);\n    }\n  } else {\n    newTask.sortIndex = expirationTime;\n    push(taskQueue, newTask);\n    // wait until the next time we yield.\n\n\n    if (!isHostCallbackScheduled && !isPerformingWork) {\n      isHostCallbackScheduled = true;\n      requestHostCallback(flushWork);\n    }\n  }\n\n  return newTask;\n}\n\nfunction unstable_pauseExecution() {\n}\n\nfunction unstable_continueExecution() {\n\n  if (!isHostCallbackScheduled && !isPerformingWork) {\n    isHostCallbackScheduled = true;\n    requestHostCallback(flushWork);\n  }\n}\n\nfunction unstable_getFirstCallbackNode() {\n  return peek(taskQueue);\n}\n\nfunction unstable_cancelCallback(task) {\n  // remove from the queue because you can't remove arbitrary nodes from an\n  // array based heap, only the first one.)\n\n\n  task.callback = null;\n}\n\nfunction unstable_getCurrentPriorityLevel() {\n  return currentPriorityLevel;\n}\n\nvar isMessageLoopRunning = false;\nvar scheduledHostCallback = null;\nvar taskTimeoutID = -1; // Scheduler periodically yields in case there is other work on the main\n// thread, like user events. By default, it yields multiple times per frame.\n// It does not attempt to align with frame boundaries, since most tasks don't\n// need to be frame aligned; for those that do, use requestAnimationFrame.\n\nvar frameInterval = frameYieldMs;\nvar startTime = -1;\n\nfunction shouldYieldToHost() {\n  var timeElapsed = exports.unstable_now() - startTime;\n\n  if (timeElapsed < frameInterval) {\n    // The main thread has only been blocked for a really short amount of time;\n    // smaller than a single frame. Don't yield yet.\n    return false;\n  } // The main thread has been blocked for a non-negligible amount of time. We\n\n\n  return true;\n}\n\nfunction requestPaint() {\n\n}\n\nfunction forceFrameRate(fps) {\n  if (fps < 0 || fps > 125) {\n    // Using console['error'] to evade Babel and ESLint\n    console['error']('forceFrameRate takes a positive int between 0 and 125, ' + 'forcing frame rates higher than 125 fps is not supported');\n    return;\n  }\n\n  if (fps > 0) {\n    frameInterval = Math.floor(1000 / fps);\n  } else {\n    // reset the framerate\n    frameInterval = frameYieldMs;\n  }\n}\n\nvar performWorkUntilDeadline = function () {\n  if (scheduledHostCallback !== null) {\n    var currentTime = exports.unstable_now(); // Keep track of the start time so we can measure how long the main thread\n    // has been blocked.\n\n    startTime = currentTime;\n    var hasTimeRemaining = true; // If a scheduler task throws, exit the current browser task so the\n    // error can be observed.\n    //\n    // Intentionally not using a try-catch, since that makes some debugging\n    // techniques harder. Instead, if `scheduledHostCallback` errors, then\n    // `hasMoreWork` will remain true, and we'll continue the work loop.\n\n    var hasMoreWork = true;\n\n    try {\n      hasMoreWork = scheduledHostCallback(hasTimeRemaining, currentTime);\n    } finally {\n      if (hasMoreWork) {\n        // If there's more work, schedule the next message event at the end\n        // of the preceding one.\n        schedulePerformWorkUntilDeadline();\n      } else {\n        isMessageLoopRunning = false;\n        scheduledHostCallback = null;\n      }\n    }\n  } else {\n    isMessageLoopRunning = false;\n  } // Yielding to the browser will give it a chance to paint, so we can\n};\n\nvar schedulePerformWorkUntilDeadline;\n\nif (typeof localSetImmediate === 'function') {\n  // Node.js and old IE.\n  // There's a few reasons for why we prefer setImmediate.\n  //\n  // Unlike MessageChannel, it doesn't prevent a Node.js process from exiting.\n  // (Even though this is a DOM fork of the Scheduler, you could get here\n  // with a mix of Node.js 15+, which has a MessageChannel, and jsdom.)\n  // https://github.com/facebook/react/issues/20756\n  //\n  // But also, it runs earlier which is the semantic we want.\n  // If other browsers ever implement it, it's better to use it.\n  // Although both of these would be inferior to native scheduling.\n  schedulePerformWorkUntilDeadline = function () {\n    localSetImmediate(performWorkUntilDeadline);\n  };\n} else if (typeof MessageChannel !== 'undefined') {\n  // DOM and Worker environments.\n  // We prefer MessageChannel because of the 4ms setTimeout clamping.\n  var channel = new MessageChannel();\n  var port = channel.port2;\n  channel.port1.onmessage = performWorkUntilDeadline;\n\n  schedulePerformWorkUntilDeadline = function () {\n    port.postMessage(null);\n  };\n} else {\n  // We should only fallback here in non-browser environments.\n  schedulePerformWorkUntilDeadline = function () {\n    localSetTimeout(performWorkUntilDeadline, 0);\n  };\n}\n\nfunction requestHostCallback(callback) {\n  scheduledHostCallback = callback;\n\n  if (!isMessageLoopRunning) {\n    isMessageLoopRunning = true;\n    schedulePerformWorkUntilDeadline();\n  }\n}\n\nfunction requestHostTimeout(callback, ms) {\n  taskTimeoutID = localSetTimeout(function () {\n    callback(exports.unstable_now());\n  }, ms);\n}\n\nfunction cancelHostTimeout() {\n  localClearTimeout(taskTimeoutID);\n  taskTimeoutID = -1;\n}\n\nvar unstable_requestPaint = requestPaint;\nvar unstable_Profiling =  null;\n\nexports.unstable_IdlePriority = IdlePriority;\nexports.unstable_ImmediatePriority = ImmediatePriority;\nexports.unstable_LowPriority = LowPriority;\nexports.unstable_NormalPriority = NormalPriority;\nexports.unstable_Profiling = unstable_Profiling;\nexports.unstable_UserBlockingPriority = UserBlockingPriority;\nexports.unstable_cancelCallback = unstable_cancelCallback;\nexports.unstable_continueExecution = unstable_continueExecution;\nexports.unstable_forceFrameRate = forceFrameRate;\nexports.unstable_getCurrentPriorityLevel = unstable_getCurrentPriorityLevel;\nexports.unstable_getFirstCallbackNode = unstable_getFirstCallbackNode;\nexports.unstable_next = unstable_next;\nexports.unstable_pauseExecution = unstable_pauseExecution;\nexports.unstable_requestPaint = unstable_requestPaint;\nexports.unstable_runWithPriority = unstable_runWithPriority;\nexports.unstable_scheduleCallback = unstable_scheduleCallback;\nexports.unstable_shouldYield = shouldYieldToHost;\nexports.unstable_wrapCallback = unstable_wrapCallback;\n          /* global __REACT_DEVTOOLS_GLOBAL_HOOK__ */\nif (\n  typeof __REACT_DEVTOOLS_GLOBAL_HOOK__ !== 'undefined' &&\n  typeof __REACT_DEVTOOLS_GLOBAL_HOOK__.registerInternalModuleStop ===\n    'function'\n) {\n  __REACT_DEVTOOLS_GLOBAL_HOOK__.registerInternalModuleStop(new Error());\n}\n        \n  })();\n}\n","'use strict';\n\nif (process.env.NODE_ENV === 'production') {\n  module.exports = require('./cjs/scheduler.production.min.js');\n} else {\n  module.exports = require('./cjs/scheduler.development.js');\n}\n","/**\n * @license React\n * react-dom.development.js\n *\n * Copyright (c) Facebook, Inc. and its affiliates.\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\n'use strict';\n\nif (process.env.NODE_ENV !== \"production\") {\n  (function() {\n\n          'use strict';\n\n/* global __REACT_DEVTOOLS_GLOBAL_HOOK__ */\nif (\n  typeof __REACT_DEVTOOLS_GLOBAL_HOOK__ !== 'undefined' &&\n  typeof __REACT_DEVTOOLS_GLOBAL_HOOK__.registerInternalModuleStart ===\n    'function'\n) {\n  __REACT_DEVTOOLS_GLOBAL_HOOK__.registerInternalModuleStart(new Error());\n}\n          var React = require('react');\nvar Scheduler = require('scheduler');\n\nvar ReactSharedInternals = React.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED;\n\nvar suppressWarning = false;\nfunction setSuppressWarning(newSuppressWarning) {\n  {\n    suppressWarning = newSuppressWarning;\n  }\n} // In DEV, calls to console.warn and console.error get replaced\n// by calls to these methods by a Babel plugin.\n//\n// In PROD (or in packages without access to React internals),\n// they are left as they are instead.\n\nfunction warn(format) {\n  {\n    if (!suppressWarning) {\n      for (var _len = arguments.length, args = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {\n        args[_key - 1] = arguments[_key];\n      }\n\n      printWarning('warn', format, args);\n    }\n  }\n}\nfunction error(format) {\n  {\n    if (!suppressWarning) {\n      for (var _len2 = arguments.length, args = new Array(_len2 > 1 ? _len2 - 1 : 0), _key2 = 1; _key2 < _len2; _key2++) {\n        args[_key2 - 1] = arguments[_key2];\n      }\n\n      printWarning('error', format, args);\n    }\n  }\n}\n\nfunction printWarning(level, format, args) {\n  // When changing this logic, you might want to also\n  // update consoleWithStackDev.www.js as well.\n  {\n    var ReactDebugCurrentFrame = ReactSharedInternals.ReactDebugCurrentFrame;\n    var stack = ReactDebugCurrentFrame.getStackAddendum();\n\n    if (stack !== '') {\n      format += '%s';\n      args = args.concat([stack]);\n    } // eslint-disable-next-line react-internal/safe-string-coercion\n\n\n    var argsWithFormat = args.map(function (item) {\n      return String(item);\n    }); // Careful: RN currently depends on this prefix\n\n    argsWithFormat.unshift('Warning: ' + format); // We intentionally don't use spread (or .apply) directly because it\n    // breaks IE9: https://github.com/facebook/react/issues/13610\n    // eslint-disable-next-line react-internal/no-production-logging\n\n    Function.prototype.apply.call(console[level], console, argsWithFormat);\n  }\n}\n\nvar FunctionComponent = 0;\nvar ClassComponent = 1;\nvar IndeterminateComponent = 2; // Before we know whether it is function or class\n\nvar HostRoot = 3; // Root of a host tree. Could be nested inside another node.\n\nvar HostPortal = 4; // A subtree. Could be an entry point to a different renderer.\n\nvar HostComponent = 5;\nvar HostText = 6;\nvar Fragment = 7;\nvar Mode = 8;\nvar ContextConsumer = 9;\nvar ContextProvider = 10;\nvar ForwardRef = 11;\nvar Profiler = 12;\nvar SuspenseComponent = 13;\nvar MemoComponent = 14;\nvar SimpleMemoComponent = 15;\nvar LazyComponent = 16;\nvar IncompleteClassComponent = 17;\nvar DehydratedFragment = 18;\nvar SuspenseListComponent = 19;\nvar ScopeComponent = 21;\nvar OffscreenComponent = 22;\nvar LegacyHiddenComponent = 23;\nvar CacheComponent = 24;\nvar TracingMarkerComponent = 25;\n\n// -----------------------------------------------------------------------------\n\nvar enableClientRenderFallbackOnTextMismatch = true; // TODO: Need to review this code one more time before landing\n// the react-reconciler package.\n\nvar enableNewReconciler = false; // Support legacy Primer support on internal FB www\n\nvar enableLazyContextPropagation = false; // FB-only usage. The new API has different semantics.\n\nvar enableLegacyHidden = false; // Enables unstable_avoidThisFallback feature in Fiber\n\nvar enableSuspenseAvoidThisFallback = false; // Enables unstable_avoidThisFallback feature in Fizz\n// React DOM Chopping Block\n//\n// Similar to main Chopping Block but only flags related to React DOM. These are\n// grouped because we will likely batch all of them into a single major release.\n// -----------------------------------------------------------------------------\n// Disable support for comment nodes as React DOM containers. Already disabled\n// in open source, but www codebase still relies on it. Need to remove.\n\nvar disableCommentsAsDOMContainers = true; // Disable javascript: URL strings in href for XSS protection.\n// and client rendering, mostly to allow JSX attributes to apply to the custom\n// element's object properties instead of only HTML attributes.\n// https://github.com/facebook/react/issues/11347\n\nvar enableCustomElementPropertySupport = false; // Disables children for <textarea> elements\nvar warnAboutStringRefs = false; // -----------------------------------------------------------------------------\n// Debugging and DevTools\n// -----------------------------------------------------------------------------\n// Adds user timing marks for e.g. state updates, suspense, and work loop stuff,\n// for an experimental timeline tool.\n\nvar enableSchedulingProfiler = true; // Helps identify side effects in render-phase lifecycle hooks and setState\n\nvar enableProfilerTimer = true; // Record durations for commit and passive effects phases.\n\nvar enableProfilerCommitHooks = true; // Phase param passed to onRender callback differentiates between an \"update\" and a \"cascading-update\".\n\nvar allNativeEvents = new Set();\n/**\n * Mapping from registration name to event name\n */\n\n\nvar registrationNameDependencies = {};\n/**\n * Mapping from lowercase registration names to the properly cased version,\n * used to warn in the case of missing event handlers. Available\n * only in true.\n * @type {Object}\n */\n\nvar possibleRegistrationNames =  {} ; // Trust the developer to only use possibleRegistrationNames in true\n\nfunction registerTwoPhaseEvent(registrationName, dependencies) {\n  registerDirectEvent(registrationName, dependencies);\n  registerDirectEvent(registrationName + 'Capture', dependencies);\n}\nfunction registerDirectEvent(registrationName, dependencies) {\n  {\n    if (registrationNameDependencies[registrationName]) {\n      error('EventRegistry: More than one plugin attempted to publish the same ' + 'registration name, `%s`.', registrationName);\n    }\n  }\n\n  registrationNameDependencies[registrationName] = dependencies;\n\n  {\n    var lowerCasedName = registrationName.toLowerCase();\n    possibleRegistrationNames[lowerCasedName] = registrationName;\n\n    if (registrationName === 'onDoubleClick') {\n      possibleRegistrationNames.ondblclick = registrationName;\n    }\n  }\n\n  for (var i = 0; i < dependencies.length; i++) {\n    allNativeEvents.add(dependencies[i]);\n  }\n}\n\nvar canUseDOM = !!(typeof window !== 'undefined' && typeof window.document !== 'undefined' && typeof window.document.createElement !== 'undefined');\n\nvar hasOwnProperty = Object.prototype.hasOwnProperty;\n\n/*\n * The `'' + value` pattern (used in in perf-sensitive code) throws for Symbol\n * and Temporal.* types. See https://github.com/facebook/react/pull/22064.\n *\n * The functions in this module will throw an easier-to-understand,\n * easier-to-debug exception with a clear errors message message explaining the\n * problem. (Instead of a confusing exception thrown inside the implementation\n * of the `value` object).\n */\n// $FlowFixMe only called in DEV, so void return is not possible.\nfunction typeName(value) {\n  {\n    // toStringTag is needed for namespaced types like Temporal.Instant\n    var hasToStringTag = typeof Symbol === 'function' && Symbol.toStringTag;\n    var type = hasToStringTag && value[Symbol.toStringTag] || value.constructor.name || 'Object';\n    return type;\n  }\n} // $FlowFixMe only called in DEV, so void return is not possible.\n\n\nfunction willCoercionThrow(value) {\n  {\n    try {\n      testStringCoercion(value);\n      return false;\n    } catch (e) {\n      return true;\n    }\n  }\n}\n\nfunction testStringCoercion(value) {\n  // If you ended up here by following an exception call stack, here's what's\n  // happened: you supplied an object or symbol value to React (as a prop, key,\n  // DOM attribute, CSS property, string ref, etc.) and when React tried to\n  // coerce it to a string using `'' + value`, an exception was thrown.\n  //\n  // The most common types that will cause this exception are `Symbol` instances\n  // and Temporal objects like `Temporal.Instant`. But any object that has a\n  // `valueOf` or `[Symbol.toPrimitive]` method that throws will also cause this\n  // exception. (Library authors do this to prevent users from using built-in\n  // numeric operators like `+` or comparison operators like `>=` because custom\n  // methods are needed to perform accurate arithmetic or comparison.)\n  //\n  // To fix the problem, coerce this object or symbol value to a string before\n  // passing it to React. The most reliable way is usually `String(value)`.\n  //\n  // To find which value is throwing, check the browser or debugger console.\n  // Before this exception was thrown, there should be `console.error` output\n  // that shows the type (Symbol, Temporal.PlainDate, etc.) that caused the\n  // problem and how that type was used: key, atrribute, input value prop, etc.\n  // In most cases, this console output also shows the component and its\n  // ancestor components where the exception happened.\n  //\n  // eslint-disable-next-line react-internal/safe-string-coercion\n  return '' + value;\n}\n\nfunction checkAttributeStringCoercion(value, attributeName) {\n  {\n    if (willCoercionThrow(value)) {\n      error('The provided `%s` attribute is an unsupported type %s.' + ' This value must be coerced to a string before before using it here.', attributeName, typeName(value));\n\n      return testStringCoercion(value); // throw (to help callers find troubleshooting comments)\n    }\n  }\n}\nfunction checkKeyStringCoercion(value) {\n  {\n    if (willCoercionThrow(value)) {\n      error('The provided key is an unsupported type %s.' + ' This value must be coerced to a string before before using it here.', typeName(value));\n\n      return testStringCoercion(value); // throw (to help callers find troubleshooting comments)\n    }\n  }\n}\nfunction checkPropStringCoercion(value, propName) {\n  {\n    if (willCoercionThrow(value)) {\n      error('The provided `%s` prop is an unsupported type %s.' + ' This value must be coerced to a string before before using it here.', propName, typeName(value));\n\n      return testStringCoercion(value); // throw (to help callers find troubleshooting comments)\n    }\n  }\n}\nfunction checkCSSPropertyStringCoercion(value, propName) {\n  {\n    if (willCoercionThrow(value)) {\n      error('The provided `%s` CSS property is an unsupported type %s.' + ' This value must be coerced to a string before before using it here.', propName, typeName(value));\n\n      return testStringCoercion(value); // throw (to help callers find troubleshooting comments)\n    }\n  }\n}\nfunction checkHtmlStringCoercion(value) {\n  {\n    if (willCoercionThrow(value)) {\n      error('The provided HTML markup uses a value of unsupported type %s.' + ' This value must be coerced to a string before before using it here.', typeName(value));\n\n      return testStringCoercion(value); // throw (to help callers find troubleshooting comments)\n    }\n  }\n}\nfunction checkFormFieldValueStringCoercion(value) {\n  {\n    if (willCoercionThrow(value)) {\n      error('Form field values (value, checked, defaultValue, or defaultChecked props)' + ' must be strings, not %s.' + ' This value must be coerced to a string before before using it here.', typeName(value));\n\n      return testStringCoercion(value); // throw (to help callers find troubleshooting comments)\n    }\n  }\n}\n\n// A reserved attribute.\n// It is handled by React separately and shouldn't be written to the DOM.\nvar RESERVED = 0; // A simple string attribute.\n// Attributes that aren't in the filter are presumed to have this type.\n\nvar STRING = 1; // A string attribute that accepts booleans in React. In HTML, these are called\n// \"enumerated\" attributes with \"true\" and \"false\" as possible values.\n// When true, it should be set to a \"true\" string.\n// When false, it should be set to a \"false\" string.\n\nvar BOOLEANISH_STRING = 2; // A real boolean attribute.\n// When true, it should be present (set either to an empty string or its name).\n// When false, it should be omitted.\n\nvar BOOLEAN = 3; // An attribute that can be used as a flag as well as with a value.\n// When true, it should be present (set either to an empty string or its name).\n// When false, it should be omitted.\n// For any other value, should be present with that value.\n\nvar OVERLOADED_BOOLEAN = 4; // An attribute that must be numeric or parse as a numeric.\n// When falsy, it should be removed.\n\nvar NUMERIC = 5; // An attribute that must be positive numeric or parse as a positive numeric.\n// When falsy, it should be removed.\n\nvar POSITIVE_NUMERIC = 6;\n\n/* eslint-disable max-len */\nvar ATTRIBUTE_NAME_START_CHAR = \":A-Z_a-z\\\\u00C0-\\\\u00D6\\\\u00D8-\\\\u00F6\\\\u00F8-\\\\u02FF\\\\u0370-\\\\u037D\\\\u037F-\\\\u1FFF\\\\u200C-\\\\u200D\\\\u2070-\\\\u218F\\\\u2C00-\\\\u2FEF\\\\u3001-\\\\uD7FF\\\\uF900-\\\\uFDCF\\\\uFDF0-\\\\uFFFD\";\n/* eslint-enable max-len */\n\nvar ATTRIBUTE_NAME_CHAR = ATTRIBUTE_NAME_START_CHAR + \"\\\\-.0-9\\\\u00B7\\\\u0300-\\\\u036F\\\\u203F-\\\\u2040\";\nvar VALID_ATTRIBUTE_NAME_REGEX = new RegExp('^[' + ATTRIBUTE_NAME_START_CHAR + '][' + ATTRIBUTE_NAME_CHAR + ']*$');\nvar illegalAttributeNameCache = {};\nvar validatedAttributeNameCache = {};\nfunction isAttributeNameSafe(attributeName) {\n  if (hasOwnProperty.call(validatedAttributeNameCache, attributeName)) {\n    return true;\n  }\n\n  if (hasOwnProperty.call(illegalAttributeNameCache, attributeName)) {\n    return false;\n  }\n\n  if (VALID_ATTRIBUTE_NAME_REGEX.test(attributeName)) {\n    validatedAttributeNameCache[attributeName] = true;\n    return true;\n  }\n\n  illegalAttributeNameCache[attributeName] = true;\n\n  {\n    error('Invalid attribute name: `%s`', attributeName);\n  }\n\n  return false;\n}\nfunction shouldIgnoreAttribute(name, propertyInfo, isCustomComponentTag) {\n  if (propertyInfo !== null) {\n    return propertyInfo.type === RESERVED;\n  }\n\n  if (isCustomComponentTag) {\n    return false;\n  }\n\n  if (name.length > 2 && (name[0] === 'o' || name[0] === 'O') && (name[1] === 'n' || name[1] === 'N')) {\n    return true;\n  }\n\n  return false;\n}\nfunction shouldRemoveAttributeWithWarning(name, value, propertyInfo, isCustomComponentTag) {\n  if (propertyInfo !== null && propertyInfo.type === RESERVED) {\n    return false;\n  }\n\n  switch (typeof value) {\n    case 'function': // $FlowIssue symbol is perfectly valid here\n\n    case 'symbol':\n      // eslint-disable-line\n      return true;\n\n    case 'boolean':\n      {\n        if (isCustomComponentTag) {\n          return false;\n        }\n\n        if (propertyInfo !== null) {\n          return !propertyInfo.acceptsBooleans;\n        } else {\n          var prefix = name.toLowerCase().slice(0, 5);\n          return prefix !== 'data-' && prefix !== 'aria-';\n        }\n      }\n\n    default:\n      return false;\n  }\n}\nfunction shouldRemoveAttribute(name, value, propertyInfo, isCustomComponentTag) {\n  if (value === null || typeof value === 'undefined') {\n    return true;\n  }\n\n  if (shouldRemoveAttributeWithWarning(name, value, propertyInfo, isCustomComponentTag)) {\n    return true;\n  }\n\n  if (isCustomComponentTag) {\n\n    return false;\n  }\n\n  if (propertyInfo !== null) {\n\n    switch (propertyInfo.type) {\n      case BOOLEAN:\n        return !value;\n\n      case OVERLOADED_BOOLEAN:\n        return value === false;\n\n      case NUMERIC:\n        return isNaN(value);\n\n      case POSITIVE_NUMERIC:\n        return isNaN(value) || value < 1;\n    }\n  }\n\n  return false;\n}\nfunction getPropertyInfo(name) {\n  return properties.hasOwnProperty(name) ? properties[name] : null;\n}\n\nfunction PropertyInfoRecord(name, type, mustUseProperty, attributeName, attributeNamespace, sanitizeURL, removeEmptyString) {\n  this.acceptsBooleans = type === BOOLEANISH_STRING || type === BOOLEAN || type === OVERLOADED_BOOLEAN;\n  this.attributeName = attributeName;\n  this.attributeNamespace = attributeNamespace;\n  this.mustUseProperty = mustUseProperty;\n  this.propertyName = name;\n  this.type = type;\n  this.sanitizeURL = sanitizeURL;\n  this.removeEmptyString = removeEmptyString;\n} // When adding attributes to this list, be sure to also add them to\n// the `possibleStandardNames` module to ensure casing and incorrect\n// name warnings.\n\n\nvar properties = {}; // These props are reserved by React. They shouldn't be written to the DOM.\n\nvar reservedProps = ['children', 'dangerouslySetInnerHTML', // TODO: This prevents the assignment of defaultValue to regular\n// elements (not just inputs). Now that ReactDOMInput assigns to the\n// defaultValue property -- do we need this?\n'defaultValue', 'defaultChecked', 'innerHTML', 'suppressContentEditableWarning', 'suppressHydrationWarning', 'style'];\n\nreservedProps.forEach(function (name) {\n  properties[name] = new PropertyInfoRecord(name, RESERVED, false, // mustUseProperty\n  name, // attributeName\n  null, // attributeNamespace\n  false, // sanitizeURL\n  false);\n}); // A few React string attributes have a different name.\n// This is a mapping from React prop names to the attribute names.\n\n[['acceptCharset', 'accept-charset'], ['className', 'class'], ['htmlFor', 'for'], ['httpEquiv', 'http-equiv']].forEach(function (_ref) {\n  var name = _ref[0],\n      attributeName = _ref[1];\n  properties[name] = new PropertyInfoRecord(name, STRING, false, // mustUseProperty\n  attributeName, // attributeName\n  null, // attributeNamespace\n  false, // sanitizeURL\n  false);\n}); // These are \"enumerated\" HTML attributes that accept \"true\" and \"false\".\n// In React, we let users pass `true` and `false` even though technically\n// these aren't boolean attributes (they are coerced to strings).\n\n['contentEditable', 'draggable', 'spellCheck', 'value'].forEach(function (name) {\n  properties[name] = new PropertyInfoRecord(name, BOOLEANISH_STRING, false, // mustUseProperty\n  name.toLowerCase(), // attributeName\n  null, // attributeNamespace\n  false, // sanitizeURL\n  false);\n}); // These are \"enumerated\" SVG attributes that accept \"true\" and \"false\".\n// In React, we let users pass `true` and `false` even though technically\n// these aren't boolean attributes (they are coerced to strings).\n// Since these are SVG attributes, their attribute names are case-sensitive.\n\n['autoReverse', 'externalResourcesRequired', 'focusable', 'preserveAlpha'].forEach(function (name) {\n  properties[name] = new PropertyInfoRecord(name, BOOLEANISH_STRING, false, // mustUseProperty\n  name, // attributeName\n  null, // attributeNamespace\n  false, // sanitizeURL\n  false);\n}); // These are HTML boolean attributes.\n\n['allowFullScreen', 'async', // Note: there is a special case that prevents it from being written to the DOM\n// on the client side because the browsers are inconsistent. Instead we call focus().\n'autoFocus', 'autoPlay', 'controls', 'default', 'defer', 'disabled', 'disablePictureInPicture', 'disableRemotePlayback', 'formNoValidate', 'hidden', 'loop', 'noModule', 'noValidate', 'open', 'playsInline', 'readOnly', 'required', 'reversed', 'scoped', 'seamless', // Microdata\n'itemScope'].forEach(function (name) {\n  properties[name] = new PropertyInfoRecord(name, BOOLEAN, false, // mustUseProperty\n  name.toLowerCase(), // attributeName\n  null, // attributeNamespace\n  false, // sanitizeURL\n  false);\n}); // These are the few React props that we set as DOM properties\n// rather than attributes. These are all booleans.\n\n['checked', // Note: `option.selected` is not updated if `select.multiple` is\n// disabled with `removeAttribute`. We have special logic for handling this.\n'multiple', 'muted', 'selected' // NOTE: if you add a camelCased prop to this list,\n// you'll need to set attributeName to name.toLowerCase()\n// instead in the assignment below.\n].forEach(function (name) {\n  properties[name] = new PropertyInfoRecord(name, BOOLEAN, true, // mustUseProperty\n  name, // attributeName\n  null, // attributeNamespace\n  false, // sanitizeURL\n  false);\n}); // These are HTML attributes that are \"overloaded booleans\": they behave like\n// booleans, but can also accept a string value.\n\n['capture', 'download' // NOTE: if you add a camelCased prop to this list,\n// you'll need to set attributeName to name.toLowerCase()\n// instead in the assignment below.\n].forEach(function (name) {\n  properties[name] = new PropertyInfoRecord(name, OVERLOADED_BOOLEAN, false, // mustUseProperty\n  name, // attributeName\n  null, // attributeNamespace\n  false, // sanitizeURL\n  false);\n}); // These are HTML attributes that must be positive numbers.\n\n['cols', 'rows', 'size', 'span' // NOTE: if you add a camelCased prop to this list,\n// you'll need to set attributeName to name.toLowerCase()\n// instead in the assignment below.\n].forEach(function (name) {\n  properties[name] = new PropertyInfoRecord(name, POSITIVE_NUMERIC, false, // mustUseProperty\n  name, // attributeName\n  null, // attributeNamespace\n  false, // sanitizeURL\n  false);\n}); // These are HTML attributes that must be numbers.\n\n['rowSpan', 'start'].forEach(function (name) {\n  properties[name] = new PropertyInfoRecord(name, NUMERIC, false, // mustUseProperty\n  name.toLowerCase(), // attributeName\n  null, // attributeNamespace\n  false, // sanitizeURL\n  false);\n});\nvar CAMELIZE = /[\\-\\:]([a-z])/g;\n\nvar capitalize = function (token) {\n  return token[1].toUpperCase();\n}; // This is a list of all SVG attributes that need special casing, namespacing,\n// or boolean value assignment. Regular attributes that just accept strings\n// and have the same names are omitted, just like in the HTML attribute filter.\n// Some of these attributes can be hard to find. This list was created by\n// scraping the MDN documentation.\n\n\n['accent-height', 'alignment-baseline', 'arabic-form', 'baseline-shift', 'cap-height', 'clip-path', 'clip-rule', 'color-interpolation', 'color-interpolation-filters', 'color-profile', 'color-rendering', 'dominant-baseline', 'enable-background', 'fill-opacity', 'fill-rule', 'flood-color', 'flood-opacity', 'font-family', 'font-size', 'font-size-adjust', 'font-stretch', 'font-style', 'font-variant', 'font-weight', 'glyph-name', 'glyph-orientation-horizontal', 'glyph-orientation-vertical', 'horiz-adv-x', 'horiz-origin-x', 'image-rendering', 'letter-spacing', 'lighting-color', 'marker-end', 'marker-mid', 'marker-start', 'overline-position', 'overline-thickness', 'paint-order', 'panose-1', 'pointer-events', 'rendering-intent', 'shape-rendering', 'stop-color', 'stop-opacity', 'strikethrough-position', 'strikethrough-thickness', 'stroke-dasharray', 'stroke-dashoffset', 'stroke-linecap', 'stroke-linejoin', 'stroke-miterlimit', 'stroke-opacity', 'stroke-width', 'text-anchor', 'text-decoration', 'text-rendering', 'underline-position', 'underline-thickness', 'unicode-bidi', 'unicode-range', 'units-per-em', 'v-alphabetic', 'v-hanging', 'v-ideographic', 'v-mathematical', 'vector-effect', 'vert-adv-y', 'vert-origin-x', 'vert-origin-y', 'word-spacing', 'writing-mode', 'xmlns:xlink', 'x-height' // NOTE: if you add a camelCased prop to this list,\n// you'll need to set attributeName to name.toLowerCase()\n// instead in the assignment below.\n].forEach(function (attributeName) {\n  var name = attributeName.replace(CAMELIZE, capitalize);\n  properties[name] = new PropertyInfoRecord(name, STRING, false, // mustUseProperty\n  attributeName, null, // attributeNamespace\n  false, // sanitizeURL\n  false);\n}); // String SVG attributes with the xlink namespace.\n\n['xlink:actuate', 'xlink:arcrole', 'xlink:role', 'xlink:show', 'xlink:title', 'xlink:type' // NOTE: if you add a camelCased prop to this list,\n// you'll need to set attributeName to name.toLowerCase()\n// instead in the assignment below.\n].forEach(function (attributeName) {\n  var name = attributeName.replace(CAMELIZE, capitalize);\n  properties[name] = new PropertyInfoRecord(name, STRING, false, // mustUseProperty\n  attributeName, 'http://www.w3.org/1999/xlink', false, // sanitizeURL\n  false);\n}); // String SVG attributes with the xml namespace.\n\n['xml:base', 'xml:lang', 'xml:space' // NOTE: if you add a camelCased prop to this list,\n// you'll need to set attributeName to name.toLowerCase()\n// instead in the assignment below.\n].forEach(function (attributeName) {\n  var name = attributeName.replace(CAMELIZE, capitalize);\n  properties[name] = new PropertyInfoRecord(name, STRING, false, // mustUseProperty\n  attributeName, 'http://www.w3.org/XML/1998/namespace', false, // sanitizeURL\n  false);\n}); // These attribute exists both in HTML and SVG.\n// The attribute name is case-sensitive in SVG so we can't just use\n// the React name like we do for attributes that exist only in HTML.\n\n['tabIndex', 'crossOrigin'].forEach(function (attributeName) {\n  properties[attributeName] = new PropertyInfoRecord(attributeName, STRING, false, // mustUseProperty\n  attributeName.toLowerCase(), // attributeName\n  null, // attributeNamespace\n  false, // sanitizeURL\n  false);\n}); // These attributes accept URLs. These must not allow javascript: URLS.\n// These will also need to accept Trusted Types object in the future.\n\nvar xlinkHref = 'xlinkHref';\nproperties[xlinkHref] = new PropertyInfoRecord('xlinkHref', STRING, false, // mustUseProperty\n'xlink:href', 'http://www.w3.org/1999/xlink', true, // sanitizeURL\nfalse);\n['src', 'href', 'action', 'formAction'].forEach(function (attributeName) {\n  properties[attributeName] = new PropertyInfoRecord(attributeName, STRING, false, // mustUseProperty\n  attributeName.toLowerCase(), // attributeName\n  null, // attributeNamespace\n  true, // sanitizeURL\n  true);\n});\n\n// and any newline or tab are filtered out as if they're not part of the URL.\n// https://url.spec.whatwg.org/#url-parsing\n// Tab or newline are defined as \\r\\n\\t:\n// https://infra.spec.whatwg.org/#ascii-tab-or-newline\n// A C0 control is a code point in the range \\u0000 NULL to \\u001F\n// INFORMATION SEPARATOR ONE, inclusive:\n// https://infra.spec.whatwg.org/#c0-control-or-space\n\n/* eslint-disable max-len */\n\nvar isJavaScriptProtocol = /^[\\u0000-\\u001F ]*j[\\r\\n\\t]*a[\\r\\n\\t]*v[\\r\\n\\t]*a[\\r\\n\\t]*s[\\r\\n\\t]*c[\\r\\n\\t]*r[\\r\\n\\t]*i[\\r\\n\\t]*p[\\r\\n\\t]*t[\\r\\n\\t]*\\:/i;\nvar didWarn = false;\n\nfunction sanitizeURL(url) {\n  {\n    if (!didWarn && isJavaScriptProtocol.test(url)) {\n      didWarn = true;\n\n      error('A future version of React will block javascript: URLs as a security precaution. ' + 'Use event handlers instead if you can. If you need to generate unsafe HTML try ' + 'using dangerouslySetInnerHTML instead. React was passed %s.', JSON.stringify(url));\n    }\n  }\n}\n\n/**\n * Get the value for a property on a node. Only used in DEV for SSR validation.\n * The \"expected\" argument is used as a hint of what the expected value is.\n * Some properties have multiple equivalent values.\n */\nfunction getValueForProperty(node, name, expected, propertyInfo) {\n  {\n    if (propertyInfo.mustUseProperty) {\n      var propertyName = propertyInfo.propertyName;\n      return node[propertyName];\n    } else {\n      // This check protects multiple uses of `expected`, which is why the\n      // react-internal/safe-string-coercion rule is disabled in several spots\n      // below.\n      {\n        checkAttributeStringCoercion(expected, name);\n      }\n\n      if ( propertyInfo.sanitizeURL) {\n        // If we haven't fully disabled javascript: URLs, and if\n        // the hydration is successful of a javascript: URL, we\n        // still want to warn on the client.\n        // eslint-disable-next-line react-internal/safe-string-coercion\n        sanitizeURL('' + expected);\n      }\n\n      var attributeName = propertyInfo.attributeName;\n      var stringValue = null;\n\n      if (propertyInfo.type === OVERLOADED_BOOLEAN) {\n        if (node.hasAttribute(attributeName)) {\n          var value = node.getAttribute(attributeName);\n\n          if (value === '') {\n            return true;\n          }\n\n          if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n            return value;\n          } // eslint-disable-next-line react-internal/safe-string-coercion\n\n\n          if (value === '' + expected) {\n            return expected;\n          }\n\n          return value;\n        }\n      } else if (node.hasAttribute(attributeName)) {\n        if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n          // We had an attribute but shouldn't have had one, so read it\n          // for the error message.\n          return node.getAttribute(attributeName);\n        }\n\n        if (propertyInfo.type === BOOLEAN) {\n          // If this was a boolean, it doesn't matter what the value is\n          // the fact that we have it is the same as the expected.\n          return expected;\n        } // Even if this property uses a namespace we use getAttribute\n        // because we assume its namespaced name is the same as our config.\n        // To use getAttributeNS we need the local name which we don't have\n        // in our config atm.\n\n\n        stringValue = node.getAttribute(attributeName);\n      }\n\n      if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {\n        return stringValue === null ? expected : stringValue; // eslint-disable-next-line react-internal/safe-string-coercion\n      } else if (stringValue === '' + expected) {\n        return expected;\n      } else {\n        return stringValue;\n      }\n    }\n  }\n}\n/**\n * Get the value for a attribute on a node. Only used in DEV for SSR validation.\n * The third argument is used as a hint of what the expected value is. Some\n * attributes have multiple equivalent values.\n */\n\nfunction getValueForAttribute(node, name, expected, isCustomComponentTag) {\n  {\n    if (!isAttributeNameSafe(name)) {\n      return;\n    }\n\n    if (!node.hasAttribute(name)) {\n      return expected === undefined ? undefined : null;\n    }\n\n    var value = node.getAttribute(name);\n\n    {\n      checkAttributeStringCoercion(expected, name);\n    }\n\n    if (value === '' + expected) {\n      return expected;\n    }\n\n    return value;\n  }\n}\n/**\n * Sets the value for a property on a node.\n *\n * @param {DOMElement} node\n * @param {string} name\n * @param {*} value\n */\n\nfunction setValueForProperty(node, name, value, isCustomComponentTag) {\n  var propertyInfo = getPropertyInfo(name);\n\n  if (shouldIgnoreAttribute(name, propertyInfo, isCustomComponentTag)) {\n    return;\n  }\n\n  if (shouldRemoveAttribute(name, value, propertyInfo, isCustomComponentTag)) {\n    value = null;\n  }\n\n\n  if (isCustomComponentTag || propertyInfo === null) {\n    if (isAttributeNameSafe(name)) {\n      var _attributeName = name;\n\n      if (value === null) {\n        node.removeAttribute(_attributeName);\n      } else {\n        {\n          checkAttributeStringCoercion(value, name);\n        }\n\n        node.setAttribute(_attributeName,  '' + value);\n      }\n    }\n\n    return;\n  }\n\n  var mustUseProperty = propertyInfo.mustUseProperty;\n\n  if (mustUseProperty) {\n    var propertyName = propertyInfo.propertyName;\n\n    if (value === null) {\n      var type = propertyInfo.type;\n      node[propertyName] = type === BOOLEAN ? false : '';\n    } else {\n      // Contrary to `setAttribute`, object properties are properly\n      // `toString`ed by IE8/9.\n      node[propertyName] = value;\n    }\n\n    return;\n  } // The rest are treated as attributes with special cases.\n\n\n  var attributeName = propertyInfo.attributeName,\n      attributeNamespace = propertyInfo.attributeNamespace;\n\n  if (value === null) {\n    node.removeAttribute(attributeName);\n  } else {\n    var _type = propertyInfo.type;\n    var attributeValue;\n\n    if (_type === BOOLEAN || _type === OVERLOADED_BOOLEAN && value === true) {\n      // If attribute type is boolean, we know for sure it won't be an execution sink\n      // and we won't require Trusted Type here.\n      attributeValue = '';\n    } else {\n      // `setAttribute` with objects becomes only `[object]` in IE8/9,\n      // ('' + value) makes it output the correct toString()-value.\n      {\n        {\n          checkAttributeStringCoercion(value, attributeName);\n        }\n\n        attributeValue = '' + value;\n      }\n\n      if (propertyInfo.sanitizeURL) {\n        sanitizeURL(attributeValue.toString());\n      }\n    }\n\n    if (attributeNamespace) {\n      node.setAttributeNS(attributeNamespace, attributeName, attributeValue);\n    } else {\n      node.setAttribute(attributeName, attributeValue);\n    }\n  }\n}\n\n// ATTENTION\n// When adding new symbols to this file,\n// Please consider also adding to 'react-devtools-shared/src/backend/ReactSymbols'\n// The Symbol used to tag the ReactElement-like types.\nvar REACT_ELEMENT_TYPE = Symbol.for('react.element');\nvar REACT_PORTAL_TYPE = Symbol.for('react.portal');\nvar REACT_FRAGMENT_TYPE = Symbol.for('react.fragment');\nvar REACT_STRICT_MODE_TYPE = Symbol.for('react.strict_mode');\nvar REACT_PROFILER_TYPE = Symbol.for('react.profiler');\nvar REACT_PROVIDER_TYPE = Symbol.for('react.provider');\nvar REACT_CONTEXT_TYPE = Symbol.for('react.context');\nvar REACT_FORWARD_REF_TYPE = Symbol.for('react.forward_ref');\nvar REACT_SUSPENSE_TYPE = Symbol.for('react.suspense');\nvar REACT_SUSPENSE_LIST_TYPE = Symbol.for('react.suspense_list');\nvar REACT_MEMO_TYPE = Symbol.for('react.memo');\nvar REACT_LAZY_TYPE = Symbol.for('react.lazy');\nvar REACT_SCOPE_TYPE = Symbol.for('react.scope');\nvar REACT_DEBUG_TRACING_MODE_TYPE = Symbol.for('react.debug_trace_mode');\nvar REACT_OFFSCREEN_TYPE = Symbol.for('react.offscreen');\nvar REACT_LEGACY_HIDDEN_TYPE = Symbol.for('react.legacy_hidden');\nvar REACT_CACHE_TYPE = Symbol.for('react.cache');\nvar REACT_TRACING_MARKER_TYPE = Symbol.for('react.tracing_marker');\nvar MAYBE_ITERATOR_SYMBOL = Symbol.iterator;\nvar FAUX_ITERATOR_SYMBOL = '@@iterator';\nfunction getIteratorFn(maybeIterable) {\n  if (maybeIterable === null || typeof maybeIterable !== 'object') {\n    return null;\n  }\n\n  var maybeIterator = MAYBE_ITERATOR_SYMBOL && maybeIterable[MAYBE_ITERATOR_SYMBOL] || maybeIterable[FAUX_ITERATOR_SYMBOL];\n\n  if (typeof maybeIterator === 'function') {\n    return maybeIterator;\n  }\n\n  return null;\n}\n\nvar assign = Object.assign;\n\n// Helpers to patch console.logs to avoid logging during side-effect free\n// replaying on render function. This currently only patches the object\n// lazily which won't cover if the log function was extracted eagerly.\n// We could also eagerly patch the method.\nvar disabledDepth = 0;\nvar prevLog;\nvar prevInfo;\nvar prevWarn;\nvar prevError;\nvar prevGroup;\nvar prevGroupCollapsed;\nvar prevGroupEnd;\n\nfunction disabledLog() {}\n\ndisabledLog.__reactDisabledLog = true;\nfunction disableLogs() {\n  {\n    if (disabledDepth === 0) {\n      /* eslint-disable react-internal/no-production-logging */\n      prevLog = console.log;\n      prevInfo = console.info;\n      prevWarn = console.warn;\n      prevError = console.error;\n      prevGroup = console.group;\n      prevGroupCollapsed = console.groupCollapsed;\n      prevGroupEnd = console.groupEnd; // https://github.com/facebook/react/issues/19099\n\n      var props = {\n        configurable: true,\n        enumerable: true,\n        value: disabledLog,\n        writable: true\n      }; // $FlowFixMe Flow thinks console is immutable.\n\n      Object.defineProperties(console, {\n        info: props,\n        log: props,\n        warn: props,\n        error: props,\n        group: props,\n        groupCollapsed: props,\n        groupEnd: props\n      });\n      /* eslint-enable react-internal/no-production-logging */\n    }\n\n    disabledDepth++;\n  }\n}\nfunction reenableLogs() {\n  {\n    disabledDepth--;\n\n    if (disabledDepth === 0) {\n      /* eslint-disable react-internal/no-production-logging */\n      var props = {\n        configurable: true,\n        enumerable: true,\n        writable: true\n      }; // $FlowFixMe Flow thinks console is immutable.\n\n      Object.defineProperties(console, {\n        log: assign({}, props, {\n          value: prevLog\n        }),\n        info: assign({}, props, {\n          value: prevInfo\n        }),\n        warn: assign({}, props, {\n          value: prevWarn\n        }),\n        error: assign({}, props, {\n          value: prevError\n        }),\n        group: assign({}, props, {\n          value: prevGroup\n        }),\n        groupCollapsed: assign({}, props, {\n          value: prevGroupCollapsed\n        }),\n        groupEnd: assign({}, props, {\n          value: prevGroupEnd\n        })\n      });\n      /* eslint-enable react-internal/no-production-logging */\n    }\n\n    if (disabledDepth < 0) {\n      error('disabledDepth fell below zero. ' + 'This is a bug in React. Please file an issue.');\n    }\n  }\n}\n\nvar ReactCurrentDispatcher = ReactSharedInternals.ReactCurrentDispatcher;\nvar prefix;\nfunction describeBuiltInComponentFrame(name, source, ownerFn) {\n  {\n    if (prefix === undefined) {\n      // Extract the VM specific prefix used by each line.\n      try {\n        throw Error();\n      } catch (x) {\n        var match = x.stack.trim().match(/\\n( *(at )?)/);\n        prefix = match && match[1] || '';\n      }\n    } // We use the prefix to ensure our stacks line up with native stack frames.\n\n\n    return '\\n' + prefix + name;\n  }\n}\nvar reentry = false;\nvar componentFrameCache;\n\n{\n  var PossiblyWeakMap = typeof WeakMap === 'function' ? WeakMap : Map;\n  componentFrameCache = new PossiblyWeakMap();\n}\n\nfunction describeNativeComponentFrame(fn, construct) {\n  // If something asked for a stack inside a fake render, it should get ignored.\n  if ( !fn || reentry) {\n    return '';\n  }\n\n  {\n    var frame = componentFrameCache.get(fn);\n\n    if (frame !== undefined) {\n      return frame;\n    }\n  }\n\n  var control;\n  reentry = true;\n  var previousPrepareStackTrace = Error.prepareStackTrace; // $FlowFixMe It does accept undefined.\n\n  Error.prepareStackTrace = undefined;\n  var previousDispatcher;\n\n  {\n    previousDispatcher = ReactCurrentDispatcher.current; // Set the dispatcher in DEV because this might be call in the render function\n    // for warnings.\n\n    ReactCurrentDispatcher.current = null;\n    disableLogs();\n  }\n\n  try {\n    // This should throw.\n    if (construct) {\n      // Something should be setting the props in the constructor.\n      var Fake = function () {\n        throw Error();\n      }; // $FlowFixMe\n\n\n      Object.defineProperty(Fake.prototype, 'props', {\n        set: function () {\n          // We use a throwing setter instead of frozen or non-writable props\n          // because that won't throw in a non-strict mode function.\n          throw Error();\n        }\n      });\n\n      if (typeof Reflect === 'object' && Reflect.construct) {\n        // We construct a different control for this case to include any extra\n        // frames added by the construct call.\n        try {\n          Reflect.construct(Fake, []);\n        } catch (x) {\n          control = x;\n        }\n\n        Reflect.construct(fn, [], Fake);\n      } else {\n        try {\n          Fake.call();\n        } catch (x) {\n          control = x;\n        }\n\n        fn.call(Fake.prototype);\n      }\n    } else {\n      try {\n        throw Error();\n      } catch (x) {\n        control = x;\n      }\n\n      fn();\n    }\n  } catch (sample) {\n    // This is inlined manually because closure doesn't do it for us.\n    if (sample && control && typeof sample.stack === 'string') {\n      // This extracts the first frame from the sample that isn't also in the control.\n      // Skipping one frame that we assume is the frame that calls the two.\n      var sampleLines = sample.stack.split('\\n');\n      var controlLines = control.stack.split('\\n');\n      var s = sampleLines.length - 1;\n      var c = controlLines.length - 1;\n\n      while (s >= 1 && c >= 0 && sampleLines[s] !== controlLines[c]) {\n        // We expect at least one stack frame to be shared.\n        // Typically this will be the root most one. However, stack frames may be\n        // cut off due to maximum stack limits. In this case, one maybe cut off\n        // earlier than the other. We assume that the sample is longer or the same\n        // and there for cut off earlier. So we should find the root most frame in\n        // the sample somewhere in the control.\n        c--;\n      }\n\n      for (; s >= 1 && c >= 0; s--, c--) {\n        // Next we find the first one that isn't the same which should be the\n        // frame that called our sample function and the control.\n        if (sampleLines[s] !== controlLines[c]) {\n          // In V8, the first line is describing the message but other VMs don't.\n          // If we're about to return the first line, and the control is also on the same\n          // line, that's a pretty good indicator that our sample threw at same line as\n          // the control. I.e. before we entered the sample frame. So we ignore this result.\n          // This can happen if you passed a class to function component, or non-function.\n          if (s !== 1 || c !== 1) {\n            do {\n              s--;\n              c--; // We may still have similar intermediate frames from the construct call.\n              // The next one that isn't the same should be our match though.\n\n              if (c < 0 || sampleLines[s] !== controlLines[c]) {\n                // V8 adds a \"new\" prefix for native classes. Let's remove it to make it prettier.\n                var _frame = '\\n' + sampleLines[s].replace(' at new ', ' at '); // If our component frame is labeled \"<anonymous>\"\n                // but we have a user-provided \"displayName\"\n                // splice it in to make the stack more readable.\n\n\n                if (fn.displayName && _frame.includes('<anonymous>')) {\n                  _frame = _frame.replace('<anonymous>', fn.displayName);\n                }\n\n                {\n                  if (typeof fn === 'function') {\n                    componentFrameCache.set(fn, _frame);\n                  }\n                } // Return the line we found.\n\n\n                return _frame;\n              }\n            } while (s >= 1 && c >= 0);\n          }\n\n          break;\n        }\n      }\n    }\n  } finally {\n    reentry = false;\n\n    {\n      ReactCurrentDispatcher.current = previousDispatcher;\n      reenableLogs();\n    }\n\n    Error.prepareStackTrace = previousPrepareStackTrace;\n  } // Fallback to just using the name if we couldn't make it throw.\n\n\n  var name = fn ? fn.displayName || fn.name : '';\n  var syntheticFrame = name ? describeBuiltInComponentFrame(name) : '';\n\n  {\n    if (typeof fn === 'function') {\n      componentFrameCache.set(fn, syntheticFrame);\n    }\n  }\n\n  return syntheticFrame;\n}\n\nfunction describeClassComponentFrame(ctor, source, ownerFn) {\n  {\n    return describeNativeComponentFrame(ctor, true);\n  }\n}\nfunction describeFunctionComponentFrame(fn, source, ownerFn) {\n  {\n    return describeNativeComponentFrame(fn, false);\n  }\n}\n\nfunction shouldConstruct(Component) {\n  var prototype = Component.prototype;\n  return !!(prototype && prototype.isReactComponent);\n}\n\nfunction describeUnknownElementTypeFrameInDEV(type, source, ownerFn) {\n\n  if (type == null) {\n    return '';\n  }\n\n  if (typeof type === 'function') {\n    {\n      return describeNativeComponentFrame(type, shouldConstruct(type));\n    }\n  }\n\n  if (typeof type === 'string') {\n    return describeBuiltInComponentFrame(type);\n  }\n\n  switch (type) {\n    case REACT_SUSPENSE_TYPE:\n      return describeBuiltInComponentFrame('Suspense');\n\n    case REACT_SUSPENSE_LIST_TYPE:\n      return describeBuiltInComponentFrame('SuspenseList');\n  }\n\n  if (typeof type === 'object') {\n    switch (type.$$typeof) {\n      case REACT_FORWARD_REF_TYPE:\n        return describeFunctionComponentFrame(type.render);\n\n      case REACT_MEMO_TYPE:\n        // Memo may contain any component type so we recursively resolve it.\n        return describeUnknownElementTypeFrameInDEV(type.type, source, ownerFn);\n\n      case REACT_LAZY_TYPE:\n        {\n          var lazyComponent = type;\n          var payload = lazyComponent._payload;\n          var init = lazyComponent._init;\n\n          try {\n            // Lazy may contain any component type so we recursively resolve it.\n            return describeUnknownElementTypeFrameInDEV(init(payload), source, ownerFn);\n          } catch (x) {}\n        }\n    }\n  }\n\n  return '';\n}\n\nfunction describeFiber(fiber) {\n  var owner =  fiber._debugOwner ? fiber._debugOwner.type : null ;\n  var source =  fiber._debugSource ;\n\n  switch (fiber.tag) {\n    case HostComponent:\n      return describeBuiltInComponentFrame(fiber.type);\n\n    case LazyComponent:\n      return describeBuiltInComponentFrame('Lazy');\n\n    case SuspenseComponent:\n      return describeBuiltInComponentFrame('Suspense');\n\n    case SuspenseListComponent:\n      return describeBuiltInComponentFrame('SuspenseList');\n\n    case FunctionComponent:\n    case IndeterminateComponent:\n    case SimpleMemoComponent:\n      return describeFunctionComponentFrame(fiber.type);\n\n    case ForwardRef:\n      return describeFunctionComponentFrame(fiber.type.render);\n\n    case ClassComponent:\n      return describeClassComponentFrame(fiber.type);\n\n    default:\n      return '';\n  }\n}\n\nfunction getStackByFiberInDevAndProd(workInProgress) {\n  try {\n    var info = '';\n    var node = workInProgress;\n\n    do {\n      info += describeFiber(node);\n      node = node.return;\n    } while (node);\n\n    return info;\n  } catch (x) {\n    return '\\nError generating stack: ' + x.message + '\\n' + x.stack;\n  }\n}\n\nfunction getWrappedName(outerType, innerType, wrapperName) {\n  var displayName = outerType.displayName;\n\n  if (displayName) {\n    return displayName;\n  }\n\n  var functionName = innerType.displayName || innerType.name || '';\n  return functionName !== '' ? wrapperName + \"(\" + functionName + \")\" : wrapperName;\n} // Keep in sync with react-reconciler/getComponentNameFromFiber\n\n\nfunction getContextName(type) {\n  return type.displayName || 'Context';\n} // Note that the reconciler package should generally prefer to use getComponentNameFromFiber() instead.\n\n\nfunction getComponentNameFromType(type) {\n  if (type == null) {\n    // Host root, text node or just invalid type.\n    return null;\n  }\n\n  {\n    if (typeof type.tag === 'number') {\n      error('Received an unexpected object in getComponentNameFromType(). ' + 'This is likely a bug in React. Please file an issue.');\n    }\n  }\n\n  if (typeof type === 'function') {\n    return type.displayName || type.name || null;\n  }\n\n  if (typeof type === 'string') {\n    return type;\n  }\n\n  switch (type) {\n    case REACT_FRAGMENT_TYPE:\n      return 'Fragment';\n\n    case REACT_PORTAL_TYPE:\n      return 'Portal';\n\n    case REACT_PROFILER_TYPE:\n      return 'Profiler';\n\n    case REACT_STRICT_MODE_TYPE:\n      return 'StrictMode';\n\n    case REACT_SUSPENSE_TYPE:\n      return 'Suspense';\n\n    case REACT_SUSPENSE_LIST_TYPE:\n      return 'SuspenseList';\n\n  }\n\n  if (typeof type === 'object') {\n    switch (type.$$typeof) {\n      case REACT_CONTEXT_TYPE:\n        var context = type;\n        return getContextName(context) + '.Consumer';\n\n      case REACT_PROVIDER_TYPE:\n        var provider = type;\n        return getContextName(provider._context) + '.Provider';\n\n      case REACT_FORWARD_REF_TYPE:\n        return getWrappedName(type, type.render, 'ForwardRef');\n\n      case REACT_MEMO_TYPE:\n        var outerName = type.displayName || null;\n\n        if (outerName !== null) {\n          return outerName;\n        }\n\n        return getComponentNameFromType(type.type) || 'Memo';\n\n      case REACT_LAZY_TYPE:\n        {\n          var lazyComponent = type;\n          var payload = lazyComponent._payload;\n          var init = lazyComponent._init;\n\n          try {\n            return getComponentNameFromType(init(payload));\n          } catch (x) {\n            return null;\n          }\n        }\n\n      // eslint-disable-next-line no-fallthrough\n    }\n  }\n\n  return null;\n}\n\nfunction getWrappedName$1(outerType, innerType, wrapperName) {\n  var functionName = innerType.displayName || innerType.name || '';\n  return outerType.displayName || (functionName !== '' ? wrapperName + \"(\" + functionName + \")\" : wrapperName);\n} // Keep in sync with shared/getComponentNameFromType\n\n\nfunction getContextName$1(type) {\n  return type.displayName || 'Context';\n}\n\nfunction getComponentNameFromFiber(fiber) {\n  var tag = fiber.tag,\n      type = fiber.type;\n\n  switch (tag) {\n    case CacheComponent:\n      return 'Cache';\n\n    case ContextConsumer:\n      var context = type;\n      return getContextName$1(context) + '.Consumer';\n\n    case ContextProvider:\n      var provider = type;\n      return getContextName$1(provider._context) + '.Provider';\n\n    case DehydratedFragment:\n      return 'DehydratedFragment';\n\n    case ForwardRef:\n      return getWrappedName$1(type, type.render, 'ForwardRef');\n\n    case Fragment:\n      return 'Fragment';\n\n    case HostComponent:\n      // Host component type is the display name (e.g. \"div\", \"View\")\n      return type;\n\n    case HostPortal:\n      return 'Portal';\n\n    case HostRoot:\n      return 'Root';\n\n    case HostText:\n      return 'Text';\n\n    case LazyComponent:\n      // Name comes from the type in this case; we don't have a tag.\n      return getComponentNameFromType(type);\n\n    case Mode:\n      if (type === REACT_STRICT_MODE_TYPE) {\n        // Don't be less specific than shared/getComponentNameFromType\n        return 'StrictMode';\n      }\n\n      return 'Mode';\n\n    case OffscreenComponent:\n      return 'Offscreen';\n\n    case Profiler:\n      return 'Profiler';\n\n    case ScopeComponent:\n      return 'Scope';\n\n    case SuspenseComponent:\n      return 'Suspense';\n\n    case SuspenseListComponent:\n      return 'SuspenseList';\n\n    case TracingMarkerComponent:\n      return 'TracingMarker';\n    // The display name for this tags come from the user-provided type:\n\n    case ClassComponent:\n    case FunctionComponent:\n    case IncompleteClassComponent:\n    case IndeterminateComponent:\n    case MemoComponent:\n    case SimpleMemoComponent:\n      if (typeof type === 'function') {\n        return type.displayName || type.name || null;\n      }\n\n      if (typeof type === 'string') {\n        return type;\n      }\n\n      break;\n\n  }\n\n  return null;\n}\n\nvar ReactDebugCurrentFrame = ReactSharedInternals.ReactDebugCurrentFrame;\nvar current = null;\nvar isRendering = false;\nfunction getCurrentFiberOwnerNameInDevOrNull() {\n  {\n    if (current === null) {\n      return null;\n    }\n\n    var owner = current._debugOwner;\n\n    if (owner !== null && typeof owner !== 'undefined') {\n      return getComponentNameFromFiber(owner);\n    }\n  }\n\n  return null;\n}\n\nfunction getCurrentFiberStackInDev() {\n  {\n    if (current === null) {\n      return '';\n    } // Safe because if current fiber exists, we are reconciling,\n    // and it is guaranteed to be the work-in-progress version.\n\n\n    return getStackByFiberInDevAndProd(current);\n  }\n}\n\nfunction resetCurrentFiber() {\n  {\n    ReactDebugCurrentFrame.getCurrentStack = null;\n    current = null;\n    isRendering = false;\n  }\n}\nfunction setCurrentFiber(fiber) {\n  {\n    ReactDebugCurrentFrame.getCurrentStack = fiber === null ? null : getCurrentFiberStackInDev;\n    current = fiber;\n    isRendering = false;\n  }\n}\nfunction getCurrentFiber() {\n  {\n    return current;\n  }\n}\nfunction setIsRendering(rendering) {\n  {\n    isRendering = rendering;\n  }\n}\n\n// Flow does not allow string concatenation of most non-string types. To work\n// around this limitation, we use an opaque type that can only be obtained by\n// passing the value through getToStringValue first.\nfunction toString(value) {\n  // The coercion safety check is performed in getToStringValue().\n  // eslint-disable-next-line react-internal/safe-string-coercion\n  return '' + value;\n}\nfunction getToStringValue(value) {\n  switch (typeof value) {\n    case 'boolean':\n    case 'number':\n    case 'string':\n    case 'undefined':\n      return value;\n\n    case 'object':\n      {\n        checkFormFieldValueStringCoercion(value);\n      }\n\n      return value;\n\n    default:\n      // function, symbol are assigned as empty strings\n      return '';\n  }\n}\n\nvar hasReadOnlyValue = {\n  button: true,\n  checkbox: true,\n  image: true,\n  hidden: true,\n  radio: true,\n  reset: true,\n  submit: true\n};\nfunction checkControlledValueProps(tagName, props) {\n  {\n    if (!(hasReadOnlyValue[props.type] || props.onChange || props.onInput || props.readOnly || props.disabled || props.value == null)) {\n      error('You provided a `value` prop to a form field without an ' + '`onChange` handler. This will render a read-only field. If ' + 'the field should be mutable use `defaultValue`. Otherwise, ' + 'set either `onChange` or `readOnly`.');\n    }\n\n    if (!(props.onChange || props.readOnly || props.disabled || props.checked == null)) {\n      error('You provided a `checked` prop to a form field without an ' + '`onChange` handler. This will render a read-only field. If ' + 'the field should be mutable use `defaultChecked`. Otherwise, ' + 'set either `onChange` or `readOnly`.');\n    }\n  }\n}\n\nfunction isCheckable(elem) {\n  var type = elem.type;\n  var nodeName = elem.nodeName;\n  return nodeName && nodeName.toLowerCase() === 'input' && (type === 'checkbox' || type === 'radio');\n}\n\nfunction getTracker(node) {\n  return node._valueTracker;\n}\n\nfunction detachTracker(node) {\n  node._valueTracker = null;\n}\n\nfunction getValueFromNode(node) {\n  var value = '';\n\n  if (!node) {\n    return value;\n  }\n\n  if (isCheckable(node)) {\n    value = node.checked ? 'true' : 'false';\n  } else {\n    value = node.value;\n  }\n\n  return value;\n}\n\nfunction trackValueOnNode(node) {\n  var valueField = isCheckable(node) ? 'checked' : 'value';\n  var descriptor = Object.getOwnPropertyDescriptor(node.constructor.prototype, valueField);\n\n  {\n    checkFormFieldValueStringCoercion(node[valueField]);\n  }\n\n  var currentValue = '' + node[valueField]; // if someone has already defined a value or Safari, then bail\n  // and don't track value will cause over reporting of changes,\n  // but it's better then a hard failure\n  // (needed for certain tests that spyOn input values and Safari)\n\n  if (node.hasOwnProperty(valueField) || typeof descriptor === 'undefined' || typeof descriptor.get !== 'function' || typeof descriptor.set !== 'function') {\n    return;\n  }\n\n  var get = descriptor.get,\n      set = descriptor.set;\n  Object.defineProperty(node, valueField, {\n    configurable: true,\n    get: function () {\n      return get.call(this);\n    },\n    set: function (value) {\n      {\n        checkFormFieldValueStringCoercion(value);\n      }\n\n      currentValue = '' + value;\n      set.call(this, value);\n    }\n  }); // We could've passed this the first time\n  // but it triggers a bug in IE11 and Edge 14/15.\n  // Calling defineProperty() again should be equivalent.\n  // https://github.com/facebook/react/issues/11768\n\n  Object.defineProperty(node, valueField, {\n    enumerable: descriptor.enumerable\n  });\n  var tracker = {\n    getValue: function () {\n      return currentValue;\n    },\n    setValue: function (value) {\n      {\n        checkFormFieldValueStringCoercion(value);\n      }\n\n      currentValue = '' + value;\n    },\n    stopTracking: function () {\n      detachTracker(node);\n      delete node[valueField];\n    }\n  };\n  return tracker;\n}\n\nfunction track(node) {\n  if (getTracker(node)) {\n    return;\n  } // TODO: Once it's just Fiber we can move this to node._wrapperState\n\n\n  node._valueTracker = trackValueOnNode(node);\n}\nfunction updateValueIfChanged(node) {\n  if (!node) {\n    return false;\n  }\n\n  var tracker = getTracker(node); // if there is no tracker at this point it's unlikely\n  // that trying again will succeed\n\n  if (!tracker) {\n    return true;\n  }\n\n  var lastValue = tracker.getValue();\n  var nextValue = getValueFromNode(node);\n\n  if (nextValue !== lastValue) {\n    tracker.setValue(nextValue);\n    return true;\n  }\n\n  return false;\n}\n\nfunction getActiveElement(doc) {\n  doc = doc || (typeof document !== 'undefined' ? document : undefined);\n\n  if (typeof doc === 'undefined') {\n    return null;\n  }\n\n  try {\n    return doc.activeElement || doc.body;\n  } catch (e) {\n    return doc.body;\n  }\n}\n\nvar didWarnValueDefaultValue = false;\nvar didWarnCheckedDefaultChecked = false;\nvar didWarnControlledToUncontrolled = false;\nvar didWarnUncontrolledToControlled = false;\n\nfunction isControlled(props) {\n  var usesChecked = props.type === 'checkbox' || props.type === 'radio';\n  return usesChecked ? props.checked != null : props.value != null;\n}\n/**\n * Implements an <input> host component that allows setting these optional\n * props: `checked`, `value`, `defaultChecked`, and `defaultValue`.\n *\n * If `checked` or `value` are not supplied (or null/undefined), user actions\n * that affect the checked state or value will trigger updates to the element.\n *\n * If they are supplied (and not null/undefined), the rendered element will not\n * trigger updates to the element. Instead, the props must change in order for\n * the rendered element to be updated.\n *\n * The rendered element will be initialized as unchecked (or `defaultChecked`)\n * with an empty value (or `defaultValue`).\n *\n * See http://www.w3.org/TR/2012/WD-html5-20121025/the-input-element.html\n */\n\n\nfunction getHostProps(element, props) {\n  var node = element;\n  var checked = props.checked;\n  var hostProps = assign({}, props, {\n    defaultChecked: undefined,\n    defaultValue: undefined,\n    value: undefined,\n    checked: checked != null ? checked : node._wrapperState.initialChecked\n  });\n  return hostProps;\n}\nfunction initWrapperState(element, props) {\n  {\n    checkControlledValueProps('input', props);\n\n    if (props.checked !== undefined && props.defaultChecked !== undefined && !didWarnCheckedDefaultChecked) {\n      error('%s contains an input of type %s with both checked and defaultChecked props. ' + 'Input elements must be either controlled or uncontrolled ' + '(specify either the checked prop, or the defaultChecked prop, but not ' + 'both). Decide between using a controlled or uncontrolled input ' + 'element and remove one of these props. More info: ' + 'https://reactjs.org/link/controlled-components', getCurrentFiberOwnerNameInDevOrNull() || 'A component', props.type);\n\n      didWarnCheckedDefaultChecked = true;\n    }\n\n    if (props.value !== undefined && props.defaultValue !== undefined && !didWarnValueDefaultValue) {\n      error('%s contains an input of type %s with both value and defaultValue props. ' + 'Input elements must be either controlled or uncontrolled ' + '(specify either the value prop, or the defaultValue prop, but not ' + 'both). Decide between using a controlled or uncontrolled input ' + 'element and remove one of these props. More info: ' + 'https://reactjs.org/link/controlled-components', getCurrentFiberOwnerNameInDevOrNull() || 'A component', props.type);\n\n      didWarnValueDefaultValue = true;\n    }\n  }\n\n  var node = element;\n  var defaultValue = props.defaultValue == null ? '' : props.defaultValue;\n  node._wrapperState = {\n    initialChecked: props.checked != null ? props.checked : props.defaultChecked,\n    initialValue: getToStringValue(props.value != null ? props.value : defaultValue),\n    controlled: isControlled(props)\n  };\n}\nfunction updateChecked(element, props) {\n  var node = element;\n  var checked = props.checked;\n\n  if (checked != null) {\n    setValueForProperty(node, 'checked', checked, false);\n  }\n}\nfunction updateWrapper(element, props) {\n  var node = element;\n\n  {\n    var controlled = isControlled(props);\n\n    if (!node._wrapperState.controlled && controlled && !didWarnUncontrolledToControlled) {\n      error('A component is changing an uncontrolled input to be controlled. ' + 'This is likely caused by the value changing from undefined to ' + 'a defined value, which should not happen. ' + 'Decide between using a controlled or uncontrolled input ' + 'element for the lifetime of the component. More info: https://reactjs.org/link/controlled-components');\n\n      didWarnUncontrolledToControlled = true;\n    }\n\n    if (node._wrapperState.controlled && !controlled && !didWarnControlledToUncontrolled) {\n      error('A component is changing a controlled input to be uncontrolled. ' + 'This is likely caused by the value changing from a defined to ' + 'undefined, which should not happen. ' + 'Decide between using a controlled or uncontrolled input ' + 'element for the lifetime of the component. More info: https://reactjs.org/link/controlled-components');\n\n      didWarnControlledToUncontrolled = true;\n    }\n  }\n\n  updateChecked(element, props);\n  var value = getToStringValue(props.value);\n  var type = props.type;\n\n  if (value != null) {\n    if (type === 'number') {\n      if (value === 0 && node.value === '' || // We explicitly want to coerce to number here if possible.\n      // eslint-disable-next-line\n      node.value != value) {\n        node.value = toString(value);\n      }\n    } else if (node.value !== toString(value)) {\n      node.value = toString(value);\n    }\n  } else if (type === 'submit' || type === 'reset') {\n    // Submit/reset inputs need the attribute removed completely to avoid\n    // blank-text buttons.\n    node.removeAttribute('value');\n    return;\n  }\n\n  {\n    // When syncing the value attribute, the value comes from a cascade of\n    // properties:\n    //  1. The value React property\n    //  2. The defaultValue React property\n    //  3. Otherwise there should be no change\n    if (props.hasOwnProperty('value')) {\n      setDefaultValue(node, props.type, value);\n    } else if (props.hasOwnProperty('defaultValue')) {\n      setDefaultValue(node, props.type, getToStringValue(props.defaultValue));\n    }\n  }\n\n  {\n    // When syncing the checked attribute, it only changes when it needs\n    // to be removed, such as transitioning from a checkbox into a text input\n    if (props.checked == null && props.defaultChecked != null) {\n      node.defaultChecked = !!props.defaultChecked;\n    }\n  }\n}\nfunction postMountWrapper(element, props, isHydrating) {\n  var node = element; // Do not assign value if it is already set. This prevents user text input\n  // from being lost during SSR hydration.\n\n  if (props.hasOwnProperty('value') || props.hasOwnProperty('defaultValue')) {\n    var type = props.type;\n    var isButton = type === 'submit' || type === 'reset'; // Avoid setting value attribute on submit/reset inputs as it overrides the\n    // default value provided by the browser. See: #12872\n\n    if (isButton && (props.value === undefined || props.value === null)) {\n      return;\n    }\n\n    var initialValue = toString(node._wrapperState.initialValue); // Do not assign value if it is already set. This prevents user text input\n    // from being lost during SSR hydration.\n\n    if (!isHydrating) {\n      {\n        // When syncing the value attribute, the value property should use\n        // the wrapperState._initialValue property. This uses:\n        //\n        //   1. The value React property when present\n        //   2. The defaultValue React property when present\n        //   3. An empty string\n        if (initialValue !== node.value) {\n          node.value = initialValue;\n        }\n      }\n    }\n\n    {\n      // Otherwise, the value attribute is synchronized to the property,\n      // so we assign defaultValue to the same thing as the value property\n      // assignment step above.\n      node.defaultValue = initialValue;\n    }\n  } // Normally, we'd just do `node.checked = node.checked` upon initial mount, less this bug\n  // this is needed to work around a chrome bug where setting defaultChecked\n  // will sometimes influence the value of checked (even after detachment).\n  // Reference: https://bugs.chromium.org/p/chromium/issues/detail?id=608416\n  // We need to temporarily unset name to avoid disrupting radio button groups.\n\n\n  var name = node.name;\n\n  if (name !== '') {\n    node.name = '';\n  }\n\n  {\n    // When syncing the checked attribute, both the checked property and\n    // attribute are assigned at the same time using defaultChecked. This uses:\n    //\n    //   1. The checked React property when present\n    //   2. The defaultChecked React property when present\n    //   3. Otherwise, false\n    node.defaultChecked = !node.defaultChecked;\n    node.defaultChecked = !!node._wrapperState.initialChecked;\n  }\n\n  if (name !== '') {\n    node.name = name;\n  }\n}\nfunction restoreControlledState(element, props) {\n  var node = element;\n  updateWrapper(node, props);\n  updateNamedCousins(node, props);\n}\n\nfunction updateNamedCousins(rootNode, props) {\n  var name = props.name;\n\n  if (props.type === 'radio' && name != null) {\n    var queryRoot = rootNode;\n\n    while (queryRoot.parentNode) {\n      queryRoot = queryRoot.parentNode;\n    } // If `rootNode.form` was non-null, then we could try `form.elements`,\n    // but that sometimes behaves strangely in IE8. We could also try using\n    // `form.getElementsByName`, but that will only return direct children\n    // and won't include inputs that use the HTML5 `form=` attribute. Since\n    // the input might not even be in a form. It might not even be in the\n    // document. Let's just use the local `querySelectorAll` to ensure we don't\n    // miss anything.\n\n\n    {\n      checkAttributeStringCoercion(name, 'name');\n    }\n\n    var group = queryRoot.querySelectorAll('input[name=' + JSON.stringify('' + name) + '][type=\"radio\"]');\n\n    for (var i = 0; i < group.length; i++) {\n      var otherNode = group[i];\n\n      if (otherNode === rootNode || otherNode.form !== rootNode.form) {\n        continue;\n      } // This will throw if radio buttons rendered by different copies of React\n      // and the same name are rendered into the same form (same as #1939).\n      // That's probably okay; we don't support it just as we don't support\n      // mixing React radio buttons with non-React ones.\n\n\n      var otherProps = getFiberCurrentPropsFromNode(otherNode);\n\n      if (!otherProps) {\n        throw new Error('ReactDOMInput: Mixing React and non-React radio inputs with the ' + 'same `name` is not supported.');\n      } // We need update the tracked value on the named cousin since the value\n      // was changed but the input saw no event or value set\n\n\n      updateValueIfChanged(otherNode); // If this is a controlled radio button group, forcing the input that\n      // was previously checked to update will cause it to be come re-checked\n      // as appropriate.\n\n      updateWrapper(otherNode, otherProps);\n    }\n  }\n} // In Chrome, assigning defaultValue to certain input types triggers input validation.\n// For number inputs, the display value loses trailing decimal points. For email inputs,\n// Chrome raises \"The specified value <x> is not a valid email address\".\n//\n// Here we check to see if the defaultValue has actually changed, avoiding these problems\n// when the user is inputting text\n//\n// https://github.com/facebook/react/issues/7253\n\n\nfunction setDefaultValue(node, type, value) {\n  if ( // Focused number inputs synchronize on blur. See ChangeEventPlugin.js\n  type !== 'number' || getActiveElement(node.ownerDocument) !== node) {\n    if (value == null) {\n      node.defaultValue = toString(node._wrapperState.initialValue);\n    } else if (node.defaultValue !== toString(value)) {\n      node.defaultValue = toString(value);\n    }\n  }\n}\n\nvar didWarnSelectedSetOnOption = false;\nvar didWarnInvalidChild = false;\nvar didWarnInvalidInnerHTML = false;\n/**\n * Implements an <option> host component that warns when `selected` is set.\n */\n\nfunction validateProps(element, props) {\n  {\n    // If a value is not provided, then the children must be simple.\n    if (props.value == null) {\n      if (typeof props.children === 'object' && props.children !== null) {\n        React.Children.forEach(props.children, function (child) {\n          if (child == null) {\n            return;\n          }\n\n          if (typeof child === 'string' || typeof child === 'number') {\n            return;\n          }\n\n          if (!didWarnInvalidChild) {\n            didWarnInvalidChild = true;\n\n            error('Cannot infer the option value of complex children. ' + 'Pass a `value` prop or use a plain string as children to <option>.');\n          }\n        });\n      } else if (props.dangerouslySetInnerHTML != null) {\n        if (!didWarnInvalidInnerHTML) {\n          didWarnInvalidInnerHTML = true;\n\n          error('Pass a `value` prop if you set dangerouslyInnerHTML so React knows ' + 'which value should be selected.');\n        }\n      }\n    } // TODO: Remove support for `selected` in <option>.\n\n\n    if (props.selected != null && !didWarnSelectedSetOnOption) {\n      error('Use the `defaultValue` or `value` props on <select> instead of ' + 'setting `selected` on <option>.');\n\n      didWarnSelectedSetOnOption = true;\n    }\n  }\n}\nfunction postMountWrapper$1(element, props) {\n  // value=\"\" should make a value attribute (#6219)\n  if (props.value != null) {\n    element.setAttribute('value', toString(getToStringValue(props.value)));\n  }\n}\n\nvar isArrayImpl = Array.isArray; // eslint-disable-next-line no-redeclare\n\nfunction isArray(a) {\n  return isArrayImpl(a);\n}\n\nvar didWarnValueDefaultValue$1;\n\n{\n  didWarnValueDefaultValue$1 = false;\n}\n\nfunction getDeclarationErrorAddendum() {\n  var ownerName = getCurrentFiberOwnerNameInDevOrNull();\n\n  if (ownerName) {\n    return '\\n\\nCheck the render method of `' + ownerName + '`.';\n  }\n\n  return '';\n}\n\nvar valuePropNames = ['value', 'defaultValue'];\n/**\n * Validation function for `value` and `defaultValue`.\n */\n\nfunction checkSelectPropTypes(props) {\n  {\n    checkControlledValueProps('select', props);\n\n    for (var i = 0; i < valuePropNames.length; i++) {\n      var propName = valuePropNames[i];\n\n      if (props[propName] == null) {\n        continue;\n      }\n\n      var propNameIsArray = isArray(props[propName]);\n\n      if (props.multiple && !propNameIsArray) {\n        error('The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum());\n      } else if (!props.multiple && propNameIsArray) {\n        error('The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum());\n      }\n    }\n  }\n}\n\nfunction updateOptions(node, multiple, propValue, setDefaultSelected) {\n  var options = node.options;\n\n  if (multiple) {\n    var selectedValues = propValue;\n    var selectedValue = {};\n\n    for (var i = 0; i < selectedValues.length; i++) {\n      // Prefix to avoid chaos with special keys.\n      selectedValue['$' + selectedValues[i]] = true;\n    }\n\n    for (var _i = 0; _i < options.length; _i++) {\n      var selected = selectedValue.hasOwnProperty('$' + options[_i].value);\n\n      if (options[_i].selected !== selected) {\n        options[_i].selected = selected;\n      }\n\n      if (selected && setDefaultSelected) {\n        options[_i].defaultSelected = true;\n      }\n    }\n  } else {\n    // Do not set `select.value` as exact behavior isn't consistent across all\n    // browsers for all cases.\n    var _selectedValue = toString(getToStringValue(propValue));\n\n    var defaultSelected = null;\n\n    for (var _i2 = 0; _i2 < options.length; _i2++) {\n      if (options[_i2].value === _selectedValue) {\n        options[_i2].selected = true;\n\n        if (setDefaultSelected) {\n          options[_i2].defaultSelected = true;\n        }\n\n        return;\n      }\n\n      if (defaultSelected === null && !options[_i2].disabled) {\n        defaultSelected = options[_i2];\n      }\n    }\n\n    if (defaultSelected !== null) {\n      defaultSelected.selected = true;\n    }\n  }\n}\n/**\n * Implements a <select> host component that allows optionally setting the\n * props `value` and `defaultValue`. If `multiple` is false, the prop must be a\n * stringable. If `multiple` is true, the prop must be an array of stringables.\n *\n * If `value` is not supplied (or null/undefined), user actions that change the\n * selected option will trigger updates to the rendered options.\n *\n * If it is supplied (and not null/undefined), the rendered options will not\n * update in response to user actions. Instead, the `value` prop must change in\n * order for the rendered options to update.\n *\n * If `defaultValue` is provided, any options with the supplied values will be\n * selected.\n */\n\n\nfunction getHostProps$1(element, props) {\n  return assign({}, props, {\n    value: undefined\n  });\n}\nfunction initWrapperState$1(element, props) {\n  var node = element;\n\n  {\n    checkSelectPropTypes(props);\n  }\n\n  node._wrapperState = {\n    wasMultiple: !!props.multiple\n  };\n\n  {\n    if (props.value !== undefined && props.defaultValue !== undefined && !didWarnValueDefaultValue$1) {\n      error('Select elements must be either controlled or uncontrolled ' + '(specify either the value prop, or the defaultValue prop, but not ' + 'both). Decide between using a controlled or uncontrolled select ' + 'element and remove one of these props. More info: ' + 'https://reactjs.org/link/controlled-components');\n\n      didWarnValueDefaultValue$1 = true;\n    }\n  }\n}\nfunction postMountWrapper$2(element, props) {\n  var node = element;\n  node.multiple = !!props.multiple;\n  var value = props.value;\n\n  if (value != null) {\n    updateOptions(node, !!props.multiple, value, false);\n  } else if (props.defaultValue != null) {\n    updateOptions(node, !!props.multiple, props.defaultValue, true);\n  }\n}\nfunction postUpdateWrapper(element, props) {\n  var node = element;\n  var wasMultiple = node._wrapperState.wasMultiple;\n  node._wrapperState.wasMultiple = !!props.multiple;\n  var value = props.value;\n\n  if (value != null) {\n    updateOptions(node, !!props.multiple, value, false);\n  } else if (wasMultiple !== !!props.multiple) {\n    // For simplicity, reapply `defaultValue` if `multiple` is toggled.\n    if (props.defaultValue != null) {\n      updateOptions(node, !!props.multiple, props.defaultValue, true);\n    } else {\n      // Revert the select back to its default unselected state.\n      updateOptions(node, !!props.multiple, props.multiple ? [] : '', false);\n    }\n  }\n}\nfunction restoreControlledState$1(element, props) {\n  var node = element;\n  var value = props.value;\n\n  if (value != null) {\n    updateOptions(node, !!props.multiple, value, false);\n  }\n}\n\nvar didWarnValDefaultVal = false;\n\n/**\n * Implements a <textarea> host component that allows setting `value`, and\n * `defaultValue`. This differs from the traditional DOM API because value is\n * usually set as PCDATA children.\n *\n * If `value` is not supplied (or null/undefined), user actions that affect the\n * value will trigger updates to the element.\n *\n * If `value` is supplied (and not null/undefined), the rendered element will\n * not trigger updates to the element. Instead, the `value` prop must change in\n * order for the rendered element to be updated.\n *\n * The rendered element will be initialized with an empty value, the prop\n * `defaultValue` if specified, or the children content (deprecated).\n */\nfunction getHostProps$2(element, props) {\n  var node = element;\n\n  if (props.dangerouslySetInnerHTML != null) {\n    throw new Error('`dangerouslySetInnerHTML` does not make sense on <textarea>.');\n  } // Always set children to the same thing. In IE9, the selection range will\n  // get reset if `textContent` is mutated.  We could add a check in setTextContent\n  // to only set the value if/when the value differs from the node value (which would\n  // completely solve this IE9 bug), but Sebastian+Sophie seemed to like this\n  // solution. The value can be a boolean or object so that's why it's forced\n  // to be a string.\n\n\n  var hostProps = assign({}, props, {\n    value: undefined,\n    defaultValue: undefined,\n    children: toString(node._wrapperState.initialValue)\n  });\n\n  return hostProps;\n}\nfunction initWrapperState$2(element, props) {\n  var node = element;\n\n  {\n    checkControlledValueProps('textarea', props);\n\n    if (props.value !== undefined && props.defaultValue !== undefined && !didWarnValDefaultVal) {\n      error('%s contains a textarea with both value and defaultValue props. ' + 'Textarea elements must be either controlled or uncontrolled ' + '(specify either the value prop, or the defaultValue prop, but not ' + 'both). Decide between using a controlled or uncontrolled textarea ' + 'and remove one of these props. More info: ' + 'https://reactjs.org/link/controlled-components', getCurrentFiberOwnerNameInDevOrNull() || 'A component');\n\n      didWarnValDefaultVal = true;\n    }\n  }\n\n  var initialValue = props.value; // Only bother fetching default value if we're going to use it\n\n  if (initialValue == null) {\n    var children = props.children,\n        defaultValue = props.defaultValue;\n\n    if (children != null) {\n      {\n        error('Use the `defaultValue` or `value` props instead of setting ' + 'children on <textarea>.');\n      }\n\n      {\n        if (defaultValue != null) {\n          throw new Error('If you supply `defaultValue` on a <textarea>, do not pass children.');\n        }\n\n        if (isArray(children)) {\n          if (children.length > 1) {\n            throw new Error('<textarea> can only have at most one child.');\n          }\n\n          children = children[0];\n        }\n\n        defaultValue = children;\n      }\n    }\n\n    if (defaultValue == null) {\n      defaultValue = '';\n    }\n\n    initialValue = defaultValue;\n  }\n\n  node._wrapperState = {\n    initialValue: getToStringValue(initialValue)\n  };\n}\nfunction updateWrapper$1(element, props) {\n  var node = element;\n  var value = getToStringValue(props.value);\n  var defaultValue = getToStringValue(props.defaultValue);\n\n  if (value != null) {\n    // Cast `value` to a string to ensure the value is set correctly. While\n    // browsers typically do this as necessary, jsdom doesn't.\n    var newValue = toString(value); // To avoid side effects (such as losing text selection), only set value if changed\n\n    if (newValue !== node.value) {\n      node.value = newValue;\n    }\n\n    if (props.defaultValue == null && node.defaultValue !== newValue) {\n      node.defaultValue = newValue;\n    }\n  }\n\n  if (defaultValue != null) {\n    node.defaultValue = toString(defaultValue);\n  }\n}\nfunction postMountWrapper$3(element, props) {\n  var node = element; // This is in postMount because we need access to the DOM node, which is not\n  // available until after the component has mounted.\n\n  var textContent = node.textContent; // Only set node.value if textContent is equal to the expected\n  // initial value. In IE10/IE11 there is a bug where the placeholder attribute\n  // will populate textContent as well.\n  // https://developer.microsoft.com/microsoft-edge/platform/issues/101525/\n\n  if (textContent === node._wrapperState.initialValue) {\n    if (textContent !== '' && textContent !== null) {\n      node.value = textContent;\n    }\n  }\n}\nfunction restoreControlledState$2(element, props) {\n  // DOM component is still mounted; update\n  updateWrapper$1(element, props);\n}\n\nvar HTML_NAMESPACE = 'http://www.w3.org/1999/xhtml';\nvar MATH_NAMESPACE = 'http://www.w3.org/1998/Math/MathML';\nvar SVG_NAMESPACE = 'http://www.w3.org/2000/svg'; // Assumes there is no parent namespace.\n\nfunction getIntrinsicNamespace(type) {\n  switch (type) {\n    case 'svg':\n      return SVG_NAMESPACE;\n\n    case 'math':\n      return MATH_NAMESPACE;\n\n    default:\n      return HTML_NAMESPACE;\n  }\n}\nfunction getChildNamespace(parentNamespace, type) {\n  if (parentNamespace == null || parentNamespace === HTML_NAMESPACE) {\n    // No (or default) parent namespace: potential entry point.\n    return getIntrinsicNamespace(type);\n  }\n\n  if (parentNamespace === SVG_NAMESPACE && type === 'foreignObject') {\n    // We're leaving SVG.\n    return HTML_NAMESPACE;\n  } // By default, pass namespace below.\n\n\n  return parentNamespace;\n}\n\n/* globals MSApp */\n\n/**\n * Create a function which has 'unsafe' privileges (required by windows8 apps)\n */\nvar createMicrosoftUnsafeLocalFunction = function (func) {\n  if (typeof MSApp !== 'undefined' && MSApp.execUnsafeLocalFunction) {\n    return function (arg0, arg1, arg2, arg3) {\n      MSApp.execUnsafeLocalFunction(function () {\n        return func(arg0, arg1, arg2, arg3);\n      });\n    };\n  } else {\n    return func;\n  }\n};\n\nvar reusableSVGContainer;\n/**\n * Set the innerHTML property of a node\n *\n * @param {DOMElement} node\n * @param {string} html\n * @internal\n */\n\nvar setInnerHTML = createMicrosoftUnsafeLocalFunction(function (node, html) {\n  if (node.namespaceURI === SVG_NAMESPACE) {\n\n    if (!('innerHTML' in node)) {\n      // IE does not have innerHTML for SVG nodes, so instead we inject the\n      // new markup in a temp node and then move the child nodes across into\n      // the target node\n      reusableSVGContainer = reusableSVGContainer || document.createElement('div');\n      reusableSVGContainer.innerHTML = '<svg>' + html.valueOf().toString() + '</svg>';\n      var svgNode = reusableSVGContainer.firstChild;\n\n      while (node.firstChild) {\n        node.removeChild(node.firstChild);\n      }\n\n      while (svgNode.firstChild) {\n        node.appendChild(svgNode.firstChild);\n      }\n\n      return;\n    }\n  }\n\n  node.innerHTML = html;\n});\n\n/**\n * HTML nodeType values that represent the type of the node\n */\nvar ELEMENT_NODE = 1;\nvar TEXT_NODE = 3;\nvar COMMENT_NODE = 8;\nvar DOCUMENT_NODE = 9;\nvar DOCUMENT_FRAGMENT_NODE = 11;\n\n/**\n * Set the textContent property of a node. For text updates, it's faster\n * to set the `nodeValue` of the Text node directly instead of using\n * `.textContent` which will remove the existing node and create a new one.\n *\n * @param {DOMElement} node\n * @param {string} text\n * @internal\n */\n\nvar setTextContent = function (node, text) {\n  if (text) {\n    var firstChild = node.firstChild;\n\n    if (firstChild && firstChild === node.lastChild && firstChild.nodeType === TEXT_NODE) {\n      firstChild.nodeValue = text;\n      return;\n    }\n  }\n\n  node.textContent = text;\n};\n\n// List derived from Gecko source code:\n// https://github.com/mozilla/gecko-dev/blob/4e638efc71/layout/style/test/property_database.js\nvar shorthandToLonghand = {\n  animation: ['animationDelay', 'animationDirection', 'animationDuration', 'animationFillMode', 'animationIterationCount', 'animationName', 'animationPlayState', 'animationTimingFunction'],\n  background: ['backgroundAttachment', 'backgroundClip', 'backgroundColor', 'backgroundImage', 'backgroundOrigin', 'backgroundPositionX', 'backgroundPositionY', 'backgroundRepeat', 'backgroundSize'],\n  backgroundPosition: ['backgroundPositionX', 'backgroundPositionY'],\n  border: ['borderBottomColor', 'borderBottomStyle', 'borderBottomWidth', 'borderImageOutset', 'borderImageRepeat', 'borderImageSlice', 'borderImageSource', 'borderImageWidth', 'borderLeftColor', 'borderLeftStyle', 'borderLeftWidth', 'borderRightColor', 'borderRightStyle', 'borderRightWidth', 'borderTopColor', 'borderTopStyle', 'borderTopWidth'],\n  borderBlockEnd: ['borderBlockEndColor', 'borderBlockEndStyle', 'borderBlockEndWidth'],\n  borderBlockStart: ['borderBlockStartColor', 'borderBlockStartStyle', 'borderBlockStartWidth'],\n  borderBottom: ['borderBottomColor', 'borderBottomStyle', 'borderBottomWidth'],\n  borderColor: ['borderBottomColor', 'borderLeftColor', 'borderRightColor', 'borderTopColor'],\n  borderImage: ['borderImageOutset', 'borderImageRepeat', 'borderImageSlice', 'borderImageSource', 'borderImageWidth'],\n  borderInlineEnd: ['borderInlineEndColor', 'borderInlineEndStyle', 'borderInlineEndWidth'],\n  borderInlineStart: ['borderInlineStartColor', 'borderInlineStartStyle', 'borderInlineStartWidth'],\n  borderLeft: ['borderLeftColor', 'borderLeftStyle', 'borderLeftWidth'],\n  borderRadius: ['borderBottomLeftRadius', 'borderBottomRightRadius', 'borderTopLeftRadius', 'borderTopRightRadius'],\n  borderRight: ['borderRightColor', 'borderRightStyle', 'borderRightWidth'],\n  borderStyle: ['borderBottomStyle', 'borderLeftStyle', 'borderRightStyle', 'borderTopStyle'],\n  borderTop: ['borderTopColor', 'borderTopStyle', 'borderTopWidth'],\n  borderWidth: ['borderBottomWidth', 'borderLeftWidth', 'borderRightWidth', 'borderTopWidth'],\n  columnRule: ['columnRuleColor', 'columnRuleStyle', 'columnRuleWidth'],\n  columns: ['columnCount', 'columnWidth'],\n  flex: ['flexBasis', 'flexGrow', 'flexShrink'],\n  flexFlow: ['flexDirection', 'flexWrap'],\n  font: ['fontFamily', 'fontFeatureSettings', 'fontKerning', 'fontLanguageOverride', 'fontSize', 'fontSizeAdjust', 'fontStretch', 'fontStyle', 'fontVariant', 'fontVariantAlternates', 'fontVariantCaps', 'fontVariantEastAsian', 'fontVariantLigatures', 'fontVariantNumeric', 'fontVariantPosition', 'fontWeight', 'lineHeight'],\n  fontVariant: ['fontVariantAlternates', 'fontVariantCaps', 'fontVariantEastAsian', 'fontVariantLigatures', 'fontVariantNumeric', 'fontVariantPosition'],\n  gap: ['columnGap', 'rowGap'],\n  grid: ['gridAutoColumns', 'gridAutoFlow', 'gridAutoRows', 'gridTemplateAreas', 'gridTemplateColumns', 'gridTemplateRows'],\n  gridArea: ['gridColumnEnd', 'gridColumnStart', 'gridRowEnd', 'gridRowStart'],\n  gridColumn: ['gridColumnEnd', 'gridColumnStart'],\n  gridColumnGap: ['columnGap'],\n  gridGap: ['columnGap', 'rowGap'],\n  gridRow: ['gridRowEnd', 'gridRowStart'],\n  gridRowGap: ['rowGap'],\n  gridTemplate: ['gridTemplateAreas', 'gridTemplateColumns', 'gridTemplateRows'],\n  listStyle: ['listStyleImage', 'listStylePosition', 'listStyleType'],\n  margin: ['marginBottom', 'marginLeft', 'marginRight', 'marginTop'],\n  marker: ['markerEnd', 'markerMid', 'markerStart'],\n  mask: ['maskClip', 'maskComposite', 'maskImage', 'maskMode', 'maskOrigin', 'maskPositionX', 'maskPositionY', 'maskRepeat', 'maskSize'],\n  maskPosition: ['maskPositionX', 'maskPositionY'],\n  outline: ['outlineColor', 'outlineStyle', 'outlineWidth'],\n  overflow: ['overflowX', 'overflowY'],\n  padding: ['paddingBottom', 'paddingLeft', 'paddingRight', 'paddingTop'],\n  placeContent: ['alignContent', 'justifyContent'],\n  placeItems: ['alignItems', 'justifyItems'],\n  placeSelf: ['alignSelf', 'justifySelf'],\n  textDecoration: ['textDecorationColor', 'textDecorationLine', 'textDecorationStyle'],\n  textEmphasis: ['textEmphasisColor', 'textEmphasisStyle'],\n  transition: ['transitionDelay', 'transitionDuration', 'transitionProperty', 'transitionTimingFunction'],\n  wordWrap: ['overflowWrap']\n};\n\n/**\n * CSS properties which accept numbers but are not in units of \"px\".\n */\nvar isUnitlessNumber = {\n  animationIterationCount: true,\n  aspectRatio: true,\n  borderImageOutset: true,\n  borderImageSlice: true,\n  borderImageWidth: true,\n  boxFlex: true,\n  boxFlexGroup: true,\n  boxOrdinalGroup: true,\n  columnCount: true,\n  columns: true,\n  flex: true,\n  flexGrow: true,\n  flexPositive: true,\n  flexShrink: true,\n  flexNegative: true,\n  flexOrder: true,\n  gridArea: true,\n  gridRow: true,\n  gridRowEnd: true,\n  gridRowSpan: true,\n  gridRowStart: true,\n  gridColumn: true,\n  gridColumnEnd: true,\n  gridColumnSpan: true,\n  gridColumnStart: true,\n  fontWeight: true,\n  lineClamp: true,\n  lineHeight: true,\n  opacity: true,\n  order: true,\n  orphans: true,\n  tabSize: true,\n  widows: true,\n  zIndex: true,\n  zoom: true,\n  // SVG-related properties\n  fillOpacity: true,\n  floodOpacity: true,\n  stopOpacity: true,\n  strokeDasharray: true,\n  strokeDashoffset: true,\n  strokeMiterlimit: true,\n  strokeOpacity: true,\n  strokeWidth: true\n};\n/**\n * @param {string} prefix vendor-specific prefix, eg: Webkit\n * @param {string} key style name, eg: transitionDuration\n * @return {string} style name prefixed with `prefix`, properly camelCased, eg:\n * WebkitTransitionDuration\n */\n\nfunction prefixKey(prefix, key) {\n  return prefix + key.charAt(0).toUpperCase() + key.substring(1);\n}\n/**\n * Support style names that may come passed in prefixed by adding permutations\n * of vendor prefixes.\n */\n\n\nvar prefixes = ['Webkit', 'ms', 'Moz', 'O']; // Using Object.keys here, or else the vanilla for-in loop makes IE8 go into an\n// infinite loop, because it iterates over the newly added props too.\n\nObject.keys(isUnitlessNumber).forEach(function (prop) {\n  prefixes.forEach(function (prefix) {\n    isUnitlessNumber[prefixKey(prefix, prop)] = isUnitlessNumber[prop];\n  });\n});\n\n/**\n * Convert a value into the proper css writable value. The style name `name`\n * should be logical (no hyphens), as specified\n * in `CSSProperty.isUnitlessNumber`.\n *\n * @param {string} name CSS property name such as `topMargin`.\n * @param {*} value CSS property value such as `10px`.\n * @return {string} Normalized style value with dimensions applied.\n */\n\nfunction dangerousStyleValue(name, value, isCustomProperty) {\n  // Note that we've removed escapeTextForBrowser() calls here since the\n  // whole string will be escaped when the attribute is injected into\n  // the markup. If you provide unsafe user data here they can inject\n  // arbitrary CSS which may be problematic (I couldn't repro this):\n  // https://www.owasp.org/index.php/XSS_Filter_Evasion_Cheat_Sheet\n  // http://www.thespanner.co.uk/2007/11/26/ultimate-xss-css-injection/\n  // This is not an XSS hole but instead a potential CSS injection issue\n  // which has lead to a greater discussion about how we're going to\n  // trust URLs moving forward. See #2115901\n  var isEmpty = value == null || typeof value === 'boolean' || value === '';\n\n  if (isEmpty) {\n    return '';\n  }\n\n  if (!isCustomProperty && typeof value === 'number' && value !== 0 && !(isUnitlessNumber.hasOwnProperty(name) && isUnitlessNumber[name])) {\n    return value + 'px'; // Presumes implicit 'px' suffix for unitless numbers\n  }\n\n  {\n    checkCSSPropertyStringCoercion(value, name);\n  }\n\n  return ('' + value).trim();\n}\n\nvar uppercasePattern = /([A-Z])/g;\nvar msPattern = /^ms-/;\n/**\n * Hyphenates a camelcased CSS property name, for example:\n *\n *   > hyphenateStyleName('backgroundColor')\n *   < \"background-color\"\n *   > hyphenateStyleName('MozTransition')\n *   < \"-moz-transition\"\n *   > hyphenateStyleName('msTransition')\n *   < \"-ms-transition\"\n *\n * As Modernizr suggests (http://modernizr.com/docs/#prefixed), an `ms` prefix\n * is converted to `-ms-`.\n */\n\nfunction hyphenateStyleName(name) {\n  return name.replace(uppercasePattern, '-$1').toLowerCase().replace(msPattern, '-ms-');\n}\n\nvar warnValidStyle = function () {};\n\n{\n  // 'msTransform' is correct, but the other prefixes should be capitalized\n  var badVendoredStyleNamePattern = /^(?:webkit|moz|o)[A-Z]/;\n  var msPattern$1 = /^-ms-/;\n  var hyphenPattern = /-(.)/g; // style values shouldn't contain a semicolon\n\n  var badStyleValueWithSemicolonPattern = /;\\s*$/;\n  var warnedStyleNames = {};\n  var warnedStyleValues = {};\n  var warnedForNaNValue = false;\n  var warnedForInfinityValue = false;\n\n  var camelize = function (string) {\n    return string.replace(hyphenPattern, function (_, character) {\n      return character.toUpperCase();\n    });\n  };\n\n  var warnHyphenatedStyleName = function (name) {\n    if (warnedStyleNames.hasOwnProperty(name) && warnedStyleNames[name]) {\n      return;\n    }\n\n    warnedStyleNames[name] = true;\n\n    error('Unsupported style property %s. Did you mean %s?', name, // As Andi Smith suggests\n    // (http://www.andismith.com/blog/2012/02/modernizr-prefixed/), an `-ms` prefix\n    // is converted to lowercase `ms`.\n    camelize(name.replace(msPattern$1, 'ms-')));\n  };\n\n  var warnBadVendoredStyleName = function (name) {\n    if (warnedStyleNames.hasOwnProperty(name) && warnedStyleNames[name]) {\n      return;\n    }\n\n    warnedStyleNames[name] = true;\n\n    error('Unsupported vendor-prefixed style property %s. Did you mean %s?', name, name.charAt(0).toUpperCase() + name.slice(1));\n  };\n\n  var warnStyleValueWithSemicolon = function (name, value) {\n    if (warnedStyleValues.hasOwnProperty(value) && warnedStyleValues[value]) {\n      return;\n    }\n\n    warnedStyleValues[value] = true;\n\n    error(\"Style property values shouldn't contain a semicolon. \" + 'Try \"%s: %s\" instead.', name, value.replace(badStyleValueWithSemicolonPattern, ''));\n  };\n\n  var warnStyleValueIsNaN = function (name, value) {\n    if (warnedForNaNValue) {\n      return;\n    }\n\n    warnedForNaNValue = true;\n\n    error('`NaN` is an invalid value for the `%s` css style property.', name);\n  };\n\n  var warnStyleValueIsInfinity = function (name, value) {\n    if (warnedForInfinityValue) {\n      return;\n    }\n\n    warnedForInfinityValue = true;\n\n    error('`Infinity` is an invalid value for the `%s` css style property.', name);\n  };\n\n  warnValidStyle = function (name, value) {\n    if (name.indexOf('-') > -1) {\n      warnHyphenatedStyleName(name);\n    } else if (badVendoredStyleNamePattern.test(name)) {\n      warnBadVendoredStyleName(name);\n    } else if (badStyleValueWithSemicolonPattern.test(value)) {\n      warnStyleValueWithSemicolon(name, value);\n    }\n\n    if (typeof value === 'number') {\n      if (isNaN(value)) {\n        warnStyleValueIsNaN(name, value);\n      } else if (!isFinite(value)) {\n        warnStyleValueIsInfinity(name, value);\n      }\n    }\n  };\n}\n\nvar warnValidStyle$1 = warnValidStyle;\n\n/**\n * Operations for dealing with CSS properties.\n */\n\n/**\n * This creates a string that is expected to be equivalent to the style\n * attribute generated by server-side rendering. It by-passes warnings and\n * security checks so it's not safe to use this value for anything other than\n * comparison. It is only used in DEV for SSR validation.\n */\n\nfunction createDangerousStringForStyles(styles) {\n  {\n    var serialized = '';\n    var delimiter = '';\n\n    for (var styleName in styles) {\n      if (!styles.hasOwnProperty(styleName)) {\n        continue;\n      }\n\n      var styleValue = styles[styleName];\n\n      if (styleValue != null) {\n        var isCustomProperty = styleName.indexOf('--') === 0;\n        serialized += delimiter + (isCustomProperty ? styleName : hyphenateStyleName(styleName)) + ':';\n        serialized += dangerousStyleValue(styleName, styleValue, isCustomProperty);\n        delimiter = ';';\n      }\n    }\n\n    return serialized || null;\n  }\n}\n/**\n * Sets the value for multiple styles on a node.  If a value is specified as\n * '' (empty string), the corresponding style property will be unset.\n *\n * @param {DOMElement} node\n * @param {object} styles\n */\n\nfunction setValueForStyles(node, styles) {\n  var style = node.style;\n\n  for (var styleName in styles) {\n    if (!styles.hasOwnProperty(styleName)) {\n      continue;\n    }\n\n    var isCustomProperty = styleName.indexOf('--') === 0;\n\n    {\n      if (!isCustomProperty) {\n        warnValidStyle$1(styleName, styles[styleName]);\n      }\n    }\n\n    var styleValue = dangerousStyleValue(styleName, styles[styleName], isCustomProperty);\n\n    if (styleName === 'float') {\n      styleName = 'cssFloat';\n    }\n\n    if (isCustomProperty) {\n      style.setProperty(styleName, styleValue);\n    } else {\n      style[styleName] = styleValue;\n    }\n  }\n}\n\nfunction isValueEmpty(value) {\n  return value == null || typeof value === 'boolean' || value === '';\n}\n/**\n * Given {color: 'red', overflow: 'hidden'} returns {\n *   color: 'color',\n *   overflowX: 'overflow',\n *   overflowY: 'overflow',\n * }. This can be read as \"the overflowY property was set by the overflow\n * shorthand\". That is, the values are the property that each was derived from.\n */\n\n\nfunction expandShorthandMap(styles) {\n  var expanded = {};\n\n  for (var key in styles) {\n    var longhands = shorthandToLonghand[key] || [key];\n\n    for (var i = 0; i < longhands.length; i++) {\n      expanded[longhands[i]] = key;\n    }\n  }\n\n  return expanded;\n}\n/**\n * When mixing shorthand and longhand property names, we warn during updates if\n * we expect an incorrect result to occur. In particular, we warn for:\n *\n * Updating a shorthand property (longhand gets overwritten):\n *   {font: 'foo', fontVariant: 'bar'} -> {font: 'baz', fontVariant: 'bar'}\n *   becomes .style.font = 'baz'\n * Removing a shorthand property (longhand gets lost too):\n *   {font: 'foo', fontVariant: 'bar'} -> {fontVariant: 'bar'}\n *   becomes .style.font = ''\n * Removing a longhand property (should revert to shorthand; doesn't):\n *   {font: 'foo', fontVariant: 'bar'} -> {font: 'foo'}\n *   becomes .style.fontVariant = ''\n */\n\n\nfunction validateShorthandPropertyCollisionInDev(styleUpdates, nextStyles) {\n  {\n    if (!nextStyles) {\n      return;\n    }\n\n    var expandedUpdates = expandShorthandMap(styleUpdates);\n    var expandedStyles = expandShorthandMap(nextStyles);\n    var warnedAbout = {};\n\n    for (var key in expandedUpdates) {\n      var originalKey = expandedUpdates[key];\n      var correctOriginalKey = expandedStyles[key];\n\n      if (correctOriginalKey && originalKey !== correctOriginalKey) {\n        var warningKey = originalKey + ',' + correctOriginalKey;\n\n        if (warnedAbout[warningKey]) {\n          continue;\n        }\n\n        warnedAbout[warningKey] = true;\n\n        error('%s a style property during rerender (%s) when a ' + 'conflicting property is set (%s) can lead to styling bugs. To ' + \"avoid this, don't mix shorthand and non-shorthand properties \" + 'for the same value; instead, replace the shorthand with ' + 'separate values.', isValueEmpty(styleUpdates[originalKey]) ? 'Removing' : 'Updating', originalKey, correctOriginalKey);\n      }\n    }\n  }\n}\n\n// For HTML, certain tags should omit their close tag. We keep a list for\n// those special-case tags.\nvar omittedCloseTags = {\n  area: true,\n  base: true,\n  br: true,\n  col: true,\n  embed: true,\n  hr: true,\n  img: true,\n  input: true,\n  keygen: true,\n  link: true,\n  meta: true,\n  param: true,\n  source: true,\n  track: true,\n  wbr: true // NOTE: menuitem's close tag should be omitted, but that causes problems.\n\n};\n\n// `omittedCloseTags` except that `menuitem` should still have its closing tag.\n\nvar voidElementTags = assign({\n  menuitem: true\n}, omittedCloseTags);\n\nvar HTML = '__html';\n\nfunction assertValidProps(tag, props) {\n  if (!props) {\n    return;\n  } // Note the use of `==` which checks for null or undefined.\n\n\n  if (voidElementTags[tag]) {\n    if (props.children != null || props.dangerouslySetInnerHTML != null) {\n      throw new Error(tag + \" is a void element tag and must neither have `children` nor \" + 'use `dangerouslySetInnerHTML`.');\n    }\n  }\n\n  if (props.dangerouslySetInnerHTML != null) {\n    if (props.children != null) {\n      throw new Error('Can only set one of `children` or `props.dangerouslySetInnerHTML`.');\n    }\n\n    if (typeof props.dangerouslySetInnerHTML !== 'object' || !(HTML in props.dangerouslySetInnerHTML)) {\n      throw new Error('`props.dangerouslySetInnerHTML` must be in the form `{__html: ...}`. ' + 'Please visit https://reactjs.org/link/dangerously-set-inner-html ' + 'for more information.');\n    }\n  }\n\n  {\n    if (!props.suppressContentEditableWarning && props.contentEditable && props.children != null) {\n      error('A component is `contentEditable` and contains `children` managed by ' + 'React. It is now your responsibility to guarantee that none of ' + 'those nodes are unexpectedly modified or duplicated. This is ' + 'probably not intentional.');\n    }\n  }\n\n  if (props.style != null && typeof props.style !== 'object') {\n    throw new Error('The `style` prop expects a mapping from style properties to values, ' + \"not a string. For example, style={{marginRight: spacing + 'em'}} when \" + 'using JSX.');\n  }\n}\n\nfunction isCustomComponent(tagName, props) {\n  if (tagName.indexOf('-') === -1) {\n    return typeof props.is === 'string';\n  }\n\n  switch (tagName) {\n    // These are reserved SVG and MathML elements.\n    // We don't mind this list too much because we expect it to never grow.\n    // The alternative is to track the namespace in a few places which is convoluted.\n    // https://w3c.github.io/webcomponents/spec/custom/#custom-elements-core-concepts\n    case 'annotation-xml':\n    case 'color-profile':\n    case 'font-face':\n    case 'font-face-src':\n    case 'font-face-uri':\n    case 'font-face-format':\n    case 'font-face-name':\n    case 'missing-glyph':\n      return false;\n\n    default:\n      return true;\n  }\n}\n\n// When adding attributes to the HTML or SVG allowed attribute list, be sure to\n// also add them to this module to ensure casing and incorrect name\n// warnings.\nvar possibleStandardNames = {\n  // HTML\n  accept: 'accept',\n  acceptcharset: 'acceptCharset',\n  'accept-charset': 'acceptCharset',\n  accesskey: 'accessKey',\n  action: 'action',\n  allowfullscreen: 'allowFullScreen',\n  alt: 'alt',\n  as: 'as',\n  async: 'async',\n  autocapitalize: 'autoCapitalize',\n  autocomplete: 'autoComplete',\n  autocorrect: 'autoCorrect',\n  autofocus: 'autoFocus',\n  autoplay: 'autoPlay',\n  autosave: 'autoSave',\n  capture: 'capture',\n  cellpadding: 'cellPadding',\n  cellspacing: 'cellSpacing',\n  challenge: 'challenge',\n  charset: 'charSet',\n  checked: 'checked',\n  children: 'children',\n  cite: 'cite',\n  class: 'className',\n  classid: 'classID',\n  classname: 'className',\n  cols: 'cols',\n  colspan: 'colSpan',\n  content: 'content',\n  contenteditable: 'contentEditable',\n  contextmenu: 'contextMenu',\n  controls: 'controls',\n  controlslist: 'controlsList',\n  coords: 'coords',\n  crossorigin: 'crossOrigin',\n  dangerouslysetinnerhtml: 'dangerouslySetInnerHTML',\n  data: 'data',\n  datetime: 'dateTime',\n  default: 'default',\n  defaultchecked: 'defaultChecked',\n  defaultvalue: 'defaultValue',\n  defer: 'defer',\n  dir: 'dir',\n  disabled: 'disabled',\n  disablepictureinpicture: 'disablePictureInPicture',\n  disableremoteplayback: 'disableRemotePlayback',\n  download: 'download',\n  draggable: 'draggable',\n  enctype: 'encType',\n  enterkeyhint: 'enterKeyHint',\n  for: 'htmlFor',\n  form: 'form',\n  formmethod: 'formMethod',\n  formaction: 'formAction',\n  formenctype: 'formEncType',\n  formnovalidate: 'formNoValidate',\n  formtarget: 'formTarget',\n  frameborder: 'frameBorder',\n  headers: 'headers',\n  height: 'height',\n  hidden: 'hidden',\n  high: 'high',\n  href: 'href',\n  hreflang: 'hrefLang',\n  htmlfor: 'htmlFor',\n  httpequiv: 'httpEquiv',\n  'http-equiv': 'httpEquiv',\n  icon: 'icon',\n  id: 'id',\n  imagesizes: 'imageSizes',\n  imagesrcset: 'imageSrcSet',\n  innerhtml: 'innerHTML',\n  inputmode: 'inputMode',\n  integrity: 'integrity',\n  is: 'is',\n  itemid: 'itemID',\n  itemprop: 'itemProp',\n  itemref: 'itemRef',\n  itemscope: 'itemScope',\n  itemtype: 'itemType',\n  keyparams: 'keyParams',\n  keytype: 'keyType',\n  kind: 'kind',\n  label: 'label',\n  lang: 'lang',\n  list: 'list',\n  loop: 'loop',\n  low: 'low',\n  manifest: 'manifest',\n  marginwidth: 'marginWidth',\n  marginheight: 'marginHeight',\n  max: 'max',\n  maxlength: 'maxLength',\n  media: 'media',\n  mediagroup: 'mediaGroup',\n  method: 'method',\n  min: 'min',\n  minlength: 'minLength',\n  multiple: 'multiple',\n  muted: 'muted',\n  name: 'name',\n  nomodule: 'noModule',\n  nonce: 'nonce',\n  novalidate: 'noValidate',\n  open: 'open',\n  optimum: 'optimum',\n  pattern: 'pattern',\n  placeholder: 'placeholder',\n  playsinline: 'playsInline',\n  poster: 'poster',\n  preload: 'preload',\n  profile: 'profile',\n  radiogroup: 'radioGroup',\n  readonly: 'readOnly',\n  referrerpolicy: 'referrerPolicy',\n  rel: 'rel',\n  required: 'required',\n  reversed: 'reversed',\n  role: 'role',\n  rows: 'rows',\n  rowspan: 'rowSpan',\n  sandbox: 'sandbox',\n  scope: 'scope',\n  scoped: 'scoped',\n  scrolling: 'scrolling',\n  seamless: 'seamless',\n  selected: 'selected',\n  shape: 'shape',\n  size: 'size',\n  sizes: 'sizes',\n  span: 'span',\n  spellcheck: 'spellCheck',\n  src: 'src',\n  srcdoc: 'srcDoc',\n  srclang: 'srcLang',\n  srcset: 'srcSet',\n  start: 'start',\n  step: 'step',\n  style: 'style',\n  summary: 'summary',\n  tabindex: 'tabIndex',\n  target: 'target',\n  title: 'title',\n  type: 'type',\n  usemap: 'useMap',\n  value: 'value',\n  width: 'width',\n  wmode: 'wmode',\n  wrap: 'wrap',\n  // SVG\n  about: 'about',\n  accentheight: 'accentHeight',\n  'accent-height': 'accentHeight',\n  accumulate: 'accumulate',\n  additive: 'additive',\n  alignmentbaseline: 'alignmentBaseline',\n  'alignment-baseline': 'alignmentBaseline',\n  allowreorder: 'allowReorder',\n  alphabetic: 'alphabetic',\n  amplitude: 'amplitude',\n  arabicform: 'arabicForm',\n  'arabic-form': 'arabicForm',\n  ascent: 'ascent',\n  attributename: 'attributeName',\n  attributetype: 'attributeType',\n  autoreverse: 'autoReverse',\n  azimuth: 'azimuth',\n  basefrequency: 'baseFrequency',\n  baselineshift: 'baselineShift',\n  'baseline-shift': 'baselineShift',\n  baseprofile: 'baseProfile',\n  bbox: 'bbox',\n  begin: 'begin',\n  bias: 'bias',\n  by: 'by',\n  calcmode: 'calcMode',\n  capheight: 'capHeight',\n  'cap-height': 'capHeight',\n  clip: 'clip',\n  clippath: 'clipPath',\n  'clip-path': 'clipPath',\n  clippathunits: 'clipPathUnits',\n  cliprule: 'clipRule',\n  'clip-rule': 'clipRule',\n  color: 'color',\n  colorinterpolation: 'colorInterpolation',\n  'color-interpolation': 'colorInterpolation',\n  colorinterpolationfilters: 'colorInterpolationFilters',\n  'color-interpolation-filters': 'colorInterpolationFilters',\n  colorprofile: 'colorProfile',\n  'color-profile': 'colorProfile',\n  colorrendering: 'colorRendering',\n  'color-rendering': 'colorRendering',\n  contentscripttype: 'contentScriptType',\n  contentstyletype: 'contentStyleType',\n  cursor: 'cursor',\n  cx: 'cx',\n  cy: 'cy',\n  d: 'd',\n  datatype: 'datatype',\n  decelerate: 'decelerate',\n  descent: 'descent',\n  diffuseconstant: 'diffuseConstant',\n  direction: 'direction',\n  display: 'display',\n  divisor: 'divisor',\n  dominantbaseline: 'dominantBaseline',\n  'dominant-baseline': 'dominantBaseline',\n  dur: 'dur',\n  dx: 'dx',\n  dy: 'dy',\n  edgemode: 'edgeMode',\n  elevation: 'elevation',\n  enablebackground: 'enableBackground',\n  'enable-background': 'enableBackground',\n  end: 'end',\n  exponent: 'exponent',\n  externalresourcesrequired: 'externalResourcesRequired',\n  fill: 'fill',\n  fillopacity: 'fillOpacity',\n  'fill-opacity': 'fillOpacity',\n  fillrule: 'fillRule',\n  'fill-rule': 'fillRule',\n  filter: 'filter',\n  filterres: 'filterRes',\n  filterunits: 'filterUnits',\n  floodopacity: 'floodOpacity',\n  'flood-opacity': 'floodOpacity',\n  floodcolor: 'floodColor',\n  'flood-color': 'floodColor',\n  focusable: 'focusable',\n  fontfamily: 'fontFamily',\n  'font-family': 'fontFamily',\n  fontsize: 'fontSize',\n  'font-size': 'fontSize',\n  fontsizeadjust: 'fontSizeAdjust',\n  'font-size-adjust': 'fontSizeAdjust',\n  fontstretch: 'fontStretch',\n  'font-stretch': 'fontStretch',\n  fontstyle: 'fontStyle',\n  'font-style': 'fontStyle',\n  fontvariant: 'fontVariant',\n  'font-variant': 'fontVariant',\n  fontweight: 'fontWeight',\n  'font-weight': 'fontWeight',\n  format: 'format',\n  from: 'from',\n  fx: 'fx',\n  fy: 'fy',\n  g1: 'g1',\n  g2: 'g2',\n  glyphname: 'glyphName',\n  'glyph-name': 'glyphName',\n  glyphorientationhorizontal: 'glyphOrientationHorizontal',\n  'glyph-orientation-horizontal': 'glyphOrientationHorizontal',\n  glyphorientationvertical: 'glyphOrientationVertical',\n  'glyph-orientation-vertical': 'glyphOrientationVertical',\n  glyphref: 'glyphRef',\n  gradienttransform: 'gradientTransform',\n  gradientunits: 'gradientUnits',\n  hanging: 'hanging',\n  horizadvx: 'horizAdvX',\n  'horiz-adv-x': 'horizAdvX',\n  horizoriginx: 'horizOriginX',\n  'horiz-origin-x': 'horizOriginX',\n  ideographic: 'ideographic',\n  imagerendering: 'imageRendering',\n  'image-rendering': 'imageRendering',\n  in2: 'in2',\n  in: 'in',\n  inlist: 'inlist',\n  intercept: 'intercept',\n  k1: 'k1',\n  k2: 'k2',\n  k3: 'k3',\n  k4: 'k4',\n  k: 'k',\n  kernelmatrix: 'kernelMatrix',\n  kernelunitlength: 'kernelUnitLength',\n  kerning: 'kerning',\n  keypoints: 'keyPoints',\n  keysplines: 'keySplines',\n  keytimes: 'keyTimes',\n  lengthadjust: 'lengthAdjust',\n  letterspacing: 'letterSpacing',\n  'letter-spacing': 'letterSpacing',\n  lightingcolor: 'lightingColor',\n  'lighting-color': 'lightingColor',\n  limitingconeangle: 'limitingConeAngle',\n  local: 'local',\n  markerend: 'markerEnd',\n  'marker-end': 'markerEnd',\n  markerheight: 'markerHeight',\n  markermid: 'markerMid',\n  'marker-mid': 'markerMid',\n  markerstart: 'markerStart',\n  'marker-start': 'markerStart',\n  markerunits: 'markerUnits',\n  markerwidth: 'markerWidth',\n  mask: 'mask',\n  maskcontentunits: 'maskContentUnits',\n  maskunits: 'maskUnits',\n  mathematical: 'mathematical',\n  mode: 'mode',\n  numoctaves: 'numOctaves',\n  offset: 'offset',\n  opacity: 'opacity',\n  operator: 'operator',\n  order: 'order',\n  orient: 'orient',\n  orientation: 'orientation',\n  origin: 'origin',\n  overflow: 'overflow',\n  overlineposition: 'overlinePosition',\n  'overline-position': 'overlinePosition',\n  overlinethickness: 'overlineThickness',\n  'overline-thickness': 'overlineThickness',\n  paintorder: 'paintOrder',\n  'paint-order': 'paintOrder',\n  panose1: 'panose1',\n  'panose-1': 'panose1',\n  pathlength: 'pathLength',\n  patterncontentunits: 'patternContentUnits',\n  patterntransform: 'patternTransform',\n  patternunits: 'patternUnits',\n  pointerevents: 'pointerEvents',\n  'pointer-events': 'pointerEvents',\n  points: 'points',\n  pointsatx: 'pointsAtX',\n  pointsaty: 'pointsAtY',\n  pointsatz: 'pointsAtZ',\n  prefix: 'prefix',\n  preservealpha: 'preserveAlpha',\n  preserveaspectratio: 'preserveAspectRatio',\n  primitiveunits: 'primitiveUnits',\n  property: 'property',\n  r: 'r',\n  radius: 'radius',\n  refx: 'refX',\n  refy: 'refY',\n  renderingintent: 'renderingIntent',\n  'rendering-intent': 'renderingIntent',\n  repeatcount: 'repeatCount',\n  repeatdur: 'repeatDur',\n  requiredextensions: 'requiredExtensions',\n  requiredfeatures: 'requiredFeatures',\n  resource: 'resource',\n  restart: 'restart',\n  result: 'result',\n  results: 'results',\n  rotate: 'rotate',\n  rx: 'rx',\n  ry: 'ry',\n  scale: 'scale',\n  security: 'security',\n  seed: 'seed',\n  shaperendering: 'shapeRendering',\n  'shape-rendering': 'shapeRendering',\n  slope: 'slope',\n  spacing: 'spacing',\n  specularconstant: 'specularConstant',\n  specularexponent: 'specularExponent',\n  speed: 'speed',\n  spreadmethod: 'spreadMethod',\n  startoffset: 'startOffset',\n  stddeviation: 'stdDeviation',\n  stemh: 'stemh',\n  stemv: 'stemv',\n  stitchtiles: 'stitchTiles',\n  stopcolor: 'stopColor',\n  'stop-color': 'stopColor',\n  stopopacity: 'stopOpacity',\n  'stop-opacity': 'stopOpacity',\n  strikethroughposition: 'strikethroughPosition',\n  'strikethrough-position': 'strikethroughPosition',\n  strikethroughthickness: 'strikethroughThickness',\n  'strikethrough-thickness': 'strikethroughThickness',\n  string: 'string',\n  stroke: 'stroke',\n  strokedasharray: 'strokeDasharray',\n  'stroke-dasharray': 'strokeDasharray',\n  strokedashoffset: 'strokeDashoffset',\n  'stroke-dashoffset': 'strokeDashoffset',\n  strokelinecap: 'strokeLinecap',\n  'stroke-linecap': 'strokeLinecap',\n  strokelinejoin: 'strokeLinejoin',\n  'stroke-linejoin': 'strokeLinejoin',\n  strokemiterlimit: 'strokeMiterlimit',\n  'stroke-miterlimit': 'strokeMiterlimit',\n  strokewidth: 'strokeWidth',\n  'stroke-width': 'strokeWidth',\n  strokeopacity: 'strokeOpacity',\n  'stroke-opacity': 'strokeOpacity',\n  suppresscontenteditablewarning: 'suppressContentEditableWarning',\n  suppresshydrationwarning: 'suppressHydrationWarning',\n  surfacescale: 'surfaceScale',\n  systemlanguage: 'systemLanguage',\n  tablevalues: 'tableValues',\n  targetx: 'targetX',\n  targety: 'targetY',\n  textanchor: 'textAnchor',\n  'text-anchor': 'textAnchor',\n  textdecoration: 'textDecoration',\n  'text-decoration': 'textDecoration',\n  textlength: 'textLength',\n  textrendering: 'textRendering',\n  'text-rendering': 'textRendering',\n  to: 'to',\n  transform: 'transform',\n  typeof: 'typeof',\n  u1: 'u1',\n  u2: 'u2',\n  underlineposition: 'underlinePosition',\n  'underline-position': 'underlinePosition',\n  underlinethickness: 'underlineThickness',\n  'underline-thickness': 'underlineThickness',\n  unicode: 'unicode',\n  unicodebidi: 'unicodeBidi',\n  'unicode-bidi': 'unicodeBidi',\n  unicoderange: 'unicodeRange',\n  'unicode-range': 'unicodeRange',\n  unitsperem: 'unitsPerEm',\n  'units-per-em': 'unitsPerEm',\n  unselectable: 'unselectable',\n  valphabetic: 'vAlphabetic',\n  'v-alphabetic': 'vAlphabetic',\n  values: 'values',\n  vectoreffect: 'vectorEffect',\n  'vector-effect': 'vectorEffect',\n  version: 'version',\n  vertadvy: 'vertAdvY',\n  'vert-adv-y': 'vertAdvY',\n  vertoriginx: 'vertOriginX',\n  'vert-origin-x': 'vertOriginX',\n  vertoriginy: 'vertOriginY',\n  'vert-origin-y': 'vertOriginY',\n  vhanging: 'vHanging',\n  'v-hanging': 'vHanging',\n  videographic: 'vIdeographic',\n  'v-ideographic': 'vIdeographic',\n  viewbox: 'viewBox',\n  viewtarget: 'viewTarget',\n  visibility: 'visibility',\n  vmathematical: 'vMathematical',\n  'v-mathematical': 'vMathematical',\n  vocab: 'vocab',\n  widths: 'widths',\n  wordspacing: 'wordSpacing',\n  'word-spacing': 'wordSpacing',\n  writingmode: 'writingMode',\n  'writing-mode': 'writingMode',\n  x1: 'x1',\n  x2: 'x2',\n  x: 'x',\n  xchannelselector: 'xChannelSelector',\n  xheight: 'xHeight',\n  'x-height': 'xHeight',\n  xlinkactuate: 'xlinkActuate',\n  'xlink:actuate': 'xlinkActuate',\n  xlinkarcrole: 'xlinkArcrole',\n  'xlink:arcrole': 'xlinkArcrole',\n  xlinkhref: 'xlinkHref',\n  'xlink:href': 'xlinkHref',\n  xlinkrole: 'xlinkRole',\n  'xlink:role': 'xlinkRole',\n  xlinkshow: 'xlinkShow',\n  'xlink:show': 'xlinkShow',\n  xlinktitle: 'xlinkTitle',\n  'xlink:title': 'xlinkTitle',\n  xlinktype: 'xlinkType',\n  'xlink:type': 'xlinkType',\n  xmlbase: 'xmlBase',\n  'xml:base': 'xmlBase',\n  xmllang: 'xmlLang',\n  'xml:lang': 'xmlLang',\n  xmlns: 'xmlns',\n  'xml:space': 'xmlSpace',\n  xmlnsxlink: 'xmlnsXlink',\n  'xmlns:xlink': 'xmlnsXlink',\n  xmlspace: 'xmlSpace',\n  y1: 'y1',\n  y2: 'y2',\n  y: 'y',\n  ychannelselector: 'yChannelSelector',\n  z: 'z',\n  zoomandpan: 'zoomAndPan'\n};\n\nvar ariaProperties = {\n  'aria-current': 0,\n  // state\n  'aria-description': 0,\n  'aria-details': 0,\n  'aria-disabled': 0,\n  // state\n  'aria-hidden': 0,\n  // state\n  'aria-invalid': 0,\n  // state\n  'aria-keyshortcuts': 0,\n  'aria-label': 0,\n  'aria-roledescription': 0,\n  // Widget Attributes\n  'aria-autocomplete': 0,\n  'aria-checked': 0,\n  'aria-expanded': 0,\n  'aria-haspopup': 0,\n  'aria-level': 0,\n  'aria-modal': 0,\n  'aria-multiline': 0,\n  'aria-multiselectable': 0,\n  'aria-orientation': 0,\n  'aria-placeholder': 0,\n  'aria-pressed': 0,\n  'aria-readonly': 0,\n  'aria-required': 0,\n  'aria-selected': 0,\n  'aria-sort': 0,\n  'aria-valuemax': 0,\n  'aria-valuemin': 0,\n  'aria-valuenow': 0,\n  'aria-valuetext': 0,\n  // Live Region Attributes\n  'aria-atomic': 0,\n  'aria-busy': 0,\n  'aria-live': 0,\n  'aria-relevant': 0,\n  // Drag-and-Drop Attributes\n  'aria-dropeffect': 0,\n  'aria-grabbed': 0,\n  // Relationship Attributes\n  'aria-activedescendant': 0,\n  'aria-colcount': 0,\n  'aria-colindex': 0,\n  'aria-colspan': 0,\n  'aria-controls': 0,\n  'aria-describedby': 0,\n  'aria-errormessage': 0,\n  'aria-flowto': 0,\n  'aria-labelledby': 0,\n  'aria-owns': 0,\n  'aria-posinset': 0,\n  'aria-rowcount': 0,\n  'aria-rowindex': 0,\n  'aria-rowspan': 0,\n  'aria-setsize': 0\n};\n\nvar warnedProperties = {};\nvar rARIA = new RegExp('^(aria)-[' + ATTRIBUTE_NAME_CHAR + ']*$');\nvar rARIACamel = new RegExp('^(aria)[A-Z][' + ATTRIBUTE_NAME_CHAR + ']*$');\n\nfunction validateProperty(tagName, name) {\n  {\n    if (hasOwnProperty.call(warnedProperties, name) && warnedProperties[name]) {\n      return true;\n    }\n\n    if (rARIACamel.test(name)) {\n      var ariaName = 'aria-' + name.slice(4).toLowerCase();\n      var correctName = ariaProperties.hasOwnProperty(ariaName) ? ariaName : null; // If this is an aria-* attribute, but is not listed in the known DOM\n      // DOM properties, then it is an invalid aria-* attribute.\n\n      if (correctName == null) {\n        error('Invalid ARIA attribute `%s`. ARIA attributes follow the pattern aria-* and must be lowercase.', name);\n\n        warnedProperties[name] = true;\n        return true;\n      } // aria-* attributes should be lowercase; suggest the lowercase version.\n\n\n      if (name !== correctName) {\n        error('Invalid ARIA attribute `%s`. Did you mean `%s`?', name, correctName);\n\n        warnedProperties[name] = true;\n        return true;\n      }\n    }\n\n    if (rARIA.test(name)) {\n      var lowerCasedName = name.toLowerCase();\n      var standardName = ariaProperties.hasOwnProperty(lowerCasedName) ? lowerCasedName : null; // If this is an aria-* attribute, but is not listed in the known DOM\n      // DOM properties, then it is an invalid aria-* attribute.\n\n      if (standardName == null) {\n        warnedProperties[name] = true;\n        return false;\n      } // aria-* attributes should be lowercase; suggest the lowercase version.\n\n\n      if (name !== standardName) {\n        error('Unknown ARIA attribute `%s`. Did you mean `%s`?', name, standardName);\n\n        warnedProperties[name] = true;\n        return true;\n      }\n    }\n  }\n\n  return true;\n}\n\nfunction warnInvalidARIAProps(type, props) {\n  {\n    var invalidProps = [];\n\n    for (var key in props) {\n      var isValid = validateProperty(type, key);\n\n      if (!isValid) {\n        invalidProps.push(key);\n      }\n    }\n\n    var unknownPropString = invalidProps.map(function (prop) {\n      return '`' + prop + '`';\n    }).join(', ');\n\n    if (invalidProps.length === 1) {\n      error('Invalid aria prop %s on <%s> tag. ' + 'For details, see https://reactjs.org/link/invalid-aria-props', unknownPropString, type);\n    } else if (invalidProps.length > 1) {\n      error('Invalid aria props %s on <%s> tag. ' + 'For details, see https://reactjs.org/link/invalid-aria-props', unknownPropString, type);\n    }\n  }\n}\n\nfunction validateProperties(type, props) {\n  if (isCustomComponent(type, props)) {\n    return;\n  }\n\n  warnInvalidARIAProps(type, props);\n}\n\nvar didWarnValueNull = false;\nfunction validateProperties$1(type, props) {\n  {\n    if (type !== 'input' && type !== 'textarea' && type !== 'select') {\n      return;\n    }\n\n    if (props != null && props.value === null && !didWarnValueNull) {\n      didWarnValueNull = true;\n\n      if (type === 'select' && props.multiple) {\n        error('`value` prop on `%s` should not be null. ' + 'Consider using an empty array when `multiple` is set to `true` ' + 'to clear the component or `undefined` for uncontrolled components.', type);\n      } else {\n        error('`value` prop on `%s` should not be null. ' + 'Consider using an empty string to clear the component or `undefined` ' + 'for uncontrolled components.', type);\n      }\n    }\n  }\n}\n\nvar validateProperty$1 = function () {};\n\n{\n  var warnedProperties$1 = {};\n  var EVENT_NAME_REGEX = /^on./;\n  var INVALID_EVENT_NAME_REGEX = /^on[^A-Z]/;\n  var rARIA$1 = new RegExp('^(aria)-[' + ATTRIBUTE_NAME_CHAR + ']*$');\n  var rARIACamel$1 = new RegExp('^(aria)[A-Z][' + ATTRIBUTE_NAME_CHAR + ']*$');\n\n  validateProperty$1 = function (tagName, name, value, eventRegistry) {\n    if (hasOwnProperty.call(warnedProperties$1, name) && warnedProperties$1[name]) {\n      return true;\n    }\n\n    var lowerCasedName = name.toLowerCase();\n\n    if (lowerCasedName === 'onfocusin' || lowerCasedName === 'onfocusout') {\n      error('React uses onFocus and onBlur instead of onFocusIn and onFocusOut. ' + 'All React events are normalized to bubble, so onFocusIn and onFocusOut ' + 'are not needed/supported by React.');\n\n      warnedProperties$1[name] = true;\n      return true;\n    } // We can't rely on the event system being injected on the server.\n\n\n    if (eventRegistry != null) {\n      var registrationNameDependencies = eventRegistry.registrationNameDependencies,\n          possibleRegistrationNames = eventRegistry.possibleRegistrationNames;\n\n      if (registrationNameDependencies.hasOwnProperty(name)) {\n        return true;\n      }\n\n      var registrationName = possibleRegistrationNames.hasOwnProperty(lowerCasedName) ? possibleRegistrationNames[lowerCasedName] : null;\n\n      if (registrationName != null) {\n        error('Invalid event handler property `%s`. Did you mean `%s`?', name, registrationName);\n\n        warnedProperties$1[name] = true;\n        return true;\n      }\n\n      if (EVENT_NAME_REGEX.test(name)) {\n        error('Unknown event handler property `%s`. It will be ignored.', name);\n\n        warnedProperties$1[name] = true;\n        return true;\n      }\n    } else if (EVENT_NAME_REGEX.test(name)) {\n      // If no event plugins have been injected, we are in a server environment.\n      // So we can't tell if the event name is correct for sure, but we can filter\n      // out known bad ones like `onclick`. We can't suggest a specific replacement though.\n      if (INVALID_EVENT_NAME_REGEX.test(name)) {\n        error('Invalid event handler property `%s`. ' + 'React events use the camelCase naming convention, for example `onClick`.', name);\n      }\n\n      warnedProperties$1[name] = true;\n      return true;\n    } // Let the ARIA attribute hook validate ARIA attributes\n\n\n    if (rARIA$1.test(name) || rARIACamel$1.test(name)) {\n      return true;\n    }\n\n    if (lowerCasedName === 'innerhtml') {\n      error('Directly setting property `innerHTML` is not permitted. ' + 'For more information, lookup documentation on `dangerouslySetInnerHTML`.');\n\n      warnedProperties$1[name] = true;\n      return true;\n    }\n\n    if (lowerCasedName === 'aria') {\n      error('The `aria` attribute is reserved for future use in React. ' + 'Pass individual `aria-` attributes instead.');\n\n      warnedProperties$1[name] = true;\n      return true;\n    }\n\n    if (lowerCasedName === 'is' && value !== null && value !== undefined && typeof value !== 'string') {\n      error('Received a `%s` for a string attribute `is`. If this is expected, cast ' + 'the value to a string.', typeof value);\n\n      warnedProperties$1[name] = true;\n      return true;\n    }\n\n    if (typeof value === 'number' && isNaN(value)) {\n      error('Received NaN for the `%s` attribute. If this is expected, cast ' + 'the value to a string.', name);\n\n      warnedProperties$1[name] = true;\n      return true;\n    }\n\n    var propertyInfo = getPropertyInfo(name);\n    var isReserved = propertyInfo !== null && propertyInfo.type === RESERVED; // Known attributes should match the casing specified in the property config.\n\n    if (possibleStandardNames.hasOwnProperty(lowerCasedName)) {\n      var standardName = possibleStandardNames[lowerCasedName];\n\n      if (standardName !== name) {\n        error('Invalid DOM property `%s`. Did you mean `%s`?', name, standardName);\n\n        warnedProperties$1[name] = true;\n        return true;\n      }\n    } else if (!isReserved && name !== lowerCasedName) {\n      // Unknown attributes should have lowercase casing since that's how they\n      // will be cased anyway with server rendering.\n      error('React does not recognize the `%s` prop on a DOM element. If you ' + 'intentionally want it to appear in the DOM as a custom ' + 'attribute, spell it as lowercase `%s` instead. ' + 'If you accidentally passed it from a parent component, remove ' + 'it from the DOM element.', name, lowerCasedName);\n\n      warnedProperties$1[name] = true;\n      return true;\n    }\n\n    if (typeof value === 'boolean' && shouldRemoveAttributeWithWarning(name, value, propertyInfo, false)) {\n      if (value) {\n        error('Received `%s` for a non-boolean attribute `%s`.\\n\\n' + 'If you want to write it to the DOM, pass a string instead: ' + '%s=\"%s\" or %s={value.toString()}.', value, name, name, value, name);\n      } else {\n        error('Received `%s` for a non-boolean attribute `%s`.\\n\\n' + 'If you want to write it to the DOM, pass a string instead: ' + '%s=\"%s\" or %s={value.toString()}.\\n\\n' + 'If you used to conditionally omit it with %s={condition && value}, ' + 'pass %s={condition ? value : undefined} instead.', value, name, name, value, name, name, name);\n      }\n\n      warnedProperties$1[name] = true;\n      return true;\n    } // Now that we've validated casing, do not validate\n    // data types for reserved props\n\n\n    if (isReserved) {\n      return true;\n    } // Warn when a known attribute is a bad type\n\n\n    if (shouldRemoveAttributeWithWarning(name, value, propertyInfo, false)) {\n      warnedProperties$1[name] = true;\n      return false;\n    } // Warn when passing the strings 'false' or 'true' into a boolean prop\n\n\n    if ((value === 'false' || value === 'true') && propertyInfo !== null && propertyInfo.type === BOOLEAN) {\n      error('Received the string `%s` for the boolean attribute `%s`. ' + '%s ' + 'Did you mean %s={%s}?', value, name, value === 'false' ? 'The browser will interpret it as a truthy value.' : 'Although this works, it will not work as expected if you pass the string \"false\".', name, value);\n\n      warnedProperties$1[name] = true;\n      return true;\n    }\n\n    return true;\n  };\n}\n\nvar warnUnknownProperties = function (type, props, eventRegistry) {\n  {\n    var unknownProps = [];\n\n    for (var key in props) {\n      var isValid = validateProperty$1(type, key, props[key], eventRegistry);\n\n      if (!isValid) {\n        unknownProps.push(key);\n      }\n    }\n\n    var unknownPropString = unknownProps.map(function (prop) {\n      return '`' + prop + '`';\n    }).join(', ');\n\n    if (unknownProps.length === 1) {\n      error('Invalid value for prop %s on <%s> tag. Either remove it from the element, ' + 'or pass a string or number value to keep it in the DOM. ' + 'For details, see https://reactjs.org/link/attribute-behavior ', unknownPropString, type);\n    } else if (unknownProps.length > 1) {\n      error('Invalid values for props %s on <%s> tag. Either remove them from the element, ' + 'or pass a string or number value to keep them in the DOM. ' + 'For details, see https://reactjs.org/link/attribute-behavior ', unknownPropString, type);\n    }\n  }\n};\n\nfunction validateProperties$2(type, props, eventRegistry) {\n  if (isCustomComponent(type, props)) {\n    return;\n  }\n\n  warnUnknownProperties(type, props, eventRegistry);\n}\n\nvar IS_EVENT_HANDLE_NON_MANAGED_NODE = 1;\nvar IS_NON_DELEGATED = 1 << 1;\nvar IS_CAPTURE_PHASE = 1 << 2;\n// set to LEGACY_FB_SUPPORT. LEGACY_FB_SUPPORT only gets set when\n// we call willDeferLaterForLegacyFBSupport, thus not bailing out\n// will result in endless cycles like an infinite loop.\n// We also don't want to defer during event replaying.\n\nvar SHOULD_NOT_PROCESS_POLYFILL_EVENT_PLUGINS = IS_EVENT_HANDLE_NON_MANAGED_NODE | IS_NON_DELEGATED | IS_CAPTURE_PHASE;\n\n// This exists to avoid circular dependency between ReactDOMEventReplaying\n// and DOMPluginEventSystem.\nvar currentReplayingEvent = null;\nfunction setReplayingEvent(event) {\n  {\n    if (currentReplayingEvent !== null) {\n      error('Expected currently replaying event to be null. This error ' + 'is likely caused by a bug in React. Please file an issue.');\n    }\n  }\n\n  currentReplayingEvent = event;\n}\nfunction resetReplayingEvent() {\n  {\n    if (currentReplayingEvent === null) {\n      error('Expected currently replaying event to not be null. This error ' + 'is likely caused by a bug in React. Please file an issue.');\n    }\n  }\n\n  currentReplayingEvent = null;\n}\nfunction isReplayingEvent(event) {\n  return event === currentReplayingEvent;\n}\n\n/**\n * Gets the target node from a native browser event by accounting for\n * inconsistencies in browser DOM APIs.\n *\n * @param {object} nativeEvent Native browser event.\n * @return {DOMEventTarget} Target node.\n */\n\nfunction getEventTarget(nativeEvent) {\n  // Fallback to nativeEvent.srcElement for IE9\n  // https://github.com/facebook/react/issues/12506\n  var target = nativeEvent.target || nativeEvent.srcElement || window; // Normalize SVG <use> element events #4963\n\n  if (target.correspondingUseElement) {\n    target = target.correspondingUseElement;\n  } // Safari may fire events on text nodes (Node.TEXT_NODE is 3).\n  // @see http://www.quirksmode.org/js/events_properties.html\n\n\n  return target.nodeType === TEXT_NODE ? target.parentNode : target;\n}\n\nvar restoreImpl = null;\nvar restoreTarget = null;\nvar restoreQueue = null;\n\nfunction restoreStateOfTarget(target) {\n  // We perform this translation at the end of the event loop so that we\n  // always receive the correct fiber here\n  var internalInstance = getInstanceFromNode(target);\n\n  if (!internalInstance) {\n    // Unmounted\n    return;\n  }\n\n  if (typeof restoreImpl !== 'function') {\n    throw new Error('setRestoreImplementation() needs to be called to handle a target for controlled ' + 'events. This error is likely caused by a bug in React. Please file an issue.');\n  }\n\n  var stateNode = internalInstance.stateNode; // Guard against Fiber being unmounted.\n\n  if (stateNode) {\n    var _props = getFiberCurrentPropsFromNode(stateNode);\n\n    restoreImpl(internalInstance.stateNode, internalInstance.type, _props);\n  }\n}\n\nfunction setRestoreImplementation(impl) {\n  restoreImpl = impl;\n}\nfunction enqueueStateRestore(target) {\n  if (restoreTarget) {\n    if (restoreQueue) {\n      restoreQueue.push(target);\n    } else {\n      restoreQueue = [target];\n    }\n  } else {\n    restoreTarget = target;\n  }\n}\nfunction needsStateRestore() {\n  return restoreTarget !== null || restoreQueue !== null;\n}\nfunction restoreStateIfNeeded() {\n  if (!restoreTarget) {\n    return;\n  }\n\n  var target = restoreTarget;\n  var queuedTargets = restoreQueue;\n  restoreTarget = null;\n  restoreQueue = null;\n  restoreStateOfTarget(target);\n\n  if (queuedTargets) {\n    for (var i = 0; i < queuedTargets.length; i++) {\n      restoreStateOfTarget(queuedTargets[i]);\n    }\n  }\n}\n\n// the renderer. Such as when we're dispatching events or if third party\n// libraries need to call batchedUpdates. Eventually, this API will go away when\n// everything is batched by default. We'll then have a similar API to opt-out of\n// scheduled work and instead do synchronous work.\n// Defaults\n\nvar batchedUpdatesImpl = function (fn, bookkeeping) {\n  return fn(bookkeeping);\n};\n\nvar flushSyncImpl = function () {};\n\nvar isInsideEventHandler = false;\n\nfunction finishEventHandler() {\n  // Here we wait until all updates have propagated, which is important\n  // when using controlled components within layers:\n  // https://github.com/facebook/react/issues/1698\n  // Then we restore state of any controlled component.\n  var controlledComponentsHavePendingUpdates = needsStateRestore();\n\n  if (controlledComponentsHavePendingUpdates) {\n    // If a controlled event was fired, we may need to restore the state of\n    // the DOM node back to the controlled value. This is necessary when React\n    // bails out of the update without touching the DOM.\n    // TODO: Restore state in the microtask, after the discrete updates flush,\n    // instead of early flushing them here.\n    flushSyncImpl();\n    restoreStateIfNeeded();\n  }\n}\n\nfunction batchedUpdates(fn, a, b) {\n  if (isInsideEventHandler) {\n    // If we are currently inside another batch, we need to wait until it\n    // fully completes before restoring state.\n    return fn(a, b);\n  }\n\n  isInsideEventHandler = true;\n\n  try {\n    return batchedUpdatesImpl(fn, a, b);\n  } finally {\n    isInsideEventHandler = false;\n    finishEventHandler();\n  }\n} // TODO: Replace with flushSync\nfunction setBatchingImplementation(_batchedUpdatesImpl, _discreteUpdatesImpl, _flushSyncImpl) {\n  batchedUpdatesImpl = _batchedUpdatesImpl;\n  flushSyncImpl = _flushSyncImpl;\n}\n\nfunction isInteractive(tag) {\n  return tag === 'button' || tag === 'input' || tag === 'select' || tag === 'textarea';\n}\n\nfunction shouldPreventMouseEvent(name, type, props) {\n  switch (name) {\n    case 'onClick':\n    case 'onClickCapture':\n    case 'onDoubleClick':\n    case 'onDoubleClickCapture':\n    case 'onMouseDown':\n    case 'onMouseDownCapture':\n    case 'onMouseMove':\n    case 'onMouseMoveCapture':\n    case 'onMouseUp':\n    case 'onMouseUpCapture':\n    case 'onMouseEnter':\n      return !!(props.disabled && isInteractive(type));\n\n    default:\n      return false;\n  }\n}\n/**\n * @param {object} inst The instance, which is the source of events.\n * @param {string} registrationName Name of listener (e.g. `onClick`).\n * @return {?function} The stored callback.\n */\n\n\nfunction getListener(inst, registrationName) {\n  var stateNode = inst.stateNode;\n\n  if (stateNode === null) {\n    // Work in progress (ex: onload events in incremental mode).\n    return null;\n  }\n\n  var props = getFiberCurrentPropsFromNode(stateNode);\n\n  if (props === null) {\n    // Work in progress.\n    return null;\n  }\n\n  var listener = props[registrationName];\n\n  if (shouldPreventMouseEvent(registrationName, inst.type, props)) {\n    return null;\n  }\n\n  if (listener && typeof listener !== 'function') {\n    throw new Error(\"Expected `\" + registrationName + \"` listener to be a function, instead got a value of `\" + typeof listener + \"` type.\");\n  }\n\n  return listener;\n}\n\nvar passiveBrowserEventsSupported = false; // Check if browser support events with passive listeners\n// https://developer.mozilla.org/en-US/docs/Web/API/EventTarget/addEventListener#Safely_detecting_option_support\n\nif (canUseDOM) {\n  try {\n    var options = {}; // $FlowFixMe: Ignore Flow complaining about needing a value\n\n    Object.defineProperty(options, 'passive', {\n      get: function () {\n        passiveBrowserEventsSupported = true;\n      }\n    });\n    window.addEventListener('test', options, options);\n    window.removeEventListener('test', options, options);\n  } catch (e) {\n    passiveBrowserEventsSupported = false;\n  }\n}\n\nfunction invokeGuardedCallbackProd(name, func, context, a, b, c, d, e, f) {\n  var funcArgs = Array.prototype.slice.call(arguments, 3);\n\n  try {\n    func.apply(context, funcArgs);\n  } catch (error) {\n    this.onError(error);\n  }\n}\n\nvar invokeGuardedCallbackImpl = invokeGuardedCallbackProd;\n\n{\n  // In DEV mode, we swap out invokeGuardedCallback for a special version\n  // that plays more nicely with the browser's DevTools. The idea is to preserve\n  // \"Pause on exceptions\" behavior. Because React wraps all user-provided\n  // functions in invokeGuardedCallback, and the production version of\n  // invokeGuardedCallback uses a try-catch, all user exceptions are treated\n  // like caught exceptions, and the DevTools won't pause unless the developer\n  // takes the extra step of enabling pause on caught exceptions. This is\n  // unintuitive, though, because even though React has caught the error, from\n  // the developer's perspective, the error is uncaught.\n  //\n  // To preserve the expected \"Pause on exceptions\" behavior, we don't use a\n  // try-catch in DEV. Instead, we synchronously dispatch a fake event to a fake\n  // DOM node, and call the user-provided callback from inside an event handler\n  // for that fake event. If the callback throws, the error is \"captured\" using\n  // a global event handler. But because the error happens in a different\n  // event loop context, it does not interrupt the normal program flow.\n  // Effectively, this gives us try-catch behavior without actually using\n  // try-catch. Neat!\n  // Check that the browser supports the APIs we need to implement our special\n  // DEV version of invokeGuardedCallback\n  if (typeof window !== 'undefined' && typeof window.dispatchEvent === 'function' && typeof document !== 'undefined' && typeof document.createEvent === 'function') {\n    var fakeNode = document.createElement('react');\n\n    invokeGuardedCallbackImpl = function invokeGuardedCallbackDev(name, func, context, a, b, c, d, e, f) {\n      // If document doesn't exist we know for sure we will crash in this method\n      // when we call document.createEvent(). However this can cause confusing\n      // errors: https://github.com/facebook/create-react-app/issues/3482\n      // So we preemptively throw with a better message instead.\n      if (typeof document === 'undefined' || document === null) {\n        throw new Error('The `document` global was defined when React was initialized, but is not ' + 'defined anymore. This can happen in a test environment if a component ' + 'schedules an update from an asynchronous callback, but the test has already ' + 'finished running. To solve this, you can either unmount the component at ' + 'the end of your test (and ensure that any asynchronous operations get ' + 'canceled in `componentWillUnmount`), or you can change the test itself ' + 'to be asynchronous.');\n      }\n\n      var evt = document.createEvent('Event');\n      var didCall = false; // Keeps track of whether the user-provided callback threw an error. We\n      // set this to true at the beginning, then set it to false right after\n      // calling the function. If the function errors, `didError` will never be\n      // set to false. This strategy works even if the browser is flaky and\n      // fails to call our global error handler, because it doesn't rely on\n      // the error event at all.\n\n      var didError = true; // Keeps track of the value of window.event so that we can reset it\n      // during the callback to let user code access window.event in the\n      // browsers that support it.\n\n      var windowEvent = window.event; // Keeps track of the descriptor of window.event to restore it after event\n      // dispatching: https://github.com/facebook/react/issues/13688\n\n      var windowEventDescriptor = Object.getOwnPropertyDescriptor(window, 'event');\n\n      function restoreAfterDispatch() {\n        // We immediately remove the callback from event listeners so that\n        // nested `invokeGuardedCallback` calls do not clash. Otherwise, a\n        // nested call would trigger the fake event handlers of any call higher\n        // in the stack.\n        fakeNode.removeEventListener(evtType, callCallback, false); // We check for window.hasOwnProperty('event') to prevent the\n        // window.event assignment in both IE <= 10 as they throw an error\n        // \"Member not found\" in strict mode, and in Firefox which does not\n        // support window.event.\n\n        if (typeof window.event !== 'undefined' && window.hasOwnProperty('event')) {\n          window.event = windowEvent;\n        }\n      } // Create an event handler for our fake event. We will synchronously\n      // dispatch our fake event using `dispatchEvent`. Inside the handler, we\n      // call the user-provided callback.\n\n\n      var funcArgs = Array.prototype.slice.call(arguments, 3);\n\n      function callCallback() {\n        didCall = true;\n        restoreAfterDispatch();\n        func.apply(context, funcArgs);\n        didError = false;\n      } // Create a global error event handler. We use this to capture the value\n      // that was thrown. It's possible that this error handler will fire more\n      // than once; for example, if non-React code also calls `dispatchEvent`\n      // and a handler for that event throws. We should be resilient to most of\n      // those cases. Even if our error event handler fires more than once, the\n      // last error event is always used. If the callback actually does error,\n      // we know that the last error event is the correct one, because it's not\n      // possible for anything else to have happened in between our callback\n      // erroring and the code that follows the `dispatchEvent` call below. If\n      // the callback doesn't error, but the error event was fired, we know to\n      // ignore it because `didError` will be false, as described above.\n\n\n      var error; // Use this to track whether the error event is ever called.\n\n      var didSetError = false;\n      var isCrossOriginError = false;\n\n      function handleWindowError(event) {\n        error = event.error;\n        didSetError = true;\n\n        if (error === null && event.colno === 0 && event.lineno === 0) {\n          isCrossOriginError = true;\n        }\n\n        if (event.defaultPrevented) {\n          // Some other error handler has prevented default.\n          // Browsers silence the error report if this happens.\n          // We'll remember this to later decide whether to log it or not.\n          if (error != null && typeof error === 'object') {\n            try {\n              error._suppressLogging = true;\n            } catch (inner) {// Ignore.\n            }\n          }\n        }\n      } // Create a fake event type.\n\n\n      var evtType = \"react-\" + (name ? name : 'invokeguardedcallback'); // Attach our event handlers\n\n      window.addEventListener('error', handleWindowError);\n      fakeNode.addEventListener(evtType, callCallback, false); // Synchronously dispatch our fake event. If the user-provided function\n      // errors, it will trigger our global error handler.\n\n      evt.initEvent(evtType, false, false);\n      fakeNode.dispatchEvent(evt);\n\n      if (windowEventDescriptor) {\n        Object.defineProperty(window, 'event', windowEventDescriptor);\n      }\n\n      if (didCall && didError) {\n        if (!didSetError) {\n          // The callback errored, but the error event never fired.\n          // eslint-disable-next-line react-internal/prod-error-codes\n          error = new Error('An error was thrown inside one of your components, but React ' + \"doesn't know what it was. This is likely due to browser \" + 'flakiness. React does its best to preserve the \"Pause on ' + 'exceptions\" behavior of the DevTools, which requires some ' + \"DEV-mode only tricks. It's possible that these don't work in \" + 'your browser. Try triggering the error in production mode, ' + 'or switching to a modern browser. If you suspect that this is ' + 'actually an issue with React, please file an issue.');\n        } else if (isCrossOriginError) {\n          // eslint-disable-next-line react-internal/prod-error-codes\n          error = new Error(\"A cross-origin error was thrown. React doesn't have access to \" + 'the actual error object in development. ' + 'See https://reactjs.org/link/crossorigin-error for more information.');\n        }\n\n        this.onError(error);\n      } // Remove our event listeners\n\n\n      window.removeEventListener('error', handleWindowError);\n\n      if (!didCall) {\n        // Something went really wrong, and our event was not dispatched.\n        // https://github.com/facebook/react/issues/16734\n        // https://github.com/facebook/react/issues/16585\n        // Fall back to the production implementation.\n        restoreAfterDispatch();\n        return invokeGuardedCallbackProd.apply(this, arguments);\n      }\n    };\n  }\n}\n\nvar invokeGuardedCallbackImpl$1 = invokeGuardedCallbackImpl;\n\nvar hasError = false;\nvar caughtError = null; // Used by event system to capture/rethrow the first error.\n\nvar hasRethrowError = false;\nvar rethrowError = null;\nvar reporter = {\n  onError: function (error) {\n    hasError = true;\n    caughtError = error;\n  }\n};\n/**\n * Call a function while guarding against errors that happens within it.\n * Returns an error if it throws, otherwise null.\n *\n * In production, this is implemented using a try-catch. The reason we don't\n * use a try-catch directly is so that we can swap out a different\n * implementation in DEV mode.\n *\n * @param {String} name of the guard to use for logging or debugging\n * @param {Function} func The function to invoke\n * @param {*} context The context to use when calling the function\n * @param {...*} args Arguments for function\n */\n\nfunction invokeGuardedCallback(name, func, context, a, b, c, d, e, f) {\n  hasError = false;\n  caughtError = null;\n  invokeGuardedCallbackImpl$1.apply(reporter, arguments);\n}\n/**\n * Same as invokeGuardedCallback, but instead of returning an error, it stores\n * it in a global so it can be rethrown by `rethrowCaughtError` later.\n * TODO: See if caughtError and rethrowError can be unified.\n *\n * @param {String} name of the guard to use for logging or debugging\n * @param {Function} func The function to invoke\n * @param {*} context The context to use when calling the function\n * @param {...*} args Arguments for function\n */\n\nfunction invokeGuardedCallbackAndCatchFirstError(name, func, context, a, b, c, d, e, f) {\n  invokeGuardedCallback.apply(this, arguments);\n\n  if (hasError) {\n    var error = clearCaughtError();\n\n    if (!hasRethrowError) {\n      hasRethrowError = true;\n      rethrowError = error;\n    }\n  }\n}\n/**\n * During execution of guarded functions we will capture the first error which\n * we will rethrow to be handled by the top level error handler.\n */\n\nfunction rethrowCaughtError() {\n  if (hasRethrowError) {\n    var error = rethrowError;\n    hasRethrowError = false;\n    rethrowError = null;\n    throw error;\n  }\n}\nfunction hasCaughtError() {\n  return hasError;\n}\nfunction clearCaughtError() {\n  if (hasError) {\n    var error = caughtError;\n    hasError = false;\n    caughtError = null;\n    return error;\n  } else {\n    throw new Error('clearCaughtError was called but no error was captured. This error ' + 'is likely caused by a bug in React. Please file an issue.');\n  }\n}\n\n/**\n * `ReactInstanceMap` maintains a mapping from a public facing stateful\n * instance (key) and the internal representation (value). This allows public\n * methods to accept the user facing instance as an argument and map them back\n * to internal methods.\n *\n * Note that this module is currently shared and assumed to be stateless.\n * If this becomes an actual Map, that will break.\n */\nfunction get(key) {\n  return key._reactInternals;\n}\nfunction has(key) {\n  return key._reactInternals !== undefined;\n}\nfunction set(key, value) {\n  key._reactInternals = value;\n}\n\n// Don't change these two values. They're used by React Dev Tools.\nvar NoFlags =\n/*                      */\n0;\nvar PerformedWork =\n/*                */\n1; // You can change the rest (and add more).\n\nvar Placement =\n/*                    */\n2;\nvar Update =\n/*                       */\n4;\nvar ChildDeletion =\n/*                */\n16;\nvar ContentReset =\n/*                 */\n32;\nvar Callback =\n/*                     */\n64;\nvar DidCapture =\n/*                   */\n128;\nvar ForceClientRender =\n/*            */\n256;\nvar Ref =\n/*                          */\n512;\nvar Snapshot =\n/*                     */\n1024;\nvar Passive =\n/*                      */\n2048;\nvar Hydrating =\n/*                    */\n4096;\nvar Visibility =\n/*                   */\n8192;\nvar StoreConsistency =\n/*             */\n16384;\nvar LifecycleEffectMask = Passive | Update | Callback | Ref | Snapshot | StoreConsistency; // Union of all commit flags (flags with the lifetime of a particular commit)\n\nvar HostEffectMask =\n/*               */\n32767; // These are not really side effects, but we still reuse this field.\n\nvar Incomplete =\n/*                   */\n32768;\nvar ShouldCapture =\n/*                */\n65536;\nvar ForceUpdateForLegacySuspense =\n/* */\n131072;\nvar Forked =\n/*                       */\n1048576; // Static tags describe aspects of a fiber that are not specific to a render,\n// e.g. a fiber uses a passive effect (even if there are no updates on this particular render).\n// This enables us to defer more work in the unmount case,\n// since we can defer traversing the tree during layout to look for Passive effects,\n// and instead rely on the static flag as a signal that there may be cleanup work.\n\nvar RefStatic =\n/*                    */\n2097152;\nvar LayoutStatic =\n/*                 */\n4194304;\nvar PassiveStatic =\n/*                */\n8388608; // These flags allow us to traverse to fibers that have effects on mount\n// without traversing the entire tree after every commit for\n// double invoking\n\nvar MountLayoutDev =\n/*               */\n16777216;\nvar MountPassiveDev =\n/*              */\n33554432; // Groups of flags that are used in the commit phase to skip over trees that\n// don't contain effects, by checking subtreeFlags.\n\nvar BeforeMutationMask = // TODO: Remove Update flag from before mutation phase by re-landing Visibility\n// flag logic (see #20043)\nUpdate | Snapshot | ( 0);\nvar MutationMask = Placement | Update | ChildDeletion | ContentReset | Ref | Hydrating | Visibility;\nvar LayoutMask = Update | Callback | Ref | Visibility; // TODO: Split into PassiveMountMask and PassiveUnmountMask\n\nvar PassiveMask = Passive | ChildDeletion; // Union of tags that don't get reset on clones.\n// This allows certain concepts to persist without recalculating them,\n// e.g. whether a subtree contains passive effects or portals.\n\nvar StaticMask = LayoutStatic | PassiveStatic | RefStatic;\n\nvar ReactCurrentOwner = ReactSharedInternals.ReactCurrentOwner;\nfunction getNearestMountedFiber(fiber) {\n  var node = fiber;\n  var nearestMounted = fiber;\n\n  if (!fiber.alternate) {\n    // If there is no alternate, this might be a new tree that isn't inserted\n    // yet. If it is, then it will have a pending insertion effect on it.\n    var nextNode = node;\n\n    do {\n      node = nextNode;\n\n      if ((node.flags & (Placement | Hydrating)) !== NoFlags) {\n        // This is an insertion or in-progress hydration. The nearest possible\n        // mounted fiber is the parent but we need to continue to figure out\n        // if that one is still mounted.\n        nearestMounted = node.return;\n      }\n\n      nextNode = node.return;\n    } while (nextNode);\n  } else {\n    while (node.return) {\n      node = node.return;\n    }\n  }\n\n  if (node.tag === HostRoot) {\n    // TODO: Check if this was a nested HostRoot when used with\n    // renderContainerIntoSubtree.\n    return nearestMounted;\n  } // If we didn't hit the root, that means that we're in an disconnected tree\n  // that has been unmounted.\n\n\n  return null;\n}\nfunction getSuspenseInstanceFromFiber(fiber) {\n  if (fiber.tag === SuspenseComponent) {\n    var suspenseState = fiber.memoizedState;\n\n    if (suspenseState === null) {\n      var current = fiber.alternate;\n\n      if (current !== null) {\n        suspenseState = current.memoizedState;\n      }\n    }\n\n    if (suspenseState !== null) {\n      return suspenseState.dehydrated;\n    }\n  }\n\n  return null;\n}\nfunction getContainerFromFiber(fiber) {\n  return fiber.tag === HostRoot ? fiber.stateNode.containerInfo : null;\n}\nfunction isFiberMounted(fiber) {\n  return getNearestMountedFiber(fiber) === fiber;\n}\nfunction isMounted(component) {\n  {\n    var owner = ReactCurrentOwner.current;\n\n    if (owner !== null && owner.tag === ClassComponent) {\n      var ownerFiber = owner;\n      var instance = ownerFiber.stateNode;\n\n      if (!instance._warnedAboutRefsInRender) {\n        error('%s is accessing isMounted inside its render() function. ' + 'render() should be a pure function of props and state. It should ' + 'never access something that requires stale data from the previous ' + 'render, such as refs. Move this logic to componentDidMount and ' + 'componentDidUpdate instead.', getComponentNameFromFiber(ownerFiber) || 'A component');\n      }\n\n      instance._warnedAboutRefsInRender = true;\n    }\n  }\n\n  var fiber = get(component);\n\n  if (!fiber) {\n    return false;\n  }\n\n  return getNearestMountedFiber(fiber) === fiber;\n}\n\nfunction assertIsMounted(fiber) {\n  if (getNearestMountedFiber(fiber) !== fiber) {\n    throw new Error('Unable to find node on an unmounted component.');\n  }\n}\n\nfunction findCurrentFiberUsingSlowPath(fiber) {\n  var alternate = fiber.alternate;\n\n  if (!alternate) {\n    // If there is no alternate, then we only need to check if it is mounted.\n    var nearestMounted = getNearestMountedFiber(fiber);\n\n    if (nearestMounted === null) {\n      throw new Error('Unable to find node on an unmounted component.');\n    }\n\n    if (nearestMounted !== fiber) {\n      return null;\n    }\n\n    return fiber;\n  } // If we have two possible branches, we'll walk backwards up to the root\n  // to see what path the root points to. On the way we may hit one of the\n  // special cases and we'll deal with them.\n\n\n  var a = fiber;\n  var b = alternate;\n\n  while (true) {\n    var parentA = a.return;\n\n    if (parentA === null) {\n      // We're at the root.\n      break;\n    }\n\n    var parentB = parentA.alternate;\n\n    if (parentB === null) {\n      // There is no alternate. This is an unusual case. Currently, it only\n      // happens when a Suspense component is hidden. An extra fragment fiber\n      // is inserted in between the Suspense fiber and its children. Skip\n      // over this extra fragment fiber and proceed to the next parent.\n      var nextParent = parentA.return;\n\n      if (nextParent !== null) {\n        a = b = nextParent;\n        continue;\n      } // If there's no parent, we're at the root.\n\n\n      break;\n    } // If both copies of the parent fiber point to the same child, we can\n    // assume that the child is current. This happens when we bailout on low\n    // priority: the bailed out fiber's child reuses the current child.\n\n\n    if (parentA.child === parentB.child) {\n      var child = parentA.child;\n\n      while (child) {\n        if (child === a) {\n          // We've determined that A is the current branch.\n          assertIsMounted(parentA);\n          return fiber;\n        }\n\n        if (child === b) {\n          // We've determined that B is the current branch.\n          assertIsMounted(parentA);\n          return alternate;\n        }\n\n        child = child.sibling;\n      } // We should never have an alternate for any mounting node. So the only\n      // way this could possibly happen is if this was unmounted, if at all.\n\n\n      throw new Error('Unable to find node on an unmounted component.');\n    }\n\n    if (a.return !== b.return) {\n      // The return pointer of A and the return pointer of B point to different\n      // fibers. We assume that return pointers never criss-cross, so A must\n      // belong to the child set of A.return, and B must belong to the child\n      // set of B.return.\n      a = parentA;\n      b = parentB;\n    } else {\n      // The return pointers point to the same fiber. We'll have to use the\n      // default, slow path: scan the child sets of each parent alternate to see\n      // which child belongs to which set.\n      //\n      // Search parent A's child set\n      var didFindChild = false;\n      var _child = parentA.child;\n\n      while (_child) {\n        if (_child === a) {\n          didFindChild = true;\n          a = parentA;\n          b = parentB;\n          break;\n        }\n\n        if (_child === b) {\n          didFindChild = true;\n          b = parentA;\n          a = parentB;\n          break;\n        }\n\n        _child = _child.sibling;\n      }\n\n      if (!didFindChild) {\n        // Search parent B's child set\n        _child = parentB.child;\n\n        while (_child) {\n          if (_child === a) {\n            didFindChild = true;\n            a = parentB;\n            b = parentA;\n            break;\n          }\n\n          if (_child === b) {\n            didFindChild = true;\n            b = parentB;\n            a = parentA;\n            break;\n          }\n\n          _child = _child.sibling;\n        }\n\n        if (!didFindChild) {\n          throw new Error('Child was not found in either parent set. This indicates a bug ' + 'in React related to the return pointer. Please file an issue.');\n        }\n      }\n    }\n\n    if (a.alternate !== b) {\n      throw new Error(\"Return fibers should always be each others' alternates. \" + 'This error is likely caused by a bug in React. Please file an issue.');\n    }\n  } // If the root is not a host container, we're in a disconnected tree. I.e.\n  // unmounted.\n\n\n  if (a.tag !== HostRoot) {\n    throw new Error('Unable to find node on an unmounted component.');\n  }\n\n  if (a.stateNode.current === a) {\n    // We've determined that A is the current branch.\n    return fiber;\n  } // Otherwise B has to be current branch.\n\n\n  return alternate;\n}\nfunction findCurrentHostFiber(parent) {\n  var currentParent = findCurrentFiberUsingSlowPath(parent);\n  return currentParent !== null ? findCurrentHostFiberImpl(currentParent) : null;\n}\n\nfunction findCurrentHostFiberImpl(node) {\n  // Next we'll drill down this component to find the first HostComponent/Text.\n  if (node.tag === HostComponent || node.tag === HostText) {\n    return node;\n  }\n\n  var child = node.child;\n\n  while (child !== null) {\n    var match = findCurrentHostFiberImpl(child);\n\n    if (match !== null) {\n      return match;\n    }\n\n    child = child.sibling;\n  }\n\n  return null;\n}\n\nfunction findCurrentHostFiberWithNoPortals(parent) {\n  var currentParent = findCurrentFiberUsingSlowPath(parent);\n  return currentParent !== null ? findCurrentHostFiberWithNoPortalsImpl(currentParent) : null;\n}\n\nfunction findCurrentHostFiberWithNoPortalsImpl(node) {\n  // Next we'll drill down this component to find the first HostComponent/Text.\n  if (node.tag === HostComponent || node.tag === HostText) {\n    return node;\n  }\n\n  var child = node.child;\n\n  while (child !== null) {\n    if (child.tag !== HostPortal) {\n      var match = findCurrentHostFiberWithNoPortalsImpl(child);\n\n      if (match !== null) {\n        return match;\n      }\n    }\n\n    child = child.sibling;\n  }\n\n  return null;\n}\n\n// This module only exists as an ESM wrapper around the external CommonJS\nvar scheduleCallback = Scheduler.unstable_scheduleCallback;\nvar cancelCallback = Scheduler.unstable_cancelCallback;\nvar shouldYield = Scheduler.unstable_shouldYield;\nvar requestPaint = Scheduler.unstable_requestPaint;\nvar now = Scheduler.unstable_now;\nvar getCurrentPriorityLevel = Scheduler.unstable_getCurrentPriorityLevel;\nvar ImmediatePriority = Scheduler.unstable_ImmediatePriority;\nvar UserBlockingPriority = Scheduler.unstable_UserBlockingPriority;\nvar NormalPriority = Scheduler.unstable_NormalPriority;\nvar LowPriority = Scheduler.unstable_LowPriority;\nvar IdlePriority = Scheduler.unstable_IdlePriority;\n// this doesn't actually exist on the scheduler, but it *does*\n// on scheduler/unstable_mock, which we'll need for internal testing\nvar unstable_yieldValue = Scheduler.unstable_yieldValue;\nvar unstable_setDisableYieldValue = Scheduler.unstable_setDisableYieldValue;\n\nvar rendererID = null;\nvar injectedHook = null;\nvar injectedProfilingHooks = null;\nvar hasLoggedError = false;\nvar isDevToolsPresent = typeof __REACT_DEVTOOLS_GLOBAL_HOOK__ !== 'undefined';\nfunction injectInternals(internals) {\n  if (typeof __REACT_DEVTOOLS_GLOBAL_HOOK__ === 'undefined') {\n    // No DevTools\n    return false;\n  }\n\n  var hook = __REACT_DEVTOOLS_GLOBAL_HOOK__;\n\n  if (hook.isDisabled) {\n    // This isn't a real property on the hook, but it can be set to opt out\n    // of DevTools integration and associated warnings and logs.\n    // https://github.com/facebook/react/issues/3877\n    return true;\n  }\n\n  if (!hook.supportsFiber) {\n    {\n      error('The installed version of React DevTools is too old and will not work ' + 'with the current version of React. Please update React DevTools. ' + 'https://reactjs.org/link/react-devtools');\n    } // DevTools exists, even though it doesn't support Fiber.\n\n\n    return true;\n  }\n\n  try {\n    if (enableSchedulingProfiler) {\n      // Conditionally inject these hooks only if Timeline profiler is supported by this build.\n      // This gives DevTools a way to feature detect that isn't tied to version number\n      // (since profiling and timeline are controlled by different feature flags).\n      internals = assign({}, internals, {\n        getLaneLabelMap: getLaneLabelMap,\n        injectProfilingHooks: injectProfilingHooks\n      });\n    }\n\n    rendererID = hook.inject(internals); // We have successfully injected, so now it is safe to set up hooks.\n\n    injectedHook = hook;\n  } catch (err) {\n    // Catch all errors because it is unsafe to throw during initialization.\n    {\n      error('React instrumentation encountered an error: %s.', err);\n    }\n  }\n\n  if (hook.checkDCE) {\n    // This is the real DevTools.\n    return true;\n  } else {\n    // This is likely a hook installed by Fast Refresh runtime.\n    return false;\n  }\n}\nfunction onScheduleRoot(root, children) {\n  {\n    if (injectedHook && typeof injectedHook.onScheduleFiberRoot === 'function') {\n      try {\n        injectedHook.onScheduleFiberRoot(rendererID, root, children);\n      } catch (err) {\n        if ( !hasLoggedError) {\n          hasLoggedError = true;\n\n          error('React instrumentation encountered an error: %s', err);\n        }\n      }\n    }\n  }\n}\nfunction onCommitRoot(root, eventPriority) {\n  if (injectedHook && typeof injectedHook.onCommitFiberRoot === 'function') {\n    try {\n      var didError = (root.current.flags & DidCapture) === DidCapture;\n\n      if (enableProfilerTimer) {\n        var schedulerPriority;\n\n        switch (eventPriority) {\n          case DiscreteEventPriority:\n            schedulerPriority = ImmediatePriority;\n            break;\n\n          case ContinuousEventPriority:\n            schedulerPriority = UserBlockingPriority;\n            break;\n\n          case DefaultEventPriority:\n            schedulerPriority = NormalPriority;\n            break;\n\n          case IdleEventPriority:\n            schedulerPriority = IdlePriority;\n            break;\n\n          default:\n            schedulerPriority = NormalPriority;\n            break;\n        }\n\n        injectedHook.onCommitFiberRoot(rendererID, root, schedulerPriority, didError);\n      } else {\n        injectedHook.onCommitFiberRoot(rendererID, root, undefined, didError);\n      }\n    } catch (err) {\n      {\n        if (!hasLoggedError) {\n          hasLoggedError = true;\n\n          error('React instrumentation encountered an error: %s', err);\n        }\n      }\n    }\n  }\n}\nfunction onPostCommitRoot(root) {\n  if (injectedHook && typeof injectedHook.onPostCommitFiberRoot === 'function') {\n    try {\n      injectedHook.onPostCommitFiberRoot(rendererID, root);\n    } catch (err) {\n      {\n        if (!hasLoggedError) {\n          hasLoggedError = true;\n\n          error('React instrumentation encountered an error: %s', err);\n        }\n      }\n    }\n  }\n}\nfunction onCommitUnmount(fiber) {\n  if (injectedHook && typeof injectedHook.onCommitFiberUnmount === 'function') {\n    try {\n      injectedHook.onCommitFiberUnmount(rendererID, fiber);\n    } catch (err) {\n      {\n        if (!hasLoggedError) {\n          hasLoggedError = true;\n\n          error('React instrumentation encountered an error: %s', err);\n        }\n      }\n    }\n  }\n}\nfunction setIsStrictModeForDevtools(newIsStrictMode) {\n  {\n    if (typeof unstable_yieldValue === 'function') {\n      // We're in a test because Scheduler.unstable_yieldValue only exists\n      // in SchedulerMock. To reduce the noise in strict mode tests,\n      // suppress warnings and disable scheduler yielding during the double render\n      unstable_setDisableYieldValue(newIsStrictMode);\n      setSuppressWarning(newIsStrictMode);\n    }\n\n    if (injectedHook && typeof injectedHook.setStrictMode === 'function') {\n      try {\n        injectedHook.setStrictMode(rendererID, newIsStrictMode);\n      } catch (err) {\n        {\n          if (!hasLoggedError) {\n            hasLoggedError = true;\n\n            error('React instrumentation encountered an error: %s', err);\n          }\n        }\n      }\n    }\n  }\n} // Profiler API hooks\n\nfunction injectProfilingHooks(profilingHooks) {\n  injectedProfilingHooks = profilingHooks;\n}\n\nfunction getLaneLabelMap() {\n  {\n    var map = new Map();\n    var lane = 1;\n\n    for (var index = 0; index < TotalLanes; index++) {\n      var label = getLabelForLane(lane);\n      map.set(lane, label);\n      lane *= 2;\n    }\n\n    return map;\n  }\n}\n\nfunction markCommitStarted(lanes) {\n  {\n    if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markCommitStarted === 'function') {\n      injectedProfilingHooks.markCommitStarted(lanes);\n    }\n  }\n}\nfunction markCommitStopped() {\n  {\n    if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markCommitStopped === 'function') {\n      injectedProfilingHooks.markCommitStopped();\n    }\n  }\n}\nfunction markComponentRenderStarted(fiber) {\n  {\n    if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markComponentRenderStarted === 'function') {\n      injectedProfilingHooks.markComponentRenderStarted(fiber);\n    }\n  }\n}\nfunction markComponentRenderStopped() {\n  {\n    if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markComponentRenderStopped === 'function') {\n      injectedProfilingHooks.markComponentRenderStopped();\n    }\n  }\n}\nfunction markComponentPassiveEffectMountStarted(fiber) {\n  {\n    if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markComponentPassiveEffectMountStarted === 'function') {\n      injectedProfilingHooks.markComponentPassiveEffectMountStarted(fiber);\n    }\n  }\n}\nfunction markComponentPassiveEffectMountStopped() {\n  {\n    if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markComponentPassiveEffectMountStopped === 'function') {\n      injectedProfilingHooks.markComponentPassiveEffectMountStopped();\n    }\n  }\n}\nfunction markComponentPassiveEffectUnmountStarted(fiber) {\n  {\n    if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markComponentPassiveEffectUnmountStarted === 'function') {\n      injectedProfilingHooks.markComponentPassiveEffectUnmountStarted(fiber);\n    }\n  }\n}\nfunction markComponentPassiveEffectUnmountStopped() {\n  {\n    if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markComponentPassiveEffectUnmountStopped === 'function') {\n      injectedProfilingHooks.markComponentPassiveEffectUnmountStopped();\n    }\n  }\n}\nfunction markComponentLayoutEffectMountStarted(fiber) {\n  {\n    if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markComponentLayoutEffectMountStarted === 'function') {\n      injectedProfilingHooks.markComponentLayoutEffectMountStarted(fiber);\n    }\n  }\n}\nfunction markComponentLayoutEffectMountStopped() {\n  {\n    if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markComponentLayoutEffectMountStopped === 'function') {\n      injectedProfilingHooks.markComponentLayoutEffectMountStopped();\n    }\n  }\n}\nfunction markComponentLayoutEffectUnmountStarted(fiber) {\n  {\n    if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markComponentLayoutEffectUnmountStarted === 'function') {\n      injectedProfilingHooks.markComponentLayoutEffectUnmountStarted(fiber);\n    }\n  }\n}\nfunction markComponentLayoutEffectUnmountStopped() {\n  {\n    if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markComponentLayoutEffectUnmountStopped === 'function') {\n      injectedProfilingHooks.markComponentLayoutEffectUnmountStopped();\n    }\n  }\n}\nfunction markComponentErrored(fiber, thrownValue, lanes) {\n  {\n    if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markComponentErrored === 'function') {\n      injectedProfilingHooks.markComponentErrored(fiber, thrownValue, lanes);\n    }\n  }\n}\nfunction markComponentSuspended(fiber, wakeable, lanes) {\n  {\n    if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markComponentSuspended === 'function') {\n      injectedProfilingHooks.markComponentSuspended(fiber, wakeable, lanes);\n    }\n  }\n}\nfunction markLayoutEffectsStarted(lanes) {\n  {\n    if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markLayoutEffectsStarted === 'function') {\n      injectedProfilingHooks.markLayoutEffectsStarted(lanes);\n    }\n  }\n}\nfunction markLayoutEffectsStopped() {\n  {\n    if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markLayoutEffectsStopped === 'function') {\n      injectedProfilingHooks.markLayoutEffectsStopped();\n    }\n  }\n}\nfunction markPassiveEffectsStarted(lanes) {\n  {\n    if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markPassiveEffectsStarted === 'function') {\n      injectedProfilingHooks.markPassiveEffectsStarted(lanes);\n    }\n  }\n}\nfunction markPassiveEffectsStopped() {\n  {\n    if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markPassiveEffectsStopped === 'function') {\n      injectedProfilingHooks.markPassiveEffectsStopped();\n    }\n  }\n}\nfunction markRenderStarted(lanes) {\n  {\n    if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markRenderStarted === 'function') {\n      injectedProfilingHooks.markRenderStarted(lanes);\n    }\n  }\n}\nfunction markRenderYielded() {\n  {\n    if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markRenderYielded === 'function') {\n      injectedProfilingHooks.markRenderYielded();\n    }\n  }\n}\nfunction markRenderStopped() {\n  {\n    if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markRenderStopped === 'function') {\n      injectedProfilingHooks.markRenderStopped();\n    }\n  }\n}\nfunction markRenderScheduled(lane) {\n  {\n    if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markRenderScheduled === 'function') {\n      injectedProfilingHooks.markRenderScheduled(lane);\n    }\n  }\n}\nfunction markForceUpdateScheduled(fiber, lane) {\n  {\n    if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markForceUpdateScheduled === 'function') {\n      injectedProfilingHooks.markForceUpdateScheduled(fiber, lane);\n    }\n  }\n}\nfunction markStateUpdateScheduled(fiber, lane) {\n  {\n    if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markStateUpdateScheduled === 'function') {\n      injectedProfilingHooks.markStateUpdateScheduled(fiber, lane);\n    }\n  }\n}\n\nvar NoMode =\n/*                         */\n0; // TODO: Remove ConcurrentMode by reading from the root tag instead\n\nvar ConcurrentMode =\n/*                 */\n1;\nvar ProfileMode =\n/*                    */\n2;\nvar StrictLegacyMode =\n/*               */\n8;\nvar StrictEffectsMode =\n/*              */\n16;\n\n// TODO: This is pretty well supported by browsers. Maybe we can drop it.\nvar clz32 = Math.clz32 ? Math.clz32 : clz32Fallback; // Count leading zeros.\n// Based on:\n// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Math/clz32\n\nvar log = Math.log;\nvar LN2 = Math.LN2;\n\nfunction clz32Fallback(x) {\n  var asUint = x >>> 0;\n\n  if (asUint === 0) {\n    return 32;\n  }\n\n  return 31 - (log(asUint) / LN2 | 0) | 0;\n}\n\n// If those values are changed that package should be rebuilt and redeployed.\n\nvar TotalLanes = 31;\nvar NoLanes =\n/*                        */\n0;\nvar NoLane =\n/*                          */\n0;\nvar SyncLane =\n/*                        */\n1;\nvar InputContinuousHydrationLane =\n/*    */\n2;\nvar InputContinuousLane =\n/*             */\n4;\nvar DefaultHydrationLane =\n/*            */\n8;\nvar DefaultLane =\n/*                     */\n16;\nvar TransitionHydrationLane =\n/*                */\n32;\nvar TransitionLanes =\n/*                       */\n4194240;\nvar TransitionLane1 =\n/*                        */\n64;\nvar TransitionLane2 =\n/*                        */\n128;\nvar TransitionLane3 =\n/*                        */\n256;\nvar TransitionLane4 =\n/*                        */\n512;\nvar TransitionLane5 =\n/*                        */\n1024;\nvar TransitionLane6 =\n/*                        */\n2048;\nvar TransitionLane7 =\n/*                        */\n4096;\nvar TransitionLane8 =\n/*                        */\n8192;\nvar TransitionLane9 =\n/*                        */\n16384;\nvar TransitionLane10 =\n/*                       */\n32768;\nvar TransitionLane11 =\n/*                       */\n65536;\nvar TransitionLane12 =\n/*                       */\n131072;\nvar TransitionLane13 =\n/*                       */\n262144;\nvar TransitionLane14 =\n/*                       */\n524288;\nvar TransitionLane15 =\n/*                       */\n1048576;\nvar TransitionLane16 =\n/*                       */\n2097152;\nvar RetryLanes =\n/*                            */\n130023424;\nvar RetryLane1 =\n/*                             */\n4194304;\nvar RetryLane2 =\n/*                             */\n8388608;\nvar RetryLane3 =\n/*                             */\n16777216;\nvar RetryLane4 =\n/*                             */\n33554432;\nvar RetryLane5 =\n/*                             */\n67108864;\nvar SomeRetryLane = RetryLane1;\nvar SelectiveHydrationLane =\n/*          */\n134217728;\nvar NonIdleLanes =\n/*                          */\n268435455;\nvar IdleHydrationLane =\n/*               */\n268435456;\nvar IdleLane =\n/*                        */\n536870912;\nvar OffscreenLane =\n/*                   */\n1073741824; // This function is used for the experimental timeline (react-devtools-timeline)\n// It should be kept in sync with the Lanes values above.\n\nfunction getLabelForLane(lane) {\n  {\n    if (lane & SyncLane) {\n      return 'Sync';\n    }\n\n    if (lane & InputContinuousHydrationLane) {\n      return 'InputContinuousHydration';\n    }\n\n    if (lane & InputContinuousLane) {\n      return 'InputContinuous';\n    }\n\n    if (lane & DefaultHydrationLane) {\n      return 'DefaultHydration';\n    }\n\n    if (lane & DefaultLane) {\n      return 'Default';\n    }\n\n    if (lane & TransitionHydrationLane) {\n      return 'TransitionHydration';\n    }\n\n    if (lane & TransitionLanes) {\n      return 'Transition';\n    }\n\n    if (lane & RetryLanes) {\n      return 'Retry';\n    }\n\n    if (lane & SelectiveHydrationLane) {\n      return 'SelectiveHydration';\n    }\n\n    if (lane & IdleHydrationLane) {\n      return 'IdleHydration';\n    }\n\n    if (lane & IdleLane) {\n      return 'Idle';\n    }\n\n    if (lane & OffscreenLane) {\n      return 'Offscreen';\n    }\n  }\n}\nvar NoTimestamp = -1;\nvar nextTransitionLane = TransitionLane1;\nvar nextRetryLane = RetryLane1;\n\nfunction getHighestPriorityLanes(lanes) {\n  switch (getHighestPriorityLane(lanes)) {\n    case SyncLane:\n      return SyncLane;\n\n    case InputContinuousHydrationLane:\n      return InputContinuousHydrationLane;\n\n    case InputContinuousLane:\n      return InputContinuousLane;\n\n    case DefaultHydrationLane:\n      return DefaultHydrationLane;\n\n    case DefaultLane:\n      return DefaultLane;\n\n    case TransitionHydrationLane:\n      return TransitionHydrationLane;\n\n    case TransitionLane1:\n    case TransitionLane2:\n    case TransitionLane3:\n    case TransitionLane4:\n    case TransitionLane5:\n    case TransitionLane6:\n    case TransitionLane7:\n    case TransitionLane8:\n    case TransitionLane9:\n    case TransitionLane10:\n    case TransitionLane11:\n    case TransitionLane12:\n    case TransitionLane13:\n    case TransitionLane14:\n    case TransitionLane15:\n    case TransitionLane16:\n      return lanes & TransitionLanes;\n\n    case RetryLane1:\n    case RetryLane2:\n    case RetryLane3:\n    case RetryLane4:\n    case RetryLane5:\n      return lanes & RetryLanes;\n\n    case SelectiveHydrationLane:\n      return SelectiveHydrationLane;\n\n    case IdleHydrationLane:\n      return IdleHydrationLane;\n\n    case IdleLane:\n      return IdleLane;\n\n    case OffscreenLane:\n      return OffscreenLane;\n\n    default:\n      {\n        error('Should have found matching lanes. This is a bug in React.');\n      } // This shouldn't be reachable, but as a fallback, return the entire bitmask.\n\n\n      return lanes;\n  }\n}\n\nfunction getNextLanes(root, wipLanes) {\n  // Early bailout if there's no pending work left.\n  var pendingLanes = root.pendingLanes;\n\n  if (pendingLanes === NoLanes) {\n    return NoLanes;\n  }\n\n  var nextLanes = NoLanes;\n  var suspendedLanes = root.suspendedLanes;\n  var pingedLanes = root.pingedLanes; // Do not work on any idle work until all the non-idle work has finished,\n  // even if the work is suspended.\n\n  var nonIdlePendingLanes = pendingLanes & NonIdleLanes;\n\n  if (nonIdlePendingLanes !== NoLanes) {\n    var nonIdleUnblockedLanes = nonIdlePendingLanes & ~suspendedLanes;\n\n    if (nonIdleUnblockedLanes !== NoLanes) {\n      nextLanes = getHighestPriorityLanes(nonIdleUnblockedLanes);\n    } else {\n      var nonIdlePingedLanes = nonIdlePendingLanes & pingedLanes;\n\n      if (nonIdlePingedLanes !== NoLanes) {\n        nextLanes = getHighestPriorityLanes(nonIdlePingedLanes);\n      }\n    }\n  } else {\n    // The only remaining work is Idle.\n    var unblockedLanes = pendingLanes & ~suspendedLanes;\n\n    if (unblockedLanes !== NoLanes) {\n      nextLanes = getHighestPriorityLanes(unblockedLanes);\n    } else {\n      if (pingedLanes !== NoLanes) {\n        nextLanes = getHighestPriorityLanes(pingedLanes);\n      }\n    }\n  }\n\n  if (nextLanes === NoLanes) {\n    // This should only be reachable if we're suspended\n    // TODO: Consider warning in this path if a fallback timer is not scheduled.\n    return NoLanes;\n  } // If we're already in the middle of a render, switching lanes will interrupt\n  // it and we'll lose our progress. We should only do this if the new lanes are\n  // higher priority.\n\n\n  if (wipLanes !== NoLanes && wipLanes !== nextLanes && // If we already suspended with a delay, then interrupting is fine. Don't\n  // bother waiting until the root is complete.\n  (wipLanes & suspendedLanes) === NoLanes) {\n    var nextLane = getHighestPriorityLane(nextLanes);\n    var wipLane = getHighestPriorityLane(wipLanes);\n\n    if ( // Tests whether the next lane is equal or lower priority than the wip\n    // one. This works because the bits decrease in priority as you go left.\n    nextLane >= wipLane || // Default priority updates should not interrupt transition updates. The\n    // only difference between default updates and transition updates is that\n    // default updates do not support refresh transitions.\n    nextLane === DefaultLane && (wipLane & TransitionLanes) !== NoLanes) {\n      // Keep working on the existing in-progress tree. Do not interrupt.\n      return wipLanes;\n    }\n  }\n\n  if ((nextLanes & InputContinuousLane) !== NoLanes) {\n    // When updates are sync by default, we entangle continuous priority updates\n    // and default updates, so they render in the same batch. The only reason\n    // they use separate lanes is because continuous updates should interrupt\n    // transitions, but default updates should not.\n    nextLanes |= pendingLanes & DefaultLane;\n  } // Check for entangled lanes and add them to the batch.\n  //\n  // A lane is said to be entangled with another when it's not allowed to render\n  // in a batch that does not also include the other lane. Typically we do this\n  // when multiple updates have the same source, and we only want to respond to\n  // the most recent event from that source.\n  //\n  // Note that we apply entanglements *after* checking for partial work above.\n  // This means that if a lane is entangled during an interleaved event while\n  // it's already rendering, we won't interrupt it. This is intentional, since\n  // entanglement is usually \"best effort\": we'll try our best to render the\n  // lanes in the same batch, but it's not worth throwing out partially\n  // completed work in order to do it.\n  // TODO: Reconsider this. The counter-argument is that the partial work\n  // represents an intermediate state, which we don't want to show to the user.\n  // And by spending extra time finishing it, we're increasing the amount of\n  // time it takes to show the final state, which is what they are actually\n  // waiting for.\n  //\n  // For those exceptions where entanglement is semantically important, like\n  // useMutableSource, we should ensure that there is no partial work at the\n  // time we apply the entanglement.\n\n\n  var entangledLanes = root.entangledLanes;\n\n  if (entangledLanes !== NoLanes) {\n    var entanglements = root.entanglements;\n    var lanes = nextLanes & entangledLanes;\n\n    while (lanes > 0) {\n      var index = pickArbitraryLaneIndex(lanes);\n      var lane = 1 << index;\n      nextLanes |= entanglements[index];\n      lanes &= ~lane;\n    }\n  }\n\n  return nextLanes;\n}\nfunction getMostRecentEventTime(root, lanes) {\n  var eventTimes = root.eventTimes;\n  var mostRecentEventTime = NoTimestamp;\n\n  while (lanes > 0) {\n    var index = pickArbitraryLaneIndex(lanes);\n    var lane = 1 << index;\n    var eventTime = eventTimes[index];\n\n    if (eventTime > mostRecentEventTime) {\n      mostRecentEventTime = eventTime;\n    }\n\n    lanes &= ~lane;\n  }\n\n  return mostRecentEventTime;\n}\n\nfunction computeExpirationTime(lane, currentTime) {\n  switch (lane) {\n    case SyncLane:\n    case InputContinuousHydrationLane:\n    case InputContinuousLane:\n      // User interactions should expire slightly more quickly.\n      //\n      // NOTE: This is set to the corresponding constant as in Scheduler.js.\n      // When we made it larger, a product metric in www regressed, suggesting\n      // there's a user interaction that's being starved by a series of\n      // synchronous updates. If that theory is correct, the proper solution is\n      // to fix the starvation. However, this scenario supports the idea that\n      // expiration times are an important safeguard when starvation\n      // does happen.\n      return currentTime + 250;\n\n    case DefaultHydrationLane:\n    case DefaultLane:\n    case TransitionHydrationLane:\n    case TransitionLane1:\n    case TransitionLane2:\n    case TransitionLane3:\n    case TransitionLane4:\n    case TransitionLane5:\n    case TransitionLane6:\n    case TransitionLane7:\n    case TransitionLane8:\n    case TransitionLane9:\n    case TransitionLane10:\n    case TransitionLane11:\n    case TransitionLane12:\n    case TransitionLane13:\n    case TransitionLane14:\n    case TransitionLane15:\n    case TransitionLane16:\n      return currentTime + 5000;\n\n    case RetryLane1:\n    case RetryLane2:\n    case RetryLane3:\n    case RetryLane4:\n    case RetryLane5:\n      // TODO: Retries should be allowed to expire if they are CPU bound for\n      // too long, but when I made this change it caused a spike in browser\n      // crashes. There must be some other underlying bug; not super urgent but\n      // ideally should figure out why and fix it. Unfortunately we don't have\n      // a repro for the crashes, only detected via production metrics.\n      return NoTimestamp;\n\n    case SelectiveHydrationLane:\n    case IdleHydrationLane:\n    case IdleLane:\n    case OffscreenLane:\n      // Anything idle priority or lower should never expire.\n      return NoTimestamp;\n\n    default:\n      {\n        error('Should have found matching lanes. This is a bug in React.');\n      }\n\n      return NoTimestamp;\n  }\n}\n\nfunction markStarvedLanesAsExpired(root, currentTime) {\n  // TODO: This gets called every time we yield. We can optimize by storing\n  // the earliest expiration time on the root. Then use that to quickly bail out\n  // of this function.\n  var pendingLanes = root.pendingLanes;\n  var suspendedLanes = root.suspendedLanes;\n  var pingedLanes = root.pingedLanes;\n  var expirationTimes = root.expirationTimes; // Iterate through the pending lanes and check if we've reached their\n  // expiration time. If so, we'll assume the update is being starved and mark\n  // it as expired to force it to finish.\n\n  var lanes = pendingLanes;\n\n  while (lanes > 0) {\n    var index = pickArbitraryLaneIndex(lanes);\n    var lane = 1 << index;\n    var expirationTime = expirationTimes[index];\n\n    if (expirationTime === NoTimestamp) {\n      // Found a pending lane with no expiration time. If it's not suspended, or\n      // if it's pinged, assume it's CPU-bound. Compute a new expiration time\n      // using the current time.\n      if ((lane & suspendedLanes) === NoLanes || (lane & pingedLanes) !== NoLanes) {\n        // Assumes timestamps are monotonically increasing.\n        expirationTimes[index] = computeExpirationTime(lane, currentTime);\n      }\n    } else if (expirationTime <= currentTime) {\n      // This lane expired\n      root.expiredLanes |= lane;\n    }\n\n    lanes &= ~lane;\n  }\n} // This returns the highest priority pending lanes regardless of whether they\n// are suspended.\n\nfunction getHighestPriorityPendingLanes(root) {\n  return getHighestPriorityLanes(root.pendingLanes);\n}\nfunction getLanesToRetrySynchronouslyOnError(root) {\n  var everythingButOffscreen = root.pendingLanes & ~OffscreenLane;\n\n  if (everythingButOffscreen !== NoLanes) {\n    return everythingButOffscreen;\n  }\n\n  if (everythingButOffscreen & OffscreenLane) {\n    return OffscreenLane;\n  }\n\n  return NoLanes;\n}\nfunction includesSyncLane(lanes) {\n  return (lanes & SyncLane) !== NoLanes;\n}\nfunction includesNonIdleWork(lanes) {\n  return (lanes & NonIdleLanes) !== NoLanes;\n}\nfunction includesOnlyRetries(lanes) {\n  return (lanes & RetryLanes) === lanes;\n}\nfunction includesOnlyNonUrgentLanes(lanes) {\n  var UrgentLanes = SyncLane | InputContinuousLane | DefaultLane;\n  return (lanes & UrgentLanes) === NoLanes;\n}\nfunction includesOnlyTransitions(lanes) {\n  return (lanes & TransitionLanes) === lanes;\n}\nfunction includesBlockingLane(root, lanes) {\n\n  var SyncDefaultLanes = InputContinuousHydrationLane | InputContinuousLane | DefaultHydrationLane | DefaultLane;\n  return (lanes & SyncDefaultLanes) !== NoLanes;\n}\nfunction includesExpiredLane(root, lanes) {\n  // This is a separate check from includesBlockingLane because a lane can\n  // expire after a render has already started.\n  return (lanes & root.expiredLanes) !== NoLanes;\n}\nfunction isTransitionLane(lane) {\n  return (lane & TransitionLanes) !== NoLanes;\n}\nfunction claimNextTransitionLane() {\n  // Cycle through the lanes, assigning each new transition to the next lane.\n  // In most cases, this means every transition gets its own lane, until we\n  // run out of lanes and cycle back to the beginning.\n  var lane = nextTransitionLane;\n  nextTransitionLane <<= 1;\n\n  if ((nextTransitionLane & TransitionLanes) === NoLanes) {\n    nextTransitionLane = TransitionLane1;\n  }\n\n  return lane;\n}\nfunction claimNextRetryLane() {\n  var lane = nextRetryLane;\n  nextRetryLane <<= 1;\n\n  if ((nextRetryLane & RetryLanes) === NoLanes) {\n    nextRetryLane = RetryLane1;\n  }\n\n  return lane;\n}\nfunction getHighestPriorityLane(lanes) {\n  return lanes & -lanes;\n}\nfunction pickArbitraryLane(lanes) {\n  // This wrapper function gets inlined. Only exists so to communicate that it\n  // doesn't matter which bit is selected; you can pick any bit without\n  // affecting the algorithms where its used. Here I'm using\n  // getHighestPriorityLane because it requires the fewest operations.\n  return getHighestPriorityLane(lanes);\n}\n\nfunction pickArbitraryLaneIndex(lanes) {\n  return 31 - clz32(lanes);\n}\n\nfunction laneToIndex(lane) {\n  return pickArbitraryLaneIndex(lane);\n}\n\nfunction includesSomeLane(a, b) {\n  return (a & b) !== NoLanes;\n}\nfunction isSubsetOfLanes(set, subset) {\n  return (set & subset) === subset;\n}\nfunction mergeLanes(a, b) {\n  return a | b;\n}\nfunction removeLanes(set, subset) {\n  return set & ~subset;\n}\nfunction intersectLanes(a, b) {\n  return a & b;\n} // Seems redundant, but it changes the type from a single lane (used for\n// updates) to a group of lanes (used for flushing work).\n\nfunction laneToLanes(lane) {\n  return lane;\n}\nfunction higherPriorityLane(a, b) {\n  // This works because the bit ranges decrease in priority as you go left.\n  return a !== NoLane && a < b ? a : b;\n}\nfunction createLaneMap(initial) {\n  // Intentionally pushing one by one.\n  // https://v8.dev/blog/elements-kinds#avoid-creating-holes\n  var laneMap = [];\n\n  for (var i = 0; i < TotalLanes; i++) {\n    laneMap.push(initial);\n  }\n\n  return laneMap;\n}\nfunction markRootUpdated(root, updateLane, eventTime) {\n  root.pendingLanes |= updateLane; // If there are any suspended transitions, it's possible this new update\n  // could unblock them. Clear the suspended lanes so that we can try rendering\n  // them again.\n  //\n  // TODO: We really only need to unsuspend only lanes that are in the\n  // `subtreeLanes` of the updated fiber, or the update lanes of the return\n  // path. This would exclude suspended updates in an unrelated sibling tree,\n  // since there's no way for this update to unblock it.\n  //\n  // We don't do this if the incoming update is idle, because we never process\n  // idle updates until after all the regular updates have finished; there's no\n  // way it could unblock a transition.\n\n  if (updateLane !== IdleLane) {\n    root.suspendedLanes = NoLanes;\n    root.pingedLanes = NoLanes;\n  }\n\n  var eventTimes = root.eventTimes;\n  var index = laneToIndex(updateLane); // We can always overwrite an existing timestamp because we prefer the most\n  // recent event, and we assume time is monotonically increasing.\n\n  eventTimes[index] = eventTime;\n}\nfunction markRootSuspended(root, suspendedLanes) {\n  root.suspendedLanes |= suspendedLanes;\n  root.pingedLanes &= ~suspendedLanes; // The suspended lanes are no longer CPU-bound. Clear their expiration times.\n\n  var expirationTimes = root.expirationTimes;\n  var lanes = suspendedLanes;\n\n  while (lanes > 0) {\n    var index = pickArbitraryLaneIndex(lanes);\n    var lane = 1 << index;\n    expirationTimes[index] = NoTimestamp;\n    lanes &= ~lane;\n  }\n}\nfunction markRootPinged(root, pingedLanes, eventTime) {\n  root.pingedLanes |= root.suspendedLanes & pingedLanes;\n}\nfunction markRootFinished(root, remainingLanes) {\n  var noLongerPendingLanes = root.pendingLanes & ~remainingLanes;\n  root.pendingLanes = remainingLanes; // Let's try everything again\n\n  root.suspendedLanes = NoLanes;\n  root.pingedLanes = NoLanes;\n  root.expiredLanes &= remainingLanes;\n  root.mutableReadLanes &= remainingLanes;\n  root.entangledLanes &= remainingLanes;\n  var entanglements = root.entanglements;\n  var eventTimes = root.eventTimes;\n  var expirationTimes = root.expirationTimes; // Clear the lanes that no longer have pending work\n\n  var lanes = noLongerPendingLanes;\n\n  while (lanes > 0) {\n    var index = pickArbitraryLaneIndex(lanes);\n    var lane = 1 << index;\n    entanglements[index] = NoLanes;\n    eventTimes[index] = NoTimestamp;\n    expirationTimes[index] = NoTimestamp;\n    lanes &= ~lane;\n  }\n}\nfunction markRootEntangled(root, entangledLanes) {\n  // In addition to entangling each of the given lanes with each other, we also\n  // have to consider _transitive_ entanglements. For each lane that is already\n  // entangled with *any* of the given lanes, that lane is now transitively\n  // entangled with *all* the given lanes.\n  //\n  // Translated: If C is entangled with A, then entangling A with B also\n  // entangles C with B.\n  //\n  // If this is hard to grasp, it might help to intentionally break this\n  // function and look at the tests that fail in ReactTransition-test.js. Try\n  // commenting out one of the conditions below.\n  var rootEntangledLanes = root.entangledLanes |= entangledLanes;\n  var entanglements = root.entanglements;\n  var lanes = rootEntangledLanes;\n\n  while (lanes) {\n    var index = pickArbitraryLaneIndex(lanes);\n    var lane = 1 << index;\n\n    if ( // Is this one of the newly entangled lanes?\n    lane & entangledLanes | // Is this lane transitively entangled with the newly entangled lanes?\n    entanglements[index] & entangledLanes) {\n      entanglements[index] |= entangledLanes;\n    }\n\n    lanes &= ~lane;\n  }\n}\nfunction getBumpedLaneForHydration(root, renderLanes) {\n  var renderLane = getHighestPriorityLane(renderLanes);\n  var lane;\n\n  switch (renderLane) {\n    case InputContinuousLane:\n      lane = InputContinuousHydrationLane;\n      break;\n\n    case DefaultLane:\n      lane = DefaultHydrationLane;\n      break;\n\n    case TransitionLane1:\n    case TransitionLane2:\n    case TransitionLane3:\n    case TransitionLane4:\n    case TransitionLane5:\n    case TransitionLane6:\n    case TransitionLane7:\n    case TransitionLane8:\n    case TransitionLane9:\n    case TransitionLane10:\n    case TransitionLane11:\n    case TransitionLane12:\n    case TransitionLane13:\n    case TransitionLane14:\n    case TransitionLane15:\n    case TransitionLane16:\n    case RetryLane1:\n    case RetryLane2:\n    case RetryLane3:\n    case RetryLane4:\n    case RetryLane5:\n      lane = TransitionHydrationLane;\n      break;\n\n    case IdleLane:\n      lane = IdleHydrationLane;\n      break;\n\n    default:\n      // Everything else is already either a hydration lane, or shouldn't\n      // be retried at a hydration lane.\n      lane = NoLane;\n      break;\n  } // Check if the lane we chose is suspended. If so, that indicates that we\n  // already attempted and failed to hydrate at that level. Also check if we're\n  // already rendering that lane, which is rare but could happen.\n\n\n  if ((lane & (root.suspendedLanes | renderLanes)) !== NoLane) {\n    // Give up trying to hydrate and fall back to client render.\n    return NoLane;\n  }\n\n  return lane;\n}\nfunction addFiberToLanesMap(root, fiber, lanes) {\n\n  if (!isDevToolsPresent) {\n    return;\n  }\n\n  var pendingUpdatersLaneMap = root.pendingUpdatersLaneMap;\n\n  while (lanes > 0) {\n    var index = laneToIndex(lanes);\n    var lane = 1 << index;\n    var updaters = pendingUpdatersLaneMap[index];\n    updaters.add(fiber);\n    lanes &= ~lane;\n  }\n}\nfunction movePendingFibersToMemoized(root, lanes) {\n\n  if (!isDevToolsPresent) {\n    return;\n  }\n\n  var pendingUpdatersLaneMap = root.pendingUpdatersLaneMap;\n  var memoizedUpdaters = root.memoizedUpdaters;\n\n  while (lanes > 0) {\n    var index = laneToIndex(lanes);\n    var lane = 1 << index;\n    var updaters = pendingUpdatersLaneMap[index];\n\n    if (updaters.size > 0) {\n      updaters.forEach(function (fiber) {\n        var alternate = fiber.alternate;\n\n        if (alternate === null || !memoizedUpdaters.has(alternate)) {\n          memoizedUpdaters.add(fiber);\n        }\n      });\n      updaters.clear();\n    }\n\n    lanes &= ~lane;\n  }\n}\nfunction getTransitionsForLanes(root, lanes) {\n  {\n    return null;\n  }\n}\n\nvar DiscreteEventPriority = SyncLane;\nvar ContinuousEventPriority = InputContinuousLane;\nvar DefaultEventPriority = DefaultLane;\nvar IdleEventPriority = IdleLane;\nvar currentUpdatePriority = NoLane;\nfunction getCurrentUpdatePriority() {\n  return currentUpdatePriority;\n}\nfunction setCurrentUpdatePriority(newPriority) {\n  currentUpdatePriority = newPriority;\n}\nfunction runWithPriority(priority, fn) {\n  var previousPriority = currentUpdatePriority;\n\n  try {\n    currentUpdatePriority = priority;\n    return fn();\n  } finally {\n    currentUpdatePriority = previousPriority;\n  }\n}\nfunction higherEventPriority(a, b) {\n  return a !== 0 && a < b ? a : b;\n}\nfunction lowerEventPriority(a, b) {\n  return a === 0 || a > b ? a : b;\n}\nfunction isHigherEventPriority(a, b) {\n  return a !== 0 && a < b;\n}\nfunction lanesToEventPriority(lanes) {\n  var lane = getHighestPriorityLane(lanes);\n\n  if (!isHigherEventPriority(DiscreteEventPriority, lane)) {\n    return DiscreteEventPriority;\n  }\n\n  if (!isHigherEventPriority(ContinuousEventPriority, lane)) {\n    return ContinuousEventPriority;\n  }\n\n  if (includesNonIdleWork(lane)) {\n    return DefaultEventPriority;\n  }\n\n  return IdleEventPriority;\n}\n\n// This is imported by the event replaying implementation in React DOM. It's\n// in a separate file to break a circular dependency between the renderer and\n// the reconciler.\nfunction isRootDehydrated(root) {\n  var currentState = root.current.memoizedState;\n  return currentState.isDehydrated;\n}\n\nvar _attemptSynchronousHydration;\n\nfunction setAttemptSynchronousHydration(fn) {\n  _attemptSynchronousHydration = fn;\n}\nfunction attemptSynchronousHydration(fiber) {\n  _attemptSynchronousHydration(fiber);\n}\nvar attemptContinuousHydration;\nfunction setAttemptContinuousHydration(fn) {\n  attemptContinuousHydration = fn;\n}\nvar attemptHydrationAtCurrentPriority;\nfunction setAttemptHydrationAtCurrentPriority(fn) {\n  attemptHydrationAtCurrentPriority = fn;\n}\nvar getCurrentUpdatePriority$1;\nfunction setGetCurrentUpdatePriority(fn) {\n  getCurrentUpdatePriority$1 = fn;\n}\nvar attemptHydrationAtPriority;\nfunction setAttemptHydrationAtPriority(fn) {\n  attemptHydrationAtPriority = fn;\n} // TODO: Upgrade this definition once we're on a newer version of Flow that\n// has this definition built-in.\n\nvar hasScheduledReplayAttempt = false; // The queue of discrete events to be replayed.\n\nvar queuedDiscreteEvents = []; // Indicates if any continuous event targets are non-null for early bailout.\n// if the last target was dehydrated.\n\nvar queuedFocus = null;\nvar queuedDrag = null;\nvar queuedMouse = null; // For pointer events there can be one latest event per pointerId.\n\nvar queuedPointers = new Map();\nvar queuedPointerCaptures = new Map(); // We could consider replaying selectionchange and touchmoves too.\n\nvar queuedExplicitHydrationTargets = [];\nvar discreteReplayableEvents = ['mousedown', 'mouseup', 'touchcancel', 'touchend', 'touchstart', 'auxclick', 'dblclick', 'pointercancel', 'pointerdown', 'pointerup', 'dragend', 'dragstart', 'drop', 'compositionend', 'compositionstart', 'keydown', 'keypress', 'keyup', 'input', 'textInput', // Intentionally camelCase\n'copy', 'cut', 'paste', 'click', 'change', 'contextmenu', 'reset', 'submit'];\nfunction isDiscreteEventThatRequiresHydration(eventType) {\n  return discreteReplayableEvents.indexOf(eventType) > -1;\n}\n\nfunction createQueuedReplayableEvent(blockedOn, domEventName, eventSystemFlags, targetContainer, nativeEvent) {\n  return {\n    blockedOn: blockedOn,\n    domEventName: domEventName,\n    eventSystemFlags: eventSystemFlags,\n    nativeEvent: nativeEvent,\n    targetContainers: [targetContainer]\n  };\n}\n\nfunction clearIfContinuousEvent(domEventName, nativeEvent) {\n  switch (domEventName) {\n    case 'focusin':\n    case 'focusout':\n      queuedFocus = null;\n      break;\n\n    case 'dragenter':\n    case 'dragleave':\n      queuedDrag = null;\n      break;\n\n    case 'mouseover':\n    case 'mouseout':\n      queuedMouse = null;\n      break;\n\n    case 'pointerover':\n    case 'pointerout':\n      {\n        var pointerId = nativeEvent.pointerId;\n        queuedPointers.delete(pointerId);\n        break;\n      }\n\n    case 'gotpointercapture':\n    case 'lostpointercapture':\n      {\n        var _pointerId = nativeEvent.pointerId;\n        queuedPointerCaptures.delete(_pointerId);\n        break;\n      }\n  }\n}\n\nfunction accumulateOrCreateContinuousQueuedReplayableEvent(existingQueuedEvent, blockedOn, domEventName, eventSystemFlags, targetContainer, nativeEvent) {\n  if (existingQueuedEvent === null || existingQueuedEvent.nativeEvent !== nativeEvent) {\n    var queuedEvent = createQueuedReplayableEvent(blockedOn, domEventName, eventSystemFlags, targetContainer, nativeEvent);\n\n    if (blockedOn !== null) {\n      var _fiber2 = getInstanceFromNode(blockedOn);\n\n      if (_fiber2 !== null) {\n        // Attempt to increase the priority of this target.\n        attemptContinuousHydration(_fiber2);\n      }\n    }\n\n    return queuedEvent;\n  } // If we have already queued this exact event, then it's because\n  // the different event systems have different DOM event listeners.\n  // We can accumulate the flags, and the targetContainers, and\n  // store a single event to be replayed.\n\n\n  existingQueuedEvent.eventSystemFlags |= eventSystemFlags;\n  var targetContainers = existingQueuedEvent.targetContainers;\n\n  if (targetContainer !== null && targetContainers.indexOf(targetContainer) === -1) {\n    targetContainers.push(targetContainer);\n  }\n\n  return existingQueuedEvent;\n}\n\nfunction queueIfContinuousEvent(blockedOn, domEventName, eventSystemFlags, targetContainer, nativeEvent) {\n  // These set relatedTarget to null because the replayed event will be treated as if we\n  // moved from outside the window (no target) onto the target once it hydrates.\n  // Instead of mutating we could clone the event.\n  switch (domEventName) {\n    case 'focusin':\n      {\n        var focusEvent = nativeEvent;\n        queuedFocus = accumulateOrCreateContinuousQueuedReplayableEvent(queuedFocus, blockedOn, domEventName, eventSystemFlags, targetContainer, focusEvent);\n        return true;\n      }\n\n    case 'dragenter':\n      {\n        var dragEvent = nativeEvent;\n        queuedDrag = accumulateOrCreateContinuousQueuedReplayableEvent(queuedDrag, blockedOn, domEventName, eventSystemFlags, targetContainer, dragEvent);\n        return true;\n      }\n\n    case 'mouseover':\n      {\n        var mouseEvent = nativeEvent;\n        queuedMouse = accumulateOrCreateContinuousQueuedReplayableEvent(queuedMouse, blockedOn, domEventName, eventSystemFlags, targetContainer, mouseEvent);\n        return true;\n      }\n\n    case 'pointerover':\n      {\n        var pointerEvent = nativeEvent;\n        var pointerId = pointerEvent.pointerId;\n        queuedPointers.set(pointerId, accumulateOrCreateContinuousQueuedReplayableEvent(queuedPointers.get(pointerId) || null, blockedOn, domEventName, eventSystemFlags, targetContainer, pointerEvent));\n        return true;\n      }\n\n    case 'gotpointercapture':\n      {\n        var _pointerEvent = nativeEvent;\n        var _pointerId2 = _pointerEvent.pointerId;\n        queuedPointerCaptures.set(_pointerId2, accumulateOrCreateContinuousQueuedReplayableEvent(queuedPointerCaptures.get(_pointerId2) || null, blockedOn, domEventName, eventSystemFlags, targetContainer, _pointerEvent));\n        return true;\n      }\n  }\n\n  return false;\n} // Check if this target is unblocked. Returns true if it's unblocked.\n\nfunction attemptExplicitHydrationTarget(queuedTarget) {\n  // TODO: This function shares a lot of logic with findInstanceBlockingEvent.\n  // Try to unify them. It's a bit tricky since it would require two return\n  // values.\n  var targetInst = getClosestInstanceFromNode(queuedTarget.target);\n\n  if (targetInst !== null) {\n    var nearestMounted = getNearestMountedFiber(targetInst);\n\n    if (nearestMounted !== null) {\n      var tag = nearestMounted.tag;\n\n      if (tag === SuspenseComponent) {\n        var instance = getSuspenseInstanceFromFiber(nearestMounted);\n\n        if (instance !== null) {\n          // We're blocked on hydrating this boundary.\n          // Increase its priority.\n          queuedTarget.blockedOn = instance;\n          attemptHydrationAtPriority(queuedTarget.priority, function () {\n            attemptHydrationAtCurrentPriority(nearestMounted);\n          });\n          return;\n        }\n      } else if (tag === HostRoot) {\n        var root = nearestMounted.stateNode;\n\n        if (isRootDehydrated(root)) {\n          queuedTarget.blockedOn = getContainerFromFiber(nearestMounted); // We don't currently have a way to increase the priority of\n          // a root other than sync.\n\n          return;\n        }\n      }\n    }\n  }\n\n  queuedTarget.blockedOn = null;\n}\n\nfunction queueExplicitHydrationTarget(target) {\n  // TODO: This will read the priority if it's dispatched by the React\n  // event system but not native events. Should read window.event.type, like\n  // we do for updates (getCurrentEventPriority).\n  var updatePriority = getCurrentUpdatePriority$1();\n  var queuedTarget = {\n    blockedOn: null,\n    target: target,\n    priority: updatePriority\n  };\n  var i = 0;\n\n  for (; i < queuedExplicitHydrationTargets.length; i++) {\n    // Stop once we hit the first target with lower priority than\n    if (!isHigherEventPriority(updatePriority, queuedExplicitHydrationTargets[i].priority)) {\n      break;\n    }\n  }\n\n  queuedExplicitHydrationTargets.splice(i, 0, queuedTarget);\n\n  if (i === 0) {\n    attemptExplicitHydrationTarget(queuedTarget);\n  }\n}\n\nfunction attemptReplayContinuousQueuedEvent(queuedEvent) {\n  if (queuedEvent.blockedOn !== null) {\n    return false;\n  }\n\n  var targetContainers = queuedEvent.targetContainers;\n\n  while (targetContainers.length > 0) {\n    var targetContainer = targetContainers[0];\n    var nextBlockedOn = findInstanceBlockingEvent(queuedEvent.domEventName, queuedEvent.eventSystemFlags, targetContainer, queuedEvent.nativeEvent);\n\n    if (nextBlockedOn === null) {\n      {\n        var nativeEvent = queuedEvent.nativeEvent;\n        var nativeEventClone = new nativeEvent.constructor(nativeEvent.type, nativeEvent);\n        setReplayingEvent(nativeEventClone);\n        nativeEvent.target.dispatchEvent(nativeEventClone);\n        resetReplayingEvent();\n      }\n    } else {\n      // We're still blocked. Try again later.\n      var _fiber3 = getInstanceFromNode(nextBlockedOn);\n\n      if (_fiber3 !== null) {\n        attemptContinuousHydration(_fiber3);\n      }\n\n      queuedEvent.blockedOn = nextBlockedOn;\n      return false;\n    } // This target container was successfully dispatched. Try the next.\n\n\n    targetContainers.shift();\n  }\n\n  return true;\n}\n\nfunction attemptReplayContinuousQueuedEventInMap(queuedEvent, key, map) {\n  if (attemptReplayContinuousQueuedEvent(queuedEvent)) {\n    map.delete(key);\n  }\n}\n\nfunction replayUnblockedEvents() {\n  hasScheduledReplayAttempt = false;\n\n\n  if (queuedFocus !== null && attemptReplayContinuousQueuedEvent(queuedFocus)) {\n    queuedFocus = null;\n  }\n\n  if (queuedDrag !== null && attemptReplayContinuousQueuedEvent(queuedDrag)) {\n    queuedDrag = null;\n  }\n\n  if (queuedMouse !== null && attemptReplayContinuousQueuedEvent(queuedMouse)) {\n    queuedMouse = null;\n  }\n\n  queuedPointers.forEach(attemptReplayContinuousQueuedEventInMap);\n  queuedPointerCaptures.forEach(attemptReplayContinuousQueuedEventInMap);\n}\n\nfunction scheduleCallbackIfUnblocked(queuedEvent, unblocked) {\n  if (queuedEvent.blockedOn === unblocked) {\n    queuedEvent.blockedOn = null;\n\n    if (!hasScheduledReplayAttempt) {\n      hasScheduledReplayAttempt = true; // Schedule a callback to attempt replaying as many events as are\n      // now unblocked. This first might not actually be unblocked yet.\n      // We could check it early to avoid scheduling an unnecessary callback.\n\n      Scheduler.unstable_scheduleCallback(Scheduler.unstable_NormalPriority, replayUnblockedEvents);\n    }\n  }\n}\n\nfunction retryIfBlockedOn(unblocked) {\n  // Mark anything that was blocked on this as no longer blocked\n  // and eligible for a replay.\n  if (queuedDiscreteEvents.length > 0) {\n    scheduleCallbackIfUnblocked(queuedDiscreteEvents[0], unblocked); // This is a exponential search for each boundary that commits. I think it's\n    // worth it because we expect very few discrete events to queue up and once\n    // we are actually fully unblocked it will be fast to replay them.\n\n    for (var i = 1; i < queuedDiscreteEvents.length; i++) {\n      var queuedEvent = queuedDiscreteEvents[i];\n\n      if (queuedEvent.blockedOn === unblocked) {\n        queuedEvent.blockedOn = null;\n      }\n    }\n  }\n\n  if (queuedFocus !== null) {\n    scheduleCallbackIfUnblocked(queuedFocus, unblocked);\n  }\n\n  if (queuedDrag !== null) {\n    scheduleCallbackIfUnblocked(queuedDrag, unblocked);\n  }\n\n  if (queuedMouse !== null) {\n    scheduleCallbackIfUnblocked(queuedMouse, unblocked);\n  }\n\n  var unblock = function (queuedEvent) {\n    return scheduleCallbackIfUnblocked(queuedEvent, unblocked);\n  };\n\n  queuedPointers.forEach(unblock);\n  queuedPointerCaptures.forEach(unblock);\n\n  for (var _i = 0; _i < queuedExplicitHydrationTargets.length; _i++) {\n    var queuedTarget = queuedExplicitHydrationTargets[_i];\n\n    if (queuedTarget.blockedOn === unblocked) {\n      queuedTarget.blockedOn = null;\n    }\n  }\n\n  while (queuedExplicitHydrationTargets.length > 0) {\n    var nextExplicitTarget = queuedExplicitHydrationTargets[0];\n\n    if (nextExplicitTarget.blockedOn !== null) {\n      // We're still blocked.\n      break;\n    } else {\n      attemptExplicitHydrationTarget(nextExplicitTarget);\n\n      if (nextExplicitTarget.blockedOn === null) {\n        // We're unblocked.\n        queuedExplicitHydrationTargets.shift();\n      }\n    }\n  }\n}\n\nvar ReactCurrentBatchConfig = ReactSharedInternals.ReactCurrentBatchConfig; // TODO: can we stop exporting these?\n\nvar _enabled = true; // This is exported in FB builds for use by legacy FB layer infra.\n// We'd like to remove this but it's not clear if this is safe.\n\nfunction setEnabled(enabled) {\n  _enabled = !!enabled;\n}\nfunction isEnabled() {\n  return _enabled;\n}\nfunction createEventListenerWrapperWithPriority(targetContainer, domEventName, eventSystemFlags) {\n  var eventPriority = getEventPriority(domEventName);\n  var listenerWrapper;\n\n  switch (eventPriority) {\n    case DiscreteEventPriority:\n      listenerWrapper = dispatchDiscreteEvent;\n      break;\n\n    case ContinuousEventPriority:\n      listenerWrapper = dispatchContinuousEvent;\n      break;\n\n    case DefaultEventPriority:\n    default:\n      listenerWrapper = dispatchEvent;\n      break;\n  }\n\n  return listenerWrapper.bind(null, domEventName, eventSystemFlags, targetContainer);\n}\n\nfunction dispatchDiscreteEvent(domEventName, eventSystemFlags, container, nativeEvent) {\n  var previousPriority = getCurrentUpdatePriority();\n  var prevTransition = ReactCurrentBatchConfig.transition;\n  ReactCurrentBatchConfig.transition = null;\n\n  try {\n    setCurrentUpdatePriority(DiscreteEventPriority);\n    dispatchEvent(domEventName, eventSystemFlags, container, nativeEvent);\n  } finally {\n    setCurrentUpdatePriority(previousPriority);\n    ReactCurrentBatchConfig.transition = prevTransition;\n  }\n}\n\nfunction dispatchContinuousEvent(domEventName, eventSystemFlags, container, nativeEvent) {\n  var previousPriority = getCurrentUpdatePriority();\n  var prevTransition = ReactCurrentBatchConfig.transition;\n  ReactCurrentBatchConfig.transition = null;\n\n  try {\n    setCurrentUpdatePriority(ContinuousEventPriority);\n    dispatchEvent(domEventName, eventSystemFlags, container, nativeEvent);\n  } finally {\n    setCurrentUpdatePriority(previousPriority);\n    ReactCurrentBatchConfig.transition = prevTransition;\n  }\n}\n\nfunction dispatchEvent(domEventName, eventSystemFlags, targetContainer, nativeEvent) {\n  if (!_enabled) {\n    return;\n  }\n\n  {\n    dispatchEventWithEnableCapturePhaseSelectiveHydrationWithoutDiscreteEventReplay(domEventName, eventSystemFlags, targetContainer, nativeEvent);\n  }\n}\n\nfunction dispatchEventWithEnableCapturePhaseSelectiveHydrationWithoutDiscreteEventReplay(domEventName, eventSystemFlags, targetContainer, nativeEvent) {\n  var blockedOn = findInstanceBlockingEvent(domEventName, eventSystemFlags, targetContainer, nativeEvent);\n\n  if (blockedOn === null) {\n    dispatchEventForPluginEventSystem(domEventName, eventSystemFlags, nativeEvent, return_targetInst, targetContainer);\n    clearIfContinuousEvent(domEventName, nativeEvent);\n    return;\n  }\n\n  if (queueIfContinuousEvent(blockedOn, domEventName, eventSystemFlags, targetContainer, nativeEvent)) {\n    nativeEvent.stopPropagation();\n    return;\n  } // We need to clear only if we didn't queue because\n  // queueing is accumulative.\n\n\n  clearIfContinuousEvent(domEventName, nativeEvent);\n\n  if (eventSystemFlags & IS_CAPTURE_PHASE && isDiscreteEventThatRequiresHydration(domEventName)) {\n    while (blockedOn !== null) {\n      var fiber = getInstanceFromNode(blockedOn);\n\n      if (fiber !== null) {\n        attemptSynchronousHydration(fiber);\n      }\n\n      var nextBlockedOn = findInstanceBlockingEvent(domEventName, eventSystemFlags, targetContainer, nativeEvent);\n\n      if (nextBlockedOn === null) {\n        dispatchEventForPluginEventSystem(domEventName, eventSystemFlags, nativeEvent, return_targetInst, targetContainer);\n      }\n\n      if (nextBlockedOn === blockedOn) {\n        break;\n      }\n\n      blockedOn = nextBlockedOn;\n    }\n\n    if (blockedOn !== null) {\n      nativeEvent.stopPropagation();\n    }\n\n    return;\n  } // This is not replayable so we'll invoke it but without a target,\n  // in case the event system needs to trace it.\n\n\n  dispatchEventForPluginEventSystem(domEventName, eventSystemFlags, nativeEvent, null, targetContainer);\n}\n\nvar return_targetInst = null; // Returns a SuspenseInstance or Container if it's blocked.\n// The return_targetInst field above is conceptually part of the return value.\n\nfunction findInstanceBlockingEvent(domEventName, eventSystemFlags, targetContainer, nativeEvent) {\n  // TODO: Warn if _enabled is false.\n  return_targetInst = null;\n  var nativeEventTarget = getEventTarget(nativeEvent);\n  var targetInst = getClosestInstanceFromNode(nativeEventTarget);\n\n  if (targetInst !== null) {\n    var nearestMounted = getNearestMountedFiber(targetInst);\n\n    if (nearestMounted === null) {\n      // This tree has been unmounted already. Dispatch without a target.\n      targetInst = null;\n    } else {\n      var tag = nearestMounted.tag;\n\n      if (tag === SuspenseComponent) {\n        var instance = getSuspenseInstanceFromFiber(nearestMounted);\n\n        if (instance !== null) {\n          // Queue the event to be replayed later. Abort dispatching since we\n          // don't want this event dispatched twice through the event system.\n          // TODO: If this is the first discrete event in the queue. Schedule an increased\n          // priority for this boundary.\n          return instance;\n        } // This shouldn't happen, something went wrong but to avoid blocking\n        // the whole system, dispatch the event without a target.\n        // TODO: Warn.\n\n\n        targetInst = null;\n      } else if (tag === HostRoot) {\n        var root = nearestMounted.stateNode;\n\n        if (isRootDehydrated(root)) {\n          // If this happens during a replay something went wrong and it might block\n          // the whole system.\n          return getContainerFromFiber(nearestMounted);\n        }\n\n        targetInst = null;\n      } else if (nearestMounted !== targetInst) {\n        // If we get an event (ex: img onload) before committing that\n        // component's mount, ignore it for now (that is, treat it as if it was an\n        // event on a non-React tree). We might also consider queueing events and\n        // dispatching them after the mount.\n        targetInst = null;\n      }\n    }\n  }\n\n  return_targetInst = targetInst; // We're not blocked on anything.\n\n  return null;\n}\nfunction getEventPriority(domEventName) {\n  switch (domEventName) {\n    // Used by SimpleEventPlugin:\n    case 'cancel':\n    case 'click':\n    case 'close':\n    case 'contextmenu':\n    case 'copy':\n    case 'cut':\n    case 'auxclick':\n    case 'dblclick':\n    case 'dragend':\n    case 'dragstart':\n    case 'drop':\n    case 'focusin':\n    case 'focusout':\n    case 'input':\n    case 'invalid':\n    case 'keydown':\n    case 'keypress':\n    case 'keyup':\n    case 'mousedown':\n    case 'mouseup':\n    case 'paste':\n    case 'pause':\n    case 'play':\n    case 'pointercancel':\n    case 'pointerdown':\n    case 'pointerup':\n    case 'ratechange':\n    case 'reset':\n    case 'resize':\n    case 'seeked':\n    case 'submit':\n    case 'touchcancel':\n    case 'touchend':\n    case 'touchstart':\n    case 'volumechange': // Used by polyfills:\n    // eslint-disable-next-line no-fallthrough\n\n    case 'change':\n    case 'selectionchange':\n    case 'textInput':\n    case 'compositionstart':\n    case 'compositionend':\n    case 'compositionupdate': // Only enableCreateEventHandleAPI:\n    // eslint-disable-next-line no-fallthrough\n\n    case 'beforeblur':\n    case 'afterblur': // Not used by React but could be by user code:\n    // eslint-disable-next-line no-fallthrough\n\n    case 'beforeinput':\n    case 'blur':\n    case 'fullscreenchange':\n    case 'focus':\n    case 'hashchange':\n    case 'popstate':\n    case 'select':\n    case 'selectstart':\n      return DiscreteEventPriority;\n\n    case 'drag':\n    case 'dragenter':\n    case 'dragexit':\n    case 'dragleave':\n    case 'dragover':\n    case 'mousemove':\n    case 'mouseout':\n    case 'mouseover':\n    case 'pointermove':\n    case 'pointerout':\n    case 'pointerover':\n    case 'scroll':\n    case 'toggle':\n    case 'touchmove':\n    case 'wheel': // Not used by React but could be by user code:\n    // eslint-disable-next-line no-fallthrough\n\n    case 'mouseenter':\n    case 'mouseleave':\n    case 'pointerenter':\n    case 'pointerleave':\n      return ContinuousEventPriority;\n\n    case 'message':\n      {\n        // We might be in the Scheduler callback.\n        // Eventually this mechanism will be replaced by a check\n        // of the current priority on the native scheduler.\n        var schedulerPriority = getCurrentPriorityLevel();\n\n        switch (schedulerPriority) {\n          case ImmediatePriority:\n            return DiscreteEventPriority;\n\n          case UserBlockingPriority:\n            return ContinuousEventPriority;\n\n          case NormalPriority:\n          case LowPriority:\n            // TODO: Handle LowSchedulerPriority, somehow. Maybe the same lane as hydration.\n            return DefaultEventPriority;\n\n          case IdlePriority:\n            return IdleEventPriority;\n\n          default:\n            return DefaultEventPriority;\n        }\n      }\n\n    default:\n      return DefaultEventPriority;\n  }\n}\n\nfunction addEventBubbleListener(target, eventType, listener) {\n  target.addEventListener(eventType, listener, false);\n  return listener;\n}\nfunction addEventCaptureListener(target, eventType, listener) {\n  target.addEventListener(eventType, listener, true);\n  return listener;\n}\nfunction addEventCaptureListenerWithPassiveFlag(target, eventType, listener, passive) {\n  target.addEventListener(eventType, listener, {\n    capture: true,\n    passive: passive\n  });\n  return listener;\n}\nfunction addEventBubbleListenerWithPassiveFlag(target, eventType, listener, passive) {\n  target.addEventListener(eventType, listener, {\n    passive: passive\n  });\n  return listener;\n}\n\n/**\n * These variables store information about text content of a target node,\n * allowing comparison of content before and after a given event.\n *\n * Identify the node where selection currently begins, then observe\n * both its text content and its current position in the DOM. Since the\n * browser may natively replace the target node during composition, we can\n * use its position to find its replacement.\n *\n *\n */\nvar root = null;\nvar startText = null;\nvar fallbackText = null;\nfunction initialize(nativeEventTarget) {\n  root = nativeEventTarget;\n  startText = getText();\n  return true;\n}\nfunction reset() {\n  root = null;\n  startText = null;\n  fallbackText = null;\n}\nfunction getData() {\n  if (fallbackText) {\n    return fallbackText;\n  }\n\n  var start;\n  var startValue = startText;\n  var startLength = startValue.length;\n  var end;\n  var endValue = getText();\n  var endLength = endValue.length;\n\n  for (start = 0; start < startLength; start++) {\n    if (startValue[start] !== endValue[start]) {\n      break;\n    }\n  }\n\n  var minEnd = startLength - start;\n\n  for (end = 1; end <= minEnd; end++) {\n    if (startValue[startLength - end] !== endValue[endLength - end]) {\n      break;\n    }\n  }\n\n  var sliceTail = end > 1 ? 1 - end : undefined;\n  fallbackText = endValue.slice(start, sliceTail);\n  return fallbackText;\n}\nfunction getText() {\n  if ('value' in root) {\n    return root.value;\n  }\n\n  return root.textContent;\n}\n\n/**\n * `charCode` represents the actual \"character code\" and is safe to use with\n * `String.fromCharCode`. As such, only keys that correspond to printable\n * characters produce a valid `charCode`, the only exception to this is Enter.\n * The Tab-key is considered non-printable and does not have a `charCode`,\n * presumably because it does not produce a tab-character in browsers.\n *\n * @param {object} nativeEvent Native browser event.\n * @return {number} Normalized `charCode` property.\n */\nfunction getEventCharCode(nativeEvent) {\n  var charCode;\n  var keyCode = nativeEvent.keyCode;\n\n  if ('charCode' in nativeEvent) {\n    charCode = nativeEvent.charCode; // FF does not set `charCode` for the Enter-key, check against `keyCode`.\n\n    if (charCode === 0 && keyCode === 13) {\n      charCode = 13;\n    }\n  } else {\n    // IE8 does not implement `charCode`, but `keyCode` has the correct value.\n    charCode = keyCode;\n  } // IE and Edge (on Windows) and Chrome / Safari (on Windows and Linux)\n  // report Enter as charCode 10 when ctrl is pressed.\n\n\n  if (charCode === 10) {\n    charCode = 13;\n  } // Some non-printable keys are reported in `charCode`/`keyCode`, discard them.\n  // Must not discard the (non-)printable Enter-key.\n\n\n  if (charCode >= 32 || charCode === 13) {\n    return charCode;\n  }\n\n  return 0;\n}\n\nfunction functionThatReturnsTrue() {\n  return true;\n}\n\nfunction functionThatReturnsFalse() {\n  return false;\n} // This is intentionally a factory so that we have different returned constructors.\n// If we had a single constructor, it would be megamorphic and engines would deopt.\n\n\nfunction createSyntheticEvent(Interface) {\n  /**\n   * Synthetic events are dispatched by event plugins, typically in response to a\n   * top-level event delegation handler.\n   *\n   * These systems should generally use pooling to reduce the frequency of garbage\n   * collection. The system should check `isPersistent` to determine whether the\n   * event should be released into the pool after being dispatched. Users that\n   * need a persisted event should invoke `persist`.\n   *\n   * Synthetic events (and subclasses) implement the DOM Level 3 Events API by\n   * normalizing browser quirks. Subclasses do not necessarily have to implement a\n   * DOM interface; custom application-specific events can also subclass this.\n   */\n  function SyntheticBaseEvent(reactName, reactEventType, targetInst, nativeEvent, nativeEventTarget) {\n    this._reactName = reactName;\n    this._targetInst = targetInst;\n    this.type = reactEventType;\n    this.nativeEvent = nativeEvent;\n    this.target = nativeEventTarget;\n    this.currentTarget = null;\n\n    for (var _propName in Interface) {\n      if (!Interface.hasOwnProperty(_propName)) {\n        continue;\n      }\n\n      var normalize = Interface[_propName];\n\n      if (normalize) {\n        this[_propName] = normalize(nativeEvent);\n      } else {\n        this[_propName] = nativeEvent[_propName];\n      }\n    }\n\n    var defaultPrevented = nativeEvent.defaultPrevented != null ? nativeEvent.defaultPrevented : nativeEvent.returnValue === false;\n\n    if (defaultPrevented) {\n      this.isDefaultPrevented = functionThatReturnsTrue;\n    } else {\n      this.isDefaultPrevented = functionThatReturnsFalse;\n    }\n\n    this.isPropagationStopped = functionThatReturnsFalse;\n    return this;\n  }\n\n  assign(SyntheticBaseEvent.prototype, {\n    preventDefault: function () {\n      this.defaultPrevented = true;\n      var event = this.nativeEvent;\n\n      if (!event) {\n        return;\n      }\n\n      if (event.preventDefault) {\n        event.preventDefault(); // $FlowFixMe - flow is not aware of `unknown` in IE\n      } else if (typeof event.returnValue !== 'unknown') {\n        event.returnValue = false;\n      }\n\n      this.isDefaultPrevented = functionThatReturnsTrue;\n    },\n    stopPropagation: function () {\n      var event = this.nativeEvent;\n\n      if (!event) {\n        return;\n      }\n\n      if (event.stopPropagation) {\n        event.stopPropagation(); // $FlowFixMe - flow is not aware of `unknown` in IE\n      } else if (typeof event.cancelBubble !== 'unknown') {\n        // The ChangeEventPlugin registers a \"propertychange\" event for\n        // IE. This event does not support bubbling or cancelling, and\n        // any references to cancelBubble throw \"Member not found\".  A\n        // typeof check of \"unknown\" circumvents this issue (and is also\n        // IE specific).\n        event.cancelBubble = true;\n      }\n\n      this.isPropagationStopped = functionThatReturnsTrue;\n    },\n\n    /**\n     * We release all dispatched `SyntheticEvent`s after each event loop, adding\n     * them back into the pool. This allows a way to hold onto a reference that\n     * won't be added back into the pool.\n     */\n    persist: function () {// Modern event system doesn't use pooling.\n    },\n\n    /**\n     * Checks if this event should be released back into the pool.\n     *\n     * @return {boolean} True if this should not be released, false otherwise.\n     */\n    isPersistent: functionThatReturnsTrue\n  });\n  return SyntheticBaseEvent;\n}\n/**\n * @interface Event\n * @see http://www.w3.org/TR/DOM-Level-3-Events/\n */\n\n\nvar EventInterface = {\n  eventPhase: 0,\n  bubbles: 0,\n  cancelable: 0,\n  timeStamp: function (event) {\n    return event.timeStamp || Date.now();\n  },\n  defaultPrevented: 0,\n  isTrusted: 0\n};\nvar SyntheticEvent = createSyntheticEvent(EventInterface);\n\nvar UIEventInterface = assign({}, EventInterface, {\n  view: 0,\n  detail: 0\n});\n\nvar SyntheticUIEvent = createSyntheticEvent(UIEventInterface);\nvar lastMovementX;\nvar lastMovementY;\nvar lastMouseEvent;\n\nfunction updateMouseMovementPolyfillState(event) {\n  if (event !== lastMouseEvent) {\n    if (lastMouseEvent && event.type === 'mousemove') {\n      lastMovementX = event.screenX - lastMouseEvent.screenX;\n      lastMovementY = event.screenY - lastMouseEvent.screenY;\n    } else {\n      lastMovementX = 0;\n      lastMovementY = 0;\n    }\n\n    lastMouseEvent = event;\n  }\n}\n/**\n * @interface MouseEvent\n * @see http://www.w3.org/TR/DOM-Level-3-Events/\n */\n\n\nvar MouseEventInterface = assign({}, UIEventInterface, {\n  screenX: 0,\n  screenY: 0,\n  clientX: 0,\n  clientY: 0,\n  pageX: 0,\n  pageY: 0,\n  ctrlKey: 0,\n  shiftKey: 0,\n  altKey: 0,\n  metaKey: 0,\n  getModifierState: getEventModifierState,\n  button: 0,\n  buttons: 0,\n  relatedTarget: function (event) {\n    if (event.relatedTarget === undefined) return event.fromElement === event.srcElement ? event.toElement : event.fromElement;\n    return event.relatedTarget;\n  },\n  movementX: function (event) {\n    if ('movementX' in event) {\n      return event.movementX;\n    }\n\n    updateMouseMovementPolyfillState(event);\n    return lastMovementX;\n  },\n  movementY: function (event) {\n    if ('movementY' in event) {\n      return event.movementY;\n    } // Don't need to call updateMouseMovementPolyfillState() here\n    // because it's guaranteed to have already run when movementX\n    // was copied.\n\n\n    return lastMovementY;\n  }\n});\n\nvar SyntheticMouseEvent = createSyntheticEvent(MouseEventInterface);\n/**\n * @interface DragEvent\n * @see http://www.w3.org/TR/DOM-Level-3-Events/\n */\n\nvar DragEventInterface = assign({}, MouseEventInterface, {\n  dataTransfer: 0\n});\n\nvar SyntheticDragEvent = createSyntheticEvent(DragEventInterface);\n/**\n * @interface FocusEvent\n * @see http://www.w3.org/TR/DOM-Level-3-Events/\n */\n\nvar FocusEventInterface = assign({}, UIEventInterface, {\n  relatedTarget: 0\n});\n\nvar SyntheticFocusEvent = createSyntheticEvent(FocusEventInterface);\n/**\n * @interface Event\n * @see http://www.w3.org/TR/css3-animations/#AnimationEvent-interface\n * @see https://developer.mozilla.org/en-US/docs/Web/API/AnimationEvent\n */\n\nvar AnimationEventInterface = assign({}, EventInterface, {\n  animationName: 0,\n  elapsedTime: 0,\n  pseudoElement: 0\n});\n\nvar SyntheticAnimationEvent = createSyntheticEvent(AnimationEventInterface);\n/**\n * @interface Event\n * @see http://www.w3.org/TR/clipboard-apis/\n */\n\nvar ClipboardEventInterface = assign({}, EventInterface, {\n  clipboardData: function (event) {\n    return 'clipboardData' in event ? event.clipboardData : window.clipboardData;\n  }\n});\n\nvar SyntheticClipboardEvent = createSyntheticEvent(ClipboardEventInterface);\n/**\n * @interface Event\n * @see http://www.w3.org/TR/DOM-Level-3-Events/#events-compositionevents\n */\n\nvar CompositionEventInterface = assign({}, EventInterface, {\n  data: 0\n});\n\nvar SyntheticCompositionEvent = createSyntheticEvent(CompositionEventInterface);\n/**\n * @interface Event\n * @see http://www.w3.org/TR/2013/WD-DOM-Level-3-Events-20131105\n *      /#events-inputevents\n */\n// Happens to share the same list for now.\n\nvar SyntheticInputEvent = SyntheticCompositionEvent;\n/**\n * Normalization of deprecated HTML5 `key` values\n * @see https://developer.mozilla.org/en-US/docs/Web/API/KeyboardEvent#Key_names\n */\n\nvar normalizeKey = {\n  Esc: 'Escape',\n  Spacebar: ' ',\n  Left: 'ArrowLeft',\n  Up: 'ArrowUp',\n  Right: 'ArrowRight',\n  Down: 'ArrowDown',\n  Del: 'Delete',\n  Win: 'OS',\n  Menu: 'ContextMenu',\n  Apps: 'ContextMenu',\n  Scroll: 'ScrollLock',\n  MozPrintableKey: 'Unidentified'\n};\n/**\n * Translation from legacy `keyCode` to HTML5 `key`\n * Only special keys supported, all others depend on keyboard layout or browser\n * @see https://developer.mozilla.org/en-US/docs/Web/API/KeyboardEvent#Key_names\n */\n\nvar translateToKey = {\n  '8': 'Backspace',\n  '9': 'Tab',\n  '12': 'Clear',\n  '13': 'Enter',\n  '16': 'Shift',\n  '17': 'Control',\n  '18': 'Alt',\n  '19': 'Pause',\n  '20': 'CapsLock',\n  '27': 'Escape',\n  '32': ' ',\n  '33': 'PageUp',\n  '34': 'PageDown',\n  '35': 'End',\n  '36': 'Home',\n  '37': 'ArrowLeft',\n  '38': 'ArrowUp',\n  '39': 'ArrowRight',\n  '40': 'ArrowDown',\n  '45': 'Insert',\n  '46': 'Delete',\n  '112': 'F1',\n  '113': 'F2',\n  '114': 'F3',\n  '115': 'F4',\n  '116': 'F5',\n  '117': 'F6',\n  '118': 'F7',\n  '119': 'F8',\n  '120': 'F9',\n  '121': 'F10',\n  '122': 'F11',\n  '123': 'F12',\n  '144': 'NumLock',\n  '145': 'ScrollLock',\n  '224': 'Meta'\n};\n/**\n * @param {object} nativeEvent Native browser event.\n * @return {string} Normalized `key` property.\n */\n\nfunction getEventKey(nativeEvent) {\n  if (nativeEvent.key) {\n    // Normalize inconsistent values reported by browsers due to\n    // implementations of a working draft specification.\n    // FireFox implements `key` but returns `MozPrintableKey` for all\n    // printable characters (normalized to `Unidentified`), ignore it.\n    var key = normalizeKey[nativeEvent.key] || nativeEvent.key;\n\n    if (key !== 'Unidentified') {\n      return key;\n    }\n  } // Browser does not implement `key`, polyfill as much of it as we can.\n\n\n  if (nativeEvent.type === 'keypress') {\n    var charCode = getEventCharCode(nativeEvent); // The enter-key is technically both printable and non-printable and can\n    // thus be captured by `keypress`, no other non-printable key should.\n\n    return charCode === 13 ? 'Enter' : String.fromCharCode(charCode);\n  }\n\n  if (nativeEvent.type === 'keydown' || nativeEvent.type === 'keyup') {\n    // While user keyboard layout determines the actual meaning of each\n    // `keyCode` value, almost all function keys have a universal value.\n    return translateToKey[nativeEvent.keyCode] || 'Unidentified';\n  }\n\n  return '';\n}\n/**\n * Translation from modifier key to the associated property in the event.\n * @see http://www.w3.org/TR/DOM-Level-3-Events/#keys-Modifiers\n */\n\n\nvar modifierKeyToProp = {\n  Alt: 'altKey',\n  Control: 'ctrlKey',\n  Meta: 'metaKey',\n  Shift: 'shiftKey'\n}; // Older browsers (Safari <= 10, iOS Safari <= 10.2) do not support\n// getModifierState. If getModifierState is not supported, we map it to a set of\n// modifier keys exposed by the event. In this case, Lock-keys are not supported.\n\nfunction modifierStateGetter(keyArg) {\n  var syntheticEvent = this;\n  var nativeEvent = syntheticEvent.nativeEvent;\n\n  if (nativeEvent.getModifierState) {\n    return nativeEvent.getModifierState(keyArg);\n  }\n\n  var keyProp = modifierKeyToProp[keyArg];\n  return keyProp ? !!nativeEvent[keyProp] : false;\n}\n\nfunction getEventModifierState(nativeEvent) {\n  return modifierStateGetter;\n}\n/**\n * @interface KeyboardEvent\n * @see http://www.w3.org/TR/DOM-Level-3-Events/\n */\n\n\nvar KeyboardEventInterface = assign({}, UIEventInterface, {\n  key: getEventKey,\n  code: 0,\n  location: 0,\n  ctrlKey: 0,\n  shiftKey: 0,\n  altKey: 0,\n  metaKey: 0,\n  repeat: 0,\n  locale: 0,\n  getModifierState: getEventModifierState,\n  // Legacy Interface\n  charCode: function (event) {\n    // `charCode` is the result of a KeyPress event and represents the value of\n    // the actual printable character.\n    // KeyPress is deprecated, but its replacement is not yet final and not\n    // implemented in any major browser. Only KeyPress has charCode.\n    if (event.type === 'keypress') {\n      return getEventCharCode(event);\n    }\n\n    return 0;\n  },\n  keyCode: function (event) {\n    // `keyCode` is the result of a KeyDown/Up event and represents the value of\n    // physical keyboard key.\n    // The actual meaning of the value depends on the users' keyboard layout\n    // which cannot be detected. Assuming that it is a US keyboard layout\n    // provides a surprisingly accurate mapping for US and European users.\n    // Due to this, it is left to the user to implement at this time.\n    if (event.type === 'keydown' || event.type === 'keyup') {\n      return event.keyCode;\n    }\n\n    return 0;\n  },\n  which: function (event) {\n    // `which` is an alias for either `keyCode` or `charCode` depending on the\n    // type of the event.\n    if (event.type === 'keypress') {\n      return getEventCharCode(event);\n    }\n\n    if (event.type === 'keydown' || event.type === 'keyup') {\n      return event.keyCode;\n    }\n\n    return 0;\n  }\n});\n\nvar SyntheticKeyboardEvent = createSyntheticEvent(KeyboardEventInterface);\n/**\n * @interface PointerEvent\n * @see http://www.w3.org/TR/pointerevents/\n */\n\nvar PointerEventInterface = assign({}, MouseEventInterface, {\n  pointerId: 0,\n  width: 0,\n  height: 0,\n  pressure: 0,\n  tangentialPressure: 0,\n  tiltX: 0,\n  tiltY: 0,\n  twist: 0,\n  pointerType: 0,\n  isPrimary: 0\n});\n\nvar SyntheticPointerEvent = createSyntheticEvent(PointerEventInterface);\n/**\n * @interface TouchEvent\n * @see http://www.w3.org/TR/touch-events/\n */\n\nvar TouchEventInterface = assign({}, UIEventInterface, {\n  touches: 0,\n  targetTouches: 0,\n  changedTouches: 0,\n  altKey: 0,\n  metaKey: 0,\n  ctrlKey: 0,\n  shiftKey: 0,\n  getModifierState: getEventModifierState\n});\n\nvar SyntheticTouchEvent = createSyntheticEvent(TouchEventInterface);\n/**\n * @interface Event\n * @see http://www.w3.org/TR/2009/WD-css3-transitions-20090320/#transition-events-\n * @see https://developer.mozilla.org/en-US/docs/Web/API/TransitionEvent\n */\n\nvar TransitionEventInterface = assign({}, EventInterface, {\n  propertyName: 0,\n  elapsedTime: 0,\n  pseudoElement: 0\n});\n\nvar SyntheticTransitionEvent = createSyntheticEvent(TransitionEventInterface);\n/**\n * @interface WheelEvent\n * @see http://www.w3.org/TR/DOM-Level-3-Events/\n */\n\nvar WheelEventInterface = assign({}, MouseEventInterface, {\n  deltaX: function (event) {\n    return 'deltaX' in event ? event.deltaX : // Fallback to `wheelDeltaX` for Webkit and normalize (right is positive).\n    'wheelDeltaX' in event ? -event.wheelDeltaX : 0;\n  },\n  deltaY: function (event) {\n    return 'deltaY' in event ? event.deltaY : // Fallback to `wheelDeltaY` for Webkit and normalize (down is positive).\n    'wheelDeltaY' in event ? -event.wheelDeltaY : // Fallback to `wheelDelta` for IE<9 and normalize (down is positive).\n    'wheelDelta' in event ? -event.wheelDelta : 0;\n  },\n  deltaZ: 0,\n  // Browsers without \"deltaMode\" is reporting in raw wheel delta where one\n  // notch on the scroll is always +/- 120, roughly equivalent to pixels.\n  // A good approximation of DOM_DELTA_LINE (1) is 5% of viewport size or\n  // ~40 pixels, for DOM_DELTA_SCREEN (2) it is 87.5% of viewport size.\n  deltaMode: 0\n});\n\nvar SyntheticWheelEvent = createSyntheticEvent(WheelEventInterface);\n\nvar END_KEYCODES = [9, 13, 27, 32]; // Tab, Return, Esc, Space\n\nvar START_KEYCODE = 229;\nvar canUseCompositionEvent = canUseDOM && 'CompositionEvent' in window;\nvar documentMode = null;\n\nif (canUseDOM && 'documentMode' in document) {\n  documentMode = document.documentMode;\n} // Webkit offers a very useful `textInput` event that can be used to\n// directly represent `beforeInput`. The IE `textinput` event is not as\n// useful, so we don't use it.\n\n\nvar canUseTextInputEvent = canUseDOM && 'TextEvent' in window && !documentMode; // In IE9+, we have access to composition events, but the data supplied\n// by the native compositionend event may be incorrect. Japanese ideographic\n// spaces, for instance (\\u3000) are not recorded correctly.\n\nvar useFallbackCompositionData = canUseDOM && (!canUseCompositionEvent || documentMode && documentMode > 8 && documentMode <= 11);\nvar SPACEBAR_CODE = 32;\nvar SPACEBAR_CHAR = String.fromCharCode(SPACEBAR_CODE);\n\nfunction registerEvents() {\n  registerTwoPhaseEvent('onBeforeInput', ['compositionend', 'keypress', 'textInput', 'paste']);\n  registerTwoPhaseEvent('onCompositionEnd', ['compositionend', 'focusout', 'keydown', 'keypress', 'keyup', 'mousedown']);\n  registerTwoPhaseEvent('onCompositionStart', ['compositionstart', 'focusout', 'keydown', 'keypress', 'keyup', 'mousedown']);\n  registerTwoPhaseEvent('onCompositionUpdate', ['compositionupdate', 'focusout', 'keydown', 'keypress', 'keyup', 'mousedown']);\n} // Track whether we've ever handled a keypress on the space key.\n\n\nvar hasSpaceKeypress = false;\n/**\n * Return whether a native keypress event is assumed to be a command.\n * This is required because Firefox fires `keypress` events for key commands\n * (cut, copy, select-all, etc.) even though no character is inserted.\n */\n\nfunction isKeypressCommand(nativeEvent) {\n  return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) && // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n  !(nativeEvent.ctrlKey && nativeEvent.altKey);\n}\n/**\n * Translate native top level events into event types.\n */\n\n\nfunction getCompositionEventType(domEventName) {\n  switch (domEventName) {\n    case 'compositionstart':\n      return 'onCompositionStart';\n\n    case 'compositionend':\n      return 'onCompositionEnd';\n\n    case 'compositionupdate':\n      return 'onCompositionUpdate';\n  }\n}\n/**\n * Does our fallback best-guess model think this event signifies that\n * composition has begun?\n */\n\n\nfunction isFallbackCompositionStart(domEventName, nativeEvent) {\n  return domEventName === 'keydown' && nativeEvent.keyCode === START_KEYCODE;\n}\n/**\n * Does our fallback mode think that this event is the end of composition?\n */\n\n\nfunction isFallbackCompositionEnd(domEventName, nativeEvent) {\n  switch (domEventName) {\n    case 'keyup':\n      // Command keys insert or clear IME input.\n      return END_KEYCODES.indexOf(nativeEvent.keyCode) !== -1;\n\n    case 'keydown':\n      // Expect IME keyCode on each keydown. If we get any other\n      // code we must have exited earlier.\n      return nativeEvent.keyCode !== START_KEYCODE;\n\n    case 'keypress':\n    case 'mousedown':\n    case 'focusout':\n      // Events are not possible without cancelling IME.\n      return true;\n\n    default:\n      return false;\n  }\n}\n/**\n * Google Input Tools provides composition data via a CustomEvent,\n * with the `data` property populated in the `detail` object. If this\n * is available on the event object, use it. If not, this is a plain\n * composition event and we have nothing special to extract.\n *\n * @param {object} nativeEvent\n * @return {?string}\n */\n\n\nfunction getDataFromCustomEvent(nativeEvent) {\n  var detail = nativeEvent.detail;\n\n  if (typeof detail === 'object' && 'data' in detail) {\n    return detail.data;\n  }\n\n  return null;\n}\n/**\n * Check if a composition event was triggered by Korean IME.\n * Our fallback mode does not work well with IE's Korean IME,\n * so just use native composition events when Korean IME is used.\n * Although CompositionEvent.locale property is deprecated,\n * it is available in IE, where our fallback mode is enabled.\n *\n * @param {object} nativeEvent\n * @return {boolean}\n */\n\n\nfunction isUsingKoreanIME(nativeEvent) {\n  return nativeEvent.locale === 'ko';\n} // Track the current IME composition status, if any.\n\n\nvar isComposing = false;\n/**\n * @return {?object} A SyntheticCompositionEvent.\n */\n\nfunction extractCompositionEvent(dispatchQueue, domEventName, targetInst, nativeEvent, nativeEventTarget) {\n  var eventType;\n  var fallbackData;\n\n  if (canUseCompositionEvent) {\n    eventType = getCompositionEventType(domEventName);\n  } else if (!isComposing) {\n    if (isFallbackCompositionStart(domEventName, nativeEvent)) {\n      eventType = 'onCompositionStart';\n    }\n  } else if (isFallbackCompositionEnd(domEventName, nativeEvent)) {\n    eventType = 'onCompositionEnd';\n  }\n\n  if (!eventType) {\n    return null;\n  }\n\n  if (useFallbackCompositionData && !isUsingKoreanIME(nativeEvent)) {\n    // The current composition is stored statically and must not be\n    // overwritten while composition continues.\n    if (!isComposing && eventType === 'onCompositionStart') {\n      isComposing = initialize(nativeEventTarget);\n    } else if (eventType === 'onCompositionEnd') {\n      if (isComposing) {\n        fallbackData = getData();\n      }\n    }\n  }\n\n  var listeners = accumulateTwoPhaseListeners(targetInst, eventType);\n\n  if (listeners.length > 0) {\n    var event = new SyntheticCompositionEvent(eventType, domEventName, null, nativeEvent, nativeEventTarget);\n    dispatchQueue.push({\n      event: event,\n      listeners: listeners\n    });\n\n    if (fallbackData) {\n      // Inject data generated from fallback path into the synthetic event.\n      // This matches the property of native CompositionEventInterface.\n      event.data = fallbackData;\n    } else {\n      var customData = getDataFromCustomEvent(nativeEvent);\n\n      if (customData !== null) {\n        event.data = customData;\n      }\n    }\n  }\n}\n\nfunction getNativeBeforeInputChars(domEventName, nativeEvent) {\n  switch (domEventName) {\n    case 'compositionend':\n      return getDataFromCustomEvent(nativeEvent);\n\n    case 'keypress':\n      /**\n       * If native `textInput` events are available, our goal is to make\n       * use of them. However, there is a special case: the spacebar key.\n       * In Webkit, preventing default on a spacebar `textInput` event\n       * cancels character insertion, but it *also* causes the browser\n       * to fall back to its default spacebar behavior of scrolling the\n       * page.\n       *\n       * Tracking at:\n       * https://code.google.com/p/chromium/issues/detail?id=355103\n       *\n       * To avoid this issue, use the keypress event as if no `textInput`\n       * event is available.\n       */\n      var which = nativeEvent.which;\n\n      if (which !== SPACEBAR_CODE) {\n        return null;\n      }\n\n      hasSpaceKeypress = true;\n      return SPACEBAR_CHAR;\n\n    case 'textInput':\n      // Record the characters to be added to the DOM.\n      var chars = nativeEvent.data; // If it's a spacebar character, assume that we have already handled\n      // it at the keypress level and bail immediately. Android Chrome\n      // doesn't give us keycodes, so we need to ignore it.\n\n      if (chars === SPACEBAR_CHAR && hasSpaceKeypress) {\n        return null;\n      }\n\n      return chars;\n\n    default:\n      // For other native event types, do nothing.\n      return null;\n  }\n}\n/**\n * For browsers that do not provide the `textInput` event, extract the\n * appropriate string to use for SyntheticInputEvent.\n */\n\n\nfunction getFallbackBeforeInputChars(domEventName, nativeEvent) {\n  // If we are currently composing (IME) and using a fallback to do so,\n  // try to extract the composed characters from the fallback object.\n  // If composition event is available, we extract a string only at\n  // compositionevent, otherwise extract it at fallback events.\n  if (isComposing) {\n    if (domEventName === 'compositionend' || !canUseCompositionEvent && isFallbackCompositionEnd(domEventName, nativeEvent)) {\n      var chars = getData();\n      reset();\n      isComposing = false;\n      return chars;\n    }\n\n    return null;\n  }\n\n  switch (domEventName) {\n    case 'paste':\n      // If a paste event occurs after a keypress, throw out the input\n      // chars. Paste events should not lead to BeforeInput events.\n      return null;\n\n    case 'keypress':\n      /**\n       * As of v27, Firefox may fire keypress events even when no character\n       * will be inserted. A few possibilities:\n       *\n       * - `which` is `0`. Arrow keys, Esc key, etc.\n       *\n       * - `which` is the pressed key code, but no char is available.\n       *   Ex: 'AltGr + d` in Polish. There is no modified character for\n       *   this key combination and no character is inserted into the\n       *   document, but FF fires the keypress for char code `100` anyway.\n       *   No `input` event will occur.\n       *\n       * - `which` is the pressed key code, but a command combination is\n       *   being used. Ex: `Cmd+C`. No character is inserted, and no\n       *   `input` event will occur.\n       */\n      if (!isKeypressCommand(nativeEvent)) {\n        // IE fires the `keypress` event when a user types an emoji via\n        // Touch keyboard of Windows.  In such a case, the `char` property\n        // holds an emoji character like `\\uD83D\\uDE0A`.  Because its length\n        // is 2, the property `which` does not represent an emoji correctly.\n        // In such a case, we directly return the `char` property instead of\n        // using `which`.\n        if (nativeEvent.char && nativeEvent.char.length > 1) {\n          return nativeEvent.char;\n        } else if (nativeEvent.which) {\n          return String.fromCharCode(nativeEvent.which);\n        }\n      }\n\n      return null;\n\n    case 'compositionend':\n      return useFallbackCompositionData && !isUsingKoreanIME(nativeEvent) ? null : nativeEvent.data;\n\n    default:\n      return null;\n  }\n}\n/**\n * Extract a SyntheticInputEvent for `beforeInput`, based on either native\n * `textInput` or fallback behavior.\n *\n * @return {?object} A SyntheticInputEvent.\n */\n\n\nfunction extractBeforeInputEvent(dispatchQueue, domEventName, targetInst, nativeEvent, nativeEventTarget) {\n  var chars;\n\n  if (canUseTextInputEvent) {\n    chars = getNativeBeforeInputChars(domEventName, nativeEvent);\n  } else {\n    chars = getFallbackBeforeInputChars(domEventName, nativeEvent);\n  } // If no characters are being inserted, no BeforeInput event should\n  // be fired.\n\n\n  if (!chars) {\n    return null;\n  }\n\n  var listeners = accumulateTwoPhaseListeners(targetInst, 'onBeforeInput');\n\n  if (listeners.length > 0) {\n    var event = new SyntheticInputEvent('onBeforeInput', 'beforeinput', null, nativeEvent, nativeEventTarget);\n    dispatchQueue.push({\n      event: event,\n      listeners: listeners\n    });\n    event.data = chars;\n  }\n}\n/**\n * Create an `onBeforeInput` event to match\n * http://www.w3.org/TR/2013/WD-DOM-Level-3-Events-20131105/#events-inputevents.\n *\n * This event plugin is based on the native `textInput` event\n * available in Chrome, Safari, Opera, and IE. This event fires after\n * `onKeyPress` and `onCompositionEnd`, but before `onInput`.\n *\n * `beforeInput` is spec'd but not implemented in any browsers, and\n * the `input` event does not provide any useful information about what has\n * actually been added, contrary to the spec. Thus, `textInput` is the best\n * available event to identify the characters that have actually been inserted\n * into the target node.\n *\n * This plugin is also responsible for emitting `composition` events, thus\n * allowing us to share composition fallback code for both `beforeInput` and\n * `composition` event types.\n */\n\n\nfunction extractEvents(dispatchQueue, domEventName, targetInst, nativeEvent, nativeEventTarget, eventSystemFlags, targetContainer) {\n  extractCompositionEvent(dispatchQueue, domEventName, targetInst, nativeEvent, nativeEventTarget);\n  extractBeforeInputEvent(dispatchQueue, domEventName, targetInst, nativeEvent, nativeEventTarget);\n}\n\n/**\n * @see http://www.whatwg.org/specs/web-apps/current-work/multipage/the-input-element.html#input-type-attr-summary\n */\nvar supportedInputTypes = {\n  color: true,\n  date: true,\n  datetime: true,\n  'datetime-local': true,\n  email: true,\n  month: true,\n  number: true,\n  password: true,\n  range: true,\n  search: true,\n  tel: true,\n  text: true,\n  time: true,\n  url: true,\n  week: true\n};\n\nfunction isTextInputElement(elem) {\n  var nodeName = elem && elem.nodeName && elem.nodeName.toLowerCase();\n\n  if (nodeName === 'input') {\n    return !!supportedInputTypes[elem.type];\n  }\n\n  if (nodeName === 'textarea') {\n    return true;\n  }\n\n  return false;\n}\n\n/**\n * Checks if an event is supported in the current execution environment.\n *\n * NOTE: This will not work correctly for non-generic events such as `change`,\n * `reset`, `load`, `error`, and `select`.\n *\n * Borrows from Modernizr.\n *\n * @param {string} eventNameSuffix Event name, e.g. \"click\".\n * @return {boolean} True if the event is supported.\n * @internal\n * @license Modernizr 3.0.0pre (Custom Build) | MIT\n */\n\nfunction isEventSupported(eventNameSuffix) {\n  if (!canUseDOM) {\n    return false;\n  }\n\n  var eventName = 'on' + eventNameSuffix;\n  var isSupported = (eventName in document);\n\n  if (!isSupported) {\n    var element = document.createElement('div');\n    element.setAttribute(eventName, 'return;');\n    isSupported = typeof element[eventName] === 'function';\n  }\n\n  return isSupported;\n}\n\nfunction registerEvents$1() {\n  registerTwoPhaseEvent('onChange', ['change', 'click', 'focusin', 'focusout', 'input', 'keydown', 'keyup', 'selectionchange']);\n}\n\nfunction createAndAccumulateChangeEvent(dispatchQueue, inst, nativeEvent, target) {\n  // Flag this event loop as needing state restore.\n  enqueueStateRestore(target);\n  var listeners = accumulateTwoPhaseListeners(inst, 'onChange');\n\n  if (listeners.length > 0) {\n    var event = new SyntheticEvent('onChange', 'change', null, nativeEvent, target);\n    dispatchQueue.push({\n      event: event,\n      listeners: listeners\n    });\n  }\n}\n/**\n * For IE shims\n */\n\n\nvar activeElement = null;\nvar activeElementInst = null;\n/**\n * SECTION: handle `change` event\n */\n\nfunction shouldUseChangeEvent(elem) {\n  var nodeName = elem.nodeName && elem.nodeName.toLowerCase();\n  return nodeName === 'select' || nodeName === 'input' && elem.type === 'file';\n}\n\nfunction manualDispatchChangeEvent(nativeEvent) {\n  var dispatchQueue = [];\n  createAndAccumulateChangeEvent(dispatchQueue, activeElementInst, nativeEvent, getEventTarget(nativeEvent)); // If change and propertychange bubbled, we'd just bind to it like all the\n  // other events and have it go through ReactBrowserEventEmitter. Since it\n  // doesn't, we manually listen for the events and so we have to enqueue and\n  // process the abstract event manually.\n  //\n  // Batching is necessary here in order to ensure that all event handlers run\n  // before the next rerender (including event handlers attached to ancestor\n  // elements instead of directly on the input). Without this, controlled\n  // components don't work properly in conjunction with event bubbling because\n  // the component is rerendered and the value reverted before all the event\n  // handlers can run. See https://github.com/facebook/react/issues/708.\n\n  batchedUpdates(runEventInBatch, dispatchQueue);\n}\n\nfunction runEventInBatch(dispatchQueue) {\n  processDispatchQueue(dispatchQueue, 0);\n}\n\nfunction getInstIfValueChanged(targetInst) {\n  var targetNode = getNodeFromInstance(targetInst);\n\n  if (updateValueIfChanged(targetNode)) {\n    return targetInst;\n  }\n}\n\nfunction getTargetInstForChangeEvent(domEventName, targetInst) {\n  if (domEventName === 'change') {\n    return targetInst;\n  }\n}\n/**\n * SECTION: handle `input` event\n */\n\n\nvar isInputEventSupported = false;\n\nif (canUseDOM) {\n  // IE9 claims to support the input event but fails to trigger it when\n  // deleting text, so we ignore its input events.\n  isInputEventSupported = isEventSupported('input') && (!document.documentMode || document.documentMode > 9);\n}\n/**\n * (For IE <=9) Starts tracking propertychange events on the passed-in element\n * and override the value property so that we can distinguish user events from\n * value changes in JS.\n */\n\n\nfunction startWatchingForValueChange(target, targetInst) {\n  activeElement = target;\n  activeElementInst = targetInst;\n  activeElement.attachEvent('onpropertychange', handlePropertyChange);\n}\n/**\n * (For IE <=9) Removes the event listeners from the currently-tracked element,\n * if any exists.\n */\n\n\nfunction stopWatchingForValueChange() {\n  if (!activeElement) {\n    return;\n  }\n\n  activeElement.detachEvent('onpropertychange', handlePropertyChange);\n  activeElement = null;\n  activeElementInst = null;\n}\n/**\n * (For IE <=9) Handles a propertychange event, sending a `change` event if\n * the value of the active element has changed.\n */\n\n\nfunction handlePropertyChange(nativeEvent) {\n  if (nativeEvent.propertyName !== 'value') {\n    return;\n  }\n\n  if (getInstIfValueChanged(activeElementInst)) {\n    manualDispatchChangeEvent(nativeEvent);\n  }\n}\n\nfunction handleEventsForInputEventPolyfill(domEventName, target, targetInst) {\n  if (domEventName === 'focusin') {\n    // In IE9, propertychange fires for most input events but is buggy and\n    // doesn't fire when text is deleted, but conveniently, selectionchange\n    // appears to fire in all of the remaining cases so we catch those and\n    // forward the event if the value has changed\n    // In either case, we don't want to call the event handler if the value\n    // is changed from JS so we redefine a setter for `.value` that updates\n    // our activeElementValue variable, allowing us to ignore those changes\n    //\n    // stopWatching() should be a noop here but we call it just in case we\n    // missed a blur event somehow.\n    stopWatchingForValueChange();\n    startWatchingForValueChange(target, targetInst);\n  } else if (domEventName === 'focusout') {\n    stopWatchingForValueChange();\n  }\n} // For IE8 and IE9.\n\n\nfunction getTargetInstForInputEventPolyfill(domEventName, targetInst) {\n  if (domEventName === 'selectionchange' || domEventName === 'keyup' || domEventName === 'keydown') {\n    // On the selectionchange event, the target is just document which isn't\n    // helpful for us so just check activeElement instead.\n    //\n    // 99% of the time, keydown and keyup aren't necessary. IE8 fails to fire\n    // propertychange on the first input event after setting `value` from a\n    // script and fires only keydown, keypress, keyup. Catching keyup usually\n    // gets it and catching keydown lets us fire an event for the first\n    // keystroke if user does a key repeat (it'll be a little delayed: right\n    // before the second keystroke). Other input methods (e.g., paste) seem to\n    // fire selectionchange normally.\n    return getInstIfValueChanged(activeElementInst);\n  }\n}\n/**\n * SECTION: handle `click` event\n */\n\n\nfunction shouldUseClickEvent(elem) {\n  // Use the `click` event to detect changes to checkbox and radio inputs.\n  // This approach works across all browsers, whereas `change` does not fire\n  // until `blur` in IE8.\n  var nodeName = elem.nodeName;\n  return nodeName && nodeName.toLowerCase() === 'input' && (elem.type === 'checkbox' || elem.type === 'radio');\n}\n\nfunction getTargetInstForClickEvent(domEventName, targetInst) {\n  if (domEventName === 'click') {\n    return getInstIfValueChanged(targetInst);\n  }\n}\n\nfunction getTargetInstForInputOrChangeEvent(domEventName, targetInst) {\n  if (domEventName === 'input' || domEventName === 'change') {\n    return getInstIfValueChanged(targetInst);\n  }\n}\n\nfunction handleControlledInputBlur(node) {\n  var state = node._wrapperState;\n\n  if (!state || !state.controlled || node.type !== 'number') {\n    return;\n  }\n\n  {\n    // If controlled, assign the value attribute to the current value on blur\n    setDefaultValue(node, 'number', node.value);\n  }\n}\n/**\n * This plugin creates an `onChange` event that normalizes change events\n * across form elements. This event fires at a time when it's possible to\n * change the element's value without seeing a flicker.\n *\n * Supported elements are:\n * - input (see `isTextInputElement`)\n * - textarea\n * - select\n */\n\n\nfunction extractEvents$1(dispatchQueue, domEventName, targetInst, nativeEvent, nativeEventTarget, eventSystemFlags, targetContainer) {\n  var targetNode = targetInst ? getNodeFromInstance(targetInst) : window;\n  var getTargetInstFunc, handleEventFunc;\n\n  if (shouldUseChangeEvent(targetNode)) {\n    getTargetInstFunc = getTargetInstForChangeEvent;\n  } else if (isTextInputElement(targetNode)) {\n    if (isInputEventSupported) {\n      getTargetInstFunc = getTargetInstForInputOrChangeEvent;\n    } else {\n      getTargetInstFunc = getTargetInstForInputEventPolyfill;\n      handleEventFunc = handleEventsForInputEventPolyfill;\n    }\n  } else if (shouldUseClickEvent(targetNode)) {\n    getTargetInstFunc = getTargetInstForClickEvent;\n  }\n\n  if (getTargetInstFunc) {\n    var inst = getTargetInstFunc(domEventName, targetInst);\n\n    if (inst) {\n      createAndAccumulateChangeEvent(dispatchQueue, inst, nativeEvent, nativeEventTarget);\n      return;\n    }\n  }\n\n  if (handleEventFunc) {\n    handleEventFunc(domEventName, targetNode, targetInst);\n  } // When blurring, set the value attribute for number inputs\n\n\n  if (domEventName === 'focusout') {\n    handleControlledInputBlur(targetNode);\n  }\n}\n\nfunction registerEvents$2() {\n  registerDirectEvent('onMouseEnter', ['mouseout', 'mouseover']);\n  registerDirectEvent('onMouseLeave', ['mouseout', 'mouseover']);\n  registerDirectEvent('onPointerEnter', ['pointerout', 'pointerover']);\n  registerDirectEvent('onPointerLeave', ['pointerout', 'pointerover']);\n}\n/**\n * For almost every interaction we care about, there will be both a top-level\n * `mouseover` and `mouseout` event that occurs. Only use `mouseout` so that\n * we do not extract duplicate events. However, moving the mouse into the\n * browser from outside will not fire a `mouseout` event. In this case, we use\n * the `mouseover` top-level event.\n */\n\n\nfunction extractEvents$2(dispatchQueue, domEventName, targetInst, nativeEvent, nativeEventTarget, eventSystemFlags, targetContainer) {\n  var isOverEvent = domEventName === 'mouseover' || domEventName === 'pointerover';\n  var isOutEvent = domEventName === 'mouseout' || domEventName === 'pointerout';\n\n  if (isOverEvent && !isReplayingEvent(nativeEvent)) {\n    // If this is an over event with a target, we might have already dispatched\n    // the event in the out event of the other target. If this is replayed,\n    // then it's because we couldn't dispatch against this target previously\n    // so we have to do it now instead.\n    var related = nativeEvent.relatedTarget || nativeEvent.fromElement;\n\n    if (related) {\n      // If the related node is managed by React, we can assume that we have\n      // already dispatched the corresponding events during its mouseout.\n      if (getClosestInstanceFromNode(related) || isContainerMarkedAsRoot(related)) {\n        return;\n      }\n    }\n  }\n\n  if (!isOutEvent && !isOverEvent) {\n    // Must not be a mouse or pointer in or out - ignoring.\n    return;\n  }\n\n  var win; // TODO: why is this nullable in the types but we read from it?\n\n  if (nativeEventTarget.window === nativeEventTarget) {\n    // `nativeEventTarget` is probably a window object.\n    win = nativeEventTarget;\n  } else {\n    // TODO: Figure out why `ownerDocument` is sometimes undefined in IE8.\n    var doc = nativeEventTarget.ownerDocument;\n\n    if (doc) {\n      win = doc.defaultView || doc.parentWindow;\n    } else {\n      win = window;\n    }\n  }\n\n  var from;\n  var to;\n\n  if (isOutEvent) {\n    var _related = nativeEvent.relatedTarget || nativeEvent.toElement;\n\n    from = targetInst;\n    to = _related ? getClosestInstanceFromNode(_related) : null;\n\n    if (to !== null) {\n      var nearestMounted = getNearestMountedFiber(to);\n\n      if (to !== nearestMounted || to.tag !== HostComponent && to.tag !== HostText) {\n        to = null;\n      }\n    }\n  } else {\n    // Moving to a node from outside the window.\n    from = null;\n    to = targetInst;\n  }\n\n  if (from === to) {\n    // Nothing pertains to our managed components.\n    return;\n  }\n\n  var SyntheticEventCtor = SyntheticMouseEvent;\n  var leaveEventType = 'onMouseLeave';\n  var enterEventType = 'onMouseEnter';\n  var eventTypePrefix = 'mouse';\n\n  if (domEventName === 'pointerout' || domEventName === 'pointerover') {\n    SyntheticEventCtor = SyntheticPointerEvent;\n    leaveEventType = 'onPointerLeave';\n    enterEventType = 'onPointerEnter';\n    eventTypePrefix = 'pointer';\n  }\n\n  var fromNode = from == null ? win : getNodeFromInstance(from);\n  var toNode = to == null ? win : getNodeFromInstance(to);\n  var leave = new SyntheticEventCtor(leaveEventType, eventTypePrefix + 'leave', from, nativeEvent, nativeEventTarget);\n  leave.target = fromNode;\n  leave.relatedTarget = toNode;\n  var enter = null; // We should only process this nativeEvent if we are processing\n  // the first ancestor. Next time, we will ignore the event.\n\n  var nativeTargetInst = getClosestInstanceFromNode(nativeEventTarget);\n\n  if (nativeTargetInst === targetInst) {\n    var enterEvent = new SyntheticEventCtor(enterEventType, eventTypePrefix + 'enter', to, nativeEvent, nativeEventTarget);\n    enterEvent.target = toNode;\n    enterEvent.relatedTarget = fromNode;\n    enter = enterEvent;\n  }\n\n  accumulateEnterLeaveTwoPhaseListeners(dispatchQueue, leave, enter, from, to);\n}\n\n/**\n * inlined Object.is polyfill to avoid requiring consumers ship their own\n * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/is\n */\nfunction is(x, y) {\n  return x === y && (x !== 0 || 1 / x === 1 / y) || x !== x && y !== y // eslint-disable-line no-self-compare\n  ;\n}\n\nvar objectIs = typeof Object.is === 'function' ? Object.is : is;\n\n/**\n * Performs equality by iterating through keys on an object and returning false\n * when any key has values which are not strictly equal between the arguments.\n * Returns true when the values of all keys are strictly equal.\n */\n\nfunction shallowEqual(objA, objB) {\n  if (objectIs(objA, objB)) {\n    return true;\n  }\n\n  if (typeof objA !== 'object' || objA === null || typeof objB !== 'object' || objB === null) {\n    return false;\n  }\n\n  var keysA = Object.keys(objA);\n  var keysB = Object.keys(objB);\n\n  if (keysA.length !== keysB.length) {\n    return false;\n  } // Test for A's keys different from B.\n\n\n  for (var i = 0; i < keysA.length; i++) {\n    var currentKey = keysA[i];\n\n    if (!hasOwnProperty.call(objB, currentKey) || !objectIs(objA[currentKey], objB[currentKey])) {\n      return false;\n    }\n  }\n\n  return true;\n}\n\n/**\n * Given any node return the first leaf node without children.\n *\n * @param {DOMElement|DOMTextNode} node\n * @return {DOMElement|DOMTextNode}\n */\n\nfunction getLeafNode(node) {\n  while (node && node.firstChild) {\n    node = node.firstChild;\n  }\n\n  return node;\n}\n/**\n * Get the next sibling within a container. This will walk up the\n * DOM if a node's siblings have been exhausted.\n *\n * @param {DOMElement|DOMTextNode} node\n * @return {?DOMElement|DOMTextNode}\n */\n\n\nfunction getSiblingNode(node) {\n  while (node) {\n    if (node.nextSibling) {\n      return node.nextSibling;\n    }\n\n    node = node.parentNode;\n  }\n}\n/**\n * Get object describing the nodes which contain characters at offset.\n *\n * @param {DOMElement|DOMTextNode} root\n * @param {number} offset\n * @return {?object}\n */\n\n\nfunction getNodeForCharacterOffset(root, offset) {\n  var node = getLeafNode(root);\n  var nodeStart = 0;\n  var nodeEnd = 0;\n\n  while (node) {\n    if (node.nodeType === TEXT_NODE) {\n      nodeEnd = nodeStart + node.textContent.length;\n\n      if (nodeStart <= offset && nodeEnd >= offset) {\n        return {\n          node: node,\n          offset: offset - nodeStart\n        };\n      }\n\n      nodeStart = nodeEnd;\n    }\n\n    node = getLeafNode(getSiblingNode(node));\n  }\n}\n\n/**\n * @param {DOMElement} outerNode\n * @return {?object}\n */\n\nfunction getOffsets(outerNode) {\n  var ownerDocument = outerNode.ownerDocument;\n  var win = ownerDocument && ownerDocument.defaultView || window;\n  var selection = win.getSelection && win.getSelection();\n\n  if (!selection || selection.rangeCount === 0) {\n    return null;\n  }\n\n  var anchorNode = selection.anchorNode,\n      anchorOffset = selection.anchorOffset,\n      focusNode = selection.focusNode,\n      focusOffset = selection.focusOffset; // In Firefox, anchorNode and focusNode can be \"anonymous divs\", e.g. the\n  // up/down buttons on an <input type=\"number\">. Anonymous divs do not seem to\n  // expose properties, triggering a \"Permission denied error\" if any of its\n  // properties are accessed. The only seemingly possible way to avoid erroring\n  // is to access a property that typically works for non-anonymous divs and\n  // catch any error that may otherwise arise. See\n  // https://bugzilla.mozilla.org/show_bug.cgi?id=208427\n\n  try {\n    /* eslint-disable no-unused-expressions */\n    anchorNode.nodeType;\n    focusNode.nodeType;\n    /* eslint-enable no-unused-expressions */\n  } catch (e) {\n    return null;\n  }\n\n  return getModernOffsetsFromPoints(outerNode, anchorNode, anchorOffset, focusNode, focusOffset);\n}\n/**\n * Returns {start, end} where `start` is the character/codepoint index of\n * (anchorNode, anchorOffset) within the textContent of `outerNode`, and\n * `end` is the index of (focusNode, focusOffset).\n *\n * Returns null if you pass in garbage input but we should probably just crash.\n *\n * Exported only for testing.\n */\n\nfunction getModernOffsetsFromPoints(outerNode, anchorNode, anchorOffset, focusNode, focusOffset) {\n  var length = 0;\n  var start = -1;\n  var end = -1;\n  var indexWithinAnchor = 0;\n  var indexWithinFocus = 0;\n  var node = outerNode;\n  var parentNode = null;\n\n  outer: while (true) {\n    var next = null;\n\n    while (true) {\n      if (node === anchorNode && (anchorOffset === 0 || node.nodeType === TEXT_NODE)) {\n        start = length + anchorOffset;\n      }\n\n      if (node === focusNode && (focusOffset === 0 || node.nodeType === TEXT_NODE)) {\n        end = length + focusOffset;\n      }\n\n      if (node.nodeType === TEXT_NODE) {\n        length += node.nodeValue.length;\n      }\n\n      if ((next = node.firstChild) === null) {\n        break;\n      } // Moving from `node` to its first child `next`.\n\n\n      parentNode = node;\n      node = next;\n    }\n\n    while (true) {\n      if (node === outerNode) {\n        // If `outerNode` has children, this is always the second time visiting\n        // it. If it has no children, this is still the first loop, and the only\n        // valid selection is anchorNode and focusNode both equal to this node\n        // and both offsets 0, in which case we will have handled above.\n        break outer;\n      }\n\n      if (parentNode === anchorNode && ++indexWithinAnchor === anchorOffset) {\n        start = length;\n      }\n\n      if (parentNode === focusNode && ++indexWithinFocus === focusOffset) {\n        end = length;\n      }\n\n      if ((next = node.nextSibling) !== null) {\n        break;\n      }\n\n      node = parentNode;\n      parentNode = node.parentNode;\n    } // Moving from `node` to its next sibling `next`.\n\n\n    node = next;\n  }\n\n  if (start === -1 || end === -1) {\n    // This should never happen. (Would happen if the anchor/focus nodes aren't\n    // actually inside the passed-in node.)\n    return null;\n  }\n\n  return {\n    start: start,\n    end: end\n  };\n}\n/**\n * In modern non-IE browsers, we can support both forward and backward\n * selections.\n *\n * Note: IE10+ supports the Selection object, but it does not support\n * the `extend` method, which means that even in modern IE, it's not possible\n * to programmatically create a backward selection. Thus, for all IE\n * versions, we use the old IE API to create our selections.\n *\n * @param {DOMElement|DOMTextNode} node\n * @param {object} offsets\n */\n\nfunction setOffsets(node, offsets) {\n  var doc = node.ownerDocument || document;\n  var win = doc && doc.defaultView || window; // Edge fails with \"Object expected\" in some scenarios.\n  // (For instance: TinyMCE editor used in a list component that supports pasting to add more,\n  // fails when pasting 100+ items)\n\n  if (!win.getSelection) {\n    return;\n  }\n\n  var selection = win.getSelection();\n  var length = node.textContent.length;\n  var start = Math.min(offsets.start, length);\n  var end = offsets.end === undefined ? start : Math.min(offsets.end, length); // IE 11 uses modern selection, but doesn't support the extend method.\n  // Flip backward selections, so we can set with a single range.\n\n  if (!selection.extend && start > end) {\n    var temp = end;\n    end = start;\n    start = temp;\n  }\n\n  var startMarker = getNodeForCharacterOffset(node, start);\n  var endMarker = getNodeForCharacterOffset(node, end);\n\n  if (startMarker && endMarker) {\n    if (selection.rangeCount === 1 && selection.anchorNode === startMarker.node && selection.anchorOffset === startMarker.offset && selection.focusNode === endMarker.node && selection.focusOffset === endMarker.offset) {\n      return;\n    }\n\n    var range = doc.createRange();\n    range.setStart(startMarker.node, startMarker.offset);\n    selection.removeAllRanges();\n\n    if (start > end) {\n      selection.addRange(range);\n      selection.extend(endMarker.node, endMarker.offset);\n    } else {\n      range.setEnd(endMarker.node, endMarker.offset);\n      selection.addRange(range);\n    }\n  }\n}\n\nfunction isTextNode(node) {\n  return node && node.nodeType === TEXT_NODE;\n}\n\nfunction containsNode(outerNode, innerNode) {\n  if (!outerNode || !innerNode) {\n    return false;\n  } else if (outerNode === innerNode) {\n    return true;\n  } else if (isTextNode(outerNode)) {\n    return false;\n  } else if (isTextNode(innerNode)) {\n    return containsNode(outerNode, innerNode.parentNode);\n  } else if ('contains' in outerNode) {\n    return outerNode.contains(innerNode);\n  } else if (outerNode.compareDocumentPosition) {\n    return !!(outerNode.compareDocumentPosition(innerNode) & 16);\n  } else {\n    return false;\n  }\n}\n\nfunction isInDocument(node) {\n  return node && node.ownerDocument && containsNode(node.ownerDocument.documentElement, node);\n}\n\nfunction isSameOriginFrame(iframe) {\n  try {\n    // Accessing the contentDocument of a HTMLIframeElement can cause the browser\n    // to throw, e.g. if it has a cross-origin src attribute.\n    // Safari will show an error in the console when the access results in \"Blocked a frame with origin\". e.g:\n    // iframe.contentDocument.defaultView;\n    // A safety way is to access one of the cross origin properties: Window or Location\n    // Which might result in \"SecurityError\" DOM Exception and it is compatible to Safari.\n    // https://html.spec.whatwg.org/multipage/browsers.html#integration-with-idl\n    return typeof iframe.contentWindow.location.href === 'string';\n  } catch (err) {\n    return false;\n  }\n}\n\nfunction getActiveElementDeep() {\n  var win = window;\n  var element = getActiveElement();\n\n  while (element instanceof win.HTMLIFrameElement) {\n    if (isSameOriginFrame(element)) {\n      win = element.contentWindow;\n    } else {\n      return element;\n    }\n\n    element = getActiveElement(win.document);\n  }\n\n  return element;\n}\n/**\n * @ReactInputSelection: React input selection module. Based on Selection.js,\n * but modified to be suitable for react and has a couple of bug fixes (doesn't\n * assume buttons have range selections allowed).\n * Input selection module for React.\n */\n\n/**\n * @hasSelectionCapabilities: we get the element types that support selection\n * from https://html.spec.whatwg.org/#do-not-apply, looking at `selectionStart`\n * and `selectionEnd` rows.\n */\n\n\nfunction hasSelectionCapabilities(elem) {\n  var nodeName = elem && elem.nodeName && elem.nodeName.toLowerCase();\n  return nodeName && (nodeName === 'input' && (elem.type === 'text' || elem.type === 'search' || elem.type === 'tel' || elem.type === 'url' || elem.type === 'password') || nodeName === 'textarea' || elem.contentEditable === 'true');\n}\nfunction getSelectionInformation() {\n  var focusedElem = getActiveElementDeep();\n  return {\n    focusedElem: focusedElem,\n    selectionRange: hasSelectionCapabilities(focusedElem) ? getSelection(focusedElem) : null\n  };\n}\n/**\n * @restoreSelection: If any selection information was potentially lost,\n * restore it. This is useful when performing operations that could remove dom\n * nodes and place them back in, resulting in focus being lost.\n */\n\nfunction restoreSelection(priorSelectionInformation) {\n  var curFocusedElem = getActiveElementDeep();\n  var priorFocusedElem = priorSelectionInformation.focusedElem;\n  var priorSelectionRange = priorSelectionInformation.selectionRange;\n\n  if (curFocusedElem !== priorFocusedElem && isInDocument(priorFocusedElem)) {\n    if (priorSelectionRange !== null && hasSelectionCapabilities(priorFocusedElem)) {\n      setSelection(priorFocusedElem, priorSelectionRange);\n    } // Focusing a node can change the scroll position, which is undesirable\n\n\n    var ancestors = [];\n    var ancestor = priorFocusedElem;\n\n    while (ancestor = ancestor.parentNode) {\n      if (ancestor.nodeType === ELEMENT_NODE) {\n        ancestors.push({\n          element: ancestor,\n          left: ancestor.scrollLeft,\n          top: ancestor.scrollTop\n        });\n      }\n    }\n\n    if (typeof priorFocusedElem.focus === 'function') {\n      priorFocusedElem.focus();\n    }\n\n    for (var i = 0; i < ancestors.length; i++) {\n      var info = ancestors[i];\n      info.element.scrollLeft = info.left;\n      info.element.scrollTop = info.top;\n    }\n  }\n}\n/**\n * @getSelection: Gets the selection bounds of a focused textarea, input or\n * contentEditable node.\n * -@input: Look up selection bounds of this input\n * -@return {start: selectionStart, end: selectionEnd}\n */\n\nfunction getSelection(input) {\n  var selection;\n\n  if ('selectionStart' in input) {\n    // Modern browser with input or textarea.\n    selection = {\n      start: input.selectionStart,\n      end: input.selectionEnd\n    };\n  } else {\n    // Content editable or old IE textarea.\n    selection = getOffsets(input);\n  }\n\n  return selection || {\n    start: 0,\n    end: 0\n  };\n}\n/**\n * @setSelection: Sets the selection bounds of a textarea or input and focuses\n * the input.\n * -@input     Set selection bounds of this input or textarea\n * -@offsets   Object of same form that is returned from get*\n */\n\nfunction setSelection(input, offsets) {\n  var start = offsets.start;\n  var end = offsets.end;\n\n  if (end === undefined) {\n    end = start;\n  }\n\n  if ('selectionStart' in input) {\n    input.selectionStart = start;\n    input.selectionEnd = Math.min(end, input.value.length);\n  } else {\n    setOffsets(input, offsets);\n  }\n}\n\nvar skipSelectionChangeEvent = canUseDOM && 'documentMode' in document && document.documentMode <= 11;\n\nfunction registerEvents$3() {\n  registerTwoPhaseEvent('onSelect', ['focusout', 'contextmenu', 'dragend', 'focusin', 'keydown', 'keyup', 'mousedown', 'mouseup', 'selectionchange']);\n}\n\nvar activeElement$1 = null;\nvar activeElementInst$1 = null;\nvar lastSelection = null;\nvar mouseDown = false;\n/**\n * Get an object which is a unique representation of the current selection.\n *\n * The return value will not be consistent across nodes or browsers, but\n * two identical selections on the same node will return identical objects.\n */\n\nfunction getSelection$1(node) {\n  if ('selectionStart' in node && hasSelectionCapabilities(node)) {\n    return {\n      start: node.selectionStart,\n      end: node.selectionEnd\n    };\n  } else {\n    var win = node.ownerDocument && node.ownerDocument.defaultView || window;\n    var selection = win.getSelection();\n    return {\n      anchorNode: selection.anchorNode,\n      anchorOffset: selection.anchorOffset,\n      focusNode: selection.focusNode,\n      focusOffset: selection.focusOffset\n    };\n  }\n}\n/**\n * Get document associated with the event target.\n */\n\n\nfunction getEventTargetDocument(eventTarget) {\n  return eventTarget.window === eventTarget ? eventTarget.document : eventTarget.nodeType === DOCUMENT_NODE ? eventTarget : eventTarget.ownerDocument;\n}\n/**\n * Poll selection to see whether it's changed.\n *\n * @param {object} nativeEvent\n * @param {object} nativeEventTarget\n * @return {?SyntheticEvent}\n */\n\n\nfunction constructSelectEvent(dispatchQueue, nativeEvent, nativeEventTarget) {\n  // Ensure we have the right element, and that the user is not dragging a\n  // selection (this matches native `select` event behavior). In HTML5, select\n  // fires only on input and textarea thus if there's no focused element we\n  // won't dispatch.\n  var doc = getEventTargetDocument(nativeEventTarget);\n\n  if (mouseDown || activeElement$1 == null || activeElement$1 !== getActiveElement(doc)) {\n    return;\n  } // Only fire when selection has actually changed.\n\n\n  var currentSelection = getSelection$1(activeElement$1);\n\n  if (!lastSelection || !shallowEqual(lastSelection, currentSelection)) {\n    lastSelection = currentSelection;\n    var listeners = accumulateTwoPhaseListeners(activeElementInst$1, 'onSelect');\n\n    if (listeners.length > 0) {\n      var event = new SyntheticEvent('onSelect', 'select', null, nativeEvent, nativeEventTarget);\n      dispatchQueue.push({\n        event: event,\n        listeners: listeners\n      });\n      event.target = activeElement$1;\n    }\n  }\n}\n/**\n * This plugin creates an `onSelect` event that normalizes select events\n * across form elements.\n *\n * Supported elements are:\n * - input (see `isTextInputElement`)\n * - textarea\n * - contentEditable\n *\n * This differs from native browser implementations in the following ways:\n * - Fires on contentEditable fields as well as inputs.\n * - Fires for collapsed selection.\n * - Fires after user input.\n */\n\n\nfunction extractEvents$3(dispatchQueue, domEventName, targetInst, nativeEvent, nativeEventTarget, eventSystemFlags, targetContainer) {\n  var targetNode = targetInst ? getNodeFromInstance(targetInst) : window;\n\n  switch (domEventName) {\n    // Track the input node that has focus.\n    case 'focusin':\n      if (isTextInputElement(targetNode) || targetNode.contentEditable === 'true') {\n        activeElement$1 = targetNode;\n        activeElementInst$1 = targetInst;\n        lastSelection = null;\n      }\n\n      break;\n\n    case 'focusout':\n      activeElement$1 = null;\n      activeElementInst$1 = null;\n      lastSelection = null;\n      break;\n    // Don't fire the event while the user is dragging. This matches the\n    // semantics of the native select event.\n\n    case 'mousedown':\n      mouseDown = true;\n      break;\n\n    case 'contextmenu':\n    case 'mouseup':\n    case 'dragend':\n      mouseDown = false;\n      constructSelectEvent(dispatchQueue, nativeEvent, nativeEventTarget);\n      break;\n    // Chrome and IE fire non-standard event when selection is changed (and\n    // sometimes when it hasn't). IE's event fires out of order with respect\n    // to key and input events on deletion, so we discard it.\n    //\n    // Firefox doesn't support selectionchange, so check selection status\n    // after each key entry. The selection changes after keydown and before\n    // keyup, but we check on keydown as well in the case of holding down a\n    // key, when multiple keydown events are fired but only one keyup is.\n    // This is also our approach for IE handling, for the reason above.\n\n    case 'selectionchange':\n      if (skipSelectionChangeEvent) {\n        break;\n      }\n\n    // falls through\n\n    case 'keydown':\n    case 'keyup':\n      constructSelectEvent(dispatchQueue, nativeEvent, nativeEventTarget);\n  }\n}\n\n/**\n * Generate a mapping of standard vendor prefixes using the defined style property and event name.\n *\n * @param {string} styleProp\n * @param {string} eventName\n * @returns {object}\n */\n\nfunction makePrefixMap(styleProp, eventName) {\n  var prefixes = {};\n  prefixes[styleProp.toLowerCase()] = eventName.toLowerCase();\n  prefixes['Webkit' + styleProp] = 'webkit' + eventName;\n  prefixes['Moz' + styleProp] = 'moz' + eventName;\n  return prefixes;\n}\n/**\n * A list of event names to a configurable list of vendor prefixes.\n */\n\n\nvar vendorPrefixes = {\n  animationend: makePrefixMap('Animation', 'AnimationEnd'),\n  animationiteration: makePrefixMap('Animation', 'AnimationIteration'),\n  animationstart: makePrefixMap('Animation', 'AnimationStart'),\n  transitionend: makePrefixMap('Transition', 'TransitionEnd')\n};\n/**\n * Event names that have already been detected and prefixed (if applicable).\n */\n\nvar prefixedEventNames = {};\n/**\n * Element to check for prefixes on.\n */\n\nvar style = {};\n/**\n * Bootstrap if a DOM exists.\n */\n\nif (canUseDOM) {\n  style = document.createElement('div').style; // On some platforms, in particular some releases of Android 4.x,\n  // the un-prefixed \"animation\" and \"transition\" properties are defined on the\n  // style object but the events that fire will still be prefixed, so we need\n  // to check if the un-prefixed events are usable, and if not remove them from the map.\n\n  if (!('AnimationEvent' in window)) {\n    delete vendorPrefixes.animationend.animation;\n    delete vendorPrefixes.animationiteration.animation;\n    delete vendorPrefixes.animationstart.animation;\n  } // Same as above\n\n\n  if (!('TransitionEvent' in window)) {\n    delete vendorPrefixes.transitionend.transition;\n  }\n}\n/**\n * Attempts to determine the correct vendor prefixed event name.\n *\n * @param {string} eventName\n * @returns {string}\n */\n\n\nfunction getVendorPrefixedEventName(eventName) {\n  if (prefixedEventNames[eventName]) {\n    return prefixedEventNames[eventName];\n  } else if (!vendorPrefixes[eventName]) {\n    return eventName;\n  }\n\n  var prefixMap = vendorPrefixes[eventName];\n\n  for (var styleProp in prefixMap) {\n    if (prefixMap.hasOwnProperty(styleProp) && styleProp in style) {\n      return prefixedEventNames[eventName] = prefixMap[styleProp];\n    }\n  }\n\n  return eventName;\n}\n\nvar ANIMATION_END = getVendorPrefixedEventName('animationend');\nvar ANIMATION_ITERATION = getVendorPrefixedEventName('animationiteration');\nvar ANIMATION_START = getVendorPrefixedEventName('animationstart');\nvar TRANSITION_END = getVendorPrefixedEventName('transitionend');\n\nvar topLevelEventsToReactNames = new Map(); // NOTE: Capitalization is important in this list!\n//\n// E.g. it needs \"pointerDown\", not \"pointerdown\".\n// This is because we derive both React name (\"onPointerDown\")\n// and DOM name (\"pointerdown\") from the same list.\n//\n// Exceptions that don't match this convention are listed separately.\n//\n// prettier-ignore\n\nvar simpleEventPluginEvents = ['abort', 'auxClick', 'cancel', 'canPlay', 'canPlayThrough', 'click', 'close', 'contextMenu', 'copy', 'cut', 'drag', 'dragEnd', 'dragEnter', 'dragExit', 'dragLeave', 'dragOver', 'dragStart', 'drop', 'durationChange', 'emptied', 'encrypted', 'ended', 'error', 'gotPointerCapture', 'input', 'invalid', 'keyDown', 'keyPress', 'keyUp', 'load', 'loadedData', 'loadedMetadata', 'loadStart', 'lostPointerCapture', 'mouseDown', 'mouseMove', 'mouseOut', 'mouseOver', 'mouseUp', 'paste', 'pause', 'play', 'playing', 'pointerCancel', 'pointerDown', 'pointerMove', 'pointerOut', 'pointerOver', 'pointerUp', 'progress', 'rateChange', 'reset', 'resize', 'seeked', 'seeking', 'stalled', 'submit', 'suspend', 'timeUpdate', 'touchCancel', 'touchEnd', 'touchStart', 'volumeChange', 'scroll', 'toggle', 'touchMove', 'waiting', 'wheel'];\n\nfunction registerSimpleEvent(domEventName, reactName) {\n  topLevelEventsToReactNames.set(domEventName, reactName);\n  registerTwoPhaseEvent(reactName, [domEventName]);\n}\n\nfunction registerSimpleEvents() {\n  for (var i = 0; i < simpleEventPluginEvents.length; i++) {\n    var eventName = simpleEventPluginEvents[i];\n    var domEventName = eventName.toLowerCase();\n    var capitalizedEvent = eventName[0].toUpperCase() + eventName.slice(1);\n    registerSimpleEvent(domEventName, 'on' + capitalizedEvent);\n  } // Special cases where event names don't match.\n\n\n  registerSimpleEvent(ANIMATION_END, 'onAnimationEnd');\n  registerSimpleEvent(ANIMATION_ITERATION, 'onAnimationIteration');\n  registerSimpleEvent(ANIMATION_START, 'onAnimationStart');\n  registerSimpleEvent('dblclick', 'onDoubleClick');\n  registerSimpleEvent('focusin', 'onFocus');\n  registerSimpleEvent('focusout', 'onBlur');\n  registerSimpleEvent(TRANSITION_END, 'onTransitionEnd');\n}\n\nfunction extractEvents$4(dispatchQueue, domEventName, targetInst, nativeEvent, nativeEventTarget, eventSystemFlags, targetContainer) {\n  var reactName = topLevelEventsToReactNames.get(domEventName);\n\n  if (reactName === undefined) {\n    return;\n  }\n\n  var SyntheticEventCtor = SyntheticEvent;\n  var reactEventType = domEventName;\n\n  switch (domEventName) {\n    case 'keypress':\n      // Firefox creates a keypress event for function keys too. This removes\n      // the unwanted keypress events. Enter is however both printable and\n      // non-printable. One would expect Tab to be as well (but it isn't).\n      if (getEventCharCode(nativeEvent) === 0) {\n        return;\n      }\n\n    /* falls through */\n\n    case 'keydown':\n    case 'keyup':\n      SyntheticEventCtor = SyntheticKeyboardEvent;\n      break;\n\n    case 'focusin':\n      reactEventType = 'focus';\n      SyntheticEventCtor = SyntheticFocusEvent;\n      break;\n\n    case 'focusout':\n      reactEventType = 'blur';\n      SyntheticEventCtor = SyntheticFocusEvent;\n      break;\n\n    case 'beforeblur':\n    case 'afterblur':\n      SyntheticEventCtor = SyntheticFocusEvent;\n      break;\n\n    case 'click':\n      // Firefox creates a click event on right mouse clicks. This removes the\n      // unwanted click events.\n      if (nativeEvent.button === 2) {\n        return;\n      }\n\n    /* falls through */\n\n    case 'auxclick':\n    case 'dblclick':\n    case 'mousedown':\n    case 'mousemove':\n    case 'mouseup': // TODO: Disabled elements should not respond to mouse events\n\n    /* falls through */\n\n    case 'mouseout':\n    case 'mouseover':\n    case 'contextmenu':\n      SyntheticEventCtor = SyntheticMouseEvent;\n      break;\n\n    case 'drag':\n    case 'dragend':\n    case 'dragenter':\n    case 'dragexit':\n    case 'dragleave':\n    case 'dragover':\n    case 'dragstart':\n    case 'drop':\n      SyntheticEventCtor = SyntheticDragEvent;\n      break;\n\n    case 'touchcancel':\n    case 'touchend':\n    case 'touchmove':\n    case 'touchstart':\n      SyntheticEventCtor = SyntheticTouchEvent;\n      break;\n\n    case ANIMATION_END:\n    case ANIMATION_ITERATION:\n    case ANIMATION_START:\n      SyntheticEventCtor = SyntheticAnimationEvent;\n      break;\n\n    case TRANSITION_END:\n      SyntheticEventCtor = SyntheticTransitionEvent;\n      break;\n\n    case 'scroll':\n      SyntheticEventCtor = SyntheticUIEvent;\n      break;\n\n    case 'wheel':\n      SyntheticEventCtor = SyntheticWheelEvent;\n      break;\n\n    case 'copy':\n    case 'cut':\n    case 'paste':\n      SyntheticEventCtor = SyntheticClipboardEvent;\n      break;\n\n    case 'gotpointercapture':\n    case 'lostpointercapture':\n    case 'pointercancel':\n    case 'pointerdown':\n    case 'pointermove':\n    case 'pointerout':\n    case 'pointerover':\n    case 'pointerup':\n      SyntheticEventCtor = SyntheticPointerEvent;\n      break;\n  }\n\n  var inCapturePhase = (eventSystemFlags & IS_CAPTURE_PHASE) !== 0;\n\n  {\n    // Some events don't bubble in the browser.\n    // In the past, React has always bubbled them, but this can be surprising.\n    // We're going to try aligning closer to the browser behavior by not bubbling\n    // them in React either. We'll start by not bubbling onScroll, and then expand.\n    var accumulateTargetOnly = !inCapturePhase && // TODO: ideally, we'd eventually add all events from\n    // nonDelegatedEvents list in DOMPluginEventSystem.\n    // Then we can remove this special list.\n    // This is a breaking change that can wait until React 18.\n    domEventName === 'scroll';\n\n    var _listeners = accumulateSinglePhaseListeners(targetInst, reactName, nativeEvent.type, inCapturePhase, accumulateTargetOnly);\n\n    if (_listeners.length > 0) {\n      // Intentionally create event lazily.\n      var _event = new SyntheticEventCtor(reactName, reactEventType, null, nativeEvent, nativeEventTarget);\n\n      dispatchQueue.push({\n        event: _event,\n        listeners: _listeners\n      });\n    }\n  }\n}\n\n// TODO: remove top-level side effect.\nregisterSimpleEvents();\nregisterEvents$2();\nregisterEvents$1();\nregisterEvents$3();\nregisterEvents();\n\nfunction extractEvents$5(dispatchQueue, domEventName, targetInst, nativeEvent, nativeEventTarget, eventSystemFlags, targetContainer) {\n  // TODO: we should remove the concept of a \"SimpleEventPlugin\".\n  // This is the basic functionality of the event system. All\n  // the other plugins are essentially polyfills. So the plugin\n  // should probably be inlined somewhere and have its logic\n  // be core the to event system. This would potentially allow\n  // us to ship builds of React without the polyfilled plugins below.\n  extractEvents$4(dispatchQueue, domEventName, targetInst, nativeEvent, nativeEventTarget, eventSystemFlags);\n  var shouldProcessPolyfillPlugins = (eventSystemFlags & SHOULD_NOT_PROCESS_POLYFILL_EVENT_PLUGINS) === 0; // We don't process these events unless we are in the\n  // event's native \"bubble\" phase, which means that we're\n  // not in the capture phase. That's because we emulate\n  // the capture phase here still. This is a trade-off,\n  // because in an ideal world we would not emulate and use\n  // the phases properly, like we do with the SimpleEvent\n  // plugin. However, the plugins below either expect\n  // emulation (EnterLeave) or use state localized to that\n  // plugin (BeforeInput, Change, Select). The state in\n  // these modules complicates things, as you'll essentially\n  // get the case where the capture phase event might change\n  // state, only for the following bubble event to come in\n  // later and not trigger anything as the state now\n  // invalidates the heuristics of the event plugin. We\n  // could alter all these plugins to work in such ways, but\n  // that might cause other unknown side-effects that we\n  // can't foresee right now.\n\n  if (shouldProcessPolyfillPlugins) {\n    extractEvents$2(dispatchQueue, domEventName, targetInst, nativeEvent, nativeEventTarget);\n    extractEvents$1(dispatchQueue, domEventName, targetInst, nativeEvent, nativeEventTarget);\n    extractEvents$3(dispatchQueue, domEventName, targetInst, nativeEvent, nativeEventTarget);\n    extractEvents(dispatchQueue, domEventName, targetInst, nativeEvent, nativeEventTarget);\n  }\n} // List of events that need to be individually attached to media elements.\n\n\nvar mediaEventTypes = ['abort', 'canplay', 'canplaythrough', 'durationchange', 'emptied', 'encrypted', 'ended', 'error', 'loadeddata', 'loadedmetadata', 'loadstart', 'pause', 'play', 'playing', 'progress', 'ratechange', 'resize', 'seeked', 'seeking', 'stalled', 'suspend', 'timeupdate', 'volumechange', 'waiting']; // We should not delegate these events to the container, but rather\n// set them on the actual target element itself. This is primarily\n// because these events do not consistently bubble in the DOM.\n\nvar nonDelegatedEvents = new Set(['cancel', 'close', 'invalid', 'load', 'scroll', 'toggle'].concat(mediaEventTypes));\n\nfunction executeDispatch(event, listener, currentTarget) {\n  var type = event.type || 'unknown-event';\n  event.currentTarget = currentTarget;\n  invokeGuardedCallbackAndCatchFirstError(type, listener, undefined, event);\n  event.currentTarget = null;\n}\n\nfunction processDispatchQueueItemsInOrder(event, dispatchListeners, inCapturePhase) {\n  var previousInstance;\n\n  if (inCapturePhase) {\n    for (var i = dispatchListeners.length - 1; i >= 0; i--) {\n      var _dispatchListeners$i = dispatchListeners[i],\n          instance = _dispatchListeners$i.instance,\n          currentTarget = _dispatchListeners$i.currentTarget,\n          listener = _dispatchListeners$i.listener;\n\n      if (instance !== previousInstance && event.isPropagationStopped()) {\n        return;\n      }\n\n      executeDispatch(event, listener, currentTarget);\n      previousInstance = instance;\n    }\n  } else {\n    for (var _i = 0; _i < dispatchListeners.length; _i++) {\n      var _dispatchListeners$_i = dispatchListeners[_i],\n          _instance = _dispatchListeners$_i.instance,\n          _currentTarget = _dispatchListeners$_i.currentTarget,\n          _listener = _dispatchListeners$_i.listener;\n\n      if (_instance !== previousInstance && event.isPropagationStopped()) {\n        return;\n      }\n\n      executeDispatch(event, _listener, _currentTarget);\n      previousInstance = _instance;\n    }\n  }\n}\n\nfunction processDispatchQueue(dispatchQueue, eventSystemFlags) {\n  var inCapturePhase = (eventSystemFlags & IS_CAPTURE_PHASE) !== 0;\n\n  for (var i = 0; i < dispatchQueue.length; i++) {\n    var _dispatchQueue$i = dispatchQueue[i],\n        event = _dispatchQueue$i.event,\n        listeners = _dispatchQueue$i.listeners;\n    processDispatchQueueItemsInOrder(event, listeners, inCapturePhase); //  event system doesn't use pooling.\n  } // This would be a good time to rethrow if any of the event handlers threw.\n\n\n  rethrowCaughtError();\n}\n\nfunction dispatchEventsForPlugins(domEventName, eventSystemFlags, nativeEvent, targetInst, targetContainer) {\n  var nativeEventTarget = getEventTarget(nativeEvent);\n  var dispatchQueue = [];\n  extractEvents$5(dispatchQueue, domEventName, targetInst, nativeEvent, nativeEventTarget, eventSystemFlags);\n  processDispatchQueue(dispatchQueue, eventSystemFlags);\n}\n\nfunction listenToNonDelegatedEvent(domEventName, targetElement) {\n  {\n    if (!nonDelegatedEvents.has(domEventName)) {\n      error('Did not expect a listenToNonDelegatedEvent() call for \"%s\". ' + 'This is a bug in React. Please file an issue.', domEventName);\n    }\n  }\n\n  var isCapturePhaseListener = false;\n  var listenerSet = getEventListenerSet(targetElement);\n  var listenerSetKey = getListenerSetKey(domEventName, isCapturePhaseListener);\n\n  if (!listenerSet.has(listenerSetKey)) {\n    addTrappedEventListener(targetElement, domEventName, IS_NON_DELEGATED, isCapturePhaseListener);\n    listenerSet.add(listenerSetKey);\n  }\n}\nfunction listenToNativeEvent(domEventName, isCapturePhaseListener, target) {\n  {\n    if (nonDelegatedEvents.has(domEventName) && !isCapturePhaseListener) {\n      error('Did not expect a listenToNativeEvent() call for \"%s\" in the bubble phase. ' + 'This is a bug in React. Please file an issue.', domEventName);\n    }\n  }\n\n  var eventSystemFlags = 0;\n\n  if (isCapturePhaseListener) {\n    eventSystemFlags |= IS_CAPTURE_PHASE;\n  }\n\n  addTrappedEventListener(target, domEventName, eventSystemFlags, isCapturePhaseListener);\n} // This is only used by createEventHandle when the\nvar listeningMarker = '_reactListening' + Math.random().toString(36).slice(2);\nfunction listenToAllSupportedEvents(rootContainerElement) {\n  if (!rootContainerElement[listeningMarker]) {\n    rootContainerElement[listeningMarker] = true;\n    allNativeEvents.forEach(function (domEventName) {\n      // We handle selectionchange separately because it\n      // doesn't bubble and needs to be on the document.\n      if (domEventName !== 'selectionchange') {\n        if (!nonDelegatedEvents.has(domEventName)) {\n          listenToNativeEvent(domEventName, false, rootContainerElement);\n        }\n\n        listenToNativeEvent(domEventName, true, rootContainerElement);\n      }\n    });\n    var ownerDocument = rootContainerElement.nodeType === DOCUMENT_NODE ? rootContainerElement : rootContainerElement.ownerDocument;\n\n    if (ownerDocument !== null) {\n      // The selectionchange event also needs deduplication\n      // but it is attached to the document.\n      if (!ownerDocument[listeningMarker]) {\n        ownerDocument[listeningMarker] = true;\n        listenToNativeEvent('selectionchange', false, ownerDocument);\n      }\n    }\n  }\n}\n\nfunction addTrappedEventListener(targetContainer, domEventName, eventSystemFlags, isCapturePhaseListener, isDeferredListenerForLegacyFBSupport) {\n  var listener = createEventListenerWrapperWithPriority(targetContainer, domEventName, eventSystemFlags); // If passive option is not supported, then the event will be\n  // active and not passive.\n\n  var isPassiveListener = undefined;\n\n  if (passiveBrowserEventsSupported) {\n    // Browsers introduced an intervention, making these events\n    // passive by default on document. React doesn't bind them\n    // to document anymore, but changing this now would undo\n    // the performance wins from the change. So we emulate\n    // the existing behavior manually on the roots now.\n    // https://github.com/facebook/react/issues/19651\n    if (domEventName === 'touchstart' || domEventName === 'touchmove' || domEventName === 'wheel') {\n      isPassiveListener = true;\n    }\n  }\n\n  targetContainer =  targetContainer;\n  var unsubscribeListener; // When legacyFBSupport is enabled, it's for when we\n\n\n  if (isCapturePhaseListener) {\n    if (isPassiveListener !== undefined) {\n      unsubscribeListener = addEventCaptureListenerWithPassiveFlag(targetContainer, domEventName, listener, isPassiveListener);\n    } else {\n      unsubscribeListener = addEventCaptureListener(targetContainer, domEventName, listener);\n    }\n  } else {\n    if (isPassiveListener !== undefined) {\n      unsubscribeListener = addEventBubbleListenerWithPassiveFlag(targetContainer, domEventName, listener, isPassiveListener);\n    } else {\n      unsubscribeListener = addEventBubbleListener(targetContainer, domEventName, listener);\n    }\n  }\n}\n\nfunction isMatchingRootContainer(grandContainer, targetContainer) {\n  return grandContainer === targetContainer || grandContainer.nodeType === COMMENT_NODE && grandContainer.parentNode === targetContainer;\n}\n\nfunction dispatchEventForPluginEventSystem(domEventName, eventSystemFlags, nativeEvent, targetInst, targetContainer) {\n  var ancestorInst = targetInst;\n\n  if ((eventSystemFlags & IS_EVENT_HANDLE_NON_MANAGED_NODE) === 0 && (eventSystemFlags & IS_NON_DELEGATED) === 0) {\n    var targetContainerNode = targetContainer; // If we are using the legacy FB support flag, we\n\n    if (targetInst !== null) {\n      // The below logic attempts to work out if we need to change\n      // the target fiber to a different ancestor. We had similar logic\n      // in the legacy event system, except the big difference between\n      // systems is that the modern event system now has an event listener\n      // attached to each React Root and React Portal Root. Together,\n      // the DOM nodes representing these roots are the \"rootContainer\".\n      // To figure out which ancestor instance we should use, we traverse\n      // up the fiber tree from the target instance and attempt to find\n      // root boundaries that match that of our current \"rootContainer\".\n      // If we find that \"rootContainer\", we find the parent fiber\n      // sub-tree for that root and make that our ancestor instance.\n      var node = targetInst;\n\n      mainLoop: while (true) {\n        if (node === null) {\n          return;\n        }\n\n        var nodeTag = node.tag;\n\n        if (nodeTag === HostRoot || nodeTag === HostPortal) {\n          var container = node.stateNode.containerInfo;\n\n          if (isMatchingRootContainer(container, targetContainerNode)) {\n            break;\n          }\n\n          if (nodeTag === HostPortal) {\n            // The target is a portal, but it's not the rootContainer we're looking for.\n            // Normally portals handle their own events all the way down to the root.\n            // So we should be able to stop now. However, we don't know if this portal\n            // was part of *our* root.\n            var grandNode = node.return;\n\n            while (grandNode !== null) {\n              var grandTag = grandNode.tag;\n\n              if (grandTag === HostRoot || grandTag === HostPortal) {\n                var grandContainer = grandNode.stateNode.containerInfo;\n\n                if (isMatchingRootContainer(grandContainer, targetContainerNode)) {\n                  // This is the rootContainer we're looking for and we found it as\n                  // a parent of the Portal. That means we can ignore it because the\n                  // Portal will bubble through to us.\n                  return;\n                }\n              }\n\n              grandNode = grandNode.return;\n            }\n          } // Now we need to find it's corresponding host fiber in the other\n          // tree. To do this we can use getClosestInstanceFromNode, but we\n          // need to validate that the fiber is a host instance, otherwise\n          // we need to traverse up through the DOM till we find the correct\n          // node that is from the other tree.\n\n\n          while (container !== null) {\n            var parentNode = getClosestInstanceFromNode(container);\n\n            if (parentNode === null) {\n              return;\n            }\n\n            var parentTag = parentNode.tag;\n\n            if (parentTag === HostComponent || parentTag === HostText) {\n              node = ancestorInst = parentNode;\n              continue mainLoop;\n            }\n\n            container = container.parentNode;\n          }\n        }\n\n        node = node.return;\n      }\n    }\n  }\n\n  batchedUpdates(function () {\n    return dispatchEventsForPlugins(domEventName, eventSystemFlags, nativeEvent, ancestorInst);\n  });\n}\n\nfunction createDispatchListener(instance, listener, currentTarget) {\n  return {\n    instance: instance,\n    listener: listener,\n    currentTarget: currentTarget\n  };\n}\n\nfunction accumulateSinglePhaseListeners(targetFiber, reactName, nativeEventType, inCapturePhase, accumulateTargetOnly, nativeEvent) {\n  var captureName = reactName !== null ? reactName + 'Capture' : null;\n  var reactEventName = inCapturePhase ? captureName : reactName;\n  var listeners = [];\n  var instance = targetFiber;\n  var lastHostComponent = null; // Accumulate all instances and listeners via the target -> root path.\n\n  while (instance !== null) {\n    var _instance2 = instance,\n        stateNode = _instance2.stateNode,\n        tag = _instance2.tag; // Handle listeners that are on HostComponents (i.e. <div>)\n\n    if (tag === HostComponent && stateNode !== null) {\n      lastHostComponent = stateNode; // createEventHandle listeners\n\n\n      if (reactEventName !== null) {\n        var listener = getListener(instance, reactEventName);\n\n        if (listener != null) {\n          listeners.push(createDispatchListener(instance, listener, lastHostComponent));\n        }\n      }\n    } // If we are only accumulating events for the target, then we don't\n    // continue to propagate through the React fiber tree to find other\n    // listeners.\n\n\n    if (accumulateTargetOnly) {\n      break;\n    } // If we are processing the onBeforeBlur event, then we need to take\n\n    instance = instance.return;\n  }\n\n  return listeners;\n} // We should only use this function for:\n// - BeforeInputEventPlugin\n// - ChangeEventPlugin\n// - SelectEventPlugin\n// This is because we only process these plugins\n// in the bubble phase, so we need to accumulate two\n// phase event listeners (via emulation).\n\nfunction accumulateTwoPhaseListeners(targetFiber, reactName) {\n  var captureName = reactName + 'Capture';\n  var listeners = [];\n  var instance = targetFiber; // Accumulate all instances and listeners via the target -> root path.\n\n  while (instance !== null) {\n    var _instance3 = instance,\n        stateNode = _instance3.stateNode,\n        tag = _instance3.tag; // Handle listeners that are on HostComponents (i.e. <div>)\n\n    if (tag === HostComponent && stateNode !== null) {\n      var currentTarget = stateNode;\n      var captureListener = getListener(instance, captureName);\n\n      if (captureListener != null) {\n        listeners.unshift(createDispatchListener(instance, captureListener, currentTarget));\n      }\n\n      var bubbleListener = getListener(instance, reactName);\n\n      if (bubbleListener != null) {\n        listeners.push(createDispatchListener(instance, bubbleListener, currentTarget));\n      }\n    }\n\n    instance = instance.return;\n  }\n\n  return listeners;\n}\n\nfunction getParent(inst) {\n  if (inst === null) {\n    return null;\n  }\n\n  do {\n    inst = inst.return; // TODO: If this is a HostRoot we might want to bail out.\n    // That is depending on if we want nested subtrees (layers) to bubble\n    // events to their parent. We could also go through parentNode on the\n    // host node but that wouldn't work for React Native and doesn't let us\n    // do the portal feature.\n  } while (inst && inst.tag !== HostComponent);\n\n  if (inst) {\n    return inst;\n  }\n\n  return null;\n}\n/**\n * Return the lowest common ancestor of A and B, or null if they are in\n * different trees.\n */\n\n\nfunction getLowestCommonAncestor(instA, instB) {\n  var nodeA = instA;\n  var nodeB = instB;\n  var depthA = 0;\n\n  for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {\n    depthA++;\n  }\n\n  var depthB = 0;\n\n  for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {\n    depthB++;\n  } // If A is deeper, crawl up.\n\n\n  while (depthA - depthB > 0) {\n    nodeA = getParent(nodeA);\n    depthA--;\n  } // If B is deeper, crawl up.\n\n\n  while (depthB - depthA > 0) {\n    nodeB = getParent(nodeB);\n    depthB--;\n  } // Walk in lockstep until we find a match.\n\n\n  var depth = depthA;\n\n  while (depth--) {\n    if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {\n      return nodeA;\n    }\n\n    nodeA = getParent(nodeA);\n    nodeB = getParent(nodeB);\n  }\n\n  return null;\n}\n\nfunction accumulateEnterLeaveListenersForEvent(dispatchQueue, event, target, common, inCapturePhase) {\n  var registrationName = event._reactName;\n  var listeners = [];\n  var instance = target;\n\n  while (instance !== null) {\n    if (instance === common) {\n      break;\n    }\n\n    var _instance4 = instance,\n        alternate = _instance4.alternate,\n        stateNode = _instance4.stateNode,\n        tag = _instance4.tag;\n\n    if (alternate !== null && alternate === common) {\n      break;\n    }\n\n    if (tag === HostComponent && stateNode !== null) {\n      var currentTarget = stateNode;\n\n      if (inCapturePhase) {\n        var captureListener = getListener(instance, registrationName);\n\n        if (captureListener != null) {\n          listeners.unshift(createDispatchListener(instance, captureListener, currentTarget));\n        }\n      } else if (!inCapturePhase) {\n        var bubbleListener = getListener(instance, registrationName);\n\n        if (bubbleListener != null) {\n          listeners.push(createDispatchListener(instance, bubbleListener, currentTarget));\n        }\n      }\n    }\n\n    instance = instance.return;\n  }\n\n  if (listeners.length !== 0) {\n    dispatchQueue.push({\n      event: event,\n      listeners: listeners\n    });\n  }\n} // We should only use this function for:\n// - EnterLeaveEventPlugin\n// This is because we only process this plugin\n// in the bubble phase, so we need to accumulate two\n// phase event listeners.\n\n\nfunction accumulateEnterLeaveTwoPhaseListeners(dispatchQueue, leaveEvent, enterEvent, from, to) {\n  var common = from && to ? getLowestCommonAncestor(from, to) : null;\n\n  if (from !== null) {\n    accumulateEnterLeaveListenersForEvent(dispatchQueue, leaveEvent, from, common, false);\n  }\n\n  if (to !== null && enterEvent !== null) {\n    accumulateEnterLeaveListenersForEvent(dispatchQueue, enterEvent, to, common, true);\n  }\n}\nfunction getListenerSetKey(domEventName, capture) {\n  return domEventName + \"__\" + (capture ? 'capture' : 'bubble');\n}\n\nvar didWarnInvalidHydration = false;\nvar DANGEROUSLY_SET_INNER_HTML = 'dangerouslySetInnerHTML';\nvar SUPPRESS_CONTENT_EDITABLE_WARNING = 'suppressContentEditableWarning';\nvar SUPPRESS_HYDRATION_WARNING = 'suppressHydrationWarning';\nvar AUTOFOCUS = 'autoFocus';\nvar CHILDREN = 'children';\nvar STYLE = 'style';\nvar HTML$1 = '__html';\nvar warnedUnknownTags;\nvar validatePropertiesInDevelopment;\nvar warnForPropDifference;\nvar warnForExtraAttributes;\nvar warnForInvalidEventListener;\nvar canDiffStyleForHydrationWarning;\nvar normalizeHTML;\n\n{\n  warnedUnknownTags = {\n    // There are working polyfills for <dialog>. Let people use it.\n    dialog: true,\n    // Electron ships a custom <webview> tag to display external web content in\n    // an isolated frame and process.\n    // This tag is not present in non Electron environments such as JSDom which\n    // is often used for testing purposes.\n    // @see https://electronjs.org/docs/api/webview-tag\n    webview: true\n  };\n\n  validatePropertiesInDevelopment = function (type, props) {\n    validateProperties(type, props);\n    validateProperties$1(type, props);\n    validateProperties$2(type, props, {\n      registrationNameDependencies: registrationNameDependencies,\n      possibleRegistrationNames: possibleRegistrationNames\n    });\n  }; // IE 11 parses & normalizes the style attribute as opposed to other\n  // browsers. It adds spaces and sorts the properties in some\n  // non-alphabetical order. Handling that would require sorting CSS\n  // properties in the client & server versions or applying\n  // `expectedStyle` to a temporary DOM node to read its `style` attribute\n  // normalized. Since it only affects IE, we're skipping style warnings\n  // in that browser completely in favor of doing all that work.\n  // See https://github.com/facebook/react/issues/11807\n\n\n  canDiffStyleForHydrationWarning = canUseDOM && !document.documentMode;\n\n  warnForPropDifference = function (propName, serverValue, clientValue) {\n    if (didWarnInvalidHydration) {\n      return;\n    }\n\n    var normalizedClientValue = normalizeMarkupForTextOrAttribute(clientValue);\n    var normalizedServerValue = normalizeMarkupForTextOrAttribute(serverValue);\n\n    if (normalizedServerValue === normalizedClientValue) {\n      return;\n    }\n\n    didWarnInvalidHydration = true;\n\n    error('Prop `%s` did not match. Server: %s Client: %s', propName, JSON.stringify(normalizedServerValue), JSON.stringify(normalizedClientValue));\n  };\n\n  warnForExtraAttributes = function (attributeNames) {\n    if (didWarnInvalidHydration) {\n      return;\n    }\n\n    didWarnInvalidHydration = true;\n    var names = [];\n    attributeNames.forEach(function (name) {\n      names.push(name);\n    });\n\n    error('Extra attributes from the server: %s', names);\n  };\n\n  warnForInvalidEventListener = function (registrationName, listener) {\n    if (listener === false) {\n      error('Expected `%s` listener to be a function, instead got `false`.\\n\\n' + 'If you used to conditionally omit it with %s={condition && value}, ' + 'pass %s={condition ? value : undefined} instead.', registrationName, registrationName, registrationName);\n    } else {\n      error('Expected `%s` listener to be a function, instead got a value of `%s` type.', registrationName, typeof listener);\n    }\n  }; // Parse the HTML and read it back to normalize the HTML string so that it\n  // can be used for comparison.\n\n\n  normalizeHTML = function (parent, html) {\n    // We could have created a separate document here to avoid\n    // re-initializing custom elements if they exist. But this breaks\n    // how <noscript> is being handled. So we use the same document.\n    // See the discussion in https://github.com/facebook/react/pull/11157.\n    var testElement = parent.namespaceURI === HTML_NAMESPACE ? parent.ownerDocument.createElement(parent.tagName) : parent.ownerDocument.createElementNS(parent.namespaceURI, parent.tagName);\n    testElement.innerHTML = html;\n    return testElement.innerHTML;\n  };\n} // HTML parsing normalizes CR and CRLF to LF.\n// It also can turn \\u0000 into \\uFFFD inside attributes.\n// https://www.w3.org/TR/html5/single-page.html#preprocessing-the-input-stream\n// If we have a mismatch, it might be caused by that.\n// We will still patch up in this case but not fire the warning.\n\n\nvar NORMALIZE_NEWLINES_REGEX = /\\r\\n?/g;\nvar NORMALIZE_NULL_AND_REPLACEMENT_REGEX = /\\u0000|\\uFFFD/g;\n\nfunction normalizeMarkupForTextOrAttribute(markup) {\n  {\n    checkHtmlStringCoercion(markup);\n  }\n\n  var markupString = typeof markup === 'string' ? markup : '' + markup;\n  return markupString.replace(NORMALIZE_NEWLINES_REGEX, '\\n').replace(NORMALIZE_NULL_AND_REPLACEMENT_REGEX, '');\n}\n\nfunction checkForUnmatchedText(serverText, clientText, isConcurrentMode, shouldWarnDev) {\n  var normalizedClientText = normalizeMarkupForTextOrAttribute(clientText);\n  var normalizedServerText = normalizeMarkupForTextOrAttribute(serverText);\n\n  if (normalizedServerText === normalizedClientText) {\n    return;\n  }\n\n  if (shouldWarnDev) {\n    {\n      if (!didWarnInvalidHydration) {\n        didWarnInvalidHydration = true;\n\n        error('Text content did not match. Server: \"%s\" Client: \"%s\"', normalizedServerText, normalizedClientText);\n      }\n    }\n  }\n\n  if (isConcurrentMode && enableClientRenderFallbackOnTextMismatch) {\n    // In concurrent roots, we throw when there's a text mismatch and revert to\n    // client rendering, up to the nearest Suspense boundary.\n    throw new Error('Text content does not match server-rendered HTML.');\n  }\n}\n\nfunction getOwnerDocumentFromRootContainer(rootContainerElement) {\n  return rootContainerElement.nodeType === DOCUMENT_NODE ? rootContainerElement : rootContainerElement.ownerDocument;\n}\n\nfunction noop() {}\n\nfunction trapClickOnNonInteractiveElement(node) {\n  // Mobile Safari does not fire properly bubble click events on\n  // non-interactive elements, which means delegated click listeners do not\n  // fire. The workaround for this bug involves attaching an empty click\n  // listener on the target node.\n  // https://www.quirksmode.org/blog/archives/2010/09/click_event_del.html\n  // Just set it using the onclick property so that we don't have to manage any\n  // bookkeeping for it. Not sure if we need to clear it when the listener is\n  // removed.\n  // TODO: Only do this for the relevant Safaris maybe?\n  node.onclick = noop;\n}\n\nfunction setInitialDOMProperties(tag, domElement, rootContainerElement, nextProps, isCustomComponentTag) {\n  for (var propKey in nextProps) {\n    if (!nextProps.hasOwnProperty(propKey)) {\n      continue;\n    }\n\n    var nextProp = nextProps[propKey];\n\n    if (propKey === STYLE) {\n      {\n        if (nextProp) {\n          // Freeze the next style object so that we can assume it won't be\n          // mutated. We have already warned for this in the past.\n          Object.freeze(nextProp);\n        }\n      } // Relies on `updateStylesByID` not mutating `styleUpdates`.\n\n\n      setValueForStyles(domElement, nextProp);\n    } else if (propKey === DANGEROUSLY_SET_INNER_HTML) {\n      var nextHtml = nextProp ? nextProp[HTML$1] : undefined;\n\n      if (nextHtml != null) {\n        setInnerHTML(domElement, nextHtml);\n      }\n    } else if (propKey === CHILDREN) {\n      if (typeof nextProp === 'string') {\n        // Avoid setting initial textContent when the text is empty. In IE11 setting\n        // textContent on a <textarea> will cause the placeholder to not\n        // show within the <textarea> until it has been focused and blurred again.\n        // https://github.com/facebook/react/issues/6731#issuecomment-254874553\n        var canSetTextContent = tag !== 'textarea' || nextProp !== '';\n\n        if (canSetTextContent) {\n          setTextContent(domElement, nextProp);\n        }\n      } else if (typeof nextProp === 'number') {\n        setTextContent(domElement, '' + nextProp);\n      }\n    } else if (propKey === SUPPRESS_CONTENT_EDITABLE_WARNING || propKey === SUPPRESS_HYDRATION_WARNING) ; else if (propKey === AUTOFOCUS) ; else if (registrationNameDependencies.hasOwnProperty(propKey)) {\n      if (nextProp != null) {\n        if ( typeof nextProp !== 'function') {\n          warnForInvalidEventListener(propKey, nextProp);\n        }\n\n        if (propKey === 'onScroll') {\n          listenToNonDelegatedEvent('scroll', domElement);\n        }\n      }\n    } else if (nextProp != null) {\n      setValueForProperty(domElement, propKey, nextProp, isCustomComponentTag);\n    }\n  }\n}\n\nfunction updateDOMProperties(domElement, updatePayload, wasCustomComponentTag, isCustomComponentTag) {\n  // TODO: Handle wasCustomComponentTag\n  for (var i = 0; i < updatePayload.length; i += 2) {\n    var propKey = updatePayload[i];\n    var propValue = updatePayload[i + 1];\n\n    if (propKey === STYLE) {\n      setValueForStyles(domElement, propValue);\n    } else if (propKey === DANGEROUSLY_SET_INNER_HTML) {\n      setInnerHTML(domElement, propValue);\n    } else if (propKey === CHILDREN) {\n      setTextContent(domElement, propValue);\n    } else {\n      setValueForProperty(domElement, propKey, propValue, isCustomComponentTag);\n    }\n  }\n}\n\nfunction createElement(type, props, rootContainerElement, parentNamespace) {\n  var isCustomComponentTag; // We create tags in the namespace of their parent container, except HTML\n  // tags get no namespace.\n\n  var ownerDocument = getOwnerDocumentFromRootContainer(rootContainerElement);\n  var domElement;\n  var namespaceURI = parentNamespace;\n\n  if (namespaceURI === HTML_NAMESPACE) {\n    namespaceURI = getIntrinsicNamespace(type);\n  }\n\n  if (namespaceURI === HTML_NAMESPACE) {\n    {\n      isCustomComponentTag = isCustomComponent(type, props); // Should this check be gated by parent namespace? Not sure we want to\n      // allow <SVG> or <mATH>.\n\n      if (!isCustomComponentTag && type !== type.toLowerCase()) {\n        error('<%s /> is using incorrect casing. ' + 'Use PascalCase for React components, ' + 'or lowercase for HTML elements.', type);\n      }\n    }\n\n    if (type === 'script') {\n      // Create the script via .innerHTML so its \"parser-inserted\" flag is\n      // set to true and it does not execute\n      var div = ownerDocument.createElement('div');\n\n      div.innerHTML = '<script><' + '/script>'; // eslint-disable-line\n      // This is guaranteed to yield a script element.\n\n      var firstChild = div.firstChild;\n      domElement = div.removeChild(firstChild);\n    } else if (typeof props.is === 'string') {\n      // $FlowIssue `createElement` should be updated for Web Components\n      domElement = ownerDocument.createElement(type, {\n        is: props.is\n      });\n    } else {\n      // Separate else branch instead of using `props.is || undefined` above because of a Firefox bug.\n      // See discussion in https://github.com/facebook/react/pull/6896\n      // and discussion in https://bugzilla.mozilla.org/show_bug.cgi?id=1276240\n      domElement = ownerDocument.createElement(type); // Normally attributes are assigned in `setInitialDOMProperties`, however the `multiple` and `size`\n      // attributes on `select`s needs to be added before `option`s are inserted.\n      // This prevents:\n      // - a bug where the `select` does not scroll to the correct option because singular\n      //  `select` elements automatically pick the first item #13222\n      // - a bug where the `select` set the first item as selected despite the `size` attribute #14239\n      // See https://github.com/facebook/react/issues/13222\n      // and https://github.com/facebook/react/issues/14239\n\n      if (type === 'select') {\n        var node = domElement;\n\n        if (props.multiple) {\n          node.multiple = true;\n        } else if (props.size) {\n          // Setting a size greater than 1 causes a select to behave like `multiple=true`, where\n          // it is possible that no option is selected.\n          //\n          // This is only necessary when a select in \"single selection mode\".\n          node.size = props.size;\n        }\n      }\n    }\n  } else {\n    domElement = ownerDocument.createElementNS(namespaceURI, type);\n  }\n\n  {\n    if (namespaceURI === HTML_NAMESPACE) {\n      if (!isCustomComponentTag && Object.prototype.toString.call(domElement) === '[object HTMLUnknownElement]' && !hasOwnProperty.call(warnedUnknownTags, type)) {\n        warnedUnknownTags[type] = true;\n\n        error('The tag <%s> is unrecognized in this browser. ' + 'If you meant to render a React component, start its name with ' + 'an uppercase letter.', type);\n      }\n    }\n  }\n\n  return domElement;\n}\nfunction createTextNode(text, rootContainerElement) {\n  return getOwnerDocumentFromRootContainer(rootContainerElement).createTextNode(text);\n}\nfunction setInitialProperties(domElement, tag, rawProps, rootContainerElement) {\n  var isCustomComponentTag = isCustomComponent(tag, rawProps);\n\n  {\n    validatePropertiesInDevelopment(tag, rawProps);\n  } // TODO: Make sure that we check isMounted before firing any of these events.\n\n\n  var props;\n\n  switch (tag) {\n    case 'dialog':\n      listenToNonDelegatedEvent('cancel', domElement);\n      listenToNonDelegatedEvent('close', domElement);\n      props = rawProps;\n      break;\n\n    case 'iframe':\n    case 'object':\n    case 'embed':\n      // We listen to this event in case to ensure emulated bubble\n      // listeners still fire for the load event.\n      listenToNonDelegatedEvent('load', domElement);\n      props = rawProps;\n      break;\n\n    case 'video':\n    case 'audio':\n      // We listen to these events in case to ensure emulated bubble\n      // listeners still fire for all the media events.\n      for (var i = 0; i < mediaEventTypes.length; i++) {\n        listenToNonDelegatedEvent(mediaEventTypes[i], domElement);\n      }\n\n      props = rawProps;\n      break;\n\n    case 'source':\n      // We listen to this event in case to ensure emulated bubble\n      // listeners still fire for the error event.\n      listenToNonDelegatedEvent('error', domElement);\n      props = rawProps;\n      break;\n\n    case 'img':\n    case 'image':\n    case 'link':\n      // We listen to these events in case to ensure emulated bubble\n      // listeners still fire for error and load events.\n      listenToNonDelegatedEvent('error', domElement);\n      listenToNonDelegatedEvent('load', domElement);\n      props = rawProps;\n      break;\n\n    case 'details':\n      // We listen to this event in case to ensure emulated bubble\n      // listeners still fire for the toggle event.\n      listenToNonDelegatedEvent('toggle', domElement);\n      props = rawProps;\n      break;\n\n    case 'input':\n      initWrapperState(domElement, rawProps);\n      props = getHostProps(domElement, rawProps); // We listen to this event in case to ensure emulated bubble\n      // listeners still fire for the invalid event.\n\n      listenToNonDelegatedEvent('invalid', domElement);\n      break;\n\n    case 'option':\n      validateProps(domElement, rawProps);\n      props = rawProps;\n      break;\n\n    case 'select':\n      initWrapperState$1(domElement, rawProps);\n      props = getHostProps$1(domElement, rawProps); // We listen to this event in case to ensure emulated bubble\n      // listeners still fire for the invalid event.\n\n      listenToNonDelegatedEvent('invalid', domElement);\n      break;\n\n    case 'textarea':\n      initWrapperState$2(domElement, rawProps);\n      props = getHostProps$2(domElement, rawProps); // We listen to this event in case to ensure emulated bubble\n      // listeners still fire for the invalid event.\n\n      listenToNonDelegatedEvent('invalid', domElement);\n      break;\n\n    default:\n      props = rawProps;\n  }\n\n  assertValidProps(tag, props);\n  setInitialDOMProperties(tag, domElement, rootContainerElement, props, isCustomComponentTag);\n\n  switch (tag) {\n    case 'input':\n      // TODO: Make sure we check if this is still unmounted or do any clean\n      // up necessary since we never stop tracking anymore.\n      track(domElement);\n      postMountWrapper(domElement, rawProps, false);\n      break;\n\n    case 'textarea':\n      // TODO: Make sure we check if this is still unmounted or do any clean\n      // up necessary since we never stop tracking anymore.\n      track(domElement);\n      postMountWrapper$3(domElement);\n      break;\n\n    case 'option':\n      postMountWrapper$1(domElement, rawProps);\n      break;\n\n    case 'select':\n      postMountWrapper$2(domElement, rawProps);\n      break;\n\n    default:\n      if (typeof props.onClick === 'function') {\n        // TODO: This cast may not be sound for SVG, MathML or custom elements.\n        trapClickOnNonInteractiveElement(domElement);\n      }\n\n      break;\n  }\n} // Calculate the diff between the two objects.\n\nfunction diffProperties(domElement, tag, lastRawProps, nextRawProps, rootContainerElement) {\n  {\n    validatePropertiesInDevelopment(tag, nextRawProps);\n  }\n\n  var updatePayload = null;\n  var lastProps;\n  var nextProps;\n\n  switch (tag) {\n    case 'input':\n      lastProps = getHostProps(domElement, lastRawProps);\n      nextProps = getHostProps(domElement, nextRawProps);\n      updatePayload = [];\n      break;\n\n    case 'select':\n      lastProps = getHostProps$1(domElement, lastRawProps);\n      nextProps = getHostProps$1(domElement, nextRawProps);\n      updatePayload = [];\n      break;\n\n    case 'textarea':\n      lastProps = getHostProps$2(domElement, lastRawProps);\n      nextProps = getHostProps$2(domElement, nextRawProps);\n      updatePayload = [];\n      break;\n\n    default:\n      lastProps = lastRawProps;\n      nextProps = nextRawProps;\n\n      if (typeof lastProps.onClick !== 'function' && typeof nextProps.onClick === 'function') {\n        // TODO: This cast may not be sound for SVG, MathML or custom elements.\n        trapClickOnNonInteractiveElement(domElement);\n      }\n\n      break;\n  }\n\n  assertValidProps(tag, nextProps);\n  var propKey;\n  var styleName;\n  var styleUpdates = null;\n\n  for (propKey in lastProps) {\n    if (nextProps.hasOwnProperty(propKey) || !lastProps.hasOwnProperty(propKey) || lastProps[propKey] == null) {\n      continue;\n    }\n\n    if (propKey === STYLE) {\n      var lastStyle = lastProps[propKey];\n\n      for (styleName in lastStyle) {\n        if (lastStyle.hasOwnProperty(styleName)) {\n          if (!styleUpdates) {\n            styleUpdates = {};\n          }\n\n          styleUpdates[styleName] = '';\n        }\n      }\n    } else if (propKey === DANGEROUSLY_SET_INNER_HTML || propKey === CHILDREN) ; else if (propKey === SUPPRESS_CONTENT_EDITABLE_WARNING || propKey === SUPPRESS_HYDRATION_WARNING) ; else if (propKey === AUTOFOCUS) ; else if (registrationNameDependencies.hasOwnProperty(propKey)) {\n      // This is a special case. If any listener updates we need to ensure\n      // that the \"current\" fiber pointer gets updated so we need a commit\n      // to update this element.\n      if (!updatePayload) {\n        updatePayload = [];\n      }\n    } else {\n      // For all other deleted properties we add it to the queue. We use\n      // the allowed property list in the commit phase instead.\n      (updatePayload = updatePayload || []).push(propKey, null);\n    }\n  }\n\n  for (propKey in nextProps) {\n    var nextProp = nextProps[propKey];\n    var lastProp = lastProps != null ? lastProps[propKey] : undefined;\n\n    if (!nextProps.hasOwnProperty(propKey) || nextProp === lastProp || nextProp == null && lastProp == null) {\n      continue;\n    }\n\n    if (propKey === STYLE) {\n      {\n        if (nextProp) {\n          // Freeze the next style object so that we can assume it won't be\n          // mutated. We have already warned for this in the past.\n          Object.freeze(nextProp);\n        }\n      }\n\n      if (lastProp) {\n        // Unset styles on `lastProp` but not on `nextProp`.\n        for (styleName in lastProp) {\n          if (lastProp.hasOwnProperty(styleName) && (!nextProp || !nextProp.hasOwnProperty(styleName))) {\n            if (!styleUpdates) {\n              styleUpdates = {};\n            }\n\n            styleUpdates[styleName] = '';\n          }\n        } // Update styles that changed since `lastProp`.\n\n\n        for (styleName in nextProp) {\n          if (nextProp.hasOwnProperty(styleName) && lastProp[styleName] !== nextProp[styleName]) {\n            if (!styleUpdates) {\n              styleUpdates = {};\n            }\n\n            styleUpdates[styleName] = nextProp[styleName];\n          }\n        }\n      } else {\n        // Relies on `updateStylesByID` not mutating `styleUpdates`.\n        if (!styleUpdates) {\n          if (!updatePayload) {\n            updatePayload = [];\n          }\n\n          updatePayload.push(propKey, styleUpdates);\n        }\n\n        styleUpdates = nextProp;\n      }\n    } else if (propKey === DANGEROUSLY_SET_INNER_HTML) {\n      var nextHtml = nextProp ? nextProp[HTML$1] : undefined;\n      var lastHtml = lastProp ? lastProp[HTML$1] : undefined;\n\n      if (nextHtml != null) {\n        if (lastHtml !== nextHtml) {\n          (updatePayload = updatePayload || []).push(propKey, nextHtml);\n        }\n      }\n    } else if (propKey === CHILDREN) {\n      if (typeof nextProp === 'string' || typeof nextProp === 'number') {\n        (updatePayload = updatePayload || []).push(propKey, '' + nextProp);\n      }\n    } else if (propKey === SUPPRESS_CONTENT_EDITABLE_WARNING || propKey === SUPPRESS_HYDRATION_WARNING) ; else if (registrationNameDependencies.hasOwnProperty(propKey)) {\n      if (nextProp != null) {\n        // We eagerly listen to this even though we haven't committed yet.\n        if ( typeof nextProp !== 'function') {\n          warnForInvalidEventListener(propKey, nextProp);\n        }\n\n        if (propKey === 'onScroll') {\n          listenToNonDelegatedEvent('scroll', domElement);\n        }\n      }\n\n      if (!updatePayload && lastProp !== nextProp) {\n        // This is a special case. If any listener updates we need to ensure\n        // that the \"current\" props pointer gets updated so we need a commit\n        // to update this element.\n        updatePayload = [];\n      }\n    } else {\n      // For any other property we always add it to the queue and then we\n      // filter it out using the allowed property list during the commit.\n      (updatePayload = updatePayload || []).push(propKey, nextProp);\n    }\n  }\n\n  if (styleUpdates) {\n    {\n      validateShorthandPropertyCollisionInDev(styleUpdates, nextProps[STYLE]);\n    }\n\n    (updatePayload = updatePayload || []).push(STYLE, styleUpdates);\n  }\n\n  return updatePayload;\n} // Apply the diff.\n\nfunction updateProperties(domElement, updatePayload, tag, lastRawProps, nextRawProps) {\n  // Update checked *before* name.\n  // In the middle of an update, it is possible to have multiple checked.\n  // When a checked radio tries to change name, browser makes another radio's checked false.\n  if (tag === 'input' && nextRawProps.type === 'radio' && nextRawProps.name != null) {\n    updateChecked(domElement, nextRawProps);\n  }\n\n  var wasCustomComponentTag = isCustomComponent(tag, lastRawProps);\n  var isCustomComponentTag = isCustomComponent(tag, nextRawProps); // Apply the diff.\n\n  updateDOMProperties(domElement, updatePayload, wasCustomComponentTag, isCustomComponentTag); // TODO: Ensure that an update gets scheduled if any of the special props\n  // changed.\n\n  switch (tag) {\n    case 'input':\n      // Update the wrapper around inputs *after* updating props. This has to\n      // happen after `updateDOMProperties`. Otherwise HTML5 input validations\n      // raise warnings and prevent the new value from being assigned.\n      updateWrapper(domElement, nextRawProps);\n      break;\n\n    case 'textarea':\n      updateWrapper$1(domElement, nextRawProps);\n      break;\n\n    case 'select':\n      // <select> value update needs to occur after <option> children\n      // reconciliation\n      postUpdateWrapper(domElement, nextRawProps);\n      break;\n  }\n}\n\nfunction getPossibleStandardName(propName) {\n  {\n    var lowerCasedName = propName.toLowerCase();\n\n    if (!possibleStandardNames.hasOwnProperty(lowerCasedName)) {\n      return null;\n    }\n\n    return possibleStandardNames[lowerCasedName] || null;\n  }\n}\n\nfunction diffHydratedProperties(domElement, tag, rawProps, parentNamespace, rootContainerElement, isConcurrentMode, shouldWarnDev) {\n  var isCustomComponentTag;\n  var extraAttributeNames;\n\n  {\n    isCustomComponentTag = isCustomComponent(tag, rawProps);\n    validatePropertiesInDevelopment(tag, rawProps);\n  } // TODO: Make sure that we check isMounted before firing any of these events.\n\n\n  switch (tag) {\n    case 'dialog':\n      listenToNonDelegatedEvent('cancel', domElement);\n      listenToNonDelegatedEvent('close', domElement);\n      break;\n\n    case 'iframe':\n    case 'object':\n    case 'embed':\n      // We listen to this event in case to ensure emulated bubble\n      // listeners still fire for the load event.\n      listenToNonDelegatedEvent('load', domElement);\n      break;\n\n    case 'video':\n    case 'audio':\n      // We listen to these events in case to ensure emulated bubble\n      // listeners still fire for all the media events.\n      for (var i = 0; i < mediaEventTypes.length; i++) {\n        listenToNonDelegatedEvent(mediaEventTypes[i], domElement);\n      }\n\n      break;\n\n    case 'source':\n      // We listen to this event in case to ensure emulated bubble\n      // listeners still fire for the error event.\n      listenToNonDelegatedEvent('error', domElement);\n      break;\n\n    case 'img':\n    case 'image':\n    case 'link':\n      // We listen to these events in case to ensure emulated bubble\n      // listeners still fire for error and load events.\n      listenToNonDelegatedEvent('error', domElement);\n      listenToNonDelegatedEvent('load', domElement);\n      break;\n\n    case 'details':\n      // We listen to this event in case to ensure emulated bubble\n      // listeners still fire for the toggle event.\n      listenToNonDelegatedEvent('toggle', domElement);\n      break;\n\n    case 'input':\n      initWrapperState(domElement, rawProps); // We listen to this event in case to ensure emulated bubble\n      // listeners still fire for the invalid event.\n\n      listenToNonDelegatedEvent('invalid', domElement);\n      break;\n\n    case 'option':\n      validateProps(domElement, rawProps);\n      break;\n\n    case 'select':\n      initWrapperState$1(domElement, rawProps); // We listen to this event in case to ensure emulated bubble\n      // listeners still fire for the invalid event.\n\n      listenToNonDelegatedEvent('invalid', domElement);\n      break;\n\n    case 'textarea':\n      initWrapperState$2(domElement, rawProps); // We listen to this event in case to ensure emulated bubble\n      // listeners still fire for the invalid event.\n\n      listenToNonDelegatedEvent('invalid', domElement);\n      break;\n  }\n\n  assertValidProps(tag, rawProps);\n\n  {\n    extraAttributeNames = new Set();\n    var attributes = domElement.attributes;\n\n    for (var _i = 0; _i < attributes.length; _i++) {\n      var name = attributes[_i].name.toLowerCase();\n\n      switch (name) {\n        // Controlled attributes are not validated\n        // TODO: Only ignore them on controlled tags.\n        case 'value':\n          break;\n\n        case 'checked':\n          break;\n\n        case 'selected':\n          break;\n\n        default:\n          // Intentionally use the original name.\n          // See discussion in https://github.com/facebook/react/pull/10676.\n          extraAttributeNames.add(attributes[_i].name);\n      }\n    }\n  }\n\n  var updatePayload = null;\n\n  for (var propKey in rawProps) {\n    if (!rawProps.hasOwnProperty(propKey)) {\n      continue;\n    }\n\n    var nextProp = rawProps[propKey];\n\n    if (propKey === CHILDREN) {\n      // For text content children we compare against textContent. This\n      // might match additional HTML that is hidden when we read it using\n      // textContent. E.g. \"foo\" will match \"f<span>oo</span>\" but that still\n      // satisfies our requirement. Our requirement is not to produce perfect\n      // HTML and attributes. Ideally we should preserve structure but it's\n      // ok not to if the visible content is still enough to indicate what\n      // even listeners these nodes might be wired up to.\n      // TODO: Warn if there is more than a single textNode as a child.\n      // TODO: Should we use domElement.firstChild.nodeValue to compare?\n      if (typeof nextProp === 'string') {\n        if (domElement.textContent !== nextProp) {\n          if (rawProps[SUPPRESS_HYDRATION_WARNING] !== true) {\n            checkForUnmatchedText(domElement.textContent, nextProp, isConcurrentMode, shouldWarnDev);\n          }\n\n          updatePayload = [CHILDREN, nextProp];\n        }\n      } else if (typeof nextProp === 'number') {\n        if (domElement.textContent !== '' + nextProp) {\n          if (rawProps[SUPPRESS_HYDRATION_WARNING] !== true) {\n            checkForUnmatchedText(domElement.textContent, nextProp, isConcurrentMode, shouldWarnDev);\n          }\n\n          updatePayload = [CHILDREN, '' + nextProp];\n        }\n      }\n    } else if (registrationNameDependencies.hasOwnProperty(propKey)) {\n      if (nextProp != null) {\n        if ( typeof nextProp !== 'function') {\n          warnForInvalidEventListener(propKey, nextProp);\n        }\n\n        if (propKey === 'onScroll') {\n          listenToNonDelegatedEvent('scroll', domElement);\n        }\n      }\n    } else if (shouldWarnDev && true && // Convince Flow we've calculated it (it's DEV-only in this method.)\n    typeof isCustomComponentTag === 'boolean') {\n      // Validate that the properties correspond to their expected values.\n      var serverValue = void 0;\n      var propertyInfo = isCustomComponentTag && enableCustomElementPropertySupport ? null : getPropertyInfo(propKey);\n\n      if (rawProps[SUPPRESS_HYDRATION_WARNING] === true) ; else if (propKey === SUPPRESS_CONTENT_EDITABLE_WARNING || propKey === SUPPRESS_HYDRATION_WARNING || // Controlled attributes are not validated\n      // TODO: Only ignore them on controlled tags.\n      propKey === 'value' || propKey === 'checked' || propKey === 'selected') ; else if (propKey === DANGEROUSLY_SET_INNER_HTML) {\n        var serverHTML = domElement.innerHTML;\n        var nextHtml = nextProp ? nextProp[HTML$1] : undefined;\n\n        if (nextHtml != null) {\n          var expectedHTML = normalizeHTML(domElement, nextHtml);\n\n          if (expectedHTML !== serverHTML) {\n            warnForPropDifference(propKey, serverHTML, expectedHTML);\n          }\n        }\n      } else if (propKey === STYLE) {\n        // $FlowFixMe - Should be inferred as not undefined.\n        extraAttributeNames.delete(propKey);\n\n        if (canDiffStyleForHydrationWarning) {\n          var expectedStyle = createDangerousStringForStyles(nextProp);\n          serverValue = domElement.getAttribute('style');\n\n          if (expectedStyle !== serverValue) {\n            warnForPropDifference(propKey, serverValue, expectedStyle);\n          }\n        }\n      } else if (isCustomComponentTag && !enableCustomElementPropertySupport) {\n        // $FlowFixMe - Should be inferred as not undefined.\n        extraAttributeNames.delete(propKey.toLowerCase());\n        serverValue = getValueForAttribute(domElement, propKey, nextProp);\n\n        if (nextProp !== serverValue) {\n          warnForPropDifference(propKey, serverValue, nextProp);\n        }\n      } else if (!shouldIgnoreAttribute(propKey, propertyInfo, isCustomComponentTag) && !shouldRemoveAttribute(propKey, nextProp, propertyInfo, isCustomComponentTag)) {\n        var isMismatchDueToBadCasing = false;\n\n        if (propertyInfo !== null) {\n          // $FlowFixMe - Should be inferred as not undefined.\n          extraAttributeNames.delete(propertyInfo.attributeName);\n          serverValue = getValueForProperty(domElement, propKey, nextProp, propertyInfo);\n        } else {\n          var ownNamespace = parentNamespace;\n\n          if (ownNamespace === HTML_NAMESPACE) {\n            ownNamespace = getIntrinsicNamespace(tag);\n          }\n\n          if (ownNamespace === HTML_NAMESPACE) {\n            // $FlowFixMe - Should be inferred as not undefined.\n            extraAttributeNames.delete(propKey.toLowerCase());\n          } else {\n            var standardName = getPossibleStandardName(propKey);\n\n            if (standardName !== null && standardName !== propKey) {\n              // If an SVG prop is supplied with bad casing, it will\n              // be successfully parsed from HTML, but will produce a mismatch\n              // (and would be incorrectly rendered on the client).\n              // However, we already warn about bad casing elsewhere.\n              // So we'll skip the misleading extra mismatch warning in this case.\n              isMismatchDueToBadCasing = true; // $FlowFixMe - Should be inferred as not undefined.\n\n              extraAttributeNames.delete(standardName);\n            } // $FlowFixMe - Should be inferred as not undefined.\n\n\n            extraAttributeNames.delete(propKey);\n          }\n\n          serverValue = getValueForAttribute(domElement, propKey, nextProp);\n        }\n\n        var dontWarnCustomElement = enableCustomElementPropertySupport  ;\n\n        if (!dontWarnCustomElement && nextProp !== serverValue && !isMismatchDueToBadCasing) {\n          warnForPropDifference(propKey, serverValue, nextProp);\n        }\n      }\n    }\n  }\n\n  {\n    if (shouldWarnDev) {\n      if ( // $FlowFixMe - Should be inferred as not undefined.\n      extraAttributeNames.size > 0 && rawProps[SUPPRESS_HYDRATION_WARNING] !== true) {\n        // $FlowFixMe - Should be inferred as not undefined.\n        warnForExtraAttributes(extraAttributeNames);\n      }\n    }\n  }\n\n  switch (tag) {\n    case 'input':\n      // TODO: Make sure we check if this is still unmounted or do any clean\n      // up necessary since we never stop tracking anymore.\n      track(domElement);\n      postMountWrapper(domElement, rawProps, true);\n      break;\n\n    case 'textarea':\n      // TODO: Make sure we check if this is still unmounted or do any clean\n      // up necessary since we never stop tracking anymore.\n      track(domElement);\n      postMountWrapper$3(domElement);\n      break;\n\n    case 'select':\n    case 'option':\n      // For input and textarea we current always set the value property at\n      // post mount to force it to diverge from attributes. However, for\n      // option and select we don't quite do the same thing and select\n      // is not resilient to the DOM state changing so we don't do that here.\n      // TODO: Consider not doing this for input and textarea.\n      break;\n\n    default:\n      if (typeof rawProps.onClick === 'function') {\n        // TODO: This cast may not be sound for SVG, MathML or custom elements.\n        trapClickOnNonInteractiveElement(domElement);\n      }\n\n      break;\n  }\n\n  return updatePayload;\n}\nfunction diffHydratedText(textNode, text, isConcurrentMode) {\n  var isDifferent = textNode.nodeValue !== text;\n  return isDifferent;\n}\nfunction warnForDeletedHydratableElement(parentNode, child) {\n  {\n    if (didWarnInvalidHydration) {\n      return;\n    }\n\n    didWarnInvalidHydration = true;\n\n    error('Did not expect server HTML to contain a <%s> in <%s>.', child.nodeName.toLowerCase(), parentNode.nodeName.toLowerCase());\n  }\n}\nfunction warnForDeletedHydratableText(parentNode, child) {\n  {\n    if (didWarnInvalidHydration) {\n      return;\n    }\n\n    didWarnInvalidHydration = true;\n\n    error('Did not expect server HTML to contain the text node \"%s\" in <%s>.', child.nodeValue, parentNode.nodeName.toLowerCase());\n  }\n}\nfunction warnForInsertedHydratedElement(parentNode, tag, props) {\n  {\n    if (didWarnInvalidHydration) {\n      return;\n    }\n\n    didWarnInvalidHydration = true;\n\n    error('Expected server HTML to contain a matching <%s> in <%s>.', tag, parentNode.nodeName.toLowerCase());\n  }\n}\nfunction warnForInsertedHydratedText(parentNode, text) {\n  {\n    if (text === '') {\n      // We expect to insert empty text nodes since they're not represented in\n      // the HTML.\n      // TODO: Remove this special case if we can just avoid inserting empty\n      // text nodes.\n      return;\n    }\n\n    if (didWarnInvalidHydration) {\n      return;\n    }\n\n    didWarnInvalidHydration = true;\n\n    error('Expected server HTML to contain a matching text node for \"%s\" in <%s>.', text, parentNode.nodeName.toLowerCase());\n  }\n}\nfunction restoreControlledState$3(domElement, tag, props) {\n  switch (tag) {\n    case 'input':\n      restoreControlledState(domElement, props);\n      return;\n\n    case 'textarea':\n      restoreControlledState$2(domElement, props);\n      return;\n\n    case 'select':\n      restoreControlledState$1(domElement, props);\n      return;\n  }\n}\n\nvar validateDOMNesting = function () {};\n\nvar updatedAncestorInfo = function () {};\n\n{\n  // This validation code was written based on the HTML5 parsing spec:\n  // https://html.spec.whatwg.org/multipage/syntax.html#has-an-element-in-scope\n  //\n  // Note: this does not catch all invalid nesting, nor does it try to (as it's\n  // not clear what practical benefit doing so provides); instead, we warn only\n  // for cases where the parser will give a parse tree differing from what React\n  // intended. For example, <b><div></div></b> is invalid but we don't warn\n  // because it still parses correctly; we do warn for other cases like nested\n  // <p> tags where the beginning of the second element implicitly closes the\n  // first, causing a confusing mess.\n  // https://html.spec.whatwg.org/multipage/syntax.html#special\n  var specialTags = ['address', 'applet', 'area', 'article', 'aside', 'base', 'basefont', 'bgsound', 'blockquote', 'body', 'br', 'button', 'caption', 'center', 'col', 'colgroup', 'dd', 'details', 'dir', 'div', 'dl', 'dt', 'embed', 'fieldset', 'figcaption', 'figure', 'footer', 'form', 'frame', 'frameset', 'h1', 'h2', 'h3', 'h4', 'h5', 'h6', 'head', 'header', 'hgroup', 'hr', 'html', 'iframe', 'img', 'input', 'isindex', 'li', 'link', 'listing', 'main', 'marquee', 'menu', 'menuitem', 'meta', 'nav', 'noembed', 'noframes', 'noscript', 'object', 'ol', 'p', 'param', 'plaintext', 'pre', 'script', 'section', 'select', 'source', 'style', 'summary', 'table', 'tbody', 'td', 'template', 'textarea', 'tfoot', 'th', 'thead', 'title', 'tr', 'track', 'ul', 'wbr', 'xmp']; // https://html.spec.whatwg.org/multipage/syntax.html#has-an-element-in-scope\n\n  var inScopeTags = ['applet', 'caption', 'html', 'table', 'td', 'th', 'marquee', 'object', 'template', // https://html.spec.whatwg.org/multipage/syntax.html#html-integration-point\n  // TODO: Distinguish by namespace here -- for <title>, including it here\n  // errs on the side of fewer warnings\n  'foreignObject', 'desc', 'title']; // https://html.spec.whatwg.org/multipage/syntax.html#has-an-element-in-button-scope\n\n  var buttonScopeTags = inScopeTags.concat(['button']); // https://html.spec.whatwg.org/multipage/syntax.html#generate-implied-end-tags\n\n  var impliedEndTags = ['dd', 'dt', 'li', 'option', 'optgroup', 'p', 'rp', 'rt'];\n  var emptyAncestorInfo = {\n    current: null,\n    formTag: null,\n    aTagInScope: null,\n    buttonTagInScope: null,\n    nobrTagInScope: null,\n    pTagInButtonScope: null,\n    listItemTagAutoclosing: null,\n    dlItemTagAutoclosing: null\n  };\n\n  updatedAncestorInfo = function (oldInfo, tag) {\n    var ancestorInfo = assign({}, oldInfo || emptyAncestorInfo);\n\n    var info = {\n      tag: tag\n    };\n\n    if (inScopeTags.indexOf(tag) !== -1) {\n      ancestorInfo.aTagInScope = null;\n      ancestorInfo.buttonTagInScope = null;\n      ancestorInfo.nobrTagInScope = null;\n    }\n\n    if (buttonScopeTags.indexOf(tag) !== -1) {\n      ancestorInfo.pTagInButtonScope = null;\n    } // See rules for 'li', 'dd', 'dt' start tags in\n    // https://html.spec.whatwg.org/multipage/syntax.html#parsing-main-inbody\n\n\n    if (specialTags.indexOf(tag) !== -1 && tag !== 'address' && tag !== 'div' && tag !== 'p') {\n      ancestorInfo.listItemTagAutoclosing = null;\n      ancestorInfo.dlItemTagAutoclosing = null;\n    }\n\n    ancestorInfo.current = info;\n\n    if (tag === 'form') {\n      ancestorInfo.formTag = info;\n    }\n\n    if (tag === 'a') {\n      ancestorInfo.aTagInScope = info;\n    }\n\n    if (tag === 'button') {\n      ancestorInfo.buttonTagInScope = info;\n    }\n\n    if (tag === 'nobr') {\n      ancestorInfo.nobrTagInScope = info;\n    }\n\n    if (tag === 'p') {\n      ancestorInfo.pTagInButtonScope = info;\n    }\n\n    if (tag === 'li') {\n      ancestorInfo.listItemTagAutoclosing = info;\n    }\n\n    if (tag === 'dd' || tag === 'dt') {\n      ancestorInfo.dlItemTagAutoclosing = info;\n    }\n\n    return ancestorInfo;\n  };\n  /**\n   * Returns whether\n   */\n\n\n  var isTagValidWithParent = function (tag, parentTag) {\n    // First, let's check if we're in an unusual parsing mode...\n    switch (parentTag) {\n      // https://html.spec.whatwg.org/multipage/syntax.html#parsing-main-inselect\n      case 'select':\n        return tag === 'option' || tag === 'optgroup' || tag === '#text';\n\n      case 'optgroup':\n        return tag === 'option' || tag === '#text';\n      // Strictly speaking, seeing an <option> doesn't mean we're in a <select>\n      // but\n\n      case 'option':\n        return tag === '#text';\n      // https://html.spec.whatwg.org/multipage/syntax.html#parsing-main-intd\n      // https://html.spec.whatwg.org/multipage/syntax.html#parsing-main-incaption\n      // No special behavior since these rules fall back to \"in body\" mode for\n      // all except special table nodes which cause bad parsing behavior anyway.\n      // https://html.spec.whatwg.org/multipage/syntax.html#parsing-main-intr\n\n      case 'tr':\n        return tag === 'th' || tag === 'td' || tag === 'style' || tag === 'script' || tag === 'template';\n      // https://html.spec.whatwg.org/multipage/syntax.html#parsing-main-intbody\n\n      case 'tbody':\n      case 'thead':\n      case 'tfoot':\n        return tag === 'tr' || tag === 'style' || tag === 'script' || tag === 'template';\n      // https://html.spec.whatwg.org/multipage/syntax.html#parsing-main-incolgroup\n\n      case 'colgroup':\n        return tag === 'col' || tag === 'template';\n      // https://html.spec.whatwg.org/multipage/syntax.html#parsing-main-intable\n\n      case 'table':\n        return tag === 'caption' || tag === 'colgroup' || tag === 'tbody' || tag === 'tfoot' || tag === 'thead' || tag === 'style' || tag === 'script' || tag === 'template';\n      // https://html.spec.whatwg.org/multipage/syntax.html#parsing-main-inhead\n\n      case 'head':\n        return tag === 'base' || tag === 'basefont' || tag === 'bgsound' || tag === 'link' || tag === 'meta' || tag === 'title' || tag === 'noscript' || tag === 'noframes' || tag === 'style' || tag === 'script' || tag === 'template';\n      // https://html.spec.whatwg.org/multipage/semantics.html#the-html-element\n\n      case 'html':\n        return tag === 'head' || tag === 'body' || tag === 'frameset';\n\n      case 'frameset':\n        return tag === 'frame';\n\n      case '#document':\n        return tag === 'html';\n    } // Probably in the \"in body\" parsing mode, so we outlaw only tag combos\n    // where the parsing rules cause implicit opens or closes to be added.\n    // https://html.spec.whatwg.org/multipage/syntax.html#parsing-main-inbody\n\n\n    switch (tag) {\n      case 'h1':\n      case 'h2':\n      case 'h3':\n      case 'h4':\n      case 'h5':\n      case 'h6':\n        return parentTag !== 'h1' && parentTag !== 'h2' && parentTag !== 'h3' && parentTag !== 'h4' && parentTag !== 'h5' && parentTag !== 'h6';\n\n      case 'rp':\n      case 'rt':\n        return impliedEndTags.indexOf(parentTag) === -1;\n\n      case 'body':\n      case 'caption':\n      case 'col':\n      case 'colgroup':\n      case 'frameset':\n      case 'frame':\n      case 'head':\n      case 'html':\n      case 'tbody':\n      case 'td':\n      case 'tfoot':\n      case 'th':\n      case 'thead':\n      case 'tr':\n        // These tags are only valid with a few parents that have special child\n        // parsing rules -- if we're down here, then none of those matched and\n        // so we allow it only if we don't know what the parent is, as all other\n        // cases are invalid.\n        return parentTag == null;\n    }\n\n    return true;\n  };\n  /**\n   * Returns whether\n   */\n\n\n  var findInvalidAncestorForTag = function (tag, ancestorInfo) {\n    switch (tag) {\n      case 'address':\n      case 'article':\n      case 'aside':\n      case 'blockquote':\n      case 'center':\n      case 'details':\n      case 'dialog':\n      case 'dir':\n      case 'div':\n      case 'dl':\n      case 'fieldset':\n      case 'figcaption':\n      case 'figure':\n      case 'footer':\n      case 'header':\n      case 'hgroup':\n      case 'main':\n      case 'menu':\n      case 'nav':\n      case 'ol':\n      case 'p':\n      case 'section':\n      case 'summary':\n      case 'ul':\n      case 'pre':\n      case 'listing':\n      case 'table':\n      case 'hr':\n      case 'xmp':\n      case 'h1':\n      case 'h2':\n      case 'h3':\n      case 'h4':\n      case 'h5':\n      case 'h6':\n        return ancestorInfo.pTagInButtonScope;\n\n      case 'form':\n        return ancestorInfo.formTag || ancestorInfo.pTagInButtonScope;\n\n      case 'li':\n        return ancestorInfo.listItemTagAutoclosing;\n\n      case 'dd':\n      case 'dt':\n        return ancestorInfo.dlItemTagAutoclosing;\n\n      case 'button':\n        return ancestorInfo.buttonTagInScope;\n\n      case 'a':\n        // Spec says something about storing a list of markers, but it sounds\n        // equivalent to this check.\n        return ancestorInfo.aTagInScope;\n\n      case 'nobr':\n        return ancestorInfo.nobrTagInScope;\n    }\n\n    return null;\n  };\n\n  var didWarn$1 = {};\n\n  validateDOMNesting = function (childTag, childText, ancestorInfo) {\n    ancestorInfo = ancestorInfo || emptyAncestorInfo;\n    var parentInfo = ancestorInfo.current;\n    var parentTag = parentInfo && parentInfo.tag;\n\n    if (childText != null) {\n      if (childTag != null) {\n        error('validateDOMNesting: when childText is passed, childTag should be null');\n      }\n\n      childTag = '#text';\n    }\n\n    var invalidParent = isTagValidWithParent(childTag, parentTag) ? null : parentInfo;\n    var invalidAncestor = invalidParent ? null : findInvalidAncestorForTag(childTag, ancestorInfo);\n    var invalidParentOrAncestor = invalidParent || invalidAncestor;\n\n    if (!invalidParentOrAncestor) {\n      return;\n    }\n\n    var ancestorTag = invalidParentOrAncestor.tag;\n    var warnKey = !!invalidParent + '|' + childTag + '|' + ancestorTag;\n\n    if (didWarn$1[warnKey]) {\n      return;\n    }\n\n    didWarn$1[warnKey] = true;\n    var tagDisplayName = childTag;\n    var whitespaceInfo = '';\n\n    if (childTag === '#text') {\n      if (/\\S/.test(childText)) {\n        tagDisplayName = 'Text nodes';\n      } else {\n        tagDisplayName = 'Whitespace text nodes';\n        whitespaceInfo = \" Make sure you don't have any extra whitespace between tags on \" + 'each line of your source code.';\n      }\n    } else {\n      tagDisplayName = '<' + childTag + '>';\n    }\n\n    if (invalidParent) {\n      var info = '';\n\n      if (ancestorTag === 'table' && childTag === 'tr') {\n        info += ' Add a <tbody>, <thead> or <tfoot> to your code to match the DOM tree generated by ' + 'the browser.';\n      }\n\n      error('validateDOMNesting(...): %s cannot appear as a child of <%s>.%s%s', tagDisplayName, ancestorTag, whitespaceInfo, info);\n    } else {\n      error('validateDOMNesting(...): %s cannot appear as a descendant of ' + '<%s>.', tagDisplayName, ancestorTag);\n    }\n  };\n}\n\nvar SUPPRESS_HYDRATION_WARNING$1 = 'suppressHydrationWarning';\nvar SUSPENSE_START_DATA = '$';\nvar SUSPENSE_END_DATA = '/$';\nvar SUSPENSE_PENDING_START_DATA = '$?';\nvar SUSPENSE_FALLBACK_START_DATA = '$!';\nvar STYLE$1 = 'style';\nvar eventsEnabled = null;\nvar selectionInformation = null;\nfunction getRootHostContext(rootContainerInstance) {\n  var type;\n  var namespace;\n  var nodeType = rootContainerInstance.nodeType;\n\n  switch (nodeType) {\n    case DOCUMENT_NODE:\n    case DOCUMENT_FRAGMENT_NODE:\n      {\n        type = nodeType === DOCUMENT_NODE ? '#document' : '#fragment';\n        var root = rootContainerInstance.documentElement;\n        namespace = root ? root.namespaceURI : getChildNamespace(null, '');\n        break;\n      }\n\n    default:\n      {\n        var container = nodeType === COMMENT_NODE ? rootContainerInstance.parentNode : rootContainerInstance;\n        var ownNamespace = container.namespaceURI || null;\n        type = container.tagName;\n        namespace = getChildNamespace(ownNamespace, type);\n        break;\n      }\n  }\n\n  {\n    var validatedTag = type.toLowerCase();\n    var ancestorInfo = updatedAncestorInfo(null, validatedTag);\n    return {\n      namespace: namespace,\n      ancestorInfo: ancestorInfo\n    };\n  }\n}\nfunction getChildHostContext(parentHostContext, type, rootContainerInstance) {\n  {\n    var parentHostContextDev = parentHostContext;\n    var namespace = getChildNamespace(parentHostContextDev.namespace, type);\n    var ancestorInfo = updatedAncestorInfo(parentHostContextDev.ancestorInfo, type);\n    return {\n      namespace: namespace,\n      ancestorInfo: ancestorInfo\n    };\n  }\n}\nfunction getPublicInstance(instance) {\n  return instance;\n}\nfunction prepareForCommit(containerInfo) {\n  eventsEnabled = isEnabled();\n  selectionInformation = getSelectionInformation();\n  var activeInstance = null;\n\n  setEnabled(false);\n  return activeInstance;\n}\nfunction resetAfterCommit(containerInfo) {\n  restoreSelection(selectionInformation);\n  setEnabled(eventsEnabled);\n  eventsEnabled = null;\n  selectionInformation = null;\n}\nfunction createInstance(type, props, rootContainerInstance, hostContext, internalInstanceHandle) {\n  var parentNamespace;\n\n  {\n    // TODO: take namespace into account when validating.\n    var hostContextDev = hostContext;\n    validateDOMNesting(type, null, hostContextDev.ancestorInfo);\n\n    if (typeof props.children === 'string' || typeof props.children === 'number') {\n      var string = '' + props.children;\n      var ownAncestorInfo = updatedAncestorInfo(hostContextDev.ancestorInfo, type);\n      validateDOMNesting(null, string, ownAncestorInfo);\n    }\n\n    parentNamespace = hostContextDev.namespace;\n  }\n\n  var domElement = createElement(type, props, rootContainerInstance, parentNamespace);\n  precacheFiberNode(internalInstanceHandle, domElement);\n  updateFiberProps(domElement, props);\n  return domElement;\n}\nfunction appendInitialChild(parentInstance, child) {\n  parentInstance.appendChild(child);\n}\nfunction finalizeInitialChildren(domElement, type, props, rootContainerInstance, hostContext) {\n  setInitialProperties(domElement, type, props, rootContainerInstance);\n\n  switch (type) {\n    case 'button':\n    case 'input':\n    case 'select':\n    case 'textarea':\n      return !!props.autoFocus;\n\n    case 'img':\n      return true;\n\n    default:\n      return false;\n  }\n}\nfunction prepareUpdate(domElement, type, oldProps, newProps, rootContainerInstance, hostContext) {\n  {\n    var hostContextDev = hostContext;\n\n    if (typeof newProps.children !== typeof oldProps.children && (typeof newProps.children === 'string' || typeof newProps.children === 'number')) {\n      var string = '' + newProps.children;\n      var ownAncestorInfo = updatedAncestorInfo(hostContextDev.ancestorInfo, type);\n      validateDOMNesting(null, string, ownAncestorInfo);\n    }\n  }\n\n  return diffProperties(domElement, type, oldProps, newProps);\n}\nfunction shouldSetTextContent(type, props) {\n  return type === 'textarea' || type === 'noscript' || typeof props.children === 'string' || typeof props.children === 'number' || typeof props.dangerouslySetInnerHTML === 'object' && props.dangerouslySetInnerHTML !== null && props.dangerouslySetInnerHTML.__html != null;\n}\nfunction createTextInstance(text, rootContainerInstance, hostContext, internalInstanceHandle) {\n  {\n    var hostContextDev = hostContext;\n    validateDOMNesting(null, text, hostContextDev.ancestorInfo);\n  }\n\n  var textNode = createTextNode(text, rootContainerInstance);\n  precacheFiberNode(internalInstanceHandle, textNode);\n  return textNode;\n}\nfunction getCurrentEventPriority() {\n  var currentEvent = window.event;\n\n  if (currentEvent === undefined) {\n    return DefaultEventPriority;\n  }\n\n  return getEventPriority(currentEvent.type);\n}\n// if a component just imports ReactDOM (e.g. for findDOMNode).\n// Some environments might not have setTimeout or clearTimeout.\n\nvar scheduleTimeout = typeof setTimeout === 'function' ? setTimeout : undefined;\nvar cancelTimeout = typeof clearTimeout === 'function' ? clearTimeout : undefined;\nvar noTimeout = -1;\nvar localPromise = typeof Promise === 'function' ? Promise : undefined; // -------------------\nvar scheduleMicrotask = typeof queueMicrotask === 'function' ? queueMicrotask : typeof localPromise !== 'undefined' ? function (callback) {\n  return localPromise.resolve(null).then(callback).catch(handleErrorInNextTick);\n} : scheduleTimeout; // TODO: Determine the best fallback here.\n\nfunction handleErrorInNextTick(error) {\n  setTimeout(function () {\n    throw error;\n  });\n} // -------------------\nfunction commitMount(domElement, type, newProps, internalInstanceHandle) {\n  // Despite the naming that might imply otherwise, this method only\n  // fires if there is an `Update` effect scheduled during mounting.\n  // This happens if `finalizeInitialChildren` returns `true` (which it\n  // does to implement the `autoFocus` attribute on the client). But\n  // there are also other cases when this might happen (such as patching\n  // up text content during hydration mismatch). So we'll check this again.\n  switch (type) {\n    case 'button':\n    case 'input':\n    case 'select':\n    case 'textarea':\n      if (newProps.autoFocus) {\n        domElement.focus();\n      }\n\n      return;\n\n    case 'img':\n      {\n        if (newProps.src) {\n          domElement.src = newProps.src;\n        }\n\n        return;\n      }\n  }\n}\nfunction commitUpdate(domElement, updatePayload, type, oldProps, newProps, internalInstanceHandle) {\n  // Apply the diff to the DOM node.\n  updateProperties(domElement, updatePayload, type, oldProps, newProps); // Update the props handle so that we know which props are the ones with\n  // with current event handlers.\n\n  updateFiberProps(domElement, newProps);\n}\nfunction resetTextContent(domElement) {\n  setTextContent(domElement, '');\n}\nfunction commitTextUpdate(textInstance, oldText, newText) {\n  textInstance.nodeValue = newText;\n}\nfunction appendChild(parentInstance, child) {\n  parentInstance.appendChild(child);\n}\nfunction appendChildToContainer(container, child) {\n  var parentNode;\n\n  if (container.nodeType === COMMENT_NODE) {\n    parentNode = container.parentNode;\n    parentNode.insertBefore(child, container);\n  } else {\n    parentNode = container;\n    parentNode.appendChild(child);\n  } // This container might be used for a portal.\n  // If something inside a portal is clicked, that click should bubble\n  // through the React tree. However, on Mobile Safari the click would\n  // never bubble through the *DOM* tree unless an ancestor with onclick\n  // event exists. So we wouldn't see it and dispatch it.\n  // This is why we ensure that non React root containers have inline onclick\n  // defined.\n  // https://github.com/facebook/react/issues/11918\n\n\n  var reactRootContainer = container._reactRootContainer;\n\n  if ((reactRootContainer === null || reactRootContainer === undefined) && parentNode.onclick === null) {\n    // TODO: This cast may not be sound for SVG, MathML or custom elements.\n    trapClickOnNonInteractiveElement(parentNode);\n  }\n}\nfunction insertBefore(parentInstance, child, beforeChild) {\n  parentInstance.insertBefore(child, beforeChild);\n}\nfunction insertInContainerBefore(container, child, beforeChild) {\n  if (container.nodeType === COMMENT_NODE) {\n    container.parentNode.insertBefore(child, beforeChild);\n  } else {\n    container.insertBefore(child, beforeChild);\n  }\n}\n\nfunction removeChild(parentInstance, child) {\n  parentInstance.removeChild(child);\n}\nfunction removeChildFromContainer(container, child) {\n  if (container.nodeType === COMMENT_NODE) {\n    container.parentNode.removeChild(child);\n  } else {\n    container.removeChild(child);\n  }\n}\nfunction clearSuspenseBoundary(parentInstance, suspenseInstance) {\n  var node = suspenseInstance; // Delete all nodes within this suspense boundary.\n  // There might be nested nodes so we need to keep track of how\n  // deep we are and only break out when we're back on top.\n\n  var depth = 0;\n\n  do {\n    var nextNode = node.nextSibling;\n    parentInstance.removeChild(node);\n\n    if (nextNode && nextNode.nodeType === COMMENT_NODE) {\n      var data = nextNode.data;\n\n      if (data === SUSPENSE_END_DATA) {\n        if (depth === 0) {\n          parentInstance.removeChild(nextNode); // Retry if any event replaying was blocked on this.\n\n          retryIfBlockedOn(suspenseInstance);\n          return;\n        } else {\n          depth--;\n        }\n      } else if (data === SUSPENSE_START_DATA || data === SUSPENSE_PENDING_START_DATA || data === SUSPENSE_FALLBACK_START_DATA) {\n        depth++;\n      }\n    }\n\n    node = nextNode;\n  } while (node); // TODO: Warn, we didn't find the end comment boundary.\n  // Retry if any event replaying was blocked on this.\n\n\n  retryIfBlockedOn(suspenseInstance);\n}\nfunction clearSuspenseBoundaryFromContainer(container, suspenseInstance) {\n  if (container.nodeType === COMMENT_NODE) {\n    clearSuspenseBoundary(container.parentNode, suspenseInstance);\n  } else if (container.nodeType === ELEMENT_NODE) {\n    clearSuspenseBoundary(container, suspenseInstance);\n  } // Retry if any event replaying was blocked on this.\n\n\n  retryIfBlockedOn(container);\n}\nfunction hideInstance(instance) {\n  // TODO: Does this work for all element types? What about MathML? Should we\n  // pass host context to this method?\n  instance = instance;\n  var style = instance.style;\n\n  if (typeof style.setProperty === 'function') {\n    style.setProperty('display', 'none', 'important');\n  } else {\n    style.display = 'none';\n  }\n}\nfunction hideTextInstance(textInstance) {\n  textInstance.nodeValue = '';\n}\nfunction unhideInstance(instance, props) {\n  instance = instance;\n  var styleProp = props[STYLE$1];\n  var display = styleProp !== undefined && styleProp !== null && styleProp.hasOwnProperty('display') ? styleProp.display : null;\n  instance.style.display = dangerousStyleValue('display', display);\n}\nfunction unhideTextInstance(textInstance, text) {\n  textInstance.nodeValue = text;\n}\nfunction clearContainer(container) {\n  if (container.nodeType === ELEMENT_NODE) {\n    container.textContent = '';\n  } else if (container.nodeType === DOCUMENT_NODE) {\n    if (container.documentElement) {\n      container.removeChild(container.documentElement);\n    }\n  }\n} // -------------------\nfunction canHydrateInstance(instance, type, props) {\n  if (instance.nodeType !== ELEMENT_NODE || type.toLowerCase() !== instance.nodeName.toLowerCase()) {\n    return null;\n  } // This has now been refined to an element node.\n\n\n  return instance;\n}\nfunction canHydrateTextInstance(instance, text) {\n  if (text === '' || instance.nodeType !== TEXT_NODE) {\n    // Empty strings are not parsed by HTML so there won't be a correct match here.\n    return null;\n  } // This has now been refined to a text node.\n\n\n  return instance;\n}\nfunction canHydrateSuspenseInstance(instance) {\n  if (instance.nodeType !== COMMENT_NODE) {\n    // Empty strings are not parsed by HTML so there won't be a correct match here.\n    return null;\n  } // This has now been refined to a suspense node.\n\n\n  return instance;\n}\nfunction isSuspenseInstancePending(instance) {\n  return instance.data === SUSPENSE_PENDING_START_DATA;\n}\nfunction isSuspenseInstanceFallback(instance) {\n  return instance.data === SUSPENSE_FALLBACK_START_DATA;\n}\nfunction getSuspenseInstanceFallbackErrorDetails(instance) {\n  var dataset = instance.nextSibling && instance.nextSibling.dataset;\n  var digest, message, stack;\n\n  if (dataset) {\n    digest = dataset.dgst;\n\n    {\n      message = dataset.msg;\n      stack = dataset.stck;\n    }\n  }\n\n  {\n    return {\n      message: message,\n      digest: digest,\n      stack: stack\n    };\n  } // let value = {message: undefined, hash: undefined};\n  // const nextSibling = instance.nextSibling;\n  // if (nextSibling) {\n  //   const dataset = ((nextSibling: any): HTMLTemplateElement).dataset;\n  //   value.message = dataset.msg;\n  //   value.hash = dataset.hash;\n  //   if (true) {\n  //     value.stack = dataset.stack;\n  //   }\n  // }\n  // return value;\n\n}\nfunction registerSuspenseInstanceRetry(instance, callback) {\n  instance._reactRetry = callback;\n}\n\nfunction getNextHydratable(node) {\n  // Skip non-hydratable nodes.\n  for (; node != null; node = node.nextSibling) {\n    var nodeType = node.nodeType;\n\n    if (nodeType === ELEMENT_NODE || nodeType === TEXT_NODE) {\n      break;\n    }\n\n    if (nodeType === COMMENT_NODE) {\n      var nodeData = node.data;\n\n      if (nodeData === SUSPENSE_START_DATA || nodeData === SUSPENSE_FALLBACK_START_DATA || nodeData === SUSPENSE_PENDING_START_DATA) {\n        break;\n      }\n\n      if (nodeData === SUSPENSE_END_DATA) {\n        return null;\n      }\n    }\n  }\n\n  return node;\n}\n\nfunction getNextHydratableSibling(instance) {\n  return getNextHydratable(instance.nextSibling);\n}\nfunction getFirstHydratableChild(parentInstance) {\n  return getNextHydratable(parentInstance.firstChild);\n}\nfunction getFirstHydratableChildWithinContainer(parentContainer) {\n  return getNextHydratable(parentContainer.firstChild);\n}\nfunction getFirstHydratableChildWithinSuspenseInstance(parentInstance) {\n  return getNextHydratable(parentInstance.nextSibling);\n}\nfunction hydrateInstance(instance, type, props, rootContainerInstance, hostContext, internalInstanceHandle, shouldWarnDev) {\n  precacheFiberNode(internalInstanceHandle, instance); // TODO: Possibly defer this until the commit phase where all the events\n  // get attached.\n\n  updateFiberProps(instance, props);\n  var parentNamespace;\n\n  {\n    var hostContextDev = hostContext;\n    parentNamespace = hostContextDev.namespace;\n  } // TODO: Temporary hack to check if we're in a concurrent root. We can delete\n  // when the legacy root API is removed.\n\n\n  var isConcurrentMode = (internalInstanceHandle.mode & ConcurrentMode) !== NoMode;\n  return diffHydratedProperties(instance, type, props, parentNamespace, rootContainerInstance, isConcurrentMode, shouldWarnDev);\n}\nfunction hydrateTextInstance(textInstance, text, internalInstanceHandle, shouldWarnDev) {\n  precacheFiberNode(internalInstanceHandle, textInstance); // TODO: Temporary hack to check if we're in a concurrent root. We can delete\n  // when the legacy root API is removed.\n\n  var isConcurrentMode = (internalInstanceHandle.mode & ConcurrentMode) !== NoMode;\n  return diffHydratedText(textInstance, text);\n}\nfunction hydrateSuspenseInstance(suspenseInstance, internalInstanceHandle) {\n  precacheFiberNode(internalInstanceHandle, suspenseInstance);\n}\nfunction getNextHydratableInstanceAfterSuspenseInstance(suspenseInstance) {\n  var node = suspenseInstance.nextSibling; // Skip past all nodes within this suspense boundary.\n  // There might be nested nodes so we need to keep track of how\n  // deep we are and only break out when we're back on top.\n\n  var depth = 0;\n\n  while (node) {\n    if (node.nodeType === COMMENT_NODE) {\n      var data = node.data;\n\n      if (data === SUSPENSE_END_DATA) {\n        if (depth === 0) {\n          return getNextHydratableSibling(node);\n        } else {\n          depth--;\n        }\n      } else if (data === SUSPENSE_START_DATA || data === SUSPENSE_FALLBACK_START_DATA || data === SUSPENSE_PENDING_START_DATA) {\n        depth++;\n      }\n    }\n\n    node = node.nextSibling;\n  } // TODO: Warn, we didn't find the end comment boundary.\n\n\n  return null;\n} // Returns the SuspenseInstance if this node is a direct child of a\n// SuspenseInstance. I.e. if its previous sibling is a Comment with\n// SUSPENSE_x_START_DATA. Otherwise, null.\n\nfunction getParentSuspenseInstance(targetInstance) {\n  var node = targetInstance.previousSibling; // Skip past all nodes within this suspense boundary.\n  // There might be nested nodes so we need to keep track of how\n  // deep we are and only break out when we're back on top.\n\n  var depth = 0;\n\n  while (node) {\n    if (node.nodeType === COMMENT_NODE) {\n      var data = node.data;\n\n      if (data === SUSPENSE_START_DATA || data === SUSPENSE_FALLBACK_START_DATA || data === SUSPENSE_PENDING_START_DATA) {\n        if (depth === 0) {\n          return node;\n        } else {\n          depth--;\n        }\n      } else if (data === SUSPENSE_END_DATA) {\n        depth++;\n      }\n    }\n\n    node = node.previousSibling;\n  }\n\n  return null;\n}\nfunction commitHydratedContainer(container) {\n  // Retry if any event replaying was blocked on this.\n  retryIfBlockedOn(container);\n}\nfunction commitHydratedSuspenseInstance(suspenseInstance) {\n  // Retry if any event replaying was blocked on this.\n  retryIfBlockedOn(suspenseInstance);\n}\nfunction shouldDeleteUnhydratedTailInstances(parentType) {\n  return parentType !== 'head' && parentType !== 'body';\n}\nfunction didNotMatchHydratedContainerTextInstance(parentContainer, textInstance, text, isConcurrentMode) {\n  var shouldWarnDev = true;\n  checkForUnmatchedText(textInstance.nodeValue, text, isConcurrentMode, shouldWarnDev);\n}\nfunction didNotMatchHydratedTextInstance(parentType, parentProps, parentInstance, textInstance, text, isConcurrentMode) {\n  if (parentProps[SUPPRESS_HYDRATION_WARNING$1] !== true) {\n    var shouldWarnDev = true;\n    checkForUnmatchedText(textInstance.nodeValue, text, isConcurrentMode, shouldWarnDev);\n  }\n}\nfunction didNotHydrateInstanceWithinContainer(parentContainer, instance) {\n  {\n    if (instance.nodeType === ELEMENT_NODE) {\n      warnForDeletedHydratableElement(parentContainer, instance);\n    } else if (instance.nodeType === COMMENT_NODE) ; else {\n      warnForDeletedHydratableText(parentContainer, instance);\n    }\n  }\n}\nfunction didNotHydrateInstanceWithinSuspenseInstance(parentInstance, instance) {\n  {\n    // $FlowFixMe: Only Element or Document can be parent nodes.\n    var parentNode = parentInstance.parentNode;\n\n    if (parentNode !== null) {\n      if (instance.nodeType === ELEMENT_NODE) {\n        warnForDeletedHydratableElement(parentNode, instance);\n      } else if (instance.nodeType === COMMENT_NODE) ; else {\n        warnForDeletedHydratableText(parentNode, instance);\n      }\n    }\n  }\n}\nfunction didNotHydrateInstance(parentType, parentProps, parentInstance, instance, isConcurrentMode) {\n  {\n    if (isConcurrentMode || parentProps[SUPPRESS_HYDRATION_WARNING$1] !== true) {\n      if (instance.nodeType === ELEMENT_NODE) {\n        warnForDeletedHydratableElement(parentInstance, instance);\n      } else if (instance.nodeType === COMMENT_NODE) ; else {\n        warnForDeletedHydratableText(parentInstance, instance);\n      }\n    }\n  }\n}\nfunction didNotFindHydratableInstanceWithinContainer(parentContainer, type, props) {\n  {\n    warnForInsertedHydratedElement(parentContainer, type);\n  }\n}\nfunction didNotFindHydratableTextInstanceWithinContainer(parentContainer, text) {\n  {\n    warnForInsertedHydratedText(parentContainer, text);\n  }\n}\nfunction didNotFindHydratableInstanceWithinSuspenseInstance(parentInstance, type, props) {\n  {\n    // $FlowFixMe: Only Element or Document can be parent nodes.\n    var parentNode = parentInstance.parentNode;\n    if (parentNode !== null) warnForInsertedHydratedElement(parentNode, type);\n  }\n}\nfunction didNotFindHydratableTextInstanceWithinSuspenseInstance(parentInstance, text) {\n  {\n    // $FlowFixMe: Only Element or Document can be parent nodes.\n    var parentNode = parentInstance.parentNode;\n    if (parentNode !== null) warnForInsertedHydratedText(parentNode, text);\n  }\n}\nfunction didNotFindHydratableInstance(parentType, parentProps, parentInstance, type, props, isConcurrentMode) {\n  {\n    if (isConcurrentMode || parentProps[SUPPRESS_HYDRATION_WARNING$1] !== true) {\n      warnForInsertedHydratedElement(parentInstance, type);\n    }\n  }\n}\nfunction didNotFindHydratableTextInstance(parentType, parentProps, parentInstance, text, isConcurrentMode) {\n  {\n    if (isConcurrentMode || parentProps[SUPPRESS_HYDRATION_WARNING$1] !== true) {\n      warnForInsertedHydratedText(parentInstance, text);\n    }\n  }\n}\nfunction errorHydratingContainer(parentContainer) {\n  {\n    // TODO: This gets logged by onRecoverableError, too, so we should be\n    // able to remove it.\n    error('An error occurred during hydration. The server HTML was replaced with client content in <%s>.', parentContainer.nodeName.toLowerCase());\n  }\n}\nfunction preparePortalMount(portalInstance) {\n  listenToAllSupportedEvents(portalInstance);\n}\n\nvar randomKey = Math.random().toString(36).slice(2);\nvar internalInstanceKey = '__reactFiber$' + randomKey;\nvar internalPropsKey = '__reactProps$' + randomKey;\nvar internalContainerInstanceKey = '__reactContainer$' + randomKey;\nvar internalEventHandlersKey = '__reactEvents$' + randomKey;\nvar internalEventHandlerListenersKey = '__reactListeners$' + randomKey;\nvar internalEventHandlesSetKey = '__reactHandles$' + randomKey;\nfunction detachDeletedInstance(node) {\n  // TODO: This function is only called on host components. I don't think all of\n  // these fields are relevant.\n  delete node[internalInstanceKey];\n  delete node[internalPropsKey];\n  delete node[internalEventHandlersKey];\n  delete node[internalEventHandlerListenersKey];\n  delete node[internalEventHandlesSetKey];\n}\nfunction precacheFiberNode(hostInst, node) {\n  node[internalInstanceKey] = hostInst;\n}\nfunction markContainerAsRoot(hostRoot, node) {\n  node[internalContainerInstanceKey] = hostRoot;\n}\nfunction unmarkContainerAsRoot(node) {\n  node[internalContainerInstanceKey] = null;\n}\nfunction isContainerMarkedAsRoot(node) {\n  return !!node[internalContainerInstanceKey];\n} // Given a DOM node, return the closest HostComponent or HostText fiber ancestor.\n// If the target node is part of a hydrated or not yet rendered subtree, then\n// this may also return a SuspenseComponent or HostRoot to indicate that.\n// Conceptually the HostRoot fiber is a child of the Container node. So if you\n// pass the Container node as the targetNode, you will not actually get the\n// HostRoot back. To get to the HostRoot, you need to pass a child of it.\n// The same thing applies to Suspense boundaries.\n\nfunction getClosestInstanceFromNode(targetNode) {\n  var targetInst = targetNode[internalInstanceKey];\n\n  if (targetInst) {\n    // Don't return HostRoot or SuspenseComponent here.\n    return targetInst;\n  } // If the direct event target isn't a React owned DOM node, we need to look\n  // to see if one of its parents is a React owned DOM node.\n\n\n  var parentNode = targetNode.parentNode;\n\n  while (parentNode) {\n    // We'll check if this is a container root that could include\n    // React nodes in the future. We need to check this first because\n    // if we're a child of a dehydrated container, we need to first\n    // find that inner container before moving on to finding the parent\n    // instance. Note that we don't check this field on  the targetNode\n    // itself because the fibers are conceptually between the container\n    // node and the first child. It isn't surrounding the container node.\n    // If it's not a container, we check if it's an instance.\n    targetInst = parentNode[internalContainerInstanceKey] || parentNode[internalInstanceKey];\n\n    if (targetInst) {\n      // Since this wasn't the direct target of the event, we might have\n      // stepped past dehydrated DOM nodes to get here. However they could\n      // also have been non-React nodes. We need to answer which one.\n      // If we the instance doesn't have any children, then there can't be\n      // a nested suspense boundary within it. So we can use this as a fast\n      // bailout. Most of the time, when people add non-React children to\n      // the tree, it is using a ref to a child-less DOM node.\n      // Normally we'd only need to check one of the fibers because if it\n      // has ever gone from having children to deleting them or vice versa\n      // it would have deleted the dehydrated boundary nested inside already.\n      // However, since the HostRoot starts out with an alternate it might\n      // have one on the alternate so we need to check in case this was a\n      // root.\n      var alternate = targetInst.alternate;\n\n      if (targetInst.child !== null || alternate !== null && alternate.child !== null) {\n        // Next we need to figure out if the node that skipped past is\n        // nested within a dehydrated boundary and if so, which one.\n        var suspenseInstance = getParentSuspenseInstance(targetNode);\n\n        while (suspenseInstance !== null) {\n          // We found a suspense instance. That means that we haven't\n          // hydrated it yet. Even though we leave the comments in the\n          // DOM after hydrating, and there are boundaries in the DOM\n          // that could already be hydrated, we wouldn't have found them\n          // through this pass since if the target is hydrated it would\n          // have had an internalInstanceKey on it.\n          // Let's get the fiber associated with the SuspenseComponent\n          // as the deepest instance.\n          var targetSuspenseInst = suspenseInstance[internalInstanceKey];\n\n          if (targetSuspenseInst) {\n            return targetSuspenseInst;\n          } // If we don't find a Fiber on the comment, it might be because\n          // we haven't gotten to hydrate it yet. There might still be a\n          // parent boundary that hasn't above this one so we need to find\n          // the outer most that is known.\n\n\n          suspenseInstance = getParentSuspenseInstance(suspenseInstance); // If we don't find one, then that should mean that the parent\n          // host component also hasn't hydrated yet. We can return it\n          // below since it will bail out on the isMounted check later.\n        }\n      }\n\n      return targetInst;\n    }\n\n    targetNode = parentNode;\n    parentNode = targetNode.parentNode;\n  }\n\n  return null;\n}\n/**\n * Given a DOM node, return the ReactDOMComponent or ReactDOMTextComponent\n * instance, or null if the node was not rendered by this React.\n */\n\nfunction getInstanceFromNode(node) {\n  var inst = node[internalInstanceKey] || node[internalContainerInstanceKey];\n\n  if (inst) {\n    if (inst.tag === HostComponent || inst.tag === HostText || inst.tag === SuspenseComponent || inst.tag === HostRoot) {\n      return inst;\n    } else {\n      return null;\n    }\n  }\n\n  return null;\n}\n/**\n * Given a ReactDOMComponent or ReactDOMTextComponent, return the corresponding\n * DOM node.\n */\n\nfunction getNodeFromInstance(inst) {\n  if (inst.tag === HostComponent || inst.tag === HostText) {\n    // In Fiber this, is just the state node right now. We assume it will be\n    // a host component or host text.\n    return inst.stateNode;\n  } // Without this first invariant, passing a non-DOM-component triggers the next\n  // invariant for a missing parent, which is super confusing.\n\n\n  throw new Error('getNodeFromInstance: Invalid argument.');\n}\nfunction getFiberCurrentPropsFromNode(node) {\n  return node[internalPropsKey] || null;\n}\nfunction updateFiberProps(node, props) {\n  node[internalPropsKey] = props;\n}\nfunction getEventListenerSet(node) {\n  var elementListenerSet = node[internalEventHandlersKey];\n\n  if (elementListenerSet === undefined) {\n    elementListenerSet = node[internalEventHandlersKey] = new Set();\n  }\n\n  return elementListenerSet;\n}\n\nvar loggedTypeFailures = {};\nvar ReactDebugCurrentFrame$1 = ReactSharedInternals.ReactDebugCurrentFrame;\n\nfunction setCurrentlyValidatingElement(element) {\n  {\n    if (element) {\n      var owner = element._owner;\n      var stack = describeUnknownElementTypeFrameInDEV(element.type, element._source, owner ? owner.type : null);\n      ReactDebugCurrentFrame$1.setExtraStackFrame(stack);\n    } else {\n      ReactDebugCurrentFrame$1.setExtraStackFrame(null);\n    }\n  }\n}\n\nfunction checkPropTypes(typeSpecs, values, location, componentName, element) {\n  {\n    // $FlowFixMe This is okay but Flow doesn't know it.\n    var has = Function.call.bind(hasOwnProperty);\n\n    for (var typeSpecName in typeSpecs) {\n      if (has(typeSpecs, typeSpecName)) {\n        var error$1 = void 0; // Prop type validation may throw. In case they do, we don't want to\n        // fail the render phase where it didn't fail before. So we log it.\n        // After these have been cleaned up, we'll let them throw.\n\n        try {\n          // This is intentionally an invariant that gets caught. It's the same\n          // behavior as without this statement except with a better message.\n          if (typeof typeSpecs[typeSpecName] !== 'function') {\n            // eslint-disable-next-line react-internal/prod-error-codes\n            var err = Error((componentName || 'React class') + ': ' + location + ' type `' + typeSpecName + '` is invalid; ' + 'it must be a function, usually from the `prop-types` package, but received `' + typeof typeSpecs[typeSpecName] + '`.' + 'This often happens because of typos such as `PropTypes.function` instead of `PropTypes.func`.');\n            err.name = 'Invariant Violation';\n            throw err;\n          }\n\n          error$1 = typeSpecs[typeSpecName](values, typeSpecName, componentName, location, null, 'SECRET_DO_NOT_PASS_THIS_OR_YOU_WILL_BE_FIRED');\n        } catch (ex) {\n          error$1 = ex;\n        }\n\n        if (error$1 && !(error$1 instanceof Error)) {\n          setCurrentlyValidatingElement(element);\n\n          error('%s: type specification of %s' + ' `%s` is invalid; the type checker ' + 'function must return `null` or an `Error` but returned a %s. ' + 'You may have forgotten to pass an argument to the type checker ' + 'creator (arrayOf, instanceOf, objectOf, oneOf, oneOfType, and ' + 'shape all require an argument).', componentName || 'React class', location, typeSpecName, typeof error$1);\n\n          setCurrentlyValidatingElement(null);\n        }\n\n        if (error$1 instanceof Error && !(error$1.message in loggedTypeFailures)) {\n          // Only monitor this failure once because there tends to be a lot of the\n          // same error.\n          loggedTypeFailures[error$1.message] = true;\n          setCurrentlyValidatingElement(element);\n\n          error('Failed %s type: %s', location, error$1.message);\n\n          setCurrentlyValidatingElement(null);\n        }\n      }\n    }\n  }\n}\n\nvar valueStack = [];\nvar fiberStack;\n\n{\n  fiberStack = [];\n}\n\nvar index = -1;\n\nfunction createCursor(defaultValue) {\n  return {\n    current: defaultValue\n  };\n}\n\nfunction pop(cursor, fiber) {\n  if (index < 0) {\n    {\n      error('Unexpected pop.');\n    }\n\n    return;\n  }\n\n  {\n    if (fiber !== fiberStack[index]) {\n      error('Unexpected Fiber popped.');\n    }\n  }\n\n  cursor.current = valueStack[index];\n  valueStack[index] = null;\n\n  {\n    fiberStack[index] = null;\n  }\n\n  index--;\n}\n\nfunction push(cursor, value, fiber) {\n  index++;\n  valueStack[index] = cursor.current;\n\n  {\n    fiberStack[index] = fiber;\n  }\n\n  cursor.current = value;\n}\n\nvar warnedAboutMissingGetChildContext;\n\n{\n  warnedAboutMissingGetChildContext = {};\n}\n\nvar emptyContextObject = {};\n\n{\n  Object.freeze(emptyContextObject);\n} // A cursor to the current merged context object on the stack.\n\n\nvar contextStackCursor = createCursor(emptyContextObject); // A cursor to a boolean indicating whether the context has changed.\n\nvar didPerformWorkStackCursor = createCursor(false); // Keep track of the previous context object that was on the stack.\n// We use this to get access to the parent context after we have already\n// pushed the next context provider, and now need to merge their contexts.\n\nvar previousContext = emptyContextObject;\n\nfunction getUnmaskedContext(workInProgress, Component, didPushOwnContextIfProvider) {\n  {\n    if (didPushOwnContextIfProvider && isContextProvider(Component)) {\n      // If the fiber is a context provider itself, when we read its context\n      // we may have already pushed its own child context on the stack. A context\n      // provider should not \"see\" its own child context. Therefore we read the\n      // previous (parent) context instead for a context provider.\n      return previousContext;\n    }\n\n    return contextStackCursor.current;\n  }\n}\n\nfunction cacheContext(workInProgress, unmaskedContext, maskedContext) {\n  {\n    var instance = workInProgress.stateNode;\n    instance.__reactInternalMemoizedUnmaskedChildContext = unmaskedContext;\n    instance.__reactInternalMemoizedMaskedChildContext = maskedContext;\n  }\n}\n\nfunction getMaskedContext(workInProgress, unmaskedContext) {\n  {\n    var type = workInProgress.type;\n    var contextTypes = type.contextTypes;\n\n    if (!contextTypes) {\n      return emptyContextObject;\n    } // Avoid recreating masked context unless unmasked context has changed.\n    // Failing to do this will result in unnecessary calls to componentWillReceiveProps.\n    // This may trigger infinite loops if componentWillReceiveProps calls setState.\n\n\n    var instance = workInProgress.stateNode;\n\n    if (instance && instance.__reactInternalMemoizedUnmaskedChildContext === unmaskedContext) {\n      return instance.__reactInternalMemoizedMaskedChildContext;\n    }\n\n    var context = {};\n\n    for (var key in contextTypes) {\n      context[key] = unmaskedContext[key];\n    }\n\n    {\n      var name = getComponentNameFromFiber(workInProgress) || 'Unknown';\n      checkPropTypes(contextTypes, context, 'context', name);\n    } // Cache unmasked context so we can avoid recreating masked context unless necessary.\n    // Context is created before the class component is instantiated so check for instance.\n\n\n    if (instance) {\n      cacheContext(workInProgress, unmaskedContext, context);\n    }\n\n    return context;\n  }\n}\n\nfunction hasContextChanged() {\n  {\n    return didPerformWorkStackCursor.current;\n  }\n}\n\nfunction isContextProvider(type) {\n  {\n    var childContextTypes = type.childContextTypes;\n    return childContextTypes !== null && childContextTypes !== undefined;\n  }\n}\n\nfunction popContext(fiber) {\n  {\n    pop(didPerformWorkStackCursor, fiber);\n    pop(contextStackCursor, fiber);\n  }\n}\n\nfunction popTopLevelContextObject(fiber) {\n  {\n    pop(didPerformWorkStackCursor, fiber);\n    pop(contextStackCursor, fiber);\n  }\n}\n\nfunction pushTopLevelContextObject(fiber, context, didChange) {\n  {\n    if (contextStackCursor.current !== emptyContextObject) {\n      throw new Error('Unexpected context found on stack. ' + 'This error is likely caused by a bug in React. Please file an issue.');\n    }\n\n    push(contextStackCursor, context, fiber);\n    push(didPerformWorkStackCursor, didChange, fiber);\n  }\n}\n\nfunction processChildContext(fiber, type, parentContext) {\n  {\n    var instance = fiber.stateNode;\n    var childContextTypes = type.childContextTypes; // TODO (bvaughn) Replace this behavior with an invariant() in the future.\n    // It has only been added in Fiber to match the (unintentional) behavior in Stack.\n\n    if (typeof instance.getChildContext !== 'function') {\n      {\n        var componentName = getComponentNameFromFiber(fiber) || 'Unknown';\n\n        if (!warnedAboutMissingGetChildContext[componentName]) {\n          warnedAboutMissingGetChildContext[componentName] = true;\n\n          error('%s.childContextTypes is specified but there is no getChildContext() method ' + 'on the instance. You can either define getChildContext() on %s or remove ' + 'childContextTypes from it.', componentName, componentName);\n        }\n      }\n\n      return parentContext;\n    }\n\n    var childContext = instance.getChildContext();\n\n    for (var contextKey in childContext) {\n      if (!(contextKey in childContextTypes)) {\n        throw new Error((getComponentNameFromFiber(fiber) || 'Unknown') + \".getChildContext(): key \\\"\" + contextKey + \"\\\" is not defined in childContextTypes.\");\n      }\n    }\n\n    {\n      var name = getComponentNameFromFiber(fiber) || 'Unknown';\n      checkPropTypes(childContextTypes, childContext, 'child context', name);\n    }\n\n    return assign({}, parentContext, childContext);\n  }\n}\n\nfunction pushContextProvider(workInProgress) {\n  {\n    var instance = workInProgress.stateNode; // We push the context as early as possible to ensure stack integrity.\n    // If the instance does not exist yet, we will push null at first,\n    // and replace it on the stack later when invalidating the context.\n\n    var memoizedMergedChildContext = instance && instance.__reactInternalMemoizedMergedChildContext || emptyContextObject; // Remember the parent context so we can merge with it later.\n    // Inherit the parent's did-perform-work value to avoid inadvertently blocking updates.\n\n    previousContext = contextStackCursor.current;\n    push(contextStackCursor, memoizedMergedChildContext, workInProgress);\n    push(didPerformWorkStackCursor, didPerformWorkStackCursor.current, workInProgress);\n    return true;\n  }\n}\n\nfunction invalidateContextProvider(workInProgress, type, didChange) {\n  {\n    var instance = workInProgress.stateNode;\n\n    if (!instance) {\n      throw new Error('Expected to have an instance by this point. ' + 'This error is likely caused by a bug in React. Please file an issue.');\n    }\n\n    if (didChange) {\n      // Merge parent and own context.\n      // Skip this if we're not updating due to sCU.\n      // This avoids unnecessarily recomputing memoized values.\n      var mergedContext = processChildContext(workInProgress, type, previousContext);\n      instance.__reactInternalMemoizedMergedChildContext = mergedContext; // Replace the old (or empty) context with the new one.\n      // It is important to unwind the context in the reverse order.\n\n      pop(didPerformWorkStackCursor, workInProgress);\n      pop(contextStackCursor, workInProgress); // Now push the new context and mark that it has changed.\n\n      push(contextStackCursor, mergedContext, workInProgress);\n      push(didPerformWorkStackCursor, didChange, workInProgress);\n    } else {\n      pop(didPerformWorkStackCursor, workInProgress);\n      push(didPerformWorkStackCursor, didChange, workInProgress);\n    }\n  }\n}\n\nfunction findCurrentUnmaskedContext(fiber) {\n  {\n    // Currently this is only used with renderSubtreeIntoContainer; not sure if it\n    // makes sense elsewhere\n    if (!isFiberMounted(fiber) || fiber.tag !== ClassComponent) {\n      throw new Error('Expected subtree parent to be a mounted class component. ' + 'This error is likely caused by a bug in React. Please file an issue.');\n    }\n\n    var node = fiber;\n\n    do {\n      switch (node.tag) {\n        case HostRoot:\n          return node.stateNode.context;\n\n        case ClassComponent:\n          {\n            var Component = node.type;\n\n            if (isContextProvider(Component)) {\n              return node.stateNode.__reactInternalMemoizedMergedChildContext;\n            }\n\n            break;\n          }\n      }\n\n      node = node.return;\n    } while (node !== null);\n\n    throw new Error('Found unexpected detached subtree parent. ' + 'This error is likely caused by a bug in React. Please file an issue.');\n  }\n}\n\nvar LegacyRoot = 0;\nvar ConcurrentRoot = 1;\n\nvar syncQueue = null;\nvar includesLegacySyncCallbacks = false;\nvar isFlushingSyncQueue = false;\nfunction scheduleSyncCallback(callback) {\n  // Push this callback into an internal queue. We'll flush these either in\n  // the next tick, or earlier if something calls `flushSyncCallbackQueue`.\n  if (syncQueue === null) {\n    syncQueue = [callback];\n  } else {\n    // Push onto existing queue. Don't need to schedule a callback because\n    // we already scheduled one when we created the queue.\n    syncQueue.push(callback);\n  }\n}\nfunction scheduleLegacySyncCallback(callback) {\n  includesLegacySyncCallbacks = true;\n  scheduleSyncCallback(callback);\n}\nfunction flushSyncCallbacksOnlyInLegacyMode() {\n  // Only flushes the queue if there's a legacy sync callback scheduled.\n  // TODO: There's only a single type of callback: performSyncOnWorkOnRoot. So\n  // it might make more sense for the queue to be a list of roots instead of a\n  // list of generic callbacks. Then we can have two: one for legacy roots, one\n  // for concurrent roots. And this method would only flush the legacy ones.\n  if (includesLegacySyncCallbacks) {\n    flushSyncCallbacks();\n  }\n}\nfunction flushSyncCallbacks() {\n  if (!isFlushingSyncQueue && syncQueue !== null) {\n    // Prevent re-entrance.\n    isFlushingSyncQueue = true;\n    var i = 0;\n    var previousUpdatePriority = getCurrentUpdatePriority();\n\n    try {\n      var isSync = true;\n      var queue = syncQueue; // TODO: Is this necessary anymore? The only user code that runs in this\n      // queue is in the render or commit phases.\n\n      setCurrentUpdatePriority(DiscreteEventPriority);\n\n      for (; i < queue.length; i++) {\n        var callback = queue[i];\n\n        do {\n          callback = callback(isSync);\n        } while (callback !== null);\n      }\n\n      syncQueue = null;\n      includesLegacySyncCallbacks = false;\n    } catch (error) {\n      // If something throws, leave the remaining callbacks on the queue.\n      if (syncQueue !== null) {\n        syncQueue = syncQueue.slice(i + 1);\n      } // Resume flushing in the next tick\n\n\n      scheduleCallback(ImmediatePriority, flushSyncCallbacks);\n      throw error;\n    } finally {\n      setCurrentUpdatePriority(previousUpdatePriority);\n      isFlushingSyncQueue = false;\n    }\n  }\n\n  return null;\n}\n\n// TODO: Use the unified fiber stack module instead of this local one?\n// Intentionally not using it yet to derisk the initial implementation, because\n// the way we push/pop these values is a bit unusual. If there's a mistake, I'd\n// rather the ids be wrong than crash the whole reconciler.\nvar forkStack = [];\nvar forkStackIndex = 0;\nvar treeForkProvider = null;\nvar treeForkCount = 0;\nvar idStack = [];\nvar idStackIndex = 0;\nvar treeContextProvider = null;\nvar treeContextId = 1;\nvar treeContextOverflow = '';\nfunction isForkedChild(workInProgress) {\n  warnIfNotHydrating();\n  return (workInProgress.flags & Forked) !== NoFlags;\n}\nfunction getForksAtLevel(workInProgress) {\n  warnIfNotHydrating();\n  return treeForkCount;\n}\nfunction getTreeId() {\n  var overflow = treeContextOverflow;\n  var idWithLeadingBit = treeContextId;\n  var id = idWithLeadingBit & ~getLeadingBit(idWithLeadingBit);\n  return id.toString(32) + overflow;\n}\nfunction pushTreeFork(workInProgress, totalChildren) {\n  // This is called right after we reconcile an array (or iterator) of child\n  // fibers, because that's the only place where we know how many children in\n  // the whole set without doing extra work later, or storing addtional\n  // information on the fiber.\n  //\n  // That's why this function is separate from pushTreeId — it's called during\n  // the render phase of the fork parent, not the child, which is where we push\n  // the other context values.\n  //\n  // In the Fizz implementation this is much simpler because the child is\n  // rendered in the same callstack as the parent.\n  //\n  // It might be better to just add a `forks` field to the Fiber type. It would\n  // make this module simpler.\n  warnIfNotHydrating();\n  forkStack[forkStackIndex++] = treeForkCount;\n  forkStack[forkStackIndex++] = treeForkProvider;\n  treeForkProvider = workInProgress;\n  treeForkCount = totalChildren;\n}\nfunction pushTreeId(workInProgress, totalChildren, index) {\n  warnIfNotHydrating();\n  idStack[idStackIndex++] = treeContextId;\n  idStack[idStackIndex++] = treeContextOverflow;\n  idStack[idStackIndex++] = treeContextProvider;\n  treeContextProvider = workInProgress;\n  var baseIdWithLeadingBit = treeContextId;\n  var baseOverflow = treeContextOverflow; // The leftmost 1 marks the end of the sequence, non-inclusive. It's not part\n  // of the id; we use it to account for leading 0s.\n\n  var baseLength = getBitLength(baseIdWithLeadingBit) - 1;\n  var baseId = baseIdWithLeadingBit & ~(1 << baseLength);\n  var slot = index + 1;\n  var length = getBitLength(totalChildren) + baseLength; // 30 is the max length we can store without overflowing, taking into\n  // consideration the leading 1 we use to mark the end of the sequence.\n\n  if (length > 30) {\n    // We overflowed the bitwise-safe range. Fall back to slower algorithm.\n    // This branch assumes the length of the base id is greater than 5; it won't\n    // work for smaller ids, because you need 5 bits per character.\n    //\n    // We encode the id in multiple steps: first the base id, then the\n    // remaining digits.\n    //\n    // Each 5 bit sequence corresponds to a single base 32 character. So for\n    // example, if the current id is 23 bits long, we can convert 20 of those\n    // bits into a string of 4 characters, with 3 bits left over.\n    //\n    // First calculate how many bits in the base id represent a complete\n    // sequence of characters.\n    var numberOfOverflowBits = baseLength - baseLength % 5; // Then create a bitmask that selects only those bits.\n\n    var newOverflowBits = (1 << numberOfOverflowBits) - 1; // Select the bits, and convert them to a base 32 string.\n\n    var newOverflow = (baseId & newOverflowBits).toString(32); // Now we can remove those bits from the base id.\n\n    var restOfBaseId = baseId >> numberOfOverflowBits;\n    var restOfBaseLength = baseLength - numberOfOverflowBits; // Finally, encode the rest of the bits using the normal algorithm. Because\n    // we made more room, this time it won't overflow.\n\n    var restOfLength = getBitLength(totalChildren) + restOfBaseLength;\n    var restOfNewBits = slot << restOfBaseLength;\n    var id = restOfNewBits | restOfBaseId;\n    var overflow = newOverflow + baseOverflow;\n    treeContextId = 1 << restOfLength | id;\n    treeContextOverflow = overflow;\n  } else {\n    // Normal path\n    var newBits = slot << baseLength;\n\n    var _id = newBits | baseId;\n\n    var _overflow = baseOverflow;\n    treeContextId = 1 << length | _id;\n    treeContextOverflow = _overflow;\n  }\n}\nfunction pushMaterializedTreeId(workInProgress) {\n  warnIfNotHydrating(); // This component materialized an id. This will affect any ids that appear\n  // in its children.\n\n  var returnFiber = workInProgress.return;\n\n  if (returnFiber !== null) {\n    var numberOfForks = 1;\n    var slotIndex = 0;\n    pushTreeFork(workInProgress, numberOfForks);\n    pushTreeId(workInProgress, numberOfForks, slotIndex);\n  }\n}\n\nfunction getBitLength(number) {\n  return 32 - clz32(number);\n}\n\nfunction getLeadingBit(id) {\n  return 1 << getBitLength(id) - 1;\n}\n\nfunction popTreeContext(workInProgress) {\n  // Restore the previous values.\n  // This is a bit more complicated than other context-like modules in Fiber\n  // because the same Fiber may appear on the stack multiple times and for\n  // different reasons. We have to keep popping until the work-in-progress is\n  // no longer at the top of the stack.\n  while (workInProgress === treeForkProvider) {\n    treeForkProvider = forkStack[--forkStackIndex];\n    forkStack[forkStackIndex] = null;\n    treeForkCount = forkStack[--forkStackIndex];\n    forkStack[forkStackIndex] = null;\n  }\n\n  while (workInProgress === treeContextProvider) {\n    treeContextProvider = idStack[--idStackIndex];\n    idStack[idStackIndex] = null;\n    treeContextOverflow = idStack[--idStackIndex];\n    idStack[idStackIndex] = null;\n    treeContextId = idStack[--idStackIndex];\n    idStack[idStackIndex] = null;\n  }\n}\nfunction getSuspendedTreeContext() {\n  warnIfNotHydrating();\n\n  if (treeContextProvider !== null) {\n    return {\n      id: treeContextId,\n      overflow: treeContextOverflow\n    };\n  } else {\n    return null;\n  }\n}\nfunction restoreSuspendedTreeContext(workInProgress, suspendedContext) {\n  warnIfNotHydrating();\n  idStack[idStackIndex++] = treeContextId;\n  idStack[idStackIndex++] = treeContextOverflow;\n  idStack[idStackIndex++] = treeContextProvider;\n  treeContextId = suspendedContext.id;\n  treeContextOverflow = suspendedContext.overflow;\n  treeContextProvider = workInProgress;\n}\n\nfunction warnIfNotHydrating() {\n  {\n    if (!getIsHydrating()) {\n      error('Expected to be hydrating. This is a bug in React. Please file ' + 'an issue.');\n    }\n  }\n}\n\n// This may have been an insertion or a hydration.\n\nvar hydrationParentFiber = null;\nvar nextHydratableInstance = null;\nvar isHydrating = false; // This flag allows for warning supression when we expect there to be mismatches\n// due to earlier mismatches or a suspended fiber.\n\nvar didSuspendOrErrorDEV = false; // Hydration errors that were thrown inside this boundary\n\nvar hydrationErrors = null;\n\nfunction warnIfHydrating() {\n  {\n    if (isHydrating) {\n      error('We should not be hydrating here. This is a bug in React. Please file a bug.');\n    }\n  }\n}\n\nfunction markDidThrowWhileHydratingDEV() {\n  {\n    didSuspendOrErrorDEV = true;\n  }\n}\nfunction didSuspendOrErrorWhileHydratingDEV() {\n  {\n    return didSuspendOrErrorDEV;\n  }\n}\n\nfunction enterHydrationState(fiber) {\n\n  var parentInstance = fiber.stateNode.containerInfo;\n  nextHydratableInstance = getFirstHydratableChildWithinContainer(parentInstance);\n  hydrationParentFiber = fiber;\n  isHydrating = true;\n  hydrationErrors = null;\n  didSuspendOrErrorDEV = false;\n  return true;\n}\n\nfunction reenterHydrationStateFromDehydratedSuspenseInstance(fiber, suspenseInstance, treeContext) {\n\n  nextHydratableInstance = getFirstHydratableChildWithinSuspenseInstance(suspenseInstance);\n  hydrationParentFiber = fiber;\n  isHydrating = true;\n  hydrationErrors = null;\n  didSuspendOrErrorDEV = false;\n\n  if (treeContext !== null) {\n    restoreSuspendedTreeContext(fiber, treeContext);\n  }\n\n  return true;\n}\n\nfunction warnUnhydratedInstance(returnFiber, instance) {\n  {\n    switch (returnFiber.tag) {\n      case HostRoot:\n        {\n          didNotHydrateInstanceWithinContainer(returnFiber.stateNode.containerInfo, instance);\n          break;\n        }\n\n      case HostComponent:\n        {\n          var isConcurrentMode = (returnFiber.mode & ConcurrentMode) !== NoMode;\n          didNotHydrateInstance(returnFiber.type, returnFiber.memoizedProps, returnFiber.stateNode, instance, // TODO: Delete this argument when we remove the legacy root API.\n          isConcurrentMode);\n          break;\n        }\n\n      case SuspenseComponent:\n        {\n          var suspenseState = returnFiber.memoizedState;\n          if (suspenseState.dehydrated !== null) didNotHydrateInstanceWithinSuspenseInstance(suspenseState.dehydrated, instance);\n          break;\n        }\n    }\n  }\n}\n\nfunction deleteHydratableInstance(returnFiber, instance) {\n  warnUnhydratedInstance(returnFiber, instance);\n  var childToDelete = createFiberFromHostInstanceForDeletion();\n  childToDelete.stateNode = instance;\n  childToDelete.return = returnFiber;\n  var deletions = returnFiber.deletions;\n\n  if (deletions === null) {\n    returnFiber.deletions = [childToDelete];\n    returnFiber.flags |= ChildDeletion;\n  } else {\n    deletions.push(childToDelete);\n  }\n}\n\nfunction warnNonhydratedInstance(returnFiber, fiber) {\n  {\n    if (didSuspendOrErrorDEV) {\n      // Inside a boundary that already suspended. We're currently rendering the\n      // siblings of a suspended node. The mismatch may be due to the missing\n      // data, so it's probably a false positive.\n      return;\n    }\n\n    switch (returnFiber.tag) {\n      case HostRoot:\n        {\n          var parentContainer = returnFiber.stateNode.containerInfo;\n\n          switch (fiber.tag) {\n            case HostComponent:\n              var type = fiber.type;\n              var props = fiber.pendingProps;\n              didNotFindHydratableInstanceWithinContainer(parentContainer, type);\n              break;\n\n            case HostText:\n              var text = fiber.pendingProps;\n              didNotFindHydratableTextInstanceWithinContainer(parentContainer, text);\n              break;\n          }\n\n          break;\n        }\n\n      case HostComponent:\n        {\n          var parentType = returnFiber.type;\n          var parentProps = returnFiber.memoizedProps;\n          var parentInstance = returnFiber.stateNode;\n\n          switch (fiber.tag) {\n            case HostComponent:\n              {\n                var _type = fiber.type;\n                var _props = fiber.pendingProps;\n                var isConcurrentMode = (returnFiber.mode & ConcurrentMode) !== NoMode;\n                didNotFindHydratableInstance(parentType, parentProps, parentInstance, _type, _props, // TODO: Delete this argument when we remove the legacy root API.\n                isConcurrentMode);\n                break;\n              }\n\n            case HostText:\n              {\n                var _text = fiber.pendingProps;\n\n                var _isConcurrentMode = (returnFiber.mode & ConcurrentMode) !== NoMode;\n\n                didNotFindHydratableTextInstance(parentType, parentProps, parentInstance, _text, // TODO: Delete this argument when we remove the legacy root API.\n                _isConcurrentMode);\n                break;\n              }\n          }\n\n          break;\n        }\n\n      case SuspenseComponent:\n        {\n          var suspenseState = returnFiber.memoizedState;\n          var _parentInstance = suspenseState.dehydrated;\n          if (_parentInstance !== null) switch (fiber.tag) {\n            case HostComponent:\n              var _type2 = fiber.type;\n              var _props2 = fiber.pendingProps;\n              didNotFindHydratableInstanceWithinSuspenseInstance(_parentInstance, _type2);\n              break;\n\n            case HostText:\n              var _text2 = fiber.pendingProps;\n              didNotFindHydratableTextInstanceWithinSuspenseInstance(_parentInstance, _text2);\n              break;\n          }\n          break;\n        }\n\n      default:\n        return;\n    }\n  }\n}\n\nfunction insertNonHydratedInstance(returnFiber, fiber) {\n  fiber.flags = fiber.flags & ~Hydrating | Placement;\n  warnNonhydratedInstance(returnFiber, fiber);\n}\n\nfunction tryHydrate(fiber, nextInstance) {\n  switch (fiber.tag) {\n    case HostComponent:\n      {\n        var type = fiber.type;\n        var props = fiber.pendingProps;\n        var instance = canHydrateInstance(nextInstance, type);\n\n        if (instance !== null) {\n          fiber.stateNode = instance;\n          hydrationParentFiber = fiber;\n          nextHydratableInstance = getFirstHydratableChild(instance);\n          return true;\n        }\n\n        return false;\n      }\n\n    case HostText:\n      {\n        var text = fiber.pendingProps;\n        var textInstance = canHydrateTextInstance(nextInstance, text);\n\n        if (textInstance !== null) {\n          fiber.stateNode = textInstance;\n          hydrationParentFiber = fiber; // Text Instances don't have children so there's nothing to hydrate.\n\n          nextHydratableInstance = null;\n          return true;\n        }\n\n        return false;\n      }\n\n    case SuspenseComponent:\n      {\n        var suspenseInstance = canHydrateSuspenseInstance(nextInstance);\n\n        if (suspenseInstance !== null) {\n          var suspenseState = {\n            dehydrated: suspenseInstance,\n            treeContext: getSuspendedTreeContext(),\n            retryLane: OffscreenLane\n          };\n          fiber.memoizedState = suspenseState; // Store the dehydrated fragment as a child fiber.\n          // This simplifies the code for getHostSibling and deleting nodes,\n          // since it doesn't have to consider all Suspense boundaries and\n          // check if they're dehydrated ones or not.\n\n          var dehydratedFragment = createFiberFromDehydratedFragment(suspenseInstance);\n          dehydratedFragment.return = fiber;\n          fiber.child = dehydratedFragment;\n          hydrationParentFiber = fiber; // While a Suspense Instance does have children, we won't step into\n          // it during the first pass. Instead, we'll reenter it later.\n\n          nextHydratableInstance = null;\n          return true;\n        }\n\n        return false;\n      }\n\n    default:\n      return false;\n  }\n}\n\nfunction shouldClientRenderOnMismatch(fiber) {\n  return (fiber.mode & ConcurrentMode) !== NoMode && (fiber.flags & DidCapture) === NoFlags;\n}\n\nfunction throwOnHydrationMismatch(fiber) {\n  throw new Error('Hydration failed because the initial UI does not match what was ' + 'rendered on the server.');\n}\n\nfunction tryToClaimNextHydratableInstance(fiber) {\n  if (!isHydrating) {\n    return;\n  }\n\n  var nextInstance = nextHydratableInstance;\n\n  if (!nextInstance) {\n    if (shouldClientRenderOnMismatch(fiber)) {\n      warnNonhydratedInstance(hydrationParentFiber, fiber);\n      throwOnHydrationMismatch();\n    } // Nothing to hydrate. Make it an insertion.\n\n\n    insertNonHydratedInstance(hydrationParentFiber, fiber);\n    isHydrating = false;\n    hydrationParentFiber = fiber;\n    return;\n  }\n\n  var firstAttemptedInstance = nextInstance;\n\n  if (!tryHydrate(fiber, nextInstance)) {\n    if (shouldClientRenderOnMismatch(fiber)) {\n      warnNonhydratedInstance(hydrationParentFiber, fiber);\n      throwOnHydrationMismatch();\n    } // If we can't hydrate this instance let's try the next one.\n    // We use this as a heuristic. It's based on intuition and not data so it\n    // might be flawed or unnecessary.\n\n\n    nextInstance = getNextHydratableSibling(firstAttemptedInstance);\n    var prevHydrationParentFiber = hydrationParentFiber;\n\n    if (!nextInstance || !tryHydrate(fiber, nextInstance)) {\n      // Nothing to hydrate. Make it an insertion.\n      insertNonHydratedInstance(hydrationParentFiber, fiber);\n      isHydrating = false;\n      hydrationParentFiber = fiber;\n      return;\n    } // We matched the next one, we'll now assume that the first one was\n    // superfluous and we'll delete it. Since we can't eagerly delete it\n    // we'll have to schedule a deletion. To do that, this node needs a dummy\n    // fiber associated with it.\n\n\n    deleteHydratableInstance(prevHydrationParentFiber, firstAttemptedInstance);\n  }\n}\n\nfunction prepareToHydrateHostInstance(fiber, rootContainerInstance, hostContext) {\n\n  var instance = fiber.stateNode;\n  var shouldWarnIfMismatchDev = !didSuspendOrErrorDEV;\n  var updatePayload = hydrateInstance(instance, fiber.type, fiber.memoizedProps, rootContainerInstance, hostContext, fiber, shouldWarnIfMismatchDev); // TODO: Type this specific to this type of component.\n\n  fiber.updateQueue = updatePayload; // If the update payload indicates that there is a change or if there\n  // is a new ref we mark this as an update.\n\n  if (updatePayload !== null) {\n    return true;\n  }\n\n  return false;\n}\n\nfunction prepareToHydrateHostTextInstance(fiber) {\n\n  var textInstance = fiber.stateNode;\n  var textContent = fiber.memoizedProps;\n  var shouldUpdate = hydrateTextInstance(textInstance, textContent, fiber);\n\n  if (shouldUpdate) {\n    // We assume that prepareToHydrateHostTextInstance is called in a context where the\n    // hydration parent is the parent host component of this host text.\n    var returnFiber = hydrationParentFiber;\n\n    if (returnFiber !== null) {\n      switch (returnFiber.tag) {\n        case HostRoot:\n          {\n            var parentContainer = returnFiber.stateNode.containerInfo;\n            var isConcurrentMode = (returnFiber.mode & ConcurrentMode) !== NoMode;\n            didNotMatchHydratedContainerTextInstance(parentContainer, textInstance, textContent, // TODO: Delete this argument when we remove the legacy root API.\n            isConcurrentMode);\n            break;\n          }\n\n        case HostComponent:\n          {\n            var parentType = returnFiber.type;\n            var parentProps = returnFiber.memoizedProps;\n            var parentInstance = returnFiber.stateNode;\n\n            var _isConcurrentMode2 = (returnFiber.mode & ConcurrentMode) !== NoMode;\n\n            didNotMatchHydratedTextInstance(parentType, parentProps, parentInstance, textInstance, textContent, // TODO: Delete this argument when we remove the legacy root API.\n            _isConcurrentMode2);\n            break;\n          }\n      }\n    }\n  }\n\n  return shouldUpdate;\n}\n\nfunction prepareToHydrateHostSuspenseInstance(fiber) {\n\n  var suspenseState = fiber.memoizedState;\n  var suspenseInstance = suspenseState !== null ? suspenseState.dehydrated : null;\n\n  if (!suspenseInstance) {\n    throw new Error('Expected to have a hydrated suspense instance. ' + 'This error is likely caused by a bug in React. Please file an issue.');\n  }\n\n  hydrateSuspenseInstance(suspenseInstance, fiber);\n}\n\nfunction skipPastDehydratedSuspenseInstance(fiber) {\n\n  var suspenseState = fiber.memoizedState;\n  var suspenseInstance = suspenseState !== null ? suspenseState.dehydrated : null;\n\n  if (!suspenseInstance) {\n    throw new Error('Expected to have a hydrated suspense instance. ' + 'This error is likely caused by a bug in React. Please file an issue.');\n  }\n\n  return getNextHydratableInstanceAfterSuspenseInstance(suspenseInstance);\n}\n\nfunction popToNextHostParent(fiber) {\n  var parent = fiber.return;\n\n  while (parent !== null && parent.tag !== HostComponent && parent.tag !== HostRoot && parent.tag !== SuspenseComponent) {\n    parent = parent.return;\n  }\n\n  hydrationParentFiber = parent;\n}\n\nfunction popHydrationState(fiber) {\n\n  if (fiber !== hydrationParentFiber) {\n    // We're deeper than the current hydration context, inside an inserted\n    // tree.\n    return false;\n  }\n\n  if (!isHydrating) {\n    // If we're not currently hydrating but we're in a hydration context, then\n    // we were an insertion and now need to pop up reenter hydration of our\n    // siblings.\n    popToNextHostParent(fiber);\n    isHydrating = true;\n    return false;\n  } // If we have any remaining hydratable nodes, we need to delete them now.\n  // We only do this deeper than head and body since they tend to have random\n  // other nodes in them. We also ignore components with pure text content in\n  // side of them. We also don't delete anything inside the root container.\n\n\n  if (fiber.tag !== HostRoot && (fiber.tag !== HostComponent || shouldDeleteUnhydratedTailInstances(fiber.type) && !shouldSetTextContent(fiber.type, fiber.memoizedProps))) {\n    var nextInstance = nextHydratableInstance;\n\n    if (nextInstance) {\n      if (shouldClientRenderOnMismatch(fiber)) {\n        warnIfUnhydratedTailNodes(fiber);\n        throwOnHydrationMismatch();\n      } else {\n        while (nextInstance) {\n          deleteHydratableInstance(fiber, nextInstance);\n          nextInstance = getNextHydratableSibling(nextInstance);\n        }\n      }\n    }\n  }\n\n  popToNextHostParent(fiber);\n\n  if (fiber.tag === SuspenseComponent) {\n    nextHydratableInstance = skipPastDehydratedSuspenseInstance(fiber);\n  } else {\n    nextHydratableInstance = hydrationParentFiber ? getNextHydratableSibling(fiber.stateNode) : null;\n  }\n\n  return true;\n}\n\nfunction hasUnhydratedTailNodes() {\n  return isHydrating && nextHydratableInstance !== null;\n}\n\nfunction warnIfUnhydratedTailNodes(fiber) {\n  var nextInstance = nextHydratableInstance;\n\n  while (nextInstance) {\n    warnUnhydratedInstance(fiber, nextInstance);\n    nextInstance = getNextHydratableSibling(nextInstance);\n  }\n}\n\nfunction resetHydrationState() {\n\n  hydrationParentFiber = null;\n  nextHydratableInstance = null;\n  isHydrating = false;\n  didSuspendOrErrorDEV = false;\n}\n\nfunction upgradeHydrationErrorsToRecoverable() {\n  if (hydrationErrors !== null) {\n    // Successfully completed a forced client render. The errors that occurred\n    // during the hydration attempt are now recovered. We will log them in\n    // commit phase, once the entire tree has finished.\n    queueRecoverableErrors(hydrationErrors);\n    hydrationErrors = null;\n  }\n}\n\nfunction getIsHydrating() {\n  return isHydrating;\n}\n\nfunction queueHydrationError(error) {\n  if (hydrationErrors === null) {\n    hydrationErrors = [error];\n  } else {\n    hydrationErrors.push(error);\n  }\n}\n\nvar ReactCurrentBatchConfig$1 = ReactSharedInternals.ReactCurrentBatchConfig;\nvar NoTransition = null;\nfunction requestCurrentTransition() {\n  return ReactCurrentBatchConfig$1.transition;\n}\n\nvar ReactStrictModeWarnings = {\n  recordUnsafeLifecycleWarnings: function (fiber, instance) {},\n  flushPendingUnsafeLifecycleWarnings: function () {},\n  recordLegacyContextWarning: function (fiber, instance) {},\n  flushLegacyContextWarning: function () {},\n  discardPendingWarnings: function () {}\n};\n\n{\n  var findStrictRoot = function (fiber) {\n    var maybeStrictRoot = null;\n    var node = fiber;\n\n    while (node !== null) {\n      if (node.mode & StrictLegacyMode) {\n        maybeStrictRoot = node;\n      }\n\n      node = node.return;\n    }\n\n    return maybeStrictRoot;\n  };\n\n  var setToSortedString = function (set) {\n    var array = [];\n    set.forEach(function (value) {\n      array.push(value);\n    });\n    return array.sort().join(', ');\n  };\n\n  var pendingComponentWillMountWarnings = [];\n  var pendingUNSAFE_ComponentWillMountWarnings = [];\n  var pendingComponentWillReceivePropsWarnings = [];\n  var pendingUNSAFE_ComponentWillReceivePropsWarnings = [];\n  var pendingComponentWillUpdateWarnings = [];\n  var pendingUNSAFE_ComponentWillUpdateWarnings = []; // Tracks components we have already warned about.\n\n  var didWarnAboutUnsafeLifecycles = new Set();\n\n  ReactStrictModeWarnings.recordUnsafeLifecycleWarnings = function (fiber, instance) {\n    // Dedupe strategy: Warn once per component.\n    if (didWarnAboutUnsafeLifecycles.has(fiber.type)) {\n      return;\n    }\n\n    if (typeof instance.componentWillMount === 'function' && // Don't warn about react-lifecycles-compat polyfilled components.\n    instance.componentWillMount.__suppressDeprecationWarning !== true) {\n      pendingComponentWillMountWarnings.push(fiber);\n    }\n\n    if (fiber.mode & StrictLegacyMode && typeof instance.UNSAFE_componentWillMount === 'function') {\n      pendingUNSAFE_ComponentWillMountWarnings.push(fiber);\n    }\n\n    if (typeof instance.componentWillReceiveProps === 'function' && instance.componentWillReceiveProps.__suppressDeprecationWarning !== true) {\n      pendingComponentWillReceivePropsWarnings.push(fiber);\n    }\n\n    if (fiber.mode & StrictLegacyMode && typeof instance.UNSAFE_componentWillReceiveProps === 'function') {\n      pendingUNSAFE_ComponentWillReceivePropsWarnings.push(fiber);\n    }\n\n    if (typeof instance.componentWillUpdate === 'function' && instance.componentWillUpdate.__suppressDeprecationWarning !== true) {\n      pendingComponentWillUpdateWarnings.push(fiber);\n    }\n\n    if (fiber.mode & StrictLegacyMode && typeof instance.UNSAFE_componentWillUpdate === 'function') {\n      pendingUNSAFE_ComponentWillUpdateWarnings.push(fiber);\n    }\n  };\n\n  ReactStrictModeWarnings.flushPendingUnsafeLifecycleWarnings = function () {\n    // We do an initial pass to gather component names\n    var componentWillMountUniqueNames = new Set();\n\n    if (pendingComponentWillMountWarnings.length > 0) {\n      pendingComponentWillMountWarnings.forEach(function (fiber) {\n        componentWillMountUniqueNames.add(getComponentNameFromFiber(fiber) || 'Component');\n        didWarnAboutUnsafeLifecycles.add(fiber.type);\n      });\n      pendingComponentWillMountWarnings = [];\n    }\n\n    var UNSAFE_componentWillMountUniqueNames = new Set();\n\n    if (pendingUNSAFE_ComponentWillMountWarnings.length > 0) {\n      pendingUNSAFE_ComponentWillMountWarnings.forEach(function (fiber) {\n        UNSAFE_componentWillMountUniqueNames.add(getComponentNameFromFiber(fiber) || 'Component');\n        didWarnAboutUnsafeLifecycles.add(fiber.type);\n      });\n      pendingUNSAFE_ComponentWillMountWarnings = [];\n    }\n\n    var componentWillReceivePropsUniqueNames = new Set();\n\n    if (pendingComponentWillReceivePropsWarnings.length > 0) {\n      pendingComponentWillReceivePropsWarnings.forEach(function (fiber) {\n        componentWillReceivePropsUniqueNames.add(getComponentNameFromFiber(fiber) || 'Component');\n        didWarnAboutUnsafeLifecycles.add(fiber.type);\n      });\n      pendingComponentWillReceivePropsWarnings = [];\n    }\n\n    var UNSAFE_componentWillReceivePropsUniqueNames = new Set();\n\n    if (pendingUNSAFE_ComponentWillReceivePropsWarnings.length > 0) {\n      pendingUNSAFE_ComponentWillReceivePropsWarnings.forEach(function (fiber) {\n        UNSAFE_componentWillReceivePropsUniqueNames.add(getComponentNameFromFiber(fiber) || 'Component');\n        didWarnAboutUnsafeLifecycles.add(fiber.type);\n      });\n      pendingUNSAFE_ComponentWillReceivePropsWarnings = [];\n    }\n\n    var componentWillUpdateUniqueNames = new Set();\n\n    if (pendingComponentWillUpdateWarnings.length > 0) {\n      pendingComponentWillUpdateWarnings.forEach(function (fiber) {\n        componentWillUpdateUniqueNames.add(getComponentNameFromFiber(fiber) || 'Component');\n        didWarnAboutUnsafeLifecycles.add(fiber.type);\n      });\n      pendingComponentWillUpdateWarnings = [];\n    }\n\n    var UNSAFE_componentWillUpdateUniqueNames = new Set();\n\n    if (pendingUNSAFE_ComponentWillUpdateWarnings.length > 0) {\n      pendingUNSAFE_ComponentWillUpdateWarnings.forEach(function (fiber) {\n        UNSAFE_componentWillUpdateUniqueNames.add(getComponentNameFromFiber(fiber) || 'Component');\n        didWarnAboutUnsafeLifecycles.add(fiber.type);\n      });\n      pendingUNSAFE_ComponentWillUpdateWarnings = [];\n    } // Finally, we flush all the warnings\n    // UNSAFE_ ones before the deprecated ones, since they'll be 'louder'\n\n\n    if (UNSAFE_componentWillMountUniqueNames.size > 0) {\n      var sortedNames = setToSortedString(UNSAFE_componentWillMountUniqueNames);\n\n      error('Using UNSAFE_componentWillMount in strict mode is not recommended and may indicate bugs in your code. ' + 'See https://reactjs.org/link/unsafe-component-lifecycles for details.\\n\\n' + '* Move code with side effects to componentDidMount, and set initial state in the constructor.\\n' + '\\nPlease update the following components: %s', sortedNames);\n    }\n\n    if (UNSAFE_componentWillReceivePropsUniqueNames.size > 0) {\n      var _sortedNames = setToSortedString(UNSAFE_componentWillReceivePropsUniqueNames);\n\n      error('Using UNSAFE_componentWillReceiveProps in strict mode is not recommended ' + 'and may indicate bugs in your code. ' + 'See https://reactjs.org/link/unsafe-component-lifecycles for details.\\n\\n' + '* Move data fetching code or side effects to componentDidUpdate.\\n' + \"* If you're updating state whenever props change, \" + 'refactor your code to use memoization techniques or move it to ' + 'static getDerivedStateFromProps. Learn more at: https://reactjs.org/link/derived-state\\n' + '\\nPlease update the following components: %s', _sortedNames);\n    }\n\n    if (UNSAFE_componentWillUpdateUniqueNames.size > 0) {\n      var _sortedNames2 = setToSortedString(UNSAFE_componentWillUpdateUniqueNames);\n\n      error('Using UNSAFE_componentWillUpdate in strict mode is not recommended ' + 'and may indicate bugs in your code. ' + 'See https://reactjs.org/link/unsafe-component-lifecycles for details.\\n\\n' + '* Move data fetching code or side effects to componentDidUpdate.\\n' + '\\nPlease update the following components: %s', _sortedNames2);\n    }\n\n    if (componentWillMountUniqueNames.size > 0) {\n      var _sortedNames3 = setToSortedString(componentWillMountUniqueNames);\n\n      warn('componentWillMount has been renamed, and is not recommended for use. ' + 'See https://reactjs.org/link/unsafe-component-lifecycles for details.\\n\\n' + '* Move code with side effects to componentDidMount, and set initial state in the constructor.\\n' + '* Rename componentWillMount to UNSAFE_componentWillMount to suppress ' + 'this warning in non-strict mode. In React 18.x, only the UNSAFE_ name will work. ' + 'To rename all deprecated lifecycles to their new names, you can run ' + '`npx react-codemod rename-unsafe-lifecycles` in your project source folder.\\n' + '\\nPlease update the following components: %s', _sortedNames3);\n    }\n\n    if (componentWillReceivePropsUniqueNames.size > 0) {\n      var _sortedNames4 = setToSortedString(componentWillReceivePropsUniqueNames);\n\n      warn('componentWillReceiveProps has been renamed, and is not recommended for use. ' + 'See https://reactjs.org/link/unsafe-component-lifecycles for details.\\n\\n' + '* Move data fetching code or side effects to componentDidUpdate.\\n' + \"* If you're updating state whenever props change, refactor your \" + 'code to use memoization techniques or move it to ' + 'static getDerivedStateFromProps. Learn more at: https://reactjs.org/link/derived-state\\n' + '* Rename componentWillReceiveProps to UNSAFE_componentWillReceiveProps to suppress ' + 'this warning in non-strict mode. In React 18.x, only the UNSAFE_ name will work. ' + 'To rename all deprecated lifecycles to their new names, you can run ' + '`npx react-codemod rename-unsafe-lifecycles` in your project source folder.\\n' + '\\nPlease update the following components: %s', _sortedNames4);\n    }\n\n    if (componentWillUpdateUniqueNames.size > 0) {\n      var _sortedNames5 = setToSortedString(componentWillUpdateUniqueNames);\n\n      warn('componentWillUpdate has been renamed, and is not recommended for use. ' + 'See https://reactjs.org/link/unsafe-component-lifecycles for details.\\n\\n' + '* Move data fetching code or side effects to componentDidUpdate.\\n' + '* Rename componentWillUpdate to UNSAFE_componentWillUpdate to suppress ' + 'this warning in non-strict mode. In React 18.x, only the UNSAFE_ name will work. ' + 'To rename all deprecated lifecycles to their new names, you can run ' + '`npx react-codemod rename-unsafe-lifecycles` in your project source folder.\\n' + '\\nPlease update the following components: %s', _sortedNames5);\n    }\n  };\n\n  var pendingLegacyContextWarning = new Map(); // Tracks components we have already warned about.\n\n  var didWarnAboutLegacyContext = new Set();\n\n  ReactStrictModeWarnings.recordLegacyContextWarning = function (fiber, instance) {\n    var strictRoot = findStrictRoot(fiber);\n\n    if (strictRoot === null) {\n      error('Expected to find a StrictMode component in a strict mode tree. ' + 'This error is likely caused by a bug in React. Please file an issue.');\n\n      return;\n    } // Dedup strategy: Warn once per component.\n\n\n    if (didWarnAboutLegacyContext.has(fiber.type)) {\n      return;\n    }\n\n    var warningsForRoot = pendingLegacyContextWarning.get(strictRoot);\n\n    if (fiber.type.contextTypes != null || fiber.type.childContextTypes != null || instance !== null && typeof instance.getChildContext === 'function') {\n      if (warningsForRoot === undefined) {\n        warningsForRoot = [];\n        pendingLegacyContextWarning.set(strictRoot, warningsForRoot);\n      }\n\n      warningsForRoot.push(fiber);\n    }\n  };\n\n  ReactStrictModeWarnings.flushLegacyContextWarning = function () {\n    pendingLegacyContextWarning.forEach(function (fiberArray, strictRoot) {\n      if (fiberArray.length === 0) {\n        return;\n      }\n\n      var firstFiber = fiberArray[0];\n      var uniqueNames = new Set();\n      fiberArray.forEach(function (fiber) {\n        uniqueNames.add(getComponentNameFromFiber(fiber) || 'Component');\n        didWarnAboutLegacyContext.add(fiber.type);\n      });\n      var sortedNames = setToSortedString(uniqueNames);\n\n      try {\n        setCurrentFiber(firstFiber);\n\n        error('Legacy context API has been detected within a strict-mode tree.' + '\\n\\nThe old API will be supported in all 16.x releases, but applications ' + 'using it should migrate to the new version.' + '\\n\\nPlease update the following components: %s' + '\\n\\nLearn more about this warning here: https://reactjs.org/link/legacy-context', sortedNames);\n      } finally {\n        resetCurrentFiber();\n      }\n    });\n  };\n\n  ReactStrictModeWarnings.discardPendingWarnings = function () {\n    pendingComponentWillMountWarnings = [];\n    pendingUNSAFE_ComponentWillMountWarnings = [];\n    pendingComponentWillReceivePropsWarnings = [];\n    pendingUNSAFE_ComponentWillReceivePropsWarnings = [];\n    pendingComponentWillUpdateWarnings = [];\n    pendingUNSAFE_ComponentWillUpdateWarnings = [];\n    pendingLegacyContextWarning = new Map();\n  };\n}\n\nfunction resolveDefaultProps(Component, baseProps) {\n  if (Component && Component.defaultProps) {\n    // Resolve default props. Taken from ReactElement\n    var props = assign({}, baseProps);\n    var defaultProps = Component.defaultProps;\n\n    for (var propName in defaultProps) {\n      if (props[propName] === undefined) {\n        props[propName] = defaultProps[propName];\n      }\n    }\n\n    return props;\n  }\n\n  return baseProps;\n}\n\nvar valueCursor = createCursor(null);\nvar rendererSigil;\n\n{\n  // Use this to detect multiple renderers using the same context\n  rendererSigil = {};\n}\n\nvar currentlyRenderingFiber = null;\nvar lastContextDependency = null;\nvar lastFullyObservedContext = null;\nvar isDisallowedContextReadInDEV = false;\nfunction resetContextDependencies() {\n  // This is called right before React yields execution, to ensure `readContext`\n  // cannot be called outside the render phase.\n  currentlyRenderingFiber = null;\n  lastContextDependency = null;\n  lastFullyObservedContext = null;\n\n  {\n    isDisallowedContextReadInDEV = false;\n  }\n}\nfunction enterDisallowedContextReadInDEV() {\n  {\n    isDisallowedContextReadInDEV = true;\n  }\n}\nfunction exitDisallowedContextReadInDEV() {\n  {\n    isDisallowedContextReadInDEV = false;\n  }\n}\nfunction pushProvider(providerFiber, context, nextValue) {\n  {\n    push(valueCursor, context._currentValue, providerFiber);\n    context._currentValue = nextValue;\n\n    {\n      if (context._currentRenderer !== undefined && context._currentRenderer !== null && context._currentRenderer !== rendererSigil) {\n        error('Detected multiple renderers concurrently rendering the ' + 'same context provider. This is currently unsupported.');\n      }\n\n      context._currentRenderer = rendererSigil;\n    }\n  }\n}\nfunction popProvider(context, providerFiber) {\n  var currentValue = valueCursor.current;\n  pop(valueCursor, providerFiber);\n\n  {\n    {\n      context._currentValue = currentValue;\n    }\n  }\n}\nfunction scheduleContextWorkOnParentPath(parent, renderLanes, propagationRoot) {\n  // Update the child lanes of all the ancestors, including the alternates.\n  var node = parent;\n\n  while (node !== null) {\n    var alternate = node.alternate;\n\n    if (!isSubsetOfLanes(node.childLanes, renderLanes)) {\n      node.childLanes = mergeLanes(node.childLanes, renderLanes);\n\n      if (alternate !== null) {\n        alternate.childLanes = mergeLanes(alternate.childLanes, renderLanes);\n      }\n    } else if (alternate !== null && !isSubsetOfLanes(alternate.childLanes, renderLanes)) {\n      alternate.childLanes = mergeLanes(alternate.childLanes, renderLanes);\n    }\n\n    if (node === propagationRoot) {\n      break;\n    }\n\n    node = node.return;\n  }\n\n  {\n    if (node !== propagationRoot) {\n      error('Expected to find the propagation root when scheduling context work. ' + 'This error is likely caused by a bug in React. Please file an issue.');\n    }\n  }\n}\nfunction propagateContextChange(workInProgress, context, renderLanes) {\n  {\n    propagateContextChange_eager(workInProgress, context, renderLanes);\n  }\n}\n\nfunction propagateContextChange_eager(workInProgress, context, renderLanes) {\n\n  var fiber = workInProgress.child;\n\n  if (fiber !== null) {\n    // Set the return pointer of the child to the work-in-progress fiber.\n    fiber.return = workInProgress;\n  }\n\n  while (fiber !== null) {\n    var nextFiber = void 0; // Visit this fiber.\n\n    var list = fiber.dependencies;\n\n    if (list !== null) {\n      nextFiber = fiber.child;\n      var dependency = list.firstContext;\n\n      while (dependency !== null) {\n        // Check if the context matches.\n        if (dependency.context === context) {\n          // Match! Schedule an update on this fiber.\n          if (fiber.tag === ClassComponent) {\n            // Schedule a force update on the work-in-progress.\n            var lane = pickArbitraryLane(renderLanes);\n            var update = createUpdate(NoTimestamp, lane);\n            update.tag = ForceUpdate; // TODO: Because we don't have a work-in-progress, this will add the\n            // update to the current fiber, too, which means it will persist even if\n            // this render is thrown away. Since it's a race condition, not sure it's\n            // worth fixing.\n            // Inlined `enqueueUpdate` to remove interleaved update check\n\n            var updateQueue = fiber.updateQueue;\n\n            if (updateQueue === null) ; else {\n              var sharedQueue = updateQueue.shared;\n              var pending = sharedQueue.pending;\n\n              if (pending === null) {\n                // This is the first update. Create a circular list.\n                update.next = update;\n              } else {\n                update.next = pending.next;\n                pending.next = update;\n              }\n\n              sharedQueue.pending = update;\n            }\n          }\n\n          fiber.lanes = mergeLanes(fiber.lanes, renderLanes);\n          var alternate = fiber.alternate;\n\n          if (alternate !== null) {\n            alternate.lanes = mergeLanes(alternate.lanes, renderLanes);\n          }\n\n          scheduleContextWorkOnParentPath(fiber.return, renderLanes, workInProgress); // Mark the updated lanes on the list, too.\n\n          list.lanes = mergeLanes(list.lanes, renderLanes); // Since we already found a match, we can stop traversing the\n          // dependency list.\n\n          break;\n        }\n\n        dependency = dependency.next;\n      }\n    } else if (fiber.tag === ContextProvider) {\n      // Don't scan deeper if this is a matching provider\n      nextFiber = fiber.type === workInProgress.type ? null : fiber.child;\n    } else if (fiber.tag === DehydratedFragment) {\n      // If a dehydrated suspense boundary is in this subtree, we don't know\n      // if it will have any context consumers in it. The best we can do is\n      // mark it as having updates.\n      var parentSuspense = fiber.return;\n\n      if (parentSuspense === null) {\n        throw new Error('We just came from a parent so we must have had a parent. This is a bug in React.');\n      }\n\n      parentSuspense.lanes = mergeLanes(parentSuspense.lanes, renderLanes);\n      var _alternate = parentSuspense.alternate;\n\n      if (_alternate !== null) {\n        _alternate.lanes = mergeLanes(_alternate.lanes, renderLanes);\n      } // This is intentionally passing this fiber as the parent\n      // because we want to schedule this fiber as having work\n      // on its children. We'll use the childLanes on\n      // this fiber to indicate that a context has changed.\n\n\n      scheduleContextWorkOnParentPath(parentSuspense, renderLanes, workInProgress);\n      nextFiber = fiber.sibling;\n    } else {\n      // Traverse down.\n      nextFiber = fiber.child;\n    }\n\n    if (nextFiber !== null) {\n      // Set the return pointer of the child to the work-in-progress fiber.\n      nextFiber.return = fiber;\n    } else {\n      // No child. Traverse to next sibling.\n      nextFiber = fiber;\n\n      while (nextFiber !== null) {\n        if (nextFiber === workInProgress) {\n          // We're back to the root of this subtree. Exit.\n          nextFiber = null;\n          break;\n        }\n\n        var sibling = nextFiber.sibling;\n\n        if (sibling !== null) {\n          // Set the return pointer of the sibling to the work-in-progress fiber.\n          sibling.return = nextFiber.return;\n          nextFiber = sibling;\n          break;\n        } // No more siblings. Traverse up.\n\n\n        nextFiber = nextFiber.return;\n      }\n    }\n\n    fiber = nextFiber;\n  }\n}\nfunction prepareToReadContext(workInProgress, renderLanes) {\n  currentlyRenderingFiber = workInProgress;\n  lastContextDependency = null;\n  lastFullyObservedContext = null;\n  var dependencies = workInProgress.dependencies;\n\n  if (dependencies !== null) {\n    {\n      var firstContext = dependencies.firstContext;\n\n      if (firstContext !== null) {\n        if (includesSomeLane(dependencies.lanes, renderLanes)) {\n          // Context list has a pending update. Mark that this fiber performed work.\n          markWorkInProgressReceivedUpdate();\n        } // Reset the work-in-progress list\n\n\n        dependencies.firstContext = null;\n      }\n    }\n  }\n}\nfunction readContext(context) {\n  {\n    // This warning would fire if you read context inside a Hook like useMemo.\n    // Unlike the class check below, it's not enforced in production for perf.\n    if (isDisallowedContextReadInDEV) {\n      error('Context can only be read while React is rendering. ' + 'In classes, you can read it in the render method or getDerivedStateFromProps. ' + 'In function components, you can read it directly in the function body, but not ' + 'inside Hooks like useReducer() or useMemo().');\n    }\n  }\n\n  var value =  context._currentValue ;\n\n  if (lastFullyObservedContext === context) ; else {\n    var contextItem = {\n      context: context,\n      memoizedValue: value,\n      next: null\n    };\n\n    if (lastContextDependency === null) {\n      if (currentlyRenderingFiber === null) {\n        throw new Error('Context can only be read while React is rendering. ' + 'In classes, you can read it in the render method or getDerivedStateFromProps. ' + 'In function components, you can read it directly in the function body, but not ' + 'inside Hooks like useReducer() or useMemo().');\n      } // This is the first dependency for this component. Create a new list.\n\n\n      lastContextDependency = contextItem;\n      currentlyRenderingFiber.dependencies = {\n        lanes: NoLanes,\n        firstContext: contextItem\n      };\n    } else {\n      // Append a new context item.\n      lastContextDependency = lastContextDependency.next = contextItem;\n    }\n  }\n\n  return value;\n}\n\n// render. When this render exits, either because it finishes or because it is\n// interrupted, the interleaved updates will be transferred onto the main part\n// of the queue.\n\nvar concurrentQueues = null;\nfunction pushConcurrentUpdateQueue(queue) {\n  if (concurrentQueues === null) {\n    concurrentQueues = [queue];\n  } else {\n    concurrentQueues.push(queue);\n  }\n}\nfunction finishQueueingConcurrentUpdates() {\n  // Transfer the interleaved updates onto the main queue. Each queue has a\n  // `pending` field and an `interleaved` field. When they are not null, they\n  // point to the last node in a circular linked list. We need to append the\n  // interleaved list to the end of the pending list by joining them into a\n  // single, circular list.\n  if (concurrentQueues !== null) {\n    for (var i = 0; i < concurrentQueues.length; i++) {\n      var queue = concurrentQueues[i];\n      var lastInterleavedUpdate = queue.interleaved;\n\n      if (lastInterleavedUpdate !== null) {\n        queue.interleaved = null;\n        var firstInterleavedUpdate = lastInterleavedUpdate.next;\n        var lastPendingUpdate = queue.pending;\n\n        if (lastPendingUpdate !== null) {\n          var firstPendingUpdate = lastPendingUpdate.next;\n          lastPendingUpdate.next = firstInterleavedUpdate;\n          lastInterleavedUpdate.next = firstPendingUpdate;\n        }\n\n        queue.pending = lastInterleavedUpdate;\n      }\n    }\n\n    concurrentQueues = null;\n  }\n}\nfunction enqueueConcurrentHookUpdate(fiber, queue, update, lane) {\n  var interleaved = queue.interleaved;\n\n  if (interleaved === null) {\n    // This is the first update. Create a circular list.\n    update.next = update; // At the end of the current render, this queue's interleaved updates will\n    // be transferred to the pending queue.\n\n    pushConcurrentUpdateQueue(queue);\n  } else {\n    update.next = interleaved.next;\n    interleaved.next = update;\n  }\n\n  queue.interleaved = update;\n  return markUpdateLaneFromFiberToRoot(fiber, lane);\n}\nfunction enqueueConcurrentHookUpdateAndEagerlyBailout(fiber, queue, update, lane) {\n  var interleaved = queue.interleaved;\n\n  if (interleaved === null) {\n    // This is the first update. Create a circular list.\n    update.next = update; // At the end of the current render, this queue's interleaved updates will\n    // be transferred to the pending queue.\n\n    pushConcurrentUpdateQueue(queue);\n  } else {\n    update.next = interleaved.next;\n    interleaved.next = update;\n  }\n\n  queue.interleaved = update;\n}\nfunction enqueueConcurrentClassUpdate(fiber, queue, update, lane) {\n  var interleaved = queue.interleaved;\n\n  if (interleaved === null) {\n    // This is the first update. Create a circular list.\n    update.next = update; // At the end of the current render, this queue's interleaved updates will\n    // be transferred to the pending queue.\n\n    pushConcurrentUpdateQueue(queue);\n  } else {\n    update.next = interleaved.next;\n    interleaved.next = update;\n  }\n\n  queue.interleaved = update;\n  return markUpdateLaneFromFiberToRoot(fiber, lane);\n}\nfunction enqueueConcurrentRenderForLane(fiber, lane) {\n  return markUpdateLaneFromFiberToRoot(fiber, lane);\n} // Calling this function outside this module should only be done for backwards\n// compatibility and should always be accompanied by a warning.\n\nvar unsafe_markUpdateLaneFromFiberToRoot = markUpdateLaneFromFiberToRoot;\n\nfunction markUpdateLaneFromFiberToRoot(sourceFiber, lane) {\n  // Update the source fiber's lanes\n  sourceFiber.lanes = mergeLanes(sourceFiber.lanes, lane);\n  var alternate = sourceFiber.alternate;\n\n  if (alternate !== null) {\n    alternate.lanes = mergeLanes(alternate.lanes, lane);\n  }\n\n  {\n    if (alternate === null && (sourceFiber.flags & (Placement | Hydrating)) !== NoFlags) {\n      warnAboutUpdateOnNotYetMountedFiberInDEV(sourceFiber);\n    }\n  } // Walk the parent path to the root and update the child lanes.\n\n\n  var node = sourceFiber;\n  var parent = sourceFiber.return;\n\n  while (parent !== null) {\n    parent.childLanes = mergeLanes(parent.childLanes, lane);\n    alternate = parent.alternate;\n\n    if (alternate !== null) {\n      alternate.childLanes = mergeLanes(alternate.childLanes, lane);\n    } else {\n      {\n        if ((parent.flags & (Placement | Hydrating)) !== NoFlags) {\n          warnAboutUpdateOnNotYetMountedFiberInDEV(sourceFiber);\n        }\n      }\n    }\n\n    node = parent;\n    parent = parent.return;\n  }\n\n  if (node.tag === HostRoot) {\n    var root = node.stateNode;\n    return root;\n  } else {\n    return null;\n  }\n}\n\nvar UpdateState = 0;\nvar ReplaceState = 1;\nvar ForceUpdate = 2;\nvar CaptureUpdate = 3; // Global state that is reset at the beginning of calling `processUpdateQueue`.\n// It should only be read right after calling `processUpdateQueue`, via\n// `checkHasForceUpdateAfterProcessing`.\n\nvar hasForceUpdate = false;\nvar didWarnUpdateInsideUpdate;\nvar currentlyProcessingQueue;\n\n{\n  didWarnUpdateInsideUpdate = false;\n  currentlyProcessingQueue = null;\n}\n\nfunction initializeUpdateQueue(fiber) {\n  var queue = {\n    baseState: fiber.memoizedState,\n    firstBaseUpdate: null,\n    lastBaseUpdate: null,\n    shared: {\n      pending: null,\n      interleaved: null,\n      lanes: NoLanes\n    },\n    effects: null\n  };\n  fiber.updateQueue = queue;\n}\nfunction cloneUpdateQueue(current, workInProgress) {\n  // Clone the update queue from current. Unless it's already a clone.\n  var queue = workInProgress.updateQueue;\n  var currentQueue = current.updateQueue;\n\n  if (queue === currentQueue) {\n    var clone = {\n      baseState: currentQueue.baseState,\n      firstBaseUpdate: currentQueue.firstBaseUpdate,\n      lastBaseUpdate: currentQueue.lastBaseUpdate,\n      shared: currentQueue.shared,\n      effects: currentQueue.effects\n    };\n    workInProgress.updateQueue = clone;\n  }\n}\nfunction createUpdate(eventTime, lane) {\n  var update = {\n    eventTime: eventTime,\n    lane: lane,\n    tag: UpdateState,\n    payload: null,\n    callback: null,\n    next: null\n  };\n  return update;\n}\nfunction enqueueUpdate(fiber, update, lane) {\n  var updateQueue = fiber.updateQueue;\n\n  if (updateQueue === null) {\n    // Only occurs if the fiber has been unmounted.\n    return null;\n  }\n\n  var sharedQueue = updateQueue.shared;\n\n  {\n    if (currentlyProcessingQueue === sharedQueue && !didWarnUpdateInsideUpdate) {\n      error('An update (setState, replaceState, or forceUpdate) was scheduled ' + 'from inside an update function. Update functions should be pure, ' + 'with zero side-effects. Consider using componentDidUpdate or a ' + 'callback.');\n\n      didWarnUpdateInsideUpdate = true;\n    }\n  }\n\n  if (isUnsafeClassRenderPhaseUpdate()) {\n    // This is an unsafe render phase update. Add directly to the update\n    // queue so we can process it immediately during the current render.\n    var pending = sharedQueue.pending;\n\n    if (pending === null) {\n      // This is the first update. Create a circular list.\n      update.next = update;\n    } else {\n      update.next = pending.next;\n      pending.next = update;\n    }\n\n    sharedQueue.pending = update; // Update the childLanes even though we're most likely already rendering\n    // this fiber. This is for backwards compatibility in the case where you\n    // update a different component during render phase than the one that is\n    // currently renderings (a pattern that is accompanied by a warning).\n\n    return unsafe_markUpdateLaneFromFiberToRoot(fiber, lane);\n  } else {\n    return enqueueConcurrentClassUpdate(fiber, sharedQueue, update, lane);\n  }\n}\nfunction entangleTransitions(root, fiber, lane) {\n  var updateQueue = fiber.updateQueue;\n\n  if (updateQueue === null) {\n    // Only occurs if the fiber has been unmounted.\n    return;\n  }\n\n  var sharedQueue = updateQueue.shared;\n\n  if (isTransitionLane(lane)) {\n    var queueLanes = sharedQueue.lanes; // If any entangled lanes are no longer pending on the root, then they must\n    // have finished. We can remove them from the shared queue, which represents\n    // a superset of the actually pending lanes. In some cases we may entangle\n    // more than we need to, but that's OK. In fact it's worse if we *don't*\n    // entangle when we should.\n\n    queueLanes = intersectLanes(queueLanes, root.pendingLanes); // Entangle the new transition lane with the other transition lanes.\n\n    var newQueueLanes = mergeLanes(queueLanes, lane);\n    sharedQueue.lanes = newQueueLanes; // Even if queue.lanes already include lane, we don't know for certain if\n    // the lane finished since the last time we entangled it. So we need to\n    // entangle it again, just to be sure.\n\n    markRootEntangled(root, newQueueLanes);\n  }\n}\nfunction enqueueCapturedUpdate(workInProgress, capturedUpdate) {\n  // Captured updates are updates that are thrown by a child during the render\n  // phase. They should be discarded if the render is aborted. Therefore,\n  // we should only put them on the work-in-progress queue, not the current one.\n  var queue = workInProgress.updateQueue; // Check if the work-in-progress queue is a clone.\n\n  var current = workInProgress.alternate;\n\n  if (current !== null) {\n    var currentQueue = current.updateQueue;\n\n    if (queue === currentQueue) {\n      // The work-in-progress queue is the same as current. This happens when\n      // we bail out on a parent fiber that then captures an error thrown by\n      // a child. Since we want to append the update only to the work-in\n      // -progress queue, we need to clone the updates. We usually clone during\n      // processUpdateQueue, but that didn't happen in this case because we\n      // skipped over the parent when we bailed out.\n      var newFirst = null;\n      var newLast = null;\n      var firstBaseUpdate = queue.firstBaseUpdate;\n\n      if (firstBaseUpdate !== null) {\n        // Loop through the updates and clone them.\n        var update = firstBaseUpdate;\n\n        do {\n          var clone = {\n            eventTime: update.eventTime,\n            lane: update.lane,\n            tag: update.tag,\n            payload: update.payload,\n            callback: update.callback,\n            next: null\n          };\n\n          if (newLast === null) {\n            newFirst = newLast = clone;\n          } else {\n            newLast.next = clone;\n            newLast = clone;\n          }\n\n          update = update.next;\n        } while (update !== null); // Append the captured update the end of the cloned list.\n\n\n        if (newLast === null) {\n          newFirst = newLast = capturedUpdate;\n        } else {\n          newLast.next = capturedUpdate;\n          newLast = capturedUpdate;\n        }\n      } else {\n        // There are no base updates.\n        newFirst = newLast = capturedUpdate;\n      }\n\n      queue = {\n        baseState: currentQueue.baseState,\n        firstBaseUpdate: newFirst,\n        lastBaseUpdate: newLast,\n        shared: currentQueue.shared,\n        effects: currentQueue.effects\n      };\n      workInProgress.updateQueue = queue;\n      return;\n    }\n  } // Append the update to the end of the list.\n\n\n  var lastBaseUpdate = queue.lastBaseUpdate;\n\n  if (lastBaseUpdate === null) {\n    queue.firstBaseUpdate = capturedUpdate;\n  } else {\n    lastBaseUpdate.next = capturedUpdate;\n  }\n\n  queue.lastBaseUpdate = capturedUpdate;\n}\n\nfunction getStateFromUpdate(workInProgress, queue, update, prevState, nextProps, instance) {\n  switch (update.tag) {\n    case ReplaceState:\n      {\n        var payload = update.payload;\n\n        if (typeof payload === 'function') {\n          // Updater function\n          {\n            enterDisallowedContextReadInDEV();\n          }\n\n          var nextState = payload.call(instance, prevState, nextProps);\n\n          {\n            if ( workInProgress.mode & StrictLegacyMode) {\n              setIsStrictModeForDevtools(true);\n\n              try {\n                payload.call(instance, prevState, nextProps);\n              } finally {\n                setIsStrictModeForDevtools(false);\n              }\n            }\n\n            exitDisallowedContextReadInDEV();\n          }\n\n          return nextState;\n        } // State object\n\n\n        return payload;\n      }\n\n    case CaptureUpdate:\n      {\n        workInProgress.flags = workInProgress.flags & ~ShouldCapture | DidCapture;\n      }\n    // Intentional fallthrough\n\n    case UpdateState:\n      {\n        var _payload = update.payload;\n        var partialState;\n\n        if (typeof _payload === 'function') {\n          // Updater function\n          {\n            enterDisallowedContextReadInDEV();\n          }\n\n          partialState = _payload.call(instance, prevState, nextProps);\n\n          {\n            if ( workInProgress.mode & StrictLegacyMode) {\n              setIsStrictModeForDevtools(true);\n\n              try {\n                _payload.call(instance, prevState, nextProps);\n              } finally {\n                setIsStrictModeForDevtools(false);\n              }\n            }\n\n            exitDisallowedContextReadInDEV();\n          }\n        } else {\n          // Partial state object\n          partialState = _payload;\n        }\n\n        if (partialState === null || partialState === undefined) {\n          // Null and undefined are treated as no-ops.\n          return prevState;\n        } // Merge the partial state and the previous state.\n\n\n        return assign({}, prevState, partialState);\n      }\n\n    case ForceUpdate:\n      {\n        hasForceUpdate = true;\n        return prevState;\n      }\n  }\n\n  return prevState;\n}\n\nfunction processUpdateQueue(workInProgress, props, instance, renderLanes) {\n  // This is always non-null on a ClassComponent or HostRoot\n  var queue = workInProgress.updateQueue;\n  hasForceUpdate = false;\n\n  {\n    currentlyProcessingQueue = queue.shared;\n  }\n\n  var firstBaseUpdate = queue.firstBaseUpdate;\n  var lastBaseUpdate = queue.lastBaseUpdate; // Check if there are pending updates. If so, transfer them to the base queue.\n\n  var pendingQueue = queue.shared.pending;\n\n  if (pendingQueue !== null) {\n    queue.shared.pending = null; // The pending queue is circular. Disconnect the pointer between first\n    // and last so that it's non-circular.\n\n    var lastPendingUpdate = pendingQueue;\n    var firstPendingUpdate = lastPendingUpdate.next;\n    lastPendingUpdate.next = null; // Append pending updates to base queue\n\n    if (lastBaseUpdate === null) {\n      firstBaseUpdate = firstPendingUpdate;\n    } else {\n      lastBaseUpdate.next = firstPendingUpdate;\n    }\n\n    lastBaseUpdate = lastPendingUpdate; // If there's a current queue, and it's different from the base queue, then\n    // we need to transfer the updates to that queue, too. Because the base\n    // queue is a singly-linked list with no cycles, we can append to both\n    // lists and take advantage of structural sharing.\n    // TODO: Pass `current` as argument\n\n    var current = workInProgress.alternate;\n\n    if (current !== null) {\n      // This is always non-null on a ClassComponent or HostRoot\n      var currentQueue = current.updateQueue;\n      var currentLastBaseUpdate = currentQueue.lastBaseUpdate;\n\n      if (currentLastBaseUpdate !== lastBaseUpdate) {\n        if (currentLastBaseUpdate === null) {\n          currentQueue.firstBaseUpdate = firstPendingUpdate;\n        } else {\n          currentLastBaseUpdate.next = firstPendingUpdate;\n        }\n\n        currentQueue.lastBaseUpdate = lastPendingUpdate;\n      }\n    }\n  } // These values may change as we process the queue.\n\n\n  if (firstBaseUpdate !== null) {\n    // Iterate through the list of updates to compute the result.\n    var newState = queue.baseState; // TODO: Don't need to accumulate this. Instead, we can remove renderLanes\n    // from the original lanes.\n\n    var newLanes = NoLanes;\n    var newBaseState = null;\n    var newFirstBaseUpdate = null;\n    var newLastBaseUpdate = null;\n    var update = firstBaseUpdate;\n\n    do {\n      var updateLane = update.lane;\n      var updateEventTime = update.eventTime;\n\n      if (!isSubsetOfLanes(renderLanes, updateLane)) {\n        // Priority is insufficient. Skip this update. If this is the first\n        // skipped update, the previous update/state is the new base\n        // update/state.\n        var clone = {\n          eventTime: updateEventTime,\n          lane: updateLane,\n          tag: update.tag,\n          payload: update.payload,\n          callback: update.callback,\n          next: null\n        };\n\n        if (newLastBaseUpdate === null) {\n          newFirstBaseUpdate = newLastBaseUpdate = clone;\n          newBaseState = newState;\n        } else {\n          newLastBaseUpdate = newLastBaseUpdate.next = clone;\n        } // Update the remaining priority in the queue.\n\n\n        newLanes = mergeLanes(newLanes, updateLane);\n      } else {\n        // This update does have sufficient priority.\n        if (newLastBaseUpdate !== null) {\n          var _clone = {\n            eventTime: updateEventTime,\n            // This update is going to be committed so we never want uncommit\n            // it. Using NoLane works because 0 is a subset of all bitmasks, so\n            // this will never be skipped by the check above.\n            lane: NoLane,\n            tag: update.tag,\n            payload: update.payload,\n            callback: update.callback,\n            next: null\n          };\n          newLastBaseUpdate = newLastBaseUpdate.next = _clone;\n        } // Process this update.\n\n\n        newState = getStateFromUpdate(workInProgress, queue, update, newState, props, instance);\n        var callback = update.callback;\n\n        if (callback !== null && // If the update was already committed, we should not queue its\n        // callback again.\n        update.lane !== NoLane) {\n          workInProgress.flags |= Callback;\n          var effects = queue.effects;\n\n          if (effects === null) {\n            queue.effects = [update];\n          } else {\n            effects.push(update);\n          }\n        }\n      }\n\n      update = update.next;\n\n      if (update === null) {\n        pendingQueue = queue.shared.pending;\n\n        if (pendingQueue === null) {\n          break;\n        } else {\n          // An update was scheduled from inside a reducer. Add the new\n          // pending updates to the end of the list and keep processing.\n          var _lastPendingUpdate = pendingQueue; // Intentionally unsound. Pending updates form a circular list, but we\n          // unravel them when transferring them to the base queue.\n\n          var _firstPendingUpdate = _lastPendingUpdate.next;\n          _lastPendingUpdate.next = null;\n          update = _firstPendingUpdate;\n          queue.lastBaseUpdate = _lastPendingUpdate;\n          queue.shared.pending = null;\n        }\n      }\n    } while (true);\n\n    if (newLastBaseUpdate === null) {\n      newBaseState = newState;\n    }\n\n    queue.baseState = newBaseState;\n    queue.firstBaseUpdate = newFirstBaseUpdate;\n    queue.lastBaseUpdate = newLastBaseUpdate; // Interleaved updates are stored on a separate queue. We aren't going to\n    // process them during this render, but we do need to track which lanes\n    // are remaining.\n\n    var lastInterleaved = queue.shared.interleaved;\n\n    if (lastInterleaved !== null) {\n      var interleaved = lastInterleaved;\n\n      do {\n        newLanes = mergeLanes(newLanes, interleaved.lane);\n        interleaved = interleaved.next;\n      } while (interleaved !== lastInterleaved);\n    } else if (firstBaseUpdate === null) {\n      // `queue.lanes` is used for entangling transitions. We can set it back to\n      // zero once the queue is empty.\n      queue.shared.lanes = NoLanes;\n    } // Set the remaining expiration time to be whatever is remaining in the queue.\n    // This should be fine because the only two other things that contribute to\n    // expiration time are props and context. We're already in the middle of the\n    // begin phase by the time we start processing the queue, so we've already\n    // dealt with the props. Context in components that specify\n    // shouldComponentUpdate is tricky; but we'll have to account for\n    // that regardless.\n\n\n    markSkippedUpdateLanes(newLanes);\n    workInProgress.lanes = newLanes;\n    workInProgress.memoizedState = newState;\n  }\n\n  {\n    currentlyProcessingQueue = null;\n  }\n}\n\nfunction callCallback(callback, context) {\n  if (typeof callback !== 'function') {\n    throw new Error('Invalid argument passed as callback. Expected a function. Instead ' + (\"received: \" + callback));\n  }\n\n  callback.call(context);\n}\n\nfunction resetHasForceUpdateBeforeProcessing() {\n  hasForceUpdate = false;\n}\nfunction checkHasForceUpdateAfterProcessing() {\n  return hasForceUpdate;\n}\nfunction commitUpdateQueue(finishedWork, finishedQueue, instance) {\n  // Commit the effects\n  var effects = finishedQueue.effects;\n  finishedQueue.effects = null;\n\n  if (effects !== null) {\n    for (var i = 0; i < effects.length; i++) {\n      var effect = effects[i];\n      var callback = effect.callback;\n\n      if (callback !== null) {\n        effect.callback = null;\n        callCallback(callback, instance);\n      }\n    }\n  }\n}\n\nvar fakeInternalInstance = {}; // React.Component uses a shared frozen object by default.\n// We'll use it to determine whether we need to initialize legacy refs.\n\nvar emptyRefsObject = new React.Component().refs;\nvar didWarnAboutStateAssignmentForComponent;\nvar didWarnAboutUninitializedState;\nvar didWarnAboutGetSnapshotBeforeUpdateWithoutDidUpdate;\nvar didWarnAboutLegacyLifecyclesAndDerivedState;\nvar didWarnAboutUndefinedDerivedState;\nvar warnOnUndefinedDerivedState;\nvar warnOnInvalidCallback;\nvar didWarnAboutDirectlyAssigningPropsToState;\nvar didWarnAboutContextTypeAndContextTypes;\nvar didWarnAboutInvalidateContextType;\n\n{\n  didWarnAboutStateAssignmentForComponent = new Set();\n  didWarnAboutUninitializedState = new Set();\n  didWarnAboutGetSnapshotBeforeUpdateWithoutDidUpdate = new Set();\n  didWarnAboutLegacyLifecyclesAndDerivedState = new Set();\n  didWarnAboutDirectlyAssigningPropsToState = new Set();\n  didWarnAboutUndefinedDerivedState = new Set();\n  didWarnAboutContextTypeAndContextTypes = new Set();\n  didWarnAboutInvalidateContextType = new Set();\n  var didWarnOnInvalidCallback = new Set();\n\n  warnOnInvalidCallback = function (callback, callerName) {\n    if (callback === null || typeof callback === 'function') {\n      return;\n    }\n\n    var key = callerName + '_' + callback;\n\n    if (!didWarnOnInvalidCallback.has(key)) {\n      didWarnOnInvalidCallback.add(key);\n\n      error('%s(...): Expected the last optional `callback` argument to be a ' + 'function. Instead received: %s.', callerName, callback);\n    }\n  };\n\n  warnOnUndefinedDerivedState = function (type, partialState) {\n    if (partialState === undefined) {\n      var componentName = getComponentNameFromType(type) || 'Component';\n\n      if (!didWarnAboutUndefinedDerivedState.has(componentName)) {\n        didWarnAboutUndefinedDerivedState.add(componentName);\n\n        error('%s.getDerivedStateFromProps(): A valid state object (or null) must be returned. ' + 'You have returned undefined.', componentName);\n      }\n    }\n  }; // This is so gross but it's at least non-critical and can be removed if\n  // it causes problems. This is meant to give a nicer error message for\n  // ReactDOM15.unstable_renderSubtreeIntoContainer(reactDOM16Component,\n  // ...)) which otherwise throws a \"_processChildContext is not a function\"\n  // exception.\n\n\n  Object.defineProperty(fakeInternalInstance, '_processChildContext', {\n    enumerable: false,\n    value: function () {\n      throw new Error('_processChildContext is not available in React 16+. This likely ' + 'means you have multiple copies of React and are attempting to nest ' + 'a React 15 tree inside a React 16 tree using ' + \"unstable_renderSubtreeIntoContainer, which isn't supported. Try \" + 'to make sure you have only one copy of React (and ideally, switch ' + 'to ReactDOM.createPortal).');\n    }\n  });\n  Object.freeze(fakeInternalInstance);\n}\n\nfunction applyDerivedStateFromProps(workInProgress, ctor, getDerivedStateFromProps, nextProps) {\n  var prevState = workInProgress.memoizedState;\n  var partialState = getDerivedStateFromProps(nextProps, prevState);\n\n  {\n    if ( workInProgress.mode & StrictLegacyMode) {\n      setIsStrictModeForDevtools(true);\n\n      try {\n        // Invoke the function an extra time to help detect side-effects.\n        partialState = getDerivedStateFromProps(nextProps, prevState);\n      } finally {\n        setIsStrictModeForDevtools(false);\n      }\n    }\n\n    warnOnUndefinedDerivedState(ctor, partialState);\n  } // Merge the partial state and the previous state.\n\n\n  var memoizedState = partialState === null || partialState === undefined ? prevState : assign({}, prevState, partialState);\n  workInProgress.memoizedState = memoizedState; // Once the update queue is empty, persist the derived state onto the\n  // base state.\n\n  if (workInProgress.lanes === NoLanes) {\n    // Queue is always non-null for classes\n    var updateQueue = workInProgress.updateQueue;\n    updateQueue.baseState = memoizedState;\n  }\n}\n\nvar classComponentUpdater = {\n  isMounted: isMounted,\n  enqueueSetState: function (inst, payload, callback) {\n    var fiber = get(inst);\n    var eventTime = requestEventTime();\n    var lane = requestUpdateLane(fiber);\n    var update = createUpdate(eventTime, lane);\n    update.payload = payload;\n\n    if (callback !== undefined && callback !== null) {\n      {\n        warnOnInvalidCallback(callback, 'setState');\n      }\n\n      update.callback = callback;\n    }\n\n    var root = enqueueUpdate(fiber, update, lane);\n\n    if (root !== null) {\n      scheduleUpdateOnFiber(root, fiber, lane, eventTime);\n      entangleTransitions(root, fiber, lane);\n    }\n\n    {\n      markStateUpdateScheduled(fiber, lane);\n    }\n  },\n  enqueueReplaceState: function (inst, payload, callback) {\n    var fiber = get(inst);\n    var eventTime = requestEventTime();\n    var lane = requestUpdateLane(fiber);\n    var update = createUpdate(eventTime, lane);\n    update.tag = ReplaceState;\n    update.payload = payload;\n\n    if (callback !== undefined && callback !== null) {\n      {\n        warnOnInvalidCallback(callback, 'replaceState');\n      }\n\n      update.callback = callback;\n    }\n\n    var root = enqueueUpdate(fiber, update, lane);\n\n    if (root !== null) {\n      scheduleUpdateOnFiber(root, fiber, lane, eventTime);\n      entangleTransitions(root, fiber, lane);\n    }\n\n    {\n      markStateUpdateScheduled(fiber, lane);\n    }\n  },\n  enqueueForceUpdate: function (inst, callback) {\n    var fiber = get(inst);\n    var eventTime = requestEventTime();\n    var lane = requestUpdateLane(fiber);\n    var update = createUpdate(eventTime, lane);\n    update.tag = ForceUpdate;\n\n    if (callback !== undefined && callback !== null) {\n      {\n        warnOnInvalidCallback(callback, 'forceUpdate');\n      }\n\n      update.callback = callback;\n    }\n\n    var root = enqueueUpdate(fiber, update, lane);\n\n    if (root !== null) {\n      scheduleUpdateOnFiber(root, fiber, lane, eventTime);\n      entangleTransitions(root, fiber, lane);\n    }\n\n    {\n      markForceUpdateScheduled(fiber, lane);\n    }\n  }\n};\n\nfunction checkShouldComponentUpdate(workInProgress, ctor, oldProps, newProps, oldState, newState, nextContext) {\n  var instance = workInProgress.stateNode;\n\n  if (typeof instance.shouldComponentUpdate === 'function') {\n    var shouldUpdate = instance.shouldComponentUpdate(newProps, newState, nextContext);\n\n    {\n      if ( workInProgress.mode & StrictLegacyMode) {\n        setIsStrictModeForDevtools(true);\n\n        try {\n          // Invoke the function an extra time to help detect side-effects.\n          shouldUpdate = instance.shouldComponentUpdate(newProps, newState, nextContext);\n        } finally {\n          setIsStrictModeForDevtools(false);\n        }\n      }\n\n      if (shouldUpdate === undefined) {\n        error('%s.shouldComponentUpdate(): Returned undefined instead of a ' + 'boolean value. Make sure to return true or false.', getComponentNameFromType(ctor) || 'Component');\n      }\n    }\n\n    return shouldUpdate;\n  }\n\n  if (ctor.prototype && ctor.prototype.isPureReactComponent) {\n    return !shallowEqual(oldProps, newProps) || !shallowEqual(oldState, newState);\n  }\n\n  return true;\n}\n\nfunction checkClassInstance(workInProgress, ctor, newProps) {\n  var instance = workInProgress.stateNode;\n\n  {\n    var name = getComponentNameFromType(ctor) || 'Component';\n    var renderPresent = instance.render;\n\n    if (!renderPresent) {\n      if (ctor.prototype && typeof ctor.prototype.render === 'function') {\n        error('%s(...): No `render` method found on the returned component ' + 'instance: did you accidentally return an object from the constructor?', name);\n      } else {\n        error('%s(...): No `render` method found on the returned component ' + 'instance: you may have forgotten to define `render`.', name);\n      }\n    }\n\n    if (instance.getInitialState && !instance.getInitialState.isReactClassApproved && !instance.state) {\n      error('getInitialState was defined on %s, a plain JavaScript class. ' + 'This is only supported for classes created using React.createClass. ' + 'Did you mean to define a state property instead?', name);\n    }\n\n    if (instance.getDefaultProps && !instance.getDefaultProps.isReactClassApproved) {\n      error('getDefaultProps was defined on %s, a plain JavaScript class. ' + 'This is only supported for classes created using React.createClass. ' + 'Use a static property to define defaultProps instead.', name);\n    }\n\n    if (instance.propTypes) {\n      error('propTypes was defined as an instance property on %s. Use a static ' + 'property to define propTypes instead.', name);\n    }\n\n    if (instance.contextType) {\n      error('contextType was defined as an instance property on %s. Use a static ' + 'property to define contextType instead.', name);\n    }\n\n    {\n      if (instance.contextTypes) {\n        error('contextTypes was defined as an instance property on %s. Use a static ' + 'property to define contextTypes instead.', name);\n      }\n\n      if (ctor.contextType && ctor.contextTypes && !didWarnAboutContextTypeAndContextTypes.has(ctor)) {\n        didWarnAboutContextTypeAndContextTypes.add(ctor);\n\n        error('%s declares both contextTypes and contextType static properties. ' + 'The legacy contextTypes property will be ignored.', name);\n      }\n    }\n\n    if (typeof instance.componentShouldUpdate === 'function') {\n      error('%s has a method called ' + 'componentShouldUpdate(). Did you mean shouldComponentUpdate()? ' + 'The name is phrased as a question because the function is ' + 'expected to return a value.', name);\n    }\n\n    if (ctor.prototype && ctor.prototype.isPureReactComponent && typeof instance.shouldComponentUpdate !== 'undefined') {\n      error('%s has a method called shouldComponentUpdate(). ' + 'shouldComponentUpdate should not be used when extending React.PureComponent. ' + 'Please extend React.Component if shouldComponentUpdate is used.', getComponentNameFromType(ctor) || 'A pure component');\n    }\n\n    if (typeof instance.componentDidUnmount === 'function') {\n      error('%s has a method called ' + 'componentDidUnmount(). But there is no such lifecycle method. ' + 'Did you mean componentWillUnmount()?', name);\n    }\n\n    if (typeof instance.componentDidReceiveProps === 'function') {\n      error('%s has a method called ' + 'componentDidReceiveProps(). But there is no such lifecycle method. ' + 'If you meant to update the state in response to changing props, ' + 'use componentWillReceiveProps(). If you meant to fetch data or ' + 'run side-effects or mutations after React has updated the UI, use componentDidUpdate().', name);\n    }\n\n    if (typeof instance.componentWillRecieveProps === 'function') {\n      error('%s has a method called ' + 'componentWillRecieveProps(). Did you mean componentWillReceiveProps()?', name);\n    }\n\n    if (typeof instance.UNSAFE_componentWillRecieveProps === 'function') {\n      error('%s has a method called ' + 'UNSAFE_componentWillRecieveProps(). Did you mean UNSAFE_componentWillReceiveProps()?', name);\n    }\n\n    var hasMutatedProps = instance.props !== newProps;\n\n    if (instance.props !== undefined && hasMutatedProps) {\n      error('%s(...): When calling super() in `%s`, make sure to pass ' + \"up the same props that your component's constructor was passed.\", name, name);\n    }\n\n    if (instance.defaultProps) {\n      error('Setting defaultProps as an instance property on %s is not supported and will be ignored.' + ' Instead, define defaultProps as a static property on %s.', name, name);\n    }\n\n    if (typeof instance.getSnapshotBeforeUpdate === 'function' && typeof instance.componentDidUpdate !== 'function' && !didWarnAboutGetSnapshotBeforeUpdateWithoutDidUpdate.has(ctor)) {\n      didWarnAboutGetSnapshotBeforeUpdateWithoutDidUpdate.add(ctor);\n\n      error('%s: getSnapshotBeforeUpdate() should be used with componentDidUpdate(). ' + 'This component defines getSnapshotBeforeUpdate() only.', getComponentNameFromType(ctor));\n    }\n\n    if (typeof instance.getDerivedStateFromProps === 'function') {\n      error('%s: getDerivedStateFromProps() is defined as an instance method ' + 'and will be ignored. Instead, declare it as a static method.', name);\n    }\n\n    if (typeof instance.getDerivedStateFromError === 'function') {\n      error('%s: getDerivedStateFromError() is defined as an instance method ' + 'and will be ignored. Instead, declare it as a static method.', name);\n    }\n\n    if (typeof ctor.getSnapshotBeforeUpdate === 'function') {\n      error('%s: getSnapshotBeforeUpdate() is defined as a static method ' + 'and will be ignored. Instead, declare it as an instance method.', name);\n    }\n\n    var _state = instance.state;\n\n    if (_state && (typeof _state !== 'object' || isArray(_state))) {\n      error('%s.state: must be set to an object or null', name);\n    }\n\n    if (typeof instance.getChildContext === 'function' && typeof ctor.childContextTypes !== 'object') {\n      error('%s.getChildContext(): childContextTypes must be defined in order to ' + 'use getChildContext().', name);\n    }\n  }\n}\n\nfunction adoptClassInstance(workInProgress, instance) {\n  instance.updater = classComponentUpdater;\n  workInProgress.stateNode = instance; // The instance needs access to the fiber so that it can schedule updates\n\n  set(instance, workInProgress);\n\n  {\n    instance._reactInternalInstance = fakeInternalInstance;\n  }\n}\n\nfunction constructClassInstance(workInProgress, ctor, props) {\n  var isLegacyContextConsumer = false;\n  var unmaskedContext = emptyContextObject;\n  var context = emptyContextObject;\n  var contextType = ctor.contextType;\n\n  {\n    if ('contextType' in ctor) {\n      var isValid = // Allow null for conditional declaration\n      contextType === null || contextType !== undefined && contextType.$$typeof === REACT_CONTEXT_TYPE && contextType._context === undefined; // Not a <Context.Consumer>\n\n      if (!isValid && !didWarnAboutInvalidateContextType.has(ctor)) {\n        didWarnAboutInvalidateContextType.add(ctor);\n        var addendum = '';\n\n        if (contextType === undefined) {\n          addendum = ' However, it is set to undefined. ' + 'This can be caused by a typo or by mixing up named and default imports. ' + 'This can also happen due to a circular dependency, so ' + 'try moving the createContext() call to a separate file.';\n        } else if (typeof contextType !== 'object') {\n          addendum = ' However, it is set to a ' + typeof contextType + '.';\n        } else if (contextType.$$typeof === REACT_PROVIDER_TYPE) {\n          addendum = ' Did you accidentally pass the Context.Provider instead?';\n        } else if (contextType._context !== undefined) {\n          // <Context.Consumer>\n          addendum = ' Did you accidentally pass the Context.Consumer instead?';\n        } else {\n          addendum = ' However, it is set to an object with keys {' + Object.keys(contextType).join(', ') + '}.';\n        }\n\n        error('%s defines an invalid contextType. ' + 'contextType should point to the Context object returned by React.createContext().%s', getComponentNameFromType(ctor) || 'Component', addendum);\n      }\n    }\n  }\n\n  if (typeof contextType === 'object' && contextType !== null) {\n    context = readContext(contextType);\n  } else {\n    unmaskedContext = getUnmaskedContext(workInProgress, ctor, true);\n    var contextTypes = ctor.contextTypes;\n    isLegacyContextConsumer = contextTypes !== null && contextTypes !== undefined;\n    context = isLegacyContextConsumer ? getMaskedContext(workInProgress, unmaskedContext) : emptyContextObject;\n  }\n\n  var instance = new ctor(props, context); // Instantiate twice to help detect side-effects.\n\n  {\n    if ( workInProgress.mode & StrictLegacyMode) {\n      setIsStrictModeForDevtools(true);\n\n      try {\n        instance = new ctor(props, context); // eslint-disable-line no-new\n      } finally {\n        setIsStrictModeForDevtools(false);\n      }\n    }\n  }\n\n  var state = workInProgress.memoizedState = instance.state !== null && instance.state !== undefined ? instance.state : null;\n  adoptClassInstance(workInProgress, instance);\n\n  {\n    if (typeof ctor.getDerivedStateFromProps === 'function' && state === null) {\n      var componentName = getComponentNameFromType(ctor) || 'Component';\n\n      if (!didWarnAboutUninitializedState.has(componentName)) {\n        didWarnAboutUninitializedState.add(componentName);\n\n        error('`%s` uses `getDerivedStateFromProps` but its initial state is ' + '%s. This is not recommended. Instead, define the initial state by ' + 'assigning an object to `this.state` in the constructor of `%s`. ' + 'This ensures that `getDerivedStateFromProps` arguments have a consistent shape.', componentName, instance.state === null ? 'null' : 'undefined', componentName);\n      }\n    } // If new component APIs are defined, \"unsafe\" lifecycles won't be called.\n    // Warn about these lifecycles if they are present.\n    // Don't warn about react-lifecycles-compat polyfilled methods though.\n\n\n    if (typeof ctor.getDerivedStateFromProps === 'function' || typeof instance.getSnapshotBeforeUpdate === 'function') {\n      var foundWillMountName = null;\n      var foundWillReceivePropsName = null;\n      var foundWillUpdateName = null;\n\n      if (typeof instance.componentWillMount === 'function' && instance.componentWillMount.__suppressDeprecationWarning !== true) {\n        foundWillMountName = 'componentWillMount';\n      } else if (typeof instance.UNSAFE_componentWillMount === 'function') {\n        foundWillMountName = 'UNSAFE_componentWillMount';\n      }\n\n      if (typeof instance.componentWillReceiveProps === 'function' && instance.componentWillReceiveProps.__suppressDeprecationWarning !== true) {\n        foundWillReceivePropsName = 'componentWillReceiveProps';\n      } else if (typeof instance.UNSAFE_componentWillReceiveProps === 'function') {\n        foundWillReceivePropsName = 'UNSAFE_componentWillReceiveProps';\n      }\n\n      if (typeof instance.componentWillUpdate === 'function' && instance.componentWillUpdate.__suppressDeprecationWarning !== true) {\n        foundWillUpdateName = 'componentWillUpdate';\n      } else if (typeof instance.UNSAFE_componentWillUpdate === 'function') {\n        foundWillUpdateName = 'UNSAFE_componentWillUpdate';\n      }\n\n      if (foundWillMountName !== null || foundWillReceivePropsName !== null || foundWillUpdateName !== null) {\n        var _componentName = getComponentNameFromType(ctor) || 'Component';\n\n        var newApiName = typeof ctor.getDerivedStateFromProps === 'function' ? 'getDerivedStateFromProps()' : 'getSnapshotBeforeUpdate()';\n\n        if (!didWarnAboutLegacyLifecyclesAndDerivedState.has(_componentName)) {\n          didWarnAboutLegacyLifecyclesAndDerivedState.add(_componentName);\n\n          error('Unsafe legacy lifecycles will not be called for components using new component APIs.\\n\\n' + '%s uses %s but also contains the following legacy lifecycles:%s%s%s\\n\\n' + 'The above lifecycles should be removed. Learn more about this warning here:\\n' + 'https://reactjs.org/link/unsafe-component-lifecycles', _componentName, newApiName, foundWillMountName !== null ? \"\\n  \" + foundWillMountName : '', foundWillReceivePropsName !== null ? \"\\n  \" + foundWillReceivePropsName : '', foundWillUpdateName !== null ? \"\\n  \" + foundWillUpdateName : '');\n        }\n      }\n    }\n  } // Cache unmasked context so we can avoid recreating masked context unless necessary.\n  // ReactFiberContext usually updates this cache but can't for newly-created instances.\n\n\n  if (isLegacyContextConsumer) {\n    cacheContext(workInProgress, unmaskedContext, context);\n  }\n\n  return instance;\n}\n\nfunction callComponentWillMount(workInProgress, instance) {\n  var oldState = instance.state;\n\n  if (typeof instance.componentWillMount === 'function') {\n    instance.componentWillMount();\n  }\n\n  if (typeof instance.UNSAFE_componentWillMount === 'function') {\n    instance.UNSAFE_componentWillMount();\n  }\n\n  if (oldState !== instance.state) {\n    {\n      error('%s.componentWillMount(): Assigning directly to this.state is ' + \"deprecated (except inside a component's \" + 'constructor). Use setState instead.', getComponentNameFromFiber(workInProgress) || 'Component');\n    }\n\n    classComponentUpdater.enqueueReplaceState(instance, instance.state, null);\n  }\n}\n\nfunction callComponentWillReceiveProps(workInProgress, instance, newProps, nextContext) {\n  var oldState = instance.state;\n\n  if (typeof instance.componentWillReceiveProps === 'function') {\n    instance.componentWillReceiveProps(newProps, nextContext);\n  }\n\n  if (typeof instance.UNSAFE_componentWillReceiveProps === 'function') {\n    instance.UNSAFE_componentWillReceiveProps(newProps, nextContext);\n  }\n\n  if (instance.state !== oldState) {\n    {\n      var componentName = getComponentNameFromFiber(workInProgress) || 'Component';\n\n      if (!didWarnAboutStateAssignmentForComponent.has(componentName)) {\n        didWarnAboutStateAssignmentForComponent.add(componentName);\n\n        error('%s.componentWillReceiveProps(): Assigning directly to ' + \"this.state is deprecated (except inside a component's \" + 'constructor). Use setState instead.', componentName);\n      }\n    }\n\n    classComponentUpdater.enqueueReplaceState(instance, instance.state, null);\n  }\n} // Invokes the mount life-cycles on a previously never rendered instance.\n\n\nfunction mountClassInstance(workInProgress, ctor, newProps, renderLanes) {\n  {\n    checkClassInstance(workInProgress, ctor, newProps);\n  }\n\n  var instance = workInProgress.stateNode;\n  instance.props = newProps;\n  instance.state = workInProgress.memoizedState;\n  instance.refs = emptyRefsObject;\n  initializeUpdateQueue(workInProgress);\n  var contextType = ctor.contextType;\n\n  if (typeof contextType === 'object' && contextType !== null) {\n    instance.context = readContext(contextType);\n  } else {\n    var unmaskedContext = getUnmaskedContext(workInProgress, ctor, true);\n    instance.context = getMaskedContext(workInProgress, unmaskedContext);\n  }\n\n  {\n    if (instance.state === newProps) {\n      var componentName = getComponentNameFromType(ctor) || 'Component';\n\n      if (!didWarnAboutDirectlyAssigningPropsToState.has(componentName)) {\n        didWarnAboutDirectlyAssigningPropsToState.add(componentName);\n\n        error('%s: It is not recommended to assign props directly to state ' + \"because updates to props won't be reflected in state. \" + 'In most cases, it is better to use props directly.', componentName);\n      }\n    }\n\n    if (workInProgress.mode & StrictLegacyMode) {\n      ReactStrictModeWarnings.recordLegacyContextWarning(workInProgress, instance);\n    }\n\n    {\n      ReactStrictModeWarnings.recordUnsafeLifecycleWarnings(workInProgress, instance);\n    }\n  }\n\n  instance.state = workInProgress.memoizedState;\n  var getDerivedStateFromProps = ctor.getDerivedStateFromProps;\n\n  if (typeof getDerivedStateFromProps === 'function') {\n    applyDerivedStateFromProps(workInProgress, ctor, getDerivedStateFromProps, newProps);\n    instance.state = workInProgress.memoizedState;\n  } // In order to support react-lifecycles-compat polyfilled components,\n  // Unsafe lifecycles should not be invoked for components using the new APIs.\n\n\n  if (typeof ctor.getDerivedStateFromProps !== 'function' && typeof instance.getSnapshotBeforeUpdate !== 'function' && (typeof instance.UNSAFE_componentWillMount === 'function' || typeof instance.componentWillMount === 'function')) {\n    callComponentWillMount(workInProgress, instance); // If we had additional state updates during this life-cycle, let's\n    // process them now.\n\n    processUpdateQueue(workInProgress, newProps, instance, renderLanes);\n    instance.state = workInProgress.memoizedState;\n  }\n\n  if (typeof instance.componentDidMount === 'function') {\n    var fiberFlags = Update;\n\n    {\n      fiberFlags |= LayoutStatic;\n    }\n\n    if ( (workInProgress.mode & StrictEffectsMode) !== NoMode) {\n      fiberFlags |= MountLayoutDev;\n    }\n\n    workInProgress.flags |= fiberFlags;\n  }\n}\n\nfunction resumeMountClassInstance(workInProgress, ctor, newProps, renderLanes) {\n  var instance = workInProgress.stateNode;\n  var oldProps = workInProgress.memoizedProps;\n  instance.props = oldProps;\n  var oldContext = instance.context;\n  var contextType = ctor.contextType;\n  var nextContext = emptyContextObject;\n\n  if (typeof contextType === 'object' && contextType !== null) {\n    nextContext = readContext(contextType);\n  } else {\n    var nextLegacyUnmaskedContext = getUnmaskedContext(workInProgress, ctor, true);\n    nextContext = getMaskedContext(workInProgress, nextLegacyUnmaskedContext);\n  }\n\n  var getDerivedStateFromProps = ctor.getDerivedStateFromProps;\n  var hasNewLifecycles = typeof getDerivedStateFromProps === 'function' || typeof instance.getSnapshotBeforeUpdate === 'function'; // Note: During these life-cycles, instance.props/instance.state are what\n  // ever the previously attempted to render - not the \"current\". However,\n  // during componentDidUpdate we pass the \"current\" props.\n  // In order to support react-lifecycles-compat polyfilled components,\n  // Unsafe lifecycles should not be invoked for components using the new APIs.\n\n  if (!hasNewLifecycles && (typeof instance.UNSAFE_componentWillReceiveProps === 'function' || typeof instance.componentWillReceiveProps === 'function')) {\n    if (oldProps !== newProps || oldContext !== nextContext) {\n      callComponentWillReceiveProps(workInProgress, instance, newProps, nextContext);\n    }\n  }\n\n  resetHasForceUpdateBeforeProcessing();\n  var oldState = workInProgress.memoizedState;\n  var newState = instance.state = oldState;\n  processUpdateQueue(workInProgress, newProps, instance, renderLanes);\n  newState = workInProgress.memoizedState;\n\n  if (oldProps === newProps && oldState === newState && !hasContextChanged() && !checkHasForceUpdateAfterProcessing()) {\n    // If an update was already in progress, we should schedule an Update\n    // effect even though we're bailing out, so that cWU/cDU are called.\n    if (typeof instance.componentDidMount === 'function') {\n      var fiberFlags = Update;\n\n      {\n        fiberFlags |= LayoutStatic;\n      }\n\n      if ( (workInProgress.mode & StrictEffectsMode) !== NoMode) {\n        fiberFlags |= MountLayoutDev;\n      }\n\n      workInProgress.flags |= fiberFlags;\n    }\n\n    return false;\n  }\n\n  if (typeof getDerivedStateFromProps === 'function') {\n    applyDerivedStateFromProps(workInProgress, ctor, getDerivedStateFromProps, newProps);\n    newState = workInProgress.memoizedState;\n  }\n\n  var shouldUpdate = checkHasForceUpdateAfterProcessing() || checkShouldComponentUpdate(workInProgress, ctor, oldProps, newProps, oldState, newState, nextContext);\n\n  if (shouldUpdate) {\n    // In order to support react-lifecycles-compat polyfilled components,\n    // Unsafe lifecycles should not be invoked for components using the new APIs.\n    if (!hasNewLifecycles && (typeof instance.UNSAFE_componentWillMount === 'function' || typeof instance.componentWillMount === 'function')) {\n      if (typeof instance.componentWillMount === 'function') {\n        instance.componentWillMount();\n      }\n\n      if (typeof instance.UNSAFE_componentWillMount === 'function') {\n        instance.UNSAFE_componentWillMount();\n      }\n    }\n\n    if (typeof instance.componentDidMount === 'function') {\n      var _fiberFlags = Update;\n\n      {\n        _fiberFlags |= LayoutStatic;\n      }\n\n      if ( (workInProgress.mode & StrictEffectsMode) !== NoMode) {\n        _fiberFlags |= MountLayoutDev;\n      }\n\n      workInProgress.flags |= _fiberFlags;\n    }\n  } else {\n    // If an update was already in progress, we should schedule an Update\n    // effect even though we're bailing out, so that cWU/cDU are called.\n    if (typeof instance.componentDidMount === 'function') {\n      var _fiberFlags2 = Update;\n\n      {\n        _fiberFlags2 |= LayoutStatic;\n      }\n\n      if ( (workInProgress.mode & StrictEffectsMode) !== NoMode) {\n        _fiberFlags2 |= MountLayoutDev;\n      }\n\n      workInProgress.flags |= _fiberFlags2;\n    } // If shouldComponentUpdate returned false, we should still update the\n    // memoized state to indicate that this work can be reused.\n\n\n    workInProgress.memoizedProps = newProps;\n    workInProgress.memoizedState = newState;\n  } // Update the existing instance's state, props, and context pointers even\n  // if shouldComponentUpdate returns false.\n\n\n  instance.props = newProps;\n  instance.state = newState;\n  instance.context = nextContext;\n  return shouldUpdate;\n} // Invokes the update life-cycles and returns false if it shouldn't rerender.\n\n\nfunction updateClassInstance(current, workInProgress, ctor, newProps, renderLanes) {\n  var instance = workInProgress.stateNode;\n  cloneUpdateQueue(current, workInProgress);\n  var unresolvedOldProps = workInProgress.memoizedProps;\n  var oldProps = workInProgress.type === workInProgress.elementType ? unresolvedOldProps : resolveDefaultProps(workInProgress.type, unresolvedOldProps);\n  instance.props = oldProps;\n  var unresolvedNewProps = workInProgress.pendingProps;\n  var oldContext = instance.context;\n  var contextType = ctor.contextType;\n  var nextContext = emptyContextObject;\n\n  if (typeof contextType === 'object' && contextType !== null) {\n    nextContext = readContext(contextType);\n  } else {\n    var nextUnmaskedContext = getUnmaskedContext(workInProgress, ctor, true);\n    nextContext = getMaskedContext(workInProgress, nextUnmaskedContext);\n  }\n\n  var getDerivedStateFromProps = ctor.getDerivedStateFromProps;\n  var hasNewLifecycles = typeof getDerivedStateFromProps === 'function' || typeof instance.getSnapshotBeforeUpdate === 'function'; // Note: During these life-cycles, instance.props/instance.state are what\n  // ever the previously attempted to render - not the \"current\". However,\n  // during componentDidUpdate we pass the \"current\" props.\n  // In order to support react-lifecycles-compat polyfilled components,\n  // Unsafe lifecycles should not be invoked for components using the new APIs.\n\n  if (!hasNewLifecycles && (typeof instance.UNSAFE_componentWillReceiveProps === 'function' || typeof instance.componentWillReceiveProps === 'function')) {\n    if (unresolvedOldProps !== unresolvedNewProps || oldContext !== nextContext) {\n      callComponentWillReceiveProps(workInProgress, instance, newProps, nextContext);\n    }\n  }\n\n  resetHasForceUpdateBeforeProcessing();\n  var oldState = workInProgress.memoizedState;\n  var newState = instance.state = oldState;\n  processUpdateQueue(workInProgress, newProps, instance, renderLanes);\n  newState = workInProgress.memoizedState;\n\n  if (unresolvedOldProps === unresolvedNewProps && oldState === newState && !hasContextChanged() && !checkHasForceUpdateAfterProcessing() && !(enableLazyContextPropagation   )) {\n    // If an update was already in progress, we should schedule an Update\n    // effect even though we're bailing out, so that cWU/cDU are called.\n    if (typeof instance.componentDidUpdate === 'function') {\n      if (unresolvedOldProps !== current.memoizedProps || oldState !== current.memoizedState) {\n        workInProgress.flags |= Update;\n      }\n    }\n\n    if (typeof instance.getSnapshotBeforeUpdate === 'function') {\n      if (unresolvedOldProps !== current.memoizedProps || oldState !== current.memoizedState) {\n        workInProgress.flags |= Snapshot;\n      }\n    }\n\n    return false;\n  }\n\n  if (typeof getDerivedStateFromProps === 'function') {\n    applyDerivedStateFromProps(workInProgress, ctor, getDerivedStateFromProps, newProps);\n    newState = workInProgress.memoizedState;\n  }\n\n  var shouldUpdate = checkHasForceUpdateAfterProcessing() || checkShouldComponentUpdate(workInProgress, ctor, oldProps, newProps, oldState, newState, nextContext) || // TODO: In some cases, we'll end up checking if context has changed twice,\n  // both before and after `shouldComponentUpdate` has been called. Not ideal,\n  // but I'm loath to refactor this function. This only happens for memoized\n  // components so it's not that common.\n  enableLazyContextPropagation   ;\n\n  if (shouldUpdate) {\n    // In order to support react-lifecycles-compat polyfilled components,\n    // Unsafe lifecycles should not be invoked for components using the new APIs.\n    if (!hasNewLifecycles && (typeof instance.UNSAFE_componentWillUpdate === 'function' || typeof instance.componentWillUpdate === 'function')) {\n      if (typeof instance.componentWillUpdate === 'function') {\n        instance.componentWillUpdate(newProps, newState, nextContext);\n      }\n\n      if (typeof instance.UNSAFE_componentWillUpdate === 'function') {\n        instance.UNSAFE_componentWillUpdate(newProps, newState, nextContext);\n      }\n    }\n\n    if (typeof instance.componentDidUpdate === 'function') {\n      workInProgress.flags |= Update;\n    }\n\n    if (typeof instance.getSnapshotBeforeUpdate === 'function') {\n      workInProgress.flags |= Snapshot;\n    }\n  } else {\n    // If an update was already in progress, we should schedule an Update\n    // effect even though we're bailing out, so that cWU/cDU are called.\n    if (typeof instance.componentDidUpdate === 'function') {\n      if (unresolvedOldProps !== current.memoizedProps || oldState !== current.memoizedState) {\n        workInProgress.flags |= Update;\n      }\n    }\n\n    if (typeof instance.getSnapshotBeforeUpdate === 'function') {\n      if (unresolvedOldProps !== current.memoizedProps || oldState !== current.memoizedState) {\n        workInProgress.flags |= Snapshot;\n      }\n    } // If shouldComponentUpdate returned false, we should still update the\n    // memoized props/state to indicate that this work can be reused.\n\n\n    workInProgress.memoizedProps = newProps;\n    workInProgress.memoizedState = newState;\n  } // Update the existing instance's state, props, and context pointers even\n  // if shouldComponentUpdate returns false.\n\n\n  instance.props = newProps;\n  instance.state = newState;\n  instance.context = nextContext;\n  return shouldUpdate;\n}\n\nvar didWarnAboutMaps;\nvar didWarnAboutGenerators;\nvar didWarnAboutStringRefs;\nvar ownerHasKeyUseWarning;\nvar ownerHasFunctionTypeWarning;\n\nvar warnForMissingKey = function (child, returnFiber) {};\n\n{\n  didWarnAboutMaps = false;\n  didWarnAboutGenerators = false;\n  didWarnAboutStringRefs = {};\n  /**\n   * Warn if there's no key explicitly set on dynamic arrays of children or\n   * object keys are not valid. This allows us to keep track of children between\n   * updates.\n   */\n\n  ownerHasKeyUseWarning = {};\n  ownerHasFunctionTypeWarning = {};\n\n  warnForMissingKey = function (child, returnFiber) {\n    if (child === null || typeof child !== 'object') {\n      return;\n    }\n\n    if (!child._store || child._store.validated || child.key != null) {\n      return;\n    }\n\n    if (typeof child._store !== 'object') {\n      throw new Error('React Component in warnForMissingKey should have a _store. ' + 'This error is likely caused by a bug in React. Please file an issue.');\n    }\n\n    child._store.validated = true;\n    var componentName = getComponentNameFromFiber(returnFiber) || 'Component';\n\n    if (ownerHasKeyUseWarning[componentName]) {\n      return;\n    }\n\n    ownerHasKeyUseWarning[componentName] = true;\n\n    error('Each child in a list should have a unique ' + '\"key\" prop. See https://reactjs.org/link/warning-keys for ' + 'more information.');\n  };\n}\n\nfunction coerceRef(returnFiber, current, element) {\n  var mixedRef = element.ref;\n\n  if (mixedRef !== null && typeof mixedRef !== 'function' && typeof mixedRef !== 'object') {\n    {\n      // TODO: Clean this up once we turn on the string ref warning for\n      // everyone, because the strict mode case will no longer be relevant\n      if ((returnFiber.mode & StrictLegacyMode || warnAboutStringRefs) && // We warn in ReactElement.js if owner and self are equal for string refs\n      // because these cannot be automatically converted to an arrow function\n      // using a codemod. Therefore, we don't have to warn about string refs again.\n      !(element._owner && element._self && element._owner.stateNode !== element._self)) {\n        var componentName = getComponentNameFromFiber(returnFiber) || 'Component';\n\n        if (!didWarnAboutStringRefs[componentName]) {\n          {\n            error('A string ref, \"%s\", has been found within a strict mode tree. ' + 'String refs are a source of potential bugs and should be avoided. ' + 'We recommend using useRef() or createRef() instead. ' + 'Learn more about using refs safely here: ' + 'https://reactjs.org/link/strict-mode-string-ref', mixedRef);\n          }\n\n          didWarnAboutStringRefs[componentName] = true;\n        }\n      }\n    }\n\n    if (element._owner) {\n      var owner = element._owner;\n      var inst;\n\n      if (owner) {\n        var ownerFiber = owner;\n\n        if (ownerFiber.tag !== ClassComponent) {\n          throw new Error('Function components cannot have string refs. ' + 'We recommend using useRef() instead. ' + 'Learn more about using refs safely here: ' + 'https://reactjs.org/link/strict-mode-string-ref');\n        }\n\n        inst = ownerFiber.stateNode;\n      }\n\n      if (!inst) {\n        throw new Error(\"Missing owner for string ref \" + mixedRef + \". This error is likely caused by a \" + 'bug in React. Please file an issue.');\n      } // Assigning this to a const so Flow knows it won't change in the closure\n\n\n      var resolvedInst = inst;\n\n      {\n        checkPropStringCoercion(mixedRef, 'ref');\n      }\n\n      var stringRef = '' + mixedRef; // Check if previous string ref matches new string ref\n\n      if (current !== null && current.ref !== null && typeof current.ref === 'function' && current.ref._stringRef === stringRef) {\n        return current.ref;\n      }\n\n      var ref = function (value) {\n        var refs = resolvedInst.refs;\n\n        if (refs === emptyRefsObject) {\n          // This is a lazy pooled frozen object, so we need to initialize.\n          refs = resolvedInst.refs = {};\n        }\n\n        if (value === null) {\n          delete refs[stringRef];\n        } else {\n          refs[stringRef] = value;\n        }\n      };\n\n      ref._stringRef = stringRef;\n      return ref;\n    } else {\n      if (typeof mixedRef !== 'string') {\n        throw new Error('Expected ref to be a function, a string, an object returned by React.createRef(), or null.');\n      }\n\n      if (!element._owner) {\n        throw new Error(\"Element ref was specified as a string (\" + mixedRef + \") but no owner was set. This could happen for one of\" + ' the following reasons:\\n' + '1. You may be adding a ref to a function component\\n' + \"2. You may be adding a ref to a component that was not created inside a component's render method\\n\" + '3. You have multiple copies of React loaded\\n' + 'See https://reactjs.org/link/refs-must-have-owner for more information.');\n      }\n    }\n  }\n\n  return mixedRef;\n}\n\nfunction throwOnInvalidObjectType(returnFiber, newChild) {\n  var childString = Object.prototype.toString.call(newChild);\n  throw new Error(\"Objects are not valid as a React child (found: \" + (childString === '[object Object]' ? 'object with keys {' + Object.keys(newChild).join(', ') + '}' : childString) + \"). \" + 'If you meant to render a collection of children, use an array ' + 'instead.');\n}\n\nfunction warnOnFunctionType(returnFiber) {\n  {\n    var componentName = getComponentNameFromFiber(returnFiber) || 'Component';\n\n    if (ownerHasFunctionTypeWarning[componentName]) {\n      return;\n    }\n\n    ownerHasFunctionTypeWarning[componentName] = true;\n\n    error('Functions are not valid as a React child. This may happen if ' + 'you return a Component instead of <Component /> from render. ' + 'Or maybe you meant to call this function rather than return it.');\n  }\n}\n\nfunction resolveLazy(lazyType) {\n  var payload = lazyType._payload;\n  var init = lazyType._init;\n  return init(payload);\n} // This wrapper function exists because I expect to clone the code in each path\n// to be able to optimize each path individually by branching early. This needs\n// a compiler or we can do it manually. Helpers that don't need this branching\n// live outside of this function.\n\n\nfunction ChildReconciler(shouldTrackSideEffects) {\n  function deleteChild(returnFiber, childToDelete) {\n    if (!shouldTrackSideEffects) {\n      // Noop.\n      return;\n    }\n\n    var deletions = returnFiber.deletions;\n\n    if (deletions === null) {\n      returnFiber.deletions = [childToDelete];\n      returnFiber.flags |= ChildDeletion;\n    } else {\n      deletions.push(childToDelete);\n    }\n  }\n\n  function deleteRemainingChildren(returnFiber, currentFirstChild) {\n    if (!shouldTrackSideEffects) {\n      // Noop.\n      return null;\n    } // TODO: For the shouldClone case, this could be micro-optimized a bit by\n    // assuming that after the first child we've already added everything.\n\n\n    var childToDelete = currentFirstChild;\n\n    while (childToDelete !== null) {\n      deleteChild(returnFiber, childToDelete);\n      childToDelete = childToDelete.sibling;\n    }\n\n    return null;\n  }\n\n  function mapRemainingChildren(returnFiber, currentFirstChild) {\n    // Add the remaining children to a temporary map so that we can find them by\n    // keys quickly. Implicit (null) keys get added to this set with their index\n    // instead.\n    var existingChildren = new Map();\n    var existingChild = currentFirstChild;\n\n    while (existingChild !== null) {\n      if (existingChild.key !== null) {\n        existingChildren.set(existingChild.key, existingChild);\n      } else {\n        existingChildren.set(existingChild.index, existingChild);\n      }\n\n      existingChild = existingChild.sibling;\n    }\n\n    return existingChildren;\n  }\n\n  function useFiber(fiber, pendingProps) {\n    // We currently set sibling to null and index to 0 here because it is easy\n    // to forget to do before returning it. E.g. for the single child case.\n    var clone = createWorkInProgress(fiber, pendingProps);\n    clone.index = 0;\n    clone.sibling = null;\n    return clone;\n  }\n\n  function placeChild(newFiber, lastPlacedIndex, newIndex) {\n    newFiber.index = newIndex;\n\n    if (!shouldTrackSideEffects) {\n      // During hydration, the useId algorithm needs to know which fibers are\n      // part of a list of children (arrays, iterators).\n      newFiber.flags |= Forked;\n      return lastPlacedIndex;\n    }\n\n    var current = newFiber.alternate;\n\n    if (current !== null) {\n      var oldIndex = current.index;\n\n      if (oldIndex < lastPlacedIndex) {\n        // This is a move.\n        newFiber.flags |= Placement;\n        return lastPlacedIndex;\n      } else {\n        // This item can stay in place.\n        return oldIndex;\n      }\n    } else {\n      // This is an insertion.\n      newFiber.flags |= Placement;\n      return lastPlacedIndex;\n    }\n  }\n\n  function placeSingleChild(newFiber) {\n    // This is simpler for the single child case. We only need to do a\n    // placement for inserting new children.\n    if (shouldTrackSideEffects && newFiber.alternate === null) {\n      newFiber.flags |= Placement;\n    }\n\n    return newFiber;\n  }\n\n  function updateTextNode(returnFiber, current, textContent, lanes) {\n    if (current === null || current.tag !== HostText) {\n      // Insert\n      var created = createFiberFromText(textContent, returnFiber.mode, lanes);\n      created.return = returnFiber;\n      return created;\n    } else {\n      // Update\n      var existing = useFiber(current, textContent);\n      existing.return = returnFiber;\n      return existing;\n    }\n  }\n\n  function updateElement(returnFiber, current, element, lanes) {\n    var elementType = element.type;\n\n    if (elementType === REACT_FRAGMENT_TYPE) {\n      return updateFragment(returnFiber, current, element.props.children, lanes, element.key);\n    }\n\n    if (current !== null) {\n      if (current.elementType === elementType || ( // Keep this check inline so it only runs on the false path:\n       isCompatibleFamilyForHotReloading(current, element) ) || // Lazy types should reconcile their resolved type.\n      // We need to do this after the Hot Reloading check above,\n      // because hot reloading has different semantics than prod because\n      // it doesn't resuspend. So we can't let the call below suspend.\n      typeof elementType === 'object' && elementType !== null && elementType.$$typeof === REACT_LAZY_TYPE && resolveLazy(elementType) === current.type) {\n        // Move based on index\n        var existing = useFiber(current, element.props);\n        existing.ref = coerceRef(returnFiber, current, element);\n        existing.return = returnFiber;\n\n        {\n          existing._debugSource = element._source;\n          existing._debugOwner = element._owner;\n        }\n\n        return existing;\n      }\n    } // Insert\n\n\n    var created = createFiberFromElement(element, returnFiber.mode, lanes);\n    created.ref = coerceRef(returnFiber, current, element);\n    created.return = returnFiber;\n    return created;\n  }\n\n  function updatePortal(returnFiber, current, portal, lanes) {\n    if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n      // Insert\n      var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\n      created.return = returnFiber;\n      return created;\n    } else {\n      // Update\n      var existing = useFiber(current, portal.children || []);\n      existing.return = returnFiber;\n      return existing;\n    }\n  }\n\n  function updateFragment(returnFiber, current, fragment, lanes, key) {\n    if (current === null || current.tag !== Fragment) {\n      // Insert\n      var created = createFiberFromFragment(fragment, returnFiber.mode, lanes, key);\n      created.return = returnFiber;\n      return created;\n    } else {\n      // Update\n      var existing = useFiber(current, fragment);\n      existing.return = returnFiber;\n      return existing;\n    }\n  }\n\n  function createChild(returnFiber, newChild, lanes) {\n    if (typeof newChild === 'string' && newChild !== '' || typeof newChild === 'number') {\n      // Text nodes don't have keys. If the previous node is implicitly keyed\n      // we can continue to replace it without aborting even if it is not a text\n      // node.\n      var created = createFiberFromText('' + newChild, returnFiber.mode, lanes);\n      created.return = returnFiber;\n      return created;\n    }\n\n    if (typeof newChild === 'object' && newChild !== null) {\n      switch (newChild.$$typeof) {\n        case REACT_ELEMENT_TYPE:\n          {\n            var _created = createFiberFromElement(newChild, returnFiber.mode, lanes);\n\n            _created.ref = coerceRef(returnFiber, null, newChild);\n            _created.return = returnFiber;\n            return _created;\n          }\n\n        case REACT_PORTAL_TYPE:\n          {\n            var _created2 = createFiberFromPortal(newChild, returnFiber.mode, lanes);\n\n            _created2.return = returnFiber;\n            return _created2;\n          }\n\n        case REACT_LAZY_TYPE:\n          {\n            var payload = newChild._payload;\n            var init = newChild._init;\n            return createChild(returnFiber, init(payload), lanes);\n          }\n      }\n\n      if (isArray(newChild) || getIteratorFn(newChild)) {\n        var _created3 = createFiberFromFragment(newChild, returnFiber.mode, lanes, null);\n\n        _created3.return = returnFiber;\n        return _created3;\n      }\n\n      throwOnInvalidObjectType(returnFiber, newChild);\n    }\n\n    {\n      if (typeof newChild === 'function') {\n        warnOnFunctionType(returnFiber);\n      }\n    }\n\n    return null;\n  }\n\n  function updateSlot(returnFiber, oldFiber, newChild, lanes) {\n    // Update the fiber if the keys match, otherwise return null.\n    var key = oldFiber !== null ? oldFiber.key : null;\n\n    if (typeof newChild === 'string' && newChild !== '' || typeof newChild === 'number') {\n      // Text nodes don't have keys. If the previous node is implicitly keyed\n      // we can continue to replace it without aborting even if it is not a text\n      // node.\n      if (key !== null) {\n        return null;\n      }\n\n      return updateTextNode(returnFiber, oldFiber, '' + newChild, lanes);\n    }\n\n    if (typeof newChild === 'object' && newChild !== null) {\n      switch (newChild.$$typeof) {\n        case REACT_ELEMENT_TYPE:\n          {\n            if (newChild.key === key) {\n              return updateElement(returnFiber, oldFiber, newChild, lanes);\n            } else {\n              return null;\n            }\n          }\n\n        case REACT_PORTAL_TYPE:\n          {\n            if (newChild.key === key) {\n              return updatePortal(returnFiber, oldFiber, newChild, lanes);\n            } else {\n              return null;\n            }\n          }\n\n        case REACT_LAZY_TYPE:\n          {\n            var payload = newChild._payload;\n            var init = newChild._init;\n            return updateSlot(returnFiber, oldFiber, init(payload), lanes);\n          }\n      }\n\n      if (isArray(newChild) || getIteratorFn(newChild)) {\n        if (key !== null) {\n          return null;\n        }\n\n        return updateFragment(returnFiber, oldFiber, newChild, lanes, null);\n      }\n\n      throwOnInvalidObjectType(returnFiber, newChild);\n    }\n\n    {\n      if (typeof newChild === 'function') {\n        warnOnFunctionType(returnFiber);\n      }\n    }\n\n    return null;\n  }\n\n  function updateFromMap(existingChildren, returnFiber, newIdx, newChild, lanes) {\n    if (typeof newChild === 'string' && newChild !== '' || typeof newChild === 'number') {\n      // Text nodes don't have keys, so we neither have to check the old nor\n      // new node for the key. If both are text nodes, they match.\n      var matchedFiber = existingChildren.get(newIdx) || null;\n      return updateTextNode(returnFiber, matchedFiber, '' + newChild, lanes);\n    }\n\n    if (typeof newChild === 'object' && newChild !== null) {\n      switch (newChild.$$typeof) {\n        case REACT_ELEMENT_TYPE:\n          {\n            var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n            return updateElement(returnFiber, _matchedFiber, newChild, lanes);\n          }\n\n        case REACT_PORTAL_TYPE:\n          {\n            var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n            return updatePortal(returnFiber, _matchedFiber2, newChild, lanes);\n          }\n\n        case REACT_LAZY_TYPE:\n          var payload = newChild._payload;\n          var init = newChild._init;\n          return updateFromMap(existingChildren, returnFiber, newIdx, init(payload), lanes);\n      }\n\n      if (isArray(newChild) || getIteratorFn(newChild)) {\n        var _matchedFiber3 = existingChildren.get(newIdx) || null;\n\n        return updateFragment(returnFiber, _matchedFiber3, newChild, lanes, null);\n      }\n\n      throwOnInvalidObjectType(returnFiber, newChild);\n    }\n\n    {\n      if (typeof newChild === 'function') {\n        warnOnFunctionType(returnFiber);\n      }\n    }\n\n    return null;\n  }\n  /**\n   * Warns if there is a duplicate or missing key\n   */\n\n\n  function warnOnInvalidKey(child, knownKeys, returnFiber) {\n    {\n      if (typeof child !== 'object' || child === null) {\n        return knownKeys;\n      }\n\n      switch (child.$$typeof) {\n        case REACT_ELEMENT_TYPE:\n        case REACT_PORTAL_TYPE:\n          warnForMissingKey(child, returnFiber);\n          var key = child.key;\n\n          if (typeof key !== 'string') {\n            break;\n          }\n\n          if (knownKeys === null) {\n            knownKeys = new Set();\n            knownKeys.add(key);\n            break;\n          }\n\n          if (!knownKeys.has(key)) {\n            knownKeys.add(key);\n            break;\n          }\n\n          error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n\n          break;\n\n        case REACT_LAZY_TYPE:\n          var payload = child._payload;\n          var init = child._init;\n          warnOnInvalidKey(init(payload), knownKeys, returnFiber);\n          break;\n      }\n    }\n\n    return knownKeys;\n  }\n\n  function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, lanes) {\n    // This algorithm can't optimize by searching from both ends since we\n    // don't have backpointers on fibers. I'm trying to see how far we can get\n    // with that model. If it ends up not being worth the tradeoffs, we can\n    // add it later.\n    // Even with a two ended optimization, we'd want to optimize for the case\n    // where there are few changes and brute force the comparison instead of\n    // going for the Map. It'd like to explore hitting that path first in\n    // forward-only mode and only go for the Map once we notice that we need\n    // lots of look ahead. This doesn't handle reversal as well as two ended\n    // search but that's unusual. Besides, for the two ended optimization to\n    // work on Iterables, we'd need to copy the whole set.\n    // In this first iteration, we'll just live with hitting the bad case\n    // (adding everything to a Map) in for every insert/move.\n    // If you change this code, also update reconcileChildrenIterator() which\n    // uses the same algorithm.\n    {\n      // First, validate keys.\n      var knownKeys = null;\n\n      for (var i = 0; i < newChildren.length; i++) {\n        var child = newChildren[i];\n        knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\n      }\n    }\n\n    var resultingFirstChild = null;\n    var previousNewFiber = null;\n    var oldFiber = currentFirstChild;\n    var lastPlacedIndex = 0;\n    var newIdx = 0;\n    var nextOldFiber = null;\n\n    for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n      if (oldFiber.index > newIdx) {\n        nextOldFiber = oldFiber;\n        oldFiber = null;\n      } else {\n        nextOldFiber = oldFiber.sibling;\n      }\n\n      var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], lanes);\n\n      if (newFiber === null) {\n        // TODO: This breaks on empty slots like null children. That's\n        // unfortunate because it triggers the slow path all the time. We need\n        // a better way to communicate whether this was a miss or null,\n        // boolean, undefined, etc.\n        if (oldFiber === null) {\n          oldFiber = nextOldFiber;\n        }\n\n        break;\n      }\n\n      if (shouldTrackSideEffects) {\n        if (oldFiber && newFiber.alternate === null) {\n          // We matched the slot, but we didn't reuse the existing fiber, so we\n          // need to delete the existing child.\n          deleteChild(returnFiber, oldFiber);\n        }\n      }\n\n      lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n      if (previousNewFiber === null) {\n        // TODO: Move out of the loop. This only happens for the first run.\n        resultingFirstChild = newFiber;\n      } else {\n        // TODO: Defer siblings if we're not at the right index for this slot.\n        // I.e. if we had null values before, then we want to defer this\n        // for each null value. However, we also don't want to call updateSlot\n        // with the previous one.\n        previousNewFiber.sibling = newFiber;\n      }\n\n      previousNewFiber = newFiber;\n      oldFiber = nextOldFiber;\n    }\n\n    if (newIdx === newChildren.length) {\n      // We've reached the end of the new children. We can delete the rest.\n      deleteRemainingChildren(returnFiber, oldFiber);\n\n      if (getIsHydrating()) {\n        var numberOfForks = newIdx;\n        pushTreeFork(returnFiber, numberOfForks);\n      }\n\n      return resultingFirstChild;\n    }\n\n    if (oldFiber === null) {\n      // If we don't have any more existing children we can choose a fast path\n      // since the rest will all be insertions.\n      for (; newIdx < newChildren.length; newIdx++) {\n        var _newFiber = createChild(returnFiber, newChildren[newIdx], lanes);\n\n        if (_newFiber === null) {\n          continue;\n        }\n\n        lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n\n        if (previousNewFiber === null) {\n          // TODO: Move out of the loop. This only happens for the first run.\n          resultingFirstChild = _newFiber;\n        } else {\n          previousNewFiber.sibling = _newFiber;\n        }\n\n        previousNewFiber = _newFiber;\n      }\n\n      if (getIsHydrating()) {\n        var _numberOfForks = newIdx;\n        pushTreeFork(returnFiber, _numberOfForks);\n      }\n\n      return resultingFirstChild;\n    } // Add all children to a key map for quick lookups.\n\n\n    var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n    for (; newIdx < newChildren.length; newIdx++) {\n      var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], lanes);\n\n      if (_newFiber2 !== null) {\n        if (shouldTrackSideEffects) {\n          if (_newFiber2.alternate !== null) {\n            // The new fiber is a work in progress, but if there exists a\n            // current, that means that we reused the fiber. We need to delete\n            // it from the child list so that we don't add it to the deletion\n            // list.\n            existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n          }\n        }\n\n        lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n\n        if (previousNewFiber === null) {\n          resultingFirstChild = _newFiber2;\n        } else {\n          previousNewFiber.sibling = _newFiber2;\n        }\n\n        previousNewFiber = _newFiber2;\n      }\n    }\n\n    if (shouldTrackSideEffects) {\n      // Any existing children that weren't consumed above were deleted. We need\n      // to add them to the deletion list.\n      existingChildren.forEach(function (child) {\n        return deleteChild(returnFiber, child);\n      });\n    }\n\n    if (getIsHydrating()) {\n      var _numberOfForks2 = newIdx;\n      pushTreeFork(returnFiber, _numberOfForks2);\n    }\n\n    return resultingFirstChild;\n  }\n\n  function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, lanes) {\n    // This is the same implementation as reconcileChildrenArray(),\n    // but using the iterator instead.\n    var iteratorFn = getIteratorFn(newChildrenIterable);\n\n    if (typeof iteratorFn !== 'function') {\n      throw new Error('An object is not an iterable. This error is likely caused by a bug in ' + 'React. Please file an issue.');\n    }\n\n    {\n      // We don't support rendering Generators because it's a mutation.\n      // See https://github.com/facebook/react/issues/12995\n      if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\n      newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n        if (!didWarnAboutGenerators) {\n          error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\n        }\n\n        didWarnAboutGenerators = true;\n      } // Warn about using Maps as children\n\n\n      if (newChildrenIterable.entries === iteratorFn) {\n        if (!didWarnAboutMaps) {\n          error('Using Maps as children is not supported. ' + 'Use an array of keyed ReactElements instead.');\n        }\n\n        didWarnAboutMaps = true;\n      } // First, validate keys.\n      // We'll get a different iterator later for the main pass.\n\n\n      var _newChildren = iteratorFn.call(newChildrenIterable);\n\n      if (_newChildren) {\n        var knownKeys = null;\n\n        var _step = _newChildren.next();\n\n        for (; !_step.done; _step = _newChildren.next()) {\n          var child = _step.value;\n          knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\n        }\n      }\n    }\n\n    var newChildren = iteratorFn.call(newChildrenIterable);\n\n    if (newChildren == null) {\n      throw new Error('An iterable object provided no iterator.');\n    }\n\n    var resultingFirstChild = null;\n    var previousNewFiber = null;\n    var oldFiber = currentFirstChild;\n    var lastPlacedIndex = 0;\n    var newIdx = 0;\n    var nextOldFiber = null;\n    var step = newChildren.next();\n\n    for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n      if (oldFiber.index > newIdx) {\n        nextOldFiber = oldFiber;\n        oldFiber = null;\n      } else {\n        nextOldFiber = oldFiber.sibling;\n      }\n\n      var newFiber = updateSlot(returnFiber, oldFiber, step.value, lanes);\n\n      if (newFiber === null) {\n        // TODO: This breaks on empty slots like null children. That's\n        // unfortunate because it triggers the slow path all the time. We need\n        // a better way to communicate whether this was a miss or null,\n        // boolean, undefined, etc.\n        if (oldFiber === null) {\n          oldFiber = nextOldFiber;\n        }\n\n        break;\n      }\n\n      if (shouldTrackSideEffects) {\n        if (oldFiber && newFiber.alternate === null) {\n          // We matched the slot, but we didn't reuse the existing fiber, so we\n          // need to delete the existing child.\n          deleteChild(returnFiber, oldFiber);\n        }\n      }\n\n      lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n      if (previousNewFiber === null) {\n        // TODO: Move out of the loop. This only happens for the first run.\n        resultingFirstChild = newFiber;\n      } else {\n        // TODO: Defer siblings if we're not at the right index for this slot.\n        // I.e. if we had null values before, then we want to defer this\n        // for each null value. However, we also don't want to call updateSlot\n        // with the previous one.\n        previousNewFiber.sibling = newFiber;\n      }\n\n      previousNewFiber = newFiber;\n      oldFiber = nextOldFiber;\n    }\n\n    if (step.done) {\n      // We've reached the end of the new children. We can delete the rest.\n      deleteRemainingChildren(returnFiber, oldFiber);\n\n      if (getIsHydrating()) {\n        var numberOfForks = newIdx;\n        pushTreeFork(returnFiber, numberOfForks);\n      }\n\n      return resultingFirstChild;\n    }\n\n    if (oldFiber === null) {\n      // If we don't have any more existing children we can choose a fast path\n      // since the rest will all be insertions.\n      for (; !step.done; newIdx++, step = newChildren.next()) {\n        var _newFiber3 = createChild(returnFiber, step.value, lanes);\n\n        if (_newFiber3 === null) {\n          continue;\n        }\n\n        lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n\n        if (previousNewFiber === null) {\n          // TODO: Move out of the loop. This only happens for the first run.\n          resultingFirstChild = _newFiber3;\n        } else {\n          previousNewFiber.sibling = _newFiber3;\n        }\n\n        previousNewFiber = _newFiber3;\n      }\n\n      if (getIsHydrating()) {\n        var _numberOfForks3 = newIdx;\n        pushTreeFork(returnFiber, _numberOfForks3);\n      }\n\n      return resultingFirstChild;\n    } // Add all children to a key map for quick lookups.\n\n\n    var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n    for (; !step.done; newIdx++, step = newChildren.next()) {\n      var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, lanes);\n\n      if (_newFiber4 !== null) {\n        if (shouldTrackSideEffects) {\n          if (_newFiber4.alternate !== null) {\n            // The new fiber is a work in progress, but if there exists a\n            // current, that means that we reused the fiber. We need to delete\n            // it from the child list so that we don't add it to the deletion\n            // list.\n            existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n          }\n        }\n\n        lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n\n        if (previousNewFiber === null) {\n          resultingFirstChild = _newFiber4;\n        } else {\n          previousNewFiber.sibling = _newFiber4;\n        }\n\n        previousNewFiber = _newFiber4;\n      }\n    }\n\n    if (shouldTrackSideEffects) {\n      // Any existing children that weren't consumed above were deleted. We need\n      // to add them to the deletion list.\n      existingChildren.forEach(function (child) {\n        return deleteChild(returnFiber, child);\n      });\n    }\n\n    if (getIsHydrating()) {\n      var _numberOfForks4 = newIdx;\n      pushTreeFork(returnFiber, _numberOfForks4);\n    }\n\n    return resultingFirstChild;\n  }\n\n  function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, lanes) {\n    // There's no need to check for keys on text nodes since we don't have a\n    // way to define them.\n    if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n      // We already have an existing node so let's just update it and delete\n      // the rest.\n      deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n      var existing = useFiber(currentFirstChild, textContent);\n      existing.return = returnFiber;\n      return existing;\n    } // The existing first child is not a text node so we need to create one\n    // and delete the existing ones.\n\n\n    deleteRemainingChildren(returnFiber, currentFirstChild);\n    var created = createFiberFromText(textContent, returnFiber.mode, lanes);\n    created.return = returnFiber;\n    return created;\n  }\n\n  function reconcileSingleElement(returnFiber, currentFirstChild, element, lanes) {\n    var key = element.key;\n    var child = currentFirstChild;\n\n    while (child !== null) {\n      // TODO: If key === null and child.key === null, then this only applies to\n      // the first item in the list.\n      if (child.key === key) {\n        var elementType = element.type;\n\n        if (elementType === REACT_FRAGMENT_TYPE) {\n          if (child.tag === Fragment) {\n            deleteRemainingChildren(returnFiber, child.sibling);\n            var existing = useFiber(child, element.props.children);\n            existing.return = returnFiber;\n\n            {\n              existing._debugSource = element._source;\n              existing._debugOwner = element._owner;\n            }\n\n            return existing;\n          }\n        } else {\n          if (child.elementType === elementType || ( // Keep this check inline so it only runs on the false path:\n           isCompatibleFamilyForHotReloading(child, element) ) || // Lazy types should reconcile their resolved type.\n          // We need to do this after the Hot Reloading check above,\n          // because hot reloading has different semantics than prod because\n          // it doesn't resuspend. So we can't let the call below suspend.\n          typeof elementType === 'object' && elementType !== null && elementType.$$typeof === REACT_LAZY_TYPE && resolveLazy(elementType) === child.type) {\n            deleteRemainingChildren(returnFiber, child.sibling);\n\n            var _existing = useFiber(child, element.props);\n\n            _existing.ref = coerceRef(returnFiber, child, element);\n            _existing.return = returnFiber;\n\n            {\n              _existing._debugSource = element._source;\n              _existing._debugOwner = element._owner;\n            }\n\n            return _existing;\n          }\n        } // Didn't match.\n\n\n        deleteRemainingChildren(returnFiber, child);\n        break;\n      } else {\n        deleteChild(returnFiber, child);\n      }\n\n      child = child.sibling;\n    }\n\n    if (element.type === REACT_FRAGMENT_TYPE) {\n      var created = createFiberFromFragment(element.props.children, returnFiber.mode, lanes, element.key);\n      created.return = returnFiber;\n      return created;\n    } else {\n      var _created4 = createFiberFromElement(element, returnFiber.mode, lanes);\n\n      _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n      _created4.return = returnFiber;\n      return _created4;\n    }\n  }\n\n  function reconcileSinglePortal(returnFiber, currentFirstChild, portal, lanes) {\n    var key = portal.key;\n    var child = currentFirstChild;\n\n    while (child !== null) {\n      // TODO: If key === null and child.key === null, then this only applies to\n      // the first item in the list.\n      if (child.key === key) {\n        if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n          deleteRemainingChildren(returnFiber, child.sibling);\n          var existing = useFiber(child, portal.children || []);\n          existing.return = returnFiber;\n          return existing;\n        } else {\n          deleteRemainingChildren(returnFiber, child);\n          break;\n        }\n      } else {\n        deleteChild(returnFiber, child);\n      }\n\n      child = child.sibling;\n    }\n\n    var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\n    created.return = returnFiber;\n    return created;\n  } // This API will tag the children with the side-effect of the reconciliation\n  // itself. They will be added to the side-effect list as we pass through the\n  // children and the parent.\n\n\n  function reconcileChildFibers(returnFiber, currentFirstChild, newChild, lanes) {\n    // This function is not recursive.\n    // If the top level item is an array, we treat it as a set of children,\n    // not as a fragment. Nested arrays on the other hand will be treated as\n    // fragment nodes. Recursion happens at the normal flow.\n    // Handle top level unkeyed fragments as if they were arrays.\n    // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n    // We treat the ambiguous cases above the same.\n    var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n\n    if (isUnkeyedTopLevelFragment) {\n      newChild = newChild.props.children;\n    } // Handle object types\n\n\n    if (typeof newChild === 'object' && newChild !== null) {\n      switch (newChild.$$typeof) {\n        case REACT_ELEMENT_TYPE:\n          return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, lanes));\n\n        case REACT_PORTAL_TYPE:\n          return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, lanes));\n\n        case REACT_LAZY_TYPE:\n          var payload = newChild._payload;\n          var init = newChild._init; // TODO: This function is supposed to be non-recursive.\n\n          return reconcileChildFibers(returnFiber, currentFirstChild, init(payload), lanes);\n      }\n\n      if (isArray(newChild)) {\n        return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, lanes);\n      }\n\n      if (getIteratorFn(newChild)) {\n        return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, lanes);\n      }\n\n      throwOnInvalidObjectType(returnFiber, newChild);\n    }\n\n    if (typeof newChild === 'string' && newChild !== '' || typeof newChild === 'number') {\n      return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, lanes));\n    }\n\n    {\n      if (typeof newChild === 'function') {\n        warnOnFunctionType(returnFiber);\n      }\n    } // Remaining cases are all treated as empty.\n\n\n    return deleteRemainingChildren(returnFiber, currentFirstChild);\n  }\n\n  return reconcileChildFibers;\n}\n\nvar reconcileChildFibers = ChildReconciler(true);\nvar mountChildFibers = ChildReconciler(false);\nfunction cloneChildFibers(current, workInProgress) {\n  if (current !== null && workInProgress.child !== current.child) {\n    throw new Error('Resuming work not yet implemented.');\n  }\n\n  if (workInProgress.child === null) {\n    return;\n  }\n\n  var currentChild = workInProgress.child;\n  var newChild = createWorkInProgress(currentChild, currentChild.pendingProps);\n  workInProgress.child = newChild;\n  newChild.return = workInProgress;\n\n  while (currentChild.sibling !== null) {\n    currentChild = currentChild.sibling;\n    newChild = newChild.sibling = createWorkInProgress(currentChild, currentChild.pendingProps);\n    newChild.return = workInProgress;\n  }\n\n  newChild.sibling = null;\n} // Reset a workInProgress child set to prepare it for a second pass.\n\nfunction resetChildFibers(workInProgress, lanes) {\n  var child = workInProgress.child;\n\n  while (child !== null) {\n    resetWorkInProgress(child, lanes);\n    child = child.sibling;\n  }\n}\n\nvar NO_CONTEXT = {};\nvar contextStackCursor$1 = createCursor(NO_CONTEXT);\nvar contextFiberStackCursor = createCursor(NO_CONTEXT);\nvar rootInstanceStackCursor = createCursor(NO_CONTEXT);\n\nfunction requiredContext(c) {\n  if (c === NO_CONTEXT) {\n    throw new Error('Expected host context to exist. This error is likely caused by a bug ' + 'in React. Please file an issue.');\n  }\n\n  return c;\n}\n\nfunction getRootHostContainer() {\n  var rootInstance = requiredContext(rootInstanceStackCursor.current);\n  return rootInstance;\n}\n\nfunction pushHostContainer(fiber, nextRootInstance) {\n  // Push current root instance onto the stack;\n  // This allows us to reset root when portals are popped.\n  push(rootInstanceStackCursor, nextRootInstance, fiber); // Track the context and the Fiber that provided it.\n  // This enables us to pop only Fibers that provide unique contexts.\n\n  push(contextFiberStackCursor, fiber, fiber); // Finally, we need to push the host context to the stack.\n  // However, we can't just call getRootHostContext() and push it because\n  // we'd have a different number of entries on the stack depending on\n  // whether getRootHostContext() throws somewhere in renderer code or not.\n  // So we push an empty value first. This lets us safely unwind on errors.\n\n  push(contextStackCursor$1, NO_CONTEXT, fiber);\n  var nextRootContext = getRootHostContext(nextRootInstance); // Now that we know this function doesn't throw, replace it.\n\n  pop(contextStackCursor$1, fiber);\n  push(contextStackCursor$1, nextRootContext, fiber);\n}\n\nfunction popHostContainer(fiber) {\n  pop(contextStackCursor$1, fiber);\n  pop(contextFiberStackCursor, fiber);\n  pop(rootInstanceStackCursor, fiber);\n}\n\nfunction getHostContext() {\n  var context = requiredContext(contextStackCursor$1.current);\n  return context;\n}\n\nfunction pushHostContext(fiber) {\n  var rootInstance = requiredContext(rootInstanceStackCursor.current);\n  var context = requiredContext(contextStackCursor$1.current);\n  var nextContext = getChildHostContext(context, fiber.type); // Don't push this Fiber's context unless it's unique.\n\n  if (context === nextContext) {\n    return;\n  } // Track the context and the Fiber that provided it.\n  // This enables us to pop only Fibers that provide unique contexts.\n\n\n  push(contextFiberStackCursor, fiber, fiber);\n  push(contextStackCursor$1, nextContext, fiber);\n}\n\nfunction popHostContext(fiber) {\n  // Do not pop unless this Fiber provided the current context.\n  // pushHostContext() only pushes Fibers that provide unique contexts.\n  if (contextFiberStackCursor.current !== fiber) {\n    return;\n  }\n\n  pop(contextStackCursor$1, fiber);\n  pop(contextFiberStackCursor, fiber);\n}\n\nvar DefaultSuspenseContext = 0; // The Suspense Context is split into two parts. The lower bits is\n// inherited deeply down the subtree. The upper bits only affect\n// this immediate suspense boundary and gets reset each new\n// boundary or suspense list.\n\nvar SubtreeSuspenseContextMask = 1; // Subtree Flags:\n// InvisibleParentSuspenseContext indicates that one of our parent Suspense\n// boundaries is not currently showing visible main content.\n// Either because it is already showing a fallback or is not mounted at all.\n// We can use this to determine if it is desirable to trigger a fallback at\n// the parent. If not, then we might need to trigger undesirable boundaries\n// and/or suspend the commit to avoid hiding the parent content.\n\nvar InvisibleParentSuspenseContext = 1; // Shallow Flags:\n// ForceSuspenseFallback can be used by SuspenseList to force newly added\n// items into their fallback state during one of the render passes.\n\nvar ForceSuspenseFallback = 2;\nvar suspenseStackCursor = createCursor(DefaultSuspenseContext);\nfunction hasSuspenseContext(parentContext, flag) {\n  return (parentContext & flag) !== 0;\n}\nfunction setDefaultShallowSuspenseContext(parentContext) {\n  return parentContext & SubtreeSuspenseContextMask;\n}\nfunction setShallowSuspenseContext(parentContext, shallowContext) {\n  return parentContext & SubtreeSuspenseContextMask | shallowContext;\n}\nfunction addSubtreeSuspenseContext(parentContext, subtreeContext) {\n  return parentContext | subtreeContext;\n}\nfunction pushSuspenseContext(fiber, newContext) {\n  push(suspenseStackCursor, newContext, fiber);\n}\nfunction popSuspenseContext(fiber) {\n  pop(suspenseStackCursor, fiber);\n}\n\nfunction shouldCaptureSuspense(workInProgress, hasInvisibleParent) {\n  // If it was the primary children that just suspended, capture and render the\n  // fallback. Otherwise, don't capture and bubble to the next boundary.\n  var nextState = workInProgress.memoizedState;\n\n  if (nextState !== null) {\n    if (nextState.dehydrated !== null) {\n      // A dehydrated boundary always captures.\n      return true;\n    }\n\n    return false;\n  }\n\n  var props = workInProgress.memoizedProps; // Regular boundaries always capture.\n\n  {\n    return true;\n  } // If it's a boundary we should avoid, then we prefer to bubble up to the\n}\nfunction findFirstSuspended(row) {\n  var node = row;\n\n  while (node !== null) {\n    if (node.tag === SuspenseComponent) {\n      var state = node.memoizedState;\n\n      if (state !== null) {\n        var dehydrated = state.dehydrated;\n\n        if (dehydrated === null || isSuspenseInstancePending(dehydrated) || isSuspenseInstanceFallback(dehydrated)) {\n          return node;\n        }\n      }\n    } else if (node.tag === SuspenseListComponent && // revealOrder undefined can't be trusted because it don't\n    // keep track of whether it suspended or not.\n    node.memoizedProps.revealOrder !== undefined) {\n      var didSuspend = (node.flags & DidCapture) !== NoFlags;\n\n      if (didSuspend) {\n        return node;\n      }\n    } else if (node.child !== null) {\n      node.child.return = node;\n      node = node.child;\n      continue;\n    }\n\n    if (node === row) {\n      return null;\n    }\n\n    while (node.sibling === null) {\n      if (node.return === null || node.return === row) {\n        return null;\n      }\n\n      node = node.return;\n    }\n\n    node.sibling.return = node.return;\n    node = node.sibling;\n  }\n\n  return null;\n}\n\nvar NoFlags$1 =\n/*   */\n0; // Represents whether effect should fire.\n\nvar HasEffect =\n/* */\n1; // Represents the phase in which the effect (not the clean-up) fires.\n\nvar Insertion =\n/*  */\n2;\nvar Layout =\n/*    */\n4;\nvar Passive$1 =\n/*   */\n8;\n\n// and should be reset before starting a new render.\n// This tracks which mutable sources need to be reset after a render.\n\nvar workInProgressSources = [];\nfunction resetWorkInProgressVersions() {\n  for (var i = 0; i < workInProgressSources.length; i++) {\n    var mutableSource = workInProgressSources[i];\n\n    {\n      mutableSource._workInProgressVersionPrimary = null;\n    }\n  }\n\n  workInProgressSources.length = 0;\n}\n// This ensures that the version used for server rendering matches the one\n// that is eventually read during hydration.\n// If they don't match there's a potential tear and a full deopt render is required.\n\nfunction registerMutableSourceForHydration(root, mutableSource) {\n  var getVersion = mutableSource._getVersion;\n  var version = getVersion(mutableSource._source); // TODO Clear this data once all pending hydration work is finished.\n  // Retaining it forever may interfere with GC.\n\n  if (root.mutableSourceEagerHydrationData == null) {\n    root.mutableSourceEagerHydrationData = [mutableSource, version];\n  } else {\n    root.mutableSourceEagerHydrationData.push(mutableSource, version);\n  }\n}\n\nvar ReactCurrentDispatcher$1 = ReactSharedInternals.ReactCurrentDispatcher,\n    ReactCurrentBatchConfig$2 = ReactSharedInternals.ReactCurrentBatchConfig;\nvar didWarnAboutMismatchedHooksForComponent;\nvar didWarnUncachedGetSnapshot;\n\n{\n  didWarnAboutMismatchedHooksForComponent = new Set();\n}\n\n// These are set right before calling the component.\nvar renderLanes = NoLanes; // The work-in-progress fiber. I've named it differently to distinguish it from\n// the work-in-progress hook.\n\nvar currentlyRenderingFiber$1 = null; // Hooks are stored as a linked list on the fiber's memoizedState field. The\n// current hook list is the list that belongs to the current fiber. The\n// work-in-progress hook list is a new list that will be added to the\n// work-in-progress fiber.\n\nvar currentHook = null;\nvar workInProgressHook = null; // Whether an update was scheduled at any point during the render phase. This\n// does not get reset if we do another render pass; only when we're completely\n// finished evaluating this component. This is an optimization so we know\n// whether we need to clear render phase updates after a throw.\n\nvar didScheduleRenderPhaseUpdate = false; // Where an update was scheduled only during the current render pass. This\n// gets reset after each attempt.\n// TODO: Maybe there's some way to consolidate this with\n// `didScheduleRenderPhaseUpdate`. Or with `numberOfReRenders`.\n\nvar didScheduleRenderPhaseUpdateDuringThisPass = false; // Counts the number of useId hooks in this component.\n\nvar localIdCounter = 0; // Used for ids that are generated completely client-side (i.e. not during\n// hydration). This counter is global, so client ids are not stable across\n// render attempts.\n\nvar globalClientIdCounter = 0;\nvar RE_RENDER_LIMIT = 25; // In DEV, this is the name of the currently executing primitive hook\n\nvar currentHookNameInDev = null; // In DEV, this list ensures that hooks are called in the same order between renders.\n// The list stores the order of hooks used during the initial render (mount).\n// Subsequent renders (updates) reference this list.\n\nvar hookTypesDev = null;\nvar hookTypesUpdateIndexDev = -1; // In DEV, this tracks whether currently rendering component needs to ignore\n// the dependencies for Hooks that need them (e.g. useEffect or useMemo).\n// When true, such Hooks will always be \"remounted\". Only used during hot reload.\n\nvar ignorePreviousDependencies = false;\n\nfunction mountHookTypesDev() {\n  {\n    var hookName = currentHookNameInDev;\n\n    if (hookTypesDev === null) {\n      hookTypesDev = [hookName];\n    } else {\n      hookTypesDev.push(hookName);\n    }\n  }\n}\n\nfunction updateHookTypesDev() {\n  {\n    var hookName = currentHookNameInDev;\n\n    if (hookTypesDev !== null) {\n      hookTypesUpdateIndexDev++;\n\n      if (hookTypesDev[hookTypesUpdateIndexDev] !== hookName) {\n        warnOnHookMismatchInDev(hookName);\n      }\n    }\n  }\n}\n\nfunction checkDepsAreArrayDev(deps) {\n  {\n    if (deps !== undefined && deps !== null && !isArray(deps)) {\n      // Verify deps, but only on mount to avoid extra checks.\n      // It's unlikely their type would change as usually you define them inline.\n      error('%s received a final argument that is not an array (instead, received `%s`). When ' + 'specified, the final argument must be an array.', currentHookNameInDev, typeof deps);\n    }\n  }\n}\n\nfunction warnOnHookMismatchInDev(currentHookName) {\n  {\n    var componentName = getComponentNameFromFiber(currentlyRenderingFiber$1);\n\n    if (!didWarnAboutMismatchedHooksForComponent.has(componentName)) {\n      didWarnAboutMismatchedHooksForComponent.add(componentName);\n\n      if (hookTypesDev !== null) {\n        var table = '';\n        var secondColumnStart = 30;\n\n        for (var i = 0; i <= hookTypesUpdateIndexDev; i++) {\n          var oldHookName = hookTypesDev[i];\n          var newHookName = i === hookTypesUpdateIndexDev ? currentHookName : oldHookName;\n          var row = i + 1 + \". \" + oldHookName; // Extra space so second column lines up\n          // lol @ IE not supporting String#repeat\n\n          while (row.length < secondColumnStart) {\n            row += ' ';\n          }\n\n          row += newHookName + '\\n';\n          table += row;\n        }\n\n        error('React has detected a change in the order of Hooks called by %s. ' + 'This will lead to bugs and errors if not fixed. ' + 'For more information, read the Rules of Hooks: https://reactjs.org/link/rules-of-hooks\\n\\n' + '   Previous render            Next render\\n' + '   ------------------------------------------------------\\n' + '%s' + '   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\\n', componentName, table);\n      }\n    }\n  }\n}\n\nfunction throwInvalidHookError() {\n  throw new Error('Invalid hook call. Hooks can only be called inside of the body of a function component. This could happen for' + ' one of the following reasons:\\n' + '1. You might have mismatching versions of React and the renderer (such as React DOM)\\n' + '2. You might be breaking the Rules of Hooks\\n' + '3. You might have more than one copy of React in the same app\\n' + 'See https://reactjs.org/link/invalid-hook-call for tips about how to debug and fix this problem.');\n}\n\nfunction areHookInputsEqual(nextDeps, prevDeps) {\n  {\n    if (ignorePreviousDependencies) {\n      // Only true when this component is being hot reloaded.\n      return false;\n    }\n  }\n\n  if (prevDeps === null) {\n    {\n      error('%s received a final argument during this render, but not during ' + 'the previous render. Even though the final argument is optional, ' + 'its type cannot change between renders.', currentHookNameInDev);\n    }\n\n    return false;\n  }\n\n  {\n    // Don't bother comparing lengths in prod because these arrays should be\n    // passed inline.\n    if (nextDeps.length !== prevDeps.length) {\n      error('The final argument passed to %s changed size between renders. The ' + 'order and size of this array must remain constant.\\n\\n' + 'Previous: %s\\n' + 'Incoming: %s', currentHookNameInDev, \"[\" + prevDeps.join(', ') + \"]\", \"[\" + nextDeps.join(', ') + \"]\");\n    }\n  }\n\n  for (var i = 0; i < prevDeps.length && i < nextDeps.length; i++) {\n    if (objectIs(nextDeps[i], prevDeps[i])) {\n      continue;\n    }\n\n    return false;\n  }\n\n  return true;\n}\n\nfunction renderWithHooks(current, workInProgress, Component, props, secondArg, nextRenderLanes) {\n  renderLanes = nextRenderLanes;\n  currentlyRenderingFiber$1 = workInProgress;\n\n  {\n    hookTypesDev = current !== null ? current._debugHookTypes : null;\n    hookTypesUpdateIndexDev = -1; // Used for hot reloading:\n\n    ignorePreviousDependencies = current !== null && current.type !== workInProgress.type;\n  }\n\n  workInProgress.memoizedState = null;\n  workInProgress.updateQueue = null;\n  workInProgress.lanes = NoLanes; // The following should have already been reset\n  // currentHook = null;\n  // workInProgressHook = null;\n  // didScheduleRenderPhaseUpdate = false;\n  // localIdCounter = 0;\n  // TODO Warn if no hooks are used at all during mount, then some are used during update.\n  // Currently we will identify the update render as a mount because memoizedState === null.\n  // This is tricky because it's valid for certain types of components (e.g. React.lazy)\n  // Using memoizedState to differentiate between mount/update only works if at least one stateful hook is used.\n  // Non-stateful hooks (e.g. context) don't get added to memoizedState,\n  // so memoizedState would be null during updates and mounts.\n\n  {\n    if (current !== null && current.memoizedState !== null) {\n      ReactCurrentDispatcher$1.current = HooksDispatcherOnUpdateInDEV;\n    } else if (hookTypesDev !== null) {\n      // This dispatcher handles an edge case where a component is updating,\n      // but no stateful hooks have been used.\n      // We want to match the production code behavior (which will use HooksDispatcherOnMount),\n      // but with the extra DEV validation to ensure hooks ordering hasn't changed.\n      // This dispatcher does that.\n      ReactCurrentDispatcher$1.current = HooksDispatcherOnMountWithHookTypesInDEV;\n    } else {\n      ReactCurrentDispatcher$1.current = HooksDispatcherOnMountInDEV;\n    }\n  }\n\n  var children = Component(props, secondArg); // Check if there was a render phase update\n\n  if (didScheduleRenderPhaseUpdateDuringThisPass) {\n    // Keep rendering in a loop for as long as render phase updates continue to\n    // be scheduled. Use a counter to prevent infinite loops.\n    var numberOfReRenders = 0;\n\n    do {\n      didScheduleRenderPhaseUpdateDuringThisPass = false;\n      localIdCounter = 0;\n\n      if (numberOfReRenders >= RE_RENDER_LIMIT) {\n        throw new Error('Too many re-renders. React limits the number of renders to prevent ' + 'an infinite loop.');\n      }\n\n      numberOfReRenders += 1;\n\n      {\n        // Even when hot reloading, allow dependencies to stabilize\n        // after first render to prevent infinite render phase updates.\n        ignorePreviousDependencies = false;\n      } // Start over from the beginning of the list\n\n\n      currentHook = null;\n      workInProgressHook = null;\n      workInProgress.updateQueue = null;\n\n      {\n        // Also validate hook order for cascading updates.\n        hookTypesUpdateIndexDev = -1;\n      }\n\n      ReactCurrentDispatcher$1.current =  HooksDispatcherOnRerenderInDEV ;\n      children = Component(props, secondArg);\n    } while (didScheduleRenderPhaseUpdateDuringThisPass);\n  } // We can assume the previous dispatcher is always this one, since we set it\n  // at the beginning of the render phase and there's no re-entrance.\n\n\n  ReactCurrentDispatcher$1.current = ContextOnlyDispatcher;\n\n  {\n    workInProgress._debugHookTypes = hookTypesDev;\n  } // This check uses currentHook so that it works the same in DEV and prod bundles.\n  // hookTypesDev could catch more cases (e.g. context) but only in DEV bundles.\n\n\n  var didRenderTooFewHooks = currentHook !== null && currentHook.next !== null;\n  renderLanes = NoLanes;\n  currentlyRenderingFiber$1 = null;\n  currentHook = null;\n  workInProgressHook = null;\n\n  {\n    currentHookNameInDev = null;\n    hookTypesDev = null;\n    hookTypesUpdateIndexDev = -1; // Confirm that a static flag was not added or removed since the last\n    // render. If this fires, it suggests that we incorrectly reset the static\n    // flags in some other part of the codebase. This has happened before, for\n    // example, in the SuspenseList implementation.\n\n    if (current !== null && (current.flags & StaticMask) !== (workInProgress.flags & StaticMask) && // Disable this warning in legacy mode, because legacy Suspense is weird\n    // and creates false positives. To make this work in legacy mode, we'd\n    // need to mark fibers that commit in an incomplete state, somehow. For\n    // now I'll disable the warning that most of the bugs that would trigger\n    // it are either exclusive to concurrent mode or exist in both.\n    (current.mode & ConcurrentMode) !== NoMode) {\n      error('Internal React error: Expected static flag was missing. Please ' + 'notify the React team.');\n    }\n  }\n\n  didScheduleRenderPhaseUpdate = false; // This is reset by checkDidRenderIdHook\n  // localIdCounter = 0;\n\n  if (didRenderTooFewHooks) {\n    throw new Error('Rendered fewer hooks than expected. This may be caused by an accidental ' + 'early return statement.');\n  }\n\n  return children;\n}\nfunction checkDidRenderIdHook() {\n  // This should be called immediately after every renderWithHooks call.\n  // Conceptually, it's part of the return value of renderWithHooks; it's only a\n  // separate function to avoid using an array tuple.\n  var didRenderIdHook = localIdCounter !== 0;\n  localIdCounter = 0;\n  return didRenderIdHook;\n}\nfunction bailoutHooks(current, workInProgress, lanes) {\n  workInProgress.updateQueue = current.updateQueue; // TODO: Don't need to reset the flags here, because they're reset in the\n  // complete phase (bubbleProperties).\n\n  if ( (workInProgress.mode & StrictEffectsMode) !== NoMode) {\n    workInProgress.flags &= ~(MountPassiveDev | MountLayoutDev | Passive | Update);\n  } else {\n    workInProgress.flags &= ~(Passive | Update);\n  }\n\n  current.lanes = removeLanes(current.lanes, lanes);\n}\nfunction resetHooksAfterThrow() {\n  // We can assume the previous dispatcher is always this one, since we set it\n  // at the beginning of the render phase and there's no re-entrance.\n  ReactCurrentDispatcher$1.current = ContextOnlyDispatcher;\n\n  if (didScheduleRenderPhaseUpdate) {\n    // There were render phase updates. These are only valid for this render\n    // phase, which we are now aborting. Remove the updates from the queues so\n    // they do not persist to the next render. Do not remove updates from hooks\n    // that weren't processed.\n    //\n    // Only reset the updates from the queue if it has a clone. If it does\n    // not have a clone, that means it wasn't processed, and the updates were\n    // scheduled before we entered the render phase.\n    var hook = currentlyRenderingFiber$1.memoizedState;\n\n    while (hook !== null) {\n      var queue = hook.queue;\n\n      if (queue !== null) {\n        queue.pending = null;\n      }\n\n      hook = hook.next;\n    }\n\n    didScheduleRenderPhaseUpdate = false;\n  }\n\n  renderLanes = NoLanes;\n  currentlyRenderingFiber$1 = null;\n  currentHook = null;\n  workInProgressHook = null;\n\n  {\n    hookTypesDev = null;\n    hookTypesUpdateIndexDev = -1;\n    currentHookNameInDev = null;\n    isUpdatingOpaqueValueInRenderPhase = false;\n  }\n\n  didScheduleRenderPhaseUpdateDuringThisPass = false;\n  localIdCounter = 0;\n}\n\nfunction mountWorkInProgressHook() {\n  var hook = {\n    memoizedState: null,\n    baseState: null,\n    baseQueue: null,\n    queue: null,\n    next: null\n  };\n\n  if (workInProgressHook === null) {\n    // This is the first hook in the list\n    currentlyRenderingFiber$1.memoizedState = workInProgressHook = hook;\n  } else {\n    // Append to the end of the list\n    workInProgressHook = workInProgressHook.next = hook;\n  }\n\n  return workInProgressHook;\n}\n\nfunction updateWorkInProgressHook() {\n  // This function is used both for updates and for re-renders triggered by a\n  // render phase update. It assumes there is either a current hook we can\n  // clone, or a work-in-progress hook from a previous render pass that we can\n  // use as a base. When we reach the end of the base list, we must switch to\n  // the dispatcher used for mounts.\n  var nextCurrentHook;\n\n  if (currentHook === null) {\n    var current = currentlyRenderingFiber$1.alternate;\n\n    if (current !== null) {\n      nextCurrentHook = current.memoizedState;\n    } else {\n      nextCurrentHook = null;\n    }\n  } else {\n    nextCurrentHook = currentHook.next;\n  }\n\n  var nextWorkInProgressHook;\n\n  if (workInProgressHook === null) {\n    nextWorkInProgressHook = currentlyRenderingFiber$1.memoizedState;\n  } else {\n    nextWorkInProgressHook = workInProgressHook.next;\n  }\n\n  if (nextWorkInProgressHook !== null) {\n    // There's already a work-in-progress. Reuse it.\n    workInProgressHook = nextWorkInProgressHook;\n    nextWorkInProgressHook = workInProgressHook.next;\n    currentHook = nextCurrentHook;\n  } else {\n    // Clone from the current hook.\n    if (nextCurrentHook === null) {\n      throw new Error('Rendered more hooks than during the previous render.');\n    }\n\n    currentHook = nextCurrentHook;\n    var newHook = {\n      memoizedState: currentHook.memoizedState,\n      baseState: currentHook.baseState,\n      baseQueue: currentHook.baseQueue,\n      queue: currentHook.queue,\n      next: null\n    };\n\n    if (workInProgressHook === null) {\n      // This is the first hook in the list.\n      currentlyRenderingFiber$1.memoizedState = workInProgressHook = newHook;\n    } else {\n      // Append to the end of the list.\n      workInProgressHook = workInProgressHook.next = newHook;\n    }\n  }\n\n  return workInProgressHook;\n}\n\nfunction createFunctionComponentUpdateQueue() {\n  return {\n    lastEffect: null,\n    stores: null\n  };\n}\n\nfunction basicStateReducer(state, action) {\n  // $FlowFixMe: Flow doesn't like mixed types\n  return typeof action === 'function' ? action(state) : action;\n}\n\nfunction mountReducer(reducer, initialArg, init) {\n  var hook = mountWorkInProgressHook();\n  var initialState;\n\n  if (init !== undefined) {\n    initialState = init(initialArg);\n  } else {\n    initialState = initialArg;\n  }\n\n  hook.memoizedState = hook.baseState = initialState;\n  var queue = {\n    pending: null,\n    interleaved: null,\n    lanes: NoLanes,\n    dispatch: null,\n    lastRenderedReducer: reducer,\n    lastRenderedState: initialState\n  };\n  hook.queue = queue;\n  var dispatch = queue.dispatch = dispatchReducerAction.bind(null, currentlyRenderingFiber$1, queue);\n  return [hook.memoizedState, dispatch];\n}\n\nfunction updateReducer(reducer, initialArg, init) {\n  var hook = updateWorkInProgressHook();\n  var queue = hook.queue;\n\n  if (queue === null) {\n    throw new Error('Should have a queue. This is likely a bug in React. Please file an issue.');\n  }\n\n  queue.lastRenderedReducer = reducer;\n  var current = currentHook; // The last rebase update that is NOT part of the base state.\n\n  var baseQueue = current.baseQueue; // The last pending update that hasn't been processed yet.\n\n  var pendingQueue = queue.pending;\n\n  if (pendingQueue !== null) {\n    // We have new updates that haven't been processed yet.\n    // We'll add them to the base queue.\n    if (baseQueue !== null) {\n      // Merge the pending queue and the base queue.\n      var baseFirst = baseQueue.next;\n      var pendingFirst = pendingQueue.next;\n      baseQueue.next = pendingFirst;\n      pendingQueue.next = baseFirst;\n    }\n\n    {\n      if (current.baseQueue !== baseQueue) {\n        // Internal invariant that should never happen, but feasibly could in\n        // the future if we implement resuming, or some form of that.\n        error('Internal error: Expected work-in-progress queue to be a clone. ' + 'This is a bug in React.');\n      }\n    }\n\n    current.baseQueue = baseQueue = pendingQueue;\n    queue.pending = null;\n  }\n\n  if (baseQueue !== null) {\n    // We have a queue to process.\n    var first = baseQueue.next;\n    var newState = current.baseState;\n    var newBaseState = null;\n    var newBaseQueueFirst = null;\n    var newBaseQueueLast = null;\n    var update = first;\n\n    do {\n      var updateLane = update.lane;\n\n      if (!isSubsetOfLanes(renderLanes, updateLane)) {\n        // Priority is insufficient. Skip this update. If this is the first\n        // skipped update, the previous update/state is the new base\n        // update/state.\n        var clone = {\n          lane: updateLane,\n          action: update.action,\n          hasEagerState: update.hasEagerState,\n          eagerState: update.eagerState,\n          next: null\n        };\n\n        if (newBaseQueueLast === null) {\n          newBaseQueueFirst = newBaseQueueLast = clone;\n          newBaseState = newState;\n        } else {\n          newBaseQueueLast = newBaseQueueLast.next = clone;\n        } // Update the remaining priority in the queue.\n        // TODO: Don't need to accumulate this. Instead, we can remove\n        // renderLanes from the original lanes.\n\n\n        currentlyRenderingFiber$1.lanes = mergeLanes(currentlyRenderingFiber$1.lanes, updateLane);\n        markSkippedUpdateLanes(updateLane);\n      } else {\n        // This update does have sufficient priority.\n        if (newBaseQueueLast !== null) {\n          var _clone = {\n            // This update is going to be committed so we never want uncommit\n            // it. Using NoLane works because 0 is a subset of all bitmasks, so\n            // this will never be skipped by the check above.\n            lane: NoLane,\n            action: update.action,\n            hasEagerState: update.hasEagerState,\n            eagerState: update.eagerState,\n            next: null\n          };\n          newBaseQueueLast = newBaseQueueLast.next = _clone;\n        } // Process this update.\n\n\n        if (update.hasEagerState) {\n          // If this update is a state update (not a reducer) and was processed eagerly,\n          // we can use the eagerly computed state\n          newState = update.eagerState;\n        } else {\n          var action = update.action;\n          newState = reducer(newState, action);\n        }\n      }\n\n      update = update.next;\n    } while (update !== null && update !== first);\n\n    if (newBaseQueueLast === null) {\n      newBaseState = newState;\n    } else {\n      newBaseQueueLast.next = newBaseQueueFirst;\n    } // Mark that the fiber performed work, but only if the new state is\n    // different from the current state.\n\n\n    if (!objectIs(newState, hook.memoizedState)) {\n      markWorkInProgressReceivedUpdate();\n    }\n\n    hook.memoizedState = newState;\n    hook.baseState = newBaseState;\n    hook.baseQueue = newBaseQueueLast;\n    queue.lastRenderedState = newState;\n  } // Interleaved updates are stored on a separate queue. We aren't going to\n  // process them during this render, but we do need to track which lanes\n  // are remaining.\n\n\n  var lastInterleaved = queue.interleaved;\n\n  if (lastInterleaved !== null) {\n    var interleaved = lastInterleaved;\n\n    do {\n      var interleavedLane = interleaved.lane;\n      currentlyRenderingFiber$1.lanes = mergeLanes(currentlyRenderingFiber$1.lanes, interleavedLane);\n      markSkippedUpdateLanes(interleavedLane);\n      interleaved = interleaved.next;\n    } while (interleaved !== lastInterleaved);\n  } else if (baseQueue === null) {\n    // `queue.lanes` is used for entangling transitions. We can set it back to\n    // zero once the queue is empty.\n    queue.lanes = NoLanes;\n  }\n\n  var dispatch = queue.dispatch;\n  return [hook.memoizedState, dispatch];\n}\n\nfunction rerenderReducer(reducer, initialArg, init) {\n  var hook = updateWorkInProgressHook();\n  var queue = hook.queue;\n\n  if (queue === null) {\n    throw new Error('Should have a queue. This is likely a bug in React. Please file an issue.');\n  }\n\n  queue.lastRenderedReducer = reducer; // This is a re-render. Apply the new render phase updates to the previous\n  // work-in-progress hook.\n\n  var dispatch = queue.dispatch;\n  var lastRenderPhaseUpdate = queue.pending;\n  var newState = hook.memoizedState;\n\n  if (lastRenderPhaseUpdate !== null) {\n    // The queue doesn't persist past this render pass.\n    queue.pending = null;\n    var firstRenderPhaseUpdate = lastRenderPhaseUpdate.next;\n    var update = firstRenderPhaseUpdate;\n\n    do {\n      // Process this render phase update. We don't have to check the\n      // priority because it will always be the same as the current\n      // render's.\n      var action = update.action;\n      newState = reducer(newState, action);\n      update = update.next;\n    } while (update !== firstRenderPhaseUpdate); // Mark that the fiber performed work, but only if the new state is\n    // different from the current state.\n\n\n    if (!objectIs(newState, hook.memoizedState)) {\n      markWorkInProgressReceivedUpdate();\n    }\n\n    hook.memoizedState = newState; // Don't persist the state accumulated from the render phase updates to\n    // the base state unless the queue is empty.\n    // TODO: Not sure if this is the desired semantics, but it's what we\n    // do for gDSFP. I can't remember why.\n\n    if (hook.baseQueue === null) {\n      hook.baseState = newState;\n    }\n\n    queue.lastRenderedState = newState;\n  }\n\n  return [newState, dispatch];\n}\n\nfunction mountMutableSource(source, getSnapshot, subscribe) {\n  {\n    return undefined;\n  }\n}\n\nfunction updateMutableSource(source, getSnapshot, subscribe) {\n  {\n    return undefined;\n  }\n}\n\nfunction mountSyncExternalStore(subscribe, getSnapshot, getServerSnapshot) {\n  var fiber = currentlyRenderingFiber$1;\n  var hook = mountWorkInProgressHook();\n  var nextSnapshot;\n  var isHydrating = getIsHydrating();\n\n  if (isHydrating) {\n    if (getServerSnapshot === undefined) {\n      throw new Error('Missing getServerSnapshot, which is required for ' + 'server-rendered content. Will revert to client rendering.');\n    }\n\n    nextSnapshot = getServerSnapshot();\n\n    {\n      if (!didWarnUncachedGetSnapshot) {\n        if (nextSnapshot !== getServerSnapshot()) {\n          error('The result of getServerSnapshot should be cached to avoid an infinite loop');\n\n          didWarnUncachedGetSnapshot = true;\n        }\n      }\n    }\n  } else {\n    nextSnapshot = getSnapshot();\n\n    {\n      if (!didWarnUncachedGetSnapshot) {\n        var cachedSnapshot = getSnapshot();\n\n        if (!objectIs(nextSnapshot, cachedSnapshot)) {\n          error('The result of getSnapshot should be cached to avoid an infinite loop');\n\n          didWarnUncachedGetSnapshot = true;\n        }\n      }\n    } // Unless we're rendering a blocking lane, schedule a consistency check.\n    // Right before committing, we will walk the tree and check if any of the\n    // stores were mutated.\n    //\n    // We won't do this if we're hydrating server-rendered content, because if\n    // the content is stale, it's already visible anyway. Instead we'll patch\n    // it up in a passive effect.\n\n\n    var root = getWorkInProgressRoot();\n\n    if (root === null) {\n      throw new Error('Expected a work-in-progress root. This is a bug in React. Please file an issue.');\n    }\n\n    if (!includesBlockingLane(root, renderLanes)) {\n      pushStoreConsistencyCheck(fiber, getSnapshot, nextSnapshot);\n    }\n  } // Read the current snapshot from the store on every render. This breaks the\n  // normal rules of React, and only works because store updates are\n  // always synchronous.\n\n\n  hook.memoizedState = nextSnapshot;\n  var inst = {\n    value: nextSnapshot,\n    getSnapshot: getSnapshot\n  };\n  hook.queue = inst; // Schedule an effect to subscribe to the store.\n\n  mountEffect(subscribeToStore.bind(null, fiber, inst, subscribe), [subscribe]); // Schedule an effect to update the mutable instance fields. We will update\n  // this whenever subscribe, getSnapshot, or value changes. Because there's no\n  // clean-up function, and we track the deps correctly, we can call pushEffect\n  // directly, without storing any additional state. For the same reason, we\n  // don't need to set a static flag, either.\n  // TODO: We can move this to the passive phase once we add a pre-commit\n  // consistency check. See the next comment.\n\n  fiber.flags |= Passive;\n  pushEffect(HasEffect | Passive$1, updateStoreInstance.bind(null, fiber, inst, nextSnapshot, getSnapshot), undefined, null);\n  return nextSnapshot;\n}\n\nfunction updateSyncExternalStore(subscribe, getSnapshot, getServerSnapshot) {\n  var fiber = currentlyRenderingFiber$1;\n  var hook = updateWorkInProgressHook(); // Read the current snapshot from the store on every render. This breaks the\n  // normal rules of React, and only works because store updates are\n  // always synchronous.\n\n  var nextSnapshot = getSnapshot();\n\n  {\n    if (!didWarnUncachedGetSnapshot) {\n      var cachedSnapshot = getSnapshot();\n\n      if (!objectIs(nextSnapshot, cachedSnapshot)) {\n        error('The result of getSnapshot should be cached to avoid an infinite loop');\n\n        didWarnUncachedGetSnapshot = true;\n      }\n    }\n  }\n\n  var prevSnapshot = hook.memoizedState;\n  var snapshotChanged = !objectIs(prevSnapshot, nextSnapshot);\n\n  if (snapshotChanged) {\n    hook.memoizedState = nextSnapshot;\n    markWorkInProgressReceivedUpdate();\n  }\n\n  var inst = hook.queue;\n  updateEffect(subscribeToStore.bind(null, fiber, inst, subscribe), [subscribe]); // Whenever getSnapshot or subscribe changes, we need to check in the\n  // commit phase if there was an interleaved mutation. In concurrent mode\n  // this can happen all the time, but even in synchronous mode, an earlier\n  // effect may have mutated the store.\n\n  if (inst.getSnapshot !== getSnapshot || snapshotChanged || // Check if the susbcribe function changed. We can save some memory by\n  // checking whether we scheduled a subscription effect above.\n  workInProgressHook !== null && workInProgressHook.memoizedState.tag & HasEffect) {\n    fiber.flags |= Passive;\n    pushEffect(HasEffect | Passive$1, updateStoreInstance.bind(null, fiber, inst, nextSnapshot, getSnapshot), undefined, null); // Unless we're rendering a blocking lane, schedule a consistency check.\n    // Right before committing, we will walk the tree and check if any of the\n    // stores were mutated.\n\n    var root = getWorkInProgressRoot();\n\n    if (root === null) {\n      throw new Error('Expected a work-in-progress root. This is a bug in React. Please file an issue.');\n    }\n\n    if (!includesBlockingLane(root, renderLanes)) {\n      pushStoreConsistencyCheck(fiber, getSnapshot, nextSnapshot);\n    }\n  }\n\n  return nextSnapshot;\n}\n\nfunction pushStoreConsistencyCheck(fiber, getSnapshot, renderedSnapshot) {\n  fiber.flags |= StoreConsistency;\n  var check = {\n    getSnapshot: getSnapshot,\n    value: renderedSnapshot\n  };\n  var componentUpdateQueue = currentlyRenderingFiber$1.updateQueue;\n\n  if (componentUpdateQueue === null) {\n    componentUpdateQueue = createFunctionComponentUpdateQueue();\n    currentlyRenderingFiber$1.updateQueue = componentUpdateQueue;\n    componentUpdateQueue.stores = [check];\n  } else {\n    var stores = componentUpdateQueue.stores;\n\n    if (stores === null) {\n      componentUpdateQueue.stores = [check];\n    } else {\n      stores.push(check);\n    }\n  }\n}\n\nfunction updateStoreInstance(fiber, inst, nextSnapshot, getSnapshot) {\n  // These are updated in the passive phase\n  inst.value = nextSnapshot;\n  inst.getSnapshot = getSnapshot; // Something may have been mutated in between render and commit. This could\n  // have been in an event that fired before the passive effects, or it could\n  // have been in a layout effect. In that case, we would have used the old\n  // snapsho and getSnapshot values to bail out. We need to check one more time.\n\n  if (checkIfSnapshotChanged(inst)) {\n    // Force a re-render.\n    forceStoreRerender(fiber);\n  }\n}\n\nfunction subscribeToStore(fiber, inst, subscribe) {\n  var handleStoreChange = function () {\n    // The store changed. Check if the snapshot changed since the last time we\n    // read from the store.\n    if (checkIfSnapshotChanged(inst)) {\n      // Force a re-render.\n      forceStoreRerender(fiber);\n    }\n  }; // Subscribe to the store and return a clean-up function.\n\n\n  return subscribe(handleStoreChange);\n}\n\nfunction checkIfSnapshotChanged(inst) {\n  var latestGetSnapshot = inst.getSnapshot;\n  var prevValue = inst.value;\n\n  try {\n    var nextValue = latestGetSnapshot();\n    return !objectIs(prevValue, nextValue);\n  } catch (error) {\n    return true;\n  }\n}\n\nfunction forceStoreRerender(fiber) {\n  var root = enqueueConcurrentRenderForLane(fiber, SyncLane);\n\n  if (root !== null) {\n    scheduleUpdateOnFiber(root, fiber, SyncLane, NoTimestamp);\n  }\n}\n\nfunction mountState(initialState) {\n  var hook = mountWorkInProgressHook();\n\n  if (typeof initialState === 'function') {\n    // $FlowFixMe: Flow doesn't like mixed types\n    initialState = initialState();\n  }\n\n  hook.memoizedState = hook.baseState = initialState;\n  var queue = {\n    pending: null,\n    interleaved: null,\n    lanes: NoLanes,\n    dispatch: null,\n    lastRenderedReducer: basicStateReducer,\n    lastRenderedState: initialState\n  };\n  hook.queue = queue;\n  var dispatch = queue.dispatch = dispatchSetState.bind(null, currentlyRenderingFiber$1, queue);\n  return [hook.memoizedState, dispatch];\n}\n\nfunction updateState(initialState) {\n  return updateReducer(basicStateReducer);\n}\n\nfunction rerenderState(initialState) {\n  return rerenderReducer(basicStateReducer);\n}\n\nfunction pushEffect(tag, create, destroy, deps) {\n  var effect = {\n    tag: tag,\n    create: create,\n    destroy: destroy,\n    deps: deps,\n    // Circular\n    next: null\n  };\n  var componentUpdateQueue = currentlyRenderingFiber$1.updateQueue;\n\n  if (componentUpdateQueue === null) {\n    componentUpdateQueue = createFunctionComponentUpdateQueue();\n    currentlyRenderingFiber$1.updateQueue = componentUpdateQueue;\n    componentUpdateQueue.lastEffect = effect.next = effect;\n  } else {\n    var lastEffect = componentUpdateQueue.lastEffect;\n\n    if (lastEffect === null) {\n      componentUpdateQueue.lastEffect = effect.next = effect;\n    } else {\n      var firstEffect = lastEffect.next;\n      lastEffect.next = effect;\n      effect.next = firstEffect;\n      componentUpdateQueue.lastEffect = effect;\n    }\n  }\n\n  return effect;\n}\n\nfunction mountRef(initialValue) {\n  var hook = mountWorkInProgressHook();\n\n  {\n    var _ref2 = {\n      current: initialValue\n    };\n    hook.memoizedState = _ref2;\n    return _ref2;\n  }\n}\n\nfunction updateRef(initialValue) {\n  var hook = updateWorkInProgressHook();\n  return hook.memoizedState;\n}\n\nfunction mountEffectImpl(fiberFlags, hookFlags, create, deps) {\n  var hook = mountWorkInProgressHook();\n  var nextDeps = deps === undefined ? null : deps;\n  currentlyRenderingFiber$1.flags |= fiberFlags;\n  hook.memoizedState = pushEffect(HasEffect | hookFlags, create, undefined, nextDeps);\n}\n\nfunction updateEffectImpl(fiberFlags, hookFlags, create, deps) {\n  var hook = updateWorkInProgressHook();\n  var nextDeps = deps === undefined ? null : deps;\n  var destroy = undefined;\n\n  if (currentHook !== null) {\n    var prevEffect = currentHook.memoizedState;\n    destroy = prevEffect.destroy;\n\n    if (nextDeps !== null) {\n      var prevDeps = prevEffect.deps;\n\n      if (areHookInputsEqual(nextDeps, prevDeps)) {\n        hook.memoizedState = pushEffect(hookFlags, create, destroy, nextDeps);\n        return;\n      }\n    }\n  }\n\n  currentlyRenderingFiber$1.flags |= fiberFlags;\n  hook.memoizedState = pushEffect(HasEffect | hookFlags, create, destroy, nextDeps);\n}\n\nfunction mountEffect(create, deps) {\n  if ( (currentlyRenderingFiber$1.mode & StrictEffectsMode) !== NoMode) {\n    return mountEffectImpl(MountPassiveDev | Passive | PassiveStatic, Passive$1, create, deps);\n  } else {\n    return mountEffectImpl(Passive | PassiveStatic, Passive$1, create, deps);\n  }\n}\n\nfunction updateEffect(create, deps) {\n  return updateEffectImpl(Passive, Passive$1, create, deps);\n}\n\nfunction mountInsertionEffect(create, deps) {\n  return mountEffectImpl(Update, Insertion, create, deps);\n}\n\nfunction updateInsertionEffect(create, deps) {\n  return updateEffectImpl(Update, Insertion, create, deps);\n}\n\nfunction mountLayoutEffect(create, deps) {\n  var fiberFlags = Update;\n\n  {\n    fiberFlags |= LayoutStatic;\n  }\n\n  if ( (currentlyRenderingFiber$1.mode & StrictEffectsMode) !== NoMode) {\n    fiberFlags |= MountLayoutDev;\n  }\n\n  return mountEffectImpl(fiberFlags, Layout, create, deps);\n}\n\nfunction updateLayoutEffect(create, deps) {\n  return updateEffectImpl(Update, Layout, create, deps);\n}\n\nfunction imperativeHandleEffect(create, ref) {\n  if (typeof ref === 'function') {\n    var refCallback = ref;\n\n    var _inst = create();\n\n    refCallback(_inst);\n    return function () {\n      refCallback(null);\n    };\n  } else if (ref !== null && ref !== undefined) {\n    var refObject = ref;\n\n    {\n      if (!refObject.hasOwnProperty('current')) {\n        error('Expected useImperativeHandle() first argument to either be a ' + 'ref callback or React.createRef() object. Instead received: %s.', 'an object with keys {' + Object.keys(refObject).join(', ') + '}');\n      }\n    }\n\n    var _inst2 = create();\n\n    refObject.current = _inst2;\n    return function () {\n      refObject.current = null;\n    };\n  }\n}\n\nfunction mountImperativeHandle(ref, create, deps) {\n  {\n    if (typeof create !== 'function') {\n      error('Expected useImperativeHandle() second argument to be a function ' + 'that creates a handle. Instead received: %s.', create !== null ? typeof create : 'null');\n    }\n  } // TODO: If deps are provided, should we skip comparing the ref itself?\n\n\n  var effectDeps = deps !== null && deps !== undefined ? deps.concat([ref]) : null;\n  var fiberFlags = Update;\n\n  {\n    fiberFlags |= LayoutStatic;\n  }\n\n  if ( (currentlyRenderingFiber$1.mode & StrictEffectsMode) !== NoMode) {\n    fiberFlags |= MountLayoutDev;\n  }\n\n  return mountEffectImpl(fiberFlags, Layout, imperativeHandleEffect.bind(null, create, ref), effectDeps);\n}\n\nfunction updateImperativeHandle(ref, create, deps) {\n  {\n    if (typeof create !== 'function') {\n      error('Expected useImperativeHandle() second argument to be a function ' + 'that creates a handle. Instead received: %s.', create !== null ? typeof create : 'null');\n    }\n  } // TODO: If deps are provided, should we skip comparing the ref itself?\n\n\n  var effectDeps = deps !== null && deps !== undefined ? deps.concat([ref]) : null;\n  return updateEffectImpl(Update, Layout, imperativeHandleEffect.bind(null, create, ref), effectDeps);\n}\n\nfunction mountDebugValue(value, formatterFn) {// This hook is normally a no-op.\n  // The react-debug-hooks package injects its own implementation\n  // so that e.g. DevTools can display custom hook values.\n}\n\nvar updateDebugValue = mountDebugValue;\n\nfunction mountCallback(callback, deps) {\n  var hook = mountWorkInProgressHook();\n  var nextDeps = deps === undefined ? null : deps;\n  hook.memoizedState = [callback, nextDeps];\n  return callback;\n}\n\nfunction updateCallback(callback, deps) {\n  var hook = updateWorkInProgressHook();\n  var nextDeps = deps === undefined ? null : deps;\n  var prevState = hook.memoizedState;\n\n  if (prevState !== null) {\n    if (nextDeps !== null) {\n      var prevDeps = prevState[1];\n\n      if (areHookInputsEqual(nextDeps, prevDeps)) {\n        return prevState[0];\n      }\n    }\n  }\n\n  hook.memoizedState = [callback, nextDeps];\n  return callback;\n}\n\nfunction mountMemo(nextCreate, deps) {\n  var hook = mountWorkInProgressHook();\n  var nextDeps = deps === undefined ? null : deps;\n  var nextValue = nextCreate();\n  hook.memoizedState = [nextValue, nextDeps];\n  return nextValue;\n}\n\nfunction updateMemo(nextCreate, deps) {\n  var hook = updateWorkInProgressHook();\n  var nextDeps = deps === undefined ? null : deps;\n  var prevState = hook.memoizedState;\n\n  if (prevState !== null) {\n    // Assume these are defined. If they're not, areHookInputsEqual will warn.\n    if (nextDeps !== null) {\n      var prevDeps = prevState[1];\n\n      if (areHookInputsEqual(nextDeps, prevDeps)) {\n        return prevState[0];\n      }\n    }\n  }\n\n  var nextValue = nextCreate();\n  hook.memoizedState = [nextValue, nextDeps];\n  return nextValue;\n}\n\nfunction mountDeferredValue(value) {\n  var hook = mountWorkInProgressHook();\n  hook.memoizedState = value;\n  return value;\n}\n\nfunction updateDeferredValue(value) {\n  var hook = updateWorkInProgressHook();\n  var resolvedCurrentHook = currentHook;\n  var prevValue = resolvedCurrentHook.memoizedState;\n  return updateDeferredValueImpl(hook, prevValue, value);\n}\n\nfunction rerenderDeferredValue(value) {\n  var hook = updateWorkInProgressHook();\n\n  if (currentHook === null) {\n    // This is a rerender during a mount.\n    hook.memoizedState = value;\n    return value;\n  } else {\n    // This is a rerender during an update.\n    var prevValue = currentHook.memoizedState;\n    return updateDeferredValueImpl(hook, prevValue, value);\n  }\n}\n\nfunction updateDeferredValueImpl(hook, prevValue, value) {\n  var shouldDeferValue = !includesOnlyNonUrgentLanes(renderLanes);\n\n  if (shouldDeferValue) {\n    // This is an urgent update. If the value has changed, keep using the\n    // previous value and spawn a deferred render to update it later.\n    if (!objectIs(value, prevValue)) {\n      // Schedule a deferred render\n      var deferredLane = claimNextTransitionLane();\n      currentlyRenderingFiber$1.lanes = mergeLanes(currentlyRenderingFiber$1.lanes, deferredLane);\n      markSkippedUpdateLanes(deferredLane); // Set this to true to indicate that the rendered value is inconsistent\n      // from the latest value. The name \"baseState\" doesn't really match how we\n      // use it because we're reusing a state hook field instead of creating a\n      // new one.\n\n      hook.baseState = true;\n    } // Reuse the previous value\n\n\n    return prevValue;\n  } else {\n    // This is not an urgent update, so we can use the latest value regardless\n    // of what it is. No need to defer it.\n    // However, if we're currently inside a spawned render, then we need to mark\n    // this as an update to prevent the fiber from bailing out.\n    //\n    // `baseState` is true when the current value is different from the rendered\n    // value. The name doesn't really match how we use it because we're reusing\n    // a state hook field instead of creating a new one.\n    if (hook.baseState) {\n      // Flip this back to false.\n      hook.baseState = false;\n      markWorkInProgressReceivedUpdate();\n    }\n\n    hook.memoizedState = value;\n    return value;\n  }\n}\n\nfunction startTransition(setPending, callback, options) {\n  var previousPriority = getCurrentUpdatePriority();\n  setCurrentUpdatePriority(higherEventPriority(previousPriority, ContinuousEventPriority));\n  setPending(true);\n  var prevTransition = ReactCurrentBatchConfig$2.transition;\n  ReactCurrentBatchConfig$2.transition = {};\n  var currentTransition = ReactCurrentBatchConfig$2.transition;\n\n  {\n    ReactCurrentBatchConfig$2.transition._updatedFibers = new Set();\n  }\n\n  try {\n    setPending(false);\n    callback();\n  } finally {\n    setCurrentUpdatePriority(previousPriority);\n    ReactCurrentBatchConfig$2.transition = prevTransition;\n\n    {\n      if (prevTransition === null && currentTransition._updatedFibers) {\n        var updatedFibersCount = currentTransition._updatedFibers.size;\n\n        if (updatedFibersCount > 10) {\n          warn('Detected a large number of updates inside startTransition. ' + 'If this is due to a subscription please re-write it to use React provided hooks. ' + 'Otherwise concurrent mode guarantees are off the table.');\n        }\n\n        currentTransition._updatedFibers.clear();\n      }\n    }\n  }\n}\n\nfunction mountTransition() {\n  var _mountState = mountState(false),\n      isPending = _mountState[0],\n      setPending = _mountState[1]; // The `start` method never changes.\n\n\n  var start = startTransition.bind(null, setPending);\n  var hook = mountWorkInProgressHook();\n  hook.memoizedState = start;\n  return [isPending, start];\n}\n\nfunction updateTransition() {\n  var _updateState = updateState(),\n      isPending = _updateState[0];\n\n  var hook = updateWorkInProgressHook();\n  var start = hook.memoizedState;\n  return [isPending, start];\n}\n\nfunction rerenderTransition() {\n  var _rerenderState = rerenderState(),\n      isPending = _rerenderState[0];\n\n  var hook = updateWorkInProgressHook();\n  var start = hook.memoizedState;\n  return [isPending, start];\n}\n\nvar isUpdatingOpaqueValueInRenderPhase = false;\nfunction getIsUpdatingOpaqueValueInRenderPhaseInDEV() {\n  {\n    return isUpdatingOpaqueValueInRenderPhase;\n  }\n}\n\nfunction mountId() {\n  var hook = mountWorkInProgressHook();\n  var root = getWorkInProgressRoot(); // TODO: In Fizz, id generation is specific to each server config. Maybe we\n  // should do this in Fiber, too? Deferring this decision for now because\n  // there's no other place to store the prefix except for an internal field on\n  // the public createRoot object, which the fiber tree does not currently have\n  // a reference to.\n\n  var identifierPrefix = root.identifierPrefix;\n  var id;\n\n  if (getIsHydrating()) {\n    var treeId = getTreeId(); // Use a captial R prefix for server-generated ids.\n\n    id = ':' + identifierPrefix + 'R' + treeId; // Unless this is the first id at this level, append a number at the end\n    // that represents the position of this useId hook among all the useId\n    // hooks for this fiber.\n\n    var localId = localIdCounter++;\n\n    if (localId > 0) {\n      id += 'H' + localId.toString(32);\n    }\n\n    id += ':';\n  } else {\n    // Use a lowercase r prefix for client-generated ids.\n    var globalClientId = globalClientIdCounter++;\n    id = ':' + identifierPrefix + 'r' + globalClientId.toString(32) + ':';\n  }\n\n  hook.memoizedState = id;\n  return id;\n}\n\nfunction updateId() {\n  var hook = updateWorkInProgressHook();\n  var id = hook.memoizedState;\n  return id;\n}\n\nfunction dispatchReducerAction(fiber, queue, action) {\n  {\n    if (typeof arguments[3] === 'function') {\n      error(\"State updates from the useState() and useReducer() Hooks don't support the \" + 'second callback argument. To execute a side effect after ' + 'rendering, declare it in the component body with useEffect().');\n    }\n  }\n\n  var lane = requestUpdateLane(fiber);\n  var update = {\n    lane: lane,\n    action: action,\n    hasEagerState: false,\n    eagerState: null,\n    next: null\n  };\n\n  if (isRenderPhaseUpdate(fiber)) {\n    enqueueRenderPhaseUpdate(queue, update);\n  } else {\n    var root = enqueueConcurrentHookUpdate(fiber, queue, update, lane);\n\n    if (root !== null) {\n      var eventTime = requestEventTime();\n      scheduleUpdateOnFiber(root, fiber, lane, eventTime);\n      entangleTransitionUpdate(root, queue, lane);\n    }\n  }\n\n  markUpdateInDevTools(fiber, lane);\n}\n\nfunction dispatchSetState(fiber, queue, action) {\n  {\n    if (typeof arguments[3] === 'function') {\n      error(\"State updates from the useState() and useReducer() Hooks don't support the \" + 'second callback argument. To execute a side effect after ' + 'rendering, declare it in the component body with useEffect().');\n    }\n  }\n\n  var lane = requestUpdateLane(fiber);\n  var update = {\n    lane: lane,\n    action: action,\n    hasEagerState: false,\n    eagerState: null,\n    next: null\n  };\n\n  if (isRenderPhaseUpdate(fiber)) {\n    enqueueRenderPhaseUpdate(queue, update);\n  } else {\n    var alternate = fiber.alternate;\n\n    if (fiber.lanes === NoLanes && (alternate === null || alternate.lanes === NoLanes)) {\n      // The queue is currently empty, which means we can eagerly compute the\n      // next state before entering the render phase. If the new state is the\n      // same as the current state, we may be able to bail out entirely.\n      var lastRenderedReducer = queue.lastRenderedReducer;\n\n      if (lastRenderedReducer !== null) {\n        var prevDispatcher;\n\n        {\n          prevDispatcher = ReactCurrentDispatcher$1.current;\n          ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnUpdateInDEV;\n        }\n\n        try {\n          var currentState = queue.lastRenderedState;\n          var eagerState = lastRenderedReducer(currentState, action); // Stash the eagerly computed state, and the reducer used to compute\n          // it, on the update object. If the reducer hasn't changed by the\n          // time we enter the render phase, then the eager state can be used\n          // without calling the reducer again.\n\n          update.hasEagerState = true;\n          update.eagerState = eagerState;\n\n          if (objectIs(eagerState, currentState)) {\n            // Fast path. We can bail out without scheduling React to re-render.\n            // It's still possible that we'll need to rebase this update later,\n            // if the component re-renders for a different reason and by that\n            // time the reducer has changed.\n            // TODO: Do we still need to entangle transitions in this case?\n            enqueueConcurrentHookUpdateAndEagerlyBailout(fiber, queue, update, lane);\n            return;\n          }\n        } catch (error) {// Suppress the error. It will throw again in the render phase.\n        } finally {\n          {\n            ReactCurrentDispatcher$1.current = prevDispatcher;\n          }\n        }\n      }\n    }\n\n    var root = enqueueConcurrentHookUpdate(fiber, queue, update, lane);\n\n    if (root !== null) {\n      var eventTime = requestEventTime();\n      scheduleUpdateOnFiber(root, fiber, lane, eventTime);\n      entangleTransitionUpdate(root, queue, lane);\n    }\n  }\n\n  markUpdateInDevTools(fiber, lane);\n}\n\nfunction isRenderPhaseUpdate(fiber) {\n  var alternate = fiber.alternate;\n  return fiber === currentlyRenderingFiber$1 || alternate !== null && alternate === currentlyRenderingFiber$1;\n}\n\nfunction enqueueRenderPhaseUpdate(queue, update) {\n  // This is a render phase update. Stash it in a lazily-created map of\n  // queue -> linked list of updates. After this render pass, we'll restart\n  // and apply the stashed updates on top of the work-in-progress hook.\n  didScheduleRenderPhaseUpdateDuringThisPass = didScheduleRenderPhaseUpdate = true;\n  var pending = queue.pending;\n\n  if (pending === null) {\n    // This is the first update. Create a circular list.\n    update.next = update;\n  } else {\n    update.next = pending.next;\n    pending.next = update;\n  }\n\n  queue.pending = update;\n} // TODO: Move to ReactFiberConcurrentUpdates?\n\n\nfunction entangleTransitionUpdate(root, queue, lane) {\n  if (isTransitionLane(lane)) {\n    var queueLanes = queue.lanes; // If any entangled lanes are no longer pending on the root, then they\n    // must have finished. We can remove them from the shared queue, which\n    // represents a superset of the actually pending lanes. In some cases we\n    // may entangle more than we need to, but that's OK. In fact it's worse if\n    // we *don't* entangle when we should.\n\n    queueLanes = intersectLanes(queueLanes, root.pendingLanes); // Entangle the new transition lane with the other transition lanes.\n\n    var newQueueLanes = mergeLanes(queueLanes, lane);\n    queue.lanes = newQueueLanes; // Even if queue.lanes already include lane, we don't know for certain if\n    // the lane finished since the last time we entangled it. So we need to\n    // entangle it again, just to be sure.\n\n    markRootEntangled(root, newQueueLanes);\n  }\n}\n\nfunction markUpdateInDevTools(fiber, lane, action) {\n\n  {\n    markStateUpdateScheduled(fiber, lane);\n  }\n}\n\nvar ContextOnlyDispatcher = {\n  readContext: readContext,\n  useCallback: throwInvalidHookError,\n  useContext: throwInvalidHookError,\n  useEffect: throwInvalidHookError,\n  useImperativeHandle: throwInvalidHookError,\n  useInsertionEffect: throwInvalidHookError,\n  useLayoutEffect: throwInvalidHookError,\n  useMemo: throwInvalidHookError,\n  useReducer: throwInvalidHookError,\n  useRef: throwInvalidHookError,\n  useState: throwInvalidHookError,\n  useDebugValue: throwInvalidHookError,\n  useDeferredValue: throwInvalidHookError,\n  useTransition: throwInvalidHookError,\n  useMutableSource: throwInvalidHookError,\n  useSyncExternalStore: throwInvalidHookError,\n  useId: throwInvalidHookError,\n  unstable_isNewReconciler: enableNewReconciler\n};\n\nvar HooksDispatcherOnMountInDEV = null;\nvar HooksDispatcherOnMountWithHookTypesInDEV = null;\nvar HooksDispatcherOnUpdateInDEV = null;\nvar HooksDispatcherOnRerenderInDEV = null;\nvar InvalidNestedHooksDispatcherOnMountInDEV = null;\nvar InvalidNestedHooksDispatcherOnUpdateInDEV = null;\nvar InvalidNestedHooksDispatcherOnRerenderInDEV = null;\n\n{\n  var warnInvalidContextAccess = function () {\n    error('Context can only be read while React is rendering. ' + 'In classes, you can read it in the render method or getDerivedStateFromProps. ' + 'In function components, you can read it directly in the function body, but not ' + 'inside Hooks like useReducer() or useMemo().');\n  };\n\n  var warnInvalidHookAccess = function () {\n    error('Do not call Hooks inside useEffect(...), useMemo(...), or other built-in Hooks. ' + 'You can only call Hooks at the top level of your React function. ' + 'For more information, see ' + 'https://reactjs.org/link/rules-of-hooks');\n  };\n\n  HooksDispatcherOnMountInDEV = {\n    readContext: function (context) {\n      return readContext(context);\n    },\n    useCallback: function (callback, deps) {\n      currentHookNameInDev = 'useCallback';\n      mountHookTypesDev();\n      checkDepsAreArrayDev(deps);\n      return mountCallback(callback, deps);\n    },\n    useContext: function (context) {\n      currentHookNameInDev = 'useContext';\n      mountHookTypesDev();\n      return readContext(context);\n    },\n    useEffect: function (create, deps) {\n      currentHookNameInDev = 'useEffect';\n      mountHookTypesDev();\n      checkDepsAreArrayDev(deps);\n      return mountEffect(create, deps);\n    },\n    useImperativeHandle: function (ref, create, deps) {\n      currentHookNameInDev = 'useImperativeHandle';\n      mountHookTypesDev();\n      checkDepsAreArrayDev(deps);\n      return mountImperativeHandle(ref, create, deps);\n    },\n    useInsertionEffect: function (create, deps) {\n      currentHookNameInDev = 'useInsertionEffect';\n      mountHookTypesDev();\n      checkDepsAreArrayDev(deps);\n      return mountInsertionEffect(create, deps);\n    },\n    useLayoutEffect: function (create, deps) {\n      currentHookNameInDev = 'useLayoutEffect';\n      mountHookTypesDev();\n      checkDepsAreArrayDev(deps);\n      return mountLayoutEffect(create, deps);\n    },\n    useMemo: function (create, deps) {\n      currentHookNameInDev = 'useMemo';\n      mountHookTypesDev();\n      checkDepsAreArrayDev(deps);\n      var prevDispatcher = ReactCurrentDispatcher$1.current;\n      ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnMountInDEV;\n\n      try {\n        return mountMemo(create, deps);\n      } finally {\n        ReactCurrentDispatcher$1.current = prevDispatcher;\n      }\n    },\n    useReducer: function (reducer, initialArg, init) {\n      currentHookNameInDev = 'useReducer';\n      mountHookTypesDev();\n      var prevDispatcher = ReactCurrentDispatcher$1.current;\n      ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnMountInDEV;\n\n      try {\n        return mountReducer(reducer, initialArg, init);\n      } finally {\n        ReactCurrentDispatcher$1.current = prevDispatcher;\n      }\n    },\n    useRef: function (initialValue) {\n      currentHookNameInDev = 'useRef';\n      mountHookTypesDev();\n      return mountRef(initialValue);\n    },\n    useState: function (initialState) {\n      currentHookNameInDev = 'useState';\n      mountHookTypesDev();\n      var prevDispatcher = ReactCurrentDispatcher$1.current;\n      ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnMountInDEV;\n\n      try {\n        return mountState(initialState);\n      } finally {\n        ReactCurrentDispatcher$1.current = prevDispatcher;\n      }\n    },\n    useDebugValue: function (value, formatterFn) {\n      currentHookNameInDev = 'useDebugValue';\n      mountHookTypesDev();\n      return mountDebugValue();\n    },\n    useDeferredValue: function (value) {\n      currentHookNameInDev = 'useDeferredValue';\n      mountHookTypesDev();\n      return mountDeferredValue(value);\n    },\n    useTransition: function () {\n      currentHookNameInDev = 'useTransition';\n      mountHookTypesDev();\n      return mountTransition();\n    },\n    useMutableSource: function (source, getSnapshot, subscribe) {\n      currentHookNameInDev = 'useMutableSource';\n      mountHookTypesDev();\n      return mountMutableSource();\n    },\n    useSyncExternalStore: function (subscribe, getSnapshot, getServerSnapshot) {\n      currentHookNameInDev = 'useSyncExternalStore';\n      mountHookTypesDev();\n      return mountSyncExternalStore(subscribe, getSnapshot, getServerSnapshot);\n    },\n    useId: function () {\n      currentHookNameInDev = 'useId';\n      mountHookTypesDev();\n      return mountId();\n    },\n    unstable_isNewReconciler: enableNewReconciler\n  };\n\n  HooksDispatcherOnMountWithHookTypesInDEV = {\n    readContext: function (context) {\n      return readContext(context);\n    },\n    useCallback: function (callback, deps) {\n      currentHookNameInDev = 'useCallback';\n      updateHookTypesDev();\n      return mountCallback(callback, deps);\n    },\n    useContext: function (context) {\n      currentHookNameInDev = 'useContext';\n      updateHookTypesDev();\n      return readContext(context);\n    },\n    useEffect: function (create, deps) {\n      currentHookNameInDev = 'useEffect';\n      updateHookTypesDev();\n      return mountEffect(create, deps);\n    },\n    useImperativeHandle: function (ref, create, deps) {\n      currentHookNameInDev = 'useImperativeHandle';\n      updateHookTypesDev();\n      return mountImperativeHandle(ref, create, deps);\n    },\n    useInsertionEffect: function (create, deps) {\n      currentHookNameInDev = 'useInsertionEffect';\n      updateHookTypesDev();\n      return mountInsertionEffect(create, deps);\n    },\n    useLayoutEffect: function (create, deps) {\n      currentHookNameInDev = 'useLayoutEffect';\n      updateHookTypesDev();\n      return mountLayoutEffect(create, deps);\n    },\n    useMemo: function (create, deps) {\n      currentHookNameInDev = 'useMemo';\n      updateHookTypesDev();\n      var prevDispatcher = ReactCurrentDispatcher$1.current;\n      ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnMountInDEV;\n\n      try {\n        return mountMemo(create, deps);\n      } finally {\n        ReactCurrentDispatcher$1.current = prevDispatcher;\n      }\n    },\n    useReducer: function (reducer, initialArg, init) {\n      currentHookNameInDev = 'useReducer';\n      updateHookTypesDev();\n      var prevDispatcher = ReactCurrentDispatcher$1.current;\n      ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnMountInDEV;\n\n      try {\n        return mountReducer(reducer, initialArg, init);\n      } finally {\n        ReactCurrentDispatcher$1.current = prevDispatcher;\n      }\n    },\n    useRef: function (initialValue) {\n      currentHookNameInDev = 'useRef';\n      updateHookTypesDev();\n      return mountRef(initialValue);\n    },\n    useState: function (initialState) {\n      currentHookNameInDev = 'useState';\n      updateHookTypesDev();\n      var prevDispatcher = ReactCurrentDispatcher$1.current;\n      ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnMountInDEV;\n\n      try {\n        return mountState(initialState);\n      } finally {\n        ReactCurrentDispatcher$1.current = prevDispatcher;\n      }\n    },\n    useDebugValue: function (value, formatterFn) {\n      currentHookNameInDev = 'useDebugValue';\n      updateHookTypesDev();\n      return mountDebugValue();\n    },\n    useDeferredValue: function (value) {\n      currentHookNameInDev = 'useDeferredValue';\n      updateHookTypesDev();\n      return mountDeferredValue(value);\n    },\n    useTransition: function () {\n      currentHookNameInDev = 'useTransition';\n      updateHookTypesDev();\n      return mountTransition();\n    },\n    useMutableSource: function (source, getSnapshot, subscribe) {\n      currentHookNameInDev = 'useMutableSource';\n      updateHookTypesDev();\n      return mountMutableSource();\n    },\n    useSyncExternalStore: function (subscribe, getSnapshot, getServerSnapshot) {\n      currentHookNameInDev = 'useSyncExternalStore';\n      updateHookTypesDev();\n      return mountSyncExternalStore(subscribe, getSnapshot, getServerSnapshot);\n    },\n    useId: function () {\n      currentHookNameInDev = 'useId';\n      updateHookTypesDev();\n      return mountId();\n    },\n    unstable_isNewReconciler: enableNewReconciler\n  };\n\n  HooksDispatcherOnUpdateInDEV = {\n    readContext: function (context) {\n      return readContext(context);\n    },\n    useCallback: function (callback, deps) {\n      currentHookNameInDev = 'useCallback';\n      updateHookTypesDev();\n      return updateCallback(callback, deps);\n    },\n    useContext: function (context) {\n      currentHookNameInDev = 'useContext';\n      updateHookTypesDev();\n      return readContext(context);\n    },\n    useEffect: function (create, deps) {\n      currentHookNameInDev = 'useEffect';\n      updateHookTypesDev();\n      return updateEffect(create, deps);\n    },\n    useImperativeHandle: function (ref, create, deps) {\n      currentHookNameInDev = 'useImperativeHandle';\n      updateHookTypesDev();\n      return updateImperativeHandle(ref, create, deps);\n    },\n    useInsertionEffect: function (create, deps) {\n      currentHookNameInDev = 'useInsertionEffect';\n      updateHookTypesDev();\n      return updateInsertionEffect(create, deps);\n    },\n    useLayoutEffect: function (create, deps) {\n      currentHookNameInDev = 'useLayoutEffect';\n      updateHookTypesDev();\n      return updateLayoutEffect(create, deps);\n    },\n    useMemo: function (create, deps) {\n      currentHookNameInDev = 'useMemo';\n      updateHookTypesDev();\n      var prevDispatcher = ReactCurrentDispatcher$1.current;\n      ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnUpdateInDEV;\n\n      try {\n        return updateMemo(create, deps);\n      } finally {\n        ReactCurrentDispatcher$1.current = prevDispatcher;\n      }\n    },\n    useReducer: function (reducer, initialArg, init) {\n      currentHookNameInDev = 'useReducer';\n      updateHookTypesDev();\n      var prevDispatcher = ReactCurrentDispatcher$1.current;\n      ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnUpdateInDEV;\n\n      try {\n        return updateReducer(reducer, initialArg, init);\n      } finally {\n        ReactCurrentDispatcher$1.current = prevDispatcher;\n      }\n    },\n    useRef: function (initialValue) {\n      currentHookNameInDev = 'useRef';\n      updateHookTypesDev();\n      return updateRef();\n    },\n    useState: function (initialState) {\n      currentHookNameInDev = 'useState';\n      updateHookTypesDev();\n      var prevDispatcher = ReactCurrentDispatcher$1.current;\n      ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnUpdateInDEV;\n\n      try {\n        return updateState(initialState);\n      } finally {\n        ReactCurrentDispatcher$1.current = prevDispatcher;\n      }\n    },\n    useDebugValue: function (value, formatterFn) {\n      currentHookNameInDev = 'useDebugValue';\n      updateHookTypesDev();\n      return updateDebugValue();\n    },\n    useDeferredValue: function (value) {\n      currentHookNameInDev = 'useDeferredValue';\n      updateHookTypesDev();\n      return updateDeferredValue(value);\n    },\n    useTransition: function () {\n      currentHookNameInDev = 'useTransition';\n      updateHookTypesDev();\n      return updateTransition();\n    },\n    useMutableSource: function (source, getSnapshot, subscribe) {\n      currentHookNameInDev = 'useMutableSource';\n      updateHookTypesDev();\n      return updateMutableSource();\n    },\n    useSyncExternalStore: function (subscribe, getSnapshot, getServerSnapshot) {\n      currentHookNameInDev = 'useSyncExternalStore';\n      updateHookTypesDev();\n      return updateSyncExternalStore(subscribe, getSnapshot);\n    },\n    useId: function () {\n      currentHookNameInDev = 'useId';\n      updateHookTypesDev();\n      return updateId();\n    },\n    unstable_isNewReconciler: enableNewReconciler\n  };\n\n  HooksDispatcherOnRerenderInDEV = {\n    readContext: function (context) {\n      return readContext(context);\n    },\n    useCallback: function (callback, deps) {\n      currentHookNameInDev = 'useCallback';\n      updateHookTypesDev();\n      return updateCallback(callback, deps);\n    },\n    useContext: function (context) {\n      currentHookNameInDev = 'useContext';\n      updateHookTypesDev();\n      return readContext(context);\n    },\n    useEffect: function (create, deps) {\n      currentHookNameInDev = 'useEffect';\n      updateHookTypesDev();\n      return updateEffect(create, deps);\n    },\n    useImperativeHandle: function (ref, create, deps) {\n      currentHookNameInDev = 'useImperativeHandle';\n      updateHookTypesDev();\n      return updateImperativeHandle(ref, create, deps);\n    },\n    useInsertionEffect: function (create, deps) {\n      currentHookNameInDev = 'useInsertionEffect';\n      updateHookTypesDev();\n      return updateInsertionEffect(create, deps);\n    },\n    useLayoutEffect: function (create, deps) {\n      currentHookNameInDev = 'useLayoutEffect';\n      updateHookTypesDev();\n      return updateLayoutEffect(create, deps);\n    },\n    useMemo: function (create, deps) {\n      currentHookNameInDev = 'useMemo';\n      updateHookTypesDev();\n      var prevDispatcher = ReactCurrentDispatcher$1.current;\n      ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnRerenderInDEV;\n\n      try {\n        return updateMemo(create, deps);\n      } finally {\n        ReactCurrentDispatcher$1.current = prevDispatcher;\n      }\n    },\n    useReducer: function (reducer, initialArg, init) {\n      currentHookNameInDev = 'useReducer';\n      updateHookTypesDev();\n      var prevDispatcher = ReactCurrentDispatcher$1.current;\n      ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnRerenderInDEV;\n\n      try {\n        return rerenderReducer(reducer, initialArg, init);\n      } finally {\n        ReactCurrentDispatcher$1.current = prevDispatcher;\n      }\n    },\n    useRef: function (initialValue) {\n      currentHookNameInDev = 'useRef';\n      updateHookTypesDev();\n      return updateRef();\n    },\n    useState: function (initialState) {\n      currentHookNameInDev = 'useState';\n      updateHookTypesDev();\n      var prevDispatcher = ReactCurrentDispatcher$1.current;\n      ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnRerenderInDEV;\n\n      try {\n        return rerenderState(initialState);\n      } finally {\n        ReactCurrentDispatcher$1.current = prevDispatcher;\n      }\n    },\n    useDebugValue: function (value, formatterFn) {\n      currentHookNameInDev = 'useDebugValue';\n      updateHookTypesDev();\n      return updateDebugValue();\n    },\n    useDeferredValue: function (value) {\n      currentHookNameInDev = 'useDeferredValue';\n      updateHookTypesDev();\n      return rerenderDeferredValue(value);\n    },\n    useTransition: function () {\n      currentHookNameInDev = 'useTransition';\n      updateHookTypesDev();\n      return rerenderTransition();\n    },\n    useMutableSource: function (source, getSnapshot, subscribe) {\n      currentHookNameInDev = 'useMutableSource';\n      updateHookTypesDev();\n      return updateMutableSource();\n    },\n    useSyncExternalStore: function (subscribe, getSnapshot, getServerSnapshot) {\n      currentHookNameInDev = 'useSyncExternalStore';\n      updateHookTypesDev();\n      return updateSyncExternalStore(subscribe, getSnapshot);\n    },\n    useId: function () {\n      currentHookNameInDev = 'useId';\n      updateHookTypesDev();\n      return updateId();\n    },\n    unstable_isNewReconciler: enableNewReconciler\n  };\n\n  InvalidNestedHooksDispatcherOnMountInDEV = {\n    readContext: function (context) {\n      warnInvalidContextAccess();\n      return readContext(context);\n    },\n    useCallback: function (callback, deps) {\n      currentHookNameInDev = 'useCallback';\n      warnInvalidHookAccess();\n      mountHookTypesDev();\n      return mountCallback(callback, deps);\n    },\n    useContext: function (context) {\n      currentHookNameInDev = 'useContext';\n      warnInvalidHookAccess();\n      mountHookTypesDev();\n      return readContext(context);\n    },\n    useEffect: function (create, deps) {\n      currentHookNameInDev = 'useEffect';\n      warnInvalidHookAccess();\n      mountHookTypesDev();\n      return mountEffect(create, deps);\n    },\n    useImperativeHandle: function (ref, create, deps) {\n      currentHookNameInDev = 'useImperativeHandle';\n      warnInvalidHookAccess();\n      mountHookTypesDev();\n      return mountImperativeHandle(ref, create, deps);\n    },\n    useInsertionEffect: function (create, deps) {\n      currentHookNameInDev = 'useInsertionEffect';\n      warnInvalidHookAccess();\n      mountHookTypesDev();\n      return mountInsertionEffect(create, deps);\n    },\n    useLayoutEffect: function (create, deps) {\n      currentHookNameInDev = 'useLayoutEffect';\n      warnInvalidHookAccess();\n      mountHookTypesDev();\n      return mountLayoutEffect(create, deps);\n    },\n    useMemo: function (create, deps) {\n      currentHookNameInDev = 'useMemo';\n      warnInvalidHookAccess();\n      mountHookTypesDev();\n      var prevDispatcher = ReactCurrentDispatcher$1.current;\n      ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnMountInDEV;\n\n      try {\n        return mountMemo(create, deps);\n      } finally {\n        ReactCurrentDispatcher$1.current = prevDispatcher;\n      }\n    },\n    useReducer: function (reducer, initialArg, init) {\n      currentHookNameInDev = 'useReducer';\n      warnInvalidHookAccess();\n      mountHookTypesDev();\n      var prevDispatcher = ReactCurrentDispatcher$1.current;\n      ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnMountInDEV;\n\n      try {\n        return mountReducer(reducer, initialArg, init);\n      } finally {\n        ReactCurrentDispatcher$1.current = prevDispatcher;\n      }\n    },\n    useRef: function (initialValue) {\n      currentHookNameInDev = 'useRef';\n      warnInvalidHookAccess();\n      mountHookTypesDev();\n      return mountRef(initialValue);\n    },\n    useState: function (initialState) {\n      currentHookNameInDev = 'useState';\n      warnInvalidHookAccess();\n      mountHookTypesDev();\n      var prevDispatcher = ReactCurrentDispatcher$1.current;\n      ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnMountInDEV;\n\n      try {\n        return mountState(initialState);\n      } finally {\n        ReactCurrentDispatcher$1.current = prevDispatcher;\n      }\n    },\n    useDebugValue: function (value, formatterFn) {\n      currentHookNameInDev = 'useDebugValue';\n      warnInvalidHookAccess();\n      mountHookTypesDev();\n      return mountDebugValue();\n    },\n    useDeferredValue: function (value) {\n      currentHookNameInDev = 'useDeferredValue';\n      warnInvalidHookAccess();\n      mountHookTypesDev();\n      return mountDeferredValue(value);\n    },\n    useTransition: function () {\n      currentHookNameInDev = 'useTransition';\n      warnInvalidHookAccess();\n      mountHookTypesDev();\n      return mountTransition();\n    },\n    useMutableSource: function (source, getSnapshot, subscribe) {\n      currentHookNameInDev = 'useMutableSource';\n      warnInvalidHookAccess();\n      mountHookTypesDev();\n      return mountMutableSource();\n    },\n    useSyncExternalStore: function (subscribe, getSnapshot, getServerSnapshot) {\n      currentHookNameInDev = 'useSyncExternalStore';\n      warnInvalidHookAccess();\n      mountHookTypesDev();\n      return mountSyncExternalStore(subscribe, getSnapshot, getServerSnapshot);\n    },\n    useId: function () {\n      currentHookNameInDev = 'useId';\n      warnInvalidHookAccess();\n      mountHookTypesDev();\n      return mountId();\n    },\n    unstable_isNewReconciler: enableNewReconciler\n  };\n\n  InvalidNestedHooksDispatcherOnUpdateInDEV = {\n    readContext: function (context) {\n      warnInvalidContextAccess();\n      return readContext(context);\n    },\n    useCallback: function (callback, deps) {\n      currentHookNameInDev = 'useCallback';\n      warnInvalidHookAccess();\n      updateHookTypesDev();\n      return updateCallback(callback, deps);\n    },\n    useContext: function (context) {\n      currentHookNameInDev = 'useContext';\n      warnInvalidHookAccess();\n      updateHookTypesDev();\n      return readContext(context);\n    },\n    useEffect: function (create, deps) {\n      currentHookNameInDev = 'useEffect';\n      warnInvalidHookAccess();\n      updateHookTypesDev();\n      return updateEffect(create, deps);\n    },\n    useImperativeHandle: function (ref, create, deps) {\n      currentHookNameInDev = 'useImperativeHandle';\n      warnInvalidHookAccess();\n      updateHookTypesDev();\n      return updateImperativeHandle(ref, create, deps);\n    },\n    useInsertionEffect: function (create, deps) {\n      currentHookNameInDev = 'useInsertionEffect';\n      warnInvalidHookAccess();\n      updateHookTypesDev();\n      return updateInsertionEffect(create, deps);\n    },\n    useLayoutEffect: function (create, deps) {\n      currentHookNameInDev = 'useLayoutEffect';\n      warnInvalidHookAccess();\n      updateHookTypesDev();\n      return updateLayoutEffect(create, deps);\n    },\n    useMemo: function (create, deps) {\n      currentHookNameInDev = 'useMemo';\n      warnInvalidHookAccess();\n      updateHookTypesDev();\n      var prevDispatcher = ReactCurrentDispatcher$1.current;\n      ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnUpdateInDEV;\n\n      try {\n        return updateMemo(create, deps);\n      } finally {\n        ReactCurrentDispatcher$1.current = prevDispatcher;\n      }\n    },\n    useReducer: function (reducer, initialArg, init) {\n      currentHookNameInDev = 'useReducer';\n      warnInvalidHookAccess();\n      updateHookTypesDev();\n      var prevDispatcher = ReactCurrentDispatcher$1.current;\n      ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnUpdateInDEV;\n\n      try {\n        return updateReducer(reducer, initialArg, init);\n      } finally {\n        ReactCurrentDispatcher$1.current = prevDispatcher;\n      }\n    },\n    useRef: function (initialValue) {\n      currentHookNameInDev = 'useRef';\n      warnInvalidHookAccess();\n      updateHookTypesDev();\n      return updateRef();\n    },\n    useState: function (initialState) {\n      currentHookNameInDev = 'useState';\n      warnInvalidHookAccess();\n      updateHookTypesDev();\n      var prevDispatcher = ReactCurrentDispatcher$1.current;\n      ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnUpdateInDEV;\n\n      try {\n        return updateState(initialState);\n      } finally {\n        ReactCurrentDispatcher$1.current = prevDispatcher;\n      }\n    },\n    useDebugValue: function (value, formatterFn) {\n      currentHookNameInDev = 'useDebugValue';\n      warnInvalidHookAccess();\n      updateHookTypesDev();\n      return updateDebugValue();\n    },\n    useDeferredValue: function (value) {\n      currentHookNameInDev = 'useDeferredValue';\n      warnInvalidHookAccess();\n      updateHookTypesDev();\n      return updateDeferredValue(value);\n    },\n    useTransition: function () {\n      currentHookNameInDev = 'useTransition';\n      warnInvalidHookAccess();\n      updateHookTypesDev();\n      return updateTransition();\n    },\n    useMutableSource: function (source, getSnapshot, subscribe) {\n      currentHookNameInDev = 'useMutableSource';\n      warnInvalidHookAccess();\n      updateHookTypesDev();\n      return updateMutableSource();\n    },\n    useSyncExternalStore: function (subscribe, getSnapshot, getServerSnapshot) {\n      currentHookNameInDev = 'useSyncExternalStore';\n      warnInvalidHookAccess();\n      updateHookTypesDev();\n      return updateSyncExternalStore(subscribe, getSnapshot);\n    },\n    useId: function () {\n      currentHookNameInDev = 'useId';\n      warnInvalidHookAccess();\n      updateHookTypesDev();\n      return updateId();\n    },\n    unstable_isNewReconciler: enableNewReconciler\n  };\n\n  InvalidNestedHooksDispatcherOnRerenderInDEV = {\n    readContext: function (context) {\n      warnInvalidContextAccess();\n      return readContext(context);\n    },\n    useCallback: function (callback, deps) {\n      currentHookNameInDev = 'useCallback';\n      warnInvalidHookAccess();\n      updateHookTypesDev();\n      return updateCallback(callback, deps);\n    },\n    useContext: function (context) {\n      currentHookNameInDev = 'useContext';\n      warnInvalidHookAccess();\n      updateHookTypesDev();\n      return readContext(context);\n    },\n    useEffect: function (create, deps) {\n      currentHookNameInDev = 'useEffect';\n      warnInvalidHookAccess();\n      updateHookTypesDev();\n      return updateEffect(create, deps);\n    },\n    useImperativeHandle: function (ref, create, deps) {\n      currentHookNameInDev = 'useImperativeHandle';\n      warnInvalidHookAccess();\n      updateHookTypesDev();\n      return updateImperativeHandle(ref, create, deps);\n    },\n    useInsertionEffect: function (create, deps) {\n      currentHookNameInDev = 'useInsertionEffect';\n      warnInvalidHookAccess();\n      updateHookTypesDev();\n      return updateInsertionEffect(create, deps);\n    },\n    useLayoutEffect: function (create, deps) {\n      currentHookNameInDev = 'useLayoutEffect';\n      warnInvalidHookAccess();\n      updateHookTypesDev();\n      return updateLayoutEffect(create, deps);\n    },\n    useMemo: function (create, deps) {\n      currentHookNameInDev = 'useMemo';\n      warnInvalidHookAccess();\n      updateHookTypesDev();\n      var prevDispatcher = ReactCurrentDispatcher$1.current;\n      ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnUpdateInDEV;\n\n      try {\n        return updateMemo(create, deps);\n      } finally {\n        ReactCurrentDispatcher$1.current = prevDispatcher;\n      }\n    },\n    useReducer: function (reducer, initialArg, init) {\n      currentHookNameInDev = 'useReducer';\n      warnInvalidHookAccess();\n      updateHookTypesDev();\n      var prevDispatcher = ReactCurrentDispatcher$1.current;\n      ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnUpdateInDEV;\n\n      try {\n        return rerenderReducer(reducer, initialArg, init);\n      } finally {\n        ReactCurrentDispatcher$1.current = prevDispatcher;\n      }\n    },\n    useRef: function (initialValue) {\n      currentHookNameInDev = 'useRef';\n      warnInvalidHookAccess();\n      updateHookTypesDev();\n      return updateRef();\n    },\n    useState: function (initialState) {\n      currentHookNameInDev = 'useState';\n      warnInvalidHookAccess();\n      updateHookTypesDev();\n      var prevDispatcher = ReactCurrentDispatcher$1.current;\n      ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnUpdateInDEV;\n\n      try {\n        return rerenderState(initialState);\n      } finally {\n        ReactCurrentDispatcher$1.current = prevDispatcher;\n      }\n    },\n    useDebugValue: function (value, formatterFn) {\n      currentHookNameInDev = 'useDebugValue';\n      warnInvalidHookAccess();\n      updateHookTypesDev();\n      return updateDebugValue();\n    },\n    useDeferredValue: function (value) {\n      currentHookNameInDev = 'useDeferredValue';\n      warnInvalidHookAccess();\n      updateHookTypesDev();\n      return rerenderDeferredValue(value);\n    },\n    useTransition: function () {\n      currentHookNameInDev = 'useTransition';\n      warnInvalidHookAccess();\n      updateHookTypesDev();\n      return rerenderTransition();\n    },\n    useMutableSource: function (source, getSnapshot, subscribe) {\n      currentHookNameInDev = 'useMutableSource';\n      warnInvalidHookAccess();\n      updateHookTypesDev();\n      return updateMutableSource();\n    },\n    useSyncExternalStore: function (subscribe, getSnapshot, getServerSnapshot) {\n      currentHookNameInDev = 'useSyncExternalStore';\n      warnInvalidHookAccess();\n      updateHookTypesDev();\n      return updateSyncExternalStore(subscribe, getSnapshot);\n    },\n    useId: function () {\n      currentHookNameInDev = 'useId';\n      warnInvalidHookAccess();\n      updateHookTypesDev();\n      return updateId();\n    },\n    unstable_isNewReconciler: enableNewReconciler\n  };\n}\n\nvar now$1 = Scheduler.unstable_now;\nvar commitTime = 0;\nvar layoutEffectStartTime = -1;\nvar profilerStartTime = -1;\nvar passiveEffectStartTime = -1;\n/**\n * Tracks whether the current update was a nested/cascading update (scheduled from a layout effect).\n *\n * The overall sequence is:\n *   1. render\n *   2. commit (and call `onRender`, `onCommit`)\n *   3. check for nested updates\n *   4. flush passive effects (and call `onPostCommit`)\n *\n * Nested updates are identified in step 3 above,\n * but step 4 still applies to the work that was just committed.\n * We use two flags to track nested updates then:\n * one tracks whether the upcoming update is a nested update,\n * and the other tracks whether the current update was a nested update.\n * The first value gets synced to the second at the start of the render phase.\n */\n\nvar currentUpdateIsNested = false;\nvar nestedUpdateScheduled = false;\n\nfunction isCurrentUpdateNested() {\n  return currentUpdateIsNested;\n}\n\nfunction markNestedUpdateScheduled() {\n  {\n    nestedUpdateScheduled = true;\n  }\n}\n\nfunction resetNestedUpdateFlag() {\n  {\n    currentUpdateIsNested = false;\n    nestedUpdateScheduled = false;\n  }\n}\n\nfunction syncNestedUpdateFlag() {\n  {\n    currentUpdateIsNested = nestedUpdateScheduled;\n    nestedUpdateScheduled = false;\n  }\n}\n\nfunction getCommitTime() {\n  return commitTime;\n}\n\nfunction recordCommitTime() {\n\n  commitTime = now$1();\n}\n\nfunction startProfilerTimer(fiber) {\n\n  profilerStartTime = now$1();\n\n  if (fiber.actualStartTime < 0) {\n    fiber.actualStartTime = now$1();\n  }\n}\n\nfunction stopProfilerTimerIfRunning(fiber) {\n\n  profilerStartTime = -1;\n}\n\nfunction stopProfilerTimerIfRunningAndRecordDelta(fiber, overrideBaseTime) {\n\n  if (profilerStartTime >= 0) {\n    var elapsedTime = now$1() - profilerStartTime;\n    fiber.actualDuration += elapsedTime;\n\n    if (overrideBaseTime) {\n      fiber.selfBaseDuration = elapsedTime;\n    }\n\n    profilerStartTime = -1;\n  }\n}\n\nfunction recordLayoutEffectDuration(fiber) {\n\n  if (layoutEffectStartTime >= 0) {\n    var elapsedTime = now$1() - layoutEffectStartTime;\n    layoutEffectStartTime = -1; // Store duration on the next nearest Profiler ancestor\n    // Or the root (for the DevTools Profiler to read)\n\n    var parentFiber = fiber.return;\n\n    while (parentFiber !== null) {\n      switch (parentFiber.tag) {\n        case HostRoot:\n          var root = parentFiber.stateNode;\n          root.effectDuration += elapsedTime;\n          return;\n\n        case Profiler:\n          var parentStateNode = parentFiber.stateNode;\n          parentStateNode.effectDuration += elapsedTime;\n          return;\n      }\n\n      parentFiber = parentFiber.return;\n    }\n  }\n}\n\nfunction recordPassiveEffectDuration(fiber) {\n\n  if (passiveEffectStartTime >= 0) {\n    var elapsedTime = now$1() - passiveEffectStartTime;\n    passiveEffectStartTime = -1; // Store duration on the next nearest Profiler ancestor\n    // Or the root (for the DevTools Profiler to read)\n\n    var parentFiber = fiber.return;\n\n    while (parentFiber !== null) {\n      switch (parentFiber.tag) {\n        case HostRoot:\n          var root = parentFiber.stateNode;\n\n          if (root !== null) {\n            root.passiveEffectDuration += elapsedTime;\n          }\n\n          return;\n\n        case Profiler:\n          var parentStateNode = parentFiber.stateNode;\n\n          if (parentStateNode !== null) {\n            // Detached fibers have their state node cleared out.\n            // In this case, the return pointer is also cleared out,\n            // so we won't be able to report the time spent in this Profiler's subtree.\n            parentStateNode.passiveEffectDuration += elapsedTime;\n          }\n\n          return;\n      }\n\n      parentFiber = parentFiber.return;\n    }\n  }\n}\n\nfunction startLayoutEffectTimer() {\n\n  layoutEffectStartTime = now$1();\n}\n\nfunction startPassiveEffectTimer() {\n\n  passiveEffectStartTime = now$1();\n}\n\nfunction transferActualDuration(fiber) {\n  // Transfer time spent rendering these children so we don't lose it\n  // after we rerender. This is used as a helper in special cases\n  // where we should count the work of multiple passes.\n  var child = fiber.child;\n\n  while (child) {\n    fiber.actualDuration += child.actualDuration;\n    child = child.sibling;\n  }\n}\n\nfunction createCapturedValueAtFiber(value, source) {\n  // If the value is an error, call this function immediately after it is thrown\n  // so the stack is accurate.\n  return {\n    value: value,\n    source: source,\n    stack: getStackByFiberInDevAndProd(source),\n    digest: null\n  };\n}\nfunction createCapturedValue(value, digest, stack) {\n  return {\n    value: value,\n    source: null,\n    stack: stack != null ? stack : null,\n    digest: digest != null ? digest : null\n  };\n}\n\n// This module is forked in different environments.\n// By default, return `true` to log errors to the console.\n// Forks can return `false` if this isn't desirable.\nfunction showErrorDialog(boundary, errorInfo) {\n  return true;\n}\n\nfunction logCapturedError(boundary, errorInfo) {\n  try {\n    var logError = showErrorDialog(boundary, errorInfo); // Allow injected showErrorDialog() to prevent default console.error logging.\n    // This enables renderers like ReactNative to better manage redbox behavior.\n\n    if (logError === false) {\n      return;\n    }\n\n    var error = errorInfo.value;\n\n    if (true) {\n      var source = errorInfo.source;\n      var stack = errorInfo.stack;\n      var componentStack = stack !== null ? stack : ''; // Browsers support silencing uncaught errors by calling\n      // `preventDefault()` in window `error` handler.\n      // We record this information as an expando on the error.\n\n      if (error != null && error._suppressLogging) {\n        if (boundary.tag === ClassComponent) {\n          // The error is recoverable and was silenced.\n          // Ignore it and don't print the stack addendum.\n          // This is handy for testing error boundaries without noise.\n          return;\n        } // The error is fatal. Since the silencing might have\n        // been accidental, we'll surface it anyway.\n        // However, the browser would have silenced the original error\n        // so we'll print it first, and then print the stack addendum.\n\n\n        console['error'](error); // Don't transform to our wrapper\n        // For a more detailed description of this block, see:\n        // https://github.com/facebook/react/pull/13384\n      }\n\n      var componentName = source ? getComponentNameFromFiber(source) : null;\n      var componentNameMessage = componentName ? \"The above error occurred in the <\" + componentName + \"> component:\" : 'The above error occurred in one of your React components:';\n      var errorBoundaryMessage;\n\n      if (boundary.tag === HostRoot) {\n        errorBoundaryMessage = 'Consider adding an error boundary to your tree to customize error handling behavior.\\n' + 'Visit https://reactjs.org/link/error-boundaries to learn more about error boundaries.';\n      } else {\n        var errorBoundaryName = getComponentNameFromFiber(boundary) || 'Anonymous';\n        errorBoundaryMessage = \"React will try to recreate this component tree from scratch \" + (\"using the error boundary you provided, \" + errorBoundaryName + \".\");\n      }\n\n      var combinedMessage = componentNameMessage + \"\\n\" + componentStack + \"\\n\\n\" + (\"\" + errorBoundaryMessage); // In development, we provide our own message with just the component stack.\n      // We don't include the original error message and JS stack because the browser\n      // has already printed it. Even if the application swallows the error, it is still\n      // displayed by the browser thanks to the DEV-only fake event trick in ReactErrorUtils.\n\n      console['error'](combinedMessage); // Don't transform to our wrapper\n    } else {\n      // In production, we print the error directly.\n      // This will include the message, the JS stack, and anything the browser wants to show.\n      // We pass the error object instead of custom message so that the browser displays the error natively.\n      console['error'](error); // Don't transform to our wrapper\n    }\n  } catch (e) {\n    // This method must not throw, or React internal state will get messed up.\n    // If console.error is overridden, or logCapturedError() shows a dialog that throws,\n    // we want to report this error outside of the normal stack as a last resort.\n    // https://github.com/facebook/react/issues/13188\n    setTimeout(function () {\n      throw e;\n    });\n  }\n}\n\nvar PossiblyWeakMap$1 = typeof WeakMap === 'function' ? WeakMap : Map;\n\nfunction createRootErrorUpdate(fiber, errorInfo, lane) {\n  var update = createUpdate(NoTimestamp, lane); // Unmount the root by rendering null.\n\n  update.tag = CaptureUpdate; // Caution: React DevTools currently depends on this property\n  // being called \"element\".\n\n  update.payload = {\n    element: null\n  };\n  var error = errorInfo.value;\n\n  update.callback = function () {\n    onUncaughtError(error);\n    logCapturedError(fiber, errorInfo);\n  };\n\n  return update;\n}\n\nfunction createClassErrorUpdate(fiber, errorInfo, lane) {\n  var update = createUpdate(NoTimestamp, lane);\n  update.tag = CaptureUpdate;\n  var getDerivedStateFromError = fiber.type.getDerivedStateFromError;\n\n  if (typeof getDerivedStateFromError === 'function') {\n    var error$1 = errorInfo.value;\n\n    update.payload = function () {\n      return getDerivedStateFromError(error$1);\n    };\n\n    update.callback = function () {\n      {\n        markFailedErrorBoundaryForHotReloading(fiber);\n      }\n\n      logCapturedError(fiber, errorInfo);\n    };\n  }\n\n  var inst = fiber.stateNode;\n\n  if (inst !== null && typeof inst.componentDidCatch === 'function') {\n    update.callback = function callback() {\n      {\n        markFailedErrorBoundaryForHotReloading(fiber);\n      }\n\n      logCapturedError(fiber, errorInfo);\n\n      if (typeof getDerivedStateFromError !== 'function') {\n        // To preserve the preexisting retry behavior of error boundaries,\n        // we keep track of which ones already failed during this batch.\n        // This gets reset before we yield back to the browser.\n        // TODO: Warn in strict mode if getDerivedStateFromError is\n        // not defined.\n        markLegacyErrorBoundaryAsFailed(this);\n      }\n\n      var error$1 = errorInfo.value;\n      var stack = errorInfo.stack;\n      this.componentDidCatch(error$1, {\n        componentStack: stack !== null ? stack : ''\n      });\n\n      {\n        if (typeof getDerivedStateFromError !== 'function') {\n          // If componentDidCatch is the only error boundary method defined,\n          // then it needs to call setState to recover from errors.\n          // If no state update is scheduled then the boundary will swallow the error.\n          if (!includesSomeLane(fiber.lanes, SyncLane)) {\n            error('%s: Error boundaries should implement getDerivedStateFromError(). ' + 'In that method, return a state update to display an error message or fallback UI.', getComponentNameFromFiber(fiber) || 'Unknown');\n          }\n        }\n      }\n    };\n  }\n\n  return update;\n}\n\nfunction attachPingListener(root, wakeable, lanes) {\n  // Attach a ping listener\n  //\n  // The data might resolve before we have a chance to commit the fallback. Or,\n  // in the case of a refresh, we'll never commit a fallback. So we need to\n  // attach a listener now. When it resolves (\"pings\"), we can decide whether to\n  // try rendering the tree again.\n  //\n  // Only attach a listener if one does not already exist for the lanes\n  // we're currently rendering (which acts like a \"thread ID\" here).\n  //\n  // We only need to do this in concurrent mode. Legacy Suspense always\n  // commits fallbacks synchronously, so there are no pings.\n  var pingCache = root.pingCache;\n  var threadIDs;\n\n  if (pingCache === null) {\n    pingCache = root.pingCache = new PossiblyWeakMap$1();\n    threadIDs = new Set();\n    pingCache.set(wakeable, threadIDs);\n  } else {\n    threadIDs = pingCache.get(wakeable);\n\n    if (threadIDs === undefined) {\n      threadIDs = new Set();\n      pingCache.set(wakeable, threadIDs);\n    }\n  }\n\n  if (!threadIDs.has(lanes)) {\n    // Memoize using the thread ID to prevent redundant listeners.\n    threadIDs.add(lanes);\n    var ping = pingSuspendedRoot.bind(null, root, wakeable, lanes);\n\n    {\n      if (isDevToolsPresent) {\n        // If we have pending work still, restore the original updaters\n        restorePendingUpdaters(root, lanes);\n      }\n    }\n\n    wakeable.then(ping, ping);\n  }\n}\n\nfunction attachRetryListener(suspenseBoundary, root, wakeable, lanes) {\n  // Retry listener\n  //\n  // If the fallback does commit, we need to attach a different type of\n  // listener. This one schedules an update on the Suspense boundary to turn\n  // the fallback state off.\n  //\n  // Stash the wakeable on the boundary fiber so we can access it in the\n  // commit phase.\n  //\n  // When the wakeable resolves, we'll attempt to render the boundary\n  // again (\"retry\").\n  var wakeables = suspenseBoundary.updateQueue;\n\n  if (wakeables === null) {\n    var updateQueue = new Set();\n    updateQueue.add(wakeable);\n    suspenseBoundary.updateQueue = updateQueue;\n  } else {\n    wakeables.add(wakeable);\n  }\n}\n\nfunction resetSuspendedComponent(sourceFiber, rootRenderLanes) {\n  // A legacy mode Suspense quirk, only relevant to hook components.\n\n\n  var tag = sourceFiber.tag;\n\n  if ((sourceFiber.mode & ConcurrentMode) === NoMode && (tag === FunctionComponent || tag === ForwardRef || tag === SimpleMemoComponent)) {\n    var currentSource = sourceFiber.alternate;\n\n    if (currentSource) {\n      sourceFiber.updateQueue = currentSource.updateQueue;\n      sourceFiber.memoizedState = currentSource.memoizedState;\n      sourceFiber.lanes = currentSource.lanes;\n    } else {\n      sourceFiber.updateQueue = null;\n      sourceFiber.memoizedState = null;\n    }\n  }\n}\n\nfunction getNearestSuspenseBoundaryToCapture(returnFiber) {\n  var node = returnFiber;\n\n  do {\n    if (node.tag === SuspenseComponent && shouldCaptureSuspense(node)) {\n      return node;\n    } // This boundary already captured during this render. Continue to the next\n    // boundary.\n\n\n    node = node.return;\n  } while (node !== null);\n\n  return null;\n}\n\nfunction markSuspenseBoundaryShouldCapture(suspenseBoundary, returnFiber, sourceFiber, root, rootRenderLanes) {\n  // This marks a Suspense boundary so that when we're unwinding the stack,\n  // it captures the suspended \"exception\" and does a second (fallback) pass.\n  if ((suspenseBoundary.mode & ConcurrentMode) === NoMode) {\n    // Legacy Mode Suspense\n    //\n    // If the boundary is in legacy mode, we should *not*\n    // suspend the commit. Pretend as if the suspended component rendered\n    // null and keep rendering. When the Suspense boundary completes,\n    // we'll do a second pass to render the fallback.\n    if (suspenseBoundary === returnFiber) {\n      // Special case where we suspended while reconciling the children of\n      // a Suspense boundary's inner Offscreen wrapper fiber. This happens\n      // when a React.lazy component is a direct child of a\n      // Suspense boundary.\n      //\n      // Suspense boundaries are implemented as multiple fibers, but they\n      // are a single conceptual unit. The legacy mode behavior where we\n      // pretend the suspended fiber committed as `null` won't work,\n      // because in this case the \"suspended\" fiber is the inner\n      // Offscreen wrapper.\n      //\n      // Because the contents of the boundary haven't started rendering\n      // yet (i.e. nothing in the tree has partially rendered) we can\n      // switch to the regular, concurrent mode behavior: mark the\n      // boundary with ShouldCapture and enter the unwind phase.\n      suspenseBoundary.flags |= ShouldCapture;\n    } else {\n      suspenseBoundary.flags |= DidCapture;\n      sourceFiber.flags |= ForceUpdateForLegacySuspense; // We're going to commit this fiber even though it didn't complete.\n      // But we shouldn't call any lifecycle methods or callbacks. Remove\n      // all lifecycle effect tags.\n\n      sourceFiber.flags &= ~(LifecycleEffectMask | Incomplete);\n\n      if (sourceFiber.tag === ClassComponent) {\n        var currentSourceFiber = sourceFiber.alternate;\n\n        if (currentSourceFiber === null) {\n          // This is a new mount. Change the tag so it's not mistaken for a\n          // completed class component. For example, we should not call\n          // componentWillUnmount if it is deleted.\n          sourceFiber.tag = IncompleteClassComponent;\n        } else {\n          // When we try rendering again, we should not reuse the current fiber,\n          // since it's known to be in an inconsistent state. Use a force update to\n          // prevent a bail out.\n          var update = createUpdate(NoTimestamp, SyncLane);\n          update.tag = ForceUpdate;\n          enqueueUpdate(sourceFiber, update, SyncLane);\n        }\n      } // The source fiber did not complete. Mark it with Sync priority to\n      // indicate that it still has pending work.\n\n\n      sourceFiber.lanes = mergeLanes(sourceFiber.lanes, SyncLane);\n    }\n\n    return suspenseBoundary;\n  } // Confirmed that the boundary is in a concurrent mode tree. Continue\n  // with the normal suspend path.\n  //\n  // After this we'll use a set of heuristics to determine whether this\n  // render pass will run to completion or restart or \"suspend\" the commit.\n  // The actual logic for this is spread out in different places.\n  //\n  // This first principle is that if we're going to suspend when we complete\n  // a root, then we should also restart if we get an update or ping that\n  // might unsuspend it, and vice versa. The only reason to suspend is\n  // because you think you might want to restart before committing. However,\n  // it doesn't make sense to restart only while in the period we're suspended.\n  //\n  // Restarting too aggressively is also not good because it starves out any\n  // intermediate loading state. So we use heuristics to determine when.\n  // Suspense Heuristics\n  //\n  // If nothing threw a Promise or all the same fallbacks are already showing,\n  // then don't suspend/restart.\n  //\n  // If this is an initial render of a new tree of Suspense boundaries and\n  // those trigger a fallback, then don't suspend/restart. We want to ensure\n  // that we can show the initial loading state as quickly as possible.\n  //\n  // If we hit a \"Delayed\" case, such as when we'd switch from content back into\n  // a fallback, then we should always suspend/restart. Transitions apply\n  // to this case. If none is defined, JND is used instead.\n  //\n  // If we're already showing a fallback and it gets \"retried\", allowing us to show\n  // another level, but there's still an inner boundary that would show a fallback,\n  // then we suspend/restart for 500ms since the last time we showed a fallback\n  // anywhere in the tree. This effectively throttles progressive loading into a\n  // consistent train of commits. This also gives us an opportunity to restart to\n  // get to the completed state slightly earlier.\n  //\n  // If there's ambiguity due to batching it's resolved in preference of:\n  // 1) \"delayed\", 2) \"initial render\", 3) \"retry\".\n  //\n  // We want to ensure that a \"busy\" state doesn't get force committed. We want to\n  // ensure that new initial loading states can commit as soon as possible.\n\n\n  suspenseBoundary.flags |= ShouldCapture; // TODO: I think we can remove this, since we now use `DidCapture` in\n  // the begin phase to prevent an early bailout.\n\n  suspenseBoundary.lanes = rootRenderLanes;\n  return suspenseBoundary;\n}\n\nfunction throwException(root, returnFiber, sourceFiber, value, rootRenderLanes) {\n  // The source fiber did not complete.\n  sourceFiber.flags |= Incomplete;\n\n  {\n    if (isDevToolsPresent) {\n      // If we have pending work still, restore the original updaters\n      restorePendingUpdaters(root, rootRenderLanes);\n    }\n  }\n\n  if (value !== null && typeof value === 'object' && typeof value.then === 'function') {\n    // This is a wakeable. The component suspended.\n    var wakeable = value;\n    resetSuspendedComponent(sourceFiber);\n\n    {\n      if (getIsHydrating() && sourceFiber.mode & ConcurrentMode) {\n        markDidThrowWhileHydratingDEV();\n      }\n    }\n\n\n    var suspenseBoundary = getNearestSuspenseBoundaryToCapture(returnFiber);\n\n    if (suspenseBoundary !== null) {\n      suspenseBoundary.flags &= ~ForceClientRender;\n      markSuspenseBoundaryShouldCapture(suspenseBoundary, returnFiber, sourceFiber, root, rootRenderLanes); // We only attach ping listeners in concurrent mode. Legacy Suspense always\n      // commits fallbacks synchronously, so there are no pings.\n\n      if (suspenseBoundary.mode & ConcurrentMode) {\n        attachPingListener(root, wakeable, rootRenderLanes);\n      }\n\n      attachRetryListener(suspenseBoundary, root, wakeable);\n      return;\n    } else {\n      // No boundary was found. Unless this is a sync update, this is OK.\n      // We can suspend and wait for more data to arrive.\n      if (!includesSyncLane(rootRenderLanes)) {\n        // This is not a sync update. Suspend. Since we're not activating a\n        // Suspense boundary, this will unwind all the way to the root without\n        // performing a second pass to render a fallback. (This is arguably how\n        // refresh transitions should work, too, since we're not going to commit\n        // the fallbacks anyway.)\n        //\n        // This case also applies to initial hydration.\n        attachPingListener(root, wakeable, rootRenderLanes);\n        renderDidSuspendDelayIfPossible();\n        return;\n      } // This is a sync/discrete update. We treat this case like an error\n      // because discrete renders are expected to produce a complete tree\n      // synchronously to maintain consistency with external state.\n\n\n      var uncaughtSuspenseError = new Error('A component suspended while responding to synchronous input. This ' + 'will cause the UI to be replaced with a loading indicator. To ' + 'fix, updates that suspend should be wrapped ' + 'with startTransition.'); // If we're outside a transition, fall through to the regular error path.\n      // The error will be caught by the nearest suspense boundary.\n\n      value = uncaughtSuspenseError;\n    }\n  } else {\n    // This is a regular error, not a Suspense wakeable.\n    if (getIsHydrating() && sourceFiber.mode & ConcurrentMode) {\n      markDidThrowWhileHydratingDEV();\n\n      var _suspenseBoundary = getNearestSuspenseBoundaryToCapture(returnFiber); // If the error was thrown during hydration, we may be able to recover by\n      // discarding the dehydrated content and switching to a client render.\n      // Instead of surfacing the error, find the nearest Suspense boundary\n      // and render it again without hydration.\n\n\n      if (_suspenseBoundary !== null) {\n        if ((_suspenseBoundary.flags & ShouldCapture) === NoFlags) {\n          // Set a flag to indicate that we should try rendering the normal\n          // children again, not the fallback.\n          _suspenseBoundary.flags |= ForceClientRender;\n        }\n\n        markSuspenseBoundaryShouldCapture(_suspenseBoundary, returnFiber, sourceFiber, root, rootRenderLanes); // Even though the user may not be affected by this error, we should\n        // still log it so it can be fixed.\n\n        queueHydrationError(createCapturedValueAtFiber(value, sourceFiber));\n        return;\n      }\n    }\n  }\n\n  value = createCapturedValueAtFiber(value, sourceFiber);\n  renderDidError(value); // We didn't find a boundary that could handle this type of exception. Start\n  // over and traverse parent path again, this time treating the exception\n  // as an error.\n\n  var workInProgress = returnFiber;\n\n  do {\n    switch (workInProgress.tag) {\n      case HostRoot:\n        {\n          var _errorInfo = value;\n          workInProgress.flags |= ShouldCapture;\n          var lane = pickArbitraryLane(rootRenderLanes);\n          workInProgress.lanes = mergeLanes(workInProgress.lanes, lane);\n          var update = createRootErrorUpdate(workInProgress, _errorInfo, lane);\n          enqueueCapturedUpdate(workInProgress, update);\n          return;\n        }\n\n      case ClassComponent:\n        // Capture and retry\n        var errorInfo = value;\n        var ctor = workInProgress.type;\n        var instance = workInProgress.stateNode;\n\n        if ((workInProgress.flags & DidCapture) === NoFlags && (typeof ctor.getDerivedStateFromError === 'function' || instance !== null && typeof instance.componentDidCatch === 'function' && !isAlreadyFailedLegacyErrorBoundary(instance))) {\n          workInProgress.flags |= ShouldCapture;\n\n          var _lane = pickArbitraryLane(rootRenderLanes);\n\n          workInProgress.lanes = mergeLanes(workInProgress.lanes, _lane); // Schedule the error boundary to re-render using updated state\n\n          var _update = createClassErrorUpdate(workInProgress, errorInfo, _lane);\n\n          enqueueCapturedUpdate(workInProgress, _update);\n          return;\n        }\n\n        break;\n    }\n\n    workInProgress = workInProgress.return;\n  } while (workInProgress !== null);\n}\n\nfunction getSuspendedCache() {\n  {\n    return null;\n  } // This function is called when a Suspense boundary suspends. It returns the\n}\n\nvar ReactCurrentOwner$1 = ReactSharedInternals.ReactCurrentOwner;\nvar didReceiveUpdate = false;\nvar didWarnAboutBadClass;\nvar didWarnAboutModulePatternComponent;\nvar didWarnAboutContextTypeOnFunctionComponent;\nvar didWarnAboutGetDerivedStateOnFunctionComponent;\nvar didWarnAboutFunctionRefs;\nvar didWarnAboutReassigningProps;\nvar didWarnAboutRevealOrder;\nvar didWarnAboutTailOptions;\n\n{\n  didWarnAboutBadClass = {};\n  didWarnAboutModulePatternComponent = {};\n  didWarnAboutContextTypeOnFunctionComponent = {};\n  didWarnAboutGetDerivedStateOnFunctionComponent = {};\n  didWarnAboutFunctionRefs = {};\n  didWarnAboutReassigningProps = false;\n  didWarnAboutRevealOrder = {};\n  didWarnAboutTailOptions = {};\n}\n\nfunction reconcileChildren(current, workInProgress, nextChildren, renderLanes) {\n  if (current === null) {\n    // If this is a fresh new component that hasn't been rendered yet, we\n    // won't update its child set by applying minimal side-effects. Instead,\n    // we will add them all to the child before it gets rendered. That means\n    // we can optimize this reconciliation pass by not tracking side-effects.\n    workInProgress.child = mountChildFibers(workInProgress, null, nextChildren, renderLanes);\n  } else {\n    // If the current child is the same as the work in progress, it means that\n    // we haven't yet started any work on these children. Therefore, we use\n    // the clone algorithm to create a copy of all the current children.\n    // If we had any progressed work already, that is invalid at this point so\n    // let's throw it out.\n    workInProgress.child = reconcileChildFibers(workInProgress, current.child, nextChildren, renderLanes);\n  }\n}\n\nfunction forceUnmountCurrentAndReconcile(current, workInProgress, nextChildren, renderLanes) {\n  // This function is fork of reconcileChildren. It's used in cases where we\n  // want to reconcile without matching against the existing set. This has the\n  // effect of all current children being unmounted; even if the type and key\n  // are the same, the old child is unmounted and a new child is created.\n  //\n  // To do this, we're going to go through the reconcile algorithm twice. In\n  // the first pass, we schedule a deletion for all the current children by\n  // passing null.\n  workInProgress.child = reconcileChildFibers(workInProgress, current.child, null, renderLanes); // In the second pass, we mount the new children. The trick here is that we\n  // pass null in place of where we usually pass the current child set. This has\n  // the effect of remounting all children regardless of whether their\n  // identities match.\n\n  workInProgress.child = reconcileChildFibers(workInProgress, null, nextChildren, renderLanes);\n}\n\nfunction updateForwardRef(current, workInProgress, Component, nextProps, renderLanes) {\n  // TODO: current can be non-null here even if the component\n  // hasn't yet mounted. This happens after the first render suspends.\n  // We'll need to figure out if this is fine or can cause issues.\n  {\n    if (workInProgress.type !== workInProgress.elementType) {\n      // Lazy component props can't be validated in createElement\n      // because they're only guaranteed to be resolved here.\n      var innerPropTypes = Component.propTypes;\n\n      if (innerPropTypes) {\n        checkPropTypes(innerPropTypes, nextProps, // Resolved props\n        'prop', getComponentNameFromType(Component));\n      }\n    }\n  }\n\n  var render = Component.render;\n  var ref = workInProgress.ref; // The rest is a fork of updateFunctionComponent\n\n  var nextChildren;\n  var hasId;\n  prepareToReadContext(workInProgress, renderLanes);\n\n  {\n    markComponentRenderStarted(workInProgress);\n  }\n\n  {\n    ReactCurrentOwner$1.current = workInProgress;\n    setIsRendering(true);\n    nextChildren = renderWithHooks(current, workInProgress, render, nextProps, ref, renderLanes);\n    hasId = checkDidRenderIdHook();\n\n    if ( workInProgress.mode & StrictLegacyMode) {\n      setIsStrictModeForDevtools(true);\n\n      try {\n        nextChildren = renderWithHooks(current, workInProgress, render, nextProps, ref, renderLanes);\n        hasId = checkDidRenderIdHook();\n      } finally {\n        setIsStrictModeForDevtools(false);\n      }\n    }\n\n    setIsRendering(false);\n  }\n\n  {\n    markComponentRenderStopped();\n  }\n\n  if (current !== null && !didReceiveUpdate) {\n    bailoutHooks(current, workInProgress, renderLanes);\n    return bailoutOnAlreadyFinishedWork(current, workInProgress, renderLanes);\n  }\n\n  if (getIsHydrating() && hasId) {\n    pushMaterializedTreeId(workInProgress);\n  } // React DevTools reads this flag.\n\n\n  workInProgress.flags |= PerformedWork;\n  reconcileChildren(current, workInProgress, nextChildren, renderLanes);\n  return workInProgress.child;\n}\n\nfunction updateMemoComponent(current, workInProgress, Component, nextProps, renderLanes) {\n  if (current === null) {\n    var type = Component.type;\n\n    if (isSimpleFunctionComponent(type) && Component.compare === null && // SimpleMemoComponent codepath doesn't resolve outer props either.\n    Component.defaultProps === undefined) {\n      var resolvedType = type;\n\n      {\n        resolvedType = resolveFunctionForHotReloading(type);\n      } // If this is a plain function component without default props,\n      // and with only the default shallow comparison, we upgrade it\n      // to a SimpleMemoComponent to allow fast path updates.\n\n\n      workInProgress.tag = SimpleMemoComponent;\n      workInProgress.type = resolvedType;\n\n      {\n        validateFunctionComponentInDev(workInProgress, type);\n      }\n\n      return updateSimpleMemoComponent(current, workInProgress, resolvedType, nextProps, renderLanes);\n    }\n\n    {\n      var innerPropTypes = type.propTypes;\n\n      if (innerPropTypes) {\n        // Inner memo component props aren't currently validated in createElement.\n        // We could move it there, but we'd still need this for lazy code path.\n        checkPropTypes(innerPropTypes, nextProps, // Resolved props\n        'prop', getComponentNameFromType(type));\n      }\n    }\n\n    var child = createFiberFromTypeAndProps(Component.type, null, nextProps, workInProgress, workInProgress.mode, renderLanes);\n    child.ref = workInProgress.ref;\n    child.return = workInProgress;\n    workInProgress.child = child;\n    return child;\n  }\n\n  {\n    var _type = Component.type;\n    var _innerPropTypes = _type.propTypes;\n\n    if (_innerPropTypes) {\n      // Inner memo component props aren't currently validated in createElement.\n      // We could move it there, but we'd still need this for lazy code path.\n      checkPropTypes(_innerPropTypes, nextProps, // Resolved props\n      'prop', getComponentNameFromType(_type));\n    }\n  }\n\n  var currentChild = current.child; // This is always exactly one child\n\n  var hasScheduledUpdateOrContext = checkScheduledUpdateOrContext(current, renderLanes);\n\n  if (!hasScheduledUpdateOrContext) {\n    // This will be the props with resolved defaultProps,\n    // unlike current.memoizedProps which will be the unresolved ones.\n    var prevProps = currentChild.memoizedProps; // Default to shallow comparison\n\n    var compare = Component.compare;\n    compare = compare !== null ? compare : shallowEqual;\n\n    if (compare(prevProps, nextProps) && current.ref === workInProgress.ref) {\n      return bailoutOnAlreadyFinishedWork(current, workInProgress, renderLanes);\n    }\n  } // React DevTools reads this flag.\n\n\n  workInProgress.flags |= PerformedWork;\n  var newChild = createWorkInProgress(currentChild, nextProps);\n  newChild.ref = workInProgress.ref;\n  newChild.return = workInProgress;\n  workInProgress.child = newChild;\n  return newChild;\n}\n\nfunction updateSimpleMemoComponent(current, workInProgress, Component, nextProps, renderLanes) {\n  // TODO: current can be non-null here even if the component\n  // hasn't yet mounted. This happens when the inner render suspends.\n  // We'll need to figure out if this is fine or can cause issues.\n  {\n    if (workInProgress.type !== workInProgress.elementType) {\n      // Lazy component props can't be validated in createElement\n      // because they're only guaranteed to be resolved here.\n      var outerMemoType = workInProgress.elementType;\n\n      if (outerMemoType.$$typeof === REACT_LAZY_TYPE) {\n        // We warn when you define propTypes on lazy()\n        // so let's just skip over it to find memo() outer wrapper.\n        // Inner props for memo are validated later.\n        var lazyComponent = outerMemoType;\n        var payload = lazyComponent._payload;\n        var init = lazyComponent._init;\n\n        try {\n          outerMemoType = init(payload);\n        } catch (x) {\n          outerMemoType = null;\n        } // Inner propTypes will be validated in the function component path.\n\n\n        var outerPropTypes = outerMemoType && outerMemoType.propTypes;\n\n        if (outerPropTypes) {\n          checkPropTypes(outerPropTypes, nextProps, // Resolved (SimpleMemoComponent has no defaultProps)\n          'prop', getComponentNameFromType(outerMemoType));\n        }\n      }\n    }\n  }\n\n  if (current !== null) {\n    var prevProps = current.memoizedProps;\n\n    if (shallowEqual(prevProps, nextProps) && current.ref === workInProgress.ref && ( // Prevent bailout if the implementation changed due to hot reload.\n     workInProgress.type === current.type )) {\n      didReceiveUpdate = false; // The props are shallowly equal. Reuse the previous props object, like we\n      // would during a normal fiber bailout.\n      //\n      // We don't have strong guarantees that the props object is referentially\n      // equal during updates where we can't bail out anyway — like if the props\n      // are shallowly equal, but there's a local state or context update in the\n      // same batch.\n      //\n      // However, as a principle, we should aim to make the behavior consistent\n      // across different ways of memoizing a component. For example, React.memo\n      // has a different internal Fiber layout if you pass a normal function\n      // component (SimpleMemoComponent) versus if you pass a different type\n      // like forwardRef (MemoComponent). But this is an implementation detail.\n      // Wrapping a component in forwardRef (or React.lazy, etc) shouldn't\n      // affect whether the props object is reused during a bailout.\n\n      workInProgress.pendingProps = nextProps = prevProps;\n\n      if (!checkScheduledUpdateOrContext(current, renderLanes)) {\n        // The pending lanes were cleared at the beginning of beginWork. We're\n        // about to bail out, but there might be other lanes that weren't\n        // included in the current render. Usually, the priority level of the\n        // remaining updates is accumulated during the evaluation of the\n        // component (i.e. when processing the update queue). But since since\n        // we're bailing out early *without* evaluating the component, we need\n        // to account for it here, too. Reset to the value of the current fiber.\n        // NOTE: This only applies to SimpleMemoComponent, not MemoComponent,\n        // because a MemoComponent fiber does not have hooks or an update queue;\n        // rather, it wraps around an inner component, which may or may not\n        // contains hooks.\n        // TODO: Move the reset at in beginWork out of the common path so that\n        // this is no longer necessary.\n        workInProgress.lanes = current.lanes;\n        return bailoutOnAlreadyFinishedWork(current, workInProgress, renderLanes);\n      } else if ((current.flags & ForceUpdateForLegacySuspense) !== NoFlags) {\n        // This is a special case that only exists for legacy mode.\n        // See https://github.com/facebook/react/pull/19216.\n        didReceiveUpdate = true;\n      }\n    }\n  }\n\n  return updateFunctionComponent(current, workInProgress, Component, nextProps, renderLanes);\n}\n\nfunction updateOffscreenComponent(current, workInProgress, renderLanes) {\n  var nextProps = workInProgress.pendingProps;\n  var nextChildren = nextProps.children;\n  var prevState = current !== null ? current.memoizedState : null;\n\n  if (nextProps.mode === 'hidden' || enableLegacyHidden ) {\n    // Rendering a hidden tree.\n    if ((workInProgress.mode & ConcurrentMode) === NoMode) {\n      // In legacy sync mode, don't defer the subtree. Render it now.\n      // TODO: Consider how Offscreen should work with transitions in the future\n      var nextState = {\n        baseLanes: NoLanes,\n        cachePool: null,\n        transitions: null\n      };\n      workInProgress.memoizedState = nextState;\n\n      pushRenderLanes(workInProgress, renderLanes);\n    } else if (!includesSomeLane(renderLanes, OffscreenLane)) {\n      var spawnedCachePool = null; // We're hidden, and we're not rendering at Offscreen. We will bail out\n      // and resume this tree later.\n\n      var nextBaseLanes;\n\n      if (prevState !== null) {\n        var prevBaseLanes = prevState.baseLanes;\n        nextBaseLanes = mergeLanes(prevBaseLanes, renderLanes);\n      } else {\n        nextBaseLanes = renderLanes;\n      } // Schedule this fiber to re-render at offscreen priority. Then bailout.\n\n\n      workInProgress.lanes = workInProgress.childLanes = laneToLanes(OffscreenLane);\n      var _nextState = {\n        baseLanes: nextBaseLanes,\n        cachePool: spawnedCachePool,\n        transitions: null\n      };\n      workInProgress.memoizedState = _nextState;\n      workInProgress.updateQueue = null;\n      // to avoid a push/pop misalignment.\n\n\n      pushRenderLanes(workInProgress, nextBaseLanes);\n\n      return null;\n    } else {\n      // This is the second render. The surrounding visible content has already\n      // committed. Now we resume rendering the hidden tree.\n      // Rendering at offscreen, so we can clear the base lanes.\n      var _nextState2 = {\n        baseLanes: NoLanes,\n        cachePool: null,\n        transitions: null\n      };\n      workInProgress.memoizedState = _nextState2; // Push the lanes that were skipped when we bailed out.\n\n      var subtreeRenderLanes = prevState !== null ? prevState.baseLanes : renderLanes;\n\n      pushRenderLanes(workInProgress, subtreeRenderLanes);\n    }\n  } else {\n    // Rendering a visible tree.\n    var _subtreeRenderLanes;\n\n    if (prevState !== null) {\n      // We're going from hidden -> visible.\n      _subtreeRenderLanes = mergeLanes(prevState.baseLanes, renderLanes);\n\n      workInProgress.memoizedState = null;\n    } else {\n      // We weren't previously hidden, and we still aren't, so there's nothing\n      // special to do. Need to push to the stack regardless, though, to avoid\n      // a push/pop misalignment.\n      _subtreeRenderLanes = renderLanes;\n    }\n\n    pushRenderLanes(workInProgress, _subtreeRenderLanes);\n  }\n\n  reconcileChildren(current, workInProgress, nextChildren, renderLanes);\n  return workInProgress.child;\n} // Note: These happen to have identical begin phases, for now. We shouldn't hold\n\nfunction updateFragment(current, workInProgress, renderLanes) {\n  var nextChildren = workInProgress.pendingProps;\n  reconcileChildren(current, workInProgress, nextChildren, renderLanes);\n  return workInProgress.child;\n}\n\nfunction updateMode(current, workInProgress, renderLanes) {\n  var nextChildren = workInProgress.pendingProps.children;\n  reconcileChildren(current, workInProgress, nextChildren, renderLanes);\n  return workInProgress.child;\n}\n\nfunction updateProfiler(current, workInProgress, renderLanes) {\n  {\n    workInProgress.flags |= Update;\n\n    {\n      // Reset effect durations for the next eventual effect phase.\n      // These are reset during render to allow the DevTools commit hook a chance to read them,\n      var stateNode = workInProgress.stateNode;\n      stateNode.effectDuration = 0;\n      stateNode.passiveEffectDuration = 0;\n    }\n  }\n\n  var nextProps = workInProgress.pendingProps;\n  var nextChildren = nextProps.children;\n  reconcileChildren(current, workInProgress, nextChildren, renderLanes);\n  return workInProgress.child;\n}\n\nfunction markRef(current, workInProgress) {\n  var ref = workInProgress.ref;\n\n  if (current === null && ref !== null || current !== null && current.ref !== ref) {\n    // Schedule a Ref effect\n    workInProgress.flags |= Ref;\n\n    {\n      workInProgress.flags |= RefStatic;\n    }\n  }\n}\n\nfunction updateFunctionComponent(current, workInProgress, Component, nextProps, renderLanes) {\n  {\n    if (workInProgress.type !== workInProgress.elementType) {\n      // Lazy component props can't be validated in createElement\n      // because they're only guaranteed to be resolved here.\n      var innerPropTypes = Component.propTypes;\n\n      if (innerPropTypes) {\n        checkPropTypes(innerPropTypes, nextProps, // Resolved props\n        'prop', getComponentNameFromType(Component));\n      }\n    }\n  }\n\n  var context;\n\n  {\n    var unmaskedContext = getUnmaskedContext(workInProgress, Component, true);\n    context = getMaskedContext(workInProgress, unmaskedContext);\n  }\n\n  var nextChildren;\n  var hasId;\n  prepareToReadContext(workInProgress, renderLanes);\n\n  {\n    markComponentRenderStarted(workInProgress);\n  }\n\n  {\n    ReactCurrentOwner$1.current = workInProgress;\n    setIsRendering(true);\n    nextChildren = renderWithHooks(current, workInProgress, Component, nextProps, context, renderLanes);\n    hasId = checkDidRenderIdHook();\n\n    if ( workInProgress.mode & StrictLegacyMode) {\n      setIsStrictModeForDevtools(true);\n\n      try {\n        nextChildren = renderWithHooks(current, workInProgress, Component, nextProps, context, renderLanes);\n        hasId = checkDidRenderIdHook();\n      } finally {\n        setIsStrictModeForDevtools(false);\n      }\n    }\n\n    setIsRendering(false);\n  }\n\n  {\n    markComponentRenderStopped();\n  }\n\n  if (current !== null && !didReceiveUpdate) {\n    bailoutHooks(current, workInProgress, renderLanes);\n    return bailoutOnAlreadyFinishedWork(current, workInProgress, renderLanes);\n  }\n\n  if (getIsHydrating() && hasId) {\n    pushMaterializedTreeId(workInProgress);\n  } // React DevTools reads this flag.\n\n\n  workInProgress.flags |= PerformedWork;\n  reconcileChildren(current, workInProgress, nextChildren, renderLanes);\n  return workInProgress.child;\n}\n\nfunction updateClassComponent(current, workInProgress, Component, nextProps, renderLanes) {\n  {\n    // This is used by DevTools to force a boundary to error.\n    switch (shouldError(workInProgress)) {\n      case false:\n        {\n          var _instance = workInProgress.stateNode;\n          var ctor = workInProgress.type; // TODO This way of resetting the error boundary state is a hack.\n          // Is there a better way to do this?\n\n          var tempInstance = new ctor(workInProgress.memoizedProps, _instance.context);\n          var state = tempInstance.state;\n\n          _instance.updater.enqueueSetState(_instance, state, null);\n\n          break;\n        }\n\n      case true:\n        {\n          workInProgress.flags |= DidCapture;\n          workInProgress.flags |= ShouldCapture; // eslint-disable-next-line react-internal/prod-error-codes\n\n          var error$1 = new Error('Simulated error coming from DevTools');\n          var lane = pickArbitraryLane(renderLanes);\n          workInProgress.lanes = mergeLanes(workInProgress.lanes, lane); // Schedule the error boundary to re-render using updated state\n\n          var update = createClassErrorUpdate(workInProgress, createCapturedValueAtFiber(error$1, workInProgress), lane);\n          enqueueCapturedUpdate(workInProgress, update);\n          break;\n        }\n    }\n\n    if (workInProgress.type !== workInProgress.elementType) {\n      // Lazy component props can't be validated in createElement\n      // because they're only guaranteed to be resolved here.\n      var innerPropTypes = Component.propTypes;\n\n      if (innerPropTypes) {\n        checkPropTypes(innerPropTypes, nextProps, // Resolved props\n        'prop', getComponentNameFromType(Component));\n      }\n    }\n  } // Push context providers early to prevent context stack mismatches.\n  // During mounting we don't know the child context yet as the instance doesn't exist.\n  // We will invalidate the child context in finishClassComponent() right after rendering.\n\n\n  var hasContext;\n\n  if (isContextProvider(Component)) {\n    hasContext = true;\n    pushContextProvider(workInProgress);\n  } else {\n    hasContext = false;\n  }\n\n  prepareToReadContext(workInProgress, renderLanes);\n  var instance = workInProgress.stateNode;\n  var shouldUpdate;\n\n  if (instance === null) {\n    resetSuspendedCurrentOnMountInLegacyMode(current, workInProgress); // In the initial pass we might need to construct the instance.\n\n    constructClassInstance(workInProgress, Component, nextProps);\n    mountClassInstance(workInProgress, Component, nextProps, renderLanes);\n    shouldUpdate = true;\n  } else if (current === null) {\n    // In a resume, we'll already have an instance we can reuse.\n    shouldUpdate = resumeMountClassInstance(workInProgress, Component, nextProps, renderLanes);\n  } else {\n    shouldUpdate = updateClassInstance(current, workInProgress, Component, nextProps, renderLanes);\n  }\n\n  var nextUnitOfWork = finishClassComponent(current, workInProgress, Component, shouldUpdate, hasContext, renderLanes);\n\n  {\n    var inst = workInProgress.stateNode;\n\n    if (shouldUpdate && inst.props !== nextProps) {\n      if (!didWarnAboutReassigningProps) {\n        error('It looks like %s is reassigning its own `this.props` while rendering. ' + 'This is not supported and can lead to confusing bugs.', getComponentNameFromFiber(workInProgress) || 'a component');\n      }\n\n      didWarnAboutReassigningProps = true;\n    }\n  }\n\n  return nextUnitOfWork;\n}\n\nfunction finishClassComponent(current, workInProgress, Component, shouldUpdate, hasContext, renderLanes) {\n  // Refs should update even if shouldComponentUpdate returns false\n  markRef(current, workInProgress);\n  var didCaptureError = (workInProgress.flags & DidCapture) !== NoFlags;\n\n  if (!shouldUpdate && !didCaptureError) {\n    // Context providers should defer to sCU for rendering\n    if (hasContext) {\n      invalidateContextProvider(workInProgress, Component, false);\n    }\n\n    return bailoutOnAlreadyFinishedWork(current, workInProgress, renderLanes);\n  }\n\n  var instance = workInProgress.stateNode; // Rerender\n\n  ReactCurrentOwner$1.current = workInProgress;\n  var nextChildren;\n\n  if (didCaptureError && typeof Component.getDerivedStateFromError !== 'function') {\n    // If we captured an error, but getDerivedStateFromError is not defined,\n    // unmount all the children. componentDidCatch will schedule an update to\n    // re-render a fallback. This is temporary until we migrate everyone to\n    // the new API.\n    // TODO: Warn in a future release.\n    nextChildren = null;\n\n    {\n      stopProfilerTimerIfRunning();\n    }\n  } else {\n    {\n      markComponentRenderStarted(workInProgress);\n    }\n\n    {\n      setIsRendering(true);\n      nextChildren = instance.render();\n\n      if ( workInProgress.mode & StrictLegacyMode) {\n        setIsStrictModeForDevtools(true);\n\n        try {\n          instance.render();\n        } finally {\n          setIsStrictModeForDevtools(false);\n        }\n      }\n\n      setIsRendering(false);\n    }\n\n    {\n      markComponentRenderStopped();\n    }\n  } // React DevTools reads this flag.\n\n\n  workInProgress.flags |= PerformedWork;\n\n  if (current !== null && didCaptureError) {\n    // If we're recovering from an error, reconcile without reusing any of\n    // the existing children. Conceptually, the normal children and the children\n    // that are shown on error are two different sets, so we shouldn't reuse\n    // normal children even if their identities match.\n    forceUnmountCurrentAndReconcile(current, workInProgress, nextChildren, renderLanes);\n  } else {\n    reconcileChildren(current, workInProgress, nextChildren, renderLanes);\n  } // Memoize state using the values we just used to render.\n  // TODO: Restructure so we never read values from the instance.\n\n\n  workInProgress.memoizedState = instance.state; // The context might have changed so we need to recalculate it.\n\n  if (hasContext) {\n    invalidateContextProvider(workInProgress, Component, true);\n  }\n\n  return workInProgress.child;\n}\n\nfunction pushHostRootContext(workInProgress) {\n  var root = workInProgress.stateNode;\n\n  if (root.pendingContext) {\n    pushTopLevelContextObject(workInProgress, root.pendingContext, root.pendingContext !== root.context);\n  } else if (root.context) {\n    // Should always be set\n    pushTopLevelContextObject(workInProgress, root.context, false);\n  }\n\n  pushHostContainer(workInProgress, root.containerInfo);\n}\n\nfunction updateHostRoot(current, workInProgress, renderLanes) {\n  pushHostRootContext(workInProgress);\n\n  if (current === null) {\n    throw new Error('Should have a current fiber. This is a bug in React.');\n  }\n\n  var nextProps = workInProgress.pendingProps;\n  var prevState = workInProgress.memoizedState;\n  var prevChildren = prevState.element;\n  cloneUpdateQueue(current, workInProgress);\n  processUpdateQueue(workInProgress, nextProps, null, renderLanes);\n  var nextState = workInProgress.memoizedState;\n  var root = workInProgress.stateNode;\n  // being called \"element\".\n\n\n  var nextChildren = nextState.element;\n\n  if ( prevState.isDehydrated) {\n    // This is a hydration root whose shell has not yet hydrated. We should\n    // attempt to hydrate.\n    // Flip isDehydrated to false to indicate that when this render\n    // finishes, the root will no longer be dehydrated.\n    var overrideState = {\n      element: nextChildren,\n      isDehydrated: false,\n      cache: nextState.cache,\n      pendingSuspenseBoundaries: nextState.pendingSuspenseBoundaries,\n      transitions: nextState.transitions\n    };\n    var updateQueue = workInProgress.updateQueue; // `baseState` can always be the last state because the root doesn't\n    // have reducer functions so it doesn't need rebasing.\n\n    updateQueue.baseState = overrideState;\n    workInProgress.memoizedState = overrideState;\n\n    if (workInProgress.flags & ForceClientRender) {\n      // Something errored during a previous attempt to hydrate the shell, so we\n      // forced a client render.\n      var recoverableError = createCapturedValueAtFiber(new Error('There was an error while hydrating. Because the error happened outside ' + 'of a Suspense boundary, the entire root will switch to ' + 'client rendering.'), workInProgress);\n      return mountHostRootWithoutHydrating(current, workInProgress, nextChildren, renderLanes, recoverableError);\n    } else if (nextChildren !== prevChildren) {\n      var _recoverableError = createCapturedValueAtFiber(new Error('This root received an early update, before anything was able ' + 'hydrate. Switched the entire root to client rendering.'), workInProgress);\n\n      return mountHostRootWithoutHydrating(current, workInProgress, nextChildren, renderLanes, _recoverableError);\n    } else {\n      // The outermost shell has not hydrated yet. Start hydrating.\n      enterHydrationState(workInProgress);\n\n      var child = mountChildFibers(workInProgress, null, nextChildren, renderLanes);\n      workInProgress.child = child;\n      var node = child;\n\n      while (node) {\n        // Mark each child as hydrating. This is a fast path to know whether this\n        // tree is part of a hydrating tree. This is used to determine if a child\n        // node has fully mounted yet, and for scheduling event replaying.\n        // Conceptually this is similar to Placement in that a new subtree is\n        // inserted into the React tree here. It just happens to not need DOM\n        // mutations because it already exists.\n        node.flags = node.flags & ~Placement | Hydrating;\n        node = node.sibling;\n      }\n    }\n  } else {\n    // Root is not dehydrated. Either this is a client-only root, or it\n    // already hydrated.\n    resetHydrationState();\n\n    if (nextChildren === prevChildren) {\n      return bailoutOnAlreadyFinishedWork(current, workInProgress, renderLanes);\n    }\n\n    reconcileChildren(current, workInProgress, nextChildren, renderLanes);\n  }\n\n  return workInProgress.child;\n}\n\nfunction mountHostRootWithoutHydrating(current, workInProgress, nextChildren, renderLanes, recoverableError) {\n  // Revert to client rendering.\n  resetHydrationState();\n  queueHydrationError(recoverableError);\n  workInProgress.flags |= ForceClientRender;\n  reconcileChildren(current, workInProgress, nextChildren, renderLanes);\n  return workInProgress.child;\n}\n\nfunction updateHostComponent(current, workInProgress, renderLanes) {\n  pushHostContext(workInProgress);\n\n  if (current === null) {\n    tryToClaimNextHydratableInstance(workInProgress);\n  }\n\n  var type = workInProgress.type;\n  var nextProps = workInProgress.pendingProps;\n  var prevProps = current !== null ? current.memoizedProps : null;\n  var nextChildren = nextProps.children;\n  var isDirectTextChild = shouldSetTextContent(type, nextProps);\n\n  if (isDirectTextChild) {\n    // We special case a direct text child of a host node. This is a common\n    // case. We won't handle it as a reified child. We will instead handle\n    // this in the host environment that also has access to this prop. That\n    // avoids allocating another HostText fiber and traversing it.\n    nextChildren = null;\n  } else if (prevProps !== null && shouldSetTextContent(type, prevProps)) {\n    // If we're switching from a direct text child to a normal child, or to\n    // empty, we need to schedule the text content to be reset.\n    workInProgress.flags |= ContentReset;\n  }\n\n  markRef(current, workInProgress);\n  reconcileChildren(current, workInProgress, nextChildren, renderLanes);\n  return workInProgress.child;\n}\n\nfunction updateHostText(current, workInProgress) {\n  if (current === null) {\n    tryToClaimNextHydratableInstance(workInProgress);\n  } // Nothing to do here. This is terminal. We'll do the completion step\n  // immediately after.\n\n\n  return null;\n}\n\nfunction mountLazyComponent(_current, workInProgress, elementType, renderLanes) {\n  resetSuspendedCurrentOnMountInLegacyMode(_current, workInProgress);\n  var props = workInProgress.pendingProps;\n  var lazyComponent = elementType;\n  var payload = lazyComponent._payload;\n  var init = lazyComponent._init;\n  var Component = init(payload); // Store the unwrapped component in the type.\n\n  workInProgress.type = Component;\n  var resolvedTag = workInProgress.tag = resolveLazyComponentTag(Component);\n  var resolvedProps = resolveDefaultProps(Component, props);\n  var child;\n\n  switch (resolvedTag) {\n    case FunctionComponent:\n      {\n        {\n          validateFunctionComponentInDev(workInProgress, Component);\n          workInProgress.type = Component = resolveFunctionForHotReloading(Component);\n        }\n\n        child = updateFunctionComponent(null, workInProgress, Component, resolvedProps, renderLanes);\n        return child;\n      }\n\n    case ClassComponent:\n      {\n        {\n          workInProgress.type = Component = resolveClassForHotReloading(Component);\n        }\n\n        child = updateClassComponent(null, workInProgress, Component, resolvedProps, renderLanes);\n        return child;\n      }\n\n    case ForwardRef:\n      {\n        {\n          workInProgress.type = Component = resolveForwardRefForHotReloading(Component);\n        }\n\n        child = updateForwardRef(null, workInProgress, Component, resolvedProps, renderLanes);\n        return child;\n      }\n\n    case MemoComponent:\n      {\n        {\n          if (workInProgress.type !== workInProgress.elementType) {\n            var outerPropTypes = Component.propTypes;\n\n            if (outerPropTypes) {\n              checkPropTypes(outerPropTypes, resolvedProps, // Resolved for outer only\n              'prop', getComponentNameFromType(Component));\n            }\n          }\n        }\n\n        child = updateMemoComponent(null, workInProgress, Component, resolveDefaultProps(Component.type, resolvedProps), // The inner type can have defaults too\n        renderLanes);\n        return child;\n      }\n  }\n\n  var hint = '';\n\n  {\n    if (Component !== null && typeof Component === 'object' && Component.$$typeof === REACT_LAZY_TYPE) {\n      hint = ' Did you wrap a component in React.lazy() more than once?';\n    }\n  } // This message intentionally doesn't mention ForwardRef or MemoComponent\n  // because the fact that it's a separate type of work is an\n  // implementation detail.\n\n\n  throw new Error(\"Element type is invalid. Received a promise that resolves to: \" + Component + \". \" + (\"Lazy element type must resolve to a class or function.\" + hint));\n}\n\nfunction mountIncompleteClassComponent(_current, workInProgress, Component, nextProps, renderLanes) {\n  resetSuspendedCurrentOnMountInLegacyMode(_current, workInProgress); // Promote the fiber to a class and try rendering again.\n\n  workInProgress.tag = ClassComponent; // The rest of this function is a fork of `updateClassComponent`\n  // Push context providers early to prevent context stack mismatches.\n  // During mounting we don't know the child context yet as the instance doesn't exist.\n  // We will invalidate the child context in finishClassComponent() right after rendering.\n\n  var hasContext;\n\n  if (isContextProvider(Component)) {\n    hasContext = true;\n    pushContextProvider(workInProgress);\n  } else {\n    hasContext = false;\n  }\n\n  prepareToReadContext(workInProgress, renderLanes);\n  constructClassInstance(workInProgress, Component, nextProps);\n  mountClassInstance(workInProgress, Component, nextProps, renderLanes);\n  return finishClassComponent(null, workInProgress, Component, true, hasContext, renderLanes);\n}\n\nfunction mountIndeterminateComponent(_current, workInProgress, Component, renderLanes) {\n  resetSuspendedCurrentOnMountInLegacyMode(_current, workInProgress);\n  var props = workInProgress.pendingProps;\n  var context;\n\n  {\n    var unmaskedContext = getUnmaskedContext(workInProgress, Component, false);\n    context = getMaskedContext(workInProgress, unmaskedContext);\n  }\n\n  prepareToReadContext(workInProgress, renderLanes);\n  var value;\n  var hasId;\n\n  {\n    markComponentRenderStarted(workInProgress);\n  }\n\n  {\n    if (Component.prototype && typeof Component.prototype.render === 'function') {\n      var componentName = getComponentNameFromType(Component) || 'Unknown';\n\n      if (!didWarnAboutBadClass[componentName]) {\n        error(\"The <%s /> component appears to have a render method, but doesn't extend React.Component. \" + 'This is likely to cause errors. Change %s to extend React.Component instead.', componentName, componentName);\n\n        didWarnAboutBadClass[componentName] = true;\n      }\n    }\n\n    if (workInProgress.mode & StrictLegacyMode) {\n      ReactStrictModeWarnings.recordLegacyContextWarning(workInProgress, null);\n    }\n\n    setIsRendering(true);\n    ReactCurrentOwner$1.current = workInProgress;\n    value = renderWithHooks(null, workInProgress, Component, props, context, renderLanes);\n    hasId = checkDidRenderIdHook();\n    setIsRendering(false);\n  }\n\n  {\n    markComponentRenderStopped();\n  } // React DevTools reads this flag.\n\n\n  workInProgress.flags |= PerformedWork;\n\n  {\n    // Support for module components is deprecated and is removed behind a flag.\n    // Whether or not it would crash later, we want to show a good message in DEV first.\n    if (typeof value === 'object' && value !== null && typeof value.render === 'function' && value.$$typeof === undefined) {\n      var _componentName = getComponentNameFromType(Component) || 'Unknown';\n\n      if (!didWarnAboutModulePatternComponent[_componentName]) {\n        error('The <%s /> component appears to be a function component that returns a class instance. ' + 'Change %s to a class that extends React.Component instead. ' + \"If you can't use a class try assigning the prototype on the function as a workaround. \" + \"`%s.prototype = React.Component.prototype`. Don't use an arrow function since it \" + 'cannot be called with `new` by React.', _componentName, _componentName, _componentName);\n\n        didWarnAboutModulePatternComponent[_componentName] = true;\n      }\n    }\n  }\n\n  if ( // Run these checks in production only if the flag is off.\n  // Eventually we'll delete this branch altogether.\n   typeof value === 'object' && value !== null && typeof value.render === 'function' && value.$$typeof === undefined) {\n    {\n      var _componentName2 = getComponentNameFromType(Component) || 'Unknown';\n\n      if (!didWarnAboutModulePatternComponent[_componentName2]) {\n        error('The <%s /> component appears to be a function component that returns a class instance. ' + 'Change %s to a class that extends React.Component instead. ' + \"If you can't use a class try assigning the prototype on the function as a workaround. \" + \"`%s.prototype = React.Component.prototype`. Don't use an arrow function since it \" + 'cannot be called with `new` by React.', _componentName2, _componentName2, _componentName2);\n\n        didWarnAboutModulePatternComponent[_componentName2] = true;\n      }\n    } // Proceed under the assumption that this is a class instance\n\n\n    workInProgress.tag = ClassComponent; // Throw out any hooks that were used.\n\n    workInProgress.memoizedState = null;\n    workInProgress.updateQueue = null; // Push context providers early to prevent context stack mismatches.\n    // During mounting we don't know the child context yet as the instance doesn't exist.\n    // We will invalidate the child context in finishClassComponent() right after rendering.\n\n    var hasContext = false;\n\n    if (isContextProvider(Component)) {\n      hasContext = true;\n      pushContextProvider(workInProgress);\n    } else {\n      hasContext = false;\n    }\n\n    workInProgress.memoizedState = value.state !== null && value.state !== undefined ? value.state : null;\n    initializeUpdateQueue(workInProgress);\n    adoptClassInstance(workInProgress, value);\n    mountClassInstance(workInProgress, Component, props, renderLanes);\n    return finishClassComponent(null, workInProgress, Component, true, hasContext, renderLanes);\n  } else {\n    // Proceed under the assumption that this is a function component\n    workInProgress.tag = FunctionComponent;\n\n    {\n\n      if ( workInProgress.mode & StrictLegacyMode) {\n        setIsStrictModeForDevtools(true);\n\n        try {\n          value = renderWithHooks(null, workInProgress, Component, props, context, renderLanes);\n          hasId = checkDidRenderIdHook();\n        } finally {\n          setIsStrictModeForDevtools(false);\n        }\n      }\n    }\n\n    if (getIsHydrating() && hasId) {\n      pushMaterializedTreeId(workInProgress);\n    }\n\n    reconcileChildren(null, workInProgress, value, renderLanes);\n\n    {\n      validateFunctionComponentInDev(workInProgress, Component);\n    }\n\n    return workInProgress.child;\n  }\n}\n\nfunction validateFunctionComponentInDev(workInProgress, Component) {\n  {\n    if (Component) {\n      if (Component.childContextTypes) {\n        error('%s(...): childContextTypes cannot be defined on a function component.', Component.displayName || Component.name || 'Component');\n      }\n    }\n\n    if (workInProgress.ref !== null) {\n      var info = '';\n      var ownerName = getCurrentFiberOwnerNameInDevOrNull();\n\n      if (ownerName) {\n        info += '\\n\\nCheck the render method of `' + ownerName + '`.';\n      }\n\n      var warningKey = ownerName || '';\n      var debugSource = workInProgress._debugSource;\n\n      if (debugSource) {\n        warningKey = debugSource.fileName + ':' + debugSource.lineNumber;\n      }\n\n      if (!didWarnAboutFunctionRefs[warningKey]) {\n        didWarnAboutFunctionRefs[warningKey] = true;\n\n        error('Function components cannot be given refs. ' + 'Attempts to access this ref will fail. ' + 'Did you mean to use React.forwardRef()?%s', info);\n      }\n    }\n\n    if (typeof Component.getDerivedStateFromProps === 'function') {\n      var _componentName3 = getComponentNameFromType(Component) || 'Unknown';\n\n      if (!didWarnAboutGetDerivedStateOnFunctionComponent[_componentName3]) {\n        error('%s: Function components do not support getDerivedStateFromProps.', _componentName3);\n\n        didWarnAboutGetDerivedStateOnFunctionComponent[_componentName3] = true;\n      }\n    }\n\n    if (typeof Component.contextType === 'object' && Component.contextType !== null) {\n      var _componentName4 = getComponentNameFromType(Component) || 'Unknown';\n\n      if (!didWarnAboutContextTypeOnFunctionComponent[_componentName4]) {\n        error('%s: Function components do not support contextType.', _componentName4);\n\n        didWarnAboutContextTypeOnFunctionComponent[_componentName4] = true;\n      }\n    }\n  }\n}\n\nvar SUSPENDED_MARKER = {\n  dehydrated: null,\n  treeContext: null,\n  retryLane: NoLane\n};\n\nfunction mountSuspenseOffscreenState(renderLanes) {\n  return {\n    baseLanes: renderLanes,\n    cachePool: getSuspendedCache(),\n    transitions: null\n  };\n}\n\nfunction updateSuspenseOffscreenState(prevOffscreenState, renderLanes) {\n  var cachePool = null;\n\n  return {\n    baseLanes: mergeLanes(prevOffscreenState.baseLanes, renderLanes),\n    cachePool: cachePool,\n    transitions: prevOffscreenState.transitions\n  };\n} // TODO: Probably should inline this back\n\n\nfunction shouldRemainOnFallback(suspenseContext, current, workInProgress, renderLanes) {\n  // If we're already showing a fallback, there are cases where we need to\n  // remain on that fallback regardless of whether the content has resolved.\n  // For example, SuspenseList coordinates when nested content appears.\n  if (current !== null) {\n    var suspenseState = current.memoizedState;\n\n    if (suspenseState === null) {\n      // Currently showing content. Don't hide it, even if ForceSuspenseFallback\n      // is true. More precise name might be \"ForceRemainSuspenseFallback\".\n      // Note: This is a factoring smell. Can't remain on a fallback if there's\n      // no fallback to remain on.\n      return false;\n    }\n  } // Not currently showing content. Consult the Suspense context.\n\n\n  return hasSuspenseContext(suspenseContext, ForceSuspenseFallback);\n}\n\nfunction getRemainingWorkInPrimaryTree(current, renderLanes) {\n  // TODO: Should not remove render lanes that were pinged during this render\n  return removeLanes(current.childLanes, renderLanes);\n}\n\nfunction updateSuspenseComponent(current, workInProgress, renderLanes) {\n  var nextProps = workInProgress.pendingProps; // This is used by DevTools to force a boundary to suspend.\n\n  {\n    if (shouldSuspend(workInProgress)) {\n      workInProgress.flags |= DidCapture;\n    }\n  }\n\n  var suspenseContext = suspenseStackCursor.current;\n  var showFallback = false;\n  var didSuspend = (workInProgress.flags & DidCapture) !== NoFlags;\n\n  if (didSuspend || shouldRemainOnFallback(suspenseContext, current)) {\n    // Something in this boundary's subtree already suspended. Switch to\n    // rendering the fallback children.\n    showFallback = true;\n    workInProgress.flags &= ~DidCapture;\n  } else {\n    // Attempting the main content\n    if (current === null || current.memoizedState !== null) {\n      // This is a new mount or this boundary is already showing a fallback state.\n      // Mark this subtree context as having at least one invisible parent that could\n      // handle the fallback state.\n      // Avoided boundaries are not considered since they cannot handle preferred fallback states.\n      {\n        suspenseContext = addSubtreeSuspenseContext(suspenseContext, InvisibleParentSuspenseContext);\n      }\n    }\n  }\n\n  suspenseContext = setDefaultShallowSuspenseContext(suspenseContext);\n  pushSuspenseContext(workInProgress, suspenseContext); // OK, the next part is confusing. We're about to reconcile the Suspense\n  // boundary's children. This involves some custom reconciliation logic. Two\n  // main reasons this is so complicated.\n  //\n  // First, Legacy Mode has different semantics for backwards compatibility. The\n  // primary tree will commit in an inconsistent state, so when we do the\n  // second pass to render the fallback, we do some exceedingly, uh, clever\n  // hacks to make that not totally break. Like transferring effects and\n  // deletions from hidden tree. In Concurrent Mode, it's much simpler,\n  // because we bailout on the primary tree completely and leave it in its old\n  // state, no effects. Same as what we do for Offscreen (except that\n  // Offscreen doesn't have the first render pass).\n  //\n  // Second is hydration. During hydration, the Suspense fiber has a slightly\n  // different layout, where the child points to a dehydrated fragment, which\n  // contains the DOM rendered by the server.\n  //\n  // Third, even if you set all that aside, Suspense is like error boundaries in\n  // that we first we try to render one tree, and if that fails, we render again\n  // and switch to a different tree. Like a try/catch block. So we have to track\n  // which branch we're currently rendering. Ideally we would model this using\n  // a stack.\n\n  if (current === null) {\n    // Initial mount\n    // Special path for hydration\n    // If we're currently hydrating, try to hydrate this boundary.\n    tryToClaimNextHydratableInstance(workInProgress); // This could've been a dehydrated suspense component.\n\n    var suspenseState = workInProgress.memoizedState;\n\n    if (suspenseState !== null) {\n      var dehydrated = suspenseState.dehydrated;\n\n      if (dehydrated !== null) {\n        return mountDehydratedSuspenseComponent(workInProgress, dehydrated);\n      }\n    }\n\n    var nextPrimaryChildren = nextProps.children;\n    var nextFallbackChildren = nextProps.fallback;\n\n    if (showFallback) {\n      var fallbackFragment = mountSuspenseFallbackChildren(workInProgress, nextPrimaryChildren, nextFallbackChildren, renderLanes);\n      var primaryChildFragment = workInProgress.child;\n      primaryChildFragment.memoizedState = mountSuspenseOffscreenState(renderLanes);\n      workInProgress.memoizedState = SUSPENDED_MARKER;\n\n      return fallbackFragment;\n    } else {\n      return mountSuspensePrimaryChildren(workInProgress, nextPrimaryChildren);\n    }\n  } else {\n    // This is an update.\n    // Special path for hydration\n    var prevState = current.memoizedState;\n\n    if (prevState !== null) {\n      var _dehydrated = prevState.dehydrated;\n\n      if (_dehydrated !== null) {\n        return updateDehydratedSuspenseComponent(current, workInProgress, didSuspend, nextProps, _dehydrated, prevState, renderLanes);\n      }\n    }\n\n    if (showFallback) {\n      var _nextFallbackChildren = nextProps.fallback;\n      var _nextPrimaryChildren = nextProps.children;\n      var fallbackChildFragment = updateSuspenseFallbackChildren(current, workInProgress, _nextPrimaryChildren, _nextFallbackChildren, renderLanes);\n      var _primaryChildFragment2 = workInProgress.child;\n      var prevOffscreenState = current.child.memoizedState;\n      _primaryChildFragment2.memoizedState = prevOffscreenState === null ? mountSuspenseOffscreenState(renderLanes) : updateSuspenseOffscreenState(prevOffscreenState, renderLanes);\n\n      _primaryChildFragment2.childLanes = getRemainingWorkInPrimaryTree(current, renderLanes);\n      workInProgress.memoizedState = SUSPENDED_MARKER;\n      return fallbackChildFragment;\n    } else {\n      var _nextPrimaryChildren2 = nextProps.children;\n\n      var _primaryChildFragment3 = updateSuspensePrimaryChildren(current, workInProgress, _nextPrimaryChildren2, renderLanes);\n\n      workInProgress.memoizedState = null;\n      return _primaryChildFragment3;\n    }\n  }\n}\n\nfunction mountSuspensePrimaryChildren(workInProgress, primaryChildren, renderLanes) {\n  var mode = workInProgress.mode;\n  var primaryChildProps = {\n    mode: 'visible',\n    children: primaryChildren\n  };\n  var primaryChildFragment = mountWorkInProgressOffscreenFiber(primaryChildProps, mode);\n  primaryChildFragment.return = workInProgress;\n  workInProgress.child = primaryChildFragment;\n  return primaryChildFragment;\n}\n\nfunction mountSuspenseFallbackChildren(workInProgress, primaryChildren, fallbackChildren, renderLanes) {\n  var mode = workInProgress.mode;\n  var progressedPrimaryFragment = workInProgress.child;\n  var primaryChildProps = {\n    mode: 'hidden',\n    children: primaryChildren\n  };\n  var primaryChildFragment;\n  var fallbackChildFragment;\n\n  if ((mode & ConcurrentMode) === NoMode && progressedPrimaryFragment !== null) {\n    // In legacy mode, we commit the primary tree as if it successfully\n    // completed, even though it's in an inconsistent state.\n    primaryChildFragment = progressedPrimaryFragment;\n    primaryChildFragment.childLanes = NoLanes;\n    primaryChildFragment.pendingProps = primaryChildProps;\n\n    if ( workInProgress.mode & ProfileMode) {\n      // Reset the durations from the first pass so they aren't included in the\n      // final amounts. This seems counterintuitive, since we're intentionally\n      // not measuring part of the render phase, but this makes it match what we\n      // do in Concurrent Mode.\n      primaryChildFragment.actualDuration = 0;\n      primaryChildFragment.actualStartTime = -1;\n      primaryChildFragment.selfBaseDuration = 0;\n      primaryChildFragment.treeBaseDuration = 0;\n    }\n\n    fallbackChildFragment = createFiberFromFragment(fallbackChildren, mode, renderLanes, null);\n  } else {\n    primaryChildFragment = mountWorkInProgressOffscreenFiber(primaryChildProps, mode);\n    fallbackChildFragment = createFiberFromFragment(fallbackChildren, mode, renderLanes, null);\n  }\n\n  primaryChildFragment.return = workInProgress;\n  fallbackChildFragment.return = workInProgress;\n  primaryChildFragment.sibling = fallbackChildFragment;\n  workInProgress.child = primaryChildFragment;\n  return fallbackChildFragment;\n}\n\nfunction mountWorkInProgressOffscreenFiber(offscreenProps, mode, renderLanes) {\n  // The props argument to `createFiberFromOffscreen` is `any` typed, so we use\n  // this wrapper function to constrain it.\n  return createFiberFromOffscreen(offscreenProps, mode, NoLanes, null);\n}\n\nfunction updateWorkInProgressOffscreenFiber(current, offscreenProps) {\n  // The props argument to `createWorkInProgress` is `any` typed, so we use this\n  // wrapper function to constrain it.\n  return createWorkInProgress(current, offscreenProps);\n}\n\nfunction updateSuspensePrimaryChildren(current, workInProgress, primaryChildren, renderLanes) {\n  var currentPrimaryChildFragment = current.child;\n  var currentFallbackChildFragment = currentPrimaryChildFragment.sibling;\n  var primaryChildFragment = updateWorkInProgressOffscreenFiber(currentPrimaryChildFragment, {\n    mode: 'visible',\n    children: primaryChildren\n  });\n\n  if ((workInProgress.mode & ConcurrentMode) === NoMode) {\n    primaryChildFragment.lanes = renderLanes;\n  }\n\n  primaryChildFragment.return = workInProgress;\n  primaryChildFragment.sibling = null;\n\n  if (currentFallbackChildFragment !== null) {\n    // Delete the fallback child fragment\n    var deletions = workInProgress.deletions;\n\n    if (deletions === null) {\n      workInProgress.deletions = [currentFallbackChildFragment];\n      workInProgress.flags |= ChildDeletion;\n    } else {\n      deletions.push(currentFallbackChildFragment);\n    }\n  }\n\n  workInProgress.child = primaryChildFragment;\n  return primaryChildFragment;\n}\n\nfunction updateSuspenseFallbackChildren(current, workInProgress, primaryChildren, fallbackChildren, renderLanes) {\n  var mode = workInProgress.mode;\n  var currentPrimaryChildFragment = current.child;\n  var currentFallbackChildFragment = currentPrimaryChildFragment.sibling;\n  var primaryChildProps = {\n    mode: 'hidden',\n    children: primaryChildren\n  };\n  var primaryChildFragment;\n\n  if ( // In legacy mode, we commit the primary tree as if it successfully\n  // completed, even though it's in an inconsistent state.\n  (mode & ConcurrentMode) === NoMode && // Make sure we're on the second pass, i.e. the primary child fragment was\n  // already cloned. In legacy mode, the only case where this isn't true is\n  // when DevTools forces us to display a fallback; we skip the first render\n  // pass entirely and go straight to rendering the fallback. (In Concurrent\n  // Mode, SuspenseList can also trigger this scenario, but this is a legacy-\n  // only codepath.)\n  workInProgress.child !== currentPrimaryChildFragment) {\n    var progressedPrimaryFragment = workInProgress.child;\n    primaryChildFragment = progressedPrimaryFragment;\n    primaryChildFragment.childLanes = NoLanes;\n    primaryChildFragment.pendingProps = primaryChildProps;\n\n    if ( workInProgress.mode & ProfileMode) {\n      // Reset the durations from the first pass so they aren't included in the\n      // final amounts. This seems counterintuitive, since we're intentionally\n      // not measuring part of the render phase, but this makes it match what we\n      // do in Concurrent Mode.\n      primaryChildFragment.actualDuration = 0;\n      primaryChildFragment.actualStartTime = -1;\n      primaryChildFragment.selfBaseDuration = currentPrimaryChildFragment.selfBaseDuration;\n      primaryChildFragment.treeBaseDuration = currentPrimaryChildFragment.treeBaseDuration;\n    } // The fallback fiber was added as a deletion during the first pass.\n    // However, since we're going to remain on the fallback, we no longer want\n    // to delete it.\n\n\n    workInProgress.deletions = null;\n  } else {\n    primaryChildFragment = updateWorkInProgressOffscreenFiber(currentPrimaryChildFragment, primaryChildProps); // Since we're reusing a current tree, we need to reuse the flags, too.\n    // (We don't do this in legacy mode, because in legacy mode we don't re-use\n    // the current tree; see previous branch.)\n\n    primaryChildFragment.subtreeFlags = currentPrimaryChildFragment.subtreeFlags & StaticMask;\n  }\n\n  var fallbackChildFragment;\n\n  if (currentFallbackChildFragment !== null) {\n    fallbackChildFragment = createWorkInProgress(currentFallbackChildFragment, fallbackChildren);\n  } else {\n    fallbackChildFragment = createFiberFromFragment(fallbackChildren, mode, renderLanes, null); // Needs a placement effect because the parent (the Suspense boundary) already\n    // mounted but this is a new fiber.\n\n    fallbackChildFragment.flags |= Placement;\n  }\n\n  fallbackChildFragment.return = workInProgress;\n  primaryChildFragment.return = workInProgress;\n  primaryChildFragment.sibling = fallbackChildFragment;\n  workInProgress.child = primaryChildFragment;\n  return fallbackChildFragment;\n}\n\nfunction retrySuspenseComponentWithoutHydrating(current, workInProgress, renderLanes, recoverableError) {\n  // Falling back to client rendering. Because this has performance\n  // implications, it's considered a recoverable error, even though the user\n  // likely won't observe anything wrong with the UI.\n  //\n  // The error is passed in as an argument to enforce that every caller provide\n  // a custom message, or explicitly opt out (currently the only path that opts\n  // out is legacy mode; every concurrent path provides an error).\n  if (recoverableError !== null) {\n    queueHydrationError(recoverableError);\n  } // This will add the old fiber to the deletion list\n\n\n  reconcileChildFibers(workInProgress, current.child, null, renderLanes); // We're now not suspended nor dehydrated.\n\n  var nextProps = workInProgress.pendingProps;\n  var primaryChildren = nextProps.children;\n  var primaryChildFragment = mountSuspensePrimaryChildren(workInProgress, primaryChildren); // Needs a placement effect because the parent (the Suspense boundary) already\n  // mounted but this is a new fiber.\n\n  primaryChildFragment.flags |= Placement;\n  workInProgress.memoizedState = null;\n  return primaryChildFragment;\n}\n\nfunction mountSuspenseFallbackAfterRetryWithoutHydrating(current, workInProgress, primaryChildren, fallbackChildren, renderLanes) {\n  var fiberMode = workInProgress.mode;\n  var primaryChildProps = {\n    mode: 'visible',\n    children: primaryChildren\n  };\n  var primaryChildFragment = mountWorkInProgressOffscreenFiber(primaryChildProps, fiberMode);\n  var fallbackChildFragment = createFiberFromFragment(fallbackChildren, fiberMode, renderLanes, null); // Needs a placement effect because the parent (the Suspense\n  // boundary) already mounted but this is a new fiber.\n\n  fallbackChildFragment.flags |= Placement;\n  primaryChildFragment.return = workInProgress;\n  fallbackChildFragment.return = workInProgress;\n  primaryChildFragment.sibling = fallbackChildFragment;\n  workInProgress.child = primaryChildFragment;\n\n  if ((workInProgress.mode & ConcurrentMode) !== NoMode) {\n    // We will have dropped the effect list which contains the\n    // deletion. We need to reconcile to delete the current child.\n    reconcileChildFibers(workInProgress, current.child, null, renderLanes);\n  }\n\n  return fallbackChildFragment;\n}\n\nfunction mountDehydratedSuspenseComponent(workInProgress, suspenseInstance, renderLanes) {\n  // During the first pass, we'll bail out and not drill into the children.\n  // Instead, we'll leave the content in place and try to hydrate it later.\n  if ((workInProgress.mode & ConcurrentMode) === NoMode) {\n    {\n      error('Cannot hydrate Suspense in legacy mode. Switch from ' + 'ReactDOM.hydrate(element, container) to ' + 'ReactDOMClient.hydrateRoot(container, <App />)' + '.render(element) or remove the Suspense components from ' + 'the server rendered components.');\n    }\n\n    workInProgress.lanes = laneToLanes(SyncLane);\n  } else if (isSuspenseInstanceFallback(suspenseInstance)) {\n    // This is a client-only boundary. Since we won't get any content from the server\n    // for this, we need to schedule that at a higher priority based on when it would\n    // have timed out. In theory we could render it in this pass but it would have the\n    // wrong priority associated with it and will prevent hydration of parent path.\n    // Instead, we'll leave work left on it to render it in a separate commit.\n    // TODO This time should be the time at which the server rendered response that is\n    // a parent to this boundary was displayed. However, since we currently don't have\n    // a protocol to transfer that time, we'll just estimate it by using the current\n    // time. This will mean that Suspense timeouts are slightly shifted to later than\n    // they should be.\n    // Schedule a normal pri update to render this content.\n    workInProgress.lanes = laneToLanes(DefaultHydrationLane);\n  } else {\n    // We'll continue hydrating the rest at offscreen priority since we'll already\n    // be showing the right content coming from the server, it is no rush.\n    workInProgress.lanes = laneToLanes(OffscreenLane);\n  }\n\n  return null;\n}\n\nfunction updateDehydratedSuspenseComponent(current, workInProgress, didSuspend, nextProps, suspenseInstance, suspenseState, renderLanes) {\n  if (!didSuspend) {\n    // This is the first render pass. Attempt to hydrate.\n    // We should never be hydrating at this point because it is the first pass,\n    // but after we've already committed once.\n    warnIfHydrating();\n\n    if ((workInProgress.mode & ConcurrentMode) === NoMode) {\n      return retrySuspenseComponentWithoutHydrating(current, workInProgress, renderLanes, // TODO: When we delete legacy mode, we should make this error argument\n      // required — every concurrent mode path that causes hydration to\n      // de-opt to client rendering should have an error message.\n      null);\n    }\n\n    if (isSuspenseInstanceFallback(suspenseInstance)) {\n      // This boundary is in a permanent fallback state. In this case, we'll never\n      // get an update and we'll never be able to hydrate the final content. Let's just try the\n      // client side render instead.\n      var digest, message, stack;\n\n      {\n        var _getSuspenseInstanceF = getSuspenseInstanceFallbackErrorDetails(suspenseInstance);\n\n        digest = _getSuspenseInstanceF.digest;\n        message = _getSuspenseInstanceF.message;\n        stack = _getSuspenseInstanceF.stack;\n      }\n\n      var error;\n\n      if (message) {\n        // eslint-disable-next-line react-internal/prod-error-codes\n        error = new Error(message);\n      } else {\n        error = new Error('The server could not finish this Suspense boundary, likely ' + 'due to an error during server rendering. Switched to ' + 'client rendering.');\n      }\n\n      var capturedValue = createCapturedValue(error, digest, stack);\n      return retrySuspenseComponentWithoutHydrating(current, workInProgress, renderLanes, capturedValue);\n    }\n    // any context has changed, we need to treat is as if the input might have changed.\n\n\n    var hasContextChanged = includesSomeLane(renderLanes, current.childLanes);\n\n    if (didReceiveUpdate || hasContextChanged) {\n      // This boundary has changed since the first render. This means that we are now unable to\n      // hydrate it. We might still be able to hydrate it using a higher priority lane.\n      var root = getWorkInProgressRoot();\n\n      if (root !== null) {\n        var attemptHydrationAtLane = getBumpedLaneForHydration(root, renderLanes);\n\n        if (attemptHydrationAtLane !== NoLane && attemptHydrationAtLane !== suspenseState.retryLane) {\n          // Intentionally mutating since this render will get interrupted. This\n          // is one of the very rare times where we mutate the current tree\n          // during the render phase.\n          suspenseState.retryLane = attemptHydrationAtLane; // TODO: Ideally this would inherit the event time of the current render\n\n          var eventTime = NoTimestamp;\n          enqueueConcurrentRenderForLane(current, attemptHydrationAtLane);\n          scheduleUpdateOnFiber(root, current, attemptHydrationAtLane, eventTime);\n        }\n      } // If we have scheduled higher pri work above, this will probably just abort the render\n      // since we now have higher priority work, but in case it doesn't, we need to prepare to\n      // render something, if we time out. Even if that requires us to delete everything and\n      // skip hydration.\n      // Delay having to do this as long as the suspense timeout allows us.\n\n\n      renderDidSuspendDelayIfPossible();\n\n      var _capturedValue = createCapturedValue(new Error('This Suspense boundary received an update before it finished ' + 'hydrating. This caused the boundary to switch to client rendering. ' + 'The usual way to fix this is to wrap the original update ' + 'in startTransition.'));\n\n      return retrySuspenseComponentWithoutHydrating(current, workInProgress, renderLanes, _capturedValue);\n    } else if (isSuspenseInstancePending(suspenseInstance)) {\n      // This component is still pending more data from the server, so we can't hydrate its\n      // content. We treat it as if this component suspended itself. It might seem as if\n      // we could just try to render it client-side instead. However, this will perform a\n      // lot of unnecessary work and is unlikely to complete since it often will suspend\n      // on missing data anyway. Additionally, the server might be able to render more\n      // than we can on the client yet. In that case we'd end up with more fallback states\n      // on the client than if we just leave it alone. If the server times out or errors\n      // these should update this boundary to the permanent Fallback state instead.\n      // Mark it as having captured (i.e. suspended).\n      workInProgress.flags |= DidCapture; // Leave the child in place. I.e. the dehydrated fragment.\n\n      workInProgress.child = current.child; // Register a callback to retry this boundary once the server has sent the result.\n\n      var retry = retryDehydratedSuspenseBoundary.bind(null, current);\n      registerSuspenseInstanceRetry(suspenseInstance, retry);\n      return null;\n    } else {\n      // This is the first attempt.\n      reenterHydrationStateFromDehydratedSuspenseInstance(workInProgress, suspenseInstance, suspenseState.treeContext);\n      var primaryChildren = nextProps.children;\n      var primaryChildFragment = mountSuspensePrimaryChildren(workInProgress, primaryChildren); // Mark the children as hydrating. This is a fast path to know whether this\n      // tree is part of a hydrating tree. This is used to determine if a child\n      // node has fully mounted yet, and for scheduling event replaying.\n      // Conceptually this is similar to Placement in that a new subtree is\n      // inserted into the React tree here. It just happens to not need DOM\n      // mutations because it already exists.\n\n      primaryChildFragment.flags |= Hydrating;\n      return primaryChildFragment;\n    }\n  } else {\n    // This is the second render pass. We already attempted to hydrated, but\n    // something either suspended or errored.\n    if (workInProgress.flags & ForceClientRender) {\n      // Something errored during hydration. Try again without hydrating.\n      workInProgress.flags &= ~ForceClientRender;\n\n      var _capturedValue2 = createCapturedValue(new Error('There was an error while hydrating this Suspense boundary. ' + 'Switched to client rendering.'));\n\n      return retrySuspenseComponentWithoutHydrating(current, workInProgress, renderLanes, _capturedValue2);\n    } else if (workInProgress.memoizedState !== null) {\n      // Something suspended and we should still be in dehydrated mode.\n      // Leave the existing child in place.\n      workInProgress.child = current.child; // The dehydrated completion pass expects this flag to be there\n      // but the normal suspense pass doesn't.\n\n      workInProgress.flags |= DidCapture;\n      return null;\n    } else {\n      // Suspended but we should no longer be in dehydrated mode.\n      // Therefore we now have to render the fallback.\n      var nextPrimaryChildren = nextProps.children;\n      var nextFallbackChildren = nextProps.fallback;\n      var fallbackChildFragment = mountSuspenseFallbackAfterRetryWithoutHydrating(current, workInProgress, nextPrimaryChildren, nextFallbackChildren, renderLanes);\n      var _primaryChildFragment4 = workInProgress.child;\n      _primaryChildFragment4.memoizedState = mountSuspenseOffscreenState(renderLanes);\n      workInProgress.memoizedState = SUSPENDED_MARKER;\n      return fallbackChildFragment;\n    }\n  }\n}\n\nfunction scheduleSuspenseWorkOnFiber(fiber, renderLanes, propagationRoot) {\n  fiber.lanes = mergeLanes(fiber.lanes, renderLanes);\n  var alternate = fiber.alternate;\n\n  if (alternate !== null) {\n    alternate.lanes = mergeLanes(alternate.lanes, renderLanes);\n  }\n\n  scheduleContextWorkOnParentPath(fiber.return, renderLanes, propagationRoot);\n}\n\nfunction propagateSuspenseContextChange(workInProgress, firstChild, renderLanes) {\n  // Mark any Suspense boundaries with fallbacks as having work to do.\n  // If they were previously forced into fallbacks, they may now be able\n  // to unblock.\n  var node = firstChild;\n\n  while (node !== null) {\n    if (node.tag === SuspenseComponent) {\n      var state = node.memoizedState;\n\n      if (state !== null) {\n        scheduleSuspenseWorkOnFiber(node, renderLanes, workInProgress);\n      }\n    } else if (node.tag === SuspenseListComponent) {\n      // If the tail is hidden there might not be an Suspense boundaries\n      // to schedule work on. In this case we have to schedule it on the\n      // list itself.\n      // We don't have to traverse to the children of the list since\n      // the list will propagate the change when it rerenders.\n      scheduleSuspenseWorkOnFiber(node, renderLanes, workInProgress);\n    } else if (node.child !== null) {\n      node.child.return = node;\n      node = node.child;\n      continue;\n    }\n\n    if (node === workInProgress) {\n      return;\n    }\n\n    while (node.sibling === null) {\n      if (node.return === null || node.return === workInProgress) {\n        return;\n      }\n\n      node = node.return;\n    }\n\n    node.sibling.return = node.return;\n    node = node.sibling;\n  }\n}\n\nfunction findLastContentRow(firstChild) {\n  // This is going to find the last row among these children that is already\n  // showing content on the screen, as opposed to being in fallback state or\n  // new. If a row has multiple Suspense boundaries, any of them being in the\n  // fallback state, counts as the whole row being in a fallback state.\n  // Note that the \"rows\" will be workInProgress, but any nested children\n  // will still be current since we haven't rendered them yet. The mounted\n  // order may not be the same as the new order. We use the new order.\n  var row = firstChild;\n  var lastContentRow = null;\n\n  while (row !== null) {\n    var currentRow = row.alternate; // New rows can't be content rows.\n\n    if (currentRow !== null && findFirstSuspended(currentRow) === null) {\n      lastContentRow = row;\n    }\n\n    row = row.sibling;\n  }\n\n  return lastContentRow;\n}\n\nfunction validateRevealOrder(revealOrder) {\n  {\n    if (revealOrder !== undefined && revealOrder !== 'forwards' && revealOrder !== 'backwards' && revealOrder !== 'together' && !didWarnAboutRevealOrder[revealOrder]) {\n      didWarnAboutRevealOrder[revealOrder] = true;\n\n      if (typeof revealOrder === 'string') {\n        switch (revealOrder.toLowerCase()) {\n          case 'together':\n          case 'forwards':\n          case 'backwards':\n            {\n              error('\"%s\" is not a valid value for revealOrder on <SuspenseList />. ' + 'Use lowercase \"%s\" instead.', revealOrder, revealOrder.toLowerCase());\n\n              break;\n            }\n\n          case 'forward':\n          case 'backward':\n            {\n              error('\"%s\" is not a valid value for revealOrder on <SuspenseList />. ' + 'React uses the -s suffix in the spelling. Use \"%ss\" instead.', revealOrder, revealOrder.toLowerCase());\n\n              break;\n            }\n\n          default:\n            error('\"%s\" is not a supported revealOrder on <SuspenseList />. ' + 'Did you mean \"together\", \"forwards\" or \"backwards\"?', revealOrder);\n\n            break;\n        }\n      } else {\n        error('%s is not a supported value for revealOrder on <SuspenseList />. ' + 'Did you mean \"together\", \"forwards\" or \"backwards\"?', revealOrder);\n      }\n    }\n  }\n}\n\nfunction validateTailOptions(tailMode, revealOrder) {\n  {\n    if (tailMode !== undefined && !didWarnAboutTailOptions[tailMode]) {\n      if (tailMode !== 'collapsed' && tailMode !== 'hidden') {\n        didWarnAboutTailOptions[tailMode] = true;\n\n        error('\"%s\" is not a supported value for tail on <SuspenseList />. ' + 'Did you mean \"collapsed\" or \"hidden\"?', tailMode);\n      } else if (revealOrder !== 'forwards' && revealOrder !== 'backwards') {\n        didWarnAboutTailOptions[tailMode] = true;\n\n        error('<SuspenseList tail=\"%s\" /> is only valid if revealOrder is ' + '\"forwards\" or \"backwards\". ' + 'Did you mean to specify revealOrder=\"forwards\"?', tailMode);\n      }\n    }\n  }\n}\n\nfunction validateSuspenseListNestedChild(childSlot, index) {\n  {\n    var isAnArray = isArray(childSlot);\n    var isIterable = !isAnArray && typeof getIteratorFn(childSlot) === 'function';\n\n    if (isAnArray || isIterable) {\n      var type = isAnArray ? 'array' : 'iterable';\n\n      error('A nested %s was passed to row #%s in <SuspenseList />. Wrap it in ' + 'an additional SuspenseList to configure its revealOrder: ' + '<SuspenseList revealOrder=...> ... ' + '<SuspenseList revealOrder=...>{%s}</SuspenseList> ... ' + '</SuspenseList>', type, index, type);\n\n      return false;\n    }\n  }\n\n  return true;\n}\n\nfunction validateSuspenseListChildren(children, revealOrder) {\n  {\n    if ((revealOrder === 'forwards' || revealOrder === 'backwards') && children !== undefined && children !== null && children !== false) {\n      if (isArray(children)) {\n        for (var i = 0; i < children.length; i++) {\n          if (!validateSuspenseListNestedChild(children[i], i)) {\n            return;\n          }\n        }\n      } else {\n        var iteratorFn = getIteratorFn(children);\n\n        if (typeof iteratorFn === 'function') {\n          var childrenIterator = iteratorFn.call(children);\n\n          if (childrenIterator) {\n            var step = childrenIterator.next();\n            var _i = 0;\n\n            for (; !step.done; step = childrenIterator.next()) {\n              if (!validateSuspenseListNestedChild(step.value, _i)) {\n                return;\n              }\n\n              _i++;\n            }\n          }\n        } else {\n          error('A single row was passed to a <SuspenseList revealOrder=\"%s\" />. ' + 'This is not useful since it needs multiple rows. ' + 'Did you mean to pass multiple children or an array?', revealOrder);\n        }\n      }\n    }\n  }\n}\n\nfunction initSuspenseListRenderState(workInProgress, isBackwards, tail, lastContentRow, tailMode) {\n  var renderState = workInProgress.memoizedState;\n\n  if (renderState === null) {\n    workInProgress.memoizedState = {\n      isBackwards: isBackwards,\n      rendering: null,\n      renderingStartTime: 0,\n      last: lastContentRow,\n      tail: tail,\n      tailMode: tailMode\n    };\n  } else {\n    // We can reuse the existing object from previous renders.\n    renderState.isBackwards = isBackwards;\n    renderState.rendering = null;\n    renderState.renderingStartTime = 0;\n    renderState.last = lastContentRow;\n    renderState.tail = tail;\n    renderState.tailMode = tailMode;\n  }\n} // This can end up rendering this component multiple passes.\n// The first pass splits the children fibers into two sets. A head and tail.\n// We first render the head. If anything is in fallback state, we do another\n// pass through beginWork to rerender all children (including the tail) with\n// the force suspend context. If the first render didn't have anything in\n// in fallback state. Then we render each row in the tail one-by-one.\n// That happens in the completeWork phase without going back to beginWork.\n\n\nfunction updateSuspenseListComponent(current, workInProgress, renderLanes) {\n  var nextProps = workInProgress.pendingProps;\n  var revealOrder = nextProps.revealOrder;\n  var tailMode = nextProps.tail;\n  var newChildren = nextProps.children;\n  validateRevealOrder(revealOrder);\n  validateTailOptions(tailMode, revealOrder);\n  validateSuspenseListChildren(newChildren, revealOrder);\n  reconcileChildren(current, workInProgress, newChildren, renderLanes);\n  var suspenseContext = suspenseStackCursor.current;\n  var shouldForceFallback = hasSuspenseContext(suspenseContext, ForceSuspenseFallback);\n\n  if (shouldForceFallback) {\n    suspenseContext = setShallowSuspenseContext(suspenseContext, ForceSuspenseFallback);\n    workInProgress.flags |= DidCapture;\n  } else {\n    var didSuspendBefore = current !== null && (current.flags & DidCapture) !== NoFlags;\n\n    if (didSuspendBefore) {\n      // If we previously forced a fallback, we need to schedule work\n      // on any nested boundaries to let them know to try to render\n      // again. This is the same as context updating.\n      propagateSuspenseContextChange(workInProgress, workInProgress.child, renderLanes);\n    }\n\n    suspenseContext = setDefaultShallowSuspenseContext(suspenseContext);\n  }\n\n  pushSuspenseContext(workInProgress, suspenseContext);\n\n  if ((workInProgress.mode & ConcurrentMode) === NoMode) {\n    // In legacy mode, SuspenseList doesn't work so we just\n    // use make it a noop by treating it as the default revealOrder.\n    workInProgress.memoizedState = null;\n  } else {\n    switch (revealOrder) {\n      case 'forwards':\n        {\n          var lastContentRow = findLastContentRow(workInProgress.child);\n          var tail;\n\n          if (lastContentRow === null) {\n            // The whole list is part of the tail.\n            // TODO: We could fast path by just rendering the tail now.\n            tail = workInProgress.child;\n            workInProgress.child = null;\n          } else {\n            // Disconnect the tail rows after the content row.\n            // We're going to render them separately later.\n            tail = lastContentRow.sibling;\n            lastContentRow.sibling = null;\n          }\n\n          initSuspenseListRenderState(workInProgress, false, // isBackwards\n          tail, lastContentRow, tailMode);\n          break;\n        }\n\n      case 'backwards':\n        {\n          // We're going to find the first row that has existing content.\n          // At the same time we're going to reverse the list of everything\n          // we pass in the meantime. That's going to be our tail in reverse\n          // order.\n          var _tail = null;\n          var row = workInProgress.child;\n          workInProgress.child = null;\n\n          while (row !== null) {\n            var currentRow = row.alternate; // New rows can't be content rows.\n\n            if (currentRow !== null && findFirstSuspended(currentRow) === null) {\n              // This is the beginning of the main content.\n              workInProgress.child = row;\n              break;\n            }\n\n            var nextRow = row.sibling;\n            row.sibling = _tail;\n            _tail = row;\n            row = nextRow;\n          } // TODO: If workInProgress.child is null, we can continue on the tail immediately.\n\n\n          initSuspenseListRenderState(workInProgress, true, // isBackwards\n          _tail, null, // last\n          tailMode);\n          break;\n        }\n\n      case 'together':\n        {\n          initSuspenseListRenderState(workInProgress, false, // isBackwards\n          null, // tail\n          null, // last\n          undefined);\n          break;\n        }\n\n      default:\n        {\n          // The default reveal order is the same as not having\n          // a boundary.\n          workInProgress.memoizedState = null;\n        }\n    }\n  }\n\n  return workInProgress.child;\n}\n\nfunction updatePortalComponent(current, workInProgress, renderLanes) {\n  pushHostContainer(workInProgress, workInProgress.stateNode.containerInfo);\n  var nextChildren = workInProgress.pendingProps;\n\n  if (current === null) {\n    // Portals are special because we don't append the children during mount\n    // but at commit. Therefore we need to track insertions which the normal\n    // flow doesn't do during mount. This doesn't happen at the root because\n    // the root always starts with a \"current\" with a null child.\n    // TODO: Consider unifying this with how the root works.\n    workInProgress.child = reconcileChildFibers(workInProgress, null, nextChildren, renderLanes);\n  } else {\n    reconcileChildren(current, workInProgress, nextChildren, renderLanes);\n  }\n\n  return workInProgress.child;\n}\n\nvar hasWarnedAboutUsingNoValuePropOnContextProvider = false;\n\nfunction updateContextProvider(current, workInProgress, renderLanes) {\n  var providerType = workInProgress.type;\n  var context = providerType._context;\n  var newProps = workInProgress.pendingProps;\n  var oldProps = workInProgress.memoizedProps;\n  var newValue = newProps.value;\n\n  {\n    if (!('value' in newProps)) {\n      if (!hasWarnedAboutUsingNoValuePropOnContextProvider) {\n        hasWarnedAboutUsingNoValuePropOnContextProvider = true;\n\n        error('The `value` prop is required for the `<Context.Provider>`. Did you misspell it or forget to pass it?');\n      }\n    }\n\n    var providerPropTypes = workInProgress.type.propTypes;\n\n    if (providerPropTypes) {\n      checkPropTypes(providerPropTypes, newProps, 'prop', 'Context.Provider');\n    }\n  }\n\n  pushProvider(workInProgress, context, newValue);\n\n  {\n    if (oldProps !== null) {\n      var oldValue = oldProps.value;\n\n      if (objectIs(oldValue, newValue)) {\n        // No change. Bailout early if children are the same.\n        if (oldProps.children === newProps.children && !hasContextChanged()) {\n          return bailoutOnAlreadyFinishedWork(current, workInProgress, renderLanes);\n        }\n      } else {\n        // The context value changed. Search for matching consumers and schedule\n        // them to update.\n        propagateContextChange(workInProgress, context, renderLanes);\n      }\n    }\n  }\n\n  var newChildren = newProps.children;\n  reconcileChildren(current, workInProgress, newChildren, renderLanes);\n  return workInProgress.child;\n}\n\nvar hasWarnedAboutUsingContextAsConsumer = false;\n\nfunction updateContextConsumer(current, workInProgress, renderLanes) {\n  var context = workInProgress.type; // The logic below for Context differs depending on PROD or DEV mode. In\n  // DEV mode, we create a separate object for Context.Consumer that acts\n  // like a proxy to Context. This proxy object adds unnecessary code in PROD\n  // so we use the old behaviour (Context.Consumer references Context) to\n  // reduce size and overhead. The separate object references context via\n  // a property called \"_context\", which also gives us the ability to check\n  // in DEV mode if this property exists or not and warn if it does not.\n\n  {\n    if (context._context === undefined) {\n      // This may be because it's a Context (rather than a Consumer).\n      // Or it may be because it's older React where they're the same thing.\n      // We only want to warn if we're sure it's a new React.\n      if (context !== context.Consumer) {\n        if (!hasWarnedAboutUsingContextAsConsumer) {\n          hasWarnedAboutUsingContextAsConsumer = true;\n\n          error('Rendering <Context> directly is not supported and will be removed in ' + 'a future major release. Did you mean to render <Context.Consumer> instead?');\n        }\n      }\n    } else {\n      context = context._context;\n    }\n  }\n\n  var newProps = workInProgress.pendingProps;\n  var render = newProps.children;\n\n  {\n    if (typeof render !== 'function') {\n      error('A context consumer was rendered with multiple children, or a child ' + \"that isn't a function. A context consumer expects a single child \" + 'that is a function. If you did pass a function, make sure there ' + 'is no trailing or leading whitespace around it.');\n    }\n  }\n\n  prepareToReadContext(workInProgress, renderLanes);\n  var newValue = readContext(context);\n\n  {\n    markComponentRenderStarted(workInProgress);\n  }\n\n  var newChildren;\n\n  {\n    ReactCurrentOwner$1.current = workInProgress;\n    setIsRendering(true);\n    newChildren = render(newValue);\n    setIsRendering(false);\n  }\n\n  {\n    markComponentRenderStopped();\n  } // React DevTools reads this flag.\n\n\n  workInProgress.flags |= PerformedWork;\n  reconcileChildren(current, workInProgress, newChildren, renderLanes);\n  return workInProgress.child;\n}\n\nfunction markWorkInProgressReceivedUpdate() {\n  didReceiveUpdate = true;\n}\n\nfunction resetSuspendedCurrentOnMountInLegacyMode(current, workInProgress) {\n  if ((workInProgress.mode & ConcurrentMode) === NoMode) {\n    if (current !== null) {\n      // A lazy component only mounts if it suspended inside a non-\n      // concurrent tree, in an inconsistent state. We want to treat it like\n      // a new mount, even though an empty version of it already committed.\n      // Disconnect the alternate pointers.\n      current.alternate = null;\n      workInProgress.alternate = null; // Since this is conceptually a new fiber, schedule a Placement effect\n\n      workInProgress.flags |= Placement;\n    }\n  }\n}\n\nfunction bailoutOnAlreadyFinishedWork(current, workInProgress, renderLanes) {\n  if (current !== null) {\n    // Reuse previous dependencies\n    workInProgress.dependencies = current.dependencies;\n  }\n\n  {\n    // Don't update \"base\" render times for bailouts.\n    stopProfilerTimerIfRunning();\n  }\n\n  markSkippedUpdateLanes(workInProgress.lanes); // Check if the children have any pending work.\n\n  if (!includesSomeLane(renderLanes, workInProgress.childLanes)) {\n    // The children don't have any work either. We can skip them.\n    // TODO: Once we add back resuming, we should check if the children are\n    // a work-in-progress set. If so, we need to transfer their effects.\n    {\n      return null;\n    }\n  } // This fiber doesn't have work, but its subtree does. Clone the child\n  // fibers and continue.\n\n\n  cloneChildFibers(current, workInProgress);\n  return workInProgress.child;\n}\n\nfunction remountFiber(current, oldWorkInProgress, newWorkInProgress) {\n  {\n    var returnFiber = oldWorkInProgress.return;\n\n    if (returnFiber === null) {\n      // eslint-disable-next-line react-internal/prod-error-codes\n      throw new Error('Cannot swap the root fiber.');\n    } // Disconnect from the old current.\n    // It will get deleted.\n\n\n    current.alternate = null;\n    oldWorkInProgress.alternate = null; // Connect to the new tree.\n\n    newWorkInProgress.index = oldWorkInProgress.index;\n    newWorkInProgress.sibling = oldWorkInProgress.sibling;\n    newWorkInProgress.return = oldWorkInProgress.return;\n    newWorkInProgress.ref = oldWorkInProgress.ref; // Replace the child/sibling pointers above it.\n\n    if (oldWorkInProgress === returnFiber.child) {\n      returnFiber.child = newWorkInProgress;\n    } else {\n      var prevSibling = returnFiber.child;\n\n      if (prevSibling === null) {\n        // eslint-disable-next-line react-internal/prod-error-codes\n        throw new Error('Expected parent to have a child.');\n      }\n\n      while (prevSibling.sibling !== oldWorkInProgress) {\n        prevSibling = prevSibling.sibling;\n\n        if (prevSibling === null) {\n          // eslint-disable-next-line react-internal/prod-error-codes\n          throw new Error('Expected to find the previous sibling.');\n        }\n      }\n\n      prevSibling.sibling = newWorkInProgress;\n    } // Delete the old fiber and place the new one.\n    // Since the old fiber is disconnected, we have to schedule it manually.\n\n\n    var deletions = returnFiber.deletions;\n\n    if (deletions === null) {\n      returnFiber.deletions = [current];\n      returnFiber.flags |= ChildDeletion;\n    } else {\n      deletions.push(current);\n    }\n\n    newWorkInProgress.flags |= Placement; // Restart work from the new fiber.\n\n    return newWorkInProgress;\n  }\n}\n\nfunction checkScheduledUpdateOrContext(current, renderLanes) {\n  // Before performing an early bailout, we must check if there are pending\n  // updates or context.\n  var updateLanes = current.lanes;\n\n  if (includesSomeLane(updateLanes, renderLanes)) {\n    return true;\n  } // No pending update, but because context is propagated lazily, we need\n\n  return false;\n}\n\nfunction attemptEarlyBailoutIfNoScheduledUpdate(current, workInProgress, renderLanes) {\n  // This fiber does not have any pending work. Bailout without entering\n  // the begin phase. There's still some bookkeeping we that needs to be done\n  // in this optimized path, mostly pushing stuff onto the stack.\n  switch (workInProgress.tag) {\n    case HostRoot:\n      pushHostRootContext(workInProgress);\n      var root = workInProgress.stateNode;\n\n      resetHydrationState();\n      break;\n\n    case HostComponent:\n      pushHostContext(workInProgress);\n      break;\n\n    case ClassComponent:\n      {\n        var Component = workInProgress.type;\n\n        if (isContextProvider(Component)) {\n          pushContextProvider(workInProgress);\n        }\n\n        break;\n      }\n\n    case HostPortal:\n      pushHostContainer(workInProgress, workInProgress.stateNode.containerInfo);\n      break;\n\n    case ContextProvider:\n      {\n        var newValue = workInProgress.memoizedProps.value;\n        var context = workInProgress.type._context;\n        pushProvider(workInProgress, context, newValue);\n        break;\n      }\n\n    case Profiler:\n      {\n        // Profiler should only call onRender when one of its descendants actually rendered.\n        var hasChildWork = includesSomeLane(renderLanes, workInProgress.childLanes);\n\n        if (hasChildWork) {\n          workInProgress.flags |= Update;\n        }\n\n        {\n          // Reset effect durations for the next eventual effect phase.\n          // These are reset during render to allow the DevTools commit hook a chance to read them,\n          var stateNode = workInProgress.stateNode;\n          stateNode.effectDuration = 0;\n          stateNode.passiveEffectDuration = 0;\n        }\n      }\n\n      break;\n\n    case SuspenseComponent:\n      {\n        var state = workInProgress.memoizedState;\n\n        if (state !== null) {\n          if (state.dehydrated !== null) {\n            pushSuspenseContext(workInProgress, setDefaultShallowSuspenseContext(suspenseStackCursor.current)); // We know that this component will suspend again because if it has\n            // been unsuspended it has committed as a resolved Suspense component.\n            // If it needs to be retried, it should have work scheduled on it.\n\n            workInProgress.flags |= DidCapture; // We should never render the children of a dehydrated boundary until we\n            // upgrade it. We return null instead of bailoutOnAlreadyFinishedWork.\n\n            return null;\n          } // If this boundary is currently timed out, we need to decide\n          // whether to retry the primary children, or to skip over it and\n          // go straight to the fallback. Check the priority of the primary\n          // child fragment.\n\n\n          var primaryChildFragment = workInProgress.child;\n          var primaryChildLanes = primaryChildFragment.childLanes;\n\n          if (includesSomeLane(renderLanes, primaryChildLanes)) {\n            // The primary children have pending work. Use the normal path\n            // to attempt to render the primary children again.\n            return updateSuspenseComponent(current, workInProgress, renderLanes);\n          } else {\n            // The primary child fragment does not have pending work marked\n            // on it\n            pushSuspenseContext(workInProgress, setDefaultShallowSuspenseContext(suspenseStackCursor.current)); // The primary children do not have pending work with sufficient\n            // priority. Bailout.\n\n            var child = bailoutOnAlreadyFinishedWork(current, workInProgress, renderLanes);\n\n            if (child !== null) {\n              // The fallback children have pending work. Skip over the\n              // primary children and work on the fallback.\n              return child.sibling;\n            } else {\n              // Note: We can return `null` here because we already checked\n              // whether there were nested context consumers, via the call to\n              // `bailoutOnAlreadyFinishedWork` above.\n              return null;\n            }\n          }\n        } else {\n          pushSuspenseContext(workInProgress, setDefaultShallowSuspenseContext(suspenseStackCursor.current));\n        }\n\n        break;\n      }\n\n    case SuspenseListComponent:\n      {\n        var didSuspendBefore = (current.flags & DidCapture) !== NoFlags;\n\n        var _hasChildWork = includesSomeLane(renderLanes, workInProgress.childLanes);\n\n        if (didSuspendBefore) {\n          if (_hasChildWork) {\n            // If something was in fallback state last time, and we have all the\n            // same children then we're still in progressive loading state.\n            // Something might get unblocked by state updates or retries in the\n            // tree which will affect the tail. So we need to use the normal\n            // path to compute the correct tail.\n            return updateSuspenseListComponent(current, workInProgress, renderLanes);\n          } // If none of the children had any work, that means that none of\n          // them got retried so they'll still be blocked in the same way\n          // as before. We can fast bail out.\n\n\n          workInProgress.flags |= DidCapture;\n        } // If nothing suspended before and we're rendering the same children,\n        // then the tail doesn't matter. Anything new that suspends will work\n        // in the \"together\" mode, so we can continue from the state we had.\n\n\n        var renderState = workInProgress.memoizedState;\n\n        if (renderState !== null) {\n          // Reset to the \"together\" mode in case we've started a different\n          // update in the past but didn't complete it.\n          renderState.rendering = null;\n          renderState.tail = null;\n          renderState.lastEffect = null;\n        }\n\n        pushSuspenseContext(workInProgress, suspenseStackCursor.current);\n\n        if (_hasChildWork) {\n          break;\n        } else {\n          // If none of the children had any work, that means that none of\n          // them got retried so they'll still be blocked in the same way\n          // as before. We can fast bail out.\n          return null;\n        }\n      }\n\n    case OffscreenComponent:\n    case LegacyHiddenComponent:\n      {\n        // Need to check if the tree still needs to be deferred. This is\n        // almost identical to the logic used in the normal update path,\n        // so we'll just enter that. The only difference is we'll bail out\n        // at the next level instead of this one, because the child props\n        // have not changed. Which is fine.\n        // TODO: Probably should refactor `beginWork` to split the bailout\n        // path from the normal path. I'm tempted to do a labeled break here\n        // but I won't :)\n        workInProgress.lanes = NoLanes;\n        return updateOffscreenComponent(current, workInProgress, renderLanes);\n      }\n  }\n\n  return bailoutOnAlreadyFinishedWork(current, workInProgress, renderLanes);\n}\n\nfunction beginWork(current, workInProgress, renderLanes) {\n  {\n    if (workInProgress._debugNeedsRemount && current !== null) {\n      // This will restart the begin phase with a new fiber.\n      return remountFiber(current, workInProgress, createFiberFromTypeAndProps(workInProgress.type, workInProgress.key, workInProgress.pendingProps, workInProgress._debugOwner || null, workInProgress.mode, workInProgress.lanes));\n    }\n  }\n\n  if (current !== null) {\n    var oldProps = current.memoizedProps;\n    var newProps = workInProgress.pendingProps;\n\n    if (oldProps !== newProps || hasContextChanged() || ( // Force a re-render if the implementation changed due to hot reload:\n     workInProgress.type !== current.type )) {\n      // If props or context changed, mark the fiber as having performed work.\n      // This may be unset if the props are determined to be equal later (memo).\n      didReceiveUpdate = true;\n    } else {\n      // Neither props nor legacy context changes. Check if there's a pending\n      // update or context change.\n      var hasScheduledUpdateOrContext = checkScheduledUpdateOrContext(current, renderLanes);\n\n      if (!hasScheduledUpdateOrContext && // If this is the second pass of an error or suspense boundary, there\n      // may not be work scheduled on `current`, so we check for this flag.\n      (workInProgress.flags & DidCapture) === NoFlags) {\n        // No pending updates or context. Bail out now.\n        didReceiveUpdate = false;\n        return attemptEarlyBailoutIfNoScheduledUpdate(current, workInProgress, renderLanes);\n      }\n\n      if ((current.flags & ForceUpdateForLegacySuspense) !== NoFlags) {\n        // This is a special case that only exists for legacy mode.\n        // See https://github.com/facebook/react/pull/19216.\n        didReceiveUpdate = true;\n      } else {\n        // An update was scheduled on this fiber, but there are no new props\n        // nor legacy context. Set this to false. If an update queue or context\n        // consumer produces a changed value, it will set this to true. Otherwise,\n        // the component will assume the children have not changed and bail out.\n        didReceiveUpdate = false;\n      }\n    }\n  } else {\n    didReceiveUpdate = false;\n\n    if (getIsHydrating() && isForkedChild(workInProgress)) {\n      // Check if this child belongs to a list of muliple children in\n      // its parent.\n      //\n      // In a true multi-threaded implementation, we would render children on\n      // parallel threads. This would represent the beginning of a new render\n      // thread for this subtree.\n      //\n      // We only use this for id generation during hydration, which is why the\n      // logic is located in this special branch.\n      var slotIndex = workInProgress.index;\n      var numberOfForks = getForksAtLevel();\n      pushTreeId(workInProgress, numberOfForks, slotIndex);\n    }\n  } // Before entering the begin phase, clear pending update priority.\n  // TODO: This assumes that we're about to evaluate the component and process\n  // the update queue. However, there's an exception: SimpleMemoComponent\n  // sometimes bails out later in the begin phase. This indicates that we should\n  // move this assignment out of the common path and into each branch.\n\n\n  workInProgress.lanes = NoLanes;\n\n  switch (workInProgress.tag) {\n    case IndeterminateComponent:\n      {\n        return mountIndeterminateComponent(current, workInProgress, workInProgress.type, renderLanes);\n      }\n\n    case LazyComponent:\n      {\n        var elementType = workInProgress.elementType;\n        return mountLazyComponent(current, workInProgress, elementType, renderLanes);\n      }\n\n    case FunctionComponent:\n      {\n        var Component = workInProgress.type;\n        var unresolvedProps = workInProgress.pendingProps;\n        var resolvedProps = workInProgress.elementType === Component ? unresolvedProps : resolveDefaultProps(Component, unresolvedProps);\n        return updateFunctionComponent(current, workInProgress, Component, resolvedProps, renderLanes);\n      }\n\n    case ClassComponent:\n      {\n        var _Component = workInProgress.type;\n        var _unresolvedProps = workInProgress.pendingProps;\n\n        var _resolvedProps = workInProgress.elementType === _Component ? _unresolvedProps : resolveDefaultProps(_Component, _unresolvedProps);\n\n        return updateClassComponent(current, workInProgress, _Component, _resolvedProps, renderLanes);\n      }\n\n    case HostRoot:\n      return updateHostRoot(current, workInProgress, renderLanes);\n\n    case HostComponent:\n      return updateHostComponent(current, workInProgress, renderLanes);\n\n    case HostText:\n      return updateHostText(current, workInProgress);\n\n    case SuspenseComponent:\n      return updateSuspenseComponent(current, workInProgress, renderLanes);\n\n    case HostPortal:\n      return updatePortalComponent(current, workInProgress, renderLanes);\n\n    case ForwardRef:\n      {\n        var type = workInProgress.type;\n        var _unresolvedProps2 = workInProgress.pendingProps;\n\n        var _resolvedProps2 = workInProgress.elementType === type ? _unresolvedProps2 : resolveDefaultProps(type, _unresolvedProps2);\n\n        return updateForwardRef(current, workInProgress, type, _resolvedProps2, renderLanes);\n      }\n\n    case Fragment:\n      return updateFragment(current, workInProgress, renderLanes);\n\n    case Mode:\n      return updateMode(current, workInProgress, renderLanes);\n\n    case Profiler:\n      return updateProfiler(current, workInProgress, renderLanes);\n\n    case ContextProvider:\n      return updateContextProvider(current, workInProgress, renderLanes);\n\n    case ContextConsumer:\n      return updateContextConsumer(current, workInProgress, renderLanes);\n\n    case MemoComponent:\n      {\n        var _type2 = workInProgress.type;\n        var _unresolvedProps3 = workInProgress.pendingProps; // Resolve outer props first, then resolve inner props.\n\n        var _resolvedProps3 = resolveDefaultProps(_type2, _unresolvedProps3);\n\n        {\n          if (workInProgress.type !== workInProgress.elementType) {\n            var outerPropTypes = _type2.propTypes;\n\n            if (outerPropTypes) {\n              checkPropTypes(outerPropTypes, _resolvedProps3, // Resolved for outer only\n              'prop', getComponentNameFromType(_type2));\n            }\n          }\n        }\n\n        _resolvedProps3 = resolveDefaultProps(_type2.type, _resolvedProps3);\n        return updateMemoComponent(current, workInProgress, _type2, _resolvedProps3, renderLanes);\n      }\n\n    case SimpleMemoComponent:\n      {\n        return updateSimpleMemoComponent(current, workInProgress, workInProgress.type, workInProgress.pendingProps, renderLanes);\n      }\n\n    case IncompleteClassComponent:\n      {\n        var _Component2 = workInProgress.type;\n        var _unresolvedProps4 = workInProgress.pendingProps;\n\n        var _resolvedProps4 = workInProgress.elementType === _Component2 ? _unresolvedProps4 : resolveDefaultProps(_Component2, _unresolvedProps4);\n\n        return mountIncompleteClassComponent(current, workInProgress, _Component2, _resolvedProps4, renderLanes);\n      }\n\n    case SuspenseListComponent:\n      {\n        return updateSuspenseListComponent(current, workInProgress, renderLanes);\n      }\n\n    case ScopeComponent:\n      {\n\n        break;\n      }\n\n    case OffscreenComponent:\n      {\n        return updateOffscreenComponent(current, workInProgress, renderLanes);\n      }\n  }\n\n  throw new Error(\"Unknown unit of work tag (\" + workInProgress.tag + \"). This error is likely caused by a bug in \" + 'React. Please file an issue.');\n}\n\nfunction markUpdate(workInProgress) {\n  // Tag the fiber with an update effect. This turns a Placement into\n  // a PlacementAndUpdate.\n  workInProgress.flags |= Update;\n}\n\nfunction markRef$1(workInProgress) {\n  workInProgress.flags |= Ref;\n\n  {\n    workInProgress.flags |= RefStatic;\n  }\n}\n\nvar appendAllChildren;\nvar updateHostContainer;\nvar updateHostComponent$1;\nvar updateHostText$1;\n\n{\n  // Mutation mode\n  appendAllChildren = function (parent, workInProgress, needsVisibilityToggle, isHidden) {\n    // We only have the top Fiber that was created but we need recurse down its\n    // children to find all the terminal nodes.\n    var node = workInProgress.child;\n\n    while (node !== null) {\n      if (node.tag === HostComponent || node.tag === HostText) {\n        appendInitialChild(parent, node.stateNode);\n      } else if (node.tag === HostPortal) ; else if (node.child !== null) {\n        node.child.return = node;\n        node = node.child;\n        continue;\n      }\n\n      if (node === workInProgress) {\n        return;\n      }\n\n      while (node.sibling === null) {\n        if (node.return === null || node.return === workInProgress) {\n          return;\n        }\n\n        node = node.return;\n      }\n\n      node.sibling.return = node.return;\n      node = node.sibling;\n    }\n  };\n\n  updateHostContainer = function (current, workInProgress) {// Noop\n  };\n\n  updateHostComponent$1 = function (current, workInProgress, type, newProps, rootContainerInstance) {\n    // If we have an alternate, that means this is an update and we need to\n    // schedule a side-effect to do the updates.\n    var oldProps = current.memoizedProps;\n\n    if (oldProps === newProps) {\n      // In mutation mode, this is sufficient for a bailout because\n      // we won't touch this node even if children changed.\n      return;\n    } // If we get updated because one of our children updated, we don't\n    // have newProps so we'll have to reuse them.\n    // TODO: Split the update API as separate for the props vs. children.\n    // Even better would be if children weren't special cased at all tho.\n\n\n    var instance = workInProgress.stateNode;\n    var currentHostContext = getHostContext(); // TODO: Experiencing an error where oldProps is null. Suggests a host\n    // component is hitting the resume path. Figure out why. Possibly\n    // related to `hidden`.\n\n    var updatePayload = prepareUpdate(instance, type, oldProps, newProps, rootContainerInstance, currentHostContext); // TODO: Type this specific to this type of component.\n\n    workInProgress.updateQueue = updatePayload; // If the update payload indicates that there is a change or if there\n    // is a new ref we mark this as an update. All the work is done in commitWork.\n\n    if (updatePayload) {\n      markUpdate(workInProgress);\n    }\n  };\n\n  updateHostText$1 = function (current, workInProgress, oldText, newText) {\n    // If the text differs, mark it as an update. All the work in done in commitWork.\n    if (oldText !== newText) {\n      markUpdate(workInProgress);\n    }\n  };\n}\n\nfunction cutOffTailIfNeeded(renderState, hasRenderedATailFallback) {\n  if (getIsHydrating()) {\n    // If we're hydrating, we should consume as many items as we can\n    // so we don't leave any behind.\n    return;\n  }\n\n  switch (renderState.tailMode) {\n    case 'hidden':\n      {\n        // Any insertions at the end of the tail list after this point\n        // should be invisible. If there are already mounted boundaries\n        // anything before them are not considered for collapsing.\n        // Therefore we need to go through the whole tail to find if\n        // there are any.\n        var tailNode = renderState.tail;\n        var lastTailNode = null;\n\n        while (tailNode !== null) {\n          if (tailNode.alternate !== null) {\n            lastTailNode = tailNode;\n          }\n\n          tailNode = tailNode.sibling;\n        } // Next we're simply going to delete all insertions after the\n        // last rendered item.\n\n\n        if (lastTailNode === null) {\n          // All remaining items in the tail are insertions.\n          renderState.tail = null;\n        } else {\n          // Detach the insertion after the last node that was already\n          // inserted.\n          lastTailNode.sibling = null;\n        }\n\n        break;\n      }\n\n    case 'collapsed':\n      {\n        // Any insertions at the end of the tail list after this point\n        // should be invisible. If there are already mounted boundaries\n        // anything before them are not considered for collapsing.\n        // Therefore we need to go through the whole tail to find if\n        // there are any.\n        var _tailNode = renderState.tail;\n        var _lastTailNode = null;\n\n        while (_tailNode !== null) {\n          if (_tailNode.alternate !== null) {\n            _lastTailNode = _tailNode;\n          }\n\n          _tailNode = _tailNode.sibling;\n        } // Next we're simply going to delete all insertions after the\n        // last rendered item.\n\n\n        if (_lastTailNode === null) {\n          // All remaining items in the tail are insertions.\n          if (!hasRenderedATailFallback && renderState.tail !== null) {\n            // We suspended during the head. We want to show at least one\n            // row at the tail. So we'll keep on and cut off the rest.\n            renderState.tail.sibling = null;\n          } else {\n            renderState.tail = null;\n          }\n        } else {\n          // Detach the insertion after the last node that was already\n          // inserted.\n          _lastTailNode.sibling = null;\n        }\n\n        break;\n      }\n  }\n}\n\nfunction bubbleProperties(completedWork) {\n  var didBailout = completedWork.alternate !== null && completedWork.alternate.child === completedWork.child;\n  var newChildLanes = NoLanes;\n  var subtreeFlags = NoFlags;\n\n  if (!didBailout) {\n    // Bubble up the earliest expiration time.\n    if ( (completedWork.mode & ProfileMode) !== NoMode) {\n      // In profiling mode, resetChildExpirationTime is also used to reset\n      // profiler durations.\n      var actualDuration = completedWork.actualDuration;\n      var treeBaseDuration = completedWork.selfBaseDuration;\n      var child = completedWork.child;\n\n      while (child !== null) {\n        newChildLanes = mergeLanes(newChildLanes, mergeLanes(child.lanes, child.childLanes));\n        subtreeFlags |= child.subtreeFlags;\n        subtreeFlags |= child.flags; // When a fiber is cloned, its actualDuration is reset to 0. This value will\n        // only be updated if work is done on the fiber (i.e. it doesn't bailout).\n        // When work is done, it should bubble to the parent's actualDuration. If\n        // the fiber has not been cloned though, (meaning no work was done), then\n        // this value will reflect the amount of time spent working on a previous\n        // render. In that case it should not bubble. We determine whether it was\n        // cloned by comparing the child pointer.\n\n        actualDuration += child.actualDuration;\n        treeBaseDuration += child.treeBaseDuration;\n        child = child.sibling;\n      }\n\n      completedWork.actualDuration = actualDuration;\n      completedWork.treeBaseDuration = treeBaseDuration;\n    } else {\n      var _child = completedWork.child;\n\n      while (_child !== null) {\n        newChildLanes = mergeLanes(newChildLanes, mergeLanes(_child.lanes, _child.childLanes));\n        subtreeFlags |= _child.subtreeFlags;\n        subtreeFlags |= _child.flags; // Update the return pointer so the tree is consistent. This is a code\n        // smell because it assumes the commit phase is never concurrent with\n        // the render phase. Will address during refactor to alternate model.\n\n        _child.return = completedWork;\n        _child = _child.sibling;\n      }\n    }\n\n    completedWork.subtreeFlags |= subtreeFlags;\n  } else {\n    // Bubble up the earliest expiration time.\n    if ( (completedWork.mode & ProfileMode) !== NoMode) {\n      // In profiling mode, resetChildExpirationTime is also used to reset\n      // profiler durations.\n      var _treeBaseDuration = completedWork.selfBaseDuration;\n      var _child2 = completedWork.child;\n\n      while (_child2 !== null) {\n        newChildLanes = mergeLanes(newChildLanes, mergeLanes(_child2.lanes, _child2.childLanes)); // \"Static\" flags share the lifetime of the fiber/hook they belong to,\n        // so we should bubble those up even during a bailout. All the other\n        // flags have a lifetime only of a single render + commit, so we should\n        // ignore them.\n\n        subtreeFlags |= _child2.subtreeFlags & StaticMask;\n        subtreeFlags |= _child2.flags & StaticMask;\n        _treeBaseDuration += _child2.treeBaseDuration;\n        _child2 = _child2.sibling;\n      }\n\n      completedWork.treeBaseDuration = _treeBaseDuration;\n    } else {\n      var _child3 = completedWork.child;\n\n      while (_child3 !== null) {\n        newChildLanes = mergeLanes(newChildLanes, mergeLanes(_child3.lanes, _child3.childLanes)); // \"Static\" flags share the lifetime of the fiber/hook they belong to,\n        // so we should bubble those up even during a bailout. All the other\n        // flags have a lifetime only of a single render + commit, so we should\n        // ignore them.\n\n        subtreeFlags |= _child3.subtreeFlags & StaticMask;\n        subtreeFlags |= _child3.flags & StaticMask; // Update the return pointer so the tree is consistent. This is a code\n        // smell because it assumes the commit phase is never concurrent with\n        // the render phase. Will address during refactor to alternate model.\n\n        _child3.return = completedWork;\n        _child3 = _child3.sibling;\n      }\n    }\n\n    completedWork.subtreeFlags |= subtreeFlags;\n  }\n\n  completedWork.childLanes = newChildLanes;\n  return didBailout;\n}\n\nfunction completeDehydratedSuspenseBoundary(current, workInProgress, nextState) {\n  if (hasUnhydratedTailNodes() && (workInProgress.mode & ConcurrentMode) !== NoMode && (workInProgress.flags & DidCapture) === NoFlags) {\n    warnIfUnhydratedTailNodes(workInProgress);\n    resetHydrationState();\n    workInProgress.flags |= ForceClientRender | Incomplete | ShouldCapture;\n    return false;\n  }\n\n  var wasHydrated = popHydrationState(workInProgress);\n\n  if (nextState !== null && nextState.dehydrated !== null) {\n    // We might be inside a hydration state the first time we're picking up this\n    // Suspense boundary, and also after we've reentered it for further hydration.\n    if (current === null) {\n      if (!wasHydrated) {\n        throw new Error('A dehydrated suspense component was completed without a hydrated node. ' + 'This is probably a bug in React.');\n      }\n\n      prepareToHydrateHostSuspenseInstance(workInProgress);\n      bubbleProperties(workInProgress);\n\n      {\n        if ((workInProgress.mode & ProfileMode) !== NoMode) {\n          var isTimedOutSuspense = nextState !== null;\n\n          if (isTimedOutSuspense) {\n            // Don't count time spent in a timed out Suspense subtree as part of the base duration.\n            var primaryChildFragment = workInProgress.child;\n\n            if (primaryChildFragment !== null) {\n              // $FlowFixMe Flow doesn't support type casting in combination with the -= operator\n              workInProgress.treeBaseDuration -= primaryChildFragment.treeBaseDuration;\n            }\n          }\n        }\n      }\n\n      return false;\n    } else {\n      // We might have reentered this boundary to hydrate it. If so, we need to reset the hydration\n      // state since we're now exiting out of it. popHydrationState doesn't do that for us.\n      resetHydrationState();\n\n      if ((workInProgress.flags & DidCapture) === NoFlags) {\n        // This boundary did not suspend so it's now hydrated and unsuspended.\n        workInProgress.memoizedState = null;\n      } // If nothing suspended, we need to schedule an effect to mark this boundary\n      // as having hydrated so events know that they're free to be invoked.\n      // It's also a signal to replay events and the suspense callback.\n      // If something suspended, schedule an effect to attach retry listeners.\n      // So we might as well always mark this.\n\n\n      workInProgress.flags |= Update;\n      bubbleProperties(workInProgress);\n\n      {\n        if ((workInProgress.mode & ProfileMode) !== NoMode) {\n          var _isTimedOutSuspense = nextState !== null;\n\n          if (_isTimedOutSuspense) {\n            // Don't count time spent in a timed out Suspense subtree as part of the base duration.\n            var _primaryChildFragment = workInProgress.child;\n\n            if (_primaryChildFragment !== null) {\n              // $FlowFixMe Flow doesn't support type casting in combination with the -= operator\n              workInProgress.treeBaseDuration -= _primaryChildFragment.treeBaseDuration;\n            }\n          }\n        }\n      }\n\n      return false;\n    }\n  } else {\n    // Successfully completed this tree. If this was a forced client render,\n    // there may have been recoverable errors during first hydration\n    // attempt. If so, add them to a queue so we can log them in the\n    // commit phase.\n    upgradeHydrationErrorsToRecoverable(); // Fall through to normal Suspense path\n\n    return true;\n  }\n}\n\nfunction completeWork(current, workInProgress, renderLanes) {\n  var newProps = workInProgress.pendingProps; // Note: This intentionally doesn't check if we're hydrating because comparing\n  // to the current tree provider fiber is just as fast and less error-prone.\n  // Ideally we would have a special version of the work loop only\n  // for hydration.\n\n  popTreeContext(workInProgress);\n\n  switch (workInProgress.tag) {\n    case IndeterminateComponent:\n    case LazyComponent:\n    case SimpleMemoComponent:\n    case FunctionComponent:\n    case ForwardRef:\n    case Fragment:\n    case Mode:\n    case Profiler:\n    case ContextConsumer:\n    case MemoComponent:\n      bubbleProperties(workInProgress);\n      return null;\n\n    case ClassComponent:\n      {\n        var Component = workInProgress.type;\n\n        if (isContextProvider(Component)) {\n          popContext(workInProgress);\n        }\n\n        bubbleProperties(workInProgress);\n        return null;\n      }\n\n    case HostRoot:\n      {\n        var fiberRoot = workInProgress.stateNode;\n        popHostContainer(workInProgress);\n        popTopLevelContextObject(workInProgress);\n        resetWorkInProgressVersions();\n\n        if (fiberRoot.pendingContext) {\n          fiberRoot.context = fiberRoot.pendingContext;\n          fiberRoot.pendingContext = null;\n        }\n\n        if (current === null || current.child === null) {\n          // If we hydrated, pop so that we can delete any remaining children\n          // that weren't hydrated.\n          var wasHydrated = popHydrationState(workInProgress);\n\n          if (wasHydrated) {\n            // If we hydrated, then we'll need to schedule an update for\n            // the commit side-effects on the root.\n            markUpdate(workInProgress);\n          } else {\n            if (current !== null) {\n              var prevState = current.memoizedState;\n\n              if ( // Check if this is a client root\n              !prevState.isDehydrated || // Check if we reverted to client rendering (e.g. due to an error)\n              (workInProgress.flags & ForceClientRender) !== NoFlags) {\n                // Schedule an effect to clear this container at the start of the\n                // next commit. This handles the case of React rendering into a\n                // container with previous children. It's also safe to do for\n                // updates too, because current.child would only be null if the\n                // previous render was null (so the container would already\n                // be empty).\n                workInProgress.flags |= Snapshot; // If this was a forced client render, there may have been\n                // recoverable errors during first hydration attempt. If so, add\n                // them to a queue so we can log them in the commit phase.\n\n                upgradeHydrationErrorsToRecoverable();\n              }\n            }\n          }\n        }\n\n        updateHostContainer(current, workInProgress);\n        bubbleProperties(workInProgress);\n\n        return null;\n      }\n\n    case HostComponent:\n      {\n        popHostContext(workInProgress);\n        var rootContainerInstance = getRootHostContainer();\n        var type = workInProgress.type;\n\n        if (current !== null && workInProgress.stateNode != null) {\n          updateHostComponent$1(current, workInProgress, type, newProps, rootContainerInstance);\n\n          if (current.ref !== workInProgress.ref) {\n            markRef$1(workInProgress);\n          }\n        } else {\n          if (!newProps) {\n            if (workInProgress.stateNode === null) {\n              throw new Error('We must have new props for new mounts. This error is likely ' + 'caused by a bug in React. Please file an issue.');\n            } // This can happen when we abort work.\n\n\n            bubbleProperties(workInProgress);\n            return null;\n          }\n\n          var currentHostContext = getHostContext(); // TODO: Move createInstance to beginWork and keep it on a context\n          // \"stack\" as the parent. Then append children as we go in beginWork\n          // or completeWork depending on whether we want to add them top->down or\n          // bottom->up. Top->down is faster in IE11.\n\n          var _wasHydrated = popHydrationState(workInProgress);\n\n          if (_wasHydrated) {\n            // TODO: Move this and createInstance step into the beginPhase\n            // to consolidate.\n            if (prepareToHydrateHostInstance(workInProgress, rootContainerInstance, currentHostContext)) {\n              // If changes to the hydrated node need to be applied at the\n              // commit-phase we mark this as such.\n              markUpdate(workInProgress);\n            }\n          } else {\n            var instance = createInstance(type, newProps, rootContainerInstance, currentHostContext, workInProgress);\n            appendAllChildren(instance, workInProgress, false, false);\n            workInProgress.stateNode = instance; // Certain renderers require commit-time effects for initial mount.\n            // (eg DOM renderer supports auto-focus for certain elements).\n            // Make sure such renderers get scheduled for later work.\n\n            if (finalizeInitialChildren(instance, type, newProps, rootContainerInstance)) {\n              markUpdate(workInProgress);\n            }\n          }\n\n          if (workInProgress.ref !== null) {\n            // If there is a ref on a host node we need to schedule a callback\n            markRef$1(workInProgress);\n          }\n        }\n\n        bubbleProperties(workInProgress);\n        return null;\n      }\n\n    case HostText:\n      {\n        var newText = newProps;\n\n        if (current && workInProgress.stateNode != null) {\n          var oldText = current.memoizedProps; // If we have an alternate, that means this is an update and we need\n          // to schedule a side-effect to do the updates.\n\n          updateHostText$1(current, workInProgress, oldText, newText);\n        } else {\n          if (typeof newText !== 'string') {\n            if (workInProgress.stateNode === null) {\n              throw new Error('We must have new props for new mounts. This error is likely ' + 'caused by a bug in React. Please file an issue.');\n            } // This can happen when we abort work.\n\n          }\n\n          var _rootContainerInstance = getRootHostContainer();\n\n          var _currentHostContext = getHostContext();\n\n          var _wasHydrated2 = popHydrationState(workInProgress);\n\n          if (_wasHydrated2) {\n            if (prepareToHydrateHostTextInstance(workInProgress)) {\n              markUpdate(workInProgress);\n            }\n          } else {\n            workInProgress.stateNode = createTextInstance(newText, _rootContainerInstance, _currentHostContext, workInProgress);\n          }\n        }\n\n        bubbleProperties(workInProgress);\n        return null;\n      }\n\n    case SuspenseComponent:\n      {\n        popSuspenseContext(workInProgress);\n        var nextState = workInProgress.memoizedState; // Special path for dehydrated boundaries. We may eventually move this\n        // to its own fiber type so that we can add other kinds of hydration\n        // boundaries that aren't associated with a Suspense tree. In anticipation\n        // of such a refactor, all the hydration logic is contained in\n        // this branch.\n\n        if (current === null || current.memoizedState !== null && current.memoizedState.dehydrated !== null) {\n          var fallthroughToNormalSuspensePath = completeDehydratedSuspenseBoundary(current, workInProgress, nextState);\n\n          if (!fallthroughToNormalSuspensePath) {\n            if (workInProgress.flags & ShouldCapture) {\n              // Special case. There were remaining unhydrated nodes. We treat\n              // this as a mismatch. Revert to client rendering.\n              return workInProgress;\n            } else {\n              // Did not finish hydrating, either because this is the initial\n              // render or because something suspended.\n              return null;\n            }\n          } // Continue with the normal Suspense path.\n\n        }\n\n        if ((workInProgress.flags & DidCapture) !== NoFlags) {\n          // Something suspended. Re-render with the fallback children.\n          workInProgress.lanes = renderLanes; // Do not reset the effect list.\n\n          if ( (workInProgress.mode & ProfileMode) !== NoMode) {\n            transferActualDuration(workInProgress);\n          } // Don't bubble properties in this case.\n\n\n          return workInProgress;\n        }\n\n        var nextDidTimeout = nextState !== null;\n        var prevDidTimeout = current !== null && current.memoizedState !== null;\n        // a passive effect, which is when we process the transitions\n\n\n        if (nextDidTimeout !== prevDidTimeout) {\n          // an effect to toggle the subtree's visibility. When we switch from\n          // fallback -> primary, the inner Offscreen fiber schedules this effect\n          // as part of its normal complete phase. But when we switch from\n          // primary -> fallback, the inner Offscreen fiber does not have a complete\n          // phase. So we need to schedule its effect here.\n          //\n          // We also use this flag to connect/disconnect the effects, but the same\n          // logic applies: when re-connecting, the Offscreen fiber's complete\n          // phase will handle scheduling the effect. It's only when the fallback\n          // is active that we have to do anything special.\n\n\n          if (nextDidTimeout) {\n            var _offscreenFiber2 = workInProgress.child;\n            _offscreenFiber2.flags |= Visibility; // TODO: This will still suspend a synchronous tree if anything\n            // in the concurrent tree already suspended during this render.\n            // This is a known bug.\n\n            if ((workInProgress.mode & ConcurrentMode) !== NoMode) {\n              // TODO: Move this back to throwException because this is too late\n              // if this is a large tree which is common for initial loads. We\n              // don't know if we should restart a render or not until we get\n              // this marker, and this is too late.\n              // If this render already had a ping or lower pri updates,\n              // and this is the first time we know we're going to suspend we\n              // should be able to immediately restart from within throwException.\n              var hasInvisibleChildContext = current === null && (workInProgress.memoizedProps.unstable_avoidThisFallback !== true || !enableSuspenseAvoidThisFallback);\n\n              if (hasInvisibleChildContext || hasSuspenseContext(suspenseStackCursor.current, InvisibleParentSuspenseContext)) {\n                // If this was in an invisible tree or a new render, then showing\n                // this boundary is ok.\n                renderDidSuspend();\n              } else {\n                // Otherwise, we're going to have to hide content so we should\n                // suspend for longer if possible.\n                renderDidSuspendDelayIfPossible();\n              }\n            }\n          }\n        }\n\n        var wakeables = workInProgress.updateQueue;\n\n        if (wakeables !== null) {\n          // Schedule an effect to attach a retry listener to the promise.\n          // TODO: Move to passive phase\n          workInProgress.flags |= Update;\n        }\n\n        bubbleProperties(workInProgress);\n\n        {\n          if ((workInProgress.mode & ProfileMode) !== NoMode) {\n            if (nextDidTimeout) {\n              // Don't count time spent in a timed out Suspense subtree as part of the base duration.\n              var primaryChildFragment = workInProgress.child;\n\n              if (primaryChildFragment !== null) {\n                // $FlowFixMe Flow doesn't support type casting in combination with the -= operator\n                workInProgress.treeBaseDuration -= primaryChildFragment.treeBaseDuration;\n              }\n            }\n          }\n        }\n\n        return null;\n      }\n\n    case HostPortal:\n      popHostContainer(workInProgress);\n      updateHostContainer(current, workInProgress);\n\n      if (current === null) {\n        preparePortalMount(workInProgress.stateNode.containerInfo);\n      }\n\n      bubbleProperties(workInProgress);\n      return null;\n\n    case ContextProvider:\n      // Pop provider fiber\n      var context = workInProgress.type._context;\n      popProvider(context, workInProgress);\n      bubbleProperties(workInProgress);\n      return null;\n\n    case IncompleteClassComponent:\n      {\n        // Same as class component case. I put it down here so that the tags are\n        // sequential to ensure this switch is compiled to a jump table.\n        var _Component = workInProgress.type;\n\n        if (isContextProvider(_Component)) {\n          popContext(workInProgress);\n        }\n\n        bubbleProperties(workInProgress);\n        return null;\n      }\n\n    case SuspenseListComponent:\n      {\n        popSuspenseContext(workInProgress);\n        var renderState = workInProgress.memoizedState;\n\n        if (renderState === null) {\n          // We're running in the default, \"independent\" mode.\n          // We don't do anything in this mode.\n          bubbleProperties(workInProgress);\n          return null;\n        }\n\n        var didSuspendAlready = (workInProgress.flags & DidCapture) !== NoFlags;\n        var renderedTail = renderState.rendering;\n\n        if (renderedTail === null) {\n          // We just rendered the head.\n          if (!didSuspendAlready) {\n            // This is the first pass. We need to figure out if anything is still\n            // suspended in the rendered set.\n            // If new content unsuspended, but there's still some content that\n            // didn't. Then we need to do a second pass that forces everything\n            // to keep showing their fallbacks.\n            // We might be suspended if something in this render pass suspended, or\n            // something in the previous committed pass suspended. Otherwise,\n            // there's no chance so we can skip the expensive call to\n            // findFirstSuspended.\n            var cannotBeSuspended = renderHasNotSuspendedYet() && (current === null || (current.flags & DidCapture) === NoFlags);\n\n            if (!cannotBeSuspended) {\n              var row = workInProgress.child;\n\n              while (row !== null) {\n                var suspended = findFirstSuspended(row);\n\n                if (suspended !== null) {\n                  didSuspendAlready = true;\n                  workInProgress.flags |= DidCapture;\n                  cutOffTailIfNeeded(renderState, false); // If this is a newly suspended tree, it might not get committed as\n                  // part of the second pass. In that case nothing will subscribe to\n                  // its thenables. Instead, we'll transfer its thenables to the\n                  // SuspenseList so that it can retry if they resolve.\n                  // There might be multiple of these in the list but since we're\n                  // going to wait for all of them anyway, it doesn't really matter\n                  // which ones gets to ping. In theory we could get clever and keep\n                  // track of how many dependencies remain but it gets tricky because\n                  // in the meantime, we can add/remove/change items and dependencies.\n                  // We might bail out of the loop before finding any but that\n                  // doesn't matter since that means that the other boundaries that\n                  // we did find already has their listeners attached.\n\n                  var newThenables = suspended.updateQueue;\n\n                  if (newThenables !== null) {\n                    workInProgress.updateQueue = newThenables;\n                    workInProgress.flags |= Update;\n                  } // Rerender the whole list, but this time, we'll force fallbacks\n                  // to stay in place.\n                  // Reset the effect flags before doing the second pass since that's now invalid.\n                  // Reset the child fibers to their original state.\n\n\n                  workInProgress.subtreeFlags = NoFlags;\n                  resetChildFibers(workInProgress, renderLanes); // Set up the Suspense Context to force suspense and immediately\n                  // rerender the children.\n\n                  pushSuspenseContext(workInProgress, setShallowSuspenseContext(suspenseStackCursor.current, ForceSuspenseFallback)); // Don't bubble properties in this case.\n\n                  return workInProgress.child;\n                }\n\n                row = row.sibling;\n              }\n            }\n\n            if (renderState.tail !== null && now() > getRenderTargetTime()) {\n              // We have already passed our CPU deadline but we still have rows\n              // left in the tail. We'll just give up further attempts to render\n              // the main content and only render fallbacks.\n              workInProgress.flags |= DidCapture;\n              didSuspendAlready = true;\n              cutOffTailIfNeeded(renderState, false); // Since nothing actually suspended, there will nothing to ping this\n              // to get it started back up to attempt the next item. While in terms\n              // of priority this work has the same priority as this current render,\n              // it's not part of the same transition once the transition has\n              // committed. If it's sync, we still want to yield so that it can be\n              // painted. Conceptually, this is really the same as pinging.\n              // We can use any RetryLane even if it's the one currently rendering\n              // since we're leaving it behind on this node.\n\n              workInProgress.lanes = SomeRetryLane;\n            }\n          } else {\n            cutOffTailIfNeeded(renderState, false);\n          } // Next we're going to render the tail.\n\n        } else {\n          // Append the rendered row to the child list.\n          if (!didSuspendAlready) {\n            var _suspended = findFirstSuspended(renderedTail);\n\n            if (_suspended !== null) {\n              workInProgress.flags |= DidCapture;\n              didSuspendAlready = true; // Ensure we transfer the update queue to the parent so that it doesn't\n              // get lost if this row ends up dropped during a second pass.\n\n              var _newThenables = _suspended.updateQueue;\n\n              if (_newThenables !== null) {\n                workInProgress.updateQueue = _newThenables;\n                workInProgress.flags |= Update;\n              }\n\n              cutOffTailIfNeeded(renderState, true); // This might have been modified.\n\n              if (renderState.tail === null && renderState.tailMode === 'hidden' && !renderedTail.alternate && !getIsHydrating() // We don't cut it if we're hydrating.\n              ) {\n                  // We're done.\n                  bubbleProperties(workInProgress);\n                  return null;\n                }\n            } else if ( // The time it took to render last row is greater than the remaining\n            // time we have to render. So rendering one more row would likely\n            // exceed it.\n            now() * 2 - renderState.renderingStartTime > getRenderTargetTime() && renderLanes !== OffscreenLane) {\n              // We have now passed our CPU deadline and we'll just give up further\n              // attempts to render the main content and only render fallbacks.\n              // The assumption is that this is usually faster.\n              workInProgress.flags |= DidCapture;\n              didSuspendAlready = true;\n              cutOffTailIfNeeded(renderState, false); // Since nothing actually suspended, there will nothing to ping this\n              // to get it started back up to attempt the next item. While in terms\n              // of priority this work has the same priority as this current render,\n              // it's not part of the same transition once the transition has\n              // committed. If it's sync, we still want to yield so that it can be\n              // painted. Conceptually, this is really the same as pinging.\n              // We can use any RetryLane even if it's the one currently rendering\n              // since we're leaving it behind on this node.\n\n              workInProgress.lanes = SomeRetryLane;\n            }\n          }\n\n          if (renderState.isBackwards) {\n            // The effect list of the backwards tail will have been added\n            // to the end. This breaks the guarantee that life-cycles fire in\n            // sibling order but that isn't a strong guarantee promised by React.\n            // Especially since these might also just pop in during future commits.\n            // Append to the beginning of the list.\n            renderedTail.sibling = workInProgress.child;\n            workInProgress.child = renderedTail;\n          } else {\n            var previousSibling = renderState.last;\n\n            if (previousSibling !== null) {\n              previousSibling.sibling = renderedTail;\n            } else {\n              workInProgress.child = renderedTail;\n            }\n\n            renderState.last = renderedTail;\n          }\n        }\n\n        if (renderState.tail !== null) {\n          // We still have tail rows to render.\n          // Pop a row.\n          var next = renderState.tail;\n          renderState.rendering = next;\n          renderState.tail = next.sibling;\n          renderState.renderingStartTime = now();\n          next.sibling = null; // Restore the context.\n          // TODO: We can probably just avoid popping it instead and only\n          // setting it the first time we go from not suspended to suspended.\n\n          var suspenseContext = suspenseStackCursor.current;\n\n          if (didSuspendAlready) {\n            suspenseContext = setShallowSuspenseContext(suspenseContext, ForceSuspenseFallback);\n          } else {\n            suspenseContext = setDefaultShallowSuspenseContext(suspenseContext);\n          }\n\n          pushSuspenseContext(workInProgress, suspenseContext); // Do a pass over the next row.\n          // Don't bubble properties in this case.\n\n          return next;\n        }\n\n        bubbleProperties(workInProgress);\n        return null;\n      }\n\n    case ScopeComponent:\n      {\n\n        break;\n      }\n\n    case OffscreenComponent:\n    case LegacyHiddenComponent:\n      {\n        popRenderLanes(workInProgress);\n        var _nextState = workInProgress.memoizedState;\n        var nextIsHidden = _nextState !== null;\n\n        if (current !== null) {\n          var _prevState = current.memoizedState;\n          var prevIsHidden = _prevState !== null;\n\n          if (prevIsHidden !== nextIsHidden && ( // LegacyHidden doesn't do any hiding — it only pre-renders.\n          !enableLegacyHidden )) {\n            workInProgress.flags |= Visibility;\n          }\n        }\n\n        if (!nextIsHidden || (workInProgress.mode & ConcurrentMode) === NoMode) {\n          bubbleProperties(workInProgress);\n        } else {\n          // Don't bubble properties for hidden children unless we're rendering\n          // at offscreen priority.\n          if (includesSomeLane(subtreeRenderLanes, OffscreenLane)) {\n            bubbleProperties(workInProgress);\n\n            {\n              // Check if there was an insertion or update in the hidden subtree.\n              // If so, we need to hide those nodes in the commit phase, so\n              // schedule a visibility effect.\n              if ( workInProgress.subtreeFlags & (Placement | Update)) {\n                workInProgress.flags |= Visibility;\n              }\n            }\n          }\n        }\n        return null;\n      }\n\n    case CacheComponent:\n      {\n\n        return null;\n      }\n\n    case TracingMarkerComponent:\n      {\n\n        return null;\n      }\n  }\n\n  throw new Error(\"Unknown unit of work tag (\" + workInProgress.tag + \"). This error is likely caused by a bug in \" + 'React. Please file an issue.');\n}\n\nfunction unwindWork(current, workInProgress, renderLanes) {\n  // Note: This intentionally doesn't check if we're hydrating because comparing\n  // to the current tree provider fiber is just as fast and less error-prone.\n  // Ideally we would have a special version of the work loop only\n  // for hydration.\n  popTreeContext(workInProgress);\n\n  switch (workInProgress.tag) {\n    case ClassComponent:\n      {\n        var Component = workInProgress.type;\n\n        if (isContextProvider(Component)) {\n          popContext(workInProgress);\n        }\n\n        var flags = workInProgress.flags;\n\n        if (flags & ShouldCapture) {\n          workInProgress.flags = flags & ~ShouldCapture | DidCapture;\n\n          if ( (workInProgress.mode & ProfileMode) !== NoMode) {\n            transferActualDuration(workInProgress);\n          }\n\n          return workInProgress;\n        }\n\n        return null;\n      }\n\n    case HostRoot:\n      {\n        var root = workInProgress.stateNode;\n        popHostContainer(workInProgress);\n        popTopLevelContextObject(workInProgress);\n        resetWorkInProgressVersions();\n        var _flags = workInProgress.flags;\n\n        if ((_flags & ShouldCapture) !== NoFlags && (_flags & DidCapture) === NoFlags) {\n          // There was an error during render that wasn't captured by a suspense\n          // boundary. Do a second pass on the root to unmount the children.\n          workInProgress.flags = _flags & ~ShouldCapture | DidCapture;\n          return workInProgress;\n        } // We unwound to the root without completing it. Exit.\n\n\n        return null;\n      }\n\n    case HostComponent:\n      {\n        // TODO: popHydrationState\n        popHostContext(workInProgress);\n        return null;\n      }\n\n    case SuspenseComponent:\n      {\n        popSuspenseContext(workInProgress);\n        var suspenseState = workInProgress.memoizedState;\n\n        if (suspenseState !== null && suspenseState.dehydrated !== null) {\n          if (workInProgress.alternate === null) {\n            throw new Error('Threw in newly mounted dehydrated component. This is likely a bug in ' + 'React. Please file an issue.');\n          }\n\n          resetHydrationState();\n        }\n\n        var _flags2 = workInProgress.flags;\n\n        if (_flags2 & ShouldCapture) {\n          workInProgress.flags = _flags2 & ~ShouldCapture | DidCapture; // Captured a suspense effect. Re-render the boundary.\n\n          if ( (workInProgress.mode & ProfileMode) !== NoMode) {\n            transferActualDuration(workInProgress);\n          }\n\n          return workInProgress;\n        }\n\n        return null;\n      }\n\n    case SuspenseListComponent:\n      {\n        popSuspenseContext(workInProgress); // SuspenseList doesn't actually catch anything. It should've been\n        // caught by a nested boundary. If not, it should bubble through.\n\n        return null;\n      }\n\n    case HostPortal:\n      popHostContainer(workInProgress);\n      return null;\n\n    case ContextProvider:\n      var context = workInProgress.type._context;\n      popProvider(context, workInProgress);\n      return null;\n\n    case OffscreenComponent:\n    case LegacyHiddenComponent:\n      popRenderLanes(workInProgress);\n      return null;\n\n    case CacheComponent:\n\n      return null;\n\n    default:\n      return null;\n  }\n}\n\nfunction unwindInterruptedWork(current, interruptedWork, renderLanes) {\n  // Note: This intentionally doesn't check if we're hydrating because comparing\n  // to the current tree provider fiber is just as fast and less error-prone.\n  // Ideally we would have a special version of the work loop only\n  // for hydration.\n  popTreeContext(interruptedWork);\n\n  switch (interruptedWork.tag) {\n    case ClassComponent:\n      {\n        var childContextTypes = interruptedWork.type.childContextTypes;\n\n        if (childContextTypes !== null && childContextTypes !== undefined) {\n          popContext(interruptedWork);\n        }\n\n        break;\n      }\n\n    case HostRoot:\n      {\n        var root = interruptedWork.stateNode;\n        popHostContainer(interruptedWork);\n        popTopLevelContextObject(interruptedWork);\n        resetWorkInProgressVersions();\n        break;\n      }\n\n    case HostComponent:\n      {\n        popHostContext(interruptedWork);\n        break;\n      }\n\n    case HostPortal:\n      popHostContainer(interruptedWork);\n      break;\n\n    case SuspenseComponent:\n      popSuspenseContext(interruptedWork);\n      break;\n\n    case SuspenseListComponent:\n      popSuspenseContext(interruptedWork);\n      break;\n\n    case ContextProvider:\n      var context = interruptedWork.type._context;\n      popProvider(context, interruptedWork);\n      break;\n\n    case OffscreenComponent:\n    case LegacyHiddenComponent:\n      popRenderLanes(interruptedWork);\n      break;\n  }\n}\n\nvar didWarnAboutUndefinedSnapshotBeforeUpdate = null;\n\n{\n  didWarnAboutUndefinedSnapshotBeforeUpdate = new Set();\n} // Used during the commit phase to track the state of the Offscreen component stack.\n// Allows us to avoid traversing the return path to find the nearest Offscreen ancestor.\n// Only used when enableSuspenseLayoutEffectSemantics is enabled.\n\n\nvar offscreenSubtreeIsHidden = false;\nvar offscreenSubtreeWasHidden = false;\nvar PossiblyWeakSet = typeof WeakSet === 'function' ? WeakSet : Set;\nvar nextEffect = null; // Used for Profiling builds to track updaters.\n\nvar inProgressLanes = null;\nvar inProgressRoot = null;\nfunction reportUncaughtErrorInDEV(error) {\n  // Wrapping each small part of the commit phase into a guarded\n  // callback is a bit too slow (https://github.com/facebook/react/pull/21666).\n  // But we rely on it to surface errors to DEV tools like overlays\n  // (https://github.com/facebook/react/issues/21712).\n  // As a compromise, rethrow only caught errors in a guard.\n  {\n    invokeGuardedCallback(null, function () {\n      throw error;\n    });\n    clearCaughtError();\n  }\n}\n\nvar callComponentWillUnmountWithTimer = function (current, instance) {\n  instance.props = current.memoizedProps;\n  instance.state = current.memoizedState;\n\n  if ( current.mode & ProfileMode) {\n    try {\n      startLayoutEffectTimer();\n      instance.componentWillUnmount();\n    } finally {\n      recordLayoutEffectDuration(current);\n    }\n  } else {\n    instance.componentWillUnmount();\n  }\n}; // Capture errors so they don't interrupt mounting.\n\n\nfunction safelyCallCommitHookLayoutEffectListMount(current, nearestMountedAncestor) {\n  try {\n    commitHookEffectListMount(Layout, current);\n  } catch (error) {\n    captureCommitPhaseError(current, nearestMountedAncestor, error);\n  }\n} // Capture errors so they don't interrupt unmounting.\n\n\nfunction safelyCallComponentWillUnmount(current, nearestMountedAncestor, instance) {\n  try {\n    callComponentWillUnmountWithTimer(current, instance);\n  } catch (error) {\n    captureCommitPhaseError(current, nearestMountedAncestor, error);\n  }\n} // Capture errors so they don't interrupt mounting.\n\n\nfunction safelyCallComponentDidMount(current, nearestMountedAncestor, instance) {\n  try {\n    instance.componentDidMount();\n  } catch (error) {\n    captureCommitPhaseError(current, nearestMountedAncestor, error);\n  }\n} // Capture errors so they don't interrupt mounting.\n\n\nfunction safelyAttachRef(current, nearestMountedAncestor) {\n  try {\n    commitAttachRef(current);\n  } catch (error) {\n    captureCommitPhaseError(current, nearestMountedAncestor, error);\n  }\n}\n\nfunction safelyDetachRef(current, nearestMountedAncestor) {\n  var ref = current.ref;\n\n  if (ref !== null) {\n    if (typeof ref === 'function') {\n      var retVal;\n\n      try {\n        if (enableProfilerTimer && enableProfilerCommitHooks && current.mode & ProfileMode) {\n          try {\n            startLayoutEffectTimer();\n            retVal = ref(null);\n          } finally {\n            recordLayoutEffectDuration(current);\n          }\n        } else {\n          retVal = ref(null);\n        }\n      } catch (error) {\n        captureCommitPhaseError(current, nearestMountedAncestor, error);\n      }\n\n      {\n        if (typeof retVal === 'function') {\n          error('Unexpected return value from a callback ref in %s. ' + 'A callback ref should not return a function.', getComponentNameFromFiber(current));\n        }\n      }\n    } else {\n      ref.current = null;\n    }\n  }\n}\n\nfunction safelyCallDestroy(current, nearestMountedAncestor, destroy) {\n  try {\n    destroy();\n  } catch (error) {\n    captureCommitPhaseError(current, nearestMountedAncestor, error);\n  }\n}\n\nvar focusedInstanceHandle = null;\nvar shouldFireAfterActiveInstanceBlur = false;\nfunction commitBeforeMutationEffects(root, firstChild) {\n  focusedInstanceHandle = prepareForCommit(root.containerInfo);\n  nextEffect = firstChild;\n  commitBeforeMutationEffects_begin(); // We no longer need to track the active instance fiber\n\n  var shouldFire = shouldFireAfterActiveInstanceBlur;\n  shouldFireAfterActiveInstanceBlur = false;\n  focusedInstanceHandle = null;\n  return shouldFire;\n}\n\nfunction commitBeforeMutationEffects_begin() {\n  while (nextEffect !== null) {\n    var fiber = nextEffect; // This phase is only used for beforeActiveInstanceBlur.\n\n    var child = fiber.child;\n\n    if ((fiber.subtreeFlags & BeforeMutationMask) !== NoFlags && child !== null) {\n      child.return = fiber;\n      nextEffect = child;\n    } else {\n      commitBeforeMutationEffects_complete();\n    }\n  }\n}\n\nfunction commitBeforeMutationEffects_complete() {\n  while (nextEffect !== null) {\n    var fiber = nextEffect;\n    setCurrentFiber(fiber);\n\n    try {\n      commitBeforeMutationEffectsOnFiber(fiber);\n    } catch (error) {\n      captureCommitPhaseError(fiber, fiber.return, error);\n    }\n\n    resetCurrentFiber();\n    var sibling = fiber.sibling;\n\n    if (sibling !== null) {\n      sibling.return = fiber.return;\n      nextEffect = sibling;\n      return;\n    }\n\n    nextEffect = fiber.return;\n  }\n}\n\nfunction commitBeforeMutationEffectsOnFiber(finishedWork) {\n  var current = finishedWork.alternate;\n  var flags = finishedWork.flags;\n\n  if ((flags & Snapshot) !== NoFlags) {\n    setCurrentFiber(finishedWork);\n\n    switch (finishedWork.tag) {\n      case FunctionComponent:\n      case ForwardRef:\n      case SimpleMemoComponent:\n        {\n          break;\n        }\n\n      case ClassComponent:\n        {\n          if (current !== null) {\n            var prevProps = current.memoizedProps;\n            var prevState = current.memoizedState;\n            var instance = finishedWork.stateNode; // We could update instance props and state here,\n            // but instead we rely on them being set during last render.\n            // TODO: revisit this when we implement resuming.\n\n            {\n              if (finishedWork.type === finishedWork.elementType && !didWarnAboutReassigningProps) {\n                if (instance.props !== finishedWork.memoizedProps) {\n                  error('Expected %s props to match memoized props before ' + 'getSnapshotBeforeUpdate. ' + 'This might either be because of a bug in React, or because ' + 'a component reassigns its own `this.props`. ' + 'Please file an issue.', getComponentNameFromFiber(finishedWork) || 'instance');\n                }\n\n                if (instance.state !== finishedWork.memoizedState) {\n                  error('Expected %s state to match memoized state before ' + 'getSnapshotBeforeUpdate. ' + 'This might either be because of a bug in React, or because ' + 'a component reassigns its own `this.state`. ' + 'Please file an issue.', getComponentNameFromFiber(finishedWork) || 'instance');\n                }\n              }\n            }\n\n            var snapshot = instance.getSnapshotBeforeUpdate(finishedWork.elementType === finishedWork.type ? prevProps : resolveDefaultProps(finishedWork.type, prevProps), prevState);\n\n            {\n              var didWarnSet = didWarnAboutUndefinedSnapshotBeforeUpdate;\n\n              if (snapshot === undefined && !didWarnSet.has(finishedWork.type)) {\n                didWarnSet.add(finishedWork.type);\n\n                error('%s.getSnapshotBeforeUpdate(): A snapshot value (or null) ' + 'must be returned. You have returned undefined.', getComponentNameFromFiber(finishedWork));\n              }\n            }\n\n            instance.__reactInternalSnapshotBeforeUpdate = snapshot;\n          }\n\n          break;\n        }\n\n      case HostRoot:\n        {\n          {\n            var root = finishedWork.stateNode;\n            clearContainer(root.containerInfo);\n          }\n\n          break;\n        }\n\n      case HostComponent:\n      case HostText:\n      case HostPortal:\n      case IncompleteClassComponent:\n        // Nothing to do for these component types\n        break;\n\n      default:\n        {\n          throw new Error('This unit of work tag should not have side-effects. This error is ' + 'likely caused by a bug in React. Please file an issue.');\n        }\n    }\n\n    resetCurrentFiber();\n  }\n}\n\nfunction commitHookEffectListUnmount(flags, finishedWork, nearestMountedAncestor) {\n  var updateQueue = finishedWork.updateQueue;\n  var lastEffect = updateQueue !== null ? updateQueue.lastEffect : null;\n\n  if (lastEffect !== null) {\n    var firstEffect = lastEffect.next;\n    var effect = firstEffect;\n\n    do {\n      if ((effect.tag & flags) === flags) {\n        // Unmount\n        var destroy = effect.destroy;\n        effect.destroy = undefined;\n\n        if (destroy !== undefined) {\n          {\n            if ((flags & Passive$1) !== NoFlags$1) {\n              markComponentPassiveEffectUnmountStarted(finishedWork);\n            } else if ((flags & Layout) !== NoFlags$1) {\n              markComponentLayoutEffectUnmountStarted(finishedWork);\n            }\n          }\n\n          {\n            if ((flags & Insertion) !== NoFlags$1) {\n              setIsRunningInsertionEffect(true);\n            }\n          }\n\n          safelyCallDestroy(finishedWork, nearestMountedAncestor, destroy);\n\n          {\n            if ((flags & Insertion) !== NoFlags$1) {\n              setIsRunningInsertionEffect(false);\n            }\n          }\n\n          {\n            if ((flags & Passive$1) !== NoFlags$1) {\n              markComponentPassiveEffectUnmountStopped();\n            } else if ((flags & Layout) !== NoFlags$1) {\n              markComponentLayoutEffectUnmountStopped();\n            }\n          }\n        }\n      }\n\n      effect = effect.next;\n    } while (effect !== firstEffect);\n  }\n}\n\nfunction commitHookEffectListMount(flags, finishedWork) {\n  var updateQueue = finishedWork.updateQueue;\n  var lastEffect = updateQueue !== null ? updateQueue.lastEffect : null;\n\n  if (lastEffect !== null) {\n    var firstEffect = lastEffect.next;\n    var effect = firstEffect;\n\n    do {\n      if ((effect.tag & flags) === flags) {\n        {\n          if ((flags & Passive$1) !== NoFlags$1) {\n            markComponentPassiveEffectMountStarted(finishedWork);\n          } else if ((flags & Layout) !== NoFlags$1) {\n            markComponentLayoutEffectMountStarted(finishedWork);\n          }\n        } // Mount\n\n\n        var create = effect.create;\n\n        {\n          if ((flags & Insertion) !== NoFlags$1) {\n            setIsRunningInsertionEffect(true);\n          }\n        }\n\n        effect.destroy = create();\n\n        {\n          if ((flags & Insertion) !== NoFlags$1) {\n            setIsRunningInsertionEffect(false);\n          }\n        }\n\n        {\n          if ((flags & Passive$1) !== NoFlags$1) {\n            markComponentPassiveEffectMountStopped();\n          } else if ((flags & Layout) !== NoFlags$1) {\n            markComponentLayoutEffectMountStopped();\n          }\n        }\n\n        {\n          var destroy = effect.destroy;\n\n          if (destroy !== undefined && typeof destroy !== 'function') {\n            var hookName = void 0;\n\n            if ((effect.tag & Layout) !== NoFlags) {\n              hookName = 'useLayoutEffect';\n            } else if ((effect.tag & Insertion) !== NoFlags) {\n              hookName = 'useInsertionEffect';\n            } else {\n              hookName = 'useEffect';\n            }\n\n            var addendum = void 0;\n\n            if (destroy === null) {\n              addendum = ' You returned null. If your effect does not require clean ' + 'up, return undefined (or nothing).';\n            } else if (typeof destroy.then === 'function') {\n              addendum = '\\n\\nIt looks like you wrote ' + hookName + '(async () => ...) or returned a Promise. ' + 'Instead, write the async function inside your effect ' + 'and call it immediately:\\n\\n' + hookName + '(() => {\\n' + '  async function fetchData() {\\n' + '    // You can await here\\n' + '    const response = await MyAPI.getData(someId);\\n' + '    // ...\\n' + '  }\\n' + '  fetchData();\\n' + \"}, [someId]); // Or [] if effect doesn't need props or state\\n\\n\" + 'Learn more about data fetching with Hooks: https://reactjs.org/link/hooks-data-fetching';\n            } else {\n              addendum = ' You returned: ' + destroy;\n            }\n\n            error('%s must not return anything besides a function, ' + 'which is used for clean-up.%s', hookName, addendum);\n          }\n        }\n      }\n\n      effect = effect.next;\n    } while (effect !== firstEffect);\n  }\n}\n\nfunction commitPassiveEffectDurations(finishedRoot, finishedWork) {\n  {\n    // Only Profilers with work in their subtree will have an Update effect scheduled.\n    if ((finishedWork.flags & Update) !== NoFlags) {\n      switch (finishedWork.tag) {\n        case Profiler:\n          {\n            var passiveEffectDuration = finishedWork.stateNode.passiveEffectDuration;\n            var _finishedWork$memoize = finishedWork.memoizedProps,\n                id = _finishedWork$memoize.id,\n                onPostCommit = _finishedWork$memoize.onPostCommit; // This value will still reflect the previous commit phase.\n            // It does not get reset until the start of the next commit phase.\n\n            var commitTime = getCommitTime();\n            var phase = finishedWork.alternate === null ? 'mount' : 'update';\n\n            {\n              if (isCurrentUpdateNested()) {\n                phase = 'nested-update';\n              }\n            }\n\n            if (typeof onPostCommit === 'function') {\n              onPostCommit(id, phase, passiveEffectDuration, commitTime);\n            } // Bubble times to the next nearest ancestor Profiler.\n            // After we process that Profiler, we'll bubble further up.\n\n\n            var parentFiber = finishedWork.return;\n\n            outer: while (parentFiber !== null) {\n              switch (parentFiber.tag) {\n                case HostRoot:\n                  var root = parentFiber.stateNode;\n                  root.passiveEffectDuration += passiveEffectDuration;\n                  break outer;\n\n                case Profiler:\n                  var parentStateNode = parentFiber.stateNode;\n                  parentStateNode.passiveEffectDuration += passiveEffectDuration;\n                  break outer;\n              }\n\n              parentFiber = parentFiber.return;\n            }\n\n            break;\n          }\n      }\n    }\n  }\n}\n\nfunction commitLayoutEffectOnFiber(finishedRoot, current, finishedWork, committedLanes) {\n  if ((finishedWork.flags & LayoutMask) !== NoFlags) {\n    switch (finishedWork.tag) {\n      case FunctionComponent:\n      case ForwardRef:\n      case SimpleMemoComponent:\n        {\n          if ( !offscreenSubtreeWasHidden) {\n            // At this point layout effects have already been destroyed (during mutation phase).\n            // This is done to prevent sibling component effects from interfering with each other,\n            // e.g. a destroy function in one component should never override a ref set\n            // by a create function in another component during the same commit.\n            if ( finishedWork.mode & ProfileMode) {\n              try {\n                startLayoutEffectTimer();\n                commitHookEffectListMount(Layout | HasEffect, finishedWork);\n              } finally {\n                recordLayoutEffectDuration(finishedWork);\n              }\n            } else {\n              commitHookEffectListMount(Layout | HasEffect, finishedWork);\n            }\n          }\n\n          break;\n        }\n\n      case ClassComponent:\n        {\n          var instance = finishedWork.stateNode;\n\n          if (finishedWork.flags & Update) {\n            if (!offscreenSubtreeWasHidden) {\n              if (current === null) {\n                // We could update instance props and state here,\n                // but instead we rely on them being set during last render.\n                // TODO: revisit this when we implement resuming.\n                {\n                  if (finishedWork.type === finishedWork.elementType && !didWarnAboutReassigningProps) {\n                    if (instance.props !== finishedWork.memoizedProps) {\n                      error('Expected %s props to match memoized props before ' + 'componentDidMount. ' + 'This might either be because of a bug in React, or because ' + 'a component reassigns its own `this.props`. ' + 'Please file an issue.', getComponentNameFromFiber(finishedWork) || 'instance');\n                    }\n\n                    if (instance.state !== finishedWork.memoizedState) {\n                      error('Expected %s state to match memoized state before ' + 'componentDidMount. ' + 'This might either be because of a bug in React, or because ' + 'a component reassigns its own `this.state`. ' + 'Please file an issue.', getComponentNameFromFiber(finishedWork) || 'instance');\n                    }\n                  }\n                }\n\n                if ( finishedWork.mode & ProfileMode) {\n                  try {\n                    startLayoutEffectTimer();\n                    instance.componentDidMount();\n                  } finally {\n                    recordLayoutEffectDuration(finishedWork);\n                  }\n                } else {\n                  instance.componentDidMount();\n                }\n              } else {\n                var prevProps = finishedWork.elementType === finishedWork.type ? current.memoizedProps : resolveDefaultProps(finishedWork.type, current.memoizedProps);\n                var prevState = current.memoizedState; // We could update instance props and state here,\n                // but instead we rely on them being set during last render.\n                // TODO: revisit this when we implement resuming.\n\n                {\n                  if (finishedWork.type === finishedWork.elementType && !didWarnAboutReassigningProps) {\n                    if (instance.props !== finishedWork.memoizedProps) {\n                      error('Expected %s props to match memoized props before ' + 'componentDidUpdate. ' + 'This might either be because of a bug in React, or because ' + 'a component reassigns its own `this.props`. ' + 'Please file an issue.', getComponentNameFromFiber(finishedWork) || 'instance');\n                    }\n\n                    if (instance.state !== finishedWork.memoizedState) {\n                      error('Expected %s state to match memoized state before ' + 'componentDidUpdate. ' + 'This might either be because of a bug in React, or because ' + 'a component reassigns its own `this.state`. ' + 'Please file an issue.', getComponentNameFromFiber(finishedWork) || 'instance');\n                    }\n                  }\n                }\n\n                if ( finishedWork.mode & ProfileMode) {\n                  try {\n                    startLayoutEffectTimer();\n                    instance.componentDidUpdate(prevProps, prevState, instance.__reactInternalSnapshotBeforeUpdate);\n                  } finally {\n                    recordLayoutEffectDuration(finishedWork);\n                  }\n                } else {\n                  instance.componentDidUpdate(prevProps, prevState, instance.__reactInternalSnapshotBeforeUpdate);\n                }\n              }\n            }\n          } // TODO: I think this is now always non-null by the time it reaches the\n          // commit phase. Consider removing the type check.\n\n\n          var updateQueue = finishedWork.updateQueue;\n\n          if (updateQueue !== null) {\n            {\n              if (finishedWork.type === finishedWork.elementType && !didWarnAboutReassigningProps) {\n                if (instance.props !== finishedWork.memoizedProps) {\n                  error('Expected %s props to match memoized props before ' + 'processing the update queue. ' + 'This might either be because of a bug in React, or because ' + 'a component reassigns its own `this.props`. ' + 'Please file an issue.', getComponentNameFromFiber(finishedWork) || 'instance');\n                }\n\n                if (instance.state !== finishedWork.memoizedState) {\n                  error('Expected %s state to match memoized state before ' + 'processing the update queue. ' + 'This might either be because of a bug in React, or because ' + 'a component reassigns its own `this.state`. ' + 'Please file an issue.', getComponentNameFromFiber(finishedWork) || 'instance');\n                }\n              }\n            } // We could update instance props and state here,\n            // but instead we rely on them being set during last render.\n            // TODO: revisit this when we implement resuming.\n\n\n            commitUpdateQueue(finishedWork, updateQueue, instance);\n          }\n\n          break;\n        }\n\n      case HostRoot:\n        {\n          // TODO: I think this is now always non-null by the time it reaches the\n          // commit phase. Consider removing the type check.\n          var _updateQueue = finishedWork.updateQueue;\n\n          if (_updateQueue !== null) {\n            var _instance = null;\n\n            if (finishedWork.child !== null) {\n              switch (finishedWork.child.tag) {\n                case HostComponent:\n                  _instance = getPublicInstance(finishedWork.child.stateNode);\n                  break;\n\n                case ClassComponent:\n                  _instance = finishedWork.child.stateNode;\n                  break;\n              }\n            }\n\n            commitUpdateQueue(finishedWork, _updateQueue, _instance);\n          }\n\n          break;\n        }\n\n      case HostComponent:\n        {\n          var _instance2 = finishedWork.stateNode; // Renderers may schedule work to be done after host components are mounted\n          // (eg DOM renderer may schedule auto-focus for inputs and form controls).\n          // These effects should only be committed when components are first mounted,\n          // aka when there is no current/alternate.\n\n          if (current === null && finishedWork.flags & Update) {\n            var type = finishedWork.type;\n            var props = finishedWork.memoizedProps;\n            commitMount(_instance2, type, props);\n          }\n\n          break;\n        }\n\n      case HostText:\n        {\n          // We have no life-cycles associated with text.\n          break;\n        }\n\n      case HostPortal:\n        {\n          // We have no life-cycles associated with portals.\n          break;\n        }\n\n      case Profiler:\n        {\n          {\n            var _finishedWork$memoize2 = finishedWork.memoizedProps,\n                onCommit = _finishedWork$memoize2.onCommit,\n                onRender = _finishedWork$memoize2.onRender;\n            var effectDuration = finishedWork.stateNode.effectDuration;\n            var commitTime = getCommitTime();\n            var phase = current === null ? 'mount' : 'update';\n\n            {\n              if (isCurrentUpdateNested()) {\n                phase = 'nested-update';\n              }\n            }\n\n            if (typeof onRender === 'function') {\n              onRender(finishedWork.memoizedProps.id, phase, finishedWork.actualDuration, finishedWork.treeBaseDuration, finishedWork.actualStartTime, commitTime);\n            }\n\n            {\n              if (typeof onCommit === 'function') {\n                onCommit(finishedWork.memoizedProps.id, phase, effectDuration, commitTime);\n              } // Schedule a passive effect for this Profiler to call onPostCommit hooks.\n              // This effect should be scheduled even if there is no onPostCommit callback for this Profiler,\n              // because the effect is also where times bubble to parent Profilers.\n\n\n              enqueuePendingPassiveProfilerEffect(finishedWork); // Propagate layout effect durations to the next nearest Profiler ancestor.\n              // Do not reset these values until the next render so DevTools has a chance to read them first.\n\n              var parentFiber = finishedWork.return;\n\n              outer: while (parentFiber !== null) {\n                switch (parentFiber.tag) {\n                  case HostRoot:\n                    var root = parentFiber.stateNode;\n                    root.effectDuration += effectDuration;\n                    break outer;\n\n                  case Profiler:\n                    var parentStateNode = parentFiber.stateNode;\n                    parentStateNode.effectDuration += effectDuration;\n                    break outer;\n                }\n\n                parentFiber = parentFiber.return;\n              }\n            }\n          }\n\n          break;\n        }\n\n      case SuspenseComponent:\n        {\n          commitSuspenseHydrationCallbacks(finishedRoot, finishedWork);\n          break;\n        }\n\n      case SuspenseListComponent:\n      case IncompleteClassComponent:\n      case ScopeComponent:\n      case OffscreenComponent:\n      case LegacyHiddenComponent:\n      case TracingMarkerComponent:\n        {\n          break;\n        }\n\n      default:\n        throw new Error('This unit of work tag should not have side-effects. This error is ' + 'likely caused by a bug in React. Please file an issue.');\n    }\n  }\n\n  if ( !offscreenSubtreeWasHidden) {\n    {\n      if (finishedWork.flags & Ref) {\n        commitAttachRef(finishedWork);\n      }\n    }\n  }\n}\n\nfunction reappearLayoutEffectsOnFiber(node) {\n  // Turn on layout effects in a tree that previously disappeared.\n  // TODO (Offscreen) Check: flags & LayoutStatic\n  switch (node.tag) {\n    case FunctionComponent:\n    case ForwardRef:\n    case SimpleMemoComponent:\n      {\n        if ( node.mode & ProfileMode) {\n          try {\n            startLayoutEffectTimer();\n            safelyCallCommitHookLayoutEffectListMount(node, node.return);\n          } finally {\n            recordLayoutEffectDuration(node);\n          }\n        } else {\n          safelyCallCommitHookLayoutEffectListMount(node, node.return);\n        }\n\n        break;\n      }\n\n    case ClassComponent:\n      {\n        var instance = node.stateNode;\n\n        if (typeof instance.componentDidMount === 'function') {\n          safelyCallComponentDidMount(node, node.return, instance);\n        }\n\n        safelyAttachRef(node, node.return);\n        break;\n      }\n\n    case HostComponent:\n      {\n        safelyAttachRef(node, node.return);\n        break;\n      }\n  }\n}\n\nfunction hideOrUnhideAllChildren(finishedWork, isHidden) {\n  // Only hide or unhide the top-most host nodes.\n  var hostSubtreeRoot = null;\n\n  {\n    // We only have the top Fiber that was inserted but we need to recurse down its\n    // children to find all the terminal nodes.\n    var node = finishedWork;\n\n    while (true) {\n      if (node.tag === HostComponent) {\n        if (hostSubtreeRoot === null) {\n          hostSubtreeRoot = node;\n\n          try {\n            var instance = node.stateNode;\n\n            if (isHidden) {\n              hideInstance(instance);\n            } else {\n              unhideInstance(node.stateNode, node.memoizedProps);\n            }\n          } catch (error) {\n            captureCommitPhaseError(finishedWork, finishedWork.return, error);\n          }\n        }\n      } else if (node.tag === HostText) {\n        if (hostSubtreeRoot === null) {\n          try {\n            var _instance3 = node.stateNode;\n\n            if (isHidden) {\n              hideTextInstance(_instance3);\n            } else {\n              unhideTextInstance(_instance3, node.memoizedProps);\n            }\n          } catch (error) {\n            captureCommitPhaseError(finishedWork, finishedWork.return, error);\n          }\n        }\n      } else if ((node.tag === OffscreenComponent || node.tag === LegacyHiddenComponent) && node.memoizedState !== null && node !== finishedWork) ; else if (node.child !== null) {\n        node.child.return = node;\n        node = node.child;\n        continue;\n      }\n\n      if (node === finishedWork) {\n        return;\n      }\n\n      while (node.sibling === null) {\n        if (node.return === null || node.return === finishedWork) {\n          return;\n        }\n\n        if (hostSubtreeRoot === node) {\n          hostSubtreeRoot = null;\n        }\n\n        node = node.return;\n      }\n\n      if (hostSubtreeRoot === node) {\n        hostSubtreeRoot = null;\n      }\n\n      node.sibling.return = node.return;\n      node = node.sibling;\n    }\n  }\n}\n\nfunction commitAttachRef(finishedWork) {\n  var ref = finishedWork.ref;\n\n  if (ref !== null) {\n    var instance = finishedWork.stateNode;\n    var instanceToUse;\n\n    switch (finishedWork.tag) {\n      case HostComponent:\n        instanceToUse = getPublicInstance(instance);\n        break;\n\n      default:\n        instanceToUse = instance;\n    } // Moved outside to ensure DCE works with this flag\n\n    if (typeof ref === 'function') {\n      var retVal;\n\n      if ( finishedWork.mode & ProfileMode) {\n        try {\n          startLayoutEffectTimer();\n          retVal = ref(instanceToUse);\n        } finally {\n          recordLayoutEffectDuration(finishedWork);\n        }\n      } else {\n        retVal = ref(instanceToUse);\n      }\n\n      {\n        if (typeof retVal === 'function') {\n          error('Unexpected return value from a callback ref in %s. ' + 'A callback ref should not return a function.', getComponentNameFromFiber(finishedWork));\n        }\n      }\n    } else {\n      {\n        if (!ref.hasOwnProperty('current')) {\n          error('Unexpected ref object provided for %s. ' + 'Use either a ref-setter function or React.createRef().', getComponentNameFromFiber(finishedWork));\n        }\n      }\n\n      ref.current = instanceToUse;\n    }\n  }\n}\n\nfunction detachFiberMutation(fiber) {\n  // Cut off the return pointer to disconnect it from the tree.\n  // This enables us to detect and warn against state updates on an unmounted component.\n  // It also prevents events from bubbling from within disconnected components.\n  //\n  // Ideally, we should also clear the child pointer of the parent alternate to let this\n  // get GC:ed but we don't know which for sure which parent is the current\n  // one so we'll settle for GC:ing the subtree of this child.\n  // This child itself will be GC:ed when the parent updates the next time.\n  //\n  // Note that we can't clear child or sibling pointers yet.\n  // They're needed for passive effects and for findDOMNode.\n  // We defer those fields, and all other cleanup, to the passive phase (see detachFiberAfterEffects).\n  //\n  // Don't reset the alternate yet, either. We need that so we can detach the\n  // alternate's fields in the passive phase. Clearing the return pointer is\n  // sufficient for findDOMNode semantics.\n  var alternate = fiber.alternate;\n\n  if (alternate !== null) {\n    alternate.return = null;\n  }\n\n  fiber.return = null;\n}\n\nfunction detachFiberAfterEffects(fiber) {\n  var alternate = fiber.alternate;\n\n  if (alternate !== null) {\n    fiber.alternate = null;\n    detachFiberAfterEffects(alternate);\n  } // Note: Defensively using negation instead of < in case\n  // `deletedTreeCleanUpLevel` is undefined.\n\n\n  {\n    // Clear cyclical Fiber fields. This level alone is designed to roughly\n    // approximate the planned Fiber refactor. In that world, `setState` will be\n    // bound to a special \"instance\" object instead of a Fiber. The Instance\n    // object will not have any of these fields. It will only be connected to\n    // the fiber tree via a single link at the root. So if this level alone is\n    // sufficient to fix memory issues, that bodes well for our plans.\n    fiber.child = null;\n    fiber.deletions = null;\n    fiber.sibling = null; // The `stateNode` is cyclical because on host nodes it points to the host\n    // tree, which has its own pointers to children, parents, and siblings.\n    // The other host nodes also point back to fibers, so we should detach that\n    // one, too.\n\n    if (fiber.tag === HostComponent) {\n      var hostInstance = fiber.stateNode;\n\n      if (hostInstance !== null) {\n        detachDeletedInstance(hostInstance);\n      }\n    }\n\n    fiber.stateNode = null; // I'm intentionally not clearing the `return` field in this level. We\n    // already disconnect the `return` pointer at the root of the deleted\n    // subtree (in `detachFiberMutation`). Besides, `return` by itself is not\n    // cyclical — it's only cyclical when combined with `child`, `sibling`, and\n    // `alternate`. But we'll clear it in the next level anyway, just in case.\n\n    {\n      fiber._debugOwner = null;\n    }\n\n    {\n      // Theoretically, nothing in here should be necessary, because we already\n      // disconnected the fiber from the tree. So even if something leaks this\n      // particular fiber, it won't leak anything else\n      //\n      // The purpose of this branch is to be super aggressive so we can measure\n      // if there's any difference in memory impact. If there is, that could\n      // indicate a React leak we don't know about.\n      fiber.return = null;\n      fiber.dependencies = null;\n      fiber.memoizedProps = null;\n      fiber.memoizedState = null;\n      fiber.pendingProps = null;\n      fiber.stateNode = null; // TODO: Move to `commitPassiveUnmountInsideDeletedTreeOnFiber` instead.\n\n      fiber.updateQueue = null;\n    }\n  }\n}\n\nfunction getHostParentFiber(fiber) {\n  var parent = fiber.return;\n\n  while (parent !== null) {\n    if (isHostParent(parent)) {\n      return parent;\n    }\n\n    parent = parent.return;\n  }\n\n  throw new Error('Expected to find a host parent. This error is likely caused by a bug ' + 'in React. Please file an issue.');\n}\n\nfunction isHostParent(fiber) {\n  return fiber.tag === HostComponent || fiber.tag === HostRoot || fiber.tag === HostPortal;\n}\n\nfunction getHostSibling(fiber) {\n  // We're going to search forward into the tree until we find a sibling host\n  // node. Unfortunately, if multiple insertions are done in a row we have to\n  // search past them. This leads to exponential search for the next sibling.\n  // TODO: Find a more efficient way to do this.\n  var node = fiber;\n\n  siblings: while (true) {\n    // If we didn't find anything, let's try the next sibling.\n    while (node.sibling === null) {\n      if (node.return === null || isHostParent(node.return)) {\n        // If we pop out of the root or hit the parent the fiber we are the\n        // last sibling.\n        return null;\n      }\n\n      node = node.return;\n    }\n\n    node.sibling.return = node.return;\n    node = node.sibling;\n\n    while (node.tag !== HostComponent && node.tag !== HostText && node.tag !== DehydratedFragment) {\n      // If it is not host node and, we might have a host node inside it.\n      // Try to search down until we find one.\n      if (node.flags & Placement) {\n        // If we don't have a child, try the siblings instead.\n        continue siblings;\n      } // If we don't have a child, try the siblings instead.\n      // We also skip portals because they are not part of this host tree.\n\n\n      if (node.child === null || node.tag === HostPortal) {\n        continue siblings;\n      } else {\n        node.child.return = node;\n        node = node.child;\n      }\n    } // Check if this host node is stable or about to be placed.\n\n\n    if (!(node.flags & Placement)) {\n      // Found it!\n      return node.stateNode;\n    }\n  }\n}\n\nfunction commitPlacement(finishedWork) {\n\n\n  var parentFiber = getHostParentFiber(finishedWork); // Note: these two variables *must* always be updated together.\n\n  switch (parentFiber.tag) {\n    case HostComponent:\n      {\n        var parent = parentFiber.stateNode;\n\n        if (parentFiber.flags & ContentReset) {\n          // Reset the text content of the parent before doing any insertions\n          resetTextContent(parent); // Clear ContentReset from the effect tag\n\n          parentFiber.flags &= ~ContentReset;\n        }\n\n        var before = getHostSibling(finishedWork); // We only have the top Fiber that was inserted but we need to recurse down its\n        // children to find all the terminal nodes.\n\n        insertOrAppendPlacementNode(finishedWork, before, parent);\n        break;\n      }\n\n    case HostRoot:\n    case HostPortal:\n      {\n        var _parent = parentFiber.stateNode.containerInfo;\n\n        var _before = getHostSibling(finishedWork);\n\n        insertOrAppendPlacementNodeIntoContainer(finishedWork, _before, _parent);\n        break;\n      }\n    // eslint-disable-next-line-no-fallthrough\n\n    default:\n      throw new Error('Invalid host parent fiber. This error is likely caused by a bug ' + 'in React. Please file an issue.');\n  }\n}\n\nfunction insertOrAppendPlacementNodeIntoContainer(node, before, parent) {\n  var tag = node.tag;\n  var isHost = tag === HostComponent || tag === HostText;\n\n  if (isHost) {\n    var stateNode = node.stateNode;\n\n    if (before) {\n      insertInContainerBefore(parent, stateNode, before);\n    } else {\n      appendChildToContainer(parent, stateNode);\n    }\n  } else if (tag === HostPortal) ; else {\n    var child = node.child;\n\n    if (child !== null) {\n      insertOrAppendPlacementNodeIntoContainer(child, before, parent);\n      var sibling = child.sibling;\n\n      while (sibling !== null) {\n        insertOrAppendPlacementNodeIntoContainer(sibling, before, parent);\n        sibling = sibling.sibling;\n      }\n    }\n  }\n}\n\nfunction insertOrAppendPlacementNode(node, before, parent) {\n  var tag = node.tag;\n  var isHost = tag === HostComponent || tag === HostText;\n\n  if (isHost) {\n    var stateNode = node.stateNode;\n\n    if (before) {\n      insertBefore(parent, stateNode, before);\n    } else {\n      appendChild(parent, stateNode);\n    }\n  } else if (tag === HostPortal) ; else {\n    var child = node.child;\n\n    if (child !== null) {\n      insertOrAppendPlacementNode(child, before, parent);\n      var sibling = child.sibling;\n\n      while (sibling !== null) {\n        insertOrAppendPlacementNode(sibling, before, parent);\n        sibling = sibling.sibling;\n      }\n    }\n  }\n} // These are tracked on the stack as we recursively traverse a\n// deleted subtree.\n// TODO: Update these during the whole mutation phase, not just during\n// a deletion.\n\n\nvar hostParent = null;\nvar hostParentIsContainer = false;\n\nfunction commitDeletionEffects(root, returnFiber, deletedFiber) {\n  {\n    // We only have the top Fiber that was deleted but we need to recurse down its\n    // children to find all the terminal nodes.\n    // Recursively delete all host nodes from the parent, detach refs, clean\n    // up mounted layout effects, and call componentWillUnmount.\n    // We only need to remove the topmost host child in each branch. But then we\n    // still need to keep traversing to unmount effects, refs, and cWU. TODO: We\n    // could split this into two separate traversals functions, where the second\n    // one doesn't include any removeChild logic. This is maybe the same\n    // function as \"disappearLayoutEffects\" (or whatever that turns into after\n    // the layout phase is refactored to use recursion).\n    // Before starting, find the nearest host parent on the stack so we know\n    // which instance/container to remove the children from.\n    // TODO: Instead of searching up the fiber return path on every deletion, we\n    // can track the nearest host component on the JS stack as we traverse the\n    // tree during the commit phase. This would make insertions faster, too.\n    var parent = returnFiber;\n\n    findParent: while (parent !== null) {\n      switch (parent.tag) {\n        case HostComponent:\n          {\n            hostParent = parent.stateNode;\n            hostParentIsContainer = false;\n            break findParent;\n          }\n\n        case HostRoot:\n          {\n            hostParent = parent.stateNode.containerInfo;\n            hostParentIsContainer = true;\n            break findParent;\n          }\n\n        case HostPortal:\n          {\n            hostParent = parent.stateNode.containerInfo;\n            hostParentIsContainer = true;\n            break findParent;\n          }\n      }\n\n      parent = parent.return;\n    }\n\n    if (hostParent === null) {\n      throw new Error('Expected to find a host parent. This error is likely caused by ' + 'a bug in React. Please file an issue.');\n    }\n\n    commitDeletionEffectsOnFiber(root, returnFiber, deletedFiber);\n    hostParent = null;\n    hostParentIsContainer = false;\n  }\n\n  detachFiberMutation(deletedFiber);\n}\n\nfunction recursivelyTraverseDeletionEffects(finishedRoot, nearestMountedAncestor, parent) {\n  // TODO: Use a static flag to skip trees that don't have unmount effects\n  var child = parent.child;\n\n  while (child !== null) {\n    commitDeletionEffectsOnFiber(finishedRoot, nearestMountedAncestor, child);\n    child = child.sibling;\n  }\n}\n\nfunction commitDeletionEffectsOnFiber(finishedRoot, nearestMountedAncestor, deletedFiber) {\n  onCommitUnmount(deletedFiber); // The cases in this outer switch modify the stack before they traverse\n  // into their subtree. There are simpler cases in the inner switch\n  // that don't modify the stack.\n\n  switch (deletedFiber.tag) {\n    case HostComponent:\n      {\n        if (!offscreenSubtreeWasHidden) {\n          safelyDetachRef(deletedFiber, nearestMountedAncestor);\n        } // Intentional fallthrough to next branch\n\n      }\n    // eslint-disable-next-line-no-fallthrough\n\n    case HostText:\n      {\n        // We only need to remove the nearest host child. Set the host parent\n        // to `null` on the stack to indicate that nested children don't\n        // need to be removed.\n        {\n          var prevHostParent = hostParent;\n          var prevHostParentIsContainer = hostParentIsContainer;\n          hostParent = null;\n          recursivelyTraverseDeletionEffects(finishedRoot, nearestMountedAncestor, deletedFiber);\n          hostParent = prevHostParent;\n          hostParentIsContainer = prevHostParentIsContainer;\n\n          if (hostParent !== null) {\n            // Now that all the child effects have unmounted, we can remove the\n            // node from the tree.\n            if (hostParentIsContainer) {\n              removeChildFromContainer(hostParent, deletedFiber.stateNode);\n            } else {\n              removeChild(hostParent, deletedFiber.stateNode);\n            }\n          }\n        }\n\n        return;\n      }\n\n    case DehydratedFragment:\n      {\n        // Delete the dehydrated suspense boundary and all of its content.\n\n\n        {\n          if (hostParent !== null) {\n            if (hostParentIsContainer) {\n              clearSuspenseBoundaryFromContainer(hostParent, deletedFiber.stateNode);\n            } else {\n              clearSuspenseBoundary(hostParent, deletedFiber.stateNode);\n            }\n          }\n        }\n\n        return;\n      }\n\n    case HostPortal:\n      {\n        {\n          // When we go into a portal, it becomes the parent to remove from.\n          var _prevHostParent = hostParent;\n          var _prevHostParentIsContainer = hostParentIsContainer;\n          hostParent = deletedFiber.stateNode.containerInfo;\n          hostParentIsContainer = true;\n          recursivelyTraverseDeletionEffects(finishedRoot, nearestMountedAncestor, deletedFiber);\n          hostParent = _prevHostParent;\n          hostParentIsContainer = _prevHostParentIsContainer;\n        }\n\n        return;\n      }\n\n    case FunctionComponent:\n    case ForwardRef:\n    case MemoComponent:\n    case SimpleMemoComponent:\n      {\n        if (!offscreenSubtreeWasHidden) {\n          var updateQueue = deletedFiber.updateQueue;\n\n          if (updateQueue !== null) {\n            var lastEffect = updateQueue.lastEffect;\n\n            if (lastEffect !== null) {\n              var firstEffect = lastEffect.next;\n              var effect = firstEffect;\n\n              do {\n                var _effect = effect,\n                    destroy = _effect.destroy,\n                    tag = _effect.tag;\n\n                if (destroy !== undefined) {\n                  if ((tag & Insertion) !== NoFlags$1) {\n                    safelyCallDestroy(deletedFiber, nearestMountedAncestor, destroy);\n                  } else if ((tag & Layout) !== NoFlags$1) {\n                    {\n                      markComponentLayoutEffectUnmountStarted(deletedFiber);\n                    }\n\n                    if ( deletedFiber.mode & ProfileMode) {\n                      startLayoutEffectTimer();\n                      safelyCallDestroy(deletedFiber, nearestMountedAncestor, destroy);\n                      recordLayoutEffectDuration(deletedFiber);\n                    } else {\n                      safelyCallDestroy(deletedFiber, nearestMountedAncestor, destroy);\n                    }\n\n                    {\n                      markComponentLayoutEffectUnmountStopped();\n                    }\n                  }\n                }\n\n                effect = effect.next;\n              } while (effect !== firstEffect);\n            }\n          }\n        }\n\n        recursivelyTraverseDeletionEffects(finishedRoot, nearestMountedAncestor, deletedFiber);\n        return;\n      }\n\n    case ClassComponent:\n      {\n        if (!offscreenSubtreeWasHidden) {\n          safelyDetachRef(deletedFiber, nearestMountedAncestor);\n          var instance = deletedFiber.stateNode;\n\n          if (typeof instance.componentWillUnmount === 'function') {\n            safelyCallComponentWillUnmount(deletedFiber, nearestMountedAncestor, instance);\n          }\n        }\n\n        recursivelyTraverseDeletionEffects(finishedRoot, nearestMountedAncestor, deletedFiber);\n        return;\n      }\n\n    case ScopeComponent:\n      {\n\n        recursivelyTraverseDeletionEffects(finishedRoot, nearestMountedAncestor, deletedFiber);\n        return;\n      }\n\n    case OffscreenComponent:\n      {\n        if ( // TODO: Remove this dead flag\n         deletedFiber.mode & ConcurrentMode) {\n          // If this offscreen component is hidden, we already unmounted it. Before\n          // deleting the children, track that it's already unmounted so that we\n          // don't attempt to unmount the effects again.\n          // TODO: If the tree is hidden, in most cases we should be able to skip\n          // over the nested children entirely. An exception is we haven't yet found\n          // the topmost host node to delete, which we already track on the stack.\n          // But the other case is portals, which need to be detached no matter how\n          // deeply they are nested. We should use a subtree flag to track whether a\n          // subtree includes a nested portal.\n          var prevOffscreenSubtreeWasHidden = offscreenSubtreeWasHidden;\n          offscreenSubtreeWasHidden = prevOffscreenSubtreeWasHidden || deletedFiber.memoizedState !== null;\n          recursivelyTraverseDeletionEffects(finishedRoot, nearestMountedAncestor, deletedFiber);\n          offscreenSubtreeWasHidden = prevOffscreenSubtreeWasHidden;\n        } else {\n          recursivelyTraverseDeletionEffects(finishedRoot, nearestMountedAncestor, deletedFiber);\n        }\n\n        break;\n      }\n\n    default:\n      {\n        recursivelyTraverseDeletionEffects(finishedRoot, nearestMountedAncestor, deletedFiber);\n        return;\n      }\n  }\n}\n\nfunction commitSuspenseCallback(finishedWork) {\n  // TODO: Move this to passive phase\n  var newState = finishedWork.memoizedState;\n}\n\nfunction commitSuspenseHydrationCallbacks(finishedRoot, finishedWork) {\n\n  var newState = finishedWork.memoizedState;\n\n  if (newState === null) {\n    var current = finishedWork.alternate;\n\n    if (current !== null) {\n      var prevState = current.memoizedState;\n\n      if (prevState !== null) {\n        var suspenseInstance = prevState.dehydrated;\n\n        if (suspenseInstance !== null) {\n          commitHydratedSuspenseInstance(suspenseInstance);\n        }\n      }\n    }\n  }\n}\n\nfunction attachSuspenseRetryListeners(finishedWork) {\n  // If this boundary just timed out, then it will have a set of wakeables.\n  // For each wakeable, attach a listener so that when it resolves, React\n  // attempts to re-render the boundary in the primary (pre-timeout) state.\n  var wakeables = finishedWork.updateQueue;\n\n  if (wakeables !== null) {\n    finishedWork.updateQueue = null;\n    var retryCache = finishedWork.stateNode;\n\n    if (retryCache === null) {\n      retryCache = finishedWork.stateNode = new PossiblyWeakSet();\n    }\n\n    wakeables.forEach(function (wakeable) {\n      // Memoize using the boundary fiber to prevent redundant listeners.\n      var retry = resolveRetryWakeable.bind(null, finishedWork, wakeable);\n\n      if (!retryCache.has(wakeable)) {\n        retryCache.add(wakeable);\n\n        {\n          if (isDevToolsPresent) {\n            if (inProgressLanes !== null && inProgressRoot !== null) {\n              // If we have pending work still, associate the original updaters with it.\n              restorePendingUpdaters(inProgressRoot, inProgressLanes);\n            } else {\n              throw Error('Expected finished root and lanes to be set. This is a bug in React.');\n            }\n          }\n        }\n\n        wakeable.then(retry, retry);\n      }\n    });\n  }\n} // This function detects when a Suspense boundary goes from visible to hidden.\nfunction commitMutationEffects(root, finishedWork, committedLanes) {\n  inProgressLanes = committedLanes;\n  inProgressRoot = root;\n  setCurrentFiber(finishedWork);\n  commitMutationEffectsOnFiber(finishedWork, root);\n  setCurrentFiber(finishedWork);\n  inProgressLanes = null;\n  inProgressRoot = null;\n}\n\nfunction recursivelyTraverseMutationEffects(root, parentFiber, lanes) {\n  // Deletions effects can be scheduled on any fiber type. They need to happen\n  // before the children effects hae fired.\n  var deletions = parentFiber.deletions;\n\n  if (deletions !== null) {\n    for (var i = 0; i < deletions.length; i++) {\n      var childToDelete = deletions[i];\n\n      try {\n        commitDeletionEffects(root, parentFiber, childToDelete);\n      } catch (error) {\n        captureCommitPhaseError(childToDelete, parentFiber, error);\n      }\n    }\n  }\n\n  var prevDebugFiber = getCurrentFiber();\n\n  if (parentFiber.subtreeFlags & MutationMask) {\n    var child = parentFiber.child;\n\n    while (child !== null) {\n      setCurrentFiber(child);\n      commitMutationEffectsOnFiber(child, root);\n      child = child.sibling;\n    }\n  }\n\n  setCurrentFiber(prevDebugFiber);\n}\n\nfunction commitMutationEffectsOnFiber(finishedWork, root, lanes) {\n  var current = finishedWork.alternate;\n  var flags = finishedWork.flags; // The effect flag should be checked *after* we refine the type of fiber,\n  // because the fiber tag is more specific. An exception is any flag related\n  // to reconcilation, because those can be set on all fiber types.\n\n  switch (finishedWork.tag) {\n    case FunctionComponent:\n    case ForwardRef:\n    case MemoComponent:\n    case SimpleMemoComponent:\n      {\n        recursivelyTraverseMutationEffects(root, finishedWork);\n        commitReconciliationEffects(finishedWork);\n\n        if (flags & Update) {\n          try {\n            commitHookEffectListUnmount(Insertion | HasEffect, finishedWork, finishedWork.return);\n            commitHookEffectListMount(Insertion | HasEffect, finishedWork);\n          } catch (error) {\n            captureCommitPhaseError(finishedWork, finishedWork.return, error);\n          } // Layout effects are destroyed during the mutation phase so that all\n          // destroy functions for all fibers are called before any create functions.\n          // This prevents sibling component effects from interfering with each other,\n          // e.g. a destroy function in one component should never override a ref set\n          // by a create function in another component during the same commit.\n\n\n          if ( finishedWork.mode & ProfileMode) {\n            try {\n              startLayoutEffectTimer();\n              commitHookEffectListUnmount(Layout | HasEffect, finishedWork, finishedWork.return);\n            } catch (error) {\n              captureCommitPhaseError(finishedWork, finishedWork.return, error);\n            }\n\n            recordLayoutEffectDuration(finishedWork);\n          } else {\n            try {\n              commitHookEffectListUnmount(Layout | HasEffect, finishedWork, finishedWork.return);\n            } catch (error) {\n              captureCommitPhaseError(finishedWork, finishedWork.return, error);\n            }\n          }\n        }\n\n        return;\n      }\n\n    case ClassComponent:\n      {\n        recursivelyTraverseMutationEffects(root, finishedWork);\n        commitReconciliationEffects(finishedWork);\n\n        if (flags & Ref) {\n          if (current !== null) {\n            safelyDetachRef(current, current.return);\n          }\n        }\n\n        return;\n      }\n\n    case HostComponent:\n      {\n        recursivelyTraverseMutationEffects(root, finishedWork);\n        commitReconciliationEffects(finishedWork);\n\n        if (flags & Ref) {\n          if (current !== null) {\n            safelyDetachRef(current, current.return);\n          }\n        }\n\n        {\n          // TODO: ContentReset gets cleared by the children during the commit\n          // phase. This is a refactor hazard because it means we must read\n          // flags the flags after `commitReconciliationEffects` has already run;\n          // the order matters. We should refactor so that ContentReset does not\n          // rely on mutating the flag during commit. Like by setting a flag\n          // during the render phase instead.\n          if (finishedWork.flags & ContentReset) {\n            var instance = finishedWork.stateNode;\n\n            try {\n              resetTextContent(instance);\n            } catch (error) {\n              captureCommitPhaseError(finishedWork, finishedWork.return, error);\n            }\n          }\n\n          if (flags & Update) {\n            var _instance4 = finishedWork.stateNode;\n\n            if (_instance4 != null) {\n              // Commit the work prepared earlier.\n              var newProps = finishedWork.memoizedProps; // For hydration we reuse the update path but we treat the oldProps\n              // as the newProps. The updatePayload will contain the real change in\n              // this case.\n\n              var oldProps = current !== null ? current.memoizedProps : newProps;\n              var type = finishedWork.type; // TODO: Type the updateQueue to be specific to host components.\n\n              var updatePayload = finishedWork.updateQueue;\n              finishedWork.updateQueue = null;\n\n              if (updatePayload !== null) {\n                try {\n                  commitUpdate(_instance4, updatePayload, type, oldProps, newProps, finishedWork);\n                } catch (error) {\n                  captureCommitPhaseError(finishedWork, finishedWork.return, error);\n                }\n              }\n            }\n          }\n        }\n\n        return;\n      }\n\n    case HostText:\n      {\n        recursivelyTraverseMutationEffects(root, finishedWork);\n        commitReconciliationEffects(finishedWork);\n\n        if (flags & Update) {\n          {\n            if (finishedWork.stateNode === null) {\n              throw new Error('This should have a text node initialized. This error is likely ' + 'caused by a bug in React. Please file an issue.');\n            }\n\n            var textInstance = finishedWork.stateNode;\n            var newText = finishedWork.memoizedProps; // For hydration we reuse the update path but we treat the oldProps\n            // as the newProps. The updatePayload will contain the real change in\n            // this case.\n\n            var oldText = current !== null ? current.memoizedProps : newText;\n\n            try {\n              commitTextUpdate(textInstance, oldText, newText);\n            } catch (error) {\n              captureCommitPhaseError(finishedWork, finishedWork.return, error);\n            }\n          }\n        }\n\n        return;\n      }\n\n    case HostRoot:\n      {\n        recursivelyTraverseMutationEffects(root, finishedWork);\n        commitReconciliationEffects(finishedWork);\n\n        if (flags & Update) {\n          {\n            if (current !== null) {\n              var prevRootState = current.memoizedState;\n\n              if (prevRootState.isDehydrated) {\n                try {\n                  commitHydratedContainer(root.containerInfo);\n                } catch (error) {\n                  captureCommitPhaseError(finishedWork, finishedWork.return, error);\n                }\n              }\n            }\n          }\n        }\n\n        return;\n      }\n\n    case HostPortal:\n      {\n        recursivelyTraverseMutationEffects(root, finishedWork);\n        commitReconciliationEffects(finishedWork);\n\n        return;\n      }\n\n    case SuspenseComponent:\n      {\n        recursivelyTraverseMutationEffects(root, finishedWork);\n        commitReconciliationEffects(finishedWork);\n        var offscreenFiber = finishedWork.child;\n\n        if (offscreenFiber.flags & Visibility) {\n          var offscreenInstance = offscreenFiber.stateNode;\n          var newState = offscreenFiber.memoizedState;\n          var isHidden = newState !== null; // Track the current state on the Offscreen instance so we can\n          // read it during an event\n\n          offscreenInstance.isHidden = isHidden;\n\n          if (isHidden) {\n            var wasHidden = offscreenFiber.alternate !== null && offscreenFiber.alternate.memoizedState !== null;\n\n            if (!wasHidden) {\n              // TODO: Move to passive phase\n              markCommitTimeOfFallback();\n            }\n          }\n        }\n\n        if (flags & Update) {\n          try {\n            commitSuspenseCallback(finishedWork);\n          } catch (error) {\n            captureCommitPhaseError(finishedWork, finishedWork.return, error);\n          }\n\n          attachSuspenseRetryListeners(finishedWork);\n        }\n\n        return;\n      }\n\n    case OffscreenComponent:\n      {\n        var _wasHidden = current !== null && current.memoizedState !== null;\n\n        if ( // TODO: Remove this dead flag\n         finishedWork.mode & ConcurrentMode) {\n          // Before committing the children, track on the stack whether this\n          // offscreen subtree was already hidden, so that we don't unmount the\n          // effects again.\n          var prevOffscreenSubtreeWasHidden = offscreenSubtreeWasHidden;\n          offscreenSubtreeWasHidden = prevOffscreenSubtreeWasHidden || _wasHidden;\n          recursivelyTraverseMutationEffects(root, finishedWork);\n          offscreenSubtreeWasHidden = prevOffscreenSubtreeWasHidden;\n        } else {\n          recursivelyTraverseMutationEffects(root, finishedWork);\n        }\n\n        commitReconciliationEffects(finishedWork);\n\n        if (flags & Visibility) {\n          var _offscreenInstance = finishedWork.stateNode;\n          var _newState = finishedWork.memoizedState;\n\n          var _isHidden = _newState !== null;\n\n          var offscreenBoundary = finishedWork; // Track the current state on the Offscreen instance so we can\n          // read it during an event\n\n          _offscreenInstance.isHidden = _isHidden;\n\n          {\n            if (_isHidden) {\n              if (!_wasHidden) {\n                if ((offscreenBoundary.mode & ConcurrentMode) !== NoMode) {\n                  nextEffect = offscreenBoundary;\n                  var offscreenChild = offscreenBoundary.child;\n\n                  while (offscreenChild !== null) {\n                    nextEffect = offscreenChild;\n                    disappearLayoutEffects_begin(offscreenChild);\n                    offscreenChild = offscreenChild.sibling;\n                  }\n                }\n              }\n            }\n          }\n\n          {\n            // TODO: This needs to run whenever there's an insertion or update\n            // inside a hidden Offscreen tree.\n            hideOrUnhideAllChildren(offscreenBoundary, _isHidden);\n          }\n        }\n\n        return;\n      }\n\n    case SuspenseListComponent:\n      {\n        recursivelyTraverseMutationEffects(root, finishedWork);\n        commitReconciliationEffects(finishedWork);\n\n        if (flags & Update) {\n          attachSuspenseRetryListeners(finishedWork);\n        }\n\n        return;\n      }\n\n    case ScopeComponent:\n      {\n\n        return;\n      }\n\n    default:\n      {\n        recursivelyTraverseMutationEffects(root, finishedWork);\n        commitReconciliationEffects(finishedWork);\n        return;\n      }\n  }\n}\n\nfunction commitReconciliationEffects(finishedWork) {\n  // Placement effects (insertions, reorders) can be scheduled on any fiber\n  // type. They needs to happen after the children effects have fired, but\n  // before the effects on this fiber have fired.\n  var flags = finishedWork.flags;\n\n  if (flags & Placement) {\n    try {\n      commitPlacement(finishedWork);\n    } catch (error) {\n      captureCommitPhaseError(finishedWork, finishedWork.return, error);\n    } // Clear the \"placement\" from effect tag so that we know that this is\n    // inserted, before any life-cycles like componentDidMount gets called.\n    // TODO: findDOMNode doesn't rely on this any more but isMounted does\n    // and isMounted is deprecated anyway so we should be able to kill this.\n\n\n    finishedWork.flags &= ~Placement;\n  }\n\n  if (flags & Hydrating) {\n    finishedWork.flags &= ~Hydrating;\n  }\n}\n\nfunction commitLayoutEffects(finishedWork, root, committedLanes) {\n  inProgressLanes = committedLanes;\n  inProgressRoot = root;\n  nextEffect = finishedWork;\n  commitLayoutEffects_begin(finishedWork, root, committedLanes);\n  inProgressLanes = null;\n  inProgressRoot = null;\n}\n\nfunction commitLayoutEffects_begin(subtreeRoot, root, committedLanes) {\n  // Suspense layout effects semantics don't change for legacy roots.\n  var isModernRoot = (subtreeRoot.mode & ConcurrentMode) !== NoMode;\n\n  while (nextEffect !== null) {\n    var fiber = nextEffect;\n    var firstChild = fiber.child;\n\n    if ( fiber.tag === OffscreenComponent && isModernRoot) {\n      // Keep track of the current Offscreen stack's state.\n      var isHidden = fiber.memoizedState !== null;\n      var newOffscreenSubtreeIsHidden = isHidden || offscreenSubtreeIsHidden;\n\n      if (newOffscreenSubtreeIsHidden) {\n        // The Offscreen tree is hidden. Skip over its layout effects.\n        commitLayoutMountEffects_complete(subtreeRoot, root, committedLanes);\n        continue;\n      } else {\n        // TODO (Offscreen) Also check: subtreeFlags & LayoutMask\n        var current = fiber.alternate;\n        var wasHidden = current !== null && current.memoizedState !== null;\n        var newOffscreenSubtreeWasHidden = wasHidden || offscreenSubtreeWasHidden;\n        var prevOffscreenSubtreeIsHidden = offscreenSubtreeIsHidden;\n        var prevOffscreenSubtreeWasHidden = offscreenSubtreeWasHidden; // Traverse the Offscreen subtree with the current Offscreen as the root.\n\n        offscreenSubtreeIsHidden = newOffscreenSubtreeIsHidden;\n        offscreenSubtreeWasHidden = newOffscreenSubtreeWasHidden;\n\n        if (offscreenSubtreeWasHidden && !prevOffscreenSubtreeWasHidden) {\n          // This is the root of a reappearing boundary. Turn its layout effects\n          // back on.\n          nextEffect = fiber;\n          reappearLayoutEffects_begin(fiber);\n        }\n\n        var child = firstChild;\n\n        while (child !== null) {\n          nextEffect = child;\n          commitLayoutEffects_begin(child, // New root; bubble back up to here and stop.\n          root, committedLanes);\n          child = child.sibling;\n        } // Restore Offscreen state and resume in our-progress traversal.\n\n\n        nextEffect = fiber;\n        offscreenSubtreeIsHidden = prevOffscreenSubtreeIsHidden;\n        offscreenSubtreeWasHidden = prevOffscreenSubtreeWasHidden;\n        commitLayoutMountEffects_complete(subtreeRoot, root, committedLanes);\n        continue;\n      }\n    }\n\n    if ((fiber.subtreeFlags & LayoutMask) !== NoFlags && firstChild !== null) {\n      firstChild.return = fiber;\n      nextEffect = firstChild;\n    } else {\n      commitLayoutMountEffects_complete(subtreeRoot, root, committedLanes);\n    }\n  }\n}\n\nfunction commitLayoutMountEffects_complete(subtreeRoot, root, committedLanes) {\n  while (nextEffect !== null) {\n    var fiber = nextEffect;\n\n    if ((fiber.flags & LayoutMask) !== NoFlags) {\n      var current = fiber.alternate;\n      setCurrentFiber(fiber);\n\n      try {\n        commitLayoutEffectOnFiber(root, current, fiber, committedLanes);\n      } catch (error) {\n        captureCommitPhaseError(fiber, fiber.return, error);\n      }\n\n      resetCurrentFiber();\n    }\n\n    if (fiber === subtreeRoot) {\n      nextEffect = null;\n      return;\n    }\n\n    var sibling = fiber.sibling;\n\n    if (sibling !== null) {\n      sibling.return = fiber.return;\n      nextEffect = sibling;\n      return;\n    }\n\n    nextEffect = fiber.return;\n  }\n}\n\nfunction disappearLayoutEffects_begin(subtreeRoot) {\n  while (nextEffect !== null) {\n    var fiber = nextEffect;\n    var firstChild = fiber.child; // TODO (Offscreen) Check: flags & (RefStatic | LayoutStatic)\n\n    switch (fiber.tag) {\n      case FunctionComponent:\n      case ForwardRef:\n      case MemoComponent:\n      case SimpleMemoComponent:\n        {\n          if ( fiber.mode & ProfileMode) {\n            try {\n              startLayoutEffectTimer();\n              commitHookEffectListUnmount(Layout, fiber, fiber.return);\n            } finally {\n              recordLayoutEffectDuration(fiber);\n            }\n          } else {\n            commitHookEffectListUnmount(Layout, fiber, fiber.return);\n          }\n\n          break;\n        }\n\n      case ClassComponent:\n        {\n          // TODO (Offscreen) Check: flags & RefStatic\n          safelyDetachRef(fiber, fiber.return);\n          var instance = fiber.stateNode;\n\n          if (typeof instance.componentWillUnmount === 'function') {\n            safelyCallComponentWillUnmount(fiber, fiber.return, instance);\n          }\n\n          break;\n        }\n\n      case HostComponent:\n        {\n          safelyDetachRef(fiber, fiber.return);\n          break;\n        }\n\n      case OffscreenComponent:\n        {\n          // Check if this is a\n          var isHidden = fiber.memoizedState !== null;\n\n          if (isHidden) {\n            // Nested Offscreen tree is already hidden. Don't disappear\n            // its effects.\n            disappearLayoutEffects_complete(subtreeRoot);\n            continue;\n          }\n\n          break;\n        }\n    } // TODO (Offscreen) Check: subtreeFlags & LayoutStatic\n\n\n    if (firstChild !== null) {\n      firstChild.return = fiber;\n      nextEffect = firstChild;\n    } else {\n      disappearLayoutEffects_complete(subtreeRoot);\n    }\n  }\n}\n\nfunction disappearLayoutEffects_complete(subtreeRoot) {\n  while (nextEffect !== null) {\n    var fiber = nextEffect;\n\n    if (fiber === subtreeRoot) {\n      nextEffect = null;\n      return;\n    }\n\n    var sibling = fiber.sibling;\n\n    if (sibling !== null) {\n      sibling.return = fiber.return;\n      nextEffect = sibling;\n      return;\n    }\n\n    nextEffect = fiber.return;\n  }\n}\n\nfunction reappearLayoutEffects_begin(subtreeRoot) {\n  while (nextEffect !== null) {\n    var fiber = nextEffect;\n    var firstChild = fiber.child;\n\n    if (fiber.tag === OffscreenComponent) {\n      var isHidden = fiber.memoizedState !== null;\n\n      if (isHidden) {\n        // Nested Offscreen tree is still hidden. Don't re-appear its effects.\n        reappearLayoutEffects_complete(subtreeRoot);\n        continue;\n      }\n    } // TODO (Offscreen) Check: subtreeFlags & LayoutStatic\n\n\n    if (firstChild !== null) {\n      // This node may have been reused from a previous render, so we can't\n      // assume its return pointer is correct.\n      firstChild.return = fiber;\n      nextEffect = firstChild;\n    } else {\n      reappearLayoutEffects_complete(subtreeRoot);\n    }\n  }\n}\n\nfunction reappearLayoutEffects_complete(subtreeRoot) {\n  while (nextEffect !== null) {\n    var fiber = nextEffect; // TODO (Offscreen) Check: flags & LayoutStatic\n\n    setCurrentFiber(fiber);\n\n    try {\n      reappearLayoutEffectsOnFiber(fiber);\n    } catch (error) {\n      captureCommitPhaseError(fiber, fiber.return, error);\n    }\n\n    resetCurrentFiber();\n\n    if (fiber === subtreeRoot) {\n      nextEffect = null;\n      return;\n    }\n\n    var sibling = fiber.sibling;\n\n    if (sibling !== null) {\n      // This node may have been reused from a previous render, so we can't\n      // assume its return pointer is correct.\n      sibling.return = fiber.return;\n      nextEffect = sibling;\n      return;\n    }\n\n    nextEffect = fiber.return;\n  }\n}\n\nfunction commitPassiveMountEffects(root, finishedWork, committedLanes, committedTransitions) {\n  nextEffect = finishedWork;\n  commitPassiveMountEffects_begin(finishedWork, root, committedLanes, committedTransitions);\n}\n\nfunction commitPassiveMountEffects_begin(subtreeRoot, root, committedLanes, committedTransitions) {\n  while (nextEffect !== null) {\n    var fiber = nextEffect;\n    var firstChild = fiber.child;\n\n    if ((fiber.subtreeFlags & PassiveMask) !== NoFlags && firstChild !== null) {\n      firstChild.return = fiber;\n      nextEffect = firstChild;\n    } else {\n      commitPassiveMountEffects_complete(subtreeRoot, root, committedLanes, committedTransitions);\n    }\n  }\n}\n\nfunction commitPassiveMountEffects_complete(subtreeRoot, root, committedLanes, committedTransitions) {\n  while (nextEffect !== null) {\n    var fiber = nextEffect;\n\n    if ((fiber.flags & Passive) !== NoFlags) {\n      setCurrentFiber(fiber);\n\n      try {\n        commitPassiveMountOnFiber(root, fiber, committedLanes, committedTransitions);\n      } catch (error) {\n        captureCommitPhaseError(fiber, fiber.return, error);\n      }\n\n      resetCurrentFiber();\n    }\n\n    if (fiber === subtreeRoot) {\n      nextEffect = null;\n      return;\n    }\n\n    var sibling = fiber.sibling;\n\n    if (sibling !== null) {\n      sibling.return = fiber.return;\n      nextEffect = sibling;\n      return;\n    }\n\n    nextEffect = fiber.return;\n  }\n}\n\nfunction commitPassiveMountOnFiber(finishedRoot, finishedWork, committedLanes, committedTransitions) {\n  switch (finishedWork.tag) {\n    case FunctionComponent:\n    case ForwardRef:\n    case SimpleMemoComponent:\n      {\n        if ( finishedWork.mode & ProfileMode) {\n          startPassiveEffectTimer();\n\n          try {\n            commitHookEffectListMount(Passive$1 | HasEffect, finishedWork);\n          } finally {\n            recordPassiveEffectDuration(finishedWork);\n          }\n        } else {\n          commitHookEffectListMount(Passive$1 | HasEffect, finishedWork);\n        }\n\n        break;\n      }\n  }\n}\n\nfunction commitPassiveUnmountEffects(firstChild) {\n  nextEffect = firstChild;\n  commitPassiveUnmountEffects_begin();\n}\n\nfunction commitPassiveUnmountEffects_begin() {\n  while (nextEffect !== null) {\n    var fiber = nextEffect;\n    var child = fiber.child;\n\n    if ((nextEffect.flags & ChildDeletion) !== NoFlags) {\n      var deletions = fiber.deletions;\n\n      if (deletions !== null) {\n        for (var i = 0; i < deletions.length; i++) {\n          var fiberToDelete = deletions[i];\n          nextEffect = fiberToDelete;\n          commitPassiveUnmountEffectsInsideOfDeletedTree_begin(fiberToDelete, fiber);\n        }\n\n        {\n          // A fiber was deleted from this parent fiber, but it's still part of\n          // the previous (alternate) parent fiber's list of children. Because\n          // children are a linked list, an earlier sibling that's still alive\n          // will be connected to the deleted fiber via its `alternate`:\n          //\n          //   live fiber\n          //   --alternate--> previous live fiber\n          //   --sibling--> deleted fiber\n          //\n          // We can't disconnect `alternate` on nodes that haven't been deleted\n          // yet, but we can disconnect the `sibling` and `child` pointers.\n          var previousFiber = fiber.alternate;\n\n          if (previousFiber !== null) {\n            var detachedChild = previousFiber.child;\n\n            if (detachedChild !== null) {\n              previousFiber.child = null;\n\n              do {\n                var detachedSibling = detachedChild.sibling;\n                detachedChild.sibling = null;\n                detachedChild = detachedSibling;\n              } while (detachedChild !== null);\n            }\n          }\n        }\n\n        nextEffect = fiber;\n      }\n    }\n\n    if ((fiber.subtreeFlags & PassiveMask) !== NoFlags && child !== null) {\n      child.return = fiber;\n      nextEffect = child;\n    } else {\n      commitPassiveUnmountEffects_complete();\n    }\n  }\n}\n\nfunction commitPassiveUnmountEffects_complete() {\n  while (nextEffect !== null) {\n    var fiber = nextEffect;\n\n    if ((fiber.flags & Passive) !== NoFlags) {\n      setCurrentFiber(fiber);\n      commitPassiveUnmountOnFiber(fiber);\n      resetCurrentFiber();\n    }\n\n    var sibling = fiber.sibling;\n\n    if (sibling !== null) {\n      sibling.return = fiber.return;\n      nextEffect = sibling;\n      return;\n    }\n\n    nextEffect = fiber.return;\n  }\n}\n\nfunction commitPassiveUnmountOnFiber(finishedWork) {\n  switch (finishedWork.tag) {\n    case FunctionComponent:\n    case ForwardRef:\n    case SimpleMemoComponent:\n      {\n        if ( finishedWork.mode & ProfileMode) {\n          startPassiveEffectTimer();\n          commitHookEffectListUnmount(Passive$1 | HasEffect, finishedWork, finishedWork.return);\n          recordPassiveEffectDuration(finishedWork);\n        } else {\n          commitHookEffectListUnmount(Passive$1 | HasEffect, finishedWork, finishedWork.return);\n        }\n\n        break;\n      }\n  }\n}\n\nfunction commitPassiveUnmountEffectsInsideOfDeletedTree_begin(deletedSubtreeRoot, nearestMountedAncestor) {\n  while (nextEffect !== null) {\n    var fiber = nextEffect; // Deletion effects fire in parent -> child order\n    // TODO: Check if fiber has a PassiveStatic flag\n\n    setCurrentFiber(fiber);\n    commitPassiveUnmountInsideDeletedTreeOnFiber(fiber, nearestMountedAncestor);\n    resetCurrentFiber();\n    var child = fiber.child; // TODO: Only traverse subtree if it has a PassiveStatic flag. (But, if we\n    // do this, still need to handle `deletedTreeCleanUpLevel` correctly.)\n\n    if (child !== null) {\n      child.return = fiber;\n      nextEffect = child;\n    } else {\n      commitPassiveUnmountEffectsInsideOfDeletedTree_complete(deletedSubtreeRoot);\n    }\n  }\n}\n\nfunction commitPassiveUnmountEffectsInsideOfDeletedTree_complete(deletedSubtreeRoot) {\n  while (nextEffect !== null) {\n    var fiber = nextEffect;\n    var sibling = fiber.sibling;\n    var returnFiber = fiber.return;\n\n    {\n      // Recursively traverse the entire deleted tree and clean up fiber fields.\n      // This is more aggressive than ideal, and the long term goal is to only\n      // have to detach the deleted tree at the root.\n      detachFiberAfterEffects(fiber);\n\n      if (fiber === deletedSubtreeRoot) {\n        nextEffect = null;\n        return;\n      }\n    }\n\n    if (sibling !== null) {\n      sibling.return = returnFiber;\n      nextEffect = sibling;\n      return;\n    }\n\n    nextEffect = returnFiber;\n  }\n}\n\nfunction commitPassiveUnmountInsideDeletedTreeOnFiber(current, nearestMountedAncestor) {\n  switch (current.tag) {\n    case FunctionComponent:\n    case ForwardRef:\n    case SimpleMemoComponent:\n      {\n        if ( current.mode & ProfileMode) {\n          startPassiveEffectTimer();\n          commitHookEffectListUnmount(Passive$1, current, nearestMountedAncestor);\n          recordPassiveEffectDuration(current);\n        } else {\n          commitHookEffectListUnmount(Passive$1, current, nearestMountedAncestor);\n        }\n\n        break;\n      }\n  }\n} // TODO: Reuse reappearLayoutEffects traversal here?\n\n\nfunction invokeLayoutEffectMountInDEV(fiber) {\n  {\n    // We don't need to re-check StrictEffectsMode here.\n    // This function is only called if that check has already passed.\n    switch (fiber.tag) {\n      case FunctionComponent:\n      case ForwardRef:\n      case SimpleMemoComponent:\n        {\n          try {\n            commitHookEffectListMount(Layout | HasEffect, fiber);\n          } catch (error) {\n            captureCommitPhaseError(fiber, fiber.return, error);\n          }\n\n          break;\n        }\n\n      case ClassComponent:\n        {\n          var instance = fiber.stateNode;\n\n          try {\n            instance.componentDidMount();\n          } catch (error) {\n            captureCommitPhaseError(fiber, fiber.return, error);\n          }\n\n          break;\n        }\n    }\n  }\n}\n\nfunction invokePassiveEffectMountInDEV(fiber) {\n  {\n    // We don't need to re-check StrictEffectsMode here.\n    // This function is only called if that check has already passed.\n    switch (fiber.tag) {\n      case FunctionComponent:\n      case ForwardRef:\n      case SimpleMemoComponent:\n        {\n          try {\n            commitHookEffectListMount(Passive$1 | HasEffect, fiber);\n          } catch (error) {\n            captureCommitPhaseError(fiber, fiber.return, error);\n          }\n\n          break;\n        }\n    }\n  }\n}\n\nfunction invokeLayoutEffectUnmountInDEV(fiber) {\n  {\n    // We don't need to re-check StrictEffectsMode here.\n    // This function is only called if that check has already passed.\n    switch (fiber.tag) {\n      case FunctionComponent:\n      case ForwardRef:\n      case SimpleMemoComponent:\n        {\n          try {\n            commitHookEffectListUnmount(Layout | HasEffect, fiber, fiber.return);\n          } catch (error) {\n            captureCommitPhaseError(fiber, fiber.return, error);\n          }\n\n          break;\n        }\n\n      case ClassComponent:\n        {\n          var instance = fiber.stateNode;\n\n          if (typeof instance.componentWillUnmount === 'function') {\n            safelyCallComponentWillUnmount(fiber, fiber.return, instance);\n          }\n\n          break;\n        }\n    }\n  }\n}\n\nfunction invokePassiveEffectUnmountInDEV(fiber) {\n  {\n    // We don't need to re-check StrictEffectsMode here.\n    // This function is only called if that check has already passed.\n    switch (fiber.tag) {\n      case FunctionComponent:\n      case ForwardRef:\n      case SimpleMemoComponent:\n        {\n          try {\n            commitHookEffectListUnmount(Passive$1 | HasEffect, fiber, fiber.return);\n          } catch (error) {\n            captureCommitPhaseError(fiber, fiber.return, error);\n          }\n        }\n    }\n  }\n}\n\nvar COMPONENT_TYPE = 0;\nvar HAS_PSEUDO_CLASS_TYPE = 1;\nvar ROLE_TYPE = 2;\nvar TEST_NAME_TYPE = 3;\nvar TEXT_TYPE = 4;\n\nif (typeof Symbol === 'function' && Symbol.for) {\n  var symbolFor = Symbol.for;\n  COMPONENT_TYPE = symbolFor('selector.component');\n  HAS_PSEUDO_CLASS_TYPE = symbolFor('selector.has_pseudo_class');\n  ROLE_TYPE = symbolFor('selector.role');\n  TEST_NAME_TYPE = symbolFor('selector.test_id');\n  TEXT_TYPE = symbolFor('selector.text');\n}\nvar commitHooks = [];\nfunction onCommitRoot$1() {\n  {\n    commitHooks.forEach(function (commitHook) {\n      return commitHook();\n    });\n  }\n}\n\nvar ReactCurrentActQueue = ReactSharedInternals.ReactCurrentActQueue;\nfunction isLegacyActEnvironment(fiber) {\n  {\n    // Legacy mode. We preserve the behavior of React 17's act. It assumes an\n    // act environment whenever `jest` is defined, but you can still turn off\n    // spurious warnings by setting IS_REACT_ACT_ENVIRONMENT explicitly\n    // to false.\n    var isReactActEnvironmentGlobal = // $FlowExpectedError – Flow doesn't know about IS_REACT_ACT_ENVIRONMENT global\n    typeof IS_REACT_ACT_ENVIRONMENT !== 'undefined' ? IS_REACT_ACT_ENVIRONMENT : undefined; // $FlowExpectedError - Flow doesn't know about jest\n\n    var jestIsDefined = typeof jest !== 'undefined';\n    return  jestIsDefined && isReactActEnvironmentGlobal !== false;\n  }\n}\nfunction isConcurrentActEnvironment() {\n  {\n    var isReactActEnvironmentGlobal = // $FlowExpectedError – Flow doesn't know about IS_REACT_ACT_ENVIRONMENT global\n    typeof IS_REACT_ACT_ENVIRONMENT !== 'undefined' ? IS_REACT_ACT_ENVIRONMENT : undefined;\n\n    if (!isReactActEnvironmentGlobal && ReactCurrentActQueue.current !== null) {\n      // TODO: Include link to relevant documentation page.\n      error('The current testing environment is not configured to support ' + 'act(...)');\n    }\n\n    return isReactActEnvironmentGlobal;\n  }\n}\n\nvar ceil = Math.ceil;\nvar ReactCurrentDispatcher$2 = ReactSharedInternals.ReactCurrentDispatcher,\n    ReactCurrentOwner$2 = ReactSharedInternals.ReactCurrentOwner,\n    ReactCurrentBatchConfig$3 = ReactSharedInternals.ReactCurrentBatchConfig,\n    ReactCurrentActQueue$1 = ReactSharedInternals.ReactCurrentActQueue;\nvar NoContext =\n/*             */\n0;\nvar BatchedContext =\n/*               */\n1;\nvar RenderContext =\n/*                */\n2;\nvar CommitContext =\n/*                */\n4;\nvar RootInProgress = 0;\nvar RootFatalErrored = 1;\nvar RootErrored = 2;\nvar RootSuspended = 3;\nvar RootSuspendedWithDelay = 4;\nvar RootCompleted = 5;\nvar RootDidNotComplete = 6; // Describes where we are in the React execution stack\n\nvar executionContext = NoContext; // The root we're working on\n\nvar workInProgressRoot = null; // The fiber we're working on\n\nvar workInProgress = null; // The lanes we're rendering\n\nvar workInProgressRootRenderLanes = NoLanes; // Stack that allows components to change the render lanes for its subtree\n// This is a superset of the lanes we started working on at the root. The only\n// case where it's different from `workInProgressRootRenderLanes` is when we\n// enter a subtree that is hidden and needs to be unhidden: Suspense and\n// Offscreen component.\n//\n// Most things in the work loop should deal with workInProgressRootRenderLanes.\n// Most things in begin/complete phases should deal with subtreeRenderLanes.\n\nvar subtreeRenderLanes = NoLanes;\nvar subtreeRenderLanesCursor = createCursor(NoLanes); // Whether to root completed, errored, suspended, etc.\n\nvar workInProgressRootExitStatus = RootInProgress; // A fatal error, if one is thrown\n\nvar workInProgressRootFatalError = null; // \"Included\" lanes refer to lanes that were worked on during this render. It's\n// slightly different than `renderLanes` because `renderLanes` can change as you\n// enter and exit an Offscreen tree. This value is the combination of all render\n// lanes for the entire render phase.\n\nvar workInProgressRootIncludedLanes = NoLanes; // The work left over by components that were visited during this render. Only\n// includes unprocessed updates, not work in bailed out children.\n\nvar workInProgressRootSkippedLanes = NoLanes; // Lanes that were updated (in an interleaved event) during this render.\n\nvar workInProgressRootInterleavedUpdatedLanes = NoLanes; // Lanes that were updated during the render phase (*not* an interleaved event).\n\nvar workInProgressRootPingedLanes = NoLanes; // Errors that are thrown during the render phase.\n\nvar workInProgressRootConcurrentErrors = null; // These are errors that we recovered from without surfacing them to the UI.\n// We will log them once the tree commits.\n\nvar workInProgressRootRecoverableErrors = null; // The most recent time we committed a fallback. This lets us ensure a train\n// model where we don't commit new loading states in too quick succession.\n\nvar globalMostRecentFallbackTime = 0;\nvar FALLBACK_THROTTLE_MS = 500; // The absolute time for when we should start giving up on rendering\n// more and prefer CPU suspense heuristics instead.\n\nvar workInProgressRootRenderTargetTime = Infinity; // How long a render is supposed to take before we start following CPU\n// suspense heuristics and opt out of rendering more content.\n\nvar RENDER_TIMEOUT_MS = 500;\nvar workInProgressTransitions = null;\n\nfunction resetRenderTimer() {\n  workInProgressRootRenderTargetTime = now() + RENDER_TIMEOUT_MS;\n}\n\nfunction getRenderTargetTime() {\n  return workInProgressRootRenderTargetTime;\n}\nvar hasUncaughtError = false;\nvar firstUncaughtError = null;\nvar legacyErrorBoundariesThatAlreadyFailed = null; // Only used when enableProfilerNestedUpdateScheduledHook is true;\nvar rootDoesHavePassiveEffects = false;\nvar rootWithPendingPassiveEffects = null;\nvar pendingPassiveEffectsLanes = NoLanes;\nvar pendingPassiveProfilerEffects = [];\nvar pendingPassiveTransitions = null; // Use these to prevent an infinite loop of nested updates\n\nvar NESTED_UPDATE_LIMIT = 50;\nvar nestedUpdateCount = 0;\nvar rootWithNestedUpdates = null;\nvar isFlushingPassiveEffects = false;\nvar didScheduleUpdateDuringPassiveEffects = false;\nvar NESTED_PASSIVE_UPDATE_LIMIT = 50;\nvar nestedPassiveUpdateCount = 0;\nvar rootWithPassiveNestedUpdates = null; // If two updates are scheduled within the same event, we should treat their\n// event times as simultaneous, even if the actual clock time has advanced\n// between the first and second call.\n\nvar currentEventTime = NoTimestamp;\nvar currentEventTransitionLane = NoLanes;\nvar isRunningInsertionEffect = false;\nfunction getWorkInProgressRoot() {\n  return workInProgressRoot;\n}\nfunction requestEventTime() {\n  if ((executionContext & (RenderContext | CommitContext)) !== NoContext) {\n    // We're inside React, so it's fine to read the actual time.\n    return now();\n  } // We're not inside React, so we may be in the middle of a browser event.\n\n\n  if (currentEventTime !== NoTimestamp) {\n    // Use the same start time for all updates until we enter React again.\n    return currentEventTime;\n  } // This is the first update since React yielded. Compute a new start time.\n\n\n  currentEventTime = now();\n  return currentEventTime;\n}\nfunction requestUpdateLane(fiber) {\n  // Special cases\n  var mode = fiber.mode;\n\n  if ((mode & ConcurrentMode) === NoMode) {\n    return SyncLane;\n  } else if ( (executionContext & RenderContext) !== NoContext && workInProgressRootRenderLanes !== NoLanes) {\n    // This is a render phase update. These are not officially supported. The\n    // old behavior is to give this the same \"thread\" (lanes) as\n    // whatever is currently rendering. So if you call `setState` on a component\n    // that happens later in the same render, it will flush. Ideally, we want to\n    // remove the special case and treat them as if they came from an\n    // interleaved event. Regardless, this pattern is not officially supported.\n    // This behavior is only a fallback. The flag only exists until we can roll\n    // out the setState warning, since existing code might accidentally rely on\n    // the current behavior.\n    return pickArbitraryLane(workInProgressRootRenderLanes);\n  }\n\n  var isTransition = requestCurrentTransition() !== NoTransition;\n\n  if (isTransition) {\n    if ( ReactCurrentBatchConfig$3.transition !== null) {\n      var transition = ReactCurrentBatchConfig$3.transition;\n\n      if (!transition._updatedFibers) {\n        transition._updatedFibers = new Set();\n      }\n\n      transition._updatedFibers.add(fiber);\n    } // The algorithm for assigning an update to a lane should be stable for all\n    // updates at the same priority within the same event. To do this, the\n    // inputs to the algorithm must be the same.\n    //\n    // The trick we use is to cache the first of each of these inputs within an\n    // event. Then reset the cached values once we can be sure the event is\n    // over. Our heuristic for that is whenever we enter a concurrent work loop.\n\n\n    if (currentEventTransitionLane === NoLane) {\n      // All transitions within the same event are assigned the same lane.\n      currentEventTransitionLane = claimNextTransitionLane();\n    }\n\n    return currentEventTransitionLane;\n  } // Updates originating inside certain React methods, like flushSync, have\n  // their priority set by tracking it with a context variable.\n  //\n  // The opaque type returned by the host config is internally a lane, so we can\n  // use that directly.\n  // TODO: Move this type conversion to the event priority module.\n\n\n  var updateLane = getCurrentUpdatePriority();\n\n  if (updateLane !== NoLane) {\n    return updateLane;\n  } // This update originated outside React. Ask the host environment for an\n  // appropriate priority, based on the type of event.\n  //\n  // The opaque type returned by the host config is internally a lane, so we can\n  // use that directly.\n  // TODO: Move this type conversion to the event priority module.\n\n\n  var eventLane = getCurrentEventPriority();\n  return eventLane;\n}\n\nfunction requestRetryLane(fiber) {\n  // This is a fork of `requestUpdateLane` designed specifically for Suspense\n  // \"retries\" — a special update that attempts to flip a Suspense boundary\n  // from its placeholder state to its primary/resolved state.\n  // Special cases\n  var mode = fiber.mode;\n\n  if ((mode & ConcurrentMode) === NoMode) {\n    return SyncLane;\n  }\n\n  return claimNextRetryLane();\n}\n\nfunction scheduleUpdateOnFiber(root, fiber, lane, eventTime) {\n  checkForNestedUpdates();\n\n  {\n    if (isRunningInsertionEffect) {\n      error('useInsertionEffect must not schedule updates.');\n    }\n  }\n\n  {\n    if (isFlushingPassiveEffects) {\n      didScheduleUpdateDuringPassiveEffects = true;\n    }\n  } // Mark that the root has a pending update.\n\n\n  markRootUpdated(root, lane, eventTime);\n\n  if ((executionContext & RenderContext) !== NoLanes && root === workInProgressRoot) {\n    // This update was dispatched during the render phase. This is a mistake\n    // if the update originates from user space (with the exception of local\n    // hook updates, which are handled differently and don't reach this\n    // function), but there are some internal React features that use this as\n    // an implementation detail, like selective hydration.\n    warnAboutRenderPhaseUpdatesInDEV(fiber); // Track lanes that were updated during the render phase\n  } else {\n    // This is a normal update, scheduled from outside the render phase. For\n    // example, during an input event.\n    {\n      if (isDevToolsPresent) {\n        addFiberToLanesMap(root, fiber, lane);\n      }\n    }\n\n    warnIfUpdatesNotWrappedWithActDEV(fiber);\n\n    if (root === workInProgressRoot) {\n      // Received an update to a tree that's in the middle of rendering. Mark\n      // that there was an interleaved update work on this root. Unless the\n      // `deferRenderPhaseUpdateToNextBatch` flag is off and this is a render\n      // phase update. In that case, we don't treat render phase updates as if\n      // they were interleaved, for backwards compat reasons.\n      if ( (executionContext & RenderContext) === NoContext) {\n        workInProgressRootInterleavedUpdatedLanes = mergeLanes(workInProgressRootInterleavedUpdatedLanes, lane);\n      }\n\n      if (workInProgressRootExitStatus === RootSuspendedWithDelay) {\n        // The root already suspended with a delay, which means this render\n        // definitely won't finish. Since we have a new update, let's mark it as\n        // suspended now, right before marking the incoming update. This has the\n        // effect of interrupting the current render and switching to the update.\n        // TODO: Make sure this doesn't override pings that happen while we've\n        // already started rendering.\n        markRootSuspended$1(root, workInProgressRootRenderLanes);\n      }\n    }\n\n    ensureRootIsScheduled(root, eventTime);\n\n    if (lane === SyncLane && executionContext === NoContext && (fiber.mode & ConcurrentMode) === NoMode && // Treat `act` as if it's inside `batchedUpdates`, even in legacy mode.\n    !( ReactCurrentActQueue$1.isBatchingLegacy)) {\n      // Flush the synchronous work now, unless we're already working or inside\n      // a batch. This is intentionally inside scheduleUpdateOnFiber instead of\n      // scheduleCallbackForFiber to preserve the ability to schedule a callback\n      // without immediately flushing it. We only do this for user-initiated\n      // updates, to preserve historical behavior of legacy mode.\n      resetRenderTimer();\n      flushSyncCallbacksOnlyInLegacyMode();\n    }\n  }\n}\nfunction scheduleInitialHydrationOnRoot(root, lane, eventTime) {\n  // This is a special fork of scheduleUpdateOnFiber that is only used to\n  // schedule the initial hydration of a root that has just been created. Most\n  // of the stuff in scheduleUpdateOnFiber can be skipped.\n  //\n  // The main reason for this separate path, though, is to distinguish the\n  // initial children from subsequent updates. In fully client-rendered roots\n  // (createRoot instead of hydrateRoot), all top-level renders are modeled as\n  // updates, but hydration roots are special because the initial render must\n  // match what was rendered on the server.\n  var current = root.current;\n  current.lanes = lane;\n  markRootUpdated(root, lane, eventTime);\n  ensureRootIsScheduled(root, eventTime);\n}\nfunction isUnsafeClassRenderPhaseUpdate(fiber) {\n  // Check if this is a render phase update. Only called by class components,\n  // which special (deprecated) behavior for UNSAFE_componentWillReceive props.\n  return (// TODO: Remove outdated deferRenderPhaseUpdateToNextBatch experiment. We\n    // decided not to enable it.\n     (executionContext & RenderContext) !== NoContext\n  );\n} // Use this function to schedule a task for a root. There's only one task per\n// root; if a task was already scheduled, we'll check to make sure the priority\n// of the existing task is the same as the priority of the next level that the\n// root has work on. This function is called on every update, and right before\n// exiting a task.\n\nfunction ensureRootIsScheduled(root, currentTime) {\n  var existingCallbackNode = root.callbackNode; // Check if any lanes are being starved by other work. If so, mark them as\n  // expired so we know to work on those next.\n\n  markStarvedLanesAsExpired(root, currentTime); // Determine the next lanes to work on, and their priority.\n\n  var nextLanes = getNextLanes(root, root === workInProgressRoot ? workInProgressRootRenderLanes : NoLanes);\n\n  if (nextLanes === NoLanes) {\n    // Special case: There's nothing to work on.\n    if (existingCallbackNode !== null) {\n      cancelCallback$1(existingCallbackNode);\n    }\n\n    root.callbackNode = null;\n    root.callbackPriority = NoLane;\n    return;\n  } // We use the highest priority lane to represent the priority of the callback.\n\n\n  var newCallbackPriority = getHighestPriorityLane(nextLanes); // Check if there's an existing task. We may be able to reuse it.\n\n  var existingCallbackPriority = root.callbackPriority;\n\n  if (existingCallbackPriority === newCallbackPriority && // Special case related to `act`. If the currently scheduled task is a\n  // Scheduler task, rather than an `act` task, cancel it and re-scheduled\n  // on the `act` queue.\n  !( ReactCurrentActQueue$1.current !== null && existingCallbackNode !== fakeActCallbackNode)) {\n    {\n      // If we're going to re-use an existing task, it needs to exist.\n      // Assume that discrete update microtasks are non-cancellable and null.\n      // TODO: Temporary until we confirm this warning is not fired.\n      if (existingCallbackNode == null && existingCallbackPriority !== SyncLane) {\n        error('Expected scheduled callback to exist. This error is likely caused by a bug in React. Please file an issue.');\n      }\n    } // The priority hasn't changed. We can reuse the existing task. Exit.\n\n\n    return;\n  }\n\n  if (existingCallbackNode != null) {\n    // Cancel the existing callback. We'll schedule a new one below.\n    cancelCallback$1(existingCallbackNode);\n  } // Schedule a new callback.\n\n\n  var newCallbackNode;\n\n  if (newCallbackPriority === SyncLane) {\n    // Special case: Sync React callbacks are scheduled on a special\n    // internal queue\n    if (root.tag === LegacyRoot) {\n      if ( ReactCurrentActQueue$1.isBatchingLegacy !== null) {\n        ReactCurrentActQueue$1.didScheduleLegacyUpdate = true;\n      }\n\n      scheduleLegacySyncCallback(performSyncWorkOnRoot.bind(null, root));\n    } else {\n      scheduleSyncCallback(performSyncWorkOnRoot.bind(null, root));\n    }\n\n    {\n      // Flush the queue in a microtask.\n      if ( ReactCurrentActQueue$1.current !== null) {\n        // Inside `act`, use our internal `act` queue so that these get flushed\n        // at the end of the current scope even when using the sync version\n        // of `act`.\n        ReactCurrentActQueue$1.current.push(flushSyncCallbacks);\n      } else {\n        scheduleMicrotask(function () {\n          // In Safari, appending an iframe forces microtasks to run.\n          // https://github.com/facebook/react/issues/22459\n          // We don't support running callbacks in the middle of render\n          // or commit so we need to check against that.\n          if ((executionContext & (RenderContext | CommitContext)) === NoContext) {\n            // Note that this would still prematurely flush the callbacks\n            // if this happens outside render or commit phase (e.g. in an event).\n            flushSyncCallbacks();\n          }\n        });\n      }\n    }\n\n    newCallbackNode = null;\n  } else {\n    var schedulerPriorityLevel;\n\n    switch (lanesToEventPriority(nextLanes)) {\n      case DiscreteEventPriority:\n        schedulerPriorityLevel = ImmediatePriority;\n        break;\n\n      case ContinuousEventPriority:\n        schedulerPriorityLevel = UserBlockingPriority;\n        break;\n\n      case DefaultEventPriority:\n        schedulerPriorityLevel = NormalPriority;\n        break;\n\n      case IdleEventPriority:\n        schedulerPriorityLevel = IdlePriority;\n        break;\n\n      default:\n        schedulerPriorityLevel = NormalPriority;\n        break;\n    }\n\n    newCallbackNode = scheduleCallback$1(schedulerPriorityLevel, performConcurrentWorkOnRoot.bind(null, root));\n  }\n\n  root.callbackPriority = newCallbackPriority;\n  root.callbackNode = newCallbackNode;\n} // This is the entry point for every concurrent task, i.e. anything that\n// goes through Scheduler.\n\n\nfunction performConcurrentWorkOnRoot(root, didTimeout) {\n  {\n    resetNestedUpdateFlag();\n  } // Since we know we're in a React event, we can clear the current\n  // event time. The next update will compute a new event time.\n\n\n  currentEventTime = NoTimestamp;\n  currentEventTransitionLane = NoLanes;\n\n  if ((executionContext & (RenderContext | CommitContext)) !== NoContext) {\n    throw new Error('Should not already be working.');\n  } // Flush any pending passive effects before deciding which lanes to work on,\n  // in case they schedule additional work.\n\n\n  var originalCallbackNode = root.callbackNode;\n  var didFlushPassiveEffects = flushPassiveEffects();\n\n  if (didFlushPassiveEffects) {\n    // Something in the passive effect phase may have canceled the current task.\n    // Check if the task node for this root was changed.\n    if (root.callbackNode !== originalCallbackNode) {\n      // The current task was canceled. Exit. We don't need to call\n      // `ensureRootIsScheduled` because the check above implies either that\n      // there's a new task, or that there's no remaining work on this root.\n      return null;\n    }\n  } // Determine the next lanes to work on, using the fields stored\n  // on the root.\n\n\n  var lanes = getNextLanes(root, root === workInProgressRoot ? workInProgressRootRenderLanes : NoLanes);\n\n  if (lanes === NoLanes) {\n    // Defensive coding. This is never expected to happen.\n    return null;\n  } // We disable time-slicing in some cases: if the work has been CPU-bound\n  // for too long (\"expired\" work, to prevent starvation), or we're in\n  // sync-updates-by-default mode.\n  // TODO: We only check `didTimeout` defensively, to account for a Scheduler\n  // bug we're still investigating. Once the bug in Scheduler is fixed,\n  // we can remove this, since we track expiration ourselves.\n\n\n  var shouldTimeSlice = !includesBlockingLane(root, lanes) && !includesExpiredLane(root, lanes) && ( !didTimeout);\n  var exitStatus = shouldTimeSlice ? renderRootConcurrent(root, lanes) : renderRootSync(root, lanes);\n\n  if (exitStatus !== RootInProgress) {\n    if (exitStatus === RootErrored) {\n      // If something threw an error, try rendering one more time. We'll\n      // render synchronously to block concurrent data mutations, and we'll\n      // includes all pending updates are included. If it still fails after\n      // the second attempt, we'll give up and commit the resulting tree.\n      var errorRetryLanes = getLanesToRetrySynchronouslyOnError(root);\n\n      if (errorRetryLanes !== NoLanes) {\n        lanes = errorRetryLanes;\n        exitStatus = recoverFromConcurrentError(root, errorRetryLanes);\n      }\n    }\n\n    if (exitStatus === RootFatalErrored) {\n      var fatalError = workInProgressRootFatalError;\n      prepareFreshStack(root, NoLanes);\n      markRootSuspended$1(root, lanes);\n      ensureRootIsScheduled(root, now());\n      throw fatalError;\n    }\n\n    if (exitStatus === RootDidNotComplete) {\n      // The render unwound without completing the tree. This happens in special\n      // cases where need to exit the current render without producing a\n      // consistent tree or committing.\n      //\n      // This should only happen during a concurrent render, not a discrete or\n      // synchronous update. We should have already checked for this when we\n      // unwound the stack.\n      markRootSuspended$1(root, lanes);\n    } else {\n      // The render completed.\n      // Check if this render may have yielded to a concurrent event, and if so,\n      // confirm that any newly rendered stores are consistent.\n      // TODO: It's possible that even a concurrent render may never have yielded\n      // to the main thread, if it was fast enough, or if it expired. We could\n      // skip the consistency check in that case, too.\n      var renderWasConcurrent = !includesBlockingLane(root, lanes);\n      var finishedWork = root.current.alternate;\n\n      if (renderWasConcurrent && !isRenderConsistentWithExternalStores(finishedWork)) {\n        // A store was mutated in an interleaved event. Render again,\n        // synchronously, to block further mutations.\n        exitStatus = renderRootSync(root, lanes); // We need to check again if something threw\n\n        if (exitStatus === RootErrored) {\n          var _errorRetryLanes = getLanesToRetrySynchronouslyOnError(root);\n\n          if (_errorRetryLanes !== NoLanes) {\n            lanes = _errorRetryLanes;\n            exitStatus = recoverFromConcurrentError(root, _errorRetryLanes); // We assume the tree is now consistent because we didn't yield to any\n            // concurrent events.\n          }\n        }\n\n        if (exitStatus === RootFatalErrored) {\n          var _fatalError = workInProgressRootFatalError;\n          prepareFreshStack(root, NoLanes);\n          markRootSuspended$1(root, lanes);\n          ensureRootIsScheduled(root, now());\n          throw _fatalError;\n        }\n      } // We now have a consistent tree. The next step is either to commit it,\n      // or, if something suspended, wait to commit it after a timeout.\n\n\n      root.finishedWork = finishedWork;\n      root.finishedLanes = lanes;\n      finishConcurrentRender(root, exitStatus, lanes);\n    }\n  }\n\n  ensureRootIsScheduled(root, now());\n\n  if (root.callbackNode === originalCallbackNode) {\n    // The task node scheduled for this root is the same one that's\n    // currently executed. Need to return a continuation.\n    return performConcurrentWorkOnRoot.bind(null, root);\n  }\n\n  return null;\n}\n\nfunction recoverFromConcurrentError(root, errorRetryLanes) {\n  // If an error occurred during hydration, discard server response and fall\n  // back to client side render.\n  // Before rendering again, save the errors from the previous attempt.\n  var errorsFromFirstAttempt = workInProgressRootConcurrentErrors;\n\n  if (isRootDehydrated(root)) {\n    // The shell failed to hydrate. Set a flag to force a client rendering\n    // during the next attempt. To do this, we call prepareFreshStack now\n    // to create the root work-in-progress fiber. This is a bit weird in terms\n    // of factoring, because it relies on renderRootSync not calling\n    // prepareFreshStack again in the call below, which happens because the\n    // root and lanes haven't changed.\n    //\n    // TODO: I think what we should do is set ForceClientRender inside\n    // throwException, like we do for nested Suspense boundaries. The reason\n    // it's here instead is so we can switch to the synchronous work loop, too.\n    // Something to consider for a future refactor.\n    var rootWorkInProgress = prepareFreshStack(root, errorRetryLanes);\n    rootWorkInProgress.flags |= ForceClientRender;\n\n    {\n      errorHydratingContainer(root.containerInfo);\n    }\n  }\n\n  var exitStatus = renderRootSync(root, errorRetryLanes);\n\n  if (exitStatus !== RootErrored) {\n    // Successfully finished rendering on retry\n    // The errors from the failed first attempt have been recovered. Add\n    // them to the collection of recoverable errors. We'll log them in the\n    // commit phase.\n    var errorsFromSecondAttempt = workInProgressRootRecoverableErrors;\n    workInProgressRootRecoverableErrors = errorsFromFirstAttempt; // The errors from the second attempt should be queued after the errors\n    // from the first attempt, to preserve the causal sequence.\n\n    if (errorsFromSecondAttempt !== null) {\n      queueRecoverableErrors(errorsFromSecondAttempt);\n    }\n  }\n\n  return exitStatus;\n}\n\nfunction queueRecoverableErrors(errors) {\n  if (workInProgressRootRecoverableErrors === null) {\n    workInProgressRootRecoverableErrors = errors;\n  } else {\n    workInProgressRootRecoverableErrors.push.apply(workInProgressRootRecoverableErrors, errors);\n  }\n}\n\nfunction finishConcurrentRender(root, exitStatus, lanes) {\n  switch (exitStatus) {\n    case RootInProgress:\n    case RootFatalErrored:\n      {\n        throw new Error('Root did not complete. This is a bug in React.');\n      }\n    // Flow knows about invariant, so it complains if I add a break\n    // statement, but eslint doesn't know about invariant, so it complains\n    // if I do. eslint-disable-next-line no-fallthrough\n\n    case RootErrored:\n      {\n        // We should have already attempted to retry this tree. If we reached\n        // this point, it errored again. Commit it.\n        commitRoot(root, workInProgressRootRecoverableErrors, workInProgressTransitions);\n        break;\n      }\n\n    case RootSuspended:\n      {\n        markRootSuspended$1(root, lanes); // We have an acceptable loading state. We need to figure out if we\n        // should immediately commit it or wait a bit.\n\n        if (includesOnlyRetries(lanes) && // do not delay if we're inside an act() scope\n        !shouldForceFlushFallbacksInDEV()) {\n          // This render only included retries, no updates. Throttle committing\n          // retries so that we don't show too many loading states too quickly.\n          var msUntilTimeout = globalMostRecentFallbackTime + FALLBACK_THROTTLE_MS - now(); // Don't bother with a very short suspense time.\n\n          if (msUntilTimeout > 10) {\n            var nextLanes = getNextLanes(root, NoLanes);\n\n            if (nextLanes !== NoLanes) {\n              // There's additional work on this root.\n              break;\n            }\n\n            var suspendedLanes = root.suspendedLanes;\n\n            if (!isSubsetOfLanes(suspendedLanes, lanes)) {\n              // We should prefer to render the fallback of at the last\n              // suspended level. Ping the last suspended level to try\n              // rendering it again.\n              // FIXME: What if the suspended lanes are Idle? Should not restart.\n              var eventTime = requestEventTime();\n              markRootPinged(root, suspendedLanes);\n              break;\n            } // The render is suspended, it hasn't timed out, and there's no\n            // lower priority work to do. Instead of committing the fallback\n            // immediately, wait for more data to arrive.\n\n\n            root.timeoutHandle = scheduleTimeout(commitRoot.bind(null, root, workInProgressRootRecoverableErrors, workInProgressTransitions), msUntilTimeout);\n            break;\n          }\n        } // The work expired. Commit immediately.\n\n\n        commitRoot(root, workInProgressRootRecoverableErrors, workInProgressTransitions);\n        break;\n      }\n\n    case RootSuspendedWithDelay:\n      {\n        markRootSuspended$1(root, lanes);\n\n        if (includesOnlyTransitions(lanes)) {\n          // This is a transition, so we should exit without committing a\n          // placeholder and without scheduling a timeout. Delay indefinitely\n          // until we receive more data.\n          break;\n        }\n\n        if (!shouldForceFlushFallbacksInDEV()) {\n          // This is not a transition, but we did trigger an avoided state.\n          // Schedule a placeholder to display after a short delay, using the Just\n          // Noticeable Difference.\n          // TODO: Is the JND optimization worth the added complexity? If this is\n          // the only reason we track the event time, then probably not.\n          // Consider removing.\n          var mostRecentEventTime = getMostRecentEventTime(root, lanes);\n          var eventTimeMs = mostRecentEventTime;\n          var timeElapsedMs = now() - eventTimeMs;\n\n          var _msUntilTimeout = jnd(timeElapsedMs) - timeElapsedMs; // Don't bother with a very short suspense time.\n\n\n          if (_msUntilTimeout > 10) {\n            // Instead of committing the fallback immediately, wait for more data\n            // to arrive.\n            root.timeoutHandle = scheduleTimeout(commitRoot.bind(null, root, workInProgressRootRecoverableErrors, workInProgressTransitions), _msUntilTimeout);\n            break;\n          }\n        } // Commit the placeholder.\n\n\n        commitRoot(root, workInProgressRootRecoverableErrors, workInProgressTransitions);\n        break;\n      }\n\n    case RootCompleted:\n      {\n        // The work completed. Ready to commit.\n        commitRoot(root, workInProgressRootRecoverableErrors, workInProgressTransitions);\n        break;\n      }\n\n    default:\n      {\n        throw new Error('Unknown root exit status.');\n      }\n  }\n}\n\nfunction isRenderConsistentWithExternalStores(finishedWork) {\n  // Search the rendered tree for external store reads, and check whether the\n  // stores were mutated in a concurrent event. Intentionally using an iterative\n  // loop instead of recursion so we can exit early.\n  var node = finishedWork;\n\n  while (true) {\n    if (node.flags & StoreConsistency) {\n      var updateQueue = node.updateQueue;\n\n      if (updateQueue !== null) {\n        var checks = updateQueue.stores;\n\n        if (checks !== null) {\n          for (var i = 0; i < checks.length; i++) {\n            var check = checks[i];\n            var getSnapshot = check.getSnapshot;\n            var renderedValue = check.value;\n\n            try {\n              if (!objectIs(getSnapshot(), renderedValue)) {\n                // Found an inconsistent store.\n                return false;\n              }\n            } catch (error) {\n              // If `getSnapshot` throws, return `false`. This will schedule\n              // a re-render, and the error will be rethrown during render.\n              return false;\n            }\n          }\n        }\n      }\n    }\n\n    var child = node.child;\n\n    if (node.subtreeFlags & StoreConsistency && child !== null) {\n      child.return = node;\n      node = child;\n      continue;\n    }\n\n    if (node === finishedWork) {\n      return true;\n    }\n\n    while (node.sibling === null) {\n      if (node.return === null || node.return === finishedWork) {\n        return true;\n      }\n\n      node = node.return;\n    }\n\n    node.sibling.return = node.return;\n    node = node.sibling;\n  } // Flow doesn't know this is unreachable, but eslint does\n  // eslint-disable-next-line no-unreachable\n\n\n  return true;\n}\n\nfunction markRootSuspended$1(root, suspendedLanes) {\n  // When suspending, we should always exclude lanes that were pinged or (more\n  // rarely, since we try to avoid it) updated during the render phase.\n  // TODO: Lol maybe there's a better way to factor this besides this\n  // obnoxiously named function :)\n  suspendedLanes = removeLanes(suspendedLanes, workInProgressRootPingedLanes);\n  suspendedLanes = removeLanes(suspendedLanes, workInProgressRootInterleavedUpdatedLanes);\n  markRootSuspended(root, suspendedLanes);\n} // This is the entry point for synchronous tasks that don't go\n// through Scheduler\n\n\nfunction performSyncWorkOnRoot(root) {\n  {\n    syncNestedUpdateFlag();\n  }\n\n  if ((executionContext & (RenderContext | CommitContext)) !== NoContext) {\n    throw new Error('Should not already be working.');\n  }\n\n  flushPassiveEffects();\n  var lanes = getNextLanes(root, NoLanes);\n\n  if (!includesSomeLane(lanes, SyncLane)) {\n    // There's no remaining sync work left.\n    ensureRootIsScheduled(root, now());\n    return null;\n  }\n\n  var exitStatus = renderRootSync(root, lanes);\n\n  if (root.tag !== LegacyRoot && exitStatus === RootErrored) {\n    // If something threw an error, try rendering one more time. We'll render\n    // synchronously to block concurrent data mutations, and we'll includes\n    // all pending updates are included. If it still fails after the second\n    // attempt, we'll give up and commit the resulting tree.\n    var errorRetryLanes = getLanesToRetrySynchronouslyOnError(root);\n\n    if (errorRetryLanes !== NoLanes) {\n      lanes = errorRetryLanes;\n      exitStatus = recoverFromConcurrentError(root, errorRetryLanes);\n    }\n  }\n\n  if (exitStatus === RootFatalErrored) {\n    var fatalError = workInProgressRootFatalError;\n    prepareFreshStack(root, NoLanes);\n    markRootSuspended$1(root, lanes);\n    ensureRootIsScheduled(root, now());\n    throw fatalError;\n  }\n\n  if (exitStatus === RootDidNotComplete) {\n    throw new Error('Root did not complete. This is a bug in React.');\n  } // We now have a consistent tree. Because this is a sync render, we\n  // will commit it even if something suspended.\n\n\n  var finishedWork = root.current.alternate;\n  root.finishedWork = finishedWork;\n  root.finishedLanes = lanes;\n  commitRoot(root, workInProgressRootRecoverableErrors, workInProgressTransitions); // Before exiting, make sure there's a callback scheduled for the next\n  // pending level.\n\n  ensureRootIsScheduled(root, now());\n  return null;\n}\n\nfunction flushRoot(root, lanes) {\n  if (lanes !== NoLanes) {\n    markRootEntangled(root, mergeLanes(lanes, SyncLane));\n    ensureRootIsScheduled(root, now());\n\n    if ((executionContext & (RenderContext | CommitContext)) === NoContext) {\n      resetRenderTimer();\n      flushSyncCallbacks();\n    }\n  }\n}\nfunction batchedUpdates$1(fn, a) {\n  var prevExecutionContext = executionContext;\n  executionContext |= BatchedContext;\n\n  try {\n    return fn(a);\n  } finally {\n    executionContext = prevExecutionContext; // If there were legacy sync updates, flush them at the end of the outer\n    // most batchedUpdates-like method.\n\n    if (executionContext === NoContext && // Treat `act` as if it's inside `batchedUpdates`, even in legacy mode.\n    !( ReactCurrentActQueue$1.isBatchingLegacy)) {\n      resetRenderTimer();\n      flushSyncCallbacksOnlyInLegacyMode();\n    }\n  }\n}\nfunction discreteUpdates(fn, a, b, c, d) {\n  var previousPriority = getCurrentUpdatePriority();\n  var prevTransition = ReactCurrentBatchConfig$3.transition;\n\n  try {\n    ReactCurrentBatchConfig$3.transition = null;\n    setCurrentUpdatePriority(DiscreteEventPriority);\n    return fn(a, b, c, d);\n  } finally {\n    setCurrentUpdatePriority(previousPriority);\n    ReactCurrentBatchConfig$3.transition = prevTransition;\n\n    if (executionContext === NoContext) {\n      resetRenderTimer();\n    }\n  }\n} // Overload the definition to the two valid signatures.\n// Warning, this opts-out of checking the function body.\n\n// eslint-disable-next-line no-redeclare\nfunction flushSync(fn) {\n  // In legacy mode, we flush pending passive effects at the beginning of the\n  // next event, not at the end of the previous one.\n  if (rootWithPendingPassiveEffects !== null && rootWithPendingPassiveEffects.tag === LegacyRoot && (executionContext & (RenderContext | CommitContext)) === NoContext) {\n    flushPassiveEffects();\n  }\n\n  var prevExecutionContext = executionContext;\n  executionContext |= BatchedContext;\n  var prevTransition = ReactCurrentBatchConfig$3.transition;\n  var previousPriority = getCurrentUpdatePriority();\n\n  try {\n    ReactCurrentBatchConfig$3.transition = null;\n    setCurrentUpdatePriority(DiscreteEventPriority);\n\n    if (fn) {\n      return fn();\n    } else {\n      return undefined;\n    }\n  } finally {\n    setCurrentUpdatePriority(previousPriority);\n    ReactCurrentBatchConfig$3.transition = prevTransition;\n    executionContext = prevExecutionContext; // Flush the immediate callbacks that were scheduled during this batch.\n    // Note that this will happen even if batchedUpdates is higher up\n    // the stack.\n\n    if ((executionContext & (RenderContext | CommitContext)) === NoContext) {\n      flushSyncCallbacks();\n    }\n  }\n}\nfunction isAlreadyRendering() {\n  // Used by the renderer to print a warning if certain APIs are called from\n  // the wrong context.\n  return  (executionContext & (RenderContext | CommitContext)) !== NoContext;\n}\nfunction pushRenderLanes(fiber, lanes) {\n  push(subtreeRenderLanesCursor, subtreeRenderLanes, fiber);\n  subtreeRenderLanes = mergeLanes(subtreeRenderLanes, lanes);\n  workInProgressRootIncludedLanes = mergeLanes(workInProgressRootIncludedLanes, lanes);\n}\nfunction popRenderLanes(fiber) {\n  subtreeRenderLanes = subtreeRenderLanesCursor.current;\n  pop(subtreeRenderLanesCursor, fiber);\n}\n\nfunction prepareFreshStack(root, lanes) {\n  root.finishedWork = null;\n  root.finishedLanes = NoLanes;\n  var timeoutHandle = root.timeoutHandle;\n\n  if (timeoutHandle !== noTimeout) {\n    // The root previous suspended and scheduled a timeout to commit a fallback\n    // state. Now that we have additional work, cancel the timeout.\n    root.timeoutHandle = noTimeout; // $FlowFixMe Complains noTimeout is not a TimeoutID, despite the check above\n\n    cancelTimeout(timeoutHandle);\n  }\n\n  if (workInProgress !== null) {\n    var interruptedWork = workInProgress.return;\n\n    while (interruptedWork !== null) {\n      var current = interruptedWork.alternate;\n      unwindInterruptedWork(current, interruptedWork);\n      interruptedWork = interruptedWork.return;\n    }\n  }\n\n  workInProgressRoot = root;\n  var rootWorkInProgress = createWorkInProgress(root.current, null);\n  workInProgress = rootWorkInProgress;\n  workInProgressRootRenderLanes = subtreeRenderLanes = workInProgressRootIncludedLanes = lanes;\n  workInProgressRootExitStatus = RootInProgress;\n  workInProgressRootFatalError = null;\n  workInProgressRootSkippedLanes = NoLanes;\n  workInProgressRootInterleavedUpdatedLanes = NoLanes;\n  workInProgressRootPingedLanes = NoLanes;\n  workInProgressRootConcurrentErrors = null;\n  workInProgressRootRecoverableErrors = null;\n  finishQueueingConcurrentUpdates();\n\n  {\n    ReactStrictModeWarnings.discardPendingWarnings();\n  }\n\n  return rootWorkInProgress;\n}\n\nfunction handleError(root, thrownValue) {\n  do {\n    var erroredWork = workInProgress;\n\n    try {\n      // Reset module-level state that was set during the render phase.\n      resetContextDependencies();\n      resetHooksAfterThrow();\n      resetCurrentFiber(); // TODO: I found and added this missing line while investigating a\n      // separate issue. Write a regression test using string refs.\n\n      ReactCurrentOwner$2.current = null;\n\n      if (erroredWork === null || erroredWork.return === null) {\n        // Expected to be working on a non-root fiber. This is a fatal error\n        // because there's no ancestor that can handle it; the root is\n        // supposed to capture all errors that weren't caught by an error\n        // boundary.\n        workInProgressRootExitStatus = RootFatalErrored;\n        workInProgressRootFatalError = thrownValue; // Set `workInProgress` to null. This represents advancing to the next\n        // sibling, or the parent if there are no siblings. But since the root\n        // has no siblings nor a parent, we set it to null. Usually this is\n        // handled by `completeUnitOfWork` or `unwindWork`, but since we're\n        // intentionally not calling those, we need set it here.\n        // TODO: Consider calling `unwindWork` to pop the contexts.\n\n        workInProgress = null;\n        return;\n      }\n\n      if (enableProfilerTimer && erroredWork.mode & ProfileMode) {\n        // Record the time spent rendering before an error was thrown. This\n        // avoids inaccurate Profiler durations in the case of a\n        // suspended render.\n        stopProfilerTimerIfRunningAndRecordDelta(erroredWork, true);\n      }\n\n      if (enableSchedulingProfiler) {\n        markComponentRenderStopped();\n\n        if (thrownValue !== null && typeof thrownValue === 'object' && typeof thrownValue.then === 'function') {\n          var wakeable = thrownValue;\n          markComponentSuspended(erroredWork, wakeable, workInProgressRootRenderLanes);\n        } else {\n          markComponentErrored(erroredWork, thrownValue, workInProgressRootRenderLanes);\n        }\n      }\n\n      throwException(root, erroredWork.return, erroredWork, thrownValue, workInProgressRootRenderLanes);\n      completeUnitOfWork(erroredWork);\n    } catch (yetAnotherThrownValue) {\n      // Something in the return path also threw.\n      thrownValue = yetAnotherThrownValue;\n\n      if (workInProgress === erroredWork && erroredWork !== null) {\n        // If this boundary has already errored, then we had trouble processing\n        // the error. Bubble it to the next boundary.\n        erroredWork = erroredWork.return;\n        workInProgress = erroredWork;\n      } else {\n        erroredWork = workInProgress;\n      }\n\n      continue;\n    } // Return to the normal work loop.\n\n\n    return;\n  } while (true);\n}\n\nfunction pushDispatcher() {\n  var prevDispatcher = ReactCurrentDispatcher$2.current;\n  ReactCurrentDispatcher$2.current = ContextOnlyDispatcher;\n\n  if (prevDispatcher === null) {\n    // The React isomorphic package does not include a default dispatcher.\n    // Instead the first renderer will lazily attach one, in order to give\n    // nicer error messages.\n    return ContextOnlyDispatcher;\n  } else {\n    return prevDispatcher;\n  }\n}\n\nfunction popDispatcher(prevDispatcher) {\n  ReactCurrentDispatcher$2.current = prevDispatcher;\n}\n\nfunction markCommitTimeOfFallback() {\n  globalMostRecentFallbackTime = now();\n}\nfunction markSkippedUpdateLanes(lane) {\n  workInProgressRootSkippedLanes = mergeLanes(lane, workInProgressRootSkippedLanes);\n}\nfunction renderDidSuspend() {\n  if (workInProgressRootExitStatus === RootInProgress) {\n    workInProgressRootExitStatus = RootSuspended;\n  }\n}\nfunction renderDidSuspendDelayIfPossible() {\n  if (workInProgressRootExitStatus === RootInProgress || workInProgressRootExitStatus === RootSuspended || workInProgressRootExitStatus === RootErrored) {\n    workInProgressRootExitStatus = RootSuspendedWithDelay;\n  } // Check if there are updates that we skipped tree that might have unblocked\n  // this render.\n\n\n  if (workInProgressRoot !== null && (includesNonIdleWork(workInProgressRootSkippedLanes) || includesNonIdleWork(workInProgressRootInterleavedUpdatedLanes))) {\n    // Mark the current render as suspended so that we switch to working on\n    // the updates that were skipped. Usually we only suspend at the end of\n    // the render phase.\n    // TODO: We should probably always mark the root as suspended immediately\n    // (inside this function), since by suspending at the end of the render\n    // phase introduces a potential mistake where we suspend lanes that were\n    // pinged or updated while we were rendering.\n    markRootSuspended$1(workInProgressRoot, workInProgressRootRenderLanes);\n  }\n}\nfunction renderDidError(error) {\n  if (workInProgressRootExitStatus !== RootSuspendedWithDelay) {\n    workInProgressRootExitStatus = RootErrored;\n  }\n\n  if (workInProgressRootConcurrentErrors === null) {\n    workInProgressRootConcurrentErrors = [error];\n  } else {\n    workInProgressRootConcurrentErrors.push(error);\n  }\n} // Called during render to determine if anything has suspended.\n// Returns false if we're not sure.\n\nfunction renderHasNotSuspendedYet() {\n  // If something errored or completed, we can't really be sure,\n  // so those are false.\n  return workInProgressRootExitStatus === RootInProgress;\n}\n\nfunction renderRootSync(root, lanes) {\n  var prevExecutionContext = executionContext;\n  executionContext |= RenderContext;\n  var prevDispatcher = pushDispatcher(); // If the root or lanes have changed, throw out the existing stack\n  // and prepare a fresh one. Otherwise we'll continue where we left off.\n\n  if (workInProgressRoot !== root || workInProgressRootRenderLanes !== lanes) {\n    {\n      if (isDevToolsPresent) {\n        var memoizedUpdaters = root.memoizedUpdaters;\n\n        if (memoizedUpdaters.size > 0) {\n          restorePendingUpdaters(root, workInProgressRootRenderLanes);\n          memoizedUpdaters.clear();\n        } // At this point, move Fibers that scheduled the upcoming work from the Map to the Set.\n        // If we bailout on this work, we'll move them back (like above).\n        // It's important to move them now in case the work spawns more work at the same priority with different updaters.\n        // That way we can keep the current update and future updates separate.\n\n\n        movePendingFibersToMemoized(root, lanes);\n      }\n    }\n\n    workInProgressTransitions = getTransitionsForLanes();\n    prepareFreshStack(root, lanes);\n  }\n\n  {\n    markRenderStarted(lanes);\n  }\n\n  do {\n    try {\n      workLoopSync();\n      break;\n    } catch (thrownValue) {\n      handleError(root, thrownValue);\n    }\n  } while (true);\n\n  resetContextDependencies();\n  executionContext = prevExecutionContext;\n  popDispatcher(prevDispatcher);\n\n  if (workInProgress !== null) {\n    // This is a sync render, so we should have finished the whole tree.\n    throw new Error('Cannot commit an incomplete root. This error is likely caused by a ' + 'bug in React. Please file an issue.');\n  }\n\n  {\n    markRenderStopped();\n  } // Set this to null to indicate there's no in-progress render.\n\n\n  workInProgressRoot = null;\n  workInProgressRootRenderLanes = NoLanes;\n  return workInProgressRootExitStatus;\n} // The work loop is an extremely hot path. Tell Closure not to inline it.\n\n/** @noinline */\n\n\nfunction workLoopSync() {\n  // Already timed out, so perform work without checking if we need to yield.\n  while (workInProgress !== null) {\n    performUnitOfWork(workInProgress);\n  }\n}\n\nfunction renderRootConcurrent(root, lanes) {\n  var prevExecutionContext = executionContext;\n  executionContext |= RenderContext;\n  var prevDispatcher = pushDispatcher(); // If the root or lanes have changed, throw out the existing stack\n  // and prepare a fresh one. Otherwise we'll continue where we left off.\n\n  if (workInProgressRoot !== root || workInProgressRootRenderLanes !== lanes) {\n    {\n      if (isDevToolsPresent) {\n        var memoizedUpdaters = root.memoizedUpdaters;\n\n        if (memoizedUpdaters.size > 0) {\n          restorePendingUpdaters(root, workInProgressRootRenderLanes);\n          memoizedUpdaters.clear();\n        } // At this point, move Fibers that scheduled the upcoming work from the Map to the Set.\n        // If we bailout on this work, we'll move them back (like above).\n        // It's important to move them now in case the work spawns more work at the same priority with different updaters.\n        // That way we can keep the current update and future updates separate.\n\n\n        movePendingFibersToMemoized(root, lanes);\n      }\n    }\n\n    workInProgressTransitions = getTransitionsForLanes();\n    resetRenderTimer();\n    prepareFreshStack(root, lanes);\n  }\n\n  {\n    markRenderStarted(lanes);\n  }\n\n  do {\n    try {\n      workLoopConcurrent();\n      break;\n    } catch (thrownValue) {\n      handleError(root, thrownValue);\n    }\n  } while (true);\n\n  resetContextDependencies();\n  popDispatcher(prevDispatcher);\n  executionContext = prevExecutionContext;\n\n\n  if (workInProgress !== null) {\n    // Still work remaining.\n    {\n      markRenderYielded();\n    }\n\n    return RootInProgress;\n  } else {\n    // Completed the tree.\n    {\n      markRenderStopped();\n    } // Set this to null to indicate there's no in-progress render.\n\n\n    workInProgressRoot = null;\n    workInProgressRootRenderLanes = NoLanes; // Return the final exit status.\n\n    return workInProgressRootExitStatus;\n  }\n}\n/** @noinline */\n\n\nfunction workLoopConcurrent() {\n  // Perform work until Scheduler asks us to yield\n  while (workInProgress !== null && !shouldYield()) {\n    performUnitOfWork(workInProgress);\n  }\n}\n\nfunction performUnitOfWork(unitOfWork) {\n  // The current, flushed, state of this fiber is the alternate. Ideally\n  // nothing should rely on this, but relying on it here means that we don't\n  // need an additional field on the work in progress.\n  var current = unitOfWork.alternate;\n  setCurrentFiber(unitOfWork);\n  var next;\n\n  if ( (unitOfWork.mode & ProfileMode) !== NoMode) {\n    startProfilerTimer(unitOfWork);\n    next = beginWork$1(current, unitOfWork, subtreeRenderLanes);\n    stopProfilerTimerIfRunningAndRecordDelta(unitOfWork, true);\n  } else {\n    next = beginWork$1(current, unitOfWork, subtreeRenderLanes);\n  }\n\n  resetCurrentFiber();\n  unitOfWork.memoizedProps = unitOfWork.pendingProps;\n\n  if (next === null) {\n    // If this doesn't spawn new work, complete the current work.\n    completeUnitOfWork(unitOfWork);\n  } else {\n    workInProgress = next;\n  }\n\n  ReactCurrentOwner$2.current = null;\n}\n\nfunction completeUnitOfWork(unitOfWork) {\n  // Attempt to complete the current unit of work, then move to the next\n  // sibling. If there are no more siblings, return to the parent fiber.\n  var completedWork = unitOfWork;\n\n  do {\n    // The current, flushed, state of this fiber is the alternate. Ideally\n    // nothing should rely on this, but relying on it here means that we don't\n    // need an additional field on the work in progress.\n    var current = completedWork.alternate;\n    var returnFiber = completedWork.return; // Check if the work completed or if something threw.\n\n    if ((completedWork.flags & Incomplete) === NoFlags) {\n      setCurrentFiber(completedWork);\n      var next = void 0;\n\n      if ( (completedWork.mode & ProfileMode) === NoMode) {\n        next = completeWork(current, completedWork, subtreeRenderLanes);\n      } else {\n        startProfilerTimer(completedWork);\n        next = completeWork(current, completedWork, subtreeRenderLanes); // Update render duration assuming we didn't error.\n\n        stopProfilerTimerIfRunningAndRecordDelta(completedWork, false);\n      }\n\n      resetCurrentFiber();\n\n      if (next !== null) {\n        // Completing this fiber spawned new work. Work on that next.\n        workInProgress = next;\n        return;\n      }\n    } else {\n      // This fiber did not complete because something threw. Pop values off\n      // the stack without entering the complete phase. If this is a boundary,\n      // capture values if possible.\n      var _next = unwindWork(current, completedWork); // Because this fiber did not complete, don't reset its lanes.\n\n\n      if (_next !== null) {\n        // If completing this work spawned new work, do that next. We'll come\n        // back here again.\n        // Since we're restarting, remove anything that is not a host effect\n        // from the effect tag.\n        _next.flags &= HostEffectMask;\n        workInProgress = _next;\n        return;\n      }\n\n      if ( (completedWork.mode & ProfileMode) !== NoMode) {\n        // Record the render duration for the fiber that errored.\n        stopProfilerTimerIfRunningAndRecordDelta(completedWork, false); // Include the time spent working on failed children before continuing.\n\n        var actualDuration = completedWork.actualDuration;\n        var child = completedWork.child;\n\n        while (child !== null) {\n          actualDuration += child.actualDuration;\n          child = child.sibling;\n        }\n\n        completedWork.actualDuration = actualDuration;\n      }\n\n      if (returnFiber !== null) {\n        // Mark the parent fiber as incomplete and clear its subtree flags.\n        returnFiber.flags |= Incomplete;\n        returnFiber.subtreeFlags = NoFlags;\n        returnFiber.deletions = null;\n      } else {\n        // We've unwound all the way to the root.\n        workInProgressRootExitStatus = RootDidNotComplete;\n        workInProgress = null;\n        return;\n      }\n    }\n\n    var siblingFiber = completedWork.sibling;\n\n    if (siblingFiber !== null) {\n      // If there is more work to do in this returnFiber, do that next.\n      workInProgress = siblingFiber;\n      return;\n    } // Otherwise, return to the parent\n\n\n    completedWork = returnFiber; // Update the next thing we're working on in case something throws.\n\n    workInProgress = completedWork;\n  } while (completedWork !== null); // We've reached the root.\n\n\n  if (workInProgressRootExitStatus === RootInProgress) {\n    workInProgressRootExitStatus = RootCompleted;\n  }\n}\n\nfunction commitRoot(root, recoverableErrors, transitions) {\n  // TODO: This no longer makes any sense. We already wrap the mutation and\n  // layout phases. Should be able to remove.\n  var previousUpdateLanePriority = getCurrentUpdatePriority();\n  var prevTransition = ReactCurrentBatchConfig$3.transition;\n\n  try {\n    ReactCurrentBatchConfig$3.transition = null;\n    setCurrentUpdatePriority(DiscreteEventPriority);\n    commitRootImpl(root, recoverableErrors, transitions, previousUpdateLanePriority);\n  } finally {\n    ReactCurrentBatchConfig$3.transition = prevTransition;\n    setCurrentUpdatePriority(previousUpdateLanePriority);\n  }\n\n  return null;\n}\n\nfunction commitRootImpl(root, recoverableErrors, transitions, renderPriorityLevel) {\n  do {\n    // `flushPassiveEffects` will call `flushSyncUpdateQueue` at the end, which\n    // means `flushPassiveEffects` will sometimes result in additional\n    // passive effects. So we need to keep flushing in a loop until there are\n    // no more pending effects.\n    // TODO: Might be better if `flushPassiveEffects` did not automatically\n    // flush synchronous work at the end, to avoid factoring hazards like this.\n    flushPassiveEffects();\n  } while (rootWithPendingPassiveEffects !== null);\n\n  flushRenderPhaseStrictModeWarningsInDEV();\n\n  if ((executionContext & (RenderContext | CommitContext)) !== NoContext) {\n    throw new Error('Should not already be working.');\n  }\n\n  var finishedWork = root.finishedWork;\n  var lanes = root.finishedLanes;\n\n  {\n    markCommitStarted(lanes);\n  }\n\n  if (finishedWork === null) {\n\n    {\n      markCommitStopped();\n    }\n\n    return null;\n  } else {\n    {\n      if (lanes === NoLanes) {\n        error('root.finishedLanes should not be empty during a commit. This is a ' + 'bug in React.');\n      }\n    }\n  }\n\n  root.finishedWork = null;\n  root.finishedLanes = NoLanes;\n\n  if (finishedWork === root.current) {\n    throw new Error('Cannot commit the same tree as before. This error is likely caused by ' + 'a bug in React. Please file an issue.');\n  } // commitRoot never returns a continuation; it always finishes synchronously.\n  // So we can clear these now to allow a new callback to be scheduled.\n\n\n  root.callbackNode = null;\n  root.callbackPriority = NoLane; // Update the first and last pending times on this root. The new first\n  // pending time is whatever is left on the root fiber.\n\n  var remainingLanes = mergeLanes(finishedWork.lanes, finishedWork.childLanes);\n  markRootFinished(root, remainingLanes);\n\n  if (root === workInProgressRoot) {\n    // We can reset these now that they are finished.\n    workInProgressRoot = null;\n    workInProgress = null;\n    workInProgressRootRenderLanes = NoLanes;\n  } // If there are pending passive effects, schedule a callback to process them.\n  // Do this as early as possible, so it is queued before anything else that\n  // might get scheduled in the commit phase. (See #16714.)\n  // TODO: Delete all other places that schedule the passive effect callback\n  // They're redundant.\n\n\n  if ((finishedWork.subtreeFlags & PassiveMask) !== NoFlags || (finishedWork.flags & PassiveMask) !== NoFlags) {\n    if (!rootDoesHavePassiveEffects) {\n      rootDoesHavePassiveEffects = true;\n      // to store it in pendingPassiveTransitions until they get processed\n      // We need to pass this through as an argument to commitRoot\n      // because workInProgressTransitions might have changed between\n      // the previous render and commit if we throttle the commit\n      // with setTimeout\n\n      pendingPassiveTransitions = transitions;\n      scheduleCallback$1(NormalPriority, function () {\n        flushPassiveEffects(); // This render triggered passive effects: release the root cache pool\n        // *after* passive effects fire to avoid freeing a cache pool that may\n        // be referenced by a node in the tree (HostRoot, Cache boundary etc)\n\n        return null;\n      });\n    }\n  } // Check if there are any effects in the whole tree.\n  // TODO: This is left over from the effect list implementation, where we had\n  // to check for the existence of `firstEffect` to satisfy Flow. I think the\n  // only other reason this optimization exists is because it affects profiling.\n  // Reconsider whether this is necessary.\n\n\n  var subtreeHasEffects = (finishedWork.subtreeFlags & (BeforeMutationMask | MutationMask | LayoutMask | PassiveMask)) !== NoFlags;\n  var rootHasEffect = (finishedWork.flags & (BeforeMutationMask | MutationMask | LayoutMask | PassiveMask)) !== NoFlags;\n\n  if (subtreeHasEffects || rootHasEffect) {\n    var prevTransition = ReactCurrentBatchConfig$3.transition;\n    ReactCurrentBatchConfig$3.transition = null;\n    var previousPriority = getCurrentUpdatePriority();\n    setCurrentUpdatePriority(DiscreteEventPriority);\n    var prevExecutionContext = executionContext;\n    executionContext |= CommitContext; // Reset this to null before calling lifecycles\n\n    ReactCurrentOwner$2.current = null; // The commit phase is broken into several sub-phases. We do a separate pass\n    // of the effect list for each phase: all mutation effects come before all\n    // layout effects, and so on.\n    // The first phase a \"before mutation\" phase. We use this phase to read the\n    // state of the host tree right before we mutate it. This is where\n    // getSnapshotBeforeUpdate is called.\n\n    var shouldFireAfterActiveInstanceBlur = commitBeforeMutationEffects(root, finishedWork);\n\n    {\n      // Mark the current commit time to be shared by all Profilers in this\n      // batch. This enables them to be grouped later.\n      recordCommitTime();\n    }\n\n\n    commitMutationEffects(root, finishedWork, lanes);\n\n    resetAfterCommit(root.containerInfo); // The work-in-progress tree is now the current tree. This must come after\n    // the mutation phase, so that the previous tree is still current during\n    // componentWillUnmount, but before the layout phase, so that the finished\n    // work is current during componentDidMount/Update.\n\n    root.current = finishedWork; // The next phase is the layout phase, where we call effects that read\n\n    {\n      markLayoutEffectsStarted(lanes);\n    }\n\n    commitLayoutEffects(finishedWork, root, lanes);\n\n    {\n      markLayoutEffectsStopped();\n    }\n    // opportunity to paint.\n\n\n    requestPaint();\n    executionContext = prevExecutionContext; // Reset the priority to the previous non-sync value.\n\n    setCurrentUpdatePriority(previousPriority);\n    ReactCurrentBatchConfig$3.transition = prevTransition;\n  } else {\n    // No effects.\n    root.current = finishedWork; // Measure these anyway so the flamegraph explicitly shows that there were\n    // no effects.\n    // TODO: Maybe there's a better way to report this.\n\n    {\n      recordCommitTime();\n    }\n  }\n\n  var rootDidHavePassiveEffects = rootDoesHavePassiveEffects;\n\n  if (rootDoesHavePassiveEffects) {\n    // This commit has passive effects. Stash a reference to them. But don't\n    // schedule a callback until after flushing layout work.\n    rootDoesHavePassiveEffects = false;\n    rootWithPendingPassiveEffects = root;\n    pendingPassiveEffectsLanes = lanes;\n  } else {\n\n    {\n      nestedPassiveUpdateCount = 0;\n      rootWithPassiveNestedUpdates = null;\n    }\n  } // Read this again, since an effect might have updated it\n\n\n  remainingLanes = root.pendingLanes; // Check if there's remaining work on this root\n  // TODO: This is part of the `componentDidCatch` implementation. Its purpose\n  // is to detect whether something might have called setState inside\n  // `componentDidCatch`. The mechanism is known to be flawed because `setState`\n  // inside `componentDidCatch` is itself flawed — that's why we recommend\n  // `getDerivedStateFromError` instead. However, it could be improved by\n  // checking if remainingLanes includes Sync work, instead of whether there's\n  // any work remaining at all (which would also include stuff like Suspense\n  // retries or transitions). It's been like this for a while, though, so fixing\n  // it probably isn't that urgent.\n\n  if (remainingLanes === NoLanes) {\n    // If there's no remaining work, we can clear the set of already failed\n    // error boundaries.\n    legacyErrorBoundariesThatAlreadyFailed = null;\n  }\n\n  {\n    if (!rootDidHavePassiveEffects) {\n      commitDoubleInvokeEffectsInDEV(root.current, false);\n    }\n  }\n\n  onCommitRoot(finishedWork.stateNode, renderPriorityLevel);\n\n  {\n    if (isDevToolsPresent) {\n      root.memoizedUpdaters.clear();\n    }\n  }\n\n  {\n    onCommitRoot$1();\n  } // Always call this before exiting `commitRoot`, to ensure that any\n  // additional work on this root is scheduled.\n\n\n  ensureRootIsScheduled(root, now());\n\n  if (recoverableErrors !== null) {\n    // There were errors during this render, but recovered from them without\n    // needing to surface it to the UI. We log them here.\n    var onRecoverableError = root.onRecoverableError;\n\n    for (var i = 0; i < recoverableErrors.length; i++) {\n      var recoverableError = recoverableErrors[i];\n      var componentStack = recoverableError.stack;\n      var digest = recoverableError.digest;\n      onRecoverableError(recoverableError.value, {\n        componentStack: componentStack,\n        digest: digest\n      });\n    }\n  }\n\n  if (hasUncaughtError) {\n    hasUncaughtError = false;\n    var error$1 = firstUncaughtError;\n    firstUncaughtError = null;\n    throw error$1;\n  } // If the passive effects are the result of a discrete render, flush them\n  // synchronously at the end of the current task so that the result is\n  // immediately observable. Otherwise, we assume that they are not\n  // order-dependent and do not need to be observed by external systems, so we\n  // can wait until after paint.\n  // TODO: We can optimize this by not scheduling the callback earlier. Since we\n  // currently schedule the callback in multiple places, will wait until those\n  // are consolidated.\n\n\n  if (includesSomeLane(pendingPassiveEffectsLanes, SyncLane) && root.tag !== LegacyRoot) {\n    flushPassiveEffects();\n  } // Read this again, since a passive effect might have updated it\n\n\n  remainingLanes = root.pendingLanes;\n\n  if (includesSomeLane(remainingLanes, SyncLane)) {\n    {\n      markNestedUpdateScheduled();\n    } // Count the number of times the root synchronously re-renders without\n    // finishing. If there are too many, it indicates an infinite update loop.\n\n\n    if (root === rootWithNestedUpdates) {\n      nestedUpdateCount++;\n    } else {\n      nestedUpdateCount = 0;\n      rootWithNestedUpdates = root;\n    }\n  } else {\n    nestedUpdateCount = 0;\n  } // If layout work was scheduled, flush it now.\n\n\n  flushSyncCallbacks();\n\n  {\n    markCommitStopped();\n  }\n\n  return null;\n}\n\nfunction flushPassiveEffects() {\n  // Returns whether passive effects were flushed.\n  // TODO: Combine this check with the one in flushPassiveEFfectsImpl. We should\n  // probably just combine the two functions. I believe they were only separate\n  // in the first place because we used to wrap it with\n  // `Scheduler.runWithPriority`, which accepts a function. But now we track the\n  // priority within React itself, so we can mutate the variable directly.\n  if (rootWithPendingPassiveEffects !== null) {\n    var renderPriority = lanesToEventPriority(pendingPassiveEffectsLanes);\n    var priority = lowerEventPriority(DefaultEventPriority, renderPriority);\n    var prevTransition = ReactCurrentBatchConfig$3.transition;\n    var previousPriority = getCurrentUpdatePriority();\n\n    try {\n      ReactCurrentBatchConfig$3.transition = null;\n      setCurrentUpdatePriority(priority);\n      return flushPassiveEffectsImpl();\n    } finally {\n      setCurrentUpdatePriority(previousPriority);\n      ReactCurrentBatchConfig$3.transition = prevTransition; // Once passive effects have run for the tree - giving components a\n    }\n  }\n\n  return false;\n}\nfunction enqueuePendingPassiveProfilerEffect(fiber) {\n  {\n    pendingPassiveProfilerEffects.push(fiber);\n\n    if (!rootDoesHavePassiveEffects) {\n      rootDoesHavePassiveEffects = true;\n      scheduleCallback$1(NormalPriority, function () {\n        flushPassiveEffects();\n        return null;\n      });\n    }\n  }\n}\n\nfunction flushPassiveEffectsImpl() {\n  if (rootWithPendingPassiveEffects === null) {\n    return false;\n  } // Cache and clear the transitions flag\n\n\n  var transitions = pendingPassiveTransitions;\n  pendingPassiveTransitions = null;\n  var root = rootWithPendingPassiveEffects;\n  var lanes = pendingPassiveEffectsLanes;\n  rootWithPendingPassiveEffects = null; // TODO: This is sometimes out of sync with rootWithPendingPassiveEffects.\n  // Figure out why and fix it. It's not causing any known issues (probably\n  // because it's only used for profiling), but it's a refactor hazard.\n\n  pendingPassiveEffectsLanes = NoLanes;\n\n  if ((executionContext & (RenderContext | CommitContext)) !== NoContext) {\n    throw new Error('Cannot flush passive effects while already rendering.');\n  }\n\n  {\n    isFlushingPassiveEffects = true;\n    didScheduleUpdateDuringPassiveEffects = false;\n  }\n\n  {\n    markPassiveEffectsStarted(lanes);\n  }\n\n  var prevExecutionContext = executionContext;\n  executionContext |= CommitContext;\n  commitPassiveUnmountEffects(root.current);\n  commitPassiveMountEffects(root, root.current, lanes, transitions); // TODO: Move to commitPassiveMountEffects\n\n  {\n    var profilerEffects = pendingPassiveProfilerEffects;\n    pendingPassiveProfilerEffects = [];\n\n    for (var i = 0; i < profilerEffects.length; i++) {\n      var _fiber = profilerEffects[i];\n      commitPassiveEffectDurations(root, _fiber);\n    }\n  }\n\n  {\n    markPassiveEffectsStopped();\n  }\n\n  {\n    commitDoubleInvokeEffectsInDEV(root.current, true);\n  }\n\n  executionContext = prevExecutionContext;\n  flushSyncCallbacks();\n\n  {\n    // If additional passive effects were scheduled, increment a counter. If this\n    // exceeds the limit, we'll fire a warning.\n    if (didScheduleUpdateDuringPassiveEffects) {\n      if (root === rootWithPassiveNestedUpdates) {\n        nestedPassiveUpdateCount++;\n      } else {\n        nestedPassiveUpdateCount = 0;\n        rootWithPassiveNestedUpdates = root;\n      }\n    } else {\n      nestedPassiveUpdateCount = 0;\n    }\n\n    isFlushingPassiveEffects = false;\n    didScheduleUpdateDuringPassiveEffects = false;\n  } // TODO: Move to commitPassiveMountEffects\n\n\n  onPostCommitRoot(root);\n\n  {\n    var stateNode = root.current.stateNode;\n    stateNode.effectDuration = 0;\n    stateNode.passiveEffectDuration = 0;\n  }\n\n  return true;\n}\n\nfunction isAlreadyFailedLegacyErrorBoundary(instance) {\n  return legacyErrorBoundariesThatAlreadyFailed !== null && legacyErrorBoundariesThatAlreadyFailed.has(instance);\n}\nfunction markLegacyErrorBoundaryAsFailed(instance) {\n  if (legacyErrorBoundariesThatAlreadyFailed === null) {\n    legacyErrorBoundariesThatAlreadyFailed = new Set([instance]);\n  } else {\n    legacyErrorBoundariesThatAlreadyFailed.add(instance);\n  }\n}\n\nfunction prepareToThrowUncaughtError(error) {\n  if (!hasUncaughtError) {\n    hasUncaughtError = true;\n    firstUncaughtError = error;\n  }\n}\n\nvar onUncaughtError = prepareToThrowUncaughtError;\n\nfunction captureCommitPhaseErrorOnRoot(rootFiber, sourceFiber, error) {\n  var errorInfo = createCapturedValueAtFiber(error, sourceFiber);\n  var update = createRootErrorUpdate(rootFiber, errorInfo, SyncLane);\n  var root = enqueueUpdate(rootFiber, update, SyncLane);\n  var eventTime = requestEventTime();\n\n  if (root !== null) {\n    markRootUpdated(root, SyncLane, eventTime);\n    ensureRootIsScheduled(root, eventTime);\n  }\n}\n\nfunction captureCommitPhaseError(sourceFiber, nearestMountedAncestor, error$1) {\n  {\n    reportUncaughtErrorInDEV(error$1);\n    setIsRunningInsertionEffect(false);\n  }\n\n  if (sourceFiber.tag === HostRoot) {\n    // Error was thrown at the root. There is no parent, so the root\n    // itself should capture it.\n    captureCommitPhaseErrorOnRoot(sourceFiber, sourceFiber, error$1);\n    return;\n  }\n\n  var fiber = null;\n\n  {\n    fiber = nearestMountedAncestor;\n  }\n\n  while (fiber !== null) {\n    if (fiber.tag === HostRoot) {\n      captureCommitPhaseErrorOnRoot(fiber, sourceFiber, error$1);\n      return;\n    } else if (fiber.tag === ClassComponent) {\n      var ctor = fiber.type;\n      var instance = fiber.stateNode;\n\n      if (typeof ctor.getDerivedStateFromError === 'function' || typeof instance.componentDidCatch === 'function' && !isAlreadyFailedLegacyErrorBoundary(instance)) {\n        var errorInfo = createCapturedValueAtFiber(error$1, sourceFiber);\n        var update = createClassErrorUpdate(fiber, errorInfo, SyncLane);\n        var root = enqueueUpdate(fiber, update, SyncLane);\n        var eventTime = requestEventTime();\n\n        if (root !== null) {\n          markRootUpdated(root, SyncLane, eventTime);\n          ensureRootIsScheduled(root, eventTime);\n        }\n\n        return;\n      }\n    }\n\n    fiber = fiber.return;\n  }\n\n  {\n    // TODO: Until we re-land skipUnmountedBoundaries (see #20147), this warning\n    // will fire for errors that are thrown by destroy functions inside deleted\n    // trees. What it should instead do is propagate the error to the parent of\n    // the deleted tree. In the meantime, do not add this warning to the\n    // allowlist; this is only for our internal use.\n    error('Internal React error: Attempted to capture a commit phase error ' + 'inside a detached tree. This indicates a bug in React. Likely ' + 'causes include deleting the same fiber more than once, committing an ' + 'already-finished tree, or an inconsistent return pointer.\\n\\n' + 'Error message:\\n\\n%s', error$1);\n  }\n}\nfunction pingSuspendedRoot(root, wakeable, pingedLanes) {\n  var pingCache = root.pingCache;\n\n  if (pingCache !== null) {\n    // The wakeable resolved, so we no longer need to memoize, because it will\n    // never be thrown again.\n    pingCache.delete(wakeable);\n  }\n\n  var eventTime = requestEventTime();\n  markRootPinged(root, pingedLanes);\n  warnIfSuspenseResolutionNotWrappedWithActDEV(root);\n\n  if (workInProgressRoot === root && isSubsetOfLanes(workInProgressRootRenderLanes, pingedLanes)) {\n    // Received a ping at the same priority level at which we're currently\n    // rendering. We might want to restart this render. This should mirror\n    // the logic of whether or not a root suspends once it completes.\n    // TODO: If we're rendering sync either due to Sync, Batched or expired,\n    // we should probably never restart.\n    // If we're suspended with delay, or if it's a retry, we'll always suspend\n    // so we can always restart.\n    if (workInProgressRootExitStatus === RootSuspendedWithDelay || workInProgressRootExitStatus === RootSuspended && includesOnlyRetries(workInProgressRootRenderLanes) && now() - globalMostRecentFallbackTime < FALLBACK_THROTTLE_MS) {\n      // Restart from the root.\n      prepareFreshStack(root, NoLanes);\n    } else {\n      // Even though we can't restart right now, we might get an\n      // opportunity later. So we mark this render as having a ping.\n      workInProgressRootPingedLanes = mergeLanes(workInProgressRootPingedLanes, pingedLanes);\n    }\n  }\n\n  ensureRootIsScheduled(root, eventTime);\n}\n\nfunction retryTimedOutBoundary(boundaryFiber, retryLane) {\n  // The boundary fiber (a Suspense component or SuspenseList component)\n  // previously was rendered in its fallback state. One of the promises that\n  // suspended it has resolved, which means at least part of the tree was\n  // likely unblocked. Try rendering again, at a new lanes.\n  if (retryLane === NoLane) {\n    // TODO: Assign this to `suspenseState.retryLane`? to avoid\n    // unnecessary entanglement?\n    retryLane = requestRetryLane(boundaryFiber);\n  } // TODO: Special case idle priority?\n\n\n  var eventTime = requestEventTime();\n  var root = enqueueConcurrentRenderForLane(boundaryFiber, retryLane);\n\n  if (root !== null) {\n    markRootUpdated(root, retryLane, eventTime);\n    ensureRootIsScheduled(root, eventTime);\n  }\n}\n\nfunction retryDehydratedSuspenseBoundary(boundaryFiber) {\n  var suspenseState = boundaryFiber.memoizedState;\n  var retryLane = NoLane;\n\n  if (suspenseState !== null) {\n    retryLane = suspenseState.retryLane;\n  }\n\n  retryTimedOutBoundary(boundaryFiber, retryLane);\n}\nfunction resolveRetryWakeable(boundaryFiber, wakeable) {\n  var retryLane = NoLane; // Default\n\n  var retryCache;\n\n  switch (boundaryFiber.tag) {\n    case SuspenseComponent:\n      retryCache = boundaryFiber.stateNode;\n      var suspenseState = boundaryFiber.memoizedState;\n\n      if (suspenseState !== null) {\n        retryLane = suspenseState.retryLane;\n      }\n\n      break;\n\n    case SuspenseListComponent:\n      retryCache = boundaryFiber.stateNode;\n      break;\n\n    default:\n      throw new Error('Pinged unknown suspense boundary type. ' + 'This is probably a bug in React.');\n  }\n\n  if (retryCache !== null) {\n    // The wakeable resolved, so we no longer need to memoize, because it will\n    // never be thrown again.\n    retryCache.delete(wakeable);\n  }\n\n  retryTimedOutBoundary(boundaryFiber, retryLane);\n} // Computes the next Just Noticeable Difference (JND) boundary.\n// The theory is that a person can't tell the difference between small differences in time.\n// Therefore, if we wait a bit longer than necessary that won't translate to a noticeable\n// difference in the experience. However, waiting for longer might mean that we can avoid\n// showing an intermediate loading state. The longer we have already waited, the harder it\n// is to tell small differences in time. Therefore, the longer we've already waited,\n// the longer we can wait additionally. At some point we have to give up though.\n// We pick a train model where the next boundary commits at a consistent schedule.\n// These particular numbers are vague estimates. We expect to adjust them based on research.\n\nfunction jnd(timeElapsed) {\n  return timeElapsed < 120 ? 120 : timeElapsed < 480 ? 480 : timeElapsed < 1080 ? 1080 : timeElapsed < 1920 ? 1920 : timeElapsed < 3000 ? 3000 : timeElapsed < 4320 ? 4320 : ceil(timeElapsed / 1960) * 1960;\n}\n\nfunction checkForNestedUpdates() {\n  if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\n    nestedUpdateCount = 0;\n    rootWithNestedUpdates = null;\n    throw new Error('Maximum update depth exceeded. This can happen when a component ' + 'repeatedly calls setState inside componentWillUpdate or ' + 'componentDidUpdate. React limits the number of nested updates to ' + 'prevent infinite loops.');\n  }\n\n  {\n    if (nestedPassiveUpdateCount > NESTED_PASSIVE_UPDATE_LIMIT) {\n      nestedPassiveUpdateCount = 0;\n      rootWithPassiveNestedUpdates = null;\n\n      error('Maximum update depth exceeded. This can happen when a component ' + \"calls setState inside useEffect, but useEffect either doesn't \" + 'have a dependency array, or one of the dependencies changes on ' + 'every render.');\n    }\n  }\n}\n\nfunction flushRenderPhaseStrictModeWarningsInDEV() {\n  {\n    ReactStrictModeWarnings.flushLegacyContextWarning();\n\n    {\n      ReactStrictModeWarnings.flushPendingUnsafeLifecycleWarnings();\n    }\n  }\n}\n\nfunction commitDoubleInvokeEffectsInDEV(fiber, hasPassiveEffects) {\n  {\n    // TODO (StrictEffects) Should we set a marker on the root if it contains strict effects\n    // so we don't traverse unnecessarily? similar to subtreeFlags but just at the root level.\n    // Maybe not a big deal since this is DEV only behavior.\n    setCurrentFiber(fiber);\n    invokeEffectsInDev(fiber, MountLayoutDev, invokeLayoutEffectUnmountInDEV);\n\n    if (hasPassiveEffects) {\n      invokeEffectsInDev(fiber, MountPassiveDev, invokePassiveEffectUnmountInDEV);\n    }\n\n    invokeEffectsInDev(fiber, MountLayoutDev, invokeLayoutEffectMountInDEV);\n\n    if (hasPassiveEffects) {\n      invokeEffectsInDev(fiber, MountPassiveDev, invokePassiveEffectMountInDEV);\n    }\n\n    resetCurrentFiber();\n  }\n}\n\nfunction invokeEffectsInDev(firstChild, fiberFlags, invokeEffectFn) {\n  {\n    // We don't need to re-check StrictEffectsMode here.\n    // This function is only called if that check has already passed.\n    var current = firstChild;\n    var subtreeRoot = null;\n\n    while (current !== null) {\n      var primarySubtreeFlag = current.subtreeFlags & fiberFlags;\n\n      if (current !== subtreeRoot && current.child !== null && primarySubtreeFlag !== NoFlags) {\n        current = current.child;\n      } else {\n        if ((current.flags & fiberFlags) !== NoFlags) {\n          invokeEffectFn(current);\n        }\n\n        if (current.sibling !== null) {\n          current = current.sibling;\n        } else {\n          current = subtreeRoot = current.return;\n        }\n      }\n    }\n  }\n}\n\nvar didWarnStateUpdateForNotYetMountedComponent = null;\nfunction warnAboutUpdateOnNotYetMountedFiberInDEV(fiber) {\n  {\n    if ((executionContext & RenderContext) !== NoContext) {\n      // We let the other warning about render phase updates deal with this one.\n      return;\n    }\n\n    if (!(fiber.mode & ConcurrentMode)) {\n      return;\n    }\n\n    var tag = fiber.tag;\n\n    if (tag !== IndeterminateComponent && tag !== HostRoot && tag !== ClassComponent && tag !== FunctionComponent && tag !== ForwardRef && tag !== MemoComponent && tag !== SimpleMemoComponent) {\n      // Only warn for user-defined components, not internal ones like Suspense.\n      return;\n    } // We show the whole stack but dedupe on the top component's name because\n    // the problematic code almost always lies inside that component.\n\n\n    var componentName = getComponentNameFromFiber(fiber) || 'ReactComponent';\n\n    if (didWarnStateUpdateForNotYetMountedComponent !== null) {\n      if (didWarnStateUpdateForNotYetMountedComponent.has(componentName)) {\n        return;\n      }\n\n      didWarnStateUpdateForNotYetMountedComponent.add(componentName);\n    } else {\n      didWarnStateUpdateForNotYetMountedComponent = new Set([componentName]);\n    }\n\n    var previousFiber = current;\n\n    try {\n      setCurrentFiber(fiber);\n\n      error(\"Can't perform a React state update on a component that hasn't mounted yet. \" + 'This indicates that you have a side-effect in your render function that ' + 'asynchronously later calls tries to update the component. Move this work to ' + 'useEffect instead.');\n    } finally {\n      if (previousFiber) {\n        setCurrentFiber(fiber);\n      } else {\n        resetCurrentFiber();\n      }\n    }\n  }\n}\nvar beginWork$1;\n\n{\n  var dummyFiber = null;\n\n  beginWork$1 = function (current, unitOfWork, lanes) {\n    // If a component throws an error, we replay it again in a synchronously\n    // dispatched event, so that the debugger will treat it as an uncaught\n    // error See ReactErrorUtils for more information.\n    // Before entering the begin phase, copy the work-in-progress onto a dummy\n    // fiber. If beginWork throws, we'll use this to reset the state.\n    var originalWorkInProgressCopy = assignFiberPropertiesInDEV(dummyFiber, unitOfWork);\n\n    try {\n      return beginWork(current, unitOfWork, lanes);\n    } catch (originalError) {\n      if (didSuspendOrErrorWhileHydratingDEV() || originalError !== null && typeof originalError === 'object' && typeof originalError.then === 'function') {\n        // Don't replay promises.\n        // Don't replay errors if we are hydrating and have already suspended or handled an error\n        throw originalError;\n      } // Keep this code in sync with handleError; any changes here must have\n      // corresponding changes there.\n\n\n      resetContextDependencies();\n      resetHooksAfterThrow(); // Don't reset current debug fiber, since we're about to work on the\n      // same fiber again.\n      // Unwind the failed stack frame\n\n      unwindInterruptedWork(current, unitOfWork); // Restore the original properties of the fiber.\n\n      assignFiberPropertiesInDEV(unitOfWork, originalWorkInProgressCopy);\n\n      if ( unitOfWork.mode & ProfileMode) {\n        // Reset the profiler timer.\n        startProfilerTimer(unitOfWork);\n      } // Run beginWork again.\n\n\n      invokeGuardedCallback(null, beginWork, null, current, unitOfWork, lanes);\n\n      if (hasCaughtError()) {\n        var replayError = clearCaughtError();\n\n        if (typeof replayError === 'object' && replayError !== null && replayError._suppressLogging && typeof originalError === 'object' && originalError !== null && !originalError._suppressLogging) {\n          // If suppressed, let the flag carry over to the original error which is the one we'll rethrow.\n          originalError._suppressLogging = true;\n        }\n      } // We always throw the original error in case the second render pass is not idempotent.\n      // This can happen if a memoized function or CommonJS module doesn't throw after first invocation.\n\n\n      throw originalError;\n    }\n  };\n}\n\nvar didWarnAboutUpdateInRender = false;\nvar didWarnAboutUpdateInRenderForAnotherComponent;\n\n{\n  didWarnAboutUpdateInRenderForAnotherComponent = new Set();\n}\n\nfunction warnAboutRenderPhaseUpdatesInDEV(fiber) {\n  {\n    if (isRendering && !getIsUpdatingOpaqueValueInRenderPhaseInDEV()) {\n      switch (fiber.tag) {\n        case FunctionComponent:\n        case ForwardRef:\n        case SimpleMemoComponent:\n          {\n            var renderingComponentName = workInProgress && getComponentNameFromFiber(workInProgress) || 'Unknown'; // Dedupe by the rendering component because it's the one that needs to be fixed.\n\n            var dedupeKey = renderingComponentName;\n\n            if (!didWarnAboutUpdateInRenderForAnotherComponent.has(dedupeKey)) {\n              didWarnAboutUpdateInRenderForAnotherComponent.add(dedupeKey);\n              var setStateComponentName = getComponentNameFromFiber(fiber) || 'Unknown';\n\n              error('Cannot update a component (`%s`) while rendering a ' + 'different component (`%s`). To locate the bad setState() call inside `%s`, ' + 'follow the stack trace as described in https://reactjs.org/link/setstate-in-render', setStateComponentName, renderingComponentName, renderingComponentName);\n            }\n\n            break;\n          }\n\n        case ClassComponent:\n          {\n            if (!didWarnAboutUpdateInRender) {\n              error('Cannot update during an existing state transition (such as ' + 'within `render`). Render methods should be a pure ' + 'function of props and state.');\n\n              didWarnAboutUpdateInRender = true;\n            }\n\n            break;\n          }\n      }\n    }\n  }\n}\n\nfunction restorePendingUpdaters(root, lanes) {\n  {\n    if (isDevToolsPresent) {\n      var memoizedUpdaters = root.memoizedUpdaters;\n      memoizedUpdaters.forEach(function (schedulingFiber) {\n        addFiberToLanesMap(root, schedulingFiber, lanes);\n      }); // This function intentionally does not clear memoized updaters.\n      // Those may still be relevant to the current commit\n      // and a future one (e.g. Suspense).\n    }\n  }\n}\nvar fakeActCallbackNode = {};\n\nfunction scheduleCallback$1(priorityLevel, callback) {\n  {\n    // If we're currently inside an `act` scope, bypass Scheduler and push to\n    // the `act` queue instead.\n    var actQueue = ReactCurrentActQueue$1.current;\n\n    if (actQueue !== null) {\n      actQueue.push(callback);\n      return fakeActCallbackNode;\n    } else {\n      return scheduleCallback(priorityLevel, callback);\n    }\n  }\n}\n\nfunction cancelCallback$1(callbackNode) {\n  if ( callbackNode === fakeActCallbackNode) {\n    return;\n  } // In production, always call Scheduler. This function will be stripped out.\n\n\n  return cancelCallback(callbackNode);\n}\n\nfunction shouldForceFlushFallbacksInDEV() {\n  // Never force flush in production. This function should get stripped out.\n  return  ReactCurrentActQueue$1.current !== null;\n}\n\nfunction warnIfUpdatesNotWrappedWithActDEV(fiber) {\n  {\n    if (fiber.mode & ConcurrentMode) {\n      if (!isConcurrentActEnvironment()) {\n        // Not in an act environment. No need to warn.\n        return;\n      }\n    } else {\n      // Legacy mode has additional cases where we suppress a warning.\n      if (!isLegacyActEnvironment()) {\n        // Not in an act environment. No need to warn.\n        return;\n      }\n\n      if (executionContext !== NoContext) {\n        // Legacy mode doesn't warn if the update is batched, i.e.\n        // batchedUpdates or flushSync.\n        return;\n      }\n\n      if (fiber.tag !== FunctionComponent && fiber.tag !== ForwardRef && fiber.tag !== SimpleMemoComponent) {\n        // For backwards compatibility with pre-hooks code, legacy mode only\n        // warns for updates that originate from a hook.\n        return;\n      }\n    }\n\n    if (ReactCurrentActQueue$1.current === null) {\n      var previousFiber = current;\n\n      try {\n        setCurrentFiber(fiber);\n\n        error('An update to %s inside a test was not wrapped in act(...).\\n\\n' + 'When testing, code that causes React state updates should be ' + 'wrapped into act(...):\\n\\n' + 'act(() => {\\n' + '  /* fire events that update state */\\n' + '});\\n' + '/* assert on the output */\\n\\n' + \"This ensures that you're testing the behavior the user would see \" + 'in the browser.' + ' Learn more at https://reactjs.org/link/wrap-tests-with-act', getComponentNameFromFiber(fiber));\n      } finally {\n        if (previousFiber) {\n          setCurrentFiber(fiber);\n        } else {\n          resetCurrentFiber();\n        }\n      }\n    }\n  }\n}\n\nfunction warnIfSuspenseResolutionNotWrappedWithActDEV(root) {\n  {\n    if (root.tag !== LegacyRoot && isConcurrentActEnvironment() && ReactCurrentActQueue$1.current === null) {\n      error('A suspended resource finished loading inside a test, but the event ' + 'was not wrapped in act(...).\\n\\n' + 'When testing, code that resolves suspended data should be wrapped ' + 'into act(...):\\n\\n' + 'act(() => {\\n' + '  /* finish loading suspended data */\\n' + '});\\n' + '/* assert on the output */\\n\\n' + \"This ensures that you're testing the behavior the user would see \" + 'in the browser.' + ' Learn more at https://reactjs.org/link/wrap-tests-with-act');\n    }\n  }\n}\n\nfunction setIsRunningInsertionEffect(isRunning) {\n  {\n    isRunningInsertionEffect = isRunning;\n  }\n}\n\n/* eslint-disable react-internal/prod-error-codes */\nvar resolveFamily = null; // $FlowFixMe Flow gets confused by a WeakSet feature check below.\n\nvar failedBoundaries = null;\nvar setRefreshHandler = function (handler) {\n  {\n    resolveFamily = handler;\n  }\n};\nfunction resolveFunctionForHotReloading(type) {\n  {\n    if (resolveFamily === null) {\n      // Hot reloading is disabled.\n      return type;\n    }\n\n    var family = resolveFamily(type);\n\n    if (family === undefined) {\n      return type;\n    } // Use the latest known implementation.\n\n\n    return family.current;\n  }\n}\nfunction resolveClassForHotReloading(type) {\n  // No implementation differences.\n  return resolveFunctionForHotReloading(type);\n}\nfunction resolveForwardRefForHotReloading(type) {\n  {\n    if (resolveFamily === null) {\n      // Hot reloading is disabled.\n      return type;\n    }\n\n    var family = resolveFamily(type);\n\n    if (family === undefined) {\n      // Check if we're dealing with a real forwardRef. Don't want to crash early.\n      if (type !== null && type !== undefined && typeof type.render === 'function') {\n        // ForwardRef is special because its resolved .type is an object,\n        // but it's possible that we only have its inner render function in the map.\n        // If that inner render function is different, we'll build a new forwardRef type.\n        var currentRender = resolveFunctionForHotReloading(type.render);\n\n        if (type.render !== currentRender) {\n          var syntheticType = {\n            $$typeof: REACT_FORWARD_REF_TYPE,\n            render: currentRender\n          };\n\n          if (type.displayName !== undefined) {\n            syntheticType.displayName = type.displayName;\n          }\n\n          return syntheticType;\n        }\n      }\n\n      return type;\n    } // Use the latest known implementation.\n\n\n    return family.current;\n  }\n}\nfunction isCompatibleFamilyForHotReloading(fiber, element) {\n  {\n    if (resolveFamily === null) {\n      // Hot reloading is disabled.\n      return false;\n    }\n\n    var prevType = fiber.elementType;\n    var nextType = element.type; // If we got here, we know types aren't === equal.\n\n    var needsCompareFamilies = false;\n    var $$typeofNextType = typeof nextType === 'object' && nextType !== null ? nextType.$$typeof : null;\n\n    switch (fiber.tag) {\n      case ClassComponent:\n        {\n          if (typeof nextType === 'function') {\n            needsCompareFamilies = true;\n          }\n\n          break;\n        }\n\n      case FunctionComponent:\n        {\n          if (typeof nextType === 'function') {\n            needsCompareFamilies = true;\n          } else if ($$typeofNextType === REACT_LAZY_TYPE) {\n            // We don't know the inner type yet.\n            // We're going to assume that the lazy inner type is stable,\n            // and so it is sufficient to avoid reconciling it away.\n            // We're not going to unwrap or actually use the new lazy type.\n            needsCompareFamilies = true;\n          }\n\n          break;\n        }\n\n      case ForwardRef:\n        {\n          if ($$typeofNextType === REACT_FORWARD_REF_TYPE) {\n            needsCompareFamilies = true;\n          } else if ($$typeofNextType === REACT_LAZY_TYPE) {\n            needsCompareFamilies = true;\n          }\n\n          break;\n        }\n\n      case MemoComponent:\n      case SimpleMemoComponent:\n        {\n          if ($$typeofNextType === REACT_MEMO_TYPE) {\n            // TODO: if it was but can no longer be simple,\n            // we shouldn't set this.\n            needsCompareFamilies = true;\n          } else if ($$typeofNextType === REACT_LAZY_TYPE) {\n            needsCompareFamilies = true;\n          }\n\n          break;\n        }\n\n      default:\n        return false;\n    } // Check if both types have a family and it's the same one.\n\n\n    if (needsCompareFamilies) {\n      // Note: memo() and forwardRef() we'll compare outer rather than inner type.\n      // This means both of them need to be registered to preserve state.\n      // If we unwrapped and compared the inner types for wrappers instead,\n      // then we would risk falsely saying two separate memo(Foo)\n      // calls are equivalent because they wrap the same Foo function.\n      var prevFamily = resolveFamily(prevType);\n\n      if (prevFamily !== undefined && prevFamily === resolveFamily(nextType)) {\n        return true;\n      }\n    }\n\n    return false;\n  }\n}\nfunction markFailedErrorBoundaryForHotReloading(fiber) {\n  {\n    if (resolveFamily === null) {\n      // Hot reloading is disabled.\n      return;\n    }\n\n    if (typeof WeakSet !== 'function') {\n      return;\n    }\n\n    if (failedBoundaries === null) {\n      failedBoundaries = new WeakSet();\n    }\n\n    failedBoundaries.add(fiber);\n  }\n}\nvar scheduleRefresh = function (root, update) {\n  {\n    if (resolveFamily === null) {\n      // Hot reloading is disabled.\n      return;\n    }\n\n    var staleFamilies = update.staleFamilies,\n        updatedFamilies = update.updatedFamilies;\n    flushPassiveEffects();\n    flushSync(function () {\n      scheduleFibersWithFamiliesRecursively(root.current, updatedFamilies, staleFamilies);\n    });\n  }\n};\nvar scheduleRoot = function (root, element) {\n  {\n    if (root.context !== emptyContextObject) {\n      // Super edge case: root has a legacy _renderSubtree context\n      // but we don't know the parentComponent so we can't pass it.\n      // Just ignore. We'll delete this with _renderSubtree code path later.\n      return;\n    }\n\n    flushPassiveEffects();\n    flushSync(function () {\n      updateContainer(element, root, null, null);\n    });\n  }\n};\n\nfunction scheduleFibersWithFamiliesRecursively(fiber, updatedFamilies, staleFamilies) {\n  {\n    var alternate = fiber.alternate,\n        child = fiber.child,\n        sibling = fiber.sibling,\n        tag = fiber.tag,\n        type = fiber.type;\n    var candidateType = null;\n\n    switch (tag) {\n      case FunctionComponent:\n      case SimpleMemoComponent:\n      case ClassComponent:\n        candidateType = type;\n        break;\n\n      case ForwardRef:\n        candidateType = type.render;\n        break;\n    }\n\n    if (resolveFamily === null) {\n      throw new Error('Expected resolveFamily to be set during hot reload.');\n    }\n\n    var needsRender = false;\n    var needsRemount = false;\n\n    if (candidateType !== null) {\n      var family = resolveFamily(candidateType);\n\n      if (family !== undefined) {\n        if (staleFamilies.has(family)) {\n          needsRemount = true;\n        } else if (updatedFamilies.has(family)) {\n          if (tag === ClassComponent) {\n            needsRemount = true;\n          } else {\n            needsRender = true;\n          }\n        }\n      }\n    }\n\n    if (failedBoundaries !== null) {\n      if (failedBoundaries.has(fiber) || alternate !== null && failedBoundaries.has(alternate)) {\n        needsRemount = true;\n      }\n    }\n\n    if (needsRemount) {\n      fiber._debugNeedsRemount = true;\n    }\n\n    if (needsRemount || needsRender) {\n      var _root = enqueueConcurrentRenderForLane(fiber, SyncLane);\n\n      if (_root !== null) {\n        scheduleUpdateOnFiber(_root, fiber, SyncLane, NoTimestamp);\n      }\n    }\n\n    if (child !== null && !needsRemount) {\n      scheduleFibersWithFamiliesRecursively(child, updatedFamilies, staleFamilies);\n    }\n\n    if (sibling !== null) {\n      scheduleFibersWithFamiliesRecursively(sibling, updatedFamilies, staleFamilies);\n    }\n  }\n}\n\nvar findHostInstancesForRefresh = function (root, families) {\n  {\n    var hostInstances = new Set();\n    var types = new Set(families.map(function (family) {\n      return family.current;\n    }));\n    findHostInstancesForMatchingFibersRecursively(root.current, types, hostInstances);\n    return hostInstances;\n  }\n};\n\nfunction findHostInstancesForMatchingFibersRecursively(fiber, types, hostInstances) {\n  {\n    var child = fiber.child,\n        sibling = fiber.sibling,\n        tag = fiber.tag,\n        type = fiber.type;\n    var candidateType = null;\n\n    switch (tag) {\n      case FunctionComponent:\n      case SimpleMemoComponent:\n      case ClassComponent:\n        candidateType = type;\n        break;\n\n      case ForwardRef:\n        candidateType = type.render;\n        break;\n    }\n\n    var didMatch = false;\n\n    if (candidateType !== null) {\n      if (types.has(candidateType)) {\n        didMatch = true;\n      }\n    }\n\n    if (didMatch) {\n      // We have a match. This only drills down to the closest host components.\n      // There's no need to search deeper because for the purpose of giving\n      // visual feedback, \"flashing\" outermost parent rectangles is sufficient.\n      findHostInstancesForFiberShallowly(fiber, hostInstances);\n    } else {\n      // If there's no match, maybe there will be one further down in the child tree.\n      if (child !== null) {\n        findHostInstancesForMatchingFibersRecursively(child, types, hostInstances);\n      }\n    }\n\n    if (sibling !== null) {\n      findHostInstancesForMatchingFibersRecursively(sibling, types, hostInstances);\n    }\n  }\n}\n\nfunction findHostInstancesForFiberShallowly(fiber, hostInstances) {\n  {\n    var foundHostInstances = findChildHostInstancesForFiberShallowly(fiber, hostInstances);\n\n    if (foundHostInstances) {\n      return;\n    } // If we didn't find any host children, fallback to closest host parent.\n\n\n    var node = fiber;\n\n    while (true) {\n      switch (node.tag) {\n        case HostComponent:\n          hostInstances.add(node.stateNode);\n          return;\n\n        case HostPortal:\n          hostInstances.add(node.stateNode.containerInfo);\n          return;\n\n        case HostRoot:\n          hostInstances.add(node.stateNode.containerInfo);\n          return;\n      }\n\n      if (node.return === null) {\n        throw new Error('Expected to reach root first.');\n      }\n\n      node = node.return;\n    }\n  }\n}\n\nfunction findChildHostInstancesForFiberShallowly(fiber, hostInstances) {\n  {\n    var node = fiber;\n    var foundHostInstances = false;\n\n    while (true) {\n      if (node.tag === HostComponent) {\n        // We got a match.\n        foundHostInstances = true;\n        hostInstances.add(node.stateNode); // There may still be more, so keep searching.\n      } else if (node.child !== null) {\n        node.child.return = node;\n        node = node.child;\n        continue;\n      }\n\n      if (node === fiber) {\n        return foundHostInstances;\n      }\n\n      while (node.sibling === null) {\n        if (node.return === null || node.return === fiber) {\n          return foundHostInstances;\n        }\n\n        node = node.return;\n      }\n\n      node.sibling.return = node.return;\n      node = node.sibling;\n    }\n  }\n\n  return false;\n}\n\nvar hasBadMapPolyfill;\n\n{\n  hasBadMapPolyfill = false;\n\n  try {\n    var nonExtensibleObject = Object.preventExtensions({});\n    /* eslint-disable no-new */\n\n    new Map([[nonExtensibleObject, null]]);\n    new Set([nonExtensibleObject]);\n    /* eslint-enable no-new */\n  } catch (e) {\n    // TODO: Consider warning about bad polyfills\n    hasBadMapPolyfill = true;\n  }\n}\n\nfunction FiberNode(tag, pendingProps, key, mode) {\n  // Instance\n  this.tag = tag;\n  this.key = key;\n  this.elementType = null;\n  this.type = null;\n  this.stateNode = null; // Fiber\n\n  this.return = null;\n  this.child = null;\n  this.sibling = null;\n  this.index = 0;\n  this.ref = null;\n  this.pendingProps = pendingProps;\n  this.memoizedProps = null;\n  this.updateQueue = null;\n  this.memoizedState = null;\n  this.dependencies = null;\n  this.mode = mode; // Effects\n\n  this.flags = NoFlags;\n  this.subtreeFlags = NoFlags;\n  this.deletions = null;\n  this.lanes = NoLanes;\n  this.childLanes = NoLanes;\n  this.alternate = null;\n\n  {\n    // Note: The following is done to avoid a v8 performance cliff.\n    //\n    // Initializing the fields below to smis and later updating them with\n    // double values will cause Fibers to end up having separate shapes.\n    // This behavior/bug has something to do with Object.preventExtension().\n    // Fortunately this only impacts DEV builds.\n    // Unfortunately it makes React unusably slow for some applications.\n    // To work around this, initialize the fields below with doubles.\n    //\n    // Learn more about this here:\n    // https://github.com/facebook/react/issues/14365\n    // https://bugs.chromium.org/p/v8/issues/detail?id=8538\n    this.actualDuration = Number.NaN;\n    this.actualStartTime = Number.NaN;\n    this.selfBaseDuration = Number.NaN;\n    this.treeBaseDuration = Number.NaN; // It's okay to replace the initial doubles with smis after initialization.\n    // This won't trigger the performance cliff mentioned above,\n    // and it simplifies other profiler code (including DevTools).\n\n    this.actualDuration = 0;\n    this.actualStartTime = -1;\n    this.selfBaseDuration = 0;\n    this.treeBaseDuration = 0;\n  }\n\n  {\n    // This isn't directly used but is handy for debugging internals:\n    this._debugSource = null;\n    this._debugOwner = null;\n    this._debugNeedsRemount = false;\n    this._debugHookTypes = null;\n\n    if (!hasBadMapPolyfill && typeof Object.preventExtensions === 'function') {\n      Object.preventExtensions(this);\n    }\n  }\n} // This is a constructor function, rather than a POJO constructor, still\n// please ensure we do the following:\n// 1) Nobody should add any instance methods on this. Instance methods can be\n//    more difficult to predict when they get optimized and they are almost\n//    never inlined properly in static compilers.\n// 2) Nobody should rely on `instanceof Fiber` for type testing. We should\n//    always know when it is a fiber.\n// 3) We might want to experiment with using numeric keys since they are easier\n//    to optimize in a non-JIT environment.\n// 4) We can easily go from a constructor to a createFiber object literal if that\n//    is faster.\n// 5) It should be easy to port this to a C struct and keep a C implementation\n//    compatible.\n\n\nvar createFiber = function (tag, pendingProps, key, mode) {\n  // $FlowFixMe: the shapes are exact here but Flow doesn't like constructors\n  return new FiberNode(tag, pendingProps, key, mode);\n};\n\nfunction shouldConstruct$1(Component) {\n  var prototype = Component.prototype;\n  return !!(prototype && prototype.isReactComponent);\n}\n\nfunction isSimpleFunctionComponent(type) {\n  return typeof type === 'function' && !shouldConstruct$1(type) && type.defaultProps === undefined;\n}\nfunction resolveLazyComponentTag(Component) {\n  if (typeof Component === 'function') {\n    return shouldConstruct$1(Component) ? ClassComponent : FunctionComponent;\n  } else if (Component !== undefined && Component !== null) {\n    var $$typeof = Component.$$typeof;\n\n    if ($$typeof === REACT_FORWARD_REF_TYPE) {\n      return ForwardRef;\n    }\n\n    if ($$typeof === REACT_MEMO_TYPE) {\n      return MemoComponent;\n    }\n  }\n\n  return IndeterminateComponent;\n} // This is used to create an alternate fiber to do work on.\n\nfunction createWorkInProgress(current, pendingProps) {\n  var workInProgress = current.alternate;\n\n  if (workInProgress === null) {\n    // We use a double buffering pooling technique because we know that we'll\n    // only ever need at most two versions of a tree. We pool the \"other\" unused\n    // node that we're free to reuse. This is lazily created to avoid allocating\n    // extra objects for things that are never updated. It also allow us to\n    // reclaim the extra memory if needed.\n    workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);\n    workInProgress.elementType = current.elementType;\n    workInProgress.type = current.type;\n    workInProgress.stateNode = current.stateNode;\n\n    {\n      // DEV-only fields\n      workInProgress._debugSource = current._debugSource;\n      workInProgress._debugOwner = current._debugOwner;\n      workInProgress._debugHookTypes = current._debugHookTypes;\n    }\n\n    workInProgress.alternate = current;\n    current.alternate = workInProgress;\n  } else {\n    workInProgress.pendingProps = pendingProps; // Needed because Blocks store data on type.\n\n    workInProgress.type = current.type; // We already have an alternate.\n    // Reset the effect tag.\n\n    workInProgress.flags = NoFlags; // The effects are no longer valid.\n\n    workInProgress.subtreeFlags = NoFlags;\n    workInProgress.deletions = null;\n\n    {\n      // We intentionally reset, rather than copy, actualDuration & actualStartTime.\n      // This prevents time from endlessly accumulating in new commits.\n      // This has the downside of resetting values for different priority renders,\n      // But works for yielding (the common case) and should support resuming.\n      workInProgress.actualDuration = 0;\n      workInProgress.actualStartTime = -1;\n    }\n  } // Reset all effects except static ones.\n  // Static effects are not specific to a render.\n\n\n  workInProgress.flags = current.flags & StaticMask;\n  workInProgress.childLanes = current.childLanes;\n  workInProgress.lanes = current.lanes;\n  workInProgress.child = current.child;\n  workInProgress.memoizedProps = current.memoizedProps;\n  workInProgress.memoizedState = current.memoizedState;\n  workInProgress.updateQueue = current.updateQueue; // Clone the dependencies object. This is mutated during the render phase, so\n  // it cannot be shared with the current fiber.\n\n  var currentDependencies = current.dependencies;\n  workInProgress.dependencies = currentDependencies === null ? null : {\n    lanes: currentDependencies.lanes,\n    firstContext: currentDependencies.firstContext\n  }; // These will be overridden during the parent's reconciliation\n\n  workInProgress.sibling = current.sibling;\n  workInProgress.index = current.index;\n  workInProgress.ref = current.ref;\n\n  {\n    workInProgress.selfBaseDuration = current.selfBaseDuration;\n    workInProgress.treeBaseDuration = current.treeBaseDuration;\n  }\n\n  {\n    workInProgress._debugNeedsRemount = current._debugNeedsRemount;\n\n    switch (workInProgress.tag) {\n      case IndeterminateComponent:\n      case FunctionComponent:\n      case SimpleMemoComponent:\n        workInProgress.type = resolveFunctionForHotReloading(current.type);\n        break;\n\n      case ClassComponent:\n        workInProgress.type = resolveClassForHotReloading(current.type);\n        break;\n\n      case ForwardRef:\n        workInProgress.type = resolveForwardRefForHotReloading(current.type);\n        break;\n    }\n  }\n\n  return workInProgress;\n} // Used to reuse a Fiber for a second pass.\n\nfunction resetWorkInProgress(workInProgress, renderLanes) {\n  // This resets the Fiber to what createFiber or createWorkInProgress would\n  // have set the values to before during the first pass. Ideally this wouldn't\n  // be necessary but unfortunately many code paths reads from the workInProgress\n  // when they should be reading from current and writing to workInProgress.\n  // We assume pendingProps, index, key, ref, return are still untouched to\n  // avoid doing another reconciliation.\n  // Reset the effect flags but keep any Placement tags, since that's something\n  // that child fiber is setting, not the reconciliation.\n  workInProgress.flags &= StaticMask | Placement; // The effects are no longer valid.\n\n  var current = workInProgress.alternate;\n\n  if (current === null) {\n    // Reset to createFiber's initial values.\n    workInProgress.childLanes = NoLanes;\n    workInProgress.lanes = renderLanes;\n    workInProgress.child = null;\n    workInProgress.subtreeFlags = NoFlags;\n    workInProgress.memoizedProps = null;\n    workInProgress.memoizedState = null;\n    workInProgress.updateQueue = null;\n    workInProgress.dependencies = null;\n    workInProgress.stateNode = null;\n\n    {\n      // Note: We don't reset the actualTime counts. It's useful to accumulate\n      // actual time across multiple render passes.\n      workInProgress.selfBaseDuration = 0;\n      workInProgress.treeBaseDuration = 0;\n    }\n  } else {\n    // Reset to the cloned values that createWorkInProgress would've.\n    workInProgress.childLanes = current.childLanes;\n    workInProgress.lanes = current.lanes;\n    workInProgress.child = current.child;\n    workInProgress.subtreeFlags = NoFlags;\n    workInProgress.deletions = null;\n    workInProgress.memoizedProps = current.memoizedProps;\n    workInProgress.memoizedState = current.memoizedState;\n    workInProgress.updateQueue = current.updateQueue; // Needed because Blocks store data on type.\n\n    workInProgress.type = current.type; // Clone the dependencies object. This is mutated during the render phase, so\n    // it cannot be shared with the current fiber.\n\n    var currentDependencies = current.dependencies;\n    workInProgress.dependencies = currentDependencies === null ? null : {\n      lanes: currentDependencies.lanes,\n      firstContext: currentDependencies.firstContext\n    };\n\n    {\n      // Note: We don't reset the actualTime counts. It's useful to accumulate\n      // actual time across multiple render passes.\n      workInProgress.selfBaseDuration = current.selfBaseDuration;\n      workInProgress.treeBaseDuration = current.treeBaseDuration;\n    }\n  }\n\n  return workInProgress;\n}\nfunction createHostRootFiber(tag, isStrictMode, concurrentUpdatesByDefaultOverride) {\n  var mode;\n\n  if (tag === ConcurrentRoot) {\n    mode = ConcurrentMode;\n\n    if (isStrictMode === true) {\n      mode |= StrictLegacyMode;\n\n      {\n        mode |= StrictEffectsMode;\n      }\n    }\n  } else {\n    mode = NoMode;\n  }\n\n  if ( isDevToolsPresent) {\n    // Always collect profile timings when DevTools are present.\n    // This enables DevTools to start capturing timing at any point–\n    // Without some nodes in the tree having empty base times.\n    mode |= ProfileMode;\n  }\n\n  return createFiber(HostRoot, null, null, mode);\n}\nfunction createFiberFromTypeAndProps(type, // React$ElementType\nkey, pendingProps, owner, mode, lanes) {\n  var fiberTag = IndeterminateComponent; // The resolved type is set if we know what the final type will be. I.e. it's not lazy.\n\n  var resolvedType = type;\n\n  if (typeof type === 'function') {\n    if (shouldConstruct$1(type)) {\n      fiberTag = ClassComponent;\n\n      {\n        resolvedType = resolveClassForHotReloading(resolvedType);\n      }\n    } else {\n      {\n        resolvedType = resolveFunctionForHotReloading(resolvedType);\n      }\n    }\n  } else if (typeof type === 'string') {\n    fiberTag = HostComponent;\n  } else {\n    getTag: switch (type) {\n      case REACT_FRAGMENT_TYPE:\n        return createFiberFromFragment(pendingProps.children, mode, lanes, key);\n\n      case REACT_STRICT_MODE_TYPE:\n        fiberTag = Mode;\n        mode |= StrictLegacyMode;\n\n        if ( (mode & ConcurrentMode) !== NoMode) {\n          // Strict effects should never run on legacy roots\n          mode |= StrictEffectsMode;\n        }\n\n        break;\n\n      case REACT_PROFILER_TYPE:\n        return createFiberFromProfiler(pendingProps, mode, lanes, key);\n\n      case REACT_SUSPENSE_TYPE:\n        return createFiberFromSuspense(pendingProps, mode, lanes, key);\n\n      case REACT_SUSPENSE_LIST_TYPE:\n        return createFiberFromSuspenseList(pendingProps, mode, lanes, key);\n\n      case REACT_OFFSCREEN_TYPE:\n        return createFiberFromOffscreen(pendingProps, mode, lanes, key);\n\n      case REACT_LEGACY_HIDDEN_TYPE:\n\n      // eslint-disable-next-line no-fallthrough\n\n      case REACT_SCOPE_TYPE:\n\n      // eslint-disable-next-line no-fallthrough\n\n      case REACT_CACHE_TYPE:\n\n      // eslint-disable-next-line no-fallthrough\n\n      case REACT_TRACING_MARKER_TYPE:\n\n      // eslint-disable-next-line no-fallthrough\n\n      case REACT_DEBUG_TRACING_MODE_TYPE:\n\n      // eslint-disable-next-line no-fallthrough\n\n      default:\n        {\n          if (typeof type === 'object' && type !== null) {\n            switch (type.$$typeof) {\n              case REACT_PROVIDER_TYPE:\n                fiberTag = ContextProvider;\n                break getTag;\n\n              case REACT_CONTEXT_TYPE:\n                // This is a consumer\n                fiberTag = ContextConsumer;\n                break getTag;\n\n              case REACT_FORWARD_REF_TYPE:\n                fiberTag = ForwardRef;\n\n                {\n                  resolvedType = resolveForwardRefForHotReloading(resolvedType);\n                }\n\n                break getTag;\n\n              case REACT_MEMO_TYPE:\n                fiberTag = MemoComponent;\n                break getTag;\n\n              case REACT_LAZY_TYPE:\n                fiberTag = LazyComponent;\n                resolvedType = null;\n                break getTag;\n            }\n          }\n\n          var info = '';\n\n          {\n            if (type === undefined || typeof type === 'object' && type !== null && Object.keys(type).length === 0) {\n              info += ' You likely forgot to export your component from the file ' + \"it's defined in, or you might have mixed up default and \" + 'named imports.';\n            }\n\n            var ownerName = owner ? getComponentNameFromFiber(owner) : null;\n\n            if (ownerName) {\n              info += '\\n\\nCheck the render method of `' + ownerName + '`.';\n            }\n          }\n\n          throw new Error('Element type is invalid: expected a string (for built-in ' + 'components) or a class/function (for composite components) ' + (\"but got: \" + (type == null ? type : typeof type) + \".\" + info));\n        }\n    }\n  }\n\n  var fiber = createFiber(fiberTag, pendingProps, key, mode);\n  fiber.elementType = type;\n  fiber.type = resolvedType;\n  fiber.lanes = lanes;\n\n  {\n    fiber._debugOwner = owner;\n  }\n\n  return fiber;\n}\nfunction createFiberFromElement(element, mode, lanes) {\n  var owner = null;\n\n  {\n    owner = element._owner;\n  }\n\n  var type = element.type;\n  var key = element.key;\n  var pendingProps = element.props;\n  var fiber = createFiberFromTypeAndProps(type, key, pendingProps, owner, mode, lanes);\n\n  {\n    fiber._debugSource = element._source;\n    fiber._debugOwner = element._owner;\n  }\n\n  return fiber;\n}\nfunction createFiberFromFragment(elements, mode, lanes, key) {\n  var fiber = createFiber(Fragment, elements, key, mode);\n  fiber.lanes = lanes;\n  return fiber;\n}\n\nfunction createFiberFromProfiler(pendingProps, mode, lanes, key) {\n  {\n    if (typeof pendingProps.id !== 'string') {\n      error('Profiler must specify an \"id\" of type `string` as a prop. Received the type `%s` instead.', typeof pendingProps.id);\n    }\n  }\n\n  var fiber = createFiber(Profiler, pendingProps, key, mode | ProfileMode);\n  fiber.elementType = REACT_PROFILER_TYPE;\n  fiber.lanes = lanes;\n\n  {\n    fiber.stateNode = {\n      effectDuration: 0,\n      passiveEffectDuration: 0\n    };\n  }\n\n  return fiber;\n}\n\nfunction createFiberFromSuspense(pendingProps, mode, lanes, key) {\n  var fiber = createFiber(SuspenseComponent, pendingProps, key, mode);\n  fiber.elementType = REACT_SUSPENSE_TYPE;\n  fiber.lanes = lanes;\n  return fiber;\n}\nfunction createFiberFromSuspenseList(pendingProps, mode, lanes, key) {\n  var fiber = createFiber(SuspenseListComponent, pendingProps, key, mode);\n  fiber.elementType = REACT_SUSPENSE_LIST_TYPE;\n  fiber.lanes = lanes;\n  return fiber;\n}\nfunction createFiberFromOffscreen(pendingProps, mode, lanes, key) {\n  var fiber = createFiber(OffscreenComponent, pendingProps, key, mode);\n  fiber.elementType = REACT_OFFSCREEN_TYPE;\n  fiber.lanes = lanes;\n  var primaryChildInstance = {\n    isHidden: false\n  };\n  fiber.stateNode = primaryChildInstance;\n  return fiber;\n}\nfunction createFiberFromText(content, mode, lanes) {\n  var fiber = createFiber(HostText, content, null, mode);\n  fiber.lanes = lanes;\n  return fiber;\n}\nfunction createFiberFromHostInstanceForDeletion() {\n  var fiber = createFiber(HostComponent, null, null, NoMode);\n  fiber.elementType = 'DELETED';\n  return fiber;\n}\nfunction createFiberFromDehydratedFragment(dehydratedNode) {\n  var fiber = createFiber(DehydratedFragment, null, null, NoMode);\n  fiber.stateNode = dehydratedNode;\n  return fiber;\n}\nfunction createFiberFromPortal(portal, mode, lanes) {\n  var pendingProps = portal.children !== null ? portal.children : [];\n  var fiber = createFiber(HostPortal, pendingProps, portal.key, mode);\n  fiber.lanes = lanes;\n  fiber.stateNode = {\n    containerInfo: portal.containerInfo,\n    pendingChildren: null,\n    // Used by persistent updates\n    implementation: portal.implementation\n  };\n  return fiber;\n} // Used for stashing WIP properties to replay failed work in DEV.\n\nfunction assignFiberPropertiesInDEV(target, source) {\n  if (target === null) {\n    // This Fiber's initial properties will always be overwritten.\n    // We only use a Fiber to ensure the same hidden class so DEV isn't slow.\n    target = createFiber(IndeterminateComponent, null, null, NoMode);\n  } // This is intentionally written as a list of all properties.\n  // We tried to use Object.assign() instead but this is called in\n  // the hottest path, and Object.assign() was too slow:\n  // https://github.com/facebook/react/issues/12502\n  // This code is DEV-only so size is not a concern.\n\n\n  target.tag = source.tag;\n  target.key = source.key;\n  target.elementType = source.elementType;\n  target.type = source.type;\n  target.stateNode = source.stateNode;\n  target.return = source.return;\n  target.child = source.child;\n  target.sibling = source.sibling;\n  target.index = source.index;\n  target.ref = source.ref;\n  target.pendingProps = source.pendingProps;\n  target.memoizedProps = source.memoizedProps;\n  target.updateQueue = source.updateQueue;\n  target.memoizedState = source.memoizedState;\n  target.dependencies = source.dependencies;\n  target.mode = source.mode;\n  target.flags = source.flags;\n  target.subtreeFlags = source.subtreeFlags;\n  target.deletions = source.deletions;\n  target.lanes = source.lanes;\n  target.childLanes = source.childLanes;\n  target.alternate = source.alternate;\n\n  {\n    target.actualDuration = source.actualDuration;\n    target.actualStartTime = source.actualStartTime;\n    target.selfBaseDuration = source.selfBaseDuration;\n    target.treeBaseDuration = source.treeBaseDuration;\n  }\n\n  target._debugSource = source._debugSource;\n  target._debugOwner = source._debugOwner;\n  target._debugNeedsRemount = source._debugNeedsRemount;\n  target._debugHookTypes = source._debugHookTypes;\n  return target;\n}\n\nfunction FiberRootNode(containerInfo, tag, hydrate, identifierPrefix, onRecoverableError) {\n  this.tag = tag;\n  this.containerInfo = containerInfo;\n  this.pendingChildren = null;\n  this.current = null;\n  this.pingCache = null;\n  this.finishedWork = null;\n  this.timeoutHandle = noTimeout;\n  this.context = null;\n  this.pendingContext = null;\n  this.callbackNode = null;\n  this.callbackPriority = NoLane;\n  this.eventTimes = createLaneMap(NoLanes);\n  this.expirationTimes = createLaneMap(NoTimestamp);\n  this.pendingLanes = NoLanes;\n  this.suspendedLanes = NoLanes;\n  this.pingedLanes = NoLanes;\n  this.expiredLanes = NoLanes;\n  this.mutableReadLanes = NoLanes;\n  this.finishedLanes = NoLanes;\n  this.entangledLanes = NoLanes;\n  this.entanglements = createLaneMap(NoLanes);\n  this.identifierPrefix = identifierPrefix;\n  this.onRecoverableError = onRecoverableError;\n\n  {\n    this.mutableSourceEagerHydrationData = null;\n  }\n\n  {\n    this.effectDuration = 0;\n    this.passiveEffectDuration = 0;\n  }\n\n  {\n    this.memoizedUpdaters = new Set();\n    var pendingUpdatersLaneMap = this.pendingUpdatersLaneMap = [];\n\n    for (var _i = 0; _i < TotalLanes; _i++) {\n      pendingUpdatersLaneMap.push(new Set());\n    }\n  }\n\n  {\n    switch (tag) {\n      case ConcurrentRoot:\n        this._debugRootType = hydrate ? 'hydrateRoot()' : 'createRoot()';\n        break;\n\n      case LegacyRoot:\n        this._debugRootType = hydrate ? 'hydrate()' : 'render()';\n        break;\n    }\n  }\n}\n\nfunction createFiberRoot(containerInfo, tag, hydrate, initialChildren, hydrationCallbacks, isStrictMode, concurrentUpdatesByDefaultOverride, // TODO: We have several of these arguments that are conceptually part of the\n// host config, but because they are passed in at runtime, we have to thread\n// them through the root constructor. Perhaps we should put them all into a\n// single type, like a DynamicHostConfig that is defined by the renderer.\nidentifierPrefix, onRecoverableError, transitionCallbacks) {\n  var root = new FiberRootNode(containerInfo, tag, hydrate, identifierPrefix, onRecoverableError);\n  // stateNode is any.\n\n\n  var uninitializedFiber = createHostRootFiber(tag, isStrictMode);\n  root.current = uninitializedFiber;\n  uninitializedFiber.stateNode = root;\n\n  {\n    var _initialState = {\n      element: initialChildren,\n      isDehydrated: hydrate,\n      cache: null,\n      // not enabled yet\n      transitions: null,\n      pendingSuspenseBoundaries: null\n    };\n    uninitializedFiber.memoizedState = _initialState;\n  }\n\n  initializeUpdateQueue(uninitializedFiber);\n  return root;\n}\n\nvar ReactVersion = '18.2.0';\n\nfunction createPortal(children, containerInfo, // TODO: figure out the API for cross-renderer implementation.\nimplementation) {\n  var key = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : null;\n\n  {\n    checkKeyStringCoercion(key);\n  }\n\n  return {\n    // This tag allow us to uniquely identify this as a React Portal\n    $$typeof: REACT_PORTAL_TYPE,\n    key: key == null ? null : '' + key,\n    children: children,\n    containerInfo: containerInfo,\n    implementation: implementation\n  };\n}\n\nvar didWarnAboutNestedUpdates;\nvar didWarnAboutFindNodeInStrictMode;\n\n{\n  didWarnAboutNestedUpdates = false;\n  didWarnAboutFindNodeInStrictMode = {};\n}\n\nfunction getContextForSubtree(parentComponent) {\n  if (!parentComponent) {\n    return emptyContextObject;\n  }\n\n  var fiber = get(parentComponent);\n  var parentContext = findCurrentUnmaskedContext(fiber);\n\n  if (fiber.tag === ClassComponent) {\n    var Component = fiber.type;\n\n    if (isContextProvider(Component)) {\n      return processChildContext(fiber, Component, parentContext);\n    }\n  }\n\n  return parentContext;\n}\n\nfunction findHostInstanceWithWarning(component, methodName) {\n  {\n    var fiber = get(component);\n\n    if (fiber === undefined) {\n      if (typeof component.render === 'function') {\n        throw new Error('Unable to find node on an unmounted component.');\n      } else {\n        var keys = Object.keys(component).join(',');\n        throw new Error(\"Argument appears to not be a ReactComponent. Keys: \" + keys);\n      }\n    }\n\n    var hostFiber = findCurrentHostFiber(fiber);\n\n    if (hostFiber === null) {\n      return null;\n    }\n\n    if (hostFiber.mode & StrictLegacyMode) {\n      var componentName = getComponentNameFromFiber(fiber) || 'Component';\n\n      if (!didWarnAboutFindNodeInStrictMode[componentName]) {\n        didWarnAboutFindNodeInStrictMode[componentName] = true;\n        var previousFiber = current;\n\n        try {\n          setCurrentFiber(hostFiber);\n\n          if (fiber.mode & StrictLegacyMode) {\n            error('%s is deprecated in StrictMode. ' + '%s was passed an instance of %s which is inside StrictMode. ' + 'Instead, add a ref directly to the element you want to reference. ' + 'Learn more about using refs safely here: ' + 'https://reactjs.org/link/strict-mode-find-node', methodName, methodName, componentName);\n          } else {\n            error('%s is deprecated in StrictMode. ' + '%s was passed an instance of %s which renders StrictMode children. ' + 'Instead, add a ref directly to the element you want to reference. ' + 'Learn more about using refs safely here: ' + 'https://reactjs.org/link/strict-mode-find-node', methodName, methodName, componentName);\n          }\n        } finally {\n          // Ideally this should reset to previous but this shouldn't be called in\n          // render and there's another warning for that anyway.\n          if (previousFiber) {\n            setCurrentFiber(previousFiber);\n          } else {\n            resetCurrentFiber();\n          }\n        }\n      }\n    }\n\n    return hostFiber.stateNode;\n  }\n}\n\nfunction createContainer(containerInfo, tag, hydrationCallbacks, isStrictMode, concurrentUpdatesByDefaultOverride, identifierPrefix, onRecoverableError, transitionCallbacks) {\n  var hydrate = false;\n  var initialChildren = null;\n  return createFiberRoot(containerInfo, tag, hydrate, initialChildren, hydrationCallbacks, isStrictMode, concurrentUpdatesByDefaultOverride, identifierPrefix, onRecoverableError);\n}\nfunction createHydrationContainer(initialChildren, // TODO: Remove `callback` when we delete legacy mode.\ncallback, containerInfo, tag, hydrationCallbacks, isStrictMode, concurrentUpdatesByDefaultOverride, identifierPrefix, onRecoverableError, transitionCallbacks) {\n  var hydrate = true;\n  var root = createFiberRoot(containerInfo, tag, hydrate, initialChildren, hydrationCallbacks, isStrictMode, concurrentUpdatesByDefaultOverride, identifierPrefix, onRecoverableError); // TODO: Move this to FiberRoot constructor\n\n  root.context = getContextForSubtree(null); // Schedule the initial render. In a hydration root, this is different from\n  // a regular update because the initial render must match was was rendered\n  // on the server.\n  // NOTE: This update intentionally doesn't have a payload. We're only using\n  // the update to schedule work on the root fiber (and, for legacy roots, to\n  // enqueue the callback if one is provided).\n\n  var current = root.current;\n  var eventTime = requestEventTime();\n  var lane = requestUpdateLane(current);\n  var update = createUpdate(eventTime, lane);\n  update.callback = callback !== undefined && callback !== null ? callback : null;\n  enqueueUpdate(current, update, lane);\n  scheduleInitialHydrationOnRoot(root, lane, eventTime);\n  return root;\n}\nfunction updateContainer(element, container, parentComponent, callback) {\n  {\n    onScheduleRoot(container, element);\n  }\n\n  var current$1 = container.current;\n  var eventTime = requestEventTime();\n  var lane = requestUpdateLane(current$1);\n\n  {\n    markRenderScheduled(lane);\n  }\n\n  var context = getContextForSubtree(parentComponent);\n\n  if (container.context === null) {\n    container.context = context;\n  } else {\n    container.pendingContext = context;\n  }\n\n  {\n    if (isRendering && current !== null && !didWarnAboutNestedUpdates) {\n      didWarnAboutNestedUpdates = true;\n\n      error('Render methods should be a pure function of props and state; ' + 'triggering nested component updates from render is not allowed. ' + 'If necessary, trigger nested updates in componentDidUpdate.\\n\\n' + 'Check the render method of %s.', getComponentNameFromFiber(current) || 'Unknown');\n    }\n  }\n\n  var update = createUpdate(eventTime, lane); // Caution: React DevTools currently depends on this property\n  // being called \"element\".\n\n  update.payload = {\n    element: element\n  };\n  callback = callback === undefined ? null : callback;\n\n  if (callback !== null) {\n    {\n      if (typeof callback !== 'function') {\n        error('render(...): Expected the last optional `callback` argument to be a ' + 'function. Instead received: %s.', callback);\n      }\n    }\n\n    update.callback = callback;\n  }\n\n  var root = enqueueUpdate(current$1, update, lane);\n\n  if (root !== null) {\n    scheduleUpdateOnFiber(root, current$1, lane, eventTime);\n    entangleTransitions(root, current$1, lane);\n  }\n\n  return lane;\n}\nfunction getPublicRootInstance(container) {\n  var containerFiber = container.current;\n\n  if (!containerFiber.child) {\n    return null;\n  }\n\n  switch (containerFiber.child.tag) {\n    case HostComponent:\n      return getPublicInstance(containerFiber.child.stateNode);\n\n    default:\n      return containerFiber.child.stateNode;\n  }\n}\nfunction attemptSynchronousHydration$1(fiber) {\n  switch (fiber.tag) {\n    case HostRoot:\n      {\n        var root = fiber.stateNode;\n\n        if (isRootDehydrated(root)) {\n          // Flush the first scheduled \"update\".\n          var lanes = getHighestPriorityPendingLanes(root);\n          flushRoot(root, lanes);\n        }\n\n        break;\n      }\n\n    case SuspenseComponent:\n      {\n        flushSync(function () {\n          var root = enqueueConcurrentRenderForLane(fiber, SyncLane);\n\n          if (root !== null) {\n            var eventTime = requestEventTime();\n            scheduleUpdateOnFiber(root, fiber, SyncLane, eventTime);\n          }\n        }); // If we're still blocked after this, we need to increase\n        // the priority of any promises resolving within this\n        // boundary so that they next attempt also has higher pri.\n\n        var retryLane = SyncLane;\n        markRetryLaneIfNotHydrated(fiber, retryLane);\n        break;\n      }\n  }\n}\n\nfunction markRetryLaneImpl(fiber, retryLane) {\n  var suspenseState = fiber.memoizedState;\n\n  if (suspenseState !== null && suspenseState.dehydrated !== null) {\n    suspenseState.retryLane = higherPriorityLane(suspenseState.retryLane, retryLane);\n  }\n} // Increases the priority of thenables when they resolve within this boundary.\n\n\nfunction markRetryLaneIfNotHydrated(fiber, retryLane) {\n  markRetryLaneImpl(fiber, retryLane);\n  var alternate = fiber.alternate;\n\n  if (alternate) {\n    markRetryLaneImpl(alternate, retryLane);\n  }\n}\nfunction attemptContinuousHydration$1(fiber) {\n  if (fiber.tag !== SuspenseComponent) {\n    // We ignore HostRoots here because we can't increase\n    // their priority and they should not suspend on I/O,\n    // since you have to wrap anything that might suspend in\n    // Suspense.\n    return;\n  }\n\n  var lane = SelectiveHydrationLane;\n  var root = enqueueConcurrentRenderForLane(fiber, lane);\n\n  if (root !== null) {\n    var eventTime = requestEventTime();\n    scheduleUpdateOnFiber(root, fiber, lane, eventTime);\n  }\n\n  markRetryLaneIfNotHydrated(fiber, lane);\n}\nfunction attemptHydrationAtCurrentPriority$1(fiber) {\n  if (fiber.tag !== SuspenseComponent) {\n    // We ignore HostRoots here because we can't increase\n    // their priority other than synchronously flush it.\n    return;\n  }\n\n  var lane = requestUpdateLane(fiber);\n  var root = enqueueConcurrentRenderForLane(fiber, lane);\n\n  if (root !== null) {\n    var eventTime = requestEventTime();\n    scheduleUpdateOnFiber(root, fiber, lane, eventTime);\n  }\n\n  markRetryLaneIfNotHydrated(fiber, lane);\n}\nfunction findHostInstanceWithNoPortals(fiber) {\n  var hostFiber = findCurrentHostFiberWithNoPortals(fiber);\n\n  if (hostFiber === null) {\n    return null;\n  }\n\n  return hostFiber.stateNode;\n}\n\nvar shouldErrorImpl = function (fiber) {\n  return null;\n};\n\nfunction shouldError(fiber) {\n  return shouldErrorImpl(fiber);\n}\n\nvar shouldSuspendImpl = function (fiber) {\n  return false;\n};\n\nfunction shouldSuspend(fiber) {\n  return shouldSuspendImpl(fiber);\n}\nvar overrideHookState = null;\nvar overrideHookStateDeletePath = null;\nvar overrideHookStateRenamePath = null;\nvar overrideProps = null;\nvar overridePropsDeletePath = null;\nvar overridePropsRenamePath = null;\nvar scheduleUpdate = null;\nvar setErrorHandler = null;\nvar setSuspenseHandler = null;\n\n{\n  var copyWithDeleteImpl = function (obj, path, index) {\n    var key = path[index];\n    var updated = isArray(obj) ? obj.slice() : assign({}, obj);\n\n    if (index + 1 === path.length) {\n      if (isArray(updated)) {\n        updated.splice(key, 1);\n      } else {\n        delete updated[key];\n      }\n\n      return updated;\n    } // $FlowFixMe number or string is fine here\n\n\n    updated[key] = copyWithDeleteImpl(obj[key], path, index + 1);\n    return updated;\n  };\n\n  var copyWithDelete = function (obj, path) {\n    return copyWithDeleteImpl(obj, path, 0);\n  };\n\n  var copyWithRenameImpl = function (obj, oldPath, newPath, index) {\n    var oldKey = oldPath[index];\n    var updated = isArray(obj) ? obj.slice() : assign({}, obj);\n\n    if (index + 1 === oldPath.length) {\n      var newKey = newPath[index]; // $FlowFixMe number or string is fine here\n\n      updated[newKey] = updated[oldKey];\n\n      if (isArray(updated)) {\n        updated.splice(oldKey, 1);\n      } else {\n        delete updated[oldKey];\n      }\n    } else {\n      // $FlowFixMe number or string is fine here\n      updated[oldKey] = copyWithRenameImpl( // $FlowFixMe number or string is fine here\n      obj[oldKey], oldPath, newPath, index + 1);\n    }\n\n    return updated;\n  };\n\n  var copyWithRename = function (obj, oldPath, newPath) {\n    if (oldPath.length !== newPath.length) {\n      warn('copyWithRename() expects paths of the same length');\n\n      return;\n    } else {\n      for (var i = 0; i < newPath.length - 1; i++) {\n        if (oldPath[i] !== newPath[i]) {\n          warn('copyWithRename() expects paths to be the same except for the deepest key');\n\n          return;\n        }\n      }\n    }\n\n    return copyWithRenameImpl(obj, oldPath, newPath, 0);\n  };\n\n  var copyWithSetImpl = function (obj, path, index, value) {\n    if (index >= path.length) {\n      return value;\n    }\n\n    var key = path[index];\n    var updated = isArray(obj) ? obj.slice() : assign({}, obj); // $FlowFixMe number or string is fine here\n\n    updated[key] = copyWithSetImpl(obj[key], path, index + 1, value);\n    return updated;\n  };\n\n  var copyWithSet = function (obj, path, value) {\n    return copyWithSetImpl(obj, path, 0, value);\n  };\n\n  var findHook = function (fiber, id) {\n    // For now, the \"id\" of stateful hooks is just the stateful hook index.\n    // This may change in the future with e.g. nested hooks.\n    var currentHook = fiber.memoizedState;\n\n    while (currentHook !== null && id > 0) {\n      currentHook = currentHook.next;\n      id--;\n    }\n\n    return currentHook;\n  }; // Support DevTools editable values for useState and useReducer.\n\n\n  overrideHookState = function (fiber, id, path, value) {\n    var hook = findHook(fiber, id);\n\n    if (hook !== null) {\n      var newState = copyWithSet(hook.memoizedState, path, value);\n      hook.memoizedState = newState;\n      hook.baseState = newState; // We aren't actually adding an update to the queue,\n      // because there is no update we can add for useReducer hooks that won't trigger an error.\n      // (There's no appropriate action type for DevTools overrides.)\n      // As a result though, React will see the scheduled update as a noop and bailout.\n      // Shallow cloning props works as a workaround for now to bypass the bailout check.\n\n      fiber.memoizedProps = assign({}, fiber.memoizedProps);\n      var root = enqueueConcurrentRenderForLane(fiber, SyncLane);\n\n      if (root !== null) {\n        scheduleUpdateOnFiber(root, fiber, SyncLane, NoTimestamp);\n      }\n    }\n  };\n\n  overrideHookStateDeletePath = function (fiber, id, path) {\n    var hook = findHook(fiber, id);\n\n    if (hook !== null) {\n      var newState = copyWithDelete(hook.memoizedState, path);\n      hook.memoizedState = newState;\n      hook.baseState = newState; // We aren't actually adding an update to the queue,\n      // because there is no update we can add for useReducer hooks that won't trigger an error.\n      // (There's no appropriate action type for DevTools overrides.)\n      // As a result though, React will see the scheduled update as a noop and bailout.\n      // Shallow cloning props works as a workaround for now to bypass the bailout check.\n\n      fiber.memoizedProps = assign({}, fiber.memoizedProps);\n      var root = enqueueConcurrentRenderForLane(fiber, SyncLane);\n\n      if (root !== null) {\n        scheduleUpdateOnFiber(root, fiber, SyncLane, NoTimestamp);\n      }\n    }\n  };\n\n  overrideHookStateRenamePath = function (fiber, id, oldPath, newPath) {\n    var hook = findHook(fiber, id);\n\n    if (hook !== null) {\n      var newState = copyWithRename(hook.memoizedState, oldPath, newPath);\n      hook.memoizedState = newState;\n      hook.baseState = newState; // We aren't actually adding an update to the queue,\n      // because there is no update we can add for useReducer hooks that won't trigger an error.\n      // (There's no appropriate action type for DevTools overrides.)\n      // As a result though, React will see the scheduled update as a noop and bailout.\n      // Shallow cloning props works as a workaround for now to bypass the bailout check.\n\n      fiber.memoizedProps = assign({}, fiber.memoizedProps);\n      var root = enqueueConcurrentRenderForLane(fiber, SyncLane);\n\n      if (root !== null) {\n        scheduleUpdateOnFiber(root, fiber, SyncLane, NoTimestamp);\n      }\n    }\n  }; // Support DevTools props for function components, forwardRef, memo, host components, etc.\n\n\n  overrideProps = function (fiber, path, value) {\n    fiber.pendingProps = copyWithSet(fiber.memoizedProps, path, value);\n\n    if (fiber.alternate) {\n      fiber.alternate.pendingProps = fiber.pendingProps;\n    }\n\n    var root = enqueueConcurrentRenderForLane(fiber, SyncLane);\n\n    if (root !== null) {\n      scheduleUpdateOnFiber(root, fiber, SyncLane, NoTimestamp);\n    }\n  };\n\n  overridePropsDeletePath = function (fiber, path) {\n    fiber.pendingProps = copyWithDelete(fiber.memoizedProps, path);\n\n    if (fiber.alternate) {\n      fiber.alternate.pendingProps = fiber.pendingProps;\n    }\n\n    var root = enqueueConcurrentRenderForLane(fiber, SyncLane);\n\n    if (root !== null) {\n      scheduleUpdateOnFiber(root, fiber, SyncLane, NoTimestamp);\n    }\n  };\n\n  overridePropsRenamePath = function (fiber, oldPath, newPath) {\n    fiber.pendingProps = copyWithRename(fiber.memoizedProps, oldPath, newPath);\n\n    if (fiber.alternate) {\n      fiber.alternate.pendingProps = fiber.pendingProps;\n    }\n\n    var root = enqueueConcurrentRenderForLane(fiber, SyncLane);\n\n    if (root !== null) {\n      scheduleUpdateOnFiber(root, fiber, SyncLane, NoTimestamp);\n    }\n  };\n\n  scheduleUpdate = function (fiber) {\n    var root = enqueueConcurrentRenderForLane(fiber, SyncLane);\n\n    if (root !== null) {\n      scheduleUpdateOnFiber(root, fiber, SyncLane, NoTimestamp);\n    }\n  };\n\n  setErrorHandler = function (newShouldErrorImpl) {\n    shouldErrorImpl = newShouldErrorImpl;\n  };\n\n  setSuspenseHandler = function (newShouldSuspendImpl) {\n    shouldSuspendImpl = newShouldSuspendImpl;\n  };\n}\n\nfunction findHostInstanceByFiber(fiber) {\n  var hostFiber = findCurrentHostFiber(fiber);\n\n  if (hostFiber === null) {\n    return null;\n  }\n\n  return hostFiber.stateNode;\n}\n\nfunction emptyFindFiberByHostInstance(instance) {\n  return null;\n}\n\nfunction getCurrentFiberForDevTools() {\n  return current;\n}\n\nfunction injectIntoDevTools(devToolsConfig) {\n  var findFiberByHostInstance = devToolsConfig.findFiberByHostInstance;\n  var ReactCurrentDispatcher = ReactSharedInternals.ReactCurrentDispatcher;\n  return injectInternals({\n    bundleType: devToolsConfig.bundleType,\n    version: devToolsConfig.version,\n    rendererPackageName: devToolsConfig.rendererPackageName,\n    rendererConfig: devToolsConfig.rendererConfig,\n    overrideHookState: overrideHookState,\n    overrideHookStateDeletePath: overrideHookStateDeletePath,\n    overrideHookStateRenamePath: overrideHookStateRenamePath,\n    overrideProps: overrideProps,\n    overridePropsDeletePath: overridePropsDeletePath,\n    overridePropsRenamePath: overridePropsRenamePath,\n    setErrorHandler: setErrorHandler,\n    setSuspenseHandler: setSuspenseHandler,\n    scheduleUpdate: scheduleUpdate,\n    currentDispatcherRef: ReactCurrentDispatcher,\n    findHostInstanceByFiber: findHostInstanceByFiber,\n    findFiberByHostInstance: findFiberByHostInstance || emptyFindFiberByHostInstance,\n    // React Refresh\n    findHostInstancesForRefresh:  findHostInstancesForRefresh ,\n    scheduleRefresh:  scheduleRefresh ,\n    scheduleRoot:  scheduleRoot ,\n    setRefreshHandler:  setRefreshHandler ,\n    // Enables DevTools to append owner stacks to error messages in DEV mode.\n    getCurrentFiber:  getCurrentFiberForDevTools ,\n    // Enables DevTools to detect reconciler version rather than renderer version\n    // which may not match for third party renderers.\n    reconcilerVersion: ReactVersion\n  });\n}\n\n/* global reportError */\n\nvar defaultOnRecoverableError = typeof reportError === 'function' ? // In modern browsers, reportError will dispatch an error event,\n// emulating an uncaught JavaScript error.\nreportError : function (error) {\n  // In older browsers and test environments, fallback to console.error.\n  // eslint-disable-next-line react-internal/no-production-logging\n  console['error'](error);\n};\n\nfunction ReactDOMRoot(internalRoot) {\n  this._internalRoot = internalRoot;\n}\n\nReactDOMHydrationRoot.prototype.render = ReactDOMRoot.prototype.render = function (children) {\n  var root = this._internalRoot;\n\n  if (root === null) {\n    throw new Error('Cannot update an unmounted root.');\n  }\n\n  {\n    if (typeof arguments[1] === 'function') {\n      error('render(...): does not support the second callback argument. ' + 'To execute a side effect after rendering, declare it in a component body with useEffect().');\n    } else if (isValidContainer(arguments[1])) {\n      error('You passed a container to the second argument of root.render(...). ' + \"You don't need to pass it again since you already passed it to create the root.\");\n    } else if (typeof arguments[1] !== 'undefined') {\n      error('You passed a second argument to root.render(...) but it only accepts ' + 'one argument.');\n    }\n\n    var container = root.containerInfo;\n\n    if (container.nodeType !== COMMENT_NODE) {\n      var hostInstance = findHostInstanceWithNoPortals(root.current);\n\n      if (hostInstance) {\n        if (hostInstance.parentNode !== container) {\n          error('render(...): It looks like the React-rendered content of the ' + 'root container was removed without using React. This is not ' + 'supported and will cause errors. Instead, call ' + \"root.unmount() to empty a root's container.\");\n        }\n      }\n    }\n  }\n\n  updateContainer(children, root, null, null);\n};\n\nReactDOMHydrationRoot.prototype.unmount = ReactDOMRoot.prototype.unmount = function () {\n  {\n    if (typeof arguments[0] === 'function') {\n      error('unmount(...): does not support a callback argument. ' + 'To execute a side effect after rendering, declare it in a component body with useEffect().');\n    }\n  }\n\n  var root = this._internalRoot;\n\n  if (root !== null) {\n    this._internalRoot = null;\n    var container = root.containerInfo;\n\n    {\n      if (isAlreadyRendering()) {\n        error('Attempted to synchronously unmount a root while React was already ' + 'rendering. React cannot finish unmounting the root until the ' + 'current render has completed, which may lead to a race condition.');\n      }\n    }\n\n    flushSync(function () {\n      updateContainer(null, root, null, null);\n    });\n    unmarkContainerAsRoot(container);\n  }\n};\n\nfunction createRoot(container, options) {\n  if (!isValidContainer(container)) {\n    throw new Error('createRoot(...): Target container is not a DOM element.');\n  }\n\n  warnIfReactDOMContainerInDEV(container);\n  var isStrictMode = false;\n  var concurrentUpdatesByDefaultOverride = false;\n  var identifierPrefix = '';\n  var onRecoverableError = defaultOnRecoverableError;\n  var transitionCallbacks = null;\n\n  if (options !== null && options !== undefined) {\n    {\n      if (options.hydrate) {\n        warn('hydrate through createRoot is deprecated. Use ReactDOMClient.hydrateRoot(container, <App />) instead.');\n      } else {\n        if (typeof options === 'object' && options !== null && options.$$typeof === REACT_ELEMENT_TYPE) {\n          error('You passed a JSX element to createRoot. You probably meant to ' + 'call root.render instead. ' + 'Example usage:\\n\\n' + '  let root = createRoot(domContainer);\\n' + '  root.render(<App />);');\n        }\n      }\n    }\n\n    if (options.unstable_strictMode === true) {\n      isStrictMode = true;\n    }\n\n    if (options.identifierPrefix !== undefined) {\n      identifierPrefix = options.identifierPrefix;\n    }\n\n    if (options.onRecoverableError !== undefined) {\n      onRecoverableError = options.onRecoverableError;\n    }\n\n    if (options.transitionCallbacks !== undefined) {\n      transitionCallbacks = options.transitionCallbacks;\n    }\n  }\n\n  var root = createContainer(container, ConcurrentRoot, null, isStrictMode, concurrentUpdatesByDefaultOverride, identifierPrefix, onRecoverableError);\n  markContainerAsRoot(root.current, container);\n  var rootContainerElement = container.nodeType === COMMENT_NODE ? container.parentNode : container;\n  listenToAllSupportedEvents(rootContainerElement);\n  return new ReactDOMRoot(root);\n}\n\nfunction ReactDOMHydrationRoot(internalRoot) {\n  this._internalRoot = internalRoot;\n}\n\nfunction scheduleHydration(target) {\n  if (target) {\n    queueExplicitHydrationTarget(target);\n  }\n}\n\nReactDOMHydrationRoot.prototype.unstable_scheduleHydration = scheduleHydration;\nfunction hydrateRoot(container, initialChildren, options) {\n  if (!isValidContainer(container)) {\n    throw new Error('hydrateRoot(...): Target container is not a DOM element.');\n  }\n\n  warnIfReactDOMContainerInDEV(container);\n\n  {\n    if (initialChildren === undefined) {\n      error('Must provide initial children as second argument to hydrateRoot. ' + 'Example usage: hydrateRoot(domContainer, <App />)');\n    }\n  } // For now we reuse the whole bag of options since they contain\n  // the hydration callbacks.\n\n\n  var hydrationCallbacks = options != null ? options : null; // TODO: Delete this option\n\n  var mutableSources = options != null && options.hydratedSources || null;\n  var isStrictMode = false;\n  var concurrentUpdatesByDefaultOverride = false;\n  var identifierPrefix = '';\n  var onRecoverableError = defaultOnRecoverableError;\n\n  if (options !== null && options !== undefined) {\n    if (options.unstable_strictMode === true) {\n      isStrictMode = true;\n    }\n\n    if (options.identifierPrefix !== undefined) {\n      identifierPrefix = options.identifierPrefix;\n    }\n\n    if (options.onRecoverableError !== undefined) {\n      onRecoverableError = options.onRecoverableError;\n    }\n  }\n\n  var root = createHydrationContainer(initialChildren, null, container, ConcurrentRoot, hydrationCallbacks, isStrictMode, concurrentUpdatesByDefaultOverride, identifierPrefix, onRecoverableError);\n  markContainerAsRoot(root.current, container); // This can't be a comment node since hydration doesn't work on comment nodes anyway.\n\n  listenToAllSupportedEvents(container);\n\n  if (mutableSources) {\n    for (var i = 0; i < mutableSources.length; i++) {\n      var mutableSource = mutableSources[i];\n      registerMutableSourceForHydration(root, mutableSource);\n    }\n  }\n\n  return new ReactDOMHydrationRoot(root);\n}\nfunction isValidContainer(node) {\n  return !!(node && (node.nodeType === ELEMENT_NODE || node.nodeType === DOCUMENT_NODE || node.nodeType === DOCUMENT_FRAGMENT_NODE || !disableCommentsAsDOMContainers  ));\n} // TODO: Remove this function which also includes comment nodes.\n// We only use it in places that are currently more relaxed.\n\nfunction isValidContainerLegacy(node) {\n  return !!(node && (node.nodeType === ELEMENT_NODE || node.nodeType === DOCUMENT_NODE || node.nodeType === DOCUMENT_FRAGMENT_NODE || node.nodeType === COMMENT_NODE && node.nodeValue === ' react-mount-point-unstable '));\n}\n\nfunction warnIfReactDOMContainerInDEV(container) {\n  {\n    if (container.nodeType === ELEMENT_NODE && container.tagName && container.tagName.toUpperCase() === 'BODY') {\n      error('createRoot(): Creating roots directly with document.body is ' + 'discouraged, since its children are often manipulated by third-party ' + 'scripts and browser extensions. This may lead to subtle ' + 'reconciliation issues. Try using a container element created ' + 'for your app.');\n    }\n\n    if (isContainerMarkedAsRoot(container)) {\n      if (container._reactRootContainer) {\n        error('You are calling ReactDOMClient.createRoot() on a container that was previously ' + 'passed to ReactDOM.render(). This is not supported.');\n      } else {\n        error('You are calling ReactDOMClient.createRoot() on a container that ' + 'has already been passed to createRoot() before. Instead, call ' + 'root.render() on the existing root instead if you want to update it.');\n      }\n    }\n  }\n}\n\nvar ReactCurrentOwner$3 = ReactSharedInternals.ReactCurrentOwner;\nvar topLevelUpdateWarnings;\n\n{\n  topLevelUpdateWarnings = function (container) {\n    if (container._reactRootContainer && container.nodeType !== COMMENT_NODE) {\n      var hostInstance = findHostInstanceWithNoPortals(container._reactRootContainer.current);\n\n      if (hostInstance) {\n        if (hostInstance.parentNode !== container) {\n          error('render(...): It looks like the React-rendered content of this ' + 'container was removed without using React. This is not ' + 'supported and will cause errors. Instead, call ' + 'ReactDOM.unmountComponentAtNode to empty a container.');\n        }\n      }\n    }\n\n    var isRootRenderedBySomeReact = !!container._reactRootContainer;\n    var rootEl = getReactRootElementInContainer(container);\n    var hasNonRootReactChild = !!(rootEl && getInstanceFromNode(rootEl));\n\n    if (hasNonRootReactChild && !isRootRenderedBySomeReact) {\n      error('render(...): Replacing React-rendered children with a new root ' + 'component. If you intended to update the children of this node, ' + 'you should instead have the existing children update their state ' + 'and render the new components instead of calling ReactDOM.render.');\n    }\n\n    if (container.nodeType === ELEMENT_NODE && container.tagName && container.tagName.toUpperCase() === 'BODY') {\n      error('render(): Rendering components directly into document.body is ' + 'discouraged, since its children are often manipulated by third-party ' + 'scripts and browser extensions. This may lead to subtle ' + 'reconciliation issues. Try rendering into a container element created ' + 'for your app.');\n    }\n  };\n}\n\nfunction getReactRootElementInContainer(container) {\n  if (!container) {\n    return null;\n  }\n\n  if (container.nodeType === DOCUMENT_NODE) {\n    return container.documentElement;\n  } else {\n    return container.firstChild;\n  }\n}\n\nfunction noopOnRecoverableError() {// This isn't reachable because onRecoverableError isn't called in the\n  // legacy API.\n}\n\nfunction legacyCreateRootFromDOMContainer(container, initialChildren, parentComponent, callback, isHydrationContainer) {\n  if (isHydrationContainer) {\n    if (typeof callback === 'function') {\n      var originalCallback = callback;\n\n      callback = function () {\n        var instance = getPublicRootInstance(root);\n        originalCallback.call(instance);\n      };\n    }\n\n    var root = createHydrationContainer(initialChildren, callback, container, LegacyRoot, null, // hydrationCallbacks\n    false, // isStrictMode\n    false, // concurrentUpdatesByDefaultOverride,\n    '', // identifierPrefix\n    noopOnRecoverableError);\n    container._reactRootContainer = root;\n    markContainerAsRoot(root.current, container);\n    var rootContainerElement = container.nodeType === COMMENT_NODE ? container.parentNode : container;\n    listenToAllSupportedEvents(rootContainerElement);\n    flushSync();\n    return root;\n  } else {\n    // First clear any existing content.\n    var rootSibling;\n\n    while (rootSibling = container.lastChild) {\n      container.removeChild(rootSibling);\n    }\n\n    if (typeof callback === 'function') {\n      var _originalCallback = callback;\n\n      callback = function () {\n        var instance = getPublicRootInstance(_root);\n\n        _originalCallback.call(instance);\n      };\n    }\n\n    var _root = createContainer(container, LegacyRoot, null, // hydrationCallbacks\n    false, // isStrictMode\n    false, // concurrentUpdatesByDefaultOverride,\n    '', // identifierPrefix\n    noopOnRecoverableError);\n\n    container._reactRootContainer = _root;\n    markContainerAsRoot(_root.current, container);\n\n    var _rootContainerElement = container.nodeType === COMMENT_NODE ? container.parentNode : container;\n\n    listenToAllSupportedEvents(_rootContainerElement); // Initial mount should not be batched.\n\n    flushSync(function () {\n      updateContainer(initialChildren, _root, parentComponent, callback);\n    });\n    return _root;\n  }\n}\n\nfunction warnOnInvalidCallback$1(callback, callerName) {\n  {\n    if (callback !== null && typeof callback !== 'function') {\n      error('%s(...): Expected the last optional `callback` argument to be a ' + 'function. Instead received: %s.', callerName, callback);\n    }\n  }\n}\n\nfunction legacyRenderSubtreeIntoContainer(parentComponent, children, container, forceHydrate, callback) {\n  {\n    topLevelUpdateWarnings(container);\n    warnOnInvalidCallback$1(callback === undefined ? null : callback, 'render');\n  }\n\n  var maybeRoot = container._reactRootContainer;\n  var root;\n\n  if (!maybeRoot) {\n    // Initial mount\n    root = legacyCreateRootFromDOMContainer(container, children, parentComponent, callback, forceHydrate);\n  } else {\n    root = maybeRoot;\n\n    if (typeof callback === 'function') {\n      var originalCallback = callback;\n\n      callback = function () {\n        var instance = getPublicRootInstance(root);\n        originalCallback.call(instance);\n      };\n    } // Update\n\n\n    updateContainer(children, root, parentComponent, callback);\n  }\n\n  return getPublicRootInstance(root);\n}\n\nfunction findDOMNode(componentOrElement) {\n  {\n    var owner = ReactCurrentOwner$3.current;\n\n    if (owner !== null && owner.stateNode !== null) {\n      var warnedAboutRefsInRender = owner.stateNode._warnedAboutRefsInRender;\n\n      if (!warnedAboutRefsInRender) {\n        error('%s is accessing findDOMNode inside its render(). ' + 'render() should be a pure function of props and state. It should ' + 'never access something that requires stale data from the previous ' + 'render, such as refs. Move this logic to componentDidMount and ' + 'componentDidUpdate instead.', getComponentNameFromType(owner.type) || 'A component');\n      }\n\n      owner.stateNode._warnedAboutRefsInRender = true;\n    }\n  }\n\n  if (componentOrElement == null) {\n    return null;\n  }\n\n  if (componentOrElement.nodeType === ELEMENT_NODE) {\n    return componentOrElement;\n  }\n\n  {\n    return findHostInstanceWithWarning(componentOrElement, 'findDOMNode');\n  }\n}\nfunction hydrate(element, container, callback) {\n  {\n    error('ReactDOM.hydrate is no longer supported in React 18. Use hydrateRoot ' + 'instead. Until you switch to the new API, your app will behave as ' + \"if it's running React 17. Learn \" + 'more: https://reactjs.org/link/switch-to-createroot');\n  }\n\n  if (!isValidContainerLegacy(container)) {\n    throw new Error('Target container is not a DOM element.');\n  }\n\n  {\n    var isModernRoot = isContainerMarkedAsRoot(container) && container._reactRootContainer === undefined;\n\n    if (isModernRoot) {\n      error('You are calling ReactDOM.hydrate() on a container that was previously ' + 'passed to ReactDOMClient.createRoot(). This is not supported. ' + 'Did you mean to call hydrateRoot(container, element)?');\n    }\n  } // TODO: throw or warn if we couldn't hydrate?\n\n\n  return legacyRenderSubtreeIntoContainer(null, element, container, true, callback);\n}\nfunction render(element, container, callback) {\n  {\n    error('ReactDOM.render is no longer supported in React 18. Use createRoot ' + 'instead. Until you switch to the new API, your app will behave as ' + \"if it's running React 17. Learn \" + 'more: https://reactjs.org/link/switch-to-createroot');\n  }\n\n  if (!isValidContainerLegacy(container)) {\n    throw new Error('Target container is not a DOM element.');\n  }\n\n  {\n    var isModernRoot = isContainerMarkedAsRoot(container) && container._reactRootContainer === undefined;\n\n    if (isModernRoot) {\n      error('You are calling ReactDOM.render() on a container that was previously ' + 'passed to ReactDOMClient.createRoot(). This is not supported. ' + 'Did you mean to call root.render(element)?');\n    }\n  }\n\n  return legacyRenderSubtreeIntoContainer(null, element, container, false, callback);\n}\nfunction unstable_renderSubtreeIntoContainer(parentComponent, element, containerNode, callback) {\n  {\n    error('ReactDOM.unstable_renderSubtreeIntoContainer() is no longer supported ' + 'in React 18. Consider using a portal instead. Until you switch to ' + \"the createRoot API, your app will behave as if it's running React \" + '17. Learn more: https://reactjs.org/link/switch-to-createroot');\n  }\n\n  if (!isValidContainerLegacy(containerNode)) {\n    throw new Error('Target container is not a DOM element.');\n  }\n\n  if (parentComponent == null || !has(parentComponent)) {\n    throw new Error('parentComponent must be a valid React Component');\n  }\n\n  return legacyRenderSubtreeIntoContainer(parentComponent, element, containerNode, false, callback);\n}\nfunction unmountComponentAtNode(container) {\n  if (!isValidContainerLegacy(container)) {\n    throw new Error('unmountComponentAtNode(...): Target container is not a DOM element.');\n  }\n\n  {\n    var isModernRoot = isContainerMarkedAsRoot(container) && container._reactRootContainer === undefined;\n\n    if (isModernRoot) {\n      error('You are calling ReactDOM.unmountComponentAtNode() on a container that was previously ' + 'passed to ReactDOMClient.createRoot(). This is not supported. Did you mean to call root.unmount()?');\n    }\n  }\n\n  if (container._reactRootContainer) {\n    {\n      var rootEl = getReactRootElementInContainer(container);\n      var renderedByDifferentReact = rootEl && !getInstanceFromNode(rootEl);\n\n      if (renderedByDifferentReact) {\n        error(\"unmountComponentAtNode(): The node you're attempting to unmount \" + 'was rendered by another copy of React.');\n      }\n    } // Unmount should not be batched.\n\n\n    flushSync(function () {\n      legacyRenderSubtreeIntoContainer(null, null, container, false, function () {\n        // $FlowFixMe This should probably use `delete container._reactRootContainer`\n        container._reactRootContainer = null;\n        unmarkContainerAsRoot(container);\n      });\n    }); // If you call unmountComponentAtNode twice in quick succession, you'll\n    // get `true` twice. That's probably fine?\n\n    return true;\n  } else {\n    {\n      var _rootEl = getReactRootElementInContainer(container);\n\n      var hasNonRootReactChild = !!(_rootEl && getInstanceFromNode(_rootEl)); // Check if the container itself is a React root node.\n\n      var isContainerReactRoot = container.nodeType === ELEMENT_NODE && isValidContainerLegacy(container.parentNode) && !!container.parentNode._reactRootContainer;\n\n      if (hasNonRootReactChild) {\n        error(\"unmountComponentAtNode(): The node you're attempting to unmount \" + 'was rendered by React and is not a top-level container. %s', isContainerReactRoot ? 'You may have accidentally passed in a React root node instead ' + 'of its container.' : 'Instead, have the parent component update its state and ' + 'rerender in order to remove this component.');\n      }\n    }\n\n    return false;\n  }\n}\n\nsetAttemptSynchronousHydration(attemptSynchronousHydration$1);\nsetAttemptContinuousHydration(attemptContinuousHydration$1);\nsetAttemptHydrationAtCurrentPriority(attemptHydrationAtCurrentPriority$1);\nsetGetCurrentUpdatePriority(getCurrentUpdatePriority);\nsetAttemptHydrationAtPriority(runWithPriority);\n\n{\n  if (typeof Map !== 'function' || // $FlowIssue Flow incorrectly thinks Map has no prototype\n  Map.prototype == null || typeof Map.prototype.forEach !== 'function' || typeof Set !== 'function' || // $FlowIssue Flow incorrectly thinks Set has no prototype\n  Set.prototype == null || typeof Set.prototype.clear !== 'function' || typeof Set.prototype.forEach !== 'function') {\n    error('React depends on Map and Set built-in types. Make sure that you load a ' + 'polyfill in older browsers. https://reactjs.org/link/react-polyfills');\n  }\n}\n\nsetRestoreImplementation(restoreControlledState$3);\nsetBatchingImplementation(batchedUpdates$1, discreteUpdates, flushSync);\n\nfunction createPortal$1(children, container) {\n  var key = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : null;\n\n  if (!isValidContainer(container)) {\n    throw new Error('Target container is not a DOM element.');\n  } // TODO: pass ReactDOM portal implementation as third argument\n  // $FlowFixMe The Flow type is opaque but there's no way to actually create it.\n\n\n  return createPortal(children, container, null, key);\n}\n\nfunction renderSubtreeIntoContainer(parentComponent, element, containerNode, callback) {\n  return unstable_renderSubtreeIntoContainer(parentComponent, element, containerNode, callback);\n}\n\nvar Internals = {\n  usingClientEntryPoint: false,\n  // Keep in sync with ReactTestUtils.js.\n  // This is an array for better minification.\n  Events: [getInstanceFromNode, getNodeFromInstance, getFiberCurrentPropsFromNode, enqueueStateRestore, restoreStateIfNeeded, batchedUpdates$1]\n};\n\nfunction createRoot$1(container, options) {\n  {\n    if (!Internals.usingClientEntryPoint && !false) {\n      error('You are importing createRoot from \"react-dom\" which is not supported. ' + 'You should instead import it from \"react-dom/client\".');\n    }\n  }\n\n  return createRoot(container, options);\n}\n\nfunction hydrateRoot$1(container, initialChildren, options) {\n  {\n    if (!Internals.usingClientEntryPoint && !false) {\n      error('You are importing hydrateRoot from \"react-dom\" which is not supported. ' + 'You should instead import it from \"react-dom/client\".');\n    }\n  }\n\n  return hydrateRoot(container, initialChildren, options);\n} // Overload the definition to the two valid signatures.\n// Warning, this opts-out of checking the function body.\n\n\n// eslint-disable-next-line no-redeclare\nfunction flushSync$1(fn) {\n  {\n    if (isAlreadyRendering()) {\n      error('flushSync was called from inside a lifecycle method. React cannot ' + 'flush when React is already rendering. Consider moving this call to ' + 'a scheduler task or micro task.');\n    }\n  }\n\n  return flushSync(fn);\n}\nvar foundDevTools = injectIntoDevTools({\n  findFiberByHostInstance: getClosestInstanceFromNode,\n  bundleType:  1 ,\n  version: ReactVersion,\n  rendererPackageName: 'react-dom'\n});\n\n{\n  if (!foundDevTools && canUseDOM && window.top === window.self) {\n    // If we're in Chrome or Firefox, provide a download link if not installed.\n    if (navigator.userAgent.indexOf('Chrome') > -1 && navigator.userAgent.indexOf('Edge') === -1 || navigator.userAgent.indexOf('Firefox') > -1) {\n      var protocol = window.location.protocol; // Don't warn in exotic cases like chrome-extension://.\n\n      if (/^(https?|file):$/.test(protocol)) {\n        // eslint-disable-next-line react-internal/no-production-logging\n        console.info('%cDownload the React DevTools ' + 'for a better development experience: ' + 'https://reactjs.org/link/react-devtools' + (protocol === 'file:' ? '\\nYou might need to use a local HTTP server (instead of file://): ' + 'https://reactjs.org/link/react-devtools-faq' : ''), 'font-weight:bold');\n      }\n    }\n  }\n}\n\nexports.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED = Internals;\nexports.createPortal = createPortal$1;\nexports.createRoot = createRoot$1;\nexports.findDOMNode = findDOMNode;\nexports.flushSync = flushSync$1;\nexports.hydrate = hydrate;\nexports.hydrateRoot = hydrateRoot$1;\nexports.render = render;\nexports.unmountComponentAtNode = unmountComponentAtNode;\nexports.unstable_batchedUpdates = batchedUpdates$1;\nexports.unstable_renderSubtreeIntoContainer = renderSubtreeIntoContainer;\nexports.version = ReactVersion;\n          /* global __REACT_DEVTOOLS_GLOBAL_HOOK__ */\nif (\n  typeof __REACT_DEVTOOLS_GLOBAL_HOOK__ !== 'undefined' &&\n  typeof __REACT_DEVTOOLS_GLOBAL_HOOK__.registerInternalModuleStop ===\n    'function'\n) {\n  __REACT_DEVTOOLS_GLOBAL_HOOK__.registerInternalModuleStop(new Error());\n}\n        \n  })();\n}\n","'use strict';\n\nfunction checkDCE() {\n  /* global __REACT_DEVTOOLS_GLOBAL_HOOK__ */\n  if (\n    typeof __REACT_DEVTOOLS_GLOBAL_HOOK__ === 'undefined' ||\n    typeof __REACT_DEVTOOLS_GLOBAL_HOOK__.checkDCE !== 'function'\n  ) {\n    return;\n  }\n  if (process.env.NODE_ENV !== 'production') {\n    // This branch is unreachable because this function is only called\n    // in production, but the condition is true only in development.\n    // Therefore if the branch is still here, dead code elimination wasn't\n    // properly applied.\n    // Don't change the message. React DevTools relies on it. Also make sure\n    // this message doesn't occur elsewhere in this function, or it will cause\n    // a false positive.\n    throw new Error('^_^');\n  }\n  try {\n    // Verify that the code above has been dead code eliminated (DCE'd).\n    __REACT_DEVTOOLS_GLOBAL_HOOK__.checkDCE(checkDCE);\n  } catch (err) {\n    // DevTools shouldn't crash React, no matter what.\n    // We should still report in case we break this code.\n    console.error(err);\n  }\n}\n\nif (process.env.NODE_ENV === 'production') {\n  // DCE check should happen before ReactDOM bundle executes so that\n  // DevTools can report bad minification during injection.\n  checkDCE();\n  module.exports = require('./cjs/react-dom.production.min.js');\n} else {\n  module.exports = require('./cjs/react-dom.development.js');\n}\n","'use strict';\n\nvar m = require('react-dom');\nif (process.env.NODE_ENV === 'production') {\n  exports.createRoot = m.createRoot;\n  exports.hydrateRoot = m.hydrateRoot;\n} else {\n  var i = m.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED;\n  exports.createRoot = function(c, o) {\n    i.usingClientEntryPoint = true;\n    try {\n      return m.createRoot(c, o);\n    } finally {\n      i.usingClientEntryPoint = false;\n    }\n  };\n  exports.hydrateRoot = function(c, h, o) {\n    i.usingClientEntryPoint = true;\n    try {\n      return m.hydrateRoot(c, h, o);\n    } finally {\n      i.usingClientEntryPoint = false;\n    }\n  };\n}\n","/*!\n\tCopyright (c) 2018 Jed Watson.\n\tLicensed under the MIT License (MIT), see\n\thttp://jedwatson.github.io/classnames\n*/\n/* global define */\n\n(function () {\n\t'use strict';\n\n\tvar hasOwn = {}.hasOwnProperty;\n\tvar nativeCodeString = '[native code]';\n\n\tfunction classNames() {\n\t\tvar classes = [];\n\n\t\tfor (var i = 0; i < arguments.length; i++) {\n\t\t\tvar arg = arguments[i];\n\t\t\tif (!arg) continue;\n\n\t\t\tvar argType = typeof arg;\n\n\t\t\tif (argType === 'string' || argType === 'number') {\n\t\t\t\tclasses.push(arg);\n\t\t\t} else if (Array.isArray(arg)) {\n\t\t\t\tif (arg.length) {\n\t\t\t\t\tvar inner = classNames.apply(null, arg);\n\t\t\t\t\tif (inner) {\n\t\t\t\t\t\tclasses.push(inner);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else if (argType === 'object') {\n\t\t\t\tif (arg.toString !== Object.prototype.toString && !arg.toString.toString().includes('[native code]')) {\n\t\t\t\t\tclasses.push(arg.toString());\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tfor (var key in arg) {\n\t\t\t\t\tif (hasOwn.call(arg, key) && arg[key]) {\n\t\t\t\t\t\tclasses.push(key);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn classes.join(' ');\n\t}\n\n\tif (typeof module !== 'undefined' && module.exports) {\n\t\tclassNames.default = classNames;\n\t\tmodule.exports = classNames;\n\t} else if (typeof define === 'function' && typeof define.amd === 'object' && define.amd) {\n\t\t// register as 'classnames', consistent with npm package name\n\t\tdefine('classnames', [], function () {\n\t\t\treturn classNames;\n\t\t});\n\t} else {\n\t\twindow.classNames = classNames;\n\t}\n}());\n","/**\n * @license\n * Lodash <https://lodash.com/>\n * Copyright OpenJS Foundation and other contributors <https://openjsf.org/>\n * Released under MIT license <https://lodash.com/license>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n;(function() {\n\n  /** Used as a safe reference for `undefined` in pre-ES5 environments. */\n  var undefined;\n\n  /** Used as the semantic version number. */\n  var VERSION = '4.17.21';\n\n  /** Used as the size to enable large array optimizations. */\n  var LARGE_ARRAY_SIZE = 200;\n\n  /** Error message constants. */\n  var CORE_ERROR_TEXT = 'Unsupported core-js use. Try https://npms.io/search?q=ponyfill.',\n      FUNC_ERROR_TEXT = 'Expected a function',\n      INVALID_TEMPL_VAR_ERROR_TEXT = 'Invalid `variable` option passed into `_.template`';\n\n  /** Used to stand-in for `undefined` hash values. */\n  var HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n  /** Used as the maximum memoize cache size. */\n  var MAX_MEMOIZE_SIZE = 500;\n\n  /** Used as the internal argument placeholder. */\n  var PLACEHOLDER = '__lodash_placeholder__';\n\n  /** Used to compose bitmasks for cloning. */\n  var CLONE_DEEP_FLAG = 1,\n      CLONE_FLAT_FLAG = 2,\n      CLONE_SYMBOLS_FLAG = 4;\n\n  /** Used to compose bitmasks for value comparisons. */\n  var COMPARE_PARTIAL_FLAG = 1,\n      COMPARE_UNORDERED_FLAG = 2;\n\n  /** Used to compose bitmasks for function metadata. */\n  var WRAP_BIND_FLAG = 1,\n      WRAP_BIND_KEY_FLAG = 2,\n      WRAP_CURRY_BOUND_FLAG = 4,\n      WRAP_CURRY_FLAG = 8,\n      WRAP_CURRY_RIGHT_FLAG = 16,\n      WRAP_PARTIAL_FLAG = 32,\n      WRAP_PARTIAL_RIGHT_FLAG = 64,\n      WRAP_ARY_FLAG = 128,\n      WRAP_REARG_FLAG = 256,\n      WRAP_FLIP_FLAG = 512;\n\n  /** Used as default options for `_.truncate`. */\n  var DEFAULT_TRUNC_LENGTH = 30,\n      DEFAULT_TRUNC_OMISSION = '...';\n\n  /** Used to detect hot functions by number of calls within a span of milliseconds. */\n  var HOT_COUNT = 800,\n      HOT_SPAN = 16;\n\n  /** Used to indicate the type of lazy iteratees. */\n  var LAZY_FILTER_FLAG = 1,\n      LAZY_MAP_FLAG = 2,\n      LAZY_WHILE_FLAG = 3;\n\n  /** Used as references for various `Number` constants. */\n  var INFINITY = 1 / 0,\n      MAX_SAFE_INTEGER = 9007199254740991,\n      MAX_INTEGER = 1.7976931348623157e+308,\n      NAN = 0 / 0;\n\n  /** Used as references for the maximum length and index of an array. */\n  var MAX_ARRAY_LENGTH = 4294967295,\n      MAX_ARRAY_INDEX = MAX_ARRAY_LENGTH - 1,\n      HALF_MAX_ARRAY_LENGTH = MAX_ARRAY_LENGTH >>> 1;\n\n  /** Used to associate wrap methods with their bit flags. */\n  var wrapFlags = [\n    ['ary', WRAP_ARY_FLAG],\n    ['bind', WRAP_BIND_FLAG],\n    ['bindKey', WRAP_BIND_KEY_FLAG],\n    ['curry', WRAP_CURRY_FLAG],\n    ['curryRight', WRAP_CURRY_RIGHT_FLAG],\n    ['flip', WRAP_FLIP_FLAG],\n    ['partial', WRAP_PARTIAL_FLAG],\n    ['partialRight', WRAP_PARTIAL_RIGHT_FLAG],\n    ['rearg', WRAP_REARG_FLAG]\n  ];\n\n  /** `Object#toString` result references. */\n  var argsTag = '[object Arguments]',\n      arrayTag = '[object Array]',\n      asyncTag = '[object AsyncFunction]',\n      boolTag = '[object Boolean]',\n      dateTag = '[object Date]',\n      domExcTag = '[object DOMException]',\n      errorTag = '[object Error]',\n      funcTag = '[object Function]',\n      genTag = '[object GeneratorFunction]',\n      mapTag = '[object Map]',\n      numberTag = '[object Number]',\n      nullTag = '[object Null]',\n      objectTag = '[object Object]',\n      promiseTag = '[object Promise]',\n      proxyTag = '[object Proxy]',\n      regexpTag = '[object RegExp]',\n      setTag = '[object Set]',\n      stringTag = '[object String]',\n      symbolTag = '[object Symbol]',\n      undefinedTag = '[object Undefined]',\n      weakMapTag = '[object WeakMap]',\n      weakSetTag = '[object WeakSet]';\n\n  var arrayBufferTag = '[object ArrayBuffer]',\n      dataViewTag = '[object DataView]',\n      float32Tag = '[object Float32Array]',\n      float64Tag = '[object Float64Array]',\n      int8Tag = '[object Int8Array]',\n      int16Tag = '[object Int16Array]',\n      int32Tag = '[object Int32Array]',\n      uint8Tag = '[object Uint8Array]',\n      uint8ClampedTag = '[object Uint8ClampedArray]',\n      uint16Tag = '[object Uint16Array]',\n      uint32Tag = '[object Uint32Array]';\n\n  /** Used to match empty string literals in compiled template source. */\n  var reEmptyStringLeading = /\\b__p \\+= '';/g,\n      reEmptyStringMiddle = /\\b(__p \\+=) '' \\+/g,\n      reEmptyStringTrailing = /(__e\\(.*?\\)|\\b__t\\)) \\+\\n'';/g;\n\n  /** Used to match HTML entities and HTML characters. */\n  var reEscapedHtml = /&(?:amp|lt|gt|quot|#39);/g,\n      reUnescapedHtml = /[&<>\"']/g,\n      reHasEscapedHtml = RegExp(reEscapedHtml.source),\n      reHasUnescapedHtml = RegExp(reUnescapedHtml.source);\n\n  /** Used to match template delimiters. */\n  var reEscape = /<%-([\\s\\S]+?)%>/g,\n      reEvaluate = /<%([\\s\\S]+?)%>/g,\n      reInterpolate = /<%=([\\s\\S]+?)%>/g;\n\n  /** Used to match property names within property paths. */\n  var reIsDeepProp = /\\.|\\[(?:[^[\\]]*|([\"'])(?:(?!\\1)[^\\\\]|\\\\.)*?\\1)\\]/,\n      reIsPlainProp = /^\\w*$/,\n      rePropName = /[^.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|$))/g;\n\n  /**\n   * Used to match `RegExp`\n   * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n   */\n  var reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g,\n      reHasRegExpChar = RegExp(reRegExpChar.source);\n\n  /** Used to match leading whitespace. */\n  var reTrimStart = /^\\s+/;\n\n  /** Used to match a single whitespace character. */\n  var reWhitespace = /\\s/;\n\n  /** Used to match wrap detail comments. */\n  var reWrapComment = /\\{(?:\\n\\/\\* \\[wrapped with .+\\] \\*\\/)?\\n?/,\n      reWrapDetails = /\\{\\n\\/\\* \\[wrapped with (.+)\\] \\*/,\n      reSplitDetails = /,? & /;\n\n  /** Used to match words composed of alphanumeric characters. */\n  var reAsciiWord = /[^\\x00-\\x2f\\x3a-\\x40\\x5b-\\x60\\x7b-\\x7f]+/g;\n\n  /**\n   * Used to validate the `validate` option in `_.template` variable.\n   *\n   * Forbids characters which could potentially change the meaning of the function argument definition:\n   * - \"(),\" (modification of function parameters)\n   * - \"=\" (default value)\n   * - \"[]{}\" (destructuring of function parameters)\n   * - \"/\" (beginning of a comment)\n   * - whitespace\n   */\n  var reForbiddenIdentifierChars = /[()=,{}\\[\\]\\/\\s]/;\n\n  /** Used to match backslashes in property paths. */\n  var reEscapeChar = /\\\\(\\\\)?/g;\n\n  /**\n   * Used to match\n   * [ES template delimiters](http://ecma-international.org/ecma-262/7.0/#sec-template-literal-lexical-components).\n   */\n  var reEsTemplate = /\\$\\{([^\\\\}]*(?:\\\\.[^\\\\}]*)*)\\}/g;\n\n  /** Used to match `RegExp` flags from their coerced string values. */\n  var reFlags = /\\w*$/;\n\n  /** Used to detect bad signed hexadecimal string values. */\n  var reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n  /** Used to detect binary string values. */\n  var reIsBinary = /^0b[01]+$/i;\n\n  /** Used to detect host constructors (Safari). */\n  var reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n  /** Used to detect octal string values. */\n  var reIsOctal = /^0o[0-7]+$/i;\n\n  /** Used to detect unsigned integer values. */\n  var reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n  /** Used to match Latin Unicode letters (excluding mathematical operators). */\n  var reLatin = /[\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\xff\\u0100-\\u017f]/g;\n\n  /** Used to ensure capturing order of template delimiters. */\n  var reNoMatch = /($^)/;\n\n  /** Used to match unescaped characters in compiled string literals. */\n  var reUnescapedString = /['\\n\\r\\u2028\\u2029\\\\]/g;\n\n  /** Used to compose unicode character classes. */\n  var rsAstralRange = '\\\\ud800-\\\\udfff',\n      rsComboMarksRange = '\\\\u0300-\\\\u036f',\n      reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n      rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n      rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n      rsDingbatRange = '\\\\u2700-\\\\u27bf',\n      rsLowerRange = 'a-z\\\\xdf-\\\\xf6\\\\xf8-\\\\xff',\n      rsMathOpRange = '\\\\xac\\\\xb1\\\\xd7\\\\xf7',\n      rsNonCharRange = '\\\\x00-\\\\x2f\\\\x3a-\\\\x40\\\\x5b-\\\\x60\\\\x7b-\\\\xbf',\n      rsPunctuationRange = '\\\\u2000-\\\\u206f',\n      rsSpaceRange = ' \\\\t\\\\x0b\\\\f\\\\xa0\\\\ufeff\\\\n\\\\r\\\\u2028\\\\u2029\\\\u1680\\\\u180e\\\\u2000\\\\u2001\\\\u2002\\\\u2003\\\\u2004\\\\u2005\\\\u2006\\\\u2007\\\\u2008\\\\u2009\\\\u200a\\\\u202f\\\\u205f\\\\u3000',\n      rsUpperRange = 'A-Z\\\\xc0-\\\\xd6\\\\xd8-\\\\xde',\n      rsVarRange = '\\\\ufe0e\\\\ufe0f',\n      rsBreakRange = rsMathOpRange + rsNonCharRange + rsPunctuationRange + rsSpaceRange;\n\n  /** Used to compose unicode capture groups. */\n  var rsApos = \"['\\u2019]\",\n      rsAstral = '[' + rsAstralRange + ']',\n      rsBreak = '[' + rsBreakRange + ']',\n      rsCombo = '[' + rsComboRange + ']',\n      rsDigits = '\\\\d+',\n      rsDingbat = '[' + rsDingbatRange + ']',\n      rsLower = '[' + rsLowerRange + ']',\n      rsMisc = '[^' + rsAstralRange + rsBreakRange + rsDigits + rsDingbatRange + rsLowerRange + rsUpperRange + ']',\n      rsFitz = '\\\\ud83c[\\\\udffb-\\\\udfff]',\n      rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')',\n      rsNonAstral = '[^' + rsAstralRange + ']',\n      rsRegional = '(?:\\\\ud83c[\\\\udde6-\\\\uddff]){2}',\n      rsSurrPair = '[\\\\ud800-\\\\udbff][\\\\udc00-\\\\udfff]',\n      rsUpper = '[' + rsUpperRange + ']',\n      rsZWJ = '\\\\u200d';\n\n  /** Used to compose unicode regexes. */\n  var rsMiscLower = '(?:' + rsLower + '|' + rsMisc + ')',\n      rsMiscUpper = '(?:' + rsUpper + '|' + rsMisc + ')',\n      rsOptContrLower = '(?:' + rsApos + '(?:d|ll|m|re|s|t|ve))?',\n      rsOptContrUpper = '(?:' + rsApos + '(?:D|LL|M|RE|S|T|VE))?',\n      reOptMod = rsModifier + '?',\n      rsOptVar = '[' + rsVarRange + ']?',\n      rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',\n      rsOrdLower = '\\\\d*(?:1st|2nd|3rd|(?![123])\\\\dth)(?=\\\\b|[A-Z_])',\n      rsOrdUpper = '\\\\d*(?:1ST|2ND|3RD|(?![123])\\\\dTH)(?=\\\\b|[a-z_])',\n      rsSeq = rsOptVar + reOptMod + rsOptJoin,\n      rsEmoji = '(?:' + [rsDingbat, rsRegional, rsSurrPair].join('|') + ')' + rsSeq,\n      rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';\n\n  /** Used to match apostrophes. */\n  var reApos = RegExp(rsApos, 'g');\n\n  /**\n   * Used to match [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks) and\n   * [combining diacritical marks for symbols](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks_for_Symbols).\n   */\n  var reComboMark = RegExp(rsCombo, 'g');\n\n  /** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */\n  var reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');\n\n  /** Used to match complex or compound words. */\n  var reUnicodeWord = RegExp([\n    rsUpper + '?' + rsLower + '+' + rsOptContrLower + '(?=' + [rsBreak, rsUpper, '$'].join('|') + ')',\n    rsMiscUpper + '+' + rsOptContrUpper + '(?=' + [rsBreak, rsUpper + rsMiscLower, '$'].join('|') + ')',\n    rsUpper + '?' + rsMiscLower + '+' + rsOptContrLower,\n    rsUpper + '+' + rsOptContrUpper,\n    rsOrdUpper,\n    rsOrdLower,\n    rsDigits,\n    rsEmoji\n  ].join('|'), 'g');\n\n  /** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */\n  var reHasUnicode = RegExp('[' + rsZWJ + rsAstralRange  + rsComboRange + rsVarRange + ']');\n\n  /** Used to detect strings that need a more robust regexp to match words. */\n  var reHasUnicodeWord = /[a-z][A-Z]|[A-Z]{2}[a-z]|[0-9][a-zA-Z]|[a-zA-Z][0-9]|[^a-zA-Z0-9 ]/;\n\n  /** Used to assign default `context` object properties. */\n  var contextProps = [\n    'Array', 'Buffer', 'DataView', 'Date', 'Error', 'Float32Array', 'Float64Array',\n    'Function', 'Int8Array', 'Int16Array', 'Int32Array', 'Map', 'Math', 'Object',\n    'Promise', 'RegExp', 'Set', 'String', 'Symbol', 'TypeError', 'Uint8Array',\n    'Uint8ClampedArray', 'Uint16Array', 'Uint32Array', 'WeakMap',\n    '_', 'clearTimeout', 'isFinite', 'parseInt', 'setTimeout'\n  ];\n\n  /** Used to make template sourceURLs easier to identify. */\n  var templateCounter = -1;\n\n  /** Used to identify `toStringTag` values of typed arrays. */\n  var typedArrayTags = {};\n  typedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\n  typedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\n  typedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\n  typedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\n  typedArrayTags[uint32Tag] = true;\n  typedArrayTags[argsTag] = typedArrayTags[arrayTag] =\n  typedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\n  typedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\n  typedArrayTags[errorTag] = typedArrayTags[funcTag] =\n  typedArrayTags[mapTag] = typedArrayTags[numberTag] =\n  typedArrayTags[objectTag] = typedArrayTags[regexpTag] =\n  typedArrayTags[setTag] = typedArrayTags[stringTag] =\n  typedArrayTags[weakMapTag] = false;\n\n  /** Used to identify `toStringTag` values supported by `_.clone`. */\n  var cloneableTags = {};\n  cloneableTags[argsTag] = cloneableTags[arrayTag] =\n  cloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =\n  cloneableTags[boolTag] = cloneableTags[dateTag] =\n  cloneableTags[float32Tag] = cloneableTags[float64Tag] =\n  cloneableTags[int8Tag] = cloneableTags[int16Tag] =\n  cloneableTags[int32Tag] = cloneableTags[mapTag] =\n  cloneableTags[numberTag] = cloneableTags[objectTag] =\n  cloneableTags[regexpTag] = cloneableTags[setTag] =\n  cloneableTags[stringTag] = cloneableTags[symbolTag] =\n  cloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =\n  cloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;\n  cloneableTags[errorTag] = cloneableTags[funcTag] =\n  cloneableTags[weakMapTag] = false;\n\n  /** Used to map Latin Unicode letters to basic Latin letters. */\n  var deburredLetters = {\n    // Latin-1 Supplement block.\n    '\\xc0': 'A',  '\\xc1': 'A', '\\xc2': 'A', '\\xc3': 'A', '\\xc4': 'A', '\\xc5': 'A',\n    '\\xe0': 'a',  '\\xe1': 'a', '\\xe2': 'a', '\\xe3': 'a', '\\xe4': 'a', '\\xe5': 'a',\n    '\\xc7': 'C',  '\\xe7': 'c',\n    '\\xd0': 'D',  '\\xf0': 'd',\n    '\\xc8': 'E',  '\\xc9': 'E', '\\xca': 'E', '\\xcb': 'E',\n    '\\xe8': 'e',  '\\xe9': 'e', '\\xea': 'e', '\\xeb': 'e',\n    '\\xcc': 'I',  '\\xcd': 'I', '\\xce': 'I', '\\xcf': 'I',\n    '\\xec': 'i',  '\\xed': 'i', '\\xee': 'i', '\\xef': 'i',\n    '\\xd1': 'N',  '\\xf1': 'n',\n    '\\xd2': 'O',  '\\xd3': 'O', '\\xd4': 'O', '\\xd5': 'O', '\\xd6': 'O', '\\xd8': 'O',\n    '\\xf2': 'o',  '\\xf3': 'o', '\\xf4': 'o', '\\xf5': 'o', '\\xf6': 'o', '\\xf8': 'o',\n    '\\xd9': 'U',  '\\xda': 'U', '\\xdb': 'U', '\\xdc': 'U',\n    '\\xf9': 'u',  '\\xfa': 'u', '\\xfb': 'u', '\\xfc': 'u',\n    '\\xdd': 'Y',  '\\xfd': 'y', '\\xff': 'y',\n    '\\xc6': 'Ae', '\\xe6': 'ae',\n    '\\xde': 'Th', '\\xfe': 'th',\n    '\\xdf': 'ss',\n    // Latin Extended-A block.\n    '\\u0100': 'A',  '\\u0102': 'A', '\\u0104': 'A',\n    '\\u0101': 'a',  '\\u0103': 'a', '\\u0105': 'a',\n    '\\u0106': 'C',  '\\u0108': 'C', '\\u010a': 'C', '\\u010c': 'C',\n    '\\u0107': 'c',  '\\u0109': 'c', '\\u010b': 'c', '\\u010d': 'c',\n    '\\u010e': 'D',  '\\u0110': 'D', '\\u010f': 'd', '\\u0111': 'd',\n    '\\u0112': 'E',  '\\u0114': 'E', '\\u0116': 'E', '\\u0118': 'E', '\\u011a': 'E',\n    '\\u0113': 'e',  '\\u0115': 'e', '\\u0117': 'e', '\\u0119': 'e', '\\u011b': 'e',\n    '\\u011c': 'G',  '\\u011e': 'G', '\\u0120': 'G', '\\u0122': 'G',\n    '\\u011d': 'g',  '\\u011f': 'g', '\\u0121': 'g', '\\u0123': 'g',\n    '\\u0124': 'H',  '\\u0126': 'H', '\\u0125': 'h', '\\u0127': 'h',\n    '\\u0128': 'I',  '\\u012a': 'I', '\\u012c': 'I', '\\u012e': 'I', '\\u0130': 'I',\n    '\\u0129': 'i',  '\\u012b': 'i', '\\u012d': 'i', '\\u012f': 'i', '\\u0131': 'i',\n    '\\u0134': 'J',  '\\u0135': 'j',\n    '\\u0136': 'K',  '\\u0137': 'k', '\\u0138': 'k',\n    '\\u0139': 'L',  '\\u013b': 'L', '\\u013d': 'L', '\\u013f': 'L', '\\u0141': 'L',\n    '\\u013a': 'l',  '\\u013c': 'l', '\\u013e': 'l', '\\u0140': 'l', '\\u0142': 'l',\n    '\\u0143': 'N',  '\\u0145': 'N', '\\u0147': 'N', '\\u014a': 'N',\n    '\\u0144': 'n',  '\\u0146': 'n', '\\u0148': 'n', '\\u014b': 'n',\n    '\\u014c': 'O',  '\\u014e': 'O', '\\u0150': 'O',\n    '\\u014d': 'o',  '\\u014f': 'o', '\\u0151': 'o',\n    '\\u0154': 'R',  '\\u0156': 'R', '\\u0158': 'R',\n    '\\u0155': 'r',  '\\u0157': 'r', '\\u0159': 'r',\n    '\\u015a': 'S',  '\\u015c': 'S', '\\u015e': 'S', '\\u0160': 'S',\n    '\\u015b': 's',  '\\u015d': 's', '\\u015f': 's', '\\u0161': 's',\n    '\\u0162': 'T',  '\\u0164': 'T', '\\u0166': 'T',\n    '\\u0163': 't',  '\\u0165': 't', '\\u0167': 't',\n    '\\u0168': 'U',  '\\u016a': 'U', '\\u016c': 'U', '\\u016e': 'U', '\\u0170': 'U', '\\u0172': 'U',\n    '\\u0169': 'u',  '\\u016b': 'u', '\\u016d': 'u', '\\u016f': 'u', '\\u0171': 'u', '\\u0173': 'u',\n    '\\u0174': 'W',  '\\u0175': 'w',\n    '\\u0176': 'Y',  '\\u0177': 'y', '\\u0178': 'Y',\n    '\\u0179': 'Z',  '\\u017b': 'Z', '\\u017d': 'Z',\n    '\\u017a': 'z',  '\\u017c': 'z', '\\u017e': 'z',\n    '\\u0132': 'IJ', '\\u0133': 'ij',\n    '\\u0152': 'Oe', '\\u0153': 'oe',\n    '\\u0149': \"'n\", '\\u017f': 's'\n  };\n\n  /** Used to map characters to HTML entities. */\n  var htmlEscapes = {\n    '&': '&amp;',\n    '<': '&lt;',\n    '>': '&gt;',\n    '\"': '&quot;',\n    \"'\": '&#39;'\n  };\n\n  /** Used to map HTML entities to characters. */\n  var htmlUnescapes = {\n    '&amp;': '&',\n    '&lt;': '<',\n    '&gt;': '>',\n    '&quot;': '\"',\n    '&#39;': \"'\"\n  };\n\n  /** Used to escape characters for inclusion in compiled string literals. */\n  var stringEscapes = {\n    '\\\\': '\\\\',\n    \"'\": \"'\",\n    '\\n': 'n',\n    '\\r': 'r',\n    '\\u2028': 'u2028',\n    '\\u2029': 'u2029'\n  };\n\n  /** Built-in method references without a dependency on `root`. */\n  var freeParseFloat = parseFloat,\n      freeParseInt = parseInt;\n\n  /** Detect free variable `global` from Node.js. */\n  var freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\n  /** Detect free variable `self`. */\n  var freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n  /** Used as a reference to the global object. */\n  var root = freeGlobal || freeSelf || Function('return this')();\n\n  /** Detect free variable `exports`. */\n  var freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n  /** Detect free variable `module`. */\n  var freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n  /** Detect the popular CommonJS extension `module.exports`. */\n  var moduleExports = freeModule && freeModule.exports === freeExports;\n\n  /** Detect free variable `process` from Node.js. */\n  var freeProcess = moduleExports && freeGlobal.process;\n\n  /** Used to access faster Node.js helpers. */\n  var nodeUtil = (function() {\n    try {\n      // Use `util.types` for Node.js 10+.\n      var types = freeModule && freeModule.require && freeModule.require('util').types;\n\n      if (types) {\n        return types;\n      }\n\n      // Legacy `process.binding('util')` for Node.js < 10.\n      return freeProcess && freeProcess.binding && freeProcess.binding('util');\n    } catch (e) {}\n  }());\n\n  /* Node.js helper references. */\n  var nodeIsArrayBuffer = nodeUtil && nodeUtil.isArrayBuffer,\n      nodeIsDate = nodeUtil && nodeUtil.isDate,\n      nodeIsMap = nodeUtil && nodeUtil.isMap,\n      nodeIsRegExp = nodeUtil && nodeUtil.isRegExp,\n      nodeIsSet = nodeUtil && nodeUtil.isSet,\n      nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n  /*--------------------------------------------------------------------------*/\n\n  /**\n   * A faster alternative to `Function#apply`, this function invokes `func`\n   * with the `this` binding of `thisArg` and the arguments of `args`.\n   *\n   * @private\n   * @param {Function} func The function to invoke.\n   * @param {*} thisArg The `this` binding of `func`.\n   * @param {Array} args The arguments to invoke `func` with.\n   * @returns {*} Returns the result of `func`.\n   */\n  function apply(func, thisArg, args) {\n    switch (args.length) {\n      case 0: return func.call(thisArg);\n      case 1: return func.call(thisArg, args[0]);\n      case 2: return func.call(thisArg, args[0], args[1]);\n      case 3: return func.call(thisArg, args[0], args[1], args[2]);\n    }\n    return func.apply(thisArg, args);\n  }\n\n  /**\n   * A specialized version of `baseAggregator` for arrays.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} setter The function to set `accumulator` values.\n   * @param {Function} iteratee The iteratee to transform keys.\n   * @param {Object} accumulator The initial aggregated object.\n   * @returns {Function} Returns `accumulator`.\n   */\n  function arrayAggregator(array, setter, iteratee, accumulator) {\n    var index = -1,\n        length = array == null ? 0 : array.length;\n\n    while (++index < length) {\n      var value = array[index];\n      setter(accumulator, value, iteratee(value), array);\n    }\n    return accumulator;\n  }\n\n  /**\n   * A specialized version of `_.forEach` for arrays without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @returns {Array} Returns `array`.\n   */\n  function arrayEach(array, iteratee) {\n    var index = -1,\n        length = array == null ? 0 : array.length;\n\n    while (++index < length) {\n      if (iteratee(array[index], index, array) === false) {\n        break;\n      }\n    }\n    return array;\n  }\n\n  /**\n   * A specialized version of `_.forEachRight` for arrays without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @returns {Array} Returns `array`.\n   */\n  function arrayEachRight(array, iteratee) {\n    var length = array == null ? 0 : array.length;\n\n    while (length--) {\n      if (iteratee(array[length], length, array) === false) {\n        break;\n      }\n    }\n    return array;\n  }\n\n  /**\n   * A specialized version of `_.every` for arrays without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} predicate The function invoked per iteration.\n   * @returns {boolean} Returns `true` if all elements pass the predicate check,\n   *  else `false`.\n   */\n  function arrayEvery(array, predicate) {\n    var index = -1,\n        length = array == null ? 0 : array.length;\n\n    while (++index < length) {\n      if (!predicate(array[index], index, array)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  /**\n   * A specialized version of `_.filter` for arrays without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} predicate The function invoked per iteration.\n   * @returns {Array} Returns the new filtered array.\n   */\n  function arrayFilter(array, predicate) {\n    var index = -1,\n        length = array == null ? 0 : array.length,\n        resIndex = 0,\n        result = [];\n\n    while (++index < length) {\n      var value = array[index];\n      if (predicate(value, index, array)) {\n        result[resIndex++] = value;\n      }\n    }\n    return result;\n  }\n\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   */\n  function arrayIncludes(array, value) {\n    var length = array == null ? 0 : array.length;\n    return !!length && baseIndexOf(array, value, 0) > -1;\n  }\n\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   */\n  function 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\n  /**\n   * A specialized version of `_.map` for arrays without support for iteratee\n   * shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @returns {Array} Returns the new mapped array.\n   */\n  function arrayMap(array, iteratee) {\n    var index = -1,\n        length = array == null ? 0 : array.length,\n        result = Array(length);\n\n    while (++index < length) {\n      result[index] = iteratee(array[index], index, array);\n    }\n    return result;\n  }\n\n  /**\n   * Appends the elements of `values` to `array`.\n   *\n   * @private\n   * @param {Array} array The array to modify.\n   * @param {Array} values The values to append.\n   * @returns {Array} Returns `array`.\n   */\n  function arrayPush(array, values) {\n    var index = -1,\n        length = values.length,\n        offset = array.length;\n\n    while (++index < length) {\n      array[offset + index] = values[index];\n    }\n    return array;\n  }\n\n  /**\n   * A specialized version of `_.reduce` for arrays without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @param {*} [accumulator] The initial value.\n   * @param {boolean} [initAccum] Specify using the first element of `array` as\n   *  the initial value.\n   * @returns {*} Returns the accumulated value.\n   */\n  function arrayReduce(array, iteratee, accumulator, initAccum) {\n    var index = -1,\n        length = array == null ? 0 : array.length;\n\n    if (initAccum && length) {\n      accumulator = array[++index];\n    }\n    while (++index < length) {\n      accumulator = iteratee(accumulator, array[index], index, array);\n    }\n    return accumulator;\n  }\n\n  /**\n   * A specialized version of `_.reduceRight` for arrays without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @param {*} [accumulator] The initial value.\n   * @param {boolean} [initAccum] Specify using the last element of `array` as\n   *  the initial value.\n   * @returns {*} Returns the accumulated value.\n   */\n  function arrayReduceRight(array, iteratee, accumulator, initAccum) {\n    var length = array == null ? 0 : array.length;\n    if (initAccum && length) {\n      accumulator = array[--length];\n    }\n    while (length--) {\n      accumulator = iteratee(accumulator, array[length], length, array);\n    }\n    return accumulator;\n  }\n\n  /**\n   * A specialized version of `_.some` for arrays without support for iteratee\n   * shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} predicate The function invoked per iteration.\n   * @returns {boolean} Returns `true` if any element passes the predicate check,\n   *  else `false`.\n   */\n  function arraySome(array, predicate) {\n    var index = -1,\n        length = array == null ? 0 : array.length;\n\n    while (++index < length) {\n      if (predicate(array[index], index, array)) {\n        return true;\n      }\n    }\n    return false;\n  }\n\n  /**\n   * Gets the size of an ASCII `string`.\n   *\n   * @private\n   * @param {string} string The string inspect.\n   * @returns {number} Returns the string size.\n   */\n  var asciiSize = baseProperty('length');\n\n  /**\n   * Converts an ASCII `string` to an array.\n   *\n   * @private\n   * @param {string} string The string to convert.\n   * @returns {Array} Returns the converted array.\n   */\n  function asciiToArray(string) {\n    return string.split('');\n  }\n\n  /**\n   * Splits an ASCII `string` into an array of its words.\n   *\n   * @private\n   * @param {string} The string to inspect.\n   * @returns {Array} Returns the words of `string`.\n   */\n  function asciiWords(string) {\n    return string.match(reAsciiWord) || [];\n  }\n\n  /**\n   * The base implementation of methods like `_.findKey` and `_.findLastKey`,\n   * without support for iteratee shorthands, which iterates over `collection`\n   * using `eachFunc`.\n   *\n   * @private\n   * @param {Array|Object} collection The collection to inspect.\n   * @param {Function} predicate The function invoked per iteration.\n   * @param {Function} eachFunc The function to iterate over `collection`.\n   * @returns {*} Returns the found element or its key, else `undefined`.\n   */\n  function baseFindKey(collection, predicate, eachFunc) {\n    var result;\n    eachFunc(collection, function(value, key, collection) {\n      if (predicate(value, key, collection)) {\n        result = key;\n        return false;\n      }\n    });\n    return result;\n  }\n\n  /**\n   * The base implementation of `_.findIndex` and `_.findLastIndex` without\n   * support for iteratee shorthands.\n   *\n   * @private\n   * @param {Array} array The array to inspect.\n   * @param {Function} predicate The function invoked per iteration.\n   * @param {number} fromIndex The index to search from.\n   * @param {boolean} [fromRight] Specify iterating from right to left.\n   * @returns {number} Returns the index of the matched value, else `-1`.\n   */\n  function baseFindIndex(array, predicate, fromIndex, fromRight) {\n    var length = array.length,\n        index = fromIndex + (fromRight ? 1 : -1);\n\n    while ((fromRight ? index-- : ++index < length)) {\n      if (predicate(array[index], index, array)) {\n        return index;\n      }\n    }\n    return -1;\n  }\n\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   */\n  function baseIndexOf(array, value, fromIndex) {\n    return value === value\n      ? strictIndexOf(array, value, fromIndex)\n      : baseFindIndex(array, baseIsNaN, fromIndex);\n  }\n\n  /**\n   * This function is like `baseIndexOf` except that it accepts a comparator.\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   * @param {Function} comparator The comparator invoked per element.\n   * @returns {number} Returns the index of the matched value, else `-1`.\n   */\n  function baseIndexOfWith(array, value, fromIndex, comparator) {\n    var index = fromIndex - 1,\n        length = array.length;\n\n    while (++index < length) {\n      if (comparator(array[index], value)) {\n        return index;\n      }\n    }\n    return -1;\n  }\n\n  /**\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   */\n  function baseIsNaN(value) {\n    return value !== value;\n  }\n\n  /**\n   * The base implementation of `_.mean` and `_.meanBy` without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} array The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @returns {number} Returns the mean.\n   */\n  function baseMean(array, iteratee) {\n    var length = array == null ? 0 : array.length;\n    return length ? (baseSum(array, iteratee) / length) : NAN;\n  }\n\n  /**\n   * The base implementation of `_.property` without support for deep paths.\n   *\n   * @private\n   * @param {string} key The key of the property to get.\n   * @returns {Function} Returns the new accessor function.\n   */\n  function baseProperty(key) {\n    return function(object) {\n      return object == null ? undefined : object[key];\n    };\n  }\n\n  /**\n   * The base implementation of `_.propertyOf` without support for deep paths.\n   *\n   * @private\n   * @param {Object} object The object to query.\n   * @returns {Function} Returns the new accessor function.\n   */\n  function basePropertyOf(object) {\n    return function(key) {\n      return object == null ? undefined : object[key];\n    };\n  }\n\n  /**\n   * The base implementation of `_.reduce` and `_.reduceRight`, without support\n   * for iteratee shorthands, which iterates over `collection` using `eachFunc`.\n   *\n   * @private\n   * @param {Array|Object} collection The collection to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @param {*} accumulator The initial value.\n   * @param {boolean} initAccum Specify using the first or last element of\n   *  `collection` as the initial value.\n   * @param {Function} eachFunc The function to iterate over `collection`.\n   * @returns {*} Returns the accumulated value.\n   */\n  function baseReduce(collection, iteratee, accumulator, initAccum, eachFunc) {\n    eachFunc(collection, function(value, index, collection) {\n      accumulator = initAccum\n        ? (initAccum = false, value)\n        : iteratee(accumulator, value, index, collection);\n    });\n    return accumulator;\n  }\n\n  /**\n   * The base implementation of `_.sortBy` which uses `comparer` to define the\n   * sort order of `array` and replaces criteria objects with their corresponding\n   * values.\n   *\n   * @private\n   * @param {Array} array The array to sort.\n   * @param {Function} comparer The function to define sort order.\n   * @returns {Array} Returns `array`.\n   */\n  function baseSortBy(array, comparer) {\n    var length = array.length;\n\n    array.sort(comparer);\n    while (length--) {\n      array[length] = array[length].value;\n    }\n    return array;\n  }\n\n  /**\n   * The base implementation of `_.sum` and `_.sumBy` without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} array The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @returns {number} Returns the sum.\n   */\n  function baseSum(array, iteratee) {\n    var result,\n        index = -1,\n        length = array.length;\n\n    while (++index < length) {\n      var current = iteratee(array[index]);\n      if (current !== undefined) {\n        result = result === undefined ? current : (result + current);\n      }\n    }\n    return result;\n  }\n\n  /**\n   * The base implementation of `_.times` without support for iteratee shorthands\n   * or max array length checks.\n   *\n   * @private\n   * @param {number} n The number of times to invoke `iteratee`.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @returns {Array} Returns the array of results.\n   */\n  function baseTimes(n, iteratee) {\n    var index = -1,\n        result = Array(n);\n\n    while (++index < n) {\n      result[index] = iteratee(index);\n    }\n    return result;\n  }\n\n  /**\n   * The base implementation of `_.toPairs` and `_.toPairsIn` which creates an array\n   * of key-value pairs for `object` corresponding to the property names of `props`.\n   *\n   * @private\n   * @param {Object} object The object to query.\n   * @param {Array} props The property names to get values for.\n   * @returns {Object} Returns the key-value pairs.\n   */\n  function baseToPairs(object, props) {\n    return arrayMap(props, function(key) {\n      return [key, object[key]];\n    });\n  }\n\n  /**\n   * The base implementation of `_.trim`.\n   *\n   * @private\n   * @param {string} string The string to trim.\n   * @returns {string} Returns the trimmed string.\n   */\n  function baseTrim(string) {\n    return string\n      ? string.slice(0, trimmedEndIndex(string) + 1).replace(reTrimStart, '')\n      : string;\n  }\n\n  /**\n   * The base implementation of `_.unary` without support for storing metadata.\n   *\n   * @private\n   * @param {Function} func The function to cap arguments for.\n   * @returns {Function} Returns the new capped function.\n   */\n  function baseUnary(func) {\n    return function(value) {\n      return func(value);\n    };\n  }\n\n  /**\n   * The base implementation of `_.values` and `_.valuesIn` which creates an\n   * array of `object` property values corresponding to the property names\n   * of `props`.\n   *\n   * @private\n   * @param {Object} object The object to query.\n   * @param {Array} props The property names to get values for.\n   * @returns {Object} Returns the array of property values.\n   */\n  function baseValues(object, props) {\n    return arrayMap(props, function(key) {\n      return object[key];\n    });\n  }\n\n  /**\n   * Checks if a `cache` value for `key` exists.\n   *\n   * @private\n   * @param {Object} cache The cache to query.\n   * @param {string} key The key of the entry to check.\n   * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n   */\n  function cacheHas(cache, key) {\n    return cache.has(key);\n  }\n\n  /**\n   * Used by `_.trim` and `_.trimStart` to get the index of the first string symbol\n   * that is not found in the character symbols.\n   *\n   * @private\n   * @param {Array} strSymbols The string symbols to inspect.\n   * @param {Array} chrSymbols The character symbols to find.\n   * @returns {number} Returns the index of the first unmatched string symbol.\n   */\n  function charsStartIndex(strSymbols, chrSymbols) {\n    var index = -1,\n        length = strSymbols.length;\n\n    while (++index < length && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}\n    return index;\n  }\n\n  /**\n   * Used by `_.trim` and `_.trimEnd` to get the index of the last string symbol\n   * that is not found in the character symbols.\n   *\n   * @private\n   * @param {Array} strSymbols The string symbols to inspect.\n   * @param {Array} chrSymbols The character symbols to find.\n   * @returns {number} Returns the index of the last unmatched string symbol.\n   */\n  function charsEndIndex(strSymbols, chrSymbols) {\n    var index = strSymbols.length;\n\n    while (index-- && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}\n    return index;\n  }\n\n  /**\n   * Gets the number of `placeholder` occurrences in `array`.\n   *\n   * @private\n   * @param {Array} array The array to inspect.\n   * @param {*} placeholder The placeholder to search for.\n   * @returns {number} Returns the placeholder count.\n   */\n  function countHolders(array, placeholder) {\n    var length = array.length,\n        result = 0;\n\n    while (length--) {\n      if (array[length] === placeholder) {\n        ++result;\n      }\n    }\n    return result;\n  }\n\n  /**\n   * Used by `_.deburr` to convert Latin-1 Supplement and Latin Extended-A\n   * letters to basic Latin letters.\n   *\n   * @private\n   * @param {string} letter The matched letter to deburr.\n   * @returns {string} Returns the deburred letter.\n   */\n  var deburrLetter = basePropertyOf(deburredLetters);\n\n  /**\n   * Used by `_.escape` to convert characters to HTML entities.\n   *\n   * @private\n   * @param {string} chr The matched character to escape.\n   * @returns {string} Returns the escaped character.\n   */\n  var escapeHtmlChar = basePropertyOf(htmlEscapes);\n\n  /**\n   * Used by `_.template` to escape characters for inclusion in compiled string literals.\n   *\n   * @private\n   * @param {string} chr The matched character to escape.\n   * @returns {string} Returns the escaped character.\n   */\n  function escapeStringChar(chr) {\n    return '\\\\' + stringEscapes[chr];\n  }\n\n  /**\n   * Gets the value at `key` of `object`.\n   *\n   * @private\n   * @param {Object} [object] The object to query.\n   * @param {string} key The key of the property to get.\n   * @returns {*} Returns the property value.\n   */\n  function getValue(object, key) {\n    return object == null ? undefined : object[key];\n  }\n\n  /**\n   * Checks if `string` contains Unicode symbols.\n   *\n   * @private\n   * @param {string} string The string to inspect.\n   * @returns {boolean} Returns `true` if a symbol is found, else `false`.\n   */\n  function hasUnicode(string) {\n    return reHasUnicode.test(string);\n  }\n\n  /**\n   * Checks if `string` contains a word composed of Unicode symbols.\n   *\n   * @private\n   * @param {string} string The string to inspect.\n   * @returns {boolean} Returns `true` if a word is found, else `false`.\n   */\n  function hasUnicodeWord(string) {\n    return reHasUnicodeWord.test(string);\n  }\n\n  /**\n   * Converts `iterator` to an array.\n   *\n   * @private\n   * @param {Object} iterator The iterator to convert.\n   * @returns {Array} Returns the converted array.\n   */\n  function iteratorToArray(iterator) {\n    var data,\n        result = [];\n\n    while (!(data = iterator.next()).done) {\n      result.push(data.value);\n    }\n    return result;\n  }\n\n  /**\n   * Converts `map` to its key-value pairs.\n   *\n   * @private\n   * @param {Object} map The map to convert.\n   * @returns {Array} Returns the key-value pairs.\n   */\n  function mapToArray(map) {\n    var index = -1,\n        result = Array(map.size);\n\n    map.forEach(function(value, key) {\n      result[++index] = [key, value];\n    });\n    return result;\n  }\n\n  /**\n   * Creates a unary function that invokes `func` with its argument transformed.\n   *\n   * @private\n   * @param {Function} func The function to wrap.\n   * @param {Function} transform The argument transform.\n   * @returns {Function} Returns the new function.\n   */\n  function overArg(func, transform) {\n    return function(arg) {\n      return func(transform(arg));\n    };\n  }\n\n  /**\n   * Replaces all `placeholder` elements in `array` with an internal placeholder\n   * and returns an array of their indexes.\n   *\n   * @private\n   * @param {Array} array The array to modify.\n   * @param {*} placeholder The placeholder to replace.\n   * @returns {Array} Returns the new array of placeholder indexes.\n   */\n  function replaceHolders(array, placeholder) {\n    var index = -1,\n        length = array.length,\n        resIndex = 0,\n        result = [];\n\n    while (++index < length) {\n      var value = array[index];\n      if (value === placeholder || value === PLACEHOLDER) {\n        array[index] = PLACEHOLDER;\n        result[resIndex++] = index;\n      }\n    }\n    return result;\n  }\n\n  /**\n   * Converts `set` to an array of its values.\n   *\n   * @private\n   * @param {Object} set The set to convert.\n   * @returns {Array} Returns the values.\n   */\n  function setToArray(set) {\n    var index = -1,\n        result = Array(set.size);\n\n    set.forEach(function(value) {\n      result[++index] = value;\n    });\n    return result;\n  }\n\n  /**\n   * Converts `set` to its value-value pairs.\n   *\n   * @private\n   * @param {Object} set The set to convert.\n   * @returns {Array} Returns the value-value pairs.\n   */\n  function setToPairs(set) {\n    var index = -1,\n        result = Array(set.size);\n\n    set.forEach(function(value) {\n      result[++index] = [value, value];\n    });\n    return result;\n  }\n\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   */\n  function 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\n  /**\n   * A specialized version of `_.lastIndexOf` 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   */\n  function strictLastIndexOf(array, value, fromIndex) {\n    var index = fromIndex + 1;\n    while (index--) {\n      if (array[index] === value) {\n        return index;\n      }\n    }\n    return index;\n  }\n\n  /**\n   * Gets the number of symbols in `string`.\n   *\n   * @private\n   * @param {string} string The string to inspect.\n   * @returns {number} Returns the string size.\n   */\n  function stringSize(string) {\n    return hasUnicode(string)\n      ? unicodeSize(string)\n      : asciiSize(string);\n  }\n\n  /**\n   * Converts `string` to an array.\n   *\n   * @private\n   * @param {string} string The string to convert.\n   * @returns {Array} Returns the converted array.\n   */\n  function stringToArray(string) {\n    return hasUnicode(string)\n      ? unicodeToArray(string)\n      : asciiToArray(string);\n  }\n\n  /**\n   * Used by `_.trim` and `_.trimEnd` to get the index of the last non-whitespace\n   * character of `string`.\n   *\n   * @private\n   * @param {string} string The string to inspect.\n   * @returns {number} Returns the index of the last non-whitespace character.\n   */\n  function trimmedEndIndex(string) {\n    var index = string.length;\n\n    while (index-- && reWhitespace.test(string.charAt(index))) {}\n    return index;\n  }\n\n  /**\n   * Used by `_.unescape` to convert HTML entities to characters.\n   *\n   * @private\n   * @param {string} chr The matched character to unescape.\n   * @returns {string} Returns the unescaped character.\n   */\n  var unescapeHtmlChar = basePropertyOf(htmlUnescapes);\n\n  /**\n   * Gets the size of a Unicode `string`.\n   *\n   * @private\n   * @param {string} string The string inspect.\n   * @returns {number} Returns the string size.\n   */\n  function unicodeSize(string) {\n    var result = reUnicode.lastIndex = 0;\n    while (reUnicode.test(string)) {\n      ++result;\n    }\n    return result;\n  }\n\n  /**\n   * Converts a Unicode `string` to an array.\n   *\n   * @private\n   * @param {string} string The string to convert.\n   * @returns {Array} Returns the converted array.\n   */\n  function unicodeToArray(string) {\n    return string.match(reUnicode) || [];\n  }\n\n  /**\n   * Splits a Unicode `string` into an array of its words.\n   *\n   * @private\n   * @param {string} The string to inspect.\n   * @returns {Array} Returns the words of `string`.\n   */\n  function unicodeWords(string) {\n    return string.match(reUnicodeWord) || [];\n  }\n\n  /*--------------------------------------------------------------------------*/\n\n  /**\n   * Create a new pristine `lodash` function using the `context` object.\n   *\n   * @static\n   * @memberOf _\n   * @since 1.1.0\n   * @category Util\n   * @param {Object} [context=root] The context object.\n   * @returns {Function} Returns a new `lodash` function.\n   * @example\n   *\n   * _.mixin({ 'foo': _.constant('foo') });\n   *\n   * var lodash = _.runInContext();\n   * lodash.mixin({ 'bar': lodash.constant('bar') });\n   *\n   * _.isFunction(_.foo);\n   * // => true\n   * _.isFunction(_.bar);\n   * // => false\n   *\n   * lodash.isFunction(lodash.foo);\n   * // => false\n   * lodash.isFunction(lodash.bar);\n   * // => true\n   *\n   * // Create a suped-up `defer` in Node.js.\n   * var defer = _.runInContext({ 'setTimeout': setImmediate }).defer;\n   */\n  var runInContext = (function runInContext(context) {\n    context = context == null ? root : _.defaults(root.Object(), context, _.pick(root, contextProps));\n\n    /** Built-in constructor references. */\n    var Array = context.Array,\n        Date = context.Date,\n        Error = context.Error,\n        Function = context.Function,\n        Math = context.Math,\n        Object = context.Object,\n        RegExp = context.RegExp,\n        String = context.String,\n        TypeError = context.TypeError;\n\n    /** Used for built-in method references. */\n    var arrayProto = Array.prototype,\n        funcProto = Function.prototype,\n        objectProto = Object.prototype;\n\n    /** Used to detect overreaching core-js shims. */\n    var coreJsData = context['__core-js_shared__'];\n\n    /** Used to resolve the decompiled source of functions. */\n    var funcToString = funcProto.toString;\n\n    /** Used to check objects for own properties. */\n    var hasOwnProperty = objectProto.hasOwnProperty;\n\n    /** Used to generate unique IDs. */\n    var idCounter = 0;\n\n    /** Used to detect methods masquerading as native. */\n    var maskSrcKey = (function() {\n      var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n      return uid ? ('Symbol(src)_1.' + uid) : '';\n    }());\n\n    /**\n     * Used to resolve the\n     * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n     * of values.\n     */\n    var nativeObjectToString = objectProto.toString;\n\n    /** Used to infer the `Object` constructor. */\n    var objectCtorString = funcToString.call(Object);\n\n    /** Used to restore the original `_` reference in `_.noConflict`. */\n    var oldDash = root._;\n\n    /** Used to detect if a method is native. */\n    var reIsNative = RegExp('^' +\n      funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n      .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n    );\n\n    /** Built-in value references. */\n    var Buffer = moduleExports ? context.Buffer : undefined,\n        Symbol = context.Symbol,\n        Uint8Array = context.Uint8Array,\n        allocUnsafe = Buffer ? Buffer.allocUnsafe : undefined,\n        getPrototype = overArg(Object.getPrototypeOf, Object),\n        objectCreate = Object.create,\n        propertyIsEnumerable = objectProto.propertyIsEnumerable,\n        splice = arrayProto.splice,\n        spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined,\n        symIterator = Symbol ? Symbol.iterator : undefined,\n        symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n    var defineProperty = (function() {\n      try {\n        var func = getNative(Object, 'defineProperty');\n        func({}, '', {});\n        return func;\n      } catch (e) {}\n    }());\n\n    /** Mocked built-ins. */\n    var ctxClearTimeout = context.clearTimeout !== root.clearTimeout && context.clearTimeout,\n        ctxNow = Date && Date.now !== root.Date.now && Date.now,\n        ctxSetTimeout = context.setTimeout !== root.setTimeout && context.setTimeout;\n\n    /* Built-in method references for those with the same name as other `lodash` methods. */\n    var nativeCeil = Math.ceil,\n        nativeFloor = Math.floor,\n        nativeGetSymbols = Object.getOwnPropertySymbols,\n        nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined,\n        nativeIsFinite = context.isFinite,\n        nativeJoin = arrayProto.join,\n        nativeKeys = overArg(Object.keys, Object),\n        nativeMax = Math.max,\n        nativeMin = Math.min,\n        nativeNow = Date.now,\n        nativeParseInt = context.parseInt,\n        nativeRandom = Math.random,\n        nativeReverse = arrayProto.reverse;\n\n    /* Built-in method references that are verified to be native. */\n    var DataView = getNative(context, 'DataView'),\n        Map = getNative(context, 'Map'),\n        Promise = getNative(context, 'Promise'),\n        Set = getNative(context, 'Set'),\n        WeakMap = getNative(context, 'WeakMap'),\n        nativeCreate = getNative(Object, 'create');\n\n    /** Used to store function metadata. */\n    var metaMap = WeakMap && new WeakMap;\n\n    /** Used to lookup unminified function names. */\n    var realNames = {};\n\n    /** Used to detect maps, sets, and weakmaps. */\n    var dataViewCtorString = toSource(DataView),\n        mapCtorString = toSource(Map),\n        promiseCtorString = toSource(Promise),\n        setCtorString = toSource(Set),\n        weakMapCtorString = toSource(WeakMap);\n\n    /** Used to convert symbols to primitives and strings. */\n    var symbolProto = Symbol ? Symbol.prototype : undefined,\n        symbolValueOf = symbolProto ? symbolProto.valueOf : undefined,\n        symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates a `lodash` object which wraps `value` to enable implicit method\n     * chain sequences. Methods that operate on and return arrays, collections,\n     * and functions can be chained together. Methods that retrieve a single value\n     * or may return a primitive value will automatically end the chain sequence\n     * and return the unwrapped value. Otherwise, the value must be unwrapped\n     * with `_#value`.\n     *\n     * Explicit chain sequences, which must be unwrapped with `_#value`, may be\n     * enabled using `_.chain`.\n     *\n     * The execution of chained methods is lazy, that is, it's deferred until\n     * `_#value` is implicitly or explicitly called.\n     *\n     * Lazy evaluation allows several methods to support shortcut fusion.\n     * Shortcut fusion is an optimization to merge iteratee calls; this avoids\n     * the creation of intermediate arrays and can greatly reduce the number of\n     * iteratee executions. Sections of a chain sequence qualify for shortcut\n     * fusion if the section is applied to an array and iteratees accept only\n     * one argument. The heuristic for whether a section qualifies for shortcut\n     * fusion is subject to change.\n     *\n     * Chaining is supported in custom builds as long as the `_#value` method is\n     * directly or indirectly included in the build.\n     *\n     * In addition to lodash methods, wrappers have `Array` and `String` methods.\n     *\n     * The wrapper `Array` methods are:\n     * `concat`, `join`, `pop`, `push`, `shift`, `sort`, `splice`, and `unshift`\n     *\n     * The wrapper `String` methods are:\n     * `replace` and `split`\n     *\n     * The wrapper methods that support shortcut fusion are:\n     * `at`, `compact`, `drop`, `dropRight`, `dropWhile`, `filter`, `find`,\n     * `findLast`, `head`, `initial`, `last`, `map`, `reject`, `reverse`, `slice`,\n     * `tail`, `take`, `takeRight`, `takeRightWhile`, `takeWhile`, and `toArray`\n     *\n     * The chainable wrapper methods are:\n     * `after`, `ary`, `assign`, `assignIn`, `assignInWith`, `assignWith`, `at`,\n     * `before`, `bind`, `bindAll`, `bindKey`, `castArray`, `chain`, `chunk`,\n     * `commit`, `compact`, `concat`, `conforms`, `constant`, `countBy`, `create`,\n     * `curry`, `debounce`, `defaults`, `defaultsDeep`, `defer`, `delay`,\n     * `difference`, `differenceBy`, `differenceWith`, `drop`, `dropRight`,\n     * `dropRightWhile`, `dropWhile`, `extend`, `extendWith`, `fill`, `filter`,\n     * `flatMap`, `flatMapDeep`, `flatMapDepth`, `flatten`, `flattenDeep`,\n     * `flattenDepth`, `flip`, `flow`, `flowRight`, `fromPairs`, `functions`,\n     * `functionsIn`, `groupBy`, `initial`, `intersection`, `intersectionBy`,\n     * `intersectionWith`, `invert`, `invertBy`, `invokeMap`, `iteratee`, `keyBy`,\n     * `keys`, `keysIn`, `map`, `mapKeys`, `mapValues`, `matches`, `matchesProperty`,\n     * `memoize`, `merge`, `mergeWith`, `method`, `methodOf`, `mixin`, `negate`,\n     * `nthArg`, `omit`, `omitBy`, `once`, `orderBy`, `over`, `overArgs`,\n     * `overEvery`, `overSome`, `partial`, `partialRight`, `partition`, `pick`,\n     * `pickBy`, `plant`, `property`, `propertyOf`, `pull`, `pullAll`, `pullAllBy`,\n     * `pullAllWith`, `pullAt`, `push`, `range`, `rangeRight`, `rearg`, `reject`,\n     * `remove`, `rest`, `reverse`, `sampleSize`, `set`, `setWith`, `shuffle`,\n     * `slice`, `sort`, `sortBy`, `splice`, `spread`, `tail`, `take`, `takeRight`,\n     * `takeRightWhile`, `takeWhile`, `tap`, `throttle`, `thru`, `toArray`,\n     * `toPairs`, `toPairsIn`, `toPath`, `toPlainObject`, `transform`, `unary`,\n     * `union`, `unionBy`, `unionWith`, `uniq`, `uniqBy`, `uniqWith`, `unset`,\n     * `unshift`, `unzip`, `unzipWith`, `update`, `updateWith`, `values`,\n     * `valuesIn`, `without`, `wrap`, `xor`, `xorBy`, `xorWith`, `zip`,\n     * `zipObject`, `zipObjectDeep`, and `zipWith`\n     *\n     * The wrapper methods that are **not** chainable by default are:\n     * `add`, `attempt`, `camelCase`, `capitalize`, `ceil`, `clamp`, `clone`,\n     * `cloneDeep`, `cloneDeepWith`, `cloneWith`, `conformsTo`, `deburr`,\n     * `defaultTo`, `divide`, `each`, `eachRight`, `endsWith`, `eq`, `escape`,\n     * `escapeRegExp`, `every`, `find`, `findIndex`, `findKey`, `findLast`,\n     * `findLastIndex`, `findLastKey`, `first`, `floor`, `forEach`, `forEachRight`,\n     * `forIn`, `forInRight`, `forOwn`, `forOwnRight`, `get`, `gt`, `gte`, `has`,\n     * `hasIn`, `head`, `identity`, `includes`, `indexOf`, `inRange`, `invoke`,\n     * `isArguments`, `isArray`, `isArrayBuffer`, `isArrayLike`, `isArrayLikeObject`,\n     * `isBoolean`, `isBuffer`, `isDate`, `isElement`, `isEmpty`, `isEqual`,\n     * `isEqualWith`, `isError`, `isFinite`, `isFunction`, `isInteger`, `isLength`,\n     * `isMap`, `isMatch`, `isMatchWith`, `isNaN`, `isNative`, `isNil`, `isNull`,\n     * `isNumber`, `isObject`, `isObjectLike`, `isPlainObject`, `isRegExp`,\n     * `isSafeInteger`, `isSet`, `isString`, `isUndefined`, `isTypedArray`,\n     * `isWeakMap`, `isWeakSet`, `join`, `kebabCase`, `last`, `lastIndexOf`,\n     * `lowerCase`, `lowerFirst`, `lt`, `lte`, `max`, `maxBy`, `mean`, `meanBy`,\n     * `min`, `minBy`, `multiply`, `noConflict`, `noop`, `now`, `nth`, `pad`,\n     * `padEnd`, `padStart`, `parseInt`, `pop`, `random`, `reduce`, `reduceRight`,\n     * `repeat`, `result`, `round`, `runInContext`, `sample`, `shift`, `size`,\n     * `snakeCase`, `some`, `sortedIndex`, `sortedIndexBy`, `sortedLastIndex`,\n     * `sortedLastIndexBy`, `startCase`, `startsWith`, `stubArray`, `stubFalse`,\n     * `stubObject`, `stubString`, `stubTrue`, `subtract`, `sum`, `sumBy`,\n     * `template`, `times`, `toFinite`, `toInteger`, `toJSON`, `toLength`,\n     * `toLower`, `toNumber`, `toSafeInteger`, `toString`, `toUpper`, `trim`,\n     * `trimEnd`, `trimStart`, `truncate`, `unescape`, `uniqueId`, `upperCase`,\n     * `upperFirst`, `value`, and `words`\n     *\n     * @name _\n     * @constructor\n     * @category Seq\n     * @param {*} value The value to wrap in a `lodash` instance.\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * function square(n) {\n     *   return n * n;\n     * }\n     *\n     * var wrapped = _([1, 2, 3]);\n     *\n     * // Returns an unwrapped value.\n     * wrapped.reduce(_.add);\n     * // => 6\n     *\n     * // Returns a wrapped value.\n     * var squares = wrapped.map(square);\n     *\n     * _.isArray(squares);\n     * // => false\n     *\n     * _.isArray(squares.value());\n     * // => true\n     */\n    function lodash(value) {\n      if (isObjectLike(value) && !isArray(value) && !(value instanceof LazyWrapper)) {\n        if (value instanceof LodashWrapper) {\n          return value;\n        }\n        if (hasOwnProperty.call(value, '__wrapped__')) {\n          return wrapperClone(value);\n        }\n      }\n      return new LodashWrapper(value);\n    }\n\n    /**\n     * The base implementation of `_.create` without support for assigning\n     * properties to the created object.\n     *\n     * @private\n     * @param {Object} proto The object to inherit from.\n     * @returns {Object} Returns the new object.\n     */\n    var baseCreate = (function() {\n      function object() {}\n      return function(proto) {\n        if (!isObject(proto)) {\n          return {};\n        }\n        if (objectCreate) {\n          return objectCreate(proto);\n        }\n        object.prototype = proto;\n        var result = new object;\n        object.prototype = undefined;\n        return result;\n      };\n    }());\n\n    /**\n     * The function whose prototype chain sequence wrappers inherit from.\n     *\n     * @private\n     */\n    function baseLodash() {\n      // No operation performed.\n    }\n\n    /**\n     * The base constructor for creating `lodash` wrapper objects.\n     *\n     * @private\n     * @param {*} value The value to wrap.\n     * @param {boolean} [chainAll] Enable explicit method chain sequences.\n     */\n    function LodashWrapper(value, chainAll) {\n      this.__wrapped__ = value;\n      this.__actions__ = [];\n      this.__chain__ = !!chainAll;\n      this.__index__ = 0;\n      this.__values__ = undefined;\n    }\n\n    /**\n     * By default, the template delimiters used by lodash are like those in\n     * embedded Ruby (ERB) as well as ES2015 template strings. Change the\n     * following template settings to use alternative delimiters.\n     *\n     * @static\n     * @memberOf _\n     * @type {Object}\n     */\n    lodash.templateSettings = {\n\n      /**\n       * Used to detect `data` property values to be HTML-escaped.\n       *\n       * @memberOf _.templateSettings\n       * @type {RegExp}\n       */\n      'escape': reEscape,\n\n      /**\n       * Used to detect code to be evaluated.\n       *\n       * @memberOf _.templateSettings\n       * @type {RegExp}\n       */\n      'evaluate': reEvaluate,\n\n      /**\n       * Used to detect `data` property values to inject.\n       *\n       * @memberOf _.templateSettings\n       * @type {RegExp}\n       */\n      'interpolate': reInterpolate,\n\n      /**\n       * Used to reference the data object in the template text.\n       *\n       * @memberOf _.templateSettings\n       * @type {string}\n       */\n      'variable': '',\n\n      /**\n       * Used to import variables into the compiled template.\n       *\n       * @memberOf _.templateSettings\n       * @type {Object}\n       */\n      'imports': {\n\n        /**\n         * A reference to the `lodash` function.\n         *\n         * @memberOf _.templateSettings.imports\n         * @type {Function}\n         */\n        '_': lodash\n      }\n    };\n\n    // Ensure wrappers are instances of `baseLodash`.\n    lodash.prototype = baseLodash.prototype;\n    lodash.prototype.constructor = lodash;\n\n    LodashWrapper.prototype = baseCreate(baseLodash.prototype);\n    LodashWrapper.prototype.constructor = LodashWrapper;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates a lazy wrapper object which wraps `value` to enable lazy evaluation.\n     *\n     * @private\n     * @constructor\n     * @param {*} value The value to wrap.\n     */\n    function LazyWrapper(value) {\n      this.__wrapped__ = value;\n      this.__actions__ = [];\n      this.__dir__ = 1;\n      this.__filtered__ = false;\n      this.__iteratees__ = [];\n      this.__takeCount__ = MAX_ARRAY_LENGTH;\n      this.__views__ = [];\n    }\n\n    /**\n     * Creates a clone of the lazy wrapper object.\n     *\n     * @private\n     * @name clone\n     * @memberOf LazyWrapper\n     * @returns {Object} Returns the cloned `LazyWrapper` object.\n     */\n    function lazyClone() {\n      var result = new LazyWrapper(this.__wrapped__);\n      result.__actions__ = copyArray(this.__actions__);\n      result.__dir__ = this.__dir__;\n      result.__filtered__ = this.__filtered__;\n      result.__iteratees__ = copyArray(this.__iteratees__);\n      result.__takeCount__ = this.__takeCount__;\n      result.__views__ = copyArray(this.__views__);\n      return result;\n    }\n\n    /**\n     * Reverses the direction of lazy iteration.\n     *\n     * @private\n     * @name reverse\n     * @memberOf LazyWrapper\n     * @returns {Object} Returns the new reversed `LazyWrapper` object.\n     */\n    function lazyReverse() {\n      if (this.__filtered__) {\n        var result = new LazyWrapper(this);\n        result.__dir__ = -1;\n        result.__filtered__ = true;\n      } else {\n        result = this.clone();\n        result.__dir__ *= -1;\n      }\n      return result;\n    }\n\n    /**\n     * Extracts the unwrapped value from its lazy wrapper.\n     *\n     * @private\n     * @name value\n     * @memberOf LazyWrapper\n     * @returns {*} Returns the unwrapped value.\n     */\n    function lazyValue() {\n      var array = this.__wrapped__.value(),\n          dir = this.__dir__,\n          isArr = isArray(array),\n          isRight = dir < 0,\n          arrLength = isArr ? array.length : 0,\n          view = getView(0, arrLength, this.__views__),\n          start = view.start,\n          end = view.end,\n          length = end - start,\n          index = isRight ? end : (start - 1),\n          iteratees = this.__iteratees__,\n          iterLength = iteratees.length,\n          resIndex = 0,\n          takeCount = nativeMin(length, this.__takeCount__);\n\n      if (!isArr || (!isRight && arrLength == length && takeCount == length)) {\n        return baseWrapperValue(array, this.__actions__);\n      }\n      var result = [];\n\n      outer:\n      while (length-- && resIndex < takeCount) {\n        index += dir;\n\n        var iterIndex = -1,\n            value = array[index];\n\n        while (++iterIndex < iterLength) {\n          var data = iteratees[iterIndex],\n              iteratee = data.iteratee,\n              type = data.type,\n              computed = iteratee(value);\n\n          if (type == LAZY_MAP_FLAG) {\n            value = computed;\n          } else if (!computed) {\n            if (type == LAZY_FILTER_FLAG) {\n              continue outer;\n            } else {\n              break outer;\n            }\n          }\n        }\n        result[resIndex++] = value;\n      }\n      return result;\n    }\n\n    // Ensure `LazyWrapper` is an instance of `baseLodash`.\n    LazyWrapper.prototype = baseCreate(baseLodash.prototype);\n    LazyWrapper.prototype.constructor = LazyWrapper;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates a hash object.\n     *\n     * @private\n     * @constructor\n     * @param {Array} [entries] The key-value pairs to cache.\n     */\n    function Hash(entries) {\n      var index = -1,\n          length = entries == null ? 0 : entries.length;\n\n      this.clear();\n      while (++index < length) {\n        var entry = entries[index];\n        this.set(entry[0], entry[1]);\n      }\n    }\n\n    /**\n     * Removes all key-value entries from the hash.\n     *\n     * @private\n     * @name clear\n     * @memberOf Hash\n     */\n    function hashClear() {\n      this.__data__ = nativeCreate ? nativeCreate(null) : {};\n      this.size = 0;\n    }\n\n    /**\n     * Removes `key` and its value from the hash.\n     *\n     * @private\n     * @name delete\n     * @memberOf Hash\n     * @param {Object} hash The hash to modify.\n     * @param {string} key The key of the value to remove.\n     * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n     */\n    function hashDelete(key) {\n      var result = this.has(key) && delete this.__data__[key];\n      this.size -= result ? 1 : 0;\n      return result;\n    }\n\n    /**\n     * Gets the hash value for `key`.\n     *\n     * @private\n     * @name get\n     * @memberOf Hash\n     * @param {string} key The key of the value to get.\n     * @returns {*} Returns the entry value.\n     */\n    function hashGet(key) {\n      var data = this.__data__;\n      if (nativeCreate) {\n        var result = data[key];\n        return result === HASH_UNDEFINED ? undefined : result;\n      }\n      return hasOwnProperty.call(data, key) ? data[key] : undefined;\n    }\n\n    /**\n     * Checks if a hash value for `key` exists.\n     *\n     * @private\n     * @name has\n     * @memberOf Hash\n     * @param {string} key The key of the entry to check.\n     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n     */\n    function hashHas(key) {\n      var data = this.__data__;\n      return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);\n    }\n\n    /**\n     * Sets the hash `key` to `value`.\n     *\n     * @private\n     * @name set\n     * @memberOf Hash\n     * @param {string} key The key of the value to set.\n     * @param {*} value The value to set.\n     * @returns {Object} Returns the hash instance.\n     */\n    function hashSet(key, value) {\n      var data = this.__data__;\n      this.size += this.has(key) ? 0 : 1;\n      data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n      return this;\n    }\n\n    // Add methods to `Hash`.\n    Hash.prototype.clear = hashClear;\n    Hash.prototype['delete'] = hashDelete;\n    Hash.prototype.get = hashGet;\n    Hash.prototype.has = hashHas;\n    Hash.prototype.set = hashSet;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates an list cache object.\n     *\n     * @private\n     * @constructor\n     * @param {Array} [entries] The key-value pairs to cache.\n     */\n    function ListCache(entries) {\n      var index = -1,\n          length = entries == null ? 0 : entries.length;\n\n      this.clear();\n      while (++index < length) {\n        var entry = entries[index];\n        this.set(entry[0], entry[1]);\n      }\n    }\n\n    /**\n     * Removes all key-value entries from the list cache.\n     *\n     * @private\n     * @name clear\n     * @memberOf ListCache\n     */\n    function listCacheClear() {\n      this.__data__ = [];\n      this.size = 0;\n    }\n\n    /**\n     * Removes `key` and its value from the list cache.\n     *\n     * @private\n     * @name delete\n     * @memberOf ListCache\n     * @param {string} key The key of the value to remove.\n     * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n     */\n    function listCacheDelete(key) {\n      var data = this.__data__,\n          index = assocIndexOf(data, key);\n\n      if (index < 0) {\n        return false;\n      }\n      var lastIndex = data.length - 1;\n      if (index == lastIndex) {\n        data.pop();\n      } else {\n        splice.call(data, index, 1);\n      }\n      --this.size;\n      return true;\n    }\n\n    /**\n     * Gets the list cache value for `key`.\n     *\n     * @private\n     * @name get\n     * @memberOf ListCache\n     * @param {string} key The key of the value to get.\n     * @returns {*} Returns the entry value.\n     */\n    function listCacheGet(key) {\n      var data = this.__data__,\n          index = assocIndexOf(data, key);\n\n      return index < 0 ? undefined : data[index][1];\n    }\n\n    /**\n     * Checks if a list cache value for `key` exists.\n     *\n     * @private\n     * @name has\n     * @memberOf ListCache\n     * @param {string} key The key of the entry to check.\n     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n     */\n    function listCacheHas(key) {\n      return assocIndexOf(this.__data__, key) > -1;\n    }\n\n    /**\n     * Sets the list cache `key` to `value`.\n     *\n     * @private\n     * @name set\n     * @memberOf ListCache\n     * @param {string} key The key of the value to set.\n     * @param {*} value The value to set.\n     * @returns {Object} Returns the list cache instance.\n     */\n    function listCacheSet(key, value) {\n      var data = this.__data__,\n          index = assocIndexOf(data, key);\n\n      if (index < 0) {\n        ++this.size;\n        data.push([key, value]);\n      } else {\n        data[index][1] = value;\n      }\n      return this;\n    }\n\n    // Add methods to `ListCache`.\n    ListCache.prototype.clear = listCacheClear;\n    ListCache.prototype['delete'] = listCacheDelete;\n    ListCache.prototype.get = listCacheGet;\n    ListCache.prototype.has = listCacheHas;\n    ListCache.prototype.set = listCacheSet;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates a map cache object to store key-value pairs.\n     *\n     * @private\n     * @constructor\n     * @param {Array} [entries] The key-value pairs to cache.\n     */\n    function MapCache(entries) {\n      var index = -1,\n          length = entries == null ? 0 : entries.length;\n\n      this.clear();\n      while (++index < length) {\n        var entry = entries[index];\n        this.set(entry[0], entry[1]);\n      }\n    }\n\n    /**\n     * Removes all key-value entries from the map.\n     *\n     * @private\n     * @name clear\n     * @memberOf MapCache\n     */\n    function mapCacheClear() {\n      this.size = 0;\n      this.__data__ = {\n        'hash': new Hash,\n        'map': new (Map || ListCache),\n        'string': new Hash\n      };\n    }\n\n    /**\n     * Removes `key` and its value from the map.\n     *\n     * @private\n     * @name delete\n     * @memberOf MapCache\n     * @param {string} key The key of the value to remove.\n     * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n     */\n    function mapCacheDelete(key) {\n      var result = getMapData(this, key)['delete'](key);\n      this.size -= result ? 1 : 0;\n      return result;\n    }\n\n    /**\n     * Gets the map value for `key`.\n     *\n     * @private\n     * @name get\n     * @memberOf MapCache\n     * @param {string} key The key of the value to get.\n     * @returns {*} Returns the entry value.\n     */\n    function mapCacheGet(key) {\n      return getMapData(this, key).get(key);\n    }\n\n    /**\n     * Checks if a map value for `key` exists.\n     *\n     * @private\n     * @name has\n     * @memberOf MapCache\n     * @param {string} key The key of the entry to check.\n     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n     */\n    function mapCacheHas(key) {\n      return getMapData(this, key).has(key);\n    }\n\n    /**\n     * Sets the map `key` to `value`.\n     *\n     * @private\n     * @name set\n     * @memberOf MapCache\n     * @param {string} key The key of the value to set.\n     * @param {*} value The value to set.\n     * @returns {Object} Returns the map cache instance.\n     */\n    function mapCacheSet(key, value) {\n      var data = getMapData(this, key),\n          size = data.size;\n\n      data.set(key, value);\n      this.size += data.size == size ? 0 : 1;\n      return this;\n    }\n\n    // Add methods to `MapCache`.\n    MapCache.prototype.clear = mapCacheClear;\n    MapCache.prototype['delete'] = mapCacheDelete;\n    MapCache.prototype.get = mapCacheGet;\n    MapCache.prototype.has = mapCacheHas;\n    MapCache.prototype.set = mapCacheSet;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     *\n     * Creates an array cache object to store unique values.\n     *\n     * @private\n     * @constructor\n     * @param {Array} [values] The values to cache.\n     */\n    function SetCache(values) {\n      var index = -1,\n          length = values == null ? 0 : values.length;\n\n      this.__data__ = new MapCache;\n      while (++index < length) {\n        this.add(values[index]);\n      }\n    }\n\n    /**\n     * Adds `value` to the array cache.\n     *\n     * @private\n     * @name add\n     * @memberOf SetCache\n     * @alias push\n     * @param {*} value The value to cache.\n     * @returns {Object} Returns the cache instance.\n     */\n    function setCacheAdd(value) {\n      this.__data__.set(value, HASH_UNDEFINED);\n      return this;\n    }\n\n    /**\n     * Checks if `value` is in the array cache.\n     *\n     * @private\n     * @name has\n     * @memberOf SetCache\n     * @param {*} value The value to search for.\n     * @returns {number} Returns `true` if `value` is found, else `false`.\n     */\n    function setCacheHas(value) {\n      return this.__data__.has(value);\n    }\n\n    // Add methods to `SetCache`.\n    SetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\n    SetCache.prototype.has = setCacheHas;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates a stack cache object to store key-value pairs.\n     *\n     * @private\n     * @constructor\n     * @param {Array} [entries] The key-value pairs to cache.\n     */\n    function Stack(entries) {\n      var data = this.__data__ = new ListCache(entries);\n      this.size = data.size;\n    }\n\n    /**\n     * Removes all key-value entries from the stack.\n     *\n     * @private\n     * @name clear\n     * @memberOf Stack\n     */\n    function stackClear() {\n      this.__data__ = new ListCache;\n      this.size = 0;\n    }\n\n    /**\n     * Removes `key` and its value from the stack.\n     *\n     * @private\n     * @name delete\n     * @memberOf Stack\n     * @param {string} key The key of the value to remove.\n     * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n     */\n    function stackDelete(key) {\n      var data = this.__data__,\n          result = data['delete'](key);\n\n      this.size = data.size;\n      return result;\n    }\n\n    /**\n     * Gets the stack value for `key`.\n     *\n     * @private\n     * @name get\n     * @memberOf Stack\n     * @param {string} key The key of the value to get.\n     * @returns {*} Returns the entry value.\n     */\n    function stackGet(key) {\n      return this.__data__.get(key);\n    }\n\n    /**\n     * Checks if a stack value for `key` exists.\n     *\n     * @private\n     * @name has\n     * @memberOf Stack\n     * @param {string} key The key of the entry to check.\n     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n     */\n    function stackHas(key) {\n      return this.__data__.has(key);\n    }\n\n    /**\n     * Sets the stack `key` to `value`.\n     *\n     * @private\n     * @name set\n     * @memberOf Stack\n     * @param {string} key The key of the value to set.\n     * @param {*} value The value to set.\n     * @returns {Object} Returns the stack cache instance.\n     */\n    function stackSet(key, value) {\n      var data = this.__data__;\n      if (data instanceof ListCache) {\n        var pairs = data.__data__;\n        if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) {\n          pairs.push([key, value]);\n          this.size = ++data.size;\n          return this;\n        }\n        data = this.__data__ = new MapCache(pairs);\n      }\n      data.set(key, value);\n      this.size = data.size;\n      return this;\n    }\n\n    // Add methods to `Stack`.\n    Stack.prototype.clear = stackClear;\n    Stack.prototype['delete'] = stackDelete;\n    Stack.prototype.get = stackGet;\n    Stack.prototype.has = stackHas;\n    Stack.prototype.set = stackSet;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates an array of the enumerable property names of the array-like `value`.\n     *\n     * @private\n     * @param {*} value The value to query.\n     * @param {boolean} inherited Specify returning inherited property names.\n     * @returns {Array} Returns the array of property names.\n     */\n    function arrayLikeKeys(value, inherited) {\n      var isArr = isArray(value),\n          isArg = !isArr && isArguments(value),\n          isBuff = !isArr && !isArg && isBuffer(value),\n          isType = !isArr && !isArg && !isBuff && isTypedArray(value),\n          skipIndexes = isArr || isArg || isBuff || isType,\n          result = skipIndexes ? baseTimes(value.length, String) : [],\n          length = result.length;\n\n      for (var key in value) {\n        if ((inherited || hasOwnProperty.call(value, key)) &&\n            !(skipIndexes && (\n               // Safari 9 has enumerable `arguments.length` in strict mode.\n               key == 'length' ||\n               // Node.js 0.10 has enumerable non-index properties on buffers.\n               (isBuff && (key == 'offset' || key == 'parent')) ||\n               // PhantomJS 2 has enumerable non-index properties on typed arrays.\n               (isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||\n               // Skip index properties.\n               isIndex(key, length)\n            ))) {\n          result.push(key);\n        }\n      }\n      return result;\n    }\n\n    /**\n     * A specialized version of `_.sample` for arrays.\n     *\n     * @private\n     * @param {Array} array The array to sample.\n     * @returns {*} Returns the random element.\n     */\n    function arraySample(array) {\n      var length = array.length;\n      return length ? array[baseRandom(0, length - 1)] : undefined;\n    }\n\n    /**\n     * A specialized version of `_.sampleSize` for arrays.\n     *\n     * @private\n     * @param {Array} array The array to sample.\n     * @param {number} n The number of elements to sample.\n     * @returns {Array} Returns the random elements.\n     */\n    function arraySampleSize(array, n) {\n      return shuffleSelf(copyArray(array), baseClamp(n, 0, array.length));\n    }\n\n    /**\n     * A specialized version of `_.shuffle` for arrays.\n     *\n     * @private\n     * @param {Array} array The array to shuffle.\n     * @returns {Array} Returns the new shuffled array.\n     */\n    function arrayShuffle(array) {\n      return shuffleSelf(copyArray(array));\n    }\n\n    /**\n     * This function is like `assignValue` except that it doesn't assign\n     * `undefined` values.\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     */\n    function assignMergeValue(object, key, value) {\n      if ((value !== undefined && !eq(object[key], value)) ||\n          (value === undefined && !(key in object))) {\n        baseAssignValue(object, key, value);\n      }\n    }\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     */\n    function 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\n    /**\n     * Gets the index at which the `key` is found in `array` of key-value pairs.\n     *\n     * @private\n     * @param {Array} array The array to inspect.\n     * @param {*} key The key to search for.\n     * @returns {number} Returns the index of the matched value, else `-1`.\n     */\n    function assocIndexOf(array, key) {\n      var length = array.length;\n      while (length--) {\n        if (eq(array[length][0], key)) {\n          return length;\n        }\n      }\n      return -1;\n    }\n\n    /**\n     * Aggregates elements of `collection` on `accumulator` with keys transformed\n     * by `iteratee` and values set by `setter`.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} setter The function to set `accumulator` values.\n     * @param {Function} iteratee The iteratee to transform keys.\n     * @param {Object} accumulator The initial aggregated object.\n     * @returns {Function} Returns `accumulator`.\n     */\n    function baseAggregator(collection, setter, iteratee, accumulator) {\n      baseEach(collection, function(value, key, collection) {\n        setter(accumulator, value, iteratee(value), collection);\n      });\n      return accumulator;\n    }\n\n    /**\n     * The base implementation of `_.assign` without support for multiple sources\n     * or `customizer` functions.\n     *\n     * @private\n     * @param {Object} object The destination object.\n     * @param {Object} source The source object.\n     * @returns {Object} Returns `object`.\n     */\n    function baseAssign(object, source) {\n      return object && copyObject(source, keys(source), object);\n    }\n\n    /**\n     * The base implementation of `_.assignIn` without support for multiple sources\n     * or `customizer` functions.\n     *\n     * @private\n     * @param {Object} object The destination object.\n     * @param {Object} source The source object.\n     * @returns {Object} Returns `object`.\n     */\n    function baseAssignIn(object, source) {\n      return object && copyObject(source, keysIn(source), object);\n    }\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     */\n    function 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\n    /**\n     * The base implementation of `_.at` without support for individual paths.\n     *\n     * @private\n     * @param {Object} object The object to iterate over.\n     * @param {string[]} paths The property paths to pick.\n     * @returns {Array} Returns the picked elements.\n     */\n    function baseAt(object, paths) {\n      var index = -1,\n          length = paths.length,\n          result = Array(length),\n          skip = object == null;\n\n      while (++index < length) {\n        result[index] = skip ? undefined : get(object, paths[index]);\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.clamp` which doesn't coerce arguments.\n     *\n     * @private\n     * @param {number} number The number to clamp.\n     * @param {number} [lower] The lower bound.\n     * @param {number} upper The upper bound.\n     * @returns {number} Returns the clamped number.\n     */\n    function baseClamp(number, lower, upper) {\n      if (number === number) {\n        if (upper !== undefined) {\n          number = number <= upper ? number : upper;\n        }\n        if (lower !== undefined) {\n          number = number >= lower ? number : lower;\n        }\n      }\n      return number;\n    }\n\n    /**\n     * The base implementation of `_.clone` and `_.cloneDeep` which tracks\n     * traversed objects.\n     *\n     * @private\n     * @param {*} value The value to clone.\n     * @param {boolean} bitmask The bitmask flags.\n     *  1 - Deep clone\n     *  2 - Flatten inherited properties\n     *  4 - Clone symbols\n     * @param {Function} [customizer] The function to customize cloning.\n     * @param {string} [key] The key of `value`.\n     * @param {Object} [object] The parent object of `value`.\n     * @param {Object} [stack] Tracks traversed objects and their clone counterparts.\n     * @returns {*} Returns the cloned value.\n     */\n    function baseClone(value, bitmask, customizer, key, object, stack) {\n      var result,\n          isDeep = bitmask & CLONE_DEEP_FLAG,\n          isFlat = bitmask & CLONE_FLAT_FLAG,\n          isFull = bitmask & CLONE_SYMBOLS_FLAG;\n\n      if (customizer) {\n        result = object ? customizer(value, key, object, stack) : customizer(value);\n      }\n      if (result !== undefined) {\n        return result;\n      }\n      if (!isObject(value)) {\n        return value;\n      }\n      var isArr = isArray(value);\n      if (isArr) {\n        result = initCloneArray(value);\n        if (!isDeep) {\n          return copyArray(value, result);\n        }\n      } else {\n        var tag = getTag(value),\n            isFunc = tag == funcTag || tag == genTag;\n\n        if (isBuffer(value)) {\n          return cloneBuffer(value, isDeep);\n        }\n        if (tag == objectTag || tag == argsTag || (isFunc && !object)) {\n          result = (isFlat || isFunc) ? {} : initCloneObject(value);\n          if (!isDeep) {\n            return isFlat\n              ? copySymbolsIn(value, baseAssignIn(result, value))\n              : copySymbols(value, baseAssign(result, value));\n          }\n        } else {\n          if (!cloneableTags[tag]) {\n            return object ? value : {};\n          }\n          result = initCloneByTag(value, tag, isDeep);\n        }\n      }\n      // Check for circular references and return its corresponding clone.\n      stack || (stack = new Stack);\n      var stacked = stack.get(value);\n      if (stacked) {\n        return stacked;\n      }\n      stack.set(value, result);\n\n      if (isSet(value)) {\n        value.forEach(function(subValue) {\n          result.add(baseClone(subValue, bitmask, customizer, subValue, value, stack));\n        });\n      } else if (isMap(value)) {\n        value.forEach(function(subValue, key) {\n          result.set(key, baseClone(subValue, bitmask, customizer, key, value, stack));\n        });\n      }\n\n      var keysFunc = isFull\n        ? (isFlat ? getAllKeysIn : getAllKeys)\n        : (isFlat ? keysIn : keys);\n\n      var props = isArr ? undefined : keysFunc(value);\n      arrayEach(props || value, function(subValue, key) {\n        if (props) {\n          key = subValue;\n          subValue = value[key];\n        }\n        // Recursively populate clone (susceptible to call stack limits).\n        assignValue(result, key, baseClone(subValue, bitmask, customizer, key, value, stack));\n      });\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.conforms` which doesn't clone `source`.\n     *\n     * @private\n     * @param {Object} source The object of property predicates to conform to.\n     * @returns {Function} Returns the new spec function.\n     */\n    function baseConforms(source) {\n      var props = keys(source);\n      return function(object) {\n        return baseConformsTo(object, source, props);\n      };\n    }\n\n    /**\n     * The base implementation of `_.conformsTo` which accepts `props` to check.\n     *\n     * @private\n     * @param {Object} object The object to inspect.\n     * @param {Object} source The object of property predicates to conform to.\n     * @returns {boolean} Returns `true` if `object` conforms, else `false`.\n     */\n    function baseConformsTo(object, source, props) {\n      var length = props.length;\n      if (object == null) {\n        return !length;\n      }\n      object = Object(object);\n      while (length--) {\n        var key = props[length],\n            predicate = source[key],\n            value = object[key];\n\n        if ((value === undefined && !(key in object)) || !predicate(value)) {\n          return false;\n        }\n      }\n      return true;\n    }\n\n    /**\n     * The base implementation of `_.delay` and `_.defer` which accepts `args`\n     * to provide to `func`.\n     *\n     * @private\n     * @param {Function} func The function to delay.\n     * @param {number} wait The number of milliseconds to delay invocation.\n     * @param {Array} args The arguments to provide to `func`.\n     * @returns {number|Object} Returns the timer id or timeout object.\n     */\n    function baseDelay(func, wait, args) {\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      return setTimeout(function() { func.apply(undefined, args); }, wait);\n    }\n\n    /**\n     * The base implementation of methods like `_.difference` without support\n     * for excluding multiple arrays or iteratee shorthands.\n     *\n     * @private\n     * @param {Array} array The array to inspect.\n     * @param {Array} values The values to exclude.\n     * @param {Function} [iteratee] The iteratee invoked per element.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new array of filtered values.\n     */\n    function baseDifference(array, values, iteratee, comparator) {\n      var index = -1,\n          includes = arrayIncludes,\n          isCommon = true,\n          length = array.length,\n          result = [],\n          valuesLength = values.length;\n\n      if (!length) {\n        return result;\n      }\n      if (iteratee) {\n        values = arrayMap(values, baseUnary(iteratee));\n      }\n      if (comparator) {\n        includes = arrayIncludesWith;\n        isCommon = false;\n      }\n      else if (values.length >= LARGE_ARRAY_SIZE) {\n        includes = cacheHas;\n        isCommon = false;\n        values = new SetCache(values);\n      }\n      outer:\n      while (++index < length) {\n        var value = array[index],\n            computed = iteratee == null ? value : iteratee(value);\n\n        value = (comparator || value !== 0) ? value : 0;\n        if (isCommon && computed === computed) {\n          var valuesIndex = valuesLength;\n          while (valuesIndex--) {\n            if (values[valuesIndex] === computed) {\n              continue outer;\n            }\n          }\n          result.push(value);\n        }\n        else if (!includes(values, computed, comparator)) {\n          result.push(value);\n        }\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.forEach` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @returns {Array|Object} Returns `collection`.\n     */\n    var baseEach = createBaseEach(baseForOwn);\n\n    /**\n     * The base implementation of `_.forEachRight` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @returns {Array|Object} Returns `collection`.\n     */\n    var baseEachRight = createBaseEach(baseForOwnRight, true);\n\n    /**\n     * The base implementation of `_.every` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} predicate The function invoked per iteration.\n     * @returns {boolean} Returns `true` if all elements pass the predicate check,\n     *  else `false`\n     */\n    function baseEvery(collection, predicate) {\n      var result = true;\n      baseEach(collection, function(value, index, collection) {\n        result = !!predicate(value, index, collection);\n        return result;\n      });\n      return result;\n    }\n\n    /**\n     * The base implementation of methods like `_.max` and `_.min` which accepts a\n     * `comparator` to determine the extremum value.\n     *\n     * @private\n     * @param {Array} array The array to iterate over.\n     * @param {Function} iteratee The iteratee invoked per iteration.\n     * @param {Function} comparator The comparator used to compare values.\n     * @returns {*} Returns the extremum value.\n     */\n    function baseExtremum(array, iteratee, comparator) {\n      var index = -1,\n          length = array.length;\n\n      while (++index < length) {\n        var value = array[index],\n            current = iteratee(value);\n\n        if (current != null && (computed === undefined\n              ? (current === current && !isSymbol(current))\n              : comparator(current, computed)\n            )) {\n          var computed = current,\n              result = value;\n        }\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.fill` without an iteratee call guard.\n     *\n     * @private\n     * @param {Array} array The array to fill.\n     * @param {*} value The value to fill `array` with.\n     * @param {number} [start=0] The start position.\n     * @param {number} [end=array.length] The end position.\n     * @returns {Array} Returns `array`.\n     */\n    function baseFill(array, value, start, end) {\n      var length = array.length;\n\n      start = toInteger(start);\n      if (start < 0) {\n        start = -start > length ? 0 : (length + start);\n      }\n      end = (end === undefined || end > length) ? length : toInteger(end);\n      if (end < 0) {\n        end += length;\n      }\n      end = start > end ? 0 : toLength(end);\n      while (start < end) {\n        array[start++] = value;\n      }\n      return array;\n    }\n\n    /**\n     * The base implementation of `_.filter` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} predicate The function invoked per iteration.\n     * @returns {Array} Returns the new filtered array.\n     */\n    function baseFilter(collection, predicate) {\n      var result = [];\n      baseEach(collection, function(value, index, collection) {\n        if (predicate(value, index, collection)) {\n          result.push(value);\n        }\n      });\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.flatten` with support for restricting flattening.\n     *\n     * @private\n     * @param {Array} array The array to flatten.\n     * @param {number} depth The maximum recursion depth.\n     * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.\n     * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.\n     * @param {Array} [result=[]] The initial result value.\n     * @returns {Array} Returns the new flattened array.\n     */\n    function baseFlatten(array, depth, predicate, isStrict, result) {\n      var index = -1,\n          length = array.length;\n\n      predicate || (predicate = isFlattenable);\n      result || (result = []);\n\n      while (++index < length) {\n        var value = array[index];\n        if (depth > 0 && predicate(value)) {\n          if (depth > 1) {\n            // Recursively flatten arrays (susceptible to call stack limits).\n            baseFlatten(value, depth - 1, predicate, isStrict, result);\n          } else {\n            arrayPush(result, value);\n          }\n        } else if (!isStrict) {\n          result[result.length] = value;\n        }\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `baseForOwn` which iterates over `object`\n     * properties returned by `keysFunc` and invokes `iteratee` for each property.\n     * Iteratee functions may exit iteration early by explicitly returning `false`.\n     *\n     * @private\n     * @param {Object} object The object to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @param {Function} keysFunc The function to get the keys of `object`.\n     * @returns {Object} Returns `object`.\n     */\n    var baseFor = createBaseFor();\n\n    /**\n     * This function is like `baseFor` except that it iterates over properties\n     * in the opposite order.\n     *\n     * @private\n     * @param {Object} object The object to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @param {Function} keysFunc The function to get the keys of `object`.\n     * @returns {Object} Returns `object`.\n     */\n    var baseForRight = createBaseFor(true);\n\n    /**\n     * The base implementation of `_.forOwn` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Object} object The object to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @returns {Object} Returns `object`.\n     */\n    function baseForOwn(object, iteratee) {\n      return object && baseFor(object, iteratee, keys);\n    }\n\n    /**\n     * The base implementation of `_.forOwnRight` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Object} object The object to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @returns {Object} Returns `object`.\n     */\n    function baseForOwnRight(object, iteratee) {\n      return object && baseForRight(object, iteratee, keys);\n    }\n\n    /**\n     * The base implementation of `_.functions` which creates an array of\n     * `object` function property names filtered from `props`.\n     *\n     * @private\n     * @param {Object} object The object to inspect.\n     * @param {Array} props The property names to filter.\n     * @returns {Array} Returns the function names.\n     */\n    function baseFunctions(object, props) {\n      return arrayFilter(props, function(key) {\n        return isFunction(object[key]);\n      });\n    }\n\n    /**\n     * The base implementation of `_.get` without support for default values.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @param {Array|string} path The path of the property to get.\n     * @returns {*} Returns the resolved value.\n     */\n    function baseGet(object, path) {\n      path = castPath(path, object);\n\n      var index = 0,\n          length = path.length;\n\n      while (object != null && index < length) {\n        object = object[toKey(path[index++])];\n      }\n      return (index && index == length) ? object : undefined;\n    }\n\n    /**\n     * The base implementation of `getAllKeys` and `getAllKeysIn` which uses\n     * `keysFunc` and `symbolsFunc` to get the enumerable property names and\n     * symbols of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @param {Function} keysFunc The function to get the keys of `object`.\n     * @param {Function} symbolsFunc The function to get the symbols of `object`.\n     * @returns {Array} Returns the array of property names and symbols.\n     */\n    function baseGetAllKeys(object, keysFunc, symbolsFunc) {\n      var result = keysFunc(object);\n      return isArray(object) ? result : arrayPush(result, symbolsFunc(object));\n    }\n\n    /**\n     * The base implementation of `getTag` without fallbacks for buggy environments.\n     *\n     * @private\n     * @param {*} value The value to query.\n     * @returns {string} Returns the `toStringTag`.\n     */\n    function baseGetTag(value) {\n      if (value == null) {\n        return value === undefined ? undefinedTag : nullTag;\n      }\n      return (symToStringTag && symToStringTag in Object(value))\n        ? getRawTag(value)\n        : objectToString(value);\n    }\n\n    /**\n     * The base implementation of `_.gt` which doesn't coerce arguments.\n     *\n     * @private\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if `value` is greater than `other`,\n     *  else `false`.\n     */\n    function baseGt(value, other) {\n      return value > other;\n    }\n\n    /**\n     * The base implementation of `_.has` 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     */\n    function baseHas(object, key) {\n      return object != null && hasOwnProperty.call(object, key);\n    }\n\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     */\n    function baseHasIn(object, key) {\n      return object != null && key in Object(object);\n    }\n\n    /**\n     * The base implementation of `_.inRange` which doesn't coerce arguments.\n     *\n     * @private\n     * @param {number} number The number to check.\n     * @param {number} start The start of the range.\n     * @param {number} end The end of the range.\n     * @returns {boolean} Returns `true` if `number` is in the range, else `false`.\n     */\n    function baseInRange(number, start, end) {\n      return number >= nativeMin(start, end) && number < nativeMax(start, end);\n    }\n\n    /**\n     * The base implementation of methods like `_.intersection`, without support\n     * for iteratee shorthands, that accepts an array of arrays to inspect.\n     *\n     * @private\n     * @param {Array} arrays The arrays to inspect.\n     * @param {Function} [iteratee] The iteratee invoked per element.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new array of shared values.\n     */\n    function baseIntersection(arrays, iteratee, comparator) {\n      var includes = comparator ? arrayIncludesWith : arrayIncludes,\n          length = arrays[0].length,\n          othLength = arrays.length,\n          othIndex = othLength,\n          caches = Array(othLength),\n          maxLength = Infinity,\n          result = [];\n\n      while (othIndex--) {\n        var array = arrays[othIndex];\n        if (othIndex && iteratee) {\n          array = arrayMap(array, baseUnary(iteratee));\n        }\n        maxLength = nativeMin(array.length, maxLength);\n        caches[othIndex] = !comparator && (iteratee || (length >= 120 && array.length >= 120))\n          ? new SetCache(othIndex && array)\n          : undefined;\n      }\n      array = arrays[0];\n\n      var index = -1,\n          seen = caches[0];\n\n      outer:\n      while (++index < length && result.length < maxLength) {\n        var value = array[index],\n            computed = iteratee ? iteratee(value) : value;\n\n        value = (comparator || value !== 0) ? value : 0;\n        if (!(seen\n              ? cacheHas(seen, computed)\n              : includes(result, computed, comparator)\n            )) {\n          othIndex = othLength;\n          while (--othIndex) {\n            var cache = caches[othIndex];\n            if (!(cache\n                  ? cacheHas(cache, computed)\n                  : includes(arrays[othIndex], computed, comparator))\n                ) {\n              continue outer;\n            }\n          }\n          if (seen) {\n            seen.push(computed);\n          }\n          result.push(value);\n        }\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.invert` and `_.invertBy` which inverts\n     * `object` with values transformed by `iteratee` and set by `setter`.\n     *\n     * @private\n     * @param {Object} object The object to iterate over.\n     * @param {Function} setter The function to set `accumulator` values.\n     * @param {Function} iteratee The iteratee to transform values.\n     * @param {Object} accumulator The initial inverted object.\n     * @returns {Function} Returns `accumulator`.\n     */\n    function baseInverter(object, setter, iteratee, accumulator) {\n      baseForOwn(object, function(value, key, object) {\n        setter(accumulator, iteratee(value), key, object);\n      });\n      return accumulator;\n    }\n\n    /**\n     * The base implementation of `_.invoke` without support for individual\n     * method arguments.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @param {Array|string} path The path of the method to invoke.\n     * @param {Array} args The arguments to invoke the method with.\n     * @returns {*} Returns the result of the invoked method.\n     */\n    function baseInvoke(object, path, args) {\n      path = castPath(path, object);\n      object = parent(object, path);\n      var func = object == null ? object : object[toKey(last(path))];\n      return func == null ? undefined : apply(func, object, args);\n    }\n\n    /**\n     * The base implementation of `_.isArguments`.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n     */\n    function baseIsArguments(value) {\n      return isObjectLike(value) && baseGetTag(value) == argsTag;\n    }\n\n    /**\n     * The base implementation of `_.isArrayBuffer` without Node.js optimizations.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an array buffer, else `false`.\n     */\n    function baseIsArrayBuffer(value) {\n      return isObjectLike(value) && baseGetTag(value) == arrayBufferTag;\n    }\n\n    /**\n     * The base implementation of `_.isDate` without Node.js optimizations.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a date object, else `false`.\n     */\n    function baseIsDate(value) {\n      return isObjectLike(value) && baseGetTag(value) == dateTag;\n    }\n\n    /**\n     * The base implementation of `_.isEqual` which supports partial comparisons\n     * and tracks traversed objects.\n     *\n     * @private\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @param {boolean} bitmask The bitmask flags.\n     *  1 - Unordered comparison\n     *  2 - Partial comparison\n     * @param {Function} [customizer] The function to customize comparisons.\n     * @param {Object} [stack] Tracks traversed `value` and `other` objects.\n     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n     */\n    function baseIsEqual(value, other, bitmask, customizer, stack) {\n      if (value === other) {\n        return true;\n      }\n      if (value == null || other == null || (!isObjectLike(value) && !isObjectLike(other))) {\n        return value !== value && other !== other;\n      }\n      return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack);\n    }\n\n    /**\n     * A specialized version of `baseIsEqual` for arrays and objects which performs\n     * deep comparisons and tracks traversed objects enabling objects with circular\n     * references to be compared.\n     *\n     * @private\n     * @param {Object} object The object to compare.\n     * @param {Object} other The other object to compare.\n     * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n     * @param {Function} customizer The function to customize comparisons.\n     * @param {Function} equalFunc The function to determine equivalents of values.\n     * @param {Object} [stack] Tracks traversed `object` and `other` objects.\n     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n     */\n    function baseIsEqualDeep(object, other, bitmask, customizer, equalFunc, stack) {\n      var objIsArr = isArray(object),\n          othIsArr = isArray(other),\n          objTag = objIsArr ? arrayTag : getTag(object),\n          othTag = othIsArr ? arrayTag : getTag(other);\n\n      objTag = objTag == argsTag ? objectTag : objTag;\n      othTag = othTag == argsTag ? objectTag : othTag;\n\n      var objIsObj = objTag == objectTag,\n          othIsObj = othTag == objectTag,\n          isSameTag = objTag == othTag;\n\n      if (isSameTag && isBuffer(object)) {\n        if (!isBuffer(other)) {\n          return false;\n        }\n        objIsArr = true;\n        objIsObj = false;\n      }\n      if (isSameTag && !objIsObj) {\n        stack || (stack = new Stack);\n        return (objIsArr || isTypedArray(object))\n          ? equalArrays(object, other, bitmask, customizer, equalFunc, stack)\n          : equalByTag(object, other, objTag, bitmask, customizer, equalFunc, stack);\n      }\n      if (!(bitmask & COMPARE_PARTIAL_FLAG)) {\n        var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),\n            othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');\n\n        if (objIsWrapped || othIsWrapped) {\n          var objUnwrapped = objIsWrapped ? object.value() : object,\n              othUnwrapped = othIsWrapped ? other.value() : other;\n\n          stack || (stack = new Stack);\n          return equalFunc(objUnwrapped, othUnwrapped, bitmask, customizer, stack);\n        }\n      }\n      if (!isSameTag) {\n        return false;\n      }\n      stack || (stack = new Stack);\n      return equalObjects(object, other, bitmask, customizer, equalFunc, stack);\n    }\n\n    /**\n     * The base implementation of `_.isMap` without Node.js optimizations.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n     */\n    function baseIsMap(value) {\n      return isObjectLike(value) && getTag(value) == mapTag;\n    }\n\n    /**\n     * The base implementation of `_.isMatch` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Object} object The object to inspect.\n     * @param {Object} source The object of property values to match.\n     * @param {Array} matchData The property names, values, and compare flags to match.\n     * @param {Function} [customizer] The function to customize comparisons.\n     * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n     */\n    function baseIsMatch(object, source, matchData, customizer) {\n      var index = matchData.length,\n          length = index,\n          noCustomizer = !customizer;\n\n      if (object == null) {\n        return !length;\n      }\n      object = Object(object);\n      while (index--) {\n        var data = matchData[index];\n        if ((noCustomizer && data[2])\n              ? data[1] !== object[data[0]]\n              : !(data[0] in object)\n            ) {\n          return false;\n        }\n      }\n      while (++index < length) {\n        data = matchData[index];\n        var key = data[0],\n            objValue = object[key],\n            srcValue = data[1];\n\n        if (noCustomizer && data[2]) {\n          if (objValue === undefined && !(key in object)) {\n            return false;\n          }\n        } else {\n          var stack = new Stack;\n          if (customizer) {\n            var result = customizer(objValue, srcValue, key, object, source, stack);\n          }\n          if (!(result === undefined\n                ? baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG, customizer, stack)\n                : result\n              )) {\n            return false;\n          }\n        }\n      }\n      return true;\n    }\n\n    /**\n     * The base implementation of `_.isNative` without bad shim checks.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a native function,\n     *  else `false`.\n     */\n    function baseIsNative(value) {\n      if (!isObject(value) || isMasked(value)) {\n        return false;\n      }\n      var pattern = isFunction(value) ? reIsNative : reIsHostCtor;\n      return pattern.test(toSource(value));\n    }\n\n    /**\n     * The base implementation of `_.isRegExp` without Node.js optimizations.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a regexp, else `false`.\n     */\n    function baseIsRegExp(value) {\n      return isObjectLike(value) && baseGetTag(value) == regexpTag;\n    }\n\n    /**\n     * The base implementation of `_.isSet` without Node.js optimizations.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n     */\n    function baseIsSet(value) {\n      return isObjectLike(value) && getTag(value) == setTag;\n    }\n\n    /**\n     * The base implementation of `_.isTypedArray` without Node.js optimizations.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n     */\n    function baseIsTypedArray(value) {\n      return isObjectLike(value) &&\n        isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n    }\n\n    /**\n     * The base implementation of `_.iteratee`.\n     *\n     * @private\n     * @param {*} [value=_.identity] The value to convert to an iteratee.\n     * @returns {Function} Returns the iteratee.\n     */\n    function baseIteratee(value) {\n      // Don't store the `typeof` result in a variable to avoid a JIT bug in Safari 9.\n      // See https://bugs.webkit.org/show_bug.cgi?id=156034 for more details.\n      if (typeof value == 'function') {\n        return value;\n      }\n      if (value == null) {\n        return identity;\n      }\n      if (typeof value == 'object') {\n        return isArray(value)\n          ? baseMatchesProperty(value[0], value[1])\n          : baseMatches(value);\n      }\n      return property(value);\n    }\n\n    /**\n     * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property names.\n     */\n    function baseKeys(object) {\n      if (!isPrototype(object)) {\n        return nativeKeys(object);\n      }\n      var result = [];\n      for (var key in Object(object)) {\n        if (hasOwnProperty.call(object, key) && key != 'constructor') {\n          result.push(key);\n        }\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.keysIn` which doesn't treat sparse arrays as dense.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property names.\n     */\n    function baseKeysIn(object) {\n      if (!isObject(object)) {\n        return nativeKeysIn(object);\n      }\n      var isProto = isPrototype(object),\n          result = [];\n\n      for (var key in object) {\n        if (!(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) {\n          result.push(key);\n        }\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.lt` which doesn't coerce arguments.\n     *\n     * @private\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if `value` is less than `other`,\n     *  else `false`.\n     */\n    function baseLt(value, other) {\n      return value < other;\n    }\n\n    /**\n     * The base implementation of `_.map` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @returns {Array} Returns the new mapped array.\n     */\n    function baseMap(collection, iteratee) {\n      var index = -1,\n          result = isArrayLike(collection) ? Array(collection.length) : [];\n\n      baseEach(collection, function(value, key, collection) {\n        result[++index] = iteratee(value, key, collection);\n      });\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.matches` which doesn't clone `source`.\n     *\n     * @private\n     * @param {Object} source The object of property values to match.\n     * @returns {Function} Returns the new spec function.\n     */\n    function baseMatches(source) {\n      var matchData = getMatchData(source);\n      if (matchData.length == 1 && matchData[0][2]) {\n        return matchesStrictComparable(matchData[0][0], matchData[0][1]);\n      }\n      return function(object) {\n        return object === source || baseIsMatch(object, source, matchData);\n      };\n    }\n\n    /**\n     * The base implementation of `_.matchesProperty` which doesn't clone `srcValue`.\n     *\n     * @private\n     * @param {string} path The path of the property to get.\n     * @param {*} srcValue The value to match.\n     * @returns {Function} Returns the new spec function.\n     */\n    function baseMatchesProperty(path, srcValue) {\n      if (isKey(path) && isStrictComparable(srcValue)) {\n        return matchesStrictComparable(toKey(path), srcValue);\n      }\n      return function(object) {\n        var objValue = get(object, path);\n        return (objValue === undefined && objValue === srcValue)\n          ? hasIn(object, path)\n          : baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG);\n      };\n    }\n\n    /**\n     * The base implementation of `_.merge` without support for multiple sources.\n     *\n     * @private\n     * @param {Object} object The destination object.\n     * @param {Object} source The source object.\n     * @param {number} srcIndex The index of `source`.\n     * @param {Function} [customizer] The function to customize merged values.\n     * @param {Object} [stack] Tracks traversed source values and their merged\n     *  counterparts.\n     */\n    function baseMerge(object, source, srcIndex, customizer, stack) {\n      if (object === source) {\n        return;\n      }\n      baseFor(source, function(srcValue, key) {\n        stack || (stack = new Stack);\n        if (isObject(srcValue)) {\n          baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack);\n        }\n        else {\n          var newValue = customizer\n            ? customizer(safeGet(object, key), srcValue, (key + ''), object, source, stack)\n            : undefined;\n\n          if (newValue === undefined) {\n            newValue = srcValue;\n          }\n          assignMergeValue(object, key, newValue);\n        }\n      }, keysIn);\n    }\n\n    /**\n     * A specialized version of `baseMerge` for arrays and objects which performs\n     * deep merges and tracks traversed objects enabling objects with circular\n     * references to be merged.\n     *\n     * @private\n     * @param {Object} object The destination object.\n     * @param {Object} source The source object.\n     * @param {string} key The key of the value to merge.\n     * @param {number} srcIndex The index of `source`.\n     * @param {Function} mergeFunc The function to merge values.\n     * @param {Function} [customizer] The function to customize assigned values.\n     * @param {Object} [stack] Tracks traversed source values and their merged\n     *  counterparts.\n     */\n    function baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, stack) {\n      var objValue = safeGet(object, key),\n          srcValue = safeGet(source, key),\n          stacked = stack.get(srcValue);\n\n      if (stacked) {\n        assignMergeValue(object, key, stacked);\n        return;\n      }\n      var newValue = customizer\n        ? customizer(objValue, srcValue, (key + ''), object, source, stack)\n        : undefined;\n\n      var isCommon = newValue === undefined;\n\n      if (isCommon) {\n        var isArr = isArray(srcValue),\n            isBuff = !isArr && isBuffer(srcValue),\n            isTyped = !isArr && !isBuff && isTypedArray(srcValue);\n\n        newValue = srcValue;\n        if (isArr || isBuff || isTyped) {\n          if (isArray(objValue)) {\n            newValue = objValue;\n          }\n          else if (isArrayLikeObject(objValue)) {\n            newValue = copyArray(objValue);\n          }\n          else if (isBuff) {\n            isCommon = false;\n            newValue = cloneBuffer(srcValue, true);\n          }\n          else if (isTyped) {\n            isCommon = false;\n            newValue = cloneTypedArray(srcValue, true);\n          }\n          else {\n            newValue = [];\n          }\n        }\n        else if (isPlainObject(srcValue) || isArguments(srcValue)) {\n          newValue = objValue;\n          if (isArguments(objValue)) {\n            newValue = toPlainObject(objValue);\n          }\n          else if (!isObject(objValue) || isFunction(objValue)) {\n            newValue = initCloneObject(srcValue);\n          }\n        }\n        else {\n          isCommon = false;\n        }\n      }\n      if (isCommon) {\n        // Recursively merge objects and arrays (susceptible to call stack limits).\n        stack.set(srcValue, newValue);\n        mergeFunc(newValue, srcValue, srcIndex, customizer, stack);\n        stack['delete'](srcValue);\n      }\n      assignMergeValue(object, key, newValue);\n    }\n\n    /**\n     * The base implementation of `_.nth` which doesn't coerce arguments.\n     *\n     * @private\n     * @param {Array} array The array to query.\n     * @param {number} n The index of the element to return.\n     * @returns {*} Returns the nth element of `array`.\n     */\n    function baseNth(array, n) {\n      var length = array.length;\n      if (!length) {\n        return;\n      }\n      n += n < 0 ? length : 0;\n      return isIndex(n, length) ? array[n] : undefined;\n    }\n\n    /**\n     * The base implementation of `_.orderBy` without param guards.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function[]|Object[]|string[]} iteratees The iteratees to sort by.\n     * @param {string[]} orders The sort orders of `iteratees`.\n     * @returns {Array} Returns the new sorted array.\n     */\n    function baseOrderBy(collection, iteratees, orders) {\n      if (iteratees.length) {\n        iteratees = arrayMap(iteratees, function(iteratee) {\n          if (isArray(iteratee)) {\n            return function(value) {\n              return baseGet(value, iteratee.length === 1 ? iteratee[0] : iteratee);\n            }\n          }\n          return iteratee;\n        });\n      } else {\n        iteratees = [identity];\n      }\n\n      var index = -1;\n      iteratees = arrayMap(iteratees, baseUnary(getIteratee()));\n\n      var result = baseMap(collection, function(value, key, collection) {\n        var criteria = arrayMap(iteratees, function(iteratee) {\n          return iteratee(value);\n        });\n        return { 'criteria': criteria, 'index': ++index, 'value': value };\n      });\n\n      return baseSortBy(result, function(object, other) {\n        return compareMultiple(object, other, orders);\n      });\n    }\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     */\n    function basePick(object, paths) {\n      return basePickBy(object, paths, function(value, path) {\n        return hasIn(object, path);\n      });\n    }\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     */\n    function 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\n    /**\n     * A specialized version of `baseProperty` which supports deep paths.\n     *\n     * @private\n     * @param {Array|string} path The path of the property to get.\n     * @returns {Function} Returns the new accessor function.\n     */\n    function basePropertyDeep(path) {\n      return function(object) {\n        return baseGet(object, path);\n      };\n    }\n\n    /**\n     * The base implementation of `_.pullAllBy` without support for iteratee\n     * shorthands.\n     *\n     * @private\n     * @param {Array} array The array to modify.\n     * @param {Array} values The values to remove.\n     * @param {Function} [iteratee] The iteratee invoked per element.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns `array`.\n     */\n    function basePullAll(array, values, iteratee, comparator) {\n      var indexOf = comparator ? baseIndexOfWith : baseIndexOf,\n          index = -1,\n          length = values.length,\n          seen = array;\n\n      if (array === values) {\n        values = copyArray(values);\n      }\n      if (iteratee) {\n        seen = arrayMap(array, baseUnary(iteratee));\n      }\n      while (++index < length) {\n        var fromIndex = 0,\n            value = values[index],\n            computed = iteratee ? iteratee(value) : value;\n\n        while ((fromIndex = indexOf(seen, computed, fromIndex, comparator)) > -1) {\n          if (seen !== array) {\n            splice.call(seen, fromIndex, 1);\n          }\n          splice.call(array, fromIndex, 1);\n        }\n      }\n      return array;\n    }\n\n    /**\n     * The base implementation of `_.pullAt` without support for individual\n     * indexes or capturing the removed elements.\n     *\n     * @private\n     * @param {Array} array The array to modify.\n     * @param {number[]} indexes The indexes of elements to remove.\n     * @returns {Array} Returns `array`.\n     */\n    function basePullAt(array, indexes) {\n      var length = array ? indexes.length : 0,\n          lastIndex = length - 1;\n\n      while (length--) {\n        var index = indexes[length];\n        if (length == lastIndex || index !== previous) {\n          var previous = index;\n          if (isIndex(index)) {\n            splice.call(array, index, 1);\n          } else {\n            baseUnset(array, index);\n          }\n        }\n      }\n      return array;\n    }\n\n    /**\n     * The base implementation of `_.random` without support for returning\n     * floating-point numbers.\n     *\n     * @private\n     * @param {number} lower The lower bound.\n     * @param {number} upper The upper bound.\n     * @returns {number} Returns the random number.\n     */\n    function baseRandom(lower, upper) {\n      return lower + nativeFloor(nativeRandom() * (upper - lower + 1));\n    }\n\n    /**\n     * The base implementation of `_.range` and `_.rangeRight` which doesn't\n     * coerce arguments.\n     *\n     * @private\n     * @param {number} start The start of the range.\n     * @param {number} end The end of the range.\n     * @param {number} step The value to increment or decrement by.\n     * @param {boolean} [fromRight] Specify iterating from right to left.\n     * @returns {Array} Returns the range of numbers.\n     */\n    function baseRange(start, end, step, fromRight) {\n      var index = -1,\n          length = nativeMax(nativeCeil((end - start) / (step || 1)), 0),\n          result = Array(length);\n\n      while (length--) {\n        result[fromRight ? length : ++index] = start;\n        start += step;\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.repeat` which doesn't coerce arguments.\n     *\n     * @private\n     * @param {string} string The string to repeat.\n     * @param {number} n The number of times to repeat the string.\n     * @returns {string} Returns the repeated string.\n     */\n    function baseRepeat(string, n) {\n      var result = '';\n      if (!string || n < 1 || n > MAX_SAFE_INTEGER) {\n        return result;\n      }\n      // Leverage the exponentiation by squaring algorithm for a faster repeat.\n      // See https://en.wikipedia.org/wiki/Exponentiation_by_squaring for more details.\n      do {\n        if (n % 2) {\n          result += string;\n        }\n        n = nativeFloor(n / 2);\n        if (n) {\n          string += string;\n        }\n      } while (n);\n\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.rest` which doesn't validate or coerce arguments.\n     *\n     * @private\n     * @param {Function} func The function to apply a rest parameter to.\n     * @param {number} [start=func.length-1] The start position of the rest parameter.\n     * @returns {Function} Returns the new function.\n     */\n    function baseRest(func, start) {\n      return setToString(overRest(func, start, identity), func + '');\n    }\n\n    /**\n     * The base implementation of `_.sample`.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to sample.\n     * @returns {*} Returns the random element.\n     */\n    function baseSample(collection) {\n      return arraySample(values(collection));\n    }\n\n    /**\n     * The base implementation of `_.sampleSize` without param guards.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to sample.\n     * @param {number} n The number of elements to sample.\n     * @returns {Array} Returns the random elements.\n     */\n    function baseSampleSize(collection, n) {\n      var array = values(collection);\n      return shuffleSelf(array, baseClamp(n, 0, array.length));\n    }\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     */\n    function 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\n    /**\n     * The base implementation of `setData` without support for hot loop shorting.\n     *\n     * @private\n     * @param {Function} func The function to associate metadata with.\n     * @param {*} data The metadata.\n     * @returns {Function} Returns `func`.\n     */\n    var baseSetData = !metaMap ? identity : function(func, data) {\n      metaMap.set(func, data);\n      return func;\n    };\n\n    /**\n     * The base implementation of `setToString` without support for hot loop shorting.\n     *\n     * @private\n     * @param {Function} func The function to modify.\n     * @param {Function} string The `toString` result.\n     * @returns {Function} Returns `func`.\n     */\n    var baseSetToString = !defineProperty ? identity : function(func, string) {\n      return defineProperty(func, 'toString', {\n        'configurable': true,\n        'enumerable': false,\n        'value': constant(string),\n        'writable': true\n      });\n    };\n\n    /**\n     * The base implementation of `_.shuffle`.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to shuffle.\n     * @returns {Array} Returns the new shuffled array.\n     */\n    function baseShuffle(collection) {\n      return shuffleSelf(values(collection));\n    }\n\n    /**\n     * The base implementation of `_.slice` without an iteratee call guard.\n     *\n     * @private\n     * @param {Array} array The array to slice.\n     * @param {number} [start=0] The start position.\n     * @param {number} [end=array.length] The end position.\n     * @returns {Array} Returns the slice of `array`.\n     */\n    function baseSlice(array, start, end) {\n      var index = -1,\n          length = array.length;\n\n      if (start < 0) {\n        start = -start > length ? 0 : (length + start);\n      }\n      end = end > length ? length : end;\n      if (end < 0) {\n        end += length;\n      }\n      length = start > end ? 0 : ((end - start) >>> 0);\n      start >>>= 0;\n\n      var result = Array(length);\n      while (++index < length) {\n        result[index] = array[index + start];\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.some` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} predicate The function invoked per iteration.\n     * @returns {boolean} Returns `true` if any element passes the predicate check,\n     *  else `false`.\n     */\n    function baseSome(collection, predicate) {\n      var result;\n\n      baseEach(collection, function(value, index, collection) {\n        result = predicate(value, index, collection);\n        return !result;\n      });\n      return !!result;\n    }\n\n    /**\n     * The base implementation of `_.sortedIndex` and `_.sortedLastIndex` which\n     * performs a binary search of `array` to determine the index at which `value`\n     * should be inserted into `array` in order to maintain its sort order.\n     *\n     * @private\n     * @param {Array} array The sorted array to inspect.\n     * @param {*} value The value to evaluate.\n     * @param {boolean} [retHighest] Specify returning the highest qualified index.\n     * @returns {number} Returns the index at which `value` should be inserted\n     *  into `array`.\n     */\n    function baseSortedIndex(array, value, retHighest) {\n      var low = 0,\n          high = array == null ? low : array.length;\n\n      if (typeof value == 'number' && value === value && high <= HALF_MAX_ARRAY_LENGTH) {\n        while (low < high) {\n          var mid = (low + high) >>> 1,\n              computed = array[mid];\n\n          if (computed !== null && !isSymbol(computed) &&\n              (retHighest ? (computed <= value) : (computed < value))) {\n            low = mid + 1;\n          } else {\n            high = mid;\n          }\n        }\n        return high;\n      }\n      return baseSortedIndexBy(array, value, identity, retHighest);\n    }\n\n    /**\n     * The base implementation of `_.sortedIndexBy` and `_.sortedLastIndexBy`\n     * which invokes `iteratee` for `value` and each element of `array` to compute\n     * their sort ranking. The iteratee is invoked with one argument; (value).\n     *\n     * @private\n     * @param {Array} array The sorted array to inspect.\n     * @param {*} value The value to evaluate.\n     * @param {Function} iteratee The iteratee invoked per element.\n     * @param {boolean} [retHighest] Specify returning the highest qualified index.\n     * @returns {number} Returns the index at which `value` should be inserted\n     *  into `array`.\n     */\n    function baseSortedIndexBy(array, value, iteratee, retHighest) {\n      var low = 0,\n          high = array == null ? 0 : array.length;\n      if (high === 0) {\n        return 0;\n      }\n\n      value = iteratee(value);\n      var valIsNaN = value !== value,\n          valIsNull = value === null,\n          valIsSymbol = isSymbol(value),\n          valIsUndefined = value === undefined;\n\n      while (low < high) {\n        var mid = nativeFloor((low + high) / 2),\n            computed = iteratee(array[mid]),\n            othIsDefined = computed !== undefined,\n            othIsNull = computed === null,\n            othIsReflexive = computed === computed,\n            othIsSymbol = isSymbol(computed);\n\n        if (valIsNaN) {\n          var setLow = retHighest || othIsReflexive;\n        } else if (valIsUndefined) {\n          setLow = othIsReflexive && (retHighest || othIsDefined);\n        } else if (valIsNull) {\n          setLow = othIsReflexive && othIsDefined && (retHighest || !othIsNull);\n        } else if (valIsSymbol) {\n          setLow = othIsReflexive && othIsDefined && !othIsNull && (retHighest || !othIsSymbol);\n        } else if (othIsNull || othIsSymbol) {\n          setLow = false;\n        } else {\n          setLow = retHighest ? (computed <= value) : (computed < value);\n        }\n        if (setLow) {\n          low = mid + 1;\n        } else {\n          high = mid;\n        }\n      }\n      return nativeMin(high, MAX_ARRAY_INDEX);\n    }\n\n    /**\n     * The base implementation of `_.sortedUniq` and `_.sortedUniqBy` without\n     * support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array} array The array to inspect.\n     * @param {Function} [iteratee] The iteratee invoked per element.\n     * @returns {Array} Returns the new duplicate free array.\n     */\n    function baseSortedUniq(array, iteratee) {\n      var index = -1,\n          length = array.length,\n          resIndex = 0,\n          result = [];\n\n      while (++index < length) {\n        var value = array[index],\n            computed = iteratee ? iteratee(value) : value;\n\n        if (!index || !eq(computed, seen)) {\n          var seen = computed;\n          result[resIndex++] = value === 0 ? 0 : value;\n        }\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.toNumber` which doesn't ensure correct\n     * conversions of binary, hexadecimal, or octal string values.\n     *\n     * @private\n     * @param {*} value The value to process.\n     * @returns {number} Returns the number.\n     */\n    function baseToNumber(value) {\n      if (typeof value == 'number') {\n        return value;\n      }\n      if (isSymbol(value)) {\n        return NAN;\n      }\n      return +value;\n    }\n\n    /**\n     * The base implementation of `_.toString` which doesn't convert nullish\n     * values to empty strings.\n     *\n     * @private\n     * @param {*} value The value to process.\n     * @returns {string} Returns the string.\n     */\n    function baseToString(value) {\n      // Exit early for strings to avoid a performance hit in some environments.\n      if (typeof value == 'string') {\n        return value;\n      }\n      if (isArray(value)) {\n        // Recursively convert values (susceptible to call stack limits).\n        return arrayMap(value, baseToString) + '';\n      }\n      if (isSymbol(value)) {\n        return symbolToString ? symbolToString.call(value) : '';\n      }\n      var result = (value + '');\n      return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n    }\n\n    /**\n     * The base implementation of `_.uniqBy` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array} array The array to inspect.\n     * @param {Function} [iteratee] The iteratee invoked per element.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new duplicate free array.\n     */\n    function baseUniq(array, iteratee, comparator) {\n      var index = -1,\n          includes = arrayIncludes,\n          length = array.length,\n          isCommon = true,\n          result = [],\n          seen = result;\n\n      if (comparator) {\n        isCommon = false;\n        includes = arrayIncludesWith;\n      }\n      else if (length >= LARGE_ARRAY_SIZE) {\n        var set = iteratee ? null : createSet(array);\n        if (set) {\n          return setToArray(set);\n        }\n        isCommon = false;\n        includes = cacheHas;\n        seen = new SetCache;\n      }\n      else {\n        seen = iteratee ? [] : result;\n      }\n      outer:\n      while (++index < length) {\n        var value = array[index],\n            computed = iteratee ? iteratee(value) : value;\n\n        value = (comparator || value !== 0) ? value : 0;\n        if (isCommon && computed === computed) {\n          var seenIndex = seen.length;\n          while (seenIndex--) {\n            if (seen[seenIndex] === computed) {\n              continue outer;\n            }\n          }\n          if (iteratee) {\n            seen.push(computed);\n          }\n          result.push(value);\n        }\n        else if (!includes(seen, computed, comparator)) {\n          if (seen !== result) {\n            seen.push(computed);\n          }\n          result.push(value);\n        }\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.unset`.\n     *\n     * @private\n     * @param {Object} object The object to modify.\n     * @param {Array|string} path The property path to unset.\n     * @returns {boolean} Returns `true` if the property is deleted, else `false`.\n     */\n    function baseUnset(object, path) {\n      path = castPath(path, object);\n      object = parent(object, path);\n      return object == null || delete object[toKey(last(path))];\n    }\n\n    /**\n     * The base implementation of `_.update`.\n     *\n     * @private\n     * @param {Object} object The object to modify.\n     * @param {Array|string} path The path of the property to update.\n     * @param {Function} updater The function to produce the updated value.\n     * @param {Function} [customizer] The function to customize path creation.\n     * @returns {Object} Returns `object`.\n     */\n    function baseUpdate(object, path, updater, customizer) {\n      return baseSet(object, path, updater(baseGet(object, path)), customizer);\n    }\n\n    /**\n     * The base implementation of methods like `_.dropWhile` and `_.takeWhile`\n     * without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array} array The array to query.\n     * @param {Function} predicate The function invoked per iteration.\n     * @param {boolean} [isDrop] Specify dropping elements instead of taking them.\n     * @param {boolean} [fromRight] Specify iterating from right to left.\n     * @returns {Array} Returns the slice of `array`.\n     */\n    function baseWhile(array, predicate, isDrop, fromRight) {\n      var length = array.length,\n          index = fromRight ? length : -1;\n\n      while ((fromRight ? index-- : ++index < length) &&\n        predicate(array[index], index, array)) {}\n\n      return isDrop\n        ? baseSlice(array, (fromRight ? 0 : index), (fromRight ? index + 1 : length))\n        : baseSlice(array, (fromRight ? index + 1 : 0), (fromRight ? length : index));\n    }\n\n    /**\n     * The base implementation of `wrapperValue` which returns the result of\n     * performing a sequence of actions on the unwrapped `value`, where each\n     * successive action is supplied the return value of the previous.\n     *\n     * @private\n     * @param {*} value The unwrapped value.\n     * @param {Array} actions Actions to perform to resolve the unwrapped value.\n     * @returns {*} Returns the resolved value.\n     */\n    function baseWrapperValue(value, actions) {\n      var result = value;\n      if (result instanceof LazyWrapper) {\n        result = result.value();\n      }\n      return arrayReduce(actions, function(result, action) {\n        return action.func.apply(action.thisArg, arrayPush([result], action.args));\n      }, result);\n    }\n\n    /**\n     * The base implementation of methods like `_.xor`, without support for\n     * iteratee shorthands, that accepts an array of arrays to inspect.\n     *\n     * @private\n     * @param {Array} arrays The arrays to inspect.\n     * @param {Function} [iteratee] The iteratee invoked per element.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new array of values.\n     */\n    function baseXor(arrays, iteratee, comparator) {\n      var length = arrays.length;\n      if (length < 2) {\n        return length ? baseUniq(arrays[0]) : [];\n      }\n      var index = -1,\n          result = Array(length);\n\n      while (++index < length) {\n        var array = arrays[index],\n            othIndex = -1;\n\n        while (++othIndex < length) {\n          if (othIndex != index) {\n            result[index] = baseDifference(result[index] || array, arrays[othIndex], iteratee, comparator);\n          }\n        }\n      }\n      return baseUniq(baseFlatten(result, 1), iteratee, comparator);\n    }\n\n    /**\n     * This base implementation of `_.zipObject` which assigns values using `assignFunc`.\n     *\n     * @private\n     * @param {Array} props The property identifiers.\n     * @param {Array} values The property values.\n     * @param {Function} assignFunc The function to assign values.\n     * @returns {Object} Returns the new object.\n     */\n    function baseZipObject(props, values, assignFunc) {\n      var index = -1,\n          length = props.length,\n          valsLength = values.length,\n          result = {};\n\n      while (++index < length) {\n        var value = index < valsLength ? values[index] : undefined;\n        assignFunc(result, props[index], value);\n      }\n      return result;\n    }\n\n    /**\n     * Casts `value` to an empty array if it's not an array like object.\n     *\n     * @private\n     * @param {*} value The value to inspect.\n     * @returns {Array|Object} Returns the cast array-like object.\n     */\n    function castArrayLikeObject(value) {\n      return isArrayLikeObject(value) ? value : [];\n    }\n\n    /**\n     * Casts `value` to `identity` if it's not a function.\n     *\n     * @private\n     * @param {*} value The value to inspect.\n     * @returns {Function} Returns cast function.\n     */\n    function castFunction(value) {\n      return typeof value == 'function' ? value : identity;\n    }\n\n    /**\n     * Casts `value` to a path array if it's not one.\n     *\n     * @private\n     * @param {*} value The value to inspect.\n     * @param {Object} [object] The object to query keys on.\n     * @returns {Array} Returns the cast property path array.\n     */\n    function castPath(value, object) {\n      if (isArray(value)) {\n        return value;\n      }\n      return isKey(value, object) ? [value] : stringToPath(toString(value));\n    }\n\n    /**\n     * A `baseRest` alias which can be replaced with `identity` by module\n     * replacement plugins.\n     *\n     * @private\n     * @type {Function}\n     * @param {Function} func The function to apply a rest parameter to.\n     * @returns {Function} Returns the new function.\n     */\n    var castRest = baseRest;\n\n    /**\n     * Casts `array` to a slice if it's needed.\n     *\n     * @private\n     * @param {Array} array The array to inspect.\n     * @param {number} start The start position.\n     * @param {number} [end=array.length] The end position.\n     * @returns {Array} Returns the cast slice.\n     */\n    function castSlice(array, start, end) {\n      var length = array.length;\n      end = end === undefined ? length : end;\n      return (!start && end >= length) ? array : baseSlice(array, start, end);\n    }\n\n    /**\n     * A simple wrapper around the global [`clearTimeout`](https://mdn.io/clearTimeout).\n     *\n     * @private\n     * @param {number|Object} id The timer id or timeout object of the timer to clear.\n     */\n    var clearTimeout = ctxClearTimeout || function(id) {\n      return root.clearTimeout(id);\n    };\n\n    /**\n     * Creates a clone of  `buffer`.\n     *\n     * @private\n     * @param {Buffer} buffer The buffer to clone.\n     * @param {boolean} [isDeep] Specify a deep clone.\n     * @returns {Buffer} Returns the cloned buffer.\n     */\n    function cloneBuffer(buffer, isDeep) {\n      if (isDeep) {\n        return buffer.slice();\n      }\n      var length = buffer.length,\n          result = allocUnsafe ? allocUnsafe(length) : new buffer.constructor(length);\n\n      buffer.copy(result);\n      return result;\n    }\n\n    /**\n     * Creates a clone of `arrayBuffer`.\n     *\n     * @private\n     * @param {ArrayBuffer} arrayBuffer The array buffer to clone.\n     * @returns {ArrayBuffer} Returns the cloned array buffer.\n     */\n    function cloneArrayBuffer(arrayBuffer) {\n      var result = new arrayBuffer.constructor(arrayBuffer.byteLength);\n      new Uint8Array(result).set(new Uint8Array(arrayBuffer));\n      return result;\n    }\n\n    /**\n     * Creates a clone of `dataView`.\n     *\n     * @private\n     * @param {Object} dataView The data view to clone.\n     * @param {boolean} [isDeep] Specify a deep clone.\n     * @returns {Object} Returns the cloned data view.\n     */\n    function cloneDataView(dataView, isDeep) {\n      var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;\n      return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);\n    }\n\n    /**\n     * Creates a clone of `regexp`.\n     *\n     * @private\n     * @param {Object} regexp The regexp to clone.\n     * @returns {Object} Returns the cloned regexp.\n     */\n    function cloneRegExp(regexp) {\n      var result = new regexp.constructor(regexp.source, reFlags.exec(regexp));\n      result.lastIndex = regexp.lastIndex;\n      return result;\n    }\n\n    /**\n     * Creates a clone of the `symbol` object.\n     *\n     * @private\n     * @param {Object} symbol The symbol object to clone.\n     * @returns {Object} Returns the cloned symbol object.\n     */\n    function cloneSymbol(symbol) {\n      return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};\n    }\n\n    /**\n     * Creates a clone of `typedArray`.\n     *\n     * @private\n     * @param {Object} typedArray The typed array to clone.\n     * @param {boolean} [isDeep] Specify a deep clone.\n     * @returns {Object} Returns the cloned typed array.\n     */\n    function cloneTypedArray(typedArray, isDeep) {\n      var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;\n      return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);\n    }\n\n    /**\n     * Compares values to sort them in ascending order.\n     *\n     * @private\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {number} Returns the sort order indicator for `value`.\n     */\n    function compareAscending(value, other) {\n      if (value !== other) {\n        var valIsDefined = value !== undefined,\n            valIsNull = value === null,\n            valIsReflexive = value === value,\n            valIsSymbol = isSymbol(value);\n\n        var othIsDefined = other !== undefined,\n            othIsNull = other === null,\n            othIsReflexive = other === other,\n            othIsSymbol = isSymbol(other);\n\n        if ((!othIsNull && !othIsSymbol && !valIsSymbol && value > other) ||\n            (valIsSymbol && othIsDefined && othIsReflexive && !othIsNull && !othIsSymbol) ||\n            (valIsNull && othIsDefined && othIsReflexive) ||\n            (!valIsDefined && othIsReflexive) ||\n            !valIsReflexive) {\n          return 1;\n        }\n        if ((!valIsNull && !valIsSymbol && !othIsSymbol && value < other) ||\n            (othIsSymbol && valIsDefined && valIsReflexive && !valIsNull && !valIsSymbol) ||\n            (othIsNull && valIsDefined && valIsReflexive) ||\n            (!othIsDefined && valIsReflexive) ||\n            !othIsReflexive) {\n          return -1;\n        }\n      }\n      return 0;\n    }\n\n    /**\n     * Used by `_.orderBy` to compare multiple properties of a value to another\n     * and stable sort them.\n     *\n     * If `orders` is unspecified, all values are sorted in ascending order. Otherwise,\n     * specify an order of \"desc\" for descending or \"asc\" for ascending sort order\n     * of corresponding values.\n     *\n     * @private\n     * @param {Object} object The object to compare.\n     * @param {Object} other The other object to compare.\n     * @param {boolean[]|string[]} orders The order to sort by for each property.\n     * @returns {number} Returns the sort order indicator for `object`.\n     */\n    function compareMultiple(object, other, orders) {\n      var index = -1,\n          objCriteria = object.criteria,\n          othCriteria = other.criteria,\n          length = objCriteria.length,\n          ordersLength = orders.length;\n\n      while (++index < length) {\n        var result = compareAscending(objCriteria[index], othCriteria[index]);\n        if (result) {\n          if (index >= ordersLength) {\n            return result;\n          }\n          var order = orders[index];\n          return result * (order == 'desc' ? -1 : 1);\n        }\n      }\n      // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications\n      // that causes it, under certain circumstances, to provide the same value for\n      // `object` and `other`. See https://github.com/jashkenas/underscore/pull/1247\n      // for more details.\n      //\n      // This also ensures a stable sort in V8 and other engines.\n      // See https://bugs.chromium.org/p/v8/issues/detail?id=90 for more details.\n      return object.index - other.index;\n    }\n\n    /**\n     * Creates an array that is the composition of partially applied arguments,\n     * placeholders, and provided arguments into a single array of arguments.\n     *\n     * @private\n     * @param {Array} args The provided arguments.\n     * @param {Array} partials The arguments to prepend to those provided.\n     * @param {Array} holders The `partials` placeholder indexes.\n     * @params {boolean} [isCurried] Specify composing for a curried function.\n     * @returns {Array} Returns the new array of composed arguments.\n     */\n    function composeArgs(args, partials, holders, isCurried) {\n      var argsIndex = -1,\n          argsLength = args.length,\n          holdersLength = holders.length,\n          leftIndex = -1,\n          leftLength = partials.length,\n          rangeLength = nativeMax(argsLength - holdersLength, 0),\n          result = Array(leftLength + rangeLength),\n          isUncurried = !isCurried;\n\n      while (++leftIndex < leftLength) {\n        result[leftIndex] = partials[leftIndex];\n      }\n      while (++argsIndex < holdersLength) {\n        if (isUncurried || argsIndex < argsLength) {\n          result[holders[argsIndex]] = args[argsIndex];\n        }\n      }\n      while (rangeLength--) {\n        result[leftIndex++] = args[argsIndex++];\n      }\n      return result;\n    }\n\n    /**\n     * This function is like `composeArgs` except that the arguments composition\n     * is tailored for `_.partialRight`.\n     *\n     * @private\n     * @param {Array} args The provided arguments.\n     * @param {Array} partials The arguments to append to those provided.\n     * @param {Array} holders The `partials` placeholder indexes.\n     * @params {boolean} [isCurried] Specify composing for a curried function.\n     * @returns {Array} Returns the new array of composed arguments.\n     */\n    function composeArgsRight(args, partials, holders, isCurried) {\n      var argsIndex = -1,\n          argsLength = args.length,\n          holdersIndex = -1,\n          holdersLength = holders.length,\n          rightIndex = -1,\n          rightLength = partials.length,\n          rangeLength = nativeMax(argsLength - holdersLength, 0),\n          result = Array(rangeLength + rightLength),\n          isUncurried = !isCurried;\n\n      while (++argsIndex < rangeLength) {\n        result[argsIndex] = args[argsIndex];\n      }\n      var offset = argsIndex;\n      while (++rightIndex < rightLength) {\n        result[offset + rightIndex] = partials[rightIndex];\n      }\n      while (++holdersIndex < holdersLength) {\n        if (isUncurried || argsIndex < argsLength) {\n          result[offset + holders[holdersIndex]] = args[argsIndex++];\n        }\n      }\n      return result;\n    }\n\n    /**\n     * Copies the values of `source` to `array`.\n     *\n     * @private\n     * @param {Array} source The array to copy values from.\n     * @param {Array} [array=[]] The array to copy values to.\n     * @returns {Array} Returns `array`.\n     */\n    function copyArray(source, array) {\n      var index = -1,\n          length = source.length;\n\n      array || (array = Array(length));\n      while (++index < length) {\n        array[index] = source[index];\n      }\n      return array;\n    }\n\n    /**\n     * Copies properties of `source` to `object`.\n     *\n     * @private\n     * @param {Object} source The object to copy properties from.\n     * @param {Array} props The property identifiers to copy.\n     * @param {Object} [object={}] The object to copy properties to.\n     * @param {Function} [customizer] The function to customize copied values.\n     * @returns {Object} Returns `object`.\n     */\n    function copyObject(source, props, object, customizer) {\n      var isNew = !object;\n      object || (object = {});\n\n      var index = -1,\n          length = props.length;\n\n      while (++index < length) {\n        var key = props[index];\n\n        var newValue = customizer\n          ? customizer(object[key], source[key], key, object, source)\n          : undefined;\n\n        if (newValue === undefined) {\n          newValue = source[key];\n        }\n        if (isNew) {\n          baseAssignValue(object, key, newValue);\n        } else {\n          assignValue(object, key, newValue);\n        }\n      }\n      return object;\n    }\n\n    /**\n     * Copies own symbols of `source` to `object`.\n     *\n     * @private\n     * @param {Object} source The object to copy symbols from.\n     * @param {Object} [object={}] The object to copy symbols to.\n     * @returns {Object} Returns `object`.\n     */\n    function copySymbols(source, object) {\n      return copyObject(source, getSymbols(source), object);\n    }\n\n    /**\n     * Copies own and inherited symbols of `source` to `object`.\n     *\n     * @private\n     * @param {Object} source The object to copy symbols from.\n     * @param {Object} [object={}] The object to copy symbols to.\n     * @returns {Object} Returns `object`.\n     */\n    function copySymbolsIn(source, object) {\n      return copyObject(source, getSymbolsIn(source), object);\n    }\n\n    /**\n     * Creates a function like `_.groupBy`.\n     *\n     * @private\n     * @param {Function} setter The function to set accumulator values.\n     * @param {Function} [initializer] The accumulator object initializer.\n     * @returns {Function} Returns the new aggregator function.\n     */\n    function createAggregator(setter, initializer) {\n      return function(collection, iteratee) {\n        var func = isArray(collection) ? arrayAggregator : baseAggregator,\n            accumulator = initializer ? initializer() : {};\n\n        return func(collection, setter, getIteratee(iteratee, 2), accumulator);\n      };\n    }\n\n    /**\n     * Creates a function like `_.assign`.\n     *\n     * @private\n     * @param {Function} assigner The function to assign values.\n     * @returns {Function} Returns the new assigner function.\n     */\n    function createAssigner(assigner) {\n      return baseRest(function(object, sources) {\n        var index = -1,\n            length = sources.length,\n            customizer = length > 1 ? sources[length - 1] : undefined,\n            guard = length > 2 ? sources[2] : undefined;\n\n        customizer = (assigner.length > 3 && typeof customizer == 'function')\n          ? (length--, customizer)\n          : undefined;\n\n        if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n          customizer = length < 3 ? undefined : customizer;\n          length = 1;\n        }\n        object = Object(object);\n        while (++index < length) {\n          var source = sources[index];\n          if (source) {\n            assigner(object, source, index, customizer);\n          }\n        }\n        return object;\n      });\n    }\n\n    /**\n     * Creates a `baseEach` or `baseEachRight` function.\n     *\n     * @private\n     * @param {Function} eachFunc The function to iterate over a collection.\n     * @param {boolean} [fromRight] Specify iterating from right to left.\n     * @returns {Function} Returns the new base function.\n     */\n    function createBaseEach(eachFunc, fromRight) {\n      return function(collection, iteratee) {\n        if (collection == null) {\n          return collection;\n        }\n        if (!isArrayLike(collection)) {\n          return eachFunc(collection, iteratee);\n        }\n        var length = collection.length,\n            index = fromRight ? length : -1,\n            iterable = Object(collection);\n\n        while ((fromRight ? index-- : ++index < length)) {\n          if (iteratee(iterable[index], index, iterable) === false) {\n            break;\n          }\n        }\n        return collection;\n      };\n    }\n\n    /**\n     * Creates a base function for methods like `_.forIn` and `_.forOwn`.\n     *\n     * @private\n     * @param {boolean} [fromRight] Specify iterating from right to left.\n     * @returns {Function} Returns the new base function.\n     */\n    function createBaseFor(fromRight) {\n      return function(object, iteratee, keysFunc) {\n        var index = -1,\n            iterable = Object(object),\n            props = keysFunc(object),\n            length = props.length;\n\n        while (length--) {\n          var key = props[fromRight ? length : ++index];\n          if (iteratee(iterable[key], key, iterable) === false) {\n            break;\n          }\n        }\n        return object;\n      };\n    }\n\n    /**\n     * Creates a function that wraps `func` to invoke it with the optional `this`\n     * binding of `thisArg`.\n     *\n     * @private\n     * @param {Function} func The function to wrap.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @param {*} [thisArg] The `this` binding of `func`.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createBind(func, bitmask, thisArg) {\n      var isBind = bitmask & WRAP_BIND_FLAG,\n          Ctor = createCtor(func);\n\n      function wrapper() {\n        var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n        return fn.apply(isBind ? thisArg : this, arguments);\n      }\n      return wrapper;\n    }\n\n    /**\n     * Creates a function like `_.lowerFirst`.\n     *\n     * @private\n     * @param {string} methodName The name of the `String` case method to use.\n     * @returns {Function} Returns the new case function.\n     */\n    function createCaseFirst(methodName) {\n      return function(string) {\n        string = toString(string);\n\n        var strSymbols = hasUnicode(string)\n          ? stringToArray(string)\n          : undefined;\n\n        var chr = strSymbols\n          ? strSymbols[0]\n          : string.charAt(0);\n\n        var trailing = strSymbols\n          ? castSlice(strSymbols, 1).join('')\n          : string.slice(1);\n\n        return chr[methodName]() + trailing;\n      };\n    }\n\n    /**\n     * Creates a function like `_.camelCase`.\n     *\n     * @private\n     * @param {Function} callback The function to combine each word.\n     * @returns {Function} Returns the new compounder function.\n     */\n    function createCompounder(callback) {\n      return function(string) {\n        return arrayReduce(words(deburr(string).replace(reApos, '')), callback, '');\n      };\n    }\n\n    /**\n     * Creates a function that produces an instance of `Ctor` regardless of\n     * whether it was invoked as part of a `new` expression or by `call` or `apply`.\n     *\n     * @private\n     * @param {Function} Ctor The constructor to wrap.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createCtor(Ctor) {\n      return function() {\n        // Use a `switch` statement to work with class constructors. See\n        // http://ecma-international.org/ecma-262/7.0/#sec-ecmascript-function-objects-call-thisargument-argumentslist\n        // for more details.\n        var args = arguments;\n        switch (args.length) {\n          case 0: return new Ctor;\n          case 1: return new Ctor(args[0]);\n          case 2: return new Ctor(args[0], args[1]);\n          case 3: return new Ctor(args[0], args[1], args[2]);\n          case 4: return new Ctor(args[0], args[1], args[2], args[3]);\n          case 5: return new Ctor(args[0], args[1], args[2], args[3], args[4]);\n          case 6: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5]);\n          case 7: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5], args[6]);\n        }\n        var thisBinding = baseCreate(Ctor.prototype),\n            result = Ctor.apply(thisBinding, args);\n\n        // Mimic the constructor's `return` behavior.\n        // See https://es5.github.io/#x13.2.2 for more details.\n        return isObject(result) ? result : thisBinding;\n      };\n    }\n\n    /**\n     * Creates a function that wraps `func` to enable currying.\n     *\n     * @private\n     * @param {Function} func The function to wrap.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @param {number} arity The arity of `func`.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createCurry(func, bitmask, arity) {\n      var Ctor = createCtor(func);\n\n      function wrapper() {\n        var length = arguments.length,\n            args = Array(length),\n            index = length,\n            placeholder = getHolder(wrapper);\n\n        while (index--) {\n          args[index] = arguments[index];\n        }\n        var holders = (length < 3 && args[0] !== placeholder && args[length - 1] !== placeholder)\n          ? []\n          : replaceHolders(args, placeholder);\n\n        length -= holders.length;\n        if (length < arity) {\n          return createRecurry(\n            func, bitmask, createHybrid, wrapper.placeholder, undefined,\n            args, holders, undefined, undefined, arity - length);\n        }\n        var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n        return apply(fn, this, args);\n      }\n      return wrapper;\n    }\n\n    /**\n     * Creates a `_.find` or `_.findLast` function.\n     *\n     * @private\n     * @param {Function} findIndexFunc The function to find the collection index.\n     * @returns {Function} Returns the new find function.\n     */\n    function createFind(findIndexFunc) {\n      return function(collection, predicate, fromIndex) {\n        var iterable = Object(collection);\n        if (!isArrayLike(collection)) {\n          var iteratee = getIteratee(predicate, 3);\n          collection = keys(collection);\n          predicate = function(key) { return iteratee(iterable[key], key, iterable); };\n        }\n        var index = findIndexFunc(collection, predicate, fromIndex);\n        return index > -1 ? iterable[iteratee ? collection[index] : index] : undefined;\n      };\n    }\n\n    /**\n     * Creates a `_.flow` or `_.flowRight` function.\n     *\n     * @private\n     * @param {boolean} [fromRight] Specify iterating from right to left.\n     * @returns {Function} Returns the new flow function.\n     */\n    function createFlow(fromRight) {\n      return flatRest(function(funcs) {\n        var length = funcs.length,\n            index = length,\n            prereq = LodashWrapper.prototype.thru;\n\n        if (fromRight) {\n          funcs.reverse();\n        }\n        while (index--) {\n          var func = funcs[index];\n          if (typeof func != 'function') {\n            throw new TypeError(FUNC_ERROR_TEXT);\n          }\n          if (prereq && !wrapper && getFuncName(func) == 'wrapper') {\n            var wrapper = new LodashWrapper([], true);\n          }\n        }\n        index = wrapper ? index : length;\n        while (++index < length) {\n          func = funcs[index];\n\n          var funcName = getFuncName(func),\n              data = funcName == 'wrapper' ? getData(func) : undefined;\n\n          if (data && isLaziable(data[0]) &&\n                data[1] == (WRAP_ARY_FLAG | WRAP_CURRY_FLAG | WRAP_PARTIAL_FLAG | WRAP_REARG_FLAG) &&\n                !data[4].length && data[9] == 1\n              ) {\n            wrapper = wrapper[getFuncName(data[0])].apply(wrapper, data[3]);\n          } else {\n            wrapper = (func.length == 1 && isLaziable(func))\n              ? wrapper[funcName]()\n              : wrapper.thru(func);\n          }\n        }\n        return function() {\n          var args = arguments,\n              value = args[0];\n\n          if (wrapper && args.length == 1 && isArray(value)) {\n            return wrapper.plant(value).value();\n          }\n          var index = 0,\n              result = length ? funcs[index].apply(this, args) : value;\n\n          while (++index < length) {\n            result = funcs[index].call(this, result);\n          }\n          return result;\n        };\n      });\n    }\n\n    /**\n     * Creates a function that wraps `func` to invoke it with optional `this`\n     * binding of `thisArg`, partial application, and currying.\n     *\n     * @private\n     * @param {Function|string} func The function or method name to wrap.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @param {*} [thisArg] The `this` binding of `func`.\n     * @param {Array} [partials] The arguments to prepend to those provided to\n     *  the new function.\n     * @param {Array} [holders] The `partials` placeholder indexes.\n     * @param {Array} [partialsRight] The arguments to append to those provided\n     *  to the new function.\n     * @param {Array} [holdersRight] The `partialsRight` placeholder indexes.\n     * @param {Array} [argPos] The argument positions of the new function.\n     * @param {number} [ary] The arity cap of `func`.\n     * @param {number} [arity] The arity of `func`.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createHybrid(func, bitmask, thisArg, partials, holders, partialsRight, holdersRight, argPos, ary, arity) {\n      var isAry = bitmask & WRAP_ARY_FLAG,\n          isBind = bitmask & WRAP_BIND_FLAG,\n          isBindKey = bitmask & WRAP_BIND_KEY_FLAG,\n          isCurried = bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG),\n          isFlip = bitmask & WRAP_FLIP_FLAG,\n          Ctor = isBindKey ? undefined : createCtor(func);\n\n      function wrapper() {\n        var length = arguments.length,\n            args = Array(length),\n            index = length;\n\n        while (index--) {\n          args[index] = arguments[index];\n        }\n        if (isCurried) {\n          var placeholder = getHolder(wrapper),\n              holdersCount = countHolders(args, placeholder);\n        }\n        if (partials) {\n          args = composeArgs(args, partials, holders, isCurried);\n        }\n        if (partialsRight) {\n          args = composeArgsRight(args, partialsRight, holdersRight, isCurried);\n        }\n        length -= holdersCount;\n        if (isCurried && length < arity) {\n          var newHolders = replaceHolders(args, placeholder);\n          return createRecurry(\n            func, bitmask, createHybrid, wrapper.placeholder, thisArg,\n            args, newHolders, argPos, ary, arity - length\n          );\n        }\n        var thisBinding = isBind ? thisArg : this,\n            fn = isBindKey ? thisBinding[func] : func;\n\n        length = args.length;\n        if (argPos) {\n          args = reorder(args, argPos);\n        } else if (isFlip && length > 1) {\n          args.reverse();\n        }\n        if (isAry && ary < length) {\n          args.length = ary;\n        }\n        if (this && this !== root && this instanceof wrapper) {\n          fn = Ctor || createCtor(fn);\n        }\n        return fn.apply(thisBinding, args);\n      }\n      return wrapper;\n    }\n\n    /**\n     * Creates a function like `_.invertBy`.\n     *\n     * @private\n     * @param {Function} setter The function to set accumulator values.\n     * @param {Function} toIteratee The function to resolve iteratees.\n     * @returns {Function} Returns the new inverter function.\n     */\n    function createInverter(setter, toIteratee) {\n      return function(object, iteratee) {\n        return baseInverter(object, setter, toIteratee(iteratee), {});\n      };\n    }\n\n    /**\n     * Creates a function that performs a mathematical operation on two values.\n     *\n     * @private\n     * @param {Function} operator The function to perform the operation.\n     * @param {number} [defaultValue] The value used for `undefined` arguments.\n     * @returns {Function} Returns the new mathematical operation function.\n     */\n    function createMathOperation(operator, defaultValue) {\n      return function(value, other) {\n        var result;\n        if (value === undefined && other === undefined) {\n          return defaultValue;\n        }\n        if (value !== undefined) {\n          result = value;\n        }\n        if (other !== undefined) {\n          if (result === undefined) {\n            return other;\n          }\n          if (typeof value == 'string' || typeof other == 'string') {\n            value = baseToString(value);\n            other = baseToString(other);\n          } else {\n            value = baseToNumber(value);\n            other = baseToNumber(other);\n          }\n          result = operator(value, other);\n        }\n        return result;\n      };\n    }\n\n    /**\n     * Creates a function like `_.over`.\n     *\n     * @private\n     * @param {Function} arrayFunc The function to iterate over iteratees.\n     * @returns {Function} Returns the new over function.\n     */\n    function createOver(arrayFunc) {\n      return flatRest(function(iteratees) {\n        iteratees = arrayMap(iteratees, baseUnary(getIteratee()));\n        return baseRest(function(args) {\n          var thisArg = this;\n          return arrayFunc(iteratees, function(iteratee) {\n            return apply(iteratee, thisArg, args);\n          });\n        });\n      });\n    }\n\n    /**\n     * Creates the padding for `string` based on `length`. The `chars` string\n     * is truncated if the number of characters exceeds `length`.\n     *\n     * @private\n     * @param {number} length The padding length.\n     * @param {string} [chars=' '] The string used as padding.\n     * @returns {string} Returns the padding for `string`.\n     */\n    function createPadding(length, chars) {\n      chars = chars === undefined ? ' ' : baseToString(chars);\n\n      var charsLength = chars.length;\n      if (charsLength < 2) {\n        return charsLength ? baseRepeat(chars, length) : chars;\n      }\n      var result = baseRepeat(chars, nativeCeil(length / stringSize(chars)));\n      return hasUnicode(chars)\n        ? castSlice(stringToArray(result), 0, length).join('')\n        : result.slice(0, length);\n    }\n\n    /**\n     * Creates a function that wraps `func` to invoke it with the `this` binding\n     * of `thisArg` and `partials` prepended to the arguments it receives.\n     *\n     * @private\n     * @param {Function} func The function to wrap.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @param {*} thisArg The `this` binding of `func`.\n     * @param {Array} partials The arguments to prepend to those provided to\n     *  the new function.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createPartial(func, bitmask, thisArg, partials) {\n      var isBind = bitmask & WRAP_BIND_FLAG,\n          Ctor = createCtor(func);\n\n      function wrapper() {\n        var argsIndex = -1,\n            argsLength = arguments.length,\n            leftIndex = -1,\n            leftLength = partials.length,\n            args = Array(leftLength + argsLength),\n            fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n\n        while (++leftIndex < leftLength) {\n          args[leftIndex] = partials[leftIndex];\n        }\n        while (argsLength--) {\n          args[leftIndex++] = arguments[++argsIndex];\n        }\n        return apply(fn, isBind ? thisArg : this, args);\n      }\n      return wrapper;\n    }\n\n    /**\n     * Creates a `_.range` or `_.rangeRight` function.\n     *\n     * @private\n     * @param {boolean} [fromRight] Specify iterating from right to left.\n     * @returns {Function} Returns the new range function.\n     */\n    function createRange(fromRight) {\n      return function(start, end, step) {\n        if (step && typeof step != 'number' && isIterateeCall(start, end, step)) {\n          end = step = undefined;\n        }\n        // Ensure the sign of `-0` is preserved.\n        start = toFinite(start);\n        if (end === undefined) {\n          end = start;\n          start = 0;\n        } else {\n          end = toFinite(end);\n        }\n        step = step === undefined ? (start < end ? 1 : -1) : toFinite(step);\n        return baseRange(start, end, step, fromRight);\n      };\n    }\n\n    /**\n     * Creates a function that performs a relational operation on two values.\n     *\n     * @private\n     * @param {Function} operator The function to perform the operation.\n     * @returns {Function} Returns the new relational operation function.\n     */\n    function createRelationalOperation(operator) {\n      return function(value, other) {\n        if (!(typeof value == 'string' && typeof other == 'string')) {\n          value = toNumber(value);\n          other = toNumber(other);\n        }\n        return operator(value, other);\n      };\n    }\n\n    /**\n     * Creates a function that wraps `func` to continue currying.\n     *\n     * @private\n     * @param {Function} func The function to wrap.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @param {Function} wrapFunc The function to create the `func` wrapper.\n     * @param {*} placeholder The placeholder value.\n     * @param {*} [thisArg] The `this` binding of `func`.\n     * @param {Array} [partials] The arguments to prepend to those provided to\n     *  the new function.\n     * @param {Array} [holders] The `partials` placeholder indexes.\n     * @param {Array} [argPos] The argument positions of the new function.\n     * @param {number} [ary] The arity cap of `func`.\n     * @param {number} [arity] The arity of `func`.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createRecurry(func, bitmask, wrapFunc, placeholder, thisArg, partials, holders, argPos, ary, arity) {\n      var isCurry = bitmask & WRAP_CURRY_FLAG,\n          newHolders = isCurry ? holders : undefined,\n          newHoldersRight = isCurry ? undefined : holders,\n          newPartials = isCurry ? partials : undefined,\n          newPartialsRight = isCurry ? undefined : partials;\n\n      bitmask |= (isCurry ? WRAP_PARTIAL_FLAG : WRAP_PARTIAL_RIGHT_FLAG);\n      bitmask &= ~(isCurry ? WRAP_PARTIAL_RIGHT_FLAG : WRAP_PARTIAL_FLAG);\n\n      if (!(bitmask & WRAP_CURRY_BOUND_FLAG)) {\n        bitmask &= ~(WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG);\n      }\n      var newData = [\n        func, bitmask, thisArg, newPartials, newHolders, newPartialsRight,\n        newHoldersRight, argPos, ary, arity\n      ];\n\n      var result = wrapFunc.apply(undefined, newData);\n      if (isLaziable(func)) {\n        setData(result, newData);\n      }\n      result.placeholder = placeholder;\n      return setWrapToString(result, func, bitmask);\n    }\n\n    /**\n     * Creates a function like `_.round`.\n     *\n     * @private\n     * @param {string} methodName The name of the `Math` method to use when rounding.\n     * @returns {Function} Returns the new round function.\n     */\n    function createRound(methodName) {\n      var func = Math[methodName];\n      return function(number, precision) {\n        number = toNumber(number);\n        precision = precision == null ? 0 : nativeMin(toInteger(precision), 292);\n        if (precision && nativeIsFinite(number)) {\n          // Shift with exponential notation to avoid floating-point issues.\n          // See [MDN](https://mdn.io/round#Examples) for more details.\n          var pair = (toString(number) + 'e').split('e'),\n              value = func(pair[0] + 'e' + (+pair[1] + precision));\n\n          pair = (toString(value) + 'e').split('e');\n          return +(pair[0] + 'e' + (+pair[1] - precision));\n        }\n        return func(number);\n      };\n    }\n\n    /**\n     * Creates a set object of `values`.\n     *\n     * @private\n     * @param {Array} values The values to add to the set.\n     * @returns {Object} Returns the new set.\n     */\n    var createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {\n      return new Set(values);\n    };\n\n    /**\n     * Creates a `_.toPairs` or `_.toPairsIn` function.\n     *\n     * @private\n     * @param {Function} keysFunc The function to get the keys of a given object.\n     * @returns {Function} Returns the new pairs function.\n     */\n    function createToPairs(keysFunc) {\n      return function(object) {\n        var tag = getTag(object);\n        if (tag == mapTag) {\n          return mapToArray(object);\n        }\n        if (tag == setTag) {\n          return setToPairs(object);\n        }\n        return baseToPairs(object, keysFunc(object));\n      };\n    }\n\n    /**\n     * Creates a function that either curries or invokes `func` with optional\n     * `this` binding and partially applied arguments.\n     *\n     * @private\n     * @param {Function|string} func The function or method name to wrap.\n     * @param {number} bitmask The bitmask flags.\n     *    1 - `_.bind`\n     *    2 - `_.bindKey`\n     *    4 - `_.curry` or `_.curryRight` of a bound function\n     *    8 - `_.curry`\n     *   16 - `_.curryRight`\n     *   32 - `_.partial`\n     *   64 - `_.partialRight`\n     *  128 - `_.rearg`\n     *  256 - `_.ary`\n     *  512 - `_.flip`\n     * @param {*} [thisArg] The `this` binding of `func`.\n     * @param {Array} [partials] The arguments to be partially applied.\n     * @param {Array} [holders] The `partials` placeholder indexes.\n     * @param {Array} [argPos] The argument positions of the new function.\n     * @param {number} [ary] The arity cap of `func`.\n     * @param {number} [arity] The arity of `func`.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createWrap(func, bitmask, thisArg, partials, holders, argPos, ary, arity) {\n      var isBindKey = bitmask & WRAP_BIND_KEY_FLAG;\n      if (!isBindKey && typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      var length = partials ? partials.length : 0;\n      if (!length) {\n        bitmask &= ~(WRAP_PARTIAL_FLAG | WRAP_PARTIAL_RIGHT_FLAG);\n        partials = holders = undefined;\n      }\n      ary = ary === undefined ? ary : nativeMax(toInteger(ary), 0);\n      arity = arity === undefined ? arity : toInteger(arity);\n      length -= holders ? holders.length : 0;\n\n      if (bitmask & WRAP_PARTIAL_RIGHT_FLAG) {\n        var partialsRight = partials,\n            holdersRight = holders;\n\n        partials = holders = undefined;\n      }\n      var data = isBindKey ? undefined : getData(func);\n\n      var newData = [\n        func, bitmask, thisArg, partials, holders, partialsRight, holdersRight,\n        argPos, ary, arity\n      ];\n\n      if (data) {\n        mergeData(newData, data);\n      }\n      func = newData[0];\n      bitmask = newData[1];\n      thisArg = newData[2];\n      partials = newData[3];\n      holders = newData[4];\n      arity = newData[9] = newData[9] === undefined\n        ? (isBindKey ? 0 : func.length)\n        : nativeMax(newData[9] - length, 0);\n\n      if (!arity && bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG)) {\n        bitmask &= ~(WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG);\n      }\n      if (!bitmask || bitmask == WRAP_BIND_FLAG) {\n        var result = createBind(func, bitmask, thisArg);\n      } else if (bitmask == WRAP_CURRY_FLAG || bitmask == WRAP_CURRY_RIGHT_FLAG) {\n        result = createCurry(func, bitmask, arity);\n      } else if ((bitmask == WRAP_PARTIAL_FLAG || bitmask == (WRAP_BIND_FLAG | WRAP_PARTIAL_FLAG)) && !holders.length) {\n        result = createPartial(func, bitmask, thisArg, partials);\n      } else {\n        result = createHybrid.apply(undefined, newData);\n      }\n      var setter = data ? baseSetData : setData;\n      return setWrapToString(setter(result, newData), func, bitmask);\n    }\n\n    /**\n     * Used by `_.defaults` to customize its `_.assignIn` use to assign properties\n     * of source objects to the destination object for all destination properties\n     * that resolve to `undefined`.\n     *\n     * @private\n     * @param {*} objValue The destination value.\n     * @param {*} srcValue The source value.\n     * @param {string} key The key of the property to assign.\n     * @param {Object} object The parent object of `objValue`.\n     * @returns {*} Returns the value to assign.\n     */\n    function customDefaultsAssignIn(objValue, srcValue, key, object) {\n      if (objValue === undefined ||\n          (eq(objValue, objectProto[key]) && !hasOwnProperty.call(object, key))) {\n        return srcValue;\n      }\n      return objValue;\n    }\n\n    /**\n     * Used by `_.defaultsDeep` to customize its `_.merge` use to merge source\n     * objects into destination objects that are passed thru.\n     *\n     * @private\n     * @param {*} objValue The destination value.\n     * @param {*} srcValue The source value.\n     * @param {string} key The key of the property to merge.\n     * @param {Object} object The parent object of `objValue`.\n     * @param {Object} source The parent object of `srcValue`.\n     * @param {Object} [stack] Tracks traversed source values and their merged\n     *  counterparts.\n     * @returns {*} Returns the value to assign.\n     */\n    function customDefaultsMerge(objValue, srcValue, key, object, source, stack) {\n      if (isObject(objValue) && isObject(srcValue)) {\n        // Recursively merge objects and arrays (susceptible to call stack limits).\n        stack.set(srcValue, objValue);\n        baseMerge(objValue, srcValue, undefined, customDefaultsMerge, stack);\n        stack['delete'](srcValue);\n      }\n      return objValue;\n    }\n\n    /**\n     * Used by `_.omit` to customize its `_.cloneDeep` use to only clone plain\n     * objects.\n     *\n     * @private\n     * @param {*} value The value to inspect.\n     * @param {string} key The key of the property to inspect.\n     * @returns {*} Returns the uncloned value or `undefined` to defer cloning to `_.cloneDeep`.\n     */\n    function customOmitClone(value) {\n      return isPlainObject(value) ? undefined : value;\n    }\n\n    /**\n     * A specialized version of `baseIsEqualDeep` for arrays with support for\n     * partial deep comparisons.\n     *\n     * @private\n     * @param {Array} array The array to compare.\n     * @param {Array} other The other array to compare.\n     * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n     * @param {Function} customizer The function to customize comparisons.\n     * @param {Function} equalFunc The function to determine equivalents of values.\n     * @param {Object} stack Tracks traversed `array` and `other` objects.\n     * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.\n     */\n    function equalArrays(array, other, bitmask, customizer, equalFunc, stack) {\n      var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n          arrLength = array.length,\n          othLength = other.length;\n\n      if (arrLength != othLength && !(isPartial && othLength > arrLength)) {\n        return false;\n      }\n      // Check that cyclic values are equal.\n      var arrStacked = stack.get(array);\n      var othStacked = stack.get(other);\n      if (arrStacked && othStacked) {\n        return arrStacked == other && othStacked == array;\n      }\n      var index = -1,\n          result = true,\n          seen = (bitmask & COMPARE_UNORDERED_FLAG) ? new SetCache : undefined;\n\n      stack.set(array, other);\n      stack.set(other, array);\n\n      // Ignore non-index properties.\n      while (++index < arrLength) {\n        var arrValue = array[index],\n            othValue = other[index];\n\n        if (customizer) {\n          var compared = isPartial\n            ? customizer(othValue, arrValue, index, other, array, stack)\n            : customizer(arrValue, othValue, index, array, other, stack);\n        }\n        if (compared !== undefined) {\n          if (compared) {\n            continue;\n          }\n          result = false;\n          break;\n        }\n        // Recursively compare arrays (susceptible to call stack limits).\n        if (seen) {\n          if (!arraySome(other, function(othValue, othIndex) {\n                if (!cacheHas(seen, othIndex) &&\n                    (arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {\n                  return seen.push(othIndex);\n                }\n              })) {\n            result = false;\n            break;\n          }\n        } else if (!(\n              arrValue === othValue ||\n                equalFunc(arrValue, othValue, bitmask, customizer, stack)\n            )) {\n          result = false;\n          break;\n        }\n      }\n      stack['delete'](array);\n      stack['delete'](other);\n      return result;\n    }\n\n    /**\n     * A specialized version of `baseIsEqualDeep` for comparing objects of\n     * the same `toStringTag`.\n     *\n     * **Note:** This function only supports comparing values with tags of\n     * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.\n     *\n     * @private\n     * @param {Object} object The object to compare.\n     * @param {Object} other The other object to compare.\n     * @param {string} tag The `toStringTag` of the objects to compare.\n     * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n     * @param {Function} customizer The function to customize comparisons.\n     * @param {Function} equalFunc The function to determine equivalents of values.\n     * @param {Object} stack Tracks traversed `object` and `other` objects.\n     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n     */\n    function equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {\n      switch (tag) {\n        case dataViewTag:\n          if ((object.byteLength != other.byteLength) ||\n              (object.byteOffset != other.byteOffset)) {\n            return false;\n          }\n          object = object.buffer;\n          other = other.buffer;\n\n        case arrayBufferTag:\n          if ((object.byteLength != other.byteLength) ||\n              !equalFunc(new Uint8Array(object), new Uint8Array(other))) {\n            return false;\n          }\n          return true;\n\n        case boolTag:\n        case dateTag:\n        case numberTag:\n          // Coerce booleans to `1` or `0` and dates to milliseconds.\n          // Invalid dates are coerced to `NaN`.\n          return eq(+object, +other);\n\n        case errorTag:\n          return object.name == other.name && object.message == other.message;\n\n        case regexpTag:\n        case stringTag:\n          // Coerce regexes to strings and treat strings, primitives and objects,\n          // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring\n          // for more details.\n          return object == (other + '');\n\n        case mapTag:\n          var convert = mapToArray;\n\n        case setTag:\n          var isPartial = bitmask & COMPARE_PARTIAL_FLAG;\n          convert || (convert = setToArray);\n\n          if (object.size != other.size && !isPartial) {\n            return false;\n          }\n          // Assume cyclic values are equal.\n          var stacked = stack.get(object);\n          if (stacked) {\n            return stacked == other;\n          }\n          bitmask |= COMPARE_UNORDERED_FLAG;\n\n          // Recursively compare objects (susceptible to call stack limits).\n          stack.set(object, other);\n          var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);\n          stack['delete'](object);\n          return result;\n\n        case symbolTag:\n          if (symbolValueOf) {\n            return symbolValueOf.call(object) == symbolValueOf.call(other);\n          }\n      }\n      return false;\n    }\n\n    /**\n     * A specialized version of `baseIsEqualDeep` for objects with support for\n     * partial deep comparisons.\n     *\n     * @private\n     * @param {Object} object The object to compare.\n     * @param {Object} other The other object to compare.\n     * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n     * @param {Function} customizer The function to customize comparisons.\n     * @param {Function} equalFunc The function to determine equivalents of values.\n     * @param {Object} stack Tracks traversed `object` and `other` objects.\n     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n     */\n    function equalObjects(object, other, bitmask, customizer, equalFunc, stack) {\n      var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n          objProps = getAllKeys(object),\n          objLength = objProps.length,\n          othProps = getAllKeys(other),\n          othLength = othProps.length;\n\n      if (objLength != othLength && !isPartial) {\n        return false;\n      }\n      var index = objLength;\n      while (index--) {\n        var key = objProps[index];\n        if (!(isPartial ? key in other : hasOwnProperty.call(other, key))) {\n          return false;\n        }\n      }\n      // Check that cyclic values are equal.\n      var objStacked = stack.get(object);\n      var othStacked = stack.get(other);\n      if (objStacked && othStacked) {\n        return objStacked == other && othStacked == object;\n      }\n      var result = true;\n      stack.set(object, other);\n      stack.set(other, object);\n\n      var skipCtor = isPartial;\n      while (++index < objLength) {\n        key = objProps[index];\n        var objValue = object[key],\n            othValue = other[key];\n\n        if (customizer) {\n          var compared = isPartial\n            ? customizer(othValue, objValue, key, other, object, stack)\n            : customizer(objValue, othValue, key, object, other, stack);\n        }\n        // Recursively compare objects (susceptible to call stack limits).\n        if (!(compared === undefined\n              ? (objValue === othValue || equalFunc(objValue, othValue, bitmask, customizer, stack))\n              : compared\n            )) {\n          result = false;\n          break;\n        }\n        skipCtor || (skipCtor = key == 'constructor');\n      }\n      if (result && !skipCtor) {\n        var objCtor = object.constructor,\n            othCtor = other.constructor;\n\n        // Non `Object` object instances with different constructors are not equal.\n        if (objCtor != othCtor &&\n            ('constructor' in object && 'constructor' in other) &&\n            !(typeof objCtor == 'function' && objCtor instanceof objCtor &&\n              typeof othCtor == 'function' && othCtor instanceof othCtor)) {\n          result = false;\n        }\n      }\n      stack['delete'](object);\n      stack['delete'](other);\n      return result;\n    }\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     */\n    function flatRest(func) {\n      return setToString(overRest(func, undefined, flatten), func + '');\n    }\n\n    /**\n     * Creates an array of own enumerable property names and symbols of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property names and symbols.\n     */\n    function getAllKeys(object) {\n      return baseGetAllKeys(object, keys, getSymbols);\n    }\n\n    /**\n     * Creates an array of own and inherited enumerable property names and\n     * symbols of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property names and symbols.\n     */\n    function getAllKeysIn(object) {\n      return baseGetAllKeys(object, keysIn, getSymbolsIn);\n    }\n\n    /**\n     * Gets metadata for `func`.\n     *\n     * @private\n     * @param {Function} func The function to query.\n     * @returns {*} Returns the metadata for `func`.\n     */\n    var getData = !metaMap ? noop : function(func) {\n      return metaMap.get(func);\n    };\n\n    /**\n     * Gets the name of `func`.\n     *\n     * @private\n     * @param {Function} func The function to query.\n     * @returns {string} Returns the function name.\n     */\n    function getFuncName(func) {\n      var result = (func.name + ''),\n          array = realNames[result],\n          length = hasOwnProperty.call(realNames, result) ? array.length : 0;\n\n      while (length--) {\n        var data = array[length],\n            otherFunc = data.func;\n        if (otherFunc == null || otherFunc == func) {\n          return data.name;\n        }\n      }\n      return result;\n    }\n\n    /**\n     * Gets the argument placeholder value for `func`.\n     *\n     * @private\n     * @param {Function} func The function to inspect.\n     * @returns {*} Returns the placeholder value.\n     */\n    function getHolder(func) {\n      var object = hasOwnProperty.call(lodash, 'placeholder') ? lodash : func;\n      return object.placeholder;\n    }\n\n    /**\n     * Gets the appropriate \"iteratee\" function. If `_.iteratee` is customized,\n     * this function returns the custom method, otherwise it returns `baseIteratee`.\n     * If arguments are provided, the chosen function is invoked with them and\n     * its result is returned.\n     *\n     * @private\n     * @param {*} [value] The value to convert to an iteratee.\n     * @param {number} [arity] The arity of the created iteratee.\n     * @returns {Function} Returns the chosen function or its result.\n     */\n    function getIteratee() {\n      var result = lodash.iteratee || iteratee;\n      result = result === iteratee ? baseIteratee : result;\n      return arguments.length ? result(arguments[0], arguments[1]) : result;\n    }\n\n    /**\n     * Gets the data for `map`.\n     *\n     * @private\n     * @param {Object} map The map to query.\n     * @param {string} key The reference key.\n     * @returns {*} Returns the map data.\n     */\n    function getMapData(map, key) {\n      var data = map.__data__;\n      return isKeyable(key)\n        ? data[typeof key == 'string' ? 'string' : 'hash']\n        : data.map;\n    }\n\n    /**\n     * Gets the property names, values, and compare flags of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the match data of `object`.\n     */\n    function getMatchData(object) {\n      var result = keys(object),\n          length = result.length;\n\n      while (length--) {\n        var key = result[length],\n            value = object[key];\n\n        result[length] = [key, value, isStrictComparable(value)];\n      }\n      return result;\n    }\n\n    /**\n     * Gets the native function at `key` of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @param {string} key The key of the method to get.\n     * @returns {*} Returns the function if it's native, else `undefined`.\n     */\n    function getNative(object, key) {\n      var value = getValue(object, key);\n      return baseIsNative(value) ? value : undefined;\n    }\n\n    /**\n     * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n     *\n     * @private\n     * @param {*} value The value to query.\n     * @returns {string} Returns the raw `toStringTag`.\n     */\n    function getRawTag(value) {\n      var isOwn = hasOwnProperty.call(value, symToStringTag),\n          tag = value[symToStringTag];\n\n      try {\n        value[symToStringTag] = undefined;\n        var unmasked = true;\n      } catch (e) {}\n\n      var result = nativeObjectToString.call(value);\n      if (unmasked) {\n        if (isOwn) {\n          value[symToStringTag] = tag;\n        } else {\n          delete value[symToStringTag];\n        }\n      }\n      return result;\n    }\n\n    /**\n     * Creates an array of the own enumerable symbols of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of symbols.\n     */\n    var getSymbols = !nativeGetSymbols ? stubArray : function(object) {\n      if (object == null) {\n        return [];\n      }\n      object = Object(object);\n      return arrayFilter(nativeGetSymbols(object), function(symbol) {\n        return propertyIsEnumerable.call(object, symbol);\n      });\n    };\n\n    /**\n     * Creates an array of the own and inherited enumerable symbols of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of symbols.\n     */\n    var getSymbolsIn = !nativeGetSymbols ? stubArray : function(object) {\n      var result = [];\n      while (object) {\n        arrayPush(result, getSymbols(object));\n        object = getPrototype(object);\n      }\n      return result;\n    };\n\n    /**\n     * Gets the `toStringTag` of `value`.\n     *\n     * @private\n     * @param {*} value The value to query.\n     * @returns {string} Returns the `toStringTag`.\n     */\n    var getTag = baseGetTag;\n\n    // Fallback for data views, maps, sets, and weak maps in IE 11 and promises in Node.js < 6.\n    if ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) ||\n        (Map && getTag(new Map) != mapTag) ||\n        (Promise && getTag(Promise.resolve()) != promiseTag) ||\n        (Set && getTag(new Set) != setTag) ||\n        (WeakMap && getTag(new WeakMap) != weakMapTag)) {\n      getTag = function(value) {\n        var result = baseGetTag(value),\n            Ctor = result == objectTag ? value.constructor : undefined,\n            ctorString = Ctor ? toSource(Ctor) : '';\n\n        if (ctorString) {\n          switch (ctorString) {\n            case dataViewCtorString: return dataViewTag;\n            case mapCtorString: return mapTag;\n            case promiseCtorString: return promiseTag;\n            case setCtorString: return setTag;\n            case weakMapCtorString: return weakMapTag;\n          }\n        }\n        return result;\n      };\n    }\n\n    /**\n     * Gets the view, applying any `transforms` to the `start` and `end` positions.\n     *\n     * @private\n     * @param {number} start The start of the view.\n     * @param {number} end The end of the view.\n     * @param {Array} transforms The transformations to apply to the view.\n     * @returns {Object} Returns an object containing the `start` and `end`\n     *  positions of the view.\n     */\n    function getView(start, end, transforms) {\n      var index = -1,\n          length = transforms.length;\n\n      while (++index < length) {\n        var data = transforms[index],\n            size = data.size;\n\n        switch (data.type) {\n          case 'drop':      start += size; break;\n          case 'dropRight': end -= size; break;\n          case 'take':      end = nativeMin(end, start + size); break;\n          case 'takeRight': start = nativeMax(start, end - size); break;\n        }\n      }\n      return { 'start': start, 'end': end };\n    }\n\n    /**\n     * Extracts wrapper details from the `source` body comment.\n     *\n     * @private\n     * @param {string} source The source to inspect.\n     * @returns {Array} Returns the wrapper details.\n     */\n    function getWrapDetails(source) {\n      var match = source.match(reWrapDetails);\n      return match ? match[1].split(reSplitDetails) : [];\n    }\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     */\n    function 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\n    /**\n     * Initializes an array clone.\n     *\n     * @private\n     * @param {Array} array The array to clone.\n     * @returns {Array} Returns the initialized clone.\n     */\n    function initCloneArray(array) {\n      var length = array.length,\n          result = new array.constructor(length);\n\n      // Add properties assigned by `RegExp#exec`.\n      if (length && typeof array[0] == 'string' && hasOwnProperty.call(array, 'index')) {\n        result.index = array.index;\n        result.input = array.input;\n      }\n      return result;\n    }\n\n    /**\n     * Initializes an object clone.\n     *\n     * @private\n     * @param {Object} object The object to clone.\n     * @returns {Object} Returns the initialized clone.\n     */\n    function initCloneObject(object) {\n      return (typeof object.constructor == 'function' && !isPrototype(object))\n        ? baseCreate(getPrototype(object))\n        : {};\n    }\n\n    /**\n     * Initializes an object clone based on its `toStringTag`.\n     *\n     * **Note:** This function only supports cloning values with tags of\n     * `Boolean`, `Date`, `Error`, `Map`, `Number`, `RegExp`, `Set`, or `String`.\n     *\n     * @private\n     * @param {Object} object The object to clone.\n     * @param {string} tag The `toStringTag` of the object to clone.\n     * @param {boolean} [isDeep] Specify a deep clone.\n     * @returns {Object} Returns the initialized clone.\n     */\n    function initCloneByTag(object, tag, isDeep) {\n      var Ctor = object.constructor;\n      switch (tag) {\n        case arrayBufferTag:\n          return cloneArrayBuffer(object);\n\n        case boolTag:\n        case dateTag:\n          return new Ctor(+object);\n\n        case dataViewTag:\n          return cloneDataView(object, isDeep);\n\n        case float32Tag: case float64Tag:\n        case int8Tag: case int16Tag: case int32Tag:\n        case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag:\n          return cloneTypedArray(object, isDeep);\n\n        case mapTag:\n          return new Ctor;\n\n        case numberTag:\n        case stringTag:\n          return new Ctor(object);\n\n        case regexpTag:\n          return cloneRegExp(object);\n\n        case setTag:\n          return new Ctor;\n\n        case symbolTag:\n          return cloneSymbol(object);\n      }\n    }\n\n    /**\n     * Inserts wrapper `details` in a comment at the top of the `source` body.\n     *\n     * @private\n     * @param {string} source The source to modify.\n     * @returns {Array} details The details to insert.\n     * @returns {string} Returns the modified source.\n     */\n    function insertWrapDetails(source, details) {\n      var length = details.length;\n      if (!length) {\n        return source;\n      }\n      var lastIndex = length - 1;\n      details[lastIndex] = (length > 1 ? '& ' : '') + details[lastIndex];\n      details = details.join(length > 2 ? ', ' : ' ');\n      return source.replace(reWrapComment, '{\\n/* [wrapped with ' + details + '] */\\n');\n    }\n\n    /**\n     * Checks if `value` is a flattenable `arguments` object or array.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.\n     */\n    function isFlattenable(value) {\n      return isArray(value) || isArguments(value) ||\n        !!(spreadableSymbol && value && value[spreadableSymbol]);\n    }\n\n    /**\n     * Checks if `value` is a valid array-like index.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n     * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n     */\n    function isIndex(value, length) {\n      var type = typeof value;\n      length = length == null ? MAX_SAFE_INTEGER : length;\n\n      return !!length &&\n        (type == 'number' ||\n          (type != 'symbol' && reIsUint.test(value))) &&\n            (value > -1 && value % 1 == 0 && value < length);\n    }\n\n    /**\n     * Checks if the given arguments are from an iteratee call.\n     *\n     * @private\n     * @param {*} value The potential iteratee value argument.\n     * @param {*} index The potential iteratee index or key argument.\n     * @param {*} object The potential iteratee object argument.\n     * @returns {boolean} Returns `true` if the arguments are from an iteratee call,\n     *  else `false`.\n     */\n    function isIterateeCall(value, index, object) {\n      if (!isObject(object)) {\n        return false;\n      }\n      var type = typeof index;\n      if (type == 'number'\n            ? (isArrayLike(object) && isIndex(index, object.length))\n            : (type == 'string' && index in object)\n          ) {\n        return eq(object[index], value);\n      }\n      return false;\n    }\n\n    /**\n     * Checks if `value` is a property name and not a property path.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @param {Object} [object] The object to query keys on.\n     * @returns {boolean} Returns `true` if `value` is a property name, else `false`.\n     */\n    function isKey(value, object) {\n      if (isArray(value)) {\n        return false;\n      }\n      var type = typeof value;\n      if (type == 'number' || type == 'symbol' || type == 'boolean' ||\n          value == null || isSymbol(value)) {\n        return true;\n      }\n      return reIsPlainProp.test(value) || !reIsDeepProp.test(value) ||\n        (object != null && value in Object(object));\n    }\n\n    /**\n     * Checks if `value` is suitable for use as unique object key.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n     */\n    function isKeyable(value) {\n      var type = typeof value;\n      return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')\n        ? (value !== '__proto__')\n        : (value === null);\n    }\n\n    /**\n     * Checks if `func` has a lazy counterpart.\n     *\n     * @private\n     * @param {Function} func The function to check.\n     * @returns {boolean} Returns `true` if `func` has a lazy counterpart,\n     *  else `false`.\n     */\n    function isLaziable(func) {\n      var funcName = getFuncName(func),\n          other = lodash[funcName];\n\n      if (typeof other != 'function' || !(funcName in LazyWrapper.prototype)) {\n        return false;\n      }\n      if (func === other) {\n        return true;\n      }\n      var data = getData(other);\n      return !!data && func === data[0];\n    }\n\n    /**\n     * Checks if `func` has its source masked.\n     *\n     * @private\n     * @param {Function} func The function to check.\n     * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n     */\n    function isMasked(func) {\n      return !!maskSrcKey && (maskSrcKey in func);\n    }\n\n    /**\n     * Checks if `func` is capable of being masked.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `func` is maskable, else `false`.\n     */\n    var isMaskable = coreJsData ? isFunction : stubFalse;\n\n    /**\n     * Checks if `value` is likely a prototype object.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n     */\n    function isPrototype(value) {\n      var Ctor = value && value.constructor,\n          proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;\n\n      return value === proto;\n    }\n\n    /**\n     * Checks if `value` is suitable for strict equality comparisons, i.e. `===`.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` if suitable for strict\n     *  equality comparisons, else `false`.\n     */\n    function isStrictComparable(value) {\n      return value === value && !isObject(value);\n    }\n\n    /**\n     * A specialized version of `matchesProperty` for source values suitable\n     * for strict equality comparisons, i.e. `===`.\n     *\n     * @private\n     * @param {string} key The key of the property to get.\n     * @param {*} srcValue The value to match.\n     * @returns {Function} Returns the new spec function.\n     */\n    function matchesStrictComparable(key, srcValue) {\n      return function(object) {\n        if (object == null) {\n          return false;\n        }\n        return object[key] === srcValue &&\n          (srcValue !== undefined || (key in Object(object)));\n      };\n    }\n\n    /**\n     * A specialized version of `_.memoize` which clears the memoized function's\n     * cache when it exceeds `MAX_MEMOIZE_SIZE`.\n     *\n     * @private\n     * @param {Function} func The function to have its output memoized.\n     * @returns {Function} Returns the new memoized function.\n     */\n    function memoizeCapped(func) {\n      var result = memoize(func, function(key) {\n        if (cache.size === MAX_MEMOIZE_SIZE) {\n          cache.clear();\n        }\n        return key;\n      });\n\n      var cache = result.cache;\n      return result;\n    }\n\n    /**\n     * Merges the function metadata of `source` into `data`.\n     *\n     * Merging metadata reduces the number of wrappers used to invoke a function.\n     * This is possible because methods like `_.bind`, `_.curry`, and `_.partial`\n     * may be applied regardless of execution order. Methods like `_.ary` and\n     * `_.rearg` modify function arguments, making the order in which they are\n     * executed important, preventing the merging of metadata. However, we make\n     * an exception for a safe combined case where curried functions have `_.ary`\n     * and or `_.rearg` applied.\n     *\n     * @private\n     * @param {Array} data The destination metadata.\n     * @param {Array} source The source metadata.\n     * @returns {Array} Returns `data`.\n     */\n    function mergeData(data, source) {\n      var bitmask = data[1],\n          srcBitmask = source[1],\n          newBitmask = bitmask | srcBitmask,\n          isCommon = newBitmask < (WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG | WRAP_ARY_FLAG);\n\n      var isCombo =\n        ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_CURRY_FLAG)) ||\n        ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_REARG_FLAG) && (data[7].length <= source[8])) ||\n        ((srcBitmask == (WRAP_ARY_FLAG | WRAP_REARG_FLAG)) && (source[7].length <= source[8]) && (bitmask == WRAP_CURRY_FLAG));\n\n      // Exit early if metadata can't be merged.\n      if (!(isCommon || isCombo)) {\n        return data;\n      }\n      // Use source `thisArg` if available.\n      if (srcBitmask & WRAP_BIND_FLAG) {\n        data[2] = source[2];\n        // Set when currying a bound function.\n        newBitmask |= bitmask & WRAP_BIND_FLAG ? 0 : WRAP_CURRY_BOUND_FLAG;\n      }\n      // Compose partial arguments.\n      var value = source[3];\n      if (value) {\n        var partials = data[3];\n        data[3] = partials ? composeArgs(partials, value, source[4]) : value;\n        data[4] = partials ? replaceHolders(data[3], PLACEHOLDER) : source[4];\n      }\n      // Compose partial right arguments.\n      value = source[5];\n      if (value) {\n        partials = data[5];\n        data[5] = partials ? composeArgsRight(partials, value, source[6]) : value;\n        data[6] = partials ? replaceHolders(data[5], PLACEHOLDER) : source[6];\n      }\n      // Use source `argPos` if available.\n      value = source[7];\n      if (value) {\n        data[7] = value;\n      }\n      // Use source `ary` if it's smaller.\n      if (srcBitmask & WRAP_ARY_FLAG) {\n        data[8] = data[8] == null ? source[8] : nativeMin(data[8], source[8]);\n      }\n      // Use source `arity` if one is not provided.\n      if (data[9] == null) {\n        data[9] = source[9];\n      }\n      // Use source `func` and merge bitmasks.\n      data[0] = source[0];\n      data[1] = newBitmask;\n\n      return data;\n    }\n\n    /**\n     * This function is like\n     * [`Object.keys`](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n     * except that it includes inherited enumerable properties.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property names.\n     */\n    function nativeKeysIn(object) {\n      var result = [];\n      if (object != null) {\n        for (var key in Object(object)) {\n          result.push(key);\n        }\n      }\n      return result;\n    }\n\n    /**\n     * Converts `value` to a string using `Object.prototype.toString`.\n     *\n     * @private\n     * @param {*} value The value to convert.\n     * @returns {string} Returns the converted string.\n     */\n    function objectToString(value) {\n      return nativeObjectToString.call(value);\n    }\n\n    /**\n     * A specialized version of `baseRest` which transforms the rest array.\n     *\n     * @private\n     * @param {Function} func The function to apply a rest parameter to.\n     * @param {number} [start=func.length-1] The start position of the rest parameter.\n     * @param {Function} transform The rest array transform.\n     * @returns {Function} Returns the new function.\n     */\n    function overRest(func, start, transform) {\n      start = nativeMax(start === undefined ? (func.length - 1) : start, 0);\n      return function() {\n        var args = arguments,\n            index = -1,\n            length = nativeMax(args.length - start, 0),\n            array = Array(length);\n\n        while (++index < length) {\n          array[index] = args[start + index];\n        }\n        index = -1;\n        var otherArgs = Array(start + 1);\n        while (++index < start) {\n          otherArgs[index] = args[index];\n        }\n        otherArgs[start] = transform(array);\n        return apply(func, this, otherArgs);\n      };\n    }\n\n    /**\n     * Gets the parent value at `path` of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @param {Array} path The path to get the parent value of.\n     * @returns {*} Returns the parent value.\n     */\n    function parent(object, path) {\n      return path.length < 2 ? object : baseGet(object, baseSlice(path, 0, -1));\n    }\n\n    /**\n     * Reorder `array` according to the specified indexes where the element at\n     * the first index is assigned as the first element, the element at\n     * the second index is assigned as the second element, and so on.\n     *\n     * @private\n     * @param {Array} array The array to reorder.\n     * @param {Array} indexes The arranged array indexes.\n     * @returns {Array} Returns `array`.\n     */\n    function reorder(array, indexes) {\n      var arrLength = array.length,\n          length = nativeMin(indexes.length, arrLength),\n          oldArray = copyArray(array);\n\n      while (length--) {\n        var index = indexes[length];\n        array[length] = isIndex(index, arrLength) ? oldArray[index] : undefined;\n      }\n      return array;\n    }\n\n    /**\n     * Gets the value at `key`, unless `key` is \"__proto__\" or \"constructor\".\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @param {string} key The key of the property to get.\n     * @returns {*} Returns the property value.\n     */\n    function safeGet(object, key) {\n      if (key === 'constructor' && typeof object[key] === 'function') {\n        return;\n      }\n\n      if (key == '__proto__') {\n        return;\n      }\n\n      return object[key];\n    }\n\n    /**\n     * Sets metadata for `func`.\n     *\n     * **Note:** If this function becomes hot, i.e. is invoked a lot in a short\n     * period of time, it will trip its breaker and transition to an identity\n     * function to avoid garbage collection pauses in V8. See\n     * [V8 issue 2070](https://bugs.chromium.org/p/v8/issues/detail?id=2070)\n     * for more details.\n     *\n     * @private\n     * @param {Function} func The function to associate metadata with.\n     * @param {*} data The metadata.\n     * @returns {Function} Returns `func`.\n     */\n    var setData = shortOut(baseSetData);\n\n    /**\n     * A simple wrapper around the global [`setTimeout`](https://mdn.io/setTimeout).\n     *\n     * @private\n     * @param {Function} func The function to delay.\n     * @param {number} wait The number of milliseconds to delay invocation.\n     * @returns {number|Object} Returns the timer id or timeout object.\n     */\n    var setTimeout = ctxSetTimeout || function(func, wait) {\n      return root.setTimeout(func, wait);\n    };\n\n    /**\n     * Sets the `toString` method of `func` to return `string`.\n     *\n     * @private\n     * @param {Function} func The function to modify.\n     * @param {Function} string The `toString` result.\n     * @returns {Function} Returns `func`.\n     */\n    var setToString = shortOut(baseSetToString);\n\n    /**\n     * Sets the `toString` method of `wrapper` to mimic the source of `reference`\n     * with wrapper details in a comment at the top of the source body.\n     *\n     * @private\n     * @param {Function} wrapper The function to modify.\n     * @param {Function} reference The reference function.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @returns {Function} Returns `wrapper`.\n     */\n    function setWrapToString(wrapper, reference, bitmask) {\n      var source = (reference + '');\n      return setToString(wrapper, insertWrapDetails(source, updateWrapDetails(getWrapDetails(source), bitmask)));\n    }\n\n    /**\n     * Creates a function that'll short out and invoke `identity` instead\n     * of `func` when it's called `HOT_COUNT` or more times in `HOT_SPAN`\n     * milliseconds.\n     *\n     * @private\n     * @param {Function} func The function to restrict.\n     * @returns {Function} Returns the new shortable function.\n     */\n    function shortOut(func) {\n      var count = 0,\n          lastCalled = 0;\n\n      return function() {\n        var stamp = nativeNow(),\n            remaining = HOT_SPAN - (stamp - lastCalled);\n\n        lastCalled = stamp;\n        if (remaining > 0) {\n          if (++count >= HOT_COUNT) {\n            return arguments[0];\n          }\n        } else {\n          count = 0;\n        }\n        return func.apply(undefined, arguments);\n      };\n    }\n\n    /**\n     * A specialized version of `_.shuffle` which mutates and sets the size of `array`.\n     *\n     * @private\n     * @param {Array} array The array to shuffle.\n     * @param {number} [size=array.length] The size of `array`.\n     * @returns {Array} Returns `array`.\n     */\n    function shuffleSelf(array, size) {\n      var index = -1,\n          length = array.length,\n          lastIndex = length - 1;\n\n      size = size === undefined ? length : size;\n      while (++index < size) {\n        var rand = baseRandom(index, lastIndex),\n            value = array[rand];\n\n        array[rand] = array[index];\n        array[index] = value;\n      }\n      array.length = size;\n      return array;\n    }\n\n    /**\n     * Converts `string` to a property path array.\n     *\n     * @private\n     * @param {string} string The string to convert.\n     * @returns {Array} Returns the property path array.\n     */\n    var stringToPath = memoizeCapped(function(string) {\n      var result = [];\n      if (string.charCodeAt(0) === 46 /* . */) {\n        result.push('');\n      }\n      string.replace(rePropName, function(match, number, quote, subString) {\n        result.push(quote ? subString.replace(reEscapeChar, '$1') : (number || match));\n      });\n      return result;\n    });\n\n    /**\n     * Converts `value` to a string key if it's not a string or symbol.\n     *\n     * @private\n     * @param {*} value The value to inspect.\n     * @returns {string|symbol} Returns the key.\n     */\n    function toKey(value) {\n      if (typeof value == 'string' || isSymbol(value)) {\n        return value;\n      }\n      var result = (value + '');\n      return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n    }\n\n    /**\n     * Converts `func` to its source code.\n     *\n     * @private\n     * @param {Function} func The function to convert.\n     * @returns {string} Returns the source code.\n     */\n    function toSource(func) {\n      if (func != null) {\n        try {\n          return funcToString.call(func);\n        } catch (e) {}\n        try {\n          return (func + '');\n        } catch (e) {}\n      }\n      return '';\n    }\n\n    /**\n     * Updates wrapper `details` based on `bitmask` flags.\n     *\n     * @private\n     * @returns {Array} details The details to modify.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @returns {Array} Returns `details`.\n     */\n    function updateWrapDetails(details, bitmask) {\n      arrayEach(wrapFlags, function(pair) {\n        var value = '_.' + pair[0];\n        if ((bitmask & pair[1]) && !arrayIncludes(details, value)) {\n          details.push(value);\n        }\n      });\n      return details.sort();\n    }\n\n    /**\n     * Creates a clone of `wrapper`.\n     *\n     * @private\n     * @param {Object} wrapper The wrapper to clone.\n     * @returns {Object} Returns the cloned wrapper.\n     */\n    function wrapperClone(wrapper) {\n      if (wrapper instanceof LazyWrapper) {\n        return wrapper.clone();\n      }\n      var result = new LodashWrapper(wrapper.__wrapped__, wrapper.__chain__);\n      result.__actions__ = copyArray(wrapper.__actions__);\n      result.__index__  = wrapper.__index__;\n      result.__values__ = wrapper.__values__;\n      return result;\n    }\n\n    /*------------------------------------------------------------------------*/\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     */\n    function 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\n    /**\n     * Creates an array with all falsey values removed. The values `false`, `null`,\n     * `0`, `\"\"`, `undefined`, and `NaN` are falsey.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to compact.\n     * @returns {Array} Returns the new array of filtered values.\n     * @example\n     *\n     * _.compact([0, 1, false, 2, '', 3]);\n     * // => [1, 2, 3]\n     */\n    function compact(array) {\n      var index = -1,\n          length = array == null ? 0 : array.length,\n          resIndex = 0,\n          result = [];\n\n      while (++index < length) {\n        var value = array[index];\n        if (value) {\n          result[resIndex++] = value;\n        }\n      }\n      return result;\n    }\n\n    /**\n     * Creates a new array concatenating `array` with any additional arrays\n     * and/or values.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to concatenate.\n     * @param {...*} [values] The values to concatenate.\n     * @returns {Array} Returns the new concatenated array.\n     * @example\n     *\n     * var array = [1];\n     * var other = _.concat(array, 2, [3], [[4]]);\n     *\n     * console.log(other);\n     * // => [1, 2, 3, [4]]\n     *\n     * console.log(array);\n     * // => [1]\n     */\n    function concat() {\n      var length = arguments.length;\n      if (!length) {\n        return [];\n      }\n      var args = Array(length - 1),\n          array = arguments[0],\n          index = length;\n\n      while (index--) {\n        args[index - 1] = arguments[index];\n      }\n      return arrayPush(isArray(array) ? copyArray(array) : [array], baseFlatten(args, 1));\n    }\n\n    /**\n     * Creates an array of `array` values not included in the other given arrays\n     * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * for equality comparisons. The order and references of result values are\n     * determined by the first array.\n     *\n     * **Note:** Unlike `_.pullAll`, this method returns a new array.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {...Array} [values] The values to exclude.\n     * @returns {Array} Returns the new array of filtered values.\n     * @see _.without, _.xor\n     * @example\n     *\n     * _.difference([2, 1], [2, 3]);\n     * // => [1]\n     */\n    var difference = baseRest(function(array, values) {\n      return isArrayLikeObject(array)\n        ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true))\n        : [];\n    });\n\n    /**\n     * This method is like `_.difference` except that it accepts `iteratee` which\n     * is invoked for each element of `array` and `values` to generate the criterion\n     * by which they're compared. The order and references of result values are\n     * determined by the first array. The iteratee is invoked with one argument:\n     * (value).\n     *\n     * **Note:** Unlike `_.pullAllBy`, this method returns a new array.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {...Array} [values] The values to exclude.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {Array} Returns the new array of filtered values.\n     * @example\n     *\n     * _.differenceBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n     * // => [1.2]\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.differenceBy([{ 'x': 2 }, { 'x': 1 }], [{ 'x': 1 }], 'x');\n     * // => [{ 'x': 2 }]\n     */\n    var differenceBy = baseRest(function(array, values) {\n      var iteratee = last(values);\n      if (isArrayLikeObject(iteratee)) {\n        iteratee = undefined;\n      }\n      return isArrayLikeObject(array)\n        ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), getIteratee(iteratee, 2))\n        : [];\n    });\n\n    /**\n     * This method is like `_.difference` except that it accepts `comparator`\n     * which is invoked to compare elements of `array` to `values`. The order and\n     * references of result values are determined by the first array. The comparator\n     * is invoked with two arguments: (arrVal, othVal).\n     *\n     * **Note:** Unlike `_.pullAllWith`, this method returns a new array.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {...Array} [values] The values to exclude.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new array of filtered values.\n     * @example\n     *\n     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n     *\n     * _.differenceWith(objects, [{ 'x': 1, 'y': 2 }], _.isEqual);\n     * // => [{ 'x': 2, 'y': 1 }]\n     */\n    var differenceWith = baseRest(function(array, values) {\n      var comparator = last(values);\n      if (isArrayLikeObject(comparator)) {\n        comparator = undefined;\n      }\n      return isArrayLikeObject(array)\n        ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), undefined, comparator)\n        : [];\n    });\n\n    /**\n     * Creates a slice of `array` with `n` elements dropped from the beginning.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.5.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {number} [n=1] The number of elements to drop.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * _.drop([1, 2, 3]);\n     * // => [2, 3]\n     *\n     * _.drop([1, 2, 3], 2);\n     * // => [3]\n     *\n     * _.drop([1, 2, 3], 5);\n     * // => []\n     *\n     * _.drop([1, 2, 3], 0);\n     * // => [1, 2, 3]\n     */\n    function drop(array, n, guard) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return [];\n      }\n      n = (guard || n === undefined) ? 1 : toInteger(n);\n      return baseSlice(array, n < 0 ? 0 : n, length);\n    }\n\n    /**\n     * Creates a slice of `array` with `n` elements dropped from the end.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {number} [n=1] The number of elements to drop.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * _.dropRight([1, 2, 3]);\n     * // => [1, 2]\n     *\n     * _.dropRight([1, 2, 3], 2);\n     * // => [1]\n     *\n     * _.dropRight([1, 2, 3], 5);\n     * // => []\n     *\n     * _.dropRight([1, 2, 3], 0);\n     * // => [1, 2, 3]\n     */\n    function dropRight(array, n, guard) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return [];\n      }\n      n = (guard || n === undefined) ? 1 : toInteger(n);\n      n = length - n;\n      return baseSlice(array, 0, n < 0 ? 0 : n);\n    }\n\n    /**\n     * Creates a slice of `array` excluding elements dropped from the end.\n     * Elements are dropped until `predicate` returns falsey. The predicate is\n     * invoked with three arguments: (value, index, array).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'active': true },\n     *   { 'user': 'fred',    'active': false },\n     *   { 'user': 'pebbles', 'active': false }\n     * ];\n     *\n     * _.dropRightWhile(users, function(o) { return !o.active; });\n     * // => objects for ['barney']\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.dropRightWhile(users, { 'user': 'pebbles', 'active': false });\n     * // => objects for ['barney', 'fred']\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.dropRightWhile(users, ['active', false]);\n     * // => objects for ['barney']\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.dropRightWhile(users, 'active');\n     * // => objects for ['barney', 'fred', 'pebbles']\n     */\n    function dropRightWhile(array, predicate) {\n      return (array && array.length)\n        ? baseWhile(array, getIteratee(predicate, 3), true, true)\n        : [];\n    }\n\n    /**\n     * Creates a slice of `array` excluding elements dropped from the beginning.\n     * Elements are dropped until `predicate` returns falsey. The predicate is\n     * invoked with three arguments: (value, index, array).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'active': false },\n     *   { 'user': 'fred',    'active': false },\n     *   { 'user': 'pebbles', 'active': true }\n     * ];\n     *\n     * _.dropWhile(users, function(o) { return !o.active; });\n     * // => objects for ['pebbles']\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.dropWhile(users, { 'user': 'barney', 'active': false });\n     * // => objects for ['fred', 'pebbles']\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.dropWhile(users, ['active', false]);\n     * // => objects for ['pebbles']\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.dropWhile(users, 'active');\n     * // => objects for ['barney', 'fred', 'pebbles']\n     */\n    function dropWhile(array, predicate) {\n      return (array && array.length)\n        ? baseWhile(array, getIteratee(predicate, 3), true)\n        : [];\n    }\n\n    /**\n     * Fills elements of `array` with `value` from `start` up to, but not\n     * including, `end`.\n     *\n     * **Note:** This method mutates `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.2.0\n     * @category Array\n     * @param {Array} array The array to fill.\n     * @param {*} value The value to fill `array` with.\n     * @param {number} [start=0] The start position.\n     * @param {number} [end=array.length] The end position.\n     * @returns {Array} Returns `array`.\n     * @example\n     *\n     * var array = [1, 2, 3];\n     *\n     * _.fill(array, 'a');\n     * console.log(array);\n     * // => ['a', 'a', 'a']\n     *\n     * _.fill(Array(3), 2);\n     * // => [2, 2, 2]\n     *\n     * _.fill([4, 6, 8, 10], '*', 1, 3);\n     * // => [4, '*', '*', 10]\n     */\n    function fill(array, value, start, end) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return [];\n      }\n      if (start && typeof start != 'number' && isIterateeCall(array, value, start)) {\n        start = 0;\n        end = length;\n      }\n      return baseFill(array, value, start, end);\n    }\n\n    /**\n     * This method is like `_.find` except that it returns the index of the first\n     * element `predicate` returns truthy for instead of the element itself.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.1.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @param {number} [fromIndex=0] The index to search from.\n     * @returns {number} Returns the index of the found element, else `-1`.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'active': false },\n     *   { 'user': 'fred',    'active': false },\n     *   { 'user': 'pebbles', 'active': true }\n     * ];\n     *\n     * _.findIndex(users, function(o) { return o.user == 'barney'; });\n     * // => 0\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.findIndex(users, { 'user': 'fred', 'active': false });\n     * // => 1\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.findIndex(users, ['active', false]);\n     * // => 0\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.findIndex(users, 'active');\n     * // => 2\n     */\n    function findIndex(array, predicate, fromIndex) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return -1;\n      }\n      var index = fromIndex == null ? 0 : toInteger(fromIndex);\n      if (index < 0) {\n        index = nativeMax(length + index, 0);\n      }\n      return baseFindIndex(array, getIteratee(predicate, 3), index);\n    }\n\n    /**\n     * This method is like `_.findIndex` except that it iterates over elements\n     * of `collection` from right to left.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @param {number} [fromIndex=array.length-1] The index to search from.\n     * @returns {number} Returns the index of the found element, else `-1`.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'active': true },\n     *   { 'user': 'fred',    'active': false },\n     *   { 'user': 'pebbles', 'active': false }\n     * ];\n     *\n     * _.findLastIndex(users, function(o) { return o.user == 'pebbles'; });\n     * // => 2\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.findLastIndex(users, { 'user': 'barney', 'active': true });\n     * // => 0\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.findLastIndex(users, ['active', false]);\n     * // => 2\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.findLastIndex(users, 'active');\n     * // => 0\n     */\n    function findLastIndex(array, predicate, fromIndex) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return -1;\n      }\n      var index = length - 1;\n      if (fromIndex !== undefined) {\n        index = toInteger(fromIndex);\n        index = fromIndex < 0\n          ? nativeMax(length + index, 0)\n          : nativeMin(index, length - 1);\n      }\n      return baseFindIndex(array, getIteratee(predicate, 3), index, true);\n    }\n\n    /**\n     * Flattens `array` a single level deep.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to flatten.\n     * @returns {Array} Returns the new flattened array.\n     * @example\n     *\n     * _.flatten([1, [2, [3, [4]], 5]]);\n     * // => [1, 2, [3, [4]], 5]\n     */\n    function flatten(array) {\n      var length = array == null ? 0 : array.length;\n      return length ? baseFlatten(array, 1) : [];\n    }\n\n    /**\n     * Recursively flattens `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to flatten.\n     * @returns {Array} Returns the new flattened array.\n     * @example\n     *\n     * _.flattenDeep([1, [2, [3, [4]], 5]]);\n     * // => [1, 2, 3, 4, 5]\n     */\n    function flattenDeep(array) {\n      var length = array == null ? 0 : array.length;\n      return length ? baseFlatten(array, INFINITY) : [];\n    }\n\n    /**\n     * Recursively flatten `array` up to `depth` times.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.4.0\n     * @category Array\n     * @param {Array} array The array to flatten.\n     * @param {number} [depth=1] The maximum recursion depth.\n     * @returns {Array} Returns the new flattened array.\n     * @example\n     *\n     * var array = [1, [2, [3, [4]], 5]];\n     *\n     * _.flattenDepth(array, 1);\n     * // => [1, 2, [3, [4]], 5]\n     *\n     * _.flattenDepth(array, 2);\n     * // => [1, 2, 3, [4], 5]\n     */\n    function flattenDepth(array, depth) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return [];\n      }\n      depth = depth === undefined ? 1 : toInteger(depth);\n      return baseFlatten(array, depth);\n    }\n\n    /**\n     * The inverse of `_.toPairs`; this method returns an object composed\n     * from key-value `pairs`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} pairs The key-value pairs.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * _.fromPairs([['a', 1], ['b', 2]]);\n     * // => { 'a': 1, 'b': 2 }\n     */\n    function fromPairs(pairs) {\n      var index = -1,\n          length = pairs == null ? 0 : pairs.length,\n          result = {};\n\n      while (++index < length) {\n        var pair = pairs[index];\n        result[pair[0]] = pair[1];\n      }\n      return result;\n    }\n\n    /**\n     * Gets the first element of `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @alias first\n     * @category Array\n     * @param {Array} array The array to query.\n     * @returns {*} Returns the first element of `array`.\n     * @example\n     *\n     * _.head([1, 2, 3]);\n     * // => 1\n     *\n     * _.head([]);\n     * // => undefined\n     */\n    function head(array) {\n      return (array && array.length) ? array[0] : undefined;\n    }\n\n    /**\n     * Gets the index at which the first occurrence of `value` is found in `array`\n     * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * for equality comparisons. If `fromIndex` is negative, it's used as the\n     * offset from the end of `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {*} value The value to search for.\n     * @param {number} [fromIndex=0] The index to search from.\n     * @returns {number} Returns the index of the matched value, else `-1`.\n     * @example\n     *\n     * _.indexOf([1, 2, 1, 2], 2);\n     * // => 1\n     *\n     * // Search from the `fromIndex`.\n     * _.indexOf([1, 2, 1, 2], 2, 2);\n     * // => 3\n     */\n    function indexOf(array, value, fromIndex) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return -1;\n      }\n      var index = fromIndex == null ? 0 : toInteger(fromIndex);\n      if (index < 0) {\n        index = nativeMax(length + index, 0);\n      }\n      return baseIndexOf(array, value, index);\n    }\n\n    /**\n     * Gets all but the last element of `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * _.initial([1, 2, 3]);\n     * // => [1, 2]\n     */\n    function initial(array) {\n      var length = array == null ? 0 : array.length;\n      return length ? baseSlice(array, 0, -1) : [];\n    }\n\n    /**\n     * Creates an array of unique values that are included in all given arrays\n     * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * for equality comparisons. The order and references of result values are\n     * determined by the first array.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @returns {Array} Returns the new array of intersecting values.\n     * @example\n     *\n     * _.intersection([2, 1], [2, 3]);\n     * // => [2]\n     */\n    var intersection = baseRest(function(arrays) {\n      var mapped = arrayMap(arrays, castArrayLikeObject);\n      return (mapped.length && mapped[0] === arrays[0])\n        ? baseIntersection(mapped)\n        : [];\n    });\n\n    /**\n     * This method is like `_.intersection` except that it accepts `iteratee`\n     * which is invoked for each element of each `arrays` to generate the criterion\n     * by which they're compared. The order and references of result values are\n     * determined by the first array. The iteratee is invoked with one argument:\n     * (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {Array} Returns the new array of intersecting values.\n     * @example\n     *\n     * _.intersectionBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n     * // => [2.1]\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.intersectionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n     * // => [{ 'x': 1 }]\n     */\n    var intersectionBy = baseRest(function(arrays) {\n      var iteratee = last(arrays),\n          mapped = arrayMap(arrays, castArrayLikeObject);\n\n      if (iteratee === last(mapped)) {\n        iteratee = undefined;\n      } else {\n        mapped.pop();\n      }\n      return (mapped.length && mapped[0] === arrays[0])\n        ? baseIntersection(mapped, getIteratee(iteratee, 2))\n        : [];\n    });\n\n    /**\n     * This method is like `_.intersection` except that it accepts `comparator`\n     * which is invoked to compare elements of `arrays`. The order and references\n     * of result values are determined by the first array. The comparator is\n     * invoked with two arguments: (arrVal, othVal).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new array of intersecting values.\n     * @example\n     *\n     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n     * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n     *\n     * _.intersectionWith(objects, others, _.isEqual);\n     * // => [{ 'x': 1, 'y': 2 }]\n     */\n    var intersectionWith = baseRest(function(arrays) {\n      var comparator = last(arrays),\n          mapped = arrayMap(arrays, castArrayLikeObject);\n\n      comparator = typeof comparator == 'function' ? comparator : undefined;\n      if (comparator) {\n        mapped.pop();\n      }\n      return (mapped.length && mapped[0] === arrays[0])\n        ? baseIntersection(mapped, undefined, comparator)\n        : [];\n    });\n\n    /**\n     * Converts all elements in `array` into a string separated by `separator`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to convert.\n     * @param {string} [separator=','] The element separator.\n     * @returns {string} Returns the joined string.\n     * @example\n     *\n     * _.join(['a', 'b', 'c'], '~');\n     * // => 'a~b~c'\n     */\n    function join(array, separator) {\n      return array == null ? '' : nativeJoin.call(array, separator);\n    }\n\n    /**\n     * Gets the last element of `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @returns {*} Returns the last element of `array`.\n     * @example\n     *\n     * _.last([1, 2, 3]);\n     * // => 3\n     */\n    function last(array) {\n      var length = array == null ? 0 : array.length;\n      return length ? array[length - 1] : undefined;\n    }\n\n    /**\n     * This method is like `_.indexOf` except that it iterates over elements of\n     * `array` from right to left.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {*} value The value to search for.\n     * @param {number} [fromIndex=array.length-1] The index to search from.\n     * @returns {number} Returns the index of the matched value, else `-1`.\n     * @example\n     *\n     * _.lastIndexOf([1, 2, 1, 2], 2);\n     * // => 3\n     *\n     * // Search from the `fromIndex`.\n     * _.lastIndexOf([1, 2, 1, 2], 2, 2);\n     * // => 1\n     */\n    function lastIndexOf(array, value, fromIndex) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return -1;\n      }\n      var index = length;\n      if (fromIndex !== undefined) {\n        index = toInteger(fromIndex);\n        index = index < 0 ? nativeMax(length + index, 0) : nativeMin(index, length - 1);\n      }\n      return value === value\n        ? strictLastIndexOf(array, value, index)\n        : baseFindIndex(array, baseIsNaN, index, true);\n    }\n\n    /**\n     * Gets the element at index `n` of `array`. If `n` is negative, the nth\n     * element from the end is returned.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.11.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {number} [n=0] The index of the element to return.\n     * @returns {*} Returns the nth element of `array`.\n     * @example\n     *\n     * var array = ['a', 'b', 'c', 'd'];\n     *\n     * _.nth(array, 1);\n     * // => 'b'\n     *\n     * _.nth(array, -2);\n     * // => 'c';\n     */\n    function nth(array, n) {\n      return (array && array.length) ? baseNth(array, toInteger(n)) : undefined;\n    }\n\n    /**\n     * Removes all given values from `array` using\n     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * for equality comparisons.\n     *\n     * **Note:** Unlike `_.without`, this method mutates `array`. Use `_.remove`\n     * to remove elements from an array by predicate.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Array\n     * @param {Array} array The array to modify.\n     * @param {...*} [values] The values to remove.\n     * @returns {Array} Returns `array`.\n     * @example\n     *\n     * var array = ['a', 'b', 'c', 'a', 'b', 'c'];\n     *\n     * _.pull(array, 'a', 'c');\n     * console.log(array);\n     * // => ['b', 'b']\n     */\n    var pull = baseRest(pullAll);\n\n    /**\n     * This method is like `_.pull` except that it accepts an array of values to remove.\n     *\n     * **Note:** Unlike `_.difference`, this method mutates `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to modify.\n     * @param {Array} values The values to remove.\n     * @returns {Array} Returns `array`.\n     * @example\n     *\n     * var array = ['a', 'b', 'c', 'a', 'b', 'c'];\n     *\n     * _.pullAll(array, ['a', 'c']);\n     * console.log(array);\n     * // => ['b', 'b']\n     */\n    function pullAll(array, values) {\n      return (array && array.length && values && values.length)\n        ? basePullAll(array, values)\n        : array;\n    }\n\n    /**\n     * This method is like `_.pullAll` except that it accepts `iteratee` which is\n     * invoked for each element of `array` and `values` to generate the criterion\n     * by which they're compared. The iteratee is invoked with one argument: (value).\n     *\n     * **Note:** Unlike `_.differenceBy`, this method mutates `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to modify.\n     * @param {Array} values The values to remove.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {Array} Returns `array`.\n     * @example\n     *\n     * var array = [{ 'x': 1 }, { 'x': 2 }, { 'x': 3 }, { 'x': 1 }];\n     *\n     * _.pullAllBy(array, [{ 'x': 1 }, { 'x': 3 }], 'x');\n     * console.log(array);\n     * // => [{ 'x': 2 }]\n     */\n    function pullAllBy(array, values, iteratee) {\n      return (array && array.length && values && values.length)\n        ? basePullAll(array, values, getIteratee(iteratee, 2))\n        : array;\n    }\n\n    /**\n     * This method is like `_.pullAll` except that it accepts `comparator` which\n     * is invoked to compare elements of `array` to `values`. The comparator is\n     * invoked with two arguments: (arrVal, othVal).\n     *\n     * **Note:** Unlike `_.differenceWith`, this method mutates `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.6.0\n     * @category Array\n     * @param {Array} array The array to modify.\n     * @param {Array} values The values to remove.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns `array`.\n     * @example\n     *\n     * var array = [{ 'x': 1, 'y': 2 }, { 'x': 3, 'y': 4 }, { 'x': 5, 'y': 6 }];\n     *\n     * _.pullAllWith(array, [{ 'x': 3, 'y': 4 }], _.isEqual);\n     * console.log(array);\n     * // => [{ 'x': 1, 'y': 2 }, { 'x': 5, 'y': 6 }]\n     */\n    function pullAllWith(array, values, comparator) {\n      return (array && array.length && values && values.length)\n        ? basePullAll(array, values, undefined, comparator)\n        : array;\n    }\n\n    /**\n     * Removes elements from `array` corresponding to `indexes` and returns an\n     * array of removed elements.\n     *\n     * **Note:** Unlike `_.at`, this method mutates `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to modify.\n     * @param {...(number|number[])} [indexes] The indexes of elements to remove.\n     * @returns {Array} Returns the new array of removed elements.\n     * @example\n     *\n     * var array = ['a', 'b', 'c', 'd'];\n     * var pulled = _.pullAt(array, [1, 3]);\n     *\n     * console.log(array);\n     * // => ['a', 'c']\n     *\n     * console.log(pulled);\n     * // => ['b', 'd']\n     */\n    var pullAt = flatRest(function(array, indexes) {\n      var length = array == null ? 0 : array.length,\n          result = baseAt(array, indexes);\n\n      basePullAt(array, arrayMap(indexes, function(index) {\n        return isIndex(index, length) ? +index : index;\n      }).sort(compareAscending));\n\n      return result;\n    });\n\n    /**\n     * Removes all elements from `array` that `predicate` returns truthy for\n     * and returns an array of the removed elements. The predicate is invoked\n     * with three arguments: (value, index, array).\n     *\n     * **Note:** Unlike `_.filter`, this method mutates `array`. Use `_.pull`\n     * to pull elements from an array by value.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Array\n     * @param {Array} array The array to modify.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the new array of removed elements.\n     * @example\n     *\n     * var array = [1, 2, 3, 4];\n     * var evens = _.remove(array, function(n) {\n     *   return n % 2 == 0;\n     * });\n     *\n     * console.log(array);\n     * // => [1, 3]\n     *\n     * console.log(evens);\n     * // => [2, 4]\n     */\n    function remove(array, predicate) {\n      var result = [];\n      if (!(array && array.length)) {\n        return result;\n      }\n      var index = -1,\n          indexes = [],\n          length = array.length;\n\n      predicate = getIteratee(predicate, 3);\n      while (++index < length) {\n        var value = array[index];\n        if (predicate(value, index, array)) {\n          result.push(value);\n          indexes.push(index);\n        }\n      }\n      basePullAt(array, indexes);\n      return result;\n    }\n\n    /**\n     * Reverses `array` so that the first element becomes the last, the second\n     * element becomes the second to last, and so on.\n     *\n     * **Note:** This method mutates `array` and is based on\n     * [`Array#reverse`](https://mdn.io/Array/reverse).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to modify.\n     * @returns {Array} Returns `array`.\n     * @example\n     *\n     * var array = [1, 2, 3];\n     *\n     * _.reverse(array);\n     * // => [3, 2, 1]\n     *\n     * console.log(array);\n     * // => [3, 2, 1]\n     */\n    function reverse(array) {\n      return array == null ? array : nativeReverse.call(array);\n    }\n\n    /**\n     * Creates a slice of `array` from `start` up to, but not including, `end`.\n     *\n     * **Note:** This method is used instead of\n     * [`Array#slice`](https://mdn.io/Array/slice) to ensure dense arrays are\n     * returned.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to slice.\n     * @param {number} [start=0] The start position.\n     * @param {number} [end=array.length] The end position.\n     * @returns {Array} Returns the slice of `array`.\n     */\n    function slice(array, start, end) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return [];\n      }\n      if (end && typeof end != 'number' && isIterateeCall(array, start, end)) {\n        start = 0;\n        end = length;\n      }\n      else {\n        start = start == null ? 0 : toInteger(start);\n        end = end === undefined ? length : toInteger(end);\n      }\n      return baseSlice(array, start, end);\n    }\n\n    /**\n     * Uses a binary search to determine the lowest index at which `value`\n     * should be inserted into `array` in order to maintain its sort order.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The sorted array to inspect.\n     * @param {*} value The value to evaluate.\n     * @returns {number} Returns the index at which `value` should be inserted\n     *  into `array`.\n     * @example\n     *\n     * _.sortedIndex([30, 50], 40);\n     * // => 1\n     */\n    function sortedIndex(array, value) {\n      return baseSortedIndex(array, value);\n    }\n\n    /**\n     * This method is like `_.sortedIndex` except that it accepts `iteratee`\n     * which is invoked for `value` and each element of `array` to compute their\n     * sort ranking. The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The sorted array to inspect.\n     * @param {*} value The value to evaluate.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {number} Returns the index at which `value` should be inserted\n     *  into `array`.\n     * @example\n     *\n     * var objects = [{ 'x': 4 }, { 'x': 5 }];\n     *\n     * _.sortedIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });\n     * // => 0\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.sortedIndexBy(objects, { 'x': 4 }, 'x');\n     * // => 0\n     */\n    function sortedIndexBy(array, value, iteratee) {\n      return baseSortedIndexBy(array, value, getIteratee(iteratee, 2));\n    }\n\n    /**\n     * This method is like `_.indexOf` except that it performs a binary\n     * search on a sorted `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {*} value The value to search for.\n     * @returns {number} Returns the index of the matched value, else `-1`.\n     * @example\n     *\n     * _.sortedIndexOf([4, 5, 5, 5, 6], 5);\n     * // => 1\n     */\n    function sortedIndexOf(array, value) {\n      var length = array == null ? 0 : array.length;\n      if (length) {\n        var index = baseSortedIndex(array, value);\n        if (index < length && eq(array[index], value)) {\n          return index;\n        }\n      }\n      return -1;\n    }\n\n    /**\n     * This method is like `_.sortedIndex` except that it returns the highest\n     * index at which `value` should be inserted into `array` in order to\n     * maintain its sort order.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The sorted array to inspect.\n     * @param {*} value The value to evaluate.\n     * @returns {number} Returns the index at which `value` should be inserted\n     *  into `array`.\n     * @example\n     *\n     * _.sortedLastIndex([4, 5, 5, 5, 6], 5);\n     * // => 4\n     */\n    function sortedLastIndex(array, value) {\n      return baseSortedIndex(array, value, true);\n    }\n\n    /**\n     * This method is like `_.sortedLastIndex` except that it accepts `iteratee`\n     * which is invoked for `value` and each element of `array` to compute their\n     * sort ranking. The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The sorted array to inspect.\n     * @param {*} value The value to evaluate.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {number} Returns the index at which `value` should be inserted\n     *  into `array`.\n     * @example\n     *\n     * var objects = [{ 'x': 4 }, { 'x': 5 }];\n     *\n     * _.sortedLastIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });\n     * // => 1\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.sortedLastIndexBy(objects, { 'x': 4 }, 'x');\n     * // => 1\n     */\n    function sortedLastIndexBy(array, value, iteratee) {\n      return baseSortedIndexBy(array, value, getIteratee(iteratee, 2), true);\n    }\n\n    /**\n     * This method is like `_.lastIndexOf` except that it performs a binary\n     * search on a sorted `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {*} value The value to search for.\n     * @returns {number} Returns the index of the matched value, else `-1`.\n     * @example\n     *\n     * _.sortedLastIndexOf([4, 5, 5, 5, 6], 5);\n     * // => 3\n     */\n    function sortedLastIndexOf(array, value) {\n      var length = array == null ? 0 : array.length;\n      if (length) {\n        var index = baseSortedIndex(array, value, true) - 1;\n        if (eq(array[index], value)) {\n          return index;\n        }\n      }\n      return -1;\n    }\n\n    /**\n     * This method is like `_.uniq` except that it's designed and optimized\n     * for sorted arrays.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @returns {Array} Returns the new duplicate free array.\n     * @example\n     *\n     * _.sortedUniq([1, 1, 2]);\n     * // => [1, 2]\n     */\n    function sortedUniq(array) {\n      return (array && array.length)\n        ? baseSortedUniq(array)\n        : [];\n    }\n\n    /**\n     * This method is like `_.uniqBy` except that it's designed and optimized\n     * for sorted arrays.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {Function} [iteratee] The iteratee invoked per element.\n     * @returns {Array} Returns the new duplicate free array.\n     * @example\n     *\n     * _.sortedUniqBy([1.1, 1.2, 2.3, 2.4], Math.floor);\n     * // => [1.1, 2.3]\n     */\n    function sortedUniqBy(array, iteratee) {\n      return (array && array.length)\n        ? baseSortedUniq(array, getIteratee(iteratee, 2))\n        : [];\n    }\n\n    /**\n     * Gets all but the first element of `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * _.tail([1, 2, 3]);\n     * // => [2, 3]\n     */\n    function tail(array) {\n      var length = array == null ? 0 : array.length;\n      return length ? baseSlice(array, 1, length) : [];\n    }\n\n    /**\n     * Creates a slice of `array` with `n` elements taken from the beginning.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {number} [n=1] The number of elements to take.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * _.take([1, 2, 3]);\n     * // => [1]\n     *\n     * _.take([1, 2, 3], 2);\n     * // => [1, 2]\n     *\n     * _.take([1, 2, 3], 5);\n     * // => [1, 2, 3]\n     *\n     * _.take([1, 2, 3], 0);\n     * // => []\n     */\n    function take(array, n, guard) {\n      if (!(array && array.length)) {\n        return [];\n      }\n      n = (guard || n === undefined) ? 1 : toInteger(n);\n      return baseSlice(array, 0, n < 0 ? 0 : n);\n    }\n\n    /**\n     * Creates a slice of `array` with `n` elements taken from the end.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {number} [n=1] The number of elements to take.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * _.takeRight([1, 2, 3]);\n     * // => [3]\n     *\n     * _.takeRight([1, 2, 3], 2);\n     * // => [2, 3]\n     *\n     * _.takeRight([1, 2, 3], 5);\n     * // => [1, 2, 3]\n     *\n     * _.takeRight([1, 2, 3], 0);\n     * // => []\n     */\n    function takeRight(array, n, guard) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return [];\n      }\n      n = (guard || n === undefined) ? 1 : toInteger(n);\n      n = length - n;\n      return baseSlice(array, n < 0 ? 0 : n, length);\n    }\n\n    /**\n     * Creates a slice of `array` with elements taken from the end. Elements are\n     * taken until `predicate` returns falsey. The predicate is invoked with\n     * three arguments: (value, index, array).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'active': true },\n     *   { 'user': 'fred',    'active': false },\n     *   { 'user': 'pebbles', 'active': false }\n     * ];\n     *\n     * _.takeRightWhile(users, function(o) { return !o.active; });\n     * // => objects for ['fred', 'pebbles']\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.takeRightWhile(users, { 'user': 'pebbles', 'active': false });\n     * // => objects for ['pebbles']\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.takeRightWhile(users, ['active', false]);\n     * // => objects for ['fred', 'pebbles']\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.takeRightWhile(users, 'active');\n     * // => []\n     */\n    function takeRightWhile(array, predicate) {\n      return (array && array.length)\n        ? baseWhile(array, getIteratee(predicate, 3), false, true)\n        : [];\n    }\n\n    /**\n     * Creates a slice of `array` with elements taken from the beginning. Elements\n     * are taken until `predicate` returns falsey. The predicate is invoked with\n     * three arguments: (value, index, array).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'active': false },\n     *   { 'user': 'fred',    'active': false },\n     *   { 'user': 'pebbles', 'active': true }\n     * ];\n     *\n     * _.takeWhile(users, function(o) { return !o.active; });\n     * // => objects for ['barney', 'fred']\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.takeWhile(users, { 'user': 'barney', 'active': false });\n     * // => objects for ['barney']\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.takeWhile(users, ['active', false]);\n     * // => objects for ['barney', 'fred']\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.takeWhile(users, 'active');\n     * // => []\n     */\n    function takeWhile(array, predicate) {\n      return (array && array.length)\n        ? baseWhile(array, getIteratee(predicate, 3))\n        : [];\n    }\n\n    /**\n     * Creates an array of unique values, in order, from all given arrays using\n     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * for equality comparisons.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @returns {Array} Returns the new array of combined values.\n     * @example\n     *\n     * _.union([2], [1, 2]);\n     * // => [2, 1]\n     */\n    var union = baseRest(function(arrays) {\n      return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true));\n    });\n\n    /**\n     * This method is like `_.union` except that it accepts `iteratee` which is\n     * invoked for each element of each `arrays` to generate the criterion by\n     * which uniqueness is computed. Result values are chosen from the first\n     * array in which the value occurs. The iteratee is invoked with one argument:\n     * (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {Array} Returns the new array of combined values.\n     * @example\n     *\n     * _.unionBy([2.1], [1.2, 2.3], Math.floor);\n     * // => [2.1, 1.2]\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.unionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n     * // => [{ 'x': 1 }, { 'x': 2 }]\n     */\n    var unionBy = baseRest(function(arrays) {\n      var iteratee = last(arrays);\n      if (isArrayLikeObject(iteratee)) {\n        iteratee = undefined;\n      }\n      return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), getIteratee(iteratee, 2));\n    });\n\n    /**\n     * This method is like `_.union` except that it accepts `comparator` which\n     * is invoked to compare elements of `arrays`. Result values are chosen from\n     * the first array in which the value occurs. The comparator is invoked\n     * with two arguments: (arrVal, othVal).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new array of combined values.\n     * @example\n     *\n     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n     * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n     *\n     * _.unionWith(objects, others, _.isEqual);\n     * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]\n     */\n    var unionWith = baseRest(function(arrays) {\n      var comparator = last(arrays);\n      comparator = typeof comparator == 'function' ? comparator : undefined;\n      return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), undefined, comparator);\n    });\n\n    /**\n     * Creates a duplicate-free version of an array, using\n     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * for equality comparisons, in which only the first occurrence of each element\n     * is kept. The order of result values is determined by the order they occur\n     * in the array.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @returns {Array} Returns the new duplicate free array.\n     * @example\n     *\n     * _.uniq([2, 1, 2]);\n     * // => [2, 1]\n     */\n    function uniq(array) {\n      return (array && array.length) ? baseUniq(array) : [];\n    }\n\n    /**\n     * This method is like `_.uniq` except that it accepts `iteratee` which is\n     * invoked for each element in `array` to generate the criterion by which\n     * uniqueness is computed. The order of result values is determined by the\n     * order they occur in the array. The iteratee is invoked with one argument:\n     * (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {Array} Returns the new duplicate free array.\n     * @example\n     *\n     * _.uniqBy([2.1, 1.2, 2.3], Math.floor);\n     * // => [2.1, 1.2]\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.uniqBy([{ 'x': 1 }, { 'x': 2 }, { 'x': 1 }], 'x');\n     * // => [{ 'x': 1 }, { 'x': 2 }]\n     */\n    function uniqBy(array, iteratee) {\n      return (array && array.length) ? baseUniq(array, getIteratee(iteratee, 2)) : [];\n    }\n\n    /**\n     * This method is like `_.uniq` except that it accepts `comparator` which\n     * is invoked to compare elements of `array`. The order of result values is\n     * determined by the order they occur in the array.The comparator is invoked\n     * with two arguments: (arrVal, othVal).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new duplicate free array.\n     * @example\n     *\n     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 2 }];\n     *\n     * _.uniqWith(objects, _.isEqual);\n     * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }]\n     */\n    function uniqWith(array, comparator) {\n      comparator = typeof comparator == 'function' ? comparator : undefined;\n      return (array && array.length) ? baseUniq(array, undefined, comparator) : [];\n    }\n\n    /**\n     * This method is like `_.zip` except that it accepts an array of grouped\n     * elements and creates an array regrouping the elements to their pre-zip\n     * configuration.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.2.0\n     * @category Array\n     * @param {Array} array The array of grouped elements to process.\n     * @returns {Array} Returns the new array of regrouped elements.\n     * @example\n     *\n     * var zipped = _.zip(['a', 'b'], [1, 2], [true, false]);\n     * // => [['a', 1, true], ['b', 2, false]]\n     *\n     * _.unzip(zipped);\n     * // => [['a', 'b'], [1, 2], [true, false]]\n     */\n    function unzip(array) {\n      if (!(array && array.length)) {\n        return [];\n      }\n      var length = 0;\n      array = arrayFilter(array, function(group) {\n        if (isArrayLikeObject(group)) {\n          length = nativeMax(group.length, length);\n          return true;\n        }\n      });\n      return baseTimes(length, function(index) {\n        return arrayMap(array, baseProperty(index));\n      });\n    }\n\n    /**\n     * This method is like `_.unzip` except that it accepts `iteratee` to specify\n     * how regrouped values should be combined. The iteratee is invoked with the\n     * elements of each group: (...group).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.8.0\n     * @category Array\n     * @param {Array} array The array of grouped elements to process.\n     * @param {Function} [iteratee=_.identity] The function to combine\n     *  regrouped values.\n     * @returns {Array} Returns the new array of regrouped elements.\n     * @example\n     *\n     * var zipped = _.zip([1, 2], [10, 20], [100, 200]);\n     * // => [[1, 10, 100], [2, 20, 200]]\n     *\n     * _.unzipWith(zipped, _.add);\n     * // => [3, 30, 300]\n     */\n    function unzipWith(array, iteratee) {\n      if (!(array && array.length)) {\n        return [];\n      }\n      var result = unzip(array);\n      if (iteratee == null) {\n        return result;\n      }\n      return arrayMap(result, function(group) {\n        return apply(iteratee, undefined, group);\n      });\n    }\n\n    /**\n     * Creates an array excluding all given values using\n     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * for equality comparisons.\n     *\n     * **Note:** Unlike `_.pull`, this method returns a new array.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {...*} [values] The values to exclude.\n     * @returns {Array} Returns the new array of filtered values.\n     * @see _.difference, _.xor\n     * @example\n     *\n     * _.without([2, 1, 2, 3], 1, 2);\n     * // => [3]\n     */\n    var without = baseRest(function(array, values) {\n      return isArrayLikeObject(array)\n        ? baseDifference(array, values)\n        : [];\n    });\n\n    /**\n     * Creates an array of unique values that is the\n     * [symmetric difference](https://en.wikipedia.org/wiki/Symmetric_difference)\n     * of the given arrays. The order of result values is determined by the order\n     * they occur in the arrays.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.4.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @returns {Array} Returns the new array of filtered values.\n     * @see _.difference, _.without\n     * @example\n     *\n     * _.xor([2, 1], [2, 3]);\n     * // => [1, 3]\n     */\n    var xor = baseRest(function(arrays) {\n      return baseXor(arrayFilter(arrays, isArrayLikeObject));\n    });\n\n    /**\n     * This method is like `_.xor` except that it accepts `iteratee` which is\n     * invoked for each element of each `arrays` to generate the criterion by\n     * which by which they're compared. The order of result values is determined\n     * by the order they occur in the arrays. The iteratee is invoked with one\n     * argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {Array} Returns the new array of filtered values.\n     * @example\n     *\n     * _.xorBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n     * // => [1.2, 3.4]\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.xorBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n     * // => [{ 'x': 2 }]\n     */\n    var xorBy = baseRest(function(arrays) {\n      var iteratee = last(arrays);\n      if (isArrayLikeObject(iteratee)) {\n        iteratee = undefined;\n      }\n      return baseXor(arrayFilter(arrays, isArrayLikeObject), getIteratee(iteratee, 2));\n    });\n\n    /**\n     * This method is like `_.xor` except that it accepts `comparator` which is\n     * invoked to compare elements of `arrays`. The order of result values is\n     * determined by the order they occur in the arrays. The comparator is invoked\n     * with two arguments: (arrVal, othVal).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new array of filtered values.\n     * @example\n     *\n     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n     * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n     *\n     * _.xorWith(objects, others, _.isEqual);\n     * // => [{ 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]\n     */\n    var xorWith = baseRest(function(arrays) {\n      var comparator = last(arrays);\n      comparator = typeof comparator == 'function' ? comparator : undefined;\n      return baseXor(arrayFilter(arrays, isArrayLikeObject), undefined, comparator);\n    });\n\n    /**\n     * Creates an array of grouped elements, the first of which contains the\n     * first elements of the given arrays, the second of which contains the\n     * second elements of the given arrays, and so on.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to process.\n     * @returns {Array} Returns the new array of grouped elements.\n     * @example\n     *\n     * _.zip(['a', 'b'], [1, 2], [true, false]);\n     * // => [['a', 1, true], ['b', 2, false]]\n     */\n    var zip = baseRest(unzip);\n\n    /**\n     * This method is like `_.fromPairs` except that it accepts two arrays,\n     * one of property identifiers and one of corresponding values.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.4.0\n     * @category Array\n     * @param {Array} [props=[]] The property identifiers.\n     * @param {Array} [values=[]] The property values.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * _.zipObject(['a', 'b'], [1, 2]);\n     * // => { 'a': 1, 'b': 2 }\n     */\n    function zipObject(props, values) {\n      return baseZipObject(props || [], values || [], assignValue);\n    }\n\n    /**\n     * This method is like `_.zipObject` except that it supports property paths.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.1.0\n     * @category Array\n     * @param {Array} [props=[]] The property identifiers.\n     * @param {Array} [values=[]] The property values.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * _.zipObjectDeep(['a.b[0].c', 'a.b[1].d'], [1, 2]);\n     * // => { 'a': { 'b': [{ 'c': 1 }, { 'd': 2 }] } }\n     */\n    function zipObjectDeep(props, values) {\n      return baseZipObject(props || [], values || [], baseSet);\n    }\n\n    /**\n     * This method is like `_.zip` except that it accepts `iteratee` to specify\n     * how grouped values should be combined. The iteratee is invoked with the\n     * elements of each group: (...group).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.8.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to process.\n     * @param {Function} [iteratee=_.identity] The function to combine\n     *  grouped values.\n     * @returns {Array} Returns the new array of grouped elements.\n     * @example\n     *\n     * _.zipWith([1, 2], [10, 20], [100, 200], function(a, b, c) {\n     *   return a + b + c;\n     * });\n     * // => [111, 222]\n     */\n    var zipWith = baseRest(function(arrays) {\n      var length = arrays.length,\n          iteratee = length > 1 ? arrays[length - 1] : undefined;\n\n      iteratee = typeof iteratee == 'function' ? (arrays.pop(), iteratee) : undefined;\n      return unzipWith(arrays, iteratee);\n    });\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates a `lodash` wrapper instance that wraps `value` with explicit method\n     * chain sequences enabled. The result of such sequences must be unwrapped\n     * with `_#value`.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.3.0\n     * @category Seq\n     * @param {*} value The value to wrap.\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'age': 36 },\n     *   { 'user': 'fred',    'age': 40 },\n     *   { 'user': 'pebbles', 'age': 1 }\n     * ];\n     *\n     * var youngest = _\n     *   .chain(users)\n     *   .sortBy('age')\n     *   .map(function(o) {\n     *     return o.user + ' is ' + o.age;\n     *   })\n     *   .head()\n     *   .value();\n     * // => 'pebbles is 1'\n     */\n    function chain(value) {\n      var result = lodash(value);\n      result.__chain__ = true;\n      return result;\n    }\n\n    /**\n     * This method invokes `interceptor` and returns `value`. The interceptor\n     * is invoked with one argument; (value). The purpose of this method is to\n     * \"tap into\" a method chain sequence in order to modify intermediate results.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Seq\n     * @param {*} value The value to provide to `interceptor`.\n     * @param {Function} interceptor The function to invoke.\n     * @returns {*} Returns `value`.\n     * @example\n     *\n     * _([1, 2, 3])\n     *  .tap(function(array) {\n     *    // Mutate input array.\n     *    array.pop();\n     *  })\n     *  .reverse()\n     *  .value();\n     * // => [2, 1]\n     */\n    function tap(value, interceptor) {\n      interceptor(value);\n      return value;\n    }\n\n    /**\n     * This method is like `_.tap` except that it returns the result of `interceptor`.\n     * The purpose of this method is to \"pass thru\" values replacing intermediate\n     * results in a method chain sequence.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Seq\n     * @param {*} value The value to provide to `interceptor`.\n     * @param {Function} interceptor The function to invoke.\n     * @returns {*} Returns the result of `interceptor`.\n     * @example\n     *\n     * _('  abc  ')\n     *  .chain()\n     *  .trim()\n     *  .thru(function(value) {\n     *    return [value];\n     *  })\n     *  .value();\n     * // => ['abc']\n     */\n    function thru(value, interceptor) {\n      return interceptor(value);\n    }\n\n    /**\n     * This method is the wrapper version of `_.at`.\n     *\n     * @name at\n     * @memberOf _\n     * @since 1.0.0\n     * @category Seq\n     * @param {...(string|string[])} [paths] The property paths to pick.\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };\n     *\n     * _(object).at(['a[0].b.c', 'a[1]']).value();\n     * // => [3, 4]\n     */\n    var wrapperAt = flatRest(function(paths) {\n      var length = paths.length,\n          start = length ? paths[0] : 0,\n          value = this.__wrapped__,\n          interceptor = function(object) { return baseAt(object, paths); };\n\n      if (length > 1 || this.__actions__.length ||\n          !(value instanceof LazyWrapper) || !isIndex(start)) {\n        return this.thru(interceptor);\n      }\n      value = value.slice(start, +start + (length ? 1 : 0));\n      value.__actions__.push({\n        'func': thru,\n        'args': [interceptor],\n        'thisArg': undefined\n      });\n      return new LodashWrapper(value, this.__chain__).thru(function(array) {\n        if (length && !array.length) {\n          array.push(undefined);\n        }\n        return array;\n      });\n    });\n\n    /**\n     * Creates a `lodash` wrapper instance with explicit method chain sequences enabled.\n     *\n     * @name chain\n     * @memberOf _\n     * @since 0.1.0\n     * @category Seq\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney', 'age': 36 },\n     *   { 'user': 'fred',   'age': 40 }\n     * ];\n     *\n     * // A sequence without explicit chaining.\n     * _(users).head();\n     * // => { 'user': 'barney', 'age': 36 }\n     *\n     * // A sequence with explicit chaining.\n     * _(users)\n     *   .chain()\n     *   .head()\n     *   .pick('user')\n     *   .value();\n     * // => { 'user': 'barney' }\n     */\n    function wrapperChain() {\n      return chain(this);\n    }\n\n    /**\n     * Executes the chain sequence and returns the wrapped result.\n     *\n     * @name commit\n     * @memberOf _\n     * @since 3.2.0\n     * @category Seq\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * var array = [1, 2];\n     * var wrapped = _(array).push(3);\n     *\n     * console.log(array);\n     * // => [1, 2]\n     *\n     * wrapped = wrapped.commit();\n     * console.log(array);\n     * // => [1, 2, 3]\n     *\n     * wrapped.last();\n     * // => 3\n     *\n     * console.log(array);\n     * // => [1, 2, 3]\n     */\n    function wrapperCommit() {\n      return new LodashWrapper(this.value(), this.__chain__);\n    }\n\n    /**\n     * Gets the next value on a wrapped object following the\n     * [iterator protocol](https://mdn.io/iteration_protocols#iterator).\n     *\n     * @name next\n     * @memberOf _\n     * @since 4.0.0\n     * @category Seq\n     * @returns {Object} Returns the next iterator value.\n     * @example\n     *\n     * var wrapped = _([1, 2]);\n     *\n     * wrapped.next();\n     * // => { 'done': false, 'value': 1 }\n     *\n     * wrapped.next();\n     * // => { 'done': false, 'value': 2 }\n     *\n     * wrapped.next();\n     * // => { 'done': true, 'value': undefined }\n     */\n    function wrapperNext() {\n      if (this.__values__ === undefined) {\n        this.__values__ = toArray(this.value());\n      }\n      var done = this.__index__ >= this.__values__.length,\n          value = done ? undefined : this.__values__[this.__index__++];\n\n      return { 'done': done, 'value': value };\n    }\n\n    /**\n     * Enables the wrapper to be iterable.\n     *\n     * @name Symbol.iterator\n     * @memberOf _\n     * @since 4.0.0\n     * @category Seq\n     * @returns {Object} Returns the wrapper object.\n     * @example\n     *\n     * var wrapped = _([1, 2]);\n     *\n     * wrapped[Symbol.iterator]() === wrapped;\n     * // => true\n     *\n     * Array.from(wrapped);\n     * // => [1, 2]\n     */\n    function wrapperToIterator() {\n      return this;\n    }\n\n    /**\n     * Creates a clone of the chain sequence planting `value` as the wrapped value.\n     *\n     * @name plant\n     * @memberOf _\n     * @since 3.2.0\n     * @category Seq\n     * @param {*} value The value to plant.\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * function square(n) {\n     *   return n * n;\n     * }\n     *\n     * var wrapped = _([1, 2]).map(square);\n     * var other = wrapped.plant([3, 4]);\n     *\n     * other.value();\n     * // => [9, 16]\n     *\n     * wrapped.value();\n     * // => [1, 4]\n     */\n    function wrapperPlant(value) {\n      var result,\n          parent = this;\n\n      while (parent instanceof baseLodash) {\n        var clone = wrapperClone(parent);\n        clone.__index__ = 0;\n        clone.__values__ = undefined;\n        if (result) {\n          previous.__wrapped__ = clone;\n        } else {\n          result = clone;\n        }\n        var previous = clone;\n        parent = parent.__wrapped__;\n      }\n      previous.__wrapped__ = value;\n      return result;\n    }\n\n    /**\n     * This method is the wrapper version of `_.reverse`.\n     *\n     * **Note:** This method mutates the wrapped array.\n     *\n     * @name reverse\n     * @memberOf _\n     * @since 0.1.0\n     * @category Seq\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * var array = [1, 2, 3];\n     *\n     * _(array).reverse().value()\n     * // => [3, 2, 1]\n     *\n     * console.log(array);\n     * // => [3, 2, 1]\n     */\n    function wrapperReverse() {\n      var value = this.__wrapped__;\n      if (value instanceof LazyWrapper) {\n        var wrapped = value;\n        if (this.__actions__.length) {\n          wrapped = new LazyWrapper(this);\n        }\n        wrapped = wrapped.reverse();\n        wrapped.__actions__.push({\n          'func': thru,\n          'args': [reverse],\n          'thisArg': undefined\n        });\n        return new LodashWrapper(wrapped, this.__chain__);\n      }\n      return this.thru(reverse);\n    }\n\n    /**\n     * Executes the chain sequence to resolve the unwrapped value.\n     *\n     * @name value\n     * @memberOf _\n     * @since 0.1.0\n     * @alias toJSON, valueOf\n     * @category Seq\n     * @returns {*} Returns the resolved unwrapped value.\n     * @example\n     *\n     * _([1, 2, 3]).value();\n     * // => [1, 2, 3]\n     */\n    function wrapperValue() {\n      return baseWrapperValue(this.__wrapped__, this.__actions__);\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates an object composed of keys generated from the results of running\n     * each element of `collection` thru `iteratee`. The corresponding value of\n     * each key is the number of times the key was returned by `iteratee`. The\n     * iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.5.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n     * @returns {Object} Returns the composed aggregate object.\n     * @example\n     *\n     * _.countBy([6.1, 4.2, 6.3], Math.floor);\n     * // => { '4': 1, '6': 2 }\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.countBy(['one', 'two', 'three'], 'length');\n     * // => { '3': 2, '5': 1 }\n     */\n    var countBy = createAggregator(function(result, value, key) {\n      if (hasOwnProperty.call(result, key)) {\n        ++result[key];\n      } else {\n        baseAssignValue(result, key, 1);\n      }\n    });\n\n    /**\n     * Checks if `predicate` returns truthy for **all** elements of `collection`.\n     * Iteration is stopped once `predicate` returns falsey. The predicate is\n     * invoked with three arguments: (value, index|key, collection).\n     *\n     * **Note:** This method returns `true` for\n     * [empty collections](https://en.wikipedia.org/wiki/Empty_set) because\n     * [everything is true](https://en.wikipedia.org/wiki/Vacuous_truth) of\n     * elements of empty collections.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {boolean} Returns `true` if all elements pass the predicate check,\n     *  else `false`.\n     * @example\n     *\n     * _.every([true, 1, null, 'yes'], Boolean);\n     * // => false\n     *\n     * var users = [\n     *   { 'user': 'barney', 'age': 36, 'active': false },\n     *   { 'user': 'fred',   'age': 40, 'active': false }\n     * ];\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.every(users, { 'user': 'barney', 'active': false });\n     * // => false\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.every(users, ['active', false]);\n     * // => true\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.every(users, 'active');\n     * // => false\n     */\n    function every(collection, predicate, guard) {\n      var func = isArray(collection) ? arrayEvery : baseEvery;\n      if (guard && isIterateeCall(collection, predicate, guard)) {\n        predicate = undefined;\n      }\n      return func(collection, getIteratee(predicate, 3));\n    }\n\n    /**\n     * Iterates over elements of `collection`, returning an array of all elements\n     * `predicate` returns truthy for. The predicate is invoked with three\n     * arguments: (value, index|key, collection).\n     *\n     * **Note:** Unlike `_.remove`, this method returns a new array.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the new filtered array.\n     * @see _.reject\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney', 'age': 36, 'active': true },\n     *   { 'user': 'fred',   'age': 40, 'active': false }\n     * ];\n     *\n     * _.filter(users, function(o) { return !o.active; });\n     * // => objects for ['fred']\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.filter(users, { 'age': 36, 'active': true });\n     * // => objects for ['barney']\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.filter(users, ['active', false]);\n     * // => objects for ['fred']\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.filter(users, 'active');\n     * // => objects for ['barney']\n     *\n     * // Combining several predicates using `_.overEvery` or `_.overSome`.\n     * _.filter(users, _.overSome([{ 'age': 36 }, ['age', 40]]));\n     * // => objects for ['fred', 'barney']\n     */\n    function filter(collection, predicate) {\n      var func = isArray(collection) ? arrayFilter : baseFilter;\n      return func(collection, getIteratee(predicate, 3));\n    }\n\n    /**\n     * Iterates over elements of `collection`, returning the first element\n     * `predicate` returns truthy for. The predicate is invoked with three\n     * arguments: (value, index|key, collection).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to inspect.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @param {number} [fromIndex=0] The index to search from.\n     * @returns {*} Returns the matched element, else `undefined`.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'age': 36, 'active': true },\n     *   { 'user': 'fred',    'age': 40, 'active': false },\n     *   { 'user': 'pebbles', 'age': 1,  'active': true }\n     * ];\n     *\n     * _.find(users, function(o) { return o.age < 40; });\n     * // => object for 'barney'\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.find(users, { 'age': 1, 'active': true });\n     * // => object for 'pebbles'\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.find(users, ['active', false]);\n     * // => object for 'fred'\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.find(users, 'active');\n     * // => object for 'barney'\n     */\n    var find = createFind(findIndex);\n\n    /**\n     * This method is like `_.find` except that it iterates over elements of\n     * `collection` from right to left.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to inspect.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @param {number} [fromIndex=collection.length-1] The index to search from.\n     * @returns {*} Returns the matched element, else `undefined`.\n     * @example\n     *\n     * _.findLast([1, 2, 3, 4], function(n) {\n     *   return n % 2 == 1;\n     * });\n     * // => 3\n     */\n    var findLast = createFind(findLastIndex);\n\n    /**\n     * Creates a flattened array of values by running each element in `collection`\n     * thru `iteratee` and flattening the mapped results. The iteratee is invoked\n     * with three arguments: (value, index|key, collection).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the new flattened array.\n     * @example\n     *\n     * function duplicate(n) {\n     *   return [n, n];\n     * }\n     *\n     * _.flatMap([1, 2], duplicate);\n     * // => [1, 1, 2, 2]\n     */\n    function flatMap(collection, iteratee) {\n      return baseFlatten(map(collection, iteratee), 1);\n    }\n\n    /**\n     * This method is like `_.flatMap` except that it recursively flattens the\n     * mapped results.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.7.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the new flattened array.\n     * @example\n     *\n     * function duplicate(n) {\n     *   return [[[n, n]]];\n     * }\n     *\n     * _.flatMapDeep([1, 2], duplicate);\n     * // => [1, 1, 2, 2]\n     */\n    function flatMapDeep(collection, iteratee) {\n      return baseFlatten(map(collection, iteratee), INFINITY);\n    }\n\n    /**\n     * This method is like `_.flatMap` except that it recursively flattens the\n     * mapped results up to `depth` times.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.7.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @param {number} [depth=1] The maximum recursion depth.\n     * @returns {Array} Returns the new flattened array.\n     * @example\n     *\n     * function duplicate(n) {\n     *   return [[[n, n]]];\n     * }\n     *\n     * _.flatMapDepth([1, 2], duplicate, 2);\n     * // => [[1, 1], [2, 2]]\n     */\n    function flatMapDepth(collection, iteratee, depth) {\n      depth = depth === undefined ? 1 : toInteger(depth);\n      return baseFlatten(map(collection, iteratee), depth);\n    }\n\n    /**\n     * Iterates over elements of `collection` and invokes `iteratee` for each element.\n     * The iteratee is invoked with three arguments: (value, index|key, collection).\n     * Iteratee functions may exit iteration early by explicitly returning `false`.\n     *\n     * **Note:** As with other \"Collections\" methods, objects with a \"length\"\n     * property are iterated like arrays. To avoid this behavior use `_.forIn`\n     * or `_.forOwn` for object iteration.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @alias each\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Array|Object} Returns `collection`.\n     * @see _.forEachRight\n     * @example\n     *\n     * _.forEach([1, 2], function(value) {\n     *   console.log(value);\n     * });\n     * // => Logs `1` then `2`.\n     *\n     * _.forEach({ 'a': 1, 'b': 2 }, function(value, key) {\n     *   console.log(key);\n     * });\n     * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n     */\n    function forEach(collection, iteratee) {\n      var func = isArray(collection) ? arrayEach : baseEach;\n      return func(collection, getIteratee(iteratee, 3));\n    }\n\n    /**\n     * This method is like `_.forEach` except that it iterates over elements of\n     * `collection` from right to left.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @alias eachRight\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Array|Object} Returns `collection`.\n     * @see _.forEach\n     * @example\n     *\n     * _.forEachRight([1, 2], function(value) {\n     *   console.log(value);\n     * });\n     * // => Logs `2` then `1`.\n     */\n    function forEachRight(collection, iteratee) {\n      var func = isArray(collection) ? arrayEachRight : baseEachRight;\n      return func(collection, getIteratee(iteratee, 3));\n    }\n\n    /**\n     * Creates an object composed of keys generated from the results of running\n     * each element of `collection` thru `iteratee`. The order of grouped values\n     * is determined by the order they occur in `collection`. The corresponding\n     * value of each key is an array of elements responsible for generating the\n     * key. The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n     * @returns {Object} Returns the composed aggregate object.\n     * @example\n     *\n     * _.groupBy([6.1, 4.2, 6.3], Math.floor);\n     * // => { '4': [4.2], '6': [6.1, 6.3] }\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.groupBy(['one', 'two', 'three'], 'length');\n     * // => { '3': ['one', 'two'], '5': ['three'] }\n     */\n    var groupBy = createAggregator(function(result, value, key) {\n      if (hasOwnProperty.call(result, key)) {\n        result[key].push(value);\n      } else {\n        baseAssignValue(result, key, [value]);\n      }\n    });\n\n    /**\n     * Checks if `value` is in `collection`. If `collection` is a string, it's\n     * checked for a substring of `value`, otherwise\n     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * is used for equality comparisons. If `fromIndex` is negative, it's used as\n     * the offset from the end of `collection`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object|string} collection The collection to inspect.\n     * @param {*} value The value to search for.\n     * @param {number} [fromIndex=0] The index to search from.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.\n     * @returns {boolean} Returns `true` if `value` is found, else `false`.\n     * @example\n     *\n     * _.includes([1, 2, 3], 1);\n     * // => true\n     *\n     * _.includes([1, 2, 3], 1, 2);\n     * // => false\n     *\n     * _.includes({ 'a': 1, 'b': 2 }, 1);\n     * // => true\n     *\n     * _.includes('abcd', 'bc');\n     * // => true\n     */\n    function includes(collection, value, fromIndex, guard) {\n      collection = isArrayLike(collection) ? collection : values(collection);\n      fromIndex = (fromIndex && !guard) ? toInteger(fromIndex) : 0;\n\n      var length = collection.length;\n      if (fromIndex < 0) {\n        fromIndex = nativeMax(length + fromIndex, 0);\n      }\n      return isString(collection)\n        ? (fromIndex <= length && collection.indexOf(value, fromIndex) > -1)\n        : (!!length && baseIndexOf(collection, value, fromIndex) > -1);\n    }\n\n    /**\n     * Invokes the method at `path` of each element in `collection`, returning\n     * an array of the results of each invoked method. Any additional arguments\n     * are provided to each invoked method. If `path` is a function, it's invoked\n     * for, and `this` bound to, each element in `collection`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Array|Function|string} path The path of the method to invoke or\n     *  the function invoked per iteration.\n     * @param {...*} [args] The arguments to invoke each method with.\n     * @returns {Array} Returns the array of results.\n     * @example\n     *\n     * _.invokeMap([[5, 1, 7], [3, 2, 1]], 'sort');\n     * // => [[1, 5, 7], [1, 2, 3]]\n     *\n     * _.invokeMap([123, 456], String.prototype.split, '');\n     * // => [['1', '2', '3'], ['4', '5', '6']]\n     */\n    var invokeMap = baseRest(function(collection, path, args) {\n      var index = -1,\n          isFunc = typeof path == 'function',\n          result = isArrayLike(collection) ? Array(collection.length) : [];\n\n      baseEach(collection, function(value) {\n        result[++index] = isFunc ? apply(path, value, args) : baseInvoke(value, path, args);\n      });\n      return result;\n    });\n\n    /**\n     * Creates an object composed of keys generated from the results of running\n     * each element of `collection` thru `iteratee`. The corresponding value of\n     * each key is the last element responsible for generating the key. The\n     * iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n     * @returns {Object} Returns the composed aggregate object.\n     * @example\n     *\n     * var array = [\n     *   { 'dir': 'left', 'code': 97 },\n     *   { 'dir': 'right', 'code': 100 }\n     * ];\n     *\n     * _.keyBy(array, function(o) {\n     *   return String.fromCharCode(o.code);\n     * });\n     * // => { 'a': { 'dir': 'left', 'code': 97 }, 'd': { 'dir': 'right', 'code': 100 } }\n     *\n     * _.keyBy(array, 'dir');\n     * // => { 'left': { 'dir': 'left', 'code': 97 }, 'right': { 'dir': 'right', 'code': 100 } }\n     */\n    var keyBy = createAggregator(function(result, value, key) {\n      baseAssignValue(result, key, value);\n    });\n\n    /**\n     * Creates an array of values by running each element in `collection` thru\n     * `iteratee`. The iteratee is invoked with three arguments:\n     * (value, index|key, collection).\n     *\n     * Many lodash methods are guarded to work as iteratees for methods like\n     * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`.\n     *\n     * The guarded methods are:\n     * `ary`, `chunk`, `curry`, `curryRight`, `drop`, `dropRight`, `every`,\n     * `fill`, `invert`, `parseInt`, `random`, `range`, `rangeRight`, `repeat`,\n     * `sampleSize`, `slice`, `some`, `sortBy`, `split`, `take`, `takeRight`,\n     * `template`, `trim`, `trimEnd`, `trimStart`, and `words`\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the new mapped array.\n     * @example\n     *\n     * function square(n) {\n     *   return n * n;\n     * }\n     *\n     * _.map([4, 8], square);\n     * // => [16, 64]\n     *\n     * _.map({ 'a': 4, 'b': 8 }, square);\n     * // => [16, 64] (iteration order is not guaranteed)\n     *\n     * var users = [\n     *   { 'user': 'barney' },\n     *   { 'user': 'fred' }\n     * ];\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.map(users, 'user');\n     * // => ['barney', 'fred']\n     */\n    function map(collection, iteratee) {\n      var func = isArray(collection) ? arrayMap : baseMap;\n      return func(collection, getIteratee(iteratee, 3));\n    }\n\n    /**\n     * This method is like `_.sortBy` except that it allows specifying the sort\n     * orders of the iteratees to sort by. If `orders` is unspecified, all values\n     * are sorted in ascending order. Otherwise, specify an order of \"desc\" for\n     * descending or \"asc\" for ascending sort order of corresponding values.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Array[]|Function[]|Object[]|string[]} [iteratees=[_.identity]]\n     *  The iteratees to sort by.\n     * @param {string[]} [orders] The sort orders of `iteratees`.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.\n     * @returns {Array} Returns the new sorted array.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'fred',   'age': 48 },\n     *   { 'user': 'barney', 'age': 34 },\n     *   { 'user': 'fred',   'age': 40 },\n     *   { 'user': 'barney', 'age': 36 }\n     * ];\n     *\n     * // Sort by `user` in ascending order and by `age` in descending order.\n     * _.orderBy(users, ['user', 'age'], ['asc', 'desc']);\n     * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]]\n     */\n    function orderBy(collection, iteratees, orders, guard) {\n      if (collection == null) {\n        return [];\n      }\n      if (!isArray(iteratees)) {\n        iteratees = iteratees == null ? [] : [iteratees];\n      }\n      orders = guard ? undefined : orders;\n      if (!isArray(orders)) {\n        orders = orders == null ? [] : [orders];\n      }\n      return baseOrderBy(collection, iteratees, orders);\n    }\n\n    /**\n     * Creates an array of elements split into two groups, the first of which\n     * contains elements `predicate` returns truthy for, the second of which\n     * contains elements `predicate` returns falsey for. The predicate is\n     * invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the array of grouped elements.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'age': 36, 'active': false },\n     *   { 'user': 'fred',    'age': 40, 'active': true },\n     *   { 'user': 'pebbles', 'age': 1,  'active': false }\n     * ];\n     *\n     * _.partition(users, function(o) { return o.active; });\n     * // => objects for [['fred'], ['barney', 'pebbles']]\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.partition(users, { 'age': 1, 'active': false });\n     * // => objects for [['pebbles'], ['barney', 'fred']]\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.partition(users, ['active', false]);\n     * // => objects for [['barney', 'pebbles'], ['fred']]\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.partition(users, 'active');\n     * // => objects for [['fred'], ['barney', 'pebbles']]\n     */\n    var partition = createAggregator(function(result, value, key) {\n      result[key ? 0 : 1].push(value);\n    }, function() { return [[], []]; });\n\n    /**\n     * Reduces `collection` to a value which is the accumulated result of running\n     * each element in `collection` thru `iteratee`, where each successive\n     * invocation is supplied the return value of the previous. If `accumulator`\n     * is not given, the first element of `collection` is used as the initial\n     * value. The iteratee is invoked with four arguments:\n     * (accumulator, value, index|key, collection).\n     *\n     * Many lodash methods are guarded to work as iteratees for methods like\n     * `_.reduce`, `_.reduceRight`, and `_.transform`.\n     *\n     * The guarded methods are:\n     * `assign`, `defaults`, `defaultsDeep`, `includes`, `merge`, `orderBy`,\n     * and `sortBy`\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @param {*} [accumulator] The initial value.\n     * @returns {*} Returns the accumulated value.\n     * @see _.reduceRight\n     * @example\n     *\n     * _.reduce([1, 2], function(sum, n) {\n     *   return sum + n;\n     * }, 0);\n     * // => 3\n     *\n     * _.reduce({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n     *   (result[value] || (result[value] = [])).push(key);\n     *   return result;\n     * }, {});\n     * // => { '1': ['a', 'c'], '2': ['b'] } (iteration order is not guaranteed)\n     */\n    function reduce(collection, iteratee, accumulator) {\n      var func = isArray(collection) ? arrayReduce : baseReduce,\n          initAccum = arguments.length < 3;\n\n      return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEach);\n    }\n\n    /**\n     * This method is like `_.reduce` except that it iterates over elements of\n     * `collection` from right to left.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @param {*} [accumulator] The initial value.\n     * @returns {*} Returns the accumulated value.\n     * @see _.reduce\n     * @example\n     *\n     * var array = [[0, 1], [2, 3], [4, 5]];\n     *\n     * _.reduceRight(array, function(flattened, other) {\n     *   return flattened.concat(other);\n     * }, []);\n     * // => [4, 5, 2, 3, 0, 1]\n     */\n    function reduceRight(collection, iteratee, accumulator) {\n      var func = isArray(collection) ? arrayReduceRight : baseReduce,\n          initAccum = arguments.length < 3;\n\n      return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEachRight);\n    }\n\n    /**\n     * The opposite of `_.filter`; this method returns the elements of `collection`\n     * that `predicate` does **not** return truthy for.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the new filtered array.\n     * @see _.filter\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney', 'age': 36, 'active': false },\n     *   { 'user': 'fred',   'age': 40, 'active': true }\n     * ];\n     *\n     * _.reject(users, function(o) { return !o.active; });\n     * // => objects for ['fred']\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.reject(users, { 'age': 40, 'active': true });\n     * // => objects for ['barney']\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.reject(users, ['active', false]);\n     * // => objects for ['fred']\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.reject(users, 'active');\n     * // => objects for ['barney']\n     */\n    function reject(collection, predicate) {\n      var func = isArray(collection) ? arrayFilter : baseFilter;\n      return func(collection, negate(getIteratee(predicate, 3)));\n    }\n\n    /**\n     * Gets a random element from `collection`.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to sample.\n     * @returns {*} Returns the random element.\n     * @example\n     *\n     * _.sample([1, 2, 3, 4]);\n     * // => 2\n     */\n    function sample(collection) {\n      var func = isArray(collection) ? arraySample : baseSample;\n      return func(collection);\n    }\n\n    /**\n     * Gets `n` random elements at unique keys from `collection` up to the\n     * size of `collection`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to sample.\n     * @param {number} [n=1] The number of elements to sample.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Array} Returns the random elements.\n     * @example\n     *\n     * _.sampleSize([1, 2, 3], 2);\n     * // => [3, 1]\n     *\n     * _.sampleSize([1, 2, 3], 4);\n     * // => [2, 3, 1]\n     */\n    function sampleSize(collection, n, guard) {\n      if ((guard ? isIterateeCall(collection, n, guard) : n === undefined)) {\n        n = 1;\n      } else {\n        n = toInteger(n);\n      }\n      var func = isArray(collection) ? arraySampleSize : baseSampleSize;\n      return func(collection, n);\n    }\n\n    /**\n     * Creates an array of shuffled values, using a version of the\n     * [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/Fisher-Yates_shuffle).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to shuffle.\n     * @returns {Array} Returns the new shuffled array.\n     * @example\n     *\n     * _.shuffle([1, 2, 3, 4]);\n     * // => [4, 1, 3, 2]\n     */\n    function shuffle(collection) {\n      var func = isArray(collection) ? arrayShuffle : baseShuffle;\n      return func(collection);\n    }\n\n    /**\n     * Gets the size of `collection` by returning its length for array-like\n     * values or the number of own enumerable string keyed properties for objects.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object|string} collection The collection to inspect.\n     * @returns {number} Returns the collection size.\n     * @example\n     *\n     * _.size([1, 2, 3]);\n     * // => 3\n     *\n     * _.size({ 'a': 1, 'b': 2 });\n     * // => 2\n     *\n     * _.size('pebbles');\n     * // => 7\n     */\n    function size(collection) {\n      if (collection == null) {\n        return 0;\n      }\n      if (isArrayLike(collection)) {\n        return isString(collection) ? stringSize(collection) : collection.length;\n      }\n      var tag = getTag(collection);\n      if (tag == mapTag || tag == setTag) {\n        return collection.size;\n      }\n      return baseKeys(collection).length;\n    }\n\n    /**\n     * Checks if `predicate` returns truthy for **any** element of `collection`.\n     * Iteration is stopped once `predicate` returns truthy. The predicate is\n     * invoked with three arguments: (value, index|key, collection).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {boolean} Returns `true` if any element passes the predicate check,\n     *  else `false`.\n     * @example\n     *\n     * _.some([null, 0, 'yes', false], Boolean);\n     * // => true\n     *\n     * var users = [\n     *   { 'user': 'barney', 'active': true },\n     *   { 'user': 'fred',   'active': false }\n     * ];\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.some(users, { 'user': 'barney', 'active': false });\n     * // => false\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.some(users, ['active', false]);\n     * // => true\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.some(users, 'active');\n     * // => true\n     */\n    function some(collection, predicate, guard) {\n      var func = isArray(collection) ? arraySome : baseSome;\n      if (guard && isIterateeCall(collection, predicate, guard)) {\n        predicate = undefined;\n      }\n      return func(collection, getIteratee(predicate, 3));\n    }\n\n    /**\n     * Creates an array of elements, sorted in ascending order by the results of\n     * running each element in a collection thru each iteratee. This method\n     * performs a stable sort, that is, it preserves the original sort order of\n     * equal elements. The iteratees are invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {...(Function|Function[])} [iteratees=[_.identity]]\n     *  The iteratees to sort by.\n     * @returns {Array} Returns the new sorted array.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'fred',   'age': 48 },\n     *   { 'user': 'barney', 'age': 36 },\n     *   { 'user': 'fred',   'age': 30 },\n     *   { 'user': 'barney', 'age': 34 }\n     * ];\n     *\n     * _.sortBy(users, [function(o) { return o.user; }]);\n     * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 30]]\n     *\n     * _.sortBy(users, ['user', 'age']);\n     * // => objects for [['barney', 34], ['barney', 36], ['fred', 30], ['fred', 48]]\n     */\n    var sortBy = baseRest(function(collection, iteratees) {\n      if (collection == null) {\n        return [];\n      }\n      var length = iteratees.length;\n      if (length > 1 && isIterateeCall(collection, iteratees[0], iteratees[1])) {\n        iteratees = [];\n      } else if (length > 2 && isIterateeCall(iteratees[0], iteratees[1], iteratees[2])) {\n        iteratees = [iteratees[0]];\n      }\n      return baseOrderBy(collection, baseFlatten(iteratees, 1), []);\n    });\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Gets the timestamp of the number of milliseconds that have elapsed since\n     * the Unix epoch (1 January 1970 00:00:00 UTC).\n     *\n     * @static\n     * @memberOf _\n     * @since 2.4.0\n     * @category Date\n     * @returns {number} Returns the timestamp.\n     * @example\n     *\n     * _.defer(function(stamp) {\n     *   console.log(_.now() - stamp);\n     * }, _.now());\n     * // => Logs the number of milliseconds it took for the deferred invocation.\n     */\n    var now = ctxNow || function() {\n      return root.Date.now();\n    };\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * The opposite of `_.before`; this method creates a function that invokes\n     * `func` once it's called `n` or more times.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {number} n The number of calls before `func` is invoked.\n     * @param {Function} func The function to restrict.\n     * @returns {Function} Returns the new restricted function.\n     * @example\n     *\n     * var saves = ['profile', 'settings'];\n     *\n     * var done = _.after(saves.length, function() {\n     *   console.log('done saving!');\n     * });\n     *\n     * _.forEach(saves, function(type) {\n     *   asyncSave({ 'type': type, 'complete': done });\n     * });\n     * // => Logs 'done saving!' after the two async saves have completed.\n     */\n    function after(n, func) {\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      n = toInteger(n);\n      return function() {\n        if (--n < 1) {\n          return func.apply(this, arguments);\n        }\n      };\n    }\n\n    /**\n     * Creates a function that invokes `func`, with up to `n` arguments,\n     * ignoring any additional arguments.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Function\n     * @param {Function} func The function to cap arguments for.\n     * @param {number} [n=func.length] The arity cap.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Function} Returns the new capped function.\n     * @example\n     *\n     * _.map(['6', '8', '10'], _.ary(parseInt, 1));\n     * // => [6, 8, 10]\n     */\n    function ary(func, n, guard) {\n      n = guard ? undefined : n;\n      n = (func && n == null) ? func.length : n;\n      return createWrap(func, WRAP_ARY_FLAG, undefined, undefined, undefined, undefined, n);\n    }\n\n    /**\n     * Creates a function that invokes `func`, with the `this` binding and arguments\n     * of the created function, while it's called less than `n` times. Subsequent\n     * calls to the created function return the result of the last `func` invocation.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Function\n     * @param {number} n The number of calls at which `func` is no longer invoked.\n     * @param {Function} func The function to restrict.\n     * @returns {Function} Returns the new restricted function.\n     * @example\n     *\n     * jQuery(element).on('click', _.before(5, addContactToList));\n     * // => Allows adding up to 4 contacts to the list.\n     */\n    function before(n, func) {\n      var result;\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      n = toInteger(n);\n      return function() {\n        if (--n > 0) {\n          result = func.apply(this, arguments);\n        }\n        if (n <= 1) {\n          func = undefined;\n        }\n        return result;\n      };\n    }\n\n    /**\n     * Creates a function that invokes `func` with the `this` binding of `thisArg`\n     * and `partials` prepended to the arguments it receives.\n     *\n     * The `_.bind.placeholder` value, which defaults to `_` in monolithic builds,\n     * may be used as a placeholder for partially applied arguments.\n     *\n     * **Note:** Unlike native `Function#bind`, this method doesn't set the \"length\"\n     * property of bound functions.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to bind.\n     * @param {*} thisArg The `this` binding of `func`.\n     * @param {...*} [partials] The arguments to be partially applied.\n     * @returns {Function} Returns the new bound function.\n     * @example\n     *\n     * function greet(greeting, punctuation) {\n     *   return greeting + ' ' + this.user + punctuation;\n     * }\n     *\n     * var object = { 'user': 'fred' };\n     *\n     * var bound = _.bind(greet, object, 'hi');\n     * bound('!');\n     * // => 'hi fred!'\n     *\n     * // Bound with placeholders.\n     * var bound = _.bind(greet, object, _, '!');\n     * bound('hi');\n     * // => 'hi fred!'\n     */\n    var bind = baseRest(function(func, thisArg, partials) {\n      var bitmask = WRAP_BIND_FLAG;\n      if (partials.length) {\n        var holders = replaceHolders(partials, getHolder(bind));\n        bitmask |= WRAP_PARTIAL_FLAG;\n      }\n      return createWrap(func, bitmask, thisArg, partials, holders);\n    });\n\n    /**\n     * Creates a function that invokes the method at `object[key]` with `partials`\n     * prepended to the arguments it receives.\n     *\n     * This method differs from `_.bind` by allowing bound functions to reference\n     * methods that may be redefined or don't yet exist. See\n     * [Peter Michaux's article](http://peter.michaux.ca/articles/lazy-function-definition-pattern)\n     * for more details.\n     *\n     * The `_.bindKey.placeholder` value, which defaults to `_` in monolithic\n     * builds, may be used as a placeholder for partially applied arguments.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.10.0\n     * @category Function\n     * @param {Object} object The object to invoke the method on.\n     * @param {string} key The key of the method.\n     * @param {...*} [partials] The arguments to be partially applied.\n     * @returns {Function} Returns the new bound function.\n     * @example\n     *\n     * var object = {\n     *   'user': 'fred',\n     *   'greet': function(greeting, punctuation) {\n     *     return greeting + ' ' + this.user + punctuation;\n     *   }\n     * };\n     *\n     * var bound = _.bindKey(object, 'greet', 'hi');\n     * bound('!');\n     * // => 'hi fred!'\n     *\n     * object.greet = function(greeting, punctuation) {\n     *   return greeting + 'ya ' + this.user + punctuation;\n     * };\n     *\n     * bound('!');\n     * // => 'hiya fred!'\n     *\n     * // Bound with placeholders.\n     * var bound = _.bindKey(object, 'greet', _, '!');\n     * bound('hi');\n     * // => 'hiya fred!'\n     */\n    var bindKey = baseRest(function(object, key, partials) {\n      var bitmask = WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG;\n      if (partials.length) {\n        var holders = replaceHolders(partials, getHolder(bindKey));\n        bitmask |= WRAP_PARTIAL_FLAG;\n      }\n      return createWrap(key, bitmask, object, partials, holders);\n    });\n\n    /**\n     * Creates a function that accepts arguments of `func` and either invokes\n     * `func` returning its result, if at least `arity` number of arguments have\n     * been provided, or returns a function that accepts the remaining `func`\n     * arguments, and so on. The arity of `func` may be specified if `func.length`\n     * is not sufficient.\n     *\n     * The `_.curry.placeholder` value, which defaults to `_` in monolithic builds,\n     * may be used as a placeholder for provided arguments.\n     *\n     * **Note:** This method doesn't set the \"length\" property of curried functions.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Function\n     * @param {Function} func The function to curry.\n     * @param {number} [arity=func.length] The arity of `func`.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Function} Returns the new curried function.\n     * @example\n     *\n     * var abc = function(a, b, c) {\n     *   return [a, b, c];\n     * };\n     *\n     * var curried = _.curry(abc);\n     *\n     * curried(1)(2)(3);\n     * // => [1, 2, 3]\n     *\n     * curried(1, 2)(3);\n     * // => [1, 2, 3]\n     *\n     * curried(1, 2, 3);\n     * // => [1, 2, 3]\n     *\n     * // Curried with placeholders.\n     * curried(1)(_, 3)(2);\n     * // => [1, 2, 3]\n     */\n    function curry(func, arity, guard) {\n      arity = guard ? undefined : arity;\n      var result = createWrap(func, WRAP_CURRY_FLAG, undefined, undefined, undefined, undefined, undefined, arity);\n      result.placeholder = curry.placeholder;\n      return result;\n    }\n\n    /**\n     * This method is like `_.curry` except that arguments are applied to `func`\n     * in the manner of `_.partialRight` instead of `_.partial`.\n     *\n     * The `_.curryRight.placeholder` value, which defaults to `_` in monolithic\n     * builds, may be used as a placeholder for provided arguments.\n     *\n     * **Note:** This method doesn't set the \"length\" property of curried functions.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Function\n     * @param {Function} func The function to curry.\n     * @param {number} [arity=func.length] The arity of `func`.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Function} Returns the new curried function.\n     * @example\n     *\n     * var abc = function(a, b, c) {\n     *   return [a, b, c];\n     * };\n     *\n     * var curried = _.curryRight(abc);\n     *\n     * curried(3)(2)(1);\n     * // => [1, 2, 3]\n     *\n     * curried(2, 3)(1);\n     * // => [1, 2, 3]\n     *\n     * curried(1, 2, 3);\n     * // => [1, 2, 3]\n     *\n     * // Curried with placeholders.\n     * curried(3)(1, _)(2);\n     * // => [1, 2, 3]\n     */\n    function curryRight(func, arity, guard) {\n      arity = guard ? undefined : arity;\n      var result = createWrap(func, WRAP_CURRY_RIGHT_FLAG, undefined, undefined, undefined, undefined, undefined, arity);\n      result.placeholder = curryRight.placeholder;\n      return result;\n    }\n\n    /**\n     * Creates a debounced function that delays invoking `func` until after `wait`\n     * milliseconds have elapsed since the last time the debounced function was\n     * invoked. The debounced function comes with a `cancel` method to cancel\n     * delayed `func` invocations and a `flush` method to immediately invoke them.\n     * Provide `options` to indicate whether `func` should be invoked on the\n     * leading and/or trailing edge of the `wait` timeout. The `func` is invoked\n     * with the last arguments provided to the debounced function. Subsequent\n     * calls to the debounced function return the result of the last `func`\n     * invocation.\n     *\n     * **Note:** If `leading` and `trailing` options are `true`, `func` is\n     * invoked on the trailing edge of the timeout only if the debounced function\n     * is invoked more than once during the `wait` timeout.\n     *\n     * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n     * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n     *\n     * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n     * for details over the differences between `_.debounce` and `_.throttle`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to debounce.\n     * @param {number} [wait=0] The number of milliseconds to delay.\n     * @param {Object} [options={}] The options object.\n     * @param {boolean} [options.leading=false]\n     *  Specify invoking on the leading edge of the timeout.\n     * @param {number} [options.maxWait]\n     *  The maximum time `func` is allowed to be delayed before it's invoked.\n     * @param {boolean} [options.trailing=true]\n     *  Specify invoking on the trailing edge of the timeout.\n     * @returns {Function} Returns the new debounced function.\n     * @example\n     *\n     * // Avoid costly calculations while the window size is in flux.\n     * jQuery(window).on('resize', _.debounce(calculateLayout, 150));\n     *\n     * // Invoke `sendMail` when clicked, debouncing subsequent calls.\n     * jQuery(element).on('click', _.debounce(sendMail, 300, {\n     *   'leading': true,\n     *   'trailing': false\n     * }));\n     *\n     * // Ensure `batchLog` is invoked once after 1 second of debounced calls.\n     * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });\n     * var source = new EventSource('/stream');\n     * jQuery(source).on('message', debounced);\n     *\n     * // Cancel the trailing debounced invocation.\n     * jQuery(window).on('popstate', debounced.cancel);\n     */\n    function debounce(func, wait, options) {\n      var lastArgs,\n          lastThis,\n          maxWait,\n          result,\n          timerId,\n          lastCallTime,\n          lastInvokeTime = 0,\n          leading = false,\n          maxing = false,\n          trailing = true;\n\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      wait = toNumber(wait) || 0;\n      if (isObject(options)) {\n        leading = !!options.leading;\n        maxing = 'maxWait' in options;\n        maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait;\n        trailing = 'trailing' in options ? !!options.trailing : trailing;\n      }\n\n      function invokeFunc(time) {\n        var args = lastArgs,\n            thisArg = lastThis;\n\n        lastArgs = lastThis = undefined;\n        lastInvokeTime = time;\n        result = func.apply(thisArg, args);\n        return result;\n      }\n\n      function leadingEdge(time) {\n        // Reset any `maxWait` timer.\n        lastInvokeTime = time;\n        // Start the timer for the trailing edge.\n        timerId = setTimeout(timerExpired, wait);\n        // Invoke the leading edge.\n        return leading ? invokeFunc(time) : result;\n      }\n\n      function remainingWait(time) {\n        var timeSinceLastCall = time - lastCallTime,\n            timeSinceLastInvoke = time - lastInvokeTime,\n            timeWaiting = wait - timeSinceLastCall;\n\n        return maxing\n          ? nativeMin(timeWaiting, maxWait - timeSinceLastInvoke)\n          : timeWaiting;\n      }\n\n      function shouldInvoke(time) {\n        var timeSinceLastCall = time - lastCallTime,\n            timeSinceLastInvoke = time - lastInvokeTime;\n\n        // Either this is the first call, activity has stopped and we're at the\n        // trailing edge, the system time has gone backwards and we're treating\n        // it as the trailing edge, or we've hit the `maxWait` limit.\n        return (lastCallTime === undefined || (timeSinceLastCall >= wait) ||\n          (timeSinceLastCall < 0) || (maxing && timeSinceLastInvoke >= maxWait));\n      }\n\n      function timerExpired() {\n        var time = now();\n        if (shouldInvoke(time)) {\n          return trailingEdge(time);\n        }\n        // Restart the timer.\n        timerId = setTimeout(timerExpired, remainingWait(time));\n      }\n\n      function trailingEdge(time) {\n        timerId = undefined;\n\n        // Only invoke if we have `lastArgs` which means `func` has been\n        // debounced at least once.\n        if (trailing && lastArgs) {\n          return invokeFunc(time);\n        }\n        lastArgs = lastThis = undefined;\n        return result;\n      }\n\n      function cancel() {\n        if (timerId !== undefined) {\n          clearTimeout(timerId);\n        }\n        lastInvokeTime = 0;\n        lastArgs = lastCallTime = lastThis = timerId = undefined;\n      }\n\n      function flush() {\n        return timerId === undefined ? result : trailingEdge(now());\n      }\n\n      function debounced() {\n        var time = now(),\n            isInvoking = shouldInvoke(time);\n\n        lastArgs = arguments;\n        lastThis = this;\n        lastCallTime = time;\n\n        if (isInvoking) {\n          if (timerId === undefined) {\n            return leadingEdge(lastCallTime);\n          }\n          if (maxing) {\n            // Handle invocations in a tight loop.\n            clearTimeout(timerId);\n            timerId = setTimeout(timerExpired, wait);\n            return invokeFunc(lastCallTime);\n          }\n        }\n        if (timerId === undefined) {\n          timerId = setTimeout(timerExpired, wait);\n        }\n        return result;\n      }\n      debounced.cancel = cancel;\n      debounced.flush = flush;\n      return debounced;\n    }\n\n    /**\n     * Defers invoking the `func` until the current call stack has cleared. Any\n     * additional arguments are provided to `func` when it's invoked.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to defer.\n     * @param {...*} [args] The arguments to invoke `func` with.\n     * @returns {number} Returns the timer id.\n     * @example\n     *\n     * _.defer(function(text) {\n     *   console.log(text);\n     * }, 'deferred');\n     * // => Logs 'deferred' after one millisecond.\n     */\n    var defer = baseRest(function(func, args) {\n      return baseDelay(func, 1, args);\n    });\n\n    /**\n     * Invokes `func` after `wait` milliseconds. Any additional arguments are\n     * provided to `func` when it's invoked.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to delay.\n     * @param {number} wait The number of milliseconds to delay invocation.\n     * @param {...*} [args] The arguments to invoke `func` with.\n     * @returns {number} Returns the timer id.\n     * @example\n     *\n     * _.delay(function(text) {\n     *   console.log(text);\n     * }, 1000, 'later');\n     * // => Logs 'later' after one second.\n     */\n    var delay = baseRest(function(func, wait, args) {\n      return baseDelay(func, toNumber(wait) || 0, args);\n    });\n\n    /**\n     * Creates a function that invokes `func` with arguments reversed.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Function\n     * @param {Function} func The function to flip arguments for.\n     * @returns {Function} Returns the new flipped function.\n     * @example\n     *\n     * var flipped = _.flip(function() {\n     *   return _.toArray(arguments);\n     * });\n     *\n     * flipped('a', 'b', 'c', 'd');\n     * // => ['d', 'c', 'b', 'a']\n     */\n    function flip(func) {\n      return createWrap(func, WRAP_FLIP_FLAG);\n    }\n\n    /**\n     * Creates a function that memoizes the result of `func`. If `resolver` is\n     * provided, it determines the cache key for storing the result based on the\n     * arguments provided to the memoized function. By default, the first argument\n     * provided to the memoized function is used as the map cache key. The `func`\n     * is invoked with the `this` binding of the memoized function.\n     *\n     * **Note:** The cache is exposed as the `cache` property on the memoized\n     * function. Its creation may be customized by replacing the `_.memoize.Cache`\n     * constructor with one whose instances implement the\n     * [`Map`](http://ecma-international.org/ecma-262/7.0/#sec-properties-of-the-map-prototype-object)\n     * method interface of `clear`, `delete`, `get`, `has`, and `set`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to have its output memoized.\n     * @param {Function} [resolver] The function to resolve the cache key.\n     * @returns {Function} Returns the new memoized function.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': 2 };\n     * var other = { 'c': 3, 'd': 4 };\n     *\n     * var values = _.memoize(_.values);\n     * values(object);\n     * // => [1, 2]\n     *\n     * values(other);\n     * // => [3, 4]\n     *\n     * object.a = 2;\n     * values(object);\n     * // => [1, 2]\n     *\n     * // Modify the result cache.\n     * values.cache.set(object, ['a', 'b']);\n     * values(object);\n     * // => ['a', 'b']\n     *\n     * // Replace `_.memoize.Cache`.\n     * _.memoize.Cache = WeakMap;\n     */\n    function memoize(func, resolver) {\n      if (typeof func != 'function' || (resolver != null && typeof resolver != 'function')) {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      var memoized = function() {\n        var args = arguments,\n            key = resolver ? resolver.apply(this, args) : args[0],\n            cache = memoized.cache;\n\n        if (cache.has(key)) {\n          return cache.get(key);\n        }\n        var result = func.apply(this, args);\n        memoized.cache = cache.set(key, result) || cache;\n        return result;\n      };\n      memoized.cache = new (memoize.Cache || MapCache);\n      return memoized;\n    }\n\n    // Expose `MapCache`.\n    memoize.Cache = MapCache;\n\n    /**\n     * Creates a function that negates the result of the predicate `func`. The\n     * `func` predicate is invoked with the `this` binding and arguments of the\n     * created function.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Function\n     * @param {Function} predicate The predicate to negate.\n     * @returns {Function} Returns the new negated function.\n     * @example\n     *\n     * function isEven(n) {\n     *   return n % 2 == 0;\n     * }\n     *\n     * _.filter([1, 2, 3, 4, 5, 6], _.negate(isEven));\n     * // => [1, 3, 5]\n     */\n    function negate(predicate) {\n      if (typeof predicate != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      return function() {\n        var args = arguments;\n        switch (args.length) {\n          case 0: return !predicate.call(this);\n          case 1: return !predicate.call(this, args[0]);\n          case 2: return !predicate.call(this, args[0], args[1]);\n          case 3: return !predicate.call(this, args[0], args[1], args[2]);\n        }\n        return !predicate.apply(this, args);\n      };\n    }\n\n    /**\n     * Creates a function that is restricted to invoking `func` once. Repeat calls\n     * to the function return the value of the first invocation. The `func` is\n     * invoked with the `this` binding and arguments of the created function.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to restrict.\n     * @returns {Function} Returns the new restricted function.\n     * @example\n     *\n     * var initialize = _.once(createApplication);\n     * initialize();\n     * initialize();\n     * // => `createApplication` is invoked once\n     */\n    function once(func) {\n      return before(2, func);\n    }\n\n    /**\n     * Creates a function that invokes `func` with its arguments transformed.\n     *\n     * @static\n     * @since 4.0.0\n     * @memberOf _\n     * @category Function\n     * @param {Function} func The function to wrap.\n     * @param {...(Function|Function[])} [transforms=[_.identity]]\n     *  The argument transforms.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * function doubled(n) {\n     *   return n * 2;\n     * }\n     *\n     * function square(n) {\n     *   return n * n;\n     * }\n     *\n     * var func = _.overArgs(function(x, y) {\n     *   return [x, y];\n     * }, [square, doubled]);\n     *\n     * func(9, 3);\n     * // => [81, 6]\n     *\n     * func(10, 5);\n     * // => [100, 10]\n     */\n    var overArgs = castRest(function(func, transforms) {\n      transforms = (transforms.length == 1 && isArray(transforms[0]))\n        ? arrayMap(transforms[0], baseUnary(getIteratee()))\n        : arrayMap(baseFlatten(transforms, 1), baseUnary(getIteratee()));\n\n      var funcsLength = transforms.length;\n      return baseRest(function(args) {\n        var index = -1,\n            length = nativeMin(args.length, funcsLength);\n\n        while (++index < length) {\n          args[index] = transforms[index].call(this, args[index]);\n        }\n        return apply(func, this, args);\n      });\n    });\n\n    /**\n     * Creates a function that invokes `func` with `partials` prepended to the\n     * arguments it receives. This method is like `_.bind` except it does **not**\n     * alter the `this` binding.\n     *\n     * The `_.partial.placeholder` value, which defaults to `_` in monolithic\n     * builds, may be used as a placeholder for partially applied arguments.\n     *\n     * **Note:** This method doesn't set the \"length\" property of partially\n     * applied functions.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.2.0\n     * @category Function\n     * @param {Function} func The function to partially apply arguments to.\n     * @param {...*} [partials] The arguments to be partially applied.\n     * @returns {Function} Returns the new partially applied function.\n     * @example\n     *\n     * function greet(greeting, name) {\n     *   return greeting + ' ' + name;\n     * }\n     *\n     * var sayHelloTo = _.partial(greet, 'hello');\n     * sayHelloTo('fred');\n     * // => 'hello fred'\n     *\n     * // Partially applied with placeholders.\n     * var greetFred = _.partial(greet, _, 'fred');\n     * greetFred('hi');\n     * // => 'hi fred'\n     */\n    var partial = baseRest(function(func, partials) {\n      var holders = replaceHolders(partials, getHolder(partial));\n      return createWrap(func, WRAP_PARTIAL_FLAG, undefined, partials, holders);\n    });\n\n    /**\n     * This method is like `_.partial` except that partially applied arguments\n     * are appended to the arguments it receives.\n     *\n     * The `_.partialRight.placeholder` value, which defaults to `_` in monolithic\n     * builds, may be used as a placeholder for partially applied arguments.\n     *\n     * **Note:** This method doesn't set the \"length\" property of partially\n     * applied functions.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.0.0\n     * @category Function\n     * @param {Function} func The function to partially apply arguments to.\n     * @param {...*} [partials] The arguments to be partially applied.\n     * @returns {Function} Returns the new partially applied function.\n     * @example\n     *\n     * function greet(greeting, name) {\n     *   return greeting + ' ' + name;\n     * }\n     *\n     * var greetFred = _.partialRight(greet, 'fred');\n     * greetFred('hi');\n     * // => 'hi fred'\n     *\n     * // Partially applied with placeholders.\n     * var sayHelloTo = _.partialRight(greet, 'hello', _);\n     * sayHelloTo('fred');\n     * // => 'hello fred'\n     */\n    var partialRight = baseRest(function(func, partials) {\n      var holders = replaceHolders(partials, getHolder(partialRight));\n      return createWrap(func, WRAP_PARTIAL_RIGHT_FLAG, undefined, partials, holders);\n    });\n\n    /**\n     * Creates a function that invokes `func` with arguments arranged according\n     * to the specified `indexes` where the argument value at the first index is\n     * provided as the first argument, the argument value at the second index is\n     * provided as the second argument, and so on.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Function\n     * @param {Function} func The function to rearrange arguments for.\n     * @param {...(number|number[])} indexes The arranged argument indexes.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var rearged = _.rearg(function(a, b, c) {\n     *   return [a, b, c];\n     * }, [2, 0, 1]);\n     *\n     * rearged('b', 'c', 'a')\n     * // => ['a', 'b', 'c']\n     */\n    var rearg = flatRest(function(func, indexes) {\n      return createWrap(func, WRAP_REARG_FLAG, undefined, undefined, undefined, indexes);\n    });\n\n    /**\n     * Creates a function that invokes `func` with the `this` binding of the\n     * created function and arguments from `start` and beyond provided as\n     * an array.\n     *\n     * **Note:** This method is based on the\n     * [rest parameter](https://mdn.io/rest_parameters).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Function\n     * @param {Function} func The function to apply a rest parameter to.\n     * @param {number} [start=func.length-1] The start position of the rest parameter.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var say = _.rest(function(what, names) {\n     *   return what + ' ' + _.initial(names).join(', ') +\n     *     (_.size(names) > 1 ? ', & ' : '') + _.last(names);\n     * });\n     *\n     * say('hello', 'fred', 'barney', 'pebbles');\n     * // => 'hello fred, barney, & pebbles'\n     */\n    function rest(func, start) {\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      start = start === undefined ? start : toInteger(start);\n      return baseRest(func, start);\n    }\n\n    /**\n     * Creates a function that invokes `func` with the `this` binding of the\n     * create function and an array of arguments much like\n     * [`Function#apply`](http://www.ecma-international.org/ecma-262/7.0/#sec-function.prototype.apply).\n     *\n     * **Note:** This method is based on the\n     * [spread operator](https://mdn.io/spread_operator).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.2.0\n     * @category Function\n     * @param {Function} func The function to spread arguments over.\n     * @param {number} [start=0] The start position of the spread.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var say = _.spread(function(who, what) {\n     *   return who + ' says ' + what;\n     * });\n     *\n     * say(['fred', 'hello']);\n     * // => 'fred says hello'\n     *\n     * var numbers = Promise.all([\n     *   Promise.resolve(40),\n     *   Promise.resolve(36)\n     * ]);\n     *\n     * numbers.then(_.spread(function(x, y) {\n     *   return x + y;\n     * }));\n     * // => a Promise of 76\n     */\n    function spread(func, start) {\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      start = start == null ? 0 : nativeMax(toInteger(start), 0);\n      return baseRest(function(args) {\n        var array = args[start],\n            otherArgs = castSlice(args, 0, start);\n\n        if (array) {\n          arrayPush(otherArgs, array);\n        }\n        return apply(func, this, otherArgs);\n      });\n    }\n\n    /**\n     * Creates a throttled function that only invokes `func` at most once per\n     * every `wait` milliseconds. The throttled function comes with a `cancel`\n     * method to cancel delayed `func` invocations and a `flush` method to\n     * immediately invoke them. Provide `options` to indicate whether `func`\n     * should be invoked on the leading and/or trailing edge of the `wait`\n     * timeout. The `func` is invoked with the last arguments provided to the\n     * throttled function. Subsequent calls to the throttled function return the\n     * result of the last `func` invocation.\n     *\n     * **Note:** If `leading` and `trailing` options are `true`, `func` is\n     * invoked on the trailing edge of the timeout only if the throttled function\n     * is invoked more than once during the `wait` timeout.\n     *\n     * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n     * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n     *\n     * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n     * for details over the differences between `_.throttle` and `_.debounce`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to throttle.\n     * @param {number} [wait=0] The number of milliseconds to throttle invocations to.\n     * @param {Object} [options={}] The options object.\n     * @param {boolean} [options.leading=true]\n     *  Specify invoking on the leading edge of the timeout.\n     * @param {boolean} [options.trailing=true]\n     *  Specify invoking on the trailing edge of the timeout.\n     * @returns {Function} Returns the new throttled function.\n     * @example\n     *\n     * // Avoid excessively updating the position while scrolling.\n     * jQuery(window).on('scroll', _.throttle(updatePosition, 100));\n     *\n     * // Invoke `renewToken` when the click event is fired, but not more than once every 5 minutes.\n     * var throttled = _.throttle(renewToken, 300000, { 'trailing': false });\n     * jQuery(element).on('click', throttled);\n     *\n     * // Cancel the trailing throttled invocation.\n     * jQuery(window).on('popstate', throttled.cancel);\n     */\n    function throttle(func, wait, options) {\n      var leading = true,\n          trailing = true;\n\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      if (isObject(options)) {\n        leading = 'leading' in options ? !!options.leading : leading;\n        trailing = 'trailing' in options ? !!options.trailing : trailing;\n      }\n      return debounce(func, wait, {\n        'leading': leading,\n        'maxWait': wait,\n        'trailing': trailing\n      });\n    }\n\n    /**\n     * Creates a function that accepts up to one argument, ignoring any\n     * additional arguments.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Function\n     * @param {Function} func The function to cap arguments for.\n     * @returns {Function} Returns the new capped function.\n     * @example\n     *\n     * _.map(['6', '8', '10'], _.unary(parseInt));\n     * // => [6, 8, 10]\n     */\n    function unary(func) {\n      return ary(func, 1);\n    }\n\n    /**\n     * Creates a function that provides `value` to `wrapper` as its first\n     * argument. Any additional arguments provided to the function are appended\n     * to those provided to the `wrapper`. The wrapper is invoked with the `this`\n     * binding of the created function.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {*} value The value to wrap.\n     * @param {Function} [wrapper=identity] The wrapper function.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var p = _.wrap(_.escape, function(func, text) {\n     *   return '<p>' + func(text) + '</p>';\n     * });\n     *\n     * p('fred, barney, & pebbles');\n     * // => '<p>fred, barney, &amp; pebbles</p>'\n     */\n    function wrap(value, wrapper) {\n      return partial(castFunction(wrapper), value);\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Casts `value` as an array if it's not one.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.4.0\n     * @category Lang\n     * @param {*} value The value to inspect.\n     * @returns {Array} Returns the cast array.\n     * @example\n     *\n     * _.castArray(1);\n     * // => [1]\n     *\n     * _.castArray({ 'a': 1 });\n     * // => [{ 'a': 1 }]\n     *\n     * _.castArray('abc');\n     * // => ['abc']\n     *\n     * _.castArray(null);\n     * // => [null]\n     *\n     * _.castArray(undefined);\n     * // => [undefined]\n     *\n     * _.castArray();\n     * // => []\n     *\n     * var array = [1, 2, 3];\n     * console.log(_.castArray(array) === array);\n     * // => true\n     */\n    function castArray() {\n      if (!arguments.length) {\n        return [];\n      }\n      var value = arguments[0];\n      return isArray(value) ? value : [value];\n    }\n\n    /**\n     * Creates a shallow clone of `value`.\n     *\n     * **Note:** This method is loosely based on the\n     * [structured clone algorithm](https://mdn.io/Structured_clone_algorithm)\n     * and supports cloning arrays, array buffers, booleans, date objects, maps,\n     * numbers, `Object` objects, regexes, sets, strings, symbols, and typed\n     * arrays. The own enumerable properties of `arguments` objects are cloned\n     * as plain objects. An empty object is returned for uncloneable values such\n     * as error objects, functions, DOM nodes, and WeakMaps.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to clone.\n     * @returns {*} Returns the cloned value.\n     * @see _.cloneDeep\n     * @example\n     *\n     * var objects = [{ 'a': 1 }, { 'b': 2 }];\n     *\n     * var shallow = _.clone(objects);\n     * console.log(shallow[0] === objects[0]);\n     * // => true\n     */\n    function clone(value) {\n      return baseClone(value, CLONE_SYMBOLS_FLAG);\n    }\n\n    /**\n     * This method is like `_.clone` except that it accepts `customizer` which\n     * is invoked to produce the cloned value. If `customizer` returns `undefined`,\n     * cloning is handled by the method instead. The `customizer` is invoked with\n     * up to four arguments; (value [, index|key, object, stack]).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to clone.\n     * @param {Function} [customizer] The function to customize cloning.\n     * @returns {*} Returns the cloned value.\n     * @see _.cloneDeepWith\n     * @example\n     *\n     * function customizer(value) {\n     *   if (_.isElement(value)) {\n     *     return value.cloneNode(false);\n     *   }\n     * }\n     *\n     * var el = _.cloneWith(document.body, customizer);\n     *\n     * console.log(el === document.body);\n     * // => false\n     * console.log(el.nodeName);\n     * // => 'BODY'\n     * console.log(el.childNodes.length);\n     * // => 0\n     */\n    function cloneWith(value, customizer) {\n      customizer = typeof customizer == 'function' ? customizer : undefined;\n      return baseClone(value, CLONE_SYMBOLS_FLAG, customizer);\n    }\n\n    /**\n     * This method is like `_.clone` except that it recursively clones `value`.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.0.0\n     * @category Lang\n     * @param {*} value The value to recursively clone.\n     * @returns {*} Returns the deep cloned value.\n     * @see _.clone\n     * @example\n     *\n     * var objects = [{ 'a': 1 }, { 'b': 2 }];\n     *\n     * var deep = _.cloneDeep(objects);\n     * console.log(deep[0] === objects[0]);\n     * // => false\n     */\n    function cloneDeep(value) {\n      return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG);\n    }\n\n    /**\n     * This method is like `_.cloneWith` except that it recursively clones `value`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to recursively clone.\n     * @param {Function} [customizer] The function to customize cloning.\n     * @returns {*} Returns the deep cloned value.\n     * @see _.cloneWith\n     * @example\n     *\n     * function customizer(value) {\n     *   if (_.isElement(value)) {\n     *     return value.cloneNode(true);\n     *   }\n     * }\n     *\n     * var el = _.cloneDeepWith(document.body, customizer);\n     *\n     * console.log(el === document.body);\n     * // => false\n     * console.log(el.nodeName);\n     * // => 'BODY'\n     * console.log(el.childNodes.length);\n     * // => 20\n     */\n    function cloneDeepWith(value, customizer) {\n      customizer = typeof customizer == 'function' ? customizer : undefined;\n      return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG, customizer);\n    }\n\n    /**\n     * Checks if `object` conforms to `source` by invoking the predicate\n     * properties of `source` with the corresponding property values of `object`.\n     *\n     * **Note:** This method is equivalent to `_.conforms` when `source` is\n     * partially applied.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.14.0\n     * @category Lang\n     * @param {Object} object The object to inspect.\n     * @param {Object} source The object of property predicates to conform to.\n     * @returns {boolean} Returns `true` if `object` conforms, else `false`.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': 2 };\n     *\n     * _.conformsTo(object, { 'b': function(n) { return n > 1; } });\n     * // => true\n     *\n     * _.conformsTo(object, { 'b': function(n) { return n > 2; } });\n     * // => false\n     */\n    function conformsTo(object, source) {\n      return source == null || baseConformsTo(object, source, keys(source));\n    }\n\n    /**\n     * Performs a\n     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * comparison between two values to determine if they are equivalent.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n     * @example\n     *\n     * var object = { 'a': 1 };\n     * var other = { 'a': 1 };\n     *\n     * _.eq(object, object);\n     * // => true\n     *\n     * _.eq(object, other);\n     * // => false\n     *\n     * _.eq('a', 'a');\n     * // => true\n     *\n     * _.eq('a', Object('a'));\n     * // => false\n     *\n     * _.eq(NaN, NaN);\n     * // => true\n     */\n    function eq(value, other) {\n      return value === other || (value !== value && other !== other);\n    }\n\n    /**\n     * Checks if `value` is greater than `other`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.9.0\n     * @category Lang\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if `value` is greater than `other`,\n     *  else `false`.\n     * @see _.lt\n     * @example\n     *\n     * _.gt(3, 1);\n     * // => true\n     *\n     * _.gt(3, 3);\n     * // => false\n     *\n     * _.gt(1, 3);\n     * // => false\n     */\n    var gt = createRelationalOperation(baseGt);\n\n    /**\n     * Checks if `value` is greater than or equal to `other`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.9.0\n     * @category Lang\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if `value` is greater than or equal to\n     *  `other`, else `false`.\n     * @see _.lte\n     * @example\n     *\n     * _.gte(3, 1);\n     * // => true\n     *\n     * _.gte(3, 3);\n     * // => true\n     *\n     * _.gte(1, 3);\n     * // => false\n     */\n    var gte = createRelationalOperation(function(value, other) {\n      return value >= other;\n    });\n\n    /**\n     * Checks if `value` is likely an `arguments` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n     *  else `false`.\n     * @example\n     *\n     * _.isArguments(function() { return arguments; }());\n     * // => true\n     *\n     * _.isArguments([1, 2, 3]);\n     * // => false\n     */\n    var isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {\n      return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&\n        !propertyIsEnumerable.call(value, 'callee');\n    };\n\n    /**\n     * Checks if `value` is classified as an `Array` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n     * @example\n     *\n     * _.isArray([1, 2, 3]);\n     * // => true\n     *\n     * _.isArray(document.body.children);\n     * // => false\n     *\n     * _.isArray('abc');\n     * // => false\n     *\n     * _.isArray(_.noop);\n     * // => false\n     */\n    var isArray = Array.isArray;\n\n    /**\n     * Checks if `value` is classified as an `ArrayBuffer` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.3.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an array buffer, else `false`.\n     * @example\n     *\n     * _.isArrayBuffer(new ArrayBuffer(2));\n     * // => true\n     *\n     * _.isArrayBuffer(new Array(2));\n     * // => false\n     */\n    var isArrayBuffer = nodeIsArrayBuffer ? baseUnary(nodeIsArrayBuffer) : baseIsArrayBuffer;\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     */\n    function isArrayLike(value) {\n      return value != null && isLength(value.length) && !isFunction(value);\n    }\n\n    /**\n     * This method is like `_.isArrayLike` except that it also checks if `value`\n     * is an object.\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 an array-like object,\n     *  else `false`.\n     * @example\n     *\n     * _.isArrayLikeObject([1, 2, 3]);\n     * // => true\n     *\n     * _.isArrayLikeObject(document.body.children);\n     * // => true\n     *\n     * _.isArrayLikeObject('abc');\n     * // => false\n     *\n     * _.isArrayLikeObject(_.noop);\n     * // => false\n     */\n    function isArrayLikeObject(value) {\n      return isObjectLike(value) && isArrayLike(value);\n    }\n\n    /**\n     * Checks if `value` is classified as a boolean primitive or object.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a boolean, else `false`.\n     * @example\n     *\n     * _.isBoolean(false);\n     * // => true\n     *\n     * _.isBoolean(null);\n     * // => false\n     */\n    function isBoolean(value) {\n      return value === true || value === false ||\n        (isObjectLike(value) && baseGetTag(value) == boolTag);\n    }\n\n    /**\n     * Checks if `value` is a buffer.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.3.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n     * @example\n     *\n     * _.isBuffer(new Buffer(2));\n     * // => true\n     *\n     * _.isBuffer(new Uint8Array(2));\n     * // => false\n     */\n    var isBuffer = nativeIsBuffer || stubFalse;\n\n    /**\n     * Checks if `value` is classified as a `Date` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a date object, else `false`.\n     * @example\n     *\n     * _.isDate(new Date);\n     * // => true\n     *\n     * _.isDate('Mon April 23 2012');\n     * // => false\n     */\n    var isDate = nodeIsDate ? baseUnary(nodeIsDate) : baseIsDate;\n\n    /**\n     * Checks if `value` is likely a DOM element.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a DOM element, else `false`.\n     * @example\n     *\n     * _.isElement(document.body);\n     * // => true\n     *\n     * _.isElement('<body>');\n     * // => false\n     */\n    function isElement(value) {\n      return isObjectLike(value) && value.nodeType === 1 && !isPlainObject(value);\n    }\n\n    /**\n     * Checks if `value` is an empty object, collection, map, or set.\n     *\n     * Objects are considered empty if they have no own enumerable string keyed\n     * properties.\n     *\n     * Array-like values such as `arguments` objects, arrays, buffers, strings, or\n     * jQuery-like collections are considered empty if they have a `length` of `0`.\n     * Similarly, maps and sets are considered empty if they have a `size` of `0`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is empty, else `false`.\n     * @example\n     *\n     * _.isEmpty(null);\n     * // => true\n     *\n     * _.isEmpty(true);\n     * // => true\n     *\n     * _.isEmpty(1);\n     * // => true\n     *\n     * _.isEmpty([1, 2, 3]);\n     * // => false\n     *\n     * _.isEmpty({ 'a': 1 });\n     * // => false\n     */\n    function isEmpty(value) {\n      if (value == null) {\n        return true;\n      }\n      if (isArrayLike(value) &&\n          (isArray(value) || typeof value == 'string' || typeof value.splice == 'function' ||\n            isBuffer(value) || isTypedArray(value) || isArguments(value))) {\n        return !value.length;\n      }\n      var tag = getTag(value);\n      if (tag == mapTag || tag == setTag) {\n        return !value.size;\n      }\n      if (isPrototype(value)) {\n        return !baseKeys(value).length;\n      }\n      for (var key in value) {\n        if (hasOwnProperty.call(value, key)) {\n          return false;\n        }\n      }\n      return true;\n    }\n\n    /**\n     * Performs a deep comparison between two values to determine if they are\n     * equivalent.\n     *\n     * **Note:** This method supports comparing arrays, array buffers, booleans,\n     * date objects, error objects, maps, numbers, `Object` objects, regexes,\n     * sets, strings, symbols, and typed arrays. `Object` objects are compared\n     * by their own, not inherited, enumerable properties. Functions and DOM\n     * nodes are compared by strict equality, i.e. `===`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n     * @example\n     *\n     * var object = { 'a': 1 };\n     * var other = { 'a': 1 };\n     *\n     * _.isEqual(object, other);\n     * // => true\n     *\n     * object === other;\n     * // => false\n     */\n    function isEqual(value, other) {\n      return baseIsEqual(value, other);\n    }\n\n    /**\n     * This method is like `_.isEqual` except that it accepts `customizer` which\n     * is invoked to compare values. If `customizer` returns `undefined`, comparisons\n     * are handled by the method instead. The `customizer` is invoked with up to\n     * six arguments: (objValue, othValue [, index|key, object, other, stack]).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @param {Function} [customizer] The function to customize comparisons.\n     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n     * @example\n     *\n     * function isGreeting(value) {\n     *   return /^h(?:i|ello)$/.test(value);\n     * }\n     *\n     * function customizer(objValue, othValue) {\n     *   if (isGreeting(objValue) && isGreeting(othValue)) {\n     *     return true;\n     *   }\n     * }\n     *\n     * var array = ['hello', 'goodbye'];\n     * var other = ['hi', 'goodbye'];\n     *\n     * _.isEqualWith(array, other, customizer);\n     * // => true\n     */\n    function isEqualWith(value, other, customizer) {\n      customizer = typeof customizer == 'function' ? customizer : undefined;\n      var result = customizer ? customizer(value, other) : undefined;\n      return result === undefined ? baseIsEqual(value, other, undefined, customizer) : !!result;\n    }\n\n    /**\n     * Checks if `value` is an `Error`, `EvalError`, `RangeError`, `ReferenceError`,\n     * `SyntaxError`, `TypeError`, or `URIError` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an error object, else `false`.\n     * @example\n     *\n     * _.isError(new Error);\n     * // => true\n     *\n     * _.isError(Error);\n     * // => false\n     */\n    function isError(value) {\n      if (!isObjectLike(value)) {\n        return false;\n      }\n      var tag = baseGetTag(value);\n      return tag == errorTag || tag == domExcTag ||\n        (typeof value.message == 'string' && typeof value.name == 'string' && !isPlainObject(value));\n    }\n\n    /**\n     * Checks if `value` is a finite primitive number.\n     *\n     * **Note:** This method is based on\n     * [`Number.isFinite`](https://mdn.io/Number/isFinite).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a finite number, else `false`.\n     * @example\n     *\n     * _.isFinite(3);\n     * // => true\n     *\n     * _.isFinite(Number.MIN_VALUE);\n     * // => true\n     *\n     * _.isFinite(Infinity);\n     * // => false\n     *\n     * _.isFinite('3');\n     * // => false\n     */\n    function isFinite(value) {\n      return typeof value == 'number' && nativeIsFinite(value);\n    }\n\n    /**\n     * Checks if `value` is classified as a `Function` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n     * @example\n     *\n     * _.isFunction(_);\n     * // => true\n     *\n     * _.isFunction(/abc/);\n     * // => false\n     */\n    function isFunction(value) {\n      if (!isObject(value)) {\n        return false;\n      }\n      // The use of `Object#toString` avoids issues with the `typeof` operator\n      // in Safari 9 which returns 'object' for typed arrays and other constructors.\n      var tag = baseGetTag(value);\n      return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;\n    }\n\n    /**\n     * Checks if `value` is an integer.\n     *\n     * **Note:** This method is based on\n     * [`Number.isInteger`](https://mdn.io/Number/isInteger).\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 an integer, else `false`.\n     * @example\n     *\n     * _.isInteger(3);\n     * // => true\n     *\n     * _.isInteger(Number.MIN_VALUE);\n     * // => false\n     *\n     * _.isInteger(Infinity);\n     * // => false\n     *\n     * _.isInteger('3');\n     * // => false\n     */\n    function isInteger(value) {\n      return typeof value == 'number' && value == toInteger(value);\n    }\n\n    /**\n     * Checks if `value` is a valid array-like length.\n     *\n     * **Note:** This method is loosely based on\n     * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\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 a valid length, else `false`.\n     * @example\n     *\n     * _.isLength(3);\n     * // => true\n     *\n     * _.isLength(Number.MIN_VALUE);\n     * // => false\n     *\n     * _.isLength(Infinity);\n     * // => false\n     *\n     * _.isLength('3');\n     * // => false\n     */\n    function isLength(value) {\n      return typeof value == 'number' &&\n        value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n    }\n\n    /**\n     * Checks if `value` is the\n     * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n     * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n     * @example\n     *\n     * _.isObject({});\n     * // => true\n     *\n     * _.isObject([1, 2, 3]);\n     * // => true\n     *\n     * _.isObject(_.noop);\n     * // => true\n     *\n     * _.isObject(null);\n     * // => false\n     */\n    function isObject(value) {\n      var type = typeof value;\n      return value != null && (type == 'object' || type == 'function');\n    }\n\n    /**\n     * Checks if `value` is object-like. A value is object-like if it's not `null`\n     * and has a `typeof` result of \"object\".\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 object-like, else `false`.\n     * @example\n     *\n     * _.isObjectLike({});\n     * // => true\n     *\n     * _.isObjectLike([1, 2, 3]);\n     * // => true\n     *\n     * _.isObjectLike(_.noop);\n     * // => false\n     *\n     * _.isObjectLike(null);\n     * // => false\n     */\n    function isObjectLike(value) {\n      return value != null && typeof value == 'object';\n    }\n\n    /**\n     * Checks if `value` is classified as a `Map` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.3.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n     * @example\n     *\n     * _.isMap(new Map);\n     * // => true\n     *\n     * _.isMap(new WeakMap);\n     * // => false\n     */\n    var isMap = nodeIsMap ? baseUnary(nodeIsMap) : baseIsMap;\n\n    /**\n     * Performs a partial deep comparison between `object` and `source` to\n     * determine if `object` contains equivalent property values.\n     *\n     * **Note:** This method is equivalent to `_.matches` when `source` is\n     * partially applied.\n     *\n     * Partial comparisons will match empty array and empty object `source`\n     * values against any array or object value, respectively. See `_.isEqual`\n     * for a list of supported value comparisons.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Lang\n     * @param {Object} object The object to inspect.\n     * @param {Object} source The object of property values to match.\n     * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': 2 };\n     *\n     * _.isMatch(object, { 'b': 2 });\n     * // => true\n     *\n     * _.isMatch(object, { 'b': 1 });\n     * // => false\n     */\n    function isMatch(object, source) {\n      return object === source || baseIsMatch(object, source, getMatchData(source));\n    }\n\n    /**\n     * This method is like `_.isMatch` except that it accepts `customizer` which\n     * is invoked to compare values. If `customizer` returns `undefined`, comparisons\n     * are handled by the method instead. The `customizer` is invoked with five\n     * arguments: (objValue, srcValue, index|key, object, source).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {Object} object The object to inspect.\n     * @param {Object} source The object of property values to match.\n     * @param {Function} [customizer] The function to customize comparisons.\n     * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n     * @example\n     *\n     * function isGreeting(value) {\n     *   return /^h(?:i|ello)$/.test(value);\n     * }\n     *\n     * function customizer(objValue, srcValue) {\n     *   if (isGreeting(objValue) && isGreeting(srcValue)) {\n     *     return true;\n     *   }\n     * }\n     *\n     * var object = { 'greeting': 'hello' };\n     * var source = { 'greeting': 'hi' };\n     *\n     * _.isMatchWith(object, source, customizer);\n     * // => true\n     */\n    function isMatchWith(object, source, customizer) {\n      customizer = typeof customizer == 'function' ? customizer : undefined;\n      return baseIsMatch(object, source, getMatchData(source), customizer);\n    }\n\n    /**\n     * Checks if `value` is `NaN`.\n     *\n     * **Note:** This method is based on\n     * [`Number.isNaN`](https://mdn.io/Number/isNaN) and is not the same as\n     * global [`isNaN`](https://mdn.io/isNaN) which returns `true` for\n     * `undefined` and other non-number values.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n     * @example\n     *\n     * _.isNaN(NaN);\n     * // => true\n     *\n     * _.isNaN(new Number(NaN));\n     * // => true\n     *\n     * isNaN(undefined);\n     * // => true\n     *\n     * _.isNaN(undefined);\n     * // => false\n     */\n    function isNaN(value) {\n      // An `NaN` primitive is the only value that is not equal to itself.\n      // Perform the `toStringTag` check first to avoid errors with some\n      // ActiveX objects in IE.\n      return isNumber(value) && value != +value;\n    }\n\n    /**\n     * Checks if `value` is a pristine native function.\n     *\n     * **Note:** This method can't reliably detect native functions in the presence\n     * of the core-js package because core-js circumvents this kind of detection.\n     * Despite multiple requests, the core-js maintainer has made it clear: any\n     * attempt to fix the detection will be obstructed. As a result, we're left\n     * with little choice but to throw an error. Unfortunately, this also affects\n     * packages, like [babel-polyfill](https://www.npmjs.com/package/babel-polyfill),\n     * which rely on core-js.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a native function,\n     *  else `false`.\n     * @example\n     *\n     * _.isNative(Array.prototype.push);\n     * // => true\n     *\n     * _.isNative(_);\n     * // => false\n     */\n    function isNative(value) {\n      if (isMaskable(value)) {\n        throw new Error(CORE_ERROR_TEXT);\n      }\n      return baseIsNative(value);\n    }\n\n    /**\n     * Checks if `value` is `null`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is `null`, else `false`.\n     * @example\n     *\n     * _.isNull(null);\n     * // => true\n     *\n     * _.isNull(void 0);\n     * // => false\n     */\n    function isNull(value) {\n      return value === null;\n    }\n\n    /**\n     * Checks if `value` is `null` or `undefined`.\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 nullish, else `false`.\n     * @example\n     *\n     * _.isNil(null);\n     * // => true\n     *\n     * _.isNil(void 0);\n     * // => true\n     *\n     * _.isNil(NaN);\n     * // => false\n     */\n    function isNil(value) {\n      return value == null;\n    }\n\n    /**\n     * Checks if `value` is classified as a `Number` primitive or object.\n     *\n     * **Note:** To exclude `Infinity`, `-Infinity`, and `NaN`, which are\n     * classified as numbers, use the `_.isFinite` method.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a number, else `false`.\n     * @example\n     *\n     * _.isNumber(3);\n     * // => true\n     *\n     * _.isNumber(Number.MIN_VALUE);\n     * // => true\n     *\n     * _.isNumber(Infinity);\n     * // => true\n     *\n     * _.isNumber('3');\n     * // => false\n     */\n    function isNumber(value) {\n      return typeof value == 'number' ||\n        (isObjectLike(value) && baseGetTag(value) == numberTag);\n    }\n\n    /**\n     * Checks if `value` is a plain object, that is, an object created by the\n     * `Object` constructor or one with a `[[Prototype]]` of `null`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.8.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     * }\n     *\n     * _.isPlainObject(new Foo);\n     * // => false\n     *\n     * _.isPlainObject([1, 2, 3]);\n     * // => false\n     *\n     * _.isPlainObject({ 'x': 0, 'y': 0 });\n     * // => true\n     *\n     * _.isPlainObject(Object.create(null));\n     * // => true\n     */\n    function isPlainObject(value) {\n      if (!isObjectLike(value) || baseGetTag(value) != objectTag) {\n        return false;\n      }\n      var proto = getPrototype(value);\n      if (proto === null) {\n        return true;\n      }\n      var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor;\n      return typeof Ctor == 'function' && Ctor instanceof Ctor &&\n        funcToString.call(Ctor) == objectCtorString;\n    }\n\n    /**\n     * Checks if `value` is classified as a `RegExp` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a regexp, else `false`.\n     * @example\n     *\n     * _.isRegExp(/abc/);\n     * // => true\n     *\n     * _.isRegExp('/abc/');\n     * // => false\n     */\n    var isRegExp = nodeIsRegExp ? baseUnary(nodeIsRegExp) : baseIsRegExp;\n\n    /**\n     * Checks if `value` is a safe integer. An integer is safe if it's an IEEE-754\n     * double precision number which isn't the result of a rounded unsafe integer.\n     *\n     * **Note:** This method is based on\n     * [`Number.isSafeInteger`](https://mdn.io/Number/isSafeInteger).\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 a safe integer, else `false`.\n     * @example\n     *\n     * _.isSafeInteger(3);\n     * // => true\n     *\n     * _.isSafeInteger(Number.MIN_VALUE);\n     * // => false\n     *\n     * _.isSafeInteger(Infinity);\n     * // => false\n     *\n     * _.isSafeInteger('3');\n     * // => false\n     */\n    function isSafeInteger(value) {\n      return isInteger(value) && value >= -MAX_SAFE_INTEGER && value <= MAX_SAFE_INTEGER;\n    }\n\n    /**\n     * Checks if `value` is classified as a `Set` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.3.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n     * @example\n     *\n     * _.isSet(new Set);\n     * // => true\n     *\n     * _.isSet(new WeakSet);\n     * // => false\n     */\n    var isSet = nodeIsSet ? baseUnary(nodeIsSet) : baseIsSet;\n\n    /**\n     * Checks if `value` is classified as a `String` primitive or object.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a string, else `false`.\n     * @example\n     *\n     * _.isString('abc');\n     * // => true\n     *\n     * _.isString(1);\n     * // => false\n     */\n    function isString(value) {\n      return typeof value == 'string' ||\n        (!isArray(value) && isObjectLike(value) && baseGetTag(value) == stringTag);\n    }\n\n    /**\n     * Checks if `value` is classified as a `Symbol` primitive or object.\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 a symbol, else `false`.\n     * @example\n     *\n     * _.isSymbol(Symbol.iterator);\n     * // => true\n     *\n     * _.isSymbol('abc');\n     * // => false\n     */\n    function isSymbol(value) {\n      return typeof value == 'symbol' ||\n        (isObjectLike(value) && baseGetTag(value) == symbolTag);\n    }\n\n    /**\n     * Checks if `value` is classified as a typed array.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n     * @example\n     *\n     * _.isTypedArray(new Uint8Array);\n     * // => true\n     *\n     * _.isTypedArray([]);\n     * // => false\n     */\n    var isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\n\n    /**\n     * Checks if `value` is `undefined`.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is `undefined`, else `false`.\n     * @example\n     *\n     * _.isUndefined(void 0);\n     * // => true\n     *\n     * _.isUndefined(null);\n     * // => false\n     */\n    function isUndefined(value) {\n      return value === undefined;\n    }\n\n    /**\n     * Checks if `value` is classified as a `WeakMap` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.3.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a weak map, else `false`.\n     * @example\n     *\n     * _.isWeakMap(new WeakMap);\n     * // => true\n     *\n     * _.isWeakMap(new Map);\n     * // => false\n     */\n    function isWeakMap(value) {\n      return isObjectLike(value) && getTag(value) == weakMapTag;\n    }\n\n    /**\n     * Checks if `value` is classified as a `WeakSet` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.3.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a weak set, else `false`.\n     * @example\n     *\n     * _.isWeakSet(new WeakSet);\n     * // => true\n     *\n     * _.isWeakSet(new Set);\n     * // => false\n     */\n    function isWeakSet(value) {\n      return isObjectLike(value) && baseGetTag(value) == weakSetTag;\n    }\n\n    /**\n     * Checks if `value` is less than `other`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.9.0\n     * @category Lang\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if `value` is less than `other`,\n     *  else `false`.\n     * @see _.gt\n     * @example\n     *\n     * _.lt(1, 3);\n     * // => true\n     *\n     * _.lt(3, 3);\n     * // => false\n     *\n     * _.lt(3, 1);\n     * // => false\n     */\n    var lt = createRelationalOperation(baseLt);\n\n    /**\n     * Checks if `value` is less than or equal to `other`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.9.0\n     * @category Lang\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if `value` is less than or equal to\n     *  `other`, else `false`.\n     * @see _.gte\n     * @example\n     *\n     * _.lte(1, 3);\n     * // => true\n     *\n     * _.lte(3, 3);\n     * // => true\n     *\n     * _.lte(3, 1);\n     * // => false\n     */\n    var lte = createRelationalOperation(function(value, other) {\n      return value <= other;\n    });\n\n    /**\n     * Converts `value` to an array.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Lang\n     * @param {*} value The value to convert.\n     * @returns {Array} Returns the converted array.\n     * @example\n     *\n     * _.toArray({ 'a': 1, 'b': 2 });\n     * // => [1, 2]\n     *\n     * _.toArray('abc');\n     * // => ['a', 'b', 'c']\n     *\n     * _.toArray(1);\n     * // => []\n     *\n     * _.toArray(null);\n     * // => []\n     */\n    function toArray(value) {\n      if (!value) {\n        return [];\n      }\n      if (isArrayLike(value)) {\n        return isString(value) ? stringToArray(value) : copyArray(value);\n      }\n      if (symIterator && value[symIterator]) {\n        return iteratorToArray(value[symIterator]());\n      }\n      var tag = getTag(value),\n          func = tag == mapTag ? mapToArray : (tag == setTag ? setToArray : values);\n\n      return func(value);\n    }\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     */\n    function 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\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     */\n    function toInteger(value) {\n      var result = toFinite(value),\n          remainder = result % 1;\n\n      return result === result ? (remainder ? result - remainder : result) : 0;\n    }\n\n    /**\n     * Converts `value` to an integer suitable for use as the length of an\n     * array-like object.\n     *\n     * **Note:** This method is based on\n     * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\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     * _.toLength(3.2);\n     * // => 3\n     *\n     * _.toLength(Number.MIN_VALUE);\n     * // => 0\n     *\n     * _.toLength(Infinity);\n     * // => 4294967295\n     *\n     * _.toLength('3.2');\n     * // => 3\n     */\n    function toLength(value) {\n      return value ? baseClamp(toInteger(value), 0, MAX_ARRAY_LENGTH) : 0;\n    }\n\n    /**\n     * Converts `value` to a number.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to process.\n     * @returns {number} Returns the number.\n     * @example\n     *\n     * _.toNumber(3.2);\n     * // => 3.2\n     *\n     * _.toNumber(Number.MIN_VALUE);\n     * // => 5e-324\n     *\n     * _.toNumber(Infinity);\n     * // => Infinity\n     *\n     * _.toNumber('3.2');\n     * // => 3.2\n     */\n    function toNumber(value) {\n      if (typeof value == 'number') {\n        return value;\n      }\n      if (isSymbol(value)) {\n        return NAN;\n      }\n      if (isObject(value)) {\n        var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n        value = isObject(other) ? (other + '') : other;\n      }\n      if (typeof value != 'string') {\n        return value === 0 ? value : +value;\n      }\n      value = baseTrim(value);\n      var isBinary = reIsBinary.test(value);\n      return (isBinary || reIsOctal.test(value))\n        ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n        : (reIsBadHex.test(value) ? NAN : +value);\n    }\n\n    /**\n     * Converts `value` to a plain object flattening inherited enumerable string\n     * keyed properties of `value` to own properties of the plain object.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Lang\n     * @param {*} value The value to convert.\n     * @returns {Object} Returns the converted plain object.\n     * @example\n     *\n     * function Foo() {\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.assign({ 'a': 1 }, new Foo);\n     * // => { 'a': 1, 'b': 2 }\n     *\n     * _.assign({ 'a': 1 }, _.toPlainObject(new Foo));\n     * // => { 'a': 1, 'b': 2, 'c': 3 }\n     */\n    function toPlainObject(value) {\n      return copyObject(value, keysIn(value));\n    }\n\n    /**\n     * Converts `value` to a safe integer. A safe integer can be compared and\n     * represented correctly.\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     * _.toSafeInteger(3.2);\n     * // => 3\n     *\n     * _.toSafeInteger(Number.MIN_VALUE);\n     * // => 0\n     *\n     * _.toSafeInteger(Infinity);\n     * // => 9007199254740991\n     *\n     * _.toSafeInteger('3.2');\n     * // => 3\n     */\n    function toSafeInteger(value) {\n      return value\n        ? baseClamp(toInteger(value), -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER)\n        : (value === 0 ? value : 0);\n    }\n\n    /**\n     * Converts `value` to a string. An empty string is returned for `null`\n     * and `undefined` values. The sign of `-0` is preserved.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to convert.\n     * @returns {string} Returns the converted string.\n     * @example\n     *\n     * _.toString(null);\n     * // => ''\n     *\n     * _.toString(-0);\n     * // => '-0'\n     *\n     * _.toString([1, 2, 3]);\n     * // => '1,2,3'\n     */\n    function toString(value) {\n      return value == null ? '' : baseToString(value);\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Assigns own enumerable string keyed properties of source objects to the\n     * destination object. Source objects are applied from left to right.\n     * Subsequent sources overwrite property assignments of previous sources.\n     *\n     * **Note:** This method mutates `object` and is loosely based on\n     * [`Object.assign`](https://mdn.io/Object/assign).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.10.0\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} [sources] The source objects.\n     * @returns {Object} Returns `object`.\n     * @see _.assignIn\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     * }\n     *\n     * function Bar() {\n     *   this.c = 3;\n     * }\n     *\n     * Foo.prototype.b = 2;\n     * Bar.prototype.d = 4;\n     *\n     * _.assign({ 'a': 0 }, new Foo, new Bar);\n     * // => { 'a': 1, 'c': 3 }\n     */\n    var assign = createAssigner(function(object, source) {\n      if (isPrototype(source) || isArrayLike(source)) {\n        copyObject(source, keys(source), object);\n        return;\n      }\n      for (var key in source) {\n        if (hasOwnProperty.call(source, key)) {\n          assignValue(object, key, source[key]);\n        }\n      }\n    });\n\n    /**\n     * This method is like `_.assign` except that it iterates over own and\n     * inherited source properties.\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @alias extend\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} [sources] The source objects.\n     * @returns {Object} Returns `object`.\n     * @see _.assign\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     * }\n     *\n     * function Bar() {\n     *   this.c = 3;\n     * }\n     *\n     * Foo.prototype.b = 2;\n     * Bar.prototype.d = 4;\n     *\n     * _.assignIn({ 'a': 0 }, new Foo, new Bar);\n     * // => { 'a': 1, 'b': 2, 'c': 3, 'd': 4 }\n     */\n    var assignIn = createAssigner(function(object, source) {\n      copyObject(source, keysIn(source), object);\n    });\n\n    /**\n     * This method is like `_.assignIn` except that it accepts `customizer`\n     * which is invoked to produce the assigned values. If `customizer` returns\n     * `undefined`, assignment is handled by the method instead. The `customizer`\n     * is invoked with five arguments: (objValue, srcValue, key, object, source).\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @alias extendWith\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} sources The source objects.\n     * @param {Function} [customizer] The function to customize assigned values.\n     * @returns {Object} Returns `object`.\n     * @see _.assignWith\n     * @example\n     *\n     * function customizer(objValue, srcValue) {\n     *   return _.isUndefined(objValue) ? srcValue : objValue;\n     * }\n     *\n     * var defaults = _.partialRight(_.assignInWith, customizer);\n     *\n     * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n     * // => { 'a': 1, 'b': 2 }\n     */\n    var assignInWith = createAssigner(function(object, source, srcIndex, customizer) {\n      copyObject(source, keysIn(source), object, customizer);\n    });\n\n    /**\n     * This method is like `_.assign` except that it accepts `customizer`\n     * which is invoked to produce the assigned values. If `customizer` returns\n     * `undefined`, assignment is handled by the method instead. The `customizer`\n     * is invoked with five arguments: (objValue, srcValue, key, object, source).\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} sources The source objects.\n     * @param {Function} [customizer] The function to customize assigned values.\n     * @returns {Object} Returns `object`.\n     * @see _.assignInWith\n     * @example\n     *\n     * function customizer(objValue, srcValue) {\n     *   return _.isUndefined(objValue) ? srcValue : objValue;\n     * }\n     *\n     * var defaults = _.partialRight(_.assignWith, customizer);\n     *\n     * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n     * // => { 'a': 1, 'b': 2 }\n     */\n    var assignWith = createAssigner(function(object, source, srcIndex, customizer) {\n      copyObject(source, keys(source), object, customizer);\n    });\n\n    /**\n     * Creates an array of values corresponding to `paths` of `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.0.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {...(string|string[])} [paths] The property paths to pick.\n     * @returns {Array} Returns the picked values.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };\n     *\n     * _.at(object, ['a[0].b.c', 'a[1]']);\n     * // => [3, 4]\n     */\n    var at = flatRest(baseAt);\n\n    /**\n     * Creates an object that inherits from the `prototype` object. If a\n     * `properties` object is given, its own enumerable string keyed properties\n     * are assigned to the created object.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.3.0\n     * @category Object\n     * @param {Object} prototype The object to inherit from.\n     * @param {Object} [properties] The properties to assign to the object.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * function Shape() {\n     *   this.x = 0;\n     *   this.y = 0;\n     * }\n     *\n     * function Circle() {\n     *   Shape.call(this);\n     * }\n     *\n     * Circle.prototype = _.create(Shape.prototype, {\n     *   'constructor': Circle\n     * });\n     *\n     * var circle = new Circle;\n     * circle instanceof Circle;\n     * // => true\n     *\n     * circle instanceof Shape;\n     * // => true\n     */\n    function create(prototype, properties) {\n      var result = baseCreate(prototype);\n      return properties == null ? result : baseAssign(result, properties);\n    }\n\n    /**\n     * Assigns own and inherited enumerable string keyed properties of source\n     * objects to the destination object for all destination properties that\n     * resolve to `undefined`. Source objects are applied from left to right.\n     * Once a property is set, additional values of the same property are ignored.\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} [sources] The source objects.\n     * @returns {Object} Returns `object`.\n     * @see _.defaultsDeep\n     * @example\n     *\n     * _.defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n     * // => { 'a': 1, 'b': 2 }\n     */\n    var defaults = baseRest(function(object, sources) {\n      object = Object(object);\n\n      var index = -1;\n      var length = sources.length;\n      var guard = length > 2 ? sources[2] : undefined;\n\n      if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n        length = 1;\n      }\n\n      while (++index < length) {\n        var source = sources[index];\n        var props = keysIn(source);\n        var propsIndex = -1;\n        var propsLength = props.length;\n\n        while (++propsIndex < propsLength) {\n          var key = props[propsIndex];\n          var value = object[key];\n\n          if (value === undefined ||\n              (eq(value, objectProto[key]) && !hasOwnProperty.call(object, key))) {\n            object[key] = source[key];\n          }\n        }\n      }\n\n      return object;\n    });\n\n    /**\n     * This method is like `_.defaults` except that it recursively assigns\n     * default properties.\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.10.0\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} [sources] The source objects.\n     * @returns {Object} Returns `object`.\n     * @see _.defaults\n     * @example\n     *\n     * _.defaultsDeep({ 'a': { 'b': 2 } }, { 'a': { 'b': 1, 'c': 3 } });\n     * // => { 'a': { 'b': 2, 'c': 3 } }\n     */\n    var defaultsDeep = baseRest(function(args) {\n      args.push(undefined, customDefaultsMerge);\n      return apply(mergeWith, undefined, args);\n    });\n\n    /**\n     * This method is like `_.find` except that it returns the key of the first\n     * element `predicate` returns truthy for instead of the element itself.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.1.0\n     * @category Object\n     * @param {Object} object The object to inspect.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {string|undefined} Returns the key of the matched element,\n     *  else `undefined`.\n     * @example\n     *\n     * var users = {\n     *   'barney':  { 'age': 36, 'active': true },\n     *   'fred':    { 'age': 40, 'active': false },\n     *   'pebbles': { 'age': 1,  'active': true }\n     * };\n     *\n     * _.findKey(users, function(o) { return o.age < 40; });\n     * // => 'barney' (iteration order is not guaranteed)\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.findKey(users, { 'age': 1, 'active': true });\n     * // => 'pebbles'\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.findKey(users, ['active', false]);\n     * // => 'fred'\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.findKey(users, 'active');\n     * // => 'barney'\n     */\n    function findKey(object, predicate) {\n      return baseFindKey(object, getIteratee(predicate, 3), baseForOwn);\n    }\n\n    /**\n     * This method is like `_.findKey` except that it iterates over elements of\n     * a collection in the opposite order.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Object\n     * @param {Object} object The object to inspect.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {string|undefined} Returns the key of the matched element,\n     *  else `undefined`.\n     * @example\n     *\n     * var users = {\n     *   'barney':  { 'age': 36, 'active': true },\n     *   'fred':    { 'age': 40, 'active': false },\n     *   'pebbles': { 'age': 1,  'active': true }\n     * };\n     *\n     * _.findLastKey(users, function(o) { return o.age < 40; });\n     * // => returns 'pebbles' assuming `_.findKey` returns 'barney'\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.findLastKey(users, { 'age': 36, 'active': true });\n     * // => 'barney'\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.findLastKey(users, ['active', false]);\n     * // => 'fred'\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.findLastKey(users, 'active');\n     * // => 'pebbles'\n     */\n    function findLastKey(object, predicate) {\n      return baseFindKey(object, getIteratee(predicate, 3), baseForOwnRight);\n    }\n\n    /**\n     * Iterates over own and inherited enumerable string keyed properties of an\n     * object and invokes `iteratee` for each property. The iteratee is invoked\n     * with three arguments: (value, key, object). Iteratee functions may exit\n     * iteration early by explicitly returning `false`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.3.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Object} Returns `object`.\n     * @see _.forInRight\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.forIn(new Foo, function(value, key) {\n     *   console.log(key);\n     * });\n     * // => Logs 'a', 'b', then 'c' (iteration order is not guaranteed).\n     */\n    function forIn(object, iteratee) {\n      return object == null\n        ? object\n        : baseFor(object, getIteratee(iteratee, 3), keysIn);\n    }\n\n    /**\n     * This method is like `_.forIn` except that it iterates over properties of\n     * `object` in the opposite order.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Object} Returns `object`.\n     * @see _.forIn\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.forInRight(new Foo, function(value, key) {\n     *   console.log(key);\n     * });\n     * // => Logs 'c', 'b', then 'a' assuming `_.forIn` logs 'a', 'b', then 'c'.\n     */\n    function forInRight(object, iteratee) {\n      return object == null\n        ? object\n        : baseForRight(object, getIteratee(iteratee, 3), keysIn);\n    }\n\n    /**\n     * Iterates over own enumerable string keyed properties of an object and\n     * invokes `iteratee` for each property. The iteratee is invoked with three\n     * arguments: (value, key, object). Iteratee functions may exit iteration\n     * early by explicitly returning `false`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.3.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Object} Returns `object`.\n     * @see _.forOwnRight\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.forOwn(new Foo, function(value, key) {\n     *   console.log(key);\n     * });\n     * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n     */\n    function forOwn(object, iteratee) {\n      return object && baseForOwn(object, getIteratee(iteratee, 3));\n    }\n\n    /**\n     * This method is like `_.forOwn` except that it iterates over properties of\n     * `object` in the opposite order.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Object} Returns `object`.\n     * @see _.forOwn\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.forOwnRight(new Foo, function(value, key) {\n     *   console.log(key);\n     * });\n     * // => Logs 'b' then 'a' assuming `_.forOwn` logs 'a' then 'b'.\n     */\n    function forOwnRight(object, iteratee) {\n      return object && baseForOwnRight(object, getIteratee(iteratee, 3));\n    }\n\n    /**\n     * Creates an array of function property names from own enumerable properties\n     * of `object`.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Object\n     * @param {Object} object The object to inspect.\n     * @returns {Array} Returns the function names.\n     * @see _.functionsIn\n     * @example\n     *\n     * function Foo() {\n     *   this.a = _.constant('a');\n     *   this.b = _.constant('b');\n     * }\n     *\n     * Foo.prototype.c = _.constant('c');\n     *\n     * _.functions(new Foo);\n     * // => ['a', 'b']\n     */\n    function functions(object) {\n      return object == null ? [] : baseFunctions(object, keys(object));\n    }\n\n    /**\n     * Creates an array of function property names from own and inherited\n     * enumerable properties of `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The object to inspect.\n     * @returns {Array} Returns the function names.\n     * @see _.functions\n     * @example\n     *\n     * function Foo() {\n     *   this.a = _.constant('a');\n     *   this.b = _.constant('b');\n     * }\n     *\n     * Foo.prototype.c = _.constant('c');\n     *\n     * _.functionsIn(new Foo);\n     * // => ['a', 'b', 'c']\n     */\n    function functionsIn(object) {\n      return object == null ? [] : baseFunctions(object, keysIn(object));\n    }\n\n    /**\n     * Gets the value at `path` of `object`. If the resolved value is\n     * `undefined`, the `defaultValue` is returned in its place.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.7.0\n     * @category Object\n     * @param {Object} object The object to query.\n     * @param {Array|string} path The path of the property to get.\n     * @param {*} [defaultValue] The value returned for `undefined` resolved values.\n     * @returns {*} Returns the resolved value.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n     *\n     * _.get(object, 'a[0].b.c');\n     * // => 3\n     *\n     * _.get(object, ['a', '0', 'b', 'c']);\n     * // => 3\n     *\n     * _.get(object, 'a.b.c', 'default');\n     * // => 'default'\n     */\n    function get(object, path, defaultValue) {\n      var result = object == null ? undefined : baseGet(object, path);\n      return result === undefined ? defaultValue : result;\n    }\n\n    /**\n     * Checks if `path` is a direct property of `object`.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\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 = { 'a': { 'b': 2 } };\n     * var other = _.create({ 'a': _.create({ 'b': 2 }) });\n     *\n     * _.has(object, 'a');\n     * // => true\n     *\n     * _.has(object, 'a.b');\n     * // => true\n     *\n     * _.has(object, ['a', 'b']);\n     * // => true\n     *\n     * _.has(other, 'a');\n     * // => false\n     */\n    function has(object, path) {\n      return object != null && hasPath(object, path, baseHas);\n    }\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     */\n    function hasIn(object, path) {\n      return object != null && hasPath(object, path, baseHasIn);\n    }\n\n    /**\n     * Creates an object composed of the inverted keys and values of `object`.\n     * If `object` contains duplicate values, subsequent values overwrite\n     * property assignments of previous values.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.7.0\n     * @category Object\n     * @param {Object} object The object to invert.\n     * @returns {Object} Returns the new inverted object.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': 2, 'c': 1 };\n     *\n     * _.invert(object);\n     * // => { '1': 'c', '2': 'b' }\n     */\n    var invert = createInverter(function(result, value, key) {\n      if (value != null &&\n          typeof value.toString != 'function') {\n        value = nativeObjectToString.call(value);\n      }\n\n      result[value] = key;\n    }, constant(identity));\n\n    /**\n     * This method is like `_.invert` except that the inverted object is generated\n     * from the results of running each element of `object` thru `iteratee`. The\n     * corresponding inverted value of each inverted key is an array of keys\n     * responsible for generating the inverted value. The iteratee is invoked\n     * with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.1.0\n     * @category Object\n     * @param {Object} object The object to invert.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {Object} Returns the new inverted object.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': 2, 'c': 1 };\n     *\n     * _.invertBy(object);\n     * // => { '1': ['a', 'c'], '2': ['b'] }\n     *\n     * _.invertBy(object, function(value) {\n     *   return 'group' + value;\n     * });\n     * // => { 'group1': ['a', 'c'], 'group2': ['b'] }\n     */\n    var invertBy = createInverter(function(result, value, key) {\n      if (value != null &&\n          typeof value.toString != 'function') {\n        value = nativeObjectToString.call(value);\n      }\n\n      if (hasOwnProperty.call(result, value)) {\n        result[value].push(key);\n      } else {\n        result[value] = [key];\n      }\n    }, getIteratee);\n\n    /**\n     * Invokes the method at `path` 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 of the method to invoke.\n     * @param {...*} [args] The arguments to invoke the method with.\n     * @returns {*} Returns the result of the invoked method.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': [1, 2, 3, 4] } }] };\n     *\n     * _.invoke(object, 'a[0].b.c.slice', 1, 3);\n     * // => [2, 3]\n     */\n    var invoke = baseRest(baseInvoke);\n\n    /**\n     * Creates an array of the own enumerable property names of `object`.\n     *\n     * **Note:** Non-object values are coerced to objects. See the\n     * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n     * for more details.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Object\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property names.\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.keys(new Foo);\n     * // => ['a', 'b'] (iteration order is not guaranteed)\n     *\n     * _.keys('hi');\n     * // => ['0', '1']\n     */\n    function keys(object) {\n      return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n    }\n\n    /**\n     * Creates an array of the own and inherited enumerable property names of `object`.\n     *\n     * **Note:** Non-object values are coerced to objects.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Object\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property names.\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.keysIn(new Foo);\n     * // => ['a', 'b', 'c'] (iteration order is not guaranteed)\n     */\n    function keysIn(object) {\n      return isArrayLike(object) ? arrayLikeKeys(object, true) : baseKeysIn(object);\n    }\n\n    /**\n     * The opposite of `_.mapValues`; this method creates an object with the\n     * same values as `object` and keys generated by running each own enumerable\n     * string keyed property of `object` thru `iteratee`. The iteratee is invoked\n     * with three arguments: (value, key, object).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.8.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Object} Returns the new mapped object.\n     * @see _.mapValues\n     * @example\n     *\n     * _.mapKeys({ 'a': 1, 'b': 2 }, function(value, key) {\n     *   return key + value;\n     * });\n     * // => { 'a1': 1, 'b2': 2 }\n     */\n    function mapKeys(object, iteratee) {\n      var result = {};\n      iteratee = getIteratee(iteratee, 3);\n\n      baseForOwn(object, function(value, key, object) {\n        baseAssignValue(result, iteratee(value, key, object), value);\n      });\n      return result;\n    }\n\n    /**\n     * Creates an object with the same keys as `object` and values generated\n     * by running each own enumerable string keyed property of `object` thru\n     * `iteratee`. The iteratee is invoked with three arguments:\n     * (value, key, object).\n     *\n     * @static\n     * @memberOf _\n     * @since 2.4.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Object} Returns the new mapped object.\n     * @see _.mapKeys\n     * @example\n     *\n     * var users = {\n     *   'fred':    { 'user': 'fred',    'age': 40 },\n     *   'pebbles': { 'user': 'pebbles', 'age': 1 }\n     * };\n     *\n     * _.mapValues(users, function(o) { return o.age; });\n     * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.mapValues(users, 'age');\n     * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n     */\n    function mapValues(object, iteratee) {\n      var result = {};\n      iteratee = getIteratee(iteratee, 3);\n\n      baseForOwn(object, function(value, key, object) {\n        baseAssignValue(result, key, iteratee(value, key, object));\n      });\n      return result;\n    }\n\n    /**\n     * This method is like `_.assign` except that it recursively merges own and\n     * inherited enumerable string keyed properties of source objects into the\n     * destination object. Source properties that resolve to `undefined` are\n     * skipped if a destination value exists. Array and plain object properties\n     * are merged recursively. Other objects and value types are overridden by\n     * assignment. Source objects are applied from left to right. Subsequent\n     * sources overwrite property assignments of previous sources.\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.5.0\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} [sources] The source objects.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * var object = {\n     *   'a': [{ 'b': 2 }, { 'd': 4 }]\n     * };\n     *\n     * var other = {\n     *   'a': [{ 'c': 3 }, { 'e': 5 }]\n     * };\n     *\n     * _.merge(object, other);\n     * // => { 'a': [{ 'b': 2, 'c': 3 }, { 'd': 4, 'e': 5 }] }\n     */\n    var merge = createAssigner(function(object, source, srcIndex) {\n      baseMerge(object, source, srcIndex);\n    });\n\n    /**\n     * This method is like `_.merge` except that it accepts `customizer` which\n     * is invoked to produce the merged values of the destination and source\n     * properties. If `customizer` returns `undefined`, merging is handled by the\n     * method instead. The `customizer` is invoked with six arguments:\n     * (objValue, srcValue, key, object, source, stack).\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} sources The source objects.\n     * @param {Function} customizer The function to customize assigned values.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * function customizer(objValue, srcValue) {\n     *   if (_.isArray(objValue)) {\n     *     return objValue.concat(srcValue);\n     *   }\n     * }\n     *\n     * var object = { 'a': [1], 'b': [2] };\n     * var other = { 'a': [3], 'b': [4] };\n     *\n     * _.mergeWith(object, other, customizer);\n     * // => { 'a': [1, 3], 'b': [2, 4] }\n     */\n    var mergeWith = createAssigner(function(object, source, srcIndex, customizer) {\n      baseMerge(object, source, srcIndex, customizer);\n    });\n\n    /**\n     * The opposite of `_.pick`; this method creates an object composed of the\n     * own and inherited enumerable property paths of `object` that are not omitted.\n     *\n     * **Note:** This method is considerably slower than `_.pick`.\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 omit.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': '2', 'c': 3 };\n     *\n     * _.omit(object, ['a', 'c']);\n     * // => { 'b': '2' }\n     */\n    var omit = flatRest(function(object, paths) {\n      var result = {};\n      if (object == null) {\n        return result;\n      }\n      var isDeep = false;\n      paths = arrayMap(paths, function(path) {\n        path = castPath(path, object);\n        isDeep || (isDeep = path.length > 1);\n        return path;\n      });\n      copyObject(object, getAllKeysIn(object), result);\n      if (isDeep) {\n        result = baseClone(result, CLONE_DEEP_FLAG | CLONE_FLAT_FLAG | CLONE_SYMBOLS_FLAG, customOmitClone);\n      }\n      var length = paths.length;\n      while (length--) {\n        baseUnset(result, paths[length]);\n      }\n      return result;\n    });\n\n    /**\n     * The opposite of `_.pickBy`; this method creates an object composed of\n     * the own and inherited enumerable string keyed properties of `object` that\n     * `predicate` doesn't return truthy for. The predicate is invoked with two\n     * arguments: (value, key).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The source object.\n     * @param {Function} [predicate=_.identity] The function invoked per property.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': '2', 'c': 3 };\n     *\n     * _.omitBy(object, _.isNumber);\n     * // => { 'b': '2' }\n     */\n    function omitBy(object, predicate) {\n      return pickBy(object, negate(getIteratee(predicate)));\n    }\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     */\n    var pick = flatRest(function(object, paths) {\n      return object == null ? {} : basePick(object, paths);\n    });\n\n    /**\n     * Creates an object composed of the `object` properties `predicate` returns\n     * truthy for. The predicate is invoked with two arguments: (value, key).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The source object.\n     * @param {Function} [predicate=_.identity] The function invoked per property.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': '2', 'c': 3 };\n     *\n     * _.pickBy(object, _.isNumber);\n     * // => { 'a': 1, 'c': 3 }\n     */\n    function pickBy(object, predicate) {\n      if (object == null) {\n        return {};\n      }\n      var props = arrayMap(getAllKeysIn(object), function(prop) {\n        return [prop];\n      });\n      predicate = getIteratee(predicate);\n      return basePickBy(object, props, function(value, path) {\n        return predicate(value, path[0]);\n      });\n    }\n\n    /**\n     * This method is like `_.get` except that if the resolved value is a\n     * function it's invoked with the `this` binding of its parent object and\n     * its result is returned.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Object\n     * @param {Object} object The object to query.\n     * @param {Array|string} path The path of the property to resolve.\n     * @param {*} [defaultValue] The value returned for `undefined` resolved values.\n     * @returns {*} Returns the resolved value.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c1': 3, 'c2': _.constant(4) } }] };\n     *\n     * _.result(object, 'a[0].b.c1');\n     * // => 3\n     *\n     * _.result(object, 'a[0].b.c2');\n     * // => 4\n     *\n     * _.result(object, 'a[0].b.c3', 'default');\n     * // => 'default'\n     *\n     * _.result(object, 'a[0].b.c3', _.constant('default'));\n     * // => 'default'\n     */\n    function result(object, path, defaultValue) {\n      path = castPath(path, object);\n\n      var index = -1,\n          length = path.length;\n\n      // Ensure the loop is entered when path is empty.\n      if (!length) {\n        length = 1;\n        object = undefined;\n      }\n      while (++index < length) {\n        var value = object == null ? undefined : object[toKey(path[index])];\n        if (value === undefined) {\n          index = length;\n          value = defaultValue;\n        }\n        object = isFunction(value) ? value.call(object) : value;\n      }\n      return object;\n    }\n\n    /**\n     * Sets the value at `path` of `object`. If a portion of `path` doesn't exist,\n     * it's created. Arrays are created for missing index properties while objects\n     * are created for all other missing properties. Use `_.setWith` to customize\n     * `path` creation.\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.7.0\n     * @category Object\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     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n     *\n     * _.set(object, 'a[0].b.c', 4);\n     * console.log(object.a[0].b.c);\n     * // => 4\n     *\n     * _.set(object, ['x', '0', 'y', 'z'], 5);\n     * console.log(object.x[0].y.z);\n     * // => 5\n     */\n    function set(object, path, value) {\n      return object == null ? object : baseSet(object, path, value);\n    }\n\n    /**\n     * This method is like `_.set` except that it accepts `customizer` which is\n     * invoked to produce the objects of `path`.  If `customizer` returns `undefined`\n     * path creation is handled by the method instead. The `customizer` is invoked\n     * with three arguments: (nsValue, key, nsObject).\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\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 assigned values.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * var object = {};\n     *\n     * _.setWith(object, '[0][1]', 'a', Object);\n     * // => { '0': { '1': 'a' } }\n     */\n    function setWith(object, path, value, customizer) {\n      customizer = typeof customizer == 'function' ? customizer : undefined;\n      return object == null ? object : baseSet(object, path, value, customizer);\n    }\n\n    /**\n     * Creates an array of own enumerable string keyed-value pairs for `object`\n     * which can be consumed by `_.fromPairs`. If `object` is a map or set, its\n     * entries are returned.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @alias entries\n     * @category Object\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the key-value pairs.\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.toPairs(new Foo);\n     * // => [['a', 1], ['b', 2]] (iteration order is not guaranteed)\n     */\n    var toPairs = createToPairs(keys);\n\n    /**\n     * Creates an array of own and inherited enumerable string keyed-value pairs\n     * for `object` which can be consumed by `_.fromPairs`. If `object` is a map\n     * or set, its entries are returned.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @alias entriesIn\n     * @category Object\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the key-value pairs.\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.toPairsIn(new Foo);\n     * // => [['a', 1], ['b', 2], ['c', 3]] (iteration order is not guaranteed)\n     */\n    var toPairsIn = createToPairs(keysIn);\n\n    /**\n     * An alternative to `_.reduce`; this method transforms `object` to a new\n     * `accumulator` object which is the result of running each of its own\n     * enumerable string keyed properties thru `iteratee`, with each invocation\n     * potentially mutating the `accumulator` object. If `accumulator` is not\n     * provided, a new object with the same `[[Prototype]]` will be used. The\n     * iteratee is invoked with four arguments: (accumulator, value, key, object).\n     * Iteratee functions may exit iteration early by explicitly returning `false`.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.3.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @param {*} [accumulator] The custom accumulator value.\n     * @returns {*} Returns the accumulated value.\n     * @example\n     *\n     * _.transform([2, 3, 4], function(result, n) {\n     *   result.push(n *= n);\n     *   return n % 2 == 0;\n     * }, []);\n     * // => [4, 9]\n     *\n     * _.transform({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n     *   (result[value] || (result[value] = [])).push(key);\n     * }, {});\n     * // => { '1': ['a', 'c'], '2': ['b'] }\n     */\n    function transform(object, iteratee, accumulator) {\n      var isArr = isArray(object),\n          isArrLike = isArr || isBuffer(object) || isTypedArray(object);\n\n      iteratee = getIteratee(iteratee, 4);\n      if (accumulator == null) {\n        var Ctor = object && object.constructor;\n        if (isArrLike) {\n          accumulator = isArr ? new Ctor : [];\n        }\n        else if (isObject(object)) {\n          accumulator = isFunction(Ctor) ? baseCreate(getPrototype(object)) : {};\n        }\n        else {\n          accumulator = {};\n        }\n      }\n      (isArrLike ? arrayEach : baseForOwn)(object, function(value, index, object) {\n        return iteratee(accumulator, value, index, object);\n      });\n      return accumulator;\n    }\n\n    /**\n     * Removes the property at `path` of `object`.\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The object to modify.\n     * @param {Array|string} path The path of the property to unset.\n     * @returns {boolean} Returns `true` if the property is deleted, else `false`.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': 7 } }] };\n     * _.unset(object, 'a[0].b.c');\n     * // => true\n     *\n     * console.log(object);\n     * // => { 'a': [{ 'b': {} }] };\n     *\n     * _.unset(object, ['a', '0', 'b', 'c']);\n     * // => true\n     *\n     * console.log(object);\n     * // => { 'a': [{ 'b': {} }] };\n     */\n    function unset(object, path) {\n      return object == null ? true : baseUnset(object, path);\n    }\n\n    /**\n     * This method is like `_.set` except that accepts `updater` to produce the\n     * value to set. Use `_.updateWith` to customize `path` creation. The `updater`\n     * is invoked with one argument: (value).\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.6.0\n     * @category Object\n     * @param {Object} object The object to modify.\n     * @param {Array|string} path The path of the property to set.\n     * @param {Function} updater The function to produce the updated value.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n     *\n     * _.update(object, 'a[0].b.c', function(n) { return n * n; });\n     * console.log(object.a[0].b.c);\n     * // => 9\n     *\n     * _.update(object, 'x[0].y.z', function(n) { return n ? n + 1 : 0; });\n     * console.log(object.x[0].y.z);\n     * // => 0\n     */\n    function update(object, path, updater) {\n      return object == null ? object : baseUpdate(object, path, castFunction(updater));\n    }\n\n    /**\n     * This method is like `_.update` except that it accepts `customizer` which is\n     * invoked to produce the objects of `path`.  If `customizer` returns `undefined`\n     * path creation is handled by the method instead. The `customizer` is invoked\n     * with three arguments: (nsValue, key, nsObject).\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.6.0\n     * @category Object\n     * @param {Object} object The object to modify.\n     * @param {Array|string} path The path of the property to set.\n     * @param {Function} updater The function to produce the updated value.\n     * @param {Function} [customizer] The function to customize assigned values.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * var object = {};\n     *\n     * _.updateWith(object, '[0][1]', _.constant('a'), Object);\n     * // => { '0': { '1': 'a' } }\n     */\n    function updateWith(object, path, updater, customizer) {\n      customizer = typeof customizer == 'function' ? customizer : undefined;\n      return object == null ? object : baseUpdate(object, path, castFunction(updater), customizer);\n    }\n\n    /**\n     * Creates an array of the own enumerable string keyed property values of `object`.\n     *\n     * **Note:** Non-object values are coerced to objects.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Object\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property values.\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.values(new Foo);\n     * // => [1, 2] (iteration order is not guaranteed)\n     *\n     * _.values('hi');\n     * // => ['h', 'i']\n     */\n    function values(object) {\n      return object == null ? [] : baseValues(object, keys(object));\n    }\n\n    /**\n     * Creates an array of the own and inherited enumerable string keyed property\n     * values of `object`.\n     *\n     * **Note:** Non-object values are coerced to objects.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Object\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property values.\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.valuesIn(new Foo);\n     * // => [1, 2, 3] (iteration order is not guaranteed)\n     */\n    function valuesIn(object) {\n      return object == null ? [] : baseValues(object, keysIn(object));\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Clamps `number` within the inclusive `lower` and `upper` bounds.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Number\n     * @param {number} number The number to clamp.\n     * @param {number} [lower] The lower bound.\n     * @param {number} upper The upper bound.\n     * @returns {number} Returns the clamped number.\n     * @example\n     *\n     * _.clamp(-10, -5, 5);\n     * // => -5\n     *\n     * _.clamp(10, -5, 5);\n     * // => 5\n     */\n    function clamp(number, lower, upper) {\n      if (upper === undefined) {\n        upper = lower;\n        lower = undefined;\n      }\n      if (upper !== undefined) {\n        upper = toNumber(upper);\n        upper = upper === upper ? upper : 0;\n      }\n      if (lower !== undefined) {\n        lower = toNumber(lower);\n        lower = lower === lower ? lower : 0;\n      }\n      return baseClamp(toNumber(number), lower, upper);\n    }\n\n    /**\n     * Checks if `n` is between `start` and up to, but not including, `end`. If\n     * `end` is not specified, it's set to `start` with `start` then set to `0`.\n     * If `start` is greater than `end` the params are swapped to support\n     * negative ranges.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.3.0\n     * @category Number\n     * @param {number} number The number to check.\n     * @param {number} [start=0] The start of the range.\n     * @param {number} end The end of the range.\n     * @returns {boolean} Returns `true` if `number` is in the range, else `false`.\n     * @see _.range, _.rangeRight\n     * @example\n     *\n     * _.inRange(3, 2, 4);\n     * // => true\n     *\n     * _.inRange(4, 8);\n     * // => true\n     *\n     * _.inRange(4, 2);\n     * // => false\n     *\n     * _.inRange(2, 2);\n     * // => false\n     *\n     * _.inRange(1.2, 2);\n     * // => true\n     *\n     * _.inRange(5.2, 4);\n     * // => false\n     *\n     * _.inRange(-3, -2, -6);\n     * // => true\n     */\n    function inRange(number, start, end) {\n      start = toFinite(start);\n      if (end === undefined) {\n        end = start;\n        start = 0;\n      } else {\n        end = toFinite(end);\n      }\n      number = toNumber(number);\n      return baseInRange(number, start, end);\n    }\n\n    /**\n     * Produces a random number between the inclusive `lower` and `upper` bounds.\n     * If only one argument is provided a number between `0` and the given number\n     * is returned. If `floating` is `true`, or either `lower` or `upper` are\n     * floats, a floating-point number is returned instead of an integer.\n     *\n     * **Note:** JavaScript follows the IEEE-754 standard for resolving\n     * floating-point values which can produce unexpected results.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.7.0\n     * @category Number\n     * @param {number} [lower=0] The lower bound.\n     * @param {number} [upper=1] The upper bound.\n     * @param {boolean} [floating] Specify returning a floating-point number.\n     * @returns {number} Returns the random number.\n     * @example\n     *\n     * _.random(0, 5);\n     * // => an integer between 0 and 5\n     *\n     * _.random(5);\n     * // => also an integer between 0 and 5\n     *\n     * _.random(5, true);\n     * // => a floating-point number between 0 and 5\n     *\n     * _.random(1.2, 5.2);\n     * // => a floating-point number between 1.2 and 5.2\n     */\n    function random(lower, upper, floating) {\n      if (floating && typeof floating != 'boolean' && isIterateeCall(lower, upper, floating)) {\n        upper = floating = undefined;\n      }\n      if (floating === undefined) {\n        if (typeof upper == 'boolean') {\n          floating = upper;\n          upper = undefined;\n        }\n        else if (typeof lower == 'boolean') {\n          floating = lower;\n          lower = undefined;\n        }\n      }\n      if (lower === undefined && upper === undefined) {\n        lower = 0;\n        upper = 1;\n      }\n      else {\n        lower = toFinite(lower);\n        if (upper === undefined) {\n          upper = lower;\n          lower = 0;\n        } else {\n          upper = toFinite(upper);\n        }\n      }\n      if (lower > upper) {\n        var temp = lower;\n        lower = upper;\n        upper = temp;\n      }\n      if (floating || lower % 1 || upper % 1) {\n        var rand = nativeRandom();\n        return nativeMin(lower + (rand * (upper - lower + freeParseFloat('1e-' + ((rand + '').length - 1)))), upper);\n      }\n      return baseRandom(lower, upper);\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Converts `string` to [camel case](https://en.wikipedia.org/wiki/CamelCase).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the camel cased string.\n     * @example\n     *\n     * _.camelCase('Foo Bar');\n     * // => 'fooBar'\n     *\n     * _.camelCase('--foo-bar--');\n     * // => 'fooBar'\n     *\n     * _.camelCase('__FOO_BAR__');\n     * // => 'fooBar'\n     */\n    var camelCase = createCompounder(function(result, word, index) {\n      word = word.toLowerCase();\n      return result + (index ? capitalize(word) : word);\n    });\n\n    /**\n     * Converts the first character of `string` to upper case and the remaining\n     * to lower case.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to capitalize.\n     * @returns {string} Returns the capitalized string.\n     * @example\n     *\n     * _.capitalize('FRED');\n     * // => 'Fred'\n     */\n    function capitalize(string) {\n      return upperFirst(toString(string).toLowerCase());\n    }\n\n    /**\n     * Deburrs `string` by converting\n     * [Latin-1 Supplement](https://en.wikipedia.org/wiki/Latin-1_Supplement_(Unicode_block)#Character_table)\n     * and [Latin Extended-A](https://en.wikipedia.org/wiki/Latin_Extended-A)\n     * letters to basic Latin letters and removing\n     * [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to deburr.\n     * @returns {string} Returns the deburred string.\n     * @example\n     *\n     * _.deburr('déjà vu');\n     * // => 'deja vu'\n     */\n    function deburr(string) {\n      string = toString(string);\n      return string && string.replace(reLatin, deburrLetter).replace(reComboMark, '');\n    }\n\n    /**\n     * Checks if `string` ends with the given target string.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to inspect.\n     * @param {string} [target] The string to search for.\n     * @param {number} [position=string.length] The position to search up to.\n     * @returns {boolean} Returns `true` if `string` ends with `target`,\n     *  else `false`.\n     * @example\n     *\n     * _.endsWith('abc', 'c');\n     * // => true\n     *\n     * _.endsWith('abc', 'b');\n     * // => false\n     *\n     * _.endsWith('abc', 'b', 2);\n     * // => true\n     */\n    function endsWith(string, target, position) {\n      string = toString(string);\n      target = baseToString(target);\n\n      var length = string.length;\n      position = position === undefined\n        ? length\n        : baseClamp(toInteger(position), 0, length);\n\n      var end = position;\n      position -= target.length;\n      return position >= 0 && string.slice(position, end) == target;\n    }\n\n    /**\n     * Converts the characters \"&\", \"<\", \">\", '\"', and \"'\" in `string` to their\n     * corresponding HTML entities.\n     *\n     * **Note:** No other characters are escaped. To escape additional\n     * characters use a third-party library like [_he_](https://mths.be/he).\n     *\n     * Though the \">\" character is escaped for symmetry, characters like\n     * \">\" and \"/\" don't need escaping in HTML and have no special meaning\n     * unless they're part of a tag or unquoted attribute value. See\n     * [Mathias Bynens's article](https://mathiasbynens.be/notes/ambiguous-ampersands)\n     * (under \"semi-related fun fact\") for more details.\n     *\n     * When working with HTML you should always\n     * [quote attribute values](http://wonko.com/post/html-escaping) to reduce\n     * XSS vectors.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category String\n     * @param {string} [string=''] The string to escape.\n     * @returns {string} Returns the escaped string.\n     * @example\n     *\n     * _.escape('fred, barney, & pebbles');\n     * // => 'fred, barney, &amp; pebbles'\n     */\n    function escape(string) {\n      string = toString(string);\n      return (string && reHasUnescapedHtml.test(string))\n        ? string.replace(reUnescapedHtml, escapeHtmlChar)\n        : string;\n    }\n\n    /**\n     * Escapes the `RegExp` special characters \"^\", \"$\", \"\\\", \".\", \"*\", \"+\",\n     * \"?\", \"(\", \")\", \"[\", \"]\", \"{\", \"}\", and \"|\" in `string`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to escape.\n     * @returns {string} Returns the escaped string.\n     * @example\n     *\n     * _.escapeRegExp('[lodash](https://lodash.com/)');\n     * // => '\\[lodash\\]\\(https://lodash\\.com/\\)'\n     */\n    function escapeRegExp(string) {\n      string = toString(string);\n      return (string && reHasRegExpChar.test(string))\n        ? string.replace(reRegExpChar, '\\\\$&')\n        : string;\n    }\n\n    /**\n     * Converts `string` to\n     * [kebab case](https://en.wikipedia.org/wiki/Letter_case#Special_case_styles).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the kebab cased string.\n     * @example\n     *\n     * _.kebabCase('Foo Bar');\n     * // => 'foo-bar'\n     *\n     * _.kebabCase('fooBar');\n     * // => 'foo-bar'\n     *\n     * _.kebabCase('__FOO_BAR__');\n     * // => 'foo-bar'\n     */\n    var kebabCase = createCompounder(function(result, word, index) {\n      return result + (index ? '-' : '') + word.toLowerCase();\n    });\n\n    /**\n     * Converts `string`, as space separated words, to lower case.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the lower cased string.\n     * @example\n     *\n     * _.lowerCase('--Foo-Bar--');\n     * // => 'foo bar'\n     *\n     * _.lowerCase('fooBar');\n     * // => 'foo bar'\n     *\n     * _.lowerCase('__FOO_BAR__');\n     * // => 'foo bar'\n     */\n    var lowerCase = createCompounder(function(result, word, index) {\n      return result + (index ? ' ' : '') + word.toLowerCase();\n    });\n\n    /**\n     * Converts the first character of `string` to lower case.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the converted string.\n     * @example\n     *\n     * _.lowerFirst('Fred');\n     * // => 'fred'\n     *\n     * _.lowerFirst('FRED');\n     * // => 'fRED'\n     */\n    var lowerFirst = createCaseFirst('toLowerCase');\n\n    /**\n     * Pads `string` on the left and right sides if it's shorter than `length`.\n     * Padding characters are truncated if they can't be evenly divided by `length`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to pad.\n     * @param {number} [length=0] The padding length.\n     * @param {string} [chars=' '] The string used as padding.\n     * @returns {string} Returns the padded string.\n     * @example\n     *\n     * _.pad('abc', 8);\n     * // => '  abc   '\n     *\n     * _.pad('abc', 8, '_-');\n     * // => '_-abc_-_'\n     *\n     * _.pad('abc', 3);\n     * // => 'abc'\n     */\n    function pad(string, length, chars) {\n      string = toString(string);\n      length = toInteger(length);\n\n      var strLength = length ? stringSize(string) : 0;\n      if (!length || strLength >= length) {\n        return string;\n      }\n      var mid = (length - strLength) / 2;\n      return (\n        createPadding(nativeFloor(mid), chars) +\n        string +\n        createPadding(nativeCeil(mid), chars)\n      );\n    }\n\n    /**\n     * Pads `string` on the right side if it's shorter than `length`. Padding\n     * characters are truncated if they exceed `length`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to pad.\n     * @param {number} [length=0] The padding length.\n     * @param {string} [chars=' '] The string used as padding.\n     * @returns {string} Returns the padded string.\n     * @example\n     *\n     * _.padEnd('abc', 6);\n     * // => 'abc   '\n     *\n     * _.padEnd('abc', 6, '_-');\n     * // => 'abc_-_'\n     *\n     * _.padEnd('abc', 3);\n     * // => 'abc'\n     */\n    function padEnd(string, length, chars) {\n      string = toString(string);\n      length = toInteger(length);\n\n      var strLength = length ? stringSize(string) : 0;\n      return (length && strLength < length)\n        ? (string + createPadding(length - strLength, chars))\n        : string;\n    }\n\n    /**\n     * Pads `string` on the left side if it's shorter than `length`. Padding\n     * characters are truncated if they exceed `length`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to pad.\n     * @param {number} [length=0] The padding length.\n     * @param {string} [chars=' '] The string used as padding.\n     * @returns {string} Returns the padded string.\n     * @example\n     *\n     * _.padStart('abc', 6);\n     * // => '   abc'\n     *\n     * _.padStart('abc', 6, '_-');\n     * // => '_-_abc'\n     *\n     * _.padStart('abc', 3);\n     * // => 'abc'\n     */\n    function padStart(string, length, chars) {\n      string = toString(string);\n      length = toInteger(length);\n\n      var strLength = length ? stringSize(string) : 0;\n      return (length && strLength < length)\n        ? (createPadding(length - strLength, chars) + string)\n        : string;\n    }\n\n    /**\n     * Converts `string` to an integer of the specified radix. If `radix` is\n     * `undefined` or `0`, a `radix` of `10` is used unless `value` is a\n     * hexadecimal, in which case a `radix` of `16` is used.\n     *\n     * **Note:** This method aligns with the\n     * [ES5 implementation](https://es5.github.io/#x15.1.2.2) of `parseInt`.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.1.0\n     * @category String\n     * @param {string} string The string to convert.\n     * @param {number} [radix=10] The radix to interpret `value` by.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {number} Returns the converted integer.\n     * @example\n     *\n     * _.parseInt('08');\n     * // => 8\n     *\n     * _.map(['6', '08', '10'], _.parseInt);\n     * // => [6, 8, 10]\n     */\n    function parseInt(string, radix, guard) {\n      if (guard || radix == null) {\n        radix = 0;\n      } else if (radix) {\n        radix = +radix;\n      }\n      return nativeParseInt(toString(string).replace(reTrimStart, ''), radix || 0);\n    }\n\n    /**\n     * Repeats the given string `n` times.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to repeat.\n     * @param {number} [n=1] The number of times to repeat the string.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {string} Returns the repeated string.\n     * @example\n     *\n     * _.repeat('*', 3);\n     * // => '***'\n     *\n     * _.repeat('abc', 2);\n     * // => 'abcabc'\n     *\n     * _.repeat('abc', 0);\n     * // => ''\n     */\n    function repeat(string, n, guard) {\n      if ((guard ? isIterateeCall(string, n, guard) : n === undefined)) {\n        n = 1;\n      } else {\n        n = toInteger(n);\n      }\n      return baseRepeat(toString(string), n);\n    }\n\n    /**\n     * Replaces matches for `pattern` in `string` with `replacement`.\n     *\n     * **Note:** This method is based on\n     * [`String#replace`](https://mdn.io/String/replace).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to modify.\n     * @param {RegExp|string} pattern The pattern to replace.\n     * @param {Function|string} replacement The match replacement.\n     * @returns {string} Returns the modified string.\n     * @example\n     *\n     * _.replace('Hi Fred', 'Fred', 'Barney');\n     * // => 'Hi Barney'\n     */\n    function replace() {\n      var args = arguments,\n          string = toString(args[0]);\n\n      return args.length < 3 ? string : string.replace(args[1], args[2]);\n    }\n\n    /**\n     * Converts `string` to\n     * [snake case](https://en.wikipedia.org/wiki/Snake_case).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the snake cased string.\n     * @example\n     *\n     * _.snakeCase('Foo Bar');\n     * // => 'foo_bar'\n     *\n     * _.snakeCase('fooBar');\n     * // => 'foo_bar'\n     *\n     * _.snakeCase('--FOO-BAR--');\n     * // => 'foo_bar'\n     */\n    var snakeCase = createCompounder(function(result, word, index) {\n      return result + (index ? '_' : '') + word.toLowerCase();\n    });\n\n    /**\n     * Splits `string` by `separator`.\n     *\n     * **Note:** This method is based on\n     * [`String#split`](https://mdn.io/String/split).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to split.\n     * @param {RegExp|string} separator The separator pattern to split by.\n     * @param {number} [limit] The length to truncate results to.\n     * @returns {Array} Returns the string segments.\n     * @example\n     *\n     * _.split('a-b-c', '-', 2);\n     * // => ['a', 'b']\n     */\n    function split(string, separator, limit) {\n      if (limit && typeof limit != 'number' && isIterateeCall(string, separator, limit)) {\n        separator = limit = undefined;\n      }\n      limit = limit === undefined ? MAX_ARRAY_LENGTH : limit >>> 0;\n      if (!limit) {\n        return [];\n      }\n      string = toString(string);\n      if (string && (\n            typeof separator == 'string' ||\n            (separator != null && !isRegExp(separator))\n          )) {\n        separator = baseToString(separator);\n        if (!separator && hasUnicode(string)) {\n          return castSlice(stringToArray(string), 0, limit);\n        }\n      }\n      return string.split(separator, limit);\n    }\n\n    /**\n     * Converts `string` to\n     * [start case](https://en.wikipedia.org/wiki/Letter_case#Stylistic_or_specialised_usage).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.1.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the start cased string.\n     * @example\n     *\n     * _.startCase('--foo-bar--');\n     * // => 'Foo Bar'\n     *\n     * _.startCase('fooBar');\n     * // => 'Foo Bar'\n     *\n     * _.startCase('__FOO_BAR__');\n     * // => 'FOO BAR'\n     */\n    var startCase = createCompounder(function(result, word, index) {\n      return result + (index ? ' ' : '') + upperFirst(word);\n    });\n\n    /**\n     * Checks if `string` starts with the given target string.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to inspect.\n     * @param {string} [target] The string to search for.\n     * @param {number} [position=0] The position to search from.\n     * @returns {boolean} Returns `true` if `string` starts with `target`,\n     *  else `false`.\n     * @example\n     *\n     * _.startsWith('abc', 'a');\n     * // => true\n     *\n     * _.startsWith('abc', 'b');\n     * // => false\n     *\n     * _.startsWith('abc', 'b', 1);\n     * // => true\n     */\n    function startsWith(string, target, position) {\n      string = toString(string);\n      position = position == null\n        ? 0\n        : baseClamp(toInteger(position), 0, string.length);\n\n      target = baseToString(target);\n      return string.slice(position, position + target.length) == target;\n    }\n\n    /**\n     * Creates a compiled template function that can interpolate data properties\n     * in \"interpolate\" delimiters, HTML-escape interpolated data properties in\n     * \"escape\" delimiters, and execute JavaScript in \"evaluate\" delimiters. Data\n     * properties may be accessed as free variables in the template. If a setting\n     * object is given, it takes precedence over `_.templateSettings` values.\n     *\n     * **Note:** In the development build `_.template` utilizes\n     * [sourceURLs](http://www.html5rocks.com/en/tutorials/developertools/sourcemaps/#toc-sourceurl)\n     * for easier debugging.\n     *\n     * For more information on precompiling templates see\n     * [lodash's custom builds documentation](https://lodash.com/custom-builds).\n     *\n     * For more information on Chrome extension sandboxes see\n     * [Chrome's extensions documentation](https://developer.chrome.com/extensions/sandboxingEval).\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category String\n     * @param {string} [string=''] The template string.\n     * @param {Object} [options={}] The options object.\n     * @param {RegExp} [options.escape=_.templateSettings.escape]\n     *  The HTML \"escape\" delimiter.\n     * @param {RegExp} [options.evaluate=_.templateSettings.evaluate]\n     *  The \"evaluate\" delimiter.\n     * @param {Object} [options.imports=_.templateSettings.imports]\n     *  An object to import into the template as free variables.\n     * @param {RegExp} [options.interpolate=_.templateSettings.interpolate]\n     *  The \"interpolate\" delimiter.\n     * @param {string} [options.sourceURL='lodash.templateSources[n]']\n     *  The sourceURL of the compiled template.\n     * @param {string} [options.variable='obj']\n     *  The data object variable name.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Function} Returns the compiled template function.\n     * @example\n     *\n     * // Use the \"interpolate\" delimiter to create a compiled template.\n     * var compiled = _.template('hello <%= user %>!');\n     * compiled({ 'user': 'fred' });\n     * // => 'hello fred!'\n     *\n     * // Use the HTML \"escape\" delimiter to escape data property values.\n     * var compiled = _.template('<b><%- value %></b>');\n     * compiled({ 'value': '<script>' });\n     * // => '<b>&lt;script&gt;</b>'\n     *\n     * // Use the \"evaluate\" delimiter to execute JavaScript and generate HTML.\n     * var compiled = _.template('<% _.forEach(users, function(user) { %><li><%- user %></li><% }); %>');\n     * compiled({ 'users': ['fred', 'barney'] });\n     * // => '<li>fred</li><li>barney</li>'\n     *\n     * // Use the internal `print` function in \"evaluate\" delimiters.\n     * var compiled = _.template('<% print(\"hello \" + user); %>!');\n     * compiled({ 'user': 'barney' });\n     * // => 'hello barney!'\n     *\n     * // Use the ES template literal delimiter as an \"interpolate\" delimiter.\n     * // Disable support by replacing the \"interpolate\" delimiter.\n     * var compiled = _.template('hello ${ user }!');\n     * compiled({ 'user': 'pebbles' });\n     * // => 'hello pebbles!'\n     *\n     * // Use backslashes to treat delimiters as plain text.\n     * var compiled = _.template('<%= \"\\\\<%- value %\\\\>\" %>');\n     * compiled({ 'value': 'ignored' });\n     * // => '<%- value %>'\n     *\n     * // Use the `imports` option to import `jQuery` as `jq`.\n     * var text = '<% jq.each(users, function(user) { %><li><%- user %></li><% }); %>';\n     * var compiled = _.template(text, { 'imports': { 'jq': jQuery } });\n     * compiled({ 'users': ['fred', 'barney'] });\n     * // => '<li>fred</li><li>barney</li>'\n     *\n     * // Use the `sourceURL` option to specify a custom sourceURL for the template.\n     * var compiled = _.template('hello <%= user %>!', { 'sourceURL': '/basic/greeting.jst' });\n     * compiled(data);\n     * // => Find the source of \"greeting.jst\" under the Sources tab or Resources panel of the web inspector.\n     *\n     * // Use the `variable` option to ensure a with-statement isn't used in the compiled template.\n     * var compiled = _.template('hi <%= data.user %>!', { 'variable': 'data' });\n     * compiled.source;\n     * // => function(data) {\n     * //   var __t, __p = '';\n     * //   __p += 'hi ' + ((__t = ( data.user )) == null ? '' : __t) + '!';\n     * //   return __p;\n     * // }\n     *\n     * // Use custom template delimiters.\n     * _.templateSettings.interpolate = /{{([\\s\\S]+?)}}/g;\n     * var compiled = _.template('hello {{ user }}!');\n     * compiled({ 'user': 'mustache' });\n     * // => 'hello mustache!'\n     *\n     * // Use the `source` property to inline compiled templates for meaningful\n     * // line numbers in error messages and stack traces.\n     * fs.writeFileSync(path.join(process.cwd(), 'jst.js'), '\\\n     *   var JST = {\\\n     *     \"main\": ' + _.template(mainText).source + '\\\n     *   };\\\n     * ');\n     */\n    function template(string, options, guard) {\n      // Based on John Resig's `tmpl` implementation\n      // (http://ejohn.org/blog/javascript-micro-templating/)\n      // and Laura Doktorova's doT.js (https://github.com/olado/doT).\n      var settings = lodash.templateSettings;\n\n      if (guard && isIterateeCall(string, options, guard)) {\n        options = undefined;\n      }\n      string = toString(string);\n      options = assignInWith({}, options, settings, customDefaultsAssignIn);\n\n      var imports = assignInWith({}, options.imports, settings.imports, customDefaultsAssignIn),\n          importsKeys = keys(imports),\n          importsValues = baseValues(imports, importsKeys);\n\n      var isEscaping,\n          isEvaluating,\n          index = 0,\n          interpolate = options.interpolate || reNoMatch,\n          source = \"__p += '\";\n\n      // Compile the regexp to match each delimiter.\n      var reDelimiters = RegExp(\n        (options.escape || reNoMatch).source + '|' +\n        interpolate.source + '|' +\n        (interpolate === reInterpolate ? reEsTemplate : reNoMatch).source + '|' +\n        (options.evaluate || reNoMatch).source + '|$'\n      , 'g');\n\n      // Use a sourceURL for easier debugging.\n      // The sourceURL gets injected into the source that's eval-ed, so be careful\n      // to normalize all kinds of whitespace, so e.g. newlines (and unicode versions of it) can't sneak in\n      // and escape the comment, thus injecting code that gets evaled.\n      var sourceURL = '//# sourceURL=' +\n        (hasOwnProperty.call(options, 'sourceURL')\n          ? (options.sourceURL + '').replace(/\\s/g, ' ')\n          : ('lodash.templateSources[' + (++templateCounter) + ']')\n        ) + '\\n';\n\n      string.replace(reDelimiters, function(match, escapeValue, interpolateValue, esTemplateValue, evaluateValue, offset) {\n        interpolateValue || (interpolateValue = esTemplateValue);\n\n        // Escape characters that can't be included in string literals.\n        source += string.slice(index, offset).replace(reUnescapedString, escapeStringChar);\n\n        // Replace delimiters with snippets.\n        if (escapeValue) {\n          isEscaping = true;\n          source += \"' +\\n__e(\" + escapeValue + \") +\\n'\";\n        }\n        if (evaluateValue) {\n          isEvaluating = true;\n          source += \"';\\n\" + evaluateValue + \";\\n__p += '\";\n        }\n        if (interpolateValue) {\n          source += \"' +\\n((__t = (\" + interpolateValue + \")) == null ? '' : __t) +\\n'\";\n        }\n        index = offset + match.length;\n\n        // The JS engine embedded in Adobe products needs `match` returned in\n        // order to produce the correct `offset` value.\n        return match;\n      });\n\n      source += \"';\\n\";\n\n      // If `variable` is not specified wrap a with-statement around the generated\n      // code to add the data object to the top of the scope chain.\n      var variable = hasOwnProperty.call(options, 'variable') && options.variable;\n      if (!variable) {\n        source = 'with (obj) {\\n' + source + '\\n}\\n';\n      }\n      // Throw an error if a forbidden character was found in `variable`, to prevent\n      // potential command injection attacks.\n      else if (reForbiddenIdentifierChars.test(variable)) {\n        throw new Error(INVALID_TEMPL_VAR_ERROR_TEXT);\n      }\n\n      // Cleanup code by stripping empty strings.\n      source = (isEvaluating ? source.replace(reEmptyStringLeading, '') : source)\n        .replace(reEmptyStringMiddle, '$1')\n        .replace(reEmptyStringTrailing, '$1;');\n\n      // Frame code as the function body.\n      source = 'function(' + (variable || 'obj') + ') {\\n' +\n        (variable\n          ? ''\n          : 'obj || (obj = {});\\n'\n        ) +\n        \"var __t, __p = ''\" +\n        (isEscaping\n           ? ', __e = _.escape'\n           : ''\n        ) +\n        (isEvaluating\n          ? ', __j = Array.prototype.join;\\n' +\n            \"function print() { __p += __j.call(arguments, '') }\\n\"\n          : ';\\n'\n        ) +\n        source +\n        'return __p\\n}';\n\n      var result = attempt(function() {\n        return Function(importsKeys, sourceURL + 'return ' + source)\n          .apply(undefined, importsValues);\n      });\n\n      // Provide the compiled function's source by its `toString` method or\n      // the `source` property as a convenience for inlining compiled templates.\n      result.source = source;\n      if (isError(result)) {\n        throw result;\n      }\n      return result;\n    }\n\n    /**\n     * Converts `string`, as a whole, to lower case just like\n     * [String#toLowerCase](https://mdn.io/toLowerCase).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the lower cased string.\n     * @example\n     *\n     * _.toLower('--Foo-Bar--');\n     * // => '--foo-bar--'\n     *\n     * _.toLower('fooBar');\n     * // => 'foobar'\n     *\n     * _.toLower('__FOO_BAR__');\n     * // => '__foo_bar__'\n     */\n    function toLower(value) {\n      return toString(value).toLowerCase();\n    }\n\n    /**\n     * Converts `string`, as a whole, to upper case just like\n     * [String#toUpperCase](https://mdn.io/toUpperCase).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the upper cased string.\n     * @example\n     *\n     * _.toUpper('--foo-bar--');\n     * // => '--FOO-BAR--'\n     *\n     * _.toUpper('fooBar');\n     * // => 'FOOBAR'\n     *\n     * _.toUpper('__foo_bar__');\n     * // => '__FOO_BAR__'\n     */\n    function toUpper(value) {\n      return toString(value).toUpperCase();\n    }\n\n    /**\n     * Removes leading and trailing whitespace or specified characters from `string`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to trim.\n     * @param {string} [chars=whitespace] The characters to trim.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {string} Returns the trimmed string.\n     * @example\n     *\n     * _.trim('  abc  ');\n     * // => 'abc'\n     *\n     * _.trim('-_-abc-_-', '_-');\n     * // => 'abc'\n     *\n     * _.map(['  foo  ', '  bar  '], _.trim);\n     * // => ['foo', 'bar']\n     */\n    function trim(string, chars, guard) {\n      string = toString(string);\n      if (string && (guard || chars === undefined)) {\n        return baseTrim(string);\n      }\n      if (!string || !(chars = baseToString(chars))) {\n        return string;\n      }\n      var strSymbols = stringToArray(string),\n          chrSymbols = stringToArray(chars),\n          start = charsStartIndex(strSymbols, chrSymbols),\n          end = charsEndIndex(strSymbols, chrSymbols) + 1;\n\n      return castSlice(strSymbols, start, end).join('');\n    }\n\n    /**\n     * Removes trailing whitespace or specified characters from `string`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to trim.\n     * @param {string} [chars=whitespace] The characters to trim.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {string} Returns the trimmed string.\n     * @example\n     *\n     * _.trimEnd('  abc  ');\n     * // => '  abc'\n     *\n     * _.trimEnd('-_-abc-_-', '_-');\n     * // => '-_-abc'\n     */\n    function trimEnd(string, chars, guard) {\n      string = toString(string);\n      if (string && (guard || chars === undefined)) {\n        return string.slice(0, trimmedEndIndex(string) + 1);\n      }\n      if (!string || !(chars = baseToString(chars))) {\n        return string;\n      }\n      var strSymbols = stringToArray(string),\n          end = charsEndIndex(strSymbols, stringToArray(chars)) + 1;\n\n      return castSlice(strSymbols, 0, end).join('');\n    }\n\n    /**\n     * Removes leading whitespace or specified characters from `string`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to trim.\n     * @param {string} [chars=whitespace] The characters to trim.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {string} Returns the trimmed string.\n     * @example\n     *\n     * _.trimStart('  abc  ');\n     * // => 'abc  '\n     *\n     * _.trimStart('-_-abc-_-', '_-');\n     * // => 'abc-_-'\n     */\n    function trimStart(string, chars, guard) {\n      string = toString(string);\n      if (string && (guard || chars === undefined)) {\n        return string.replace(reTrimStart, '');\n      }\n      if (!string || !(chars = baseToString(chars))) {\n        return string;\n      }\n      var strSymbols = stringToArray(string),\n          start = charsStartIndex(strSymbols, stringToArray(chars));\n\n      return castSlice(strSymbols, start).join('');\n    }\n\n    /**\n     * Truncates `string` if it's longer than the given maximum string length.\n     * The last characters of the truncated string are replaced with the omission\n     * string which defaults to \"...\".\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to truncate.\n     * @param {Object} [options={}] The options object.\n     * @param {number} [options.length=30] The maximum string length.\n     * @param {string} [options.omission='...'] The string to indicate text is omitted.\n     * @param {RegExp|string} [options.separator] The separator pattern to truncate to.\n     * @returns {string} Returns the truncated string.\n     * @example\n     *\n     * _.truncate('hi-diddly-ho there, neighborino');\n     * // => 'hi-diddly-ho there, neighbo...'\n     *\n     * _.truncate('hi-diddly-ho there, neighborino', {\n     *   'length': 24,\n     *   'separator': ' '\n     * });\n     * // => 'hi-diddly-ho there,...'\n     *\n     * _.truncate('hi-diddly-ho there, neighborino', {\n     *   'length': 24,\n     *   'separator': /,? +/\n     * });\n     * // => 'hi-diddly-ho there...'\n     *\n     * _.truncate('hi-diddly-ho there, neighborino', {\n     *   'omission': ' [...]'\n     * });\n     * // => 'hi-diddly-ho there, neig [...]'\n     */\n    function truncate(string, options) {\n      var length = DEFAULT_TRUNC_LENGTH,\n          omission = DEFAULT_TRUNC_OMISSION;\n\n      if (isObject(options)) {\n        var separator = 'separator' in options ? options.separator : separator;\n        length = 'length' in options ? toInteger(options.length) : length;\n        omission = 'omission' in options ? baseToString(options.omission) : omission;\n      }\n      string = toString(string);\n\n      var strLength = string.length;\n      if (hasUnicode(string)) {\n        var strSymbols = stringToArray(string);\n        strLength = strSymbols.length;\n      }\n      if (length >= strLength) {\n        return string;\n      }\n      var end = length - stringSize(omission);\n      if (end < 1) {\n        return omission;\n      }\n      var result = strSymbols\n        ? castSlice(strSymbols, 0, end).join('')\n        : string.slice(0, end);\n\n      if (separator === undefined) {\n        return result + omission;\n      }\n      if (strSymbols) {\n        end += (result.length - end);\n      }\n      if (isRegExp(separator)) {\n        if (string.slice(end).search(separator)) {\n          var match,\n              substring = result;\n\n          if (!separator.global) {\n            separator = RegExp(separator.source, toString(reFlags.exec(separator)) + 'g');\n          }\n          separator.lastIndex = 0;\n          while ((match = separator.exec(substring))) {\n            var newEnd = match.index;\n          }\n          result = result.slice(0, newEnd === undefined ? end : newEnd);\n        }\n      } else if (string.indexOf(baseToString(separator), end) != end) {\n        var index = result.lastIndexOf(separator);\n        if (index > -1) {\n          result = result.slice(0, index);\n        }\n      }\n      return result + omission;\n    }\n\n    /**\n     * The inverse of `_.escape`; this method converts the HTML entities\n     * `&amp;`, `&lt;`, `&gt;`, `&quot;`, and `&#39;` in `string` to\n     * their corresponding characters.\n     *\n     * **Note:** No other HTML entities are unescaped. To unescape additional\n     * HTML entities use a third-party library like [_he_](https://mths.be/he).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.6.0\n     * @category String\n     * @param {string} [string=''] The string to unescape.\n     * @returns {string} Returns the unescaped string.\n     * @example\n     *\n     * _.unescape('fred, barney, &amp; pebbles');\n     * // => 'fred, barney, & pebbles'\n     */\n    function unescape(string) {\n      string = toString(string);\n      return (string && reHasEscapedHtml.test(string))\n        ? string.replace(reEscapedHtml, unescapeHtmlChar)\n        : string;\n    }\n\n    /**\n     * Converts `string`, as space separated words, to upper case.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the upper cased string.\n     * @example\n     *\n     * _.upperCase('--foo-bar');\n     * // => 'FOO BAR'\n     *\n     * _.upperCase('fooBar');\n     * // => 'FOO BAR'\n     *\n     * _.upperCase('__foo_bar__');\n     * // => 'FOO BAR'\n     */\n    var upperCase = createCompounder(function(result, word, index) {\n      return result + (index ? ' ' : '') + word.toUpperCase();\n    });\n\n    /**\n     * Converts the first character of `string` to upper case.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the converted string.\n     * @example\n     *\n     * _.upperFirst('fred');\n     * // => 'Fred'\n     *\n     * _.upperFirst('FRED');\n     * // => 'FRED'\n     */\n    var upperFirst = createCaseFirst('toUpperCase');\n\n    /**\n     * Splits `string` into an array of its words.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to inspect.\n     * @param {RegExp|string} [pattern] The pattern to match words.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Array} Returns the words of `string`.\n     * @example\n     *\n     * _.words('fred, barney, & pebbles');\n     * // => ['fred', 'barney', 'pebbles']\n     *\n     * _.words('fred, barney, & pebbles', /[^, ]+/g);\n     * // => ['fred', 'barney', '&', 'pebbles']\n     */\n    function words(string, pattern, guard) {\n      string = toString(string);\n      pattern = guard ? undefined : pattern;\n\n      if (pattern === undefined) {\n        return hasUnicodeWord(string) ? unicodeWords(string) : asciiWords(string);\n      }\n      return string.match(pattern) || [];\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Attempts to invoke `func`, returning either the result or the caught error\n     * object. Any additional arguments are provided to `func` when it's invoked.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Util\n     * @param {Function} func The function to attempt.\n     * @param {...*} [args] The arguments to invoke `func` with.\n     * @returns {*} Returns the `func` result or error object.\n     * @example\n     *\n     * // Avoid throwing errors for invalid selectors.\n     * var elements = _.attempt(function(selector) {\n     *   return document.querySelectorAll(selector);\n     * }, '>_>');\n     *\n     * if (_.isError(elements)) {\n     *   elements = [];\n     * }\n     */\n    var attempt = baseRest(function(func, args) {\n      try {\n        return apply(func, undefined, args);\n      } catch (e) {\n        return isError(e) ? e : new Error(e);\n      }\n    });\n\n    /**\n     * Binds methods of an object to the object itself, overwriting the existing\n     * method.\n     *\n     * **Note:** This method doesn't set the \"length\" property of bound functions.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {Object} object The object to bind and assign the bound methods to.\n     * @param {...(string|string[])} methodNames The object method names to bind.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * var view = {\n     *   'label': 'docs',\n     *   'click': function() {\n     *     console.log('clicked ' + this.label);\n     *   }\n     * };\n     *\n     * _.bindAll(view, ['click']);\n     * jQuery(element).on('click', view.click);\n     * // => Logs 'clicked docs' when clicked.\n     */\n    var bindAll = flatRest(function(object, methodNames) {\n      arrayEach(methodNames, function(key) {\n        key = toKey(key);\n        baseAssignValue(object, key, bind(object[key], object));\n      });\n      return object;\n    });\n\n    /**\n     * Creates a function that iterates over `pairs` and invokes the corresponding\n     * function of the first predicate to return truthy. The predicate-function\n     * pairs are invoked with the `this` binding and arguments of the created\n     * function.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {Array} pairs The predicate-function pairs.\n     * @returns {Function} Returns the new composite function.\n     * @example\n     *\n     * var func = _.cond([\n     *   [_.matches({ 'a': 1 }),           _.constant('matches A')],\n     *   [_.conforms({ 'b': _.isNumber }), _.constant('matches B')],\n     *   [_.stubTrue,                      _.constant('no match')]\n     * ]);\n     *\n     * func({ 'a': 1, 'b': 2 });\n     * // => 'matches A'\n     *\n     * func({ 'a': 0, 'b': 1 });\n     * // => 'matches B'\n     *\n     * func({ 'a': '1', 'b': '2' });\n     * // => 'no match'\n     */\n    function cond(pairs) {\n      var length = pairs == null ? 0 : pairs.length,\n          toIteratee = getIteratee();\n\n      pairs = !length ? [] : arrayMap(pairs, function(pair) {\n        if (typeof pair[1] != 'function') {\n          throw new TypeError(FUNC_ERROR_TEXT);\n        }\n        return [toIteratee(pair[0]), pair[1]];\n      });\n\n      return baseRest(function(args) {\n        var index = -1;\n        while (++index < length) {\n          var pair = pairs[index];\n          if (apply(pair[0], this, args)) {\n            return apply(pair[1], this, args);\n          }\n        }\n      });\n    }\n\n    /**\n     * Creates a function that invokes the predicate properties of `source` with\n     * the corresponding property values of a given object, returning `true` if\n     * all predicates return truthy, else `false`.\n     *\n     * **Note:** The created function is equivalent to `_.conformsTo` with\n     * `source` partially applied.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {Object} source The object of property predicates to conform to.\n     * @returns {Function} Returns the new spec function.\n     * @example\n     *\n     * var objects = [\n     *   { 'a': 2, 'b': 1 },\n     *   { 'a': 1, 'b': 2 }\n     * ];\n     *\n     * _.filter(objects, _.conforms({ 'b': function(n) { return n > 1; } }));\n     * // => [{ 'a': 1, 'b': 2 }]\n     */\n    function conforms(source) {\n      return baseConforms(baseClone(source, CLONE_DEEP_FLAG));\n    }\n\n    /**\n     * Creates a function that returns `value`.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.4.0\n     * @category Util\n     * @param {*} value The value to return from the new function.\n     * @returns {Function} Returns the new constant function.\n     * @example\n     *\n     * var objects = _.times(2, _.constant({ 'a': 1 }));\n     *\n     * console.log(objects);\n     * // => [{ 'a': 1 }, { 'a': 1 }]\n     *\n     * console.log(objects[0] === objects[1]);\n     * // => true\n     */\n    function constant(value) {\n      return function() {\n        return value;\n      };\n    }\n\n    /**\n     * Checks `value` to determine whether a default value should be returned in\n     * its place. The `defaultValue` is returned if `value` is `NaN`, `null`,\n     * or `undefined`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.14.0\n     * @category Util\n     * @param {*} value The value to check.\n     * @param {*} defaultValue The default value.\n     * @returns {*} Returns the resolved value.\n     * @example\n     *\n     * _.defaultTo(1, 10);\n     * // => 1\n     *\n     * _.defaultTo(undefined, 10);\n     * // => 10\n     */\n    function defaultTo(value, defaultValue) {\n      return (value == null || value !== value) ? defaultValue : value;\n    }\n\n    /**\n     * Creates a function that returns the result of invoking the given functions\n     * with the `this` binding of the created function, where each successive\n     * invocation is supplied the return value of the previous.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Util\n     * @param {...(Function|Function[])} [funcs] The functions to invoke.\n     * @returns {Function} Returns the new composite function.\n     * @see _.flowRight\n     * @example\n     *\n     * function square(n) {\n     *   return n * n;\n     * }\n     *\n     * var addSquare = _.flow([_.add, square]);\n     * addSquare(1, 2);\n     * // => 9\n     */\n    var flow = createFlow();\n\n    /**\n     * This method is like `_.flow` except that it creates a function that\n     * invokes the given functions from right to left.\n     *\n     * @static\n     * @since 3.0.0\n     * @memberOf _\n     * @category Util\n     * @param {...(Function|Function[])} [funcs] The functions to invoke.\n     * @returns {Function} Returns the new composite function.\n     * @see _.flow\n     * @example\n     *\n     * function square(n) {\n     *   return n * n;\n     * }\n     *\n     * var addSquare = _.flowRight([square, _.add]);\n     * addSquare(1, 2);\n     * // => 9\n     */\n    var flowRight = createFlow(true);\n\n    /**\n     * This method returns the first argument it receives.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {*} value Any value.\n     * @returns {*} Returns `value`.\n     * @example\n     *\n     * var object = { 'a': 1 };\n     *\n     * console.log(_.identity(object) === object);\n     * // => true\n     */\n    function identity(value) {\n      return value;\n    }\n\n    /**\n     * Creates a function that invokes `func` with the arguments of the created\n     * function. If `func` is a property name, the created function returns the\n     * property value for a given element. If `func` is an array or object, the\n     * created function returns `true` for elements that contain the equivalent\n     * source properties, otherwise it returns `false`.\n     *\n     * @static\n     * @since 4.0.0\n     * @memberOf _\n     * @category Util\n     * @param {*} [func=_.identity] The value to convert to a callback.\n     * @returns {Function} Returns the callback.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney', 'age': 36, 'active': true },\n     *   { 'user': 'fred',   'age': 40, 'active': false }\n     * ];\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.filter(users, _.iteratee({ 'user': 'barney', 'active': true }));\n     * // => [{ 'user': 'barney', 'age': 36, 'active': true }]\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.filter(users, _.iteratee(['user', 'fred']));\n     * // => [{ 'user': 'fred', 'age': 40 }]\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.map(users, _.iteratee('user'));\n     * // => ['barney', 'fred']\n     *\n     * // Create custom iteratee shorthands.\n     * _.iteratee = _.wrap(_.iteratee, function(iteratee, func) {\n     *   return !_.isRegExp(func) ? iteratee(func) : function(string) {\n     *     return func.test(string);\n     *   };\n     * });\n     *\n     * _.filter(['abc', 'def'], /ef/);\n     * // => ['def']\n     */\n    function iteratee(func) {\n      return baseIteratee(typeof func == 'function' ? func : baseClone(func, CLONE_DEEP_FLAG));\n    }\n\n    /**\n     * Creates a function that performs a partial deep comparison between a given\n     * object and `source`, returning `true` if the given object has equivalent\n     * property values, else `false`.\n     *\n     * **Note:** The created function is equivalent to `_.isMatch` with `source`\n     * partially applied.\n     *\n     * Partial comparisons will match empty array and empty object `source`\n     * values against any array or object value, respectively. See `_.isEqual`\n     * for a list of supported value comparisons.\n     *\n     * **Note:** Multiple values can be checked by combining several matchers\n     * using `_.overSome`\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Util\n     * @param {Object} source The object of property values to match.\n     * @returns {Function} Returns the new spec function.\n     * @example\n     *\n     * var objects = [\n     *   { 'a': 1, 'b': 2, 'c': 3 },\n     *   { 'a': 4, 'b': 5, 'c': 6 }\n     * ];\n     *\n     * _.filter(objects, _.matches({ 'a': 4, 'c': 6 }));\n     * // => [{ 'a': 4, 'b': 5, 'c': 6 }]\n     *\n     * // Checking for several possible values\n     * _.filter(objects, _.overSome([_.matches({ 'a': 1 }), _.matches({ 'a': 4 })]));\n     * // => [{ 'a': 1, 'b': 2, 'c': 3 }, { 'a': 4, 'b': 5, 'c': 6 }]\n     */\n    function matches(source) {\n      return baseMatches(baseClone(source, CLONE_DEEP_FLAG));\n    }\n\n    /**\n     * Creates a function that performs a partial deep comparison between the\n     * value at `path` of a given object to `srcValue`, returning `true` if the\n     * object value is equivalent, else `false`.\n     *\n     * **Note:** Partial comparisons will match empty array and empty object\n     * `srcValue` values against any array or object value, respectively. See\n     * `_.isEqual` for a list of supported value comparisons.\n     *\n     * **Note:** Multiple values can be checked by combining several matchers\n     * using `_.overSome`\n     *\n     * @static\n     * @memberOf _\n     * @since 3.2.0\n     * @category Util\n     * @param {Array|string} path The path of the property to get.\n     * @param {*} srcValue The value to match.\n     * @returns {Function} Returns the new spec function.\n     * @example\n     *\n     * var objects = [\n     *   { 'a': 1, 'b': 2, 'c': 3 },\n     *   { 'a': 4, 'b': 5, 'c': 6 }\n     * ];\n     *\n     * _.find(objects, _.matchesProperty('a', 4));\n     * // => { 'a': 4, 'b': 5, 'c': 6 }\n     *\n     * // Checking for several possible values\n     * _.filter(objects, _.overSome([_.matchesProperty('a', 1), _.matchesProperty('a', 4)]));\n     * // => [{ 'a': 1, 'b': 2, 'c': 3 }, { 'a': 4, 'b': 5, 'c': 6 }]\n     */\n    function matchesProperty(path, srcValue) {\n      return baseMatchesProperty(path, baseClone(srcValue, CLONE_DEEP_FLAG));\n    }\n\n    /**\n     * Creates a function that invokes the method at `path` of a given object.\n     * Any additional arguments are provided to the invoked method.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.7.0\n     * @category Util\n     * @param {Array|string} path The path of the method to invoke.\n     * @param {...*} [args] The arguments to invoke the method with.\n     * @returns {Function} Returns the new invoker function.\n     * @example\n     *\n     * var objects = [\n     *   { 'a': { 'b': _.constant(2) } },\n     *   { 'a': { 'b': _.constant(1) } }\n     * ];\n     *\n     * _.map(objects, _.method('a.b'));\n     * // => [2, 1]\n     *\n     * _.map(objects, _.method(['a', 'b']));\n     * // => [2, 1]\n     */\n    var method = baseRest(function(path, args) {\n      return function(object) {\n        return baseInvoke(object, path, args);\n      };\n    });\n\n    /**\n     * The opposite of `_.method`; this method creates a function that invokes\n     * the method at a given path of `object`. Any additional arguments are\n     * provided to the invoked method.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.7.0\n     * @category Util\n     * @param {Object} object The object to query.\n     * @param {...*} [args] The arguments to invoke the method with.\n     * @returns {Function} Returns the new invoker function.\n     * @example\n     *\n     * var array = _.times(3, _.constant),\n     *     object = { 'a': array, 'b': array, 'c': array };\n     *\n     * _.map(['a[2]', 'c[0]'], _.methodOf(object));\n     * // => [2, 0]\n     *\n     * _.map([['a', '2'], ['c', '0']], _.methodOf(object));\n     * // => [2, 0]\n     */\n    var methodOf = baseRest(function(object, args) {\n      return function(path) {\n        return baseInvoke(object, path, args);\n      };\n    });\n\n    /**\n     * Adds all own enumerable string keyed function properties of a source\n     * object to the destination object. If `object` is a function, then methods\n     * are added to its prototype as well.\n     *\n     * **Note:** Use `_.runInContext` to create a pristine `lodash` function to\n     * avoid conflicts caused by modifying the original.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {Function|Object} [object=lodash] The destination object.\n     * @param {Object} source The object of functions to add.\n     * @param {Object} [options={}] The options object.\n     * @param {boolean} [options.chain=true] Specify whether mixins are chainable.\n     * @returns {Function|Object} Returns `object`.\n     * @example\n     *\n     * function vowels(string) {\n     *   return _.filter(string, function(v) {\n     *     return /[aeiou]/i.test(v);\n     *   });\n     * }\n     *\n     * _.mixin({ 'vowels': vowels });\n     * _.vowels('fred');\n     * // => ['e']\n     *\n     * _('fred').vowels().value();\n     * // => ['e']\n     *\n     * _.mixin({ 'vowels': vowels }, { 'chain': false });\n     * _('fred').vowels();\n     * // => ['e']\n     */\n    function mixin(object, source, options) {\n      var props = keys(source),\n          methodNames = baseFunctions(source, props);\n\n      if (options == null &&\n          !(isObject(source) && (methodNames.length || !props.length))) {\n        options = source;\n        source = object;\n        object = this;\n        methodNames = baseFunctions(source, keys(source));\n      }\n      var chain = !(isObject(options) && 'chain' in options) || !!options.chain,\n          isFunc = isFunction(object);\n\n      arrayEach(methodNames, function(methodName) {\n        var func = source[methodName];\n        object[methodName] = func;\n        if (isFunc) {\n          object.prototype[methodName] = function() {\n            var chainAll = this.__chain__;\n            if (chain || chainAll) {\n              var result = object(this.__wrapped__),\n                  actions = result.__actions__ = copyArray(this.__actions__);\n\n              actions.push({ 'func': func, 'args': arguments, 'thisArg': object });\n              result.__chain__ = chainAll;\n              return result;\n            }\n            return func.apply(object, arrayPush([this.value()], arguments));\n          };\n        }\n      });\n\n      return object;\n    }\n\n    /**\n     * Reverts the `_` variable to its previous value and returns a reference to\n     * the `lodash` function.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @returns {Function} Returns the `lodash` function.\n     * @example\n     *\n     * var lodash = _.noConflict();\n     */\n    function noConflict() {\n      if (root._ === this) {\n        root._ = oldDash;\n      }\n      return this;\n    }\n\n    /**\n     * This method returns `undefined`.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.3.0\n     * @category Util\n     * @example\n     *\n     * _.times(2, _.noop);\n     * // => [undefined, undefined]\n     */\n    function noop() {\n      // No operation performed.\n    }\n\n    /**\n     * Creates a function that gets the argument at index `n`. If `n` is negative,\n     * the nth argument from the end is returned.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {number} [n=0] The index of the argument to return.\n     * @returns {Function} Returns the new pass-thru function.\n     * @example\n     *\n     * var func = _.nthArg(1);\n     * func('a', 'b', 'c', 'd');\n     * // => 'b'\n     *\n     * var func = _.nthArg(-2);\n     * func('a', 'b', 'c', 'd');\n     * // => 'c'\n     */\n    function nthArg(n) {\n      n = toInteger(n);\n      return baseRest(function(args) {\n        return baseNth(args, n);\n      });\n    }\n\n    /**\n     * Creates a function that invokes `iteratees` with the arguments it receives\n     * and returns their results.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {...(Function|Function[])} [iteratees=[_.identity]]\n     *  The iteratees to invoke.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var func = _.over([Math.max, Math.min]);\n     *\n     * func(1, 2, 3, 4);\n     * // => [4, 1]\n     */\n    var over = createOver(arrayMap);\n\n    /**\n     * Creates a function that checks if **all** of the `predicates` return\n     * truthy when invoked with the arguments it receives.\n     *\n     * Following shorthands are possible for providing predicates.\n     * Pass an `Object` and it will be used as an parameter for `_.matches` to create the predicate.\n     * Pass an `Array` of parameters for `_.matchesProperty` and the predicate will be created using them.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {...(Function|Function[])} [predicates=[_.identity]]\n     *  The predicates to check.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var func = _.overEvery([Boolean, isFinite]);\n     *\n     * func('1');\n     * // => true\n     *\n     * func(null);\n     * // => false\n     *\n     * func(NaN);\n     * // => false\n     */\n    var overEvery = createOver(arrayEvery);\n\n    /**\n     * Creates a function that checks if **any** of the `predicates` return\n     * truthy when invoked with the arguments it receives.\n     *\n     * Following shorthands are possible for providing predicates.\n     * Pass an `Object` and it will be used as an parameter for `_.matches` to create the predicate.\n     * Pass an `Array` of parameters for `_.matchesProperty` and the predicate will be created using them.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {...(Function|Function[])} [predicates=[_.identity]]\n     *  The predicates to check.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var func = _.overSome([Boolean, isFinite]);\n     *\n     * func('1');\n     * // => true\n     *\n     * func(null);\n     * // => true\n     *\n     * func(NaN);\n     * // => false\n     *\n     * var matchesFunc = _.overSome([{ 'a': 1 }, { 'a': 2 }])\n     * var matchesPropertyFunc = _.overSome([['a', 1], ['a', 2]])\n     */\n    var overSome = createOver(arraySome);\n\n    /**\n     * Creates a function that returns the value at `path` of a given object.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.4.0\n     * @category Util\n     * @param {Array|string} path The path of the property to get.\n     * @returns {Function} Returns the new accessor function.\n     * @example\n     *\n     * var objects = [\n     *   { 'a': { 'b': 2 } },\n     *   { 'a': { 'b': 1 } }\n     * ];\n     *\n     * _.map(objects, _.property('a.b'));\n     * // => [2, 1]\n     *\n     * _.map(_.sortBy(objects, _.property(['a', 'b'])), 'a.b');\n     * // => [1, 2]\n     */\n    function property(path) {\n      return isKey(path) ? baseProperty(toKey(path)) : basePropertyDeep(path);\n    }\n\n    /**\n     * The opposite of `_.property`; this method creates a function that returns\n     * the value at a given path of `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Util\n     * @param {Object} object The object to query.\n     * @returns {Function} Returns the new accessor function.\n     * @example\n     *\n     * var array = [0, 1, 2],\n     *     object = { 'a': array, 'b': array, 'c': array };\n     *\n     * _.map(['a[2]', 'c[0]'], _.propertyOf(object));\n     * // => [2, 0]\n     *\n     * _.map([['a', '2'], ['c', '0']], _.propertyOf(object));\n     * // => [2, 0]\n     */\n    function propertyOf(object) {\n      return function(path) {\n        return object == null ? undefined : baseGet(object, path);\n      };\n    }\n\n    /**\n     * Creates an array of numbers (positive and/or negative) progressing from\n     * `start` up to, but not including, `end`. A step of `-1` is used if a negative\n     * `start` is specified without an `end` or `step`. If `end` is not specified,\n     * it's set to `start` with `start` then set to `0`.\n     *\n     * **Note:** JavaScript follows the IEEE-754 standard for resolving\n     * floating-point values which can produce unexpected results.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {number} [start=0] The start of the range.\n     * @param {number} end The end of the range.\n     * @param {number} [step=1] The value to increment or decrement by.\n     * @returns {Array} Returns the range of numbers.\n     * @see _.inRange, _.rangeRight\n     * @example\n     *\n     * _.range(4);\n     * // => [0, 1, 2, 3]\n     *\n     * _.range(-4);\n     * // => [0, -1, -2, -3]\n     *\n     * _.range(1, 5);\n     * // => [1, 2, 3, 4]\n     *\n     * _.range(0, 20, 5);\n     * // => [0, 5, 10, 15]\n     *\n     * _.range(0, -4, -1);\n     * // => [0, -1, -2, -3]\n     *\n     * _.range(1, 4, 0);\n     * // => [1, 1, 1]\n     *\n     * _.range(0);\n     * // => []\n     */\n    var range = createRange();\n\n    /**\n     * This method is like `_.range` except that it populates values in\n     * descending order.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {number} [start=0] The start of the range.\n     * @param {number} end The end of the range.\n     * @param {number} [step=1] The value to increment or decrement by.\n     * @returns {Array} Returns the range of numbers.\n     * @see _.inRange, _.range\n     * @example\n     *\n     * _.rangeRight(4);\n     * // => [3, 2, 1, 0]\n     *\n     * _.rangeRight(-4);\n     * // => [-3, -2, -1, 0]\n     *\n     * _.rangeRight(1, 5);\n     * // => [4, 3, 2, 1]\n     *\n     * _.rangeRight(0, 20, 5);\n     * // => [15, 10, 5, 0]\n     *\n     * _.rangeRight(0, -4, -1);\n     * // => [-3, -2, -1, 0]\n     *\n     * _.rangeRight(1, 4, 0);\n     * // => [1, 1, 1]\n     *\n     * _.rangeRight(0);\n     * // => []\n     */\n    var rangeRight = createRange(true);\n\n    /**\n     * This method returns a new empty array.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.13.0\n     * @category Util\n     * @returns {Array} Returns the new empty array.\n     * @example\n     *\n     * var arrays = _.times(2, _.stubArray);\n     *\n     * console.log(arrays);\n     * // => [[], []]\n     *\n     * console.log(arrays[0] === arrays[1]);\n     * // => false\n     */\n    function stubArray() {\n      return [];\n    }\n\n    /**\n     * This method returns `false`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.13.0\n     * @category Util\n     * @returns {boolean} Returns `false`.\n     * @example\n     *\n     * _.times(2, _.stubFalse);\n     * // => [false, false]\n     */\n    function stubFalse() {\n      return false;\n    }\n\n    /**\n     * This method returns a new empty object.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.13.0\n     * @category Util\n     * @returns {Object} Returns the new empty object.\n     * @example\n     *\n     * var objects = _.times(2, _.stubObject);\n     *\n     * console.log(objects);\n     * // => [{}, {}]\n     *\n     * console.log(objects[0] === objects[1]);\n     * // => false\n     */\n    function stubObject() {\n      return {};\n    }\n\n    /**\n     * This method returns an empty string.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.13.0\n     * @category Util\n     * @returns {string} Returns the empty string.\n     * @example\n     *\n     * _.times(2, _.stubString);\n     * // => ['', '']\n     */\n    function stubString() {\n      return '';\n    }\n\n    /**\n     * This method returns `true`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.13.0\n     * @category Util\n     * @returns {boolean} Returns `true`.\n     * @example\n     *\n     * _.times(2, _.stubTrue);\n     * // => [true, true]\n     */\n    function stubTrue() {\n      return true;\n    }\n\n    /**\n     * Invokes the iteratee `n` times, returning an array of the results of\n     * each invocation. The iteratee is invoked with one argument; (index).\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {number} n The number of times to invoke `iteratee`.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the array of results.\n     * @example\n     *\n     * _.times(3, String);\n     * // => ['0', '1', '2']\n     *\n     *  _.times(4, _.constant(0));\n     * // => [0, 0, 0, 0]\n     */\n    function times(n, iteratee) {\n      n = toInteger(n);\n      if (n < 1 || n > MAX_SAFE_INTEGER) {\n        return [];\n      }\n      var index = MAX_ARRAY_LENGTH,\n          length = nativeMin(n, MAX_ARRAY_LENGTH);\n\n      iteratee = getIteratee(iteratee);\n      n -= MAX_ARRAY_LENGTH;\n\n      var result = baseTimes(length, iteratee);\n      while (++index < n) {\n        iteratee(index);\n      }\n      return result;\n    }\n\n    /**\n     * Converts `value` to a property path array.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {*} value The value to convert.\n     * @returns {Array} Returns the new property path array.\n     * @example\n     *\n     * _.toPath('a.b.c');\n     * // => ['a', 'b', 'c']\n     *\n     * _.toPath('a[0].b.c');\n     * // => ['a', '0', 'b', 'c']\n     */\n    function toPath(value) {\n      if (isArray(value)) {\n        return arrayMap(value, toKey);\n      }\n      return isSymbol(value) ? [value] : copyArray(stringToPath(toString(value)));\n    }\n\n    /**\n     * Generates a unique ID. If `prefix` is given, the ID is appended to it.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {string} [prefix=''] The value to prefix the ID with.\n     * @returns {string} Returns the unique ID.\n     * @example\n     *\n     * _.uniqueId('contact_');\n     * // => 'contact_104'\n     *\n     * _.uniqueId();\n     * // => '105'\n     */\n    function uniqueId(prefix) {\n      var id = ++idCounter;\n      return toString(prefix) + id;\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Adds two numbers.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.4.0\n     * @category Math\n     * @param {number} augend The first number in an addition.\n     * @param {number} addend The second number in an addition.\n     * @returns {number} Returns the total.\n     * @example\n     *\n     * _.add(6, 4);\n     * // => 10\n     */\n    var add = createMathOperation(function(augend, addend) {\n      return augend + addend;\n    }, 0);\n\n    /**\n     * Computes `number` rounded up to `precision`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.10.0\n     * @category Math\n     * @param {number} number The number to round up.\n     * @param {number} [precision=0] The precision to round up to.\n     * @returns {number} Returns the rounded up number.\n     * @example\n     *\n     * _.ceil(4.006);\n     * // => 5\n     *\n     * _.ceil(6.004, 2);\n     * // => 6.01\n     *\n     * _.ceil(6040, -2);\n     * // => 6100\n     */\n    var ceil = createRound('ceil');\n\n    /**\n     * Divide two numbers.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.7.0\n     * @category Math\n     * @param {number} dividend The first number in a division.\n     * @param {number} divisor The second number in a division.\n     * @returns {number} Returns the quotient.\n     * @example\n     *\n     * _.divide(6, 4);\n     * // => 1.5\n     */\n    var divide = createMathOperation(function(dividend, divisor) {\n      return dividend / divisor;\n    }, 1);\n\n    /**\n     * Computes `number` rounded down to `precision`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.10.0\n     * @category Math\n     * @param {number} number The number to round down.\n     * @param {number} [precision=0] The precision to round down to.\n     * @returns {number} Returns the rounded down number.\n     * @example\n     *\n     * _.floor(4.006);\n     * // => 4\n     *\n     * _.floor(0.046, 2);\n     * // => 0.04\n     *\n     * _.floor(4060, -2);\n     * // => 4000\n     */\n    var floor = createRound('floor');\n\n    /**\n     * Computes the maximum value of `array`. If `array` is empty or falsey,\n     * `undefined` is returned.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @returns {*} Returns the maximum value.\n     * @example\n     *\n     * _.max([4, 2, 8, 6]);\n     * // => 8\n     *\n     * _.max([]);\n     * // => undefined\n     */\n    function max(array) {\n      return (array && array.length)\n        ? baseExtremum(array, identity, baseGt)\n        : undefined;\n    }\n\n    /**\n     * This method is like `_.max` except that it accepts `iteratee` which is\n     * invoked for each element in `array` to generate the criterion by which\n     * the value is ranked. The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {*} Returns the maximum value.\n     * @example\n     *\n     * var objects = [{ 'n': 1 }, { 'n': 2 }];\n     *\n     * _.maxBy(objects, function(o) { return o.n; });\n     * // => { 'n': 2 }\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.maxBy(objects, 'n');\n     * // => { 'n': 2 }\n     */\n    function maxBy(array, iteratee) {\n      return (array && array.length)\n        ? baseExtremum(array, getIteratee(iteratee, 2), baseGt)\n        : undefined;\n    }\n\n    /**\n     * Computes the mean of the values in `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @returns {number} Returns the mean.\n     * @example\n     *\n     * _.mean([4, 2, 8, 6]);\n     * // => 5\n     */\n    function mean(array) {\n      return baseMean(array, identity);\n    }\n\n    /**\n     * This method is like `_.mean` except that it accepts `iteratee` which is\n     * invoked for each element in `array` to generate the value to be averaged.\n     * The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.7.0\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {number} Returns the mean.\n     * @example\n     *\n     * var objects = [{ 'n': 4 }, { 'n': 2 }, { 'n': 8 }, { 'n': 6 }];\n     *\n     * _.meanBy(objects, function(o) { return o.n; });\n     * // => 5\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.meanBy(objects, 'n');\n     * // => 5\n     */\n    function meanBy(array, iteratee) {\n      return baseMean(array, getIteratee(iteratee, 2));\n    }\n\n    /**\n     * Computes the minimum value of `array`. If `array` is empty or falsey,\n     * `undefined` is returned.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @returns {*} Returns the minimum value.\n     * @example\n     *\n     * _.min([4, 2, 8, 6]);\n     * // => 2\n     *\n     * _.min([]);\n     * // => undefined\n     */\n    function min(array) {\n      return (array && array.length)\n        ? baseExtremum(array, identity, baseLt)\n        : undefined;\n    }\n\n    /**\n     * This method is like `_.min` except that it accepts `iteratee` which is\n     * invoked for each element in `array` to generate the criterion by which\n     * the value is ranked. The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {*} Returns the minimum value.\n     * @example\n     *\n     * var objects = [{ 'n': 1 }, { 'n': 2 }];\n     *\n     * _.minBy(objects, function(o) { return o.n; });\n     * // => { 'n': 1 }\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.minBy(objects, 'n');\n     * // => { 'n': 1 }\n     */\n    function minBy(array, iteratee) {\n      return (array && array.length)\n        ? baseExtremum(array, getIteratee(iteratee, 2), baseLt)\n        : undefined;\n    }\n\n    /**\n     * Multiply two numbers.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.7.0\n     * @category Math\n     * @param {number} multiplier The first number in a multiplication.\n     * @param {number} multiplicand The second number in a multiplication.\n     * @returns {number} Returns the product.\n     * @example\n     *\n     * _.multiply(6, 4);\n     * // => 24\n     */\n    var multiply = createMathOperation(function(multiplier, multiplicand) {\n      return multiplier * multiplicand;\n    }, 1);\n\n    /**\n     * Computes `number` rounded to `precision`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.10.0\n     * @category Math\n     * @param {number} number The number to round.\n     * @param {number} [precision=0] The precision to round to.\n     * @returns {number} Returns the rounded number.\n     * @example\n     *\n     * _.round(4.006);\n     * // => 4\n     *\n     * _.round(4.006, 2);\n     * // => 4.01\n     *\n     * _.round(4060, -2);\n     * // => 4100\n     */\n    var round = createRound('round');\n\n    /**\n     * Subtract two numbers.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Math\n     * @param {number} minuend The first number in a subtraction.\n     * @param {number} subtrahend The second number in a subtraction.\n     * @returns {number} Returns the difference.\n     * @example\n     *\n     * _.subtract(6, 4);\n     * // => 2\n     */\n    var subtract = createMathOperation(function(minuend, subtrahend) {\n      return minuend - subtrahend;\n    }, 0);\n\n    /**\n     * Computes the sum of the values in `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.4.0\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @returns {number} Returns the sum.\n     * @example\n     *\n     * _.sum([4, 2, 8, 6]);\n     * // => 20\n     */\n    function sum(array) {\n      return (array && array.length)\n        ? baseSum(array, identity)\n        : 0;\n    }\n\n    /**\n     * This method is like `_.sum` except that it accepts `iteratee` which is\n     * invoked for each element in `array` to generate the value to be summed.\n     * The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {number} Returns the sum.\n     * @example\n     *\n     * var objects = [{ 'n': 4 }, { 'n': 2 }, { 'n': 8 }, { 'n': 6 }];\n     *\n     * _.sumBy(objects, function(o) { return o.n; });\n     * // => 20\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.sumBy(objects, 'n');\n     * // => 20\n     */\n    function sumBy(array, iteratee) {\n      return (array && array.length)\n        ? baseSum(array, getIteratee(iteratee, 2))\n        : 0;\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    // Add methods that return wrapped values in chain sequences.\n    lodash.after = after;\n    lodash.ary = ary;\n    lodash.assign = assign;\n    lodash.assignIn = assignIn;\n    lodash.assignInWith = assignInWith;\n    lodash.assignWith = assignWith;\n    lodash.at = at;\n    lodash.before = before;\n    lodash.bind = bind;\n    lodash.bindAll = bindAll;\n    lodash.bindKey = bindKey;\n    lodash.castArray = castArray;\n    lodash.chain = chain;\n    lodash.chunk = chunk;\n    lodash.compact = compact;\n    lodash.concat = concat;\n    lodash.cond = cond;\n    lodash.conforms = conforms;\n    lodash.constant = constant;\n    lodash.countBy = countBy;\n    lodash.create = create;\n    lodash.curry = curry;\n    lodash.curryRight = curryRight;\n    lodash.debounce = debounce;\n    lodash.defaults = defaults;\n    lodash.defaultsDeep = defaultsDeep;\n    lodash.defer = defer;\n    lodash.delay = delay;\n    lodash.difference = difference;\n    lodash.differenceBy = differenceBy;\n    lodash.differenceWith = differenceWith;\n    lodash.drop = drop;\n    lodash.dropRight = dropRight;\n    lodash.dropRightWhile = dropRightWhile;\n    lodash.dropWhile = dropWhile;\n    lodash.fill = fill;\n    lodash.filter = filter;\n    lodash.flatMap = flatMap;\n    lodash.flatMapDeep = flatMapDeep;\n    lodash.flatMapDepth = flatMapDepth;\n    lodash.flatten = flatten;\n    lodash.flattenDeep = flattenDeep;\n    lodash.flattenDepth = flattenDepth;\n    lodash.flip = flip;\n    lodash.flow = flow;\n    lodash.flowRight = flowRight;\n    lodash.fromPairs = fromPairs;\n    lodash.functions = functions;\n    lodash.functionsIn = functionsIn;\n    lodash.groupBy = groupBy;\n    lodash.initial = initial;\n    lodash.intersection = intersection;\n    lodash.intersectionBy = intersectionBy;\n    lodash.intersectionWith = intersectionWith;\n    lodash.invert = invert;\n    lodash.invertBy = invertBy;\n    lodash.invokeMap = invokeMap;\n    lodash.iteratee = iteratee;\n    lodash.keyBy = keyBy;\n    lodash.keys = keys;\n    lodash.keysIn = keysIn;\n    lodash.map = map;\n    lodash.mapKeys = mapKeys;\n    lodash.mapValues = mapValues;\n    lodash.matches = matches;\n    lodash.matchesProperty = matchesProperty;\n    lodash.memoize = memoize;\n    lodash.merge = merge;\n    lodash.mergeWith = mergeWith;\n    lodash.method = method;\n    lodash.methodOf = methodOf;\n    lodash.mixin = mixin;\n    lodash.negate = negate;\n    lodash.nthArg = nthArg;\n    lodash.omit = omit;\n    lodash.omitBy = omitBy;\n    lodash.once = once;\n    lodash.orderBy = orderBy;\n    lodash.over = over;\n    lodash.overArgs = overArgs;\n    lodash.overEvery = overEvery;\n    lodash.overSome = overSome;\n    lodash.partial = partial;\n    lodash.partialRight = partialRight;\n    lodash.partition = partition;\n    lodash.pick = pick;\n    lodash.pickBy = pickBy;\n    lodash.property = property;\n    lodash.propertyOf = propertyOf;\n    lodash.pull = pull;\n    lodash.pullAll = pullAll;\n    lodash.pullAllBy = pullAllBy;\n    lodash.pullAllWith = pullAllWith;\n    lodash.pullAt = pullAt;\n    lodash.range = range;\n    lodash.rangeRight = rangeRight;\n    lodash.rearg = rearg;\n    lodash.reject = reject;\n    lodash.remove = remove;\n    lodash.rest = rest;\n    lodash.reverse = reverse;\n    lodash.sampleSize = sampleSize;\n    lodash.set = set;\n    lodash.setWith = setWith;\n    lodash.shuffle = shuffle;\n    lodash.slice = slice;\n    lodash.sortBy = sortBy;\n    lodash.sortedUniq = sortedUniq;\n    lodash.sortedUniqBy = sortedUniqBy;\n    lodash.split = split;\n    lodash.spread = spread;\n    lodash.tail = tail;\n    lodash.take = take;\n    lodash.takeRight = takeRight;\n    lodash.takeRightWhile = takeRightWhile;\n    lodash.takeWhile = takeWhile;\n    lodash.tap = tap;\n    lodash.throttle = throttle;\n    lodash.thru = thru;\n    lodash.toArray = toArray;\n    lodash.toPairs = toPairs;\n    lodash.toPairsIn = toPairsIn;\n    lodash.toPath = toPath;\n    lodash.toPlainObject = toPlainObject;\n    lodash.transform = transform;\n    lodash.unary = unary;\n    lodash.union = union;\n    lodash.unionBy = unionBy;\n    lodash.unionWith = unionWith;\n    lodash.uniq = uniq;\n    lodash.uniqBy = uniqBy;\n    lodash.uniqWith = uniqWith;\n    lodash.unset = unset;\n    lodash.unzip = unzip;\n    lodash.unzipWith = unzipWith;\n    lodash.update = update;\n    lodash.updateWith = updateWith;\n    lodash.values = values;\n    lodash.valuesIn = valuesIn;\n    lodash.without = without;\n    lodash.words = words;\n    lodash.wrap = wrap;\n    lodash.xor = xor;\n    lodash.xorBy = xorBy;\n    lodash.xorWith = xorWith;\n    lodash.zip = zip;\n    lodash.zipObject = zipObject;\n    lodash.zipObjectDeep = zipObjectDeep;\n    lodash.zipWith = zipWith;\n\n    // Add aliases.\n    lodash.entries = toPairs;\n    lodash.entriesIn = toPairsIn;\n    lodash.extend = assignIn;\n    lodash.extendWith = assignInWith;\n\n    // Add methods to `lodash.prototype`.\n    mixin(lodash, lodash);\n\n    /*------------------------------------------------------------------------*/\n\n    // Add methods that return unwrapped values in chain sequences.\n    lodash.add = add;\n    lodash.attempt = attempt;\n    lodash.camelCase = camelCase;\n    lodash.capitalize = capitalize;\n    lodash.ceil = ceil;\n    lodash.clamp = clamp;\n    lodash.clone = clone;\n    lodash.cloneDeep = cloneDeep;\n    lodash.cloneDeepWith = cloneDeepWith;\n    lodash.cloneWith = cloneWith;\n    lodash.conformsTo = conformsTo;\n    lodash.deburr = deburr;\n    lodash.defaultTo = defaultTo;\n    lodash.divide = divide;\n    lodash.endsWith = endsWith;\n    lodash.eq = eq;\n    lodash.escape = escape;\n    lodash.escapeRegExp = escapeRegExp;\n    lodash.every = every;\n    lodash.find = find;\n    lodash.findIndex = findIndex;\n    lodash.findKey = findKey;\n    lodash.findLast = findLast;\n    lodash.findLastIndex = findLastIndex;\n    lodash.findLastKey = findLastKey;\n    lodash.floor = floor;\n    lodash.forEach = forEach;\n    lodash.forEachRight = forEachRight;\n    lodash.forIn = forIn;\n    lodash.forInRight = forInRight;\n    lodash.forOwn = forOwn;\n    lodash.forOwnRight = forOwnRight;\n    lodash.get = get;\n    lodash.gt = gt;\n    lodash.gte = gte;\n    lodash.has = has;\n    lodash.hasIn = hasIn;\n    lodash.head = head;\n    lodash.identity = identity;\n    lodash.includes = includes;\n    lodash.indexOf = indexOf;\n    lodash.inRange = inRange;\n    lodash.invoke = invoke;\n    lodash.isArguments = isArguments;\n    lodash.isArray = isArray;\n    lodash.isArrayBuffer = isArrayBuffer;\n    lodash.isArrayLike = isArrayLike;\n    lodash.isArrayLikeObject = isArrayLikeObject;\n    lodash.isBoolean = isBoolean;\n    lodash.isBuffer = isBuffer;\n    lodash.isDate = isDate;\n    lodash.isElement = isElement;\n    lodash.isEmpty = isEmpty;\n    lodash.isEqual = isEqual;\n    lodash.isEqualWith = isEqualWith;\n    lodash.isError = isError;\n    lodash.isFinite = isFinite;\n    lodash.isFunction = isFunction;\n    lodash.isInteger = isInteger;\n    lodash.isLength = isLength;\n    lodash.isMap = isMap;\n    lodash.isMatch = isMatch;\n    lodash.isMatchWith = isMatchWith;\n    lodash.isNaN = isNaN;\n    lodash.isNative = isNative;\n    lodash.isNil = isNil;\n    lodash.isNull = isNull;\n    lodash.isNumber = isNumber;\n    lodash.isObject = isObject;\n    lodash.isObjectLike = isObjectLike;\n    lodash.isPlainObject = isPlainObject;\n    lodash.isRegExp = isRegExp;\n    lodash.isSafeInteger = isSafeInteger;\n    lodash.isSet = isSet;\n    lodash.isString = isString;\n    lodash.isSymbol = isSymbol;\n    lodash.isTypedArray = isTypedArray;\n    lodash.isUndefined = isUndefined;\n    lodash.isWeakMap = isWeakMap;\n    lodash.isWeakSet = isWeakSet;\n    lodash.join = join;\n    lodash.kebabCase = kebabCase;\n    lodash.last = last;\n    lodash.lastIndexOf = lastIndexOf;\n    lodash.lowerCase = lowerCase;\n    lodash.lowerFirst = lowerFirst;\n    lodash.lt = lt;\n    lodash.lte = lte;\n    lodash.max = max;\n    lodash.maxBy = maxBy;\n    lodash.mean = mean;\n    lodash.meanBy = meanBy;\n    lodash.min = min;\n    lodash.minBy = minBy;\n    lodash.stubArray = stubArray;\n    lodash.stubFalse = stubFalse;\n    lodash.stubObject = stubObject;\n    lodash.stubString = stubString;\n    lodash.stubTrue = stubTrue;\n    lodash.multiply = multiply;\n    lodash.nth = nth;\n    lodash.noConflict = noConflict;\n    lodash.noop = noop;\n    lodash.now = now;\n    lodash.pad = pad;\n    lodash.padEnd = padEnd;\n    lodash.padStart = padStart;\n    lodash.parseInt = parseInt;\n    lodash.random = random;\n    lodash.reduce = reduce;\n    lodash.reduceRight = reduceRight;\n    lodash.repeat = repeat;\n    lodash.replace = replace;\n    lodash.result = result;\n    lodash.round = round;\n    lodash.runInContext = runInContext;\n    lodash.sample = sample;\n    lodash.size = size;\n    lodash.snakeCase = snakeCase;\n    lodash.some = some;\n    lodash.sortedIndex = sortedIndex;\n    lodash.sortedIndexBy = sortedIndexBy;\n    lodash.sortedIndexOf = sortedIndexOf;\n    lodash.sortedLastIndex = sortedLastIndex;\n    lodash.sortedLastIndexBy = sortedLastIndexBy;\n    lodash.sortedLastIndexOf = sortedLastIndexOf;\n    lodash.startCase = startCase;\n    lodash.startsWith = startsWith;\n    lodash.subtract = subtract;\n    lodash.sum = sum;\n    lodash.sumBy = sumBy;\n    lodash.template = template;\n    lodash.times = times;\n    lodash.toFinite = toFinite;\n    lodash.toInteger = toInteger;\n    lodash.toLength = toLength;\n    lodash.toLower = toLower;\n    lodash.toNumber = toNumber;\n    lodash.toSafeInteger = toSafeInteger;\n    lodash.toString = toString;\n    lodash.toUpper = toUpper;\n    lodash.trim = trim;\n    lodash.trimEnd = trimEnd;\n    lodash.trimStart = trimStart;\n    lodash.truncate = truncate;\n    lodash.unescape = unescape;\n    lodash.uniqueId = uniqueId;\n    lodash.upperCase = upperCase;\n    lodash.upperFirst = upperFirst;\n\n    // Add aliases.\n    lodash.each = forEach;\n    lodash.eachRight = forEachRight;\n    lodash.first = head;\n\n    mixin(lodash, (function() {\n      var source = {};\n      baseForOwn(lodash, function(func, methodName) {\n        if (!hasOwnProperty.call(lodash.prototype, methodName)) {\n          source[methodName] = func;\n        }\n      });\n      return source;\n    }()), { 'chain': false });\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * The semantic version number.\n     *\n     * @static\n     * @memberOf _\n     * @type {string}\n     */\n    lodash.VERSION = VERSION;\n\n    // Assign default placeholders.\n    arrayEach(['bind', 'bindKey', 'curry', 'curryRight', 'partial', 'partialRight'], function(methodName) {\n      lodash[methodName].placeholder = lodash;\n    });\n\n    // Add `LazyWrapper` methods for `_.drop` and `_.take` variants.\n    arrayEach(['drop', 'take'], function(methodName, index) {\n      LazyWrapper.prototype[methodName] = function(n) {\n        n = n === undefined ? 1 : nativeMax(toInteger(n), 0);\n\n        var result = (this.__filtered__ && !index)\n          ? new LazyWrapper(this)\n          : this.clone();\n\n        if (result.__filtered__) {\n          result.__takeCount__ = nativeMin(n, result.__takeCount__);\n        } else {\n          result.__views__.push({\n            'size': nativeMin(n, MAX_ARRAY_LENGTH),\n            'type': methodName + (result.__dir__ < 0 ? 'Right' : '')\n          });\n        }\n        return result;\n      };\n\n      LazyWrapper.prototype[methodName + 'Right'] = function(n) {\n        return this.reverse()[methodName](n).reverse();\n      };\n    });\n\n    // Add `LazyWrapper` methods that accept an `iteratee` value.\n    arrayEach(['filter', 'map', 'takeWhile'], function(methodName, index) {\n      var type = index + 1,\n          isFilter = type == LAZY_FILTER_FLAG || type == LAZY_WHILE_FLAG;\n\n      LazyWrapper.prototype[methodName] = function(iteratee) {\n        var result = this.clone();\n        result.__iteratees__.push({\n          'iteratee': getIteratee(iteratee, 3),\n          'type': type\n        });\n        result.__filtered__ = result.__filtered__ || isFilter;\n        return result;\n      };\n    });\n\n    // Add `LazyWrapper` methods for `_.head` and `_.last`.\n    arrayEach(['head', 'last'], function(methodName, index) {\n      var takeName = 'take' + (index ? 'Right' : '');\n\n      LazyWrapper.prototype[methodName] = function() {\n        return this[takeName](1).value()[0];\n      };\n    });\n\n    // Add `LazyWrapper` methods for `_.initial` and `_.tail`.\n    arrayEach(['initial', 'tail'], function(methodName, index) {\n      var dropName = 'drop' + (index ? '' : 'Right');\n\n      LazyWrapper.prototype[methodName] = function() {\n        return this.__filtered__ ? new LazyWrapper(this) : this[dropName](1);\n      };\n    });\n\n    LazyWrapper.prototype.compact = function() {\n      return this.filter(identity);\n    };\n\n    LazyWrapper.prototype.find = function(predicate) {\n      return this.filter(predicate).head();\n    };\n\n    LazyWrapper.prototype.findLast = function(predicate) {\n      return this.reverse().find(predicate);\n    };\n\n    LazyWrapper.prototype.invokeMap = baseRest(function(path, args) {\n      if (typeof path == 'function') {\n        return new LazyWrapper(this);\n      }\n      return this.map(function(value) {\n        return baseInvoke(value, path, args);\n      });\n    });\n\n    LazyWrapper.prototype.reject = function(predicate) {\n      return this.filter(negate(getIteratee(predicate)));\n    };\n\n    LazyWrapper.prototype.slice = function(start, end) {\n      start = toInteger(start);\n\n      var result = this;\n      if (result.__filtered__ && (start > 0 || end < 0)) {\n        return new LazyWrapper(result);\n      }\n      if (start < 0) {\n        result = result.takeRight(-start);\n      } else if (start) {\n        result = result.drop(start);\n      }\n      if (end !== undefined) {\n        end = toInteger(end);\n        result = end < 0 ? result.dropRight(-end) : result.take(end - start);\n      }\n      return result;\n    };\n\n    LazyWrapper.prototype.takeRightWhile = function(predicate) {\n      return this.reverse().takeWhile(predicate).reverse();\n    };\n\n    LazyWrapper.prototype.toArray = function() {\n      return this.take(MAX_ARRAY_LENGTH);\n    };\n\n    // Add `LazyWrapper` methods to `lodash.prototype`.\n    baseForOwn(LazyWrapper.prototype, function(func, methodName) {\n      var checkIteratee = /^(?:filter|find|map|reject)|While$/.test(methodName),\n          isTaker = /^(?:head|last)$/.test(methodName),\n          lodashFunc = lodash[isTaker ? ('take' + (methodName == 'last' ? 'Right' : '')) : methodName],\n          retUnwrapped = isTaker || /^find/.test(methodName);\n\n      if (!lodashFunc) {\n        return;\n      }\n      lodash.prototype[methodName] = function() {\n        var value = this.__wrapped__,\n            args = isTaker ? [1] : arguments,\n            isLazy = value instanceof LazyWrapper,\n            iteratee = args[0],\n            useLazy = isLazy || isArray(value);\n\n        var interceptor = function(value) {\n          var result = lodashFunc.apply(lodash, arrayPush([value], args));\n          return (isTaker && chainAll) ? result[0] : result;\n        };\n\n        if (useLazy && checkIteratee && typeof iteratee == 'function' && iteratee.length != 1) {\n          // Avoid lazy use if the iteratee has a \"length\" value other than `1`.\n          isLazy = useLazy = false;\n        }\n        var chainAll = this.__chain__,\n            isHybrid = !!this.__actions__.length,\n            isUnwrapped = retUnwrapped && !chainAll,\n            onlyLazy = isLazy && !isHybrid;\n\n        if (!retUnwrapped && useLazy) {\n          value = onlyLazy ? value : new LazyWrapper(this);\n          var result = func.apply(value, args);\n          result.__actions__.push({ 'func': thru, 'args': [interceptor], 'thisArg': undefined });\n          return new LodashWrapper(result, chainAll);\n        }\n        if (isUnwrapped && onlyLazy) {\n          return func.apply(this, args);\n        }\n        result = this.thru(interceptor);\n        return isUnwrapped ? (isTaker ? result.value()[0] : result.value()) : result;\n      };\n    });\n\n    // Add `Array` methods to `lodash.prototype`.\n    arrayEach(['pop', 'push', 'shift', 'sort', 'splice', 'unshift'], function(methodName) {\n      var func = arrayProto[methodName],\n          chainName = /^(?:push|sort|unshift)$/.test(methodName) ? 'tap' : 'thru',\n          retUnwrapped = /^(?:pop|shift)$/.test(methodName);\n\n      lodash.prototype[methodName] = function() {\n        var args = arguments;\n        if (retUnwrapped && !this.__chain__) {\n          var value = this.value();\n          return func.apply(isArray(value) ? value : [], args);\n        }\n        return this[chainName](function(value) {\n          return func.apply(isArray(value) ? value : [], args);\n        });\n      };\n    });\n\n    // Map minified method names to their real names.\n    baseForOwn(LazyWrapper.prototype, function(func, methodName) {\n      var lodashFunc = lodash[methodName];\n      if (lodashFunc) {\n        var key = lodashFunc.name + '';\n        if (!hasOwnProperty.call(realNames, key)) {\n          realNames[key] = [];\n        }\n        realNames[key].push({ 'name': methodName, 'func': lodashFunc });\n      }\n    });\n\n    realNames[createHybrid(undefined, WRAP_BIND_KEY_FLAG).name] = [{\n      'name': 'wrapper',\n      'func': undefined\n    }];\n\n    // Add methods to `LazyWrapper`.\n    LazyWrapper.prototype.clone = lazyClone;\n    LazyWrapper.prototype.reverse = lazyReverse;\n    LazyWrapper.prototype.value = lazyValue;\n\n    // Add chain sequence methods to the `lodash` wrapper.\n    lodash.prototype.at = wrapperAt;\n    lodash.prototype.chain = wrapperChain;\n    lodash.prototype.commit = wrapperCommit;\n    lodash.prototype.next = wrapperNext;\n    lodash.prototype.plant = wrapperPlant;\n    lodash.prototype.reverse = wrapperReverse;\n    lodash.prototype.toJSON = lodash.prototype.valueOf = lodash.prototype.value = wrapperValue;\n\n    // Add lazy aliases.\n    lodash.prototype.first = lodash.prototype.head;\n\n    if (symIterator) {\n      lodash.prototype[symIterator] = wrapperToIterator;\n    }\n    return lodash;\n  });\n\n  /*--------------------------------------------------------------------------*/\n\n  // Export lodash.\n  var _ = runInContext();\n\n  // Some AMD build optimizers, like r.js, check for condition patterns like:\n  if (typeof define == 'function' && typeof define.amd == 'object' && define.amd) {\n    // Expose Lodash on the global object to prevent errors when Lodash is\n    // loaded by a script tag in the presence of an AMD loader.\n    // See http://requirejs.org/docs/errors.html#mismatch for more details.\n    // Use `_.noConflict` to remove Lodash from the global object.\n    root._ = _;\n\n    // Define as an anonymous module so, through path mapping, it can be\n    // referenced as the \"underscore\" module.\n    define(function() {\n      return _;\n    });\n  }\n  // Check for `exports` after `define` in case a build optimizer adds it.\n  else if (freeModule) {\n    // Export for Node.js.\n    (freeModule.exports = _)._ = _;\n    // Export for CommonJS support.\n    freeExports._ = _;\n  }\n  else {\n    // Export to the global object.\n    root._ = _;\n  }\n}.call(this));\n","import { RangeSet, StateEffect, StateField } from \"@codemirror/state\";\nimport { Decoration, EditorView } from \"@codemirror/view\";\nimport _ from \"lodash\";\n// ---------\n// Constants\nexport const readChar = \"R\";\nexport const writeChar = \"W\";\nexport const flowChar = \"F\";\nexport const ownChar = \"O\";\n// ---------\n// Utilities\nexport let permName = (c) => {\n    if (c === \"R\") {\n        return \"read\";\n    }\n    else if (c === \"W\") {\n        return \"write\";\n    }\n    else if (c === \"O\") {\n        return \"own\";\n    }\n    else {\n        return \"flow\";\n    }\n};\nexport let lerp = (min, max, alpha) => (max - min) * alpha + min;\nexport let evenlySpaceAround = ({ center, spacing, index, total }) => {\n    let range = total * spacing;\n    let min = center - range / 2;\n    let max = center + range / 2;\n    let alpha = index / total;\n    return lerp(min, max, alpha);\n};\nexport let makeTag = (length) => {\n    let result = \"\";\n    const characters = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\";\n    const charactersLength = characters.length;\n    for (let i = 0; i < length; i++) {\n        result += characters.charAt(Math.floor(Math.random() * charactersLength));\n    }\n    return `tag${result}`;\n};\nexport function genStateField(ty, transform) {\n    return StateField.define({\n        create: () => Decoration.none,\n        update(points, transactions) {\n            for (let e of transactions.effects) {\n                if (e.is(ty)) {\n                    // Sort the values by default          vvvv\n                    return RangeSet.of(transform(e.value, transactions.newDoc), true);\n                }\n            }\n            return transactions.docChanged ? RangeSet.of([]) : points;\n        },\n        provide: f => EditorView.decorations.from(f)\n    });\n}\nexport const loanFactsStateType = StateEffect.define();\nexport const loanFactsField = genStateField(loanFactsStateType, (ts, text) => ts.flatMap(t => loanFactsToDecoration(t, text)));\nfunction loanFactsToDecoration({ refinerTag, regionTag, refinerPoint, region }, text) {\n    let loanDeco = Decoration.mark({\n        class: \"aquascope-loan\",\n        tagName: refinerTag\n    }).range(linecolToPosition(refinerPoint.start, text), linecolToPosition(refinerPoint.end, text));\n    let regionDecos = region.refined_ranges\n        .filter(range => !_.isEqual(range.start, range.end))\n        .map(range => {\n        let highlightedRange = Decoration.mark({\n            class: \"aquascope-live-region\",\n            tagName: regionTag\n        }).range(linecolToPosition(range.start, text), linecolToPosition(range.end, text));\n        return highlightedRange;\n    });\n    return [loanDeco, ...regionDecos];\n}\nexport function generateAnalysisDecorationFacts(output) {\n    let lPoints = {};\n    let lRegions = {};\n    let mPoints = {};\n    let mRegions = {};\n    let stateFacts = [];\n    for (const loan in output.loan_regions) {\n        let tag = makeTag(26);\n        let regionTag = makeTag(26);\n        let refinedRegion = output.loan_regions[loan];\n        let loanPoint = output.loan_points[loan];\n        lPoints[loan] = tag;\n        lRegions[loan] = regionTag;\n        let loanFacts = {\n            refinerTag: tag,\n            regionTag: regionTag,\n            refinerPoint: loanPoint,\n            region: refinedRegion\n        };\n        stateFacts.push(loanFacts);\n    }\n    for (const loan in output.move_regions) {\n        let tag = makeTag(26);\n        let regionTag = makeTag(26);\n        let refinedRegion = output.move_regions[loan];\n        let loanPoint = output.move_points[loan];\n        mPoints[loan] = tag;\n        mRegions[loan] = regionTag;\n        let loanFacts = {\n            refinerTag: tag,\n            regionTag: regionTag,\n            refinerPoint: loanPoint,\n            region: refinedRegion\n        };\n        stateFacts.push(loanFacts);\n    }\n    let facts = {\n        loanPoints: lPoints,\n        loanRegions: lRegions,\n        movePoints: mPoints,\n        moveRegions: mRegions\n    };\n    return [facts, stateFacts];\n}\nexport let hideLine = StateEffect.define();\nlet hiddenLineClass = Decoration.line({ class: \"hidden-line\" });\nexport let hiddenLines = StateField.define({\n    create: () => Decoration.none,\n    update(decos, tr) {\n        decos = decos.map(tr.changes);\n        for (let e of tr.effects)\n            if (e.is(hideLine))\n                decos = decos.update({\n                    add: [hiddenLineClass.range(tr.state.doc.line(e.value.line).from)]\n                });\n        return decos;\n    },\n    provide: f => EditorView.decorations.from(f)\n});\nlet forCustomTag = (tag, callback) => {\n    Array.from(document.getElementsByTagName(tag)).forEach(callback);\n};\nfunction showRegion(points, regions, key, names = []) {\n    if (key !== undefined) {\n        const pTag = points[key];\n        const rTag = regions[key];\n        forCustomTag(pTag, elem => {\n            elem.classList.add(\"show-hidden\");\n            names.forEach((n) => elem.classList.add(n));\n        });\n        forCustomTag(rTag, elem => {\n            elem.classList.add(\"show-hidden\");\n            names.forEach((n) => elem.classList.add(n));\n        });\n    }\n}\nfunction hideRegion(points, regions, key, names = []) {\n    if (key !== undefined) {\n        const pTag = points[key];\n        const rTag = regions[key];\n        forCustomTag(pTag, elem => {\n            elem.classList.remove(\"show-hidden\");\n            names.forEach((n) => elem.classList.remove(n));\n        });\n        forCustomTag(rTag, elem => {\n            elem.classList.remove(\"show-hidden\");\n            names.forEach((n) => elem.classList.remove(n));\n        });\n    }\n}\nexport let showLoanRegion = (facts, key, names = []) => {\n    showRegion(facts.loanPoints, facts.loanRegions, key, names);\n};\nexport let hideLoanRegion = (facts, key, names = []) => {\n    hideRegion(facts.loanPoints, facts.loanRegions, key, names);\n};\nexport let showMoveRegion = (facts, key, names = []) => {\n    showRegion(facts.movePoints, facts.moveRegions, key, names);\n};\nexport let hideMoveRegion = (facts, key, names = []) => {\n    hideRegion(facts.movePoints, facts.moveRegions, key, names);\n};\nexport let makeDecorationField = () => {\n    let setEffect = StateEffect.define();\n    let field = StateField.define({\n        create: () => Decoration.none,\n        update(widgets, tr) {\n            widgets = widgets.map(tr.changes);\n            for (let e of tr.effects)\n                if (e.is(setEffect))\n                    widgets = RangeSet.of(_.sortBy(e.value, range => range.from));\n            return widgets;\n        },\n        provide: f => EditorView.decorations.from(f)\n    });\n    return { setEffect, field };\n};\nexport let linecolToPosition = (p, t) => t.line(p.line + 1).from + p.column;\n//# sourceMappingURL=misc.js.map","import { Decoration, WidgetType } from \"@codemirror/view\";\nimport classNames from \"classnames\";\nimport React, { useState } from \"react\";\nimport ReactDOM from \"react-dom/client\";\nimport { flowChar, hideLoanRegion, hideMoveRegion, linecolToPosition, makeDecorationField, ownChar, permName, readChar, showLoanRegion, showMoveRegion, writeChar } from \"./misc.js\";\nlet PermChar = ({ content, names, act, showit, hideit }) => {\n    let name = permName(content);\n    name = name.charAt(0).toUpperCase() + name.slice(1);\n    let title = `${name} permission is expected, `;\n    title += act\n        ? \"and the path has the permission.\"\n        : \"but the path does not have the permission.\";\n    return (React.createElement(\"div\", { className: classNames(...names, { missing: !act }), onMouseEnter: showit, onMouseLeave: hideit, title: title },\n        React.createElement(\"div\", { className: \"small\" }, \"\\u2022\"),\n        React.createElement(\"div\", { className: \"big\" }, content)));\n};\nlet PermStack = ({ facts, boundary }) => {\n    const data = boundary.actual;\n    let allIcons = [\n        {\n            content: readChar,\n            names: [\"perm\", \"read\"],\n            exp: boundary.expected.read,\n            act: data.permissions.read,\n            showit: () => {\n                showLoanRegion(facts, data.loan_read_refined, [\"read\"]);\n                showMoveRegion(facts, data.path_moved, [\"read\"]);\n            },\n            hideit: () => {\n                hideLoanRegion(facts, data.loan_read_refined, [\"read\"]);\n                hideMoveRegion(facts, data.path_moved, [\"read\"]);\n            }\n        },\n        {\n            content: writeChar,\n            names: [\"perm\", \"write\"],\n            exp: boundary.expected.write,\n            act: data.permissions.write,\n            showit: () => {\n                showLoanRegion(facts, data.loan_write_refined, [\"write\"]);\n                showMoveRegion(facts, data.path_moved, [\"write\"]);\n            },\n            hideit: () => {\n                hideLoanRegion(facts, data.loan_write_refined, [\"write\"]);\n                hideMoveRegion(facts, data.path_moved, [\"write\"]);\n            }\n        },\n        {\n            content: ownChar,\n            names: [\"perm\", \"own\"],\n            exp: boundary.expected.drop,\n            act: data.permissions.drop,\n            showit: () => {\n                showLoanRegion(facts, data.loan_drop_refined, [\"own\"]);\n                showMoveRegion(facts, data.path_moved, [\"own\"]);\n            },\n            hideit: () => {\n                hideLoanRegion(facts, data.loan_drop_refined, [\"own\"]);\n                hideMoveRegion(facts, data.path_moved, [\"own\"]);\n            }\n        },\n        {\n            content: flowChar,\n            names: [\"perm\", \"flow\"],\n            exp: boundary.expecting_flow !== undefined,\n            act: !boundary.expecting_flow?.is_violation ?? false,\n            showit: () => void null,\n            hideit: () => void null\n        }\n    ];\n    let icons = allIcons.filter(i => i.exp);\n    // Necessary so we can temporarily apply the CSS filter and remove it\n    // at the end of the animation. Sadly no way to do this in pure CSS AFAIK...\n    let [animating, setAnimating] = useState(false);\n    let [timer, setTimer] = useState();\n    let triggerAnimation = () => {\n        setAnimating(true);\n        if (timer !== 0)\n            clearTimeout(timer);\n        setTimer(window.setTimeout(() => setAnimating(false), 500));\n    };\n    return (React.createElement(\"div\", { onMouseEnter: triggerAnimation, onMouseLeave: triggerAnimation, className: classNames({ animating }) }, icons.map(info => (React.createElement(PermChar, { key: info.content, ...info })))));\n};\nclass BoundaryPointWidget extends WidgetType {\n    view;\n    facts;\n    boundary;\n    annotations;\n    line;\n    numDisplayed;\n    constructor(view, facts, boundary, annotations) {\n        super();\n        this.view = view;\n        this.facts = facts;\n        this.boundary = boundary;\n        this.annotations = annotations;\n        let toi = (b) => (b ? 1 : 0);\n        this.numDisplayed = [\n            toi(this.boundary.expected.read),\n            toi(this.boundary.expected.write),\n            toi(this.boundary.expected.drop),\n            toi(this.boundary.expecting_flow !== undefined)\n        ].reduce((a, b) => a + b, 0);\n        this.line = view.state.doc.lineAt(linecolToPosition(boundary.location, view.state.doc));\n    }\n    eq(other) {\n        // TODO\n        return this.boundary.location === other.boundary.location;\n    }\n    toDOM(view) {\n        let location = linecolToPosition(this.boundary.location, view.state.doc);\n        let precedingText = view.state.sliceDoc(location - 1, location);\n        let container = document.createElement(\"div\");\n        container.classList.add(\"permission-stack\");\n        container.classList.add(`stack-size-${this.numDisplayed}`);\n        if (precedingText === \" \")\n            container.classList.add(\"before-whitespace\");\n        if (this.annotations?.focused_lines.includes(this.line.number))\n            container.classList.add(\"expanded\");\n        ReactDOM.createRoot(container).render(React.createElement(PermStack, { facts: this.facts, boundary: this.boundary }));\n        return container;\n    }\n    ignoreEvent() {\n        // TODO\n        return false;\n    }\n}\nexport let boundariesField = makeDecorationField();\nexport function makeBoundaryDecorations(view, facts, boundaries, annotations) {\n    return boundaries.map(b => Decoration.widget({\n        widget: new BoundaryPointWidget(view, facts, b, annotations)\n    }).range(linecolToPosition(b.location, view.state.doc)));\n}\n//# sourceMappingURL=boundaries.js.map","/*! LeaderLine v1.1.5 (c) anseki https://anseki.github.io/leader-line/ */\nvar LeaderLine=function(){\"use strict\";var te,M,I,C,L,o,t,h,f,p,n,a,e,x,b,l,r,i,k,w,s,u,c,A=\"leader-line\",V=1,P=2,N=3,T=4,W={top:V,right:P,bottom:N,left:T},B=1,R=2,F=3,G=4,D=5,z={straight:B,arc:R,fluid:F,magnet:G,grid:D},ne=\"behind\",d=A+\"-defs\",y='<svg xmlns=\"http://www.w3.org/2000/svg\" version=\"1.1\" id=\"leader-line-defs\"><style><![CDATA[.leader-line{position:absolute;overflow:visible!important;pointer-events:none!important;font-size:16px}#leader-line-defs{width:0;height:0;position:absolute;left:0;top:0}.leader-line-line-path{fill:none}.leader-line-mask-bg-rect{fill:#fff}.leader-line-caps-mask-anchor,.leader-line-caps-mask-marker-shape{fill:#000}.leader-line-caps-mask-anchor{stroke:#000}.leader-line-caps-mask-line,.leader-line-plugs-face{stroke:transparent}.leader-line-line-mask-shape{stroke:#fff}.leader-line-line-outline-mask-shape{stroke:#000}.leader-line-plug-mask-shape{fill:#fff;stroke:#000}.leader-line-plug-outline-mask-shape{fill:#000;stroke:#fff}.leader-line-areaAnchor{position:absolute;overflow:visible!important}]]></style><defs><circle id=\"leader-line-disc\" cx=\"0\" cy=\"0\" r=\"5\"/><rect id=\"leader-line-square\" x=\"-5\" y=\"-5\" width=\"10\" height=\"10\"/><polygon id=\"leader-line-arrow1\" points=\"-8,-8 8,0 -8,8 -5,0\"/><polygon id=\"leader-line-arrow2\" points=\"-4,-8 4,0 -4,8 -7,5 -2,0 -7,-5\"/><polygon id=\"leader-line-arrow3\" points=\"-4,-5 8,0 -4,5\"/><g id=\"leader-line-hand\"><path style=\"fill: #fcfcfc\" d=\"M9.19 11.14h4.75c1.38 0 2.49-1.11 2.49-2.49 0-.51-.15-.98-.41-1.37h1.3c1.38 0 2.49-1.11 2.49-2.49s-1.11-2.53-2.49-2.53h1.02c1.38 0 2.49-1.11 2.49-2.49s-1.11-2.49-2.49-2.49h14.96c1.37 0 2.49-1.11 2.49-2.49s-1.11-2.49-2.49-2.49H16.58C16-9.86 14.28-11.14 9.7-11.14c-4.79 0-6.55 3.42-7.87 4.73H-2.14v13.23h3.68C3.29 9.97 5.47 11.14 9.19 11.14L9.19 11.14Z\"/><path style=\"fill: black\" d=\"M13.95 12c1.85 0 3.35-1.5 3.35-3.35 0-.17-.02-.34-.04-.51h.07c1.85 0 3.35-1.5 3.35-3.35 0-.79-.27-1.51-.72-2.08 1.03-.57 1.74-1.67 1.74-2.93 0-.59-.16-1.15-.43-1.63h12.04c1.85 0 3.35-1.5 3.35-3.35 0-1.85-1.5-3.35-3.35-3.35H17.2C16.26-10.93 13.91-12 9.7-12 5.36-12 3.22-9.4 1.94-7.84c0 0-.29.33-.5.57-.63 0-3.58 0-3.58 0C-2.61-7.27-3-6.88-3-6.41v13.23c0 .47.39.86.86.86 0 0 2.48 0 3.2 0C2.9 10.73 5.29 12 9.19 12L13.95 12ZM9.19 10.28c-3.46 0-5.33-1.05-6.9-3.87-.15-.27-.44-.44-.75-.44 0 0-1.81 0-2.82 0V-5.55c1.06 0 3.11 0 3.11 0 .25 0 .44-.06.61-.25l.83-.95c1.23-1.49 2.91-3.53 6.43-3.53 3.45 0 4.9.74 5.57 1.72h-4.3c-.48 0-.86.38-.86.86s.39.86.86.86h22.34c.9 0 1.63.73 1.63 1.63 0 .9-.73 1.63-1.63 1.63H15.83c-.48 0-.86.38-.86.86 0 .47.39.86.86.86h2.52c.9 0 1.63.73 1.63 1.63s-.73 1.63-1.63 1.63h-3.12c-.48 0-.86.38-.86.86 0 .47.39.86.86.86h2.11c.88 0 1.63.76 1.63 1.67 0 .9-.73 1.63-1.63 1.63h-3.2c-.48 0-.86.39-.86.86 0 .47.39.86.86.86h1.36c.05.16.09.34.09.51 0 .9-.73 1.63-1.63 1.63C13.95 10.28 9.19 10.28 9.19 10.28Z\"/></g><g id=\"leader-line-crosshair\"><path d=\"M0-78.97c-43.54 0-78.97 35.43-78.97 78.97 0 43.54 35.43 78.97 78.97 78.97s78.97-35.43 78.97-78.97C78.97-43.54 43.55-78.97 0-78.97ZM76.51-1.21h-9.91v-9.11h-2.43v9.11h-11.45c-.64-28.12-23.38-50.86-51.5-51.5V-64.17h9.11V-66.6h-9.11v-9.91C42.46-75.86 75.86-42.45 76.51-1.21ZM-1.21-30.76h-9.11v2.43h9.11V-4.2c-1.44.42-2.57 1.54-2.98 2.98H-28.33v-9.11h-2.43v9.11H-50.29C-49.65-28-27.99-49.65-1.21-50.29V-30.76ZM-30.76 1.21v9.11h2.43v-9.11H-4.2c.42 1.44 1.54 2.57 2.98 2.98v24.13h-9.11v2.43h9.11v19.53C-27.99 49.65-49.65 28-50.29 1.21H-30.76ZM1.22 30.75h9.11v-2.43h-9.11V4.2c1.44-.42 2.56-1.54 2.98-2.98h24.13v9.11h2.43v-9.11h19.53C49.65 28 28 49.65 1.22 50.29V30.75ZM30.76-1.21v-9.11h-2.43v9.11H4.2c-.42-1.44-1.54-2.56-2.98-2.98V-28.33h9.11v-2.43h-9.11V-50.29C28-49.65 49.65-28 50.29-1.21H30.76ZM-1.21-76.51v9.91h-9.11v2.43h9.11v11.45c-28.12.64-50.86 23.38-51.5 51.5H-64.17v-9.11H-66.6v9.11h-9.91C-75.86-42.45-42.45-75.86-1.21-76.51ZM-76.51 1.21h9.91v9.11h2.43v-9.11h11.45c.64 28.12 23.38 50.86 51.5 51.5v11.45h-9.11v2.43h9.11v9.91C-42.45 75.86-75.86 42.45-76.51 1.21ZM1.22 76.51v-9.91h9.11v-2.43h-9.11v-11.45c28.12-.64 50.86-23.38 51.5-51.5h11.45v9.11h2.43v-9.11h9.91C75.86 42.45 42.45 75.86 1.22 76.51Z\"/><path d=\"M0 83.58-7.1 96 7.1 96Z\"/><path d=\"M0-83.58 7.1-96-7.1-96\"/><path d=\"M83.58 0 96 7.1 96-7.1Z\"/><path d=\"M-83.58 0-96-7.1-96 7.1Z\"/></g></defs></svg>',ae={disc:{elmId:\"leader-line-disc\",noRotate:!0,bBox:{left:-5,top:-5,width:10,height:10,right:5,bottom:5},widthR:2.5,heightR:2.5,bCircle:5,sideLen:5,backLen:5,overhead:0,outlineBase:1,outlineMax:4},square:{elmId:\"leader-line-square\",noRotate:!0,bBox:{left:-5,top:-5,width:10,height:10,right:5,bottom:5},widthR:2.5,heightR:2.5,bCircle:5,sideLen:5,backLen:5,overhead:0,outlineBase:1,outlineMax:4},arrow1:{elmId:\"leader-line-arrow1\",bBox:{left:-8,top:-8,width:16,height:16,right:8,bottom:8},widthR:4,heightR:4,bCircle:8,sideLen:8,backLen:8,overhead:8,outlineBase:2,outlineMax:1.5},arrow2:{elmId:\"leader-line-arrow2\",bBox:{left:-7,top:-8,width:11,height:16,right:4,bottom:8},widthR:2.75,heightR:4,bCircle:8,sideLen:8,backLen:7,overhead:4,outlineBase:1,outlineMax:1.75},arrow3:{elmId:\"leader-line-arrow3\",bBox:{left:-4,top:-5,width:12,height:10,right:8,bottom:5},widthR:3,heightR:2.5,bCircle:8,sideLen:5,backLen:4,overhead:8,outlineBase:1,outlineMax:2.5},hand:{elmId:\"leader-line-hand\",bBox:{left:-3,top:-12,width:40,height:24,right:37,bottom:12},widthR:10,heightR:6,bCircle:37,sideLen:12,backLen:3,overhead:37},crosshair:{elmId:\"leader-line-crosshair\",noRotate:!0,bBox:{left:-96,top:-96,width:192,height:192,right:96,bottom:96},widthR:48,heightR:48,bCircle:96,sideLen:96,backLen:96,overhead:0}},j={behind:ne,disc:\"disc\",square:\"square\",arrow1:\"arrow1\",arrow2:\"arrow2\",arrow3:\"arrow3\",hand:\"hand\",crosshair:\"crosshair\"},ie={disc:\"disc\",square:\"square\",arrow1:\"arrow1\",arrow2:\"arrow2\",arrow3:\"arrow3\",hand:\"hand\",crosshair:\"crosshair\"},H=[V,P,N,T],U=\"auto\",oe={x:\"left\",y:\"top\",width:\"width\",height:\"height\"},Z=80,Y=4,X=5,q=120,Q=8,K=3.75,J=10,$=30,ee=.5522847,le=.25*Math.PI,m=/^\\s*(\\-?[\\d\\.]+)\\s*(\\%)?\\s*$/,re=\"http://www.w3.org/2000/svg\",S=\"-ms-scroll-limit\"in document.documentElement.style&&\"-ms-ime-align\"in document.documentElement.style&&!window.navigator.msPointerEnabled,se=!S&&!!document.uniqueID,ue=\"MozAppearance\"in document.documentElement.style,he=!(S||ue||!window.chrome||!window.CSS),pe=!S&&!se&&!ue&&!he&&!window.chrome&&\"WebkitAppearance\"in document.documentElement.style,ce=se||S?.2:.1,de={path:F,lineColor:\"coral\",lineSize:4,plugSE:[ne,\"arrow1\"],plugSizeSE:[1,1],lineOutlineEnabled:!1,lineOutlineColor:\"indianred\",lineOutlineSize:.25,plugOutlineEnabledSE:[!1,!1],plugOutlineSizeSE:[1,1]},fe=(s={}.toString,u={}.hasOwnProperty.toString,c=u.call(Object),function(e){var t,n;return e&&\"[object Object]\"===s.call(e)&&(!(t=Object.getPrototypeOf(e))||(n=t.hasOwnProperty(\"constructor\")&&t.constructor)&&\"function\"==typeof n&&u.call(n)===c)}),ye=Number.isFinite||function(e){return\"number\"==typeof e&&window.isFinite(e)},g=(x={ease:[.25,.1,.25,1],linear:[0,0,1,1],\"ease-in\":[.42,0,1,1],\"ease-out\":[0,0,.58,1],\"ease-in-out\":[.42,0,.58,1]},b=1e3/60/2,l=window.requestAnimationFrame||window.mozRequestAnimationFrame||window.webkitRequestAnimationFrame||window.msRequestAnimationFrame||function(e){setTimeout(e,b)},r=window.cancelAnimationFrame||window.mozCancelAnimationFrame||window.webkitCancelAnimationFrame||window.msCancelAnimationFrame||function(e){clearTimeout(e)},i=Number.isFinite||function(e){return\"number\"==typeof e&&window.isFinite(e)},k=[],w=0,{add:function(n,e,t,a,i,o,l){var r,s,u,h,p,c,d,f,y,m,S,g,_,v=++w;function E(e,t){return{value:n(t),timeRatio:e,outputRatio:t}}if(\"string\"==typeof i&&(i=x[i]),n=n||function(){},t<b)s=[E(0,0),E(1,1)];else{if(u=b/t,s=[E(0,0)],0===i[0]&&0===i[1]&&1===i[2]&&1===i[3])for(p=u;p<=1;p+=u)s.push(E(p,p));else for(c=h=(p=u)/10;c<=1;c+=h)_=g=S=m=y=void 0,m=(y=(f=c)*f)*f,_=3*(S=1-f)*y,p<=(d={x:(g=S*S*3*f)*i[0]+_*i[2]+m,y:g*i[1]+_*i[3]+m}).x&&(s.push(E(d.x,d.y)),p+=u);s.push(E(1,1))}return r={animId:v,frameCallback:e,duration:t,count:a,frames:s,reverse:!!o},k.push(r),!1!==l&&ke(r,l),v},remove:function(n){var a;k.some(function(e,t){return e.animId===n&&(a=t,!(e.framesStart=null))})&&k.splice(a,1)},start:function(t,n,a){k.some(function(e){return e.animId===t&&(e.reverse=!!n,ke(e,a),!0)})},stop:function(t,n){var a;return k.some(function(e){return e.animId===t&&(n?null!=e.lastFrame&&(a=e.frames[e.lastFrame].timeRatio):(a=(Date.now()-e.framesStart)/e.duration,e.reverse&&(a=1-a),a<0?a=0:1<a&&(a=1)),!(e.framesStart=null))}),a},validTiming:function(t){return\"string\"==typeof t?x[t]:Array.isArray(t)&&[0,1,2,3].every(function(e){return i(t[e])&&0<=t[e]&&t[e]<=1})?[t[0],t[1],t[2],t[3]]:null}}),_=function(e){e.SVGPathElement.prototype.getPathData&&e.SVGPathElement.prototype.setPathData||function(){function i(e){this._string=e,this._currentIndex=0,this._endIndex=this._string.length,this._prevCommand=null,this._skipOptionalSpaces()}var o={Z:\"Z\",M:\"M\",L:\"L\",C:\"C\",Q:\"Q\",A:\"A\",H:\"H\",V:\"V\",S:\"S\",T:\"T\",z:\"Z\",m:\"m\",l:\"l\",c:\"c\",q:\"q\",a:\"a\",h:\"h\",v:\"v\",s:\"s\",t:\"t\"},l=-1!==e.navigator.userAgent.indexOf(\"MSIE \");i.prototype={parseSegment:function(){var e=this._string[this._currentIndex],t=o[e]?o[e]:null;if(null===t){if(null===this._prevCommand)return null;if(null===(t=(\"+\"===e||\"-\"===e||\".\"===e||\"0\"<=e&&e<=\"9\")&&\"Z\"!==this._prevCommand?\"M\"===this._prevCommand?\"L\":\"m\"===this._prevCommand?\"l\":this._prevCommand:null))return null}else this._currentIndex+=1;var n=null,a=(this._prevCommand=t).toUpperCase();return\"H\"===a||\"V\"===a?n=[this._parseNumber()]:\"M\"===a||\"L\"===a||\"T\"===a?n=[this._parseNumber(),this._parseNumber()]:\"S\"===a||\"Q\"===a?n=[this._parseNumber(),this._parseNumber(),this._parseNumber(),this._parseNumber()]:\"C\"===a?n=[this._parseNumber(),this._parseNumber(),this._parseNumber(),this._parseNumber(),this._parseNumber(),this._parseNumber()]:\"A\"===a?n=[this._parseNumber(),this._parseNumber(),this._parseNumber(),this._parseArcFlag(),this._parseArcFlag(),this._parseNumber(),this._parseNumber()]:\"Z\"===a&&(this._skipOptionalSpaces(),n=[]),null===n||0<=n.indexOf(null)?null:{type:t,values:n}},hasMoreData:function(){return this._currentIndex<this._endIndex},peekSegmentType:function(){var e=this._string[this._currentIndex];return o[e]?o[e]:null},initialCommandIsMoveTo:function(){if(!this.hasMoreData())return!0;var e=this.peekSegmentType();return\"M\"===e||\"m\"===e},_isCurrentSpace:function(){var e=this._string[this._currentIndex];return e<=\" \"&&(\" \"===e||\"\\n\"===e||\"\\t\"===e||\"\\r\"===e||\"\\f\"===e)},_skipOptionalSpaces:function(){for(;this._currentIndex<this._endIndex&&this._isCurrentSpace();)this._currentIndex+=1;return this._currentIndex<this._endIndex},_skipOptionalSpacesOrDelimiter:function(){return!(this._currentIndex<this._endIndex&&!this._isCurrentSpace()&&\",\"!==this._string[this._currentIndex])&&(this._skipOptionalSpaces()&&this._currentIndex<this._endIndex&&\",\"===this._string[this._currentIndex]&&(this._currentIndex+=1,this._skipOptionalSpaces()),this._currentIndex<this._endIndex)},_parseNumber:function(){var e=0,t=0,n=1,a=0,i=1,o=1,l=this._currentIndex;if(this._skipOptionalSpaces(),this._currentIndex<this._endIndex&&\"+\"===this._string[this._currentIndex]?this._currentIndex+=1:this._currentIndex<this._endIndex&&\"-\"===this._string[this._currentIndex]&&(this._currentIndex+=1,i=-1),this._currentIndex===this._endIndex||(this._string[this._currentIndex]<\"0\"||\"9\"<this._string[this._currentIndex])&&\".\"!==this._string[this._currentIndex])return null;for(var r=this._currentIndex;this._currentIndex<this._endIndex&&\"0\"<=this._string[this._currentIndex]&&this._string[this._currentIndex]<=\"9\";)this._currentIndex+=1;if(this._currentIndex!==r)for(var s=this._currentIndex-1,u=1;r<=s;)t+=u*(this._string[s]-\"0\"),--s,u*=10;if(this._currentIndex<this._endIndex&&\".\"===this._string[this._currentIndex]){if(this._currentIndex+=1,this._currentIndex>=this._endIndex||this._string[this._currentIndex]<\"0\"||\"9\"<this._string[this._currentIndex])return null;for(;this._currentIndex<this._endIndex&&\"0\"<=this._string[this._currentIndex]&&this._string[this._currentIndex]<=\"9\";)n*=10,a+=(this._string.charAt(this._currentIndex)-\"0\")/n,this._currentIndex+=1}if(this._currentIndex!==l&&this._currentIndex+1<this._endIndex&&(\"e\"===this._string[this._currentIndex]||\"E\"===this._string[this._currentIndex])&&\"x\"!==this._string[this._currentIndex+1]&&\"m\"!==this._string[this._currentIndex+1]){if(this._currentIndex+=1,\"+\"===this._string[this._currentIndex]?this._currentIndex+=1:\"-\"===this._string[this._currentIndex]&&(this._currentIndex+=1,o=-1),this._currentIndex>=this._endIndex||this._string[this._currentIndex]<\"0\"||\"9\"<this._string[this._currentIndex])return null;for(;this._currentIndex<this._endIndex&&\"0\"<=this._string[this._currentIndex]&&this._string[this._currentIndex]<=\"9\";)e*=10,e+=this._string[this._currentIndex]-\"0\",this._currentIndex+=1}var h=t+a;return h*=i,e&&(h*=Math.pow(10,o*e)),l===this._currentIndex?null:(this._skipOptionalSpacesOrDelimiter(),h)},_parseArcFlag:function(){if(this._currentIndex>=this._endIndex)return null;var e=null,t=this._string[this._currentIndex];if(this._currentIndex+=1,\"0\"===t)e=0;else{if(\"1\"!==t)return null;e=1}return this._skipOptionalSpacesOrDelimiter(),e}};function a(e){if(!e||0===e.length)return[];var t=new i(e),n=[];if(t.initialCommandIsMoveTo())for(;t.hasMoreData();){var a=t.parseSegment();if(null===a)break;n.push(a)}return n}function r(e){return e.map(function(e){return{type:e.type,values:Array.prototype.slice.call(e.values)}})}function d(e){var m=[],S=null,g=null,_=null,v=null,E=null,x=null,b=null;return e.forEach(function(e){var t,n,a,i,o,l,r,s,u,h,p,c,d,f,y;\"M\"===e.type?(f=e.values[0],y=e.values[1],m.push({type:\"M\",values:[f,y]}),v=x=f,E=b=y):\"C\"===e.type?(a=e.values[0],i=e.values[1],t=e.values[2],n=e.values[3],f=e.values[4],y=e.values[5],m.push({type:\"C\",values:[a,i,t,n,f,y]}),g=t,_=n,v=f,E=y):\"L\"===e.type?(f=e.values[0],y=e.values[1],m.push({type:\"L\",values:[f,y]}),v=f,E=y):\"H\"===e.type?(f=e.values[0],m.push({type:\"L\",values:[f,E]}),v=f):\"V\"===e.type?(y=e.values[0],m.push({type:\"L\",values:[v,y]}),E=y):\"S\"===e.type?(t=e.values[0],n=e.values[1],f=e.values[2],y=e.values[3],l=\"C\"===S||\"S\"===S?(o=v+(v-g),E+(E-_)):(o=v,E),m.push({type:\"C\",values:[o,l,t,n,f,y]}),g=t,_=n,v=f,E=y):\"T\"===e.type?(f=e.values[0],y=e.values[1],i=\"Q\"===S||\"T\"===S?(a=v+(v-g),E+(E-_)):(a=v,E),o=v+2*(a-v)/3,l=E+2*(i-E)/3,r=f+2*(a-f)/3,s=y+2*(i-y)/3,m.push({type:\"C\",values:[o,l,r,s,f,y]}),g=a,_=i,v=f,E=y):\"Q\"===e.type?(a=e.values[0],i=e.values[1],f=e.values[2],y=e.values[3],o=v+2*(a-v)/3,l=E+2*(i-E)/3,r=f+2*(a-f)/3,s=y+2*(i-y)/3,m.push({type:\"C\",values:[o,l,r,s,f,y]}),g=a,_=i,v=f,E=y):\"A\"===e.type?(u=e.values[0],h=e.values[1],p=e.values[2],c=e.values[3],d=e.values[4],f=e.values[5],y=e.values[6],0===u||0===h?(m.push({type:\"C\",values:[v,E,f,y,f,y]}),v=f,E=y):v===f&&E===y||U(v,E,f,y,u,h,p,c,d).forEach(function(e){m.push({type:\"C\",values:e}),v=f,E=y})):\"Z\"===e.type&&(m.push(e),v=x,E=b),S=e.type}),m}var n=e.SVGPathElement.prototype.setAttribute,s=e.SVGPathElement.prototype.removeAttribute,f=e.Symbol?e.Symbol():\"__cachedPathData\",y=e.Symbol?e.Symbol():\"__cachedNormalizedPathData\",U=function(e,t,n,a,i,o,l,r,s,u){function h(e,t,n){return{x:e*Math.cos(n)-t*Math.sin(n),y:e*Math.sin(n)+t*Math.cos(n)}}var p,c,d,f,y,m,S,g,_,v,E,x,b,k,w,O=(p=l,Math.PI*p/180),M=[];u?(k=u[0],w=u[1],x=u[2],b=u[3]):(e=(c=h(e,t,-O)).x,t=c.y,1<(m=(f=(e-(n=(d=h(n,a,-O)).x))/2)*f/(i*i)+(y=(t-(a=d.y))/2)*y/(o*o))&&(i*=m=Math.sqrt(m),o*=m),_=(S=i*i)*(g=o*o)-S*y*y-g*f*f,v=S*y*y+g*f*f,x=(E=(r===s?-1:1)*Math.sqrt(Math.abs(_/v)))*i*y/o+(e+n)/2,b=E*-o*f/i+(t+a)/2,k=Math.asin(parseFloat(((t-b)/o).toFixed(9))),w=Math.asin(parseFloat(((a-b)/o).toFixed(9))),e<x&&(k=Math.PI-k),n<x&&(w=Math.PI-w),k<0&&(k=2*Math.PI+k),w<0&&(w=2*Math.PI+w),s&&w<k&&(k-=2*Math.PI),!s&&k<w&&(w-=2*Math.PI));var I,C,L,A=w-k;Math.abs(A)>120*Math.PI/180&&(I=w,C=n,L=a,w=s&&k<w?k+120*Math.PI/180*1:k+120*Math.PI/180*-1,n=x+i*Math.cos(w),a=b+o*Math.sin(w),M=U(n,a,C,L,i,o,l,0,s,[w,I,x,b])),A=w-k;var V=Math.cos(k),P=Math.sin(k),N=Math.cos(w),T=Math.sin(w),W=Math.tan(A/4),B=4/3*i*W,R=4/3*o*W,F=[e,t],G=[e+B*P,t-R*V],D=[n+B*T,a-R*N],z=[n,a];if(G[0]=2*F[0]-G[0],G[1]=2*F[1]-G[1],u)return[G,D,z].concat(M);M=[G,D,z].concat(M).join().split(\",\");var j=[],H=[];return M.forEach(function(e,t){t%2?H.push(h(M[t-1],M[t],O).y):H.push(h(M[t],M[t+1],O).x),6===H.length&&(j.push(H),H=[])}),j};e.SVGPathElement.prototype.setAttribute=function(e,t){\"d\"===e&&(this[f]=null,this[y]=null),n.call(this,e,t)},e.SVGPathElement.prototype.removeAttribute=function(e,t){\"d\"===e&&(this[f]=null,this[y]=null),s.call(this,e)},e.SVGPathElement.prototype.getPathData=function(e){if(e&&e.normalize){if(this[y])return r(this[y]);this[f]?n=r(this[f]):(n=a(this.getAttribute(\"d\")||\"\"),this[f]=r(n));var t=d((s=[],c=p=h=u=null,n.forEach(function(e){var t,n,a,i,o,l,r=e.type;\"M\"===r?(o=e.values[0],l=e.values[1],s.push({type:\"M\",values:[o,l]}),u=p=o,h=c=l):\"m\"===r?(o=u+e.values[0],l=h+e.values[1],s.push({type:\"M\",values:[o,l]}),u=p=o,h=c=l):\"L\"===r?(o=e.values[0],l=e.values[1],s.push({type:\"L\",values:[o,l]}),u=o,h=l):\"l\"===r?(o=u+e.values[0],l=h+e.values[1],s.push({type:\"L\",values:[o,l]}),u=o,h=l):\"C\"===r?(t=e.values[0],n=e.values[1],a=e.values[2],i=e.values[3],o=e.values[4],l=e.values[5],s.push({type:\"C\",values:[t,n,a,i,o,l]}),u=o,h=l):\"c\"===r?(t=u+e.values[0],n=h+e.values[1],a=u+e.values[2],i=h+e.values[3],o=u+e.values[4],l=h+e.values[5],s.push({type:\"C\",values:[t,n,a,i,o,l]}),u=o,h=l):\"Q\"===r?(t=e.values[0],n=e.values[1],o=e.values[2],l=e.values[3],s.push({type:\"Q\",values:[t,n,o,l]}),u=o,h=l):\"q\"===r?(t=u+e.values[0],n=h+e.values[1],o=u+e.values[2],l=h+e.values[3],s.push({type:\"Q\",values:[t,n,o,l]}),u=o,h=l):\"A\"===r?(o=e.values[5],l=e.values[6],s.push({type:\"A\",values:[e.values[0],e.values[1],e.values[2],e.values[3],e.values[4],o,l]}),u=o,h=l):\"a\"===r?(o=u+e.values[5],l=h+e.values[6],s.push({type:\"A\",values:[e.values[0],e.values[1],e.values[2],e.values[3],e.values[4],o,l]}),u=o,h=l):\"H\"===r?(o=e.values[0],s.push({type:\"H\",values:[o]}),u=o):\"h\"===r?(o=u+e.values[0],s.push({type:\"H\",values:[o]}),u=o):\"V\"===r?(l=e.values[0],s.push({type:\"V\",values:[l]}),h=l):\"v\"===r?(l=h+e.values[0],s.push({type:\"V\",values:[l]}),h=l):\"S\"===r?(a=e.values[0],i=e.values[1],o=e.values[2],l=e.values[3],s.push({type:\"S\",values:[a,i,o,l]}),u=o,h=l):\"s\"===r?(a=u+e.values[0],i=h+e.values[1],o=u+e.values[2],l=h+e.values[3],s.push({type:\"S\",values:[a,i,o,l]}),u=o,h=l):\"T\"===r?(o=e.values[0],l=e.values[1],s.push({type:\"T\",values:[o,l]}),u=o,h=l):\"t\"===r?(o=u+e.values[0],l=h+e.values[1],s.push({type:\"T\",values:[o,l]}),u=o,h=l):\"Z\"!==r&&\"z\"!==r||(s.push({type:\"Z\",values:[]}),u=p,h=c)}),s));return this[y]=r(t),t}if(this[f])return r(this[f]);var s,u,h,p,c,n=a(this.getAttribute(\"d\")||\"\");return this[f]=r(n),n},e.SVGPathElement.prototype.setPathData=function(e){if(0===e.length)l?this.setAttribute(\"d\",\"\"):this.removeAttribute(\"d\");else{for(var t=\"\",n=0,a=e.length;n<a;n+=1){var i=e[n];0<n&&(t+=\" \"),t+=i.type,i.values&&0<i.values.length&&(t+=\" \"+i.values.join(\" \"))}this.setAttribute(\"d\",t)}},e.SVGRectElement.prototype.getPathData=function(e){var t=this.x.baseVal.value,n=this.y.baseVal.value,a=this.width.baseVal.value,i=this.height.baseVal.value,o=this.hasAttribute(\"rx\")?this.rx.baseVal.value:this.ry.baseVal.value,l=this.hasAttribute(\"ry\")?this.ry.baseVal.value:this.rx.baseVal.value;a/2<o&&(o=a/2),i/2<l&&(l=i/2);var r=(r=[{type:\"M\",values:[t+o,n]},{type:\"H\",values:[t+a-o]},{type:\"A\",values:[o,l,0,0,1,t+a,n+l]},{type:\"V\",values:[n+i-l]},{type:\"A\",values:[o,l,0,0,1,t+a-o,n+i]},{type:\"H\",values:[t+o]},{type:\"A\",values:[o,l,0,0,1,t,n+i-l]},{type:\"V\",values:[n+l]},{type:\"A\",values:[o,l,0,0,1,t+o,n]},{type:\"Z\",values:[]}]).filter(function(e){return\"A\"!==e.type||0!==e.values[0]&&0!==e.values[1]});return e&&!0===e.normalize&&(r=d(r)),r},e.SVGCircleElement.prototype.getPathData=function(e){var t=this.cx.baseVal.value,n=this.cy.baseVal.value,a=this.r.baseVal.value,i=[{type:\"M\",values:[t+a,n]},{type:\"A\",values:[a,a,0,0,1,t,n+a]},{type:\"A\",values:[a,a,0,0,1,t-a,n]},{type:\"A\",values:[a,a,0,0,1,t,n-a]},{type:\"A\",values:[a,a,0,0,1,t+a,n]},{type:\"Z\",values:[]}];return e&&!0===e.normalize&&(i=d(i)),i},e.SVGEllipseElement.prototype.getPathData=function(e){var t=this.cx.baseVal.value,n=this.cy.baseVal.value,a=this.rx.baseVal.value,i=this.ry.baseVal.value,o=[{type:\"M\",values:[t+a,n]},{type:\"A\",values:[a,i,0,0,1,t,n+i]},{type:\"A\",values:[a,i,0,0,1,t-a,n]},{type:\"A\",values:[a,i,0,0,1,t,n-i]},{type:\"A\",values:[a,i,0,0,1,t+a,n]},{type:\"Z\",values:[]}];return e&&!0===e.normalize&&(o=d(o)),o},e.SVGLineElement.prototype.getPathData=function(){return[{type:\"M\",values:[this.x1.baseVal.value,this.y1.baseVal.value]},{type:\"L\",values:[this.x2.baseVal.value,this.y2.baseVal.value]}]},e.SVGPolylineElement.prototype.getPathData=function(){for(var e=[],t=0;t<this.points.numberOfItems;t+=1){var n=this.points.getItem(t);e.push({type:0===t?\"M\":\"L\",values:[n.x,n.y]})}return e},e.SVGPolygonElement.prototype.getPathData=function(){for(var e=[],t=0;t<this.points.numberOfItems;t+=1){var n=this.points.getItem(t);e.push({type:0===t?\"M\":\"L\",values:[n.x,n.y]})}return e.push({type:\"Z\",values:[]}),e}}()},v=(a={},xe.m=n=[function(e,t,n){n.r(t);var a=500,i=[],o=window.requestAnimationFrame||window.mozRequestAnimationFrame||window.webkitRequestAnimationFrame||window.msRequestAnimationFrame||function(e){return setTimeout(e,1e3/60)},l=window.cancelAnimationFrame||window.mozCancelAnimationFrame||window.webkitCancelAnimationFrame||window.msCancelAnimationFrame||function(e){return clearTimeout(e)},r=Date.now(),s=void 0;function u(){var n=void 0,e=void 0;s&&(l.call(window,s),s=null),i.forEach(function(e){var t;(t=e.event)&&(e.event=null,e.listener(t),n=!0)}),n?(r=Date.now(),e=!0):Date.now()-r<a&&(e=!0),e&&(s=o.call(window,u))}function h(n){var a=-1;return i.some(function(e,t){return e.listener===n&&(a=t,!0)}),a}var p={add:function(e){var t=void 0;return-1===h(e)?(i.push(t={listener:e}),function(e){t.event=e,s||u()}):null},remove:function(e){var t;-1<(t=h(e))&&(i.splice(t,1),!i.length&&s&&(l.call(window,s),s=null))}};t.default=p}],xe.c=a,xe.d=function(e,t,n){xe.o(e,t)||Object.defineProperty(e,t,{enumerable:!0,get:n})},xe.r=function(e){\"undefined\"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(e,Symbol.toStringTag,{value:\"Module\"}),Object.defineProperty(e,\"__esModule\",{value:!0})},xe.t=function(t,e){if(1&e&&(t=xe(t)),8&e)return t;if(4&e&&\"object\"==typeof t&&t&&t.__esModule)return t;var n=Object.create(null);if(xe.r(n),Object.defineProperty(n,\"default\",{enumerable:!0,value:t}),2&e&&\"string\"!=typeof t)for(var a in t)xe.d(n,a,function(e){return t[e]}.bind(null,a));return n},xe.n=function(e){var t=e&&e.__esModule?function(){return e.default}:function(){return e};return xe.d(t,\"a\",t),t},xe.o=function(e,t){return Object.prototype.hasOwnProperty.call(e,t)},xe.p=\"\",xe(xe.s=0).default),me={line_altColor:{iniValue:!1},line_color:{},line_colorTra:{iniValue:!1},line_strokeWidth:{},plug_enabled:{iniValue:!1},plug_enabledSE:{hasSE:!0,iniValue:!1},plug_plugSE:{hasSE:!0,iniValue:ne},plug_colorSE:{hasSE:!0},plug_colorTraSE:{hasSE:!0,iniValue:!1},plug_markerWidthSE:{hasSE:!0},plug_markerHeightSE:{hasSE:!0},lineOutline_enabled:{iniValue:!1},lineOutline_color:{},lineOutline_colorTra:{iniValue:!1},lineOutline_strokeWidth:{},lineOutline_inStrokeWidth:{},plugOutline_enabledSE:{hasSE:!0,iniValue:!1},plugOutline_plugSE:{hasSE:!0,iniValue:ne},plugOutline_colorSE:{hasSE:!0},plugOutline_colorTraSE:{hasSE:!0,iniValue:!1},plugOutline_strokeWidthSE:{hasSE:!0},plugOutline_inStrokeWidthSE:{hasSE:!0},position_socketXYSE:{hasSE:!0,hasProps:!0},position_plugOverheadSE:{hasSE:!0},position_path:{},position_lineStrokeWidth:{},position_socketGravitySE:{hasSE:!0},path_pathData:{},path_edge:{hasProps:!0},viewBox_bBox:{hasProps:!0},viewBox_plugBCircleSE:{hasSE:!0},lineMask_enabled:{iniValue:!1},lineMask_outlineMode:{iniValue:!1},lineMask_x:{},lineMask_y:{},lineOutlineMask_x:{},lineOutlineMask_y:{},maskBGRect_x:{},maskBGRect_y:{},capsMaskAnchor_enabledSE:{hasSE:!0,iniValue:!1},capsMaskAnchor_pathDataSE:{hasSE:!0},capsMaskAnchor_strokeWidthSE:{hasSE:!0},capsMaskMarker_enabled:{iniValue:!1},capsMaskMarker_enabledSE:{hasSE:!0,iniValue:!1},capsMaskMarker_plugSE:{hasSE:!0,iniValue:ne},capsMaskMarker_markerWidthSE:{hasSE:!0},capsMaskMarker_markerHeightSE:{hasSE:!0},caps_enabled:{iniValue:!1},attach_plugSideLenSE:{hasSE:!0},attach_plugBackLenSE:{hasSE:!0}},E={show_on:{},show_effect:{},show_animOptions:{},show_animId:{},show_inAnim:{}},O=\"fade\",Se=[],ge={},_e=0,ve={},Ee=0;function xe(e){if(a[e])return a[e].exports;var t=a[e]={i:e,l:!1,exports:{}};return n[e].call(t.exports,t,t.exports,xe),t.l=!0,t.exports}function be(){var i=Date.now(),o=!1;e&&(r.call(window,e),e=null),k.forEach(function(e){var t,n,a;if(e.framesStart){if((t=i-e.framesStart)>=e.duration&&e.count&&e.loopsLeft<=1)return a=e.frames[e.lastFrame=e.reverse?0:e.frames.length-1],e.frameCallback(a.value,!0,a.timeRatio,a.outputRatio),void(e.framesStart=null);if(t>e.duration){if(n=Math.floor(t/e.duration),e.count){if(n>=e.loopsLeft)return a=e.frames[e.lastFrame=e.reverse?0:e.frames.length-1],e.frameCallback(a.value,!0,a.timeRatio,a.outputRatio),void(e.framesStart=null);e.loopsLeft-=n}e.framesStart+=e.duration*n,t=i-e.framesStart}e.reverse&&(t=e.duration-t),a=e.frames[e.lastFrame=Math.round(t/b)],!1!==e.frameCallback(a.value,!1,a.timeRatio,a.outputRatio)?o=!0:e.framesStart=null}}),o&&(e=l.call(window,be))}function ke(e,t){e.framesStart=Date.now(),null!=t&&(e.framesStart-=e.duration*(e.reverse?1-t:t)),e.loopsLeft=e.count,e.lastFrame=null,be()}function we(t,n){var e,a;return typeof t!=typeof n||(e=fe(t)?\"obj\":Array.isArray(t)?\"array\":\"\")!=(fe(n)?\"obj\":Array.isArray(n)?\"array\":\"\")||(\"obj\"===e?we(a=Object.keys(t).sort(),Object.keys(n).sort())||a.some(function(e){return we(t[e],n[e])}):\"array\"===e?t.length!==n.length||t.some(function(e,t){return we(e,n[t])}):t!==n)}function Oe(n){return n?fe(n)?Object.keys(n).reduce(function(e,t){return e[t]=Oe(n[t]),e},{}):Array.isArray(n)?n.map(Oe):n:n}function Me(e){var t,n,a,i=1,o=e=(e+\"\").trim();function l(e){var t=1,n=m.exec(e);return n&&(t=parseFloat(n[1]),n[2]?t=0<=t&&t<=100?t/100:1:(t<0||1<t)&&(t=1)),t}return(t=/^(rgba|hsla|hwb|gray|device\\-cmyk)\\s*\\(([\\s\\S]+)\\)$/i.exec(e))?(n=t[1].toLowerCase(),a=t[2].trim().split(/\\s*,\\s*/),\"rgba\"===n&&4===a.length?(i=l(a[3]),o=\"rgb(\"+a.slice(0,3).join(\", \")+\")\"):\"hsla\"===n&&4===a.length?(i=l(a[3]),o=\"hsl(\"+a.slice(0,3).join(\", \")+\")\"):\"hwb\"===n&&4===a.length?(i=l(a[3]),o=\"hwb(\"+a.slice(0,3).join(\", \")+\")\"):\"gray\"===n&&2===a.length?(i=l(a[1]),o=\"gray(\"+a[0]+\")\"):\"device-cmyk\"===n&&5<=a.length&&(i=l(a[4]),o=\"device-cmyk(\"+a.slice(0,4).join(\", \")+\")\")):(t=/^\\#(?:([\\da-f]{6})([\\da-f]{2})|([\\da-f]{3})([\\da-f]))$/i.exec(e))?o=t[1]?(i=parseInt(t[2],16)/255,\"#\"+t[1]):(i=parseInt(t[4]+t[4],16)/255,\"#\"+t[3]):\"transparent\"===e.toLocaleLowerCase()&&(i=0),[i,o]}function Ie(e){return!(!e||e.nodeType!==Node.ELEMENT_NODE||\"function\"!=typeof e.getBoundingClientRect)}function Ce(e,t){var n,a,i,o,l={};if(!(i=e.ownerDocument))return console.error(\"Cannot get document that contains the element.\"),null;if(e.compareDocumentPosition(i)&Node.DOCUMENT_POSITION_DISCONNECTED)return console.error(\"A disconnected element was passed.\"),null;for(a in n=e.getBoundingClientRect())l[a]=n[a];if(!t){if(!(o=i.defaultView))return console.error(\"Cannot get window that contains the element.\"),null;l.left+=o.pageXOffset,l.right+=o.pageXOffset,l.top+=o.pageYOffset,l.bottom+=o.pageYOffset}return l}function Le(e,t){var n,a,i=[],o=e;for(t=t||window;;){if(!(n=o.ownerDocument))return console.error(\"Cannot get document that contains the element.\"),null;if(!(a=n.defaultView))return console.error(\"Cannot get window that contains the element.\"),null;if(a===t)break;if(!(o=a.frameElement))return console.error(\"`baseWindow` was not found.\"),null;i.unshift(o)}return i}function Ae(e,t){var n,a,o=0,l=0;return(a=Le(e,t=t||window))?a.length?(a.forEach(function(e,t){var n,a,i=Ce(e,0<t);o+=i.left,l+=i.top,a=(n=e).ownerDocument.defaultView.getComputedStyle(n,\"\"),i={left:n.clientLeft+parseFloat(a.paddingLeft),top:n.clientTop+parseFloat(a.paddingTop)},o+=i.left,l+=i.top}),(n=Ce(e,!0)).left+=o,n.right+=o,n.top+=l,n.bottom+=l,n):Ce(e):null}function Ve(e,t){var n=e.x-t.x,a=e.y-t.y;return Math.sqrt(n*n+a*a)}function Pe(e,t,n){var a=t.x-e.x,i=t.y-e.y;return{x:e.x+a*n,y:e.y+i*n,angle:Math.atan2(i,a)/(Math.PI/180)}}function Ne(e,t,n){var a=Math.atan2(e.y-t.y,t.x-e.x);return{x:t.x+Math.cos(a)*n,y:t.y+Math.sin(a)*n*-1}}function Te(e,t,n,a,i){var o=i*i,l=o*i,r=1-i,s=r*r,u=s*r,h=u*e.x+3*s*i*t.x+3*r*o*n.x+l*a.x,p=u*e.y+3*s*i*t.y+3*r*o*n.y+l*a.y,c=e.x+2*i*(t.x-e.x)+o*(n.x-2*t.x+e.x),d=e.y+2*i*(t.y-e.y)+o*(n.y-2*t.y+e.y),f=t.x+2*i*(n.x-t.x)+o*(a.x-2*n.x+t.x),y=t.y+2*i*(n.y-t.y)+o*(a.y-2*n.y+t.y),m=r*e.x+i*t.x,S=r*e.y+i*t.y,g=r*n.x+i*a.x,_=r*n.y+i*a.y,v=90-180*Math.atan2(c-f,d-y)/Math.PI;return{x:h,y:p,fromP2:{x:c,y:d},toP1:{x:f,y:y},fromP1:{x:m,y:S},toP2:{x:g,y:_},angle:v+=180<v?-180:180}}function We(n,a,i,o,e){function l(e,t,n,a,i){return e*(e*(-3*t+9*n-9*a+3*i)+6*t-12*n+6*a)-3*t+3*n}var r,s,u,h,p=[.2491,.2491,.2335,.2335,.2032,.2032,.1601,.1601,.1069,.1069,.0472,.0472],c=0,d=(e=null==e||1<e?1:e<0?0:e)/2;return[-.1252,.1252,-.3678,.3678,-.5873,.5873,-.7699,.7699,-.9041,.9041,-.9816,.9816].forEach(function(e,t){s=l(r=d*e+d,n.x,a.x,i.x,o.x),u=l(r,n.y,a.y,i.y,o.y),h=s*s+u*u,c+=p[t]*Math.sqrt(h)}),d*c}function Be(e,t,n,a,i){for(var o,l=.5,r=1-l;o=We(e,t,n,a,r),!(Math.abs(o-i)<=.01);)r+=(o<i?1:-1)*(l/=2);return r}function Re(e,n){var a;return e.forEach(function(e){var t=n?e.map(function(e){var t={x:e.x,y:e.y};return n(t),t}):e;(a=a||[{type:\"M\",values:[t[0].x,t[0].y]}]).push(t.length?2===t.length?{type:\"L\",values:[t[1].x,t[1].y]}:{type:\"C\",values:[t[1].x,t[1].y,t[2].x,t[2].y,t[3].x,t[3].y]}:{type:\"Z\",values:[]})}),a}function Fe(e){var n=[],a=0;return e.forEach(function(e){var t=(2===e.length?Ve:We).apply(null,e);n.push(t),a+=t}),{segsLen:n,lenAll:a}}function Ge(e,a){return null==e||null==a||e.length!==a.length||e.some(function(e,t){var n=a[t];return e.type!==n.type||e.values.some(function(e,t){return e!==n.values[t]})})}function De(e,t,n){e.events[t]?e.events[t].indexOf(n)<0&&e.events[t].push(n):e.events[t]=[n]}function ze(e,t,n){var a;e.events[t]&&-1<(a=e.events[t].indexOf(n))&&e.events[t].splice(a,1)}function je(e){t&&clearTimeout(t),Se.push(e),t=setTimeout(function(){Se.forEach(function(e){e()}),Se=[]},0)}function He(e,t){e.reflowTargets.indexOf(t)<0&&e.reflowTargets.push(t)}function Ue(e){e.reflowTargets.forEach(function(e){var n;n=e,setTimeout(function(){var e=n.parentNode,t=n.nextSibling;e.insertBefore(e.removeChild(n),t)},0)}),e.reflowTargets=[]}function Ze(e,t,n,a,i,o,l){var r,s,u;\"auto-start-reverse\"===n?(\"boolean\"!=typeof h&&(t.setAttribute(\"orient\",\"auto-start-reverse\"),h=t.orientType.baseVal===SVGMarkerElement.SVG_MARKER_ORIENT_UNKNOWN),h?t.setAttribute(\"orient\",n):((r=i.createSVGTransform()).setRotate(180,0,0),o.transform.baseVal.appendItem(r),t.setAttribute(\"orient\",\"auto\"),u=!0)):(t.setAttribute(\"orient\",n),!1===h&&o.transform.baseVal.clear()),s=t.viewBox.baseVal,u?(s.x=-a.right,s.y=-a.bottom):(s.x=a.left,s.y=a.top),s.width=a.width,s.height=a.height,se&&He(e,l)}function Ye(e,t){return{prop:e?\"markerEnd\":\"markerStart\",orient:t?t.noRotate?\"0\":e?\"auto\":\"auto-start-reverse\":null}}function Xe(n,a){Object.keys(a).forEach(function(e){var t=a[e];n[e]=null!=t.iniValue?t.hasSE?[t.iniValue,t.iniValue]:t.iniValue:t.hasSE?t.hasProps?[{},{}]:[]:t.hasProps?{}:null})}function qe(t,e,n,a,i){return a!==e[n]&&(e[n]=a,i&&i.forEach(function(e){e(t,a,n)}),!0)}function Qe(e){function t(e,t){return e+parseFloat(t)}var n=e.document,a=e.getComputedStyle(n.documentElement,\"\"),i=e.getComputedStyle(n.body,\"\"),o={x:0,y:0};return\"static\"!==i.position?(o.x-=[a.marginLeft,a.borderLeftWidth,a.paddingLeft,i.marginLeft,i.borderLeftWidth].reduce(t,0),o.y-=[a.marginTop,a.borderTopWidth,a.paddingTop,i.marginTop,i.borderTopWidth].reduce(t,0)):\"static\"!==a.position&&(o.x-=[a.marginLeft,a.borderLeftWidth].reduce(t,0),o.y-=[a.marginTop,a.borderTopWidth].reduce(t,0)),o}function Ke(e){var t,n=e.document;n.getElementById(d)||(t=(new e.DOMParser).parseFromString(y,\"image/svg+xml\"),n.body.appendChild(t.documentElement),_(e))}function Je(u){var _,f,v,e,n,a,i,y,s,h,p,t,o,l,r,c,d,m,S,g=u.options,E=u.curStats,x=u.aplStats,b=E.position_socketXYSE,k=!1;function w(e,t){var n=t===V?{x:e.left+e.width/2,y:e.top}:t===P?{x:e.right,y:e.top+e.height/2}:t===N?{x:e.left+e.width/2,y:e.bottom}:{x:e.left,y:e.top+e.height/2};return n.socketId=t,n}function O(e){return{x:e.x,y:e.y}}if(E.position_path=g.path,E.position_lineStrokeWidth=E.line_strokeWidth,E.position_socketGravitySE=_=Oe(g.socketGravitySE),f=[0,1].map(function(e){var t,n,a,i=g.anchorSE[e],o=u.optionIsAttach.anchorSE[e],l=!1!==o?ve[i._id]:null,r=!1!==o&&l.conf.getStrokeWidth?l.conf.getStrokeWidth(l,u):0,s=!1!==o&&l.conf.getBBoxNest?l.conf.getBBoxNest(l,u,r):Ae(i,u.baseWindow);return E.capsMaskAnchor_pathDataSE[e]=!1!==o&&l.conf.getPathData?l.conf.getPathData(l,u,r):(n=null!=(t=s).right?t.right:t.left+t.width,a=null!=t.bottom?t.bottom:t.top+t.height,[{type:\"M\",values:[t.left,t.top]},{type:\"L\",values:[n,t.top]},{type:\"L\",values:[n,a]},{type:\"L\",values:[t.left,a]},{type:\"Z\",values:[]}]),E.capsMaskAnchor_strokeWidthSE[e]=r,s}),i=-1,g.socketSE[0]&&g.socketSE[1]?(b[0]=w(f[0],g.socketSE[0]),b[1]=w(f[1],g.socketSE[1])):(g.socketSE[0]||g.socketSE[1]?(a=g.socketSE[0]?(n=0,1):(n=1,0),b[n]=w(f[n],g.socketSE[n]),(e=H.map(function(e){return w(f[a],e)})).forEach(function(e){var t=Ve(e,b[n]);(t<i||-1===i)&&(b[a]=e,i=t)})):(e=H.map(function(e){return w(f[1],e)}),H.map(function(e){return w(f[0],e)}).forEach(function(n){e.forEach(function(e){var t=Ve(n,e);(t<i||-1===i)&&(b[0]=n,b[1]=e,i=t)})})),[0,1].forEach(function(e){var t,n;g.socketSE[e]||(f[e].width||f[e].height?f[e].width||b[e].socketId!==T&&b[e].socketId!==P?f[e].height||b[e].socketId!==V&&b[e].socketId!==N||(b[e].socketId=0<=b[e?0:1].y-f[e].top?N:V):b[e].socketId=0<=b[e?0:1].x-f[e].left?P:T:(t=b[e?0:1].x-f[e].left,n=b[e?0:1].y-f[e].top,b[e].socketId=Math.abs(t)>=Math.abs(n)?0<=t?P:T:0<=n?N:V))})),E.position_path!==x.position_path||E.position_lineStrokeWidth!==x.position_lineStrokeWidth||[0,1].some(function(e){return E.position_plugOverheadSE[e]!==x.position_plugOverheadSE[e]||(i=b[e],o=x.position_socketXYSE[e],i.x!==o.x||i.y!==o.y||i.socketId!==o.socketId)||(t=_[e],n=x.position_socketGravitySE[e],(a=null==t?\"auto\":Array.isArray(t)?\"array\":\"number\")!=(null==n?\"auto\":Array.isArray(n)?\"array\":\"number\")||(\"array\"==a?t[0]!==n[0]||t[1]!==n[1]:t!==n));var t,n,a,i,o})){switch(u.pathList.baseVal=v=[],u.pathList.animVal=null,E.position_path){case B:v.push([O(b[0]),O(b[1])]);break;case R:t=\"number\"==typeof _[0]&&0<_[0]||\"number\"==typeof _[1]&&0<_[1],o=le*(t?-1:1),l=Math.atan2(b[1].y-b[0].y,b[1].x-b[0].x),r=o-l,c=Math.PI-l-o,d=Ve(b[0],b[1])/Math.sqrt(2)*ee,m={x:b[0].x+Math.cos(r)*d,y:b[0].y+Math.sin(r)*d*-1},S={x:b[1].x+Math.cos(c)*d,y:b[1].y+Math.sin(c)*d*-1},v.push([O(b[0]),m,S,O(b[1])]);break;case F:case G:s=[_[0],E.position_path===G?0:_[1]],h=[],p=[],b.forEach(function(e,t){var n,a,i,o,l=s[t],r=Array.isArray(l)?{x:l[0],y:l[1]}:\"number\"==typeof l?e.socketId===V?{x:0,y:-l}:e.socketId===P?{x:l,y:0}:e.socketId===N?{x:0,y:l}:{x:-l,y:0}:(n=b[t?0:1],i=0<(a=E.position_plugOverheadSE[t])?q+(Q<a?(a-Q)*K:0):Z+(E.position_lineStrokeWidth>Y?(E.position_lineStrokeWidth-Y)*X:0),e.socketId===V?((o=(e.y-n.y)/2)<i&&(o=i),{x:0,y:-o}):e.socketId===P?((o=(n.x-e.x)/2)<i&&(o=i),{x:o,y:0}):e.socketId===N?((o=(n.y-e.y)/2)<i&&(o=i),{x:0,y:o}):((o=(e.x-n.x)/2)<i&&(o=i),{x:-o,y:0}));h[t]=e.x+r.x,p[t]=e.y+r.y}),v.push([O(b[0]),{x:h[0],y:p[0]},{x:h[1],y:p[1]},O(b[1])]);break;case D:!function(){var a,o=1,l=2,r=3,s=4,u=[[],[]],h=[];function p(e){return e===o?r:e===l?s:e===r?o:l}function c(e){return e===l||e===s?\"x\":\"y\"}function d(e,t,n){var a={x:e.x,y:e.y};if(n){if(n===p(e.dirId))throw new Error(\"Invalid dirId: \"+n);a.dirId=n}else a.dirId=e.dirId;return a.dirId===o?a.y-=t:a.dirId===l?a.x+=t:a.dirId===r?a.y+=t:a.x-=t,a}function f(e,t){return t.dirId===o?e.y<=t.y:t.dirId===l?e.x>=t.x:t.dirId===r?e.y>=t.y:e.x<=t.x}function y(e,t){return t.dirId===o||t.dirId===r?e.x===t.x:e.y===t.y}function m(e){return e[0]?{contain:0,notContain:1}:{contain:1,notContain:0}}function S(e,t,n){return Math.abs(t[n]-e[n])}function g(e,t,n){return\"x\"===n?e.x<t.x?l:s:e.y<t.y?r:o}for(b.forEach(function(e,t){var n,a=O(e),i=_[t];n=Array.isArray(i)?i[0]<0?[s,-i[0]]:0<i[0]?[l,i[0]]:i[1]<0?[o,-i[1]]:0<i[1]?[r,i[1]]:[e.socketId,0]:\"number\"!=typeof i?[e.socketId,$]:0<=i?[e.socketId,i]:[p(e.socketId),-i],a.dirId=n[0],i=n[1],u[t].push(a),h[t]=d(a,i)});function(){var e,t,a,i,n=[f(h[1],h[0]),f(h[0],h[1])],o=[c(h[0].dirId),c(h[1].dirId)];if(o[0]===o[1]){if(n[0]&&n[1])return void(y(h[1],h[0])||(h[0][o[0]]===h[1][o[1]]?(u[0].push(h[0]),u[1].push(h[1])):(e=h[0][o[0]]+(h[1][o[1]]-h[0][o[0]])/2,u[0].push(d(h[0],Math.abs(e-h[0][o[0]]))),u[1].push(d(h[1],Math.abs(e-h[1][o[1]]))))));n[0]!==n[1]?(t=m(n),(a=S(h[t.notContain],h[t.contain],o[t.notContain]))<$&&(h[t.notContain]=d(h[t.notContain],$-a)),u[t.notContain].push(h[t.notContain]),h[t.notContain]=d(h[t.notContain],$,y(h[t.contain],h[t.notContain])?\"x\"===o[t.notContain]?r:l:g(h[t.notContain],h[t.contain],\"x\"===o[t.notContain]?\"y\":\"x\"))):(a=S(h[0],h[1],\"x\"===o[0]?\"y\":\"x\"),u.forEach(function(e,t){var n=0===t?1:0;e.push(h[t]),h[t]=d(h[t],$,2*$<=a?g(h[t],h[n],\"x\"===o[t]?\"y\":\"x\"):\"x\"===o[t]?r:l)}))}else{if(n[0]&&n[1])return void(y(h[1],h[0])?u[1].push(h[1]):y(h[0],h[1])?u[0].push(h[0]):u[0].push(\"x\"===o[0]?{x:h[1].x,y:h[0].y}:{x:h[0].x,y:h[1].y}));n[0]!==n[1]?(t=m(n),u[t.notContain].push(h[t.notContain]),h[t.notContain]=d(h[t.notContain],$,S(h[t.notContain],h[t.contain],o[t.contain])>=$?g(h[t.notContain],h[t.contain],o[t.contain]):h[t.contain].dirId)):(i=[{x:h[0].x,y:h[0].y},{x:h[1].x,y:h[1].y}],u.forEach(function(e,t){var n=0===t?1:0,a=S(i[t],i[n],o[t]);a<$&&(h[t]=d(h[t],$-a)),e.push(h[t]),h[t]=d(h[t],$,g(h[t],h[n],o[n]))}))}return 1}(););u[1].reverse(),u[0].concat(u[1]).forEach(function(e,t){var n={x:e.x,y:e.y};0<t&&v.push([a,n]),a=n})}()}y=[],E.position_plugOverheadSE.forEach(function(e,t){var n,a,i,o,l,r,s,u,h,p,c,d=!t;0<e?2===(n=v[a=d?0:v.length-1]).length?(y[a]=y[a]||Ve.apply(null,n),y[a]>J&&(y[a]-e<J&&(e=y[a]-J),i=Pe(n[0],n[1],(d?e:y[a]-e)/y[a]),v[a]=d?[i,n[1]]:[n[0],i],y[a]-=e)):(y[a]=y[a]||We.apply(null,n),y[a]>J&&(y[a]-e<J&&(e=y[a]-J),i=Te(n[0],n[1],n[2],n[3],Be(n[0],n[1],n[2],n[3],d?e:y[a]-e)),l=d?(o=n[0],i.toP1):(o=n[3],i.fromP2),r=Math.atan2(o.y-i.y,i.x-o.x),s=Ve(i,l),i.x=o.x+Math.cos(r)*e,i.y=o.y+Math.sin(r)*e*-1,l.x=i.x+Math.cos(r)*s,l.y=i.y+Math.sin(r)*s*-1,v[a]=d?[i,i.toP1,i.toP2,n[3]]:[n[0],i.fromP1,i.fromP2,i],y[a]=null)):e<0&&(n=v[a=d?0:v.length-1],u=b[t].socketId,h=u===T||u===P?\"x\":\"y\",e<(c=-f[t][\"x\"==h?\"width\":\"height\"])&&(e=c),p=e*(u===T||u===V?-1:1),2===n.length?n[d?0:n.length-1][h]+=p:(d?[0,1]:[n.length-2,n.length-1]).forEach(function(e){n[e][h]+=p}),y[a]=null)}),x.position_socketXYSE=Oe(b),x.position_plugOverheadSE=Oe(E.position_plugOverheadSE),x.position_path=E.position_path,x.position_lineStrokeWidth=E.position_lineStrokeWidth,x.position_socketGravitySE=Oe(_),k=!0,u.events.apl_position&&u.events.apl_position.forEach(function(e){e(u,v)})}return k}function $e(t,n){n!==t.isShown&&(!!n!=!!t.isShown&&(t.svg.style.visibility=n?\"\":\"hidden\"),t.isShown=n,t.events&&t.events.svgShow&&t.events.svgShow.forEach(function(e){e(t,n)}))}function et(e,t){var n,a,i,o,l,h,p,c,d,f,r,s,u,y,m,S,g,_,v,E,x,b,k,w,O,M,I,C,L,A,V,P,N,T,W,B,R,F,G,D,z,j,H,U,Z,Y,X,q,Q,K,J,$,ee={};t.line&&(ee.line=(a=(n=e).options,i=n.curStats,o=n.events,l=!1,l=qe(n,i,\"line_color\",a.lineColor,o.cur_line_color)||l,l=qe(n,i,\"line_colorTra\",Me(i.line_color)[0]<1)||l,l=qe(n,i,\"line_strokeWidth\",a.lineSize,o.cur_line_strokeWidth)||l)),(t.plug||ee.line)&&(ee.plug=(p=(h=e).options,c=h.curStats,d=h.events,f=!1,[0,1].forEach(function(e){var t,n,a,i,o,l,r,s,u=p.plugSE[e];f=qe(h,c.plug_enabledSE,e,u!==ne)||f,f=qe(h,c.plug_plugSE,e,u)||f,f=qe(h,c.plug_colorSE,e,s=p.plugColorSE[e]||c.line_color,d.cur_plug_colorSE)||f,f=qe(h,c.plug_colorTraSE,e,Me(s)[0]<1)||f,u!==ne&&(i=n=(t=ae[ie[u]]).widthR*p.plugSizeSE[e],o=a=t.heightR*p.plugSizeSE[e],pe&&(i*=c.line_strokeWidth,o*=c.line_strokeWidth),f=qe(h,c.plug_markerWidthSE,e,i)||f,f=qe(h,c.plug_markerHeightSE,e,o)||f,c.capsMaskMarker_markerWidthSE[e]=n,c.capsMaskMarker_markerHeightSE[e]=a),c.plugOutline_plugSE[e]=c.capsMaskMarker_plugSE[e]=u,c.plug_enabledSE[e]?(s=c.line_strokeWidth/de.lineSize*p.plugSizeSE[e],c.position_plugOverheadSE[e]=t.overhead*s,c.viewBox_plugBCircleSE[e]=t.bCircle*s,l=t.sideLen*s,r=t.backLen*s):(c.position_plugOverheadSE[e]=-c.line_strokeWidth/2,c.viewBox_plugBCircleSE[e]=l=r=0),qe(h,c.attach_plugSideLenSE,e,l,d.cur_attach_plugSideLenSE),qe(h,c.attach_plugBackLenSE,e,r,d.cur_attach_plugBackLenSE),c.capsMaskAnchor_enabledSE[e]=!c.plug_enabledSE[e]}),f=qe(h,c,\"plug_enabled\",c.plug_enabledSE[0]||c.plug_enabledSE[1])||f)),(t.lineOutline||ee.line)&&(ee.lineOutline=(u=(r=e).options,y=r.curStats,m=!1,m=qe(r,y,\"lineOutline_enabled\",u.lineOutlineEnabled)||m,m=qe(r,y,\"lineOutline_color\",u.lineOutlineColor)||m,m=qe(r,y,\"lineOutline_colorTra\",Me(y.lineOutline_color)[0]<1)||m,s=y.line_strokeWidth*u.lineOutlineSize,m=qe(r,y,\"lineOutline_strokeWidth\",y.line_strokeWidth-2*s)||m,m=qe(r,y,\"lineOutline_inStrokeWidth\",y.lineOutline_colorTra?y.lineOutline_strokeWidth+2*ce:y.line_strokeWidth-s)||m)),(t.plugOutline||ee.line||ee.plug||ee.lineOutline)&&(ee.plugOutline=(g=(S=e).options,_=S.curStats,v=!1,[0,1].forEach(function(e){var t,n=_.plugOutline_plugSE[e],a=n!==ne?ae[ie[n]]:null;v=qe(S,_.plugOutline_enabledSE,e,g.plugOutlineEnabledSE[e]&&_.plug_enabled&&_.plug_enabledSE[e]&&!!a&&!!a.outlineBase)||v,v=qe(S,_.plugOutline_colorSE,e,t=g.plugOutlineColorSE[e]||_.lineOutline_color)||v,v=qe(S,_.plugOutline_colorTraSE,e,Me(t)[0]<1)||v,a&&a.outlineBase&&((t=g.plugOutlineSizeSE[e])>a.outlineMax&&(t=a.outlineMax),t*=2*a.outlineBase,v=qe(S,_.plugOutline_strokeWidthSE,e,t)||v,v=qe(S,_.plugOutline_inStrokeWidthSE,e,_.plugOutline_colorTraSE[e]?t-ce/(_.line_strokeWidth/de.lineSize)/g.plugSizeSE[e]*2:t/2)||v)}),v)),(t.faces||ee.line||ee.plug||ee.lineOutline||ee.plugOutline)&&(ee.faces=(b=(E=e).curStats,k=E.aplStats,w=E.events,O=!1,!b.line_altColor&&qe(E,k,\"line_color\",x=b.line_color,w.apl_line_color)&&(E.lineFace.style.stroke=x,O=!0),qe(E,k,\"line_strokeWidth\",x=b.line_strokeWidth,w.apl_line_strokeWidth)&&(E.lineShape.style.strokeWidth=x+\"px\",O=!0,(ue||se)&&(He(E,E.lineShape),se&&(He(E,E.lineFace),He(E,E.lineMaskCaps)))),qe(E,k,\"lineOutline_enabled\",x=b.lineOutline_enabled,w.apl_lineOutline_enabled)&&(E.lineOutlineFace.style.display=x?\"inline\":\"none\",O=!0),b.lineOutline_enabled&&(qe(E,k,\"lineOutline_color\",x=b.lineOutline_color,w.apl_lineOutline_color)&&(E.lineOutlineFace.style.stroke=x,O=!0),qe(E,k,\"lineOutline_strokeWidth\",x=b.lineOutline_strokeWidth,w.apl_lineOutline_strokeWidth)&&(E.lineOutlineMaskShape.style.strokeWidth=x+\"px\",O=!0,se&&(He(E,E.lineOutlineMaskCaps),He(E,E.lineOutlineFace))),qe(E,k,\"lineOutline_inStrokeWidth\",x=b.lineOutline_inStrokeWidth,w.apl_lineOutline_inStrokeWidth)&&(E.lineMaskShape.style.strokeWidth=x+\"px\",O=!0,se&&(He(E,E.lineOutlineMaskCaps),He(E,E.lineOutlineFace)))),qe(E,k,\"plug_enabled\",x=b.plug_enabled,w.apl_plug_enabled)&&(E.plugsFace.style.display=x?\"inline\":\"none\",O=!0),b.plug_enabled&&[0,1].forEach(function(n){var e=b.plug_plugSE[n],t=e!==ne?ae[ie[e]]:null,a=Ye(n,t);qe(E,k.plug_enabledSE,n,x=b.plug_enabledSE[n],w.apl_plug_enabledSE)&&(E.plugsFace.style[a.prop]=x?\"url(#\"+E.plugMarkerIdSE[n]+\")\":\"none\",O=!0),b.plug_enabledSE[n]&&(qe(E,k.plug_plugSE,n,e,w.apl_plug_plugSE)&&(E.plugFaceSE[n].href.baseVal=\"#\"+t.elmId,Ze(E,E.plugMarkerSE[n],a.orient,t.bBox,E.svg,E.plugMarkerShapeSE[n],E.plugsFace),O=!0,ue&&He(E,E.plugsFace)),qe(E,k.plug_colorSE,n,x=b.plug_colorSE[n],w.apl_plug_colorSE)&&(E.plugFaceSE[n].style.fill=x,O=!0,(he||pe||se)&&!b.line_colorTra&&He(E,se?E.lineMaskCaps:E.capsMaskLine)),[\"markerWidth\",\"markerHeight\"].forEach(function(e){var t=\"plug_\"+e+\"SE\";qe(E,k[t],n,x=b[t][n],w[\"apl_\"+t])&&(E.plugMarkerSE[n][e].baseVal.value=x,O=!0)}),qe(E,k.plugOutline_enabledSE,n,x=b.plugOutline_enabledSE[n],w.apl_plugOutline_enabledSE)&&(x?(E.plugFaceSE[n].style.mask=\"url(#\"+E.plugMaskIdSE[n]+\")\",E.plugOutlineFaceSE[n].style.display=\"inline\"):(E.plugFaceSE[n].style.mask=\"none\",E.plugOutlineFaceSE[n].style.display=\"none\"),O=!0),b.plugOutline_enabledSE[n]&&(qe(E,k.plugOutline_plugSE,n,e,w.apl_plugOutline_plugSE)&&(E.plugOutlineFaceSE[n].href.baseVal=E.plugMaskShapeSE[n].href.baseVal=E.plugOutlineMaskShapeSE[n].href.baseVal=\"#\"+t.elmId,[E.plugMaskSE[n],E.plugOutlineMaskSE[n]].forEach(function(e){e.x.baseVal.value=t.bBox.left,e.y.baseVal.value=t.bBox.top,e.width.baseVal.value=t.bBox.width,e.height.baseVal.value=t.bBox.height}),O=!0),qe(E,k.plugOutline_colorSE,n,x=b.plugOutline_colorSE[n],w.apl_plugOutline_colorSE)&&(E.plugOutlineFaceSE[n].style.fill=x,O=!0,se&&(He(E,E.lineMaskCaps),He(E,E.lineOutlineMaskCaps))),qe(E,k.plugOutline_strokeWidthSE,n,x=b.plugOutline_strokeWidthSE[n],w.apl_plugOutline_strokeWidthSE)&&(E.plugOutlineMaskShapeSE[n].style.strokeWidth=x+\"px\",O=!0),qe(E,k.plugOutline_inStrokeWidthSE,n,x=b.plugOutline_inStrokeWidthSE[n],w.apl_plugOutline_inStrokeWidthSE)&&(E.plugMaskShapeSE[n].style.strokeWidth=x+\"px\",O=!0)))}),O)),(t.position||ee.line||ee.plug)&&(ee.position=Je(e)),(t.path||ee.position)&&(ee.path=(C=(M=e).curStats,L=M.aplStats,A=M.pathList.animVal||M.pathList.baseVal,V=C.path_edge,P=!1,A&&(V.x1=V.x2=A[0][0].x,V.y1=V.y2=A[0][0].y,C.path_pathData=I=Re(A,function(e){e.x<V.x1&&(V.x1=e.x),e.y<V.y1&&(V.y1=e.y),e.x>V.x2&&(V.x2=e.x),e.y>V.y2&&(V.y2=e.y)}),Ge(I,L.path_pathData)&&(M.linePath.setPathData(I),L.path_pathData=I,P=!0,se?(He(M,M.plugsFace),He(M,M.lineMaskCaps)):ue&&He(M,M.linePath),M.events.apl_path&&M.events.apl_path.forEach(function(e){e(M,I)}))),P)),ee.viewBox=(T=(N=e).curStats,W=N.aplStats,B=T.path_edge,R=T.viewBox_bBox,F=W.viewBox_bBox,G=N.svg.viewBox.baseVal,D=N.svg.style,z=!1,j=Math.max(T.line_strokeWidth/2,T.viewBox_plugBCircleSE[0]||0,T.viewBox_plugBCircleSE[1]||0),H={x1:B.x1-j,y1:B.y1-j,x2:B.x2+j,y2:B.y2+j},N.events.new_edge4viewBox&&N.events.new_edge4viewBox.forEach(function(e){e(N,H)}),R.x=T.lineMask_x=T.lineOutlineMask_x=T.maskBGRect_x=H.x1,R.y=T.lineMask_y=T.lineOutlineMask_y=T.maskBGRect_y=H.y1,R.width=H.x2-H.x1,R.height=H.y2-H.y1,[\"x\",\"y\",\"width\",\"height\"].forEach(function(e){var t;(t=R[e])!==F[e]&&(G[e]=F[e]=t,D[oe[e]]=t+(\"x\"===e||\"y\"===e?N.bodyOffset[e]:0)+\"px\",z=!0)}),z),ee.mask=(Y=(U=e).curStats,X=U.aplStats,q=!1,Y.plug_enabled?[0,1].forEach(function(e){Y.capsMaskMarker_enabledSE[e]=Y.plug_enabledSE[e]&&Y.plug_colorTraSE[e]||Y.plugOutline_enabledSE[e]&&Y.plugOutline_colorTraSE[e]}):Y.capsMaskMarker_enabledSE[0]=Y.capsMaskMarker_enabledSE[1]=!1,Y.capsMaskMarker_enabled=Y.capsMaskMarker_enabledSE[0]||Y.capsMaskMarker_enabledSE[1],Y.lineMask_outlineMode=Y.lineOutline_enabled,Y.caps_enabled=Y.capsMaskMarker_enabled||Y.capsMaskAnchor_enabledSE[0]||Y.capsMaskAnchor_enabledSE[1],Y.lineMask_enabled=Y.caps_enabled||Y.lineMask_outlineMode,(Y.lineMask_enabled&&!Y.lineMask_outlineMode||Y.lineOutline_enabled)&&[\"x\",\"y\"].forEach(function(e){var t=\"maskBGRect_\"+e;qe(U,X,t,Z=Y[t])&&(U.maskBGRect[e].baseVal.value=Z,q=!0)}),qe(U,X,\"lineMask_enabled\",Z=Y.lineMask_enabled)&&(U.lineFace.style.mask=Z?\"url(#\"+U.lineMaskId+\")\":\"none\",q=!0,pe&&He(U,U.lineMask)),Y.lineMask_enabled&&(qe(U,X,\"lineMask_outlineMode\",Z=Y.lineMask_outlineMode)&&(Z?(U.lineMaskBG.style.display=\"none\",U.lineMaskShape.style.display=\"inline\"):(U.lineMaskBG.style.display=\"inline\",U.lineMaskShape.style.display=\"none\"),q=!0),[\"x\",\"y\"].forEach(function(e){var t=\"lineMask_\"+e;qe(U,X,t,Z=Y[t])&&(U.lineMask[e].baseVal.value=Z,q=!0)}),qe(U,X,\"caps_enabled\",Z=Y.caps_enabled)&&(U.lineMaskCaps.style.display=U.lineOutlineMaskCaps.style.display=Z?\"inline\":\"none\",q=!0,pe&&He(U,U.capsMaskLine)),Y.caps_enabled&&([0,1].forEach(function(e){var t;qe(U,X.capsMaskAnchor_enabledSE,e,Z=Y.capsMaskAnchor_enabledSE[e])&&(U.capsMaskAnchorSE[e].style.display=Z?\"inline\":\"none\",q=!0,pe&&He(U,U.lineMask)),Y.capsMaskAnchor_enabledSE[e]&&(Ge(t=Y.capsMaskAnchor_pathDataSE[e],X.capsMaskAnchor_pathDataSE[e])&&(U.capsMaskAnchorSE[e].setPathData(t),X.capsMaskAnchor_pathDataSE[e]=t,q=!0),qe(U,X.capsMaskAnchor_strokeWidthSE,e,Z=Y.capsMaskAnchor_strokeWidthSE[e])&&(U.capsMaskAnchorSE[e].style.strokeWidth=Z+\"px\",q=!0))}),qe(U,X,\"capsMaskMarker_enabled\",Z=Y.capsMaskMarker_enabled)&&(U.capsMaskLine.style.display=Z?\"inline\":\"none\",q=!0),Y.capsMaskMarker_enabled&&[0,1].forEach(function(n){var e=Y.capsMaskMarker_plugSE[n],t=e!==ne?ae[ie[e]]:null,a=Ye(n,t);qe(U,X.capsMaskMarker_enabledSE,n,Z=Y.capsMaskMarker_enabledSE[n])&&(U.capsMaskLine.style[a.prop]=Z?\"url(#\"+U.lineMaskMarkerIdSE[n]+\")\":\"none\",q=!0),Y.capsMaskMarker_enabledSE[n]&&(qe(U,X.capsMaskMarker_plugSE,n,e)&&(U.capsMaskMarkerShapeSE[n].href.baseVal=\"#\"+t.elmId,Ze(U,U.capsMaskMarkerSE[n],a.orient,t.bBox,U.svg,U.capsMaskMarkerShapeSE[n],U.capsMaskLine),q=!0,ue&&(He(U,U.capsMaskLine),He(U,U.lineFace))),[\"markerWidth\",\"markerHeight\"].forEach(function(e){var t=\"capsMaskMarker_\"+e+\"SE\";qe(U,X[t],n,Z=Y[t][n])&&(U.capsMaskMarkerSE[n][e].baseVal.value=Z,q=!0)}))}))),Y.lineOutline_enabled&&[\"x\",\"y\"].forEach(function(e){var t=\"lineOutlineMask_\"+e;qe(U,X,t,Z=Y[t])&&(U.lineOutlineMask[e].baseVal.value=Z,q=!0)}),q),t.effect&&(J=(Q=e).curStats,$=Q.aplStats,Object.keys(te).forEach(function(e){var t=te[e],n=e+\"_enabled\",a=e+\"_options\",i=J[a];qe(Q,$,n,K=J[n])?(K&&($[a]=Oe(i)),t[K?\"init\":\"remove\"](Q)):K&&we(i,$[a])&&(t.remove(Q),$[n]=!0,$[a]=Oe(i),t.init(Q))})),(he||pe)&&ee.line&&!ee.path&&He(e,e.lineShape),he&&ee.plug&&!ee.line&&He(e,e.plugsFace),Ue(e)}function tt(e,t){return{duration:ye(e.duration)&&0<e.duration?e.duration:t.duration,timing:g.validTiming(e.timing)?e.timing:Oe(t.timing)}}function nt(e,t,n,a){var i,o=e.curStats,l=e.aplStats,r={};function s(){[\"show_on\",\"show_effect\",\"show_animOptions\"].forEach(function(e){l[e]=o[e]})}o.show_on=t,n&&M[n]&&(o.show_effect=n,o.show_animOptions=tt(fe(a)?a:{},M[n].defaultAnimOptions)),r.show_on=o.show_on!==l.show_on,r.show_effect=o.show_effect!==l.show_effect,r.show_animOptions=we(o.show_animOptions,l.show_animOptions),r.show_effect||r.show_animOptions?o.show_inAnim?(i=r.show_effect?M[l.show_effect].stop(e,!0,!0):M[l.show_effect].stop(e),s(),M[l.show_effect].init(e,i)):r.show_on&&(l.show_effect&&r.show_effect&&M[l.show_effect].stop(e,!0,!0),s(),M[l.show_effect].init(e)):r.show_on&&(s(),M[l.show_effect].start(e))}function at(e,t,n){var a={props:e,optionName:n};return e.attachments.indexOf(t)<0&&(!t.conf.bind||t.conf.bind(t,a))&&(e.attachments.push(t),t.boundTargets.push(a),1)}function it(n,a,e){var i=n.attachments.indexOf(a);-1<i&&n.attachments.splice(i,1),a.boundTargets.some(function(e,t){return e.props===n&&(a.conf.unbind&&a.conf.unbind(a,e),i=t,!0)})&&(a.boundTargets.splice(i,1),e||je(function(){a.boundTargets.length||o(a)}))}function ot(s,u){var e,i,a,t,n,o,l,r,h,p,c,d,f,y,m,S,g,_=s.options,v={};function E(e,t,n,a,i){var o={};return n?null!=a?(o.container=e[n],o.key=a):(o.container=e,o.key=n):(o.container=e,o.key=t),o.default=i,o.acceptsAuto=null==o.default,o}function x(e,t,n,a,i,o,l){var r,s,u,h=E(e,n,i,o,l);return null!=t[n]&&(s=(t[n]+\"\").toLowerCase())&&(h.acceptsAuto&&s===U||(u=a[s]))&&u!==h.container[h.key]&&(h.container[h.key]=u,r=!0),null!=h.container[h.key]||h.acceptsAuto||(h.container[h.key]=h.default,r=!0),r}function b(e,t,n,a,i,o,l,r,s){var u,h,p,c,d=E(e,n,i,o,l);if(!a){if(null==d.default)throw new Error(\"Invalid `type`: \"+n);a=typeof d.default}return null!=t[n]&&(d.acceptsAuto&&(t[n]+\"\").toLowerCase()===U||(p=h=t[n],(\"number\"===(c=a)?ye(p):typeof p===c)&&(h=s&&\"string\"===a&&h?h.trim():h,1)&&(!r||r(h))))&&h!==d.container[d.key]&&(d.container[d.key]=h,u=!0),null!=d.container[d.key]||d.acceptsAuto||(d.container[d.key]=d.default,u=!0),u}if(u=u||{},[\"start\",\"end\"].forEach(function(e,t){var n=u[e],a=!1;if(n&&(Ie(n)||(a=L(n,\"anchor\")))&&n!==_.anchorSE[t]){if(!1!==s.optionIsAttach.anchorSE[t]&&it(s,ve[_.anchorSE[t]._id]),a&&!at(s,ve[n._id],e))throw new Error(\"Can't bind attachment\");_.anchorSE[t]=n,s.optionIsAttach.anchorSE[t]=a,i=v.position=!0}}),!_.anchorSE[0]||!_.anchorSE[1]||_.anchorSE[0]===_.anchorSE[1])throw new Error(\"`start` and `end` are required.\");function k(e){var t=o.appendChild(S.createElementNS(re,\"mask\"));return t.id=e,t.maskUnits.baseVal=SVGUnitTypes.SVG_UNIT_TYPE_USERSPACEONUSE,[t.x,t.y,t.width,t.height].forEach(function(e){e.baseVal.newValueSpecifiedUnits(SVGLength.SVG_LENGTHTYPE_PX,0)}),t}function w(e){var t=o.appendChild(S.createElementNS(re,\"marker\"));return t.id=e,t.markerUnits.baseVal=SVGMarkerElement.SVG_MARKERUNITS_STROKEWIDTH,t.viewBox.baseVal||t.setAttribute(\"viewBox\",\"0 0 0 0\"),t}function O(e){return[e.width,e.height].forEach(function(e){e.baseVal.newValueSpecifiedUnits(SVGLength.SVG_LENGTHTYPE_PERCENTAGE,100)}),e}i&&(e=function(e,t){var n,a,i;if(!(n=Le(e))||!(a=Le(t)))throw new Error(\"Cannot get frames.\");return n.length&&a.length&&(n.reverse(),a.reverse(),n.some(function(t){return a.some(function(e){return e===t&&(i=e.contentWindow,!0)})})),i||window}(!1!==s.optionIsAttach.anchorSE[0]?ve[_.anchorSE[0]._id].element:_.anchorSE[0],!1!==s.optionIsAttach.anchorSE[1]?ve[_.anchorSE[1]._id].element:_.anchorSE[1]))!==s.baseWindow&&(t=e,m=(a=s).aplStats,S=t.document,g=A+\"-\"+a._id,a.pathList={},Xe(m,me),Object.keys(te).forEach(function(e){var t=e+\"_enabled\";m[t]&&(te[e].remove(a),m[t]=!1)}),a.baseWindow&&a.svg&&a.baseWindow.document.body.removeChild(a.svg),Ke(a.baseWindow=t),a.bodyOffset=Qe(t),a.svg=n=S.createElementNS(re,\"svg\"),n.className.baseVal=A,n.viewBox.baseVal||n.setAttribute(\"viewBox\",\"0 0 0 0\"),a.defs=o=n.appendChild(S.createElementNS(re,\"defs\")),a.linePath=r=o.appendChild(S.createElementNS(re,\"path\")),r.id=h=g+\"-line-path\",r.className.baseVal=A+\"-line-path\",pe&&(r.style.fill=\"none\"),a.lineShape=r=o.appendChild(S.createElementNS(re,\"use\")),r.id=p=g+\"-line-shape\",r.href.baseVal=\"#\"+h,(l=o.appendChild(S.createElementNS(re,\"g\"))).id=c=g+\"-caps\",a.capsMaskAnchorSE=[0,1].map(function(){var e=l.appendChild(S.createElementNS(re,\"path\"));return e.className.baseVal=A+\"-caps-mask-anchor\",e}),a.lineMaskMarkerIdSE=[g+\"-caps-mask-marker-0\",g+\"-caps-mask-marker-1\"],a.capsMaskMarkerSE=[0,1].map(function(e){return w(a.lineMaskMarkerIdSE[e])}),a.capsMaskMarkerShapeSE=[0,1].map(function(e){var t=a.capsMaskMarkerSE[e].appendChild(S.createElementNS(re,\"use\"));return t.className.baseVal=A+\"-caps-mask-marker-shape\",t}),a.capsMaskLine=r=l.appendChild(S.createElementNS(re,\"use\")),r.className.baseVal=A+\"-caps-mask-line\",r.href.baseVal=\"#\"+p,a.maskBGRect=r=O(o.appendChild(S.createElementNS(re,\"rect\"))),r.id=d=g+\"-mask-bg-rect\",r.className.baseVal=A+\"-mask-bg-rect\",pe&&(r.style.fill=\"white\"),a.lineMask=O(k(a.lineMaskId=g+\"-line-mask\")),a.lineMaskBG=r=a.lineMask.appendChild(S.createElementNS(re,\"use\")),r.href.baseVal=\"#\"+d,a.lineMaskShape=r=a.lineMask.appendChild(S.createElementNS(re,\"use\")),r.className.baseVal=A+\"-line-mask-shape\",r.href.baseVal=\"#\"+h,r.style.display=\"none\",a.lineMaskCaps=r=a.lineMask.appendChild(S.createElementNS(re,\"use\")),r.href.baseVal=\"#\"+c,a.lineOutlineMask=O(k(f=g+\"-line-outline-mask\")),(r=a.lineOutlineMask.appendChild(S.createElementNS(re,\"use\"))).href.baseVal=\"#\"+d,a.lineOutlineMaskShape=r=a.lineOutlineMask.appendChild(S.createElementNS(re,\"use\")),r.className.baseVal=A+\"-line-outline-mask-shape\",r.href.baseVal=\"#\"+h,a.lineOutlineMaskCaps=r=a.lineOutlineMask.appendChild(S.createElementNS(re,\"use\")),r.href.baseVal=\"#\"+c,a.face=n.appendChild(S.createElementNS(re,\"g\")),a.lineFace=r=a.face.appendChild(S.createElementNS(re,\"use\")),r.href.baseVal=\"#\"+p,a.lineOutlineFace=r=a.face.appendChild(S.createElementNS(re,\"use\")),r.href.baseVal=\"#\"+p,r.style.mask=\"url(#\"+f+\")\",r.style.display=\"none\",a.plugMaskIdSE=[g+\"-plug-mask-0\",g+\"-plug-mask-1\"],a.plugMaskSE=[0,1].map(function(e){return k(a.plugMaskIdSE[e])}),a.plugMaskShapeSE=[0,1].map(function(e){var t=a.plugMaskSE[e].appendChild(S.createElementNS(re,\"use\"));return t.className.baseVal=A+\"-plug-mask-shape\",t}),y=[],a.plugOutlineMaskSE=[0,1].map(function(e){return k(y[e]=g+\"-plug-outline-mask-\"+e)}),a.plugOutlineMaskShapeSE=[0,1].map(function(e){var t=a.plugOutlineMaskSE[e].appendChild(S.createElementNS(re,\"use\"));return t.className.baseVal=A+\"-plug-outline-mask-shape\",t}),a.plugMarkerIdSE=[g+\"-plug-marker-0\",g+\"-plug-marker-1\"],a.plugMarkerSE=[0,1].map(function(e){var t=w(a.plugMarkerIdSE[e]);return pe&&(t.markerUnits.baseVal=SVGMarkerElement.SVG_MARKERUNITS_USERSPACEONUSE),t}),a.plugMarkerShapeSE=[0,1].map(function(e){return a.plugMarkerSE[e].appendChild(S.createElementNS(re,\"g\"))}),a.plugFaceSE=[0,1].map(function(e){return a.plugMarkerShapeSE[e].appendChild(S.createElementNS(re,\"use\"))}),a.plugOutlineFaceSE=[0,1].map(function(e){var t=a.plugMarkerShapeSE[e].appendChild(S.createElementNS(re,\"use\"));return t.style.mask=\"url(#\"+y[e]+\")\",t.style.display=\"none\",t}),a.plugsFace=r=a.face.appendChild(S.createElementNS(re,\"use\")),r.className.baseVal=A+\"-plugs-face\",r.href.baseVal=\"#\"+p,r.style.display=\"none\",a.curStats.show_inAnim?(a.isShown=1,M[m.show_effect].stop(a,!0)):a.isShown||(n.style.visibility=\"hidden\"),S.body.appendChild(n),[0,1,2].forEach(function(e){var t,n=a.options.labelSEM[e];n&&L(n,\"label\")&&(t=ve[n._id]).conf.initSvg&&t.conf.initSvg(t,a)}),v.line=v.plug=v.lineOutline=v.plugOutline=v.faces=v.effect=!0),v.position=x(_,u,\"path\",z,null,null,de.path)||v.position,v.position=x(_,u,\"startSocket\",W,\"socketSE\",0)||v.position,v.position=x(_,u,\"endSocket\",W,\"socketSE\",1)||v.position,[u.startSocketGravity,u.endSocketGravity].forEach(function(e,t){var n,a,i=!1;null!=e&&(Array.isArray(e)?ye(e[0])&&ye(e[1])&&(i=[e[0],e[1]],Array.isArray(_.socketGravitySE[t])&&(n=i,a=_.socketGravitySE[t],n.length===a.length&&n.every(function(e,t){return e===a[t]}))&&(i=!1)):((e+\"\").toLowerCase()===U?i=null:ye(e)&&0<=e&&(i=e),i===_.socketGravitySE[t]&&(i=!1)),!1!==i&&(_.socketGravitySE[t]=i,v.position=!0))}),v.line=b(_,u,\"color\",null,\"lineColor\",null,de.lineColor,null,!0)||v.line,v.line=b(_,u,\"size\",null,\"lineSize\",null,de.lineSize,function(e){return 0<e})||v.line,[\"startPlug\",\"endPlug\"].forEach(function(e,t){v.plug=x(_,u,e,j,\"plugSE\",t,de.plugSE[t])||v.plug,v.plug=b(_,u,e+\"Color\",\"string\",\"plugColorSE\",t,null,null,!0)||v.plug,v.plug=b(_,u,e+\"Size\",null,\"plugSizeSE\",t,de.plugSizeSE[t],function(e){return 0<e})||v.plug}),v.lineOutline=b(_,u,\"outline\",null,\"lineOutlineEnabled\",null,de.lineOutlineEnabled)||v.lineOutline,v.lineOutline=b(_,u,\"outlineColor\",null,\"lineOutlineColor\",null,de.lineOutlineColor,null,!0)||v.lineOutline,v.lineOutline=b(_,u,\"outlineSize\",null,\"lineOutlineSize\",null,de.lineOutlineSize,function(e){return 0<e&&e<=.48})||v.lineOutline,[\"startPlugOutline\",\"endPlugOutline\"].forEach(function(e,t){v.plugOutline=b(_,u,e,null,\"plugOutlineEnabledSE\",t,de.plugOutlineEnabledSE[t])||v.plugOutline,v.plugOutline=b(_,u,e+\"Color\",\"string\",\"plugOutlineColorSE\",t,null,null,!0)||v.plugOutline,v.plugOutline=b(_,u,e+\"Size\",null,\"plugOutlineSizeSE\",t,de.plugOutlineSizeSE[t],function(e){return 1<=e})||v.plugOutline}),[\"startLabel\",\"endLabel\",\"middleLabel\"].forEach(function(e,t){var n,a,i,o=u[e],l=_.labelSEM[t]&&!s.optionIsAttach.labelSEM[t]?ve[_.labelSEM[t]._id].text:_.labelSEM[t],r=!1;if((n=\"string\"==typeof o)&&(o=o.trim()),(n||o&&(r=L(o,\"label\")))&&o!==l){if(_.labelSEM[t]&&(it(s,ve[_.labelSEM[t]._id]),_.labelSEM[t]=\"\"),o){if(r?(a=ve[(i=o)._id]).boundTargets.slice().forEach(function(e){a.conf.removeOption(a,e)}):i=new C(I.captionLabel,[o]),!at(s,ve[i._id],e))throw new Error(\"Can't bind attachment\");_.labelSEM[t]=i}s.optionIsAttach.labelSEM[t]=r}}),Object.keys(te).forEach(function(a){var e,t,o=te[a],n=a+\"_enabled\",i=a+\"_options\";function l(a){var i={};return o.optionsConf.forEach(function(e){var t=e[0],n=e[3];null==e[4]||i[n]||(i[n]=[]),(\"function\"==typeof t?t:\"id\"===t?x:b).apply(null,[i,a].concat(e.slice(1)))}),i}function r(e){var t,n=a+\"_animOptions\";return e.hasOwnProperty(\"animation\")?fe(e.animation)?t=s.curStats[n]=tt(e.animation,o.defaultAnimOptions):(t=!!e.animation,s.curStats[n]=t?tt({},o.defaultAnimOptions):null):(t=!!o.defaultEnabled,s.curStats[n]=t?tt({},o.defaultAnimOptions):null),t}u.hasOwnProperty(a)&&(e=u[a],fe(e)?(s.curStats[n]=!0,t=s.curStats[i]=l(e),o.anim&&(s.curStats[i].animation=r(e))):(t=s.curStats[n]=!!e)&&(s.curStats[i]=l({}),o.anim&&(s.curStats[i].animation=r({}))),we(t,_[a])&&(_[a]=t,v.effect=!0))}),et(s,v)}function lt(e,t,n){var a={options:{anchorSE:[],socketSE:[],socketGravitySE:[],plugSE:[],plugColorSE:[],plugSizeSE:[],plugOutlineEnabledSE:[],plugOutlineColorSE:[],plugOutlineSizeSE:[],labelSEM:[\"\",\"\",\"\"]},optionIsAttach:{anchorSE:[!1,!1],labelSEM:[!1,!1,!1]},curStats:{},aplStats:{},attachments:[],events:{},reflowTargets:[]};Xe(a.curStats,me),Xe(a.aplStats,me),Object.keys(te).forEach(function(e){var t=te[e].stats;Xe(a.curStats,t),Xe(a.aplStats,t),a.options[e]=!1}),Xe(a.curStats,E),Xe(a.aplStats,E),a.curStats.show_effect=O,a.curStats.show_animOptions=Oe(M[O].defaultAnimOptions),Object.defineProperty(this,\"_id\",{value:++_e}),a._id=this._id,ge[this._id]=a,1===arguments.length&&(n=e,e=null),n=n||{},(e||t)&&(n=Oe(n),e&&(n.start=e),t&&(n.end=t)),a.isShown=a.aplStats.show_on=!n.hide,this.setOptions(n)}function rt(n){return function(e){var t={};t[n]=e,this.setOptions(t)}}function st(e,t){var n,a={conf:e,curStats:{},aplStats:{},boundTargets:[]},i={};e.argOptions.every(function(e){return!(!t.length||(\"string\"==typeof e.type?typeof t[0]!==e.type:\"function\"!=typeof e.type||!e.type(t[0])))&&(i[e.optionName]=t.shift(),!0)}),n=t.length&&fe(t[0])?Oe(t[0]):{},Object.keys(i).forEach(function(e){n[e]=i[e]}),e.stats&&(Xe(a.curStats,e.stats),Xe(a.aplStats,e.stats)),Object.defineProperty(this,\"_id\",{value:++Ee}),Object.defineProperty(this,\"isRemoved\",{get:function(){return!ve[this._id]}}),a._id=this._id,e.init&&!e.init(a,n)||(ve[this._id]=a)}return te={dash:{stats:{dash_len:{},dash_gap:{},dash_maxOffset:{}},anim:!0,defaultAnimOptions:{duration:1e3,timing:\"linear\"},optionsConf:[[\"type\",\"len\",\"number\",null,null,null,function(e){return 0<e}],[\"type\",\"gap\",\"number\",null,null,null,function(e){return 0<e}]],init:function(e){De(e,\"apl_line_strokeWidth\",te.dash.update),e.lineFace.style.strokeDashoffset=0,te.dash.update(e)},remove:function(e){var t=e.curStats;ze(e,\"apl_line_strokeWidth\",te.dash.update),t.dash_animId&&(g.remove(t.dash_animId),t.dash_animId=null),e.lineFace.style.strokeDasharray=\"none\",e.lineFace.style.strokeDashoffset=0,Xe(e.aplStats,te.dash.stats)},update:function(t){var e,n=t.curStats,a=t.aplStats,i=a.dash_options,o=!1;n.dash_len=i.len||2*a.line_strokeWidth,n.dash_gap=i.gap||a.line_strokeWidth,n.dash_maxOffset=n.dash_len+n.dash_gap,o=qe(t,a,\"dash_len\",n.dash_len)||o,(o=qe(t,a,\"dash_gap\",n.dash_gap)||o)&&(t.lineFace.style.strokeDasharray=a.dash_len+\",\"+a.dash_gap),n.dash_animOptions?(o=qe(t,a,\"dash_maxOffset\",n.dash_maxOffset),a.dash_animOptions&&(o||we(n.dash_animOptions,a.dash_animOptions))&&(n.dash_animId&&(e=g.stop(n.dash_animId),g.remove(n.dash_animId)),a.dash_animOptions=null),a.dash_animOptions||(n.dash_animId=g.add(function(e){return(1-e)*a.dash_maxOffset+\"px\"},function(e){t.lineFace.style.strokeDashoffset=e},n.dash_animOptions.duration,0,n.dash_animOptions.timing,!1,e),a.dash_animOptions=Oe(n.dash_animOptions))):a.dash_animOptions&&(n.dash_animId&&(g.remove(n.dash_animId),n.dash_animId=null),t.lineFace.style.strokeDashoffset=0,a.dash_animOptions=null)}},gradient:{stats:{gradient_colorSE:{hasSE:!0},gradient_pointSE:{hasSE:!0,hasProps:!0}},optionsConf:[[\"type\",\"startColor\",\"string\",\"colorSE\",0,null,null,!0],[\"type\",\"endColor\",\"string\",\"colorSE\",1,null,null,!0]],init:function(e){var t,a=e.baseWindow.document,n=e.defs,i=A+\"-\"+e._id+\"-gradient\";e.efc_gradient_gradient=t=n.appendChild(a.createElementNS(re,\"linearGradient\")),t.id=i,t.gradientUnits.baseVal=SVGUnitTypes.SVG_UNIT_TYPE_USERSPACEONUSE,[t.x1,t.y1,t.x2,t.y2].forEach(function(e){e.baseVal.newValueSpecifiedUnits(SVGLength.SVG_LENGTHTYPE_PX,0)}),e.efc_gradient_stopSE=[0,1].map(function(t){var n=e.efc_gradient_gradient.appendChild(a.createElementNS(re,\"stop\"));try{n.offset.baseVal=t}catch(e){if(e.code!==DOMException.NO_MODIFICATION_ALLOWED_ERR)throw e;n.setAttribute(\"offset\",t)}return n}),De(e,\"cur_plug_colorSE\",te.gradient.update),De(e,\"apl_path\",te.gradient.update),e.curStats.line_altColor=!0,e.lineFace.style.stroke=\"url(#\"+i+\")\",te.gradient.update(e)},remove:function(e){e.efc_gradient_gradient&&(e.defs.removeChild(e.efc_gradient_gradient),e.efc_gradient_gradient=e.efc_gradient_stopSE=null),ze(e,\"cur_plug_colorSE\",te.gradient.update),ze(e,\"apl_path\",te.gradient.update),e.curStats.line_altColor=!1,e.lineFace.style.stroke=e.curStats.line_color,Xe(e.aplStats,te.gradient.stats)},update:function(a){var e,t,i=a.curStats,o=a.aplStats,n=o.gradient_options,l=a.pathList.animVal||a.pathList.baseVal;[0,1].forEach(function(e){i.gradient_colorSE[e]=n.colorSE[e]||i.plug_colorSE[e]}),t=l[0][0],i.gradient_pointSE[0]={x:t.x,y:t.y},t=(e=l[l.length-1])[e.length-1],i.gradient_pointSE[1]={x:t.x,y:t.y},[0,1].forEach(function(t){var n;qe(a,o.gradient_colorSE,t,n=i.gradient_colorSE[t])&&(pe?(n=Me(n),a.efc_gradient_stopSE[t].style.stopColor=n[1],a.efc_gradient_stopSE[t].style.stopOpacity=n[0]):a.efc_gradient_stopSE[t].style.stopColor=n),[\"x\",\"y\"].forEach(function(e){(n=i.gradient_pointSE[t][e])!==o.gradient_pointSE[t][e]&&(a.efc_gradient_gradient[e+(t+1)].baseVal.value=o.gradient_pointSE[t][e]=n)})})}},dropShadow:{stats:{dropShadow_dx:{},dropShadow_dy:{},dropShadow_blur:{},dropShadow_color:{},dropShadow_opacity:{},dropShadow_x:{},dropShadow_y:{}},optionsConf:[[\"type\",\"dx\",null,null,null,2],[\"type\",\"dy\",null,null,null,4],[\"type\",\"blur\",null,null,null,3,function(e){return 0<=e}],[\"type\",\"color\",null,null,null,\"#000\",null,!0],[\"type\",\"opacity\",null,null,null,.8,function(e){return 0<=e&&e<=1}]],init:function(t){var e,n,a,i,o,l=t.baseWindow.document,r=t.defs,s=A+\"-\"+t._id+\"-dropShadow\",u=(e=l,n=s,o={},\"boolean\"!=typeof p&&(p=!!window.SVGFEDropShadowElement&&!pe),o.elmsAppend=[o.elmFilter=a=e.createElementNS(re,\"filter\")],a.filterUnits.baseVal=SVGUnitTypes.SVG_UNIT_TYPE_USERSPACEONUSE,a.x.baseVal.newValueSpecifiedUnits(SVGLength.SVG_LENGTHTYPE_PX,0),a.y.baseVal.newValueSpecifiedUnits(SVGLength.SVG_LENGTHTYPE_PX,0),a.width.baseVal.newValueSpecifiedUnits(SVGLength.SVG_LENGTHTYPE_PERCENTAGE,100),a.height.baseVal.newValueSpecifiedUnits(SVGLength.SVG_LENGTHTYPE_PERCENTAGE,100),a.id=n,p?(o.elmOffset=o.elmBlur=i=a.appendChild(e.createElementNS(re,\"feDropShadow\")),o.styleFlood=i.style):(o.elmBlur=a.appendChild(e.createElementNS(re,\"feGaussianBlur\")),o.elmOffset=i=a.appendChild(e.createElementNS(re,\"feOffset\")),i.result.baseVal=\"offsetblur\",i=a.appendChild(e.createElementNS(re,\"feFlood\")),o.styleFlood=i.style,(i=a.appendChild(e.createElementNS(re,\"feComposite\"))).in2.baseVal=\"offsetblur\",i.operator.baseVal=SVGFECompositeElement.SVG_FECOMPOSITE_OPERATOR_IN,(i=a.appendChild(e.createElementNS(re,\"feMerge\"))).appendChild(e.createElementNS(re,\"feMergeNode\")),i.appendChild(e.createElementNS(re,\"feMergeNode\")).in1.baseVal=\"SourceGraphic\"),o);[\"elmFilter\",\"elmOffset\",\"elmBlur\",\"styleFlood\",\"elmsAppend\"].forEach(function(e){t[\"efc_dropShadow_\"+e]=u[e]}),u.elmsAppend.forEach(function(e){r.appendChild(e)}),t.face.setAttribute(\"filter\",\"url(#\"+s+\")\"),De(t,\"new_edge4viewBox\",te.dropShadow.adjustEdge),te.dropShadow.update(t)},remove:function(e){var t=e.defs;e.efc_dropShadow_elmsAppend&&(e.efc_dropShadow_elmsAppend.forEach(function(e){t.removeChild(e)}),e.efc_dropShadow_elmFilter=e.efc_dropShadow_elmOffset=e.efc_dropShadow_elmBlur=e.efc_dropShadow_styleFlood=e.efc_dropShadow_elmsAppend=null),ze(e,\"new_edge4viewBox\",te.dropShadow.adjustEdge),et(e,{}),e.face.removeAttribute(\"filter\"),Xe(e.aplStats,te.dropShadow.stats)},update:function(e){var t,n,a=e.curStats,i=e.aplStats,o=i.dropShadow_options;a.dropShadow_dx=t=o.dx,qe(e,i,\"dropShadow_dx\",t)&&(e.efc_dropShadow_elmOffset.dx.baseVal=t,n=!0),a.dropShadow_dy=t=o.dy,qe(e,i,\"dropShadow_dy\",t)&&(e.efc_dropShadow_elmOffset.dy.baseVal=t,n=!0),a.dropShadow_blur=t=o.blur,qe(e,i,\"dropShadow_blur\",t)&&(e.efc_dropShadow_elmBlur.setStdDeviation(t,t),n=!0),n&&et(e,{}),a.dropShadow_color=t=o.color,qe(e,i,\"dropShadow_color\",t)&&(e.efc_dropShadow_styleFlood.floodColor=t),a.dropShadow_opacity=t=o.opacity,qe(e,i,\"dropShadow_opacity\",t)&&(e.efc_dropShadow_styleFlood.floodOpacity=t)},adjustEdge:function(a,i){var e,t,o=a.curStats,l=a.aplStats;null!=o.dropShadow_dx&&(e=3*o.dropShadow_blur,(t={x1:i.x1-e+o.dropShadow_dx,y1:i.y1-e+o.dropShadow_dy,x2:i.x2+e+o.dropShadow_dx,y2:i.y2+e+o.dropShadow_dy}).x1<i.x1&&(i.x1=t.x1),t.y1<i.y1&&(i.y1=t.y1),t.x2>i.x2&&(i.x2=t.x2),t.y2>i.y2&&(i.y2=t.y2),[\"x\",\"y\"].forEach(function(e){var t,n=\"dropShadow_\"+e;o[n]=t=i[e+\"1\"],qe(a,l,n,t)&&(a.efc_dropShadow_elmFilter[e].baseVal.value=t)}))}}},Object.keys(te).forEach(function(e){var t=te[e],n=t.stats;n[e+\"_enabled\"]={iniValue:!1},n[e+\"_options\"]={hasProps:!0},t.anim&&(n[e+\"_animOptions\"]={},n[e+\"_animId\"]={})}),M={none:{defaultAnimOptions:{},init:function(e,t){var n=e.curStats;n.show_animId&&(g.remove(n.show_animId),n.show_animId=null),M.none.start(e,t)},start:function(e,t){M.none.stop(e,!0)},stop:function(e,t,n){var a=e.curStats;return n=null!=n?n:e.aplStats.show_on,a.show_inAnim=!1,t&&$e(e,n),n?1:0}},fade:{defaultAnimOptions:{duration:300,timing:\"linear\"},init:function(n,e){var t=n.curStats,a=n.aplStats;t.show_animId&&g.remove(t.show_animId),t.show_animId=g.add(function(e){return e},function(e,t){t?M.fade.stop(n,!0):(n.svg.style.opacity=e+\"\",se&&(He(n,n.svg),Ue(n)))},a.show_animOptions.duration,1,a.show_animOptions.timing,null,!1),M.fade.start(n,e)},start:function(e,t){var n,a=e.curStats;a.show_inAnim&&(n=g.stop(a.show_animId)),$e(e,1),a.show_inAnim=!0,g.start(a.show_animId,!e.aplStats.show_on,null!=t?t:n)},stop:function(e,t,n){var a,i=e.curStats;return n=null!=n?n:e.aplStats.show_on,a=i.show_inAnim?g.stop(i.show_animId):n?1:0,i.show_inAnim=!1,t&&(e.svg.style.opacity=n?\"\":\"0\",$e(e,n)),a}},draw:{defaultAnimOptions:{duration:500,timing:[.58,0,.42,1]},init:function(n,e){var t=n.curStats,a=n.aplStats,l=n.pathList.baseVal,i=Fe(l),r=i.segsLen,s=i.lenAll;t.show_animId&&g.remove(t.show_animId),t.show_animId=g.add(function(e){var t,n,a,i,o=-1;if(0===e)n=[[l[0][0],l[0][0]]];else if(1===e)n=l;else{for(t=s*e,n=[];t>=r[++o];)n.push(l[o]),t-=r[o];t&&(2===(a=l[o]).length?n.push([a[0],Pe(a[0],a[1],t/r[o])]):(i=Te(a[0],a[1],a[2],a[3],Be(a[0],a[1],a[2],a[3],t)),n.push([a[0],i.fromP1,i.fromP2,i])))}return n},function(e,t){t?M.draw.stop(n,!0):(n.pathList.animVal=e,et(n,{path:!0}))},a.show_animOptions.duration,1,a.show_animOptions.timing,null,!1),M.draw.start(n,e)},start:function(e,t){var n,a=e.curStats;a.show_inAnim&&(n=g.stop(a.show_animId)),$e(e,1),a.show_inAnim=!0,De(e,\"apl_position\",M.draw.update),g.start(a.show_animId,!e.aplStats.show_on,null!=t?t:n)},stop:function(e,t,n){var a,i=e.curStats;return n=null!=n?n:e.aplStats.show_on,a=i.show_inAnim?g.stop(i.show_animId):n?1:0,i.show_inAnim=!1,t&&(e.pathList.animVal=n?null:[[e.pathList.baseVal[0][0],e.pathList.baseVal[0][0]]],et(e,{path:!0}),$e(e,n)),a},update:function(e){ze(e,\"apl_position\",M.draw.update),e.curStats.show_inAnim?M.draw.init(e,M.draw.stop(e)):e.aplStats.show_animOptions={}}}},[[\"start\",\"anchorSE\",0],[\"end\",\"anchorSE\",1],[\"color\",\"lineColor\"],[\"size\",\"lineSize\"],[\"startSocketGravity\",\"socketGravitySE\",0],[\"endSocketGravity\",\"socketGravitySE\",1],[\"startPlugColor\",\"plugColorSE\",0],[\"endPlugColor\",\"plugColorSE\",1],[\"startPlugSize\",\"plugSizeSE\",0],[\"endPlugSize\",\"plugSizeSE\",1],[\"outline\",\"lineOutlineEnabled\"],[\"outlineColor\",\"lineOutlineColor\"],[\"outlineSize\",\"lineOutlineSize\"],[\"startPlugOutline\",\"plugOutlineEnabledSE\",0],[\"endPlugOutline\",\"plugOutlineEnabledSE\",1],[\"startPlugOutlineColor\",\"plugOutlineColorSE\",0],[\"endPlugOutlineColor\",\"plugOutlineColorSE\",1],[\"startPlugOutlineSize\",\"plugOutlineSizeSE\",0],[\"endPlugOutlineSize\",\"plugOutlineSizeSE\",1]].forEach(function(e){var t=e[0],n=e[1],a=e[2];Object.defineProperty(lt.prototype,t,{get:function(){var e=null!=a?ge[this._id].options[n][a]:n?ge[this._id].options[n]:ge[this._id].options[t];return null==e?U:Oe(e)},set:rt(t),enumerable:!0})}),[[\"path\",z],[\"startSocket\",W,\"socketSE\",0],[\"endSocket\",W,\"socketSE\",1],[\"startPlug\",j,\"plugSE\",0],[\"endPlug\",j,\"plugSE\",1]].forEach(function(e){var a=e[0],i=e[1],o=e[2],l=e[3];Object.defineProperty(lt.prototype,a,{get:function(){var t,n=null!=l?ge[this._id].options[o][l]:o?ge[this._id].options[o]:ge[this._id].options[a];return n?Object.keys(i).some(function(e){return i[e]===n&&(t=e,!0)})?t:new Error(\"It's broken\"):U},set:rt(a),enumerable:!0})}),Object.keys(te).forEach(function(n){var a=te[n];Object.defineProperty(lt.prototype,n,{get:function(){var u,e,t=ge[this._id].options[n];return fe(t)?(u=t,e=a.optionsConf.reduce(function(e,t){var n,a=t[0],i=t[1],o=t[2],l=t[3],r=t[4],s=null!=r?u[l][r]:l?u[l]:u[i];return e[i]=\"id\"===a?s?Object.keys(o).some(function(e){return o[e]===s&&(n=e,!0)})?n:new Error(\"It's broken\"):U:null==s?U:Oe(s),e},{}),a.anim&&(e.animation=Oe(u.animation)),e):t},set:rt(n),enumerable:!0})}),[\"startLabel\",\"endLabel\",\"middleLabel\"].forEach(function(e,n){Object.defineProperty(lt.prototype,e,{get:function(){var e=ge[this._id],t=e.options;return t.labelSEM[n]&&!e.optionIsAttach.labelSEM[n]?ve[t.labelSEM[n]._id].text:t.labelSEM[n]||\"\"},set:rt(e),enumerable:!0})}),lt.prototype.setOptions=function(e){return ot(ge[this._id],e),this},lt.prototype.position=function(){return et(ge[this._id],{position:!0}),this},lt.prototype.remove=function(){var t=ge[this._id],n=t.curStats;Object.keys(te).forEach(function(e){var t=e+\"_animId\";n[t]&&g.remove(n[t])}),n.show_animId&&g.remove(n.show_animId),t.attachments.slice().forEach(function(e){it(t,e)}),t.baseWindow&&t.svg&&t.baseWindow.document.body.removeChild(t.svg),delete ge[this._id]},lt.prototype.show=function(e,t){return nt(ge[this._id],!0,e,t),this},lt.prototype.hide=function(e,t){return nt(ge[this._id],!1,e,t),this},o=function(t){t&&ve[t._id]&&(t.boundTargets.slice().forEach(function(e){it(e.props,t,!0)}),t.conf.remove&&t.conf.remove(t),delete ve[t._id])},st.prototype.remove=function(){var t=this,n=ve[t._id];n&&(n.boundTargets.slice().forEach(function(e){n.conf.removeOption(n,e)}),je(function(){var e=ve[t._id];e&&(console.error(\"LeaderLineAttachment was not removed by removeOption\"),o(e))}))},C=st,window.LeaderLineAttachment=C,L=function(e,t){return e instanceof C&&(!(e.isRemoved||t&&ve[e._id].conf.type!==t)||null)},I={pointAnchor:{type:\"anchor\",argOptions:[{optionName:\"element\",type:Ie}],init:function(e,t){return e.element=I.pointAnchor.checkElement(t.element),e.x=I.pointAnchor.parsePercent(t.x,!0)||[.5,!0],e.y=I.pointAnchor.parsePercent(t.y,!0)||[.5,!0],!0},removeOption:function(e,t){var n=t.props,a={},i=e.element,o=n.options.anchorSE[\"start\"===t.optionName?1:0];i===o&&(i=o===document.body?new C(I.pointAnchor,[i]):document.body),a[t.optionName]=i,ot(n,a)},getBBoxNest:function(e,t){var n=Ae(e.element,t.baseWindow),a=n.width,i=n.height;return n.width=n.height=0,n.left=n.right=n.left+e.x[0]*(e.x[1]?a:1),n.top=n.bottom=n.top+e.y[0]*(e.y[1]?i:1),n},parsePercent:function(e,t){var n,a,i=!1;return ye(e)?a=e:\"string\"==typeof e&&(n=m.exec(e))&&n[2]&&(i=0!==(a=parseFloat(n[1])/100)),null!=a&&(t||0<=a)?[a,i]:null},checkElement:function(e){if(null==e)e=document.body;else if(!Ie(e))throw new Error(\"`element` must be Element\");return e}},areaAnchor:{type:\"anchor\",argOptions:[{optionName:\"element\",type:Ie},{optionName:\"shape\",type:\"string\"}],stats:{color:{},strokeWidth:{},elementWidth:{},elementHeight:{},elementLeft:{},elementTop:{},pathListRel:{},bBoxRel:{},pathData:{},viewBoxBBox:{hasProps:!0},dashLen:{},dashGap:{}},init:function(i,e){var t,n,a,o=[];return i.element=I.pointAnchor.checkElement(e.element),\"string\"==typeof e.color&&(i.color=e.color.trim()),\"string\"==typeof e.fillColor&&(i.fill=e.fillColor.trim()),ye(e.size)&&0<=e.size&&(i.size=e.size),e.dash&&(i.dash=!0,ye(e.dash.len)&&0<e.dash.len&&(i.dashLen=e.dash.len),ye(e.dash.gap)&&0<e.dash.gap&&(i.dashGap=e.dash.gap)),\"circle\"===e.shape?i.shape=e.shape:\"polygon\"===e.shape&&Array.isArray(e.points)&&3<=e.points.length&&e.points.every(function(e){var t={};return!(!(t.x=I.pointAnchor.parsePercent(e[0],!0))||!(t.y=I.pointAnchor.parsePercent(e[1],!0)))&&(o.push(t),(t.x[1]||t.y[1])&&(i.hasRatio=!0),!0)})?(i.shape=e.shape,i.points=o):(i.shape=\"rect\",i.radius=ye(e.radius)&&0<=e.radius?e.radius:0),\"rect\"!==i.shape&&\"circle\"!==i.shape||(i.x=I.pointAnchor.parsePercent(e.x,!0)||[-.05,!0],i.y=I.pointAnchor.parsePercent(e.y,!0)||[-.05,!0],i.width=I.pointAnchor.parsePercent(e.width)||[1.1,!0],i.height=I.pointAnchor.parsePercent(e.height)||[1.1,!0],(i.x[1]||i.y[1]||i.width[1]||i.height[1])&&(i.hasRatio=!0)),t=i.element.ownerDocument,i.svg=n=t.createElementNS(re,\"svg\"),n.className.baseVal=A+\"-areaAnchor\",n.viewBox.baseVal||n.setAttribute(\"viewBox\",\"0 0 0 0\"),i.path=n.appendChild(t.createElementNS(re,\"path\")),i.path.style.fill=i.fill||\"none\",i.isShown=!1,n.style.visibility=\"hidden\",t.body.appendChild(n),Ke(a=t.defaultView),i.bodyOffset=Qe(a),i.updateColor=function(){var e,t=i.curStats,n=i.aplStats,a=i.boundTargets.length?i.boundTargets[0].props.curStats:null;t.color=e=i.color||(a?a.line_color:de.lineColor),qe(i,n,\"color\",e)&&(i.path.style.stroke=e)},i.updateShow=function(){$e(i,i.boundTargets.some(function(e){return!0===e.props.isShown}))},!0},bind:function(e,t){var n=t.props;return e.color||De(n,\"cur_line_color\",e.updateColor),De(n,\"svgShow\",e.updateShow),je(function(){e.updateColor(),e.updateShow()}),!0},unbind:function(e,t){var n=t.props;e.color||ze(n,\"cur_line_color\",e.updateColor),ze(n,\"svgShow\",e.updateShow),1<e.boundTargets.length&&je(function(){e.updateColor(),e.updateShow(),I.areaAnchor.update(e)&&e.boundTargets.forEach(function(e){et(e.props,{position:!0})})})},removeOption:function(e,t){I.pointAnchor.removeOption(e,t)},remove:function(t){t.boundTargets.length&&(console.error(\"LeaderLineAttachment was not unbound by remove\"),t.boundTargets.forEach(function(e){I.areaAnchor.unbind(t,e)})),t.svg.parentNode.removeChild(t.svg)},getStrokeWidth:function(e,t){return I.areaAnchor.update(e)&&1<e.boundTargets.length&&je(function(){e.boundTargets.forEach(function(e){e.props!==t&&et(e.props,{position:!0})})}),e.curStats.strokeWidth},getPathData:function(e,t){var n=Ae(e.element,t.baseWindow);return Re(e.curStats.pathListRel,function(e){e.x+=n.left,e.y+=n.top})},getBBoxNest:function(e,t){var n=Ae(e.element,t.baseWindow),a=e.curStats.bBoxRel;return{left:a.left+n.left,top:a.top+n.top,right:a.right+n.left,bottom:a.bottom+n.top,width:a.width,height:a.height}},update:function(t){var a,n,i,o,e,l,r,s,u,h,p,c,d,f,y,m,S,g,_,v,E,x,b,k,w,O,M,I,C,L,A,V,P=t.curStats,N=t.aplStats,T=t.boundTargets.length?t.boundTargets[0].props.curStats:null,W={};if(W.strokeWidth=qe(t,P,\"strokeWidth\",null!=t.size?t.size:T?T.line_strokeWidth:de.lineSize),a=Ce(t.element),W.elementWidth=qe(t,P,\"elementWidth\",a.width),W.elementHeight=qe(t,P,\"elementHeight\",a.height),W.elementLeft=qe(t,P,\"elementLeft\",a.left),W.elementTop=qe(t,P,\"elementTop\",a.top),W.strokeWidth||t.hasRatio&&(W.elementWidth||W.elementHeight)){switch(t.shape){case\"rect\":(I={left:t.x[0]*(t.x[1]?a.width:1),top:t.y[0]*(t.y[1]?a.height:1),width:t.width[0]*(t.width[1]?a.width:1),height:t.height[0]*(t.height[1]?a.height:1)}).right=I.left+I.width,I.bottom=I.top+I.height,b=P.strokeWidth/2,E=(x=Math.min(I.width,I.height))?x/2*Math.SQRT2+b:0,O=(v=t.radius?t.radius<=E?t.radius:E:0)?(w=v-(k=(v-b)/Math.SQRT2),M=v*ee,O=[{x:I.left-w,y:I.top+k},{x:I.left+k,y:I.top-w},{x:I.right-k,y:I.top-w},{x:I.right+w,y:I.top+k},{x:I.right+w,y:I.bottom-k},{x:I.right-k,y:I.bottom+w},{x:I.left+k,y:I.bottom+w},{x:I.left-w,y:I.bottom-k}],P.pathListRel=[[O[0],{x:O[0].x,y:O[0].y-M},{x:O[1].x-M,y:O[1].y},O[1]]],O[1].x!==O[2].x&&P.pathListRel.push([O[1],O[2]]),P.pathListRel.push([O[2],{x:O[2].x+M,y:O[2].y},{x:O[3].x,y:O[3].y-M},O[3]]),O[3].y!==O[4].y&&P.pathListRel.push([O[3],O[4]]),P.pathListRel.push([O[4],{x:O[4].x,y:O[4].y+M},{x:O[5].x+M,y:O[5].y},O[5]]),O[5].x!==O[6].x&&P.pathListRel.push([O[5],O[6]]),P.pathListRel.push([O[6],{x:O[6].x-M,y:O[6].y},{x:O[7].x,y:O[7].y+M},O[7]]),O[7].y!==O[0].y&&P.pathListRel.push([O[7],O[0]]),P.pathListRel.push([]),w=v-k+P.strokeWidth/2,[{x:I.left-w,y:I.top-w},{x:I.right+w,y:I.bottom+w}]):(w=P.strokeWidth/2,O=[{x:I.left-w,y:I.top-w},{x:I.right+w,y:I.bottom+w}],P.pathListRel=[[O[0],{x:O[1].x,y:O[0].y}],[{x:O[1].x,y:O[0].y},O[1]],[O[1],{x:O[0].x,y:O[1].y}],[]],[{x:I.left-P.strokeWidth,y:I.top-P.strokeWidth},{x:I.right+P.strokeWidth,y:I.bottom+P.strokeWidth}]),P.bBoxRel={left:O[0].x,top:O[0].y,right:O[1].x,bottom:O[1].y,width:O[1].x-O[0].x,height:O[1].y-O[0].y};break;case\"circle\":(_={left:t.x[0]*(t.x[1]?a.width:1),top:t.y[0]*(t.y[1]?a.height:1),width:t.width[0]*(t.width[1]?a.width:1),height:t.height[0]*(t.height[1]?a.height:1)}).width||_.height||(_.width=_.height=10),_.width||(_.width=_.height),_.height||(_.height=_.width),_.right=_.left+_.width,_.bottom=_.top+_.height,r=_.left+_.width/2,s=_.top+_.height/2,d=P.strokeWidth/2,f=_.width/2,y=_.height/2,u=f*Math.SQRT2+d,h=y*Math.SQRT2+d,p=u*ee,c=h*ee,g=[{x:r-u,y:s},{x:r,y:s-h},{x:r+u,y:s},{x:r,y:s+h}],P.pathListRel=[[g[0],{x:g[0].x,y:g[0].y-c},{x:g[1].x-p,y:g[1].y},g[1]],[g[1],{x:g[1].x+p,y:g[1].y},{x:g[2].x,y:g[2].y-c},g[2]],[g[2],{x:g[2].x,y:g[2].y+c},{x:g[3].x+p,y:g[3].y},g[3]],[g[3],{x:g[3].x-p,y:g[3].y},{x:g[0].x,y:g[0].y+c},g[0]],[]],m=u-f+P.strokeWidth/2,S=h-y+P.strokeWidth/2,g=[{x:_.left-m,y:_.top-S},{x:_.right+m,y:_.bottom+S}],P.bBoxRel={left:g[0].x,top:g[0].y,right:g[1].x,bottom:g[1].y,width:g[1].x-g[0].x,height:g[1].y-g[0].y};break;case\"polygon\":t.points.forEach(function(e){var t=e.x[0]*(e.x[1]?a.width:1),n=e.y[0]*(e.y[1]?a.height:1);i?(t<i.left&&(i.left=t),t>i.right&&(i.right=t),n<i.top&&(i.top=n),n>i.bottom&&(i.bottom=n)):i={left:t,right:t,top:n,bottom:n},o?P.pathListRel.push([o,{x:t,y:n}]):P.pathListRel=[],o={x:t,y:n}}),P.pathListRel.push([]),e=P.strokeWidth/2,l=[{x:i.left-e,y:i.top-e},{x:i.right+e,y:i.bottom+e}],P.bBoxRel={left:l[0].x,top:l[0].y,right:l[1].x,bottom:l[1].y,width:l[1].x-l[0].x,height:l[1].y-l[0].y}}W.pathListRel=W.bBoxRel=!0}return(W.pathListRel||W.elementLeft||W.elementTop)&&(P.pathData=Re(P.pathListRel,function(e){e.x+=a.left,e.y+=a.top})),qe(t,N,\"strokeWidth\",n=P.strokeWidth)&&(t.path.style.strokeWidth=n+\"px\"),Ge(n=P.pathData,N.pathData)&&(t.path.setPathData(n),N.pathData=n,W.pathData=!0),t.dash&&(!W.pathData&&(!W.strokeWidth||t.dashLen&&t.dashGap)||(P.dashLen=t.dashLen||2*P.strokeWidth,P.dashGap=t.dashGap||P.strokeWidth),W.dash=qe(t,N,\"dashLen\",P.dashLen)||W.dash,W.dash=qe(t,N,\"dashGap\",P.dashGap)||W.dash,W.dash&&(t.path.style.strokeDasharray=N.dashLen+\",\"+N.dashGap)),C=P.viewBoxBBox,L=N.viewBoxBBox,A=t.svg.viewBox.baseVal,V=t.svg.style,C.x=P.bBoxRel.left+a.left,C.y=P.bBoxRel.top+a.top,C.width=P.bBoxRel.width,C.height=P.bBoxRel.height,[\"x\",\"y\",\"width\",\"height\"].forEach(function(e){(n=C[e])!==L[e]&&(A[e]=L[e]=n,V[oe[e]]=n+(\"x\"===e||\"y\"===e?t.bodyOffset[e]:0)+\"px\")}),W.strokeWidth||W.pathListRel||W.bBoxRel}},mouseHoverAnchor:{type:\"anchor\",argOptions:[{optionName:\"element\",type:Ie},{optionName:\"showEffectName\",type:\"string\"}],style:{backgroundImage:\"url('data:image/svg+xml;charset=utf-8;base64,PHN2ZyB2ZXJzaW9uPSIxLjEiIHhtbG5zPSJodHRwOi8vd3d3LnczLm9yZy8yMDAwL3N2ZyIgd2lkdGg9IjI0IiBoZWlnaHQ9IjI0Ij48cG9seWdvbiBwb2ludHM9IjI0LDAgMCw4IDgsMTEgMCwxOSA1LDI0IDEzLDE2IDE2LDI0IiBmaWxsPSJjb3JhbCIvPjwvc3ZnPg==')\",backgroundSize:\"\",backgroundRepeat:\"no-repeat\",backgroundColor:\"#f8f881\",cursor:\"default\"},hoverStyle:{backgroundImage:\"none\",backgroundColor:\"#fadf8f\"},padding:{top:1,right:15,bottom:1,left:2},minHeight:15,backgroundPosition:{right:2,top:2},backgroundSize:{width:12,height:12},dirKeys:[[\"top\",\"Top\"],[\"right\",\"Right\"],[\"bottom\",\"Bottom\"],[\"left\",\"Left\"]],init:function(a,i){var o,t,e,n,l,r,s,u,h,p,c,d=I.mouseHoverAnchor,f={};if(a.element=I.pointAnchor.checkElement(i.element),u=a.element,!((p=u.ownerDocument)&&(h=p.defaultView)&&h.HTMLElement&&u instanceof h.HTMLElement))throw new Error(\"`element` must be HTML element\");return d.style.backgroundSize=d.backgroundSize.width+\"px \"+d.backgroundSize.height+\"px\",[\"style\",\"hoverStyle\"].forEach(function(e){var n=d[e];a[e]=Object.keys(n).reduce(function(e,t){return e[t]=n[t],e},{})}),\"inline\"===(o=a.element.ownerDocument.defaultView.getComputedStyle(a.element,\"\")).display?a.style.display=\"inline-block\":\"none\"===o.display&&(a.style.display=\"block\"),I.mouseHoverAnchor.dirKeys.forEach(function(e){var t=e[0],n=\"padding\"+e[1];parseFloat(o[n])<d.padding[t]&&(a.style[n]=d.padding[t]+\"px\")}),a.style.display&&(n=a.element.style.display,a.element.style.display=a.style.display),I.mouseHoverAnchor.dirKeys.forEach(function(e){var t=\"padding\"+e[1];a.style[t]&&(f[t]=a.element.style[t],a.element.style[t]=a.style[t])}),(e=a.element.getBoundingClientRect()).height<d.minHeight&&(se?(c=d.minHeight,\"content-box\"===o.boxSizing?c-=parseFloat(o.borderTopWidth)+parseFloat(o.borderBottomWidth)+parseFloat(o.paddingTop)+parseFloat(o.paddingBottom):\"padding-box\"===o.boxSizing&&(c-=parseFloat(o.borderTopWidth)+parseFloat(o.borderBottomWidth)),a.style.height=c+\"px\"):a.style.height=parseFloat(o.height)+(d.minHeight-e.height)+\"px\"),a.style.backgroundPosition=pe?e.width-d.backgroundSize.width-d.backgroundPosition.right+\"px \"+d.backgroundPosition.top+\"px\":\"right \"+d.backgroundPosition.right+\"px top \"+d.backgroundPosition.top+\"px\",a.style.display&&(a.element.style.display=n),I.mouseHoverAnchor.dirKeys.forEach(function(e){var t=\"padding\"+e[1];a.style[t]&&(a.element.style[t]=f[t])}),[\"style\",\"hoverStyle\"].forEach(function(e){var t=a[e],n=i[e];fe(n)&&Object.keys(n).forEach(function(e){\"string\"==typeof n[e]||ye(n[e])?t[e]=n[e]:null==n[e]&&delete t[e]})}),\"function\"==typeof i.onSwitch&&(s=i.onSwitch),i.showEffectName&&M[i.showEffectName]&&(a.showEffectName=l=i.showEffectName),r=i.animOptions,a.elmStyle=t=a.element.style,a.mouseenter=function(e){a.hoverStyleSave=d.getStyles(t,Object.keys(a.hoverStyle)),d.setStyles(t,a.hoverStyle),a.boundTargets.forEach(function(e){nt(e.props,!0,l,r)}),s&&s(e)},a.mouseleave=function(e){d.setStyles(t,a.hoverStyleSave),a.boundTargets.forEach(function(e){nt(e.props,!1,l,r)}),s&&s(e)},!0},bind:function(e,t){var n,a,i,o,l;return t.props.svg?I.mouseHoverAnchor.llShow(t.props,!1,e.showEffectName):je(function(){I.mouseHoverAnchor.llShow(t.props,!1,e.showEffectName)}),e.enabled||(e.styleSave=I.mouseHoverAnchor.getStyles(e.elmStyle,Object.keys(e.style)),I.mouseHoverAnchor.setStyles(e.elmStyle,e.style),e.removeEventListener=(n=e.element,a=e.mouseenter,i=e.mouseleave,\"onmouseenter\"in n&&\"onmouseleave\"in n?(n.addEventListener(\"mouseenter\",a,!1),n.addEventListener(\"mouseleave\",i,!1),function(){n.removeEventListener(\"mouseenter\",a,!1),n.removeEventListener(\"mouseleave\",i,!1)}):(console.warn(\"mouseenter and mouseleave events polyfill is enabled.\"),o=function(e){e.relatedTarget&&(e.relatedTarget===this||this.compareDocumentPosition(e.relatedTarget)&Node.DOCUMENT_POSITION_CONTAINED_BY)||a.apply(this,arguments)},n.addEventListener(\"mouseover\",o),l=function(e){e.relatedTarget&&(e.relatedTarget===this||this.compareDocumentPosition(e.relatedTarget)&Node.DOCUMENT_POSITION_CONTAINED_BY)||i.apply(this,arguments)},n.addEventListener(\"mouseout\",l),function(){n.removeEventListener(\"mouseover\",o,!1),n.removeEventListener(\"mouseout\",l,!1)})),e.enabled=!0),!0},unbind:function(e,t){e.enabled&&e.boundTargets.length<=1&&(e.removeEventListener(),I.mouseHoverAnchor.setStyles(e.elmStyle,e.styleSave),e.enabled=!1),I.mouseHoverAnchor.llShow(t.props,!0,e.showEffectName)},removeOption:function(e,t){I.pointAnchor.removeOption(e,t)},remove:function(t){t.boundTargets.length&&(console.error(\"LeaderLineAttachment was not unbound by remove\"),t.boundTargets.forEach(function(e){I.mouseHoverAnchor.unbind(t,e)}))},getBBoxNest:function(e,t){return Ae(e.element,t.baseWindow)},llShow:function(e,t,n){M[n||e.curStats.show_effect].stop(e,!0,t),e.aplStats.show_on=t},getStyles:function(n,e){return e.reduce(function(e,t){return e[t]=n[t],e},{})},setStyles:function(t,n){Object.keys(n).forEach(function(e){t[e]=n[e]})}},captionLabel:{type:\"label\",argOptions:[{optionName:\"text\",type:\"string\"}],stats:{color:{},x:{},y:{}},textStyleProps:[\"fontFamily\",\"fontStyle\",\"fontVariant\",\"fontWeight\",\"fontStretch\",\"fontSize\",\"fontSizeAdjust\",\"kerning\",\"letterSpacing\",\"wordSpacing\",\"textDecoration\"],init:function(u,t){return\"string\"==typeof t.text&&(u.text=t.text.trim()),!!u.text&&(\"string\"==typeof t.color&&(u.color=t.color.trim()),u.outlineColor=\"string\"==typeof t.outlineColor?t.outlineColor.trim():\"#fff\",Array.isArray(t.offset)&&ye(t.offset[0])&&ye(t.offset[1])&&(u.offset={x:t.offset[0],y:t.offset[1]}),ye(t.lineOffset)&&(u.lineOffset=t.lineOffset),I.captionLabel.textStyleProps.forEach(function(e){null!=t[e]&&(u[e]=t[e])}),u.updateColor=function(e){I.captionLabel.updateColor(u,e)},u.updateSocketXY=function(e){var t,n,a,i,o=u.curStats,l=u.aplStats,r=e.curStats,s=r.position_socketXYSE[u.socketIndex];null!=s.x&&(u.offset?(o.x=s.x+u.offset.x,o.y=s.y+u.offset.y):(t=u.height/2,n=Math.max(r.attach_plugSideLenSE[u.socketIndex]||0,r.line_strokeWidth/2),a=r.position_socketXYSE[u.socketIndex?0:1],s.socketId===T||s.socketId===P?(o.x=s.socketId===T?s.x-t-u.width:s.x+t,o.y=a.y<s.y?s.y+n+t:s.y-n-t-u.height):(o.x=a.x<s.x?s.x+n+t:s.x-n-t-u.width,o.y=s.socketId===V?s.y-t-u.height:s.y+t)),qe(u,l,\"x\",i=o.x)&&(u.elmPosition.x.baseVal.getItem(0).value=i),qe(u,l,\"y\",i=o.y)&&(u.elmPosition.y.baseVal.getItem(0).value=i+u.height))},u.updatePath=function(e){var t,n,a=u.curStats,i=u.aplStats,o=e.pathList.animVal||e.pathList.baseVal;o&&(t=I.captionLabel.getMidPoint(o,u.lineOffset),a.x=t.x-u.width/2,a.y=t.y-u.height/2,qe(u,i,\"x\",n=a.x)&&(u.elmPosition.x.baseVal.getItem(0).value=n),qe(u,i,\"y\",n=a.y)&&(u.elmPosition.y.baseVal.getItem(0).value=n+u.height))},u.updateShow=function(e){I.captionLabel.updateShow(u,e)},pe&&(u.adjustEdge=function(e,t){var n=u.curStats;null!=n.x&&I.captionLabel.adjustEdge(t,{x:n.x,y:n.y,width:u.width,height:u.height},u.strokeWidth/2)}),!0)},updateColor:function(e,t){var n,a=e.curStats,i=e.aplStats,o=t.curStats;a.color=n=e.color||o.line_color,qe(e,i,\"color\",n)&&(e.styleFill.fill=n)},updateShow:function(e,t){var n=!0===t.isShown;n!==e.isShown&&(e.styleShow.visibility=n?\"\":\"hidden\",e.isShown=n)},adjustEdge:function(e,t,n){var a={x1:t.x-n,y1:t.y-n,x2:t.x+t.width+n,y2:t.y+t.height+n};a.x1<e.x1&&(e.x1=a.x1),a.y1<e.y1&&(e.y1=a.y1),a.x2>e.x2&&(e.x2=a.x2),a.y2>e.y2&&(e.y2=a.y2)},newText:function(e,t,n,a,i){var o,l,r,s,u,h=t.createElementNS(re,\"text\");return h.textContent=e,[h.x,h.y].forEach(function(e){var t=n.createSVGLength();t.newValueSpecifiedUnits(SVGLength.SVG_LENGTHTYPE_PX,0),e.baseVal.initialize(t)}),\"boolean\"!=typeof f&&(f=\"paintOrder\"in h.style),i&&!f?(l=t.createElementNS(re,\"defs\"),h.id=a,l.appendChild(h),(s=(o=t.createElementNS(re,\"g\")).appendChild(t.createElementNS(re,\"use\"))).href.baseVal=\"#\"+a,(r=o.appendChild(t.createElementNS(re,\"use\"))).href.baseVal=\"#\"+a,(u=s.style).strokeLinejoin=\"round\",{elmPosition:h,styleText:h.style,styleFill:r.style,styleStroke:u,styleShow:o.style,elmsAppend:[l,o]}):(u=h.style,i&&(u.strokeLinejoin=\"round\",u.paintOrder=\"stroke\"),{elmPosition:h,styleText:u,styleFill:u,styleStroke:i?u:null,styleShow:u,elmsAppend:[h]})},getMidPoint:function(e,t){var n,a,i=Fe(e),o=i.segsLen,l=i.lenAll,r=-1,s=l/2+(t||0);if(s<=0)return 2===(n=e[0]).length?Pe(n[0],n[1],0):Te(n[0],n[1],n[2],n[3],0);if(l<=s)return 2===(n=e[e.length-1]).length?Pe(n[0],n[1],1):Te(n[0],n[1],n[2],n[3],1);for(a=[];s>o[++r];)a.push(e[r]),s-=o[r];return 2===(n=e[r]).length?Pe(n[0],n[1],s/o[r]):Te(n[0],n[1],n[2],n[3],Be(n[0],n[1],n[2],n[3],s))},initSvg:function(t,n){var e,a,i=I.captionLabel.newText(t.text,n.baseWindow.document,n.svg,A+\"-captionLabel-\"+t._id,t.outlineColor);[\"elmPosition\",\"styleFill\",\"styleShow\",\"elmsAppend\"].forEach(function(e){t[e]=i[e]}),t.isShown=!1,t.styleShow.visibility=\"hidden\",I.captionLabel.textStyleProps.forEach(function(e){null!=t[e]&&(i.styleText[e]=t[e])}),i.elmsAppend.forEach(function(e){n.svg.appendChild(e)}),e=i.elmPosition.getBBox(),t.width=e.width,t.height=e.height,t.outlineColor&&(a=10<(a=e.height/9)?10:a<2?2:a,i.styleStroke.strokeWidth=a+\"px\",i.styleStroke.stroke=t.outlineColor),t.strokeWidth=a||0,Xe(t.aplStats,I.captionLabel.stats),t.updateColor(n),t.refSocketXY?t.updateSocketXY(n):t.updatePath(n),pe&&et(n,{}),t.updateShow(n)},bind:function(e,t){var n=t.props;return e.color||De(n,\"cur_line_color\",e.updateColor),(e.refSocketXY=\"startLabel\"===t.optionName||\"endLabel\"===t.optionName)?(e.socketIndex=\"startLabel\"===t.optionName?0:1,De(n,\"apl_position\",e.updateSocketXY),e.offset||(De(n,\"cur_attach_plugSideLenSE\",e.updateSocketXY),De(n,\"cur_line_strokeWidth\",e.updateSocketXY))):De(n,\"apl_path\",e.updatePath),De(n,\"svgShow\",e.updateShow),pe&&De(n,\"new_edge4viewBox\",e.adjustEdge),I.captionLabel.initSvg(e,n),!0},unbind:function(e,t){var n=t.props;e.elmsAppend&&(e.elmsAppend.forEach(function(e){n.svg.removeChild(e)}),e.elmPosition=e.styleFill=e.styleShow=e.elmsAppend=null),Xe(e.curStats,I.captionLabel.stats),Xe(e.aplStats,I.captionLabel.stats),e.color||ze(n,\"cur_line_color\",e.updateColor),e.refSocketXY?(ze(n,\"apl_position\",e.updateSocketXY),e.offset||(ze(n,\"cur_attach_plugSideLenSE\",e.updateSocketXY),ze(n,\"cur_line_strokeWidth\",e.updateSocketXY))):ze(n,\"apl_path\",e.updatePath),ze(n,\"svgShow\",e.updateShow),pe&&(ze(n,\"new_edge4viewBox\",e.adjustEdge),et(n,{}))},removeOption:function(e,t){var n=t.props,a={};a[t.optionName]=\"\",ot(n,a)},remove:function(t){t.boundTargets.length&&(console.error(\"LeaderLineAttachment was not unbound by remove\"),t.boundTargets.forEach(function(e){I.captionLabel.unbind(t,e)}))}},pathLabel:{type:\"label\",argOptions:[{optionName:\"text\",type:\"string\"}],stats:{color:{},startOffset:{},pathData:{}},init:function(s,t){return\"string\"==typeof t.text&&(s.text=t.text.trim()),!!s.text&&(\"string\"==typeof t.color&&(s.color=t.color.trim()),s.outlineColor=\"string\"==typeof t.outlineColor?t.outlineColor.trim():\"#fff\",ye(t.lineOffset)&&(s.lineOffset=t.lineOffset),I.captionLabel.textStyleProps.forEach(function(e){null!=t[e]&&(s[e]=t[e])}),s.updateColor=function(e){I.captionLabel.updateColor(s,e)},s.updatePath=function(e){var t,n=s.curStats,a=s.aplStats,i=e.curStats,o=e.pathList.animVal||e.pathList.baseVal;o&&(n.pathData=t=I.pathLabel.getOffsetPathData(o,i.line_strokeWidth/2+s.strokeWidth/2+s.height/4,1.25*s.height),Ge(t,a.pathData)&&(s.elmPath.setPathData(t),a.pathData=t,s.bBox=s.elmPosition.getBBox(),s.updateStartOffset(e)))},s.updateStartOffset=function(e){var t,i,n,a,o=s.curStats,l=s.aplStats,r=e.curStats;o.pathData&&(2===s.semIndex&&!s.lineOffset||(n=o.pathData.reduce(function(e,t){var n,a=t.values;switch(t.type){case\"M\":i={x:a[0],y:a[1]};break;case\"L\":n={x:a[0],y:a[1]},i&&(e+=Ve(i,n)),i=n;break;case\"C\":n={x:a[4],y:a[5]},i&&(e+=We(i,{x:a[0],y:a[1]},{x:a[2],y:a[3]},n)),i=n}return e},0),a=0===s.semIndex?0:1===s.semIndex?n:n/2,2!==s.semIndex&&(t=Math.max(r.attach_plugBackLenSE[s.semIndex]||0,r.line_strokeWidth/2)+s.strokeWidth/2+s.height/4,a=(a+=0===s.semIndex?t:-t)<0?0:n<a?n:a),s.lineOffset&&(a=(a+=s.lineOffset)<0?0:n<a?n:a),o.startOffset=a,qe(s,l,\"startOffset\",a)&&(s.elmOffset.startOffset.baseVal.value=a)))},s.updateShow=function(e){I.captionLabel.updateShow(s,e)},pe&&(s.adjustEdge=function(e,t){s.bBox&&I.captionLabel.adjustEdge(t,s.bBox,s.strokeWidth/2)}),!0)},getOffsetPathData:function(e,x,n){var b,a,k=[];function w(e,t){return Math.abs(e.x-t.x)<3&&Math.abs(e.y-t.y)<3}return e.forEach(function(e){var t,n,a,i,o,l,r,s,u,h,p,c,d,f,y,m,S,g,_,v,E;2===e.length?(g=e[0],_=e[1],v=x,E=Math.atan2(g.y-_.y,_.x-g.x)+.5*Math.PI,t=[{x:g.x+Math.cos(E)*v,y:g.y+Math.sin(E)*v*-1},{x:_.x+Math.cos(E)*v,y:_.y+Math.sin(E)*v*-1}],b?(a=b.points,0<=(i=Math.atan2(a[1].y-a[0].y,a[0].x-a[1].x)-Math.atan2(e[0].y-e[1].y,e[1].x-e[0].x))&&i<=Math.PI?n={type:\"line\",points:t,inside:!0}:(l=Ne(a[0],a[1],x),o=Ne(t[1],t[0],x),s=a[0],h=o,p=t[1],c=(u=l).x-s.x,d=u.y-s.y,f=p.x-h.x,y=p.y-h.y,m=(-d*(s.x-h.x)+c*(s.y-h.y))/(-f*d+c*y),S=(f*(s.y-h.y)-y*(s.x-h.x))/(-f*d+c*y),n=(r=0<=m&&m<=1&&0<=S&&S<=1?{x:s.x+S*c,y:s.y+S*d}:null)?{type:\"line\",points:[a[1]=r,t[1]]}:(a[1]=w(o,l)?o:l,{type:\"line\",points:[o,t[1]]}),b.len=Ve(a[0],a[1]))):n={type:\"line\",points:t},n.len=Ve(n.points[0],n.points[1]),k.push(b=n)):(k.push({type:\"cubic\",points:function(e,t,n,a,i,o){for(var l,r,s=We(e,t,n,a)/o,u=1/(o<i?i/o*s:s),h=[],p=0;r=(90-(l=Te(e,t,n,a,p)).angle)*(Math.PI/180),h.push({x:l.x+Math.cos(r)*i,y:l.y+Math.sin(r)*i*-1}),!(1<=p);)1<(p+=u)&&(p=1);return h}(e[0],e[1],e[2],e[3],x,16)}),b=null)}),b=null,k.forEach(function(e){var t;b=\"line\"===e.type?(e.inside&&(b.len>x?((t=b.points)[1]=Ne(t[0],t[1],-x),b.len=Ve(t[0],t[1])):(b.points=null,b.len=0),e.len>x+n?((t=e.points)[0]=Ne(t[1],t[0],-(x+n)),e.len=Ve(t[0],t[1])):(e.points=null,e.len=0)),e):null}),k.reduce(function(t,e){var n=e.points;return n&&(a&&w(n[0],a)||t.push({type:\"M\",values:[n[0].x,n[0].y]}),\"line\"===e.type?t.push({type:\"L\",values:[n[1].x,n[1].y]}):(n.shift(),n.forEach(function(e){t.push({type:\"L\",values:[e.x,e.y]})})),a=n[n.length-1]),t},[])},newText:function(e,t,n,a){var i,o,l,r,s,u,h,p,c=t.createElementNS(re,\"defs\"),d=c.appendChild(t.createElementNS(re,\"path\"));return d.id=i=n+\"-path\",(r=(l=t.createElementNS(re,\"text\")).appendChild(t.createElementNS(re,\"textPath\"))).href.baseVal=\"#\"+i,r.startOffset.baseVal.newValueSpecifiedUnits(SVGLength.SVG_LENGTHTYPE_PX,0),r.textContent=e,\"boolean\"!=typeof f&&(f=\"paintOrder\"in l.style),a&&!f?(l.id=o=n+\"-text\",c.appendChild(l),(h=(s=t.createElementNS(re,\"g\")).appendChild(t.createElementNS(re,\"use\"))).href.baseVal=\"#\"+o,(u=s.appendChild(t.createElementNS(re,\"use\"))).href.baseVal=\"#\"+o,(p=h.style).strokeLinejoin=\"round\",{elmPosition:l,elmPath:d,elmOffset:r,styleText:l.style,styleFill:u.style,styleStroke:p,styleShow:s.style,elmsAppend:[c,s]}):(p=l.style,a&&(p.strokeLinejoin=\"round\",p.paintOrder=\"stroke\"),{elmPosition:l,elmPath:d,elmOffset:r,styleText:p,styleFill:p,styleStroke:a?p:null,styleShow:p,elmsAppend:[c,l]})},initSvg:function(t,n){var e,a,i=I.pathLabel.newText(t.text,n.baseWindow.document,A+\"-pathLabel-\"+t._id,t.outlineColor);[\"elmPosition\",\"elmPath\",\"elmOffset\",\"styleFill\",\"styleShow\",\"elmsAppend\"].forEach(function(e){t[e]=i[e]}),t.isShown=!1,t.styleShow.visibility=\"hidden\",I.captionLabel.textStyleProps.forEach(function(e){null!=t[e]&&(i.styleText[e]=t[e])}),i.elmsAppend.forEach(function(e){n.svg.appendChild(e)}),i.elmPath.setPathData([{type:\"M\",values:[0,100]},{type:\"h\",values:[100]}]),e=i.elmPosition.getBBox(),i.styleText.textAnchor=[\"start\",\"end\",\"middle\"][t.semIndex],2!==t.semIndex||t.lineOffset||i.elmOffset.startOffset.baseVal.newValueSpecifiedUnits(SVGLength.SVG_LENGTHTYPE_PERCENTAGE,50),t.height=e.height,t.outlineColor&&(a=10<(a=e.height/9)?10:a<2?2:a,i.styleStroke.strokeWidth=a+\"px\",i.styleStroke.stroke=t.outlineColor),t.strokeWidth=a||0,Xe(t.aplStats,I.pathLabel.stats),t.updateColor(n),t.updatePath(n),t.updateStartOffset(n),pe&&et(n,{}),t.updateShow(n)},bind:function(e,t){var n=t.props;return e.color||De(n,\"cur_line_color\",e.updateColor),De(n,\"cur_line_strokeWidth\",e.updatePath),De(n,\"apl_path\",e.updatePath),e.semIndex=\"startLabel\"===t.optionName?0:\"endLabel\"===t.optionName?1:2,2===e.semIndex&&!e.lineOffset||De(n,\"cur_attach_plugBackLenSE\",e.updateStartOffset),De(n,\"svgShow\",e.updateShow),pe&&De(n,\"new_edge4viewBox\",e.adjustEdge),I.pathLabel.initSvg(e,n),!0},unbind:function(e,t){var n=t.props;e.elmsAppend&&(e.elmsAppend.forEach(function(e){n.svg.removeChild(e)}),e.elmPosition=e.elmPath=e.elmOffset=e.styleFill=e.styleShow=e.elmsAppend=null),Xe(e.curStats,I.pathLabel.stats),Xe(e.aplStats,I.pathLabel.stats),e.color||ze(n,\"cur_line_color\",e.updateColor),ze(n,\"cur_line_strokeWidth\",e.updatePath),ze(n,\"apl_path\",e.updatePath),2===e.semIndex&&!e.lineOffset||ze(n,\"cur_attach_plugBackLenSE\",e.updateStartOffset),ze(n,\"svgShow\",e.updateShow),pe&&(ze(n,\"new_edge4viewBox\",e.adjustEdge),et(n,{}))},removeOption:function(e,t){var n=t.props,a={};a[t.optionName]=\"\",ot(n,a)},remove:function(t){t.boundTargets.length&&(console.error(\"LeaderLineAttachment was not unbound by remove\"),t.boundTargets.forEach(function(e){I.pathLabel.unbind(t,e)}))}}},Object.keys(I).forEach(function(e){lt[e]=function(){return new C(I[e],Array.prototype.slice.call(arguments))}}),lt.positionByWindowResize=!0,window.addEventListener(\"resize\",v.add(function(){lt.positionByWindowResize&&Object.keys(ge).forEach(function(e){et(ge[e],{position:!0})})}),!1),lt}();!function(e,t){\"object\"==typeof exports&&\"undefined\"!=typeof module?module.exports=t():\"function\"==typeof define&&define.amd?define(t):e[\"leader-line\"]=t()}(this,function(){return LeaderLine});","import { Decoration, WidgetType } from \"@codemirror/view\";\nimport classNames from \"classnames\";\nimport LeaderLine from \"leader-line-new\";\nimport _ from \"lodash\";\nimport React, { useContext, useEffect, useRef, useState } from \"react\";\nimport ReactDOM from \"react-dom/client\";\nimport { evenlySpaceAround, linecolToPosition, makeDecorationField } from \"./misc.js\";\nconst DEBUG = false;\nlet ConfigContext = React.createContext({});\nlet CodeContext = React.createContext(undefined);\nlet PathContext = React.createContext([]);\nlet ErrorContext = React.createContext(undefined);\nlet codeRange = (view, range) => {\n    let start = linecolToPosition(range.start, view.state.doc);\n    let end = linecolToPosition(range.end, view.state.doc);\n    return view.state.doc.sliceString(start, end);\n};\nlet AbbreviatedView = ({ value }) => {\n    let pathCtx = useContext(PathContext);\n    let IndexedContainer = ({ children, index }) => {\n        let path = [...pathCtx, \"index\", index.toString()];\n        return (React.createElement(PathContext.Provider, { value: path },\n            React.createElement(\"td\", { className: path.join(\"-\"), \"data-connector\": \"bottom\" }, children)));\n    };\n    // TODO: handle indexes into abbreviated + end regions\n    return (React.createElement(\"table\", { className: \"array\" },\n        React.createElement(\"tbody\", null,\n            React.createElement(\"tr\", null, value.type === \"All\" ? (value.value.map((el, i) => (React.createElement(IndexedContainer, { key: i, index: i },\n                React.createElement(ValueView, { value: el }))))) : (React.createElement(React.Fragment, null,\n                value.value[0].map((el, i) => (React.createElement(IndexedContainer, { key: i, index: i },\n                    React.createElement(ValueView, { value: el })))),\n                React.createElement(\"td\", null, \"...\"),\n                React.createElement(IndexedContainer, { index: 100 },\n                    React.createElement(ValueView, { value: value.value[1] }))))))));\n};\nlet read_field = (v, k) => {\n    let field = v.fields.find(([k2]) => k === k2);\n    if (!field) {\n        let v_pretty = JSON.stringify(v, undefined, 2);\n        throw new Error(`Could not find field \"${k}\" in struct: ${v_pretty}`);\n    }\n    return field[1].value;\n};\nlet read_unique = (unique) => {\n    let non_null = read_field(unique, \"pointer\");\n    return non_null;\n};\nlet read_vec = (vec) => {\n    let raw_vec = read_field(vec, \"buf\");\n    let unique = read_field(raw_vec, \"ptr\");\n    return read_unique(unique);\n};\nlet specialPtr = (value) => {\n    if (value.alloc_kind === null)\n        return;\n    let alloc_type = value.alloc_kind.type;\n    let non_null;\n    if (alloc_type === \"String\") {\n        let vec = read_field(value, \"vec\");\n        non_null = read_vec(vec);\n    }\n    else if (alloc_type === \"Vec\") {\n        non_null = read_vec(value);\n    }\n    else if (alloc_type === \"Box\") {\n        let unique = read_field(value, \"0\");\n        non_null = read_unique(unique);\n    }\n    else {\n        throw new Error(`Unimplemented alloc type: ${alloc_type}`);\n    }\n    let ptr = non_null.fields[0][1];\n    return ptr;\n};\nlet AdtView = ({ value }) => {\n    let pathCtx = useContext(PathContext);\n    let config = useContext(ConfigContext);\n    let ptr = specialPtr(value);\n    if (ptr && !config.concreteTypes)\n        return React.createElement(ValueView, { value: ptr });\n    if (value.name === \"Iter\" && !config.concreteTypes) {\n        let non_null = read_field(value, \"ptr\");\n        let ptr = non_null.fields[0][1];\n        return React.createElement(ValueView, { value: ptr });\n    }\n    let adtName = value.variant ?? value.name;\n    let isTuple = value.fields.length > 0 && value.fields[0][0] === \"0\";\n    if (isTuple && value.fields.length === 1) {\n        let path = [...pathCtx, \"field\", \"0\"];\n        let field = value.fields[0][1];\n        let inner = (React.createElement(PathContext.Provider, { value: path },\n            React.createElement(ValueView, { value: field })));\n        let smallInside = field.type === \"Adt\" &&\n            !config.concreteTypes &&\n            specialPtr(field.value) !== undefined;\n        return (React.createElement(\"span\", { className: path.join(\"-\") }, smallInside ? (React.createElement(React.Fragment, null,\n            adtName,\n            \"(\",\n            inner,\n            \")\")) : (React.createElement(React.Fragment, null,\n            \" \",\n            adtName,\n            \" /\\u00A0\",\n            inner))));\n    }\n    let cells = value.fields.map(([k, v], i) => {\n        let path = [...pathCtx, \"field\", i.toString()];\n        return (React.createElement(\"td\", { key: k, className: path.join(\"-\") },\n            React.createElement(PathContext.Provider, { value: path },\n                React.createElement(ValueView, { value: v }))));\n    });\n    return (React.createElement(React.Fragment, null,\n        adtName,\n        React.createElement(\"table\", null,\n            React.createElement(\"tbody\", null, isTuple ? (React.createElement(\"tr\", null, cells)) : (value.fields.map(([k, _v], i) => (React.createElement(\"tr\", { key: i },\n                React.createElement(\"td\", null, k),\n                cells[i]))))))));\n};\nlet PointerView = ({ value: { path, range } }) => {\n    let config = useContext(ConfigContext);\n    let segment = path.segment.type === \"Heap\"\n        ? `heap-${path.segment.value.index}`\n        : `stack-${path.segment.value.frame}-${path.segment.value.local}`;\n    let parts = [...path.parts];\n    let lastPart = _.last(parts);\n    let slice = lastPart && lastPart.type === \"Subslice\" ? lastPart.value : undefined;\n    if (lastPart && lastPart.type === \"Index\" && lastPart.value === 0)\n        parts.pop();\n    let partClass = parts.map(part => part.type === \"Index\"\n        ? `index-${part.value}`\n        : part.type === \"Field\"\n            ? `field-${part.value}`\n            : part.type === \"Subslice\"\n                ? `index-${part.value[0]}`\n                : \"\");\n    let attrs = {\n        \"data-point-to\": [segment, ...partClass].join(\"-\")\n    };\n    if (slice) {\n        attrs[\"data-point-to-range\"] = [\n            segment,\n            ...partClass.slice(0, -1),\n            `index-${slice[1]}`\n        ].join(\"-\");\n    }\n    let ptrView = (React.createElement(\"span\", { className: \"pointer\", ...attrs }, \"\\u25CF\"));\n    return config.concreteTypes && range ? (React.createElement(\"table\", null,\n        React.createElement(\"tbody\", null,\n            React.createElement(\"tr\", null,\n                React.createElement(\"td\", null, \"ptr\"),\n                React.createElement(\"td\", null, ptrView)),\n            React.createElement(\"tr\", null,\n                React.createElement(\"td\", null, \"len\"),\n                React.createElement(\"td\", null, range.toString()))))) : (ptrView);\n};\nlet ValueView = ({ value }) => {\n    let pathCtx = useContext(PathContext);\n    let error = useContext(ErrorContext);\n    return (React.createElement(React.Fragment, null, value.type === \"Bool\" ||\n        value.type === \"Uint\" ||\n        value.type === \"Int\" ||\n        value.type === \"Float\" ? (value.value.toString()) : value.type === \"Char\" ? (String.fromCharCode(value.value).replace(\" \", \"\\u00A0\")) : value.type === \"Tuple\" ? (React.createElement(React.Fragment, null,\n        React.createElement(\"table\", null,\n            React.createElement(\"tbody\", null,\n                React.createElement(\"tr\", null, value.value.map((v, i) => {\n                    let path = [...pathCtx, \"field\", i.toString()];\n                    return (React.createElement(\"td\", { key: i, className: path.join(\"-\") },\n                        React.createElement(PathContext.Provider, { value: path },\n                            React.createElement(ValueView, { value: v }))));\n                })))))) : value.type === \"Adt\" ? (React.createElement(AdtView, { value: value.value })) : value.type === \"Pointer\" ? (React.createElement(PointerView, { value: value.value })) : value.type === \"Array\" ? (React.createElement(AbbreviatedView, { value: value.value })) : value.type === \"Unallocated\" ? ((() => {\n        let isError = error &&\n            error.type === \"PointerUseAfterFree\" &&\n            error.value.alloc_id === value.value.alloc_id;\n        return (React.createElement(\"span\", { className: classNames(\"unallocated\", { error: isError }) }, \"\\u29BB\"));\n    })()) : (React.createElement(React.Fragment, null, \"TODO\"))));\n};\nlet LocalsView = ({ index, locals }) => locals.length === 0 ? (React.createElement(\"div\", { className: \"locals empty-frame\" }, \"(empty frame)\")) : (React.createElement(\"table\", { className: \"locals\" },\n    React.createElement(\"tbody\", null, locals.map(({ name, value, moved_paths }, i) => {\n        let path = [\"stack\", index.toString(), name];\n        // TODO: implement support for move paths length > 0\n        let isMoved = moved_paths.some(p => p.length === 0);\n        return (React.createElement(\"tr\", { key: i, className: classNames({ moved: isMoved }) },\n            React.createElement(\"td\", null, name),\n            React.createElement(\"td\", { className: path.join(\"-\"), \"data-connector\": \"right\" },\n                React.createElement(PathContext.Provider, { value: path },\n                    React.createElement(ValueView, { value: value })))));\n    }))));\nlet Header = ({ children, className }) => (React.createElement(\"div\", { className: `header ${className ?? \"\"}` },\n    React.createElement(\"div\", { className: \"header-text\" }, children),\n    React.createElement(\"div\", { className: \"header-bg\" })));\nlet FrameView = ({ index, frame }) => {\n    let code = useContext(CodeContext);\n    let snippet = codeRange(code, frame.location);\n    return (React.createElement(\"div\", { className: \"frame\" },\n        React.createElement(Header, { className: \"frame-header\" }, frame.name),\n        DEBUG ? React.createElement(\"pre\", null, snippet) : null,\n        React.createElement(LocalsView, { index: index, locals: frame.locals })));\n};\nlet StackView = ({ stack }) => (React.createElement(\"div\", { className: \"memory stack\" },\n    React.createElement(Header, { className: \"memory-header\" }, \"Stack\"),\n    React.createElement(\"div\", { className: \"frames\" }, stack.frames.map((frame, i) => (React.createElement(FrameView, { key: i, index: i, frame: frame }))))));\nlet HeapView = ({ heap }) => (React.createElement(\"div\", { className: \"memory heap\" },\n    React.createElement(Header, { className: \"memory-header\" }, \"Heap\"),\n    React.createElement(\"table\", null,\n        React.createElement(\"tbody\", null, heap.locations.map((value, i) => {\n            let path = [\"heap\", i.toString()];\n            return (React.createElement(\"tr\", { key: i },\n                React.createElement(\"td\", { className: path.join(\"-\"), \"data-connector\": \"left\" },\n                    React.createElement(PathContext.Provider, { value: path },\n                        React.createElement(ValueView, { value: value })))));\n        })))));\nLeaderLine.positionByWindowResize = false;\n// to_rgb = lambda p: [f'rgba({int(r*255)}, {int(g*255)}, {int(b*255)}, 1)' for (r, g, b) in p]\nconst PALETTE = {\n    // to_rgb(sns.color_palette(\"rocket\", 15)[:6])\n    light: [\n        \"rgba(24, 15, 41, 1)\",\n        \"rgba(47, 23, 57, 1)\",\n        \"rgba(71, 28, 72, 1)\",\n        \"rgba(97, 30, 82, 1)\",\n        \"rgba(123, 30, 89, 1)\",\n        \"rgba(150, 27, 91, 1)\"\n    ],\n    // to_rgb(sns.color_palette(\"rocket_r\", 20, desat=0.5)[:6])\n    dark: [\n        \"rgba(234, 219, 207, 1)\",\n        \"rgba(227, 203, 187, 1)\",\n        \"rgba(220, 187, 168, 1)\",\n        \"rgba(214, 172, 151, 1)\",\n        \"rgba(208, 156, 136, 1)\",\n        \"rgba(202, 140, 121, 1)\"\n    ]\n};\nlet renderArrows = (containerRef, stepContainerRef, arrowContainerRef) => {\n    useEffect(() => {\n        let container = containerRef.current;\n        let stepContainer = stepContainerRef.current;\n        let arrowContainer = arrowContainerRef.current;\n        let sources = stepContainer.querySelectorAll(\".pointer\");\n        // TODO: this should be configurable from the embed script, not directly\n        // inside aquascope-editor\n        let mdbookEmbed = getComputedStyle(document.body).getPropertyValue(\"--inline-code-color\");\n        let query = (sel) => {\n            let dst = stepContainer.querySelector(`.${CSS.escape(sel)}`);\n            if (!dst)\n                throw new Error(`Could not find endpoint for pointer selector: ${CSS.escape(sel)}`);\n            return dst;\n        };\n        let getMemoryRegion = (el) => el.closest(\".heap\") !== null ? \"heap\" : \"stack\";\n        // First, collect metadata about all the pointers we're rendering\n        // like what HTML elements are pointed, and what region of the digram\n        // they lie in.\n        let dstCounts = {};\n        let pointers = Array.from(sources).map(src => {\n            let dstSel = src.dataset.pointTo;\n            let dst = query(dstSel);\n            let dstRange = src.dataset.pointToRange\n                ? query(src.dataset.pointToRange)\n                : undefined;\n            let endSocket = dst.dataset.connector;\n            let group = {\n                srcRegion: getMemoryRegion(src),\n                dstRegion: getMemoryRegion(dst)\n            };\n            if (!(dstSel in dstCounts))\n                dstCounts[dstSel] = 0;\n            let dstIndex = dstCounts[dstSel];\n            dstCounts[dstSel] += 1;\n            return { src, dst, dstRange, dstSel, endSocket, dstIndex, group };\n        });\n        // Then, group the pointers by their regions.\n        // That way we know how many pointers are e.g. pointing from stack->heap\n        // so we can stagger them correctly.\n        let groups = _.groupBy(pointers, \"group\");\n        // Then we render each pointer, conditioned on its group.\n        let renderPtr = (ptr, i) => {\n            try {\n                let { srcRegion, dstRegion } = ptr.group;\n                // Heap -> stack pointers should start on the left and\n                // everything else starts on the right\n                let startSocket = srcRegion === \"heap\" && dstRegion === \"stack\" ? \"left\" : \"right\";\n                let dstAnchor;\n                if (ptr.dstRange) {\n                    // Pointers to ranges (eg string slices) need an area anchor\n                    // corresponding to the range of the slice\n                    // TODO: this doesn't handle abbreviations\n                    dstAnchor = LeaderLine.areaAnchor(ptr.dst, {\n                        shape: \"rect\",\n                        width: ptr.dstRange.offsetLeft +\n                            ptr.dst.offsetWidth -\n                            ptr.dst.offsetLeft,\n                        height: 2,\n                        y: \"100%\",\n                        fillColor: mdbookEmbed ? \"var(--search-mark-bg)\" : \"red\"\n                    });\n                }\n                else if (srcRegion === \"stack\" && dstRegion === \"stack\") {\n                    // Stack -> stack pointers should point a little below the middle\n                    // to avoid conflicting with outgoing pointers.\n                    dstAnchor = LeaderLine.pointAnchor(ptr.dst, { x: \"100%\", y: \"75%\" });\n                }\n                else if (ptr.endSocket === \"bottom\") {\n                    dstAnchor = ptr.dst;\n                }\n                else {\n                    let x = dstRegion === \"stack\" ? 100 : 0;\n                    // Everything else should get evenly spaced around the\n                    // middle of the endpoint\n                    let y = evenlySpaceAround({\n                        center: 50,\n                        spacing: 30,\n                        index: ptr.dstIndex,\n                        total: dstCounts[ptr.dstSel] - 1\n                    });\n                    dstAnchor = LeaderLine.pointAnchor(ptr.dst, {\n                        x: `${x}%`,\n                        y: `${y}%`\n                    });\n                }\n                const MDBOOK_DARK_THEMES = [\"navy\", \"coal\", \"ayu\"];\n                let isDark = MDBOOK_DARK_THEMES.some(s => document.documentElement.classList.contains(s));\n                let theme = isDark ? \"dark\" : \"light\";\n                let palette = PALETTE[theme];\n                let color = palette[i % palette.length];\n                let srcIsMoved = ptr.src.closest(\".moved\") !== null;\n                let moveOpacity = isDark ? 0.5 : 0.3;\n                if (srcIsMoved)\n                    color = color.replace(\", 1)\", `, ${moveOpacity})`);\n                let startSocketGravity = undefined;\n                let endSocketGravity = undefined;\n                if (ptr.group.srcRegion === \"stack\" && ptr.group.dstRegion === \"heap\") {\n                    startSocketGravity = 60;\n                    endSocketGravity = 100 - i * 10;\n                }\n                let line = new LeaderLine(ptr.src, dstAnchor, {\n                    color,\n                    size: 1,\n                    endPlugSize: 2,\n                    startSocket,\n                    endSocket: ptr.endSocket,\n                    startSocketGravity,\n                    endSocketGravity\n                });\n                // Make arrows local to the diagram rather than global in the body\n                // See: https://github.com/anseki/leader-line/issues/54\n                let svgSelectors = [\".leader-line\"];\n                if (ptr.dstRange)\n                    svgSelectors.push(\".leader-line-areaAnchor\");\n                let svgElements = svgSelectors.map(sel => {\n                    let el = document.body.querySelector(`:scope > ${sel}`);\n                    if (!el)\n                        throw new Error(`Missing LineLeader element: ${sel}`);\n                    return el;\n                });\n                svgElements.forEach(el => arrowContainer.appendChild(el));\n                return { line, svgElements };\n            }\n            catch (e) {\n                console.error(\"Leader line failed to render\", e.stack);\n                return undefined;\n            }\n        };\n        let lines = Object.entries(groups)\n            .flatMap(([_g, ptrs]) => ptrs.map((ptr, i) => renderPtr(ptr, i)))\n            .filter(obj => obj !== undefined);\n        // Lastly, we add a timer to reposition the arrow container\n        // if necessary.\n        let curCoords = () => {\n            let stepBox = stepContainer.getBoundingClientRect();\n            let x = stepBox.left + window.scrollX + container.scrollLeft;\n            let y = stepBox.top + window.scrollY + container.scrollTop;\n            return [x, y];\n        };\n        let positionArrowContainer = (x, y) => {\n            lines.forEach(({ line }) => line.position());\n            arrowContainer.style.transform = `translate(-${x}px, -${y}px)`;\n        };\n        let lastCoords = curCoords();\n        positionArrowContainer(...lastCoords);\n        let interval = setInterval(() => {\n            let newCoords = curCoords();\n            if (newCoords[0] !== lastCoords[0] || newCoords[1] !== lastCoords[1]) {\n                positionArrowContainer(...newCoords);\n            }\n            lastCoords = newCoords;\n        }, 300);\n        return () => {\n            clearInterval(interval);\n            lines.forEach(({ svgElements }) => {\n                svgElements.forEach(el => {\n                    el.parentNode.removeChild(el);\n                });\n            });\n        };\n    });\n    // Note: this effect must be re-run every time, since children *might* change\n    // their contents and invalidate DOM references held within LineLeader\n};\nlet StepView = ({ step, index, containerRef }) => {\n    let stepContainerRef = useRef(null);\n    let arrowContainerRef = useRef(null);\n    let error = useContext(ErrorContext);\n    renderArrows(containerRef, stepContainerRef, arrowContainerRef);\n    return (React.createElement(\"div\", { className: \"step\" },\n        React.createElement(\"div\", { className: \"step-header\" },\n            React.createElement(StepMarkerView, { index: index, fail: error !== undefined }),\n            error !== undefined ? (React.createElement(\"span\", { className: \"undefined-behavior\" },\n                \"undefined behavior:\",\n                \" \",\n                error.type === \"PointerUseAfterFree\" ? (React.createElement(React.Fragment, null, \"pointer used after its pointee is freed\")) : (error.value))) : null),\n        React.createElement(\"div\", { className: \"memory-container\", ref: stepContainerRef },\n            React.createElement(\"div\", { className: \"arrow-container\", ref: arrowContainerRef }),\n            React.createElement(\"div\", { className: \"memory-container-flex\" },\n                React.createElement(StackView, { stack: step.stack }),\n                step.heap.locations.length > 0 ? (React.createElement(HeapView, { heap: step.heap })) : null))));\n};\nlet InterpreterView = ({ trace, config }) => {\n    let ref = useRef(null);\n    let [concreteTypes, setConcreteTypes] = useState(config?.concreteTypes ?? false);\n    let [buttonVisible, setButtonVisible] = useState(false);\n    let flexDirection = config?.horizontal\n        ? \"row\"\n        : \"column\";\n    return (React.createElement(ConfigContext.Provider, { value: { ...config, concreteTypes: concreteTypes } },\n        React.createElement(\"div\", { ref: ref, className: \"interpreter\", style: { flexDirection }, onMouseEnter: () => setButtonVisible(true), onMouseLeave: () => setButtonVisible(false) },\n            React.createElement(\"button\", { type: \"button\", className: classNames(\"concrete-types\", { active: concreteTypes }), onClick: () => setConcreteTypes(!concreteTypes), style: { opacity: buttonVisible ? \"1\" : \"0\" } },\n                React.createElement(\"i\", { className: \"fa fa-binoculars\" })),\n            trace.steps.map((step, i) => {\n                let error = i === trace.steps.length - 1 && trace.result.type === \"Error\"\n                    ? trace.result.value\n                    : undefined;\n                return (React.createElement(ErrorContext.Provider, { key: i, value: error },\n                    React.createElement(StepView, { index: i, step: step, containerRef: ref })));\n            }))));\n};\nlet filterSteps = (view, steps, marks) => {\n    let stepsRev = [...steps].reverse();\n    let indexedMarks = marks.map(idx => {\n        let stepRevIdx = stepsRev.findIndex(step => {\n            let frame = _.last(step.stack.frames);\n            let markInFrame = linecolToPosition(frame.body_span.start, view.state.doc) <= idx &&\n                idx <= linecolToPosition(frame.body_span.end, view.state.doc);\n            let markAfterLoc = idx > linecolToPosition(frame.location.start, view.state.doc);\n            return markInFrame && markAfterLoc;\n        });\n        if (stepRevIdx === -1)\n            throw new Error(`Could not find step for range: ${JSON.stringify(idx, undefined, 2)}`);\n        return [steps.length - stepRevIdx, idx, stepsRev[stepRevIdx]];\n    });\n    let sortedMarks = _.sortBy(indexedMarks, ([idx]) => idx);\n    return [\n        sortedMarks.map(([_stepIdx, mark]) => mark),\n        sortedMarks.map(([_stepIdx, _mark, step]) => step)\n    ];\n};\nlet StepMarkerView = ({ index, fail }) => {\n    return (React.createElement(\"span\", { className: classNames(\"step-marker\", { fail }) },\n        React.createElement(\"span\", null,\n            \"L\",\n            index + 1)));\n};\nclass StepMarkerWidget extends WidgetType {\n    index;\n    fail;\n    constructor(index, fail) {\n        super();\n        this.index = index;\n        this.fail = fail;\n    }\n    toDOM() {\n        let container = document.createElement(\"span\");\n        ReactDOM.createRoot(container).render(React.createElement(StepMarkerView, { index: this.index, fail: this.fail }));\n        return container;\n    }\n}\nexport let markerField = makeDecorationField();\nexport function renderInterpreter(view, container, trace, config, annotations) {\n    let root = ReactDOM.createRoot(container);\n    let marks = annotations?.state_locations || [];\n    let widgetRanges;\n    if (marks.length > 0) {\n        let [sortedMarks, filteredSteps] = filterSteps(view, trace.steps, marks);\n        widgetRanges = sortedMarks;\n        trace.steps = filteredSteps;\n    }\n    else {\n        widgetRanges = trace.steps.map(step => linecolToPosition(_.last(step.stack.frames).location.end, view.state.doc));\n    }\n    let decos = widgetRanges.map((mark, i) => Decoration.widget({\n        widget: new StepMarkerWidget(i, i === trace.steps.length - 1 && trace.result.type === \"Error\")\n    }).range(mark));\n    view.dispatch({\n        effects: [markerField.setEffect.of(decos)]\n    });\n    root.render(React.createElement(CodeContext.Provider, { value: view },\n        React.createElement(InterpreterView, { trace: trace, config: config })));\n}\n//# sourceMappingURL=interpreter.js.map","import { Decoration, WidgetType } from \"@codemirror/view\";\nimport classNames from \"classnames\";\nimport _ from \"lodash\";\nimport React, { useState } from \"react\";\nimport ReactDOM from \"react-dom/client\";\nimport { hideLoanRegion, hideMoveRegion, linecolToPosition, makeDecorationField, ownChar, permName, readChar, showLoanRegion, showMoveRegion, writeChar } from \"./misc.js\";\nlet PermChar = ({ perm, facts }) => {\n    // FIXME: don't reverse the abbreviated content.\n    // ~~~~ IMPORTANT MAINTENANCE NOTE ~~~~\n    // Any changes to this HTML must be propagated to permissions.rs in mdbook-aquascope!\n    let getInner = () => {\n        let kind = permName(perm.perm);\n        let Perm = ({ children }) => (React.createElement(\"span\", { className: classNames(\"perm\", kind) }, children));\n        if (perm.step.type === \"None\") {\n            return perm.step.value ? (React.createElement(\"div\", { className: \"perm-diff-present\", title: `Path had ${kind} permissions before the preceding line, and that didn't change after this line.` },\n                React.createElement(Perm, null, perm.perm))) : (React.createElement(\"div\", { className: \"perm-diff-none\", title: `Path did not have ${kind} permissions before the preceding line, and that didn't change after this line.` },\n                React.createElement(Perm, null, \"\\u2012\")));\n        }\n        else if (perm.step.type === \"Low\") {\n            return (React.createElement(\"div\", { className: \"perm-diff-sub-container\", title: `Path had ${kind} permissions before the preceding line, and lost it after this line.` },\n                React.createElement(\"div\", { className: \"perm-diff-sub\" }),\n                React.createElement(Perm, null, perm.perm)));\n        } /* perm.step.type === \"High\" */\n        else {\n            return (React.createElement(\"div\", { title: `Path did not have ${kind} permissions before the preceding line, and gained it after this line.` },\n                React.createElement(\"span\", { className: \"perm-diff-add\" }, \"+\"),\n                React.createElement(Perm, null, perm.perm)));\n        }\n    };\n    return (React.createElement(\"td\", { onMouseEnter: () => {\n            showLoanRegion(facts, perm.loanKey, [permName(perm.perm)]);\n            showMoveRegion(facts, perm.moveKey, [permName(perm.perm)]);\n        }, onMouseLeave: () => {\n            hideLoanRegion(facts, perm.loanKey, [permName(perm.perm)]);\n            hideMoveRegion(facts, perm.moveKey, [permName(perm.perm)]);\n        }, className: \"perm-char\" }, getInner()));\n};\nlet PermDiffRow = ({ path, diffs, facts }) => {\n    // There is a sort of hierarchy to the changing permissions:\n    // We first prioritize \"moves\" and \"borrows\" (permission refinements),\n    // these actions are visually important because they reflect concrete\n    // actions in the source-code. Liveness is implicit, and should be\n    // shown after the other actions.\n    let visualFacts = [\n        {\n            fact: \"path_moved\",\n            states: [\n                {\n                    value: { type: \"High\", value: 0 },\n                    icon: \"sign-out\",\n                    desc: \"Path is moved here\"\n                },\n                {\n                    value: { type: \"Low\" },\n                    icon: \"recycle\",\n                    desc: \"Path is re-initialized after move here\"\n                }\n            ]\n        },\n        {\n            fact: \"loan_read_refined\",\n            states: [\n                {\n                    value: { type: \"High\", value: 0 },\n                    icon: \"arrow-right\",\n                    desc: \"Path is borrowed here\"\n                },\n                {\n                    value: { type: \"Low\" },\n                    icon: \"rotate-left\",\n                    desc: \"Borrow on path is dropped here\"\n                }\n            ]\n        },\n        {\n            fact: \"loan_write_refined\",\n            states: [\n                {\n                    value: { type: \"High\", value: 0 },\n                    icon: \"arrow-right\",\n                    desc: \"Path is borrowed here\"\n                },\n                {\n                    value: { type: \"Low\" },\n                    icon: \"rotate-left\",\n                    desc: \"Borrow on path is no longer used here\"\n                }\n            ]\n        },\n        {\n            fact: \"is_live\",\n            states: [\n                {\n                    value: { type: \"High\", value: 0 },\n                    icon: \"level-up\",\n                    desc: \"Path is initialized here\"\n                },\n                {\n                    value: { type: \"Low\" },\n                    icon: \"level-down\",\n                    desc: \"Path is no longer used here\"\n                }\n            ]\n        },\n        {\n            fact: \"path_uninitialized\",\n            states: [\n                {\n                    value: { type: \"High\", value: 0 },\n                    icon: \"sign-out\",\n                    desc: \"Path contains uninitialized data\"\n                },\n                {\n                    value: { type: \"Low\" },\n                    icon: \"recycle\",\n                    desc: \"Path data is initialized after move here\"\n                }\n            ]\n        }\n    ];\n    let ico = null;\n    loop: for (let { fact, states } of visualFacts) {\n        for (let { value, icon, desc } of states) {\n            if (_.isEqual(diffs[fact].type, value.type)) {\n                ico = (React.createElement(\"i\", { className: `fa fa-${icon} aquascope-action-indicator`, title: desc }));\n                break loop;\n            }\n            else {\n                // console.log(\"unequal: \", diffs[fact].type, value.type);\n            }\n        }\n    }\n    let unwrap = (v) => v.type === \"None\" || v.type === \"High\" ? v.value : undefined;\n    let moveKey = unwrap(diffs.path_moved);\n    let perms = [\n        {\n            perm: readChar,\n            step: diffs.permissions.read,\n            loanKey: unwrap(diffs.loan_read_refined),\n            moveKey\n        },\n        {\n            perm: writeChar,\n            step: diffs.permissions.write,\n            loanKey: unwrap(diffs.loan_write_refined),\n            moveKey\n        },\n        {\n            perm: ownChar,\n            step: diffs.permissions.drop,\n            loanKey: unwrap(diffs.loan_drop_refined),\n            moveKey\n        }\n    ];\n    let pathCol = React.createElement(\"td\", { className: \"perm-step-path\" }, path);\n    return (React.createElement(\"tr\", null,\n        pathCol,\n        React.createElement(\"td\", { className: \"perm-step-event\" }, ico),\n        perms.map(perm => (React.createElement(PermChar, { key: perm.perm, perm: perm, facts: facts })))));\n};\nlet stepLocation = (step) => {\n    return step.location.end;\n};\nlet StepTable = ({ rows, facts }) => (React.createElement(\"table\", { className: \"perm-step-table\" },\n    React.createElement(\"tbody\", null, rows.map(([path, diffs], i) => (React.createElement(PermDiffRow, { key: i, path: path, diffs: diffs, facts: facts }))))));\n// An individual table goes inside of the overall container, and\n// contains its own dropdown based on focused / unfocused places.\nlet StepTableIndividual = ({ focused, hidden, facts }) => {\n    let [displayAll, setDisplayAll] = useState(false);\n    let hiddenDropdown = hidden.length > 0 ? (React.createElement(React.Fragment, null,\n        React.createElement(\"div\", { className: \"step-table-dropdown step-widget-toggle\" }, \"\\u25CF \\u25CF \\u25CF\"),\n        React.createElement(\"div\", { className: classNames({ \"hidden-height\": !displayAll }) },\n            React.createElement(StepTable, { rows: hidden, facts: facts })))) : null;\n    return (\n    // biome-ignore lint/a11y/useKeyWithClickEvents: TODO\n    React.createElement(\"div\", { className: classNames(\"step-table-container\", {\n            \"contains-hidden\": hidden.length > 0\n        }), onClick: () => setDisplayAll(!displayAll) },\n        React.createElement(StepTable, { rows: focused, facts: facts }),\n        hiddenDropdown));\n};\n// On a single line there can be multiple tables next to each other.\n// All tables go in a container that can be collapsed to the left.\nlet StepLine = ({ spaces, focusedRegex, tables, init, facts }) => {\n    let [display, setDisplay] = useState(init);\n    let arrowOut = \"»\";\n    let arrowIn = \"«\";\n    let together = tables.map((table, i) => {\n        let [focusedDiffs, hiddenDiffs] = _.partition(table.state, ([path, _]) => !!path.match(focusedRegex));\n        return (React.createElement(StepTableIndividual, { key: i, focused: focusedDiffs, hidden: hiddenDiffs, facts: facts }));\n    });\n    return (React.createElement(\"div\", { className: \"perm-step-widget\" },\n        React.createElement(\"span\", { className: \"step-widget-toggle\", onClick: () => setDisplay(!display) }, display ? arrowIn : arrowOut),\n        React.createElement(\"div\", { className: classNames(\"step-widget-container\", {\n                \"hidden-width\": !display\n            }) },\n            React.createElement(\"div\", { className: \"step-widget-spacer\" }, spaces),\n            together)));\n};\nclass PermissionStepLineWidget extends WidgetType {\n    view;\n    step;\n    facts;\n    annotations;\n    line;\n    rowHTML;\n    constructor(view, step, facts, annotations) {\n        super();\n        this.view = view;\n        this.step = step;\n        this.facts = facts;\n        this.annotations = annotations;\n        this.line = view.state.doc.lineAt(linecolToPosition(stepLocation(step), view.state.doc));\n    }\n    eq(other) {\n        // Only one table widget can (should) be on a line.\n        return this.line.number === other.line.number;\n    }\n    toDOM() {\n        let container = document.createElement(\"span\");\n        let doc = this.view.state.doc;\n        let currLine = this.line;\n        let initDisplay = this.annotations && this.annotations.focused_lines.length > 0\n            ? this.annotations.focused_lines.includes(currLine.number)\n            : true;\n        let maxLineLen = 0;\n        for (let line of doc.iterLines()) {\n            maxLineLen = Math.max(maxLineLen, line.length);\n        }\n        let padding = 2 + maxLineLen - currLine.length;\n        let spaces = \"―\".repeat(padding);\n        let matchers = this.annotations?.focused_paths[currLine.number];\n        let rx = matchers\n            ?.map(matcher => matcher.type === \"Literal\"\n            ? _.escapeRegExp(matcher.value)\n            : matcher.value)\n            .map(s => `(${s})`)\n            .join(\"|\");\n        let r = new RegExp(rx ?? \"(.*)?\");\n        let tables = this.step.state;\n        ReactDOM.createRoot(container).render(React.createElement(StepLine, { spaces: spaces, focusedRegex: r, tables: tables, init: initDisplay, facts: this.facts }));\n        return container;\n    }\n    ignoreEvent() {\n        return true;\n    }\n}\nexport let stepField = makeDecorationField();\nexport function makeStepDecorations(view, facts, stateSteps, annotations) {\n    return stateSteps.map(step => Decoration.widget({\n        widget: new PermissionStepLineWidget(view, step, facts, annotations),\n        side: 1\n    }).range(linecolToPosition(stepLocation(step), view.state.doc)));\n}\n//# sourceMappingURL=stepper.js.map","import _ from \"lodash\";\nimport { boundariesField, makeBoundaryDecorations } from \"./boundaries.js\";\nimport { generateAnalysisDecorationFacts, loanFactsStateType } from \"./misc\";\nimport { makeStepDecorations, stepField } from \"./stepper.js\";\nexport function makePermissionsDecorations(view, results, annotations) {\n    let stepDecos = [];\n    let boundaryDecos = [];\n    let actionDecos = [];\n    results.forEach(res => {\n        let [facts, actionFacts] = generateAnalysisDecorationFacts(res);\n        let bs = makeBoundaryDecorations(view, facts, res.boundaries, annotations?.boundaries);\n        let ss = makeStepDecorations(view, facts, res.steps, annotations?.stepper);\n        boundaryDecos.push(bs);\n        stepDecos.push(ss);\n        actionDecos.push(actionFacts);\n    });\n    return {\n        stepper: stepDecos.flat(),\n        boundaries: _.uniqBy(boundaryDecos.flat(), d => d.from),\n        facts: actionDecos.flat()\n    };\n}\nexport function renderPermissions(view, decorations, cfg) {\n    console.debug(\"rendering permissions with\", cfg);\n    if (decorations !== undefined) {\n        let useSteps = String(cfg?.stepper) === \"true\";\n        let useBoundaries = String(cfg?.boundaries) === \"true\";\n        view.dispatch({\n            effects: [\n                loanFactsStateType.of(decorations.facts),\n                stepField.setEffect.of(useSteps ? decorations.stepper : []),\n                boundariesField.setEffect.of(useBoundaries ? decorations.boundaries : [])\n            ]\n        });\n    }\n}\n//# sourceMappingURL=permissions.js.map","import { rust } from \"@codemirror/lang-rust\";\nimport { indentUnit } from \"@codemirror/language\";\nimport { Compartment, EditorState } from \"@codemirror/state\";\nimport { EditorView } from \"@codemirror/view\";\nimport React, { useEffect, useRef, useState } from \"react\";\nimport ReactDOM from \"react-dom/client\";\nimport { boundariesField } from \"./editor-utils/boundaries.js\";\nimport { markerField, renderInterpreter } from \"./editor-utils/interpreter.js\";\nimport { hiddenLines, hideLine, loanFactsField } from \"./editor-utils/misc.js\";\nimport { makePermissionsDecorations, renderPermissions } from \"./editor-utils/permissions.js\";\nimport { stepField } from \"./editor-utils/stepper.js\";\nimport \"./styles.scss\";\nimport * as types_1 from \"./types.js\";\nexport { types_1 as types };\nconst DEFAULT_SERVER_URL = new URL(\"http://127.0.0.1:8008\");\nexport const defaultCodeExample = `\nfn main() {\n  let mut v = vec![1, 2, 3];\n  let n = &v[0];\n  v.push(0);\n  let x = *n;\n}\n`.trim();\nlet readOnly = new Compartment();\nlet mainKeybinding = new Compartment();\nlet CopyButton = ({ view }) => (React.createElement(\"button\", { type: \"button\", className: \"cm-button\", onClick: () => {\n        let contents = view.state.doc.toJSON().join(\"\\n\");\n        navigator.clipboard.writeText(contents);\n    } },\n    React.createElement(\"i\", { className: \"fa fa-copy\" })));\nlet HideButton = ({ container }) => {\n    let [hidden, setHidden] = useState(true);\n    useEffect(() => {\n        if (!hidden)\n            container.classList.add(\"show-hidden\");\n        else\n            container.classList.remove(\"show-hidden\");\n    }, [hidden]);\n    return (\n    // biome-ignore lint/a11y/useButtonType: TODO\n    React.createElement(\"button\", { className: \"cm-button\", onClick: () => setHidden(!hidden) },\n        React.createElement(\"i\", { className: `fa ${hidden ? \"fa-eye\" : \"fa-eye-slash\"}` })));\n};\nlet resetMarkedRangesOnEdit = EditorView.updateListener.of((upd) => {\n    if (upd.docChanged) {\n        upd.view.dispatch({\n            effects: [\n                boundariesField.setEffect.of([]),\n                stepField.setEffect.of([]),\n                markerField.setEffect.of([])\n            ]\n        });\n    }\n});\nexport class Editor {\n    setup;\n    reportStdErr;\n    serverUrl;\n    noInteract;\n    shouldFailHtml;\n    buttonList;\n    view;\n    interpreterContainer;\n    editorContainer;\n    permissionsDecos;\n    metaContainer;\n    buttons;\n    shouldFail = false;\n    constructor(dom, setup, code = defaultCodeExample, reportStdErr = err => {\n        console.error(\"An error occurred: \");\n        console.error(err);\n    }, serverUrl = DEFAULT_SERVER_URL, noInteract = false, shouldFailHtml = \"This code does not compile!\", buttonList = []) {\n        this.setup = setup;\n        this.reportStdErr = reportStdErr;\n        this.serverUrl = serverUrl;\n        this.noInteract = noInteract;\n        this.shouldFailHtml = shouldFailHtml;\n        this.buttonList = buttonList;\n        this.buttons = new Set(buttonList);\n        let initialState = EditorState.create({\n            doc: code,\n            extensions: [\n                mainKeybinding.of(setup),\n                readOnly.of(EditorState.readOnly.of(noInteract)),\n                EditorView.editable.of(!noInteract),\n                resetMarkedRangesOnEdit,\n                setup,\n                rust(),\n                indentUnit.of(\"  \"),\n                hiddenLines,\n                loanFactsField,\n                boundariesField.field,\n                stepField.field,\n                markerField.field\n            ]\n        });\n        this.editorContainer = document.createElement(\"div\");\n        this.view = new EditorView({\n            state: initialState,\n            parent: this.editorContainer\n        });\n        let buttonContainer = document.createElement(\"div\");\n        this.metaContainer = ReactDOM.createRoot(buttonContainer);\n        this.renderMeta();\n        this.editorContainer.appendChild(buttonContainer);\n        this.interpreterContainer = document.createElement(\"div\");\n        dom.appendChild(this.editorContainer);\n        dom.appendChild(this.interpreterContainer);\n    }\n    renderMeta() {\n        this.metaContainer.render(React.createElement(\"div\", { className: \"meta-container\" },\n            React.createElement(\"div\", { className: \"top-right\" }, Array.from(this.buttons).map((button, i) => button === \"copy\" ? (React.createElement(CopyButton, { key: i, view: this.view })) : button === \"eye\" ? (React.createElement(HideButton, { key: i, container: this.editorContainer })) : null)),\n            this.shouldFail ? (React.createElement(\"div\", { \n                // biome-ignore lint/security/noDangerouslySetInnerHtml: not user-configurable\n                dangerouslySetInnerHTML: { __html: this.shouldFailHtml } })) : null));\n    }\n    getCurrentCode() {\n        return this.view.state.doc.toString();\n    }\n    reconfigure(extensions) {\n        this.view.dispatch({\n            effects: [mainKeybinding.reconfigure([...extensions, this.setup])]\n        });\n    }\n    removeIconField(f) {\n        this.view.dispatch({\n            effects: [f.effectType.of([])]\n        });\n    }\n    addPermissionsField(f, methodCallPoints, facts) {\n        let newEffects = methodCallPoints.map(v => f.fromOutput(v, facts));\n        this.view.dispatch({\n            effects: [f.effectType.of(newEffects)]\n        });\n    }\n    async renderPermissions(cfg) {\n        // TODO: the permissions Decos are no longer removed on update\n        // so we have to recompute every time.\n        // if (this.permissionsDecos === undefined) {\n        await this.renderOperation(\"permissions\", {\n            config: cfg\n        });\n        // }\n        renderPermissions(this.view, this.permissionsDecos, cfg);\n    }\n    destroy() {\n        this.view.destroy();\n    }\n    // Actions to communicate with the aquascope server\n    async callBackendWithCode(endpoint, config) {\n        let inEditor = this.getCurrentCode();\n        let endpointUrl = new URL(endpoint, this.serverUrl);\n        let serverResponseRaw = await fetch(endpointUrl, {\n            method: \"POST\",\n            headers: {\n                \"Content-Type\": \"application/json\"\n            },\n            body: JSON.stringify({\n                code: inEditor,\n                config\n            })\n        });\n        let serverResponse = await serverResponseRaw.json();\n        return serverResponse;\n    }\n    renderInterpreter(trace, config, annotations) {\n        if (config?.hideCode) {\n            this.view.destroy();\n            this.metaContainer.unmount();\n        }\n        renderInterpreter(this.view, this.interpreterContainer, trace, config, annotations);\n    }\n    async renderOperation(operation, { response, config, annotations } = {}) {\n        console.debug(`Rendering operation: ${operation}`);\n        if (!response) {\n            let serverResponse = await this.callBackendWithCode(operation, config);\n            if (serverResponse.success) {\n                response = JSON.parse(serverResponse.stdout);\n                this.reportStdErr({\n                    type: \"ServerStderr\",\n                    error: serverResponse.stderr\n                });\n            }\n            else {\n                return this.reportStdErr({\n                    type: \"ServerStderr\",\n                    error: serverResponse.stderr\n                });\n            }\n        }\n        if (annotations?.hidden_lines && annotations.hidden_lines.length > 0) {\n            this.view.dispatch({\n                effects: annotations.hidden_lines.map(line => hideLine.of({ line }))\n            });\n            this.buttons.add(\"eye\");\n        }\n        if (config?.shouldFail) {\n            this.shouldFail = true;\n        }\n        this.renderMeta();\n        if (operation === \"interpreter\") {\n            if (\"Ok\" in response) {\n                this.renderInterpreter(response.Ok, config, annotations?.interp);\n            }\n            else {\n                this.reportStdErr(response.Err);\n            }\n        }\n        else if (operation === \"permissions\") {\n            // The permissions analysis results are sent as an array of\n            // body analyses. Each body could have analyzed successfully,\n            // or had a\n            // 1. analysis error\n            // 2. build error\n            // A build error signifies that something went wrong *before*\n            // our analysis was run. This should be reported to the user,\n            // currently, information is available on stderr but nothing\n            // more specific (or visual) is given TODO.\n            // For an analysis error, this is something that went wrong\n            // internally, usually means a feature was used that we don't support\n            // or something actually went terribly wrong. These should be logged\n            // somewhere, but the user should also be prompted to open a GitHub issue.\n            let cast = response;\n            let results = [];\n            for (const res of cast) {\n                if (\"Ok\" in res) {\n                    results.push(res.Ok);\n                }\n                else {\n                    this.reportStdErr(res.Err);\n                }\n            }\n            this.permissionsDecos = makePermissionsDecorations(this.view, results, annotations);\n            renderPermissions(this.view, this.permissionsDecos, config);\n        }\n    }\n}\nexport let EditorComponent = (props) => {\n    let ref = useRef(null);\n    useEffect(() => {\n        let editor = new Editor(ref.current, props.setup ?? [], props.code);\n        if (props.steps)\n            editor.renderOperation(\"interpreter\", {\n                response: props.steps,\n                config: {\n                    horizontal: \"true\"\n                }\n            });\n        if (props.permissions)\n            editor.renderOperation(\"permissions\", {\n                response: props.permissions,\n                config: {\n                    stepper: \"true\",\n                    boundaries: \"true\"\n                }\n            });\n        return () => editor.destroy();\n    }, []);\n    return React.createElement(\"div\", { ref: ref });\n};\n//# sourceMappingURL=lib.js.map","function t(t){return t.split(\"-\")[1]}function e(t){return\"y\"===t?\"height\":\"width\"}function n(t){return t.split(\"-\")[0]}function o(t){return[\"top\",\"bottom\"].includes(n(t))?\"x\":\"y\"}function i(i,r,a){let{reference:l,floating:s}=i;const c=l.x+l.width/2-s.width/2,f=l.y+l.height/2-s.height/2,m=o(r),u=e(m),g=l[u]/2-s[u]/2,d=\"x\"===m;let p;switch(n(r)){case\"top\":p={x:c,y:l.y-s.height};break;case\"bottom\":p={x:c,y:l.y+l.height};break;case\"right\":p={x:l.x+l.width,y:f};break;case\"left\":p={x:l.x-s.width,y:f};break;default:p={x:l.x,y:l.y}}switch(t(r)){case\"start\":p[m]-=g*(a&&d?-1:1);break;case\"end\":p[m]+=g*(a&&d?-1:1)}return p}const r=async(t,e,n)=>{const{placement:o=\"bottom\",strategy:r=\"absolute\",middleware:a=[],platform:l}=n,s=a.filter(Boolean),c=await(null==l.isRTL?void 0:l.isRTL(e));let f=await l.getElementRects({reference:t,floating:e,strategy:r}),{x:m,y:u}=i(f,o,c),g=o,d={},p=0;for(let n=0;n<s.length;n++){const{name:a,fn:h}=s[n],{x:y,y:x,data:w,reset:v}=await h({x:m,y:u,initialPlacement:o,placement:g,strategy:r,middlewareData:d,rects:f,platform:l,elements:{reference:t,floating:e}});m=null!=y?y:m,u=null!=x?x:u,d={...d,[a]:{...d[a],...w}},v&&p<=50&&(p++,\"object\"==typeof v&&(v.placement&&(g=v.placement),v.rects&&(f=!0===v.rects?await l.getElementRects({reference:t,floating:e,strategy:r}):v.rects),({x:m,y:u}=i(f,g,c))),n=-1)}return{x:m,y:u,placement:g,strategy:r,middlewareData:d}};function a(t,e){return\"function\"==typeof t?t(e):t}function l(t){return\"number\"!=typeof t?function(t){return{top:0,right:0,bottom:0,left:0,...t}}(t):{top:t,right:t,bottom:t,left:t}}function s(t){return{...t,top:t.y,left:t.x,right:t.x+t.width,bottom:t.y+t.height}}async function c(t,e){var n;void 0===e&&(e={});const{x:o,y:i,platform:r,rects:c,elements:f,strategy:m}=t,{boundary:u=\"clippingAncestors\",rootBoundary:g=\"viewport\",elementContext:d=\"floating\",altBoundary:p=!1,padding:h=0}=a(e,t),y=l(h),x=f[p?\"floating\"===d?\"reference\":\"floating\":d],w=s(await r.getClippingRect({element:null==(n=await(null==r.isElement?void 0:r.isElement(x)))||n?x:x.contextElement||await(null==r.getDocumentElement?void 0:r.getDocumentElement(f.floating)),boundary:u,rootBoundary:g,strategy:m})),v=\"floating\"===d?{...c.floating,x:o,y:i}:c.reference,b=await(null==r.getOffsetParent?void 0:r.getOffsetParent(f.floating)),A=await(null==r.isElement?void 0:r.isElement(b))&&await(null==r.getScale?void 0:r.getScale(b))||{x:1,y:1},R=s(r.convertOffsetParentRelativeRectToViewportRelativeRect?await r.convertOffsetParentRelativeRectToViewportRelativeRect({rect:v,offsetParent:b,strategy:m}):v);return{top:(w.top-R.top+y.top)/A.y,bottom:(R.bottom-w.bottom+y.bottom)/A.y,left:(w.left-R.left+y.left)/A.x,right:(R.right-w.right+y.right)/A.x}}const f=Math.min,m=Math.max;function u(t,e,n){return m(t,f(e,n))}const g=n=>({name:\"arrow\",options:n,async fn(i){const{x:r,y:s,placement:c,rects:m,platform:g,elements:d}=i,{element:p,padding:h=0}=a(n,i)||{};if(null==p)return{};const y=l(h),x={x:r,y:s},w=o(c),v=e(w),b=await g.getDimensions(p),A=\"y\"===w,R=A?\"top\":\"left\",P=A?\"bottom\":\"right\",E=A?\"clientHeight\":\"clientWidth\",T=m.reference[v]+m.reference[w]-x[w]-m.floating[v],D=x[w]-m.reference[w],L=await(null==g.getOffsetParent?void 0:g.getOffsetParent(p));let k=L?L[E]:0;k&&await(null==g.isElement?void 0:g.isElement(L))||(k=d.floating[E]||m.floating[v]);const O=T/2-D/2,B=k/2-b[v]/2-1,C=f(y[R],B),H=f(y[P],B),S=C,F=k-b[v]-H,M=k/2-b[v]/2+O,V=u(S,M,F),W=null!=t(c)&&M!=V&&m.reference[v]/2-(M<S?C:H)-b[v]/2<0?M<S?S-M:F-M:0;return{[w]:x[w]-W,data:{[w]:V,centerOffset:M-V+W}}}}),d=[\"top\",\"right\",\"bottom\",\"left\"],p=d.reduce(((t,e)=>t.concat(e,e+\"-start\",e+\"-end\")),[]),h={left:\"right\",right:\"left\",bottom:\"top\",top:\"bottom\"};function y(t){return t.replace(/left|right|bottom|top/g,(t=>h[t]))}function x(n,i,r){void 0===r&&(r=!1);const a=t(n),l=o(n),s=e(l);let c=\"x\"===l?a===(r?\"end\":\"start\")?\"right\":\"left\":\"start\"===a?\"bottom\":\"top\";return i.reference[s]>i.floating[s]&&(c=y(c)),{main:c,cross:y(c)}}const w={start:\"end\",end:\"start\"};function v(t){return t.replace(/start|end/g,(t=>w[t]))}const b=function(e){return void 0===e&&(e={}),{name:\"autoPlacement\",options:e,async fn(o){var i,r,l;const{rects:s,middlewareData:f,placement:m,platform:u,elements:g}=o,{crossAxis:d=!1,alignment:h,allowedPlacements:y=p,autoAlignment:w=!0,...b}=a(e,o),A=void 0!==h||y===p?function(e,o,i){return(e?[...i.filter((n=>t(n)===e)),...i.filter((n=>t(n)!==e))]:i.filter((t=>n(t)===t))).filter((n=>!e||t(n)===e||!!o&&v(n)!==n))}(h||null,w,y):y,R=await c(o,b),P=(null==(i=f.autoPlacement)?void 0:i.index)||0,E=A[P];if(null==E)return{};const{main:T,cross:D}=x(E,s,await(null==u.isRTL?void 0:u.isRTL(g.floating)));if(m!==E)return{reset:{placement:A[0]}};const L=[R[n(E)],R[T],R[D]],k=[...(null==(r=f.autoPlacement)?void 0:r.overflows)||[],{placement:E,overflows:L}],O=A[P+1];if(O)return{data:{index:P+1,overflows:k},reset:{placement:O}};const B=k.map((e=>{const n=t(e.placement);return[e.placement,n&&d?e.overflows.slice(0,2).reduce(((t,e)=>t+e),0):e.overflows[0],e.overflows]})).sort(((t,e)=>t[1]-e[1])),C=(null==(l=B.filter((e=>e[2].slice(0,t(e[0])?2:3).every((t=>t<=0))))[0])?void 0:l[0])||B[0][0];return C!==m?{data:{index:P+1,overflows:k},reset:{placement:C}}:{}}}};const A=function(e){return void 0===e&&(e={}),{name:\"flip\",options:e,async fn(o){var i;const{placement:r,middlewareData:l,rects:s,initialPlacement:f,platform:m,elements:u}=o,{mainAxis:g=!0,crossAxis:d=!0,fallbackPlacements:p,fallbackStrategy:h=\"bestFit\",fallbackAxisSideDirection:w=\"none\",flipAlignment:b=!0,...A}=a(e,o),R=n(r),P=n(f)===f,E=await(null==m.isRTL?void 0:m.isRTL(u.floating)),T=p||(P||!b?[y(f)]:function(t){const e=y(t);return[v(t),e,v(e)]}(f));p||\"none\"===w||T.push(...function(e,o,i,r){const a=t(e);let l=function(t,e,n){const o=[\"left\",\"right\"],i=[\"right\",\"left\"],r=[\"top\",\"bottom\"],a=[\"bottom\",\"top\"];switch(t){case\"top\":case\"bottom\":return n?e?i:o:e?o:i;case\"left\":case\"right\":return e?r:a;default:return[]}}(n(e),\"start\"===i,r);return a&&(l=l.map((t=>t+\"-\"+a)),o&&(l=l.concat(l.map(v)))),l}(f,b,w,E));const D=[f,...T],L=await c(o,A),k=[];let O=(null==(i=l.flip)?void 0:i.overflows)||[];if(g&&k.push(L[R]),d){const{main:t,cross:e}=x(r,s,E);k.push(L[t],L[e])}if(O=[...O,{placement:r,overflows:k}],!k.every((t=>t<=0))){var B,C;const t=((null==(B=l.flip)?void 0:B.index)||0)+1,e=D[t];if(e)return{data:{index:t,overflows:O},reset:{placement:e}};let n=null==(C=O.filter((t=>t.overflows[0]<=0)).sort(((t,e)=>t.overflows[1]-e.overflows[1]))[0])?void 0:C.placement;if(!n)switch(h){case\"bestFit\":{var H;const t=null==(H=O.map((t=>[t.placement,t.overflows.filter((t=>t>0)).reduce(((t,e)=>t+e),0)])).sort(((t,e)=>t[1]-e[1]))[0])?void 0:H[0];t&&(n=t);break}case\"initialPlacement\":n=f}if(r!==n)return{reset:{placement:n}}}return{}}}};function R(t,e){return{top:t.top-e.height,right:t.right-e.width,bottom:t.bottom-e.height,left:t.left-e.width}}function P(t){return d.some((e=>t[e]>=0))}const E=function(t){return void 0===t&&(t={}),{name:\"hide\",options:t,async fn(e){const{rects:n}=e,{strategy:o=\"referenceHidden\",...i}=a(t,e);switch(o){case\"referenceHidden\":{const t=R(await c(e,{...i,elementContext:\"reference\"}),n.reference);return{data:{referenceHiddenOffsets:t,referenceHidden:P(t)}}}case\"escaped\":{const t=R(await c(e,{...i,altBoundary:!0}),n.floating);return{data:{escapedOffsets:t,escaped:P(t)}}}default:return{}}}}};function T(t){const e=f(...t.map((t=>t.left))),n=f(...t.map((t=>t.top)));return{x:e,y:n,width:m(...t.map((t=>t.right)))-e,height:m(...t.map((t=>t.bottom)))-n}}const D=function(t){return void 0===t&&(t={}),{name:\"inline\",options:t,async fn(e){const{placement:i,elements:r,rects:c,platform:u,strategy:g}=e,{padding:d=2,x:p,y:h}=a(t,e),y=Array.from(await(null==u.getClientRects?void 0:u.getClientRects(r.reference))||[]),x=function(t){const e=t.slice().sort(((t,e)=>t.y-e.y)),n=[];let o=null;for(let t=0;t<e.length;t++){const i=e[t];!o||i.y-o.y>o.height/2?n.push([i]):n[n.length-1].push(i),o=i}return n.map((t=>s(T(t))))}(y),w=s(T(y)),v=l(d);const b=await u.getElementRects({reference:{getBoundingClientRect:function(){if(2===x.length&&x[0].left>x[1].right&&null!=p&&null!=h)return x.find((t=>p>t.left-v.left&&p<t.right+v.right&&h>t.top-v.top&&h<t.bottom+v.bottom))||w;if(x.length>=2){if(\"x\"===o(i)){const t=x[0],e=x[x.length-1],o=\"top\"===n(i),r=t.top,a=e.bottom,l=o?t.left:e.left,s=o?t.right:e.right;return{top:r,bottom:a,left:l,right:s,width:s-l,height:a-r,x:l,y:r}}const t=\"left\"===n(i),e=m(...x.map((t=>t.right))),r=f(...x.map((t=>t.left))),a=x.filter((n=>t?n.left===r:n.right===e)),l=a[0].top,s=a[a.length-1].bottom;return{top:l,bottom:s,left:r,right:e,width:e-r,height:s-l,x:r,y:l}}return w}},floating:r.floating,strategy:g});return c.reference.x!==b.reference.x||c.reference.y!==b.reference.y||c.reference.width!==b.reference.width||c.reference.height!==b.reference.height?{reset:{rects:b}}:{}}}};const L=function(e){return void 0===e&&(e=0),{name:\"offset\",options:e,async fn(i){const{x:r,y:l}=i,s=await async function(e,i){const{placement:r,platform:l,elements:s}=e,c=await(null==l.isRTL?void 0:l.isRTL(s.floating)),f=n(r),m=t(r),u=\"x\"===o(r),g=[\"left\",\"top\"].includes(f)?-1:1,d=c&&u?-1:1,p=a(i,e);let{mainAxis:h,crossAxis:y,alignmentAxis:x}=\"number\"==typeof p?{mainAxis:p,crossAxis:0,alignmentAxis:null}:{mainAxis:0,crossAxis:0,alignmentAxis:null,...p};return m&&\"number\"==typeof x&&(y=\"end\"===m?-1*x:x),u?{x:y*d,y:h*g}:{x:h*g,y:y*d}}(i,e);return{x:r+s.x,y:l+s.y,data:s}}}};function k(t){return\"x\"===t?\"y\":\"x\"}const O=function(t){return void 0===t&&(t={}),{name:\"shift\",options:t,async fn(e){const{x:i,y:r,placement:l}=e,{mainAxis:s=!0,crossAxis:f=!1,limiter:m={fn:t=>{let{x:e,y:n}=t;return{x:e,y:n}}},...g}=a(t,e),d={x:i,y:r},p=await c(e,g),h=o(n(l)),y=k(h);let x=d[h],w=d[y];if(s){const t=\"y\"===h?\"bottom\":\"right\";x=u(x+p[\"y\"===h?\"top\":\"left\"],x,x-p[t])}if(f){const t=\"y\"===y?\"bottom\":\"right\";w=u(w+p[\"y\"===y?\"top\":\"left\"],w,w-p[t])}const v=m.fn({...e,[h]:x,[y]:w});return{...v,data:{x:v.x-i,y:v.y-r}}}}},B=function(t){return void 0===t&&(t={}),{options:t,fn(e){const{x:i,y:r,placement:l,rects:s,middlewareData:c}=e,{offset:f=0,mainAxis:m=!0,crossAxis:u=!0}=a(t,e),g={x:i,y:r},d=o(l),p=k(d);let h=g[d],y=g[p];const x=a(f,e),w=\"number\"==typeof x?{mainAxis:x,crossAxis:0}:{mainAxis:0,crossAxis:0,...x};if(m){const t=\"y\"===d?\"height\":\"width\",e=s.reference[d]-s.floating[t]+w.mainAxis,n=s.reference[d]+s.reference[t]-w.mainAxis;h<e?h=e:h>n&&(h=n)}if(u){var v,b;const t=\"y\"===d?\"width\":\"height\",e=[\"top\",\"left\"].includes(n(l)),o=s.reference[p]-s.floating[t]+(e&&(null==(v=c.offset)?void 0:v[p])||0)+(e?0:w.crossAxis),i=s.reference[p]+s.reference[t]+(e?0:(null==(b=c.offset)?void 0:b[p])||0)-(e?w.crossAxis:0);y<o?y=o:y>i&&(y=i)}return{[d]:h,[p]:y}}}},C=function(e){return void 0===e&&(e={}),{name:\"size\",options:e,async fn(i){const{placement:r,rects:l,platform:s,elements:u}=i,{apply:g=(()=>{}),...d}=a(e,i),p=await c(i,d),h=n(r),y=t(r),x=\"x\"===o(r),{width:w,height:v}=l.floating;let b,A;\"top\"===h||\"bottom\"===h?(b=h,A=y===(await(null==s.isRTL?void 0:s.isRTL(u.floating))?\"start\":\"end\")?\"left\":\"right\"):(A=h,b=\"end\"===y?\"top\":\"bottom\");const R=v-p[b],P=w-p[A],E=!i.middlewareData.shift;let T=R,D=P;if(x){const t=w-p.left-p.right;D=y||E?f(P,t):t}else{const t=v-p.top-p.bottom;T=y||E?f(R,t):t}if(E&&!y){const t=m(p.left,0),e=m(p.right,0),n=m(p.top,0),o=m(p.bottom,0);x?D=w-2*(0!==t||0!==e?t+e:m(p.left,p.right)):T=v-2*(0!==n||0!==o?n+o:m(p.top,p.bottom))}await g({...i,availableWidth:D,availableHeight:T});const L=await s.getDimensions(u.floating);return w!==L.width||v!==L.height?{reset:{rects:!0}}:{}}}};export{g as arrow,b as autoPlacement,r as computePosition,c as detectOverflow,A as flip,E as hide,D as inline,B as limitShift,L as offset,s as rectToClientRect,O as shift,C as size};\n","import{rectToClientRect as t,computePosition as e}from\"@floating-ui/core\";export{arrow,autoPlacement,detectOverflow,flip,hide,inline,limitShift,offset,shift,size}from\"@floating-ui/core\";function n(t){var e;return(null==t||null==(e=t.ownerDocument)?void 0:e.defaultView)||window}function o(t){return n(t).getComputedStyle(t)}function i(t){return t instanceof n(t).Node}function r(t){return i(t)?(t.nodeName||\"\").toLowerCase():\"#document\"}function c(t){return t instanceof HTMLElement||t instanceof n(t).HTMLElement}function l(t){return\"undefined\"!=typeof ShadowRoot&&(t instanceof n(t).ShadowRoot||t instanceof ShadowRoot)}function s(t){const{overflow:e,overflowX:n,overflowY:i,display:r}=o(t);return/auto|scroll|overlay|hidden|clip/.test(e+i+n)&&![\"inline\",\"contents\"].includes(r)}function f(t){return[\"table\",\"td\",\"th\"].includes(r(t))}function u(t){const e=a(),n=o(t);return\"none\"!==n.transform||\"none\"!==n.perspective||!!n.containerType&&\"normal\"!==n.containerType||!e&&!!n.backdropFilter&&\"none\"!==n.backdropFilter||!e&&!!n.filter&&\"none\"!==n.filter||[\"transform\",\"perspective\",\"filter\"].some((t=>(n.willChange||\"\").includes(t)))||[\"paint\",\"layout\",\"strict\",\"content\"].some((t=>(n.contain||\"\").includes(t)))}function a(){return!(\"undefined\"==typeof CSS||!CSS.supports)&&CSS.supports(\"-webkit-backdrop-filter\",\"none\")}function d(t){return[\"html\",\"body\",\"#document\"].includes(r(t))}const h=Math.min,p=Math.max,m=Math.round,g=Math.floor,y=t=>({x:t,y:t});function w(t){const e=o(t);let n=parseFloat(e.width)||0,i=parseFloat(e.height)||0;const r=c(t),l=r?t.offsetWidth:n,s=r?t.offsetHeight:i,f=m(n)!==l||m(i)!==s;return f&&(n=l,i=s),{width:n,height:i,$:f}}function x(t){return t instanceof Element||t instanceof n(t).Element}function v(t){return x(t)?t:t.contextElement}function b(t){const e=v(t);if(!c(e))return y(1);const n=e.getBoundingClientRect(),{width:o,height:i,$:r}=w(e);let l=(r?m(n.width):n.width)/o,s=(r?m(n.height):n.height)/i;return l&&Number.isFinite(l)||(l=1),s&&Number.isFinite(s)||(s=1),{x:l,y:s}}const L=y(0);function T(t){const e=n(t);return a()&&e.visualViewport?{x:e.visualViewport.offsetLeft,y:e.visualViewport.offsetTop}:L}function R(e,o,i,r){void 0===o&&(o=!1),void 0===i&&(i=!1);const c=e.getBoundingClientRect(),l=v(e);let s=y(1);o&&(r?x(r)&&(s=b(r)):s=b(e));const f=function(t,e,o){return void 0===e&&(e=!1),!(!o||e&&o!==n(t))&&e}(l,i,r)?T(l):y(0);let u=(c.left+f.x)/s.x,a=(c.top+f.y)/s.y,d=c.width/s.x,h=c.height/s.y;if(l){const t=n(l),e=r&&x(r)?n(r):r;let o=t.frameElement;for(;o&&r&&e!==t;){const t=b(o),e=o.getBoundingClientRect(),i=getComputedStyle(o),r=e.left+(o.clientLeft+parseFloat(i.paddingLeft))*t.x,c=e.top+(o.clientTop+parseFloat(i.paddingTop))*t.y;u*=t.x,a*=t.y,d*=t.x,h*=t.y,u+=r,a+=c,o=n(o).frameElement}}return t({width:d,height:h,x:u,y:a})}function E(t){return x(t)?{scrollLeft:t.scrollLeft,scrollTop:t.scrollTop}:{scrollLeft:t.pageXOffset,scrollTop:t.pageYOffset}}function S(t){var e;return null==(e=(i(t)?t.ownerDocument:t.document)||window.document)?void 0:e.documentElement}function C(t){return R(S(t)).left+E(t).scrollLeft}function F(t){if(\"html\"===r(t))return t;const e=t.assignedSlot||t.parentNode||l(t)&&t.host||S(t);return l(e)?e.host:e}function O(t){const e=F(t);return d(e)?t.ownerDocument?t.ownerDocument.body:t.body:c(e)&&s(e)?e:O(e)}function D(t,e){var o;void 0===e&&(e=[]);const i=O(t),r=i===(null==(o=t.ownerDocument)?void 0:o.body),c=n(i);return r?e.concat(c,c.visualViewport||[],s(i)?i:[]):e.concat(i,D(i))}function H(e,i,r){let l;if(\"viewport\"===i)l=function(t,e){const o=n(t),i=S(t),r=o.visualViewport;let c=i.clientWidth,l=i.clientHeight,s=0,f=0;if(r){c=r.width,l=r.height;const t=a();(!t||t&&\"fixed\"===e)&&(s=r.offsetLeft,f=r.offsetTop)}return{width:c,height:l,x:s,y:f}}(e,r);else if(\"document\"===i)l=function(t){const e=S(t),n=E(t),i=t.ownerDocument.body,r=p(e.scrollWidth,e.clientWidth,i.scrollWidth,i.clientWidth),c=p(e.scrollHeight,e.clientHeight,i.scrollHeight,i.clientHeight);let l=-n.scrollLeft+C(t);const s=-n.scrollTop;return\"rtl\"===o(i).direction&&(l+=p(e.clientWidth,i.clientWidth)-r),{width:r,height:c,x:l,y:s}}(S(e));else if(x(i))l=function(t,e){const n=R(t,!0,\"fixed\"===e),o=n.top+t.clientTop,i=n.left+t.clientLeft,r=c(t)?b(t):y(1);return{width:t.clientWidth*r.x,height:t.clientHeight*r.y,x:i*r.x,y:o*r.y}}(i,r);else{const t=T(e);l={...i,x:i.x-t.x,y:i.y-t.y}}return t(l)}function W(t,e){const n=F(t);return!(n===e||!x(n)||d(n))&&(\"fixed\"===o(n).position||W(n,e))}function M(t,e,n){const o=c(e),i=S(e),l=\"fixed\"===n,f=R(t,!0,l,e);let u={scrollLeft:0,scrollTop:0};const a=y(0);if(o||!o&&!l)if((\"body\"!==r(e)||s(i))&&(u=E(e)),c(e)){const t=R(e,!0,l,e);a.x=t.x+e.clientLeft,a.y=t.y+e.clientTop}else i&&(a.x=C(i));return{x:f.left+u.scrollLeft-a.x,y:f.top+u.scrollTop-a.y,width:f.width,height:f.height}}function z(t,e){return c(t)&&\"fixed\"!==o(t).position?e?e(t):t.offsetParent:null}function P(t,e){const i=n(t);if(!c(t))return i;let l=z(t,e);for(;l&&f(l)&&\"static\"===o(l).position;)l=z(l,e);return l&&(\"html\"===r(l)||\"body\"===r(l)&&\"static\"===o(l).position&&!u(l))?i:l||function(t){let e=F(t);for(;c(e)&&!d(e);){if(u(e))return e;e=F(e)}return null}(t)||i}const V={convertOffsetParentRelativeRectToViewportRelativeRect:function(t){let{rect:e,offsetParent:n,strategy:o}=t;const i=c(n),l=S(n);if(n===l)return e;let f={scrollLeft:0,scrollTop:0},u=y(1);const a=y(0);if((i||!i&&\"fixed\"!==o)&&((\"body\"!==r(n)||s(l))&&(f=E(n)),c(n))){const t=R(n);u=b(n),a.x=t.x+n.clientLeft,a.y=t.y+n.clientTop}return{width:e.width*u.x,height:e.height*u.y,x:e.x*u.x-f.scrollLeft*u.x+a.x,y:e.y*u.y-f.scrollTop*u.y+a.y}},getDocumentElement:S,getClippingRect:function(t){let{element:e,boundary:n,rootBoundary:i,strategy:c}=t;const l=[...\"clippingAncestors\"===n?function(t,e){const n=e.get(t);if(n)return n;let i=D(t).filter((t=>x(t)&&\"body\"!==r(t))),c=null;const l=\"fixed\"===o(t).position;let f=l?F(t):t;for(;x(f)&&!d(f);){const e=o(f),n=u(f);n||\"fixed\"!==e.position||(c=null),(l?!n&&!c:!n&&\"static\"===e.position&&c&&[\"absolute\",\"fixed\"].includes(c.position)||s(f)&&!n&&W(t,f))?i=i.filter((t=>t!==f)):c=e,f=F(f)}return e.set(t,i),i}(e,this._c):[].concat(n),i],f=l[0],a=l.reduce(((t,n)=>{const o=H(e,n,c);return t.top=p(o.top,t.top),t.right=h(o.right,t.right),t.bottom=h(o.bottom,t.bottom),t.left=p(o.left,t.left),t}),H(e,f,c));return{width:a.right-a.left,height:a.bottom-a.top,x:a.left,y:a.top}},getOffsetParent:P,getElementRects:async function(t){let{reference:e,floating:n,strategy:o}=t;const i=this.getOffsetParent||P,r=this.getDimensions;return{reference:M(e,await i(n),o),floating:{x:0,y:0,...await r(n)}}},getClientRects:function(t){return Array.from(t.getClientRects())},getDimensions:function(t){return w(t)},getScale:b,isElement:x,isRTL:function(t){return\"rtl\"===getComputedStyle(t).direction}};function A(t,e,n,o){void 0===o&&(o={});const{ancestorScroll:i=!0,ancestorResize:r=!0,elementResize:c=\"function\"==typeof ResizeObserver,layoutShift:l=\"function\"==typeof IntersectionObserver,animationFrame:s=!1}=o,f=v(t),u=i||r?[...f?D(f):[],...D(e)]:[];u.forEach((t=>{i&&t.addEventListener(\"scroll\",n,{passive:!0}),r&&t.addEventListener(\"resize\",n)}));const a=f&&l?function(t,e){let n,o=null;const i=S(t);function r(){clearTimeout(n),o&&o.disconnect(),o=null}return function c(l,s){void 0===l&&(l=!1),void 0===s&&(s=1),r();const{left:f,top:u,width:a,height:d}=t.getBoundingClientRect();if(l||e(),!a||!d)return;const m={rootMargin:-g(u)+\"px \"+-g(i.clientWidth-(f+a))+\"px \"+-g(i.clientHeight-(u+d))+\"px \"+-g(f)+\"px\",threshold:p(0,h(1,s))||1};let y=!0;function w(t){const e=t[0].intersectionRatio;if(e!==s){if(!y)return c();e?c(!1,e):n=setTimeout((()=>{c(!1,1e-7)}),100)}y=!1}try{o=new IntersectionObserver(w,{...m,root:i.ownerDocument})}catch(t){o=new IntersectionObserver(w,m)}o.observe(t)}(!0),r}(f,n):null;let d,m=-1,y=null;c&&(y=new ResizeObserver((t=>{let[o]=t;o&&o.target===f&&y&&(y.unobserve(e),cancelAnimationFrame(m),m=requestAnimationFrame((()=>{y&&y.observe(e)}))),n()})),f&&!s&&y.observe(f),y.observe(e));let w=s?R(t):null;return s&&function e(){const o=R(t);!w||o.x===w.x&&o.y===w.y&&o.width===w.width&&o.height===w.height||n();w=o,d=requestAnimationFrame(e)}(),n(),()=>{u.forEach((t=>{i&&t.removeEventListener(\"scroll\",n),r&&t.removeEventListener(\"resize\",n)})),a&&a(),y&&y.disconnect(),y=null,s&&cancelAnimationFrame(d)}}const B=(t,n,o)=>{const i=new Map,r={platform:V,...o},c={...r.platform,_c:i};return e(t,n,{...r,platform:c})};export{A as autoUpdate,B as computePosition,D as getOverflowAncestors,V as platform};\n","import { arrow as arrow$1, computePosition } from '@floating-ui/dom';\nexport { autoPlacement, autoUpdate, computePosition, detectOverflow, flip, getOverflowAncestors, hide, inline, limitShift, offset, platform, shift, size } from '@floating-ui/dom';\nimport * as React from 'react';\nimport { useLayoutEffect, useEffect } from 'react';\nimport * as ReactDOM from 'react-dom';\n\n/**\n * A data provider that provides data to position an inner element of the\n * floating element (usually a triangle or caret) so that it is centered to the\n * reference element.\n * This wraps the core `arrow` middleware to allow React refs as the element.\n * @see https://floating-ui.com/docs/arrow\n */\nconst arrow = options => {\n  const {\n    element,\n    padding\n  } = options;\n  function isRef(value) {\n    return Object.prototype.hasOwnProperty.call(value, 'current');\n  }\n  return {\n    name: 'arrow',\n    options,\n    fn(args) {\n      if (isRef(element)) {\n        if (element.current != null) {\n          return arrow$1({\n            element: element.current,\n            padding\n          }).fn(args);\n        }\n        return {};\n      } else if (element) {\n        return arrow$1({\n          element,\n          padding\n        }).fn(args);\n      }\n      return {};\n    }\n  };\n};\n\nvar index = typeof document !== 'undefined' ? useLayoutEffect : useEffect;\n\n// Fork of `fast-deep-equal` that only does the comparisons we need and compares\n// functions\nfunction deepEqual(a, b) {\n  if (a === b) {\n    return true;\n  }\n  if (typeof a !== typeof b) {\n    return false;\n  }\n  if (typeof a === 'function' && a.toString() === b.toString()) {\n    return true;\n  }\n  let length, i, keys;\n  if (a && b && typeof a == 'object') {\n    if (Array.isArray(a)) {\n      length = a.length;\n      if (length != b.length) return false;\n      for (i = length; i-- !== 0;) {\n        if (!deepEqual(a[i], b[i])) {\n          return false;\n        }\n      }\n      return true;\n    }\n    keys = Object.keys(a);\n    length = keys.length;\n    if (length !== Object.keys(b).length) {\n      return false;\n    }\n    for (i = length; i-- !== 0;) {\n      if (!Object.prototype.hasOwnProperty.call(b, keys[i])) {\n        return false;\n      }\n    }\n    for (i = length; i-- !== 0;) {\n      const key = keys[i];\n      if (key === '_owner' && a.$$typeof) {\n        continue;\n      }\n      if (!deepEqual(a[key], b[key])) {\n        return false;\n      }\n    }\n    return true;\n  }\n  return a !== a && b !== b;\n}\n\nfunction useLatestRef(value) {\n  const ref = React.useRef(value);\n  index(() => {\n    ref.current = value;\n  });\n  return ref;\n}\n\n/**\n * Provides data to position a floating element.\n * @see https://floating-ui.com/docs/react\n */\nfunction useFloating(options) {\n  if (options === void 0) {\n    options = {};\n  }\n  const {\n    placement = 'bottom',\n    strategy = 'absolute',\n    middleware = [],\n    platform,\n    whileElementsMounted,\n    open\n  } = options;\n  const [data, setData] = React.useState({\n    x: null,\n    y: null,\n    strategy,\n    placement,\n    middlewareData: {},\n    isPositioned: false\n  });\n  const [latestMiddleware, setLatestMiddleware] = React.useState(middleware);\n  if (!deepEqual(latestMiddleware, middleware)) {\n    setLatestMiddleware(middleware);\n  }\n  const referenceRef = React.useRef(null);\n  const floatingRef = React.useRef(null);\n  const dataRef = React.useRef(data);\n  const whileElementsMountedRef = useLatestRef(whileElementsMounted);\n  const platformRef = useLatestRef(platform);\n  const [reference, _setReference] = React.useState(null);\n  const [floating, _setFloating] = React.useState(null);\n  const setReference = React.useCallback(node => {\n    if (referenceRef.current !== node) {\n      referenceRef.current = node;\n      _setReference(node);\n    }\n  }, []);\n  const setFloating = React.useCallback(node => {\n    if (floatingRef.current !== node) {\n      floatingRef.current = node;\n      _setFloating(node);\n    }\n  }, []);\n  const update = React.useCallback(() => {\n    if (!referenceRef.current || !floatingRef.current) {\n      return;\n    }\n    const config = {\n      placement,\n      strategy,\n      middleware: latestMiddleware\n    };\n    if (platformRef.current) {\n      config.platform = platformRef.current;\n    }\n    computePosition(referenceRef.current, floatingRef.current, config).then(data => {\n      const fullData = {\n        ...data,\n        isPositioned: true\n      };\n      if (isMountedRef.current && !deepEqual(dataRef.current, fullData)) {\n        dataRef.current = fullData;\n        ReactDOM.flushSync(() => {\n          setData(fullData);\n        });\n      }\n    });\n  }, [latestMiddleware, placement, strategy, platformRef]);\n  index(() => {\n    if (open === false && dataRef.current.isPositioned) {\n      dataRef.current.isPositioned = false;\n      setData(data => ({\n        ...data,\n        isPositioned: false\n      }));\n    }\n  }, [open]);\n  const isMountedRef = React.useRef(false);\n  index(() => {\n    isMountedRef.current = true;\n    return () => {\n      isMountedRef.current = false;\n    };\n  }, []);\n  index(() => {\n    if (reference && floating) {\n      if (whileElementsMountedRef.current) {\n        return whileElementsMountedRef.current(reference, floating, update);\n      } else {\n        update();\n      }\n    }\n  }, [reference, floating, update, whileElementsMountedRef]);\n  const refs = React.useMemo(() => ({\n    reference: referenceRef,\n    floating: floatingRef,\n    setReference,\n    setFloating\n  }), [setReference, setFloating]);\n  const elements = React.useMemo(() => ({\n    reference,\n    floating\n  }), [reference, floating]);\n  return React.useMemo(() => ({\n    ...data,\n    update,\n    refs,\n    elements,\n    reference: setReference,\n    floating: setFloating\n  }), [data, update, refs, elements, setReference, setFloating]);\n}\n\nexport { arrow, useFloating };\n","import { Annotation, Facet, combineConfig, StateField, EditorSelection, Transaction, ChangeSet, ChangeDesc, StateEffect, Text, findClusterBreak, countColumn, CharCategory } from '@codemirror/state';\nimport { EditorView, Direction } from '@codemirror/view';\nimport { IndentContext, getIndentation, indentString, indentUnit, getIndentUnit, matchBrackets, syntaxTree } from '@codemirror/language';\nimport { NodeProp } from '@lezer/common';\n\n/**\nComment or uncomment the current selection. Will use line comments\nif available, otherwise falling back to block comments.\n*/\nconst toggleComment = target => {\n    let config = getConfig(target.state);\n    return config.line ? toggleLineComment(target) : config.block ? toggleBlockCommentByLine(target) : false;\n};\nfunction command(f, option) {\n    return ({ state, dispatch }) => {\n        if (state.readOnly)\n            return false;\n        let tr = f(option, state);\n        if (!tr)\n            return false;\n        dispatch(state.update(tr));\n        return true;\n    };\n}\n/**\nComment or uncomment the current selection using line comments.\nThe line comment syntax is taken from the\n[`commentTokens`](https://codemirror.net/6/docs/ref/#commands.CommentTokens) [language\ndata](https://codemirror.net/6/docs/ref/#state.EditorState.languageDataAt).\n*/\nconst toggleLineComment = /*@__PURE__*/command(changeLineComment, 0 /* CommentOption.Toggle */);\n/**\nComment the current selection using line comments.\n*/\nconst lineComment = /*@__PURE__*/command(changeLineComment, 1 /* CommentOption.Comment */);\n/**\nUncomment the current selection using line comments.\n*/\nconst lineUncomment = /*@__PURE__*/command(changeLineComment, 2 /* CommentOption.Uncomment */);\n/**\nComment or uncomment the current selection using block comments.\nThe block comment syntax is taken from the\n[`commentTokens`](https://codemirror.net/6/docs/ref/#commands.CommentTokens) [language\ndata](https://codemirror.net/6/docs/ref/#state.EditorState.languageDataAt).\n*/\nconst toggleBlockComment = /*@__PURE__*/command(changeBlockComment, 0 /* CommentOption.Toggle */);\n/**\nComment the current selection using block comments.\n*/\nconst blockComment = /*@__PURE__*/command(changeBlockComment, 1 /* CommentOption.Comment */);\n/**\nUncomment the current selection using block comments.\n*/\nconst blockUncomment = /*@__PURE__*/command(changeBlockComment, 2 /* CommentOption.Uncomment */);\n/**\nComment or uncomment the lines around the current selection using\nblock comments.\n*/\nconst toggleBlockCommentByLine = /*@__PURE__*/command((o, s) => changeBlockComment(o, s, selectedLineRanges(s)), 0 /* CommentOption.Toggle */);\nfunction getConfig(state, pos = state.selection.main.head) {\n    let data = state.languageDataAt(\"commentTokens\", pos);\n    return data.length ? data[0] : {};\n}\nconst SearchMargin = 50;\n/**\nDetermines if the given range is block-commented in the given\nstate.\n*/\nfunction findBlockComment(state, { open, close }, from, to) {\n    let textBefore = state.sliceDoc(from - SearchMargin, from);\n    let textAfter = state.sliceDoc(to, to + SearchMargin);\n    let spaceBefore = /\\s*$/.exec(textBefore)[0].length, spaceAfter = /^\\s*/.exec(textAfter)[0].length;\n    let beforeOff = textBefore.length - spaceBefore;\n    if (textBefore.slice(beforeOff - open.length, beforeOff) == open &&\n        textAfter.slice(spaceAfter, spaceAfter + close.length) == close) {\n        return { open: { pos: from - spaceBefore, margin: spaceBefore && 1 },\n            close: { pos: to + spaceAfter, margin: spaceAfter && 1 } };\n    }\n    let startText, endText;\n    if (to - from <= 2 * SearchMargin) {\n        startText = endText = state.sliceDoc(from, to);\n    }\n    else {\n        startText = state.sliceDoc(from, from + SearchMargin);\n        endText = state.sliceDoc(to - SearchMargin, to);\n    }\n    let startSpace = /^\\s*/.exec(startText)[0].length, endSpace = /\\s*$/.exec(endText)[0].length;\n    let endOff = endText.length - endSpace - close.length;\n    if (startText.slice(startSpace, startSpace + open.length) == open &&\n        endText.slice(endOff, endOff + close.length) == close) {\n        return { open: { pos: from + startSpace + open.length,\n                margin: /\\s/.test(startText.charAt(startSpace + open.length)) ? 1 : 0 },\n            close: { pos: to - endSpace - close.length,\n                margin: /\\s/.test(endText.charAt(endOff - 1)) ? 1 : 0 } };\n    }\n    return null;\n}\nfunction selectedLineRanges(state) {\n    let ranges = [];\n    for (let r of state.selection.ranges) {\n        let fromLine = state.doc.lineAt(r.from);\n        let toLine = r.to <= fromLine.to ? fromLine : state.doc.lineAt(r.to);\n        let last = ranges.length - 1;\n        if (last >= 0 && ranges[last].to > fromLine.from)\n            ranges[last].to = toLine.to;\n        else\n            ranges.push({ from: fromLine.from, to: toLine.to });\n    }\n    return ranges;\n}\n// Performs toggle, comment and uncomment of block comments in\n// languages that support them.\nfunction changeBlockComment(option, state, ranges = state.selection.ranges) {\n    let tokens = ranges.map(r => getConfig(state, r.from).block);\n    if (!tokens.every(c => c))\n        return null;\n    let comments = ranges.map((r, i) => findBlockComment(state, tokens[i], r.from, r.to));\n    if (option != 2 /* CommentOption.Uncomment */ && !comments.every(c => c)) {\n        return { changes: state.changes(ranges.map((range, i) => {\n                if (comments[i])\n                    return [];\n                return [{ from: range.from, insert: tokens[i].open + \" \" }, { from: range.to, insert: \" \" + tokens[i].close }];\n            })) };\n    }\n    else if (option != 1 /* CommentOption.Comment */ && comments.some(c => c)) {\n        let changes = [];\n        for (let i = 0, comment; i < comments.length; i++)\n            if (comment = comments[i]) {\n                let token = tokens[i], { open, close } = comment;\n                changes.push({ from: open.pos - token.open.length, to: open.pos + open.margin }, { from: close.pos - close.margin, to: close.pos + token.close.length });\n            }\n        return { changes };\n    }\n    return null;\n}\n// Performs toggle, comment and uncomment of line comments.\nfunction changeLineComment(option, state, ranges = state.selection.ranges) {\n    let lines = [];\n    let prevLine = -1;\n    for (let { from, to } of ranges) {\n        let startI = lines.length, minIndent = 1e9;\n        for (let pos = from; pos <= to;) {\n            let line = state.doc.lineAt(pos);\n            if (line.from > prevLine && (from == to || to > line.from)) {\n                prevLine = line.from;\n                let token = getConfig(state, pos).line;\n                if (!token)\n                    continue;\n                let indent = /^\\s*/.exec(line.text)[0].length;\n                let empty = indent == line.length;\n                let comment = line.text.slice(indent, indent + token.length) == token ? indent : -1;\n                if (indent < line.text.length && indent < minIndent)\n                    minIndent = indent;\n                lines.push({ line, comment, token, indent, empty, single: false });\n            }\n            pos = line.to + 1;\n        }\n        if (minIndent < 1e9)\n            for (let i = startI; i < lines.length; i++)\n                if (lines[i].indent < lines[i].line.text.length)\n                    lines[i].indent = minIndent;\n        if (lines.length == startI + 1)\n            lines[startI].single = true;\n    }\n    if (option != 2 /* CommentOption.Uncomment */ && lines.some(l => l.comment < 0 && (!l.empty || l.single))) {\n        let changes = [];\n        for (let { line, token, indent, empty, single } of lines)\n            if (single || !empty)\n                changes.push({ from: line.from + indent, insert: token + \" \" });\n        let changeSet = state.changes(changes);\n        return { changes: changeSet, selection: state.selection.map(changeSet, 1) };\n    }\n    else if (option != 1 /* CommentOption.Comment */ && lines.some(l => l.comment >= 0)) {\n        let changes = [];\n        for (let { line, comment, token } of lines)\n            if (comment >= 0) {\n                let from = line.from + comment, to = from + token.length;\n                if (line.text[to - line.from] == \" \")\n                    to++;\n                changes.push({ from, to });\n            }\n        return { changes };\n    }\n    return null;\n}\n\nconst fromHistory = /*@__PURE__*/Annotation.define();\n/**\nTransaction annotation that will prevent that transaction from\nbeing combined with other transactions in the undo history. Given\n`\"before\"`, it'll prevent merging with previous transactions. With\n`\"after\"`, subsequent transactions won't be combined with this\none. With `\"full\"`, the transaction is isolated on both sides.\n*/\nconst isolateHistory = /*@__PURE__*/Annotation.define();\n/**\nThis facet provides a way to register functions that, given a\ntransaction, provide a set of effects that the history should\nstore when inverting the transaction. This can be used to\nintegrate some kinds of effects in the history, so that they can\nbe undone (and redone again).\n*/\nconst invertedEffects = /*@__PURE__*/Facet.define();\nconst historyConfig = /*@__PURE__*/Facet.define({\n    combine(configs) {\n        return combineConfig(configs, {\n            minDepth: 100,\n            newGroupDelay: 500\n        }, { minDepth: Math.max, newGroupDelay: Math.min });\n    }\n});\nfunction changeEnd(changes) {\n    let end = 0;\n    changes.iterChangedRanges((_, to) => end = to);\n    return end;\n}\nconst historyField_ = /*@__PURE__*/StateField.define({\n    create() {\n        return HistoryState.empty;\n    },\n    update(state, tr) {\n        let config = tr.state.facet(historyConfig);\n        let fromHist = tr.annotation(fromHistory);\n        if (fromHist) {\n            let selection = tr.docChanged ? EditorSelection.single(changeEnd(tr.changes)) : undefined;\n            let item = HistEvent.fromTransaction(tr, selection), from = fromHist.side;\n            let other = from == 0 /* BranchName.Done */ ? state.undone : state.done;\n            if (item)\n                other = updateBranch(other, other.length, config.minDepth, item);\n            else\n                other = addSelection(other, tr.startState.selection);\n            return new HistoryState(from == 0 /* BranchName.Done */ ? fromHist.rest : other, from == 0 /* BranchName.Done */ ? other : fromHist.rest);\n        }\n        let isolate = tr.annotation(isolateHistory);\n        if (isolate == \"full\" || isolate == \"before\")\n            state = state.isolate();\n        if (tr.annotation(Transaction.addToHistory) === false)\n            return !tr.changes.empty ? state.addMapping(tr.changes.desc) : state;\n        let event = HistEvent.fromTransaction(tr);\n        let time = tr.annotation(Transaction.time), userEvent = tr.annotation(Transaction.userEvent);\n        if (event)\n            state = state.addChanges(event, time, userEvent, config.newGroupDelay, config.minDepth);\n        else if (tr.selection)\n            state = state.addSelection(tr.startState.selection, time, userEvent, config.newGroupDelay);\n        if (isolate == \"full\" || isolate == \"after\")\n            state = state.isolate();\n        return state;\n    },\n    toJSON(value) {\n        return { done: value.done.map(e => e.toJSON()), undone: value.undone.map(e => e.toJSON()) };\n    },\n    fromJSON(json) {\n        return new HistoryState(json.done.map(HistEvent.fromJSON), json.undone.map(HistEvent.fromJSON));\n    }\n});\n/**\nCreate a history extension with the given configuration.\n*/\nfunction history(config = {}) {\n    return [\n        historyField_,\n        historyConfig.of(config),\n        EditorView.domEventHandlers({\n            beforeinput(e, view) {\n                let command = e.inputType == \"historyUndo\" ? undo : e.inputType == \"historyRedo\" ? redo : null;\n                if (!command)\n                    return false;\n                e.preventDefault();\n                return command(view);\n            }\n        })\n    ];\n}\n/**\nThe state field used to store the history data. Should probably\nonly be used when you want to\n[serialize](https://codemirror.net/6/docs/ref/#state.EditorState.toJSON) or\n[deserialize](https://codemirror.net/6/docs/ref/#state.EditorState^fromJSON) state objects in a way\nthat preserves history.\n*/\nconst historyField = historyField_;\nfunction cmd(side, selection) {\n    return function ({ state, dispatch }) {\n        if (!selection && state.readOnly)\n            return false;\n        let historyState = state.field(historyField_, false);\n        if (!historyState)\n            return false;\n        let tr = historyState.pop(side, state, selection);\n        if (!tr)\n            return false;\n        dispatch(tr);\n        return true;\n    };\n}\n/**\nUndo a single group of history events. Returns false if no group\nwas available.\n*/\nconst undo = /*@__PURE__*/cmd(0 /* BranchName.Done */, false);\n/**\nRedo a group of history events. Returns false if no group was\navailable.\n*/\nconst redo = /*@__PURE__*/cmd(1 /* BranchName.Undone */, false);\n/**\nUndo a change or selection change.\n*/\nconst undoSelection = /*@__PURE__*/cmd(0 /* BranchName.Done */, true);\n/**\nRedo a change or selection change.\n*/\nconst redoSelection = /*@__PURE__*/cmd(1 /* BranchName.Undone */, true);\nfunction depth(side) {\n    return function (state) {\n        let histState = state.field(historyField_, false);\n        if (!histState)\n            return 0;\n        let branch = side == 0 /* BranchName.Done */ ? histState.done : histState.undone;\n        return branch.length - (branch.length && !branch[0].changes ? 1 : 0);\n    };\n}\n/**\nThe amount of undoable change events available in a given state.\n*/\nconst undoDepth = /*@__PURE__*/depth(0 /* BranchName.Done */);\n/**\nThe amount of redoable change events available in a given state.\n*/\nconst redoDepth = /*@__PURE__*/depth(1 /* BranchName.Undone */);\n// History events store groups of changes or effects that need to be\n// undone/redone together.\nclass HistEvent {\n    constructor(\n    // The changes in this event. Normal events hold at least one\n    // change or effect. But it may be necessary to store selection\n    // events before the first change, in which case a special type of\n    // instance is created which doesn't hold any changes, with\n    // changes == startSelection == undefined\n    changes, \n    // The effects associated with this event\n    effects, \n    // Accumulated mapping (from addToHistory==false) that should be\n    // applied to events below this one.\n    mapped, \n    // The selection before this event\n    startSelection, \n    // Stores selection changes after this event, to be used for\n    // selection undo/redo.\n    selectionsAfter) {\n        this.changes = changes;\n        this.effects = effects;\n        this.mapped = mapped;\n        this.startSelection = startSelection;\n        this.selectionsAfter = selectionsAfter;\n    }\n    setSelAfter(after) {\n        return new HistEvent(this.changes, this.effects, this.mapped, this.startSelection, after);\n    }\n    toJSON() {\n        var _a, _b, _c;\n        return {\n            changes: (_a = this.changes) === null || _a === void 0 ? void 0 : _a.toJSON(),\n            mapped: (_b = this.mapped) === null || _b === void 0 ? void 0 : _b.toJSON(),\n            startSelection: (_c = this.startSelection) === null || _c === void 0 ? void 0 : _c.toJSON(),\n            selectionsAfter: this.selectionsAfter.map(s => s.toJSON())\n        };\n    }\n    static fromJSON(json) {\n        return new HistEvent(json.changes && ChangeSet.fromJSON(json.changes), [], json.mapped && ChangeDesc.fromJSON(json.mapped), json.startSelection && EditorSelection.fromJSON(json.startSelection), json.selectionsAfter.map(EditorSelection.fromJSON));\n    }\n    // This does not check `addToHistory` and such, it assumes the\n    // transaction needs to be converted to an item. Returns null when\n    // there are no changes or effects in the transaction.\n    static fromTransaction(tr, selection) {\n        let effects = none;\n        for (let invert of tr.startState.facet(invertedEffects)) {\n            let result = invert(tr);\n            if (result.length)\n                effects = effects.concat(result);\n        }\n        if (!effects.length && tr.changes.empty)\n            return null;\n        return new HistEvent(tr.changes.invert(tr.startState.doc), effects, undefined, selection || tr.startState.selection, none);\n    }\n    static selection(selections) {\n        return new HistEvent(undefined, none, undefined, undefined, selections);\n    }\n}\nfunction updateBranch(branch, to, maxLen, newEvent) {\n    let start = to + 1 > maxLen + 20 ? to - maxLen - 1 : 0;\n    let newBranch = branch.slice(start, to);\n    newBranch.push(newEvent);\n    return newBranch;\n}\nfunction isAdjacent(a, b) {\n    let ranges = [], isAdjacent = false;\n    a.iterChangedRanges((f, t) => ranges.push(f, t));\n    b.iterChangedRanges((_f, _t, f, t) => {\n        for (let i = 0; i < ranges.length;) {\n            let from = ranges[i++], to = ranges[i++];\n            if (t >= from && f <= to)\n                isAdjacent = true;\n        }\n    });\n    return isAdjacent;\n}\nfunction eqSelectionShape(a, b) {\n    return a.ranges.length == b.ranges.length &&\n        a.ranges.filter((r, i) => r.empty != b.ranges[i].empty).length === 0;\n}\nfunction conc(a, b) {\n    return !a.length ? b : !b.length ? a : a.concat(b);\n}\nconst none = [];\nconst MaxSelectionsPerEvent = 200;\nfunction addSelection(branch, selection) {\n    if (!branch.length) {\n        return [HistEvent.selection([selection])];\n    }\n    else {\n        let lastEvent = branch[branch.length - 1];\n        let sels = lastEvent.selectionsAfter.slice(Math.max(0, lastEvent.selectionsAfter.length - MaxSelectionsPerEvent));\n        if (sels.length && sels[sels.length - 1].eq(selection))\n            return branch;\n        sels.push(selection);\n        return updateBranch(branch, branch.length - 1, 1e9, lastEvent.setSelAfter(sels));\n    }\n}\n// Assumes the top item has one or more selectionAfter values\nfunction popSelection(branch) {\n    let last = branch[branch.length - 1];\n    let newBranch = branch.slice();\n    newBranch[branch.length - 1] = last.setSelAfter(last.selectionsAfter.slice(0, last.selectionsAfter.length - 1));\n    return newBranch;\n}\n// Add a mapping to the top event in the given branch. If this maps\n// away all the changes and effects in that item, drop it and\n// propagate the mapping to the next item.\nfunction addMappingToBranch(branch, mapping) {\n    if (!branch.length)\n        return branch;\n    let length = branch.length, selections = none;\n    while (length) {\n        let event = mapEvent(branch[length - 1], mapping, selections);\n        if (event.changes && !event.changes.empty || event.effects.length) { // Event survived mapping\n            let result = branch.slice(0, length);\n            result[length - 1] = event;\n            return result;\n        }\n        else { // Drop this event, since there's no changes or effects left\n            mapping = event.mapped;\n            length--;\n            selections = event.selectionsAfter;\n        }\n    }\n    return selections.length ? [HistEvent.selection(selections)] : none;\n}\nfunction mapEvent(event, mapping, extraSelections) {\n    let selections = conc(event.selectionsAfter.length ? event.selectionsAfter.map(s => s.map(mapping)) : none, extraSelections);\n    // Change-less events don't store mappings (they are always the last event in a branch)\n    if (!event.changes)\n        return HistEvent.selection(selections);\n    let mappedChanges = event.changes.map(mapping), before = mapping.mapDesc(event.changes, true);\n    let fullMapping = event.mapped ? event.mapped.composeDesc(before) : before;\n    return new HistEvent(mappedChanges, StateEffect.mapEffects(event.effects, mapping), fullMapping, event.startSelection.map(before), selections);\n}\nconst joinableUserEvent = /^(input\\.type|delete)($|\\.)/;\nclass HistoryState {\n    constructor(done, undone, prevTime = 0, prevUserEvent = undefined) {\n        this.done = done;\n        this.undone = undone;\n        this.prevTime = prevTime;\n        this.prevUserEvent = prevUserEvent;\n    }\n    isolate() {\n        return this.prevTime ? new HistoryState(this.done, this.undone) : this;\n    }\n    addChanges(event, time, userEvent, newGroupDelay, maxLen) {\n        let done = this.done, lastEvent = done[done.length - 1];\n        if (lastEvent && lastEvent.changes && !lastEvent.changes.empty && event.changes &&\n            (!userEvent || joinableUserEvent.test(userEvent)) &&\n            ((!lastEvent.selectionsAfter.length &&\n                time - this.prevTime < newGroupDelay &&\n                isAdjacent(lastEvent.changes, event.changes)) ||\n                // For compose (but not compose.start) events, always join with previous event\n                userEvent == \"input.type.compose\")) {\n            done = updateBranch(done, done.length - 1, maxLen, new HistEvent(event.changes.compose(lastEvent.changes), conc(event.effects, lastEvent.effects), lastEvent.mapped, lastEvent.startSelection, none));\n        }\n        else {\n            done = updateBranch(done, done.length, maxLen, event);\n        }\n        return new HistoryState(done, none, time, userEvent);\n    }\n    addSelection(selection, time, userEvent, newGroupDelay) {\n        let last = this.done.length ? this.done[this.done.length - 1].selectionsAfter : none;\n        if (last.length > 0 &&\n            time - this.prevTime < newGroupDelay &&\n            userEvent == this.prevUserEvent && userEvent && /^select($|\\.)/.test(userEvent) &&\n            eqSelectionShape(last[last.length - 1], selection))\n            return this;\n        return new HistoryState(addSelection(this.done, selection), this.undone, time, userEvent);\n    }\n    addMapping(mapping) {\n        return new HistoryState(addMappingToBranch(this.done, mapping), addMappingToBranch(this.undone, mapping), this.prevTime, this.prevUserEvent);\n    }\n    pop(side, state, selection) {\n        let branch = side == 0 /* BranchName.Done */ ? this.done : this.undone;\n        if (branch.length == 0)\n            return null;\n        let event = branch[branch.length - 1];\n        if (selection && event.selectionsAfter.length) {\n            return state.update({\n                selection: event.selectionsAfter[event.selectionsAfter.length - 1],\n                annotations: fromHistory.of({ side, rest: popSelection(branch) }),\n                userEvent: side == 0 /* BranchName.Done */ ? \"select.undo\" : \"select.redo\",\n                scrollIntoView: true\n            });\n        }\n        else if (!event.changes) {\n            return null;\n        }\n        else {\n            let rest = branch.length == 1 ? none : branch.slice(0, branch.length - 1);\n            if (event.mapped)\n                rest = addMappingToBranch(rest, event.mapped);\n            return state.update({\n                changes: event.changes,\n                selection: event.startSelection,\n                effects: event.effects,\n                annotations: fromHistory.of({ side, rest }),\n                filter: false,\n                userEvent: side == 0 /* BranchName.Done */ ? \"undo\" : \"redo\",\n                scrollIntoView: true\n            });\n        }\n    }\n}\nHistoryState.empty = /*@__PURE__*/new HistoryState(none, none);\n/**\nDefault key bindings for the undo history.\n\n- Mod-z: [`undo`](https://codemirror.net/6/docs/ref/#commands.undo).\n- Mod-y (Mod-Shift-z on macOS) + Ctrl-Shift-z on Linux: [`redo`](https://codemirror.net/6/docs/ref/#commands.redo).\n- Mod-u: [`undoSelection`](https://codemirror.net/6/docs/ref/#commands.undoSelection).\n- Alt-u (Mod-Shift-u on macOS): [`redoSelection`](https://codemirror.net/6/docs/ref/#commands.redoSelection).\n*/\nconst historyKeymap = [\n    { key: \"Mod-z\", run: undo, preventDefault: true },\n    { key: \"Mod-y\", mac: \"Mod-Shift-z\", run: redo, preventDefault: true },\n    { linux: \"Ctrl-Shift-z\", run: redo, preventDefault: true },\n    { key: \"Mod-u\", run: undoSelection, preventDefault: true },\n    { key: \"Alt-u\", mac: \"Mod-Shift-u\", run: redoSelection, preventDefault: true }\n];\n\nfunction updateSel(sel, by) {\n    return EditorSelection.create(sel.ranges.map(by), sel.mainIndex);\n}\nfunction setSel(state, selection) {\n    return state.update({ selection, scrollIntoView: true, userEvent: \"select\" });\n}\nfunction moveSel({ state, dispatch }, how) {\n    let selection = updateSel(state.selection, how);\n    if (selection.eq(state.selection))\n        return false;\n    dispatch(setSel(state, selection));\n    return true;\n}\nfunction rangeEnd(range, forward) {\n    return EditorSelection.cursor(forward ? range.to : range.from);\n}\nfunction cursorByChar(view, forward) {\n    return moveSel(view, range => range.empty ? view.moveByChar(range, forward) : rangeEnd(range, forward));\n}\nfunction ltrAtCursor(view) {\n    return view.textDirectionAt(view.state.selection.main.head) == Direction.LTR;\n}\n/**\nMove the selection one character to the left (which is backward in\nleft-to-right text, forward in right-to-left text).\n*/\nconst cursorCharLeft = view => cursorByChar(view, !ltrAtCursor(view));\n/**\nMove the selection one character to the right.\n*/\nconst cursorCharRight = view => cursorByChar(view, ltrAtCursor(view));\n/**\nMove the selection one character forward.\n*/\nconst cursorCharForward = view => cursorByChar(view, true);\n/**\nMove the selection one character backward.\n*/\nconst cursorCharBackward = view => cursorByChar(view, false);\nfunction cursorByGroup(view, forward) {\n    return moveSel(view, range => range.empty ? view.moveByGroup(range, forward) : rangeEnd(range, forward));\n}\n/**\nMove the selection to the left across one group of word or\nnon-word (but also non-space) characters.\n*/\nconst cursorGroupLeft = view => cursorByGroup(view, !ltrAtCursor(view));\n/**\nMove the selection one group to the right.\n*/\nconst cursorGroupRight = view => cursorByGroup(view, ltrAtCursor(view));\n/**\nMove the selection one group forward.\n*/\nconst cursorGroupForward = view => cursorByGroup(view, true);\n/**\nMove the selection one group backward.\n*/\nconst cursorGroupBackward = view => cursorByGroup(view, false);\nfunction moveBySubword(view, range, forward) {\n    let categorize = view.state.charCategorizer(range.from);\n    return view.moveByChar(range, forward, start => {\n        let cat = CharCategory.Space, pos = range.from;\n        let done = false, sawUpper = false, sawLower = false;\n        let step = (next) => {\n            if (done)\n                return false;\n            pos += forward ? next.length : -next.length;\n            let nextCat = categorize(next), ahead;\n            if (cat == CharCategory.Space)\n                cat = nextCat;\n            if (cat != nextCat)\n                return false;\n            if (cat == CharCategory.Word) {\n                if (next.toLowerCase() == next) {\n                    if (!forward && sawUpper)\n                        return false;\n                    sawLower = true;\n                }\n                else if (sawLower) {\n                    if (forward)\n                        return false;\n                    done = true;\n                }\n                else {\n                    if (sawUpper && forward && categorize(ahead = view.state.sliceDoc(pos, pos + 1)) == CharCategory.Word &&\n                        ahead.toLowerCase() == ahead)\n                        return false;\n                    sawUpper = true;\n                }\n            }\n            return true;\n        };\n        step(start);\n        return step;\n    });\n}\nfunction cursorBySubword(view, forward) {\n    return moveSel(view, range => range.empty ? moveBySubword(view, range, forward) : rangeEnd(range, forward));\n}\n/**\nMove the selection one group or camel-case subword forward.\n*/\nconst cursorSubwordForward = view => cursorBySubword(view, true);\n/**\nMove the selection one group or camel-case subword backward.\n*/\nconst cursorSubwordBackward = view => cursorBySubword(view, false);\nfunction interestingNode(state, node, bracketProp) {\n    if (node.type.prop(bracketProp))\n        return true;\n    let len = node.to - node.from;\n    return len && (len > 2 || /[^\\s,.;:]/.test(state.sliceDoc(node.from, node.to))) || node.firstChild;\n}\nfunction moveBySyntax(state, start, forward) {\n    let pos = syntaxTree(state).resolveInner(start.head);\n    let bracketProp = forward ? NodeProp.closedBy : NodeProp.openedBy;\n    // Scan forward through child nodes to see if there's an interesting\n    // node ahead.\n    for (let at = start.head;;) {\n        let next = forward ? pos.childAfter(at) : pos.childBefore(at);\n        if (!next)\n            break;\n        if (interestingNode(state, next, bracketProp))\n            pos = next;\n        else\n            at = forward ? next.to : next.from;\n    }\n    let bracket = pos.type.prop(bracketProp), match, newPos;\n    if (bracket && (match = forward ? matchBrackets(state, pos.from, 1) : matchBrackets(state, pos.to, -1)) && match.matched)\n        newPos = forward ? match.end.to : match.end.from;\n    else\n        newPos = forward ? pos.to : pos.from;\n    return EditorSelection.cursor(newPos, forward ? -1 : 1);\n}\n/**\nMove the cursor over the next syntactic element to the left.\n*/\nconst cursorSyntaxLeft = view => moveSel(view, range => moveBySyntax(view.state, range, !ltrAtCursor(view)));\n/**\nMove the cursor over the next syntactic element to the right.\n*/\nconst cursorSyntaxRight = view => moveSel(view, range => moveBySyntax(view.state, range, ltrAtCursor(view)));\nfunction cursorByLine(view, forward) {\n    return moveSel(view, range => {\n        if (!range.empty)\n            return rangeEnd(range, forward);\n        let moved = view.moveVertically(range, forward);\n        return moved.head != range.head ? moved : view.moveToLineBoundary(range, forward);\n    });\n}\n/**\nMove the selection one line up.\n*/\nconst cursorLineUp = view => cursorByLine(view, false);\n/**\nMove the selection one line down.\n*/\nconst cursorLineDown = view => cursorByLine(view, true);\nfunction pageHeight(view) {\n    return Math.max(view.defaultLineHeight, Math.min(view.dom.clientHeight, innerHeight) - 5);\n}\nfunction cursorByPage(view, forward) {\n    let { state } = view, selection = updateSel(state.selection, range => {\n        return range.empty ? view.moveVertically(range, forward, pageHeight(view)) : rangeEnd(range, forward);\n    });\n    if (selection.eq(state.selection))\n        return false;\n    let startPos = view.coordsAtPos(state.selection.main.head);\n    let scrollRect = view.scrollDOM.getBoundingClientRect();\n    let effect;\n    if (startPos && startPos.top > scrollRect.top && startPos.bottom < scrollRect.bottom &&\n        startPos.top - scrollRect.top <= view.scrollDOM.scrollHeight - view.scrollDOM.scrollTop - view.scrollDOM.clientHeight)\n        effect = EditorView.scrollIntoView(selection.main.head, { y: \"start\", yMargin: startPos.top - scrollRect.top });\n    view.dispatch(setSel(state, selection), { effects: effect });\n    return true;\n}\n/**\nMove the selection one page up.\n*/\nconst cursorPageUp = view => cursorByPage(view, false);\n/**\nMove the selection one page down.\n*/\nconst cursorPageDown = view => cursorByPage(view, true);\nfunction moveByLineBoundary(view, start, forward) {\n    let line = view.lineBlockAt(start.head), moved = view.moveToLineBoundary(start, forward);\n    if (moved.head == start.head && moved.head != (forward ? line.to : line.from))\n        moved = view.moveToLineBoundary(start, forward, false);\n    if (!forward && moved.head == line.from && line.length) {\n        let space = /^\\s*/.exec(view.state.sliceDoc(line.from, Math.min(line.from + 100, line.to)))[0].length;\n        if (space && start.head != line.from + space)\n            moved = EditorSelection.cursor(line.from + space);\n    }\n    return moved;\n}\n/**\nMove the selection to the next line wrap point, or to the end of\nthe line if there isn't one left on this line.\n*/\nconst cursorLineBoundaryForward = view => moveSel(view, range => moveByLineBoundary(view, range, true));\n/**\nMove the selection to previous line wrap point, or failing that to\nthe start of the line. If the line is indented, and the cursor\nisn't already at the end of the indentation, this will move to the\nend of the indentation instead of the start of the line.\n*/\nconst cursorLineBoundaryBackward = view => moveSel(view, range => moveByLineBoundary(view, range, false));\n/**\nMove the selection one line wrap point to the left.\n*/\nconst cursorLineBoundaryLeft = view => moveSel(view, range => moveByLineBoundary(view, range, !ltrAtCursor(view)));\n/**\nMove the selection one line wrap point to the right.\n*/\nconst cursorLineBoundaryRight = view => moveSel(view, range => moveByLineBoundary(view, range, ltrAtCursor(view)));\n/**\nMove the selection to the start of the line.\n*/\nconst cursorLineStart = view => moveSel(view, range => EditorSelection.cursor(view.lineBlockAt(range.head).from, 1));\n/**\nMove the selection to the end of the line.\n*/\nconst cursorLineEnd = view => moveSel(view, range => EditorSelection.cursor(view.lineBlockAt(range.head).to, -1));\nfunction toMatchingBracket(state, dispatch, extend) {\n    let found = false, selection = updateSel(state.selection, range => {\n        let matching = matchBrackets(state, range.head, -1)\n            || matchBrackets(state, range.head, 1)\n            || (range.head > 0 && matchBrackets(state, range.head - 1, 1))\n            || (range.head < state.doc.length && matchBrackets(state, range.head + 1, -1));\n        if (!matching || !matching.end)\n            return range;\n        found = true;\n        let head = matching.start.from == range.head ? matching.end.to : matching.end.from;\n        return extend ? EditorSelection.range(range.anchor, head) : EditorSelection.cursor(head);\n    });\n    if (!found)\n        return false;\n    dispatch(setSel(state, selection));\n    return true;\n}\n/**\nMove the selection to the bracket matching the one it is currently\non, if any.\n*/\nconst cursorMatchingBracket = ({ state, dispatch }) => toMatchingBracket(state, dispatch, false);\n/**\nExtend the selection to the bracket matching the one the selection\nhead is currently on, if any.\n*/\nconst selectMatchingBracket = ({ state, dispatch }) => toMatchingBracket(state, dispatch, true);\nfunction extendSel(view, how) {\n    let selection = updateSel(view.state.selection, range => {\n        let head = how(range);\n        return EditorSelection.range(range.anchor, head.head, head.goalColumn);\n    });\n    if (selection.eq(view.state.selection))\n        return false;\n    view.dispatch(setSel(view.state, selection));\n    return true;\n}\nfunction selectByChar(view, forward) {\n    return extendSel(view, range => view.moveByChar(range, forward));\n}\n/**\nMove the selection head one character to the left, while leaving\nthe anchor in place.\n*/\nconst selectCharLeft = view => selectByChar(view, !ltrAtCursor(view));\n/**\nMove the selection head one character to the right.\n*/\nconst selectCharRight = view => selectByChar(view, ltrAtCursor(view));\n/**\nMove the selection head one character forward.\n*/\nconst selectCharForward = view => selectByChar(view, true);\n/**\nMove the selection head one character backward.\n*/\nconst selectCharBackward = view => selectByChar(view, false);\nfunction selectByGroup(view, forward) {\n    return extendSel(view, range => view.moveByGroup(range, forward));\n}\n/**\nMove the selection head one [group](https://codemirror.net/6/docs/ref/#commands.cursorGroupLeft) to\nthe left.\n*/\nconst selectGroupLeft = view => selectByGroup(view, !ltrAtCursor(view));\n/**\nMove the selection head one group to the right.\n*/\nconst selectGroupRight = view => selectByGroup(view, ltrAtCursor(view));\n/**\nMove the selection head one group forward.\n*/\nconst selectGroupForward = view => selectByGroup(view, true);\n/**\nMove the selection head one group backward.\n*/\nconst selectGroupBackward = view => selectByGroup(view, false);\nfunction selectBySubword(view, forward) {\n    return extendSel(view, range => moveBySubword(view, range, forward));\n}\n/**\nMove the selection head one group or camel-case subword forward.\n*/\nconst selectSubwordForward = view => selectBySubword(view, true);\n/**\nMove the selection head one group or subword backward.\n*/\nconst selectSubwordBackward = view => selectBySubword(view, false);\n/**\nMove the selection head over the next syntactic element to the left.\n*/\nconst selectSyntaxLeft = view => extendSel(view, range => moveBySyntax(view.state, range, !ltrAtCursor(view)));\n/**\nMove the selection head over the next syntactic element to the right.\n*/\nconst selectSyntaxRight = view => extendSel(view, range => moveBySyntax(view.state, range, ltrAtCursor(view)));\nfunction selectByLine(view, forward) {\n    return extendSel(view, range => view.moveVertically(range, forward));\n}\n/**\nMove the selection head one line up.\n*/\nconst selectLineUp = view => selectByLine(view, false);\n/**\nMove the selection head one line down.\n*/\nconst selectLineDown = view => selectByLine(view, true);\nfunction selectByPage(view, forward) {\n    return extendSel(view, range => view.moveVertically(range, forward, pageHeight(view)));\n}\n/**\nMove the selection head one page up.\n*/\nconst selectPageUp = view => selectByPage(view, false);\n/**\nMove the selection head one page down.\n*/\nconst selectPageDown = view => selectByPage(view, true);\n/**\nMove the selection head to the next line boundary.\n*/\nconst selectLineBoundaryForward = view => extendSel(view, range => moveByLineBoundary(view, range, true));\n/**\nMove the selection head to the previous line boundary.\n*/\nconst selectLineBoundaryBackward = view => extendSel(view, range => moveByLineBoundary(view, range, false));\n/**\nMove the selection head one line boundary to the left.\n*/\nconst selectLineBoundaryLeft = view => extendSel(view, range => moveByLineBoundary(view, range, !ltrAtCursor(view)));\n/**\nMove the selection head one line boundary to the right.\n*/\nconst selectLineBoundaryRight = view => extendSel(view, range => moveByLineBoundary(view, range, ltrAtCursor(view)));\n/**\nMove the selection head to the start of the line.\n*/\nconst selectLineStart = view => extendSel(view, range => EditorSelection.cursor(view.lineBlockAt(range.head).from));\n/**\nMove the selection head to the end of the line.\n*/\nconst selectLineEnd = view => extendSel(view, range => EditorSelection.cursor(view.lineBlockAt(range.head).to));\n/**\nMove the selection to the start of the document.\n*/\nconst cursorDocStart = ({ state, dispatch }) => {\n    dispatch(setSel(state, { anchor: 0 }));\n    return true;\n};\n/**\nMove the selection to the end of the document.\n*/\nconst cursorDocEnd = ({ state, dispatch }) => {\n    dispatch(setSel(state, { anchor: state.doc.length }));\n    return true;\n};\n/**\nMove the selection head to the start of the document.\n*/\nconst selectDocStart = ({ state, dispatch }) => {\n    dispatch(setSel(state, { anchor: state.selection.main.anchor, head: 0 }));\n    return true;\n};\n/**\nMove the selection head to the end of the document.\n*/\nconst selectDocEnd = ({ state, dispatch }) => {\n    dispatch(setSel(state, { anchor: state.selection.main.anchor, head: state.doc.length }));\n    return true;\n};\n/**\nSelect the entire document.\n*/\nconst selectAll = ({ state, dispatch }) => {\n    dispatch(state.update({ selection: { anchor: 0, head: state.doc.length }, userEvent: \"select\" }));\n    return true;\n};\n/**\nExpand the selection to cover entire lines.\n*/\nconst selectLine = ({ state, dispatch }) => {\n    let ranges = selectedLineBlocks(state).map(({ from, to }) => EditorSelection.range(from, Math.min(to + 1, state.doc.length)));\n    dispatch(state.update({ selection: EditorSelection.create(ranges), userEvent: \"select\" }));\n    return true;\n};\n/**\nSelect the next syntactic construct that is larger than the\nselection. Note that this will only work insofar as the language\n[provider](https://codemirror.net/6/docs/ref/#language.language) you use builds up a full\nsyntax tree.\n*/\nconst selectParentSyntax = ({ state, dispatch }) => {\n    let selection = updateSel(state.selection, range => {\n        var _a;\n        let context = syntaxTree(state).resolveInner(range.head, 1);\n        while (!((context.from < range.from && context.to >= range.to) ||\n            (context.to > range.to && context.from <= range.from) ||\n            !((_a = context.parent) === null || _a === void 0 ? void 0 : _a.parent)))\n            context = context.parent;\n        return EditorSelection.range(context.to, context.from);\n    });\n    dispatch(setSel(state, selection));\n    return true;\n};\n/**\nSimplify the current selection. When multiple ranges are selected,\nreduce it to its main range. Otherwise, if the selection is\nnon-empty, convert it to a cursor selection.\n*/\nconst simplifySelection = ({ state, dispatch }) => {\n    let cur = state.selection, selection = null;\n    if (cur.ranges.length > 1)\n        selection = EditorSelection.create([cur.main]);\n    else if (!cur.main.empty)\n        selection = EditorSelection.create([EditorSelection.cursor(cur.main.head)]);\n    if (!selection)\n        return false;\n    dispatch(setSel(state, selection));\n    return true;\n};\nfunction deleteBy(target, by) {\n    if (target.state.readOnly)\n        return false;\n    let event = \"delete.selection\", { state } = target;\n    let changes = state.changeByRange(range => {\n        let { from, to } = range;\n        if (from == to) {\n            let towards = by(from);\n            if (towards < from) {\n                event = \"delete.backward\";\n                towards = skipAtomic(target, towards, false);\n            }\n            else if (towards > from) {\n                event = \"delete.forward\";\n                towards = skipAtomic(target, towards, true);\n            }\n            from = Math.min(from, towards);\n            to = Math.max(to, towards);\n        }\n        else {\n            from = skipAtomic(target, from, false);\n            to = skipAtomic(target, to, true);\n        }\n        return from == to ? { range } : { changes: { from, to }, range: EditorSelection.cursor(from) };\n    });\n    if (changes.changes.empty)\n        return false;\n    target.dispatch(state.update(changes, {\n        scrollIntoView: true,\n        userEvent: event,\n        effects: event == \"delete.selection\" ? EditorView.announce.of(state.phrase(\"Selection deleted\")) : undefined\n    }));\n    return true;\n}\nfunction skipAtomic(target, pos, forward) {\n    if (target instanceof EditorView)\n        for (let ranges of target.state.facet(EditorView.atomicRanges).map(f => f(target)))\n            ranges.between(pos, pos, (from, to) => {\n                if (from < pos && to > pos)\n                    pos = forward ? to : from;\n            });\n    return pos;\n}\nconst deleteByChar = (target, forward) => deleteBy(target, pos => {\n    let { state } = target, line = state.doc.lineAt(pos), before, targetPos;\n    if (!forward && pos > line.from && pos < line.from + 200 &&\n        !/[^ \\t]/.test(before = line.text.slice(0, pos - line.from))) {\n        if (before[before.length - 1] == \"\\t\")\n            return pos - 1;\n        let col = countColumn(before, state.tabSize), drop = col % getIndentUnit(state) || getIndentUnit(state);\n        for (let i = 0; i < drop && before[before.length - 1 - i] == \" \"; i++)\n            pos--;\n        targetPos = pos;\n    }\n    else {\n        targetPos = findClusterBreak(line.text, pos - line.from, forward, forward) + line.from;\n        if (targetPos == pos && line.number != (forward ? state.doc.lines : 1))\n            targetPos += forward ? 1 : -1;\n    }\n    return targetPos;\n});\n/**\nDelete the selection, or, for cursor selections, the character\nbefore the cursor.\n*/\nconst deleteCharBackward = view => deleteByChar(view, false);\n/**\nDelete the selection or the character after the cursor.\n*/\nconst deleteCharForward = view => deleteByChar(view, true);\nconst deleteByGroup = (target, forward) => deleteBy(target, start => {\n    let pos = start, { state } = target, line = state.doc.lineAt(pos);\n    let categorize = state.charCategorizer(pos);\n    for (let cat = null;;) {\n        if (pos == (forward ? line.to : line.from)) {\n            if (pos == start && line.number != (forward ? state.doc.lines : 1))\n                pos += forward ? 1 : -1;\n            break;\n        }\n        let next = findClusterBreak(line.text, pos - line.from, forward) + line.from;\n        let nextChar = line.text.slice(Math.min(pos, next) - line.from, Math.max(pos, next) - line.from);\n        let nextCat = categorize(nextChar);\n        if (cat != null && nextCat != cat)\n            break;\n        if (nextChar != \" \" || pos != start)\n            cat = nextCat;\n        pos = next;\n    }\n    return pos;\n});\n/**\nDelete the selection or backward until the end of the next\n[group](https://codemirror.net/6/docs/ref/#view.EditorView.moveByGroup), only skipping groups of\nwhitespace when they consist of a single space.\n*/\nconst deleteGroupBackward = target => deleteByGroup(target, false);\n/**\nDelete the selection or forward until the end of the next group.\n*/\nconst deleteGroupForward = target => deleteByGroup(target, true);\n/**\nDelete the selection, or, if it is a cursor selection, delete to\nthe end of the line. If the cursor is directly at the end of the\nline, delete the line break after it.\n*/\nconst deleteToLineEnd = view => deleteBy(view, pos => {\n    let lineEnd = view.lineBlockAt(pos).to;\n    return pos < lineEnd ? lineEnd : Math.min(view.state.doc.length, pos + 1);\n});\n/**\nDelete the selection, or, if it is a cursor selection, delete to\nthe start of the line. If the cursor is directly at the start of the\nline, delete the line break before it.\n*/\nconst deleteToLineStart = view => deleteBy(view, pos => {\n    let lineStart = view.lineBlockAt(pos).from;\n    return pos > lineStart ? lineStart : Math.max(0, pos - 1);\n});\n/**\nDelete all whitespace directly before a line end from the\ndocument.\n*/\nconst deleteTrailingWhitespace = ({ state, dispatch }) => {\n    if (state.readOnly)\n        return false;\n    let changes = [];\n    for (let pos = 0, prev = \"\", iter = state.doc.iter();;) {\n        iter.next();\n        if (iter.lineBreak || iter.done) {\n            let trailing = prev.search(/\\s+$/);\n            if (trailing > -1)\n                changes.push({ from: pos - (prev.length - trailing), to: pos });\n            if (iter.done)\n                break;\n            prev = \"\";\n        }\n        else {\n            prev = iter.value;\n        }\n        pos += iter.value.length;\n    }\n    if (!changes.length)\n        return false;\n    dispatch(state.update({ changes, userEvent: \"delete\" }));\n    return true;\n};\n/**\nReplace each selection range with a line break, leaving the cursor\non the line before the break.\n*/\nconst splitLine = ({ state, dispatch }) => {\n    if (state.readOnly)\n        return false;\n    let changes = state.changeByRange(range => {\n        return { changes: { from: range.from, to: range.to, insert: Text.of([\"\", \"\"]) },\n            range: EditorSelection.cursor(range.from) };\n    });\n    dispatch(state.update(changes, { scrollIntoView: true, userEvent: \"input\" }));\n    return true;\n};\n/**\nFlip the characters before and after the cursor(s).\n*/\nconst transposeChars = ({ state, dispatch }) => {\n    if (state.readOnly)\n        return false;\n    let changes = state.changeByRange(range => {\n        if (!range.empty || range.from == 0 || range.from == state.doc.length)\n            return { range };\n        let pos = range.from, line = state.doc.lineAt(pos);\n        let from = pos == line.from ? pos - 1 : findClusterBreak(line.text, pos - line.from, false) + line.from;\n        let to = pos == line.to ? pos + 1 : findClusterBreak(line.text, pos - line.from, true) + line.from;\n        return { changes: { from, to, insert: state.doc.slice(pos, to).append(state.doc.slice(from, pos)) },\n            range: EditorSelection.cursor(to) };\n    });\n    if (changes.changes.empty)\n        return false;\n    dispatch(state.update(changes, { scrollIntoView: true, userEvent: \"move.character\" }));\n    return true;\n};\nfunction selectedLineBlocks(state) {\n    let blocks = [], upto = -1;\n    for (let range of state.selection.ranges) {\n        let startLine = state.doc.lineAt(range.from), endLine = state.doc.lineAt(range.to);\n        if (!range.empty && range.to == endLine.from)\n            endLine = state.doc.lineAt(range.to - 1);\n        if (upto >= startLine.number) {\n            let prev = blocks[blocks.length - 1];\n            prev.to = endLine.to;\n            prev.ranges.push(range);\n        }\n        else {\n            blocks.push({ from: startLine.from, to: endLine.to, ranges: [range] });\n        }\n        upto = endLine.number + 1;\n    }\n    return blocks;\n}\nfunction moveLine(state, dispatch, forward) {\n    if (state.readOnly)\n        return false;\n    let changes = [], ranges = [];\n    for (let block of selectedLineBlocks(state)) {\n        if (forward ? block.to == state.doc.length : block.from == 0)\n            continue;\n        let nextLine = state.doc.lineAt(forward ? block.to + 1 : block.from - 1);\n        let size = nextLine.length + 1;\n        if (forward) {\n            changes.push({ from: block.to, to: nextLine.to }, { from: block.from, insert: nextLine.text + state.lineBreak });\n            for (let r of block.ranges)\n                ranges.push(EditorSelection.range(Math.min(state.doc.length, r.anchor + size), Math.min(state.doc.length, r.head + size)));\n        }\n        else {\n            changes.push({ from: nextLine.from, to: block.from }, { from: block.to, insert: state.lineBreak + nextLine.text });\n            for (let r of block.ranges)\n                ranges.push(EditorSelection.range(r.anchor - size, r.head - size));\n        }\n    }\n    if (!changes.length)\n        return false;\n    dispatch(state.update({\n        changes,\n        scrollIntoView: true,\n        selection: EditorSelection.create(ranges, state.selection.mainIndex),\n        userEvent: \"move.line\"\n    }));\n    return true;\n}\n/**\nMove the selected lines up one line.\n*/\nconst moveLineUp = ({ state, dispatch }) => moveLine(state, dispatch, false);\n/**\nMove the selected lines down one line.\n*/\nconst moveLineDown = ({ state, dispatch }) => moveLine(state, dispatch, true);\nfunction copyLine(state, dispatch, forward) {\n    if (state.readOnly)\n        return false;\n    let changes = [];\n    for (let block of selectedLineBlocks(state)) {\n        if (forward)\n            changes.push({ from: block.from, insert: state.doc.slice(block.from, block.to) + state.lineBreak });\n        else\n            changes.push({ from: block.to, insert: state.lineBreak + state.doc.slice(block.from, block.to) });\n    }\n    dispatch(state.update({ changes, scrollIntoView: true, userEvent: \"input.copyline\" }));\n    return true;\n}\n/**\nCreate a copy of the selected lines. Keep the selection in the top copy.\n*/\nconst copyLineUp = ({ state, dispatch }) => copyLine(state, dispatch, false);\n/**\nCreate a copy of the selected lines. Keep the selection in the bottom copy.\n*/\nconst copyLineDown = ({ state, dispatch }) => copyLine(state, dispatch, true);\n/**\nDelete selected lines.\n*/\nconst deleteLine = view => {\n    if (view.state.readOnly)\n        return false;\n    let { state } = view, changes = state.changes(selectedLineBlocks(state).map(({ from, to }) => {\n        if (from > 0)\n            from--;\n        else if (to < state.doc.length)\n            to++;\n        return { from, to };\n    }));\n    let selection = updateSel(state.selection, range => view.moveVertically(range, true)).map(changes);\n    view.dispatch({ changes, selection, scrollIntoView: true, userEvent: \"delete.line\" });\n    return true;\n};\n/**\nReplace the selection with a newline.\n*/\nconst insertNewline = ({ state, dispatch }) => {\n    dispatch(state.update(state.replaceSelection(state.lineBreak), { scrollIntoView: true, userEvent: \"input\" }));\n    return true;\n};\nfunction isBetweenBrackets(state, pos) {\n    if (/\\(\\)|\\[\\]|\\{\\}/.test(state.sliceDoc(pos - 1, pos + 1)))\n        return { from: pos, to: pos };\n    let context = syntaxTree(state).resolveInner(pos);\n    let before = context.childBefore(pos), after = context.childAfter(pos), closedBy;\n    if (before && after && before.to <= pos && after.from >= pos &&\n        (closedBy = before.type.prop(NodeProp.closedBy)) && closedBy.indexOf(after.name) > -1 &&\n        state.doc.lineAt(before.to).from == state.doc.lineAt(after.from).from)\n        return { from: before.to, to: after.from };\n    return null;\n}\n/**\nReplace the selection with a newline and indent the newly created\nline(s). If the current line consists only of whitespace, this\nwill also delete that whitespace. When the cursor is between\nmatching brackets, an additional newline will be inserted after\nthe cursor.\n*/\nconst insertNewlineAndIndent = /*@__PURE__*/newlineAndIndent(false);\n/**\nCreate a blank, indented line below the current line.\n*/\nconst insertBlankLine = /*@__PURE__*/newlineAndIndent(true);\nfunction newlineAndIndent(atEof) {\n    return ({ state, dispatch }) => {\n        if (state.readOnly)\n            return false;\n        let changes = state.changeByRange(range => {\n            let { from, to } = range, line = state.doc.lineAt(from);\n            let explode = !atEof && from == to && isBetweenBrackets(state, from);\n            if (atEof)\n                from = to = (to <= line.to ? line : state.doc.lineAt(to)).to;\n            let cx = new IndentContext(state, { simulateBreak: from, simulateDoubleBreak: !!explode });\n            let indent = getIndentation(cx, from);\n            if (indent == null)\n                indent = /^\\s*/.exec(state.doc.lineAt(from).text)[0].length;\n            while (to < line.to && /\\s/.test(line.text[to - line.from]))\n                to++;\n            if (explode)\n                ({ from, to } = explode);\n            else if (from > line.from && from < line.from + 100 && !/\\S/.test(line.text.slice(0, from)))\n                from = line.from;\n            let insert = [\"\", indentString(state, indent)];\n            if (explode)\n                insert.push(indentString(state, cx.lineIndent(line.from, -1)));\n            return { changes: { from, to, insert: Text.of(insert) },\n                range: EditorSelection.cursor(from + 1 + insert[1].length) };\n        });\n        dispatch(state.update(changes, { scrollIntoView: true, userEvent: \"input\" }));\n        return true;\n    };\n}\nfunction changeBySelectedLine(state, f) {\n    let atLine = -1;\n    return state.changeByRange(range => {\n        let changes = [];\n        for (let pos = range.from; pos <= range.to;) {\n            let line = state.doc.lineAt(pos);\n            if (line.number > atLine && (range.empty || range.to > line.from)) {\n                f(line, changes, range);\n                atLine = line.number;\n            }\n            pos = line.to + 1;\n        }\n        let changeSet = state.changes(changes);\n        return { changes,\n            range: EditorSelection.range(changeSet.mapPos(range.anchor, 1), changeSet.mapPos(range.head, 1)) };\n    });\n}\n/**\nAuto-indent the selected lines. This uses the [indentation service\nfacet](https://codemirror.net/6/docs/ref/#language.indentService) as source for auto-indent\ninformation.\n*/\nconst indentSelection = ({ state, dispatch }) => {\n    if (state.readOnly)\n        return false;\n    let updated = Object.create(null);\n    let context = new IndentContext(state, { overrideIndentation: start => {\n            let found = updated[start];\n            return found == null ? -1 : found;\n        } });\n    let changes = changeBySelectedLine(state, (line, changes, range) => {\n        let indent = getIndentation(context, line.from);\n        if (indent == null)\n            return;\n        if (!/\\S/.test(line.text))\n            indent = 0;\n        let cur = /^\\s*/.exec(line.text)[0];\n        let norm = indentString(state, indent);\n        if (cur != norm || range.from < line.from + cur.length) {\n            updated[line.from] = indent;\n            changes.push({ from: line.from, to: line.from + cur.length, insert: norm });\n        }\n    });\n    if (!changes.changes.empty)\n        dispatch(state.update(changes, { userEvent: \"indent\" }));\n    return true;\n};\n/**\nAdd a [unit](https://codemirror.net/6/docs/ref/#language.indentUnit) of indentation to all selected\nlines.\n*/\nconst indentMore = ({ state, dispatch }) => {\n    if (state.readOnly)\n        return false;\n    dispatch(state.update(changeBySelectedLine(state, (line, changes) => {\n        changes.push({ from: line.from, insert: state.facet(indentUnit) });\n    }), { userEvent: \"input.indent\" }));\n    return true;\n};\n/**\nRemove a [unit](https://codemirror.net/6/docs/ref/#language.indentUnit) of indentation from all\nselected lines.\n*/\nconst indentLess = ({ state, dispatch }) => {\n    if (state.readOnly)\n        return false;\n    dispatch(state.update(changeBySelectedLine(state, (line, changes) => {\n        let space = /^\\s*/.exec(line.text)[0];\n        if (!space)\n            return;\n        let col = countColumn(space, state.tabSize), keep = 0;\n        let insert = indentString(state, Math.max(0, col - getIndentUnit(state)));\n        while (keep < space.length && keep < insert.length && space.charCodeAt(keep) == insert.charCodeAt(keep))\n            keep++;\n        changes.push({ from: line.from + keep, to: line.from + space.length, insert: insert.slice(keep) });\n    }), { userEvent: \"delete.dedent\" }));\n    return true;\n};\n/**\nInsert a tab character at the cursor or, if something is selected,\nuse [`indentMore`](https://codemirror.net/6/docs/ref/#commands.indentMore) to indent the entire\nselection.\n*/\nconst insertTab = ({ state, dispatch }) => {\n    if (state.selection.ranges.some(r => !r.empty))\n        return indentMore({ state, dispatch });\n    dispatch(state.update(state.replaceSelection(\"\\t\"), { scrollIntoView: true, userEvent: \"input\" }));\n    return true;\n};\n/**\nArray of key bindings containing the Emacs-style bindings that are\navailable on macOS by default.\n\n - Ctrl-b: [`cursorCharLeft`](https://codemirror.net/6/docs/ref/#commands.cursorCharLeft) ([`selectCharLeft`](https://codemirror.net/6/docs/ref/#commands.selectCharLeft) with Shift)\n - Ctrl-f: [`cursorCharRight`](https://codemirror.net/6/docs/ref/#commands.cursorCharRight) ([`selectCharRight`](https://codemirror.net/6/docs/ref/#commands.selectCharRight) with Shift)\n - Ctrl-p: [`cursorLineUp`](https://codemirror.net/6/docs/ref/#commands.cursorLineUp) ([`selectLineUp`](https://codemirror.net/6/docs/ref/#commands.selectLineUp) with Shift)\n - Ctrl-n: [`cursorLineDown`](https://codemirror.net/6/docs/ref/#commands.cursorLineDown) ([`selectLineDown`](https://codemirror.net/6/docs/ref/#commands.selectLineDown) with Shift)\n - Ctrl-a: [`cursorLineStart`](https://codemirror.net/6/docs/ref/#commands.cursorLineStart) ([`selectLineStart`](https://codemirror.net/6/docs/ref/#commands.selectLineStart) with Shift)\n - Ctrl-e: [`cursorLineEnd`](https://codemirror.net/6/docs/ref/#commands.cursorLineEnd) ([`selectLineEnd`](https://codemirror.net/6/docs/ref/#commands.selectLineEnd) with Shift)\n - Ctrl-d: [`deleteCharForward`](https://codemirror.net/6/docs/ref/#commands.deleteCharForward)\n - Ctrl-h: [`deleteCharBackward`](https://codemirror.net/6/docs/ref/#commands.deleteCharBackward)\n - Ctrl-k: [`deleteToLineEnd`](https://codemirror.net/6/docs/ref/#commands.deleteToLineEnd)\n - Ctrl-Alt-h: [`deleteGroupBackward`](https://codemirror.net/6/docs/ref/#commands.deleteGroupBackward)\n - Ctrl-o: [`splitLine`](https://codemirror.net/6/docs/ref/#commands.splitLine)\n - Ctrl-t: [`transposeChars`](https://codemirror.net/6/docs/ref/#commands.transposeChars)\n - Ctrl-v: [`cursorPageDown`](https://codemirror.net/6/docs/ref/#commands.cursorPageDown)\n - Alt-v: [`cursorPageUp`](https://codemirror.net/6/docs/ref/#commands.cursorPageUp)\n*/\nconst emacsStyleKeymap = [\n    { key: \"Ctrl-b\", run: cursorCharLeft, shift: selectCharLeft, preventDefault: true },\n    { key: \"Ctrl-f\", run: cursorCharRight, shift: selectCharRight },\n    { key: \"Ctrl-p\", run: cursorLineUp, shift: selectLineUp },\n    { key: \"Ctrl-n\", run: cursorLineDown, shift: selectLineDown },\n    { key: \"Ctrl-a\", run: cursorLineStart, shift: selectLineStart },\n    { key: \"Ctrl-e\", run: cursorLineEnd, shift: selectLineEnd },\n    { key: \"Ctrl-d\", run: deleteCharForward },\n    { key: \"Ctrl-h\", run: deleteCharBackward },\n    { key: \"Ctrl-k\", run: deleteToLineEnd },\n    { key: \"Ctrl-Alt-h\", run: deleteGroupBackward },\n    { key: \"Ctrl-o\", run: splitLine },\n    { key: \"Ctrl-t\", run: transposeChars },\n    { key: \"Ctrl-v\", run: cursorPageDown },\n];\n/**\nAn array of key bindings closely sticking to platform-standard or\nwidely used bindings. (This includes the bindings from\n[`emacsStyleKeymap`](https://codemirror.net/6/docs/ref/#commands.emacsStyleKeymap), with their `key`\nproperty changed to `mac`.)\n\n - ArrowLeft: [`cursorCharLeft`](https://codemirror.net/6/docs/ref/#commands.cursorCharLeft) ([`selectCharLeft`](https://codemirror.net/6/docs/ref/#commands.selectCharLeft) with Shift)\n - ArrowRight: [`cursorCharRight`](https://codemirror.net/6/docs/ref/#commands.cursorCharRight) ([`selectCharRight`](https://codemirror.net/6/docs/ref/#commands.selectCharRight) with Shift)\n - Ctrl-ArrowLeft (Alt-ArrowLeft on macOS): [`cursorGroupLeft`](https://codemirror.net/6/docs/ref/#commands.cursorGroupLeft) ([`selectGroupLeft`](https://codemirror.net/6/docs/ref/#commands.selectGroupLeft) with Shift)\n - Ctrl-ArrowRight (Alt-ArrowRight on macOS): [`cursorGroupRight`](https://codemirror.net/6/docs/ref/#commands.cursorGroupRight) ([`selectGroupRight`](https://codemirror.net/6/docs/ref/#commands.selectGroupRight) with Shift)\n - Cmd-ArrowLeft (on macOS): [`cursorLineStart`](https://codemirror.net/6/docs/ref/#commands.cursorLineStart) ([`selectLineStart`](https://codemirror.net/6/docs/ref/#commands.selectLineStart) with Shift)\n - Cmd-ArrowRight (on macOS): [`cursorLineEnd`](https://codemirror.net/6/docs/ref/#commands.cursorLineEnd) ([`selectLineEnd`](https://codemirror.net/6/docs/ref/#commands.selectLineEnd) with Shift)\n - ArrowUp: [`cursorLineUp`](https://codemirror.net/6/docs/ref/#commands.cursorLineUp) ([`selectLineUp`](https://codemirror.net/6/docs/ref/#commands.selectLineUp) with Shift)\n - ArrowDown: [`cursorLineDown`](https://codemirror.net/6/docs/ref/#commands.cursorLineDown) ([`selectLineDown`](https://codemirror.net/6/docs/ref/#commands.selectLineDown) with Shift)\n - Cmd-ArrowUp (on macOS): [`cursorDocStart`](https://codemirror.net/6/docs/ref/#commands.cursorDocStart) ([`selectDocStart`](https://codemirror.net/6/docs/ref/#commands.selectDocStart) with Shift)\n - Cmd-ArrowDown (on macOS): [`cursorDocEnd`](https://codemirror.net/6/docs/ref/#commands.cursorDocEnd) ([`selectDocEnd`](https://codemirror.net/6/docs/ref/#commands.selectDocEnd) with Shift)\n - Ctrl-ArrowUp (on macOS): [`cursorPageUp`](https://codemirror.net/6/docs/ref/#commands.cursorPageUp) ([`selectPageUp`](https://codemirror.net/6/docs/ref/#commands.selectPageUp) with Shift)\n - Ctrl-ArrowDown (on macOS): [`cursorPageDown`](https://codemirror.net/6/docs/ref/#commands.cursorPageDown) ([`selectPageDown`](https://codemirror.net/6/docs/ref/#commands.selectPageDown) with Shift)\n - PageUp: [`cursorPageUp`](https://codemirror.net/6/docs/ref/#commands.cursorPageUp) ([`selectPageUp`](https://codemirror.net/6/docs/ref/#commands.selectPageUp) with Shift)\n - PageDown: [`cursorPageDown`](https://codemirror.net/6/docs/ref/#commands.cursorPageDown) ([`selectPageDown`](https://codemirror.net/6/docs/ref/#commands.selectPageDown) with Shift)\n - Home: [`cursorLineBoundaryBackward`](https://codemirror.net/6/docs/ref/#commands.cursorLineBoundaryBackward) ([`selectLineBoundaryBackward`](https://codemirror.net/6/docs/ref/#commands.selectLineBoundaryBackward) with Shift)\n - End: [`cursorLineBoundaryForward`](https://codemirror.net/6/docs/ref/#commands.cursorLineBoundaryForward) ([`selectLineBoundaryForward`](https://codemirror.net/6/docs/ref/#commands.selectLineBoundaryForward) with Shift)\n - Ctrl-Home (Cmd-Home on macOS): [`cursorDocStart`](https://codemirror.net/6/docs/ref/#commands.cursorDocStart) ([`selectDocStart`](https://codemirror.net/6/docs/ref/#commands.selectDocStart) with Shift)\n - Ctrl-End (Cmd-Home on macOS): [`cursorDocEnd`](https://codemirror.net/6/docs/ref/#commands.cursorDocEnd) ([`selectDocEnd`](https://codemirror.net/6/docs/ref/#commands.selectDocEnd) with Shift)\n - Enter: [`insertNewlineAndIndent`](https://codemirror.net/6/docs/ref/#commands.insertNewlineAndIndent)\n - Ctrl-a (Cmd-a on macOS): [`selectAll`](https://codemirror.net/6/docs/ref/#commands.selectAll)\n - Backspace: [`deleteCharBackward`](https://codemirror.net/6/docs/ref/#commands.deleteCharBackward)\n - Delete: [`deleteCharForward`](https://codemirror.net/6/docs/ref/#commands.deleteCharForward)\n - Ctrl-Backspace (Alt-Backspace on macOS): [`deleteGroupBackward`](https://codemirror.net/6/docs/ref/#commands.deleteGroupBackward)\n - Ctrl-Delete (Alt-Delete on macOS): [`deleteGroupForward`](https://codemirror.net/6/docs/ref/#commands.deleteGroupForward)\n - Cmd-Backspace (macOS): [`deleteToLineStart`](https://codemirror.net/6/docs/ref/#commands.deleteToLineStart).\n - Cmd-Delete (macOS): [`deleteToLineEnd`](https://codemirror.net/6/docs/ref/#commands.deleteToLineEnd).\n*/\nconst standardKeymap = /*@__PURE__*/[\n    { key: \"ArrowLeft\", run: cursorCharLeft, shift: selectCharLeft, preventDefault: true },\n    { key: \"Mod-ArrowLeft\", mac: \"Alt-ArrowLeft\", run: cursorGroupLeft, shift: selectGroupLeft, preventDefault: true },\n    { mac: \"Cmd-ArrowLeft\", run: cursorLineBoundaryLeft, shift: selectLineBoundaryLeft, preventDefault: true },\n    { key: \"ArrowRight\", run: cursorCharRight, shift: selectCharRight, preventDefault: true },\n    { key: \"Mod-ArrowRight\", mac: \"Alt-ArrowRight\", run: cursorGroupRight, shift: selectGroupRight, preventDefault: true },\n    { mac: \"Cmd-ArrowRight\", run: cursorLineBoundaryRight, shift: selectLineBoundaryRight, preventDefault: true },\n    { key: \"ArrowUp\", run: cursorLineUp, shift: selectLineUp, preventDefault: true },\n    { mac: \"Cmd-ArrowUp\", run: cursorDocStart, shift: selectDocStart },\n    { mac: \"Ctrl-ArrowUp\", run: cursorPageUp, shift: selectPageUp },\n    { key: \"ArrowDown\", run: cursorLineDown, shift: selectLineDown, preventDefault: true },\n    { mac: \"Cmd-ArrowDown\", run: cursorDocEnd, shift: selectDocEnd },\n    { mac: \"Ctrl-ArrowDown\", run: cursorPageDown, shift: selectPageDown },\n    { key: \"PageUp\", run: cursorPageUp, shift: selectPageUp },\n    { key: \"PageDown\", run: cursorPageDown, shift: selectPageDown },\n    { key: \"Home\", run: cursorLineBoundaryBackward, shift: selectLineBoundaryBackward, preventDefault: true },\n    { key: \"Mod-Home\", run: cursorDocStart, shift: selectDocStart },\n    { key: \"End\", run: cursorLineBoundaryForward, shift: selectLineBoundaryForward, preventDefault: true },\n    { key: \"Mod-End\", run: cursorDocEnd, shift: selectDocEnd },\n    { key: \"Enter\", run: insertNewlineAndIndent },\n    { key: \"Mod-a\", run: selectAll },\n    { key: \"Backspace\", run: deleteCharBackward, shift: deleteCharBackward },\n    { key: \"Delete\", run: deleteCharForward },\n    { key: \"Mod-Backspace\", mac: \"Alt-Backspace\", run: deleteGroupBackward },\n    { key: \"Mod-Delete\", mac: \"Alt-Delete\", run: deleteGroupForward },\n    { mac: \"Mod-Backspace\", run: deleteToLineStart },\n    { mac: \"Mod-Delete\", run: deleteToLineEnd }\n].concat(/*@__PURE__*/emacsStyleKeymap.map(b => ({ mac: b.key, run: b.run, shift: b.shift })));\n/**\nThe default keymap. Includes all bindings from\n[`standardKeymap`](https://codemirror.net/6/docs/ref/#commands.standardKeymap) plus the following:\n\n- Alt-ArrowLeft (Ctrl-ArrowLeft on macOS): [`cursorSyntaxLeft`](https://codemirror.net/6/docs/ref/#commands.cursorSyntaxLeft) ([`selectSyntaxLeft`](https://codemirror.net/6/docs/ref/#commands.selectSyntaxLeft) with Shift)\n- Alt-ArrowRight (Ctrl-ArrowRight on macOS): [`cursorSyntaxRight`](https://codemirror.net/6/docs/ref/#commands.cursorSyntaxRight) ([`selectSyntaxRight`](https://codemirror.net/6/docs/ref/#commands.selectSyntaxRight) with Shift)\n- Alt-ArrowUp: [`moveLineUp`](https://codemirror.net/6/docs/ref/#commands.moveLineUp)\n- Alt-ArrowDown: [`moveLineDown`](https://codemirror.net/6/docs/ref/#commands.moveLineDown)\n- Shift-Alt-ArrowUp: [`copyLineUp`](https://codemirror.net/6/docs/ref/#commands.copyLineUp)\n- Shift-Alt-ArrowDown: [`copyLineDown`](https://codemirror.net/6/docs/ref/#commands.copyLineDown)\n- Escape: [`simplifySelection`](https://codemirror.net/6/docs/ref/#commands.simplifySelection)\n- Ctrl-Enter (Comd-Enter on macOS): [`insertBlankLine`](https://codemirror.net/6/docs/ref/#commands.insertBlankLine)\n- Alt-l (Ctrl-l on macOS): [`selectLine`](https://codemirror.net/6/docs/ref/#commands.selectLine)\n- Ctrl-i (Cmd-i on macOS): [`selectParentSyntax`](https://codemirror.net/6/docs/ref/#commands.selectParentSyntax)\n- Ctrl-[ (Cmd-[ on macOS): [`indentLess`](https://codemirror.net/6/docs/ref/#commands.indentLess)\n- Ctrl-] (Cmd-] on macOS): [`indentMore`](https://codemirror.net/6/docs/ref/#commands.indentMore)\n- Ctrl-Alt-\\\\ (Cmd-Alt-\\\\ on macOS): [`indentSelection`](https://codemirror.net/6/docs/ref/#commands.indentSelection)\n- Shift-Ctrl-k (Shift-Cmd-k on macOS): [`deleteLine`](https://codemirror.net/6/docs/ref/#commands.deleteLine)\n- Shift-Ctrl-\\\\ (Shift-Cmd-\\\\ on macOS): [`cursorMatchingBracket`](https://codemirror.net/6/docs/ref/#commands.cursorMatchingBracket)\n- Ctrl-/ (Cmd-/ on macOS): [`toggleComment`](https://codemirror.net/6/docs/ref/#commands.toggleComment).\n- Shift-Alt-a: [`toggleBlockComment`](https://codemirror.net/6/docs/ref/#commands.toggleBlockComment).\n*/\nconst defaultKeymap = /*@__PURE__*/[\n    { key: \"Alt-ArrowLeft\", mac: \"Ctrl-ArrowLeft\", run: cursorSyntaxLeft, shift: selectSyntaxLeft },\n    { key: \"Alt-ArrowRight\", mac: \"Ctrl-ArrowRight\", run: cursorSyntaxRight, shift: selectSyntaxRight },\n    { key: \"Alt-ArrowUp\", run: moveLineUp },\n    { key: \"Shift-Alt-ArrowUp\", run: copyLineUp },\n    { key: \"Alt-ArrowDown\", run: moveLineDown },\n    { key: \"Shift-Alt-ArrowDown\", run: copyLineDown },\n    { key: \"Escape\", run: simplifySelection },\n    { key: \"Mod-Enter\", run: insertBlankLine },\n    { key: \"Alt-l\", mac: \"Ctrl-l\", run: selectLine },\n    { key: \"Mod-i\", run: selectParentSyntax, preventDefault: true },\n    { key: \"Mod-[\", run: indentLess },\n    { key: \"Mod-]\", run: indentMore },\n    { key: \"Mod-Alt-\\\\\", run: indentSelection },\n    { key: \"Shift-Mod-k\", run: deleteLine },\n    { key: \"Shift-Mod-\\\\\", run: cursorMatchingBracket },\n    { key: \"Mod-/\", run: toggleComment },\n    { key: \"Alt-A\", run: toggleBlockComment }\n].concat(standardKeymap);\n/**\nA binding that binds Tab to [`indentMore`](https://codemirror.net/6/docs/ref/#commands.indentMore) and\nShift-Tab to [`indentLess`](https://codemirror.net/6/docs/ref/#commands.indentLess).\nPlease see the [Tab example](../../examples/tab/) before using\nthis.\n*/\nconst indentWithTab = { key: \"Tab\", run: indentMore, shift: indentLess };\n\nexport { blockComment, blockUncomment, copyLineDown, copyLineUp, cursorCharBackward, cursorCharForward, cursorCharLeft, cursorCharRight, cursorDocEnd, cursorDocStart, cursorGroupBackward, cursorGroupForward, cursorGroupLeft, cursorGroupRight, cursorLineBoundaryBackward, cursorLineBoundaryForward, cursorLineBoundaryLeft, cursorLineBoundaryRight, cursorLineDown, cursorLineEnd, cursorLineStart, cursorLineUp, cursorMatchingBracket, cursorPageDown, cursorPageUp, cursorSubwordBackward, cursorSubwordForward, cursorSyntaxLeft, cursorSyntaxRight, defaultKeymap, deleteCharBackward, deleteCharForward, deleteGroupBackward, deleteGroupForward, deleteLine, deleteToLineEnd, deleteToLineStart, deleteTrailingWhitespace, emacsStyleKeymap, history, historyField, historyKeymap, indentLess, indentMore, indentSelection, indentWithTab, insertBlankLine, insertNewline, insertNewlineAndIndent, insertTab, invertedEffects, isolateHistory, lineComment, lineUncomment, moveLineDown, moveLineUp, redo, redoDepth, redoSelection, selectAll, selectCharBackward, selectCharForward, selectCharLeft, selectCharRight, selectDocEnd, selectDocStart, selectGroupBackward, selectGroupForward, selectGroupLeft, selectGroupRight, selectLine, selectLineBoundaryBackward, selectLineBoundaryForward, selectLineBoundaryLeft, selectLineBoundaryRight, selectLineDown, selectLineEnd, selectLineStart, selectLineUp, selectMatchingBracket, selectPageDown, selectPageUp, selectParentSyntax, selectSubwordBackward, selectSubwordForward, selectSyntaxLeft, selectSyntaxRight, simplifySelection, splitLine, standardKeymap, toggleBlockComment, toggleBlockCommentByLine, toggleComment, toggleLineComment, transposeChars, undo, undoDepth, undoSelection };\n","import { defaultKeymap, history, historyKeymap } from \"@codemirror/commands\";\nimport { HighlightStyle, syntaxHighlighting } from \"@codemirror/language\";\nimport type { Extension } from \"@codemirror/state\";\nimport {\n  EditorView,\n  drawSelection,\n  highlightSpecialChars,\n  keymap\n} from \"@codemirror/view\";\nimport { type Tag, tags as t } from \"@lezer/highlight\";\n\nlet tf = (tag: Tag, hljs: string) => ({ tag, class: `hljs-${hljs}` });\nlet tt = (cm: keyof typeof t, hljs: string) => tf(t[cm] as any, hljs);\n\nlet highlightStyle = HighlightStyle.define([\n  tt(\"comment\", \"comment\"),\n  tt(\"lineComment\", \"comment\"),\n  tt(\"blockComment\", \"comment\"),\n  tt(\"docComment\", \"comment\"),\n  // tt(\"variableName\", \"variable\"),\n  tt(\"typeName\", \"type\"),\n  tt(\"tagName\", \"type\"),\n  tt(\"literal\", \"literal\"),\n  tt(\"string\", \"string\"),\n  tt(\"docString\", \"string\"),\n  tt(\"number\", \"number\"),\n  tt(\"integer\", \"number\"),\n  tt(\"float\", \"number\"),\n  tt(\"regexp\", \"regexp\"),\n  tt(\"keyword\", \"keyword\"),\n  tt(\"self\", \"variable.language\"),\n  tt(\"operator\", \"operator\"),\n  tf(t.function(t.definition(t.variableName)), \"title\")\n]);\n\nlet suppressKeyEvents = () => {\n  let captureKeyboard = (e: KeyboardEvent) => e.stopPropagation();\n  return EditorView.domEventHandlers({\n    focusin: () => {\n      document.documentElement.addEventListener(\n        \"keydown\",\n        captureKeyboard,\n        false\n      );\n    },\n    focusout: () => {\n      document.documentElement.removeEventListener(\n        \"keydown\",\n        captureKeyboard,\n        false\n      );\n    }\n  });\n};\n\nexport let setup: Extension = (() => [\n  highlightSpecialChars(),\n  history(),\n  drawSelection(),\n  syntaxHighlighting(highlightStyle, { fallback: true }),\n  keymap.of([...defaultKeymap, ...historyKeymap]),\n  suppressKeyEvents()\n])();\n","import { Editor, type Result, type types } from \"@aquascope/editor\";\nimport { useFloating } from \"@floating-ui/react-dom\";\nimport React, { useContext, useLayoutEffect, useState } from \"react\";\nimport ReactDOM from \"react-dom/client\";\n\nimport { setup } from \"./setup\";\nimport \"./styles.scss\";\n\nconst AQUASCOPE_NAME = \"aquascope\";\nconst EMBED_NAME = \"aquascope-embed\";\n\n// Making this global is a hack to expose the prerendered Aquascope visualizer\n// to other tools like mdbook-quiz.\n//\n// TODO: figure out a more elegant / composable solution to this. Probably involves\n// moving some of this functionality into aquascope-editor and distributing that\n// package on npm.\ndeclare global {\n  function initAquascopeBlocks(root: HTMLElement): void;\n\n  var telemetry:\n    | {\n        log: (endpoint: string, payload: any) => void;\n      }\n    | undefined;\n}\n\nlet CodeContext = React.createContext(\"\");\n\n// TODO: this is duplicated with mdbook-quiz. Should factor out into a mdbook-js-utils maybe?\nlet useCaptureMdbookShortcuts = (capture: boolean) => {\n  useLayoutEffect(() => {\n    if (capture) {\n      let captureKeyboard = (e: KeyboardEvent) => e.stopPropagation();\n\n      // This gets added specifically to document.documentElement rather than document\n      // so bubbling events will hit this listener before ones added via document.addEventListener(...).\n      // All of the problematic mdBook interactions are created that way, so we ensure that\n      // the keyboard event does not propagate to those listeners.\n      //\n      // However, some widgets like Codemirror require keydown events but on local elements.\n      // So we can't just stopPropagation in the capture phase, or those widgets will break.\n      // This is the compromise!\n      document.documentElement.addEventListener(\n        \"keydown\",\n        captureKeyboard,\n        false\n      );\n\n      return () =>\n        document.documentElement.removeEventListener(\n          \"keydown\",\n          captureKeyboard,\n          false\n        );\n    }\n  }, [capture]);\n};\n\nlet ContextProvider = ({\n  title,\n  buttonText,\n  children\n}: {\n  title: string;\n  buttonText: string;\n  children: (close: () => void) => JSX.Element;\n}) => {\n  let [open, setOpen] = useState(false);\n  let { x, y, strategy, refs } = useFloating({\n    placement: \"bottom-end\",\n    open\n  });\n\n  // Disable mdbook shortcuts if the bug reporter is opened and we're not\n  // fullscreen\n  useCaptureMdbookShortcuts(open);\n\n  let childEl = children(() => setOpen(false));\n\n  return (\n    <div className=\"context-provider\">\n      <button\n        type=\"button\"\n        title={title}\n        onClick={() => setOpen(!open)}\n        ref={refs.setReference}\n      >\n        {buttonText}\n      </button>\n      {open ? (\n        <div\n          className=\"popup-context\"\n          ref={refs.setFloating}\n          style={{\n            position: strategy,\n            top: y ?? 0,\n            left: x ?? 0\n          }}\n        >\n          <button\n            type=\"button\"\n            className=\"close\"\n            onClick={() => setOpen(false)}\n          >\n            ✕\n          </button>\n          {childEl}\n        </div>\n      ) : null}\n    </div>\n  );\n};\n\nlet BugReporter = () => (\n  <ContextProvider title={\"Report a bug\"} buttonText={\"🐞\"}>\n    {close => {\n      let code = useContext(CodeContext);\n      let onSubmit: React.FormEventHandler<HTMLFormElement> = (event: any) => {\n        let data = new FormData(event.target as any);\n        let feedback = data.get(\"feedback\")!.toString();\n        window.telemetry!.log(\"aquascopeBug\", { code, feedback });\n        event.preventDefault();\n        close();\n      };\n      return (\n        <>\n          <h3>Report a bug</h3>\n          <p>\n            If you found an issue in this diagram (e.g. a typo, a visual bug,\n            anything confusing), please describe the issue and report it:\n          </p>\n          <form onSubmit={onSubmit}>\n            <div>\n              <textarea name=\"feedback\" aria-label=\"Bug feedback\" />\n            </div>\n            <div>\n              <input type=\"submit\" aria-label=\"Submit bug feedback\" />\n            </div>\n          </form>\n        </>\n      );\n    }}\n  </ContextProvider>\n);\n\nlet QuestionMark = () => (\n  <ContextProvider title={\"What is this diagram?\"} buttonText={\"❓\"}>\n    {() => (\n      <>\n        <h3>What is this diagram?</h3>\n        <p>\n          This diagram is a new way of visualizing Rust programs. To learn more\n          about what the symbols mean, you will need to read the updated{\" \"}\n          <a\n            href=\"ch04-01-what-is-ownership.html\"\n            target=\"_blank\"\n            rel=\"noreferrer\"\n          >\n            Chapter 4: Understanding Ownership\n          </a>\n          .\n        </p>\n      </>\n    )}\n  </ContextProvider>\n);\n\nlet ExtraInfo = () => (\n  <div className=\"extra-info\">\n    <BugReporter />\n    <QuestionMark />\n  </div>\n);\n\nwindow.initAquascopeBlocks = (root: HTMLElement) => {\n  root.querySelectorAll<HTMLDivElement>(`.${EMBED_NAME}`).forEach(elem => {\n    elem.classList.remove(EMBED_NAME);\n    elem.classList.add(AQUASCOPE_NAME);\n\n    let maybeParseJson = <T,>(s: string | undefined): T | undefined =>\n      s ? JSON.parse(s) : undefined;\n\n    let readOnly = maybeParseJson(elem.dataset.noInteract!) === true;\n    let showBugReporter =\n      maybeParseJson(elem.dataset.showBugReporter!) === true;\n\n    let computePermBtn: HTMLButtonElement | undefined;\n    if (!readOnly) {\n      // container for the button\n      let btnWrap = document.createElement(\"div\");\n      btnWrap.classList.add(\"top-right\");\n\n      // button for computing the receiver permissions\n      computePermBtn = document.createElement(\"button\");\n      computePermBtn.className = \"fa fa-refresh cm-button\";\n\n      btnWrap.appendChild(computePermBtn);\n      elem.appendChild(btnWrap);\n    }\n\n    let initialCode = maybeParseJson<string>(elem.dataset.code);\n    if (!initialCode) throw new Error(\"Missing data-code attribute\");\n\n    if (window.telemetry && showBugReporter) {\n      let extraInfo = document.createElement(\"div\");\n      elem.appendChild(extraInfo);\n      ReactDOM.createRoot(extraInfo).render(\n        <CodeContext.Provider value={initialCode}>\n          <ExtraInfo />\n        </CodeContext.Provider>\n      );\n    }\n\n    let serverUrl = elem.dataset.serverUrl\n      ? new URL(elem.dataset.serverUrl)\n      : undefined;\n\n    let shouldFailHtml = `\n  <div class=\"ferris-container\">\n    <a href=\"ch00-00-introduction.html#ferris\" target=\"_blank\">\n      <img\n        src=\"img/ferris/does_not_compile.svg\"\n        title=\"This code does not compile!\"\n        class=\"ferris ferris-large\"\n      />\n    </a>\n  </div>\n  `;\n\n    let ed = new Editor(\n      elem,\n      setup,\n      initialCode,\n      err => {\n        console.error(err);\n      },\n      serverUrl,\n      readOnly,\n      shouldFailHtml,\n      [\"copy\"]\n    );\n\n    let operations = maybeParseJson<string[]>(elem.dataset.operations);\n    if (!operations) throw new Error(\"Missing data-operations attribute\");\n\n    let responses = maybeParseJson<{ [op: string]: Result<any> }>(\n      elem.dataset.responses\n    );\n    let config = maybeParseJson<any>(elem.dataset.config);\n    let annotations = maybeParseJson<types.AquascopeAnnotations>(\n      elem.dataset.annotations\n    );\n\n    if (responses) {\n      operations.forEach(operation => {\n        ed.renderOperation(operation, {\n          response: responses![operation],\n          config,\n          annotations\n        });\n      });\n    }\n\n    computePermBtn?.addEventListener(\"click\", _ => {\n      operations!.forEach(operation => ed.renderOperation(operation!, {}));\n    });\n  });\n};\n\nwindow.addEventListener(\n  \"load\",\n  () => initAquascopeBlocks(document.body),\n  false\n);\n"],"names":["ReactDebugCurrentFrame","a","typeName","e","x","self","i","index","c","n","moduleObject","error","name","compare","s","Component","returnValue","reactModule","require$$0","React","jsxRuntimeModule","types","IterMode","b","_a","r","p","d","children","positions","node","buffer","data","length","lookAhead","base","pair","nodeSize","from","to","f","Range","string","_","parser","top","v","Recover","Safety","Rec","insert","w","t","prec","sameArray","m","tags","h","hasChild","l","number","code","MapMode","doc","process","content","readOnly","scrollIntoView","none","CharCategory","require","layer","C","spec","ie","y","rect","flatten","text","pos","side","view","BlockType","decorations","Direction","type","inside","_b","handlers","event","extend","QueryType","gap","key","shift","meta","command","cmd","pieces","_f","deco","styles","language","bracket","initialTime","startTime","schedulerModule","require$$1","ContextProvider","prefix","sanitizeURL","propertyName","workInProgress","get","set","isHydrating","options","style","registrationNameDependencies","possibleRegistrationNames","callCallback","current","root","renderLanes","queuedEvent","getSelection","prefixes","has","updateFragment","child","reconcileChildFibers","error$1","render","subtreeRenderLanes","hasContextChanged","commitTime","hydrate","currentHook","ReactCurrentDispatcher","reactDomModule","o","classNames","undefined","global","collection","runInContext","Array","Date","Error","Function","Math","Object","RegExp","String","TypeError","Buffer","Symbol","Uint8Array","Map","Promise","Set","WeakMap","lodash","result","iteratee","Hash","size","values","Stack","setTimeout","includes","object","indexOf","clearTimeout","ary","operator","othValue","map","transform","remove","parent","clone","find","isFinite","isNaN","parseInt","chain","value","this","PermChar","useState","ReactDOM","LeaderLine","M","L","u","V","P","T","W","B","R","F","D","z","H","S","g","E","U","k","O","I","A","N","G","j","_e","Z","Y","X","q","Q","K","J","$","ee","tt","CodeContext","useContext","ptr","useEffect","theme","useRef","setup","useLayoutEffect","React.useRef","React.useState","React.useCallback","computePosition","ReactDOM.flushSync","React.useMemo","comment","isAdjacent","changes","jsxs","jsx","Fragment"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;AAY2C;AACzC,OAAC,WAAW;AAKd,YACE,OAAO,mCAAmC,eAC1C,OAAO,+BAA+B,gCACpC,YACF;AACA,yCAA+B,4BAA4B,IAAI,MAAK,CAAE;AAAA,QACvE;AACS,YAAI,eAAe;AAM7B,YAAI,qBAAqB,OAAO,IAAI,eAAe;AACnD,YAAI,oBAAoB,OAAO,IAAI,cAAc;AACjD,YAAI,sBAAsB,OAAO,IAAI,gBAAgB;AACrD,YAAI,yBAAyB,OAAO,IAAI,mBAAmB;AAC3D,YAAI,sBAAsB,OAAO,IAAI,gBAAgB;AACrD,YAAI,sBAAsB,OAAO,IAAI,gBAAgB;AACrD,YAAI,qBAAqB,OAAO,IAAI,eAAe;AACnD,YAAI,yBAAyB,OAAO,IAAI,mBAAmB;AAC3D,YAAI,sBAAsB,OAAO,IAAI,gBAAgB;AACrD,YAAI,2BAA2B,OAAO,IAAI,qBAAqB;AAC/D,YAAI,kBAAkB,OAAO,IAAI,YAAY;AAC7C,YAAI,kBAAkB,OAAO,IAAI,YAAY;AAC7C,YAAI,uBAAuB,OAAO,IAAI,iBAAiB;AACvD,YAAI,wBAAwB,OAAO;AACnC,YAAI,uBAAuB;AAC3B,iBAAS,cAAc,eAAe;AACpC,cAAI,kBAAkB,QAAQ,OAAO,kBAAkB,UAAU;AAC/D,mBAAO;AAAA,UACR;AAED,cAAI,gBAAgB,yBAAyB,cAAc,qBAAqB,KAAK,cAAc,oBAAoB;AAEvH,cAAI,OAAO,kBAAkB,YAAY;AACvC,mBAAO;AAAA,UACR;AAED,iBAAO;AAAA,QACR;AAKD,YAAI,yBAAyB;AAAA;AAAA;AAAA;AAAA;AAAA,UAK3B,SAAS;AAAA,QACX;AAMA,YAAI,0BAA0B;AAAA,UAC5B,YAAY;AAAA,QACd;AAEA,YAAI,uBAAuB;AAAA,UACzB,SAAS;AAAA;AAAA,UAET,kBAAkB;AAAA,UAClB,yBAAyB;AAAA,QAC3B;AAQA,YAAI,oBAAoB;AAAA;AAAA;AAAA;AAAA;AAAA,UAKtB,SAAS;AAAA,QACX;AAEA,YAAI,yBAAyB,CAAA;AAC7B,YAAI,yBAAyB;AAC7B,iBAAS,mBAAmB,OAAO;AACjC;AACE,qCAAyB;AAAA,UAC1B;AAAA,QACF;AAED;AACE,iCAAuB,qBAAqB,SAAU,OAAO;AAC3D;AACE,uCAAyB;AAAA,YAC1B;AAAA,UACL;AAGE,iCAAuB,kBAAkB;AAEzC,iCAAuB,mBAAmB,WAAY;AACpD,gBAAI,QAAQ;AAEZ,gBAAI,wBAAwB;AAC1B,uBAAS;AAAA,YACV;AAGD,gBAAI,OAAO,uBAAuB;AAElC,gBAAI,MAAM;AACR,uBAAS,KAAM,KAAI;AAAA,YACpB;AAED,mBAAO;AAAA,UACX;AAAA,QACC;AAID,YAAI,iBAAiB;AACrB,YAAI,qBAAqB;AACzB,YAAI,0BAA0B;AAE9B,YAAI,qBAAqB;AAIzB,YAAI,qBAAqB;AAEzB,YAAI,uBAAuB;AAAA,UACzB;AAAA,UACA;AAAA,UACA;AAAA,QACF;AAEA;AACE,+BAAqB,yBAAyB;AAC9C,+BAAqB,uBAAuB;AAAA,QAC7C;AAOD,iBAAS,KAAK,QAAQ;AACpB;AACE;AACE,uBAAS,OAAO,UAAU,QAAQ,OAAO,IAAI,MAAM,OAAO,IAAI,OAAO,IAAI,CAAC,GAAG,OAAO,GAAG,OAAO,MAAM,QAAQ;AAC1G,qBAAK,OAAO,CAAC,IAAI,UAAU,IAAI;AAAA,cAChC;AAED,2BAAa,QAAQ,QAAQ,IAAI;AAAA,YAClC;AAAA,UACF;AAAA,QACF;AACD,iBAAS,MAAM,QAAQ;AACrB;AACE;AACE,uBAAS,QAAQ,UAAU,QAAQ,OAAO,IAAI,MAAM,QAAQ,IAAI,QAAQ,IAAI,CAAC,GAAG,QAAQ,GAAG,QAAQ,OAAO,SAAS;AACjH,qBAAK,QAAQ,CAAC,IAAI,UAAU,KAAK;AAAA,cAClC;AAED,2BAAa,SAAS,QAAQ,IAAI;AAAA,YACnC;AAAA,UACF;AAAA,QACF;AAED,iBAAS,aAAa,OAAO,QAAQ,MAAM;AAGzC;AACE,gBAAIA,0BAAyB,qBAAqB;AAClD,gBAAI,QAAQA,wBAAuB;AAEnC,gBAAI,UAAU,IAAI;AAChB,wBAAU;AACV,qBAAO,KAAK,OAAO,CAAC,KAAK,CAAC;AAAA,YAC3B;AAGD,gBAAI,iBAAiB,KAAK,IAAI,SAAU,MAAM;AAC5C,qBAAO,OAAO,IAAI;AAAA,YACxB,CAAK;AAED,2BAAe,QAAQ,cAAc,MAAM;AAI3C,qBAAS,UAAU,MAAM,KAAK,QAAQ,KAAK,GAAG,SAAS,cAAc;AAAA,UACtE;AAAA,QACF;AAED,YAAI,0CAA0C,CAAA;AAE9C,iBAAS,SAAS,gBAAgB,YAAY;AAC5C;AACE,gBAAI,eAAe,eAAe;AAClC,gBAAI,gBAAgB,iBAAiB,aAAa,eAAe,aAAa,SAAS;AACvF,gBAAI,aAAa,gBAAgB,MAAM;AAEvC,gBAAI,wCAAwC,UAAU,GAAG;AACvD;AAAA,YACD;AAED,kBAAM,yPAAwQ,YAAY,aAAa;AAEvS,oDAAwC,UAAU,IAAI;AAAA,UACvD;AAAA,QACF;AAMD,YAAI,uBAAuB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAQzB,WAAW,SAAU,gBAAgB;AACnC,mBAAO;AAAA,UACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAiBD,oBAAoB,SAAU,gBAAgB,UAAU,YAAY;AAClE,qBAAS,gBAAgB,aAAa;AAAA,UACvC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAeD,qBAAqB,SAAU,gBAAgB,eAAe,UAAU,YAAY;AAClF,qBAAS,gBAAgB,cAAc;AAAA,UACxC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAcD,iBAAiB,SAAU,gBAAgB,cAAc,UAAU,YAAY;AAC7E,qBAAS,gBAAgB,UAAU;AAAA,UACpC;AAAA,QACH;AAEA,YAAI,SAAS,OAAO;AAEpB,YAAI,cAAc,CAAA;AAElB;AACE,iBAAO,OAAO,WAAW;AAAA,QAC1B;AAMD,iBAAS,UAAU,OAAO,SAAS,SAAS;AAC1C,eAAK,QAAQ;AACb,eAAK,UAAU;AAEf,eAAK,OAAO;AAGZ,eAAK,UAAU,WAAW;AAAA,QAC3B;AAED,kBAAU,UAAU,mBAAmB;AA2BvC,kBAAU,UAAU,WAAW,SAAU,cAAc,UAAU;AAC/D,cAAI,OAAO,iBAAiB,YAAY,OAAO,iBAAiB,cAAc,gBAAgB,MAAM;AAClG,kBAAM,IAAI,MAAM,uHAA4H;AAAA,UAC7I;AAED,eAAK,QAAQ,gBAAgB,MAAM,cAAc,UAAU,UAAU;AAAA,QACvE;AAiBA,kBAAU,UAAU,cAAc,SAAU,UAAU;AACpD,eAAK,QAAQ,mBAAmB,MAAM,UAAU,aAAa;AAAA,QAC/D;AAQA;AACE,cAAI,iBAAiB;AAAA,YACnB,WAAW,CAAC,aAAa,oHAAyH;AAAA,YAClJ,cAAc,CAAC,gBAAgB,iGAAsG;AAAA,UACzI;AAEE,cAAI,2BAA2B,SAAU,YAAY,MAAM;AACzD,mBAAO,eAAe,UAAU,WAAW,YAAY;AAAA,cACrD,KAAK,WAAY;AACf,qBAAK,+DAA+D,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AAEpF,uBAAO;AAAA,cACR;AAAA,YACP,CAAK;AAAA,UACL;AAEE,mBAAS,UAAU,gBAAgB;AACjC,gBAAI,eAAe,eAAe,MAAM,GAAG;AACzC,uCAAyB,QAAQ,eAAe,MAAM,CAAC;AAAA,YACxD;AAAA,UACF;AAAA,QACF;AAED,iBAAS,iBAAiB;AAAA,QAAE;AAE5B,uBAAe,YAAY,UAAU;AAKrC,iBAAS,cAAc,OAAO,SAAS,SAAS;AAC9C,eAAK,QAAQ;AACb,eAAK,UAAU;AAEf,eAAK,OAAO;AACZ,eAAK,UAAU,WAAW;AAAA,QAC3B;AAED,YAAI,yBAAyB,cAAc,YAAY,IAAI,eAAc;AACzE,+BAAuB,cAAc;AAErC,eAAO,wBAAwB,UAAU,SAAS;AAClD,+BAAuB,uBAAuB;AAG9C,iBAAS,YAAY;AACnB,cAAI,YAAY;AAAA,YACd,SAAS;AAAA,UACb;AAEE;AACE,mBAAO,KAAK,SAAS;AAAA,UACtB;AAED,iBAAO;AAAA,QACR;AAED,YAAI,cAAc,MAAM;AAExB,iBAAS,QAAQC,IAAG;AAClB,iBAAO,YAAYA,EAAC;AAAA,QACrB;AAYD,iBAASC,UAAS,OAAO;AACvB;AAEE,gBAAI,iBAAiB,OAAO,WAAW,cAAc,OAAO;AAC5D,gBAAI,OAAO,kBAAkB,MAAM,OAAO,WAAW,KAAK,MAAM,YAAY,QAAQ;AACpF,mBAAO;AAAA,UACR;AAAA,QACF;AAGD,iBAAS,kBAAkB,OAAO;AAChC;AACE,gBAAI;AACF,iCAAmB,KAAK;AACxB,qBAAO;AAAA,YACR,SAAQC,IAAG;AACV,qBAAO;AAAA,YACR;AAAA,UACF;AAAA,QACF;AAED,iBAAS,mBAAmB,OAAO;AAwBjC,iBAAO,KAAK;AAAA,QACb;AACD,iBAAS,uBAAuB,OAAO;AACrC;AACE,gBAAI,kBAAkB,KAAK,GAAG;AAC5B,oBAAM,mHAAwHD,UAAS,KAAK,CAAC;AAE7I,qBAAO,mBAAmB,KAAK;AAAA,YAChC;AAAA,UACF;AAAA,QACF;AAED,iBAAS,eAAe,WAAW,WAAW,aAAa;AACzD,cAAI,cAAc,UAAU;AAE5B,cAAI,aAAa;AACf,mBAAO;AAAA,UACR;AAED,cAAI,eAAe,UAAU,eAAe,UAAU,QAAQ;AAC9D,iBAAO,iBAAiB,KAAK,cAAc,MAAM,eAAe,MAAM;AAAA,QACvE;AAGD,iBAAS,eAAe,MAAM;AAC5B,iBAAO,KAAK,eAAe;AAAA,QAC5B;AAGD,iBAAS,yBAAyB,MAAM;AACtC,cAAI,QAAQ,MAAM;AAEhB,mBAAO;AAAA,UACR;AAED;AACE,gBAAI,OAAO,KAAK,QAAQ,UAAU;AAChC,oBAAM,mHAAwH;AAAA,YAC/H;AAAA,UACF;AAED,cAAI,OAAO,SAAS,YAAY;AAC9B,mBAAO,KAAK,eAAe,KAAK,QAAQ;AAAA,UACzC;AAED,cAAI,OAAO,SAAS,UAAU;AAC5B,mBAAO;AAAA,UACR;AAED,kBAAQ,MAAI;AAAA,YACV,KAAK;AACH,qBAAO;AAAA,YAET,KAAK;AACH,qBAAO;AAAA,YAET,KAAK;AACH,qBAAO;AAAA,YAET,KAAK;AACH,qBAAO;AAAA,YAET,KAAK;AACH,qBAAO;AAAA,YAET,KAAK;AACH,qBAAO;AAAA,UAEV;AAED,cAAI,OAAO,SAAS,UAAU;AAC5B,oBAAQ,KAAK,UAAQ;AAAA,cACnB,KAAK;AACH,oBAAI,UAAU;AACd,uBAAO,eAAe,OAAO,IAAI;AAAA,cAEnC,KAAK;AACH,oBAAI,WAAW;AACf,uBAAO,eAAe,SAAS,QAAQ,IAAI;AAAA,cAE7C,KAAK;AACH,uBAAO,eAAe,MAAM,KAAK,QAAQ,YAAY;AAAA,cAEvD,KAAK;AACH,oBAAI,YAAY,KAAK,eAAe;AAEpC,oBAAI,cAAc,MAAM;AACtB,yBAAO;AAAA,gBACR;AAED,uBAAO,yBAAyB,KAAK,IAAI,KAAK;AAAA,cAEhD,KAAK,iBACH;AACE,oBAAI,gBAAgB;AACpB,oBAAI,UAAU,cAAc;AAC5B,oBAAI,OAAO,cAAc;AAEzB,oBAAI;AACF,yBAAO,yBAAyB,KAAK,OAAO,CAAC;AAAA,gBAC9C,SAAQE,IAAG;AACV,yBAAO;AAAA,gBACR;AAAA,cACF;AAAA,YAGJ;AAAA,UACF;AAED,iBAAO;AAAA,QACR;AAED,YAAI,iBAAiB,OAAO,UAAU;AAEtC,YAAI,iBAAiB;AAAA,UACnB,KAAK;AAAA,UACL,KAAK;AAAA,UACL,QAAQ;AAAA,UACR,UAAU;AAAA,QACZ;AACA,YAAI,4BAA4B,4BAA4B;AAE5D;AACE,mCAAyB,CAAA;AAAA,QAC1B;AAED,iBAAS,YAAY,QAAQ;AAC3B;AACE,gBAAI,eAAe,KAAK,QAAQ,KAAK,GAAG;AACtC,kBAAI,SAAS,OAAO,yBAAyB,QAAQ,KAAK,EAAE;AAE5D,kBAAI,UAAU,OAAO,gBAAgB;AACnC,uBAAO;AAAA,cACR;AAAA,YACF;AAAA,UACF;AAED,iBAAO,OAAO,QAAQ;AAAA,QACvB;AAED,iBAAS,YAAY,QAAQ;AAC3B;AACE,gBAAI,eAAe,KAAK,QAAQ,KAAK,GAAG;AACtC,kBAAI,SAAS,OAAO,yBAAyB,QAAQ,KAAK,EAAE;AAE5D,kBAAI,UAAU,OAAO,gBAAgB;AACnC,uBAAO;AAAA,cACR;AAAA,YACF;AAAA,UACF;AAED,iBAAO,OAAO,QAAQ;AAAA,QACvB;AAED,iBAAS,2BAA2B,OAAO,aAAa;AACtD,cAAI,wBAAwB,WAAY;AACtC;AACE,kBAAI,CAAC,4BAA4B;AAC/B,6CAA6B;AAE7B,sBAAM,6OAA4P,WAAW;AAAA,cAC9Q;AAAA,YACF;AAAA,UACL;AAEE,gCAAsB,iBAAiB;AACvC,iBAAO,eAAe,OAAO,OAAO;AAAA,YAClC,KAAK;AAAA,YACL,cAAc;AAAA,UAClB,CAAG;AAAA,QACF;AAED,iBAAS,2BAA2B,OAAO,aAAa;AACtD,cAAI,wBAAwB,WAAY;AACtC;AACE,kBAAI,CAAC,4BAA4B;AAC/B,6CAA6B;AAE7B,sBAAM,6OAA4P,WAAW;AAAA,cAC9Q;AAAA,YACF;AAAA,UACL;AAEE,gCAAsB,iBAAiB;AACvC,iBAAO,eAAe,OAAO,OAAO;AAAA,YAClC,KAAK;AAAA,YACL,cAAc;AAAA,UAClB,CAAG;AAAA,QACF;AAED,iBAAS,qCAAqC,QAAQ;AACpD;AACE,gBAAI,OAAO,OAAO,QAAQ,YAAY,kBAAkB,WAAW,OAAO,UAAU,kBAAkB,QAAQ,cAAc,OAAO,QAAQ;AACzI,kBAAI,gBAAgB,yBAAyB,kBAAkB,QAAQ,IAAI;AAE3E,kBAAI,CAAC,uBAAuB,aAAa,GAAG;AAC1C,sBAAM,6VAAsX,eAAe,OAAO,GAAG;AAErZ,uCAAuB,aAAa,IAAI;AAAA,cACzC;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAuBD,YAAI,eAAe,SAAU,MAAM,KAAK,KAAKC,OAAM,QAAQ,OAAO,OAAO;AACvE,cAAI,UAAU;AAAA;AAAA,YAEZ,UAAU;AAAA;AAAA,YAEV;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA;AAAA,YAEA,QAAQ;AAAA,UACZ;AAEE;AAKE,oBAAQ,SAAS;AAKjB,mBAAO,eAAe,QAAQ,QAAQ,aAAa;AAAA,cACjD,cAAc;AAAA,cACd,YAAY;AAAA,cACZ,UAAU;AAAA,cACV,OAAO;AAAA,YACb,CAAK;AAED,mBAAO,eAAe,SAAS,SAAS;AAAA,cACtC,cAAc;AAAA,cACd,YAAY;AAAA,cACZ,UAAU;AAAA,cACV,OAAOA;AAAA,YACb,CAAK;AAGD,mBAAO,eAAe,SAAS,WAAW;AAAA,cACxC,cAAc;AAAA,cACd,YAAY;AAAA,cACZ,UAAU;AAAA,cACV,OAAO;AAAA,YACb,CAAK;AAED,gBAAI,OAAO,QAAQ;AACjB,qBAAO,OAAO,QAAQ,KAAK;AAC3B,qBAAO,OAAO,OAAO;AAAA,YACtB;AAAA,UACF;AAED,iBAAO;AAAA,QACT;AAMA,iBAAS,cAAc,MAAM,QAAQ,UAAU;AAC7C,cAAI;AAEJ,cAAI,QAAQ,CAAA;AACZ,cAAI,MAAM;AACV,cAAI,MAAM;AACV,cAAIA,QAAO;AACX,cAAI,SAAS;AAEb,cAAI,UAAU,MAAM;AAClB,gBAAI,YAAY,MAAM,GAAG;AACvB,oBAAM,OAAO;AAEb;AACE,qDAAqC,MAAM;AAAA,cAC5C;AAAA,YACF;AAED,gBAAI,YAAY,MAAM,GAAG;AACvB;AACE,uCAAuB,OAAO,GAAG;AAAA,cAClC;AAED,oBAAM,KAAK,OAAO;AAAA,YACnB;AAED,YAAAA,QAAO,OAAO,WAAW,SAAY,OAAO,OAAO;AACnD,qBAAS,OAAO,aAAa,SAAY,OAAO,OAAO;AAEvD,iBAAK,YAAY,QAAQ;AACvB,kBAAI,eAAe,KAAK,QAAQ,QAAQ,KAAK,CAAC,eAAe,eAAe,QAAQ,GAAG;AACrF,sBAAM,QAAQ,IAAI,OAAO,QAAQ;AAAA,cAClC;AAAA,YACF;AAAA,UACF;AAID,cAAI,iBAAiB,UAAU,SAAS;AAExC,cAAI,mBAAmB,GAAG;AACxB,kBAAM,WAAW;AAAA,UACrB,WAAa,iBAAiB,GAAG;AAC7B,gBAAI,aAAa,MAAM,cAAc;AAErC,qBAASC,KAAI,GAAGA,KAAI,gBAAgBA,MAAK;AACvC,yBAAWA,EAAC,IAAI,UAAUA,KAAI,CAAC;AAAA,YAChC;AAED;AACE,kBAAI,OAAO,QAAQ;AACjB,uBAAO,OAAO,UAAU;AAAA,cACzB;AAAA,YACF;AAED,kBAAM,WAAW;AAAA,UAClB;AAGD,cAAI,QAAQ,KAAK,cAAc;AAC7B,gBAAI,eAAe,KAAK;AAExB,iBAAK,YAAY,cAAc;AAC7B,kBAAI,MAAM,QAAQ,MAAM,QAAW;AACjC,sBAAM,QAAQ,IAAI,aAAa,QAAQ;AAAA,cACxC;AAAA,YACF;AAAA,UACF;AAED;AACE,gBAAI,OAAO,KAAK;AACd,kBAAI,cAAc,OAAO,SAAS,aAAa,KAAK,eAAe,KAAK,QAAQ,YAAY;AAE5F,kBAAI,KAAK;AACP,2CAA2B,OAAO,WAAW;AAAA,cAC9C;AAED,kBAAI,KAAK;AACP,2CAA2B,OAAO,WAAW;AAAA,cAC9C;AAAA,YACF;AAAA,UACF;AAED,iBAAO,aAAa,MAAM,KAAK,KAAKD,OAAM,QAAQ,kBAAkB,SAAS,KAAK;AAAA,QACnF;AACD,iBAAS,mBAAmB,YAAY,QAAQ;AAC9C,cAAI,aAAa,aAAa,WAAW,MAAM,QAAQ,WAAW,KAAK,WAAW,OAAO,WAAW,SAAS,WAAW,QAAQ,WAAW,KAAK;AAChJ,iBAAO;AAAA,QACR;AAMD,iBAAS,aAAa,SAAS,QAAQ,UAAU;AAC/C,cAAI,YAAY,QAAQ,YAAY,QAAW;AAC7C,kBAAM,IAAI,MAAM,mFAAmF,UAAU,GAAG;AAAA,UACjH;AAED,cAAI;AAEJ,cAAI,QAAQ,OAAO,CAAE,GAAE,QAAQ,KAAK;AAEpC,cAAI,MAAM,QAAQ;AAClB,cAAI,MAAM,QAAQ;AAElB,cAAIA,QAAO,QAAQ;AAInB,cAAI,SAAS,QAAQ;AAErB,cAAI,QAAQ,QAAQ;AAEpB,cAAI,UAAU,MAAM;AAClB,gBAAI,YAAY,MAAM,GAAG;AAEvB,oBAAM,OAAO;AACb,sBAAQ,kBAAkB;AAAA,YAC3B;AAED,gBAAI,YAAY,MAAM,GAAG;AACvB;AACE,uCAAuB,OAAO,GAAG;AAAA,cAClC;AAED,oBAAM,KAAK,OAAO;AAAA,YACnB;AAGD,gBAAI;AAEJ,gBAAI,QAAQ,QAAQ,QAAQ,KAAK,cAAc;AAC7C,6BAAe,QAAQ,KAAK;AAAA,YAC7B;AAED,iBAAK,YAAY,QAAQ;AACvB,kBAAI,eAAe,KAAK,QAAQ,QAAQ,KAAK,CAAC,eAAe,eAAe,QAAQ,GAAG;AACrF,oBAAI,OAAO,QAAQ,MAAM,UAAa,iBAAiB,QAAW;AAEhE,wBAAM,QAAQ,IAAI,aAAa,QAAQ;AAAA,gBACjD,OAAe;AACL,wBAAM,QAAQ,IAAI,OAAO,QAAQ;AAAA,gBAClC;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAID,cAAI,iBAAiB,UAAU,SAAS;AAExC,cAAI,mBAAmB,GAAG;AACxB,kBAAM,WAAW;AAAA,UACrB,WAAa,iBAAiB,GAAG;AAC7B,gBAAI,aAAa,MAAM,cAAc;AAErC,qBAASC,KAAI,GAAGA,KAAI,gBAAgBA,MAAK;AACvC,yBAAWA,EAAC,IAAI,UAAUA,KAAI,CAAC;AAAA,YAChC;AAED,kBAAM,WAAW;AAAA,UAClB;AAED,iBAAO,aAAa,QAAQ,MAAM,KAAK,KAAKD,OAAM,QAAQ,OAAO,KAAK;AAAA,QACvE;AASD,iBAAS,eAAe,QAAQ;AAC9B,iBAAO,OAAO,WAAW,YAAY,WAAW,QAAQ,OAAO,aAAa;AAAA,QAC7E;AAED,YAAI,YAAY;AAChB,YAAI,eAAe;AAQnB,iBAAS,OAAO,KAAK;AACnB,cAAI,cAAc;AAClB,cAAI,gBAAgB;AAAA,YAClB,KAAK;AAAA,YACL,KAAK;AAAA,UACT;AACE,cAAI,gBAAgB,IAAI,QAAQ,aAAa,SAAU,OAAO;AAC5D,mBAAO,cAAc,KAAK;AAAA,UAC9B,CAAG;AACD,iBAAO,MAAM;AAAA,QACd;AAOD,YAAI,mBAAmB;AACvB,YAAI,6BAA6B;AAEjC,iBAAS,sBAAsB,MAAM;AACnC,iBAAO,KAAK,QAAQ,4BAA4B,KAAK;AAAA,QACtD;AAUD,iBAAS,cAAc,SAASE,QAAO;AAGrC,cAAI,OAAO,YAAY,YAAY,YAAY,QAAQ,QAAQ,OAAO,MAAM;AAE1E;AACE,qCAAuB,QAAQ,GAAG;AAAA,YACnC;AAED,mBAAO,OAAO,KAAK,QAAQ,GAAG;AAAA,UAC/B;AAGD,iBAAOA,OAAM,SAAS,EAAE;AAAA,QACzB;AAED,iBAAS,aAAa,UAAU,OAAO,eAAe,WAAW,UAAU;AACzE,cAAI,OAAO,OAAO;AAElB,cAAI,SAAS,eAAe,SAAS,WAAW;AAE9C,uBAAW;AAAA,UACZ;AAED,cAAI,iBAAiB;AAErB,cAAI,aAAa,MAAM;AACrB,6BAAiB;AAAA,UACrB,OAAS;AACL,oBAAQ,MAAI;AAAA,cACV,KAAK;AAAA,cACL,KAAK;AACH,iCAAiB;AACjB;AAAA,cAEF,KAAK;AACH,wBAAQ,SAAS,UAAQ;AAAA,kBACvB,KAAK;AAAA,kBACL,KAAK;AACH,qCAAiB;AAAA,gBACpB;AAAA,YAEJ;AAAA,UACF;AAED,cAAI,gBAAgB;AAClB,gBAAI,SAAS;AACb,gBAAI,cAAc,SAAS,MAAM;AAGjC,gBAAI,WAAW,cAAc,KAAK,YAAY,cAAc,QAAQ,CAAC,IAAI;AAEzE,gBAAI,QAAQ,WAAW,GAAG;AACxB,kBAAI,kBAAkB;AAEtB,kBAAI,YAAY,MAAM;AACpB,kCAAkB,sBAAsB,QAAQ,IAAI;AAAA,cACrD;AAED,2BAAa,aAAa,OAAO,iBAAiB,IAAI,SAAUC,IAAG;AACjE,uBAAOA;AAAA,cACf,CAAO;AAAA,YACP,WAAe,eAAe,MAAM;AAC9B,kBAAI,eAAe,WAAW,GAAG;AAC/B;AAIE,sBAAI,YAAY,QAAQ,CAAC,UAAU,OAAO,QAAQ,YAAY,MAAM;AAClE,2CAAuB,YAAY,GAAG;AAAA,kBACvC;AAAA,gBACF;AAED,8BAAc;AAAA,kBAAmB;AAAA;AAAA;AAAA,kBAEjC;AAAA,mBACA,YAAY,QAAQ,CAAC,UAAU,OAAO,QAAQ,YAAY;AAAA;AAAA;AAAA,oBAE1D,sBAAsB,KAAK,YAAY,GAAG,IAAI;AAAA,sBAAM,MAAM;AAAA,gBAAQ;AAAA,cACnE;AAED,oBAAM,KAAK,WAAW;AAAA,YACvB;AAED,mBAAO;AAAA,UACR;AAED,cAAI;AACJ,cAAI;AACJ,cAAI,eAAe;AAEnB,cAAI,iBAAiB,cAAc,KAAK,YAAY,YAAY;AAEhE,cAAI,QAAQ,QAAQ,GAAG;AACrB,qBAASF,KAAI,GAAGA,KAAI,SAAS,QAAQA,MAAK;AACxC,sBAAQ,SAASA,EAAC;AAClB,yBAAW,iBAAiB,cAAc,OAAOA,EAAC;AAClD,8BAAgB,aAAa,OAAO,OAAO,eAAe,UAAU,QAAQ;AAAA,YAC7E;AAAA,UACL,OAAS;AACL,gBAAI,aAAa,cAAc,QAAQ;AAEvC,gBAAI,OAAO,eAAe,YAAY;AACpC,kBAAI,mBAAmB;AAEvB;AAEE,oBAAI,eAAe,iBAAiB,SAAS;AAC3C,sBAAI,CAAC,kBAAkB;AACrB,yBAAK,uFAA4F;AAAA,kBAClG;AAED,qCAAmB;AAAA,gBACpB;AAAA,cACF;AAED,kBAAI,WAAW,WAAW,KAAK,gBAAgB;AAC/C,kBAAI;AACJ,kBAAI,KAAK;AAET,qBAAO,EAAE,OAAO,SAAS,KAAI,GAAI,MAAM;AACrC,wBAAQ,KAAK;AACb,2BAAW,iBAAiB,cAAc,OAAO,IAAI;AACrD,gCAAgB,aAAa,OAAO,OAAO,eAAe,UAAU,QAAQ;AAAA,cAC7E;AAAA,YACP,WAAe,SAAS,UAAU;AAE5B,kBAAI,iBAAiB,OAAO,QAAQ;AACpC,oBAAM,IAAI,MAAM,qDAAqD,mBAAmB,oBAAoB,uBAAuB,OAAO,KAAK,QAAQ,EAAE,KAAK,IAAI,IAAI,MAAM,kBAAkB,2EAAqF;AAAA,YACpR;AAAA,UACF;AAED,iBAAO;AAAA,QACR;AAeD,iBAAS,YAAY,UAAU,MAAM,SAAS;AAC5C,cAAI,YAAY,MAAM;AACpB,mBAAO;AAAA,UACR;AAED,cAAI,SAAS,CAAA;AACb,cAAI,QAAQ;AACZ,uBAAa,UAAU,QAAQ,IAAI,IAAI,SAAU,OAAO;AACtD,mBAAO,KAAK,KAAK,SAAS,OAAO,OAAO;AAAA,UAC5C,CAAG;AACD,iBAAO;AAAA,QACR;AAYD,iBAAS,cAAc,UAAU;AAC/B,cAAIG,KAAI;AACR,sBAAY,UAAU,WAAY;AAChC,YAAAA;AAAA,UACJ,CAAG;AACD,iBAAOA;AAAA,QACR;AAcD,iBAAS,gBAAgB,UAAU,aAAa,gBAAgB;AAC9D,sBAAY,UAAU,WAAY;AAChC,wBAAY,MAAM,MAAM,SAAS;AAAA,UAClC,GAAE,cAAc;AAAA,QAClB;AASD,iBAAS,QAAQ,UAAU;AACzB,iBAAO,YAAY,UAAU,SAAU,OAAO;AAC5C,mBAAO;AAAA,UACR,CAAA,KAAK,CAAA;AAAA,QACP;AAiBD,iBAAS,UAAU,UAAU;AAC3B,cAAI,CAAC,eAAe,QAAQ,GAAG;AAC7B,kBAAM,IAAI,MAAM,uEAAuE;AAAA,UACxF;AAED,iBAAO;AAAA,QACR;AAED,iBAAS,cAAc,cAAc;AAGnC,cAAI,UAAU;AAAA,YACZ,UAAU;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,YAMV,eAAe;AAAA,YACf,gBAAgB;AAAA;AAAA;AAAA,YAGhB,cAAc;AAAA;AAAA,YAEd,UAAU;AAAA,YACV,UAAU;AAAA;AAAA,YAEV,eAAe;AAAA,YACf,aAAa;AAAA,UACjB;AACE,kBAAQ,WAAW;AAAA,YACjB,UAAU;AAAA,YACV,UAAU;AAAA,UACd;AACE,cAAI,4CAA4C;AAChD,cAAI,sCAAsC;AAC1C,cAAI,sCAAsC;AAE1C;AAIE,gBAAI,WAAW;AAAA,cACb,UAAU;AAAA,cACV,UAAU;AAAA,YAChB;AAEI,mBAAO,iBAAiB,UAAU;AAAA,cAChC,UAAU;AAAA,gBACR,KAAK,WAAY;AACf,sBAAI,CAAC,qCAAqC;AACxC,0DAAsC;AAEtC,0BAAM,0JAA+J;AAAA,kBACtK;AAED,yBAAO,QAAQ;AAAA,gBAChB;AAAA,gBACD,KAAK,SAAU,WAAW;AACxB,0BAAQ,WAAW;AAAA,gBACpB;AAAA,cACF;AAAA,cACD,eAAe;AAAA,gBACb,KAAK,WAAY;AACf,yBAAO,QAAQ;AAAA,gBAChB;AAAA,gBACD,KAAK,SAAU,eAAe;AAC5B,0BAAQ,gBAAgB;AAAA,gBACzB;AAAA,cACF;AAAA,cACD,gBAAgB;AAAA,gBACd,KAAK,WAAY;AACf,yBAAO,QAAQ;AAAA,gBAChB;AAAA,gBACD,KAAK,SAAU,gBAAgB;AAC7B,0BAAQ,iBAAiB;AAAA,gBAC1B;AAAA,cACF;AAAA,cACD,cAAc;AAAA,gBACZ,KAAK,WAAY;AACf,yBAAO,QAAQ;AAAA,gBAChB;AAAA,gBACD,KAAK,SAAU,cAAc;AAC3B,0BAAQ,eAAe;AAAA,gBACxB;AAAA,cACF;AAAA,cACD,UAAU;AAAA,gBACR,KAAK,WAAY;AACf,sBAAI,CAAC,2CAA2C;AAC9C,gEAA4C;AAE5C,0BAAM,0JAA+J;AAAA,kBACtK;AAED,yBAAO,QAAQ;AAAA,gBAChB;AAAA,cACF;AAAA,cACD,aAAa;AAAA,gBACX,KAAK,WAAY;AACf,yBAAO,QAAQ;AAAA,gBAChB;AAAA,gBACD,KAAK,SAAU,aAAa;AAC1B,sBAAI,CAAC,qCAAqC;AACxC,yBAAK,uIAA4I,WAAW;AAE5J,0DAAsC;AAAA,kBACvC;AAAA,gBACF;AAAA,cACF;AAAA,YACP,CAAK;AAED,oBAAQ,WAAW;AAAA,UACpB;AAED;AACE,oBAAQ,mBAAmB;AAC3B,oBAAQ,oBAAoB;AAAA,UAC7B;AAED,iBAAO;AAAA,QACR;AAED,YAAI,gBAAgB;AACpB,YAAI,UAAU;AACd,YAAI,WAAW;AACf,YAAI,WAAW;AAEf,iBAAS,gBAAgB,SAAS;AAChC,cAAI,QAAQ,YAAY,eAAe;AACrC,gBAAI,OAAO,QAAQ;AACnB,gBAAI,WAAW;AAMf,qBAAS,KAAK,SAAUC,eAAc;AACpC,kBAAI,QAAQ,YAAY,WAAW,QAAQ,YAAY,eAAe;AAEpE,oBAAI,WAAW;AACf,yBAAS,UAAU;AACnB,yBAAS,UAAUA;AAAA,cACpB;AAAA,YACF,GAAE,SAAUC,QAAO;AAClB,kBAAI,QAAQ,YAAY,WAAW,QAAQ,YAAY,eAAe;AAEpE,oBAAI,WAAW;AACf,yBAAS,UAAU;AACnB,yBAAS,UAAUA;AAAA,cACpB;AAAA,YACP,CAAK;AAED,gBAAI,QAAQ,YAAY,eAAe;AAGrC,kBAAI,UAAU;AACd,sBAAQ,UAAU;AAClB,sBAAQ,UAAU;AAAA,YACnB;AAAA,UACF;AAED,cAAI,QAAQ,YAAY,UAAU;AAChC,gBAAI,eAAe,QAAQ;AAE3B;AACE,kBAAI,iBAAiB,QAAW;AAC9B,sBAAM,qOAC2H,YAAY;AAAA,cAC9I;AAAA,YACF;AAED;AACE,kBAAI,EAAE,aAAa,eAAe;AAChC,sBAAM,yKAC0D,YAAY;AAAA,cAC7E;AAAA,YACF;AAED,mBAAO,aAAa;AAAA,UACxB,OAAS;AACL,kBAAM,QAAQ;AAAA,UACf;AAAA,QACF;AAED,iBAAS,KAAK,MAAM;AAClB,cAAI,UAAU;AAAA;AAAA,YAEZ,SAAS;AAAA,YACT,SAAS;AAAA,UACb;AACE,cAAI,WAAW;AAAA,YACb,UAAU;AAAA,YACV,UAAU;AAAA,YACV,OAAO;AAAA,UACX;AAEE;AAEE,gBAAI;AACJ,gBAAI;AAEJ,mBAAO,iBAAiB,UAAU;AAAA,cAChC,cAAc;AAAA,gBACZ,cAAc;AAAA,gBACd,KAAK,WAAY;AACf,yBAAO;AAAA,gBACR;AAAA,gBACD,KAAK,SAAU,iBAAiB;AAC9B,wBAAM,yLAAmM;AAEzM,iCAAe;AAGf,yBAAO,eAAe,UAAU,gBAAgB;AAAA,oBAC9C,YAAY;AAAA,kBACxB,CAAW;AAAA,gBACF;AAAA,cACF;AAAA,cACD,WAAW;AAAA,gBACT,cAAc;AAAA,gBACd,KAAK,WAAY;AACf,yBAAO;AAAA,gBACR;AAAA,gBACD,KAAK,SAAU,cAAc;AAC3B,wBAAM,sLAAgM;AAEtM,8BAAY;AAGZ,yBAAO,eAAe,UAAU,aAAa;AAAA,oBAC3C,YAAY;AAAA,kBACxB,CAAW;AAAA,gBACF;AAAA,cACF;AAAA,YACP,CAAK;AAAA,UACF;AAED,iBAAO;AAAA,QACR;AAED,iBAAS,WAAW,QAAQ;AAC1B;AACE,gBAAI,UAAU,QAAQ,OAAO,aAAa,iBAAiB;AACzD,oBAAM,qIAA+I;AAAA,YAC3J,WAAe,OAAO,WAAW,YAAY;AACvC,oBAAM,2DAA2D,WAAW,OAAO,SAAS,OAAO,MAAM;AAAA,YAC/G,OAAW;AACL,kBAAI,OAAO,WAAW,KAAK,OAAO,WAAW,GAAG;AAC9C,sBAAM,gFAAgF,OAAO,WAAW,IAAI,6CAA6C,6CAA6C;AAAA,cACvM;AAAA,YACF;AAED,gBAAI,UAAU,MAAM;AAClB,kBAAI,OAAO,gBAAgB,QAAQ,OAAO,aAAa,MAAM;AAC3D,sBAAM,oHAAyH;AAAA,cAChI;AAAA,YACF;AAAA,UACF;AAED,cAAI,cAAc;AAAA,YAChB,UAAU;AAAA,YACV;AAAA,UACJ;AAEE;AACE,gBAAI;AACJ,mBAAO,eAAe,aAAa,eAAe;AAAA,cAChD,YAAY;AAAA,cACZ,cAAc;AAAA,cACd,KAAK,WAAY;AACf,uBAAO;AAAA,cACR;AAAA,cACD,KAAK,SAAUC,OAAM;AACnB,0BAAUA;AAQV,oBAAI,CAAC,OAAO,QAAQ,CAAC,OAAO,aAAa;AACvC,yBAAO,cAAcA;AAAA,gBACtB;AAAA,cACF;AAAA,YACP,CAAK;AAAA,UACF;AAED,iBAAO;AAAA,QACR;AAED,YAAI;AAEJ;AACE,mCAAyB,OAAO,IAAI,wBAAwB;AAAA,QAC7D;AAED,iBAAS,mBAAmB,MAAM;AAChC,cAAI,OAAO,SAAS,YAAY,OAAO,SAAS,YAAY;AAC1D,mBAAO;AAAA,UACR;AAGD,cAAI,SAAS,uBAAuB,SAAS,uBAAuB,sBAAuB,SAAS,0BAA0B,SAAS,uBAAuB,SAAS,4BAA4B,sBAAuB,SAAS,wBAAwB,kBAAmB,sBAAuB,yBAA0B;AAC7T,mBAAO;AAAA,UACR;AAED,cAAI,OAAO,SAAS,YAAY,SAAS,MAAM;AAC7C,gBAAI,KAAK,aAAa,mBAAmB,KAAK,aAAa,mBAAmB,KAAK,aAAa,uBAAuB,KAAK,aAAa,sBAAsB,KAAK,aAAa;AAAA;AAAA;AAAA;AAAA,YAIjL,KAAK,aAAa,0BAA0B,KAAK,gBAAgB,QAAW;AAC1E,qBAAO;AAAA,YACR;AAAA,UACF;AAED,iBAAO;AAAA,QACR;AAED,iBAAS,KAAK,MAAMC,UAAS;AAC3B;AACE,gBAAI,CAAC,mBAAmB,IAAI,GAAG;AAC7B,oBAAM,sEAA2E,SAAS,OAAO,SAAS,OAAO,IAAI;AAAA,YACtH;AAAA,UACF;AAED,cAAI,cAAc;AAAA,YAChB,UAAU;AAAA,YACV;AAAA,YACA,SAASA,aAAY,SAAY,OAAOA;AAAA,UAC5C;AAEE;AACE,gBAAI;AACJ,mBAAO,eAAe,aAAa,eAAe;AAAA,cAChD,YAAY;AAAA,cACZ,cAAc;AAAA,cACd,KAAK,WAAY;AACf,uBAAO;AAAA,cACR;AAAA,cACD,KAAK,SAAUD,OAAM;AACnB,0BAAUA;AAQV,oBAAI,CAAC,KAAK,QAAQ,CAAC,KAAK,aAAa;AACnC,uBAAK,cAAcA;AAAA,gBACpB;AAAA,cACF;AAAA,YACP,CAAK;AAAA,UACF;AAED,iBAAO;AAAA,QACR;AAED,iBAAS,oBAAoB;AAC3B,cAAI,aAAa,uBAAuB;AAExC;AACE,gBAAI,eAAe,MAAM;AACvB,oBAAM,ibAA0c;AAAA,YACjd;AAAA,UACF;AAKD,iBAAO;AAAA,QACR;AACD,iBAAS,WAAW,SAAS;AAC3B,cAAI,aAAa;AAEjB;AAEE,gBAAI,QAAQ,aAAa,QAAW;AAClC,kBAAI,cAAc,QAAQ;AAG1B,kBAAI,YAAY,aAAa,SAAS;AACpC,sBAAM,yKAA8K;AAAA,cAC5L,WAAiB,YAAY,aAAa,SAAS;AAC3C,sBAAM,0GAA+G;AAAA,cACtH;AAAA,YACF;AAAA,UACF;AAED,iBAAO,WAAW,WAAW,OAAO;AAAA,QACrC;AACD,iBAAS,SAAS,cAAc;AAC9B,cAAI,aAAa;AACjB,iBAAO,WAAW,SAAS,YAAY;AAAA,QACxC;AACD,iBAAS,WAAW,SAAS,YAAY,MAAM;AAC7C,cAAI,aAAa;AACjB,iBAAO,WAAW,WAAW,SAAS,YAAY,IAAI;AAAA,QACvD;AACD,iBAAS,OAAO,cAAc;AAC5B,cAAI,aAAa;AACjB,iBAAO,WAAW,OAAO,YAAY;AAAA,QACtC;AACD,iBAAS,UAAU,QAAQ,MAAM;AAC/B,cAAI,aAAa;AACjB,iBAAO,WAAW,UAAU,QAAQ,IAAI;AAAA,QACzC;AACD,iBAAS,mBAAmB,QAAQ,MAAM;AACxC,cAAI,aAAa;AACjB,iBAAO,WAAW,mBAAmB,QAAQ,IAAI;AAAA,QAClD;AACD,iBAAS,gBAAgB,QAAQ,MAAM;AACrC,cAAI,aAAa;AACjB,iBAAO,WAAW,gBAAgB,QAAQ,IAAI;AAAA,QAC/C;AACD,iBAAS,YAAY,UAAU,MAAM;AACnC,cAAI,aAAa;AACjB,iBAAO,WAAW,YAAY,UAAU,IAAI;AAAA,QAC7C;AACD,iBAAS,QAAQ,QAAQ,MAAM;AAC7B,cAAI,aAAa;AACjB,iBAAO,WAAW,QAAQ,QAAQ,IAAI;AAAA,QACvC;AACD,iBAAS,oBAAoB,KAAK,QAAQ,MAAM;AAC9C,cAAI,aAAa;AACjB,iBAAO,WAAW,oBAAoB,KAAK,QAAQ,IAAI;AAAA,QACxD;AACD,iBAAS,cAAc,OAAO,aAAa;AACzC;AACE,gBAAI,aAAa;AACjB,mBAAO,WAAW,cAAc,OAAO,WAAW;AAAA,UACnD;AAAA,QACF;AACD,iBAAS,gBAAgB;AACvB,cAAI,aAAa;AACjB,iBAAO,WAAW;QACnB;AACD,iBAAS,iBAAiB,OAAO;AAC/B,cAAI,aAAa;AACjB,iBAAO,WAAW,iBAAiB,KAAK;AAAA,QACzC;AACD,iBAAS,QAAQ;AACf,cAAI,aAAa;AACjB,iBAAO,WAAW;QACnB;AACD,iBAAS,qBAAqB,WAAW,aAAa,mBAAmB;AACvE,cAAI,aAAa;AACjB,iBAAO,WAAW,qBAAqB,WAAW,aAAa,iBAAiB;AAAA,QACjF;AAMD,YAAI,gBAAgB;AACpB,YAAI;AACJ,YAAI;AACJ,YAAI;AACJ,YAAI;AACJ,YAAI;AACJ,YAAI;AACJ,YAAI;AAEJ,iBAAS,cAAc;AAAA,QAAE;AAEzB,oBAAY,qBAAqB;AACjC,iBAAS,cAAc;AACrB;AACE,gBAAI,kBAAkB,GAAG;AAEvB,wBAAU,QAAQ;AAClB,yBAAW,QAAQ;AACnB,yBAAW,QAAQ;AACnB,0BAAY,QAAQ;AACpB,0BAAY,QAAQ;AACpB,mCAAqB,QAAQ;AAC7B,6BAAe,QAAQ;AAEvB,kBAAI,QAAQ;AAAA,gBACV,cAAc;AAAA,gBACd,YAAY;AAAA,gBACZ,OAAO;AAAA,gBACP,UAAU;AAAA,cAClB;AAEM,qBAAO,iBAAiB,SAAS;AAAA,gBAC/B,MAAM;AAAA,gBACN,KAAK;AAAA,gBACL,MAAM;AAAA,gBACN,OAAO;AAAA,gBACP,OAAO;AAAA,gBACP,gBAAgB;AAAA,gBAChB,UAAU;AAAA,cAClB,CAAO;AAAA,YAEF;AAED;AAAA,UACD;AAAA,QACF;AACD,iBAAS,eAAe;AACtB;AACE;AAEA,gBAAI,kBAAkB,GAAG;AAEvB,kBAAI,QAAQ;AAAA,gBACV,cAAc;AAAA,gBACd,YAAY;AAAA,gBACZ,UAAU;AAAA,cAClB;AAEM,qBAAO,iBAAiB,SAAS;AAAA,gBAC/B,KAAK,OAAO,CAAE,GAAE,OAAO;AAAA,kBACrB,OAAO;AAAA,gBACjB,CAAS;AAAA,gBACD,MAAM,OAAO,CAAE,GAAE,OAAO;AAAA,kBACtB,OAAO;AAAA,gBACjB,CAAS;AAAA,gBACD,MAAM,OAAO,CAAE,GAAE,OAAO;AAAA,kBACtB,OAAO;AAAA,gBACjB,CAAS;AAAA,gBACD,OAAO,OAAO,CAAE,GAAE,OAAO;AAAA,kBACvB,OAAO;AAAA,gBACjB,CAAS;AAAA,gBACD,OAAO,OAAO,CAAE,GAAE,OAAO;AAAA,kBACvB,OAAO;AAAA,gBACjB,CAAS;AAAA,gBACD,gBAAgB,OAAO,CAAE,GAAE,OAAO;AAAA,kBAChC,OAAO;AAAA,gBACjB,CAAS;AAAA,gBACD,UAAU,OAAO,CAAE,GAAE,OAAO;AAAA,kBAC1B,OAAO;AAAA,gBACjB,CAAS;AAAA,cACT,CAAO;AAAA,YAEF;AAED,gBAAI,gBAAgB,GAAG;AACrB,oBAAM,8EAAmF;AAAA,YAC1F;AAAA,UACF;AAAA,QACF;AAED,YAAI,2BAA2B,qBAAqB;AACpD,YAAI;AACJ,iBAAS,8BAA8BA,OAAM,QAAQ,SAAS;AAC5D;AACE,gBAAI,WAAW,QAAW;AAExB,kBAAI;AACF,sBAAM,MAAK;AAAA,cACZ,SAAQR,IAAG;AACV,oBAAI,QAAQA,GAAE,MAAM,KAAI,EAAG,MAAM,cAAc;AAC/C,yBAAS,SAAS,MAAM,CAAC,KAAK;AAAA,cAC/B;AAAA,YACF;AAGD,mBAAO,OAAO,SAASQ;AAAA,UACxB;AAAA,QACF;AACD,YAAI,UAAU;AACd,YAAI;AAEJ;AACE,cAAI,kBAAkB,OAAO,YAAY,aAAa,UAAU;AAChE,gCAAsB,IAAI;QAC3B;AAED,iBAAS,6BAA6B,IAAI,WAAW;AAEnD,cAAK,CAAC,MAAM,SAAS;AACnB,mBAAO;AAAA,UACR;AAED;AACE,gBAAI,QAAQ,oBAAoB,IAAI,EAAE;AAEtC,gBAAI,UAAU,QAAW;AACvB,qBAAO;AAAA,YACR;AAAA,UACF;AAED,cAAI;AACJ,oBAAU;AACV,cAAI,4BAA4B,MAAM;AAEtC,gBAAM,oBAAoB;AAC1B,cAAI;AAEJ;AACE,iCAAqB,yBAAyB;AAG9C,qCAAyB,UAAU;AACnC;UACD;AAED,cAAI;AAEF,gBAAI,WAAW;AAEb,kBAAI,OAAO,WAAY;AACrB,sBAAM,MAAK;AAAA,cACnB;AAGM,qBAAO,eAAe,KAAK,WAAW,SAAS;AAAA,gBAC7C,KAAK,WAAY;AAGf,wBAAM,MAAK;AAAA,gBACZ;AAAA,cACT,CAAO;AAED,kBAAI,OAAO,YAAY,YAAY,QAAQ,WAAW;AAGpD,oBAAI;AACF,0BAAQ,UAAU,MAAM,CAAA,CAAE;AAAA,gBAC3B,SAAQR,IAAG;AACV,4BAAUA;AAAA,gBACX;AAED,wBAAQ,UAAU,IAAI,CAAE,GAAE,IAAI;AAAA,cACtC,OAAa;AACL,oBAAI;AACF,uBAAK,KAAI;AAAA,gBACV,SAAQA,IAAG;AACV,4BAAUA;AAAA,gBACX;AAED,mBAAG,KAAK,KAAK,SAAS;AAAA,cACvB;AAAA,YACP,OAAW;AACL,kBAAI;AACF,sBAAM,MAAK;AAAA,cACZ,SAAQA,IAAG;AACV,0BAAUA;AAAA,cACX;AAED;YACD;AAAA,UACF,SAAQ,QAAQ;AAEf,gBAAI,UAAU,WAAW,OAAO,OAAO,UAAU,UAAU;AAGzD,kBAAI,cAAc,OAAO,MAAM,MAAM,IAAI;AACzC,kBAAI,eAAe,QAAQ,MAAM,MAAM,IAAI;AAC3C,kBAAIU,KAAI,YAAY,SAAS;AAC7B,kBAAIN,KAAI,aAAa,SAAS;AAE9B,qBAAOM,MAAK,KAAKN,MAAK,KAAK,YAAYM,EAAC,MAAM,aAAaN,EAAC,GAAG;AAO7D,gBAAAA;AAAA,cACD;AAED,qBAAOM,MAAK,KAAKN,MAAK,GAAGM,MAAKN,MAAK;AAGjC,oBAAI,YAAYM,EAAC,MAAM,aAAaN,EAAC,GAAG;AAMtC,sBAAIM,OAAM,KAAKN,OAAM,GAAG;AACtB,uBAAG;AACD,sBAAAM;AACA,sBAAAN;AAGA,0BAAIA,KAAI,KAAK,YAAYM,EAAC,MAAM,aAAaN,EAAC,GAAG;AAE/C,4BAAI,SAAS,OAAO,YAAYM,EAAC,EAAE,QAAQ,YAAY,MAAM;AAK7D,4BAAI,GAAG,eAAe,OAAO,SAAS,aAAa,GAAG;AACpD,mCAAS,OAAO,QAAQ,eAAe,GAAG,WAAW;AAAA,wBACtD;AAED;AACE,8BAAI,OAAO,OAAO,YAAY;AAC5B,gDAAoB,IAAI,IAAI,MAAM;AAAA,0BACnC;AAAA,wBACF;AAGD,+BAAO;AAAA,sBACR;AAAA,oBACF,SAAQA,MAAK,KAAKN,MAAK;AAAA,kBACzB;AAED;AAAA,gBACD;AAAA,cACF;AAAA,YACF;AAAA,UACL,UAAY;AACR,sBAAU;AAEV;AACE,uCAAyB,UAAU;AACnC;YACD;AAED,kBAAM,oBAAoB;AAAA,UAC3B;AAGD,cAAII,QAAO,KAAK,GAAG,eAAe,GAAG,OAAO;AAC5C,cAAI,iBAAiBA,QAAO,8BAA8BA,KAAI,IAAI;AAElE;AACE,gBAAI,OAAO,OAAO,YAAY;AAC5B,kCAAoB,IAAI,IAAI,cAAc;AAAA,YAC3C;AAAA,UACF;AAED,iBAAO;AAAA,QACR;AACD,iBAAS,+BAA+B,IAAI,QAAQ,SAAS;AAC3D;AACE,mBAAO,6BAA6B,IAAI,KAAK;AAAA,UAC9C;AAAA,QACF;AAED,iBAAS,gBAAgBG,YAAW;AAClC,cAAI,YAAYA,WAAU;AAC1B,iBAAO,CAAC,EAAE,aAAa,UAAU;AAAA,QAClC;AAED,iBAAS,qCAAqC,MAAM,QAAQ,SAAS;AAEnE,cAAI,QAAQ,MAAM;AAChB,mBAAO;AAAA,UACR;AAED,cAAI,OAAO,SAAS,YAAY;AAC9B;AACE,qBAAO,6BAA6B,MAAM,gBAAgB,IAAI,CAAC;AAAA,YAChE;AAAA,UACF;AAED,cAAI,OAAO,SAAS,UAAU;AAC5B,mBAAO,8BAA8B,IAAI;AAAA,UAC1C;AAED,kBAAQ,MAAI;AAAA,YACV,KAAK;AACH,qBAAO,8BAA8B,UAAU;AAAA,YAEjD,KAAK;AACH,qBAAO,8BAA8B,cAAc;AAAA,UACtD;AAED,cAAI,OAAO,SAAS,UAAU;AAC5B,oBAAQ,KAAK,UAAQ;AAAA,cACnB,KAAK;AACH,uBAAO,+BAA+B,KAAK,MAAM;AAAA,cAEnD,KAAK;AAEH,uBAAO,qCAAqC,KAAK,MAAM,QAAQ,OAAO;AAAA,cAExE,KAAK,iBACH;AACE,oBAAI,gBAAgB;AACpB,oBAAI,UAAU,cAAc;AAC5B,oBAAI,OAAO,cAAc;AAEzB,oBAAI;AAEF,yBAAO,qCAAqC,KAAK,OAAO,GAAG,QAAQ,OAAO;AAAA,gBACtF,SAAmBX,IAAG;AAAA,gBAAE;AAAA,cACf;AAAA,YACJ;AAAA,UACF;AAED,iBAAO;AAAA,QACR;AAED,YAAI,qBAAqB,CAAA;AACzB,YAAI,2BAA2B,qBAAqB;AAEpD,iBAAS,8BAA8B,SAAS;AAC9C;AACE,gBAAI,SAAS;AACX,kBAAI,QAAQ,QAAQ;AACpB,kBAAI,QAAQ,qCAAqC,QAAQ,MAAM,QAAQ,SAAS,QAAQ,MAAM,OAAO,IAAI;AACzG,uCAAyB,mBAAmB,KAAK;AAAA,YACvD,OAAW;AACL,uCAAyB,mBAAmB,IAAI;AAAA,YACjD;AAAA,UACF;AAAA,QACF;AAED,iBAAS,eAAe,WAAW,QAAQ,UAAU,eAAe,SAAS;AAC3E;AAEE,gBAAI,MAAM,SAAS,KAAK,KAAK,cAAc;AAE3C,qBAAS,gBAAgB,WAAW;AAClC,kBAAI,IAAI,WAAW,YAAY,GAAG;AAChC,oBAAI,UAAU;AAId,oBAAI;AAGF,sBAAI,OAAO,UAAU,YAAY,MAAM,YAAY;AAEjD,wBAAI,MAAM,OAAO,iBAAiB,iBAAiB,OAAO,WAAW,YAAY,eAAe,+FAAoG,OAAO,UAAU,YAAY,IAAI,iGAAsG;AAC3U,wBAAI,OAAO;AACX,0BAAM;AAAA,kBACP;AAED,4BAAU,UAAU,YAAY,EAAE,QAAQ,cAAc,eAAe,UAAU,MAAM,8CAA8C;AAAA,gBACtI,SAAQ,IAAI;AACX,4BAAU;AAAA,gBACX;AAED,oBAAI,WAAW,EAAE,mBAAmB,QAAQ;AAC1C,gDAA8B,OAAO;AAErC,wBAAM,4RAAqT,iBAAiB,eAAe,UAAU,cAAc,OAAO,OAAO;AAEjY,gDAA8B,IAAI;AAAA,gBACnC;AAED,oBAAI,mBAAmB,SAAS,EAAE,QAAQ,WAAW,qBAAqB;AAGxE,qCAAmB,QAAQ,OAAO,IAAI;AACtC,gDAA8B,OAAO;AAErC,wBAAM,sBAAsB,UAAU,QAAQ,OAAO;AAErD,gDAA8B,IAAI;AAAA,gBACnC;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAED,iBAAS,gCAAgC,SAAS;AAChD;AACE,gBAAI,SAAS;AACX,kBAAI,QAAQ,QAAQ;AACpB,kBAAI,QAAQ,qCAAqC,QAAQ,MAAM,QAAQ,SAAS,QAAQ,MAAM,OAAO,IAAI;AACzG,iCAAmB,KAAK;AAAA,YAC9B,OAAW;AACL,iCAAmB,IAAI;AAAA,YACxB;AAAA,UACF;AAAA,QACF;AAED,YAAI;AAEJ;AACE,0CAAgC;AAAA,QACjC;AAED,iBAAS,8BAA8B;AACrC,cAAI,kBAAkB,SAAS;AAC7B,gBAAIQ,QAAO,yBAAyB,kBAAkB,QAAQ,IAAI;AAElE,gBAAIA,OAAM;AACR,qBAAO,qCAAqCA,QAAO;AAAA,YACpD;AAAA,UACF;AAED,iBAAO;AAAA,QACR;AAED,iBAAS,2BAA2B,QAAQ;AAC1C,cAAI,WAAW,QAAW;AACxB,gBAAI,WAAW,OAAO,SAAS,QAAQ,aAAa,EAAE;AACtD,gBAAI,aAAa,OAAO;AACxB,mBAAO,4BAA4B,WAAW,MAAM,aAAa;AAAA,UAClE;AAED,iBAAO;AAAA,QACR;AAED,iBAAS,mCAAmC,cAAc;AACxD,cAAI,iBAAiB,QAAQ,iBAAiB,QAAW;AACvD,mBAAO,2BAA2B,aAAa,QAAQ;AAAA,UACxD;AAED,iBAAO;AAAA,QACR;AAQD,YAAI,wBAAwB,CAAA;AAE5B,iBAAS,6BAA6B,YAAY;AAChD,cAAI,OAAO;AAEX,cAAI,CAAC,MAAM;AACT,gBAAI,aAAa,OAAO,eAAe,WAAW,aAAa,WAAW,eAAe,WAAW;AAEpG,gBAAI,YAAY;AACd,qBAAO,gDAAgD,aAAa;AAAA,YACrE;AAAA,UACF;AAED,iBAAO;AAAA,QACR;AAcD,iBAAS,oBAAoB,SAAS,YAAY;AAChD,cAAI,CAAC,QAAQ,UAAU,QAAQ,OAAO,aAAa,QAAQ,OAAO,MAAM;AACtE;AAAA,UACD;AAED,kBAAQ,OAAO,YAAY;AAC3B,cAAI,4BAA4B,6BAA6B,UAAU;AAEvE,cAAI,sBAAsB,yBAAyB,GAAG;AACpD;AAAA,UACD;AAED,gCAAsB,yBAAyB,IAAI;AAInD,cAAI,aAAa;AAEjB,cAAI,WAAW,QAAQ,UAAU,QAAQ,WAAW,kBAAkB,SAAS;AAE7E,yBAAa,iCAAiC,yBAAyB,QAAQ,OAAO,IAAI,IAAI;AAAA,UAC/F;AAED;AACE,4CAAgC,OAAO;AAEvC,kBAAM,6HAAkI,2BAA2B,UAAU;AAE7K,4CAAgC,IAAI;AAAA,UACrC;AAAA,QACF;AAYD,iBAAS,kBAAkB,MAAM,YAAY;AAC3C,cAAI,OAAO,SAAS,UAAU;AAC5B;AAAA,UACD;AAED,cAAI,QAAQ,IAAI,GAAG;AACjB,qBAASN,KAAI,GAAGA,KAAI,KAAK,QAAQA,MAAK;AACpC,kBAAI,QAAQ,KAAKA,EAAC;AAElB,kBAAI,eAAe,KAAK,GAAG;AACzB,oCAAoB,OAAO,UAAU;AAAA,cACtC;AAAA,YACF;AAAA,UACL,WAAa,eAAe,IAAI,GAAG;AAE/B,gBAAI,KAAK,QAAQ;AACf,mBAAK,OAAO,YAAY;AAAA,YACzB;AAAA,UACF,WAAU,MAAM;AACf,gBAAI,aAAa,cAAc,IAAI;AAEnC,gBAAI,OAAO,eAAe,YAAY;AAGpC,kBAAI,eAAe,KAAK,SAAS;AAC/B,oBAAI,WAAW,WAAW,KAAK,IAAI;AACnC,oBAAI;AAEJ,uBAAO,EAAE,OAAO,SAAS,KAAI,GAAI,MAAM;AACrC,sBAAI,eAAe,KAAK,KAAK,GAAG;AAC9B,wCAAoB,KAAK,OAAO,UAAU;AAAA,kBAC3C;AAAA,gBACF;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAAA,QACF;AASD,iBAAS,kBAAkB,SAAS;AAClC;AACE,gBAAI,OAAO,QAAQ;AAEnB,gBAAI,SAAS,QAAQ,SAAS,UAAa,OAAO,SAAS,UAAU;AACnE;AAAA,YACD;AAED,gBAAI;AAEJ,gBAAI,OAAO,SAAS,YAAY;AAC9B,0BAAY,KAAK;AAAA,YAClB,WAAU,OAAO,SAAS,aAAa,KAAK,aAAa;AAAA;AAAA,YAE1D,KAAK,aAAa,kBAAkB;AAClC,0BAAY,KAAK;AAAA,YACvB,OAAW;AACL;AAAA,YACD;AAED,gBAAI,WAAW;AAEb,kBAAIM,QAAO,yBAAyB,IAAI;AACxC,6BAAe,WAAW,QAAQ,OAAO,QAAQA,OAAM,OAAO;AAAA,YAC/D,WAAU,KAAK,cAAc,UAAa,CAAC,+BAA+B;AACzE,8CAAgC;AAEhC,kBAAI,QAAQ,yBAAyB,IAAI;AAEzC,oBAAM,uGAAuG,SAAS,SAAS;AAAA,YAChI;AAED,gBAAI,OAAO,KAAK,oBAAoB,cAAc,CAAC,KAAK,gBAAgB,sBAAsB;AAC5F,oBAAM,4HAAiI;AAAA,YACxI;AAAA,UACF;AAAA,QACF;AAOD,iBAAS,sBAAsB,UAAU;AACvC;AACE,gBAAI,OAAO,OAAO,KAAK,SAAS,KAAK;AAErC,qBAASN,KAAI,GAAGA,KAAI,KAAK,QAAQA,MAAK;AACpC,kBAAI,MAAM,KAAKA,EAAC;AAEhB,kBAAI,QAAQ,cAAc,QAAQ,OAAO;AACvC,gDAAgC,QAAQ;AAExC,sBAAM,4GAAiH,GAAG;AAE1H,gDAAgC,IAAI;AACpC;AAAA,cACD;AAAA,YACF;AAED,gBAAI,SAAS,QAAQ,MAAM;AACzB,8CAAgC,QAAQ;AAExC,oBAAM,uDAAuD;AAE7D,8CAAgC,IAAI;AAAA,YACrC;AAAA,UACF;AAAA,QACF;AACD,iBAAS,4BAA4B,MAAM,OAAO,UAAU;AAC1D,cAAI,YAAY,mBAAmB,IAAI;AAGvC,cAAI,CAAC,WAAW;AACd,gBAAI,OAAO;AAEX,gBAAI,SAAS,UAAa,OAAO,SAAS,YAAY,SAAS,QAAQ,OAAO,KAAK,IAAI,EAAE,WAAW,GAAG;AACrG,sBAAQ;AAAA,YACT;AAED,gBAAI,aAAa,mCAAmC,KAAK;AAEzD,gBAAI,YAAY;AACd,sBAAQ;AAAA,YACd,OAAW;AACL,sBAAQ,4BAA2B;AAAA,YACpC;AAED,gBAAI;AAEJ,gBAAI,SAAS,MAAM;AACjB,2BAAa;AAAA,YACnB,WAAe,QAAQ,IAAI,GAAG;AACxB,2BAAa;AAAA,YACd,WAAU,SAAS,UAAa,KAAK,aAAa,oBAAoB;AACrE,2BAAa,OAAO,yBAAyB,KAAK,IAAI,KAAK,aAAa;AACxE,qBAAO;AAAA,YACb,OAAW;AACL,2BAAa,OAAO;AAAA,YACrB;AAED;AACE,oBAAM,qJAA+J,YAAY,IAAI;AAAA,YACtL;AAAA,UACF;AAED,cAAI,UAAU,cAAc,MAAM,MAAM,SAAS;AAGjD,cAAI,WAAW,MAAM;AACnB,mBAAO;AAAA,UACR;AAOD,cAAI,WAAW;AACb,qBAASA,KAAI,GAAGA,KAAI,UAAU,QAAQA,MAAK;AACzC,gCAAkB,UAAUA,EAAC,GAAG,IAAI;AAAA,YACrC;AAAA,UACF;AAED,cAAI,SAAS,qBAAqB;AAChC,kCAAsB,OAAO;AAAA,UACjC,OAAS;AACL,8BAAkB,OAAO;AAAA,UAC1B;AAED,iBAAO;AAAA,QACR;AACD,YAAI,sCAAsC;AAC1C,iBAAS,4BAA4B,MAAM;AACzC,cAAI,mBAAmB,4BAA4B,KAAK,MAAM,IAAI;AAClE,2BAAiB,OAAO;AAExB;AACE,gBAAI,CAAC,qCAAqC;AACxC,oDAAsC;AAEtC,mBAAK,sJAAgK;AAAA,YACtK;AAGD,mBAAO,eAAe,kBAAkB,QAAQ;AAAA,cAC9C,YAAY;AAAA,cACZ,KAAK,WAAY;AACf,qBAAK,2FAAgG;AAErG,uBAAO,eAAe,MAAM,QAAQ;AAAA,kBAClC,OAAO;AAAA,gBACjB,CAAS;AACD,uBAAO;AAAA,cACR;AAAA,YACP,CAAK;AAAA,UACF;AAED,iBAAO;AAAA,QACR;AACD,iBAAS,2BAA2B,SAAS,OAAO,UAAU;AAC5D,cAAI,aAAa,aAAa,MAAM,MAAM,SAAS;AAEnD,mBAASA,KAAI,GAAGA,KAAI,UAAU,QAAQA,MAAK;AACzC,8BAAkB,UAAUA,EAAC,GAAG,WAAW,IAAI;AAAA,UAChD;AAED,4BAAkB,UAAU;AAC5B,iBAAO;AAAA,QACR;AAED,iBAAS,gBAAgB,OAAO,SAAS;AACvC,cAAI,iBAAiB,wBAAwB;AAC7C,kCAAwB,aAAa;AACrC,cAAI,oBAAoB,wBAAwB;AAEhD;AACE,oCAAwB,WAAW,iBAAiB,oBAAI,IAAG;AAAA,UAC5D;AAED,cAAI;AACF;UACJ,UAAY;AACR,oCAAwB,aAAa;AAErC;AACE,kBAAI,mBAAmB,QAAQ,kBAAkB,gBAAgB;AAC/D,oBAAI,qBAAqB,kBAAkB,eAAe;AAE1D,oBAAI,qBAAqB,IAAI;AAC3B,uBAAK,qMAA+M;AAAA,gBACrN;AAED,kCAAkB,eAAe;cAClC;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAED,YAAI,6BAA6B;AACjC,YAAI,kBAAkB;AACtB,iBAAS,YAAY,MAAM;AACzB,cAAI,oBAAoB,MAAM;AAC5B,gBAAI;AAGF,kBAAI,iBAAiB,YAAY,KAAK,OAAM,GAAI,MAAM,GAAG,CAAC;AAC1D,kBAAI,cAAc,UAAU,OAAO,aAAa;AAGhD,gCAAkB,YAAY,KAAK,QAAQ,QAAQ,EAAE;AAAA,YACtD,SAAQ,MAAM;AAIb,gCAAkB,SAAU,UAAU;AACpC;AACE,sBAAI,+BAA+B,OAAO;AACxC,iDAA6B;AAE7B,wBAAI,OAAO,mBAAmB,aAAa;AACzC,4BAAM,0NAAyO;AAAA,oBAChP;AAAA,kBACF;AAAA,gBACF;AAED,oBAAI,UAAU,IAAI;AAClB,wBAAQ,MAAM,YAAY;AAC1B,wBAAQ,MAAM,YAAY,MAAS;AAAA,cAC3C;AAAA,YACK;AAAA,UACF;AAED,iBAAO,gBAAgB,IAAI;AAAA,QAC5B;AAED,YAAI,gBAAgB;AACpB,YAAI,oBAAoB;AACxB,iBAAS,IAAI,UAAU;AACrB;AAGE,gBAAI,oBAAoB;AACxB;AAEA,gBAAI,qBAAqB,YAAY,MAAM;AAGzC,mCAAqB,UAAU;YAChC;AAED,gBAAI,uBAAuB,qBAAqB;AAChD,gBAAI;AAEJ,gBAAI;AAKF,mCAAqB,mBAAmB;AACxC,uBAAS,SAAQ;AAIjB,kBAAI,CAAC,wBAAwB,qBAAqB,yBAAyB;AACzE,oBAAI,QAAQ,qBAAqB;AAEjC,oBAAI,UAAU,MAAM;AAClB,uCAAqB,0BAA0B;AAC/C,gCAAc,KAAK;AAAA,gBACpB;AAAA,cACF;AAAA,YACF,SAAQK,QAAO;AACd,0BAAY,iBAAiB;AAC7B,oBAAMA;AAAA,YACZ,UAAc;AACR,mCAAqB,mBAAmB;AAAA,YACzC;AAED,gBAAI,WAAW,QAAQ,OAAO,WAAW,YAAY,OAAO,OAAO,SAAS,YAAY;AACtF,kBAAI,iBAAiB;AAGrB,kBAAI,aAAa;AACjB,kBAAI,WAAW;AAAA,gBACb,MAAM,SAAU,SAAS,QAAQ;AAC/B,+BAAa;AACb,iCAAe,KAAK,SAAUK,cAAa;AACzC,gCAAY,iBAAiB;AAE7B,wBAAI,kBAAkB,GAAG;AAGvB,mDAA6BA,cAAa,SAAS,MAAM;AAAA,oBACvE,OAAmB;AACL,8BAAQA,YAAW;AAAA,oBACpB;AAAA,kBACF,GAAE,SAAUL,QAAO;AAElB,gCAAY,iBAAiB;AAC7B,2BAAOA,MAAK;AAAA,kBACxB,CAAW;AAAA,gBACF;AAAA,cACT;AAEM;AACE,oBAAI,CAAC,qBAAqB,OAAO,YAAY,aAAa;AAExD,0BAAQ,QAAO,EAAG,KAAK,WAAY;AAAA,kBAAE,CAAA,EAAE,KAAK,WAAY;AACtD,wBAAI,CAAC,YAAY;AACf,0CAAoB;AAEpB,4BAAM,mMAAuN;AAAA,oBAC9N;AAAA,kBACb,CAAW;AAAA,gBACF;AAAA,cACF;AAED,qBAAO;AAAA,YACb,OAAW;AACL,kBAAI,cAAc;AAGlB,0BAAY,iBAAiB;AAE7B,kBAAI,kBAAkB,GAAG;AAEvB,oBAAI,SAAS,qBAAqB;AAElC,oBAAI,WAAW,MAAM;AACnB,gCAAc,MAAM;AACpB,uCAAqB,UAAU;AAAA,gBAChC;AAID,oBAAI,YAAY;AAAA,kBACd,MAAM,SAAU,SAAS,QAAQ;AAI/B,wBAAI,qBAAqB,YAAY,MAAM;AAEzC,2CAAqB,UAAU;AAC/B,mDAA6B,aAAa,SAAS,MAAM;AAAA,oBACvE,OAAmB;AACL,8BAAQ,WAAW;AAAA,oBACpB;AAAA,kBACF;AAAA,gBACX;AACQ,uBAAO;AAAA,cACf,OAAa;AAGL,oBAAI,aAAa;AAAA,kBACf,MAAM,SAAU,SAAS,QAAQ;AAC/B,4BAAQ,WAAW;AAAA,kBACpB;AAAA,gBACX;AACQ,uBAAO;AAAA,cACR;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAED,iBAAS,YAAY,mBAAmB;AACtC;AACE,gBAAI,sBAAsB,gBAAgB,GAAG;AAC3C,oBAAM,kIAAuI;AAAA,YAC9I;AAED,4BAAgB;AAAA,UACjB;AAAA,QACF;AAED,iBAAS,6BAA6B,aAAa,SAAS,QAAQ;AAClE;AACE,gBAAI,QAAQ,qBAAqB;AAEjC,gBAAI,UAAU,MAAM;AAClB,kBAAI;AACF,8BAAc,KAAK;AACnB,4BAAY,WAAY;AACtB,sBAAI,MAAM,WAAW,GAAG;AAEtB,yCAAqB,UAAU;AAC/B,4BAAQ,WAAW;AAAA,kBAC/B,OAAiB;AAEL,iDAA6B,aAAa,SAAS,MAAM;AAAA,kBAC1D;AAAA,gBACX,CAAS;AAAA,cACF,SAAQA,QAAO;AACd,uBAAOA,MAAK;AAAA,cACb;AAAA,YACP,OAAW;AACL,sBAAQ,WAAW;AAAA,YACpB;AAAA,UACF;AAAA,QACF;AAED,YAAI,aAAa;AAEjB,iBAAS,cAAc,OAAO;AAC5B;AACE,gBAAI,CAAC,YAAY;AAEf,2BAAa;AACb,kBAAIL,KAAI;AAER,kBAAI;AACF,uBAAOA,KAAI,MAAM,QAAQA,MAAK;AAC5B,sBAAI,WAAW,MAAMA,EAAC;AAEtB,qBAAG;AACD,+BAAW,SAAS,IAAI;AAAA,kBACpC,SAAmB,aAAa;AAAA,gBACvB;AAED,sBAAM,SAAS;AAAA,cAChB,SAAQK,QAAO;AAEd,wBAAQ,MAAM,MAAML,KAAI,CAAC;AACzB,sBAAMK;AAAA,cACd,UAAgB;AACR,6BAAa;AAAA,cACd;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAED,YAAI,kBAAmB;AACvB,YAAI,iBAAkB;AACtB,YAAI,gBAAiB;AACrB,YAAI,WAAW;AAAA,UACb,KAAK;AAAA,UACL,SAAS;AAAA,UACT,OAAO;AAAA,UACP;AAAA,UACA,MAAM;AAAA,QACR;AAEA,gBAAA,WAAmB;AACnB,gBAAA,YAAoB;AACpB,gBAAA,WAAmB;AACnB,gBAAA,WAAmB;AACnB,gBAAA,gBAAwB;AACxB,gBAAA,aAAqB;AACrB,gBAAA,WAAmB;AACnB,gBAAA,qDAA6D;AAC7D,gBAAA,eAAuB;AACvB,gBAAA,gBAAwB;AACxB,gBAAA,gBAAwB;AACxB,gBAAA,gBAAwB;AACxB,gBAAA,YAAoB;AACpB,gBAAA,aAAqB;AACrB,gBAAA,iBAAyB;AACzB,gBAAA,OAAe;AACf,gBAAA,OAAe;AACf,gBAAA,kBAA0B;AAC1B,gBAAA,eAAuB;AACvB,gBAAA,cAAsB;AACtB,gBAAA,aAAqB;AACrB,gBAAA,gBAAwB;AACxB,gBAAA,mBAA2B;AAC3B,gBAAA,YAAoB;AACpB,gBAAA,QAAgB;AAChB,gBAAA,sBAA8B;AAC9B,gBAAA,qBAA6B;AAC7B,gBAAA,kBAA0B;AAC1B,gBAAA,UAAkB;AAClB,gBAAA,aAAqB;AACrB,gBAAA,SAAiB;AACjB,gBAAA,WAAmB;AACnB,gBAAA,uBAA+B;AAC/B,gBAAA,gBAAwB;AACxB,gBAAA,UAAkB;AAElB,YACE,OAAO,mCAAmC,eAC1C,OAAO,+BAA+B,+BACpC,YACF;AACA,yCAA+B,2BAA2B,IAAI,MAAK,CAAE;AAAA,QACtE;AAAA,MAED;IACA;AAAA;;AC9qFO;AACLM,UAAA,UAAiBC;AAAAA,EACnB;;;;;;;;;;;;ACM2C;AACzC,KAAC,WAAW;AAGd,UAAIC,SAAQD;AAMZ,UAAI,qBAAqB,OAAO,IAAI,eAAe;AACnD,UAAI,oBAAoB,OAAO,IAAI,cAAc;AACjD,UAAI,sBAAsB,OAAO,IAAI,gBAAgB;AACrD,UAAI,yBAAyB,OAAO,IAAI,mBAAmB;AAC3D,UAAI,sBAAsB,OAAO,IAAI,gBAAgB;AACrD,UAAI,sBAAsB,OAAO,IAAI,gBAAgB;AACrD,UAAI,qBAAqB,OAAO,IAAI,eAAe;AACnD,UAAI,yBAAyB,OAAO,IAAI,mBAAmB;AAC3D,UAAI,sBAAsB,OAAO,IAAI,gBAAgB;AACrD,UAAI,2BAA2B,OAAO,IAAI,qBAAqB;AAC/D,UAAI,kBAAkB,OAAO,IAAI,YAAY;AAC7C,UAAI,kBAAkB,OAAO,IAAI,YAAY;AAC7C,UAAI,uBAAuB,OAAO,IAAI,iBAAiB;AACvD,UAAI,wBAAwB,OAAO;AACnC,UAAI,uBAAuB;AAC3B,eAAS,cAAc,eAAe;AACpC,YAAI,kBAAkB,QAAQ,OAAO,kBAAkB,UAAU;AAC/D,iBAAO;AAAA,QACR;AAED,YAAI,gBAAgB,yBAAyB,cAAc,qBAAqB,KAAK,cAAc,oBAAoB;AAEvH,YAAI,OAAO,kBAAkB,YAAY;AACvC,iBAAO;AAAA,QACR;AAED,eAAO;AAAA,MACT;AAEA,UAAI,uBAAuBC,OAAM;AAEjC,eAAS,MAAM,QAAQ;AACrB;AACE;AACE,qBAAS,QAAQ,UAAU,QAAQ,OAAO,IAAI,MAAM,QAAQ,IAAI,QAAQ,IAAI,CAAC,GAAG,QAAQ,GAAG,QAAQ,OAAO,SAAS;AACjH,mBAAK,QAAQ,CAAC,IAAI,UAAU,KAAK;AAAA,YAClC;AAED,yBAAa,SAAS,QAAQ,IAAI;AAAA,UACnC;AAAA,QACF;AAAA,MACH;AAEA,eAAS,aAAa,OAAO,QAAQ,MAAM;AAGzC;AACE,cAAInB,0BAAyB,qBAAqB;AAClD,cAAI,QAAQA,wBAAuB;AAEnC,cAAI,UAAU,IAAI;AAChB,sBAAU;AACV,mBAAO,KAAK,OAAO,CAAC,KAAK,CAAC;AAAA,UAC3B;AAGD,cAAI,iBAAiB,KAAK,IAAI,SAAU,MAAM;AAC5C,mBAAO,OAAO,IAAI;AAAA,UACxB,CAAK;AAED,yBAAe,QAAQ,cAAc,MAAM;AAI3C,mBAAS,UAAU,MAAM,KAAK,QAAQ,KAAK,GAAG,SAAS,cAAc;AAAA,QACtE;AAAA,MACH;AAIA,UAAI,iBAAiB;AACrB,UAAI,qBAAqB;AACzB,UAAI,0BAA0B;AAE9B,UAAI,qBAAqB;AAIzB,UAAI,qBAAqB;AAEzB,UAAI;AAEJ;AACE,iCAAyB,OAAO,IAAI,wBAAwB;AAAA,MAC9D;AAEA,eAAS,mBAAmB,MAAM;AAChC,YAAI,OAAO,SAAS,YAAY,OAAO,SAAS,YAAY;AAC1D,iBAAO;AAAA,QACR;AAGD,YAAI,SAAS,uBAAuB,SAAS,uBAAuB,sBAAuB,SAAS,0BAA0B,SAAS,uBAAuB,SAAS,4BAA4B,sBAAuB,SAAS,wBAAwB,kBAAmB,sBAAuB,yBAA0B;AAC7T,iBAAO;AAAA,QACR;AAED,YAAI,OAAO,SAAS,YAAY,SAAS,MAAM;AAC7C,cAAI,KAAK,aAAa,mBAAmB,KAAK,aAAa,mBAAmB,KAAK,aAAa,uBAAuB,KAAK,aAAa,sBAAsB,KAAK,aAAa;AAAA;AAAA;AAAA;AAAA,UAIjL,KAAK,aAAa,0BAA0B,KAAK,gBAAgB,QAAW;AAC1E,mBAAO;AAAA,UACR;AAAA,QACF;AAED,eAAO;AAAA,MACT;AAEA,eAAS,eAAe,WAAW,WAAW,aAAa;AACzD,YAAI,cAAc,UAAU;AAE5B,YAAI,aAAa;AACf,iBAAO;AAAA,QACR;AAED,YAAI,eAAe,UAAU,eAAe,UAAU,QAAQ;AAC9D,eAAO,iBAAiB,KAAK,cAAc,MAAM,eAAe,MAAM;AAAA,MACxE;AAGA,eAAS,eAAe,MAAM;AAC5B,eAAO,KAAK,eAAe;AAAA,MAC7B;AAGA,eAAS,yBAAyB,MAAM;AACtC,YAAI,QAAQ,MAAM;AAEhB,iBAAO;AAAA,QACR;AAED;AACE,cAAI,OAAO,KAAK,QAAQ,UAAU;AAChC,kBAAM,mHAAwH;AAAA,UAC/H;AAAA,QACF;AAED,YAAI,OAAO,SAAS,YAAY;AAC9B,iBAAO,KAAK,eAAe,KAAK,QAAQ;AAAA,QACzC;AAED,YAAI,OAAO,SAAS,UAAU;AAC5B,iBAAO;AAAA,QACR;AAED,gBAAQ,MAAI;AAAA,UACV,KAAK;AACH,mBAAO;AAAA,UAET,KAAK;AACH,mBAAO;AAAA,UAET,KAAK;AACH,mBAAO;AAAA,UAET,KAAK;AACH,mBAAO;AAAA,UAET,KAAK;AACH,mBAAO;AAAA,UAET,KAAK;AACH,mBAAO;AAAA,QAEV;AAED,YAAI,OAAO,SAAS,UAAU;AAC5B,kBAAQ,KAAK,UAAQ;AAAA,YACnB,KAAK;AACH,kBAAI,UAAU;AACd,qBAAO,eAAe,OAAO,IAAI;AAAA,YAEnC,KAAK;AACH,kBAAI,WAAW;AACf,qBAAO,eAAe,SAAS,QAAQ,IAAI;AAAA,YAE7C,KAAK;AACH,qBAAO,eAAe,MAAM,KAAK,QAAQ,YAAY;AAAA,YAEvD,KAAK;AACH,kBAAI,YAAY,KAAK,eAAe;AAEpC,kBAAI,cAAc,MAAM;AACtB,uBAAO;AAAA,cACR;AAED,qBAAO,yBAAyB,KAAK,IAAI,KAAK;AAAA,YAEhD,KAAK,iBACH;AACE,kBAAI,gBAAgB;AACpB,kBAAI,UAAU,cAAc;AAC5B,kBAAI,OAAO,cAAc;AAEzB,kBAAI;AACF,uBAAO,yBAAyB,KAAK,OAAO,CAAC;AAAA,cAC9C,SAAQI,IAAG;AACV,uBAAO;AAAA,cACR;AAAA,YACF;AAAA,UAGJ;AAAA,QACF;AAED,eAAO;AAAA,MACT;AAEA,UAAI,SAAS,OAAO;AAMpB,UAAI,gBAAgB;AACpB,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AAEJ,eAAS,cAAc;AAAA,MAAE;AAEzB,kBAAY,qBAAqB;AACjC,eAAS,cAAc;AACrB;AACE,cAAI,kBAAkB,GAAG;AAEvB,sBAAU,QAAQ;AAClB,uBAAW,QAAQ;AACnB,uBAAW,QAAQ;AACnB,wBAAY,QAAQ;AACpB,wBAAY,QAAQ;AACpB,iCAAqB,QAAQ;AAC7B,2BAAe,QAAQ;AAEvB,gBAAI,QAAQ;AAAA,cACV,cAAc;AAAA,cACd,YAAY;AAAA,cACZ,OAAO;AAAA,cACP,UAAU;AAAA,YAClB;AAEM,mBAAO,iBAAiB,SAAS;AAAA,cAC/B,MAAM;AAAA,cACN,KAAK;AAAA,cACL,MAAM;AAAA,cACN,OAAO;AAAA,cACP,OAAO;AAAA,cACP,gBAAgB;AAAA,cAChB,UAAU;AAAA,YAClB,CAAO;AAAA,UAEF;AAED;AAAA,QACD;AAAA,MACH;AACA,eAAS,eAAe;AACtB;AACE;AAEA,cAAI,kBAAkB,GAAG;AAEvB,gBAAI,QAAQ;AAAA,cACV,cAAc;AAAA,cACd,YAAY;AAAA,cACZ,UAAU;AAAA,YAClB;AAEM,mBAAO,iBAAiB,SAAS;AAAA,cAC/B,KAAK,OAAO,CAAE,GAAE,OAAO;AAAA,gBACrB,OAAO;AAAA,cACjB,CAAS;AAAA,cACD,MAAM,OAAO,CAAE,GAAE,OAAO;AAAA,gBACtB,OAAO;AAAA,cACjB,CAAS;AAAA,cACD,MAAM,OAAO,CAAE,GAAE,OAAO;AAAA,gBACtB,OAAO;AAAA,cACjB,CAAS;AAAA,cACD,OAAO,OAAO,CAAE,GAAE,OAAO;AAAA,gBACvB,OAAO;AAAA,cACjB,CAAS;AAAA,cACD,OAAO,OAAO,CAAE,GAAE,OAAO;AAAA,gBACvB,OAAO;AAAA,cACjB,CAAS;AAAA,cACD,gBAAgB,OAAO,CAAE,GAAE,OAAO;AAAA,gBAChC,OAAO;AAAA,cACjB,CAAS;AAAA,cACD,UAAU,OAAO,CAAE,GAAE,OAAO;AAAA,gBAC1B,OAAO;AAAA,cACjB,CAAS;AAAA,YACT,CAAO;AAAA,UAEF;AAED,cAAI,gBAAgB,GAAG;AACrB,kBAAM,8EAAmF;AAAA,UAC1F;AAAA,QACF;AAAA,MACH;AAEA,UAAI,yBAAyB,qBAAqB;AAClD,UAAI;AACJ,eAAS,8BAA8BQ,OAAM,QAAQ,SAAS;AAC5D;AACE,cAAI,WAAW,QAAW;AAExB,gBAAI;AACF,oBAAM,MAAK;AAAA,YACZ,SAAQR,IAAG;AACV,kBAAI,QAAQA,GAAE,MAAM,KAAI,EAAG,MAAM,cAAc;AAC/C,uBAAS,SAAS,MAAM,CAAC,KAAK;AAAA,YAC/B;AAAA,UACF;AAGD,iBAAO,OAAO,SAASQ;AAAA,QACxB;AAAA,MACH;AACA,UAAI,UAAU;AACd,UAAI;AAEJ;AACE,YAAI,kBAAkB,OAAO,YAAY,aAAa,UAAU;AAChE,8BAAsB,IAAI;MAC5B;AAEA,eAAS,6BAA6B,IAAI,WAAW;AAEnD,YAAK,CAAC,MAAM,SAAS;AACnB,iBAAO;AAAA,QACR;AAED;AACE,cAAI,QAAQ,oBAAoB,IAAI,EAAE;AAEtC,cAAI,UAAU,QAAW;AACvB,mBAAO;AAAA,UACR;AAAA,QACF;AAED,YAAI;AACJ,kBAAU;AACV,YAAI,4BAA4B,MAAM;AAEtC,cAAM,oBAAoB;AAC1B,YAAI;AAEJ;AACE,+BAAqB,uBAAuB;AAG5C,iCAAuB,UAAU;AACjC;QACD;AAED,YAAI;AAEF,cAAI,WAAW;AAEb,gBAAI,OAAO,WAAY;AACrB,oBAAM,MAAK;AAAA,YACnB;AAGM,mBAAO,eAAe,KAAK,WAAW,SAAS;AAAA,cAC7C,KAAK,WAAY;AAGf,sBAAM,MAAK;AAAA,cACZ;AAAA,YACT,CAAO;AAED,gBAAI,OAAO,YAAY,YAAY,QAAQ,WAAW;AAGpD,kBAAI;AACF,wBAAQ,UAAU,MAAM,CAAA,CAAE;AAAA,cAC3B,SAAQR,IAAG;AACV,0BAAUA;AAAA,cACX;AAED,sBAAQ,UAAU,IAAI,CAAE,GAAE,IAAI;AAAA,YACtC,OAAa;AACL,kBAAI;AACF,qBAAK,KAAI;AAAA,cACV,SAAQA,IAAG;AACV,0BAAUA;AAAA,cACX;AAED,iBAAG,KAAK,KAAK,SAAS;AAAA,YACvB;AAAA,UACP,OAAW;AACL,gBAAI;AACF,oBAAM,MAAK;AAAA,YACZ,SAAQA,IAAG;AACV,wBAAUA;AAAA,YACX;AAED;UACD;AAAA,QACF,SAAQ,QAAQ;AAEf,cAAI,UAAU,WAAW,OAAO,OAAO,UAAU,UAAU;AAGzD,gBAAI,cAAc,OAAO,MAAM,MAAM,IAAI;AACzC,gBAAI,eAAe,QAAQ,MAAM,MAAM,IAAI;AAC3C,gBAAIU,KAAI,YAAY,SAAS;AAC7B,gBAAIN,KAAI,aAAa,SAAS;AAE9B,mBAAOM,MAAK,KAAKN,MAAK,KAAK,YAAYM,EAAC,MAAM,aAAaN,EAAC,GAAG;AAO7D,cAAAA;AAAA,YACD;AAED,mBAAOM,MAAK,KAAKN,MAAK,GAAGM,MAAKN,MAAK;AAGjC,kBAAI,YAAYM,EAAC,MAAM,aAAaN,EAAC,GAAG;AAMtC,oBAAIM,OAAM,KAAKN,OAAM,GAAG;AACtB,qBAAG;AACD,oBAAAM;AACA,oBAAAN;AAGA,wBAAIA,KAAI,KAAK,YAAYM,EAAC,MAAM,aAAaN,EAAC,GAAG;AAE/C,0BAAI,SAAS,OAAO,YAAYM,EAAC,EAAE,QAAQ,YAAY,MAAM;AAK7D,0BAAI,GAAG,eAAe,OAAO,SAAS,aAAa,GAAG;AACpD,iCAAS,OAAO,QAAQ,eAAe,GAAG,WAAW;AAAA,sBACtD;AAED;AACE,4BAAI,OAAO,OAAO,YAAY;AAC5B,8CAAoB,IAAI,IAAI,MAAM;AAAA,wBACnC;AAAA,sBACF;AAGD,6BAAO;AAAA,oBACR;AAAA,kBACF,SAAQA,MAAK,KAAKN,MAAK;AAAA,gBACzB;AAED;AAAA,cACD;AAAA,YACF;AAAA,UACF;AAAA,QACL,UAAY;AACR,oBAAU;AAEV;AACE,mCAAuB,UAAU;AACjC;UACD;AAED,gBAAM,oBAAoB;AAAA,QAC3B;AAGD,YAAII,QAAO,KAAK,GAAG,eAAe,GAAG,OAAO;AAC5C,YAAI,iBAAiBA,QAAO,8BAA8BA,KAAI,IAAI;AAElE;AACE,cAAI,OAAO,OAAO,YAAY;AAC5B,gCAAoB,IAAI,IAAI,cAAc;AAAA,UAC3C;AAAA,QACF;AAED,eAAO;AAAA,MACT;AACA,eAAS,+BAA+B,IAAI,QAAQ,SAAS;AAC3D;AACE,iBAAO,6BAA6B,IAAI,KAAK;AAAA,QAC9C;AAAA,MACH;AAEA,eAAS,gBAAgB,WAAW;AAClC,YAAI,YAAY,UAAU;AAC1B,eAAO,CAAC,EAAE,aAAa,UAAU;AAAA,MACnC;AAEA,eAAS,qCAAqC,MAAM,QAAQ,SAAS;AAEnE,YAAI,QAAQ,MAAM;AAChB,iBAAO;AAAA,QACR;AAED,YAAI,OAAO,SAAS,YAAY;AAC9B;AACE,mBAAO,6BAA6B,MAAM,gBAAgB,IAAI,CAAC;AAAA,UAChE;AAAA,QACF;AAED,YAAI,OAAO,SAAS,UAAU;AAC5B,iBAAO,8BAA8B,IAAI;AAAA,QAC1C;AAED,gBAAQ,MAAI;AAAA,UACV,KAAK;AACH,mBAAO,8BAA8B,UAAU;AAAA,UAEjD,KAAK;AACH,mBAAO,8BAA8B,cAAc;AAAA,QACtD;AAED,YAAI,OAAO,SAAS,UAAU;AAC5B,kBAAQ,KAAK,UAAQ;AAAA,YACnB,KAAK;AACH,qBAAO,+BAA+B,KAAK,MAAM;AAAA,YAEnD,KAAK;AAEH,qBAAO,qCAAqC,KAAK,MAAM,QAAQ,OAAO;AAAA,YAExE,KAAK,iBACH;AACE,kBAAI,gBAAgB;AACpB,kBAAI,UAAU,cAAc;AAC5B,kBAAI,OAAO,cAAc;AAEzB,kBAAI;AAEF,uBAAO,qCAAqC,KAAK,OAAO,GAAG,QAAQ,OAAO;AAAA,cACtF,SAAmBR,IAAG;AAAA,cAAE;AAAA,YACf;AAAA,UACJ;AAAA,QACF;AAED,eAAO;AAAA,MACT;AAEA,UAAI,iBAAiB,OAAO,UAAU;AAEtC,UAAI,qBAAqB,CAAA;AACzB,UAAI,yBAAyB,qBAAqB;AAElD,eAAS,8BAA8B,SAAS;AAC9C;AACE,cAAI,SAAS;AACX,gBAAI,QAAQ,QAAQ;AACpB,gBAAI,QAAQ,qCAAqC,QAAQ,MAAM,QAAQ,SAAS,QAAQ,MAAM,OAAO,IAAI;AACzG,mCAAuB,mBAAmB,KAAK;AAAA,UACrD,OAAW;AACL,mCAAuB,mBAAmB,IAAI;AAAA,UAC/C;AAAA,QACF;AAAA,MACH;AAEA,eAAS,eAAe,WAAW,QAAQ,UAAU,eAAe,SAAS;AAC3E;AAEE,cAAI,MAAM,SAAS,KAAK,KAAK,cAAc;AAE3C,mBAAS,gBAAgB,WAAW;AAClC,gBAAI,IAAI,WAAW,YAAY,GAAG;AAChC,kBAAI,UAAU;AAId,kBAAI;AAGF,oBAAI,OAAO,UAAU,YAAY,MAAM,YAAY;AAEjD,sBAAI,MAAM,OAAO,iBAAiB,iBAAiB,OAAO,WAAW,YAAY,eAAe,+FAAoG,OAAO,UAAU,YAAY,IAAI,iGAAsG;AAC3U,sBAAI,OAAO;AACX,wBAAM;AAAA,gBACP;AAED,0BAAU,UAAU,YAAY,EAAE,QAAQ,cAAc,eAAe,UAAU,MAAM,8CAA8C;AAAA,cACtI,SAAQ,IAAI;AACX,0BAAU;AAAA,cACX;AAED,kBAAI,WAAW,EAAE,mBAAmB,QAAQ;AAC1C,8CAA8B,OAAO;AAErC,sBAAM,4RAAqT,iBAAiB,eAAe,UAAU,cAAc,OAAO,OAAO;AAEjY,8CAA8B,IAAI;AAAA,cACnC;AAED,kBAAI,mBAAmB,SAAS,EAAE,QAAQ,WAAW,qBAAqB;AAGxE,mCAAmB,QAAQ,OAAO,IAAI;AACtC,8CAA8B,OAAO;AAErC,sBAAM,sBAAsB,UAAU,QAAQ,OAAO;AAErD,8CAA8B,IAAI;AAAA,cACnC;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACH;AAEA,UAAI,cAAc,MAAM;AAExB,eAAS,QAAQH,IAAG;AAClB,eAAO,YAAYA,EAAC;AAAA,MACtB;AAYA,eAASC,UAAS,OAAO;AACvB;AAEE,cAAI,iBAAiB,OAAO,WAAW,cAAc,OAAO;AAC5D,cAAI,OAAO,kBAAkB,MAAM,OAAO,WAAW,KAAK,MAAM,YAAY,QAAQ;AACpF,iBAAO;AAAA,QACR;AAAA,MACH;AAGA,eAAS,kBAAkB,OAAO;AAChC;AACE,cAAI;AACF,+BAAmB,KAAK;AACxB,mBAAO;AAAA,UACR,SAAQC,IAAG;AACV,mBAAO;AAAA,UACR;AAAA,QACF;AAAA,MACH;AAEA,eAAS,mBAAmB,OAAO;AAwBjC,eAAO,KAAK;AAAA,MACd;AACA,eAAS,uBAAuB,OAAO;AACrC;AACE,cAAI,kBAAkB,KAAK,GAAG;AAC5B,kBAAM,mHAAwHD,UAAS,KAAK,CAAC;AAE7I,mBAAO,mBAAmB,KAAK;AAAA,UAChC;AAAA,QACF;AAAA,MACH;AAEA,UAAI,oBAAoB,qBAAqB;AAC7C,UAAI,iBAAiB;AAAA,QACnB,KAAK;AAAA,QACL,KAAK;AAAA,QACL,QAAQ;AAAA,QACR,UAAU;AAAA,MACZ;AACA,UAAI;AACJ,UAAI;AACJ,UAAI;AAEJ;AACE,iCAAyB,CAAA;AAAA,MAC3B;AAEA,eAAS,YAAY,QAAQ;AAC3B;AACE,cAAI,eAAe,KAAK,QAAQ,KAAK,GAAG;AACtC,gBAAI,SAAS,OAAO,yBAAyB,QAAQ,KAAK,EAAE;AAE5D,gBAAI,UAAU,OAAO,gBAAgB;AACnC,qBAAO;AAAA,YACR;AAAA,UACF;AAAA,QACF;AAED,eAAO,OAAO,QAAQ;AAAA,MACxB;AAEA,eAAS,YAAY,QAAQ;AAC3B;AACE,cAAI,eAAe,KAAK,QAAQ,KAAK,GAAG;AACtC,gBAAI,SAAS,OAAO,yBAAyB,QAAQ,KAAK,EAAE;AAE5D,gBAAI,UAAU,OAAO,gBAAgB;AACnC,qBAAO;AAAA,YACR;AAAA,UACF;AAAA,QACF;AAED,eAAO,OAAO,QAAQ;AAAA,MACxB;AAEA,eAAS,qCAAqC,QAAQG,OAAM;AAC1D;AACE,cAAI,OAAO,OAAO,QAAQ,YAAY,kBAAkB,WAAWA,SAAQ,kBAAkB,QAAQ,cAAcA,OAAM;AACvH,gBAAI,gBAAgB,yBAAyB,kBAAkB,QAAQ,IAAI;AAE3E,gBAAI,CAAC,uBAAuB,aAAa,GAAG;AAC1C,oBAAM,6VAAsX,yBAAyB,kBAAkB,QAAQ,IAAI,GAAG,OAAO,GAAG;AAEhc,qCAAuB,aAAa,IAAI;AAAA,YACzC;AAAA,UACF;AAAA,QACF;AAAA,MACH;AAEA,eAAS,2BAA2B,OAAO,aAAa;AACtD;AACE,cAAI,wBAAwB,WAAY;AACtC,gBAAI,CAAC,4BAA4B;AAC/B,2CAA6B;AAE7B,oBAAM,6OAA4P,WAAW;AAAA,YAC9Q;AAAA,UACP;AAEI,gCAAsB,iBAAiB;AACvC,iBAAO,eAAe,OAAO,OAAO;AAAA,YAClC,KAAK;AAAA,YACL,cAAc;AAAA,UACpB,CAAK;AAAA,QACF;AAAA,MACH;AAEA,eAAS,2BAA2B,OAAO,aAAa;AACtD;AACE,cAAI,wBAAwB,WAAY;AACtC,gBAAI,CAAC,4BAA4B;AAC/B,2CAA6B;AAE7B,oBAAM,6OAA4P,WAAW;AAAA,YAC9Q;AAAA,UACP;AAEI,gCAAsB,iBAAiB;AACvC,iBAAO,eAAe,OAAO,OAAO;AAAA,YAClC,KAAK;AAAA,YACL,cAAc;AAAA,UACpB,CAAK;AAAA,QACF;AAAA,MACH;AAuBA,UAAI,eAAe,SAAU,MAAM,KAAK,KAAKA,OAAM,QAAQ,OAAO,OAAO;AACvE,YAAI,UAAU;AAAA;AAAA,UAEZ,UAAU;AAAA;AAAA,UAEV;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA;AAAA,UAEA,QAAQ;AAAA,QACZ;AAEE;AAKE,kBAAQ,SAAS;AAKjB,iBAAO,eAAe,QAAQ,QAAQ,aAAa;AAAA,YACjD,cAAc;AAAA,YACd,YAAY;AAAA,YACZ,UAAU;AAAA,YACV,OAAO;AAAA,UACb,CAAK;AAED,iBAAO,eAAe,SAAS,SAAS;AAAA,YACtC,cAAc;AAAA,YACd,YAAY;AAAA,YACZ,UAAU;AAAA,YACV,OAAOA;AAAA,UACb,CAAK;AAGD,iBAAO,eAAe,SAAS,WAAW;AAAA,YACxC,cAAc;AAAA,YACd,YAAY;AAAA,YACZ,UAAU;AAAA,YACV,OAAO;AAAA,UACb,CAAK;AAED,cAAI,OAAO,QAAQ;AACjB,mBAAO,OAAO,QAAQ,KAAK;AAC3B,mBAAO,OAAO,OAAO;AAAA,UACtB;AAAA,QACF;AAED,eAAO;AAAA,MACT;AAQA,eAAS,OAAO,MAAM,QAAQ,UAAU,QAAQA,OAAM;AACpD;AACE,cAAI;AAEJ,cAAI,QAAQ,CAAA;AACZ,cAAI,MAAM;AACV,cAAI,MAAM;AAOV,cAAI,aAAa,QAAW;AAC1B;AACE,qCAAuB,QAAQ;AAAA,YAChC;AAED,kBAAM,KAAK;AAAA,UACZ;AAED,cAAI,YAAY,MAAM,GAAG;AACvB;AACE,qCAAuB,OAAO,GAAG;AAAA,YAClC;AAED,kBAAM,KAAK,OAAO;AAAA,UACnB;AAED,cAAI,YAAY,MAAM,GAAG;AACvB,kBAAM,OAAO;AACb,iDAAqC,QAAQA,KAAI;AAAA,UAClD;AAGD,eAAK,YAAY,QAAQ;AACvB,gBAAI,eAAe,KAAK,QAAQ,QAAQ,KAAK,CAAC,eAAe,eAAe,QAAQ,GAAG;AACrF,oBAAM,QAAQ,IAAI,OAAO,QAAQ;AAAA,YAClC;AAAA,UACF;AAGD,cAAI,QAAQ,KAAK,cAAc;AAC7B,gBAAI,eAAe,KAAK;AAExB,iBAAK,YAAY,cAAc;AAC7B,kBAAI,MAAM,QAAQ,MAAM,QAAW;AACjC,sBAAM,QAAQ,IAAI,aAAa,QAAQ;AAAA,cACxC;AAAA,YACF;AAAA,UACF;AAED,cAAI,OAAO,KAAK;AACd,gBAAI,cAAc,OAAO,SAAS,aAAa,KAAK,eAAe,KAAK,QAAQ,YAAY;AAE5F,gBAAI,KAAK;AACP,yCAA2B,OAAO,WAAW;AAAA,YAC9C;AAED,gBAAI,KAAK;AACP,yCAA2B,OAAO,WAAW;AAAA,YAC9C;AAAA,UACF;AAED,iBAAO,aAAa,MAAM,KAAK,KAAKA,OAAM,QAAQ,kBAAkB,SAAS,KAAK;AAAA,QACnF;AAAA,MACH;AAEA,UAAI,sBAAsB,qBAAqB;AAC/C,UAAI,2BAA2B,qBAAqB;AAEpD,eAAS,gCAAgC,SAAS;AAChD;AACE,cAAI,SAAS;AACX,gBAAI,QAAQ,QAAQ;AACpB,gBAAI,QAAQ,qCAAqC,QAAQ,MAAM,QAAQ,SAAS,QAAQ,MAAM,OAAO,IAAI;AACzG,qCAAyB,mBAAmB,KAAK;AAAA,UACvD,OAAW;AACL,qCAAyB,mBAAmB,IAAI;AAAA,UACjD;AAAA,QACF;AAAA,MACH;AAEA,UAAI;AAEJ;AACE,wCAAgC;AAAA,MAClC;AAUA,eAAS,eAAe,QAAQ;AAC9B;AACE,iBAAO,OAAO,WAAW,YAAY,WAAW,QAAQ,OAAO,aAAa;AAAA,QAC7E;AAAA,MACH;AAEA,eAAS,8BAA8B;AACrC;AACE,cAAI,oBAAoB,SAAS;AAC/B,gBAAIO,QAAO,yBAAyB,oBAAoB,QAAQ,IAAI;AAEpE,gBAAIA,OAAM;AACR,qBAAO,qCAAqCA,QAAO;AAAA,YACpD;AAAA,UACF;AAED,iBAAO;AAAA,QACR;AAAA,MACH;AAEA,eAAS,2BAA2B,QAAQ;AAC1C;AACE,cAAI,WAAW,QAAW;AACxB,gBAAI,WAAW,OAAO,SAAS,QAAQ,aAAa,EAAE;AACtD,gBAAI,aAAa,OAAO;AACxB,mBAAO,4BAA4B,WAAW,MAAM,aAAa;AAAA,UAClE;AAED,iBAAO;AAAA,QACR;AAAA,MACH;AAQA,UAAI,wBAAwB,CAAA;AAE5B,eAAS,6BAA6B,YAAY;AAChD;AACE,cAAI,OAAO;AAEX,cAAI,CAAC,MAAM;AACT,gBAAI,aAAa,OAAO,eAAe,WAAW,aAAa,WAAW,eAAe,WAAW;AAEpG,gBAAI,YAAY;AACd,qBAAO,gDAAgD,aAAa;AAAA,YACrE;AAAA,UACF;AAED,iBAAO;AAAA,QACR;AAAA,MACH;AAcA,eAAS,oBAAoB,SAAS,YAAY;AAChD;AACE,cAAI,CAAC,QAAQ,UAAU,QAAQ,OAAO,aAAa,QAAQ,OAAO,MAAM;AACtE;AAAA,UACD;AAED,kBAAQ,OAAO,YAAY;AAC3B,cAAI,4BAA4B,6BAA6B,UAAU;AAEvE,cAAI,sBAAsB,yBAAyB,GAAG;AACpD;AAAA,UACD;AAED,gCAAsB,yBAAyB,IAAI;AAInD,cAAI,aAAa;AAEjB,cAAI,WAAW,QAAQ,UAAU,QAAQ,WAAW,oBAAoB,SAAS;AAE/E,yBAAa,iCAAiC,yBAAyB,QAAQ,OAAO,IAAI,IAAI;AAAA,UAC/F;AAED,0CAAgC,OAAO;AAEvC,gBAAM,6HAAkI,2BAA2B,UAAU;AAE7K,0CAAgC,IAAI;AAAA,QACrC;AAAA,MACH;AAYA,eAAS,kBAAkB,MAAM,YAAY;AAC3C;AACE,cAAI,OAAO,SAAS,UAAU;AAC5B;AAAA,UACD;AAED,cAAI,QAAQ,IAAI,GAAG;AACjB,qBAASN,KAAI,GAAGA,KAAI,KAAK,QAAQA,MAAK;AACpC,kBAAI,QAAQ,KAAKA,EAAC;AAElB,kBAAI,eAAe,KAAK,GAAG;AACzB,oCAAoB,OAAO,UAAU;AAAA,cACtC;AAAA,YACF;AAAA,UACP,WAAe,eAAe,IAAI,GAAG;AAE/B,gBAAI,KAAK,QAAQ;AACf,mBAAK,OAAO,YAAY;AAAA,YACzB;AAAA,UACF,WAAU,MAAM;AACf,gBAAI,aAAa,cAAc,IAAI;AAEnC,gBAAI,OAAO,eAAe,YAAY;AAGpC,kBAAI,eAAe,KAAK,SAAS;AAC/B,oBAAI,WAAW,WAAW,KAAK,IAAI;AACnC,oBAAI;AAEJ,uBAAO,EAAE,OAAO,SAAS,KAAI,GAAI,MAAM;AACrC,sBAAI,eAAe,KAAK,KAAK,GAAG;AAC9B,wCAAoB,KAAK,OAAO,UAAU;AAAA,kBAC3C;AAAA,gBACF;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACH;AASA,eAAS,kBAAkB,SAAS;AAClC;AACE,cAAI,OAAO,QAAQ;AAEnB,cAAI,SAAS,QAAQ,SAAS,UAAa,OAAO,SAAS,UAAU;AACnE;AAAA,UACD;AAED,cAAI;AAEJ,cAAI,OAAO,SAAS,YAAY;AAC9B,wBAAY,KAAK;AAAA,UAClB,WAAU,OAAO,SAAS,aAAa,KAAK,aAAa;AAAA;AAAA,UAE1D,KAAK,aAAa,kBAAkB;AAClC,wBAAY,KAAK;AAAA,UACvB,OAAW;AACL;AAAA,UACD;AAED,cAAI,WAAW;AAEb,gBAAIM,QAAO,yBAAyB,IAAI;AACxC,2BAAe,WAAW,QAAQ,OAAO,QAAQA,OAAM,OAAO;AAAA,UAC/D,WAAU,KAAK,cAAc,UAAa,CAAC,+BAA+B;AACzE,4CAAgC;AAEhC,gBAAI,QAAQ,yBAAyB,IAAI;AAEzC,kBAAM,uGAAuG,SAAS,SAAS;AAAA,UAChI;AAED,cAAI,OAAO,KAAK,oBAAoB,cAAc,CAAC,KAAK,gBAAgB,sBAAsB;AAC5F,kBAAM,4HAAiI;AAAA,UACxI;AAAA,QACF;AAAA,MACH;AAOA,eAAS,sBAAsB,UAAU;AACvC;AACE,cAAI,OAAO,OAAO,KAAK,SAAS,KAAK;AAErC,mBAASN,KAAI,GAAGA,KAAI,KAAK,QAAQA,MAAK;AACpC,gBAAI,MAAM,KAAKA,EAAC;AAEhB,gBAAI,QAAQ,cAAc,QAAQ,OAAO;AACvC,8CAAgC,QAAQ;AAExC,oBAAM,4GAAiH,GAAG;AAE1H,8CAAgC,IAAI;AACpC;AAAA,YACD;AAAA,UACF;AAED,cAAI,SAAS,QAAQ,MAAM;AACzB,4CAAgC,QAAQ;AAExC,kBAAM,uDAAuD;AAE7D,4CAAgC,IAAI;AAAA,UACrC;AAAA,QACF;AAAA,MACH;AAEA,eAAS,kBAAkB,MAAM,OAAO,KAAK,kBAAkB,QAAQD,OAAM;AAC3E;AACE,cAAI,YAAY,mBAAmB,IAAI;AAGvC,cAAI,CAAC,WAAW;AACd,gBAAI,OAAO;AAEX,gBAAI,SAAS,UAAa,OAAO,SAAS,YAAY,SAAS,QAAQ,OAAO,KAAK,IAAI,EAAE,WAAW,GAAG;AACrG,sBAAQ;AAAA,YACT;AAED,gBAAI,aAAa,2BAA2B,MAAM;AAElD,gBAAI,YAAY;AACd,sBAAQ;AAAA,YAChB,OAAa;AACL,sBAAQ,4BAA2B;AAAA,YACpC;AAED,gBAAI;AAEJ,gBAAI,SAAS,MAAM;AACjB,2BAAa;AAAA,YACrB,WAAiB,QAAQ,IAAI,GAAG;AACxB,2BAAa;AAAA,YACd,WAAU,SAAS,UAAa,KAAK,aAAa,oBAAoB;AACrE,2BAAa,OAAO,yBAAyB,KAAK,IAAI,KAAK,aAAa;AACxE,qBAAO;AAAA,YACf,OAAa;AACL,2BAAa,OAAO;AAAA,YACrB;AAED,kBAAM,2IAAqJ,YAAY,IAAI;AAAA,UAC5K;AAED,cAAI,UAAU,OAAO,MAAM,OAAO,KAAK,QAAQA,KAAI;AAGnD,cAAI,WAAW,MAAM;AACnB,mBAAO;AAAA,UACR;AAOD,cAAI,WAAW;AACb,gBAAI,WAAW,MAAM;AAErB,gBAAI,aAAa,QAAW;AAC1B,kBAAI,kBAAkB;AACpB,oBAAI,QAAQ,QAAQ,GAAG;AACrB,2BAASC,KAAI,GAAGA,KAAI,SAAS,QAAQA,MAAK;AACxC,sCAAkB,SAASA,EAAC,GAAG,IAAI;AAAA,kBACpC;AAED,sBAAI,OAAO,QAAQ;AACjB,2BAAO,OAAO,QAAQ;AAAA,kBACvB;AAAA,gBACb,OAAiB;AACL,wBAAM,sJAAgK;AAAA,gBACvK;AAAA,cACX,OAAe;AACL,kCAAkB,UAAU,IAAI;AAAA,cACjC;AAAA,YACF;AAAA,UACF;AAED,cAAI,SAAS,qBAAqB;AAChC,kCAAsB,OAAO;AAAA,UACnC,OAAW;AACL,8BAAkB,OAAO;AAAA,UAC1B;AAED,iBAAO;AAAA,QACR;AAAA,MACH;AAKA,eAAS,wBAAwB,MAAM,OAAO,KAAK;AACjD;AACE,iBAAO,kBAAkB,MAAM,OAAO,KAAK,IAAI;AAAA,QAChD;AAAA,MACH;AACA,eAAS,yBAAyB,MAAM,OAAO,KAAK;AAClD;AACE,iBAAO,kBAAkB,MAAM,OAAO,KAAK,KAAK;AAAA,QACjD;AAAA,MACH;AAEA,UAAI,MAAO;AAGX,UAAI,OAAQ;AAEI,kCAAA,WAAG;AACR,kCAAA,MAAG;AACF,kCAAA,OAAG;AAAA,IACf;EACA;AC7xCO;AACLc,eAAA,UAAiBF;AAAAA,EACnB;;ACHA,QAAM,sBAAsB;AAC5B,MAAI,aAAa;AACjB,MAAA,UAAA,MAAM,MAAM;AAAA,IACR,YAAY,MAAM,IAAI;AAClB,WAAK,OAAO;AACZ,WAAK,KAAK;AAAA,IACb;AAAA,EACL;AAAA,EAIA,MAAM,SAAS;AAAA;AAAA,IAEX,YAAY,SAAS,IAAI;AACrB,WAAK,KAAK;AACV,WAAK,UAAU,CAAC,CAAC,OAAO;AACxB,WAAK,cAAc,OAAO,gBAAgB,MAAM;AAC5C,cAAM,IAAI,MAAM,sDAAsD;AAAA,MAClF;AAAA,IACK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQD,IAAI,OAAO;AACP,UAAI,KAAK;AACL,cAAM,IAAI,WAAW,wCAAwC;AACjE,UAAI,OAAO,SAAS;AAChB,gBAAQ,SAAS,MAAM,KAAK;AAChC,aAAO,CAAC,SAAS;AACb,YAAI,SAAS,MAAM,IAAI;AACvB,eAAO,WAAW,SAAY,OAAO,CAAC,MAAM,MAAM;AAAA,MAC9D;AAAA,IACK;AAAA,EACL;AAKA,WAAS,WAAW,IAAI,SAAS,EAAE,aAAa,SAAO,IAAI,MAAM,GAAG,EAAC,CAAE;AAIvE,WAAS,WAAW,IAAI,SAAS,EAAE,aAAa,SAAO,IAAI,MAAM,GAAG,EAAC,CAAE;AAIvE,WAAS,QAAQ,IAAI,SAAS,EAAE,aAAa,SAAO,IAAI,MAAM,GAAG,EAAC,CAAE;AAIpE,WAAS,cAAc,IAAI,SAAS,EAAE,SAAS,KAAM,CAAA;AAKrD,WAAS,YAAY,IAAI,SAAS,EAAE,SAAS,KAAM,CAAA;AAInD,WAAS,UAAU,IAAI,SAAS,EAAE,SAAS,KAAM,CAAA;AAuBjD,QAAM,UAAU,uBAAO,OAAO,IAAI;AAAA,EAElC,MAAM,SAAS;AAAA;AAAA,IAEX,YAKAN,OAEA,OAGA,IAEA,QAAQ,GAAG;AACP,WAAK,OAAOA;AACZ,WAAK,QAAQ;AACb,WAAK,KAAK;AACV,WAAK,QAAQ;AAAA,IAChB;AAAA;AAAA,IAED,OAAO,OAAO,MAAM;AAChB,UAAI,QAAQ,KAAK,SAAS,KAAK,MAAM,SAAS,uBAAO,OAAO,IAAI,IAAI;AACpE,UAAI,SAAS,KAAK,MAAM,IAAuB,MAAM,KAAK,UAAU,IAA2B,MAC1F,KAAK,QAAQ,IAAyB,MAAM,KAAK,QAAQ,OAAO,IAA6B;AAClG,UAAI,OAAO,IAAI,SAAS,KAAK,QAAQ,IAAI,OAAO,KAAK,IAAI,KAAK;AAC9D,UAAI,KAAK;AACL,iBAAS,OAAO,KAAK,OAAO;AACxB,cAAI,CAAC,MAAM,QAAQ,GAAG;AAClB,kBAAM,IAAI,IAAI;AAClB,cAAI,KAAK;AACL,gBAAI,IAAI,CAAC,EAAE;AACP,oBAAM,IAAI,WAAW,4CAA4C;AACrE,kBAAM,IAAI,CAAC,EAAE,EAAE,IAAI,IAAI,CAAC;AAAA,UAC3B;AAAA,QACJ;AACL,aAAO;AAAA,IACV;AAAA;AAAA;AAAA,IAGD,KAAK,MAAM;AAAE,aAAO,KAAK,MAAM,KAAK,EAAE;AAAA,IAAI;AAAA;AAAA,IAE1C,IAAI,QAAQ;AAAE,cAAQ,KAAK,QAAQ,KAAwB;AAAA,IAAI;AAAA;AAAA,IAE/D,IAAI,YAAY;AAAE,cAAQ,KAAK,QAAQ,KAA4B;AAAA,IAAI;AAAA;AAAA,IAEvE,IAAI,UAAU;AAAE,cAAQ,KAAK,QAAQ,KAA0B;AAAA,IAAI;AAAA;AAAA;AAAA,IAGnE,IAAI,cAAc;AAAE,cAAQ,KAAK,QAAQ,KAA8B;AAAA,IAAI;AAAA;AAAA;AAAA,IAG3E,GAAGA,OAAM;AACL,UAAI,OAAOA,SAAQ,UAAU;AACzB,YAAI,KAAK,QAAQA;AACb,iBAAO;AACX,YAAI,QAAQ,KAAK,KAAK,SAAS,KAAK;AACpC,eAAO,QAAQ,MAAM,QAAQA,KAAI,IAAI,KAAK;AAAA,MAC7C;AACD,aAAO,KAAK,MAAMA;AAAA,IACrB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOD,OAAO,MAAM,KAAK;AACd,UAAI,SAAS,uBAAO,OAAO,IAAI;AAC/B,eAAS,QAAQ;AACb,iBAASA,SAAQ,KAAK,MAAM,GAAG;AAC3B,iBAAOA,KAAI,IAAI,IAAI,IAAI;AAC/B,aAAO,CAAC,SAAS;AACb,iBAAS,SAAS,KAAK,KAAK,SAAS,KAAK,GAAGN,KAAI,IAAIA,MAAK,SAAS,OAAO,SAAS,IAAIA,MAAK;AACxF,cAAI,QAAQ,OAAOA,KAAI,IAAI,KAAK,OAAO,OAAOA,EAAC,CAAC;AAChD,cAAI;AACA,mBAAO;AAAA,QACd;AAAA,MACb;AAAA,IACK;AAAA,EACL;AAEA,WAAS,OAAO,IAAI;AAAA,IAAS;AAAA,IAAI,uBAAO,OAAO,IAAI;AAAA,IAAG;AAAA,IAAG;AAAA;AAAA;EAQzD,MAAM,QAAQ;AAAA;AAAA;AAAA,IAGV,YAEAe,QAAO;AACH,WAAK,QAAQA;AACb,eAASf,KAAI,GAAGA,KAAIe,OAAM,QAAQf;AAC9B,YAAIe,OAAMf,EAAC,EAAE,MAAMA;AACf,gBAAM,IAAI,WAAW,6EAA6E;AAAA,IAC7G;AAAA;AAAA;AAAA;AAAA,IAID,UAAU,OAAO;AACb,UAAI,WAAW,CAAA;AACf,eAAS,QAAQ,KAAK,OAAO;AACzB,YAAI,WAAW;AACf,iBAAS,UAAU,OAAO;AACtB,cAAI,MAAM,OAAO,IAAI;AACrB,cAAI,KAAK;AACL,gBAAI,CAAC;AACD,yBAAW,OAAO,OAAO,CAAE,GAAE,KAAK,KAAK;AAC3C,qBAAS,IAAI,CAAC,EAAE,EAAE,IAAI,IAAI,CAAC;AAAA,UAC9B;AAAA,QACJ;AACD,iBAAS,KAAK,WAAW,IAAI,SAAS,KAAK,MAAM,UAAU,KAAK,IAAI,KAAK,KAAK,IAAI,IAAI;AAAA,MACzF;AACD,aAAO,IAAI,QAAQ,QAAQ;AAAA,IAC9B;AAAA,EACL;AACA,QAAM,aAAa,oBAAI,QAAO,GAAI,kBAAkB,oBAAI,QAAO;AAG/D,MAAI;AACJ,GAAC,SAAUgB,WAAU;AAIjB,IAAAA,UAASA,UAAS,gBAAgB,IAAI,CAAC,IAAI;AAI3C,IAAAA,UAASA,UAAS,kBAAkB,IAAI,CAAC,IAAI;AAI7C,IAAAA,UAASA,UAAS,cAAc,IAAI,CAAC,IAAI;AAKzC,IAAAA,UAASA,UAAS,gBAAgB,IAAI,CAAC,IAAI;AAAA,EAC/C,GAAG,aAAa,WAAW,CAAE,EAAC;AAAA,EAe9B,MAAM,KAAK;AAAA;AAAA,IAEP,YAEA,MAEA,UAGA,WAEA,QAEA,OAAO;AACH,WAAK,OAAO;AACZ,WAAK,WAAW;AAChB,WAAK,YAAY;AACjB,WAAK,SAAS;AAEd,WAAK,QAAQ;AACb,UAAI,SAAS,MAAM,QAAQ;AACvB,aAAK,QAAQ,uBAAO,OAAO,IAAI;AAC/B,iBAAS,CAAC,MAAM,KAAK,KAAK;AACtB,eAAK,MAAM,OAAO,QAAQ,WAAW,OAAO,KAAK,EAAE,IAAI;AAAA,MAC9D;AAAA,IACJ;AAAA;AAAA,IAED,WAAW;AACP,UAAI,UAAU,KAAK,KAAK,SAAS,OAAO;AACxC,UAAI,WAAW,CAAC,QAAQ;AACpB,eAAO,QAAQ,KAAK;AACxB,UAAI,WAAW;AACf,eAAS,MAAM,KAAK,UAAU;AAC1B,YAAI,MAAM,GAAG;AACb,YAAI,KAAK;AACL,cAAI;AACA,wBAAY;AAChB,sBAAY;AAAA,QACf;AAAA,MACJ;AACD,aAAO,CAAC,KAAK,KAAK,OAAO,YACpB,KAAK,KAAK,KAAK,KAAK,IAAI,KAAK,CAAC,KAAK,KAAK,UAAU,KAAK,UAAU,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SACzF,SAAS,SAAS,MAAM,WAAW,MAAM;AAAA,IACrD;AAAA;AAAA;AAAA;AAAA,IAID,OAAO,OAAO,GAAG;AACb,aAAO,IAAI,WAAW,KAAK,SAAS,IAAI;AAAA,IAC3C;AAAA;AAAA;AAAA;AAAA,IAID,SAAS,KAAK,OAAO,GAAG,OAAO,GAAG;AAC9B,UAAI,QAAQ,WAAW,IAAI,IAAI,KAAK,KAAK;AACzC,UAAI,SAAS,IAAI,WAAW,KAAK;AACjC,aAAO,OAAO,KAAK,IAAI;AACvB,iBAAW,IAAI,MAAM,OAAO,KAAK;AACjC,aAAO;AAAA,IACV;AAAA;AAAA;AAAA,IAGD,IAAI,UAAU;AACV,aAAO,IAAI,SAAS,MAAM,GAAG,GAAG,IAAI;AAAA,IACvC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAUD,QAAQ,KAAK,OAAO,GAAG;AACnB,UAAI,OAAO,YAAY,WAAW,IAAI,IAAI,KAAK,KAAK,SAAS,KAAK,MAAM,KAAK;AAC7E,iBAAW,IAAI,MAAM,IAAI;AACzB,aAAO;AAAA,IACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMD,aAAa,KAAK,OAAO,GAAG;AACxB,UAAI,OAAO,YAAY,gBAAgB,IAAI,IAAI,KAAK,KAAK,SAAS,KAAK,MAAM,IAAI;AACjF,sBAAgB,IAAI,MAAM,IAAI;AAC9B,aAAO;AAAA,IACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMD,QAAQ,MAAM;AACV,UAAI,EAAE,OAAO,OAAO,OAAO,GAAG,KAAK,KAAK,OAAQ,IAAG;AACnD,UAAI,OAAO,KAAK,QAAQ,GAAG,QAAQ,OAAO,SAAS,oBAAoB;AACvE,eAASd,KAAI,KAAK,OAAO,OAAO,SAAS,gBAAgB,OAAK;AAC1D,YAAI,UAAU;AACd,YAAIA,GAAE,QAAQ,MAAMA,GAAE,MAAM,SAAS,CAAC,QAAQA,GAAE,KAAK,eAAe,MAAMA,EAAC,MAAM,QAAQ;AACrF,cAAIA,GAAE,WAAY;AACd;AACJ,oBAAU;AAAA,QACb;AACD,mBAAS;AACL,cAAI,WAAW,UAAU,QAAQ,CAACA,GAAE,KAAK;AACrC,kBAAMA,EAAC;AACX,cAAIA,GAAE,YAAa;AACf;AACJ,cAAI,CAACA,GAAE,OAAQ;AACX;AACJ,oBAAU;AAAA,QACb;AAAA,MACJ;AAAA,IACJ;AAAA;AAAA;AAAA,IAGD,KAAK,MAAM;AACP,aAAO,CAAC,KAAK,UAAU,KAAK,KAAK,KAAK,IAAI,IAAI,KAAK,QAAQ,KAAK,MAAM,KAAK,EAAE,IAAI;AAAA,IACpF;AAAA;AAAA;AAAA;AAAA,IAID,IAAI,aAAa;AACb,UAAI,SAAS,CAAA;AACb,UAAI,KAAK;AACL,iBAAS,MAAM,KAAK;AAChB,iBAAO,KAAK,CAAC,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC,CAAC;AACzC,aAAO;AAAA,IACV;AAAA;AAAA;AAAA;AAAA,IAID,QAAQ,SAAS,IAAI;AACjB,aAAO,KAAK,SAAS,UAAU,IAA+B,OAC1D,aAAa,SAAS,MAAM,KAAK,UAAU,KAAK,WAAW,GAAG,KAAK,SAAS,QAAQ,GAAG,KAAK,QAAQ,CAAC,UAAU,WAAW,WAAW,IAAI,KAAK,KAAK,MAAM,UAAU,WAAW,QAAQ,KAAK,UAAU,GAAG,OAAO,aAAa,CAAC,UAAU,WAAW,WAAW,IAAI,KAAK,SAAS,MAAM,UAAU,WAAW,MAAM,EAAE;AAAA,IACzT;AAAA;AAAA;AAAA,IAGD,OAAO,MAAM,MAAM;AAAE,aAAO,UAAU,IAAI;AAAA,IAAI;AAAA,EAClD;AAEA,OAAK,QAAQ,IAAI,KAAK,SAAS,MAAM,IAAI,CAAA,GAAI,CAAC;AAAA,EAC9C,MAAM,iBAAiB;AAAA,IACnB,YAAY,QAAQD,QAAO;AACvB,WAAK,SAAS;AACd,WAAK,QAAQA;AAAA,IAChB;AAAA,IACD,IAAI,KAAK;AAAE,aAAO,KAAK,OAAO,KAAK,QAAQ,CAAC;AAAA,IAAI;AAAA,IAChD,IAAI,QAAQ;AAAE,aAAO,KAAK,OAAO,KAAK,QAAQ,CAAC;AAAA,IAAI;AAAA,IACnD,IAAI,MAAM;AAAE,aAAO,KAAK,OAAO,KAAK,QAAQ,CAAC;AAAA,IAAI;AAAA,IACjD,IAAI,OAAO;AAAE,aAAO,KAAK,OAAO,KAAK,QAAQ,CAAC;AAAA,IAAI;AAAA,IAClD,IAAI,MAAM;AAAE,aAAO,KAAK;AAAA,IAAQ;AAAA,IAChC,OAAO;AAAE,WAAK,SAAS;AAAA,IAAI;AAAA,IAC3B,OAAO;AAAE,aAAO,IAAI,iBAAiB,KAAK,QAAQ,KAAK,KAAK;AAAA,IAAI;AAAA,EACpE;AAAA,EAKA,MAAM,WAAW;AAAA;AAAA,IAEb,YAEA,QAEA,QAEA,KAAK;AACD,WAAK,SAAS;AACd,WAAK,SAAS;AACd,WAAK,MAAM;AAAA,IACd;AAAA;AAAA,IAED,IAAI,OAAO;AAAE,aAAO,SAAS;AAAA,IAAO;AAAA;AAAA,IAEpC,WAAW;AACP,UAAI,SAAS,CAAA;AACb,eAASA,SAAQ,GAAGA,SAAQ,KAAK,OAAO,UAAS;AAC7C,eAAO,KAAK,KAAK,YAAYA,MAAK,CAAC;AACnC,QAAAA,SAAQ,KAAK,OAAOA,SAAQ,CAAC;AAAA,MAChC;AACD,aAAO,OAAO,KAAK,GAAG;AAAA,IACzB;AAAA;AAAA,IAED,YAAYA,QAAO;AACf,UAAI,KAAK,KAAK,OAAOA,MAAK,GAAG,WAAW,KAAK,OAAOA,SAAQ,CAAC;AAC7D,UAAI,OAAO,KAAK,IAAI,MAAM,EAAE,GAAG,SAAS,KAAK;AAC7C,UAAI,KAAK,KAAK,MAAM,KAAK,CAAC,KAAK;AAC3B,iBAAS,KAAK,UAAU,MAAM;AAClC,MAAAA,UAAS;AACT,UAAI,YAAYA;AACZ,eAAO;AACX,UAAI,WAAW,CAAA;AACf,aAAOA,SAAQ,UAAU;AACrB,iBAAS,KAAK,KAAK,YAAYA,MAAK,CAAC;AACrC,QAAAA,SAAQ,KAAK,OAAOA,SAAQ,CAAC;AAAA,MAChC;AACD,aAAO,SAAS,MAAM,SAAS,KAAK,GAAG,IAAI;AAAA,IAC9C;AAAA;AAAA,IAED,UAAU,YAAY,UAAU,KAAK,KAAK,MAAM;AAC5C,UAAI,EAAE,OAAQ,IAAG,MAAM,OAAO;AAC9B,eAASD,KAAI,YAAYA,MAAK,UAAUA,KAAI,OAAOA,KAAI,CAAC,GAAG;AACvD,YAAI,UAAU,MAAM,KAAK,OAAOA,KAAI,CAAC,GAAG,OAAOA,KAAI,CAAC,CAAC,GAAG;AACpD,iBAAOA;AACP,cAAI,MAAM;AACN;AAAA,QACP;AAAA,MACJ;AACD,aAAO;AAAA,IACV;AAAA;AAAA,IAED,MAAM,QAAQ,MAAM,MAAM;AACtB,UAAIiB,KAAI,KAAK;AACb,UAAI,OAAO,IAAI,YAAY,OAAO,MAAM,GAAG,MAAM;AACjD,eAASjB,KAAI,QAAQ,IAAI,GAAGA,KAAI,QAAO;AACnC,aAAK,GAAG,IAAIiB,GAAEjB,IAAG;AACjB,aAAK,GAAG,IAAIiB,GAAEjB,IAAG,IAAI;AACrB,YAAI,KAAK,KAAK,GAAG,IAAIiB,GAAEjB,IAAG,IAAI;AAC9B,aAAK,GAAG,IAAIiB,GAAEjB,IAAG,IAAI;AACrB,cAAM,KAAK,IAAI,KAAK,EAAE;AAAA,MACzB;AACD,aAAO,IAAI,WAAW,MAAM,KAAK,KAAK,GAAG;AAAA,IAC5C;AAAA,EACL;AACA,WAAS,UAAU,MAAM,KAAK,MAAM,IAAI;AACpC,YAAQ,MAAI;AAAA,MACR,KAAK;AAAsB,eAAO,OAAO;AAAA,MACzC,KAAK;AAA0B,eAAO,MAAM,OAAO,OAAO;AAAA,MAC1D,KAAK;AAAqB,eAAO,OAAO,OAAO,KAAK;AAAA,MACpD,KAAK;AAAwB,eAAO,QAAQ,OAAO,KAAK;AAAA,MACxD,KAAK;AAAoB,eAAO,KAAK;AAAA,MACrC,KAAK;AAAuB,eAAO;AAAA,IACtC;AAAA,EACL;AACA,WAAS,2BAA2B,MAAM,KAAK;AAC3C,QAAI,OAAO,KAAK,YAAY,GAAG;AAC/B,WAAO,MAAM;AACT,UAAI,OAAO,KAAK;AAChB,UAAI,CAAC,QAAQ,KAAK,MAAM,KAAK;AACzB;AACJ,UAAI,KAAK,KAAK,WAAW,KAAK,QAAQ,KAAK,IAAI;AAC3C,eAAO;AACP,eAAO,KAAK;AAAA,MACf,OACI;AACD,eAAO;AAAA,MACV;AAAA,IACJ;AACD,WAAO;AAAA,EACX;AACA,WAAS,YAAY,MAAM,KAAK,MAAM,UAAU;AAC5C,QAAIkB;AAEJ,WAAO,KAAK,QAAQ,KAAK,OACpB,OAAO,IAAI,KAAK,QAAQ,MAAM,KAAK,OAAO,SAC1C,OAAO,KAAK,KAAK,MAAM,MAAM,KAAK,KAAK,MAAM;AAC9C,UAAI,SAAS,CAAC,YAAY,gBAAgB,YAAY,KAAK,QAAQ,IAAI,OAAO,KAAK;AACnF,UAAI,CAAC;AACD,eAAO;AACX,aAAO;AAAA,IACV;AACD,QAAI,OAAO,WAAW,IAAI,SAAS;AAEnC,QAAI;AACA,eAAS,OAAO,MAAM,SAAS,KAAK,QAAQ,QAAQ,OAAO,QAAQ,SAAS,KAAK,QAAQ;AACrF,YAAI,gBAAgB,YAAY,KAAK,QAAQ,OAAOA,MAAK,OAAO,MAAM,KAAK,MAAM,IAAI,OAAO,QAAQA,QAAO,SAAS,SAASA,IAAG,SAAS,KAAK;AAC1I,iBAAO;AAAA,MACd;AACL,eAAS;AACL,UAAI,QAAQ,KAAK,MAAM,KAAK,MAAM,IAAI;AACtC,UAAI,CAAC;AACD,eAAO;AACX,aAAO;AAAA,IACV;AAAA,EACL;AAAA,EACA,MAAM,SAAS;AAAA,IACX,YAAY,OAAO,MAEnBjB,QAAO,SAAS;AACZ,WAAK,QAAQ;AACb,WAAK,OAAO;AACZ,WAAK,QAAQA;AACb,WAAK,UAAU;AAAA,IAClB;AAAA,IACD,IAAI,OAAO;AAAE,aAAO,KAAK,MAAM;AAAA,IAAO;AAAA,IACtC,IAAI,OAAO;AAAE,aAAO,KAAK,MAAM,KAAK;AAAA,IAAO;AAAA,IAC3C,IAAI,KAAK;AAAE,aAAO,KAAK,OAAO,KAAK,MAAM;AAAA,IAAS;AAAA,IAClD,UAAUD,IAAG,KAAK,KAAK,MAAM,OAAO,GAAG;AACnC,eAAS,SAAS,UAAQ;AACtB,iBAAS,EAAE,UAAU,UAAS,IAAK,OAAO,OAAOH,KAAI,MAAM,IAAI,SAAS,SAAS,IAAIG,MAAKH,IAAGG,MAAK,KAAK;AACnG,cAAI,OAAO,SAASA,EAAC,GAAG,QAAQ,UAAUA,EAAC,IAAI,OAAO;AACtD,cAAI,CAAC,UAAU,MAAM,KAAK,OAAO,QAAQ,KAAK,MAAM;AAChD;AACJ,cAAI,gBAAgB,YAAY;AAC5B,gBAAI,OAAO,SAAS;AAChB;AACJ,gBAAIC,SAAQ,KAAK,UAAU,GAAG,KAAK,OAAO,QAAQ,KAAK,MAAM,OAAO,IAAI;AACxE,gBAAIA,SAAQ;AACR,qBAAO,IAAI,WAAW,IAAI,cAAc,QAAQ,MAAMD,IAAG,KAAK,GAAG,MAAMC,MAAK;AAAA,UACnF,WACS,OAAO,SAAS,qBAAsB,CAAC,KAAK,KAAK,eAAe,SAAS,IAAI,IAAI;AACvF,gBAAI;AACJ,gBAAI,EAAE,OAAO,SAAS,iBAClB,KAAK,UAAU,UAAU,KAAK,KAAK,SAAS,OAAO,MAAM,CAAC,QAAQ;AAClE,qBAAO,IAAI,SAAS,QAAQ,MAAM,OAAOD,IAAG,MAAM;AACtD,gBAAI,QAAQ,IAAI,SAAS,MAAM,OAAOA,IAAG,MAAM;AAC/C,mBAAQ,OAAO,SAAS,oBAAqB,CAAC,MAAM,KAAK,cAAc,QACjE,MAAM,UAAU,MAAM,IAAI,KAAK,SAAS,SAAS,IAAI,GAAG,KAAK,KAAK,IAAI;AAAA,UAC/E;AAAA,QACJ;AACD,YAAK,OAAO,SAAS,oBAAqB,CAAC,OAAO,KAAK;AACnD,iBAAO;AACX,YAAI,OAAO,SAAS;AAChB,UAAAA,KAAI,OAAO,QAAQ;AAAA;AAEnB,UAAAA,KAAI,MAAM,IAAI,KAAK,OAAO,QAAQ,MAAM,SAAS;AACrD,iBAAS,OAAO;AAChB,YAAI,CAAC;AACD,iBAAO;AAAA,MACd;AAAA,IACJ;AAAA,IACD,IAAI,aAAa;AAAE,aAAO,KAAK;AAAA,QAAU;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA;AAAA,MAAC;AAAA,IAAwB;AAAA,IAC3E,IAAI,YAAY;AAAE,aAAO,KAAK;AAAA,QAAU,KAAK,MAAM,SAAS,SAAS;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA;AAAA,MAAsB;AAAA,IAAG;AAAA,IACxG,WAAW,KAAK;AAAE,aAAO,KAAK;AAAA,QAAU;AAAA,QAAG;AAAA,QAAG;AAAA,QAAK;AAAA;AAAA,MAAC;AAAA,IAAqB;AAAA,IACzE,YAAY,KAAK;AAAE,aAAO,KAAK;AAAA,QAAU,KAAK,MAAM,SAAS,SAAS;AAAA,QAAG;AAAA,QAAI;AAAA,QAAK;AAAA;AAAA,MAAE;AAAA,IAAsB;AAAA,IAC1G,MAAM,KAAK,MAAM,OAAO,GAAG;AACvB,UAAI;AACJ,UAAI,EAAE,OAAO,SAAS,oBAAoB,UAAU,KAAK,MAAM,KAAK,SAAS,OAAO,MAAM,QAAQ,SAAS;AACvG,YAAI,OAAO,MAAM,KAAK;AACtB,iBAAS,EAAE,MAAM,GAAE,KAAM,QAAQ,SAAS;AACtC,eAAK,OAAO,IAAI,QAAQ,OAAO,OAAO,UACjC,OAAO,IAAI,MAAM,OAAO,KAAK;AAC9B,mBAAO,IAAI,SAAS,QAAQ,MAAM,QAAQ,QAAQ,CAAC,EAAE,OAAO,KAAK,MAAM,IAAI,IAAI;AAAA,QACtF;AAAA,MACJ;AACD,aAAO,KAAK,UAAU,GAAG,GAAG,KAAK,MAAM,IAAI;AAAA,IAC9C;AAAA,IACD,wBAAwB;AACpB,UAAI,MAAM;AACV,aAAO,IAAI,KAAK,eAAe,IAAI;AAC/B,cAAM,IAAI;AACd,aAAO;AAAA,IACV;AAAA,IACD,IAAI,SAAS;AACT,aAAO,KAAK,UAAU,KAAK,QAAQ,sBAAuB,IAAG;AAAA,IAChE;AAAA,IACD,IAAI,cAAc;AACd,aAAO,KAAK,WAAW,KAAK,SAAS,IAAI,KAAK,QAAQ;AAAA,QAAU,KAAK,QAAQ;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA;AAAA,MAAsB,IAAG;AAAA,IAClH;AAAA,IACD,IAAI,cAAc;AACd,aAAO,KAAK,WAAW,KAAK,SAAS,IAAI,KAAK,QAAQ;AAAA,QAAU,KAAK,QAAQ;AAAA,QAAG;AAAA,QAAI;AAAA,QAAG;AAAA;AAAA,MAAsB,IAAG;AAAA,IACnH;AAAA,IACD,OAAO,OAAO,GAAG;AAAE,aAAO,IAAI,WAAW,MAAM,IAAI;AAAA,IAAI;AAAA,IACvD,IAAI,OAAO;AAAE,aAAO,KAAK;AAAA,IAAQ;AAAA,IACjC,SAAS;AAAE,aAAO,KAAK;AAAA,IAAQ;AAAA,IAC/B,QAAQ,KAAK,OAAO,GAAG;AACnB,aAAO,YAAY,MAAM,KAAK,MAAM,KAAK;AAAA,IAC5C;AAAA,IACD,aAAa,KAAK,OAAO,GAAG;AACxB,aAAO,YAAY,MAAM,KAAK,MAAM,IAAI;AAAA,IAC3C;AAAA,IACD,2BAA2B,KAAK;AAAE,aAAO,2BAA2B,MAAM,GAAG;AAAA,IAAI;AAAA,IACjF,SAAS,MAAM,SAAS,MAAM,QAAQ,MAAM;AACxC,UAAImB,KAAI,YAAY,MAAM,MAAM,QAAQ,KAAK;AAC7C,aAAOA,GAAE,SAASA,GAAE,CAAC,IAAI;AAAA,IAC5B;AAAA,IACD,YAAY,MAAM,SAAS,MAAM,QAAQ,MAAM;AAC3C,aAAO,YAAY,MAAM,MAAM,QAAQ,KAAK;AAAA,IAC/C;AAAA;AAAA,IAED,WAAW;AAAE,aAAO,KAAK,MAAM,SAAU;AAAA,IAAG;AAAA,IAC5C,IAAI,OAAO;AAAE,aAAO;AAAA,IAAO;AAAA,IAC3B,aAAa,SAAS;AAAE,aAAO,iBAAiB,MAAM,OAAO;AAAA,IAAI;AAAA,EACrE;AACA,WAAS,YAAY,MAAM,MAAM,QAAQ,OAAO;AAC5C,QAAI,MAAM,KAAK,OAAM,GAAI,SAAS,CAAA;AAClC,QAAI,CAAC,IAAI,WAAY;AACjB,aAAO;AACX,QAAI,UAAU;AACV,aAAO,CAAC,IAAI,KAAK,GAAG,MAAM;AACtB,YAAI,CAAC,IAAI,YAAa;AAClB,iBAAO;AAAA;AACnB,eAAS;AACL,UAAI,SAAS,QAAQ,IAAI,KAAK,GAAG,KAAK;AAClC,eAAO;AACX,UAAI,IAAI,KAAK,GAAG,IAAI;AAChB,eAAO,KAAK,IAAI,IAAI;AACxB,UAAI,CAAC,IAAI,YAAa;AAClB,eAAO,SAAS,OAAO,SAAS;IACvC;AAAA,EACL;AACA,WAAS,iBAAiB,MAAM,SAASnB,KAAI,QAAQ,SAAS,GAAG;AAC7D,aAASoB,KAAI,KAAK,QAAQpB,MAAK,GAAGoB,KAAIA,GAAE,QAAQ;AAC5C,UAAI,CAACA;AACD,eAAO;AACX,UAAI,CAACA,GAAE,KAAK,aAAa;AACrB,YAAI,QAAQpB,EAAC,KAAK,QAAQA,EAAC,KAAKoB,GAAE;AAC9B,iBAAO;AACX,QAAApB;AAAA,MACH;AAAA,IACJ;AACD,WAAO;AAAA,EACX;AAAA,EACA,MAAM,cAAc;AAAA,IAChB,YAAY,QAAQ,QAAQC,QAAO,OAAO;AACtC,WAAK,SAAS;AACd,WAAK,SAAS;AACd,WAAK,QAAQA;AACb,WAAK,QAAQ;AAAA,IAChB;AAAA,EACL;AAAA,EACA,MAAM,WAAW;AAAA,IACb,IAAI,OAAO;AAAE,aAAO,KAAK,KAAK;AAAA,IAAO;AAAA,IACrC,IAAI,OAAO;AAAE,aAAO,KAAK,QAAQ,QAAQ,KAAK,QAAQ,OAAO,OAAO,KAAK,QAAQ,CAAC;AAAA,IAAI;AAAA,IACtF,IAAI,KAAK;AAAE,aAAO,KAAK,QAAQ,QAAQ,KAAK,QAAQ,OAAO,OAAO,KAAK,QAAQ,CAAC;AAAA,IAAI;AAAA,IACpF,YAAY,SAAS,SAASA,QAAO;AACjC,WAAK,UAAU;AACf,WAAK,UAAU;AACf,WAAK,QAAQA;AACb,WAAK,OAAO,QAAQ,OAAO,IAAI,MAAM,QAAQ,OAAO,OAAOA,MAAK,CAAC;AAAA,IACpE;AAAA,IACD,MAAM,KAAK,KAAK,MAAM;AAClB,UAAI,EAAE,OAAM,IAAK,KAAK;AACtB,UAAIA,SAAQ,OAAO,UAAU,KAAK,QAAQ,GAAG,OAAO,OAAO,KAAK,QAAQ,CAAC,GAAG,KAAK,MAAM,KAAK,QAAQ,OAAO,IAAI;AAC/G,aAAOA,SAAQ,IAAI,OAAO,IAAI,WAAW,KAAK,SAAS,MAAMA,MAAK;AAAA,IACrE;AAAA,IACD,IAAI,aAAa;AAAE,aAAO,KAAK;AAAA,QAAM;AAAA,QAAG;AAAA,QAAG;AAAA;AAAA,MAAC;AAAA,IAAwB;AAAA,IACpE,IAAI,YAAY;AAAE,aAAO,KAAK;AAAA,QAAM;AAAA,QAAI;AAAA,QAAG;AAAA;AAAA,MAAC;AAAA,IAAwB;AAAA,IACpE,WAAW,KAAK;AAAE,aAAO,KAAK;AAAA,QAAM;AAAA,QAAG;AAAA,QAAK;AAAA;AAAA,MAAC;AAAA,IAAqB;AAAA,IAClE,YAAY,KAAK;AAAE,aAAO,KAAK;AAAA,QAAM;AAAA,QAAI;AAAA,QAAK;AAAA;AAAA,MAAE;AAAA,IAAsB;AAAA,IACtE,MAAM,KAAK,MAAM,OAAO,GAAG;AACvB,UAAI,OAAO,SAAS;AAChB,eAAO;AACX,UAAI,EAAE,OAAM,IAAK,KAAK;AACtB,UAAIA,SAAQ,OAAO,UAAU,KAAK,QAAQ,GAAG,OAAO,OAAO,KAAK,QAAQ,CAAC,GAAG,OAAO,IAAI,IAAI,IAAI,MAAM,KAAK,QAAQ,OAAO,IAAI;AAC7H,aAAOA,SAAQ,IAAI,OAAO,IAAI,WAAW,KAAK,SAAS,MAAMA,MAAK;AAAA,IACrE;AAAA,IACD,IAAI,SAAS;AACT,aAAO,KAAK,WAAW,KAAK,QAAQ,OAAO;IAC9C;AAAA,IACD,gBAAgB,KAAK;AACjB,aAAO,KAAK,UAAU,OAAO,KAAK,QAAQ,OAAO;AAAA,QAAU,KAAK,QAAQ,QAAQ;AAAA,QAAK;AAAA,QAAK;AAAA,QAAG;AAAA;AAAA;IAChG;AAAA,IACD,IAAI,cAAc;AACd,UAAI,EAAE,OAAM,IAAK,KAAK;AACtB,UAAI,QAAQ,OAAO,OAAO,KAAK,QAAQ,CAAC;AACxC,UAAI,SAAS,KAAK,UAAU,OAAO,OAAO,KAAK,QAAQ,QAAQ,CAAC,IAAI,OAAO,OAAO;AAC9E,eAAO,IAAI,WAAW,KAAK,SAAS,KAAK,SAAS,KAAK;AAC3D,aAAO,KAAK,gBAAgB,CAAC;AAAA,IAChC;AAAA,IACD,IAAI,cAAc;AACd,UAAI,EAAE,OAAM,IAAK,KAAK;AACtB,UAAI,cAAc,KAAK,UAAU,KAAK,QAAQ,QAAQ,IAAI;AAC1D,UAAI,KAAK,SAAS;AACd,eAAO,KAAK,gBAAgB,EAAE;AAClC,aAAO,IAAI,WAAW,KAAK,SAAS,KAAK,SAAS,OAAO;AAAA,QAAU;AAAA,QAAa,KAAK;AAAA,QAAO;AAAA,QAAI;AAAA,QAAG;AAAA;AAAA,MAAC,CAAqB;AAAA,IAC5H;AAAA,IACD,OAAO,OAAO,GAAG;AAAE,aAAO,IAAI,WAAW,MAAM,IAAI;AAAA,IAAI;AAAA,IACvD,IAAI,OAAO;AAAE,aAAO;AAAA,IAAO;AAAA,IAC3B,SAAS;AACL,UAAI,WAAW,CAAA,GAAI,YAAY;AAC/B,UAAI,EAAE,OAAM,IAAK,KAAK;AACtB,UAAI,SAAS,KAAK,QAAQ,GAAG,OAAO,OAAO,OAAO,KAAK,QAAQ,CAAC;AAChE,UAAI,OAAO,QAAQ;AACf,YAAI,OAAO,OAAO,OAAO,KAAK,QAAQ,CAAC;AACvC,iBAAS,KAAK,OAAO,MAAM,QAAQ,MAAM,IAAI,CAAC;AAC9C,kBAAU,KAAK,CAAC;AAAA,MACnB;AACD,aAAO,IAAI,KAAK,KAAK,MAAM,UAAU,WAAW,KAAK,KAAK,KAAK,IAAI;AAAA,IACtE;AAAA,IACD,QAAQ,KAAK,OAAO,GAAG;AACnB,aAAO,YAAY,MAAM,KAAK,MAAM,KAAK;AAAA,IAC5C;AAAA,IACD,aAAa,KAAK,OAAO,GAAG;AACxB,aAAO,YAAY,MAAM,KAAK,MAAM,IAAI;AAAA,IAC3C;AAAA,IACD,2BAA2B,KAAK;AAAE,aAAO,2BAA2B,MAAM,GAAG;AAAA,IAAI;AAAA;AAAA,IAEjF,WAAW;AAAE,aAAO,KAAK,QAAQ,OAAO,YAAY,KAAK,KAAK;AAAA,IAAI;AAAA,IAClE,SAAS,MAAM,SAAS,MAAM,QAAQ,MAAM;AACxC,UAAIkB,KAAI,YAAY,MAAM,MAAM,QAAQ,KAAK;AAC7C,aAAOA,GAAE,SAASA,GAAE,CAAC,IAAI;AAAA,IAC5B;AAAA,IACD,YAAY,MAAM,SAAS,MAAM,QAAQ,MAAM;AAC3C,aAAO,YAAY,MAAM,MAAM,QAAQ,KAAK;AAAA,IAC/C;AAAA,IACD,IAAI,OAAO;AAAE,aAAO;AAAA,IAAO;AAAA,IAC3B,aAAa,SAAS;AAAE,aAAO,iBAAiB,MAAM,OAAO;AAAA,IAAI;AAAA,EACrE;AAAA,EAGA,MAAM,WAAW;AAAA;AAAA,IAEb,IAAI,OAAO;AAAE,aAAO,KAAK,KAAK;AAAA,IAAO;AAAA;AAAA,IAErC,YAAY,MAEZ,OAAO,GAAG;AACN,WAAK,OAAO;AAEZ,WAAK,SAAS;AACd,WAAK,QAAQ;AAEb,WAAK,QAAQ;AACb,WAAK,aAAa;AAClB,UAAI,gBAAgB,UAAU;AAC1B,aAAK,UAAU,IAAI;AAAA,MACtB,OACI;AACD,aAAK,QAAQ,KAAK,QAAQ;AAC1B,aAAK,SAAS,KAAK;AACnB,iBAAShB,KAAI,KAAK,SAASA,IAAGA,KAAIA,GAAE;AAChC,eAAK,MAAM,QAAQA,GAAE,KAAK;AAC9B,aAAK,aAAa;AAClB,aAAK,SAAS,KAAK,KAAK;AAAA,MAC3B;AAAA,IACJ;AAAA,IACD,UAAU,MAAM;AACZ,UAAI,CAAC;AACD,eAAO;AACX,WAAK,QAAQ;AACb,WAAK,OAAO,KAAK;AACjB,WAAK,OAAO,KAAK;AACjB,WAAK,KAAK,KAAK;AACf,aAAO;AAAA,IACV;AAAA,IACD,SAASF,QAAO,MAAM;AAClB,WAAK,QAAQA;AACb,UAAI,EAAE,OAAO,WAAW,KAAK;AAC7B,WAAK,OAAO,QAAQ,OAAO,IAAI,MAAM,OAAO,OAAOA,MAAK,CAAC;AACzD,WAAK,OAAO,QAAQ,OAAO,OAAOA,SAAQ,CAAC;AAC3C,WAAK,KAAK,QAAQ,OAAO,OAAOA,SAAQ,CAAC;AACzC,aAAO;AAAA,IACV;AAAA,IACD,MAAM,MAAM;AACR,UAAI,CAAC;AACD,eAAO;AACX,UAAI,gBAAgB,UAAU;AAC1B,aAAK,SAAS;AACd,eAAO,KAAK,UAAU,IAAI;AAAA,MAC7B;AACD,WAAK,SAAS,KAAK;AACnB,aAAO,KAAK,SAAS,KAAK,OAAO,KAAK,IAAI;AAAA,IAC7C;AAAA;AAAA,IAED,WAAW;AACP,aAAO,KAAK,SAAS,KAAK,OAAO,OAAO,YAAY,KAAK,KAAK,IAAI,KAAK,MAAM,SAAQ;AAAA,IACxF;AAAA;AAAA,IAED,WAAW,KAAK,KAAK,MAAM;AACvB,UAAI,CAAC,KAAK;AACN,eAAO,KAAK,MAAM,KAAK,MAAM,UAAU,MAAM,IAAI,KAAK,MAAM,MAAM,SAAS,SAAS,IAAI,GAAG,KAAK,KAAK,MAAM,KAAK,IAAI,CAAC;AACzH,UAAI,EAAE,OAAM,IAAK,KAAK;AACtB,UAAIA,SAAQ,OAAO,UAAU,KAAK,QAAQ,GAAG,OAAO,OAAO,KAAK,QAAQ,CAAC,GAAG,KAAK,MAAM,KAAK,OAAO,OAAO,IAAI;AAC9G,UAAIA,SAAQ;AACR,eAAO;AACX,WAAK,MAAM,KAAK,KAAK,KAAK;AAC1B,aAAO,KAAK,SAASA,MAAK;AAAA,IAC7B;AAAA;AAAA;AAAA,IAGD,aAAa;AAAE,aAAO,KAAK;AAAA,QAAW;AAAA,QAAG;AAAA,QAAG;AAAA;AAAA,MAAC;AAAA,IAAwB;AAAA;AAAA,IAErE,YAAY;AAAE,aAAO,KAAK;AAAA,QAAW;AAAA,QAAI;AAAA,QAAG;AAAA;AAAA,MAAC;AAAA,IAAwB;AAAA;AAAA,IAErE,WAAW,KAAK;AAAE,aAAO,KAAK;AAAA,QAAW;AAAA,QAAG;AAAA,QAAK;AAAA;AAAA,MAAC;AAAA,IAAqB;AAAA;AAAA,IAEvE,YAAY,KAAK;AAAE,aAAO,KAAK;AAAA,QAAW;AAAA,QAAI;AAAA,QAAK;AAAA;AAAA,MAAE;AAAA,IAAsB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAM3E,MAAM,KAAK,MAAM,OAAO,KAAK,MAAM;AAC/B,UAAI,CAAC,KAAK;AACN,eAAO,KAAK,MAAM,KAAK,MAAM,MAAM,KAAK,MAAM,IAAI,CAAC;AACvD,aAAO,OAAO,SAAS,iBAAiB,QAAQ,KAAK,WAAW,GAAG,KAAK,IAAI;AAAA,IAC/E;AAAA;AAAA,IAED,SAAS;AACL,UAAI,CAAC,KAAK;AACN,eAAO,KAAK,UAAW,KAAK,OAAO,SAAS,mBAAoB,KAAK,MAAM,UAAU,KAAK,MAAM,MAAM;AAC1G,UAAI,KAAK,MAAM;AACX,eAAO,KAAK,SAAS,KAAK,MAAM,IAAK,CAAA;AACzC,UAAI,SAAU,KAAK,OAAO,SAAS,mBAAoB,KAAK,OAAO,SAAS,KAAK,OAAO,OAAO,sBAAqB;AACpH,WAAK,SAAS;AACd,aAAO,KAAK,UAAU,MAAM;AAAA,IAC/B;AAAA;AAAA,IAED,QAAQ,KAAK;AACT,UAAI,CAAC,KAAK;AACN,eAAO,CAAC,KAAK,MAAM,UAAU,QACvB,KAAK,MAAM,KAAK,MAAM,QAAQ,IAAI,OAC9B,KAAK,MAAM,QAAQ,UAAU,KAAK,MAAM,QAAQ,KAAK,KAAK,GAAG,GAAuB,KAAK,IAAI,CAAC;AAC5G,UAAI,EAAE,WAAW,KAAK,QAAQoB,KAAI,KAAK,MAAM,SAAS;AACtD,UAAI,MAAM,GAAG;AACT,YAAI,cAAcA,KAAI,IAAI,IAAI,KAAK,MAAMA,EAAC,IAAI;AAC9C,YAAI,KAAK,SAAS;AACd,iBAAO,KAAK,SAAS,OAAO;AAAA,YAAU;AAAA,YAAa,KAAK;AAAA,YAAO;AAAA,YAAI;AAAA,YAAG;AAAA;AAAA,UAAsB,CAAA;AAAA,MACnG,OACI;AACD,YAAI,QAAQ,OAAO,OAAO,KAAK,QAAQ,CAAC;AACxC,YAAI,SAASA,KAAI,IAAI,OAAO,OAAO,SAAS,OAAO,OAAO,KAAK,MAAMA,EAAC,IAAI,CAAC;AACvE,iBAAO,KAAK,SAAS,KAAK;AAAA,MACjC;AACD,aAAOA,KAAI,IAAI,KAAK,MAAM,KAAK,OAAO,OAAO,UAAU,KAAK,OAAO,QAAQ,KAAK,KAAK,GAAG,GAAuB,KAAK,IAAI,CAAC,IAAI;AAAA,IAChI;AAAA;AAAA,IAED,cAAc;AAAE,aAAO,KAAK,QAAQ,CAAC;AAAA,IAAI;AAAA;AAAA,IAEzC,cAAc;AAAE,aAAO,KAAK,QAAQ,EAAE;AAAA,IAAI;AAAA,IAC1C,WAAW,KAAK;AACZ,UAAIpB,QAAO,QAAQ,EAAE,OAAM,IAAK;AAChC,UAAI,QAAQ;AACR,YAAI,MAAM,GAAG;AACT,cAAI,KAAK,QAAQ,OAAO,OAAO,OAAO;AAClC,mBAAO;AAAA,QACd,OACI;AACD,mBAASD,KAAI,GAAGA,KAAI,KAAK,OAAOA;AAC5B,gBAAI,OAAO,OAAO,OAAOA,KAAI,CAAC,IAAI,KAAK;AACnC,qBAAO;AAAA,QAClB;AACD,SAAC,EAAE,OAAAC,QAAO,OAAQ,IAAG;AAAA,MACxB,OACI;AACD,SAAC,EAAE,OAAAA,QAAO,SAAS,OAAM,IAAK,KAAK;AAAA,MACtC;AACD,aAAO,QAAQ,EAAE,OAAAA,QAAO,SAAS,OAAM,IAAK,QAAQ;AAChD,YAAIA,SAAQ;AACR,mBAASD,KAAIC,SAAQ,KAAKJ,KAAI,MAAM,IAAI,KAAK,OAAO,MAAM,SAAS,QAAQG,MAAKH,IAAGG,MAAK,KAAK;AACzF,gBAAI,QAAQ,OAAO,MAAM,SAASA,EAAC;AACnC,gBAAK,KAAK,OAAO,SAAS,oBACtB,iBAAiB,cACjB,CAAC,MAAM,KAAK,eACZ,SAAS,KAAK;AACd,qBAAO;AAAA,UACd;AAAA,MACR;AACD,aAAO;AAAA,IACV;AAAA,IACD,KAAK,KAAK,OAAO;AACb,UAAI,SAAS,KAAK;AAAA,QAAW;AAAA,QAAK;AAAA,QAAG;AAAA;AAAA,MAAsB;AACvD,eAAO;AACX,iBAAS;AACL,YAAI,KAAK,QAAQ,GAAG;AAChB,iBAAO;AACX,YAAI,KAAK,WAAW,GAAG,KAAK,CAAC,KAAK,OAAQ;AACtC,iBAAO;AAAA,MACd;AAAA,IACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMD,KAAK,QAAQ,MAAM;AAAE,aAAO,KAAK,KAAK,GAAG,KAAK;AAAA,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA,IAKlD,KAAK,QAAQ,MAAM;AAAE,aAAO,KAAK,KAAK,IAAI,KAAK;AAAA,IAAI;AAAA;AAAA;AAAA;AAAA,IAInD,OAAO,KAAK,OAAO,GAAG;AAElB,aAAO,KAAK,QAAQ,KAAK,OACpB,OAAO,IAAI,KAAK,QAAQ,MAAM,KAAK,OAAO,SAC1C,OAAO,KAAK,KAAK,MAAM,MAAM,KAAK,KAAK;AACxC,YAAI,CAAC,KAAK,OAAQ;AACd;AAER,aAAO,KAAK,WAAW,GAAG,KAAK,IAAI,GAAG;AAAA,MAAG;AACzC,aAAO;AAAA,IACV;AAAA;AAAA;AAAA,IAGD,IAAI,OAAO;AACP,UAAI,CAAC,KAAK;AACN,eAAO,KAAK;AAChB,UAAI,QAAQ,KAAK,YAAY,SAAS,MAAM,QAAQ;AACpD,UAAI,SAAS,MAAM,WAAW,KAAK,QAAQ;AACvC;AAAM,mBAASC,SAAQ,KAAK,OAAOoB,KAAI,KAAK,MAAM,QAAQA,MAAK,KAAI;AAC/D,qBAASnB,KAAI,OAAOA,IAAGA,KAAIA,GAAE;AACzB,kBAAIA,GAAE,SAASD,QAAO;AAClB,oBAAIA,UAAS,KAAK;AACd,yBAAOC;AACX,yBAASA;AACT,wBAAQmB,KAAI;AACZ,sBAAM;AAAA,cACT;AACL,YAAApB,SAAQ,KAAK,MAAM,EAAEoB,EAAC;AAAA,UACzB;AAAA,MACJ;AACD,eAASrB,KAAI,OAAOA,KAAI,KAAK,MAAM,QAAQA;AACvC,iBAAS,IAAI,WAAW,KAAK,QAAQ,QAAQ,KAAK,MAAMA,EAAC,CAAC;AAC9D,aAAO,KAAK,aAAa,IAAI,WAAW,KAAK,QAAQ,QAAQ,KAAK,KAAK;AAAA,IAC1E;AAAA;AAAA;AAAA;AAAA,IAID,IAAI,OAAO;AACP,aAAO,KAAK,SAAS,OAAO,KAAK,MAAM;AAAA,IAC1C;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,QAAQ,OAAO,OAAO;AAClB,eAAS,QAAQ,OAAK;AAClB,YAAI,YAAY;AAChB,YAAI,KAAK,KAAK,eAAe,MAAM,IAAI,MAAM,OAAO;AAChD,cAAI,KAAK,cAAc;AACnB;AACA;AAAA,UACH;AACD,cAAI,CAAC,KAAK,KAAK;AACX,wBAAY;AAAA,QACnB;AACD,mBAAS;AACL,cAAI,aAAa;AACb,kBAAM,IAAI;AACd,sBAAY,KAAK,KAAK;AACtB,cAAI,KAAK,YAAa;AAClB;AACJ,cAAI,CAAC;AACD;AACJ,eAAK,OAAM;AACX;AACA,sBAAY;AAAA,QACf;AAAA,MACJ;AAAA,IACJ;AAAA;AAAA;AAAA;AAAA,IAID,aAAa,SAAS;AAClB,UAAI,CAAC,KAAK;AACN,eAAO,iBAAiB,KAAK,MAAM,OAAO;AAC9C,UAAI,EAAE,OAAQ,IAAG,KAAK,QAAQ,EAAE,OAAAe,OAAO,IAAG,OAAO;AACjD,eAASf,KAAI,QAAQ,SAAS,GAAGqB,KAAI,KAAK,MAAM,SAAS,GAAGrB,MAAK,GAAGqB,MAAK;AACrE,YAAIA,KAAI;AACJ,iBAAO,iBAAiB,KAAK,MAAM,SAASrB,EAAC;AACjD,YAAI,OAAOe,OAAM,OAAO,OAAO,KAAK,MAAMM,EAAC,CAAC,CAAC;AAC7C,YAAI,CAAC,KAAK,aAAa;AACnB,cAAI,QAAQrB,EAAC,KAAK,QAAQA,EAAC,KAAK,KAAK;AACjC,mBAAO;AACX,UAAAA;AAAA,QACH;AAAA,MACJ;AACD,aAAO;AAAA,IACV;AAAA,EACL;AACA,WAAS,SAAS,MAAM;AACpB,WAAO,KAAK,SAAS,KAAK,QAAM,cAAc,cAAc,CAAC,GAAG,KAAK,eAAe,SAAS,EAAE,CAAC;AAAA,EACpG;AACA,WAAS,UAAU,MAAM;AACrB,QAAIkB;AACJ,QAAI,EAAE,QAAQ,SAAS,kBAAkB,qBAAqB,SAAS,IAAI,gBAAgB,QAAQ,MAAM,OAAM,IAAK;AACpH,QAAI,SAAS,MAAM,QAAQ,MAAM,IAAI,IAAI,iBAAiB,QAAQ,OAAO,MAAM,IAAI;AACnF,QAAIH,SAAQ,QAAQ;AACpB,QAAI,cAAc,GAAG,YAAY;AACjC,aAAS,SAAS,aAAa,QAAQO,WAAUC,YAAW,UAAU;AAClE,UAAI,EAAE,IAAI,OAAO,KAAK,KAAI,IAAK;AAC/B,UAAI,mBAAmB;AACvB,aAAO,OAAO,GAAG;AACb,eAAO,KAAI;AACX,YAAI,QAAQ,IAA8B;AACtC,cAAIC,QAAO,OAAO,EAAE;AACpB,UAAAF,UAAS,KAAKE,KAAI;AAClB,UAAAD,WAAU,KAAK,QAAQ,WAAW;AAClC;AAAA,QACH,WACQ,QAAQ,IAAsC;AACnD,wBAAc;AACd;AAAA,QACH,WACQ,QAAQ,IAAkC;AAC/C,sBAAY;AACZ;AAAA,QACH,OACI;AACD,gBAAM,IAAI,WAAW,6BAA6B,IAAI,EAAE;AAAA,QAC3D;AAAA,MACJ;AACD,UAAI,OAAOR,OAAM,EAAE,GAAG,MAAMU;AAC5B,UAAI,WAAW,QAAQ;AACvB,UAAI,MAAM,SAAS,oBAAoBA,UAAS,eAAe,OAAO,MAAM,QAAQ,QAAQ,IAAI;AAE5F,YAAIC,QAAO,IAAI,YAAYD,QAAO,OAAOA,QAAO,IAAI;AACpD,YAAI,SAAS,OAAO,MAAMA,QAAO,MAAMxB,SAAQyB,MAAK;AACpD,eAAO,OAAO,MAAM;AAChB,UAAAzB,SAAQ,aAAawB,QAAO,OAAOC,OAAMzB,MAAK;AAClD,eAAO,IAAI,WAAWyB,OAAM,MAAMD,QAAO,OAAO,OAAO;AACvD,mBAAWA,QAAO,QAAQ;AAAA,MAC7B,OACI;AACD,YAAI,SAAS,OAAO,MAAM;AAC1B,eAAO,KAAI;AACX,YAAI,gBAAgB,CAAA,GAAI,iBAAiB;AACzC,YAAI,gBAAgB,MAAM,gBAAgB,KAAK;AAC/C,YAAI,YAAY,GAAG,UAAU;AAC7B,eAAO,OAAO,MAAM,QAAQ;AACxB,cAAI,iBAAiB,KAAK,OAAO,MAAM,iBAAiB,OAAO,QAAQ,GAAG;AACtE,gBAAI,OAAO,OAAO,UAAU,iBAAiB;AACzC,6BAAe,eAAe,gBAAgB,OAAO,WAAW,OAAO,KAAK,SAAS,eAAe,gBAAgB;AACpH,0BAAY,cAAc;AAC1B,wBAAU,OAAO;AAAA,YACpB;AACD,mBAAO,KAAI;AAAA,UACd,OACI;AACD,qBAAS,OAAO,QAAQ,eAAe,gBAAgB,aAAa;AAAA,UACvE;AAAA,QACJ;AACD,YAAI,iBAAiB,KAAK,YAAY,KAAK,YAAY,cAAc;AACjE,yBAAe,eAAe,gBAAgB,OAAO,WAAW,OAAO,SAAS,eAAe,gBAAgB;AACnH,sBAAc,QAAO;AACrB,uBAAe,QAAO;AACtB,YAAI,gBAAgB,MAAM,YAAY,GAAG;AACrC,cAAI,OAAO,aAAa,IAAI;AAC5B,iBAAO,aAAa,MAAM,eAAe,gBAAgB,GAAG,cAAc,QAAQ,GAAG,MAAM,OAAO,MAAM,IAAI;AAAA,QAC/G,OACI;AACD,iBAAO,SAAS,MAAM,eAAe,gBAAgB,MAAM,OAAO,mBAAmB,GAAG;AAAA,QAC3F;AAAA,MACJ;AACD,MAAAH,UAAS,KAAK,IAAI;AAClB,MAAAC,WAAU,KAAK,QAAQ;AAAA,IAC1B;AACD,aAAS,aAAa,MAAM;AACxB,aAAO,CAACD,WAAUC,YAAWI,YAAW;AACpC,YAAIC,aAAY,GAAG,QAAQN,UAAS,SAAS,GAAG,MAAM;AACtD,YAAI,SAAS,MAAM,OAAOA,UAAS,KAAK,cAAc,MAAM;AACxD,cAAI,CAAC,SAAS,KAAK,QAAQ,QAAQ,KAAK,UAAUK;AAC9C,mBAAO;AACX,cAAI,gBAAgB,KAAK,KAAK,SAAS,SAAS;AAC5C,YAAAC,aAAYL,WAAU,KAAK,IAAI,KAAK,SAAS;AAAA,QACpD;AACD,eAAO,SAAS,MAAMD,WAAUC,YAAWI,SAAQC,UAAS;AAAA,MACxE;AAAA,IACK;AACD,aAAS,eAAeN,WAAUC,YAAWM,OAAM7B,IAAG,MAAM,IAAI,MAAM4B,YAAW;AAC7E,UAAI,gBAAgB,CAAA,GAAI,iBAAiB;AACzC,aAAON,UAAS,SAAStB,IAAG;AACxB,sBAAc,KAAKsB,UAAS,IAAK,CAAA;AACjC,uBAAe,KAAKC,WAAU,IAAG,IAAKM,QAAO,IAAI;AAAA,MACpD;AACD,MAAAP,UAAS,KAAK,SAAS,QAAQ,MAAM,IAAI,GAAG,eAAe,gBAAgB,KAAK,MAAMM,aAAY,EAAE,CAAC;AACrG,MAAAL,WAAU,KAAK,OAAOM,KAAI;AAAA,IAC7B;AACD,aAAS,SAAS,MAAMP,WAAUC,YAAWI,SAAQC,aAAY,GAAG,OAAO;AACvE,UAAI,aAAa;AACb,YAAIE,QAAO,CAAC,SAAS,aAAa,WAAW;AAC7C,gBAAQ,QAAQ,CAACA,KAAI,EAAE,OAAO,KAAK,IAAI,CAACA,KAAI;AAAA,MAC/C;AACD,UAAIF,aAAY,IAAI;AAChB,YAAIE,QAAO,CAAC,SAAS,WAAWF,UAAS;AACzC,gBAAQ,QAAQ,CAACE,KAAI,EAAE,OAAO,KAAK,IAAI,CAACA,KAAI;AAAA,MAC/C;AACD,aAAO,IAAI,KAAK,MAAMR,WAAUC,YAAWI,SAAQ,KAAK;AAAA,IAC3D;AACD,aAAS,eAAe,SAAS,UAAU;AAOvC,UAAI,OAAO,OAAO;AAClB,UAAI,OAAO,GAAG,QAAQ,GAAG,OAAO,GAAG,WAAW,KAAK,MAAM;AACzD,UAAI,SAAS,EAAE,MAAM,GAAG,OAAO,GAAG,MAAM;AACxC;AAAM,iBAAS,SAAS,KAAK,MAAM,SAAS,KAAK,MAAM,UAAS;AAC5D,cAAII,YAAW,KAAK;AAEpB,cAAI,KAAK,MAAM,YAAYA,aAAY,GAAG;AAGtC,mBAAO,OAAO;AACd,mBAAO,QAAQ;AACf,mBAAO,OAAO;AACd,oBAAQ;AACR,oBAAQ;AACR,iBAAK,KAAI;AACT;AAAA,UACH;AACD,cAAI,WAAW,KAAK,MAAMA;AAC1B,cAAIA,YAAW,KAAK,WAAW,UAAU,KAAK,QAAQ;AAClD;AACJ,cAAI,eAAe,KAAK,MAAM,gBAAgB,IAAI;AAClD,cAAI,YAAY,KAAK;AACrB,eAAK,KAAI;AACT,iBAAO,KAAK,MAAM,UAAU;AACxB,gBAAI,KAAK,OAAO,GAAG;AACf,kBAAI,KAAK,QAAQ;AACb,gCAAgB;AAAA;AAEhB,sBAAM;AAAA,YACb,WACQ,KAAK,MAAM,eAAe;AAC/B,8BAAgB;AAAA,YACnB;AACD,iBAAK,KAAI;AAAA,UACZ;AACD,kBAAQ;AACR,kBAAQA;AACR,kBAAQ;AAAA,QACX;AACD,UAAI,WAAW,KAAK,QAAQ,SAAS;AACjC,eAAO,OAAO;AACd,eAAO,QAAQ;AACf,eAAO,OAAO;AAAA,MACjB;AACD,aAAO,OAAO,OAAO,IAAI,SAAS;AAAA,IACrC;AACD,aAAS,aAAa,aAAaN,SAAQxB,QAAO;AAC9C,UAAI,EAAE,IAAI,OAAO,KAAK,KAAI,IAAK;AAC/B,aAAO,KAAI;AACX,UAAI,QAAQ,KAAK,KAAK,eAAe;AACjC,YAAI,aAAaA;AACjB,YAAI,OAAO,GAAG;AACV,cAAI,SAAS,OAAO,OAAO,OAAO;AAClC,iBAAO,OAAO,MAAM;AAChB,YAAAA,SAAQ,aAAa,aAAawB,SAAQxB,MAAK;AAAA,QACtD;AACD,QAAAwB,QAAO,EAAExB,MAAK,IAAI;AAClB,QAAAwB,QAAO,EAAExB,MAAK,IAAI,MAAM;AACxB,QAAAwB,QAAO,EAAExB,MAAK,IAAI,QAAQ;AAC1B,QAAAwB,QAAO,EAAExB,MAAK,IAAI;AAAA,MACrB,WACQ,QAAQ,IAAsC;AACnD,sBAAc;AAAA,MACjB,WACQ,QAAQ,IAAkC;AAC/C,oBAAY;AAAA,MACf;AACD,aAAOA;AAAA,IACV;AACD,QAAI,WAAW,CAAA,GAAI,YAAY;AAC/B,WAAO,OAAO,MAAM;AAChB,eAAS,KAAK,SAAS,GAAG,KAAK,eAAe,GAAG,UAAU,WAAW,EAAE;AAC5E,QAAI,UAAUiB,MAAK,KAAK,YAAY,QAAQA,QAAO,SAASA,MAAM,SAAS,SAAS,UAAU,CAAC,IAAI,SAAS,CAAC,EAAE,SAAS;AACxH,WAAO,IAAI,KAAKH,OAAM,KAAK,KAAK,GAAG,SAAS,QAAS,GAAE,UAAU,QAAS,GAAE,MAAM;AAAA,EACtF;AACA,QAAM,gBAAgB,oBAAI;AAC1B,WAAS,SAAS,aAAa,MAAM;AACjC,QAAI,CAAC,YAAY,eAAe,gBAAgB,cAAc,KAAK,QAAQ;AACvE,aAAO;AACX,QAAI,OAAO,cAAc,IAAI,IAAI;AACjC,QAAI,QAAQ,MAAM;AACd,aAAO;AACP,eAAS,SAAS,KAAK,UAAU;AAC7B,YAAI,MAAM,QAAQ,eAAe,EAAE,iBAAiB,OAAO;AACvD,iBAAO;AACP;AAAA,QACH;AACD,gBAAQ,SAAS,aAAa,KAAK;AAAA,MACtC;AACD,oBAAc,IAAI,MAAM,IAAI;AAAA,IAC/B;AACD,WAAO;AAAA,EACX;AACA,WAAS,aAET,aAEA,UAAU,WAEV,MAAM,IAEN,OAEA,QAEA,OAEA,QAAQ;AACJ,QAAI,QAAQ;AACZ,aAASf,KAAI,MAAMA,KAAI,IAAIA;AACvB,eAAS,SAAS,aAAa,SAASA,EAAC,CAAC;AAC9C,QAAI,WAAW,KAAK;AAAA,MAAM,QAAQ,MAAO;AAAA;AAAA;AACzC,QAAI,gBAAgB,CAAA,GAAI,iBAAiB;AACzC,aAAS,OAAOsB,WAAUC,YAAWS,OAAMC,KAAI,QAAQ;AACnD,eAASjC,KAAIgC,OAAMhC,KAAIiC,OAAK;AACxB,YAAI,YAAYjC,IAAG,aAAauB,WAAUvB,EAAC,GAAG,YAAY,SAAS,aAAasB,UAAStB,EAAC,CAAC;AAC3F,QAAAA;AACA,eAAOA,KAAIiC,KAAIjC,MAAK;AAChB,cAAI,WAAW,SAAS,aAAasB,UAAStB,EAAC,CAAC;AAChD,cAAI,YAAY,YAAY;AACxB;AACJ,uBAAa;AAAA,QAChB;AACD,YAAIA,MAAK,YAAY,GAAG;AACpB,cAAI,YAAY,UAAU;AACtB,gBAAI,OAAOsB,UAAS,SAAS;AAC7B,mBAAO,KAAK,UAAU,KAAK,WAAW,GAAG,KAAK,SAAS,QAAQC,WAAU,SAAS,IAAI,MAAM;AAC5F;AAAA,UACH;AACD,wBAAc,KAAKD,UAAS,SAAS,CAAC;AAAA,QACzC,OACI;AACD,cAAIK,UAASJ,WAAUvB,KAAI,CAAC,IAAIsB,UAAStB,KAAI,CAAC,EAAE,SAAS;AACzD,wBAAc,KAAK,aAAa,aAAasB,WAAUC,YAAW,WAAWvB,IAAG,YAAY2B,SAAQ,MAAM,MAAM,CAAC;AAAA,QACpH;AACD,uBAAe,KAAK,aAAa,SAAS,KAAK;AAAA,MAClD;AAAA,IACJ;AACD,WAAO,UAAU,WAAW,MAAM,IAAI,CAAC;AACvC,YAAQ,SAAS,QAAQ,eAAe,gBAAgB,MAAM;AAAA,EAClE;AAAA,EAmDA,MAAM,aAAa;AAAA;AAAA;AAAA;AAAA;AAAA,IAKf,YAIA,MAEA,IAEA,MAKA,QAAQ,YAAY,OAAO,UAAU,OAAO;AACxC,WAAK,OAAO;AACZ,WAAK,KAAK;AACV,WAAK,OAAO;AACZ,WAAK,SAAS;AACd,WAAK,QAAQ,YAAY,IAAqB,MAAM,UAAU,IAAmB;AAAA,IACpF;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,IAAI,YAAY;AAAE,cAAQ,KAAK,OAAO,KAAsB;AAAA,IAAI;AAAA;AAAA;AAAA,IAGhE,IAAI,UAAU;AAAE,cAAQ,KAAK,OAAO,KAAoB;AAAA,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAO5D,OAAO,QAAQ,MAAM,YAAY,CAAA,GAAI,UAAU,OAAO;AAClD,UAAI,SAAS,CAAC,IAAI,aAAa,GAAG,KAAK,QAAQ,MAAM,GAAG,OAAO,OAAO,CAAC;AACvE,eAASO,MAAK;AACV,YAAIA,GAAE,KAAK,KAAK;AACZ,iBAAO,KAAKA,EAAC;AACrB,aAAO;AAAA,IACV;AAAA;AAAA;AAAA;AAAA,IAID,OAAO,aAAa,WAAW,SAAS,SAAS,KAAK;AAClD,UAAI,CAAC,QAAQ;AACT,eAAO;AACX,UAAI,SAAS,CAAA;AACb,UAAI,KAAK,GAAG,QAAQ,UAAU,SAAS,UAAU,CAAC,IAAI;AACtD,eAAS,KAAK,GAAG,MAAM,GAAG,MAAM,KAAI,MAAM;AACtC,YAAI,QAAQ,KAAK,QAAQ,SAAS,QAAQ,EAAE,IAAI;AAChD,YAAI,UAAU,QAAQ,MAAM,QAAQ;AACpC,YAAI,UAAU,OAAO;AACjB,iBAAO,SAAS,MAAM,OAAO,SAAS;AAClC,gBAAI,MAAM;AACV,gBAAI,OAAO,IAAI,QAAQ,WAAW,IAAI,MAAM,KAAK;AAC7C,kBAAI,QAAQ,KAAK,IAAI,IAAI,MAAM,GAAG,IAAI,KAAK,MAAM,KAAK,IAAI,IAAI,IAAI,OAAO,IAAI;AAC7E,oBAAM,SAAS,MAAM,OAAO,IAAI,aAAa,OAAO,KAAK,IAAI,MAAM,IAAI,SAAS,KAAK,KAAK,GAAG,CAAC,CAAC,KAAK;AAAA,YACvG;AACD,gBAAI;AACA,qBAAO,KAAK,GAAG;AACnB,gBAAI,MAAM,KAAK;AACX;AACJ,oBAAQ,KAAK,UAAU,SAAS,UAAU,IAAI,IAAI;AAAA,UACrD;AACL,YAAI,CAAC;AACD;AACJ,cAAM,MAAM;AACZ,cAAM,MAAM,MAAM,MAAM;AAAA,MAC3B;AACD,aAAO;AAAA,IACV;AAAA,EACL;AAAA,EAEA,MAAM,OAAO;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAST,WAAW,OAAO,WAAW,QAAQ;AACjC,UAAI,OAAO,SAAS;AAChB,gBAAQ,IAAI,YAAY,KAAK;AACjC,eAAS,CAAC,SAAS,CAAC,IAAIC,QAAM,GAAG,MAAM,MAAM,CAAC,IAAI,OAAO,SAAS,OAAO,IAAI,CAAAhB,OAAK,IAAIgB,QAAMhB,GAAE,MAAMA,GAAE,EAAE,CAAC,IAAI,CAAC,IAAIgB,QAAM,GAAG,CAAC,CAAC;AAC7H,aAAO,KAAK,YAAY,OAAO,aAAa,CAAA,GAAI,MAAM;AAAA,IACzD;AAAA;AAAA,IAED,MAAM,OAAO,WAAW,QAAQ;AAC5B,UAAI,QAAQ,KAAK,WAAW,OAAO,WAAW,MAAM;AACpD,iBAAS;AACL,YAAI,OAAO,MAAM;AACjB,YAAI;AACA,iBAAO;AAAA,MACd;AAAA,IACJ;AAAA,EACL;AAAA,EACA,MAAM,YAAY;AAAA,IACd,YAAYC,SAAQ;AAChB,WAAK,SAASA;AAAA,IACjB;AAAA,IACD,IAAI,SAAS;AAAE,aAAO,KAAK,OAAO;AAAA,IAAS;AAAA,IAC3C,MAAM,MAAM;AAAE,aAAO,KAAK,OAAO,MAAM,IAAI;AAAA,IAAI;AAAA,IAC/C,IAAI,aAAa;AAAE,aAAO;AAAA,IAAQ;AAAA,IAClC,KAAK,MAAM,IAAI;AAAE,aAAO,KAAK,OAAO,MAAM,MAAM,EAAE;AAAA,IAAI;AAAA,EAC1D;AAkCqB,MAAI,SAAS,EAAE,SAAS,KAAM,CAAA;AAAA,EC56CnD,MAAM,MAAM;AAAA;AAAA,IAER,YAEAhB,IAGA,OAEA,OAMA,WAEA,KAIA,OAKA,QAOA,YAEA,YAEA,YAAY,GAMZ,QAAQ;AACJ,WAAK,IAAIA;AACT,WAAK,QAAQ;AACb,WAAK,QAAQ;AACb,WAAK,YAAY;AACjB,WAAK,MAAM;AACX,WAAK,QAAQ;AACb,WAAK,SAAS;AACd,WAAK,aAAa;AAClB,WAAK,aAAa;AAClB,WAAK,YAAY;AACjB,WAAK,SAAS;AAAA,IACjB;AAAA;AAAA,IAED,WAAW;AACP,aAAO,IAAI,KAAK,MAAM,OAAO,CAACiB,IAAGrC,OAAMA,KAAI,KAAK,CAAC,EAAE,OAAO,KAAK,KAAK,CAAC,KAAK,KAAK,GAAG,GAAG,KAAK,QAAQ,MAAM,KAAK,QAAQ,EAAE;AAAA,IAC1H;AAAA;AAAA;AAAA,IAGD,OAAO,MAAMoB,IAAG,OAAO,MAAM,GAAG;AAC5B,UAAI,KAAKA,GAAE,OAAO;AAClB,aAAO,IAAI,MAAMA,IAAG,CAAE,GAAE,OAAO,KAAK,KAAK,GAAG,IAAI,GAAG,KAAK,IAAI,aAAa,IAAI,GAAG,KAAK,IAAI,MAAM,GAAG,IAAI;AAAA,IACzG;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,IAAI,UAAU;AAAE,aAAO,KAAK,aAAa,KAAK,WAAW,UAAU;AAAA,IAAO;AAAA;AAAA;AAAA;AAAA,IAI1E,UAAU,OAAO,OAAO;AACpB,WAAK,MAAM,KAAK,KAAK,OAAO,OAAO,KAAK,aAAa,KAAK,OAAO,MAAM;AACvE,WAAK,QAAQ;AAAA,IAChB;AAAA;AAAA;AAAA,IAGD,OAAO,QAAQ;AACX,UAAIF;AACJ,UAAI,QAAQ,UAAU,IAAkC,OAAO,SAAS;AACxE,UAAI,EAAE,QAAAoB,QAAM,IAAK,KAAK;AACtB,UAAI,QAAQA,QAAO,kBAAkB,IAAI;AACzC,UAAI;AACA,aAAK,SAAS;AAClB,UAAI,SAAS,GAAG;AACZ,aAAK,UAAUA,QAAO,QAAQ,KAAK,OAAO,MAAM,IAAI,GAAG,KAAK,SAAS;AAGrE,YAAI,OAAOA,QAAO;AACd,eAAK,UAAU,MAAM,KAAK,WAAW,KAAK,WAAW,GAAG,IAAI;AAChE,aAAK,cAAc,MAAM,KAAK,SAAS;AACvC;AAAA,MACH;AAMD,UAAIT,QAAO,KAAK,MAAM,UAAW,QAAQ,KAAK,KAAM,SAAS,SAA+B,IAAI;AAChG,UAAI,QAAQA,QAAO,KAAK,MAAMA,QAAO,CAAC,IAAI,KAAK,EAAE,OAAO,CAAC,EAAE,MAAM,OAAO,KAAK,YAAY;AAIzF,UAAI,QAAQ,OAAsC,GAAGX,MAAK,KAAK,EAAE,OAAO,QAAQ,MAAM,IAAI,OAAO,QAAQA,QAAO,SAAS,SAASA,IAAG,cAAc;AAC/I,YAAI,SAAS,KAAK,EAAE,uBAAuB;AACvC,eAAK,EAAE;AACP,eAAK,EAAE,uBAAuB;AAAA,QACjC,WACQ,KAAK,EAAE,uBAAuB,MAAM;AACzC,eAAK,EAAE,oBAAoB;AAC3B,eAAK,EAAE,wBAAwB;AAC/B,eAAK,EAAE,uBAAuB;AAAA,QACjC;AAAA,MACJ;AACD,UAAI,aAAaW,QAAO,KAAK,MAAMA,QAAO,CAAC,IAAI,GAAG,QAAQ,KAAK,aAAa,KAAK,OAAO,SAAS;AAEjG,UAAI,OAAOS,QAAO,iBAAkB,SAAS,QAAiC;AAC1E,YAAI,MAAMA,QAAO;AAAA,UAAU,KAAK;AAAA,UAAO;AAAA;AAAA,QAAC,IAA4B,KAAK,MAAM,KAAK;AACpF,aAAK,UAAU,MAAM,OAAO,KAAK,QAAQ,GAAG,IAAI;AAAA,MACnD;AACD,UAAI,SAAS,QAA8B;AACvC,aAAK,QAAQ,KAAK,MAAMT,KAAI;AAAA,MAC/B,OACI;AACD,YAAI,cAAc,KAAK,MAAMA,QAAO,CAAC;AACrC,aAAK,QAAQS,QAAO,QAAQ,aAAa,MAAM,IAAI;AAAA,MACtD;AACD,aAAO,KAAK,MAAM,SAAST;AACvB,aAAK,MAAM;AACf,WAAK,cAAc,MAAM,KAAK;AAAA,IACjC;AAAA;AAAA;AAAA,IAGD,UAAU,MAAM,OAAO,KAAK,OAAO,GAAG,WAAW,OAAO;AACpD,UAAI,QAAQ,MACP,CAAC,KAAK,MAAM,UAAU,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC,IAAI,KAAK,OAAO,SAAS,KAAK,aAAa;AAElG,YAAI,MAAM,MAAMU,OAAM,KAAK,OAAO;AAClC,YAAIA,QAAO,KAAK,IAAI,QAAQ;AACxB,UAAAA,OAAM,IAAI,aAAa,IAAI,OAAO;AAClC,gBAAM,IAAI;AAAA,QACb;AACD,YAAIA,OAAM,KAAK,IAAI,OAAOA,OAAM,CAAC,KAAK,KAAoB,IAAI,OAAOA,OAAM,CAAC,IAAI,IAAI;AAChF,cAAI,SAAS;AACT;AACJ,cAAI,IAAI,OAAOA,OAAM,CAAC,KAAK,OAAO;AAC9B,gBAAI,OAAOA,OAAM,CAAC,IAAI;AACtB;AAAA,UACH;AAAA,QACJ;AAAA,MACJ;AACD,UAAI,CAAC,YAAY,KAAK,OAAO,KAAK;AAC9B,aAAK,OAAO,KAAK,MAAM,OAAO,KAAK,IAAI;AAAA,MAC1C,OACI;AACD,YAAItC,SAAQ,KAAK,OAAO;AACxB,YAAIA,SAAQ,KAAK,KAAK,OAAOA,SAAQ,CAAC,KAAK;AACvC,iBAAOA,SAAQ,KAAK,KAAK,OAAOA,SAAQ,CAAC,IAAI,KAAK;AAE9C,iBAAK,OAAOA,MAAK,IAAI,KAAK,OAAOA,SAAQ,CAAC;AAC1C,iBAAK,OAAOA,SAAQ,CAAC,IAAI,KAAK,OAAOA,SAAQ,CAAC;AAC9C,iBAAK,OAAOA,SAAQ,CAAC,IAAI,KAAK,OAAOA,SAAQ,CAAC;AAC9C,iBAAK,OAAOA,SAAQ,CAAC,IAAI,KAAK,OAAOA,SAAQ,CAAC;AAC9C,YAAAA,UAAS;AACT,gBAAI,OAAO;AACP,sBAAQ;AAAA,UACf;AACL,aAAK,OAAOA,MAAK,IAAI;AACrB,aAAK,OAAOA,SAAQ,CAAC,IAAI;AACzB,aAAK,OAAOA,SAAQ,CAAC,IAAI;AACzB,aAAK,OAAOA,SAAQ,CAAC,IAAI;AAAA,MAC5B;AAAA,IACJ;AAAA;AAAA;AAAA,IAGD,MAAM,QAAQ,MAAM,SAAS;AACzB,UAAI,QAAQ,KAAK;AACjB,UAAI,SAAS,QAA8B;AACvC,aAAK,UAAU,SAAS,OAA8B,KAAK,GAAG;AAAA,MACjE,YACS,SAAS,WAAiC,GAAG;AACnD,YAAI,YAAY,QAAQ,EAAE,QAAAqC,QAAM,IAAK,KAAK;AAC1C,YAAI,UAAU,KAAK,OAAO,QAAQA,QAAO,SAAS;AAC9C,eAAK,MAAM;AACX,cAAI,CAACA,QAAO;AAAA,YAAU;AAAA,YAAW;AAAA;AAAA,UAA0B;AACvD,iBAAK,YAAY;AAAA,QACxB;AACD,aAAK,UAAU,WAAW,KAAK;AAC/B,aAAK,aAAa,MAAM,KAAK;AAC7B,YAAI,QAAQA,QAAO;AACf,eAAK,OAAO,KAAK,MAAM,OAAO,SAAS,CAAC;AAAA,MAC/C,OACI;AACD,aAAK,MAAM;AACX,aAAK,aAAa,MAAM,KAAK;AAC7B,YAAI,QAAQ,KAAK,EAAE,OAAO;AACtB,eAAK,OAAO,KAAK,MAAM,OAAO,SAAS,CAAC;AAAA,MAC/C;AAAA,IACJ;AAAA;AAAA;AAAA,IAGD,MAAM,QAAQ,MAAM,SAAS;AACzB,UAAI,SAAS;AACT,aAAK,OAAO,MAAM;AAAA;AAElB,aAAK,MAAM,QAAQ,MAAM,OAAO;AAAA,IACvC;AAAA;AAAA;AAAA,IAGD,QAAQ,OAAO,MAAM;AACjB,UAAIrC,SAAQ,KAAK,EAAE,OAAO,SAAS;AACnC,UAAIA,SAAQ,KAAK,KAAK,EAAE,OAAOA,MAAK,KAAK,OAAO;AAC5C,aAAK,EAAE,OAAO,KAAK,KAAK;AACxB,QAAAA;AAAA,MACH;AACD,UAAI,QAAQ,KAAK;AACjB,WAAK,YAAY,KAAK,MAAM,QAAQ,MAAM;AAC1C,WAAK,UAAU,MAAM,KAAK;AAC1B,WAAK,OAAO;AAAA,QAAKA;AAAA,QAAO;AAAA,QAAO,KAAK;AAAA,QAAW;AAAA;AAAA;AAC/C,UAAI,KAAK;AACL,aAAK,cAAc,KAAK,WAAW,QAAQ,MAAM,KAAK,WAAW,SAAS,OAAO,MAAM,KAAK,EAAE,OAAO,MAAM,KAAK,MAAM,MAAM,MAAM,CAAC,CAAC;AAAA,IAC3I;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,QAAQ;AACJ,UAAI,SAAS;AACb,UAAI,MAAM,OAAO,OAAO;AAKxB,aAAO,MAAM,KAAK,OAAO,OAAO,MAAM,CAAC,IAAI,OAAO;AAC9C,eAAO;AACX,UAAI,SAAS,OAAO,OAAO,MAAM,GAAG,GAAG4B,QAAO,OAAO,aAAa;AAElE,aAAO,UAAUA,SAAQ,OAAO;AAC5B,iBAAS,OAAO;AACpB,aAAO,IAAI,MAAM,KAAK,GAAG,KAAK,MAAM,SAAS,KAAK,OAAO,KAAK,WAAW,KAAK,KAAK,KAAK,OAAO,QAAQA,OAAM,KAAK,YAAY,KAAK,WAAW,MAAM;AAAA,IACvJ;AAAA;AAAA;AAAA,IAGD,gBAAgB,MAAM,SAAS;AAC3B,UAAI,SAAS,QAAQ,KAAK,EAAE,OAAO;AACnC,UAAI;AACA,aAAK,UAAU,MAAM,KAAK,KAAK,SAAS,CAAC;AAC7C,WAAK,UAAU,GAAkB,KAAK,KAAK,SAAS,SAAS,IAAI,CAAC;AAClE,WAAK,MAAM,KAAK,YAAY;AAC5B,WAAK,SAAS;AAAA,IACjB;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,SAAS,MAAM;AACX,eAAS,MAAM,IAAI,eAAe,IAAI,OAAK;AACvC,YAAI,SAAS,KAAK,EAAE,OAAO;AAAA,UAAU,IAAI;AAAA,UAAO;AAAA;AAAA,QAAiC,KAAI,KAAK,EAAE,OAAO,UAAU,IAAI,OAAO,IAAI;AAC5H,YAAI,UAAU;AACV,iBAAO;AACX,aAAK,SAAS,UAAkC;AAC5C,iBAAO;AACX,YAAI,OAAO,MAAM;AAAA,MACpB;AAAA,IACJ;AAAA;AAAA;AAAA;AAAA,IAID,gBAAgB,MAAM;AAClB,UAAI,KAAK,MAAM,UAAU;AACrB,eAAO;AACX,UAAI,aAAa,KAAK,EAAE,OAAO,WAAW,KAAK,KAAK;AACpD,UAAI,WAAW,SAAS,KAA2B,KAAK,KAAK,MAAM,UAAU,KAA0C;AACnH,YAAI,OAAO,CAAA;AACX,iBAAS7B,KAAI,GAAGQ,IAAGR,KAAI,WAAW,QAAQA,MAAK,GAAG;AAC9C,eAAKQ,KAAI,WAAWR,KAAI,CAAC,MAAM,KAAK,SAAS,KAAK,EAAE,OAAO,UAAUQ,IAAG,IAAI;AACxE,iBAAK,KAAK,WAAWR,EAAC,GAAGQ,EAAC;AAAA,QACjC;AACD,YAAI,KAAK,MAAM,SAAS;AACpB,mBAASR,KAAI,GAAG,KAAK,SAAS,KAA2B,KAAKA,KAAI,WAAW,QAAQA,MAAK,GAAG;AACzF,gBAAIQ,KAAI,WAAWR,KAAI,CAAC;AACxB,gBAAI,CAAC,KAAK,KAAK,CAACwC,IAAGxC,OAAOA,KAAI,KAAMwC,MAAKhC,EAAC;AACtC,mBAAK,KAAK,WAAWR,EAAC,GAAGQ,EAAC;AAAA,UACjC;AACL,qBAAa;AAAA,MAChB;AACD,UAAI,SAAS,CAAA;AACb,eAASR,KAAI,GAAGA,KAAI,WAAW,UAAU,OAAO,SAAS,GAAyBA,MAAK,GAAG;AACtF,YAAIQ,KAAI,WAAWR,KAAI,CAAC;AACxB,YAAIQ,MAAK,KAAK;AACV;AACJ,YAAI,QAAQ,KAAK;AACjB,cAAM,UAAUA,IAAG,KAAK,GAAG;AAC3B,cAAM,UAAU,GAAkB,MAAM,KAAK,MAAM,KAAK,GAAG,IAAI;AAC/D,cAAM,aAAa,WAAWR,EAAC,GAAG,KAAK,GAAG;AAC1C,cAAM,SAAS;AACf,eAAO,KAAK,KAAK;AAAA,MACpB;AACD,aAAO;AAAA,IACV;AAAA;AAAA;AAAA;AAAA,IAID,cAAc;AACV,UAAI,EAAE,QAAAsC,QAAM,IAAK,KAAK;AACtB,UAAI,SAASA,QAAO;AAAA,QAAU,KAAK;AAAA,QAAO;AAAA;AAAA;AAC1C,WAAK,SAAS,UAAkC;AAC5C,eAAO;AACX,UAAI,CAACA,QAAO,YAAY,KAAK,OAAO,MAAM,GAAG;AACzC,YAAI,QAAQ,UAAU,IAAkC,OAAO,SAAS;AACxE,YAAI,SAAS,KAAK,MAAM,SAAS,QAAQ;AACzC,YAAI,SAAS,KAAKA,QAAO,QAAQ,KAAK,MAAM,MAAM,GAAG,MAAM,KAAK,IAAI,GAAG;AACnE,cAAI,SAAS,KAAK;AAClB,cAAI,UAAU;AACV,mBAAO;AACX,mBAAS;AAAA,QACZ;AACD,aAAK,UAAU,GAAkB,KAAK,KAAK,KAAK,KAAK,GAAG,IAAI;AAC5D,aAAK,SAAS;AAAA,MACjB;AACD,WAAK,YAAY,KAAK;AACtB,WAAK,OAAO,MAAM;AAClB,aAAO;AAAA,IACV;AAAA;AAAA;AAAA;AAAA,IAID,sBAAsB;AAClB,UAAI,EAAE,QAAAA,QAAM,IAAK,KAAK,GAAG,OAAO,CAAA;AAChC,UAAI,UAAU,CAAC,OAAO,UAAU;AAC5B,YAAI,KAAK,SAAS,KAAK;AACnB;AACJ,aAAK,KAAK,KAAK;AACf,eAAOA,QAAO,WAAW,OAAO,CAAC,WAAW;AACxC,cAAI,UAAU,SAA+B;AAA+B;AAAA,mBACnE,SAAS,OAA+B;AAC7C,gBAAI,UAAU,UAAU,MAAoC;AAC5D,gBAAI,SAAS,GAAG;AACZ,kBAAI,OAAO,SAAS,OAA8B,SAAS,KAAK,MAAM,SAAS,SAAS;AACxF,kBAAI,UAAU,KAAKA,QAAO,QAAQ,KAAK,MAAM,MAAM,GAAG,MAAM,KAAK,KAAK;AAClE,uBAAQ,UAAU,KAAoC,QAAgC;AAAA,YAC7F;AAAA,UACJ,OACI;AACD,gBAAI,QAAQ,QAAQ,QAAQ,QAAQ,CAAC;AACrC,gBAAI,SAAS;AACT,qBAAO;AAAA,UACd;AAAA,QACjB,CAAa;AAAA,MACb;AACQ,aAAO,QAAQ,KAAK,OAAO,CAAC;AAAA,IAC/B;AAAA;AAAA,IAED,WAAW;AACP,aAAO,CAAC,KAAK,EAAE,OAAO;AAAA,QAAU,KAAK;AAAA,QAAO;AAAA;AAAA,SAA8B;AACtE,YAAI,CAAC,KAAK,eAAe;AACrB,eAAK,UAAU,GAAkB,KAAK,KAAK,KAAK,KAAK,GAAG,IAAI;AAC5D;AAAA,QACH;AAAA,MACJ;AACD,aAAO;AAAA,IACV;AAAA;AAAA;AAAA;AAAA,IAID,IAAI,UAAU;AACV,UAAI,KAAK,MAAM,UAAU;AACrB,eAAO;AACX,UAAI,EAAE,QAAAA,QAAM,IAAK,KAAK;AACtB,aAAOA,QAAO,KAAKA,QAAO;AAAA,QAAU,KAAK;AAAA,QAAO;AAAA;AAAA,MAA2B,CAAA,KAAK,SAC5E,CAACA,QAAO;AAAA,QAAU,KAAK;AAAA,QAAO;AAAA;AAAA,MAAC;AAAA,IACtC;AAAA;AAAA;AAAA;AAAA,IAID,UAAU;AACN,WAAK,QAAQ,KAAK,MAAM,CAAC;AACzB,WAAK,MAAM,SAAS;AAAA,IACvB;AAAA;AAAA,IAED,UAAU,OAAO;AACb,UAAI,KAAK,SAAS,MAAM,SAAS,KAAK,MAAM,UAAU,MAAM,MAAM;AAC9D,eAAO;AACX,eAAStC,KAAI,GAAGA,KAAI,KAAK,MAAM,QAAQA,MAAK;AACxC,YAAI,KAAK,MAAMA,EAAC,KAAK,MAAM,MAAMA,EAAC;AAC9B,iBAAO;AACf,aAAO;AAAA,IACV;AAAA;AAAA,IAED,IAAI,SAAS;AAAE,aAAO,KAAK,EAAE;AAAA,IAAS;AAAA;AAAA;AAAA,IAGtC,eAAe,WAAW;AAAE,aAAO,KAAK,EAAE,OAAO,QAAQ,MAAM,SAAS;AAAA,IAAI;AAAA,IAC5E,aAAa,MAAM,OAAO;AACtB,UAAI,KAAK;AACL,aAAK,cAAc,KAAK,WAAW,QAAQ,MAAM,KAAK,WAAW,SAAS,MAAM,MAAM,KAAK,EAAE,OAAO,MAAM,KAAK,CAAC,CAAC;AAAA,IACxH;AAAA,IACD,cAAc,MAAM,OAAO;AACvB,UAAI,KAAK;AACL,aAAK,cAAc,KAAK,WAAW,QAAQ,OAAO,KAAK,WAAW,SAAS,MAAM,MAAM,KAAK,EAAE,OAAO,MAAM,KAAK,CAAC,CAAC;AAAA,IACzH;AAAA;AAAA,IAED,cAAc;AACV,UAAI,OAAO,KAAK,OAAO,SAAS;AAChC,UAAI,OAAO,KAAK,KAAK,OAAO,IAAI,KAAK;AACjC,aAAK,OAAO,KAAK,KAAK,WAAW,MAAM,KAAK,KAAK,KAAK,KAAK,EAAE;AAAA,IACpE;AAAA;AAAA,IAED,gBAAgB;AACZ,UAAI,OAAO,KAAK,OAAO,SAAS;AAChC,UAAI,OAAO,KAAK,KAAK,OAAO,IAAI,KAAK;AACjC,aAAK,OAAO,KAAK,KAAK,WAAW,KAAK,KAAK,KAAK,KAAK,EAAE;AAAA,IAC9D;AAAA,IACD,cAAc,SAAS;AACnB,UAAI,WAAW,KAAK,WAAW,SAAS;AACpC,YAAI,QAAQ,IAAI,aAAa,KAAK,WAAW,SAAS,OAAO;AAC7D,YAAI,MAAM,QAAQ,KAAK,WAAW;AAC9B,eAAK,YAAW;AACpB,aAAK,aAAa;AAAA,MACrB;AAAA,IACJ;AAAA;AAAA,IAED,aAAa,WAAW;AACpB,UAAI,YAAY,KAAK,WAAW;AAC5B,aAAK,cAAa;AAClB,aAAK,YAAY;AAAA,MACpB;AAAA,IACJ;AAAA;AAAA,IAED,QAAQ;AACJ,UAAI,KAAK,cAAc,KAAK,WAAW,QAAQ;AAC3C,aAAK,YAAW;AACpB,UAAI,KAAK,YAAY;AACjB,aAAK,cAAa;AAAA,IACzB;AAAA,EACL;AAAA,EACA,MAAM,aAAa;AAAA,IACf,YAAY,SAAS,SAAS;AAC1B,WAAK,UAAU;AACf,WAAK,UAAU;AACf,WAAK,OAAO,QAAQ,SAAS,QAAQ,KAAK,OAAO,IAAI;AAAA,IACxD;AAAA,EACL;AACA,MAAI;AACJ,GAAC,SAAUyC,UAAS;AAChB,IAAAA,SAAQA,SAAQ,QAAQ,IAAI,GAAG,IAAI;AACnC,IAAAA,SAAQA,SAAQ,QAAQ,IAAI,GAAG,IAAI;AACnC,IAAAA,SAAQA,SAAQ,QAAQ,IAAI,GAAG,IAAI;AACnC,IAAAA,SAAQA,SAAQ,SAAS,IAAI,CAAC,IAAI;AAClC,IAAAA,SAAQA,SAAQ,qBAAqB,IAAI,GAAG,IAAI;AAChD,IAAAA,SAAQA,SAAQ,wBAAwB,IAAI,GAAG,IAAI;AACnD,IAAAA,SAAQA,SAAQ,iBAAiB,IAAI,GAAI,IAAI;AAAA,EACjD,GAAG,YAAY,UAAU,CAAE,EAAC;AAAA,EAG5B,MAAM,eAAe;AAAA,IACjB,YAAY,OAAO;AACf,WAAK,QAAQ;AACb,WAAK,QAAQ,MAAM;AACnB,WAAK,QAAQ,MAAM;AACnB,WAAK,OAAO,KAAK,MAAM;AAAA,IAC1B;AAAA,IACD,OAAO,QAAQ;AACX,UAAI,OAAO,SAAS,OAA8B,QAAQ,UAAU;AACpE,UAAI,SAAS,GAAG;AACZ,YAAI,KAAK,SAAS,KAAK,MAAM;AACzB,eAAK,QAAQ,KAAK,MAAM,MAAK;AACjC,aAAK,MAAM,KAAK,KAAK,OAAO,GAAG,CAAC;AAChC,aAAK,QAAQ;AAAA,MAChB,OACI;AACD,aAAK,SAAS,QAAQ,KAAK;AAAA,MAC9B;AACD,UAAI,OAAO,KAAK,MAAM,EAAE,OAAO,QAAQ,KAAK,MAAM,KAAK,OAAO,CAAC,GAAG,MAAM,IAAI;AAC5E,WAAK,QAAQ;AAAA,IAChB;AAAA,EACL;AAAA,EAGA,MAAM,kBAAkB;AAAA,IACpB,YAAY,OAAO,KAAKxC,QAAO;AAC3B,WAAK,QAAQ;AACb,WAAK,MAAM;AACX,WAAK,QAAQA;AACb,WAAK,SAAS,MAAM;AACpB,UAAI,KAAK,SAAS;AACd,aAAK,UAAS;AAAA,IACrB;AAAA,IACD,OAAO,OAAO,OAAO,MAAM,MAAM,aAAa,MAAM,OAAO,QAAQ;AAC/D,aAAO,IAAI,kBAAkB,OAAO,KAAK,MAAM,MAAM,UAAU;AAAA,IAClE;AAAA,IACD,YAAY;AACR,UAAI,OAAO,KAAK,MAAM;AACtB,UAAI,QAAQ,MAAM;AACd,aAAK,QAAQ,KAAK,MAAM,aAAa,KAAK;AAC1C,aAAK,QAAQ;AACb,aAAK,SAAS,KAAK;AAAA,MACtB;AAAA,IACJ;AAAA,IACD,IAAI,KAAK;AAAE,aAAO,KAAK,OAAO,KAAK,QAAQ,CAAC;AAAA,IAAI;AAAA,IAChD,IAAI,QAAQ;AAAE,aAAO,KAAK,OAAO,KAAK,QAAQ,CAAC;AAAA,IAAI;AAAA,IACnD,IAAI,MAAM;AAAE,aAAO,KAAK,OAAO,KAAK,QAAQ,CAAC;AAAA,IAAI;AAAA,IACjD,IAAI,OAAO;AAAE,aAAO,KAAK,OAAO,KAAK,QAAQ,CAAC;AAAA,IAAI;AAAA,IAClD,OAAO;AACH,WAAK,SAAS;AACd,WAAK,OAAO;AACZ,UAAI,KAAK,SAAS;AACd,aAAK,UAAS;AAAA,IACrB;AAAA,IACD,OAAO;AACH,aAAO,IAAI,kBAAkB,KAAK,OAAO,KAAK,KAAK,KAAK,KAAK;AAAA,IAChE;AAAA,EACL;AAIA,WAAS,YAAY,OAAO,OAAO,aAAa;AAC5C,QAAI,OAAO,SAAS;AAChB,aAAO;AACX,QAAI,QAAQ;AACZ,aAAS,MAAM,GAAG,MAAM,GAAG,MAAM,MAAM,UAAS;AAC5C,UAAI,QAAQ;AACZ,iBAAS;AACL,YAAI,OAAO,MAAM,WAAW,KAAK,GAAG,OAAO;AAC3C,YAAI,QAAQ,KAA6B;AACrC,kBAAQ;AACR;AAAA,QACH;AACD,YAAI,QAAQ;AACR;AACJ,YAAI,QAAQ;AACR;AACJ,YAAI,QAAQ,OAAO;AACnB,YAAI,SAAS,IAAsB;AAC/B,mBAAS;AACT,iBAAO;AAAA,QACV;AACD,iBAAS;AACT,YAAI;AACA;AACJ,iBAAS;AAAA,MACZ;AACD,UAAI;AACA,cAAM,KAAK,IAAI;AAAA;AAEf,gBAAQ,IAAI,KAAK,KAAK;AAAA,IAC7B;AACD,WAAO;AAAA,EACX;AAAA,EAEA,MAAM,YAAY;AAAA,IACd,cAAc;AACV,WAAK,QAAQ;AACb,WAAK,QAAQ;AACb,WAAK,MAAM;AACX,WAAK,WAAW;AAChB,WAAK,YAAY;AACjB,WAAK,OAAO;AACZ,WAAK,UAAU;AAAA,IAClB;AAAA,EACL;AACA,QAAM,YAAY,IAAI;AAAA,EAKtB,MAAM,YAAY;AAAA;AAAA,IAEd,YAEA,OAEA,QAAQ;AACJ,WAAK,QAAQ;AACb,WAAK,SAAS;AAEd,WAAK,QAAQ;AAEb,WAAK,WAAW;AAEhB,WAAK,SAAS;AACd,WAAK,YAAY;AAGjB,WAAK,OAAO;AAEZ,WAAK,QAAQ;AACb,WAAK,aAAa;AAClB,WAAK,MAAM,KAAK,WAAW,OAAO,CAAC,EAAE;AACrC,WAAK,QAAQ,OAAO,CAAC;AACrB,WAAK,MAAM,OAAO,OAAO,SAAS,CAAC,EAAE;AACrC,WAAK,SAAQ;AAAA,IAChB;AAAA;AAAA,IAED,cAAc,QAAQ,OAAO;AACzB,UAAI,QAAQ,KAAK,OAAOA,SAAQ,KAAK;AACrC,UAAI,MAAM,KAAK,MAAM;AACrB,aAAO,MAAM,MAAM,MAAM;AACrB,YAAI,CAACA;AACD,iBAAO;AACX,YAAI,OAAO,KAAK,OAAO,EAAEA,MAAK;AAC9B,eAAO,MAAM,OAAO,KAAK;AACzB,gBAAQ;AAAA,MACX;AACD,aAAO,QAAQ,IAAI,MAAM,MAAM,KAAK,OAAO,MAAM,IAAI;AACjD,YAAIA,UAAS,KAAK,OAAO,SAAS;AAC9B,iBAAO;AACX,YAAI,OAAO,KAAK,OAAO,EAAEA,MAAK;AAC9B,eAAO,KAAK,OAAO,MAAM;AACzB,gBAAQ;AAAA,MACX;AACD,aAAO;AAAA,IACV;AAAA;AAAA,IAED,QAAQ,KAAK;AACT,UAAI,OAAO,KAAK,MAAM,QAAQ,MAAM,KAAK,MAAM;AAC3C,eAAO;AACX,eAAS,SAAS,KAAK;AACnB,YAAI,MAAM,KAAK;AACX,iBAAO,KAAK,IAAI,KAAK,MAAM,IAAI;AACvC,aAAO,KAAK;AAAA,IACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAUD,KAAK,QAAQ;AACT,UAAI,MAAM,KAAK,WAAW,QAAQ,KAAK;AACvC,UAAI,OAAO,KAAK,MAAM,KAAK,MAAM,QAAQ;AACrC,cAAM,KAAK,MAAM;AACjB,iBAAS,KAAK,MAAM,WAAW,GAAG;AAAA,MACrC,OACI;AACD,YAAI,WAAW,KAAK,cAAc,QAAQ,CAAC;AAC3C,YAAI,YAAY;AACZ,iBAAO;AACX,cAAM;AACN,YAAI,OAAO,KAAK,aAAa,MAAM,KAAK,YAAY,KAAK,OAAO,QAAQ;AACpE,mBAAS,KAAK,OAAO,WAAW,MAAM,KAAK,SAAS;AAAA,QACvD,OACI;AACD,cAAID,KAAI,KAAK,YAAY,QAAQ,KAAK;AACtC,iBAAO,MAAM,MAAM;AACf,oBAAQ,KAAK,OAAO,EAAEA,EAAC;AAC3B,eAAK,SAAS,KAAK,MAAM,MAAM,KAAK,YAAY,GAAG;AACnD,cAAI,MAAM,KAAK,OAAO,SAAS,MAAM;AACjC,iBAAK,SAAS,KAAK,OAAO,MAAM,GAAG,MAAM,KAAK,GAAG;AACrD,mBAAS,KAAK,OAAO,WAAW,CAAC;AAAA,QACpC;AAAA,MACJ;AACD,UAAI,OAAO,KAAK,MAAM;AAClB,aAAK,MAAM,YAAY,MAAM;AACjC,aAAO;AAAA,IACV;AAAA;AAAA;AAAA;AAAA,IAID,YAAY,OAAO,YAAY,GAAG;AAC9B,UAAI,MAAM,YAAY,KAAK,cAAc,WAAW,EAAE,IAAI,KAAK;AAC/D,UAAI,OAAO,QAAQ,MAAM,KAAK,MAAM;AAChC,cAAM,IAAI,WAAW,yBAAyB;AAClD,WAAK,MAAM,QAAQ;AACnB,WAAK,MAAM,MAAM;AAAA,IACpB;AAAA,IACD,WAAW;AACP,UAAI,KAAK,OAAO,KAAK,aAAa,KAAK,MAAM,KAAK,YAAY,KAAK,OAAO,QAAQ;AAC9E,YAAI,EAAE,OAAO,SAAU,IAAG;AAC1B,aAAK,QAAQ,KAAK;AAClB,aAAK,WAAW,KAAK;AACrB,aAAK,SAAS;AACd,aAAK,YAAY;AACjB,aAAK,WAAW,KAAK,MAAM,KAAK;AAAA,MACnC,OACI;AACD,aAAK,SAAS,KAAK;AACnB,aAAK,YAAY,KAAK;AACtB,YAAI,YAAY,KAAK,MAAM,MAAM,KAAK,GAAG;AACzC,YAAI,MAAM,KAAK,MAAM,UAAU;AAC/B,aAAK,QAAQ,MAAM,KAAK,MAAM,KAAK,UAAU,MAAM,GAAG,KAAK,MAAM,KAAK,KAAK,GAAG,IAAI;AAClF,aAAK,WAAW,KAAK;AACrB,aAAK,WAAW;AAAA,MACnB;AAAA,IACJ;AAAA,IACD,WAAW;AACP,UAAI,KAAK,YAAY,KAAK,MAAM,QAAQ;AACpC,aAAK,SAAQ;AACb,YAAI,KAAK,YAAY,KAAK,MAAM;AAC5B,iBAAO,KAAK,OAAO;AAAA,MAC1B;AACD,aAAO,KAAK,OAAO,KAAK,MAAM,WAAW,KAAK,QAAQ;AAAA,IACzD;AAAA;AAAA;AAAA,IAGD,QAAQG,KAAI,GAAG;AACX,WAAK,YAAYA;AACjB,aAAO,KAAK,MAAMA,MAAK,KAAK,MAAM,IAAI;AAClC,YAAI,KAAK,cAAc,KAAK,OAAO,SAAS;AACxC,iBAAO,KAAK;AAChB,QAAAA,MAAK,KAAK,MAAM,KAAK,KAAK;AAC1B,aAAK,QAAQ,KAAK,OAAO,EAAE,KAAK,UAAU;AAC1C,aAAK,MAAM,KAAK,MAAM;AAAA,MACzB;AACD,WAAK,OAAOA;AACZ,UAAI,KAAK,OAAO,KAAK,MAAM;AACvB,aAAK,MAAM,YAAY,KAAK,MAAM;AACtC,aAAO,KAAK;IACf;AAAA,IACD,UAAU;AACN,WAAK,MAAM,KAAK,WAAW,KAAK;AAChC,WAAK,QAAQ,KAAK,OAAO,KAAK,aAAa,KAAK,OAAO,SAAS,CAAC;AACjE,WAAK,QAAQ;AACb,aAAO,KAAK,OAAO;AAAA,IACtB;AAAA;AAAA,IAED,MAAM,KAAK,OAAO;AACd,UAAI,OAAO;AACP,aAAK,QAAQ;AACb,cAAM,QAAQ;AACd,cAAM,YAAY,MAAM;AACxB,cAAM,QAAQ,MAAM,WAAW;AAAA,MAClC,OACI;AACD,aAAK,QAAQ;AAAA,MAChB;AACD,UAAI,KAAK,OAAO,KAAK;AACjB,aAAK,MAAM;AACX,YAAI,OAAO,KAAK,KAAK;AACjB,eAAK,QAAO;AACZ,iBAAO;AAAA,QACV;AACD,eAAO,MAAM,KAAK,MAAM;AACpB,eAAK,QAAQ,KAAK,OAAO,EAAE,KAAK,UAAU;AAC9C,eAAO,OAAO,KAAK,MAAM;AACrB,eAAK,QAAQ,KAAK,OAAO,EAAE,KAAK,UAAU;AAC9C,YAAI,OAAO,KAAK,YAAY,MAAM,KAAK,WAAW,KAAK,MAAM,QAAQ;AACjE,eAAK,WAAW,MAAM,KAAK;AAAA,QAC9B,OACI;AACD,eAAK,QAAQ;AACb,eAAK,WAAW;AAAA,QACnB;AACD,aAAK,SAAQ;AAAA,MAChB;AACD,aAAO;AAAA,IACV;AAAA;AAAA,IAED,KAAK,MAAM,IAAI;AACX,UAAI,QAAQ,KAAK,YAAY,MAAM,KAAK,WAAW,KAAK,MAAM;AAC1D,eAAO,KAAK,MAAM,MAAM,OAAO,KAAK,UAAU,KAAK,KAAK,QAAQ;AACpE,UAAI,QAAQ,KAAK,aAAa,MAAM,KAAK,YAAY,KAAK,OAAO;AAC7D,eAAO,KAAK,OAAO,MAAM,OAAO,KAAK,WAAW,KAAK,KAAK,SAAS;AACvE,UAAI,QAAQ,KAAK,MAAM,QAAQ,MAAM,KAAK,MAAM;AAC5C,eAAO,KAAK,MAAM,KAAK,MAAM,EAAE;AACnC,UAAI,SAAS;AACb,eAASgB,MAAK,KAAK,QAAQ;AACvB,YAAIA,GAAE,QAAQ;AACV;AACJ,YAAIA,GAAE,KAAK;AACP,oBAAU,KAAK,MAAM,KAAK,KAAK,IAAIA,GAAE,MAAM,IAAI,GAAG,KAAK,IAAIA,GAAE,IAAI,EAAE,CAAC;AAAA,MAC3E;AACD,aAAO;AAAA,IACV;AAAA,EACL;AAAA,EAEA,MAAM,WAAW;AAAA,IACb,YAAY,MAAM,IAAI;AAClB,WAAK,OAAO;AACZ,WAAK,KAAK;AAAA,IACb;AAAA,IACD,MAAM,OAAO,OAAO;AAChB,UAAI,EAAE,QAAAmB,QAAM,IAAK,MAAM;AACvB,gBAAU,KAAK,MAAM,OAAO,OAAO,KAAK,IAAIA,QAAO,MAAMA,QAAO,cAAc;AAAA,IACjF;AAAA,EACL;AACA,aAAW,UAAU,aAAa,WAAW,UAAU,WAAW,WAAW,UAAU,SAAS;AA6BzD,aAAW,UAAU,WAAW,WAAW,UAAU,SAAS;AAAA,EAGrG,MAAM,kBAAkB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMpB,YAEA,OAAO,UAAU,IAAI;AACjB,WAAK,QAAQ;AACb,WAAK,aAAa,CAAC,CAAC,QAAQ;AAC5B,WAAK,WAAW,CAAC,CAAC,QAAQ;AAC1B,WAAK,SAAS,CAAC,CAAC,QAAQ;AAAA,IAC3B;AAAA,EACL;AAqBA,WAAS,UAAU,MAAM,OAAO,OAAO,OAAO,WAAW,YAAY;AACjE,QAAI,QAAQ,GAAG,YAAY,KAAK,OAAO,EAAE,YAAY,MAAM,EAAE;AAC7D;AAAM,iBAAS;AACX,aAAK,YAAY,KAAK,KAAK,MAAM;AAC7B;AACJ,YAAI,SAAS,KAAK,QAAQ,CAAC;AAI3B,iBAAStC,KAAI,QAAQ,GAAGA,KAAI,QAAQA,MAAK;AACrC,eAAK,KAAKA,KAAI,CAAC,IAAI,aAAa,GAAG;AAC/B,gBAAI,OAAO,KAAKA,EAAC;AACjB,gBAAI,QAAQ,OAAO,IAAI,MAClB,MAAM,MAAM,SAAS,MAAM,MAAM,MAAM,SAAS,QAC7C,UAAU,MAAM,MAAM,MAAM,OAAO,WAAW,UAAU,IAAI;AAChE,oBAAM,YAAY,IAAI;AACtB;AAAA,YACH;AAAA,UACJ;AACL,YAAI,OAAO,MAAM,MAAM,MAAM,GAAG,OAAO,KAAK,QAAQ,CAAC;AAErD,YAAI,MAAM,OAAO,KAAK,OAAO,OAAO,KAAK,SAAS,OAAO,IAAI,CAAC,KAAK,SAAuB,KAAK,SAAS,OAAO,IAAI,CAAC,KAAK,OAAqB;AAC1I,kBAAQ,KAAK,SAAS,OAAO,IAAI,CAAC;AAClC,mBAAS;AAAA,QACZ;AAED,eAAO,MAAM,QAAO;AAChB,cAAI,MAAO,MAAM,QAAS;AAC1B,cAAIC,SAAQ,SAAS,OAAO,OAAO;AACnC,cAAI,OAAO,KAAKA,MAAK,GAAG,KAAK,KAAKA,SAAQ,CAAC,KAAK;AAChD,cAAI,OAAO;AACP,mBAAO;AAAA,mBACF,QAAQ;AACb,kBAAM,MAAM;AAAA,eACX;AACD,oBAAQ,KAAKA,SAAQ,CAAC;AACtB,kBAAM,QAAO;AACb,qBAAS;AAAA,UACZ;AAAA,QACJ;AACD;AAAA,MACH;AAAA,EACL;AACA,WAAS,WAAW,MAAM,OAAO,MAAM;AACnC,aAASD,KAAI,OAAO,OAAO,OAAO,KAAKA,EAAC,MAAM,OAAqBA;AAC/D,UAAI,QAAQ;AACR,eAAOA,KAAI;AACnB,WAAO;AAAA,EACX;AACA,WAAS,UAAU,OAAO,MAAM,WAAW,aAAa;AACpD,QAAI,QAAQ,WAAW,WAAW,aAAa,IAAI;AACnD,WAAO,QAAQ,KAAK,WAAW,WAAW,aAAa,KAAK,IAAI;AAAA,EACpE;AAGA,QAAM,UAAU,OAAO,WAAW,eAAe,QAAQ,OAAO,YAAY,KAAK,QAAQ,IAAI,GAAG;AAChG,MAAI,WAAW;AACf,MAAI;AACJ,GAAC,SAAU0C,SAAQ;AACf,IAAAA,QAAOA,QAAO,QAAQ,IAAI,EAAE,IAAI;AAAA,EACpC,GAAG,WAAW,SAAS,CAAE,EAAC;AAC1B,WAAS,MAAM,MAAM,KAAK,MAAM;AAC5B,QAAI,SAAS,KAAK,OAAO,SAAS,gBAAgB;AAClD,WAAO,OAAO,GAAG;AACjB,eAAS;AACL,UAAI,EAAE,OAAO,IAAI,OAAO,YAAY,GAAG,IAAI,OAAO,WAAW,GAAG;AAC5D,mBAAS;AACL,eAAK,OAAO,IAAI,OAAO,KAAK,MAAM,OAAO,OAAO,QAAQ,CAAC,OAAO,KAAK;AACjE,mBAAO,OAAO,IAAI,KAAK,IAAI,GAAG,KAAK;AAAA,cAAI,OAAO,KAAK;AAAA,cAAG,MAAM;AAAA;AAAA,YAAE,CAAqB,IAC7E,KAAK,IAAI,KAAK,QAAQ,KAAK;AAAA,cAAI,OAAO,OAAO;AAAA,cAAG,MAAM;AAAA;AAAA,YAAuB,CAAA;AACvF,cAAI,OAAO,IAAI,OAAO,YAAa,IAAG,OAAO,YAAa;AACtD;AACJ,cAAI,CAAC,OAAO,OAAQ;AAChB,mBAAO,OAAO,IAAI,IAAI,KAAK;AAAA,QAClC;AAAA,IACR;AAAA,EACL;AAAA,EACA,MAAM,eAAe;AAAA,IACjB,YAAY,WAAW,SAAS;AAC5B,WAAK,YAAY;AACjB,WAAK,UAAU;AACf,WAAK,IAAI;AACT,WAAK,WAAW;AAChB,WAAK,WAAW;AAChB,WAAK,SAAS;AACd,WAAK,QAAQ;AACb,WAAK,QAAQ;AACb,WAAK,QAAQ;AACb,WAAK,aAAY;AAAA,IACpB;AAAA,IACD,eAAe;AACX,UAAI,KAAK,KAAK,WAAW,KAAK,KAAK,KAAK,UAAU,SAAS,OAAO,KAAK,UAAU,KAAK,GAAG;AACzF,UAAI,IAAI;AACJ,aAAK,WAAW,GAAG,YAAY,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,QAAQ,CAAC,IAAI,GAAG,SAAS,GAAG;AACvF,aAAK,SAAS,GAAG,UAAU,MAAM,GAAG,MAAM,GAAG,KAAK,GAAG,QAAQ,EAAE,IAAI,GAAG,SAAS,GAAG;AAClF,eAAO,KAAK,MAAM,QAAQ;AACtB,eAAK,MAAM;AACX,eAAK,MAAM;AACX,eAAK,MAAM;QACd;AACD,aAAK,MAAM,KAAK,GAAG,IAAI;AACvB,aAAK,MAAM,KAAK,CAAC,GAAG,MAAM;AAC1B,aAAK,MAAM,KAAK,CAAC;AACjB,aAAK,YAAY,KAAK;AAAA,MACzB,OACI;AACD,aAAK,YAAY;AAAA,MACpB;AAAA,IACJ;AAAA;AAAA,IAED,OAAO,KAAK;AACR,UAAI,MAAM,KAAK;AACX,eAAO;AACX,aAAO,KAAK,YAAY,KAAK,UAAU;AACnC,aAAK,aAAY;AACrB,UAAI,CAAC,KAAK;AACN,eAAO;AACX,iBAAS;AACL,YAAI,OAAO,KAAK,MAAM,SAAS;AAC/B,YAAI,OAAO,GAAG;AACV,eAAK,aAAY;AACjB,iBAAO;AAAA,QACV;AACD,YAAIH,OAAM,KAAK,MAAM,IAAI,GAAGtC,SAAQ,KAAK,MAAM,IAAI;AACnD,YAAIA,UAASsC,KAAI,SAAS,QAAQ;AAC9B,eAAK,MAAM;AACX,eAAK,MAAM;AACX,eAAK,MAAM;AACX;AAAA,QACH;AACD,YAAI,OAAOA,KAAI,SAAStC,MAAK;AAC7B,YAAI,QAAQ,KAAK,MAAM,IAAI,IAAIsC,KAAI,UAAUtC,MAAK;AAClD,YAAI,QAAQ,KAAK;AACb,eAAK,YAAY;AACjB,iBAAO;AAAA,QACV;AACD,YAAI,gBAAgB,MAAM;AACtB,cAAI,SAAS,KAAK;AACd,gBAAI,QAAQ,KAAK;AACb,qBAAO;AACX,gBAAI,MAAM,QAAQ,KAAK;AACvB,gBAAI,OAAO,KAAK,QAAQ;AACpB,kBAAI,YAAY,KAAK,KAAK,SAAS,SAAS;AAC5C,kBAAI,CAAC,aAAa,MAAM,YAAY,KAAK,SAAS;AAC9C,uBAAO;AAAA,YACd;AAAA,UACJ;AACD,eAAK,MAAM,IAAI;AACf,cAAI,QAAQ,KAAK,UAAU,KAAK,IAAI,KAAK,UAAU,GAAG,GAAG;AACrD,iBAAK,MAAM,KAAK,IAAI;AACpB,iBAAK,MAAM,KAAK,KAAK;AACrB,iBAAK,MAAM,KAAK,CAAC;AAAA,UACpB;AAAA,QACJ,OACI;AACD,eAAK,MAAM,IAAI;AACf,eAAK,YAAY,QAAQ,KAAK;AAAA,QACjC;AAAA,MACJ;AAAA,IACJ;AAAA,EACL;AAAA,EACA,MAAM,WAAW;AAAA,IACb,YAAYqC,SAAQ,QAAQ;AACxB,WAAK,SAAS;AACd,WAAK,SAAS;AACd,WAAK,YAAY;AACjB,WAAK,UAAU;AACf,WAAK,SAASA,QAAO,WAAW,IAAI,CAAAD,OAAK,IAAI,aAAW;AAAA,IAC3D;AAAA,IACD,WAAW,OAAO;AACd,UAAI,cAAc;AAClB,UAAI,OAAO;AACX,UAAI,EAAE,QAAAC,QAAM,IAAK,MAAM,GAAG,EAAE,WAAY,IAAGA;AAC3C,UAAI,OAAOA,QAAO;AAAA,QAAU,MAAM;AAAA,QAAO;AAAA;AAAA;AACzC,UAAI,UAAU,MAAM,aAAa,MAAM,WAAW,OAAO;AACzD,UAAI,YAAY;AAChB,eAAStC,KAAI,GAAGA,KAAI,WAAW,QAAQA,MAAK;AACxC,aAAM,KAAKA,KAAK,SAAS;AACrB;AACJ,YAAI,YAAY,WAAWA,EAAC,GAAG,QAAQ,KAAK,OAAOA,EAAC;AACpD,YAAI,QAAQ,CAAC,UAAU;AACnB;AACJ,YAAI,UAAU,cAAc,MAAM,SAAS,MAAM,OAAO,MAAM,QAAQ,QAAQ,MAAM,WAAW,SAAS;AACpG,eAAK,kBAAkB,OAAO,WAAW,KAAK;AAC9C,gBAAM,OAAO;AACb,gBAAM,UAAU;AAAA,QACnB;AACD,YAAI,MAAM,YAAY,MAAM,MAAM;AAC9B,sBAAY,KAAK,IAAI,MAAM,WAAW,SAAS;AACnD,YAAI,MAAM,SAAS,GAAkB;AACjC,cAAI,aAAa;AACjB,cAAI,MAAM,WAAW;AACjB,0BAAc,KAAK,WAAW,OAAO,MAAM,UAAU,MAAM,KAAK,WAAW;AAC/E,wBAAc,KAAK,WAAW,OAAO,MAAM,OAAO,MAAM,KAAK,WAAW;AACxE,cAAI,CAAC,UAAU,QAAQ;AACnB,mBAAO;AACP,gBAAI,cAAc;AACd;AAAA,UACP;AAAA,QACJ;AAAA,MACJ;AACD,aAAO,KAAK,QAAQ,SAAS;AACzB,aAAK,QAAQ;AACjB,UAAI;AACA,cAAM,aAAa,SAAS;AAChC,UAAI,CAAC,QAAQ,MAAM,OAAO,KAAK,OAAO,KAAK;AACvC,eAAO,IAAI;AACX,aAAK,QAAQ,MAAM,EAAE,OAAO;AAC5B,aAAK,QAAQ,KAAK,MAAM,MAAM;AAC9B,sBAAc,KAAK,WAAW,OAAO,KAAK,OAAO,KAAK,KAAK,WAAW;AAAA,MACzE;AACD,WAAK,YAAY;AACjB,aAAO,KAAK;AAAA,IACf;AAAA,IACD,aAAa,OAAO;AAChB,UAAI,KAAK;AACL,eAAO,KAAK;AAChB,UAAI,OAAO,IAAI,eAAa,EAAE,KAAK,GAAAoB,GAAG,IAAG;AACzC,WAAK,QAAQ;AACb,WAAK,MAAM,KAAK,IAAI,MAAM,GAAGA,GAAE,OAAO,GAAG;AACzC,WAAK,QAAQ,OAAOA,GAAE,OAAO,MAAMA,GAAE,OAAO,UAAU;AACtD,aAAO;AAAA,IACV;AAAA,IACD,kBAAkB,OAAO,WAAW,OAAO;AACvC,UAAI,QAAQ,KAAK,OAAO,QAAQ,MAAM,GAAG;AACzC,gBAAU,MAAM,KAAK,OAAO,MAAM,OAAO,KAAK,GAAG,KAAK;AACtD,UAAI,MAAM,QAAQ,IAAI;AAClB,YAAI,EAAE,QAAAkB,QAAM,IAAK,MAAM;AACvB,iBAAStC,KAAI,GAAGA,KAAIsC,QAAO,YAAY,QAAQtC;AAC3C,cAAIsC,QAAO,YAAYtC,EAAC,KAAK,MAAM,OAAO;AACtC,gBAAI,SAASsC,QAAO,aAAatC,EAAC,EAAE,KAAK,OAAO,KAAK,MAAM,OAAO,MAAM,GAAG,GAAG,KAAK;AACnF,gBAAI,UAAU,KAAK,MAAM,EAAE,OAAO,QAAQ,OAAO,UAAU,CAAC,GAAG;AAC3D,mBAAK,SAAS,MAAM;AAChB,sBAAM,QAAQ,UAAU;AAAA;AAExB,sBAAM,WAAW,UAAU;AAC/B;AAAA,YACH;AAAA,UACJ;AAAA,MACR,OACI;AACD,cAAM,QAAQ;AACd,cAAM,MAAM,KAAK,OAAO,QAAQ,QAAQ,CAAC;AAAA,MAC5C;AAAA,IACJ;AAAA,IACD,UAAU,QAAQ,OAAO,KAAKC,QAAO;AAEjC,eAASD,KAAI,GAAGA,KAAIC,QAAOD,MAAK;AAC5B,YAAI,KAAK,QAAQA,EAAC,KAAK;AACnB,iBAAOC;AACf,WAAK,QAAQA,QAAO,IAAI;AACxB,WAAK,QAAQA,QAAO,IAAI;AACxB,WAAK,QAAQA,QAAO,IAAI;AACxB,aAAOA;AAAA,IACV;AAAA,IACD,WAAW,OAAO,OAAO,KAAKA,QAAO;AACjC,UAAI,EAAE,MAAK,IAAK,OAAO,EAAE,QAAAqC,QAAM,IAAK,MAAM,GAAG,EAAE,KAAM,IAAGA;AACxD,eAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAC9B,iBAAStC,KAAIsC,QAAO;AAAA,UAAU;AAAA,UAAO,MAAM,IAA0B;AAAA;AAAA,QAAC,KAA6BtC,MAAK,GAAG;AACvG,cAAI,KAAKA,EAAC,KAAK,OAAqB;AAChC,gBAAI,KAAKA,KAAI,CAAC,KAAK,GAAkB;AACjC,cAAAA,KAAI,KAAK,MAAMA,KAAI,CAAC;AAAA,YACvB,OACI;AACD,kBAAIC,UAAS,KAAK,KAAKD,KAAI,CAAC,KAAK;AAC7B,gBAAAC,SAAQ,KAAK,UAAU,KAAK,MAAMD,KAAI,CAAC,GAAG,OAAO,KAAKC,MAAK;AAC/D;AAAA,YACH;AAAA,UACJ;AACD,cAAI,KAAKD,EAAC,KAAK;AACX,YAAAC,SAAQ,KAAK,UAAU,KAAK,MAAMD,KAAI,CAAC,GAAG,OAAO,KAAKC,MAAK;AAAA,QAClE;AAAA,MACJ;AACD,aAAOA;AAAA,IACV;AAAA,EACL;AACA,MAAI;AACJ,GAAC,SAAU0C,MAAK;AACZ,IAAAA,KAAIA,KAAI,UAAU,IAAI,CAAC,IAAI;AAC3B,IAAAA,KAAIA,KAAI,qBAAqB,IAAI,CAAC,IAAI;AAGtC,IAAAA,KAAIA,KAAI,sBAAsB,IAAI,GAAG,IAAI;AACzC,IAAAA,KAAIA,KAAI,kBAAkB,IAAI,EAAE,IAAI;AAIpC,IAAAA,KAAIA,KAAI,UAAU,IAAI,IAAK,IAAI;AAC/B,IAAAA,KAAIA,KAAI,OAAO,IAAI,GAAI,IAAI;AAC3B,IAAAA,KAAIA,KAAI,kCAAkC,IAAI,GAAG,IAAI;AAIrD,IAAAA,KAAIA,KAAI,eAAe,IAAI,EAAE,IAAI;AAAA,EACrC,GAAG,QAAQ,MAAM,CAAE,EAAC;AAAA,EACpB,MAAM,MAAM;AAAA,IACR,YAAYL,SAAQ,OAAO,WAAW,QAAQ;AAC1C,WAAK,SAASA;AACd,WAAK,QAAQ;AACb,WAAK,SAAS;AACd,WAAK,aAAa;AAClB,WAAK,cAAc;AACnB,WAAK,cAAc;AACnB,WAAK,SAAS;AACd,WAAK,YAAY;AACjB,WAAK,wBAAwB;AAC7B,WAAK,uBAAuB;AAC5B,WAAK,oBAAoB;AACzB,WAAK,SAAS,IAAI,YAAY,OAAO,MAAM;AAC3C,WAAK,SAAS,IAAI,WAAWA,SAAQ,KAAK,MAAM;AAChD,WAAK,UAAUA,QAAO,IAAI,CAAC;AAC3B,UAAI,EAAE,KAAI,IAAK,OAAO,CAAC;AACvB,WAAK,SAAS,CAAC,MAAM,MAAM,MAAMA,QAAO,IAAI,CAAC,GAAG,IAAI,CAAC;AACrD,WAAK,YAAY,UAAU,UAAU,KAAK,OAAO,MAAM,OAAOA,QAAO,eAAe,IAC9E,IAAI,eAAe,WAAWA,QAAO,OAAO,IAAI;AAAA,IACzD;AAAA,IACD,IAAI,YAAY;AACZ,aAAO,KAAK;AAAA,IACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOD,UAAU;AACN,UAAI,SAAS,KAAK,QAAQ,MAAM,KAAK;AAErC,UAAI,YAAY,KAAK,SAAS;AAC9B,UAAI,SAAS;AAQb,UAAI,KAAK,oBAAoB,OAAkD,OAAO,UAAU,GAAG;AAC/F,YAAI,CAAC9B,EAAC,IAAI;AACV,eAAOA,GAAE,YAAa,KAAIA,GAAE,MAAM,UAAUA,GAAE,MAAMA,GAAE,MAAM,SAAS,CAAC,KAAK,KAAK,uBAAuB;AAAA,QAAG;AAC1G,aAAK,oBAAoB,KAAK,uBAAuB;AAAA,MACxD;AAID,eAASR,KAAI,GAAGA,KAAI,OAAO,QAAQA,MAAK;AACpC,YAAI,QAAQ,OAAOA,EAAC;AACpB,mBAAS;AACL,eAAK,OAAO,YAAY;AACxB,cAAI,MAAM,MAAM,KAAK;AACjB,sBAAU,KAAK,KAAK;AAAA,UACvB,WACQ,KAAK,aAAa,OAAO,WAAW,MAAM,GAAG;AAClD;AAAA,UACH,OACI;AACD,gBAAI,CAAC,SAAS;AACV,wBAAU,CAAA;AACV,8BAAgB,CAAA;AAAA,YACnB;AACD,oBAAQ,KAAK,KAAK;AAClB,gBAAI,MAAM,KAAK,OAAO,aAAa,KAAK;AACxC,0BAAc,KAAK,IAAI,OAAO,IAAI,GAAG;AAAA,UACxC;AACD;AAAA,QACH;AAAA,MACJ;AACD,UAAI,CAAC,UAAU,QAAQ;AACnB,YAAI,WAAW,WAAW,aAAa,OAAO;AAC9C,YAAI;AACA,iBAAO,KAAK,YAAY,QAAQ;AACpC,YAAI,KAAK,OAAO,QAAQ;AACpB,cAAI,WAAW;AACX,oBAAQ,IAAI,uBAAuB,KAAK,OAAO,YAAY,KAAK,OAAO,QAAQ,KAAK,OAAO,UAAU,KAAK,IAAI,OAAO;AACzH,gBAAM,IAAI,YAAY,iBAAiB,GAAG;AAAA,QAC7C;AACD,YAAI,CAAC,KAAK;AACN,eAAK,aAAa;AAAA,MACzB;AACD,UAAI,KAAK,cAAc,SAAS;AAC5B,YAAI,WAAW,KAAK,aAAa,QAAQ,QAAQ,CAAC,EAAE,MAAM,KAAK,YAAY,QAAQ,CAAC,IAC9E,KAAK,YAAY,SAAS,eAAe,SAAS;AACxD,YAAI;AACA,iBAAO,KAAK,YAAY,SAAS,SAAU,CAAA;AAAA,MAClD;AACD,UAAI,KAAK,YAAY;AACjB,YAAI,eAAe,KAAK,cAAc,IAAI,IAAI,KAAK,aAAa;AAChE,YAAI,UAAU,SAAS,cAAc;AACjC,oBAAU,KAAK,CAACL,IAAGsB,OAAMA,GAAE,QAAQtB,GAAE,KAAK;AAC1C,iBAAO,UAAU,SAAS;AACtB,sBAAU,IAAG;AAAA,QACpB;AACD,YAAI,UAAU,KAAK,CAAAa,OAAKA,GAAE,YAAY,GAAG;AACrC,eAAK;AAAA,MACZ,WACQ,UAAU,SAAS,GAAG;AAI3B;AAAO,mBAASR,KAAI,GAAGA,KAAI,UAAU,SAAS,GAAGA,MAAK;AAClD,gBAAI,QAAQ,UAAUA,EAAC;AACvB,qBAAS,IAAIA,KAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AAC3C,kBAAI,QAAQ,UAAU,CAAC;AACvB,kBAAI,MAAM,UAAU,KAAK,KACrB,MAAM,OAAO,SAAS,OAAsC,MAAM,OAAO,SAAS,KAAoC;AACtH,qBAAM,MAAM,QAAQ,MAAM,SAAW,MAAM,OAAO,SAAS,MAAM,OAAO,UAAW,GAAG;AAClF,4BAAU,OAAO,KAAK,CAAC;AAAA,gBAC1B,OACI;AACD,4BAAU,OAAOA,MAAK,CAAC;AACvB,2BAAS;AAAA,gBACZ;AAAA,cACJ;AAAA,YACJ;AAAA,UACJ;AACD,YAAI,UAAU,SAAS;AACnB,oBAAU;AAAA,YAAO;AAAA,YAA4B,UAAU,SAAS;AAAA;AAAA,UAAE;AAAA,MACzE;AACD,WAAK,cAAc,UAAU,CAAC,EAAE;AAChC,eAASA,KAAI,GAAGA,KAAI,UAAU,QAAQA;AAClC,YAAI,UAAUA,EAAC,EAAE,MAAM,KAAK;AACxB,eAAK,cAAc,UAAUA,EAAC,EAAE;AACxC,aAAO;AAAA,IACV;AAAA,IACD,OAAO,KAAK;AACR,UAAI,KAAK,aAAa,QAAQ,KAAK,YAAY;AAC3C,cAAM,IAAI,WAAW,8BAA8B;AACvD,WAAK,YAAY;AAAA,IACpB;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,aAAa,OAAO,QAAQ,OAAO;AAC/B,UAAI,QAAQ,MAAM,KAAK,EAAE,QAAAsC,QAAM,IAAK;AACpC,UAAIT,QAAO,UAAU,KAAK,QAAQ,KAAK,IAAI,SAAS;AACpD,UAAI,KAAK,aAAa,QAAQ,QAAQ,KAAK;AACvC,eAAO,MAAM,gBAAgB,QAAQ;AACzC,UAAI,KAAK,WAAW;AAChB,YAAI,WAAW,MAAM,cAAc,MAAM,WAAW,QAAQ,QAAQ,SAAS,WAAW,MAAM,WAAW,OAAO;AAChH,iBAAS,SAAS,KAAK,UAAU,OAAO,KAAK,GAAG,UAAS;AACrD,cAAI,QAAQ,KAAK,OAAO,QAAQ,MAAM,OAAO,KAAK,EAAE,KAAK,OAAO,OAAOS,QAAO,QAAQ,MAAM,OAAO,OAAO,KAAK,EAAE,IAAI;AACrH,cAAI,QAAQ,MAAM,OAAO,WAAW,CAAC,aAAa,OAAO,KAAK,SAAS,WAAW,KAAK,MAAM,SAAS;AAClG,kBAAM,QAAQ,QAAQ,KAAK;AAC3B,gBAAI;AACA,sBAAQ,IAAIT,QAAO,KAAK,QAAQ,KAAK,IAAI,kBAAkBS,QAAO,QAAQ,OAAO,KAAK,EAAE,CAAC,GAAG;AAChG,mBAAO;AAAA,UACV;AACD,cAAI,EAAE,kBAAkB,SAAS,OAAO,SAAS,UAAU,KAAK,OAAO,UAAU,CAAC,IAAI;AAClF;AACJ,cAAI,QAAQ,OAAO,SAAS,CAAC;AAC7B,cAAI,iBAAiB,QAAQ,OAAO,UAAU,CAAC,KAAK;AAChD,qBAAS;AAAA;AAET;AAAA,QACP;AAAA,MACJ;AACD,UAAI,gBAAgBA,QAAO;AAAA,QAAU,MAAM;AAAA,QAAO;AAAA;AAAA;AAClD,UAAI,gBAAgB,GAAG;AACnB,cAAM,OAAO,aAAa;AAC1B,YAAI;AACA,kBAAQ,IAAIT,QAAO,KAAK,QAAQ,KAAK,IAAI,uBAAuBS,QAAO;AAAA,YAAQ,gBAAgB;AAAA;AAAA,UAAK,CAAwB,GAAG;AACnI,eAAO;AAAA,MACV;AACD,UAAI,MAAM,MAAM,UAAU,MAA0B;AAChD,eAAO,MAAM,MAAM,SAAS,OAAwB,MAAM,YAAW,GAAI;AAAA,QAAG;AAAA,MAC/E;AACD,UAAI,UAAU,KAAK,OAAO,WAAW,KAAK;AAC1C,eAAStC,KAAI,GAAGA,KAAI,QAAQ,UAAS;AACjC,YAAI,SAAS,QAAQA,IAAG,GAAG,OAAO,QAAQA,IAAG,GAAG,MAAM,QAAQA,IAAG;AACjE,YAAI,OAAOA,MAAK,QAAQ,UAAU,CAAC;AACnC,YAAI,aAAa,OAAO,QAAQ,MAAM,MAAK;AAC3C,mBAAW,MAAM,QAAQ,MAAM,GAAG;AAClC,YAAI;AACA,kBAAQ,IAAI6B,QAAO,KAAK,QAAQ,UAAU,IAAI,UAAU,SAAS,UAAkC,IAAI,UACjG,aAAaS,QAAO;AAAA,YAAQ,SAAS;AAAA;AAAA,WAA6B,EAAE,QAAQA,QAAO,QAAQ,IAAI,CAAC,MAAM,KAAK,GAAG,cAAc,QAAQ,KAAK,SAAS,GAAG;AAC/J,YAAI;AACA,iBAAO;AAAA,iBACF,WAAW,MAAM;AACtB,iBAAO,KAAK,UAAU;AAAA;AAEtB,gBAAM,KAAK,UAAU;AAAA,MAC5B;AACD,aAAO;AAAA,IACV;AAAA;AAAA;AAAA;AAAA,IAID,aAAa,OAAO,WAAW;AAC3B,UAAI,MAAM,MAAM;AAChB,iBAAS;AACL,YAAI,CAAC,KAAK,aAAa,OAAO,MAAM,IAAI;AACpC,iBAAO;AACX,YAAI,MAAM,MAAM,KAAK;AACjB,yBAAe,OAAO,SAAS;AAC/B,iBAAO;AAAA,QACV;AAAA,MACJ;AAAA,IACJ;AAAA,IACD,YAAY,QAAQ,QAAQ,WAAW;AACnC,UAAI,WAAW,MAAM,YAAY;AACjC,eAAStC,KAAI,GAAGA,KAAI,OAAO,QAAQA,MAAK;AACpC,YAAI,QAAQ,OAAOA,EAAC,GAAG,QAAQ,OAAOA,MAAK,CAAC,GAAG,WAAW,QAAQA,MAAK,KAAK,CAAC;AAC7E,YAAI6B,QAAO,UAAU,KAAK,QAAQ,KAAK,IAAI,SAAS;AACpD,YAAI,MAAM,SAAS;AACf,cAAI;AACA;AACJ,sBAAY;AACZ,gBAAM,QAAO;AACb,cAAI;AACA,oBAAQ,IAAIA,QAAO,KAAK,QAAQ,KAAK,IAAI,cAAc;AAC3D,cAAI,OAAO,KAAK,aAAa,OAAO,SAAS;AAC7C,cAAI;AACA;AAAA,QACP;AACD,YAAI,QAAQ,MAAM,MAAK,GAAI,YAAYA;AACvC,iBAAS,IAAI,GAAG,MAAM,YAAW,KAAM,IAAI,IAA+B,KAAK;AAC3E,cAAI;AACA,oBAAQ,IAAI,YAAY,KAAK,QAAQ,KAAK,IAAI,qBAAqB;AACvE,cAAI,OAAO,KAAK,aAAa,OAAO,SAAS;AAC7C,cAAI;AACA;AACJ,cAAI;AACA,wBAAY,KAAK,QAAQ,KAAK,IAAI;AAAA,QACzC;AACD,iBAASe,WAAU,MAAM,gBAAgB,KAAK,GAAG;AAC7C,cAAI;AACA,oBAAQ,IAAIf,QAAO,KAAK,QAAQe,OAAM,IAAI,uBAAuB;AACrE,eAAK,aAAaA,SAAQ,SAAS;AAAA,QACtC;AACD,YAAI,KAAK,OAAO,MAAM,MAAM,KAAK;AAC7B,cAAI,YAAY,MAAM,KAAK;AACvB;AACA,oBAAQ;AAAA,UACX;AACD,gBAAM,gBAAgB,OAAO,QAAQ;AACrC,cAAI;AACA,oBAAQ,IAAIf,QAAO,KAAK,QAAQ,KAAK,IAAI,wBAAwB,KAAK,OAAO,QAAQ,KAAK,CAAC,GAAG;AAClG,yBAAe,OAAO,SAAS;AAAA,QAClC,WACQ,CAAC,YAAY,SAAS,QAAQ,MAAM,OAAO;AAChD,qBAAW;AAAA,QACd;AAAA,MACJ;AACD,aAAO;AAAA,IACV;AAAA;AAAA,IAED,YAAY,OAAO;AACf,YAAM,MAAK;AACX,aAAO,KAAK,MAAM;AAAA,QAAE,QAAQ,kBAAkB,OAAO,KAAK;AAAA,QACtD,SAAS,KAAK,OAAO;AAAA,QACrB,OAAO,KAAK;AAAA,QACZ,iBAAiB,KAAK,OAAO;AAAA,QAC7B,QAAQ,KAAK;AAAA,QACb,OAAO,KAAK,OAAO,CAAC,EAAE;AAAA,QACtB,QAAQ,MAAM,MAAM,KAAK,OAAO,CAAC,EAAE;AAAA,QACnC,eAAe,KAAK,OAAO;AAAA,MAAe,CAAA;AAAA,IACjD;AAAA,IACD,QAAQ,OAAO;AACX,UAAI,MAAM,aAAa,WAAW,oBAAI,YAAU,IAAI,KAAK;AACzD,UAAI,CAAC;AACD,iBAAS,IAAI,OAAO,KAAK,OAAO,cAAc,KAAK,aAAa,CAAC;AACrE,aAAO,KAAK;AAAA,IACf;AAAA,EACL;AACA,WAAS,eAAe,OAAO,WAAW;AACtC,aAAS7B,KAAI,GAAGA,KAAI,UAAU,QAAQA,MAAK;AACvC,UAAI,QAAQ,UAAUA,EAAC;AACvB,UAAI,MAAM,OAAO,MAAM,OAAO,MAAM,UAAU,KAAK,GAAG;AAClD,YAAI,UAAUA,EAAC,EAAE,QAAQ,MAAM;AAC3B,oBAAUA,EAAC,IAAI;AACnB;AAAA,MACH;AAAA,IACJ;AACD,cAAU,KAAK,KAAK;AAAA,EACxB;AAAA,EACA,MAAM,QAAQ;AAAA,IACV,YAAY,QAAQ,OAAO,UAAU;AACjC,WAAK,SAAS;AACd,WAAK,QAAQ;AACb,WAAK,WAAW;AAAA,IACnB;AAAA,IACD,OAAO,MAAM;AAAE,aAAO,CAAC,KAAK,YAAY,KAAK,SAAS,IAAI,KAAK;AAAA,IAAI;AAAA,EACvE;AAAA,EA0BA,MAAM,iBAAiB,OAAO;AAAA;AAAA,IAE1B,YAAY,MAAM;AACd;AAEA,WAAK,WAAW;AAChB,UAAI,KAAK,WAAW;AAChB,cAAM,IAAI,WAAW,mBAAmB,KAAK,OAAO,oCAAoC,KAAwB;AACpH,UAAI,YAAY,KAAK,UAAU,MAAM,GAAG;AACxC,WAAK,gBAAgB,UAAU;AAC/B,eAASA,KAAI,GAAGA,KAAI,KAAK,iBAAiBA;AACtC,kBAAU,KAAK,EAAE;AACrB,UAAI,WAAW,OAAO,KAAK,KAAK,QAAQ,EAAE,IAAI,CAAAmB,OAAK,KAAK,SAASA,EAAC,EAAE,CAAC,CAAC;AACtE,UAAI,YAAY,CAAA;AAChB,eAASnB,KAAI,GAAGA,KAAI,UAAU,QAAQA;AAClC,kBAAU,KAAK,CAAA,CAAE;AACrB,eAAS,QAAQ,QAAQ,MAAM,OAAO;AAClC,kBAAU,MAAM,EAAE,KAAK,CAAC,MAAM,KAAK,YAAY,OAAO,KAAK,CAAC,CAAC,CAAC;AAAA,MACjE;AACD,UAAI,KAAK;AACL,iBAAS,YAAY,KAAK,WAAW;AACjC,cAAI,OAAO,SAAS,CAAC;AACrB,cAAI,OAAO,QAAQ;AACf,mBAAO,SAAS,IAAI;AACxB,mBAASA,KAAI,GAAGA,KAAI,SAAS,UAAS;AAClC,gBAAI,OAAO,SAASA,IAAG;AACvB,gBAAI,QAAQ,GAAG;AACX,sBAAQ,MAAM,MAAM,SAASA,IAAG,CAAC;AAAA,YACpC,OACI;AACD,kBAAI,QAAQ,SAASA,KAAI,CAAC,IAAI;AAC9B,uBAAS,IAAI,CAAC,MAAM,IAAI,GAAG;AACvB,wBAAQ,SAASA,IAAG,GAAG,MAAM,KAAK;AACtC,cAAAA;AAAA,YACH;AAAA,UACJ;AAAA,QACJ;AACL,WAAK,UAAU,IAAI,QAAQ,UAAU,IAAI,CAACM,OAAMN,OAAM,SAAS,OAAO;AAAA,QAClE,MAAMA,MAAK,KAAK,gBAAgB,SAAYM;AAAA,QAC5C,IAAIN;AAAA,QACJ,OAAO,UAAUA,EAAC;AAAA,QAClB,KAAK,SAAS,QAAQA,EAAC,IAAI;AAAA,QAC3B,OAAOA,MAAK;AAAA,QACZ,SAAS,KAAK,gBAAgB,KAAK,aAAa,QAAQA,EAAC,IAAI;AAAA,MAChE,CAAA,CAAC,CAAC;AACH,UAAI,KAAK;AACL,aAAK,UAAU,KAAK,QAAQ,OAAO,GAAG,KAAK,WAAW;AAC1D,WAAK,SAAS;AACd,WAAK,eAAe;AACpB,UAAI,aAAa,YAAY,KAAK,SAAS;AAC3C,WAAK,UAAU,KAAK;AACpB,WAAK,mBAAmB,KAAK,eAAe,CAAA;AAC5C,WAAK,cAAc,IAAI,YAAY,KAAK,iBAAiB,MAAM;AAC/D,eAASA,KAAI,GAAGA,KAAI,KAAK,iBAAiB,QAAQA;AAC9C,aAAK,YAAYA,EAAC,IAAI,KAAK,iBAAiBA,EAAC,EAAE;AACnD,WAAK,eAAe,KAAK,iBAAiB,IAAI,cAAc;AAC5D,WAAK,SAAS,YAAY,KAAK,QAAQ,WAAW;AAClD,WAAK,OAAO,YAAY,KAAK,SAAS;AACtC,WAAK,OAAO,YAAY,KAAK,IAAI;AACjC,WAAK,UAAU,KAAK;AACpB,WAAK,aAAa,KAAK,WAAW,IAAI,WAAS,OAAO,SAAS,WAAW,IAAI,WAAW,YAAY,KAAK,IAAI,KAAK;AACnH,WAAK,WAAW,KAAK;AACrB,WAAK,WAAW,KAAK,YAAY,CAAA;AACjC,WAAK,qBAAqB,KAAK,sBAAsB;AACrD,WAAK,iBAAiB,KAAK;AAC3B,WAAK,YAAY,KAAK,aAAa;AACnC,WAAK,UAAU,KAAK,QAAQ,MAAM,SAAS;AAC3C,WAAK,UAAU,KAAK;AACpB,WAAK,MAAM,KAAK,SAAS,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC,CAAC;AAAA,IACzD;AAAA,IACD,YAAY,OAAO,WAAW,QAAQ;AAClC,UAAI,QAAQ,IAAI,MAAM,MAAM,OAAO,WAAW,MAAM;AACpD,eAAS6C,MAAK,KAAK;AACf,gBAAQA,GAAE,OAAO,OAAO,WAAW,MAAM;AAC7C,aAAO;AAAA,IACV;AAAA;AAAA,IAED,QAAQ,OAAO,MAAM,QAAQ,OAAO;AAChC,UAAI,QAAQ,KAAK;AACjB,UAAI,QAAQ,MAAM,CAAC;AACf,eAAO;AACX,eAAS,MAAM,MAAM,OAAO,CAAC,OAAK;AAC9B,YAAI,WAAW,MAAM,KAAK,GAAG,OAAO,WAAW;AAC/C,YAAI,SAAS,MAAM,KAAK;AACxB,YAAI,QAAQ;AACR,iBAAO;AACX,iBAAS,MAAM,OAAO,YAAY,IAAI,MAAM,KAAK;AAC7C,cAAI,MAAM,GAAG,KAAK;AACd,mBAAO;AACf,YAAI;AACA,iBAAO;AAAA,MACd;AAAA,IACJ;AAAA;AAAA,IAED,UAAU,OAAO,UAAU;AACvB,UAAI,OAAO,KAAK;AAChB,eAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAC9B,iBAAS7C,KAAI,KAAK;AAAA,UAAU;AAAA,UAAO,MAAM,IAA0B;AAAA;AAAA,QAA2B,GAAE,QAAOA,MAAK,GAAG;AAC3G,eAAK,OAAO,KAAKA,EAAC,MAAM,OAAqB;AACzC,gBAAI,KAAKA,KAAI,CAAC,KAAK;AACf,qBAAO,KAAKA,KAAI,KAAK,MAAMA,KAAI,CAAC,CAAC;AAAA,qBAC5B,KAAKA,KAAI,CAAC,KAAK;AACpB,qBAAO,KAAK,MAAMA,KAAI,CAAC;AAAA;AAEvB;AAAA,UACP;AACD,cAAI,QAAQ,YAAY,QAAQ;AAC5B,mBAAO,KAAK,MAAMA,KAAI,CAAC;AAAA,QAC9B;AAAA,MACJ;AACD,aAAO;AAAA,IACV;AAAA;AAAA,IAED,UAAU,OAAO,MAAM;AACnB,aAAO,KAAK,OAAQ,QAAQ,IAA2B,IAAI;AAAA,IAC9D;AAAA;AAAA,IAED,UAAU,OAAO,MAAM;AACnB,cAAQ,KAAK;AAAA,QAAU;AAAA,QAAO;AAAA;AAAA,MAAyB,IAAG,QAAQ;AAAA,IACrE;AAAA;AAAA,IAED,YAAY,OAAO,QAAQ;AACvB,aAAO,CAAC,CAAC,KAAK,WAAW,OAAO,CAAAL,OAAKA,MAAK,SAAS,OAAO,IAAI;AAAA,IACjE;AAAA;AAAA,IAED,WAAW,OAAO,QAAQ;AACtB,UAAI,QAAQ,KAAK;AAAA,QAAU;AAAA,QAAO;AAAA;AAAA,MAAC;AACnC,UAAI,SAAS,QAAQ,OAAO,KAAK,IAAI;AACrC,eAASK,KAAI,KAAK;AAAA,QAAU;AAAA,QAAO;AAAA;AAAA,MAA2B,GAAE,UAAU,MAAMA,MAAK,GAAG;AACpF,YAAI,KAAK,KAAKA,EAAC,KAAK,OAAqB;AACrC,cAAI,KAAK,KAAKA,KAAI,CAAC,KAAK;AACpB,YAAAA,KAAI,KAAK,KAAK,MAAMA,KAAI,CAAC;AAAA;AAEzB;AAAA,QACP;AACD,iBAAS,OAAO,KAAK,KAAK,MAAMA,KAAI,CAAC,CAAC;AAAA,MACzC;AACD,aAAO;AAAA,IACV;AAAA;AAAA;AAAA,IAGD,WAAW,OAAO;AACd,UAAI,SAAS,CAAA;AACb,eAASA,KAAI,KAAK;AAAA,QAAU;AAAA,QAAO;AAAA;AAAA,MAA2B,KAAGA,MAAK,GAAG;AACrE,YAAI,KAAK,KAAKA,EAAC,KAAK,OAAqB;AACrC,cAAI,KAAK,KAAKA,KAAI,CAAC,KAAK;AACpB,YAAAA,KAAI,KAAK,KAAK,MAAMA,KAAI,CAAC;AAAA;AAEzB;AAAA,QACP;AACD,aAAK,KAAK,KAAKA,KAAI,CAAC,IAAK,SAAiC,OAAQ,GAAG;AACjE,cAAI,QAAQ,KAAK,KAAKA,KAAI,CAAC;AAC3B,cAAI,CAAC,OAAO,KAAK,CAACwC,IAAGxC,OAAOA,KAAI,KAAMwC,MAAK,KAAK;AAC5C,mBAAO,KAAK,KAAK,KAAKxC,EAAC,GAAG,KAAK;AAAA,QACtC;AAAA,MACJ;AACD,aAAO;AAAA,IACV;AAAA;AAAA;AAAA;AAAA,IAID,UAAU,QAAQ;AAGd,UAAI,OAAO,OAAO,OAAO,OAAO,OAAO,SAAS,SAAS,GAAG,IAAI;AAChE,UAAI,OAAO;AACP,aAAK,UAAU,KAAK,QAAQ,OAAO,GAAG,OAAO,KAAK;AACtD,UAAI,OAAO,KAAK;AACZ,YAAI,OAAO,KAAK,SAAS,OAAO,GAAG;AACnC,YAAI,CAAC;AACD,gBAAM,IAAI,WAAW,yBAAyB,OAAO,GAAG,EAAE;AAC9D,aAAK,MAAM;AAAA,MACd;AACD,UAAI,OAAO;AACP,aAAK,aAAa,KAAK,WAAW,IAAI,CAAA8C,OAAK;AACvC,cAAI,QAAQ,OAAO,WAAW,KAAK,CAAA3B,OAAKA,GAAE,QAAQ2B,EAAC;AACnD,iBAAO,QAAQ,MAAM,KAAKA;AAAA,QAC1C,CAAa;AACL,UAAI,OAAO,cAAc;AACrB,aAAK,eAAe,KAAK,aAAa,MAAK;AAC3C,aAAK,mBAAmB,KAAK,iBAAiB,IAAI,CAACtC,IAAGR,OAAM;AACxD,cAAI,QAAQ,OAAO,aAAa,KAAK,CAAAmB,OAAKA,GAAE,QAAQX,GAAE,QAAQ;AAC9D,cAAI,CAAC;AACD,mBAAOA;AACX,cAAI,OAAO,OAAO,OAAO,OAAO,OAAO,CAAA,GAAIA,EAAC,GAAG,EAAE,UAAU,MAAM,GAAI,CAAA;AACrE,eAAK,aAAaR,EAAC,IAAI,eAAe,IAAI;AAC1C,iBAAO;AAAA,QACvB,CAAa;AAAA,MACJ;AACD,UAAI,OAAO;AACP,aAAK,UAAU,OAAO;AAC1B,UAAI,OAAO;AACP,aAAK,UAAU,KAAK,aAAa,OAAO,OAAO;AACnD,UAAI,OAAO,UAAU;AACjB,aAAK,SAAS,OAAO;AACzB,UAAI,OAAO;AACP,aAAK,WAAW,KAAK,SAAS,OAAO,OAAO,IAAI;AACpD,UAAI,OAAO,gBAAgB;AACvB,aAAK,eAAe,OAAO;AAC/B,aAAO;AAAA,IACV;AAAA;AAAA;AAAA,IAGD,cAAc;AACV,aAAO,KAAK,SAAS,SAAS;AAAA,IACjC;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,QAAQ,MAAM;AACV,aAAO,KAAK,YAAY,KAAK,UAAU,IAAI,IAAI,OAAO,QAAQ,KAAK,WAAW,KAAK,QAAQ,MAAM,IAAI,EAAE,QAAQ,IAAI;AAAA,IACtH;AAAA;AAAA;AAAA,IAGD,IAAI,UAAU;AAAE,aAAO,KAAK,UAAU;AAAA,IAAI;AAAA;AAAA,IAE1C,IAAI,UAAU;AAAE,aAAO,KAAK,QAAQ,MAAM,KAAK,IAAI,CAAC,CAAC;AAAA,IAAI;AAAA;AAAA,IAEzD,kBAAkB,MAAM;AACpB,UAAI+C,QAAO,KAAK;AAChB,aAAOA,SAAQ,OAAO,IAAIA,MAAK,IAAI,KAAK;AAAA,IAC3C;AAAA;AAAA,IAED,aAAa,SAAS;AAClB,UAAI,SAAS,OAAO,KAAK,KAAK,QAAQ,GAAG,QAAQ,OAAO,IAAI,MAAM,KAAK;AACvE,UAAI;AACA,iBAAS,QAAQ,QAAQ,MAAM,GAAG,GAAG;AACjC,cAAI,KAAK,OAAO,QAAQ,IAAI;AAC5B,cAAI,MAAM;AACN,kBAAM,EAAE,IAAI;AAAA,QACnB;AACL,UAAI,WAAW;AACf,eAAS/C,KAAI,GAAGA,KAAI,OAAO,QAAQA;AAC/B,YAAI,CAAC,MAAMA,EAAC,GAAG;AACX,mBAAS,IAAI,KAAK,SAAS,OAAOA,EAAC,CAAC,GAAG,KAAK,KAAK,KAAK,KAAK,GAAG,MAAM;AAChE,aAAC,aAAa,WAAW,IAAI,WAAW,KAAK,UAAU,CAAC,IAAI,EAAE,IAAI;AAAA,QACzE;AACL,aAAO,IAAI,QAAQ,SAAS,OAAO,QAAQ;AAAA,IAC9C;AAAA;AAAA;AAAA,IAGD,OAAO,YAAY,MAAM;AACrB,aAAO,IAAI,SAAS,IAAI;AAAA,IAC3B;AAAA,EACL;AACA,WAAS,KAAK,MAAM,KAAK;AAAE,WAAO,KAAK,GAAG,IAAK,KAAK,MAAM,CAAC,KAAK;AAAA,EAAM;AACtE,WAAS,aAAa,QAAQ;AAC1B,QAAI,OAAO;AACX,aAAS,SAAS,QAAQ;AACtB,UAAI,UAAU,MAAM,EAAE;AACtB,WAAK,MAAM,OAAO,MAAM,EAAE,OAAO,OAAO,WAAW,QAAQ,MAAM,MAAM,YACnE,MAAM,EAAE,OAAO;AAAA,QAAU,MAAM;AAAA,QAAO;AAAA;AAAA,MAA4B,MACjE,CAAC,QAAQ,KAAK,QAAQ,MAAM;AAC7B,eAAO;AAAA,IACd;AACD,WAAO;AAAA,EACX;AACA,WAAS,eAAe,MAAM;AAC1B,QAAI,KAAK,UAAU;AACf,UAAI,OAAO,KAAK,SAAS,IAA4B;AACrD,aAAO,CAAC,OAAO,UAAW,KAAK,SAAS,OAAO,KAAK,KAAK,IAAK;AAAA,IACjE;AACD,WAAO,KAAK;AAAA,EAChB;AC9rDA,MAAI,YAAY;AAAA,EAoBhB,MAAM,IAAI;AAAA;AAAA;AAAA;AAAA,IAIN,YAKA,KAKA6B,OAIA,UAAU;AACN,WAAK,MAAM;AACX,WAAK,OAAOA;AACZ,WAAK,WAAW;AAIhB,WAAK,KAAK;AAAA,IACb;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQD,OAAO,OAAO,QAAQ;AAClB,UAAI,WAAW,QAAQ,WAAW,SAAS,SAAS,OAAO;AACvD,cAAM,IAAI,MAAM,oCAAoC;AACxD,UAAI,MAAM,IAAI,IAAI,CAAE,GAAE,MAAM,CAAE,CAAA;AAC9B,UAAI,IAAI,KAAK,GAAG;AAChB,UAAI;AACA,iBAASiB,MAAK,OAAO;AACjB,cAAI,IAAI,KAAKA,EAAC;AACtB,aAAO;AAAA,IACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAaD,OAAO,iBAAiB;AACpB,UAAI,MAAM,IAAI;AACd,aAAO,CAAC,QAAQ;AACZ,YAAI,IAAI,SAAS,QAAQ,GAAG,IAAI;AAC5B,iBAAO;AACX,eAAO,SAAS,IAAI,IAAI,QAAQ,KAAK,IAAI,SAAS,OAAO,GAAG,EAAE,KAAK,CAACnD,IAAGsB,OAAMtB,GAAE,KAAKsB,GAAE,EAAE,CAAC;AAAA,MACrG;AAAA,IACK;AAAA,EACL;AACA,MAAI,iBAAiB;AAAA,EACrB,MAAM,SAAS;AAAA,IACX,cAAc;AACV,WAAK,YAAY;AACjB,WAAK,KAAK;AAAA,IACb;AAAA,IACD,OAAO,IAAIY,OAAM,MAAM;AACnB,UAAI,CAAC,KAAK;AACN,eAAOA;AACX,UAAI,SAAS,KAAK,CAAC,EAAE,UAAU,KAAK,CAAAiB,OAAKA,GAAE,QAAQjB,SAAQmB,YAAU,MAAMF,GAAE,QAAQ,CAAC;AACtF,UAAI;AACA,eAAO;AACX,UAAI,MAAM,CAAE,GAAE,MAAM,IAAI,IAAI,KAAKjB,OAAM,IAAI;AAC3C,eAASoB,MAAK;AACV,QAAAA,GAAE,UAAU,KAAK,GAAG;AACxB,UAAI,UAAU,SAAS,IAAI;AAC3B,eAAS,UAAUpB,MAAK;AACpB,YAAI,CAAC,OAAO,SAAS;AACjB,mBAAS,UAAU;AACf,gBAAI,KAAK,SAAS,IAAI,QAAQ,MAAM,CAAC;AACjD,aAAO;AAAA,IACV;AAAA,EACL;AACA,WAASmB,YAAUrD,IAAGsB,IAAG;AACrB,WAAOtB,GAAE,UAAUsB,GAAE,UAAUtB,GAAE,MAAM,CAACG,IAAGE,OAAMF,MAAKmB,GAAEjB,EAAC,CAAC;AAAA,EAC9D;AACA,WAAS,SAAS,OAAO;AACrB,QAAI,OAAO,CAAC,CAAA,CAAE;AACd,aAASA,KAAI,GAAGA,KAAI,MAAM,QAAQA,MAAK;AACnC,eAAS,IAAI,GAAGH,KAAI,KAAK,QAAQ,IAAIA,IAAG,KAAK;AACzC,aAAK,KAAK,KAAK,CAAC,EAAE,OAAO,MAAMG,EAAC,CAAC,CAAC;AAAA,MACrC;AAAA,IACJ;AACD,WAAO,KAAK,KAAK,CAACL,IAAGsB,OAAMA,GAAE,SAAStB,GAAE,MAAM;AAAA,EAClD;AAoDA,WAAS,UAAU,MAAM;AACrB,QAAI,SAAS,uBAAO,OAAO,IAAI;AAC/B,aAAS,QAAQ,MAAM;AACnB,UAAIuD,QAAO,KAAK,IAAI;AACpB,UAAI,CAAC,MAAM,QAAQA,KAAI;AACnB,QAAAA,QAAO,CAACA,KAAI;AAChB,eAAS,QAAQ,KAAK,MAAM,GAAG;AAC3B,YAAI,MAAM;AACN,cAAI,SAAS,CAAA,GAAI,OAAO,GAAgB,OAAO;AAC/C,mBAAS,MAAM,OAAK;AAChB,gBAAI,QAAQ,SAAS,MAAM,KAAK,MAAM,KAAK,KAAK,QAAQ;AACpD,qBAAO;AACP;AAAA,YACH;AACD,gBAAID,KAAI,8BAA8B,KAAK,IAAI;AAC/C,gBAAI,CAACA;AACD,oBAAM,IAAI,WAAW,mBAAmB,IAAI;AAChD,mBAAO,KAAKA,GAAE,CAAC,KAAK,MAAM,KAAKA,GAAE,CAAC,EAAE,CAAC,KAAK,MAAM,KAAK,MAAMA,GAAE,CAAC,CAAC,IAAIA,GAAE,CAAC,CAAC;AACvE,mBAAOA,GAAE,CAAC,EAAE;AACZ,gBAAI,OAAO,KAAK;AACZ;AACJ,gBAAI,OAAO,KAAK,KAAK;AACrB,gBAAI,OAAO,KAAK,UAAU,QAAQ,KAAK;AACnC,qBAAO;AACP;AAAA,YACH;AACD,gBAAI,QAAQ;AACR,oBAAM,IAAI,WAAW,mBAAmB,IAAI;AAChD,mBAAO,KAAK,MAAM,GAAG;AAAA,UACxB;AACD,cAAI,OAAO,OAAO,SAAS,GAAG,QAAQ,OAAO,IAAI;AACjD,cAAI,CAAC;AACD,kBAAM,IAAI,WAAW,mBAAmB,IAAI;AAChD,cAAI,OAAO,IAAI,KAAKC,OAAM,MAAM,OAAO,IAAI,OAAO,MAAM,GAAG,IAAI,IAAI,IAAI;AACvE,iBAAO,KAAK,IAAI,KAAK,KAAK,OAAO,KAAK,CAAC;AAAA,QAC1C;AAAA,IACR;AACD,WAAO,aAAa,IAAI,MAAM;AAAA,EAClC;AACA,QAAM,eAAe,IAAI;EACzB,MAAM,KAAK;AAAA,IACP,YAAYA,OAAM,MAAM,SAAS,MAAM;AACnC,WAAK,OAAOA;AACZ,WAAK,OAAO;AACZ,WAAK,UAAU;AACf,WAAK,OAAO;AAAA,IACf;AAAA,IACD,IAAI,SAAS;AAAE,aAAO,KAAK,QAAQ;AAAA,IAAiB;AAAA,IACpD,IAAI,UAAU;AAAE,aAAO,KAAK,QAAQ;AAAA,IAAkB;AAAA,IACtD,KAAK,OAAO;AACR,UAAI,CAAC,SAAS,MAAM,QAAQ,KAAK,OAAO;AACpC,aAAK,OAAO;AACZ,eAAO;AAAA,MACV;AACD,YAAM,OAAO,KAAK,KAAK,MAAM,IAAI;AACjC,aAAO;AAAA,IACV;AAAA,IACD,IAAI,QAAQ;AAAE,aAAO,KAAK,UAAU,KAAK,QAAQ,SAAS;AAAA,IAAI;AAAA,EAClE;AACA,OAAK,QAAQ,IAAI,KAAK,CAAE,GAAE,GAAgB,IAAI;AAM9C,WAAS,eAAeA,OAAM,SAAS;AACnC,QAAI,MAAM,uBAAO,OAAO,IAAI;AAC5B,aAAS,SAASA,OAAM;AACpB,UAAI,CAAC,MAAM,QAAQ,MAAM,GAAG;AACxB,YAAI,MAAM,IAAI,EAAE,IAAI,MAAM;AAAA;AAE1B,iBAAS,OAAO,MAAM;AAClB,cAAI,IAAI,EAAE,IAAI,MAAM;AAAA,IAC/B;AACD,QAAI,EAAE,OAAO,MAAM,KAAI,IAAK,WAAW,CAAA;AACvC,WAAO;AAAA,MACH,OAAO,CAACA,UAAS;AACb,YAAI,MAAM;AACV,iBAAS,OAAOA,OAAM;AAClB,mBAAS,OAAO,IAAI,KAAK;AACrB,gBAAI,WAAW,IAAI,IAAI,EAAE;AACzB,gBAAI,UAAU;AACV,oBAAM,MAAM,MAAM,MAAM,WAAW;AACnC;AAAA,YACH;AAAA,UACJ;AAAA,QACJ;AACD,eAAO;AAAA,MACV;AAAA,MACD;AAAA,IACR;AAAA,EACA;AACA,WAAS,cAAc,cAAcA,OAAM;AACvC,QAAI,SAAS;AACb,aAAS,eAAe,cAAc;AAClC,UAAI,QAAQ,YAAY,MAAMA,KAAI;AAClC,UAAI;AACA,iBAAS,SAAS,SAAS,MAAM,QAAQ;AAAA,IAChD;AACD,WAAO;AAAA,EACX;AAKA,WAAS,cAAc,MAAM,aAM7B,UAIA,OAAO,GAIP,KAAK,KAAK,QAAQ;AACd,QAAI,UAAU,IAAI,iBAAiB,MAAM,MAAM,QAAQ,WAAW,IAAI,cAAc,CAAC,WAAW,GAAG,QAAQ;AAC3G,YAAQ,eAAe,KAAK,OAAQ,GAAE,MAAM,IAAI,IAAI,QAAQ,YAAY;AACxE,YAAQ,MAAM,EAAE;AAAA,EACpB;AAAA,EACA,MAAM,iBAAiB;AAAA,IACnB,YAAY,IAAI,cAAc,MAAM;AAChC,WAAK,KAAK;AACV,WAAK,eAAe;AACpB,WAAK,OAAO;AACZ,WAAK,QAAQ;AAAA,IAChB;AAAA,IACD,UAAU,IAAI,KAAK;AACf,UAAI,OAAO,KAAK,OAAO;AACnB,aAAK,MAAM,EAAE;AACb,YAAI,KAAK,KAAK;AACV,eAAK,KAAK;AACd,aAAK,QAAQ;AAAA,MAChB;AAAA,IACJ;AAAA,IACD,MAAM,IAAI;AACN,UAAI,KAAK,KAAK,MAAM,KAAK;AACrB,aAAK,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK;AAAA,IACxC;AAAA,IACD,eAAe,QAAQ,MAAM,IAAI,gBAAgB,cAAc;AAC3D,UAAI,EAAE,MAAM,MAAM,OAAO,IAAI,IAAK,IAAG;AACrC,UAAI,SAAS,MAAM,OAAO;AACtB;AACJ,UAAI,KAAK;AACL,uBAAe,KAAK,aAAa,OAAO,CAAAC,OAAK,CAACA,GAAE,SAASA,GAAE,MAAM,IAAI,CAAC;AAC1E,UAAI,MAAM;AACV,UAAI,OAAO,aAAa,MAAM,KAAK,KAAK;AACxC,UAAI,SAAS,cAAc,cAAc,KAAK,IAAI;AAClD,UAAI,QAAQ;AACR,YAAI;AACA,iBAAO;AACX,eAAO;AACP,YAAI,KAAK,QAAQ;AACb,6BAAmB,iBAAiB,MAAM,MAAM;AAAA,MACvD;AACD,WAAK,UAAU,KAAK,IAAI,MAAM,KAAK,GAAG,GAAG;AACzC,UAAI,KAAK;AACL;AACJ,UAAI,UAAU,OAAO,QAAQ,OAAO,KAAK,KAAK,SAAS,OAAO;AAC9D,UAAI,WAAW,QAAQ,SAAS;AAC5B,YAAI,QAAQ,OAAO,KAAK,MAAM,QAAQ,QAAQ,CAAC,EAAE,OAAO,OAAO,CAAC;AAChE,YAAI,oBAAoB,KAAK,aAAa,OAAO,CAAAA,OAAK,CAACA,GAAE,SAASA,GAAE,MAAM,QAAQ,KAAK,IAAI,CAAC;AAC5F,YAAIC,YAAW,OAAO;AACtB,iBAASpD,KAAI,GAAG,MAAM,SAAQA,MAAK;AAC/B,cAAI,OAAOA,KAAI,QAAQ,QAAQ,SAAS,QAAQ,QAAQA,EAAC,IAAI;AAC7D,cAAI,UAAU,OAAO,KAAK,OAAO,QAAQ;AACzC,cAAI,YAAY,KAAK,IAAI,MAAM,GAAG,GAAG,UAAU,KAAK,IAAI,IAAI,OAAO;AACnE,cAAI,YAAY,WAAWoD,WAAU;AACjC,mBAAO,OAAO,OAAO,SAAS;AAC1B,mBAAK,eAAe,QAAQ,WAAW,SAAS,gBAAgB,YAAY;AAC5E,mBAAK,UAAU,KAAK,IAAI,SAAS,OAAO,EAAE,GAAG,GAAG;AAChD,kBAAI,OAAO,MAAM,WAAW,CAAC,OAAO,YAAa;AAC7C;AAAA,YACP;AAAA,UACJ;AACD,cAAI,CAAC,QAAQ,UAAU;AACnB;AACJ,gBAAM,KAAK,KAAK;AAChB,cAAI,MAAM,MAAM;AACZ,iBAAK,eAAe,MAAM,OAAQ,GAAE,KAAK,IAAI,MAAM,KAAK,OAAO,KAAK,GAAG,KAAK,IAAI,IAAI,GAAG,GAAG,IAAI,iBAAiB;AAC/G,iBAAK,UAAU,KAAK,IAAI,IAAI,GAAG,GAAG,GAAG;AAAA,UACxC;AAAA,QACJ;AACD,YAAIA;AACA,iBAAO,OAAM;AAAA,MACpB,WACQ,OAAO,cAAc;AAC1B,YAAI;AACA,2BAAiB;AACrB,WAAG;AACC,cAAI,OAAO,MAAM;AACb;AACJ,cAAI,OAAO,QAAQ;AACf;AACJ,eAAK,eAAe,QAAQ,MAAM,IAAI,gBAAgB,YAAY;AAClE,eAAK,UAAU,KAAK,IAAI,IAAI,OAAO,EAAE,GAAG,GAAG;AAAA,QAC3D,SAAqB,OAAO;AAChB,eAAO,OAAM;AAAA,MAChB;AAAA,IACJ;AAAA,EACL;AAMA,WAAS,aAAa,MAAM;AACxB,QAAI,OAAO,KAAK,KAAK,KAAK,YAAY;AACtC,WAAO,QAAQ,KAAK,WAAW,CAAC,KAAK,aAAa,KAAK,OAAO;AAC1D,aAAO,KAAK;AAChB,WAAO,QAAQ;AAAA,EACnB;AACA,QAAMN,MAAI,IAAI;AACd,QAAM,UAAUA,IAAG,GAAE,OAAOA,IAAG,GAAE,WAAWA,IAAE,IAAI,GAAG,eAAeA,IAAE,IAAI,GAAG,UAAUA,IAAG,GAAE,SAASA,IAAE,OAAO,GAAG,SAASA,IAAE,OAAO,GAAG,UAAUA,IAAC,GAAI,UAAUA,IAAE,OAAO,GAAG,UAAUA,OAAK,WAAWA,OAAK,cAAcA,IAAC,GAAI,UAAUA,IAAE,WAAW,GAAG,OAAOA;AAqB9P,QAAM,OAAO;AAAA;AAAA;AAAA;AAAA,IAIT;AAAA;AAAA;AAAA;AAAA,IAIA,aAAaA,IAAE,OAAO;AAAA;AAAA;AAAA;AAAA,IAItB,cAAcA,IAAE,OAAO;AAAA;AAAA;AAAA;AAAA,IAIvB,YAAYA,IAAE,OAAO;AAAA;AAAA;AAAA;AAAA,IAIrB;AAAA;AAAA;AAAA;AAAA,IAIA,cAAcA,IAAE,IAAI;AAAA;AAAA;AAAA;AAAA,IAIpB;AAAA;AAAA;AAAA;AAAA,IAIA,SAASA,IAAE,QAAQ;AAAA;AAAA;AAAA;AAAA,IAInB;AAAA;AAAA;AAAA;AAAA,IAIA,eAAeA,IAAE,YAAY;AAAA;AAAA;AAAA;AAAA,IAI7B,WAAWA,IAAE,IAAI;AAAA;AAAA;AAAA;AAAA,IAIjB,WAAWA,IAAE,IAAI;AAAA;AAAA;AAAA;AAAA,IAIjB,WAAWA,IAAE,IAAI;AAAA;AAAA;AAAA;AAAA,IAIjB,WAAWA,IAAE,IAAI;AAAA;AAAA;AAAA;AAAA,IAIjB;AAAA;AAAA;AAAA;AAAA,IAIA;AAAA;AAAA;AAAA;AAAA,IAIA,WAAWA,IAAE,MAAM;AAAA;AAAA;AAAA;AAAA,IAInB,WAAWA,IAAE,MAAM;AAAA;AAAA;AAAA;AAAA,IAInB,gBAAgBA,IAAE,MAAM;AAAA;AAAA;AAAA;AAAA,IAIxB;AAAA;AAAA;AAAA;AAAA,IAIA,SAASA,IAAE,MAAM;AAAA;AAAA;AAAA;AAAA,IAIjB,OAAOA,IAAE,MAAM;AAAA;AAAA;AAAA;AAAA,IAIf,MAAMA,IAAE,OAAO;AAAA;AAAA;AAAA;AAAA,IAIf,QAAQA,IAAE,OAAO;AAAA;AAAA;AAAA;AAAA;AAAA,IAKjB,QAAQA,IAAE,OAAO;AAAA;AAAA;AAAA;AAAA,IAIjB,OAAOA,IAAE,OAAO;AAAA;AAAA;AAAA;AAAA,IAIhB,KAAKA,IAAE,OAAO;AAAA;AAAA;AAAA;AAAA,IAId;AAAA;AAAA;AAAA;AAAA;AAAA,IAKA,MAAMA,IAAE,OAAO;AAAA;AAAA;AAAA;AAAA,IAIf,MAAMA,IAAE,OAAO;AAAA;AAAA;AAAA;AAAA,IAIf,MAAMA,IAAE,OAAO;AAAA;AAAA;AAAA;AAAA,IAIf,MAAMA,IAAE,OAAO;AAAA;AAAA;AAAA;AAAA,IAIf,UAAUA,IAAE,OAAO;AAAA;AAAA;AAAA;AAAA,IAInB,iBAAiBA,IAAE,OAAO;AAAA;AAAA;AAAA;AAAA,IAI1B,gBAAgBA,IAAE,OAAO;AAAA;AAAA;AAAA;AAAA,IAIzB,mBAAmBA,IAAE,OAAO;AAAA;AAAA;AAAA;AAAA;AAAA,IAK5B,eAAeA,IAAE,OAAO;AAAA;AAAA;AAAA;AAAA,IAIxB;AAAA;AAAA;AAAA;AAAA,IAIA,eAAeA,IAAE,QAAQ;AAAA;AAAA;AAAA;AAAA,IAIzB,oBAAoBA,IAAE,QAAQ;AAAA;AAAA;AAAA;AAAA,IAI9B,eAAeA,IAAE,QAAQ;AAAA;AAAA;AAAA;AAAA,IAIzB,iBAAiBA,IAAE,QAAQ;AAAA;AAAA;AAAA;AAAA,IAI3B,iBAAiBA,IAAE,QAAQ;AAAA;AAAA;AAAA;AAAA,IAI3B,gBAAgBA,IAAE,QAAQ;AAAA;AAAA;AAAA;AAAA,IAI1B,oBAAoBA,IAAE,QAAQ;AAAA;AAAA;AAAA;AAAA,IAI9B,cAAcA,IAAE,QAAQ;AAAA;AAAA;AAAA;AAAA,IAIxB,iBAAiBA,IAAE,QAAQ;AAAA;AAAA;AAAA;AAAA,IAI3B;AAAA;AAAA;AAAA;AAAA;AAAA,IAKA,WAAWA,IAAE,WAAW;AAAA;AAAA;AAAA;AAAA,IAIxB;AAAA;AAAA;AAAA;AAAA;AAAA,IAKA,cAAcA,IAAE,OAAO;AAAA;AAAA;AAAA;AAAA;AAAA,IAKvB,eAAeA,IAAE,OAAO;AAAA;AAAA;AAAA;AAAA;AAAA,IAKxB,OAAOA,IAAE,OAAO;AAAA;AAAA;AAAA;AAAA;AAAA,IAKhB,OAAOA,IAAE,OAAO;AAAA;AAAA;AAAA;AAAA,IAIhB;AAAA;AAAA;AAAA;AAAA,IAIA;AAAA;AAAA;AAAA;AAAA,IAIA,UAAUA,IAAE,OAAO;AAAA;AAAA;AAAA;AAAA,IAInB,UAAUA,IAAE,OAAO;AAAA;AAAA;AAAA;AAAA,IAInB,UAAUA,IAAE,OAAO;AAAA;AAAA;AAAA;AAAA,IAInB,UAAUA,IAAE,OAAO;AAAA;AAAA;AAAA;AAAA,IAInB,UAAUA,IAAE,OAAO;AAAA;AAAA;AAAA;AAAA,IAInB,UAAUA,IAAE,OAAO;AAAA;AAAA;AAAA;AAAA,IAInB,kBAAkBA,IAAE,OAAO;AAAA;AAAA;AAAA;AAAA,IAI3B,MAAMA,IAAE,OAAO;AAAA;AAAA;AAAA;AAAA,IAIf,OAAOA,IAAE,OAAO;AAAA;AAAA;AAAA;AAAA,IAIhB,UAAUA,IAAE,OAAO;AAAA;AAAA;AAAA;AAAA,IAInB,QAAQA,IAAE,OAAO;AAAA;AAAA;AAAA;AAAA,IAIjB,MAAMA,IAAE,OAAO;AAAA;AAAA;AAAA;AAAA;AAAA,IAKf,WAAWA,IAAE,OAAO;AAAA;AAAA;AAAA;AAAA;AAAA,IAKpB,eAAeA,IAAE,OAAO;AAAA;AAAA;AAAA;AAAA,IAIxB,UAAUA,IAAG;AAAA;AAAA;AAAA;AAAA,IAIb,SAASA,IAAG;AAAA;AAAA;AAAA;AAAA,IAIZ,SAASA,IAAG;AAAA;AAAA;AAAA;AAAA,IAIZ,SAASA,IAAG;AAAA;AAAA;AAAA;AAAA,IAIZ;AAAA;AAAA;AAAA;AAAA;AAAA,IAKA,cAAcA,IAAE,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA,IAKpB,YAAYA,IAAE,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA,IAKlB,uBAAuBA,IAAE,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAM7B,YAAY,IAAI,eAAgB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMhC,UAAU,IAAI,eAAgB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAO9B,UAAU,IAAI,eAAgB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAM9B,UAAU,IAAI,eAAgB;AAAA;AAAA;AAAA;AAAA;AAAA,IAK9B,OAAO,IAAI,eAAgB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAS3B,SAAS,IAAI,eAAgB;AAAA,EACjC;AAiDyB,iBAAe;AAAA,IACpC,EAAE,KAAK,KAAK,MAAM,OAAO,WAAY;AAAA,IACrC,EAAE,KAAK,KAAK,SAAS,OAAO,cAAe;AAAA,IAC3C,EAAE,KAAK,KAAK,UAAU,OAAO,eAAgB;AAAA,IAC7C,EAAE,KAAK,KAAK,QAAQ,OAAO,aAAc;AAAA,IACzC,EAAE,KAAK,KAAK,SAAS,OAAO,cAAe;AAAA,IAC3C,EAAE,KAAK,KAAK,MAAM,OAAO,WAAY;AAAA,IACrC,EAAE,KAAK,KAAK,MAAM,OAAO,WAAY;AAAA,IACrC,EAAE,KAAK,KAAK,KAAK,OAAO,UAAW;AAAA,IACnC,EAAE,KAAK,KAAK,WAAW,OAAO,gBAAiB;AAAA,IAC/C,EAAE,KAAK,KAAK,UAAU,OAAO,eAAgB;AAAA,IAC7C,EAAE,KAAK,KAAK,SAAS,OAAO,cAAe;AAAA,IAC3C,EAAE,KAAK,KAAK,SAAS,OAAO,cAAe;AAAA,IAC3C,EAAE,KAAK,KAAK,QAAQ,OAAO,aAAc;AAAA,IACzC,EAAE,KAAK,KAAK,QAAQ,OAAO,aAAc;AAAA,IACzC,EAAE,KAAK,CAAC,KAAK,QAAQ,KAAK,QAAQ,KAAK,QAAQ,KAAK,MAAM,CAAC,GAAG,OAAO,cAAe;AAAA,IACpF,EAAE,KAAK,KAAK,cAAc,OAAO,mBAAoB;AAAA,IACrD,EAAE,KAAK,KAAK,MAAM,KAAK,YAAY,GAAG,OAAO,6BAA8B;AAAA,IAC3E,EAAE,KAAK,KAAK,WAAW,KAAK,YAAY,GAAG,OAAO,kCAAmC;AAAA,IACrF,EAAE,KAAK,KAAK,QAAQ,KAAK,YAAY,GAAG,OAAO,oBAAqB;AAAA,IACpE,EAAE,KAAK,KAAK,WAAW,KAAK,YAAY,GAAG,OAAO,kCAAmC;AAAA,IACrF,EAAE,KAAK,KAAK,UAAU,OAAO,eAAgB;AAAA,IAC7C,EAAE,KAAK,KAAK,WAAW,OAAO,gBAAiB;AAAA,IAC/C,EAAE,KAAK,KAAK,WAAW,OAAO,gBAAiB;AAAA,IAC/C,EAAE,KAAK,KAAK,WAAW,OAAO,gBAAiB;AAAA,IAC/C,EAAE,KAAK,KAAK,cAAc,OAAO,mBAAoB;AAAA,IACrD,EAAE,KAAK,KAAK,UAAU,OAAO,eAAgB;AAAA,IAC7C,EAAE,KAAK,KAAK,SAAS,OAAO,cAAe;AAAA,IAC3C,EAAE,KAAK,KAAK,MAAM,OAAO,WAAY;AAAA,IACrC,EAAE,KAAK,KAAK,SAAS,OAAO,cAAe;AAAA,IAC3C,EAAE,KAAK,KAAK,aAAa,OAAO,kBAAmB;AAAA,EACvD,CAAC;ACp1BD,QAAM,oBAAoB,GACxB,SAAS,GACT,UAAU,GACV,YAAY,GACZ,QAAQ;AAEV,QAAM,KAAK,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI,OAAO,IACvD,MAAM,IAAI,OAAO,IAAI,QAAQ,IAAI,OAAO,IAAI,QAAQ,IAAI,OAAO,KAAK,WAAW,IAAI,cAAc;AAEvG,WAAS,MAAM,IAAI;AAAE,WAAO,MAAM,MAAM,MAAM;AAAA,EAAI;AAClD,WAAS,OAAO,IAAI;AAAE,WAAO,MAAM,EAAE,KAAK,MAAM;AAAA,EAAI;AAEpD,QAAM,gBAAgB,IAAI,kBAAkB,CAAC,OAAO,UAAU;AAC5D,QAAI,MAAM,MAAM,IAAI,GAAG;AACrB,UAAI,UAAU;AACd,SAAG;AAAE,cAAM,QAAS;AAAA,MAAG,SAAQ,OAAO,MAAM,IAAI;AAChD,UAAI,MAAM,QAAQ,KAAK;AACrB,kBAAU;AACV,cAAM,QAAO;AACb,YAAI,MAAM,MAAM,IAAI,GAAG;AACrB,aAAG;AAAE,kBAAM,QAAS;AAAA,UAAG,SAAQ,OAAO,MAAM,IAAI;AAAA,QACjD,WAAU,MAAM,QAAQ,OAAO,MAAM,OAAO,OAAQ,KAAK,KAAK,OAAO,aAAa,MAAM,IAAI,CAAC,GAAG;AAC/F;AAAA,QACD;AAAA,MACF;AACD,UAAI,MAAM,QAAQ,MAAM,MAAM,QAAQ,IAAI;AACxC,kBAAU;AACV,cAAM,QAAO;AACb,YAAI,MAAM,QAAQ,QAAQ,MAAM,QAAQ;AAAO,gBAAM;AACrD,YAAI,CAAC,OAAO,MAAM,IAAI;AAAG;AACzB,WAAG;AAAE,gBAAM,QAAS;AAAA,QAAG,SAAQ,OAAO,MAAM,IAAI;AAAA,MACjD;AACD,UAAI,MAAM,QAAQ,IAAI;AACpB,YAAI,QAAQ,MAAM,KAAK,CAAC;AACxB,YAAI,SAAS,OAAO,KAAK,MAAM,KAAK,CAAC,KAAK,OAAO,KAC7C,SAAS,OAAO,KAAK,MAAM,KAAK,CAAC,KAAK,OAAO,GAAG;AAClD,gBAAM,QAAQ,CAAC;AACf,oBAAU;AAAA,QAClB,OAAa;AACL;AAAA,QACD;AAAA,MACF;AACD,UAAI;AAAS,cAAM,YAAY,KAAK;AAAA,IACxC,WAAa,MAAM,QAAQ,MAAM,MAAM,QAAQ,IAAI;AAC/C,UAAI,MAAM,QAAQ;AAAI,cAAM,QAAO;AACnC,UAAI,MAAM,QAAQ;AAAI;AACtB,YAAM,QAAO;AACb,UAAI,QAAQ;AACZ,aAAO,MAAM,QAAQ,MAAM;AAAE;AAAS,cAAM,QAAO;AAAA,MAAK;AACxD,UAAI,MAAM,QAAQ;AAAO;AACzB,YAAM,QAAO;AACb;AAAS,mBAAS;AAChB,cAAI,MAAM,OAAO;AAAG;AACpB,cAAI,UAAU,MAAM,QAAQ;AAC5B,gBAAM,QAAO;AACb,cAAI,SAAS;AACX,qBAAS9C,KAAI,GAAGA,KAAI,OAAOA,MAAK;AAC9B,kBAAI,MAAM,QAAQ;AAAM,yBAAS;AACjC,oBAAM,QAAO;AAAA,YACd;AACD,kBAAM,YAAY,SAAS;AAC3B;AAAA,UACD;AAAA,QACF;AAAA,IACF;AAAA,EACH,CAAC;AAED,QAAM,eAAe,IAAI,kBAAkB,WAAS;AAClD,QAAI,MAAM,QAAQ;AAAM,YAAM,YAAY,mBAAmB,CAAC;AAAA,EAChE,CAAC;AAED,QAAM,UAAU,IAAI,kBAAkB,WAAS;AAC7C,QAAI,MAAM,QAAQ;AAAU,YAAM,YAAY,QAAQ,CAAC;AAAA,aAC9C,MAAM,QAAQ;AAAa,YAAM,YAAY,SAAS,CAAC;AAAA,EAClE,CAAC;AAED,QAAM,mBAAmB,UAAU;AAAA,IACjC,qEAAqE,KAAK;AAAA,IAC1E,iBAAiB,KAAK;AAAA,IACtB,4CAA4C,KAAK;AAAA,IACjD,4DAA4D,KAAK;AAAA,IACjE,aAAa,KAAK;AAAA,IAClB,2BAA2B,KAAK;AAAA,IAChC,QAAQ,KAAK;AAAA,IACb,QAAQ,KAAK;AAAA,IACb,MAAM,KAAK;AAAA,IACX,WAAW,KAAK,QAAQ,KAAK,MAAM;AAAA,IACnC,SAAS,KAAK;AAAA,IACd,YAAY,KAAK;AAAA,IACjB,6BAA6B,KAAK,SAAS,KAAK,YAAY;AAAA,IAC5D,iBAAiB,KAAK,WAAW,KAAK,YAAY;AAAA,IAClD,gCAAgC,KAAK,SAAS,KAAK,WAAW,KAAK,YAAY,CAAC;AAAA,IAChF,WAAW,KAAK;AAAA,IAChB,iBAAiB,KAAK;AAAA,IACtB,kDAAkD,KAAK,SAAS,KAAK,YAAY;AAAA,IACjF,UAAU,KAAK,QAAQ,KAAK,YAAY;AAAA,IACxC,iBAAiB,KAAK;AAAA,IACtB,gBAAgB,KAAK;AAAA,IACrB,0EAA0E,KAAK;AAAA,IAC/E,kFAAkF,KAAK;AAAA,IACvF,OAAS,KAAK;AAAA,IACd,UAAU,KAAK;AAAA,IACf,aAAa,KAAK;AAAA,IAClB,cAAc,KAAK;AAAA,IACnB,SAAS,KAAK;AAAA,IACd,OAAO,KAAK;AAAA,IACZ,SAAS,KAAK;AAAA,IACd,SAAS,KAAK;AAAA,IACd,OAAO,KAAK;AAAA,IACZ,WAAW,KAAK;AAAA,IAChB,KAAK,KAAK;AAAA,IACV,gBAAgB,KAAK;AAAA,IACrB,OAAO,KAAK;AAAA,IACZ,OAAO,KAAK;AAAA,IACZ,OAAO,KAAK;AAAA,IACZ,aAAa,KAAK;AAAA,IAClB,KAAK,KAAK;AAAA,IACV,UAAU,KAAK;AAAA,IACf,iBAAiB,KAAK;AAAA,EACxB,CAAC;AAGD,QAAM,kBAAkB,EAAC,WAAU,MAAK,MAAK,IAAI,OAAM,IAAI,OAAM,IAAI,MAAK,IAAI,MAAK,IAAI,OAAM,IAAI,KAAI,IAAI,IAAG,IAAI,OAAM,IAAI,QAAO,KAAK,OAAM,KAAK,MAAK,KAAK,IAAG,KAAK,KAAI,KAAK,KAAI,KAAK,KAAI,KAAK,GAAE,KAAK,MAAK,KAAK,OAAM,KAAK,IAAG,KAAK,QAAO,KAAK,OAAM,KAAK,OAAM,KAAK,UAAS,KAAK,OAAM,KAAK,MAAK,KAAK,KAAI,KAAK,aAAY,KAAK,KAAI,KAAK,QAAO,KAAK,QAAO,KAAK,OAAM,KAAK,OAAM,KAAK,MAAK,KAAK,MAAK,KAAK,SAAQ,KAAK,IAAG,KAAK,OAAM,KAAK,KAAI,KAAK,QAAO,KAAK,KAAI,IAAG;AACxc,QAAM,SAAS,SAAS,YAAY;AAAA,IAClC,SAAS;AAAA,IACT,QAAQ;AAAA,IACR,WAAW;AAAA,IACX,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS;AAAA,IACT,WAAW;AAAA,MACT,CAAC,SAAS,KAAI,GAAE,GAAE,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,cAAa,KAAI,IAAG,IAAG,IAAG,IAAG,IAAG,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,QAAO,KAAI,IAAG,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,KAAI,aAAY,KAAI,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,SAAS;AAAA,MACtZ,CAAC,YAAY,GAAE,KAAI,IAAG,KAAI,IAAG,GAAG;AAAA,MAChC,CAAC,YAAY,IAAG,KAAI,IAAG,KAAI,IAAG,GAAG;AAAA,IAClC;AAAA,IACD,aAAa,CAAC,gBAAgB;AAAA,IAC9B,cAAc,CAAC,GAAE,GAAE,GAAE,GAAG;AAAA,IACxB,iBAAiB;AAAA,IACjB,WAAW;AAAA,IACX,YAAY,CAAC,cAAc,SAAS,eAAe,GAAG,GAAG,GAAG,CAAC;AAAA,IAC7D,UAAU,EAAC,cAAa,CAAC,GAAE,CAAC,EAAC;AAAA,IAC7B,aAAa,CAAC,EAAC,MAAM,KAAK,KAAK,WAAS,gBAAgB,KAAK,KAAK,GAAE,CAAC;AAAA,IACrE,WAAW;AAAA,EACb,CAAC;AAAA,EChJD,MAAM,KAAK;AAAA;AAAA;AAAA;AAAA,IAIP,OAAO,KAAK;AACR,UAAI,MAAM,KAAK,MAAM,KAAK;AACtB,cAAM,IAAI,WAAW,oBAAoB,GAAG,0BAA0B,KAAK,MAAM,EAAE;AACvF,aAAO,KAAK,UAAU,KAAK,OAAO,GAAG,CAAC;AAAA,IACzC;AAAA;AAAA;AAAA;AAAA,IAID,KAAKG,IAAG;AACJ,UAAIA,KAAI,KAAKA,KAAI,KAAK;AAClB,cAAM,IAAI,WAAW,uBAAuBA,EAAC,OAAO,KAAK,KAAK,gBAAgB;AAClF,aAAO,KAAK,UAAUA,IAAG,MAAM,GAAG,CAAC;AAAA,IACtC;AAAA;AAAA;AAAA;AAAA,IAID,QAAQ,MAAM,IAAI,MAAM;AACpB,UAAI,QAAQ,CAAA;AACZ,WAAK;AAAA,QAAU;AAAA,QAAG;AAAA,QAAM;AAAA,QAAO;AAAA;AAAA,MAAC;AAChC,UAAI,KAAK;AACL,aAAK;AAAA,UAAU;AAAA,UAAG,KAAK;AAAA,UAAQ;AAAA,UAAO,IAAoB;AAAA;AAAA;AAC9D,WAAK;AAAA,QAAU;AAAA,QAAI,KAAK;AAAA,QAAQ;AAAA,QAAO;AAAA;AAAA;AACvC,aAAO,SAAS,KAAK,OAAO,KAAK,UAAU,KAAK,QAAQ,KAAK,MAAM;AAAA,IACtE;AAAA;AAAA;AAAA;AAAA,IAID,OAAO,OAAO;AACV,aAAO,KAAK,QAAQ,KAAK,QAAQ,KAAK,QAAQ,KAAK;AAAA,IACtD;AAAA;AAAA;AAAA;AAAA,IAID,MAAM,MAAM,KAAK,KAAK,QAAQ;AAC1B,UAAI,QAAQ,CAAA;AACZ,WAAK,UAAU,MAAM,IAAI,OAAO,CAAC;AACjC,aAAO,SAAS,KAAK,OAAO,KAAK,IAAI;AAAA,IACxC;AAAA;AAAA;AAAA;AAAA,IAID,GAAG,OAAO;AACN,UAAI,SAAS;AACT,eAAO;AACX,UAAI,MAAM,UAAU,KAAK,UAAU,MAAM,SAAS,KAAK;AACnD,eAAO;AACX,UAAI,QAAQ,KAAK,cAAc,OAAO,CAAC,GAAG,MAAM,KAAK,SAAS,KAAK,cAAc,OAAO,EAAE;AAC1F,UAAIR,KAAI,IAAI,cAAc,IAAI,GAAGsB,KAAI,IAAI,cAAc,KAAK;AAC5D,eAAS,OAAO,OAAO,MAAM,WAAS;AAClC,QAAAtB,GAAE,KAAK,IAAI;AACX,QAAAsB,GAAE,KAAK,IAAI;AACX,eAAO;AACP,YAAItB,GAAE,aAAasB,GAAE,aAAatB,GAAE,QAAQsB,GAAE,QAAQtB,GAAE,SAASsB,GAAE;AAC/D,iBAAO;AACX,eAAOtB,GAAE,MAAM;AACf,YAAIA,GAAE,QAAQ,OAAO;AACjB,iBAAO;AAAA,MACd;AAAA,IACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMD,KAAK,MAAM,GAAG;AAAE,aAAO,IAAI,cAAc,MAAM,GAAG;AAAA,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA,IAKtD,UAAU,MAAM,KAAK,KAAK,QAAQ;AAAE,aAAO,IAAI,kBAAkB,MAAM,MAAM,EAAE;AAAA,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQnF,UAAU,MAAM,IAAI;AAChB,UAAI;AACJ,UAAI,QAAQ,MAAM;AACd,gBAAQ,KAAK;MAChB,OACI;AACD,YAAI,MAAM;AACN,eAAK,KAAK,QAAQ;AACtB,YAAI,QAAQ,KAAK,KAAK,IAAI,EAAE;AAC5B,gBAAQ,KAAK,UAAU,OAAO,KAAK,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,KAAK,SAAS,MAAM,IAAI,IAAI,KAAK,KAAK,KAAK,CAAC,EAAE,EAAE,CAAC;AAAA,MACzH;AACD,aAAO,IAAI,WAAW,KAAK;AAAA,IAC9B;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,WAAW;AAAE,aAAO,KAAK,YAAY,CAAC;AAAA,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA,IAK1C,SAAS;AACL,UAAI,QAAQ,CAAA;AACZ,WAAK,QAAQ,KAAK;AAClB,aAAO;AAAA,IACV;AAAA;AAAA;AAAA;AAAA,IAID,cAAc;AAAA,IAAG;AAAA;AAAA;AAAA;AAAA,IAIjB,OAAO,GAAG,MAAM;AACZ,UAAI,KAAK,UAAU;AACf,cAAM,IAAI,WAAW,wCAAwC;AACjE,UAAI,KAAK,UAAU,KAAK,CAAC,KAAK,CAAC;AAC3B,eAAO,KAAK;AAChB,aAAO,KAAK,UAAU,KAAuB,IAAI,SAAS,IAAI,IAAI,SAAS,KAAK,SAAS,MAAM,MAAM,CAAA,CAAE,CAAC;AAAA,IAC3G;AAAA,EACL;AAAA,EAIA,MAAM,iBAAiB,KAAK;AAAA,IACxB,YAAY,MAAM,SAAS,WAAW,IAAI,GAAG;AACzC;AACA,WAAK,OAAO;AACZ,WAAK,SAAS;AAAA,IACjB;AAAA,IACD,IAAI,QAAQ;AAAE,aAAO,KAAK,KAAK;AAAA,IAAS;AAAA,IACxC,IAAI,WAAW;AAAE,aAAO;AAAA,IAAO;AAAA,IAC/B,UAAU,QAAQ,QAAQ,MAAM,QAAQ;AACpC,eAASK,KAAI,KAAIA,MAAK;AAClB,YAAIoC,UAAS,KAAK,KAAKpC,EAAC,GAAG,MAAM,SAASoC,QAAO;AACjD,aAAK,SAAS,OAAO,QAAQ;AACzB,iBAAO,IAAI,KAAK,QAAQ,KAAK,MAAMA,OAAM;AAC7C,iBAAS,MAAM;AACf;AAAA,MACH;AAAA,IACJ;AAAA,IACD,UAAU,MAAM,IAAI,QAAQ,MAAM;AAC9B,UAAI,OAAO,QAAQ,KAAK,MAAM,KAAK,SAAS,OACtC,IAAI,SAAS,UAAU,KAAK,MAAM,MAAM,EAAE,GAAG,KAAK,IAAI,IAAI,KAAK,MAAM,IAAI,KAAK,IAAI,GAAG,IAAI,CAAC;AAChG,UAAI,OAAO,GAAmB;AAC1B,YAAI,OAAO,OAAO;AAClB,YAAI,SAAS,WAAW,KAAK,MAAM,KAAK,KAAK,SAAS,GAAG,KAAK,MAAM;AACpE,YAAI,OAAO,UAAU,IAAsB;AACvC,iBAAO,KAAK,IAAI,SAAS,QAAQ,KAAK,SAAS,KAAK,MAAM,CAAC;AAAA,QAC9D,OACI;AACD,cAAI,MAAM,OAAO,UAAU;AAC3B,iBAAO,KAAK,IAAI,SAAS,OAAO,MAAM,GAAG,GAAG,CAAC,GAAG,IAAI,SAAS,OAAO,MAAM,GAAG,CAAC,CAAC;AAAA,QAClF;AAAA,MACJ,OACI;AACD,eAAO,KAAK,IAAI;AAAA,MACnB;AAAA,IACJ;AAAA,IACD,QAAQ,MAAM,IAAI,MAAM;AACpB,UAAI,EAAE,gBAAgB;AAClB,eAAO,MAAM,QAAQ,MAAM,IAAI,IAAI;AACvC,UAAI,QAAQ,WAAW,KAAK,MAAM,WAAW,KAAK,MAAM,UAAU,KAAK,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE;AAC1F,UAAI,SAAS,KAAK,SAAS,KAAK,UAAU,KAAK;AAC/C,UAAI,MAAM,UAAU;AAChB,eAAO,IAAI,SAAS,OAAO,MAAM;AACrC,aAAO,SAAS,KAAK,SAAS,MAAM,OAAO,CAAE,CAAA,GAAG,MAAM;AAAA,IACzD;AAAA,IACD,YAAY,MAAM,KAAK,KAAK,QAAQ,UAAU,MAAM;AAChD,UAAI,SAAS;AACb,eAAS,MAAM,GAAGpC,KAAI,GAAG,OAAO,MAAMA,KAAI,KAAK,KAAK,QAAQA,MAAK;AAC7D,YAAI,OAAO,KAAK,KAAKA,EAAC,GAAG,MAAM,MAAM,KAAK;AAC1C,YAAI,MAAM,QAAQA;AACd,oBAAU;AACd,YAAI,OAAO,OAAO,KAAK;AACnB,oBAAU,KAAK,MAAM,KAAK,IAAI,GAAG,OAAO,GAAG,GAAG,KAAK,GAAG;AAC1D,cAAM,MAAM;AAAA,MACf;AACD,aAAO;AAAA,IACV;AAAA,IACD,QAAQ,QAAQ;AACZ,eAAS,QAAQ,KAAK;AAClB,eAAO,KAAK,IAAI;AAAA,IACvB;AAAA,IACD,gBAAgB;AAAE,aAAO;AAAA,IAAI;AAAA,IAC7B,OAAO,MAAM,MAAM,QAAQ;AACvB,UAAI,OAAO,CAAA,GAAI,MAAM;AACrB,eAAS,QAAQ,MAAM;AACnB,aAAK,KAAK,IAAI;AACd,eAAO,KAAK,SAAS;AACrB,YAAI,KAAK,UAAU,IAAsB;AACrC,iBAAO,KAAK,IAAI,SAAS,MAAM,GAAG,CAAC;AACnC,iBAAO,CAAA;AACP,gBAAM;AAAA,QACT;AAAA,MACJ;AACD,UAAI,MAAM;AACN,eAAO,KAAK,IAAI,SAAS,MAAM,GAAG,CAAC;AACvC,aAAO;AAAA,IACV;AAAA,EACL;AAAA,EAKA,MAAM,iBAAiB,KAAK;AAAA,IACxB,YAAY,UAAU,QAAQ;AAC1B;AACA,WAAK,WAAW;AAChB,WAAK,SAAS;AACd,WAAK,QAAQ;AACb,eAAS,SAAS;AACd,aAAK,SAAS,MAAM;AAAA,IAC3B;AAAA,IACD,UAAU,QAAQ,QAAQ,MAAM,QAAQ;AACpC,eAASA,KAAI,KAAIA,MAAK;AAClB,YAAI,QAAQ,KAAK,SAASA,EAAC,GAAG,MAAM,SAAS,MAAM,QAAQ,UAAU,OAAO,MAAM,QAAQ;AAC1F,aAAK,SAAS,UAAU,QAAQ;AAC5B,iBAAO,MAAM,UAAU,QAAQ,QAAQ,MAAM,MAAM;AACvD,iBAAS,MAAM;AACf,eAAO,UAAU;AAAA,MACpB;AAAA,IACJ;AAAA,IACD,UAAU,MAAM,IAAI,QAAQ,MAAM;AAC9B,eAASA,KAAI,GAAG,MAAM,GAAG,OAAO,MAAMA,KAAI,KAAK,SAAS,QAAQA,MAAK;AACjE,YAAI,QAAQ,KAAK,SAASA,EAAC,GAAG,MAAM,MAAM,MAAM;AAChD,YAAI,QAAQ,OAAO,MAAM,KAAK;AAC1B,cAAI,YAAY,SAAS,OAAO,OAAO,IAAoB,MAAM,OAAO,KAAK,IAAkB;AAC/F,cAAI,OAAO,QAAQ,OAAO,MAAM,CAAC;AAC7B,mBAAO,KAAK,KAAK;AAAA;AAEjB,kBAAM,UAAU,OAAO,KAAK,KAAK,KAAK,QAAQ,SAAS;AAAA,QAC9D;AACD,cAAM,MAAM;AAAA,MACf;AAAA,IACJ;AAAA,IACD,QAAQ,MAAM,IAAI,MAAM;AACpB,UAAI,KAAK,QAAQ,KAAK;AAClB,iBAASA,KAAI,GAAG,MAAM,GAAGA,KAAI,KAAK,SAAS,QAAQA,MAAK;AACpD,cAAI,QAAQ,KAAK,SAASA,EAAC,GAAG,MAAM,MAAM,MAAM;AAIhD,cAAI,QAAQ,OAAO,MAAM,KAAK;AAC1B,gBAAI,UAAU,MAAM,QAAQ,OAAO,KAAK,KAAK,KAAK,IAAI;AACtD,gBAAI,aAAa,KAAK,QAAQ,MAAM,QAAQ,QAAQ;AACpD,gBAAI,QAAQ,QAAS,cAAe,IAA2B,KAC3D,QAAQ,QAAS,cAAe,IAA2B,GAAK;AAChE,kBAAI,OAAO,KAAK,SAAS,MAAK;AAC9B,mBAAKA,EAAC,IAAI;AACV,qBAAO,IAAI,SAAS,MAAM,KAAK,UAAU,KAAK,QAAQ,KAAK,MAAM;AAAA,YACpE;AACD,mBAAO,MAAM,QAAQ,KAAK,KAAK,OAAO;AAAA,UACzC;AACD,gBAAM,MAAM;AAAA,QACf;AACL,aAAO,MAAM,QAAQ,MAAM,IAAI,IAAI;AAAA,IACtC;AAAA,IACD,YAAY,MAAM,KAAK,KAAK,QAAQ,UAAU,MAAM;AAChD,UAAI,SAAS;AACb,eAASA,KAAI,GAAG,MAAM,GAAGA,KAAI,KAAK,SAAS,UAAU,OAAO,IAAIA,MAAK;AACjE,YAAI,QAAQ,KAAK,SAASA,EAAC,GAAG,MAAM,MAAM,MAAM;AAChD,YAAI,MAAM,QAAQA;AACd,oBAAU;AACd,YAAI,OAAO,OAAO,KAAK;AACnB,oBAAU,MAAM,YAAY,OAAO,KAAK,KAAK,KAAK,OAAO;AAC7D,cAAM,MAAM;AAAA,MACf;AACD,aAAO;AAAA,IACV;AAAA,IACD,QAAQ,QAAQ;AACZ,eAAS,SAAS,KAAK;AACnB,cAAM,QAAQ,MAAM;AAAA,IAC3B;AAAA,IACD,cAAc,OAAO,KAAK;AACtB,UAAI,EAAE,iBAAiB;AACnB,eAAO;AACX,UAAI,SAAS;AACb,UAAI,CAAC,IAAI,IAAI,IAAI,EAAE,IAAI,MAAM,IAAI,CAAC,GAAG,GAAG,KAAK,SAAS,QAAQ,MAAM,SAAS,MAAM,IAC7E,CAAC,KAAK,SAAS,SAAS,GAAG,MAAM,SAAS,SAAS,GAAG,IAAI,EAAE;AAClE,eAAQ,MAAM,KAAK,MAAM,KAAK;AAC1B,YAAI,MAAM,MAAM,MAAM;AAClB,iBAAO;AACX,YAAI,MAAM,KAAK,SAAS,EAAE,GAAG,MAAM,MAAM,SAAS,EAAE;AACpD,YAAI,OAAO;AACP,iBAAO,SAAS,IAAI,cAAc,KAAK,GAAG;AAC9C,kBAAU,IAAI,SAAS;AAAA,MAC1B;AAAA,IACJ;AAAA,IACD,OAAO,KAAK,UAAU,SAAS,SAAS,OAAO,CAACqD,IAAG,OAAOA,KAAI,GAAG,SAAS,GAAG,EAAE,GAAG;AAC9E,UAAI,QAAQ;AACZ,eAAS,MAAM;AACX,iBAAS,GAAG;AAChB,UAAI,QAAQ,IAAsB;AAC9B,YAAI,OAAO,CAAA;AACX,iBAAS,MAAM;AACX,aAAG,QAAQ,IAAI;AACnB,eAAO,IAAI,SAAS,MAAM,MAAM;AAAA,MACnC;AACD,UAAI,QAAQ,KAAK;AAAA,QAAI;AAAA,QAAsB,SAAS;AAAA;AAAA,SAA2B,WAAW,SAAS,GAAG,WAAW,SAAS;AAC1H,UAAI,UAAU,CAAE,GAAE,eAAe,GAAG,aAAa,IAAI,eAAe;AACpE,eAAS,IAAI,OAAO;AAChB,YAAI;AACJ,YAAI,MAAM,QAAQ,YAAY,iBAAiB,UAAU;AACrD,mBAAS,QAAQ,MAAM;AACnB,gBAAI,IAAI;AAAA,QACf,WACQ,MAAM,QAAQ,aAAa,eAAe,YAAY,CAAC,eAAe;AAC3E;AACA,kBAAQ,KAAK,KAAK;AAAA,QACrB,WACQ,iBAAiB,YAAY,iBACjC,OAAO,aAAa,aAAa,SAAS,CAAC,cAAc,YAC1D,MAAM,QAAQ,KAAK,SAAS,IAAsB;AAClD,0BAAgB,MAAM;AACtB,wBAAc,MAAM,SAAS;AAC7B,uBAAa,aAAa,SAAS,CAAC,IAAI,IAAI,SAAS,KAAK,KAAK,OAAO,MAAM,IAAI,GAAG,KAAK,SAAS,IAAI,MAAM,MAAM;AAAA,QACpH,OACI;AACD,cAAI,eAAe,MAAM,QAAQ;AAC7B;AACJ,0BAAgB,MAAM;AACtB,wBAAc,MAAM,SAAS;AAC7B,uBAAa,KAAK,KAAK;AAAA,QAC1B;AAAA,MACJ;AACD,eAAS,QAAQ;AACb,YAAI,gBAAgB;AAChB;AACJ,gBAAQ,KAAK,aAAa,UAAU,IAAI,aAAa,CAAC,IAAI,SAAS,KAAK,cAAc,UAAU,CAAC;AACjG,qBAAa;AACb,uBAAe,aAAa,SAAS;AAAA,MACxC;AACD,eAAS,SAAS;AACd,YAAI,KAAK;AACb;AACA,aAAO,QAAQ,UAAU,IAAI,QAAQ,CAAC,IAAI,IAAI,SAAS,SAAS,MAAM;AAAA,IACzE;AAAA,EACL;AACA,OAAK,QAAqB,oBAAI,SAAS,CAAC,EAAE,GAAG,CAAC;AAC9C,WAAS,WAAW,MAAM;AACtB,QAAI,SAAS;AACb,aAAS,QAAQ;AACb,gBAAU,KAAK,SAAS;AAC5B,WAAO;AAAA,EACX;AACA,WAAS,WAAW,MAAM,QAAQ,OAAO,GAAG,KAAK,KAAK;AAClD,aAAS,MAAM,GAAGrD,KAAI,GAAG,QAAQ,MAAMA,KAAI,KAAK,UAAU,OAAO,IAAIA,MAAK;AACtE,UAAI,OAAO,KAAKA,EAAC,GAAG,MAAM,MAAM,KAAK;AACrC,UAAI,OAAO,MAAM;AACb,YAAI,MAAM;AACN,iBAAO,KAAK,MAAM,GAAG,KAAK,GAAG;AACjC,YAAI,MAAM;AACN,iBAAO,KAAK,MAAM,OAAO,GAAG;AAChC,YAAI,OAAO;AACP,iBAAO,OAAO,SAAS,CAAC,KAAK;AAC7B,kBAAQ;AAAA,QACX;AAEG,iBAAO,KAAK,IAAI;AAAA,MACvB;AACD,YAAM,MAAM;AAAA,IACf;AACD,WAAO;AAAA,EACX;AACA,WAAS,UAAU,MAAM,MAAM,IAAI;AAC/B,WAAO,WAAW,MAAM,CAAC,EAAE,GAAG,MAAM,EAAE;AAAA,EAC1C;AAAA,EACA,MAAM,cAAc;AAAA,IAChB,YAAY,MAAM,MAAM,GAAG;AACvB,WAAK,MAAM;AACX,WAAK,OAAO;AACZ,WAAK,YAAY;AACjB,WAAK,QAAQ;AACb,WAAK,QAAQ,CAAC,IAAI;AAClB,WAAK,UAAU,CAAC,MAAM,IAAI,KAAK,gBAAgB,WAAW,KAAK,KAAK,SAAS,KAAK,SAAS,WAAW,CAAC;AAAA,IAC1G;AAAA,IACD,UAAU,MAAM,KAAK;AACjB,WAAK,OAAO,KAAK,YAAY;AAC7B,iBAAS;AACL,YAAI,OAAO,KAAK,MAAM,SAAS;AAC/B,YAAIuC,OAAM,KAAK,MAAM,IAAI,GAAG,cAAc,KAAK,QAAQ,IAAI,GAAG,SAAS,eAAe;AACtF,YAAI,OAAOA,gBAAe,WAAWA,KAAI,KAAK,SAASA,KAAI,SAAS;AACpE,YAAI,WAAW,MAAM,IAAI,OAAO,IAAI;AAChC,cAAI,QAAQ,GAAG;AACX,iBAAK,OAAO;AACZ,iBAAK,QAAQ;AACb,mBAAO;AAAA,UACV;AACD,cAAI,MAAM;AACN,iBAAK,QAAQ,OAAO,CAAC;AACzB,eAAK,MAAM;AACX,eAAK,QAAQ;QAChB,YACS,cAAc,OAAO,MAAM,IAAI,IAAI,IAAI;AAC7C,eAAK,QAAQ,IAAI,KAAK;AACtB,cAAI,QAAQ,GAAG;AACX,iBAAK,YAAY;AACjB,iBAAK,QAAQ;AACb,mBAAO;AAAA,UACV;AACD;AAAA,QACH,WACQA,gBAAe,UAAU;AAE9B,cAAI,OAAOA,KAAI,KAAK,UAAU,MAAM,IAAI,KAAK,EAAE;AAC/C,eAAK,QAAQ,IAAI,KAAK;AACtB,cAAI,KAAK,SAAS,KAAK,IAAI,GAAG,IAAI,GAAG;AACjC,iBAAK,QAAQ,QAAQ,IAAI,OAAO,MAAM,IAAI,KAAK,MAAM,IAAI,IAAI,KAAK,MAAM,GAAG,KAAK,SAAS,IAAI;AAC7F,mBAAO;AAAA,UACV;AACD,kBAAQ,KAAK;AAAA,QAChB,OACI;AACD,cAAI,OAAOA,KAAI,SAAS,UAAU,MAAM,IAAI,KAAK,EAAE;AACnD,cAAI,OAAO,KAAK,QAAQ;AACpB,oBAAQ,KAAK;AACb,iBAAK,QAAQ,IAAI,KAAK;AAAA,UACzB,OACI;AACD,gBAAI,MAAM;AACN,mBAAK,QAAQ,IAAI;AACrB,iBAAK,MAAM,KAAK,IAAI;AACpB,iBAAK,QAAQ,KAAK,MAAM,IAAI,KAAK,gBAAgB,WAAW,KAAK,KAAK,SAAS,KAAK,SAAS,WAAW,CAAC;AAAA,UAC5G;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AAAA,IACD,KAAK,OAAO,GAAG;AACX,UAAI,OAAO,GAAG;AACV,aAAK,UAAU,CAAC,MAAO,CAAC,KAAK,GAAG;AAChC,eAAO,KAAK,MAAM;AAAA,MACrB;AACD,aAAO,KAAK,UAAU,MAAM,KAAK,GAAG;AAAA,IACvC;AAAA,EACL;AAAA,EACA,MAAM,kBAAkB;AAAA,IACpB,YAAY,MAAM,OAAO,KAAK;AAC1B,WAAK,QAAQ;AACb,WAAK,OAAO;AACZ,WAAK,SAAS,IAAI,cAAc,MAAM,QAAQ,MAAM,KAAK,CAAC;AAC1D,WAAK,MAAM,QAAQ,MAAM,KAAK,SAAS;AACvC,WAAK,OAAO,KAAK,IAAI,OAAO,GAAG;AAC/B,WAAK,KAAK,KAAK,IAAI,OAAO,GAAG;AAAA,IAChC;AAAA,IACD,UAAU,MAAM,KAAK;AACjB,UAAI,MAAM,IAAI,KAAK,OAAO,KAAK,OAAO,KAAK,OAAO,KAAK,IAAI;AACvD,aAAK,QAAQ;AACb,aAAK,OAAO;AACZ,eAAO;AAAA,MACV;AACD,cAAQ,KAAK,IAAI,GAAG,MAAM,IAAI,KAAK,MAAM,KAAK,KAAK,KAAK,OAAO,KAAK,GAAG;AACvE,UAAI,QAAQ,MAAM,IAAI,KAAK,MAAM,KAAK,OAAO,KAAK,KAAK,KAAK;AAC5D,UAAI,OAAO;AACP,eAAO;AACX,eAAS;AACT,UAAI,EAAE,MAAK,IAAK,KAAK,OAAO,KAAK,IAAI;AACrC,WAAK,QAAQ,MAAM,SAAS,QAAQ;AACpC,WAAK,QAAQ,MAAM,UAAU,QAAQ,QAAQ,MAAM,IAAI,MAAM,MAAM,MAAM,SAAS,KAAK,IAAI,MAAM,MAAM,GAAG,KAAK;AAC/G,WAAK,OAAO,CAAC,KAAK;AAClB,aAAO;AAAA,IACV;AAAA,IACD,KAAK,OAAO,GAAG;AACX,UAAI,OAAO;AACP,eAAO,KAAK,IAAI,MAAM,KAAK,OAAO,KAAK,GAAG;AAAA,eACrC,OAAO;AACZ,eAAO,KAAK,IAAI,MAAM,KAAK,KAAK,KAAK,GAAG;AAC5C,aAAO,KAAK,UAAU,MAAM,KAAK,OAAO,GAAG;AAAA,IAC9C;AAAA,IACD,IAAI,YAAY;AAAE,aAAO,KAAK,OAAO,aAAa,KAAK,SAAS;AAAA,IAAK;AAAA,EACzE;AAAA,EACA,MAAM,WAAW;AAAA,IACb,YAAY,OAAO;AACf,WAAK,QAAQ;AACb,WAAK,aAAa;AAClB,WAAK,QAAQ;AACb,WAAK,OAAO;AAAA,IACf;AAAA,IACD,KAAK,OAAO,GAAG;AACX,UAAI,EAAE,MAAM,WAAW,MAAK,IAAK,KAAK,MAAM,KAAK,IAAI;AACrD,UAAI,MAAM;AACN,aAAK,OAAO;AACZ,aAAK,QAAQ;AAAA,MAChB,WACQ,WAAW;AAChB,YAAI,KAAK,YAAY;AACjB,eAAK,QAAQ;AAAA,QAChB,OACI;AACD,eAAK,aAAa;AAClB,eAAK,KAAI;AAAA,QACZ;AAAA,MACJ,OACI;AACD,aAAK,QAAQ;AACb,aAAK,aAAa;AAAA,MACrB;AACD,aAAO;AAAA,IACV;AAAA,IACD,IAAI,YAAY;AAAE,aAAO;AAAA,IAAQ;AAAA,EACrC;AACA,MAAI,OAAO,UAAU,aAAa;AAC9B,SAAK,UAAU,OAAO,QAAQ,IAAI,WAAY;AAAE,aAAO,KAAK,KAAM;AAAA;AAClE,kBAAc,UAAU,OAAO,QAAQ,IAAI,kBAAkB,UAAU,OAAO,QAAQ,IAClF,WAAW,UAAU,OAAO,QAAQ,IAAI,WAAY;AAAE,aAAO;AAAA;EACrE;AAAA,EAKA,MAAM,KAAK;AAAA;AAAA;AAAA;AAAA,IAIP,YAIA,MAKA,IAIAe,SAIA,MAAM;AACF,WAAK,OAAO;AACZ,WAAK,KAAK;AACV,WAAK,SAASA;AACd,WAAK,OAAO;AAAA,IACf;AAAA;AAAA;AAAA;AAAA,IAID,IAAI,SAAS;AAAE,aAAO,KAAK,KAAK,KAAK;AAAA,IAAO;AAAA,EAChD;AAQA,MAAI,SAAsB,i0CAAizC,MAAM,GAAG,EAAE,IAAI,CAAA9C,OAAKA,KAAI,SAASA,IAAG,EAAE,IAAI,CAAC;AAEt3C,WAASR,KAAI,GAAGA,KAAI,OAAO,QAAQA;AAC/B,WAAOA,EAAC,KAAK,OAAOA,KAAI,CAAC;AAC7B,WAAS,gBAAgBuD,OAAM;AAC3B,aAASvD,KAAI,GAAGA,KAAI,OAAO,QAAQA,MAAK;AACpC,UAAI,OAAOA,EAAC,IAAIuD;AACZ,eAAO,OAAOvD,KAAI,CAAC,KAAKuD;AAChC,WAAO;AAAA,EACX;AACA,WAAS,oBAAoBA,OAAM;AAC/B,WAAOA,SAAQ,UAAWA,SAAQ;AAAA,EACtC;AACA,QAAM,MAAM;AASZ,WAAS,iBAAiB,KAAK,KAAK,UAAU,MAAM,mBAAmB,MAAM;AACzE,YAAQ,UAAU,mBAAmB,kBAAkB,KAAK,KAAK,gBAAgB;AAAA,EACrF;AACA,WAAS,iBAAiB,KAAK,KAAK,kBAAkB;AAClD,QAAI,OAAO,IAAI;AACX,aAAO;AAEX,QAAI,OAAO,aAAa,IAAI,WAAW,GAAG,CAAC,KAAK,cAAc,IAAI,WAAW,MAAM,CAAC,CAAC;AACjF;AACJ,QAAI,OAAO,YAAY,KAAK,GAAG;AAC/B,WAAO,cAAc,IAAI;AACzB,WAAO,MAAM,IAAI,QAAQ;AACrB,UAAI,OAAO,YAAY,KAAK,GAAG;AAC/B,UAAI,QAAQ,OAAO,QAAQ,OAAO,oBAAoB,gBAAgB,IAAI,GAAG;AACzE,eAAO,cAAc,IAAI;AACzB,eAAO;AAAA,MACV,WACQ,oBAAoB,IAAI,GAAG;AAChC,YAAI,cAAc,GAAGvD,KAAI,MAAM;AAC/B,eAAOA,MAAK,KAAK,oBAAoB,YAAY,KAAKA,EAAC,CAAC,GAAG;AACvD;AACA,UAAAA,MAAK;AAAA,QACR;AACD,YAAI,cAAc,KAAK;AACnB;AAAA;AAEA,iBAAO;AAAA,MACd,OACI;AACD;AAAA,MACH;AAAA,IACJ;AACD,WAAO;AAAA,EACX;AACA,WAAS,iBAAiB,KAAK,KAAK,kBAAkB;AAClD,WAAO,MAAM,GAAG;AACZ,UAAI,QAAQ,iBAAiB,KAAK,MAAM,GAAG,gBAAgB;AAC3D,UAAI,QAAQ;AACR,eAAO;AACX;AAAA,IACH;AACD,WAAO;AAAA,EACX;AACA,WAAS,aAAa,IAAI;AAAE,WAAO,MAAM,SAAU,KAAK;AAAA,EAAS;AACjE,WAAS,cAAc,IAAI;AAAE,WAAO,MAAM,SAAU,KAAK;AAAA,EAAS;AAMlE,WAAS,YAAY,KAAK,KAAK;AAC3B,QAAI,QAAQ,IAAI,WAAW,GAAG;AAC9B,QAAI,CAAC,cAAc,KAAK,KAAK,MAAM,KAAK,IAAI;AACxC,aAAO;AACX,QAAI,QAAQ,IAAI,WAAW,MAAM,CAAC;AAClC,QAAI,CAAC,aAAa,KAAK;AACnB,aAAO;AACX,YAAS,QAAQ,SAAW,OAAO,QAAQ,SAAU;AAAA,EACzD;AAeA,WAAS,cAAcuD,OAAM;AAAE,WAAOA,QAAO,QAAU,IAAI;AAAA,EAAI;AAE/D,QAAM,eAAe;AAIrB,MAAI,UAAwB,yBAAUC,UAAS;AAK3C,IAAAA,SAAQA,SAAQ,QAAQ,IAAI,CAAC,IAAI;AAIjC,IAAAA,SAAQA,SAAQ,UAAU,IAAI,CAAC,IAAI;AAInC,IAAAA,SAAQA,SAAQ,aAAa,IAAI,CAAC,IAAI;AAItC,IAAAA,SAAQA,SAAQ,YAAY,IAAI,CAAC,IAAI;AACzC,WAAOA;AAAA,EAAO,EAAG,YAAY,UAAU,CAAA,EAAG;AAAA,EAM1C,MAAM,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IASb,YAIA,UAAU;AACN,WAAK,WAAW;AAAA,IACnB;AAAA;AAAA;AAAA;AAAA,IAID,IAAI,SAAS;AACT,UAAI,SAAS;AACb,eAASxD,KAAI,GAAGA,KAAI,KAAK,SAAS,QAAQA,MAAK;AAC3C,kBAAU,KAAK,SAASA,EAAC;AAC7B,aAAO;AAAA,IACV;AAAA;AAAA;AAAA;AAAA,IAID,IAAI,YAAY;AACZ,UAAI,SAAS;AACb,eAASA,KAAI,GAAGA,KAAI,KAAK,SAAS,QAAQA,MAAK,GAAG;AAC9C,YAAI,MAAM,KAAK,SAASA,KAAI,CAAC;AAC7B,kBAAU,MAAM,IAAI,KAAK,SAASA,EAAC,IAAI;AAAA,MAC1C;AACD,aAAO;AAAA,IACV;AAAA;AAAA;AAAA;AAAA,IAID,IAAI,QAAQ;AAAE,aAAO,KAAK,SAAS,UAAU,KAAK,KAAK,SAAS,UAAU,KAAK,KAAK,SAAS,CAAC,IAAI;AAAA,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMtG,SAASkC,IAAG;AACR,eAASlC,KAAI,GAAG,OAAO,GAAG,OAAO,GAAGA,KAAI,KAAK,SAAS,UAAS;AAC3D,YAAI,MAAM,KAAK,SAASA,IAAG,GAAG,MAAM,KAAK,SAASA,IAAG;AACrD,YAAI,MAAM,GAAG;AACT,UAAAkC,GAAE,MAAM,MAAM,GAAG;AACjB,kBAAQ;AAAA,QACX,OACI;AACD,kBAAQ;AAAA,QACX;AACD,gBAAQ;AAAA,MACX;AAAA,IACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAaD,kBAAkBA,IAAG,aAAa,OAAO;AACrC,kBAAY,MAAMA,IAAG,UAAU;AAAA,IAClC;AAAA;AAAA;AAAA;AAAA,IAID,IAAI,eAAe;AACf,UAAI,WAAW,CAAA;AACf,eAASlC,KAAI,GAAGA,KAAI,KAAK,SAAS,UAAS;AACvC,YAAI,MAAM,KAAK,SAASA,IAAG,GAAG,MAAM,KAAK,SAASA,IAAG;AACrD,YAAI,MAAM;AACN,mBAAS,KAAK,KAAK,GAAG;AAAA;AAEtB,mBAAS,KAAK,KAAK,GAAG;AAAA,MAC7B;AACD,aAAO,IAAI,WAAW,QAAQ;AAAA,IACjC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMD,YAAY,OAAO;AAAE,aAAO,KAAK,QAAQ,QAAQ,MAAM,QAAQ,OAAO,YAAY,MAAM,KAAK;AAAA,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOjG,QAAQ,OAAO,SAAS,OAAO;AAAE,aAAO,MAAM,QAAQ,OAAO,OAAO,MAAM,OAAO,MAAM;AAAA,IAAI;AAAA,IAC3F,OAAO,KAAK,QAAQ,IAAI,OAAO,QAAQ,QAAQ;AAC3C,UAAI,OAAO,GAAG,OAAO;AACrB,eAASA,KAAI,GAAGA,KAAI,KAAK,SAAS,UAAS;AACvC,YAAI,MAAM,KAAK,SAASA,IAAG,GAAG,MAAM,KAAK,SAASA,IAAG,GAAG,OAAO,OAAO;AACtE,YAAI,MAAM,GAAG;AACT,cAAI,OAAO;AACP,mBAAO,QAAQ,MAAM;AACzB,kBAAQ;AAAA,QACX,OACI;AACD,cAAI,QAAQ,QAAQ,UAAU,QAAQ,QACjC,QAAQ,QAAQ,YAAY,OAAO,OAAO,OAAO,OAC9C,QAAQ,QAAQ,eAAe,OAAO,OACtC,QAAQ,QAAQ,cAAc,OAAO;AACzC,mBAAO;AACX,cAAI,OAAO,OAAO,QAAQ,OAAO,QAAQ,KAAK,CAAC;AAC3C,mBAAO,OAAO,QAAQ,QAAQ,IAAI,OAAO,OAAO;AACpD,kBAAQ;AAAA,QACX;AACD,eAAO;AAAA,MACV;AACD,UAAI,MAAM;AACN,cAAM,IAAI,WAAW,YAAY,GAAG,4CAA4C,IAAI,EAAE;AAC1F,aAAO;AAAA,IACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMD,aAAa,MAAM,KAAK,MAAM;AAC1B,eAASA,KAAI,GAAG,MAAM,GAAGA,KAAI,KAAK,SAAS,UAAU,OAAO,MAAK;AAC7D,YAAI,MAAM,KAAK,SAASA,IAAG,GAAG,MAAM,KAAK,SAASA,IAAG,GAAG,MAAM,MAAM;AACpE,YAAI,OAAO,KAAK,OAAO,MAAM,OAAO;AAChC,iBAAO,MAAM,QAAQ,MAAM,KAAK,UAAU;AAC9C,cAAM;AAAA,MACT;AACD,aAAO;AAAA,IACV;AAAA;AAAA;AAAA;AAAA,IAID,WAAW;AACP,UAAI,SAAS;AACb,eAASA,KAAI,GAAGA,KAAI,KAAK,SAAS,UAAS;AACvC,YAAI,MAAM,KAAK,SAASA,IAAG,GAAG,MAAM,KAAK,SAASA,IAAG;AACrD,mBAAW,SAAS,MAAM,MAAM,OAAO,OAAO,IAAI,MAAM,MAAM;AAAA,MACjE;AACD,aAAO;AAAA,IACV;AAAA;AAAA;AAAA;AAAA,IAID,SAAS;AAAE,aAAO,KAAK;AAAA,IAAW;AAAA;AAAA;AAAA;AAAA;AAAA,IAKlC,OAAO,SAAS,MAAM;AAClB,UAAI,CAAC,MAAM,QAAQ,IAAI,KAAK,KAAK,SAAS,KAAK,KAAK,KAAK,CAAAL,OAAK,OAAOA,MAAK,QAAQ;AAC9E,cAAM,IAAI,WAAW,2CAA2C;AACpE,aAAO,IAAI,WAAW,IAAI;AAAA,IAC7B;AAAA;AAAA;AAAA;AAAA,IAID,OAAO,OAAO,UAAU;AAAE,aAAO,IAAI,WAAW,QAAQ;AAAA,IAAI;AAAA,EAChE;AAAA,EAMA,MAAM,kBAAkB,WAAW;AAAA,IAC/B,YAAY,UAIZ,UAAU;AACN,YAAM,QAAQ;AACd,WAAK,WAAW;AAAA,IACnB;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,MAAM8D,MAAK;AACP,UAAI,KAAK,UAAUA,KAAI;AACnB,cAAM,IAAI,WAAW,yDAAyD;AAClF,kBAAY,MAAM,CAAC,OAAO,KAAK,OAAO,MAAM,SAASA,OAAMA,KAAI,QAAQ,OAAO,SAAS,MAAM,QAAQ,IAAI,GAAG,KAAK;AACjH,aAAOA;AAAA,IACV;AAAA,IACD,QAAQ,OAAO,SAAS,OAAO;AAAE,aAAO,OAAO,MAAM,OAAO,QAAQ,IAAI;AAAA,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAO5E,OAAOA,MAAK;AACR,UAAI,WAAW,KAAK,SAAS,MAAO,GAAE,WAAW;AACjD,eAASzD,KAAI,GAAG,MAAM,GAAGA,KAAI,SAAS,QAAQA,MAAK,GAAG;AAClD,YAAI,MAAM,SAASA,EAAC,GAAG,MAAM,SAASA,KAAI,CAAC;AAC3C,YAAI,OAAO,GAAG;AACV,mBAASA,EAAC,IAAI;AACd,mBAASA,KAAI,CAAC,IAAI;AAClB,cAAIC,SAAQD,MAAK;AACjB,iBAAO,SAAS,SAASC;AACrB,qBAAS,KAAK,KAAK,KAAK;AAC5B,mBAAS,KAAK,MAAMwD,KAAI,MAAM,KAAK,MAAM,GAAG,IAAI,KAAK,KAAK;AAAA,QAC7D;AACD,eAAO;AAAA,MACV;AACD,aAAO,IAAI,UAAU,UAAU,QAAQ;AAAA,IAC1C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOD,QAAQ,OAAO;AAAE,aAAO,KAAK,QAAQ,QAAQ,MAAM,QAAQ,OAAO,YAAY,MAAM,OAAO,IAAI;AAAA,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAcnG,IAAI,OAAO,SAAS,OAAO;AAAE,aAAO,MAAM,QAAQ,OAAO,OAAO,MAAM,OAAO,QAAQ,IAAI;AAAA,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAU7F,YAAYvB,IAAG,aAAa,OAAO;AAC/B,kBAAY,MAAMA,IAAG,UAAU;AAAA,IAClC;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,IAAI,OAAO;AAAE,aAAO,WAAW,OAAO,KAAK,QAAQ;AAAA,IAAI;AAAA;AAAA;AAAA;AAAA,IAIvD,OAAO,QAAQ;AACX,UAAI,iBAAiB,CAAA,GAAI,iBAAiB,CAAA,GAAI,mBAAmB,CAAA;AACjE,UAAI,OAAO,IAAI,YAAY,IAAI;AAC/B;AAAM,iBAASlC,KAAI,GAAG,MAAM,OAAK;AAC7B,cAAI,OAAOA,MAAK,OAAO,SAAS,MAAM,OAAOA,IAAG;AAChD,iBAAO,MAAM,QAAQ,OAAO,QAAQ,KAAK,OAAO,GAAG;AAC/C,gBAAI,KAAK;AACL,oBAAM;AACV,gBAAI,MAAM,KAAK,IAAI,KAAK,KAAK,OAAO,GAAG;AACvC,uBAAW,kBAAkB,KAAK,EAAE;AACpC,gBAAI,MAAM,KAAK,OAAO,KAAK,KAAK,KAAK,OAAO,IAAI,KAAK,MAAM;AAC3D,uBAAW,gBAAgB,KAAK,GAAG;AACnC,gBAAI,MAAM;AACN,wBAAU,gBAAgB,gBAAgB,KAAK,IAAI;AACvD,iBAAK,QAAQ,GAAG;AAChB,mBAAO;AAAA,UACV;AACD,cAAI,MAAM,OAAOA,IAAG;AACpB,iBAAO,MAAM,KAAK;AACd,gBAAI,KAAK;AACL,oBAAM;AACV,gBAAI,MAAM,KAAK,IAAI,KAAK,KAAK,MAAM,GAAG;AACtC,uBAAW,gBAAgB,KAAK,EAAE;AAClC,uBAAW,kBAAkB,KAAK,KAAK,OAAO,KAAK,KAAK,KAAK,OAAO,IAAI,KAAK,MAAM,CAAC;AACpF,iBAAK,QAAQ,GAAG;AAChB,mBAAO;AAAA,UACV;AAAA,QACJ;AACD,aAAO;AAAA,QAAE,SAAS,IAAI,UAAU,gBAAgB,cAAc;AAAA,QAC1D,UAAU,WAAW,OAAO,gBAAgB;AAAA,MAAC;AAAA,IACpD;AAAA;AAAA;AAAA;AAAA,IAID,SAAS;AACL,UAAI,QAAQ,CAAA;AACZ,eAASA,KAAI,GAAGA,KAAI,KAAK,SAAS,QAAQA,MAAK,GAAG;AAC9C,YAAI,MAAM,KAAK,SAASA,EAAC,GAAG,MAAM,KAAK,SAASA,KAAI,CAAC;AACrD,YAAI,MAAM;AACN,gBAAM,KAAK,GAAG;AAAA,iBACT,OAAO;AACZ,gBAAM,KAAK,CAAC,GAAG,CAAC;AAAA;AAEhB,gBAAM,KAAK,CAAC,GAAG,EAAE,OAAO,KAAK,SAASA,MAAK,CAAC,EAAE,OAAM,CAAE,CAAC;AAAA,MAC9D;AACD,aAAO;AAAA,IACV;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,OAAO,GAAG,SAAS,QAAQ,SAAS;AAChC,UAAI,WAAW,CAAA,GAAI,WAAW,CAAA,GAAI,MAAM;AACxC,UAAI,QAAQ;AACZ,eAAS,MAAM,QAAQ,OAAO;AAC1B,YAAI,CAAC,SAAS,CAAC,SAAS;AACpB;AACJ,YAAI,MAAM;AACN,qBAAW,UAAU,SAAS,KAAK,EAAE;AACzC,YAAI,MAAM,IAAI,UAAU,UAAU,QAAQ;AAC1C,gBAAQ,QAAQ,MAAM,QAAQ,IAAI,IAAI,KAAK,CAAC,IAAI;AAChD,mBAAW,CAAA;AACX,mBAAW,CAAA;AACX,cAAM;AAAA,MACT;AACD,eAAS0D,SAAQ,MAAM;AACnB,YAAI,MAAM,QAAQ,IAAI,GAAG;AACrB,mBAAS,OAAO;AACZ,YAAAA,SAAQ,GAAG;AAAA,QAClB,WACQ,gBAAgB,WAAW;AAChC,cAAI,KAAK,UAAU;AACf,kBAAM,IAAI,WAAW,qCAAqC,KAAK,MAAM,cAAc,MAAM,GAAG;AAChG;AACA,kBAAQ,QAAQ,MAAM,QAAQ,KAAK,IAAI,KAAK,CAAC,IAAI;AAAA,QACpD,OACI;AACD,cAAI,EAAE,MAAM,KAAK,MAAM,QAAAd,QAAM,IAAK;AAClC,cAAI,OAAO,MAAM,OAAO,KAAK,KAAK;AAC9B,kBAAM,IAAI,WAAW,wBAAwB,IAAI,OAAO,EAAE,sBAAsB,MAAM,GAAG;AAC7F,cAAI,UAAU,CAACA,UAAS,KAAK,QAAQ,OAAOA,WAAU,WAAW,KAAK,GAAGA,QAAO,MAAM,WAAW,YAAY,CAAC,IAAIA;AAClH,cAAI,SAAS,QAAQ;AACrB,cAAI,QAAQ,MAAM,UAAU;AACxB;AACJ,cAAI,OAAO;AACP;AACJ,cAAI,OAAO;AACP,uBAAW,UAAU,OAAO,KAAK,EAAE;AACvC,qBAAW,UAAU,KAAK,MAAM,MAAM;AACtC,oBAAU,UAAU,UAAU,OAAO;AACrC,gBAAM;AAAA,QACT;AAAA,MACJ;AACD,MAAAc,SAAQ,OAAO;AACf,YAAM,CAAC,KAAK;AACZ,aAAO;AAAA,IACV;AAAA;AAAA;AAAA;AAAA,IAID,OAAO,MAAM,QAAQ;AACjB,aAAO,IAAI,UAAU,SAAS,CAAC,QAAQ,EAAE,IAAI,IAAI,CAAA,CAAE;AAAA,IACtD;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,OAAO,SAAS,MAAM;AAClB,UAAI,CAAC,MAAM,QAAQ,IAAI;AACnB,cAAM,IAAI,WAAW,0CAA0C;AACnE,UAAI,WAAW,CAAA,GAAI,WAAW;AAC9B,eAAS1D,KAAI,GAAGA,KAAI,KAAK,QAAQA,MAAK;AAClC,YAAI,OAAO,KAAKA,EAAC;AACjB,YAAI,OAAO,QAAQ,UAAU;AACzB,mBAAS,KAAK,MAAM,EAAE;AAAA,QACzB,WACQ,CAAC,MAAM,QAAQ,IAAI,KAAK,OAAO,KAAK,CAAC,KAAK,YAAY,KAAK,KAAK,CAACH,IAAGG,OAAMA,MAAK,OAAOH,MAAK,QAAQ,GAAG;AAC3G,gBAAM,IAAI,WAAW,0CAA0C;AAAA,QAClE,WACQ,KAAK,UAAU,GAAG;AACvB,mBAAS,KAAK,KAAK,CAAC,GAAG,CAAC;AAAA,QAC3B,OACI;AACD,iBAAO,SAAS,SAASG;AACrB,qBAAS,KAAK,KAAK,KAAK;AAC5B,mBAASA,EAAC,IAAI,KAAK,GAAG,KAAK,MAAM,CAAC,CAAC;AACnC,mBAAS,KAAK,KAAK,CAAC,GAAG,SAASA,EAAC,EAAE,MAAM;AAAA,QAC5C;AAAA,MACJ;AACD,aAAO,IAAI,UAAU,UAAU,QAAQ;AAAA,IAC1C;AAAA;AAAA;AAAA;AAAA,IAID,OAAO,UAAU,UAAU,UAAU;AACjC,aAAO,IAAI,UAAU,UAAU,QAAQ;AAAA,IAC1C;AAAA,EACL;AACA,WAAS,WAAW,UAAU,KAAK,KAAK,YAAY,OAAO;AACvD,QAAI,OAAO,KAAK,OAAO;AACnB;AACJ,QAAI,OAAO,SAAS,SAAS;AAC7B,QAAI,QAAQ,KAAK,OAAO,KAAK,OAAO,SAAS,OAAO,CAAC;AACjD,eAAS,IAAI,KAAK;AAAA,aACb,OAAO,KAAK,SAAS,IAAI,KAAK;AACnC,eAAS,OAAO,CAAC,KAAK;AAAA,aACjB,WAAW;AAChB,eAAS,IAAI,KAAK;AAClB,eAAS,OAAO,CAAC,KAAK;AAAA,IACzB;AAEG,eAAS,KAAK,KAAK,GAAG;AAAA,EAC9B;AACA,WAAS,UAAU,QAAQ,UAAU,OAAO;AACxC,QAAI,MAAM,UAAU;AAChB;AACJ,QAAIC,SAAS,SAAS,SAAS,KAAM;AACrC,QAAIA,SAAQ,OAAO,QAAQ;AACvB,aAAO,OAAO,SAAS,CAAC,IAAI,OAAO,OAAO,SAAS,CAAC,EAAE,OAAO,KAAK;AAAA,IACrE,OACI;AACD,aAAO,OAAO,SAASA;AACnB,eAAO,KAAK,KAAK,KAAK;AAC1B,aAAO,KAAK,KAAK;AAAA,IACpB;AAAA,EACL;AACA,WAAS,YAAY,MAAMiC,IAAG,YAAY;AACtC,QAAI,WAAW,KAAK;AACpB,aAAS,OAAO,GAAG,OAAO,GAAGlC,KAAI,GAAGA,KAAI,KAAK,SAAS,UAAS;AAC3D,UAAI,MAAM,KAAK,SAASA,IAAG,GAAG,MAAM,KAAK,SAASA,IAAG;AACrD,UAAI,MAAM,GAAG;AACT,gBAAQ;AACR,gBAAQ;AAAA,MACX,OACI;AACD,YAAI,OAAO,MAAM,OAAO,MAAM,OAAO,KAAK;AAC1C,mBAAS;AACL,kBAAQ;AACR,kBAAQ;AACR,cAAI,OAAO;AACP,mBAAO,KAAK,OAAO,SAAUA,KAAI,KAAM,CAAC,CAAC;AAC7C,cAAI,cAAcA,MAAK,KAAK,SAAS,UAAU,KAAK,SAASA,KAAI,CAAC,IAAI;AAClE;AACJ,gBAAM,KAAK,SAASA,IAAG;AACvB,gBAAM,KAAK,SAASA,IAAG;AAAA,QAC1B;AACD,QAAAkC,GAAE,MAAM,MAAM,MAAM,MAAM,IAAI;AAC9B,eAAO;AACP,eAAO;AAAA,MACV;AAAA,IACJ;AAAA,EACL;AACA,WAAS,OAAO,MAAM,MAAM,QAAQ,QAAQ,OAAO;AAG/C,QAAI,WAAW,CAAA,GAAIU,UAAS,QAAQ,CAAA,IAAK;AACzC,QAAIjD,KAAI,IAAI,YAAY,IAAI,GAAGsB,KAAI,IAAI,YAAY,IAAI;AAKvD,aAAS,WAAW,QAAM;AACtB,UAAItB,GAAE,OAAO,MAAMsB,GAAE,OAAO,IAAI;AAE5B,YAAI,MAAM,KAAK,IAAItB,GAAE,KAAKsB,GAAE,GAAG;AAC/B,mBAAW,UAAU,KAAK,EAAE;AAC5B,QAAAtB,GAAE,QAAQ,GAAG;AACb,QAAAsB,GAAE,QAAQ,GAAG;AAAA,MAChB,WACQA,GAAE,OAAO,MAAMtB,GAAE,MAAM,KAAK,YAAYA,GAAE,KAAKA,GAAE,OAAO,MAAMsB,GAAE,MAAMtB,GAAE,OAAOsB,GAAE,OAAOtB,GAAE,OAAO,CAAC,UAAU;AAIjH,YAAI,MAAMsB,GAAE;AACZ,mBAAW,UAAUA,GAAE,KAAK,EAAE;AAC9B,eAAO,KAAK;AACR,cAAI,QAAQ,KAAK,IAAItB,GAAE,KAAK,GAAG;AAC/B,cAAIA,GAAE,OAAO,KAAK,WAAWA,GAAE,KAAKA,GAAE,OAAO,OAAO;AAChD,uBAAW,UAAU,GAAGA,GAAE,GAAG;AAC7B,gBAAIiD;AACA,wBAAUA,SAAQ,UAAUjD,GAAE,IAAI;AACtC,uBAAWA,GAAE;AAAA,UAChB;AACD,UAAAA,GAAE,QAAQ,KAAK;AACf,iBAAO;AAAA,QACV;AACD,QAAAsB,GAAE,KAAI;AAAA,MACT,WACQtB,GAAE,OAAO,GAAG;AAGjB,YAAI,MAAM,GAAG,OAAOA,GAAE;AACtB,eAAO,MAAM;AACT,cAAIsB,GAAE,OAAO,IAAI;AACb,gBAAI,QAAQ,KAAK,IAAI,MAAMA,GAAE,GAAG;AAChC,mBAAO;AACP,oBAAQ;AACR,YAAAA,GAAE,QAAQ,KAAK;AAAA,UAClB,WACQA,GAAE,OAAO,KAAKA,GAAE,MAAM,MAAM;AACjC,oBAAQA,GAAE;AACV,YAAAA,GAAE,KAAI;AAAA,UACT,OACI;AACD;AAAA,UACH;AAAA,QACJ;AACD,mBAAW,UAAU,KAAK,WAAWtB,GAAE,IAAIA,GAAE,MAAM,CAAC;AACpD,YAAIiD,WAAU,WAAWjD,GAAE;AACvB,oBAAUiD,SAAQ,UAAUjD,GAAE,IAAI;AACtC,mBAAWA,GAAE;AACb,QAAAA,GAAE,QAAQA,GAAE,MAAM,IAAI;AAAA,MACzB,WACQA,GAAE,QAAQsB,GAAE,MAAM;AACvB,eAAO2B,UAAS,UAAU,UAAU,UAAUA,OAAM,IAAI,WAAW,OAAO,QAAQ;AAAA,MACrF,OACI;AACD,cAAM,IAAI,MAAM,+BAA+B;AAAA,MAClD;AAAA,IACJ;AAAA,EACL;AACA,WAAS,YAAY,MAAM,MAAM,QAAQ,OAAO;AAC5C,QAAI,WAAW,CAAA;AACf,QAAIA,UAAS,QAAQ,CAAE,IAAG;AAC1B,QAAIjD,KAAI,IAAI,YAAY,IAAI,GAAGsB,KAAI,IAAI,YAAY,IAAI;AACvD,aAAS,OAAO,WAAS;AACrB,UAAItB,GAAE,QAAQsB,GAAE,MAAM;AAClB,eAAO2B,UAAS,UAAU,UAAU,UAAUA,OAAM,IAAI,WAAW,OAAO,QAAQ;AAAA,MACrF,WACQjD,GAAE,OAAO,GAAG;AACjB,mBAAW,UAAUA,GAAE,KAAK,GAAG,IAAI;AACnC,QAAAA,GAAE,KAAI;AAAA,MACT,WACQsB,GAAE,OAAO,KAAK,CAACA,GAAE,MAAM;AAC5B,mBAAW,UAAU,GAAGA,GAAE,KAAK,IAAI;AACnC,YAAI2B;AACA,oBAAUA,SAAQ,UAAU3B,GAAE,IAAI;AACtC,QAAAA,GAAE,KAAI;AAAA,MACT,WACQtB,GAAE,QAAQsB,GAAE,MAAM;AACvB,cAAM,IAAI,MAAM,+BAA+B;AAAA,MAClD,OACI;AACD,YAAI,MAAM,KAAK,IAAItB,GAAE,MAAMsB,GAAE,GAAG,GAAG,aAAa,SAAS;AACzD,YAAItB,GAAE,OAAO,IAAI;AACb,cAAI,OAAOsB,GAAE,OAAO,KAAK,KAAKA,GAAE,MAAM,IAAIA,GAAE;AAC5C,qBAAW,UAAU,KAAK,MAAM,IAAI;AACpC,cAAI2B,WAAU;AACV,sBAAUA,SAAQ,UAAU3B,GAAE,IAAI;AAAA,QACzC,WACQA,GAAE,OAAO,IAAI;AAClB,qBAAW,UAAUtB,GAAE,MAAM,IAAIA,GAAE,KAAK,KAAK,IAAI;AACjD,cAAIiD;AACA,sBAAUA,SAAQ,UAAUjD,GAAE,QAAQ,GAAG,CAAC;AAAA,QACjD,OACI;AACD,qBAAW,UAAUA,GAAE,MAAM,IAAIA,GAAE,KAAKsB,GAAE,MAAM,IAAIA,GAAE,KAAK,IAAI;AAC/D,cAAI2B,WAAU,CAAC3B,GAAE;AACb,sBAAU2B,SAAQ,UAAU3B,GAAE,IAAI;AAAA,QACzC;AACD,gBAAQtB,GAAE,MAAM,OAAOsB,GAAE,OAAO,KAAKA,GAAE,MAAM,SAAS,QAAQ,SAAS,SAAS;AAChF,QAAAtB,GAAE,SAAS,GAAG;AACd,QAAAsB,GAAE,QAAQ,GAAG;AAAA,MAChB;AAAA,IACJ;AAAA,EACL;AAAA,EACA,MAAM,YAAY;AAAA,IACd,YAAY,KAAK;AACb,WAAK,MAAM;AACX,WAAK,IAAI;AACT,WAAK,KAAI;AAAA,IACZ;AAAA,IACD,OAAO;AACH,UAAI,EAAE,SAAQ,IAAK,KAAK;AACxB,UAAI,KAAK,IAAI,SAAS,QAAQ;AAC1B,aAAK,MAAM,SAAS,KAAK,GAAG;AAC5B,aAAK,MAAM,SAAS,KAAK,GAAG;AAAA,MAC/B,OACI;AACD,aAAK,MAAM;AACX,aAAK,MAAM;AAAA,MACd;AACD,WAAK,MAAM;AAAA,IACd;AAAA,IACD,IAAI,OAAO;AAAE,aAAO,KAAK,OAAO;AAAA,IAAK;AAAA,IACrC,IAAI,OAAO;AAAE,aAAO,KAAK,MAAM,IAAI,KAAK,MAAM,KAAK;AAAA,IAAM;AAAA,IACzD,IAAI,OAAO;AACP,UAAI,EAAE,aAAa,KAAK,KAAKhB,SAAS,KAAK,IAAI,KAAM;AACrD,aAAOA,UAAS,SAAS,SAAS,KAAK,QAAQ,SAASA,MAAK;AAAA,IAChE;AAAA,IACD,QAAQ,KAAK;AACT,UAAI,EAAE,aAAa,KAAK,KAAKA,SAAS,KAAK,IAAI,KAAM;AACrD,aAAOA,UAAS,SAAS,UAAU,CAAC,MAAM,KAAK,QACzC,SAASA,MAAK,EAAE,MAAM,KAAK,KAAK,OAAO,OAAO,SAAY,KAAK,MAAM,GAAG;AAAA,IACjF;AAAA,IACD,QAAQ,KAAK;AACT,UAAI,OAAO,KAAK;AACZ,aAAK,KAAI;AAAA,WACR;AACD,aAAK,OAAO;AACZ,aAAK,OAAO;AAAA,MACf;AAAA,IACJ;AAAA,IACD,SAAS,KAAK;AACV,UAAI,KAAK,OAAO;AACZ,aAAK,QAAQ,GAAG;AAAA,eACX,OAAO,KAAK;AACjB,aAAK,KAAI;AAAA,WACR;AACD,aAAK,OAAO;AACZ,aAAK,OAAO;AAAA,MACf;AAAA,IACJ;AAAA,EACL;AAAA,EAQA,MAAM,eAAe;AAAA,IACjB,YAIA,MAIA,IAAI,OAAO;AACP,WAAK,OAAO;AACZ,WAAK,KAAK;AACV,WAAK,QAAQ;AAAA,IAChB;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,IAAI,SAAS;AAAE,aAAO,KAAK,QAAQ,KAA8B,KAAK,KAAK,KAAK;AAAA,IAAO;AAAA;AAAA;AAAA;AAAA;AAAA,IAKvF,IAAI,OAAO;AAAE,aAAO,KAAK,QAAQ,KAA8B,KAAK,OAAO,KAAK;AAAA,IAAK;AAAA;AAAA;AAAA;AAAA,IAIrF,IAAI,QAAQ;AAAE,aAAO,KAAK,QAAQ,KAAK;AAAA,IAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAO5C,IAAI,QAAQ;AAAE,aAAO,KAAK,QAAQ,IAAgC,KAAK,KAAK,QAAQ,IAA+B,IAAI;AAAA,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA,IAK3H,IAAI,YAAY;AACZ,UAAI,QAAQ,KAAK,QAAQ;AACzB,aAAO,SAAS,IAAI,OAAO;AAAA,IAC9B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOD,IAAI,aAAa;AACb,UAAI,QAAQ,KAAK,SAAS;AAC1B,aAAO,SAAS,WAAwC,SAAY;AAAA,IACvE;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,IAAI,QAAQ,QAAQ,IAAI;AACpB,UAAI,MAAM;AACV,UAAI,KAAK,OAAO;AACZ,eAAO,KAAK,OAAO,OAAO,KAAK,MAAM,KAAK;AAAA,MAC7C,OACI;AACD,eAAO,OAAO,OAAO,KAAK,MAAM,CAAC;AACjC,aAAK,OAAO,OAAO,KAAK,IAAI,EAAE;AAAA,MACjC;AACD,aAAO,QAAQ,KAAK,QAAQ,MAAM,KAAK,KAAK,OAAO,IAAI,eAAe,MAAM,IAAI,KAAK,KAAK;AAAA,IAC7F;AAAA;AAAA;AAAA;AAAA,IAID,OAAO,MAAM,KAAK,MAAM;AACpB,UAAI,QAAQ,KAAK,UAAU,MAAM,KAAK;AAClC,eAAO,gBAAgB,MAAM,MAAM,EAAE;AACzC,UAAI,OAAO,KAAK,IAAI,OAAO,KAAK,MAAM,IAAI,KAAK,IAAI,KAAK,KAAK,MAAM,IAAI,OAAO;AAC9E,aAAO,gBAAgB,MAAM,KAAK,QAAQ,IAAI;AAAA,IACjD;AAAA;AAAA;AAAA;AAAA,IAID,GAAG,OAAO;AACN,aAAO,KAAK,UAAU,MAAM,UAAU,KAAK,QAAQ,MAAM;AAAA,IAC5D;AAAA;AAAA;AAAA;AAAA,IAID,SAAS;AAAE,aAAO,EAAE,QAAQ,KAAK,QAAQ,MAAM,KAAK,KAAI;AAAA,IAAK;AAAA;AAAA;AAAA;AAAA;AAAA,IAK7D,OAAO,SAAS,MAAM;AAClB,UAAI,CAAC,QAAQ,OAAO,KAAK,UAAU,YAAY,OAAO,KAAK,QAAQ;AAC/D,cAAM,IAAI,WAAW,gDAAgD;AACzE,aAAO,gBAAgB,MAAM,KAAK,QAAQ,KAAK,IAAI;AAAA,IACtD;AAAA;AAAA;AAAA;AAAA,IAID,OAAO,OAAO,MAAM,IAAI,OAAO;AAC3B,aAAO,IAAI,eAAe,MAAM,IAAI,KAAK;AAAA,IAC5C;AAAA,EACL;AAAA,EAIA,MAAM,gBAAgB;AAAA,IAClB,YAKA,QAKA,WAAW;AACP,WAAK,SAAS;AACd,WAAK,YAAY;AAAA,IACpB;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,IAAI,QAAQ,QAAQ,IAAI;AACpB,UAAI,OAAO;AACP,eAAO;AACX,aAAO,gBAAgB,OAAO,KAAK,OAAO,IAAI,CAAAkB,OAAKA,GAAE,IAAI,QAAQ,KAAK,CAAC,GAAG,KAAK,SAAS;AAAA,IAC3F;AAAA;AAAA;AAAA;AAAA,IAID,GAAG,OAAO;AACN,UAAI,KAAK,OAAO,UAAU,MAAM,OAAO,UACnC,KAAK,aAAa,MAAM;AACxB,eAAO;AACX,eAASnB,KAAI,GAAGA,KAAI,KAAK,OAAO,QAAQA;AACpC,YAAI,CAAC,KAAK,OAAOA,EAAC,EAAE,GAAG,MAAM,OAAOA,EAAC,CAAC;AAClC,iBAAO;AACf,aAAO;AAAA,IACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMD,IAAI,OAAO;AAAE,aAAO,KAAK,OAAO,KAAK,SAAS;AAAA,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA,IAKlD,WAAW;AACP,aAAO,KAAK,OAAO,UAAU,IAAI,OAAO,IAAI,gBAAgB,CAAC,KAAK,IAAI,GAAG,CAAC;AAAA,IAC7E;AAAA;AAAA;AAAA;AAAA,IAID,SAAS,OAAO,OAAO,MAAM;AACzB,aAAO,gBAAgB,OAAO,CAAC,KAAK,EAAE,OAAO,KAAK,MAAM,GAAG,OAAO,IAAI,KAAK,YAAY,CAAC;AAAA,IAC3F;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,aAAa,OAAO,QAAQ,KAAK,WAAW;AACxC,UAAI,SAAS,KAAK,OAAO,MAAK;AAC9B,aAAO,KAAK,IAAI;AAChB,aAAO,gBAAgB,OAAO,QAAQ,KAAK,SAAS;AAAA,IACvD;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,SAAS;AACL,aAAO,EAAE,QAAQ,KAAK,OAAO,IAAI,CAAAmB,OAAKA,GAAE,OAAQ,CAAA,GAAG,MAAM,KAAK,UAAS;AAAA,IAC1E;AAAA;AAAA;AAAA;AAAA,IAID,OAAO,SAAS,MAAM;AAClB,UAAI,CAAC,QAAQ,CAAC,MAAM,QAAQ,KAAK,MAAM,KAAK,OAAO,KAAK,QAAQ,YAAY,KAAK,QAAQ,KAAK,OAAO;AACjG,cAAM,IAAI,WAAW,iDAAiD;AAC1E,aAAO,IAAI,gBAAgB,KAAK,OAAO,IAAI,CAACA,OAAM,eAAe,SAASA,EAAC,CAAC,GAAG,KAAK,IAAI;AAAA,IAC3F;AAAA;AAAA;AAAA;AAAA,IAID,OAAO,OAAO,QAAQ,OAAO,QAAQ;AACjC,aAAO,IAAI,gBAAgB,CAAC,gBAAgB,MAAM,QAAQ,IAAI,CAAC,GAAG,CAAC;AAAA,IACtE;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,OAAO,OAAO,QAAQ,YAAY,GAAG;AACjC,UAAI,OAAO,UAAU;AACjB,cAAM,IAAI,WAAW,sCAAsC;AAC/D,eAAS,MAAM,GAAGnB,KAAI,GAAGA,KAAI,OAAO,QAAQA,MAAK;AAC7C,YAAI,QAAQ,OAAOA,EAAC;AACpB,YAAI,MAAM,QAAQ,MAAM,QAAQ,MAAM,MAAM,OAAO;AAC/C,iBAAO,gBAAgB,WAAW,OAAO,MAAO,GAAE,SAAS;AAC/D,cAAM,MAAM;AAAA,MACf;AACD,aAAO,IAAI,gBAAgB,QAAQ,SAAS;AAAA,IAC/C;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,OAAO,OAAO,KAAK,QAAQ,GAAG,WAAW,YAAY;AACjD,aAAO,eAAe,OAAO,KAAK,MAAM,SAAS,IAAI,IAAI,QAAQ,IAAI,IAAgC,MAChG,aAAa,OAAO,IAAI,KAAK,IAAI,GAAG,SAAS,MAC5C,eAAe,QAAQ,eAAe,SAAS,aAAa,aAA0C,CAAmC;AAAA,IAClJ;AAAA;AAAA;AAAA;AAAA,IAID,OAAO,MAAM,QAAQ,MAAM,YAAY,WAAW;AAC9C,UAAI,SAAU,eAAe,QAAQ,eAAe,SAAS,aAAa,aAA0C,KAC/G,aAAa,OAAO,IAAI,KAAK,IAAI,GAAG,SAAS;AAClD,aAAO,OAAO,SAAS,eAAe,OAAO,MAAM,QAAQ,KAA8B,IAA+B,KAAK,IACvH,eAAe,OAAO,QAAQ,OAAO,OAAO,SAAS,IAAgC,KAAK,KAAK;AAAA,IACxG;AAAA;AAAA;AAAA;AAAA,IAID,OAAO,WAAW,QAAQ,YAAY,GAAG;AACrC,UAAI,OAAO,OAAO,SAAS;AAC3B,aAAO,KAAK,CAACL,IAAGsB,OAAMtB,GAAE,OAAOsB,GAAE,IAAI;AACrC,kBAAY,OAAO,QAAQ,IAAI;AAC/B,eAASjB,KAAI,GAAGA,KAAI,OAAO,QAAQA,MAAK;AACpC,YAAI,QAAQ,OAAOA,EAAC,GAAG,OAAO,OAAOA,KAAI,CAAC;AAC1C,YAAI,MAAM,QAAQ,MAAM,QAAQ,KAAK,KAAK,MAAM,OAAO,KAAK,IAAI;AAC5D,cAAI,OAAO,KAAK,MAAM,KAAK,KAAK,IAAI,MAAM,IAAI,KAAK,EAAE;AACrD,cAAIA,MAAK;AACL;AACJ,iBAAO,OAAO,EAAEA,IAAG,GAAG,MAAM,SAAS,MAAM,OAAO,gBAAgB,MAAM,IAAI,IAAI,IAAI,gBAAgB,MAAM,MAAM,EAAE,CAAC;AAAA,QACtH;AAAA,MACJ;AACD,aAAO,IAAI,gBAAgB,QAAQ,SAAS;AAAA,IAC/C;AAAA,EACL;AACA,WAAS,eAAe,WAAW,WAAW;AAC1C,aAAS,SAAS,UAAU;AACxB,UAAI,MAAM,KAAK;AACX,cAAM,IAAI,WAAW,sCAAsC;AAAA,EACvE;AAEA,MAAI,SAAS;AAAA,EAWb,MAAM,MAAM;AAAA,IACR,YAIA,SAIA,cAIAO,UAAS,UAAU,SAAS;AACxB,WAAK,UAAU;AACf,WAAK,eAAe;AACpB,WAAK,UAAUA;AACf,WAAK,WAAW;AAIhB,WAAK,KAAK;AACV,WAAK,UAAU,QAAQ,CAAA,CAAE;AACzB,WAAK,aAAa,OAAO,WAAW,aAAa,QAAQ,IAAI,IAAI;AAAA,IACpE;AAAA;AAAA;AAAA;AAAA,IAID,OAAO,OAAO,SAAS,IAAI;AACvB,aAAO,IAAI,MAAM,OAAO,YAAY,CAACZ,OAAMA,KAAI,OAAO,iBAAiB,CAACA,IAAGsB,OAAMtB,OAAMsB,KAAI,OAAO,YAAY,CAAC,OAAO,UAAU,YAAY,CAACtB,IAAGsB,OAAMtB,OAAMsB,KAAI,CAAC,CAAC,OAAO,QAAQ,OAAO,OAAO;AAAA,IAClM;AAAA;AAAA;AAAA;AAAA,IAID,GAAG,OAAO;AACN,aAAO,IAAI,cAAc,CAAE,GAAE,MAAM,GAAyB,KAAK;AAAA,IACpE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAUD,QAAQ,MAAM,KAAK;AACf,UAAI,KAAK;AACL,cAAM,IAAI,MAAM,8BAA8B;AAClD,aAAO,IAAI,cAAc,MAAM,MAAM,GAAyB,GAAG;AAAA,IACpE;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,SAAS,MAAM,KAAK;AAChB,UAAI,KAAK;AACL,cAAM,IAAI,MAAM,8BAA8B;AAClD,aAAO,IAAI,cAAc,MAAM,MAAM,GAAwB,GAAG;AAAA,IACnE;AAAA,IACD,KAAK,OAAO,KAAK;AACb,UAAI,CAAC;AACD,cAAM,CAAAnB,OAAKA;AACf,aAAO,KAAK,QAAQ,CAAC,KAAK,GAAG,WAAS,IAAI,MAAM,MAAM,KAAK,CAAC,CAAC;AAAA,IAChE;AAAA,EACL;AACA,WAAS,UAAUH,IAAGsB,IAAG;AACrB,WAAOtB,MAAKsB,MAAKtB,GAAE,UAAUsB,GAAE,UAAUtB,GAAE,MAAM,CAACE,IAAGG,OAAMH,OAAMoB,GAAEjB,EAAC,CAAC;AAAA,EACzE;AAAA,EACA,MAAM,cAAc;AAAA,IAChB,YAAY,cAAc,OAAO,MAAM,OAAO;AAC1C,WAAK,eAAe;AACpB,WAAK,QAAQ;AACb,WAAK,OAAO;AACZ,WAAK,QAAQ;AACb,WAAK,KAAK;AAAA,IACb;AAAA,IACD,YAAY,WAAW;AACnB,UAAIkB;AACJ,UAAI,SAAS,KAAK;AAClB,UAAIX,WAAU,KAAK,MAAM;AACzB,UAAI,KAAK,KAAK,IAAI,MAAM,UAAU,EAAE,KAAK,GAAG,QAAQ,KAAK,QAAQ;AACjE,UAAI,SAAS,OAAO,SAAS,OAAO,WAAW,CAAA;AAC/C,eAAS,OAAO,KAAK,cAAc;AAC/B,YAAI,OAAO;AACP,mBAAS;AAAA,iBACJ,OAAO;AACZ,mBAAS;AAAA,oBACDW,MAAK,UAAU,IAAI,EAAE,OAAO,QAAQA,QAAO,SAASA,MAAK,KAAK,MAAM;AAC5E,mBAAS,KAAK,UAAU,IAAI,EAAE,CAAC;AAAA,MACtC;AACD,aAAO;AAAA,QACH,OAAO,OAAO;AACV,gBAAM,OAAO,GAAG,IAAI,OAAO,KAAK;AAChC,iBAAO;AAAA,QACV;AAAA,QACD,OAAO,OAAO,IAAI;AACd,cAAK,UAAU,GAAG,cAAgB,WAAW,GAAG,cAAc,GAAG,cAAe,UAAU,OAAO,QAAQ,GAAG;AACxG,gBAAI,SAAS,OAAO,KAAK;AACzB,gBAAI,QAAQ,CAAC,aAAa,QAAQ,MAAM,OAAO,GAAG,GAAGX,QAAO,IAAI,CAACA,SAAQ,QAAQ,MAAM,OAAO,GAAG,CAAC,GAAG;AACjG,oBAAM,OAAO,GAAG,IAAI;AACpB,qBAAO;AAAA,YACV;AAAA,UACJ;AACD,iBAAO;AAAA,QACV;AAAA,QACD,aAAa,CAAC,OAAO,aAAa;AAC9B,cAAI,QAAQ,UAAU,SAAS,OAAO,QAAQ,EAAE;AAChD,cAAI,WAAW,MAAM;AACjB,gBAAI,SAAS,QAAQ,UAAU,OAAO;AACtC,gBAAI,KAAK,aAAa,MAAM,SAAO;AAC/B,qBAAO,eAAe,QAAQ,SAAS,MAAM,GAAG,MAAM,MAAM,MAAM,GAAG,IACjE,eAAe,aAAa,SAAS,MAAM,KAAK,KAAK,KAAK,MAAM,MAAM,KAAK,KAAK,IAAI;AAAA,YAChH,CAAqB,MAAM,QAAQ,aAAa,SAAS,OAAO,KAAK,GAAG,QAAQA,QAAO,IAAIA,SAAQ,SAAS,OAAO,KAAK,GAAG,MAAM,IAAI;AAC7G,oBAAM,OAAO,GAAG,IAAI;AACpB,qBAAO;AAAA,YACV;AAAA,UACJ,OACI;AACD,qBAAS,OAAO,KAAK;AAAA,UACxB;AACD,gBAAM,OAAO,GAAG,IAAI;AACpB,iBAAO;AAAA,QACV;AAAA,MACb;AAAA,IACK;AAAA,EACL;AACA,WAAS,aAAaZ,IAAGsB,IAAGV,UAAS;AACjC,QAAIZ,GAAE,UAAUsB,GAAE;AACd,aAAO;AACX,aAASjB,KAAI,GAAGA,KAAIL,GAAE,QAAQK;AAC1B,UAAI,CAACO,SAAQZ,GAAEK,EAAC,GAAGiB,GAAEjB,EAAC,CAAC;AACnB,eAAO;AACf,WAAO;AAAA,EACX;AACA,WAAS,UAAU,OAAO,OAAO;AAC7B,QAAI,UAAU;AACd,aAAS,QAAQ;AACb,UAAI,WAAW,OAAO,IAAI,IAAI;AAC1B,kBAAU;AAClB,WAAO;AAAA,EACX;AACA,WAAS,iBAAiB,WAAW,OAAO,WAAW;AACnD,QAAI,gBAAgB,UAAU,IAAI,CAAAoB,OAAK,UAAUA,GAAE,EAAE,CAAC;AACtD,QAAI,gBAAgB,UAAU,IAAI,CAAAA,OAAKA,GAAE,IAAI;AAC7C,QAAI,UAAU,cAAc,OAAO,CAAAA,OAAK,EAAEA,KAAI,EAAE;AAChD,QAAI,MAAM,UAAU,MAAM,EAAE,KAAK;AACjC,aAAS,IAAI,OAAO;AAChB,UAAI,SAAS,CAAA;AACb,eAASpB,KAAI,GAAGA,KAAI,cAAc,QAAQA,MAAK;AAC3C,YAAI,QAAQ,QAAQ,OAAO,cAAcA,EAAC,CAAC;AAC3C,YAAI,cAAcA,EAAC,KAAK;AACpB,mBAAS,OAAO;AACZ,mBAAO,KAAK,GAAG;AAAA;AAEnB,iBAAO,KAAK,KAAK;AAAA,MACxB;AACD,aAAO,MAAM,QAAQ,MAAM;AAAA,IAC9B;AACD,WAAO;AAAA,MACH,OAAO,OAAO;AACV,iBAAS,QAAQ;AACb,qBAAW,OAAO,IAAI;AAC1B,cAAM,OAAO,GAAG,IAAI,IAAI,KAAK;AAC7B,eAAO;AAAA,MACV;AAAA,MACD,OAAO,OAAO,IAAI;AACd,YAAI,CAAC,UAAU,OAAO,OAAO;AACzB,iBAAO;AACX,YAAI,QAAQ,IAAI,KAAK;AACrB,YAAI,MAAM,QAAQ,OAAO,MAAM,OAAO,GAAG,CAAC;AACtC,iBAAO;AACX,cAAM,OAAO,GAAG,IAAI;AACpB,eAAO;AAAA,MACV;AAAA,MACD,YAAY,OAAO,UAAU;AACzB,YAAI,aAAa,UAAU,OAAO,aAAa;AAC/C,YAAI,eAAe,SAAS,OAAO,OAAO,MAAM,EAAE,GAAG,WAAW,SAAS,MAAM,KAAK;AACpF,YAAI,gBAAgB,CAAC,cAAc,UAAU,WAAW,YAAY,GAAG;AACnE,gBAAM,OAAO,GAAG,IAAI;AACpB,iBAAO;AAAA,QACV;AACD,YAAI,QAAQ,IAAI,KAAK;AACrB,YAAI,MAAM,QAAQ,OAAO,QAAQ,GAAG;AAChC,gBAAM,OAAO,GAAG,IAAI;AACpB,iBAAO;AAAA,QACV;AACD,cAAM,OAAO,GAAG,IAAI;AACpB,eAAO;AAAA,MACV;AAAA,IACT;AAAA,EACA;AACA,QAAM,YAAyB,sBAAM,OAAO,EAAE,QAAQ,KAAM,CAAA;AAAA,EAK5D,MAAM,WAAW;AAAA,IACb,YAIA,IAAI,SAAS,SAAS,UAItB,MAAM;AACF,WAAK,KAAK;AACV,WAAK,UAAU;AACf,WAAK,UAAU;AACf,WAAK,WAAW;AAChB,WAAK,OAAO;AAIZ,WAAK,WAAW;AAAA,IACnB;AAAA;AAAA;AAAA;AAAA,IAID,OAAO,OAAO,QAAQ;AAClB,UAAI,QAAQ,IAAI,WAAW,UAAU,OAAO,QAAQ,OAAO,QAAQ,OAAO,YAAY,CAACL,IAAGsB,OAAMtB,OAAMsB,KAAI,MAAM;AAChH,UAAI,OAAO;AACP,cAAM,WAAW,OAAO,QAAQ,KAAK;AACzC,aAAO;AAAA,IACV;AAAA,IACD,OAAO,OAAO;AACV,UAAI,OAAO,MAAM,MAAM,SAAS,EAAE,KAAK,CAAAjB,OAAKA,GAAE,SAAS,IAAI;AAC3D,eAAS,SAAS,QAAQ,SAAS,SAAS,SAAS,KAAK,WAAW,KAAK,SAAS,KAAK;AAAA,IAC3F;AAAA;AAAA;AAAA;AAAA,IAID,KAAK,WAAW;AACZ,UAAI,MAAM,UAAU,KAAK,EAAE,KAAK;AAChC,aAAO;AAAA,QACH,QAAQ,CAAC,UAAU;AACf,gBAAM,OAAO,GAAG,IAAI,KAAK,OAAO,KAAK;AACrC,iBAAO;AAAA,QACV;AAAA,QACD,QAAQ,CAAC,OAAO,OAAO;AACnB,cAAI,SAAS,MAAM,OAAO,GAAG;AAC7B,cAAI,QAAQ,KAAK,QAAQ,QAAQ,EAAE;AACnC,cAAI,KAAK,SAAS,QAAQ,KAAK;AAC3B,mBAAO;AACX,gBAAM,OAAO,GAAG,IAAI;AACpB,iBAAO;AAAA,QACV;AAAA,QACD,aAAa,CAAC,OAAO,aAAa;AAC9B,cAAI,SAAS,OAAO,QAAQ,KAAK,EAAE,KAAK,MAAM;AAC1C,kBAAM,OAAO,GAAG,IAAI,SAAS,MAAM,IAAI;AACvC,mBAAO;AAAA,UACV;AACD,gBAAM,OAAO,GAAG,IAAI,KAAK,OAAO,KAAK;AACrC,iBAAO;AAAA,QACV;AAAA,MACb;AAAA,IACK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMD,KAAK,QAAQ;AACT,aAAO,CAAC,MAAM,UAAU,GAAG,EAAE,OAAO,MAAM,OAAQ,CAAA,CAAC;AAAA,IACtD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMD,IAAI,YAAY;AAAE,aAAO;AAAA,IAAO;AAAA,EACpC;AACA,QAAM,QAAQ,EAAE,QAAQ,GAAG,KAAK,GAAG,SAAS,GAAG,MAAM,GAAG,SAAS,EAAC;AAClE,WAAS,KAAK,OAAO;AACjB,WAAO,CAAC,QAAQ,IAAI,cAAc,KAAK,KAAK;AAAA,EAChD;AAWA,QAAM,OAAO;AAAA;AAAA;AAAA;AAAA;AAAA,IAKT,SAAsB,qBAAK,MAAM,OAAO;AAAA;AAAA;AAAA;AAAA;AAAA,IAKxC,MAAmB,qBAAK,MAAM,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA,IAKlC,SAAsB,qBAAK,MAAM,OAAO;AAAA;AAAA;AAAA;AAAA,IAIxC,KAAkB,qBAAK,MAAM,GAAG;AAAA;AAAA;AAAA;AAAA;AAAA,IAKhC,QAAqB,qBAAK,MAAM,MAAM;AAAA,EAC1C;AAAA,EACA,MAAM,cAAc;AAAA,IAChB,YAAY,OAAO+C,OAAM;AACrB,WAAK,QAAQ;AACb,WAAK,OAAOA;AAAA,IACf;AAAA,EACL;AAAA,EAQA,MAAM,YAAY;AAAA;AAAA;AAAA;AAAA;AAAA,IAKd,GAAG,KAAK;AAAE,aAAO,IAAI,oBAAoB,MAAM,GAAG;AAAA,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA,IAKtD,YAAYY,UAAS;AACjB,aAAO,YAAY,YAAY,GAAG,EAAE,aAAa,MAAM,WAAWA,SAAO,CAAE;AAAA,IAC9E;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,IAAI,OAAO;AACP,aAAO,MAAM,OAAO,aAAa,IAAI,IAAI;AAAA,IAC5C;AAAA,EACL;AAAA,EACA,MAAM,oBAAoB;AAAA,IACtB,YAAY,aAAa,OAAO;AAC5B,WAAK,cAAc;AACnB,WAAK,QAAQ;AAAA,IAChB;AAAA,EACL;AAAA,EACA,MAAM,cAAc;AAAA,IAChB,YAAY9B,OAAM,cAAc,cAAc,SAAS,cAAc,QAAQ;AACzE,WAAK,OAAOA;AACZ,WAAK,eAAe;AACpB,WAAK,eAAe;AACpB,WAAK,UAAU;AACf,WAAK,eAAe;AACpB,WAAK,SAAS;AACd,WAAK,iBAAiB;AACtB,aAAO,KAAK,eAAe,SAAS,aAAa;AAC7C,aAAK,eAAe;AAAA,UAAK;AAAA;AAAA;IAChC;AAAA,IACD,YAAY,OAAO;AACf,UAAI,OAAO,KAAK,QAAQ,MAAM,EAAE;AAChC,aAAO,QAAQ,OAAO,MAAM,UAAU,KAAK,aAAa,QAAQ,CAAC;AAAA,IACpE;AAAA,IACD,OAAO,QAAQA,OAAM,cAAc,UAAU;AACzC,UAAI,SAAS,CAAA;AACb,UAAI,SAAS,uBAAO,OAAO,IAAI;AAC/B,UAAI,kBAAkB,oBAAI;AAC1B,eAAS,OAAO,QAAQA,OAAM,cAAc,eAAe,GAAG;AAC1D,YAAI,eAAe;AACf,iBAAO,KAAK,GAAG;AAAA;AAEf,WAAC,OAAO,IAAI,MAAM,EAAE,MAAM,OAAO,IAAI,MAAM,EAAE,IAAI,CAAA,IAAK,KAAK,GAAG;AAAA,MACrE;AACD,UAAI,UAAU,uBAAO,OAAO,IAAI;AAChC,UAAI,eAAe,CAAA;AACnB,UAAI,eAAe,CAAA;AACnB,eAAS,SAAS,QAAQ;AACtB,gBAAQ,MAAM,EAAE,IAAI,aAAa,UAAU;AAC3C,qBAAa,KAAK,CAAAlC,OAAK,MAAM,KAAKA,EAAC,CAAC;AAAA,MACvC;AACD,UAAI,YAAY,aAAa,QAAQ,aAAa,SAAS,SAAS,SAAS,OAAO;AACpF,eAAS,MAAM,QAAQ;AACnB,YAAI,YAAY,OAAO,EAAE,GAAG,QAAQ,UAAU,CAAC,EAAE;AACjD,YAAI,eAAe,aAAa,UAAU,EAAE,KAAK,CAAA;AACjD,YAAI,UAAU;AAAA,UAAM,CAAAyB,OAAKA,GAAE,QAAQ;AAAA;AAAA,WAA0B;AACzD,kBAAQ,MAAM,EAAE,IAAK,aAAa,UAAU,IAAK;AACjD,cAAI,UAAU,cAAc,SAAS,GAAG;AACpC,yBAAa,KAAK,SAAS,MAAM,KAAK,CAAC;AAAA,UAC1C,OACI;AACD,gBAAI,QAAQ,MAAM,QAAQ,UAAU,IAAI,CAAAA,OAAKA,GAAE,KAAK,CAAC;AACrD,yBAAa,KAAK,YAAY,MAAM,QAAQ,OAAO,SAAS,MAAM,KAAK,CAAC,IAAI,SAAS,MAAM,KAAK,IAAI,KAAK;AAAA,UAC5G;AAAA,QACJ,OACI;AACD,mBAASA,MAAK,WAAW;AACrB,gBAAIA,GAAE,QAAQ,GAAyB;AACnC,sBAAQA,GAAE,EAAE,IAAK,aAAa,UAAU,IAAK;AAC7C,2BAAa,KAAKA,GAAE,KAAK;AAAA,YAC5B,OACI;AACD,sBAAQA,GAAE,EAAE,IAAI,aAAa,UAAU;AACvC,2BAAa,KAAK,CAAAzB,OAAKyB,GAAE,YAAYzB,EAAC,CAAC;AAAA,YAC1C;AAAA,UACJ;AACD,kBAAQ,MAAM,EAAE,IAAI,aAAa,UAAU;AAC3C,uBAAa,KAAK,CAAAA,OAAK,iBAAiBA,IAAG,OAAO,SAAS,CAAC;AAAA,QAC/D;AAAA,MACJ;AACD,UAAI,UAAU,aAAa,IAAI,CAAAuC,OAAKA,GAAE,OAAO,CAAC;AAC9C,aAAO,IAAI,cAAcL,OAAM,iBAAiB,SAAS,SAAS,cAAc,MAAM;AAAA,IACzF;AAAA,EACL;AACA,WAAS,QAAQ,WAAW,cAAc,iBAAiB;AACvD,QAAI,SAAS,CAAC,IAAI,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAA,CAAE;AAChC,QAAI,OAAO,oBAAI;AACf,aAAS,MAAM,KAAKkB,OAAM;AACtB,UAAI,QAAQ,KAAK,IAAI,GAAG;AACxB,UAAI,SAAS,MAAM;AACf,YAAI,SAASA;AACT;AACJ,YAAI,QAAQ,OAAO,KAAK,EAAE,QAAQ,GAAG;AACrC,YAAI,QAAQ;AACR,iBAAO,KAAK,EAAE,OAAO,OAAO,CAAC;AACjC,YAAI,eAAe;AACf,0BAAgB,OAAO,IAAI,WAAW;AAAA,MAC7C;AACD,WAAK,IAAI,KAAKA,KAAI;AAClB,UAAI,MAAM,QAAQ,GAAG,GAAG;AACpB,iBAASlD,MAAK;AACV,gBAAMA,IAAGkD,KAAI;AAAA,MACpB,WACQ,eAAe,qBAAqB;AACzC,YAAI,gBAAgB,IAAI,IAAI,WAAW;AACnC,gBAAM,IAAI,WAAW,4CAA4C;AACrE,YAAIY,WAAU,aAAa,IAAI,IAAI,WAAW,KAAK,IAAI;AACvD,wBAAgB,IAAI,IAAI,aAAaA,QAAO;AAC5C,cAAMA,UAASZ,KAAI;AAAA,MACtB,WACQ,eAAe,eAAe;AACnC,cAAM,IAAI,OAAO,IAAI,IAAI;AAAA,MAC5B,WACQ,eAAe,YAAY;AAChC,eAAOA,KAAI,EAAE,KAAK,GAAG;AACrB,YAAI,IAAI;AACJ,gBAAM,IAAI,UAAUA,KAAI;AAAA,MAC/B,WACQ,eAAe,eAAe;AACnC,eAAOA,KAAI,EAAE,KAAK,GAAG;AACrB,YAAI,IAAI,MAAM;AACV,gBAAM,IAAI,MAAM,YAAY,MAAM,OAAO;AAAA,MAChD,OACI;AACD,YAAIY,WAAU,IAAI;AAClB,YAAI,CAACA;AACD,gBAAM,IAAI,MAAM,kDAAkD,GAAG,mHAAmH;AAC5L,cAAMA,UAASZ,KAAI;AAAA,MACtB;AAAA,IACJ;AACD,UAAM,WAAW,MAAM,OAAO;AAC9B,WAAO,OAAO,OAAO,CAACpD,IAAGsB,OAAMtB,GAAE,OAAOsB,EAAC,CAAC;AAAA,EAC9C;AACA,WAAS,WAAW,OAAO,MAAM;AAC7B,QAAI,OAAO;AACP,aAAO;AACX,QAAI,MAAM,QAAQ;AAClB,QAAI,SAAS,MAAM,OAAO,GAAG;AAC7B,QAAI,UAAU;AACV,YAAM,IAAI,MAAM,gDAAgD;AACpE,QAAI,SAAS;AACT,aAAO;AACX,UAAM,OAAO,GAAG,IAAI;AACpB,QAAI,UAAU,MAAM,YAAY,OAAO,MAAM,OAAO,aAAa,GAAG,CAAC;AACrE,WAAO,MAAM,OAAO,GAAG,IAAI,IAA8B;AAAA,EAC7D;AACA,WAAS,QAAQ,OAAO,MAAM;AAC1B,WAAO,OAAO,IAAI,MAAM,OAAO,aAAa,QAAQ,CAAC,IAAI,MAAM,OAAO,QAAQ,CAAC;AAAA,EACnF;AAEA,QAAM,eAA4B,sBAAM;AACxC,QAAM,0BAAuC,sBAAM,OAAO;AAAA,IACtD,SAAS,YAAU,OAAO,KAAK,CAAAuB,OAAKA,EAAC;AAAA,IACrC,QAAQ;AAAA,EACZ,CAAC;AACD,QAAM,gBAA6B,sBAAM,OAAO;AAAA,IAC5C,SAAS,YAAU,OAAO,SAAS,OAAO,CAAC,IAAI;AAAA,IAC/C,QAAQ;AAAA,EACZ,CAAC;AACD,QAAM,eAA4B,sBAAM;AACxC,QAAM,oBAAiC,sBAAM;AAC7C,QAAM,sBAAmC,sBAAM;AAC/C,QAAMoB,aAAwB,sBAAM,OAAO;AAAA,IACvC,SAAS,YAAU,OAAO,SAAS,OAAO,CAAC,IAAI;AAAA,EACnD,CAAC;AAAA,EAWD,MAAM,WAAW;AAAA;AAAA;AAAA;AAAA,IAIb,YAIA,MAIA,OAAO;AACH,WAAK,OAAO;AACZ,WAAK,QAAQ;AAAA,IAChB;AAAA;AAAA;AAAA;AAAA,IAID,OAAO,SAAS;AAAE,aAAO,IAAI,eAAgB;AAAA,IAAG;AAAA,EACpD;AAAA,EAIA,MAAM,eAAe;AAAA;AAAA;AAAA;AAAA,IAIjB,GAAG,OAAO;AAAE,aAAO,IAAI,WAAW,MAAM,KAAK;AAAA,IAAI;AAAA,EACrD;AAAA,EAKA,MAAM,gBAAgB;AAAA;AAAA;AAAA;AAAA,IAIlB,YAQA,KAAK;AACD,WAAK,MAAM;AAAA,IACd;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,GAAG,OAAO;AAAE,aAAO,IAAI,YAAY,MAAM,KAAK;AAAA,IAAI;AAAA,EACtD;AAAA,EAQA,MAAM,YAAY;AAAA;AAAA;AAAA;AAAA,IAId,YAIA,MAIA,OAAO;AACH,WAAK,OAAO;AACZ,WAAK,QAAQ;AAAA,IAChB;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,IAAI,SAAS;AACT,UAAI,SAAS,KAAK,KAAK,IAAI,KAAK,OAAO,OAAO;AAC9C,aAAO,WAAW,SAAY,SAAY,UAAU,KAAK,QAAQ,OAAO,IAAI,YAAY,KAAK,MAAM,MAAM;AAAA,IAC5G;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,GAAG,MAAM;AAAE,aAAO,KAAK,QAAQ;AAAA,IAAO;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQtC,OAAO,OAAO,OAAO,IAAI;AACrB,aAAO,IAAI,gBAAgB,KAAK,QAAQ,CAAApB,OAAKA,GAAE;AAAA,IAClD;AAAA;AAAA;AAAA;AAAA,IAID,OAAO,WAAW,SAAS,SAAS;AAChC,UAAI,CAAC,QAAQ;AACT,eAAO;AACX,UAAI,SAAS,CAAA;AACb,eAAS,UAAU,SAAS;AACxB,YAAI,SAAS,OAAO,IAAI,OAAO;AAC/B,YAAI;AACA,iBAAO,KAAK,MAAM;AAAA,MACzB;AACD,aAAO;AAAA,IACV;AAAA,EACL;AAQA,cAAY,cAA2B,4BAAY;AAInD,cAAY,eAA4B,4BAAY;EAUpD,MAAM,YAAY;AAAA,IACd,YAIA,YAIA,SAKA,WAIA,SAIA,aAKAqB,iBAAgB;AACZ,WAAK,aAAa;AAClB,WAAK,UAAU;AACf,WAAK,YAAY;AACjB,WAAK,UAAU;AACf,WAAK,cAAc;AACnB,WAAK,iBAAiBA;AAItB,WAAK,OAAO;AAIZ,WAAK,SAAS;AACd,UAAI;AACA,uBAAe,WAAW,QAAQ,SAAS;AAC/C,UAAI,CAAC,YAAY,KAAK,CAAClE,OAAMA,GAAE,QAAQ,YAAY,IAAI;AACnD,aAAK,cAAc,YAAY,OAAO,YAAY,KAAK,GAAG,KAAK,IAAK,CAAA,CAAC;AAAA,IAC5E;AAAA;AAAA;AAAA;AAAA,IAID,OAAO,OAAO,YAAY,SAAS,WAAW,SAAS,aAAakE,iBAAgB;AAChF,aAAO,IAAI,YAAY,YAAY,SAAS,WAAW,SAAS,aAAaA,eAAc;AAAA,IAC9F;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IASD,IAAI,SAAS;AACT,aAAO,KAAK,SAAS,KAAK,OAAO,KAAK,QAAQ,MAAM,KAAK,WAAW,GAAG;AAAA,IAC1E;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOD,IAAI,eAAe;AACf,aAAO,KAAK,aAAa,KAAK,WAAW,UAAU,IAAI,KAAK,OAAO;AAAA,IACtE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOD,IAAI,QAAQ;AACR,UAAI,CAAC,KAAK;AACN,aAAK,WAAW,iBAAiB,IAAI;AACzC,aAAO,KAAK;AAAA,IACf;AAAA;AAAA;AAAA;AAAA,IAID,WAAW,MAAM;AACb,eAAS,OAAO,KAAK;AACjB,YAAI,IAAI,QAAQ;AACZ,iBAAO,IAAI;AACnB,aAAO;AAAA,IACV;AAAA;AAAA;AAAA;AAAA,IAID,IAAI,aAAa;AAAE,aAAO,CAAC,KAAK,QAAQ;AAAA,IAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOhD,IAAI,eAAe;AAAE,aAAO,KAAK,WAAW,UAAU,KAAK,MAAM;AAAA,IAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQ1E,YAAY,OAAO;AACf,UAAIhE,KAAI,KAAK,WAAW,YAAY,SAAS;AAC7C,aAAO,CAAC,EAAEA,OAAMA,MAAK,SAASA,GAAE,SAAS,MAAM,UAAUA,GAAE,MAAM,GAAG,MAAM,MAAM,KAAK,SAASA,GAAE,MAAM,MAAM,KAAK;AAAA,IACpH;AAAA,EACL;AAKA,cAAY,OAAoB,2BAAW;AA2B3C,cAAY,YAAyB,2BAAW;AAKhD,cAAY,eAA4B,2BAAW;AAOnD,cAAY,SAAsB,2BAAW;AAC7C,WAAS,WAAWF,IAAGsB,IAAG;AACtB,QAAI,SAAS,CAAA;AACb,aAAS,KAAK,GAAG,KAAK,OAAK;AACvB,UAAI,MAAM;AACV,UAAI,KAAKtB,GAAE,WAAW,MAAMsB,GAAE,UAAUA,GAAE,EAAE,KAAKtB,GAAE,EAAE,IAAI;AACrD,eAAOA,GAAE,IAAI;AACb,aAAKA,GAAE,IAAI;AAAA,MACd,WACQ,KAAKsB,GAAE,QAAQ;AACpB,eAAOA,GAAE,IAAI;AACb,aAAKA,GAAE,IAAI;AAAA,MACd;AAEG,eAAO;AACX,UAAI,CAAC,OAAO,UAAU,OAAO,OAAO,SAAS,CAAC,IAAI;AAC9C,eAAO,KAAK,MAAM,EAAE;AAAA,eACf,OAAO,OAAO,SAAS,CAAC,IAAI;AACjC,eAAO,OAAO,SAAS,CAAC,IAAI;AAAA,IACnC;AAAA,EACL;AACA,WAAS,iBAAiBtB,IAAGsB,IAAG,YAAY;AACxC,QAAIC;AACJ,QAAI,SAAS,SAAS;AACtB,QAAI,YAAY;AACZ,gBAAUD,GAAE;AACZ,gBAAU,UAAU,MAAMA,GAAE,QAAQ,MAAM;AAC1C,gBAAUtB,GAAE,QAAQ,QAAQsB,GAAE,OAAO;AAAA,IACxC,OACI;AACD,gBAAUA,GAAE,QAAQ,IAAItB,GAAE,OAAO;AACjC,gBAAUA,GAAE,QAAQ,QAAQsB,GAAE,SAAS,IAAI;AAC3C,gBAAUtB,GAAE,QAAQ,QAAQ,OAAO;AAAA,IACtC;AACD,WAAO;AAAA,MACH;AAAA,MACA,WAAWsB,GAAE,YAAYA,GAAE,UAAU,IAAI,OAAO,KAAKC,MAAKvB,GAAE,eAAe,QAAQuB,QAAO,SAAS,SAASA,IAAG,IAAI,OAAO;AAAA,MAC1H,SAAS,YAAY,WAAWvB,GAAE,SAAS,OAAO,EAAE,OAAO,YAAY,WAAWsB,GAAE,SAAS,OAAO,CAAC;AAAA,MACrG,aAAatB,GAAE,YAAY,SAASA,GAAE,YAAY,OAAOsB,GAAE,WAAW,IAAIA,GAAE;AAAA,MAC5E,gBAAgBtB,GAAE,kBAAkBsB,GAAE;AAAA,IAC9C;AAAA,EACA;AACA,WAAS,wBAAwB,OAAO,MAAM,SAAS;AACnD,QAAI,MAAM,KAAK,WAAW,cAAc,QAAQ,KAAK,WAAW;AAChE,QAAI,KAAK;AACL,oBAAc,YAAY,OAAO,YAAY,UAAU,GAAG,KAAK,SAAS,CAAC;AAC7E,WAAO;AAAA,MACH,SAAS,KAAK,mBAAmB,YAAY,KAAK,UAC5C,UAAU,GAAG,KAAK,WAAW,CAAA,GAAI,SAAS,MAAM,MAAM,aAAa,CAAC;AAAA,MAC1E,WAAW,QAAQ,eAAe,kBAAkB,MAAM,gBAAgB,OAAO,IAAI,QAAQ,IAAI,IAAI;AAAA,MACrG,SAAS,QAAQ,KAAK,OAAO;AAAA,MAC7B;AAAA,MACA,gBAAgB,CAAC,CAAC,KAAK;AAAA,IAC/B;AAAA,EACA;AACA,WAAS,mBAAmB,OAAO,OAAO,QAAQ;AAC9C,QAAIT,KAAI,wBAAwB,OAAO,MAAM,SAAS,MAAM,CAAC,IAAI,CAAA,GAAI,MAAM,IAAI,MAAM;AACrF,QAAI,MAAM,UAAU,MAAM,CAAC,EAAE,WAAW;AACpC,eAAS;AACb,aAASR,KAAI,GAAGA,KAAI,MAAM,QAAQA,MAAK;AACnC,UAAI,MAAMA,EAAC,EAAE,WAAW;AACpB,iBAAS;AACb,UAAI,MAAM,CAAC,CAAC,MAAMA,EAAC,EAAE;AACrB,MAAAQ,KAAI,iBAAiBA,IAAG,wBAAwB,OAAO,MAAMR,EAAC,GAAG,MAAMQ,GAAE,QAAQ,YAAY,MAAM,IAAI,MAAM,GAAG,GAAG;AAAA,IACtH;AACD,QAAI,KAAK,YAAY,OAAO,OAAOA,GAAE,SAASA,GAAE,WAAWA,GAAE,SAASA,GAAE,aAAaA,GAAE,cAAc;AACrG,WAAO,kBAAkB,SAAS,kBAAkB,EAAE,IAAI,EAAE;AAAA,EAChE;AAEA,WAAS,kBAAkB,IAAI;AAC3B,QAAI,QAAQ,GAAG;AAEf,QAAI,SAAS;AACb,aAAS,UAAU,MAAM,MAAM,YAAY,GAAG;AAC1C,UAAI,QAAQ,OAAO,EAAE;AACrB,UAAI,UAAU,OAAO;AACjB,iBAAS;AACT;AAAA,MACH;AACD,UAAI,MAAM,QAAQ,KAAK;AACnB,iBAAS,WAAW,OAAO,QAAQ,WAAW,QAAQ,KAAK;AAAA,IAClE;AACD,QAAI,WAAW,MAAM;AACjB,UAAI,SAAS;AACb,UAAI,WAAW,OAAO;AAClB,eAAO,GAAG,QAAQ;AAClB,kBAAU,UAAU,MAAM,MAAM,IAAI,MAAM;AAAA,MAC7C,OACI;AACD,YAAI,WAAW,GAAG,QAAQ,OAAO,MAAM;AACvC,kBAAU,SAAS;AACnB,eAAO,SAAS,SAAS,QAAQ,SAAS,OAAO,EAAE;AAAA,MACtD;AACD,WAAK,YAAY,OAAO,OAAO,SAAS,GAAG,aAAa,GAAG,UAAU,IAAI,IAAI,GAAG,YAAY,WAAW,GAAG,SAAS,IAAI,GAAG,GAAG,aAAa,GAAG,cAAc;AAAA,IAC9J;AAED,QAAI,UAAU,MAAM,MAAM,iBAAiB;AAC3C,aAASR,KAAI,QAAQ,SAAS,GAAGA,MAAK,GAAGA,MAAK;AAC1C,UAAI,WAAW,QAAQA,EAAC,EAAE,EAAE;AAC5B,UAAI,oBAAoB;AACpB,aAAK;AAAA,eACA,MAAM,QAAQ,QAAQ,KAAK,SAAS,UAAU,KAAK,SAAS,CAAC,aAAa;AAC/E,aAAK,SAAS,CAAC;AAAA;AAEf,aAAK,mBAAmB,OAAO,QAAQ,QAAQ,GAAG,KAAK;AAAA,IAC9D;AACD,WAAO;AAAA,EACX;AACA,WAAS,kBAAkB,IAAI;AAC3B,QAAI,QAAQ,GAAG,YAAY,YAAY,MAAM,MAAM,mBAAmB,GAAG,OAAO;AAChF,aAASA,KAAI,UAAU,SAAS,GAAGA,MAAK,GAAGA,MAAK;AAC5C,UAAI,YAAY,UAAUA,EAAC,EAAE,EAAE;AAC/B,UAAI,aAAa,OAAO,KAAK,SAAS,EAAE;AACpC,eAAO,iBAAiB,MAAM,wBAAwB,OAAO,WAAW,GAAG,QAAQ,SAAS,GAAG,IAAI;AAAA,IAC1G;AACD,WAAO,QAAQ,KAAK,KAAK,YAAY,OAAO,OAAO,GAAG,SAAS,GAAG,WAAW,KAAK,SAAS,KAAK,aAAa,KAAK,cAAc;AAAA,EACpI;AACA,QAAM8D,SAAO,CAAA;AACb,WAAS,QAAQ,OAAO;AACpB,WAAO,SAAS,OAAOA,SAAO,MAAM,QAAQ,KAAK,IAAI,QAAQ,CAAC,KAAK;AAAA,EACvE;AAOA,MAAI,eAA6B,yBAAUC,eAAc;AAIrD,IAAAA,cAAaA,cAAa,MAAM,IAAI,CAAC,IAAI;AAIzC,IAAAA,cAAaA,cAAa,OAAO,IAAI,CAAC,IAAI;AAI1C,IAAAA,cAAaA,cAAa,OAAO,IAAI,CAAC,IAAI;AAC9C,WAAOA;AAAA,EAAY,EAAG,iBAAiB,eAAe,CAAA,EAAG;AACzD,QAAM,6BAA6B;AACnC,MAAI;AACJ,MAAI;AACA,eAAwB,oBAAI,OAAO,iCAAiC,GAAG;AAAA,EAC3E,SACO1B,IAAG;AAAA,EAAG;AACb,WAAS,YAAY,KAAK;AACtB,QAAI;AACA,aAAO,SAAS,KAAK,GAAG;AAC5B,aAASrC,KAAI,GAAGA,KAAI,IAAI,QAAQA,MAAK;AACjC,UAAI,KAAK,IAAIA,EAAC;AACd,UAAI,KAAK,KAAK,EAAE,KAAK,KAAK,QAAW,GAAG,YAAW,KAAM,GAAG,YAAa,KAAI,2BAA2B,KAAK,EAAE;AAC3G,eAAO;AAAA,IACd;AACD,WAAO;AAAA,EACX;AACA,WAAS,gBAAgB,WAAW;AAChC,WAAO,CAAC,SAAS;AACb,UAAI,CAAC,KAAK,KAAK,IAAI;AACf,eAAO,aAAa;AACxB,UAAI,YAAY,IAAI;AAChB,eAAO,aAAa;AACxB,eAASA,KAAI,GAAGA,KAAI,UAAU,QAAQA;AAClC,YAAI,KAAK,QAAQ,UAAUA,EAAC,CAAC,IAAI;AAC7B,iBAAO,aAAa;AAC5B,aAAO,aAAa;AAAA,IAC5B;AAAA,EACA;AAAA,EAWA,MAAM,YAAY;AAAA,IACd,YAIA,QAIAyD,MAIA,WAIA,QAAQ,aAAa,IAAI;AACrB,WAAK,SAAS;AACd,WAAK,MAAMA;AACX,WAAK,YAAY;AACjB,WAAK,SAAS;AACd,WAAK,SAAS,OAAO,eAAe,MAAK;AACzC,WAAK,cAAc;AAGnB,UAAI;AACA,WAAG,SAAS;AAChB,eAASzD,KAAI,GAAGA,KAAI,KAAK,OAAO,aAAa,QAAQA;AACjD,mBAAW,MAAMA,MAAK,CAAC;AAC3B,WAAK,cAAc;AAAA,IACtB;AAAA,IACD,MAAM,OAAOgE,WAAU,MAAM;AACzB,UAAI,OAAO,KAAK,OAAO,QAAQ,MAAM,EAAE;AACvC,UAAI,QAAQ,MAAM;AACd,YAAIA;AACA,gBAAM,IAAI,WAAW,oCAAoC;AAC7D,eAAO;AAAA,MACV;AACD,iBAAW,MAAM,IAAI;AACrB,aAAO,QAAQ,MAAM,IAAI;AAAA,IAC5B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAgBD,UAAU,OAAO;AACb,aAAO,mBAAmB,MAAM,OAAO,IAAI;AAAA,IAC9C;AAAA;AAAA;AAAA;AAAA,IAID,iBAAiB,IAAI;AACjB,UAAI,OAAO,KAAK,QAAQ,EAAE,MAAAnC,OAAM,aAAc,IAAG;AACjD,eAAS,UAAU,GAAG,SAAS;AAC3B,YAAI,OAAO,GAAG,YAAY,WAAW,GAAG;AACpC,cAAI,MAAM;AACN,2BAAe,oBAAI;AACnB,iBAAK,aAAa,QAAQ,CAAC,KAAK,QAAQ,aAAa,IAAI,KAAK,GAAG,CAAC;AAClE,mBAAO;AAAA,UACV;AACD,uBAAa,IAAI,OAAO,MAAM,aAAa,OAAO,MAAM,SAAS;AAAA,QACpE,WACQ,OAAO,GAAG,YAAY,WAAW,GAAG;AACzC,iBAAO;AACP,UAAAA,QAAO,OAAO;AAAA,QACjB,WACQ,OAAO,GAAG,YAAY,YAAY,GAAG;AAC1C,iBAAO;AACP,UAAAA,QAAO,QAAQA,KAAI,EAAE,OAAO,OAAO,KAAK;AAAA,QAC3C;AAAA,MACJ;AACD,UAAI;AACJ,UAAI,CAAC,MAAM;AACP,eAAO,cAAc,QAAQA,OAAM,cAAc,IAAI;AACrD,YAAI,oBAAoB,IAAI,YAAY,MAAM,KAAK,KAAK,KAAK,WAAW,KAAK,aAAa,IAAI,MAAM,IAAI,GAAG,CAAC,OAAO,SAAS,KAAK,YAAY,OAAO,IAAI,GAAG,IAAI;AAC/J,sBAAc,kBAAkB;AAAA,MACnC,OACI;AACD,sBAAc,GAAG,WAAW,OAAO,MAAK;AAAA,MAC3C;AACD,UAAI,YAAY,MAAM,GAAG,QAAQ,GAAG,cAAc,aAAa,CAAC,OAAO,SAAS,KAAK,OAAO,OAAO,EAAE,GAAG,EAAE;AAAA,IAC7G;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,iBAAiB,MAAM;AACnB,UAAI,OAAO,QAAQ;AACf,eAAO,KAAK,OAAO,IAAI;AAC3B,aAAO,KAAK,cAAc,YAAU;AAAA,QAAE,SAAS,EAAE,MAAM,MAAM,MAAM,IAAI,MAAM,IAAI,QAAQ,KAAM;AAAA,QAC3F,OAAO,gBAAgB,OAAO,MAAM,OAAO,KAAK,MAAM;AAAA,MAAG,EAAC;AAAA,IACjE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAYD,cAAcK,IAAG;AACb,UAAI,MAAM,KAAK;AACf,UAAI,UAAUA,GAAE,IAAI,OAAO,CAAC,CAAC;AAC7B,UAAI,UAAU,KAAK,QAAQ,QAAQ,OAAO,GAAG,SAAS,CAAC,QAAQ,KAAK;AACpE,UAAI,UAAU,QAAQ,QAAQ,OAAO;AACrC,eAASlC,KAAI,GAAGA,KAAI,IAAI,OAAO,QAAQA,MAAK;AACxC,YAAI,SAASkC,GAAE,IAAI,OAAOlC,EAAC,CAAC;AAC5B,YAAI,aAAa,KAAK,QAAQ,OAAO,OAAO,GAAG,YAAY,WAAW,IAAI,OAAO;AACjF,iBAAS,IAAI,GAAG,IAAIA,IAAG;AACnB,iBAAO,CAAC,IAAI,OAAO,CAAC,EAAE,IAAI,SAAS;AACvC,YAAI,QAAQ,QAAQ,QAAQ,YAAY,IAAI;AAC5C,eAAO,KAAK,OAAO,MAAM,IAAI,KAAK,CAAC;AACnC,kBAAU,QAAQ,QAAQ,SAAS;AACnC,kBAAU,YAAY,WAAW,SAAS,SAAS,EAAE,OAAO,YAAY,WAAW,QAAQ,OAAO,OAAO,GAAG,KAAK,CAAC;AAAA,MACrH;AACD,aAAO;AAAA,QACH;AAAA,QACA,WAAW,gBAAgB,OAAO,QAAQ,IAAI,SAAS;AAAA,QACvD;AAAA,MACZ;AAAA,IACK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMD,QAAQ,OAAO,IAAI;AACf,UAAI,gBAAgB;AAChB,eAAO;AACX,aAAO,UAAU,GAAG,MAAM,KAAK,IAAI,QAAQ,KAAK,MAAM,YAAY,aAAa,CAAC;AAAA,IACnF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMD,OAAOoC,SAAQ;AACX,aAAO,KAAK,GAAGA,QAAO,MAAM,KAAK,MAAM,YAAY,aAAa,KAAK,YAAY,CAAC;AAAA,IACrF;AAAA;AAAA;AAAA;AAAA,IAID,SAAS,OAAO,GAAG,KAAK,KAAK,IAAI,QAAQ;AACrC,aAAO,KAAK,IAAI,YAAY,MAAM,IAAI,KAAK,SAAS;AAAA,IACvD;AAAA;AAAA;AAAA;AAAA,IAID,MAAM,OAAO;AACT,UAAI,OAAO,KAAK,OAAO,QAAQ,MAAM,EAAE;AACvC,UAAI,QAAQ;AACR,eAAO,MAAM;AACjB,iBAAW,MAAM,IAAI;AACrB,aAAO,QAAQ,MAAM,IAAI;AAAA,IAC5B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOD,OAAO,QAAQ;AACX,UAAI,SAAS;AAAA,QACT,KAAK,KAAK,SAAU;AAAA,QACpB,WAAW,KAAK,UAAU,OAAQ;AAAA,MAC9C;AACQ,UAAI;AACA,iBAAS,QAAQ,QAAQ;AACrB,cAAI,QAAQ,OAAO,IAAI;AACvB,cAAI,iBAAiB,cAAc,KAAK,OAAO,QAAQ,MAAM,EAAE,KAAK;AAChE,mBAAO,IAAI,IAAI,MAAM,KAAK,OAAO,KAAK,MAAM,OAAO,IAAI,CAAC,GAAG,IAAI;AAAA,QACtE;AACL,aAAO;AAAA,IACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOD,OAAO,SAAS,MAAM,SAAS,CAAA,GAAI,QAAQ;AACvC,UAAI,CAAC,QAAQ,OAAO,KAAK,OAAO;AAC5B,cAAM,IAAI,WAAW,6CAA6C;AACtE,UAAI,YAAY,CAAA;AAChB,UAAI;AACA,iBAAS,QAAQ,QAAQ;AACrB,cAAI,OAAO,UAAU,eAAe,KAAK,MAAM,IAAI,GAAG;AAClD,gBAAI,QAAQ,OAAO,IAAI,GAAG,QAAQ,KAAK,IAAI;AAC3C,sBAAU,KAAK,MAAM,KAAK,WAAS,MAAM,KAAK,SAAS,OAAO,KAAK,CAAC,CAAC;AAAA,UACxE;AAAA,QACJ;AACL,aAAO,YAAY,OAAO;AAAA,QACtB,KAAK,KAAK;AAAA,QACV,WAAW,gBAAgB,SAAS,KAAK,SAAS;AAAA,QAClD,YAAY,OAAO,aAAa,UAAU,OAAO,CAAC,OAAO,UAAU,CAAC,IAAI;AAAA,MACpF,CAAS;AAAA,IACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMD,OAAO,OAAO,SAAS,IAAI;AACvB,UAAI,gBAAgB,cAAc,QAAQ,OAAO,cAAc,CAAE,GAAE,oBAAI,KAAG;AAC1E,UAAIqB,OAAM,OAAO,eAAe,OAAO,OAAO,MACxC,KAAK,IAAI,OAAO,OAAO,IAAI,MAAM,cAAc,YAAY,YAAY,aAAa,KAAK,YAAY,CAAC;AAC5G,UAAI,YAAY,CAAC,OAAO,YAAY,gBAAgB,OAAO,CAAC,IACtD,OAAO,qBAAqB,kBAAkB,OAAO,YACjD,gBAAgB,OAAO,OAAO,UAAU,QAAQ,OAAO,UAAU,IAAI;AAC/E,qBAAe,WAAWA,KAAI,MAAM;AACpC,UAAI,CAAC,cAAc,YAAY,uBAAuB;AAClD,oBAAY,UAAU;AAC1B,aAAO,IAAI,YAAY,eAAeA,MAAK,WAAW,cAAc,aAAa,IAAI,MAAM,IAAI,GAAG,CAAC,OAAO,SAAS,KAAK,OAAO,KAAK,GAAG,IAAI;AAAA,IAC9I;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,IAAI,UAAU;AAAE,aAAO,KAAK,MAAM,YAAY,OAAO;AAAA,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA,IAKzD,IAAI,YAAY;AAAE,aAAO,KAAK,MAAM,YAAY,aAAa,KAAK;AAAA,IAAO;AAAA;AAAA;AAAA;AAAA;AAAA,IAKzE,IAAI,WAAW;AAAE,aAAO,KAAK,MAAMG,UAAQ;AAAA,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAW/C,OAAO,WAAWhB,SAAQ;AACtB,eAAS,OAAO,KAAK,MAAM,YAAY,OAAO;AAC1C,YAAI,OAAO,UAAU,eAAe,KAAK,KAAK,MAAM,GAAG;AACnD,mBAAS,IAAI,MAAM;AACnB;AAAA,QACH;AACL,UAAIA,QAAO;AACP,iBAAS,OAAO,QAAQ,eAAe,CAACK,IAAGjD,OAAM;AAC7C,cAAIA,MAAK;AACL,mBAAO;AACX,cAAIG,KAAI,EAAEH,MAAK;AACf,iBAAO,CAACG,MAAKA,KAAIyC,QAAO,SAASK,KAAIL,QAAOzC,KAAI,CAAC;AAAA,QACjE,CAAa;AACL,aAAO;AAAA,IACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAiBD,eAAeG,OAAM,KAAK,OAAO,IAAI;AACjC,UAAI,SAAS,CAAA;AACb,eAAS,YAAY,KAAK,MAAM,YAAY,GAAG;AAC3C,iBAAS,UAAU,SAAS,MAAM,KAAK,IAAI,GAAG;AAC1C,cAAI,OAAO,UAAU,eAAe,KAAK,QAAQA,KAAI;AACjD,mBAAO,KAAK,OAAOA,KAAI,CAAC;AAAA,QAC/B;AAAA,MACJ;AACD,aAAO;AAAA,IACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAYD,gBAAgB,IAAI;AAChB,aAAO,gBAAgB,KAAK,eAAe,aAAa,EAAE,EAAE,KAAK,EAAE,CAAC;AAAA,IACvE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOD,OAAO,KAAK;AACR,UAAI,EAAE,MAAM,MAAM,OAAM,IAAK,KAAK,IAAI,OAAO,GAAG;AAChD,UAAI,MAAM,KAAK,gBAAgB,GAAG;AAClC,UAAI,QAAQ,MAAM,MAAM,MAAM,MAAM;AACpC,aAAO,QAAQ,GAAG;AACd,YAAI,OAAO,iBAAiB,MAAM,OAAO,KAAK;AAC9C,YAAI,IAAI,KAAK,MAAM,MAAM,KAAK,CAAC,KAAK,aAAa;AAC7C;AACJ,gBAAQ;AAAA,MACX;AACD,aAAO,MAAM,QAAQ;AACjB,YAAI,OAAO,iBAAiB,MAAM,GAAG;AACrC,YAAI,IAAI,KAAK,MAAM,KAAK,IAAI,CAAC,KAAK,aAAa;AAC3C;AACJ,cAAM;AAAA,MACT;AACD,aAAO,SAAS,MAAM,OAAO,gBAAgB,MAAM,QAAQ,MAAM,MAAM,IAAI;AAAA,IAC9E;AAAA,EACL;AASA,cAAY,0BAA0B;AAMtC,cAAY,UAAuB,sBAAM,OAAO;AAAA,IAC5C,SAAS,YAAU,OAAO,SAAS,OAAO,CAAC,IAAI;AAAA,EACnD,CAAC;AAUD,cAAY,gBAAgB;AAc5B,cAAY,WAAWsD;AAOvB,cAAY,UAAuB,sBAAM,OAAO;AAAA,IAC5C,QAAQjE,IAAGsB,IAAG;AACV,UAAI,KAAK,OAAO,KAAKtB,EAAC,GAAG,KAAK,OAAO,KAAKsB,EAAC;AAC3C,aAAO,GAAG,UAAU,GAAG,UAAU,GAAG,MAAM,OAAKtB,GAAE,CAAC,KAAKsB,GAAE,CAAC,CAAC;AAAA,IAC9D;AAAA,EACL,CAAC;AAKD,cAAY,eAAe;AAe3B,cAAY,eAAe;AAoB3B,cAAY,oBAAoB;AAchC,cAAY,sBAAsB;AAClC,cAAY,cAA2B,4BAAY;AAWnD,WAAS,cAAc,SAAS,UAChC,UAAU,IAAI;AACV,QAAI,SAAS,CAAA;AACb,aAAS,UAAU;AACf,eAAS,OAAO,OAAO,KAAK,MAAM,GAAG;AACjC,YAAI,QAAQ,OAAO,GAAG,GAAG,UAAU,OAAO,GAAG;AAC7C,YAAI,YAAY;AACZ,iBAAO,GAAG,IAAI;AAAA,iBACT,YAAY,SAAS,UAAU;AAAW;AAAA,iBAC1C,OAAO,eAAe,KAAK,SAAS,GAAG;AAC5C,iBAAO,GAAG,IAAI,QAAQ,GAAG,EAAE,SAAS,KAAK;AAAA;AAEzC,gBAAM,IAAI,MAAM,qCAAqC,GAAG;AAAA,MAC/D;AACL,aAAS,OAAO;AACZ,UAAI,OAAO,GAAG,MAAM;AAChB,eAAO,GAAG,IAAI,SAAS,GAAG;AAClC,WAAO;AAAA,EACX;AAAA,EAMA,MAAM,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQb,GAAG,OAAO;AAAE,aAAO,QAAQ;AAAA,IAAQ;AAAA;AAAA;AAAA;AAAA,IAInC,MAAM,MAAM,KAAK,MAAM;AAAE,aAAO,MAAM,OAAO,MAAM,IAAI,IAAI;AAAA,IAAI;AAAA,EACnE;AACA,aAAW,UAAU,YAAY,WAAW,UAAU,UAAU;AAChE,aAAW,UAAU,QAAQ;AAC7B,aAAW,UAAU,UAAU,QAAQ;AAAA,EAIvC,MAAM,MAAM;AAAA,IACR,YAIA,MAIA,IAIA,OAAO;AACH,WAAK,OAAO;AACZ,WAAK,KAAK;AACV,WAAK,QAAQ;AAAA,IAChB;AAAA;AAAA;AAAA;AAAA,IAID,OAAO,OAAO,MAAM,IAAI,OAAO;AAC3B,aAAO,IAAI,MAAM,MAAM,IAAI,KAAK;AAAA,IACnC;AAAA,EACL;AACA,WAAS,SAAStB,IAAGsB,IAAG;AACpB,WAAOtB,GAAE,OAAOsB,GAAE,QAAQtB,GAAE,MAAM,YAAYsB,GAAE,MAAM;AAAA,EAC1D;AAAA,EACA,MAAM,MAAM;AAAA,IACR,YAAY,MAAM,IAAI,OAKtB,UAAU;AACN,WAAK,OAAO;AACZ,WAAK,KAAK;AACV,WAAK,QAAQ;AACb,WAAK,WAAW;AAAA,IACnB;AAAA,IACD,IAAI,SAAS;AAAE,aAAO,KAAK,GAAG,KAAK,GAAG,SAAS,CAAC;AAAA,IAAI;AAAA;AAAA;AAAA,IAGpD,UAAU,KAAK,MAAM,KAAK,UAAU,GAAG;AACnC,UAAI,MAAM,MAAM,KAAK,KAAK,KAAK;AAC/B,eAAS,KAAK,SAAS,KAAK,IAAI,YAAU;AACtC,YAAI,MAAM;AACN,iBAAO;AACX,YAAI,MAAO,KAAK,MAAO;AACvB,YAAI,OAAO,IAAI,GAAG,IAAI,QAAQ,MAAM,KAAK,MAAM,GAAG,EAAE,UAAU,KAAK,MAAM,GAAG,EAAE,aAAa;AAC3F,YAAI,OAAO;AACP,iBAAO,QAAQ,IAAI,KAAK;AAC5B,YAAI,QAAQ;AACR,eAAK;AAAA;AAEL,eAAK,MAAM;AAAA,MAClB;AAAA,IACJ;AAAA,IACD,QAAQ,QAAQ,MAAM,IAAIiB,IAAG;AACzB,eAASlC,KAAI,KAAK,UAAU,MAAM,MAAyB,IAAI,GAAGH,KAAI,KAAK,UAAU,IAAI,KAAwB,OAAOG,EAAC,GAAGA,KAAIH,IAAGG;AAC/H,YAAIkC,GAAE,KAAK,KAAKlC,EAAC,IAAI,QAAQ,KAAK,GAAGA,EAAC,IAAI,QAAQ,KAAK,MAAMA,EAAC,CAAC,MAAM;AACjE,iBAAO;AAAA,IAClB;AAAA,IACD,IAAI,QAAQ,SAAS;AACjB,UAAI,QAAQ,CAAA,GAAI,OAAO,CAAE,GAAE,KAAK,IAAI,SAAS,IAAI,WAAW;AAC5D,eAASA,KAAI,GAAGA,KAAI,KAAK,MAAM,QAAQA,MAAK;AACxC,YAAI,MAAM,KAAK,MAAMA,EAAC,GAAG,UAAU,KAAK,KAAKA,EAAC,IAAI,QAAQ,QAAQ,KAAK,GAAGA,EAAC,IAAI,QAAQ,SAAS;AAChG,YAAI,WAAW,OAAO;AAClB,cAAI,SAAS,QAAQ,OAAO,SAAS,IAAI,WAAW,IAAI,OAAO;AAC/D,cAAI,UAAU;AACV;AACJ,oBAAU,QAAQ;AAClB,cAAI,IAAI,aAAa,IAAI,SAAS;AAC9B,oBAAQ,QAAQ,OAAO,SAAS,IAAI,OAAO;AAC3C,gBAAI,QAAQ;AACR;AAAA,UACP;AAAA,QACJ,OACI;AACD,oBAAU,QAAQ,OAAO,SAAS,IAAI,SAAS;AAC/C,kBAAQ,QAAQ,OAAO,OAAO,IAAI,OAAO;AACzC,cAAI,UAAU,SAAS,WAAW,SAAS,IAAI,YAAY,KAAK,IAAI,WAAW;AAC3E;AAAA,QACP;AACD,aAAK,QAAQ,WAAW,IAAI,UAAU,IAAI,aAAa;AACnD;AACJ,YAAI,SAAS;AACT,mBAAS;AACb,YAAI,IAAI;AACJ,qBAAW,KAAK,IAAI,UAAU,QAAQ,OAAO;AACjD,cAAM,KAAK,GAAG;AACd,aAAK,KAAK,UAAU,MAAM;AAC1B,WAAG,KAAK,QAAQ,MAAM;AAAA,MACzB;AACD,aAAO,EAAE,QAAQ,MAAM,SAAS,IAAI,MAAM,MAAM,IAAI,OAAO,QAAQ,IAAI,MAAM,KAAK,OAAM;AAAA,IAC3F;AAAA,EACL;AAAA,EAOA,MAAM,SAAS;AAAA,IACX,YAIA,UAIA,OAIA,WAIA,UAAU;AACN,WAAK,WAAW;AAChB,WAAK,QAAQ;AACb,WAAK,YAAY;AACjB,WAAK,WAAW;AAAA,IACnB;AAAA;AAAA;AAAA;AAAA,IAID,OAAO,OAAO,UAAU,OAAO,WAAW,UAAU;AAChD,aAAO,IAAI,SAAS,UAAU,OAAO,WAAW,QAAQ;AAAA,IAC3D;AAAA;AAAA;AAAA;AAAA,IAID,IAAI,SAAS;AACT,UAAI,OAAO,KAAK,MAAM,SAAS;AAC/B,aAAO,OAAO,IAAI,IAAI,KAAK,IAAI,KAAK,SAAS,IAAI,GAAG,KAAK,UAAU,MAAM;AAAA,IAC5E;AAAA;AAAA;AAAA;AAAA,IAID,IAAI,OAAO;AACP,UAAI,KAAK;AACL,eAAO;AACX,UAAI,OAAO,KAAK,UAAU;AAC1B,eAAS,SAAS,KAAK;AACnB,gBAAQ,MAAM,MAAM;AACxB,aAAO;AAAA,IACV;AAAA;AAAA;AAAA;AAAA,IAID,SAASC,QAAO;AACZ,aAAO,KAAK,SAASA,MAAK,IAAI,KAAK,MAAMA,MAAK,EAAE;AAAA,IACnD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAUD,OAAO,YAAY;AACf,UAAI,EAAE,MAAM,IAAI,OAAO,OAAO,aAAa,GAAG,WAAW,KAAK,OAAM,IAAK;AACzE,UAAI,SAAS,WAAW;AACxB,UAAI,IAAI,UAAU,KAAK,CAAC;AACpB,eAAO;AACX,UAAI;AACA,cAAM,IAAI,MAAO,EAAC,KAAK,QAAQ;AACnC,UAAI,KAAK;AACL,eAAO,IAAI,SAAS,SAAS,GAAG,GAAG,IAAI;AAC3C,UAAI,MAAM,IAAI,YAAY,MAAM,MAAM,EAAE,EAAE,KAAK,CAAC,GAAGD,KAAI,GAAG,QAAQ,CAAA;AAClE,UAAI,UAAU,IAAI;AAClB,aAAO,IAAI,SAASA,KAAI,IAAI,QAAQ;AAChC,YAAIA,KAAI,IAAI,WAAW,IAAI,OAAO,IAAIA,EAAC,EAAE,QAAQ,IAAI,YAAY,IAAIA,EAAC,EAAE,MAAM,cAAc,GAAG;AAC3F,cAAI,QAAQ,IAAIA,IAAG;AACnB,cAAI,CAAC,QAAQ,SAAS,MAAM,MAAM,MAAM,IAAI,MAAM,KAAK;AACnD,kBAAM,KAAK,KAAK;AAAA,QACvB,WACQ,IAAI,cAAc,KAAK,IAAI,aAAa,KAAK,MAAM,WACvDA,MAAK,IAAI,UAAU,KAAK,SAAS,IAAI,UAAU,IAAI,IAAIA,EAAC,EAAE,UAC1D,CAAC,UAAU,aAAa,KAAK,SAAS,IAAI,UAAU,KAAK,WAAW,KAAK,SAAS,IAAI,UAAU,MACjG,QAAQ,SAAS,KAAK,SAAS,IAAI,UAAU,GAAG,KAAK,MAAM,IAAI,UAAU,CAAC,GAAG;AAC7E,cAAI,UAAS;AAAA,QAChB,OACI;AACD,cAAI,CAAC,UAAU,aAAa,IAAI,MAAM,WAAW,IAAI,QAAQ,OAAO,IAAI,MAAM,IAAI,IAAI,IAAI,KAAK,GAAG;AAC9F,gBAAI,CAAC,QAAQ,SAAS,IAAI,MAAM,IAAI,IAAI,IAAI,KAAK;AAC7C,oBAAM,KAAK,MAAM,OAAO,IAAI,MAAM,IAAI,IAAI,IAAI,KAAK,CAAC;AAAA,UAC3D;AACD,cAAI,KAAI;AAAA,QACX;AAAA,MACJ;AACD,aAAO,QAAQ,YAAY,KAAK,UAAU,WAAW,CAAC,MAAM,SAAS,SAAS,QACxE,KAAK,UAAU,OAAO,EAAE,KAAK,OAAO,QAAQ,YAAY,SAAU,CAAA,CAAC;AAAA,IAC5E;AAAA;AAAA;AAAA;AAAA,IAID,IAAI,SAAS;AACT,UAAI,QAAQ,SAAS,KAAK;AACtB,eAAO;AACX,UAAI,SAAS,CAAA,GAAI,WAAW,CAAA,GAAI,WAAW;AAC3C,eAASA,KAAI,GAAGA,KAAI,KAAK,MAAM,QAAQA,MAAK;AACxC,YAAI,QAAQ,KAAK,SAASA,EAAC,GAAG,QAAQ,KAAK,MAAMA,EAAC;AAClD,YAAI,QAAQ,QAAQ,aAAa,OAAO,QAAQ,MAAM,MAAM;AAC5D,YAAI,UAAU,OAAO;AACjB,qBAAW,KAAK,IAAI,UAAU,MAAM,QAAQ;AAC5C,iBAAO,KAAK,KAAK;AACjB,mBAAS,KAAK,QAAQ,OAAO,KAAK,CAAC;AAAA,QACtC,WACQ,UAAU,MAAM;AACrB,cAAI,EAAE,QAAQ,IAAK,IAAG,MAAM,IAAI,OAAO,OAAO;AAC9C,cAAI,QAAQ;AACR,uBAAW,KAAK,IAAI,UAAU,OAAO,QAAQ;AAC7C,mBAAO,KAAK,MAAM;AAClB,qBAAS,KAAK,GAAG;AAAA,UACpB;AAAA,QACJ;AAAA,MACJ;AACD,UAAI,OAAO,KAAK,UAAU,IAAI,OAAO;AACrC,aAAO,OAAO,UAAU,IAAI,OAAO,IAAI,SAAS,UAAU,QAAQ,QAAQ,SAAS,OAAO,QAAQ;AAAA,IACrG;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOD,QAAQ,MAAM,IAAIkC,IAAG;AACjB,UAAI,KAAK;AACL;AACJ,eAASlC,KAAI,GAAGA,KAAI,KAAK,MAAM,QAAQA,MAAK;AACxC,YAAI,QAAQ,KAAK,SAASA,EAAC,GAAG,QAAQ,KAAK,MAAMA,EAAC;AAClD,YAAI,MAAM,SAAS,QAAQ,QAAQ,MAAM,UACrC,MAAM,QAAQ,OAAO,OAAO,OAAO,KAAK,OAAOkC,EAAC,MAAM;AACtD;AAAA,MACP;AACD,WAAK,UAAU,QAAQ,MAAM,IAAIA,EAAC;AAAA,IACrC;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,KAAK,OAAO,GAAG;AACX,aAAO,WAAW,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,IAAI;AAAA,IAC3C;AAAA;AAAA;AAAA;AAAA,IAID,IAAI,UAAU;AAAE,aAAO,KAAK,aAAa;AAAA,IAAO;AAAA;AAAA;AAAA;AAAA;AAAA,IAKhD,OAAO,KAAK,MAAM,OAAO,GAAG;AACxB,aAAO,WAAW,KAAK,IAAI,EAAE,KAAK,IAAI;AAAA,IACzC;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,OAAO,QAAQ,SAAS,SAKxB,UAAU,YAKV,eAAe,IAAI;AACf,UAAIvC,KAAI,QAAQ,OAAO,SAAO,IAAI,WAAW,KAAK,CAAC,IAAI,WAAW,IAAI,YAAY,YAAY;AAC9F,UAAIsB,KAAI,QAAQ,OAAO,SAAO,IAAI,WAAW,KAAK,CAAC,IAAI,WAAW,IAAI,YAAY,YAAY;AAC9F,UAAI,eAAe,iBAAiBtB,IAAGsB,IAAG,QAAQ;AAClD,UAAI,QAAQ,IAAI,WAAWtB,IAAG,cAAc,YAAY;AACxD,UAAI,QAAQ,IAAI,WAAWsB,IAAG,cAAc,YAAY;AACxD,eAAS,SAAS,CAAC,OAAO,OAAO,WAAW,QAAQ,OAAO,OAAO,OAAO,OAAO,QAAQ,UAAU,CAAC;AACnG,UAAI,SAAS,SAAS,SAAS,UAAU;AACrC,gBAAQ,OAAO,GAAG,OAAO,GAAG,GAAG,UAAU;AAAA,IAChD;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,OAAO,GAAG,SAAS,SAAS,OAAO,GAAG,IAAI;AACtC,UAAI,MAAM;AACN,aAAK,MAAyB;AAClC,UAAItB,KAAI,QAAQ,OAAO,SAAO,CAAC,IAAI,WAAW,QAAQ,QAAQ,GAAG,IAAI,CAAC;AACtE,UAAIsB,KAAI,QAAQ,OAAO,SAAO,CAAC,IAAI,WAAW,QAAQ,QAAQ,GAAG,IAAI,CAAC;AACtE,UAAItB,GAAE,UAAUsB,GAAE;AACd,eAAO;AACX,UAAI,CAACtB,GAAE;AACH,eAAO;AACX,UAAI,eAAe,iBAAiBA,IAAGsB,EAAC;AACxC,UAAI,QAAQ,IAAI,WAAWtB,IAAG,cAAc,CAAC,EAAE,KAAK,IAAI,GAAG,QAAQ,IAAI,WAAWsB,IAAG,cAAc,CAAC,EAAE,KAAK,IAAI;AAC/G,iBAAS;AACL,YAAI,MAAM,MAAM,MAAM,MAClB,CAAC,WAAW,MAAM,QAAQ,MAAM,MAAM,KACtC,MAAM,UAAU,CAAC,MAAM,SAAS,CAAC,MAAM,MAAM,GAAG,MAAM,KAAK;AAC3D,iBAAO;AACX,YAAI,MAAM,KAAK;AACX,iBAAO;AACX,cAAM,KAAI;AACV,cAAM,KAAI;AAAA,MACb;AAAA,IACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQD,OAAO,MAAM,MAAM,MAAM,IAAI,UAK7B,eAAe,IAAI;AACf,UAAI,SAAS,IAAI,WAAW,MAAM,MAAM,YAAY,EAAE,KAAK,IAAI,GAAG,MAAM;AACxE,UAAI,aAAa,OAAO;AACxB,iBAAS;AACL,YAAI,QAAQ,KAAK,IAAI,OAAO,IAAI,EAAE;AAClC,YAAI,OAAO,OAAO;AACd,cAAI,SAAS,OAAO,eAAe,OAAO,EAAE;AAC5C,cAAI,YAAY,OAAO,YAAY,OAAO,OAAO,SAAS,IAAI,KAAK,IAAI,OAAO,QAAQ,UAAU;AAChG,mBAAS,MAAM,KAAK,OAAO,OAAO,OAAO,QAAQ,WAAW,OAAO,SAAS;AAC5E,uBAAa,KAAK,IAAI,OAAO,QAAQ,KAAK,GAAG,OAAO,MAAM;AAAA,QAC7D,WACQ,QAAQ,KAAK;AAClB,mBAAS,KAAK,KAAK,OAAO,OAAO,QAAQ,UAAU;AACnD,uBAAa,OAAO,QAAQ,KAAK;AAAA,QACpC;AACD,YAAI,OAAO,KAAK;AACZ,iBAAO,cAAc,OAAO,SAAS,OAAO,KAAK,KAAK,IAAI;AAC9D,cAAM,OAAO;AACb,eAAO,KAAI;AAAA,MACd;AAAA,IACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQD,OAAO,GAAG,QAAQ,OAAO,OAAO;AAC5B,UAAI,QAAQ,IAAI;AAChB,eAAS,SAAS,kBAAkB,QAAQ,CAAC,MAAM,IAAI,OAAO,SAAS,MAAM,IAAI;AAC7E,cAAM,IAAI,MAAM,MAAM,MAAM,IAAI,MAAM,KAAK;AAC/C,aAAO,MAAM;IAChB;AAAA,EACL;AAIA,WAAS,QAAqB,oBAAI,SAAS,CAAA,GAAI,CAAA,GAAI,MAAM,EAAE;AAC3D,WAAS,SAAS,QAAQ;AACtB,QAAI,OAAO,SAAS;AAChB,eAAS,OAAO,OAAO,CAAC,GAAGjB,KAAI,GAAGA,KAAI,OAAO,QAAQA,MAAK;AACtD,YAAI,MAAM,OAAOA,EAAC;AAClB,YAAI,SAAS,MAAM,GAAG,IAAI;AACtB,iBAAO,OAAO,MAAK,EAAG,KAAK,QAAQ;AACvC,eAAO;AAAA,MACV;AACL,WAAO;AAAA,EACX;AACA,WAAS,MAAM,YAAY,SAAS;AAAA,EAMpC,MAAM,gBAAgB;AAAA,IAClB,YAAY,WAAW;AACnB,WAAK,OAAO,KAAK,IAAI,MAAM,KAAK,MAAM,KAAK,IAAI,KAAK,OAAO,KAAK,QAAQ,CAAC;AACzE,WAAK,SAAS,KAAK,KAAK,UAAU;AAClC,WAAK,aAAa;AAClB,WAAK,cAAc,KAAK,IAAI,KAAK,aAAa,KAAK,QAAQ;AAC3D,WAAK,WAAW;AAChB,UAAI,WAAW;AACX,aAAK,OAAO;AACZ,aAAK,KAAK;AACV,aAAK,QAAQ;MAChB;AAAA,IACJ;AAAA;AAAA;AAAA;AAAA,IAID,cAAc;AACV,WAAK,SAAS;AACd,WAAK,WAAW;AAChB,WAAK,aAAa;AAClB,WAAK,OAAO;AACZ,WAAK,WAAW;AAChB,WAAK,SAAS;AACd,WAAK,OAAO;AACZ,WAAK,KAAK;AACV,WAAK,QAAQ;AACb,WAAK,WAAW;AAChB,WAAK,cAAc;AACnB,WAAK,YAAY;AAAA,IACpB;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,IAAI,MAAM,IAAI,OAAO;AACjB,UAAI,CAAC,KAAK,SAAS,MAAM,IAAI,KAAK;AAC9B,SAAC,KAAK,cAAc,KAAK,YAAY,IAAI,oBAAkB,IAAI,MAAM,IAAI,KAAK;AAAA,IACrF;AAAA;AAAA;AAAA;AAAA,IAID,SAAS,MAAM,IAAI,OAAO;AACtB,UAAI,OAAO,OAAO,KAAK,UAAU,MAAM,YAAY,KAAK,KAAK;AAC7D,UAAI,QAAQ,MAAM,OAAO,KAAK,YAAY,MAAM,YAAY,KAAK,KAAK,aAAa;AAC/E,cAAM,IAAI,MAAM,gEAAgE;AACpF,UAAI,OAAO;AACP,eAAO;AACX,UAAI,KAAK,KAAK,UAAU;AACpB,aAAK,YAAY,IAAI;AACzB,UAAI,KAAK,aAAa;AAClB,aAAK,aAAa;AACtB,WAAK,KAAK,KAAK,OAAO,KAAK,UAAU;AACrC,WAAK,GAAG,KAAK,KAAK,KAAK,UAAU;AACjC,WAAK,OAAO;AACZ,WAAK,WAAW;AAChB,WAAK,SAAS;AACd,WAAK,MAAM,KAAK,KAAK;AACrB,UAAI,MAAM;AACN,aAAK,WAAW,KAAK,IAAI,KAAK,UAAU,KAAK,IAAI;AACrD,aAAO;AAAA,IACV;AAAA;AAAA;AAAA;AAAA,IAID,SAAS,MAAM,OAAO;AAClB,WAAK,OAAO,KAAK,UAAU,MAAM,MAAM,CAAC,EAAE,YAAY,KAAK,KAAK,WAAW;AACvE,eAAO;AACX,UAAI,KAAK,KAAK;AACV,aAAK,YAAY,IAAI;AACzB,WAAK,cAAc,KAAK,IAAI,KAAK,aAAa,MAAM,QAAQ;AAC5D,WAAK,OAAO,KAAK,KAAK;AACtB,WAAK,SAAS,KAAK,IAAI;AACvB,UAAI,OAAO,MAAM,MAAM,SAAS;AAChC,WAAK,OAAO,MAAM,MAAM,IAAI;AAC5B,WAAK,WAAW,MAAM,KAAK,IAAI,IAAI;AACnC,WAAK,SAAS,MAAM,GAAG,IAAI,IAAI;AAC/B,aAAO;AAAA,IACV;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,SAAS;AAAE,aAAO,KAAK,YAAY,SAAS,KAAK;AAAA,IAAI;AAAA;AAAA;AAAA;AAAA,IAIrD,YAAY,MAAM;AACd,UAAI,KAAK,KAAK;AACV,aAAK,YAAY,KAAK;AAC1B,UAAI,KAAK,OAAO,UAAU;AACtB,eAAO;AACX,UAAI,SAAS,SAAS,OAAO,KAAK,UAAU,KAAK,QAAQ,KAAK,YAAY,KAAK,UAAU,YAAY,IAAI,IAAI,MAAM,KAAK,WAAW;AACnI,WAAK,OAAO;AACZ,aAAO;AAAA,IACV;AAAA,EACL;AACA,WAAS,iBAAiBL,IAAGsB,IAAG,UAAU;AACtC,QAAI,MAAM,oBAAI;AACd,aAAS,OAAOtB;AACZ,eAASK,KAAI,GAAGA,KAAI,IAAI,MAAM,QAAQA;AAClC,YAAI,IAAI,MAAMA,EAAC,EAAE,YAAY;AACzB,cAAI,IAAI,IAAI,MAAMA,EAAC,GAAG,IAAI,SAASA,EAAC,CAAC;AACjD,QAAI,SAAS,oBAAI;AACjB,aAAS,OAAOiB;AACZ,eAASjB,KAAI,GAAGA,KAAI,IAAI,MAAM,QAAQA,MAAK;AACvC,YAAI,QAAQ,IAAI,IAAI,IAAI,MAAMA,EAAC,CAAC;AAChC,YAAI,SAAS,SAAS,WAAW,SAAS,OAAO,KAAK,IAAI,UAAU,IAAI,SAASA,EAAC,KAC9E,EAAE,aAAa,QAAQ,aAAa,SAAS,SAAS,SAAS,aAAa,OAAO,QAAQ,IAAI,MAAMA,EAAC,EAAE,MAAM;AAC9G,iBAAO,IAAI,IAAI,MAAMA,EAAC,CAAC;AAAA,MAC9B;AACL,WAAO;AAAA,EACX;AAAA,EACA,MAAM,YAAY;AAAA,IACd,YAAYiE,QAAO,MAAM,UAAU,OAAO,GAAG;AACzC,WAAK,QAAQA;AACb,WAAK,OAAO;AACZ,WAAK,WAAW;AAChB,WAAK,OAAO;AAAA,IACf;AAAA,IACD,IAAI,YAAY;AAAE,aAAO,KAAK,QAAQ,KAAK,MAAM,YAAY;AAAA,IAAI;AAAA,IACjE,IAAI,UAAU;AAAE,aAAO,KAAK,QAAQ,KAAK,MAAM,UAAU;AAAA,IAAI;AAAA,IAC7D,KAAK,KAAK,OAAO,MAAyB;AACtC,WAAK,aAAa,KAAK,aAAa;AACpC,WAAK,UAAU,KAAK,MAAM,KAAK;AAC/B,aAAO;AAAA,IACV;AAAA,IACD,UAAU,KAAK,MAAM,SAAS;AAC1B,aAAO,KAAK,aAAa,KAAK,MAAM,MAAM,QAAQ;AAC9C,YAAI,OAAO,KAAK,MAAM,MAAM,KAAK,UAAU;AAC3C,YAAI,EAAE,KAAK,QAAQ,KAAK,KAAK,IAAI,IAAI,KACjC,KAAK,MAAM,SAAS,KAAK,UAAU,IAAI,OACvC,KAAK,WAAW,KAAK;AACrB;AACJ,aAAK;AACL,kBAAU;AAAA,MACb;AACD,UAAI,KAAK,aAAa,KAAK,MAAM,MAAM,QAAQ;AAC3C,YAAI,aAAa,KAAK,MAAM,MAAM,KAAK,UAAU,EAAE,UAAU,MAAM,KAAK,MAAM,SAAS,KAAK,UAAU,GAAG,MAAM,IAAI;AACnH,YAAI,CAAC,WAAW,KAAK,aAAa;AAC9B,eAAK,cAAc,UAAU;AAAA,MACpC;AACD,WAAK,KAAI;AAAA,IACZ;AAAA,IACD,QAAQ,KAAK,MAAM;AACf,WAAK,KAAK,KAAK,OAAO,KAAK,UAAU,QAAQ;AACzC,aAAK,UAAU,KAAK,MAAM,IAAI;AAAA,IACrC;AAAA,IACD,OAAO;AACH,iBAAS;AACL,YAAI,KAAK,cAAc,KAAK,MAAM,MAAM,QAAQ;AAC5C,eAAK,OAAO,KAAK,KAAK;AACtB,eAAK,QAAQ;AACb;AAAA,QACH,OACI;AACD,cAAI,WAAW,KAAK,MAAM,SAAS,KAAK,UAAU,GAAG,QAAQ,KAAK,MAAM,MAAM,KAAK,UAAU;AAC7F,cAAI,OAAO,WAAW,MAAM,KAAK,KAAK,UAAU;AAChD,eAAK,OAAO;AACZ,eAAK,KAAK,WAAW,MAAM,GAAG,KAAK,UAAU;AAC7C,eAAK,QAAQ,MAAM,MAAM,KAAK,UAAU;AACxC,eAAK,cAAc,KAAK,aAAa,CAAC;AACtC,cAAI,KAAK,WAAW,KAAK,KAAK,MAAM,SAAS,KAAK,KAAK,KAAK,QAAQ,KAAK;AACrE;AAAA,QACP;AAAA,MACJ;AAAA,IACJ;AAAA,IACD,cAAchE,QAAO;AACjB,UAAIA,UAAS,KAAK,MAAM,MAAM,KAAK,UAAU,EAAE,MAAM,QAAQ;AACzD,aAAK;AACL,YAAI,KAAK,MAAM;AACX,iBAAO,KAAK,aAAa,KAAK,MAAM,MAAM,UAAU,KAAK,KAAK,IAAI,KAAK,MAAM,MAAM,KAAK,UAAU,CAAC;AAC/F,iBAAK;AAAA,QACZ;AACD,aAAK,aAAa;AAAA,MACrB,OACI;AACD,aAAK,aAAaA;AAAA,MACrB;AAAA,IACJ;AAAA,IACD,YAAY;AACR,WAAK;AACL,WAAK,aAAa;AAClB,WAAK,KAAI;AAAA,IACZ;AAAA,IACD,QAAQ,OAAO;AACX,aAAO,KAAK,OAAO,MAAM,QAAQ,KAAK,YAAY,MAAM,aAAa,KAAK,OAAO,MAAM,QACnF,KAAK,KAAK,MAAM,MAAM,KAAK,UAAU,MAAM;AAAA,IAClD;AAAA,EACL;AAAA,EACA,MAAM,WAAW;AAAA,IACb,YAAY,MAAM;AACd,WAAK,OAAO;AAAA,IACf;AAAA,IACD,OAAO,KAAK,MAAM,OAAO,MAAM,WAAW,IAAI;AAC1C,UAAI,OAAO,CAAA;AACX,eAASD,KAAI,GAAGA,KAAI,KAAK,QAAQA,MAAK;AAClC,iBAAS,MAAM,KAAKA,EAAC,GAAG,CAAC,IAAI,SAAS,MAAM,IAAI,WAAW;AACvD,cAAI,IAAI,YAAY;AAChB,iBAAK,KAAK,IAAI,YAAY,KAAK,MAAM,UAAUA,EAAC,CAAC;AAAA,QACxD;AAAA,MACJ;AACD,aAAO,KAAK,UAAU,IAAI,KAAK,CAAC,IAAI,IAAI,WAAW,IAAI;AAAA,IAC1D;AAAA,IACD,IAAI,YAAY;AAAE,aAAO,KAAK,QAAQ,KAAK,MAAM,YAAY;AAAA,IAAI;AAAA,IACjE,KAAK,KAAK,OAAO,MAAyB;AACtC,eAAS,OAAO,KAAK;AACjB,YAAI,KAAK,KAAK,IAAI;AACtB,eAASA,KAAI,KAAK,KAAK,UAAU,GAAGA,MAAK,GAAGA;AACxC,mBAAW,KAAK,MAAMA,EAAC;AAC3B,WAAK,KAAI;AACT,aAAO;AAAA,IACV;AAAA,IACD,QAAQ,KAAK,MAAM;AACf,eAAS,OAAO,KAAK;AACjB,YAAI,QAAQ,KAAK,IAAI;AACzB,eAASA,KAAI,KAAK,KAAK,UAAU,GAAGA,MAAK,GAAGA;AACxC,mBAAW,KAAK,MAAMA,EAAC;AAC3B,WAAK,KAAK,KAAK,OAAO,KAAK,MAAM,UAAU,QAAQ;AAC/C,aAAK,KAAI;AAAA,IAChB;AAAA,IACD,OAAO;AACH,UAAI,KAAK,KAAK,UAAU,GAAG;AACvB,aAAK,OAAO,KAAK,KAAK;AACtB,aAAK,QAAQ;AACb,aAAK,OAAO;AAAA,MACf,OACI;AACD,YAAIuC,OAAM,KAAK,KAAK,CAAC;AACrB,aAAK,OAAOA,KAAI;AAChB,aAAK,KAAKA,KAAI;AACd,aAAK,QAAQA,KAAI;AACjB,aAAK,OAAOA,KAAI;AAChB,YAAIA,KAAI;AACJ,UAAAA,KAAI,KAAI;AACZ,mBAAW,KAAK,MAAM,CAAC;AAAA,MAC1B;AAAA,IACJ;AAAA,EACL;AACA,WAAS,WAAW,MAAMtC,QAAO;AAC7B,aAAS,MAAM,KAAKA,MAAK,OAAK;AAC1B,UAAI,cAAcA,UAAS,KAAK;AAChC,UAAI,cAAc,KAAK;AACnB;AACJ,UAAI,QAAQ,KAAK,UAAU;AAC3B,UAAI,aAAa,IAAI,KAAK,UAAU,MAAM,QAAQ,KAAK,aAAa,CAAC,CAAC,KAAK,GAAG;AAC1E,gBAAQ,KAAK,aAAa,CAAC;AAC3B;AAAA,MACH;AACD,UAAI,IAAI,QAAQ,KAAK,IAAI;AACrB;AACJ,WAAK,UAAU,IAAI;AACnB,WAAKA,MAAK,IAAI;AACd,MAAAA,SAAQ;AAAA,IACX;AAAA,EACL;AAAA,EACA,MAAM,WAAW;AAAA,IACb,YAAY,MAAM,MAAM,UAAU;AAC9B,WAAK,WAAW;AAChB,WAAK,SAAS;AACd,WAAK,WAAW;AAChB,WAAK,aAAa;AAClB,WAAK,YAAY;AAEjB,WAAK,QAAQ;AACb,WAAK,YAAY;AACjB,WAAK,YAAY;AACjB,WAAK,KAAK;AACV,WAAK,UAAU;AAGf,WAAK,YAAY;AACjB,WAAK,SAAS,WAAW,KAAK,MAAM,MAAM,QAAQ;AAAA,IACrD;AAAA,IACD,KAAK,KAAK,OAAO,MAAyB;AACtC,WAAK,OAAO,KAAK,KAAK,IAAI;AAC1B,WAAK,OAAO,SAAS,KAAK,SAAS,SAAS,KAAK,WAAW,SAAS;AACrE,WAAK,YAAY;AACjB,WAAK,KAAK;AACV,WAAK,UAAU;AACf,WAAK,YAAY;AACjB,WAAK,KAAI;AACT,aAAO;AAAA,IACV;AAAA,IACD,QAAQ,KAAK,MAAM;AACf,aAAO,KAAK,YAAY,OAAO,KAAK,SAAS,KAAK,SAAS,IAAI,OAAO,KAAK,OAAO,KAAK,SAAS,EAAE,UAAU,QAAQ;AAChH,aAAK,aAAa,KAAK,SAAS;AACpC,WAAK,OAAO,QAAQ,KAAK,IAAI;AAAA,IAChC;AAAA,IACD,aAAaA,QAAO;AAChB,aAAO,KAAK,QAAQA,MAAK;AACzB,aAAO,KAAK,UAAUA,MAAK;AAC3B,aAAO,KAAK,YAAYA,MAAK;AAC7B,WAAK,YAAY,aAAa,KAAK,QAAQ,KAAK,QAAQ;AAAA,IAC3D;AAAA,IACD,UAAU,WAAW;AACjB,UAAID,KAAI,GAAG,EAAE,OAAO,IAAI,KAAM,IAAG,KAAK;AACtC,aAAOA,KAAI,KAAK,WAAW,UAAU,KAAK,WAAWA,EAAC,KAAK;AACvD,QAAAA;AACJ,aAAO,KAAK,QAAQA,IAAG,KAAK;AAC5B,aAAO,KAAK,UAAUA,IAAG,EAAE;AAC3B,aAAO,KAAK,YAAYA,IAAG,IAAI;AAC/B,UAAI;AACA,eAAO,WAAWA,IAAG,KAAK,OAAO,IAAI;AACzC,WAAK,YAAY,aAAa,KAAK,QAAQ,KAAK,QAAQ;AAAA,IAC3D;AAAA;AAAA;AAAA,IAGD,OAAO;AACH,UAAI,OAAO,KAAK,IAAI,WAAW,KAAK;AACpC,WAAK,QAAQ;AACb,UAAI,YAAY,KAAK,YAAY,IAAI,CAAA,IAAK;AAC1C,iBAAS;AACL,YAAIL,KAAI,KAAK;AACb,YAAIA,KAAI,OAAO,KAAK,SAASA,EAAC,IAAI,KAAK,OAAO,QAAQ,KAAK,OAAOA,EAAC,EAAE,UAAU,KAAK,OAAO,aAAa,GAAG;AACvG,cAAI,KAAK,SAASA,EAAC,IAAI,MAAM;AACzB,iBAAK,KAAK,KAAK,SAASA,EAAC;AACzB,iBAAK,UAAU,KAAK,OAAOA,EAAC,EAAE;AAC9B;AAAA,UACH;AACD,eAAK,aAAaA,EAAC;AACnB,cAAI;AACA,mBAAO,WAAWA,EAAC;AAAA,QAC1B,WACQ,CAAC,KAAK,OAAO,OAAO;AACzB,eAAK,KAAK,KAAK,UAAU;AACzB;AAAA,QACH,WACQ,KAAK,OAAO,OAAO,MAAM;AAC9B,eAAK,KAAK,KAAK,OAAO;AACtB,eAAK,UAAU,KAAK,OAAO;AAC3B;AAAA,QACH,OACI;AACD,cAAI,UAAU,KAAK,OAAO;AAC1B,cAAI,CAAC,QAAQ,OAAO;AAChB,iBAAK,UAAU,SAAS;AACxB,iBAAK,OAAO;UACf,WACQ,YAAY,KAAK,OAAO,MAAM,KAAK,MAAM,KAAK,OAAO,OAAO,KAAK,OAAO,IAAI;AAEjF,iBAAK,OAAO;UACf,OACI;AACD,iBAAK,QAAQ;AACb,iBAAK,YAAY,KAAK,OAAO;AAC7B,iBAAK,YAAY,KAAK,OAAO;AAC7B,iBAAK,KAAK,KAAK,OAAO;AACtB,iBAAK,UAAU,QAAQ;AACvB,iBAAK,OAAO;AACZ,iBAAK,QAAQ,KAAK,IAAI,KAAK,OAAO;AAClC;AAAA,UACH;AAAA,QACJ;AAAA,MACJ;AACD,UAAI,WAAW;AACX,aAAK,YAAY;AACjB,iBAASK,KAAI,UAAU,SAAS,GAAGA,MAAK,KAAK,UAAUA,EAAC,IAAI,MAAMA;AAC9D,eAAK;AAAA,MACZ;AAAA,IACJ;AAAA,IACD,eAAe,IAAI;AACf,UAAI,CAAC,KAAK,OAAO;AACb,eAAO,KAAK;AAChB,UAAI,SAAS,CAAA;AACb,eAASA,KAAI,KAAK,OAAO,SAAS,GAAGA,MAAK,GAAGA,MAAK;AAC9C,YAAI,KAAK,WAAWA,EAAC,IAAI,KAAK;AAC1B;AACJ,YAAI,KAAK,SAASA,EAAC,IAAI,MAAM,KAAK,SAASA,EAAC,KAAK,MAAM,KAAK,OAAOA,EAAC,EAAE,WAAW,KAAK,MAAM;AACxF,iBAAO,KAAK,KAAK,OAAOA,EAAC,CAAC;AAAA,MACjC;AACD,aAAO,OAAO;IACjB;AAAA,IACD,QAAQ,IAAI;AACR,UAAI,OAAO;AACX,eAASA,KAAI,KAAK,SAAS,SAAS,GAAGA,MAAK,KAAK,KAAK,SAASA,EAAC,IAAI,IAAIA;AACpE;AACJ,aAAO;AAAA,IACV;AAAA,EACL;AACA,WAAS,QAAQL,IAAG,QAAQsB,IAAG,QAAQ,QAAQ,YAAY;AACvD,IAAAtB,GAAE,KAAK,MAAM;AACb,IAAAsB,GAAE,KAAK,MAAM;AACb,QAAI,OAAO,SAAS;AACpB,QAAI,MAAM,QAAQ,OAAO,SAAS;AAClC,eAAS;AACL,UAAI,OAAQtB,GAAE,KAAK,OAAQsB,GAAE,MAAMtB,GAAE,UAAUsB,GAAE;AACjD,UAAI,MAAM,OAAO,IAAItB,GAAE,KAAK,OAAOsB,GAAE,IAAI,UAAU,KAAK,IAAI,KAAK,IAAI;AACrE,UAAItB,GAAE,SAASsB,GAAE,OAAO;AACpB,YAAI,EAAEtB,GAAE,SAASsB,GAAE,UAAUtB,GAAE,SAASsB,GAAE,SAAStB,GAAE,MAAM,GAAGsB,GAAE,KAAK,MACjE,WAAWtB,GAAE,eAAeA,GAAE,EAAE,GAAGsB,GAAE,eAAeA,GAAE,EAAE,CAAC;AACzD,qBAAW,aAAa,KAAK,SAAStB,GAAE,OAAOsB,GAAE,KAAK;AAAA,MAC7D,OACI;AACD,YAAI,UAAU,OAAO,CAAC,WAAWtB,GAAE,QAAQsB,GAAE,MAAM;AAC/C,qBAAW,aAAa,KAAK,SAAStB,GAAE,QAAQsB,GAAE,MAAM;AAAA,MAC/D;AACD,UAAI,MAAM;AACN;AACJ,YAAM;AACN,UAAI,QAAQ;AACR,QAAAtB,GAAE,KAAI;AACV,UAAI,QAAQ;AACR,QAAAsB,GAAE,KAAI;AAAA,IACb;AAAA,EACL;AACA,WAAS,WAAWtB,IAAGsB,IAAG;AACtB,QAAItB,GAAE,UAAUsB,GAAE;AACd,aAAO;AACX,aAASjB,KAAI,GAAGA,KAAIL,GAAE,QAAQK;AAC1B,UAAIL,GAAEK,EAAC,KAAKiB,GAAEjB,EAAC,KAAK,CAACL,GAAEK,EAAC,EAAE,GAAGiB,GAAEjB,EAAC,CAAC;AAC7B,eAAO;AACf,WAAO;AAAA,EACX;AACA,WAAS,OAAO,OAAOC,QAAO;AAC1B,aAASD,KAAIC,QAAOJ,KAAI,MAAM,SAAS,GAAGG,KAAIH,IAAGG;AAC7C,YAAMA,EAAC,IAAI,MAAMA,KAAI,CAAC;AAC1B,UAAM,IAAG;AAAA,EACb;AACA,WAAS,OAAO,OAAOC,QAAO,OAAO;AACjC,aAASD,KAAI,MAAM,SAAS,GAAGA,MAAKC,QAAOD;AACvC,YAAMA,KAAI,CAAC,IAAI,MAAMA,EAAC;AAC1B,UAAMC,MAAK,IAAI;AAAA,EACnB;AACA,WAAS,aAAa,OAAO,OAAO;AAChC,QAAI,QAAQ,IAAI,WAAW;AAC3B,aAASD,KAAI,GAAGA,KAAI,MAAM,QAAQA;AAC9B,WAAK,MAAMA,EAAC,IAAI,YAAY,MAAMA,EAAC,EAAE,UAAU,MAAM,KAAK,EAAE,WAAW,GAAG;AACtE,gBAAQA;AACR,mBAAW,MAAMA,EAAC;AAAA,MACrB;AACL,WAAO;AAAA,EACX;AAMA,WAAS,YAAYoC,SAAQ,SAAS,KAAKA,QAAO,QAAQ;AACtD,QAAIjC,KAAI;AACR,aAASH,KAAI,GAAGA,KAAI,MAAK;AACrB,UAAIoC,QAAO,WAAWpC,EAAC,KAAK,GAAG;AAC3B,QAAAG,MAAK,UAAWA,KAAI;AACpB,QAAAH;AAAA,MACH,OACI;AACD,QAAAG;AACA,QAAAH,KAAI,iBAAiBoC,SAAQpC,EAAC;AAAA,MACjC;AAAA,IACJ;AACD,WAAOG;AAAA,EACX;AAQA,WAAS,WAAWiC,SAAQ,KAAK,SAAS,QAAQ;AAC9C,aAASpC,KAAI,GAAGG,KAAI,OAAK;AACrB,UAAIA,MAAK;AACL,eAAOH;AACX,UAAIA,MAAKoC,QAAO;AACZ;AACJ,MAAAjC,MAAKiC,QAAO,WAAWpC,EAAC,KAAK,IAAI,UAAWG,KAAI,UAAW;AAC3D,MAAAH,KAAI,iBAAiBoC,SAAQpC,EAAC;AAAA,IACjC;AACD,WAAO,WAAW,OAAO,KAAKoC,QAAO;AAAA,EACzC;AC3yHA,QAAM8B,MAAI;AACV,QAAM,QAAQ,OAAO,UAAU,cAAc,OAAOA,MAAI,OAAO,IAAIA,GAAC;AACpE,QAAM,MAAM,OAAO,UAAU,cAAc,eAAe,KAAK,MAAM,KAAK,OAAM,IAAK,GAAG,IAAI,OAAO,UAAU;AAC7G,QAAM,MAAM,OAAO,cAAc,cAAc,aAAa,OAAO,UAAU,cAAc,SAAS,CAAE;AAAA,EAW/F,MAAM,YAAY;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMvB,YAAY,MAAM,SAAS;AACzB,WAAK,QAAQ,CAAE;AACf,UAAI,EAAC,OAAM,IAAI,WAAW,CAAE;AAE5B,eAAS,cAAc,UAAU;AAC/B,eAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,QAAQ,IAAI,SAAS,MAAM,MAAM;AAAA,MAChE;AAED,eAAS,OAAO,WAAWC,OAAM,QAAQ,aAAa;AACpD,YAAI,QAAQ,CAAE,GAAE,OAAO,YAAY,KAAK,UAAU,CAAC,CAAC,GAAG,YAAY,QAAQ,KAAK,CAAC,KAAK;AACtF,YAAI,QAAQA,SAAQ;AAAM,iBAAO,OAAO,KAAK,UAAU,CAAC,IAAI,GAAG;AAC/D,iBAAS,QAAQA,OAAM;AACrB,cAAI,QAAQA,MAAK,IAAI;AACrB,cAAI,IAAI,KAAK,IAAI,GAAG;AAClB;AAAA,cAAO,KAAK,MAAM,MAAM,EAAE,IAAI,UAAQ,UAAU,IAAI,SAAO,KAAK,QAAQ,KAAK,GAAG,CAAC,CAAC,EAAE,OAAO,CAACxE,IAAGsB,OAAMtB,GAAE,OAAOsB,EAAC,CAAC;AAAA,cACzG;AAAA,cAAO;AAAA,YAAM;AAAA,UACrB,WAAU,SAAS,OAAO,SAAS,UAAU;AAC5C,gBAAI,CAAC;AAAM,oBAAM,IAAI,WAAW,8BAA8B,OAAO,gCAAgC;AACrG,mBAAO,cAAc,IAAI,GAAG,OAAO,OAAO,SAAS;AAAA,UAC7D,WAAmB,SAAS,MAAM;AACxB,kBAAM,KAAK,KAAK,QAAQ,OAAO,EAAE,EAAE,QAAQ,UAAU,CAAAoC,OAAK,MAAMA,GAAE,YAAW,CAAE,IAAI,OAAO,QAAQ,GAAG;AAAA,UACtG;AAAA,QACF;AACD,YAAI,MAAM,UAAU,WAAW;AAC7B,iBAAO,MAAM,UAAU,CAAC,QAAQ,CAAC,cAAc,UAAU,IAAI,MAAM,IAAI,WAAW,KAAK,IAAI,IAC/E,OAAO,MAAM,KAAK,GAAG,IAAI,GAAG;AAAA,QACzC;AAAA,MACF;AAED,eAAS,QAAQ;AAAM,eAAO,cAAc,IAAI,GAAG,KAAK,IAAI,GAAG,KAAK,KAAK;AAAA,IAC1E;AAAA;AAAA;AAAA,IAID,WAAW;AAAE,aAAO,KAAK,MAAM,KAAK,IAAI;AAAA,IAAG;AAAA;AAAA;AAAA,IAI3C,OAAO,UAAU;AACf,UAAI,KAAK,IAAI,KAAK,KAAK;AACvB,UAAI,KAAK,IAAI,KAAK;AAClB,aAAOa,MAAI,GAAG,SAAS,EAAE;AAAA,IAC1B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAeD,OAAO,MAAM,MAAM,SAAS;AAC1B,OAAC,KAAK,GAAG,KAAK,IAAI,SAAS,IAAI,GAAG,MAAM,MAAM,QAAQ,OAAO,IAAI,UAAU,CAAC,OAAO,CAAC;AAAA,IACrF;AAAA,EACH;AAEA,MAAI,aAAa,oBAAI;AAAA,EAErB,MAAM,SAAS;AAAA,IACb,YAAY,MAAM;AAChB,UAAIT,OAAM,KAAK,iBAAiB,MAAM,MAAMA,KAAI;AAChD,UAAI,CAAC,KAAK,QAAQ,KAAK,sBAAsB,IAAI,eAAe;AAC9D,YAAI,UAAU,WAAW,IAAIA,IAAG;AAChC,YAAI,SAAS;AACX,eAAK,qBAAqB,CAAC,QAAQ,OAAO,GAAG,KAAK,kBAAkB;AACpE,iBAAO,KAAK,GAAG,IAAI;AAAA,QACpB;AACD,aAAK,QAAQ,IAAI,IAAI;AACrB,aAAK,qBAAqB,CAAC,KAAK,OAAO,GAAG,KAAK,kBAAkB;AACjE,mBAAW,IAAIA,MAAK,IAAI;AAAA,MAC9B,OAAW;AACL,aAAK,WAAWA,KAAI,cAAc,OAAO;AACzC,YAAI,SAAS,KAAK,QAAQ;AAC1B,eAAO,aAAa,KAAK,UAAU,OAAO,UAAU;AAAA,MACrD;AACD,WAAK,UAAU,CAAE;AACjB,WAAK,GAAG,IAAI;AAAA,IACb;AAAA,IAED,MAAM,SAAS;AACb,UAAI,QAAQ,KAAK;AACjB,UAAI,MAAM,GAA6B,IAAI;AAC3C,eAASzD,KAAI,GAAGA,KAAI,QAAQ,QAAQA,MAAK;AACvC,YAAI,MAAM,QAAQA,EAAC,GAAGC,SAAQ,KAAK,QAAQ,QAAQ,GAAG;AACtD,YAAIA,SAAQ,KAAKA,SAAQ,IAAI;AAC3B,eAAK,QAAQ,OAAOA,QAAO,CAAC;AAC5B;AACA,UAAAA,SAAQ;AAAA,QACT;AACD,YAAIA,UAAS,IAAI;AACf,eAAK,QAAQ,OAAO,KAAK,GAAG,GAAG;AAC/B,cAAI;AAAO,qBAAS,IAAI,GAAG,IAAI,IAAI,MAAM,QAAQ;AAC/C,oBAAM,WAAW,IAAI,MAAM,CAAC,GAAG,KAAK;AAAA,QAC9C,OAAa;AACL,iBAAO,IAAIA;AAAO,mBAAO,KAAK,QAAQ,GAAG,EAAE,MAAM;AACjD,iBAAO,IAAI,MAAM;AACjB;AAAA,QACD;AAAA,MACF;AAED,UAAI,CAAC,OAAO;AACV,YAAI,OAAO;AACX,iBAASD,KAAI,GAAGA,KAAI,KAAK,QAAQ,QAAQA;AACvC,kBAAQ,KAAK,QAAQA,EAAC,EAAE,SAAU,IAAG;AACvC,aAAK,SAAS,cAAc;AAAA,MAC7B;AAAA,IACF;AAAA,EACH;ACrIO,MAAI,OAAO;AAAA,IAChB,GAAG;AAAA,IACH,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,EACP;AAEO,MAAI,QAAQ;AAAA,IACjB,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,EACP;AAEA,MAAI,MAAM,OAAO,aAAa,eAAe,MAAM,KAAK,UAAU,QAAQ;AAC1E,MAAIoE,OAAK,OAAO,aAAa,eAAe,gDAAgD,KAAK,UAAU,SAAS;AAGpH,WAASpE,MAAI,GAAGA,MAAI,IAAIA;AAAK,SAAK,KAAKA,GAAC,IAAI,KAAK,KAAKA,GAAC,IAAI,OAAOA,GAAC;AAGnE,WAASA,MAAI,GAAGA,OAAK,IAAIA;AAAK,SAAKA,MAAI,GAAG,IAAI,MAAMA;AAGpD,WAASA,MAAI,IAAIA,OAAK,IAAIA,OAAK;AAC7B,SAAKA,GAAC,IAAI,OAAO,aAAaA,MAAI,EAAE;AACpC,UAAMA,GAAC,IAAI,OAAO,aAAaA,GAAC;AAAA,EAClC;AAGA,WAAS,QAAQ;AAAM,QAAI,CAAC,MAAM,eAAe,IAAI;AAAG,YAAM,IAAI,IAAI,KAAK,IAAI;AAExE,WAAS,QAAQ,OAAO;AAG7B,QAAI,YAAY,OAAO,MAAM,WAAW,MAAM,YAAY,CAAC,MAAM,WAAW,CAAC,MAAM,UAC/EoE,QAAM,MAAM,YAAY,MAAM,OAAO,MAAM,IAAI,UAAU,KACzD,MAAM,OAAO;AACjB,QAAI9D,QAAQ,CAAC,aAAa,MAAM,QAC7B,MAAM,WAAW,QAAQ,MAAM,MAAM,OAAO,KAC7C,MAAM,OAAO;AAEf,QAAIA,SAAQ;AAAO,MAAAA,QAAO;AAC1B,QAAIA,SAAQ;AAAO,MAAAA,QAAO;AAE1B,QAAIA,SAAQ;AAAQ,MAAAA,QAAO;AAC3B,QAAIA,SAAQ;AAAM,MAAAA,QAAO;AACzB,QAAIA,SAAQ;AAAS,MAAAA,QAAO;AAC5B,QAAIA,SAAQ;AAAQ,MAAAA,QAAO;AAC3B,WAAOA;AAAA,EACT;AClHA,WAAS,aAAa,MAAM;AACxB,QAAI;AAIJ,QAAI,KAAK,YAAY,IAAI;AACrB,eAAS,KAAK,eAAe,OAAO,KAAK;AAAA,IAC5C,OACI;AACD,eAAS;AAAA,IACZ;AACD,WAAO,OAAO;EAClB;AACA,WAAS,SAAS,KAAK,MAAM;AACzB,WAAO,OAAO,OAAO,QAAQ,IAAI,SAAS,KAAK,YAAY,IAAI,KAAK,aAAa,IAAI,IAAI;AAAA,EAC7F;AACA,WAAS,kBAAkBmD,MAAK;AAC5B,QAAI,MAAMA,KAAI;AACd,WAAO,OAAO,IAAI;AACd,YAAM,IAAI,WAAW;AACzB,WAAO;AAAA,EACX;AACA,WAAS,aAAa,KAAK,WAAW;AAClC,QAAI,CAAC,UAAU;AACX,aAAO;AACX,QAAI;AAIA,aAAO,SAAS,KAAK,UAAU,UAAU;AAAA,IAC5C,SACMpB,IAAG;AACN,aAAO;AAAA,IACV;AAAA,EACL;AACA,WAAS,eAAe,KAAK;AACzB,QAAI,IAAI,YAAY;AAChB,aAAO,UAAU,KAAK,GAAG,IAAI,UAAU,MAAM,EAAE;aAC1C,IAAI,YAAY;AACrB,aAAO,IAAI;;AAEX,aAAO;EACf;AAIA,WAAS,qBAAqB,MAAM,KAAK,YAAY,WAAW;AAC5D,WAAO,aAAc,QAAQ,MAAM,KAAK,YAAY,WAAW,EAAE,KAC7D,QAAQ,MAAM,KAAK,YAAY,WAAW,CAAC,IAAK;AAAA,EACxD;AACA,WAAS,SAAS,MAAM;AACpB,aAASpC,SAAQ,KAAIA,UAAS;AAC1B,aAAO,KAAK;AACZ,UAAI,CAAC;AACD,eAAOA;AAAA,IACd;AAAA,EACL;AACA,WAAS,QAAQ,MAAM,KAAK,YAAY,WAAW,KAAK;AACpD,eAAS;AACL,UAAI,QAAQ,cAAc,OAAO;AAC7B,eAAO;AACX,UAAI,QAAQ,MAAM,IAAI,IAAI,UAAU,IAAI,IAAI;AACxC,YAAI,KAAK,YAAY;AACjB,iBAAO;AACX,YAAI,SAAS,KAAK;AAClB,YAAI,CAAC,UAAU,OAAO,YAAY;AAC9B,iBAAO;AACX,cAAM,SAAS,IAAI,KAAK,MAAM,IAAI,IAAI;AACtC,eAAO;AAAA,MACV,WACQ,KAAK,YAAY,GAAG;AACzB,eAAO,KAAK,WAAW,OAAO,MAAM,IAAI,KAAK,EAAE;AAC/C,YAAI,KAAK,YAAY,KAAK,KAAK,mBAAmB;AAC9C,iBAAO;AACX,cAAM,MAAM,IAAI,UAAU,IAAI,IAAI;AAAA,MACrC,OACI;AACD,eAAO;AAAA,MACV;AAAA,IACJ;AAAA,EACL;AACA,WAAS,UAAU,MAAM;AACrB,WAAO,KAAK,YAAY,IAAI,KAAK,UAAU,SAAS,KAAK,WAAW;AAAA,EACxE;AACA,WAAS,YAAY,MAAM,MAAM;AAC7B,QAAIH,KAAI,OAAO,KAAK,OAAO,KAAK;AAChC,WAAO,EAAE,MAAMA,IAAG,OAAOA,IAAG,KAAK,KAAK,KAAK,QAAQ,KAAK,OAAM;AAAA,EAClE;AACA,WAAS,WAAW,KAAK;AACrB,WAAO;AAAA,MAAE,MAAM;AAAA,MAAG,OAAO,IAAI;AAAA,MACzB,KAAK;AAAA,MAAG,QAAQ,IAAI;AAAA,IAAW;AAAA,EACvC;AACA,WAAS,mBAAmB,KAAK,MAAM,MAAMA,IAAGuE,IAAG,SAAS,SAAS,KAAK;AACtE,QAAIZ,OAAM,IAAI,eAAe,MAAMA,KAAI,eAAe;AACtD,aAAS,MAAM,KAAK,OAAM;AACtB,UAAI,IAAI,YAAY,GAAG;AACnB,YAAI,UAAUlB,OAAM,OAAOkB,KAAI;AAC/B,YAAIlB,MAAK;AACL,qBAAW,WAAW,GAAG;AAAA,QAC5B,OACI;AACD,cAAI,IAAI,gBAAgB,IAAI,gBAAgB,IAAI,eAAe,IAAI,aAAa;AAC5E,kBAAM,IAAI,gBAAgB,IAAI;AAC9B;AAAA,UACH;AACD,cAAI+B,QAAO,IAAI;AAEf,qBAAW;AAAA,YAAE,MAAMA,MAAK;AAAA,YAAM,OAAOA,MAAK,OAAO,IAAI;AAAA,YACjD,KAAKA,MAAK;AAAA,YAAK,QAAQA,MAAK,MAAM,IAAI;AAAA;QAC7C;AACD,YAAI,QAAQ,GAAG,QAAQ;AACvB,YAAID,MAAK,WAAW;AAChB,cAAI,KAAK,MAAM,SAAS,KAAK;AACzB,oBAAQ,EAAE,SAAS,MAAM,KAAK,MAAM;AACpC,gBAAI,OAAO,KAAK,KAAK,SAAS,SAAS,SAAS;AAC5C,sBAAQ,KAAK,SAAS,SAAS,SAAS,QAAQ;AAAA,UACvD,WACQ,KAAK,SAAS,SAAS,QAAQ;AACpC,oBAAQ,KAAK,SAAS,SAAS,SAAS;AACxC,gBAAI,OAAO,KAAM,KAAK,MAAM,QAAS,SAAS;AAC1C,sBAAQ,EAAE,SAAS,MAAM,QAAQ,KAAK,MAAM;AAAA,UACnD;AAAA,QACJ,OACI;AACD,cAAI,aAAa,KAAK,SAAS,KAAK,KAAK,iBAAiB,SAAS,SAAS,SAAS;AACrF,cAAI,YAAYA,MAAK,YAAY,cAAc,iBAAiB,KAAK,MAAM,aAAa,IAAI,iBAAiB,IACzGA,MAAK,WAAWA,MAAK,YAAY,OAAO,IAAI,KAAK,MAAM,UACnD,KAAK,SAAS,iBAAiB;AACvC,kBAAQ,YAAY,SAAS;AAAA,QAChC;AACD,YAAIvE,MAAK,WAAW;AAChB,cAAI,KAAK,OAAO,SAAS,MAAM;AAC3B,oBAAQ,EAAE,SAAS,OAAO,KAAK,OAAO;AACtC,gBAAI,OAAO,KAAK,KAAK,QAAQ,SAAS,QAAQ;AAC1C,sBAAQ,KAAK,QAAQ,SAAS,QAAQ,QAAQ;AAAA,UACrD,WACQ,KAAK,QAAQ,SAAS,OAAO;AAClC,oBAAQ,KAAK,QAAQ,SAAS,QAAQ;AACtC,gBAAI,OAAO,KAAK,KAAK,OAAO,SAAS,OAAO;AACxC,sBAAQ,EAAE,SAAS,OAAO,QAAQ,KAAK,OAAO;AAAA,UACrD;AAAA,QACJ,OACI;AACD,cAAI,aAAaA,MAAK,WAAW,KAAK,QAAQ,KAAK,QAAQ,KAAK,QAAQ,KAAK,SAAS,QAAQ,SAAS,QAAQ,IAC1GA,MAAK,WAAY,MAAM,KAAK,OAAO,UAChC,KAAK,SAAS,SAAS,QAAQ,SAAS,QAAQ;AACxD,kBAAQ,aAAa,SAAS;AAAA,QACjC;AACD,YAAI,SAAS,OAAO;AAChB,cAAIyC,MAAK;AACL,gBAAI,SAAS,OAAO,KAAK;AAAA,UAC5B,OACI;AACD,gBAAI,SAAS,GAAG,SAAS;AACzB,gBAAI,OAAO;AACP,kBAAI,QAAQ,IAAI;AAChB,kBAAI,aAAa;AACjB,uBAAS,IAAI,YAAY;AAAA,YAC5B;AACD,gBAAI,OAAO;AACP,kBAAI,QAAQ,IAAI;AAChB,kBAAI,cAAc;AAClB,uBAAS,IAAI,aAAa;AAAA,YAC7B;AACD,mBAAO;AAAA,cAAE,MAAM,KAAK,OAAO;AAAA,cAAQ,KAAK,KAAK,MAAM;AAAA,cAC/C,OAAO,KAAK,QAAQ;AAAA,cAAQ,QAAQ,KAAK,SAAS;AAAA;AACtD,gBAAI,UAAU,KAAK,IAAI,SAAS,KAAK,IAAI;AACrC,cAAAzC,KAAI;AACR,gBAAI,UAAU,KAAK,IAAI,SAAS,KAAK,IAAI;AACrC,cAAAuE,KAAI;AAAA,UACX;AAAA,QACJ;AACD,YAAI9B;AACA;AACJ,cAAM,IAAI,gBAAgB,IAAI;AAAA,MACjC,WACQ,IAAI,YAAY,IAAI;AACzB,cAAM,IAAI;AAAA,MACb,OACI;AACD;AAAA,MACH;AAAA,IACJ;AAAA,EACL;AACA,WAAS,iBAAiB,KAAK;AAC3B,QAAIkB,OAAM,IAAI;AACd,aAAS,MAAM,IAAI,YAAY,OAAM;AACjC,UAAI,OAAOA,KAAI,MAAM;AACjB;AAAA,MACH,WACQ,IAAI,YAAY,GAAG;AACxB,YAAI,IAAI,eAAe,IAAI,gBAAgB,IAAI,cAAc,IAAI;AAC7D,iBAAO;AACX,cAAM,IAAI,gBAAgB,IAAI;AAAA,MACjC,WACQ,IAAI,YAAY,IAAI;AACzB,cAAM,IAAI;AAAA,MACb,OACI;AACD;AAAA,MACH;AAAA,IACJ;AACD,WAAO;AAAA,EACX;AAAA,EACA,MAAM,kBAAkB;AAAA,IACpB,cAAc;AACV,WAAK,aAAa;AAClB,WAAK,eAAe;AACpB,WAAK,YAAY;AACjB,WAAK,cAAc;AAAA,IACtB;AAAA,IACD,GAAG,QAAQ;AACP,aAAO,KAAK,cAAc,OAAO,cAAc,KAAK,gBAAgB,OAAO,gBACvE,KAAK,aAAa,OAAO,aAAa,KAAK,eAAe,OAAO;AAAA,IACxE;AAAA,IACD,SAAS,OAAO;AACZ,UAAI,EAAE,YAAY,UAAW,IAAG;AAEhC,WAAK,IAAI,YAAY,KAAK,IAAI,MAAM,cAAc,aAAa,UAAU,UAAU,IAAI,CAAC,GAAG,WAAW,KAAK,IAAI,MAAM,aAAa,YAAY,UAAU,SAAS,IAAI,CAAC,CAAC;AAAA,IAC1K;AAAA,IACD,IAAI,YAAY,cAAc,WAAW,aAAa;AAClD,WAAK,aAAa;AAClB,WAAK,eAAe;AACpB,WAAK,YAAY;AACjB,WAAK,cAAc;AAAA,IACtB;AAAA,EACL;AACA,MAAI,yBAAyB;AAG7B,WAAS,mBAAmB,KAAK;AAC7B,QAAI,IAAI;AACJ,aAAO,IAAI;AACf,QAAI;AACA,aAAO,IAAI,MAAM,sBAAsB;AAC3C,QAAI,QAAQ,CAAA;AACZ,aAAS,MAAM,KAAK,KAAK,MAAM,IAAI,YAAY;AAC3C,YAAM,KAAK,KAAK,IAAI,WAAW,IAAI,UAAU;AAC7C,UAAI,OAAO,IAAI;AACX;AAAA,IACP;AACD,QAAI,MAAM,0BAA0B,OAAO;AAAA,MACvC,IAAI,gBAAgB;AAChB,iCAAyB,EAAE,eAAe;AAC1C,eAAO;AAAA,MACV;AAAA,IACJ,IAAG,MAAS;AACb,QAAI,CAAC,wBAAwB;AACzB,+BAAyB;AACzB,eAASzD,KAAI,GAAGA,KAAI,MAAM,UAAS;AAC/B,YAAI,MAAM,MAAMA,IAAG,GAAGuC,OAAM,MAAMvC,IAAG,GAAG,OAAO,MAAMA,IAAG;AACxD,YAAI,IAAI,aAAauC;AACjB,cAAI,YAAYA;AACpB,YAAI,IAAI,cAAc;AAClB,cAAI,aAAa;AAAA,MACxB;AAAA,IACJ;AAAA,EACL;AACA,MAAI;AACJ,WAAS,UAAU,MAAM,MAAM,KAAK,MAAM;AACtC,QAAI,QAAQ,iBAAiB,eAAe,SAAS,YAAa;AAClE,UAAM,OAAO,MAAM,EAAE;AACrB,UAAM,SAAS,MAAM,IAAI;AACzB,WAAO;AAAA,EACX;AACA,WAAS,YAAY,KAAKjC,OAAMiD,OAAM;AAClC,QAAI,UAAU,EAAE,KAAKjD,OAAM,MAAMA,OAAM,SAASiD,OAAM,OAAOA,OAAM,YAAY,KAAI;AACnF,QAAI,OAAO,IAAI,cAAc,WAAW,OAAO;AAC/C,SAAK,YAAY;AACjB,QAAI,cAAc,IAAI;AACtB,QAAI,KAAK,IAAI,cAAc,SAAS,OAAO;AAC3C,OAAG,YAAY;AACf,QAAI,cAAc,EAAE;AACpB,WAAO,KAAK,oBAAoB,GAAG;AAAA,EACvC;AACA,WAAS,QAAQ,MAAM;AACnB,WAAO,MAAM;AACT,UAAI,SAAS,KAAK,YAAY,KAAK,KAAK,YAAY,MAAM,KAAK;AAC3D,eAAO;AACX,aAAO,KAAK,gBAAgB,KAAK;AAAA,IACpC;AACD,WAAO;AAAA,EACX;AACA,WAAS,gBAAgB,MAAM;AAC3B,WAAO,KAAK,WAAW;AACnB,WAAK,oBAAoB,KAAK,WAAW,CAAC,CAAC;AAAA,EACnD;AACA,WAAS,eAAeE,MAAK,WAAW;AACpC,QAAI,OAAO,UAAU,WAAW,SAAS,UAAU;AACnD,QAAI,CAAC,QAAQ,UAAU,cAAc,QAAQ,UAAU,gBAAgB;AACnE,aAAO;AAEX,aAAS,KAAK,IAAI,QAAQ,UAAU,IAAI,CAAC;AACzC,eAAS;AACL,UAAI,QAAQ;AACR,YAAI,KAAK,YAAY;AACjB,iBAAO;AACX,YAAI,OAAO,KAAK,WAAW,SAAS,CAAC;AACrC,YAAI,KAAK,mBAAmB;AACxB;AAAA,aACC;AACD,iBAAO;AACP,mBAAS,UAAU,IAAI;AAAA,QAC1B;AAAA,MACJ,WACQ,QAAQA,MAAK;AAClB,eAAO;AAAA,MACV,OACI;AACD,iBAAS,SAAS,IAAI;AACtB,eAAO,KAAK;AAAA,MACf;AAAA,IACJ;AAAA,EACL;AACA,WAAS,mBAAmB,KAAK;AAC7B,WAAO,IAAI,YAAY,KAAK,IAAI,GAAG,IAAI,eAAe,IAAI,eAAe,CAAC;AAAA,EAC9E;AAAA,EAEA,MAAM,OAAO;AAAA,IACT,YAAY,MAAM,QAAQ,UAAU,MAAM;AACtC,WAAK,OAAO;AACZ,WAAK,SAAS;AACd,WAAK,UAAU;AAAA,IAClB;AAAA,IACD,OAAO,OAAO,KAAK,SAAS;AAAE,aAAO,IAAI,OAAO,IAAI,YAAY,SAAS,GAAG,GAAG,OAAO;AAAA,IAAI;AAAA,IAC1F,OAAO,MAAM,KAAK,SAAS;AAAE,aAAO,IAAI,OAAO,IAAI,YAAY,SAAS,GAAG,IAAI,GAAG,OAAO;AAAA,IAAI;AAAA,EACjG;AACA,QAAM,aAAa,CAAA;AAAA,EACnB,MAAM,YAAY;AAAA,IACd,cAAc;AACV,WAAK,SAAS;AACd,WAAK,MAAM;AACX,WAAK,QAAQ;AAAA,IAChB;AAAA,IACD,IAAI,kBAAkB;AAAE,aAAO;AAAA,IAAO;AAAA,IACtC,IAAI,aAAa;AACb,aAAO,KAAK,SAAS,KAAK,OAAO,UAAU,IAAI,IAAI;AAAA,IACtD;AAAA,IACD,IAAI,WAAW;AACX,aAAO,KAAK,aAAa,KAAK;AAAA,IACjC;AAAA,IACD,UAAU,MAAM;AACZ,UAAI,MAAM,KAAK;AACf,eAAS,SAAS,KAAK,UAAU;AAC7B,YAAI,SAAS;AACT,iBAAO;AACX,eAAO,MAAM,SAAS,MAAM;AAAA,MAC/B;AACD,YAAM,IAAI,WAAW,4BAA4B;AAAA,IACpD;AAAA,IACD,SAAS,MAAM;AACX,aAAO,KAAK,UAAU,IAAI,IAAI,KAAK;AAAA,IACtC;AAAA,IACD,KAAK,MAAM,OAAO;AACd,UAAI,KAAK,QAAQ,GAAc;AAC3B,YAAI,SAAS,KAAK;AAClB,YAAI,OAAO,MAAM;AACjB,iBAAS,SAAS,KAAK,UAAU;AAC7B,cAAI,MAAM,OAAO;AACb,gBAAI,CAAC,MAAM,QAAQ,OAAO,OAAO,KAAK,cAAc,OAAO,eAAe,QAAQ,KAAK,QAAQ,iBAAiB;AAC5G,kBAAI,cAAc,YAAY,IAAI,IAAI;AACtC,kBAAI,CAAC,eAAe,CAAC,YAAY,UAAU,YAAY,YAAY,KAAK;AACpE,sBAAM,SAAS,IAAI;AAAA,YAC1B;AACD,kBAAM,KAAK,MAAM,KAAK;AACtB,kBAAM,QAAQ;AAAA,UACjB;AACD,iBAAO,OAAO,KAAK,cAAc,OAAO;AACxC,cAAI,SAAS,CAAC,MAAM,WAAW,MAAM,QAAQ,UAAU,QAAQ,MAAM;AACjE,kBAAM,UAAU;AACpB,cAAI,MAAM,IAAI,cAAc,QAAQ;AAChC,mBAAO,QAAQ,QAAQ,MAAM;AACzB,qBAAO,KAAK,IAAI;AAAA,UACvB,OACI;AACD,mBAAO,aAAa,MAAM,KAAK,IAAI;AAAA,UACtC;AACD,iBAAO,MAAM;AAAA,QAChB;AACD,eAAO,OAAO,KAAK,cAAc,OAAO;AACxC,YAAI,QAAQ,SAAS,MAAM,QAAQ;AAC/B,gBAAM,UAAU;AACpB,eAAO;AACH,iBAAO,KAAK,IAAI;AAAA,MACvB,WACQ,KAAK,QAAQ,GAAe;AACjC,iBAAS,SAAS,KAAK;AACnB,cAAI,MAAM,OAAO;AACb,kBAAM,KAAK,MAAM,KAAK;AACtB,kBAAM,QAAQ;AAAA,UACjB;AAAA,MACR;AAAA,IACJ;AAAA,IACD,SAAS,MAAM;AAAA,IAAG;AAAA,IAClB,gBAAgB,MAAM,QAAQ;AAC1B,UAAI;AACJ,UAAI,QAAQ,KAAK,KAAK;AAClB,gBAAQ,KAAK,IAAI,WAAW,MAAM;AAAA,MACrC,OACI;AACD,YAAI,OAAO,UAAU,IAAI,KAAK,IAAI,IAAI,UAAU,IAAI,KAAK;AACzD,mBAAS;AACL,cAAI,SAAS,KAAK;AAClB,cAAI,UAAU,KAAK;AACf;AACJ,cAAI,QAAQ,KAAK,OAAO,cAAc,OAAO,WAAW;AACpD,gBAAI,QAAQ,OAAO;AACf,qBAAO;AAAA;AAEP,qBAAO;AAAA,UACd;AACD,iBAAO;AAAA,QACV;AACD,YAAI,OAAO;AACP,kBAAQ;AAAA;AAER,kBAAQ,KAAK;AAAA,MACpB;AACD,UAAI,SAAS,KAAK,IAAI;AAClB,eAAO;AACX,aAAO,SAAS,CAAC,YAAY,IAAI,KAAK;AAClC,gBAAQ,MAAM;AAClB,UAAI,CAAC;AACD,eAAO,KAAK;AAChB,eAASzD,KAAI,GAAG,MAAM,KAAIA,MAAK;AAC3B,YAAI,QAAQ,KAAK,SAASA,EAAC;AAC3B,YAAI,MAAM,OAAO;AACb,iBAAO;AACX,eAAO,MAAM,SAAS,MAAM;AAAA,MAC/B;AAAA,IACJ;AAAA,IACD,gBAAgB,MAAM,IAAI,SAAS,GAAG;AAClC,UAAI,QAAQ,IAAI,YAAY,IAAI,MAAM,IAAI,QAAQ;AAClD,eAASA,KAAI,GAAG,MAAM,QAAQ,UAAU,QAAQA,KAAI,KAAK,SAAS,QAAQA,MAAK;AAC3E,YAAI,QAAQ,KAAK,SAASA,EAAC,GAAG,MAAM,MAAM,MAAM;AAChD,YAAI,MAAM,QAAQ,MAAM;AACpB,iBAAO,MAAM,gBAAgB,MAAM,IAAI,GAAG;AAC9C,YAAI,OAAO,QAAQ,SAAS,IAAI;AAC5B,kBAAQA;AACR,sBAAY;AAAA,QACf;AACD,YAAI,MAAM,MAAM,MAAM,IAAI,cAAc,KAAK,KAAK;AAC9C,gBAAMA;AACN,kBAAQ;AACR;AAAA,QACH;AACD,kBAAU;AACV,cAAM,MAAM,MAAM;AAAA,MACrB;AACD,aAAO;AAAA,QAAE,MAAM;AAAA,QAAW,IAAI,QAAQ,IAAI,SAAS,KAAK,SAAS;AAAA,QAC7D,WAAW,QAAQ,KAAK,SAAS,QAAQ,CAAC,EAAE,IAAI,cAAc,SAAS,KAAK,IAAI;AAAA,QAChF,QAAQ,MAAM,KAAK,SAAS,UAAU,OAAO,IAAI,KAAK,SAAS,GAAG,EAAE,MAAM;AAAA,MAAI;AAAA,IACrF;AAAA,IACD,UAAU,YAAY,OAAO;AACzB,WAAK,SAAS;AACd,WAAK,iBAAiB,SAAS;AAAA,IAClC;AAAA,IACD,iBAAiB,WAAW;AACxB,eAAS,SAAS,KAAK,QAAQ,QAAQ,SAAS,OAAO,QAAQ;AAC3D,YAAI;AACA,iBAAO,SAAS;AACpB,YAAI,OAAO,QAAQ;AACf;AACJ,eAAO,SAAS;AAChB,oBAAY;AAAA,MACf;AAAA,IACJ;AAAA,IACD,UAAU,QAAQ;AACd,UAAI,KAAK,UAAU,QAAQ;AACvB,aAAK,SAAS;AACd,YAAI,KAAK;AACL,eAAK,iBAAiB,IAAI;AAAA,MACjC;AAAA,IACJ;AAAA,IACD,OAAO,KAAK;AACR,UAAI,KAAK;AACL,aAAK,IAAI,SAAS;AACtB,WAAK,MAAM;AACX,UAAI,SAAS;AAAA,IAChB;AAAA,IACD,IAAI,WAAW;AACX,eAASwC,KAAI,UAAQ;AACjB,YAAI,SAASA,GAAE;AACf,YAAI,CAAC;AACD,iBAAOA;AACX,QAAAA,KAAI;AAAA,MACP;AAAA,IACJ;AAAA,IACD,gBAAgB,MAAM,IAAI,WAAW,YAAY;AAC7C,WAAK,UAAS;AACd,eAASxC,KAAI,MAAMA,KAAI,IAAIA,MAAK;AAC5B,YAAI,QAAQ,KAAK,SAASA,EAAC;AAC3B,YAAI,MAAM,UAAU;AAChB,gBAAM,QAAO;AAAA,MACpB;AACD,WAAK,SAAS,OAAO,MAAM,KAAK,MAAM,GAAG,QAAQ;AACjD,eAASA,KAAI,GAAGA,KAAI,SAAS,QAAQA;AACjC,iBAASA,EAAC,EAAE,UAAU,IAAI;AAAA,IACjC;AAAA,IACD,eAAe,MAAM;AAAE,aAAO;AAAA,IAAQ;AAAA,IACtC,YAAY,QAAQ;AAAE,aAAO;AAAA,IAAQ;AAAA,IACrC,YAAY,MAAM,KAAK,QAAQ;AAC3B,aAAO,IAAI,YAAY,KAAK,UAAU,KAAK,KAAK,SAAS,MAAM;AAAA,IAClE;AAAA,IACD,SAAS,KAAK,OAAO,GAAG;AACpB,aAAO,KAAK,YAAa,EAAC,QAAQ,KAAK,IAAI;AAAA,IAC9C;AAAA,IACD,WAAW;AACP,UAAIM,QAAO,KAAK,YAAY,KAAK,QAAQ,QAAQ,EAAE;AACnD,aAAOA,SAAQ,KAAK,SAAS,SAAS,MAAM,KAAK,SAAS,KAAI,IAAK,MAC/D,KAAK,SAAS,OAAOA,SAAQ,SAAS,KAAK,OAAO,KAAK,UAAU,MAAM,OACtE,KAAK,aAAa,MAAM;AAAA,IAChC;AAAA,IACD,OAAO,IAAI,MAAM;AAAE,aAAO,KAAK;AAAA,IAAS;AAAA,IACxC,IAAI,aAAa;AAAE,aAAO;AAAA,IAAO;AAAA,IACjC,IAAI,WAAW;AAAE,aAAO;AAAA,IAAQ;AAAA,IAChC,IAAI,WAAW;AAAE,aAAO;AAAA,IAAQ;AAAA,IAChC,MAAM,MAAM,IAAI,QAAQ,UAAU,WAAW,SAAS;AAClD,aAAO;AAAA,IACV;AAAA,IACD,OAAO,OAAO;AAAE,aAAO;AAAA,IAAQ;AAAA,IAC/B,YAAY,OAAO;AAAE,aAAO,MAAM,eAAe,KAAK;AAAA,IAAc;AAAA;AAAA;AAAA;AAAA,IAIpE,UAAU;AAAE,aAAO;AAAA,IAAI;AAAA,IACvB,UAAU;AACN,WAAK,SAAS;AAAA,IACjB;AAAA,EACL;AACA,cAAY,UAAU,aAAa;AAEnC,WAAS,KAAK,KAAK;AACf,QAAI,OAAO,IAAI;AACf,QAAI,WAAW,YAAY,GAAG;AAC9B,WAAO;AAAA,EACX;AAAA,EACA,MAAM,YAAY;AAAA,IACd,YAAY,UAAU,KAAKN,IAAG;AAC1B,WAAK,WAAW;AAChB,WAAK,MAAM;AACX,WAAK,IAAIA;AACT,WAAK,MAAM;AAAA,IACd;AAAA,IACD,QAAQ,KAAK,OAAO,GAAG;AACnB,iBAAS;AACL,YAAI,MAAM,KAAK,OAAO,OAAO,KAAK,QAC7B,OAAO,KAAK,KAAK,KAAK,KAAK,KAAK,SAAS,KAAK,IAAI,CAAC,EAAE,aAAa;AACnE,eAAK,MAAM,MAAM,KAAK;AACtB,iBAAO;AAAA,QACV;AACD,YAAI,OAAO,KAAK,SAAS,EAAE,KAAK,CAAC;AACjC,aAAK,OAAO,KAAK,SAAS,KAAK;AAAA,MAClC;AAAA,IACJ;AAAA,EACL;AACA,WAAS,aAAa,QAAQ,OAAO,SAAS,KAAK,OAAO4C,SAAQ,cAAc,WAAW,SAAS;AAChG,QAAI,EAAE,SAAU,IAAG;AACnB,QAAI,SAAS,SAAS,SAAS,SAAS,KAAK,IAAI;AACjD,QAAI,OAAOA,QAAO,SAASA,QAAOA,QAAO,SAAS,CAAC,IAAI;AACvD,QAAI,aAAa,OAAO,KAAK,aAAa;AAE1C,QAAI,SAAS,OAAO,UAAU,CAAC,gBAAgB,CAAC,cAAcA,QAAO,SAAS,KAC1E,OAAO,MAAM,SAAS,OAAOA,QAAO,SAAS,OAAO,MAAM,WAAW,GAAG,WAAW,OAAO;AAC1F;AACJ,QAAI,MAAM,SAAS,QAAQ;AACvB,UAAI,QAAQ,SAAS,GAAG;AAExB,UAAI,SAAS,QAAQ,MAAM,QAAQ;AAG/B,YAAI,SAAS,KAAK;AACd,kBAAQ,MAAM,MAAM,KAAK;AACzB,kBAAQ;AAAA,QACX;AAGD,YAAI,CAAC,cAAc,QAAQ,MAAM,MAAM,GAAG,OAAO,MAAM,MAAM,GAAG,OAAO,GAAG;AACtE,UAAAA,QAAOA,QAAO,SAAS,CAAC,IAAI;AAAA,QAC/B,OACI;AAGD,cAAI;AACA,kBAAM,MAAM,GAAG,OAAO,MAAM,OAAO,GAAG,OAAO;AACjD,UAAAA,QAAO,KAAK,KAAK;AAAA,QACpB;AAAA,MACJ,WACQ,UAAU,QAAQ,UAAU,SAAS,SAAS,MAAM,YAAY;AAGrE,YAAI;AACA,eAAK,aAAa;AAAA;AAElB,yBAAe;AAAA,MACtB;AAGD;AAAA,IACH;AACD,QAAI,QAAQ;AACR,aAAO,aAAa;AACpB,UAAI,UAAU,GAAG;AACb,YAAI,CAAC,gBAAgBA,QAAO,UAAU,OAAO,MAAM,SAAS,OAAO,QAAQA,QAAO,CAAC,GAAG,OAAO,WAAW,CAAC,GAAG;AACxG,iBAAO,aAAaA,QAAO,MAAK,EAAG;AAAA,QACtC,WACQ,UAAU,OAAO,UAAU,OAAO,SAAS,UAAU,OAAO,SAAS,OAAO,SAAS,SAAS,CAAC,EAAE,UAAU,GAAG;AACnH,iBAAO,MAAM,SAAS,OAAO,QAAQ,MAAM,OAAO,WAAW,CAAC;AAAA,QACjE;AACD;AAAA,MACH;AAAA,IACJ;AAED,WAAO,QAAQ,OAAOA,QAAO,QAAQ;AACjC,UAAI,SAAS,MAAM,CAAC,EAAE,OAAOA,QAAOA,QAAO,SAAS,CAAC,CAAC,GAAG;AACrD;AACA,QAAAA,QAAO,IAAG;AACV,kBAAUA,QAAO,SAAS,IAAI;AAAA,MACjC,WACQ,SAAS,KAAK,EAAE,OAAOA,QAAO,CAAC,CAAC,GAAG;AACxC;AACA,QAAAA,QAAO,MAAK;AACZ,oBAAYA,QAAO,SAAS,IAAI;AAAA,MACnC,OACI;AACD;AAAA,MACH;AAAA,IACJ;AACD,QAAI,CAACA,QAAO,UAAU,SAAS,MAAM,SAAS,UAAU,CAAC,SAAS,QAAQ,CAAC,EAAE,cACzE,SAAS,GAAG,EAAE,MAAM,GAAG,GAAG,SAAS,QAAQ,CAAC,GAAG,OAAO,WAAW,OAAO;AACxE;AACJ,QAAI,QAAQ,OAAOA,QAAO;AACtB,aAAO,gBAAgB,OAAO,KAAKA,OAAM;AAAA,EACjD;AACA,WAAS,kBAAkB,QAAQ,MAAM,IAAIA,SAAQ,WAAW,SAAS;AACrE,QAAI,MAAM,OAAO;AACjB,QAAI,EAAE,GAAG,KAAK,KAAK,UAAU,IAAI,QAAQ,IAAI,CAAC;AAC9C,QAAI,EAAE,GAAG,OAAO,KAAK,QAAO,IAAK,IAAI,QAAQ,MAAM,EAAE;AACrD,QAAI,OAAO,OAAO;AAClB,aAAS,QAAQA;AACb,cAAQ,KAAK;AACjB,WAAO,UAAU;AACjB,iBAAa,QAAQ,OAAO,SAAS,KAAK,OAAOA,SAAQ,GAAG,WAAW,OAAO;AAAA,EAClF;AAEA,MAAI,MAAM,OAAO,aAAa,cAAc,YAAY,EAAE,WAAW,IAAI,QAAQ,IAAI,UAAU,GAAE;AACjG,MAAI,MAAM,OAAO,YAAY,cAAc,WAAW,EAAE,iBAAiB,EAAE,OAAO,CAAE,EAAA;AACpF,QAAM,UAAuB,8BAAc,KAAK,IAAI,SAAS;AAC7D,QAAM,YAAyB,0BAAU,KAAK,IAAI,SAAS;AAC3D,QAAM,UAAuB,wDAAwC,KAAK,IAAI,SAAS;AACvF,QAAM,KAAK,CAAC,EAAE,aAAa,WAAW;AACtC,QAAM,QAAQ,CAAC,MAAmB,gCAAgB,KAAK,IAAI,SAAS;AACpE,QAAM,SAAS,CAAC,MAAmB,gCAAgB,KAAK,IAAI,SAAS;AACrE,QAAM,SAAS,yBAAyB,IAAI,gBAAgB;AAC5D,QAAM,SAAS,CAAC,MAAmB,iCAAiB,KAAK,IAAI,MAAM;AACnE,QAAM,MAAM,WAAwB,8BAAc,KAAK,IAAI,SAAS,KAAK,IAAI,iBAAiB;AAC9F,MAAI,UAAU;AAAA,IACV,KAAK,OAAoB,sBAAM,KAAK,IAAI,QAAQ;AAAA,IAChD,SAAsB,sBAAM,KAAK,IAAI,QAAQ;AAAA,IAC7C,OAAoB,4BAAY,KAAK,IAAI,QAAQ;AAAA,IACjD;AAAA,IACA,YAAY,YAAY,IAAI,gBAAgB,IAAI,UAAU,CAAC,QAAQ,CAAC,IAAI,UAAU,CAAC,QAAQ,CAAC,IAAI;AAAA,IAChG;AAAA,IACA,eAAe,QAAQ,EAAe,iCAAiB,KAAK,IAAI,SAAS,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI;AAAA,IAC3F,QAAQ,CAAC,CAAC;AAAA,IACV,gBAAgB,SAAS,CAAC,OAAO,CAAC,IAAI;AAAA,IACtC;AAAA,IACA,SAAsB,4BAAY,KAAK,IAAI,SAAS;AAAA,IACpD;AAAA,IACA;AAAA,IACA,gBAAgB,SAAS,EAAe,uCAAuB,KAAK,UAAU,SAAS,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI;AAAA,IACzG,SAAS,IAAI,gBAAgB,MAAM,WAAW,OAAO,aAAa;AAAA,EACtE;AAEA,QAAM,aAAa;AAAA,EACnB,MAAM,iBAAiB,YAAY;AAAA,IAC/B,YAAY,MAAM;AACd;AACA,WAAK,OAAO;AAAA,IACf;AAAA,IACD,IAAI,SAAS;AAAE,aAAO,KAAK,KAAK;AAAA,IAAS;AAAA,IACzC,UAAU,SAAS;AACf,WAAK,OAAO,WAAW,SAAS,eAAe,KAAK,IAAI,CAAC;AAAA,IAC5D;AAAA,IACD,KAAK,MAAM,OAAO;AACd,UAAI,CAAC,KAAK;AACN,aAAK,UAAS;AAClB,UAAI,KAAK,IAAI,aAAa,KAAK,MAAM;AACjC,YAAI,SAAS,MAAM,QAAQ,KAAK;AAC5B,gBAAM,UAAU;AACpB,aAAK,IAAI,YAAY,KAAK;AAAA,MAC7B;AAAA,IACJ;AAAA,IACD,SAAS,KAAK;AACV,UAAI,IAAI,YAAY;AAChB,aAAK,UAAU,GAAG;AAAA,IACzB;AAAA,IACD,MAAM,MAAM,IAAI,QAAQ;AACpB,UAAI,WAAW,EAAE,kBAAkB,aAAa,KAAK,UAAU,KAAK,QAAQ,OAAO,SAAS;AACxF,eAAO;AACX,WAAK,OAAO,KAAK,KAAK,MAAM,GAAG,IAAI,KAAK,SAAS,OAAO,OAAO,MAAM,KAAK,KAAK,MAAM,EAAE;AACvF,WAAK,UAAS;AACd,aAAO;AAAA,IACV;AAAA,IACD,MAAM,MAAM;AACR,UAAI,SAAS,IAAI,SAAS,KAAK,KAAK,MAAM,IAAI,CAAC;AAC/C,WAAK,OAAO,KAAK,KAAK,MAAM,GAAG,IAAI;AACnC,WAAK,UAAS;AACd,aAAO;AAAA,IACV;AAAA,IACD,gBAAgB,MAAM,QAAQ;AAC1B,aAAO,QAAQ,KAAK,MAAM,SAAS,SAAS,KAAK,KAAK,SAAS;AAAA,IAClE;AAAA,IACD,SAAS,KAAK;AAAE,aAAO,IAAI,OAAO,KAAK,KAAK,GAAG;AAAA,IAAI;AAAA,IACnD,gBAAgB,OAAO,KAAK,QAAQ;AAChC,aAAO,EAAE,MAAM,QAAQ,IAAI,SAAS,KAAK,QAAQ,UAAU,KAAK,KAAK,QAAQ,KAAK,IAAI,YAAW;AAAA,IACpG;AAAA,IACD,SAAS,KAAK,MAAM;AAChB,aAAO,WAAW,KAAK,KAAK,KAAK,IAAI;AAAA,IACxC;AAAA,EACL;AAAA,EACA,MAAM,iBAAiB,YAAY;AAAA,IAC/B,YAAY,MAAM,WAAW,CAAA,GAAI,SAAS,GAAG;AACzC;AACA,WAAK,OAAO;AACZ,WAAK,WAAW;AAChB,WAAK,SAAS;AACd,eAAS,MAAM;AACX,WAAG,UAAU,IAAI;AAAA,IACxB;AAAA,IACD,SAAS,KAAK;AACV,sBAAgB,GAAG;AACnB,UAAI,KAAK,KAAK;AACV,YAAI,YAAY,KAAK,KAAK;AAC9B,UAAI,KAAK,KAAK;AACV,iBAAStC,SAAQ,KAAK,KAAK;AACvB,cAAI,aAAaA,OAAM,KAAK,KAAK,MAAMA,KAAI,CAAC;AACpD,aAAO;AAAA,IACV;AAAA,IACD,SAAS,MAAM;AACX,UAAI,KAAK,YAAY,KAAK,KAAK,QAAQ,eAAe;AAClD,aAAK,OAAO,IAAI;AAChB,aAAK,SAAS,IAAgB;AAAA,MACjC;AAAA,IACJ;AAAA,IACD,KAAK,MAAM,OAAO;AACd,UAAI,CAAC,KAAK;AACN,aAAK,OAAO,KAAK,SAAS,SAAS,cAAc,KAAK,KAAK,OAAO,CAAC,CAAC;AAAA,eAC/D,KAAK,QAAQ;AAClB,aAAK,SAAS,KAAK,GAAG;AAC1B,YAAM,KAAK,MAAM,KAAK;AAAA,IACzB;AAAA,IACD,MAAM,MAAM,IAAI,QAAQ,WAAW,WAAW,SAAS;AACnD,UAAI,WAAW,EAAE,kBAAkB,YAAY,OAAO,KAAK,GAAG,KAAK,IAAI,MAClE,QAAQ,aAAa,KAAO,KAAK,KAAK,UAAU,WAAW;AAC5D,eAAO;AACX,wBAAkB,MAAM,MAAM,IAAI,SAAS,OAAO,WAAW,CAAA,GAAI,YAAY,GAAG,UAAU,CAAC;AAC3F,WAAK,UAAS;AACd,aAAO;AAAA,IACV;AAAA,IACD,MAAM,MAAM;AACR,UAAI,SAAS,CAAE,GAAE,MAAM,GAAG,aAAa,IAAIN,KAAI;AAC/C,eAAS,OAAO,KAAK,UAAU;AAC3B,YAAI,MAAM,MAAM,IAAI;AACpB,YAAI,MAAM;AACN,iBAAO,KAAK,MAAM,OAAO,IAAI,MAAM,OAAO,GAAG,IAAI,GAAG;AACxD,YAAI,aAAa,KAAK,OAAO;AACzB,uBAAaA;AACjB,cAAM;AACN,QAAAA;AAAA,MACH;AACD,UAAI,SAAS,KAAK,SAAS;AAC3B,WAAK,SAAS;AACd,UAAI,aAAa,IAAI;AACjB,aAAK,SAAS,SAAS;AACvB,aAAK,UAAS;AAAA,MACjB;AACD,aAAO,IAAI,SAAS,KAAK,MAAM,QAAQ,MAAM;AAAA,IAChD;AAAA,IACD,SAAS,KAAK;AACV,aAAO,eAAe,MAAM,GAAG;AAAA,IAClC;AAAA,IACD,SAAS,KAAK,MAAM;AAChB,aAAO,iBAAiB,MAAM,KAAK,IAAI;AAAA,IAC1C;AAAA,EACL;AACA,WAAS,WAAW,MAAM,KAAK,MAAM;AACjC,QAAI,SAAS,KAAK,UAAU;AAC5B,QAAI,MAAM;AACN,YAAM;AACV,QAAI,OAAO,KAAK,KAAK,KAAKuE,WAAU;AACpC,QAAI,OAAO,KAAK,OAAO,KAAK,OAAO,UAAU,QAAQ,GAAG;AACpD,UAAI,EAAE,QAAQ,UAAU,QAAQ,QAAQ;AACpC,YAAI,KAAK;AACL;AACA,UAAAA,WAAU;AAAA,QACb,WACQ,KAAK,QAAQ;AAClB;AACA,UAAAA,WAAU;AAAA,QACb;AAAA,MACJ;AAAA,IACJ,OACI;AACD,UAAI,OAAO;AACP;AAAA,eACK,KAAK;AACV;AAAA,IACP;AACD,QAAI,QAAQ,UAAU,MAAM,MAAM,EAAE,EAAE;AACtC,QAAI,CAAC,MAAM;AACP,aAAO;AACX,QAAI,OAAO,OAAOA,WAAUA,WAAU,IAAI,QAAQ,KAAK,IAAI,MAAM,SAAS,CAAC;AAC3E,QAAI,QAAQ,UAAU,CAACA,YAAW,KAAK,SAAS;AAC5C,aAAO,MAAM,UAAU,KAAK,KAAK,OAAO,CAAApD,OAAKA,GAAE,KAAK,KAAK;AAC7D,WAAOoD,WAAU,YAAY,MAAMA,WAAU,CAAC,IAAI,QAAQ;AAAA,EAC9D;AAAA,EAEA,MAAM,mBAAmB,YAAY;AAAA,IACjC,YAAY,QAAQ,QAAQ,MAAM;AAC9B;AACA,WAAK,SAAS;AACd,WAAK,SAAS;AACd,WAAK,OAAO;AACZ,WAAK,aAAa;AAAA,IACrB;AAAA,IACD,OAAO,OAAO,QAAQ,QAAQ,MAAM;AAChC,aAAO,KAAK,OAAO,cAAc,YAAY,QAAQ,QAAQ,IAAI;AAAA,IACpE;AAAA,IACD,MAAM,MAAM;AACR,UAAI,SAAS,WAAW,OAAO,KAAK,QAAQ,KAAK,SAAS,MAAM,KAAK,IAAI;AACzE,WAAK,UAAU;AACf,aAAO;AAAA,IACV;AAAA,IACD,KAAK,MAAM;AACP,UAAI,CAAC,KAAK,OAAO,CAAC,KAAK,OAAO,UAAU,KAAK,KAAK,IAAI,GAAG;AACrD,YAAI,KAAK,OAAO,KAAK;AACjB,eAAK,WAAW,QAAQ,KAAK,GAAG;AACpC,aAAK,aAAa;AAClB,aAAK,OAAO,KAAK,OAAO,MAAM,IAAI,CAAC;AACnC,aAAK,IAAI,kBAAkB;AAAA,MAC9B;AAAA,IACJ;AAAA,IACD,UAAU;AAAE,aAAO,KAAK;AAAA,IAAO;AAAA,IAC/B,MAAM,MAAM,IAAI,QAAQ,UAAU,WAAW,SAAS;AAClD,UAAI,WAAW,EAAE,kBAAkB,eAAe,CAAC,KAAK,OAAO,QAAQ,OAAO,MAAM,KAChF,OAAO,KAAK,aAAa,KAAK,KAAK,KAAK,UAAU,WAAW;AAC7D,eAAO;AACX,WAAK,SAAS,QAAQ,SAAS,OAAO,SAAS,MAAM,KAAK,SAAS;AACnE,aAAO;AAAA,IACV;AAAA,IACD,OAAO,OAAO;AACV,UAAI,iBAAiB,cAAc,MAAM,QAAQ,KAAK,QAClD,KAAK,OAAO,eAAe,MAAM,OAAO,aAAa;AACrD,YAAI,CAAC,KAAK,OAAO,QAAQ,MAAM,MAAM;AACjC,eAAK,UAAU,IAAI;AACvB,YAAI,KAAK,OAAO,CAAC,KAAK;AAClB,eAAK,aAAa,KAAK;AAC3B,aAAK,SAAS,MAAM;AACpB,aAAK,SAAS,MAAM;AACpB,eAAO;AAAA,MACV;AACD,aAAO;AAAA,IACV;AAAA,IACD,iBAAiB;AAAE,aAAO;AAAA,IAAO;AAAA,IACjC,YAAY,OAAO;AAAE,aAAO,KAAK,OAAO,YAAY,KAAK;AAAA,IAAI;AAAA,IAC7D,IAAI,kBAAkB;AAClB,UAAI,KAAK,UAAU;AACf,eAAO,KAAK;AAChB,UAAIhC,OAAM;AACV,aAAOA,KAAI;AACP,QAAAA,OAAMA,KAAI;AACd,UAAI,EAAE,KAAI,IAAKA,MAAK,OAAO,QAAQ,KAAK,MAAM,KAAK,QAAQ,KAAK;AAChE,aAAO,OAAO,KAAK,MAAM,OAAO,QAAQ,KAAK,MAAM,IAAI,KAAK;AAAA,IAC/D;AAAA,IACD,SAAS,KAAK;AACV,cAAQ,KAAK,SAAS,OAAO,IAAI,KAAK,OAAO,KACvC,OAAO,OAAO,KAAK,GAAG,IACtB,OAAO,MAAM,KAAK,KAAK,OAAO,KAAK,MAAM;AAAA,IAClD;AAAA,IACD,kBAAkB;AAAE,aAAO;AAAA,IAAO;AAAA,IAClC,SAAS,KAAK,MAAM;AAChB,UAAI,SAAS,KAAK,OAAO,SAAS,KAAK,KAAK,KAAK,IAAI;AACrD,UAAI;AACA,eAAO;AACX,UAAI,QAAQ,KAAK,IAAI,eAAgB,GAAE,OAAO;AAC9C,UAAI,CAAC,MAAM;AACP,eAAO;AACX,UAAI,WAAW,KAAK,OAAO,KAAK,OAAO,IAAI,MAAM;AACjD,eAASvC,KAAI,WAAW,MAAM,SAAS,IAAI,KAAIA,MAAM,WAAW,KAAK,GAAI;AACrE,eAAO,MAAMA,EAAC;AACd,YAAI,MAAM,IAAIA,MAAK,IAAIA,MAAK,MAAM,SAAS,KAAK,KAAK,MAAM,KAAK;AAC5D;AAAA,MACP;AACD,aAAO,YAAY,MAAM,CAAC,QAAQ;AAAA,IACrC;AAAA,IACD,IAAI,aAAa;AAAE,aAAO;AAAA,IAAQ;AAAA,IAClC,IAAI,WAAW;AAAE,aAAO;AAAA,IAAO;AAAA,IAC/B,IAAI,WAAW;AAAE,aAAO,KAAK,OAAO;AAAA,IAAW;AAAA,IAC/C,UAAU;AACN,YAAM,QAAO;AACb,UAAI,KAAK;AACL,aAAK,OAAO,QAAQ,KAAK,GAAG;AAAA,IACnC;AAAA,EACL;AAAA,EACA,MAAM,wBAAwB,WAAW;AAAA,IACrC,SAAS,KAAK;AACV,UAAI,EAAE,SAAS,SAAS,KAAK;AAC7B,UAAI,CAAC;AACD,eAAO,IAAI,OAAO,MAAM,KAAK,IAAI,KAAK,KAAK,UAAU,MAAM,CAAC;AAChE,aAAO,oBAAoB,KAAK,GAAG,SAAS,MAAM,KAAK,SAAS,QAAQ,QAAQ,CAACwC,IAAGpB,OAAMoB,GAAE,SAASpB,EAAC,GAAG,CAACoD,OAAMpD,OAAM,IAAI,OAAOoD,OAAM,KAAK,IAAIpD,IAAGoD,MAAK,UAAU,MAAM,CAAC,CAAC;AAAA,IAC7K;AAAA,IACD,OAAO;AAAE,WAAK,OAAO,KAAK,OAAO,MAAO,CAAA;AAAA,IAAI;AAAA,IAC5C,gBAAgB,MAAM,QAAQ;AAC1B,UAAI,EAAE,SAAS,SAAS,KAAK;AAC7B,UAAI,CAAC;AACD,eAAO,KAAK,IAAI,QAAQ,KAAK,MAAM;AACvC,aAAO,4BAA4B,MAAM,QAAQ,SAAS,MAAM,KAAK,SAAS,QAAQ,MAAM;AAAA,IAC/F;AAAA,IACD,iBAAiB;AAAE,aAAO;AAAA,IAAQ;AAAA,IAClC,IAAI,kBAAkB;AAAE,aAAO;AAAA,IAAO;AAAA,IACtC,SAAS,KAAK,MAAM;AAChB,UAAI,EAAE,SAAS,SAAS,KAAK;AAC7B,UAAI,CAAC;AACD,eAAO,WAAW,MAAM,KAAK,IAAI;AACrC,aAAO,oBAAoB,KAAK,MAAM,SAAS,MAAM,KAAK,SAAS,QAAQ,QAAQ,CAAChC,IAAGiC,MAAKC,UAASlC,GAAE,SAASiC,MAAKC,KAAI,GAAG,CAACF,OAAMC,MAAKC,UAAS,WAAWF,OAAMC,MAAKC,KAAI,CAAC;AAAA,IAC/K;AAAA,IACD,UAAU;AACN,UAAIxD;AACJ,YAAM,QAAO;AACb,OAACA,MAAK,KAAK,OAAO,aAAa,QAAQA,QAAO,SAAS,SAASA,IAAG,QAAO;AAAA,IAC7E;AAAA,IACD,IAAI,aAAa;AAAE,aAAO;AAAA,IAAO;AAAA,IACjC,cAAc;AAAE,aAAO;AAAA,IAAO;AAAA,EAClC;AAIA,WAAS,oBAAoB,KAAK,MAAM,MAAM,MAAM,MAAM,WAAW,UAAU;AAC3E,QAAI,gBAAgB,UAAU;AAC1B,eAAS,QAAQ,KAAK,IAAI,YAAY,OAAO,QAAQ,MAAM,aAAa;AACpE,YAAI,OAAO,YAAY,IAAI,KAAK;AAChC,YAAI,CAAC,MAAM;AACP,cAAI,QAAQ,oBAAoB,KAAK,MAAM,OAAO,QAAQ;AAC1D,cAAI,OAAO,SAAS;AAChB,mBAAO;AACX,gBAAM;AAAA,QACT,OACI;AACD,cAAI,UAAU,SAAS,OAAO,IAAI;AAClC,cAAI,MAAM,KAAK,UAAU,UAAU,OAAO;AAC1C,cAAI,MAAM,OAAO,OAAO,OAAO,KAAK,QAAO,KAAM;AAC7C,mBAAO,UAAU,oBAAoB,KAAK,MAAM,MAAM,MAAM,MAAM,WAAW,QAAQ,IAAI,UAAU,MAAM,KAAK,IAAI;AACtH,iBAAO;AAAA,QACV;AAAA,MACJ;AACD,aAAO,UAAU,MAAM,KAAK,QAAQ,EAAE;AAAA,IACzC,WACQ,KAAK,OAAO,MAAM;AACvB,aAAO,SAAS,MAAM,KAAK,IAAI;AAAA,IAClC,OACI;AACD,aAAO,UAAU,MAAM,KAAK,IAAI;AAAA,IACnC;AAAA,EACL;AACA,WAAS,oBAAoB,KAAK,MAAM,MAAM,UAAU;AACpD,QAAI,KAAK,YAAY,GAAG;AACpB,UAAI,MAAM,KAAK,UAAU;AACzB,UAAI,OAAO;AACP,eAAO,SAAS,MAAM,KAAK,IAAI;AACnC,aAAO;AAAA,IACV,WACQ,KAAK,YAAY,KAAK,KAAK,mBAAmB,SAAS;AAC5D,eAAS,QAAQ,KAAK,YAAY,OAAO,QAAQ,MAAM,aAAa;AAChE,YAAI,QAAQ,oBAAoB,KAAK,MAAM,OAAO,QAAQ;AAC1D,YAAI,OAAO,SAAS;AAChB,iBAAO;AACX,cAAM;AAAA,MACT;AAAA,IACJ;AACD,WAAO;AAAA,EACX;AACA,WAAS,4BAA4B,MAAM,QAAQ,MAAM,MAAM,MAAM;AACjE,QAAI,gBAAgB,UAAU;AAC1B,UAAI,MAAM;AACV,eAAS,QAAQ,KAAK,IAAI,YAAY,OAAO,QAAQ,MAAM,aAAa;AACpE,YAAI,YAAY,YAAY,IAAI,KAAK;AACrC,YAAI,WAAW;AACX,cAAI,UAAU,SAAS,OAAO,IAAI;AAClC,cAAI,SAAS,OAAO,IAAI;AACpB,mBAAO,OAAO,UAAU,4BAA4B,MAAM,QAAQ,WAAW,MAAM,IAAI,IACjF,UAAU,gBAAgB,MAAM,MAAM;AAChD,iBAAO,UAAU,UAAU,UAAU,OAAO;AAAA,QAC/C,OACI;AACD,cAAI,QAAQ,uBAAuB,MAAM,QAAQ,KAAK;AACtD,cAAI,MAAM,UAAU;AAChB,mBAAO,MAAM,MAAM;AACvB,iBAAO,MAAM;AAAA,QAChB;AAAA,MACJ;AAAA,IACJ,WACQ,KAAK,OAAO,MAAM;AACvB,aAAO,KAAK,IAAI,QAAQ,KAAK,UAAU,MAAM;AAAA,IAChD;AACD,WAAO,KAAK,gBAAgB,MAAM,MAAM;AAAA,EAC5C;AACA,WAAS,uBAAuB,MAAM,QAAQ,QAAQ;AAClD,QAAI,OAAO,YAAY,GAAG;AACtB,aAAO,QAAQ,SAAS,EAAE,QAAQ,OAAM,IAAK,EAAE,MAAM,OAAO,UAAU;IACzE,WACQ,OAAO,YAAY,KAAK,OAAO,mBAAmB,SAAS;AAChE,UAAI,MAAM;AACV,eAAS,QAAQ,OAAO,YAAYlB,KAAI,KAAI,QAAQ,MAAM,aAAaA,MAAK;AACxE,YAAI,QAAQ,UAAUA,MAAK;AACvB,iBAAO,EAAE,QAAQ;AACrB,YAAI,CAAC;AACD,iBAAO,EAAE,MAAM;AACnB,YAAI,QAAQ,uBAAuB,MAAM,QAAQ,KAAK;AACtD,YAAI,MAAM,UAAU;AAChB,iBAAO,EAAE,QAAQ,SAAS,MAAM,OAAM;AAC1C,eAAO,MAAM;AAAA,MAChB;AAAA,IACJ,OACI;AACD,aAAO,OAAO,SAAS,IAAI,IAAI,EAAE,QAAQ,MAAM,EAAE,MAAM;IAC1D;AAAA,EACL;AAAA,EAIA,MAAM,yBAAyB,YAAY;AAAA,IACvC,YAAY,MAAM;AACd;AACA,WAAK,OAAO;AAAA,IACf;AAAA,IACD,IAAI,SAAS;AAAE,aAAO;AAAA,IAAI;AAAA,IAC1B,QAAQ;AAAE,aAAO;AAAA,IAAQ;AAAA,IACzB,OAAO,OAAO;AACV,aAAO,iBAAiB,oBAAoB,MAAM,QAAQ,KAAK;AAAA,IAClE;AAAA,IACD,QAAQ;AAAE,aAAO,IAAI,iBAAiB,KAAK,IAAI;AAAA,IAAI;AAAA,IACnD,OAAO;AACH,UAAI,CAAC,KAAK,KAAK;AACX,YAAI,MAAM,SAAS,cAAc,KAAK;AACtC,YAAI,YAAY;AAChB,YAAI,aAAa,eAAe,MAAM;AACtC,aAAK,OAAO,GAAG;AAAA,MAClB;AAAA,IACJ;AAAA,IACD,UAAU;AAAE,aAAO,KAAK;AAAA,IAAO;AAAA,IAC/B,SAAS,KAAK;AAAE,aAAO,KAAK,OAAO,IAAI,OAAO,OAAO,KAAK,GAAG,IAAI,OAAO,MAAM,KAAK,GAAG;AAAA,IAAI;AAAA,IAC1F,kBAAkB;AAAE,aAAO;AAAA,IAAI;AAAA,IAC/B,kBAAkB;AAAE,aAAO;AAAA,IAAO;AAAA,IAClC,SAAS,KAAK;AACV,aAAO,KAAK,IAAI;IACnB;AAAA,IACD,IAAI,kBAAkB;AAClB,aAAO,KAAK;AAAA,IACf;AAAA,IACD,IAAI,WAAW;AAAE,aAAO;AAAA,IAAO;AAAA,EACnC;AACA,WAAS,UAAU,WAAW,WAAW,UAAU,WAAW,iBAAiB,UAAU,WAAW;AACpG,WAAS,eAAe,QAAQ,KAAK;AACjC,QAAI,MAAM,OAAO,KAAK,EAAE,SAAQ,IAAK,QAAQA,KAAI;AACjD,aAAS,MAAM,GAAGA,KAAI,SAAS,QAAQA,MAAK;AACxC,UAAI,QAAQ,SAASA,EAAC,GAAG,MAAM,MAAM,MAAM;AAC3C,UAAI,OAAO,OAAO,MAAM,QAAS,KAAI;AACjC;AACJ,UAAI,MAAM,OAAO,MAAM,OAAO,MAAM,IAAI,cAAc;AAClD,eAAO,MAAM,SAAS,MAAM,GAAG;AACnC,UAAI,OAAO;AACP;AACJ,YAAM;AAAA,IACT;AACD,aAAS,IAAIA,IAAG,IAAI,GAAG,KAAK;AACxB,UAAI,OAAO,SAAS,IAAI,CAAC;AACzB,UAAI,KAAK,IAAI,cAAc;AACvB,eAAO,KAAK,SAAS,KAAK,MAAM;AAAA,IACvC;AACD,aAAS,IAAIA,IAAG,IAAI,SAAS,QAAQ,KAAK;AACtC,UAAI,OAAO,SAAS,CAAC;AACrB,UAAI,KAAK,IAAI,cAAc;AACvB,eAAO,KAAK,SAAS,CAAC;AAAA,IAC7B;AACD,WAAO,IAAI,OAAO,KAAK,CAAC;AAAA,EAC5B;AAEA,WAAS,eAAe,QAAQ,MAAM,MAAM;AACxC,QAAI,MAAM,EAAE,SAAU,IAAG;AACzB,QAAI,OAAO,KAAK,gBAAgB,YAAY,SAAS,WAChD,OAAO,SAAS,SAAS,SAAS,CAAC,cAAc,YAAY,KAAK,KAAK,GAAG,KAAK,IAAI,GAAG;AACvF,qBAAe,MAAM,KAAK,SAAS,CAAC,GAAG,OAAO,CAAC;AAAA,IAClD,OACI;AACD,eAAS,KAAK,IAAI;AAClB,WAAK,UAAU,MAAM;AAAA,IACxB;AACD,WAAO,UAAU,KAAK;AAAA,EAC1B;AACA,WAAS,iBAAiB,MAAM,KAAK,MAAM;AACvC,QAAI,SAAS,MAAM,YAAY,IAAI,QAAQ,MAAM,WAAW;AAC5D,aAAS,KAAK2E,OAAMF,MAAK;AACrB,eAASzE,KAAI,GAAG,MAAM,GAAGA,KAAI2E,MAAK,SAAS,UAAU,OAAOF,MAAKzE,MAAK;AAClE,YAAI,QAAQ2E,MAAK,SAAS3E,EAAC,GAAG,MAAM,MAAM,MAAM;AAChD,YAAI,OAAOyE,MAAK;AACZ,cAAI,MAAM,SAAS,QAAQ;AACvB,iBAAK,OAAOA,OAAM,GAAG;AAAA,UACxB,YACS,CAAC,SAAS,MAAM,YAAY,OAAO,OACxC,MAAMA,QAAO,OAAO,OAAO,MAAM,QAAO,IAAK,IAAI;AAClD,oBAAQ;AACR,uBAAWA,OAAM;AAAA,UACpB,WACQ,MAAMA,QAAQ,OAAO,OAAO,MAAM,YAAY,KAAM,CAAC,MAAM,UAAU;AAC1E,qBAAS;AACT,wBAAYA,OAAM;AAAA,UACrB;AAAA,QACJ;AACD,cAAM;AAAA,MACT;AAAA,IACJ;AACD,SAAK,MAAM,GAAG;AACd,QAAI,UAAU,OAAO,IAAI,SAAS,UAAU,UAAU;AACtD,QAAI;AACA,aAAO,OAAO,SAAS,KAAK,IAAI,GAAG,UAAU,SAAS,YAAY,QAAQ,GAAG,IAAI;AACrF,WAAO,aAAa,IAAI;AAAA,EAC5B;AACA,WAAS,aAAa,MAAM;AACxB,QAAI,OAAO,KAAK,IAAI;AACpB,QAAI,CAAC;AACD,aAAO,KAAK,IAAI;AACpB,QAAI,QAAQ,eAAe,IAAI;AAC/B,WAAO,MAAM,MAAM,SAAS,CAAC,KAAK;AAAA,EACtC;AAEA,WAAS,aAAa,QAAQ,QAAQ;AAClC,aAASnE,SAAQ,QAAQ;AACrB,UAAIA,SAAQ,WAAW,OAAO;AAC1B,eAAO,SAAS,MAAM,OAAO;AAAA,eACxBA,SAAQ,WAAW,OAAO;AAC/B,eAAO,SAAS,MAAM,OAAO;AAAA;AAE7B,eAAOA,KAAI,IAAI,OAAOA,KAAI;AAAA,IACjC;AACD,WAAO;AAAA,EACX;AACA,WAAS,QAAQX,IAAGsB,IAAG;AACnB,QAAItB,MAAKsB;AACL,aAAO;AACX,QAAI,CAACtB,MAAK,CAACsB;AACP,aAAO;AACX,QAAI,QAAQ,OAAO,KAAKtB,EAAC,GAAG,QAAQ,OAAO,KAAKsB,EAAC;AACjD,QAAI,MAAM,UAAU,MAAM;AACtB,aAAO;AACX,aAAS,OAAO,OAAO;AACnB,UAAI,MAAM,QAAQ,GAAG,KAAK,MAAMtB,GAAE,GAAG,MAAMsB,GAAE,GAAG;AAC5C,eAAO;AAAA,IACd;AACD,WAAO;AAAA,EACX;AACA,WAAS,YAAY,KAAK,MAAM,OAAO;AACnC,QAAI,UAAU;AACd,QAAI;AACA,eAASX,SAAQ;AACb,YAAI,EAAE,SAASA,SAAQ;AACnB,cAAI,gBAAgB,UAAUA,KAAI;AAAA;AAC9C,QAAI;AACA,eAASA,SAAQ;AACb,YAAI,EAAE,QAAQ,KAAKA,KAAI,KAAK,MAAMA,KAAI;AAClC,cAAI,aAAa,UAAUA,OAAM,MAAMA,KAAI,CAAC;AAAA;AACxD,WAAO,CAAC,CAAC;AAAA,EACb;AAAA,EASA,MAAM,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAUb,GAAG,QAAQ;AAAE,aAAO;AAAA,IAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQ5B,UAAU,KAAK,MAAM;AAAE,aAAO;AAAA,IAAQ;AAAA;AAAA;AAAA;AAAA,IAItC,QAAQ,OAAO;AACX,aAAO,QAAQ,SAAS,KAAK,eAAe,MAAM,eAAe,KAAK,GAAG,KAAK;AAAA,IACjF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOD,IAAI,kBAAkB;AAAE,aAAO;AAAA,IAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOpC,IAAI,aAAa;AAAE,aAAO;AAAA,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAM9B,YAAY,OAAO;AAAE,aAAO;AAAA,IAAO;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQnC,SAAS,KAAK,KAAK,MAAM;AAAE,aAAO;AAAA,IAAO;AAAA;AAAA;AAAA;AAAA,IAIzC,IAAI,aAAa;AAAE,aAAO;AAAA,IAAO;AAAA;AAAA;AAAA;AAAA,IAIjC,IAAI,WAAW;AAAE,aAAO;AAAA,IAAQ;AAAA;AAAA;AAAA;AAAA;AAAA,IAKhC,QAAQ,KAAK;AAAA,IAAG;AAAA,EACpB;AAIA,MAAI,YAA0B,yBAAUsE,YAAW;AAI/C,IAAAA,WAAUA,WAAU,MAAM,IAAI,CAAC,IAAI;AAInC,IAAAA,WAAUA,WAAU,cAAc,IAAI,CAAC,IAAI;AAI3C,IAAAA,WAAUA,WAAU,aAAa,IAAI,CAAC,IAAI;AAI1C,IAAAA,WAAUA,WAAU,aAAa,IAAI,CAAC,IAAI;AAC9C,WAAOA;AAAA,EAAS,EAAG,cAAc,YAAY,CAAA,EAAG;AAAA,EAOhD,MAAM,mBAAmB,WAAW;AAAA,IAChC,YAIA,WAIA,SAIA,QAMA,MAAM;AACF;AACA,WAAK,YAAY;AACjB,WAAK,UAAU;AACf,WAAK,SAAS;AACd,WAAK,OAAO;AAAA,IACf;AAAA;AAAA;AAAA;AAAA,IAID,IAAI,iBAAiB;AAAE,aAAO;AAAA,IAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAUtC,OAAO,KAAK,MAAM;AACd,aAAO,IAAI,eAAe,IAAI;AAAA,IACjC;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,OAAO,OAAO,MAAM;AAChB,UAAI,OAAO,KAAK,IAAI,MAAQ,KAAK,IAAI,KAAO,KAAK,QAAQ,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,KAAK;AAC7E,cAAS,SAAS,CAAC,KAAK,cACjB,OAAO,IAAI,MAA6B,OACxC,OAAO,IAAI,MAA8B;AAChD,aAAO,IAAI,gBAAgB,MAAM,MAAM,MAAM,OAAO,KAAK,UAAU,MAAM,KAAK;AAAA,IACjF;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,OAAO,QAAQ,MAAM;AACjB,UAAI,QAAQ,CAAC,CAAC,KAAK,OAAO,WAAW;AACrC,UAAI,KAAK,YAAY;AACjB,oBAAY;AACZ,kBAAU;AAAA,MACb,OACI;AACD,YAAI,EAAE,OAAO,IAAG,IAAK,aAAa,MAAM,KAAK;AAC7C,qBAAa,QAAS,QAAQ,OAAiC,KAA2B,OAA+B;AACzH,mBAAW,MAAO,QAAQ,MAA8B,IAAwB,QAA8B;AAAA,MACjH;AACD,aAAO,IAAI,gBAAgB,MAAM,WAAW,SAAS,OAAO,KAAK,UAAU,MAAM,IAAI;AAAA,IACxF;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,OAAO,KAAK,MAAM;AACd,aAAO,IAAI,eAAe,IAAI;AAAA,IACjC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMD,OAAO,IAAI,IAAI,OAAO,OAAO;AACzB,aAAO,SAAS,GAAG,IAAI,IAAI;AAAA,IAC9B;AAAA;AAAA;AAAA;AAAA,IAID,YAAY;AAAE,aAAO,KAAK,SAAS,KAAK,OAAO,kBAAkB,KAAK;AAAA,IAAQ;AAAA,EAClF;AAIA,aAAW,OAAO,SAAS;AAAA,EAC3B,MAAM,uBAAuB,WAAW;AAAA,IACpC,YAAY,MAAM;AACd,UAAI,EAAE,OAAO,IAAK,IAAG,aAAa,IAAI;AACtC,YAAM,QAAQ,KAA0B,KAA6B,MAAM,IAAuB,MAA4B,MAAM,IAAI;AACxI,WAAK,UAAU,KAAK,WAAW;AAC/B,WAAK,QAAQ,KAAK,SAAS;AAC3B,WAAK,QAAQ,KAAK,cAAc;AAAA,IACnC;AAAA,IACD,GAAG,OAAO;AACN,aAAO,QAAQ,SACX,iBAAiB,kBACb,KAAK,WAAW,MAAM,WACtB,KAAK,SAAS,MAAM,SACpB,QAAQ,KAAK,OAAO,MAAM,KAAK;AAAA,IAC1C;AAAA,IACD,MAAM,MAAM,KAAK,MAAM;AACnB,UAAI,QAAQ;AACR,cAAM,IAAI,WAAW,mCAAmC;AAC5D,aAAO,MAAM,MAAM,MAAM,EAAE;AAAA,IAC9B;AAAA,EACL;AACA,iBAAe,UAAU,QAAQ;AAAA,EACjC,MAAM,uBAAuB,WAAW;AAAA,IACpC,YAAY,MAAM;AACd,YAAM,MAAuB,MAAuB,MAAM,IAAI;AAAA,IACjE;AAAA,IACD,GAAG,OAAO;AACN,aAAO,iBAAiB,kBACpB,KAAK,KAAK,SAAS,MAAM,KAAK,SAC9B,QAAQ,KAAK,KAAK,YAAY,MAAM,KAAK,UAAU;AAAA,IAC1D;AAAA,IACD,MAAM,MAAM,KAAK,MAAM;AACnB,UAAI,MAAM;AACN,cAAM,IAAI,WAAW,4CAA4C;AACrE,aAAO,MAAM,MAAM,MAAM,EAAE;AAAA,IAC9B;AAAA,EACL;AACA,iBAAe,UAAU,UAAU,QAAQ;AAC3C,iBAAe,UAAU,QAAQ;AAAA,EACjC,MAAM,wBAAwB,WAAW;AAAA,IACrC,YAAY,MAAM,WAAW,SAAS,OAAO,QAAQ,WAAW;AAC5D,YAAM,WAAW,SAAS,QAAQ,IAAI;AACtC,WAAK,QAAQ;AACb,WAAK,YAAY;AACjB,WAAK,UAAU,CAAC,QAAQ,QAAQ,WAAW,aAAa,IAAI,QAAQ,cAAc,QAAQ;AAAA,IAC7F;AAAA;AAAA,IAED,IAAI,OAAO;AACP,aAAO,KAAK,YAAY,KAAK,UAAU,UAAU,cAC3C,KAAK,aAAa,IAAI,UAAU,eAAe,UAAU;AAAA,IAClE;AAAA,IACD,IAAI,iBAAiB;AACjB,aAAO,KAAK,SAAS,CAAC,CAAC,KAAK,WAAW,KAAK,OAAO,mBAAmB,KAAK,KAAK,OAAO,aAAa;AAAA,IACvG;AAAA,IACD,GAAG,OAAO;AACN,aAAO,iBAAiB,mBACpB,UAAU,KAAK,QAAQ,MAAM,MAAM,KACnC,KAAK,SAAS,MAAM,SACpB,KAAK,aAAa,MAAM,aAAa,KAAK,WAAW,MAAM;AAAA,IAClE;AAAA,IACD,MAAM,MAAM,KAAK,MAAM;AACnB,UAAI,KAAK,cAAc,OAAO,MAAO,QAAQ,MAAM,KAAK,YAAY,KAAK,KAAK,WAAW;AACrF,cAAM,IAAI,WAAW,0CAA0C;AACnE,UAAI,CAAC,KAAK,aAAa,MAAM;AACzB,cAAM,IAAI,WAAW,qDAAqD;AAC9E,aAAO,MAAM,MAAM,MAAM,EAAE;AAAA,IAC9B;AAAA,EACL;AACA,kBAAgB,UAAU,QAAQ;AAClC,WAAS,aAAa,MAAM,QAAQ,OAAO;AACvC,QAAI,EAAE,gBAAgB,OAAO,cAAc,IAAG,IAAK;AACnD,QAAI,SAAS;AACT,cAAQ,KAAK;AACjB,QAAI,OAAO;AACP,YAAM,KAAK;AACf,WAAO,EAAE,OAAO,UAAU,QAAQ,UAAU,SAAS,QAAQ,OAAO,KAAK,QAAQ,QAAQ,QAAQ,SAAS,MAAM;EACpH;AACA,WAAS,UAAUjF,IAAGsB,IAAG;AACrB,WAAOtB,MAAKsB,MAAK,CAAC,EAAEtB,MAAKsB,MAAKtB,GAAE,QAAQsB,EAAC;AAAA,EAC7C;AACA,WAAS,SAAS,MAAM,IAAI,QAAQ,SAAS,GAAG;AAC5C,QAAI,OAAO,OAAO,SAAS;AAC3B,QAAI,QAAQ,KAAK,OAAO,IAAI,IAAI,UAAU;AACtC,aAAO,IAAI,IAAI,KAAK,IAAI,OAAO,IAAI,GAAG,EAAE;AAAA;AAExC,aAAO,KAAK,MAAM,EAAE;AAAA,EAC5B;AAAA,EAEA,MAAM,iBAAiB,YAAY;AAAA,IAC/B,cAAc;AACV,YAAM,GAAG,SAAS;AAClB,WAAK,WAAW;AAChB,WAAK,SAAS;AACd,WAAK,YAAY;AACjB,WAAK,QAAQ;AACb,WAAK,aAAa;AAAA,IACrB;AAAA;AAAA,IAED,MAAM,MAAM,IAAI,QAAQ,UAAU,WAAW,SAAS;AAClD,UAAI,QAAQ;AACR,YAAI,EAAE,kBAAkB;AACpB,iBAAO;AACX,YAAI,CAAC,KAAK;AACN,iBAAO,YAAY,IAAI;AAAA,MAC9B;AACD,UAAI;AACA,aAAK,QAAQ,SAAS,OAAO,QAAQ,IAAI;AAC7C,wBAAkB,MAAM,MAAM,IAAI,SAAS,OAAO,WAAW,CAAE,GAAE,WAAW,OAAO;AACnF,aAAO;AAAA,IACV;AAAA,IACD,MAAM,IAAI;AACN,UAAI,MAAM,IAAI;AACd,UAAI,aAAa,KAAK;AACtB,UAAI,KAAK,UAAU;AACf,eAAO;AACX,UAAI,EAAE,GAAAjB,IAAG,IAAG,IAAK,KAAK,SAAS,EAAE;AACjC,UAAI,KAAK;AACL,YAAI,OAAO,KAAK,SAASA,EAAC,EAAE,MAAM,GAAG,GAAG,CAAC;AACzC,aAAK,SAASA,EAAC,EAAE,MAAM,KAAK,KAAK,SAASA,EAAC,EAAE,QAAQ,MAAM,OAAO,GAAG,CAAC;AACtE,QAAAA;AAAA,MACH;AACD,eAAS,IAAIA,IAAG,IAAI,KAAK,SAAS,QAAQ;AACtC,YAAI,OAAO,KAAK,SAAS,CAAC,GAAG,CAAC;AAClC,aAAOA,KAAI,KAAK,KAAK,SAASA,KAAI,CAAC,EAAE,UAAU;AAC3C,aAAK,SAAS,EAAEA,EAAC,EAAE,QAAO;AAC9B,WAAK,SAAS,SAASA;AACvB,WAAK,UAAS;AACd,WAAK,SAAS;AACd,aAAO;AAAA,IACV;AAAA,IACD,YAAY,OAAO;AACf,UAAI,CAAC,KAAK;AACN;AACJ,WAAK,UAAS;AACd,YAAM,OAAO,KAAK,GAAG;AACrB,YAAM,YAAY,KAAK,cAAc,SAAY,KAAK,QAAQ,KAAK;AACnE,WAAK,YAAY;AACjB,WAAK,MAAM;AAAA,IACd;AAAA,IACD,QAAQ,OAAO;AACX,UAAI,CAAC,QAAQ,KAAK,OAAO,KAAK,GAAG;AAC7B,YAAI,KAAK,KAAK;AACV,eAAK,YAAY,KAAK;AACtB,eAAK,UAAS;AAAA,QACjB;AACD,aAAK,QAAQ;AAAA,MAChB;AAAA,IACJ;AAAA,IACD,OAAO,OAAO,WAAW;AACrB,qBAAe,MAAM,OAAO,SAAS;AAAA,IACxC;AAAA;AAAA,IAED,YAAY,MAAM;AACd,UAAI,QAAQ,KAAK,KAAK,YAAY,MAAM,KAAK,KAAK;AAClD,UAAI;AACA,aAAK,QAAQ,aAAa,OAAO,KAAK,SAAS,CAAA,CAAE;AACrD,UAAI;AACA,aAAK,QAAQ,aAAa,EAAE,OAAO,IAAG,GAAI,KAAK,SAAS,CAAA,CAAE;AAAA,IACjE;AAAA,IACD,SAAS,KAAK;AACV,aAAO,eAAe,MAAM,GAAG;AAAA,IAClC;AAAA,IACD,SAAS,MAAM;AACX,UAAI,KAAK,YAAY,OAAO;AACxB,aAAK,OAAO,IAAI;AAChB,aAAK,SAAS,IAAgB;AAAA,MACjC;AAAA,IACJ;AAAA,IACD,KAAK,MAAM,OAAO;AACd,UAAIkB;AACJ,UAAI,CAAC,KAAK,KAAK;AACX,aAAK,OAAO,SAAS,cAAc,KAAK,CAAC;AACzC,aAAK,IAAI,YAAY;AACrB,aAAK,YAAY,KAAK,QAAQ,OAAO;AAAA,MACxC,WACQ,KAAK,QAAQ,GAAe;AACjC,wBAAgB,KAAK,GAAG;AACxB,aAAK,IAAI,YAAY;AACrB,aAAK,YAAY,KAAK,QAAQ,OAAO;AAAA,MACxC;AACD,UAAI,KAAK,cAAc,QAAW;AAC9B,oBAAY,KAAK,KAAK,KAAK,WAAW,KAAK,KAAK;AAChD,aAAK,IAAI,UAAU,IAAI,SAAS;AAChC,aAAK,YAAY;AAAA,MACpB;AACD,YAAM,KAAK,MAAM,KAAK;AACtB,UAAI,OAAO,KAAK,IAAI;AACpB,aAAO,QAAQ,YAAY,IAAI,IAAI,aAAa;AAC5C,eAAO,KAAK;AAChB,UAAI,CAAC,QAAQ,CAAC,KAAK,UACf,KAAK,YAAY,UAAUA,MAAK,YAAY,IAAI,IAAI,OAAO,QAAQA,QAAO,SAAS,SAASA,IAAG,eAAe,UACzG,CAAC,QAAQ,OAAO,CAAC,KAAK,SAAS,KAAK,QAAM,cAAc,QAAQ,IAAI;AACzE,YAAI,OAAO,SAAS,cAAc,IAAI;AACtC,aAAK,WAAW;AAChB,aAAK,IAAI,YAAY,IAAI;AAAA,MAC5B;AAAA,IACJ;AAAA,IACD,kBAAkB;AACd,UAAI,KAAK,SAAS,UAAU,KAAK,KAAK,SAAS;AAC3C,eAAO;AACX,UAAI,aAAa,GAAG;AACpB,eAAS,SAAS,KAAK,UAAU;AAC7B,YAAI,EAAE,iBAAiB,aAAa,SAAS,KAAK,MAAM,IAAI;AACxD,iBAAO;AACX,YAAI,QAAQ,eAAe,MAAM,GAAG;AACpC,YAAI,MAAM,UAAU;AAChB,iBAAO;AACX,sBAAc,MAAM,CAAC,EAAE;AACvB,qBAAa,MAAM,CAAC,EAAE;AAAA,MACzB;AACD,aAAO,CAAC,aAAa,OAAO;AAAA,QACxB,YAAY,KAAK,IAAI,sBAAuB,EAAC;AAAA,QAC7C,WAAW,aAAa,KAAK;AAAA,QAC7B;AAAA,MACZ;AAAA,IACK;AAAA,IACD,SAAS,KAAK,MAAM;AAChB,UAAI,OAAO,iBAAiB,MAAM,KAAK,IAAI;AAG3C,UAAI,CAAC,KAAK,SAAS,UAAU,QAAQ,KAAK,QAAQ;AAC9C,YAAI,EAAE,aAAY,IAAK,KAAK,OAAO,KAAK,WAAW,SAAS,KAAK,SAAS,KAAK;AAC/E,YAAI,KAAK,IAAI,SAAS,aAAa,UAAU,IAAI,KAAK,aAAa,aAAa,QAAQ;AACpF,cAAI,QAAQ,SAAS,aAAa,cAAc;AAChD,iBAAO,EAAE,KAAK,KAAK,MAAM,MAAM,QAAQ,KAAK,SAAS,MAAM,MAAM,KAAK,MAAM,OAAO,KAAK;QAC3F;AAAA,MACJ;AACD,aAAO;AAAA,IACV;AAAA,IACD,OAAO,QAAQ;AAAE,aAAO;AAAA,IAAQ;AAAA,IAChC,IAAI,OAAO;AAAE,aAAO,UAAU;AAAA,IAAO;AAAA,IACrC,OAAO,KAAK,SAAS,KAAK;AACtB,eAASlB,KAAI,GAAG,MAAM,GAAGA,KAAI,QAAQ,SAAS,QAAQA,MAAK;AACvD,YAAI,QAAQ,QAAQ,SAASA,EAAC,GAAG,MAAM,MAAM,MAAM;AACnD,YAAI,OAAO,KAAK;AACZ,cAAI,iBAAiB;AACjB,mBAAO;AACX,cAAI,MAAM;AACN;AAAA,QACP;AACD,cAAM,MAAM,MAAM;AAAA,MACrB;AACD,aAAO;AAAA,IACV;AAAA,EACL;AAAA,EACA,MAAM,wBAAwB,YAAY;AAAA,IACtC,YAAY,QAAQ,QAAQ,MAAM;AAC9B;AACA,WAAK,SAAS;AACd,WAAK,SAAS;AACd,WAAK,OAAO;AACZ,WAAK,aAAa;AAClB,WAAK,aAAa;AAAA,IACrB;AAAA,IACD,MAAM,MAAM,IAAI,QAAQ,WAAW,WAAW,SAAS;AACnD,UAAI,WAAW,EAAE,kBAAkB,oBAAoB,CAAC,KAAK,OAAO,QAAQ,OAAO,MAAM,KACrF,OAAO,KAAK,aAAa,KAAK,KAAK,KAAK,UAAU,WAAW;AAC7D,eAAO;AACX,WAAK,SAAS,QAAQ,SAAS,OAAO,SAAS,MAAM,KAAK,SAAS;AACnE,aAAO;AAAA,IACV;AAAA,IACD,SAAS,KAAK;AACV,aAAO,OAAO,IAAI,OAAO,OAAO,KAAK,GAAG,IAAI,OAAO,MAAM,KAAK,KAAK,OAAO,KAAK,MAAM;AAAA,IACxF;AAAA,IACD,MAAM,IAAI;AACN,UAAI,MAAM,KAAK,SAAS;AACxB,WAAK,SAAS;AACd,UAAI,MAAM,IAAI,gBAAgB,KAAK,QAAQ,KAAK,KAAK,IAAI;AACzD,UAAI,aAAa,KAAK;AACtB,aAAO;AAAA,IACV;AAAA,IACD,IAAI,WAAW;AAAE,aAAO;AAAA,IAAa;AAAA,IACrC,KAAK,MAAM;AACP,UAAI,CAAC,KAAK,OAAO,CAAC,KAAK,OAAO,UAAU,KAAK,KAAK,IAAI,GAAG;AACrD,YAAI,KAAK,OAAO,KAAK;AACjB,eAAK,WAAW,QAAQ,KAAK,GAAG;AACpC,aAAK,aAAa;AAClB,aAAK,OAAO,KAAK,OAAO,MAAM,IAAI,CAAC;AACnC,aAAK,IAAI,kBAAkB;AAAA,MAC9B;AAAA,IACJ;AAAA,IACD,IAAI,kBAAkB;AAClB,aAAO,KAAK,SAAS,KAAK,OAAO,KAAK,MAAM,IAAI,MAAM,KAAK,YAAY,KAAK,QAAQ,IAAI,KAAK;AAAA,IAChG;AAAA,IACD,kBAAkB;AAAE,aAAO;AAAA,IAAO;AAAA,IAClC,OAAO,OAAO;AACV,UAAI,iBAAiB,mBACjB,MAAM,OAAO,eAAe,KAAK,OAAO,aAAa;AACrD,YAAI,CAAC,MAAM,OAAO,QAAQ,KAAK,MAAM;AACjC,eAAK,UAAU,IAAI;AACvB,YAAI,KAAK,OAAO,CAAC,KAAK;AAClB,eAAK,aAAa,KAAK;AAC3B,aAAK,SAAS,MAAM;AACpB,aAAK,SAAS,MAAM;AACpB,aAAK,OAAO,MAAM;AAClB,aAAK,aAAa,MAAM;AACxB,eAAO;AAAA,MACV;AACD,aAAO;AAAA,IACV;AAAA,IACD,iBAAiB;AAAE,aAAO;AAAA,IAAO;AAAA,IACjC,YAAY,OAAO;AAAE,aAAO,KAAK,OAAO,YAAY,KAAK;AAAA,IAAI;AAAA,IAC7D,IAAI,aAAa;AAAE,aAAO;AAAA,IAAQ;AAAA,IAClC,IAAI,WAAW;AAAE,aAAO;AAAA,IAAO;AAAA,IAC/B,SAAS,KAAK,MAAM;AAChB,aAAO,KAAK,OAAO,SAAS,KAAK,KAAK,KAAK,IAAI;AAAA,IAClD;AAAA,IACD,UAAU;AACN,YAAM,QAAO;AACb,UAAI,KAAK;AACL,aAAK,OAAO,QAAQ,KAAK,GAAG;AAAA,IACnC;AAAA,EACL;AAAA,EAEA,MAAM,eAAe;AAAA,IACjB,YAAYyD,MAAK,KAAK,KAAK,yBAAyB;AAChD,WAAK,MAAMA;AACX,WAAK,MAAM;AACX,WAAK,MAAM;AACX,WAAK,0BAA0B;AAC/B,WAAK,UAAU;AACf,WAAK,UAAU;AACf,WAAK,eAAe;AACpB,WAAK,gBAAgB;AACrB,WAAK,cAAc;AAEnB,WAAK,cAAc;AACnB,WAAK,YAAY;AACjB,WAAK,UAAU;AACf,WAAK,OAAO;AACZ,WAAK,UAAU;AACf,WAAK,SAASA,KAAI;AAClB,WAAK,OAAO;AAAA,IACf;AAAA,IACD,aAAa;AACT,UAAI,KAAK,QAAQ,UAAU;AACvB,eAAO,CAAC,KAAK,gBAAgB,KAAK,IAAI,OAAO,KAAK,GAAG,EAAE,QAAQ,KAAK;AACxE,UAAI,OAAO,KAAK,QAAQ,KAAK,QAAQ,SAAS,CAAC;AAC/C,aAAO,CAAC,KAAK,cAAc,EAAE,gBAAgB,mBAAmB,KAAK,QAAQ,UAAU;AAAA,IAC1F;AAAA,IACD,UAAU;AACN,UAAI,CAAC,KAAK,SAAS;AACf,aAAK,QAAQ,KAAK,KAAK,UAAU,IAAI,UAAQ;AAC7C,aAAK,cAAc;AAAA,MACtB;AACD,aAAO,KAAK;AAAA,IACf;AAAA,IACD,YAAY,SAAS,KAAK,aAAa;AACnC,UAAI,KAAK,eAAe;AACpB,aAAK,QAAQ,OAAO,UAAU,IAAI,iBAAiB,EAAE,GAAG,MAAM,GAAG,OAAO,MAAM;AAC9E,aAAK,gBAAgB;AAAA,MACxB;AAAA,IACJ;AAAA,IACD,eAAe,MAAM;AACjB,WAAK,YAAW;AAChB,WAAK,UAAU;AACf,WAAK,QAAQ,KAAK,IAAI;AAAA,IACzB;AAAA,IACD,OAAO,SAAS;AACZ,UAAI,KAAK,iBAAiB,WAAW,KAAK,YAAY;AAClD,aAAK,YAAW;AAAA;AAEhB,aAAK,gBAAgB;AACzB,UAAI,CAAC,KAAK,WAAY;AAClB,aAAK,QAAO;AAAA,IACnB;AAAA,IACD,UAAU,QAAQ,QAAQ,WAAW;AACjC,aAAO,SAAS,GAAG;AACf,YAAI,KAAK,WAAW,KAAK,KAAK,QAAQ;AAClC,cAAI,EAAE,OAAO,WAAW,KAAM,IAAG,KAAK,OAAO,KAAK,KAAK,IAAI;AAC3D,eAAK,OAAO;AACZ,cAAI;AACA,kBAAM,IAAI,MAAM,mDAAmD;AACvE,cAAI,WAAW;AACX,gBAAI,CAAC,KAAK,WAAY;AAClB,mBAAK,QAAO;AAChB,gBAAI,KAAK,QAAQ;AACb,mBAAK,QAAQ,KAAK,QAAQ,SAAS,CAAC,EAAE,aAAa;AAAA;AAEnD,mBAAK,eAAe;AACxB,iBAAK,YAAW;AAChB,iBAAK,UAAU;AACf,iBAAK,cAAc;AACnB;AACA;AAAA,UACH,OACI;AACD,iBAAK,OAAO;AACZ,iBAAK,UAAU;AAAA,UAClB;AAAA,QACJ;AACD,YAAI,OAAO,KAAK;AAAA,UAAI,KAAK,KAAK,SAAS,KAAK;AAAA,UAAS;AAAA,UAAQ;AAAA;AAAA,QAAG;AAChE,aAAK,YAAY,OAAO,MAAM,OAAO,SAAS,SAAS,CAAC;AACxD,aAAK,QAAO,EAAG,OAAO,UAAU,IAAI,SAAS,KAAK,KAAK,MAAM,KAAK,SAAS,KAAK,UAAU,IAAI,CAAC,GAAG,MAAM,GAAG,SAAS;AACpH,aAAK,cAAc;AACnB,aAAK,WAAW;AAChB,kBAAU;AACV,oBAAY;AAAA,MACf;AAAA,IACJ;AAAA,IACD,KAAK,MAAM,IAAI,QAAQ,WAAW;AAC9B,WAAK,UAAU,KAAK,MAAM,QAAQ,SAAS;AAC3C,WAAK,MAAM;AACX,UAAI,KAAK,YAAY;AACjB,aAAK,YAAY;AAAA,IACxB;AAAA,IACD,MAAM,MAAM,IAAI,MAAM,QAAQ,WAAWxD,QAAO;AAC5C,UAAI,KAAK,wBAAwBA,MAAK,KAAK,gBAAgB,iBAAiB;AACxE,YAAI,KAAK;AACL,gBAAM,IAAI,WAAW,oDAAoD;AAC7E,YAAI,KAAK,KAAK,IAAI,OAAO,KAAK,GAAG,EAAE;AAC/B,gBAAM,IAAI,WAAW,uEAAuE;AAAA,MACnG;AACD,UAAI,MAAM,KAAK;AACf,UAAI,gBAAgB,iBAAiB;AACjC,YAAI,KAAK,OAAO;AACZ,cAAI,EAAE,KAAM,IAAG;AACf,cAAI,QAAQ,UAAU,eAAe,CAAC,KAAK,WAAY;AACnD,iBAAK,QAAO;AAChB,eAAK,eAAe,IAAI,gBAAgB,KAAK,UAAU,IAAI,WAAW,KAAK,GAAG,KAAK,IAAI,CAAC;AAAA,QAC3F,OACI;AACD,cAAI,OAAO,WAAW,OAAO,KAAK,UAAU,IAAI,WAAW,MAAM,GAAG,KAAK,MAAM,IAAI,KAAK,SAAS;AACjG,cAAI,eAAe,KAAK,eAAe,CAAC,KAAK,cAAc,aAAa,OAAO,WAC1E,OAAO,MAAM,KAAK,YAAY;AACnC,cAAI,cAAc,CAAC,KAAK,eAAe,OAAO,MAAM,YAAY,OAAO,UAAU,KAAK,aAAa;AACnG,cAAI,OAAO,KAAK;AAChB,cAAI,KAAK,iBAAiB,KAAoB,CAAC,gBAAgB,CAAC,KAAK;AACjE,iBAAK,gBAAgB;AACzB,eAAK,YAAY,MAAM;AACvB,cAAI,cAAc;AACd,iBAAK,OAAO,UAAU,IAAI,iBAAiB,CAAC,GAAG,MAAM,GAAG,SAAS;AACjE,wBAAY,OAAO,SAAS,KAAK,IAAI,GAAG,YAAY,OAAO,MAAM;AAAA,UACpE;AACD,eAAK,OAAO,UAAU,MAAM,MAAM,GAAG,SAAS;AAC9C,eAAK,cAAc;AACnB,eAAK,gBAAgB,CAAC,cAAc,IAAa,OAAO,MAAM,YAAY,OAAO,SAAS,IAAc;AACxG,cAAI,KAAK;AACL,iBAAK,cAAc,OAAO;QACjC;AAAA,MACJ,WACQ,KAAK,IAAI,OAAO,KAAK,GAAG,EAAE,QAAQ,KAAK,KAAK;AACjD,aAAK,QAAO,EAAG,YAAY,IAAI;AAAA,MAClC;AACD,UAAI,KAAK;AAEL,YAAI,KAAK,UAAU,OAAO,KAAK,KAAK,QAAQ;AACxC,eAAK,WAAW;AAAA,QACnB,OACI;AACD,eAAK,QAAQ,OAAO,KAAK,KAAK,SAAS,KAAK;AAC5C,eAAK,OAAO;AACZ,eAAK,UAAU;AAAA,QAClB;AACD,aAAK,MAAM;AAAA,MACd;AACD,UAAI,KAAK,YAAY;AACjB,aAAK,YAAY;AAAA,IACxB;AAAA,IACD,OAAO,MAAM,MAAM,MAAM,IAAI4E,cAAa,sBAAsB;AAC5D,UAAI,UAAU,IAAI,eAAe,MAAM,MAAM,IAAI,oBAAoB;AACrE,cAAQ,UAAU,SAAS,MAAMA,cAAa,MAAM,IAAI,OAAO;AAC/D,UAAI,QAAQ,YAAY;AACpB,gBAAQ,YAAY,QAAQ;AAChC,cAAQ,OAAO,QAAQ,OAAO;AAC9B,aAAO;AAAA,IACV;AAAA,EACL;AACA,WAAS,UAAU,MAAM,QAAQ;AAC7B,aAAS,QAAQ;AACb,aAAO,IAAI,SAAS,MAAM,CAAC,IAAI,GAAG,KAAK,MAAM;AACjD,WAAO;AAAA,EACX;AAAA,EACA,MAAM,mBAAmB,WAAW;AAAA,IAChC,YAAY,KAAK;AACb;AACA,WAAK,MAAM;AAAA,IACd;AAAA,IACD,GAAG,OAAO;AAAE,aAAO,MAAM,OAAO,KAAK;AAAA,IAAM;AAAA,IAC3C,QAAQ;AAAE,aAAO,SAAS,cAAc,KAAK,GAAG;AAAA,IAAI;AAAA,IACpD,UAAU,KAAK;AAAE,aAAO,IAAI,SAAS,YAAa,KAAI,KAAK;AAAA,IAAM;AAAA,IACjE,IAAI,WAAW;AAAE,aAAO;AAAA,IAAO;AAAA,EACnC;AAEA,QAAM,0BAAuC,sBAAM;AACnD,QAAM,uBAAoC,sBAAM;AAChD,QAAM,sBAAmC,sBAAM;AAC/C,QAAM,gBAA6B,sBAAM;AACzC,QAAM,iBAA8B,sBAAM;AAC1C,QAAM,eAA4B,sBAAM;AACxC,QAAM,oBAAiC,sBAAM;AAC7C,QAAM,uBAAoC,sBAAM,OAAO;AAAA,IACnD,SAAS,YAAU,OAAO,KAAK,CAAA/E,OAAKA,EAAC;AAAA,EACzC,CAAC;AACD,QAAM,wBAAqC,sBAAM,OAAO;AAAA,IACpD,SAAS,YAAU,OAAO,KAAK,CAAAA,OAAKA,EAAC;AAAA,EACzC,CAAC;AAAA,EACD,MAAM,aAAa;AAAA,IACf,YAAY,OAAOuE,KAAI,WAAWvE,KAAI,WAAW,UAAU,GAAG,UAAU,GAAG;AACvE,WAAK,QAAQ;AACb,WAAK,IAAIuE;AACT,WAAK,IAAIvE;AACT,WAAK,UAAU;AACf,WAAK,UAAU;AAAA,IAClB;AAAA,IACD,IAAI,SAAS;AACT,aAAO,QAAQ,QAAQ,OAAO,IAAI,aAAa,KAAK,MAAM,IAAI,OAAO,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,SAAS,KAAK,OAAO;AAAA,IACrH;AAAA,EACL;AACA,QAAM,iBAA8B,4BAAY,OAAO,EAAE,KAAK,CAACgD,IAAG,OAAOA,GAAE,IAAI,EAAE,EAAG,CAAA;AAapF,WAAS,aAAa,OAAO,WAAW,SAAS;AAC7C,QAAI,UAAU,MAAM,MAAM,aAAa;AACvC,QAAI,QAAQ;AACR,cAAQ,CAAC,EAAE,SAAS;AAAA,aACf,OAAO;AACZ,aAAO,QAAQ,OAAO,SAAS,GAAG,SAAS,QAAW,QAAW,SAAS;AAAA,aACrE;AACL,cAAQ,MAAM,UAAU,KAAK,SAAS;AAAA;AAEtC,cAAQ,MAAM,SAAS;AAAA,EAC/B;AACA,QAAM,WAAwB,sBAAM,OAAO,EAAE,SAAS,YAAU,OAAO,SAAS,OAAO,CAAC,IAAI,KAAM,CAAA;AAClG,MAAI,eAAe;AACnB,QAAM,aAA0B,sBAAM;EAMtC,MAAM,WAAW;AAAA,IACb,YAIA,IAIA,QAIA,kBAAkB,iBAAiB;AAC/B,WAAK,KAAK;AACV,WAAK,SAAS;AACd,WAAK,mBAAmB;AACxB,WAAK,YAAY,gBAAgB,IAAI;AAAA,IACxC;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,OAAO,OAAO,QAAQ,MAAM;AACxB,YAAM,EAAE,eAAe,SAAS,aAAa,KAAM,IAAG,QAAQ;AAC9D,aAAO,IAAI,WAAW,gBAAgB,QAAQ,eAAe,YAAU;AACnE,YAAI,MAAM,CAAC,WAAW,GAAG,MAAM,CAAC;AAChC,YAAI;AACA,cAAI,KAAK,YAAY,GAAG,UAAQ;AAC5B,gBAAI,aAAa,KAAK,OAAO,MAAM;AACnC,mBAAO,aAAa,KAAK,UAAU,IAAI,WAAW;AAAA,UACrD,CAAA,CAAC;AACN,YAAI;AACA,cAAI,KAAK,QAAQ,MAAM,CAAC;AAC5B,eAAO;AAAA,MACnB,CAAS;AAAA,IACJ;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,OAAO,UAAU,KAAK,MAAM;AACxB,aAAO,WAAW,OAAO,UAAQ,IAAI,IAAI,IAAI,GAAG,IAAI;AAAA,IACvD;AAAA,EACL;AAAA,EACA,MAAM,eAAe;AAAA,IACjB,YAAY,MAAM;AACd,WAAK,OAAO;AAKZ,WAAK,aAAa;AAGlB,WAAK,QAAQ;AAAA,IAChB;AAAA,IACD,OAAO,MAAM;AACT,UAAI,CAAC,KAAK,OAAO;AACb,YAAI,KAAK,MAAM;AACX,cAAI;AACA,iBAAK,QAAQ,KAAK,KAAK,OAAO,IAAI;AAAA,UACrC,SACMjD,IAAG;AACN,yBAAa,KAAK,OAAOA,IAAG,2BAA2B;AACvD,iBAAK,WAAU;AAAA,UAClB;AAAA,QACJ;AAAA,MACJ,WACQ,KAAK,YAAY;AACtB,YAAI,SAAS,KAAK;AAClB,aAAK,aAAa;AAClB,YAAI,KAAK,MAAM,QAAQ;AACnB,cAAI;AACA,iBAAK,MAAM,OAAO,MAAM;AAAA,UAC3B,SACMA,IAAG;AACN,yBAAa,OAAO,OAAOA,IAAG,2BAA2B;AACzD,gBAAI,KAAK,MAAM;AACX,kBAAI;AACA,qBAAK,MAAM;cACd,SACMwC,IAAG;AAAA,cAAG;AACjB,iBAAK,WAAU;AAAA,UAClB;AAAA,QACJ;AAAA,MACJ;AACD,aAAO;AAAA,IACV;AAAA,IACD,QAAQ,MAAM;AACV,UAAInB;AACJ,WAAKA,MAAK,KAAK,WAAW,QAAQA,QAAO,SAAS,SAASA,IAAG,SAAS;AACnE,YAAI;AACA,eAAK,MAAM;QACd,SACMrB,IAAG;AACN,uBAAa,KAAK,OAAOA,IAAG,2BAA2B;AAAA,QAC1D;AAAA,MACJ;AAAA,IACJ;AAAA,IACD,aAAa;AACT,WAAK,OAAO,KAAK,QAAQ;AAAA,IAC5B;AAAA,EACL;AACA,QAAM,mBAAgC,sBAAM;AAC5C,QAAM,oBAAiC,sBAAM;AAE7C,QAAM,cAA2B,sBAAM;AACvC,QAAM,eAA4B,sBAAM;AACxC,QAAM,gBAA6B,sBAAM;AACzC,WAAS,iBAAiB,MAAM;AAC5B,QAAI,OAAO,GAAG,QAAQ,GAAG0C,OAAM,GAAG,SAAS;AAC3C,aAAS,UAAU,KAAK,MAAM,MAAM,aAAa,GAAG;AAChD,UAAIU,KAAI,OAAO,IAAI;AACnB,UAAIA,IAAG;AACH,YAAIA,GAAE,QAAQ;AACV,iBAAO,KAAK,IAAI,MAAMA,GAAE,IAAI;AAChC,YAAIA,GAAE,SAAS;AACX,kBAAQ,KAAK,IAAI,OAAOA,GAAE,KAAK;AACnC,YAAIA,GAAE,OAAO;AACT,UAAAV,OAAM,KAAK,IAAIA,MAAKU,GAAE,GAAG;AAC7B,YAAIA,GAAE,UAAU;AACZ,mBAAS,KAAK,IAAI,QAAQA,GAAE,MAAM;AAAA,MACzC;AAAA,IACJ;AACD,WAAO,EAAE,MAAM,OAAO,KAAAV,MAAK,OAAM;AAAA,EACrC;AACA,QAAM,cAA2B,sBAAM;EACvC,MAAM,aAAa;AAAA,IACf,YAAY,OAAO,KAAK,OAAO,KAAK;AAChC,WAAK,QAAQ;AACb,WAAK,MAAM;AACX,WAAK,QAAQ;AACb,WAAK,MAAM;AAAA,IACd;AAAA,IACD,KAAK,OAAO;AACR,aAAO,IAAI,aAAa,KAAK,IAAI,KAAK,OAAO,MAAM,KAAK,GAAG,KAAK,IAAI,KAAK,KAAK,MAAM,GAAG,GAAG,KAAK,IAAI,KAAK,OAAO,MAAM,KAAK,GAAG,KAAK,IAAI,KAAK,KAAK,MAAM,GAAG,CAAC;AAAA,IAC7J;AAAA,IACD,SAAS,KAAK;AACV,UAAIvC,KAAI,IAAI,QAAQ,KAAK;AACzB,aAAOA,KAAI,GAAGA,MAAK;AACf,YAAI,QAAQ,IAAIA,KAAI,CAAC;AACrB,YAAI,MAAM,QAAQ,GAAG;AACjB;AACJ,YAAI,MAAM,MAAM,GAAG;AACf;AACJ,aAAK,GAAG,KAAK,KAAK;AAClB,YAAI,OAAOA,KAAI,GAAG,CAAC;AAAA,MACtB;AACD,UAAI,OAAOA,IAAG,GAAG,EAAE;AACnB,aAAO;AAAA,IACV;AAAA,IACD,OAAO,iBAAiB,MAAM,QAAQ;AAClC,UAAI,OAAO,UAAU;AACjB,eAAO;AACX,UAAI,SAAS,CAAA;AACb,eAAS,KAAK,GAAG,KAAK,GAAG,OAAO,GAAG,OAAO,KAAI,MAAM;AAChD,YAAI,OAAO,MAAM,KAAK,SAAS,OAAO,KAAK,EAAE,GAAG,MAAM,OAAO;AAC7D,YAAI,MAAM,OAAO,KAAK,QAAQ;AAC9B,eAAO,KAAK,OAAO,UAAU,OAAO,EAAE,IAAI,KAAK;AAC3C,cAAI,OAAO,OAAO,EAAE,GAAG,KAAK,OAAO,KAAK,CAAC;AACzC,cAAI,QAAQ,KAAK,IAAI,MAAM,IAAI,GAAG,MAAM,KAAK,IAAI,KAAK,EAAE;AACxD,cAAI,SAAS;AACT,gBAAI,aAAa,QAAQ,KAAK,MAAM,KAAK,OAAO,GAAG,EAAE,SAAS,MAAM;AACxE,cAAI,KAAK;AACL;AAAA;AAEA,kBAAM;AAAA,QACb;AACD,YAAI,CAAC;AACD,iBAAO;AACX,YAAI,aAAa,KAAK,OAAO,KAAK,KAAK,KAAK,OAAO,KAAK,GAAG,EAAE,SAAS,MAAM;AAC5E,eAAO,KAAK;AACZ,eAAO,KAAK;AAAA,MACf;AAAA,IACJ;AAAA,EACL;AAAA,EAKA,MAAM,WAAW;AAAA,IACb,YAIA,MAIA,OAIA,cAAc;AACV,WAAK,OAAO;AACZ,WAAK,QAAQ;AACb,WAAK,eAAe;AAIpB,WAAK,QAAQ;AACb,WAAK,aAAa,KAAK;AACvB,WAAK,UAAU,UAAU,MAAM,KAAK,WAAW,IAAI,MAAM;AACzD,eAAS,MAAM;AACX,aAAK,UAAU,KAAK,QAAQ,QAAQ,GAAG,OAAO;AAClD,UAAI,gBAAgB,CAAA;AACpB,WAAK,QAAQ,kBAAkB,CAAC,OAAO,KAAK,OAAO,QAAQ,cAAc,KAAK,IAAI,aAAa,OAAO,KAAK,OAAO,GAAG,CAAC,CAAC;AACvH,WAAK,gBAAgB;AAAA,IACxB;AAAA;AAAA;AAAA;AAAA,IAID,OAAO,OAAO,MAAM,OAAO,cAAc;AACrC,aAAO,IAAI,WAAW,MAAM,OAAO,YAAY;AAAA,IAClD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMD,IAAI,kBAAkB;AAClB,cAAQ,KAAK,QAAQ,KAAoB;AAAA,IAC5C;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,IAAI,gBAAgB;AAChB,cAAQ,KAAK,QAAQ,KAAkB;AAAA,IAC1C;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,IAAI,kBAAkB;AAClB,aAAO,KAAK,eAAe,KAAK,SAAS,IAAmB,MAAmB;AAAA,IAClF;AAAA;AAAA;AAAA;AAAA,IAID,IAAI,eAAe;AACf,cAAQ,KAAK,QAAQ,KAAiB;AAAA,IACzC;AAAA;AAAA;AAAA;AAAA,IAID,IAAI,aAAa;AACb,aAAO,CAAC,KAAK,QAAQ;AAAA,IACxB;AAAA;AAAA;AAAA;AAAA,IAID,IAAI,eAAe;AACf,aAAO,KAAK,aAAa,KAAK,QAAM,GAAG,SAAS;AAAA,IACnD;AAAA;AAAA;AAAA;AAAA,IAID,IAAI,QAAQ;AAAE,aAAO,KAAK,SAAS,KAAK,KAAK,aAAa,UAAU;AAAA,IAAI;AAAA,EAC5E;AAKA,MAAI,YAA0B,yBAAU8E,YAAW;AAM/C,IAAAA,WAAUA,WAAU,KAAK,IAAI,CAAC,IAAI;AAIlC,IAAAA,WAAUA,WAAU,KAAK,IAAI,CAAC,IAAI;AACtC,WAAOA;AAAA,EAAS,EAAG,cAAc,YAAY,CAAA,EAAG;AAChD,QAAM,MAAM,UAAU,KAAK,MAAM,UAAU;AAE3C,WAAS,IAAI,KAAK;AACd,QAAI,SAAS,CAAA;AACb,aAAS9E,KAAI,GAAGA,KAAI,IAAI,QAAQA;AAC5B,aAAO,KAAK,KAAK,CAAC,IAAIA,EAAC,CAAC;AAC5B,WAAO;AAAA,EACX;AAEA,QAAM,WAAwB,oBAAI,0PAA0P;AAE5R,QAAM,cAA2B,oBAAI,4PAA4P;AACjS,QAAM,WAAwB,uBAAO,OAAO,IAAI,GAAG,eAAe,CAAA;AAIlE,WAASoB,MAAK,CAAC,MAAM,MAAM,IAAI,GAAG;AAC9B,QAAIiC,KAAiB,gBAAAjC,GAAE,WAAW,CAAC,GAAGD,KAAiB,gBAAAC,GAAE,WAAW,CAAC;AACrE,aAASiC,EAAC,IAAIlC;AACd,aAASA,EAAC,IAAI,CAACkC;AAAA,EACnB;AACA,WAAS,SAAS,IAAI;AAClB,WAAO,MAAM,MAAO,SAAS,EAAE,IAC3B,QAAS,MAAM,MAAM,OAAQ,IACzB,QAAS,MAAM,MAAM,OAAQ,YAAY,KAAK,IAAK,IAC/C,QAAS,MAAM,MAAM,OAAQ,IACzB,QAAU,MAAM,MAAM,OAAS,MAC3B,SAAU,MAAM,MAAM,QAAS,IAC3B,MAAM,OAAS,MAAe;AAAA,EAC1D;AACA,QAAM,SAAS;AAAA,EAKf,MAAM,SAAS;AAAA;AAAA;AAAA;AAAA,IAIX,YAIA,MAIA,IAQA,OAAO;AACH,WAAK,OAAO;AACZ,WAAK,KAAK;AACV,WAAK,QAAQ;AAAA,IAChB;AAAA;AAAA;AAAA;AAAA,IAID,IAAI,MAAM;AAAE,aAAO,KAAK,QAAQ,IAAI,MAAM;AAAA,IAAM;AAAA;AAAA;AAAA;AAAA,IAIhD,KAAK,KAAK,KAAK;AAAE,aAAQ,KAAK,OAAO,OAAQ,MAAM,KAAK,KAAK,KAAK;AAAA,IAAO;AAAA;AAAA;AAAA;AAAA,IAIzE,OAAO,KAAK,OAAOpD,QAAO,OAAO,OAAO;AACpC,UAAI,QAAQ;AACZ,eAASD,KAAI,GAAGA,KAAI,MAAM,QAAQA,MAAK;AACnC,YAAI,OAAO,MAAMA,EAAC;AAClB,YAAI,KAAK,QAAQC,UAAS,KAAK,MAAMA,QAAO;AACxC,cAAI,KAAK,SAAS;AACd,mBAAOD;AAIX,cAAI,QAAQ,MAAM,SAAS,IAAK,QAAQ,IAAI,KAAK,OAAOC,SAAQ,KAAK,KAAKA,SAAS,MAAM,KAAK,EAAE,QAAQ,KAAK;AACzG,oBAAQD;AAAA,QACf;AAAA,MACJ;AACD,UAAI,QAAQ;AACR,cAAM,IAAI,WAAW,oBAAoB;AAC7C,aAAO;AAAA,IACV;AAAA,EACL;AAEA,QAAM,QAAQ,CAAA;AACd,WAAS,aAAa,MAAM,WAAW;AACnC,QAAI,MAAM,KAAK,QAAQ,YAAY,aAAa,MAAM,IAAY,GAAW,eAAe,aAAa,MAAM,IAAY;AAC3H,QAAI,CAAC,QAAQ,aAAa,KAAa,CAAC,OAAO,KAAK,IAAI;AACpD,aAAO,aAAa,GAAG;AAW3B,aAASA,KAAI,GAAG,OAAO,WAAW,aAAa,WAAWA,KAAI,KAAKA,MAAK;AACpE,UAAI,OAAO,SAAS,KAAK,WAAWA,EAAC,CAAC;AACtC,UAAI,QAAQ;AACR,eAAO;AAAA,eACF,QAAQ,KAAc,cAAc;AACzC,eAAO;AACX,YAAMA,EAAC,IAAI,QAAQ,IAAa,IAAY;AAC5C,UAAI,OAAO;AACP,qBAAa;AACjB,aAAO;AAAA,IACV;AASD,aAASA,KAAI,GAAG,OAAO,WAAW,aAAa,WAAWA,KAAI,KAAKA,MAAK;AACpE,UAAI,OAAO,MAAMA,EAAC;AAClB,UAAI,QAAQ,KAAc;AACtB,YAAIA,KAAI,MAAM,KAAK,QAAQ,MAAMA,KAAI,CAAC,KAAM,OAAO;AAC/C,iBAAO,MAAMA,EAAC,IAAI;AAAA;AAElB,gBAAMA,EAAC,IAAI;AAAA,MAClB,WACQ,QAAQ,IAAa;AAC1B,YAAI,MAAMA,KAAI;AACd,eAAO,MAAM,OAAO,MAAM,GAAG,KAAK;AAC9B;AACJ,YAAI,UAAWA,MAAK,QAAQ,KAAgB,MAAM,OAAO,MAAM,GAAG,KAAK,IAAe,cAAc,IAAY,IAAY,IAAc;AAC1I,iBAAS,IAAIA,IAAG,IAAI,KAAK;AACrB,gBAAM,CAAC,IAAI;AACf,QAAAA,KAAI,MAAM;AAAA,MACb,WACQ,QAAQ,KAAc,cAAc,GAAW;AACpD,cAAMA,EAAC,IAAI;AAAA,MACd;AACD,aAAO;AACP,UAAI,OAAO;AACP,qBAAa;AAAA,IACpB;AAKD,aAASA,KAAI,GAAG,KAAK,GAAG,UAAU,GAAG,IAAI,IAAI,MAAMA,KAAI,KAAKA,MAAK;AAG7D,UAAI,KAAK,SAAS,KAAK,KAAK,WAAWA,EAAC,CAAC,GAAG;AACxC,YAAI,KAAK,GAAG;AACR,mBAAS,KAAK,KAAK,GAAG,MAAM,GAAG,MAAM,GAAG;AACpC,gBAAI,aAAa,KAAK,CAAC,KAAK,CAAC,IAAI;AAC7B,kBAAI,QAAQ,aAAa,KAAK,CAAC;AAC/B,kBAAI+E,QAAQ,QAAQ,IAAuB,YACvC,EAAE,QAAQ,KAA0B,IAC/B,QAAQ,IAA0B,eAAe;AAC1D,kBAAIA;AACA,sBAAM/E,EAAC,IAAI,MAAM,aAAa,EAAE,CAAC,IAAI+E;AACzC,mBAAK;AACL;AAAA,YACH;AAAA,UACJ;AAAA,QACJ,WACQ,aAAa,UAAU,KAAoB;AAChD;AAAA,QACH,OACI;AACD,uBAAa,IAAI,IAAI/E;AACrB,uBAAa,IAAI,IAAI;AACrB,uBAAa,IAAI,IAAI;AAAA,QACxB;AAAA,MACJ,YACS,OAAO,MAAMA,EAAC,MAAM,KAAa,QAAQ,GAAW;AAC1D,YAAI,QAAQ,QAAQ;AACpB,kBAAU,QAAQ,IAAI;AACtB,iBAAS,KAAK,KAAK,GAAG,MAAM,GAAG,MAAM,GAAG;AACpC,cAAI,MAAM,aAAa,KAAK,CAAC;AAC7B,cAAI,MAAM;AACN;AACJ,cAAI,OAAO;AACP,yBAAa,KAAK,CAAC,KAAK;AAAA,UAC3B,OACI;AACD,gBAAI,MAAM;AACN;AACJ,yBAAa,KAAK,CAAC,KAAK;AAAA,UAC3B;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AAQD,aAASA,KAAI,GAAGA,KAAI,KAAKA,MAAK;AAC1B,UAAI,MAAMA,EAAC,KAAK,KAAc;AAC1B,YAAI,MAAMA,KAAI;AACd,eAAO,MAAM,OAAO,MAAM,GAAG,KAAK;AAC9B;AACJ,YAAI,WAAWA,KAAI,MAAMA,KAAI,CAAC,IAAI,cAAc;AAChD,YAAI,UAAU,MAAM,MAAM,MAAM,GAAG,IAAI,cAAc;AACrD,YAAI,UAAU,WAAW,SAAU,UAAU,IAAY,IAAa;AACtE,iBAAS,IAAIA,IAAG,IAAI,KAAK;AACrB,gBAAM,CAAC,IAAI;AACf,QAAAA,KAAI,MAAM;AAAA,MACb;AAAA,IACJ;AAMD,QAAI,QAAQ,CAAA;AACZ,QAAI,aAAa,GAAW;AACxB,eAASA,KAAI,GAAGA,KAAI,OAAM;AACtB,YAAI,QAAQA,IAAG,MAAM,MAAMA,IAAG,KAAK;AACnC,eAAOA,KAAI,OAAO,QAAQ,MAAMA,EAAC,KAAK;AAClC,UAAAA;AACJ,YAAI,KAAK;AACL,mBAAS,IAAIA,IAAG,IAAI,SAAQ;AACxB,gBAAI,MAAM,GAAGqD,KAAI,MAAM,EAAE,CAAC,KAAK;AAC/B,mBAAO,IAAI,SAASA,OAAM,MAAM,IAAI,CAAC,KAAK;AACtC;AACJ,kBAAM,KAAK,IAAI,SAAS,GAAG,KAAKA,KAAI,IAAI,CAAC,CAAC;AAAA,UAC7C;AAAA,QACJ,OACI;AACD,gBAAM,KAAK,IAAI,SAAS,OAAOrD,IAAG,CAAC,CAAC;AAAA,QACvC;AAAA,MACJ;AAAA,IACJ,OACI;AACD,eAASA,KAAI,GAAGA,KAAI,OAAM;AACtB,YAAI,QAAQA,IAAG,MAAM,MAAMA,IAAG,KAAK;AACnC,eAAOA,KAAI,OAAO,QAAQ,MAAMA,EAAC,KAAK;AAClC,UAAAA;AACJ,cAAM,KAAK,IAAI,SAAS,OAAOA,IAAG,MAAM,IAAI,CAAC,CAAC;AAAA,MACjD;AAAA,IACJ;AACD,WAAO;AAAA,EACX;AACA,WAAS,aAAa,QAAQ;AAC1B,WAAO,CAAC,IAAI,SAAS,GAAG,QAAQ,CAAC,CAAC;AAAA,EACtC;AACA,MAAI,YAAY;AAChB,WAAS,aAAa,MAAM,OAAO,KAAK,OAAO,SAAS;AACpD,QAAIkB;AACJ,QAAI,aAAa,MAAM,OAAO,KAAK,MAAM,QAAQ;AACjD,QAAI,cAAc,GAAG;AACjB,UAAI,CAAC,WAAW,CAAC,KAAK;AAClB,eAAO;AACX,UAAI,MAAM,CAAC,EAAE,SAAS,KAAK;AACvB,qBAAa,MAAM,CAAC,EAAE,KAAK,OAAO,GAAG;AACrC,gBAAQ;AAAA,MACX;AAAA,IACJ,WACQ,cAAc,KAAK,QAAQ;AAChC,UAAI;AACA,eAAO;AACX,UAAI,OAAO,MAAM,MAAM,SAAS,CAAC;AACjC,UAAI,KAAK,SAAS,KAAK;AACnB,qBAAa,KAAK,KAAK,MAAM,GAAG;AAChC,gBAAQ,MAAM,SAAS;AAAA,MAC1B;AAAA,IACJ;AACD,QAAI,QAAQ;AACR,cAAQ,SAAS,KAAK,OAAO,aAAaA,MAAK,MAAM,eAAe,QAAQA,QAAO,SAASA,MAAK,IAAI,MAAM,KAAK;AACpH,QAAI,OAAO,MAAM,KAAK;AAEtB,QAAI,cAAc,KAAK,KAAK,SAAS,GAAG,GAAG;AACvC,aAAO,MAAM,SAAS,UAAU,IAAI,EAAE;AACtC,mBAAa,KAAK,KAAK,CAAC,SAAS,GAAG;AAAA,IACvC;AACD,QAAI,eAAe,YAAY,KAAK,OAAO;AAC3C,QAAI,YAAY,iBAAiB,KAAK,MAAM,YAAY,YAAY;AACpE,gBAAY,KAAK,KAAK,MAAM,KAAK,IAAI,YAAY,SAAS,GAAG,KAAK,IAAI,YAAY,SAAS,CAAC;AAC5F,QAAI,aAAa,KAAK,KAAK,SAAS,GAAG;AACnC,aAAO,gBAAgB,OAAO,YAAY,KAAK,MAAM,eAAe,KAAK,GAAG,KAAK,KAAK;AAC1F,QAAI,WAAW,UAAU,UAAU,MAAM,SAAS,IAAI,KAAK,OAAO,MAAM,SAAS,UAAU,IAAI,GAAG;AAClG,QAAI,CAAC,YAAY,KAAK,SAAS;AAC3B,aAAO,gBAAgB,OAAO,UAAU,KAAK,KAAK,KAAK,MAAM,UAAU,KAAK,GAAG,GAAG;AACtF,QAAI,YAAY,SAAS,QAAQ,KAAK;AAClC,aAAO,gBAAgB,OAAO,SAAS,KAAK,CAAC,SAAS,GAAG,IAAI,KAAK,MAAM,UAAU,IAAI,IAAI,SAAS,KAAK;AAC5G,WAAO,gBAAgB,OAAO,YAAY,KAAK,MAAM,UAAU,KAAK,GAAG,KAAK,KAAK;AAAA,EACrF;AAEA,QAAM,uBAAuB;AAAA,EAC7B,MAAM,UAAU;AAAA,IACZ,YAAY,QAAQ,OAAO;AACvB,WAAK,SAAS;AACd,WAAK,OAAO;AACZ,WAAK,gBAAgB,MAAM,MAAM,YAAY,aAAa;AAAA,IAC7D;AAAA,IACD,OAAO,MAAM;AACT,WAAK,QAAQ;AAAA,IAChB;AAAA,IACD,YAAY;AACR,WAAK,QAAQ;AAAA,IAChB;AAAA,IACD,UAAU,OAAO,KAAK;AAClB,UAAI,CAAC;AACD,eAAO;AACX,UAAI,SAAS,MAAM;AACnB,eAAS,MAAM,WAAS;AACpB,aAAK,gBAAgB,QAAQ,GAAG;AAChC,YAAI,SAAS,KAAK,KAAK;AACvB,aAAK,SAAS,GAAG;AACjB,YAAI,OAAO,IAAI;AACf,YAAI,QAAQ;AACR;AACJ,YAAI,OAAO,YAAY,IAAI,GAAG,GAAG,WAAW,YAAY,IAAI,IAAI;AAChE,YAAI,QAAQ,WAAW,KAAK,cACvB,OAAO,KAAK,aAAa,eAAe,GAAG,MACvC,eAAe,IAAI,MAAM,IAAI,YAAY,QAAQ,IAAI,aAAa,KAAK,KAAK,SAAS;AAC1F,eAAK,UAAS;AAClB,cAAM;AAAA,MACT;AACD,WAAK,gBAAgB,QAAQ,GAAG;AAChC,aAAO;AAAA,IACV;AAAA,IACD,aAAa,MAAM;AACf,UAAI,OAAO,KAAK;AAChB,eAAS,SAAS,KAAK;AACnB,YAAI,MAAM,QAAQ;AACd,gBAAM,MAAM,KAAK,KAAK,SAAS,KAAK,IAAI,MAAM,QAAQ,KAAK,MAAM;AACzE,eAAS,MAAM,GAAG,KAAK,KAAK,gBAAgB,OAAO,iBAAe;AAC9D,YAAI,YAAY,IAAI,YAAY,GAAG+B;AACnC,YAAI,KAAK,eAAe;AACpB,sBAAY,KAAK,QAAQ,KAAK,eAAe,GAAG;AAChD,sBAAY,KAAK,cAAc;AAAA,QAClC,WACQA,KAAI,GAAG,KAAK,IAAI,GAAG;AACxB,sBAAYA,GAAE;AACd,sBAAYA,GAAE,CAAC,EAAE;AAAA,QACpB;AACD,aAAK,OAAO,KAAK,MAAM,KAAK,YAAY,IAAI,KAAK,SAAS,SAAS,CAAC;AACpE,YAAI,YAAY;AACZ;AACJ,aAAK,UAAS;AACd,YAAI,YAAY;AACZ,mBAAS,SAAS,KAAK;AACnB,gBAAI,MAAM,QAAQ,QAAQ,MAAM,MAAM,KAAK,KAAK;AAC5C,oBAAM,OAAO,YAAY;AAAA;AACrC,cAAM,YAAY;AAAA,MACrB;AAAA,IACJ;AAAA,IACD,SAAS,MAAM;AACX,UAAI,KAAK;AACL;AACJ,UAAI,OAAO,YAAY,IAAI,IAAI;AAC/B,UAAI,WAAW,QAAQ,KAAK;AAC5B,UAAI,YAAY,MAAM;AAClB,aAAK,gBAAgB,MAAM,SAAS,MAAM;AAC1C,iBAASjD,KAAI,SAAS,KAAI,GAAI,CAACA,GAAE,KAAM,EAAC,QAAO;AAC3C,cAAIA,GAAE;AACF,iBAAK,UAAS;AAAA;AAEd,iBAAK,OAAOA,GAAE,KAAK;AAAA,QAC1B;AAAA,MACJ,WACQ,KAAK,YAAY,GAAG;AACzB,aAAK,aAAa,IAAI;AAAA,MACzB,WACQ,KAAK,YAAY,MAAM;AAC5B,YAAI,KAAK;AACL,eAAK,UAAS;AAAA,MACrB,WACQ,KAAK,YAAY,GAAG;AACzB,aAAK,UAAU,KAAK,YAAY,IAAI;AAAA,MACvC;AAAA,IACJ;AAAA,IACD,gBAAgB,MAAM,MAAM;AACxB,eAAS,SAAS,KAAK;AACnB,YAAI,MAAM,QAAQ,QAAQ,KAAK,WAAW,MAAM,MAAM,KAAK;AACvD,gBAAM,MAAM,KAAK,KAAK;AAAA,IACjC;AAAA,IACD,gBAAgB,MAAM,QAAQ;AAC1B,eAAS,SAAS,KAAK;AACnB,YAAI,KAAK,YAAY,IAAI,MAAM,QAAQ,OAAO,KAAK,SAAS,MAAM,IAAI;AAClE,gBAAM,MAAM,KAAK,KAAK,SAAS,KAAK,IAAI,QAAQ,MAAM,MAAM;AAAA,IACvE;AAAA,EACL;AACA,WAAS,eAAe,MAAM;AAC1B,WAAO,KAAK,YAAY,KAAK,sDAAsD,KAAK,KAAK,QAAQ;AAAA,EACzG;AAAA,EACA,MAAM,SAAS;AAAA,IACX,YAAY,MAAM,QAAQ;AACtB,WAAK,OAAO;AACZ,WAAK,SAAS;AACd,WAAK,MAAM;AAAA,IACd;AAAA,EACL;AAAA,EAEA,MAAM,gBAAgB,YAAY;AAAA,IAC9B,YAAY,MAAM;AACd;AACA,WAAK,OAAO;AACZ,WAAK,kBAAkB,WAAW;AAClC,WAAK,kBAAkB;AACvB,WAAK,cAAc;AACnB,WAAK,uBAAuB;AAQ5B,WAAK,WAAW;AAChB,WAAK,eAAe;AACpB,WAAK,aAAa;AAGlB,WAAK,kBAAkB;AACvB,WAAK,gBAAgB;AACrB,WAAK,iBAAiB;AAGtB,WAAK,aAAa,KAAK;AACvB,WAAK,OAAO,KAAK,UAAU;AAC3B,WAAK,WAAW,CAAC,IAAI,UAAQ;AAC7B,WAAK,SAAS,CAAC,EAAE,UAAU,IAAI;AAC/B,WAAK,WAAU;AACf,WAAK,YAAY,CAAC,IAAI,aAAa,GAAG,GAAG,GAAG,KAAK,MAAM,IAAI,MAAM,CAAC,GAAG,CAAC;AAAA,IACzE;AAAA,IACD,IAAI,SAAS;AAAE,aAAO,KAAK,KAAK,MAAM,IAAI;AAAA,IAAS;AAAA;AAAA,IAEnD,OAAO,QAAQ;AACX,UAAI,gBAAgB,OAAO;AAC3B,UAAI,KAAK,WAAW,KAAK,cAAc,QAAQ;AAC3C,YAAI,CAAC,cAAc,MAAM,CAAC,EAAE,OAAO,IAAG,MAAO,MAAM,KAAK,gBAAgB,QAAQ,KAAK,UAAU,GAAG;AAC9F,eAAK,WAAW,KAAK,eAAe,KAAK,aAAa;AAAA,QACzD,OACI;AACD,eAAK,eAAe,OAAO,QAAQ,OAAO,KAAK,cAAc,CAAC;AAC9D,eAAK,aAAa,OAAO,QAAQ,OAAO,KAAK,YAAY,CAAC;AAAA,QAC7D;AAAA,MACJ;AACD,OAAC,EAAE,MAAM,KAAK,iBAAiB,MAAM,KAAK,gBAAiB,IACvD,KAAK,KAAK,WAAW,YAAY,IAAI,SAAS,uBAAuB,KAAK,MAAM,OAAO,OAAO;AAMlG,WAAK,QAAQ,MAAM,QAAQ,WAAW,CAAC,KAAK,gBAAgB,QAAQ,UAChE,OAAO,MAAM,IAAI,SAAS,OAAO,WAAW,IAAI;AAChD,aAAK,iBAAiB;AAC1B,UAAI,WAAW,KAAK,aAAa,OAAO,KAAK;AAC7C,UAAI,WAAW,gBAAgB,UAAU,MAAM,OAAO,OAAO;AAC7D,sBAAgB,aAAa,iBAAiB,eAAe,QAAQ;AACrE,UAAI,KAAK,SAAS,KAAe,cAAc,UAAU,GAAG;AACxD,eAAO;AAAA,MACV,OACI;AACD,aAAK,YAAY,eAAe,OAAO,WAAW,IAAI,MAAM;AAC5D,YAAI,OAAO,aAAa;AACpB,eAAK,aAAa,KAAK;AAC3B,eAAO;AAAA,MACV;AAAA,IACJ;AAAA;AAAA;AAAA,IAGD,YAAY,SAAS,WAAW;AAC5B,WAAK,KAAK,UAAU,qBAAqB;AACzC,WAAK,eAAe,SAAS,SAAS;AACtC,UAAI,EAAE,SAAQ,IAAK,KAAK;AACxB,eAAS,OAAO,MAAM;AAKlB,aAAK,IAAI,MAAM,SAAS,KAAK,KAAK,UAAU,gBAAgB;AAC5D,aAAK,IAAI,MAAM,YAAY,KAAK,WAAW,KAAK,WAAW,OAAO;AAKlE,YAAI,QAAQ,QAAQ,UAAU,QAAQ,MAAM,EAAE,MAAM,SAAS,eAAe,WAAW,SAAS,MAAK,IAAK;AAC1G,aAAK,KAAK,KAAK,MAAM,KAAK;AAC1B,aAAK,QAAQ;AACb,YAAI,UAAU,MAAM,WAAW,SAAS,eAAe,aAAa,MAAM;AACtE,eAAK,iBAAiB;AAC1B,aAAK,IAAI,MAAM,SAAS;AAAA,MACpC,CAAS;AACD,UAAI,OAAO,CAAA;AACX,UAAI,KAAK,KAAK,SAAS,QAAQ,KAAK,KAAK,SAAS,KAAK,KAAK,KAAK,MAAM,IAAI;AACvE,iBAAS,SAAS,KAAK;AACnB,cAAI,iBAAiB,mBAAmB,MAAM,kBAAkB;AAC5D,iBAAK,KAAK,MAAM,GAAG;AAAA;AAC/B,eAAS,WAAW,IAAI;AAAA,IAC3B;AAAA,IACD,eAAe,SAAS,WAAW;AAC/B,UAAI,SAAS,KAAK,YAAY,SAAS;AACvC,eAASA,KAAI,QAAQ,SAAS,KAAIA,MAAK;AACnC,YAAI,OAAOA,MAAK,IAAI,QAAQA,EAAC,IAAI;AACjC,YAAI,CAAC;AACD;AACJ,YAAI,EAAE,OAAO,KAAK,OAAO,IAAG,IAAK;AACjC,YAAI,EAAE,SAAA2D,UAAS,cAAc,WAAW,YAAY,eAAe,MAAM,KAAK,KAAK,MAAM,KAAK,OAAO,KAAK,KAAK,aAAa,KAAK,oBAAoB;AACrJ,YAAI,EAAE,GAAG,KAAK,KAAK,UAAU,OAAO,QAAQ,KAAK,CAAC;AAClD,YAAI,EAAE,GAAG,OAAO,KAAK,QAAO,IAAK,OAAO,QAAQ,OAAO,EAAE;AACzD,qBAAa,MAAM,OAAO,SAAS,KAAK,OAAOA,UAAS,cAAc,WAAW,OAAO;AAAA,MAC3F;AAAA,IACJ;AAAA;AAAA,IAED,gBAAgB,WAAW,OAAO,cAAc,OAAO;AACnD,UAAI,YAAY,CAAC,KAAK,KAAK,SAAS,eAAe;AAC/C,aAAK,KAAK,SAAS;AACvB,UAAI,YAAY,KAAK,KAAK,KAAK,eAAe,UAAU,aAAa,KAAK;AAC1E,UAAI,oBAAoB,CAAC,WACrB,aAAa,KAAK,KAAK,KAAK,KAAK,SAAS,cAAc,KAAK,EAAE,aAAa,KAAK,IAAI,SAAS,SAAS;AAC3G,UAAI,EAAE,WAAW,eAAe;AAC5B;AACJ,UAAI,QAAQ,KAAK;AACjB,WAAK,iBAAiB;AACtB,UAAI,OAAO,KAAK,KAAK,MAAM,UAAU;AAErC,UAAI,SAAS,KAAK,SAAS,KAAK,MAAM;AACtC,UAAI,OAAO,KAAK,QAAQ,SAAS,KAAK,SAAS,KAAK,IAAI;AAGxD,UAAI,QAAQ,SAAS,KAAK,SAAS,CAAC,KAAK,gBAAgB,QAAQ,kBAAkB,MAAM,GAAG;AACxF,YAAI,QAAQ,SAAS,eAAe,EAAE;AACtC,aAAK,KAAK,SAAS,OAAO,MAAM,OAAO,KAAK,aAAa,OAAO,OAAO,KAAK,WAAW,OAAO,MAAM,KAAK,IAAI,CAAC;AAC9G,iBAAS,OAAO,IAAI,OAAO,OAAO,CAAC;AACnC,gBAAQ;AAAA,MACX;AACD,UAAI,SAAS,KAAK,KAAK,SAAS;AAEhC,UAAI,SAAS,CAAC,OAAO,aACjB,CAAC,qBAAqB,OAAO,MAAM,OAAO,QAAQ,OAAO,YAAY,OAAO,YAAY,KACxF,CAAC,qBAAqB,KAAK,MAAM,KAAK,QAAQ,OAAO,WAAW,OAAO,WAAW,GAAG;AACrF,aAAK,KAAK,SAAS,OAAO,MAAM;AAK5B,cAAI,QAAQ,WAAW,QAAQ,UAAU,KAAK,IAAI,SAAS,OAAO,SAAS,KACvE,aAAa,OAAO,WAAW,KAAK,GAAG,GAAG;AAC1C,iBAAK,IAAI;AACT,iBAAK,IAAI,MAAM,EAAE,eAAe,KAAM,CAAA;AAAA,UACzC;AACD,cAAI,SAAS,aAAa,KAAK,KAAK,IAAI;AACxC,cAAI,CAAC;AAAQ;AAAA,mBACJ,KAAK,OAAO;AAEjB,gBAAI,QAAQ,OAAO;AACf,kBAAI,SAAS,iBAAiB,OAAO,MAAM,OAAO,MAAM;AACxD,kBAAI,UAAU,WAAW,IAAiB,IAAgB;AACtD,oBAAI,OAAO,eAAe,OAAO,MAAM,OAAO,QAAQ,UAAU,IAAiB,IAAI,EAAE;AACvF,oBAAI;AACA,2BAAS,IAAI,OAAO,MAAM,UAAU,IAAiB,IAAI,KAAK,UAAU,MAAM;AAAA,cACrF;AAAA,YACJ;AACD,mBAAO,SAAS,OAAO,MAAM,OAAO,MAAM;AAC1C,gBAAI,KAAK,aAAa,QAAQ,OAAO,mBAAmB;AACpD,qBAAO,kBAAkB,KAAK;AAAA,UACrC,WACQ,OAAO,QAAQ;AAIpB,mBAAO,SAAS,OAAO,MAAM,OAAO,MAAM;AAI1C,gBAAI;AACA,qBAAO,OAAO,KAAK,MAAM,KAAK,MAAM;AAAA,YACvC,SACMtB,IAAG;AAAA,YAAG;AAAA,UAChB,OACI;AAED,gBAAI,QAAQ,SAAS;AACrB,gBAAI,KAAK,SAAS,KAAK;AACnB,eAAC,QAAQ,IAAI,IAAI,CAAC,MAAM,MAAM;AAClC,kBAAM,OAAO,KAAK,MAAM,KAAK,MAAM;AACnC,kBAAM,SAAS,OAAO,MAAM,OAAO,MAAM;AACzC,mBAAO,gBAAe;AACtB,mBAAO,SAAS,KAAK;AAAA,UACxB;AACD,cAAI,qBAAqB,KAAK,KAAK,KAAK,iBAAiB,KAAK,KAAK;AAC/D,iBAAK,IAAI;AACT,gBAAI;AACA,wBAAU,MAAK;AAAA,UACtB;AAAA,QACjB,CAAa;AACD,aAAK,KAAK,SAAS,kBAAkB,QAAQ,IAAI;AAAA,MACpD;AACD,WAAK,kBAAkB,OAAO,UAAU,OAAO,IAAI,OAAO,OAAO,YAAY,OAAO,YAAY;AAChG,WAAK,gBAAgB,KAAK,UAAU,OAAO,IAAI,OAAO,OAAO,WAAW,OAAO,WAAW;AAAA,IAC7F;AAAA,IACD,qBAAqB;AACjB,UAAI,KAAK,gBAAgB;AACrB;AACJ,UAAI,EAAE,KAAM,IAAG,MAAM,SAAS,KAAK,MAAM,UAAU;AACnD,UAAI,MAAM,aAAa,KAAK,IAAI;AAChC,UAAI,EAAE,YAAY,aAAY,IAAK,KAAK,SAAS;AACjD,UAAI,CAAC,OAAO,CAAC,OAAO,SAAS,CAAC,OAAO,SAAS,CAAC,IAAI;AAC/C;AACJ,UAAI,OAAO,SAAS,KAAK,MAAM,OAAO,IAAI;AAC1C,UAAI,CAAC;AACD;AACJ,UAAI,YAAY,KAAK;AACrB,UAAI,OAAO,QAAQ,aAAa,OAAO,QAAQ,YAAY,KAAK;AAC5D;AACJ,UAAI,SAAS,KAAK,SAAS,OAAO,MAAM,EAAE,GAAG,QAAQ,KAAK,SAAS,OAAO,MAAM,CAAC;AACjF,UAAI,CAAC,UAAU,CAAC,SAAS,OAAO,SAAS,MAAM;AAC3C;AACJ,UAAI,MAAM,KAAK,SAAS,OAAO,OAAO,OAAO,KAAK;AAClD,UAAI,SAAS,IAAI,MAAM,IAAI,MAAM;AACjC,UAAI,OAAO,QAAQ,OAAO,QAAQ,IAAI,YAAY,YAAY,cAAc;AAG5E,WAAK,SAAS;AACd,UAAI,WAAW,KAAK,SAAS;AAC7B,UAAI,KAAK,QAAQ,WAAW,SAAS,YAAY,SAAS,YAAY,KAAK,OAAO;AAC9E,YAAI,SAAS,YAAY,YAAY;AAAA,IAC5C;AAAA,IACD,QAAQ,KAAK;AACT,eAAS,MAAM,KAAK,OAAM;AACtB,YAAI,UAAU,YAAY,IAAI,GAAG;AACjC,YAAI,WAAW,QAAQ,YAAY;AAC/B,iBAAO;AACX,cAAM,IAAI;AAAA,MACb;AACD,aAAO;AAAA,IACV;AAAA,IACD,WAAW,MAAM,QAAQ;AACrB,UAAI,OAAO,KAAK,QAAQ,IAAI;AAC5B,UAAI,CAAC;AACD,cAAM,IAAI,WAAW,oEAAoE;AAC7F,aAAO,KAAK,gBAAgB,MAAM,MAAM,IAAI,KAAK;AAAA,IACpD;AAAA,IACD,SAAS,KAAK;AACV,UAAI,EAAE,GAAArC,IAAG,IAAG,IAAK,KAAK,YAAa,EAAC,QAAQ,KAAK,EAAE;AACnD,aAAOA,KAAI,KAAK,SAAS,SAAS,KAAI;AAClC,YAAI,QAAQ,KAAK,SAASA,EAAC;AAC3B,YAAI,MAAM,MAAM,UAAU,iBAAiB;AACvC;AACJ,QAAAA;AACA,cAAM;AAAA,MACT;AACD,aAAO,KAAK,SAASA,EAAC,EAAE,SAAS,GAAG;AAAA,IACvC;AAAA,IACD,SAAS,KAAK,MAAM;AAChB,eAAS,MAAM,KAAK,QAAQA,KAAI,KAAK,SAAS,SAAS,KAAIA,MAAK;AAC5D,YAAI,QAAQ,KAAK,SAASA,EAAC,GAAG,QAAQ,MAAM,MAAM,aAAa,MAAM;AACrE,YAAI,MAAM,SACL,OAAO,SAAS,MAAM,QAAQ,UAAU,gBAAgB,MAAM,QAAQ,UAAU,gBAC5E,CAACA,MAAK,QAAQ,KAAK,KAAK,SAASA,KAAI,CAAC,EAAE,cACpC,KAAK,SAASA,KAAI,CAAC,EAAE,QAAQ,UAAU,gBAAgB,OAAO;AACvE,iBAAO,MAAM,SAAS,MAAM,OAAO,IAAI;AAC3C,cAAM;AAAA,MACT;AAAA,IACJ;AAAA,IACD,0BAA0B,UAAU;AAChC,UAAI,SAAS,CAAA,GAAI,EAAE,MAAM,GAAE,IAAK;AAChC,UAAI,eAAe,KAAK,KAAK,WAAW;AACxC,UAAI,UAAU,eAAe,KAAK,IAAI,KAAK,KAAK,UAAU,aAAa,KAAK,QAAQ,IAAI;AACxF,UAAI,SAAS,IAAI,MAAM,KAAK,KAAK,iBAAiB,UAAU;AAC5D,eAAS,MAAM,GAAGA,KAAI,GAAGA,KAAI,KAAK,SAAS,QAAQA,MAAK;AACpD,YAAI,QAAQ,KAAK,SAASA,EAAC,GAAG,MAAM,MAAM,MAAM;AAChD,YAAI,MAAM;AACN;AACJ,YAAI,OAAO,MAAM;AACb,cAAI,YAAY,MAAM,IAAI,sBAAqB;AAC/C,iBAAO,KAAK,UAAU,MAAM;AAC5B,cAAI,SAAS;AACT,gBAAI,OAAO,MAAM,IAAI;AACrB,gBAAI,QAAQ,OAAO,eAAe,IAAI,IAAI,CAAA;AAC1C,gBAAI,MAAM,QAAQ;AACd,kBAAI,OAAO,MAAM,MAAM,SAAS,CAAC;AACjC,kBAAI,QAAQ,MAAM,KAAK,QAAQ,UAAU,OAAO,UAAU,QAAQ,KAAK;AACvE,kBAAI,QAAQ,QAAQ;AAChB,yBAAS;AACT,qBAAK,WAAW;AAChB,qBAAK,eAAe;AACpB,qBAAK,aAAa;AAAA,cACrB;AAAA,YACJ;AAAA,UACJ;AAAA,QACJ;AACD,cAAM,MAAM,MAAM;AAAA,MACrB;AACD,aAAO;AAAA,IACV;AAAA,IACD,gBAAgB,KAAK;AACjB,UAAI,EAAE,GAAAA,GAAC,IAAK,KAAK,SAAS,KAAK,CAAC;AAChC,aAAO,iBAAiB,KAAK,SAASA,EAAC,EAAE,GAAG,EAAE,aAAa,QAAQ,UAAU,MAAM,UAAU;AAAA,IAChG;AAAA,IACD,kBAAkB;AACd,eAAS,SAAS,KAAK,UAAU;AAC7B,YAAI,iBAAiB,UAAU;AAC3B,cAAI,UAAU,MAAM;AACpB,cAAI;AACA,mBAAO;AAAA,QACd;AAAA,MACJ;AAED,UAAI,QAAQ,SAAS,cAAc,KAAK,GAAG,YAAY,WAAW;AAClE,YAAM,YAAY;AAClB,YAAM,MAAM,QAAQ;AACpB,YAAM,cAAc;AACpB,WAAK,KAAK,SAAS,OAAO,MAAM;AAC5B,aAAK,IAAI,YAAY,KAAK;AAC1B,YAAI,OAAO,eAAe,MAAM,UAAU,EAAE,CAAC;AAC7C,qBAAa,MAAM,sBAAuB,EAAC;AAC3C,oBAAY,OAAO,KAAK,QAAQ,KAAK;AACrC,qBAAa,OAAO,KAAK,SAAS;AAClC,cAAM,OAAM;AAAA,MACxB,CAAS;AACD,aAAO,EAAE,YAAY,WAAW;IACnC;AAAA,IACD,YAAY,MAAM,KAAK,QAAQ;AAI3B,UAAIA,KAAI,KAAK,SAAS;AACtB,UAAIA;AACA,eAAO,KAAK,SAAS,EAAEA,EAAC,EAAE;AAC9B,aAAO,IAAI,YAAY,KAAK,UAAU,KAAKA,EAAC;AAAA,IAC/C;AAAA,IACD,sBAAsB;AAClB,UAAI,OAAO,CAAA,GAAI,KAAK,KAAK,KAAK;AAC9B,eAAS,MAAM,GAAGA,KAAI,KAAIA,MAAK;AAC3B,YAAI,OAAOA,MAAK,GAAG,UAAU,SAAS,OAAO,GAAG,UAAUA,EAAC;AAC3D,YAAI,MAAM,OAAO,KAAK,OAAO,IAAI,KAAK;AACtC,YAAI,MAAM,KAAK;AACX,cAAI,SAAS,GAAG,YAAY,GAAG,EAAE,SAAS,GAAG,YAAY,GAAG,EAAE;AAC9D,eAAK,KAAK,WAAW,QAAQ;AAAA,YACzB,QAAQ,IAAI,eAAe,MAAM;AAAA,YACjC,OAAO;AAAA,YACP,WAAW;AAAA,YACX,YAAY;AAAA,UACf,CAAA,EAAE,MAAM,KAAK,GAAG,CAAC;AAAA,QACrB;AACD,YAAI,CAAC;AACD;AACJ,cAAM,KAAK,KAAK;AAAA,MACnB;AACD,aAAO,WAAW,IAAI,IAAI;AAAA,IAC7B;AAAA,IACD,aAAa;AACT,UAAI,UAAU,KAAK,KAAK,MAAM,MAAM,WAAW,EAAE,IAAI,CAACqB,IAAGrB,OAAM;AAC3D,YAAI,UAAU,KAAK,qBAAqBA,EAAC,IAAI,OAAOqB,MAAK;AACzD,eAAO,UAAUA,GAAE,KAAK,IAAI,IAAIA;AAAA,MAC5C,CAAS;AACD,eAASrB,KAAI,QAAQ,QAAQA,KAAI,QAAQ,SAAS,GAAGA;AACjD,aAAK,qBAAqBA,EAAC,IAAI;AACnC,aAAO,KAAK,cAAc;AAAA,QACtB,GAAG;AAAA,QACH,KAAK;AAAA,QACL,KAAK,oBAAqB;AAAA,QAC1B,KAAK,KAAK,UAAU;AAAA,MAChC;AAAA,IACK;AAAA,IACD,eAAe,QAAQ;AACnB,UAAI,EAAE,MAAO,IAAG;AAChB,UAAI,OAAO,KAAK,SAAS,MAAM,MAAM,MAAM,QAAQ,MAAM,QAAQ,MAAM,OAAO,MAAM,SAAS,KAAK,CAAC,GAAG;AACtG,UAAI,CAAC;AACD;AACJ,UAAI,CAAC,MAAM,UAAU,QAAQ,KAAK,SAAS,MAAM,QAAQ,MAAM,SAAS,MAAM,OAAO,KAAK,CAAC;AACvF,eAAO;AAAA,UAAE,MAAM,KAAK,IAAI,KAAK,MAAM,MAAM,IAAI;AAAA,UAAG,KAAK,KAAK,IAAI,KAAK,KAAK,MAAM,GAAG;AAAA,UAC7E,OAAO,KAAK,IAAI,KAAK,OAAO,MAAM,KAAK;AAAA,UAAG,QAAQ,KAAK,IAAI,KAAK,QAAQ,MAAM,MAAM;AAAA;AAC5F,UAAI,UAAU,iBAAiB,KAAK,IAAI;AACxC,UAAI,aAAa;AAAA,QACb,MAAM,KAAK,OAAO,QAAQ;AAAA,QAAM,KAAK,KAAK,MAAM,QAAQ;AAAA,QACxD,OAAO,KAAK,QAAQ,QAAQ;AAAA,QAAO,QAAQ,KAAK,SAAS,QAAQ;AAAA,MAC7E;AACQ,yBAAmB,KAAK,KAAK,WAAW,YAAY,MAAM,OAAO,MAAM,SAAS,KAAK,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,SAAS,OAAO,SAAS,KAAK,KAAK,iBAAiB,UAAU,GAAG;AAAA,IACvL;AAAA,EACL;AACA,WAAS,kBAAkB,KAAK;AAC5B,WAAO,IAAI,KAAK,YAAY,KAAK,IAAI,KAAK,eACrC,IAAI,UAAU,KAAK,IAAI,KAAK,WAAW,IAAI,SAAS,CAAC,EAAE,mBAAmB,aAC1E,IAAI,UAAU,IAAI,KAAK,WAAW,UAAU,IAAI,KAAK,WAAW,IAAI,MAAM,EAAE,mBAAmB;AAAA,EACxG;AAAA,EACA,MAAM,uBAAuB,WAAW;AAAA,IACpC,YAAY,QAAQ;AAChB;AACA,WAAK,SAAS;AAAA,IACjB;AAAA,IACD,QAAQ;AACJ,UAAI,MAAM,SAAS,cAAc,KAAK;AACtC,WAAK,UAAU,GAAG;AAClB,aAAO;AAAA,IACV;AAAA,IACD,GAAG,OAAO;AAAE,aAAO,MAAM,UAAU,KAAK;AAAA,IAAS;AAAA,IACjD,UAAU,KAAK;AACX,UAAI,MAAM,SAAS,KAAK,SAAS;AACjC,aAAO;AAAA,IACV;AAAA,IACD,IAAI,kBAAkB;AAAE,aAAO,KAAK;AAAA,IAAS;AAAA,EACjD;AACA,WAAS,2BAA2B,MAAM;AACtC,QAAI,MAAM,KAAK,SAAS;AACxB,QAAI,WAAW,IAAI,aAAa,eAAe,IAAI,WAAW,IAAI,aAAa,CAAC;AAChF,QAAI,CAAC;AACD,aAAO;AACX,QAAI,QAAQ,KAAK,QAAQ,QAAQ,QAAQ;AACzC,QAAI,CAAC;AACD,aAAO;AACX,QAAI,iBAAiB,UAAU;AAC3B,UAAI,UAAU;AACd,aAAO,QAAQ,cAAc,MAAM;AAC/B,kBAAU,QAAQ;AACtB,UAAI,OAAO,QAAQ;AACnB,aAAO,QAAQ,CAAC,YAAY,IAAI,IAAI;AAChC,eAAO,KAAK;AAChB,UAAI,MAAM,OAAO,YAAY,IAAI,IAAI,EAAE,WAAW,MAAM;AACxD,aAAO,EAAE,MAAM,KAAK,IAAI,KAAK,MAAM,SAAS,MAAM;IACrD,OACI;AACD,iBAAS;AACL,YAAI,EAAE,OAAQ,IAAG;AACjB,YAAI,CAAC;AACD,iBAAO;AACX,YAAI,kBAAkB;AAClB;AACJ,gBAAQ;AAAA,MACX;AACD,UAAI,OAAO,MAAM;AACjB,aAAO,EAAE,MAAM,IAAI,OAAO,MAAM,QAAQ,MAAM,MAAM,KAAK,MAAM,SAAQ;AAAA,IAC1E;AAAA,EACL;AACA,QAAM,SAAS,EAAE,MAAM,WAAW,MAAM,MAAM;AAC9C,WAAS,uBAAuB,MAAM,SAAS;AAC3C,QAAI,cAAc,2BAA2B,IAAI;AACjD,QAAI,CAAC;AACD,aAAO;AACX,QAAI,EAAE,MAAM,IAAI,MAAM,MAAM,SAAU,IAAG;AACzC,QAAI,UAAU,QAAQ,OAAO,MAAM,CAAC,GAAG,QAAQ,KAAK,IAAI,SAAS,QAAQ,OAAO,IAAI,EAAE,CAAC;AACvF,QAAI,EAAE,MAAO,IAAG,MAAM,SAAS,IAAI,UAAU,CAAA,GAAI,KAAK;AACtD,QAAI,KAAK,YAAY;AACjB,aAAO,aAAa,IAAI;AAAA;AAExB,aAAO,UAAU,KAAK,YAAY,IAAI;AAC1C,QAAI,EAAE,KAAM,IAAG;AACf,QAAI,KAAK,QAAQ,oBAAoB,IAAI;AACrC,aAAO;AACX,QAAI,QAAQ,UAAU,KAAK,QAAQ;AAC/B,UAAI,MAAM,IAAI,YAAY,SAAS,KAAK,IAAI,MAAM,IAAI,QAAQ,UAAU,KAAK,MAAM,CAAC,KAAK;AACrF,gBAAQ,UAAU,KAAK;AAAA,eAClB,MAAM,IAAI,YAAY,KAAK,IAAI,GAAG,QAAQ,KAAK,MAAM,GAAG,KAAK,KAAK;AACvE,kBAAU,QAAQ,KAAK;AAAA;AAEvB,eAAO;AAAA,IACd,WACQ,MAAM,IAAI,YAAY,SAAS,KAAK,KAAK,MAAM;AACpD,aAAO;AAAA,IACV;AACD,QAAI,UAAU,YAAY,IAAI,IAAI;AAClC,QAAI,mBAAmB;AACnB,gBAAU,QAAQ,OAAO;AAAA,aACpB;AACL,cAAQ,SAAS;AACrB,QAAI,OAAO,WAAW,IAAI,WAAW,QAAQ,EAAE,QAAQ,IAAI,kBAAkB,MAAM,UAAU,OAAO,GAAG,WAAW,KAAI,CAAE,EACnH,MAAM,SAAS,KAAK,CAAC;AAC1B,WAAO,EAAE,MAAM;EACnB;AAAA,EACA,MAAM,0BAA0B,WAAW;AAAA,IACvC,YAAYuC,MAAK,MAAM,SAAS;AAC5B;AACA,WAAK,MAAMA;AACX,WAAK,OAAO;AACZ,WAAK,UAAU;AAAA,IAClB;AAAA,IACD,GAAG,OAAO;AAAE,aAAO,KAAK,OAAO,MAAM,OAAO,KAAK,QAAQ,MAAM;AAAA,IAAO;AAAA,IACtE,QAAQ;AAAE,aAAO,KAAK;AAAA,IAAM;AAAA,IAC5B,cAAc;AAAE,aAAO;AAAA,IAAQ;AAAA,IAC/B,IAAI,aAAa;AAAE,aAAO;AAAA,IAAkB;AAAA,EAChD;AACA,WAAS,eAAe,WAAW,aAAa,MAAM;AAClD,QAAI,QAAQ;AACR,eAAS,OAAO,WAAW,SAAS,iBAAe;AAC/C,YAAI,KAAK,YAAY;AACjB,iBAAO;AACX,YAAI,KAAK,YAAY,KAAK,SAAS,GAAG;AAClC,iBAAO,KAAK,WAAW,SAAS,CAAC;AACjC,mBAAS,UAAU,IAAI;AAAA,QAC1B,OACI;AACD;AAAA,QACH;AAAA,MACJ;AACL,QAAI,QAAQ;AACR,eAAS,OAAO,WAAW,SAAS,iBAAe;AAC/C,YAAI,KAAK,YAAY;AACjB,iBAAO;AACX,YAAI,KAAK,YAAY,KAAK,SAAS,KAAK,WAAW,UAAU,QAAQ,GAAG;AACpE,iBAAO,KAAK,WAAW,MAAM;AAC7B,mBAAS;AAAA,QACZ,OACI;AACD;AAAA,QACH;AAAA,MACJ;AACL,WAAO;AAAA,EACX;AACA,WAAS,iBAAiB,MAAM,QAAQ;AACpC,QAAI,KAAK,YAAY;AACjB,aAAO;AACX,YAAQ,UAAU,KAAK,WAAW,SAAS,CAAC,EAAE,mBAAmB,UAAU,IAAiB,MACvF,SAAS,KAAK,WAAW,UAAU,KAAK,WAAW,MAAM,EAAE,mBAAmB,UAAU,IAAgB;AAAA,EACjH;AAAA,EACA,MAAM,uBAAuB;AAAA,IACzB,cAAc;AACV,WAAK,UAAU;IAClB;AAAA,IACD,aAAa,MAAM,IAAI;AAAE,eAAS,MAAM,IAAI,KAAK,OAAO;AAAA,IAAI;AAAA,IAC5D,aAAa,MAAM,IAAI;AAAE,eAAS,MAAM,IAAI,KAAK,OAAO;AAAA,IAAI;AAAA,EAChE;AACA,WAAS,gBAAgB5C,IAAGsB,IAAG,MAAM;AACjC,QAAI,OAAO,IAAI;AACf,aAAS,QAAQtB,IAAGsB,IAAG,MAAM,IAAI;AACjC,WAAO,KAAK;AAAA,EAChB;AACA,WAAS,aAAa,MAAM+D,SAAQ;AAChC,aAAS,MAAM,MAAM,OAAO,OAAOA,SAAQ,MAAM,IAAI,gBAAgB,IAAI,YAAY;AACjF,UAAI,IAAI,YAAY,KAAK,IAAI,mBAAmB,SAAS;AACrD,eAAO;AAAA,MACV;AAAA,IACJ;AACD,WAAO;AAAA,EACX;AAEA,WAAS,QAAQ,OAAO,KAAK,OAAO,GAAG;AACnC,QAAI,aAAa,MAAM,gBAAgB,GAAG;AAC1C,QAAI,OAAO,MAAM,IAAI,OAAO,GAAG,GAAG,UAAU,MAAM,KAAK;AACvD,QAAI,KAAK,UAAU;AACf,aAAO,gBAAgB,OAAO,GAAG;AACrC,QAAI,WAAW;AACX,aAAO;AAAA,aACF,WAAW,KAAK;AACrB,aAAO;AACX,QAAI,OAAO,SAAS,KAAK;AACzB,QAAI,OAAO;AACP,aAAO,iBAAiB,KAAK,MAAM,SAAS,KAAK;AAAA;AAEjD,WAAK,iBAAiB,KAAK,MAAM,OAAO;AAC5C,QAAI,MAAM,WAAW,KAAK,KAAK,MAAM,MAAM,EAAE,CAAC;AAC9C,WAAO,OAAO,GAAG;AACb,UAAI,OAAO,iBAAiB,KAAK,MAAM,MAAM,KAAK;AAClD,UAAI,WAAW,KAAK,KAAK,MAAM,MAAM,IAAI,CAAC,KAAK;AAC3C;AACJ,aAAO;AAAA,IACV;AACD,WAAO,KAAK,KAAK,QAAQ;AACrB,UAAI,OAAO,iBAAiB,KAAK,MAAM,EAAE;AACzC,UAAI,WAAW,KAAK,KAAK,MAAM,IAAI,IAAI,CAAC,KAAK;AACzC;AACJ,WAAK;AAAA,IACR;AACD,WAAO,gBAAgB,MAAM,OAAO,KAAK,MAAM,KAAK,KAAK,IAAI;AAAA,EACjE;AAIA,WAAS,MAAMlF,IAAG,MAAM;AACpB,WAAO,KAAK,OAAOA,KAAI,KAAK,OAAOA,KAAI,KAAK,IAAI,GAAGA,KAAI,KAAK,KAAK;AAAA,EACrE;AACA,WAAS,MAAMuE,IAAG,MAAM;AACpB,WAAO,KAAK,MAAMA,KAAI,KAAK,MAAMA,KAAI,KAAK,IAAI,GAAGA,KAAI,KAAK,MAAM;AAAA,EACpE;AACA,WAAS,SAAS1E,IAAGsB,IAAG;AACpB,WAAOtB,GAAE,MAAMsB,GAAE,SAAS,KAAKtB,GAAE,SAASsB,GAAE,MAAM;AAAA,EACtD;AACA,WAAS,MAAM,MAAMsB,MAAK;AACtB,WAAOA,OAAM,KAAK,MAAM,EAAE,KAAAA,MAAK,MAAM,KAAK,MAAM,OAAO,KAAK,OAAO,QAAQ,KAAK,OAAQ,IAAG;AAAA,EAC/F;AACA,WAAS,MAAM,MAAM,QAAQ;AACzB,WAAO,SAAS,KAAK,SAAS,EAAE,KAAK,KAAK,KAAK,MAAM,KAAK,MAAM,OAAO,KAAK,OAAO,OAAQ,IAAG;AAAA,EAClG;AACA,WAAS,eAAe,QAAQzC,IAAGuE,IAAG;AAClC,QAAI,SAAS,aAAa,UAAU,UAAU,iBAAiB;AAC/D,QAAI,OAAO,OAAO,WAAW;AAC7B,aAAS,QAAQ,OAAO,YAAY,OAAO,QAAQ,MAAM,aAAa;AAClE,UAAI,QAAQ,eAAe,KAAK;AAChC,eAASrE,KAAI,GAAGA,KAAI,MAAM,QAAQA,MAAK;AACnC,YAAI,OAAO,MAAMA,EAAC;AAClB,YAAI,eAAe,SAAS,aAAa,IAAI;AACzC,iBAAO,MAAM,MAAM,MAAM,YAAY,MAAM,GAAG,YAAY,GAAG;AACjE,YAAI,KAAK,MAAMF,IAAG,IAAI,GAAG,KAAK,MAAMuE,IAAG,IAAI;AAC3C,YAAI,MAAM,KAAK,MAAM;AACjB,iBAAO,MAAM,YAAY,IAAI,aAAa,OAAOvE,IAAGuE,EAAC,IAAI,eAAe,OAAOvE,IAAGuE,EAAC;AACvF,YAAI,CAAC,WAAW,WAAW,MAAM,YAAY,MAAM,WAAW,IAAI;AAC9D,oBAAU;AACV,wBAAc;AACd,qBAAW;AACX,qBAAW;AACX,cAAI,OAAO,KAAMA,KAAI,KAAK,MAAM,KAAK,IAAK,KAAMvE,KAAI,KAAK,OAAO,KAAK,IAAK;AAC1E,2BAAiB,CAAC,SAAS,OAAO,IAAIE,KAAI,MAAM,SAAS,IAAIA,KAAI;AAAA,QACpE;AACD,YAAI,MAAM,GAAG;AACT,cAAIqE,KAAI,KAAK,WAAW,CAAC,aAAa,UAAU,SAAS,KAAK,SAAS;AACnE,oBAAQ;AACR,wBAAY;AAAA,UACf,WACQA,KAAI,KAAK,QAAQ,CAAC,aAAa,UAAU,MAAM,KAAK,MAAM;AAC/D,oBAAQ;AACR,wBAAY;AAAA,UACf;AAAA,QACJ,WACQ,aAAa,SAAS,WAAW,IAAI,GAAG;AAC7C,sBAAY,MAAM,WAAW,KAAK,MAAM;AAAA,QAC3C,WACQ,aAAa,SAAS,WAAW,IAAI,GAAG;AAC7C,sBAAY,MAAM,WAAW,KAAK,GAAG;AAAA,QACxC;AAAA,MACJ;AAAA,IACJ;AACD,QAAI,aAAa,UAAU,UAAUA,IAAG;AACpC,gBAAU;AACV,oBAAc;AAAA,IACjB,WACQ,aAAa,UAAU,OAAOA,IAAG;AACtC,gBAAU;AACV,oBAAc;AAAA,IACjB;AACD,QAAI,CAAC;AACD,aAAO,EAAE,MAAM,QAAQ,QAAQ,EAAC;AACpC,QAAI,QAAQ,KAAK,IAAI,YAAY,MAAM,KAAK,IAAI,YAAY,OAAOvE,EAAC,CAAC;AACrE,QAAI,QAAQ,YAAY;AACpB,aAAO,aAAa,SAAS,OAAOuE,EAAC;AACzC,QAAI,kBAAkB,QAAQ,mBAAmB;AAC7C,aAAO,eAAe,SAAS,OAAOA,EAAC;AAC3C,QAAI,SAAS,MAAM,UAAU,QAAQ,KAAK,OAAO,YAAY,OAAO,KAC/DvE,OAAM,YAAY,OAAO,YAAY,SAAS,IAAI,IAAI;AAC3D,WAAO,EAAE,MAAM,QAAQ;EAC3B;AACA,WAAS,aAAa,MAAMA,IAAGuE,IAAG;AAC9B,QAAI,MAAM,KAAK,UAAU;AACzB,QAAI,gBAAgB,IAAI,YAAY,KAAK,cAAc;AACvD,aAASrE,KAAI,GAAGA,KAAI,KAAKA,MAAK;AAC1B,UAAI,QAAQ,UAAU,MAAMA,IAAGA,KAAI,CAAC,EAAE;AACtC,eAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACnC,YAAI,OAAO,MAAM,CAAC;AAClB,YAAI,KAAK,OAAO,KAAK;AACjB;AACJ,YAAI,CAAC;AACD,wBAAcF,KAAI,KAAK;AAC3B,YAAI,MAAM,KAAK,MAAMuE,KAAI,KAAK,MAAMA,KAAIA,KAAI,KAAK,UAAU;AAC3D,YAAI,KAAK,OAAO,KAAKvE,MAAK,KAAK,QAAQ,KAAKA,MAAK,KAAK,WAAW;AAC7D,cAAI,QAAQA,OAAM,KAAK,OAAO,KAAK,SAAS,GAAG,QAAQ;AACvD,cAAI,QAAQ,UAAU,QAAQ,OAAO;AAGjC,gBAAI,aAAa,UAAU,MAAME,EAAC,EAAE,sBAAqB;AACzD,gBAAI,WAAW,QAAQ,KAAK;AACxB,sBAAQ,CAAC;AAAA,UAChB;AACD,cAAI,MAAM;AACN,mBAAO,EAAE,MAAM,QAAQA,MAAK,QAAQ,IAAI;AAC5C,0BAAgBA,MAAK,QAAQ,IAAI;AACjC,sBAAY;AAAA,QACf;AAAA,MACJ;AAAA,IACJ;AACD,WAAO,EAAE,MAAM,QAAQ,gBAAgB,KAAK,gBAAgB,cAAc,IAAI,KAAK,UAAU,SAAS,EAAC;AAAA,EAC3G;AACA,WAAS,YAAY,MAAM,QAAQ,SAAS,OAAO,IAAI;AACnD,QAAIkB,KAAI+D;AACR,QAAItB,WAAU,KAAK,WAAW,sBAAuB,GAAE,SAASA,SAAQ,MAAM,KAAK,UAAU;AAC7F,QAAI,OAAO,EAAE,cAAc,KAAK;AAChC,QAAI,EAAE,GAAA7D,IAAG,GAAAuE,GAAG,IAAG,QAAQ,UAAUA,KAAI;AACrC,QAAI,UAAU;AACV,aAAO;AACX,QAAI,UAAU;AACV,aAAO,KAAK,MAAM,IAAI;AAE1B,aAAS,WAAW,KAAK,UAAU,aAAa,aAAa,GAAG,UAAU,WAAS;AAC/E,cAAQ,KAAK,gBAAgB,OAAO;AACpC,UAAI,MAAM,QAAQ,UAAU;AACxB;AACJ,iBAAS;AAEL,kBAAU,OAAO,IAAI,MAAM,SAAS,WAAW,MAAM,MAAM;AAC3D,YAAI,WAAW,KAAK,WAAW;AAC3B;AAGJ,YAAI;AACA,iBAAO,UAAU,OAAO;AAC5B,kBAAU;AACV,eAAO,CAAC;AAAA,MACX;AAAA,IACJ;AACD,IAAAA,KAAI,SAAS;AACb,QAAI,YAAY,MAAM;AAEtB,QAAI,YAAY,KAAK,SAAS;AAC1B,aAAO,KAAK,SAAS,QAAQ,IAAI,IAAI,UAAU,OAAO,qBAAqB,MAAMV,UAAS,OAAO7D,IAAGuE,EAAC;AACzG,QAAI,YAAY,KAAK,SAAS;AAC1B,aAAO,KAAK,SAAS,MAAM,KAAK,MAAM,IAAI,SAAS,KAAK,MAAM,IAAI,SAC9D,UAAU,OAAO,qBAAqB,MAAMV,UAAS,OAAO7D,IAAGuE,EAAC;AAExE,QAAIZ,OAAM,KAAK,IAAI;AACnB,QAAI,OAAO,KAAK,KAAK,mBAAmB,KAAK,OAAOA;AACpD,QAAI,UAAU,KAAK,iBAAiB3D,IAAGuE,EAAC;AACxC,QAAI,WAAW,CAAC,KAAK,WAAW,SAAS,OAAO;AAC5C,gBAAU;AAEd,QAAI,CAAC,SAAS;AACV,MAAAvE,KAAI,KAAK,IAAI6D,SAAQ,OAAO,GAAG,KAAK,IAAIA,SAAQ,QAAQ,GAAG7D,EAAC,CAAC;AAC7D,gBAAU,KAAK,iBAAiBA,IAAGuE,EAAC;AACpC,UAAI,WAAW,CAAC,KAAK,WAAW,SAAS,OAAO;AAC5C,kBAAU;AAAA,IACjB;AAGD,QAAI,MAAM,SAAS;AACnB,QAAI,aAAanD,MAAK,KAAK,QAAQ,QAAQ,OAAO,OAAO,QAAQA,QAAO,SAAS,SAASA,IAAG,eAAe,OAAO;AAC/G,UAAIuC,KAAI,wBAAwB;AAC5B,YAAI,MAAMA,KAAI,uBAAuB3D,IAAGuE,EAAC;AACzC,YAAI;AACA,WAAC,EAAE,YAAY,MAAM,OAAM,IAAK;AAAA,MACvC,WACQZ,KAAI,qBAAqB;AAC9B,YAAI,QAAQA,KAAI,oBAAoB3D,IAAGuE,EAAC;AACxC,YAAI,OAAO;AACP,WAAC,EAAE,gBAAgB,MAAM,aAAa,OAAM,IAAK;AACjD,cAAI,CAAC,KAAK,WAAW,SAAS,IAAI,KAC9B,QAAQ,UAAU,8BAA8B,MAAM,QAAQvE,EAAC,KAC/D,QAAQ,UAAU,8BAA8B,MAAM,QAAQA,EAAC;AAC/D,mBAAO;AAAA,QACd;AAAA,MACJ;AAAA,IACJ;AAED,QAAI,CAAC,QAAQ,CAAC,KAAK,QAAQ,IAAI,SAAS,IAAI,GAAG;AAC3C,UAAI,OAAO,SAAS,KAAK,KAAK,SAAS,SAAS;AAChD,UAAI,CAAC;AACD,eAAO,UAAU,MAAM,MAAM,MAAM,SAAS,IAAI,MAAM,KAAK,MAAM;AACrE,OAAC,EAAE,MAAM,WAAW,eAAe,KAAK,KAAKA,IAAGuE,EAAC;AAAA,IACpD;AACD,QAAI,UAAU,KAAK,QAAQ,QAAQ,IAAI;AACvC,QAAI,CAAC;AACD,aAAO;AACX,QAAI,QAAQ,cAAcY,MAAK,QAAQ,SAAS,QAAQA,QAAO,SAAS,SAASA,IAAG,aAAa,GAAG;AAChG,UAAI,OAAO,QAAQ,IAAI,sBAAqB;AAC5C,aAAO,OAAO,IAAI,KAAK,OAAO,OAAO,KAAK,KAAK,UAAU,OAAO,MAAM,KAAK,OAAO,KAAK,SAAS,IAC1F,QAAQ,aAAa,QAAQ;AAAA,IACtC,OACI;AACD,aAAO,QAAQ,gBAAgB,MAAM,MAAM,IAAI,QAAQ;AAAA,IAC1D;AAAA,EACL;AACA,WAAS,qBAAqB,MAAM,aAAa,OAAOnF,IAAGuE,IAAG;AAC1D,QAAI,OAAO,KAAK,OAAOvE,KAAI,YAAY,QAAQ,KAAK,qBAAqB;AACzE,QAAI,KAAK,gBAAgB,MAAM,SAAS,KAAK,oBAAoB,KAAK;AAClE,UAAI,aAAa,KAAK,UAAU,aAAa;AAC7C,UAAI,OAAO,KAAK,OAAOuE,KAAI,MAAM,OAAO,KAAK,oBAAoB,cAAc,OAAO,UAAU;AAChG,cAAQ,OAAO,KAAK,UAAU,aAAa;AAAA,IAC9C;AACD,QAAIV,WAAU,KAAK,MAAM,SAAS,MAAM,MAAM,MAAM,EAAE;AACtD,WAAO,MAAM,OAAO,WAAWA,UAAS,MAAM,KAAK,MAAM,OAAO;AAAA,EACpE;AAKA,WAAS,8BAA8B,MAAM,QAAQ7D,IAAG;AACpD,QAAI;AACJ,QAAI,KAAK,YAAY,KAAK,WAAW,MAAM,KAAK,UAAU;AACtD,aAAO;AACX,aAAS,OAAO,KAAK,aAAa,MAAM,OAAO,KAAK;AAChD,UAAI,KAAK,YAAY,KAAK,KAAK,YAAY;AACvC,eAAO;AACf,WAAO,UAAU,MAAM,MAAM,GAAG,GAAG,EAAE,sBAAqB,EAAG,OAAOA;AAAA,EACxE;AAEA,WAAS,8BAA8B,MAAM,QAAQA,IAAG;AACpD,QAAI,UAAU;AACV,aAAO;AACX,aAAS,MAAM,UAAQ;AACnB,UAAI,SAAS,IAAI;AACjB,UAAI,CAAC,UAAU,OAAO,YAAY,KAAK,OAAO,cAAc;AACxD,eAAO;AACX,UAAI,OAAO,UAAU,SAAS,SAAS;AACnC;AACJ,YAAM;AAAA,IACT;AACD,QAAI,OAAO,KAAK,YAAY,IAAI,KAAK,sBAAuB,IACtD,UAAU,MAAM,GAAG,KAAK,IAAI,KAAK,UAAU,QAAQ,CAAC,CAAC,EAAE,sBAAqB;AAClF,WAAOA,KAAI,KAAK,OAAO;AAAA,EAC3B;AACA,WAAS,QAAQ,MAAM,KAAK;AACxB,QAAI,OAAO,KAAK,YAAY,GAAG;AAC/B,QAAI,MAAM,QAAQ,KAAK,IAAI;AACvB,eAASuD,MAAK,KAAK,MAAM;AACrB,YAAIA,GAAE,KAAK,OAAOA,GAAE,MAAM,QAAQA,GAAE,MAAM,KAAK,MAAMA,GAAE,QAAQ,UAAU;AACrE,iBAAOA;AAAA,MACd;AACL,WAAO;AAAA,EACX;AACA,WAAS,mBAAmB,MAAM,OAAO,SAAS,aAAa;AAC3D,QAAI,OAAO,QAAQ,MAAM,MAAM,IAAI;AACnC,QAAI,SAAS,CAAC,eAAe,KAAK,QAAQ,UAAU,QAAQ,EAAE,KAAK,gBAAgB,KAAK,oBAAoB,OACtG,KAAK,YAAY,MAAM,QAAQ,KAAK,MAAM,OAAO,KAAK,OAAO,MAAM,OAAO,IAAI,MAAM,IAAI;AAC9F,QAAI,QAAQ;AACR,UAAI,aAAa,KAAK,IAAI,sBAAqB;AAC/C,UAAI,YAAY,KAAK,gBAAgB,KAAK,IAAI;AAC9C,UAAI,MAAM,KAAK,YAAY;AAAA,QAAE,GAAG,YAAY,aAAa,UAAU,OAAO,WAAW,QAAQ,IAAI,WAAW,OAAO;AAAA,QAC/G,IAAI,OAAO,MAAM,OAAO,UAAU;AAAA,MAAC,CAAE;AACzC,UAAI,OAAO;AACP,eAAO,gBAAgB,OAAO,KAAK,UAAU,KAAK,CAAC;AAAA,IAC1D;AACD,WAAO,gBAAgB,OAAO,UAAU,KAAK,KAAK,KAAK,MAAM,UAAU,KAAK,CAAC;AAAA,EACjF;AACA,WAAS,WAAW,MAAM,OAAO,SAAS,IAAI;AAC1C,QAAI,OAAO,KAAK,MAAM,IAAI,OAAO,MAAM,IAAI,GAAG,QAAQ,KAAK,UAAU,IAAI;AACzE,QAAI,YAAY,KAAK,gBAAgB,KAAK,IAAI;AAC9C,aAAS,MAAM,OAAO,QAAQ,UAAQ;AAClC,UAAI,OAAO,aAAa,MAAM,OAAO,WAAW,KAAK,OAAO,GAAG,OAAO;AACtE,UAAI,CAAC,MAAM;AACP,YAAI,KAAK,WAAW,UAAU,KAAK,MAAM,IAAI,QAAQ;AACjD,iBAAO;AACX,eAAO;AACP,eAAO,KAAK,MAAM,IAAI,KAAK,KAAK,UAAU,UAAU,IAAI,GAAG;AAC3D,gBAAQ,KAAK,UAAU,IAAI;AAC3B,eAAO,gBAAgB,OAAO,UAAU,KAAK,OAAO,KAAK,EAAE;AAAA,MAC9D;AACD,UAAI,CAAC,OAAO;AACR,YAAI,CAAC;AACD,iBAAO;AACX,gBAAQ,GAAG,IAAI;AAAA,MAClB,WACQ,CAAC,MAAM,IAAI,GAAG;AACnB,eAAO;AAAA,MACV;AACD,YAAM;AAAA,IACT;AAAA,EACL;AACA,WAAS,QAAQ,MAAM,KAAK,OAAO;AAC/B,QAAI,aAAa,KAAK,MAAM,gBAAgB,GAAG;AAC/C,QAAI,MAAM,WAAW,KAAK;AAC1B,WAAO,CAAC,SAAS;AACb,UAAI,UAAU,WAAW,IAAI;AAC7B,UAAI,OAAO,aAAa;AACpB,cAAM;AACV,aAAO,OAAO;AAAA,IACtB;AAAA,EACA;AACA,WAAS,eAAe,MAAM,OAAO,SAAS,UAAU;AACpD,QAAI,WAAW,MAAM,MAAM,MAAM,UAAU,IAAI;AAC/C,QAAI,aAAa,UAAU,KAAK,MAAM,IAAI,SAAS;AAC/C,aAAO,gBAAgB,OAAO,UAAU,MAAM,KAAK;AACvD,QAAI,OAAO,MAAM,YAAY;AAC7B,QAAI,OAAO,KAAK,WAAW,sBAAqB;AAChD,QAAI,cAAc,KAAK,YAAY,QAAQ,GAAG,SAAS,KAAK;AAC5D,QAAI,aAAa;AACb,UAAI,QAAQ;AACR,eAAO,YAAY,OAAO,KAAK;AACnC,eAAS,MAAM,IAAI,YAAY,MAAM,YAAY;AAAA,IACpD,OACI;AACD,UAAI,OAAO,KAAK,UAAU,YAAY,QAAQ;AAC9C,UAAI,QAAQ;AACR,eAAO,KAAK,IAAI,KAAK,QAAQ,KAAK,MAAM,KAAK,yBAAyB,WAAW,KAAK,KAAK;AAC/F,gBAAU,MAAM,IAAI,KAAK,MAAM,KAAK,UAAU;AAAA,IACjD;AACD,QAAI,eAAe,KAAK,OAAO;AAC/B,QAAI,OAAO,aAAa,QAAQ,aAAa,SAAS,WAAY,KAAK,UAAU,aAAa,cAAc;AAC5G,aAAS,QAAQ,KAAI,SAAS,IAAI;AAC9B,UAAI,OAAO,UAAU,OAAO,SAAS;AACrC,UAAI,MAAM,YAAY,MAAM,EAAE,GAAG,cAAc,GAAG,KAAI,GAAI,OAAO,GAAG;AACpE,UAAI,OAAO,KAAK,OAAO,OAAO,KAAK,WAAW,MAAM,IAAI,MAAM,WAAW,MAAM;AAC3E,eAAO,gBAAgB,OAAO,KAAK,MAAM,OAAO,QAAW,IAAI;AAAA,IACtE;AAAA,EACL;AACA,WAAS,iBAAiB,OAAO,KAAK,MAAM;AACxC,eAAS;AACL,UAAI,QAAQ;AACZ,eAAS,OAAO,OAAO;AACnB,YAAI,QAAQ,MAAM,GAAG,MAAM,GAAG,CAAC,MAAM,IAAI,UAAU;AAC/C,cAAI,MAAM,QAAQ,MAAM,IAAI;AACxB,gBAAI,OAAO,SAAS,SAAS,MAAM,OAAO,KAAK,MAAM,KAAK;AAC1D,kBAAM,OAAO,IAAI,OAAO;AACxB,oBAAQ;AAAA,UACX;AAAA,QACjB,CAAa;AAAA,MACJ;AACD,UAAI,CAAC;AACD,eAAO;AAAA,IACd;AAAA,EACL;AACA,WAAS,UAAU,MAAM,QAAQ,KAAK;AAClC,QAAI,SAAS,iBAAiB,KAAK,MAAM,MAAM,YAAY,EAAE,IAAI,CAAAnB,OAAKA,GAAE,IAAI,CAAC,GAAG,IAAI,MAAM,OAAO,OAAO,IAAI,OAAO,KAAK,CAAC;AACzH,WAAO,UAAU,IAAI,OAAO,MAAM,gBAAgB,OAAO,QAAQ,SAAS,IAAI,OAAO,IAAI,EAAE;AAAA,EAC/F;AAAA,EAGA,MAAM,WAAW;AAAA,IACb,YAAY,MAAM;AACd,WAAK,cAAc;AACnB,WAAK,cAAc;AACnB,WAAK,gBAAgB;AACrB,WAAK,gBAAgB;AACrB,WAAK,gBAAgB;AACrB,WAAK,iBAAiB;AACtB,WAAK,mBAAmB;AAIxB,WAAK,gBAAgB;AACrB,WAAK,sBAAsB;AAC3B,WAAK,oBAAoB;AACzB,WAAK,eAAe;AACpB,WAAK,kBAAkB;AACvB,WAAK,iBAAiB;AACtB,WAAK,mBAAmB;AACxB,WAAK,iBAAiB;AAKtB,WAAK,YAAY;AAKjB,WAAK,yBAAyB;AAE9B,WAAK,qBAAqB;AAI1B,WAAK,wBAAwB;AAG7B,WAAK,2BAA2B;AAChC,WAAK,iBAAiB;AACtB,UAAI,cAAc,CAAC,SAAS,UAAU;AAClC,YAAI,KAAK,wBAAwB,KAAK;AAClC;AACJ,YAAI,MAAM,QAAQ,aAAa,KAAK,QAAQ,MAAM,KAAK;AACnD;AACJ,YAAI,KAAK,kBAAkB,KAAK;AAC5B,eAAK,SAAS;AAClB,YAAI,KAAK,kBAAkB,MAAM,MAAM,MAAM,KAAK;AAC9C,gBAAM,eAAc;AAAA;AAEpB,kBAAQ,MAAM,KAAK;AAAA,MACnC;AACQ,eAAS,QAAQ,UAAU;AACvB,YAAI,UAAU,SAAS,IAAI;AAC3B,aAAK,WAAW,iBAAiB,MAAM,WAAS;AAC5C,cAAI,qBAAqB,MAAM,KAAK;AAChC,wBAAY,SAAS,KAAK;AAAA,QAC9C,GAAe,eAAe,IAAI,CAAC;AACvB,aAAK,iBAAiB,KAAK,IAAI;AAAA,MAClC;AACD,WAAK,UAAU,iBAAiB,aAAa,CAAC,UAAU;AACpD,YAAI,MAAM,UAAU,KAAK,aAAa,MAAM,UAAU,KAAK,WAAW,sBAAqB,EAAG,QAAQ;AAClG,sBAAY,SAAS,WAAW,KAAK;AACrC,cAAI,CAAC,MAAM,oBAAoB,MAAM,UAAU,GAAG;AAG9C,gBAAI,QAAQ,KAAK,WAAW,MAAM;AAClC,iBAAK,WAAW,MAAM,YAAY;AAClC,uBAAW,MAAM,KAAK,WAAW,MAAM,YAAY,OAAO,GAAG;AAAA,UAChE;AAAA,QACJ;AAAA,MACb,CAAS;AACD,WAAK,UAAU,iBAAiB,QAAQ,CAAC,UAAU;AAC/C,YAAI,MAAM,UAAU,KAAK,aAAa,MAAM,UAAU,KAAK,WAAW,sBAAqB,EAAG;AAC1F,sBAAY,SAAS,MAAM,KAAK;AAAA,MAChD,CAAS;AACD,UAAI,QAAQ,UAAU,QAAQ,kBAAkB,KAAK;AAIjD,aAAK,UAAU,iBAAiB,SAAS,MAAM;AAC3C,cAAI,KAAK,mBAAmB;AACxB,iBAAK,WAAW,MAAM,gBAAgB;AAAA;AAEtC,mBAAO,aAAa,KAAK,gBAAgB;AAC7C,eAAK,mBAAmB,WAAW,MAAM;AACrC,iBAAK,mBAAmB;AACxB,iBAAK,WAAW,MAAM,gBAAgB;AAAA,UACzC,GAAE,GAAG;AAAA,QACtB,GAAe,EAAE,SAAS,KAAI,CAAE;AAAA,MACvB;AACD,WAAK,kBAAkB,KAAK;AAG5B,UAAI,QAAQ;AACR,aAAK,WAAW,iBAAiB,SAAS,MAAM,IAAI;AAAA,IAC3D;AAAA,IACD,mBAAmB,QAAQ;AACvB,WAAK,sBAAsB;AAC3B,WAAK,oBAAoB,KAAK;IACjC;AAAA,IACD,eAAe,MAAM,SAAS;AAC1B,UAAIhB;AACJ,UAAIgE;AACJ,WAAK,iBAAiB;AACtB,eAAS,UAAU;AACf,YAAIA,aAAYhE,MAAK,OAAO,OAAO,IAAI,EAAE,UAAU,QAAQA,QAAO,SAAS,SAASA,IAAG,kBAAkB;AACrG,eAAK,eAAe,KAAK,EAAE,QAAQ,OAAO,OAAO,UAAAgE,UAAQ,CAAE;AAC3D,mBAAS,QAAQA;AACb,gBAAI,KAAK,iBAAiB,QAAQ,IAAI,IAAI,KAAK,QAAQ,UAAU;AAC7D,mBAAK,iBAAiB,KAAK,IAAI;AAC/B,mBAAK,WAAW,iBAAiB,MAAM,CAAC,UAAU;AAC9C,oBAAI,CAAC,qBAAqB,MAAM,KAAK;AACjC;AACJ,oBAAI,KAAK,kBAAkB,MAAM,MAAM,KAAK;AACxC,wBAAM,eAAc;AAAA,cACpD,CAAyB;AAAA,YACJ;AAAA,QACR;AAAA,IACR;AAAA,IACD,kBAAkB,MAAM,MAAM,OAAO;AACjC,eAAS,OAAO,KAAK,gBAAgB;AACjC,YAAI,UAAU,IAAI,SAAS,IAAI;AAC/B,YAAI,SAAS;AACT,cAAI;AACA,gBAAI,QAAQ,KAAK,IAAI,QAAQ,OAAO,IAAI,KAAK,MAAM;AAC/C,qBAAO;AAAA,UACd,SACMrF,IAAG;AACN,yBAAa,KAAK,OAAOA,EAAC;AAAA,UAC7B;AAAA,QACJ;AAAA,MACJ;AACD,aAAO;AAAA,IACV;AAAA,IACD,kBAAkB,MAAM,OAAO;AAC3B,WAAK,gBAAgB,KAAK,UAAU;AACpC,WAAK,iBAAiB,KAAK,UAAU;AACrC,eAAS,OAAO,KAAK,gBAAgB;AACjC,YAAI,UAAU,IAAI,SAAS;AAC3B,YAAI,SAAS;AACT,cAAI;AACA,oBAAQ,KAAK,IAAI,QAAQ,OAAO,IAAI;AAAA,UACvC,SACMA,IAAG;AACN,yBAAa,KAAK,OAAOA,EAAC;AAAA,UAC7B;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AAAA,IACD,QAAQ,MAAM,OAAO;AAEjB,WAAK,cAAc,MAAM;AACzB,WAAK,cAAc,KAAK;AACxB,UAAI,MAAM,WAAW,KAAK,KAAK,QAAQ,KAAK,eAAe;AACvD,eAAO;AACX,UAAI,MAAM,WAAW,MAAM,cAAc,QAAQ,MAAM,OAAO,IAAI;AAC9D,aAAK,WAAW,eAAe;AAMnC,UAAI,QAAQ,WAAW,QAAQ,UAAU,CAAC,MAAM,cAC3C,MAAM,WAAW,MAAM,MAAM,WAAW,IAAI;AAC7C,aAAK,SAAS,gBAAgB,MAAM,KAAK,MAAM,OAAO;AACtD,eAAO;AAAA,MACV;AAMD,UAAI;AACJ,UAAI,QAAQ,OAAO,CAAC,MAAM,aAAa,CAAC,MAAM,UAAU,CAAC,MAAM,aACzD,UAAU,YAAY,KAAK,SAAO,IAAI,WAAW,MAAM,OAAO,MAAM,CAAC,MAAM,WACzE,kBAAkB,QAAQ,MAAM,GAAG,IAAI,MAAM,MAAM,WAAW,CAAC,MAAM,WAAW;AACpF,aAAK,gBAAgB,WAAW;AAChC,mBAAW,MAAM,KAAK,YAAY,IAAI,GAAG,GAAG;AAC5C,eAAO;AAAA,MACV;AACD,aAAO;AAAA,IACV;AAAA,IACD,YAAY,MAAM;AACd,UAAI,MAAM,KAAK;AACf,UAAI,CAAC;AACD,eAAO;AACX,WAAK,gBAAgB;AACrB,aAAO,YAAY,KAAK,YAAY,IAAI,KAAK,IAAI,OAAO;AAAA,IAC3D;AAAA,IACD,wBAAwB,OAAO;AAC3B,UAAI,CAAC,OAAO,KAAK,MAAM,IAAI;AACvB,eAAO;AACX,UAAI,KAAK,YAAY;AACjB,eAAO;AAOX,UAAI,QAAQ,UAAU,CAAC,QAAQ,OAAO,KAAK,yBAAyB,KAAK,IAAK,IAAG,KAAK,qBAAqB,KAAK;AAC5G,aAAK,wBAAwB;AAC7B,eAAO;AAAA,MACV;AACD,aAAO;AAAA,IACV;AAAA,IACD,kBAAkB,OAAO;AACrB,aAAO,MAAM,QAAQ,aAAa,MAAM,WAAW;AAAA,IACtD;AAAA,IACD,oBAAoB,gBAAgB;AAChC,UAAI,KAAK;AACL,aAAK,eAAe;AACxB,WAAK,iBAAiB;AAAA,IACzB;AAAA,IACD,OAAO,QAAQ;AACX,UAAI,KAAK;AACL,aAAK,eAAe,OAAO,MAAM;AACrC,UAAI,OAAO,aAAa;AACpB,aAAK,cAAc,KAAK,oBAAoB;AAAA,IACnD;AAAA,IACD,UAAU;AACN,UAAI,KAAK;AACL,aAAK,eAAe;IAC3B;AAAA,EACL;AACA,QAAM,cAAc;AAAA,IAChB,EAAE,KAAK,aAAa,SAAS,GAAG,WAAW,wBAAyB;AAAA,IACpE,EAAE,KAAK,SAAS,SAAS,IAAI,WAAW,kBAAmB;AAAA,IAC3D,EAAE,KAAK,SAAS,SAAS,IAAI,WAAW,kBAAmB;AAAA,IAC3D,EAAE,KAAK,UAAU,SAAS,IAAI,WAAW,uBAAwB;AAAA,EACrE;AACA,QAAM,oBAAoB;AAE1B,QAAM,gBAAgB,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,GAAG;AACvD,QAAM,mBAAmB;AACzB,WAAS,gBAAgB,MAAM;AAC3B,WAAO,KAAK,IAAI,GAAG,IAAI,IAAI,MAAM;AAAA,EACrC;AAAA,EACA,MAAM,eAAe;AAAA,IACjB,YAAY,MAAM,YAAY,OAAO,YAAY;AAC7C,WAAK,OAAO;AACZ,WAAK,QAAQ;AACb,WAAK,aAAa;AAClB,WAAK,cAAc,EAAE,GAAG,GAAG,GAAG;AAC9B,WAAK,YAAY;AACjB,WAAK,YAAY;AACjB,WAAK,eAAe,iBAAiB,KAAK,UAAU;AACpD,WAAK,QAAQ,KAAK,MAAM,MAAM,YAAY,EAAE,IAAI,CAAAqC,OAAKA,GAAE,IAAI,CAAC;AAC5D,UAAIuB,OAAM,KAAK,WAAW;AAC1B,MAAAA,KAAI,iBAAiB,aAAa,KAAK,OAAO,KAAK,KAAK,KAAK,IAAI,CAAC;AAClE,MAAAA,KAAI,iBAAiB,WAAW,KAAK,KAAK,KAAK,GAAG,KAAK,IAAI,CAAC;AAC5D,WAAK,SAAS,WAAW;AACzB,WAAK,WAAW,KAAK,MAAM,MAAM,YAAY,uBAAuB,KAAK,mBAAmB,MAAM,UAAU;AAC5G,WAAK,WAAW,qBAAqB,MAAM,UAAU,KAAK,aAAa,UAAU,KAAK,IAAI,OAAO;AAAA,IACpG;AAAA,IACD,MAAM,OAAO;AAGT,UAAI,KAAK,aAAa,OAAO;AACzB,cAAM,eAAc;AACpB,aAAK,OAAO,KAAK;AAAA,MACpB;AAAA,IACJ;AAAA,IACD,KAAK,OAAO;AACR,UAAIvC;AACJ,UAAI,MAAM,WAAW;AACjB,eAAO,KAAK;AAChB,UAAI,KAAK,aAAa;AAClB;AACJ,WAAK,OAAO,KAAK,YAAY,KAAK;AAClC,UAAI,KAAK,GAAG,KAAK;AACjB,UAAI,SAASA,MAAK,KAAK,kBAAkB,QAAQA,QAAO,SAAS,SAASA,IAAG,sBAAuB,MAC7F,EAAE,MAAM,GAAG,KAAK,GAAG,OAAO,KAAK,KAAK,IAAI,YAAY,QAAQ,KAAK,KAAK,IAAI;AACjF,UAAI,UAAU,iBAAiB,KAAK,IAAI;AACxC,UAAI,MAAM,UAAU,QAAQ,QAAQ,KAAK,OAAO;AAC5C,aAAK,CAAC,gBAAgB,KAAK,OAAO,MAAM,OAAO;AAAA,eAC1C,MAAM,UAAU,QAAQ,SAAS,KAAK,QAAQ;AACnD,aAAK,gBAAgB,MAAM,UAAU,KAAK,KAAK;AACnD,UAAI,MAAM,UAAU,QAAQ,OAAO,KAAK,MAAM;AAC1C,aAAK,CAAC,gBAAgB,KAAK,MAAM,MAAM,OAAO;AAAA,eACzC,MAAM,UAAU,QAAQ,UAAU,KAAK,SAAS;AACrD,aAAK,gBAAgB,MAAM,UAAU,KAAK,MAAM;AACpD,WAAK,eAAe,IAAI,EAAE;AAAA,IAC7B;AAAA,IACD,GAAG,OAAO;AACN,UAAI,KAAK,YAAY;AACjB,aAAK,OAAO,KAAK,SAAS;AAC9B,UAAI,CAAC,KAAK;AACN,cAAM,eAAc;AACxB,WAAK,QAAO;AAAA,IACf;AAAA,IACD,UAAU;AACN,WAAK,eAAe,GAAG,CAAC;AACxB,UAAIuC,OAAM,KAAK,KAAK,WAAW;AAC/B,MAAAA,KAAI,oBAAoB,aAAa,KAAK,IAAI;AAC9C,MAAAA,KAAI,oBAAoB,WAAW,KAAK,EAAE;AAC1C,WAAK,KAAK,WAAW,iBAAiB;AAAA,IACzC;AAAA,IACD,eAAe,IAAI,IAAI;AACnB,WAAK,cAAc,EAAE,GAAG,IAAI,GAAG;AAC/B,UAAI,MAAM,IAAI;AACV,YAAI,KAAK,YAAY;AACjB,eAAK,YAAY,YAAY,MAAM,KAAK,OAAM,GAAI,EAAE;AAAA,MAC3D,WACQ,KAAK,YAAY,IAAI;AAC1B,sBAAc,KAAK,SAAS;AAC5B,aAAK,YAAY;AAAA,MACpB;AAAA,IACJ;AAAA,IACD,SAAS;AACL,UAAI,KAAK,cAAc;AACnB,aAAK,aAAa,cAAc,KAAK,YAAY;AACjD,aAAK,aAAa,aAAa,KAAK,YAAY;AAAA,MACnD,OACI;AACD,aAAK,KAAK,IAAI,SAAS,KAAK,YAAY,GAAG,KAAK,YAAY,CAAC;AAAA,MAChE;AACD,UAAI,KAAK,aAAa;AAClB,aAAK,OAAO,KAAK,SAAS;AAAA,IACjC;AAAA,IACD,UAAU,KAAK;AACX,UAAI,SAAS;AACb,eAASzD,KAAI,GAAGA,KAAI,IAAI,OAAO,QAAQA,MAAK;AACxC,YAAI,QAAQ,IAAI,OAAOA,EAAC,GAAG,UAAU;AACrC,YAAI,MAAM,OAAO;AACb,cAAI,MAAM,iBAAiB,KAAK,OAAO,MAAM,MAAM,CAAC;AACpD,cAAI,OAAO,MAAM;AACb,sBAAU,gBAAgB,OAAO,KAAK,EAAE;AAAA,QAC/C,OACI;AACD,cAAI,OAAO,iBAAiB,KAAK,OAAO,MAAM,MAAM,EAAE;AACtD,cAAI,KAAK,iBAAiB,KAAK,OAAO,MAAM,IAAI,CAAC;AACjD,cAAI,QAAQ,MAAM,QAAQ,MAAM,MAAM;AAClC,sBAAU,gBAAgB,MAAM,MAAM,QAAQ,MAAM,SAAS,OAAO,IAAI,MAAM,QAAQ,MAAM,OAAO,OAAO,EAAE;AAAA,QACnH;AACD,YAAI,SAAS;AACT,cAAI,CAAC;AACD,qBAAS,IAAI,OAAO;AACxB,iBAAOA,EAAC,IAAI;AAAA,QACf;AAAA,MACJ;AACD,aAAO,SAAS,gBAAgB,OAAO,QAAQ,IAAI,SAAS,IAAI;AAAA,IACnE;AAAA,IACD,OAAO,OAAO;AACV,UAAI,EAAE,KAAI,IAAK,MAAM,YAAY,KAAK,UAAU,KAAK,MAAM,IAAI,OAAO,KAAK,QAAQ,KAAK,QAAQ,CAAC;AACjG,UAAI,KAAK,cAAc,CAAC,UAAU,GAAG,KAAK,MAAM,SAAS,KACrD,UAAU,KAAK,SAAS,KAAK,MAAM,UAAU,KAAK;AAClD,aAAK,KAAK,SAAS;AAAA,UACf;AAAA,UACA,WAAW;AAAA,QAC3B,CAAa;AACL,WAAK,aAAa;AAAA,IACrB;AAAA,IACD,OAAO,QAAQ;AACX,UAAI,OAAO,cAAc,KAAK;AAC1B,aAAK,WAAW,KAAK,SAAS,IAAI,OAAO,OAAO;AACpD,UAAI,KAAK,MAAM,OAAO,MAAM;AACxB,mBAAW,MAAM,KAAK,OAAO,KAAK,SAAS,GAAG,EAAE;AAAA,IACvD;AAAA,EACL;AACA,WAAS,mBAAmB,MAAM,OAAO;AACrC,QAAI,QAAQ,KAAK,MAAM,MAAM,uBAAuB;AACpD,WAAO,MAAM,SAAS,MAAM,CAAC,EAAE,KAAK,IAAI,QAAQ,MAAM,MAAM,UAAU,MAAM;AAAA,EAChF;AACA,WAAS,mBAAmB,MAAM,OAAO;AACrC,QAAI,QAAQ,KAAK,MAAM,MAAM,oBAAoB;AACjD,WAAO,MAAM,SAAS,MAAM,CAAC,EAAE,KAAK,IAAI,QAAQ,MAAM,CAAC,MAAM,SAAS,CAAC,MAAM;AAAA,EACjF;AACA,WAAS,qBAAqB,MAAM,OAAO;AACvC,QAAI,EAAE,KAAM,IAAG,KAAK,MAAM;AAC1B,QAAI,KAAK;AACL,aAAO;AAGX,QAAI,MAAM,aAAa,KAAK,IAAI;AAChC,QAAI,CAAC,OAAO,IAAI,cAAc;AAC1B,aAAO;AACX,QAAI,QAAQ,IAAI,WAAW,CAAC,EAAE,eAAc;AAC5C,aAASA,KAAI,GAAGA,KAAI,MAAM,QAAQA,MAAK;AACnC,UAAI,OAAO,MAAMA,EAAC;AAClB,UAAI,KAAK,QAAQ,MAAM,WAAW,KAAK,SAAS,MAAM,WAClD,KAAK,OAAO,MAAM,WAAW,KAAK,UAAU,MAAM;AAClD,eAAO;AAAA,IACd;AACD,WAAO;AAAA,EACX;AACA,WAAS,qBAAqB,MAAM,OAAO;AACvC,QAAI,CAAC,MAAM;AACP,aAAO;AACX,QAAI,MAAM;AACN,aAAO;AACX,aAAS,OAAO,MAAM,QAAQ,OAAO,QAAQ,KAAK,YAAY,OAAO,KAAK;AACtE,UAAI,CAAC,QAAQ,KAAK,YAAY,OAAQ,QAAQ,YAAY,IAAI,IAAI,MAAM,MAAM,YAAY,KAAK;AAC3F,eAAO;AACf,WAAO;AAAA,EACX;AACA,QAAM,WAAwB,uBAAO,OAAO,IAAI;AAChD,QAAM,iBAA8B,uBAAO,OAAO,IAAI;AAItD,QAAM,qBAAsB,QAAQ,MAAM,QAAQ,aAAa,MAC1D,QAAQ,OAAO,QAAQ,iBAAiB;AAC7C,WAAS,aAAa,MAAM;AACxB,QAAI,SAAS,KAAK,IAAI;AACtB,QAAI,CAAC;AACD;AACJ,QAAI,SAAS,OAAO,YAAY,SAAS,cAAc,UAAU,CAAC;AAClE,WAAO,MAAM,UAAU;AACvB,WAAO,MAAK;AACZ,eAAW,MAAM;AACb,WAAK,MAAK;AACV,aAAO,OAAM;AACb,cAAQ,MAAM,OAAO,KAAK;AAAA,IAC7B,GAAE,EAAE;AAAA,EACT;AACA,WAAS,QAAQ,MAAM,OAAO;AAC1B,QAAI,EAAE,MAAK,IAAK,MAAM,SAASA,KAAI,GAAG,OAAO,MAAM,OAAO,KAAK;AAC/D,QAAI,SAAS,KAAK,SAAS,MAAM,UAAU,OAAO;AAClD,QAAI,WAAW,oBAAoB,QAAQ,MAAM,UAAU,OAAO,MAAM,CAAAmB,OAAKA,GAAE,KAAK,KAAK,oBAAoB,KAAK,SAAQ;AAC1H,QAAI,UAAU;AACV,UAAI,WAAW;AACf,gBAAU,MAAM,cAAc,WAAS;AACnC,YAAI,OAAO,MAAM,IAAI,OAAO,MAAM,IAAI;AACtC,YAAI,KAAK,QAAQ;AACb,iBAAO,EAAE,MAAK;AAClB,mBAAW,KAAK;AAChB,YAAIyB,UAAS,MAAM,QAAQ,SAAS,KAAK,KAAK5C,IAAG,EAAE,OAAO,SAAS,MAAM,SAAS;AAClF,eAAO;AAAA,UAAE,SAAS,EAAE,MAAM,KAAK,MAAM,QAAA4C,QAAQ;AAAA,UACzC,OAAO,gBAAgB,OAAO,MAAM,OAAOA,QAAO,MAAM;AAAA;MACxE,CAAS;AAAA,IACJ,WACQ,QAAQ;AACb,gBAAU,MAAM,cAAc,WAAS;AACnC,YAAI,OAAO,KAAK,KAAK5C,IAAG;AACxB,eAAO;AAAA,UAAE,SAAS,EAAE,MAAM,MAAM,MAAM,IAAI,MAAM,IAAI,QAAQ,KAAK,KAAM;AAAA,UACnE,OAAO,gBAAgB,OAAO,MAAM,OAAO,KAAK,MAAM;AAAA;MACtE,CAAS;AAAA,IACJ,OACI;AACD,gBAAU,MAAM,iBAAiB,IAAI;AAAA,IACxC;AACD,SAAK,SAAS,SAAS;AAAA,MACnB,WAAW;AAAA,MACX,gBAAgB;AAAA,IACxB,CAAK;AAAA,EACL;AACA,WAAS,UAAU,CAAC,MAAM,UAAU;AAChC,SAAK,WAAW,mBAAmB,QAAQ;AAC3C,QAAI,MAAM,WAAW;AACjB,WAAK,WAAW,eAAe,KAAK,IAAG;AAAA,EAC/C;AACA,WAAS,aAAa,CAAC,MAAMH,OAAM;AAC/B,SAAK,WAAW,gBAAgB,KAAK,IAAG;AACxC,SAAK,WAAW,mBAAmB,gBAAgB;AAAA,EACvD;AACA,WAAS,YAAY,UAAQ;AACzB,SAAK,WAAW,mBAAmB,gBAAgB;AAAA,EACvD;AACA,iBAAe,aAAa,eAAe,YAAY,EAAE,SAAS,KAAI;AACtE,WAAS,YAAY,CAAC,MAAM,UAAU;AAClC,SAAK,SAAS;AACd,QAAI,KAAK,WAAW,gBAAgB,KAAK,IAAK,IAAG;AAC7C;AACJ,QAAI,QAAQ;AACZ,aAAS,aAAa,KAAK,MAAM,MAAM,mBAAmB,GAAG;AACzD,cAAQ,UAAU,MAAM,KAAK;AAC7B,UAAI;AACA;AAAA,IACP;AACD,QAAI,CAAC,SAAS,MAAM,UAAU;AAC1B,cAAQ,oBAAoB,MAAM,KAAK;AAC3C,QAAI,OAAO;AACP,UAAI,YAAY,CAAC,KAAK;AACtB,WAAK,WAAW,oBAAoB,IAAI,eAAe,MAAM,OAAO,OAAO,SAAS,CAAC;AACrF,UAAI;AACA,aAAK,SAAS,OAAO,MAAM,mBAAmB,KAAK,UAAU,CAAC;AAClE,UAAI,KAAK,WAAW;AAChB,aAAK,WAAW,eAAe,MAAM,KAAK;AAAA,IACjD;AAAA,EACL;AACA,WAAS,cAAc,MAAM,KAAK,MAAM,MAAM;AAC1C,QAAI,QAAQ,GAAG;AACX,aAAO,gBAAgB,OAAO,KAAK,IAAI;AAAA,IAC1C,WACQ,QAAQ,GAAG;AAChB,aAAO,QAAQ,KAAK,OAAO,KAAK,IAAI;AAAA,IACvC,OACI;AACD,UAAI,SAAS,SAAS,KAAK,KAAK,SAAS,GAAG,GAAG,OAAO,KAAK,MAAM,IAAI,OAAO,SAAS,OAAO,WAAW,GAAG;AAC1G,UAAI,OAAO,SAAS,OAAO,aAAa,KAAK,MAAM,KAAK,SAAS,OAAO,WAAW,KAAK;AACxF,UAAI,KAAK,KAAK,MAAM,IAAI,UAAU,MAAM,KAAK;AACzC;AACJ,aAAO,gBAAgB,MAAM,MAAM,EAAE;AAAA,IACxC;AAAA,EACL;AACA,MAAI,UAAU,CAACwE,IAAG,SAASA,MAAK,KAAK,OAAOA,MAAK,KAAK;AACtD,MAAI,SAAS,CAACvE,IAAGuE,IAAG,SAAS,QAAQA,IAAG,IAAI,KAAKvE,MAAK,KAAK,QAAQA,MAAK,KAAK;AAI7E,WAAS,iBAAiB,MAAM,KAAKA,IAAGuE,IAAG;AACvC,QAAI,OAAO,SAAS,KAAK,KAAK,SAAS,GAAG;AAC1C,QAAI,CAAC;AACD,aAAO;AACX,QAAI,MAAM,MAAM,KAAK;AAErB,QAAI,OAAO;AACP,aAAO;AACX,QAAI,OAAO,KAAK;AACZ,aAAO;AAEX,QAAI,SAAS,KAAK,SAAS,KAAK,EAAE;AAClC,QAAI,UAAU,OAAOvE,IAAGuE,IAAG,MAAM;AAC7B,aAAO;AACX,QAAI,QAAQ,KAAK,SAAS,KAAK,CAAC;AAChC,QAAI,SAAS,OAAOvE,IAAGuE,IAAG,KAAK;AAC3B,aAAO;AAGX,WAAO,UAAU,QAAQA,IAAG,MAAM,IAAI,KAAK;AAAA,EAC/C;AACA,WAAS,SAAS,MAAM,OAAO;AAC3B,QAAI,MAAM,KAAK,YAAY,EAAE,GAAG,MAAM,SAAS,GAAG,MAAM,QAAS,GAAE,KAAK;AACxE,WAAO,EAAE,KAAK,MAAM,iBAAiB,MAAM,KAAK,MAAM,SAAS,MAAM,OAAO,EAAC;AAAA,EACjF;AACA,QAAM,iBAAiB,QAAQ,MAAM,QAAQ,cAAc;AAC3D,MAAI,gBAAgB,MAAM,qBAAqB,GAAG,oBAAoB;AACtE,WAAS,aAAa,OAAO;AACzB,QAAI,CAAC;AACD,aAAO,MAAM;AACjB,QAAI,OAAO,eAAe,WAAW;AACrC,oBAAgB;AAChB,wBAAoB,KAAK;AACzB,WAAO,qBAAqB,CAAC,QAAS,WAAW,KAAK,IAAG,IAAK,OAAO,KAAK,IAAI,KAAK,UAAU,MAAM,OAAO,IAAI,KAC1G,KAAK,IAAI,KAAK,UAAU,MAAM,OAAO,IAAI,KAAM,qBAAqB,KAAK,IAAI;AAAA,EACrF;AACA,WAAS,oBAAoB,MAAM,OAAO;AACtC,QAAI,QAAQ,SAAS,MAAM,KAAK,GAAG,OAAO,aAAa,KAAK;AAC5D,QAAI,WAAW,KAAK,MAAM;AAC1B,WAAO;AAAA,MACH,OAAO,QAAQ;AACX,YAAI,OAAO,YAAY;AACnB,gBAAM,MAAM,OAAO,QAAQ,OAAO,MAAM,GAAG;AAC3C,qBAAW,SAAS,IAAI,OAAO,OAAO;AAAA,QACzC;AAAA,MACJ;AAAA,MACD,IAAIc,QAAOC,SAAQ,UAAU;AACzB,YAAI,MAAM,SAAS,MAAMD,MAAK,GAAG;AACjC,YAAI,QAAQ,cAAc,MAAM,IAAI,KAAK,IAAI,MAAM,IAAI;AACvD,YAAI,MAAM,OAAO,IAAI,OAAO,CAACC,SAAQ;AACjC,cAAI,aAAa,cAAc,MAAM,MAAM,KAAK,MAAM,MAAM,IAAI;AAChE,cAAI,OAAO,KAAK,IAAI,WAAW,MAAM,MAAM,IAAI,GAAG,KAAK,KAAK,IAAI,WAAW,IAAI,MAAM,EAAE;AACvF,kBAAQ,OAAO,MAAM,OAAO,gBAAgB,MAAM,MAAM,EAAE,IAAI,gBAAgB,MAAM,IAAI,IAAI;AAAA,QAC/F;AACD,YAAIA;AACA,iBAAO,SAAS,aAAa,SAAS,KAAK,OAAO,MAAM,MAAM,MAAM,EAAE,CAAC;AAAA,iBAClE,YAAY,QAAQ,KAAK,SAAS,OAAO,SAAS,MAAM,UAAU,kBAAkB,UAAU,IAAI,GAAG;AAC1G,iBAAO;AAAA,iBACF;AACL,iBAAO,SAAS,SAAS,KAAK;AAAA;AAE9B,iBAAO,gBAAgB,OAAO,CAAC,KAAK,CAAC;AAAA,MAC5C;AAAA,IACT;AAAA,EACA;AACA,WAAS,kBAAkB,KAAK,KAAK;AACjC,aAASpF,KAAI,GAAGA,KAAI,IAAI,OAAO,QAAQA,MAAK;AACxC,UAAI,EAAE,MAAM,GAAE,IAAK,IAAI,OAAOA,EAAC;AAC/B,UAAI,QAAQ,OAAO,MAAM;AACrB,eAAO,gBAAgB,OAAO,IAAI,OAAO,MAAM,GAAGA,EAAC,EAAE,OAAO,IAAI,OAAO,MAAMA,KAAI,CAAC,CAAC,GAAG,IAAI,aAAaA,KAAI,IAAI,IAAI,aAAa,IAAI,YAAYA,KAAI,IAAI,EAAE;AAAA,IACjK;AACD,WAAO;AAAA,EACX;AACA,WAAS,YAAY,CAAC,MAAM,UAAU;AAClC,QAAI,EAAE,WAAW,EAAE,KAAM,EAAA,IAAK,KAAK;AACnC,QAAI,EAAE,eAAc,IAAK,KAAK;AAC9B,QAAI;AACA,qBAAe,WAAW;AAC9B,QAAI,MAAM,cAAc;AACpB,YAAM,aAAa,QAAQ,QAAQ,KAAK,MAAM,SAAS,KAAK,MAAM,KAAK,EAAE,CAAC;AAC1E,YAAM,aAAa,gBAAgB;AAAA,IACtC;AAAA,EACL;AACA,WAAS,SAAS,MAAM,OAAO,MAAM,QAAQ;AACzC,QAAI,CAAC;AACD;AACJ,QAAI,UAAU,KAAK,YAAY,EAAE,GAAG,MAAM,SAAS,GAAG,MAAM,QAAS,GAAE,KAAK;AAC5E,UAAM,eAAc;AACpB,QAAI,EAAE,eAAc,IAAK,KAAK;AAC9B,QAAI,MAAM,UAAU,kBAAkB,eAAe,YAAY,mBAAmB,MAAM,KAAK,IAC3F,EAAE,MAAM,eAAe,SAAS,MAAM,IAAI,eAAe,SAAS,GAAI,IAAG;AAC7E,QAAI,MAAM,EAAE,MAAM,SAAS,QAAQ,KAAI;AACvC,QAAI,UAAU,KAAK,MAAM,QAAQ,MAAM,CAAC,KAAK,GAAG,IAAI,GAAG;AACvD,SAAK,MAAK;AACV,SAAK,SAAS;AAAA,MACV;AAAA,MACA,WAAW,EAAE,QAAQ,QAAQ,OAAO,SAAS,EAAE,GAAG,MAAM,QAAQ,OAAO,SAAS,CAAC,EAAG;AAAA,MACpF,WAAW,MAAM,cAAc;AAAA,IACvC,CAAK;AAAA,EACL;AACA,WAAS,OAAO,CAAC,MAAM,UAAU;AAC7B,QAAI,CAAC,MAAM;AACP;AACJ,QAAI,KAAK,MAAM;AACX,aAAO,MAAM;AACjB,QAAI,QAAQ,MAAM,aAAa;AAC/B,QAAI,SAAS,MAAM,QAAQ;AACvB,YAAM,eAAc;AACpB,UAAI,OAAO,MAAM,MAAM,MAAM,GAAG,OAAO;AACvC,UAAI,aAAa,MAAM;AACnB,YAAI,EAAE,QAAQ,MAAM;AAChB,mBAAS,MAAM,OAAO,KAAK,OAAO,CAAAQ,OAAKA,MAAK,IAAI,EAAE,KAAK,KAAK,MAAM,SAAS,GAAG,KAAK;AAAA,MACnG;AACQ,eAASR,KAAI,GAAGA,KAAI,MAAM,QAAQA,MAAK;AACnC,YAAI,SAAS,IAAI;AACjB,eAAO,UAAU;AACjB,eAAO,SAAS,MAAM;AAClB,cAAI,CAAC,0BAA0B,KAAK,OAAO,MAAM;AAC7C,iBAAKA,EAAC,IAAI,OAAO;AACrB;QAChB;AACY,eAAO,WAAW,MAAMA,EAAC,CAAC;AAAA,MAC7B;AAAA,IACJ,OACI;AACD,eAAS,MAAM,OAAO,MAAM,aAAa,QAAQ,MAAM,GAAG,IAAI;AAAA,IACjE;AAAA,EACL;AACA,WAAS,QAAQ,CAAC,MAAM,UAAU;AAC9B,QAAI,KAAK,MAAM;AACX,aAAO,MAAM;AACjB,SAAK,SAAS;AACd,QAAI,OAAO,qBAAqB,OAAO,MAAM;AAC7C,QAAI,MAAM;AACN,cAAQ,MAAM,KAAK,QAAQ,YAAY,KAAK,KAAK,QAAQ,eAAe,CAAC;AACzE,YAAM,eAAc;AAAA,IACvB,OACI;AACD,mBAAa,IAAI;AAAA,IACpB;AAAA,EACL;AACA,WAAS,YAAY,MAAM,MAAM;AAG7B,QAAI,SAAS,KAAK,IAAI;AACtB,QAAI,CAAC;AACD;AACJ,QAAI,SAAS,OAAO,YAAY,SAAS,cAAc,UAAU,CAAC;AAClE,WAAO,MAAM,UAAU;AACvB,WAAO,QAAQ;AACf,WAAO,MAAK;AACZ,WAAO,eAAe,KAAK;AAC3B,WAAO,iBAAiB;AACxB,eAAW,MAAM;AACb,aAAO,OAAM;AACb,WAAK,MAAK;AAAA,IACb,GAAE,EAAE;AAAA,EACT;AACA,WAAS,YAAY,OAAO;AACxB,QAAI2D,WAAU,CAAA,GAAI,SAAS,CAAA,GAAI,WAAW;AAC1C,aAAS,SAAS,MAAM,UAAU;AAC9B,UAAI,CAAC,MAAM,OAAO;AACd,QAAAA,SAAQ,KAAK,MAAM,SAAS,MAAM,MAAM,MAAM,EAAE,CAAC;AACjD,eAAO,KAAK,KAAK;AAAA,MACpB;AACL,QAAI,CAACA,SAAQ,QAAQ;AAEjB,UAAI,OAAO;AACX,eAAS,EAAE,KAAI,KAAM,MAAM,UAAU,QAAQ;AACzC,YAAI,OAAO,MAAM,IAAI,OAAO,IAAI;AAChC,YAAI,KAAK,SAAS,MAAM;AACpB,UAAAA,SAAQ,KAAK,KAAK,IAAI;AACtB,iBAAO,KAAK,EAAE,MAAM,KAAK,MAAM,IAAI,KAAK,IAAI,MAAM,IAAI,QAAQ,KAAK,KAAK,CAAC,EAAC,CAAE;AAAA,QAC/E;AACD,eAAO,KAAK;AAAA,MACf;AACD,iBAAW;AAAA,IACd;AACD,WAAO,EAAE,MAAMA,SAAQ,KAAK,MAAM,SAAS,GAAG,QAAQ;EAC1D;AACA,MAAI,mBAAmB;AACvB,WAAS,OAAO,SAAS,MAAM,CAAC,MAAM,UAAU;AAC5C,QAAI,EAAE,MAAM,QAAQ,SAAU,IAAG,YAAY,KAAK,KAAK;AACvD,QAAI,CAAC,QAAQ,CAAC;AACV;AACJ,uBAAmB,WAAW,OAAO;AACrC,QAAI,OAAO,qBAAqB,OAAO,MAAM;AAC7C,QAAI,MAAM;AACN,YAAM,eAAc;AACpB,WAAK,UAAS;AACd,WAAK,QAAQ,cAAc,IAAI;AAAA,IAClC,OACI;AACD,kBAAY,MAAM,IAAI;AAAA,IACzB;AACD,QAAI,MAAM,QAAQ,SAAS,CAAC,KAAK,MAAM;AACnC,WAAK,SAAS;AAAA,QACV,SAAS;AAAA,QACT,gBAAgB;AAAA,QAChB,WAAW;AAAA,MACvB,CAAS;AAAA,EACT;AACA,QAAM,gBAA6B,2BAAW;AAC9C,WAAS,uBAAuB,OAAO,OAAO;AAC1C,QAAI,UAAU,CAAA;AACd,aAAS,aAAa,MAAM,MAAM,iBAAiB,GAAG;AAClD,UAAI,SAAS,UAAU,OAAO,KAAK;AACnC,UAAI;AACA,gBAAQ,KAAK,MAAM;AAAA,IAC1B;AACD,WAAO,UAAU,MAAM,OAAO,EAAE,SAAS,aAAa,cAAc,GAAG,IAAI,EAAG,CAAA,IAAI;AAAA,EACtF;AACA,WAAS,qBAAqB,MAAM;AAChC,eAAW,MAAM;AACb,UAAI,QAAQ,KAAK;AACjB,UAAI,SAAS,KAAK,WAAW,iBAAiB;AAC1C,YAAI,KAAK,uBAAuB,KAAK,OAAO,KAAK;AACjD,YAAI;AACA,eAAK,SAAS,EAAE;AAAA;AAEhB,eAAK,OAAO,CAAA,CAAE;AAAA,MACrB;AAAA,IACJ,GAAE,EAAE;AAAA,EACT;AACA,WAAS,QAAQ,UAAQ;AACrB,SAAK,WAAW,gBAAgB,KAAK,IAAG;AAExC,QAAI,CAAC,KAAK,UAAU,cAAc,KAAK,WAAW,iBAAiB,KAAK,WAAW,iBAAiB;AAChG,WAAK,UAAU,YAAY,KAAK,WAAW;AAC3C,WAAK,UAAU,aAAa,KAAK,WAAW;AAAA,IAC/C;AACD,yBAAqB,IAAI;AAAA,EAC7B;AACA,WAAS,OAAO,UAAQ;AACpB,SAAK,SAAS;AACd,yBAAqB,IAAI;AAAA,EAC7B;AACA,WAAS,mBAAmB,SAAS,oBAAoB,UAAQ;AAC7D,QAAI,KAAK,WAAW,0BAA0B;AAC1C,WAAK,WAAW,yBAAyB;AAC7C,QAAI,KAAK,WAAW,YAAY,GAAG;AAE/B,WAAK,WAAW,YAAY;AAAA,IAC/B;AAAA,EACL;AACA,WAAS,iBAAiB,UAAQ;AAC9B,SAAK,WAAW,YAAY;AAC5B,SAAK,WAAW,qBAAqB,KAAK,IAAG;AAC7C,SAAK,WAAW,wBAAwB;AACxC,SAAK,WAAW,2BAA2B,KAAK,SAAS,eAAgB,EAAC,SAAS;AACnF,SAAK,WAAW,yBAAyB;AACzC,QAAI,QAAQ,UAAU,QAAQ,SAAS;AAGnC,WAAK,SAAS;IACjB,WACQ,KAAK,WAAW,0BAA0B;AAE/C,cAAQ,QAAO,EAAG,KAAK,MAAM,KAAK,SAAS,MAAK,CAAE;AAAA,IACrD,OACI;AAGD,iBAAW,MAAM;AACb,YAAI,KAAK,WAAW,YAAY,KAAK,KAAK,QAAQ,gBAAgB;AAC9D,eAAK,OAAO,CAAA,CAAE;AAAA,MACrB,GAAE,EAAE;AAAA,IACR;AAAA,EACL;AACA,WAAS,cAAc,UAAQ;AAC3B,SAAK,WAAW,kBAAkB,KAAK,IAAG;AAAA,EAC9C;AACA,WAAS,cAAc,CAAC,MAAM,UAAU;AACpC,QAAIzC;AAQJ,QAAI;AACJ,QAAI,QAAQ,UAAU,QAAQ,YAAY,UAAU,YAAY,KAAK,SAAO,IAAI,aAAa,MAAM,SAAS,IAAI;AAC5G,WAAK,SAAS,gBAAgB,QAAQ,KAAK,QAAQ,OAAO;AAC1D,UAAI,QAAQ,OAAO,eAAe,QAAQ,OAAO,UAAU;AACvD,YAAI,oBAAoBA,MAAK,OAAO,oBAAoB,QAAQA,QAAO,SAAS,SAASA,IAAG,WAAW;AACvG,mBAAW,MAAM;AACb,cAAIA;AAIJ,iBAAOA,MAAK,OAAO,oBAAoB,QAAQA,QAAO,SAAS,SAASA,IAAG,WAAW,KAAK,kBAAkB,MAAM,KAAK,UAAU;AAC9H,iBAAK,WAAW;AAChB,iBAAK,MAAK;AAAA,UACb;AAAA,QACJ,GAAE,GAAG;AAAA,MACT;AAAA,IACJ;AAAA,EACL;AAEA,QAAM,qBAAqB,CAAC,YAAY,UAAU,YAAY,cAAc;AAAA,EAC5E,MAAM,aAAa;AAAA,IACf,YAAY,cAAc;AACtB,WAAK,eAAe;AACpB,WAAK,MAAM,KAAK;AAChB,WAAK,gBAAgB;AACrB,WAAK,aAAa;AAClB,WAAK,YAAY;AACjB,WAAK,aAAa;AAClB,WAAK,aAAa;AAElB,WAAK,gBAAgB;AAAA,IACxB;AAAA,IACD,aAAa,MAAM,IAAI;AACnB,UAAI,QAAQ,KAAK,IAAI,OAAO,EAAE,EAAE,SAAS,KAAK,IAAI,OAAO,IAAI,EAAE,SAAS;AACxE,UAAI,KAAK;AACL,iBAAS,KAAK,IAAI,GAAG,KAAK,MAAO,KAAK,OAAS,QAAQ,KAAK,aAAa,OAAQ,KAAK,UAAU,CAAC;AACrG,aAAO,KAAK,aAAa;AAAA,IAC5B;AAAA,IACD,cAAc,QAAQ;AAClB,UAAI,CAAC,KAAK;AACN,eAAO,KAAK;AAChB,UAAI,QAAQ,IAAI,KAAK,IAAI,GAAG,KAAK,MAAM,SAAS,KAAK,eAAe,KAAK,aAAa,EAAE,CAAC;AACzF,aAAO,QAAQ,KAAK;AAAA,IACvB;AAAA,IACD,OAAOuC,MAAK;AAAE,WAAK,MAAMA;AAAK,aAAO;AAAA,IAAO;AAAA,IAC5C,uBAAuB,YAAY;AAC/B,aAAQ,mBAAmB,QAAQ,UAAU,IAAI,MAAO,KAAK;AAAA,IAChE;AAAA,IACD,sBAAsB,aAAa;AAC/B,UAAI,YAAY;AAChB,eAASzD,KAAI,GAAGA,KAAI,YAAY,QAAQA,MAAK;AACzC,YAAImD,KAAI,YAAYnD,EAAC;AACrB,YAAImD,KAAI,GAAG;AACP,UAAAnD;AAAA,QACH,WACQ,CAAC,KAAK,cAAc,KAAK,MAAMmD,KAAI,EAAE,CAAC,GAAG;AAC9C,sBAAY;AACZ,eAAK,cAAc,KAAK,MAAMA,KAAI,EAAE,CAAC,IAAI;AAAA,QAC5C;AAAA,MACJ;AACD,aAAO;AAAA,IACV;AAAA,IACD,QAAQ,YAAY,YAAY,WAAW,YAAY,YAAY,cAAc;AAC7E,UAAI,eAAe,mBAAmB,QAAQ,UAAU,IAAI;AAC5D,UAAI,UAAU,KAAK,MAAM,UAAU,KAAK,KAAK,MAAM,KAAK,UAAU,KAAK,KAAK,gBAAgB;AAC5F,WAAK,eAAe;AACpB,WAAK,aAAa;AAClB,WAAK,YAAY;AACjB,WAAK,aAAa;AAClB,WAAK,aAAa;AAClB,UAAI,SAAS;AACT,aAAK,gBAAgB;AACrB,iBAASnD,KAAI,GAAGA,KAAI,aAAa,QAAQA,MAAK;AAC1C,cAAImD,KAAI,aAAanD,EAAC;AACtB,cAAImD,KAAI;AACJ,YAAAnD;AAAA;AAEA,iBAAK,cAAc,KAAK,MAAMmD,KAAI,EAAE,CAAC,IAAI;AAAA,QAChD;AAAA,MACJ;AACD,aAAO;AAAA,IACV;AAAA,EACL;AAAA,EAIA,MAAM,gBAAgB;AAAA,IAClB,YAAY,MAAM,SAAS;AACvB,WAAK,OAAO;AACZ,WAAK,UAAU;AACf,WAAK,QAAQ;AAAA,IAChB;AAAA,IACD,IAAI,OAAO;AAAE,aAAO,KAAK,QAAQ,KAAK,QAAQ;AAAA,IAAS;AAAA,EAC3D;AAAA,EAKA,MAAM,UAAU;AAAA;AAAA;AAAA;AAAA,IAIZ,YAIA,MAIA,QAKAZ,MAIA,QAOA,UAAU;AACN,WAAK,OAAO;AACZ,WAAK,SAAS;AACd,WAAK,MAAMA;AACX,WAAK,SAAS;AACd,WAAK,WAAW;AAAA,IACnB;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,IAAI,OAAO;AACP,aAAO,OAAO,KAAK,YAAY,WAAW,UAAU,OAChD,MAAM,QAAQ,KAAK,QAAQ,IAAI,KAAK,WAAW,KAAK,SAAS;AAAA,IACpE;AAAA;AAAA;AAAA;AAAA,IAID,IAAI,KAAK;AAAE,aAAO,KAAK,OAAO,KAAK;AAAA,IAAS;AAAA;AAAA;AAAA;AAAA,IAI5C,IAAI,SAAS;AAAE,aAAO,KAAK,MAAM,KAAK;AAAA,IAAS;AAAA;AAAA;AAAA;AAAA;AAAA,IAK/C,IAAI,SAAS;AACT,aAAO,KAAK,oBAAoB,kBAAkB,KAAK,SAAS,SAAS;AAAA,IAC5E;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,IAAI,mBAAmB;AACnB,aAAO,OAAO,KAAK,YAAY,WAAW,KAAK,WAAW;AAAA,IAC7D;AAAA;AAAA;AAAA;AAAA,IAID,KAAK,OAAO;AACR,UAAIoB,YAAW,MAAM,QAAQ,KAAK,QAAQ,IAAI,KAAK,WAAW,CAAC,IAAI,GAC9D,OAAO,MAAM,QAAQ,MAAM,QAAQ,IAAI,MAAM,WAAW,CAAC,KAAK,CAAC;AACpE,aAAO,IAAI,UAAU,KAAK,MAAM,KAAK,SAAS,MAAM,QAAQ,KAAK,KAAK,KAAK,SAAS,MAAM,QAAQA,QAAO;AAAA,IAC5G;AAAA,EACL;AACA,MAAI,YAA0B,yBAAU0B,YAAW;AAC/C,IAAAA,WAAUA,WAAU,OAAO,IAAI,CAAC,IAAI;AACpC,IAAAA,WAAUA,WAAU,UAAU,IAAI,CAAC,IAAI;AACvC,IAAAA,WAAUA,WAAU,eAAe,IAAI,CAAC,IAAI;AAChD,WAAOA;AAAA,EAAS,EAAG,cAAc,YAAY,CAAA,EAAG;AAChD,QAAM,UAAU;AAAA,EAChB,MAAM,UAAU;AAAA,IACZ,YAAY,QACZ,QACA,QAAQ,GAAkB;AACtB,WAAK,SAAS;AACd,WAAK,SAAS;AACd,WAAK,QAAQ;AAAA,IAChB;AAAA,IACD,IAAI,WAAW;AAAE,cAAQ,KAAK,QAAQ,KAAoB;AAAA,IAAI;AAAA,IAC9D,IAAI,SAAS,OAAO;AAAE,WAAK,SAAS,QAAQ,IAAmB,KAAM,KAAK,QAAQ,CAAC;AAAA,IAAoB;AAAA,IACvG,UAAU,QAAQ,QAAQ;AACtB,UAAI,KAAK,UAAU,QAAQ;AACvB,YAAI,KAAK,IAAI,KAAK,SAAS,MAAM,IAAI;AACjC,iBAAO,gBAAgB;AAC3B,aAAK,SAAS;AAAA,MACjB;AAAA,IACJ;AAAA;AAAA;AAAA;AAAA,IAID,QAAQ,OAAO,KAAK,OAAO;AACvB,aAAO,UAAU,GAAG,KAAK;AAAA,IAC5B;AAAA;AAAA,IAED,cAAc,KAAK,QAAQ;AAAE,aAAO,KAAK,IAAI;AAAA,IAAI;AAAA,IACjD,eAAe,OAAO,QAAQ;AAAE,aAAO,KAAK,IAAI;AAAA,IAAI;AAAA,IACpD,aAAaR,cAAa,QAAQ,QAAQ,SAAS;AAC/C,UAAI,KAAK,MAAMpB,OAAM,OAAO;AAC5B,eAASzD,KAAI,QAAQ,SAAS,GAAGA,MAAK,GAAGA,MAAK;AAC1C,YAAI,EAAE,OAAO,KAAK,OAAO,QAAQ,QAAQA,EAAC;AAC1C,YAAI,QAAQ,GAAG,OAAO,OAAO,UAAU,eAAe,OAAO,OAAO,MAAM,GAAG,GAAG,CAAC;AACjF,YAAI,MAAM,MAAM,MAAM,MAAM,QAAQ,GAAG,OAAO,KAAK,UAAU,eAAe,QAAQ,GAAG,CAAC;AACxF,eAAO,IAAI,KAAK;AAChB,cAAM,IAAI;AACV,eAAOA,KAAI,KAAK,MAAM,QAAQ,QAAQA,KAAI,CAAC,EAAE,KAAK;AAC9C,kBAAQ,QAAQA,KAAI,CAAC,EAAE;AACvB,kBAAQ,QAAQA,KAAI,CAAC,EAAE;AACvB,UAAAA;AACA,cAAI,QAAQ,MAAM;AACd,oBAAQ,GAAG,OAAO,OAAO,UAAU,eAAe,QAAQ,GAAG,CAAC;AAAA,QACrE;AACD,iBAAS,MAAM,OAAO;AACtB,gBAAQ,MAAM;AACd,YAAI,QAAQ,YAAY,MAAM,OAAO,OAAOyD,IAAG,GAAGoB,cAAa,OAAO,GAAG;AACzE,aAAK,GAAG,QAAQ,OAAO,KAAK,KAAK;AAAA,MACpC;AACD,aAAO,GAAG,aAAa,QAAQ,CAAC;AAAA,IACnC;AAAA,IACD,OAAO,QAAQ;AAAE,aAAO,IAAI,cAAc,GAAG,CAAC;AAAA,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA,IAKlD,OAAO,GAAG,OAAO;AACb,UAAI,MAAM,UAAU;AAChB,eAAO,MAAM,CAAC;AAClB,UAAI7E,KAAI,GAAG,IAAI,MAAM,QAAQ,SAAS,GAAG,QAAQ;AACjD,iBAAS;AACL,YAAIA,MAAK,GAAG;AACR,cAAI,SAAS,QAAQ,GAAG;AACpB,gBAAI,QAAQ,MAAMA,KAAI,CAAC;AACvB,gBAAI,MAAM;AACN,oBAAM,OAAO,EAAEA,IAAG,GAAG,MAAM,MAAM,MAAM,MAAM,KAAK;AAAA;AAElD,oBAAM,OAAO,EAAEA,IAAG,GAAG,MAAM,MAAM,MAAM,KAAK;AAChD,iBAAK,IAAI,MAAM;AACf,sBAAU,MAAM;AAAA,UACnB,WACQ,QAAQ,SAAS,GAAG;AACzB,gBAAI,QAAQ,MAAM,CAAC;AACnB,gBAAI,MAAM;AACN,oBAAM,OAAO,GAAG,GAAG,MAAM,MAAM,MAAM,MAAM,KAAK;AAAA;AAEhD,oBAAM,OAAO,GAAG,GAAG,MAAM,MAAM,MAAM,KAAK;AAC9C,iBAAK,IAAI,MAAM;AACf,qBAAS,MAAM;AAAA,UAClB,OACI;AACD;AAAA,UACH;AAAA,QACJ,WACQ,SAAS,OAAO;AACrB,cAAI,OAAO,MAAMA,IAAG;AACpB,cAAI;AACA,sBAAU,KAAK;AAAA,QACtB,OACI;AACD,cAAI,OAAO,MAAM,EAAE,CAAC;AACpB,cAAI;AACA,qBAAS,KAAK;AAAA,QACrB;AAAA,MACJ;AACD,UAAI,MAAM;AACV,UAAI,MAAMA,KAAI,CAAC,KAAK,MAAM;AACtB,cAAM;AACN,QAAAA;AAAA,MACH,WACQ,MAAMA,EAAC,KAAK,MAAM;AACvB,cAAM;AACN;AAAA,MACH;AACD,aAAO,IAAI,gBAAgB,UAAU,GAAG,MAAM,MAAM,GAAGA,EAAC,CAAC,GAAG,KAAK,UAAU,GAAG,MAAM,MAAM,CAAC,CAAC,CAAC;AAAA,IAChG;AAAA,EACL;AACA,YAAU,UAAU,OAAO;AAAA,EAC3B,MAAM,uBAAuB,UAAU;AAAA,IACnC,YAAY,QAAQ,QAAQ,MAAM;AAC9B,YAAM,QAAQ,MAAM;AACpB,WAAK,OAAO;AAAA,IACf;AAAA,IACD,QAAQ,SAAS,SAASuC,MAAK,QAAQ;AACnC,aAAO,IAAI,UAAU,QAAQ,KAAK,QAAQA,MAAK,KAAK,QAAQ,KAAK,QAAQ,CAAC;AAAA,IAC7E;AAAA,IACD,OAAO,QAAQ,OAAO,QAAQA,MAAK,QAAQ;AACvC,aAAO,KAAK,QAAQ,GAAG,QAAQA,MAAK,MAAM;AAAA,IAC7C;AAAA,IACD,YAAY,MAAM,IAAI,QAAQA,MAAK,QAAQL,IAAG;AAC1C,UAAI,QAAQ,SAAS,KAAK,UAAU,MAAM;AACtC,QAAAA,GAAE,KAAK,QAAQ,GAAG,QAAQK,MAAK,MAAM,CAAC;AAAA,IAC7C;AAAA,IACD,aAAa,QAAQ,SAAS,GAAG,SAAS,OAAO,UAAU;AACvD,UAAI,YAAY,SAAS,QAAQ,UAAU,SAAS;AAChD,aAAK,UAAU,QAAQ,SAAS,QAAQ,SAAS,OAAO,CAAC;AAC7D,WAAK,WAAW;AAChB,aAAO;AAAA,IACV;AAAA,IACD,WAAW;AAAE,aAAO,SAAS,KAAK,MAAM;AAAA,IAAM;AAAA,EAClD;AAAA,EACA,MAAM,sBAAsB,eAAe;AAAA,IACvC,YAAY,QAAQ,QAAQ;AACxB,YAAM,QAAQ,QAAQ,IAAI;AAC1B,WAAK,YAAY;AACjB,WAAK,eAAe;AACpB,WAAK,SAAS;AAAA,IACjB;AAAA,IACD,QAAQ,SAAS,SAASA,MAAK,QAAQ;AACnC,aAAO,IAAI,UAAU,QAAQ,KAAK,QAAQA,MAAK,KAAK,QAAQ,KAAK,MAAM;AAAA,IAC1E;AAAA,IACD,QAAQ,OAAO,KAAK,OAAO;AACvB,UAAI,OAAO,MAAM,CAAC;AAClB,UAAI,MAAM,UAAU,MAAM,gBAAgB,iBAAiB,gBAAgB,gBAAiB,KAAK,QAAQ,MACrG,KAAK,IAAI,KAAK,SAAS,KAAK,MAAM,IAAI,IAAI;AAC1C,YAAI,gBAAgB;AAChB,iBAAO,IAAI,cAAc,KAAK,QAAQ,KAAK,MAAM;AAAA;AAEjD,eAAK,SAAS,KAAK;AACvB,YAAI,CAAC,KAAK;AACN,eAAK,WAAW;AACpB,eAAO;AAAA,MACV,OACI;AACD,eAAO,UAAU,GAAG,KAAK;AAAA,MAC5B;AAAA,IACJ;AAAA,IACD,aAAa,QAAQ,SAAS,GAAG,QAAQ,OAAO,UAAU;AACtD,UAAI,YAAY,SAAS,QAAQ,UAAU,SAAS;AAChD,aAAK,UAAU,QAAQ,SAAS,QAAQ,SAAS,OAAO,CAAC;AAAA,eACpD,SAAS,KAAK;AACnB,aAAK,UAAU,QAAQ,KAAK,IAAI,KAAK,cAAc,OAAO,cAAc,KAAK,SAAS,KAAK,SAAS,CAAC,IACjG,KAAK,SAAS,OAAO,UAAU;AACvC,WAAK,WAAW;AAChB,aAAO;AAAA,IACV;AAAA,IACD,WAAW;AACP,aAAO,QAAQ,KAAK,MAAM,GAAG,KAAK,YAAY,CAAC,KAAK,YAAY,EAAE,GAAG,KAAK,eAAe,MAAM,KAAK,eAAe,EAAE;AAAA,IACxH;AAAA,EACL;AAAA,EACA,MAAM,qBAAqB,UAAU;AAAA,IACjC,YAAY,QAAQ;AAAE,YAAM,QAAQ,CAAC;AAAA,IAAI;AAAA,IACzC,cAAc,QAAQ,QAAQ;AAC1B,UAAI,YAAY,OAAO,IAAI,OAAO,MAAM,EAAE,QAAQ,WAAW,OAAO,IAAI,OAAO,SAAS,KAAK,MAAM,EAAE;AACrG,UAAI,QAAQ,WAAW,YAAY;AACnC,UAAI,SAAS,UAAU;AACvB,UAAI,OAAO,cAAc;AACrB,YAAI,eAAe,KAAK,IAAI,KAAK,QAAQ,OAAO,aAAa,KAAK;AAClE,kBAAU,eAAe;AACzB,YAAI,KAAK,SAAS,QAAQ;AACtB,qBAAW,KAAK,SAAS,iBAAiB,KAAK,SAAS,QAAQ;AAAA,MACvE,OACI;AACD,kBAAU,KAAK,SAAS;AAAA,MAC3B;AACD,aAAO,EAAE,WAAW,UAAU,SAAS,QAAO;AAAA,IACjD;AAAA,IACD,QAAQ,QAAQ,QAAQA,MAAK,QAAQ;AACjC,UAAI,EAAE,WAAW,UAAU,SAAS,YAAY,KAAK,cAAc,QAAQ,MAAM;AACjF,UAAI,OAAO,cAAc;AACrB,YAAI,QAAQ,SAAS,KAAK,MAAM,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,SAASA,QAAO,KAAK,MAAM,CAAC,IAAI,KAAK,MAAM;AACpG,YAAI,OAAO,OAAO,IAAI,OAAO,KAAK,GAAG,aAAa,UAAU,KAAK,SAAS;AAC1E,YAAI,UAAU,KAAK,IAAIA,MAAK,SAAS,aAAa,CAAC;AACnD,eAAO,IAAI,UAAU,KAAK,MAAM,KAAK,QAAQ,SAAS,YAAY,CAAC;AAAA,MACtE,OACI;AACD,YAAI,OAAO,KAAK,IAAI,GAAG,KAAK,IAAI,WAAW,WAAW,KAAK,OAAO,SAASA,QAAO,OAAO,CAAC,CAAC;AAC3F,YAAI,EAAE,MAAM,WAAW,OAAO,IAAI,KAAK,YAAY,IAAI;AACvD,eAAO,IAAI,UAAU,MAAM,QAAQA,OAAM,UAAU,MAAM,SAAS,CAAC;AAAA,MACtE;AAAA,IACJ;AAAA,IACD,OAAO,OAAO,MAAM,QAAQA,MAAK,QAAQ;AACrC,UAAI,QAAQ,UAAU;AAClB,eAAO,KAAK,QAAQ,OAAO,QAAQA,MAAK,MAAM;AAClD,UAAI,QAAQ,UAAU,eAAe;AACjC,YAAI,EAAE,MAAM,GAAI,IAAG,OAAO,IAAI,OAAO,KAAK;AAC1C,eAAO,IAAI,UAAU,MAAM,KAAK,MAAM,GAAG,GAAG,CAAC;AAAA,MAChD;AACD,UAAI,EAAE,WAAW,SAAS,QAAO,IAAK,KAAK,cAAc,QAAQ,MAAM;AACvE,UAAI,OAAO,OAAO,IAAI,OAAO,KAAK,GAAG,aAAa,UAAU,KAAK,SAAS;AAC1E,UAAI,aAAa,KAAK,SAAS;AAC/B,UAAI,UAAUA,OAAM,UAAU,aAAa,WAAW,KAAK,OAAO,SAAS;AAC3E,aAAO,IAAI,UAAU,KAAK,MAAM,KAAK,QAAQ,KAAK,IAAIA,MAAK,KAAK,IAAI,SAASA,OAAM,KAAK,SAAS,UAAU,CAAC,GAAG,YAAY,CAAC;AAAA,IAC/H;AAAA,IACD,YAAY,MAAM,IAAI,QAAQA,MAAK,QAAQL,IAAG;AAC1C,aAAO,KAAK,IAAI,MAAM,MAAM;AAC5B,WAAK,KAAK,IAAI,IAAI,SAAS,KAAK,MAAM;AACtC,UAAI,EAAE,WAAW,SAAS,QAAO,IAAK,KAAK,cAAc,QAAQ,MAAM;AACvE,eAAS,MAAM,MAAM,UAAUK,MAAK,OAAO,MAAK;AAC5C,YAAI,OAAO,OAAO,IAAI,OAAO,GAAG;AAChC,YAAI,OAAO,MAAM;AACb,cAAI,aAAa,KAAK,SAAS;AAC/B,qBAAW,UAAU,aAAa,WAAW,OAAO,SAAS;AAAA,QAChE;AACD,YAAI,aAAa,UAAU,UAAU,KAAK;AAC1C,QAAAL,GAAE,IAAI,UAAU,KAAK,MAAM,KAAK,QAAQ,SAAS,YAAY,CAAC,CAAC;AAC/D,mBAAW;AACX,cAAM,KAAK,KAAK;AAAA,MACnB;AAAA,IACJ;AAAA,IACD,QAAQ,MAAM,IAAI,OAAO;AACrB,UAAI,QAAQ,KAAK,SAAS;AAC1B,UAAI,QAAQ,GAAG;AACX,YAAI,OAAO,MAAM,MAAM,SAAS,CAAC;AACjC,YAAI,gBAAgB;AAChB,gBAAM,MAAM,SAAS,CAAC,IAAI,IAAI,aAAa,KAAK,SAAS,KAAK;AAAA;AAE9D,gBAAM,KAAK,MAAM,IAAI,aAAa,QAAQ,CAAC,CAAC;AAAA,MACnD;AACD,UAAI,OAAO,GAAG;AACV,YAAI,QAAQ,MAAM,CAAC;AACnB,YAAI,iBAAiB;AACjB,gBAAM,CAAC,IAAI,IAAI,aAAa,OAAO,MAAM,MAAM;AAAA;AAE/C,gBAAM,QAAQ,IAAI,aAAa,OAAO,CAAC,GAAG,IAAI;AAAA,MACrD;AACD,aAAO,UAAU,GAAG,KAAK;AAAA,IAC5B;AAAA,IACD,cAAc,IAAI,QAAQ;AACtB,aAAO,KAAK,IAAI,aAAa,KAAK,CAAC,GAAG,IAAI;AAAA,IAC7C;AAAA,IACD,eAAe,MAAM,QAAQ;AACzB,aAAO,KAAK,MAAM,IAAI,aAAa,KAAK,SAAS,OAAO,CAAC,CAAC;AAAA,IAC7D;AAAA,IACD,aAAa,QAAQ,SAAS,GAAG,QAAQ,OAAO,UAAU;AACtD,UAAI,MAAM,SAAS,KAAK;AACxB,UAAI,YAAY,SAAS,QAAQ,SAAS,KAAK,UAAU,SAAS,MAAM;AAKpE,YAAI,QAAQ,CAAA,GAAI,MAAM,KAAK,IAAI,QAAQ,SAAS,IAAI,GAAG,eAAe;AACtE,YAAI,SAAS,OAAO;AAChB,gBAAM,KAAK,IAAI,aAAa,SAAS,OAAO,SAAS,CAAC,EAAE,aAAa,QAAQ,MAAM,CAAC;AACxF,eAAO,OAAO,OAAO,SAAS,MAAM;AAChC,cAAI,MAAM,OAAO,IAAI,OAAO,GAAG,EAAE;AACjC,cAAI,MAAM;AACN,kBAAM,KAAK,IAAI;AACnB,cAAI,SAAS,SAAS,QAAQ,SAAS,OAAO;AAC9C,cAAI,gBAAgB;AAChB,2BAAe;AAAA,mBACV,KAAK,IAAI,SAAS,YAAY,KAAK;AACxC,2BAAe;AACnB,cAAI,OAAO,IAAI,cAAc,KAAK,MAAM;AACxC,eAAK,WAAW;AAChB,gBAAM,KAAK,IAAI;AACf,iBAAO,MAAM;AAAA,QAChB;AACD,YAAI,OAAO;AACP,gBAAM,KAAK,MAAM,IAAI,aAAa,MAAM,GAAG,EAAE,aAAa,QAAQ,GAAG,CAAC;AAC1E,YAAI,SAAS,UAAU,GAAG,KAAK;AAC/B,YAAI,eAAe,KAAK,KAAK,IAAI,OAAO,SAAS,KAAK,MAAM,KAAK,WAC7D,KAAK,IAAI,eAAe,KAAK,cAAc,QAAQ,MAAM,EAAE,OAAO,KAAK;AACvE,iBAAO,gBAAgB;AAC3B,eAAO;AAAA,MACV,WACQ,SAAS,KAAK,UAAU;AAC7B,aAAK,UAAU,QAAQ,OAAO,aAAa,QAAQ,SAAS,KAAK,MAAM,CAAC;AACxE,aAAK,WAAW;AAAA,MACnB;AACD,aAAO;AAAA,IACV;AAAA,IACD,WAAW;AAAE,aAAO,OAAO,KAAK,MAAM;AAAA,IAAM;AAAA,EAChD;AAAA,EACA,MAAM,wBAAwB,UAAU;AAAA,IACpC,YAAY,MAAM,KAAK,OAAO;AAC1B,YAAM,KAAK,SAAS,MAAM,MAAM,QAAQ,KAAK,SAAS,MAAM,QAAQ,OAAO,KAAK,YAAY,MAAM,WAAW,IAAmB,EAAE;AAClI,WAAK,OAAO;AACZ,WAAK,QAAQ;AACb,WAAK,OAAO,KAAK,OAAO,MAAM;AAAA,IACjC;AAAA,IACD,IAAI,QAAQ;AAAE,aAAO,KAAK,QAAQ;AAAA,IAAgB;AAAA,IAClD,QAAQ,QAAQ,QAAQK,MAAK,QAAQ;AACjC,UAAI,MAAMA,OAAM,KAAK,KAAK;AAC1B,aAAO,SAAS,MAAM,KAAK,KAAK,QAAQ,QAAQ,QAAQA,MAAK,MAAM,IAC7D,KAAK,MAAM,QAAQ,QAAQ,QAAQ,KAAK,SAAS,KAAK,KAAK,SAAS,KAAK,KAAK;AAAA,IACvF;AAAA,IACD,OAAO,OAAO,MAAM,QAAQA,MAAK,QAAQ;AACrC,UAAI,WAAWA,OAAM,KAAK,KAAK,QAAQ,cAAc,SAAS,KAAK,KAAK,SAAS,KAAK;AACtF,UAAI,OAAO,QAAQ,UAAU,WAAW,QAAQ,WAAW,QAAQ;AACnE,UAAIV,QAAO,OAAO,KAAK,KAAK,OAAO,OAAO,MAAM,QAAQU,MAAK,MAAM,IAC7D,KAAK,MAAM,OAAO,OAAO,MAAM,QAAQ,UAAU,WAAW;AAClE,UAAI,KAAK,UAAU,OAAOV,MAAK,KAAK,cAAcA,MAAK,OAAO;AAC1D,eAAOA;AACX,UAAI,WAAW,QAAQ,UAAU,gBAAgB,UAAU,gBAAgB,UAAU;AACrF,UAAI;AACA,eAAOA,MAAK,KAAK,KAAK,MAAM,OAAO,aAAa,UAAU,QAAQ,UAAU,WAAW,CAAC;AAAA;AAExF,eAAO,KAAK,KAAK,OAAO,aAAa,UAAU,QAAQU,MAAK,MAAM,EAAE,KAAKV,KAAI;AAAA,IACpF;AAAA,IACD,YAAY,MAAM,IAAI,QAAQU,MAAK,QAAQL,IAAG;AAC1C,UAAI,WAAWK,OAAM,KAAK,KAAK,QAAQ,cAAc,SAAS,KAAK,KAAK,SAAS,KAAK;AACtF,UAAI,KAAK,OAAO;AACZ,YAAI,OAAO;AACP,eAAK,KAAK,YAAY,MAAM,IAAI,QAAQA,MAAK,QAAQL,EAAC;AAC1D,YAAI,MAAM;AACN,eAAK,MAAM,YAAY,MAAM,IAAI,QAAQ,UAAU,aAAaA,EAAC;AAAA,MACxE,OACI;AACD,YAAI,MAAM,KAAK,OAAO,aAAa,UAAU,OAAO,QAAQK,MAAK,MAAM;AACvE,YAAI,OAAO,IAAI;AACX,eAAK,KAAK,YAAY,MAAM,IAAI,OAAO,GAAG,QAAQA,MAAK,QAAQL,EAAC;AACpE,YAAI,IAAI,MAAM,QAAQ,IAAI,QAAQ;AAC9B,UAAAA,GAAE,GAAG;AACT,YAAI,KAAK,IAAI;AACT,eAAK,MAAM,YAAY,IAAI,KAAK,GAAG,IAAI,QAAQ,UAAU,aAAaA,EAAC;AAAA,MAC9E;AAAA,IACJ;AAAA,IACD,QAAQ,MAAM,IAAI,OAAO;AACrB,UAAI,aAAa,KAAK,KAAK,SAAS,KAAK;AACzC,UAAI,KAAK;AACL,eAAO,KAAK,SAAS,KAAK,KAAK,QAAQ,MAAM,IAAI,KAAK,GAAG,KAAK,KAAK;AACvE,UAAI,OAAO,KAAK,KAAK;AACjB,eAAO,KAAK,SAAS,KAAK,MAAM,KAAK,MAAM,QAAQ,OAAO,YAAY,KAAK,YAAY,KAAK,CAAC;AACjG,UAAI,SAAS,CAAA;AACb,UAAI,OAAO;AACP,aAAK,cAAc,MAAM,MAAM;AACnC,UAAI,OAAO,OAAO;AAClB,eAAS,QAAQ;AACb,eAAO,KAAK,IAAI;AACpB,UAAI,OAAO;AACP,kBAAU,QAAQ,OAAO,CAAC;AAC9B,UAAI,KAAK,KAAK,QAAQ;AAClB,YAAI,QAAQ,OAAO;AACnB,aAAK,eAAe,IAAI,MAAM;AAC9B,kBAAU,QAAQ,KAAK;AAAA,MAC1B;AACD,aAAO,UAAU,GAAG,MAAM;AAAA,IAC7B;AAAA,IACD,cAAc,IAAI,QAAQ;AACtB,UAAI,OAAO,KAAK,KAAK;AACrB,UAAI,MAAM;AACN,eAAO,KAAK,KAAK,cAAc,IAAI,MAAM;AAC7C,aAAO,KAAK,KAAK,IAAI;AACrB,UAAI,KAAK,OAAO;AACZ;AACA,YAAI,MAAM;AACN,iBAAO,KAAK,IAAI;AAAA,MACvB;AACD,UAAI,KAAK;AACL,aAAK,MAAM,cAAc,KAAK,MAAM,MAAM;AAAA,IACjD;AAAA,IACD,eAAe,MAAM,QAAQ;AACzB,UAAI,OAAO,KAAK,KAAK,QAAQ,QAAQ,OAAO,KAAK;AACjD,UAAI,QAAQ;AACR,eAAO,KAAK,MAAM,eAAe,OAAO,OAAO,MAAM;AACzD,UAAI,OAAO;AACP,aAAK,KAAK,eAAe,MAAM,MAAM;AACzC,UAAI,KAAK,SAAS,OAAO;AACrB,eAAO,KAAK,IAAI;AACpB,aAAO,KAAK,KAAK,KAAK;AAAA,IACzB;AAAA,IACD,SAAS,MAAM,OAAO;AAClB,UAAI,KAAK,OAAO,IAAI,MAAM,QAAQ,MAAM,OAAO,IAAI,KAAK;AACpD,eAAO,UAAU,GAAG,KAAK,QAAQ,CAAC,MAAM,MAAM,KAAK,IAAI,CAAC,MAAM,KAAK,CAAC;AACxE,WAAK,OAAO;AACZ,WAAK,QAAQ;AACb,WAAK,SAAS,KAAK,SAAS,MAAM;AAClC,WAAK,WAAW,KAAK,YAAY,MAAM;AACvC,WAAK,OAAO,KAAK,OAAO,MAAM;AAC9B,WAAK,SAAS,KAAK,SAAS,KAAK,QAAQ,MAAM;AAC/C,aAAO;AAAA,IACV;AAAA,IACD,aAAa,QAAQ,SAAS,GAAG,QAAQ,OAAO,UAAU;AACtD,UAAI,EAAE,MAAM,UAAU,MAAM,aAAa,SAAS,KAAK,SAAS,KAAK,OAAO,YAAY;AACxF,UAAI,YAAY,SAAS,QAAQ,SAAS,KAAK,UAAU,SAAS;AAC9D,oBAAY,OAAO,KAAK,aAAa,QAAQ,QAAQ,OAAO,QAAQ;AAAA;AAEpE,aAAK,aAAa,QAAQ,QAAQ,KAAK;AAC3C,UAAI,YAAY,SAAS,QAAQ,aAAa,MAAM,UAAU,SAAS;AACnE,oBAAY,QAAQ,MAAM,aAAa,QAAQ,YAAY,OAAO,QAAQ;AAAA;AAE1E,cAAM,aAAa,QAAQ,YAAY,KAAK;AAChD,UAAI;AACA,eAAO,KAAK,SAAS,MAAM,KAAK;AACpC,WAAK,SAAS,KAAK,KAAK,SAAS,KAAK,MAAM;AAC5C,WAAK,WAAW;AAChB,aAAO;AAAA,IACV;AAAA,IACD,WAAW;AAAE,aAAO,KAAK,QAAQ,KAAK,QAAQ,MAAM,OAAO,KAAK;AAAA,IAAQ;AAAA,EAC5E;AACA,WAAS,UAAU,OAAO,QAAQ;AAC9B,QAAI,QAAQ;AACZ,QAAI,MAAM,MAAM,KAAK,SAChB,SAAS,MAAM,SAAS,CAAC,cAAc,iBACvC,QAAQ,MAAM,SAAS,CAAC,cAAc;AACvC,YAAM,OAAO,SAAS,GAAG,GAAG,IAAI,aAAa,OAAO,SAAS,IAAI,MAAM,MAAM,CAAC;AAAA,EACtF;AACA,QAAM,uBAAuB;AAAA,EAC7B,MAAM,YAAY;AAAA,IACd,YAAY,KAAK,QAAQ;AACrB,WAAK,MAAM;AACX,WAAK,SAAS;AACd,WAAK,QAAQ;AACb,WAAK,YAAY;AACjB,WAAK,UAAU;AACf,WAAK,WAAW;AAChB,WAAK,YAAY;AAAA,IACpB;AAAA,IACD,IAAI,YAAY;AACZ,aAAO,KAAK,YAAY,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC,KAAK,KAAK;AAAA,IACrE;AAAA,IACD,KAAK,OAAO,IAAI;AACZ,UAAI,KAAK,YAAY,IAAI;AACrB,YAAI,MAAM,KAAK,IAAI,IAAI,KAAK,OAAO,GAAG,OAAO,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAC7E,YAAI,gBAAgB;AAChB,eAAK,UAAU,MAAM,KAAK;AAAA,iBACrB,MAAM,KAAK,OAAO,CAAC,KAAK;AAC7B,eAAK,MAAM,KAAK,IAAI,cAAc,MAAM,KAAK,KAAK,EAAE,CAAC;AACzD,aAAK,YAAY;AACjB,YAAI,KAAK,KAAK;AACV,eAAK,MAAM,KAAK,IAAI;AACpB,eAAK;AACL,eAAK,YAAY;AAAA,QACpB;AAAA,MACJ;AACD,WAAK,MAAM;AAAA,IACd;AAAA,IACD,MAAM,MAAM,IAAI,MAAM;AAClB,UAAI,OAAO,MAAM,KAAK,gBAAgB;AAClC,YAAI,SAAS,KAAK,SAAS,KAAK,OAAO,kBAAkB;AACzD,YAAI,SAAS,KAAK,SAAS,KAAK,OAAO,aAAa;AACpD,YAAI,SAAS;AACT,mBAAS,KAAK,OAAO;AACzB,YAAI,MAAM,KAAK;AACf,YAAI,KAAK,OAAO;AACZ,eAAK,SAAS,IAAI,eAAe,KAAK,QAAQ,IAAI,CAAC;AAAA,QACtD,WACQ,OAAO,UAAU,UAAU,sBAAsB;AACtD,eAAK,YAAY,QAAQ,QAAQ,GAAG;AAAA,QACvC;AAAA,MACJ,WACQ,KAAK,MAAM;AAChB,aAAK,KAAK,MAAM,EAAE;AAAA,MACrB;AACD,UAAI,KAAK,UAAU,MAAM,KAAK,UAAU,KAAK;AACzC,aAAK,UAAU,KAAK,OAAO,IAAI,OAAO,KAAK,GAAG,EAAE;AAAA,IACvD;AAAA,IACD,YAAY;AACR,UAAI,KAAK,YAAY;AACjB;AACJ,UAAI,EAAE,MAAM,GAAE,IAAK,KAAK,OAAO,IAAI,OAAO,KAAK,GAAG;AAClD,WAAK,YAAY;AACjB,WAAK,UAAU;AACf,UAAI,KAAK,YAAY,MAAM;AACvB,YAAI,KAAK,YAAY,OAAO,KAAK,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC,KAAK;AAClE,eAAK,MAAM,KAAK,KAAK,aAAa,KAAK,WAAW,OAAO,CAAC,CAAC;AAC/D,aAAK,MAAM,KAAK,IAAI;AAAA,MACvB;AACD,UAAI,KAAK,MAAM;AACX,aAAK,MAAM,KAAK,IAAI,cAAc,KAAK,MAAM,MAAM,EAAE,CAAC;AAC1D,WAAK,YAAY,KAAK;AAAA,IACzB;AAAA,IACD,aAAa,MAAM,IAAI;AACnB,UAAI,MAAM,IAAI,aAAa,KAAK,IAAI;AACpC,UAAI,KAAK,OAAO,IAAI,OAAO,IAAI,EAAE,MAAM;AACnC,YAAI,SAAS;AACjB,aAAO;AAAA,IACV;AAAA,IACD,aAAa;AACT,WAAK,UAAS;AACd,UAAI,OAAO,KAAK,MAAM,SAAS,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC,IAAI;AACnE,UAAI,gBAAgB;AAChB,eAAO;AACX,UAAI,OAAO,IAAI,cAAc,GAAG,EAAE;AAClC,WAAK,MAAM,KAAK,IAAI;AACpB,aAAO;AAAA,IACV;AAAA,IACD,SAAS,OAAO;AACZ,UAAIhB;AACJ,WAAK,UAAS;AACd,UAAI,QAAQA,MAAK,MAAM,UAAU,QAAQA,QAAO,SAAS,SAASA,IAAG;AACrE,UAAI,QAAQ,UAAU,eAAe,CAAC,KAAK;AACvC,aAAK,WAAU;AACnB,WAAK,MAAM,KAAK,KAAK;AACrB,WAAK,YAAY,KAAK,MAAM,KAAK,MAAM,MAAM;AAC7C,UAAI,QAAQ,UAAU;AAClB,aAAK,WAAW;AAAA,IACvB;AAAA,IACD,YAAY,QAAQ,QAAQ,QAAQ;AAChC,UAAI,OAAO,KAAK;AAChB,WAAK,UAAU;AACf,WAAK,aAAa;AAClB,WAAK,eAAe,KAAK,IAAI,KAAK,cAAc,MAAM;AACtD,WAAK,UAAU;AACf,WAAK,YAAY,KAAK,MAAM,KAAK,MAAM;AAAA,IAC1C;AAAA,IACD,OAAO,MAAM;AACT,UAAI,OAAO,KAAK,MAAM,UAAU,IAAI,OAAO,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAC3E,UAAI,KAAK,YAAY,MAAM,EAAE,gBAAgB,kBAAkB,CAAC,KAAK;AACjE,aAAK,MAAM,KAAK,IAAI,cAAc,GAAG,EAAE,CAAC;AAAA,eACnC,KAAK,YAAY,KAAK,OAAO,QAAQ;AAC1C,aAAK,MAAM,KAAK,KAAK,aAAa,KAAK,WAAW,KAAK,GAAG,CAAC;AAC/D,UAAI,MAAM;AACV,eAAS,QAAQ,KAAK,OAAO;AACzB,YAAI,gBAAgB;AAChB,eAAK,aAAa,KAAK,QAAQ,GAAG;AACtC,eAAO,OAAO,KAAK,SAAS;AAAA,MAC/B;AACD,aAAO,KAAK;AAAA,IACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMD,OAAO,MAAM,QAAQ2D,cAAa,MAAM,IAAI;AACxC,UAAI,UAAU,IAAI,YAAY,MAAM,MAAM;AAC1C,eAAS,MAAMA,cAAa,MAAM,IAAI,SAAS,CAAC;AAChD,aAAO,QAAQ,OAAO,IAAI;AAAA,IAC7B;AAAA,EACL;AACA,WAAS,0BAA0BlF,IAAGsB,IAAG,MAAM;AAC3C,QAAI,OAAO,IAAI;AACf,aAAS,QAAQtB,IAAGsB,IAAG,MAAM,MAAM,CAAC;AACpC,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,MAAM,qBAAqB;AAAA,IACvB,cAAc;AACV,WAAK,UAAU;IAClB;AAAA,IACD,eAAe;AAAA,IAAG;AAAA,IAClB,aAAa,MAAM,IAAItB,IAAGsB,IAAG;AACzB,UAAI,OAAO,MAAMtB,MAAKA,GAAE,kBAAkBsB,MAAKA,GAAE;AAC7C,iBAAS,MAAM,IAAI,KAAK,SAAS,CAAC;AAAA,IACzC;AAAA,EACL;AAEA,WAAS,kBAAkB,KAAK,YAAY;AACxC,QAAI,OAAO,IAAI;AACf,QAAIwC,OAAM,IAAI,eAAe,MAAMA,KAAI,eAAe;AACtD,QAAI,OAAO,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,QAAQ,KAAK,IAAI,IAAI,YAAY,KAAK,KAAK;AAC9E,QAAIlB,OAAM,KAAK,IAAI,GAAG,KAAK,GAAG,GAAG,SAAS,KAAK,IAAI,IAAI,aAAa,KAAK,MAAM;AAC/E,aAAS,SAAS,IAAI,YAAY,UAAU,UAAUkB,KAAI,QAAO;AAC7D,UAAI,OAAO,YAAY,GAAG;AACtB,YAAI,MAAM;AACV,YAAI,QAAQ,OAAO,iBAAiB,GAAG;AACvC,aAAK,IAAI,eAAe,IAAI,gBAAgB,IAAI,cAAc,IAAI,gBAC9D,MAAM,YAAY,WAAW;AAC7B,cAAI,aAAa,IAAI;AACrB,iBAAO,KAAK,IAAI,MAAM,WAAW,IAAI;AACrC,kBAAQ,KAAK,IAAI,OAAO,WAAW,KAAK;AACxC,UAAAlB,OAAM,KAAK,IAAIA,MAAK,WAAW,GAAG;AAClC,mBAAS,UAAU,IAAI,aAAa,WAAW,SAAS,KAAK,IAAI,QAAQ,WAAW,MAAM;AAAA,QAC7F;AACD,iBAAS,MAAM,YAAY,cAAc,MAAM,YAAY,UAAU,IAAI,eAAe,IAAI;AAAA,MAC/F,WACQ,OAAO,YAAY,IAAI;AAC5B,iBAAS,OAAO;AAAA,MACnB,OACI;AACD;AAAA,MACH;AAAA,IACJ;AACD,WAAO;AAAA,MAAE,MAAM,OAAO,KAAK;AAAA,MAAM,OAAO,KAAK,IAAI,MAAM,KAAK,IAAI,KAAK;AAAA,MACjE,KAAKA,QAAO,KAAK,MAAM;AAAA,MAAa,QAAQ,KAAK,IAAIA,MAAK,MAAM,KAAK,KAAK,MAAM;AAAA;EACxF;AACA,WAAS,eAAe,KAAK,YAAY;AACrC,QAAI,OAAO,IAAI;AACf,WAAO;AAAA,MAAE,MAAM;AAAA,MAAG,OAAO,KAAK,QAAQ,KAAK;AAAA,MACvC,KAAK;AAAA,MAAY,QAAQ,KAAK,UAAU,KAAK,MAAM;AAAA;EAC3D;AAAA,EAIA,MAAM,QAAQ;AAAA,IACV,YAAY,MAAM,IAAI,MAAM;AACxB,WAAK,OAAO;AACZ,WAAK,KAAK;AACV,WAAK,OAAO;AAAA,IACf;AAAA,IACD,OAAO,KAAK5C,IAAGsB,IAAG;AACd,UAAItB,GAAE,UAAUsB,GAAE;AACd,eAAO;AACX,eAASjB,KAAI,GAAGA,KAAIL,GAAE,QAAQK,MAAK;AAC/B,YAAI,KAAKL,GAAEK,EAAC,GAAG,KAAKiB,GAAEjB,EAAC;AACvB,YAAI,GAAG,QAAQ,GAAG,QAAQ,GAAG,MAAM,GAAG,MAAM,GAAG,QAAQ,GAAG;AACtD,iBAAO;AAAA,MACd;AACD,aAAO;AAAA,IACV;AAAA,IACD,KAAK,UAAU;AACX,aAAO,WAAW,QAAQ,EAAE,QAAQ,IAAI,cAAc,KAAK,MAAM,QAAQ,EAAG,CAAA,EAAE,MAAM,KAAK,MAAM,KAAK,EAAE;AAAA,IACzG;AAAA,EACL;AAAA,EACA,MAAM,sBAAsB,WAAW;AAAA,IACnC,YAAY,MAAM,UAAU;AACxB;AACA,WAAK,OAAO;AACZ,WAAK,WAAW;AAAA,IACnB;AAAA,IACD,GAAG,OAAO;AAAE,aAAO,MAAM,QAAQ,KAAK,QAAQ,MAAM,YAAY,KAAK;AAAA,IAAW;AAAA,IAChF,QAAQ;AACJ,UAAI,MAAM,SAAS,cAAc,KAAK;AACtC,UAAI,KAAK,UAAU;AACf,YAAI,MAAM,SAAS,KAAK,OAAO;AAAA,MAClC,OACI;AACD,YAAI,MAAM,QAAQ,KAAK,OAAO;AAC9B,YAAI,MAAM,SAAS;AACnB,YAAI,MAAM,UAAU;AAAA,MACvB;AACD,aAAO;AAAA,IACV;AAAA,IACD,IAAI,kBAAkB;AAAE,aAAO,KAAK,WAAW,KAAK,OAAO;AAAA,IAAK;AAAA,EACpE;AAAA,EACA,MAAM,UAAU;AAAA,IACZ,YAAY,OAAO;AACf,WAAK,QAAQ;AAEb,WAAK,gBAAgB,EAAE,MAAM,GAAG,OAAO,OAAO,YAAY,KAAK,GAAG,QAAQ,EAAC;AAC3E,WAAK,SAAS;AACd,WAAK,aAAa;AAClB,WAAK,gBAAgB;AACrB,WAAK,kBAAkB;AACvB,WAAK,mBAAmB;AACxB,WAAK,eAAe;AACpB,WAAK,cAAc;AACnB,WAAK,YAAY;AACjB,WAAK,mBAAmB;AAGxB,WAAK,kBAAkB;AAGvB,WAAK,qBAAqB;AAE1B,WAAK,SAAS;AACd,WAAK,eAAe;AAEpB,WAAK,WAAW;AAGhB,WAAK,qBAAqB;AAC1B,WAAK,uBAAuB,UAAU;AACtC,WAAK,gBAAgB;AASrB,WAAK,yBAAyB;AAC9B,UAAI,gBAAgB,MAAM,MAAM,iBAAiB,EAAE,KAAK,CAAAwC,OAAK,OAAOA,MAAK,cAAcA,GAAE,SAAS,iBAAiB;AACnH,WAAK,eAAe,IAAI,aAAa,aAAa;AAClD,WAAK,YAAY,MAAM,MAAM,WAAW,EAAE,OAAO,CAAAnB,OAAK,OAAOA,MAAK,UAAU;AAC5E,WAAK,YAAY,UAAU,MAAO,EAAC,aAAa,KAAK,WAAW,KAAK,OAAO,KAAK,aAAa,OAAO,MAAM,GAAG,GAAG,CAAC,IAAI,aAAa,GAAG,GAAG,GAAG,MAAM,IAAI,MAAM,CAAC,CAAC;AAC9J,WAAK,WAAW,KAAK,YAAY,GAAG,IAAI;AACxC,WAAK,oBAAmB;AACxB,WAAK,kBAAiB;AACtB,WAAK,WAAW,KAAK,eAAe,CAAE,CAAA;AACtC,WAAK,cAAc,WAAW,IAAI,KAAK,SAAS,IAAI,SAAO,IAAI,KAAK,KAAK,CAAC,CAAC;AAC3E,WAAK,qBAAoB;AAAA,IAC5B;AAAA,IACD,oBAAoB;AAChB,UAAI,YAAY,CAAC,KAAK,QAAQ,GAAG,EAAE,SAAS,KAAK,MAAM;AACvD,eAASrB,KAAI,GAAGA,MAAK,GAAGA,MAAK;AACzB,YAAI,MAAMA,KAAI,KAAK,OAAO,KAAK;AAC/B,YAAI,CAAC,UAAU,KAAK,CAAC,EAAE,MAAM,GAAI,MAAK,OAAO,QAAQ,OAAO,EAAE,GAAG;AAC7D,cAAI,EAAE,MAAM,GAAE,IAAK,KAAK,YAAY,GAAG;AACvC,oBAAU,KAAK,IAAI,SAAS,MAAM,EAAE,CAAC;AAAA,QACxC;AAAA,MACJ;AACD,WAAK,YAAY,UAAU,KAAK,CAACL,IAAGsB,OAAMtB,GAAE,OAAOsB,GAAE,IAAI;AACzD,WAAK,SAAS,KAAK,UAAU,UAAU,MAA6B,WAChE,IAAI,UAAU,KAAK,cAAc,KAAK,WAAW,KAAK,SAAS;AAAA,IACtE;AAAA,IACD,sBAAsB;AAClB,WAAK,gBAAgB;AACrB,WAAK,UAAU,YAAY,KAAK,SAAS,MAAM,KAAK,SAAS,IAAI,KAAK,aAAa,OAAO,KAAK,MAAM,GAAG,GAAG,GAAG,GAAG,WAAS;AACtH,aAAK,cAAc,KAAK,KAAK,OAAO,SAAS,IAAI,QAAQ,WAAW,OAAO,KAAK,MAAM,CAAC;AAAA,MACnG,CAAS;AAAA,IACJ;AAAA,IACD,OAAO,QAAQ,eAAe,MAAM;AAChC,WAAK,QAAQ,OAAO;AACpB,UAAI,WAAW,KAAK;AACpB,WAAK,YAAY,KAAK,MAAM,MAAM,WAAW,EAAE,OAAO,CAAAI,OAAK,OAAOA,MAAK,UAAU;AACjF,UAAI,iBAAiB,OAAO;AAC5B,UAAI,gBAAgB,aAAa,iBAAiB,gBAAgB,0BAA0B,UAAU,KAAK,WAAW,SAAS,OAAO,UAAU,UAAU,MAAM,KAAK,MAAM,IAAI,MAAM,CAAC,CAAC;AACvL,UAAI,aAAa,KAAK,UAAU;AAChC,UAAI,eAAe,KAAK,mBAAmB,OAAO,KAAK,eAAe,KAAK,SAAS;AACpF,WAAK,YAAY,KAAK,UAAU,aAAa,KAAK,WAAW,OAAO,WAAW,KAAK,KAAK,aAAa,OAAO,KAAK,MAAM,GAAG,GAAG,aAAa;AAC3I,UAAI,KAAK,UAAU,UAAU;AACzB,eAAO,SAAS;AACpB,UAAI,cAAc;AACd,aAAK,kBAAkB,OAAO,QAAQ,OAAO,aAAa,MAAM,EAAE;AAClE,aAAK,qBAAqB,aAAa;AAAA,MAC1C,OACI;AACD,aAAK,kBAAkB;AACvB,aAAK,qBAAqB,KAAK,UAAU;AAAA,MAC5C;AACD,UAAI,WAAW,cAAc,SAAS,KAAK,YAAY,KAAK,UAAU,OAAO,OAAO,IAAI,KAAK;AAC7F,UAAI,iBAAiB,aAAa,MAAM,OAAO,SAAS,QAAQ,aAAa,MAAM,OAAO,SAAS,OAC/F,CAAC,KAAK,sBAAsB,QAAQ;AACpC,mBAAW,KAAK,YAAY,GAAG,YAAY;AAC/C,UAAI,cAAc,CAAC,OAAO,QAAQ,SAAU,OAAO,QAAQ,KACvD,SAAS,QAAQ,KAAK,SAAS,QAAQ,SAAS,MAAM,KAAK,SAAS;AACxE,WAAK,WAAW;AAChB,WAAK,kBAAiB;AACtB,UAAI;AACA,aAAK,oBAAmB;AAC5B,UAAI,KAAK,SAAS,UAAU,KAAK,SAAS,KAAK,KAAK,SAAS,OAAQ,OAAqB;AACtF,aAAK,eAAe,KAAK,eAAe,KAAK,YAAY,KAAK,UAAU,OAAO,OAAO,CAAC,CAAC;AAC5F,aAAO,SAAS,KAAK;AACrB,UAAI;AACA,aAAK,eAAe;AACxB,UAAI,CAAC,KAAK,0BAA0B,OAAO,gBAAgB,OAAO,KAAK,gBACnE,OAAO,MAAM,UAAU,KAAK,SAAS,OAAO,MAAM,UAAU,KAAK,SACjE,CAAC,OAAO,MAAM,MAAM,qBAAqB;AACzC,aAAK,yBAAyB;AAAA,IACrC;AAAA,IACD,QAAQ,MAAM;AACV,UAAI,MAAM,KAAK,YAAY,QAAQ,OAAO,iBAAiB,GAAG;AAC9D,UAAI,SAAS,KAAK;AAClB,UAAI,aAAa,MAAM;AACvB,WAAK,uBAAuB,MAAM,aAAa,QAAQ,UAAU,MAAM,UAAU;AACjF,UAAI,UAAU,KAAK,aAAa,uBAAuB,UAAU;AACjE,UAAI,UAAU,IAAI;AAClB,UAAI,iBAAiB,WAAW,KAAK,sBAAsB,KAAK,oBAAoB,QAAQ;AAC5F,WAAK,mBAAmB,QAAQ;AAChC,WAAK,qBAAqB;AAC1B,UAAI,SAAS,GAAG,OAAO;AAEvB,UAAI,aAAa,SAAS,MAAM,UAAU,KAAK,GAAG,gBAAgB,SAAS,MAAM,aAAa,KAAK;AACnG,UAAI,KAAK,cAAc,cAAc,KAAK,iBAAiB,eAAe;AACtE,aAAK,aAAa;AAClB,aAAK,gBAAgB;AACrB,kBAAU,IAAmB;AAAA,MAChC;AACD,UAAI,KAAK,eAAe,KAAK,UAAU,aAAa;AAChD,YAAI,OAAO;AACP,2BAAiB;AACrB,aAAK,cAAc,KAAK,UAAU;AAClC,kBAAU;AAAA,MACb;AACD,UAAI,KAAK,aAAa,KAAK,UAAU,WAAW;AAC5C,aAAK,qBAAqB;AAC1B,aAAK,YAAY,KAAK,UAAU;AAAA,MACnC;AACD,WAAK,mBAAmB,mBAAmB,KAAK,SAAS;AAEzD,UAAI,iBAAiB,KAAK,WAAW,iBAAiB,mBAAmB,KAAK,KAAK,UAAU;AAC7F,UAAI,OAAO,cAAc,MAAM,KAAK,cAAc,KAAK,UAAU,cAAc,SAAS,KAAK,cAAc;AAC3G,WAAK,gBAAgB;AACrB,UAAI,SAAS,KAAK,cAAc,SAAS,KAAK,cAAc,OAAO,KAAK,cAAc,QAAQ,KAAK,cAAc;AACjH,UAAI,UAAU,KAAK,QAAQ;AACvB,aAAK,SAAS;AACd,YAAI;AACA,2BAAiB;AAAA,MACxB;AACD,UAAI,CAAC,KAAK,UAAU,CAAC,KAAK;AACtB,eAAO;AACX,UAAI,eAAe,QAAQ;AAC3B,UAAI,KAAK,mBAAmB,gBAAgB,KAAK,gBAAgB,KAAK,UAAU,cAAc;AAC1F,aAAK,kBAAkB,QAAQ;AAC/B,aAAK,eAAe,KAAK,UAAU;AACnC,kBAAU;AAAA,MACb;AACD,UAAI,gBAAgB;AAChB,YAAI,cAAc,KAAK,QAAQ,0BAA0B,KAAK,QAAQ;AACtE,YAAI,OAAO,sBAAsB,WAAW;AACxC,oBAAU;AACd,YAAI,WAAW,OAAO,gBAAgB,KAAK,IAAI,eAAe,KAAK,eAAe,IAAI,OAAO,WAAW;AACpG,cAAI,EAAE,YAAY,WAAW,WAAY,IAAG,KAAK,QAAQ;AACzD,oBAAU,aAAa,KAAK,OAAO,QAAQ,YAAY,YAAY,WAAW,YAAY,eAAe,WAAW,WAAW;AAC/H,cAAI,SAAS;AACT,iBAAK,QAAQ,WAAW;AACxB,sBAAU;AAAA,UACb;AAAA,QACJ;AACD,YAAI,OAAO,KAAK,UAAU;AACtB,iBAAO,KAAK,IAAI,MAAM,OAAO;AAAA,iBACxB,OAAO,KAAK,UAAU;AAC3B,iBAAO,KAAK,IAAI,MAAM,OAAO;AACjC,eAAO,gBAAgB;AACvB,iBAAS,MAAM,KAAK,WAAW;AAC3B,cAAI,UAAU,GAAG,QAAQ,KAAK,SAAS,OAAO,cAAc,KAAK,QAAQ,0BAA0B,EAAE;AACrG,eAAK,aAAa,UAAU,UAAU,MAAK,EAAG,aAAa,KAAK,WAAW,KAAK,OAAO,KAAK,cAAc,CAAC,IAAI,aAAa,GAAG,GAAG,GAAG,KAAK,MAAM,IAAI,MAAM,CAAC,CAAC,IAAI,KAAK,WAAW,aAAa,QAAQ,GAAG,SAAS,IAAI,gBAAgB,GAAG,MAAM,OAAO,CAAC;AAAA,QACzP;AACD,YAAI,OAAO;AACP,oBAAU;AAAA,MACjB;AACD,UAAI,iBAAiB,CAAC,KAAK,sBAAsB,KAAK,UAAU,IAAI,KAChE,KAAK,iBAAiB,KAAK,aAAa,MAAM,OAAO,KAAK,SAAS,QAC/D,KAAK,aAAa,MAAM,OAAO,KAAK,SAAS;AACrD,UAAI;AACA,aAAK,WAAW,KAAK,YAAY,MAAM,KAAK,YAAY;AAC5D,WAAK,kBAAiB;AACtB,UAAK,SAAS,KAAmB;AAC7B,aAAK,oBAAmB;AAC5B,UAAI,KAAK,SAAS,UAAU,KAAK,SAAS,KAAK,KAAK,SAAS,OAAQ,OAAqB;AACtF,aAAK,eAAe,KAAK,eAAe,UAAU,CAAE,IAAG,KAAK,UAAU,IAAI,CAAC;AAC/E,gBAAU,KAAK;AACf,UAAI,KAAK,wBAAwB;AAC7B,aAAK,yBAAyB;AAK9B,aAAK,QAAQ;MAChB;AACD,aAAO;AAAA,IACV;AAAA,IACD,IAAI,aAAa;AAAE,aAAO,KAAK,OAAO,QAAQ,KAAK,cAAc,GAAG;AAAA,IAAI;AAAA,IACxE,IAAI,gBAAgB;AAAE,aAAO,KAAK,OAAO,QAAQ,KAAK,cAAc,MAAM;AAAA,IAAI;AAAA,IAC9E,YAAY,MAAM,cAAc;AAI5B,UAAI,YAAY,MAAM,KAAK,IAAI,MAAM,KAAK,IAAI,KAAK,OAAO,MAAoB,CAAC,CAAC;AAChF,UAAI,MAAM,KAAK,WAAW,SAAS,KAAK;AACxC,UAAI,EAAE,YAAY,cAAe,IAAG;AACpC,UAAI,WAAW,IAAI,SAAS,IAAI,OAAO,aAAa,YAAY,KAAmB,UAAU,UAAU,QAAQ,GAAG,CAAC,EAAE,MAAM,IAAI,OAAO,iBAAiB,IAAI,aAAa,KAAmB,UAAU,UAAU,QAAQ,GAAG,CAAC,EAAE,EAAE;AAE/N,UAAI,cAAc;AACd,YAAI,EAAE,KAAI,IAAK,aAAa;AAC5B,YAAI,OAAO,SAAS,QAAQ,OAAO,SAAS,IAAI;AAC5C,cAAI,aAAa,KAAK,IAAI,KAAK,cAAc,KAAK,cAAc,SAAS,KAAK,cAAc,GAAG;AAC/F,cAAI,QAAQ,IAAI,OAAO,MAAM,UAAU,OAAO,QAAQ,GAAG,CAAC,GAAG;AAC7D,cAAI,aAAa,KAAK;AAClB,sBAAU,MAAM,MAAM,MAAM,UAAU,IAAI,aAAa;AAAA,mBAClD,aAAa,KAAK,WAAW,aAAa,KAAK,aAAa,OAAO,SAAS;AACjF,qBAAS,MAAM;AAAA;AAEf,qBAAS,MAAM,SAAS;AAC5B,qBAAW,IAAI,SAAS,IAAI,OAAO,SAAS,MAAoB,GAAG,UAAU,UAAU,QAAQ,GAAG,CAAC,EAAE,MAAM,IAAI,OAAO,SAAS,aAAa,MAAoB,GAAG,UAAU,UAAU,QAAQ,GAAG,CAAC,EAAE,EAAE;AAAA,QAC1M;AAAA,MACJ;AACD,aAAO;AAAA,IACV;AAAA,IACD,YAAY,UAAU,SAAS;AAC3B,UAAI,OAAO,QAAQ,OAAO,SAAS,MAAM,EAAE,GAAG,KAAK,QAAQ,OAAO,SAAS,IAAI,CAAC;AAChF,aAAO,IAAI,SAAS,KAAK,UAAU,OAAO,MAAM,UAAU,OAAO,KAAK,cAAc,GAAG,CAAC,EAAE,MAAM,KAAK,UAAU,OAAO,IAAI,UAAU,OAAO,KAAK,cAAc,GAAG,CAAC,EAAE,EAAE;AAAA,IACzK;AAAA;AAAA;AAAA,IAGD,sBAAsB,EAAE,MAAM,GAAE,GAAI,OAAO,GAAG;AAC1C,UAAI,CAAC,KAAK;AACN,eAAO;AACX,UAAI,EAAE,KAAAkB,KAAK,IAAG,KAAK,UAAU,OAAO,MAAM,UAAU,OAAO,KAAK,cAAc,GAAG,CAAC;AAClF,UAAI,EAAE,OAAQ,IAAG,KAAK,UAAU,OAAO,IAAI,UAAU,OAAO,KAAK,cAAc,GAAG,CAAC;AACnF,UAAI,EAAE,YAAY,cAAe,IAAG;AACpC,cAAQ,QAAQ,KAAKA,QAAO,aAAa,KAAK,IAAI,IAAyB,KAAK;AAAA,QAAI,CAAC;AAAA,QAAM;AAAA;AAAA,MAAG,CAAsB,OAC/G,MAAM,KAAK,MAAM,IAAI,UAClB,UAAU,gBAAgB,KAAK,IAAI,IAAyB,KAAK;AAAA,QAAI;AAAA,QAAM;AAAA;AAAA,MAAG,CAAsB,OACvGA,OAAM,aAAa,IAAI,OAAqB,SAAS,gBAAgB,IAAI;AAAA,IACjF;AAAA,IACD,YAAY,MAAM,SAAS;AACvB,UAAI,CAAC,KAAK,UAAU,QAAQ;AACxB,eAAO;AACX,UAAI,SAAS,CAAA;AACb,eAAS,OAAO;AACZ,YAAI,CAAC,QAAQ,aAAa,IAAI,MAAM,IAAI,EAAE;AACtC,iBAAO,KAAK,IAAI,QAAQ,QAAQ,OAAO,IAAI,IAAI,GAAG,QAAQ,OAAO,IAAI,EAAE,GAAG,IAAI,IAAI,CAAC;AAC3F,aAAO;AAAA,IACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQD,eAAe,SAAS,YAAY;AAChC,UAAI,WAAW,KAAK,aAAa;AACjC,UAAI,SAAS,WAAW,MAAyB,KAAmB,aAAa,UAAU,GAAG,eAAe,UAAU;AAEvH,UAAI,KAAK,wBAAwB,UAAU,OAAO,CAAC;AAC/C,eAAO;AACX,UAAI,OAAO,CAAA;AACX,UAAI,SAAS,CAAC,MAAM,IAAI,MAAM,cAAc;AACxC,YAAI,KAAK,OAAO;AACZ;AACJ,YAAI,MAAM,KAAK,MAAM,UAAU,MAAM,QAAQ,CAAC,IAAI,IAAI;AACtD,YAAI,CAAC,IAAI;AACL,gBAAM,KAAK,IAAI,EAAE;AACrB,iBAAS,OAAO,OAAO;AACnB,cAAI,MAAM,QAAQ,MAAM,IAAI;AACxB,mBAAO,MAAM,MAAM,IAA0B,MAAM,SAAS;AAC5D,mBAAO,MAAM,IAA0B,IAAI,MAAM,SAAS;AAC1D;AAAA,UACH;AAAA,QACJ;AACD,YAAI,MAAM,KAAK,SAAS,CAAA+C,SAAOA,KAAI,QAAQ,KAAK,QAAQA,KAAI,MAAM,KAAK,MACnE,KAAK,IAAIA,KAAI,OAAO,IAAI,IAAI,cAAc,KAAK,IAAIA,KAAI,KAAK,EAAE,IAAI,cAClE,CAAC,MAAM,KAAK,SAAOA,KAAI,OAAO,OAAOA,KAAI,KAAK,GAAG,CAAC;AACtD,YAAI,CAAC,KAAK;AAEN,cAAI,KAAK,KAAK,MAAM,cAAc,YAC9B,WAAW,cAAc,KAAK,CAAAnE,OAAKA,GAAE,QAAQ,MAAMA,GAAE,MAAM,EAAE,GAAG;AAChE,gBAAI,YAAY,WAAW,mBAAmB,gBAAgB,OAAO,EAAE,GAAG,OAAO,IAAI,EAAE;AACvF,gBAAI,YAAY;AACZ,mBAAK;AAAA,UACZ;AACD,gBAAM,IAAI,QAAQ,MAAM,IAAI,KAAK,QAAQ,MAAM,MAAM,IAAI,SAAS,CAAC;AAAA,QACtE;AACD,aAAK,KAAK,GAAG;AAAA,MACzB;AACQ,eAAS,QAAQ,KAAK,eAAe;AACjC,YAAI,KAAK,SAAS;AACd;AACJ,YAAI,YAAY,cAAc,KAAK,MAAM,KAAK,IAAI,KAAK,SAAS;AAChE,YAAI,UAAU,QAAQ;AAClB;AACJ,YAAI,SAAS,KAAK,eAAe,KAAK,aAAa,MAAM,OAAO;AAChE,YAAI,UAAU;AACd,YAAI,UAAU;AACV,cAAI,eAAgB,SAAS,KAAK,aAAa,aAAc,KAAK,aAAa;AAC/E,cAAIoB,MAAK;AACT,cAAI,UAAU,MAAM;AAChB,gBAAI,aAAa,aAAa,WAAW,MAAM;AAC/C,gBAAI,cAAc,KAAK,gBAAgB,KAAK,cAAc,IAAI,gBAAgB,KAAK;AACnF,YAAAA,OAAM,aAAa;AACnB,kBAAM,aAAa;AAAA,UACtB,OACI;AACD,YAAAA,QAAO,KAAK,aAAa,KAAK,MAAM,gBAAgB,KAAK;AACzD,mBAAO,KAAK,gBAAgB,KAAK,MAAM,gBAAgB,KAAK;AAAA,UAC/D;AACD,qBAAW,aAAa,WAAWA,IAAG;AACtC,mBAAS,aAAa,WAAW,GAAG;AAAA,QACvC,OACI;AACD,cAAI,aAAa,UAAU,QAAQ,KAAK,aAAa;AACrD,cAAI,cAAc,SAAS,KAAK,aAAa;AAC7C,cAAI,MAAM;AACV,cAAI,UAAU,MAAM;AAChB,gBAAI,aAAa,aAAa,WAAW,MAAM;AAC/C,gBAAI,cAAc,KAAK,cAAc,QAAQ,KAAK,cAAc,QAAQ,IAAI,eAAe;AAC3F,mBAAO,aAAa;AACpB,oBAAQ,aAAa;AAAA,UACxB,OACI;AACD,oBAAQ,KAAK,cAAc,OAAO,eAAe;AACjD,qBAAS,KAAK,cAAc,QAAQ,eAAe;AAAA,UACtD;AACD,qBAAW,aAAa,WAAW,IAAI;AACvC,mBAAS,aAAa,WAAW,KAAK;AAAA,QACzC;AACD,YAAI,WAAW,KAAK;AAChB,iBAAO,KAAK,MAAM,UAAU,MAAM,SAAS;AAC/C,YAAI,SAAS,KAAK;AACd,iBAAO,QAAQ,KAAK,IAAI,MAAM,SAAS;AAAA,MAC9C;AACD,aAAO;AAAA,IACV;AAAA,IACD,QAAQ,MAAM,MAAM,IAAI,WAAW;AAC/B,UAAI,WAAW,aAAa,WAAW,EAAE,IAAI,aAAa,WAAW,IAAI;AACzE,UAAI,KAAK,aAAa,cAAc;AAChC,eAAO,KAAK,SAAS;AAAA,MACxB,OACI;AACD,eAAO,UAAU,QAAQ,KAAK,aAAa,YAAY;AAAA,MAC1D;AAAA,IACJ;AAAA,IACD,eAAe,MAAM;AACjB,UAAI,CAAC,QAAQ,KAAK,MAAM,KAAK,QAAQ,GAAG;AACpC,aAAK,WAAW;AAChB,aAAK,cAAc,WAAW,IAAI,KAAK,IAAI,SAAO,IAAI,KAAK,KAAK,aAAa,YAAY,CAAC,CAAC;AAAA,MAC9F;AAAA,IACJ;AAAA,IACD,uBAAuB;AACnB,UAAI,OAAO,KAAK;AAChB,UAAI,KAAK,SAAS;AACd,eAAO,KAAK,OAAO,KAAK,WAAW;AACvC,UAAI,SAAS,CAAA;AACb,eAAS,MAAM,MAAM,KAAK,SAAS,MAAM,KAAK,SAAS,IAAI;AAAA,QACvD,KAAK,MAAM,IAAI;AAAE,iBAAO,KAAK,EAAE,MAAM,GAAI,CAAA;AAAA,QAAI;AAAA,QAC7C,QAAQ;AAAA,QAAG;AAAA,MACd,GAAE,EAAE;AACL,UAAI,UAAU,OAAO,UAAU,KAAK,cAAc,UAC9C,KAAK,cAAc,KAAK,CAACpB,IAAGnB,OAAMmB,GAAE,QAAQ,OAAOnB,EAAC,EAAE,QAAQmB,GAAE,MAAM,OAAOnB,EAAC,EAAE,EAAE;AACtF,WAAK,gBAAgB;AACrB,aAAO,UAAU,IAAmB;AAAA,IACvC;AAAA,IACD,YAAY,KAAK;AACb,aAAQ,OAAO,KAAK,SAAS,QAAQ,OAAO,KAAK,SAAS,MAAM,KAAK,cAAc,KAAK,CAAAiB,OAAKA,GAAE,QAAQ,OAAOA,GAAE,MAAM,GAAG,KACrH,WAAW,KAAK,UAAU,OAAO,KAAK,UAAU,OAAO,KAAK,cAAc,GAAG,CAAC,GAAG,KAAK,MAAM;AAAA,IACnG;AAAA,IACD,kBAAkB,QAAQ;AACtB,aAAO,WAAW,KAAK,UAAU,OAAO,KAAK,OAAO,QAAQ,MAAM,GAAG,UAAU,UAAU,KAAK,cAAc,GAAG,CAAC,GAAG,KAAK,MAAM;AAAA,IACjI;AAAA,IACD,eAAe,WAAW;AACtB,UAAI,QAAQ,KAAK,kBAAkB,YAAY,CAAC;AAChD,aAAO,MAAM,QAAQ,KAAK,SAAS,QAAQ,KAAK,cAAc,CAAC,EAAE,MAAM,YAAY,MAAM,QAAQ,KAAK,cAAc,CAAC;AAAA,IACxH;AAAA,IACD,gBAAgB,QAAQ;AACpB,aAAO,WAAW,KAAK,UAAU,QAAQ,KAAK,OAAO,QAAQ,MAAM,GAAG,KAAK,cAAc,GAAG,CAAC,GAAG,KAAK,MAAM;AAAA,IAC9G;AAAA,IACD,IAAI,YAAY;AACZ,aAAO,KAAK,OAAO,MAAM,KAAK,UAAU,MAAM;AAAA,IACjD;AAAA,IACD,IAAI,gBAAgB;AAChB,aAAO,KAAK,YAAY,KAAK,aAAa,KAAK;AAAA,IAClD;AAAA,EACL;AAAA,EACA,MAAM,SAAS;AAAA,IACX,YAAY,MAAM,IAAI;AAClB,WAAK,OAAO;AACZ,WAAK,KAAK;AAAA,IACb;AAAA,EACL;AACA,WAAS,cAAc,MAAM,IAAI,WAAW;AACxC,QAAI,SAAS,CAAA,GAAI,MAAM,MAAM,QAAQ;AACrC,aAAS,MAAM,WAAW,MAAM,IAAI;AAAA,MAChC,OAAO;AAAA,MAAG;AAAA,MACV,MAAMe,OAAMC,KAAI;AACZ,YAAID,QAAO,KAAK;AACZ,iBAAO,KAAK,EAAE,MAAM,KAAK,IAAIA,MAAI,CAAE;AACnC,mBAASA,QAAO;AAAA,QACnB;AACD,cAAMC;AAAA,MACT;AAAA,IACJ,GAAE,EAAE;AACL,QAAI,MAAM,IAAI;AACV,aAAO,KAAK,EAAE,MAAM,KAAK,GAAI,CAAA;AAC7B,eAAS,KAAK;AAAA,IACjB;AACD,WAAO,EAAE,OAAO;EACpB;AACA,WAAS,aAAa,EAAE,OAAO,OAAM,GAAI,OAAO;AAC5C,QAAI,SAAS;AACT,aAAO,OAAO,CAAC,EAAE;AACrB,QAAI,SAAS;AACT,aAAO,OAAO,OAAO,SAAS,CAAC,EAAE;AACrC,QAAI,OAAO,KAAK,MAAM,QAAQ,KAAK;AACnC,aAASjC,KAAI,KAAIA,MAAK;AAClB,UAAI,EAAE,MAAM,OAAO,OAAOA,EAAC,GAAG,OAAO,KAAK;AAC1C,UAAI,QAAQ;AACR,eAAO,OAAO;AAClB,cAAQ;AAAA,IACX;AAAA,EACL;AACA,WAAS,aAAa,WAAW,KAAK;AAClC,QAAI,UAAU;AACd,aAAS,EAAE,MAAM,GAAE,KAAM,UAAU,QAAQ;AACvC,UAAI,OAAO,IAAI;AACX,mBAAW,MAAM;AACjB;AAAA,MACH;AACD,iBAAW,KAAK;AAAA,IACnB;AACD,WAAO,UAAU,UAAU;AAAA,EAC/B;AACA,WAAS,KAAK,OAAOkC,IAAG;AACpB,aAAS,OAAO;AACZ,UAAIA,GAAE,GAAG;AACL,eAAO;AACf,WAAO;AAAA,EACX;AAGA,QAAM,WAAW;AAAA,IACb,MAAM/B,IAAG;AAAE,aAAOA;AAAA,IAAI;AAAA,IACtB,QAAQA,IAAG;AAAE,aAAOA;AAAA,IAAI;AAAA,IACxB,OAAO;AAAA,EACX;AAAA,EAIA,MAAM,UAAU;AAAA,IACZ,YAAY,QAAQ,WAAW,WAAW;AACtC,UAAI,WAAW,GAAG0B,QAAO,GAAG,UAAU;AACtC,WAAK,YAAY,UAAU,IAAI,CAAC,EAAE,MAAM,SAAS;AAC7C,YAAIU,OAAM,UAAU,OAAO,MAAM,UAAU,OAAO,QAAQ,GAAG,CAAC,EAAE;AAChE,YAAI,SAAS,UAAU,OAAO,IAAI,UAAU,OAAO,QAAQ,GAAG,CAAC,EAAE;AACjE,oBAAY,SAASA;AACrB,eAAO,EAAE,MAAM,IAAI,KAAAA,MAAK,QAAQ,QAAQ,GAAG,WAAW;MAClE,CAAS;AACD,WAAK,SAAS,MAA6B,aAAa,UAAU,SAAS;AAC3E,eAAS,OAAO,KAAK,WAAW;AAC5B,YAAI,SAAS,WAAW,IAAI,MAAMV,SAAQ,KAAK;AAC/C,kBAAU,IAAI,YAAY,IAAI,UAAU,IAAI,SAAS,IAAI;AACzD,QAAAA,QAAO,IAAI;AAAA,MACd;AAAA,IACJ;AAAA,IACD,MAAM1B,IAAG;AACL,eAASH,KAAI,GAAG6B,QAAO,GAAG,UAAU,KAAI7B,MAAK;AACzC,YAAI,KAAKA,KAAI,KAAK,UAAU,SAAS,KAAK,UAAUA,EAAC,IAAI;AACzD,YAAI,CAAC,MAAMG,KAAI,GAAG;AACd,iBAAO,WAAWA,KAAI0B,SAAQ,KAAK;AACvC,YAAI1B,MAAK,GAAG;AACR,iBAAO,GAAG,UAAUA,KAAI,GAAG;AAC/B,QAAA0B,QAAO,GAAG;AACV,kBAAU,GAAG;AAAA,MAChB;AAAA,IACJ;AAAA,IACD,QAAQ1B,IAAG;AACP,eAASH,KAAI,GAAG6B,QAAO,GAAG,UAAU,KAAI7B,MAAK;AACzC,YAAI,KAAKA,KAAI,KAAK,UAAU,SAAS,KAAK,UAAUA,EAAC,IAAI;AACzD,YAAI,CAAC,MAAMG,KAAI,GAAG;AACd,iBAAO0B,SAAQ1B,KAAI,WAAW,KAAK;AACvC,YAAIA,MAAK,GAAG;AACR,iBAAO,GAAG,OAAOA,KAAI,GAAG;AAC5B,QAAA0B,QAAO,GAAG;AACV,kBAAU,GAAG;AAAA,MAChB;AAAA,IACJ;AAAA,EACL;AACA,WAAS,WAAW,OAAO,QAAQ;AAC/B,QAAI,OAAO,SAAS;AAChB,aAAO;AACX,QAAI,OAAO,OAAO,MAAM,MAAM,GAAG,GAAG,UAAU,OAAO,MAAM,MAAM,MAAM;AACvE,WAAO,IAAI,UAAU,MAAM,MAAM,MAAM,QAAQ,MAAM,UAAU,MAAM,MAAM,QAAQ,MAAM,QAAQ,IAAI,MAAM,SAAS,IAAI,CAAAZ,OAAK,WAAWA,IAAG,MAAM,CAAC,IAAI,MAAM,QAAQ;AAAA,EACxK;AAEA,QAAM,QAAqB,sBAAM,OAAO,EAAE,SAAS,UAAQ,KAAK,KAAK,GAAG,EAAC,CAAE;AAC3E,QAAM,YAAyB,sBAAM,OAAO,EAAE,SAAS,YAAU,OAAO,QAAQ,IAAI,IAAI,GAAI,CAAA;AAC5F,QAAM,cAA2B,4BAAY,QAAS,GAAE,cAA2B,4BAAY,QAAO,GAAI,aAA0B,4BAAY;AAChJ,QAAM,eAAe,EAAE,UAAU,MAAM,aAAa,SAAS,MAAM;AACnE,WAAS,WAAW,MAAM,MAAM,QAAQ;AACpC,WAAO,IAAI,YAAY,MAAM;AAAA,MACzB,OAAO,KAAK;AACR,eAAO,IAAI,KAAK,GAAG,IAAI,IAAI,QAAQ,QAAQ,CAAAgC,OAAK;AAC5C,cAAIA,MAAK;AACL,mBAAO;AACX,cAAI,CAAC,UAAU,CAAC,OAAOA,EAAC;AACpB,kBAAM,IAAI,WAAW,yBAAyBA,EAAC,EAAE;AACrD,iBAAO,OAAOA,EAAC;AAAA,QAC/B,CAAa,IAAI,OAAO,MAAM;AAAA,MACrB;AAAA,IACT,CAAK;AAAA,EACL;AACA,QAAM,cAA2B,2BAAW,MAAM,aAAa;AAAA,IAC3D,KAAK;AAAA,MACD,UAAU;AAAA,MACV,WAAW;AAAA,MACX,gBAAgB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,QASZ,SAAS;AAAA,MACZ;AAAA,MACD,SAAS;AAAA,MACT,eAAe;AAAA,IAClB;AAAA,IACD,gBAAgB;AAAA,MACZ,SAAS;AAAA,MACT,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,QAAQ;AAAA,MACR,WAAW;AAAA,MACX,UAAU;AAAA,MACV,QAAQ;AAAA,IACX;AAAA,IACD,eAAe;AAAA,MACX,QAAQ;AAAA,MACR,UAAU;AAAA,MACV,YAAY;AAAA,MACZ,SAAS;AAAA,MACT,YAAY;AAAA,MACZ,UAAU;AAAA,MACV,WAAW;AAAA,MACX,SAAS;AAAA,MACT,SAAS;AAAA,MACT,2BAA2B;AAAA,QACvB,kBAAkB;AAAA,MACrB;AAAA,IACJ;AAAA,IACD,oBAAoB;AAAA,MAChB,qBAAqB;AAAA,MACrB,YAAY;AAAA,MACZ,WAAW;AAAA,MACX,cAAc;AAAA,MACd,YAAY;AAAA,IACf;AAAA,IACD,sBAAsB,EAAE,YAAY,QAAS;AAAA,IAC7C,qBAAqB,EAAE,YAAY,QAAS;AAAA,IAC5C,YAAY;AAAA,MACR,SAAS;AAAA,MACT,SAAS;AAAA,IACZ;AAAA,IACD,aAAa;AAAA,MACT,UAAU;AAAA,MACV,MAAM;AAAA,MACN,KAAK;AAAA,MACL,SAAS;AAAA,MACT,SAAS;AAAA,QACL,UAAU;AAAA,MACb;AAAA,IACJ;AAAA,IACD,kCAAkC;AAAA,MAC9B,YAAY;AAAA,IACf;AAAA,IACD,iCAAiC;AAAA,MAC7B,YAAY;AAAA,IACf;AAAA,IACD,iFAAiF;AAAA,MAC7E,YAAY;AAAA,IACf;AAAA,IACD,gFAAgF;AAAA,MAC5E,YAAY;AAAA,IACf;AAAA,IACD,mBAAmB;AAAA,MACf,eAAe;AAAA,IAClB;AAAA,IACD,iDAAiD;AAAA,MAC7C,WAAW;AAAA,IACd;AAAA;AAAA;AAAA;AAAA,IAID,uBAAuB,EAAE,MAAM,CAAA,GAAI,OAAO,EAAE,SAAS,EAAC,GAAI,QAAQ,GAAI;AAAA,IACtE,wBAAwB,EAAE,MAAM,CAAA,GAAI,OAAO,EAAE,SAAS,EAAC,GAAI,QAAQ,GAAI;AAAA,IACvE,8BAA8B;AAAA,MAC1B,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,eAAe;AAAA,IAClB;AAAA,IACD,cAAc;AAAA,MACV,SAAS;AAAA,IACZ;AAAA,IACD,oBAAoB;AAAA,MAChB,iBAAiB;AAAA,IACpB;AAAA,IACD,kBAAkB;AAAA,MACd,UAAU;AAAA,IACb;AAAA,IACD,4DAA4D;AAAA,MACxD,SAAS;AAAA,IACZ;AAAA,IACD,yBAAyB,EAAE,iBAAiB,YAAa;AAAA,IACzD,wBAAwB,EAAE,iBAAiB,YAAa;AAAA,IACxD,0BAA0B,EAAE,OAAO,MAAO;AAAA,IAC1C,yBAAyB,EAAE,OAAO,OAAQ;AAAA,IAC1C,eAAe;AAAA,MACX,YAAY;AAAA,MACZ,SAAS;AAAA,MACT,QAAQ;AAAA,MACR,WAAW;AAAA,MACX,MAAM;AAAA,MACN,QAAQ;AAAA,IACX;AAAA,IACD,sBAAsB;AAAA,MAClB,iBAAiB;AAAA,MACjB,OAAO;AAAA,MACP,aAAa;AAAA,IAChB;AAAA,IACD,qBAAqB;AAAA,MACjB,iBAAiB;AAAA,MACjB,OAAO;AAAA,IACV;AAAA,IACD,cAAc;AAAA,MACV,SAAS;AAAA,MACT,eAAe;AAAA,MACf,YAAY;AAAA,MACZ,WAAW;AAAA,MACX,WAAW;AAAA,MACX,UAAU;AAAA,IACb;AAAA,IACD,qBAAqB;AAAA,MACjB,WAAW;AAAA,IACd;AAAA,IACD,qCAAqC;AAAA,MACjC,SAAS;AAAA,MACT,UAAU;AAAA,MACV,WAAW;AAAA,MACX,YAAY;AAAA,IACf;AAAA,IACD,+BAA+B;AAAA,MAC3B,iBAAiB;AAAA,IACpB;AAAA,IACD,8BAA8B;AAAA,MAC1B,iBAAiB;AAAA,IACpB;AAAA,IACD,cAAc;AAAA,MACV,WAAW;AAAA,MACX,UAAU;AAAA,MACV,MAAM;AAAA,MACN,OAAO;AAAA,IACV;AAAA,IACD,qBAAqB;AAAA,MACjB,iBAAiB;AAAA,MACjB,OAAO;AAAA,IACV;AAAA,IACD,yBAAyB;AAAA,MACrB,cAAc;AAAA,IACjB;AAAA,IACD,4BAA4B;AAAA,MACxB,WAAW;AAAA,IACd;AAAA,IACD,oBAAoB;AAAA,MAChB,iBAAiB;AAAA,MACjB,OAAO;AAAA,IACV;AAAA,IACD,WAAW;AAAA,MACP,SAAS;AAAA,MACT,UAAU;AAAA,MACV,eAAe;AAAA,IAClB;AAAA,IACD,oBAAoB;AAAA,MAChB,eAAe;AAAA,MACf,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,SAAS;AAAA,IACZ;AAAA,IACD,mBAAmB;AAAA,MACf,OAAO;AAAA,MACP,SAAS;AAAA,MACT,eAAe;AAAA,IAClB;AAAA,IACD,6BAA6B;AAAA,MACzB,SAAS;AAAA,MACT,UAAU;AAAA,MACV,eAAe;AAAA,MACf,OAAO;AAAA,IACV;AAAA,IACD,oBAAoB;AAAA,MAChB,iBAAiB;AAAA,MACjB,gBAAgB;AAAA,MAChB,oBAAoB;AAAA,MACpB,kBAAkB;AAAA,IACrB;AAAA,IACD,qBAAqB;AAAA,MACjB,iBAAiB;AAAA,IACpB;AAAA,IACD,cAAc;AAAA,MACV,eAAe;AAAA,MACf,OAAO;AAAA,MACP,UAAU;AAAA,MACV,SAAS;AAAA,MACT,cAAc;AAAA,IACjB;AAAA,IACD,qBAAqB;AAAA,MACjB,iBAAiB;AAAA,MACjB,QAAQ;AAAA,MACR,YAAY;AAAA,QACR,iBAAiB;AAAA,MACpB;AAAA,IACJ;AAAA,IACD,oBAAoB;AAAA,MAChB,iBAAiB;AAAA,MACjB,QAAQ;AAAA,MACR,YAAY;AAAA,QACR,iBAAiB;AAAA,MACpB;AAAA,IACJ;AAAA,IACD,iBAAiB;AAAA,MACb,eAAe;AAAA,MACf,OAAO;AAAA,MACP,UAAU;AAAA,MACV,QAAQ;AAAA,MACR,SAAS;AAAA,IACZ;AAAA,IACD,wBAAwB;AAAA,MACpB,iBAAiB;AAAA,IACpB;AAAA,IACD,uBAAuB;AAAA,MACnB,QAAQ;AAAA,MACR,iBAAiB;AAAA,IACpB;AAAA,EACL,GAAG,YAAY;AAAA,EAEf,MAAM,UAAU;AAAA,IACZ,YAAY,MAAM,OAAO,KAAK,UAAU;AACpC,WAAK,WAAW;AAChB,WAAK,SAAS;AACd,WAAK,OAAO;AACZ,UAAI,EAAE,eAAe,OAAO,iBAAiB,QAAS,IAAG,KAAK;AAC9D,UAAI,KAAK,MAAM,YAAY,QAAQ,IAAI;AAEnC,aAAK,SAAS;AAAA,MACjB,WACQ,QAAQ,OAAO,KAAK,SAAS,KAAK,QAAQ,gBAAgB,OAAO,KAAK,CAAC,IAAI;AAChF,YAAI,YAAY,SAAS,UAAU,CAAA,IAAK,gBAAgB,IAAI;AAC5D,YAAI,SAAS,IAAI,UAAU,WAAW,KAAK,KAAK;AAChD,eAAO,UAAU,KAAK,OAAO,UAAU,KAAK,OAAO,MAAM;AACzD,aAAK,OAAO,OAAO;AACnB,aAAK,SAAS,oBAAoB,WAAW,KAAK,OAAO,IAAI;AAAA,MAChE,OACI;AACD,YAAI,SAAS,KAAK,SAAS;AAC3B,YAAI,OAAO,SAAS,MAAM,QAAQ,OAAO,aAAa,MAAM,UAAU,OAAO,eACzE,CAAC,SAAS,KAAK,YAAY,OAAO,SAAS,IACzC,KAAK,MAAM,UAAU,KAAK,OAC1B,KAAK,QAAQ,WAAW,OAAO,WAAW,OAAO,WAAW;AAClE,YAAI,SAAS,WAAW,QAAQ,QAAQ,OAAO,cAAc,QAAQ,UAAU,OAAO,gBAClF,CAAC,SAAS,KAAK,YAAY,OAAO,UAAU,IAC1C,KAAK,MAAM,UAAU,KAAK,SAC1B,KAAK,QAAQ,WAAW,OAAO,YAAY,OAAO,YAAY;AACpE,aAAK,SAAS,gBAAgB,OAAO,QAAQ,IAAI;AAAA,MACpD;AAAA,IACJ;AAAA,EACL;AACA,WAAS,eAAe,MAAM,WAAW;AACrC,QAAI;AACJ,QAAI,EAAE,OAAQ,IAAG,WAAW,MAAM,KAAK,MAAM,UAAU;AACvD,QAAI,UAAU,KAAK,WAAW,cAAc,KAAK,QAAQ,MAAM,KAAK,WAAW,cAAc;AAC7F,QAAI,UAAU,QAAQ;AAClB,UAAI,EAAE,MAAM,OAAO,UAAU;AAC7B,UAAI,eAAe,IAAI,MAAM,gBAAgB;AAG7C,UAAI,YAAY,KAAK,QAAQ,WAAW,UAAU,KAAK,SAAS,KAAK,MAAM;AACvE,uBAAe,IAAI;AACnB,wBAAgB;AAAA,MACnB;AACD,UAAI,OAAO,SAAS,KAAK,MAAM,IAAI,YAAY,MAAM,IAAI,oBAAoB,GAAG,UAAU,MAAM,eAAe,MAAM,aAAa;AAClI,UAAI,MAAM;AAGN,YAAI,QAAQ,UAAU,WAAW,MAC7B,KAAK,OAAO,KAAK,OAAO,KAAK,UAAU,KAAK,MAAM,KAAK,MAAM,KAAK,GAAG,KAAK,uBAAuB;AACjG,eAAK;AACT,iBAAS;AAAA,UAAE,MAAM,OAAO,KAAK;AAAA,UAAM,IAAI,OAAO,KAAK;AAAA,UAC/C,QAAQ,KAAK,GAAG,UAAU,KAAK,MAAM,KAAK,MAAM,KAAK,GAAG,EAAE,MAAM,oBAAoB,CAAC;AAAA,QAAC;AAAA,MAC7F;AAAA,IACJ,WACQ,WAAW,CAAC,KAAK,YAAY,KAAK,MAAM,MAAM,QAAQ,KAAK,OAAO,KAAK,GAAG,GAAG,IAAI;AACtF,eAAS;AAAA,IACZ;AACD,QAAI,CAAC,UAAU,CAAC;AACZ,aAAO;AACX,QAAI,CAAC,UAAU,UAAU,YAAY,CAAC,IAAI,SAAS,UAAU,OAAO,KAAK,OAAO;AAE5E,eAAS,EAAE,MAAM,IAAI,MAAM,IAAI,IAAI,IAAI,QAAQ,KAAK,MAAM,IAAI,MAAM,IAAI,MAAM,IAAI,EAAE;IACvF,WACQ,UAAU,OAAO,QAAQ,IAAI,QAAQ,OAAO,MAAM,IAAI,OAC1D,OAAO,QAAQ,IAAI,QAAQ,OAAO,MAAM,IAAI,OAC5C,IAAI,KAAK,IAAI,QAAS,OAAO,KAAK,OAAO,SAAS,GAAG;AAItD,eAAS;AAAA,QACL,MAAM,IAAI;AAAA,QAAM,IAAI,IAAI;AAAA,QACxB,QAAQ,KAAK,MAAM,IAAI,MAAM,IAAI,MAAM,OAAO,IAAI,EAAE,OAAO,OAAO,MAAM,EAAE,OAAO,KAAK,MAAM,IAAI,MAAM,OAAO,IAAI,IAAI,EAAE,CAAC;AAAA,MACpI;AAAA,IACK,YACS,QAAQ,OAAO,QAAQ,YAAY,UAAU,OAAO,QAAQ,OAAO,MAAM,OAAO,QAAQ,IAAI,OAAO,KACzG,SAAS,KAAK,OAAO,OAAO,SAAU,CAAA,KAAK,KAAK,WAAW,aAAa,aAAa,KAAK,OAAO;AAGjG,UAAI,UAAU,OAAO,OAAO,UAAU;AAClC,iBAAS,gBAAgB,OAAO,OAAO,KAAK,SAAS,GAAG,OAAO,KAAK,OAAO,CAAC;AAChF,eAAS,EAAE,MAAM,IAAI,MAAM,IAAI,IAAI,IAAI,QAAQ,KAAK,GAAG,CAAC,GAAG,CAAC,EAAC;AAAA,IAChE,WACQ,QAAQ,UAAU,UAAU,OAAO,QAAQ,OAAO,MAAM,OAAO,QAAQ,IAAI,QAChF,OAAO,OAAO,SAAQ,KAAM,SAAS,KAAK,cAAc;AAIxD,UAAI;AACA,iBAAS,gBAAgB,OAAO,OAAO,KAAK,SAAS,GAAG,OAAO,KAAK,OAAO,CAAC;AAChF,eAAS,EAAE,MAAM,IAAI,MAAM,IAAI,IAAI,IAAI,QAAQ,KAAK,GAAG,CAAC,GAAG,CAAC,EAAC;AAAA,IAChE;AACD,QAAI,QAAQ;AACR,UAAI,aAAa,KAAK;AACtB,UAAI,QAAQ,OAAO,KAAK,WAAW,YAAY,IAAI;AAC/C,eAAO;AAOX,UAAI,QAAQ,YACN,OAAO,QAAQ,IAAI,QAAQ,OAAO,MAAM,IAAI,MAC1C,OAAO,OAAO,UAAU,KAAK,OAAO,OAAO,SAAS,KACpD,YAAY,KAAK,YAAY,SAAS,EAAE,MACtC,OAAO,QAAQ,IAAI,OAAO,KAAK,OAAO,MAAM,IAAI,MAAM,OAAO,OAAO,UAAU,KAC5E,WAAW,KAAK,OAAO,OAAO,SAAS,OAAO,KAAK,OAAO,SAC1D,YAAY,KAAK,YAAY,aAAa,CAAC,KAC9C,OAAO,QAAQ,IAAI,QAAQ,OAAO,MAAM,IAAI,KAAK,KAAK,OAAO,OAAO,UAAU,KAC3E,YAAY,KAAK,YAAY,UAAU,EAAE;AACjD,eAAO;AACX,UAAI,OAAO,OAAO,OAAO,SAAQ;AACjC,UAAI,KAAK,MAAM,MAAM,YAAY,EAAE,KAAK,CAAAE,OAAKA,GAAE,MAAM,OAAO,MAAM,OAAO,IAAI,IAAI,CAAC;AAC9E,eAAO;AACX,UAAI,KAAK,WAAW,aAAa;AAC7B,aAAK,WAAW;AACpB,UAAI;AACJ,UAAI,OAAO,QAAQ,IAAI,QAAQ,OAAO,MAAM,IAAI,MAAM,OAAO,KAAK,OAAO,SAAS,IAAI,KAAK,IAAI,QAAQ,MAClG,CAAC,UAAU,OAAO,KAAK,SAAS,OAAO,KAAK,QAAQ,OAAO,OAAO,OAAO,OAAO,WACjF,KAAK,WAAW,YAAY,GAAG;AAC/B,YAAI,SAAS,IAAI,OAAO,OAAO,OAAO,WAAW,SAAS,IAAI,MAAM,OAAO,IAAI,IAAI;AACnF,YAAI,QAAQ,IAAI,KAAK,OAAO,KAAK,WAAW,SAAS,OAAO,IAAI,IAAI,EAAE,IAAI;AAC1E,aAAK,WAAW,iBAAiB,KAAK,MAAM,OAAO,SAAS,OAAO,OAAO,YAAY,GAAG,QAAW,KAAK,MAAM,SAAS,IAAI,KAAK,CAAC;AAAA,MACrI,OACI;AACD,YAAI,UAAU,WAAW,QAAQ,MAAM;AACvC,YAAI,UAAU,UAAU,OAAO,KAAK,MAAM,QAAQ,YAAY,OAAO,OAAO;AAE5E,YAAI,WAAW,UAAU,OAAO,SAAS,KAAK,KAAK,WAAW,aAAa,KACvE,OAAO,MAAM,IAAI,MAAM,OAAO,MAAM,IAAI,KAAK,IAAI;AACjD,cAAI,WAAW,KAAK,MAAM,SAAS,OAAO,MAAM,OAAO,EAAE;AACzD,cAAI,mBAAmB,2BAA2B,IAAI,KAAK,KAAK,MAAM,IAAI,OAAO,IAAI,IAAI;AACzF,cAAI,SAAS,IAAI,KAAK,OAAO,IAAI,OAAO,IAAI,KAAK,IAAI;AACrD,eAAK,WAAW,cAAc,WAAS;AACnC,gBAAI,MAAM,QAAQ,IAAI,QAAQ,MAAM,MAAM,IAAI;AAC1C,qBAAO,EAAE,SAAS,OAAO,WAAW,MAAM,IAAI,OAAO;AACzD,gBAAI,KAAK,MAAM,KAAK,QAAQ,OAAO,KAAK,SAAS;AACjD,gBAAI,MAAM,KAAK,MAAM,QAAQ,QAAQ,KAAK,MAAM,SAAS,MAAM,EAAE,KAAK;AAAA;AAAA;AAAA;AAAA,YAKlE,oBAAoB,MAAM,MAAM,iBAAiB,QAAQ,MAAM,QAAQ,iBAAiB;AACxF,qBAAO,EAAE,MAAK;AAClB,gBAAI,eAAe,WAAW,QAAQ,EAAE,MAAM,IAAI,QAAQ,OAAO,OAAM,CAAE,GAAG,SAAS,MAAM,KAAK,IAAI;AACpG,mBAAO;AAAA,cACH,SAAS;AAAA,cACT,OAAO,CAAC,UAAU,MAAM,IAAI,YAAY,IACpC,gBAAgB,MAAM,KAAK,IAAI,GAAG,QAAQ,SAAS,MAAM,GAAG,KAAK,IAAI,GAAG,QAAQ,OAAO,MAAM,CAAC;AAAA,YAC1H;AAAA,UACA,CAAiB;AAAA,QACJ,OACI;AACD,eAAK;AAAA,YACD;AAAA,YACA,WAAW,WAAW,WAAW,UAAU,aAAa,OAAO;AAAA,UACnF;AAAA,QACa;AAAA,MACJ;AACD,UAAI,YAAY;AAChB,UAAI,KAAK,aACL,KAAK,WAAW,4BAA4B,KAAK,WAAW,qBAAqB,KAAK,IAAK,IAAG,IAAI;AAClG,aAAK,WAAW,2BAA2B;AAC3C,qBAAa;AACb,YAAI,KAAK,WAAW,wBAAwB;AACxC,uBAAa;AACb,eAAK,WAAW,yBAAyB;AAAA,QAC5C;AAAA,MACJ;AACD,WAAK,SAAS,IAAI,EAAE,gBAAgB,MAAM,UAAS,CAAE;AACrD,aAAO;AAAA,IACV,WACQ,UAAU,CAAC,OAAO,KAAK,GAAG,GAAG,GAAG;AACrC,UAAIU,kBAAiB,OAAO,YAAY;AACxC,UAAI,KAAK,WAAW,oBAAoB,KAAK,IAAK,IAAG,IAAI;AACrD,YAAI,KAAK,WAAW,uBAAuB;AACvC,UAAAA,kBAAiB;AACrB,oBAAY,KAAK,WAAW;AAAA,MAC/B;AACD,WAAK,SAAS,EAAE,WAAW,QAAQ,gBAAAA,iBAAgB,UAAS,CAAE;AAC9D,aAAO;AAAA,IACV,OACI;AACD,aAAO;AAAA,IACV;AAAA,EACL;AACA,WAAS,SAASlE,IAAGsB,IAAG,cAAc,eAAe;AACjD,QAAI,SAAS,KAAK,IAAItB,GAAE,QAAQsB,GAAE,MAAM;AACxC,QAAI,OAAO;AACX,WAAO,OAAO,UAAUtB,GAAE,WAAW,IAAI,KAAKsB,GAAE,WAAW,IAAI;AAC3D;AACJ,QAAI,QAAQ,UAAUtB,GAAE,UAAUsB,GAAE;AAChC,aAAO;AACX,QAAI,MAAMtB,GAAE,QAAQ,MAAMsB,GAAE;AAC5B,WAAO,MAAM,KAAK,MAAM,KAAKtB,GAAE,WAAW,MAAM,CAAC,KAAKsB,GAAE,WAAW,MAAM,CAAC,GAAG;AACzE;AACA;AAAA,IACH;AACD,QAAI,iBAAiB,OAAO;AACxB,UAAI,SAAS,KAAK,IAAI,GAAG,OAAO,KAAK,IAAI,KAAK,GAAG,CAAC;AAClD,sBAAgB,MAAM,SAAS;AAAA,IAClC;AACD,QAAI,MAAM,QAAQtB,GAAE,SAASsB,GAAE,QAAQ;AACnC,UAAI,OAAO,gBAAgB,QAAQ,gBAAgB,MAAM,OAAO,eAAe;AAC/E,cAAQ;AACR,YAAM,QAAQ,MAAM;AACpB,YAAM;AAAA,IACT,WACQ,MAAM,MAAM;AACjB,UAAI,OAAO,gBAAgB,QAAQ,gBAAgB,MAAM,OAAO,eAAe;AAC/E,cAAQ;AACR,YAAM,QAAQ,MAAM;AACpB,YAAM;AAAA,IACT;AACD,WAAO,EAAE,MAAM,KAAK;EACxB;AACA,WAAS,gBAAgB,MAAM;AAC3B,QAAI,SAAS,CAAA;AACb,QAAI,KAAK,KAAK,iBAAiB,KAAK;AAChC,aAAO;AACX,QAAI,EAAE,YAAY,cAAc,WAAW,YAAW,IAAK,KAAK,SAAS;AACzE,QAAI,YAAY;AACZ,aAAO,KAAK,IAAI,SAAS,YAAY,YAAY,CAAC;AAClD,UAAI,aAAa,cAAc,eAAe;AAC1C,eAAO,KAAK,IAAI,SAAS,WAAW,WAAW,CAAC;AAAA,IACvD;AACD,WAAO;AAAA,EACX;AACA,WAAS,oBAAoB,QAAQY,OAAM;AACvC,QAAI,OAAO,UAAU;AACjB,aAAO;AACX,QAAI,SAAS,OAAO,CAAC,EAAE,KAAK,OAAO,OAAO,UAAU,IAAI,OAAO,CAAC,EAAE,MAAM;AACxE,WAAO,SAAS,MAAM,OAAO,KAAK,gBAAgB,OAAO,SAASA,OAAM,OAAOA,KAAI,IAAI;AAAA,EAC3F;AAEA,QAAM,iBAAiB;AAAA,IACnB,WAAW;AAAA,IACX,eAAe;AAAA,IACf,SAAS;AAAA,IACT,YAAY;AAAA,IACZ,uBAAuB;AAAA,EAC3B;AAGA,QAAM,cAAc,QAAQ,MAAM,QAAQ,cAAc;AAAA,EACxD,MAAM,YAAY;AAAA,IACd,YAAY,MAAM;AACd,WAAK,OAAO;AACZ,WAAK,SAAS;AAOd,WAAK,iBAAiB,IAAI;AAE1B,WAAK,mBAAmB;AACxB,WAAK,eAAe;AACpB,WAAK,gBAAgB;AACrB,WAAK,QAAQ;AACb,WAAK,oBAAoB;AACzB,WAAK,qBAAqB;AAC1B,WAAK,aAAa;AAClB,WAAK,gBAAgB;AACrB,WAAK,eAAe;AACpB,WAAK,eAAe;AACpB,WAAK,gBAAgB;AACrB,WAAK,eAAe;AACpB,WAAK,kBAAkB;AACvB,WAAK,OAAO;AAEZ,WAAK,cAAc;AACnB,WAAK,MAAM,KAAK;AAChB,WAAK,WAAW,IAAI,iBAAiB,eAAa;AAC9C,iBAAS,OAAO;AACZ,eAAK,MAAM,KAAK,GAAG;AAUvB,aAAK,QAAQ,MAAM,QAAQ,cAAc,MAAM,QAAQ,OAAO,KAAK,cAC/D,UAAU,KAAK,CAAAoB,OAAKA,GAAE,QAAQ,eAAeA,GAAE,aAAa,UACxDA,GAAE,QAAQ,mBAAmBA,GAAE,SAAS,SAASA,GAAE,OAAO,UAAU,MAAM;AAC9E,eAAK,UAAS;AAAA;AAEd,eAAK,MAAK;AAAA,MAC1B,CAAS;AACD,UAAI;AACA,aAAK,aAAa,CAAC,UAAU;AACzB,eAAK,MAAM,KAAK;AAAA,YAAE,QAAQ,MAAM;AAAA,YAC5B,MAAM;AAAA,YACN,UAAU,MAAM;AAAA,UAAS,CAAE;AAC/B,eAAK,UAAS;AAAA,QAC9B;AACQ,WAAK,oBAAoB,KAAK,kBAAkB,KAAK,IAAI;AACzD,WAAK,WAAW,KAAK,SAAS,KAAK,IAAI;AACvC,WAAK,UAAU,KAAK,QAAQ,KAAK,IAAI;AACrC,WAAK,WAAW,KAAK,SAAS,KAAK,IAAI;AACvC,UAAI,OAAO,kBAAkB,YAAY;AACrC,aAAK,eAAe,IAAI,eAAe,MAAM;AACzC,cAAI/B;AACJ,gBAAMA,MAAK,KAAK,KAAK,aAAa,QAAQA,QAAO,SAAS,SAASA,IAAG,cAAc,KAAK,IAAG,IAAK;AAC7F,iBAAK,SAAQ;AAAA,QACjC,CAAa;AACD,aAAK,aAAa,QAAQ,KAAK,SAAS;AACxC,aAAK,gBAAgB,IAAI,eAAe,MAAM,KAAK,KAAK,eAAc,CAAE;AACxE,aAAK,cAAc,QAAQ,KAAK,UAAU;AAAA,MAC7C;AACD,WAAK,mBAAmB,KAAK,MAAM,KAAK,GAAG;AAC3C,WAAK,MAAK;AACV,UAAI,OAAO,wBAAwB,YAAY;AAC3C,aAAK,eAAe,IAAI,qBAAqB,aAAW;AACpD,cAAI,KAAK,cAAc;AACnB,iBAAK,cAAc,WAAW,KAAK,gBAAgB,KAAK,IAAI,GAAG,GAAI;AACvE,cAAI,QAAQ,SAAS,KAAM,QAAQ,QAAQ,SAAS,CAAC,EAAE,oBAAoB,KAAM,KAAK,cAAc;AAChG,iBAAK,eAAe,CAAC,KAAK;AAC1B,gBAAI,KAAK,gBAAgB,KAAK,KAAK;AAC/B,mBAAK,gBAAgB,SAAS,YAAY,OAAO,CAAC;AAAA,UACzD;AAAA,QACJ,GAAE,EAAE,WAAW,CAAC,GAAG,IAAI,EAAG,CAAA;AAC3B,aAAK,aAAa,QAAQ,KAAK,GAAG;AAClC,aAAK,kBAAkB,IAAI,qBAAqB,aAAW;AACvD,cAAI,QAAQ,SAAS,KAAK,QAAQ,QAAQ,SAAS,CAAC,EAAE,oBAAoB;AACtE,iBAAK,gBAAgB,SAAS,YAAY,OAAO,CAAC;AAAA,QACzD,GAAE,CAAE,CAAA;AAAA,MACR;AACD,WAAK,gBAAe;AACpB,WAAK,mBAAkB;AAAA,IAC1B;AAAA,IACD,gBAAgBrB,IAAG;AACf,WAAK,KAAK,WAAW,kBAAkB,KAAK,MAAMA,EAAC;AACnD,UAAI,KAAK;AACL,aAAK,KAAK;IACjB;AAAA,IACD,SAASA,IAAG;AACR,UAAI,KAAK;AACL,aAAK,MAAM,KAAK;AACpB,WAAK,gBAAgBA,EAAC;AAAA,IACzB;AAAA,IACD,WAAW;AACP,UAAI,KAAK,gBAAgB;AACrB,aAAK,gBAAgB,WAAW,MAAM;AAClC,eAAK,gBAAgB;AACrB,eAAK,KAAK;QACb,GAAE,EAAE;AAAA,IACZ;AAAA,IACD,UAAU;AACN,WAAK,KAAK,UAAU,WAAW;AAC/B,WAAK,KAAK;AACV,iBAAW,MAAM;AACb,aAAK,KAAK,UAAU,WAAW;AAC/B,aAAK,KAAK;MACb,GAAE,GAAG;AAAA,IACT;AAAA,IACD,WAAW,MAAM;AACb,UAAI,KAAK,oBAAoB,KAAK,UAAU,KAAK,KAAK,UAAU,KAAK,KAAK,KAAK,CAAC,GAAGG,OAAM,KAAK,KAAKA,EAAC,CAAC,IAAI;AACrG,aAAK,gBAAgB;AACrB,iBAAS,OAAO;AACZ,eAAK,gBAAgB,QAAQ,GAAG;AACpC,aAAK,OAAO;AAAA,MACf;AAAA,IACJ;AAAA,IACD,kBAAkB,OAAO;AACrB,UAAI,aAAa,KAAK;AACtB,UAAI,CAAC,KAAK,mBAAoB,KAAI,KAAK;AACnC;AACJ,UAAI,EAAE,KAAI,IAAK,MAAM,MAAM,KAAK;AAChC,UAAI,KAAK,MAAM,MAAM,QAAQ,IAAI,KAAK,KAAK,iBAAiB,KAAK,MAAM,CAAC,aAAa,KAAK,KAAK,GAAG;AAC9F;AACJ,UAAI,UAAU,IAAI,cAAc,KAAK,QAAQ,QAAQ,IAAI,UAAU;AACnE,UAAI,WAAW,QAAQ,YAAY,KAAK,GAAG;AACvC,YAAI,CAAC;AACD,eAAK,mBAAmB;AAC5B;AAAA,MACH;AAMD,WAAK,QAAQ,MAAM,QAAQ,cAAc,MAAM,QAAQ,WAAW,QAAQ,WAAW,CAAC,KAAK,MAAM,UAAU,KAAK;AAAA,MAE5G,IAAI,aAAa,qBAAqB,IAAI,WAAW,IAAI,aAAa,IAAI,YAAY,IAAI,YAAY;AACtG,aAAK,UAAS;AAAA;AAEd,aAAK,MAAM,KAAK;AAAA,IACvB;AAAA,IACD,qBAAqB;AACjB,UAAI,EAAE,KAAM,IAAG;AAGf,UAAI,QAAQ,QAAQ,UAAU,KAAK,KAAK,YAAY,MAChD,kBAAkB,KAAK,IAAI,aAAa,KAAK,KAAK,OAClD,yBAAyB,KAAK,IAAI,KAAK,aAAa,KAAK,IAAI;AACjE,UAAI,CAAC,SAAS,KAAK,eAAe,GAAG,KAAK;AACtC,eAAO;AACX,UAAI,QAAQ,aAAa,KAAK,KAAK,KAAK;AAIxC,UAAI,SAAS,CAAC,KAAK,oBACf,KAAK,WAAW,gBAAgB,KAAK,IAAK,IAAG,OAC7C,KAAK,WAAW,gBAAgB,KAAK,IAAK,IAAG,OAC7C,eAAe,KAAK,KAAK,KAAK,GAAG;AACjC,aAAK,KAAK,WAAW,gBAAgB;AACrC,aAAK,QAAQ;AACb,eAAO;AAAA,MACV;AACD,WAAK,eAAe,SAAS,KAAK;AAClC,UAAI;AACA,aAAK,mBAAmB;AAC5B,aAAO;AAAA,IACV;AAAA,IACD,kBAAkB,QAAQ,MAAM;AAC5B,WAAK,eAAe,IAAI,OAAO,MAAM,OAAO,QAAQ,KAAK,MAAM,KAAK,MAAM;AAC1E,WAAK,mBAAmB;AAAA,IAC3B;AAAA,IACD,sBAAsB;AAClB,WAAK,eAAe,IAAI,MAAM,GAAG,MAAM,CAAC;AAAA,IAC3C;AAAA,IACD,kBAAkB;AACd,WAAK,cAAc;AACnB,UAAIA,KAAI,GAAG,UAAU;AACrB,eAAS,MAAM,KAAK,KAAK,OAAM;AAC3B,YAAI,IAAI,YAAY,GAAG;AACnB,cAAI,CAAC,WAAWA,KAAI,KAAK,cAAc,UAAU,KAAK,cAAcA,EAAC,KAAK;AACtE,YAAAA;AAAA,mBACK,CAAC;AACN,sBAAU,KAAK,cAAc,MAAM,GAAGA,EAAC;AAC3C,cAAI;AACA,oBAAQ,KAAK,GAAG;AACpB,gBAAM,IAAI,gBAAgB,IAAI;AAAA,QACjC,WACQ,IAAI,YAAY,IAAI;AACzB,gBAAM,IAAI;AAAA,QACb,OACI;AACD;AAAA,QACH;AAAA,MACJ;AACD,UAAIA,KAAI,KAAK,cAAc,UAAU,CAAC;AAClC,kBAAU,KAAK,cAAc,MAAM,GAAGA,EAAC;AAC3C,UAAI,SAAS;AACT,iBAAS,OAAO,KAAK;AACjB,cAAI,oBAAoB,UAAU,KAAK,QAAQ;AACnD,iBAAS,OAAO,KAAK,gBAAgB;AACjC,cAAI,iBAAiB,UAAU,KAAK,QAAQ;AAAA,MACnD;AAAA,IACJ;AAAA,IACD,OAAOkC,IAAG;AACN,UAAI,CAAC,KAAK;AACN,eAAOA,GAAC;AACZ,UAAI;AACA,aAAK,KAAI;AACT,eAAOA,GAAC;AAAA,MACX,UACO;AACJ,aAAK,MAAK;AACV,aAAK,MAAK;AAAA,MACb;AAAA,IACJ;AAAA,IACD,QAAQ;AACJ,UAAI,KAAK;AACL;AACJ,WAAK,SAAS,QAAQ,KAAK,KAAK,cAAc;AAC9C,UAAI;AACA,aAAK,IAAI,iBAAiB,4BAA4B,KAAK,UAAU;AACzE,WAAK,SAAS;AAAA,IACjB;AAAA,IACD,OAAO;AACH,UAAI,CAAC,KAAK;AACN;AACJ,WAAK,SAAS;AACd,WAAK,SAAS;AACd,UAAI;AACA,aAAK,IAAI,oBAAoB,4BAA4B,KAAK,UAAU;AAAA,IAC/E;AAAA;AAAA,IAED,QAAQ;AACJ,WAAK,eAAc;AACnB,WAAK,MAAM,SAAS;AACpB,WAAK,mBAAmB;AAAA,IAC3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IASD,gBAAgB,KAAK,SAAS;AAC1B,UAAIhB;AACJ,UAAI,CAAC,KAAK,mBAAmB;AACzB,YAAI,QAAQ,MAAM;AACd,cAAIqE,OAAM,KAAK;AACf,cAAIA,MAAK;AACL,iBAAK,uBAAsB;AAC3B,iBAAK,KAAK,WAAW,cAAcA,KAAI;AACvC,iBAAK,KAAK,WAAW,cAAc,KAAK,IAAG;AAC3C,gBAAI,UAAU,KAAK;AACnB,gBAAI,CAAC,WAAWA,KAAI;AAChB,0BAAY,KAAK,KAAKA,KAAI,KAAKA,KAAI,OAAO;AAAA,UACjD;AAAA,QACjB;AACY,aAAK,qBAAqB,KAAK,KAAK,IAAI,sBAAsB,KAAK;AAAA,MACtE;AAGD,UAAI,CAAC,KAAK,qBAAqB,OAAO;AAClC,aAAK,oBAAoB;AAAA,UACrB;AAAA,UAAK;AAAA;AAAA;AAAA;AAAA;AAAA,UAKL,OAAO,KAAK,aAAa,KAAK,QAAQ,MAAM,CAAC,GAAGrE,MAAK,KAAK,uBAAuB,QAAQA,QAAO,SAAS,SAASA,IAAG;AAAA,QACrI;AAAA,IACK;AAAA,IACD,yBAAyB;AACrB,WAAK,IAAI,qBAAqB,KAAK,kBAAkB;AACrD,WAAK,oBAAoB;AACzB,WAAK,qBAAqB;AAAA,IAC7B;AAAA,IACD,YAAY;AACR,UAAI,KAAK,eAAe;AACpB,aAAK,eAAe,KAAK,KAAK,IAAI,sBAAsB,MAAM;AAAE,eAAK,eAAe;AAAI,eAAK,MAAK;AAAA,QAAG,CAAE;AAAA,IAC9G;AAAA,IACD,aAAa;AACT,UAAI,KAAK,gBAAgB,GAAG;AACxB,aAAK,KAAK,IAAI,qBAAqB,KAAK,YAAY;AACpD,aAAK,eAAe;AAAA,MACvB;AACD,WAAK,MAAK;AAAA,IACb;AAAA,IACD,iBAAiB;AACb,eAAS,OAAO,KAAK,SAAS,YAAa;AACvC,aAAK,MAAM,KAAK,GAAG;AACvB,aAAO,KAAK;AAAA,IACf;AAAA,IACD,iBAAiB;AACb,UAAI,UAAU,KAAK;AACnB,UAAI,QAAQ;AACR,aAAK,QAAQ;AACjB,UAAI,OAAO,IAAI,KAAK,IAAI,WAAW;AACnC,eAAS,UAAU,SAAS;AACxB,YAAI,QAAQ,KAAK,aAAa,MAAM;AACpC,YAAI,CAAC;AACD;AACJ,YAAI,MAAM;AACN,qBAAW;AACf,YAAI,QAAQ,IAAI;AACZ,WAAC,EAAE,MAAM,GAAI,IAAG;AAAA,QACnB,OACI;AACD,iBAAO,KAAK,IAAI,MAAM,MAAM,IAAI;AAChC,eAAK,KAAK,IAAI,MAAM,IAAI,EAAE;AAAA,QAC7B;AAAA,MACJ;AACD,aAAO,EAAE,MAAM,IAAI;IACtB;AAAA,IACD,aAAa;AACT,UAAI,EAAE,MAAM,IAAI,SAAQ,IAAK,KAAK;AAClC,UAAI,SAAS,KAAK,oBAAoB,aAAa,KAAK,KAAK,KAAK,cAAc;AAChF,UAAI,OAAO,KAAK,CAAC;AACb,eAAO;AACX,UAAI,OAAO;AACP,aAAK,aAAa,KAAK;AAC3B,WAAK,KAAK,WAAW,gBAAgB;AACrC,WAAK,mBAAmB;AACxB,aAAO,IAAI,UAAU,KAAK,MAAM,MAAM,IAAI,QAAQ;AAAA,IACrD;AAAA;AAAA,IAED,MAAM,gBAAgB,MAAM;AAIxB,UAAI,KAAK,gBAAgB,KAAK,KAAK;AAC/B,eAAO;AACX,UAAI;AACA,aAAK,mBAAkB;AAC3B,UAAI,YAAY,KAAK;AACrB,UAAI,CAAC;AACD,eAAO;AACX,UAAI,aAAa,KAAK,KAAK;AAC3B,UAAI,UAAU,eAAe,KAAK,MAAM,SAAS;AAEjD,UAAI,KAAK,KAAK,SAAS;AACnB,aAAK,KAAK,OAAO,CAAA,CAAE;AACvB,aAAO;AAAA,IACV;AAAA,IACD,aAAa,KAAK;AACd,UAAI,QAAQ,KAAK,KAAK,QAAQ,QAAQ,IAAI,MAAM;AAChD,UAAI,CAAC,SAAS,MAAM,eAAe,GAAG;AAClC,eAAO;AACX,YAAM,UAAU,IAAI,QAAQ,YAAY;AACxC,UAAI,IAAI,QAAQ;AACZ,cAAM,SAAS;AACnB,UAAI,IAAI,QAAQ,aAAa;AACzB,YAAI,cAAc,UAAU,OAAO,IAAI,mBAAmB,IAAI,OAAO,iBAAiB,EAAE;AACxF,YAAI,aAAa,UAAU,OAAO,IAAI,eAAe,IAAI,OAAO,aAAa,CAAC;AAC9E,eAAO;AAAA,UAAE,MAAM,cAAc,MAAM,SAAS,WAAW,IAAI,MAAM;AAAA,UAC7D,IAAI,aAAa,MAAM,UAAU,UAAU,IAAI,MAAM;AAAA,UAAU,UAAU;AAAA;MAChF,WACQ,IAAI,QAAQ,iBAAiB;AAClC,eAAO,EAAE,MAAM,MAAM,YAAY,IAAI,MAAM,UAAU,UAAU,IAAI,OAAO,aAAa,IAAI,SAAQ;AAAA,MACtG,OACI;AACD,eAAO;AAAA,MACV;AAAA,IACJ;AAAA,IACD,UAAU,KAAK;AACX,UAAI,OAAO,KAAK,KAAK;AACjB,aAAK,sBAAsB,KAAK,GAAG;AACnC,aAAK,MAAM;AACX,aAAK,mBAAmB,KAAK,GAAG;AAAA,MACnC;AAAA,IACJ;AAAA,IACD,mBAAmB,KAAK;AACpB,UAAI,iBAAiB,UAAU,KAAK,QAAQ;AAC5C,UAAI,iBAAiB,eAAe,KAAK,OAAO;AAChD,UAAI,iBAAiB,UAAU,KAAK,QAAQ;AAC5C,UAAI,SAAS,iBAAiB,mBAAmB,KAAK,iBAAiB;AAAA,IAC1E;AAAA,IACD,sBAAsB,KAAK;AACvB,UAAI,oBAAoB,UAAU,KAAK,QAAQ;AAC/C,UAAI,oBAAoB,UAAU,KAAK,QAAQ;AAC/C,UAAI,oBAAoB,eAAe,KAAK,OAAO;AACnD,UAAI,SAAS,oBAAoB,mBAAmB,KAAK,iBAAiB;AAAA,IAC7E;AAAA,IACD,UAAU;AACN,UAAIA,KAAI+D,KAAI,IAAI;AAChB,WAAK,KAAI;AACT,OAAC/D,MAAK,KAAK,kBAAkB,QAAQA,QAAO,SAAS,SAASA,IAAG,WAAU;AAC3E,OAAC+D,MAAK,KAAK,qBAAqB,QAAQA,QAAO,SAAS,SAASA,IAAG,WAAU;AAC9E,OAAC,KAAK,KAAK,kBAAkB,QAAQ,OAAO,SAAS,SAAS,GAAG,WAAU;AAC3E,OAAC,KAAK,KAAK,mBAAmB,QAAQ,OAAO,SAAS,SAAS,GAAG,WAAU;AAC5E,eAAS,OAAO,KAAK;AACjB,YAAI,oBAAoB,UAAU,KAAK,QAAQ;AACnD,WAAK,sBAAsB,KAAK,GAAG;AACnC,mBAAa,KAAK,WAAW;AAC7B,mBAAa,KAAK,aAAa;AAC/B,WAAK,IAAI,qBAAqB,KAAK,YAAY;AAC/C,WAAK,IAAI,qBAAqB,KAAK,kBAAkB;AAAA,IACxD;AAAA,EACL;AACA,WAAS,UAAU,OAAO,KAAK,KAAK;AAChC,WAAO,KAAK;AACR,UAAI,UAAU,YAAY,IAAI,GAAG;AACjC,UAAI,WAAW,QAAQ,UAAU;AAC7B,eAAO;AACX,UAAI,SAAS,IAAI;AACjB,YAAM,UAAU,MAAM,MAAM,SAAS,MAAM,IAAI,IAAI,cAAc,IAAI;AAAA,IACxE;AACD,WAAO;AAAA,EACX;AAEA,WAAS,yBAAyB,MAAM;AACpC,QAAI,QAAQ;AAMZ,aAAS,KAAK,OAAO;AACjB,YAAM,eAAc;AACpB,YAAM,yBAAwB;AAC9B,cAAQ,MAAM,gBAAiB,EAAC,CAAC;AAAA,IACpC;AACD,SAAK,WAAW,iBAAiB,eAAe,MAAM,IAAI;AAC1D,SAAK,IAAI,cAAc,YAAY,QAAQ;AAC3C,SAAK,WAAW,oBAAoB,eAAe,MAAM,IAAI;AAC7D,QAAI,CAAC;AACD,aAAO;AACX,QAAI,aAAa,MAAM,gBAAgB,eAAe,MAAM;AAC5D,QAAI,YAAY,MAAM,cAAc,cAAc,MAAM;AACxD,QAAI,YAAY,KAAK,QAAQ,SAAS,KAAK,MAAM,UAAU,KAAK,MAAM;AAItE,QAAI,qBAAqB,UAAU,MAAM,UAAU,QAAQ,WAAW,WAAW;AAC7E,OAAC,YAAY,cAAc,WAAW,WAAW,IAAI,CAAC,WAAW,aAAa,YAAY,YAAY;AAC1G,WAAO,EAAE,YAAY,cAAc,WAAW,YAAW;AAAA,EAC7D;AAAA,EAqBA,MAAM,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMb,YAAY,SAAS,IAAI;AACrB,WAAK,UAAU;AACf,WAAK,YAAY,oBAAI;AACrB,WAAK,cAAc;AACnB,WAAK,eAAe;AACpB,WAAK,YAAY;AACjB,WAAK,YAAY;AAIjB,WAAK,cAAc;AAInB,WAAK,mBAAmB;AAIxB,WAAK,kBAAkB;AACvB,WAAK,aAAa,SAAS,cAAc,KAAK;AAC9C,WAAK,YAAY,SAAS,cAAc,KAAK;AAC7C,WAAK,UAAU,WAAW;AAC1B,WAAK,UAAU,YAAY;AAC3B,WAAK,UAAU,YAAY,KAAK,UAAU;AAC1C,WAAK,cAAc,SAAS,cAAc,KAAK;AAC/C,WAAK,YAAY,MAAM,UAAU;AACjC,WAAK,YAAY,aAAa,aAAa,QAAQ;AACnD,WAAK,MAAM,SAAS,cAAc,KAAK;AACvC,WAAK,IAAI,YAAY,KAAK,WAAW;AACrC,WAAK,IAAI,YAAY,KAAK,SAAS;AACnC,WAAK,YAAY,OAAO,aAAa,CAAC,OAAO,KAAK,OAAO,CAAC,EAAE,CAAC;AAC7D,WAAK,WAAW,KAAK,SAAS,KAAK,IAAI;AACvC,WAAK,QAAS,OAAO,QAAQ,QAAQ,OAAO,MAAM,KAAK;AACvD,WAAK,YAAY,IAAI,UAAU,OAAO,SAAS,YAAY,OAAO,MAAM,CAAC;AACzE,WAAK,UAAU,KAAK,MAAM,MAAM,UAAU,EAAE,IAAI,UAAQ,IAAI,eAAe,IAAI,CAAC;AAChF,eAAS,UAAU,KAAK;AACpB,eAAO,OAAO,IAAI;AACtB,WAAK,WAAW,IAAI,YAAY,IAAI;AACpC,WAAK,aAAa,IAAI,WAAW,IAAI;AACrC,WAAK,WAAW,eAAe,MAAM,KAAK,OAAO;AACjD,WAAK,UAAU,IAAI,QAAQ,IAAI;AAC/B,WAAK,YAAW;AAChB,WAAK,YAAW;AAChB,WAAK,cAAc;AACnB,WAAK,eAAc;AACnB,UAAI,OAAO;AACP,eAAO,OAAO,YAAY,KAAK,GAAG;AAAA,IACzC;AAAA;AAAA;AAAA;AAAA,IAID,IAAI,QAAQ;AAAE,aAAO,KAAK,UAAU;AAAA,IAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQ5C,IAAI,WAAW;AAAE,aAAO,KAAK,UAAU;AAAA,IAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IASlD,IAAI,gBAAgB;AAAE,aAAO,KAAK,UAAU;AAAA,IAAgB;AAAA;AAAA;AAAA;AAAA;AAAA,IAK5D,IAAI,SAAS;AAAE,aAAO,KAAK,UAAU;AAAA,IAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAM9C,IAAI,YAAY;AAAE,aAAO,KAAK,WAAW,YAAY;AAAA,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOzD,IAAI,qBAAqB;AAAE,aAAO,KAAK,WAAW,aAAa;AAAA,IAAI;AAAA;AAAA;AAAA;AAAA,IAInE,IAAI,OAAO;AAAE,aAAO,KAAK;AAAA,IAAQ;AAAA;AAAA;AAAA;AAAA,IAIjC,IAAI,MAAM;AAAE,aAAO,KAAK,IAAI,cAAc,eAAe;AAAA,IAAS;AAAA,IAClE,YAAY,OAAO;AACf,UAAI,KAAK,MAAM,UAAU,KAAK,MAAM,CAAC,aAAa,cAAc,MAAM,CAAC,IACjE,KAAK,MAAM,OAAO,GAAG,KAAK;AAChC,WAAK,UAAU,IAAI,IAAI;AAAA,IAC1B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IASD,OAAO,cAAc;AACjB,UAAI,KAAK,eAAe;AACpB,cAAM,IAAI,MAAM,2EAA2E;AAC/F,UAAI,UAAU,OAAO,eAAe,OAAO;AAC3C,UAAI,QAAQ,KAAK;AACjB,eAAS,MAAM,cAAc;AACzB,YAAI,GAAG,cAAc;AACjB,gBAAM,IAAI,WAAW,uFAAuF;AAChH,gBAAQ,GAAG;AAAA,MACd;AACD,UAAI,KAAK,WAAW;AAChB,aAAK,UAAU,QAAQ;AACvB;AAAA,MACH;AACD,UAAI,QAAQ,KAAK,UAAU,YAAY,GAAG,gBAAgB;AAC1D,UAAI,aAAa,KAAK,QAAM,GAAG,WAAW,aAAa,CAAC,GAAG;AACvD,aAAK,WAAW,kBAAkB;AAElC,oBAAY;AAAA,MACf,WACQ,SAAS,KAAK,WAAW,iBAAiB;AAC/C,aAAK,WAAW,kBAAkB;AAGlC,wBAAgB,uBAAuB,OAAO,KAAK;AACnD,YAAI,CAAC;AACD,sBAAY;AAAA,MACnB;AAGD,UAAI,aAAa,KAAK,SAAS,mBAAmB,YAAY;AAC9D,UAAI,YAAY;AACZ,aAAK,SAAS;AACd,oBAAY,KAAK,SAAS;AAG1B,YAAI,aAAa,CAAC,KAAK,MAAM,IAAI,GAAG,MAAM,GAAG,KAAK,CAAC,KAAK,MAAM,UAAU,GAAG,MAAM,SAAS;AACtF,sBAAY;AAAA,MACnB,OACI;AACD,aAAK,SAAS;MACjB;AAED,UAAI,MAAM,MAAM,YAAY,OAAO,KAAK,KAAK,MAAM,MAAM,YAAY,OAAO;AACxE,eAAO,KAAK,SAAS,KAAK;AAC9B,eAAS,WAAW,OAAO,MAAM,OAAO,YAAY;AACpD,aAAO,SAAS;AAChB,UAAI,eAAe,KAAK,UAAU;AAClC,UAAI;AACA,aAAK,cAAc;AACnB,iBAAS,MAAM,cAAc;AACzB,cAAI;AACA,2BAAe,aAAa,IAAI,GAAG,OAAO;AAC9C,cAAI,GAAG,gBAAgB;AACnB,gBAAI,EAAE,KAAM,IAAG,GAAG,MAAM;AACxB,2BAAe,IAAI,aAAa,KAAK,QAAQ,OAAO,gBAAgB,OAAO,KAAK,MAAM,KAAK,OAAO,KAAK,SAAS,KAAK,CAAC,CAAC;AAAA,UAC1H;AACD,mBAASpF,MAAK,GAAG;AACb,gBAAIA,GAAE,GAAG,cAAc;AACnB,6BAAeA,GAAE;AAAA,QAC5B;AACD,aAAK,UAAU,OAAO,QAAQ,YAAY;AAC1C,aAAK,YAAY,YAAY,OAAO,KAAK,WAAW,OAAO,OAAO;AAClE,YAAI,CAAC,OAAO,OAAO;AACf,eAAK,cAAc,MAAM;AACzB,eAAK,WAAW,OAAO,MAAM;AAAA,QAChC;AACD,kBAAU,KAAK,QAAQ,OAAO,MAAM;AACpC,YAAI,KAAK,MAAM,MAAM,WAAW,KAAK,KAAK;AACtC,eAAK,YAAW;AACpB,uBAAe,KAAK;AACpB,aAAK,kBAAkB,YAAY;AACnC,aAAK,QAAQ,gBAAgB,SAAS,aAAa,KAAK,QAAM,GAAG,YAAY,gBAAgB,CAAC,CAAC;AAAA,MAClG,UACO;AACJ,aAAK,cAAc;AAAA,MACtB;AACD,UAAI,OAAO,WAAW,MAAM,KAAK,KAAK,OAAO,MAAM,MAAM,KAAK;AAC1D,aAAK,UAAU,qBAAqB;AACxC,UAAI,WAAW,gBAAgB,gBAAgB,KAAK,UAAU,0BAA0B,KAAK,UAAU;AACnG,aAAK,eAAc;AACvB,UAAI,CAAC,OAAO;AACR,iBAAS,YAAY,KAAK,MAAM,MAAM,cAAc;AAChD,mBAAS,MAAM;AACvB,UAAI,iBAAiB;AACjB,gBAAQ,UAAU,KAAK,MAAM;AACzB,cAAI,iBAAiB,KAAK,SAAS,cAAc;AAC7C,iBAAK,SAAS,aAAa;AAC/B,cAAI,WAAW;AACX,gBAAI,CAAC,eAAe,MAAM,SAAS,KAAK,WAAW;AAC/C,0BAAY,KAAK,YAAY,WAAW,KAAK,WAAW,OAAO;AAAA,UACtE;AAAA,QACjB,CAAa;AAAA,IACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQD,SAAS,UAAU;AACf,UAAI,KAAK,eAAe;AACpB,cAAM,IAAI,MAAM,6EAA6E;AACjG,UAAI,KAAK,WAAW;AAChB,aAAK,UAAU,QAAQ;AACvB;AAAA,MACH;AACD,WAAK,cAAc;AACnB,UAAI,WAAW,KAAK;AACpB,UAAI;AACA,iBAAS,UAAU,KAAK;AACpB,iBAAO,QAAQ,IAAI;AACvB,aAAK,YAAY,IAAI,UAAU,QAAQ;AACvC,aAAK,UAAU,SAAS,MAAM,UAAU,EAAE,IAAI,UAAQ,IAAI,eAAe,IAAI,CAAC;AAC9E,aAAK,UAAU;AACf,iBAAS,UAAU,KAAK;AACpB,iBAAO,OAAO,IAAI;AACtB,aAAK,UAAU,IAAI,QAAQ,IAAI;AAC/B,aAAK,WAAW,eAAe,MAAM,KAAK,OAAO;AACjD,aAAK,YAAW;AAChB,aAAK,YAAW;AAChB,aAAK,YAAY;MACpB,UACO;AACJ,aAAK,cAAc;AAAA,MACtB;AACD,UAAI;AACA,aAAK,MAAK;AACd,WAAK,eAAc;AAAA,IACtB;AAAA,IACD,cAAc,QAAQ;AAClB,UAAI,YAAY,OAAO,WAAW,MAAM,UAAU,GAAG,QAAQ,OAAO,MAAM,MAAM,UAAU;AAC1F,UAAI,aAAa,OAAO;AACpB,YAAI,aAAa,CAAA;AACjB,iBAAS,QAAQ,OAAO;AACpB,cAAI,QAAQ,UAAU,QAAQ,IAAI;AAClC,cAAI,QAAQ,GAAG;AACX,uBAAW,KAAK,IAAI,eAAe,IAAI,CAAC;AAAA,UAC3C,OACI;AACD,gBAAI,SAAS,KAAK,QAAQ,KAAK;AAC/B,mBAAO,aAAa;AACpB,uBAAW,KAAK,MAAM;AAAA,UACzB;AAAA,QACJ;AACD,iBAAS,UAAU,KAAK;AACpB,cAAI,OAAO,cAAc;AACrB,mBAAO,QAAQ,IAAI;AAC3B,aAAK,UAAU;AACf,aAAK,UAAU;AACf,aAAK,WAAW,eAAe,MAAM,KAAK,OAAO;AAAA,MACpD,OACI;AACD,iBAASuB,MAAK,KAAK;AACf,UAAAA,GAAE,aAAa;AAAA,MACtB;AACD,eAASpB,KAAI,GAAGA,KAAI,KAAK,QAAQ,QAAQA;AACrC,aAAK,QAAQA,EAAC,EAAE,OAAO,IAAI;AAAA,IAClC;AAAA;AAAA;AAAA;AAAA,IAID,QAAQ,QAAQ,MAAM;AAClB,UAAI,KAAK;AACL;AACJ,UAAI,KAAK,mBAAmB;AACxB,aAAK,IAAI,qBAAqB,KAAK,gBAAgB;AACvD,WAAK,mBAAmB;AACxB,UAAI;AACA,aAAK,SAAS;AAClB,UAAI,UAAU;AACd,UAAI,OAAO,KAAK,WAAW,EAAE,UAAS,IAAK;AAC3C,UAAI,EAAE,iBAAiB,uBAAuB,KAAK;AACnD,UAAI,aAAa,KAAK,UAAU;AAC5B,6BAAqB;AACzB,WAAK,UAAU,qBAAqB;AACpC,UAAI;AACA,iBAASA,KAAI,KAAIA,MAAK;AAClB,cAAI,qBAAqB,GAAG;AACxB,gBAAI,mBAAmB,IAAI,GAAG;AAC1B,gCAAkB;AAClB,mCAAqB,KAAK,UAAU,UAAU;AAAA,YACjD,OACI;AACD,kBAAI,QAAQ,KAAK,UAAU,eAAe,SAAS;AACnD,gCAAkB,MAAM;AACxB,mCAAqB,MAAM;AAAA,YAC9B;AAAA,UACJ;AACD,eAAK,cAAc;AACnB,cAAI,UAAU,KAAK,UAAU,QAAQ,IAAI;AACzC,cAAI,CAAC,WAAW,CAAC,KAAK,gBAAgB,UAAU,KAAK,UAAU,gBAAgB;AAC3E;AACJ,cAAIA,KAAI,GAAG;AACP,oBAAQ,KAAK,KAAK,gBAAgB,SAC5B,6CACA,8BAA8B;AACpC;AAAA,UACH;AACD,cAAI,YAAY,CAAA;AAEhB,cAAI,EAAE,UAAU;AACZ,aAAC,KAAK,iBAAiB,SAAS,IAAI,CAAC,WAAW,KAAK,eAAe;AACxE,cAAI,WAAW,UAAU,IAAI,CAAAiD,OAAK;AAC9B,gBAAI;AACA,qBAAOA,GAAE,KAAK,IAAI;AAAA,YACrB,SACMpD,IAAG;AACN,2BAAa,KAAK,OAAOA,EAAC;AAC1B,qBAAO;AAAA,YACV;AAAA,UACrB,CAAiB;AACD,cAAI,SAAS,WAAW,OAAO,MAAM,KAAK,OAAO,CAAE,CAAA,GAAG,UAAU;AAChE,iBAAO,SAAS;AAChB,cAAI,CAAC;AACD,sBAAU;AAAA;AAEV,oBAAQ,SAAS;AACrB,eAAK,cAAc;AACnB,cAAI,CAAC,OAAO,OAAO;AACf,iBAAK,cAAc,MAAM;AACzB,iBAAK,WAAW,OAAO,MAAM;AAC7B,iBAAK,YAAW;AAChB,sBAAU,KAAK,QAAQ,OAAO,MAAM;AAAA,UACvC;AACD,mBAASG,KAAI,GAAGA,KAAI,UAAU,QAAQA;AAClC,gBAAI,SAASA,EAAC,KAAK,YAAY;AAC3B,kBAAI;AACA,oBAAIiD,KAAI,UAAUjD,EAAC;AACnB,oBAAIiD,GAAE;AACF,kBAAAA,GAAE,MAAM,SAASjD,EAAC,GAAG,IAAI;AAAA,cAChC,SACMH,IAAG;AACN,6BAAa,KAAK,OAAOA,EAAC;AAAA,cAC7B;AAAA,YACJ;AACL,cAAI;AACA,iBAAK,QAAQ,gBAAgB,IAAI;AACrC,cAAI,CAAC,OAAO,mBAAmB,KAAK,gBAAgB,UAAU,GAAG;AAC7D,gBAAI,KAAK,UAAU,cAAc;AAC7B,kBAAI,KAAK,UAAU,cAAc;AAC7B,qBAAK,QAAQ,eAAe,KAAK,UAAU,YAAY;AACvD,qBAAK,UAAU,eAAe;AAC9B;AAAA,cACH,OACI;AACD,oBAAI,kBAAkB,kBAAkB,IAAI,KAAK,UAAU,UAAU,SACjE,KAAK,UAAU,YAAY,eAAe,EAAE;AAChD,oBAAI,OAAO,kBAAkB;AAC7B,oBAAI,OAAO,KAAK,OAAO,IAAI;AACvB,8BAAY,KAAK,YAAY,YAAY;AACzC,uCAAqB;AACrB;AAAA,gBACH;AAAA,cACJ;AAAA,YACJ;AACD;AAAA,UACH;AAAA,QACJ;AAAA,MACJ,UACO;AACJ,aAAK,cAAc;AACnB,aAAK,mBAAmB;AAAA,MAC3B;AACD,UAAI,WAAW,CAAC,QAAQ;AACpB,iBAAS,YAAY,KAAK,MAAM,MAAM,cAAc;AAChD,mBAAS,OAAO;AAAA,IAC3B;AAAA;AAAA;AAAA;AAAA,IAID,IAAI,eAAe;AACf,aAAO,cAAc,OAChB,KAAK,MAAM,MAAM,SAAS,IAAI,aAAa,eAAe,MAC3D,KAAK,MAAM,MAAM,KAAK;AAAA,IAC7B;AAAA,IACD,cAAc;AACV,UAAI,cAAc,eAAe,MAAM,kBAAkB;AAAA,QACrD,OAAO,eAAe,KAAK,WAAW,iBAAiB,OAAO,KAAK;AAAA,MAC/E,CAAS;AACD,UAAI,eAAe;AAAA,QACf,YAAY;AAAA,QACZ,aAAa;AAAA,QACb,gBAAgB;AAAA,QAChB,WAAW;AAAA,QACX,iBAAiB,CAAC,KAAK,MAAM,MAAM,QAAQ,IAAI,UAAU;AAAA,QACzD,OAAO;AAAA,QACP,OAAO,GAAG,QAAQ,OAAO,KAAK,KAAK,MAAM,OAAO;AAAA,QAChD,MAAM;AAAA,QACN,kBAAkB;AAAA,MAC9B;AACQ,UAAI,KAAK,MAAM;AACX,qBAAa,eAAe,IAAI;AACpC,qBAAe,MAAM,mBAAmB,YAAY;AACpD,UAAI,UAAU,KAAK,SAAS,OAAO,MAAM;AACrC,YAAI,iBAAiB,YAAY,KAAK,YAAY,KAAK,cAAc,YAAY;AACjF,YAAI,gBAAgB,YAAY,KAAK,KAAK,KAAK,aAAa,WAAW;AACvE,eAAO,kBAAkB;AAAA,MACrC,CAAS;AACD,WAAK,cAAc;AACnB,WAAK,eAAe;AACpB,aAAO;AAAA,IACV;AAAA,IACD,kBAAkB,KAAK;AACnB,UAAI,QAAQ;AACZ,eAAS,MAAM;AACX,iBAAS,UAAU,GAAG;AAClB,cAAI,OAAO,GAAG,WAAW,QAAQ,GAAG;AAChC,gBAAI;AACA,mBAAK,YAAY,cAAc;AACnC,oBAAQ;AACR,gBAAI,MAAM,KAAK,YAAY,YAAY,SAAS,cAAc,KAAK,CAAC;AACpE,gBAAI,cAAc,OAAO;AAAA,UAC5B;AAAA,IACZ;AAAA,IACD,cAAc;AACV,WAAK,eAAe,KAAK,MAAM,MAAM,WAAW;AAChD,kBAAY,MAAM,KAAK,MAAM,KAAK,aAAa,OAAO,WAAW,EAAE,QAAO,CAAE;AAAA,IAC/E;AAAA,IACD,eAAe;AACX,UAAI,KAAK,eAAe;AACpB,cAAM,IAAI,MAAM,0DAA0D;AAC9E,UAAI,KAAK,eAAe,KAAgB,KAAK,mBAAmB;AAC5D,aAAK,QAAQ,KAAK;AAAA,IACzB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IASD,eAAe,SAAS;AACpB,UAAI,KAAK,mBAAmB;AACxB,aAAK,mBAAmB,KAAK,IAAI,sBAAsB,MAAM,KAAK,QAAO,CAAE;AAC/E,UAAI,SAAS;AACT,YAAI,KAAK,gBAAgB,QAAQ,OAAO,IAAI;AACxC;AACJ,YAAI,QAAQ,OAAO;AACf,mBAASG,KAAI,GAAGA,KAAI,KAAK,gBAAgB,QAAQA,MAAK;AAClD,gBAAI,KAAK,gBAAgBA,EAAC,EAAE,QAAQ,QAAQ,KAAK;AAC7C,mBAAK,gBAAgBA,EAAC,IAAI;AAC1B;AAAA,YACH;AAAA,UACJ;AACL,aAAK,gBAAgB,KAAK,OAAO;AAAA,MACpC;AAAA,IACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOD,OAAO,QAAQ;AACX,UAAI,QAAQ,KAAK,UAAU,IAAI,MAAM;AACrC,UAAI,UAAU,UAAa,SAAS,MAAM,QAAQ;AAC9C,aAAK,UAAU,IAAI,QAAQ,QAAQ,KAAK,QAAQ,KAAK,CAAAoB,OAAKA,GAAE,QAAQ,MAAM,KAAK,IAAI;AACvF,aAAO,SAAS,MAAM,OAAO,IAAI,EAAE;AAAA,IACtC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMD,IAAI,cAAc;AACd,aAAO,KAAK,WAAW,sBAAqB,EAAG,MAAM,KAAK,UAAU;AAAA,IACvE;AAAA;AAAA;AAAA;AAAA,IAID,IAAI,kBAAkB;AAClB,aAAO,EAAE,KAAK,KAAK,UAAU,YAAY,QAAQ,KAAK,UAAU;IACnE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMD,gBAAgB,QAAQ;AACpB,WAAK,aAAY;AACjB,aAAO,KAAK,UAAU,gBAAgB,MAAM;AAAA,IAC/C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOD,kBAAkB,QAAQ;AACtB,WAAK,aAAY;AACjB,aAAO,KAAK,UAAU,kBAAkB,MAAM;AAAA,IACjD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOD,IAAI,qBAAqB;AACrB,aAAO,KAAK,UAAU;AAAA,IACzB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IASD,YAAY,KAAK;AACb,aAAO,KAAK,UAAU,YAAY,GAAG;AAAA,IACxC;AAAA;AAAA;AAAA;AAAA,IAID,IAAI,gBAAgB;AAChB,aAAO,KAAK,UAAU;AAAA,IACzB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAiBD,WAAW,OAAO,SAAS,IAAI;AAC3B,aAAO,UAAU,MAAM,OAAO,WAAW,MAAM,OAAO,SAAS,EAAE,CAAC;AAAA,IACrE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMD,YAAY,OAAO,SAAS;AACxB,aAAO,UAAU,MAAM,OAAO,WAAW,MAAM,OAAO,SAAS,aAAW,QAAQ,MAAM,MAAM,MAAM,OAAO,CAAC,CAAC;AAAA,IAChH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQD,mBAAmB,OAAO,SAAS,cAAc,MAAM;AACnD,aAAO,mBAAmB,MAAM,OAAO,SAAS,WAAW;AAAA,IAC9D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAcD,eAAe,OAAO,SAAS,UAAU;AACrC,aAAO,UAAU,MAAM,OAAO,eAAe,MAAM,OAAO,SAAS,QAAQ,CAAC;AAAA,IAC/E;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAWD,SAAS,KAAK;AACV,aAAO,KAAK,QAAQ,SAAS,GAAG;AAAA,IACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMD,SAAS,MAAM,SAAS,GAAG;AACvB,aAAO,KAAK,QAAQ,WAAW,MAAM,MAAM;AAAA,IAC9C;AAAA,IACD,YAAY,QAAQ,UAAU,MAAM;AAChC,WAAK,aAAY;AACjB,aAAO,YAAY,MAAM,QAAQ,OAAO;AAAA,IAC3C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQD,YAAY,KAAK,OAAO,GAAG;AACvB,WAAK,aAAY;AACjB,UAAI,OAAO,KAAK,QAAQ,SAAS,KAAK,IAAI;AAC1C,UAAI,CAAC,QAAQ,KAAK,QAAQ,KAAK;AAC3B,eAAO;AACX,UAAI,OAAO,KAAK,MAAM,IAAI,OAAO,GAAG,GAAG,QAAQ,KAAK,UAAU,IAAI;AAClE,UAAI,OAAO,MAAM,SAAS,KAAK,OAAO,MAAM,KAAK,MAAM,IAAI,IAAI,CAAC;AAChE,aAAO,YAAY,MAAO,KAAK,OAAO,UAAU,OAAS,OAAO,CAAE;AAAA,IACrE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMD,IAAI,wBAAwB;AAAE,aAAO,KAAK,UAAU,aAAa;AAAA,IAAY;AAAA;AAAA;AAAA;AAAA;AAAA,IAK7E,IAAI,oBAAoB;AAAE,aAAO,KAAK,UAAU,aAAa;AAAA,IAAa;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAM1E,IAAI,gBAAgB;AAAE,aAAO,KAAK,UAAU;AAAA,IAAuB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAUnE,gBAAgB,KAAK;AACjB,UAAI,UAAU,KAAK,MAAM,MAAM,oBAAoB;AACnD,UAAI,CAAC,WAAW,MAAM,KAAK,SAAS,QAAQ,MAAM,KAAK,SAAS;AAC5D,eAAO,KAAK;AAChB,WAAK,aAAY;AACjB,aAAO,KAAK,QAAQ,gBAAgB,GAAG;AAAA,IAC1C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOD,IAAI,eAAe;AAAE,aAAO,KAAK,UAAU,aAAa;AAAA,IAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IASvE,UAAU,MAAM;AACZ,UAAI,KAAK,SAAS;AACd,eAAO,aAAa,KAAK,MAAM;AACnC,UAAI,MAAM,KAAK,gBAAgB,KAAK,IAAI;AACxC,eAAS,SAAS,KAAK;AACnB,YAAI,MAAM,QAAQ,KAAK,QAAQ,MAAM,OAAO;AACxC,iBAAO,MAAM;AACrB,UAAI,QAAQ,aAAa,KAAK,MAAM,GAAG;AACvC,WAAK,UAAU,KAAK,IAAI,YAAY,KAAK,MAAM,KAAK,IAAI,KAAK,KAAK,CAAC;AACnE,aAAO;AAAA,IACV;AAAA;AAAA;AAAA;AAAA,IAID,IAAI,WAAW;AACX,UAAIF;AAKJ,cAAQ,KAAK,IAAI,cAAc,cAAc,QAAQ,YAAYA,MAAK,KAAK,gBAAgB,QAAQA,QAAO,SAAS,SAASA,IAAG,mBAAmB,KAAK,IAAG,IAAK,QAC3J,KAAK,KAAK,iBAAiB,KAAK;AAAA,IACvC;AAAA;AAAA;AAAA;AAAA,IAID,QAAQ;AACJ,WAAK,SAAS,OAAO,MAAM;AACvB,2BAAmB,KAAK,UAAU;AAClC,aAAK,QAAQ;MACzB,CAAS;AAAA,IACJ;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,QAAQ,MAAM;AACV,UAAI,KAAK,SAAS,MAAM;AACpB,aAAK,QAAQ;AACb,aAAK,SAAS,WAAW,KAAK,YAAY,IAAI,OAAO,KAAK,eAAe,eAAe,MAAM;AAC9F,aAAK,YAAW;AAAA,MACnB;AAAA,IACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOD,UAAU;AACN,eAAS,UAAU,KAAK;AACpB,eAAO,QAAQ,IAAI;AACvB,WAAK,UAAU;AACf,WAAK,WAAW;AAChB,WAAK,IAAI;AACT,WAAK,SAAS;AACd,UAAI,KAAK,mBAAmB;AACxB,aAAK,IAAI,qBAAqB,KAAK,gBAAgB;AACvD,WAAK,YAAY;AAAA,IACpB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMD,OAAO,eAAe,KAAK,UAAU,IAAI;AACrC,aAAO,eAAe,GAAG,IAAI,aAAa,OAAO,OAAO,WAAW,gBAAgB,OAAO,GAAG,IAAI,KAAK,QAAQ,GAAG,QAAQ,GAAG,QAAQ,SAAS,QAAQ,OAAO,CAAC;AAAA,IAChK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAaD,OAAO,iBAAiBgE,WAAU;AAC9B,aAAO,WAAW,OAAO,OAAO,CAAA,IAAK,EAAE,eAAeA,UAAQ,CAAE;AAAA,IACnE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAmBD,OAAO,MAAM,MAAM,SAAS;AACxB,UAAI,SAAS,YAAY;AACzB,UAAI,SAAS,CAAC,MAAM,GAAG,MAAM,GAAG,YAAY,GAAG,WAAW,IAAI,MAAM,IAAI,IAAI,CAAC,CAAC;AAC9E,UAAI,WAAW,QAAQ;AACnB,eAAO,KAAK,UAAU,GAAG,IAAI,CAAC;AAClC,aAAO;AAAA,IACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQD,OAAO,UAAU,MAAM;AACnB,aAAO,KAAK,OAAO,YAAY,GAAG,WAAW,MAAM,aAAa,MAAM,YAAY,CAAC,CAAC;AAAA,IACvF;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,OAAO,YAAY,KAAK;AACpB,UAAIhE;AACJ,UAAIyC,WAAU,IAAI,cAAc,aAAa;AAC7C,UAAI,QAAQA,YAAW,YAAY,IAAIA,QAAO,KAAK,YAAY,IAAI,GAAG;AACtE,eAASzC,MAAK,UAAU,QAAQ,UAAU,SAAS,SAAS,MAAM,cAAc,QAAQA,QAAO,SAAS,SAASA,IAAG,SAAS;AAAA,IAChI;AAAA,EACL;AAQA,aAAW,cAAc;AAQzB,aAAW,eAAe;AAK1B,aAAW,oBAAoB;AAO/B,aAAW,uBAAuB;AAQlC,aAAW,gBAAgB;AAK3B,aAAW,iBAAiB;AAS5B,aAAW,WAAW;AAOtB,aAAW,sBAAsB;AAOjC,aAAW,qBAAqB;AAOhC,aAAW,0BAA0B;AAiBrC,aAAW,cAAc;AAYzB,aAAW,eAAe;AAQ1B,aAAW,gBAAgB;AAO3B,aAAW,YAAY;AAKvB,aAAW,oBAAoB;AAK/B,aAAW,mBAAmB;AAK9B,aAAW,eAA4B,2BAAW,kBAAkB,GAAG,EAAE,SAAS,kBAAiB,CAAE;AASrG,aAAW,WAAwB,4BAAY;AAE/C,QAAM,cAAc;AACpB,QAAM,aAAa,CAAA;AAAA,EACnB,MAAM,YAAY;AAAA,IACd,YAAY,MAAM,IAAI,KAAK,OAAO;AAC9B,WAAK,OAAO;AACZ,WAAK,KAAK;AACV,WAAK,MAAM;AACX,WAAK,QAAQ;AAAA,IAChB;AAAA,IACD,OAAO,OAAO,OAAO,SAAS;AAC1B,UAAI,QAAQ;AACR,eAAO;AACX,UAAI,SAAS,CAAE,GAAE,UAAU,MAAM,SAAS,MAAM,MAAM,SAAS,CAAC,EAAE,MAAM,UAAU;AAClF,eAASlB,KAAI,KAAK,IAAI,GAAG,MAAM,SAAS,EAAE,GAAGA,KAAI,MAAM,QAAQA,MAAK;AAChE,YAAI,QAAQ,MAAMA,EAAC;AACnB,YAAI,MAAM,OAAO,WAAW,CAAC,QAAQ,aAAa,MAAM,MAAM,MAAM,EAAE;AAClE,iBAAO,KAAK,IAAI,YAAY,QAAQ,OAAO,MAAM,MAAM,CAAC,GAAG,QAAQ,OAAO,MAAM,IAAI,EAAE,GAAG,MAAM,KAAK,MAAM,KAAK,CAAC;AAAA,MACvH;AACD,aAAO;AAAA,IACV;AAAA,EACL;AACA,WAAS,eAAe,MAAM,OAAO6B,OAAM;AACvC,aAAS,UAAU,KAAK,MAAM,MAAM,KAAK,GAAG7B,KAAI,QAAQ,SAAS,GAAGA,MAAK,GAAGA,MAAK;AAC7E,UAAI,SAAS,QAAQA,EAAC,GAAG,QAAQ,OAAO,UAAU,aAAa,OAAO,IAAI,IAAI;AAC9E,UAAI;AACA,qBAAa,OAAO6B,KAAI;AAAA,IAC/B;AACD,WAAOA;AAAA,EACX;AAEA,QAAM,kBAAkB,QAAQ,MAAM,QAAQ,QAAQ,UAAU,QAAQ,QAAQ,QAAQ,UAAU;AAClG,WAAS,iBAAiBvB,OAAM,UAAU;AACtC,UAAM,QAAQA,MAAK,MAAM,QAAQ;AACjC,QAAI,SAAS,MAAM,MAAM,SAAS,CAAC;AACnC,QAAI,UAAU;AACV,eAAS;AACb,QAAI,KAAK,MAAMkF,QAAOC;AACtB,aAASzF,KAAI,GAAGA,KAAI,MAAM,SAAS,GAAG,EAAEA,IAAG;AACvC,YAAM,MAAM,MAAMA,EAAC;AACnB,UAAI,kBAAkB,KAAK,GAAG;AAC1B,QAAAyF,QAAO;AAAA,eACF,YAAY,KAAK,GAAG;AACzB,cAAM;AAAA,eACD,sBAAsB,KAAK,GAAG;AACnC,eAAO;AAAA,eACF,cAAc,KAAK,GAAG;AAC3B,QAAAD,SAAQ;AAAA,eACH,SAAS,KAAK,GAAG,GAAG;AACzB,YAAI,YAAY;AACZ,UAAAC,QAAO;AAAA;AAEP,iBAAO;AAAA,MACd;AAEG,cAAM,IAAI,MAAM,iCAAiC,GAAG;AAAA,IAC3D;AACD,QAAI;AACA,eAAS,SAAS;AACtB,QAAI;AACA,eAAS,UAAU;AACvB,QAAIA;AACA,eAAS,UAAU;AACvB,QAAID;AACA,eAAS,WAAW;AACxB,WAAO;AAAA,EACX;AACA,WAAS,UAAUlF,OAAM,OAAOkF,QAAO;AACnC,QAAI,MAAM;AACN,MAAAlF,QAAO,SAASA;AACpB,QAAI,MAAM;AACN,MAAAA,QAAO,UAAUA;AACrB,QAAI,MAAM;AACN,MAAAA,QAAO,UAAUA;AACrB,QAAIkF,WAAU,SAAS,MAAM;AACzB,MAAAlF,QAAO,WAAWA;AACtB,WAAOA;AAAA,EACX;AACA,QAAM,kBAA+B,qBAAK,QAAqB,2BAAW,iBAAiB;AAAA,IACvF,QAAQ,OAAO,MAAM;AACjB,aAAO,YAAY,UAAU,KAAK,KAAK,GAAG,OAAO,MAAM,QAAQ;AAAA,IAClE;AAAA,EACL,CAAC,CAAC;AASF,QAAM,SAAsB,sBAAM,OAAO,EAAE,SAAS,gBAAiB,CAAA;AACrE,QAAM,UAAuB,oBAAI;AAGjC,WAAS,UAAU,OAAO;AACtB,QAAI,WAAW,MAAM,MAAM,MAAM;AACjC,QAAI,MAAM,QAAQ,IAAI,QAAQ;AAC9B,QAAI,CAAC;AACD,cAAQ,IAAI,UAAU,MAAM,YAAY,SAAS,OAAO,CAACX,IAAGsB,OAAMtB,GAAE,OAAOsB,EAAC,GAAG,CAAA,CAAE,CAAC,CAAC;AACvF,WAAO;AAAA,EACX;AASA,MAAI,eAAe;AACnB,QAAM,gBAAgB;AACtB,WAAS,YAAY,UAAU,WAAW,iBAAiB;AACvD,QAAI,QAAQ,uBAAO,OAAO,IAAI;AAC9B,QAAI,WAAW,uBAAO,OAAO,IAAI;AACjC,QAAI,cAAc,CAACX,OAAM,OAAO;AAC5B,UAAI,UAAU,SAASA,KAAI;AAC3B,UAAI,WAAW;AACX,iBAASA,KAAI,IAAI;AAAA,eACZ,WAAW;AAChB,cAAM,IAAI,MAAM,iBAAiBA,QAAO,iEAAiE;AAAA,IACrH;AACI,QAAI,MAAM,CAAC,OAAO,KAAKoF,UAAS,mBAAmB;AAC/C,UAAIxE,KAAI+D;AACR,UAAI,WAAW,MAAM,KAAK,MAAM,MAAM,KAAK,IAAI,uBAAO,OAAO,IAAI;AACjE,UAAI,QAAQ,IAAI,MAAM,QAAQ,EAAE,IAAI,OAAK,iBAAiB,GAAG,QAAQ,CAAC;AACtE,eAASjF,KAAI,GAAGA,KAAI,MAAM,QAAQA,MAAK;AACnC,YAAI,SAAS,MAAM,MAAM,GAAGA,EAAC,EAAE,KAAK,GAAG;AACvC,oBAAY,QAAQ,IAAI;AACxB,YAAI,CAAC,SAAS,MAAM;AAChB,mBAAS,MAAM,IAAI;AAAA,YACf,gBAAgB;AAAA,YAChB,KAAK,CAAC,CAAC,SAAS;AACR,kBAAI,SAAS,eAAe,EAAE,MAAM,QAAQ,MAAK;AACjD,yBAAW,MAAM;AAAE,oBAAI,gBAAgB;AACnC,iCAAe;AAAA,iBAAS,aAAa;AACzC,qBAAO;AAAA,YACnC,CAAyB;AAAA,UACzB;AAAA,MACS;AACD,UAAI,OAAO,MAAM,KAAK,GAAG;AACzB,kBAAY,MAAM,KAAK;AACvB,UAAI,UAAU,SAAS,IAAI,MAAM,SAAS,IAAI,IAAI,EAAE,gBAAgB,OAAO,OAAOiF,OAAM/D,MAAK,SAAS,UAAU,QAAQA,QAAO,SAAS,SAASA,IAAG,SAAS,QAAQ+D,QAAO,SAAS,SAASA,IAAG,MAAO,MAAK,CAAE,EAAA;AAC/M,UAAIS;AACA,gBAAQ,IAAI,KAAKA,QAAO;AAC5B,UAAI;AACA,gBAAQ,iBAAiB;AAAA,IACrC;AACI,aAASzE,MAAK,UAAU;AACpB,UAAI,SAASA,GAAE,QAAQA,GAAE,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ;AACrD,UAAIA,GAAE;AACF,iBAAS,SAAS,QAAQ;AACtB,cAAI,WAAW,MAAM,KAAK,MAAM,MAAM,KAAK,IAAI,uBAAO,OAAO,IAAI;AACjE,cAAI,CAAC,SAAS;AACV,qBAAS,OAAO,EAAE,gBAAgB,OAAO,KAAK,CAAA;AAClD,mBAAS,OAAO;AACZ,qBAAS,GAAG,EAAE,IAAI,KAAKA,GAAE,GAAG;AAAA,QACnC;AACL,UAAIX,QAAOW,GAAE,QAAQ,KAAKA,GAAE;AAC5B,UAAI,CAACX;AACD;AACJ,eAAS,SAAS,QAAQ;AACtB,YAAI,OAAOA,OAAMW,GAAE,KAAKA,GAAE,cAAc;AACxC,YAAIA,GAAE;AACF,cAAI,OAAO,WAAWX,OAAMW,GAAE,OAAOA,GAAE,cAAc;AAAA,MAC5D;AAAA,IACJ;AACD,WAAO;AAAA,EACX;AACA,WAAS,YAAY,KAAK,OAAO,MAAM,OAAO;AAC1C,QAAIX,QAAO,QAAQ,KAAK;AACxB,QAAI,WAAW,YAAYA,OAAM,CAAC,GAAG,SAAS,cAAc,QAAQ,KAAKA,MAAK,UAAUA,SAAQ;AAChG,QAAI,SAAS,IAAI,cAAc;AAC/B,QAAI,gBAAgB,aAAa,QAAQ,QAAQ,aAAa,SAAS,OAAO;AAC1E,eAAS,aAAa,SAAS;AAC/B,UAAI,cAAc,cAAc,QAAQ,MAAM,OAAO,IAAI;AACrD,uBAAe;AAAA,IACtB;AACD,QAAI,MAAM,oBAAI;AACd,QAAI,SAAS,CAAC,YAAY;AACtB,UAAI,SAAS;AACT,iBAASqF,QAAO,QAAQ;AACpB,cAAI,CAAC,IAAI,IAAIA,IAAG,GAAG;AACf,gBAAI,IAAIA,IAAG;AACX,gBAAIA,KAAI,MAAM,KAAK;AACf,qBAAO;AAAA,UACd;AACL,YAAI,QAAQ;AACR,wBAAc;AAAA,MACrB;AACD,aAAO;AAAA,IACf;AACI,QAAI,WAAW,IAAI,KAAK,GAAG,UAAU;AACrC,QAAI,UAAU;AACV,UAAI,OAAO,SAAS,SAAS,UAAUrF,OAAM,OAAO,CAAC,MAAM,CAAC,CAAC;AACzD,eAAO;AACX,UAAI,WAAW,MAAM,UAAU,MAAM,WAAW,MAAM;AAAA,MAElD,EAAE,QAAQ,WAAW,MAAM,WAAW,MAAM,YAC3C,WAAW,KAAK,MAAM,OAAO,MAAM,YAAYA,OAAM;AACtD,YAAI,OAAO,SAAS,SAAS,UAAU,UAAU,OAAO,IAAI,CAAC,CAAC;AAC1D,iBAAO;AAAA,iBACF,MAAM,aAAa,YAAY,MAAM,MAAM,OAAO,MAAMA,SAAQ,aAAa,YAClF,OAAO,SAAS,SAAS,UAAU,WAAW,OAAO,KAAK,CAAC,CAAC;AAC5D,iBAAO;AAAA,MACd,WACQ,UAAU,MAAM,UAAU;AAC/B,YAAI,OAAO,SAAS,SAAS,UAAUA,OAAM,OAAO,IAAI,CAAC,CAAC;AACtD,iBAAO;AAAA,MACd;AACD,UAAI,OAAO,SAAS,IAAI;AACpB,eAAO;AAAA,IACd;AACD,WAAO;AAAA,EACX;AAAA,EAMA,MAAM,gBAAgB;AAAA;AAAA;AAAA;AAAA;AAAA,IAKlB,YAAY,WAAW,MAAMiC,MAAK,OAAO,QAAQ;AAC7C,WAAK,YAAY;AACjB,WAAK,OAAO;AACZ,WAAK,MAAMA;AACX,WAAK,QAAQ;AACb,WAAK,SAAS;AAAA,IACjB;AAAA,IACD,OAAO;AACH,UAAI,MAAM,SAAS,cAAc,KAAK;AACtC,UAAI,YAAY,KAAK;AACrB,WAAK,OAAO,GAAG;AACf,aAAO;AAAA,IACV;AAAA,IACD,OAAO,KAAK,MAAM;AACd,UAAI,KAAK,aAAa,KAAK;AACvB,eAAO;AACX,WAAK,OAAO,GAAG;AACf,aAAO;AAAA,IACV;AAAA,IACD,OAAO,KAAK;AACR,UAAI,MAAM,OAAO,KAAK,OAAO;AAC7B,UAAI,MAAM,MAAM,KAAK,MAAM;AAC3B,UAAI,KAAK,SAAS;AACd,YAAI,MAAM,QAAQ,KAAK,QAAQ;AACnC,UAAI,MAAM,SAAS,KAAK,SAAS;AAAA,IACpC;AAAA,IACD,GAAGnB,IAAG;AACF,aAAO,KAAK,QAAQA,GAAE,QAAQ,KAAK,OAAOA,GAAE,OAAO,KAAK,SAASA,GAAE,SAAS,KAAK,UAAUA,GAAE,UACzF,KAAK,aAAaA,GAAE;AAAA,IAC3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQD,OAAO,SAAS,MAAM,WAAW,OAAO;AACpC,UAAI,MAAM,OAAO;AACb,YAAI,MAAM,KAAK,YAAY,MAAM,MAAM,MAAM,SAAS,CAAC;AACvD,YAAI,CAAC;AACD,iBAAO;AACX,YAAIS,QAAO,QAAQ,IAAI;AACvB,eAAO,CAAC,IAAI,gBAAgB,WAAW,IAAI,OAAOA,MAAK,MAAM,IAAI,MAAMA,MAAK,KAAK,MAAM,IAAI,SAAS,IAAI,GAAG,CAAC;AAAA,MAC/G,OACI;AACD,eAAO,mBAAmB,MAAM,WAAW,KAAK;AAAA,MACnD;AAAA,IACJ;AAAA,EACL;AACA,WAAS,QAAQ,MAAM;AACnB,QAAI,OAAO,KAAK,UAAU,sBAAqB;AAC/C,QAAI,OAAO,KAAK,iBAAiB,UAAU,MAAM,KAAK,OAAO,KAAK,QAAQ,KAAK,UAAU;AACzF,WAAO,EAAE,MAAM,OAAO,KAAK,UAAU,YAAY,KAAK,KAAK,MAAM,KAAK,UAAU,UAAS;AAAA,EAC7F;AACA,WAAS,YAAY,MAAM,KAAKmD,SAAQ;AACpC,QAAI,QAAQ,gBAAgB,OAAO,GAAG;AACtC,WAAO;AAAA,MAAE,MAAM,KAAK,IAAIA,QAAO,MAAM,KAAK,mBAAmB,OAAO,OAAO,IAAI,EAAE,IAAI;AAAA,MACjF,IAAI,KAAK,IAAIA,QAAO,IAAI,KAAK,mBAAmB,OAAO,MAAM,IAAI,EAAE,IAAI;AAAA,MACvE,MAAM,UAAU;AAAA;EACxB;AACA,WAAS,mBAAmB,MAAM,WAAW,OAAO;AAChD,QAAI,MAAM,MAAM,KAAK,SAAS,QAAQ,MAAM,QAAQ,KAAK,SAAS;AAC9D,aAAO;AACX,QAAI,OAAO,KAAK,IAAI,MAAM,MAAM,KAAK,SAAS,IAAI,GAAG,KAAK,KAAK,IAAI,MAAM,IAAI,KAAK,SAAS,EAAE;AAC7F,QAAI,MAAM,KAAK,iBAAiB,UAAU;AAC1C,QAAIrB,WAAU,KAAK,YAAY,cAAcA,SAAQ,sBAAqB,GAAI9B,QAAO,QAAQ,IAAI;AACjG,QAAI,UAAU8B,SAAQ,cAAc,UAAU,GAAG,YAAY,WAAW,OAAO,iBAAiB,OAAO;AACvG,QAAI,WAAW,YAAY,QACtB,YAAY,SAAS,UAAU,WAAW,IAAI,KAAK,IAAI,GAAG,SAAS,UAAU,UAAU,CAAC,IAAI;AACjG,QAAI,YAAY,YAAY,SAAS,YAAY,SAAS,UAAU,YAAY,IAAI;AACpF,QAAI,aAAa,QAAQ,MAAM,IAAI,GAAG,WAAW,QAAQ,MAAM,EAAE;AACjE,QAAI,cAAc,WAAW,QAAQ,UAAU,OAAO,aAAa;AACnE,QAAI,YAAY,SAAS,QAAQ,UAAU,OAAO,WAAW;AAC7D,QAAI,gBAAgB,KAAK,gBAAgB,WAAW;AAChD,oBAAc,YAAY,MAAM,MAAM,WAAW;AACrD,QAAI,cAAc,KAAK,gBAAgB,SAAS;AAC5C,kBAAY,YAAY,MAAM,IAAI,SAAS;AAC/C,QAAI,eAAe,aAAa,YAAY,QAAQ,UAAU,MAAM;AAChE,aAAO,OAAO,YAAY,MAAM,MAAM,MAAM,IAAI,WAAW,CAAC;AAAA,IAC/D,OACI;AACD,UAAIpB,OAAM,cAAc,YAAY,MAAM,MAAM,MAAM,WAAW,IAAI,cAAc,YAAY,KAAK;AACpG,UAAI,SAAS,YAAY,YAAY,MAAM,MAAM,IAAI,SAAS,IAAI,cAAc,UAAU,IAAI;AAC9F,UAAI,UAAU,CAAA;AACd,WAAK,eAAe,YAAY,MAAM,aAAa,UAAU,QAAQ,eAAe,YAAY,IAAI,MAChG,WAAW,mBAAmB,KAAKA,KAAI,SAAS,KAAK,oBAAoB,IAAI,OAAO;AACpF,gBAAQ,KAAK,MAAM,UAAUA,KAAI,QAAQ,WAAW,OAAO,GAAG,CAAC;AAAA,eAC1DA,KAAI,SAAS,OAAO,OAAO,KAAK,iBAAiBA,KAAI,SAAS,OAAO,OAAO,CAAC,EAAE,QAAQ,UAAU;AACtG,QAAAA,KAAI,SAAS,OAAO,OAAOA,KAAI,SAAS,OAAO,OAAO;AAC1D,aAAO,OAAOA,IAAG,EAAE,OAAO,OAAO,EAAE,OAAO,OAAO,MAAM,CAAC;AAAA,IAC3D;AACD,aAAS,MAAM,MAAMA,MAAK,OAAO,QAAQ;AACrC,aAAO,IAAI;AAAA,QAAgB;AAAA,QAAW,OAAOV,MAAK;AAAA,QAAMU,OAAMV,MAAK,MAAM;AAAA,QAAoB,QAAQ;AAAA,QAAM,SAASU,OAAM;AAAA;AAAA;IAC7H;AACD,aAAS,OAAO,EAAE,KAAAA,MAAK,QAAQ,WAAU,GAAI;AACzC,UAAIqD,UAAS,CAAA;AACb,eAAS5F,KAAI,GAAGA,KAAI,WAAW,QAAQA,MAAK;AACxC,QAAA4F,QAAO,KAAK,MAAM,WAAW5F,EAAC,GAAGuC,MAAK,WAAWvC,KAAI,CAAC,GAAG,MAAM,CAAC;AACpE,aAAO4F;AAAA,IACV;AAED,aAAS,YAAY5D,OAAMC,KAAI,MAAM;AACjC,UAAIM,OAAM,KAAK,SAAS,MAAM,aAAa;AAC3C,eAAS,QAAQP,OAAM,UAAUC,KAAI,QAAQ,KAAK;AAK9C,YAAI,aAAa,KAAK,YAAYD,OAAOA,SAAQ,KAAK,KAAK,KAAK;AAChE,YAAI,WAAW,KAAK,YAAYC,KAAKA,OAAM,KAAK,OAAO,IAAI;AAC3D,YAAI,CAAC,cAAc,CAAC;AAChB;AACJ,QAAAM,OAAM,KAAK,IAAI,WAAW,KAAK,SAAS,KAAKA,IAAG;AAChD,iBAAS,KAAK,IAAI,WAAW,QAAQ,SAAS,QAAQ,MAAM;AAC5D,YAAI,OAAO,UAAU;AACjB,qBAAW,KAAK,OAAO,WAAW,WAAW,WAAW,MAAM,OAAO,SAAS,YAAY,SAAS,KAAK;AAAA;AAExG,qBAAW,KAAK,CAAC,OAAO,SAAS,WAAW,SAAS,MAAM,CAAC,OAAO,WAAW,YAAY,WAAW,KAAK;AAAA,MACjH;AACD,UAAI,QAAQP,UAAS,QAAQA,UAAS,SAASA,QAAO,KAAK,MAAM,MAAMC,QAAO,QAAQA,QAAO,SAASA,MAAK,KAAK;AAEhH,eAASd,MAAK,KAAK;AACf,YAAIA,GAAE,KAAK,SAASA,GAAE,OAAO,KAAK;AAC9B,mBAAS,MAAM,KAAK,IAAIA,GAAE,MAAM,KAAK,GAAG,SAAS,KAAK,IAAIA,GAAE,IAAI,GAAG,OAAK;AACpE,gBAAI,UAAU,KAAK,MAAM,IAAI,OAAO,GAAG;AACvC,qBAAS,QAAQ,KAAK,UAAU,OAAO,GAAG;AACtC,kBAAI,WAAW,KAAK,OAAO,QAAQ,MAAM,SAAS,KAAK,KAAK,QAAQ;AACpE,kBAAI,YAAY;AACZ;AACJ,kBAAI,SAAS;AACT,wBAAQ,KAAK,IAAI,UAAU,GAAG,GAAGa,SAAQ,QAAQ,YAAY,OAAO,KAAK,IAAI,QAAQ,MAAM,GAAGC,OAAM,QAAQ,UAAU,KAAK,KAAK,GAAG;AAAA,YAC1I;AACD,kBAAM,QAAQ,KAAK;AACnB,gBAAI,OAAO;AACP;AAAA,UACP;AAAA,QACJ;AACL,UAAI,WAAW,UAAU;AACrB,gBAAQ,OAAOD,SAAQ,MAAM,KAAKC,OAAM,MAAM,KAAK,aAAa;AACpE,aAAO,EAAE,KAAAM,MAAK,QAAQ;IACzB;AACD,aAAS,cAAc,OAAOA,MAAK;AAC/B,UAAI8B,KAAI,YAAY,OAAO9B,OAAM,MAAM,MAAM,MAAM;AACnD,aAAO,EAAE,KAAK8B,IAAG,QAAQA,IAAG,YAAY,CAAA;IAC3C;AAAA,EACL;AACA,WAAS,WAAW1E,IAAGsB,IAAG;AACtB,WAAOtB,GAAE,eAAesB,GAAE,eAAetB,GAAE,GAAGsB,EAAC;AAAA,EACnD;AAAA,EACA,MAAM,UAAU;AAAA,IACZ,YAAY,MAAMgD,QAAO;AACrB,WAAK,OAAO;AACZ,WAAK,QAAQA;AACb,WAAK,QAAQ;AACb,WAAK,aAAa,EAAE,MAAM,KAAK,QAAQ,KAAK,IAAI,GAAG,OAAO,KAAK,KAAK,KAAK,IAAI,EAAC;AAC9E,WAAK,MAAM,KAAK,UAAU,YAAY,SAAS,cAAc,KAAK,CAAC;AACnE,WAAK,IAAI,UAAU,IAAI,UAAU;AACjC,UAAIA,OAAM;AACN,aAAK,IAAI,UAAU,IAAI,gBAAgB;AAC3C,UAAIA,OAAM;AACN,aAAK,IAAI,UAAU,IAAIA,OAAM,KAAK;AACtC,WAAK,IAAI,aAAa,eAAe,MAAM;AAC3C,WAAK,SAAS,KAAK,KAAK;AACxB,WAAK,eAAe,KAAK,UAAU;AACnC,UAAIA,OAAM;AACN,QAAAA,OAAM,MAAM,KAAK,KAAK,IAAI;AAAA,IACjC;AAAA,IACD,OAAO,QAAQ;AACX,UAAI,OAAO,WAAW,MAAM,UAAU,KAAK,OAAO,MAAM,MAAM,UAAU;AACpE,aAAK,SAAS,OAAO,KAAK;AAC9B,UAAI,KAAK,MAAM,OAAO,QAAQ,KAAK,GAAG,KAAK,OAAO;AAC9C,eAAO,KAAK,eAAe,KAAK,UAAU;AAAA,IACjD;AAAA,IACD,SAAS,OAAO;AACZ,UAAI,MAAM,GAAG,QAAQ,MAAM,MAAM,UAAU;AAC3C,aAAO,MAAM,MAAM,UAAU,MAAM,GAAG,KAAK,KAAK;AAC5C;AACJ,WAAK,IAAI,MAAM,SAAS,QAAQ,KAAK,MAAM,QAAQ,MAAM,MAAM,GAAG;AAAA,IACrE;AAAA,IACD,UAAU;AACN,aAAO,KAAK,MAAM,QAAQ,KAAK,IAAI;AAAA,IACtC;AAAA,IACD,KAAK,SAAS;AACV,UAAI,QAAQ,UAAU,KAAK,MAAM,UAAU,QAAQ,KAAK,CAAC7C,IAAGpB,OAAM,CAAC,WAAWoB,IAAG,KAAK,MAAMpB,EAAC,CAAC,CAAC,GAAG;AAC9F,YAAI,MAAM,KAAK,IAAI,YAAY,OAAO;AACtC,iBAAS,UAAU,SAAS;AACxB,cAAI,OAAO,UAAU,OAAO,OAAO,eAAe,KAAK,MAAM,IAAI,EAAE,eAC/D,OAAO,OAAO,KAAK,KAAK,MAAM,IAAI,CAAC,GAAG;AACtC,kBAAM,IAAI;AACV;AAAA,UACH,OACI;AACD,iBAAK,IAAI,aAAa,OAAO,KAAI,GAAI,GAAG;AAAA,UAC3C;AAAA,QACJ;AACD,eAAO,KAAK;AACR,cAAI,OAAO,IAAI;AACf,cAAI,OAAM;AACV,gBAAM;AAAA,QACT;AACD,aAAK,QAAQ;AAAA,MAChB;AAAA,IACJ;AAAA,IACD,UAAU;AACN,UAAI,KAAK,MAAM;AACX,aAAK,MAAM,QAAQ,KAAK,KAAK,KAAK,IAAI;AAC1C,WAAK,IAAI;IACZ;AAAA,EACL;AACA,QAAM,aAA0B,sBAAM;AAItC,WAAS,MAAM,QAAQ;AACnB,WAAO;AAAA,MACH,WAAW,OAAO,CAAAwC,OAAK,IAAI,UAAUA,IAAG,MAAM,CAAC;AAAA,MAC/C,WAAW,GAAG,MAAM;AAAA,IAC5B;AAAA,EACA;AAEA,QAAM,iBAAiB,CAAC,QAAQ;AAChC,QAAM,kBAA+B,sBAAM,OAAO;AAAA,IAC9C,QAAQ,SAAS;AACb,aAAO,cAAc,SAAS;AAAA,QAC1B,iBAAiB;AAAA,QACjB,iBAAiB;AAAA,MAC7B,GAAW;AAAA,QACC,iBAAiB,CAAC7C,IAAGsB,OAAM,KAAK,IAAItB,IAAGsB,EAAC;AAAA,QACxC,iBAAiB,CAACtB,IAAGsB,OAAMtB,MAAKsB;AAAA,MAC5C,CAAS;AAAA,IACJ;AAAA,EACL,CAAC;AAmBD,WAAS,cAAc,SAAS,IAAI;AAChC,WAAO;AAAA,MACH,gBAAgB,GAAG,MAAM;AAAA,MACzB;AAAA,MACA;AAAA,MACA;AAAA,MACA,sBAAsB,GAAG,IAAI;AAAA,IACrC;AAAA,EACA;AACA,WAAS,cAAc,QAAQ;AAC3B,WAAO,OAAO,WAAW,MAAM,eAAe,KAAK,OAAO,MAAM,MAAM,eAAe;AAAA,EACzF;AACA,QAAM,cAA2B,sBAAM;AAAA,IACnC,OAAO;AAAA,IACP,QAAQ,MAAM;AACV,UAAI,EAAE,MAAK,IAAK,MAAM,OAAO,MAAM,MAAM,eAAe;AACxD,UAAI,UAAU,CAAA;AACd,eAASE,MAAK,MAAM,UAAU,QAAQ;AAClC,YAAI,OAAOA,MAAK,MAAM,UAAU;AAChC,YAAIA,GAAE,QAAQ,CAAC,QAAQ,iBAAiB,KAAK,iBAAiB;AAC1D,cAAI,YAAY,OAAO,gCAAgC;AACvD,cAAI,SAASA,GAAE,QAAQA,KAAI,gBAAgB,OAAOA,GAAE,MAAMA,GAAE,OAAOA,GAAE,SAAS,KAAK,CAAC;AACpF,mBAAS,SAAS,gBAAgB,SAAS,MAAM,WAAW,MAAM;AAC9D,oBAAQ,KAAK,KAAK;AAAA,QACzB;AAAA,MACJ;AACD,aAAO;AAAA,IACV;AAAA,IACD,OAAO,QAAQ,KAAK;AAChB,UAAI,OAAO,aAAa,KAAK,QAAM,GAAG,SAAS;AAC3C,YAAI,MAAM,gBAAgB,IAAI,MAAM,iBAAiB,aAAa,cAAc;AACpF,UAAI,aAAa,cAAc,MAAM;AACrC,UAAI;AACA,qBAAa,OAAO,OAAO,GAAG;AAClC,aAAO,OAAO,cAAc,OAAO,gBAAgB;AAAA,IACtD;AAAA,IACD,MAAM,KAAK,MAAM;AACb,mBAAa,KAAK,OAAO,GAAG;AAAA,IAC/B;AAAA,IACD,OAAO;AAAA,EACX,CAAC;AACD,WAAS,aAAa,OAAO,KAAK;AAC9B,QAAI,MAAM,oBAAoB,MAAM,MAAM,eAAe,EAAE,kBAAkB;AAAA,EACjF;AACA,QAAM,iBAA8B,sBAAM;AAAA,IACtC,OAAO;AAAA,IACP,QAAQ,MAAM;AACV,aAAO,KAAK,MAAM,UAAU,OAAO,IAAI,CAAAA,OAAKA,GAAE,QAAQ,CAAA,IAAK,gBAAgB,SAAS,MAAM,0BAA0BA,EAAC,CAAC,EACjH,OAAO,CAACxB,IAAGsB,OAAMtB,GAAE,OAAOsB,EAAC,CAAC;AAAA,IACpC;AAAA,IACD,OAAO,QAAQ,KAAK;AAChB,aAAO,OAAO,cAAc,OAAO,gBAAgB,OAAO,mBAAmB,cAAc,MAAM;AAAA,IACpG;AAAA,IACD,OAAO;AAAA,EACX,CAAC;AACD,QAAM,YAAY;AAAA,IACd,YAAY;AAAA,MACR,iBAAiB,EAAE,iBAAiB,yBAA0B;AAAA,MAC9D,gBAAgB,EAAE,iBAAiB,yBAA0B;AAAA,IAChE;AAAA,EACL;AACA,MAAI;AACA,cAAU,UAAU,EAAE,aAAa;AACvC,QAAM,sBAAmC,qBAAK,QAAqB,2BAAW,MAAM,SAAS,CAAC;AA8F9F,WAAS,YAAYwC,MAAK,IAAI,MAAM,IAAIvB,IAAG;AACvC,OAAG,YAAY;AACf,aAAS,SAASuB,KAAI,UAAU,MAAM,EAAE,GAAG,MAAM,MAAMR,IAAG,CAAC,OAAO,OAAO,MAAM,OAAO,OAAO,MAAM,QAAQ;AACvG,UAAI,CAAC,OAAO;AACR,eAAOA,KAAI,GAAG,KAAK,OAAO,KAAK;AAC3B,UAAAf,GAAE,MAAMe,GAAE,OAAOA,EAAC;AAAA,IAC7B;AAAA,EACL;AACA,WAAS,YAAY,MAAM,WAAW;AAClC,QAAI,UAAU,KAAK;AACnB,QAAI,QAAQ,UAAU,KAAK,QAAQ,CAAC,EAAE,QAAQ,KAAK,SAAS,QACxD,QAAQ,CAAC,EAAE,MAAM,KAAK,SAAS;AAC/B,aAAO;AACX,QAAI,SAAS,CAAA;AACb,aAAS,EAAE,MAAM,GAAE,KAAM,SAAS;AAC9B,aAAO,KAAK,IAAI,KAAK,MAAM,IAAI,OAAO,IAAI,EAAE,MAAM,OAAO,SAAS;AAClE,WAAK,KAAK,IAAI,KAAK,MAAM,IAAI,OAAO,EAAE,EAAE,IAAI,KAAK,SAAS;AAC1D,UAAI,OAAO,UAAU,OAAO,OAAO,SAAS,CAAC,EAAE,MAAM;AACjD,eAAO,OAAO,SAAS,CAAC,EAAE,KAAK;AAAA;AAE/B,eAAO,KAAK,EAAE,MAAM,GAAI,CAAA;AAAA,IAC/B;AACD,WAAO;AAAA,EACX;AAAA,EAOA,MAAM,eAAe;AAAA;AAAA;AAAA;AAAA,IAIjB,YAAY,QAAQ;AAChB,YAAM,EAAE,QAAQ,YAAY,UAAU,UAAU,YAAY,IAAM,IAAG;AACrE,UAAI,CAAC,OAAO;AACR,cAAM,IAAI,WAAW,6EAA6E;AACtG,WAAK,SAAS;AACd,UAAI,UAAU;AACV,aAAK,WAAW,CAAC,OAAO,MAAM,MAAM,QAAQ,SAAS,KAAK,MAAM,OAAO,MAAM,CAAC,EAAE,QAAQ,OAAO,IAAI;AAAA,MACtG,WACQ,OAAO,cAAc,YAAY;AACtC,aAAK,WAAW,CAAC,OAAO,MAAM,MAAM,QAAQ;AACxC,cAAI,OAAO,WAAW,OAAO,MAAM,IAAI;AACvC,cAAI;AACA,gBAAI,MAAM,OAAO,MAAM,CAAC,EAAE,QAAQ,IAAI;AAAA,QAC1D;AAAA,MACS,WACQ,YAAY;AACjB,aAAK,WAAW,CAAC,OAAO,OAAO,MAAM,QAAQ,IAAI,MAAM,OAAO,MAAM,CAAC,EAAE,QAAQ,UAAU;AAAA,MAC5F,OACI;AACD,cAAM,IAAI,WAAW,wEAAwE;AAAA,MAChG;AACD,WAAK,WAAW;AAChB,WAAK,YAAY;AAAA,IACpB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMD,WAAW,MAAM;AACb,UAAI,QAAQ,IAAI,mBAAmB,MAAM,MAAM,IAAI,KAAK,KAAK;AAC7D,eAAS,EAAE,MAAM,GAAE,KAAM,YAAY,MAAM,KAAK,SAAS;AACrD,oBAAY,KAAK,MAAM,KAAK,KAAK,QAAQ,MAAM,IAAI,CAACjB,OAAMiB,OAAM,KAAK,SAASA,IAAG,MAAMjB,OAAM,GAAG,CAAC;AACrG,aAAO,MAAM;IAChB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMD,WAAW,QAAQ,MAAM;AACrB,UAAI,aAAa,KAAK,WAAW;AACjC,UAAI,OAAO;AACP,eAAO,QAAQ,YAAY,CAAC6D,KAAI,IAAI,MAAM,OAAO;AAC7C,cAAI,KAAK,OAAO,KAAK,SAAS,QAAQ,OAAO,OAAO,KAAK,SAAS,IAAI;AAClE,yBAAa,KAAK,IAAI,MAAM,UAAU;AACtC,uBAAW,KAAK,IAAI,IAAI,QAAQ;AAAA,UACnC;AAAA,QACjB,CAAa;AACL,UAAI,OAAO,mBAAmB,WAAW,aAAa;AAClD,eAAO,KAAK,WAAW,OAAO,IAAI;AACtC,UAAI,WAAW;AACX,eAAO,KAAK,YAAY,OAAO,MAAM,KAAK,IAAI,OAAO,OAAO,GAAG,YAAY,QAAQ;AACvF,aAAO;AAAA,IACV;AAAA,IACD,YAAY,MAAM,MAAM,YAAY,UAAU;AAC1C,eAAS1E,MAAK,KAAK,eAAe;AAC9B,YAAI,OAAO,KAAK,IAAIA,GAAE,MAAM,UAAU,GAAG,KAAK,KAAK,IAAIA,GAAE,IAAI,QAAQ;AACrE,YAAI,KAAK,MAAM;AACX,cAAI,WAAW,KAAK,MAAM,IAAI,OAAO,IAAI,GAAG,SAAS,SAAS,KAAK,KAAK,KAAK,MAAM,IAAI,OAAO,EAAE,IAAI;AACpG,cAAI,QAAQ,KAAK,IAAIA,GAAE,MAAM,SAAS,IAAI,GAAG,MAAM,KAAK,IAAIA,GAAE,IAAI,OAAO,EAAE;AAC3E,cAAI,KAAK,UAAU;AACf,mBAAO,OAAO,SAAS,MAAM;AACzB,kBAAI,KAAK,SAAS,KAAK,SAAS,KAAK,OAAO,IAAI,SAAS,IAAI,CAAC,GAAG;AAC7D,wBAAQ;AACR;AAAA,cACH;AACL,mBAAO,KAAK,OAAO,IAAI;AACnB,kBAAI,KAAK,SAAS,KAAK,OAAO,KAAK,KAAK,OAAO,IAAI,CAAC,GAAG;AACnD,sBAAM;AACN;AAAA,cACH;AAAA,UACR;AACD,cAAI,SAAS,CAAE,GAAE8B;AACjB,cAAI,MAAM,CAACjB,OAAMC,KAAI6D,UAAS,OAAO,KAAKA,MAAK,MAAM9D,OAAMC,GAAE,CAAC;AAC9D,cAAI,YAAY,QAAQ;AACpB,iBAAK,OAAO,YAAY,QAAQ,SAAS;AACzC,oBAAQgB,KAAI,KAAK,OAAO,KAAK,SAAS,IAAI,MAAMA,GAAE,QAAQ,MAAM,SAAS;AACrE,mBAAK,SAASA,IAAG,MAAMA,GAAE,QAAQ,SAAS,MAAM,GAAG;AAAA,UAC1D,OACI;AACD,wBAAY,KAAK,MAAM,KAAK,KAAK,QAAQ,OAAO,KAAK,CAACjB,OAAMiB,OAAM,KAAK,SAASA,IAAG,MAAMjB,OAAM,GAAG,CAAC;AAAA,UACtG;AACD,iBAAO,KAAK,OAAO,EAAE,YAAY,OAAO,UAAU,KAAK,QAAQ,CAACA,OAAMC,QAAOD,QAAO,SAASC,MAAK,KAAK,KAAK,OAAM,CAAE;AAAA,QACvH;AAAA,MACJ;AACD,aAAO;AAAA,IACV;AAAA,EACL;AAEA,QAAM,uBAAuB,IAAI,WAAW,OAAO,OAAO;AAC1D,QAAM,WAAwB,oBAAI,OAAO,iDAAwI,oBAAoB;AACrM,QAAM,QAAQ;AAAA,IACV,GAAG;AAAA,IACH,GAAG;AAAA,IACH,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,MAAM;AAAA,IACN,MAAM;AAAA,IACN,MAAM;AAAA,IACN,MAAM;AAAA,IACN,MAAM;AAAA,IACN,MAAM;AAAA,IACN,MAAM;AAAA,IACN,MAAM;AAAA,IACN,MAAM;AAAA,IACN,MAAM;AAAA,IACN,MAAM;AAAA,IACN,MAAM;AAAA,IACN,OAAO;AAAA,IACP,OAAO;AAAA,EACX;AACA,MAAI,mBAAmB;AACvB,WAAS,kBAAkB;AACvB,QAAIf;AACJ,QAAI,oBAAoB,QAAQ,OAAO,YAAY,eAAe,SAAS,MAAM;AAC7E,UAAI6E,UAAS,SAAS,KAAK;AAC3B,2BAAqB7E,MAAK6E,QAAO,aAAa,QAAQ7E,QAAO,SAASA,MAAK6E,QAAO,eAAe;AAAA,IACpG;AACD,WAAO,oBAAoB;AAAA,EAC/B;AACA,QAAM,oBAAiC,sBAAM,OAAO;AAAA,IAChD,QAAQ,SAAS;AACb,UAAI,SAAS,cAAc,SAAS;AAAA,QAChC,QAAQ;AAAA,QACR,cAAc;AAAA,QACd,iBAAiB;AAAA,MAC7B,CAAS;AACD,UAAI,OAAO,cAAc,CAAC,gBAAiB;AACvC,eAAO,eAAe,IAAI,OAAO,OAAQ,OAAO,aAAa,QAAQ,oBAAoB;AAC7F,UAAI,OAAO;AACP,eAAO,eAAe,IAAI,OAAO,OAAO,aAAa,SAAS,MAAM,OAAO,gBAAgB,QAAQ,oBAAoB;AAC3H,aAAO;AAAA,IACV;AAAA,EACL,CAAC;AAKD,WAAS,sBAIT,SAAS,IAAI;AACT,WAAO,CAAC,kBAAkB,GAAG,MAAM,GAAG,kBAAmB,CAAA;AAAA,EAC7D;AACA,MAAI,UAAU;AACd,WAAS,oBAAoB;AACzB,WAAO,YAAY,UAAU,WAAW,UAAU,MAAM;AAAA,MACpD,YAAY,MAAM;AACd,aAAK,OAAO;AACZ,aAAK,cAAc,WAAW;AAC9B,aAAK,kBAAkB,uBAAO,OAAO,IAAI;AACzC,aAAK,YAAY,KAAK,cAAc,KAAK,MAAM,MAAM,iBAAiB,CAAC;AACvE,aAAK,cAAc,KAAK,UAAU,WAAW,IAAI;AAAA,MACpD;AAAA,MACD,cAAc,MAAM;AAChB,eAAO,IAAI,eAAe;AAAA,UACtB,QAAQ,KAAK;AAAA,UACb,YAAY,CAAC9C,IAAG,MAAM,QAAQ;AAC1B,gBAAI,EAAE,KAAAQ,KAAG,IAAK,KAAK;AACnB,gBAAIF,QAAO,YAAYN,GAAE,CAAC,GAAG,CAAC;AAC9B,gBAAIM,SAAQ,GAAG;AACX,kBAAI,OAAOE,KAAI,OAAO,GAAG;AACzB,kBAAI,OAAO,KAAK,MAAM,SAAS,MAAM,YAAY,KAAK,MAAM,MAAM,MAAM,KAAK,IAAI;AACjF,qBAAO,WAAW,QAAQ,EAAE,QAAQ,IAAI,WAAW,OAAQ,MAAM,QAAS,KAAK,KAAK,qBAAqB,EAAG,CAAA;AAAA,YAC/G;AACD,mBAAO,KAAK,gBAAgBF,KAAI,MAC3B,KAAK,gBAAgBA,KAAI,IAAI,WAAW,QAAQ,EAAE,QAAQ,IAAI,kBAAkB,MAAMA,KAAI,EAAC,CAAE;AAAA,UACrG;AAAA,UACD,UAAU,KAAK,cAAc,SAAY;AAAA,QACzD,CAAa;AAAA,MACJ;AAAA,MACD,OAAO,QAAQ;AACX,YAAI,OAAO,OAAO,MAAM,MAAM,iBAAiB;AAC/C,YAAI,OAAO,WAAW,MAAM,iBAAiB,KAAK,MAAM;AACpD,eAAK,YAAY,KAAK,cAAc,IAAI;AACxC,eAAK,cAAc,KAAK,UAAU,WAAW,OAAO,IAAI;AAAA,QAC3D,OACI;AACD,eAAK,cAAc,KAAK,UAAU,WAAW,QAAQ,KAAK,WAAW;AAAA,QACxE;AAAA,MACJ;AAAA,IACT,GAAO;AAAA,MACC,aAAa,CAAAf,OAAKA,GAAE;AAAA,IACvB,CAAA;AAAA,EACL;AACA,QAAM,qBAAqB;AAG3B,WAAS,cAAce,OAAM;AACzB,QAAIA,SAAQ;AACR,aAAO;AACX,QAAIA,SAAQ;AACR,aAAO;AACX,WAAO,OAAO,aAAa,OAAOA,KAAI;AAAA,EAC1C;AAAA,EACA,MAAM,0BAA0B,WAAW;AAAA,IACvC,YAAY,SAASA,OAAM;AACvB;AACA,WAAK,UAAU;AACf,WAAK,OAAOA;AAAA,IACf;AAAA,IACD,GAAG,OAAO;AAAE,aAAO,MAAM,QAAQ,KAAK;AAAA,IAAO;AAAA,IAC7C,MAAM,MAAM;AACR,UAAI,KAAK,cAAc,KAAK,IAAI;AAChC,UAAI,OAAO,KAAK,MAAM,OAAO,mBAAmB,IAAI,OAAO,MAAM,KAAK,IAAI,KAAK,OAAO,KAAK,KAAK,SAAS,EAAE;AAC3G,UAAI,SAAS,KAAK,QAAQ,UAAU,KAAK,QAAQ,OAAO,KAAK,MAAM,MAAM,EAAE;AAC3E,UAAI;AACA,eAAO;AACX,UAAI,OAAO,SAAS,cAAc,MAAM;AACxC,WAAK,cAAc;AACnB,WAAK,QAAQ;AACb,WAAK,aAAa,cAAc,IAAI;AACpC,WAAK,YAAY;AACjB,aAAO;AAAA,IACV;AAAA,IACD,cAAc;AAAE,aAAO;AAAA,IAAQ;AAAA,EACnC;AAAA,EACA,MAAM,kBAAkB,WAAW;AAAA,IAC/B,YAAY,OAAO;AACf;AACA,WAAK,QAAQ;AAAA,IAChB;AAAA,IACD,GAAG,OAAO;AAAE,aAAO,MAAM,SAAS,KAAK;AAAA,IAAQ;AAAA,IAC/C,QAAQ;AACJ,UAAI,OAAO,SAAS,cAAc,MAAM;AACxC,WAAK,cAAc;AACnB,WAAK,YAAY;AACjB,WAAK,MAAM,QAAQ,KAAK,QAAQ;AAChC,aAAO;AAAA,IACV;AAAA,IACD,cAAc;AAAE,aAAO;AAAA,IAAQ;AAAA,EACnC;AAAA,EA69BA,MAAM,qBAAqB,WAAW;AAAA;AAAA;AAAA;AAAA,IAIlC,QAAQ,OAAO;AACX,aAAO,QAAQ,SAAS,KAAK,eAAe,MAAM,eAAe,KAAK,GAAG,KAAK;AAAA,IACjF;AAAA;AAAA;AAAA;AAAA,IAID,GAAG,OAAO;AAAE,aAAO;AAAA,IAAQ;AAAA;AAAA;AAAA;AAAA;AAAA,IAK3B,QAAQ,KAAK;AAAA,IAAG;AAAA,EACpB;AACA,eAAa,UAAU,eAAe;AACtC,eAAa,UAAU,QAAQ;AAC/B,eAAa,UAAU,UAAU,QAAQ;AACzC,eAAa,UAAU,YAAY,aAAa,UAAU,UAAU;AACpE,eAAa,UAAU,QAAQ;ACjsS/B,MAAI;AAKJ,QAAM,mBAAgC,oBAAI;AAS1C,WAAS,oBAAoB,UAAU;AACnC,WAAO,MAAM,OAAO;AAAA,MAChB,SAAS,WAAW,YAAU,OAAO,OAAO,QAAQ,IAAI;AAAA,IAChE,CAAK;AAAA,EACL;AAKA,QAAM,kBAA+B,oBAAI;EAUzC,MAAM,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQX,YAKA,MAAMjB,SAAQ,kBAAkB,CAAE,GAIlChC,QAAO,IAAI;AACP,WAAK,OAAO;AACZ,WAAK,OAAOA;AAIZ,UAAI,CAAC,YAAY,UAAU,eAAe,MAAM;AAC5C,eAAO,eAAe,YAAY,WAAW,QAAQ,EAAE,MAAM;AAAE,iBAAO,WAAW,IAAI;AAAA,QAAE,EAAI,CAAA;AAC/F,WAAK,SAASgC;AACd,WAAK,YAAY;AAAA,QACb,SAAS,GAAG,IAAI;AAAA,QAChB,YAAY,aAAa,GAAG,CAAC,OAAO,KAAK,SAAS;AAC9C,cAAIC,OAAM,UAAU,OAAO,KAAK,IAAI,GAAGb,QAAOa,KAAI,KAAK,KAAK,gBAAgB;AAC5E,cAAI,CAACb;AACD,mBAAO;AACX,cAAIG,QAAO,MAAM,MAAMH,KAAI,GAAG,MAAMa,KAAI,KAAK,KAAK,eAAe;AACjE,cAAI,KAAK;AACL,gBAAI,YAAYA,KAAI,QAAQ,MAAMA,KAAI,MAAM,IAAI;AAChD,qBAAS,WAAW;AAChB,kBAAI,QAAQ,KAAK,WAAW,KAAK,GAAG;AAChC,oBAAIb,QAAO,MAAM,MAAM,QAAQ,KAAK;AACpC,uBAAO,QAAQ,QAAQ,YAAYA,QAAOA,MAAK,OAAOG,KAAI;AAAA,cAC7D;AAAA,UACR;AACD,iBAAOA;AAAA,QACvB,CAAa;AAAA,MACb,EAAU,OAAO,eAAe;AAAA,IAC3B;AAAA;AAAA;AAAA;AAAA,IAID,WAAW,OAAO,KAAK,OAAO,IAAI;AAC9B,aAAO,UAAU,OAAO,KAAK,IAAI,EAAE,KAAK,KAAK,gBAAgB,KAAK,KAAK;AAAA,IAC1E;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMD,YAAY,OAAO;AACf,UAAI,OAAO,MAAM,MAAM,QAAQ;AAC/B,WAAK,SAAS,QAAQ,SAAS,SAAS,SAAS,KAAK,SAAS,KAAK;AAChE,eAAO,CAAC,EAAE,MAAM,GAAG,IAAI,MAAM,IAAI,OAAM,CAAE;AAC7C,UAAI,CAAC,QAAQ,CAAC,KAAK;AACf,eAAO;AACX,UAAI,SAAS,CAAA;AACb,UAAI,UAAU,CAAC,MAAM,SAAS;AAC1B,YAAI,KAAK,KAAK,gBAAgB,KAAK,KAAK,MAAM;AAC1C,iBAAO,KAAK,EAAE,MAAM,IAAI,OAAO,KAAK,OAAM,CAAE;AAC5C;AAAA,QACH;AACD,YAAI,QAAQ,KAAK,KAAK,SAAS,OAAO;AACtC,YAAI,OAAO;AACP,cAAI,MAAM,KAAK,KAAK,gBAAgB,KAAK,KAAK,MAAM;AAChD,gBAAI,MAAM;AACN,uBAASV,MAAK,MAAM;AAChB,uBAAO,KAAK,EAAE,MAAMA,GAAE,OAAO,MAAM,IAAIA,GAAE,KAAK,KAAM,CAAA;AAAA;AAExD,qBAAO,KAAK,EAAE,MAAY,IAAI,OAAO,KAAK,OAAM,CAAE;AACtD;AAAA,UACH,WACQ,MAAM,SAAS;AACpB,gBAAI,OAAO,OAAO;AAClB,oBAAQ,MAAM,MAAM,MAAM,QAAQ,CAAC,EAAE,OAAO,IAAI;AAChD,gBAAI,OAAO,SAAS;AAChB;AAAA,UACP;AAAA,QACJ;AACD,iBAASnB,KAAI,GAAGA,KAAI,KAAK,SAAS,QAAQA,MAAK;AAC3C,cAAI,KAAK,KAAK,SAASA,EAAC;AACxB,cAAI,cAAc;AACd,oBAAQ,IAAI,KAAK,UAAUA,EAAC,IAAI,IAAI;AAAA,QAC3C;AAAA,MACb;AACQ,cAAQ,WAAW,KAAK,GAAG,CAAC;AAC5B,aAAO;AAAA,IACV;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,IAAI,gBAAgB;AAAE,aAAO;AAAA,IAAO;AAAA,EACxC;AAIA,WAAS,WAAwB,4BAAY;AAC7C,WAAS,UAAU,OAAO,KAAK,MAAM;AACjC,QAAI,UAAU,MAAM,MAAM,QAAQ,GAAG,OAAO,WAAW,KAAK,EAAE;AAC9D,QAAI,CAAC,WAAW,QAAQ,eAAe;AACnC,eAAS,OAAO,MAAM,MAAM,OAAO,KAAK,MAAM,KAAK,MAAM,SAAS,cAAc;AAC5E,YAAI,KAAK,KAAK;AACV,iBAAO;AAAA,IAClB;AACD,WAAO;AAAA,EACX;AAAA,EAMA,MAAM,mBAAmB,SAAS;AAAA,IAC9B,YAAY,MAAMsC,SAAQhC,OAAM;AAC5B,YAAM,MAAMgC,SAAQ,CAAE,GAAEhC,KAAI;AAC5B,WAAK,SAASgC;AAAA,IACjB;AAAA;AAAA;AAAA;AAAA,IAID,OAAO,OAAO,MAAM;AAChB,UAAI,OAAO,oBAAoB,KAAK,YAAY;AAChD,aAAO,IAAI,WAAW,MAAM,KAAK,OAAO,UAAU;AAAA,QAC9C,OAAO,CAAC,iBAAiB,IAAI,UAAQ,KAAK,QAAQ,OAAO,MAAS,CAAC;AAAA,MAC/E,CAAS,GAAG,KAAK,IAAI;AAAA,IAChB;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,UAAU,SAAShC,OAAM;AACrB,aAAO,IAAI,WAAW,KAAK,MAAM,KAAK,OAAO,UAAU,OAAO,GAAGA,SAAQ,KAAK,IAAI;AAAA,IACrF;AAAA,IACD,IAAI,gBAAgB;AAAE,aAAO,KAAK,OAAO,YAAa;AAAA,IAAG;AAAA,EAC7D;AAOA,WAAS,WAAW,OAAO;AACvB,QAAI,QAAQ,MAAM,MAAM,SAAS,OAAO,KAAK;AAC7C,WAAO,QAAQ,MAAM,OAAO,KAAK;AAAA,EACrC;AAAA,EA0DA,MAAM,SAAS;AAAA;AAAA;AAAA;AAAA,IAIX,YAAYmD,MAAK;AACb,WAAK,MAAMA;AACX,WAAK,YAAY;AACjB,WAAK,SAAS;AACd,WAAK,SAASA,KAAI;IACrB;AAAA,IACD,IAAI,SAAS;AAAE,aAAO,KAAK,IAAI;AAAA,IAAS;AAAA,IACxC,OAAO,KAAK;AACR,WAAK,SAAS,KAAK,OAAO,KAAK,MAAM,KAAK,SAAS,EAAE;AACrD,WAAK,YAAY,MAAM,KAAK,OAAO;AACnC,aAAO,KAAK,YAAY,KAAK,OAAO;AAAA,IACvC;AAAA,IACD,MAAM,KAAK;AACP,WAAK,OAAO,GAAG;AACf,aAAO,KAAK;AAAA,IACf;AAAA,IACD,IAAI,aAAa;AAAE,aAAO;AAAA,IAAO;AAAA,IACjC,KAAK,MAAM,IAAI;AACX,UAAI,cAAc,KAAK,YAAY,KAAK,OAAO;AAC/C,UAAI,OAAO,eAAe,MAAM,KAAK;AACjC,eAAO,KAAK,IAAI,YAAY,MAAM,EAAE;AAAA;AAEpC,eAAO,KAAK,OAAO,MAAM,OAAO,aAAa,KAAK,WAAW;AAAA,IACpE;AAAA,EACL;AACA,MAAI,iBAAiB;AAAA,EAIrB,MAAM,aAAa;AAAA,IACf,YAAYnB,SAIZ,OAIA,YAAY,CAAE,GAId,MAIA,SASA,UAIA,SAMA,YAAY;AACR,WAAK,SAASA;AACd,WAAK,QAAQ;AACb,WAAK,YAAY;AACjB,WAAK,OAAO;AACZ,WAAK,UAAU;AACf,WAAK,WAAW;AAChB,WAAK,UAAU;AACf,WAAK,aAAa;AAClB,WAAK,QAAQ;AAIb,WAAK,cAAc;IACtB;AAAA;AAAA;AAAA;AAAA,IAID,OAAO,OAAOA,SAAQ,OAAO,UAAU;AACnC,aAAO,IAAI,aAAaA,SAAQ,OAAO,CAAA,GAAI,KAAK,OAAO,GAAG,UAAU,CAAE,GAAE,IAAI;AAAA,IAC/E;AAAA,IACD,aAAa;AACT,aAAO,KAAK,OAAO,WAAW,IAAI,SAAS,KAAK,MAAM,GAAG,GAAG,KAAK,SAAS;AAAA,IAC7E;AAAA;AAAA;AAAA;AAAA,IAID,KAAK,OAAO,MAAM;AACd,UAAI,QAAQ,QAAQ,QAAQ,KAAK,MAAM,IAAI;AACvC,eAAO;AACX,UAAI,KAAK,QAAQ,KAAK,SAAS,KAAK,OAAO,SAAS,QAAQ,SAAS,SAAS,OAAO,KAAK,MAAM,IAAI,MAAM,GAAG;AACzG,aAAK,SAAQ;AACb,eAAO;AAAA,MACV;AACD,aAAO,KAAK,YAAY,MAAM;AAC1B,YAAIpB;AACJ,YAAI,OAAO,SAAS,UAAU;AAC1B,cAAI,UAAU,KAAK,IAAG,IAAK;AAC3B,kBAAQ,MAAM,KAAK,IAAG,IAAK;AAAA,QAC9B;AACD,YAAI,CAAC,KAAK;AACN,eAAK,QAAQ,KAAK;AACtB,YAAI,QAAQ,SAAS,KAAK,MAAM,aAAa,QAAQ,KAAK,MAAM,YAAY,SACxE,OAAO,KAAK,MAAM,IAAI;AACtB,eAAK,MAAM,OAAO,IAAI;AAC1B,mBAAS;AACL,cAAI,OAAO,KAAK,MAAM,QAAO;AAC7B,cAAI,MAAM;AACN,iBAAK,YAAY,KAAK,mBAAmB,aAAa,QAAQ,MAAM,KAAK,WAAW,KAAK,MAAM,aAAa,IAAI,CAAC;AACjH,iBAAK,WAAWA,MAAK,KAAK,MAAM,eAAe,QAAQA,QAAO,SAASA,MAAK,KAAK,MAAM,IAAI;AAC3F,iBAAK,OAAO;AACZ,iBAAK,QAAQ;AACb,gBAAI,KAAK,WAAW,SAAS,QAAQ,SAAS,SAAS,OAAO,KAAK,MAAM,IAAI;AACzE,mBAAK,QAAQ,KAAK;;AAElB,qBAAO;AAAA,UACd;AACD,cAAI,MAAO;AACP,mBAAO;AAAA,QACd;AAAA,MACb,CAAS;AAAA,IACJ;AAAA;AAAA;AAAA;AAAA,IAID,WAAW;AACP,UAAI,KAAK;AACT,UAAI,KAAK,UAAU,MAAM,KAAK,MAAM,cAAc,KAAK,SAAS;AAC5D,YAAI,KAAK,MAAM,aAAa,QAAQ,KAAK,MAAM,YAAY;AACvD,eAAK,MAAM,OAAO,GAAG;AACzB,aAAK,YAAY,MAAM;AAAE,iBAAO,EAAE,OAAO,KAAK,MAAM,QAAO,IAAK;AAAA,UAAA;AAAA,QAAK,CAAA;AACrE,aAAK,UAAU;AACf,aAAK,OAAO;AACZ,aAAK,YAAY,KAAK,mBAAmB,aAAa,QAAQ,KAAK,MAAM,KAAK,WAAW,IAAI,CAAC;AAC9F,aAAK,QAAQ;AAAA,MAChB;AAAA,IACJ;AAAA,IACD,YAAYgB,IAAG;AACX,UAAI,OAAO;AACX,uBAAiB;AACjB,UAAI;AACA,eAAOA,GAAC;AAAA,MACX,UACO;AACJ,yBAAiB;AAAA,MACpB;AAAA,IACJ;AAAA,IACD,mBAAmB,WAAW;AAC1B,eAASf,IAAGA,KAAI,KAAK,YAAY,IAAK;AAClC,oBAAY,aAAa,WAAWA,GAAE,MAAMA,GAAE,EAAE;AACpD,aAAO;AAAA,IACV;AAAA;AAAA;AAAA;AAAA,IAID,QAAQ,SAAS,UAAU;AACvB,UAAI,EAAE,WAAW,MAAM,SAAS,UAAU,QAAS,IAAG;AACtD,WAAK,SAAQ;AACb,UAAI,CAAC,QAAQ,OAAO;AAChB,YAAI,SAAS,CAAA;AACb,gBAAQ,kBAAkB,CAAC,OAAO,KAAK,OAAO,QAAQ,OAAO,KAAK,EAAE,OAAO,KAAK,OAAO,IAAG,CAAE,CAAC;AAC7F,oBAAY,aAAa,aAAa,WAAW,MAAM;AACvD,eAAO,KAAK;AACZ,kBAAU;AACV,mBAAW,EAAE,MAAM,QAAQ,OAAO,SAAS,MAAM,EAAE,GAAG,IAAI,QAAQ,OAAO,SAAS,IAAI,CAAC;AACvF,YAAI,KAAK,QAAQ,QAAQ;AACrB,oBAAU,CAAA;AACV,mBAASA,MAAK,KAAK,SAAS;AACxB,gBAAI,OAAO,QAAQ,OAAOA,GAAE,MAAM,CAAC,GAAG,KAAK,QAAQ,OAAOA,GAAE,IAAI,EAAE;AAClE,gBAAI,OAAO;AACP,sBAAQ,KAAK,EAAE,MAAM,GAAI,CAAA;AAAA,UAChC;AAAA,QACJ;AAAA,MACJ;AACD,aAAO,IAAI,aAAa,KAAK,QAAQ,UAAU,WAAW,MAAM,SAAS,UAAU,SAAS,KAAK,UAAU;AAAA,IAC9G;AAAA;AAAA;AAAA;AAAA,IAID,eAAe,UAAU;AACrB,UAAI,KAAK,SAAS,QAAQ,SAAS,QAAQ,KAAK,SAAS,MAAM,SAAS;AACpE,eAAO;AACX,WAAK,WAAW;AAChB,UAAI,WAAW,KAAK,QAAQ;AAC5B,eAASnB,KAAI,GAAGA,KAAI,KAAK,QAAQ,QAAQA,MAAK;AAC1C,YAAI,EAAE,MAAM,GAAE,IAAK,KAAK,QAAQA,EAAC;AACjC,YAAI,OAAO,SAAS,MAAM,KAAK,SAAS,MAAM;AAC1C,eAAK,YAAY,aAAa,KAAK,WAAW,MAAM,EAAE;AACtD,eAAK,QAAQ,OAAOA,MAAK,CAAC;AAAA,QAC7B;AAAA,MACJ;AACD,UAAI,KAAK,QAAQ,UAAU;AACvB,eAAO;AACX,WAAK,MAAK;AACV,aAAO;AAAA,IACV;AAAA;AAAA;AAAA;AAAA,IAID,QAAQ;AACJ,UAAI,KAAK,OAAO;AACZ,aAAK,SAAQ;AACb,aAAK,QAAQ;AAAA,MAChB;AAAA,IACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMD,gBAAgB,MAAM,IAAI;AACtB,WAAK,QAAQ,KAAK,EAAE,MAAM,GAAI,CAAA;AAAA,IACjC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAUD,OAAO,kBAAkB,OAAO;AAC5B,aAAO,IAAI,cAAc,OAAO;AAAA,QAC5B,YAAY,OAAO,WAAW,QAAQ;AAClC,cAAI,OAAO,OAAO,CAAC,EAAE,MAAM,KAAK,OAAO,OAAO,SAAS,CAAC,EAAE;AAC1D,cAAIsC,UAAS;AAAA,YACT,WAAW;AAAA,YACX,UAAU;AACN,kBAAI,KAAK;AACT,kBAAI,IAAI;AACJ,yBAASnB,MAAK;AACV,qBAAG,YAAY,KAAKA,EAAC;AACzB,oBAAI;AACA,qBAAG,aAAa,GAAG,aAAa,QAAQ,IAAI,CAAC,GAAG,YAAY,KAAK,CAAC,IAAI;AAAA,cAC7E;AACD,mBAAK,YAAY;AACjB,qBAAO,IAAI,KAAK,SAAS,MAAM,CAAE,GAAE,IAAI,KAAK,IAAI;AAAA,YACnD;AAAA,YACD,WAAW;AAAA,YACX,SAAS;AAAA,YAAG;AAAA,UAChC;AACgB,iBAAOmB;AAAA,QACV;AAAA,MACb;AAAA,IACK;AAAA;AAAA;AAAA;AAAA,IAID,OAAO,MAAM;AACT,aAAO,KAAK,IAAI,MAAM,KAAK,MAAM,IAAI,MAAM;AAC3C,UAAI,QAAQ,KAAK;AACjB,aAAO,KAAK,WAAW,QAAQ,MAAM,UAAU,MAAM,CAAC,EAAE,QAAQ,KAAK,MAAM,CAAC,EAAE,MAAM;AAAA,IACvF;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,OAAO,MAAM;AAAE,aAAO;AAAA,IAAiB;AAAA,EAC3C;AACA,WAAS,aAAa,WAAW,MAAM,IAAI;AACvC,WAAO,aAAa,aAAa,WAAW,CAAC,EAAE,OAAO,MAAM,KAAK,IAAI,OAAO,MAAM,KAAK,GAAE,CAAE,CAAC;AAAA,EAChG;AAAA,EACA,MAAM,cAAc;AAAA,IAChB,YAGA,SAAS;AACL,WAAK,UAAU;AACf,WAAK,OAAO,QAAQ;AAAA,IACvB;AAAA,IACD,MAAM,IAAI;AACN,UAAI,CAAC,GAAG,cAAc,KAAK,QAAQ,KAAK,QAAQ;AAC5C,eAAO;AACX,UAAI,QAAQ,KAAK,QAAQ,QAAQ,GAAG,SAAS,GAAG,KAAK;AAIrD,UAAI,OAAO,KAAK,QAAQ,WAAW,GAAG,WAAW,IAAI,SAAS,SACxD,KAAK,IAAI,GAAG,QAAQ,OAAO,KAAK,QAAQ,OAAO,GAAG,MAAM,SAAS,EAAE;AACzE,UAAI,CAAC,MAAM,KAAK,IAAgB,IAAI;AAChC,cAAM,SAAQ;AAClB,aAAO,IAAI,cAAc,KAAK;AAAA,IACjC;AAAA,IACD,OAAO,KAAK,OAAO;AACf,UAAI,OAAO,KAAK,IAAI,KAAyB,MAAM,IAAI,MAAM;AAC7D,UAAI,aAAa,aAAa,OAAO,MAAM,MAAM,QAAQ,EAAE,QAAQ,OAAO,EAAE,MAAM,GAAG,IAAI,KAAM,CAAA;AAC/F,UAAI,CAAC,WAAW,KAAK,IAAgB,IAAI;AACrC,mBAAW,SAAQ;AACvB,aAAO,IAAI,cAAc,UAAU;AAAA,IACtC;AAAA,EACL;AACA,WAAS,QAAqB,2BAAW,OAAO;AAAA,IAC5C,QAAQ,cAAc;AAAA,IACtB,OAAO,OAAO,IAAI;AACd,eAASzC,MAAK,GAAG;AACb,YAAIA,GAAE,GAAG,SAAS,QAAQ;AACtB,iBAAOA,GAAE;AACjB,UAAI,GAAG,WAAW,MAAM,QAAQ,KAAK,GAAG,MAAM,MAAM,QAAQ;AACxD,eAAO,cAAc,KAAK,GAAG,KAAK;AACtC,aAAO,MAAM,MAAM,EAAE;AAAA,IACxB;AAAA,EACL,CAAC;AACD,MAAI,cAAc,CAAC,aAAa;AAC5B,QAAI,UAAU;AAAA,MAAW,MAAM,SAAU;AAAA,MAAE;AAAA;AAAA,IAAG;AAC9C,WAAO,MAAM,aAAa,OAAO;AAAA,EACrC;AACA,MAAI,OAAO,uBAAuB;AAC9B,kBAAc,CAAC,aAAa;AACxB,UAAI,OAAO,IAAI,UAAU;AAAA,QAAW,MAAM;AACtC,iBAAO,oBAAoB,UAAU;AAAA,YAAE,SAAS,MAAqB;AAAA;AAAA,UAAG,CAAiB;AAAA,QAC5F;AAAA,QAAE;AAAA;AAAA,MAAG;AACN,aAAO,MAAM,OAAO,IAAI,aAAa,OAAO,IAAI,mBAAmB,IAAI;AAAA,IAC/E;AACA,QAAM,iBAAiB,OAAO,aAAa,iBAAiB,KAAK,UAAU,gBAAgB,QAAQ,OAAO,SAAS,SAAS,GAAG,kBACzH,MAAM,UAAU,WAAW,eAAc,IAAK;AACpD,QAAM,cAA2B,2BAAW,UAAU,MAAM,YAAY;AAAA,IACpE,YAAY,MAAM;AACd,WAAK,OAAO;AACZ,WAAK,UAAU;AACf,WAAK,gBAAgB;AAErB,WAAK,WAAW;AAEhB,WAAK,cAAc;AACnB,WAAK,OAAO,KAAK,KAAK,KAAK,IAAI;AAC/B,WAAK,aAAY;AAAA,IACpB;AAAA,IACD,OAAO,QAAQ;AACX,UAAI,KAAK,KAAK,KAAK,MAAM,MAAM,SAAS,KAAK,EAAE;AAC/C,UAAI,GAAG,eAAe,OAAO,KAAK,QAAQ,KAAK,KAAK,KAAK,SAAS,KAAK,GAAG;AACtE,aAAK,aAAY;AACrB,UAAI,OAAO,YAAY;AACnB,YAAI,KAAK,KAAK;AACV,eAAK,eAAe;AACxB,aAAK,aAAY;AAAA,MACpB;AACD,WAAK,mBAAmB,EAAE;AAAA,IAC7B;AAAA,IACD,eAAe;AACX,UAAI,KAAK;AACL;AACJ,UAAI,EAAE,UAAU,KAAK,MAAM,QAAQ,MAAM,MAAM,SAAS,KAAK;AAC7D,UAAI,MAAM,QAAQ,MAAM,QAAQ,QAAQ,CAAC,MAAM,QAAQ,OAAO,MAAM,IAAI,MAAM;AAC1E,aAAK,UAAU,YAAY,KAAK,IAAI;AAAA,IAC3C;AAAA,IACD,KAAK,UAAU;AACX,WAAK,UAAU;AACf,UAAI,MAAM,KAAK;AACf,UAAI,KAAK,WAAW,QAAQ,KAAK,WAAW,KAAK,KAAK,KAAK,WAAW;AAClE,aAAK,WAAW,MAAM;AACtB,aAAK,cAAc;AAAA,MACtB;AACD,UAAI,KAAK,eAAe;AACpB;AACJ,UAAI,EAAE,OAAO,UAAU,EAAE,IAAI,KAAI,EAAI,IAAG,KAAK,MAAM,QAAQ,MAAM,MAAM,SAAS,KAAK;AACrF,UAAI,MAAM,QAAQ,MAAM,QAAQ,QAAQ,MAAM,QAAQ;AAAA,QAAO,OAAO;AAAA;AAAA,MAA2B;AAC3F;AACJ,UAAI,UAAU,KAAK,IAAK,IAAG,KAAK,IAAI,KAAK,aAAa,KAAiB,YAAY,CAAC,iBAAiB,KAAK,IAAI,IAAmB,SAAS,kBAAkB,CAAC,IAAI,GAAG;AACpK,UAAI,gBAAgB,MAAM,QAAQ,UAAU,QAAQ,MAAM,IAAI,SAAS,OAAO;AAC9E,UAAI,OAAO,MAAM,QAAQ,KAAK,MAAM;AAChC,eAAO,kBAAkB,eAAgB,KAAI,KAAK,IAAG,IAAK;AAAA,MAC7D,GAAE,QAAQ,gBAAgB,IAAI,IAA2B;AAC1D,WAAK,eAAe,KAAK,IAAG,IAAK;AACjC,UAAI,QAAQ,KAAK,eAAe,GAAG;AAC/B,cAAM,QAAQ;AACd,aAAK,KAAK,SAAS,EAAE,SAAS,SAAS,SAAS,GAAG,IAAI,cAAc,MAAM,OAAO,CAAC,EAAG,CAAA;AAAA,MACzF;AACD,UAAI,KAAK,cAAc,KAAK,EAAE,QAAQ,CAAC;AACnC,aAAK,aAAY;AACrB,WAAK,mBAAmB,MAAM,OAAO;AAAA,IACxC;AAAA,IACD,mBAAmB,IAAI;AACnB,UAAI,GAAG,YAAY;AACf,aAAK;AACL,WAAG,WACE,KAAK,MAAM,KAAK,cAAc,EAC9B,MAAM,SAAO,aAAa,KAAK,KAAK,OAAO,GAAG,CAAC,EAC/C,KAAK,MAAM,KAAK,eAAe;AACpC,WAAG,aAAa;AAAA,MACnB;AAAA,IACJ;AAAA,IACD,UAAU;AACN,UAAI,KAAK;AACL,aAAK,QAAO;AAAA,IACnB;AAAA,IACD,YAAY;AACR,aAAO,CAAC,EAAE,KAAK,WAAW,KAAK,gBAAgB;AAAA,IAClD;AAAA,EACL,GAAG;AAAA,IACC,eAAe,EAAE,QAAQ;AAAE,WAAK,aAAY;AAAA,IAAG,EAAI;AAAA,EACvD,CAAC;AAOD,QAAM,WAAwB,sBAAM,OAAO;AAAA,IACvC,QAAQ,WAAW;AAAE,aAAO,UAAU,SAAS,UAAU,CAAC,IAAI;AAAA,IAAO;AAAA,IACrE,SAAS,CAAAmG,cAAY;AAAA,MACjB,SAAS;AAAA,MACT;AAAA,MACA,WAAW,kBAAkB,QAAQ,CAACA,SAAQ,GAAG,WAAS;AACtD,YAAI,OAAO,MAAM,MAAMA,SAAQ;AAC/B,eAAO,QAAQ,KAAK,OAAO,EAAE,iBAAiB,KAAK,KAAM,IAAG;MACxE,CAAS;AAAA,IACJ;AAAA,EACL,CAAC;AAAA,EAQD,MAAM,gBAAgB;AAAA;AAAA;AAAA;AAAA,IAIlB,YAIAA,WAOA,UAAU,CAAA,GAAI;AACV,WAAK,WAAWA;AAChB,WAAK,UAAU;AACf,WAAK,YAAY,CAACA,WAAU,OAAO;AAAA,IACtC;AAAA,EACL;AA4GA,QAAM,gBAA6B,sBAAM;AAMzC,QAAM,aAA0B,sBAAM,OAAO;AAAA,IACzC,SAAS,YAAU;AACf,UAAI,CAAC,OAAO;AACR,eAAO;AACX,UAAI,OAAO,OAAO,CAAC;AACnB,UAAI,CAAC,QAAQ,KAAK,KAAK,IAAI,KAAK,MAAM,KAAK,IAAI,EAAE,KAAK,CAAAnG,OAAKA,MAAK,KAAK,CAAC,CAAC;AACnE,cAAM,IAAI,MAAM,0BAA0B,KAAK,UAAU,OAAO,CAAC,CAAC,CAAC;AACvE,aAAO;AAAA,IACV;AAAA,EACL,CAAC;AAOD,WAAS,cAAc,OAAO;AAC1B,QAAI,OAAO,MAAM,MAAM,UAAU;AACjC,WAAO,KAAK,WAAW,CAAC,KAAK,IAAI,MAAM,UAAU,KAAK,SAAS,KAAK;AAAA,EACxE;AAOA,WAAS,aAAa,OAAO,MAAM;AAC/B,QAAI,SAAS,IAAI,KAAK,MAAM,SAAS,KAAK,MAAM,MAAM,UAAU,EAAE,CAAC;AACnE,QAAI,MAAM,KAAM;AACZ,aAAO,QAAQ,IAAI;AACf,kBAAU;AACV,gBAAQ;AAAA,MACX;AACD,WAAK;AAAA,IACR;AACD,aAASG,KAAI,GAAGA,KAAI,MAAMA;AACtB,gBAAU;AACd,WAAO;AAAA,EACX;AAUA,WAAS,eAAe,SAAS,KAAK;AAClC,QAAI,mBAAmB;AACnB,gBAAU,IAAI,cAAc,OAAO;AACvC,aAAS,WAAW,QAAQ,MAAM,MAAM,aAAa,GAAG;AACpD,UAAI,SAAS,QAAQ,SAAS,GAAG;AACjC,UAAI,WAAW;AACX,eAAO;AAAA,IACd;AACD,QAAI,OAAO,WAAW,QAAQ,KAAK;AACnC,WAAO,OAAO,kBAAkB,SAAS,MAAM,GAAG,IAAI;AAAA,EAC1D;AAAA,EAgCA,MAAM,cAAc;AAAA;AAAA;AAAA;AAAA,IAIhB,YAIA,OAIA,UAAU,CAAA,GAAI;AACV,WAAK,QAAQ;AACb,WAAK,UAAU;AACf,WAAK,OAAO,cAAc,KAAK;AAAA,IAClC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IASD,OAAO,KAAK,OAAO,GAAG;AAClB,UAAI,OAAO,KAAK,MAAM,IAAI,OAAO,GAAG;AACpC,UAAI,EAAE,eAAe,wBAAwB,KAAK;AAClD,UAAI,iBAAiB,QAAQ,iBAAiB,KAAK,QAAQ,iBAAiB,KAAK,IAAI;AACjF,YAAI,uBAAuB,iBAAiB;AACxC,iBAAO,EAAE,MAAM,IAAI,MAAM,IAAG;AAAA,iBACvB,OAAO,IAAI,gBAAgB,MAAM,iBAAiB;AACvD,iBAAO,EAAE,MAAM,KAAK,KAAK,MAAM,gBAAgB,KAAK,IAAI,GAAG,MAAM,cAAa;AAAA;AAE9E,iBAAO,EAAE,MAAM,KAAK,KAAK,MAAM,GAAG,gBAAgB,KAAK,IAAI,GAAG,MAAM,KAAK,KAAI;AAAA,MACpF;AACD,aAAO;AAAA,IACV;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,aAAa,KAAK,OAAO,GAAG;AACxB,UAAI,KAAK,QAAQ,uBAAuB,OAAO,KAAK,QAAQ;AACxD,eAAO;AACX,UAAI,EAAE,MAAM,KAAM,IAAG,KAAK,OAAO,KAAK,IAAI;AAC1C,aAAO,KAAK,MAAM,MAAM,MAAM,KAAK,IAAI,KAAK,QAAQ,MAAM,MAAM,IAAI,CAAC;AAAA,IACxE;AAAA;AAAA;AAAA;AAAA,IAID,OAAO,KAAK,OAAO,GAAG;AAClB,UAAI,EAAE,MAAM,KAAM,IAAG,KAAK,OAAO,KAAK,IAAI;AAC1C,UAAI,SAAS,KAAK,YAAY,MAAM,MAAM,IAAI;AAC9C,UAAI,WAAW,KAAK,QAAQ,sBAAsB,KAAK,QAAQ,oBAAoB,IAAI,IAAI;AAC3F,UAAI,WAAW;AACX,kBAAU,WAAW,KAAK,YAAY,MAAM,KAAK,OAAO,MAAM,CAAC;AACnE,aAAO;AAAA,IACV;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,YAAY,MAAM,MAAM,KAAK,QAAQ;AACjC,aAAO,YAAY,MAAM,KAAK,MAAM,SAAS,GAAG;AAAA,IACnD;AAAA;AAAA;AAAA;AAAA,IAID,WAAW,KAAK,OAAO,GAAG;AACtB,UAAI,EAAE,MAAM,KAAM,IAAG,KAAK,OAAO,KAAK,IAAI;AAC1C,UAAI,WAAW,KAAK,QAAQ;AAC5B,UAAI,UAAU;AACV,YAAI,YAAY,SAAS,IAAI;AAC7B,YAAI,YAAY;AACZ,iBAAO;AAAA,MACd;AACD,aAAO,KAAK,YAAY,MAAM,KAAK,OAAO,MAAM,CAAC;AAAA,IACpD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMD,IAAI,iBAAiB;AACjB,aAAO,KAAK,QAAQ,iBAAiB;AAAA,IACxC;AAAA,EACL;AAQA,QAAM,iBAA8B,oBAAI;AAExC,WAAS,kBAAkB,IAAI,KAAK,KAAK;AACrC,WAAO,WAAW,IAAI,aAAa,GAAG,EAAE,2BAA2B,GAAG,GAAG,KAAK,EAAE;AAAA,EACpF;AACA,WAAS,aAAa,IAAI;AACtB,WAAO,GAAG,OAAO,GAAG,QAAQ,iBAAiB,GAAG,QAAQ;AAAA,EAC5D;AACA,WAAS,eAAe,MAAM;AAC1B,QAAI,WAAW,KAAK,KAAK,KAAK,cAAc;AAC5C,QAAI;AACA,aAAO;AACX,QAAI,QAAQ,KAAK,YAAY;AAC7B,QAAI,UAAU,QAAQ,MAAM,KAAK,KAAK,SAAS,QAAQ,IAAI;AACvD,UAAI,OAAO,KAAK,WAAW,SAAS,QAAQ,MAAM,QAAQ,KAAK,IAAI,IAAI;AACvE,aAAO,QAAM,kBAAkB,IAAI,MAAM,GAAG,QAAW,UAAU,CAAC,aAAa,EAAE,IAAI,KAAK,OAAO,MAAS;AAAA,IAC7G;AACD,WAAO,KAAK,UAAU,OAAO,YAAY;AAAA,EAC7C;AACA,WAAS,WAAW,MAAM,KAAK6B,OAAM;AACjC,WAAO,MAAM,OAAO,KAAK,QAAQ;AAC7B,UAAI,WAAW,eAAe,IAAI;AAClC,UAAI;AACA,eAAO,SAAS,kBAAkB,OAAOA,OAAM,KAAK,IAAI,CAAC;AAAA,IAChE;AACD,WAAO;AAAA,EACX;AACA,WAAS,YAAY;AAAE,WAAO;AAAA,EAAI;AAAA,EAKlC,MAAM,0BAA0B,cAAc;AAAA,IAC1C,YAAYA,OAIZ,KAKA,MAAM;AACF,YAAMA,MAAK,OAAOA,MAAK,OAAO;AAC9B,WAAK,OAAOA;AACZ,WAAK,MAAM;AACX,WAAK,OAAO;AAAA,IACf;AAAA;AAAA;AAAA;AAAA,IAID,OAAO,OAAOA,OAAM,KAAK,MAAM;AAC3B,aAAO,IAAI,kBAAkBA,OAAM,KAAK,IAAI;AAAA,IAC/C;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,IAAI,YAAY;AACZ,aAAO,KAAK,aAAa,KAAK,GAAG;AAAA,IACpC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQD,IAAI,aAAa;AACb,aAAO,KAAK,cAAc,KAAK,IAAI;AAAA,IACtC;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,cAAc,MAAM;AAChB,UAAI,OAAO,KAAK,MAAM,IAAI,OAAO,KAAK,IAAI;AAE1C,iBAAS;AACL,YAAI,UAAU,KAAK,QAAQ,KAAK,IAAI;AACpC,eAAO,QAAQ,UAAU,QAAQ,OAAO,QAAQ,QAAQ;AACpD,oBAAU,QAAQ;AACtB,YAAI,SAAS,SAAS,IAAI;AACtB;AACJ,eAAO,KAAK,MAAM,IAAI,OAAO,QAAQ,IAAI;AAAA,MAC5C;AACD,aAAO,KAAK,WAAW,KAAK,IAAI;AAAA,IACnC;AAAA;AAAA;AAAA;AAAA;AAAA,IAKD,WAAW;AACP,UAAI,SAAS,KAAK,KAAK;AACvB,aAAO,SAAS,WAAW,QAAQ,KAAK,KAAK,KAAK,IAAI,IAAI;AAAA,IAC7D;AAAA,EACL;AACA,WAAS,SAAS,QAAQ,IAAI;AAC1B,aAAS,MAAM,IAAI,KAAK,MAAM,IAAI;AAC9B,UAAI,UAAU;AACV,eAAO;AACf,WAAO;AAAA,EACX;AAIA,WAAS,iBAAiB,SAAS;AAC/B,QAAI,OAAO,QAAQ;AACnB,QAAI,YAAY,KAAK,WAAW,KAAK,IAAI,GAAG,OAAO,KAAK;AACxD,QAAI,CAAC;AACD,aAAO;AACX,QAAI,MAAM,QAAQ,QAAQ;AAC1B,QAAI,WAAW,QAAQ,MAAM,IAAI,OAAO,UAAU,IAAI;AACtD,QAAI,UAAU,OAAO,QAAQ,OAAO,SAAS,OAAO,SAAS,KAAK,KAAK,IAAI,SAAS,IAAI,GAAG;AAC3F,aAAS,MAAM,UAAU,QAAM;AAC3B,UAAI,OAAO,KAAK,WAAW,GAAG;AAC9B,UAAI,CAAC,QAAQ,QAAQ;AACjB,eAAO;AACX,UAAI,CAAC,KAAK,KAAK;AACX,eAAO,KAAK,OAAO,UAAU,YAAY;AAC7C,YAAM,KAAK;AAAA,IACd;AAAA,EACL;AAeA,WAAS,kBAAkB,SAAS,OAAO,OAAO,SAAS,UAAU;AACjE,QAAI,QAAQ,QAAQ,WAAW,QAAQ,MAAM,MAAM,MAAM,EAAE,CAAC,EAAE;AAC9D,QAAI,SAAS,WAAW,MAAM,MAAM,OAAO,QAAQ,QAAQ,MAAM,KAAK,WAAW,YAAY,QAAQ,MAAM;AAC3G,QAAI,UAAU,QAAQ,iBAAiB,OAAO,IAAI;AAClD,QAAI;AACA,aAAO,SAAS,QAAQ,OAAO,QAAQ,IAAI,IAAI,QAAQ,OAAO,QAAQ,EAAE;AAC5E,WAAO,QAAQ,cAAc,SAAS,IAAI,QAAQ,OAAO;AAAA,EAC7D;AAcA,WAAS,gBAAgB,EAAE,QAAQ,QAAQ,EAAC,IAAK,CAAA,GAAI;AACjD,WAAO,CAAC,YAAY;AAChB,UAAI,cAAc,UAAU,OAAO,KAAK,QAAQ,SAAS;AACzD,aAAO,QAAQ,cAAc,cAAc,IAAI,QAAQ,QAAQ;AAAA,IACvE;AAAA,EACA;AA2DA,QAAM,eAA4B,oBAAI;AAMtC,WAAS,WAAW,MAAM;AACtB,QAAI,QAAQ,KAAK,YAAY,OAAO,KAAK;AACzC,WAAO,SAAS,MAAM,KAAK,KAAK,OAAO,EAAE,MAAM,MAAM,IAAI,IAAI,KAAK,KAAK,UAAU,KAAK,KAAK,KAAK,KAAM,IAAG;AAAA,EAC7G;AAAA,EA+YA,MAAM,eAAe;AAAA,IACjB,YAIA,OAAO,SAAS;AACZ,WAAK,QAAQ;AACb,UAAI;AACJ,eAAS,IAAI,MAAM;AACf,YAAI,MAAM,YAAY;AACtB,SAAC,YAAY,UAAU,uBAAO,OAAO,IAAI,IAAI,MAAM,GAAG,IAAI;AAC1D,eAAO;AAAA,MACV;AACD,YAAM,MAAM,OAAO,QAAQ,OAAO,WAAW,QAAQ,MAAM,QAAQ,MAAM,IAAI,QAAQ,GAAG,IAAI;AAC5F,YAAM,WAAW,QAAQ;AACzB,WAAK,QAAQ,oBAAoB,WAAW,CAAC,SAAS,KAAK,KAAK,gBAAgB,KAAK,SAAS,OACxF,WAAW,CAAC,SAAS,QAAQ,WAAW;AAC9C,WAAK,QAAQ,eAAe,MAAM,IAAI,YAAU;AAAA,QAC5C,KAAK,MAAM;AAAA,QACX,OAAO,MAAM,SAAS,IAAI,OAAO,OAAO,CAAE,GAAE,OAAO,EAAE,KAAK,KAAM,CAAA,CAAC;AAAA,MACpE,EAAC,GAAG;AAAA,QACD;AAAA,MACH,CAAA,EAAE;AACH,WAAK,SAAS,UAAU,IAAI,YAAY,OAAO,IAAI;AACnD,WAAK,YAAY,QAAQ;AAAA,IAC5B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAgBD,OAAO,OAAO,OAAO,SAAS;AAC1B,aAAO,IAAI,eAAe,OAAO,WAAW,CAAE,CAAA;AAAA,IACjD;AAAA,EACL;AACA,QAAM,mBAAgC,sBAAM;AAC5C,QAAM,sBAAmC,sBAAM,OAAO;AAAA,IAClD,QAAQ,QAAQ;AAAE,aAAO,OAAO,SAAS,CAAC,OAAO,CAAC,CAAC,IAAI;AAAA,IAAO;AAAA,EAClE,CAAC;AACD,WAAS,gBAAgB,OAAO;AAC5B,QAAI,OAAO,MAAM,MAAM,gBAAgB;AACvC,WAAO,KAAK,SAAS,OAAO,MAAM,MAAM,mBAAmB;AAAA,EAC/D;AAQA,WAAS,mBAAmB,aAAa,SAAS;AAC9C,QAAI,MAAM,CAAC,eAAe,GAAG;AAC7B,QAAI,uBAAuB,gBAAgB;AACvC,UAAI,YAAY;AACZ,YAAI,KAAK,WAAW,YAAY,GAAG,YAAY,MAAM,CAAC;AAC1D,kBAAY,YAAY;AAAA,IAC3B;AACD,QAAI,YAAY,QAAQ,YAAY,SAAS,SAAS,QAAQ;AAC1D,UAAI,KAAK,oBAAoB,GAAG,WAAW,CAAC;AAAA,aACvC;AACL,UAAI,KAAK,iBAAiB,SAAS,CAAC,WAAW,SAAS,GAAG,WAAS;AAChE,eAAO,MAAM,MAAM,WAAW,SAAS,MAAM,aAAa,UAAU,CAAC,WAAW,IAAI;MACvF,CAAA,CAAC;AAAA;AAEF,UAAI,KAAK,iBAAiB,GAAG,WAAW,CAAC;AAC7C,WAAO;AAAA,EACX;AAAA,EAqBA,MAAM,gBAAgB;AAAA,IAClB,YAAY,MAAM;AACd,WAAK,YAAY,uBAAO,OAAO,IAAI;AACnC,WAAK,OAAO,WAAW,KAAK,KAAK;AACjC,WAAK,cAAc,KAAK,UAAU,MAAM,gBAAgB,KAAK,KAAK,CAAC;AAAA,IACtE;AAAA,IACD,OAAO,QAAQ;AACX,UAAI,OAAO,WAAW,OAAO,KAAK,GAAG,eAAe,gBAAgB,OAAO,KAAK;AAChF,UAAI,cAAc,gBAAgB,gBAAgB,OAAO,UAAU;AACnE,UAAI,KAAK,SAAS,OAAO,KAAK,SAAS,MAAM,CAAC,eAAe,KAAK,QAAQ,KAAK,KAAK,MAAM;AACtF,aAAK,cAAc,KAAK,YAAY,IAAI,OAAO,OAAO;AAAA,MACzD,WACQ,QAAQ,KAAK,QAAQ,OAAO,mBAAmB,aAAa;AACjE,aAAK,OAAO;AACZ,aAAK,cAAc,KAAK,UAAU,OAAO,MAAM,YAAY;AAAA,MAC9D;AAAA,IACJ;AAAA,IACD,UAAU,MAAM,cAAc;AAC1B,UAAI,CAAC,gBAAgB,CAAC,KAAK,KAAK;AAC5B,eAAO,WAAW;AACtB,UAAI,UAAU,IAAI;AAClB,eAAS,EAAE,MAAM,GAAE,KAAM,KAAK,eAAe;AACzC,sBAAc,KAAK,MAAM,cAAc,CAACG,OAAMC,KAAI,UAAU;AACxD,kBAAQ,IAAID,OAAMC,KAAI,KAAK,UAAU,KAAK,MAAM,KAAK,UAAU,KAAK,IAAI,WAAW,KAAK,EAAE,OAAO,MAAK,CAAE,EAAE;AAAA,QAC1H,GAAe,MAAM,EAAE;AAAA,MACd;AACD,aAAO,QAAQ;IAClB;AAAA,EACL;AACA,QAAM,kBAA+B,qBAAK,KAAkB,2BAAW,UAAU,iBAAiB;AAAA,IAC9F,aAAa,CAAAO,OAAKA,GAAE;AAAA,EACxB,CAAC,CAAC;AAkDF,QAAM,kBAAkB,KAAO,kBAAkB;AA+DjD,QAAM,wBAAqC,oBAAI;AAC/C,WAAS,cAAc,MAAM,KAAK,UAAU;AACxC,QAAI,SAAS,KAAK,KAAK,MAAM,IAAI,SAAS,WAAW,SAAS,QAAQ;AACtE,QAAI;AACA,aAAO;AACX,QAAI,KAAK,KAAK,UAAU,GAAG;AACvB,UAAIvC,SAAQ,SAAS,QAAQ,KAAK,IAAI;AACtC,UAAIA,SAAQ,MAAMA,SAAQ,MAAM,MAAM,IAAI,IAAI;AAC1C,eAAO,CAAC,SAASA,SAAQ,GAAG,CAAC;AAAA,IACpC;AACD,WAAO;AAAA,EACX;AACA,WAAS,WAAW,MAAM;AACtB,QAAI,YAAY,KAAK,KAAK,KAAK,qBAAqB;AACpD,WAAO,YAAY,UAAU,KAAK,IAAI,IAAI;AAAA,EAC9C;AAOA,WAAS,cAAc,OAAO,KAAK,KAAK,SAAS,CAAA,GAAI;AACjD,QAAI,kBAAkB,OAAO,mBAAmB,iBAAiB,WAAW,OAAO,YAAY;AAC/F,QAAI,OAAO,WAAW,KAAK,GAAG,OAAO,KAAK,aAAa,KAAK,GAAG;AAC/D,aAAS,MAAM,MAAM,KAAK,MAAM,IAAI,QAAQ;AACxC,UAAI,UAAU,cAAc,IAAI,MAAM,KAAK,QAAQ;AACnD,UAAI,WAAW,IAAI,OAAO,IAAI,IAAI;AAC9B,YAAI,SAAS,WAAW,GAAG;AAC3B,YAAI,WAAW,MAAM,IAAI,OAAO,OAAO,QAAQ,MAAM,OAAO,KAAK,MAAM,OAAO,QAAQ,OAAO,OAAO;AAChG,iBAAO,oBAAoB,OAAO,KAAK,KAAK,KAAK,QAAQ,SAAS,QAAQ;AAAA,MACjF;AAAA,IACJ;AACD,WAAO,mBAAmB,OAAO,KAAK,KAAK,MAAM,KAAK,MAAM,iBAAiB,QAAQ;AAAA,EACzF;AACA,WAAS,oBAAoB,QAAQ,MAAM,KAAK,OAAO,QAAQ,UAAU,UAAU;AAC/E,QAAI,SAAS,MAAM,QAAQ,aAAa,EAAE,MAAM,OAAO,MAAM,IAAI,OAAO,GAAE;AAC1E,QAAI,QAAQ,GAAG,SAAS,WAAW,QAAQ,WAAW,SAAS,SAAS,OAAO,OAAM;AACrF,QAAI,WAAW,MAAM,IAAI,OAAO,YAAY,MAAM,IAAI,IAAI,OAAO,WAAW,MAAM,EAAE;AAChF,SAAG;AACC,YAAI,MAAM,IAAI,OAAO,MAAM,MAAM,OAAO,OAAO,QAAQ,MAAM,IAAI;AAC7D,cAAI,SAAS,KAAK,SAAS,QAAQ,OAAO,KAAK,IAAI,IAAI,MAAM,OAAO,OAAO,OAAO,IAAI;AAClF,gBAAI,YAAY,WAAW,MAAM;AACjC,mBAAO,EAAE,OAAO,YAAY,KAAK,YAAY,EAAE,MAAM,UAAU,MAAM,IAAI,UAAU,GAAE,IAAK,QAAW,SAAS;UACjH,WACQ,cAAc,OAAO,MAAM,KAAK,QAAQ,GAAG;AAChD;AAAA,UACH,WACQ,cAAc,OAAO,MAAM,CAAC,KAAK,QAAQ,GAAG;AACjD,gBAAI,SAAS,GAAG;AACZ,kBAAI,YAAY,WAAW,MAAM;AACjC,qBAAO;AAAA,gBACH,OAAO;AAAA,gBACP,KAAK,aAAa,UAAU,OAAO,UAAU,KAAK,EAAE,MAAM,UAAU,MAAM,IAAI,UAAU,GAAI,IAAG;AAAA,gBAC/F,SAAS;AAAA,cACrC;AAAA,YACqB;AACD;AAAA,UACH;AAAA,QACJ;AAAA,MACb,SAAiB,MAAM,IAAI,OAAO,YAAW,IAAK,OAAO;AACrD,WAAO,EAAE,OAAO,YAAY,SAAS,MAAK;AAAA,EAC9C;AACA,WAAS,mBAAmB,OAAO,KAAK,KAAK,MAAM,WAAW,iBAAiB,UAAU;AACrF,QAAI,UAAU,MAAM,IAAI,MAAM,SAAS,MAAM,GAAG,GAAG,IAAI,MAAM,SAAS,KAAK,MAAM,CAAC;AAClF,QAAIgG,WAAU,SAAS,QAAQ,OAAO;AACtC,QAAIA,WAAU,KAAMA,WAAU,KAAK,KAAO,MAAM;AAC5C,aAAO;AACX,QAAI,aAAa,EAAE,MAAM,MAAM,IAAI,MAAM,IAAI,KAAK,IAAI,MAAM,IAAI,MAAM,IAAI,IAAG;AAC7E,QAAI,OAAO,MAAM,IAAI,UAAU,KAAK,MAAM,IAAI,MAAM,IAAI,SAAS,CAAC,GAAG,QAAQ;AAC7E,aAAS,WAAW,GAAG,CAAE,KAAK,OAAQ,QAAQ,YAAY,mBAAkB;AACxE,UAAI,OAAO,KAAK;AAChB,UAAI,MAAM;AACN,oBAAY,KAAK;AACrB,UAAI,UAAU,MAAM,WAAW;AAC/B,eAASxB,OAAM,MAAM,IAAI,IAAI,KAAK,SAAS,GAAG,MAAM,MAAM,IAAI,KAAK,SAAS,IAAIA,QAAO,KAAKA,QAAO,KAAK;AACpG,YAAI,QAAQ,SAAS,QAAQ,KAAKA,IAAG,CAAC;AACtC,YAAI,QAAQ,KAAK,KAAK,aAAa,UAAUA,MAAK,CAAC,EAAE,QAAQ;AACzD;AACJ,YAAK,QAAQ,KAAK,KAAO,MAAM,GAAI;AAC/B;AAAA,QACH,WACQ,SAAS,GAAG;AACjB,iBAAO,EAAE,OAAO,YAAY,KAAK,EAAE,MAAM,UAAUA,MAAK,IAAI,UAAUA,OAAM,EAAC,GAAI,SAAU,SAAS,KAAOwB,YAAW;QACzH,OACI;AACD;AAAA,QACH;AAAA,MACJ;AACD,UAAI,MAAM;AACN,oBAAY,KAAK;AAAA,IACxB;AACD,WAAO,KAAK,OAAO,EAAE,OAAO,YAAY,SAAS,MAAO,IAAG;AAAA,EAC/D;AAidA,QAAM,WAAwB,uBAAO,OAAO,IAAI;AAChD,QAAM,YAAY,CAAC,SAAS,IAAI;AAEhC,QAAM,SAAS,CAAA;AACf,QAAM,eAA4B,uBAAO,OAAO,IAAI;AACpD,WAAS,CAAC,YAAY3F,KAAI,KAAK;AAAA,IAC3B,CAAC,YAAY,cAAc;AAAA,IAC3B,CAAC,cAAc,sBAAsB;AAAA,IACrC,CAAC,YAAY,gBAAgB;AAAA,IAC7B,CAAC,OAAO,yBAAyB;AAAA,IACjC,CAAC,OAAO,SAAS;AAAA,IACjB,CAAC,aAAa,eAAe;AAAA,IAC7B,CAAC,QAAQ,UAAU;AAAA,IACnB,CAAC,WAAW,uBAAuB;AAAA,IACnC,CAAC,aAAa,UAAU;AAAA,IACxB,CAAC,SAAS,SAAS;AAAA,IACnB,CAAC,UAAU,SAAS;AAAA,IACpB,CAAC,YAAY,cAAc;AAAA,EAC/B;AACI,iBAAa,UAAU,IAAiB,gCAAgB,UAAUA,KAAI;AAW1E,WAAS,YAAY,MAAM,KAAK;AAC5B,QAAI,OAAO,QAAQ,IAAI,IAAI;AACvB;AACJ,WAAO,KAAK,IAAI;AAChB,YAAQ,KAAK,GAAG;AAAA,EACpB;AACA,WAAS,gBAAgB,OAAO,QAAQ;AACpC,QAAI,MAAM;AACV,aAAS,QAAQ,OAAO,MAAM,GAAG,GAAG;AAChC,UAAI,QAAS,MAAM,IAAI,KAAK,KAAK,IAAI;AACrC,UAAI,CAAC,OAAO;AACR,oBAAY,MAAM,4BAA4B,IAAI,EAAE;AAAA,MACvD,WACQ,OAAO,SAAS,YAAY;AACjC,YAAI,CAAC;AACD,sBAAY,MAAM,YAAY,IAAI,uBAAuB;AAAA;AAEzD,gBAAM,MAAM,GAAG;AAAA,MACtB,OACI;AACD,YAAI;AACA,sBAAY,MAAM,OAAO,IAAI,mBAAmB;AAAA;AAEhD,gBAAM;AAAA,MACb;AAAA,IACJ;AACD,QAAI,CAAC;AACD,aAAO;AACX,QAAIA,QAAO,OAAO,QAAQ,MAAM,GAAG,GAAG,OAAO,SAAS,OAAO;AAAA,MACzD,IAAI,UAAU;AAAA,MACd,MAAAA;AAAA,MACA,OAAO,CAAC,UAAU,EAAE,CAACA,KAAI,GAAG,IAAK,CAAA,CAAC;AAAA,IAC1C,CAAK;AACD,cAAU,KAAK,IAAI;AACnB,WAAO,KAAK;AAAA,EAChB;AC76EA,QAAM,eAA4B,2BAAW,OAAO;AAAA,IAChD,MAAM;AAAA,IACN,QAAqB,uBAAO,UAAU;AAAA,MAClC,OAAO;AAAA,QACU,+BAAe,IAAI;AAAA,UAC5B,cAA2B,gCAAgB,EAAE,QAAQ,iBAAgB,CAAE;AAAA,UACvE,uBAAuB,MAAM;AAAA,UAC7B,iBAAiB,QAAM,GAAG,SAAU;AAAA,UACpC,sBAAmC,gCAAiB;AAAA,QACpE,CAAa;AAAA,QACY,6BAAa,IAAI,UAAQ;AAClC,cAAI,yBAAyB,KAAK,KAAK,IAAI;AACvC,mBAAO;AACX,cAAI,KAAK,QAAQ;AACb,mBAAO,WAAS,EAAE,MAAM,KAAK,OAAO,GAAG,IAAI,KAAK,KAAK,EAAG;AAC5D,iBAAO;AAAA,QACvB,CAAa;AAAA,MACJ;AAAA,IACT,CAAK;AAAA,IACD,cAAc;AAAA,MACV,eAAe,EAAE,MAAM,MAAM,OAAO,EAAE,MAAM,MAAM,OAAO,OAAQ;AAAA,MACjE,eAAe;AAAA,MACf,eAAe,EAAE,gBAAgB,CAAC,KAAK,KAAK,IAAI,EAAG;AAAA,IACtD;AAAA,EACL,CAAC;AAID,WAAS,OAAO;AACZ,WAAO,IAAI,gBAAgB,YAAY;AAAA,EAC3C;;;;;;;;;;;;;;;;AC1B2C;AACzC,OAAC,WAAW;AAKd,YACE,OAAO,mCAAmC,eAC1C,OAAO,+BAA+B,gCACpC,YACF;AACA,yCAA+B,4BAA4B,IAAI,MAAK,CAAE;AAAA,QACvE;AACS,YAAI,2BAA2B;AACzC,YAAI,kBAAkB;AACtB,YAAI,eAAe;AAEnB,iBAAS,KAAK,MAAM,MAAM;AACxB,cAAIL,SAAQ,KAAK;AACjB,eAAK,KAAK,IAAI;AACd,iBAAO,MAAM,MAAMA,MAAK;AAAA,QACzB;AACD,iBAAS,KAAK,MAAM;AAClB,iBAAO,KAAK,WAAW,IAAI,OAAO,KAAK,CAAC;AAAA,QACzC;AACD,iBAAS,IAAI,MAAM;AACjB,cAAI,KAAK,WAAW,GAAG;AACrB,mBAAO;AAAA,UACR;AAED,cAAI,QAAQ,KAAK,CAAC;AAClB,cAAI,OAAO,KAAK;AAEhB,cAAI,SAAS,OAAO;AAClB,iBAAK,CAAC,IAAI;AACV,qBAAS,MAAM,MAAM,CAAC;AAAA,UACvB;AAED,iBAAO;AAAA,QACR;AAED,iBAAS,OAAO,MAAM,MAAMD,IAAG;AAC7B,cAAIC,SAAQD;AAEZ,iBAAOC,SAAQ,GAAG;AAChB,gBAAI,cAAcA,SAAQ,MAAM;AAChC,gBAAI,SAAS,KAAK,WAAW;AAE7B,gBAAIM,SAAQ,QAAQ,IAAI,IAAI,GAAG;AAE7B,mBAAK,WAAW,IAAI;AACpB,mBAAKN,MAAK,IAAI;AACd,cAAAA,SAAQ;AAAA,YACd,OAAW;AAEL;AAAA,YACD;AAAA,UACF;AAAA,QACF;AAED,iBAAS,SAAS,MAAM,MAAMD,IAAG;AAC/B,cAAIC,SAAQD;AACZ,cAAI,SAAS,KAAK;AAClB,cAAI,aAAa,WAAW;AAE5B,iBAAOC,SAAQ,YAAY;AACzB,gBAAI,aAAaA,SAAQ,KAAK,IAAI;AAClC,gBAAI,OAAO,KAAK,SAAS;AACzB,gBAAI,aAAa,YAAY;AAC7B,gBAAI,QAAQ,KAAK,UAAU;AAE3B,gBAAIM,SAAQ,MAAM,IAAI,IAAI,GAAG;AAC3B,kBAAI,aAAa,UAAUA,SAAQ,OAAO,IAAI,IAAI,GAAG;AACnD,qBAAKN,MAAK,IAAI;AACd,qBAAK,UAAU,IAAI;AACnB,gBAAAA,SAAQ;AAAA,cAChB,OAAa;AACL,qBAAKA,MAAK,IAAI;AACd,qBAAK,SAAS,IAAI;AAClB,gBAAAA,SAAQ;AAAA,cACT;AAAA,YACP,WAAe,aAAa,UAAUM,SAAQ,OAAO,IAAI,IAAI,GAAG;AAC1D,mBAAKN,MAAK,IAAI;AACd,mBAAK,UAAU,IAAI;AACnB,cAAAA,SAAQ;AAAA,YACd,OAAW;AAEL;AAAA,YACD;AAAA,UACF;AAAA,QACF;AAED,iBAASM,SAAQZ,IAAGsB,IAAG;AAErB,cAAI,OAAOtB,GAAE,YAAYsB,GAAE;AAC3B,iBAAO,SAAS,IAAI,OAAOtB,GAAE,KAAKsB,GAAE;AAAA,QACrC;AAGD,YAAI,oBAAoB;AACxB,YAAI,uBAAuB;AAC3B,YAAI,iBAAiB;AACrB,YAAI,cAAc;AAClB,YAAI,eAAe;AAEnB,iBAAS,gBAAgB,MAAM,IAAI;AAAA,QAClC;AAID,YAAI,oBAAoB,OAAO,gBAAgB,YAAY,OAAO,YAAY,QAAQ;AAEtF,YAAI,mBAAmB;AACrB,cAAI,mBAAmB;AAEvB,iCAAuB,WAAY;AACjC,mBAAO,iBAAiB;UAC5B;AAAA,QACA,OAAO;AACL,cAAI,YAAY;AAChB,cAAI,cAAc,UAAU;AAE5B,iCAAuB,WAAY;AACjC,mBAAO,UAAU,IAAK,IAAG;AAAA,UAC7B;AAAA,QACC;AAKD,YAAI,oBAAoB;AAExB,YAAI,6BAA6B;AAEjC,YAAI,iCAAiC;AACrC,YAAI,0BAA0B;AAC9B,YAAI,uBAAuB;AAE3B,YAAI,wBAAwB;AAE5B,YAAI,YAAY,CAAA;AAChB,YAAI,aAAa,CAAA;AAEjB,YAAI,gBAAgB;AACpB,YAAI,cAAc;AAClB,YAAI,uBAAuB;AAE3B,YAAI,mBAAmB;AACvB,YAAI,0BAA0B;AAC9B,YAAI,yBAAyB;AAE7B,YAAI,kBAAkB,OAAO,eAAe,aAAa,aAAa;AACtE,YAAI,oBAAoB,OAAO,iBAAiB,aAAa,eAAe;AAC5E,YAAI,oBAAoB,OAAO,iBAAiB,cAAc,eAAe;AAExD,eAAO,cAAc,eAAe,UAAU,eAAe,UAAa,UAAU,WAAW,mBAAmB,SAAY,UAAU,WAAW,eAAe,KAAK,UAAU,UAAU,IAAI;AAEpN,iBAAS,cAAc,aAAa;AAElC,cAAI,QAAQ,KAAK,UAAU;AAE3B,iBAAO,UAAU,MAAM;AACrB,gBAAI,MAAM,aAAa,MAAM;AAE3B,kBAAI,UAAU;AAAA,YACpB,WAAe,MAAM,aAAa,aAAa;AAEzC,kBAAI,UAAU;AACd,oBAAM,YAAY,MAAM;AACxB,mBAAK,WAAW,KAAK;AAAA,YAC3B,OAAW;AAEL;AAAA,YACD;AAED,oBAAQ,KAAK,UAAU;AAAA,UACxB;AAAA,QACF;AAED,iBAAS,cAAc,aAAa;AAClC,mCAAyB;AACzB,wBAAc,WAAW;AAEzB,cAAI,CAAC,yBAAyB;AAC5B,gBAAI,KAAK,SAAS,MAAM,MAAM;AAC5B,wCAA0B;AAC1B,kCAAoB,SAAS;AAAA,YACnC,OAAW;AACL,kBAAI,aAAa,KAAK,UAAU;AAEhC,kBAAI,eAAe,MAAM;AACvB,mCAAmB,eAAe,WAAW,YAAY,WAAW;AAAA,cACrE;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAED,iBAAS,UAAU,kBAAkBiF,cAAa;AAGhD,oCAA0B;AAE1B,cAAI,wBAAwB;AAE1B,qCAAyB;AACzB;UACD;AAED,6BAAmB;AACnB,cAAI,wBAAwB;AAE5B,cAAI;;AACF,gBAAI;AAAiB;AAAA,iBAYd;AAEL,qBAAO,SAAS,kBAAkBA,YAAW;AAAA,YAC9C;AAAA,UACL,UAAY;AACR,0BAAc;AACd,mCAAuB;AACvB,+BAAmB;AAAA,UACpB;AAAA,QACF;AAED,iBAAS,SAAS,kBAAkBA,cAAa;AAC/C,cAAI,cAAcA;AAClB,wBAAc,WAAW;AACzB,wBAAc,KAAK,SAAS;AAE5B,iBAAO,gBAAgB,QAAQ,CAAE,0BAA4B;AAC3D,gBAAI,YAAY,iBAAiB,gBAAgB,CAAC,oBAAoB,kBAAiB,IAAK;AAE1F;AAAA,YACD;AAED,gBAAI,WAAW,YAAY;AAE3B,gBAAI,OAAO,aAAa,YAAY;AAClC,0BAAY,WAAW;AACvB,qCAAuB,YAAY;AACnC,kBAAI,yBAAyB,YAAY,kBAAkB;AAE3D,kBAAI,uBAAuB,SAAS,sBAAsB;AAC1D,4BAAc,QAAQ;AAEtB,kBAAI,OAAO,yBAAyB,YAAY;AAC9C,4BAAY,WAAW;AAAA,cAC/B,OAAa;AAEL,oBAAI,gBAAgB,KAAK,SAAS,GAAG;AACnC,sBAAI,SAAS;AAAA,gBACd;AAAA,cACF;AAED,4BAAc,WAAW;AAAA,YAC/B,OAAW;AACL,kBAAI,SAAS;AAAA,YACd;AAED,0BAAc,KAAK,SAAS;AAAA,UAC7B;AAGD,cAAI,gBAAgB,MAAM;AACxB,mBAAO;AAAA,UACX,OAAS;AACL,gBAAI,aAAa,KAAK,UAAU;AAEhC,gBAAI,eAAe,MAAM;AACvB,iCAAmB,eAAe,WAAW,YAAY,WAAW;AAAA,YACrE;AAED,mBAAO;AAAA,UACR;AAAA,QACF;AAED,iBAAS,yBAAyB,eAAe,cAAc;AAC7D,kBAAQ,eAAa;AAAA,YACnB,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AACH;AAAA,YAEF;AACE,8BAAgB;AAAA,UACnB;AAED,cAAI,wBAAwB;AAC5B,iCAAuB;AAEvB,cAAI;AACF,mBAAO,aAAY;AAAA,UACvB,UAAY;AACR,mCAAuB;AAAA,UACxB;AAAA,QACF;AAED,iBAAS,cAAc,cAAc;AACnC,cAAI;AAEJ,kBAAQ,sBAAoB;AAAA,YAC1B,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAEH,8BAAgB;AAChB;AAAA,YAEF;AAEE,8BAAgB;AAChB;AAAA,UACH;AAED,cAAI,wBAAwB;AAC5B,iCAAuB;AAEvB,cAAI;AACF,mBAAO,aAAY;AAAA,UACvB,UAAY;AACR,mCAAuB;AAAA,UACxB;AAAA,QACF;AAED,iBAAS,sBAAsB,UAAU;AACvC,cAAI,sBAAsB;AAC1B,iBAAO,WAAY;AAEjB,gBAAI,wBAAwB;AAC5B,mCAAuB;AAEvB,gBAAI;AACF,qBAAO,SAAS,MAAM,MAAM,SAAS;AAAA,YAC3C,UAAc;AACR,qCAAuB;AAAA,YACxB;AAAA,UACL;AAAA,QACC;AAED,iBAAS,0BAA0B,eAAe,UAAU,SAAS;AACnE,cAAI,cAAc,QAAQ;AAC1B,cAAIC;AAEJ,cAAI,OAAO,YAAY,YAAY,YAAY,MAAM;AACnD,gBAAI,QAAQ,QAAQ;AAEpB,gBAAI,OAAO,UAAU,YAAY,QAAQ,GAAG;AAC1C,cAAAA,aAAY,cAAc;AAAA,YAChC,OAAW;AACL,cAAAA,aAAY;AAAA,YACb;AAAA,UACL,OAAS;AACL,YAAAA,aAAY;AAAA,UACb;AAED,cAAI;AAEJ,kBAAQ,eAAa;AAAA,YACnB,KAAK;AACH,wBAAU;AACV;AAAA,YAEF,KAAK;AACH,wBAAU;AACV;AAAA,YAEF,KAAK;AACH,wBAAU;AACV;AAAA,YAEF,KAAK;AACH,wBAAU;AACV;AAAA,YAEF,KAAK;AAAA,YACL;AACE,wBAAU;AACV;AAAA,UACH;AAED,cAAI,iBAAiBA,aAAY;AACjC,cAAI,UAAU;AAAA,YACZ,IAAI;AAAA,YACJ;AAAA,YACA;AAAA,YACA,WAAWA;AAAA,YACX;AAAA,YACA,WAAW;AAAA,UACf;AAEE,cAAIA,aAAY,aAAa;AAE3B,oBAAQ,YAAYA;AACpB,iBAAK,YAAY,OAAO;AAExB,gBAAI,KAAK,SAAS,MAAM,QAAQ,YAAY,KAAK,UAAU,GAAG;AAE5D,kBAAI,wBAAwB;AAE1B;cACR,OAAa;AACL,yCAAyB;AAAA,cAC1B;AAGD,iCAAmB,eAAeA,aAAY,WAAW;AAAA,YAC1D;AAAA,UACL,OAAS;AACL,oBAAQ,YAAY;AACpB,iBAAK,WAAW,OAAO;AAIvB,gBAAI,CAAC,2BAA2B,CAAC,kBAAkB;AACjD,wCAA0B;AAC1B,kCAAoB,SAAS;AAAA,YAC9B;AAAA,UACF;AAED,iBAAO;AAAA,QACR;AAED,iBAAS,0BAA0B;AAAA,QAClC;AAED,iBAAS,6BAA6B;AAEpC,cAAI,CAAC,2BAA2B,CAAC,kBAAkB;AACjD,sCAA0B;AAC1B,gCAAoB,SAAS;AAAA,UAC9B;AAAA,QACF;AAED,iBAAS,gCAAgC;AACvC,iBAAO,KAAK,SAAS;AAAA,QACtB;AAED,iBAAS,wBAAwB,MAAM;AAKrC,eAAK,WAAW;AAAA,QACjB;AAED,iBAAS,mCAAmC;AAC1C,iBAAO;AAAA,QACR;AAED,YAAI,uBAAuB;AAC3B,YAAI,wBAAwB;AAC5B,YAAI,gBAAgB;AAKpB,YAAI,gBAAgB;AACpB,YAAI,YAAY;AAEhB,iBAAS,oBAAoB;AAC3B,cAAI,cAAc,QAAQ,aAAY,IAAK;AAE3C,cAAI,cAAc,eAAe;AAG/B,mBAAO;AAAA,UACR;AAGD,iBAAO;AAAA,QACR;AAED,iBAAS,eAAe;AAAA,QAEvB;AAED,iBAAS,eAAe,KAAK;AAC3B,cAAI,MAAM,KAAK,MAAM,KAAK;AAExB,oBAAQ,OAAO,EAAE,iHAAsH;AACvI;AAAA,UACD;AAED,cAAI,MAAM,GAAG;AACX,4BAAgB,KAAK,MAAM,MAAO,GAAG;AAAA,UACzC,OAAS;AAEL,4BAAgB;AAAA,UACjB;AAAA,QACF;AAED,YAAI,2BAA2B,WAAY;AACzC,cAAI,0BAA0B,MAAM;AAClC,gBAAI,cAAc,QAAQ;AAG1B,wBAAY;AACZ,gBAAI,mBAAmB;AAOvB,gBAAI,cAAc;AAElB,gBAAI;AACF,4BAAc,sBAAsB,kBAAkB,WAAW;AAAA,YACvE,UAAc;AACR,kBAAI,aAAa;AAGf;cACR,OAAa;AACL,uCAAuB;AACvB,wCAAwB;AAAA,cACzB;AAAA,YACF;AAAA,UACL,OAAS;AACL,mCAAuB;AAAA,UACxB;AAAA,QACH;AAEA,YAAI;AAEJ,YAAI,OAAO,sBAAsB,YAAY;AAY3C,6CAAmC,WAAY;AAC7C,8BAAkB,wBAAwB;AAAA,UAC9C;AAAA,QACA,WAAW,OAAO,mBAAmB,aAAa;AAGhD,cAAI,UAAU,IAAI;AAClB,cAAI,OAAO,QAAQ;AACnB,kBAAQ,MAAM,YAAY;AAE1B,6CAAmC,WAAY;AAC7C,iBAAK,YAAY,IAAI;AAAA,UACzB;AAAA,QACA,OAAO;AAEL,6CAAmC,WAAY;AAC7C,4BAAgB,0BAA0B,CAAC;AAAA,UAC/C;AAAA,QACC;AAED,iBAAS,oBAAoB,UAAU;AACrC,kCAAwB;AAExB,cAAI,CAAC,sBAAsB;AACzB,mCAAuB;AACvB;UACD;AAAA,QACF;AAED,iBAAS,mBAAmB,UAAU,IAAI;AACxC,0BAAgB,gBAAgB,WAAY;AAC1C,qBAAS,QAAQ,aAAY,CAAE;AAAA,UAChC,GAAE,EAAE;AAAA,QACN;AAED,iBAAS,oBAAoB;AAC3B,4BAAkB,aAAa;AAC/B,0BAAgB;AAAA,QACjB;AAED,YAAI,wBAAwB;AAC5B,YAAI,qBAAsB;AAE1B,gBAAA,wBAAgC;AAChC,gBAAA,6BAAqC;AACrC,gBAAA,uBAA+B;AAC/B,gBAAA,0BAAkC;AAClC,gBAAA,qBAA6B;AAC7B,gBAAA,gCAAwC;AACxC,gBAAA,0BAAkC;AAClC,gBAAA,6BAAqC;AACrC,gBAAA,0BAAkC;AAClC,gBAAA,mCAA2C;AAC3C,gBAAA,gCAAwC;AACxC,gBAAA,gBAAwB;AACxB,gBAAA,0BAAkC;AAClC,gBAAA,wBAAgC;AAChC,gBAAA,2BAAmC;AACnC,gBAAA,4BAAoC;AACpC,gBAAA,uBAA+B;AAC/B,gBAAA,wBAAgC;AAEhC,YACE,OAAO,mCAAmC,eAC1C,OAAO,+BAA+B,+BACpC,YACF;AACA,yCAA+B,2BAA2B,IAAI,MAAK,CAAE;AAAA,QACtE;AAAA,MAED;IACA;AAAA;ACrnBO;AACLC,cAAA,UAAiBxF;AAAAA,EACnB;;;;;;;;;;;ACM2C;AACzC,KAAC,WAAW;AAKd,UACE,OAAO,mCAAmC,eAC1C,OAAO,+BAA+B,gCACpC,YACF;AACA,uCAA+B,4BAA4B,IAAI,MAAK,CAAE;AAAA,MACxE;AACU,UAAIC,SAAQD;AACtB,UAAI,YAAYyF;AAEhB,UAAI,uBAAuBxF,OAAM;AAEjC,UAAI,kBAAkB;AACtB,eAAS,mBAAmB,oBAAoB;AAC9C;AACE,4BAAkB;AAAA,QACnB;AAAA,MACH;AAMA,eAAS,KAAK,QAAQ;AACpB;AACE,cAAI,CAAC,iBAAiB;AACpB,qBAAS,OAAO,UAAU,QAAQ,OAAO,IAAI,MAAM,OAAO,IAAI,OAAO,IAAI,CAAC,GAAG,OAAO,GAAG,OAAO,MAAM,QAAQ;AAC1G,mBAAK,OAAO,CAAC,IAAI,UAAU,IAAI;AAAA,YAChC;AAED,yBAAa,QAAQ,QAAQ,IAAI;AAAA,UAClC;AAAA,QACF;AAAA,MACH;AACA,eAAS,MAAM,QAAQ;AACrB;AACE,cAAI,CAAC,iBAAiB;AACpB,qBAAS,QAAQ,UAAU,QAAQ,OAAO,IAAI,MAAM,QAAQ,IAAI,QAAQ,IAAI,CAAC,GAAG,QAAQ,GAAG,QAAQ,OAAO,SAAS;AACjH,mBAAK,QAAQ,CAAC,IAAI,UAAU,KAAK;AAAA,YAClC;AAED,yBAAa,SAAS,QAAQ,IAAI;AAAA,UACnC;AAAA,QACF;AAAA,MACH;AAEA,eAAS,aAAa,OAAO,QAAQ,MAAM;AAGzC;AACE,cAAInB,0BAAyB,qBAAqB;AAClD,cAAI,QAAQA,wBAAuB;AAEnC,cAAI,UAAU,IAAI;AAChB,sBAAU;AACV,mBAAO,KAAK,OAAO,CAAC,KAAK,CAAC;AAAA,UAC3B;AAGD,cAAI,iBAAiB,KAAK,IAAI,SAAU,MAAM;AAC5C,mBAAO,OAAO,IAAI;AAAA,UACxB,CAAK;AAED,yBAAe,QAAQ,cAAc,MAAM;AAI3C,mBAAS,UAAU,MAAM,KAAK,QAAQ,KAAK,GAAG,SAAS,cAAc;AAAA,QACtE;AAAA,MACH;AAEA,UAAI,oBAAoB;AACxB,UAAI,iBAAiB;AACrB,UAAI,yBAAyB;AAE7B,UAAI,WAAW;AAEf,UAAI,aAAa;AAEjB,UAAI,gBAAgB;AACpB,UAAI,WAAW;AACf,UAAI,WAAW;AACf,UAAI,OAAO;AACX,UAAI,kBAAkB;AACtB,UAAI4G,mBAAkB;AACtB,UAAI,aAAa;AACjB,UAAI,WAAW;AACf,UAAI,oBAAoB;AACxB,UAAI,gBAAgB;AACpB,UAAI,sBAAsB;AAC1B,UAAI,gBAAgB;AACpB,UAAI,2BAA2B;AAC/B,UAAI,qBAAqB;AACzB,UAAI,wBAAwB;AAC5B,UAAI,iBAAiB;AACrB,UAAI,qBAAqB;AACzB,UAAI,wBAAwB;AAC5B,UAAI,iBAAiB;AACrB,UAAI,yBAAyB;AAI7B,UAAI,2CAA2C;AAG/C,UAAI,sBAAsB;AAE1B,UAAI,+BAA+B;AAEnC,UAAI,qBAAqB;AAEzB,UAAI,kCAAkC;AAStC,UAAI,iCAAiC;AAKrC,UAAI,qCAAqC;AACzC,UAAI,sBAAsB;AAM1B,UAAI,2BAA2B;AAE/B,UAAI,sBAAsB;AAE1B,UAAI,4BAA4B;AAEhC,UAAI,kBAAkB,oBAAI;AAM1B,UAAI,+BAA+B,CAAA;AAQnC,UAAI,4BAA6B,CAAA;AAEjC,eAAS,sBAAsB,kBAAkB,cAAc;AAC7D,4BAAoB,kBAAkB,YAAY;AAClD,4BAAoB,mBAAmB,WAAW,YAAY;AAAA,MAChE;AACA,eAAS,oBAAoB,kBAAkB,cAAc;AAC3D;AACE,cAAI,6BAA6B,gBAAgB,GAAG;AAClD,kBAAM,8FAAmG,gBAAgB;AAAA,UAC1H;AAAA,QACF;AAED,qCAA6B,gBAAgB,IAAI;AAEjD;AACE,cAAI,iBAAiB,iBAAiB;AACtC,oCAA0B,cAAc,IAAI;AAE5C,cAAI,qBAAqB,iBAAiB;AACxC,sCAA0B,aAAa;AAAA,UACxC;AAAA,QACF;AAED,iBAAStG,KAAI,GAAGA,KAAI,aAAa,QAAQA,MAAK;AAC5C,0BAAgB,IAAI,aAAaA,EAAC,CAAC;AAAA,QACpC;AAAA,MACH;AAEA,UAAI,YAAY,CAAC,EAAE,OAAO,WAAW,eAAe,OAAO,OAAO,aAAa,eAAe,OAAO,OAAO,SAAS,kBAAkB;AAEvI,UAAI,iBAAiB,OAAO,UAAU;AAYtC,eAASJ,UAAS,OAAO;AACvB;AAEE,cAAI,iBAAiB,OAAO,WAAW,cAAc,OAAO;AAC5D,cAAI,OAAO,kBAAkB,MAAM,OAAO,WAAW,KAAK,MAAM,YAAY,QAAQ;AACpF,iBAAO;AAAA,QACR;AAAA,MACH;AAGA,eAAS,kBAAkB,OAAO;AAChC;AACE,cAAI;AACF,+BAAmB,KAAK;AACxB,mBAAO;AAAA,UACR,SAAQC,IAAG;AACV,mBAAO;AAAA,UACR;AAAA,QACF;AAAA,MACH;AAEA,eAAS,mBAAmB,OAAO;AAwBjC,eAAO,KAAK;AAAA,MACd;AAEA,eAAS,6BAA6B,OAAO,eAAe;AAC1D;AACE,cAAI,kBAAkB,KAAK,GAAG;AAC5B,kBAAM,8HAAmI,eAAeD,UAAS,KAAK,CAAC;AAEvK,mBAAO,mBAAmB,KAAK;AAAA,UAChC;AAAA,QACF;AAAA,MACH;AACA,eAAS,uBAAuB,OAAO;AACrC;AACE,cAAI,kBAAkB,KAAK,GAAG;AAC5B,kBAAM,mHAAwHA,UAAS,KAAK,CAAC;AAE7I,mBAAO,mBAAmB,KAAK;AAAA,UAChC;AAAA,QACF;AAAA,MACH;AACA,eAAS,wBAAwB,OAAO,UAAU;AAChD;AACE,cAAI,kBAAkB,KAAK,GAAG;AAC5B,kBAAM,yHAA8H,UAAUA,UAAS,KAAK,CAAC;AAE7J,mBAAO,mBAAmB,KAAK;AAAA,UAChC;AAAA,QACF;AAAA,MACH;AACA,eAAS,+BAA+B,OAAO,UAAU;AACvD;AACE,cAAI,kBAAkB,KAAK,GAAG;AAC5B,kBAAM,iIAAsI,UAAUA,UAAS,KAAK,CAAC;AAErK,mBAAO,mBAAmB,KAAK;AAAA,UAChC;AAAA,QACF;AAAA,MACH;AACA,eAAS,wBAAwB,OAAO;AACtC;AACE,cAAI,kBAAkB,KAAK,GAAG;AAC5B,kBAAM,qIAA0IA,UAAS,KAAK,CAAC;AAE/J,mBAAO,mBAAmB,KAAK;AAAA,UAChC;AAAA,QACF;AAAA,MACH;AACA,eAAS,kCAAkC,OAAO;AAChD;AACE,cAAI,kBAAkB,KAAK,GAAG;AAC5B,kBAAM,0KAAoLA,UAAS,KAAK,CAAC;AAEzM,mBAAO,mBAAmB,KAAK;AAAA,UAChC;AAAA,QACF;AAAA,MACH;AAIA,UAAI,WAAW;AAGf,UAAI,SAAS;AAKb,UAAI,oBAAoB;AAIxB,UAAI,UAAU;AAKd,UAAI,qBAAqB;AAGzB,UAAI,UAAU;AAGd,UAAI,mBAAmB;AAGvB,UAAI,4BAA4B;AAGhC,UAAI,sBAAsB,4BAA4B;AACtD,UAAI,6BAA6B,IAAI,OAAO,OAAO,4BAA4B,OAAO,sBAAsB,KAAK;AACjH,UAAI,4BAA4B,CAAA;AAChC,UAAI,8BAA8B,CAAA;AAClC,eAAS,oBAAoB,eAAe;AAC1C,YAAI,eAAe,KAAK,6BAA6B,aAAa,GAAG;AACnE,iBAAO;AAAA,QACR;AAED,YAAI,eAAe,KAAK,2BAA2B,aAAa,GAAG;AACjE,iBAAO;AAAA,QACR;AAED,YAAI,2BAA2B,KAAK,aAAa,GAAG;AAClD,sCAA4B,aAAa,IAAI;AAC7C,iBAAO;AAAA,QACR;AAED,kCAA0B,aAAa,IAAI;AAE3C;AACE,gBAAM,gCAAgC,aAAa;AAAA,QACpD;AAED,eAAO;AAAA,MACT;AACA,eAAS,sBAAsBU,OAAM,cAAc,sBAAsB;AACvE,YAAI,iBAAiB,MAAM;AACzB,iBAAO,aAAa,SAAS;AAAA,QAC9B;AAED,YAAI,sBAAsB;AACxB,iBAAO;AAAA,QACR;AAED,YAAIA,MAAK,SAAS,MAAMA,MAAK,CAAC,MAAM,OAAOA,MAAK,CAAC,MAAM,SAASA,MAAK,CAAC,MAAM,OAAOA,MAAK,CAAC,MAAM,MAAM;AACnG,iBAAO;AAAA,QACR;AAED,eAAO;AAAA,MACT;AACA,eAAS,iCAAiCA,OAAM,OAAO,cAAc,sBAAsB;AACzF,YAAI,iBAAiB,QAAQ,aAAa,SAAS,UAAU;AAC3D,iBAAO;AAAA,QACR;AAED,gBAAQ,OAAO,OAAK;AAAA,UAClB,KAAK;AAAA,UAEL,KAAK;AAEH,mBAAO;AAAA,UAET,KAAK,WACH;AACE,gBAAI,sBAAsB;AACxB,qBAAO;AAAA,YACR;AAED,gBAAI,iBAAiB,MAAM;AACzB,qBAAO,CAAC,aAAa;AAAA,YAC/B,OAAe;AACL,kBAAIiG,UAASjG,MAAK,YAAW,EAAG,MAAM,GAAG,CAAC;AAC1C,qBAAOiG,YAAW,WAAWA,YAAW;AAAA,YACzC;AAAA,UACF;AAAA,UAEH;AACE,mBAAO;AAAA,QACV;AAAA,MACH;AACA,eAAS,sBAAsBjG,OAAM,OAAO,cAAc,sBAAsB;AAC9E,YAAI,UAAU,QAAQ,OAAO,UAAU,aAAa;AAClD,iBAAO;AAAA,QACR;AAED,YAAI,iCAAiCA,OAAM,OAAO,cAAc,oBAAoB,GAAG;AACrF,iBAAO;AAAA,QACR;AAED,YAAI,sBAAsB;AAExB,iBAAO;AAAA,QACR;AAED,YAAI,iBAAiB,MAAM;AAEzB,kBAAQ,aAAa,MAAI;AAAA,YACvB,KAAK;AACH,qBAAO,CAAC;AAAA,YAEV,KAAK;AACH,qBAAO,UAAU;AAAA,YAEnB,KAAK;AACH,qBAAO,MAAM,KAAK;AAAA,YAEpB,KAAK;AACH,qBAAO,MAAM,KAAK,KAAK,QAAQ;AAAA,UAClC;AAAA,QACF;AAED,eAAO;AAAA,MACT;AACA,eAAS,gBAAgBA,OAAM;AAC7B,eAAO,WAAW,eAAeA,KAAI,IAAI,WAAWA,KAAI,IAAI;AAAA,MAC9D;AAEA,eAAS,mBAAmBA,OAAM,MAAM,iBAAiB,eAAe,oBAAoBkG,cAAa,mBAAmB;AAC1H,aAAK,kBAAkB,SAAS,qBAAqB,SAAS,WAAW,SAAS;AAClF,aAAK,gBAAgB;AACrB,aAAK,qBAAqB;AAC1B,aAAK,kBAAkB;AACvB,aAAK,eAAelG;AACpB,aAAK,OAAO;AACZ,aAAK,cAAckG;AACnB,aAAK,oBAAoB;AAAA,MAC3B;AAKA,UAAI,aAAa,CAAA;AAEjB,UAAI,gBAAgB;AAAA,QAAC;AAAA,QAAY;AAAA;AAAA;AAAA;AAAA,QAGjC;AAAA,QAAgB;AAAA,QAAkB;AAAA,QAAa;AAAA,QAAkC;AAAA,QAA4B;AAAA,MAAO;AAEpH,oBAAc,QAAQ,SAAUlG,OAAM;AACpC,mBAAWA,KAAI,IAAI,IAAI;AAAA,UAAmBA;AAAA,UAAM;AAAA,UAAU;AAAA;AAAA,UAC1DA;AAAA;AAAA,UACA;AAAA;AAAA,UACA;AAAA;AAAA,UACA;AAAA,QAAK;AAAA,MACP,CAAC;AAGD,OAAC,CAAC,iBAAiB,gBAAgB,GAAG,CAAC,aAAa,OAAO,GAAG,CAAC,WAAW,KAAK,GAAG,CAAC,aAAa,YAAY,CAAC,EAAE,QAAQ,SAAU,MAAM;AACrI,YAAIA,QAAO,KAAK,CAAC,GACb,gBAAgB,KAAK,CAAC;AAC1B,mBAAWA,KAAI,IAAI,IAAI;AAAA,UAAmBA;AAAA,UAAM;AAAA,UAAQ;AAAA;AAAA,UACxD;AAAA;AAAA,UACA;AAAA;AAAA,UACA;AAAA;AAAA,UACA;AAAA,QAAK;AAAA,MACP,CAAC;AAID,OAAC,mBAAmB,aAAa,cAAc,OAAO,EAAE,QAAQ,SAAUA,OAAM;AAC9E,mBAAWA,KAAI,IAAI,IAAI;AAAA,UAAmBA;AAAA,UAAM;AAAA,UAAmB;AAAA;AAAA,UACnEA,MAAK,YAAa;AAAA;AAAA,UAClB;AAAA;AAAA,UACA;AAAA;AAAA,UACA;AAAA,QAAK;AAAA,MACP,CAAC;AAKD,OAAC,eAAe,6BAA6B,aAAa,eAAe,EAAE,QAAQ,SAAUA,OAAM;AACjG,mBAAWA,KAAI,IAAI,IAAI;AAAA,UAAmBA;AAAA,UAAM;AAAA,UAAmB;AAAA;AAAA,UACnEA;AAAA;AAAA,UACA;AAAA;AAAA,UACA;AAAA;AAAA,UACA;AAAA,QAAK;AAAA,MACP,CAAC;AAED;AAAA,QAAC;AAAA,QAAmB;AAAA;AAAA;AAAA,QAEpB;AAAA,QAAa;AAAA,QAAY;AAAA,QAAY;AAAA,QAAW;AAAA,QAAS;AAAA,QAAY;AAAA,QAA2B;AAAA,QAAyB;AAAA,QAAkB;AAAA,QAAU;AAAA,QAAQ;AAAA,QAAY;AAAA,QAAc;AAAA,QAAQ;AAAA,QAAe;AAAA,QAAY;AAAA,QAAY;AAAA,QAAY;AAAA,QAAU;AAAA;AAAA,QAC5P;AAAA,MAAW,EAAE,QAAQ,SAAUA,OAAM;AACnC,mBAAWA,KAAI,IAAI,IAAI;AAAA,UAAmBA;AAAA,UAAM;AAAA,UAAS;AAAA;AAAA,UACzDA,MAAK,YAAa;AAAA;AAAA,UAClB;AAAA;AAAA,UACA;AAAA;AAAA,UACA;AAAA,QAAK;AAAA,MACP,CAAC;AAGD;AAAA,QAAC;AAAA;AAAA;AAAA,QAED;AAAA,QAAY;AAAA,QAAS;AAAA;AAAA;AAAA;AAAA,MAGrB,EAAE,QAAQ,SAAUA,OAAM;AACxB,mBAAWA,KAAI,IAAI,IAAI;AAAA,UAAmBA;AAAA,UAAM;AAAA,UAAS;AAAA;AAAA,UACzDA;AAAA;AAAA,UACA;AAAA;AAAA,UACA;AAAA;AAAA,UACA;AAAA,QAAK;AAAA,MACP,CAAC;AAGD;AAAA,QAAC;AAAA,QAAW;AAAA;AAAA;AAAA;AAAA,MAGZ,EAAE,QAAQ,SAAUA,OAAM;AACxB,mBAAWA,KAAI,IAAI,IAAI;AAAA,UAAmBA;AAAA,UAAM;AAAA,UAAoB;AAAA;AAAA,UACpEA;AAAA;AAAA,UACA;AAAA;AAAA,UACA;AAAA;AAAA,UACA;AAAA,QAAK;AAAA,MACP,CAAC;AAED;AAAA,QAAC;AAAA,QAAQ;AAAA,QAAQ;AAAA,QAAQ;AAAA;AAAA;AAAA;AAAA,MAGzB,EAAE,QAAQ,SAAUA,OAAM;AACxB,mBAAWA,KAAI,IAAI,IAAI;AAAA,UAAmBA;AAAA,UAAM;AAAA,UAAkB;AAAA;AAAA,UAClEA;AAAA;AAAA,UACA;AAAA;AAAA,UACA;AAAA;AAAA,UACA;AAAA,QAAK;AAAA,MACP,CAAC;AAED,OAAC,WAAW,OAAO,EAAE,QAAQ,SAAUA,OAAM;AAC3C,mBAAWA,KAAI,IAAI,IAAI;AAAA,UAAmBA;AAAA,UAAM;AAAA,UAAS;AAAA;AAAA,UACzDA,MAAK,YAAa;AAAA;AAAA,UAClB;AAAA;AAAA,UACA;AAAA;AAAA,UACA;AAAA,QAAK;AAAA,MACP,CAAC;AACD,UAAI,WAAW;AAEf,UAAI,aAAa,SAAU,OAAO;AAChC,eAAO,MAAM,CAAC,EAAE;MAClB;AAOA;AAAA,QAAC;AAAA,QAAiB;AAAA,QAAsB;AAAA,QAAe;AAAA,QAAkB;AAAA,QAAc;AAAA,QAAa;AAAA,QAAa;AAAA,QAAuB;AAAA,QAA+B;AAAA,QAAiB;AAAA,QAAmB;AAAA,QAAqB;AAAA,QAAqB;AAAA,QAAgB;AAAA,QAAa;AAAA,QAAe;AAAA,QAAiB;AAAA,QAAe;AAAA,QAAa;AAAA,QAAoB;AAAA,QAAgB;AAAA,QAAc;AAAA,QAAgB;AAAA,QAAe;AAAA,QAAc;AAAA,QAAgC;AAAA,QAA8B;AAAA,QAAe;AAAA,QAAkB;AAAA,QAAmB;AAAA,QAAkB;AAAA,QAAkB;AAAA,QAAc;AAAA,QAAc;AAAA,QAAgB;AAAA,QAAqB;AAAA,QAAsB;AAAA,QAAe;AAAA,QAAY;AAAA,QAAkB;AAAA,QAAoB;AAAA,QAAmB;AAAA,QAAc;AAAA,QAAgB;AAAA,QAA0B;AAAA,QAA2B;AAAA,QAAoB;AAAA,QAAqB;AAAA,QAAkB;AAAA,QAAmB;AAAA,QAAqB;AAAA,QAAkB;AAAA,QAAgB;AAAA,QAAe;AAAA,QAAmB;AAAA,QAAkB;AAAA,QAAsB;AAAA,QAAuB;AAAA,QAAgB;AAAA,QAAiB;AAAA,QAAgB;AAAA,QAAgB;AAAA,QAAa;AAAA,QAAiB;AAAA,QAAkB;AAAA,QAAiB;AAAA,QAAc;AAAA,QAAiB;AAAA,QAAiB;AAAA,QAAgB;AAAA,QAAgB;AAAA,QAAe;AAAA;AAAA;AAAA;AAAA,MAGxwC,EAAE,QAAQ,SAAU,eAAe;AACjC,YAAIA,QAAO,cAAc,QAAQ,UAAU,UAAU;AACrD,mBAAWA,KAAI,IAAI,IAAI;AAAA,UAAmBA;AAAA,UAAM;AAAA,UAAQ;AAAA;AAAA,UACxD;AAAA,UAAe;AAAA;AAAA,UACf;AAAA;AAAA,UACA;AAAA,QAAK;AAAA,MACP,CAAC;AAED;AAAA,QAAC;AAAA,QAAiB;AAAA,QAAiB;AAAA,QAAc;AAAA,QAAc;AAAA,QAAe;AAAA;AAAA;AAAA;AAAA,MAG9E,EAAE,QAAQ,SAAU,eAAe;AACjC,YAAIA,QAAO,cAAc,QAAQ,UAAU,UAAU;AACrD,mBAAWA,KAAI,IAAI,IAAI;AAAA,UAAmBA;AAAA,UAAM;AAAA,UAAQ;AAAA;AAAA,UACxD;AAAA,UAAe;AAAA,UAAgC;AAAA;AAAA,UAC/C;AAAA,QAAK;AAAA,MACP,CAAC;AAED;AAAA,QAAC;AAAA,QAAY;AAAA,QAAY;AAAA;AAAA;AAAA;AAAA,MAGzB,EAAE,QAAQ,SAAU,eAAe;AACjC,YAAIA,QAAO,cAAc,QAAQ,UAAU,UAAU;AACrD,mBAAWA,KAAI,IAAI,IAAI;AAAA,UAAmBA;AAAA,UAAM;AAAA,UAAQ;AAAA;AAAA,UACxD;AAAA,UAAe;AAAA,UAAwC;AAAA;AAAA,UACvD;AAAA,QAAK;AAAA,MACP,CAAC;AAID,OAAC,YAAY,aAAa,EAAE,QAAQ,SAAU,eAAe;AAC3D,mBAAW,aAAa,IAAI,IAAI;AAAA,UAAmB;AAAA,UAAe;AAAA,UAAQ;AAAA;AAAA,UAC1E,cAAc,YAAa;AAAA;AAAA,UAC3B;AAAA;AAAA,UACA;AAAA;AAAA,UACA;AAAA,QAAK;AAAA,MACP,CAAC;AAGD,UAAI,YAAY;AAChB,iBAAW,SAAS,IAAI,IAAI;AAAA,QAAmB;AAAA,QAAa;AAAA,QAAQ;AAAA;AAAA,QACpE;AAAA,QAAc;AAAA,QAAgC;AAAA;AAAA,QAC9C;AAAA,MAAK;AACL,OAAC,OAAO,QAAQ,UAAU,YAAY,EAAE,QAAQ,SAAU,eAAe;AACvE,mBAAW,aAAa,IAAI,IAAI;AAAA,UAAmB;AAAA,UAAe;AAAA,UAAQ;AAAA;AAAA,UAC1E,cAAc,YAAa;AAAA;AAAA,UAC3B;AAAA;AAAA,UACA;AAAA;AAAA,UACA;AAAA,QAAI;AAAA,MACN,CAAC;AAYD,UAAI,uBAAuB;AAC3B,UAAI,UAAU;AAEd,eAAS,YAAY,KAAK;AACxB;AACE,cAAI,CAAC,WAAW,qBAAqB,KAAK,GAAG,GAAG;AAC9C,sBAAU;AAEV,kBAAM,8NAAwO,KAAK,UAAU,GAAG,CAAC;AAAA,UAClQ;AAAA,QACF;AAAA,MACH;AAOA,eAAS,oBAAoB,MAAMA,OAAM,UAAU,cAAc;AAC/D;AACE,cAAI,aAAa,iBAAiB;AAChC,gBAAImG,gBAAe,aAAa;AAChC,mBAAO,KAAKA,aAAY;AAAA,UAC9B,OAAW;AAIL;AACE,2CAA6B,UAAUnG,KAAI;AAAA,YAC5C;AAED,gBAAK,aAAa,aAAa;AAK7B,0BAAY,KAAK,QAAQ;AAAA,YAC1B;AAED,gBAAI,gBAAgB,aAAa;AACjC,gBAAI,cAAc;AAElB,gBAAI,aAAa,SAAS,oBAAoB;AAC5C,kBAAI,KAAK,aAAa,aAAa,GAAG;AACpC,oBAAI,QAAQ,KAAK,aAAa,aAAa;AAE3C,oBAAI,UAAU,IAAI;AAChB,yBAAO;AAAA,gBACR;AAED,oBAAI,sBAAsBA,OAAM,UAAU,cAAc,KAAK,GAAG;AAC9D,yBAAO;AAAA,gBACR;AAGD,oBAAI,UAAU,KAAK,UAAU;AAC3B,yBAAO;AAAA,gBACR;AAED,uBAAO;AAAA,cACR;AAAA,YACF,WAAU,KAAK,aAAa,aAAa,GAAG;AAC3C,kBAAI,sBAAsBA,OAAM,UAAU,cAAc,KAAK,GAAG;AAG9D,uBAAO,KAAK,aAAa,aAAa;AAAA,cACvC;AAED,kBAAI,aAAa,SAAS,SAAS;AAGjC,uBAAO;AAAA,cACR;AAMD,4BAAc,KAAK,aAAa,aAAa;AAAA,YAC9C;AAED,gBAAI,sBAAsBA,OAAM,UAAU,cAAc,KAAK,GAAG;AAC9D,qBAAO,gBAAgB,OAAO,WAAW;AAAA,YACjD,WAAiB,gBAAgB,KAAK,UAAU;AACxC,qBAAO;AAAA,YACf,OAAa;AACL,qBAAO;AAAA,YACR;AAAA,UACF;AAAA,QACF;AAAA,MACH;AAOA,eAAS,qBAAqB,MAAMA,OAAM,UAAU,sBAAsB;AACxE;AACE,cAAI,CAAC,oBAAoBA,KAAI,GAAG;AAC9B;AAAA,UACD;AAED,cAAI,CAAC,KAAK,aAAaA,KAAI,GAAG;AAC5B,mBAAO,aAAa,SAAY,SAAY;AAAA,UAC7C;AAED,cAAI,QAAQ,KAAK,aAAaA,KAAI;AAElC;AACE,yCAA6B,UAAUA,KAAI;AAAA,UAC5C;AAED,cAAI,UAAU,KAAK,UAAU;AAC3B,mBAAO;AAAA,UACR;AAED,iBAAO;AAAA,QACR;AAAA,MACH;AASA,eAAS,oBAAoB,MAAMA,OAAM,OAAO,sBAAsB;AACpE,YAAI,eAAe,gBAAgBA,KAAI;AAEvC,YAAI,sBAAsBA,OAAM,cAAc,oBAAoB,GAAG;AACnE;AAAA,QACD;AAED,YAAI,sBAAsBA,OAAM,OAAO,cAAc,oBAAoB,GAAG;AAC1E,kBAAQ;AAAA,QACT;AAGD,YAAI,wBAAwB,iBAAiB,MAAM;AACjD,cAAI,oBAAoBA,KAAI,GAAG;AAC7B,gBAAI,iBAAiBA;AAErB,gBAAI,UAAU,MAAM;AAClB,mBAAK,gBAAgB,cAAc;AAAA,YAC3C,OAAa;AACL;AACE,6CAA6B,OAAOA,KAAI;AAAA,cACzC;AAED,mBAAK,aAAa,gBAAiB,KAAK,KAAK;AAAA,YAC9C;AAAA,UACF;AAED;AAAA,QACD;AAED,YAAI,kBAAkB,aAAa;AAEnC,YAAI,iBAAiB;AACnB,cAAImG,gBAAe,aAAa;AAEhC,cAAI,UAAU,MAAM;AAClB,gBAAI,OAAO,aAAa;AACxB,iBAAKA,aAAY,IAAI,SAAS,UAAU,QAAQ;AAAA,UACtD,OAAW;AAGL,iBAAKA,aAAY,IAAI;AAAA,UACtB;AAED;AAAA,QACD;AAGD,YAAI,gBAAgB,aAAa,eAC7B,qBAAqB,aAAa;AAEtC,YAAI,UAAU,MAAM;AAClB,eAAK,gBAAgB,aAAa;AAAA,QACtC,OAAS;AACL,cAAI,QAAQ,aAAa;AACzB,cAAI;AAEJ,cAAI,UAAU,WAAW,UAAU,sBAAsB,UAAU,MAAM;AAGvE,6BAAiB;AAAA,UACvB,OAAW;AAGL;AACE;AACE,6CAA6B,OAAO,aAAa;AAAA,cAClD;AAED,+BAAiB,KAAK;AAAA,YACvB;AAED,gBAAI,aAAa,aAAa;AAC5B,0BAAY,eAAe,SAAQ,CAAE;AAAA,YACtC;AAAA,UACF;AAED,cAAI,oBAAoB;AACtB,iBAAK,eAAe,oBAAoB,eAAe,cAAc;AAAA,UAC3E,OAAW;AACL,iBAAK,aAAa,eAAe,cAAc;AAAA,UAChD;AAAA,QACF;AAAA,MACH;AAMA,UAAI,qBAAqB,OAAO,IAAI,eAAe;AACnD,UAAI,oBAAoB,OAAO,IAAI,cAAc;AACjD,UAAI,sBAAsB,OAAO,IAAI,gBAAgB;AACrD,UAAI,yBAAyB,OAAO,IAAI,mBAAmB;AAC3D,UAAI,sBAAsB,OAAO,IAAI,gBAAgB;AACrD,UAAI,sBAAsB,OAAO,IAAI,gBAAgB;AACrD,UAAI,qBAAqB,OAAO,IAAI,eAAe;AACnD,UAAI,yBAAyB,OAAO,IAAI,mBAAmB;AAC3D,UAAI,sBAAsB,OAAO,IAAI,gBAAgB;AACrD,UAAI,2BAA2B,OAAO,IAAI,qBAAqB;AAC/D,UAAI,kBAAkB,OAAO,IAAI,YAAY;AAC7C,UAAI,kBAAkB,OAAO,IAAI,YAAY;AAC7C,UAAI,mBAAmB,OAAO,IAAI,aAAa;AAC/C,UAAI,gCAAgC,OAAO,IAAI,wBAAwB;AACvE,UAAI,uBAAuB,OAAO,IAAI,iBAAiB;AACvD,UAAI,2BAA2B,OAAO,IAAI,qBAAqB;AAC/D,UAAI,mBAAmB,OAAO,IAAI,aAAa;AAC/C,UAAI,4BAA4B,OAAO,IAAI,sBAAsB;AACjE,UAAI,wBAAwB,OAAO;AACnC,UAAI,uBAAuB;AAC3B,eAAS,cAAc,eAAe;AACpC,YAAI,kBAAkB,QAAQ,OAAO,kBAAkB,UAAU;AAC/D,iBAAO;AAAA,QACR;AAED,YAAI,gBAAgB,yBAAyB,cAAc,qBAAqB,KAAK,cAAc,oBAAoB;AAEvH,YAAI,OAAO,kBAAkB,YAAY;AACvC,iBAAO;AAAA,QACR;AAED,eAAO;AAAA,MACT;AAEA,UAAI,SAAS,OAAO;AAMpB,UAAI,gBAAgB;AACpB,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AAEJ,eAAS,cAAc;AAAA,MAAE;AAEzB,kBAAY,qBAAqB;AACjC,eAAS,cAAc;AACrB;AACE,cAAI,kBAAkB,GAAG;AAEvB,sBAAU,QAAQ;AAClB,uBAAW,QAAQ;AACnB,uBAAW,QAAQ;AACnB,wBAAY,QAAQ;AACpB,wBAAY,QAAQ;AACpB,iCAAqB,QAAQ;AAC7B,2BAAe,QAAQ;AAEvB,gBAAI,QAAQ;AAAA,cACV,cAAc;AAAA,cACd,YAAY;AAAA,cACZ,OAAO;AAAA,cACP,UAAU;AAAA,YAClB;AAEM,mBAAO,iBAAiB,SAAS;AAAA,cAC/B,MAAM;AAAA,cACN,KAAK;AAAA,cACL,MAAM;AAAA,cACN,OAAO;AAAA,cACP,OAAO;AAAA,cACP,gBAAgB;AAAA,cAChB,UAAU;AAAA,YAClB,CAAO;AAAA,UAEF;AAED;AAAA,QACD;AAAA,MACH;AACA,eAAS,eAAe;AACtB;AACE;AAEA,cAAI,kBAAkB,GAAG;AAEvB,gBAAI,QAAQ;AAAA,cACV,cAAc;AAAA,cACd,YAAY;AAAA,cACZ,UAAU;AAAA,YAClB;AAEM,mBAAO,iBAAiB,SAAS;AAAA,cAC/B,KAAK,OAAO,CAAE,GAAE,OAAO;AAAA,gBACrB,OAAO;AAAA,cACjB,CAAS;AAAA,cACD,MAAM,OAAO,CAAE,GAAE,OAAO;AAAA,gBACtB,OAAO;AAAA,cACjB,CAAS;AAAA,cACD,MAAM,OAAO,CAAE,GAAE,OAAO;AAAA,gBACtB,OAAO;AAAA,cACjB,CAAS;AAAA,cACD,OAAO,OAAO,CAAE,GAAE,OAAO;AAAA,gBACvB,OAAO;AAAA,cACjB,CAAS;AAAA,cACD,OAAO,OAAO,CAAE,GAAE,OAAO;AAAA,gBACvB,OAAO;AAAA,cACjB,CAAS;AAAA,cACD,gBAAgB,OAAO,CAAE,GAAE,OAAO;AAAA,gBAChC,OAAO;AAAA,cACjB,CAAS;AAAA,cACD,UAAU,OAAO,CAAE,GAAE,OAAO;AAAA,gBAC1B,OAAO;AAAA,cACjB,CAAS;AAAA,YACT,CAAO;AAAA,UAEF;AAED,cAAI,gBAAgB,GAAG;AACrB,kBAAM,8EAAmF;AAAA,UAC1F;AAAA,QACF;AAAA,MACH;AAEA,UAAI,yBAAyB,qBAAqB;AAClD,UAAI;AACJ,eAAS,8BAA8BnG,OAAM,QAAQ,SAAS;AAC5D;AACE,cAAI,WAAW,QAAW;AAExB,gBAAI;AACF,oBAAM,MAAK;AAAA,YACZ,SAAQR,IAAG;AACV,kBAAI,QAAQA,GAAE,MAAM,KAAI,EAAG,MAAM,cAAc;AAC/C,uBAAS,SAAS,MAAM,CAAC,KAAK;AAAA,YAC/B;AAAA,UACF;AAGD,iBAAO,OAAO,SAASQ;AAAA,QACxB;AAAA,MACH;AACA,UAAI,UAAU;AACd,UAAI;AAEJ;AACE,YAAI,kBAAkB,OAAO,YAAY,aAAa,UAAU;AAChE,8BAAsB,IAAI;MAC5B;AAEA,eAAS,6BAA6B,IAAI,WAAW;AAEnD,YAAK,CAAC,MAAM,SAAS;AACnB,iBAAO;AAAA,QACR;AAED;AACE,cAAI,QAAQ,oBAAoB,IAAI,EAAE;AAEtC,cAAI,UAAU,QAAW;AACvB,mBAAO;AAAA,UACR;AAAA,QACF;AAED,YAAI;AACJ,kBAAU;AACV,YAAI,4BAA4B,MAAM;AAEtC,cAAM,oBAAoB;AAC1B,YAAI;AAEJ;AACE,+BAAqB,uBAAuB;AAG5C,iCAAuB,UAAU;AACjC;QACD;AAED,YAAI;AAEF,cAAI,WAAW;AAEb,gBAAI,OAAO,WAAY;AACrB,oBAAM,MAAK;AAAA,YACnB;AAGM,mBAAO,eAAe,KAAK,WAAW,SAAS;AAAA,cAC7C,KAAK,WAAY;AAGf,sBAAM,MAAK;AAAA,cACZ;AAAA,YACT,CAAO;AAED,gBAAI,OAAO,YAAY,YAAY,QAAQ,WAAW;AAGpD,kBAAI;AACF,wBAAQ,UAAU,MAAM,CAAA,CAAE;AAAA,cAC3B,SAAQR,IAAG;AACV,0BAAUA;AAAA,cACX;AAED,sBAAQ,UAAU,IAAI,CAAE,GAAE,IAAI;AAAA,YACtC,OAAa;AACL,kBAAI;AACF,qBAAK,KAAI;AAAA,cACV,SAAQA,IAAG;AACV,0BAAUA;AAAA,cACX;AAED,iBAAG,KAAK,KAAK,SAAS;AAAA,YACvB;AAAA,UACP,OAAW;AACL,gBAAI;AACF,oBAAM,MAAK;AAAA,YACZ,SAAQA,IAAG;AACV,wBAAUA;AAAA,YACX;AAED;UACD;AAAA,QACF,SAAQ,QAAQ;AAEf,cAAI,UAAU,WAAW,OAAO,OAAO,UAAU,UAAU;AAGzD,gBAAI,cAAc,OAAO,MAAM,MAAM,IAAI;AACzC,gBAAI,eAAe,QAAQ,MAAM,MAAM,IAAI;AAC3C,gBAAIU,KAAI,YAAY,SAAS;AAC7B,gBAAIN,KAAI,aAAa,SAAS;AAE9B,mBAAOM,MAAK,KAAKN,MAAK,KAAK,YAAYM,EAAC,MAAM,aAAaN,EAAC,GAAG;AAO7D,cAAAA;AAAA,YACD;AAED,mBAAOM,MAAK,KAAKN,MAAK,GAAGM,MAAKN,MAAK;AAGjC,kBAAI,YAAYM,EAAC,MAAM,aAAaN,EAAC,GAAG;AAMtC,oBAAIM,OAAM,KAAKN,OAAM,GAAG;AACtB,qBAAG;AACD,oBAAAM;AACA,oBAAAN;AAGA,wBAAIA,KAAI,KAAK,YAAYM,EAAC,MAAM,aAAaN,EAAC,GAAG;AAE/C,0BAAI,SAAS,OAAO,YAAYM,EAAC,EAAE,QAAQ,YAAY,MAAM;AAK7D,0BAAI,GAAG,eAAe,OAAO,SAAS,aAAa,GAAG;AACpD,iCAAS,OAAO,QAAQ,eAAe,GAAG,WAAW;AAAA,sBACtD;AAED;AACE,4BAAI,OAAO,OAAO,YAAY;AAC5B,8CAAoB,IAAI,IAAI,MAAM;AAAA,wBACnC;AAAA,sBACF;AAGD,6BAAO;AAAA,oBACR;AAAA,kBACF,SAAQA,MAAK,KAAKN,MAAK;AAAA,gBACzB;AAED;AAAA,cACD;AAAA,YACF;AAAA,UACF;AAAA,QACL,UAAY;AACR,oBAAU;AAEV;AACE,mCAAuB,UAAU;AACjC;UACD;AAED,gBAAM,oBAAoB;AAAA,QAC3B;AAGD,YAAII,QAAO,KAAK,GAAG,eAAe,GAAG,OAAO;AAC5C,YAAI,iBAAiBA,QAAO,8BAA8BA,KAAI,IAAI;AAElE;AACE,cAAI,OAAO,OAAO,YAAY;AAC5B,gCAAoB,IAAI,IAAI,cAAc;AAAA,UAC3C;AAAA,QACF;AAED,eAAO;AAAA,MACT;AAEA,eAAS,4BAA4B,MAAM,QAAQ,SAAS;AAC1D;AACE,iBAAO,6BAA6B,MAAM,IAAI;AAAA,QAC/C;AAAA,MACH;AACA,eAAS,+BAA+B,IAAI,QAAQ,SAAS;AAC3D;AACE,iBAAO,6BAA6B,IAAI,KAAK;AAAA,QAC9C;AAAA,MACH;AAEA,eAAS,gBAAgB,WAAW;AAClC,YAAI,YAAY,UAAU;AAC1B,eAAO,CAAC,EAAE,aAAa,UAAU;AAAA,MACnC;AAEA,eAAS,qCAAqC,MAAM,QAAQ,SAAS;AAEnE,YAAI,QAAQ,MAAM;AAChB,iBAAO;AAAA,QACR;AAED,YAAI,OAAO,SAAS,YAAY;AAC9B;AACE,mBAAO,6BAA6B,MAAM,gBAAgB,IAAI,CAAC;AAAA,UAChE;AAAA,QACF;AAED,YAAI,OAAO,SAAS,UAAU;AAC5B,iBAAO,8BAA8B,IAAI;AAAA,QAC1C;AAED,gBAAQ,MAAI;AAAA,UACV,KAAK;AACH,mBAAO,8BAA8B,UAAU;AAAA,UAEjD,KAAK;AACH,mBAAO,8BAA8B,cAAc;AAAA,QACtD;AAED,YAAI,OAAO,SAAS,UAAU;AAC5B,kBAAQ,KAAK,UAAQ;AAAA,YACnB,KAAK;AACH,qBAAO,+BAA+B,KAAK,MAAM;AAAA,YAEnD,KAAK;AAEH,qBAAO,qCAAqC,KAAK,MAAM,QAAQ,OAAO;AAAA,YAExE,KAAK,iBACH;AACE,kBAAI,gBAAgB;AACpB,kBAAI,UAAU,cAAc;AAC5B,kBAAI,OAAO,cAAc;AAEzB,kBAAI;AAEF,uBAAO,qCAAqC,KAAK,OAAO,GAAG,QAAQ,OAAO;AAAA,cACtF,SAAmBR,IAAG;AAAA,cAAE;AAAA,YACf;AAAA,UACJ;AAAA,QACF;AAED,eAAO;AAAA,MACT;AAEA,eAAS,cAAc,OAAO;AACf,cAAM,cAAc,MAAM,YAAY,OAAO;AAC5C,cAAM;AAEpB,gBAAQ,MAAM,KAAG;AAAA,UACf,KAAK;AACH,mBAAO,8BAA8B,MAAM,IAAI;AAAA,UAEjD,KAAK;AACH,mBAAO,8BAA8B,MAAM;AAAA,UAE7C,KAAK;AACH,mBAAO,8BAA8B,UAAU;AAAA,UAEjD,KAAK;AACH,mBAAO,8BAA8B,cAAc;AAAA,UAErD,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AACH,mBAAO,+BAA+B,MAAM,IAAI;AAAA,UAElD,KAAK;AACH,mBAAO,+BAA+B,MAAM,KAAK,MAAM;AAAA,UAEzD,KAAK;AACH,mBAAO,4BAA4B,MAAM,IAAI;AAAA,UAE/C;AACE,mBAAO;AAAA,QACV;AAAA,MACH;AAEA,eAAS,4BAA4B4G,iBAAgB;AACnD,YAAI;AACF,cAAI,OAAO;AACX,cAAI,OAAOA;AAEX,aAAG;AACD,oBAAQ,cAAc,IAAI;AAC1B,mBAAO,KAAK;AAAA,UACb,SAAQ;AAET,iBAAO;AAAA,QACR,SAAQ5G,IAAG;AACV,iBAAO,+BAA+BA,GAAE,UAAU,OAAOA,GAAE;AAAA,QAC5D;AAAA,MACH;AAEA,eAAS,eAAe,WAAW,WAAW,aAAa;AACzD,YAAI,cAAc,UAAU;AAE5B,YAAI,aAAa;AACf,iBAAO;AAAA,QACR;AAED,YAAI,eAAe,UAAU,eAAe,UAAU,QAAQ;AAC9D,eAAO,iBAAiB,KAAK,cAAc,MAAM,eAAe,MAAM;AAAA,MACxE;AAGA,eAAS,eAAe,MAAM;AAC5B,eAAO,KAAK,eAAe;AAAA,MAC7B;AAGA,eAAS,yBAAyB,MAAM;AACtC,YAAI,QAAQ,MAAM;AAEhB,iBAAO;AAAA,QACR;AAED;AACE,cAAI,OAAO,KAAK,QAAQ,UAAU;AAChC,kBAAM,mHAAwH;AAAA,UAC/H;AAAA,QACF;AAED,YAAI,OAAO,SAAS,YAAY;AAC9B,iBAAO,KAAK,eAAe,KAAK,QAAQ;AAAA,QACzC;AAED,YAAI,OAAO,SAAS,UAAU;AAC5B,iBAAO;AAAA,QACR;AAED,gBAAQ,MAAI;AAAA,UACV,KAAK;AACH,mBAAO;AAAA,UAET,KAAK;AACH,mBAAO;AAAA,UAET,KAAK;AACH,mBAAO;AAAA,UAET,KAAK;AACH,mBAAO;AAAA,UAET,KAAK;AACH,mBAAO;AAAA,UAET,KAAK;AACH,mBAAO;AAAA,QAEV;AAED,YAAI,OAAO,SAAS,UAAU;AAC5B,kBAAQ,KAAK,UAAQ;AAAA,YACnB,KAAK;AACH,kBAAI,UAAU;AACd,qBAAO,eAAe,OAAO,IAAI;AAAA,YAEnC,KAAK;AACH,kBAAI,WAAW;AACf,qBAAO,eAAe,SAAS,QAAQ,IAAI;AAAA,YAE7C,KAAK;AACH,qBAAO,eAAe,MAAM,KAAK,QAAQ,YAAY;AAAA,YAEvD,KAAK;AACH,kBAAI,YAAY,KAAK,eAAe;AAEpC,kBAAI,cAAc,MAAM;AACtB,uBAAO;AAAA,cACR;AAED,qBAAO,yBAAyB,KAAK,IAAI,KAAK;AAAA,YAEhD,KAAK,iBACH;AACE,kBAAI,gBAAgB;AACpB,kBAAI,UAAU,cAAc;AAC5B,kBAAI,OAAO,cAAc;AAEzB,kBAAI;AACF,uBAAO,yBAAyB,KAAK,OAAO,CAAC;AAAA,cAC9C,SAAQA,IAAG;AACV,uBAAO;AAAA,cACR;AAAA,YACF;AAAA,UAGJ;AAAA,QACF;AAED,eAAO;AAAA,MACT;AAEA,eAAS,iBAAiB,WAAW,WAAW,aAAa;AAC3D,YAAI,eAAe,UAAU,eAAe,UAAU,QAAQ;AAC9D,eAAO,UAAU,gBAAgB,iBAAiB,KAAK,cAAc,MAAM,eAAe,MAAM;AAAA,MAClG;AAGA,eAAS,iBAAiB,MAAM;AAC9B,eAAO,KAAK,eAAe;AAAA,MAC7B;AAEA,eAAS,0BAA0B,OAAO;AACxC,YAAI,MAAM,MAAM,KACZ,OAAO,MAAM;AAEjB,gBAAQ,KAAG;AAAA,UACT,KAAK;AACH,mBAAO;AAAA,UAET,KAAK;AACH,gBAAI,UAAU;AACd,mBAAO,iBAAiB,OAAO,IAAI;AAAA,UAErC,KAAKwG;AACH,gBAAI,WAAW;AACf,mBAAO,iBAAiB,SAAS,QAAQ,IAAI;AAAA,UAE/C,KAAK;AACH,mBAAO;AAAA,UAET,KAAK;AACH,mBAAO,iBAAiB,MAAM,KAAK,QAAQ,YAAY;AAAA,UAEzD,KAAK;AACH,mBAAO;AAAA,UAET,KAAK;AAEH,mBAAO;AAAA,UAET,KAAK;AACH,mBAAO;AAAA,UAET,KAAK;AACH,mBAAO;AAAA,UAET,KAAK;AACH,mBAAO;AAAA,UAET,KAAK;AAEH,mBAAO,yBAAyB,IAAI;AAAA,UAEtC,KAAK;AACH,gBAAI,SAAS,wBAAwB;AAEnC,qBAAO;AAAA,YACR;AAED,mBAAO;AAAA,UAET,KAAK;AACH,mBAAO;AAAA,UAET,KAAK;AACH,mBAAO;AAAA,UAET,KAAK;AACH,mBAAO;AAAA,UAET,KAAK;AACH,mBAAO;AAAA,UAET,KAAK;AACH,mBAAO;AAAA,UAET,KAAK;AACH,mBAAO;AAAA,UAGT,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AACH,gBAAI,OAAO,SAAS,YAAY;AAC9B,qBAAO,KAAK,eAAe,KAAK,QAAQ;AAAA,YACzC;AAED,gBAAI,OAAO,SAAS,UAAU;AAC5B,qBAAO;AAAA,YACR;AAED;AAAA,QAEH;AAED,eAAO;AAAA,MACT;AAEA,UAAI,yBAAyB,qBAAqB;AAClD,UAAI,UAAU;AACd,UAAI,cAAc;AAClB,eAAS,sCAAsC;AAC7C;AACE,cAAI,YAAY,MAAM;AACpB,mBAAO;AAAA,UACR;AAED,cAAI,QAAQ,QAAQ;AAEpB,cAAI,UAAU,QAAQ,OAAO,UAAU,aAAa;AAClD,mBAAO,0BAA0B,KAAK;AAAA,UACvC;AAAA,QACF;AAED,eAAO;AAAA,MACT;AAEA,eAAS,4BAA4B;AACnC;AACE,cAAI,YAAY,MAAM;AACpB,mBAAO;AAAA,UACR;AAID,iBAAO,4BAA4B,OAAO;AAAA,QAC3C;AAAA,MACH;AAEA,eAAS,oBAAoB;AAC3B;AACE,iCAAuB,kBAAkB;AACzC,oBAAU;AACV,wBAAc;AAAA,QACf;AAAA,MACH;AACA,eAAS,gBAAgB,OAAO;AAC9B;AACE,iCAAuB,kBAAkB,UAAU,OAAO,OAAO;AACjE,oBAAU;AACV,wBAAc;AAAA,QACf;AAAA,MACH;AACA,eAAS,kBAAkB;AACzB;AACE,iBAAO;AAAA,QACR;AAAA,MACH;AACA,eAAS,eAAe,WAAW;AACjC;AACE,wBAAc;AAAA,QACf;AAAA,MACH;AAKA,eAAS,SAAS,OAAO;AAGvB,eAAO,KAAK;AAAA,MACd;AACA,eAAS,iBAAiB,OAAO;AAC/B,gBAAQ,OAAO,OAAK;AAAA,UAClB,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AACH,mBAAO;AAAA,UAET,KAAK;AACH;AACE,gDAAkC,KAAK;AAAA,YACxC;AAED,mBAAO;AAAA,UAET;AAEE,mBAAO;AAAA,QACV;AAAA,MACH;AAEA,UAAI,mBAAmB;AAAA,QACrB,QAAQ;AAAA,QACR,UAAU;AAAA,QACV,OAAO;AAAA,QACP,QAAQ;AAAA,QACR,OAAO;AAAA,QACP,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AACA,eAAS,0BAA0B,SAAS,OAAO;AACjD;AACE,cAAI,EAAE,iBAAiB,MAAM,IAAI,KAAK,MAAM,YAAY,MAAM,WAAW,MAAM,YAAY,MAAM,YAAY,MAAM,SAAS,OAAO;AACjI,kBAAM,mNAAkO;AAAA,UACzO;AAED,cAAI,EAAE,MAAM,YAAY,MAAM,YAAY,MAAM,YAAY,MAAM,WAAW,OAAO;AAClF,kBAAM,uNAAsO;AAAA,UAC7O;AAAA,QACF;AAAA,MACH;AAEA,eAAS,YAAY,MAAM;AACzB,YAAI,OAAO,KAAK;AAChB,YAAI,WAAW,KAAK;AACpB,eAAO,YAAY,SAAS,kBAAkB,YAAY,SAAS,cAAc,SAAS;AAAA,MAC5F;AAEA,eAAS,WAAW,MAAM;AACxB,eAAO,KAAK;AAAA,MACd;AAEA,eAAS,cAAc,MAAM;AAC3B,aAAK,gBAAgB;AAAA,MACvB;AAEA,eAAS,iBAAiB,MAAM;AAC9B,YAAI,QAAQ;AAEZ,YAAI,CAAC,MAAM;AACT,iBAAO;AAAA,QACR;AAED,YAAI,YAAY,IAAI,GAAG;AACrB,kBAAQ,KAAK,UAAU,SAAS;AAAA,QACpC,OAAS;AACL,kBAAQ,KAAK;AAAA,QACd;AAED,eAAO;AAAA,MACT;AAEA,eAAS,iBAAiB,MAAM;AAC9B,YAAI,aAAa,YAAY,IAAI,IAAI,YAAY;AACjD,YAAI,aAAa,OAAO,yBAAyB,KAAK,YAAY,WAAW,UAAU;AAEvF;AACE,4CAAkC,KAAK,UAAU,CAAC;AAAA,QACnD;AAED,YAAI,eAAe,KAAK,KAAK,UAAU;AAKvC,YAAI,KAAK,eAAe,UAAU,KAAK,OAAO,eAAe,eAAe,OAAO,WAAW,QAAQ,cAAc,OAAO,WAAW,QAAQ,YAAY;AACxJ;AAAA,QACD;AAED,YAAIK,OAAM,WAAW,KACjBC,OAAM,WAAW;AACrB,eAAO,eAAe,MAAM,YAAY;AAAA,UACtC,cAAc;AAAA,UACd,KAAK,WAAY;AACf,mBAAOD,KAAI,KAAK,IAAI;AAAA,UACrB;AAAA,UACD,KAAK,SAAU,OAAO;AACpB;AACE,gDAAkC,KAAK;AAAA,YACxC;AAED,2BAAe,KAAK;AACpB,YAAAC,KAAI,KAAK,MAAM,KAAK;AAAA,UACrB;AAAA,QACL,CAAG;AAKD,eAAO,eAAe,MAAM,YAAY;AAAA,UACtC,YAAY,WAAW;AAAA,QAC3B,CAAG;AACD,YAAI,UAAU;AAAA,UACZ,UAAU,WAAY;AACpB,mBAAO;AAAA,UACR;AAAA,UACD,UAAU,SAAU,OAAO;AACzB;AACE,gDAAkC,KAAK;AAAA,YACxC;AAED,2BAAe,KAAK;AAAA,UACrB;AAAA,UACD,cAAc,WAAY;AACxB,0BAAc,IAAI;AAClB,mBAAO,KAAK,UAAU;AAAA,UACvB;AAAA,QACL;AACE,eAAO;AAAA,MACT;AAEA,eAAS,MAAM,MAAM;AACnB,YAAI,WAAW,IAAI,GAAG;AACpB;AAAA,QACD;AAGD,aAAK,gBAAgB,iBAAiB,IAAI;AAAA,MAC5C;AACA,eAAS,qBAAqB,MAAM;AAClC,YAAI,CAAC,MAAM;AACT,iBAAO;AAAA,QACR;AAED,YAAI,UAAU,WAAW,IAAI;AAG7B,YAAI,CAAC,SAAS;AACZ,iBAAO;AAAA,QACR;AAED,YAAI,YAAY,QAAQ;AACxB,YAAI,YAAY,iBAAiB,IAAI;AAErC,YAAI,cAAc,WAAW;AAC3B,kBAAQ,SAAS,SAAS;AAC1B,iBAAO;AAAA,QACR;AAED,eAAO;AAAA,MACT;AAEA,eAAS,iBAAiBnD,MAAK;AAC7B,QAAAA,OAAMA,SAAQ,OAAO,aAAa,cAAc,WAAW;AAE3D,YAAI,OAAOA,SAAQ,aAAa;AAC9B,iBAAO;AAAA,QACR;AAED,YAAI;AACF,iBAAOA,KAAI,iBAAiBA,KAAI;AAAA,QACjC,SAAQ5D,IAAG;AACV,iBAAO4D,KAAI;AAAA,QACZ;AAAA,MACH;AAEA,UAAI,2BAA2B;AAC/B,UAAI,+BAA+B;AACnC,UAAI,kCAAkC;AACtC,UAAI,kCAAkC;AAEtC,eAAS,aAAa,OAAO;AAC3B,YAAI,cAAc,MAAM,SAAS,cAAc,MAAM,SAAS;AAC9D,eAAO,cAAc,MAAM,WAAW,OAAO,MAAM,SAAS;AAAA,MAC9D;AAmBA,eAAS,aAAa,SAAS,OAAO;AACpC,YAAI,OAAO;AACX,YAAI,UAAU,MAAM;AACpB,YAAI,YAAY,OAAO,CAAE,GAAE,OAAO;AAAA,UAChC,gBAAgB;AAAA,UAChB,cAAc;AAAA,UACd,OAAO;AAAA,UACP,SAAS,WAAW,OAAO,UAAU,KAAK,cAAc;AAAA,QAC5D,CAAG;AACD,eAAO;AAAA,MACT;AACA,eAAS,iBAAiB,SAAS,OAAO;AACxC;AACE,oCAA0B,SAAS,KAAK;AAExC,cAAI,MAAM,YAAY,UAAa,MAAM,mBAAmB,UAAa,CAAC,8BAA8B;AACtG,kBAAM,8WAAuY,oCAAmC,KAAM,eAAe,MAAM,IAAI;AAE/c,2CAA+B;AAAA,UAChC;AAED,cAAI,MAAM,UAAU,UAAa,MAAM,iBAAiB,UAAa,CAAC,0BAA0B;AAC9F,kBAAM,sWAA+X,oCAAmC,KAAM,eAAe,MAAM,IAAI;AAEvc,uCAA2B;AAAA,UAC5B;AAAA,QACF;AAED,YAAI,OAAO;AACX,YAAI,eAAe,MAAM,gBAAgB,OAAO,KAAK,MAAM;AAC3D,aAAK,gBAAgB;AAAA,UACnB,gBAAgB,MAAM,WAAW,OAAO,MAAM,UAAU,MAAM;AAAA,UAC9D,cAAc,iBAAiB,MAAM,SAAS,OAAO,MAAM,QAAQ,YAAY;AAAA,UAC/E,YAAY,aAAa,KAAK;AAAA,QAClC;AAAA,MACA;AACA,eAAS,cAAc,SAAS,OAAO;AACrC,YAAI,OAAO;AACX,YAAI,UAAU,MAAM;AAEpB,YAAI,WAAW,MAAM;AACnB,8BAAoB,MAAM,WAAW,SAAS,KAAK;AAAA,QACpD;AAAA,MACH;AACA,eAAS,cAAc,SAAS,OAAO;AACrC,YAAI,OAAO;AAEX;AACE,cAAI,aAAa,aAAa,KAAK;AAEnC,cAAI,CAAC,KAAK,cAAc,cAAc,cAAc,CAAC,iCAAiC;AACpF,kBAAM,sUAA0V;AAEhW,8CAAkC;AAAA,UACnC;AAED,cAAI,KAAK,cAAc,cAAc,CAAC,cAAc,CAAC,iCAAiC;AACpF,kBAAM,+TAAmV;AAEzV,8CAAkC;AAAA,UACnC;AAAA,QACF;AAED,sBAAc,SAAS,KAAK;AAC5B,YAAI,QAAQ,iBAAiB,MAAM,KAAK;AACxC,YAAI,OAAO,MAAM;AAEjB,YAAI,SAAS,MAAM;AACjB,cAAI,SAAS,UAAU;AACrB,gBAAI,UAAU,KAAK,KAAK,UAAU;AAAA;AAAA,YAElC,KAAK,SAAS,OAAO;AACnB,mBAAK,QAAQ,SAAS,KAAK;AAAA,YAC5B;AAAA,UACF,WAAU,KAAK,UAAU,SAAS,KAAK,GAAG;AACzC,iBAAK,QAAQ,SAAS,KAAK;AAAA,UAC5B;AAAA,QACF,WAAU,SAAS,YAAY,SAAS,SAAS;AAGhD,eAAK,gBAAgB,OAAO;AAC5B;AAAA,QACD;AAED;AAME,cAAI,MAAM,eAAe,OAAO,GAAG;AACjC,4BAAgB,MAAM,MAAM,MAAM,KAAK;AAAA,UACxC,WAAU,MAAM,eAAe,cAAc,GAAG;AAC/C,4BAAgB,MAAM,MAAM,MAAM,iBAAiB,MAAM,YAAY,CAAC;AAAA,UACvE;AAAA,QACF;AAED;AAGE,cAAI,MAAM,WAAW,QAAQ,MAAM,kBAAkB,MAAM;AACzD,iBAAK,iBAAiB,CAAC,CAAC,MAAM;AAAA,UAC/B;AAAA,QACF;AAAA,MACH;AACA,eAAS,iBAAiB,SAAS,OAAOoD,cAAa;AACrD,YAAI,OAAO;AAGX,YAAI,MAAM,eAAe,OAAO,KAAK,MAAM,eAAe,cAAc,GAAG;AACzE,cAAI,OAAO,MAAM;AACjB,cAAI,WAAW,SAAS,YAAY,SAAS;AAG7C,cAAI,aAAa,MAAM,UAAU,UAAa,MAAM,UAAU,OAAO;AACnE;AAAA,UACD;AAED,cAAI,eAAe,SAAS,KAAK,cAAc,YAAY;AAG3D,cAAI,CAACA,cAAa;AAChB;AAOE,kBAAI,iBAAiB,KAAK,OAAO;AAC/B,qBAAK,QAAQ;AAAA,cACd;AAAA,YACF;AAAA,UACF;AAED;AAIE,iBAAK,eAAe;AAAA,UACrB;AAAA,QACF;AAOD,YAAIvG,QAAO,KAAK;AAEhB,YAAIA,UAAS,IAAI;AACf,eAAK,OAAO;AAAA,QACb;AAED;AAOE,eAAK,iBAAiB,CAAC,KAAK;AAC5B,eAAK,iBAAiB,CAAC,CAAC,KAAK,cAAc;AAAA,QAC5C;AAED,YAAIA,UAAS,IAAI;AACf,eAAK,OAAOA;AAAA,QACb;AAAA,MACH;AACA,eAAS,uBAAuB,SAAS,OAAO;AAC9C,YAAI,OAAO;AACX,sBAAc,MAAM,KAAK;AACzB,2BAAmB,MAAM,KAAK;AAAA,MAChC;AAEA,eAAS,mBAAmB,UAAU,OAAO;AAC3C,YAAIA,QAAO,MAAM;AAEjB,YAAI,MAAM,SAAS,WAAWA,SAAQ,MAAM;AAC1C,cAAI,YAAY;AAEhB,iBAAO,UAAU,YAAY;AAC3B,wBAAY,UAAU;AAAA,UACvB;AASD;AACE,yCAA6BA,OAAM,MAAM;AAAA,UAC1C;AAED,cAAI,QAAQ,UAAU,iBAAiB,gBAAgB,KAAK,UAAU,KAAKA,KAAI,IAAI,iBAAiB;AAEpG,mBAASN,KAAI,GAAGA,KAAI,MAAM,QAAQA,MAAK;AACrC,gBAAI,YAAY,MAAMA,EAAC;AAEvB,gBAAI,cAAc,YAAY,UAAU,SAAS,SAAS,MAAM;AAC9D;AAAA,YACD;AAMD,gBAAI,aAAa,6BAA6B,SAAS;AAEvD,gBAAI,CAAC,YAAY;AACf,oBAAM,IAAI,MAAM,+FAAoG;AAAA,YACrH;AAID,iCAAqB,SAAS;AAI9B,0BAAc,WAAW,UAAU;AAAA,UACpC;AAAA,QACF;AAAA,MACH;AAUA,eAAS,gBAAgB,MAAM,MAAM,OAAO;AAC1C;AAAA;AAAA,UACA,SAAS,YAAY,iBAAiB,KAAK,aAAa,MAAM;AAAA,UAAM;AAClE,cAAI,SAAS,MAAM;AACjB,iBAAK,eAAe,SAAS,KAAK,cAAc,YAAY;AAAA,UAC7D,WAAU,KAAK,iBAAiB,SAAS,KAAK,GAAG;AAChD,iBAAK,eAAe,SAAS,KAAK;AAAA,UACnC;AAAA,QACF;AAAA,MACH;AAEA,UAAI,6BAA6B;AACjC,UAAI,sBAAsB;AAC1B,UAAI,0BAA0B;AAK9B,eAAS,cAAc,SAAS,OAAO;AACrC;AAEE,cAAI,MAAM,SAAS,MAAM;AACvB,gBAAI,OAAO,MAAM,aAAa,YAAY,MAAM,aAAa,MAAM;AACjE,cAAAa,OAAM,SAAS,QAAQ,MAAM,UAAU,SAAU,OAAO;AACtD,oBAAI,SAAS,MAAM;AACjB;AAAA,gBACD;AAED,oBAAI,OAAO,UAAU,YAAY,OAAO,UAAU,UAAU;AAC1D;AAAA,gBACD;AAED,oBAAI,CAAC,qBAAqB;AACxB,wCAAsB;AAEtB,wBAAM,uHAA4H;AAAA,gBACnI;AAAA,cACX,CAAS;AAAA,YACT,WAAiB,MAAM,2BAA2B,MAAM;AAChD,kBAAI,CAAC,yBAAyB;AAC5B,0CAA0B;AAE1B,sBAAM,oGAAyG;AAAA,cAChH;AAAA,YACF;AAAA,UACF;AAGD,cAAI,MAAM,YAAY,QAAQ,CAAC,4BAA4B;AACzD,kBAAM,gGAAqG;AAE3G,yCAA6B;AAAA,UAC9B;AAAA,QACF;AAAA,MACH;AACA,eAAS,mBAAmB,SAAS,OAAO;AAE1C,YAAI,MAAM,SAAS,MAAM;AACvB,kBAAQ,aAAa,SAAS,SAAS,iBAAiB,MAAM,KAAK,CAAC,CAAC;AAAA,QACtE;AAAA,MACH;AAEA,UAAI,cAAc,MAAM;AAExB,eAAS,QAAQlB,IAAG;AAClB,eAAO,YAAYA,EAAC;AAAA,MACtB;AAEA,UAAI;AAEJ;AACE,qCAA6B;AAAA,MAC/B;AAEA,eAAS,8BAA8B;AACrC,YAAI,YAAY;AAEhB,YAAI,WAAW;AACb,iBAAO,qCAAqC,YAAY;AAAA,QACzD;AAED,eAAO;AAAA,MACT;AAEA,UAAI,iBAAiB,CAAC,SAAS,cAAc;AAK7C,eAAS,qBAAqB,OAAO;AACnC;AACE,oCAA0B,UAAU,KAAK;AAEzC,mBAASK,KAAI,GAAGA,KAAI,eAAe,QAAQA,MAAK;AAC9C,gBAAI,WAAW,eAAeA,EAAC;AAE/B,gBAAI,MAAM,QAAQ,KAAK,MAAM;AAC3B;AAAA,YACD;AAED,gBAAI,kBAAkB,QAAQ,MAAM,QAAQ,CAAC;AAE7C,gBAAI,MAAM,YAAY,CAAC,iBAAiB;AACtC,oBAAM,gFAAqF,UAAU,4BAA6B,CAAA;AAAA,YACnI,WAAU,CAAC,MAAM,YAAY,iBAAiB;AAC7C,oBAAM,uFAA4F,UAAU,4BAA6B,CAAA;AAAA,YAC1I;AAAA,UACF;AAAA,QACF;AAAA,MACH;AAEA,eAAS,cAAc,MAAM,UAAU,WAAW,oBAAoB;AACpE,YAAI8G,WAAU,KAAK;AAEnB,YAAI,UAAU;AACZ,cAAI,iBAAiB;AACrB,cAAI,gBAAgB,CAAA;AAEpB,mBAAS9G,KAAI,GAAGA,KAAI,eAAe,QAAQA,MAAK;AAE9C,0BAAc,MAAM,eAAeA,EAAC,CAAC,IAAI;AAAA,UAC1C;AAED,mBAAS,KAAK,GAAG,KAAK8G,SAAQ,QAAQ,MAAM;AAC1C,gBAAI,WAAW,cAAc,eAAe,MAAMA,SAAQ,EAAE,EAAE,KAAK;AAEnE,gBAAIA,SAAQ,EAAE,EAAE,aAAa,UAAU;AACrC,cAAAA,SAAQ,EAAE,EAAE,WAAW;AAAA,YACxB;AAED,gBAAI,YAAY,oBAAoB;AAClC,cAAAA,SAAQ,EAAE,EAAE,kBAAkB;AAAA,YAC/B;AAAA,UACF;AAAA,QACL,OAAS;AAGL,cAAI,iBAAiB,SAAS,iBAAiB,SAAS,CAAC;AAEzD,cAAI,kBAAkB;AAEtB,mBAAS,MAAM,GAAG,MAAMA,SAAQ,QAAQ,OAAO;AAC7C,gBAAIA,SAAQ,GAAG,EAAE,UAAU,gBAAgB;AACzC,cAAAA,SAAQ,GAAG,EAAE,WAAW;AAExB,kBAAI,oBAAoB;AACtB,gBAAAA,SAAQ,GAAG,EAAE,kBAAkB;AAAA,cAChC;AAED;AAAA,YACD;AAED,gBAAI,oBAAoB,QAAQ,CAACA,SAAQ,GAAG,EAAE,UAAU;AACtD,gCAAkBA,SAAQ,GAAG;AAAA,YAC9B;AAAA,UACF;AAED,cAAI,oBAAoB,MAAM;AAC5B,4BAAgB,WAAW;AAAA,UAC5B;AAAA,QACF;AAAA,MACH;AAkBA,eAAS,eAAe,SAAS,OAAO;AACtC,eAAO,OAAO,CAAE,GAAE,OAAO;AAAA,UACvB,OAAO;AAAA,QACX,CAAG;AAAA,MACH;AACA,eAAS,mBAAmB,SAAS,OAAO;AAC1C,YAAI,OAAO;AAEX;AACE,+BAAqB,KAAK;AAAA,QAC3B;AAED,aAAK,gBAAgB;AAAA,UACnB,aAAa,CAAC,CAAC,MAAM;AAAA,QACzB;AAEE;AACE,cAAI,MAAM,UAAU,UAAa,MAAM,iBAAiB,UAAa,CAAC,4BAA4B;AAChG,kBAAM,8RAAkT;AAExT,yCAA6B;AAAA,UAC9B;AAAA,QACF;AAAA,MACH;AACA,eAAS,mBAAmB,SAAS,OAAO;AAC1C,YAAI,OAAO;AACX,aAAK,WAAW,CAAC,CAAC,MAAM;AACxB,YAAI,QAAQ,MAAM;AAElB,YAAI,SAAS,MAAM;AACjB,wBAAc,MAAM,CAAC,CAAC,MAAM,UAAU,OAAO,KAAK;AAAA,QACtD,WAAa,MAAM,gBAAgB,MAAM;AACrC,wBAAc,MAAM,CAAC,CAAC,MAAM,UAAU,MAAM,cAAc,IAAI;AAAA,QAC/D;AAAA,MACH;AACA,eAAS,kBAAkB,SAAS,OAAO;AACzC,YAAI,OAAO;AACX,YAAI,cAAc,KAAK,cAAc;AACrC,aAAK,cAAc,cAAc,CAAC,CAAC,MAAM;AACzC,YAAI,QAAQ,MAAM;AAElB,YAAI,SAAS,MAAM;AACjB,wBAAc,MAAM,CAAC,CAAC,MAAM,UAAU,OAAO,KAAK;AAAA,QACnD,WAAU,gBAAgB,CAAC,CAAC,MAAM,UAAU;AAE3C,cAAI,MAAM,gBAAgB,MAAM;AAC9B,0BAAc,MAAM,CAAC,CAAC,MAAM,UAAU,MAAM,cAAc,IAAI;AAAA,UACpE,OAAW;AAEL,0BAAc,MAAM,CAAC,CAAC,MAAM,UAAU,MAAM,WAAW,CAAE,IAAG,IAAI,KAAK;AAAA,UACtE;AAAA,QACF;AAAA,MACH;AACA,eAAS,yBAAyB,SAAS,OAAO;AAChD,YAAI,OAAO;AACX,YAAI,QAAQ,MAAM;AAElB,YAAI,SAAS,MAAM;AACjB,wBAAc,MAAM,CAAC,CAAC,MAAM,UAAU,OAAO,KAAK;AAAA,QACnD;AAAA,MACH;AAEA,UAAI,uBAAuB;AAiB3B,eAAS,eAAe,SAAS,OAAO;AACtC,YAAI,OAAO;AAEX,YAAI,MAAM,2BAA2B,MAAM;AACzC,gBAAM,IAAI,MAAM,8DAA8D;AAAA,QAC/E;AAQD,YAAI,YAAY,OAAO,CAAE,GAAE,OAAO;AAAA,UAChC,OAAO;AAAA,UACP,cAAc;AAAA,UACd,UAAU,SAAS,KAAK,cAAc,YAAY;AAAA,QACtD,CAAG;AAED,eAAO;AAAA,MACT;AACA,eAAS,mBAAmB,SAAS,OAAO;AAC1C,YAAI,OAAO;AAEX;AACE,oCAA0B,YAAY,KAAK;AAE3C,cAAI,MAAM,UAAU,UAAa,MAAM,iBAAiB,UAAa,CAAC,sBAAsB;AAC1F,kBAAM,2VAAoX,yCAAyC,aAAa;AAEhb,mCAAuB;AAAA,UACxB;AAAA,QACF;AAED,YAAI,eAAe,MAAM;AAEzB,YAAI,gBAAgB,MAAM;AACxB,cAAI,WAAW,MAAM,UACjB,eAAe,MAAM;AAEzB,cAAI,YAAY,MAAM;AACpB;AACE,oBAAM,oFAAyF;AAAA,YAChG;AAED;AACE,kBAAI,gBAAgB,MAAM;AACxB,sBAAM,IAAI,MAAM,qEAAqE;AAAA,cACtF;AAED,kBAAI,QAAQ,QAAQ,GAAG;AACrB,oBAAI,SAAS,SAAS,GAAG;AACvB,wBAAM,IAAI,MAAM,6CAA6C;AAAA,gBAC9D;AAED,2BAAW,SAAS,CAAC;AAAA,cACtB;AAED,6BAAe;AAAA,YAChB;AAAA,UACF;AAED,cAAI,gBAAgB,MAAM;AACxB,2BAAe;AAAA,UAChB;AAED,yBAAe;AAAA,QAChB;AAED,aAAK,gBAAgB;AAAA,UACnB,cAAc,iBAAiB,YAAY;AAAA,QAC/C;AAAA,MACA;AACA,eAAS,gBAAgB,SAAS,OAAO;AACvC,YAAI,OAAO;AACX,YAAI,QAAQ,iBAAiB,MAAM,KAAK;AACxC,YAAI,eAAe,iBAAiB,MAAM,YAAY;AAEtD,YAAI,SAAS,MAAM;AAGjB,cAAI,WAAW,SAAS,KAAK;AAE7B,cAAI,aAAa,KAAK,OAAO;AAC3B,iBAAK,QAAQ;AAAA,UACd;AAED,cAAI,MAAM,gBAAgB,QAAQ,KAAK,iBAAiB,UAAU;AAChE,iBAAK,eAAe;AAAA,UACrB;AAAA,QACF;AAED,YAAI,gBAAgB,MAAM;AACxB,eAAK,eAAe,SAAS,YAAY;AAAA,QAC1C;AAAA,MACH;AACA,eAAS,mBAAmB,SAAS,OAAO;AAC1C,YAAI,OAAO;AAGX,YAAI,cAAc,KAAK;AAKvB,YAAI,gBAAgB,KAAK,cAAc,cAAc;AACnD,cAAI,gBAAgB,MAAM,gBAAgB,MAAM;AAC9C,iBAAK,QAAQ;AAAA,UACd;AAAA,QACF;AAAA,MACH;AACA,eAAS,yBAAyB,SAAS,OAAO;AAEhD,wBAAgB,SAAS,KAAK;AAAA,MAChC;AAEA,UAAI,iBAAiB;AACrB,UAAI,iBAAiB;AACrB,UAAI,gBAAgB;AAEpB,eAAS,sBAAsB,MAAM;AACnC,gBAAQ,MAAI;AAAA,UACV,KAAK;AACH,mBAAO;AAAA,UAET,KAAK;AACH,mBAAO;AAAA,UAET;AACE,mBAAO;AAAA,QACV;AAAA,MACH;AACA,eAAS,kBAAkB,iBAAiB,MAAM;AAChD,YAAI,mBAAmB,QAAQ,oBAAoB,gBAAgB;AAEjE,iBAAO,sBAAsB,IAAI;AAAA,QAClC;AAED,YAAI,oBAAoB,iBAAiB,SAAS,iBAAiB;AAEjE,iBAAO;AAAA,QACR;AAGD,eAAO;AAAA,MACT;AAOA,UAAI,qCAAqC,SAAU,MAAM;AACvD,YAAI,OAAO,UAAU,eAAe,MAAM,yBAAyB;AACjE,iBAAO,SAAU,MAAM,MAAM,MAAM,MAAM;AACvC,kBAAM,wBAAwB,WAAY;AACxC,qBAAO,KAAK,MAAM,MAAM,MAAM,IAAI;AAAA,YAC1C,CAAO;AAAA,UACP;AAAA,QACA,OAAS;AACL,iBAAO;AAAA,QACR;AAAA,MACH;AAEA,UAAI;AASJ,UAAI,eAAe,mCAAmC,SAAU,MAAM,MAAM;AAC1E,YAAI,KAAK,iBAAiB,eAAe;AAEvC,cAAI,EAAE,eAAe,OAAO;AAI1B,mCAAuB,wBAAwB,SAAS,cAAc,KAAK;AAC3E,iCAAqB,YAAY,UAAU,KAAK,UAAU,SAAU,IAAG;AACvE,gBAAI,UAAU,qBAAqB;AAEnC,mBAAO,KAAK,YAAY;AACtB,mBAAK,YAAY,KAAK,UAAU;AAAA,YACjC;AAED,mBAAO,QAAQ,YAAY;AACzB,mBAAK,YAAY,QAAQ,UAAU;AAAA,YACpC;AAED;AAAA,UACD;AAAA,QACF;AAED,aAAK,YAAY;AAAA,MACnB,CAAC;AAKD,UAAI,eAAe;AACnB,UAAI,YAAY;AAChB,UAAI,eAAe;AACnB,UAAI,gBAAgB;AACpB,UAAI,yBAAyB;AAY7B,UAAI,iBAAiB,SAAU,MAAM,MAAM;AACzC,YAAI,MAAM;AACR,cAAI,aAAa,KAAK;AAEtB,cAAI,cAAc,eAAe,KAAK,aAAa,WAAW,aAAa,WAAW;AACpF,uBAAW,YAAY;AACvB;AAAA,UACD;AAAA,QACF;AAED,aAAK,cAAc;AAAA,MACrB;AAIA,UAAI,sBAAsB;AAAA,QACxB,WAAW,CAAC,kBAAkB,sBAAsB,qBAAqB,qBAAqB,2BAA2B,iBAAiB,sBAAsB,yBAAyB;AAAA,QACzL,YAAY,CAAC,wBAAwB,kBAAkB,mBAAmB,mBAAmB,oBAAoB,uBAAuB,uBAAuB,oBAAoB,gBAAgB;AAAA,QACnM,oBAAoB,CAAC,uBAAuB,qBAAqB;AAAA,QACjE,QAAQ,CAAC,qBAAqB,qBAAqB,qBAAqB,qBAAqB,qBAAqB,oBAAoB,qBAAqB,oBAAoB,mBAAmB,mBAAmB,mBAAmB,oBAAoB,oBAAoB,oBAAoB,kBAAkB,kBAAkB,gBAAgB;AAAA,QACxV,gBAAgB,CAAC,uBAAuB,uBAAuB,qBAAqB;AAAA,QACpF,kBAAkB,CAAC,yBAAyB,yBAAyB,uBAAuB;AAAA,QAC5F,cAAc,CAAC,qBAAqB,qBAAqB,mBAAmB;AAAA,QAC5E,aAAa,CAAC,qBAAqB,mBAAmB,oBAAoB,gBAAgB;AAAA,QAC1F,aAAa,CAAC,qBAAqB,qBAAqB,oBAAoB,qBAAqB,kBAAkB;AAAA,QACnH,iBAAiB,CAAC,wBAAwB,wBAAwB,sBAAsB;AAAA,QACxF,mBAAmB,CAAC,0BAA0B,0BAA0B,wBAAwB;AAAA,QAChG,YAAY,CAAC,mBAAmB,mBAAmB,iBAAiB;AAAA,QACpE,cAAc,CAAC,0BAA0B,2BAA2B,uBAAuB,sBAAsB;AAAA,QACjH,aAAa,CAAC,oBAAoB,oBAAoB,kBAAkB;AAAA,QACxE,aAAa,CAAC,qBAAqB,mBAAmB,oBAAoB,gBAAgB;AAAA,QAC1F,WAAW,CAAC,kBAAkB,kBAAkB,gBAAgB;AAAA,QAChE,aAAa,CAAC,qBAAqB,mBAAmB,oBAAoB,gBAAgB;AAAA,QAC1F,YAAY,CAAC,mBAAmB,mBAAmB,iBAAiB;AAAA,QACpE,SAAS,CAAC,eAAe,aAAa;AAAA,QACtC,MAAM,CAAC,aAAa,YAAY,YAAY;AAAA,QAC5C,UAAU,CAAC,iBAAiB,UAAU;AAAA,QACtC,MAAM,CAAC,cAAc,uBAAuB,eAAe,wBAAwB,YAAY,kBAAkB,eAAe,aAAa,eAAe,yBAAyB,mBAAmB,wBAAwB,wBAAwB,sBAAsB,uBAAuB,cAAc,YAAY;AAAA,QAC/T,aAAa,CAAC,yBAAyB,mBAAmB,wBAAwB,wBAAwB,sBAAsB,qBAAqB;AAAA,QACrJ,KAAK,CAAC,aAAa,QAAQ;AAAA,QAC3B,MAAM,CAAC,mBAAmB,gBAAgB,gBAAgB,qBAAqB,uBAAuB,kBAAkB;AAAA,QACxH,UAAU,CAAC,iBAAiB,mBAAmB,cAAc,cAAc;AAAA,QAC3E,YAAY,CAAC,iBAAiB,iBAAiB;AAAA,QAC/C,eAAe,CAAC,WAAW;AAAA,QAC3B,SAAS,CAAC,aAAa,QAAQ;AAAA,QAC/B,SAAS,CAAC,cAAc,cAAc;AAAA,QACtC,YAAY,CAAC,QAAQ;AAAA,QACrB,cAAc,CAAC,qBAAqB,uBAAuB,kBAAkB;AAAA,QAC7E,WAAW,CAAC,kBAAkB,qBAAqB,eAAe;AAAA,QAClE,QAAQ,CAAC,gBAAgB,cAAc,eAAe,WAAW;AAAA,QACjE,QAAQ,CAAC,aAAa,aAAa,aAAa;AAAA,QAChD,MAAM,CAAC,YAAY,iBAAiB,aAAa,YAAY,cAAc,iBAAiB,iBAAiB,cAAc,UAAU;AAAA,QACrI,cAAc,CAAC,iBAAiB,eAAe;AAAA,QAC/C,SAAS,CAAC,gBAAgB,gBAAgB,cAAc;AAAA,QACxD,UAAU,CAAC,aAAa,WAAW;AAAA,QACnC,SAAS,CAAC,iBAAiB,eAAe,gBAAgB,YAAY;AAAA,QACtE,cAAc,CAAC,gBAAgB,gBAAgB;AAAA,QAC/C,YAAY,CAAC,cAAc,cAAc;AAAA,QACzC,WAAW,CAAC,aAAa,aAAa;AAAA,QACtC,gBAAgB,CAAC,uBAAuB,sBAAsB,qBAAqB;AAAA,QACnF,cAAc,CAAC,qBAAqB,mBAAmB;AAAA,QACvD,YAAY,CAAC,mBAAmB,sBAAsB,sBAAsB,0BAA0B;AAAA,QACtG,UAAU,CAAC,cAAc;AAAA,MAC3B;AAKA,UAAI,mBAAmB;AAAA,QACrB,yBAAyB;AAAA,QACzB,aAAa;AAAA,QACb,mBAAmB;AAAA,QACnB,kBAAkB;AAAA,QAClB,kBAAkB;AAAA,QAClB,SAAS;AAAA,QACT,cAAc;AAAA,QACd,iBAAiB;AAAA,QACjB,aAAa;AAAA,QACb,SAAS;AAAA,QACT,MAAM;AAAA,QACN,UAAU;AAAA,QACV,cAAc;AAAA,QACd,YAAY;AAAA,QACZ,cAAc;AAAA,QACd,WAAW;AAAA,QACX,UAAU;AAAA,QACV,SAAS;AAAA,QACT,YAAY;AAAA,QACZ,aAAa;AAAA,QACb,cAAc;AAAA,QACd,YAAY;AAAA,QACZ,eAAe;AAAA,QACf,gBAAgB;AAAA,QAChB,iBAAiB;AAAA,QACjB,YAAY;AAAA,QACZ,WAAW;AAAA,QACX,YAAY;AAAA,QACZ,SAAS;AAAA,QACT,OAAO;AAAA,QACP,SAAS;AAAA,QACT,SAAS;AAAA,QACT,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,MAAM;AAAA;AAAA,QAEN,aAAa;AAAA,QACb,cAAc;AAAA,QACd,aAAa;AAAA,QACb,iBAAiB;AAAA,QACjB,kBAAkB;AAAA,QAClB,kBAAkB;AAAA,QAClB,eAAe;AAAA,QACf,aAAa;AAAA,MACf;AAQA,eAAS,UAAUP,SAAQ,KAAK;AAC9B,eAAOA,UAAS,IAAI,OAAO,CAAC,EAAE,YAAW,IAAK,IAAI,UAAU,CAAC;AAAA,MAC/D;AAOA,UAAI,WAAW,CAAC,UAAU,MAAM,OAAO,GAAG;AAG1C,aAAO,KAAK,gBAAgB,EAAE,QAAQ,SAAU,MAAM;AACpD,iBAAS,QAAQ,SAAUA,SAAQ;AACjC,2BAAiB,UAAUA,SAAQ,IAAI,CAAC,IAAI,iBAAiB,IAAI;AAAA,QACrE,CAAG;AAAA,MACH,CAAC;AAYD,eAAS,oBAAoBjG,OAAM,OAAO,kBAAkB;AAU1D,YAAI,UAAU,SAAS,QAAQ,OAAO,UAAU,aAAa,UAAU;AAEvE,YAAI,SAAS;AACX,iBAAO;AAAA,QACR;AAED,YAAI,CAAC,oBAAoB,OAAO,UAAU,YAAY,UAAU,KAAK,EAAE,iBAAiB,eAAeA,KAAI,KAAK,iBAAiBA,KAAI,IAAI;AACvI,iBAAO,QAAQ;AAAA,QAChB;AAED;AACE,yCAA+B,OAAOA,KAAI;AAAA,QAC3C;AAED,gBAAQ,KAAK,OAAO;MACtB;AAEA,UAAI,mBAAmB;AACvB,UAAI,YAAY;AAehB,eAAS,mBAAmBA,OAAM;AAChC,eAAOA,MAAK,QAAQ,kBAAkB,KAAK,EAAE,YAAW,EAAG,QAAQ,WAAW,MAAM;AAAA,MACtF;AAEA,UAAI,iBAAiB,WAAY;AAAA,MAAA;AAEjC;AAEE,YAAI,8BAA8B;AAClC,YAAI,cAAc;AAClB,YAAI,gBAAgB;AAEpB,YAAI,oCAAoC;AACxC,YAAI,mBAAmB,CAAA;AACvB,YAAI,oBAAoB,CAAA;AACxB,YAAI,oBAAoB;AACxB,YAAI,yBAAyB;AAE7B,YAAI,WAAW,SAAU8B,SAAQ;AAC/B,iBAAOA,QAAO,QAAQ,eAAe,SAAUC,IAAG,WAAW;AAC3D,mBAAO,UAAU;UACvB,CAAK;AAAA,QACL;AAEE,YAAI,0BAA0B,SAAU/B,OAAM;AAC5C,cAAI,iBAAiB,eAAeA,KAAI,KAAK,iBAAiBA,KAAI,GAAG;AACnE;AAAA,UACD;AAED,2BAAiBA,KAAI,IAAI;AAEzB;AAAA,YAAM;AAAA,YAAmDA;AAAA;AAAA;AAAA;AAAA,YAGzD,SAASA,MAAK,QAAQ,aAAa,KAAK,CAAC;AAAA,UAAC;AAAA,QAC9C;AAEE,YAAI,2BAA2B,SAAUA,OAAM;AAC7C,cAAI,iBAAiB,eAAeA,KAAI,KAAK,iBAAiBA,KAAI,GAAG;AACnE;AAAA,UACD;AAED,2BAAiBA,KAAI,IAAI;AAEzB,gBAAM,mEAAmEA,OAAMA,MAAK,OAAO,CAAC,EAAE,YAAa,IAAGA,MAAK,MAAM,CAAC,CAAC;AAAA,QAC/H;AAEE,YAAI,8BAA8B,SAAUA,OAAM,OAAO;AACvD,cAAI,kBAAkB,eAAe,KAAK,KAAK,kBAAkB,KAAK,GAAG;AACvE;AAAA,UACD;AAED,4BAAkB,KAAK,IAAI;AAE3B,gBAAM,8EAAmFA,OAAM,MAAM,QAAQ,mCAAmC,EAAE,CAAC;AAAA,QACvJ;AAEE,YAAI,sBAAsB,SAAUA,OAAM,OAAO;AAC/C,cAAI,mBAAmB;AACrB;AAAA,UACD;AAED,8BAAoB;AAEpB,gBAAM,8DAA8DA,KAAI;AAAA,QAC5E;AAEE,YAAI,2BAA2B,SAAUA,OAAM,OAAO;AACpD,cAAI,wBAAwB;AAC1B;AAAA,UACD;AAED,mCAAyB;AAEzB,gBAAM,mEAAmEA,KAAI;AAAA,QACjF;AAEE,yBAAiB,SAAUA,OAAM,OAAO;AACtC,cAAIA,MAAK,QAAQ,GAAG,IAAI,IAAI;AAC1B,oCAAwBA,KAAI;AAAA,UAC7B,WAAU,4BAA4B,KAAKA,KAAI,GAAG;AACjD,qCAAyBA,KAAI;AAAA,UAC9B,WAAU,kCAAkC,KAAK,KAAK,GAAG;AACxD,wCAA4BA,OAAM,KAAK;AAAA,UACxC;AAED,cAAI,OAAO,UAAU,UAAU;AAC7B,gBAAI,MAAM,KAAK,GAAG;AAChB,kCAAoBA,OAAM,KAAK;AAAA,YACvC,WAAiB,CAAC,SAAS,KAAK,GAAG;AAC3B,uCAAyBA,OAAM,KAAK;AAAA,YACrC;AAAA,UACF;AAAA,QACL;AAAA,MACA;AAEA,UAAI,mBAAmB;AAavB,eAAS,+BAA+ByF,SAAQ;AAC9C;AACE,cAAI,aAAa;AACjB,cAAI,YAAY;AAEhB,mBAAS,aAAaA,SAAQ;AAC5B,gBAAI,CAACA,QAAO,eAAe,SAAS,GAAG;AACrC;AAAA,YACD;AAED,gBAAI,aAAaA,QAAO,SAAS;AAEjC,gBAAI,cAAc,MAAM;AACtB,kBAAI,mBAAmB,UAAU,QAAQ,IAAI,MAAM;AACnD,4BAAc,aAAa,mBAAmB,YAAY,mBAAmB,SAAS,KAAK;AAC3F,4BAAc,oBAAoB,WAAW,YAAY,gBAAgB;AACzE,0BAAY;AAAA,YACb;AAAA,UACF;AAED,iBAAO,cAAc;AAAA,QACtB;AAAA,MACH;AASA,eAAS,kBAAkB,MAAMA,SAAQ;AACvC,YAAIgB,SAAQ,KAAK;AAEjB,iBAAS,aAAahB,SAAQ;AAC5B,cAAI,CAACA,QAAO,eAAe,SAAS,GAAG;AACrC;AAAA,UACD;AAED,cAAI,mBAAmB,UAAU,QAAQ,IAAI,MAAM;AAEnD;AACE,gBAAI,CAAC,kBAAkB;AACrB,+BAAiB,WAAWA,QAAO,SAAS,CAAC;AAAA,YAC9C;AAAA,UACF;AAED,cAAI,aAAa,oBAAoB,WAAWA,QAAO,SAAS,GAAG,gBAAgB;AAEnF,cAAI,cAAc,SAAS;AACzB,wBAAY;AAAA,UACb;AAED,cAAI,kBAAkB;AACpB,YAAAgB,OAAM,YAAY,WAAW,UAAU;AAAA,UAC7C,OAAW;AACL,YAAAA,OAAM,SAAS,IAAI;AAAA,UACpB;AAAA,QACF;AAAA,MACH;AAEA,eAAS,aAAa,OAAO;AAC3B,eAAO,SAAS,QAAQ,OAAO,UAAU,aAAa,UAAU;AAAA,MAClE;AAWA,eAAS,mBAAmBhB,SAAQ;AAClC,YAAI,WAAW,CAAA;AAEf,iBAAS,OAAOA,SAAQ;AACtB,cAAI,YAAY,oBAAoB,GAAG,KAAK,CAAC,GAAG;AAEhD,mBAAS/F,KAAI,GAAGA,KAAI,UAAU,QAAQA,MAAK;AACzC,qBAAS,UAAUA,EAAC,CAAC,IAAI;AAAA,UAC1B;AAAA,QACF;AAED,eAAO;AAAA,MACT;AAiBA,eAAS,wCAAwC,cAAc,YAAY;AACzE;AACE,cAAI,CAAC,YAAY;AACf;AAAA,UACD;AAED,cAAI,kBAAkB,mBAAmB,YAAY;AACrD,cAAI,iBAAiB,mBAAmB,UAAU;AAClD,cAAI,cAAc,CAAA;AAElB,mBAAS,OAAO,iBAAiB;AAC/B,gBAAI,cAAc,gBAAgB,GAAG;AACrC,gBAAI,qBAAqB,eAAe,GAAG;AAE3C,gBAAI,sBAAsB,gBAAgB,oBAAoB;AAC5D,kBAAI,aAAa,cAAc,MAAM;AAErC,kBAAI,YAAY,UAAU,GAAG;AAC3B;AAAA,cACD;AAED,0BAAY,UAAU,IAAI;AAE1B,oBAAM,uPAA2Q,aAAa,aAAa,WAAW,CAAC,IAAI,aAAa,YAAY,aAAa,kBAAkB;AAAA,YACpX;AAAA,UACF;AAAA,QACF;AAAA,MACH;AAIA,UAAI,mBAAmB;AAAA,QACrB,MAAM;AAAA,QACN,MAAM;AAAA,QACN,IAAI;AAAA,QACJ,KAAK;AAAA,QACL,OAAO;AAAA,QACP,IAAI;AAAA,QACJ,KAAK;AAAA,QACL,OAAO;AAAA,QACP,QAAQ;AAAA,QACR,MAAM;AAAA,QACN,MAAM;AAAA,QACN,OAAO;AAAA,QACP,QAAQ;AAAA,QACR,OAAO;AAAA,QACP,KAAK;AAAA;AAAA,MAEP;AAIA,UAAI,kBAAkB,OAAO;AAAA,QAC3B,UAAU;AAAA,MACZ,GAAG,gBAAgB;AAEnB,UAAI,OAAO;AAEX,eAAS,iBAAiB,KAAK,OAAO;AACpC,YAAI,CAAC,OAAO;AACV;AAAA,QACD;AAGD,YAAI,gBAAgB,GAAG,GAAG;AACxB,cAAI,MAAM,YAAY,QAAQ,MAAM,2BAA2B,MAAM;AACnE,kBAAM,IAAI,MAAM,MAAM,4FAAiG;AAAA,UACxH;AAAA,QACF;AAED,YAAI,MAAM,2BAA2B,MAAM;AACzC,cAAI,MAAM,YAAY,MAAM;AAC1B,kBAAM,IAAI,MAAM,oEAAoE;AAAA,UACrF;AAED,cAAI,OAAO,MAAM,4BAA4B,YAAY,EAAE,QAAQ,MAAM,0BAA0B;AACjG,kBAAM,IAAI,MAAM,6JAAuK;AAAA,UACxL;AAAA,QACF;AAED;AACE,cAAI,CAAC,MAAM,kCAAkC,MAAM,mBAAmB,MAAM,YAAY,MAAM;AAC5F,kBAAM,2NAA0O;AAAA,UACjP;AAAA,QACF;AAED,YAAI,MAAM,SAAS,QAAQ,OAAO,MAAM,UAAU,UAAU;AAC1D,gBAAM,IAAI,MAAM,sJAAgK;AAAA,QACjL;AAAA,MACH;AAEA,eAAS,kBAAkB,SAAS,OAAO;AACzC,YAAI,QAAQ,QAAQ,GAAG,MAAM,IAAI;AAC/B,iBAAO,OAAO,MAAM,OAAO;AAAA,QAC5B;AAED,gBAAQ,SAAO;AAAA,UAKb,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AACH,mBAAO;AAAA,UAET;AACE,mBAAO;AAAA,QACV;AAAA,MACH;AAKA,UAAI,wBAAwB;AAAA;AAAA,QAE1B,QAAQ;AAAA,QACR,eAAe;AAAA,QACf,kBAAkB;AAAA,QAClB,WAAW;AAAA,QACX,QAAQ;AAAA,QACR,iBAAiB;AAAA,QACjB,KAAK;AAAA,QACL,IAAI;AAAA,QACJ,OAAO;AAAA,QACP,gBAAgB;AAAA,QAChB,cAAc;AAAA,QACd,aAAa;AAAA,QACb,WAAW;AAAA,QACX,UAAU;AAAA,QACV,UAAU;AAAA,QACV,SAAS;AAAA,QACT,aAAa;AAAA,QACb,aAAa;AAAA,QACb,WAAW;AAAA,QACX,SAAS;AAAA,QACT,SAAS;AAAA,QACT,UAAU;AAAA,QACV,MAAM;AAAA,QACN,OAAO;AAAA,QACP,SAAS;AAAA,QACT,WAAW;AAAA,QACX,MAAM;AAAA,QACN,SAAS;AAAA,QACT,SAAS;AAAA,QACT,iBAAiB;AAAA,QACjB,aAAa;AAAA,QACb,UAAU;AAAA,QACV,cAAc;AAAA,QACd,QAAQ;AAAA,QACR,aAAa;AAAA,QACb,yBAAyB;AAAA,QACzB,MAAM;AAAA,QACN,UAAU;AAAA,QACV,SAAS;AAAA,QACT,gBAAgB;AAAA,QAChB,cAAc;AAAA,QACd,OAAO;AAAA,QACP,KAAK;AAAA,QACL,UAAU;AAAA,QACV,yBAAyB;AAAA,QACzB,uBAAuB;AAAA,QACvB,UAAU;AAAA,QACV,WAAW;AAAA,QACX,SAAS;AAAA,QACT,cAAc;AAAA,QACd,KAAK;AAAA,QACL,MAAM;AAAA,QACN,YAAY;AAAA,QACZ,YAAY;AAAA,QACZ,aAAa;AAAA,QACb,gBAAgB;AAAA,QAChB,YAAY;AAAA,QACZ,aAAa;AAAA,QACb,SAAS;AAAA,QACT,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,QACV,SAAS;AAAA,QACT,WAAW;AAAA,QACX,cAAc;AAAA,QACd,MAAM;AAAA,QACN,IAAI;AAAA,QACJ,YAAY;AAAA,QACZ,aAAa;AAAA,QACb,WAAW;AAAA,QACX,WAAW;AAAA,QACX,WAAW;AAAA,QACX,IAAI;AAAA,QACJ,QAAQ;AAAA,QACR,UAAU;AAAA,QACV,SAAS;AAAA,QACT,WAAW;AAAA,QACX,UAAU;AAAA,QACV,WAAW;AAAA,QACX,SAAS;AAAA,QACT,MAAM;AAAA,QACN,OAAO;AAAA,QACP,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,QACN,KAAK;AAAA,QACL,UAAU;AAAA,QACV,aAAa;AAAA,QACb,cAAc;AAAA,QACd,KAAK;AAAA,QACL,WAAW;AAAA,QACX,OAAO;AAAA,QACP,YAAY;AAAA,QACZ,QAAQ;AAAA,QACR,KAAK;AAAA,QACL,WAAW;AAAA,QACX,UAAU;AAAA,QACV,OAAO;AAAA,QACP,MAAM;AAAA,QACN,UAAU;AAAA,QACV,OAAO;AAAA,QACP,YAAY;AAAA,QACZ,MAAM;AAAA,QACN,SAAS;AAAA,QACT,SAAS;AAAA,QACT,aAAa;AAAA,QACb,aAAa;AAAA,QACb,QAAQ;AAAA,QACR,SAAS;AAAA,QACT,SAAS;AAAA,QACT,YAAY;AAAA,QACZ,UAAU;AAAA,QACV,gBAAgB;AAAA,QAChB,KAAK;AAAA,QACL,UAAU;AAAA,QACV,UAAU;AAAA,QACV,MAAM;AAAA,QACN,MAAM;AAAA,QACN,SAAS;AAAA,QACT,SAAS;AAAA,QACT,OAAO;AAAA,QACP,QAAQ;AAAA,QACR,WAAW;AAAA,QACX,UAAU;AAAA,QACV,UAAU;AAAA,QACV,OAAO;AAAA,QACP,MAAM;AAAA,QACN,OAAO;AAAA,QACP,MAAM;AAAA,QACN,YAAY;AAAA,QACZ,KAAK;AAAA,QACL,QAAQ;AAAA,QACR,SAAS;AAAA,QACT,QAAQ;AAAA,QACR,OAAO;AAAA,QACP,MAAM;AAAA,QACN,OAAO;AAAA,QACP,SAAS;AAAA,QACT,UAAU;AAAA,QACV,QAAQ;AAAA,QACR,OAAO;AAAA,QACP,MAAM;AAAA,QACN,QAAQ;AAAA,QACR,OAAO;AAAA,QACP,OAAO;AAAA,QACP,OAAO;AAAA,QACP,MAAM;AAAA;AAAA,QAEN,OAAO;AAAA,QACP,cAAc;AAAA,QACd,iBAAiB;AAAA,QACjB,YAAY;AAAA,QACZ,UAAU;AAAA,QACV,mBAAmB;AAAA,QACnB,sBAAsB;AAAA,QACtB,cAAc;AAAA,QACd,YAAY;AAAA,QACZ,WAAW;AAAA,QACX,YAAY;AAAA,QACZ,eAAe;AAAA,QACf,QAAQ;AAAA,QACR,eAAe;AAAA,QACf,eAAe;AAAA,QACf,aAAa;AAAA,QACb,SAAS;AAAA,QACT,eAAe;AAAA,QACf,eAAe;AAAA,QACf,kBAAkB;AAAA,QAClB,aAAa;AAAA,QACb,MAAM;AAAA,QACN,OAAO;AAAA,QACP,MAAM;AAAA,QACN,IAAI;AAAA,QACJ,UAAU;AAAA,QACV,WAAW;AAAA,QACX,cAAc;AAAA,QACd,MAAM;AAAA,QACN,UAAU;AAAA,QACV,aAAa;AAAA,QACb,eAAe;AAAA,QACf,UAAU;AAAA,QACV,aAAa;AAAA,QACb,OAAO;AAAA,QACP,oBAAoB;AAAA,QACpB,uBAAuB;AAAA,QACvB,2BAA2B;AAAA,QAC3B,+BAA+B;AAAA,QAC/B,cAAc;AAAA,QACd,iBAAiB;AAAA,QACjB,gBAAgB;AAAA,QAChB,mBAAmB;AAAA,QACnB,mBAAmB;AAAA,QACnB,kBAAkB;AAAA,QAClB,QAAQ;AAAA,QACR,IAAI;AAAA,QACJ,IAAI;AAAA,QACJ,GAAG;AAAA,QACH,UAAU;AAAA,QACV,YAAY;AAAA,QACZ,SAAS;AAAA,QACT,iBAAiB;AAAA,QACjB,WAAW;AAAA,QACX,SAAS;AAAA,QACT,SAAS;AAAA,QACT,kBAAkB;AAAA,QAClB,qBAAqB;AAAA,QACrB,KAAK;AAAA,QACL,IAAI;AAAA,QACJ,IAAI;AAAA,QACJ,UAAU;AAAA,QACV,WAAW;AAAA,QACX,kBAAkB;AAAA,QAClB,qBAAqB;AAAA,QACrB,KAAK;AAAA,QACL,UAAU;AAAA,QACV,2BAA2B;AAAA,QAC3B,MAAM;AAAA,QACN,aAAa;AAAA,QACb,gBAAgB;AAAA,QAChB,UAAU;AAAA,QACV,aAAa;AAAA,QACb,QAAQ;AAAA,QACR,WAAW;AAAA,QACX,aAAa;AAAA,QACb,cAAc;AAAA,QACd,iBAAiB;AAAA,QACjB,YAAY;AAAA,QACZ,eAAe;AAAA,QACf,WAAW;AAAA,QACX,YAAY;AAAA,QACZ,eAAe;AAAA,QACf,UAAU;AAAA,QACV,aAAa;AAAA,QACb,gBAAgB;AAAA,QAChB,oBAAoB;AAAA,QACpB,aAAa;AAAA,QACb,gBAAgB;AAAA,QAChB,WAAW;AAAA,QACX,cAAc;AAAA,QACd,aAAa;AAAA,QACb,gBAAgB;AAAA,QAChB,YAAY;AAAA,QACZ,eAAe;AAAA,QACf,QAAQ;AAAA,QACR,MAAM;AAAA,QACN,IAAI;AAAA,QACJ,IAAI;AAAA,QACJ,IAAI;AAAA,QACJ,IAAI;AAAA,QACJ,WAAW;AAAA,QACX,cAAc;AAAA,QACd,4BAA4B;AAAA,QAC5B,gCAAgC;AAAA,QAChC,0BAA0B;AAAA,QAC1B,8BAA8B;AAAA,QAC9B,UAAU;AAAA,QACV,mBAAmB;AAAA,QACnB,eAAe;AAAA,QACf,SAAS;AAAA,QACT,WAAW;AAAA,QACX,eAAe;AAAA,QACf,cAAc;AAAA,QACd,kBAAkB;AAAA,QAClB,aAAa;AAAA,QACb,gBAAgB;AAAA,QAChB,mBAAmB;AAAA,QACnB,KAAK;AAAA,QACL,IAAI;AAAA,QACJ,QAAQ;AAAA,QACR,WAAW;AAAA,QACX,IAAI;AAAA,QACJ,IAAI;AAAA,QACJ,IAAI;AAAA,QACJ,IAAI;AAAA,QACJ,GAAG;AAAA,QACH,cAAc;AAAA,QACd,kBAAkB;AAAA,QAClB,SAAS;AAAA,QACT,WAAW;AAAA,QACX,YAAY;AAAA,QACZ,UAAU;AAAA,QACV,cAAc;AAAA,QACd,eAAe;AAAA,QACf,kBAAkB;AAAA,QAClB,eAAe;AAAA,QACf,kBAAkB;AAAA,QAClB,mBAAmB;AAAA,QACnB,OAAO;AAAA,QACP,WAAW;AAAA,QACX,cAAc;AAAA,QACd,cAAc;AAAA,QACd,WAAW;AAAA,QACX,cAAc;AAAA,QACd,aAAa;AAAA,QACb,gBAAgB;AAAA,QAChB,aAAa;AAAA,QACb,aAAa;AAAA,QACb,MAAM;AAAA,QACN,kBAAkB;AAAA,QAClB,WAAW;AAAA,QACX,cAAc;AAAA,QACd,MAAM;AAAA,QACN,YAAY;AAAA,QACZ,QAAQ;AAAA,QACR,SAAS;AAAA,QACT,UAAU;AAAA,QACV,OAAO;AAAA,QACP,QAAQ;AAAA,QACR,aAAa;AAAA,QACb,QAAQ;AAAA,QACR,UAAU;AAAA,QACV,kBAAkB;AAAA,QAClB,qBAAqB;AAAA,QACrB,mBAAmB;AAAA,QACnB,sBAAsB;AAAA,QACtB,YAAY;AAAA,QACZ,eAAe;AAAA,QACf,SAAS;AAAA,QACT,YAAY;AAAA,QACZ,YAAY;AAAA,QACZ,qBAAqB;AAAA,QACrB,kBAAkB;AAAA,QAClB,cAAc;AAAA,QACd,eAAe;AAAA,QACf,kBAAkB;AAAA,QAClB,QAAQ;AAAA,QACR,WAAW;AAAA,QACX,WAAW;AAAA,QACX,WAAW;AAAA,QACX,QAAQ;AAAA,QACR,eAAe;AAAA,QACf,qBAAqB;AAAA,QACrB,gBAAgB;AAAA,QAChB,UAAU;AAAA,QACV,GAAG;AAAA,QACH,QAAQ;AAAA,QACR,MAAM;AAAA,QACN,MAAM;AAAA,QACN,iBAAiB;AAAA,QACjB,oBAAoB;AAAA,QACpB,aAAa;AAAA,QACb,WAAW;AAAA,QACX,oBAAoB;AAAA,QACpB,kBAAkB;AAAA,QAClB,UAAU;AAAA,QACV,SAAS;AAAA,QACT,QAAQ;AAAA,QACR,SAAS;AAAA,QACT,QAAQ;AAAA,QACR,IAAI;AAAA,QACJ,IAAI;AAAA,QACJ,OAAO;AAAA,QACP,UAAU;AAAA,QACV,MAAM;AAAA,QACN,gBAAgB;AAAA,QAChB,mBAAmB;AAAA,QACnB,OAAO;AAAA,QACP,SAAS;AAAA,QACT,kBAAkB;AAAA,QAClB,kBAAkB;AAAA,QAClB,OAAO;AAAA,QACP,cAAc;AAAA,QACd,aAAa;AAAA,QACb,cAAc;AAAA,QACd,OAAO;AAAA,QACP,OAAO;AAAA,QACP,aAAa;AAAA,QACb,WAAW;AAAA,QACX,cAAc;AAAA,QACd,aAAa;AAAA,QACb,gBAAgB;AAAA,QAChB,uBAAuB;AAAA,QACvB,0BAA0B;AAAA,QAC1B,wBAAwB;AAAA,QACxB,2BAA2B;AAAA,QAC3B,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,iBAAiB;AAAA,QACjB,oBAAoB;AAAA,QACpB,kBAAkB;AAAA,QAClB,qBAAqB;AAAA,QACrB,eAAe;AAAA,QACf,kBAAkB;AAAA,QAClB,gBAAgB;AAAA,QAChB,mBAAmB;AAAA,QACnB,kBAAkB;AAAA,QAClB,qBAAqB;AAAA,QACrB,aAAa;AAAA,QACb,gBAAgB;AAAA,QAChB,eAAe;AAAA,QACf,kBAAkB;AAAA,QAClB,gCAAgC;AAAA,QAChC,0BAA0B;AAAA,QAC1B,cAAc;AAAA,QACd,gBAAgB;AAAA,QAChB,aAAa;AAAA,QACb,SAAS;AAAA,QACT,SAAS;AAAA,QACT,YAAY;AAAA,QACZ,eAAe;AAAA,QACf,gBAAgB;AAAA,QAChB,mBAAmB;AAAA,QACnB,YAAY;AAAA,QACZ,eAAe;AAAA,QACf,kBAAkB;AAAA,QAClB,IAAI;AAAA,QACJ,WAAW;AAAA,QACX,QAAQ;AAAA,QACR,IAAI;AAAA,QACJ,IAAI;AAAA,QACJ,mBAAmB;AAAA,QACnB,sBAAsB;AAAA,QACtB,oBAAoB;AAAA,QACpB,uBAAuB;AAAA,QACvB,SAAS;AAAA,QACT,aAAa;AAAA,QACb,gBAAgB;AAAA,QAChB,cAAc;AAAA,QACd,iBAAiB;AAAA,QACjB,YAAY;AAAA,QACZ,gBAAgB;AAAA,QAChB,cAAc;AAAA,QACd,aAAa;AAAA,QACb,gBAAgB;AAAA,QAChB,QAAQ;AAAA,QACR,cAAc;AAAA,QACd,iBAAiB;AAAA,QACjB,SAAS;AAAA,QACT,UAAU;AAAA,QACV,cAAc;AAAA,QACd,aAAa;AAAA,QACb,iBAAiB;AAAA,QACjB,aAAa;AAAA,QACb,iBAAiB;AAAA,QACjB,UAAU;AAAA,QACV,aAAa;AAAA,QACb,cAAc;AAAA,QACd,iBAAiB;AAAA,QACjB,SAAS;AAAA,QACT,YAAY;AAAA,QACZ,YAAY;AAAA,QACZ,eAAe;AAAA,QACf,kBAAkB;AAAA,QAClB,OAAO;AAAA,QACP,QAAQ;AAAA,QACR,aAAa;AAAA,QACb,gBAAgB;AAAA,QAChB,aAAa;AAAA,QACb,gBAAgB;AAAA,QAChB,IAAI;AAAA,QACJ,IAAI;AAAA,QACJ,GAAG;AAAA,QACH,kBAAkB;AAAA,QAClB,SAAS;AAAA,QACT,YAAY;AAAA,QACZ,cAAc;AAAA,QACd,iBAAiB;AAAA,QACjB,cAAc;AAAA,QACd,iBAAiB;AAAA,QACjB,WAAW;AAAA,QACX,cAAc;AAAA,QACd,WAAW;AAAA,QACX,cAAc;AAAA,QACd,WAAW;AAAA,QACX,cAAc;AAAA,QACd,YAAY;AAAA,QACZ,eAAe;AAAA,QACf,WAAW;AAAA,QACX,cAAc;AAAA,QACd,SAAS;AAAA,QACT,YAAY;AAAA,QACZ,SAAS;AAAA,QACT,YAAY;AAAA,QACZ,OAAO;AAAA,QACP,aAAa;AAAA,QACb,YAAY;AAAA,QACZ,eAAe;AAAA,QACf,UAAU;AAAA,QACV,IAAI;AAAA,QACJ,IAAI;AAAA,QACJ,GAAG;AAAA,QACH,kBAAkB;AAAA,QAClB,GAAG;AAAA,QACH,YAAY;AAAA,MACd;AAEA,UAAI,iBAAiB;AAAA,QACnB,gBAAgB;AAAA;AAAA,QAEhB,oBAAoB;AAAA,QACpB,gBAAgB;AAAA,QAChB,iBAAiB;AAAA;AAAA,QAEjB,eAAe;AAAA;AAAA,QAEf,gBAAgB;AAAA;AAAA,QAEhB,qBAAqB;AAAA,QACrB,cAAc;AAAA,QACd,wBAAwB;AAAA;AAAA,QAExB,qBAAqB;AAAA,QACrB,gBAAgB;AAAA,QAChB,iBAAiB;AAAA,QACjB,iBAAiB;AAAA,QACjB,cAAc;AAAA,QACd,cAAc;AAAA,QACd,kBAAkB;AAAA,QAClB,wBAAwB;AAAA,QACxB,oBAAoB;AAAA,QACpB,oBAAoB;AAAA,QACpB,gBAAgB;AAAA,QAChB,iBAAiB;AAAA,QACjB,iBAAiB;AAAA,QACjB,iBAAiB;AAAA,QACjB,aAAa;AAAA,QACb,iBAAiB;AAAA,QACjB,iBAAiB;AAAA,QACjB,iBAAiB;AAAA,QACjB,kBAAkB;AAAA;AAAA,QAElB,eAAe;AAAA,QACf,aAAa;AAAA,QACb,aAAa;AAAA,QACb,iBAAiB;AAAA;AAAA,QAEjB,mBAAmB;AAAA,QACnB,gBAAgB;AAAA;AAAA,QAEhB,yBAAyB;AAAA,QACzB,iBAAiB;AAAA,QACjB,iBAAiB;AAAA,QACjB,gBAAgB;AAAA,QAChB,iBAAiB;AAAA,QACjB,oBAAoB;AAAA,QACpB,qBAAqB;AAAA,QACrB,eAAe;AAAA,QACf,mBAAmB;AAAA,QACnB,aAAa;AAAA,QACb,iBAAiB;AAAA,QACjB,iBAAiB;AAAA,QACjB,iBAAiB;AAAA,QACjB,gBAAgB;AAAA,QAChB,gBAAgB;AAAA,MAClB;AAEA,UAAI,mBAAmB,CAAA;AACvB,UAAI,QAAQ,IAAI,OAAO,cAAc,sBAAsB,KAAK;AAChE,UAAI,aAAa,IAAI,OAAO,kBAAkB,sBAAsB,KAAK;AAEzE,eAAS,iBAAiB,SAASM,OAAM;AACvC;AACE,cAAI,eAAe,KAAK,kBAAkBA,KAAI,KAAK,iBAAiBA,KAAI,GAAG;AACzE,mBAAO;AAAA,UACR;AAED,cAAI,WAAW,KAAKA,KAAI,GAAG;AACzB,gBAAI,WAAW,UAAUA,MAAK,MAAM,CAAC,EAAE;AACvC,gBAAI,cAAc,eAAe,eAAe,QAAQ,IAAI,WAAW;AAGvE,gBAAI,eAAe,MAAM;AACvB,oBAAM,iGAAiGA,KAAI;AAE3G,+BAAiBA,KAAI,IAAI;AACzB,qBAAO;AAAA,YACR;AAGD,gBAAIA,UAAS,aAAa;AACxB,oBAAM,mDAAmDA,OAAM,WAAW;AAE1E,+BAAiBA,KAAI,IAAI;AACzB,qBAAO;AAAA,YACR;AAAA,UACF;AAED,cAAI,MAAM,KAAKA,KAAI,GAAG;AACpB,gBAAI,iBAAiBA,MAAK;AAC1B,gBAAI,eAAe,eAAe,eAAe,cAAc,IAAI,iBAAiB;AAGpF,gBAAI,gBAAgB,MAAM;AACxB,+BAAiBA,KAAI,IAAI;AACzB,qBAAO;AAAA,YACR;AAGD,gBAAIA,UAAS,cAAc;AACzB,oBAAM,mDAAmDA,OAAM,YAAY;AAE3E,+BAAiBA,KAAI,IAAI;AACzB,qBAAO;AAAA,YACR;AAAA,UACF;AAAA,QACF;AAED,eAAO;AAAA,MACT;AAEA,eAAS,qBAAqB,MAAM,OAAO;AACzC;AACE,cAAI,eAAe,CAAA;AAEnB,mBAAS,OAAO,OAAO;AACrB,gBAAI,UAAU,iBAAiB,MAAM,GAAG;AAExC,gBAAI,CAAC,SAAS;AACZ,2BAAa,KAAK,GAAG;AAAA,YACtB;AAAA,UACF;AAED,cAAI,oBAAoB,aAAa,IAAI,SAAU,MAAM;AACvD,mBAAO,MAAM,OAAO;AAAA,UAC1B,CAAK,EAAE,KAAK,IAAI;AAEZ,cAAI,aAAa,WAAW,GAAG;AAC7B,kBAAM,kGAAuG,mBAAmB,IAAI;AAAA,UAC1I,WAAe,aAAa,SAAS,GAAG;AAClC,kBAAM,mGAAwG,mBAAmB,IAAI;AAAA,UACtI;AAAA,QACF;AAAA,MACH;AAEA,eAAS,mBAAmB,MAAM,OAAO;AACvC,YAAI,kBAAkB,MAAM,KAAK,GAAG;AAClC;AAAA,QACD;AAED,6BAAqB,MAAM,KAAK;AAAA,MAClC;AAEA,UAAI,mBAAmB;AACvB,eAAS,qBAAqB,MAAM,OAAO;AACzC;AACE,cAAI,SAAS,WAAW,SAAS,cAAc,SAAS,UAAU;AAChE;AAAA,UACD;AAED,cAAI,SAAS,QAAQ,MAAM,UAAU,QAAQ,CAAC,kBAAkB;AAC9D,+BAAmB;AAEnB,gBAAI,SAAS,YAAY,MAAM,UAAU;AACvC,oBAAM,8KAAwL,IAAI;AAAA,YAC1M,OAAa;AACL,oBAAM,8IAAwJ,IAAI;AAAA,YACnK;AAAA,UACF;AAAA,QACF;AAAA,MACH;AAEA,UAAI,qBAAqB,WAAY;AAAA,MAAA;AAErC;AACE,YAAI,qBAAqB,CAAA;AACzB,YAAI,mBAAmB;AACvB,YAAI,2BAA2B;AAC/B,YAAI,UAAU,IAAI,OAAO,cAAc,sBAAsB,KAAK;AAClE,YAAI,eAAe,IAAI,OAAO,kBAAkB,sBAAsB,KAAK;AAE3E,6BAAqB,SAAU,SAASA,OAAM,OAAO,eAAe;AAClE,cAAI,eAAe,KAAK,oBAAoBA,KAAI,KAAK,mBAAmBA,KAAI,GAAG;AAC7E,mBAAO;AAAA,UACR;AAED,cAAI,iBAAiBA,MAAK;AAE1B,cAAI,mBAAmB,eAAe,mBAAmB,cAAc;AACrE,kBAAM,8KAAwL;AAE9L,+BAAmBA,KAAI,IAAI;AAC3B,mBAAO;AAAA,UACR;AAGD,cAAI,iBAAiB,MAAM;AACzB,gBAAI0G,gCAA+B,cAAc,8BAC7CC,6BAA4B,cAAc;AAE9C,gBAAID,8BAA6B,eAAe1G,KAAI,GAAG;AACrD,qBAAO;AAAA,YACR;AAED,gBAAI,mBAAmB2G,2BAA0B,eAAe,cAAc,IAAIA,2BAA0B,cAAc,IAAI;AAE9H,gBAAI,oBAAoB,MAAM;AAC5B,oBAAM,2DAA2D3G,OAAM,gBAAgB;AAEvF,iCAAmBA,KAAI,IAAI;AAC3B,qBAAO;AAAA,YACR;AAED,gBAAI,iBAAiB,KAAKA,KAAI,GAAG;AAC/B,oBAAM,4DAA4DA,KAAI;AAEtE,iCAAmBA,KAAI,IAAI;AAC3B,qBAAO;AAAA,YACR;AAAA,UACF,WAAU,iBAAiB,KAAKA,KAAI,GAAG;AAItC,gBAAI,yBAAyB,KAAKA,KAAI,GAAG;AACvC,oBAAM,iHAAsHA,KAAI;AAAA,YACjI;AAED,+BAAmBA,KAAI,IAAI;AAC3B,mBAAO;AAAA,UACR;AAGD,cAAI,QAAQ,KAAKA,KAAI,KAAK,aAAa,KAAKA,KAAI,GAAG;AACjD,mBAAO;AAAA,UACR;AAED,cAAI,mBAAmB,aAAa;AAClC,kBAAM,kIAAuI;AAE7I,+BAAmBA,KAAI,IAAI;AAC3B,mBAAO;AAAA,UACR;AAED,cAAI,mBAAmB,QAAQ;AAC7B,kBAAM,uGAA4G;AAElH,+BAAmBA,KAAI,IAAI;AAC3B,mBAAO;AAAA,UACR;AAED,cAAI,mBAAmB,QAAQ,UAAU,QAAQ,UAAU,UAAa,OAAO,UAAU,UAAU;AACjG,kBAAM,iGAAsG,OAAO,KAAK;AAExH,+BAAmBA,KAAI,IAAI;AAC3B,mBAAO;AAAA,UACR;AAED,cAAI,OAAO,UAAU,YAAY,MAAM,KAAK,GAAG;AAC7C,kBAAM,yFAA8FA,KAAI;AAExG,+BAAmBA,KAAI,IAAI;AAC3B,mBAAO;AAAA,UACR;AAED,cAAI,eAAe,gBAAgBA,KAAI;AACvC,cAAI,aAAa,iBAAiB,QAAQ,aAAa,SAAS;AAEhE,cAAI,sBAAsB,eAAe,cAAc,GAAG;AACxD,gBAAI,eAAe,sBAAsB,cAAc;AAEvD,gBAAI,iBAAiBA,OAAM;AACzB,oBAAM,iDAAiDA,OAAM,YAAY;AAEzE,iCAAmBA,KAAI,IAAI;AAC3B,qBAAO;AAAA,YACR;AAAA,UACF,WAAU,CAAC,cAAcA,UAAS,gBAAgB;AAGjD,kBAAM,gQAAoRA,OAAM,cAAc;AAE9S,+BAAmBA,KAAI,IAAI;AAC3B,mBAAO;AAAA,UACR;AAED,cAAI,OAAO,UAAU,aAAa,iCAAiCA,OAAM,OAAO,cAAc,KAAK,GAAG;AACpG,gBAAI,OAAO;AACT,oBAAM,mJAA6J,OAAOA,OAAMA,OAAM,OAAOA,KAAI;AAAA,YACzM,OAAa;AACL,oBAAM,0QAA8R,OAAOA,OAAMA,OAAM,OAAOA,OAAMA,OAAMA,KAAI;AAAA,YAC/U;AAED,+BAAmBA,KAAI,IAAI;AAC3B,mBAAO;AAAA,UACR;AAID,cAAI,YAAY;AACd,mBAAO;AAAA,UACR;AAGD,cAAI,iCAAiCA,OAAM,OAAO,cAAc,KAAK,GAAG;AACtE,+BAAmBA,KAAI,IAAI;AAC3B,mBAAO;AAAA,UACR;AAGD,eAAK,UAAU,WAAW,UAAU,WAAW,iBAAiB,QAAQ,aAAa,SAAS,SAAS;AACrG,kBAAM,qFAA+F,OAAOA,OAAM,UAAU,UAAU,qDAAqD,qFAAqFA,OAAM,KAAK;AAE3R,+BAAmBA,KAAI,IAAI;AAC3B,mBAAO;AAAA,UACR;AAED,iBAAO;AAAA,QACX;AAAA,MACA;AAEA,UAAI,wBAAwB,SAAU,MAAM,OAAO,eAAe;AAChE;AACE,cAAI,eAAe,CAAA;AAEnB,mBAAS,OAAO,OAAO;AACrB,gBAAI,UAAU,mBAAmB,MAAM,KAAK,MAAM,GAAG,GAAG,aAAa;AAErE,gBAAI,CAAC,SAAS;AACZ,2BAAa,KAAK,GAAG;AAAA,YACtB;AAAA,UACF;AAED,cAAI,oBAAoB,aAAa,IAAI,SAAU,MAAM;AACvD,mBAAO,MAAM,OAAO;AAAA,UAC1B,CAAK,EAAE,KAAK,IAAI;AAEZ,cAAI,aAAa,WAAW,GAAG;AAC7B,kBAAM,mMAA6M,mBAAmB,IAAI;AAAA,UAChP,WAAe,aAAa,SAAS,GAAG;AAClC,kBAAM,yMAAmN,mBAAmB,IAAI;AAAA,UACjP;AAAA,QACF;AAAA,MACH;AAEA,eAAS,qBAAqB,MAAM,OAAO,eAAe;AACxD,YAAI,kBAAkB,MAAM,KAAK,GAAG;AAClC;AAAA,QACD;AAED,8BAAsB,MAAM,OAAO,aAAa;AAAA,MAClD;AAEA,UAAI,mCAAmC;AACvC,UAAI,mBAAmB,KAAK;AAC5B,UAAI,mBAAmB,KAAK;AAM5B,UAAI,4CAA4C,mCAAmC,mBAAmB;AAItG,UAAI,wBAAwB;AAC5B,eAAS,kBAAkB,OAAO;AAChC;AACE,cAAI,0BAA0B,MAAM;AAClC,kBAAM,qHAA0H;AAAA,UACjI;AAAA,QACF;AAED,gCAAwB;AAAA,MAC1B;AACA,eAAS,sBAAsB;AAC7B;AACE,cAAI,0BAA0B,MAAM;AAClC,kBAAM,yHAA8H;AAAA,UACrI;AAAA,QACF;AAED,gCAAwB;AAAA,MAC1B;AACA,eAAS,iBAAiB,OAAO;AAC/B,eAAO,UAAU;AAAA,MACnB;AAUA,eAAS,eAAe,aAAa;AAGnC,YAAI,SAAS,YAAY,UAAU,YAAY,cAAc;AAE7D,YAAI,OAAO,yBAAyB;AAClC,mBAAS,OAAO;AAAA,QACjB;AAID,eAAO,OAAO,aAAa,YAAY,OAAO,aAAa;AAAA,MAC7D;AAEA,UAAI,cAAc;AAClB,UAAI,gBAAgB;AACpB,UAAI,eAAe;AAEnB,eAAS,qBAAqB,QAAQ;AAGpC,YAAI,mBAAmB,oBAAoB,MAAM;AAEjD,YAAI,CAAC,kBAAkB;AAErB;AAAA,QACD;AAED,YAAI,OAAO,gBAAgB,YAAY;AACrC,gBAAM,IAAI,MAAM,8JAAmK;AAAA,QACpL;AAED,YAAI,YAAY,iBAAiB;AAEjC,YAAI,WAAW;AACb,cAAI,SAAS,6BAA6B,SAAS;AAEnD,sBAAY,iBAAiB,WAAW,iBAAiB,MAAM,MAAM;AAAA,QACtE;AAAA,MACH;AAEA,eAAS,yBAAyB,MAAM;AACtC,sBAAc;AAAA,MAChB;AACA,eAAS,oBAAoB,QAAQ;AACnC,YAAI,eAAe;AACjB,cAAI,cAAc;AAChB,yBAAa,KAAK,MAAM;AAAA,UAC9B,OAAW;AACL,2BAAe,CAAC,MAAM;AAAA,UACvB;AAAA,QACL,OAAS;AACL,0BAAgB;AAAA,QACjB;AAAA,MACH;AACA,eAAS,oBAAoB;AAC3B,eAAO,kBAAkB,QAAQ,iBAAiB;AAAA,MACpD;AACA,eAAS,uBAAuB;AAC9B,YAAI,CAAC,eAAe;AAClB;AAAA,QACD;AAED,YAAI,SAAS;AACb,YAAI,gBAAgB;AACpB,wBAAgB;AAChB,uBAAe;AACf,6BAAqB,MAAM;AAE3B,YAAI,eAAe;AACjB,mBAASN,KAAI,GAAGA,KAAI,cAAc,QAAQA,MAAK;AAC7C,iCAAqB,cAAcA,EAAC,CAAC;AAAA,UACtC;AAAA,QACF;AAAA,MACH;AAQA,UAAI,qBAAqB,SAAU,IAAI,aAAa;AAClD,eAAO,GAAG,WAAW;AAAA,MACvB;AAEA,UAAI,gBAAgB,WAAY;AAAA,MAAA;AAEhC,UAAI,uBAAuB;AAE3B,eAAS,qBAAqB;AAK5B,YAAI,yCAAyC;AAE7C,YAAI,wCAAwC;AAM1C;AACA;QACD;AAAA,MACH;AAEA,eAAS,eAAe,IAAIL,IAAGsB,IAAG;AAChC,YAAI,sBAAsB;AAGxB,iBAAO,GAAGtB,IAAGsB,EAAC;AAAA,QACf;AAED,+BAAuB;AAEvB,YAAI;AACF,iBAAO,mBAAmB,IAAItB,IAAGsB,EAAC;AAAA,QACtC,UAAY;AACR,iCAAuB;AACvB;QACD;AAAA,MACH;AACA,eAAS,0BAA0B,qBAAqB,sBAAsB,gBAAgB;AAC5F,6BAAqB;AACrB,wBAAgB;AAAA,MAClB;AAEA,eAAS,cAAc,KAAK;AAC1B,eAAO,QAAQ,YAAY,QAAQ,WAAW,QAAQ,YAAY,QAAQ;AAAA,MAC5E;AAEA,eAAS,wBAAwBX,OAAM,MAAM,OAAO;AAClD,gBAAQA,OAAI;AAAA,UACV,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AACH,mBAAO,CAAC,EAAE,MAAM,YAAY,cAAc,IAAI;AAAA,UAEhD;AACE,mBAAO;AAAA,QACV;AAAA,MACH;AAQA,eAAS,YAAY,MAAM,kBAAkB;AAC3C,YAAI,YAAY,KAAK;AAErB,YAAI,cAAc,MAAM;AAEtB,iBAAO;AAAA,QACR;AAED,YAAI,QAAQ,6BAA6B,SAAS;AAElD,YAAI,UAAU,MAAM;AAElB,iBAAO;AAAA,QACR;AAED,YAAI,WAAW,MAAM,gBAAgB;AAErC,YAAI,wBAAwB,kBAAkB,KAAK,MAAM,KAAK,GAAG;AAC/D,iBAAO;AAAA,QACR;AAED,YAAI,YAAY,OAAO,aAAa,YAAY;AAC9C,gBAAM,IAAI,MAAM,eAAe,mBAAmB,0DAA0D,OAAO,WAAW,SAAS;AAAA,QACxI;AAED,eAAO;AAAA,MACT;AAEA,UAAI,gCAAgC;AAGpC,UAAI,WAAW;AACb,YAAI;AACF,cAAI,UAAU,CAAA;AAEd,iBAAO,eAAe,SAAS,WAAW;AAAA,YACxC,KAAK,WAAY;AACf,8CAAgC;AAAA,YACjC;AAAA,UACP,CAAK;AACD,iBAAO,iBAAiB,QAAQ,SAAS,OAAO;AAChD,iBAAO,oBAAoB,QAAQ,SAAS,OAAO;AAAA,QACpD,SAAQT,IAAG;AACV,0CAAgC;AAAA,QACjC;AAAA,MACH;AAEA,eAAS,0BAA0BS,OAAM,MAAM,SAASX,IAAGsB,IAAGf,IAAGmB,IAAGxB,IAAGqC,IAAG;AACxE,YAAI,WAAW,MAAM,UAAU,MAAM,KAAK,WAAW,CAAC;AAEtD,YAAI;AACF,eAAK,MAAM,SAAS,QAAQ;AAAA,QAC7B,SAAQ7B,QAAO;AACd,eAAK,QAAQA,MAAK;AAAA,QACnB;AAAA,MACH;AAEA,UAAI,4BAA4B;AAEhC;AAqBE,YAAI,OAAO,WAAW,eAAe,OAAO,OAAO,kBAAkB,cAAc,OAAO,aAAa,eAAe,OAAO,SAAS,gBAAgB,YAAY;AAChK,cAAI,WAAW,SAAS,cAAc,OAAO;AAE7C,sCAA4B,SAAS,yBAAyBC,OAAM,MAAM,SAASX,IAAGsB,IAAGf,IAAGmB,IAAGxB,IAAGqC,IAAG;AAKnG,gBAAI,OAAO,aAAa,eAAe,aAAa,MAAM;AACxD,oBAAM,IAAI,MAAM,scAAoe;AAAA,YACrf;AAED,gBAAI,MAAM,SAAS,YAAY,OAAO;AACtC,gBAAI,UAAU;AAOd,gBAAI,WAAW;AAIf,gBAAI,cAAc,OAAO;AAGzB,gBAAI,wBAAwB,OAAO,yBAAyB,QAAQ,OAAO;AAE3E,qBAAS,uBAAuB;AAK9B,uBAAS,oBAAoB,SAASgF,eAAc,KAAK;AAKzD,kBAAI,OAAO,OAAO,UAAU,eAAe,OAAO,eAAe,OAAO,GAAG;AACzE,uBAAO,QAAQ;AAAA,cAChB;AAAA,YACF;AAKD,gBAAI,WAAW,MAAM,UAAU,MAAM,KAAK,WAAW,CAAC;AAEtD,qBAASA,gBAAe;AACtB,wBAAU;AACV;AACA,mBAAK,MAAM,SAAS,QAAQ;AAC5B,yBAAW;AAAA,YACZ;AAaD,gBAAI7G;AAEJ,gBAAI,cAAc;AAClB,gBAAI,qBAAqB;AAEzB,qBAAS,kBAAkB,OAAO;AAChC,cAAAA,SAAQ,MAAM;AACd,4BAAc;AAEd,kBAAIA,WAAU,QAAQ,MAAM,UAAU,KAAK,MAAM,WAAW,GAAG;AAC7D,qCAAqB;AAAA,cACtB;AAED,kBAAI,MAAM,kBAAkB;AAI1B,oBAAIA,UAAS,QAAQ,OAAOA,WAAU,UAAU;AAC9C,sBAAI;AACF,oBAAAA,OAAM,mBAAmB;AAAA,kBAC1B,SAAQ,OAAO;AAAA,kBACf;AAAA,gBACF;AAAA,cACF;AAAA,YACF;AAGD,gBAAI,UAAU,YAAYC,QAAOA,QAAO;AAExC,mBAAO,iBAAiB,SAAS,iBAAiB;AAClD,qBAAS,iBAAiB,SAAS4G,eAAc,KAAK;AAGtD,gBAAI,UAAU,SAAS,OAAO,KAAK;AACnC,qBAAS,cAAc,GAAG;AAE1B,gBAAI,uBAAuB;AACzB,qBAAO,eAAe,QAAQ,SAAS,qBAAqB;AAAA,YAC7D;AAED,gBAAI,WAAW,UAAU;AACvB,kBAAI,CAAC,aAAa;AAGhB,gBAAA7G,SAAQ,IAAI,MAAM,mdAAsf;AAAA,cACzgB,WAAU,oBAAoB;AAE7B,gBAAAA,SAAQ,IAAI,MAAM,4KAAsL;AAAA,cACzM;AAED,mBAAK,QAAQA,MAAK;AAAA,YACnB;AAGD,mBAAO,oBAAoB,SAAS,iBAAiB;AAErD,gBAAI,CAAC,SAAS;AAKZ;AACA,qBAAO,0BAA0B,MAAM,MAAM,SAAS;AAAA,YACvD;AAAA,UACP;AAAA,QACG;AAAA,MACH;AAEA,UAAI,8BAA8B;AAElC,UAAI,WAAW;AACf,UAAI,cAAc;AAElB,UAAI,kBAAkB;AACtB,UAAI,eAAe;AACnB,UAAI,WAAW;AAAA,QACb,SAAS,SAAUA,QAAO;AACxB,qBAAW;AACX,wBAAcA;AAAA,QACf;AAAA,MACH;AAeA,eAAS,sBAAsBC,OAAM,MAAM,SAASX,IAAGsB,IAAGf,IAAGmB,IAAGxB,IAAGqC,IAAG;AACpE,mBAAW;AACX,sBAAc;AACd,oCAA4B,MAAM,UAAU,SAAS;AAAA,MACvD;AAYA,eAAS,wCAAwC5B,OAAM,MAAM,SAASX,IAAGsB,IAAGf,IAAGmB,IAAGxB,IAAGqC,IAAG;AACtF,8BAAsB,MAAM,MAAM,SAAS;AAE3C,YAAI,UAAU;AACZ,cAAI7B,SAAQ;AAEZ,cAAI,CAAC,iBAAiB;AACpB,8BAAkB;AAClB,2BAAeA;AAAA,UAChB;AAAA,QACF;AAAA,MACH;AAMA,eAAS,qBAAqB;AAC5B,YAAI,iBAAiB;AACnB,cAAIA,SAAQ;AACZ,4BAAkB;AAClB,yBAAe;AACf,gBAAMA;AAAA,QACP;AAAA,MACH;AACA,eAAS,iBAAiB;AACxB,eAAO;AAAA,MACT;AACA,eAAS,mBAAmB;AAC1B,YAAI,UAAU;AACZ,cAAIA,SAAQ;AACZ,qBAAW;AACX,wBAAc;AACd,iBAAOA;AAAA,QACX,OAAS;AACL,gBAAM,IAAI,MAAM,6HAAkI;AAAA,QACnJ;AAAA,MACH;AAWA,eAAS,IAAI,KAAK;AAChB,eAAO,IAAI;AAAA,MACb;AACA,eAAS,IAAI,KAAK;AAChB,eAAO,IAAI,oBAAoB;AAAA,MACjC;AACA,eAAS,IAAI,KAAK,OAAO;AACvB,YAAI,kBAAkB;AAAA,MACxB;AAGA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AAEA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI,sBAAsB,UAAU,SAAS,WAAW,MAAM,WAAW;AAEzE,UAAI;AAAA;AAAA,QAEJ;AAAA;AAEA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AAMA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AAIA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AAGA,UAAI;AAAA;AAAA;AAAA,QAEJ,SAAS,WAAa;AAAA;AACtB,UAAI,eAAe,YAAY,SAAS,gBAAgB,eAAe,MAAM,YAAY;AACzF,UAAI,aAAa,SAAS,WAAW,MAAM;AAE3C,UAAI,cAAc,UAAU;AAI5B,UAAI,aAAa,eAAe,gBAAgB;AAEhD,UAAI,oBAAoB,qBAAqB;AAC7C,eAAS,uBAAuB,OAAO;AACrC,YAAI,OAAO;AACX,YAAI,iBAAiB;AAErB,YAAI,CAAC,MAAM,WAAW;AAGpB,cAAI,WAAW;AAEf,aAAG;AACD,mBAAO;AAEP,iBAAK,KAAK,SAAS,YAAY,gBAAgB,SAAS;AAItD,+BAAiB,KAAK;AAAA,YACvB;AAED,uBAAW,KAAK;AAAA,UACjB,SAAQ;AAAA,QACb,OAAS;AACL,iBAAO,KAAK,QAAQ;AAClB,mBAAO,KAAK;AAAA,UACb;AAAA,QACF;AAED,YAAI,KAAK,QAAQ,UAAU;AAGzB,iBAAO;AAAA,QACR;AAID,eAAO;AAAA,MACT;AACA,eAAS,6BAA6B,OAAO;AAC3C,YAAI,MAAM,QAAQ,mBAAmB;AACnC,cAAI,gBAAgB,MAAM;AAE1B,cAAI,kBAAkB,MAAM;AAC1B,gBAAI8G,WAAU,MAAM;AAEpB,gBAAIA,aAAY,MAAM;AACpB,8BAAgBA,SAAQ;AAAA,YACzB;AAAA,UACF;AAED,cAAI,kBAAkB,MAAM;AAC1B,mBAAO,cAAc;AAAA,UACtB;AAAA,QACF;AAED,eAAO;AAAA,MACT;AACA,eAAS,sBAAsB,OAAO;AACpC,eAAO,MAAM,QAAQ,WAAW,MAAM,UAAU,gBAAgB;AAAA,MAClE;AACA,eAAS,eAAe,OAAO;AAC7B,eAAO,uBAAuB,KAAK,MAAM;AAAA,MAC3C;AACA,eAAS,UAAU,WAAW;AAC5B;AACE,cAAI,QAAQ,kBAAkB;AAE9B,cAAI,UAAU,QAAQ,MAAM,QAAQ,gBAAgB;AAClD,gBAAI,aAAa;AACjB,gBAAI,WAAW,WAAW;AAE1B,gBAAI,CAAC,SAAS,0BAA0B;AACtC,oBAAM,yRAA6S,0BAA0B,UAAU,KAAK,aAAa;AAAA,YAC1W;AAED,qBAAS,2BAA2B;AAAA,UACrC;AAAA,QACF;AAED,YAAI,QAAQ,IAAI,SAAS;AAEzB,YAAI,CAAC,OAAO;AACV,iBAAO;AAAA,QACR;AAED,eAAO,uBAAuB,KAAK,MAAM;AAAA,MAC3C;AAEA,eAAS,gBAAgB,OAAO;AAC9B,YAAI,uBAAuB,KAAK,MAAM,OAAO;AAC3C,gBAAM,IAAI,MAAM,gDAAgD;AAAA,QACjE;AAAA,MACH;AAEA,eAAS,8BAA8B,OAAO;AAC5C,YAAI,YAAY,MAAM;AAEtB,YAAI,CAAC,WAAW;AAEd,cAAI,iBAAiB,uBAAuB,KAAK;AAEjD,cAAI,mBAAmB,MAAM;AAC3B,kBAAM,IAAI,MAAM,gDAAgD;AAAA,UACjE;AAED,cAAI,mBAAmB,OAAO;AAC5B,mBAAO;AAAA,UACR;AAED,iBAAO;AAAA,QACR;AAKD,YAAIxH,KAAI;AACR,YAAIsB,KAAI;AAER,eAAO,MAAM;AACX,cAAI,UAAUtB,GAAE;AAEhB,cAAI,YAAY,MAAM;AAEpB;AAAA,UACD;AAED,cAAI,UAAU,QAAQ;AAEtB,cAAI,YAAY,MAAM;AAKpB,gBAAI,aAAa,QAAQ;AAEzB,gBAAI,eAAe,MAAM;AACvB,cAAAA,KAAIsB,KAAI;AACR;AAAA,YACD;AAGD;AAAA,UACD;AAKD,cAAI,QAAQ,UAAU,QAAQ,OAAO;AACnC,gBAAI,QAAQ,QAAQ;AAEpB,mBAAO,OAAO;AACZ,kBAAI,UAAUtB,IAAG;AAEf,gCAAgB,OAAO;AACvB,uBAAO;AAAA,cACR;AAED,kBAAI,UAAUsB,IAAG;AAEf,gCAAgB,OAAO;AACvB,uBAAO;AAAA,cACR;AAED,sBAAQ,MAAM;AAAA,YACf;AAID,kBAAM,IAAI,MAAM,gDAAgD;AAAA,UACjE;AAED,cAAItB,GAAE,WAAWsB,GAAE,QAAQ;AAKzB,YAAAtB,KAAI;AACJ,YAAAsB,KAAI;AAAA,UACV,OAAW;AAML,gBAAI,eAAe;AACnB,gBAAI,SAAS,QAAQ;AAErB,mBAAO,QAAQ;AACb,kBAAI,WAAWtB,IAAG;AAChB,+BAAe;AACf,gBAAAA,KAAI;AACJ,gBAAAsB,KAAI;AACJ;AAAA,cACD;AAED,kBAAI,WAAWA,IAAG;AAChB,+BAAe;AACf,gBAAAA,KAAI;AACJ,gBAAAtB,KAAI;AACJ;AAAA,cACD;AAED,uBAAS,OAAO;AAAA,YACjB;AAED,gBAAI,CAAC,cAAc;AAEjB,uBAAS,QAAQ;AAEjB,qBAAO,QAAQ;AACb,oBAAI,WAAWA,IAAG;AAChB,iCAAe;AACf,kBAAAA,KAAI;AACJ,kBAAAsB,KAAI;AACJ;AAAA,gBACD;AAED,oBAAI,WAAWA,IAAG;AAChB,iCAAe;AACf,kBAAAA,KAAI;AACJ,kBAAAtB,KAAI;AACJ;AAAA,gBACD;AAED,yBAAS,OAAO;AAAA,cACjB;AAED,kBAAI,CAAC,cAAc;AACjB,sBAAM,IAAI,MAAM,8HAAmI;AAAA,cACpJ;AAAA,YACF;AAAA,UACF;AAED,cAAIA,GAAE,cAAcsB,IAAG;AACrB,kBAAM,IAAI,MAAM,8HAAmI;AAAA,UACpJ;AAAA,QACF;AAID,YAAItB,GAAE,QAAQ,UAAU;AACtB,gBAAM,IAAI,MAAM,gDAAgD;AAAA,QACjE;AAED,YAAIA,GAAE,UAAU,YAAYA,IAAG;AAE7B,iBAAO;AAAA,QACR;AAGD,eAAO;AAAA,MACT;AACA,eAAS,qBAAqB,QAAQ;AACpC,YAAI,gBAAgB,8BAA8B,MAAM;AACxD,eAAO,kBAAkB,OAAO,yBAAyB,aAAa,IAAI;AAAA,MAC5E;AAEA,eAAS,yBAAyB,MAAM;AAEtC,YAAI,KAAK,QAAQ,iBAAiB,KAAK,QAAQ,UAAU;AACvD,iBAAO;AAAA,QACR;AAED,YAAI,QAAQ,KAAK;AAEjB,eAAO,UAAU,MAAM;AACrB,cAAI,QAAQ,yBAAyB,KAAK;AAE1C,cAAI,UAAU,MAAM;AAClB,mBAAO;AAAA,UACR;AAED,kBAAQ,MAAM;AAAA,QACf;AAED,eAAO;AAAA,MACT;AAEA,eAAS,kCAAkC,QAAQ;AACjD,YAAI,gBAAgB,8BAA8B,MAAM;AACxD,eAAO,kBAAkB,OAAO,sCAAsC,aAAa,IAAI;AAAA,MACzF;AAEA,eAAS,sCAAsC,MAAM;AAEnD,YAAI,KAAK,QAAQ,iBAAiB,KAAK,QAAQ,UAAU;AACvD,iBAAO;AAAA,QACR;AAED,YAAI,QAAQ,KAAK;AAEjB,eAAO,UAAU,MAAM;AACrB,cAAI,MAAM,QAAQ,YAAY;AAC5B,gBAAI,QAAQ,sCAAsC,KAAK;AAEvD,gBAAI,UAAU,MAAM;AAClB,qBAAO;AAAA,YACR;AAAA,UACF;AAED,kBAAQ,MAAM;AAAA,QACf;AAED,eAAO;AAAA,MACT;AAGA,UAAI,mBAAmB,UAAU;AACjC,UAAI,iBAAiB,UAAU;AAC/B,UAAI,cAAc,UAAU;AAC5B,UAAI,eAAe,UAAU;AAC7B,UAAI,MAAM,UAAU;AACpB,UAAI,0BAA0B,UAAU;AACxC,UAAI,oBAAoB,UAAU;AAClC,UAAI,uBAAuB,UAAU;AACrC,UAAI,iBAAiB,UAAU;AAC/B,UAAI,cAAc,UAAU;AAC5B,UAAI,eAAe,UAAU;AAG7B,UAAI,sBAAsB,UAAU;AACpC,UAAI,gCAAgC,UAAU;AAE9C,UAAI,aAAa;AACjB,UAAI,eAAe;AACnB,UAAI,yBAAyB;AAC7B,UAAI,iBAAiB;AACrB,UAAI,oBAAoB,OAAO,mCAAmC;AAClE,eAAS,gBAAgB,WAAW;AAClC,YAAI,OAAO,mCAAmC,aAAa;AAEzD,iBAAO;AAAA,QACR;AAED,YAAI,OAAO;AAEX,YAAI,KAAK,YAAY;AAInB,iBAAO;AAAA,QACR;AAED,YAAI,CAAC,KAAK,eAAe;AACvB;AACE,kBAAM,+KAAyL;AAAA,UAChM;AAGD,iBAAO;AAAA,QACR;AAED,YAAI;AACF,cAAI,0BAA0B;AAI5B,wBAAY,OAAO,CAAE,GAAE,WAAW;AAAA,cAChC;AAAA,cACA;AAAA,YACR,CAAO;AAAA,UACF;AAED,uBAAa,KAAK,OAAO,SAAS;AAElC,yBAAe;AAAA,QAChB,SAAQ,KAAK;AAEZ;AACE,kBAAM,mDAAmD,GAAG;AAAA,UAC7D;AAAA,QACF;AAED,YAAI,KAAK,UAAU;AAEjB,iBAAO;AAAA,QACX,OAAS;AAEL,iBAAO;AAAA,QACR;AAAA,MACH;AACA,eAAS,eAAeyH,OAAM,UAAU;AACtC;AACE,cAAI,gBAAgB,OAAO,aAAa,wBAAwB,YAAY;AAC1E,gBAAI;AACF,2BAAa,oBAAoB,YAAYA,OAAM,QAAQ;AAAA,YAC5D,SAAQ,KAAK;AACZ,kBAAK,CAAC,gBAAgB;AACpB,iCAAiB;AAEjB,sBAAM,kDAAkD,GAAG;AAAA,cAC5D;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACH;AACA,eAAS,aAAaA,OAAM,eAAe;AACzC,YAAI,gBAAgB,OAAO,aAAa,sBAAsB,YAAY;AACxE,cAAI;AACF,gBAAI,YAAYA,MAAK,QAAQ,QAAQ,gBAAgB;AAErD,gBAAI,qBAAqB;AACvB,kBAAI;AAEJ,sBAAQ,eAAa;AAAA,gBACnB,KAAK;AACH,sCAAoB;AACpB;AAAA,gBAEF,KAAK;AACH,sCAAoB;AACpB;AAAA,gBAEF,KAAK;AACH,sCAAoB;AACpB;AAAA,gBAEF,KAAK;AACH,sCAAoB;AACpB;AAAA,gBAEF;AACE,sCAAoB;AACpB;AAAA,cACH;AAED,2BAAa,kBAAkB,YAAYA,OAAM,mBAAmB,QAAQ;AAAA,YAG7E;AAAA,UACF,SAAQ,KAAK;AACZ;AACE,kBAAI,CAAC,gBAAgB;AACnB,iCAAiB;AAEjB,sBAAM,kDAAkD,GAAG;AAAA,cAC5D;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACH;AACA,eAAS,iBAAiBA,OAAM;AAC9B,YAAI,gBAAgB,OAAO,aAAa,0BAA0B,YAAY;AAC5E,cAAI;AACF,yBAAa,sBAAsB,YAAYA,KAAI;AAAA,UACpD,SAAQ,KAAK;AACZ;AACE,kBAAI,CAAC,gBAAgB;AACnB,iCAAiB;AAEjB,sBAAM,kDAAkD,GAAG;AAAA,cAC5D;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACH;AACA,eAAS,gBAAgB,OAAO;AAC9B,YAAI,gBAAgB,OAAO,aAAa,yBAAyB,YAAY;AAC3E,cAAI;AACF,yBAAa,qBAAqB,YAAY,KAAK;AAAA,UACpD,SAAQ,KAAK;AACZ;AACE,kBAAI,CAAC,gBAAgB;AACnB,iCAAiB;AAEjB,sBAAM,kDAAkD,GAAG;AAAA,cAC5D;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACH;AACA,eAAS,2BAA2B,iBAAiB;AACnD;AACE,cAAI,OAAO,wBAAwB,YAAY;AAI7C,0CAA8B,eAAe;AAC7C,+BAAmB,eAAe;AAAA,UACnC;AAED,cAAI,gBAAgB,OAAO,aAAa,kBAAkB,YAAY;AACpE,gBAAI;AACF,2BAAa,cAAc,YAAY,eAAe;AAAA,YACvD,SAAQ,KAAK;AACZ;AACE,oBAAI,CAAC,gBAAgB;AACnB,mCAAiB;AAEjB,wBAAM,kDAAkD,GAAG;AAAA,gBAC5D;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACH;AAEA,eAAS,qBAAqB,gBAAgB;AAC5C,iCAAyB;AAAA,MAC3B;AAEA,eAAS,kBAAkB;AACzB;AACE,cAAI,MAAM,oBAAI;AACd,cAAI,OAAO;AAEX,mBAASnH,SAAQ,GAAGA,SAAQ,YAAYA,UAAS;AAC/C,gBAAI,QAAQ,gBAAgB,IAAI;AAChC,gBAAI,IAAI,MAAM,KAAK;AACnB,oBAAQ;AAAA,UACT;AAED,iBAAO;AAAA,QACR;AAAA,MACH;AAEA,eAAS,kBAAkB,OAAO;AAChC;AACE,cAAI,2BAA2B,QAAQ,OAAO,uBAAuB,sBAAsB,YAAY;AACrG,mCAAuB,kBAAkB,KAAK;AAAA,UAC/C;AAAA,QACF;AAAA,MACH;AACA,eAAS,oBAAoB;AAC3B;AACE,cAAI,2BAA2B,QAAQ,OAAO,uBAAuB,sBAAsB,YAAY;AACrG,mCAAuB,kBAAiB;AAAA,UACzC;AAAA,QACF;AAAA,MACH;AACA,eAAS,2BAA2B,OAAO;AACzC;AACE,cAAI,2BAA2B,QAAQ,OAAO,uBAAuB,+BAA+B,YAAY;AAC9G,mCAAuB,2BAA2B,KAAK;AAAA,UACxD;AAAA,QACF;AAAA,MACH;AACA,eAAS,6BAA6B;AACpC;AACE,cAAI,2BAA2B,QAAQ,OAAO,uBAAuB,+BAA+B,YAAY;AAC9G,mCAAuB,2BAA0B;AAAA,UAClD;AAAA,QACF;AAAA,MACH;AACA,eAAS,uCAAuC,OAAO;AACrD;AACE,cAAI,2BAA2B,QAAQ,OAAO,uBAAuB,2CAA2C,YAAY;AAC1H,mCAAuB,uCAAuC,KAAK;AAAA,UACpE;AAAA,QACF;AAAA,MACH;AACA,eAAS,yCAAyC;AAChD;AACE,cAAI,2BAA2B,QAAQ,OAAO,uBAAuB,2CAA2C,YAAY;AAC1H,mCAAuB,uCAAsC;AAAA,UAC9D;AAAA,QACF;AAAA,MACH;AACA,eAAS,yCAAyC,OAAO;AACvD;AACE,cAAI,2BAA2B,QAAQ,OAAO,uBAAuB,6CAA6C,YAAY;AAC5H,mCAAuB,yCAAyC,KAAK;AAAA,UACtE;AAAA,QACF;AAAA,MACH;AACA,eAAS,2CAA2C;AAClD;AACE,cAAI,2BAA2B,QAAQ,OAAO,uBAAuB,6CAA6C,YAAY;AAC5H,mCAAuB,yCAAwC;AAAA,UAChE;AAAA,QACF;AAAA,MACH;AACA,eAAS,sCAAsC,OAAO;AACpD;AACE,cAAI,2BAA2B,QAAQ,OAAO,uBAAuB,0CAA0C,YAAY;AACzH,mCAAuB,sCAAsC,KAAK;AAAA,UACnE;AAAA,QACF;AAAA,MACH;AACA,eAAS,wCAAwC;AAC/C;AACE,cAAI,2BAA2B,QAAQ,OAAO,uBAAuB,0CAA0C,YAAY;AACzH,mCAAuB,sCAAqC;AAAA,UAC7D;AAAA,QACF;AAAA,MACH;AACA,eAAS,wCAAwC,OAAO;AACtD;AACE,cAAI,2BAA2B,QAAQ,OAAO,uBAAuB,4CAA4C,YAAY;AAC3H,mCAAuB,wCAAwC,KAAK;AAAA,UACrE;AAAA,QACF;AAAA,MACH;AACA,eAAS,0CAA0C;AACjD;AACE,cAAI,2BAA2B,QAAQ,OAAO,uBAAuB,4CAA4C,YAAY;AAC3H,mCAAuB,wCAAuC;AAAA,UAC/D;AAAA,QACF;AAAA,MACH;AACA,eAAS,qBAAqB,OAAO,aAAa,OAAO;AACvD;AACE,cAAI,2BAA2B,QAAQ,OAAO,uBAAuB,yBAAyB,YAAY;AACxG,mCAAuB,qBAAqB,OAAO,aAAa,KAAK;AAAA,UACtE;AAAA,QACF;AAAA,MACH;AACA,eAAS,uBAAuB,OAAO,UAAU,OAAO;AACtD;AACE,cAAI,2BAA2B,QAAQ,OAAO,uBAAuB,2BAA2B,YAAY;AAC1G,mCAAuB,uBAAuB,OAAO,UAAU,KAAK;AAAA,UACrE;AAAA,QACF;AAAA,MACH;AACA,eAAS,yBAAyB,OAAO;AACvC;AACE,cAAI,2BAA2B,QAAQ,OAAO,uBAAuB,6BAA6B,YAAY;AAC5G,mCAAuB,yBAAyB,KAAK;AAAA,UACtD;AAAA,QACF;AAAA,MACH;AACA,eAAS,2BAA2B;AAClC;AACE,cAAI,2BAA2B,QAAQ,OAAO,uBAAuB,6BAA6B,YAAY;AAC5G,mCAAuB,yBAAwB;AAAA,UAChD;AAAA,QACF;AAAA,MACH;AACA,eAAS,0BAA0B,OAAO;AACxC;AACE,cAAI,2BAA2B,QAAQ,OAAO,uBAAuB,8BAA8B,YAAY;AAC7G,mCAAuB,0BAA0B,KAAK;AAAA,UACvD;AAAA,QACF;AAAA,MACH;AACA,eAAS,4BAA4B;AACnC;AACE,cAAI,2BAA2B,QAAQ,OAAO,uBAAuB,8BAA8B,YAAY;AAC7G,mCAAuB,0BAAyB;AAAA,UACjD;AAAA,QACF;AAAA,MACH;AACA,eAAS,kBAAkB,OAAO;AAChC;AACE,cAAI,2BAA2B,QAAQ,OAAO,uBAAuB,sBAAsB,YAAY;AACrG,mCAAuB,kBAAkB,KAAK;AAAA,UAC/C;AAAA,QACF;AAAA,MACH;AACA,eAAS,oBAAoB;AAC3B;AACE,cAAI,2BAA2B,QAAQ,OAAO,uBAAuB,sBAAsB,YAAY;AACrG,mCAAuB,kBAAiB;AAAA,UACzC;AAAA,QACF;AAAA,MACH;AACA,eAAS,oBAAoB;AAC3B;AACE,cAAI,2BAA2B,QAAQ,OAAO,uBAAuB,sBAAsB,YAAY;AACrG,mCAAuB,kBAAiB;AAAA,UACzC;AAAA,QACF;AAAA,MACH;AACA,eAAS,oBAAoB,MAAM;AACjC;AACE,cAAI,2BAA2B,QAAQ,OAAO,uBAAuB,wBAAwB,YAAY;AACvG,mCAAuB,oBAAoB,IAAI;AAAA,UAChD;AAAA,QACF;AAAA,MACH;AACA,eAAS,yBAAyB,OAAO,MAAM;AAC7C;AACE,cAAI,2BAA2B,QAAQ,OAAO,uBAAuB,6BAA6B,YAAY;AAC5G,mCAAuB,yBAAyB,OAAO,IAAI;AAAA,UAC5D;AAAA,QACF;AAAA,MACH;AACA,eAAS,yBAAyB,OAAO,MAAM;AAC7C;AACE,cAAI,2BAA2B,QAAQ,OAAO,uBAAuB,6BAA6B,YAAY;AAC5G,mCAAuB,yBAAyB,OAAO,IAAI;AAAA,UAC5D;AAAA,QACF;AAAA,MACH;AAEA,UAAI;AAAA;AAAA,QAEJ;AAAA;AAEA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AAGA,UAAI,QAAQ,KAAK,QAAQ,KAAK,QAAQ;AAItC,UAAI,MAAM,KAAK;AACf,UAAI,MAAM,KAAK;AAEf,eAAS,cAAcH,IAAG;AACxB,YAAI,SAASA,OAAM;AAEnB,YAAI,WAAW,GAAG;AAChB,iBAAO;AAAA,QACR;AAED,eAAO,MAAM,IAAI,MAAM,IAAI,MAAM,KAAK;AAAA,MACxC;AAIA,UAAI,aAAa;AACjB,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI,gBAAgB;AACpB,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AAGA,eAAS,gBAAgB,MAAM;AAC7B;AACE,cAAI,OAAO,UAAU;AACnB,mBAAO;AAAA,UACR;AAED,cAAI,OAAO,8BAA8B;AACvC,mBAAO;AAAA,UACR;AAED,cAAI,OAAO,qBAAqB;AAC9B,mBAAO;AAAA,UACR;AAED,cAAI,OAAO,sBAAsB;AAC/B,mBAAO;AAAA,UACR;AAED,cAAI,OAAO,aAAa;AACtB,mBAAO;AAAA,UACR;AAED,cAAI,OAAO,yBAAyB;AAClC,mBAAO;AAAA,UACR;AAED,cAAI,OAAO,iBAAiB;AAC1B,mBAAO;AAAA,UACR;AAED,cAAI,OAAO,YAAY;AACrB,mBAAO;AAAA,UACR;AAED,cAAI,OAAO,wBAAwB;AACjC,mBAAO;AAAA,UACR;AAED,cAAI,OAAO,mBAAmB;AAC5B,mBAAO;AAAA,UACR;AAED,cAAI,OAAO,UAAU;AACnB,mBAAO;AAAA,UACR;AAED,cAAI,OAAO,eAAe;AACxB,mBAAO;AAAA,UACR;AAAA,QACF;AAAA,MACH;AACA,UAAI,cAAc;AAClB,UAAI,qBAAqB;AACzB,UAAI,gBAAgB;AAEpB,eAAS,wBAAwB,OAAO;AACtC,gBAAQ,uBAAuB,KAAK,GAAC;AAAA,UACnC,KAAK;AACH,mBAAO;AAAA,UAET,KAAK;AACH,mBAAO;AAAA,UAET,KAAK;AACH,mBAAO;AAAA,UAET,KAAK;AACH,mBAAO;AAAA,UAET,KAAK;AACH,mBAAO;AAAA,UAET,KAAK;AACH,mBAAO;AAAA,UAET,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AACH,mBAAO,QAAQ;AAAA,UAEjB,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AACH,mBAAO,QAAQ;AAAA,UAEjB,KAAK;AACH,mBAAO;AAAA,UAET,KAAK;AACH,mBAAO;AAAA,UAET,KAAK;AACH,mBAAO;AAAA,UAET,KAAK;AACH,mBAAO;AAAA,UAET;AACE;AACE,oBAAM,2DAA2D;AAAA,YAClE;AAGD,mBAAO;AAAA,QACV;AAAA,MACH;AAEA,eAAS,aAAasH,OAAM,UAAU;AAEpC,YAAI,eAAeA,MAAK;AAExB,YAAI,iBAAiB,SAAS;AAC5B,iBAAO;AAAA,QACR;AAED,YAAI,YAAY;AAChB,YAAI,iBAAiBA,MAAK;AAC1B,YAAI,cAAcA,MAAK;AAGvB,YAAI,sBAAsB,eAAe;AAEzC,YAAI,wBAAwB,SAAS;AACnC,cAAI,wBAAwB,sBAAsB,CAAC;AAEnD,cAAI,0BAA0B,SAAS;AACrC,wBAAY,wBAAwB,qBAAqB;AAAA,UAC/D,OAAW;AACL,gBAAI,qBAAqB,sBAAsB;AAE/C,gBAAI,uBAAuB,SAAS;AAClC,0BAAY,wBAAwB,kBAAkB;AAAA,YACvD;AAAA,UACF;AAAA,QACL,OAAS;AAEL,cAAI,iBAAiB,eAAe,CAAC;AAErC,cAAI,mBAAmB,SAAS;AAC9B,wBAAY,wBAAwB,cAAc;AAAA,UACxD,OAAW;AACL,gBAAI,gBAAgB,SAAS;AAC3B,0BAAY,wBAAwB,WAAW;AAAA,YAChD;AAAA,UACF;AAAA,QACF;AAED,YAAI,cAAc,SAAS;AAGzB,iBAAO;AAAA,QACR;AAKD,YAAI,aAAa,WAAW,aAAa;AAAA;AAAA,SAExC,WAAW,oBAAoB,SAAS;AACvC,cAAI,WAAW,uBAAuB,SAAS;AAC/C,cAAI,UAAU,uBAAuB,QAAQ;AAE7C;AAAA;AAAA;AAAA,YAEA,YAAY;AAAA;AAAA;AAAA,YAGZ,aAAa,gBAAgB,UAAU,qBAAqB;AAAA,YAAS;AAEnE,mBAAO;AAAA,UACR;AAAA,QACF;AAED,aAAK,YAAY,yBAAyB,SAAS;AAKjD,uBAAa,eAAe;AAAA,QAC7B;AAwBD,YAAI,iBAAiBA,MAAK;AAE1B,YAAI,mBAAmB,SAAS;AAC9B,cAAI,gBAAgBA,MAAK;AACzB,cAAI,QAAQ,YAAY;AAExB,iBAAO,QAAQ,GAAG;AAChB,gBAAInH,SAAQ,uBAAuB,KAAK;AACxC,gBAAI,OAAO,KAAKA;AAChB,yBAAa,cAAcA,MAAK;AAChC,qBAAS,CAAC;AAAA,UACX;AAAA,QACF;AAED,eAAO;AAAA,MACT;AACA,eAAS,uBAAuBmH,OAAM,OAAO;AAC3C,YAAI,aAAaA,MAAK;AACtB,YAAI,sBAAsB;AAE1B,eAAO,QAAQ,GAAG;AAChB,cAAInH,SAAQ,uBAAuB,KAAK;AACxC,cAAI,OAAO,KAAKA;AAChB,cAAI,YAAY,WAAWA,MAAK;AAEhC,cAAI,YAAY,qBAAqB;AACnC,kCAAsB;AAAA,UACvB;AAED,mBAAS,CAAC;AAAA,QACX;AAED,eAAO;AAAA,MACT;AAEA,eAAS,sBAAsB,MAAM,aAAa;AAChD,gBAAQ,MAAI;AAAA,UACV,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAUH,mBAAO,cAAc;AAAA,UAEvB,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AACH,mBAAO,cAAc;AAAA,UAEvB,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAMH,mBAAO;AAAA,UAET,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAEH,mBAAO;AAAA,UAET;AACE;AACE,oBAAM,2DAA2D;AAAA,YAClE;AAED,mBAAO;AAAA,QACV;AAAA,MACH;AAEA,eAAS,0BAA0BmH,OAAM,aAAa;AAIpD,YAAI,eAAeA,MAAK;AACxB,YAAI,iBAAiBA,MAAK;AAC1B,YAAI,cAAcA,MAAK;AACvB,YAAI,kBAAkBA,MAAK;AAI3B,YAAI,QAAQ;AAEZ,eAAO,QAAQ,GAAG;AAChB,cAAInH,SAAQ,uBAAuB,KAAK;AACxC,cAAI,OAAO,KAAKA;AAChB,cAAI,iBAAiB,gBAAgBA,MAAK;AAE1C,cAAI,mBAAmB,aAAa;AAIlC,iBAAK,OAAO,oBAAoB,YAAY,OAAO,iBAAiB,SAAS;AAE3E,8BAAgBA,MAAK,IAAI,sBAAsB,MAAM,WAAW;AAAA,YACjE;AAAA,UACP,WAAe,kBAAkB,aAAa;AAExC,YAAAmH,MAAK,gBAAgB;AAAA,UACtB;AAED,mBAAS,CAAC;AAAA,QACX;AAAA,MACH;AAGA,eAAS,+BAA+BA,OAAM;AAC5C,eAAO,wBAAwBA,MAAK,YAAY;AAAA,MAClD;AACA,eAAS,oCAAoCA,OAAM;AACjD,YAAI,yBAAyBA,MAAK,eAAe,CAAC;AAElD,YAAI,2BAA2B,SAAS;AACtC,iBAAO;AAAA,QACR;AAED,YAAI,yBAAyB,eAAe;AAC1C,iBAAO;AAAA,QACR;AAED,eAAO;AAAA,MACT;AACA,eAAS,iBAAiB,OAAO;AAC/B,gBAAQ,QAAQ,cAAc;AAAA,MAChC;AACA,eAAS,oBAAoB,OAAO;AAClC,gBAAQ,QAAQ,kBAAkB;AAAA,MACpC;AACA,eAAS,oBAAoB,OAAO;AAClC,gBAAQ,QAAQ,gBAAgB;AAAA,MAClC;AACA,eAAS,2BAA2B,OAAO;AACzC,YAAI,cAAc,WAAW,sBAAsB;AACnD,gBAAQ,QAAQ,iBAAiB;AAAA,MACnC;AACA,eAAS,wBAAwB,OAAO;AACtC,gBAAQ,QAAQ,qBAAqB;AAAA,MACvC;AACA,eAAS,qBAAqBA,OAAM,OAAO;AAEzC,YAAI,mBAAmB,+BAA+B,sBAAsB,uBAAuB;AACnG,gBAAQ,QAAQ,sBAAsB;AAAA,MACxC;AACA,eAAS,oBAAoBA,OAAM,OAAO;AAGxC,gBAAQ,QAAQA,MAAK,kBAAkB;AAAA,MACzC;AACA,eAAS,iBAAiB,MAAM;AAC9B,gBAAQ,OAAO,qBAAqB;AAAA,MACtC;AACA,eAAS,0BAA0B;AAIjC,YAAI,OAAO;AACX,+BAAuB;AAEvB,aAAK,qBAAqB,qBAAqB,SAAS;AACtD,+BAAqB;AAAA,QACtB;AAED,eAAO;AAAA,MACT;AACA,eAAS,qBAAqB;AAC5B,YAAI,OAAO;AACX,0BAAkB;AAElB,aAAK,gBAAgB,gBAAgB,SAAS;AAC5C,0BAAgB;AAAA,QACjB;AAED,eAAO;AAAA,MACT;AACA,eAAS,uBAAuB,OAAO;AACrC,eAAO,QAAQ,CAAC;AAAA,MAClB;AACA,eAAS,kBAAkB,OAAO;AAKhC,eAAO,uBAAuB,KAAK;AAAA,MACrC;AAEA,eAAS,uBAAuB,OAAO;AACrC,eAAO,KAAK,MAAM,KAAK;AAAA,MACzB;AAEA,eAAS,YAAY,MAAM;AACzB,eAAO,uBAAuB,IAAI;AAAA,MACpC;AAEA,eAAS,iBAAiBzH,IAAGsB,IAAG;AAC9B,gBAAQtB,KAAIsB,QAAO;AAAA,MACrB;AACA,eAAS,gBAAgB2F,MAAK,QAAQ;AACpC,gBAAQA,OAAM,YAAY;AAAA,MAC5B;AACA,eAAS,WAAWjH,IAAGsB,IAAG;AACxB,eAAOtB,KAAIsB;AAAA,MACb;AACA,eAAS,YAAY2F,MAAK,QAAQ;AAChC,eAAOA,OAAM,CAAC;AAAA,MAChB;AACA,eAAS,eAAejH,IAAGsB,IAAG;AAC5B,eAAOtB,KAAIsB;AAAA,MACb;AAGA,eAAS,YAAY,MAAM;AACzB,eAAO;AAAA,MACT;AACA,eAAS,mBAAmBtB,IAAGsB,IAAG;AAEhC,eAAOtB,OAAM,UAAUA,KAAIsB,KAAItB,KAAIsB;AAAA,MACrC;AACA,eAAS,cAAc,SAAS;AAG9B,YAAI,UAAU,CAAA;AAEd,iBAASjB,KAAI,GAAGA,KAAI,YAAYA,MAAK;AACnC,kBAAQ,KAAK,OAAO;AAAA,QACrB;AAED,eAAO;AAAA,MACT;AACA,eAAS,gBAAgBoH,OAAM,YAAY,WAAW;AACpD,QAAAA,MAAK,gBAAgB;AAarB,YAAI,eAAe,UAAU;AAC3B,UAAAA,MAAK,iBAAiB;AACtB,UAAAA,MAAK,cAAc;AAAA,QACpB;AAED,YAAI,aAAaA,MAAK;AACtB,YAAInH,SAAQ,YAAY,UAAU;AAGlC,mBAAWA,MAAK,IAAI;AAAA,MACtB;AACA,eAAS,kBAAkBmH,OAAM,gBAAgB;AAC/C,QAAAA,MAAK,kBAAkB;AACvB,QAAAA,MAAK,eAAe,CAAC;AAErB,YAAI,kBAAkBA,MAAK;AAC3B,YAAI,QAAQ;AAEZ,eAAO,QAAQ,GAAG;AAChB,cAAInH,SAAQ,uBAAuB,KAAK;AACxC,cAAI,OAAO,KAAKA;AAChB,0BAAgBA,MAAK,IAAI;AACzB,mBAAS,CAAC;AAAA,QACX;AAAA,MACH;AACA,eAAS,eAAemH,OAAM,aAAa,WAAW;AACpD,QAAAA,MAAK,eAAeA,MAAK,iBAAiB;AAAA,MAC5C;AACA,eAAS,iBAAiBA,OAAM,gBAAgB;AAC9C,YAAI,uBAAuBA,MAAK,eAAe,CAAC;AAChD,QAAAA,MAAK,eAAe;AAEpB,QAAAA,MAAK,iBAAiB;AACtB,QAAAA,MAAK,cAAc;AACnB,QAAAA,MAAK,gBAAgB;AACrB,QAAAA,MAAK,oBAAoB;AACzB,QAAAA,MAAK,kBAAkB;AACvB,YAAI,gBAAgBA,MAAK;AACzB,YAAI,aAAaA,MAAK;AACtB,YAAI,kBAAkBA,MAAK;AAE3B,YAAI,QAAQ;AAEZ,eAAO,QAAQ,GAAG;AAChB,cAAInH,SAAQ,uBAAuB,KAAK;AACxC,cAAI,OAAO,KAAKA;AAChB,wBAAcA,MAAK,IAAI;AACvB,qBAAWA,MAAK,IAAI;AACpB,0BAAgBA,MAAK,IAAI;AACzB,mBAAS,CAAC;AAAA,QACX;AAAA,MACH;AACA,eAAS,kBAAkBmH,OAAM,gBAAgB;AAY/C,YAAI,qBAAqBA,MAAK,kBAAkB;AAChD,YAAI,gBAAgBA,MAAK;AACzB,YAAI,QAAQ;AAEZ,eAAO,OAAO;AACZ,cAAInH,SAAQ,uBAAuB,KAAK;AACxC,cAAI,OAAO,KAAKA;AAEhB;AAAA;AAAA,YACA,OAAO;AAAA,YACP,cAAcA,MAAK,IAAI;AAAA,YAAgB;AACrC,0BAAcA,MAAK,KAAK;AAAA,UACzB;AAED,mBAAS,CAAC;AAAA,QACX;AAAA,MACH;AACA,eAAS,0BAA0BmH,OAAMC,cAAa;AACpD,YAAI,aAAa,uBAAuBA,YAAW;AACnD,YAAI;AAEJ,gBAAQ,YAAU;AAAA,UAChB,KAAK;AACH,mBAAO;AACP;AAAA,UAEF,KAAK;AACH,mBAAO;AACP;AAAA,UAEF,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AACH,mBAAO;AACP;AAAA,UAEF,KAAK;AACH,mBAAO;AACP;AAAA,UAEF;AAGE,mBAAO;AACP;AAAA,QACH;AAKD,aAAK,QAAQD,MAAK,iBAAiBC,mBAAkB,QAAQ;AAE3D,iBAAO;AAAA,QACR;AAED,eAAO;AAAA,MACT;AACA,eAAS,mBAAmBD,OAAM,OAAO,OAAO;AAE9C,YAAI,CAAC,mBAAmB;AACtB;AAAA,QACD;AAED,YAAI,yBAAyBA,MAAK;AAElC,eAAO,QAAQ,GAAG;AAChB,cAAInH,SAAQ,YAAY,KAAK;AAC7B,cAAI,OAAO,KAAKA;AAChB,cAAI,WAAW,uBAAuBA,MAAK;AAC3C,mBAAS,IAAI,KAAK;AAClB,mBAAS,CAAC;AAAA,QACX;AAAA,MACH;AACA,eAAS,4BAA4BmH,OAAM,OAAO;AAEhD,YAAI,CAAC,mBAAmB;AACtB;AAAA,QACD;AAED,YAAI,yBAAyBA,MAAK;AAClC,YAAI,mBAAmBA,MAAK;AAE5B,eAAO,QAAQ,GAAG;AAChB,cAAInH,SAAQ,YAAY,KAAK;AAC7B,cAAI,OAAO,KAAKA;AAChB,cAAI,WAAW,uBAAuBA,MAAK;AAE3C,cAAI,SAAS,OAAO,GAAG;AACrB,qBAAS,QAAQ,SAAU,OAAO;AAChC,kBAAI,YAAY,MAAM;AAEtB,kBAAI,cAAc,QAAQ,CAAC,iBAAiB,IAAI,SAAS,GAAG;AAC1D,iCAAiB,IAAI,KAAK;AAAA,cAC3B;AAAA,YACT,CAAO;AACD,qBAAS,MAAK;AAAA,UACf;AAED,mBAAS,CAAC;AAAA,QACX;AAAA,MACH;AACA,eAAS,uBAAuBmH,OAAM,OAAO;AAC3C;AACE,iBAAO;AAAA,QACR;AAAA,MACH;AAEA,UAAI,wBAAwB;AAC5B,UAAI,0BAA0B;AAC9B,UAAI,uBAAuB;AAC3B,UAAI,oBAAoB;AACxB,UAAI,wBAAwB;AAC5B,eAAS,2BAA2B;AAClC,eAAO;AAAA,MACT;AACA,eAAS,yBAAyB,aAAa;AAC7C,gCAAwB;AAAA,MAC1B;AACA,eAAS,gBAAgB,UAAU,IAAI;AACrC,YAAI,mBAAmB;AAEvB,YAAI;AACF,kCAAwB;AACxB,iBAAO,GAAE;AAAA,QACb,UAAY;AACR,kCAAwB;AAAA,QACzB;AAAA,MACH;AACA,eAAS,oBAAoBzH,IAAGsB,IAAG;AACjC,eAAOtB,OAAM,KAAKA,KAAIsB,KAAItB,KAAIsB;AAAA,MAChC;AACA,eAAS,mBAAmBtB,IAAGsB,IAAG;AAChC,eAAOtB,OAAM,KAAKA,KAAIsB,KAAItB,KAAIsB;AAAA,MAChC;AACA,eAAS,sBAAsBtB,IAAGsB,IAAG;AACnC,eAAOtB,OAAM,KAAKA,KAAIsB;AAAA,MACxB;AACA,eAAS,qBAAqB,OAAO;AACnC,YAAI,OAAO,uBAAuB,KAAK;AAEvC,YAAI,CAAC,sBAAsB,uBAAuB,IAAI,GAAG;AACvD,iBAAO;AAAA,QACR;AAED,YAAI,CAAC,sBAAsB,yBAAyB,IAAI,GAAG;AACzD,iBAAO;AAAA,QACR;AAED,YAAI,oBAAoB,IAAI,GAAG;AAC7B,iBAAO;AAAA,QACR;AAED,eAAO;AAAA,MACT;AAKA,eAAS,iBAAiBmG,OAAM;AAC9B,YAAI,eAAeA,MAAK,QAAQ;AAChC,eAAO,aAAa;AAAA,MACtB;AAEA,UAAI;AAEJ,eAAS,+BAA+B,IAAI;AAC1C,uCAA+B;AAAA,MACjC;AACA,eAAS,4BAA4B,OAAO;AAC1C,qCAA6B,KAAK;AAAA,MACpC;AACA,UAAI;AACJ,eAAS,8BAA8B,IAAI;AACzC,qCAA6B;AAAA,MAC/B;AACA,UAAI;AACJ,eAAS,qCAAqC,IAAI;AAChD,4CAAoC;AAAA,MACtC;AACA,UAAI;AACJ,eAAS,4BAA4B,IAAI;AACvC,qCAA6B;AAAA,MAC/B;AACA,UAAI;AACJ,eAAS,8BAA8B,IAAI;AACzC,qCAA6B;AAAA,MAC/B;AAGA,UAAI,4BAA4B;AAEhC,UAAI,uBAAuB,CAAA;AAG3B,UAAI,cAAc;AAClB,UAAI,aAAa;AACjB,UAAI,cAAc;AAElB,UAAI,iBAAiB,oBAAI;AACzB,UAAI,wBAAwB,oBAAI;AAEhC,UAAI,iCAAiC,CAAA;AACrC,UAAI,2BAA2B;AAAA,QAAC;AAAA,QAAa;AAAA,QAAW;AAAA,QAAe;AAAA,QAAY;AAAA,QAAc;AAAA,QAAY;AAAA,QAAY;AAAA,QAAiB;AAAA,QAAe;AAAA,QAAa;AAAA,QAAW;AAAA,QAAa;AAAA,QAAQ;AAAA,QAAkB;AAAA,QAAoB;AAAA,QAAW;AAAA,QAAY;AAAA,QAAS;AAAA,QAAS;AAAA;AAAA,QACrR;AAAA,QAAQ;AAAA,QAAO;AAAA,QAAS;AAAA,QAAS;AAAA,QAAU;AAAA,QAAe;AAAA,QAAS;AAAA,MAAQ;AAC3E,eAAS,qCAAqC,WAAW;AACvD,eAAO,yBAAyB,QAAQ,SAAS,IAAI;AAAA,MACvD;AAEA,eAAS,4BAA4B,WAAW,cAAc,kBAAkB,iBAAiB,aAAa;AAC5G,eAAO;AAAA,UACL;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA,kBAAkB,CAAC,eAAe;AAAA,QACtC;AAAA,MACA;AAEA,eAAS,uBAAuB,cAAc,aAAa;AACzD,gBAAQ,cAAY;AAAA,UAClB,KAAK;AAAA,UACL,KAAK;AACH,0BAAc;AACd;AAAA,UAEF,KAAK;AAAA,UACL,KAAK;AACH,yBAAa;AACb;AAAA,UAEF,KAAK;AAAA,UACL,KAAK;AACH,0BAAc;AACd;AAAA,UAEF,KAAK;AAAA,UACL,KAAK,cACH;AACE,gBAAI,YAAY,YAAY;AAC5B,2BAAe,OAAO,SAAS;AAC/B;AAAA,UACD;AAAA,UAEH,KAAK;AAAA,UACL,KAAK,sBACH;AACE,gBAAI,aAAa,YAAY;AAC7B,kCAAsB,OAAO,UAAU;AACvC;AAAA,UACD;AAAA,QACJ;AAAA,MACH;AAEA,eAAS,kDAAkD,qBAAqB,WAAW,cAAc,kBAAkB,iBAAiB,aAAa;AACvJ,YAAI,wBAAwB,QAAQ,oBAAoB,gBAAgB,aAAa;AACnF,cAAI,cAAc,4BAA4B,WAAW,cAAc,kBAAkB,iBAAiB,WAAW;AAErH,cAAI,cAAc,MAAM;AACtB,gBAAI,UAAU,oBAAoB,SAAS;AAE3C,gBAAI,YAAY,MAAM;AAEpB,yCAA2B,OAAO;AAAA,YACnC;AAAA,UACF;AAED,iBAAO;AAAA,QACR;AAMD,4BAAoB,oBAAoB;AACxC,YAAI,mBAAmB,oBAAoB;AAE3C,YAAI,oBAAoB,QAAQ,iBAAiB,QAAQ,eAAe,MAAM,IAAI;AAChF,2BAAiB,KAAK,eAAe;AAAA,QACtC;AAED,eAAO;AAAA,MACT;AAEA,eAAS,uBAAuB,WAAW,cAAc,kBAAkB,iBAAiB,aAAa;AAIvG,gBAAQ,cAAY;AAAA,UAClB,KAAK,WACH;AACE,gBAAI,aAAa;AACjB,0BAAc,kDAAkD,aAAa,WAAW,cAAc,kBAAkB,iBAAiB,UAAU;AACnJ,mBAAO;AAAA,UACR;AAAA,UAEH,KAAK,aACH;AACE,gBAAI,YAAY;AAChB,yBAAa,kDAAkD,YAAY,WAAW,cAAc,kBAAkB,iBAAiB,SAAS;AAChJ,mBAAO;AAAA,UACR;AAAA,UAEH,KAAK,aACH;AACE,gBAAI,aAAa;AACjB,0BAAc,kDAAkD,aAAa,WAAW,cAAc,kBAAkB,iBAAiB,UAAU;AACnJ,mBAAO;AAAA,UACR;AAAA,UAEH,KAAK,eACH;AACE,gBAAI,eAAe;AACnB,gBAAI,YAAY,aAAa;AAC7B,2BAAe,IAAI,WAAW,kDAAkD,eAAe,IAAI,SAAS,KAAK,MAAM,WAAW,cAAc,kBAAkB,iBAAiB,YAAY,CAAC;AAChM,mBAAO;AAAA,UACR;AAAA,UAEH,KAAK,qBACH;AACE,gBAAI,gBAAgB;AACpB,gBAAI,cAAc,cAAc;AAChC,kCAAsB,IAAI,aAAa,kDAAkD,sBAAsB,IAAI,WAAW,KAAK,MAAM,WAAW,cAAc,kBAAkB,iBAAiB,aAAa,CAAC;AACnN,mBAAO;AAAA,UACR;AAAA,QACJ;AAED,eAAO;AAAA,MACT;AAEA,eAAS,+BAA+B,cAAc;AAIpD,YAAI,aAAa,2BAA2B,aAAa,MAAM;AAE/D,YAAI,eAAe,MAAM;AACvB,cAAI,iBAAiB,uBAAuB,UAAU;AAEtD,cAAI,mBAAmB,MAAM;AAC3B,gBAAI,MAAM,eAAe;AAEzB,gBAAI,QAAQ,mBAAmB;AAC7B,kBAAI,WAAW,6BAA6B,cAAc;AAE1D,kBAAI,aAAa,MAAM;AAGrB,6BAAa,YAAY;AACzB,2CAA2B,aAAa,UAAU,WAAY;AAC5D,oDAAkC,cAAc;AAAA,gBAC5D,CAAW;AACD;AAAA,cACD;AAAA,YACT,WAAiB,QAAQ,UAAU;AAC3B,kBAAIA,QAAO,eAAe;AAE1B,kBAAI,iBAAiBA,KAAI,GAAG;AAC1B,6BAAa,YAAY,sBAAsB,cAAc;AAG7D;AAAA,cACD;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAED,qBAAa,YAAY;AAAA,MAC3B;AAEA,eAAS,6BAA6B,QAAQ;AAI5C,YAAI,iBAAiB;AACrB,YAAI,eAAe;AAAA,UACjB,WAAW;AAAA,UACX;AAAA,UACA,UAAU;AAAA,QACd;AACE,YAAIpH,KAAI;AAER,eAAOA,KAAI,+BAA+B,QAAQA,MAAK;AAErD,cAAI,CAAC,sBAAsB,gBAAgB,+BAA+BA,EAAC,EAAE,QAAQ,GAAG;AACtF;AAAA,UACD;AAAA,QACF;AAED,uCAA+B,OAAOA,IAAG,GAAG,YAAY;AAExD,YAAIA,OAAM,GAAG;AACX,yCAA+B,YAAY;AAAA,QAC5C;AAAA,MACH;AAEA,eAAS,mCAAmC,aAAa;AACvD,YAAI,YAAY,cAAc,MAAM;AAClC,iBAAO;AAAA,QACR;AAED,YAAI,mBAAmB,YAAY;AAEnC,eAAO,iBAAiB,SAAS,GAAG;AAClC,cAAI,kBAAkB,iBAAiB,CAAC;AACxC,cAAI,gBAAgB,0BAA0B,YAAY,cAAc,YAAY,kBAAkB,iBAAiB,YAAY,WAAW;AAE9I,cAAI,kBAAkB,MAAM;AAC1B;AACE,kBAAI,cAAc,YAAY;AAC9B,kBAAI,mBAAmB,IAAI,YAAY,YAAY,YAAY,MAAM,WAAW;AAChF,gCAAkB,gBAAgB;AAClC,0BAAY,OAAO,cAAc,gBAAgB;AACjD;YACD;AAAA,UACP,OAAW;AAEL,gBAAI,UAAU,oBAAoB,aAAa;AAE/C,gBAAI,YAAY,MAAM;AACpB,yCAA2B,OAAO;AAAA,YACnC;AAED,wBAAY,YAAY;AACxB,mBAAO;AAAA,UACR;AAGD,2BAAiB,MAAK;AAAA,QACvB;AAED,eAAO;AAAA,MACT;AAEA,eAAS,wCAAwC,aAAa,KAAK,KAAK;AACtE,YAAI,mCAAmC,WAAW,GAAG;AACnD,cAAI,OAAO,GAAG;AAAA,QACf;AAAA,MACH;AAEA,eAAS,wBAAwB;AAC/B,oCAA4B;AAG5B,YAAI,gBAAgB,QAAQ,mCAAmC,WAAW,GAAG;AAC3E,wBAAc;AAAA,QACf;AAED,YAAI,eAAe,QAAQ,mCAAmC,UAAU,GAAG;AACzE,uBAAa;AAAA,QACd;AAED,YAAI,gBAAgB,QAAQ,mCAAmC,WAAW,GAAG;AAC3E,wBAAc;AAAA,QACf;AAED,uBAAe,QAAQ,uCAAuC;AAC9D,8BAAsB,QAAQ,uCAAuC;AAAA,MACvE;AAEA,eAAS,4BAA4B,aAAa,WAAW;AAC3D,YAAI,YAAY,cAAc,WAAW;AACvC,sBAAY,YAAY;AAExB,cAAI,CAAC,2BAA2B;AAC9B,wCAA4B;AAI5B,sBAAU,0BAA0B,UAAU,yBAAyB,qBAAqB;AAAA,UAC7F;AAAA,QACF;AAAA,MACH;AAEA,eAAS,iBAAiB,WAAW;AAGnC,YAAI,qBAAqB,SAAS,GAAG;AACnC,sCAA4B,qBAAqB,CAAC,GAAG,SAAS;AAI9D,mBAASA,KAAI,GAAGA,KAAI,qBAAqB,QAAQA,MAAK;AACpD,gBAAI,cAAc,qBAAqBA,EAAC;AAExC,gBAAI,YAAY,cAAc,WAAW;AACvC,0BAAY,YAAY;AAAA,YACzB;AAAA,UACF;AAAA,QACF;AAED,YAAI,gBAAgB,MAAM;AACxB,sCAA4B,aAAa,SAAS;AAAA,QACnD;AAED,YAAI,eAAe,MAAM;AACvB,sCAA4B,YAAY,SAAS;AAAA,QAClD;AAED,YAAI,gBAAgB,MAAM;AACxB,sCAA4B,aAAa,SAAS;AAAA,QACnD;AAED,YAAI,UAAU,SAAUsH,cAAa;AACnC,iBAAO,4BAA4BA,cAAa,SAAS;AAAA,QAC7D;AAEE,uBAAe,QAAQ,OAAO;AAC9B,8BAAsB,QAAQ,OAAO;AAErC,iBAAS,KAAK,GAAG,KAAK,+BAA+B,QAAQ,MAAM;AACjE,cAAI,eAAe,+BAA+B,EAAE;AAEpD,cAAI,aAAa,cAAc,WAAW;AACxC,yBAAa,YAAY;AAAA,UAC1B;AAAA,QACF;AAED,eAAO,+BAA+B,SAAS,GAAG;AAChD,cAAI,qBAAqB,+BAA+B,CAAC;AAEzD,cAAI,mBAAmB,cAAc,MAAM;AAEzC;AAAA,UACN,OAAW;AACL,2CAA+B,kBAAkB;AAEjD,gBAAI,mBAAmB,cAAc,MAAM;AAEzC,6CAA+B,MAAK;AAAA,YACrC;AAAA,UACF;AAAA,QACF;AAAA,MACH;AAEA,UAAI,0BAA0B,qBAAqB;AAEnD,UAAI,WAAW;AAGf,eAAS,WAAW,SAAS;AAC3B,mBAAW,CAAC,CAAC;AAAA,MACf;AACA,eAAS,YAAY;AACnB,eAAO;AAAA,MACT;AACA,eAAS,uCAAuC,iBAAiB,cAAc,kBAAkB;AAC/F,YAAI,gBAAgB,iBAAiB,YAAY;AACjD,YAAI;AAEJ,gBAAQ,eAAa;AAAA,UACnB,KAAK;AACH,8BAAkB;AAClB;AAAA,UAEF,KAAK;AACH,8BAAkB;AAClB;AAAA,UAEF,KAAK;AAAA,UACL;AACE,8BAAkB;AAClB;AAAA,QACH;AAED,eAAO,gBAAgB,KAAK,MAAM,cAAc,kBAAkB,eAAe;AAAA,MACnF;AAEA,eAAS,sBAAsB,cAAc,kBAAkB,WAAW,aAAa;AACrF,YAAI,mBAAmB;AACvB,YAAI,iBAAiB,wBAAwB;AAC7C,gCAAwB,aAAa;AAErC,YAAI;AACF,mCAAyB,qBAAqB;AAC9C,wBAAc,cAAc,kBAAkB,WAAW,WAAW;AAAA,QACxE,UAAY;AACR,mCAAyB,gBAAgB;AACzC,kCAAwB,aAAa;AAAA,QACtC;AAAA,MACH;AAEA,eAAS,wBAAwB,cAAc,kBAAkB,WAAW,aAAa;AACvF,YAAI,mBAAmB;AACvB,YAAI,iBAAiB,wBAAwB;AAC7C,gCAAwB,aAAa;AAErC,YAAI;AACF,mCAAyB,uBAAuB;AAChD,wBAAc,cAAc,kBAAkB,WAAW,WAAW;AAAA,QACxE,UAAY;AACR,mCAAyB,gBAAgB;AACzC,kCAAwB,aAAa;AAAA,QACtC;AAAA,MACH;AAEA,eAAS,cAAc,cAAc,kBAAkB,iBAAiB,aAAa;AACnF,YAAI,CAAC,UAAU;AACb;AAAA,QACD;AAED;AACE,0FAAgF,cAAc,kBAAkB,iBAAiB,WAAW;AAAA,QAC7I;AAAA,MACH;AAEA,eAAS,gFAAgF,cAAc,kBAAkB,iBAAiB,aAAa;AACrJ,YAAI,YAAY,0BAA0B,cAAc,kBAAkB,iBAAiB,WAAW;AAEtG,YAAI,cAAc,MAAM;AACtB,4CAAkC,cAAc,kBAAkB,aAAa,mBAAmB,eAAe;AACjH,iCAAuB,cAAc,WAAW;AAChD;AAAA,QACD;AAED,YAAI,uBAAuB,WAAW,cAAc,kBAAkB,iBAAiB,WAAW,GAAG;AACnG,sBAAY,gBAAe;AAC3B;AAAA,QACD;AAID,+BAAuB,cAAc,WAAW;AAEhD,YAAI,mBAAmB,oBAAoB,qCAAqC,YAAY,GAAG;AAC7F,iBAAO,cAAc,MAAM;AACzB,gBAAI,QAAQ,oBAAoB,SAAS;AAEzC,gBAAI,UAAU,MAAM;AAClB,0CAA4B,KAAK;AAAA,YAClC;AAED,gBAAI,gBAAgB,0BAA0B,cAAc,kBAAkB,iBAAiB,WAAW;AAE1G,gBAAI,kBAAkB,MAAM;AAC1B,gDAAkC,cAAc,kBAAkB,aAAa,mBAAmB,eAAe;AAAA,YAClH;AAED,gBAAI,kBAAkB,WAAW;AAC/B;AAAA,YACD;AAED,wBAAY;AAAA,UACb;AAED,cAAI,cAAc,MAAM;AACtB,wBAAY,gBAAe;AAAA,UAC5B;AAED;AAAA,QACD;AAID,0CAAkC,cAAc,kBAAkB,aAAa,MAAM,eAAe;AAAA,MACtG;AAEA,UAAI,oBAAoB;AAGxB,eAAS,0BAA0B,cAAc,kBAAkB,iBAAiB,aAAa;AAE/F,4BAAoB;AACpB,YAAI,oBAAoB,eAAe,WAAW;AAClD,YAAI,aAAa,2BAA2B,iBAAiB;AAE7D,YAAI,eAAe,MAAM;AACvB,cAAI,iBAAiB,uBAAuB,UAAU;AAEtD,cAAI,mBAAmB,MAAM;AAE3B,yBAAa;AAAA,UACnB,OAAW;AACL,gBAAI,MAAM,eAAe;AAEzB,gBAAI,QAAQ,mBAAmB;AAC7B,kBAAI,WAAW,6BAA6B,cAAc;AAE1D,kBAAI,aAAa,MAAM;AAKrB,uBAAO;AAAA,cACR;AAKD,2BAAa;AAAA,YACrB,WAAiB,QAAQ,UAAU;AAC3B,kBAAIF,QAAO,eAAe;AAE1B,kBAAI,iBAAiBA,KAAI,GAAG;AAG1B,uBAAO,sBAAsB,cAAc;AAAA,cAC5C;AAED,2BAAa;AAAA,YACrB,WAAiB,mBAAmB,YAAY;AAKxC,2BAAa;AAAA,YACd;AAAA,UACF;AAAA,QACF;AAED,4BAAoB;AAEpB,eAAO;AAAA,MACT;AACA,eAAS,iBAAiB,cAAc;AACtC,gBAAQ,cAAY;AAAA,UAElB,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UAGL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UAGL,KAAK;AAAA,UACL,KAAK;AAAA,UAGL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AACH,mBAAO;AAAA,UAET,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UAGL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AACH,mBAAO;AAAA,UAET,KAAK,WACH;AAIE,gBAAI,oBAAoB;AAExB,oBAAQ,mBAAiB;AAAA,cACvB,KAAK;AACH,uBAAO;AAAA,cAET,KAAK;AACH,uBAAO;AAAA,cAET,KAAK;AAAA,cACL,KAAK;AAEH,uBAAO;AAAA,cAET,KAAK;AACH,uBAAO;AAAA,cAET;AACE,uBAAO;AAAA,YACV;AAAA,UACF;AAAA,UAEH;AACE,mBAAO;AAAA,QACV;AAAA,MACH;AAEA,eAAS,uBAAuB,QAAQ,WAAW,UAAU;AAC3D,eAAO,iBAAiB,WAAW,UAAU,KAAK;AAClD,eAAO;AAAA,MACT;AACA,eAAS,wBAAwB,QAAQ,WAAW,UAAU;AAC5D,eAAO,iBAAiB,WAAW,UAAU,IAAI;AACjD,eAAO;AAAA,MACT;AACA,eAAS,uCAAuC,QAAQ,WAAW,UAAU,SAAS;AACpF,eAAO,iBAAiB,WAAW,UAAU;AAAA,UAC3C,SAAS;AAAA,UACT;AAAA,QACJ,CAAG;AACD,eAAO;AAAA,MACT;AACA,eAAS,sCAAsC,QAAQ,WAAW,UAAU,SAAS;AACnF,eAAO,iBAAiB,WAAW,UAAU;AAAA,UAC3C;AAAA,QACJ,CAAG;AACD,eAAO;AAAA,MACT;AAaA,UAAI,OAAO;AACX,UAAI,YAAY;AAChB,UAAI,eAAe;AACnB,eAAS,WAAW,mBAAmB;AACrC,eAAO;AACP,oBAAY,QAAO;AACnB,eAAO;AAAA,MACT;AACA,eAAS,QAAQ;AACf,eAAO;AACP,oBAAY;AACZ,uBAAe;AAAA,MACjB;AACA,eAAS,UAAU;AACjB,YAAI,cAAc;AAChB,iBAAO;AAAA,QACR;AAED,YAAI;AACJ,YAAI,aAAa;AACjB,YAAI,cAAc,WAAW;AAC7B,YAAI;AACJ,YAAI,WAAW;AACf,YAAI,YAAY,SAAS;AAEzB,aAAK,QAAQ,GAAG,QAAQ,aAAa,SAAS;AAC5C,cAAI,WAAW,KAAK,MAAM,SAAS,KAAK,GAAG;AACzC;AAAA,UACD;AAAA,QACF;AAED,YAAI,SAAS,cAAc;AAE3B,aAAK,MAAM,GAAG,OAAO,QAAQ,OAAO;AAClC,cAAI,WAAW,cAAc,GAAG,MAAM,SAAS,YAAY,GAAG,GAAG;AAC/D;AAAA,UACD;AAAA,QACF;AAED,YAAI,YAAY,MAAM,IAAI,IAAI,MAAM;AACpC,uBAAe,SAAS,MAAM,OAAO,SAAS;AAC9C,eAAO;AAAA,MACT;AACA,eAAS,UAAU;AACjB,YAAI,WAAW,MAAM;AACnB,iBAAO,KAAK;AAAA,QACb;AAED,eAAO,KAAK;AAAA,MACd;AAYA,eAAS,iBAAiB,aAAa;AACrC,YAAI;AACJ,YAAI,UAAU,YAAY;AAE1B,YAAI,cAAc,aAAa;AAC7B,qBAAW,YAAY;AAEvB,cAAI,aAAa,KAAK,YAAY,IAAI;AACpC,uBAAW;AAAA,UACZ;AAAA,QACL,OAAS;AAEL,qBAAW;AAAA,QACZ;AAID,YAAI,aAAa,IAAI;AACnB,qBAAW;AAAA,QACZ;AAID,YAAI,YAAY,MAAM,aAAa,IAAI;AACrC,iBAAO;AAAA,QACR;AAED,eAAO;AAAA,MACT;AAEA,eAAS,0BAA0B;AACjC,eAAO;AAAA,MACT;AAEA,eAAS,2BAA2B;AAClC,eAAO;AAAA,MACT;AAIA,eAAS,qBAAqB,WAAW;AAcvC,iBAAS,mBAAmB,WAAW,gBAAgB,YAAY,aAAa,mBAAmB;AACjG,eAAK,aAAa;AAClB,eAAK,cAAc;AACnB,eAAK,OAAO;AACZ,eAAK,cAAc;AACnB,eAAK,SAAS;AACd,eAAK,gBAAgB;AAErB,mBAAS,aAAa,WAAW;AAC/B,gBAAI,CAAC,UAAU,eAAe,SAAS,GAAG;AACxC;AAAA,YACD;AAED,gBAAI,YAAY,UAAU,SAAS;AAEnC,gBAAI,WAAW;AACb,mBAAK,SAAS,IAAI,UAAU,WAAW;AAAA,YAC/C,OAAa;AACL,mBAAK,SAAS,IAAI,YAAY,SAAS;AAAA,YACxC;AAAA,UACF;AAED,cAAI,mBAAmB,YAAY,oBAAoB,OAAO,YAAY,mBAAmB,YAAY,gBAAgB;AAEzH,cAAI,kBAAkB;AACpB,iBAAK,qBAAqB;AAAA,UAChC,OAAW;AACL,iBAAK,qBAAqB;AAAA,UAC3B;AAED,eAAK,uBAAuB;AAC5B,iBAAO;AAAA,QACR;AAED,eAAO,mBAAmB,WAAW;AAAA,UACnC,gBAAgB,WAAY;AAC1B,iBAAK,mBAAmB;AACxB,gBAAI,QAAQ,KAAK;AAEjB,gBAAI,CAAC,OAAO;AACV;AAAA,YACD;AAED,gBAAI,MAAM,gBAAgB;AACxB,oBAAM,eAAc;AAAA,YACrB,WAAU,OAAO,MAAM,gBAAgB,WAAW;AACjD,oBAAM,cAAc;AAAA,YACrB;AAED,iBAAK,qBAAqB;AAAA,UAC3B;AAAA,UACD,iBAAiB,WAAY;AAC3B,gBAAI,QAAQ,KAAK;AAEjB,gBAAI,CAAC,OAAO;AACV;AAAA,YACD;AAED,gBAAI,MAAM,iBAAiB;AACzB,oBAAM,gBAAe;AAAA,YACtB,WAAU,OAAO,MAAM,iBAAiB,WAAW;AAMlD,oBAAM,eAAe;AAAA,YACtB;AAED,iBAAK,uBAAuB;AAAA,UAC7B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAOD,SAAS,WAAY;AAAA,UACpB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAOD,cAAc;AAAA,QAClB,CAAG;AACD,eAAO;AAAA,MACT;AAOA,UAAI,iBAAiB;AAAA,QACnB,YAAY;AAAA,QACZ,SAAS;AAAA,QACT,YAAY;AAAA,QACZ,WAAW,SAAU,OAAO;AAC1B,iBAAO,MAAM,aAAa,KAAK,IAAG;AAAA,QACnC;AAAA,QACD,kBAAkB;AAAA,QAClB,WAAW;AAAA,MACb;AACA,UAAI,iBAAiB,qBAAqB,cAAc;AAExD,UAAI,mBAAmB,OAAO,CAAE,GAAE,gBAAgB;AAAA,QAChD,MAAM;AAAA,QACN,QAAQ;AAAA,MACV,CAAC;AAED,UAAI,mBAAmB,qBAAqB,gBAAgB;AAC5D,UAAI;AACJ,UAAI;AACJ,UAAI;AAEJ,eAAS,iCAAiC,OAAO;AAC/C,YAAI,UAAU,gBAAgB;AAC5B,cAAI,kBAAkB,MAAM,SAAS,aAAa;AAChD,4BAAgB,MAAM,UAAU,eAAe;AAC/C,4BAAgB,MAAM,UAAU,eAAe;AAAA,UACrD,OAAW;AACL,4BAAgB;AAChB,4BAAgB;AAAA,UACjB;AAED,2BAAiB;AAAA,QAClB;AAAA,MACH;AAOA,UAAI,sBAAsB,OAAO,CAAE,GAAE,kBAAkB;AAAA,QACrD,SAAS;AAAA,QACT,SAAS;AAAA,QACT,SAAS;AAAA,QACT,SAAS;AAAA,QACT,OAAO;AAAA,QACP,OAAO;AAAA,QACP,SAAS;AAAA,QACT,UAAU;AAAA,QACV,QAAQ;AAAA,QACR,SAAS;AAAA,QACT,kBAAkB;AAAA,QAClB,QAAQ;AAAA,QACR,SAAS;AAAA,QACT,eAAe,SAAU,OAAO;AAC9B,cAAI,MAAM,kBAAkB;AAAW,mBAAO,MAAM,gBAAgB,MAAM,aAAa,MAAM,YAAY,MAAM;AAC/G,iBAAO,MAAM;AAAA,QACd;AAAA,QACD,WAAW,SAAU,OAAO;AAC1B,cAAI,eAAe,OAAO;AACxB,mBAAO,MAAM;AAAA,UACd;AAED,2CAAiC,KAAK;AACtC,iBAAO;AAAA,QACR;AAAA,QACD,WAAW,SAAU,OAAO;AAC1B,cAAI,eAAe,OAAO;AACxB,mBAAO,MAAM;AAAA,UACd;AAKD,iBAAO;AAAA,QACR;AAAA,MACH,CAAC;AAED,UAAI,sBAAsB,qBAAqB,mBAAmB;AAMlE,UAAI,qBAAqB,OAAO,CAAE,GAAE,qBAAqB;AAAA,QACvD,cAAc;AAAA,MAChB,CAAC;AAED,UAAI,qBAAqB,qBAAqB,kBAAkB;AAMhE,UAAI,sBAAsB,OAAO,CAAE,GAAE,kBAAkB;AAAA,QACrD,eAAe;AAAA,MACjB,CAAC;AAED,UAAI,sBAAsB,qBAAqB,mBAAmB;AAOlE,UAAI,0BAA0B,OAAO,CAAE,GAAE,gBAAgB;AAAA,QACvD,eAAe;AAAA,QACf,aAAa;AAAA,QACb,eAAe;AAAA,MACjB,CAAC;AAED,UAAI,0BAA0B,qBAAqB,uBAAuB;AAM1E,UAAI,0BAA0B,OAAO,CAAE,GAAE,gBAAgB;AAAA,QACvD,eAAe,SAAU,OAAO;AAC9B,iBAAO,mBAAmB,QAAQ,MAAM,gBAAgB,OAAO;AAAA,QAChE;AAAA,MACH,CAAC;AAED,UAAI,0BAA0B,qBAAqB,uBAAuB;AAM1E,UAAI,4BAA4B,OAAO,CAAE,GAAE,gBAAgB;AAAA,QACzD,MAAM;AAAA,MACR,CAAC;AAED,UAAI,4BAA4B,qBAAqB,yBAAyB;AAQ9E,UAAI,sBAAsB;AAM1B,UAAI,eAAe;AAAA,QACjB,KAAK;AAAA,QACL,UAAU;AAAA,QACV,MAAM;AAAA,QACN,IAAI;AAAA,QACJ,OAAO;AAAA,QACP,MAAM;AAAA,QACN,KAAK;AAAA,QACL,KAAK;AAAA,QACL,MAAM;AAAA,QACN,MAAM;AAAA,QACN,QAAQ;AAAA,QACR,iBAAiB;AAAA,MACnB;AAOA,UAAI,iBAAiB;AAAA,QACnB,KAAK;AAAA,QACL,KAAK;AAAA,QACL,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,QACN,OAAO;AAAA,QACP,OAAO;AAAA,QACP,OAAO;AAAA,QACP,OAAO;AAAA,QACP,OAAO;AAAA,QACP,OAAO;AAAA,QACP,OAAO;AAAA,QACP,OAAO;AAAA,QACP,OAAO;AAAA,QACP,OAAO;AAAA,QACP,OAAO;AAAA,QACP,OAAO;AAAA,QACP,OAAO;AAAA,QACP,OAAO;AAAA,QACP,OAAO;AAAA,MACT;AAMA,eAAS,YAAY,aAAa;AAChC,YAAI,YAAY,KAAK;AAKnB,cAAI,MAAM,aAAa,YAAY,GAAG,KAAK,YAAY;AAEvD,cAAI,QAAQ,gBAAgB;AAC1B,mBAAO;AAAA,UACR;AAAA,QACF;AAGD,YAAI,YAAY,SAAS,YAAY;AACnC,cAAI,WAAW,iBAAiB,WAAW;AAG3C,iBAAO,aAAa,KAAK,UAAU,OAAO,aAAa,QAAQ;AAAA,QAChE;AAED,YAAI,YAAY,SAAS,aAAa,YAAY,SAAS,SAAS;AAGlE,iBAAO,eAAe,YAAY,OAAO,KAAK;AAAA,QAC/C;AAED,eAAO;AAAA,MACT;AAOA,UAAI,oBAAoB;AAAA,QACtB,KAAK;AAAA,QACL,SAAS;AAAA,QACT,MAAM;AAAA,QACN,OAAO;AAAA,MACT;AAIA,eAAS,oBAAoB,QAAQ;AACnC,YAAI,iBAAiB;AACrB,YAAI,cAAc,eAAe;AAEjC,YAAI,YAAY,kBAAkB;AAChC,iBAAO,YAAY,iBAAiB,MAAM;AAAA,QAC3C;AAED,YAAI,UAAU,kBAAkB,MAAM;AACtC,eAAO,UAAU,CAAC,CAAC,YAAY,OAAO,IAAI;AAAA,MAC5C;AAEA,eAAS,sBAAsB,aAAa;AAC1C,eAAO;AAAA,MACT;AAOA,UAAI,yBAAyB,OAAO,CAAE,GAAE,kBAAkB;AAAA,QACxD,KAAK;AAAA,QACL,MAAM;AAAA,QACN,UAAU;AAAA,QACV,SAAS;AAAA,QACT,UAAU;AAAA,QACV,QAAQ;AAAA,QACR,SAAS;AAAA,QACT,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,kBAAkB;AAAA;AAAA,QAElB,UAAU,SAAU,OAAO;AAKzB,cAAI,MAAM,SAAS,YAAY;AAC7B,mBAAO,iBAAiB,KAAK;AAAA,UAC9B;AAED,iBAAO;AAAA,QACR;AAAA,QACD,SAAS,SAAU,OAAO;AAOxB,cAAI,MAAM,SAAS,aAAa,MAAM,SAAS,SAAS;AACtD,mBAAO,MAAM;AAAA,UACd;AAED,iBAAO;AAAA,QACR;AAAA,QACD,OAAO,SAAU,OAAO;AAGtB,cAAI,MAAM,SAAS,YAAY;AAC7B,mBAAO,iBAAiB,KAAK;AAAA,UAC9B;AAED,cAAI,MAAM,SAAS,aAAa,MAAM,SAAS,SAAS;AACtD,mBAAO,MAAM;AAAA,UACd;AAED,iBAAO;AAAA,QACR;AAAA,MACH,CAAC;AAED,UAAI,yBAAyB,qBAAqB,sBAAsB;AAMxE,UAAI,wBAAwB,OAAO,CAAE,GAAE,qBAAqB;AAAA,QAC1D,WAAW;AAAA,QACX,OAAO;AAAA,QACP,QAAQ;AAAA,QACR,UAAU;AAAA,QACV,oBAAoB;AAAA,QACpB,OAAO;AAAA,QACP,OAAO;AAAA,QACP,OAAO;AAAA,QACP,aAAa;AAAA,QACb,WAAW;AAAA,MACb,CAAC;AAED,UAAI,wBAAwB,qBAAqB,qBAAqB;AAMtE,UAAI,sBAAsB,OAAO,CAAE,GAAE,kBAAkB;AAAA,QACrD,SAAS;AAAA,QACT,eAAe;AAAA,QACf,gBAAgB;AAAA,QAChB,QAAQ;AAAA,QACR,SAAS;AAAA,QACT,SAAS;AAAA,QACT,UAAU;AAAA,QACV,kBAAkB;AAAA,MACpB,CAAC;AAED,UAAI,sBAAsB,qBAAqB,mBAAmB;AAOlE,UAAI,2BAA2B,OAAO,CAAE,GAAE,gBAAgB;AAAA,QACxD,cAAc;AAAA,QACd,aAAa;AAAA,QACb,eAAe;AAAA,MACjB,CAAC;AAED,UAAI,2BAA2B,qBAAqB,wBAAwB;AAM5E,UAAI,sBAAsB,OAAO,CAAE,GAAE,qBAAqB;AAAA,QACxD,QAAQ,SAAU,OAAO;AACvB,iBAAO,YAAY,QAAQ,MAAM;AAAA;AAAA,YACjC,iBAAiB,QAAQ,CAAC,MAAM,cAAc;AAAA;AAAA,QAC/C;AAAA,QACD,QAAQ,SAAU,OAAO;AACvB,iBAAO,YAAY,QAAQ,MAAM;AAAA;AAAA,YACjC,iBAAiB,QAAQ,CAAC,MAAM;AAAA;AAAA,cAChC,gBAAgB,QAAQ,CAAC,MAAM,aAAa;AAAA;AAAA;AAAA,QAC7C;AAAA,QACD,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA,QAKR,WAAW;AAAA,MACb,CAAC;AAED,UAAI,sBAAsB,qBAAqB,mBAAmB;AAElE,UAAI,eAAe,CAAC,GAAG,IAAI,IAAI,EAAE;AAEjC,UAAI,gBAAgB;AACpB,UAAI,yBAAyB,aAAa,sBAAsB;AAChE,UAAI,eAAe;AAEnB,UAAI,aAAa,kBAAkB,UAAU;AAC3C,uBAAe,SAAS;AAAA,MAC1B;AAKA,UAAI,uBAAuB,aAAa,eAAe,UAAU,CAAC;AAIlE,UAAI,6BAA6B,cAAc,CAAC,0BAA0B,gBAAgB,eAAe,KAAK,gBAAgB;AAC9H,UAAI,gBAAgB;AACpB,UAAI,gBAAgB,OAAO,aAAa,aAAa;AAErD,eAAS,iBAAiB;AACxB,8BAAsB,iBAAiB,CAAC,kBAAkB,YAAY,aAAa,OAAO,CAAC;AAC3F,8BAAsB,oBAAoB,CAAC,kBAAkB,YAAY,WAAW,YAAY,SAAS,WAAW,CAAC;AACrH,8BAAsB,sBAAsB,CAAC,oBAAoB,YAAY,WAAW,YAAY,SAAS,WAAW,CAAC;AACzH,8BAAsB,uBAAuB,CAAC,qBAAqB,YAAY,WAAW,YAAY,SAAS,WAAW,CAAC;AAAA,MAC7H;AAGA,UAAI,mBAAmB;AAOvB,eAAS,kBAAkB,aAAa;AACtC,gBAAQ,YAAY,WAAW,YAAY,UAAU,YAAY;AAAA,QACjE,EAAE,YAAY,WAAW,YAAY;AAAA,MACvC;AAMA,eAAS,wBAAwB,cAAc;AAC7C,gBAAQ,cAAY;AAAA,UAClB,KAAK;AACH,mBAAO;AAAA,UAET,KAAK;AACH,mBAAO;AAAA,UAET,KAAK;AACH,mBAAO;AAAA,QACV;AAAA,MACH;AAOA,eAAS,2BAA2B,cAAc,aAAa;AAC7D,eAAO,iBAAiB,aAAa,YAAY,YAAY;AAAA,MAC/D;AAMA,eAAS,yBAAyB,cAAc,aAAa;AAC3D,gBAAQ,cAAY;AAAA,UAClB,KAAK;AAEH,mBAAO,aAAa,QAAQ,YAAY,OAAO,MAAM;AAAA,UAEvD,KAAK;AAGH,mBAAO,YAAY,YAAY;AAAA,UAEjC,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAEH,mBAAO;AAAA,UAET;AACE,mBAAO;AAAA,QACV;AAAA,MACH;AAYA,eAAS,uBAAuB,aAAa;AAC3C,YAAI,SAAS,YAAY;AAEzB,YAAI,OAAO,WAAW,YAAY,UAAU,QAAQ;AAClD,iBAAO,OAAO;AAAA,QACf;AAED,eAAO;AAAA,MACT;AAaA,eAAS,iBAAiB,aAAa;AACrC,eAAO,YAAY,WAAW;AAAA,MAChC;AAGA,UAAI,cAAc;AAKlB,eAAS,wBAAwB,eAAe,cAAc,YAAY,aAAa,mBAAmB;AACxG,YAAI;AACJ,YAAI;AAEJ,YAAI,wBAAwB;AAC1B,sBAAY,wBAAwB,YAAY;AAAA,QACpD,WAAa,CAAC,aAAa;AACvB,cAAI,2BAA2B,cAAc,WAAW,GAAG;AACzD,wBAAY;AAAA,UACb;AAAA,QACF,WAAU,yBAAyB,cAAc,WAAW,GAAG;AAC9D,sBAAY;AAAA,QACb;AAED,YAAI,CAAC,WAAW;AACd,iBAAO;AAAA,QACR;AAED,YAAI,8BAA8B,CAAC,iBAAiB,WAAW,GAAG;AAGhE,cAAI,CAAC,eAAe,cAAc,sBAAsB;AACtD,0BAAc,WAAW,iBAAiB;AAAA,UAChD,WAAe,cAAc,oBAAoB;AAC3C,gBAAI,aAAa;AACf,6BAAe,QAAO;AAAA,YACvB;AAAA,UACF;AAAA,QACF;AAED,YAAI,YAAY,4BAA4B,YAAY,SAAS;AAEjE,YAAI,UAAU,SAAS,GAAG;AACxB,cAAI,QAAQ,IAAI,0BAA0B,WAAW,cAAc,MAAM,aAAa,iBAAiB;AACvG,wBAAc,KAAK;AAAA,YACjB;AAAA,YACA;AAAA,UACN,CAAK;AAED,cAAI,cAAc;AAGhB,kBAAM,OAAO;AAAA,UACnB,OAAW;AACL,gBAAI,aAAa,uBAAuB,WAAW;AAEnD,gBAAI,eAAe,MAAM;AACvB,oBAAM,OAAO;AAAA,YACd;AAAA,UACF;AAAA,QACF;AAAA,MACH;AAEA,eAAS,0BAA0B,cAAc,aAAa;AAC5D,gBAAQ,cAAY;AAAA,UAClB,KAAK;AACH,mBAAO,uBAAuB,WAAW;AAAA,UAE3C,KAAK;AAeH,gBAAI,QAAQ,YAAY;AAExB,gBAAI,UAAU,eAAe;AAC3B,qBAAO;AAAA,YACR;AAED,+BAAmB;AACnB,mBAAO;AAAA,UAET,KAAK;AAEH,gBAAI,QAAQ,YAAY;AAIxB,gBAAI,UAAU,iBAAiB,kBAAkB;AAC/C,qBAAO;AAAA,YACR;AAED,mBAAO;AAAA,UAET;AAEE,mBAAO;AAAA,QACV;AAAA,MACH;AAOA,eAAS,4BAA4B,cAAc,aAAa;AAK9D,YAAI,aAAa;AACf,cAAI,iBAAiB,oBAAoB,CAAC,0BAA0B,yBAAyB,cAAc,WAAW,GAAG;AACvH,gBAAI,QAAQ;AACZ;AACA,0BAAc;AACd,mBAAO;AAAA,UACR;AAED,iBAAO;AAAA,QACR;AAED,gBAAQ,cAAY;AAAA,UAClB,KAAK;AAGH,mBAAO;AAAA,UAET,KAAK;AAiBH,gBAAI,CAAC,kBAAkB,WAAW,GAAG;AAOnC,kBAAI,YAAY,QAAQ,YAAY,KAAK,SAAS,GAAG;AACnD,uBAAO,YAAY;AAAA,cAC7B,WAAmB,YAAY,OAAO;AAC5B,uBAAO,OAAO,aAAa,YAAY,KAAK;AAAA,cAC7C;AAAA,YACF;AAED,mBAAO;AAAA,UAET,KAAK;AACH,mBAAO,8BAA8B,CAAC,iBAAiB,WAAW,IAAI,OAAO,YAAY;AAAA,UAE3F;AACE,mBAAO;AAAA,QACV;AAAA,MACH;AASA,eAAS,wBAAwB,eAAe,cAAc,YAAY,aAAa,mBAAmB;AACxG,YAAI;AAEJ,YAAI,sBAAsB;AACxB,kBAAQ,0BAA0B,cAAc,WAAW;AAAA,QAC/D,OAAS;AACL,kBAAQ,4BAA4B,cAAc,WAAW;AAAA,QAC9D;AAID,YAAI,CAAC,OAAO;AACV,iBAAO;AAAA,QACR;AAED,YAAI,YAAY,4BAA4B,YAAY,eAAe;AAEvE,YAAI,UAAU,SAAS,GAAG;AACxB,cAAI,QAAQ,IAAI,oBAAoB,iBAAiB,eAAe,MAAM,aAAa,iBAAiB;AACxG,wBAAc,KAAK;AAAA,YACjB;AAAA,YACA;AAAA,UACN,CAAK;AACD,gBAAM,OAAO;AAAA,QACd;AAAA,MACH;AAqBA,eAAS,cAAc,eAAe,cAAc,YAAY,aAAa,mBAAmB,kBAAkB,iBAAiB;AACjI,gCAAwB,eAAe,cAAc,YAAY,aAAa,iBAAiB;AAC/F,gCAAwB,eAAe,cAAc,YAAY,aAAa,iBAAiB;AAAA,MACjG;AAKA,UAAI,sBAAsB;AAAA,QACxB,OAAO;AAAA,QACP,MAAM;AAAA,QACN,UAAU;AAAA,QACV,kBAAkB;AAAA,QAClB,OAAO;AAAA,QACP,OAAO;AAAA,QACP,QAAQ;AAAA,QACR,UAAU;AAAA,QACV,OAAO;AAAA,QACP,QAAQ;AAAA,QACR,KAAK;AAAA,QACL,MAAM;AAAA,QACN,MAAM;AAAA,QACN,KAAK;AAAA,QACL,MAAM;AAAA,MACR;AAEA,eAAS,mBAAmB,MAAM;AAChC,YAAI,WAAW,QAAQ,KAAK,YAAY,KAAK,SAAS;AAEtD,YAAI,aAAa,SAAS;AACxB,iBAAO,CAAC,CAAC,oBAAoB,KAAK,IAAI;AAAA,QACvC;AAED,YAAI,aAAa,YAAY;AAC3B,iBAAO;AAAA,QACR;AAED,eAAO;AAAA,MACT;AAAA,MAEA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAcA,eAAS,iBAAiB,iBAAiB;AACzC,YAAI,CAAC,WAAW;AACd,iBAAO;AAAA,QACR;AAED,YAAI,YAAY,OAAO;AACvB,YAAI,cAAe,aAAa;AAEhC,YAAI,CAAC,aAAa;AAChB,cAAI,UAAU,SAAS,cAAc,KAAK;AAC1C,kBAAQ,aAAa,WAAW,SAAS;AACzC,wBAAc,OAAO,QAAQ,SAAS,MAAM;AAAA,QAC7C;AAED,eAAO;AAAA,MACT;AAEA,eAAS,mBAAmB;AAC1B,8BAAsB,YAAY,CAAC,UAAU,SAAS,WAAW,YAAY,SAAS,WAAW,SAAS,iBAAiB,CAAC;AAAA,MAC9H;AAEA,eAAS,+BAA+B,eAAe,MAAM,aAAa,QAAQ;AAEhF,4BAAoB,MAAM;AAC1B,YAAI,YAAY,4BAA4B,MAAM,UAAU;AAE5D,YAAI,UAAU,SAAS,GAAG;AACxB,cAAI,QAAQ,IAAI,eAAe,YAAY,UAAU,MAAM,aAAa,MAAM;AAC9E,wBAAc,KAAK;AAAA,YACjB;AAAA,YACA;AAAA,UACN,CAAK;AAAA,QACF;AAAA,MACH;AAMA,UAAI,gBAAgB;AACpB,UAAI,oBAAoB;AAKxB,eAAS,qBAAqB,MAAM;AAClC,YAAI,WAAW,KAAK,YAAY,KAAK,SAAS;AAC9C,eAAO,aAAa,YAAY,aAAa,WAAW,KAAK,SAAS;AAAA,MACxE;AAEA,eAAS,0BAA0B,aAAa;AAC9C,YAAI,gBAAgB,CAAA;AACpB,uCAA+B,eAAe,mBAAmB,aAAa,eAAe,WAAW,CAAC;AAYzG,uBAAe,iBAAiB,aAAa;AAAA,MAC/C;AAEA,eAAS,gBAAgB,eAAe;AACtC,6BAAqB,eAAe,CAAC;AAAA,MACvC;AAEA,eAAS,sBAAsB,YAAY;AACzC,YAAI,aAAa,oBAAoB,UAAU;AAE/C,YAAI,qBAAqB,UAAU,GAAG;AACpC,iBAAO;AAAA,QACR;AAAA,MACH;AAEA,eAAS,4BAA4B,cAAc,YAAY;AAC7D,YAAI,iBAAiB,UAAU;AAC7B,iBAAO;AAAA,QACR;AAAA,MACH;AAMA,UAAI,wBAAwB;AAE5B,UAAI,WAAW;AAGb,gCAAwB,iBAAiB,OAAO,MAAM,CAAC,SAAS,gBAAgB,SAAS,eAAe;AAAA,MAC1G;AAQA,eAAS,4BAA4B,QAAQ,YAAY;AACvD,wBAAgB;AAChB,4BAAoB;AACpB,sBAAc,YAAY,oBAAoB,oBAAoB;AAAA,MACpE;AAOA,eAAS,6BAA6B;AACpC,YAAI,CAAC,eAAe;AAClB;AAAA,QACD;AAED,sBAAc,YAAY,oBAAoB,oBAAoB;AAClE,wBAAgB;AAChB,4BAAoB;AAAA,MACtB;AAOA,eAAS,qBAAqB,aAAa;AACzC,YAAI,YAAY,iBAAiB,SAAS;AACxC;AAAA,QACD;AAED,YAAI,sBAAsB,iBAAiB,GAAG;AAC5C,oCAA0B,WAAW;AAAA,QACtC;AAAA,MACH;AAEA,eAAS,kCAAkC,cAAc,QAAQ,YAAY;AAC3E,YAAI,iBAAiB,WAAW;AAW9B;AACA,sCAA4B,QAAQ,UAAU;AAAA,QAClD,WAAa,iBAAiB,YAAY;AACtC;QACD;AAAA,MACH;AAGA,eAAS,mCAAmC,cAAc,YAAY;AACpE,YAAI,iBAAiB,qBAAqB,iBAAiB,WAAW,iBAAiB,WAAW;AAWhG,iBAAO,sBAAsB,iBAAiB;AAAA,QAC/C;AAAA,MACH;AAMA,eAAS,oBAAoB,MAAM;AAIjC,YAAI,WAAW,KAAK;AACpB,eAAO,YAAY,SAAS,YAAW,MAAO,YAAY,KAAK,SAAS,cAAc,KAAK,SAAS;AAAA,MACtG;AAEA,eAAS,2BAA2B,cAAc,YAAY;AAC5D,YAAI,iBAAiB,SAAS;AAC5B,iBAAO,sBAAsB,UAAU;AAAA,QACxC;AAAA,MACH;AAEA,eAAS,mCAAmC,cAAc,YAAY;AACpE,YAAI,iBAAiB,WAAW,iBAAiB,UAAU;AACzD,iBAAO,sBAAsB,UAAU;AAAA,QACxC;AAAA,MACH;AAEA,eAAS,0BAA0B,MAAM;AACvC,YAAI,QAAQ,KAAK;AAEjB,YAAI,CAAC,SAAS,CAAC,MAAM,cAAc,KAAK,SAAS,UAAU;AACzD;AAAA,QACD;AAED;AAEE,0BAAgB,MAAM,UAAU,KAAK,KAAK;AAAA,QAC3C;AAAA,MACH;AAaA,eAAS,gBAAgB,eAAe,cAAc,YAAY,aAAa,mBAAmB,kBAAkB,iBAAiB;AACnI,YAAI,aAAa,aAAa,oBAAoB,UAAU,IAAI;AAChE,YAAI,mBAAmB;AAEvB,YAAI,qBAAqB,UAAU,GAAG;AACpC,8BAAoB;AAAA,QACxB,WAAa,mBAAmB,UAAU,GAAG;AACzC,cAAI,uBAAuB;AACzB,gCAAoB;AAAA,UAC1B,OAAW;AACL,gCAAoB;AACpB,8BAAkB;AAAA,UACnB;AAAA,QACL,WAAa,oBAAoB,UAAU,GAAG;AAC1C,8BAAoB;AAAA,QACrB;AAED,YAAI,mBAAmB;AACrB,cAAI,OAAO,kBAAkB,cAAc,UAAU;AAErD,cAAI,MAAM;AACR,2CAA+B,eAAe,MAAM,aAAa,iBAAiB;AAClF;AAAA,UACD;AAAA,QACF;AAED,YAAI,iBAAiB;AACnB,0BAAgB,cAAc,YAAY,UAAU;AAAA,QACrD;AAGD,YAAI,iBAAiB,YAAY;AAC/B,oCAA0B,UAAU;AAAA,QACrC;AAAA,MACH;AAEA,eAAS,mBAAmB;AAC1B,4BAAoB,gBAAgB,CAAC,YAAY,WAAW,CAAC;AAC7D,4BAAoB,gBAAgB,CAAC,YAAY,WAAW,CAAC;AAC7D,4BAAoB,kBAAkB,CAAC,cAAc,aAAa,CAAC;AACnE,4BAAoB,kBAAkB,CAAC,cAAc,aAAa,CAAC;AAAA,MACrE;AAUA,eAAS,gBAAgB,eAAe,cAAc,YAAY,aAAa,mBAAmB,kBAAkB,iBAAiB;AACnI,YAAI,cAAc,iBAAiB,eAAe,iBAAiB;AACnE,YAAI,aAAa,iBAAiB,cAAc,iBAAiB;AAEjE,YAAI,eAAe,CAAC,iBAAiB,WAAW,GAAG;AAKjD,cAAI,UAAU,YAAY,iBAAiB,YAAY;AAEvD,cAAI,SAAS;AAGX,gBAAI,2BAA2B,OAAO,KAAK,wBAAwB,OAAO,GAAG;AAC3E;AAAA,YACD;AAAA,UACF;AAAA,QACF;AAED,YAAI,CAAC,cAAc,CAAC,aAAa;AAE/B;AAAA,QACD;AAED,YAAI;AAEJ,YAAI,kBAAkB,WAAW,mBAAmB;AAElD,gBAAM;AAAA,QACV,OAAS;AAEL,cAAI3D,OAAM,kBAAkB;AAE5B,cAAIA,MAAK;AACP,kBAAMA,KAAI,eAAeA,KAAI;AAAA,UACnC,OAAW;AACL,kBAAM;AAAA,UACP;AAAA,QACF;AAED,YAAI;AACJ,YAAI;AAEJ,YAAI,YAAY;AACd,cAAI,WAAW,YAAY,iBAAiB,YAAY;AAExD,iBAAO;AACP,eAAK,WAAW,2BAA2B,QAAQ,IAAI;AAEvD,cAAI,OAAO,MAAM;AACf,gBAAI,iBAAiB,uBAAuB,EAAE;AAE9C,gBAAI,OAAO,kBAAkB,GAAG,QAAQ,iBAAiB,GAAG,QAAQ,UAAU;AAC5E,mBAAK;AAAA,YACN;AAAA,UACF;AAAA,QACL,OAAS;AAEL,iBAAO;AACP,eAAK;AAAA,QACN;AAED,YAAI,SAAS,IAAI;AAEf;AAAA,QACD;AAED,YAAI,qBAAqB;AACzB,YAAI,iBAAiB;AACrB,YAAI,iBAAiB;AACrB,YAAI,kBAAkB;AAEtB,YAAI,iBAAiB,gBAAgB,iBAAiB,eAAe;AACnE,+BAAqB;AACrB,2BAAiB;AACjB,2BAAiB;AACjB,4BAAkB;AAAA,QACnB;AAED,YAAI,WAAW,QAAQ,OAAO,MAAM,oBAAoB,IAAI;AAC5D,YAAI,SAAS,MAAM,OAAO,MAAM,oBAAoB,EAAE;AACtD,YAAI,QAAQ,IAAI,mBAAmB,gBAAgB,kBAAkB,SAAS,MAAM,aAAa,iBAAiB;AAClH,cAAM,SAAS;AACf,cAAM,gBAAgB;AACtB,YAAI,QAAQ;AAGZ,YAAI,mBAAmB,2BAA2B,iBAAiB;AAEnE,YAAI,qBAAqB,YAAY;AACnC,cAAI,aAAa,IAAI,mBAAmB,gBAAgB,kBAAkB,SAAS,IAAI,aAAa,iBAAiB;AACrH,qBAAW,SAAS;AACpB,qBAAW,gBAAgB;AAC3B,kBAAQ;AAAA,QACT;AAED,8CAAsC,eAAe,OAAO,OAAO,MAAM,EAAE;AAAA,MAC7E;AAMA,eAAS,GAAG3D,IAAGuE,IAAG;AAChB,eAAOvE,OAAMuE,OAAMvE,OAAM,KAAK,IAAIA,OAAM,IAAIuE,OAAMvE,OAAMA,MAAKuE,OAAMA;AAAA,MAErE;AAEA,UAAI,WAAW,OAAO,OAAO,OAAO,aAAa,OAAO,KAAK;AAQ7D,eAAS,aAAa,MAAM,MAAM;AAChC,YAAI,SAAS,MAAM,IAAI,GAAG;AACxB,iBAAO;AAAA,QACR;AAED,YAAI,OAAO,SAAS,YAAY,SAAS,QAAQ,OAAO,SAAS,YAAY,SAAS,MAAM;AAC1F,iBAAO;AAAA,QACR;AAED,YAAI,QAAQ,OAAO,KAAK,IAAI;AAC5B,YAAI,QAAQ,OAAO,KAAK,IAAI;AAE5B,YAAI,MAAM,WAAW,MAAM,QAAQ;AACjC,iBAAO;AAAA,QACR;AAGD,iBAASrE,KAAI,GAAGA,KAAI,MAAM,QAAQA,MAAK;AACrC,cAAI,aAAa,MAAMA,EAAC;AAExB,cAAI,CAAC,eAAe,KAAK,MAAM,UAAU,KAAK,CAAC,SAAS,KAAK,UAAU,GAAG,KAAK,UAAU,CAAC,GAAG;AAC3F,mBAAO;AAAA,UACR;AAAA,QACF;AAED,eAAO;AAAA,MACT;AASA,eAAS,YAAY,MAAM;AACzB,eAAO,QAAQ,KAAK,YAAY;AAC9B,iBAAO,KAAK;AAAA,QACb;AAED,eAAO;AAAA,MACT;AAUA,eAAS,eAAe,MAAM;AAC5B,eAAO,MAAM;AACX,cAAI,KAAK,aAAa;AACpB,mBAAO,KAAK;AAAA,UACb;AAED,iBAAO,KAAK;AAAA,QACb;AAAA,MACH;AAUA,eAAS,0BAA0BoH,OAAM,QAAQ;AAC/C,YAAI,OAAO,YAAYA,KAAI;AAC3B,YAAI,YAAY;AAChB,YAAI,UAAU;AAEd,eAAO,MAAM;AACX,cAAI,KAAK,aAAa,WAAW;AAC/B,sBAAU,YAAY,KAAK,YAAY;AAEvC,gBAAI,aAAa,UAAU,WAAW,QAAQ;AAC5C,qBAAO;AAAA,gBACL;AAAA,gBACA,QAAQ,SAAS;AAAA,cAC3B;AAAA,YACO;AAED,wBAAY;AAAA,UACb;AAED,iBAAO,YAAY,eAAe,IAAI,CAAC;AAAA,QACxC;AAAA,MACH;AAOA,eAAS,WAAW,WAAW;AAC7B,YAAI,gBAAgB,UAAU;AAC9B,YAAI,MAAM,iBAAiB,cAAc,eAAe;AACxD,YAAI,YAAY,IAAI,gBAAgB,IAAI,aAAY;AAEpD,YAAI,CAAC,aAAa,UAAU,eAAe,GAAG;AAC5C,iBAAO;AAAA,QACR;AAED,YAAI,aAAa,UAAU,YACvB,eAAe,UAAU,cACzB,YAAY,UAAU,WACtB,cAAc,UAAU;AAQ5B,YAAI;AAEF,qBAAW;AACX,oBAAU;AAAA,QAEX,SAAQvH,IAAG;AACV,iBAAO;AAAA,QACR;AAED,eAAO,2BAA2B,WAAW,YAAY,cAAc,WAAW,WAAW;AAAA,MAC/F;AAWA,eAAS,2BAA2B,WAAW,YAAY,cAAc,WAAW,aAAa;AAC/F,YAAI,SAAS;AACb,YAAI,QAAQ;AACZ,YAAI,MAAM;AACV,YAAI,oBAAoB;AACxB,YAAI,mBAAmB;AACvB,YAAI,OAAO;AACX,YAAI,aAAa;AAEjB;AAAO,iBAAO,MAAM;AAClB,gBAAI,OAAO;AAEX,mBAAO,MAAM;AACX,kBAAI,SAAS,eAAe,iBAAiB,KAAK,KAAK,aAAa,YAAY;AAC9E,wBAAQ,SAAS;AAAA,cAClB;AAED,kBAAI,SAAS,cAAc,gBAAgB,KAAK,KAAK,aAAa,YAAY;AAC5E,sBAAM,SAAS;AAAA,cAChB;AAED,kBAAI,KAAK,aAAa,WAAW;AAC/B,0BAAU,KAAK,UAAU;AAAA,cAC1B;AAED,mBAAK,OAAO,KAAK,gBAAgB,MAAM;AACrC;AAAA,cACD;AAGD,2BAAa;AACb,qBAAO;AAAA,YACR;AAED,mBAAO,MAAM;AACX,kBAAI,SAAS,WAAW;AAKtB,sBAAM;AAAA,cACP;AAED,kBAAI,eAAe,cAAc,EAAE,sBAAsB,cAAc;AACrE,wBAAQ;AAAA,cACT;AAED,kBAAI,eAAe,aAAa,EAAE,qBAAqB,aAAa;AAClE,sBAAM;AAAA,cACP;AAED,mBAAK,OAAO,KAAK,iBAAiB,MAAM;AACtC;AAAA,cACD;AAED,qBAAO;AACP,2BAAa,KAAK;AAAA,YACnB;AAGD,mBAAO;AAAA,UACR;AAED,YAAI,UAAU,MAAM,QAAQ,IAAI;AAG9B,iBAAO;AAAA,QACR;AAED,eAAO;AAAA,UACL;AAAA,UACA;AAAA,QACJ;AAAA,MACA;AAcA,eAAS,WAAW,MAAM,SAAS;AACjC,YAAI4D,OAAM,KAAK,iBAAiB;AAChC,YAAI,MAAMA,QAAOA,KAAI,eAAe;AAIpC,YAAI,CAAC,IAAI,cAAc;AACrB;AAAA,QACD;AAED,YAAI,YAAY,IAAI;AACpB,YAAI,SAAS,KAAK,YAAY;AAC9B,YAAI,QAAQ,KAAK,IAAI,QAAQ,OAAO,MAAM;AAC1C,YAAI,MAAM,QAAQ,QAAQ,SAAY,QAAQ,KAAK,IAAI,QAAQ,KAAK,MAAM;AAG1E,YAAI,CAAC,UAAU,UAAU,QAAQ,KAAK;AACpC,cAAI,OAAO;AACX,gBAAM;AACN,kBAAQ;AAAA,QACT;AAED,YAAI,cAAc,0BAA0B,MAAM,KAAK;AACvD,YAAI,YAAY,0BAA0B,MAAM,GAAG;AAEnD,YAAI,eAAe,WAAW;AAC5B,cAAI,UAAU,eAAe,KAAK,UAAU,eAAe,YAAY,QAAQ,UAAU,iBAAiB,YAAY,UAAU,UAAU,cAAc,UAAU,QAAQ,UAAU,gBAAgB,UAAU,QAAQ;AACpN;AAAA,UACD;AAED,cAAI,QAAQA,KAAI;AAChB,gBAAM,SAAS,YAAY,MAAM,YAAY,MAAM;AACnD,oBAAU,gBAAe;AAEzB,cAAI,QAAQ,KAAK;AACf,sBAAU,SAAS,KAAK;AACxB,sBAAU,OAAO,UAAU,MAAM,UAAU,MAAM;AAAA,UACvD,OAAW;AACL,kBAAM,OAAO,UAAU,MAAM,UAAU,MAAM;AAC7C,sBAAU,SAAS,KAAK;AAAA,UACzB;AAAA,QACF;AAAA,MACH;AAEA,eAAS,WAAW,MAAM;AACxB,eAAO,QAAQ,KAAK,aAAa;AAAA,MACnC;AAEA,eAAS,aAAa,WAAW,WAAW;AAC1C,YAAI,CAAC,aAAa,CAAC,WAAW;AAC5B,iBAAO;AAAA,QACX,WAAa,cAAc,WAAW;AAClC,iBAAO;AAAA,QACX,WAAa,WAAW,SAAS,GAAG;AAChC,iBAAO;AAAA,QACX,WAAa,WAAW,SAAS,GAAG;AAChC,iBAAO,aAAa,WAAW,UAAU,UAAU;AAAA,QACvD,WAAa,cAAc,WAAW;AAClC,iBAAO,UAAU,SAAS,SAAS;AAAA,QACvC,WAAa,UAAU,yBAAyB;AAC5C,iBAAO,CAAC,EAAE,UAAU,wBAAwB,SAAS,IAAI;AAAA,QAC7D,OAAS;AACL,iBAAO;AAAA,QACR;AAAA,MACH;AAEA,eAAS,aAAa,MAAM;AAC1B,eAAO,QAAQ,KAAK,iBAAiB,aAAa,KAAK,cAAc,iBAAiB,IAAI;AAAA,MAC5F;AAEA,eAAS,kBAAkB,QAAQ;AACjC,YAAI;AAQF,iBAAO,OAAO,OAAO,cAAc,SAAS,SAAS;AAAA,QACtD,SAAQ,KAAK;AACZ,iBAAO;AAAA,QACR;AAAA,MACH;AAEA,eAAS,uBAAuB;AAC9B,YAAI,MAAM;AACV,YAAI,UAAU;AAEd,eAAO,mBAAmB,IAAI,mBAAmB;AAC/C,cAAI,kBAAkB,OAAO,GAAG;AAC9B,kBAAM,QAAQ;AAAA,UACpB,OAAW;AACL,mBAAO;AAAA,UACR;AAED,oBAAU,iBAAiB,IAAI,QAAQ;AAAA,QACxC;AAED,eAAO;AAAA,MACT;AAeA,eAAS,yBAAyB,MAAM;AACtC,YAAI,WAAW,QAAQ,KAAK,YAAY,KAAK,SAAS;AACtD,eAAO,aAAa,aAAa,YAAY,KAAK,SAAS,UAAU,KAAK,SAAS,YAAY,KAAK,SAAS,SAAS,KAAK,SAAS,SAAS,KAAK,SAAS,eAAe,aAAa,cAAc,KAAK,oBAAoB;AAAA,MAChO;AACA,eAAS,0BAA0B;AACjC,YAAI,cAAc;AAClB,eAAO;AAAA,UACL;AAAA,UACA,gBAAgB,yBAAyB,WAAW,IAAI8D,cAAa,WAAW,IAAI;AAAA,QACxF;AAAA,MACA;AAOA,eAAS,iBAAiB,2BAA2B;AACnD,YAAI,iBAAiB;AACrB,YAAI,mBAAmB,0BAA0B;AACjD,YAAI,sBAAsB,0BAA0B;AAEpD,YAAI,mBAAmB,oBAAoB,aAAa,gBAAgB,GAAG;AACzE,cAAI,wBAAwB,QAAQ,yBAAyB,gBAAgB,GAAG;AAC9E,yBAAa,kBAAkB,mBAAmB;AAAA,UACnD;AAGD,cAAI,YAAY,CAAA;AAChB,cAAI,WAAW;AAEf,iBAAO,WAAW,SAAS,YAAY;AACrC,gBAAI,SAAS,aAAa,cAAc;AACtC,wBAAU,KAAK;AAAA,gBACb,SAAS;AAAA,gBACT,MAAM,SAAS;AAAA,gBACf,KAAK,SAAS;AAAA,cACxB,CAAS;AAAA,YACF;AAAA,UACF;AAED,cAAI,OAAO,iBAAiB,UAAU,YAAY;AAChD,6BAAiB,MAAK;AAAA,UACvB;AAED,mBAASvH,KAAI,GAAGA,KAAI,UAAU,QAAQA,MAAK;AACzC,gBAAI,OAAO,UAAUA,EAAC;AACtB,iBAAK,QAAQ,aAAa,KAAK;AAC/B,iBAAK,QAAQ,YAAY,KAAK;AAAA,UAC/B;AAAA,QACF;AAAA,MACH;AAQA,eAASuH,cAAa,OAAO;AAC3B,YAAI;AAEJ,YAAI,oBAAoB,OAAO;AAE7B,sBAAY;AAAA,YACV,OAAO,MAAM;AAAA,YACb,KAAK,MAAM;AAAA,UACjB;AAAA,QACA,OAAS;AAEL,sBAAY,WAAW,KAAK;AAAA,QAC7B;AAED,eAAO,aAAa;AAAA,UAClB,OAAO;AAAA,UACP,KAAK;AAAA,QACT;AAAA,MACA;AAQA,eAAS,aAAa,OAAO,SAAS;AACpC,YAAI,QAAQ,QAAQ;AACpB,YAAI,MAAM,QAAQ;AAElB,YAAI,QAAQ,QAAW;AACrB,gBAAM;AAAA,QACP;AAED,YAAI,oBAAoB,OAAO;AAC7B,gBAAM,iBAAiB;AACvB,gBAAM,eAAe,KAAK,IAAI,KAAK,MAAM,MAAM,MAAM;AAAA,QACzD,OAAS;AACL,qBAAW,OAAO,OAAO;AAAA,QAC1B;AAAA,MACH;AAEA,UAAI,2BAA2B,aAAa,kBAAkB,YAAY,SAAS,gBAAgB;AAEnG,eAAS,mBAAmB;AAC1B,8BAAsB,YAAY,CAAC,YAAY,eAAe,WAAW,WAAW,WAAW,SAAS,aAAa,WAAW,iBAAiB,CAAC;AAAA,MACpJ;AAEA,UAAI,kBAAkB;AACtB,UAAI,sBAAsB;AAC1B,UAAI,gBAAgB;AACpB,UAAI,YAAY;AAQhB,eAAS,eAAe,MAAM;AAC5B,YAAI,oBAAoB,QAAQ,yBAAyB,IAAI,GAAG;AAC9D,iBAAO;AAAA,YACL,OAAO,KAAK;AAAA,YACZ,KAAK,KAAK;AAAA,UAChB;AAAA,QACA,OAAS;AACL,cAAI,MAAM,KAAK,iBAAiB,KAAK,cAAc,eAAe;AAClE,cAAI,YAAY,IAAI;AACpB,iBAAO;AAAA,YACL,YAAY,UAAU;AAAA,YACtB,cAAc,UAAU;AAAA,YACxB,WAAW,UAAU;AAAA,YACrB,aAAa,UAAU;AAAA,UAC7B;AAAA,QACG;AAAA,MACH;AAMA,eAAS,uBAAuB,aAAa;AAC3C,eAAO,YAAY,WAAW,cAAc,YAAY,WAAW,YAAY,aAAa,gBAAgB,cAAc,YAAY;AAAA,MACxI;AAUA,eAAS,qBAAqB,eAAe,aAAa,mBAAmB;AAK3E,YAAI9D,OAAM,uBAAuB,iBAAiB;AAElD,YAAI,aAAa,mBAAmB,QAAQ,oBAAoB,iBAAiBA,IAAG,GAAG;AACrF;AAAA,QACD;AAGD,YAAI,mBAAmB,eAAe,eAAe;AAErD,YAAI,CAAC,iBAAiB,CAAC,aAAa,eAAe,gBAAgB,GAAG;AACpE,0BAAgB;AAChB,cAAI,YAAY,4BAA4B,qBAAqB,UAAU;AAE3E,cAAI,UAAU,SAAS,GAAG;AACxB,gBAAI,QAAQ,IAAI,eAAe,YAAY,UAAU,MAAM,aAAa,iBAAiB;AACzF,0BAAc,KAAK;AAAA,cACjB;AAAA,cACA;AAAA,YACR,CAAO;AACD,kBAAM,SAAS;AAAA,UAChB;AAAA,QACF;AAAA,MACH;AAiBA,eAAS,gBAAgB,eAAe,cAAc,YAAY,aAAa,mBAAmB,kBAAkB,iBAAiB;AACnI,YAAI,aAAa,aAAa,oBAAoB,UAAU,IAAI;AAEhE,gBAAQ,cAAY;AAAA,UAElB,KAAK;AACH,gBAAI,mBAAmB,UAAU,KAAK,WAAW,oBAAoB,QAAQ;AAC3E,gCAAkB;AAClB,oCAAsB;AACtB,8BAAgB;AAAA,YACjB;AAED;AAAA,UAEF,KAAK;AACH,8BAAkB;AAClB,kCAAsB;AACtB,4BAAgB;AAChB;AAAA,UAIF,KAAK;AACH,wBAAY;AACZ;AAAA,UAEF,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AACH,wBAAY;AACZ,iCAAqB,eAAe,aAAa,iBAAiB;AAClE;AAAA,UAWF,KAAK;AACH,gBAAI,0BAA0B;AAC5B;AAAA,YACD;AAAA,UAIH,KAAK;AAAA,UACL,KAAK;AACH,iCAAqB,eAAe,aAAa,iBAAiB;AAAA,QACrE;AAAA,MACH;AAUA,eAAS,cAAc,WAAW,WAAW;AAC3C,YAAI+D,YAAW,CAAA;AACf,QAAAA,UAAS,UAAU,YAAW,CAAE,IAAI,UAAU,YAAW;AACzD,QAAAA,UAAS,WAAW,SAAS,IAAI,WAAW;AAC5C,QAAAA,UAAS,QAAQ,SAAS,IAAI,QAAQ;AACtC,eAAOA;AAAA,MACT;AAMA,UAAI,iBAAiB;AAAA,QACnB,cAAc,cAAc,aAAa,cAAc;AAAA,QACvD,oBAAoB,cAAc,aAAa,oBAAoB;AAAA,QACnE,gBAAgB,cAAc,aAAa,gBAAgB;AAAA,QAC3D,eAAe,cAAc,cAAc,eAAe;AAAA,MAC5D;AAKA,UAAI,qBAAqB,CAAA;AAKzB,UAAI,QAAQ,CAAA;AAKZ,UAAI,WAAW;AACb,gBAAQ,SAAS,cAAc,KAAK,EAAE;AAKtC,YAAI,EAAE,oBAAoB,SAAS;AACjC,iBAAO,eAAe,aAAa;AACnC,iBAAO,eAAe,mBAAmB;AACzC,iBAAO,eAAe,eAAe;AAAA,QACtC;AAGD,YAAI,EAAE,qBAAqB,SAAS;AAClC,iBAAO,eAAe,cAAc;AAAA,QACrC;AAAA,MACH;AASA,eAAS,2BAA2B,WAAW;AAC7C,YAAI,mBAAmB,SAAS,GAAG;AACjC,iBAAO,mBAAmB,SAAS;AAAA,QACvC,WAAa,CAAC,eAAe,SAAS,GAAG;AACrC,iBAAO;AAAA,QACR;AAED,YAAI,YAAY,eAAe,SAAS;AAExC,iBAAS,aAAa,WAAW;AAC/B,cAAI,UAAU,eAAe,SAAS,KAAK,aAAa,OAAO;AAC7D,mBAAO,mBAAmB,SAAS,IAAI,UAAU,SAAS;AAAA,UAC3D;AAAA,QACF;AAED,eAAO;AAAA,MACT;AAEA,UAAI,gBAAgB,2BAA2B,cAAc;AAC7D,UAAI,sBAAsB,2BAA2B,oBAAoB;AACzE,UAAI,kBAAkB,2BAA2B,gBAAgB;AACjE,UAAI,iBAAiB,2BAA2B,eAAe;AAE/D,UAAI,6BAA6B,oBAAI;AAUrC,UAAI,0BAA0B,CAAC,SAAS,YAAY,UAAU,WAAW,kBAAkB,SAAS,SAAS,eAAe,QAAQ,OAAO,QAAQ,WAAW,aAAa,YAAY,aAAa,YAAY,aAAa,QAAQ,kBAAkB,WAAW,aAAa,SAAS,SAAS,qBAAqB,SAAS,WAAW,WAAW,YAAY,SAAS,QAAQ,cAAc,kBAAkB,aAAa,sBAAsB,aAAa,aAAa,YAAY,aAAa,WAAW,SAAS,SAAS,QAAQ,WAAW,iBAAiB,eAAe,eAAe,cAAc,eAAe,aAAa,YAAY,cAAc,SAAS,UAAU,UAAU,WAAW,WAAW,UAAU,WAAW,cAAc,eAAe,YAAY,cAAc,gBAAgB,UAAU,UAAU,aAAa,WAAW,OAAO;AAE70B,eAAS,oBAAoB,cAAc,WAAW;AACpD,mCAA2B,IAAI,cAAc,SAAS;AACtD,8BAAsB,WAAW,CAAC,YAAY,CAAC;AAAA,MACjD;AAEA,eAAS,uBAAuB;AAC9B,iBAASxH,KAAI,GAAGA,KAAI,wBAAwB,QAAQA,MAAK;AACvD,cAAI,YAAY,wBAAwBA,EAAC;AACzC,cAAI,eAAe,UAAU;AAC7B,cAAI,mBAAmB,UAAU,CAAC,EAAE,YAAW,IAAK,UAAU,MAAM,CAAC;AACrE,8BAAoB,cAAc,OAAO,gBAAgB;AAAA,QAC1D;AAGD,4BAAoB,eAAe,gBAAgB;AACnD,4BAAoB,qBAAqB,sBAAsB;AAC/D,4BAAoB,iBAAiB,kBAAkB;AACvD,4BAAoB,YAAY,eAAe;AAC/C,4BAAoB,WAAW,SAAS;AACxC,4BAAoB,YAAY,QAAQ;AACxC,4BAAoB,gBAAgB,iBAAiB;AAAA,MACvD;AAEA,eAAS,gBAAgB,eAAe,cAAc,YAAY,aAAa,mBAAmB,kBAAkB,iBAAiB;AACnI,YAAI,YAAY,2BAA2B,IAAI,YAAY;AAE3D,YAAI,cAAc,QAAW;AAC3B;AAAA,QACD;AAED,YAAI,qBAAqB;AACzB,YAAI,iBAAiB;AAErB,gBAAQ,cAAY;AAAA,UAClB,KAAK;AAIH,gBAAI,iBAAiB,WAAW,MAAM,GAAG;AACvC;AAAA,YACD;AAAA,UAIH,KAAK;AAAA,UACL,KAAK;AACH,iCAAqB;AACrB;AAAA,UAEF,KAAK;AACH,6BAAiB;AACjB,iCAAqB;AACrB;AAAA,UAEF,KAAK;AACH,6BAAiB;AACjB,iCAAqB;AACrB;AAAA,UAEF,KAAK;AAAA,UACL,KAAK;AACH,iCAAqB;AACrB;AAAA,UAEF,KAAK;AAGH,gBAAI,YAAY,WAAW,GAAG;AAC5B;AAAA,YACD;AAAA,UAIH,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UAIL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AACH,iCAAqB;AACrB;AAAA,UAEF,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AACH,iCAAqB;AACrB;AAAA,UAEF,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AACH,iCAAqB;AACrB;AAAA,UAEF,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AACH,iCAAqB;AACrB;AAAA,UAEF,KAAK;AACH,iCAAqB;AACrB;AAAA,UAEF,KAAK;AACH,iCAAqB;AACrB;AAAA,UAEF,KAAK;AACH,iCAAqB;AACrB;AAAA,UAEF,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AACH,iCAAqB;AACrB;AAAA,UAEF,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AACH,iCAAqB;AACrB;AAAA,QACH;AAED,YAAI,kBAAkB,mBAAmB,sBAAsB;AAE/D;AAKE,cAAI,uBAAuB,CAAC;AAAA;AAAA;AAAA;AAAA,UAI5B,iBAAiB;AAEjB,cAAI,aAAa,+BAA+B,YAAY,WAAW,YAAY,MAAM,gBAAgB,oBAAoB;AAE7H,cAAI,WAAW,SAAS,GAAG;AAEzB,gBAAI,SAAS,IAAI,mBAAmB,WAAW,gBAAgB,MAAM,aAAa,iBAAiB;AAEnG,0BAAc,KAAK;AAAA,cACjB,OAAO;AAAA,cACP,WAAW;AAAA,YACnB,CAAO;AAAA,UACF;AAAA,QACF;AAAA,MACH;AAGA;AACA;AACA;AACA;AACA;AAEA,eAAS,gBAAgB,eAAe,cAAc,YAAY,aAAa,mBAAmB,kBAAkB,iBAAiB;AAOnI,wBAAgB,eAAe,cAAc,YAAY,aAAa,mBAAmB,gBAAgB;AACzG,YAAI,gCAAgC,mBAAmB,+CAA+C;AAkBtG,YAAI,8BAA8B;AAChC,0BAAgB,eAAe,cAAc,YAAY,aAAa,iBAAiB;AACvF,0BAAgB,eAAe,cAAc,YAAY,aAAa,iBAAiB;AACvF,0BAAgB,eAAe,cAAc,YAAY,aAAa,iBAAiB;AACvF,wBAAc,eAAe,cAAc,YAAY,aAAa,iBAAiB;AAAA,QACtF;AAAA,MACH;AAGA,UAAI,kBAAkB,CAAC,SAAS,WAAW,kBAAkB,kBAAkB,WAAW,aAAa,SAAS,SAAS,cAAc,kBAAkB,aAAa,SAAS,QAAQ,WAAW,YAAY,cAAc,UAAU,UAAU,WAAW,WAAW,WAAW,cAAc,gBAAgB,SAAS;AAIxT,UAAI,qBAAqB,IAAI,IAAI,CAAC,UAAU,SAAS,WAAW,QAAQ,UAAU,QAAQ,EAAE,OAAO,eAAe,CAAC;AAEnH,eAAS,gBAAgB,OAAO,UAAU,eAAe;AACvD,YAAI,OAAO,MAAM,QAAQ;AACzB,cAAM,gBAAgB;AACtB,gDAAwC,MAAM,UAAU,QAAW,KAAK;AACxE,cAAM,gBAAgB;AAAA,MACxB;AAEA,eAAS,iCAAiC,OAAO,mBAAmB,gBAAgB;AAClF,YAAI;AAEJ,YAAI,gBAAgB;AAClB,mBAASA,KAAI,kBAAkB,SAAS,GAAGA,MAAK,GAAGA,MAAK;AACtD,gBAAI,uBAAuB,kBAAkBA,EAAC,GAC1C,WAAW,qBAAqB,UAChC,gBAAgB,qBAAqB,eACrC,WAAW,qBAAqB;AAEpC,gBAAI,aAAa,oBAAoB,MAAM,qBAAoB,GAAI;AACjE;AAAA,YACD;AAED,4BAAgB,OAAO,UAAU,aAAa;AAC9C,+BAAmB;AAAA,UACpB;AAAA,QACL,OAAS;AACL,mBAAS,KAAK,GAAG,KAAK,kBAAkB,QAAQ,MAAM;AACpD,gBAAI,wBAAwB,kBAAkB,EAAE,GAC5C,YAAY,sBAAsB,UAClC,iBAAiB,sBAAsB,eACvC,YAAY,sBAAsB;AAEtC,gBAAI,cAAc,oBAAoB,MAAM,qBAAoB,GAAI;AAClE;AAAA,YACD;AAED,4BAAgB,OAAO,WAAW,cAAc;AAChD,+BAAmB;AAAA,UACpB;AAAA,QACF;AAAA,MACH;AAEA,eAAS,qBAAqB,eAAe,kBAAkB;AAC7D,YAAI,kBAAkB,mBAAmB,sBAAsB;AAE/D,iBAASA,KAAI,GAAGA,KAAI,cAAc,QAAQA,MAAK;AAC7C,cAAI,mBAAmB,cAAcA,EAAC,GAClC,QAAQ,iBAAiB,OACzB,YAAY,iBAAiB;AACjC,2CAAiC,OAAO,WAAW,cAAc;AAAA,QAClE;AAGD;MACF;AAEA,eAAS,yBAAyB,cAAc,kBAAkB,aAAa,YAAY,iBAAiB;AAC1G,YAAI,oBAAoB,eAAe,WAAW;AAClD,YAAI,gBAAgB,CAAA;AACpB,wBAAgB,eAAe,cAAc,YAAY,aAAa,mBAAmB,gBAAgB;AACzG,6BAAqB,eAAe,gBAAgB;AAAA,MACtD;AAEA,eAAS,0BAA0B,cAAc,eAAe;AAC9D;AACE,cAAI,CAAC,mBAAmB,IAAI,YAAY,GAAG;AACzC,kBAAM,6GAAkH,YAAY;AAAA,UACrI;AAAA,QACF;AAED,YAAI,yBAAyB;AAC7B,YAAI,cAAc,oBAAoB,aAAa;AACnD,YAAI,iBAAiB,kBAAkB,cAAc,sBAAsB;AAE3E,YAAI,CAAC,YAAY,IAAI,cAAc,GAAG;AACpC,kCAAwB,eAAe,cAAc,kBAAkB,sBAAsB;AAC7F,sBAAY,IAAI,cAAc;AAAA,QAC/B;AAAA,MACH;AACA,eAAS,oBAAoB,cAAc,wBAAwB,QAAQ;AACzE;AACE,cAAI,mBAAmB,IAAI,YAAY,KAAK,CAAC,wBAAwB;AACnE,kBAAM,2HAAgI,YAAY;AAAA,UACnJ;AAAA,QACF;AAED,YAAI,mBAAmB;AAEvB,YAAI,wBAAwB;AAC1B,8BAAoB;AAAA,QACrB;AAED,gCAAwB,QAAQ,cAAc,kBAAkB,sBAAsB;AAAA,MACxF;AACA,UAAI,kBAAkB,oBAAoB,KAAK,OAAQ,EAAC,SAAS,EAAE,EAAE,MAAM,CAAC;AAC5E,eAAS,2BAA2B,sBAAsB;AACxD,YAAI,CAAC,qBAAqB,eAAe,GAAG;AAC1C,+BAAqB,eAAe,IAAI;AACxC,0BAAgB,QAAQ,SAAU,cAAc;AAG9C,gBAAI,iBAAiB,mBAAmB;AACtC,kBAAI,CAAC,mBAAmB,IAAI,YAAY,GAAG;AACzC,oCAAoB,cAAc,OAAO,oBAAoB;AAAA,cAC9D;AAED,kCAAoB,cAAc,MAAM,oBAAoB;AAAA,YAC7D;AAAA,UACP,CAAK;AACD,cAAI,gBAAgB,qBAAqB,aAAa,gBAAgB,uBAAuB,qBAAqB;AAElH,cAAI,kBAAkB,MAAM;AAG1B,gBAAI,CAAC,cAAc,eAAe,GAAG;AACnC,4BAAc,eAAe,IAAI;AACjC,kCAAoB,mBAAmB,OAAO,aAAa;AAAA,YAC5D;AAAA,UACF;AAAA,QACF;AAAA,MACH;AAEA,eAAS,wBAAwB,iBAAiB,cAAc,kBAAkB,wBAAwB,sCAAsC;AAC9I,YAAI,WAAW,uCAAuC,iBAAiB,cAAc,gBAAgB;AAGrG,YAAI,oBAAoB;AAExB,YAAI,+BAA+B;AAOjC,cAAI,iBAAiB,gBAAgB,iBAAiB,eAAe,iBAAiB,SAAS;AAC7F,gCAAoB;AAAA,UACrB;AAAA,QACF;AAED,0BAAmB;AAInB,YAAI,wBAAwB;AAC1B,cAAI,sBAAsB,QAAW;AACb,mDAAuC,iBAAiB,cAAc,UAAU,iBAAiB;AAAA,UAC7H,OAAW;AACiB,oCAAwB,iBAAiB,cAAc,QAAQ;AAAA,UACtF;AAAA,QACL,OAAS;AACL,cAAI,sBAAsB,QAAW;AACb,kDAAsC,iBAAiB,cAAc,UAAU,iBAAiB;AAAA,UAC5H,OAAW;AACiB,mCAAuB,iBAAiB,cAAc,QAAQ;AAAA,UACrF;AAAA,QACF;AAAA,MACH;AAEA,eAAS,wBAAwB,gBAAgB,iBAAiB;AAChE,eAAO,mBAAmB,mBAAmB,eAAe,aAAa,gBAAgB,eAAe,eAAe;AAAA,MACzH;AAEA,eAAS,kCAAkC,cAAc,kBAAkB,aAAa,YAAY,iBAAiB;AACnH,YAAI,eAAe;AAEnB,aAAK,mBAAmB,sCAAsC,MAAM,mBAAmB,sBAAsB,GAAG;AAC9G,cAAI,sBAAsB;AAE1B,cAAI,eAAe,MAAM;AAYvB,gBAAI,OAAO;AAEX;AAAU,qBAAO,MAAM;AACrB,oBAAI,SAAS,MAAM;AACjB;AAAA,gBACD;AAED,oBAAI,UAAU,KAAK;AAEnB,oBAAI,YAAY,YAAY,YAAY,YAAY;AAClD,sBAAI,YAAY,KAAK,UAAU;AAE/B,sBAAI,wBAAwB,WAAW,mBAAmB,GAAG;AAC3D;AAAA,kBACD;AAED,sBAAI,YAAY,YAAY;AAK1B,wBAAI,YAAY,KAAK;AAErB,2BAAO,cAAc,MAAM;AACzB,0BAAI,WAAW,UAAU;AAEzB,0BAAI,aAAa,YAAY,aAAa,YAAY;AACpD,4BAAI,iBAAiB,UAAU,UAAU;AAEzC,4BAAI,wBAAwB,gBAAgB,mBAAmB,GAAG;AAIhE;AAAA,wBACD;AAAA,sBACF;AAED,kCAAY,UAAU;AAAA,oBACvB;AAAA,kBACF;AAOD,yBAAO,cAAc,MAAM;AACzB,wBAAI,aAAa,2BAA2B,SAAS;AAErD,wBAAI,eAAe,MAAM;AACvB;AAAA,oBACD;AAED,wBAAI,YAAY,WAAW;AAE3B,wBAAI,cAAc,iBAAiB,cAAc,UAAU;AACzD,6BAAO,eAAe;AACtB,+BAAS;AAAA,oBACV;AAED,gCAAY,UAAU;AAAA,kBACvB;AAAA,gBACF;AAED,uBAAO,KAAK;AAAA,cACb;AAAA,UACF;AAAA,QACF;AAED,uBAAe,WAAY;AACzB,iBAAO,yBAAyB,cAAc,kBAAkB,aAAa,YAAY;AAAA,QAC7F,CAAG;AAAA,MACH;AAEA,eAAS,uBAAuB,UAAU,UAAU,eAAe;AACjE,eAAO;AAAA,UACL;AAAA,UACA;AAAA,UACA;AAAA,QACJ;AAAA,MACA;AAEA,eAAS,+BAA+B,aAAa,WAAW,iBAAiB,gBAAgB,sBAAsB,aAAa;AAClI,YAAI,cAAc,cAAc,OAAO,YAAY,YAAY;AAC/D,YAAI,iBAAiB,iBAAiB,cAAc;AACpD,YAAI,YAAY,CAAA;AAChB,YAAI,WAAW;AACf,YAAI,oBAAoB;AAExB,eAAO,aAAa,MAAM;AACxB,cAAI,aAAa,UACb,YAAY,WAAW,WACvB,MAAM,WAAW;AAErB,cAAI,QAAQ,iBAAiB,cAAc,MAAM;AAC/C,gCAAoB;AAGpB,gBAAI,mBAAmB,MAAM;AAC3B,kBAAI,WAAW,YAAY,UAAU,cAAc;AAEnD,kBAAI,YAAY,MAAM;AACpB,0BAAU,KAAK,uBAAuB,UAAU,UAAU,iBAAiB,CAAC;AAAA,cAC7E;AAAA,YACF;AAAA,UACF;AAKD,cAAI,sBAAsB;AACxB;AAAA,UACD;AAED,qBAAW,SAAS;AAAA,QACrB;AAED,eAAO;AAAA,MACT;AAQA,eAAS,4BAA4B,aAAa,WAAW;AAC3D,YAAI,cAAc,YAAY;AAC9B,YAAI,YAAY,CAAA;AAChB,YAAI,WAAW;AAEf,eAAO,aAAa,MAAM;AACxB,cAAI,aAAa,UACb,YAAY,WAAW,WACvB,MAAM,WAAW;AAErB,cAAI,QAAQ,iBAAiB,cAAc,MAAM;AAC/C,gBAAI,gBAAgB;AACpB,gBAAI,kBAAkB,YAAY,UAAU,WAAW;AAEvD,gBAAI,mBAAmB,MAAM;AAC3B,wBAAU,QAAQ,uBAAuB,UAAU,iBAAiB,aAAa,CAAC;AAAA,YACnF;AAED,gBAAI,iBAAiB,YAAY,UAAU,SAAS;AAEpD,gBAAI,kBAAkB,MAAM;AAC1B,wBAAU,KAAK,uBAAuB,UAAU,gBAAgB,aAAa,CAAC;AAAA,YAC/E;AAAA,UACF;AAED,qBAAW,SAAS;AAAA,QACrB;AAED,eAAO;AAAA,MACT;AAEA,eAAS,UAAU,MAAM;AACvB,YAAI,SAAS,MAAM;AACjB,iBAAO;AAAA,QACR;AAED,WAAG;AACD,iBAAO,KAAK;AAAA,QAKb,SAAQ,QAAQ,KAAK,QAAQ;AAE9B,YAAI,MAAM;AACR,iBAAO;AAAA,QACR;AAED,eAAO;AAAA,MACT;AAOA,eAAS,wBAAwB,OAAO,OAAO;AAC7C,YAAI,QAAQ;AACZ,YAAI,QAAQ;AACZ,YAAI,SAAS;AAEb,iBAAS,QAAQ,OAAO,OAAO,QAAQ,UAAU,KAAK,GAAG;AACvD;AAAA,QACD;AAED,YAAI,SAAS;AAEb,iBAAS,QAAQ,OAAO,OAAO,QAAQ,UAAU,KAAK,GAAG;AACvD;AAAA,QACD;AAGD,eAAO,SAAS,SAAS,GAAG;AAC1B,kBAAQ,UAAU,KAAK;AACvB;AAAA,QACD;AAGD,eAAO,SAAS,SAAS,GAAG;AAC1B,kBAAQ,UAAU,KAAK;AACvB;AAAA,QACD;AAGD,YAAI,QAAQ;AAEZ,eAAO,SAAS;AACd,cAAI,UAAU,SAAS,UAAU,QAAQ,UAAU,MAAM,WAAW;AAClE,mBAAO;AAAA,UACR;AAED,kBAAQ,UAAU,KAAK;AACvB,kBAAQ,UAAU,KAAK;AAAA,QACxB;AAED,eAAO;AAAA,MACT;AAEA,eAAS,sCAAsC,eAAe,OAAO,QAAQ,QAAQ,gBAAgB;AACnG,YAAI,mBAAmB,MAAM;AAC7B,YAAI,YAAY,CAAA;AAChB,YAAI,WAAW;AAEf,eAAO,aAAa,MAAM;AACxB,cAAI,aAAa,QAAQ;AACvB;AAAA,UACD;AAED,cAAI,aAAa,UACb,YAAY,WAAW,WACvB,YAAY,WAAW,WACvB,MAAM,WAAW;AAErB,cAAI,cAAc,QAAQ,cAAc,QAAQ;AAC9C;AAAA,UACD;AAED,cAAI,QAAQ,iBAAiB,cAAc,MAAM;AAC/C,gBAAI,gBAAgB;AAEpB,gBAAI,gBAAgB;AAClB,kBAAI,kBAAkB,YAAY,UAAU,gBAAgB;AAE5D,kBAAI,mBAAmB,MAAM;AAC3B,0BAAU,QAAQ,uBAAuB,UAAU,iBAAiB,aAAa,CAAC;AAAA,cACnF;AAAA,YACT,WAAiB,CAAC,gBAAgB;AAC1B,kBAAI,iBAAiB,YAAY,UAAU,gBAAgB;AAE3D,kBAAI,kBAAkB,MAAM;AAC1B,0BAAU,KAAK,uBAAuB,UAAU,gBAAgB,aAAa,CAAC;AAAA,cAC/E;AAAA,YACF;AAAA,UACF;AAED,qBAAW,SAAS;AAAA,QACrB;AAED,YAAI,UAAU,WAAW,GAAG;AAC1B,wBAAc,KAAK;AAAA,YACjB;AAAA,YACA;AAAA,UACN,CAAK;AAAA,QACF;AAAA,MACH;AAOA,eAAS,sCAAsC,eAAe,YAAY,YAAY,MAAM,IAAI;AAC9F,YAAI,SAAS,QAAQ,KAAK,wBAAwB,MAAM,EAAE,IAAI;AAE9D,YAAI,SAAS,MAAM;AACjB,gDAAsC,eAAe,YAAY,MAAM,QAAQ,KAAK;AAAA,QACrF;AAED,YAAI,OAAO,QAAQ,eAAe,MAAM;AACtC,gDAAsC,eAAe,YAAY,IAAI,QAAQ,IAAI;AAAA,QAClF;AAAA,MACH;AACA,eAAS,kBAAkB,cAAc,SAAS;AAChD,eAAO,eAAe,QAAQ,UAAU,YAAY;AAAA,MACtD;AAEA,UAAI,0BAA0B;AAC9B,UAAI,6BAA6B;AACjC,UAAI,oCAAoC;AACxC,UAAI,6BAA6B;AACjC,UAAI,YAAY;AAChB,UAAI,WAAW;AACf,UAAI,QAAQ;AACZ,UAAI,SAAS;AACb,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AAEJ;AACE,4BAAoB;AAAA;AAAA,UAElB,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAMR,SAAS;AAAA,QACb;AAEE,0CAAkC,SAAU,MAAM,OAAO;AACvD,6BAAmB,MAAM,KAAK;AAC9B,+BAAqB,MAAM,KAAK;AAChC,+BAAqB,MAAM,OAAO;AAAA,YAChC;AAAA,YACA;AAAA,UACN,CAAK;AAAA,QACL;AAUE,0CAAkC,aAAa,CAAC,SAAS;AAEzD,gCAAwB,SAAU,UAAU,aAAa,aAAa;AACpE,cAAI,yBAAyB;AAC3B;AAAA,UACD;AAED,cAAI,wBAAwB,kCAAkC,WAAW;AACzE,cAAI,wBAAwB,kCAAkC,WAAW;AAEzE,cAAI,0BAA0B,uBAAuB;AACnD;AAAA,UACD;AAED,oCAA0B;AAE1B,gBAAM,kDAAkD,UAAU,KAAK,UAAU,qBAAqB,GAAG,KAAK,UAAU,qBAAqB,CAAC;AAAA,QAClJ;AAEE,iCAAyB,SAAU,gBAAgB;AACjD,cAAI,yBAAyB;AAC3B;AAAA,UACD;AAED,oCAA0B;AAC1B,cAAI,QAAQ,CAAA;AACZ,yBAAe,QAAQ,SAAUM,OAAM;AACrC,kBAAM,KAAKA,KAAI;AAAA,UACrB,CAAK;AAED,gBAAM,wCAAwC,KAAK;AAAA,QACvD;AAEE,sCAA8B,SAAU,kBAAkB,UAAU;AAClE,cAAI,aAAa,OAAO;AACtB,kBAAM,wLAAkM,kBAAkB,kBAAkB,gBAAgB;AAAA,UAClQ,OAAW;AACL,kBAAM,8EAA8E,kBAAkB,OAAO,QAAQ;AAAA,UACtH;AAAA,QACL;AAIE,wBAAgB,SAAU,QAAQ,MAAM;AAKtC,cAAI,cAAc,OAAO,iBAAiB,iBAAiB,OAAO,cAAc,cAAc,OAAO,OAAO,IAAI,OAAO,cAAc,gBAAgB,OAAO,cAAc,OAAO,OAAO;AACxL,sBAAY,YAAY;AACxB,iBAAO,YAAY;AAAA,QACvB;AAAA,MACA;AAOA,UAAI,2BAA2B;AAC/B,UAAI,uCAAuC;AAE3C,eAAS,kCAAkC,QAAQ;AACjD;AACE,kCAAwB,MAAM;AAAA,QAC/B;AAED,YAAI,eAAe,OAAO,WAAW,WAAW,SAAS,KAAK;AAC9D,eAAO,aAAa,QAAQ,0BAA0B,IAAI,EAAE,QAAQ,sCAAsC,EAAE;AAAA,MAC9G;AAEA,eAAS,sBAAsB,YAAY,YAAY,kBAAkB,eAAe;AACtF,YAAI,uBAAuB,kCAAkC,UAAU;AACvE,YAAI,uBAAuB,kCAAkC,UAAU;AAEvE,YAAI,yBAAyB,sBAAsB;AACjD;AAAA,QACD;AAED,YAAI,eAAe;AACjB;AACE,gBAAI,CAAC,yBAAyB;AAC5B,wCAA0B;AAE1B,oBAAM,yDAAyD,sBAAsB,oBAAoB;AAAA,YAC1G;AAAA,UACF;AAAA,QACF;AAED,YAAI,oBAAoB,0CAA0C;AAGhE,gBAAM,IAAI,MAAM,mDAAmD;AAAA,QACpE;AAAA,MACH;AAEA,eAAS,kCAAkC,sBAAsB;AAC/D,eAAO,qBAAqB,aAAa,gBAAgB,uBAAuB,qBAAqB;AAAA,MACvG;AAEA,eAAS,OAAO;AAAA,MAAE;AAElB,eAAS,iCAAiC,MAAM;AAU9C,aAAK,UAAU;AAAA,MACjB;AAEA,eAAS,wBAAwB,KAAK,YAAY,sBAAsB,WAAW,sBAAsB;AACvG,iBAAS,WAAW,WAAW;AAC7B,cAAI,CAAC,UAAU,eAAe,OAAO,GAAG;AACtC;AAAA,UACD;AAED,cAAI,WAAW,UAAU,OAAO;AAEhC,cAAI,YAAY,OAAO;AACrB;AACE,kBAAI,UAAU;AAGZ,uBAAO,OAAO,QAAQ;AAAA,cACvB;AAAA,YACF;AAGD,8BAAkB,YAAY,QAAQ;AAAA,UAC5C,WAAe,YAAY,4BAA4B;AACjD,gBAAI,WAAW,WAAW,SAAS,MAAM,IAAI;AAE7C,gBAAI,YAAY,MAAM;AACpB,2BAAa,YAAY,QAAQ;AAAA,YAClC;AAAA,UACP,WAAe,YAAY,UAAU;AAC/B,gBAAI,OAAO,aAAa,UAAU;AAKhC,kBAAI,oBAAoB,QAAQ,cAAc,aAAa;AAE3D,kBAAI,mBAAmB;AACrB,+BAAe,YAAY,QAAQ;AAAA,cACpC;AAAA,YACT,WAAiB,OAAO,aAAa,UAAU;AACvC,6BAAe,YAAY,KAAK,QAAQ;AAAA,YACzC;AAAA,UACF,WAAU,YAAY,qCAAqC,YAAY;AAA4B;AAAA,mBAAW,YAAY;AAAW;AAAA,mBAAW,6BAA6B,eAAe,OAAO,GAAG;AACrM,gBAAI,YAAY,MAAM;AACpB,kBAAK,OAAO,aAAa,YAAY;AACnC,4CAA4B,SAAS,QAAQ;AAAA,cAC9C;AAED,kBAAI,YAAY,YAAY;AAC1B,0CAA0B,UAAU,UAAU;AAAA,cAC/C;AAAA,YACF;AAAA,UACP,WAAe,YAAY,MAAM;AAC3B,gCAAoB,YAAY,SAAS,UAAU,oBAAoB;AAAA,UACxE;AAAA,QACF;AAAA,MACH;AAEA,eAAS,oBAAoB,YAAY,eAAe,uBAAuB,sBAAsB;AAEnG,iBAASN,KAAI,GAAGA,KAAI,cAAc,QAAQA,MAAK,GAAG;AAChD,cAAI,UAAU,cAAcA,EAAC;AAC7B,cAAI,YAAY,cAAcA,KAAI,CAAC;AAEnC,cAAI,YAAY,OAAO;AACrB,8BAAkB,YAAY,SAAS;AAAA,UAC7C,WAAe,YAAY,4BAA4B;AACjD,yBAAa,YAAY,SAAS;AAAA,UACxC,WAAe,YAAY,UAAU;AAC/B,2BAAe,YAAY,SAAS;AAAA,UAC1C,OAAW;AACL,gCAAoB,YAAY,SAAS,WAAW,oBAAoB;AAAA,UACzE;AAAA,QACF;AAAA,MACH;AAEA,eAAS,cAAc,MAAM,OAAO,sBAAsB,iBAAiB;AACzE,YAAI;AAGJ,YAAI,gBAAgB,kCAAkC,oBAAoB;AAC1E,YAAI;AACJ,YAAI,eAAe;AAEnB,YAAI,iBAAiB,gBAAgB;AACnC,yBAAe,sBAAsB,IAAI;AAAA,QAC1C;AAED,YAAI,iBAAiB,gBAAgB;AACnC;AACE,mCAAuB,kBAAkB,MAAM,KAAK;AAGpD,gBAAI,CAAC,wBAAwB,SAAS,KAAK,YAAW,GAAI;AACxD,oBAAM,0GAAoH,IAAI;AAAA,YAC/H;AAAA,UACF;AAED,cAAI,SAAS,UAAU;AAGrB,gBAAI,MAAM,cAAc,cAAc,KAAK;AAE3C,gBAAI,YAAY;AAGhB,gBAAI,aAAa,IAAI;AACrB,yBAAa,IAAI,YAAY,UAAU;AAAA,UACxC,WAAU,OAAO,MAAM,OAAO,UAAU;AAEvC,yBAAa,cAAc,cAAc,MAAM;AAAA,cAC7C,IAAI,MAAM;AAAA,YAClB,CAAO;AAAA,UACP,OAAW;AAIL,yBAAa,cAAc,cAAc,IAAI;AAS7C,gBAAI,SAAS,UAAU;AACrB,kBAAI,OAAO;AAEX,kBAAI,MAAM,UAAU;AAClB,qBAAK,WAAW;AAAA,cAC1B,WAAmB,MAAM,MAAM;AAKrB,qBAAK,OAAO,MAAM;AAAA,cACnB;AAAA,YACF;AAAA,UACF;AAAA,QACL,OAAS;AACL,uBAAa,cAAc,gBAAgB,cAAc,IAAI;AAAA,QAC9D;AAED;AACE,cAAI,iBAAiB,gBAAgB;AACnC,gBAAI,CAAC,wBAAwB,OAAO,UAAU,SAAS,KAAK,UAAU,MAAM,iCAAiC,CAAC,eAAe,KAAK,mBAAmB,IAAI,GAAG;AAC1J,gCAAkB,IAAI,IAAI;AAE1B,oBAAM,oIAA8I,IAAI;AAAA,YACzJ;AAAA,UACF;AAAA,QACF;AAED,eAAO;AAAA,MACT;AACA,eAAS,eAAe,MAAM,sBAAsB;AAClD,eAAO,kCAAkC,oBAAoB,EAAE,eAAe,IAAI;AAAA,MACpF;AACA,eAAS,qBAAqB,YAAY,KAAK,UAAU,sBAAsB;AAC7E,YAAI,uBAAuB,kBAAkB,KAAK,QAAQ;AAE1D;AACE,0CAAgC,KAAK,QAAQ;AAAA,QAC9C;AAGD,YAAI;AAEJ,gBAAQ,KAAG;AAAA,UACT,KAAK;AACH,sCAA0B,UAAU,UAAU;AAC9C,sCAA0B,SAAS,UAAU;AAC7C,oBAAQ;AACR;AAAA,UAEF,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAGH,sCAA0B,QAAQ,UAAU;AAC5C,oBAAQ;AACR;AAAA,UAEF,KAAK;AAAA,UACL,KAAK;AAGH,qBAASA,KAAI,GAAGA,KAAI,gBAAgB,QAAQA,MAAK;AAC/C,wCAA0B,gBAAgBA,EAAC,GAAG,UAAU;AAAA,YACzD;AAED,oBAAQ;AACR;AAAA,UAEF,KAAK;AAGH,sCAA0B,SAAS,UAAU;AAC7C,oBAAQ;AACR;AAAA,UAEF,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAGH,sCAA0B,SAAS,UAAU;AAC7C,sCAA0B,QAAQ,UAAU;AAC5C,oBAAQ;AACR;AAAA,UAEF,KAAK;AAGH,sCAA0B,UAAU,UAAU;AAC9C,oBAAQ;AACR;AAAA,UAEF,KAAK;AACH,6BAAiB,YAAY,QAAQ;AACrC,oBAAQ,aAAa,YAAY,QAAQ;AAGzC,sCAA0B,WAAW,UAAU;AAC/C;AAAA,UAEF,KAAK;AACH,0BAAc,YAAY,QAAQ;AAClC,oBAAQ;AACR;AAAA,UAEF,KAAK;AACH,+BAAmB,YAAY,QAAQ;AACvC,oBAAQ,eAAe,YAAY,QAAQ;AAG3C,sCAA0B,WAAW,UAAU;AAC/C;AAAA,UAEF,KAAK;AACH,+BAAmB,YAAY,QAAQ;AACvC,oBAAQ,eAAe,YAAY,QAAQ;AAG3C,sCAA0B,WAAW,UAAU;AAC/C;AAAA,UAEF;AACE,oBAAQ;AAAA,QACX;AAED,yBAAiB,KAAK,KAAK;AAC3B,gCAAwB,KAAK,YAAY,sBAAsB,OAAO,oBAAoB;AAE1F,gBAAQ,KAAG;AAAA,UACT,KAAK;AAGH,kBAAM,UAAU;AAChB,6BAAiB,YAAY,UAAU,KAAK;AAC5C;AAAA,UAEF,KAAK;AAGH,kBAAM,UAAU;AAChB,+BAAmB,UAAU;AAC7B;AAAA,UAEF,KAAK;AACH,+BAAmB,YAAY,QAAQ;AACvC;AAAA,UAEF,KAAK;AACH,+BAAmB,YAAY,QAAQ;AACvC;AAAA,UAEF;AACE,gBAAI,OAAO,MAAM,YAAY,YAAY;AAEvC,+CAAiC,UAAU;AAAA,YAC5C;AAED;AAAA,QACH;AAAA,MACH;AAEA,eAAS,eAAe,YAAY,KAAK,cAAc,cAAc,sBAAsB;AACzF;AACE,0CAAgC,KAAK,YAAY;AAAA,QAClD;AAED,YAAI,gBAAgB;AACpB,YAAI;AACJ,YAAI;AAEJ,gBAAQ,KAAG;AAAA,UACT,KAAK;AACH,wBAAY,aAAa,YAAY,YAAY;AACjD,wBAAY,aAAa,YAAY,YAAY;AACjD,4BAAgB,CAAA;AAChB;AAAA,UAEF,KAAK;AACH,wBAAY,eAAe,YAAY,YAAY;AACnD,wBAAY,eAAe,YAAY,YAAY;AACnD,4BAAgB,CAAA;AAChB;AAAA,UAEF,KAAK;AACH,wBAAY,eAAe,YAAY,YAAY;AACnD,wBAAY,eAAe,YAAY,YAAY;AACnD,4BAAgB,CAAA;AAChB;AAAA,UAEF;AACE,wBAAY;AACZ,wBAAY;AAEZ,gBAAI,OAAO,UAAU,YAAY,cAAc,OAAO,UAAU,YAAY,YAAY;AAEtF,+CAAiC,UAAU;AAAA,YAC5C;AAED;AAAA,QACH;AAED,yBAAiB,KAAK,SAAS;AAC/B,YAAI;AACJ,YAAI;AACJ,YAAI,eAAe;AAEnB,aAAK,WAAW,WAAW;AACzB,cAAI,UAAU,eAAe,OAAO,KAAK,CAAC,UAAU,eAAe,OAAO,KAAK,UAAU,OAAO,KAAK,MAAM;AACzG;AAAA,UACD;AAED,cAAI,YAAY,OAAO;AACrB,gBAAI,YAAY,UAAU,OAAO;AAEjC,iBAAK,aAAa,WAAW;AAC3B,kBAAI,UAAU,eAAe,SAAS,GAAG;AACvC,oBAAI,CAAC,cAAc;AACjB,iCAAe,CAAA;AAAA,gBAChB;AAED,6BAAa,SAAS,IAAI;AAAA,cAC3B;AAAA,YACF;AAAA,UACP,WAAe,YAAY,8BAA8B,YAAY;AAAU;AAAA,mBAAW,YAAY,qCAAqC,YAAY;AAA4B;AAAA,mBAAW,YAAY;AAAW;AAAA,mBAAW,6BAA6B,eAAe,OAAO,GAAG;AAIhR,gBAAI,CAAC,eAAe;AAClB,8BAAgB,CAAA;AAAA,YACjB;AAAA,UACP,OAAW;AAGL,aAAC,gBAAgB,iBAAiB,CAAA,GAAI,KAAK,SAAS,IAAI;AAAA,UACzD;AAAA,QACF;AAED,aAAK,WAAW,WAAW;AACzB,cAAI,WAAW,UAAU,OAAO;AAChC,cAAI,WAAW,aAAa,OAAO,UAAU,OAAO,IAAI;AAExD,cAAI,CAAC,UAAU,eAAe,OAAO,KAAK,aAAa,YAAY,YAAY,QAAQ,YAAY,MAAM;AACvG;AAAA,UACD;AAED,cAAI,YAAY,OAAO;AACrB;AACE,kBAAI,UAAU;AAGZ,uBAAO,OAAO,QAAQ;AAAA,cACvB;AAAA,YACF;AAED,gBAAI,UAAU;AAEZ,mBAAK,aAAa,UAAU;AAC1B,oBAAI,SAAS,eAAe,SAAS,MAAM,CAAC,YAAY,CAAC,SAAS,eAAe,SAAS,IAAI;AAC5F,sBAAI,CAAC,cAAc;AACjB,mCAAe,CAAA;AAAA,kBAChB;AAED,+BAAa,SAAS,IAAI;AAAA,gBAC3B;AAAA,cACF;AAGD,mBAAK,aAAa,UAAU;AAC1B,oBAAI,SAAS,eAAe,SAAS,KAAK,SAAS,SAAS,MAAM,SAAS,SAAS,GAAG;AACrF,sBAAI,CAAC,cAAc;AACjB,mCAAe,CAAA;AAAA,kBAChB;AAED,+BAAa,SAAS,IAAI,SAAS,SAAS;AAAA,gBAC7C;AAAA,cACF;AAAA,YACT,OAAa;AAEL,kBAAI,CAAC,cAAc;AACjB,oBAAI,CAAC,eAAe;AAClB,kCAAgB,CAAA;AAAA,gBACjB;AAED,8BAAc,KAAK,SAAS,YAAY;AAAA,cACzC;AAED,6BAAe;AAAA,YAChB;AAAA,UACP,WAAe,YAAY,4BAA4B;AACjD,gBAAI,WAAW,WAAW,SAAS,MAAM,IAAI;AAC7C,gBAAI,WAAW,WAAW,SAAS,MAAM,IAAI;AAE7C,gBAAI,YAAY,MAAM;AACpB,kBAAI,aAAa,UAAU;AACzB,iBAAC,gBAAgB,iBAAiB,CAAA,GAAI,KAAK,SAAS,QAAQ;AAAA,cAC7D;AAAA,YACF;AAAA,UACP,WAAe,YAAY,UAAU;AAC/B,gBAAI,OAAO,aAAa,YAAY,OAAO,aAAa,UAAU;AAChE,eAAC,gBAAgB,iBAAiB,CAAE,GAAE,KAAK,SAAS,KAAK,QAAQ;AAAA,YAClE;AAAA,UACP,WAAe,YAAY,qCAAqC,YAAY;AAA4B;AAAA,mBAAW,6BAA6B,eAAe,OAAO,GAAG;AACnK,gBAAI,YAAY,MAAM;AAEpB,kBAAK,OAAO,aAAa,YAAY;AACnC,4CAA4B,SAAS,QAAQ;AAAA,cAC9C;AAED,kBAAI,YAAY,YAAY;AAC1B,0CAA0B,UAAU,UAAU;AAAA,cAC/C;AAAA,YACF;AAED,gBAAI,CAAC,iBAAiB,aAAa,UAAU;AAI3C,8BAAgB,CAAA;AAAA,YACjB;AAAA,UACP,OAAW;AAGL,aAAC,gBAAgB,iBAAiB,CAAA,GAAI,KAAK,SAAS,QAAQ;AAAA,UAC7D;AAAA,QACF;AAED,YAAI,cAAc;AAChB;AACE,oDAAwC,cAAc,UAAU,KAAK,CAAC;AAAA,UACvE;AAED,WAAC,gBAAgB,iBAAiB,CAAA,GAAI,KAAK,OAAO,YAAY;AAAA,QAC/D;AAED,eAAO;AAAA,MACT;AAEA,eAAS,iBAAiB,YAAY,eAAe,KAAK,cAAc,cAAc;AAIpF,YAAI,QAAQ,WAAW,aAAa,SAAS,WAAW,aAAa,QAAQ,MAAM;AACjF,wBAAc,YAAY,YAAY;AAAA,QACvC;AAED,YAAI,wBAAwB,kBAAkB,KAAK,YAAY;AAC/D,YAAI,uBAAuB,kBAAkB,KAAK,YAAY;AAE9D,4BAAoB,YAAY,eAAe,uBAAuB,oBAAoB;AAG1F,gBAAQ,KAAG;AAAA,UACT,KAAK;AAIH,0BAAc,YAAY,YAAY;AACtC;AAAA,UAEF,KAAK;AACH,4BAAgB,YAAY,YAAY;AACxC;AAAA,UAEF,KAAK;AAGH,8BAAkB,YAAY,YAAY;AAC1C;AAAA,QACH;AAAA,MACH;AAEA,eAAS,wBAAwB,UAAU;AACzC;AACE,cAAI,iBAAiB,SAAS;AAE9B,cAAI,CAAC,sBAAsB,eAAe,cAAc,GAAG;AACzD,mBAAO;AAAA,UACR;AAED,iBAAO,sBAAsB,cAAc,KAAK;AAAA,QACjD;AAAA,MACH;AAEA,eAAS,uBAAuB,YAAY,KAAK,UAAU,iBAAiB,sBAAsB,kBAAkB,eAAe;AACjI,YAAI;AACJ,YAAI;AAEJ;AACE,iCAAuB,kBAAkB,KAAK,QAAQ;AACtD,0CAAgC,KAAK,QAAQ;AAAA,QAC9C;AAGD,gBAAQ,KAAG;AAAA,UACT,KAAK;AACH,sCAA0B,UAAU,UAAU;AAC9C,sCAA0B,SAAS,UAAU;AAC7C;AAAA,UAEF,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAGH,sCAA0B,QAAQ,UAAU;AAC5C;AAAA,UAEF,KAAK;AAAA,UACL,KAAK;AAGH,qBAASA,KAAI,GAAGA,KAAI,gBAAgB,QAAQA,MAAK;AAC/C,wCAA0B,gBAAgBA,EAAC,GAAG,UAAU;AAAA,YACzD;AAED;AAAA,UAEF,KAAK;AAGH,sCAA0B,SAAS,UAAU;AAC7C;AAAA,UAEF,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAGH,sCAA0B,SAAS,UAAU;AAC7C,sCAA0B,QAAQ,UAAU;AAC5C;AAAA,UAEF,KAAK;AAGH,sCAA0B,UAAU,UAAU;AAC9C;AAAA,UAEF,KAAK;AACH,6BAAiB,YAAY,QAAQ;AAGrC,sCAA0B,WAAW,UAAU;AAC/C;AAAA,UAEF,KAAK;AACH,0BAAc,YAAY,QAAQ;AAClC;AAAA,UAEF,KAAK;AACH,+BAAmB,YAAY,QAAQ;AAGvC,sCAA0B,WAAW,UAAU;AAC/C;AAAA,UAEF,KAAK;AACH,+BAAmB,YAAY,QAAQ;AAGvC,sCAA0B,WAAW,UAAU;AAC/C;AAAA,QACH;AAED,yBAAiB,KAAK,QAAQ;AAE9B;AACE,gCAAsB,oBAAI;AAC1B,cAAI,aAAa,WAAW;AAE5B,mBAAS,KAAK,GAAG,KAAK,WAAW,QAAQ,MAAM;AAC7C,gBAAIM,QAAO,WAAW,EAAE,EAAE,KAAK,YAAW;AAE1C,oBAAQA,OAAI;AAAA,cAGV,KAAK;AACH;AAAA,cAEF,KAAK;AACH;AAAA,cAEF,KAAK;AACH;AAAA,cAEF;AAGE,oCAAoB,IAAI,WAAW,EAAE,EAAE,IAAI;AAAA,YAC9C;AAAA,UACF;AAAA,QACF;AAED,YAAI,gBAAgB;AAEpB,iBAAS,WAAW,UAAU;AAC5B,cAAI,CAAC,SAAS,eAAe,OAAO,GAAG;AACrC;AAAA,UACD;AAED,cAAI,WAAW,SAAS,OAAO;AAE/B,cAAI,YAAY,UAAU;AAUxB,gBAAI,OAAO,aAAa,UAAU;AAChC,kBAAI,WAAW,gBAAgB,UAAU;AACvC,oBAAI,SAAS,0BAA0B,MAAM,MAAM;AACjD,wCAAsB,WAAW,aAAa,UAAU,kBAAkB,aAAa;AAAA,gBACxF;AAED,gCAAgB,CAAC,UAAU,QAAQ;AAAA,cACpC;AAAA,YACT,WAAiB,OAAO,aAAa,UAAU;AACvC,kBAAI,WAAW,gBAAgB,KAAK,UAAU;AAC5C,oBAAI,SAAS,0BAA0B,MAAM,MAAM;AACjD,wCAAsB,WAAW,aAAa,UAAU,kBAAkB,aAAa;AAAA,gBACxF;AAED,gCAAgB,CAAC,UAAU,KAAK,QAAQ;AAAA,cACzC;AAAA,YACF;AAAA,UACF,WAAU,6BAA6B,eAAe,OAAO,GAAG;AAC/D,gBAAI,YAAY,MAAM;AACpB,kBAAK,OAAO,aAAa,YAAY;AACnC,4CAA4B,SAAS,QAAQ;AAAA,cAC9C;AAED,kBAAI,YAAY,YAAY;AAC1B,0CAA0B,UAAU,UAAU;AAAA,cAC/C;AAAA,YACF;AAAA,UACP,WAAe,iBAAiB;AAAA,UAC5B,OAAO,yBAAyB,WAAW;AAEzC,gBAAI,cAAc;AAClB,gBAAI,eAAe,wBAAwB,qCAAqC,OAAO,gBAAgB,OAAO;AAE9G,gBAAI,SAAS,0BAA0B,MAAM;AAAM;AAAA,qBAAW,YAAY,qCAAqC,YAAY;AAAA;AAAA,YAE3H,YAAY,WAAW,YAAY,aAAa,YAAY;AAAY;AAAA,qBAAW,YAAY,4BAA4B;AACzH,kBAAI,aAAa,WAAW;AAC5B,kBAAI,WAAW,WAAW,SAAS,MAAM,IAAI;AAE7C,kBAAI,YAAY,MAAM;AACpB,oBAAI,eAAe,cAAc,YAAY,QAAQ;AAErD,oBAAI,iBAAiB,YAAY;AAC/B,wCAAsB,SAAS,YAAY,YAAY;AAAA,gBACxD;AAAA,cACF;AAAA,YACT,WAAiB,YAAY,OAAO;AAE5B,kCAAoB,OAAO,OAAO;AAElC,kBAAI,iCAAiC;AACnC,oBAAI,gBAAgB,+BAA+B,QAAQ;AAC3D,8BAAc,WAAW,aAAa,OAAO;AAE7C,oBAAI,kBAAkB,aAAa;AACjC,wCAAsB,SAAS,aAAa,aAAa;AAAA,gBAC1D;AAAA,cACF;AAAA,YACT,WAAiB,wBAAwB,CAAC,oCAAoC;AAEtE,kCAAoB,OAAO,QAAQ,YAAa,CAAA;AAChD,4BAAc,qBAAqB,YAAY,SAAS,QAAQ;AAEhE,kBAAI,aAAa,aAAa;AAC5B,sCAAsB,SAAS,aAAa,QAAQ;AAAA,cACrD;AAAA,YACF,WAAU,CAAC,sBAAsB,SAAS,cAAc,oBAAoB,KAAK,CAAC,sBAAsB,SAAS,UAAU,cAAc,oBAAoB,GAAG;AAC/J,kBAAI,2BAA2B;AAE/B,kBAAI,iBAAiB,MAAM;AAEzB,oCAAoB,OAAO,aAAa,aAAa;AACrD,8BAAc,oBAAoB,YAAY,SAAS,UAAU,YAAY;AAAA,cACvF,OAAe;AACL,oBAAI,eAAe;AAEnB,oBAAI,iBAAiB,gBAAgB;AACnC,iCAAe,sBAAsB,GAAG;AAAA,gBACzC;AAED,oBAAI,iBAAiB,gBAAgB;AAEnC,sCAAoB,OAAO,QAAQ,YAAa,CAAA;AAAA,gBAC5D,OAAiB;AACL,sBAAI,eAAe,wBAAwB,OAAO;AAElD,sBAAI,iBAAiB,QAAQ,iBAAiB,SAAS;AAMrD,+CAA2B;AAE3B,wCAAoB,OAAO,YAAY;AAAA,kBACxC;AAGD,sCAAoB,OAAO,OAAO;AAAA,gBACnC;AAED,8BAAc,qBAAqB,YAAY,SAAS,QAAQ;AAAA,cACjE;AAED,kBAAI,wBAAwB;AAE5B,kBAAI,CAAC,yBAAyB,aAAa,eAAe,CAAC,0BAA0B;AACnF,sCAAsB,SAAS,aAAa,QAAQ;AAAA,cACrD;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAED;AACE,cAAI,eAAe;AACjB;AAAA;AAAA,cACA,oBAAoB,OAAO,KAAK,SAAS,0BAA0B,MAAM;AAAA,cAAM;AAE7E,qCAAuB,mBAAmB;AAAA,YAC3C;AAAA,UACF;AAAA,QACF;AAED,gBAAQ,KAAG;AAAA,UACT,KAAK;AAGH,kBAAM,UAAU;AAChB,6BAAiB,YAAY,UAAU,IAAI;AAC3C;AAAA,UAEF,KAAK;AAGH,kBAAM,UAAU;AAChB,+BAAmB,UAAU;AAC7B;AAAA,UAEF,KAAK;AAAA,UACL,KAAK;AAMH;AAAA,UAEF;AACE,gBAAI,OAAO,SAAS,YAAY,YAAY;AAE1C,+CAAiC,UAAU;AAAA,YAC5C;AAED;AAAA,QACH;AAED,eAAO;AAAA,MACT;AACA,eAAS,iBAAiB,UAAU,MAAM,kBAAkB;AAC1D,YAAI,cAAc,SAAS,cAAc;AACzC,eAAO;AAAA,MACT;AACA,eAAS,gCAAgC,YAAY,OAAO;AAC1D;AACE,cAAI,yBAAyB;AAC3B;AAAA,UACD;AAED,oCAA0B;AAE1B,gBAAM,yDAAyD,MAAM,SAAS,YAAa,GAAE,WAAW,SAAS,YAAW,CAAE;AAAA,QAC/H;AAAA,MACH;AACA,eAAS,6BAA6B,YAAY,OAAO;AACvD;AACE,cAAI,yBAAyB;AAC3B;AAAA,UACD;AAED,oCAA0B;AAE1B,gBAAM,qEAAqE,MAAM,WAAW,WAAW,SAAS,YAAW,CAAE;AAAA,QAC9H;AAAA,MACH;AACA,eAAS,+BAA+B,YAAY,KAAK,OAAO;AAC9D;AACE,cAAI,yBAAyB;AAC3B;AAAA,UACD;AAED,oCAA0B;AAE1B,gBAAM,4DAA4D,KAAK,WAAW,SAAS,YAAW,CAAE;AAAA,QACzG;AAAA,MACH;AACA,eAAS,4BAA4B,YAAY,MAAM;AACrD;AACE,cAAI,SAAS,IAAI;AAKf;AAAA,UACD;AAED,cAAI,yBAAyB;AAC3B;AAAA,UACD;AAED,oCAA0B;AAE1B,gBAAM,0EAA0E,MAAM,WAAW,SAAS,YAAW,CAAE;AAAA,QACxH;AAAA,MACH;AACA,eAAS,yBAAyB,YAAY,KAAK,OAAO;AACxD,gBAAQ,KAAG;AAAA,UACT,KAAK;AACH,mCAAuB,YAAY,KAAK;AACxC;AAAA,UAEF,KAAK;AACH,qCAAyB,YAAY,KAAK;AAC1C;AAAA,UAEF,KAAK;AACH,qCAAyB,YAAY,KAAK;AAC1C;AAAA,QACH;AAAA,MACH;AAEA,UAAI,qBAAqB,WAAY;AAAA,MAAA;AAErC,UAAI,sBAAsB,WAAY;AAAA,MAAA;AAEtC;AAYE,YAAI,cAAc,CAAC,WAAW,UAAU,QAAQ,WAAW,SAAS,QAAQ,YAAY,WAAW,cAAc,QAAQ,MAAM,UAAU,WAAW,UAAU,OAAO,YAAY,MAAM,WAAW,OAAO,OAAO,MAAM,MAAM,SAAS,YAAY,cAAc,UAAU,UAAU,QAAQ,SAAS,YAAY,MAAM,MAAM,MAAM,MAAM,MAAM,MAAM,QAAQ,UAAU,UAAU,MAAM,QAAQ,UAAU,OAAO,SAAS,WAAW,MAAM,QAAQ,WAAW,QAAQ,WAAW,QAAQ,YAAY,QAAQ,OAAO,WAAW,YAAY,YAAY,UAAU,MAAM,KAAK,SAAS,aAAa,OAAO,UAAU,WAAW,UAAU,UAAU,SAAS,WAAW,SAAS,SAAS,MAAM,YAAY,YAAY,SAAS,MAAM,SAAS,SAAS,MAAM,SAAS,MAAM,OAAO,KAAK;AAEtvB,YAAI,cAAc;AAAA,UAAC;AAAA,UAAU;AAAA,UAAW;AAAA,UAAQ;AAAA,UAAS;AAAA,UAAM;AAAA,UAAM;AAAA,UAAW;AAAA,UAAU;AAAA;AAAA;AAAA;AAAA,UAG1F;AAAA,UAAiB;AAAA,UAAQ;AAAA,QAAO;AAEhC,YAAI,kBAAkB,YAAY,OAAO,CAAC,QAAQ,CAAC;AAEnD,YAAI,iBAAiB,CAAC,MAAM,MAAM,MAAM,UAAU,YAAY,KAAK,MAAM,IAAI;AAC7E,YAAI,oBAAoB;AAAA,UACtB,SAAS;AAAA,UACT,SAAS;AAAA,UACT,aAAa;AAAA,UACb,kBAAkB;AAAA,UAClB,gBAAgB;AAAA,UAChB,mBAAmB;AAAA,UACnB,wBAAwB;AAAA,UACxB,sBAAsB;AAAA,QAC1B;AAEE,8BAAsB,SAAU,SAAS,KAAK;AAC5C,cAAI,eAAe,OAAO,CAAE,GAAE,WAAW,iBAAiB;AAE1D,cAAI,OAAO;AAAA,YACT;AAAA,UACN;AAEI,cAAI,YAAY,QAAQ,GAAG,MAAM,IAAI;AACnC,yBAAa,cAAc;AAC3B,yBAAa,mBAAmB;AAChC,yBAAa,iBAAiB;AAAA,UAC/B;AAED,cAAI,gBAAgB,QAAQ,GAAG,MAAM,IAAI;AACvC,yBAAa,oBAAoB;AAAA,UAClC;AAID,cAAI,YAAY,QAAQ,GAAG,MAAM,MAAM,QAAQ,aAAa,QAAQ,SAAS,QAAQ,KAAK;AACxF,yBAAa,yBAAyB;AACtC,yBAAa,uBAAuB;AAAA,UACrC;AAED,uBAAa,UAAU;AAEvB,cAAI,QAAQ,QAAQ;AAClB,yBAAa,UAAU;AAAA,UACxB;AAED,cAAI,QAAQ,KAAK;AACf,yBAAa,cAAc;AAAA,UAC5B;AAED,cAAI,QAAQ,UAAU;AACpB,yBAAa,mBAAmB;AAAA,UACjC;AAED,cAAI,QAAQ,QAAQ;AAClB,yBAAa,iBAAiB;AAAA,UAC/B;AAED,cAAI,QAAQ,KAAK;AACf,yBAAa,oBAAoB;AAAA,UAClC;AAED,cAAI,QAAQ,MAAM;AAChB,yBAAa,yBAAyB;AAAA,UACvC;AAED,cAAI,QAAQ,QAAQ,QAAQ,MAAM;AAChC,yBAAa,uBAAuB;AAAA,UACrC;AAED,iBAAO;AAAA,QACX;AAME,YAAI,uBAAuB,SAAU,KAAK,WAAW;AAEnD,kBAAQ,WAAS;AAAA,YAEf,KAAK;AACH,qBAAO,QAAQ,YAAY,QAAQ,cAAc,QAAQ;AAAA,YAE3D,KAAK;AACH,qBAAO,QAAQ,YAAY,QAAQ;AAAA,YAIrC,KAAK;AACH,qBAAO,QAAQ;AAAA,YAOjB,KAAK;AACH,qBAAO,QAAQ,QAAQ,QAAQ,QAAQ,QAAQ,WAAW,QAAQ,YAAY,QAAQ;AAAA,YAGxF,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AACH,qBAAO,QAAQ,QAAQ,QAAQ,WAAW,QAAQ,YAAY,QAAQ;AAAA,YAGxE,KAAK;AACH,qBAAO,QAAQ,SAAS,QAAQ;AAAA,YAGlC,KAAK;AACH,qBAAO,QAAQ,aAAa,QAAQ,cAAc,QAAQ,WAAW,QAAQ,WAAW,QAAQ,WAAW,QAAQ,WAAW,QAAQ,YAAY,QAAQ;AAAA,YAG5J,KAAK;AACH,qBAAO,QAAQ,UAAU,QAAQ,cAAc,QAAQ,aAAa,QAAQ,UAAU,QAAQ,UAAU,QAAQ,WAAW,QAAQ,cAAc,QAAQ,cAAc,QAAQ,WAAW,QAAQ,YAAY,QAAQ;AAAA,YAGxN,KAAK;AACH,qBAAO,QAAQ,UAAU,QAAQ,UAAU,QAAQ;AAAA,YAErD,KAAK;AACH,qBAAO,QAAQ;AAAA,YAEjB,KAAK;AACH,qBAAO,QAAQ;AAAA,UAClB;AAKD,kBAAQ,KAAG;AAAA,YACT,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AACH,qBAAO,cAAc,QAAQ,cAAc,QAAQ,cAAc,QAAQ,cAAc,QAAQ,cAAc,QAAQ,cAAc;AAAA,YAErI,KAAK;AAAA,YACL,KAAK;AACH,qBAAO,eAAe,QAAQ,SAAS,MAAM;AAAA,YAE/C,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAKH,qBAAO,aAAa;AAAA,UACvB;AAED,iBAAO;AAAA,QACX;AAME,YAAI,4BAA4B,SAAU,KAAK,cAAc;AAC3D,kBAAQ,KAAG;AAAA,YACT,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AACH,qBAAO,aAAa;AAAA,YAEtB,KAAK;AACH,qBAAO,aAAa,WAAW,aAAa;AAAA,YAE9C,KAAK;AACH,qBAAO,aAAa;AAAA,YAEtB,KAAK;AAAA,YACL,KAAK;AACH,qBAAO,aAAa;AAAA,YAEtB,KAAK;AACH,qBAAO,aAAa;AAAA,YAEtB,KAAK;AAGH,qBAAO,aAAa;AAAA,YAEtB,KAAK;AACH,qBAAO,aAAa;AAAA,UACvB;AAED,iBAAO;AAAA,QACX;AAEE,YAAI,YAAY,CAAA;AAEhB,6BAAqB,SAAU,UAAU,WAAW,cAAc;AAChE,yBAAe,gBAAgB;AAC/B,cAAI,aAAa,aAAa;AAC9B,cAAI,YAAY,cAAc,WAAW;AAEzC,cAAI,aAAa,MAAM;AACrB,gBAAI,YAAY,MAAM;AACpB,oBAAM,uEAAuE;AAAA,YAC9E;AAED,uBAAW;AAAA,UACZ;AAED,cAAI,gBAAgB,qBAAqB,UAAU,SAAS,IAAI,OAAO;AACvE,cAAI,kBAAkB,gBAAgB,OAAO,0BAA0B,UAAU,YAAY;AAC7F,cAAI,0BAA0B,iBAAiB;AAE/C,cAAI,CAAC,yBAAyB;AAC5B;AAAA,UACD;AAED,cAAI,cAAc,wBAAwB;AAC1C,cAAI,UAAU,CAAC,CAAC,gBAAgB,MAAM,WAAW,MAAM;AAEvD,cAAI,UAAU,OAAO,GAAG;AACtB;AAAA,UACD;AAED,oBAAU,OAAO,IAAI;AACrB,cAAI,iBAAiB;AACrB,cAAI,iBAAiB;AAErB,cAAI,aAAa,SAAS;AACxB,gBAAI,KAAK,KAAK,SAAS,GAAG;AACxB,+BAAiB;AAAA,YACzB,OAAa;AACL,+BAAiB;AACjB,+BAAiB;AAAA,YAClB;AAAA,UACP,OAAW;AACL,6BAAiB,MAAM,WAAW;AAAA,UACnC;AAED,cAAI,eAAe;AACjB,gBAAI,OAAO;AAEX,gBAAI,gBAAgB,WAAW,aAAa,MAAM;AAChD,sBAAQ;AAAA,YACT;AAED,kBAAM,qEAAqE,gBAAgB,aAAa,gBAAgB,IAAI;AAAA,UAClI,OAAW;AACL,kBAAM,sEAA2E,gBAAgB,WAAW;AAAA,UAC7G;AAAA,QACL;AAAA,MACA;AAEA,UAAI,+BAA+B;AACnC,UAAI,sBAAsB;AAC1B,UAAI,oBAAoB;AACxB,UAAI,8BAA8B;AAClC,UAAI,+BAA+B;AACnC,UAAI,UAAU;AACd,UAAI,gBAAgB;AACpB,UAAI,uBAAuB;AAC3B,eAAS,mBAAmB,uBAAuB;AACjD,YAAI;AACJ,YAAI;AACJ,YAAI,WAAW,sBAAsB;AAErC,gBAAQ,UAAQ;AAAA,UACd,KAAK;AAAA,UACL,KAAK,wBACH;AACE,mBAAO,aAAa,gBAAgB,cAAc;AAClD,gBAAI8G,QAAO,sBAAsB;AACjC,wBAAYA,QAAOA,MAAK,eAAe,kBAAkB,MAAM,EAAE;AACjE;AAAA,UACD;AAAA,UAEH,SACE;AACE,gBAAI,YAAY,aAAa,eAAe,sBAAsB,aAAa;AAC/E,gBAAI,eAAe,UAAU,gBAAgB;AAC7C,mBAAO,UAAU;AACjB,wBAAY,kBAAkB,cAAc,IAAI;AAChD;AAAA,UACD;AAAA,QACJ;AAED;AACE,cAAI,eAAe,KAAK;AACxB,cAAI,eAAe,oBAAoB,MAAM,YAAY;AACzD,iBAAO;AAAA,YACL;AAAA,YACA;AAAA,UACN;AAAA,QACG;AAAA,MACH;AACA,eAAS,oBAAoB,mBAAmB,MAAM,uBAAuB;AAC3E;AACE,cAAI,uBAAuB;AAC3B,cAAI,YAAY,kBAAkB,qBAAqB,WAAW,IAAI;AACtE,cAAI,eAAe,oBAAoB,qBAAqB,cAAc,IAAI;AAC9E,iBAAO;AAAA,YACL;AAAA,YACA;AAAA,UACN;AAAA,QACG;AAAA,MACH;AACA,eAAS,kBAAkB,UAAU;AACnC,eAAO;AAAA,MACT;AACA,eAAS,iBAAiB,eAAe;AACvC,wBAAgB,UAAS;AACzB,+BAAuB,wBAAuB;AAC9C,YAAI,iBAAiB;AAErB,mBAAW,KAAK;AAChB,eAAO;AAAA,MACT;AACA,eAAS,iBAAiB,eAAe;AACvC,yBAAiB,oBAAoB;AACrC,mBAAW,aAAa;AACxB,wBAAgB;AAChB,+BAAuB;AAAA,MACzB;AACA,eAAS,eAAe,MAAM,OAAO,uBAAuB,aAAa,wBAAwB;AAC/F,YAAI;AAEJ;AAEE,cAAI,iBAAiB;AACrB,6BAAmB,MAAM,MAAM,eAAe,YAAY;AAE1D,cAAI,OAAO,MAAM,aAAa,YAAY,OAAO,MAAM,aAAa,UAAU;AAC5E,gBAAIhF,UAAS,KAAK,MAAM;AACxB,gBAAI,kBAAkB,oBAAoB,eAAe,cAAc,IAAI;AAC3E,+BAAmB,MAAMA,SAAQ,eAAe;AAAA,UACjD;AAED,4BAAkB,eAAe;AAAA,QAClC;AAED,YAAI,aAAa,cAAc,MAAM,OAAO,uBAAuB,eAAe;AAClF,0BAAkB,wBAAwB,UAAU;AACpD,yBAAiB,YAAY,KAAK;AAClC,eAAO;AAAA,MACT;AACA,eAAS,mBAAmB,gBAAgB,OAAO;AACjD,uBAAe,YAAY,KAAK;AAAA,MAClC;AACA,eAAS,wBAAwB,YAAY,MAAM,OAAO,uBAAuB,aAAa;AAC5F,6BAAqB,YAAY,MAAM,OAAO,qBAAqB;AAEnE,gBAAQ,MAAI;AAAA,UACV,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AACH,mBAAO,CAAC,CAAC,MAAM;AAAA,UAEjB,KAAK;AACH,mBAAO;AAAA,UAET;AACE,mBAAO;AAAA,QACV;AAAA,MACH;AACA,eAAS,cAAc,YAAY,MAAM,UAAU,UAAU,uBAAuB,aAAa;AAC/F;AACE,cAAI,iBAAiB;AAErB,cAAI,OAAO,SAAS,aAAa,OAAO,SAAS,aAAa,OAAO,SAAS,aAAa,YAAY,OAAO,SAAS,aAAa,WAAW;AAC7I,gBAAIA,UAAS,KAAK,SAAS;AAC3B,gBAAI,kBAAkB,oBAAoB,eAAe,cAAc,IAAI;AAC3E,+BAAmB,MAAMA,SAAQ,eAAe;AAAA,UACjD;AAAA,QACF;AAED,eAAO,eAAe,YAAY,MAAM,UAAU,QAAQ;AAAA,MAC5D;AACA,eAAS,qBAAqB,MAAM,OAAO;AACzC,eAAO,SAAS,cAAc,SAAS,cAAc,OAAO,MAAM,aAAa,YAAY,OAAO,MAAM,aAAa,YAAY,OAAO,MAAM,4BAA4B,YAAY,MAAM,4BAA4B,QAAQ,MAAM,wBAAwB,UAAU;AAAA,MAC1Q;AACA,eAAS,mBAAmB,MAAM,uBAAuB,aAAa,wBAAwB;AAC5F;AACE,cAAI,iBAAiB;AACrB,6BAAmB,MAAM,MAAM,eAAe,YAAY;AAAA,QAC3D;AAED,YAAI,WAAW,eAAe,MAAM,qBAAqB;AACzD,0BAAkB,wBAAwB,QAAQ;AAClD,eAAO;AAAA,MACT;AACA,eAAS,0BAA0B;AACjC,YAAI,eAAe,OAAO;AAE1B,YAAI,iBAAiB,QAAW;AAC9B,iBAAO;AAAA,QACR;AAED,eAAO,iBAAiB,aAAa,IAAI;AAAA,MAC3C;AAIA,UAAI,kBAAkB,OAAO,eAAe,aAAa,aAAa;AACtE,UAAI,gBAAgB,OAAO,iBAAiB,aAAa,eAAe;AACxE,UAAI,YAAY;AAChB,UAAI,eAAe,OAAO,YAAY,aAAa,UAAU;AAC7D,UAAI,oBAAoB,OAAO,mBAAmB,aAAa,iBAAiB,OAAO,iBAAiB,cAAc,SAAU,UAAU;AACxI,eAAO,aAAa,QAAQ,IAAI,EAAE,KAAK,QAAQ,EAAE,MAAM,qBAAqB;AAAA,MAC9E,IAAI;AAEJ,eAAS,sBAAsB/B,QAAO;AACpC,mBAAW,WAAY;AACrB,gBAAMA;AAAA,QACV,CAAG;AAAA,MACH;AACA,eAAS,YAAY,YAAY,MAAM,UAAU,wBAAwB;AAOvE,gBAAQ,MAAI;AAAA,UACV,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AACH,gBAAI,SAAS,WAAW;AACtB,yBAAW,MAAK;AAAA,YACjB;AAED;AAAA,UAEF,KAAK,OACH;AACE,gBAAI,SAAS,KAAK;AAChB,yBAAW,MAAM,SAAS;AAAA,YAC3B;AAED;AAAA,UACD;AAAA,QACJ;AAAA,MACH;AACA,eAAS,aAAa,YAAY,eAAe,MAAM,UAAU,UAAU,wBAAwB;AAEjG,yBAAiB,YAAY,eAAe,MAAM,UAAU,QAAQ;AAGpE,yBAAiB,YAAY,QAAQ;AAAA,MACvC;AACA,eAAS,iBAAiB,YAAY;AACpC,uBAAe,YAAY,EAAE;AAAA,MAC/B;AACA,eAAS,iBAAiB,cAAc,SAAS,SAAS;AACxD,qBAAa,YAAY;AAAA,MAC3B;AACA,eAAS,YAAY,gBAAgB,OAAO;AAC1C,uBAAe,YAAY,KAAK;AAAA,MAClC;AACA,eAAS,uBAAuB,WAAW,OAAO;AAChD,YAAI;AAEJ,YAAI,UAAU,aAAa,cAAc;AACvC,uBAAa,UAAU;AACvB,qBAAW,aAAa,OAAO,SAAS;AAAA,QAC5C,OAAS;AACL,uBAAa;AACb,qBAAW,YAAY,KAAK;AAAA,QAC7B;AAUD,YAAI,qBAAqB,UAAU;AAEnC,aAAK,uBAAuB,QAAQ,uBAAuB,WAAc,WAAW,YAAY,MAAM;AAEpG,2CAAiC,UAAU;AAAA,QAC5C;AAAA,MACH;AACA,eAAS,aAAa,gBAAgB,OAAO,aAAa;AACxD,uBAAe,aAAa,OAAO,WAAW;AAAA,MAChD;AACA,eAAS,wBAAwB,WAAW,OAAO,aAAa;AAC9D,YAAI,UAAU,aAAa,cAAc;AACvC,oBAAU,WAAW,aAAa,OAAO,WAAW;AAAA,QACxD,OAAS;AACL,oBAAU,aAAa,OAAO,WAAW;AAAA,QAC1C;AAAA,MACH;AAEA,eAAS,YAAY,gBAAgB,OAAO;AAC1C,uBAAe,YAAY,KAAK;AAAA,MAClC;AACA,eAAS,yBAAyB,WAAW,OAAO;AAClD,YAAI,UAAU,aAAa,cAAc;AACvC,oBAAU,WAAW,YAAY,KAAK;AAAA,QAC1C,OAAS;AACL,oBAAU,YAAY,KAAK;AAAA,QAC5B;AAAA,MACH;AACA,eAAS,sBAAsB,gBAAgB,kBAAkB;AAC/D,YAAI,OAAO;AAIX,YAAI,QAAQ;AAEZ,WAAG;AACD,cAAI,WAAW,KAAK;AACpB,yBAAe,YAAY,IAAI;AAE/B,cAAI,YAAY,SAAS,aAAa,cAAc;AAClD,gBAAI,OAAO,SAAS;AAEpB,gBAAI,SAAS,mBAAmB;AAC9B,kBAAI,UAAU,GAAG;AACf,+BAAe,YAAY,QAAQ;AAEnC,iCAAiB,gBAAgB;AACjC;AAAA,cACV,OAAe;AACL;AAAA,cACD;AAAA,YACT,WAAiB,SAAS,uBAAuB,SAAS,+BAA+B,SAAS,8BAA8B;AACxH;AAAA,YACD;AAAA,UACF;AAED,iBAAO;AAAA,QACR,SAAQ;AAIT,yBAAiB,gBAAgB;AAAA,MACnC;AACA,eAAS,mCAAmC,WAAW,kBAAkB;AACvE,YAAI,UAAU,aAAa,cAAc;AACvC,gCAAsB,UAAU,YAAY,gBAAgB;AAAA,QAChE,WAAa,UAAU,aAAa,cAAc;AAC9C,gCAAsB,WAAW,gBAAgB;AAAA,QAClD;AAGD,yBAAiB,SAAS;AAAA,MAC5B;AACA,eAAS,aAAa,UAAU;AAG9B,mBAAW;AACX,YAAI0G,SAAQ,SAAS;AAErB,YAAI,OAAOA,OAAM,gBAAgB,YAAY;AAC3C,UAAAA,OAAM,YAAY,WAAW,QAAQ,WAAW;AAAA,QACpD,OAAS;AACL,UAAAA,OAAM,UAAU;AAAA,QACjB;AAAA,MACH;AACA,eAAS,iBAAiB,cAAc;AACtC,qBAAa,YAAY;AAAA,MAC3B;AACA,eAAS,eAAe,UAAU,OAAO;AACvC,mBAAW;AACX,YAAI,YAAY,MAAM,OAAO;AAC7B,YAAI,UAAU,cAAc,UAAa,cAAc,QAAQ,UAAU,eAAe,SAAS,IAAI,UAAU,UAAU;AACzH,iBAAS,MAAM,UAAU,oBAAoB,WAAW,OAAO;AAAA,MACjE;AACA,eAAS,mBAAmB,cAAc,MAAM;AAC9C,qBAAa,YAAY;AAAA,MAC3B;AACA,eAAS,eAAe,WAAW;AACjC,YAAI,UAAU,aAAa,cAAc;AACvC,oBAAU,cAAc;AAAA,QAC5B,WAAa,UAAU,aAAa,eAAe;AAC/C,cAAI,UAAU,iBAAiB;AAC7B,sBAAU,YAAY,UAAU,eAAe;AAAA,UAChD;AAAA,QACF;AAAA,MACH;AACA,eAAS,mBAAmB,UAAU,MAAM,OAAO;AACjD,YAAI,SAAS,aAAa,gBAAgB,KAAK,YAAW,MAAO,SAAS,SAAS,eAAe;AAChG,iBAAO;AAAA,QACR;AAGD,eAAO;AAAA,MACT;AACA,eAAS,uBAAuB,UAAU,MAAM;AAC9C,YAAI,SAAS,MAAM,SAAS,aAAa,WAAW;AAElD,iBAAO;AAAA,QACR;AAGD,eAAO;AAAA,MACT;AACA,eAAS,2BAA2B,UAAU;AAC5C,YAAI,SAAS,aAAa,cAAc;AAEtC,iBAAO;AAAA,QACR;AAGD,eAAO;AAAA,MACT;AACA,eAAS,0BAA0B,UAAU;AAC3C,eAAO,SAAS,SAAS;AAAA,MAC3B;AACA,eAAS,2BAA2B,UAAU;AAC5C,eAAO,SAAS,SAAS;AAAA,MAC3B;AACA,eAAS,wCAAwC,UAAU;AACzD,YAAI,UAAU,SAAS,eAAe,SAAS,YAAY;AAC3D,YAAI,QAAQ,SAAS;AAErB,YAAI,SAAS;AACX,mBAAS,QAAQ;AAEjB;AACE,sBAAU,QAAQ;AAClB,oBAAQ,QAAQ;AAAA,UACjB;AAAA,QACF;AAED;AACE,iBAAO;AAAA,YACL;AAAA,YACA;AAAA,YACA;AAAA,UACN;AAAA,QACG;AAAA,MAYH;AACA,eAAS,8BAA8B,UAAU,UAAU;AACzD,iBAAS,cAAc;AAAA,MACzB;AAEA,eAAS,kBAAkB,MAAM;AAE/B,eAAO,QAAQ,MAAM,OAAO,KAAK,aAAa;AAC5C,cAAI,WAAW,KAAK;AAEpB,cAAI,aAAa,gBAAgB,aAAa,WAAW;AACvD;AAAA,UACD;AAED,cAAI,aAAa,cAAc;AAC7B,gBAAI,WAAW,KAAK;AAEpB,gBAAI,aAAa,uBAAuB,aAAa,gCAAgC,aAAa,6BAA6B;AAC7H;AAAA,YACD;AAED,gBAAI,aAAa,mBAAmB;AAClC,qBAAO;AAAA,YACR;AAAA,UACF;AAAA,QACF;AAED,eAAO;AAAA,MACT;AAEA,eAAS,yBAAyB,UAAU;AAC1C,eAAO,kBAAkB,SAAS,WAAW;AAAA,MAC/C;AACA,eAAS,wBAAwB,gBAAgB;AAC/C,eAAO,kBAAkB,eAAe,UAAU;AAAA,MACpD;AACA,eAAS,uCAAuC,iBAAiB;AAC/D,eAAO,kBAAkB,gBAAgB,UAAU;AAAA,MACrD;AACA,eAAS,8CAA8C,gBAAgB;AACrE,eAAO,kBAAkB,eAAe,WAAW;AAAA,MACrD;AACA,eAAS,gBAAgB,UAAU,MAAM,OAAO,uBAAuB,aAAa,wBAAwB,eAAe;AACzH,0BAAkB,wBAAwB,QAAQ;AAGlD,yBAAiB,UAAU,KAAK;AAChC,YAAI;AAEJ;AACE,cAAI,iBAAiB;AACrB,4BAAkB,eAAe;AAAA,QAClC;AAID,YAAI,oBAAoB,uBAAuB,OAAO,oBAAoB;AAC1E,eAAO,uBAAuB,UAAU,MAAM,OAAO,iBAAiB,uBAAuB,kBAAkB,aAAa;AAAA,MAC9H;AACA,eAAS,oBAAoB,cAAc,MAAM,wBAAwB,eAAe;AACtF,0BAAkB,wBAAwB,YAAY;AAG/B,SAAC,uBAAuB,OAAO,oBAAoB;AAC1E,eAAO,iBAAiB,cAAc,IAAI;AAAA,MAC5C;AACA,eAAS,wBAAwB,kBAAkB,wBAAwB;AACzE,0BAAkB,wBAAwB,gBAAgB;AAAA,MAC5D;AACA,eAAS,+CAA+C,kBAAkB;AACxE,YAAI,OAAO,iBAAiB;AAI5B,YAAI,QAAQ;AAEZ,eAAO,MAAM;AACX,cAAI,KAAK,aAAa,cAAc;AAClC,gBAAI,OAAO,KAAK;AAEhB,gBAAI,SAAS,mBAAmB;AAC9B,kBAAI,UAAU,GAAG;AACf,uBAAO,yBAAyB,IAAI;AAAA,cAC9C,OAAe;AACL;AAAA,cACD;AAAA,YACT,WAAiB,SAAS,uBAAuB,SAAS,gCAAgC,SAAS,6BAA6B;AACxH;AAAA,YACD;AAAA,UACF;AAED,iBAAO,KAAK;AAAA,QACb;AAGD,eAAO;AAAA,MACT;AAIA,eAAS,0BAA0B,gBAAgB;AACjD,YAAI,OAAO,eAAe;AAI1B,YAAI,QAAQ;AAEZ,eAAO,MAAM;AACX,cAAI,KAAK,aAAa,cAAc;AAClC,gBAAI,OAAO,KAAK;AAEhB,gBAAI,SAAS,uBAAuB,SAAS,gCAAgC,SAAS,6BAA6B;AACjH,kBAAI,UAAU,GAAG;AACf,uBAAO;AAAA,cACjB,OAAe;AACL;AAAA,cACD;AAAA,YACT,WAAiB,SAAS,mBAAmB;AACrC;AAAA,YACD;AAAA,UACF;AAED,iBAAO,KAAK;AAAA,QACb;AAED,eAAO;AAAA,MACT;AACA,eAAS,wBAAwB,WAAW;AAE1C,yBAAiB,SAAS;AAAA,MAC5B;AACA,eAAS,+BAA+B,kBAAkB;AAExD,yBAAiB,gBAAgB;AAAA,MACnC;AACA,eAAS,oCAAoC,YAAY;AACvD,eAAO,eAAe,UAAU,eAAe;AAAA,MACjD;AACA,eAAS,yCAAyC,iBAAiB,cAAc,MAAM,kBAAkB;AACvG,YAAI,gBAAgB;AACpB,8BAAsB,aAAa,WAAW,MAAM,kBAAkB,aAAa;AAAA,MACrF;AACA,eAAS,gCAAgC,YAAY,aAAa,gBAAgB,cAAc,MAAM,kBAAkB;AACtH,YAAI,YAAY,4BAA4B,MAAM,MAAM;AACtD,cAAI,gBAAgB;AACpB,gCAAsB,aAAa,WAAW,MAAM,kBAAkB,aAAa;AAAA,QACpF;AAAA,MACH;AACA,eAAS,qCAAqC,iBAAiB,UAAU;AACvE;AACE,cAAI,SAAS,aAAa,cAAc;AACtC,4CAAgC,iBAAiB,QAAQ;AAAA,UAC1D,WAAU,SAAS,aAAa;AAAc;AAAA,eAAO;AACpD,yCAA6B,iBAAiB,QAAQ;AAAA,UACvD;AAAA,QACF;AAAA,MACH;AACA,eAAS,4CAA4C,gBAAgB,UAAU;AAC7E;AAEE,cAAI,aAAa,eAAe;AAEhC,cAAI,eAAe,MAAM;AACvB,gBAAI,SAAS,aAAa,cAAc;AACtC,8CAAgC,YAAY,QAAQ;AAAA,YACrD,WAAU,SAAS,aAAa;AAAc;AAAA,iBAAO;AACpD,2CAA6B,YAAY,QAAQ;AAAA,YAClD;AAAA,UACF;AAAA,QACF;AAAA,MACH;AACA,eAAS,sBAAsB,YAAY,aAAa,gBAAgB,UAAU,kBAAkB;AAClG;AACE,cAAI,oBAAoB,YAAY,4BAA4B,MAAM,MAAM;AAC1E,gBAAI,SAAS,aAAa,cAAc;AACtC,8CAAgC,gBAAgB,QAAQ;AAAA,YACzD,WAAU,SAAS,aAAa;AAAc;AAAA,iBAAO;AACpD,2CAA6B,gBAAgB,QAAQ;AAAA,YACtD;AAAA,UACF;AAAA,QACF;AAAA,MACH;AACA,eAAS,4CAA4C,iBAAiB,MAAM,OAAO;AACjF;AACE,yCAA+B,iBAAiB,IAAI;AAAA,QACrD;AAAA,MACH;AACA,eAAS,gDAAgD,iBAAiB,MAAM;AAC9E;AACE,sCAA4B,iBAAiB,IAAI;AAAA,QAClD;AAAA,MACH;AACA,eAAS,mDAAmD,gBAAgB,MAAM,OAAO;AACvF;AAEE,cAAI,aAAa,eAAe;AAChC,cAAI,eAAe;AAAM,2CAA+B,YAAY,IAAI;AAAA,QACzE;AAAA,MACH;AACA,eAAS,uDAAuD,gBAAgB,MAAM;AACpF;AAEE,cAAI,aAAa,eAAe;AAChC,cAAI,eAAe;AAAM,wCAA4B,YAAY,IAAI;AAAA,QACtE;AAAA,MACH;AACA,eAAS,6BAA6B,YAAY,aAAa,gBAAgB,MAAM,OAAO,kBAAkB;AAC5G;AACE,cAAI,oBAAoB,YAAY,4BAA4B,MAAM,MAAM;AAC1E,2CAA+B,gBAAgB,IAAI;AAAA,UACpD;AAAA,QACF;AAAA,MACH;AACA,eAAS,iCAAiC,YAAY,aAAa,gBAAgB,MAAM,kBAAkB;AACzG;AACE,cAAI,oBAAoB,YAAY,4BAA4B,MAAM,MAAM;AAC1E,wCAA4B,gBAAgB,IAAI;AAAA,UACjD;AAAA,QACF;AAAA,MACH;AACA,eAAS,wBAAwB,iBAAiB;AAChD;AAGE,gBAAM,iGAAiG,gBAAgB,SAAS,YAAa,CAAA;AAAA,QAC9I;AAAA,MACH;AACA,eAAS,mBAAmB,gBAAgB;AAC1C,mCAA2B,cAAc;AAAA,MAC3C;AAEA,UAAI,YAAY,KAAK,SAAS,SAAS,EAAE,EAAE,MAAM,CAAC;AAClD,UAAI,sBAAsB,kBAAkB;AAC5C,UAAI,mBAAmB,kBAAkB;AACzC,UAAI,+BAA+B,sBAAsB;AACzD,UAAI,2BAA2B,mBAAmB;AAClD,UAAI,mCAAmC,sBAAsB;AAC7D,UAAI,6BAA6B,oBAAoB;AACrD,eAAS,sBAAsB,MAAM;AAGnC,eAAO,KAAK,mBAAmB;AAC/B,eAAO,KAAK,gBAAgB;AAC5B,eAAO,KAAK,wBAAwB;AACpC,eAAO,KAAK,gCAAgC;AAC5C,eAAO,KAAK,0BAA0B;AAAA,MACxC;AACA,eAAS,kBAAkB,UAAU,MAAM;AACzC,aAAK,mBAAmB,IAAI;AAAA,MAC9B;AACA,eAAS,oBAAoB,UAAU,MAAM;AAC3C,aAAK,4BAA4B,IAAI;AAAA,MACvC;AACA,eAAS,sBAAsB,MAAM;AACnC,aAAK,4BAA4B,IAAI;AAAA,MACvC;AACA,eAAS,wBAAwB,MAAM;AACrC,eAAO,CAAC,CAAC,KAAK,4BAA4B;AAAA,MAC5C;AAQA,eAAS,2BAA2B,YAAY;AAC9C,YAAI,aAAa,WAAW,mBAAmB;AAE/C,YAAI,YAAY;AAEd,iBAAO;AAAA,QACR;AAID,YAAI,aAAa,WAAW;AAE5B,eAAO,YAAY;AASjB,uBAAa,WAAW,4BAA4B,KAAK,WAAW,mBAAmB;AAEvF,cAAI,YAAY;AAcd,gBAAI,YAAY,WAAW;AAE3B,gBAAI,WAAW,UAAU,QAAQ,cAAc,QAAQ,UAAU,UAAU,MAAM;AAG/E,kBAAI,mBAAmB,0BAA0B,UAAU;AAE3D,qBAAO,qBAAqB,MAAM;AAShC,oBAAI,qBAAqB,iBAAiB,mBAAmB;AAE7D,oBAAI,oBAAoB;AACtB,yBAAO;AAAA,gBACR;AAMD,mCAAmB,0BAA0B,gBAAgB;AAAA,cAG9D;AAAA,YACF;AAED,mBAAO;AAAA,UACR;AAED,uBAAa;AACb,uBAAa,WAAW;AAAA,QACzB;AAED,eAAO;AAAA,MACT;AAMA,eAAS,oBAAoB,MAAM;AACjC,YAAI,OAAO,KAAK,mBAAmB,KAAK,KAAK,4BAA4B;AAEzE,YAAI,MAAM;AACR,cAAI,KAAK,QAAQ,iBAAiB,KAAK,QAAQ,YAAY,KAAK,QAAQ,qBAAqB,KAAK,QAAQ,UAAU;AAClH,mBAAO;AAAA,UACb,OAAW;AACL,mBAAO;AAAA,UACR;AAAA,QACF;AAED,eAAO;AAAA,MACT;AAMA,eAAS,oBAAoB,MAAM;AACjC,YAAI,KAAK,QAAQ,iBAAiB,KAAK,QAAQ,UAAU;AAGvD,iBAAO,KAAK;AAAA,QACb;AAID,cAAM,IAAI,MAAM,wCAAwC;AAAA,MAC1D;AACA,eAAS,6BAA6B,MAAM;AAC1C,eAAO,KAAK,gBAAgB,KAAK;AAAA,MACnC;AACA,eAAS,iBAAiB,MAAM,OAAO;AACrC,aAAK,gBAAgB,IAAI;AAAA,MAC3B;AACA,eAAS,oBAAoB,MAAM;AACjC,YAAI,qBAAqB,KAAK,wBAAwB;AAEtD,YAAI,uBAAuB,QAAW;AACpC,+BAAqB,KAAK,wBAAwB,IAAI,oBAAI,IAAG;AAAA,QAC9D;AAED,eAAO;AAAA,MACT;AAEA,UAAI,qBAAqB,CAAA;AACzB,UAAI,2BAA2B,qBAAqB;AAEpD,eAAS,8BAA8B,SAAS;AAC9C;AACE,cAAI,SAAS;AACX,gBAAI,QAAQ,QAAQ;AACpB,gBAAI,QAAQ,qCAAqC,QAAQ,MAAM,QAAQ,SAAS,QAAQ,MAAM,OAAO,IAAI;AACzG,qCAAyB,mBAAmB,KAAK;AAAA,UACvD,OAAW;AACL,qCAAyB,mBAAmB,IAAI;AAAA,UACjD;AAAA,QACF;AAAA,MACH;AAEA,eAAS,eAAe,WAAW,QAAQ,UAAU,eAAe,SAAS;AAC3E;AAEE,cAAIU,OAAM,SAAS,KAAK,KAAK,cAAc;AAE3C,mBAAS,gBAAgB,WAAW;AAClC,gBAAIA,KAAI,WAAW,YAAY,GAAG;AAChC,kBAAI,UAAU;AAId,kBAAI;AAGF,oBAAI,OAAO,UAAU,YAAY,MAAM,YAAY;AAEjD,sBAAI,MAAM,OAAO,iBAAiB,iBAAiB,OAAO,WAAW,YAAY,eAAe,+FAAoG,OAAO,UAAU,YAAY,IAAI,iGAAsG;AAC3U,sBAAI,OAAO;AACX,wBAAM;AAAA,gBACP;AAED,0BAAU,UAAU,YAAY,EAAE,QAAQ,cAAc,eAAe,UAAU,MAAM,8CAA8C;AAAA,cACtI,SAAQ,IAAI;AACX,0BAAU;AAAA,cACX;AAED,kBAAI,WAAW,EAAE,mBAAmB,QAAQ;AAC1C,8CAA8B,OAAO;AAErC,sBAAM,4RAAqT,iBAAiB,eAAe,UAAU,cAAc,OAAO,OAAO;AAEjY,8CAA8B,IAAI;AAAA,cACnC;AAED,kBAAI,mBAAmB,SAAS,EAAE,QAAQ,WAAW,qBAAqB;AAGxE,mCAAmB,QAAQ,OAAO,IAAI;AACtC,8CAA8B,OAAO;AAErC,sBAAM,sBAAsB,UAAU,QAAQ,OAAO;AAErD,8CAA8B,IAAI;AAAA,cACnC;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACH;AAEA,UAAI,aAAa,CAAA;AACjB,UAAI;AAEJ;AACE,qBAAa,CAAA;AAAA,MACf;AAEA,UAAIxH,SAAQ;AAEZ,eAAS,aAAa,cAAc;AAClC,eAAO;AAAA,UACL,SAAS;AAAA,QACb;AAAA,MACA;AAEA,eAAS,IAAI,QAAQ,OAAO;AAC1B,YAAIA,SAAQ,GAAG;AACb;AACE,kBAAM,iBAAiB;AAAA,UACxB;AAED;AAAA,QACD;AAED;AACE,cAAI,UAAU,WAAWA,MAAK,GAAG;AAC/B,kBAAM,0BAA0B;AAAA,UACjC;AAAA,QACF;AAED,eAAO,UAAU,WAAWA,MAAK;AACjC,mBAAWA,MAAK,IAAI;AAEpB;AACE,qBAAWA,MAAK,IAAI;AAAA,QACrB;AAED,QAAAA;AAAA,MACF;AAEA,eAAS,KAAK,QAAQ,OAAO,OAAO;AAClC,QAAAA;AACA,mBAAWA,MAAK,IAAI,OAAO;AAE3B;AACE,qBAAWA,MAAK,IAAI;AAAA,QACrB;AAED,eAAO,UAAU;AAAA,MACnB;AAEA,UAAI;AAEJ;AACE,4CAAoC,CAAA;AAAA,MACtC;AAEA,UAAI,qBAAqB,CAAA;AAEzB;AACE,eAAO,OAAO,kBAAkB;AAAA,MAClC;AAGA,UAAI,qBAAqB,aAAa,kBAAkB;AAExD,UAAI,4BAA4B,aAAa,KAAK;AAIlD,UAAI,kBAAkB;AAEtB,eAAS,mBAAmByG,iBAAgB,WAAW,6BAA6B;AAClF;AACE,cAAI,+BAA+B,kBAAkB,SAAS,GAAG;AAK/D,mBAAO;AAAA,UACR;AAED,iBAAO,mBAAmB;AAAA,QAC3B;AAAA,MACH;AAEA,eAAS,aAAaA,iBAAgB,iBAAiB,eAAe;AACpE;AACE,cAAI,WAAWA,gBAAe;AAC9B,mBAAS,8CAA8C;AACvD,mBAAS,4CAA4C;AAAA,QACtD;AAAA,MACH;AAEA,eAAS,iBAAiBA,iBAAgB,iBAAiB;AACzD;AACE,cAAI,OAAOA,gBAAe;AAC1B,cAAI,eAAe,KAAK;AAExB,cAAI,CAAC,cAAc;AACjB,mBAAO;AAAA,UACR;AAKD,cAAI,WAAWA,gBAAe;AAE9B,cAAI,YAAY,SAAS,gDAAgD,iBAAiB;AACxF,mBAAO,SAAS;AAAA,UACjB;AAED,cAAI,UAAU,CAAA;AAEd,mBAAS,OAAO,cAAc;AAC5B,oBAAQ,GAAG,IAAI,gBAAgB,GAAG;AAAA,UACnC;AAED;AACE,gBAAIpG,QAAO,0BAA0BoG,eAAc,KAAK;AACxD,2BAAe,cAAc,SAAS,WAAWpG,KAAI;AAAA,UACtD;AAID,cAAI,UAAU;AACZ,yBAAaoG,iBAAgB,iBAAiB,OAAO;AAAA,UACtD;AAED,iBAAO;AAAA,QACR;AAAA,MACH;AAEA,eAAS,oBAAoB;AAC3B;AACE,iBAAO,0BAA0B;AAAA,QAClC;AAAA,MACH;AAEA,eAAS,kBAAkB,MAAM;AAC/B;AACE,cAAI,oBAAoB,KAAK;AAC7B,iBAAO,sBAAsB,QAAQ,sBAAsB;AAAA,QAC5D;AAAA,MACH;AAEA,eAAS,WAAW,OAAO;AACzB;AACE,cAAI,2BAA2B,KAAK;AACpC,cAAI,oBAAoB,KAAK;AAAA,QAC9B;AAAA,MACH;AAEA,eAAS,yBAAyB,OAAO;AACvC;AACE,cAAI,2BAA2B,KAAK;AACpC,cAAI,oBAAoB,KAAK;AAAA,QAC9B;AAAA,MACH;AAEA,eAAS,0BAA0B,OAAO,SAAS,WAAW;AAC5D;AACE,cAAI,mBAAmB,YAAY,oBAAoB;AACrD,kBAAM,IAAI,MAAM,yGAA8G;AAAA,UAC/H;AAED,eAAK,oBAAoB,SAAS,KAAK;AACvC,eAAK,2BAA2B,WAAW,KAAK;AAAA,QACjD;AAAA,MACH;AAEA,eAAS,oBAAoB,OAAO,MAAM,eAAe;AACvD;AACE,cAAI,WAAW,MAAM;AACrB,cAAI,oBAAoB,KAAK;AAG7B,cAAI,OAAO,SAAS,oBAAoB,YAAY;AAClD;AACE,kBAAI,gBAAgB,0BAA0B,KAAK,KAAK;AAExD,kBAAI,CAAC,kCAAkC,aAAa,GAAG;AACrD,kDAAkC,aAAa,IAAI;AAEnD,sBAAM,kLAA4L,eAAe,aAAa;AAAA,cAC/N;AAAA,YACF;AAED,mBAAO;AAAA,UACR;AAED,cAAI,eAAe,SAAS;AAE5B,mBAAS,cAAc,cAAc;AACnC,gBAAI,EAAE,cAAc,oBAAoB;AACtC,oBAAM,IAAI,OAAO,0BAA0B,KAAK,KAAK,aAAa,8BAA+B,aAAa,wCAAyC;AAAA,YACxJ;AAAA,UACF;AAED;AACE,gBAAIpG,QAAO,0BAA0B,KAAK,KAAK;AAC/C,2BAAe,mBAAmB,cAAc,iBAAiBA,KAAI;AAAA,UACtE;AAED,iBAAO,OAAO,CAAA,GAAI,eAAe,YAAY;AAAA,QAC9C;AAAA,MACH;AAEA,eAAS,oBAAoBoG,iBAAgB;AAC3C;AACE,cAAI,WAAWA,gBAAe;AAI9B,cAAI,6BAA6B,YAAY,SAAS,6CAA6C;AAGnG,4BAAkB,mBAAmB;AACrC,eAAK,oBAAoB,4BAA4BA,eAAc;AACnE,eAAK,2BAA2B,0BAA0B,SAASA,eAAc;AACjF,iBAAO;AAAA,QACR;AAAA,MACH;AAEA,eAAS,0BAA0BA,iBAAgB,MAAM,WAAW;AAClE;AACE,cAAI,WAAWA,gBAAe;AAE9B,cAAI,CAAC,UAAU;AACb,kBAAM,IAAI,MAAM,kHAAuH;AAAA,UACxI;AAED,cAAI,WAAW;AAIb,gBAAI,gBAAgB,oBAAoBA,iBAAgB,MAAM,eAAe;AAC7E,qBAAS,4CAA4C;AAGrD,gBAAI,2BAA2BA,eAAc;AAC7C,gBAAI,oBAAoBA,eAAc;AAEtC,iBAAK,oBAAoB,eAAeA,eAAc;AACtD,iBAAK,2BAA2B,WAAWA,eAAc;AAAA,UAC/D,OAAW;AACL,gBAAI,2BAA2BA,eAAc;AAC7C,iBAAK,2BAA2B,WAAWA,eAAc;AAAA,UAC1D;AAAA,QACF;AAAA,MACH;AAEA,eAAS,2BAA2B,OAAO;AACzC;AAGE,cAAI,CAAC,eAAe,KAAK,KAAK,MAAM,QAAQ,gBAAgB;AAC1D,kBAAM,IAAI,MAAM,+HAAoI;AAAA,UACrJ;AAED,cAAI,OAAO;AAEX,aAAG;AACD,oBAAQ,KAAK,KAAG;AAAA,cACd,KAAK;AACH,uBAAO,KAAK,UAAU;AAAA,cAExB,KAAK,gBACH;AACE,oBAAI,YAAY,KAAK;AAErB,oBAAI,kBAAkB,SAAS,GAAG;AAChC,yBAAO,KAAK,UAAU;AAAA,gBACvB;AAED;AAAA,cACD;AAAA,YACJ;AAED,mBAAO,KAAK;AAAA,UAClB,SAAa,SAAS;AAElB,gBAAM,IAAI,MAAM,gHAAqH;AAAA,QACtI;AAAA,MACH;AAEA,UAAI,aAAa;AACjB,UAAI,iBAAiB;AAErB,UAAI,YAAY;AAChB,UAAI,8BAA8B;AAClC,UAAI,sBAAsB;AAC1B,eAAS,qBAAqB,UAAU;AAGtC,YAAI,cAAc,MAAM;AACtB,sBAAY,CAAC,QAAQ;AAAA,QACzB,OAAS;AAGL,oBAAU,KAAK,QAAQ;AAAA,QACxB;AAAA,MACH;AACA,eAAS,2BAA2B,UAAU;AAC5C,sCAA8B;AAC9B,6BAAqB,QAAQ;AAAA,MAC/B;AACA,eAAS,qCAAqC;AAM5C,YAAI,6BAA6B;AAC/B;QACD;AAAA,MACH;AACA,eAAS,qBAAqB;AAC5B,YAAI,CAAC,uBAAuB,cAAc,MAAM;AAE9C,gCAAsB;AACtB,cAAI1G,KAAI;AACR,cAAI,yBAAyB;AAE7B,cAAI;AACF,gBAAI,SAAS;AACb,gBAAI,QAAQ;AAGZ,qCAAyB,qBAAqB;AAE9C,mBAAOA,KAAI,MAAM,QAAQA,MAAK;AAC5B,kBAAI,WAAW,MAAMA,EAAC;AAEtB,iBAAG;AACD,2BAAW,SAAS,MAAM;AAAA,cACpC,SAAiB,aAAa;AAAA,YACvB;AAED,wBAAY;AACZ,0CAA8B;AAAA,UAC/B,SAAQK,QAAO;AAEd,gBAAI,cAAc,MAAM;AACtB,0BAAY,UAAU,MAAML,KAAI,CAAC;AAAA,YAClC;AAGD,6BAAiB,mBAAmB,kBAAkB;AACtD,kBAAMK;AAAA,UACZ,UAAc;AACR,qCAAyB,sBAAsB;AAC/C,kCAAsB;AAAA,UACvB;AAAA,QACF;AAED,eAAO;AAAA,MACT;AAMA,UAAI,YAAY,CAAA;AAChB,UAAI,iBAAiB;AACrB,UAAI,mBAAmB;AACvB,UAAI,gBAAgB;AACpB,UAAI,UAAU,CAAA;AACd,UAAI,eAAe;AACnB,UAAI,sBAAsB;AAC1B,UAAI,gBAAgB;AACpB,UAAI,sBAAsB;AAC1B,eAAS,cAAcqG,iBAAgB;AACrC;AACA,gBAAQA,gBAAe,QAAQ,YAAY;AAAA,MAC7C;AACA,eAAS,gBAAgBA,iBAAgB;AACvC;AACA,eAAO;AAAA,MACT;AACA,eAAS,YAAY;AACnB,YAAI,WAAW;AACf,YAAI,mBAAmB;AACvB,YAAI,KAAK,mBAAmB,CAAC,cAAc,gBAAgB;AAC3D,eAAO,GAAG,SAAS,EAAE,IAAI;AAAA,MAC3B;AACA,eAAS,aAAaA,iBAAgB,eAAe;AAenD;AACA,kBAAU,gBAAgB,IAAI;AAC9B,kBAAU,gBAAgB,IAAI;AAC9B,2BAAmBA;AACnB,wBAAgB;AAAA,MAClB;AACA,eAAS,WAAWA,iBAAgB,eAAezG,QAAO;AACxD;AACA,gBAAQ,cAAc,IAAI;AAC1B,gBAAQ,cAAc,IAAI;AAC1B,gBAAQ,cAAc,IAAI;AAC1B,8BAAsByG;AACtB,YAAI,uBAAuB;AAC3B,YAAI,eAAe;AAGnB,YAAI,aAAa,aAAa,oBAAoB,IAAI;AACtD,YAAI,SAAS,uBAAuB,EAAE,KAAK;AAC3C,YAAI,OAAOzG,SAAQ;AACnB,YAAI,SAAS,aAAa,aAAa,IAAI;AAG3C,YAAI,SAAS,IAAI;AAcf,cAAI,uBAAuB,aAAa,aAAa;AAErD,cAAI,mBAAmB,KAAK,wBAAwB;AAEpD,cAAI,eAAe,SAAS,iBAAiB,SAAS,EAAE;AAExD,cAAI,eAAe,UAAU;AAC7B,cAAI,mBAAmB,aAAa;AAGpC,cAAI,eAAe,aAAa,aAAa,IAAI;AACjD,cAAI,gBAAgB,QAAQ;AAC5B,cAAI,KAAK,gBAAgB;AACzB,cAAI,WAAW,cAAc;AAC7B,0BAAgB,KAAK,eAAe;AACpC,gCAAsB;AAAA,QAC1B,OAAS;AAEL,cAAI,UAAU,QAAQ;AAEtB,cAAI,MAAM,UAAU;AAEpB,cAAI,YAAY;AAChB,0BAAgB,KAAK,SAAS;AAC9B,gCAAsB;AAAA,QACvB;AAAA,MACH;AACA,eAAS,uBAAuByG,iBAAgB;AAC9C;AAGA,YAAI,cAAcA,gBAAe;AAEjC,YAAI,gBAAgB,MAAM;AACxB,cAAI,gBAAgB;AACpB,cAAI,YAAY;AAChB,uBAAaA,iBAAgB,aAAa;AAC1C,qBAAWA,iBAAgB,eAAe,SAAS;AAAA,QACpD;AAAA,MACH;AAEA,eAAS,aAAapD,SAAQ;AAC5B,eAAO,KAAK,MAAMA,OAAM;AAAA,MAC1B;AAEA,eAAS,cAAc,IAAI;AACzB,eAAO,KAAK,aAAa,EAAE,IAAI;AAAA,MACjC;AAEA,eAAS,eAAeoD,iBAAgB;AAMtC,eAAOA,oBAAmB,kBAAkB;AAC1C,6BAAmB,UAAU,EAAE,cAAc;AAC7C,oBAAU,cAAc,IAAI;AAC5B,0BAAgB,UAAU,EAAE,cAAc;AAC1C,oBAAU,cAAc,IAAI;AAAA,QAC7B;AAED,eAAOA,oBAAmB,qBAAqB;AAC7C,gCAAsB,QAAQ,EAAE,YAAY;AAC5C,kBAAQ,YAAY,IAAI;AACxB,gCAAsB,QAAQ,EAAE,YAAY;AAC5C,kBAAQ,YAAY,IAAI;AACxB,0BAAgB,QAAQ,EAAE,YAAY;AACtC,kBAAQ,YAAY,IAAI;AAAA,QACzB;AAAA,MACH;AACA,eAAS,0BAA0B;AACjC;AAEA,YAAI,wBAAwB,MAAM;AAChC,iBAAO;AAAA,YACL,IAAI;AAAA,YACJ,UAAU;AAAA,UAChB;AAAA,QACA,OAAS;AACL,iBAAO;AAAA,QACR;AAAA,MACH;AACA,eAAS,4BAA4BA,iBAAgB,kBAAkB;AACrE;AACA,gBAAQ,cAAc,IAAI;AAC1B,gBAAQ,cAAc,IAAI;AAC1B,gBAAQ,cAAc,IAAI;AAC1B,wBAAgB,iBAAiB;AACjC,8BAAsB,iBAAiB;AACvC,8BAAsBA;AAAA,MACxB;AAEA,eAAS,qBAAqB;AAC5B;AACE,cAAI,CAAC,eAAc,GAAI;AACrB,kBAAM,yEAA8E;AAAA,UACrF;AAAA,QACF;AAAA,MACH;AAIA,UAAI,uBAAuB;AAC3B,UAAI,yBAAyB;AAC7B,UAAI,cAAc;AAGlB,UAAI,uBAAuB;AAE3B,UAAI,kBAAkB;AAEtB,eAAS,kBAAkB;AACzB;AACE,cAAI,aAAa;AACf,kBAAM,6EAA6E;AAAA,UACpF;AAAA,QACF;AAAA,MACH;AAEA,eAAS,gCAAgC;AACvC;AACE,iCAAuB;AAAA,QACxB;AAAA,MACH;AACA,eAAS,qCAAqC;AAC5C;AACE,iBAAO;AAAA,QACR;AAAA,MACH;AAEA,eAAS,oBAAoB,OAAO;AAElC,YAAI,iBAAiB,MAAM,UAAU;AACrC,iCAAyB,uCAAuC,cAAc;AAC9E,+BAAuB;AACvB,sBAAc;AACd,0BAAkB;AAClB,+BAAuB;AACvB,eAAO;AAAA,MACT;AAEA,eAAS,oDAAoD,OAAO,kBAAkB,aAAa;AAEjG,iCAAyB,8CAA8C,gBAAgB;AACvF,+BAAuB;AACvB,sBAAc;AACd,0BAAkB;AAClB,+BAAuB;AAEvB,YAAI,gBAAgB,MAAM;AACxB,sCAA4B,OAAO,WAAW;AAAA,QAC/C;AAED,eAAO;AAAA,MACT;AAEA,eAAS,uBAAuB,aAAa,UAAU;AACrD;AACE,kBAAQ,YAAY,KAAG;AAAA,YACrB,KAAK,UACH;AACE,mDAAqC,YAAY,UAAU,eAAe,QAAQ;AAClF;AAAA,YACD;AAAA,YAEH,KAAK,eACH;AACE,kBAAI,oBAAoB,YAAY,OAAO,oBAAoB;AAC/D;AAAA,gBAAsB,YAAY;AAAA,gBAAM,YAAY;AAAA,gBAAe,YAAY;AAAA,gBAAW;AAAA;AAAA,gBAC1F;AAAA,cAAgB;AAChB;AAAA,YACD;AAAA,YAEH,KAAK,mBACH;AACE,kBAAI,gBAAgB,YAAY;AAChC,kBAAI,cAAc,eAAe;AAAM,4DAA4C,cAAc,YAAY,QAAQ;AACrH;AAAA,YACD;AAAA,UACJ;AAAA,QACF;AAAA,MACH;AAEA,eAAS,yBAAyB,aAAa,UAAU;AACvD,+BAAuB,aAAa,QAAQ;AAC5C,YAAI,gBAAgB;AACpB,sBAAc,YAAY;AAC1B,sBAAc,SAAS;AACvB,YAAI,YAAY,YAAY;AAE5B,YAAI,cAAc,MAAM;AACtB,sBAAY,YAAY,CAAC,aAAa;AACtC,sBAAY,SAAS;AAAA,QACzB,OAAS;AACL,oBAAU,KAAK,aAAa;AAAA,QAC7B;AAAA,MACH;AAEA,eAAS,wBAAwB,aAAa,OAAO;AACnD;AACE,cAAI,sBAAsB;AAIxB;AAAA,UACD;AAED,kBAAQ,YAAY,KAAG;AAAA,YACrB,KAAK,UACH;AACE,kBAAI,kBAAkB,YAAY,UAAU;AAE5C,sBAAQ,MAAM,KAAG;AAAA,gBACf,KAAK;AACH,sBAAI,OAAO,MAAM;AACL,wBAAM;AAClB,8DAA4C,iBAAiB,IAAI;AACjE;AAAA,gBAEF,KAAK;AACH,sBAAI,OAAO,MAAM;AACjB,kEAAgD,iBAAiB,IAAI;AACrE;AAAA,cACH;AAED;AAAA,YACD;AAAA,YAEH,KAAK,eACH;AACE,kBAAI,aAAa,YAAY;AAC7B,kBAAI,cAAc,YAAY;AAC9B,kBAAI,iBAAiB,YAAY;AAEjC,sBAAQ,MAAM,KAAG;AAAA,gBACf,KAAK,eACH;AACE,sBAAI,QAAQ,MAAM;AAClB,sBAAI,SAAS,MAAM;AACnB,sBAAI,oBAAoB,YAAY,OAAO,oBAAoB;AAC/D;AAAA,oBAA6B;AAAA,oBAAY;AAAA,oBAAa;AAAA,oBAAgB;AAAA,oBAAO;AAAA;AAAA,oBAC7E;AAAA,kBAAgB;AAChB;AAAA,gBACD;AAAA,gBAEH,KAAK,UACH;AACE,sBAAI,QAAQ,MAAM;AAElB,sBAAI,qBAAqB,YAAY,OAAO,oBAAoB;AAEhE;AAAA,oBAAiC;AAAA,oBAAY;AAAA,oBAAa;AAAA,oBAAgB;AAAA;AAAA,oBAC1E;AAAA,kBAAiB;AACjB;AAAA,gBACD;AAAA,cACJ;AAED;AAAA,YACD;AAAA,YAEH,KAAK,mBACH;AACE,kBAAI,gBAAgB,YAAY;AAChC,kBAAI,kBAAkB,cAAc;AACpC,kBAAI,oBAAoB;AAAM,wBAAQ,MAAM,KAAG;AAAA,kBAC7C,KAAK;AACH,wBAAI,SAAS,MAAM;AACL,0BAAM;AACpB,uEAAmD,iBAAiB,MAAM;AAC1E;AAAA,kBAEF,KAAK;AACH,wBAAI,SAAS,MAAM;AACnB,2EAAuD,iBAAiB,MAAM;AAC9E;AAAA,gBACH;AACD;AAAA,YACD;AAAA,YAEH;AACE;AAAA,UACH;AAAA,QACF;AAAA,MACH;AAEA,eAAS,0BAA0B,aAAa,OAAO;AACrD,cAAM,QAAQ,MAAM,QAAQ,CAAC,YAAY;AACzC,gCAAwB,aAAa,KAAK;AAAA,MAC5C;AAEA,eAAS,WAAW,OAAO,cAAc;AACvC,gBAAQ,MAAM,KAAG;AAAA,UACf,KAAK,eACH;AACE,gBAAI,OAAO,MAAM;AACL,kBAAM;AAClB,gBAAI,WAAW,mBAAmB,cAAc,IAAI;AAEpD,gBAAI,aAAa,MAAM;AACrB,oBAAM,YAAY;AAClB,qCAAuB;AACvB,uCAAyB,wBAAwB,QAAQ;AACzD,qBAAO;AAAA,YACR;AAED,mBAAO;AAAA,UACR;AAAA,UAEH,KAAK,UACH;AACE,gBAAI,OAAO,MAAM;AACjB,gBAAI,eAAe,uBAAuB,cAAc,IAAI;AAE5D,gBAAI,iBAAiB,MAAM;AACzB,oBAAM,YAAY;AAClB,qCAAuB;AAEvB,uCAAyB;AACzB,qBAAO;AAAA,YACR;AAED,mBAAO;AAAA,UACR;AAAA,UAEH,KAAK,mBACH;AACE,gBAAI,mBAAmB,2BAA2B,YAAY;AAE9D,gBAAI,qBAAqB,MAAM;AAC7B,kBAAI,gBAAgB;AAAA,gBAClB,YAAY;AAAA,gBACZ,aAAa,wBAAyB;AAAA,gBACtC,WAAW;AAAA,cACvB;AACU,oBAAM,gBAAgB;AAKtB,kBAAI,qBAAqB,kCAAkC,gBAAgB;AAC3E,iCAAmB,SAAS;AAC5B,oBAAM,QAAQ;AACd,qCAAuB;AAGvB,uCAAyB;AACzB,qBAAO;AAAA,YACR;AAED,mBAAO;AAAA,UACR;AAAA,UAEH;AACE,mBAAO;AAAA,QACV;AAAA,MACH;AAEA,eAAS,6BAA6B,OAAO;AAC3C,gBAAQ,MAAM,OAAO,oBAAoB,WAAW,MAAM,QAAQ,gBAAgB;AAAA,MACpF;AAEA,eAAS,yBAAyB,OAAO;AACvC,cAAM,IAAI,MAAM,yFAA8F;AAAA,MAChH;AAEA,eAAS,iCAAiC,OAAO;AAC/C,YAAI,CAAC,aAAa;AAChB;AAAA,QACD;AAED,YAAI,eAAe;AAEnB,YAAI,CAAC,cAAc;AACjB,cAAI,6BAA6B,KAAK,GAAG;AACvC,oCAAwB,sBAAsB,KAAK;AACnD;UACD;AAGD,oCAA0B,sBAAsB,KAAK;AACrD,wBAAc;AACd,iCAAuB;AACvB;AAAA,QACD;AAED,YAAI,yBAAyB;AAE7B,YAAI,CAAC,WAAW,OAAO,YAAY,GAAG;AACpC,cAAI,6BAA6B,KAAK,GAAG;AACvC,oCAAwB,sBAAsB,KAAK;AACnD;UACD;AAKD,yBAAe,yBAAyB,sBAAsB;AAC9D,cAAI,2BAA2B;AAE/B,cAAI,CAAC,gBAAgB,CAAC,WAAW,OAAO,YAAY,GAAG;AAErD,sCAA0B,sBAAsB,KAAK;AACrD,0BAAc;AACd,mCAAuB;AACvB;AAAA,UACD;AAMD,mCAAyB,0BAA0B,sBAAsB;AAAA,QAC1E;AAAA,MACH;AAEA,eAAS,6BAA6B,OAAO,uBAAuB,aAAa;AAE/E,YAAI,WAAW,MAAM;AACrB,YAAI,0BAA0B,CAAC;AAC/B,YAAI,gBAAgB,gBAAgB,UAAU,MAAM,MAAM,MAAM,eAAe,uBAAuB,aAAa,OAAO,uBAAuB;AAEjJ,cAAM,cAAc;AAGpB,YAAI,kBAAkB,MAAM;AAC1B,iBAAO;AAAA,QACR;AAED,eAAO;AAAA,MACT;AAEA,eAAS,iCAAiC,OAAO;AAE/C,YAAI,eAAe,MAAM;AACzB,YAAI,cAAc,MAAM;AACxB,YAAI,eAAe,oBAAoB,cAAc,aAAa,KAAK;AAEvE,YAAI,cAAc;AAGhB,cAAI,cAAc;AAElB,cAAI,gBAAgB,MAAM;AACxB,oBAAQ,YAAY,KAAG;AAAA,cACrB,KAAK,UACH;AACE,oBAAI,kBAAkB,YAAY,UAAU;AAC5C,oBAAI,oBAAoB,YAAY,OAAO,oBAAoB;AAC/D;AAAA,kBAAyC;AAAA,kBAAiB;AAAA,kBAAc;AAAA;AAAA,kBACxE;AAAA,gBAAgB;AAChB;AAAA,cACD;AAAA,cAEH,KAAK,eACH;AACE,oBAAI,aAAa,YAAY;AAC7B,oBAAI,cAAc,YAAY;AAC9B,oBAAI,iBAAiB,YAAY;AAEjC,oBAAI,sBAAsB,YAAY,OAAO,oBAAoB;AAEjE;AAAA,kBAAgC;AAAA,kBAAY;AAAA,kBAAa;AAAA,kBAAgB;AAAA,kBAAc;AAAA;AAAA,kBACvF;AAAA,gBAAkB;AAClB;AAAA,cACD;AAAA,YACJ;AAAA,UACF;AAAA,QACF;AAED,eAAO;AAAA,MACT;AAEA,eAAS,qCAAqC,OAAO;AAEnD,YAAI,gBAAgB,MAAM;AAC1B,YAAI,mBAAmB,kBAAkB,OAAO,cAAc,aAAa;AAE3E,YAAI,CAAC,kBAAkB;AACrB,gBAAM,IAAI,MAAM,qHAA0H;AAAA,QAC3I;AAED,gCAAwB,kBAAkB,KAAK;AAAA,MACjD;AAEA,eAAS,mCAAmC,OAAO;AAEjD,YAAI,gBAAgB,MAAM;AAC1B,YAAI,mBAAmB,kBAAkB,OAAO,cAAc,aAAa;AAE3E,YAAI,CAAC,kBAAkB;AACrB,gBAAM,IAAI,MAAM,qHAA0H;AAAA,QAC3I;AAED,eAAO,+CAA+C,gBAAgB;AAAA,MACxE;AAEA,eAAS,oBAAoB,OAAO;AAClC,YAAI,SAAS,MAAM;AAEnB,eAAO,WAAW,QAAQ,OAAO,QAAQ,iBAAiB,OAAO,QAAQ,YAAY,OAAO,QAAQ,mBAAmB;AACrH,mBAAS,OAAO;AAAA,QACjB;AAED,+BAAuB;AAAA,MACzB;AAEA,eAAS,kBAAkB,OAAO;AAEhC,YAAI,UAAU,sBAAsB;AAGlC,iBAAO;AAAA,QACR;AAED,YAAI,CAAC,aAAa;AAIhB,8BAAoB,KAAK;AACzB,wBAAc;AACd,iBAAO;AAAA,QACR;AAMD,YAAI,MAAM,QAAQ,aAAa,MAAM,QAAQ,iBAAiB,oCAAoC,MAAM,IAAI,KAAK,CAAC,qBAAqB,MAAM,MAAM,MAAM,aAAa,IAAI;AACxK,cAAI,eAAe;AAEnB,cAAI,cAAc;AAChB,gBAAI,6BAA6B,KAAK,GAAG;AACvC,wCAA0B,KAAK;AAC/B;YACR,OAAa;AACL,qBAAO,cAAc;AACnB,yCAAyB,OAAO,YAAY;AAC5C,+BAAe,yBAAyB,YAAY;AAAA,cACrD;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAED,4BAAoB,KAAK;AAEzB,YAAI,MAAM,QAAQ,mBAAmB;AACnC,mCAAyB,mCAAmC,KAAK;AAAA,QACrE,OAAS;AACL,mCAAyB,uBAAuB,yBAAyB,MAAM,SAAS,IAAI;AAAA,QAC7F;AAED,eAAO;AAAA,MACT;AAEA,eAAS,yBAAyB;AAChC,eAAO,eAAe,2BAA2B;AAAA,MACnD;AAEA,eAAS,0BAA0B,OAAO;AACxC,YAAI,eAAe;AAEnB,eAAO,cAAc;AACnB,iCAAuB,OAAO,YAAY;AAC1C,yBAAe,yBAAyB,YAAY;AAAA,QACrD;AAAA,MACH;AAEA,eAAS,sBAAsB;AAE7B,+BAAuB;AACvB,iCAAyB;AACzB,sBAAc;AACd,+BAAuB;AAAA,MACzB;AAEA,eAAS,sCAAsC;AAC7C,YAAI,oBAAoB,MAAM;AAI5B,iCAAuB,eAAe;AACtC,4BAAkB;AAAA,QACnB;AAAA,MACH;AAEA,eAAS,iBAAiB;AACxB,eAAO;AAAA,MACT;AAEA,eAAS,oBAAoBrG,QAAO;AAClC,YAAI,oBAAoB,MAAM;AAC5B,4BAAkB,CAACA,MAAK;AAAA,QAC5B,OAAS;AACL,0BAAgB,KAAKA,MAAK;AAAA,QAC3B;AAAA,MACH;AAEA,UAAI,4BAA4B,qBAAqB;AACrD,UAAI,eAAe;AACnB,eAAS,2BAA2B;AAClC,eAAO,0BAA0B;AAAA,MACnC;AAEA,UAAI,0BAA0B;AAAA,QAC5B,+BAA+B,SAAU,OAAO,UAAU;AAAA,QAAE;AAAA,QAC5D,qCAAqC,WAAY;AAAA,QAAE;AAAA,QACnD,4BAA4B,SAAU,OAAO,UAAU;AAAA,QAAE;AAAA,QACzD,2BAA2B,WAAY;AAAA,QAAE;AAAA,QACzC,wBAAwB,WAAY;AAAA,QAAE;AAAA,MACxC;AAEA;AACE,YAAI,iBAAiB,SAAU,OAAO;AACpC,cAAI,kBAAkB;AACtB,cAAI,OAAO;AAEX,iBAAO,SAAS,MAAM;AACpB,gBAAI,KAAK,OAAO,kBAAkB;AAChC,gCAAkB;AAAA,YACnB;AAED,mBAAO,KAAK;AAAA,UACb;AAED,iBAAO;AAAA,QACX;AAEE,YAAI,oBAAoB,SAAUuG,MAAK;AACrC,cAAI,QAAQ,CAAA;AACZ,UAAAA,KAAI,QAAQ,SAAU,OAAO;AAC3B,kBAAM,KAAK,KAAK;AAAA,UACtB,CAAK;AACD,iBAAO,MAAM,KAAI,EAAG,KAAK,IAAI;AAAA,QACjC;AAEE,YAAI,oCAAoC,CAAA;AACxC,YAAI,2CAA2C,CAAA;AAC/C,YAAI,2CAA2C,CAAA;AAC/C,YAAI,kDAAkD,CAAA;AACtD,YAAI,qCAAqC,CAAA;AACzC,YAAI,4CAA4C,CAAA;AAEhD,YAAI,+BAA+B,oBAAI;AAEvC,gCAAwB,gCAAgC,SAAU,OAAO,UAAU;AAEjF,cAAI,6BAA6B,IAAI,MAAM,IAAI,GAAG;AAChD;AAAA,UACD;AAED,cAAI,OAAO,SAAS,uBAAuB;AAAA,UAC3C,SAAS,mBAAmB,iCAAiC,MAAM;AACjE,8CAAkC,KAAK,KAAK;AAAA,UAC7C;AAED,cAAI,MAAM,OAAO,oBAAoB,OAAO,SAAS,8BAA8B,YAAY;AAC7F,qDAAyC,KAAK,KAAK;AAAA,UACpD;AAED,cAAI,OAAO,SAAS,8BAA8B,cAAc,SAAS,0BAA0B,iCAAiC,MAAM;AACxI,qDAAyC,KAAK,KAAK;AAAA,UACpD;AAED,cAAI,MAAM,OAAO,oBAAoB,OAAO,SAAS,qCAAqC,YAAY;AACpG,4DAAgD,KAAK,KAAK;AAAA,UAC3D;AAED,cAAI,OAAO,SAAS,wBAAwB,cAAc,SAAS,oBAAoB,iCAAiC,MAAM;AAC5H,+CAAmC,KAAK,KAAK;AAAA,UAC9C;AAED,cAAI,MAAM,OAAO,oBAAoB,OAAO,SAAS,+BAA+B,YAAY;AAC9F,sDAA0C,KAAK,KAAK;AAAA,UACrD;AAAA,QACL;AAEE,gCAAwB,sCAAsC,WAAY;AAExE,cAAI,gCAAgC,oBAAI;AAExC,cAAI,kCAAkC,SAAS,GAAG;AAChD,8CAAkC,QAAQ,SAAU,OAAO;AACzD,4CAA8B,IAAI,0BAA0B,KAAK,KAAK,WAAW;AACjF,2CAA6B,IAAI,MAAM,IAAI;AAAA,YACnD,CAAO;AACD,gDAAoC,CAAA;AAAA,UACrC;AAED,cAAI,uCAAuC,oBAAI;AAE/C,cAAI,yCAAyC,SAAS,GAAG;AACvD,qDAAyC,QAAQ,SAAU,OAAO;AAChE,mDAAqC,IAAI,0BAA0B,KAAK,KAAK,WAAW;AACxF,2CAA6B,IAAI,MAAM,IAAI;AAAA,YACnD,CAAO;AACD,uDAA2C,CAAA;AAAA,UAC5C;AAED,cAAI,uCAAuC,oBAAI;AAE/C,cAAI,yCAAyC,SAAS,GAAG;AACvD,qDAAyC,QAAQ,SAAU,OAAO;AAChE,mDAAqC,IAAI,0BAA0B,KAAK,KAAK,WAAW;AACxF,2CAA6B,IAAI,MAAM,IAAI;AAAA,YACnD,CAAO;AACD,uDAA2C,CAAA;AAAA,UAC5C;AAED,cAAI,8CAA8C,oBAAI;AAEtD,cAAI,gDAAgD,SAAS,GAAG;AAC9D,4DAAgD,QAAQ,SAAU,OAAO;AACvE,0DAA4C,IAAI,0BAA0B,KAAK,KAAK,WAAW;AAC/F,2CAA6B,IAAI,MAAM,IAAI;AAAA,YACnD,CAAO;AACD,8DAAkD,CAAA;AAAA,UACnD;AAED,cAAI,iCAAiC,oBAAI;AAEzC,cAAI,mCAAmC,SAAS,GAAG;AACjD,+CAAmC,QAAQ,SAAU,OAAO;AAC1D,6CAA+B,IAAI,0BAA0B,KAAK,KAAK,WAAW;AAClF,2CAA6B,IAAI,MAAM,IAAI;AAAA,YACnD,CAAO;AACD,iDAAqC,CAAA;AAAA,UACtC;AAED,cAAI,wCAAwC,oBAAI;AAEhD,cAAI,0CAA0C,SAAS,GAAG;AACxD,sDAA0C,QAAQ,SAAU,OAAO;AACjE,oDAAsC,IAAI,0BAA0B,KAAK,KAAK,WAAW;AACzF,2CAA6B,IAAI,MAAM,IAAI;AAAA,YACnD,CAAO;AACD,wDAA4C,CAAA;AAAA,UAC7C;AAID,cAAI,qCAAqC,OAAO,GAAG;AACjD,gBAAI,cAAc,kBAAkB,oCAAoC;AAExE,kBAAM,8TAA6U,WAAW;AAAA,UAC/V;AAED,cAAI,4CAA4C,OAAO,GAAG;AACxD,gBAAI,eAAe,kBAAkB,2CAA2C;AAEhF,kBAAM,ifAAohB,YAAY;AAAA,UACviB;AAED,cAAI,sCAAsC,OAAO,GAAG;AAClD,gBAAI,gBAAgB,kBAAkB,qCAAqC;AAE3E,kBAAM,kSAAsT,aAAa;AAAA,UAC1U;AAED,cAAI,8BAA8B,OAAO,GAAG;AAC1C,gBAAI,gBAAgB,kBAAkB,6BAA6B;AAEnE,iBAAK,okBAAumB,aAAa;AAAA,UAC1nB;AAED,cAAI,qCAAqC,OAAO,GAAG;AACjD,gBAAI,gBAAgB,kBAAkB,oCAAoC;AAE1E,iBAAK,qwBAAuzB,aAAa;AAAA,UAC10B;AAED,cAAI,+BAA+B,OAAO,GAAG;AAC3C,gBAAI,gBAAgB,kBAAkB,8BAA8B;AAEpE,iBAAK,0iBAA6kB,aAAa;AAAA,UAChmB;AAAA,QACL;AAEE,YAAI,8BAA8B,oBAAI;AAEtC,YAAI,4BAA4B,oBAAI;AAEpC,gCAAwB,6BAA6B,SAAU,OAAO,UAAU;AAC9E,cAAI,aAAa,eAAe,KAAK;AAErC,cAAI,eAAe,MAAM;AACvB,kBAAM,qIAA0I;AAEhJ;AAAA,UACD;AAGD,cAAI,0BAA0B,IAAI,MAAM,IAAI,GAAG;AAC7C;AAAA,UACD;AAED,cAAI,kBAAkB,4BAA4B,IAAI,UAAU;AAEhE,cAAI,MAAM,KAAK,gBAAgB,QAAQ,MAAM,KAAK,qBAAqB,QAAQ,aAAa,QAAQ,OAAO,SAAS,oBAAoB,YAAY;AAClJ,gBAAI,oBAAoB,QAAW;AACjC,gCAAkB,CAAA;AAClB,0CAA4B,IAAI,YAAY,eAAe;AAAA,YAC5D;AAED,4BAAgB,KAAK,KAAK;AAAA,UAC3B;AAAA,QACL;AAEE,gCAAwB,4BAA4B,WAAY;AAC9D,sCAA4B,QAAQ,SAAU,YAAY,YAAY;AACpE,gBAAI,WAAW,WAAW,GAAG;AAC3B;AAAA,YACD;AAED,gBAAI,aAAa,WAAW,CAAC;AAC7B,gBAAI,cAAc,oBAAI;AACtB,uBAAW,QAAQ,SAAU,OAAO;AAClC,0BAAY,IAAI,0BAA0B,KAAK,KAAK,WAAW;AAC/D,wCAA0B,IAAI,MAAM,IAAI;AAAA,YAChD,CAAO;AACD,gBAAI,cAAc,kBAAkB,WAAW;AAE/C,gBAAI;AACF,8BAAgB,UAAU;AAE1B,oBAAM,oTAAwU,WAAW;AAAA,YACjW,UAAgB;AACR;YACD;AAAA,UACP,CAAK;AAAA,QACL;AAEE,gCAAwB,yBAAyB,WAAY;AAC3D,8CAAoC,CAAA;AACpC,qDAA2C,CAAA;AAC3C,qDAA2C,CAAA;AAC3C,4DAAkD,CAAA;AAClD,+CAAqC,CAAA;AACrC,sDAA4C,CAAA;AAC5C,wCAA8B,oBAAI;QACtC;AAAA,MACA;AAEA,eAAS,oBAAoB,WAAW,WAAW;AACjD,YAAI,aAAa,UAAU,cAAc;AAEvC,cAAI,QAAQ,OAAO,CAAE,GAAE,SAAS;AAChC,cAAI,eAAe,UAAU;AAE7B,mBAAS,YAAY,cAAc;AACjC,gBAAI,MAAM,QAAQ,MAAM,QAAW;AACjC,oBAAM,QAAQ,IAAI,aAAa,QAAQ;AAAA,YACxC;AAAA,UACF;AAED,iBAAO;AAAA,QACR;AAED,eAAO;AAAA,MACT;AAEA,UAAI,cAAc,aAAa,IAAI;AACnC,UAAI;AAEJ;AAEE,wBAAgB,CAAA;AAAA,MAClB;AAEA,UAAI,0BAA0B;AAC9B,UAAI,wBAAwB;AAC5B,UAAI,2BAA2B;AAC/B,UAAI,+BAA+B;AACnC,eAAS,2BAA2B;AAGlC,kCAA0B;AAC1B,gCAAwB;AACxB,mCAA2B;AAE3B;AACE,yCAA+B;AAAA,QAChC;AAAA,MACH;AACA,eAAS,kCAAkC;AACzC;AACE,yCAA+B;AAAA,QAChC;AAAA,MACH;AACA,eAAS,iCAAiC;AACxC;AACE,yCAA+B;AAAA,QAChC;AAAA,MACH;AACA,eAAS,aAAa,eAAe,SAAS,WAAW;AACvD;AACE,eAAK,aAAa,QAAQ,eAAe,aAAa;AACtD,kBAAQ,gBAAgB;AAExB;AACE,gBAAI,QAAQ,qBAAqB,UAAa,QAAQ,qBAAqB,QAAQ,QAAQ,qBAAqB,eAAe;AAC7H,oBAAM,8GAAmH;AAAA,YAC1H;AAED,oBAAQ,mBAAmB;AAAA,UAC5B;AAAA,QACF;AAAA,MACH;AACA,eAAS,YAAY,SAAS,eAAe;AAC3C,YAAI,eAAe,YAAY;AAC/B,YAAI,aAAa,aAAa;AAE9B;AACE;AACE,oBAAQ,gBAAgB;AAAA,UACzB;AAAA,QACF;AAAA,MACH;AACA,eAAS,gCAAgC,QAAQS,cAAa,iBAAiB;AAE7E,YAAI,OAAO;AAEX,eAAO,SAAS,MAAM;AACpB,cAAI,YAAY,KAAK;AAErB,cAAI,CAAC,gBAAgB,KAAK,YAAYA,YAAW,GAAG;AAClD,iBAAK,aAAa,WAAW,KAAK,YAAYA,YAAW;AAEzD,gBAAI,cAAc,MAAM;AACtB,wBAAU,aAAa,WAAW,UAAU,YAAYA,YAAW;AAAA,YACpE;AAAA,UACP,WAAe,cAAc,QAAQ,CAAC,gBAAgB,UAAU,YAAYA,YAAW,GAAG;AACpF,sBAAU,aAAa,WAAW,UAAU,YAAYA,YAAW;AAAA,UACpE;AAED,cAAI,SAAS,iBAAiB;AAC5B;AAAA,UACD;AAED,iBAAO,KAAK;AAAA,QACb;AAED;AACE,cAAI,SAAS,iBAAiB;AAC5B,kBAAM,0IAA+I;AAAA,UACtJ;AAAA,QACF;AAAA,MACH;AACA,eAAS,uBAAuBX,iBAAgB,SAASW,cAAa;AACpE;AACE,uCAA6BX,iBAAgB,SAASW,YAAW;AAAA,QAClE;AAAA,MACH;AAEA,eAAS,6BAA6BX,iBAAgB,SAASW,cAAa;AAE1E,YAAI,QAAQX,gBAAe;AAE3B,YAAI,UAAU,MAAM;AAElB,gBAAM,SAASA;AAAA,QAChB;AAED,eAAO,UAAU,MAAM;AACrB,cAAI,YAAY;AAEhB,cAAI,OAAO,MAAM;AAEjB,cAAI,SAAS,MAAM;AACjB,wBAAY,MAAM;AAClB,gBAAI,aAAa,KAAK;AAEtB,mBAAO,eAAe,MAAM;AAE1B,kBAAI,WAAW,YAAY,SAAS;AAElC,oBAAI,MAAM,QAAQ,gBAAgB;AAEhC,sBAAI,OAAO,kBAAkBW,YAAW;AACxC,sBAAI,SAAS,aAAa,aAAa,IAAI;AAC3C,yBAAO,MAAM;AAMb,sBAAI,cAAc,MAAM;AAExB,sBAAI,gBAAgB;AAAM;AAAA,uBAAO;AAC/B,wBAAI,cAAc,YAAY;AAC9B,wBAAI,UAAU,YAAY;AAE1B,wBAAI,YAAY,MAAM;AAEpB,6BAAO,OAAO;AAAA,oBAC9B,OAAqB;AACL,6BAAO,OAAO,QAAQ;AACtB,8BAAQ,OAAO;AAAA,oBAChB;AAED,gCAAY,UAAU;AAAA,kBACvB;AAAA,gBACF;AAED,sBAAM,QAAQ,WAAW,MAAM,OAAOA,YAAW;AACjD,oBAAI,YAAY,MAAM;AAEtB,oBAAI,cAAc,MAAM;AACtB,4BAAU,QAAQ,WAAW,UAAU,OAAOA,YAAW;AAAA,gBAC1D;AAED,gDAAgC,MAAM,QAAQA,cAAaX,eAAc;AAEzE,qBAAK,QAAQ,WAAW,KAAK,OAAOW,YAAW;AAG/C;AAAA,cACD;AAED,2BAAa,WAAW;AAAA,YACzB;AAAA,UACP,WAAe,MAAM,QAAQf,kBAAiB;AAExC,wBAAY,MAAM,SAASI,gBAAe,OAAO,OAAO,MAAM;AAAA,UACpE,WAAe,MAAM,QAAQ,oBAAoB;AAI3C,gBAAI,iBAAiB,MAAM;AAE3B,gBAAI,mBAAmB,MAAM;AAC3B,oBAAM,IAAI,MAAM,kFAAkF;AAAA,YACnG;AAED,2BAAe,QAAQ,WAAW,eAAe,OAAOW,YAAW;AACnE,gBAAI,aAAa,eAAe;AAEhC,gBAAI,eAAe,MAAM;AACvB,yBAAW,QAAQ,WAAW,WAAW,OAAOA,YAAW;AAAA,YAC5D;AAMD,4CAAgC,gBAAgBA,cAAaX,eAAc;AAC3E,wBAAY,MAAM;AAAA,UACxB,OAAW;AAEL,wBAAY,MAAM;AAAA,UACnB;AAED,cAAI,cAAc,MAAM;AAEtB,sBAAU,SAAS;AAAA,UACzB,OAAW;AAEL,wBAAY;AAEZ,mBAAO,cAAc,MAAM;AACzB,kBAAI,cAAcA,iBAAgB;AAEhC,4BAAY;AACZ;AAAA,cACD;AAED,kBAAI,UAAU,UAAU;AAExB,kBAAI,YAAY,MAAM;AAEpB,wBAAQ,SAAS,UAAU;AAC3B,4BAAY;AACZ;AAAA,cACD;AAGD,0BAAY,UAAU;AAAA,YACvB;AAAA,UACF;AAED,kBAAQ;AAAA,QACT;AAAA,MACH;AACA,eAAS,qBAAqBA,iBAAgBW,cAAa;AACzD,kCAA0BX;AAC1B,gCAAwB;AACxB,mCAA2B;AAC3B,YAAI,eAAeA,gBAAe;AAElC,YAAI,iBAAiB,MAAM;AACzB;AACE,gBAAI,eAAe,aAAa;AAEhC,gBAAI,iBAAiB,MAAM;AACzB,kBAAI,iBAAiB,aAAa,OAAOW,YAAW,GAAG;AAErD;cACD;AAGD,2BAAa,eAAe;AAAA,YAC7B;AAAA,UACF;AAAA,QACF;AAAA,MACH;AACA,eAAS,YAAY,SAAS;AAC5B;AAGE,cAAI,8BAA8B;AAChC,kBAAM,8PAA6Q;AAAA,UACpR;AAAA,QACF;AAED,YAAI,QAAS,QAAQ;AAErB,YAAI,6BAA6B;AAAS;AAAA,aAAO;AAC/C,cAAI,cAAc;AAAA,YAChB;AAAA,YACA,eAAe;AAAA,YACf,MAAM;AAAA,UACZ;AAEI,cAAI,0BAA0B,MAAM;AAClC,gBAAI,4BAA4B,MAAM;AACpC,oBAAM,IAAI,MAAM,8PAA6Q;AAAA,YAC9R;AAGD,oCAAwB;AACxB,oCAAwB,eAAe;AAAA,cACrC,OAAO;AAAA,cACP,cAAc;AAAA,YACtB;AAAA,UACA,OAAW;AAEL,oCAAwB,sBAAsB,OAAO;AAAA,UACtD;AAAA,QACF;AAED,eAAO;AAAA,MACT;AAMA,UAAI,mBAAmB;AACvB,eAAS,0BAA0B,OAAO;AACxC,YAAI,qBAAqB,MAAM;AAC7B,6BAAmB,CAAC,KAAK;AAAA,QAC7B,OAAS;AACL,2BAAiB,KAAK,KAAK;AAAA,QAC5B;AAAA,MACH;AACA,eAAS,kCAAkC;AAMzC,YAAI,qBAAqB,MAAM;AAC7B,mBAASrH,KAAI,GAAGA,KAAI,iBAAiB,QAAQA,MAAK;AAChD,gBAAI,QAAQ,iBAAiBA,EAAC;AAC9B,gBAAI,wBAAwB,MAAM;AAElC,gBAAI,0BAA0B,MAAM;AAClC,oBAAM,cAAc;AACpB,kBAAI,yBAAyB,sBAAsB;AACnD,kBAAI,oBAAoB,MAAM;AAE9B,kBAAI,sBAAsB,MAAM;AAC9B,oBAAI,qBAAqB,kBAAkB;AAC3C,kCAAkB,OAAO;AACzB,sCAAsB,OAAO;AAAA,cAC9B;AAED,oBAAM,UAAU;AAAA,YACjB;AAAA,UACF;AAED,6BAAmB;AAAA,QACpB;AAAA,MACH;AACA,eAAS,4BAA4B,OAAO,OAAO,QAAQ,MAAM;AAC/D,YAAI,cAAc,MAAM;AAExB,YAAI,gBAAgB,MAAM;AAExB,iBAAO,OAAO;AAGd,oCAA0B,KAAK;AAAA,QACnC,OAAS;AACL,iBAAO,OAAO,YAAY;AAC1B,sBAAY,OAAO;AAAA,QACpB;AAED,cAAM,cAAc;AACpB,eAAO,8BAA8B,OAAO,IAAI;AAAA,MAClD;AACA,eAAS,6CAA6C,OAAO,OAAO,QAAQ,MAAM;AAChF,YAAI,cAAc,MAAM;AAExB,YAAI,gBAAgB,MAAM;AAExB,iBAAO,OAAO;AAGd,oCAA0B,KAAK;AAAA,QACnC,OAAS;AACL,iBAAO,OAAO,YAAY;AAC1B,sBAAY,OAAO;AAAA,QACpB;AAED,cAAM,cAAc;AAAA,MACtB;AACA,eAAS,6BAA6B,OAAO,OAAO,QAAQ,MAAM;AAChE,YAAI,cAAc,MAAM;AAExB,YAAI,gBAAgB,MAAM;AAExB,iBAAO,OAAO;AAGd,oCAA0B,KAAK;AAAA,QACnC,OAAS;AACL,iBAAO,OAAO,YAAY;AAC1B,sBAAY,OAAO;AAAA,QACpB;AAED,cAAM,cAAc;AACpB,eAAO,8BAA8B,OAAO,IAAI;AAAA,MAClD;AACA,eAAS,+BAA+B,OAAO,MAAM;AACnD,eAAO,8BAA8B,OAAO,IAAI;AAAA,MAClD;AAGA,UAAI,uCAAuC;AAE3C,eAAS,8BAA8B,aAAa,MAAM;AAExD,oBAAY,QAAQ,WAAW,YAAY,OAAO,IAAI;AACtD,YAAI,YAAY,YAAY;AAE5B,YAAI,cAAc,MAAM;AACtB,oBAAU,QAAQ,WAAW,UAAU,OAAO,IAAI;AAAA,QACnD;AAED;AACE,cAAI,cAAc,SAAS,YAAY,SAAS,YAAY,gBAAgB,SAAS;AACnF,qDAAyC,WAAW;AAAA,UACrD;AAAA,QACF;AAGD,YAAI,OAAO;AACX,YAAI,SAAS,YAAY;AAEzB,eAAO,WAAW,MAAM;AACtB,iBAAO,aAAa,WAAW,OAAO,YAAY,IAAI;AACtD,sBAAY,OAAO;AAEnB,cAAI,cAAc,MAAM;AACtB,sBAAU,aAAa,WAAW,UAAU,YAAY,IAAI;AAAA,UAClE,OAAW;AACL;AACE,mBAAK,OAAO,SAAS,YAAY,gBAAgB,SAAS;AACxD,yDAAyC,WAAW;AAAA,cACrD;AAAA,YACF;AAAA,UACF;AAED,iBAAO;AACP,mBAAS,OAAO;AAAA,QACjB;AAED,YAAI,KAAK,QAAQ,UAAU;AACzB,cAAIoH,QAAO,KAAK;AAChB,iBAAOA;AAAA,QACX,OAAS;AACL,iBAAO;AAAA,QACR;AAAA,MACH;AAEA,UAAI,cAAc;AAClB,UAAI,eAAe;AACnB,UAAI,cAAc;AAClB,UAAI,gBAAgB;AAIpB,UAAI,iBAAiB;AACrB,UAAI;AACJ,UAAI;AAEJ;AACE,oCAA4B;AAC5B,mCAA2B;AAAA,MAC7B;AAEA,eAAS,sBAAsB,OAAO;AACpC,YAAI,QAAQ;AAAA,UACV,WAAW,MAAM;AAAA,UACjB,iBAAiB;AAAA,UACjB,gBAAgB;AAAA,UAChB,QAAQ;AAAA,YACN,SAAS;AAAA,YACT,aAAa;AAAA,YACb,OAAO;AAAA,UACR;AAAA,UACD,SAAS;AAAA,QACb;AACE,cAAM,cAAc;AAAA,MACtB;AACA,eAAS,iBAAiBD,UAAST,iBAAgB;AAEjD,YAAI,QAAQA,gBAAe;AAC3B,YAAI,eAAeS,SAAQ;AAE3B,YAAI,UAAU,cAAc;AAC1B,cAAI,QAAQ;AAAA,YACV,WAAW,aAAa;AAAA,YACxB,iBAAiB,aAAa;AAAA,YAC9B,gBAAgB,aAAa;AAAA,YAC7B,QAAQ,aAAa;AAAA,YACrB,SAAS,aAAa;AAAA,UAC5B;AACI,UAAAT,gBAAe,cAAc;AAAA,QAC9B;AAAA,MACH;AACA,eAAS,aAAa,WAAW,MAAM;AACrC,YAAI,SAAS;AAAA,UACX;AAAA,UACA;AAAA,UACA,KAAK;AAAA,UACL,SAAS;AAAA,UACT,UAAU;AAAA,UACV,MAAM;AAAA,QACV;AACE,eAAO;AAAA,MACT;AACA,eAAS,cAAc,OAAO,QAAQ,MAAM;AAC1C,YAAI,cAAc,MAAM;AAExB,YAAI,gBAAgB,MAAM;AAExB,iBAAO;AAAA,QACR;AAED,YAAI,cAAc,YAAY;AAE9B;AACE,cAAI,6BAA6B,eAAe,CAAC,2BAA2B;AAC1E,kBAAM,4MAA2N;AAEjO,wCAA4B;AAAA,UAC7B;AAAA,QACF;AAED,YAAI,+BAA8B,GAAI;AAGpC,cAAI,UAAU,YAAY;AAE1B,cAAI,YAAY,MAAM;AAEpB,mBAAO,OAAO;AAAA,UACpB,OAAW;AACL,mBAAO,OAAO,QAAQ;AACtB,oBAAQ,OAAO;AAAA,UAChB;AAED,sBAAY,UAAU;AAKtB,iBAAO,qCAAqC,OAAO,IAAI;AAAA,QAC3D,OAAS;AACL,iBAAO,6BAA6B,OAAO,aAAa,QAAQ,IAAI;AAAA,QACrE;AAAA,MACH;AACA,eAAS,oBAAoBU,OAAM,OAAO,MAAM;AAC9C,YAAI,cAAc,MAAM;AAExB,YAAI,gBAAgB,MAAM;AAExB;AAAA,QACD;AAED,YAAI,cAAc,YAAY;AAE9B,YAAI,iBAAiB,IAAI,GAAG;AAC1B,cAAI,aAAa,YAAY;AAM7B,uBAAa,eAAe,YAAYA,MAAK,YAAY;AAEzD,cAAI,gBAAgB,WAAW,YAAY,IAAI;AAC/C,sBAAY,QAAQ;AAIpB,4BAAkBA,OAAM,aAAa;AAAA,QACtC;AAAA,MACH;AACA,eAAS,sBAAsBV,iBAAgB,gBAAgB;AAI7D,YAAI,QAAQA,gBAAe;AAE3B,YAAIS,WAAUT,gBAAe;AAE7B,YAAIS,aAAY,MAAM;AACpB,cAAI,eAAeA,SAAQ;AAE3B,cAAI,UAAU,cAAc;AAO1B,gBAAI,WAAW;AACf,gBAAI,UAAU;AACd,gBAAI,kBAAkB,MAAM;AAE5B,gBAAI,oBAAoB,MAAM;AAE5B,kBAAI,SAAS;AAEb,iBAAG;AACD,oBAAI,QAAQ;AAAA,kBACV,WAAW,OAAO;AAAA,kBAClB,MAAM,OAAO;AAAA,kBACb,KAAK,OAAO;AAAA,kBACZ,SAAS,OAAO;AAAA,kBAChB,UAAU,OAAO;AAAA,kBACjB,MAAM;AAAA,gBAClB;AAEU,oBAAI,YAAY,MAAM;AACpB,6BAAW,UAAU;AAAA,gBACjC,OAAiB;AACL,0BAAQ,OAAO;AACf,4BAAU;AAAA,gBACX;AAED,yBAAS,OAAO;AAAA,cAC1B,SAAiB,WAAW;AAGpB,kBAAI,YAAY,MAAM;AACpB,2BAAW,UAAU;AAAA,cAC/B,OAAe;AACL,wBAAQ,OAAO;AACf,0BAAU;AAAA,cACX;AAAA,YACT,OAAa;AAEL,yBAAW,UAAU;AAAA,YACtB;AAED,oBAAQ;AAAA,cACN,WAAW,aAAa;AAAA,cACxB,iBAAiB;AAAA,cACjB,gBAAgB;AAAA,cAChB,QAAQ,aAAa;AAAA,cACrB,SAAS,aAAa;AAAA,YAC9B;AACM,YAAAT,gBAAe,cAAc;AAC7B;AAAA,UACD;AAAA,QACF;AAGD,YAAI,iBAAiB,MAAM;AAE3B,YAAI,mBAAmB,MAAM;AAC3B,gBAAM,kBAAkB;AAAA,QAC5B,OAAS;AACL,yBAAe,OAAO;AAAA,QACvB;AAED,cAAM,iBAAiB;AAAA,MACzB;AAEA,eAAS,mBAAmBA,iBAAgB,OAAO,QAAQ,WAAW,WAAW,UAAU;AACzF,gBAAQ,OAAO,KAAG;AAAA,UAChB,KAAK,cACH;AACE,gBAAI,UAAU,OAAO;AAErB,gBAAI,OAAO,YAAY,YAAY;AAEjC;AACE;cACD;AAED,kBAAI,YAAY,QAAQ,KAAK,UAAU,WAAW,SAAS;AAE3D;AACE,oBAAKA,gBAAe,OAAO,kBAAkB;AAC3C,6CAA2B,IAAI;AAE/B,sBAAI;AACF,4BAAQ,KAAK,UAAU,WAAW,SAAS;AAAA,kBAC3D,UAAwB;AACR,+CAA2B,KAAK;AAAA,kBACjC;AAAA,gBACF;AAED;cACD;AAED,qBAAO;AAAA,YACR;AAGD,mBAAO;AAAA,UACR;AAAA,UAEH,KAAK,eACH;AACE,YAAAA,gBAAe,QAAQA,gBAAe,QAAQ,CAAC,gBAAgB;AAAA,UAChE;AAAA,UAGH,KAAK,aACH;AACE,gBAAI,WAAW,OAAO;AACtB,gBAAI;AAEJ,gBAAI,OAAO,aAAa,YAAY;AAElC;AACE;cACD;AAED,6BAAe,SAAS,KAAK,UAAU,WAAW,SAAS;AAE3D;AACE,oBAAKA,gBAAe,OAAO,kBAAkB;AAC3C,6CAA2B,IAAI;AAE/B,sBAAI;AACF,6BAAS,KAAK,UAAU,WAAW,SAAS;AAAA,kBAC5D,UAAwB;AACR,+CAA2B,KAAK;AAAA,kBACjC;AAAA,gBACF;AAED;cACD;AAAA,YACX,OAAe;AAEL,6BAAe;AAAA,YAChB;AAED,gBAAI,iBAAiB,QAAQ,iBAAiB,QAAW;AAEvD,qBAAO;AAAA,YACR;AAGD,mBAAO,OAAO,CAAA,GAAI,WAAW,YAAY;AAAA,UAC1C;AAAA,UAEH,KAAK,aACH;AACE,6BAAiB;AACjB,mBAAO;AAAA,UACR;AAAA,QACJ;AAED,eAAO;AAAA,MACT;AAEA,eAAS,mBAAmBA,iBAAgB,OAAO,UAAUW,cAAa;AAExE,YAAI,QAAQX,gBAAe;AAC3B,yBAAiB;AAEjB;AACE,qCAA2B,MAAM;AAAA,QAClC;AAED,YAAI,kBAAkB,MAAM;AAC5B,YAAI,iBAAiB,MAAM;AAE3B,YAAI,eAAe,MAAM,OAAO;AAEhC,YAAI,iBAAiB,MAAM;AACzB,gBAAM,OAAO,UAAU;AAGvB,cAAI,oBAAoB;AACxB,cAAI,qBAAqB,kBAAkB;AAC3C,4BAAkB,OAAO;AAEzB,cAAI,mBAAmB,MAAM;AAC3B,8BAAkB;AAAA,UACxB,OAAW;AACL,2BAAe,OAAO;AAAA,UACvB;AAED,2BAAiB;AAMjB,cAAIS,WAAUT,gBAAe;AAE7B,cAAIS,aAAY,MAAM;AAEpB,gBAAI,eAAeA,SAAQ;AAC3B,gBAAI,wBAAwB,aAAa;AAEzC,gBAAI,0BAA0B,gBAAgB;AAC5C,kBAAI,0BAA0B,MAAM;AAClC,6BAAa,kBAAkB;AAAA,cACzC,OAAe;AACL,sCAAsB,OAAO;AAAA,cAC9B;AAED,2BAAa,iBAAiB;AAAA,YAC/B;AAAA,UACF;AAAA,QACF;AAGD,YAAI,oBAAoB,MAAM;AAE5B,cAAI,WAAW,MAAM;AAGrB,cAAI,WAAW;AACf,cAAI,eAAe;AACnB,cAAI,qBAAqB;AACzB,cAAI,oBAAoB;AACxB,cAAI,SAAS;AAEb,aAAG;AACD,gBAAI,aAAa,OAAO;AACxB,gBAAI,kBAAkB,OAAO;AAE7B,gBAAI,CAAC,gBAAgBE,cAAa,UAAU,GAAG;AAI7C,kBAAI,QAAQ;AAAA,gBACV,WAAW;AAAA,gBACX,MAAM;AAAA,gBACN,KAAK,OAAO;AAAA,gBACZ,SAAS,OAAO;AAAA,gBAChB,UAAU,OAAO;AAAA,gBACjB,MAAM;AAAA,cAChB;AAEQ,kBAAI,sBAAsB,MAAM;AAC9B,qCAAqB,oBAAoB;AACzC,+BAAe;AAAA,cACzB,OAAe;AACL,oCAAoB,kBAAkB,OAAO;AAAA,cAC9C;AAGD,yBAAW,WAAW,UAAU,UAAU;AAAA,YAClD,OAAa;AAEL,kBAAI,sBAAsB,MAAM;AAC9B,oBAAI,SAAS;AAAA,kBACX,WAAW;AAAA;AAAA;AAAA;AAAA,kBAIX,MAAM;AAAA,kBACN,KAAK,OAAO;AAAA,kBACZ,SAAS,OAAO;AAAA,kBAChB,UAAU,OAAO;AAAA,kBACjB,MAAM;AAAA,gBAClB;AACU,oCAAoB,kBAAkB,OAAO;AAAA,cAC9C;AAGD,yBAAW,mBAAmBX,iBAAgB,OAAO,QAAQ,UAAU,OAAO,QAAQ;AACtF,kBAAI,WAAW,OAAO;AAEtB,kBAAI,aAAa;AAAA;AAAA,cAEjB,OAAO,SAAS,QAAQ;AACtB,gBAAAA,gBAAe,SAAS;AACxB,oBAAI,UAAU,MAAM;AAEpB,oBAAI,YAAY,MAAM;AACpB,wBAAM,UAAU,CAAC,MAAM;AAAA,gBACnC,OAAiB;AACL,0BAAQ,KAAK,MAAM;AAAA,gBACpB;AAAA,cACF;AAAA,YACF;AAED,qBAAS,OAAO;AAEhB,gBAAI,WAAW,MAAM;AACnB,6BAAe,MAAM,OAAO;AAE5B,kBAAI,iBAAiB,MAAM;AACzB;AAAA,cACV,OAAe;AAGL,oBAAI,qBAAqB;AAGzB,oBAAI,sBAAsB,mBAAmB;AAC7C,mCAAmB,OAAO;AAC1B,yBAAS;AACT,sBAAM,iBAAiB;AACvB,sBAAM,OAAO,UAAU;AAAA,cACxB;AAAA,YACF;AAAA,UACF,SAAQ;AAET,cAAI,sBAAsB,MAAM;AAC9B,2BAAe;AAAA,UAChB;AAED,gBAAM,YAAY;AAClB,gBAAM,kBAAkB;AACxB,gBAAM,iBAAiB;AAIvB,cAAI,kBAAkB,MAAM,OAAO;AAEnC,cAAI,oBAAoB,MAAM;AAC5B,gBAAI,cAAc;AAElB,eAAG;AACD,yBAAW,WAAW,UAAU,YAAY,IAAI;AAChD,4BAAc,YAAY;AAAA,YAClC,SAAe,gBAAgB;AAAA,UAC/B,WAAe,oBAAoB,MAAM;AAGnC,kBAAM,OAAO,QAAQ;AAAA,UACtB;AASD,iCAAuB,QAAQ;AAC/B,UAAAA,gBAAe,QAAQ;AACvB,UAAAA,gBAAe,gBAAgB;AAAA,QAChC;AAED;AACE,qCAA2B;AAAA,QAC5B;AAAA,MACH;AAEA,eAAS,aAAa,UAAU,SAAS;AACvC,YAAI,OAAO,aAAa,YAAY;AAClC,gBAAM,IAAI,MAAM,wEAAwE,eAAe,SAAS;AAAA,QACjH;AAED,iBAAS,KAAK,OAAO;AAAA,MACvB;AAEA,eAAS,sCAAsC;AAC7C,yBAAiB;AAAA,MACnB;AACA,eAAS,qCAAqC;AAC5C,eAAO;AAAA,MACT;AACA,eAAS,kBAAkB,cAAc,eAAe,UAAU;AAEhE,YAAI,UAAU,cAAc;AAC5B,sBAAc,UAAU;AAExB,YAAI,YAAY,MAAM;AACpB,mBAAS1G,KAAI,GAAGA,KAAI,QAAQ,QAAQA,MAAK;AACvC,gBAAI,SAAS,QAAQA,EAAC;AACtB,gBAAI,WAAW,OAAO;AAEtB,gBAAI,aAAa,MAAM;AACrB,qBAAO,WAAW;AAClB,2BAAa,UAAU,QAAQ;AAAA,YAChC;AAAA,UACF;AAAA,QACF;AAAA,MACH;AAEA,UAAI,uBAAuB,CAAA;AAG3B,UAAI,kBAAkB,IAAIa,OAAM,UAAS,EAAG;AAC5C,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AAEJ;AACE,kDAA0C,oBAAI;AAC9C,yCAAiC,oBAAI;AACrC,8DAAsD,oBAAI;AAC1D,sDAA8C,oBAAI;AAClD,oDAA4C,oBAAI;AAChD,4CAAoC,oBAAI;AACxC,iDAAyC,oBAAI;AAC7C,4CAAoC,oBAAI;AACxC,YAAI,2BAA2B,oBAAI;AAEnC,gCAAwB,SAAU,UAAU,YAAY;AACtD,cAAI,aAAa,QAAQ,OAAO,aAAa,YAAY;AACvD;AAAA,UACD;AAED,cAAI,MAAM,aAAa,MAAM;AAE7B,cAAI,CAAC,yBAAyB,IAAI,GAAG,GAAG;AACtC,qCAAyB,IAAI,GAAG;AAEhC,kBAAM,mGAAwG,YAAY,QAAQ;AAAA,UACnI;AAAA,QACL;AAEE,sCAA8B,SAAU,MAAM,cAAc;AAC1D,cAAI,iBAAiB,QAAW;AAC9B,gBAAI,gBAAgB,yBAAyB,IAAI,KAAK;AAEtD,gBAAI,CAAC,kCAAkC,IAAI,aAAa,GAAG;AACzD,gDAAkC,IAAI,aAAa;AAEnD,oBAAM,gHAAqH,aAAa;AAAA,YACzI;AAAA,UACF;AAAA,QACL;AAOE,eAAO,eAAe,sBAAsB,wBAAwB;AAAA,UAClE,YAAY;AAAA,UACZ,OAAO,WAAY;AACjB,kBAAM,IAAI,MAAM,8UAAuW;AAAA,UACxX;AAAA,QACL,CAAG;AACD,eAAO,OAAO,oBAAoB;AAAA,MACpC;AAEA,eAAS,2BAA2B6F,iBAAgB,MAAM,0BAA0B,WAAW;AAC7F,YAAI,YAAYA,gBAAe;AAC/B,YAAI,eAAe,yBAAyB,WAAW,SAAS;AAEhE;AACE,cAAKA,gBAAe,OAAO,kBAAkB;AAC3C,uCAA2B,IAAI;AAE/B,gBAAI;AAEF,6BAAe,yBAAyB,WAAW,SAAS;AAAA,YACpE,UAAgB;AACR,yCAA2B,KAAK;AAAA,YACjC;AAAA,UACF;AAED,sCAA4B,MAAM,YAAY;AAAA,QAC/C;AAGD,YAAI,gBAAgB,iBAAiB,QAAQ,iBAAiB,SAAY,YAAY,OAAO,CAAA,GAAI,WAAW,YAAY;AACxH,QAAAA,gBAAe,gBAAgB;AAG/B,YAAIA,gBAAe,UAAU,SAAS;AAEpC,cAAI,cAAcA,gBAAe;AACjC,sBAAY,YAAY;AAAA,QACzB;AAAA,MACH;AAEA,UAAI,wBAAwB;AAAA,QAC1B;AAAA,QACA,iBAAiB,SAAU,MAAM,SAAS,UAAU;AAClD,cAAI,QAAQ,IAAI,IAAI;AACpB,cAAI,YAAY;AAChB,cAAI,OAAO,kBAAkB,KAAK;AAClC,cAAI,SAAS,aAAa,WAAW,IAAI;AACzC,iBAAO,UAAU;AAEjB,cAAI,aAAa,UAAa,aAAa,MAAM;AAC/C;AACE,oCAAsB,UAAU,UAAU;AAAA,YAC3C;AAED,mBAAO,WAAW;AAAA,UACnB;AAED,cAAIU,QAAO,cAAc,OAAO,QAAQ,IAAI;AAE5C,cAAIA,UAAS,MAAM;AACjB,kCAAsBA,OAAM,OAAO,MAAM,SAAS;AAClD,gCAAoBA,OAAM,OAAO,IAAI;AAAA,UACtC;AAED;AACE,qCAAyB,OAAO,IAAI;AAAA,UACrC;AAAA,QACF;AAAA,QACD,qBAAqB,SAAU,MAAM,SAAS,UAAU;AACtD,cAAI,QAAQ,IAAI,IAAI;AACpB,cAAI,YAAY;AAChB,cAAI,OAAO,kBAAkB,KAAK;AAClC,cAAI,SAAS,aAAa,WAAW,IAAI;AACzC,iBAAO,MAAM;AACb,iBAAO,UAAU;AAEjB,cAAI,aAAa,UAAa,aAAa,MAAM;AAC/C;AACE,oCAAsB,UAAU,cAAc;AAAA,YAC/C;AAED,mBAAO,WAAW;AAAA,UACnB;AAED,cAAIA,QAAO,cAAc,OAAO,QAAQ,IAAI;AAE5C,cAAIA,UAAS,MAAM;AACjB,kCAAsBA,OAAM,OAAO,MAAM,SAAS;AAClD,gCAAoBA,OAAM,OAAO,IAAI;AAAA,UACtC;AAED;AACE,qCAAyB,OAAO,IAAI;AAAA,UACrC;AAAA,QACF;AAAA,QACD,oBAAoB,SAAU,MAAM,UAAU;AAC5C,cAAI,QAAQ,IAAI,IAAI;AACpB,cAAI,YAAY;AAChB,cAAI,OAAO,kBAAkB,KAAK;AAClC,cAAI,SAAS,aAAa,WAAW,IAAI;AACzC,iBAAO,MAAM;AAEb,cAAI,aAAa,UAAa,aAAa,MAAM;AAC/C;AACE,oCAAsB,UAAU,aAAa;AAAA,YAC9C;AAED,mBAAO,WAAW;AAAA,UACnB;AAED,cAAIA,QAAO,cAAc,OAAO,QAAQ,IAAI;AAE5C,cAAIA,UAAS,MAAM;AACjB,kCAAsBA,OAAM,OAAO,MAAM,SAAS;AAClD,gCAAoBA,OAAM,OAAO,IAAI;AAAA,UACtC;AAED;AACE,qCAAyB,OAAO,IAAI;AAAA,UACrC;AAAA,QACF;AAAA,MACH;AAEA,eAAS,2BAA2BV,iBAAgB,MAAM,UAAU,UAAU,UAAU,UAAU,aAAa;AAC7G,YAAI,WAAWA,gBAAe;AAE9B,YAAI,OAAO,SAAS,0BAA0B,YAAY;AACxD,cAAI,eAAe,SAAS,sBAAsB,UAAU,UAAU,WAAW;AAEjF;AACE,gBAAKA,gBAAe,OAAO,kBAAkB;AAC3C,yCAA2B,IAAI;AAE/B,kBAAI;AAEF,+BAAe,SAAS,sBAAsB,UAAU,UAAU,WAAW;AAAA,cACvF,UAAkB;AACR,2CAA2B,KAAK;AAAA,cACjC;AAAA,YACF;AAED,gBAAI,iBAAiB,QAAW;AAC9B,oBAAM,iHAAsH,yBAAyB,IAAI,KAAK,WAAW;AAAA,YAC1K;AAAA,UACF;AAED,iBAAO;AAAA,QACR;AAED,YAAI,KAAK,aAAa,KAAK,UAAU,sBAAsB;AACzD,iBAAO,CAAC,aAAa,UAAU,QAAQ,KAAK,CAAC,aAAa,UAAU,QAAQ;AAAA,QAC7E;AAED,eAAO;AAAA,MACT;AAEA,eAAS,mBAAmBA,iBAAgB,MAAM,UAAU;AAC1D,YAAI,WAAWA,gBAAe;AAE9B;AACE,cAAIpG,QAAO,yBAAyB,IAAI,KAAK;AAC7C,cAAI,gBAAgB,SAAS;AAE7B,cAAI,CAAC,eAAe;AAClB,gBAAI,KAAK,aAAa,OAAO,KAAK,UAAU,WAAW,YAAY;AACjE,oBAAM,qIAA0IA,KAAI;AAAA,YAC5J,OAAa;AACL,oBAAM,oHAAyHA,KAAI;AAAA,YACpI;AAAA,UACF;AAED,cAAI,SAAS,mBAAmB,CAAC,SAAS,gBAAgB,wBAAwB,CAAC,SAAS,OAAO;AACjG,kBAAM,qLAA+LA,KAAI;AAAA,UAC1M;AAED,cAAI,SAAS,mBAAmB,CAAC,SAAS,gBAAgB,sBAAsB;AAC9E,kBAAM,0LAAoMA,KAAI;AAAA,UAC/M;AAED,cAAI,SAAS,WAAW;AACtB,kBAAM,2GAAgHA,KAAI;AAAA,UAC3H;AAED,cAAI,SAAS,aAAa;AACxB,kBAAM,+GAAoHA,KAAI;AAAA,UAC/H;AAED;AACE,gBAAI,SAAS,cAAc;AACzB,oBAAM,iHAAsHA,KAAI;AAAA,YACjI;AAED,gBAAI,KAAK,eAAe,KAAK,gBAAgB,CAAC,uCAAuC,IAAI,IAAI,GAAG;AAC9F,qDAAuC,IAAI,IAAI;AAE/C,oBAAM,sHAA2HA,KAAI;AAAA,YACtI;AAAA,UACF;AAED,cAAI,OAAO,SAAS,0BAA0B,YAAY;AACxD,kBAAM,+KAA8LA,KAAI;AAAA,UACzM;AAED,cAAI,KAAK,aAAa,KAAK,UAAU,wBAAwB,OAAO,SAAS,0BAA0B,aAAa;AAClH,kBAAM,gMAA0M,yBAAyB,IAAI,KAAK,kBAAkB;AAAA,UACrQ;AAED,cAAI,OAAO,SAAS,wBAAwB,YAAY;AACtD,kBAAM,6HAAuIA,KAAI;AAAA,UAClJ;AAED,cAAI,OAAO,SAAS,6BAA6B,YAAY;AAC3D,kBAAM,oTAAwUA,KAAI;AAAA,UACnV;AAED,cAAI,OAAO,SAAS,8BAA8B,YAAY;AAC5D,kBAAM,iGAAsGA,KAAI;AAAA,UACjH;AAED,cAAI,OAAO,SAAS,qCAAqC,YAAY;AACnE,kBAAM,+GAAoHA,KAAI;AAAA,UAC/H;AAED,cAAI,kBAAkB,SAAS,UAAU;AAEzC,cAAI,SAAS,UAAU,UAAa,iBAAiB;AACnD,kBAAM,4HAAiIA,OAAMA,KAAI;AAAA,UAClJ;AAED,cAAI,SAAS,cAAc;AACzB,kBAAM,qJAA0JA,OAAMA,KAAI;AAAA,UAC3K;AAED,cAAI,OAAO,SAAS,4BAA4B,cAAc,OAAO,SAAS,uBAAuB,cAAc,CAAC,oDAAoD,IAAI,IAAI,GAAG;AACjL,gEAAoD,IAAI,IAAI;AAE5D,kBAAM,kIAAuI,yBAAyB,IAAI,CAAC;AAAA,UAC5K;AAED,cAAI,OAAO,SAAS,6BAA6B,YAAY;AAC3D,kBAAM,gIAAqIA,KAAI;AAAA,UAChJ;AAED,cAAI,OAAO,SAAS,6BAA6B,YAAY;AAC3D,kBAAM,gIAAqIA,KAAI;AAAA,UAChJ;AAED,cAAI,OAAO,KAAK,4BAA4B,YAAY;AACtD,kBAAM,+HAAoIA,KAAI;AAAA,UAC/I;AAED,cAAI,SAAS,SAAS;AAEtB,cAAI,WAAW,OAAO,WAAW,YAAY,QAAQ,MAAM,IAAI;AAC7D,kBAAM,8CAA8CA,KAAI;AAAA,UACzD;AAED,cAAI,OAAO,SAAS,oBAAoB,cAAc,OAAO,KAAK,sBAAsB,UAAU;AAChG,kBAAM,8FAAmGA,KAAI;AAAA,UAC9G;AAAA,QACF;AAAA,MACH;AAEA,eAAS,mBAAmBoG,iBAAgB,UAAU;AACpD,iBAAS,UAAU;AACnB,QAAAA,gBAAe,YAAY;AAE3B,YAAI,UAAUA,eAAc;AAE5B;AACE,mBAAS,yBAAyB;AAAA,QACnC;AAAA,MACH;AAEA,eAAS,uBAAuBA,iBAAgB,MAAM,OAAO;AAC3D,YAAI,0BAA0B;AAC9B,YAAI,kBAAkB;AACtB,YAAI,UAAU;AACd,YAAI,cAAc,KAAK;AAEvB;AACE,cAAI,iBAAiB,MAAM;AACzB,gBAAI;AAAA;AAAA,cACJ,gBAAgB,QAAQ,gBAAgB,UAAa,YAAY,aAAa,sBAAsB,YAAY,aAAa;AAAA;AAE7H,gBAAI,CAAC,WAAW,CAAC,kCAAkC,IAAI,IAAI,GAAG;AAC5D,gDAAkC,IAAI,IAAI;AAC1C,kBAAI,WAAW;AAEf,kBAAI,gBAAgB,QAAW;AAC7B,2BAAW;AAAA,cACrB,WAAmB,OAAO,gBAAgB,UAAU;AAC1C,2BAAW,8BAA8B,OAAO,cAAc;AAAA,cACxE,WAAmB,YAAY,aAAa,qBAAqB;AACvD,2BAAW;AAAA,cACrB,WAAmB,YAAY,aAAa,QAAW;AAE7C,2BAAW;AAAA,cACrB,OAAe;AACL,2BAAW,iDAAiD,OAAO,KAAK,WAAW,EAAE,KAAK,IAAI,IAAI;AAAA,cACnG;AAED,oBAAM,0HAA+H,yBAAyB,IAAI,KAAK,aAAa,QAAQ;AAAA,YAC7L;AAAA,UACF;AAAA,QACF;AAED,YAAI,OAAO,gBAAgB,YAAY,gBAAgB,MAAM;AAC3D,oBAAU,YAAY,WAAW;AAAA,QACrC,OAAS;AACL,4BAAkB,mBAAmBA,iBAAgB,MAAM,IAAI;AAC/D,cAAI,eAAe,KAAK;AACxB,oCAA0B,iBAAiB,QAAQ,iBAAiB;AACpE,oBAAU,0BAA0B,iBAAiBA,iBAAgB,eAAe,IAAI;AAAA,QACzF;AAED,YAAI,WAAW,IAAI,KAAK,OAAO,OAAO;AAEtC;AACE,cAAKA,gBAAe,OAAO,kBAAkB;AAC3C,uCAA2B,IAAI;AAE/B,gBAAI;AACF,yBAAW,IAAI,KAAK,OAAO,OAAO;AAAA,YAC1C,UAAgB;AACR,yCAA2B,KAAK;AAAA,YACjC;AAAA,UACF;AAAA,QACF;AAED,YAAI,QAAQA,gBAAe,gBAAgB,SAAS,UAAU,QAAQ,SAAS,UAAU,SAAY,SAAS,QAAQ;AACtH,2BAAmBA,iBAAgB,QAAQ;AAE3C;AACE,cAAI,OAAO,KAAK,6BAA6B,cAAc,UAAU,MAAM;AACzE,gBAAI,gBAAgB,yBAAyB,IAAI,KAAK;AAEtD,gBAAI,CAAC,+BAA+B,IAAI,aAAa,GAAG;AACtD,6CAA+B,IAAI,aAAa;AAEhD,oBAAM,mRAAkS,eAAe,SAAS,UAAU,OAAO,SAAS,aAAa,aAAa;AAAA,YACrX;AAAA,UACF;AAKD,cAAI,OAAO,KAAK,6BAA6B,cAAc,OAAO,SAAS,4BAA4B,YAAY;AACjH,gBAAI,qBAAqB;AACzB,gBAAI,4BAA4B;AAChC,gBAAI,sBAAsB;AAE1B,gBAAI,OAAO,SAAS,uBAAuB,cAAc,SAAS,mBAAmB,iCAAiC,MAAM;AAC1H,mCAAqB;AAAA,YACtB,WAAU,OAAO,SAAS,8BAA8B,YAAY;AACnE,mCAAqB;AAAA,YACtB;AAED,gBAAI,OAAO,SAAS,8BAA8B,cAAc,SAAS,0BAA0B,iCAAiC,MAAM;AACxI,0CAA4B;AAAA,YAC7B,WAAU,OAAO,SAAS,qCAAqC,YAAY;AAC1E,0CAA4B;AAAA,YAC7B;AAED,gBAAI,OAAO,SAAS,wBAAwB,cAAc,SAAS,oBAAoB,iCAAiC,MAAM;AAC5H,oCAAsB;AAAA,YACvB,WAAU,OAAO,SAAS,+BAA+B,YAAY;AACpE,oCAAsB;AAAA,YACvB;AAED,gBAAI,uBAAuB,QAAQ,8BAA8B,QAAQ,wBAAwB,MAAM;AACrG,kBAAI,iBAAiB,yBAAyB,IAAI,KAAK;AAEvD,kBAAI,aAAa,OAAO,KAAK,6BAA6B,aAAa,+BAA+B;AAEtG,kBAAI,CAAC,4CAA4C,IAAI,cAAc,GAAG;AACpE,4DAA4C,IAAI,cAAc;AAE9D,sBAAM,oSAAmT,gBAAgB,YAAY,uBAAuB,OAAO,SAAS,qBAAqB,IAAI,8BAA8B,OAAO,SAAS,4BAA4B,IAAI,wBAAwB,OAAO,SAAS,sBAAsB,EAAE;AAAA,cACpiB;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAID,YAAI,yBAAyB;AAC3B,uBAAaA,iBAAgB,iBAAiB,OAAO;AAAA,QACtD;AAED,eAAO;AAAA,MACT;AAEA,eAAS,uBAAuBA,iBAAgB,UAAU;AACxD,YAAI,WAAW,SAAS;AAExB,YAAI,OAAO,SAAS,uBAAuB,YAAY;AACrD,mBAAS,mBAAkB;AAAA,QAC5B;AAED,YAAI,OAAO,SAAS,8BAA8B,YAAY;AAC5D,mBAAS,0BAAyB;AAAA,QACnC;AAED,YAAI,aAAa,SAAS,OAAO;AAC/B;AACE,kBAAM,4IAAsJ,0BAA0BA,eAAc,KAAK,WAAW;AAAA,UACrN;AAED,gCAAsB,oBAAoB,UAAU,SAAS,OAAO,IAAI;AAAA,QACzE;AAAA,MACH;AAEA,eAAS,8BAA8BA,iBAAgB,UAAU,UAAU,aAAa;AACtF,YAAI,WAAW,SAAS;AAExB,YAAI,OAAO,SAAS,8BAA8B,YAAY;AAC5D,mBAAS,0BAA0B,UAAU,WAAW;AAAA,QACzD;AAED,YAAI,OAAO,SAAS,qCAAqC,YAAY;AACnE,mBAAS,iCAAiC,UAAU,WAAW;AAAA,QAChE;AAED,YAAI,SAAS,UAAU,UAAU;AAC/B;AACE,gBAAI,gBAAgB,0BAA0BA,eAAc,KAAK;AAEjE,gBAAI,CAAC,wCAAwC,IAAI,aAAa,GAAG;AAC/D,sDAAwC,IAAI,aAAa;AAEzD,oBAAM,mJAA6J,aAAa;AAAA,YACjL;AAAA,UACF;AAED,gCAAsB,oBAAoB,UAAU,SAAS,OAAO,IAAI;AAAA,QACzE;AAAA,MACH;AAGA,eAAS,mBAAmBA,iBAAgB,MAAM,UAAUW,cAAa;AACvE;AACE,6BAAmBX,iBAAgB,MAAM,QAAQ;AAAA,QAClD;AAED,YAAI,WAAWA,gBAAe;AAC9B,iBAAS,QAAQ;AACjB,iBAAS,QAAQA,gBAAe;AAChC,iBAAS,OAAO;AAChB,8BAAsBA,eAAc;AACpC,YAAI,cAAc,KAAK;AAEvB,YAAI,OAAO,gBAAgB,YAAY,gBAAgB,MAAM;AAC3D,mBAAS,UAAU,YAAY,WAAW;AAAA,QAC9C,OAAS;AACL,cAAI,kBAAkB,mBAAmBA,iBAAgB,MAAM,IAAI;AACnE,mBAAS,UAAU,iBAAiBA,iBAAgB,eAAe;AAAA,QACpE;AAED;AACE,cAAI,SAAS,UAAU,UAAU;AAC/B,gBAAI,gBAAgB,yBAAyB,IAAI,KAAK;AAEtD,gBAAI,CAAC,0CAA0C,IAAI,aAAa,GAAG;AACjE,wDAA0C,IAAI,aAAa;AAE3D,oBAAM,wKAAkL,aAAa;AAAA,YACtM;AAAA,UACF;AAED,cAAIA,gBAAe,OAAO,kBAAkB;AAC1C,oCAAwB,2BAA2BA,iBAAgB,QAAQ;AAAA,UAC5E;AAED;AACE,oCAAwB,8BAA8BA,iBAAgB,QAAQ;AAAA,UAC/E;AAAA,QACF;AAED,iBAAS,QAAQA,gBAAe;AAChC,YAAI,2BAA2B,KAAK;AAEpC,YAAI,OAAO,6BAA6B,YAAY;AAClD,qCAA2BA,iBAAgB,MAAM,0BAA0B,QAAQ;AACnF,mBAAS,QAAQA,gBAAe;AAAA,QACjC;AAID,YAAI,OAAO,KAAK,6BAA6B,cAAc,OAAO,SAAS,4BAA4B,eAAe,OAAO,SAAS,8BAA8B,cAAc,OAAO,SAAS,uBAAuB,aAAa;AACpO,iCAAuBA,iBAAgB,QAAQ;AAG/C,6BAAmBA,iBAAgB,UAAU,UAAUW,YAAW;AAClE,mBAAS,QAAQX,gBAAe;AAAA,QACjC;AAED,YAAI,OAAO,SAAS,sBAAsB,YAAY;AACpD,cAAI,aAAa;AAEjB;AACE,0BAAc;AAAA,UACf;AAED,eAAMA,gBAAe,OAAO,uBAAuB,QAAQ;AACzD,0BAAc;AAAA,UACf;AAED,UAAAA,gBAAe,SAAS;AAAA,QACzB;AAAA,MACH;AAEA,eAAS,yBAAyBA,iBAAgB,MAAM,UAAUW,cAAa;AAC7E,YAAI,WAAWX,gBAAe;AAC9B,YAAI,WAAWA,gBAAe;AAC9B,iBAAS,QAAQ;AACjB,YAAI,aAAa,SAAS;AAC1B,YAAI,cAAc,KAAK;AACvB,YAAI,cAAc;AAElB,YAAI,OAAO,gBAAgB,YAAY,gBAAgB,MAAM;AAC3D,wBAAc,YAAY,WAAW;AAAA,QACzC,OAAS;AACL,cAAI,4BAA4B,mBAAmBA,iBAAgB,MAAM,IAAI;AAC7E,wBAAc,iBAAiBA,iBAAgB,yBAAyB;AAAA,QACzE;AAED,YAAI,2BAA2B,KAAK;AACpC,YAAI,mBAAmB,OAAO,6BAA6B,cAAc,OAAO,SAAS,4BAA4B;AAMrH,YAAI,CAAC,qBAAqB,OAAO,SAAS,qCAAqC,cAAc,OAAO,SAAS,8BAA8B,aAAa;AACtJ,cAAI,aAAa,YAAY,eAAe,aAAa;AACvD,0CAA8BA,iBAAgB,UAAU,UAAU,WAAW;AAAA,UAC9E;AAAA,QACF;AAED;AACA,YAAI,WAAWA,gBAAe;AAC9B,YAAI,WAAW,SAAS,QAAQ;AAChC,2BAAmBA,iBAAgB,UAAU,UAAUW,YAAW;AAClE,mBAAWX,gBAAe;AAE1B,YAAI,aAAa,YAAY,aAAa,YAAY,CAAC,kBAAmB,KAAI,CAAC,sCAAsC;AAGnH,cAAI,OAAO,SAAS,sBAAsB,YAAY;AACpD,gBAAI,aAAa;AAEjB;AACE,4BAAc;AAAA,YACf;AAED,iBAAMA,gBAAe,OAAO,uBAAuB,QAAQ;AACzD,4BAAc;AAAA,YACf;AAED,YAAAA,gBAAe,SAAS;AAAA,UACzB;AAED,iBAAO;AAAA,QACR;AAED,YAAI,OAAO,6BAA6B,YAAY;AAClD,qCAA2BA,iBAAgB,MAAM,0BAA0B,QAAQ;AACnF,qBAAWA,gBAAe;AAAA,QAC3B;AAED,YAAI,eAAe,wCAAwC,2BAA2BA,iBAAgB,MAAM,UAAU,UAAU,UAAU,UAAU,WAAW;AAE/J,YAAI,cAAc;AAGhB,cAAI,CAAC,qBAAqB,OAAO,SAAS,8BAA8B,cAAc,OAAO,SAAS,uBAAuB,aAAa;AACxI,gBAAI,OAAO,SAAS,uBAAuB,YAAY;AACrD,uBAAS,mBAAkB;AAAA,YAC5B;AAED,gBAAI,OAAO,SAAS,8BAA8B,YAAY;AAC5D,uBAAS,0BAAyB;AAAA,YACnC;AAAA,UACF;AAED,cAAI,OAAO,SAAS,sBAAsB,YAAY;AACpD,gBAAI,cAAc;AAElB;AACE,6BAAe;AAAA,YAChB;AAED,iBAAMA,gBAAe,OAAO,uBAAuB,QAAQ;AACzD,6BAAe;AAAA,YAChB;AAED,YAAAA,gBAAe,SAAS;AAAA,UACzB;AAAA,QACL,OAAS;AAGL,cAAI,OAAO,SAAS,sBAAsB,YAAY;AACpD,gBAAI,eAAe;AAEnB;AACE,8BAAgB;AAAA,YACjB;AAED,iBAAMA,gBAAe,OAAO,uBAAuB,QAAQ;AACzD,8BAAgB;AAAA,YACjB;AAED,YAAAA,gBAAe,SAAS;AAAA,UACzB;AAID,UAAAA,gBAAe,gBAAgB;AAC/B,UAAAA,gBAAe,gBAAgB;AAAA,QAChC;AAID,iBAAS,QAAQ;AACjB,iBAAS,QAAQ;AACjB,iBAAS,UAAU;AACnB,eAAO;AAAA,MACT;AAGA,eAAS,oBAAoBS,UAAST,iBAAgB,MAAM,UAAUW,cAAa;AACjF,YAAI,WAAWX,gBAAe;AAC9B,yBAAiBS,UAAST,eAAc;AACxC,YAAI,qBAAqBA,gBAAe;AACxC,YAAI,WAAWA,gBAAe,SAASA,gBAAe,cAAc,qBAAqB,oBAAoBA,gBAAe,MAAM,kBAAkB;AACpJ,iBAAS,QAAQ;AACjB,YAAI,qBAAqBA,gBAAe;AACxC,YAAI,aAAa,SAAS;AAC1B,YAAI,cAAc,KAAK;AACvB,YAAI,cAAc;AAElB,YAAI,OAAO,gBAAgB,YAAY,gBAAgB,MAAM;AAC3D,wBAAc,YAAY,WAAW;AAAA,QACzC,OAAS;AACL,cAAI,sBAAsB,mBAAmBA,iBAAgB,MAAM,IAAI;AACvE,wBAAc,iBAAiBA,iBAAgB,mBAAmB;AAAA,QACnE;AAED,YAAI,2BAA2B,KAAK;AACpC,YAAI,mBAAmB,OAAO,6BAA6B,cAAc,OAAO,SAAS,4BAA4B;AAMrH,YAAI,CAAC,qBAAqB,OAAO,SAAS,qCAAqC,cAAc,OAAO,SAAS,8BAA8B,aAAa;AACtJ,cAAI,uBAAuB,sBAAsB,eAAe,aAAa;AAC3E,0CAA8BA,iBAAgB,UAAU,UAAU,WAAW;AAAA,UAC9E;AAAA,QACF;AAED;AACA,YAAI,WAAWA,gBAAe;AAC9B,YAAI,WAAW,SAAS,QAAQ;AAChC,2BAAmBA,iBAAgB,UAAU,UAAUW,YAAW;AAClE,mBAAWX,gBAAe;AAE1B,YAAI,uBAAuB,sBAAsB,aAAa,YAAY,CAAC,kBAAmB,KAAI,CAAC,mCAAkC,KAAM,CAAE,8BAAkC;AAG7K,cAAI,OAAO,SAAS,uBAAuB,YAAY;AACrD,gBAAI,uBAAuBS,SAAQ,iBAAiB,aAAaA,SAAQ,eAAe;AACtF,cAAAT,gBAAe,SAAS;AAAA,YACzB;AAAA,UACF;AAED,cAAI,OAAO,SAAS,4BAA4B,YAAY;AAC1D,gBAAI,uBAAuBS,SAAQ,iBAAiB,aAAaA,SAAQ,eAAe;AACtF,cAAAT,gBAAe,SAAS;AAAA,YACzB;AAAA,UACF;AAED,iBAAO;AAAA,QACR;AAED,YAAI,OAAO,6BAA6B,YAAY;AAClD,qCAA2BA,iBAAgB,MAAM,0BAA0B,QAAQ;AACnF,qBAAWA,gBAAe;AAAA,QAC3B;AAED,YAAI,eAAe,wCAAwC,2BAA2BA,iBAAgB,MAAM,UAAU,UAAU,UAAU,UAAU,WAAW;AAAA;AAAA;AAAA;AAAA,QAI/J;AAEA,YAAI,cAAc;AAGhB,cAAI,CAAC,qBAAqB,OAAO,SAAS,+BAA+B,cAAc,OAAO,SAAS,wBAAwB,aAAa;AAC1I,gBAAI,OAAO,SAAS,wBAAwB,YAAY;AACtD,uBAAS,oBAAoB,UAAU,UAAU,WAAW;AAAA,YAC7D;AAED,gBAAI,OAAO,SAAS,+BAA+B,YAAY;AAC7D,uBAAS,2BAA2B,UAAU,UAAU,WAAW;AAAA,YACpE;AAAA,UACF;AAED,cAAI,OAAO,SAAS,uBAAuB,YAAY;AACrD,YAAAA,gBAAe,SAAS;AAAA,UACzB;AAED,cAAI,OAAO,SAAS,4BAA4B,YAAY;AAC1D,YAAAA,gBAAe,SAAS;AAAA,UACzB;AAAA,QACL,OAAS;AAGL,cAAI,OAAO,SAAS,uBAAuB,YAAY;AACrD,gBAAI,uBAAuBS,SAAQ,iBAAiB,aAAaA,SAAQ,eAAe;AACtF,cAAAT,gBAAe,SAAS;AAAA,YACzB;AAAA,UACF;AAED,cAAI,OAAO,SAAS,4BAA4B,YAAY;AAC1D,gBAAI,uBAAuBS,SAAQ,iBAAiB,aAAaA,SAAQ,eAAe;AACtF,cAAAT,gBAAe,SAAS;AAAA,YACzB;AAAA,UACF;AAID,UAAAA,gBAAe,gBAAgB;AAC/B,UAAAA,gBAAe,gBAAgB;AAAA,QAChC;AAID,iBAAS,QAAQ;AACjB,iBAAS,QAAQ;AACjB,iBAAS,UAAU;AACnB,eAAO;AAAA,MACT;AAEA,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AAEJ,UAAI,oBAAoB,SAAU,OAAO,aAAa;AAAA;AAEtD;AACE,2BAAmB;AACnB,iCAAyB;AACzB,iCAAyB,CAAA;AAOzB,gCAAwB,CAAA;AACxB,sCAA8B,CAAA;AAE9B,4BAAoB,SAAU,OAAO,aAAa;AAChD,cAAI,UAAU,QAAQ,OAAO,UAAU,UAAU;AAC/C;AAAA,UACD;AAED,cAAI,CAAC,MAAM,UAAU,MAAM,OAAO,aAAa,MAAM,OAAO,MAAM;AAChE;AAAA,UACD;AAED,cAAI,OAAO,MAAM,WAAW,UAAU;AACpC,kBAAM,IAAI,MAAM,iIAAsI;AAAA,UACvJ;AAED,gBAAM,OAAO,YAAY;AACzB,cAAI,gBAAgB,0BAA0B,WAAW,KAAK;AAE9D,cAAI,sBAAsB,aAAa,GAAG;AACxC;AAAA,UACD;AAED,gCAAsB,aAAa,IAAI;AAEvC,gBAAM,uHAAiI;AAAA,QAC3I;AAAA,MACA;AAEA,eAAS,UAAU,aAAaS,UAAS,SAAS;AAChD,YAAI,WAAW,QAAQ;AAEvB,YAAI,aAAa,QAAQ,OAAO,aAAa,cAAc,OAAO,aAAa,UAAU;AACvF;AAGE,iBAAK,YAAY,OAAO,oBAAoB;AAAA;AAAA;AAAA,YAG5C,EAAE,QAAQ,UAAU,QAAQ,SAAS,QAAQ,OAAO,cAAc,QAAQ,QAAQ;AAChF,kBAAI,gBAAgB,0BAA0B,WAAW,KAAK;AAE9D,kBAAI,CAAC,uBAAuB,aAAa,GAAG;AAC1C;AACE,wBAAM,gRAAoS,QAAQ;AAAA,gBACnT;AAED,uCAAuB,aAAa,IAAI;AAAA,cACzC;AAAA,YACF;AAAA,UACF;AAED,cAAI,QAAQ,QAAQ;AAClB,gBAAI,QAAQ,QAAQ;AACpB,gBAAI;AAEJ,gBAAI,OAAO;AACT,kBAAI,aAAa;AAEjB,kBAAI,WAAW,QAAQ,gBAAgB;AACrC,sBAAM,IAAI,MAAM,4KAA2L;AAAA,cAC5M;AAED,qBAAO,WAAW;AAAA,YACnB;AAED,gBAAI,CAAC,MAAM;AACT,oBAAM,IAAI,MAAM,kCAAkC,WAAW,wEAA6E;AAAA,YAC3I;AAGD,gBAAI,eAAe;AAEnB;AACE,sCAAwB,UAAU,KAAK;AAAA,YACxC;AAED,gBAAI,YAAY,KAAK;AAErB,gBAAIA,aAAY,QAAQA,SAAQ,QAAQ,QAAQ,OAAOA,SAAQ,QAAQ,cAAcA,SAAQ,IAAI,eAAe,WAAW;AACzH,qBAAOA,SAAQ;AAAA,YAChB;AAED,gBAAI,MAAM,SAAU,OAAO;AACzB,kBAAI,OAAO,aAAa;AAExB,kBAAI,SAAS,iBAAiB;AAE5B,uBAAO,aAAa,OAAO;cAC5B;AAED,kBAAI,UAAU,MAAM;AAClB,uBAAO,KAAK,SAAS;AAAA,cAC/B,OAAe;AACL,qBAAK,SAAS,IAAI;AAAA,cACnB;AAAA,YACT;AAEM,gBAAI,aAAa;AACjB,mBAAO;AAAA,UACb,OAAW;AACL,gBAAI,OAAO,aAAa,UAAU;AAChC,oBAAM,IAAI,MAAM,4FAA4F;AAAA,YAC7G;AAED,gBAAI,CAAC,QAAQ,QAAQ;AACnB,oBAAM,IAAI,MAAM,4CAA4C,WAAW,0VAAmX;AAAA,YAC3b;AAAA,UACF;AAAA,QACF;AAED,eAAO;AAAA,MACT;AAEA,eAAS,yBAAyB,aAAa,UAAU;AACvD,YAAI,cAAc,OAAO,UAAU,SAAS,KAAK,QAAQ;AACzD,cAAM,IAAI,MAAM,qDAAqD,gBAAgB,oBAAoB,uBAAuB,OAAO,KAAK,QAAQ,EAAE,KAAK,IAAI,IAAI,MAAM,eAAe,2EAAqF;AAAA,MAC/Q;AAEA,eAAS,mBAAmB,aAAa;AACvC;AACE,cAAI,gBAAgB,0BAA0B,WAAW,KAAK;AAE9D,cAAI,4BAA4B,aAAa,GAAG;AAC9C;AAAA,UACD;AAED,sCAA4B,aAAa,IAAI;AAE7C,gBAAM,2LAAqM;AAAA,QAC5M;AAAA,MACH;AAEA,eAAS,YAAY,UAAU;AAC7B,YAAI,UAAU,SAAS;AACvB,YAAI,OAAO,SAAS;AACpB,eAAO,KAAK,OAAO;AAAA,MACrB;AAMA,eAAS,gBAAgB,wBAAwB;AAC/C,iBAAS,YAAY,aAAa,eAAe;AAC/C,cAAI,CAAC,wBAAwB;AAE3B;AAAA,UACD;AAED,cAAI,YAAY,YAAY;AAE5B,cAAI,cAAc,MAAM;AACtB,wBAAY,YAAY,CAAC,aAAa;AACtC,wBAAY,SAAS;AAAA,UAC3B,OAAW;AACL,sBAAU,KAAK,aAAa;AAAA,UAC7B;AAAA,QACF;AAED,iBAAS,wBAAwB,aAAa,mBAAmB;AAC/D,cAAI,CAAC,wBAAwB;AAE3B,mBAAO;AAAA,UACR;AAID,cAAI,gBAAgB;AAEpB,iBAAO,kBAAkB,MAAM;AAC7B,wBAAY,aAAa,aAAa;AACtC,4BAAgB,cAAc;AAAA,UAC/B;AAED,iBAAO;AAAA,QACR;AAED,iBAAS,qBAAqB,aAAa,mBAAmB;AAI5D,cAAI,mBAAmB,oBAAI;AAC3B,cAAI,gBAAgB;AAEpB,iBAAO,kBAAkB,MAAM;AAC7B,gBAAI,cAAc,QAAQ,MAAM;AAC9B,+BAAiB,IAAI,cAAc,KAAK,aAAa;AAAA,YAC7D,OAAa;AACL,+BAAiB,IAAI,cAAc,OAAO,aAAa;AAAA,YACxD;AAED,4BAAgB,cAAc;AAAA,UAC/B;AAED,iBAAO;AAAA,QACR;AAED,iBAAS,SAAS,OAAO,cAAc;AAGrC,cAAI,QAAQ,qBAAqB,OAAO,YAAY;AACpD,gBAAM,QAAQ;AACd,gBAAM,UAAU;AAChB,iBAAO;AAAA,QACR;AAED,iBAAS,WAAW,UAAU,iBAAiB,UAAU;AACvD,mBAAS,QAAQ;AAEjB,cAAI,CAAC,wBAAwB;AAG3B,qBAAS,SAAS;AAClB,mBAAO;AAAA,UACR;AAED,cAAIA,WAAU,SAAS;AAEvB,cAAIA,aAAY,MAAM;AACpB,gBAAI,WAAWA,SAAQ;AAEvB,gBAAI,WAAW,iBAAiB;AAE9B,uBAAS,SAAS;AAClB,qBAAO;AAAA,YACf,OAAa;AAEL,qBAAO;AAAA,YACR;AAAA,UACP,OAAW;AAEL,qBAAS,SAAS;AAClB,mBAAO;AAAA,UACR;AAAA,QACF;AAED,iBAAS,iBAAiB,UAAU;AAGlC,cAAI,0BAA0B,SAAS,cAAc,MAAM;AACzD,qBAAS,SAAS;AAAA,UACnB;AAED,iBAAO;AAAA,QACR;AAED,iBAAS,eAAe,aAAaA,UAAS,aAAa,OAAO;AAChE,cAAIA,aAAY,QAAQA,SAAQ,QAAQ,UAAU;AAEhD,gBAAI,UAAU,oBAAoB,aAAa,YAAY,MAAM,KAAK;AACtE,oBAAQ,SAAS;AACjB,mBAAO;AAAA,UACb,OAAW;AAEL,gBAAI,WAAW,SAASA,UAAS,WAAW;AAC5C,qBAAS,SAAS;AAClB,mBAAO;AAAA,UACR;AAAA,QACF;AAED,iBAAS,cAAc,aAAaA,UAAS,SAAS,OAAO;AAC3D,cAAI,cAAc,QAAQ;AAE1B,cAAI,gBAAgB,qBAAqB;AACvC,mBAAOO,gBAAe,aAAaP,UAAS,QAAQ,MAAM,UAAU,OAAO,QAAQ,GAAG;AAAA,UACvF;AAED,cAAIA,aAAY,MAAM;AACpB,gBAAIA,SAAQ,gBAAgB;AAAA,YAC3B,kCAAkCA,UAAS,OAAO;AAAA;AAAA;AAAA;AAAA,YAInD,OAAO,gBAAgB,YAAY,gBAAgB,QAAQ,YAAY,aAAa,mBAAmB,YAAY,WAAW,MAAMA,SAAQ,MAAM;AAEhJ,kBAAI,WAAW,SAASA,UAAS,QAAQ,KAAK;AAC9C,uBAAS,MAAM,UAAU,aAAaA,UAAS,OAAO;AACtD,uBAAS,SAAS;AAElB;AACE,yBAAS,eAAe,QAAQ;AAChC,yBAAS,cAAc,QAAQ;AAAA,cAChC;AAED,qBAAO;AAAA,YACR;AAAA,UACF;AAGD,cAAI,UAAU,uBAAuB,SAAS,YAAY,MAAM,KAAK;AACrE,kBAAQ,MAAM,UAAU,aAAaA,UAAS,OAAO;AACrD,kBAAQ,SAAS;AACjB,iBAAO;AAAA,QACR;AAED,iBAAS,aAAa,aAAaA,UAAS,QAAQ,OAAO;AACzD,cAAIA,aAAY,QAAQA,SAAQ,QAAQ,cAAcA,SAAQ,UAAU,kBAAkB,OAAO,iBAAiBA,SAAQ,UAAU,mBAAmB,OAAO,gBAAgB;AAE5K,gBAAI,UAAU,sBAAsB,QAAQ,YAAY,MAAM,KAAK;AACnE,oBAAQ,SAAS;AACjB,mBAAO;AAAA,UACb,OAAW;AAEL,gBAAI,WAAW,SAASA,UAAS,OAAO,YAAY,CAAA,CAAE;AACtD,qBAAS,SAAS;AAClB,mBAAO;AAAA,UACR;AAAA,QACF;AAED,iBAASO,gBAAe,aAAaP,UAAS,UAAU,OAAO,KAAK;AAClE,cAAIA,aAAY,QAAQA,SAAQ,QAAQ,UAAU;AAEhD,gBAAI,UAAU,wBAAwB,UAAU,YAAY,MAAM,OAAO,GAAG;AAC5E,oBAAQ,SAAS;AACjB,mBAAO;AAAA,UACb,OAAW;AAEL,gBAAI,WAAW,SAASA,UAAS,QAAQ;AACzC,qBAAS,SAAS;AAClB,mBAAO;AAAA,UACR;AAAA,QACF;AAED,iBAAS,YAAY,aAAa,UAAU,OAAO;AACjD,cAAI,OAAO,aAAa,YAAY,aAAa,MAAM,OAAO,aAAa,UAAU;AAInF,gBAAI,UAAU,oBAAoB,KAAK,UAAU,YAAY,MAAM,KAAK;AACxE,oBAAQ,SAAS;AACjB,mBAAO;AAAA,UACR;AAED,cAAI,OAAO,aAAa,YAAY,aAAa,MAAM;AACrD,oBAAQ,SAAS,UAAQ;AAAA,cACvB,KAAK,oBACH;AACE,oBAAI,WAAW,uBAAuB,UAAU,YAAY,MAAM,KAAK;AAEvE,yBAAS,MAAM,UAAU,aAAa,MAAM,QAAQ;AACpD,yBAAS,SAAS;AAClB,uBAAO;AAAA,cACR;AAAA,cAEH,KAAK,mBACH;AACE,oBAAI,YAAY,sBAAsB,UAAU,YAAY,MAAM,KAAK;AAEvE,0BAAU,SAAS;AACnB,uBAAO;AAAA,cACR;AAAA,cAEH,KAAK,iBACH;AACE,oBAAI,UAAU,SAAS;AACvB,oBAAI,OAAO,SAAS;AACpB,uBAAO,YAAY,aAAa,KAAK,OAAO,GAAG,KAAK;AAAA,cACrD;AAAA,YACJ;AAED,gBAAI,QAAQ,QAAQ,KAAK,cAAc,QAAQ,GAAG;AAChD,kBAAI,YAAY,wBAAwB,UAAU,YAAY,MAAM,OAAO,IAAI;AAE/E,wBAAU,SAAS;AACnB,qBAAO;AAAA,YACR;AAED,qCAAyB,aAAa,QAAQ;AAAA,UAC/C;AAED;AACE,gBAAI,OAAO,aAAa,YAAY;AAClC,iCAAmB,WAAW;AAAA,YAC/B;AAAA,UACF;AAED,iBAAO;AAAA,QACR;AAED,iBAAS,WAAW,aAAa,UAAU,UAAU,OAAO;AAE1D,cAAI,MAAM,aAAa,OAAO,SAAS,MAAM;AAE7C,cAAI,OAAO,aAAa,YAAY,aAAa,MAAM,OAAO,aAAa,UAAU;AAInF,gBAAI,QAAQ,MAAM;AAChB,qBAAO;AAAA,YACR;AAED,mBAAO,eAAe,aAAa,UAAU,KAAK,UAAU,KAAK;AAAA,UAClE;AAED,cAAI,OAAO,aAAa,YAAY,aAAa,MAAM;AACrD,oBAAQ,SAAS,UAAQ;AAAA,cACvB,KAAK,oBACH;AACE,oBAAI,SAAS,QAAQ,KAAK;AACxB,yBAAO,cAAc,aAAa,UAAU,UAAU,KAAK;AAAA,gBACzE,OAAmB;AACL,yBAAO;AAAA,gBACR;AAAA,cACF;AAAA,cAEH,KAAK,mBACH;AACE,oBAAI,SAAS,QAAQ,KAAK;AACxB,yBAAO,aAAa,aAAa,UAAU,UAAU,KAAK;AAAA,gBACxE,OAAmB;AACL,yBAAO;AAAA,gBACR;AAAA,cACF;AAAA,cAEH,KAAK,iBACH;AACE,oBAAI,UAAU,SAAS;AACvB,oBAAI,OAAO,SAAS;AACpB,uBAAO,WAAW,aAAa,UAAU,KAAK,OAAO,GAAG,KAAK;AAAA,cAC9D;AAAA,YACJ;AAED,gBAAI,QAAQ,QAAQ,KAAK,cAAc,QAAQ,GAAG;AAChD,kBAAI,QAAQ,MAAM;AAChB,uBAAO;AAAA,cACR;AAED,qBAAOO,gBAAe,aAAa,UAAU,UAAU,OAAO,IAAI;AAAA,YACnE;AAED,qCAAyB,aAAa,QAAQ;AAAA,UAC/C;AAED;AACE,gBAAI,OAAO,aAAa,YAAY;AAClC,iCAAmB,WAAW;AAAA,YAC/B;AAAA,UACF;AAED,iBAAO;AAAA,QACR;AAED,iBAAS,cAAc,kBAAkB,aAAa,QAAQ,UAAU,OAAO;AAC7E,cAAI,OAAO,aAAa,YAAY,aAAa,MAAM,OAAO,aAAa,UAAU;AAGnF,gBAAI,eAAe,iBAAiB,IAAI,MAAM,KAAK;AACnD,mBAAO,eAAe,aAAa,cAAc,KAAK,UAAU,KAAK;AAAA,UACtE;AAED,cAAI,OAAO,aAAa,YAAY,aAAa,MAAM;AACrD,oBAAQ,SAAS,UAAQ;AAAA,cACvB,KAAK,oBACH;AACE,oBAAI,gBAAgB,iBAAiB,IAAI,SAAS,QAAQ,OAAO,SAAS,SAAS,GAAG,KAAK;AAE3F,uBAAO,cAAc,aAAa,eAAe,UAAU,KAAK;AAAA,cACjE;AAAA,cAEH,KAAK,mBACH;AACE,oBAAI,iBAAiB,iBAAiB,IAAI,SAAS,QAAQ,OAAO,SAAS,SAAS,GAAG,KAAK;AAE5F,uBAAO,aAAa,aAAa,gBAAgB,UAAU,KAAK;AAAA,cACjE;AAAA,cAEH,KAAK;AACH,oBAAI,UAAU,SAAS;AACvB,oBAAI,OAAO,SAAS;AACpB,uBAAO,cAAc,kBAAkB,aAAa,QAAQ,KAAK,OAAO,GAAG,KAAK;AAAA,YACnF;AAED,gBAAI,QAAQ,QAAQ,KAAK,cAAc,QAAQ,GAAG;AAChD,kBAAI,iBAAiB,iBAAiB,IAAI,MAAM,KAAK;AAErD,qBAAOA,gBAAe,aAAa,gBAAgB,UAAU,OAAO,IAAI;AAAA,YACzE;AAED,qCAAyB,aAAa,QAAQ;AAAA,UAC/C;AAED;AACE,gBAAI,OAAO,aAAa,YAAY;AAClC,iCAAmB,WAAW;AAAA,YAC/B;AAAA,UACF;AAED,iBAAO;AAAA,QACR;AAMD,iBAAS,iBAAiB,OAAO,WAAW,aAAa;AACvD;AACE,gBAAI,OAAO,UAAU,YAAY,UAAU,MAAM;AAC/C,qBAAO;AAAA,YACR;AAED,oBAAQ,MAAM,UAAQ;AAAA,cACpB,KAAK;AAAA,cACL,KAAK;AACH,kCAAkB,OAAO,WAAW;AACpC,oBAAI,MAAM,MAAM;AAEhB,oBAAI,OAAO,QAAQ,UAAU;AAC3B;AAAA,gBACD;AAED,oBAAI,cAAc,MAAM;AACtB,8BAAY,oBAAI;AAChB,4BAAU,IAAI,GAAG;AACjB;AAAA,gBACD;AAED,oBAAI,CAAC,UAAU,IAAI,GAAG,GAAG;AACvB,4BAAU,IAAI,GAAG;AACjB;AAAA,gBACD;AAED,sBAAM,6QAAiS,GAAG;AAE1S;AAAA,cAEF,KAAK;AACH,oBAAI,UAAU,MAAM;AACpB,oBAAI,OAAO,MAAM;AACjB,iCAAiB,KAAK,OAAO,GAAG,WAAW,WAAW;AACtD;AAAA,YACH;AAAA,UACF;AAED,iBAAO;AAAA,QACR;AAED,iBAAS,uBAAuB,aAAa,mBAAmB,aAAa,OAAO;AAgBlF;AAEE,gBAAI,YAAY;AAEhB,qBAAS1H,KAAI,GAAGA,KAAI,YAAY,QAAQA,MAAK;AAC3C,kBAAI,QAAQ,YAAYA,EAAC;AACzB,0BAAY,iBAAiB,OAAO,WAAW,WAAW;AAAA,YAC3D;AAAA,UACF;AAED,cAAI,sBAAsB;AAC1B,cAAI,mBAAmB;AACvB,cAAI,WAAW;AACf,cAAI,kBAAkB;AACtB,cAAI,SAAS;AACb,cAAI,eAAe;AAEnB,iBAAO,aAAa,QAAQ,SAAS,YAAY,QAAQ,UAAU;AACjE,gBAAI,SAAS,QAAQ,QAAQ;AAC3B,6BAAe;AACf,yBAAW;AAAA,YACnB,OAAa;AACL,6BAAe,SAAS;AAAA,YACzB;AAED,gBAAI,WAAW,WAAW,aAAa,UAAU,YAAY,MAAM,GAAG,KAAK;AAE3E,gBAAI,aAAa,MAAM;AAKrB,kBAAI,aAAa,MAAM;AACrB,2BAAW;AAAA,cACZ;AAED;AAAA,YACD;AAED,gBAAI,wBAAwB;AAC1B,kBAAI,YAAY,SAAS,cAAc,MAAM;AAG3C,4BAAY,aAAa,QAAQ;AAAA,cAClC;AAAA,YACF;AAED,8BAAkB,WAAW,UAAU,iBAAiB,MAAM;AAE9D,gBAAI,qBAAqB,MAAM;AAE7B,oCAAsB;AAAA,YAC9B,OAAa;AAKL,+BAAiB,UAAU;AAAA,YAC5B;AAED,+BAAmB;AACnB,uBAAW;AAAA,UACZ;AAED,cAAI,WAAW,YAAY,QAAQ;AAEjC,oCAAwB,aAAa,QAAQ;AAE7C,gBAAI,eAAc,GAAI;AACpB,kBAAI,gBAAgB;AACpB,2BAAa,aAAa,aAAa;AAAA,YACxC;AAED,mBAAO;AAAA,UACR;AAED,cAAI,aAAa,MAAM;AAGrB,mBAAO,SAAS,YAAY,QAAQ,UAAU;AAC5C,kBAAI,YAAY,YAAY,aAAa,YAAY,MAAM,GAAG,KAAK;AAEnE,kBAAI,cAAc,MAAM;AACtB;AAAA,cACD;AAED,gCAAkB,WAAW,WAAW,iBAAiB,MAAM;AAE/D,kBAAI,qBAAqB,MAAM;AAE7B,sCAAsB;AAAA,cAChC,OAAe;AACL,iCAAiB,UAAU;AAAA,cAC5B;AAED,iCAAmB;AAAA,YACpB;AAED,gBAAI,eAAc,GAAI;AACpB,kBAAI,iBAAiB;AACrB,2BAAa,aAAa,cAAc;AAAA,YACzC;AAED,mBAAO;AAAA,UACR;AAGD,cAAI,mBAAmB,qBAAqB,aAAa,QAAQ;AAEjE,iBAAO,SAAS,YAAY,QAAQ,UAAU;AAC5C,gBAAI,aAAa,cAAc,kBAAkB,aAAa,QAAQ,YAAY,MAAM,GAAG,KAAK;AAEhG,gBAAI,eAAe,MAAM;AACvB,kBAAI,wBAAwB;AAC1B,oBAAI,WAAW,cAAc,MAAM;AAKjC,mCAAiB,OAAO,WAAW,QAAQ,OAAO,SAAS,WAAW,GAAG;AAAA,gBAC1E;AAAA,cACF;AAED,gCAAkB,WAAW,YAAY,iBAAiB,MAAM;AAEhE,kBAAI,qBAAqB,MAAM;AAC7B,sCAAsB;AAAA,cAChC,OAAe;AACL,iCAAiB,UAAU;AAAA,cAC5B;AAED,iCAAmB;AAAA,YACpB;AAAA,UACF;AAED,cAAI,wBAAwB;AAG1B,6BAAiB,QAAQ,SAAU2H,QAAO;AACxC,qBAAO,YAAY,aAAaA,MAAK;AAAA,YAC7C,CAAO;AAAA,UACF;AAED,cAAI,eAAc,GAAI;AACpB,gBAAI,kBAAkB;AACtB,yBAAa,aAAa,eAAe;AAAA,UAC1C;AAED,iBAAO;AAAA,QACR;AAED,iBAAS,0BAA0B,aAAa,mBAAmB,qBAAqB,OAAO;AAG7F,cAAI,aAAa,cAAc,mBAAmB;AAElD,cAAI,OAAO,eAAe,YAAY;AACpC,kBAAM,IAAI,MAAM,oGAAyG;AAAA,UAC1H;AAED;AAGE,gBAAI,OAAO,WAAW;AAAA,YACtB,oBAAoB,OAAO,WAAW,MAAM,aAAa;AACvD,kBAAI,CAAC,wBAAwB;AAC3B,sBAAM,gTAAoU;AAAA,cAC3U;AAED,uCAAyB;AAAA,YAC1B;AAGD,gBAAI,oBAAoB,YAAY,YAAY;AAC9C,kBAAI,CAAC,kBAAkB;AACrB,sBAAM,uFAA4F;AAAA,cACnG;AAED,iCAAmB;AAAA,YACpB;AAID,gBAAI,eAAe,WAAW,KAAK,mBAAmB;AAEtD,gBAAI,cAAc;AAChB,kBAAI,YAAY;AAEhB,kBAAI,QAAQ,aAAa;AAEzB,qBAAO,CAAC,MAAM,MAAM,QAAQ,aAAa,KAAI,GAAI;AAC/C,oBAAI,QAAQ,MAAM;AAClB,4BAAY,iBAAiB,OAAO,WAAW,WAAW;AAAA,cAC3D;AAAA,YACF;AAAA,UACF;AAED,cAAI,cAAc,WAAW,KAAK,mBAAmB;AAErD,cAAI,eAAe,MAAM;AACvB,kBAAM,IAAI,MAAM,0CAA0C;AAAA,UAC3D;AAED,cAAI,sBAAsB;AAC1B,cAAI,mBAAmB;AACvB,cAAI,WAAW;AACf,cAAI,kBAAkB;AACtB,cAAI,SAAS;AACb,cAAI,eAAe;AACnB,cAAI,OAAO,YAAY;AAEvB,iBAAO,aAAa,QAAQ,CAAC,KAAK,MAAM,UAAU,OAAO,YAAY,QAAQ;AAC3E,gBAAI,SAAS,QAAQ,QAAQ;AAC3B,6BAAe;AACf,yBAAW;AAAA,YACnB,OAAa;AACL,6BAAe,SAAS;AAAA,YACzB;AAED,gBAAI,WAAW,WAAW,aAAa,UAAU,KAAK,OAAO,KAAK;AAElE,gBAAI,aAAa,MAAM;AAKrB,kBAAI,aAAa,MAAM;AACrB,2BAAW;AAAA,cACZ;AAED;AAAA,YACD;AAED,gBAAI,wBAAwB;AAC1B,kBAAI,YAAY,SAAS,cAAc,MAAM;AAG3C,4BAAY,aAAa,QAAQ;AAAA,cAClC;AAAA,YACF;AAED,8BAAkB,WAAW,UAAU,iBAAiB,MAAM;AAE9D,gBAAI,qBAAqB,MAAM;AAE7B,oCAAsB;AAAA,YAC9B,OAAa;AAKL,+BAAiB,UAAU;AAAA,YAC5B;AAED,+BAAmB;AACnB,uBAAW;AAAA,UACZ;AAED,cAAI,KAAK,MAAM;AAEb,oCAAwB,aAAa,QAAQ;AAE7C,gBAAI,eAAc,GAAI;AACpB,kBAAI,gBAAgB;AACpB,2BAAa,aAAa,aAAa;AAAA,YACxC;AAED,mBAAO;AAAA,UACR;AAED,cAAI,aAAa,MAAM;AAGrB,mBAAO,CAAC,KAAK,MAAM,UAAU,OAAO,YAAY,QAAQ;AACtD,kBAAI,aAAa,YAAY,aAAa,KAAK,OAAO,KAAK;AAE3D,kBAAI,eAAe,MAAM;AACvB;AAAA,cACD;AAED,gCAAkB,WAAW,YAAY,iBAAiB,MAAM;AAEhE,kBAAI,qBAAqB,MAAM;AAE7B,sCAAsB;AAAA,cAChC,OAAe;AACL,iCAAiB,UAAU;AAAA,cAC5B;AAED,iCAAmB;AAAA,YACpB;AAED,gBAAI,eAAc,GAAI;AACpB,kBAAI,kBAAkB;AACtB,2BAAa,aAAa,eAAe;AAAA,YAC1C;AAED,mBAAO;AAAA,UACR;AAGD,cAAI,mBAAmB,qBAAqB,aAAa,QAAQ;AAEjE,iBAAO,CAAC,KAAK,MAAM,UAAU,OAAO,YAAY,QAAQ;AACtD,gBAAI,aAAa,cAAc,kBAAkB,aAAa,QAAQ,KAAK,OAAO,KAAK;AAEvF,gBAAI,eAAe,MAAM;AACvB,kBAAI,wBAAwB;AAC1B,oBAAI,WAAW,cAAc,MAAM;AAKjC,mCAAiB,OAAO,WAAW,QAAQ,OAAO,SAAS,WAAW,GAAG;AAAA,gBAC1E;AAAA,cACF;AAED,gCAAkB,WAAW,YAAY,iBAAiB,MAAM;AAEhE,kBAAI,qBAAqB,MAAM;AAC7B,sCAAsB;AAAA,cAChC,OAAe;AACL,iCAAiB,UAAU;AAAA,cAC5B;AAED,iCAAmB;AAAA,YACpB;AAAA,UACF;AAED,cAAI,wBAAwB;AAG1B,6BAAiB,QAAQ,SAAUA,QAAO;AACxC,qBAAO,YAAY,aAAaA,MAAK;AAAA,YAC7C,CAAO;AAAA,UACF;AAED,cAAI,eAAc,GAAI;AACpB,gBAAI,kBAAkB;AACtB,yBAAa,aAAa,eAAe;AAAA,UAC1C;AAED,iBAAO;AAAA,QACR;AAED,iBAAS,wBAAwB,aAAa,mBAAmB,aAAa,OAAO;AAGnF,cAAI,sBAAsB,QAAQ,kBAAkB,QAAQ,UAAU;AAGpE,oCAAwB,aAAa,kBAAkB,OAAO;AAC9D,gBAAI,WAAW,SAAS,mBAAmB,WAAW;AACtD,qBAAS,SAAS;AAClB,mBAAO;AAAA,UACR;AAID,kCAAwB,aAAa,iBAAiB;AACtD,cAAI,UAAU,oBAAoB,aAAa,YAAY,MAAM,KAAK;AACtE,kBAAQ,SAAS;AACjB,iBAAO;AAAA,QACR;AAED,iBAAS,uBAAuB,aAAa,mBAAmB,SAAS,OAAO;AAC9E,cAAI,MAAM,QAAQ;AAClB,cAAI,QAAQ;AAEZ,iBAAO,UAAU,MAAM;AAGrB,gBAAI,MAAM,QAAQ,KAAK;AACrB,kBAAI,cAAc,QAAQ;AAE1B,kBAAI,gBAAgB,qBAAqB;AACvC,oBAAI,MAAM,QAAQ,UAAU;AAC1B,0CAAwB,aAAa,MAAM,OAAO;AAClD,sBAAI,WAAW,SAAS,OAAO,QAAQ,MAAM,QAAQ;AACrD,2BAAS,SAAS;AAElB;AACE,6BAAS,eAAe,QAAQ;AAChC,6BAAS,cAAc,QAAQ;AAAA,kBAChC;AAED,yBAAO;AAAA,gBACR;AAAA,cACX,OAAe;AACL,oBAAI,MAAM,gBAAgB;AAAA,gBACzB,kCAAkC,OAAO,OAAO;AAAA;AAAA;AAAA;AAAA,gBAIjD,OAAO,gBAAgB,YAAY,gBAAgB,QAAQ,YAAY,aAAa,mBAAmB,YAAY,WAAW,MAAM,MAAM,MAAM;AAC9I,0CAAwB,aAAa,MAAM,OAAO;AAElD,sBAAI,YAAY,SAAS,OAAO,QAAQ,KAAK;AAE7C,4BAAU,MAAM,UAAU,aAAa,OAAO,OAAO;AACrD,4BAAU,SAAS;AAEnB;AACE,8BAAU,eAAe,QAAQ;AACjC,8BAAU,cAAc,QAAQ;AAAA,kBACjC;AAED,yBAAO;AAAA,gBACR;AAAA,cACF;AAGD,sCAAwB,aAAa,KAAK;AAC1C;AAAA,YACR,OAAa;AACL,0BAAY,aAAa,KAAK;AAAA,YAC/B;AAED,oBAAQ,MAAM;AAAA,UACf;AAED,cAAI,QAAQ,SAAS,qBAAqB;AACxC,gBAAI,UAAU,wBAAwB,QAAQ,MAAM,UAAU,YAAY,MAAM,OAAO,QAAQ,GAAG;AAClG,oBAAQ,SAAS;AACjB,mBAAO;AAAA,UACb,OAAW;AACL,gBAAI,YAAY,uBAAuB,SAAS,YAAY,MAAM,KAAK;AAEvE,sBAAU,MAAM,UAAU,aAAa,mBAAmB,OAAO;AACjE,sBAAU,SAAS;AACnB,mBAAO;AAAA,UACR;AAAA,QACF;AAED,iBAAS,sBAAsB,aAAa,mBAAmB,QAAQ,OAAO;AAC5E,cAAI,MAAM,OAAO;AACjB,cAAI,QAAQ;AAEZ,iBAAO,UAAU,MAAM;AAGrB,gBAAI,MAAM,QAAQ,KAAK;AACrB,kBAAI,MAAM,QAAQ,cAAc,MAAM,UAAU,kBAAkB,OAAO,iBAAiB,MAAM,UAAU,mBAAmB,OAAO,gBAAgB;AAClJ,wCAAwB,aAAa,MAAM,OAAO;AAClD,oBAAI,WAAW,SAAS,OAAO,OAAO,YAAY,CAAA,CAAE;AACpD,yBAAS,SAAS;AAClB,uBAAO;AAAA,cACjB,OAAe;AACL,wCAAwB,aAAa,KAAK;AAC1C;AAAA,cACD;AAAA,YACT,OAAa;AACL,0BAAY,aAAa,KAAK;AAAA,YAC/B;AAED,oBAAQ,MAAM;AAAA,UACf;AAED,cAAI,UAAU,sBAAsB,QAAQ,YAAY,MAAM,KAAK;AACnE,kBAAQ,SAAS;AACjB,iBAAO;AAAA,QACR;AAKD,iBAASC,sBAAqB,aAAa,mBAAmB,UAAU,OAAO;AAQ7E,cAAI,4BAA4B,OAAO,aAAa,YAAY,aAAa,QAAQ,SAAS,SAAS,uBAAuB,SAAS,QAAQ;AAE/I,cAAI,2BAA2B;AAC7B,uBAAW,SAAS,MAAM;AAAA,UAC3B;AAGD,cAAI,OAAO,aAAa,YAAY,aAAa,MAAM;AACrD,oBAAQ,SAAS,UAAQ;AAAA,cACvB,KAAK;AACH,uBAAO,iBAAiB,uBAAuB,aAAa,mBAAmB,UAAU,KAAK,CAAC;AAAA,cAEjG,KAAK;AACH,uBAAO,iBAAiB,sBAAsB,aAAa,mBAAmB,UAAU,KAAK,CAAC;AAAA,cAEhG,KAAK;AACH,oBAAI,UAAU,SAAS;AACvB,oBAAI,OAAO,SAAS;AAEpB,uBAAOA,sBAAqB,aAAa,mBAAmB,KAAK,OAAO,GAAG,KAAK;AAAA,YACnF;AAED,gBAAI,QAAQ,QAAQ,GAAG;AACrB,qBAAO,uBAAuB,aAAa,mBAAmB,UAAU,KAAK;AAAA,YAC9E;AAED,gBAAI,cAAc,QAAQ,GAAG;AAC3B,qBAAO,0BAA0B,aAAa,mBAAmB,UAAU,KAAK;AAAA,YACjF;AAED,qCAAyB,aAAa,QAAQ;AAAA,UAC/C;AAED,cAAI,OAAO,aAAa,YAAY,aAAa,MAAM,OAAO,aAAa,UAAU;AACnF,mBAAO,iBAAiB,wBAAwB,aAAa,mBAAmB,KAAK,UAAU,KAAK,CAAC;AAAA,UACtG;AAED;AACE,gBAAI,OAAO,aAAa,YAAY;AAClC,iCAAmB,WAAW;AAAA,YAC/B;AAAA,UACF;AAGD,iBAAO,wBAAwB,aAAa,iBAAiB;AAAA,QAC9D;AAED,eAAOA;AAAA,MACT;AAEA,UAAI,uBAAuB,gBAAgB,IAAI;AAC/C,UAAI,mBAAmB,gBAAgB,KAAK;AAC5C,eAAS,iBAAiBT,UAAST,iBAAgB;AACjD,YAAIS,aAAY,QAAQT,gBAAe,UAAUS,SAAQ,OAAO;AAC9D,gBAAM,IAAI,MAAM,oCAAoC;AAAA,QACrD;AAED,YAAIT,gBAAe,UAAU,MAAM;AACjC;AAAA,QACD;AAED,YAAI,eAAeA,gBAAe;AAClC,YAAI,WAAW,qBAAqB,cAAc,aAAa,YAAY;AAC3E,QAAAA,gBAAe,QAAQ;AACvB,iBAAS,SAASA;AAElB,eAAO,aAAa,YAAY,MAAM;AACpC,yBAAe,aAAa;AAC5B,qBAAW,SAAS,UAAU,qBAAqB,cAAc,aAAa,YAAY;AAC1F,mBAAS,SAASA;AAAA,QACnB;AAED,iBAAS,UAAU;AAAA,MACrB;AAEA,eAAS,iBAAiBA,iBAAgB,OAAO;AAC/C,YAAI,QAAQA,gBAAe;AAE3B,eAAO,UAAU,MAAM;AACrB,8BAAoB,OAAO,KAAK;AAChC,kBAAQ,MAAM;AAAA,QACf;AAAA,MACH;AAEA,UAAI,aAAa,CAAA;AACjB,UAAI,uBAAuB,aAAa,UAAU;AAClD,UAAI,0BAA0B,aAAa,UAAU;AACrD,UAAI,0BAA0B,aAAa,UAAU;AAErD,eAAS,gBAAgBxG,IAAG;AAC1B,YAAIA,OAAM,YAAY;AACpB,gBAAM,IAAI,MAAM,sGAA2G;AAAA,QAC5H;AAED,eAAOA;AAAA,MACT;AAEA,eAAS,uBAAuB;AAC9B,YAAI,eAAe,gBAAgB,wBAAwB,OAAO;AAClE,eAAO;AAAA,MACT;AAEA,eAAS,kBAAkB,OAAO,kBAAkB;AAGlD,aAAK,yBAAyB,kBAAkB,KAAK;AAGrD,aAAK,yBAAyB,OAAO,KAAK;AAM1C,aAAK,sBAAsB,YAAY,KAAK;AAC5C,YAAI,kBAAkB,mBAAmB,gBAAgB;AAEzD,YAAI,sBAAsB,KAAK;AAC/B,aAAK,sBAAsB,iBAAiB,KAAK;AAAA,MACnD;AAEA,eAAS,iBAAiB,OAAO;AAC/B,YAAI,sBAAsB,KAAK;AAC/B,YAAI,yBAAyB,KAAK;AAClC,YAAI,yBAAyB,KAAK;AAAA,MACpC;AAEA,eAAS,iBAAiB;AACxB,YAAI,UAAU,gBAAgB,qBAAqB,OAAO;AAC1D,eAAO;AAAA,MACT;AAEA,eAAS,gBAAgB,OAAO;AACX,wBAAgB,wBAAwB,OAAO;AAClE,YAAI,UAAU,gBAAgB,qBAAqB,OAAO;AAC1D,YAAI,cAAc,oBAAoB,SAAS,MAAM,IAAI;AAEzD,YAAI,YAAY,aAAa;AAC3B;AAAA,QACD;AAID,aAAK,yBAAyB,OAAO,KAAK;AAC1C,aAAK,sBAAsB,aAAa,KAAK;AAAA,MAC/C;AAEA,eAAS,eAAe,OAAO;AAG7B,YAAI,wBAAwB,YAAY,OAAO;AAC7C;AAAA,QACD;AAED,YAAI,sBAAsB,KAAK;AAC/B,YAAI,yBAAyB,KAAK;AAAA,MACpC;AAEA,UAAI,yBAAyB;AAK7B,UAAI,6BAA6B;AAQjC,UAAI,iCAAiC;AAIrC,UAAI,wBAAwB;AAC5B,UAAI,sBAAsB,aAAa,sBAAsB;AAC7D,eAAS,mBAAmB,eAAe,MAAM;AAC/C,gBAAQ,gBAAgB,UAAU;AAAA,MACpC;AACA,eAAS,iCAAiC,eAAe;AACvD,eAAO,gBAAgB;AAAA,MACzB;AACA,eAAS,0BAA0B,eAAe,gBAAgB;AAChE,eAAO,gBAAgB,6BAA6B;AAAA,MACtD;AACA,eAAS,0BAA0B,eAAe,gBAAgB;AAChE,eAAO,gBAAgB;AAAA,MACzB;AACA,eAAS,oBAAoB,OAAO,YAAY;AAC9C,aAAK,qBAAqB,YAAY,KAAK;AAAA,MAC7C;AACA,eAAS,mBAAmB,OAAO;AACjC,YAAI,qBAAqB,KAAK;AAAA,MAChC;AAEA,eAAS,sBAAsBwG,iBAAgB,oBAAoB;AAGjE,YAAI,YAAYA,gBAAe;AAE/B,YAAI,cAAc,MAAM;AACtB,cAAI,UAAU,eAAe,MAAM;AAEjC,mBAAO;AAAA,UACR;AAED,iBAAO;AAAA,QACR;AAEW,QAAAA,gBAAe;AAE3B;AACE,iBAAO;AAAA,QACR;AAAA,MACH;AACA,eAAS,mBAAmB,KAAK;AAC/B,YAAI,OAAO;AAEX,eAAO,SAAS,MAAM;AACpB,cAAI,KAAK,QAAQ,mBAAmB;AAClC,gBAAI,QAAQ,KAAK;AAEjB,gBAAI,UAAU,MAAM;AAClB,kBAAI,aAAa,MAAM;AAEvB,kBAAI,eAAe,QAAQ,0BAA0B,UAAU,KAAK,2BAA2B,UAAU,GAAG;AAC1G,uBAAO;AAAA,cACR;AAAA,YACF;AAAA,UACP,WAAe,KAAK,QAAQ;AAAA;AAAA,UAExB,KAAK,cAAc,gBAAgB,QAAW;AAC5C,gBAAI,cAAc,KAAK,QAAQ,gBAAgB;AAE/C,gBAAI,YAAY;AACd,qBAAO;AAAA,YACR;AAAA,UACP,WAAe,KAAK,UAAU,MAAM;AAC9B,iBAAK,MAAM,SAAS;AACpB,mBAAO,KAAK;AACZ;AAAA,UACD;AAED,cAAI,SAAS,KAAK;AAChB,mBAAO;AAAA,UACR;AAED,iBAAO,KAAK,YAAY,MAAM;AAC5B,gBAAI,KAAK,WAAW,QAAQ,KAAK,WAAW,KAAK;AAC/C,qBAAO;AAAA,YACR;AAED,mBAAO,KAAK;AAAA,UACb;AAED,eAAK,QAAQ,SAAS,KAAK;AAC3B,iBAAO,KAAK;AAAA,QACb;AAED,eAAO;AAAA,MACT;AAEA,UAAI;AAAA;AAAA,QAEJ;AAAA;AAEA,UAAI;AAAA;AAAA,QAEJ;AAAA;AAEA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AAKA,UAAI,wBAAwB,CAAA;AAC5B,eAAS,8BAA8B;AACrC,iBAAS1G,KAAI,GAAGA,KAAI,sBAAsB,QAAQA,MAAK;AACrD,cAAI,gBAAgB,sBAAsBA,EAAC;AAE3C;AACE,0BAAc,gCAAgC;AAAA,UAC/C;AAAA,QACF;AAED,8BAAsB,SAAS;AAAA,MACjC;AAKA,eAAS,kCAAkCoH,OAAM,eAAe;AAC9D,YAAI,aAAa,cAAc;AAC/B,YAAI,UAAU,WAAW,cAAc,OAAO;AAG9C,YAAIA,MAAK,mCAAmC,MAAM;AAChD,UAAAA,MAAK,kCAAkC,CAAC,eAAe,OAAO;AAAA,QAClE,OAAS;AACL,UAAAA,MAAK,gCAAgC,KAAK,eAAe,OAAO;AAAA,QACjE;AAAA,MACH;AAEA,UAAI,2BAA2B,qBAAqB,wBAChD,4BAA4B,qBAAqB;AACrD,UAAI;AACJ,UAAI;AAEJ;AACE,kDAA0C,oBAAI;MAChD;AAGA,UAAI,cAAc;AAGlB,UAAI,4BAA4B;AAKhC,UAAI,cAAc;AAClB,UAAI,qBAAqB;AAKzB,UAAI,+BAA+B;AAKnC,UAAI,6CAA6C;AAEjD,UAAI,iBAAiB;AAIrB,UAAI,wBAAwB;AAC5B,UAAI,kBAAkB;AAEtB,UAAI,uBAAuB;AAI3B,UAAI,eAAe;AACnB,UAAI,0BAA0B;AAI9B,UAAI,6BAA6B;AAEjC,eAAS,oBAAoB;AAC3B;AACE,cAAI,WAAW;AAEf,cAAI,iBAAiB,MAAM;AACzB,2BAAe,CAAC,QAAQ;AAAA,UAC9B,OAAW;AACL,yBAAa,KAAK,QAAQ;AAAA,UAC3B;AAAA,QACF;AAAA,MACH;AAEA,eAAS,qBAAqB;AAC5B;AACE,cAAI,WAAW;AAEf,cAAI,iBAAiB,MAAM;AACzB;AAEA,gBAAI,aAAa,uBAAuB,MAAM,UAAU;AACtD,sCAAwB,QAAQ;AAAA,YACjC;AAAA,UACF;AAAA,QACF;AAAA,MACH;AAEA,eAAS,qBAAqB,MAAM;AAClC;AACE,cAAI,SAAS,UAAa,SAAS,QAAQ,CAAC,QAAQ,IAAI,GAAG;AAGzD,kBAAM,oIAAyI,sBAAsB,OAAO,IAAI;AAAA,UACjL;AAAA,QACF;AAAA,MACH;AAEA,eAAS,wBAAwB,iBAAiB;AAChD;AACE,cAAI,gBAAgB,0BAA0B,yBAAyB;AAEvE,cAAI,CAAC,wCAAwC,IAAI,aAAa,GAAG;AAC/D,oDAAwC,IAAI,aAAa;AAEzD,gBAAI,iBAAiB,MAAM;AACzB,kBAAI,QAAQ;AACZ,kBAAI,oBAAoB;AAExB,uBAASpH,KAAI,GAAGA,MAAK,yBAAyBA,MAAK;AACjD,oBAAI,cAAc,aAAaA,EAAC;AAChC,oBAAI,cAAcA,OAAM,0BAA0B,kBAAkB;AACpE,oBAAI,MAAMA,KAAI,IAAI,OAAO;AAGzB,uBAAO,IAAI,SAAS,mBAAmB;AACrC,yBAAO;AAAA,gBACR;AAED,uBAAO,cAAc;AACrB,yBAAS;AAAA,cACV;AAED,oBAAM,iXAA+Y,eAAe,KAAK;AAAA,YAC1a;AAAA,UACF;AAAA,QACF;AAAA,MACH;AAEA,eAAS,wBAAwB;AAC/B,cAAM,IAAI,MAAM,ibAA0c;AAAA,MAC5d;AAEA,eAAS,mBAAmB,UAAU,UAAU;AAC9C;AACE,cAAI,4BAA4B;AAE9B,mBAAO;AAAA,UACR;AAAA,QACF;AAED,YAAI,aAAa,MAAM;AACrB;AACE,kBAAM,4KAAsL,oBAAoB;AAAA,UACjN;AAED,iBAAO;AAAA,QACR;AAED;AAGE,cAAI,SAAS,WAAW,SAAS,QAAQ;AACvC,kBAAM,sJAAqK,sBAAsB,MAAM,SAAS,KAAK,IAAI,IAAI,KAAK,MAAM,SAAS,KAAK,IAAI,IAAI,GAAG;AAAA,UAClQ;AAAA,QACF;AAED,iBAASA,KAAI,GAAGA,KAAI,SAAS,UAAUA,KAAI,SAAS,QAAQA,MAAK;AAC/D,cAAI,SAAS,SAASA,EAAC,GAAG,SAASA,EAAC,CAAC,GAAG;AACtC;AAAA,UACD;AAED,iBAAO;AAAA,QACR;AAED,eAAO;AAAA,MACT;AAEA,eAAS,gBAAgBmH,UAAST,iBAAgB,WAAW,OAAO,WAAW,iBAAiB;AAC9F,sBAAc;AACd,oCAA4BA;AAE5B;AACE,yBAAeS,aAAY,OAAOA,SAAQ,kBAAkB;AAC5D,oCAA0B;AAE1B,uCAA6BA,aAAY,QAAQA,SAAQ,SAAST,gBAAe;AAAA,QAClF;AAED,QAAAA,gBAAe,gBAAgB;AAC/B,QAAAA,gBAAe,cAAc;AAC7B,QAAAA,gBAAe,QAAQ;AAYvB;AACE,cAAIS,aAAY,QAAQA,SAAQ,kBAAkB,MAAM;AACtD,qCAAyB,UAAU;AAAA,UACzC,WAAe,iBAAiB,MAAM;AAMhC,qCAAyB,UAAU;AAAA,UACzC,OAAW;AACL,qCAAyB,UAAU;AAAA,UACpC;AAAA,QACF;AAED,YAAI,WAAW,UAAU,OAAO,SAAS;AAEzC,YAAI,4CAA4C;AAG9C,cAAI,oBAAoB;AAExB,aAAG;AACD,yDAA6C;AAC7C,6BAAiB;AAEjB,gBAAI,qBAAqB,iBAAiB;AACxC,oBAAM,IAAI,MAAM,sFAA2F;AAAA,YAC5G;AAED,iCAAqB;AAErB;AAGE,2CAA6B;AAAA,YAC9B;AAGD,0BAAc;AACd,iCAAqB;AACrB,YAAAT,gBAAe,cAAc;AAE7B;AAEE,wCAA0B;AAAA,YAC3B;AAED,qCAAyB,UAAW;AACpC,uBAAW,UAAU,OAAO,SAAS;AAAA,UACtC,SAAQ;AAAA,QACV;AAID,iCAAyB,UAAU;AAEnC;AACE,UAAAA,gBAAe,kBAAkB;AAAA,QAClC;AAID,YAAI,uBAAuB,gBAAgB,QAAQ,YAAY,SAAS;AACxE,sBAAc;AACd,oCAA4B;AAC5B,sBAAc;AACd,6BAAqB;AAErB;AACE,iCAAuB;AACvB,yBAAe;AACf,oCAA0B;AAK1B,cAAIS,aAAY,SAASA,SAAQ,QAAQ,iBAAiBT,gBAAe,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA,WAKhFS,SAAQ,OAAO,oBAAoB,QAAQ;AAC1C,kBAAM,uFAA4F;AAAA,UACnG;AAAA,QACF;AAED,uCAA+B;AAG/B,YAAI,sBAAsB;AACxB,gBAAM,IAAI,MAAM,iGAAsG;AAAA,QACvH;AAED,eAAO;AAAA,MACT;AACA,eAAS,uBAAuB;AAI9B,YAAI,kBAAkB,mBAAmB;AACzC,yBAAiB;AACjB,eAAO;AAAA,MACT;AACA,eAAS,aAAaA,UAAST,iBAAgB,OAAO;AACpD,QAAAA,gBAAe,cAAcS,SAAQ;AAGrC,aAAMT,gBAAe,OAAO,uBAAuB,QAAQ;AACzD,UAAAA,gBAAe,SAAS,EAAE,kBAAkB,iBAAiB,UAAU;AAAA,QAC3E,OAAS;AACL,UAAAA,gBAAe,SAAS,EAAE,UAAU;AAAA,QACrC;AAED,QAAAS,SAAQ,QAAQ,YAAYA,SAAQ,OAAO,KAAK;AAAA,MAClD;AACA,eAAS,uBAAuB;AAG9B,iCAAyB,UAAU;AAEnC,YAAI,8BAA8B;AAShC,cAAI,OAAO,0BAA0B;AAErC,iBAAO,SAAS,MAAM;AACpB,gBAAI,QAAQ,KAAK;AAEjB,gBAAI,UAAU,MAAM;AAClB,oBAAM,UAAU;AAAA,YACjB;AAED,mBAAO,KAAK;AAAA,UACb;AAED,yCAA+B;AAAA,QAChC;AAED,sBAAc;AACd,oCAA4B;AAC5B,sBAAc;AACd,6BAAqB;AAErB;AACE,yBAAe;AACf,oCAA0B;AAC1B,iCAAuB;AACvB,+CAAqC;AAAA,QACtC;AAED,qDAA6C;AAC7C,yBAAiB;AAAA,MACnB;AAEA,eAAS,0BAA0B;AACjC,YAAI,OAAO;AAAA,UACT,eAAe;AAAA,UACf,WAAW;AAAA,UACX,WAAW;AAAA,UACX,OAAO;AAAA,UACP,MAAM;AAAA,QACV;AAEE,YAAI,uBAAuB,MAAM;AAE/B,oCAA0B,gBAAgB,qBAAqB;AAAA,QACnE,OAAS;AAEL,+BAAqB,mBAAmB,OAAO;AAAA,QAChD;AAED,eAAO;AAAA,MACT;AAEA,eAAS,2BAA2B;AAMlC,YAAI;AAEJ,YAAI,gBAAgB,MAAM;AACxB,cAAIA,WAAU,0BAA0B;AAExC,cAAIA,aAAY,MAAM;AACpB,8BAAkBA,SAAQ;AAAA,UAChC,OAAW;AACL,8BAAkB;AAAA,UACnB;AAAA,QACL,OAAS;AACL,4BAAkB,YAAY;AAAA,QAC/B;AAED,YAAI;AAEJ,YAAI,uBAAuB,MAAM;AAC/B,mCAAyB,0BAA0B;AAAA,QACvD,OAAS;AACL,mCAAyB,mBAAmB;AAAA,QAC7C;AAED,YAAI,2BAA2B,MAAM;AAEnC,+BAAqB;AACrB,mCAAyB,mBAAmB;AAC5C,wBAAc;AAAA,QAClB,OAAS;AAEL,cAAI,oBAAoB,MAAM;AAC5B,kBAAM,IAAI,MAAM,sDAAsD;AAAA,UACvE;AAED,wBAAc;AACd,cAAI,UAAU;AAAA,YACZ,eAAe,YAAY;AAAA,YAC3B,WAAW,YAAY;AAAA,YACvB,WAAW,YAAY;AAAA,YACvB,OAAO,YAAY;AAAA,YACnB,MAAM;AAAA,UACZ;AAEI,cAAI,uBAAuB,MAAM;AAE/B,sCAA0B,gBAAgB,qBAAqB;AAAA,UACrE,OAAW;AAEL,iCAAqB,mBAAmB,OAAO;AAAA,UAChD;AAAA,QACF;AAED,eAAO;AAAA,MACT;AAEA,eAAS,qCAAqC;AAC5C,eAAO;AAAA,UACL,YAAY;AAAA,UACZ,QAAQ;AAAA,QACZ;AAAA,MACA;AAEA,eAAS,kBAAkB,OAAO,QAAQ;AAExC,eAAO,OAAO,WAAW,aAAa,OAAO,KAAK,IAAI;AAAA,MACxD;AAEA,eAAS,aAAa,SAAS,YAAY,MAAM;AAC/C,YAAI,OAAO;AACX,YAAI;AAEJ,YAAI,SAAS,QAAW;AACtB,yBAAe,KAAK,UAAU;AAAA,QAClC,OAAS;AACL,yBAAe;AAAA,QAChB;AAED,aAAK,gBAAgB,KAAK,YAAY;AACtC,YAAI,QAAQ;AAAA,UACV,SAAS;AAAA,UACT,aAAa;AAAA,UACb,OAAO;AAAA,UACP,UAAU;AAAA,UACV,qBAAqB;AAAA,UACrB,mBAAmB;AAAA,QACvB;AACE,aAAK,QAAQ;AACb,YAAI,WAAW,MAAM,WAAW,sBAAsB,KAAK,MAAM,2BAA2B,KAAK;AACjG,eAAO,CAAC,KAAK,eAAe,QAAQ;AAAA,MACtC;AAEA,eAAS,cAAc,SAAS,YAAY,MAAM;AAChD,YAAI,OAAO;AACX,YAAI,QAAQ,KAAK;AAEjB,YAAI,UAAU,MAAM;AAClB,gBAAM,IAAI,MAAM,2EAA2E;AAAA,QAC5F;AAED,cAAM,sBAAsB;AAC5B,YAAIA,WAAU;AAEd,YAAI,YAAYA,SAAQ;AAExB,YAAI,eAAe,MAAM;AAEzB,YAAI,iBAAiB,MAAM;AAGzB,cAAI,cAAc,MAAM;AAEtB,gBAAI,YAAY,UAAU;AAC1B,gBAAI,eAAe,aAAa;AAChC,sBAAU,OAAO;AACjB,yBAAa,OAAO;AAAA,UACrB;AAED;AACE,gBAAIA,SAAQ,cAAc,WAAW;AAGnC,oBAAM,wFAA6F;AAAA,YACpG;AAAA,UACF;AAED,UAAAA,SAAQ,YAAY,YAAY;AAChC,gBAAM,UAAU;AAAA,QACjB;AAED,YAAI,cAAc,MAAM;AAEtB,cAAI,QAAQ,UAAU;AACtB,cAAI,WAAWA,SAAQ;AACvB,cAAI,eAAe;AACnB,cAAI,oBAAoB;AACxB,cAAI,mBAAmB;AACvB,cAAI,SAAS;AAEb,aAAG;AACD,gBAAI,aAAa,OAAO;AAExB,gBAAI,CAAC,gBAAgB,aAAa,UAAU,GAAG;AAI7C,kBAAI,QAAQ;AAAA,gBACV,MAAM;AAAA,gBACN,QAAQ,OAAO;AAAA,gBACf,eAAe,OAAO;AAAA,gBACtB,YAAY,OAAO;AAAA,gBACnB,MAAM;AAAA,cAChB;AAEQ,kBAAI,qBAAqB,MAAM;AAC7B,oCAAoB,mBAAmB;AACvC,+BAAe;AAAA,cACzB,OAAe;AACL,mCAAmB,iBAAiB,OAAO;AAAA,cAC5C;AAKD,wCAA0B,QAAQ,WAAW,0BAA0B,OAAO,UAAU;AACxF,qCAAuB,UAAU;AAAA,YACzC,OAAa;AAEL,kBAAI,qBAAqB,MAAM;AAC7B,oBAAI,SAAS;AAAA;AAAA;AAAA;AAAA,kBAIX,MAAM;AAAA,kBACN,QAAQ,OAAO;AAAA,kBACf,eAAe,OAAO;AAAA,kBACtB,YAAY,OAAO;AAAA,kBACnB,MAAM;AAAA,gBAClB;AACU,mCAAmB,iBAAiB,OAAO;AAAA,cAC5C;AAGD,kBAAI,OAAO,eAAe;AAGxB,2BAAW,OAAO;AAAA,cAC5B,OAAe;AACL,oBAAI,SAAS,OAAO;AACpB,2BAAW,QAAQ,UAAU,MAAM;AAAA,cACpC;AAAA,YACF;AAED,qBAAS,OAAO;AAAA,UACjB,SAAQ,WAAW,QAAQ,WAAW;AAEvC,cAAI,qBAAqB,MAAM;AAC7B,2BAAe;AAAA,UACrB,OAAW;AACL,6BAAiB,OAAO;AAAA,UACzB;AAID,cAAI,CAAC,SAAS,UAAU,KAAK,aAAa,GAAG;AAC3C;UACD;AAED,eAAK,gBAAgB;AACrB,eAAK,YAAY;AACjB,eAAK,YAAY;AACjB,gBAAM,oBAAoB;AAAA,QAC3B;AAKD,YAAI,kBAAkB,MAAM;AAE5B,YAAI,oBAAoB,MAAM;AAC5B,cAAI,cAAc;AAElB,aAAG;AACD,gBAAI,kBAAkB,YAAY;AAClC,sCAA0B,QAAQ,WAAW,0BAA0B,OAAO,eAAe;AAC7F,mCAAuB,eAAe;AACtC,0BAAc,YAAY;AAAA,UAChC,SAAa,gBAAgB;AAAA,QAC7B,WAAa,cAAc,MAAM;AAG7B,gBAAM,QAAQ;AAAA,QACf;AAED,YAAI,WAAW,MAAM;AACrB,eAAO,CAAC,KAAK,eAAe,QAAQ;AAAA,MACtC;AAEA,eAAS,gBAAgB,SAAS,YAAY,MAAM;AAClD,YAAI,OAAO;AACX,YAAI,QAAQ,KAAK;AAEjB,YAAI,UAAU,MAAM;AAClB,gBAAM,IAAI,MAAM,2EAA2E;AAAA,QAC5F;AAED,cAAM,sBAAsB;AAG5B,YAAI,WAAW,MAAM;AACrB,YAAI,wBAAwB,MAAM;AAClC,YAAI,WAAW,KAAK;AAEpB,YAAI,0BAA0B,MAAM;AAElC,gBAAM,UAAU;AAChB,cAAI,yBAAyB,sBAAsB;AACnD,cAAI,SAAS;AAEb,aAAG;AAID,gBAAI,SAAS,OAAO;AACpB,uBAAW,QAAQ,UAAU,MAAM;AACnC,qBAAS,OAAO;AAAA,UACtB,SAAa,WAAW;AAIpB,cAAI,CAAC,SAAS,UAAU,KAAK,aAAa,GAAG;AAC3C;UACD;AAED,eAAK,gBAAgB;AAKrB,cAAI,KAAK,cAAc,MAAM;AAC3B,iBAAK,YAAY;AAAA,UAClB;AAED,gBAAM,oBAAoB;AAAA,QAC3B;AAED,eAAO,CAAC,UAAU,QAAQ;AAAA,MAC5B;AAEA,eAAS,mBAAmB,QAAQ,aAAa,WAAW;AAC1D;AACE,iBAAO;AAAA,QACR;AAAA,MACH;AAEA,eAAS,oBAAoB,QAAQ,aAAa,WAAW;AAC3D;AACE,iBAAO;AAAA,QACR;AAAA,MACH;AAEA,eAAS,uBAAuB,WAAW,aAAa,mBAAmB;AACzE,YAAI,QAAQ;AACZ,YAAI,OAAO;AACX,YAAI;AACJ,YAAIN,eAAc;AAElB,YAAIA,cAAa;AACf,cAAI,sBAAsB,QAAW;AACnC,kBAAM,IAAI,MAAM,4GAAiH;AAAA,UAClI;AAED,yBAAe,kBAAiB;AAEhC;AACE,gBAAI,CAAC,4BAA4B;AAC/B,kBAAI,iBAAiB,qBAAqB;AACxC,sBAAM,4EAA4E;AAElF,6CAA6B;AAAA,cAC9B;AAAA,YACF;AAAA,UACF;AAAA,QACL,OAAS;AACL,yBAAe,YAAW;AAE1B;AACE,gBAAI,CAAC,4BAA4B;AAC/B,kBAAI,iBAAiB;AAErB,kBAAI,CAAC,SAAS,cAAc,cAAc,GAAG;AAC3C,sBAAM,sEAAsE;AAE5E,6CAA6B;AAAA,cAC9B;AAAA,YACF;AAAA,UACF;AASD,cAAIO,QAAO;AAEX,cAAIA,UAAS,MAAM;AACjB,kBAAM,IAAI,MAAM,iFAAiF;AAAA,UAClG;AAED,cAAI,CAAC,qBAAqBA,OAAM,WAAW,GAAG;AAC5C,sCAA0B,OAAO,aAAa,YAAY;AAAA,UAC3D;AAAA,QACF;AAKD,aAAK,gBAAgB;AACrB,YAAI,OAAO;AAAA,UACT,OAAO;AAAA,UACP;AAAA,QACJ;AACE,aAAK,QAAQ;AAEb,oBAAY,iBAAiB,KAAK,MAAM,OAAO,MAAM,SAAS,GAAG,CAAC,SAAS,CAAC;AAQ5E,cAAM,SAAS;AACf,mBAAW,YAAY,WAAW,oBAAoB,KAAK,MAAM,OAAO,MAAM,cAAc,WAAW,GAAG,QAAW,IAAI;AACzH,eAAO;AAAA,MACT;AAEA,eAAS,wBAAwB,WAAW,aAAa,mBAAmB;AAC1E,YAAI,QAAQ;AACZ,YAAI,OAAO;AAIX,YAAI,eAAe;AAEnB;AACE,cAAI,CAAC,4BAA4B;AAC/B,gBAAI,iBAAiB;AAErB,gBAAI,CAAC,SAAS,cAAc,cAAc,GAAG;AAC3C,oBAAM,sEAAsE;AAE5E,2CAA6B;AAAA,YAC9B;AAAA,UACF;AAAA,QACF;AAED,YAAI,eAAe,KAAK;AACxB,YAAI,kBAAkB,CAAC,SAAS,cAAc,YAAY;AAE1D,YAAI,iBAAiB;AACnB,eAAK,gBAAgB;AACrB;QACD;AAED,YAAI,OAAO,KAAK;AAChB,qBAAa,iBAAiB,KAAK,MAAM,OAAO,MAAM,SAAS,GAAG,CAAC,SAAS,CAAC;AAK7E,YAAI,KAAK,gBAAgB,eAAe;AAAA;AAAA,QAExC,uBAAuB,QAAQ,mBAAmB,cAAc,MAAM,WAAW;AAC/E,gBAAM,SAAS;AACf,qBAAW,YAAY,WAAW,oBAAoB,KAAK,MAAM,OAAO,MAAM,cAAc,WAAW,GAAG,QAAW,IAAI;AAIzH,cAAIA,QAAO;AAEX,cAAIA,UAAS,MAAM;AACjB,kBAAM,IAAI,MAAM,iFAAiF;AAAA,UAClG;AAED,cAAI,CAAC,qBAAqBA,OAAM,WAAW,GAAG;AAC5C,sCAA0B,OAAO,aAAa,YAAY;AAAA,UAC3D;AAAA,QACF;AAED,eAAO;AAAA,MACT;AAEA,eAAS,0BAA0B,OAAO,aAAa,kBAAkB;AACvE,cAAM,SAAS;AACf,YAAI,QAAQ;AAAA,UACV;AAAA,UACA,OAAO;AAAA,QACX;AACE,YAAI,uBAAuB,0BAA0B;AAErD,YAAI,yBAAyB,MAAM;AACjC,iCAAuB,mCAAkC;AACzD,oCAA0B,cAAc;AACxC,+BAAqB,SAAS,CAAC,KAAK;AAAA,QACxC,OAAS;AACL,cAAI,SAAS,qBAAqB;AAElC,cAAI,WAAW,MAAM;AACnB,iCAAqB,SAAS,CAAC,KAAK;AAAA,UAC1C,OAAW;AACL,mBAAO,KAAK,KAAK;AAAA,UAClB;AAAA,QACF;AAAA,MACH;AAEA,eAAS,oBAAoB,OAAO,MAAM,cAAc,aAAa;AAEnE,aAAK,QAAQ;AACb,aAAK,cAAc;AAKnB,YAAI,uBAAuB,IAAI,GAAG;AAEhC,6BAAmB,KAAK;AAAA,QACzB;AAAA,MACH;AAEA,eAAS,iBAAiB,OAAO,MAAM,WAAW;AAChD,YAAI,oBAAoB,WAAY;AAGlC,cAAI,uBAAuB,IAAI,GAAG;AAEhC,+BAAmB,KAAK;AAAA,UACzB;AAAA,QACL;AAGE,eAAO,UAAU,iBAAiB;AAAA,MACpC;AAEA,eAAS,uBAAuB,MAAM;AACpC,YAAI,oBAAoB,KAAK;AAC7B,YAAI,YAAY,KAAK;AAErB,YAAI;AACF,cAAI,YAAY;AAChB,iBAAO,CAAC,SAAS,WAAW,SAAS;AAAA,QACtC,SAAQ/G,QAAO;AACd,iBAAO;AAAA,QACR;AAAA,MACH;AAEA,eAAS,mBAAmB,OAAO;AACjC,YAAI+G,QAAO,+BAA+B,OAAO,QAAQ;AAEzD,YAAIA,UAAS,MAAM;AACjB,gCAAsBA,OAAM,OAAO,UAAU,WAAW;AAAA,QACzD;AAAA,MACH;AAEA,eAAS,WAAW,cAAc;AAChC,YAAI,OAAO;AAEX,YAAI,OAAO,iBAAiB,YAAY;AAEtC,yBAAe,aAAY;AAAA,QAC5B;AAED,aAAK,gBAAgB,KAAK,YAAY;AACtC,YAAI,QAAQ;AAAA,UACV,SAAS;AAAA,UACT,aAAa;AAAA,UACb,OAAO;AAAA,UACP,UAAU;AAAA,UACV,qBAAqB;AAAA,UACrB,mBAAmB;AAAA,QACvB;AACE,aAAK,QAAQ;AACb,YAAI,WAAW,MAAM,WAAW,iBAAiB,KAAK,MAAM,2BAA2B,KAAK;AAC5F,eAAO,CAAC,KAAK,eAAe,QAAQ;AAAA,MACtC;AAEA,eAAS,YAAY,cAAc;AACjC,eAAO,cAAc,iBAAiB;AAAA,MACxC;AAEA,eAAS,cAAc,cAAc;AACnC,eAAO,gBAAgB,iBAAiB;AAAA,MAC1C;AAEA,eAAS,WAAW,KAAK,QAAQ,SAAS,MAAM;AAC9C,YAAI,SAAS;AAAA,UACX;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA;AAAA,UAEA,MAAM;AAAA,QACV;AACE,YAAI,uBAAuB,0BAA0B;AAErD,YAAI,yBAAyB,MAAM;AACjC,iCAAuB,mCAAkC;AACzD,oCAA0B,cAAc;AACxC,+BAAqB,aAAa,OAAO,OAAO;AAAA,QACpD,OAAS;AACL,cAAI,aAAa,qBAAqB;AAEtC,cAAI,eAAe,MAAM;AACvB,iCAAqB,aAAa,OAAO,OAAO;AAAA,UACtD,OAAW;AACL,gBAAI,cAAc,WAAW;AAC7B,uBAAW,OAAO;AAClB,mBAAO,OAAO;AACd,iCAAqB,aAAa;AAAA,UACnC;AAAA,QACF;AAED,eAAO;AAAA,MACT;AAEA,eAAS,SAAS,cAAc;AAC9B,YAAI,OAAO;AAEX;AACE,cAAI,QAAQ;AAAA,YACV,SAAS;AAAA,UACf;AACI,eAAK,gBAAgB;AACrB,iBAAO;AAAA,QACR;AAAA,MACH;AAEA,eAAS,UAAU,cAAc;AAC/B,YAAI,OAAO;AACX,eAAO,KAAK;AAAA,MACd;AAEA,eAAS,gBAAgB,YAAY,WAAW,QAAQ,MAAM;AAC5D,YAAI,OAAO;AACX,YAAI,WAAW,SAAS,SAAY,OAAO;AAC3C,kCAA0B,SAAS;AACnC,aAAK,gBAAgB,WAAW,YAAY,WAAW,QAAQ,QAAW,QAAQ;AAAA,MACpF;AAEA,eAAS,iBAAiB,YAAY,WAAW,QAAQ,MAAM;AAC7D,YAAI,OAAO;AACX,YAAI,WAAW,SAAS,SAAY,OAAO;AAC3C,YAAI,UAAU;AAEd,YAAI,gBAAgB,MAAM;AACxB,cAAI,aAAa,YAAY;AAC7B,oBAAU,WAAW;AAErB,cAAI,aAAa,MAAM;AACrB,gBAAI,WAAW,WAAW;AAE1B,gBAAI,mBAAmB,UAAU,QAAQ,GAAG;AAC1C,mBAAK,gBAAgB,WAAW,WAAW,QAAQ,SAAS,QAAQ;AACpE;AAAA,YACD;AAAA,UACF;AAAA,QACF;AAED,kCAA0B,SAAS;AACnC,aAAK,gBAAgB,WAAW,YAAY,WAAW,QAAQ,SAAS,QAAQ;AAAA,MAClF;AAEA,eAAS,YAAY,QAAQ,MAAM;AACjC,aAAM,0BAA0B,OAAO,uBAAuB,QAAQ;AACpE,iBAAO,gBAAgB,kBAAkB,UAAU,eAAe,WAAW,QAAQ,IAAI;AAAA,QAC7F,OAAS;AACL,iBAAO,gBAAgB,UAAU,eAAe,WAAW,QAAQ,IAAI;AAAA,QACxE;AAAA,MACH;AAEA,eAAS,aAAa,QAAQ,MAAM;AAClC,eAAO,iBAAiB,SAAS,WAAW,QAAQ,IAAI;AAAA,MAC1D;AAEA,eAAS,qBAAqB,QAAQ,MAAM;AAC1C,eAAO,gBAAgB,QAAQ,WAAW,QAAQ,IAAI;AAAA,MACxD;AAEA,eAAS,sBAAsB,QAAQ,MAAM;AAC3C,eAAO,iBAAiB,QAAQ,WAAW,QAAQ,IAAI;AAAA,MACzD;AAEA,eAAS,kBAAkB,QAAQ,MAAM;AACvC,YAAI,aAAa;AAEjB;AACE,wBAAc;AAAA,QACf;AAED,aAAM,0BAA0B,OAAO,uBAAuB,QAAQ;AACpE,wBAAc;AAAA,QACf;AAED,eAAO,gBAAgB,YAAY,QAAQ,QAAQ,IAAI;AAAA,MACzD;AAEA,eAAS,mBAAmB,QAAQ,MAAM;AACxC,eAAO,iBAAiB,QAAQ,QAAQ,QAAQ,IAAI;AAAA,MACtD;AAEA,eAAS,uBAAuB,QAAQ,KAAK;AAC3C,YAAI,OAAO,QAAQ,YAAY;AAC7B,cAAI,cAAc;AAElB,cAAI,QAAQ;AAEZ,sBAAY,KAAK;AACjB,iBAAO,WAAY;AACjB,wBAAY,IAAI;AAAA,UACtB;AAAA,QACG,WAAU,QAAQ,QAAQ,QAAQ,QAAW;AAC5C,cAAI,YAAY;AAEhB;AACE,gBAAI,CAAC,UAAU,eAAe,SAAS,GAAG;AACxC,oBAAM,gIAAqI,0BAA0B,OAAO,KAAK,SAAS,EAAE,KAAK,IAAI,IAAI,GAAG;AAAA,YAC7M;AAAA,UACF;AAED,cAAI,SAAS;AAEb,oBAAU,UAAU;AACpB,iBAAO,WAAY;AACjB,sBAAU,UAAU;AAAA,UAC1B;AAAA,QACG;AAAA,MACH;AAEA,eAAS,sBAAsB,KAAK,QAAQ,MAAM;AAChD;AACE,cAAI,OAAO,WAAW,YAAY;AAChC,kBAAM,gHAAqH,WAAW,OAAO,OAAO,SAAS,MAAM;AAAA,UACpK;AAAA,QACF;AAGD,YAAI,aAAa,SAAS,QAAQ,SAAS,SAAY,KAAK,OAAO,CAAC,GAAG,CAAC,IAAI;AAC5E,YAAI,aAAa;AAEjB;AACE,wBAAc;AAAA,QACf;AAED,aAAM,0BAA0B,OAAO,uBAAuB,QAAQ;AACpE,wBAAc;AAAA,QACf;AAED,eAAO,gBAAgB,YAAY,QAAQ,uBAAuB,KAAK,MAAM,QAAQ,GAAG,GAAG,UAAU;AAAA,MACvG;AAEA,eAAS,uBAAuB,KAAK,QAAQ,MAAM;AACjD;AACE,cAAI,OAAO,WAAW,YAAY;AAChC,kBAAM,gHAAqH,WAAW,OAAO,OAAO,SAAS,MAAM;AAAA,UACpK;AAAA,QACF;AAGD,YAAI,aAAa,SAAS,QAAQ,SAAS,SAAY,KAAK,OAAO,CAAC,GAAG,CAAC,IAAI;AAC5E,eAAO,iBAAiB,QAAQ,QAAQ,uBAAuB,KAAK,MAAM,QAAQ,GAAG,GAAG,UAAU;AAAA,MACpG;AAEA,eAAS,gBAAgB,OAAO,aAAa;AAAA,MAG7C;AAEA,UAAI,mBAAmB;AAEvB,eAAS,cAAc,UAAU,MAAM;AACrC,YAAI,OAAO;AACX,YAAI,WAAW,SAAS,SAAY,OAAO;AAC3C,aAAK,gBAAgB,CAAC,UAAU,QAAQ;AACxC,eAAO;AAAA,MACT;AAEA,eAAS,eAAe,UAAU,MAAM;AACtC,YAAI,OAAO;AACX,YAAI,WAAW,SAAS,SAAY,OAAO;AAC3C,YAAI,YAAY,KAAK;AAErB,YAAI,cAAc,MAAM;AACtB,cAAI,aAAa,MAAM;AACrB,gBAAI,WAAW,UAAU,CAAC;AAE1B,gBAAI,mBAAmB,UAAU,QAAQ,GAAG;AAC1C,qBAAO,UAAU,CAAC;AAAA,YACnB;AAAA,UACF;AAAA,QACF;AAED,aAAK,gBAAgB,CAAC,UAAU,QAAQ;AACxC,eAAO;AAAA,MACT;AAEA,eAAS,UAAU,YAAY,MAAM;AACnC,YAAI,OAAO;AACX,YAAI,WAAW,SAAS,SAAY,OAAO;AAC3C,YAAI,YAAY;AAChB,aAAK,gBAAgB,CAAC,WAAW,QAAQ;AACzC,eAAO;AAAA,MACT;AAEA,eAAS,WAAW,YAAY,MAAM;AACpC,YAAI,OAAO;AACX,YAAI,WAAW,SAAS,SAAY,OAAO;AAC3C,YAAI,YAAY,KAAK;AAErB,YAAI,cAAc,MAAM;AAEtB,cAAI,aAAa,MAAM;AACrB,gBAAI,WAAW,UAAU,CAAC;AAE1B,gBAAI,mBAAmB,UAAU,QAAQ,GAAG;AAC1C,qBAAO,UAAU,CAAC;AAAA,YACnB;AAAA,UACF;AAAA,QACF;AAED,YAAI,YAAY;AAChB,aAAK,gBAAgB,CAAC,WAAW,QAAQ;AACzC,eAAO;AAAA,MACT;AAEA,eAAS,mBAAmB,OAAO;AACjC,YAAI,OAAO;AACX,aAAK,gBAAgB;AACrB,eAAO;AAAA,MACT;AAEA,eAAS,oBAAoB,OAAO;AAClC,YAAI,OAAO;AACX,YAAI,sBAAsB;AAC1B,YAAI,YAAY,oBAAoB;AACpC,eAAO,wBAAwB,MAAM,WAAW,KAAK;AAAA,MACvD;AAEA,eAAS,sBAAsB,OAAO;AACpC,YAAI,OAAO;AAEX,YAAI,gBAAgB,MAAM;AAExB,eAAK,gBAAgB;AACrB,iBAAO;AAAA,QACX,OAAS;AAEL,cAAI,YAAY,YAAY;AAC5B,iBAAO,wBAAwB,MAAM,WAAW,KAAK;AAAA,QACtD;AAAA,MACH;AAEA,eAAS,wBAAwB,MAAM,WAAW,OAAO;AACvD,YAAI,mBAAmB,CAAC,2BAA2B,WAAW;AAE9D,YAAI,kBAAkB;AAGpB,cAAI,CAAC,SAAS,OAAO,SAAS,GAAG;AAE/B,gBAAI,eAAe;AACnB,sCAA0B,QAAQ,WAAW,0BAA0B,OAAO,YAAY;AAC1F,mCAAuB,YAAY;AAKnC,iBAAK,YAAY;AAAA,UAClB;AAGD,iBAAO;AAAA,QACX,OAAS;AASL,cAAI,KAAK,WAAW;AAElB,iBAAK,YAAY;AACjB;UACD;AAED,eAAK,gBAAgB;AACrB,iBAAO;AAAA,QACR;AAAA,MACH;AAEA,eAAS,gBAAgB,YAAY,UAAUN,UAAS;AACtD,YAAI,mBAAmB;AACvB,iCAAyB,oBAAoB,kBAAkB,uBAAuB,CAAC;AACvF,mBAAW,IAAI;AACf,YAAI,iBAAiB,0BAA0B;AAC/C,kCAA0B,aAAa;AACvC,YAAI,oBAAoB,0BAA0B;AAElD;AACE,oCAA0B,WAAW,iBAAiB,oBAAI,IAAG;AAAA,QAC9D;AAED,YAAI;AACF,qBAAW,KAAK;AAChB;QACJ,UAAY;AACR,mCAAyB,gBAAgB;AACzC,oCAA0B,aAAa;AAEvC;AACE,gBAAI,mBAAmB,QAAQ,kBAAkB,gBAAgB;AAC/D,kBAAI,qBAAqB,kBAAkB,eAAe;AAE1D,kBAAI,qBAAqB,IAAI;AAC3B,qBAAK,qMAA+M;AAAA,cACrN;AAED,gCAAkB,eAAe;YAClC;AAAA,UACF;AAAA,QACF;AAAA,MACH;AAEA,eAAS,kBAAkB;AACzB,YAAI,cAAc,WAAW,KAAK,GAC9B,YAAY,YAAY,CAAC,GACzB,aAAa,YAAY,CAAC;AAG9B,YAAI,QAAQ,gBAAgB,KAAK,MAAM,UAAU;AACjD,YAAI,OAAO;AACX,aAAK,gBAAgB;AACrB,eAAO,CAAC,WAAW,KAAK;AAAA,MAC1B;AAEA,eAAS,mBAAmB;AAC1B,YAAI,eAAe,YAAa,GAC5B,YAAY,aAAa,CAAC;AAE9B,YAAI,OAAO;AACX,YAAI,QAAQ,KAAK;AACjB,eAAO,CAAC,WAAW,KAAK;AAAA,MAC1B;AAEA,eAAS,qBAAqB;AAC5B,YAAI,iBAAiB,cAAe,GAChC,YAAY,eAAe,CAAC;AAEhC,YAAI,OAAO;AACX,YAAI,QAAQ,KAAK;AACjB,eAAO,CAAC,WAAW,KAAK;AAAA,MAC1B;AAEA,UAAI,qCAAqC;AACzC,eAAS,6CAA6C;AACpD;AACE,iBAAO;AAAA,QACR;AAAA,MACH;AAEA,eAAS,UAAU;AACjB,YAAI,OAAO;AACX,YAAIM,QAAO;AAMX,YAAI,mBAAmBA,MAAK;AAC5B,YAAI;AAEJ,YAAI,eAAc,GAAI;AACpB,cAAI,SAAS;AAEb,eAAK,MAAM,mBAAmB,MAAM;AAIpC,cAAI,UAAU;AAEd,cAAI,UAAU,GAAG;AACf,kBAAM,MAAM,QAAQ,SAAS,EAAE;AAAA,UAChC;AAED,gBAAM;AAAA,QACV,OAAS;AAEL,cAAI,iBAAiB;AACrB,eAAK,MAAM,mBAAmB,MAAM,eAAe,SAAS,EAAE,IAAI;AAAA,QACnE;AAED,aAAK,gBAAgB;AACrB,eAAO;AAAA,MACT;AAEA,eAAS,WAAW;AAClB,YAAI,OAAO;AACX,YAAI,KAAK,KAAK;AACd,eAAO;AAAA,MACT;AAEA,eAAS,sBAAsB,OAAO,OAAO,QAAQ;AACnD;AACE,cAAI,OAAO,UAAU,CAAC,MAAM,YAAY;AACtC,kBAAM,mMAA6M;AAAA,UACpN;AAAA,QACF;AAED,YAAI,OAAO,kBAAkB,KAAK;AAClC,YAAI,SAAS;AAAA,UACX;AAAA,UACA;AAAA,UACA,eAAe;AAAA,UACf,YAAY;AAAA,UACZ,MAAM;AAAA,QACV;AAEE,YAAI,oBAAoB,KAAK,GAAG;AAC9B,mCAAyB,OAAO,MAAM;AAAA,QAC1C,OAAS;AACL,cAAIA,QAAO,4BAA4B,OAAO,OAAO,QAAQ,IAAI;AAEjE,cAAIA,UAAS,MAAM;AACjB,gBAAI,YAAY;AAChB,kCAAsBA,OAAM,OAAO,MAAM,SAAS;AAClD,qCAAyBA,OAAM,OAAO,IAAI;AAAA,UAC3C;AAAA,QACF;AAED,6BAAqB,OAAO,IAAI;AAAA,MAClC;AAEA,eAAS,iBAAiB,OAAO,OAAO,QAAQ;AAC9C;AACE,cAAI,OAAO,UAAU,CAAC,MAAM,YAAY;AACtC,kBAAM,mMAA6M;AAAA,UACpN;AAAA,QACF;AAED,YAAI,OAAO,kBAAkB,KAAK;AAClC,YAAI,SAAS;AAAA,UACX;AAAA,UACA;AAAA,UACA,eAAe;AAAA,UACf,YAAY;AAAA,UACZ,MAAM;AAAA,QACV;AAEE,YAAI,oBAAoB,KAAK,GAAG;AAC9B,mCAAyB,OAAO,MAAM;AAAA,QAC1C,OAAS;AACL,cAAI,YAAY,MAAM;AAEtB,cAAI,MAAM,UAAU,YAAY,cAAc,QAAQ,UAAU,UAAU,UAAU;AAIlF,gBAAI,sBAAsB,MAAM;AAEhC,gBAAI,wBAAwB,MAAM;AAChC,kBAAI;AAEJ;AACE,iCAAiB,yBAAyB;AAC1C,yCAAyB,UAAU;AAAA,cACpC;AAED,kBAAI;AACF,oBAAI,eAAe,MAAM;AACzB,oBAAI,aAAa,oBAAoB,cAAc,MAAM;AAKzD,uBAAO,gBAAgB;AACvB,uBAAO,aAAa;AAEpB,oBAAI,SAAS,YAAY,YAAY,GAAG;AAMtC,+DAA6C,OAAO,OAAO,QAAQ,IAAI;AACvE;AAAA,gBACD;AAAA,cACF,SAAQ/G,QAAO;AAAA,cACxB,UAAkB;AACR;AACE,2CAAyB,UAAU;AAAA,gBACpC;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAED,cAAI+G,QAAO,4BAA4B,OAAO,OAAO,QAAQ,IAAI;AAEjE,cAAIA,UAAS,MAAM;AACjB,gBAAI,YAAY;AAChB,kCAAsBA,OAAM,OAAO,MAAM,SAAS;AAClD,qCAAyBA,OAAM,OAAO,IAAI;AAAA,UAC3C;AAAA,QACF;AAED,6BAAqB,OAAO,IAAI;AAAA,MAClC;AAEA,eAAS,oBAAoB,OAAO;AAClC,YAAI,YAAY,MAAM;AACtB,eAAO,UAAU,6BAA6B,cAAc,QAAQ,cAAc;AAAA,MACpF;AAEA,eAAS,yBAAyB,OAAO,QAAQ;AAI/C,qDAA6C,+BAA+B;AAC5E,YAAI,UAAU,MAAM;AAEpB,YAAI,YAAY,MAAM;AAEpB,iBAAO,OAAO;AAAA,QAClB,OAAS;AACL,iBAAO,OAAO,QAAQ;AACtB,kBAAQ,OAAO;AAAA,QAChB;AAED,cAAM,UAAU;AAAA,MAClB;AAGA,eAAS,yBAAyBA,OAAM,OAAO,MAAM;AACnD,YAAI,iBAAiB,IAAI,GAAG;AAC1B,cAAI,aAAa,MAAM;AAMvB,uBAAa,eAAe,YAAYA,MAAK,YAAY;AAEzD,cAAI,gBAAgB,WAAW,YAAY,IAAI;AAC/C,gBAAM,QAAQ;AAId,4BAAkBA,OAAM,aAAa;AAAA,QACtC;AAAA,MACH;AAEA,eAAS,qBAAqB,OAAO,MAAM,QAAQ;AAEjD;AACE,mCAAyB,OAAO,IAAI;AAAA,QACrC;AAAA,MACH;AAEA,UAAI,wBAAwB;AAAA,QAC1B;AAAA,QACA,aAAa;AAAA,QACb,YAAY;AAAA,QACZ,WAAW;AAAA,QACX,qBAAqB;AAAA,QACrB,oBAAoB;AAAA,QACpB,iBAAiB;AAAA,QACjB,SAAS;AAAA,QACT,YAAY;AAAA,QACZ,QAAQ;AAAA,QACR,UAAU;AAAA,QACV,eAAe;AAAA,QACf,kBAAkB;AAAA,QAClB,eAAe;AAAA,QACf,kBAAkB;AAAA,QAClB,sBAAsB;AAAA,QACtB,OAAO;AAAA,QACP,0BAA0B;AAAA,MAC5B;AAEA,UAAI,8BAA8B;AAClC,UAAI,2CAA2C;AAC/C,UAAI,+BAA+B;AACnC,UAAI,iCAAiC;AACrC,UAAI,2CAA2C;AAC/C,UAAI,4CAA4C;AAChD,UAAI,8CAA8C;AAElD;AACE,YAAI,2BAA2B,WAAY;AACzC,gBAAM,8PAA6Q;AAAA,QACvR;AAEE,YAAI,wBAAwB,WAAY;AACtC,gBAAM,oNAAmO;AAAA,QAC7O;AAEE,sCAA8B;AAAA,UAC5B,aAAa,SAAU,SAAS;AAC9B,mBAAO,YAAY,OAAO;AAAA,UAC3B;AAAA,UACD,aAAa,SAAU,UAAU,MAAM;AACrC,mCAAuB;AACvB;AACA,iCAAqB,IAAI;AACzB,mBAAO,cAAc,UAAU,IAAI;AAAA,UACpC;AAAA,UACD,YAAY,SAAU,SAAS;AAC7B,mCAAuB;AACvB;AACA,mBAAO,YAAY,OAAO;AAAA,UAC3B;AAAA,UACD,WAAW,SAAU,QAAQ,MAAM;AACjC,mCAAuB;AACvB;AACA,iCAAqB,IAAI;AACzB,mBAAO,YAAY,QAAQ,IAAI;AAAA,UAChC;AAAA,UACD,qBAAqB,SAAU,KAAK,QAAQ,MAAM;AAChD,mCAAuB;AACvB;AACA,iCAAqB,IAAI;AACzB,mBAAO,sBAAsB,KAAK,QAAQ,IAAI;AAAA,UAC/C;AAAA,UACD,oBAAoB,SAAU,QAAQ,MAAM;AAC1C,mCAAuB;AACvB;AACA,iCAAqB,IAAI;AACzB,mBAAO,qBAAqB,QAAQ,IAAI;AAAA,UACzC;AAAA,UACD,iBAAiB,SAAU,QAAQ,MAAM;AACvC,mCAAuB;AACvB;AACA,iCAAqB,IAAI;AACzB,mBAAO,kBAAkB,QAAQ,IAAI;AAAA,UACtC;AAAA,UACD,SAAS,SAAU,QAAQ,MAAM;AAC/B,mCAAuB;AACvB;AACA,iCAAqB,IAAI;AACzB,gBAAI,iBAAiB,yBAAyB;AAC9C,qCAAyB,UAAU;AAEnC,gBAAI;AACF,qBAAO,UAAU,QAAQ,IAAI;AAAA,YACrC,UAAgB;AACR,uCAAyB,UAAU;AAAA,YACpC;AAAA,UACF;AAAA,UACD,YAAY,SAAU,SAAS,YAAY,MAAM;AAC/C,mCAAuB;AACvB;AACA,gBAAI,iBAAiB,yBAAyB;AAC9C,qCAAyB,UAAU;AAEnC,gBAAI;AACF,qBAAO,aAAa,SAAS,YAAY,IAAI;AAAA,YACrD,UAAgB;AACR,uCAAyB,UAAU;AAAA,YACpC;AAAA,UACF;AAAA,UACD,QAAQ,SAAU,cAAc;AAC9B,mCAAuB;AACvB;AACA,mBAAO,SAAS,YAAY;AAAA,UAC7B;AAAA,UACD,UAAU,SAAU,cAAc;AAChC,mCAAuB;AACvB;AACA,gBAAI,iBAAiB,yBAAyB;AAC9C,qCAAyB,UAAU;AAEnC,gBAAI;AACF,qBAAO,WAAW,YAAY;AAAA,YACtC,UAAgB;AACR,uCAAyB,UAAU;AAAA,YACpC;AAAA,UACF;AAAA,UACD,eAAe,SAAU,OAAO,aAAa;AAC3C,mCAAuB;AACvB;AACA,mBAAO,gBAAe;AAAA,UACvB;AAAA,UACD,kBAAkB,SAAU,OAAO;AACjC,mCAAuB;AACvB;AACA,mBAAO,mBAAmB,KAAK;AAAA,UAChC;AAAA,UACD,eAAe,WAAY;AACzB,mCAAuB;AACvB;AACA,mBAAO,gBAAe;AAAA,UACvB;AAAA,UACD,kBAAkB,SAAU,QAAQ,aAAa,WAAW;AAC1D,mCAAuB;AACvB;AACA,mBAAO,mBAAkB;AAAA,UAC1B;AAAA,UACD,sBAAsB,SAAU,WAAW,aAAa,mBAAmB;AACzE,mCAAuB;AACvB;AACA,mBAAO,uBAAuB,WAAW,aAAa,iBAAiB;AAAA,UACxE;AAAA,UACD,OAAO,WAAY;AACjB,mCAAuB;AACvB;AACA,mBAAO,QAAO;AAAA,UACf;AAAA,UACD,0BAA0B;AAAA,QAC9B;AAEE,mDAA2C;AAAA,UACzC,aAAa,SAAU,SAAS;AAC9B,mBAAO,YAAY,OAAO;AAAA,UAC3B;AAAA,UACD,aAAa,SAAU,UAAU,MAAM;AACrC,mCAAuB;AACvB;AACA,mBAAO,cAAc,UAAU,IAAI;AAAA,UACpC;AAAA,UACD,YAAY,SAAU,SAAS;AAC7B,mCAAuB;AACvB;AACA,mBAAO,YAAY,OAAO;AAAA,UAC3B;AAAA,UACD,WAAW,SAAU,QAAQ,MAAM;AACjC,mCAAuB;AACvB;AACA,mBAAO,YAAY,QAAQ,IAAI;AAAA,UAChC;AAAA,UACD,qBAAqB,SAAU,KAAK,QAAQ,MAAM;AAChD,mCAAuB;AACvB;AACA,mBAAO,sBAAsB,KAAK,QAAQ,IAAI;AAAA,UAC/C;AAAA,UACD,oBAAoB,SAAU,QAAQ,MAAM;AAC1C,mCAAuB;AACvB;AACA,mBAAO,qBAAqB,QAAQ,IAAI;AAAA,UACzC;AAAA,UACD,iBAAiB,SAAU,QAAQ,MAAM;AACvC,mCAAuB;AACvB;AACA,mBAAO,kBAAkB,QAAQ,IAAI;AAAA,UACtC;AAAA,UACD,SAAS,SAAU,QAAQ,MAAM;AAC/B,mCAAuB;AACvB;AACA,gBAAI,iBAAiB,yBAAyB;AAC9C,qCAAyB,UAAU;AAEnC,gBAAI;AACF,qBAAO,UAAU,QAAQ,IAAI;AAAA,YACrC,UAAgB;AACR,uCAAyB,UAAU;AAAA,YACpC;AAAA,UACF;AAAA,UACD,YAAY,SAAU,SAAS,YAAY,MAAM;AAC/C,mCAAuB;AACvB;AACA,gBAAI,iBAAiB,yBAAyB;AAC9C,qCAAyB,UAAU;AAEnC,gBAAI;AACF,qBAAO,aAAa,SAAS,YAAY,IAAI;AAAA,YACrD,UAAgB;AACR,uCAAyB,UAAU;AAAA,YACpC;AAAA,UACF;AAAA,UACD,QAAQ,SAAU,cAAc;AAC9B,mCAAuB;AACvB;AACA,mBAAO,SAAS,YAAY;AAAA,UAC7B;AAAA,UACD,UAAU,SAAU,cAAc;AAChC,mCAAuB;AACvB;AACA,gBAAI,iBAAiB,yBAAyB;AAC9C,qCAAyB,UAAU;AAEnC,gBAAI;AACF,qBAAO,WAAW,YAAY;AAAA,YACtC,UAAgB;AACR,uCAAyB,UAAU;AAAA,YACpC;AAAA,UACF;AAAA,UACD,eAAe,SAAU,OAAO,aAAa;AAC3C,mCAAuB;AACvB;AACA,mBAAO,gBAAe;AAAA,UACvB;AAAA,UACD,kBAAkB,SAAU,OAAO;AACjC,mCAAuB;AACvB;AACA,mBAAO,mBAAmB,KAAK;AAAA,UAChC;AAAA,UACD,eAAe,WAAY;AACzB,mCAAuB;AACvB;AACA,mBAAO,gBAAe;AAAA,UACvB;AAAA,UACD,kBAAkB,SAAU,QAAQ,aAAa,WAAW;AAC1D,mCAAuB;AACvB;AACA,mBAAO,mBAAkB;AAAA,UAC1B;AAAA,UACD,sBAAsB,SAAU,WAAW,aAAa,mBAAmB;AACzE,mCAAuB;AACvB;AACA,mBAAO,uBAAuB,WAAW,aAAa,iBAAiB;AAAA,UACxE;AAAA,UACD,OAAO,WAAY;AACjB,mCAAuB;AACvB;AACA,mBAAO,QAAO;AAAA,UACf;AAAA,UACD,0BAA0B;AAAA,QAC9B;AAEE,uCAA+B;AAAA,UAC7B,aAAa,SAAU,SAAS;AAC9B,mBAAO,YAAY,OAAO;AAAA,UAC3B;AAAA,UACD,aAAa,SAAU,UAAU,MAAM;AACrC,mCAAuB;AACvB;AACA,mBAAO,eAAe,UAAU,IAAI;AAAA,UACrC;AAAA,UACD,YAAY,SAAU,SAAS;AAC7B,mCAAuB;AACvB;AACA,mBAAO,YAAY,OAAO;AAAA,UAC3B;AAAA,UACD,WAAW,SAAU,QAAQ,MAAM;AACjC,mCAAuB;AACvB;AACA,mBAAO,aAAa,QAAQ,IAAI;AAAA,UACjC;AAAA,UACD,qBAAqB,SAAU,KAAK,QAAQ,MAAM;AAChD,mCAAuB;AACvB;AACA,mBAAO,uBAAuB,KAAK,QAAQ,IAAI;AAAA,UAChD;AAAA,UACD,oBAAoB,SAAU,QAAQ,MAAM;AAC1C,mCAAuB;AACvB;AACA,mBAAO,sBAAsB,QAAQ,IAAI;AAAA,UAC1C;AAAA,UACD,iBAAiB,SAAU,QAAQ,MAAM;AACvC,mCAAuB;AACvB;AACA,mBAAO,mBAAmB,QAAQ,IAAI;AAAA,UACvC;AAAA,UACD,SAAS,SAAU,QAAQ,MAAM;AAC/B,mCAAuB;AACvB;AACA,gBAAI,iBAAiB,yBAAyB;AAC9C,qCAAyB,UAAU;AAEnC,gBAAI;AACF,qBAAO,WAAW,QAAQ,IAAI;AAAA,YACtC,UAAgB;AACR,uCAAyB,UAAU;AAAA,YACpC;AAAA,UACF;AAAA,UACD,YAAY,SAAU,SAAS,YAAY,MAAM;AAC/C,mCAAuB;AACvB;AACA,gBAAI,iBAAiB,yBAAyB;AAC9C,qCAAyB,UAAU;AAEnC,gBAAI;AACF,qBAAO,cAAc,SAAS,YAAY,IAAI;AAAA,YACtD,UAAgB;AACR,uCAAyB,UAAU;AAAA,YACpC;AAAA,UACF;AAAA,UACD,QAAQ,SAAU,cAAc;AAC9B,mCAAuB;AACvB;AACA,mBAAO,UAAS;AAAA,UACjB;AAAA,UACD,UAAU,SAAU,cAAc;AAChC,mCAAuB;AACvB;AACA,gBAAI,iBAAiB,yBAAyB;AAC9C,qCAAyB,UAAU;AAEnC,gBAAI;AACF,qBAAO,YAAY,YAAY;AAAA,YACvC,UAAgB;AACR,uCAAyB,UAAU;AAAA,YACpC;AAAA,UACF;AAAA,UACD,eAAe,SAAU,OAAO,aAAa;AAC3C,mCAAuB;AACvB;AACA,mBAAO,iBAAgB;AAAA,UACxB;AAAA,UACD,kBAAkB,SAAU,OAAO;AACjC,mCAAuB;AACvB;AACA,mBAAO,oBAAoB,KAAK;AAAA,UACjC;AAAA,UACD,eAAe,WAAY;AACzB,mCAAuB;AACvB;AACA,mBAAO,iBAAgB;AAAA,UACxB;AAAA,UACD,kBAAkB,SAAU,QAAQ,aAAa,WAAW;AAC1D,mCAAuB;AACvB;AACA,mBAAO,oBAAmB;AAAA,UAC3B;AAAA,UACD,sBAAsB,SAAU,WAAW,aAAa,mBAAmB;AACzE,mCAAuB;AACvB;AACA,mBAAO,wBAAwB,WAAW,WAAW;AAAA,UACtD;AAAA,UACD,OAAO,WAAY;AACjB,mCAAuB;AACvB;AACA,mBAAO,SAAQ;AAAA,UAChB;AAAA,UACD,0BAA0B;AAAA,QAC9B;AAEE,yCAAiC;AAAA,UAC/B,aAAa,SAAU,SAAS;AAC9B,mBAAO,YAAY,OAAO;AAAA,UAC3B;AAAA,UACD,aAAa,SAAU,UAAU,MAAM;AACrC,mCAAuB;AACvB;AACA,mBAAO,eAAe,UAAU,IAAI;AAAA,UACrC;AAAA,UACD,YAAY,SAAU,SAAS;AAC7B,mCAAuB;AACvB;AACA,mBAAO,YAAY,OAAO;AAAA,UAC3B;AAAA,UACD,WAAW,SAAU,QAAQ,MAAM;AACjC,mCAAuB;AACvB;AACA,mBAAO,aAAa,QAAQ,IAAI;AAAA,UACjC;AAAA,UACD,qBAAqB,SAAU,KAAK,QAAQ,MAAM;AAChD,mCAAuB;AACvB;AACA,mBAAO,uBAAuB,KAAK,QAAQ,IAAI;AAAA,UAChD;AAAA,UACD,oBAAoB,SAAU,QAAQ,MAAM;AAC1C,mCAAuB;AACvB;AACA,mBAAO,sBAAsB,QAAQ,IAAI;AAAA,UAC1C;AAAA,UACD,iBAAiB,SAAU,QAAQ,MAAM;AACvC,mCAAuB;AACvB;AACA,mBAAO,mBAAmB,QAAQ,IAAI;AAAA,UACvC;AAAA,UACD,SAAS,SAAU,QAAQ,MAAM;AAC/B,mCAAuB;AACvB;AACA,gBAAI,iBAAiB,yBAAyB;AAC9C,qCAAyB,UAAU;AAEnC,gBAAI;AACF,qBAAO,WAAW,QAAQ,IAAI;AAAA,YACtC,UAAgB;AACR,uCAAyB,UAAU;AAAA,YACpC;AAAA,UACF;AAAA,UACD,YAAY,SAAU,SAAS,YAAY,MAAM;AAC/C,mCAAuB;AACvB;AACA,gBAAI,iBAAiB,yBAAyB;AAC9C,qCAAyB,UAAU;AAEnC,gBAAI;AACF,qBAAO,gBAAgB,SAAS,YAAY,IAAI;AAAA,YACxD,UAAgB;AACR,uCAAyB,UAAU;AAAA,YACpC;AAAA,UACF;AAAA,UACD,QAAQ,SAAU,cAAc;AAC9B,mCAAuB;AACvB;AACA,mBAAO,UAAS;AAAA,UACjB;AAAA,UACD,UAAU,SAAU,cAAc;AAChC,mCAAuB;AACvB;AACA,gBAAI,iBAAiB,yBAAyB;AAC9C,qCAAyB,UAAU;AAEnC,gBAAI;AACF,qBAAO,cAAc,YAAY;AAAA,YACzC,UAAgB;AACR,uCAAyB,UAAU;AAAA,YACpC;AAAA,UACF;AAAA,UACD,eAAe,SAAU,OAAO,aAAa;AAC3C,mCAAuB;AACvB;AACA,mBAAO,iBAAgB;AAAA,UACxB;AAAA,UACD,kBAAkB,SAAU,OAAO;AACjC,mCAAuB;AACvB;AACA,mBAAO,sBAAsB,KAAK;AAAA,UACnC;AAAA,UACD,eAAe,WAAY;AACzB,mCAAuB;AACvB;AACA,mBAAO,mBAAkB;AAAA,UAC1B;AAAA,UACD,kBAAkB,SAAU,QAAQ,aAAa,WAAW;AAC1D,mCAAuB;AACvB;AACA,mBAAO,oBAAmB;AAAA,UAC3B;AAAA,UACD,sBAAsB,SAAU,WAAW,aAAa,mBAAmB;AACzE,mCAAuB;AACvB;AACA,mBAAO,wBAAwB,WAAW,WAAW;AAAA,UACtD;AAAA,UACD,OAAO,WAAY;AACjB,mCAAuB;AACvB;AACA,mBAAO,SAAQ;AAAA,UAChB;AAAA,UACD,0BAA0B;AAAA,QAC9B;AAEE,mDAA2C;AAAA,UACzC,aAAa,SAAU,SAAS;AAC9B;AACA,mBAAO,YAAY,OAAO;AAAA,UAC3B;AAAA,UACD,aAAa,SAAU,UAAU,MAAM;AACrC,mCAAuB;AACvB;AACA;AACA,mBAAO,cAAc,UAAU,IAAI;AAAA,UACpC;AAAA,UACD,YAAY,SAAU,SAAS;AAC7B,mCAAuB;AACvB;AACA;AACA,mBAAO,YAAY,OAAO;AAAA,UAC3B;AAAA,UACD,WAAW,SAAU,QAAQ,MAAM;AACjC,mCAAuB;AACvB;AACA;AACA,mBAAO,YAAY,QAAQ,IAAI;AAAA,UAChC;AAAA,UACD,qBAAqB,SAAU,KAAK,QAAQ,MAAM;AAChD,mCAAuB;AACvB;AACA;AACA,mBAAO,sBAAsB,KAAK,QAAQ,IAAI;AAAA,UAC/C;AAAA,UACD,oBAAoB,SAAU,QAAQ,MAAM;AAC1C,mCAAuB;AACvB;AACA;AACA,mBAAO,qBAAqB,QAAQ,IAAI;AAAA,UACzC;AAAA,UACD,iBAAiB,SAAU,QAAQ,MAAM;AACvC,mCAAuB;AACvB;AACA;AACA,mBAAO,kBAAkB,QAAQ,IAAI;AAAA,UACtC;AAAA,UACD,SAAS,SAAU,QAAQ,MAAM;AAC/B,mCAAuB;AACvB;AACA;AACA,gBAAI,iBAAiB,yBAAyB;AAC9C,qCAAyB,UAAU;AAEnC,gBAAI;AACF,qBAAO,UAAU,QAAQ,IAAI;AAAA,YACrC,UAAgB;AACR,uCAAyB,UAAU;AAAA,YACpC;AAAA,UACF;AAAA,UACD,YAAY,SAAU,SAAS,YAAY,MAAM;AAC/C,mCAAuB;AACvB;AACA;AACA,gBAAI,iBAAiB,yBAAyB;AAC9C,qCAAyB,UAAU;AAEnC,gBAAI;AACF,qBAAO,aAAa,SAAS,YAAY,IAAI;AAAA,YACrD,UAAgB;AACR,uCAAyB,UAAU;AAAA,YACpC;AAAA,UACF;AAAA,UACD,QAAQ,SAAU,cAAc;AAC9B,mCAAuB;AACvB;AACA;AACA,mBAAO,SAAS,YAAY;AAAA,UAC7B;AAAA,UACD,UAAU,SAAU,cAAc;AAChC,mCAAuB;AACvB;AACA;AACA,gBAAI,iBAAiB,yBAAyB;AAC9C,qCAAyB,UAAU;AAEnC,gBAAI;AACF,qBAAO,WAAW,YAAY;AAAA,YACtC,UAAgB;AACR,uCAAyB,UAAU;AAAA,YACpC;AAAA,UACF;AAAA,UACD,eAAe,SAAU,OAAO,aAAa;AAC3C,mCAAuB;AACvB;AACA;AACA,mBAAO,gBAAe;AAAA,UACvB;AAAA,UACD,kBAAkB,SAAU,OAAO;AACjC,mCAAuB;AACvB;AACA;AACA,mBAAO,mBAAmB,KAAK;AAAA,UAChC;AAAA,UACD,eAAe,WAAY;AACzB,mCAAuB;AACvB;AACA;AACA,mBAAO,gBAAe;AAAA,UACvB;AAAA,UACD,kBAAkB,SAAU,QAAQ,aAAa,WAAW;AAC1D,mCAAuB;AACvB;AACA;AACA,mBAAO,mBAAkB;AAAA,UAC1B;AAAA,UACD,sBAAsB,SAAU,WAAW,aAAa,mBAAmB;AACzE,mCAAuB;AACvB;AACA;AACA,mBAAO,uBAAuB,WAAW,aAAa,iBAAiB;AAAA,UACxE;AAAA,UACD,OAAO,WAAY;AACjB,mCAAuB;AACvB;AACA;AACA,mBAAO,QAAO;AAAA,UACf;AAAA,UACD,0BAA0B;AAAA,QAC9B;AAEE,oDAA4C;AAAA,UAC1C,aAAa,SAAU,SAAS;AAC9B;AACA,mBAAO,YAAY,OAAO;AAAA,UAC3B;AAAA,UACD,aAAa,SAAU,UAAU,MAAM;AACrC,mCAAuB;AACvB;AACA;AACA,mBAAO,eAAe,UAAU,IAAI;AAAA,UACrC;AAAA,UACD,YAAY,SAAU,SAAS;AAC7B,mCAAuB;AACvB;AACA;AACA,mBAAO,YAAY,OAAO;AAAA,UAC3B;AAAA,UACD,WAAW,SAAU,QAAQ,MAAM;AACjC,mCAAuB;AACvB;AACA;AACA,mBAAO,aAAa,QAAQ,IAAI;AAAA,UACjC;AAAA,UACD,qBAAqB,SAAU,KAAK,QAAQ,MAAM;AAChD,mCAAuB;AACvB;AACA;AACA,mBAAO,uBAAuB,KAAK,QAAQ,IAAI;AAAA,UAChD;AAAA,UACD,oBAAoB,SAAU,QAAQ,MAAM;AAC1C,mCAAuB;AACvB;AACA;AACA,mBAAO,sBAAsB,QAAQ,IAAI;AAAA,UAC1C;AAAA,UACD,iBAAiB,SAAU,QAAQ,MAAM;AACvC,mCAAuB;AACvB;AACA;AACA,mBAAO,mBAAmB,QAAQ,IAAI;AAAA,UACvC;AAAA,UACD,SAAS,SAAU,QAAQ,MAAM;AAC/B,mCAAuB;AACvB;AACA;AACA,gBAAI,iBAAiB,yBAAyB;AAC9C,qCAAyB,UAAU;AAEnC,gBAAI;AACF,qBAAO,WAAW,QAAQ,IAAI;AAAA,YACtC,UAAgB;AACR,uCAAyB,UAAU;AAAA,YACpC;AAAA,UACF;AAAA,UACD,YAAY,SAAU,SAAS,YAAY,MAAM;AAC/C,mCAAuB;AACvB;AACA;AACA,gBAAI,iBAAiB,yBAAyB;AAC9C,qCAAyB,UAAU;AAEnC,gBAAI;AACF,qBAAO,cAAc,SAAS,YAAY,IAAI;AAAA,YACtD,UAAgB;AACR,uCAAyB,UAAU;AAAA,YACpC;AAAA,UACF;AAAA,UACD,QAAQ,SAAU,cAAc;AAC9B,mCAAuB;AACvB;AACA;AACA,mBAAO,UAAS;AAAA,UACjB;AAAA,UACD,UAAU,SAAU,cAAc;AAChC,mCAAuB;AACvB;AACA;AACA,gBAAI,iBAAiB,yBAAyB;AAC9C,qCAAyB,UAAU;AAEnC,gBAAI;AACF,qBAAO,YAAY,YAAY;AAAA,YACvC,UAAgB;AACR,uCAAyB,UAAU;AAAA,YACpC;AAAA,UACF;AAAA,UACD,eAAe,SAAU,OAAO,aAAa;AAC3C,mCAAuB;AACvB;AACA;AACA,mBAAO,iBAAgB;AAAA,UACxB;AAAA,UACD,kBAAkB,SAAU,OAAO;AACjC,mCAAuB;AACvB;AACA;AACA,mBAAO,oBAAoB,KAAK;AAAA,UACjC;AAAA,UACD,eAAe,WAAY;AACzB,mCAAuB;AACvB;AACA;AACA,mBAAO,iBAAgB;AAAA,UACxB;AAAA,UACD,kBAAkB,SAAU,QAAQ,aAAa,WAAW;AAC1D,mCAAuB;AACvB;AACA;AACA,mBAAO,oBAAmB;AAAA,UAC3B;AAAA,UACD,sBAAsB,SAAU,WAAW,aAAa,mBAAmB;AACzE,mCAAuB;AACvB;AACA;AACA,mBAAO,wBAAwB,WAAW,WAAW;AAAA,UACtD;AAAA,UACD,OAAO,WAAY;AACjB,mCAAuB;AACvB;AACA;AACA,mBAAO,SAAQ;AAAA,UAChB;AAAA,UACD,0BAA0B;AAAA,QAC9B;AAEE,sDAA8C;AAAA,UAC5C,aAAa,SAAU,SAAS;AAC9B;AACA,mBAAO,YAAY,OAAO;AAAA,UAC3B;AAAA,UACD,aAAa,SAAU,UAAU,MAAM;AACrC,mCAAuB;AACvB;AACA;AACA,mBAAO,eAAe,UAAU,IAAI;AAAA,UACrC;AAAA,UACD,YAAY,SAAU,SAAS;AAC7B,mCAAuB;AACvB;AACA;AACA,mBAAO,YAAY,OAAO;AAAA,UAC3B;AAAA,UACD,WAAW,SAAU,QAAQ,MAAM;AACjC,mCAAuB;AACvB;AACA;AACA,mBAAO,aAAa,QAAQ,IAAI;AAAA,UACjC;AAAA,UACD,qBAAqB,SAAU,KAAK,QAAQ,MAAM;AAChD,mCAAuB;AACvB;AACA;AACA,mBAAO,uBAAuB,KAAK,QAAQ,IAAI;AAAA,UAChD;AAAA,UACD,oBAAoB,SAAU,QAAQ,MAAM;AAC1C,mCAAuB;AACvB;AACA;AACA,mBAAO,sBAAsB,QAAQ,IAAI;AAAA,UAC1C;AAAA,UACD,iBAAiB,SAAU,QAAQ,MAAM;AACvC,mCAAuB;AACvB;AACA;AACA,mBAAO,mBAAmB,QAAQ,IAAI;AAAA,UACvC;AAAA,UACD,SAAS,SAAU,QAAQ,MAAM;AAC/B,mCAAuB;AACvB;AACA;AACA,gBAAI,iBAAiB,yBAAyB;AAC9C,qCAAyB,UAAU;AAEnC,gBAAI;AACF,qBAAO,WAAW,QAAQ,IAAI;AAAA,YACtC,UAAgB;AACR,uCAAyB,UAAU;AAAA,YACpC;AAAA,UACF;AAAA,UACD,YAAY,SAAU,SAAS,YAAY,MAAM;AAC/C,mCAAuB;AACvB;AACA;AACA,gBAAI,iBAAiB,yBAAyB;AAC9C,qCAAyB,UAAU;AAEnC,gBAAI;AACF,qBAAO,gBAAgB,SAAS,YAAY,IAAI;AAAA,YACxD,UAAgB;AACR,uCAAyB,UAAU;AAAA,YACpC;AAAA,UACF;AAAA,UACD,QAAQ,SAAU,cAAc;AAC9B,mCAAuB;AACvB;AACA;AACA,mBAAO,UAAS;AAAA,UACjB;AAAA,UACD,UAAU,SAAU,cAAc;AAChC,mCAAuB;AACvB;AACA;AACA,gBAAI,iBAAiB,yBAAyB;AAC9C,qCAAyB,UAAU;AAEnC,gBAAI;AACF,qBAAO,cAAc,YAAY;AAAA,YACzC,UAAgB;AACR,uCAAyB,UAAU;AAAA,YACpC;AAAA,UACF;AAAA,UACD,eAAe,SAAU,OAAO,aAAa;AAC3C,mCAAuB;AACvB;AACA;AACA,mBAAO,iBAAgB;AAAA,UACxB;AAAA,UACD,kBAAkB,SAAU,OAAO;AACjC,mCAAuB;AACvB;AACA;AACA,mBAAO,sBAAsB,KAAK;AAAA,UACnC;AAAA,UACD,eAAe,WAAY;AACzB,mCAAuB;AACvB;AACA;AACA,mBAAO,mBAAkB;AAAA,UAC1B;AAAA,UACD,kBAAkB,SAAU,QAAQ,aAAa,WAAW;AAC1D,mCAAuB;AACvB;AACA;AACA,mBAAO,oBAAmB;AAAA,UAC3B;AAAA,UACD,sBAAsB,SAAU,WAAW,aAAa,mBAAmB;AACzE,mCAAuB;AACvB;AACA;AACA,mBAAO,wBAAwB,WAAW,WAAW;AAAA,UACtD;AAAA,UACD,OAAO,WAAY;AACjB,mCAAuB;AACvB;AACA;AACA,mBAAO,SAAQ;AAAA,UAChB;AAAA,UACD,0BAA0B;AAAA,QAC9B;AAAA,MACA;AAEA,UAAI,QAAQ,UAAU;AACtB,UAAI,aAAa;AACjB,UAAI,wBAAwB;AAC5B,UAAI,oBAAoB;AACxB,UAAI,yBAAyB;AAkB7B,UAAI,wBAAwB;AAC5B,UAAI,wBAAwB;AAE5B,eAAS,wBAAwB;AAC/B,eAAO;AAAA,MACT;AAEA,eAAS,4BAA4B;AACnC;AACE,kCAAwB;AAAA,QACzB;AAAA,MACH;AAEA,eAAS,wBAAwB;AAC/B;AACE,kCAAwB;AACxB,kCAAwB;AAAA,QACzB;AAAA,MACH;AAEA,eAAS,uBAAuB;AAC9B;AACE,kCAAwB;AACxB,kCAAwB;AAAA,QACzB;AAAA,MACH;AAEA,eAAS,gBAAgB;AACvB,eAAO;AAAA,MACT;AAEA,eAAS,mBAAmB;AAE1B,qBAAa,MAAK;AAAA,MACpB;AAEA,eAAS,mBAAmB,OAAO;AAEjC,4BAAoB,MAAK;AAEzB,YAAI,MAAM,kBAAkB,GAAG;AAC7B,gBAAM,kBAAkB;QACzB;AAAA,MACH;AAEA,eAAS,2BAA2B,OAAO;AAEzC,4BAAoB;AAAA,MACtB;AAEA,eAAS,yCAAyC,OAAO,kBAAkB;AAEzE,YAAI,qBAAqB,GAAG;AAC1B,cAAI,cAAc,MAAO,IAAG;AAC5B,gBAAM,kBAAkB;AAExB,cAAI,kBAAkB;AACpB,kBAAM,mBAAmB;AAAA,UAC1B;AAED,8BAAoB;AAAA,QACrB;AAAA,MACH;AAEA,eAAS,2BAA2B,OAAO;AAEzC,YAAI,yBAAyB,GAAG;AAC9B,cAAI,cAAc,MAAO,IAAG;AAC5B,kCAAwB;AAGxB,cAAI,cAAc,MAAM;AAExB,iBAAO,gBAAgB,MAAM;AAC3B,oBAAQ,YAAY,KAAG;AAAA,cACrB,KAAK;AACH,oBAAIA,QAAO,YAAY;AACvB,gBAAAA,MAAK,kBAAkB;AACvB;AAAA,cAEF,KAAK;AACH,oBAAI,kBAAkB,YAAY;AAClC,gCAAgB,kBAAkB;AAClC;AAAA,YACH;AAED,0BAAc,YAAY;AAAA,UAC3B;AAAA,QACF;AAAA,MACH;AAEA,eAAS,4BAA4B,OAAO;AAE1C,YAAI,0BAA0B,GAAG;AAC/B,cAAI,cAAc,MAAO,IAAG;AAC5B,mCAAyB;AAGzB,cAAI,cAAc,MAAM;AAExB,iBAAO,gBAAgB,MAAM;AAC3B,oBAAQ,YAAY,KAAG;AAAA,cACrB,KAAK;AACH,oBAAIA,QAAO,YAAY;AAEvB,oBAAIA,UAAS,MAAM;AACjB,kBAAAA,MAAK,yBAAyB;AAAA,gBAC/B;AAED;AAAA,cAEF,KAAK;AACH,oBAAI,kBAAkB,YAAY;AAElC,oBAAI,oBAAoB,MAAM;AAI5B,kCAAgB,yBAAyB;AAAA,gBAC1C;AAED;AAAA,YACH;AAED,0BAAc,YAAY;AAAA,UAC3B;AAAA,QACF;AAAA,MACH;AAEA,eAAS,yBAAyB;AAEhC,gCAAwB,MAAK;AAAA,MAC/B;AAEA,eAAS,0BAA0B;AAEjC,iCAAyB,MAAK;AAAA,MAChC;AAEA,eAAS,uBAAuB,OAAO;AAIrC,YAAI,QAAQ,MAAM;AAElB,eAAO,OAAO;AACZ,gBAAM,kBAAkB,MAAM;AAC9B,kBAAQ,MAAM;AAAA,QACf;AAAA,MACH;AAEA,eAAS,2BAA2B,OAAO,QAAQ;AAGjD,eAAO;AAAA,UACL;AAAA,UACA;AAAA,UACA,OAAO,4BAA4B,MAAM;AAAA,UACzC,QAAQ;AAAA,QACZ;AAAA,MACA;AACA,eAAS,oBAAoB,OAAO,QAAQ,OAAO;AACjD,eAAO;AAAA,UACL;AAAA,UACA,QAAQ;AAAA,UACR,OAAO,SAAS,OAAO,QAAQ;AAAA,UAC/B,QAAQ,UAAU,OAAO,SAAS;AAAA,QACtC;AAAA,MACA;AAKA,eAAS,gBAAgB,UAAU,WAAW;AAC5C,eAAO;AAAA,MACT;AAEA,eAAS,iBAAiB,UAAU,WAAW;AAC7C,YAAI;AACF,cAAI,WAAW,gBAAgB,UAAU,SAAS;AAGlD,cAAI,aAAa,OAAO;AACtB;AAAA,UACD;AAED,cAAI/G,SAAQ,UAAU;AAEtB,cAAI,MAAM;AACR,gBAAI,SAAS,UAAU;AACvB,gBAAI,QAAQ,UAAU;AACtB,gBAAI,iBAAiB,UAAU,OAAO,QAAQ;AAI9C,gBAAIA,UAAS,QAAQA,OAAM,kBAAkB;AAC3C,kBAAI,SAAS,QAAQ,gBAAgB;AAInC;AAAA,cACD;AAMD,sBAAQ,OAAO,EAAEA,MAAK;AAAA,YAGvB;AAED,gBAAI,gBAAgB,SAAS,0BAA0B,MAAM,IAAI;AACjE,gBAAI,uBAAuB,gBAAgB,sCAAsC,gBAAgB,iBAAiB;AAClH,gBAAI;AAEJ,gBAAI,SAAS,QAAQ,UAAU;AAC7B,qCAAuB;AAAA,YAC/B,OAAa;AACL,kBAAI,oBAAoB,0BAA0B,QAAQ,KAAK;AAC/D,qCAAuB,kEAAkE,4CAA4C,oBAAoB;AAAA,YAC1J;AAED,gBAAI,kBAAkB,uBAAuB,OAAO,iBAAiB,UAAU,KAAK;AAKpF,oBAAQ,OAAO,EAAE,eAAe;AAAA,UAMjC;AAAA,QACF,SAAQR,IAAG;AAKV,qBAAW,WAAY;AACrB,kBAAMA;AAAA,UACZ,CAAK;AAAA,QACF;AAAA,MACH;AAEA,UAAI,oBAAoB,OAAO,YAAY,aAAa,UAAU;AAElE,eAAS,sBAAsB,OAAO,WAAW,MAAM;AACrD,YAAI,SAAS,aAAa,aAAa,IAAI;AAE3C,eAAO,MAAM;AAGb,eAAO,UAAU;AAAA,UACf,SAAS;AAAA,QACb;AACE,YAAIQ,SAAQ,UAAU;AAEtB,eAAO,WAAW,WAAY;AAC5B,0BAAgBA,MAAK;AACrB,2BAAiB,OAAO,SAAS;AAAA,QACrC;AAEE,eAAO;AAAA,MACT;AAEA,eAAS,uBAAuB,OAAO,WAAW,MAAM;AACtD,YAAI,SAAS,aAAa,aAAa,IAAI;AAC3C,eAAO,MAAM;AACb,YAAI,2BAA2B,MAAM,KAAK;AAE1C,YAAI,OAAO,6BAA6B,YAAY;AAClD,cAAI,UAAU,UAAU;AAExB,iBAAO,UAAU,WAAY;AAC3B,mBAAO,yBAAyB,OAAO;AAAA,UAC7C;AAEI,iBAAO,WAAW,WAAY;AAC5B;AACE,qDAAuC,KAAK;AAAA,YAC7C;AAED,6BAAiB,OAAO,SAAS;AAAA,UACvC;AAAA,QACG;AAED,YAAI,OAAO,MAAM;AAEjB,YAAI,SAAS,QAAQ,OAAO,KAAK,sBAAsB,YAAY;AACjE,iBAAO,WAAW,SAAS,WAAW;AACpC;AACE,qDAAuC,KAAK;AAAA,YAC7C;AAED,6BAAiB,OAAO,SAAS;AAEjC,gBAAI,OAAO,6BAA6B,YAAY;AAMlD,8CAAgC,IAAI;AAAA,YACrC;AAED,gBAAIwH,WAAU,UAAU;AACxB,gBAAI,QAAQ,UAAU;AACtB,iBAAK,kBAAkBA,UAAS;AAAA,cAC9B,gBAAgB,UAAU,OAAO,QAAQ;AAAA,YACjD,CAAO;AAED;AACE,kBAAI,OAAO,6BAA6B,YAAY;AAIlD,oBAAI,CAAC,iBAAiB,MAAM,OAAO,QAAQ,GAAG;AAC5C,wBAAM,uJAA4J,0BAA0B,KAAK,KAAK,SAAS;AAAA,gBAChN;AAAA,cACF;AAAA,YACF;AAAA,UACP;AAAA,QACG;AAED,eAAO;AAAA,MACT;AAEA,eAAS,mBAAmBT,OAAM,UAAU,OAAO;AAajD,YAAI,YAAYA,MAAK;AACrB,YAAI;AAEJ,YAAI,cAAc,MAAM;AACtB,sBAAYA,MAAK,YAAY,IAAI,kBAAiB;AAClD,sBAAY,oBAAI;AAChB,oBAAU,IAAI,UAAU,SAAS;AAAA,QACrC,OAAS;AACL,sBAAY,UAAU,IAAI,QAAQ;AAElC,cAAI,cAAc,QAAW;AAC3B,wBAAY,oBAAI;AAChB,sBAAU,IAAI,UAAU,SAAS;AAAA,UAClC;AAAA,QACF;AAED,YAAI,CAAC,UAAU,IAAI,KAAK,GAAG;AAEzB,oBAAU,IAAI,KAAK;AACnB,cAAI,OAAO,kBAAkB,KAAK,MAAMA,OAAM,UAAU,KAAK;AAE7D;AACE,gBAAI,mBAAmB;AAErB,qCAAuBA,OAAM,KAAK;AAAA,YACnC;AAAA,UACF;AAED,mBAAS,KAAK,MAAM,IAAI;AAAA,QACzB;AAAA,MACH;AAEA,eAAS,oBAAoB,kBAAkBA,OAAM,UAAU,OAAO;AAYpE,YAAI,YAAY,iBAAiB;AAEjC,YAAI,cAAc,MAAM;AACtB,cAAI,cAAc,oBAAI;AACtB,sBAAY,IAAI,QAAQ;AACxB,2BAAiB,cAAc;AAAA,QACnC,OAAS;AACL,oBAAU,IAAI,QAAQ;AAAA,QACvB;AAAA,MACH;AAEA,eAAS,wBAAwB,aAAa,iBAAiB;AAI7D,YAAI,MAAM,YAAY;AAEtB,aAAK,YAAY,OAAO,oBAAoB,WAAW,QAAQ,qBAAqB,QAAQ,cAAc,QAAQ,sBAAsB;AACtI,cAAI,gBAAgB,YAAY;AAEhC,cAAI,eAAe;AACjB,wBAAY,cAAc,cAAc;AACxC,wBAAY,gBAAgB,cAAc;AAC1C,wBAAY,QAAQ,cAAc;AAAA,UACxC,OAAW;AACL,wBAAY,cAAc;AAC1B,wBAAY,gBAAgB;AAAA,UAC7B;AAAA,QACF;AAAA,MACH;AAEA,eAAS,oCAAoC,aAAa;AACxD,YAAI,OAAO;AAEX,WAAG;AACD,cAAI,KAAK,QAAQ,qBAAqB,sBAAsB,IAAI,GAAG;AACjE,mBAAO;AAAA,UACR;AAID,iBAAO,KAAK;AAAA,QAChB,SAAW,SAAS;AAElB,eAAO;AAAA,MACT;AAEA,eAAS,kCAAkC,kBAAkB,aAAa,aAAaA,OAAM,iBAAiB;AAG5G,aAAK,iBAAiB,OAAO,oBAAoB,QAAQ;AAOvD,cAAI,qBAAqB,aAAa;AAgBpC,6BAAiB,SAAS;AAAA,UAChC,OAAW;AACL,6BAAiB,SAAS;AAC1B,wBAAY,SAAS;AAIrB,wBAAY,SAAS,EAAE,sBAAsB;AAE7C,gBAAI,YAAY,QAAQ,gBAAgB;AACtC,kBAAI,qBAAqB,YAAY;AAErC,kBAAI,uBAAuB,MAAM;AAI/B,4BAAY,MAAM;AAAA,cAC5B,OAAe;AAIL,oBAAI,SAAS,aAAa,aAAa,QAAQ;AAC/C,uBAAO,MAAM;AACb,8BAAc,aAAa,QAAQ,QAAQ;AAAA,cAC5C;AAAA,YACF;AAID,wBAAY,QAAQ,WAAW,YAAY,OAAO,QAAQ;AAAA,UAC3D;AAED,iBAAO;AAAA,QACR;AA0CD,yBAAiB,SAAS;AAG1B,yBAAiB,QAAQ;AACzB,eAAO;AAAA,MACT;AAEA,eAAS,eAAeA,OAAM,aAAa,aAAa,OAAO,iBAAiB;AAE9E,oBAAY,SAAS;AAErB;AACE,cAAI,mBAAmB;AAErB,mCAAuBA,OAAM,eAAe;AAAA,UAC7C;AAAA,QACF;AAED,YAAI,UAAU,QAAQ,OAAO,UAAU,YAAY,OAAO,MAAM,SAAS,YAAY;AAEnF,cAAI,WAAW;AACf,kCAAwB,WAAW;AAEnC;AACE,gBAAI,eAAgB,KAAI,YAAY,OAAO,gBAAgB;AACzD;YACD;AAAA,UACF;AAGD,cAAI,mBAAmB,oCAAoC,WAAW;AAEtE,cAAI,qBAAqB,MAAM;AAC7B,6BAAiB,SAAS,CAAC;AAC3B,8CAAkC,kBAAkB,aAAa,aAAaA,OAAM,eAAe;AAGnG,gBAAI,iBAAiB,OAAO,gBAAgB;AAC1C,iCAAmBA,OAAM,UAAU,eAAe;AAAA,YACnD;AAED,gCAAoB,kBAAkBA,OAAM,QAAQ;AACpD;AAAA,UACN,OAAW;AAGL,gBAAI,CAAC,iBAAiB,eAAe,GAAG;AAQtC,iCAAmBA,OAAM,UAAU,eAAe;AAClD;AACA;AAAA,YACD;AAKD,gBAAI,wBAAwB,IAAI,MAAM,mMAAkN;AAGxP,oBAAQ;AAAA,UACT;AAAA,QACL,OAAS;AAEL,cAAI,eAAgB,KAAI,YAAY,OAAO,gBAAgB;AACzD;AAEA,gBAAI,oBAAoB,oCAAoC,WAAW;AAMvE,gBAAI,sBAAsB,MAAM;AAC9B,mBAAK,kBAAkB,QAAQ,mBAAmB,SAAS;AAGzD,kCAAkB,SAAS;AAAA,cAC5B;AAED,gDAAkC,mBAAmB,aAAa,aAAaA,OAAM,eAAe;AAGpG,kCAAoB,2BAA2B,OAAO,WAAW,CAAC;AAClE;AAAA,YACD;AAAA,UACF;AAAA,QACF;AAED,gBAAQ,2BAA2B,OAAO,WAAW;AACrD,uBAAe,KAAK;AAIpB,YAAIV,kBAAiB;AAErB,WAAG;AACD,kBAAQA,gBAAe,KAAG;AAAA,YACxB,KAAK,UACH;AACE,kBAAI,aAAa;AACjB,cAAAA,gBAAe,SAAS;AACxB,kBAAI,OAAO,kBAAkB,eAAe;AAC5C,cAAAA,gBAAe,QAAQ,WAAWA,gBAAe,OAAO,IAAI;AAC5D,kBAAI,SAAS,sBAAsBA,iBAAgB,YAAY,IAAI;AACnE,oCAAsBA,iBAAgB,MAAM;AAC5C;AAAA,YACD;AAAA,YAEH,KAAK;AAEH,kBAAI,YAAY;AAChB,kBAAI,OAAOA,gBAAe;AAC1B,kBAAI,WAAWA,gBAAe;AAE9B,mBAAKA,gBAAe,QAAQ,gBAAgB,YAAY,OAAO,KAAK,6BAA6B,cAAc,aAAa,QAAQ,OAAO,SAAS,sBAAsB,cAAc,CAAC,mCAAmC,QAAQ,IAAI;AACtO,gBAAAA,gBAAe,SAAS;AAExB,oBAAI,QAAQ,kBAAkB,eAAe;AAE7C,gBAAAA,gBAAe,QAAQ,WAAWA,gBAAe,OAAO,KAAK;AAE7D,oBAAI,UAAU,uBAAuBA,iBAAgB,WAAW,KAAK;AAErE,sCAAsBA,iBAAgB,OAAO;AAC7C;AAAA,cACD;AAED;AAAA,UACH;AAED,UAAAA,kBAAiBA,gBAAe;AAAA,QACpC,SAAWA,oBAAmB;AAAA,MAC9B;AAEA,eAAS,oBAAoB;AAC3B;AACE,iBAAO;AAAA,QACR;AAAA,MACH;AAEA,UAAI,sBAAsB,qBAAqB;AAC/C,UAAI,mBAAmB;AACvB,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AAEJ;AACE,+BAAuB,CAAA;AACvB,6CAAqC,CAAA;AACrC,qDAA6C,CAAA;AAC7C,yDAAiD,CAAA;AACjD,mCAA2B,CAAA;AAC3B,uCAA+B;AAC/B,kCAA0B,CAAA;AAC1B,kCAA0B,CAAA;AAAA,MAC5B;AAEA,eAAS,kBAAkBS,UAAST,iBAAgB,cAAcW,cAAa;AAC7E,YAAIF,aAAY,MAAM;AAKpB,UAAAT,gBAAe,QAAQ,iBAAiBA,iBAAgB,MAAM,cAAcW,YAAW;AAAA,QAC3F,OAAS;AAML,UAAAX,gBAAe,QAAQ,qBAAqBA,iBAAgBS,SAAQ,OAAO,cAAcE,YAAW;AAAA,QACrG;AAAA,MACH;AAEA,eAAS,gCAAgCF,UAAST,iBAAgB,cAAcW,cAAa;AAS3F,QAAAX,gBAAe,QAAQ,qBAAqBA,iBAAgBS,SAAQ,OAAO,MAAME,YAAW;AAK5F,QAAAX,gBAAe,QAAQ,qBAAqBA,iBAAgB,MAAM,cAAcW,YAAW;AAAA,MAC7F;AAEA,eAAS,iBAAiBF,UAAST,iBAAgB,WAAW,WAAWW,cAAa;AAIpF;AACE,cAAIX,gBAAe,SAASA,gBAAe,aAAa;AAGtD,gBAAI,iBAAiB,UAAU;AAE/B,gBAAI,gBAAgB;AAClB;AAAA,gBAAe;AAAA,gBAAgB;AAAA;AAAA,gBAC/B;AAAA,gBAAQ,yBAAyB,SAAS;AAAA,cAAC;AAAA,YAC5C;AAAA,UACF;AAAA,QACF;AAED,YAAIoB,UAAS,UAAU;AACvB,YAAI,MAAMpB,gBAAe;AAEzB,YAAI;AACJ,YAAI;AACJ,6BAAqBA,iBAAgBW,YAAW;AAEhD;AACE,qCAA2BX,eAAc;AAAA,QAC1C;AAED;AACE,8BAAoB,UAAUA;AAC9B,yBAAe,IAAI;AACnB,yBAAe,gBAAgBS,UAAST,iBAAgBoB,SAAQ,WAAW,KAAKT,YAAW;AAC3F,kBAAQ,qBAAoB;AAE5B,cAAKX,gBAAe,OAAO,kBAAkB;AAC3C,uCAA2B,IAAI;AAE/B,gBAAI;AACF,6BAAe,gBAAgBS,UAAST,iBAAgBoB,SAAQ,WAAW,KAAKT,YAAW;AAC3F,sBAAQ,qBAAoB;AAAA,YACpC,UAAgB;AACR,yCAA2B,KAAK;AAAA,YACjC;AAAA,UACF;AAED,yBAAe,KAAK;AAAA,QACrB;AAED;AACE;QACD;AAED,YAAIF,aAAY,QAAQ,CAAC,kBAAkB;AACzC,uBAAaA,UAAST,iBAAgBW,YAAW;AACjD,iBAAO,6BAA6BF,UAAST,iBAAgBW,YAAW;AAAA,QACzE;AAED,YAAI,eAAgB,KAAI,OAAO;AAC7B,iCAAuBX,eAAc;AAAA,QACtC;AAGD,QAAAA,gBAAe,SAAS;AACxB,0BAAkBS,UAAST,iBAAgB,cAAcW,YAAW;AACpE,eAAOX,gBAAe;AAAA,MACxB;AAEA,eAAS,oBAAoBS,UAAST,iBAAgB,WAAW,WAAWW,cAAa;AACvF,YAAIF,aAAY,MAAM;AACpB,cAAI,OAAO,UAAU;AAErB,cAAI,0BAA0B,IAAI,KAAK,UAAU,YAAY;AAAA,UAC7D,UAAU,iBAAiB,QAAW;AACpC,gBAAI,eAAe;AAEnB;AACE,6BAAe,+BAA+B,IAAI;AAAA,YACnD;AAKD,YAAAT,gBAAe,MAAM;AACrB,YAAAA,gBAAe,OAAO;AAEtB;AACE,6CAA+BA,iBAAgB,IAAI;AAAA,YACpD;AAED,mBAAO,0BAA0BS,UAAST,iBAAgB,cAAc,WAAWW,YAAW;AAAA,UAC/F;AAED;AACE,gBAAI,iBAAiB,KAAK;AAE1B,gBAAI,gBAAgB;AAGlB;AAAA,gBAAe;AAAA,gBAAgB;AAAA;AAAA,gBAC/B;AAAA,gBAAQ,yBAAyB,IAAI;AAAA,cAAC;AAAA,YACvC;AAAA,UACF;AAED,cAAI,QAAQ,4BAA4B,UAAU,MAAM,MAAM,WAAWX,iBAAgBA,gBAAe,MAAMW,YAAW;AACzH,gBAAM,MAAMX,gBAAe;AAC3B,gBAAM,SAASA;AACf,UAAAA,gBAAe,QAAQ;AACvB,iBAAO;AAAA,QACR;AAED;AACE,cAAI,QAAQ,UAAU;AACtB,cAAI,kBAAkB,MAAM;AAE5B,cAAI,iBAAiB;AAGnB;AAAA,cAAe;AAAA,cAAiB;AAAA;AAAA,cAChC;AAAA,cAAQ,yBAAyB,KAAK;AAAA,YAAC;AAAA,UACxC;AAAA,QACF;AAED,YAAI,eAAeS,SAAQ;AAE3B,YAAI,8BAA8B,8BAA8BA,UAASE,YAAW;AAEpF,YAAI,CAAC,6BAA6B;AAGhC,cAAI,YAAY,aAAa;AAE7B,cAAI9G,WAAU,UAAU;AACxB,UAAAA,WAAUA,aAAY,OAAOA,WAAU;AAEvC,cAAIA,SAAQ,WAAW,SAAS,KAAK4G,SAAQ,QAAQT,gBAAe,KAAK;AACvE,mBAAO,6BAA6BS,UAAST,iBAAgBW,YAAW;AAAA,UACzE;AAAA,QACF;AAGD,QAAAX,gBAAe,SAAS;AACxB,YAAI,WAAW,qBAAqB,cAAc,SAAS;AAC3D,iBAAS,MAAMA,gBAAe;AAC9B,iBAAS,SAASA;AAClB,QAAAA,gBAAe,QAAQ;AACvB,eAAO;AAAA,MACT;AAEA,eAAS,0BAA0BS,UAAST,iBAAgB,WAAW,WAAWW,cAAa;AAI7F;AACE,cAAIX,gBAAe,SAASA,gBAAe,aAAa;AAGtD,gBAAI,gBAAgBA,gBAAe;AAEnC,gBAAI,cAAc,aAAa,iBAAiB;AAI9C,kBAAI,gBAAgB;AACpB,kBAAI,UAAU,cAAc;AAC5B,kBAAI,OAAO,cAAc;AAEzB,kBAAI;AACF,gCAAgB,KAAK,OAAO;AAAA,cAC7B,SAAQ5G,IAAG;AACV,gCAAgB;AAAA,cACjB;AAGD,kBAAI,iBAAiB,iBAAiB,cAAc;AAEpD,kBAAI,gBAAgB;AAClB;AAAA,kBAAe;AAAA,kBAAgB;AAAA;AAAA,kBAC/B;AAAA,kBAAQ,yBAAyB,aAAa;AAAA,gBAAC;AAAA,cAChD;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAED,YAAIqH,aAAY,MAAM;AACpB,cAAI,YAAYA,SAAQ;AAExB,cAAI,aAAa,WAAW,SAAS,KAAKA,SAAQ,QAAQT,gBAAe;AAAA,UACxEA,gBAAe,SAASS,SAAQ,MAAQ;AACvC,+BAAmB;AAgBnB,YAAAT,gBAAe,eAAe,YAAY;AAE1C,gBAAI,CAAC,8BAA8BS,UAASE,YAAW,GAAG;AAcxD,cAAAX,gBAAe,QAAQS,SAAQ;AAC/B,qBAAO,6BAA6BA,UAAST,iBAAgBW,YAAW;AAAA,YACzE,YAAWF,SAAQ,QAAQ,kCAAkC,SAAS;AAGrE,iCAAmB;AAAA,YACpB;AAAA,UACF;AAAA,QACF;AAED,eAAO,wBAAwBA,UAAST,iBAAgB,WAAW,WAAWW,YAAW;AAAA,MAC3F;AAEA,eAAS,yBAAyBF,UAAST,iBAAgBW,cAAa;AACtE,YAAI,YAAYX,gBAAe;AAC/B,YAAI,eAAe,UAAU;AAC7B,YAAI,YAAYS,aAAY,OAAOA,SAAQ,gBAAgB;AAE3D,YAAI,UAAU,SAAS,YAAY,oBAAqB;AAEtD,eAAKT,gBAAe,OAAO,oBAAoB,QAAQ;AAGrD,gBAAI,YAAY;AAAA,cACd,WAAW;AAAA,cACX,WAAW;AAAA,cACX,aAAa;AAAA,YACrB;AACM,YAAAA,gBAAe,gBAAgB;AAE/B,4BAAgBA,iBAAgBW,YAAW;AAAA,UAC5C,WAAU,CAAC,iBAAiBA,cAAa,aAAa,GAAG;AACxD,gBAAI,mBAAmB;AAGvB,gBAAI;AAEJ,gBAAI,cAAc,MAAM;AACtB,kBAAI,gBAAgB,UAAU;AAC9B,8BAAgB,WAAW,eAAeA,YAAW;AAAA,YAC7D,OAAa;AACL,8BAAgBA;AAAA,YACjB;AAGD,YAAAX,gBAAe,QAAQA,gBAAe,aAAa,YAAY,aAAa;AAC5E,gBAAI,aAAa;AAAA,cACf,WAAW;AAAA,cACX,WAAW;AAAA,cACX,aAAa;AAAA,YACrB;AACM,YAAAA,gBAAe,gBAAgB;AAC/B,YAAAA,gBAAe,cAAc;AAI7B,4BAAgBA,iBAAgB,aAAa;AAE7C,mBAAO;AAAA,UACb,OAAW;AAIL,gBAAI,cAAc;AAAA,cAChB,WAAW;AAAA,cACX,WAAW;AAAA,cACX,aAAa;AAAA,YACrB;AACM,YAAAA,gBAAe,gBAAgB;AAE/B,gBAAIqB,sBAAqB,cAAc,OAAO,UAAU,YAAYV;AAEpE,4BAAgBX,iBAAgBqB,mBAAkB;AAAA,UACnD;AAAA,QACL,OAAS;AAEL,cAAI;AAEJ,cAAI,cAAc,MAAM;AAEtB,kCAAsB,WAAW,UAAU,WAAWV,YAAW;AAEjE,YAAAX,gBAAe,gBAAgB;AAAA,UACrC,OAAW;AAIL,kCAAsBW;AAAA,UACvB;AAED,0BAAgBX,iBAAgB,mBAAmB;AAAA,QACpD;AAED,0BAAkBS,UAAST,iBAAgB,cAAcW,YAAW;AACpE,eAAOX,gBAAe;AAAA,MACxB;AAEA,eAAS,eAAeS,UAAST,iBAAgBW,cAAa;AAC5D,YAAI,eAAeX,gBAAe;AAClC,0BAAkBS,UAAST,iBAAgB,cAAcW,YAAW;AACpE,eAAOX,gBAAe;AAAA,MACxB;AAEA,eAAS,WAAWS,UAAST,iBAAgBW,cAAa;AACxD,YAAI,eAAeX,gBAAe,aAAa;AAC/C,0BAAkBS,UAAST,iBAAgB,cAAcW,YAAW;AACpE,eAAOX,gBAAe;AAAA,MACxB;AAEA,eAAS,eAAeS,UAAST,iBAAgBW,cAAa;AAC5D;AACE,UAAAX,gBAAe,SAAS;AAExB;AAGE,gBAAI,YAAYA,gBAAe;AAC/B,sBAAU,iBAAiB;AAC3B,sBAAU,wBAAwB;AAAA,UACnC;AAAA,QACF;AAED,YAAI,YAAYA,gBAAe;AAC/B,YAAI,eAAe,UAAU;AAC7B,0BAAkBS,UAAST,iBAAgB,cAAcW,YAAW;AACpE,eAAOX,gBAAe;AAAA,MACxB;AAEA,eAAS,QAAQS,UAAST,iBAAgB;AACxC,YAAI,MAAMA,gBAAe;AAEzB,YAAIS,aAAY,QAAQ,QAAQ,QAAQA,aAAY,QAAQA,SAAQ,QAAQ,KAAK;AAE/E,UAAAT,gBAAe,SAAS;AAExB;AACE,YAAAA,gBAAe,SAAS;AAAA,UACzB;AAAA,QACF;AAAA,MACH;AAEA,eAAS,wBAAwBS,UAAST,iBAAgB,WAAW,WAAWW,cAAa;AAC3F;AACE,cAAIX,gBAAe,SAASA,gBAAe,aAAa;AAGtD,gBAAI,iBAAiB,UAAU;AAE/B,gBAAI,gBAAgB;AAClB;AAAA,gBAAe;AAAA,gBAAgB;AAAA;AAAA,gBAC/B;AAAA,gBAAQ,yBAAyB,SAAS;AAAA,cAAC;AAAA,YAC5C;AAAA,UACF;AAAA,QACF;AAED,YAAI;AAEJ;AACE,cAAI,kBAAkB,mBAAmBA,iBAAgB,WAAW,IAAI;AACxE,oBAAU,iBAAiBA,iBAAgB,eAAe;AAAA,QAC3D;AAED,YAAI;AACJ,YAAI;AACJ,6BAAqBA,iBAAgBW,YAAW;AAEhD;AACE,qCAA2BX,eAAc;AAAA,QAC1C;AAED;AACE,8BAAoB,UAAUA;AAC9B,yBAAe,IAAI;AACnB,yBAAe,gBAAgBS,UAAST,iBAAgB,WAAW,WAAW,SAASW,YAAW;AAClG,kBAAQ,qBAAoB;AAE5B,cAAKX,gBAAe,OAAO,kBAAkB;AAC3C,uCAA2B,IAAI;AAE/B,gBAAI;AACF,6BAAe,gBAAgBS,UAAST,iBAAgB,WAAW,WAAW,SAASW,YAAW;AAClG,sBAAQ,qBAAoB;AAAA,YACpC,UAAgB;AACR,yCAA2B,KAAK;AAAA,YACjC;AAAA,UACF;AAED,yBAAe,KAAK;AAAA,QACrB;AAED;AACE;QACD;AAED,YAAIF,aAAY,QAAQ,CAAC,kBAAkB;AACzC,uBAAaA,UAAST,iBAAgBW,YAAW;AACjD,iBAAO,6BAA6BF,UAAST,iBAAgBW,YAAW;AAAA,QACzE;AAED,YAAI,eAAgB,KAAI,OAAO;AAC7B,iCAAuBX,eAAc;AAAA,QACtC;AAGD,QAAAA,gBAAe,SAAS;AACxB,0BAAkBS,UAAST,iBAAgB,cAAcW,YAAW;AACpE,eAAOX,gBAAe;AAAA,MACxB;AAEA,eAAS,qBAAqBS,UAAST,iBAAgB,WAAW,WAAWW,cAAa;AACxF;AAEE,kBAAQ,YAAYX,eAAc,GAAC;AAAA,YACjC,KAAK,OACH;AACE,kBAAI,YAAYA,gBAAe;AAC/B,kBAAI,OAAOA,gBAAe;AAG1B,kBAAI,eAAe,IAAI,KAAKA,gBAAe,eAAe,UAAU,OAAO;AAC3E,kBAAI,QAAQ,aAAa;AAEzB,wBAAU,QAAQ,gBAAgB,WAAW,OAAO,IAAI;AAExD;AAAA,YACD;AAAA,YAEH,KAAK,MACH;AACE,cAAAA,gBAAe,SAAS;AACxB,cAAAA,gBAAe,SAAS;AAExB,kBAAI,UAAU,IAAI,MAAM,sCAAsC;AAC9D,kBAAI,OAAO,kBAAkBW,YAAW;AACxC,cAAAX,gBAAe,QAAQ,WAAWA,gBAAe,OAAO,IAAI;AAE5D,kBAAI,SAAS,uBAAuBA,iBAAgB,2BAA2B,SAASA,eAAc,GAAG,IAAI;AAC7G,oCAAsBA,iBAAgB,MAAM;AAC5C;AAAA,YACD;AAAA,UACJ;AAED,cAAIA,gBAAe,SAASA,gBAAe,aAAa;AAGtD,gBAAI,iBAAiB,UAAU;AAE/B,gBAAI,gBAAgB;AAClB;AAAA,gBAAe;AAAA,gBAAgB;AAAA;AAAA,gBAC/B;AAAA,gBAAQ,yBAAyB,SAAS;AAAA,cAAC;AAAA,YAC5C;AAAA,UACF;AAAA,QACF;AAKD,YAAI;AAEJ,YAAI,kBAAkB,SAAS,GAAG;AAChC,uBAAa;AACb,8BAAoBA,eAAc;AAAA,QACtC,OAAS;AACL,uBAAa;AAAA,QACd;AAED,6BAAqBA,iBAAgBW,YAAW;AAChD,YAAI,WAAWX,gBAAe;AAC9B,YAAI;AAEJ,YAAI,aAAa,MAAM;AACrB,mDAAyCS,UAAST,eAAc;AAEhE,iCAAuBA,iBAAgB,WAAW,SAAS;AAC3D,6BAAmBA,iBAAgB,WAAW,WAAWW,YAAW;AACpE,yBAAe;AAAA,QACnB,WAAaF,aAAY,MAAM;AAE3B,yBAAe,yBAAyBT,iBAAgB,WAAW,WAAWW,YAAW;AAAA,QAC7F,OAAS;AACL,yBAAe,oBAAoBF,UAAST,iBAAgB,WAAW,WAAWW,YAAW;AAAA,QAC9F;AAED,YAAI,iBAAiB,qBAAqBF,UAAST,iBAAgB,WAAW,cAAc,YAAYW,YAAW;AAEnH;AACE,cAAI,OAAOX,gBAAe;AAE1B,cAAI,gBAAgB,KAAK,UAAU,WAAW;AAC5C,gBAAI,CAAC,8BAA8B;AACjC,oBAAM,+HAAoI,0BAA0BA,eAAc,KAAK,aAAa;AAAA,YACrM;AAED,2CAA+B;AAAA,UAChC;AAAA,QACF;AAED,eAAO;AAAA,MACT;AAEA,eAAS,qBAAqBS,UAAST,iBAAgB,WAAW,cAAc,YAAYW,cAAa;AAEvG,gBAAQF,UAAST,eAAc;AAC/B,YAAI,mBAAmBA,gBAAe,QAAQ,gBAAgB;AAE9D,YAAI,CAAC,gBAAgB,CAAC,iBAAiB;AAErC,cAAI,YAAY;AACd,sCAA0BA,iBAAgB,WAAW,KAAK;AAAA,UAC3D;AAED,iBAAO,6BAA6BS,UAAST,iBAAgBW,YAAW;AAAA,QACzE;AAED,YAAI,WAAWX,gBAAe;AAE9B,4BAAoB,UAAUA;AAC9B,YAAI;AAEJ,YAAI,mBAAmB,OAAO,UAAU,6BAA6B,YAAY;AAM/E,yBAAe;AAEf;AACE;UACD;AAAA,QACL,OAAS;AACL;AACE,uCAA2BA,eAAc;AAAA,UAC1C;AAED;AACE,2BAAe,IAAI;AACnB,2BAAe,SAAS;AAExB,gBAAKA,gBAAe,OAAO,kBAAkB;AAC3C,yCAA2B,IAAI;AAE/B,kBAAI;AACF,yBAAS,OAAM;AAAA,cACzB,UAAkB;AACR,2CAA2B,KAAK;AAAA,cACjC;AAAA,YACF;AAED,2BAAe,KAAK;AAAA,UACrB;AAED;AACE;UACD;AAAA,QACF;AAGD,QAAAA,gBAAe,SAAS;AAExB,YAAIS,aAAY,QAAQ,iBAAiB;AAKvC,0CAAgCA,UAAST,iBAAgB,cAAcW,YAAW;AAAA,QACtF,OAAS;AACL,4BAAkBF,UAAST,iBAAgB,cAAcW,YAAW;AAAA,QACrE;AAID,QAAAX,gBAAe,gBAAgB,SAAS;AAExC,YAAI,YAAY;AACd,oCAA0BA,iBAAgB,WAAW,IAAI;AAAA,QAC1D;AAED,eAAOA,gBAAe;AAAA,MACxB;AAEA,eAAS,oBAAoBA,iBAAgB;AAC3C,YAAIU,QAAOV,gBAAe;AAE1B,YAAIU,MAAK,gBAAgB;AACvB,oCAA0BV,iBAAgBU,MAAK,gBAAgBA,MAAK,mBAAmBA,MAAK,OAAO;AAAA,QACvG,WAAaA,MAAK,SAAS;AAEvB,oCAA0BV,iBAAgBU,MAAK,SAAS,KAAK;AAAA,QAC9D;AAED,0BAAkBV,iBAAgBU,MAAK,aAAa;AAAA,MACtD;AAEA,eAAS,eAAeD,UAAST,iBAAgBW,cAAa;AAC5D,4BAAoBX,eAAc;AAElC,YAAIS,aAAY,MAAM;AACpB,gBAAM,IAAI,MAAM,sDAAsD;AAAA,QACvE;AAED,YAAI,YAAYT,gBAAe;AAC/B,YAAI,YAAYA,gBAAe;AAC/B,YAAI,eAAe,UAAU;AAC7B,yBAAiBS,UAAST,eAAc;AACxC,2BAAmBA,iBAAgB,WAAW,MAAMW,YAAW;AAC/D,YAAI,YAAYX,gBAAe;AACpB,QAAAA,gBAAe;AAI1B,YAAI,eAAe,UAAU;AAE7B,YAAK,UAAU,cAAc;AAK3B,cAAI,gBAAgB;AAAA,YAClB,SAAS;AAAA,YACT,cAAc;AAAA,YACd,OAAO,UAAU;AAAA,YACjB,2BAA2B,UAAU;AAAA,YACrC,aAAa,UAAU;AAAA,UAC7B;AACI,cAAI,cAAcA,gBAAe;AAGjC,sBAAY,YAAY;AACxB,UAAAA,gBAAe,gBAAgB;AAE/B,cAAIA,gBAAe,QAAQ,mBAAmB;AAG5C,gBAAI,mBAAmB,2BAA2B,IAAI,MAAM,iJAA2J,GAAGA,eAAc;AACxO,mBAAO,8BAA8BS,UAAST,iBAAgB,cAAcW,cAAa,gBAAgB;AAAA,UAC/G,WAAe,iBAAiB,cAAc;AACxC,gBAAI,oBAAoB,2BAA2B,IAAI,MAAM,qHAA0H,GAAGX,eAAc;AAExM,mBAAO,8BAA8BS,UAAST,iBAAgB,cAAcW,cAAa,iBAAiB;AAAA,UAChH,OAAW;AAEL,gCAAoBX,eAAc;AAElC,gBAAI,QAAQ,iBAAiBA,iBAAgB,MAAM,cAAcW,YAAW;AAC5E,YAAAX,gBAAe,QAAQ;AACvB,gBAAI,OAAO;AAEX,mBAAO,MAAM;AAOX,mBAAK,QAAQ,KAAK,QAAQ,CAAC,YAAY;AACvC,qBAAO,KAAK;AAAA,YACb;AAAA,UACF;AAAA,QACL,OAAS;AAGL;AAEA,cAAI,iBAAiB,cAAc;AACjC,mBAAO,6BAA6BS,UAAST,iBAAgBW,YAAW;AAAA,UACzE;AAED,4BAAkBF,UAAST,iBAAgB,cAAcW,YAAW;AAAA,QACrE;AAED,eAAOX,gBAAe;AAAA,MACxB;AAEA,eAAS,8BAA8BS,UAAST,iBAAgB,cAAcW,cAAa,kBAAkB;AAE3G;AACA,4BAAoB,gBAAgB;AACpC,QAAAX,gBAAe,SAAS;AACxB,0BAAkBS,UAAST,iBAAgB,cAAcW,YAAW;AACpE,eAAOX,gBAAe;AAAA,MACxB;AAEA,eAAS,oBAAoBS,UAAST,iBAAgBW,cAAa;AACjE,wBAAgBX,eAAc;AAE9B,YAAIS,aAAY,MAAM;AACpB,2CAAiCT,eAAc;AAAA,QAChD;AAED,YAAI,OAAOA,gBAAe;AAC1B,YAAI,YAAYA,gBAAe;AAC/B,YAAI,YAAYS,aAAY,OAAOA,SAAQ,gBAAgB;AAC3D,YAAI,eAAe,UAAU;AAC7B,YAAI,oBAAoB,qBAAqB,MAAM,SAAS;AAE5D,YAAI,mBAAmB;AAKrB,yBAAe;AAAA,QACnB,WAAa,cAAc,QAAQ,qBAAqB,MAAM,SAAS,GAAG;AAGtE,UAAAT,gBAAe,SAAS;AAAA,QACzB;AAED,gBAAQS,UAAST,eAAc;AAC/B,0BAAkBS,UAAST,iBAAgB,cAAcW,YAAW;AACpE,eAAOX,gBAAe;AAAA,MACxB;AAEA,eAAS,eAAeS,UAAST,iBAAgB;AAC/C,YAAIS,aAAY,MAAM;AACpB,2CAAiCT,eAAc;AAAA,QAChD;AAID,eAAO;AAAA,MACT;AAEA,eAAS,mBAAmB,UAAUA,iBAAgB,aAAaW,cAAa;AAC9E,iDAAyC,UAAUX,eAAc;AACjE,YAAI,QAAQA,gBAAe;AAC3B,YAAI,gBAAgB;AACpB,YAAI,UAAU,cAAc;AAC5B,YAAI,OAAO,cAAc;AACzB,YAAI,YAAY,KAAK,OAAO;AAE5B,QAAAA,gBAAe,OAAO;AACtB,YAAI,cAAcA,gBAAe,MAAM,wBAAwB,SAAS;AACxE,YAAI,gBAAgB,oBAAoB,WAAW,KAAK;AACxD,YAAI;AAEJ,gBAAQ,aAAW;AAAA,UACjB,KAAK,mBACH;AACE;AACE,6CAA+BA,iBAAgB,SAAS;AACxD,cAAAA,gBAAe,OAAO,YAAY,+BAA+B,SAAS;AAAA,YAC3E;AAED,oBAAQ,wBAAwB,MAAMA,iBAAgB,WAAW,eAAeW,YAAW;AAC3F,mBAAO;AAAA,UACR;AAAA,UAEH,KAAK,gBACH;AACE;AACE,cAAAX,gBAAe,OAAO,YAAY,4BAA4B,SAAS;AAAA,YACxE;AAED,oBAAQ,qBAAqB,MAAMA,iBAAgB,WAAW,eAAeW,YAAW;AACxF,mBAAO;AAAA,UACR;AAAA,UAEH,KAAK,YACH;AACE;AACE,cAAAX,gBAAe,OAAO,YAAY,iCAAiC,SAAS;AAAA,YAC7E;AAED,oBAAQ,iBAAiB,MAAMA,iBAAgB,WAAW,eAAeW,YAAW;AACpF,mBAAO;AAAA,UACR;AAAA,UAEH,KAAK,eACH;AACE;AACE,kBAAIX,gBAAe,SAASA,gBAAe,aAAa;AACtD,oBAAI,iBAAiB,UAAU;AAE/B,oBAAI,gBAAgB;AAClB;AAAA,oBAAe;AAAA,oBAAgB;AAAA;AAAA,oBAC/B;AAAA,oBAAQ,yBAAyB,SAAS;AAAA,kBAAC;AAAA,gBAC5C;AAAA,cACF;AAAA,YACF;AAED,oBAAQ;AAAA,cAAoB;AAAA,cAAMA;AAAA,cAAgB;AAAA,cAAW,oBAAoB,UAAU,MAAM,aAAa;AAAA;AAAA,cAC9GW;AAAA,YAAW;AACX,mBAAO;AAAA,UACR;AAAA,QACJ;AAED,YAAI,OAAO;AAEX;AACE,cAAI,cAAc,QAAQ,OAAO,cAAc,YAAY,UAAU,aAAa,iBAAiB;AACjG,mBAAO;AAAA,UACR;AAAA,QACF;AAKD,cAAM,IAAI,MAAM,mEAAmE,YAAY,QAAQ,2DAA2D,KAAK;AAAA,MACzK;AAEA,eAAS,8BAA8B,UAAUX,iBAAgB,WAAW,WAAWW,cAAa;AAClG,iDAAyC,UAAUX,eAAc;AAEjE,QAAAA,gBAAe,MAAM;AAKrB,YAAI;AAEJ,YAAI,kBAAkB,SAAS,GAAG;AAChC,uBAAa;AACb,8BAAoBA,eAAc;AAAA,QACtC,OAAS;AACL,uBAAa;AAAA,QACd;AAED,6BAAqBA,iBAAgBW,YAAW;AAChD,+BAAuBX,iBAAgB,WAAW,SAAS;AAC3D,2BAAmBA,iBAAgB,WAAW,WAAWW,YAAW;AACpE,eAAO,qBAAqB,MAAMX,iBAAgB,WAAW,MAAM,YAAYW,YAAW;AAAA,MAC5F;AAEA,eAAS,4BAA4B,UAAUX,iBAAgB,WAAWW,cAAa;AACrF,iDAAyC,UAAUX,eAAc;AACjE,YAAI,QAAQA,gBAAe;AAC3B,YAAI;AAEJ;AACE,cAAI,kBAAkB,mBAAmBA,iBAAgB,WAAW,KAAK;AACzE,oBAAU,iBAAiBA,iBAAgB,eAAe;AAAA,QAC3D;AAED,6BAAqBA,iBAAgBW,YAAW;AAChD,YAAI;AACJ,YAAI;AAEJ;AACE,qCAA2BX,eAAc;AAAA,QAC1C;AAED;AACE,cAAI,UAAU,aAAa,OAAO,UAAU,UAAU,WAAW,YAAY;AAC3E,gBAAI,gBAAgB,yBAAyB,SAAS,KAAK;AAE3D,gBAAI,CAAC,qBAAqB,aAAa,GAAG;AACxC,oBAAM,0KAA+K,eAAe,aAAa;AAEjN,mCAAqB,aAAa,IAAI;AAAA,YACvC;AAAA,UACF;AAED,cAAIA,gBAAe,OAAO,kBAAkB;AAC1C,oCAAwB,2BAA2BA,iBAAgB,IAAI;AAAA,UACxE;AAED,yBAAe,IAAI;AACnB,8BAAoB,UAAUA;AAC9B,kBAAQ,gBAAgB,MAAMA,iBAAgB,WAAW,OAAO,SAASW,YAAW;AACpF,kBAAQ,qBAAoB;AAC5B,yBAAe,KAAK;AAAA,QACrB;AAED;AACE;QACD;AAGD,QAAAX,gBAAe,SAAS;AAExB;AAGE,cAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,OAAO,MAAM,WAAW,cAAc,MAAM,aAAa,QAAW;AACrH,gBAAI,iBAAiB,yBAAyB,SAAS,KAAK;AAE5D,gBAAI,CAAC,mCAAmC,cAAc,GAAG;AACvD,oBAAM,kWAAsX,gBAAgB,gBAAgB,cAAc;AAE1a,iDAAmC,cAAc,IAAI;AAAA,YACtD;AAAA,UACF;AAAA,QACF;AAED;AAAA;AAAA;AAAA,UAEC,OAAO,UAAU,YAAY,UAAU,QAAQ,OAAO,MAAM,WAAW,cAAc,MAAM,aAAa;AAAA,UAAW;AAClH;AACE,gBAAI,kBAAkB,yBAAyB,SAAS,KAAK;AAE7D,gBAAI,CAAC,mCAAmC,eAAe,GAAG;AACxD,oBAAM,kWAAsX,iBAAiB,iBAAiB,eAAe;AAE7a,iDAAmC,eAAe,IAAI;AAAA,YACvD;AAAA,UACF;AAGD,UAAAA,gBAAe,MAAM;AAErB,UAAAA,gBAAe,gBAAgB;AAC/B,UAAAA,gBAAe,cAAc;AAI7B,cAAI,aAAa;AAEjB,cAAI,kBAAkB,SAAS,GAAG;AAChC,yBAAa;AACb,gCAAoBA,eAAc;AAAA,UACxC,OAAW;AACL,yBAAa;AAAA,UACd;AAED,UAAAA,gBAAe,gBAAgB,MAAM,UAAU,QAAQ,MAAM,UAAU,SAAY,MAAM,QAAQ;AACjG,gCAAsBA,eAAc;AACpC,6BAAmBA,iBAAgB,KAAK;AACxC,6BAAmBA,iBAAgB,WAAW,OAAOW,YAAW;AAChE,iBAAO,qBAAqB,MAAMX,iBAAgB,WAAW,MAAM,YAAYW,YAAW;AAAA,QAC9F,OAAS;AAEL,UAAAX,gBAAe,MAAM;AAErB;AAEE,gBAAKA,gBAAe,OAAO,kBAAkB;AAC3C,yCAA2B,IAAI;AAE/B,kBAAI;AACF,wBAAQ,gBAAgB,MAAMA,iBAAgB,WAAW,OAAO,SAASW,YAAW;AACpF,wBAAQ,qBAAoB;AAAA,cACtC,UAAkB;AACR,2CAA2B,KAAK;AAAA,cACjC;AAAA,YACF;AAAA,UACF;AAED,cAAI,eAAgB,KAAI,OAAO;AAC7B,mCAAuBX,eAAc;AAAA,UACtC;AAED,4BAAkB,MAAMA,iBAAgB,OAAOW,YAAW;AAE1D;AACE,2CAA+BX,iBAAgB,SAAS;AAAA,UACzD;AAED,iBAAOA,gBAAe;AAAA,QACvB;AAAA,MACH;AAEA,eAAS,+BAA+BA,iBAAgB,WAAW;AACjE;AACE,cAAI,WAAW;AACb,gBAAI,UAAU,mBAAmB;AAC/B,oBAAM,yEAAyE,UAAU,eAAe,UAAU,QAAQ,WAAW;AAAA,YACtI;AAAA,UACF;AAED,cAAIA,gBAAe,QAAQ,MAAM;AAC/B,gBAAI,OAAO;AACX,gBAAI,YAAY;AAEhB,gBAAI,WAAW;AACb,sBAAQ,qCAAqC,YAAY;AAAA,YAC1D;AAED,gBAAI,aAAa,aAAa;AAC9B,gBAAI,cAAcA,gBAAe;AAEjC,gBAAI,aAAa;AACf,2BAAa,YAAY,WAAW,MAAM,YAAY;AAAA,YACvD;AAED,gBAAI,CAAC,yBAAyB,UAAU,GAAG;AACzC,uCAAyB,UAAU,IAAI;AAEvC,oBAAM,8HAAwI,IAAI;AAAA,YACnJ;AAAA,UACF;AAED,cAAI,OAAO,UAAU,6BAA6B,YAAY;AAC5D,gBAAI,kBAAkB,yBAAyB,SAAS,KAAK;AAE7D,gBAAI,CAAC,+CAA+C,eAAe,GAAG;AACpE,oBAAM,oEAAoE,eAAe;AAEzF,6DAA+C,eAAe,IAAI;AAAA,YACnE;AAAA,UACF;AAED,cAAI,OAAO,UAAU,gBAAgB,YAAY,UAAU,gBAAgB,MAAM;AAC/E,gBAAI,kBAAkB,yBAAyB,SAAS,KAAK;AAE7D,gBAAI,CAAC,2CAA2C,eAAe,GAAG;AAChE,oBAAM,uDAAuD,eAAe;AAE5E,yDAA2C,eAAe,IAAI;AAAA,YAC/D;AAAA,UACF;AAAA,QACF;AAAA,MACH;AAEA,UAAI,mBAAmB;AAAA,QACrB,YAAY;AAAA,QACZ,aAAa;AAAA,QACb,WAAW;AAAA,MACb;AAEA,eAAS,4BAA4BW,cAAa;AAChD,eAAO;AAAA,UACL,WAAWA;AAAA,UACX,WAAW,kBAAmB;AAAA,UAC9B,aAAa;AAAA,QACjB;AAAA,MACA;AAEA,eAAS,6BAA6B,oBAAoBA,cAAa;AACrE,YAAI,YAAY;AAEhB,eAAO;AAAA,UACL,WAAW,WAAW,mBAAmB,WAAWA,YAAW;AAAA,UAC/D;AAAA,UACA,aAAa,mBAAmB;AAAA,QACpC;AAAA,MACA;AAGA,eAAS,uBAAuB,iBAAiBF,UAAST,iBAAgBW,cAAa;AAIrF,YAAIF,aAAY,MAAM;AACpB,cAAI,gBAAgBA,SAAQ;AAE5B,cAAI,kBAAkB,MAAM;AAK1B,mBAAO;AAAA,UACR;AAAA,QACF;AAGD,eAAO,mBAAmB,iBAAiB,qBAAqB;AAAA,MAClE;AAEA,eAAS,8BAA8BA,UAASE,cAAa;AAE3D,eAAO,YAAYF,SAAQ,YAAYE,YAAW;AAAA,MACpD;AAEA,eAAS,wBAAwBF,UAAST,iBAAgBW,cAAa;AACrE,YAAI,YAAYX,gBAAe;AAE/B;AACE,cAAI,cAAcA,eAAc,GAAG;AACjC,YAAAA,gBAAe,SAAS;AAAA,UACzB;AAAA,QACF;AAED,YAAI,kBAAkB,oBAAoB;AAC1C,YAAI,eAAe;AACnB,YAAI,cAAcA,gBAAe,QAAQ,gBAAgB;AAEzD,YAAI,cAAc,uBAAuB,iBAAiBS,QAAO,GAAG;AAGlE,yBAAe;AACf,UAAAT,gBAAe,SAAS,CAAC;AAAA,QAC7B,OAAS;AAEL,cAAIS,aAAY,QAAQA,SAAQ,kBAAkB,MAAM;AAKtD;AACE,gCAAkB,0BAA0B,iBAAiB,8BAA8B;AAAA,YAC5F;AAAA,UACF;AAAA,QACF;AAED,0BAAkB,iCAAiC,eAAe;AAClE,4BAAoBT,iBAAgB,eAAe;AAuBnD,YAAIS,aAAY,MAAM;AAIpB,2CAAiCT,eAAc;AAE/C,cAAI,gBAAgBA,gBAAe;AAEnC,cAAI,kBAAkB,MAAM;AAC1B,gBAAI,aAAa,cAAc;AAE/B,gBAAI,eAAe,MAAM;AACvB,qBAAO,iCAAiCA,iBAAgB,UAAU;AAAA,YACnE;AAAA,UACF;AAED,cAAI,sBAAsB,UAAU;AACpC,cAAI,uBAAuB,UAAU;AAErC,cAAI,cAAc;AAChB,gBAAI,mBAAmB,8BAA8BA,iBAAgB,qBAAqB,sBAAsBW,YAAW;AAC3H,gBAAI,uBAAuBX,gBAAe;AAC1C,iCAAqB,gBAAgB,4BAA4BW,YAAW;AAC5E,YAAAX,gBAAe,gBAAgB;AAE/B,mBAAO;AAAA,UACb,OAAW;AACL,mBAAO,6BAA6BA,iBAAgB,mBAAmB;AAAA,UACxE;AAAA,QACL,OAAS;AAGL,cAAI,YAAYS,SAAQ;AAExB,cAAI,cAAc,MAAM;AACtB,gBAAI,cAAc,UAAU;AAE5B,gBAAI,gBAAgB,MAAM;AACxB,qBAAO,kCAAkCA,UAAST,iBAAgB,YAAY,WAAW,aAAa,WAAWW,YAAW;AAAA,YAC7H;AAAA,UACF;AAED,cAAI,cAAc;AAChB,gBAAI,wBAAwB,UAAU;AACtC,gBAAI,uBAAuB,UAAU;AACrC,gBAAI,wBAAwB,+BAA+BF,UAAST,iBAAgB,sBAAsB,uBAAuBW,YAAW;AAC5I,gBAAI,yBAAyBX,gBAAe;AAC5C,gBAAI,qBAAqBS,SAAQ,MAAM;AACvC,mCAAuB,gBAAgB,uBAAuB,OAAO,4BAA4BE,YAAW,IAAI,6BAA6B,oBAAoBA,YAAW;AAE5K,mCAAuB,aAAa,8BAA8BF,UAASE,YAAW;AACtF,YAAAX,gBAAe,gBAAgB;AAC/B,mBAAO;AAAA,UACb,OAAW;AACL,gBAAI,wBAAwB,UAAU;AAEtC,gBAAI,yBAAyB,8BAA8BS,UAAST,iBAAgB,uBAAuBW,YAAW;AAEtH,YAAAX,gBAAe,gBAAgB;AAC/B,mBAAO;AAAA,UACR;AAAA,QACF;AAAA,MACH;AAEA,eAAS,6BAA6BA,iBAAgB,iBAAiBW,cAAa;AAClF,YAAI,OAAOX,gBAAe;AAC1B,YAAI,oBAAoB;AAAA,UACtB,MAAM;AAAA,UACN,UAAU;AAAA,QACd;AACE,YAAI,uBAAuB,kCAAkC,mBAAmB,IAAI;AACpF,6BAAqB,SAASA;AAC9B,QAAAA,gBAAe,QAAQ;AACvB,eAAO;AAAA,MACT;AAEA,eAAS,8BAA8BA,iBAAgB,iBAAiB,kBAAkBW,cAAa;AACrG,YAAI,OAAOX,gBAAe;AAC1B,YAAI,4BAA4BA,gBAAe;AAC/C,YAAI,oBAAoB;AAAA,UACtB,MAAM;AAAA,UACN,UAAU;AAAA,QACd;AACE,YAAI;AACJ,YAAI;AAEJ,aAAK,OAAO,oBAAoB,UAAU,8BAA8B,MAAM;AAG5E,iCAAuB;AACvB,+BAAqB,aAAa;AAClC,+BAAqB,eAAe;AAEpC,cAAKA,gBAAe,OAAO,aAAa;AAKtC,iCAAqB,iBAAiB;AACtC,iCAAqB,kBAAkB;AACvC,iCAAqB,mBAAmB;AACxC,iCAAqB,mBAAmB;AAAA,UACzC;AAED,kCAAwB,wBAAwB,kBAAkB,MAAMW,cAAa,IAAI;AAAA,QAC7F,OAAS;AACL,iCAAuB,kCAAkC,mBAAmB,IAAI;AAChF,kCAAwB,wBAAwB,kBAAkB,MAAMA,cAAa,IAAI;AAAA,QAC1F;AAED,6BAAqB,SAASX;AAC9B,8BAAsB,SAASA;AAC/B,6BAAqB,UAAU;AAC/B,QAAAA,gBAAe,QAAQ;AACvB,eAAO;AAAA,MACT;AAEA,eAAS,kCAAkC,gBAAgB,MAAMW,cAAa;AAG5E,eAAO,yBAAyB,gBAAgB,MAAM,SAAS,IAAI;AAAA,MACrE;AAEA,eAAS,mCAAmCF,UAAS,gBAAgB;AAGnE,eAAO,qBAAqBA,UAAS,cAAc;AAAA,MACrD;AAEA,eAAS,8BAA8BA,UAAST,iBAAgB,iBAAiBW,cAAa;AAC5F,YAAI,8BAA8BF,SAAQ;AAC1C,YAAI,+BAA+B,4BAA4B;AAC/D,YAAI,uBAAuB,mCAAmC,6BAA6B;AAAA,UACzF,MAAM;AAAA,UACN,UAAU;AAAA,QACd,CAAG;AAED,aAAKT,gBAAe,OAAO,oBAAoB,QAAQ;AACrD,+BAAqB,QAAQW;AAAA,QAC9B;AAED,6BAAqB,SAASX;AAC9B,6BAAqB,UAAU;AAE/B,YAAI,iCAAiC,MAAM;AAEzC,cAAI,YAAYA,gBAAe;AAE/B,cAAI,cAAc,MAAM;AACtB,YAAAA,gBAAe,YAAY,CAAC,4BAA4B;AACxD,YAAAA,gBAAe,SAAS;AAAA,UAC9B,OAAW;AACL,sBAAU,KAAK,4BAA4B;AAAA,UAC5C;AAAA,QACF;AAED,QAAAA,gBAAe,QAAQ;AACvB,eAAO;AAAA,MACT;AAEA,eAAS,+BAA+BS,UAAST,iBAAgB,iBAAiB,kBAAkBW,cAAa;AAC/G,YAAI,OAAOX,gBAAe;AAC1B,YAAI,8BAA8BS,SAAQ;AAC1C,YAAI,+BAA+B,4BAA4B;AAC/D,YAAI,oBAAoB;AAAA,UACtB,MAAM;AAAA,UACN,UAAU;AAAA,QACd;AACE,YAAI;AAEJ;AAAA;AAAA;AAAA,WAEC,OAAO,oBAAoB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAM5BT,gBAAe,UAAU;AAAA,UAA6B;AACpD,cAAI,4BAA4BA,gBAAe;AAC/C,iCAAuB;AACvB,+BAAqB,aAAa;AAClC,+BAAqB,eAAe;AAEpC,cAAKA,gBAAe,OAAO,aAAa;AAKtC,iCAAqB,iBAAiB;AACtC,iCAAqB,kBAAkB;AACvC,iCAAqB,mBAAmB,4BAA4B;AACpE,iCAAqB,mBAAmB,4BAA4B;AAAA,UACrE;AAKD,UAAAA,gBAAe,YAAY;AAAA,QAC/B,OAAS;AACL,iCAAuB,mCAAmC,6BAA6B,iBAAiB;AAIxG,+BAAqB,eAAe,4BAA4B,eAAe;AAAA,QAChF;AAED,YAAI;AAEJ,YAAI,iCAAiC,MAAM;AACzC,kCAAwB,qBAAqB,8BAA8B,gBAAgB;AAAA,QAC/F,OAAS;AACL,kCAAwB,wBAAwB,kBAAkB,MAAMW,cAAa,IAAI;AAGzF,gCAAsB,SAAS;AAAA,QAChC;AAED,8BAAsB,SAASX;AAC/B,6BAAqB,SAASA;AAC9B,6BAAqB,UAAU;AAC/B,QAAAA,gBAAe,QAAQ;AACvB,eAAO;AAAA,MACT;AAEA,eAAS,uCAAuCS,UAAST,iBAAgBW,cAAa,kBAAkB;AAQtG,YAAI,qBAAqB,MAAM;AAC7B,8BAAoB,gBAAgB;AAAA,QACrC;AAGD,6BAAqBX,iBAAgBS,SAAQ,OAAO,MAAME,YAAW;AAErE,YAAI,YAAYX,gBAAe;AAC/B,YAAI,kBAAkB,UAAU;AAChC,YAAI,uBAAuB,6BAA6BA,iBAAgB,eAAe;AAGvF,6BAAqB,SAAS;AAC9B,QAAAA,gBAAe,gBAAgB;AAC/B,eAAO;AAAA,MACT;AAEA,eAAS,gDAAgDS,UAAST,iBAAgB,iBAAiB,kBAAkBW,cAAa;AAChI,YAAI,YAAYX,gBAAe;AAC/B,YAAI,oBAAoB;AAAA,UACtB,MAAM;AAAA,UACN,UAAU;AAAA,QACd;AACE,YAAI,uBAAuB,kCAAkC,mBAAmB,SAAS;AACzF,YAAI,wBAAwB,wBAAwB,kBAAkB,WAAWW,cAAa,IAAI;AAGlG,8BAAsB,SAAS;AAC/B,6BAAqB,SAASX;AAC9B,8BAAsB,SAASA;AAC/B,6BAAqB,UAAU;AAC/B,QAAAA,gBAAe,QAAQ;AAEvB,aAAKA,gBAAe,OAAO,oBAAoB,QAAQ;AAGrD,+BAAqBA,iBAAgBS,SAAQ,OAAO,MAAME,YAAW;AAAA,QACtE;AAED,eAAO;AAAA,MACT;AAEA,eAAS,iCAAiCX,iBAAgB,kBAAkBW,cAAa;AAGvF,aAAKX,gBAAe,OAAO,oBAAoB,QAAQ;AACrD;AACE,kBAAM,mOAAuP;AAAA,UAC9P;AAED,UAAAA,gBAAe,QAAQ,YAAY,QAAQ;AAAA,QAC/C,WAAa,2BAA2B,gBAAgB,GAAG;AAYvD,UAAAA,gBAAe,QAAQ,YAAY,oBAAoB;AAAA,QAC3D,OAAS;AAGL,UAAAA,gBAAe,QAAQ,YAAY,aAAa;AAAA,QACjD;AAED,eAAO;AAAA,MACT;AAEA,eAAS,kCAAkCS,UAAST,iBAAgB,YAAY,WAAW,kBAAkB,eAAeW,cAAa;AACvI,YAAI,CAAC,YAAY;AAIf;AAEA,eAAKX,gBAAe,OAAO,oBAAoB,QAAQ;AACrD,mBAAO;AAAA,cAAuCS;AAAA,cAAST;AAAA,cAAgBW;AAAA;AAAA;AAAA;AAAA,cAGvE;AAAA,YAAI;AAAA,UACL;AAED,cAAI,2BAA2B,gBAAgB,GAAG;AAIhD,gBAAI,QAAQ,SAAS;AAErB;AACE,kBAAI,wBAAwB,wCAAwC,gBAAgB;AAEpF,uBAAS,sBAAsB;AAC/B,wBAAU,sBAAsB;AAChC,sBAAQ,sBAAsB;AAAA,YAC/B;AAED,gBAAIhH;AAEJ,gBAAI,SAAS;AAEX,cAAAA,SAAQ,IAAI,MAAM,OAAO;AAAA,YACjC,OAAa;AACL,cAAAA,SAAQ,IAAI,MAAM,mIAA6I;AAAA,YAChK;AAED,gBAAI,gBAAgB,oBAAoBA,QAAO,QAAQ,KAAK;AAC5D,mBAAO,uCAAuC8G,UAAST,iBAAgBW,cAAa,aAAa;AAAA,UAClG;AAID,cAAIW,qBAAoB,iBAAiBX,cAAaF,SAAQ,UAAU;AAExE,cAAI,oBAAoBa,oBAAmB;AAGzC,gBAAIZ,QAAO;AAEX,gBAAIA,UAAS,MAAM;AACjB,kBAAI,yBAAyB,0BAA0BA,OAAMC,YAAW;AAExE,kBAAI,2BAA2B,UAAU,2BAA2B,cAAc,WAAW;AAI3F,8BAAc,YAAY;AAE1B,oBAAI,YAAY;AAChB,+CAA+BF,UAAS,sBAAsB;AAC9D,sCAAsBC,OAAMD,UAAS,wBAAwB,SAAS;AAAA,cACvE;AAAA,YACF;AAOD;AAEA,gBAAI,iBAAiB,oBAAoB,IAAI,MAAM,8MAA6N,CAAC;AAEjR,mBAAO,uCAAuCA,UAAST,iBAAgBW,cAAa,cAAc;AAAA,UACxG,WAAe,0BAA0B,gBAAgB,GAAG;AAUtD,YAAAX,gBAAe,SAAS;AAExB,YAAAA,gBAAe,QAAQS,SAAQ;AAE/B,gBAAI,QAAQ,gCAAgC,KAAK,MAAMA,QAAO;AAC9D,0CAA8B,kBAAkB,KAAK;AACrD,mBAAO;AAAA,UACb,OAAW;AAEL,gEAAoDT,iBAAgB,kBAAkB,cAAc,WAAW;AAC/G,gBAAI,kBAAkB,UAAU;AAChC,gBAAI,uBAAuB,6BAA6BA,iBAAgB,eAAe;AAOvF,iCAAqB,SAAS;AAC9B,mBAAO;AAAA,UACR;AAAA,QACL,OAAS;AAGL,cAAIA,gBAAe,QAAQ,mBAAmB;AAE5C,YAAAA,gBAAe,SAAS,CAAC;AAEzB,gBAAI,kBAAkB,oBAAoB,IAAI,MAAM,0FAA+F,CAAC;AAEpJ,mBAAO,uCAAuCS,UAAST,iBAAgBW,cAAa,eAAe;AAAA,UACzG,WAAeX,gBAAe,kBAAkB,MAAM;AAGhD,YAAAA,gBAAe,QAAQS,SAAQ;AAG/B,YAAAT,gBAAe,SAAS;AACxB,mBAAO;AAAA,UACb,OAAW;AAGL,gBAAI,sBAAsB,UAAU;AACpC,gBAAI,uBAAuB,UAAU;AACrC,gBAAI,wBAAwB,gDAAgDS,UAAST,iBAAgB,qBAAqB,sBAAsBW,YAAW;AAC3J,gBAAI,yBAAyBX,gBAAe;AAC5C,mCAAuB,gBAAgB,4BAA4BW,YAAW;AAC9E,YAAAX,gBAAe,gBAAgB;AAC/B,mBAAO;AAAA,UACR;AAAA,QACF;AAAA,MACH;AAEA,eAAS,4BAA4B,OAAOW,cAAa,iBAAiB;AACxE,cAAM,QAAQ,WAAW,MAAM,OAAOA,YAAW;AACjD,YAAI,YAAY,MAAM;AAEtB,YAAI,cAAc,MAAM;AACtB,oBAAU,QAAQ,WAAW,UAAU,OAAOA,YAAW;AAAA,QAC1D;AAED,wCAAgC,MAAM,QAAQA,cAAa,eAAe;AAAA,MAC5E;AAEA,eAAS,+BAA+BX,iBAAgB,YAAYW,cAAa;AAI/E,YAAI,OAAO;AAEX,eAAO,SAAS,MAAM;AACpB,cAAI,KAAK,QAAQ,mBAAmB;AAClC,gBAAI,QAAQ,KAAK;AAEjB,gBAAI,UAAU,MAAM;AAClB,0CAA4B,MAAMA,cAAaX,eAAc;AAAA,YAC9D;AAAA,UACP,WAAe,KAAK,QAAQ,uBAAuB;AAM7C,wCAA4B,MAAMW,cAAaX,eAAc;AAAA,UACnE,WAAe,KAAK,UAAU,MAAM;AAC9B,iBAAK,MAAM,SAAS;AACpB,mBAAO,KAAK;AACZ;AAAA,UACD;AAED,cAAI,SAASA,iBAAgB;AAC3B;AAAA,UACD;AAED,iBAAO,KAAK,YAAY,MAAM;AAC5B,gBAAI,KAAK,WAAW,QAAQ,KAAK,WAAWA,iBAAgB;AAC1D;AAAA,YACD;AAED,mBAAO,KAAK;AAAA,UACb;AAED,eAAK,QAAQ,SAAS,KAAK;AAC3B,iBAAO,KAAK;AAAA,QACb;AAAA,MACH;AAEA,eAAS,mBAAmB,YAAY;AAQtC,YAAI,MAAM;AACV,YAAI,iBAAiB;AAErB,eAAO,QAAQ,MAAM;AACnB,cAAI,aAAa,IAAI;AAErB,cAAI,eAAe,QAAQ,mBAAmB,UAAU,MAAM,MAAM;AAClE,6BAAiB;AAAA,UAClB;AAED,gBAAM,IAAI;AAAA,QACX;AAED,eAAO;AAAA,MACT;AAEA,eAAS,oBAAoB,aAAa;AACxC;AACE,cAAI,gBAAgB,UAAa,gBAAgB,cAAc,gBAAgB,eAAe,gBAAgB,cAAc,CAAC,wBAAwB,WAAW,GAAG;AACjK,oCAAwB,WAAW,IAAI;AAEvC,gBAAI,OAAO,gBAAgB,UAAU;AACnC,sBAAQ,YAAY,YAAa,GAAA;AAAA,gBAC/B,KAAK;AAAA,gBACL,KAAK;AAAA,gBACL,KAAK,aACH;AACE,wBAAM,8FAAmG,aAAa,YAAY,YAAW,CAAE;AAE/I;AAAA,gBACD;AAAA,gBAEH,KAAK;AAAA,gBACL,KAAK,YACH;AACE,wBAAM,+HAAoI,aAAa,YAAY,YAAW,CAAE;AAEhL;AAAA,gBACD;AAAA,gBAEH;AACE,wBAAM,gHAAqH,WAAW;AAEtI;AAAA,cACH;AAAA,YACT,OAAa;AACL,oBAAM,wHAA6H,WAAW;AAAA,YAC/I;AAAA,UACF;AAAA,QACF;AAAA,MACH;AAEA,eAAS,oBAAoB,UAAU,aAAa;AAClD;AACE,cAAI,aAAa,UAAa,CAAC,wBAAwB,QAAQ,GAAG;AAChE,gBAAI,aAAa,eAAe,aAAa,UAAU;AACrD,sCAAwB,QAAQ,IAAI;AAEpC,oBAAM,qGAA0G,QAAQ;AAAA,YACzH,WAAU,gBAAgB,cAAc,gBAAgB,aAAa;AACpE,sCAAwB,QAAQ,IAAI;AAEpC,oBAAM,yIAAmJ,QAAQ;AAAA,YAClK;AAAA,UACF;AAAA,QACF;AAAA,MACH;AAEA,eAAS,gCAAgC,WAAWzG,QAAO;AACzD;AACE,cAAI,YAAY,QAAQ,SAAS;AACjC,cAAI,aAAa,CAAC,aAAa,OAAO,cAAc,SAAS,MAAM;AAEnE,cAAI,aAAa,YAAY;AAC3B,gBAAI,OAAO,YAAY,UAAU;AAEjC,kBAAM,uOAA2P,MAAMA,QAAO,IAAI;AAElR,mBAAO;AAAA,UACR;AAAA,QACF;AAED,eAAO;AAAA,MACT;AAEA,eAAS,6BAA6B,UAAU,aAAa;AAC3D;AACE,eAAK,gBAAgB,cAAc,gBAAgB,gBAAgB,aAAa,UAAa,aAAa,QAAQ,aAAa,OAAO;AACpI,gBAAI,QAAQ,QAAQ,GAAG;AACrB,uBAASD,KAAI,GAAGA,KAAI,SAAS,QAAQA,MAAK;AACxC,oBAAI,CAAC,gCAAgC,SAASA,EAAC,GAAGA,EAAC,GAAG;AACpD;AAAA,gBACD;AAAA,cACF;AAAA,YACT,OAAa;AACL,kBAAI,aAAa,cAAc,QAAQ;AAEvC,kBAAI,OAAO,eAAe,YAAY;AACpC,oBAAI,mBAAmB,WAAW,KAAK,QAAQ;AAE/C,oBAAI,kBAAkB;AACpB,sBAAI,OAAO,iBAAiB;AAC5B,sBAAI,KAAK;AAET,yBAAO,CAAC,KAAK,MAAM,OAAO,iBAAiB,KAAI,GAAI;AACjD,wBAAI,CAAC,gCAAgC,KAAK,OAAO,EAAE,GAAG;AACpD;AAAA,oBACD;AAED;AAAA,kBACD;AAAA,gBACF;AAAA,cACX,OAAe;AACL,sBAAM,wKAAkL,WAAW;AAAA,cACpM;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACH;AAEA,eAAS,4BAA4B0G,iBAAgB,aAAa,MAAM,gBAAgB,UAAU;AAChG,YAAI,cAAcA,gBAAe;AAEjC,YAAI,gBAAgB,MAAM;AACxB,UAAAA,gBAAe,gBAAgB;AAAA,YAC7B;AAAA,YACA,WAAW;AAAA,YACX,oBAAoB;AAAA,YACpB,MAAM;AAAA,YACN;AAAA,YACA;AAAA,UACN;AAAA,QACA,OAAS;AAEL,sBAAY,cAAc;AAC1B,sBAAY,YAAY;AACxB,sBAAY,qBAAqB;AACjC,sBAAY,OAAO;AACnB,sBAAY,OAAO;AACnB,sBAAY,WAAW;AAAA,QACxB;AAAA,MACH;AASA,eAAS,4BAA4BS,UAAST,iBAAgBW,cAAa;AACzE,YAAI,YAAYX,gBAAe;AAC/B,YAAI,cAAc,UAAU;AAC5B,YAAI,WAAW,UAAU;AACzB,YAAI,cAAc,UAAU;AAC5B,4BAAoB,WAAW;AAC/B,4BAAoB,UAAU,WAAW;AACzC,qCAA6B,aAAa,WAAW;AACrD,0BAAkBS,UAAST,iBAAgB,aAAaW,YAAW;AACnE,YAAI,kBAAkB,oBAAoB;AAC1C,YAAI,sBAAsB,mBAAmB,iBAAiB,qBAAqB;AAEnF,YAAI,qBAAqB;AACvB,4BAAkB,0BAA0B,iBAAiB,qBAAqB;AAClF,UAAAX,gBAAe,SAAS;AAAA,QAC5B,OAAS;AACL,cAAI,mBAAmBS,aAAY,SAASA,SAAQ,QAAQ,gBAAgB;AAE5E,cAAI,kBAAkB;AAIpB,2CAA+BT,iBAAgBA,gBAAe,OAAOW,YAAW;AAAA,UACjF;AAED,4BAAkB,iCAAiC,eAAe;AAAA,QACnE;AAED,4BAAoBX,iBAAgB,eAAe;AAEnD,aAAKA,gBAAe,OAAO,oBAAoB,QAAQ;AAGrD,UAAAA,gBAAe,gBAAgB;AAAA,QACnC,OAAS;AACL,kBAAQ,aAAW;AAAA,YACjB,KAAK,YACH;AACE,kBAAI,iBAAiB,mBAAmBA,gBAAe,KAAK;AAC5D,kBAAI;AAEJ,kBAAI,mBAAmB,MAAM;AAG3B,uBAAOA,gBAAe;AACtB,gBAAAA,gBAAe,QAAQ;AAAA,cACnC,OAAiB;AAGL,uBAAO,eAAe;AACtB,+BAAe,UAAU;AAAA,cAC1B;AAED;AAAA,gBAA4BA;AAAA,gBAAgB;AAAA;AAAA,gBAC5C;AAAA,gBAAM;AAAA,gBAAgB;AAAA,cAAQ;AAC9B;AAAA,YACD;AAAA,YAEH,KAAK,aACH;AAKE,kBAAI,QAAQ;AACZ,kBAAI,MAAMA,gBAAe;AACzB,cAAAA,gBAAe,QAAQ;AAEvB,qBAAO,QAAQ,MAAM;AACnB,oBAAI,aAAa,IAAI;AAErB,oBAAI,eAAe,QAAQ,mBAAmB,UAAU,MAAM,MAAM;AAElE,kBAAAA,gBAAe,QAAQ;AACvB;AAAA,gBACD;AAED,oBAAI,UAAU,IAAI;AAClB,oBAAI,UAAU;AACd,wBAAQ;AACR,sBAAM;AAAA,cACP;AAGD;AAAA,gBAA4BA;AAAA,gBAAgB;AAAA;AAAA,gBAC5C;AAAA,gBAAO;AAAA;AAAA,gBACP;AAAA,cAAQ;AACR;AAAA,YACD;AAAA,YAEH,KAAK,YACH;AACE;AAAA,gBAA4BA;AAAA,gBAAgB;AAAA;AAAA,gBAC5C;AAAA;AAAA,gBACA;AAAA;AAAA,gBACA;AAAA,cAAS;AACT;AAAA,YACD;AAAA,YAEH,SACE;AAGE,cAAAA,gBAAe,gBAAgB;AAAA,YAChC;AAAA,UACJ;AAAA,QACF;AAED,eAAOA,gBAAe;AAAA,MACxB;AAEA,eAAS,sBAAsBS,UAAST,iBAAgBW,cAAa;AACnE,0BAAkBX,iBAAgBA,gBAAe,UAAU,aAAa;AACxE,YAAI,eAAeA,gBAAe;AAElC,YAAIS,aAAY,MAAM;AAMpB,UAAAT,gBAAe,QAAQ,qBAAqBA,iBAAgB,MAAM,cAAcW,YAAW;AAAA,QAC/F,OAAS;AACL,4BAAkBF,UAAST,iBAAgB,cAAcW,YAAW;AAAA,QACrE;AAED,eAAOX,gBAAe;AAAA,MACxB;AAEA,UAAI,kDAAkD;AAEtD,eAAS,sBAAsBS,UAAST,iBAAgBW,cAAa;AACnE,YAAI,eAAeX,gBAAe;AAClC,YAAI,UAAU,aAAa;AAC3B,YAAI,WAAWA,gBAAe;AAC9B,YAAI,WAAWA,gBAAe;AAC9B,YAAI,WAAW,SAAS;AAExB;AACE,cAAI,EAAE,WAAW,WAAW;AAC1B,gBAAI,CAAC,iDAAiD;AACpD,gEAAkD;AAElD,oBAAM,sGAAsG;AAAA,YAC7G;AAAA,UACF;AAED,cAAI,oBAAoBA,gBAAe,KAAK;AAE5C,cAAI,mBAAmB;AACrB,2BAAe,mBAAmB,UAAU,QAAQ,kBAAkB;AAAA,UACvE;AAAA,QACF;AAED,qBAAaA,iBAAgB,SAAS,QAAQ;AAE9C;AACE,cAAI,aAAa,MAAM;AACrB,gBAAI,WAAW,SAAS;AAExB,gBAAI,SAAS,UAAU,QAAQ,GAAG;AAEhC,kBAAI,SAAS,aAAa,SAAS,YAAY,CAAC,kBAAiB,GAAI;AACnE,uBAAO,6BAA6BS,UAAST,iBAAgBW,YAAW;AAAA,cACzE;AAAA,YACT,OAAa;AAGL,qCAAuBX,iBAAgB,SAASW,YAAW;AAAA,YAC5D;AAAA,UACF;AAAA,QACF;AAED,YAAI,cAAc,SAAS;AAC3B,0BAAkBF,UAAST,iBAAgB,aAAaW,YAAW;AACnE,eAAOX,gBAAe;AAAA,MACxB;AAEA,UAAI,uCAAuC;AAE3C,eAAS,sBAAsBS,UAAST,iBAAgBW,cAAa;AACnE,YAAI,UAAUX,gBAAe;AAQ7B;AACE,cAAI,QAAQ,aAAa,QAAW;AAIlC,gBAAI,YAAY,QAAQ,UAAU;AAChC,kBAAI,CAAC,sCAAsC;AACzC,uDAAuC;AAEvC,sBAAM,iJAAsJ;AAAA,cAC7J;AAAA,YACF;AAAA,UACP,OAAW;AACL,sBAAU,QAAQ;AAAA,UACnB;AAAA,QACF;AAED,YAAI,WAAWA,gBAAe;AAC9B,YAAIoB,UAAS,SAAS;AAEtB;AACE,cAAI,OAAOA,YAAW,YAAY;AAChC,kBAAM,qPAAoQ;AAAA,UAC3Q;AAAA,QACF;AAED,6BAAqBpB,iBAAgBW,YAAW;AAChD,YAAI,WAAW,YAAY,OAAO;AAElC;AACE,qCAA2BX,eAAc;AAAA,QAC1C;AAED,YAAI;AAEJ;AACE,8BAAoB,UAAUA;AAC9B,yBAAe,IAAI;AACnB,wBAAcoB,QAAO,QAAQ;AAC7B,yBAAe,KAAK;AAAA,QACrB;AAED;AACE;QACD;AAGD,QAAApB,gBAAe,SAAS;AACxB,0BAAkBS,UAAST,iBAAgB,aAAaW,YAAW;AACnE,eAAOX,gBAAe;AAAA,MACxB;AAEA,eAAS,mCAAmC;AAC1C,2BAAmB;AAAA,MACrB;AAEA,eAAS,yCAAyCS,UAAST,iBAAgB;AACzE,aAAKA,gBAAe,OAAO,oBAAoB,QAAQ;AACrD,cAAIS,aAAY,MAAM;AAKpB,YAAAA,SAAQ,YAAY;AACpB,YAAAT,gBAAe,YAAY;AAE3B,YAAAA,gBAAe,SAAS;AAAA,UACzB;AAAA,QACF;AAAA,MACH;AAEA,eAAS,6BAA6BS,UAAST,iBAAgBW,cAAa;AAC1E,YAAIF,aAAY,MAAM;AAEpB,UAAAT,gBAAe,eAAeS,SAAQ;AAAA,QACvC;AAED;AAEE;QACD;AAED,+BAAuBT,gBAAe,KAAK;AAE3C,YAAI,CAAC,iBAAiBW,cAAaX,gBAAe,UAAU,GAAG;AAI7D;AACE,mBAAO;AAAA,UACR;AAAA,QACF;AAID,yBAAiBS,UAAST,eAAc;AACxC,eAAOA,gBAAe;AAAA,MACxB;AAEA,eAAS,aAAaS,UAAS,mBAAmB,mBAAmB;AACnE;AACE,cAAI,cAAc,kBAAkB;AAEpC,cAAI,gBAAgB,MAAM;AAExB,kBAAM,IAAI,MAAM,6BAA6B;AAAA,UAC9C;AAID,UAAAA,SAAQ,YAAY;AACpB,4BAAkB,YAAY;AAE9B,4BAAkB,QAAQ,kBAAkB;AAC5C,4BAAkB,UAAU,kBAAkB;AAC9C,4BAAkB,SAAS,kBAAkB;AAC7C,4BAAkB,MAAM,kBAAkB;AAE1C,cAAI,sBAAsB,YAAY,OAAO;AAC3C,wBAAY,QAAQ;AAAA,UAC1B,OAAW;AACL,gBAAI,cAAc,YAAY;AAE9B,gBAAI,gBAAgB,MAAM;AAExB,oBAAM,IAAI,MAAM,kCAAkC;AAAA,YACnD;AAED,mBAAO,YAAY,YAAY,mBAAmB;AAChD,4BAAc,YAAY;AAE1B,kBAAI,gBAAgB,MAAM;AAExB,sBAAM,IAAI,MAAM,wCAAwC;AAAA,cACzD;AAAA,YACF;AAED,wBAAY,UAAU;AAAA,UACvB;AAID,cAAI,YAAY,YAAY;AAE5B,cAAI,cAAc,MAAM;AACtB,wBAAY,YAAY,CAACA,QAAO;AAChC,wBAAY,SAAS;AAAA,UAC3B,OAAW;AACL,sBAAU,KAAKA,QAAO;AAAA,UACvB;AAED,4BAAkB,SAAS;AAE3B,iBAAO;AAAA,QACR;AAAA,MACH;AAEA,eAAS,8BAA8BA,UAASE,cAAa;AAG3D,YAAI,cAAcF,SAAQ;AAE1B,YAAI,iBAAiB,aAAaE,YAAW,GAAG;AAC9C,iBAAO;AAAA,QACR;AAED,eAAO;AAAA,MACT;AAEA,eAAS,uCAAuCF,UAAST,iBAAgBW,cAAa;AAIpF,gBAAQX,gBAAe,KAAG;AAAA,UACxB,KAAK;AACH,gCAAoBA,eAAc;AACvB,YAAAA,gBAAe;AAE1B;AACA;AAAA,UAEF,KAAK;AACH,4BAAgBA,eAAc;AAC9B;AAAA,UAEF,KAAK,gBACH;AACE,gBAAI,YAAYA,gBAAe;AAE/B,gBAAI,kBAAkB,SAAS,GAAG;AAChC,kCAAoBA,eAAc;AAAA,YACnC;AAED;AAAA,UACD;AAAA,UAEH,KAAK;AACH,8BAAkBA,iBAAgBA,gBAAe,UAAU,aAAa;AACxE;AAAA,UAEF,KAAKJ,kBACH;AACE,gBAAI,WAAWI,gBAAe,cAAc;AAC5C,gBAAI,UAAUA,gBAAe,KAAK;AAClC,yBAAaA,iBAAgB,SAAS,QAAQ;AAC9C;AAAA,UACD;AAAA,UAEH,KAAK;AACH;AAEE,kBAAI,eAAe,iBAAiBW,cAAaX,gBAAe,UAAU;AAE1E,kBAAI,cAAc;AAChB,gBAAAA,gBAAe,SAAS;AAAA,cACzB;AAED;AAGE,oBAAI,YAAYA,gBAAe;AAC/B,0BAAU,iBAAiB;AAC3B,0BAAU,wBAAwB;AAAA,cACnC;AAAA,YACF;AAED;AAAA,UAEF,KAAK,mBACH;AACE,gBAAI,QAAQA,gBAAe;AAE3B,gBAAI,UAAU,MAAM;AAClB,kBAAI,MAAM,eAAe,MAAM;AAC7B,oCAAoBA,iBAAgB,iCAAiC,oBAAoB,OAAO,CAAC;AAIjG,gBAAAA,gBAAe,SAAS;AAGxB,uBAAO;AAAA,cACR;AAMD,kBAAI,uBAAuBA,gBAAe;AAC1C,kBAAI,oBAAoB,qBAAqB;AAE7C,kBAAI,iBAAiBW,cAAa,iBAAiB,GAAG;AAGpD,uBAAO,wBAAwBF,UAAST,iBAAgBW,YAAW;AAAA,cAC/E,OAAiB;AAGL,oCAAoBX,iBAAgB,iCAAiC,oBAAoB,OAAO,CAAC;AAGjG,oBAAI,QAAQ,6BAA6BS,UAAST,iBAAgBW,YAAW;AAE7E,oBAAI,UAAU,MAAM;AAGlB,yBAAO,MAAM;AAAA,gBAC3B,OAAmB;AAIL,yBAAO;AAAA,gBACR;AAAA,cACF;AAAA,YACX,OAAe;AACL,kCAAoBX,iBAAgB,iCAAiC,oBAAoB,OAAO,CAAC;AAAA,YAClG;AAED;AAAA,UACD;AAAA,UAEH,KAAK,uBACH;AACE,gBAAI,oBAAoBS,SAAQ,QAAQ,gBAAgB;AAExD,gBAAI,gBAAgB,iBAAiBE,cAAaX,gBAAe,UAAU;AAE3E,gBAAI,kBAAkB;AACpB,kBAAI,eAAe;AAMjB,uBAAO,4BAA4BS,UAAST,iBAAgBW,YAAW;AAAA,cACxE;AAKD,cAAAX,gBAAe,SAAS;AAAA,YACzB;AAKD,gBAAI,cAAcA,gBAAe;AAEjC,gBAAI,gBAAgB,MAAM;AAGxB,0BAAY,YAAY;AACxB,0BAAY,OAAO;AACnB,0BAAY,aAAa;AAAA,YAC1B;AAED,gCAAoBA,iBAAgB,oBAAoB,OAAO;AAE/D,gBAAI,eAAe;AACjB;AAAA,YACV,OAAe;AAIL,qBAAO;AAAA,YACR;AAAA,UACF;AAAA,UAEH,KAAK;AAAA,UACL,KAAK,uBACH;AASE,YAAAA,gBAAe,QAAQ;AACvB,mBAAO,yBAAyBS,UAAST,iBAAgBW,YAAW;AAAA,UACrE;AAAA,QACJ;AAED,eAAO,6BAA6BF,UAAST,iBAAgBW,YAAW;AAAA,MAC1E;AAEA,eAAS,UAAUF,UAAST,iBAAgBW,cAAa;AACvD;AACE,cAAIX,gBAAe,sBAAsBS,aAAY,MAAM;AAEzD,mBAAO,aAAaA,UAAST,iBAAgB,4BAA4BA,gBAAe,MAAMA,gBAAe,KAAKA,gBAAe,cAAcA,gBAAe,eAAe,MAAMA,gBAAe,MAAMA,gBAAe,KAAK,CAAC;AAAA,UAC9N;AAAA,QACF;AAED,YAAIS,aAAY,MAAM;AACpB,cAAI,WAAWA,SAAQ;AACvB,cAAI,WAAWT,gBAAe;AAE9B,cAAI,aAAa,YAAY,kBAAmB;AAAA,UAC/CA,gBAAe,SAASS,SAAQ,MAAQ;AAGvC,+BAAmB;AAAA,UACzB,OAAW;AAGL,gBAAI,8BAA8B,8BAA8BA,UAASE,YAAW;AAEpF,gBAAI,CAAC;AAAA;AAAA,aAEJX,gBAAe,QAAQ,gBAAgB,SAAS;AAE/C,iCAAmB;AACnB,qBAAO,uCAAuCS,UAAST,iBAAgBW,YAAW;AAAA,YACnF;AAED,iBAAKF,SAAQ,QAAQ,kCAAkC,SAAS;AAG9D,iCAAmB;AAAA,YAC3B,OAAa;AAKL,iCAAmB;AAAA,YACpB;AAAA,UACF;AAAA,QACL,OAAS;AACL,6BAAmB;AAEnB,cAAI,eAAgB,KAAI,cAAcT,eAAc,GAAG;AAUrD,gBAAI,YAAYA,gBAAe;AAC/B,gBAAI,gBAAgB;AACpB,uBAAWA,iBAAgB,eAAe,SAAS;AAAA,UACpD;AAAA,QACF;AAOD,QAAAA,gBAAe,QAAQ;AAEvB,gBAAQA,gBAAe,KAAG;AAAA,UACxB,KAAK,wBACH;AACE,mBAAO,4BAA4BS,UAAST,iBAAgBA,gBAAe,MAAMW,YAAW;AAAA,UAC7F;AAAA,UAEH,KAAK,eACH;AACE,gBAAI,cAAcX,gBAAe;AACjC,mBAAO,mBAAmBS,UAAST,iBAAgB,aAAaW,YAAW;AAAA,UAC5E;AAAA,UAEH,KAAK,mBACH;AACE,gBAAI,YAAYX,gBAAe;AAC/B,gBAAI,kBAAkBA,gBAAe;AACrC,gBAAI,gBAAgBA,gBAAe,gBAAgB,YAAY,kBAAkB,oBAAoB,WAAW,eAAe;AAC/H,mBAAO,wBAAwBS,UAAST,iBAAgB,WAAW,eAAeW,YAAW;AAAA,UAC9F;AAAA,UAEH,KAAK,gBACH;AACE,gBAAI,aAAaX,gBAAe;AAChC,gBAAI,mBAAmBA,gBAAe;AAEtC,gBAAI,iBAAiBA,gBAAe,gBAAgB,aAAa,mBAAmB,oBAAoB,YAAY,gBAAgB;AAEpI,mBAAO,qBAAqBS,UAAST,iBAAgB,YAAY,gBAAgBW,YAAW;AAAA,UAC7F;AAAA,UAEH,KAAK;AACH,mBAAO,eAAeF,UAAST,iBAAgBW,YAAW;AAAA,UAE5D,KAAK;AACH,mBAAO,oBAAoBF,UAAST,iBAAgBW,YAAW;AAAA,UAEjE,KAAK;AACH,mBAAO,eAAeF,UAAST,eAAc;AAAA,UAE/C,KAAK;AACH,mBAAO,wBAAwBS,UAAST,iBAAgBW,YAAW;AAAA,UAErE,KAAK;AACH,mBAAO,sBAAsBF,UAAST,iBAAgBW,YAAW;AAAA,UAEnE,KAAK,YACH;AACE,gBAAI,OAAOX,gBAAe;AAC1B,gBAAI,oBAAoBA,gBAAe;AAEvC,gBAAI,kBAAkBA,gBAAe,gBAAgB,OAAO,oBAAoB,oBAAoB,MAAM,iBAAiB;AAE3H,mBAAO,iBAAiBS,UAAST,iBAAgB,MAAM,iBAAiBW,YAAW;AAAA,UACpF;AAAA,UAEH,KAAK;AACH,mBAAO,eAAeF,UAAST,iBAAgBW,YAAW;AAAA,UAE5D,KAAK;AACH,mBAAO,WAAWF,UAAST,iBAAgBW,YAAW;AAAA,UAExD,KAAK;AACH,mBAAO,eAAeF,UAAST,iBAAgBW,YAAW;AAAA,UAE5D,KAAKf;AACH,mBAAO,sBAAsBa,UAAST,iBAAgBW,YAAW;AAAA,UAEnE,KAAK;AACH,mBAAO,sBAAsBF,UAAST,iBAAgBW,YAAW;AAAA,UAEnE,KAAK,eACH;AACE,gBAAI,SAASX,gBAAe;AAC5B,gBAAI,oBAAoBA,gBAAe;AAEvC,gBAAI,kBAAkB,oBAAoB,QAAQ,iBAAiB;AAEnE;AACE,kBAAIA,gBAAe,SAASA,gBAAe,aAAa;AACtD,oBAAI,iBAAiB,OAAO;AAE5B,oBAAI,gBAAgB;AAClB;AAAA,oBAAe;AAAA,oBAAgB;AAAA;AAAA,oBAC/B;AAAA,oBAAQ,yBAAyB,MAAM;AAAA,kBAAC;AAAA,gBACzC;AAAA,cACF;AAAA,YACF;AAED,8BAAkB,oBAAoB,OAAO,MAAM,eAAe;AAClE,mBAAO,oBAAoBS,UAAST,iBAAgB,QAAQ,iBAAiBW,YAAW;AAAA,UACzF;AAAA,UAEH,KAAK,qBACH;AACE,mBAAO,0BAA0BF,UAAST,iBAAgBA,gBAAe,MAAMA,gBAAe,cAAcW,YAAW;AAAA,UACxH;AAAA,UAEH,KAAK,0BACH;AACE,gBAAI,cAAcX,gBAAe;AACjC,gBAAI,oBAAoBA,gBAAe;AAEvC,gBAAI,kBAAkBA,gBAAe,gBAAgB,cAAc,oBAAoB,oBAAoB,aAAa,iBAAiB;AAEzI,mBAAO,8BAA8BS,UAAST,iBAAgB,aAAa,iBAAiBW,YAAW;AAAA,UACxG;AAAA,UAEH,KAAK,uBACH;AACE,mBAAO,4BAA4BF,UAAST,iBAAgBW,YAAW;AAAA,UACxE;AAAA,UAEH,KAAK,gBACH;AAEE;AAAA,UACD;AAAA,UAEH,KAAK,oBACH;AACE,mBAAO,yBAAyBF,UAAST,iBAAgBW,YAAW;AAAA,UACrE;AAAA,QACJ;AAED,cAAM,IAAI,MAAM,+BAA+BX,gBAAe,MAAM,yEAA8E;AAAA,MACpJ;AAEA,eAAS,WAAWA,iBAAgB;AAGlC,QAAAA,gBAAe,SAAS;AAAA,MAC1B;AAEA,eAAS,UAAUA,iBAAgB;AACjC,QAAAA,gBAAe,SAAS;AAExB;AACE,UAAAA,gBAAe,SAAS;AAAA,QACzB;AAAA,MACH;AAEA,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AAEJ;AAEE,4BAAoB,SAAU,QAAQA,iBAAgB,uBAAuB,UAAU;AAGrF,cAAI,OAAOA,gBAAe;AAE1B,iBAAO,SAAS,MAAM;AACpB,gBAAI,KAAK,QAAQ,iBAAiB,KAAK,QAAQ,UAAU;AACvD,iCAAmB,QAAQ,KAAK,SAAS;AAAA,YACjD,WAAiB,KAAK,QAAQ;AAAY;AAAA,qBAAW,KAAK,UAAU,MAAM;AAClE,mBAAK,MAAM,SAAS;AACpB,qBAAO,KAAK;AACZ;AAAA,YACD;AAED,gBAAI,SAASA,iBAAgB;AAC3B;AAAA,YACD;AAED,mBAAO,KAAK,YAAY,MAAM;AAC5B,kBAAI,KAAK,WAAW,QAAQ,KAAK,WAAWA,iBAAgB;AAC1D;AAAA,cACD;AAED,qBAAO,KAAK;AAAA,YACb;AAED,iBAAK,QAAQ,SAAS,KAAK;AAC3B,mBAAO,KAAK;AAAA,UACb;AAAA,QACL;AAEE,8BAAsB,SAAUS,UAAST,iBAAgB;AAAA,QAC3D;AAEE,gCAAwB,SAAUS,UAAST,iBAAgB,MAAM,UAAU,uBAAuB;AAGhG,cAAI,WAAWS,SAAQ;AAEvB,cAAI,aAAa,UAAU;AAGzB;AAAA,UACD;AAMD,cAAI,WAAWT,gBAAe;AAC9B,cAAI,qBAAqB;AAIzB,cAAI,gBAAgB,cAAc,UAAU,MAAM,UAAU,UAAU,uBAAuB,kBAAkB;AAE/G,UAAAA,gBAAe,cAAc;AAG7B,cAAI,eAAe;AACjB,uBAAWA,eAAc;AAAA,UAC1B;AAAA,QACL;AAEE,2BAAmB,SAAUS,UAAST,iBAAgB,SAAS,SAAS;AAEtE,cAAI,YAAY,SAAS;AACvB,uBAAWA,eAAc;AAAA,UAC1B;AAAA,QACL;AAAA,MACA;AAEA,eAAS,mBAAmB,aAAa,0BAA0B;AACjE,YAAI,eAAc,GAAI;AAGpB;AAAA,QACD;AAED,gBAAQ,YAAY,UAAQ;AAAA,UAC1B,KAAK,UACH;AAME,gBAAI,WAAW,YAAY;AAC3B,gBAAI,eAAe;AAEnB,mBAAO,aAAa,MAAM;AACxB,kBAAI,SAAS,cAAc,MAAM;AAC/B,+BAAe;AAAA,cAChB;AAED,yBAAW,SAAS;AAAA,YACrB;AAID,gBAAI,iBAAiB,MAAM;AAEzB,0BAAY,OAAO;AAAA,YAC7B,OAAe;AAGL,2BAAa,UAAU;AAAA,YACxB;AAED;AAAA,UACD;AAAA,UAEH,KAAK,aACH;AAME,gBAAI,YAAY,YAAY;AAC5B,gBAAI,gBAAgB;AAEpB,mBAAO,cAAc,MAAM;AACzB,kBAAI,UAAU,cAAc,MAAM;AAChC,gCAAgB;AAAA,cACjB;AAED,0BAAY,UAAU;AAAA,YACvB;AAID,gBAAI,kBAAkB,MAAM;AAE1B,kBAAI,CAAC,4BAA4B,YAAY,SAAS,MAAM;AAG1D,4BAAY,KAAK,UAAU;AAAA,cACvC,OAAiB;AACL,4BAAY,OAAO;AAAA,cACpB;AAAA,YACX,OAAe;AAGL,4BAAc,UAAU;AAAA,YACzB;AAED;AAAA,UACD;AAAA,QACJ;AAAA,MACH;AAEA,eAAS,iBAAiB,eAAe;AACvC,YAAI,aAAa,cAAc,cAAc,QAAQ,cAAc,UAAU,UAAU,cAAc;AACrG,YAAI,gBAAgB;AACpB,YAAI,eAAe;AAEnB,YAAI,CAAC,YAAY;AAEf,eAAM,cAAc,OAAO,iBAAiB,QAAQ;AAGlD,gBAAI,iBAAiB,cAAc;AACnC,gBAAI,mBAAmB,cAAc;AACrC,gBAAI,QAAQ,cAAc;AAE1B,mBAAO,UAAU,MAAM;AACrB,8BAAgB,WAAW,eAAe,WAAW,MAAM,OAAO,MAAM,UAAU,CAAC;AACnF,8BAAgB,MAAM;AACtB,8BAAgB,MAAM;AAQtB,gCAAkB,MAAM;AACxB,kCAAoB,MAAM;AAC1B,sBAAQ,MAAM;AAAA,YACf;AAED,0BAAc,iBAAiB;AAC/B,0BAAc,mBAAmB;AAAA,UACvC,OAAW;AACL,gBAAI,SAAS,cAAc;AAE3B,mBAAO,WAAW,MAAM;AACtB,8BAAgB,WAAW,eAAe,WAAW,OAAO,OAAO,OAAO,UAAU,CAAC;AACrF,8BAAgB,OAAO;AACvB,8BAAgB,OAAO;AAIvB,qBAAO,SAAS;AAChB,uBAAS,OAAO;AAAA,YACjB;AAAA,UACF;AAED,wBAAc,gBAAgB;AAAA,QAClC,OAAS;AAEL,eAAM,cAAc,OAAO,iBAAiB,QAAQ;AAGlD,gBAAI,oBAAoB,cAAc;AACtC,gBAAI,UAAU,cAAc;AAE5B,mBAAO,YAAY,MAAM;AACvB,8BAAgB,WAAW,eAAe,WAAW,QAAQ,OAAO,QAAQ,UAAU,CAAC;AAKvF,8BAAgB,QAAQ,eAAe;AACvC,8BAAgB,QAAQ,QAAQ;AAChC,mCAAqB,QAAQ;AAC7B,wBAAU,QAAQ;AAAA,YACnB;AAED,0BAAc,mBAAmB;AAAA,UACvC,OAAW;AACL,gBAAI,UAAU,cAAc;AAE5B,mBAAO,YAAY,MAAM;AACvB,8BAAgB,WAAW,eAAe,WAAW,QAAQ,OAAO,QAAQ,UAAU,CAAC;AAKvF,8BAAgB,QAAQ,eAAe;AACvC,8BAAgB,QAAQ,QAAQ;AAIhC,sBAAQ,SAAS;AACjB,wBAAU,QAAQ;AAAA,YACnB;AAAA,UACF;AAED,wBAAc,gBAAgB;AAAA,QAC/B;AAED,sBAAc,aAAa;AAC3B,eAAO;AAAA,MACT;AAEA,eAAS,mCAAmCS,UAAST,iBAAgB,WAAW;AAC9E,YAAI,uBAAwB,MAAKA,gBAAe,OAAO,oBAAoB,WAAWA,gBAAe,QAAQ,gBAAgB,SAAS;AACpI,oCAA0BA,eAAc;AACxC;AACA,UAAAA,gBAAe,SAAS,oBAAoB,aAAa;AACzD,iBAAO;AAAA,QACR;AAED,YAAI,cAAc,kBAAkBA,eAAc;AAElD,YAAI,cAAc,QAAQ,UAAU,eAAe,MAAM;AAGvD,cAAIS,aAAY,MAAM;AACpB,gBAAI,CAAC,aAAa;AAChB,oBAAM,IAAI,MAAM,yGAA8G;AAAA,YAC/H;AAED,iDAAqCT,eAAc;AACnD,6BAAiBA,eAAc;AAE/B;AACE,mBAAKA,gBAAe,OAAO,iBAAiB,QAAQ;AAClD,oBAAI,qBAAqB,cAAc;AAEvC,oBAAI,oBAAoB;AAEtB,sBAAI,uBAAuBA,gBAAe;AAE1C,sBAAI,yBAAyB,MAAM;AAEjC,oBAAAA,gBAAe,oBAAoB,qBAAqB;AAAA,kBACzD;AAAA,gBACF;AAAA,cACF;AAAA,YACF;AAED,mBAAO;AAAA,UACb,OAAW;AAGL;AAEA,iBAAKA,gBAAe,QAAQ,gBAAgB,SAAS;AAEnD,cAAAA,gBAAe,gBAAgB;AAAA,YAChC;AAOD,YAAAA,gBAAe,SAAS;AACxB,6BAAiBA,eAAc;AAE/B;AACE,mBAAKA,gBAAe,OAAO,iBAAiB,QAAQ;AAClD,oBAAI,sBAAsB,cAAc;AAExC,oBAAI,qBAAqB;AAEvB,sBAAI,wBAAwBA,gBAAe;AAE3C,sBAAI,0BAA0B,MAAM;AAElC,oBAAAA,gBAAe,oBAAoB,sBAAsB;AAAA,kBAC1D;AAAA,gBACF;AAAA,cACF;AAAA,YACF;AAED,mBAAO;AAAA,UACR;AAAA,QACL,OAAS;AAKL;AAEA,iBAAO;AAAA,QACR;AAAA,MACH;AAEA,eAAS,aAAaS,UAAST,iBAAgBW,cAAa;AAC1D,YAAI,WAAWX,gBAAe;AAK9B,uBAAeA,eAAc;AAE7B,gBAAQA,gBAAe,KAAG;AAAA,UACxB,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AACH,6BAAiBA,eAAc;AAC/B,mBAAO;AAAA,UAET,KAAK,gBACH;AACE,gBAAI,YAAYA,gBAAe;AAE/B,gBAAI,kBAAkB,SAAS,GAAG;AAChC,yBAAWA,eAAc;AAAA,YAC1B;AAED,6BAAiBA,eAAc;AAC/B,mBAAO;AAAA,UACR;AAAA,UAEH,KAAK,UACH;AACE,gBAAI,YAAYA,gBAAe;AAC/B,6BAAiBA,eAAc;AAC/B,qCAAyBA,eAAc;AACvC;AAEA,gBAAI,UAAU,gBAAgB;AAC5B,wBAAU,UAAU,UAAU;AAC9B,wBAAU,iBAAiB;AAAA,YAC5B;AAED,gBAAIS,aAAY,QAAQA,SAAQ,UAAU,MAAM;AAG9C,kBAAI,cAAc,kBAAkBT,eAAc;AAElD,kBAAI,aAAa;AAGf,2BAAWA,eAAc;AAAA,cACrC,OAAiB;AACL,oBAAIS,aAAY,MAAM;AACpB,sBAAI,YAAYA,SAAQ;AAExB;AAAA;AAAA,oBACA,CAAC,UAAU;AAAA,qBACVT,gBAAe,QAAQ,uBAAuB;AAAA,oBAAS;AAOtD,oBAAAA,gBAAe,SAAS;AAIxB;kBACD;AAAA,gBACF;AAAA,cACF;AAAA,YACF;AAED,gCAAoBS,UAAST,eAAc;AAC3C,6BAAiBA,eAAc;AAE/B,mBAAO;AAAA,UACR;AAAA,UAEH,KAAK,eACH;AACE,2BAAeA,eAAc;AAC7B,gBAAI,wBAAwB;AAC5B,gBAAI,OAAOA,gBAAe;AAE1B,gBAAIS,aAAY,QAAQT,gBAAe,aAAa,MAAM;AACxD,oCAAsBS,UAAST,iBAAgB,MAAM,UAAU,qBAAqB;AAEpF,kBAAIS,SAAQ,QAAQT,gBAAe,KAAK;AACtC,0BAAUA,eAAc;AAAA,cACzB;AAAA,YACX,OAAe;AACL,kBAAI,CAAC,UAAU;AACb,oBAAIA,gBAAe,cAAc,MAAM;AACrC,wBAAM,IAAI,MAAM,6GAAkH;AAAA,gBACnI;AAGD,iCAAiBA,eAAc;AAC/B,uBAAO;AAAA,cACR;AAED,kBAAI,qBAAqB;AAKzB,kBAAI,eAAe,kBAAkBA,eAAc;AAEnD,kBAAI,cAAc;AAGhB,oBAAI,6BAA6BA,iBAAgB,uBAAuB,kBAAkB,GAAG;AAG3F,6BAAWA,eAAc;AAAA,gBAC1B;AAAA,cACb,OAAiB;AACL,oBAAI,WAAW,eAAe,MAAM,UAAU,uBAAuB,oBAAoBA,eAAc;AACvG,kCAAkB,UAAUA,iBAAgB,OAAO,KAAK;AACxD,gBAAAA,gBAAe,YAAY;AAI3B,oBAAI,wBAAwB,UAAU,MAAM,UAAU,qBAAqB,GAAG;AAC5E,6BAAWA,eAAc;AAAA,gBAC1B;AAAA,cACF;AAED,kBAAIA,gBAAe,QAAQ,MAAM;AAE/B,0BAAUA,eAAc;AAAA,cACzB;AAAA,YACF;AAED,6BAAiBA,eAAc;AAC/B,mBAAO;AAAA,UACR;AAAA,UAEH,KAAK,UACH;AACE,gBAAI,UAAU;AAEd,gBAAIS,YAAWT,gBAAe,aAAa,MAAM;AAC/C,kBAAI,UAAUS,SAAQ;AAGtB,+BAAiBA,UAAST,iBAAgB,SAAS,OAAO;AAAA,YACpE,OAAe;AACL,kBAAI,OAAO,YAAY,UAAU;AAC/B,oBAAIA,gBAAe,cAAc,MAAM;AACrC,wBAAM,IAAI,MAAM,6GAAkH;AAAA,gBACnI;AAAA,cAEF;AAED,kBAAI,yBAAyB;AAE7B,kBAAI,sBAAsB;AAE1B,kBAAI,gBAAgB,kBAAkBA,eAAc;AAEpD,kBAAI,eAAe;AACjB,oBAAI,iCAAiCA,eAAc,GAAG;AACpD,6BAAWA,eAAc;AAAA,gBAC1B;AAAA,cACb,OAAiB;AACL,gBAAAA,gBAAe,YAAY,mBAAmB,SAAS,wBAAwB,qBAAqBA,eAAc;AAAA,cACnH;AAAA,YACF;AAED,6BAAiBA,eAAc;AAC/B,mBAAO;AAAA,UACR;AAAA,UAEH,KAAK,mBACH;AACE,+BAAmBA,eAAc;AACjC,gBAAI,YAAYA,gBAAe;AAM/B,gBAAIS,aAAY,QAAQA,SAAQ,kBAAkB,QAAQA,SAAQ,cAAc,eAAe,MAAM;AACnG,kBAAI,kCAAkC,mCAAmCA,UAAST,iBAAgB,SAAS;AAE3G,kBAAI,CAAC,iCAAiC;AACpC,oBAAIA,gBAAe,QAAQ,eAAe;AAGxC,yBAAOA;AAAA,gBACrB,OAAmB;AAGL,yBAAO;AAAA,gBACR;AAAA,cACF;AAAA,YAEF;AAED,iBAAKA,gBAAe,QAAQ,gBAAgB,SAAS;AAEnD,cAAAA,gBAAe,QAAQW;AAEvB,mBAAMX,gBAAe,OAAO,iBAAiB,QAAQ;AACnD,uCAAuBA,eAAc;AAAA,cACtC;AAGD,qBAAOA;AAAA,YACR;AAED,gBAAI,iBAAiB,cAAc;AACnC,gBAAI,iBAAiBS,aAAY,QAAQA,SAAQ,kBAAkB;AAInE,gBAAI,mBAAmB,gBAAgB;AAarC,kBAAI,gBAAgB;AAClB,oBAAI,mBAAmBT,gBAAe;AACtC,iCAAiB,SAAS;AAI1B,qBAAKA,gBAAe,OAAO,oBAAoB,QAAQ;AAQrD,sBAAI,2BAA2BS,aAAY,SAAST,gBAAe,cAAc,+BAA+B,QAAQ,CAAC;AAEzH,sBAAI,4BAA4B,mBAAmB,oBAAoB,SAAS,8BAA8B,GAAG;AAG/G;kBAChB,OAAqB;AAGL;kBACD;AAAA,gBACF;AAAA,cACF;AAAA,YACF;AAED,gBAAI,YAAYA,gBAAe;AAE/B,gBAAI,cAAc,MAAM;AAGtB,cAAAA,gBAAe,SAAS;AAAA,YACzB;AAED,6BAAiBA,eAAc;AAE/B;AACE,mBAAKA,gBAAe,OAAO,iBAAiB,QAAQ;AAClD,oBAAI,gBAAgB;AAElB,sBAAI,uBAAuBA,gBAAe;AAE1C,sBAAI,yBAAyB,MAAM;AAEjC,oBAAAA,gBAAe,oBAAoB,qBAAqB;AAAA,kBACzD;AAAA,gBACF;AAAA,cACF;AAAA,YACF;AAED,mBAAO;AAAA,UACR;AAAA,UAEH,KAAK;AACH,6BAAiBA,eAAc;AAC/B,gCAAoBS,UAAST,eAAc;AAE3C,gBAAIS,aAAY,MAAM;AACpB,iCAAmBT,gBAAe,UAAU,aAAa;AAAA,YAC1D;AAED,6BAAiBA,eAAc;AAC/B,mBAAO;AAAA,UAET,KAAKJ;AAEH,gBAAI,UAAUI,gBAAe,KAAK;AAClC,wBAAY,SAASA,eAAc;AACnC,6BAAiBA,eAAc;AAC/B,mBAAO;AAAA,UAET,KAAK,0BACH;AAGE,gBAAI,aAAaA,gBAAe;AAEhC,gBAAI,kBAAkB,UAAU,GAAG;AACjC,yBAAWA,eAAc;AAAA,YAC1B;AAED,6BAAiBA,eAAc;AAC/B,mBAAO;AAAA,UACR;AAAA,UAEH,KAAK,uBACH;AACE,+BAAmBA,eAAc;AACjC,gBAAI,cAAcA,gBAAe;AAEjC,gBAAI,gBAAgB,MAAM;AAGxB,+BAAiBA,eAAc;AAC/B,qBAAO;AAAA,YACR;AAED,gBAAI,qBAAqBA,gBAAe,QAAQ,gBAAgB;AAChE,gBAAI,eAAe,YAAY;AAE/B,gBAAI,iBAAiB,MAAM;AAEzB,kBAAI,CAAC,mBAAmB;AAUtB,oBAAI,oBAAoB,yBAA0B,MAAKS,aAAY,SAASA,SAAQ,QAAQ,gBAAgB;AAE5G,oBAAI,CAAC,mBAAmB;AACtB,sBAAI,MAAMT,gBAAe;AAEzB,yBAAO,QAAQ,MAAM;AACnB,wBAAI,YAAY,mBAAmB,GAAG;AAEtC,wBAAI,cAAc,MAAM;AACtB,0CAAoB;AACpB,sBAAAA,gBAAe,SAAS;AACxB,yCAAmB,aAAa,KAAK;AAarC,0BAAI,eAAe,UAAU;AAE7B,0BAAI,iBAAiB,MAAM;AACzB,wBAAAA,gBAAe,cAAc;AAC7B,wBAAAA,gBAAe,SAAS;AAAA,sBACzB;AAMD,sBAAAA,gBAAe,eAAe;AAC9B,uCAAiBA,iBAAgBW,YAAW;AAG5C,0CAAoBX,iBAAgB,0BAA0B,oBAAoB,SAAS,qBAAqB,CAAC;AAEjH,6BAAOA,gBAAe;AAAA,oBACvB;AAED,0BAAM,IAAI;AAAA,kBACX;AAAA,gBACF;AAED,oBAAI,YAAY,SAAS,QAAQ,IAAK,IAAG,oBAAmB,GAAI;AAI9D,kBAAAA,gBAAe,SAAS;AACxB,sCAAoB;AACpB,qCAAmB,aAAa,KAAK;AASrC,kBAAAA,gBAAe,QAAQ;AAAA,gBACxB;AAAA,cACb,OAAiB;AACL,mCAAmB,aAAa,KAAK;AAAA,cACtC;AAAA,YAEX,OAAe;AAEL,kBAAI,CAAC,mBAAmB;AACtB,oBAAI,aAAa,mBAAmB,YAAY;AAEhD,oBAAI,eAAe,MAAM;AACvB,kBAAAA,gBAAe,SAAS;AACxB,sCAAoB;AAGpB,sBAAI,gBAAgB,WAAW;AAE/B,sBAAI,kBAAkB,MAAM;AAC1B,oBAAAA,gBAAe,cAAc;AAC7B,oBAAAA,gBAAe,SAAS;AAAA,kBACzB;AAED,qCAAmB,aAAa,IAAI;AAEpC,sBAAI,YAAY,SAAS,QAAQ,YAAY,aAAa,YAAY,CAAC,aAAa,aAAa,CAAC,eAAgB,GAChH;AAEE,qCAAiBA,eAAc;AAC/B,2BAAO;AAAA,kBACR;AAAA,gBACjB;AAAA;AAAA;AAAA;AAAA,kBAGY,IAAG,IAAK,IAAI,YAAY,qBAAqB,oBAAqB,KAAIW,iBAAgB;AAAA,kBAAe;AAInG,kBAAAX,gBAAe,SAAS;AACxB,sCAAoB;AACpB,qCAAmB,aAAa,KAAK;AASrC,kBAAAA,gBAAe,QAAQ;AAAA,gBACxB;AAAA,cACF;AAED,kBAAI,YAAY,aAAa;AAM3B,6BAAa,UAAUA,gBAAe;AACtC,gBAAAA,gBAAe,QAAQ;AAAA,cACnC,OAAiB;AACL,oBAAI,kBAAkB,YAAY;AAElC,oBAAI,oBAAoB,MAAM;AAC5B,kCAAgB,UAAU;AAAA,gBACxC,OAAmB;AACL,kBAAAA,gBAAe,QAAQ;AAAA,gBACxB;AAED,4BAAY,OAAO;AAAA,cACpB;AAAA,YACF;AAED,gBAAI,YAAY,SAAS,MAAM;AAG7B,kBAAI,OAAO,YAAY;AACvB,0BAAY,YAAY;AACxB,0BAAY,OAAO,KAAK;AACxB,0BAAY,qBAAqB;AACjC,mBAAK,UAAU;AAIf,kBAAI,kBAAkB,oBAAoB;AAE1C,kBAAI,mBAAmB;AACrB,kCAAkB,0BAA0B,iBAAiB,qBAAqB;AAAA,cAC9F,OAAiB;AACL,kCAAkB,iCAAiC,eAAe;AAAA,cACnE;AAED,kCAAoBA,iBAAgB,eAAe;AAGnD,qBAAO;AAAA,YACR;AAED,6BAAiBA,eAAc;AAC/B,mBAAO;AAAA,UACR;AAAA,UAEH,KAAK,gBACH;AAEE;AAAA,UACD;AAAA,UAEH,KAAK;AAAA,UACL,KAAK,uBACH;AACE,2BAAeA,eAAc;AAC7B,gBAAI,aAAaA,gBAAe;AAChC,gBAAI,eAAe,eAAe;AAElC,gBAAIS,aAAY,MAAM;AACpB,kBAAI,aAAaA,SAAQ;AACzB,kBAAI,eAAe,eAAe;AAElC,kBAAI,iBAAiB;AAAA,cACrB,CAAC,oBAAsB;AACrB,gBAAAT,gBAAe,SAAS;AAAA,cACzB;AAAA,YACF;AAED,gBAAI,CAAC,iBAAiBA,gBAAe,OAAO,oBAAoB,QAAQ;AACtE,+BAAiBA,eAAc;AAAA,YACzC,OAAe;AAGL,kBAAI,iBAAiB,oBAAoB,aAAa,GAAG;AACvD,iCAAiBA,eAAc;AAE/B;AAIE,sBAAKA,gBAAe,gBAAgB,YAAY,SAAS;AACvD,oBAAAA,gBAAe,SAAS;AAAA,kBACzB;AAAA,gBACF;AAAA,cACF;AAAA,YACF;AACD,mBAAO;AAAA,UACR;AAAA,UAEH,KAAK,gBACH;AAEE,mBAAO;AAAA,UACR;AAAA,UAEH,KAAK,wBACH;AAEE,mBAAO;AAAA,UACR;AAAA,QACJ;AAED,cAAM,IAAI,MAAM,+BAA+BA,gBAAe,MAAM,yEAA8E;AAAA,MACpJ;AAEA,eAAS,WAAWS,UAAST,iBAAgBW,cAAa;AAKxD,uBAAeX,eAAc;AAE7B,gBAAQA,gBAAe,KAAG;AAAA,UACxB,KAAK,gBACH;AACE,gBAAI,YAAYA,gBAAe;AAE/B,gBAAI,kBAAkB,SAAS,GAAG;AAChC,yBAAWA,eAAc;AAAA,YAC1B;AAED,gBAAI,QAAQA,gBAAe;AAE3B,gBAAI,QAAQ,eAAe;AACzB,cAAAA,gBAAe,QAAQ,QAAQ,CAAC,gBAAgB;AAEhD,mBAAMA,gBAAe,OAAO,iBAAiB,QAAQ;AACnD,uCAAuBA,eAAc;AAAA,cACtC;AAED,qBAAOA;AAAA,YACR;AAED,mBAAO;AAAA,UACR;AAAA,UAEH,KAAK,UACH;AACa,YAAAA,gBAAe;AAC1B,6BAAiBA,eAAc;AAC/B,qCAAyBA,eAAc;AACvC;AACA,gBAAI,SAASA,gBAAe;AAE5B,iBAAK,SAAS,mBAAmB,YAAY,SAAS,gBAAgB,SAAS;AAG7E,cAAAA,gBAAe,QAAQ,SAAS,CAAC,gBAAgB;AACjD,qBAAOA;AAAA,YACR;AAGD,mBAAO;AAAA,UACR;AAAA,UAEH,KAAK,eACH;AAEE,2BAAeA,eAAc;AAC7B,mBAAO;AAAA,UACR;AAAA,UAEH,KAAK,mBACH;AACE,+BAAmBA,eAAc;AACjC,gBAAI,gBAAgBA,gBAAe;AAEnC,gBAAI,kBAAkB,QAAQ,cAAc,eAAe,MAAM;AAC/D,kBAAIA,gBAAe,cAAc,MAAM;AACrC,sBAAM,IAAI,MAAM,mGAAwG;AAAA,cACzH;AAED;YACD;AAED,gBAAI,UAAUA,gBAAe;AAE7B,gBAAI,UAAU,eAAe;AAC3B,cAAAA,gBAAe,QAAQ,UAAU,CAAC,gBAAgB;AAElD,mBAAMA,gBAAe,OAAO,iBAAiB,QAAQ;AACnD,uCAAuBA,eAAc;AAAA,cACtC;AAED,qBAAOA;AAAA,YACR;AAED,mBAAO;AAAA,UACR;AAAA,UAEH,KAAK,uBACH;AACE,+BAAmBA,eAAc;AAGjC,mBAAO;AAAA,UACR;AAAA,UAEH,KAAK;AACH,6BAAiBA,eAAc;AAC/B,mBAAO;AAAA,UAET,KAAKJ;AACH,gBAAI,UAAUI,gBAAe,KAAK;AAClC,wBAAY,SAASA,eAAc;AACnC,mBAAO;AAAA,UAET,KAAK;AAAA,UACL,KAAK;AACH,2BAAeA,eAAc;AAC7B,mBAAO;AAAA,UAET,KAAK;AAEH,mBAAO;AAAA,UAET;AACE,mBAAO;AAAA,QACV;AAAA,MACH;AAEA,eAAS,sBAAsBS,UAAS,iBAAiBE,cAAa;AAKpE,uBAAe,eAAe;AAE9B,gBAAQ,gBAAgB,KAAG;AAAA,UACzB,KAAK,gBACH;AACE,gBAAI,oBAAoB,gBAAgB,KAAK;AAE7C,gBAAI,sBAAsB,QAAQ,sBAAsB,QAAW;AACjE,yBAAW,eAAe;AAAA,YAC3B;AAED;AAAA,UACD;AAAA,UAEH,KAAK,UACH;AACa,4BAAgB;AAC3B,6BAAiB,eAAe;AAChC,qCAAyB,eAAe;AACxC;AACA;AAAA,UACD;AAAA,UAEH,KAAK,eACH;AACE,2BAAe,eAAe;AAC9B;AAAA,UACD;AAAA,UAEH,KAAK;AACH,6BAAiB,eAAe;AAChC;AAAA,UAEF,KAAK;AACH,+BAAmB,eAAe;AAClC;AAAA,UAEF,KAAK;AACH,+BAAmB,eAAe;AAClC;AAAA,UAEF,KAAKf;AACH,gBAAI,UAAU,gBAAgB,KAAK;AACnC,wBAAY,SAAS,eAAe;AACpC;AAAA,UAEF,KAAK;AAAA,UACL,KAAK;AACH,2BAAe,eAAe;AAC9B;AAAA,QACH;AAAA,MACH;AAEA,UAAI,4CAA4C;AAEhD;AACE,oDAA4C,oBAAI;MAClD;AAKA,UAAI,2BAA2B;AAC/B,UAAI,4BAA4B;AAChC,UAAI,kBAAkB,OAAO,YAAY,aAAa,UAAU;AAChE,UAAI,aAAa;AAEjB,UAAI,kBAAkB;AACtB,UAAI,iBAAiB;AACrB,eAAS,yBAAyBjG,QAAO;AAMvC;AACE,gCAAsB,MAAM,WAAY;AACtC,kBAAMA;AAAA,UACZ,CAAK;AACD;QACD;AAAA,MACH;AAEA,UAAI,oCAAoC,SAAU8G,UAAS,UAAU;AACnE,iBAAS,QAAQA,SAAQ;AACzB,iBAAS,QAAQA,SAAQ;AAEzB,YAAKA,SAAQ,OAAO,aAAa;AAC/B,cAAI;AACF;AACA,qBAAS,qBAAoB;AAAA,UACnC,UAAc;AACR,uCAA2BA,QAAO;AAAA,UACnC;AAAA,QACL,OAAS;AACL,mBAAS,qBAAoB;AAAA,QAC9B;AAAA,MACH;AAGA,eAAS,0CAA0CA,UAAS,wBAAwB;AAClF,YAAI;AACF,oCAA0B,QAAQA,QAAO;AAAA,QAC1C,SAAQ9G,QAAO;AACd,kCAAwB8G,UAAS,wBAAwB9G,MAAK;AAAA,QAC/D;AAAA,MACH;AAGA,eAAS,+BAA+B8G,UAAS,wBAAwB,UAAU;AACjF,YAAI;AACF,4CAAkCA,UAAS,QAAQ;AAAA,QACpD,SAAQ9G,QAAO;AACd,kCAAwB8G,UAAS,wBAAwB9G,MAAK;AAAA,QAC/D;AAAA,MACH;AAGA,eAAS,4BAA4B8G,UAAS,wBAAwB,UAAU;AAC9E,YAAI;AACF,mBAAS,kBAAiB;AAAA,QAC3B,SAAQ9G,QAAO;AACd,kCAAwB8G,UAAS,wBAAwB9G,MAAK;AAAA,QAC/D;AAAA,MACH;AAGA,eAAS,gBAAgB8G,UAAS,wBAAwB;AACxD,YAAI;AACF,0BAAgBA,QAAO;AAAA,QACxB,SAAQ9G,QAAO;AACd,kCAAwB8G,UAAS,wBAAwB9G,MAAK;AAAA,QAC/D;AAAA,MACH;AAEA,eAAS,gBAAgB8G,UAAS,wBAAwB;AACxD,YAAI,MAAMA,SAAQ;AAElB,YAAI,QAAQ,MAAM;AAChB,cAAI,OAAO,QAAQ,YAAY;AAC7B,gBAAI;AAEJ,gBAAI;AACF,kBAAI,uBAAuB,6BAA6BA,SAAQ,OAAO,aAAa;AAClF,oBAAI;AACF;AACA,2BAAS,IAAI,IAAI;AAAA,gBAC7B,UAAoB;AACR,6CAA2BA,QAAO;AAAA,gBACnC;AAAA,cACX,OAAe;AACL,yBAAS,IAAI,IAAI;AAAA,cAClB;AAAA,YACF,SAAQ9G,QAAO;AACd,sCAAwB8G,UAAS,wBAAwB9G,MAAK;AAAA,YAC/D;AAED;AACE,kBAAI,OAAO,WAAW,YAAY;AAChC,sBAAM,mGAAwG,0BAA0B8G,QAAO,CAAC;AAAA,cACjJ;AAAA,YACF;AAAA,UACP,OAAW;AACL,gBAAI,UAAU;AAAA,UACf;AAAA,QACF;AAAA,MACH;AAEA,eAAS,kBAAkBA,UAAS,wBAAwB,SAAS;AACnE,YAAI;AACF;QACD,SAAQ9G,QAAO;AACd,kCAAwB8G,UAAS,wBAAwB9G,MAAK;AAAA,QAC/D;AAAA,MACH;AAGA,UAAI,oCAAoC;AACxC,eAAS,4BAA4B+G,OAAM,YAAY;AAC7B,yBAAiBA,MAAK,aAAa;AAC3D,qBAAa;AACb;AAEA,YAAI,aAAa;AACjB,4CAAoC;AAEpC,eAAO;AAAA,MACT;AAEA,eAAS,oCAAoC;AAC3C,eAAO,eAAe,MAAM;AAC1B,cAAI,QAAQ;AAEZ,cAAI,QAAQ,MAAM;AAElB,eAAK,MAAM,eAAe,wBAAwB,WAAW,UAAU,MAAM;AAC3E,kBAAM,SAAS;AACf,yBAAa;AAAA,UACnB,OAAW;AACL;UACD;AAAA,QACF;AAAA,MACH;AAEA,eAAS,uCAAuC;AAC9C,eAAO,eAAe,MAAM;AAC1B,cAAI,QAAQ;AACZ,0BAAgB,KAAK;AAErB,cAAI;AACF,+CAAmC,KAAK;AAAA,UACzC,SAAQ/G,QAAO;AACd,oCAAwB,OAAO,MAAM,QAAQA,MAAK;AAAA,UACnD;AAED;AACA,cAAI,UAAU,MAAM;AAEpB,cAAI,YAAY,MAAM;AACpB,oBAAQ,SAAS,MAAM;AACvB,yBAAa;AACb;AAAA,UACD;AAED,uBAAa,MAAM;AAAA,QACpB;AAAA,MACH;AAEA,eAAS,mCAAmC,cAAc;AACxD,YAAI8G,WAAU,aAAa;AAC3B,YAAI,QAAQ,aAAa;AAEzB,aAAK,QAAQ,cAAc,SAAS;AAClC,0BAAgB,YAAY;AAE5B,kBAAQ,aAAa,KAAG;AAAA,YACtB,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK,qBACH;AACE;AAAA,YACD;AAAA,YAEH,KAAK,gBACH;AACE,kBAAIA,aAAY,MAAM;AACpB,oBAAI,YAAYA,SAAQ;AACxB,oBAAI,YAAYA,SAAQ;AACxB,oBAAI,WAAW,aAAa;AAI5B;AACE,sBAAI,aAAa,SAAS,aAAa,eAAe,CAAC,8BAA8B;AACnF,wBAAI,SAAS,UAAU,aAAa,eAAe;AACjD,4BAAM,0MAA8N,0BAA0B,YAAY,KAAK,UAAU;AAAA,oBAC1R;AAED,wBAAI,SAAS,UAAU,aAAa,eAAe;AACjD,4BAAM,0MAA8N,0BAA0B,YAAY,KAAK,UAAU;AAAA,oBAC1R;AAAA,kBACF;AAAA,gBACF;AAED,oBAAI,WAAW,SAAS,wBAAwB,aAAa,gBAAgB,aAAa,OAAO,YAAY,oBAAoB,aAAa,MAAM,SAAS,GAAG,SAAS;AAEzK;AACE,sBAAI,aAAa;AAEjB,sBAAI,aAAa,UAAa,CAAC,WAAW,IAAI,aAAa,IAAI,GAAG;AAChE,+BAAW,IAAI,aAAa,IAAI;AAEhC,0BAAM,2GAAgH,0BAA0B,YAAY,CAAC;AAAA,kBAC9J;AAAA,gBACF;AAED,yBAAS,sCAAsC;AAAA,cAChD;AAED;AAAA,YACD;AAAA,YAEH,KAAK,UACH;AACE;AACE,oBAAIC,QAAO,aAAa;AACxB,+BAAeA,MAAK,aAAa;AAAA,cAClC;AAED;AAAA,YACD;AAAA,YAEH,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAEH;AAAA,YAEF,SACE;AACE,oBAAM,IAAI,MAAM,0HAA+H;AAAA,YAChJ;AAAA,UACJ;AAED;QACD;AAAA,MACH;AAEA,eAAS,4BAA4B,OAAO,cAAc,wBAAwB;AAChF,YAAI,cAAc,aAAa;AAC/B,YAAI,aAAa,gBAAgB,OAAO,YAAY,aAAa;AAEjE,YAAI,eAAe,MAAM;AACvB,cAAI,cAAc,WAAW;AAC7B,cAAI,SAAS;AAEb,aAAG;AACD,iBAAK,OAAO,MAAM,WAAW,OAAO;AAElC,kBAAI,UAAU,OAAO;AACrB,qBAAO,UAAU;AAEjB,kBAAI,YAAY,QAAW;AACzB;AACE,uBAAK,QAAQ,eAAe,WAAW;AACrC,6DAAyC,YAAY;AAAA,kBACtD,YAAW,QAAQ,YAAY,WAAW;AACzC,4DAAwC,YAAY;AAAA,kBACrD;AAAA,gBACF;AAED;AACE,uBAAK,QAAQ,eAAe,WAAW;AACrC,gDAA4B,IAAI;AAAA,kBACjC;AAAA,gBACF;AAED,kCAAkB,cAAc,wBAAwB,OAAO;AAE/D;AACE,uBAAK,QAAQ,eAAe,WAAW;AACrC,gDAA4B,KAAK;AAAA,kBAClC;AAAA,gBACF;AAED;AACE,uBAAK,QAAQ,eAAe,WAAW;AACrC;kBACD,YAAW,QAAQ,YAAY,WAAW;AACzC;kBACD;AAAA,gBACF;AAAA,cACF;AAAA,YACF;AAED,qBAAS,OAAO;AAAA,UACtB,SAAa,WAAW;AAAA,QACrB;AAAA,MACH;AAEA,eAAS,0BAA0B,OAAO,cAAc;AACtD,YAAI,cAAc,aAAa;AAC/B,YAAI,aAAa,gBAAgB,OAAO,YAAY,aAAa;AAEjE,YAAI,eAAe,MAAM;AACvB,cAAI,cAAc,WAAW;AAC7B,cAAI,SAAS;AAEb,aAAG;AACD,iBAAK,OAAO,MAAM,WAAW,OAAO;AAClC;AACE,qBAAK,QAAQ,eAAe,WAAW;AACrC,yDAAuC,YAAY;AAAA,gBACpD,YAAW,QAAQ,YAAY,WAAW;AACzC,wDAAsC,YAAY;AAAA,gBACnD;AAAA,cACF;AAGD,kBAAI,SAAS,OAAO;AAEpB;AACE,qBAAK,QAAQ,eAAe,WAAW;AACrC,8CAA4B,IAAI;AAAA,gBACjC;AAAA,cACF;AAED,qBAAO,UAAU;AAEjB;AACE,qBAAK,QAAQ,eAAe,WAAW;AACrC,8CAA4B,KAAK;AAAA,gBAClC;AAAA,cACF;AAED;AACE,qBAAK,QAAQ,eAAe,WAAW;AACrC;gBACD,YAAW,QAAQ,YAAY,WAAW;AACzC;gBACD;AAAA,cACF;AAED;AACE,oBAAI,UAAU,OAAO;AAErB,oBAAI,YAAY,UAAa,OAAO,YAAY,YAAY;AAC1D,sBAAI,WAAW;AAEf,uBAAK,OAAO,MAAM,YAAY,SAAS;AACrC,+BAAW;AAAA,kBACZ,YAAW,OAAO,MAAM,eAAe,SAAS;AAC/C,+BAAW;AAAA,kBACzB,OAAmB;AACL,+BAAW;AAAA,kBACZ;AAED,sBAAI,WAAW;AAEf,sBAAI,YAAY,MAAM;AACpB,+BAAW;AAAA,kBACZ,WAAU,OAAO,QAAQ,SAAS,YAAY;AAC7C,+BAAW,iCAAiC,WAAW,+HAAyI,WAAW;AAAA,kBACzN,OAAmB;AACL,+BAAW,oBAAoB;AAAA,kBAChC;AAED,wBAAM,iFAAsF,UAAU,QAAQ;AAAA,gBAC/G;AAAA,cACF;AAAA,YACF;AAED,qBAAS,OAAO;AAAA,UACtB,SAAa,WAAW;AAAA,QACrB;AAAA,MACH;AAEA,eAAS,6BAA6B,cAAc,cAAc;AAChE;AAEE,eAAK,aAAa,QAAQ,YAAY,SAAS;AAC7C,oBAAQ,aAAa,KAAG;AAAA,cACtB,KAAK,UACH;AACE,oBAAI,wBAAwB,aAAa,UAAU;AACnD,oBAAI,wBAAwB,aAAa,eACrC,KAAK,sBAAsB,IAC3B,eAAe,sBAAsB;AAGzC,oBAAIa,cAAa;AACjB,oBAAI,QAAQ,aAAa,cAAc,OAAO,UAAU;AAExD;AACE,sBAAI,sBAAqB,GAAI;AAC3B,4BAAQ;AAAA,kBACT;AAAA,gBACF;AAED,oBAAI,OAAO,iBAAiB,YAAY;AACtC,+BAAa,IAAI,OAAO,uBAAuBA,WAAU;AAAA,gBAC1D;AAID,oBAAI,cAAc,aAAa;AAE/B;AAAO,yBAAO,gBAAgB,MAAM;AAClC,4BAAQ,YAAY,KAAG;AAAA,sBACrB,KAAK;AACH,4BAAIb,QAAO,YAAY;AACvB,wBAAAA,MAAK,yBAAyB;AAC9B,8BAAM;AAAA,sBAER,KAAK;AACH,4BAAI,kBAAkB,YAAY;AAClC,wCAAgB,yBAAyB;AACzC,8BAAM;AAAA,oBACT;AAED,kCAAc,YAAY;AAAA,kBAC3B;AAED;AAAA,cACD;AAAA,YACJ;AAAA,UACF;AAAA,QACF;AAAA,MACH;AAEA,eAAS,0BAA0B,cAAcD,UAAS,cAAc,gBAAgB;AACtF,aAAK,aAAa,QAAQ,gBAAgB,SAAS;AACjD,kBAAQ,aAAa,KAAG;AAAA,YACtB,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK,qBACH;AACE,kBAAK,CAAC,2BAA2B;AAK/B,oBAAK,aAAa,OAAO,aAAa;AACpC,sBAAI;AACF;AACA,8CAA0B,SAAS,WAAW,YAAY;AAAA,kBAC1E,UAAwB;AACR,+CAA2B,YAAY;AAAA,kBACxC;AAAA,gBACf,OAAmB;AACL,4CAA0B,SAAS,WAAW,YAAY;AAAA,gBAC3D;AAAA,cACF;AAED;AAAA,YACD;AAAA,YAEH,KAAK,gBACH;AACE,kBAAI,WAAW,aAAa;AAE5B,kBAAI,aAAa,QAAQ,QAAQ;AAC/B,oBAAI,CAAC,2BAA2B;AAC9B,sBAAIA,aAAY,MAAM;AAIpB;AACE,0BAAI,aAAa,SAAS,aAAa,eAAe,CAAC,8BAA8B;AACnF,4BAAI,SAAS,UAAU,aAAa,eAAe;AACjD,gCAAM,oMAAwN,0BAA0B,YAAY,KAAK,UAAU;AAAA,wBACpR;AAED,4BAAI,SAAS,UAAU,aAAa,eAAe;AACjD,gCAAM,oMAAwN,0BAA0B,YAAY,KAAK,UAAU;AAAA,wBACpR;AAAA,sBACF;AAAA,oBACF;AAED,wBAAK,aAAa,OAAO,aAAa;AACpC,0BAAI;AACF;AACA,iCAAS,kBAAiB;AAAA,sBAC9C,UAA4B;AACR,mDAA2B,YAAY;AAAA,sBACxC;AAAA,oBACnB,OAAuB;AACL,+BAAS,kBAAiB;AAAA,oBAC3B;AAAA,kBACjB,OAAqB;AACL,wBAAI,YAAY,aAAa,gBAAgB,aAAa,OAAOA,SAAQ,gBAAgB,oBAAoB,aAAa,MAAMA,SAAQ,aAAa;AACrJ,wBAAI,YAAYA,SAAQ;AAIxB;AACE,0BAAI,aAAa,SAAS,aAAa,eAAe,CAAC,8BAA8B;AACnF,4BAAI,SAAS,UAAU,aAAa,eAAe;AACjD,gCAAM,qMAAyN,0BAA0B,YAAY,KAAK,UAAU;AAAA,wBACrR;AAED,4BAAI,SAAS,UAAU,aAAa,eAAe;AACjD,gCAAM,qMAAyN,0BAA0B,YAAY,KAAK,UAAU;AAAA,wBACrR;AAAA,sBACF;AAAA,oBACF;AAED,wBAAK,aAAa,OAAO,aAAa;AACpC,0BAAI;AACF;AACA,iCAAS,mBAAmB,WAAW,WAAW,SAAS,mCAAmC;AAAA,sBAClH,UAA4B;AACR,mDAA2B,YAAY;AAAA,sBACxC;AAAA,oBACnB,OAAuB;AACL,+BAAS,mBAAmB,WAAW,WAAW,SAAS,mCAAmC;AAAA,oBAC/F;AAAA,kBACF;AAAA,gBACF;AAAA,cACF;AAID,kBAAI,cAAc,aAAa;AAE/B,kBAAI,gBAAgB,MAAM;AACxB;AACE,sBAAI,aAAa,SAAS,aAAa,eAAe,CAAC,8BAA8B;AACnF,wBAAI,SAAS,UAAU,aAAa,eAAe;AACjD,4BAAM,8MAAkO,0BAA0B,YAAY,KAAK,UAAU;AAAA,oBAC9R;AAED,wBAAI,SAAS,UAAU,aAAa,eAAe;AACjD,4BAAM,8MAAkO,0BAA0B,YAAY,KAAK,UAAU;AAAA,oBAC9R;AAAA,kBACF;AAAA,gBACF;AAKD,kCAAkB,cAAc,aAAa,QAAQ;AAAA,cACtD;AAED;AAAA,YACD;AAAA,YAEH,KAAK,UACH;AAGE,kBAAI,eAAe,aAAa;AAEhC,kBAAI,iBAAiB,MAAM;AACzB,oBAAI,YAAY;AAEhB,oBAAI,aAAa,UAAU,MAAM;AAC/B,0BAAQ,aAAa,MAAM,KAAG;AAAA,oBAC5B,KAAK;AACH,kCAAY,kBAAkB,aAAa,MAAM,SAAS;AAC1D;AAAA,oBAEF,KAAK;AACH,kCAAY,aAAa,MAAM;AAC/B;AAAA,kBACH;AAAA,gBACF;AAED,kCAAkB,cAAc,cAAc,SAAS;AAAA,cACxD;AAED;AAAA,YACD;AAAA,YAEH,KAAK,eACH;AACE,kBAAI,aAAa,aAAa;AAK9B,kBAAIA,aAAY,QAAQ,aAAa,QAAQ,QAAQ;AACnD,oBAAI,OAAO,aAAa;AACxB,oBAAI,QAAQ,aAAa;AACzB,4BAAY,YAAY,MAAM,KAAK;AAAA,cACpC;AAED;AAAA,YACD;AAAA,YAEH,KAAK,UACH;AAEE;AAAA,YACD;AAAA,YAEH,KAAK,YACH;AAEE;AAAA,YACD;AAAA,YAEH,KAAK,UACH;AACE;AACE,oBAAI,yBAAyB,aAAa,eACtC,WAAW,uBAAuB,UAClC,WAAW,uBAAuB;AACtC,oBAAI,iBAAiB,aAAa,UAAU;AAC5C,oBAAIc,cAAa;AACjB,oBAAI,QAAQd,aAAY,OAAO,UAAU;AAEzC;AACE,sBAAI,sBAAqB,GAAI;AAC3B,4BAAQ;AAAA,kBACT;AAAA,gBACF;AAED,oBAAI,OAAO,aAAa,YAAY;AAClC,2BAAS,aAAa,cAAc,IAAI,OAAO,aAAa,gBAAgB,aAAa,kBAAkB,aAAa,iBAAiBc,WAAU;AAAA,gBACpJ;AAED;AACE,sBAAI,OAAO,aAAa,YAAY;AAClC,6BAAS,aAAa,cAAc,IAAI,OAAO,gBAAgBA,WAAU;AAAA,kBAC1E;AAKD,sDAAoC,YAAY;AAGhD,sBAAI,cAAc,aAAa;AAE/B;AAAO,2BAAO,gBAAgB,MAAM;AAClC,8BAAQ,YAAY,KAAG;AAAA,wBACrB,KAAK;AACH,8BAAIb,QAAO,YAAY;AACvB,0BAAAA,MAAK,kBAAkB;AACvB,gCAAM;AAAA,wBAER,KAAK;AACH,8BAAI,kBAAkB,YAAY;AAClC,0CAAgB,kBAAkB;AAClC,gCAAM;AAAA,sBACT;AAED,oCAAc,YAAY;AAAA,oBAC3B;AAAA,gBACF;AAAA,cACF;AAED;AAAA,YACD;AAAA,YAEH,KAAK,mBACH;AACE,+CAAiC,cAAc,YAAY;AAC3D;AAAA,YACD;AAAA,YAEH,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK,wBACH;AACE;AAAA,YACD;AAAA,YAEH;AACE,oBAAM,IAAI,MAAM,0HAA+H;AAAA,UAClJ;AAAA,QACF;AAED,YAAK,CAAC,2BAA2B;AAC/B;AACE,gBAAI,aAAa,QAAQ,KAAK;AAC5B,8BAAgB,YAAY;AAAA,YAC7B;AAAA,UACF;AAAA,QACF;AAAA,MACH;AAEA,eAAS,6BAA6B,MAAM;AAG1C,gBAAQ,KAAK,KAAG;AAAA,UACd,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK,qBACH;AACE,gBAAK,KAAK,OAAO,aAAa;AAC5B,kBAAI;AACF;AACA,0DAA0C,MAAM,KAAK,MAAM;AAAA,cACvE,UAAoB;AACR,2CAA2B,IAAI;AAAA,cAChC;AAAA,YACX,OAAe;AACL,wDAA0C,MAAM,KAAK,MAAM;AAAA,YAC5D;AAED;AAAA,UACD;AAAA,UAEH,KAAK,gBACH;AACE,gBAAI,WAAW,KAAK;AAEpB,gBAAI,OAAO,SAAS,sBAAsB,YAAY;AACpD,0CAA4B,MAAM,KAAK,QAAQ,QAAQ;AAAA,YACxD;AAED,4BAAgB,MAAM,KAAK,MAAM;AACjC;AAAA,UACD;AAAA,UAEH,KAAK,eACH;AACE,4BAAgB,MAAM,KAAK,MAAM;AACjC;AAAA,UACD;AAAA,QACJ;AAAA,MACH;AAEA,eAAS,wBAAwB,cAAc,UAAU;AAEvD,YAAI,kBAAkB;AAEtB;AAGE,cAAI,OAAO;AAEX,iBAAO,MAAM;AACX,gBAAI,KAAK,QAAQ,eAAe;AAC9B,kBAAI,oBAAoB,MAAM;AAC5B,kCAAkB;AAElB,oBAAI;AACF,sBAAI,WAAW,KAAK;AAEpB,sBAAI,UAAU;AACZ,iCAAa,QAAQ;AAAA,kBACnC,OAAmB;AACL,mCAAe,KAAK,WAAW,KAAK,aAAa;AAAA,kBAClD;AAAA,gBACF,SAAQ/G,QAAO;AACd,0CAAwB,cAAc,aAAa,QAAQA,MAAK;AAAA,gBACjE;AAAA,cACF;AAAA,YACT,WAAiB,KAAK,QAAQ,UAAU;AAChC,kBAAI,oBAAoB,MAAM;AAC5B,oBAAI;AACF,sBAAI,aAAa,KAAK;AAEtB,sBAAI,UAAU;AACZ,qCAAiB,UAAU;AAAA,kBACzC,OAAmB;AACL,uCAAmB,YAAY,KAAK,aAAa;AAAA,kBAClD;AAAA,gBACF,SAAQA,QAAO;AACd,0CAAwB,cAAc,aAAa,QAAQA,MAAK;AAAA,gBACjE;AAAA,cACF;AAAA,YACT,YAAkB,KAAK,QAAQ,sBAAsB,KAAK,QAAQ,0BAA0B,KAAK,kBAAkB,QAAQ,SAAS;AAAc;AAAA,qBAAW,KAAK,UAAU,MAAM;AAC1K,mBAAK,MAAM,SAAS;AACpB,qBAAO,KAAK;AACZ;AAAA,YACD;AAED,gBAAI,SAAS,cAAc;AACzB;AAAA,YACD;AAED,mBAAO,KAAK,YAAY,MAAM;AAC5B,kBAAI,KAAK,WAAW,QAAQ,KAAK,WAAW,cAAc;AACxD;AAAA,cACD;AAED,kBAAI,oBAAoB,MAAM;AAC5B,kCAAkB;AAAA,cACnB;AAED,qBAAO,KAAK;AAAA,YACb;AAED,gBAAI,oBAAoB,MAAM;AAC5B,gCAAkB;AAAA,YACnB;AAED,iBAAK,QAAQ,SAAS,KAAK;AAC3B,mBAAO,KAAK;AAAA,UACb;AAAA,QACF;AAAA,MACH;AAEA,eAAS,gBAAgB,cAAc;AACrC,YAAI,MAAM,aAAa;AAEvB,YAAI,QAAQ,MAAM;AAChB,cAAI,WAAW,aAAa;AAC5B,cAAI;AAEJ,kBAAQ,aAAa,KAAG;AAAA,YACtB,KAAK;AACH,8BAAgB,kBAAkB,QAAQ;AAC1C;AAAA,YAEF;AACE,8BAAgB;AAAA,UACnB;AAED,cAAI,OAAO,QAAQ,YAAY;AAC7B,gBAAI;AAEJ,gBAAK,aAAa,OAAO,aAAa;AACpC,kBAAI;AACF;AACA,yBAAS,IAAI,aAAa;AAAA,cACpC,UAAkB;AACR,2CAA2B,YAAY;AAAA,cACxC;AAAA,YACT,OAAa;AACL,uBAAS,IAAI,aAAa;AAAA,YAC3B;AAED;AACE,kBAAI,OAAO,WAAW,YAAY;AAChC,sBAAM,mGAAwG,0BAA0B,YAAY,CAAC;AAAA,cACtJ;AAAA,YACF;AAAA,UACP,OAAW;AACL;AACE,kBAAI,CAAC,IAAI,eAAe,SAAS,GAAG;AAClC,sBAAM,iGAAsG,0BAA0B,YAAY,CAAC;AAAA,cACpJ;AAAA,YACF;AAED,gBAAI,UAAU;AAAA,UACf;AAAA,QACF;AAAA,MACH;AAEA,eAAS,oBAAoB,OAAO;AAiBlC,YAAI,YAAY,MAAM;AAEtB,YAAI,cAAc,MAAM;AACtB,oBAAU,SAAS;AAAA,QACpB;AAED,cAAM,SAAS;AAAA,MACjB;AAEA,eAAS,wBAAwB,OAAO;AACtC,YAAI,YAAY,MAAM;AAEtB,YAAI,cAAc,MAAM;AACtB,gBAAM,YAAY;AAClB,kCAAwB,SAAS;AAAA,QAClC;AAID;AAOE,gBAAM,QAAQ;AACd,gBAAM,YAAY;AAClB,gBAAM,UAAU;AAKhB,cAAI,MAAM,QAAQ,eAAe;AAC/B,gBAAI,eAAe,MAAM;AAEzB,gBAAI,iBAAiB,MAAM;AACzB,oCAAsB,YAAY;AAAA,YACnC;AAAA,UACF;AAED,gBAAM,YAAY;AAMlB;AACE,kBAAM,cAAc;AAAA,UACrB;AAED;AAQE,kBAAM,SAAS;AACf,kBAAM,eAAe;AACrB,kBAAM,gBAAgB;AACtB,kBAAM,gBAAgB;AACtB,kBAAM,eAAe;AACrB,kBAAM,YAAY;AAElB,kBAAM,cAAc;AAAA,UACrB;AAAA,QACF;AAAA,MACH;AAEA,eAAS,mBAAmB,OAAO;AACjC,YAAI,SAAS,MAAM;AAEnB,eAAO,WAAW,MAAM;AACtB,cAAI,aAAa,MAAM,GAAG;AACxB,mBAAO;AAAA,UACR;AAED,mBAAS,OAAO;AAAA,QACjB;AAED,cAAM,IAAI,MAAM,sGAA2G;AAAA,MAC7H;AAEA,eAAS,aAAa,OAAO;AAC3B,eAAO,MAAM,QAAQ,iBAAiB,MAAM,QAAQ,YAAY,MAAM,QAAQ;AAAA,MAChF;AAEA,eAAS,eAAe,OAAO;AAK7B,YAAI,OAAO;AAEX;AAAU,iBAAO,MAAM;AAErB,mBAAO,KAAK,YAAY,MAAM;AAC5B,kBAAI,KAAK,WAAW,QAAQ,aAAa,KAAK,MAAM,GAAG;AAGrD,uBAAO;AAAA,cACR;AAED,qBAAO,KAAK;AAAA,YACb;AAED,iBAAK,QAAQ,SAAS,KAAK;AAC3B,mBAAO,KAAK;AAEZ,mBAAO,KAAK,QAAQ,iBAAiB,KAAK,QAAQ,YAAY,KAAK,QAAQ,oBAAoB;AAG7F,kBAAI,KAAK,QAAQ,WAAW;AAE1B,yBAAS;AAAA,cACV;AAID,kBAAI,KAAK,UAAU,QAAQ,KAAK,QAAQ,YAAY;AAClD,yBAAS;AAAA,cACjB,OAAa;AACL,qBAAK,MAAM,SAAS;AACpB,uBAAO,KAAK;AAAA,cACb;AAAA,YACF;AAGD,gBAAI,EAAE,KAAK,QAAQ,YAAY;AAE7B,qBAAO,KAAK;AAAA,YACb;AAAA,UACF;AAAA,MACH;AAEA,eAAS,gBAAgB,cAAc;AAGrC,YAAI,cAAc,mBAAmB,YAAY;AAEjD,gBAAQ,YAAY,KAAG;AAAA,UACrB,KAAK,eACH;AACE,gBAAI,SAAS,YAAY;AAEzB,gBAAI,YAAY,QAAQ,cAAc;AAEpC,+BAAiB,MAAM;AAEvB,0BAAY,SAAS,CAAC;AAAA,YACvB;AAED,gBAAI,SAAS,eAAe,YAAY;AAGxC,wCAA4B,cAAc,QAAQ,MAAM;AACxD;AAAA,UACD;AAAA,UAEH,KAAK;AAAA,UACL,KAAK,YACH;AACE,gBAAI,UAAU,YAAY,UAAU;AAEpC,gBAAI,UAAU,eAAe,YAAY;AAEzC,qDAAyC,cAAc,SAAS,OAAO;AACvE;AAAA,UACD;AAAA,UAGH;AACE,kBAAM,IAAI,MAAM,iGAAsG;AAAA,QACzH;AAAA,MACH;AAEA,eAAS,yCAAyC,MAAM,QAAQ,QAAQ;AACtE,YAAI,MAAM,KAAK;AACf,YAAI,SAAS,QAAQ,iBAAiB,QAAQ;AAE9C,YAAI,QAAQ;AACV,cAAI,YAAY,KAAK;AAErB,cAAI,QAAQ;AACV,oCAAwB,QAAQ,WAAW,MAAM;AAAA,UACvD,OAAW;AACL,mCAAuB,QAAQ,SAAS;AAAA,UACzC;AAAA,QACL,WAAa,QAAQ;AAAY;AAAA,aAAO;AACpC,cAAI,QAAQ,KAAK;AAEjB,cAAI,UAAU,MAAM;AAClB,qDAAyC,OAAO,QAAQ,MAAM;AAC9D,gBAAI,UAAU,MAAM;AAEpB,mBAAO,YAAY,MAAM;AACvB,uDAAyC,SAAS,QAAQ,MAAM;AAChE,wBAAU,QAAQ;AAAA,YACnB;AAAA,UACF;AAAA,QACF;AAAA,MACH;AAEA,eAAS,4BAA4B,MAAM,QAAQ,QAAQ;AACzD,YAAI,MAAM,KAAK;AACf,YAAI,SAAS,QAAQ,iBAAiB,QAAQ;AAE9C,YAAI,QAAQ;AACV,cAAI,YAAY,KAAK;AAErB,cAAI,QAAQ;AACV,yBAAa,QAAQ,WAAW,MAAM;AAAA,UAC5C,OAAW;AACL,wBAAY,QAAQ,SAAS;AAAA,UAC9B;AAAA,QACL,WAAa,QAAQ;AAAY;AAAA,aAAO;AACpC,cAAI,QAAQ,KAAK;AAEjB,cAAI,UAAU,MAAM;AAClB,wCAA4B,OAAO,QAAQ,MAAM;AACjD,gBAAI,UAAU,MAAM;AAEpB,mBAAO,YAAY,MAAM;AACvB,0CAA4B,SAAS,QAAQ,MAAM;AACnD,wBAAU,QAAQ;AAAA,YACnB;AAAA,UACF;AAAA,QACF;AAAA,MACH;AAMA,UAAI,aAAa;AACjB,UAAI,wBAAwB;AAE5B,eAAS,sBAAsB+G,OAAM,aAAa,cAAc;AAC9D;AAgBE,cAAI,SAAS;AAEb;AAAY,mBAAO,WAAW,MAAM;AAClC,sBAAQ,OAAO,KAAG;AAAA,gBAChB,KAAK,eACH;AACE,+BAAa,OAAO;AACpB,0CAAwB;AACxB,wBAAM;AAAA,gBACP;AAAA,gBAEH,KAAK,UACH;AACE,+BAAa,OAAO,UAAU;AAC9B,0CAAwB;AACxB,wBAAM;AAAA,gBACP;AAAA,gBAEH,KAAK,YACH;AACE,+BAAa,OAAO,UAAU;AAC9B,0CAAwB;AACxB,wBAAM;AAAA,gBACP;AAAA,cACJ;AAED,uBAAS,OAAO;AAAA,YACjB;AAED,cAAI,eAAe,MAAM;AACvB,kBAAM,IAAI,MAAM,sGAA2G;AAAA,UAC5H;AAED,uCAA6BA,OAAM,aAAa,YAAY;AAC5D,uBAAa;AACb,kCAAwB;AAAA,QACzB;AAED,4BAAoB,YAAY;AAAA,MAClC;AAEA,eAAS,mCAAmC,cAAc,wBAAwB,QAAQ;AAExF,YAAI,QAAQ,OAAO;AAEnB,eAAO,UAAU,MAAM;AACrB,uCAA6B,cAAc,wBAAwB,KAAK;AACxE,kBAAQ,MAAM;AAAA,QACf;AAAA,MACH;AAEA,eAAS,6BAA6B,cAAc,wBAAwB,cAAc;AACxF,wBAAgB,YAAY;AAI5B,gBAAQ,aAAa,KAAG;AAAA,UACtB,KAAK,eACH;AACE,gBAAI,CAAC,2BAA2B;AAC9B,8BAAgB,cAAc,sBAAsB;AAAA,YACrD;AAAA,UAEF;AAAA,UAGH,KAAK,UACH;AAIE;AACE,kBAAI,iBAAiB;AACrB,kBAAI,4BAA4B;AAChC,2BAAa;AACb,iDAAmC,cAAc,wBAAwB,YAAY;AACrF,2BAAa;AACb,sCAAwB;AAExB,kBAAI,eAAe,MAAM;AAGvB,oBAAI,uBAAuB;AACzB,2CAAyB,YAAY,aAAa,SAAS;AAAA,gBACzE,OAAmB;AACL,8BAAY,YAAY,aAAa,SAAS;AAAA,gBAC/C;AAAA,cACF;AAAA,YACF;AAED;AAAA,UACD;AAAA,UAEH,KAAK,oBACH;AAIE;AACE,kBAAI,eAAe,MAAM;AACvB,oBAAI,uBAAuB;AACzB,qDAAmC,YAAY,aAAa,SAAS;AAAA,gBACnF,OAAmB;AACL,wCAAsB,YAAY,aAAa,SAAS;AAAA,gBACzD;AAAA,cACF;AAAA,YACF;AAED;AAAA,UACD;AAAA,UAEH,KAAK,YACH;AACE;AAEE,kBAAI,kBAAkB;AACtB,kBAAI,6BAA6B;AACjC,2BAAa,aAAa,UAAU;AACpC,sCAAwB;AACxB,iDAAmC,cAAc,wBAAwB,YAAY;AACrF,2BAAa;AACb,sCAAwB;AAAA,YACzB;AAED;AAAA,UACD;AAAA,UAEH,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK,qBACH;AACE,gBAAI,CAAC,2BAA2B;AAC9B,kBAAI,cAAc,aAAa;AAE/B,kBAAI,gBAAgB,MAAM;AACxB,oBAAI,aAAa,YAAY;AAE7B,oBAAI,eAAe,MAAM;AACvB,sBAAI,cAAc,WAAW;AAC7B,sBAAI,SAAS;AAEb,qBAAG;AACD,wBAAI,UAAU,QACV,UAAU,QAAQ,SAClB,MAAM,QAAQ;AAElB,wBAAI,YAAY,QAAW;AACzB,2BAAK,MAAM,eAAe,WAAW;AACnC,0CAAkB,cAAc,wBAAwB,OAAO;AAAA,sBAChE,YAAW,MAAM,YAAY,WAAW;AACvC;AACE,kEAAwC,YAAY;AAAA,wBACrD;AAED,4BAAK,aAAa,OAAO,aAAa;AACpC;AACA,4CAAkB,cAAc,wBAAwB,OAAO;AAC/D,qDAA2B,YAAY;AAAA,wBAC7D,OAA2B;AACL,4CAAkB,cAAc,wBAAwB,OAAO;AAAA,wBAChE;AAED;AACE;wBACD;AAAA,sBACF;AAAA,oBACF;AAED,6BAAS,OAAO;AAAA,kBAChC,SAAuB,WAAW;AAAA,gBACrB;AAAA,cACF;AAAA,YACF;AAED,+CAAmC,cAAc,wBAAwB,YAAY;AACrF;AAAA,UACD;AAAA,UAEH,KAAK,gBACH;AACE,gBAAI,CAAC,2BAA2B;AAC9B,8BAAgB,cAAc,sBAAsB;AACpD,kBAAI,WAAW,aAAa;AAE5B,kBAAI,OAAO,SAAS,yBAAyB,YAAY;AACvD,+CAA+B,cAAc,wBAAwB,QAAQ;AAAA,cAC9E;AAAA,YACF;AAED,+CAAmC,cAAc,wBAAwB,YAAY;AACrF;AAAA,UACD;AAAA,UAEH,KAAK,gBACH;AAEE,+CAAmC,cAAc,wBAAwB,YAAY;AACrF;AAAA,UACD;AAAA,UAEH,KAAK,oBACH;AACE;AAAA;AAAA,cACC,aAAa,OAAO;AAAA,cAAgB;AAUnC,kBAAI,gCAAgC;AACpC,0CAA4B,iCAAiC,aAAa,kBAAkB;AAC5F,iDAAmC,cAAc,wBAAwB,YAAY;AACrF,0CAA4B;AAAA,YACtC,OAAe;AACL,iDAAmC,cAAc,wBAAwB,YAAY;AAAA,YACtF;AAED;AAAA,UACD;AAAA,UAEH,SACE;AACE,+CAAmC,cAAc,wBAAwB,YAAY;AACrF;AAAA,UACD;AAAA,QACJ;AAAA,MACH;AAEA,eAAS,uBAAuB,cAAc;AAE7B,qBAAa;AAAA,MAC9B;AAEA,eAAS,iCAAiC,cAAc,cAAc;AAEpE,YAAI,WAAW,aAAa;AAE5B,YAAI,aAAa,MAAM;AACrB,cAAID,WAAU,aAAa;AAE3B,cAAIA,aAAY,MAAM;AACpB,gBAAI,YAAYA,SAAQ;AAExB,gBAAI,cAAc,MAAM;AACtB,kBAAI,mBAAmB,UAAU;AAEjC,kBAAI,qBAAqB,MAAM;AAC7B,+CAA+B,gBAAgB;AAAA,cAChD;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACH;AAEA,eAAS,6BAA6B,cAAc;AAIlD,YAAI,YAAY,aAAa;AAE7B,YAAI,cAAc,MAAM;AACtB,uBAAa,cAAc;AAC3B,cAAI,aAAa,aAAa;AAE9B,cAAI,eAAe,MAAM;AACvB,yBAAa,aAAa,YAAY,IAAI,gBAAe;AAAA,UAC1D;AAED,oBAAU,QAAQ,SAAU,UAAU;AAEpC,gBAAI,QAAQ,qBAAqB,KAAK,MAAM,cAAc,QAAQ;AAElE,gBAAI,CAAC,WAAW,IAAI,QAAQ,GAAG;AAC7B,yBAAW,IAAI,QAAQ;AAEvB;AACE,oBAAI,mBAAmB;AACrB,sBAAI,oBAAoB,QAAQ,mBAAmB,MAAM;AAEvD,2CAAuB,gBAAgB,eAAe;AAAA,kBACpE,OAAmB;AACL,0BAAM,MAAM,qEAAqE;AAAA,kBAClF;AAAA,gBACF;AAAA,cACF;AAED,uBAAS,KAAK,OAAO,KAAK;AAAA,YAC3B;AAAA,UACP,CAAK;AAAA,QACF;AAAA,MACH;AACA,eAAS,sBAAsBC,OAAM,cAAc,gBAAgB;AACjE,0BAAkB;AAClB,yBAAiBA;AACjB,wBAAgB,YAAY;AAC5B,qCAA6B,cAAcA,KAAI;AAC/C,wBAAgB,YAAY;AAC5B,0BAAkB;AAClB,yBAAiB;AAAA,MACnB;AAEA,eAAS,mCAAmCA,OAAM,aAAa,OAAO;AAGpE,YAAI,YAAY,YAAY;AAE5B,YAAI,cAAc,MAAM;AACtB,mBAASpH,KAAI,GAAGA,KAAI,UAAU,QAAQA,MAAK;AACzC,gBAAI,gBAAgB,UAAUA,EAAC;AAE/B,gBAAI;AACF,oCAAsBoH,OAAM,aAAa,aAAa;AAAA,YACvD,SAAQ/G,QAAO;AACd,sCAAwB,eAAe,aAAaA,MAAK;AAAA,YAC1D;AAAA,UACF;AAAA,QACF;AAED,YAAI,iBAAiB;AAErB,YAAI,YAAY,eAAe,cAAc;AAC3C,cAAI,QAAQ,YAAY;AAExB,iBAAO,UAAU,MAAM;AACrB,4BAAgB,KAAK;AACrB,yCAA6B,OAAO+G,KAAI;AACxC,oBAAQ,MAAM;AAAA,UACf;AAAA,QACF;AAED,wBAAgB,cAAc;AAAA,MAChC;AAEA,eAAS,6BAA6B,cAAcA,OAAM,OAAO;AAC/D,YAAID,WAAU,aAAa;AAC3B,YAAI,QAAQ,aAAa;AAIzB,gBAAQ,aAAa,KAAG;AAAA,UACtB,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK,qBACH;AACE,+CAAmCC,OAAM,YAAY;AACrD,wCAA4B,YAAY;AAExC,gBAAI,QAAQ,QAAQ;AAClB,kBAAI;AACF,4CAA4B,YAAY,WAAW,cAAc,aAAa,MAAM;AACpF,0CAA0B,YAAY,WAAW,YAAY;AAAA,cAC9D,SAAQ/G,QAAO;AACd,wCAAwB,cAAc,aAAa,QAAQA,MAAK;AAAA,cACjE;AAOD,kBAAK,aAAa,OAAO,aAAa;AACpC,oBAAI;AACF;AACA,8CAA4B,SAAS,WAAW,cAAc,aAAa,MAAM;AAAA,gBAClF,SAAQA,QAAO;AACd,0CAAwB,cAAc,aAAa,QAAQA,MAAK;AAAA,gBACjE;AAED,2CAA2B,YAAY;AAAA,cACnD,OAAiB;AACL,oBAAI;AACF,8CAA4B,SAAS,WAAW,cAAc,aAAa,MAAM;AAAA,gBAClF,SAAQA,QAAO;AACd,0CAAwB,cAAc,aAAa,QAAQA,MAAK;AAAA,gBACjE;AAAA,cACF;AAAA,YACF;AAED;AAAA,UACD;AAAA,UAEH,KAAK,gBACH;AACE,+CAAmC+G,OAAM,YAAY;AACrD,wCAA4B,YAAY;AAExC,gBAAI,QAAQ,KAAK;AACf,kBAAID,aAAY,MAAM;AACpB,gCAAgBA,UAASA,SAAQ,MAAM;AAAA,cACxC;AAAA,YACF;AAED;AAAA,UACD;AAAA,UAEH,KAAK,eACH;AACE,+CAAmCC,OAAM,YAAY;AACrD,wCAA4B,YAAY;AAExC,gBAAI,QAAQ,KAAK;AACf,kBAAID,aAAY,MAAM;AACpB,gCAAgBA,UAASA,SAAQ,MAAM;AAAA,cACxC;AAAA,YACF;AAED;AAOE,kBAAI,aAAa,QAAQ,cAAc;AACrC,oBAAI,WAAW,aAAa;AAE5B,oBAAI;AACF,mCAAiB,QAAQ;AAAA,gBAC1B,SAAQ9G,QAAO;AACd,0CAAwB,cAAc,aAAa,QAAQA,MAAK;AAAA,gBACjE;AAAA,cACF;AAED,kBAAI,QAAQ,QAAQ;AAClB,oBAAI,aAAa,aAAa;AAE9B,oBAAI,cAAc,MAAM;AAEtB,sBAAI,WAAW,aAAa;AAI5B,sBAAI,WAAW8G,aAAY,OAAOA,SAAQ,gBAAgB;AAC1D,sBAAI,OAAO,aAAa;AAExB,sBAAI,gBAAgB,aAAa;AACjC,+BAAa,cAAc;AAE3B,sBAAI,kBAAkB,MAAM;AAC1B,wBAAI;AACF,mCAAa,YAAY,eAAe,MAAM,UAAU,UAAU,YAAY;AAAA,oBAC/E,SAAQ9G,QAAO;AACd,8CAAwB,cAAc,aAAa,QAAQA,MAAK;AAAA,oBACjE;AAAA,kBACF;AAAA,gBACF;AAAA,cACF;AAAA,YACF;AAED;AAAA,UACD;AAAA,UAEH,KAAK,UACH;AACE,+CAAmC+G,OAAM,YAAY;AACrD,wCAA4B,YAAY;AAExC,gBAAI,QAAQ,QAAQ;AAClB;AACE,oBAAI,aAAa,cAAc,MAAM;AACnC,wBAAM,IAAI,MAAM,gHAAqH;AAAA,gBACtI;AAED,oBAAI,eAAe,aAAa;AAChC,oBAAI,UAAU,aAAa;AAI3B,oBAAI,UAAUD,aAAY,OAAOA,SAAQ,gBAAgB;AAEzD,oBAAI;AACF,mCAAiB,cAAc,SAAS,OAAO;AAAA,gBAChD,SAAQ9G,QAAO;AACd,0CAAwB,cAAc,aAAa,QAAQA,MAAK;AAAA,gBACjE;AAAA,cACF;AAAA,YACF;AAED;AAAA,UACD;AAAA,UAEH,KAAK,UACH;AACE,+CAAmC+G,OAAM,YAAY;AACrD,wCAA4B,YAAY;AAExC,gBAAI,QAAQ,QAAQ;AAClB;AACE,oBAAID,aAAY,MAAM;AACpB,sBAAI,gBAAgBA,SAAQ;AAE5B,sBAAI,cAAc,cAAc;AAC9B,wBAAI;AACF,8CAAwBC,MAAK,aAAa;AAAA,oBAC3C,SAAQ/G,QAAO;AACd,8CAAwB,cAAc,aAAa,QAAQA,MAAK;AAAA,oBACjE;AAAA,kBACF;AAAA,gBACF;AAAA,cACF;AAAA,YACF;AAED;AAAA,UACD;AAAA,UAEH,KAAK,YACH;AACE,+CAAmC+G,OAAM,YAAY;AACrD,wCAA4B,YAAY;AAExC;AAAA,UACD;AAAA,UAEH,KAAK,mBACH;AACE,+CAAmCA,OAAM,YAAY;AACrD,wCAA4B,YAAY;AACxC,gBAAI,iBAAiB,aAAa;AAElC,gBAAI,eAAe,QAAQ,YAAY;AACrC,kBAAI,oBAAoB,eAAe;AACvC,kBAAI,WAAW,eAAe;AAC9B,kBAAI,WAAW,aAAa;AAG5B,gCAAkB,WAAW;AAE7B,kBAAI,UAAU;AACZ,oBAAI,YAAY,eAAe,cAAc,QAAQ,eAAe,UAAU,kBAAkB;AAEhG,oBAAI,CAAC,WAAW;AAEd;gBACD;AAAA,cACF;AAAA,YACF;AAED,gBAAI,QAAQ,QAAQ;AAClB,kBAAI;AACF,uCAAuB,YAAY;AAAA,cACpC,SAAQ/G,QAAO;AACd,wCAAwB,cAAc,aAAa,QAAQA,MAAK;AAAA,cACjE;AAED,2CAA6B,YAAY;AAAA,YAC1C;AAED;AAAA,UACD;AAAA,UAEH,KAAK,oBACH;AACE,gBAAI,aAAa8G,aAAY,QAAQA,SAAQ,kBAAkB;AAE/D;AAAA;AAAA,cACC,aAAa,OAAO;AAAA,cAAgB;AAInC,kBAAI,gCAAgC;AACpC,0CAA4B,iCAAiC;AAC7D,iDAAmCC,OAAM,YAAY;AACrD,0CAA4B;AAAA,YACtC,OAAe;AACL,iDAAmCA,OAAM,YAAY;AAAA,YACtD;AAED,wCAA4B,YAAY;AAExC,gBAAI,QAAQ,YAAY;AACtB,kBAAI,qBAAqB,aAAa;AACtC,kBAAI,YAAY,aAAa;AAE7B,kBAAI,YAAY,cAAc;AAE9B,kBAAI,oBAAoB;AAGxB,iCAAmB,WAAW;AAE9B;AACE,oBAAI,WAAW;AACb,sBAAI,CAAC,YAAY;AACf,yBAAK,kBAAkB,OAAO,oBAAoB,QAAQ;AACxD,mCAAa;AACb,0BAAI,iBAAiB,kBAAkB;AAEvC,6BAAO,mBAAmB,MAAM;AAC9B,qCAAa;AACb,qDAA6B,cAAc;AAC3C,yCAAiB,eAAe;AAAA,sBACjC;AAAA,oBACF;AAAA,kBACF;AAAA,gBACF;AAAA,cACF;AAED;AAGE,wCAAwB,mBAAmB,SAAS;AAAA,cACrD;AAAA,YACF;AAED;AAAA,UACD;AAAA,UAEH,KAAK,uBACH;AACE,+CAAmCA,OAAM,YAAY;AACrD,wCAA4B,YAAY;AAExC,gBAAI,QAAQ,QAAQ;AAClB,2CAA6B,YAAY;AAAA,YAC1C;AAED;AAAA,UACD;AAAA,UAEH,KAAK,gBACH;AAEE;AAAA,UACD;AAAA,UAEH,SACE;AACE,+CAAmCA,OAAM,YAAY;AACrD,wCAA4B,YAAY;AACxC;AAAA,UACD;AAAA,QACJ;AAAA,MACH;AAEA,eAAS,4BAA4B,cAAc;AAIjD,YAAI,QAAQ,aAAa;AAEzB,YAAI,QAAQ,WAAW;AACrB,cAAI;AACF,4BAAgB,YAAY;AAAA,UAC7B,SAAQ/G,QAAO;AACd,oCAAwB,cAAc,aAAa,QAAQA,MAAK;AAAA,UACjE;AAMD,uBAAa,SAAS,CAAC;AAAA,QACxB;AAED,YAAI,QAAQ,WAAW;AACrB,uBAAa,SAAS,CAAC;AAAA,QACxB;AAAA,MACH;AAEA,eAAS,oBAAoB,cAAc+G,OAAM,gBAAgB;AAC/D,0BAAkB;AAClB,yBAAiBA;AACjB,qBAAa;AACb,kCAA0B,cAAcA,OAAM,cAAc;AAC5D,0BAAkB;AAClB,yBAAiB;AAAA,MACnB;AAEA,eAAS,0BAA0B,aAAaA,OAAM,gBAAgB;AAEpE,YAAI,gBAAgB,YAAY,OAAO,oBAAoB;AAE3D,eAAO,eAAe,MAAM;AAC1B,cAAI,QAAQ;AACZ,cAAI,aAAa,MAAM;AAEvB,cAAK,MAAM,QAAQ,sBAAsB,cAAc;AAErD,gBAAI,WAAW,MAAM,kBAAkB;AACvC,gBAAI,8BAA8B,YAAY;AAE9C,gBAAI,6BAA6B;AAE/B,gDAAkC,aAAaA,OAAM,cAAc;AACnE;AAAA,YACR,OAAa;AAEL,kBAAID,WAAU,MAAM;AACpB,kBAAI,YAAYA,aAAY,QAAQA,SAAQ,kBAAkB;AAC9D,kBAAI,+BAA+B,aAAa;AAChD,kBAAI,+BAA+B;AACnC,kBAAI,gCAAgC;AAEpC,yCAA2B;AAC3B,0CAA4B;AAE5B,kBAAI,6BAA6B,CAAC,+BAA+B;AAG/D,6BAAa;AACb,4CAA4B,KAAK;AAAA,cAClC;AAED,kBAAI,QAAQ;AAEZ,qBAAO,UAAU,MAAM;AACrB,6BAAa;AACb;AAAA,kBAA0B;AAAA;AAAA,kBAC1BC;AAAA,kBAAM;AAAA,gBAAc;AACpB,wBAAQ,MAAM;AAAA,cACf;AAGD,2BAAa;AACb,yCAA2B;AAC3B,0CAA4B;AAC5B,gDAAkC,aAAaA,OAAM,cAAc;AACnE;AAAA,YACD;AAAA,UACF;AAED,eAAK,MAAM,eAAe,gBAAgB,WAAW,eAAe,MAAM;AACxE,uBAAW,SAAS;AACpB,yBAAa;AAAA,UACnB,OAAW;AACL,8CAAkC,aAAaA,OAAM,cAAc;AAAA,UACpE;AAAA,QACF;AAAA,MACH;AAEA,eAAS,kCAAkC,aAAaA,OAAM,gBAAgB;AAC5E,eAAO,eAAe,MAAM;AAC1B,cAAI,QAAQ;AAEZ,eAAK,MAAM,QAAQ,gBAAgB,SAAS;AAC1C,gBAAID,WAAU,MAAM;AACpB,4BAAgB,KAAK;AAErB,gBAAI;AACF,wCAA0BC,OAAMD,UAAS,OAAO,cAAc;AAAA,YAC/D,SAAQ9G,QAAO;AACd,sCAAwB,OAAO,MAAM,QAAQA,MAAK;AAAA,YACnD;AAED;UACD;AAED,cAAI,UAAU,aAAa;AACzB,yBAAa;AACb;AAAA,UACD;AAED,cAAI,UAAU,MAAM;AAEpB,cAAI,YAAY,MAAM;AACpB,oBAAQ,SAAS,MAAM;AACvB,yBAAa;AACb;AAAA,UACD;AAED,uBAAa,MAAM;AAAA,QACpB;AAAA,MACH;AAEA,eAAS,6BAA6B,aAAa;AACjD,eAAO,eAAe,MAAM;AAC1B,cAAI,QAAQ;AACZ,cAAI,aAAa,MAAM;AAEvB,kBAAQ,MAAM,KAAG;AAAA,YACf,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK,qBACH;AACE,kBAAK,MAAM,OAAO,aAAa;AAC7B,oBAAI;AACF;AACA,8CAA4B,QAAQ,OAAO,MAAM,MAAM;AAAA,gBACrE,UAAsB;AACR,6CAA2B,KAAK;AAAA,gBACjC;AAAA,cACb,OAAiB;AACL,4CAA4B,QAAQ,OAAO,MAAM,MAAM;AAAA,cACxD;AAED;AAAA,YACD;AAAA,YAEH,KAAK,gBACH;AAEE,8BAAgB,OAAO,MAAM,MAAM;AACnC,kBAAI,WAAW,MAAM;AAErB,kBAAI,OAAO,SAAS,yBAAyB,YAAY;AACvD,+CAA+B,OAAO,MAAM,QAAQ,QAAQ;AAAA,cAC7D;AAED;AAAA,YACD;AAAA,YAEH,KAAK,eACH;AACE,8BAAgB,OAAO,MAAM,MAAM;AACnC;AAAA,YACD;AAAA,YAEH,KAAK,oBACH;AAEE,kBAAI,WAAW,MAAM,kBAAkB;AAEvC,kBAAI,UAAU;AAGZ,gDAAgC,WAAW;AAC3C;AAAA,cACD;AAED;AAAA,YACD;AAAA,UACJ;AAGD,cAAI,eAAe,MAAM;AACvB,uBAAW,SAAS;AACpB,yBAAa;AAAA,UACnB,OAAW;AACL,4CAAgC,WAAW;AAAA,UAC5C;AAAA,QACF;AAAA,MACH;AAEA,eAAS,gCAAgC,aAAa;AACpD,eAAO,eAAe,MAAM;AAC1B,cAAI,QAAQ;AAEZ,cAAI,UAAU,aAAa;AACzB,yBAAa;AACb;AAAA,UACD;AAED,cAAI,UAAU,MAAM;AAEpB,cAAI,YAAY,MAAM;AACpB,oBAAQ,SAAS,MAAM;AACvB,yBAAa;AACb;AAAA,UACD;AAED,uBAAa,MAAM;AAAA,QACpB;AAAA,MACH;AAEA,eAAS,4BAA4B,aAAa;AAChD,eAAO,eAAe,MAAM;AAC1B,cAAI,QAAQ;AACZ,cAAI,aAAa,MAAM;AAEvB,cAAI,MAAM,QAAQ,oBAAoB;AACpC,gBAAI,WAAW,MAAM,kBAAkB;AAEvC,gBAAI,UAAU;AAEZ,6CAA+B,WAAW;AAC1C;AAAA,YACD;AAAA,UACF;AAGD,cAAI,eAAe,MAAM;AAGvB,uBAAW,SAAS;AACpB,yBAAa;AAAA,UACnB,OAAW;AACL,2CAA+B,WAAW;AAAA,UAC3C;AAAA,QACF;AAAA,MACH;AAEA,eAAS,+BAA+B,aAAa;AACnD,eAAO,eAAe,MAAM;AAC1B,cAAI,QAAQ;AAEZ,0BAAgB,KAAK;AAErB,cAAI;AACF,yCAA6B,KAAK;AAAA,UACnC,SAAQA,QAAO;AACd,oCAAwB,OAAO,MAAM,QAAQA,MAAK;AAAA,UACnD;AAED;AAEA,cAAI,UAAU,aAAa;AACzB,yBAAa;AACb;AAAA,UACD;AAED,cAAI,UAAU,MAAM;AAEpB,cAAI,YAAY,MAAM;AAGpB,oBAAQ,SAAS,MAAM;AACvB,yBAAa;AACb;AAAA,UACD;AAED,uBAAa,MAAM;AAAA,QACpB;AAAA,MACH;AAEA,eAAS,0BAA0B+G,OAAM,cAAc,gBAAgB,sBAAsB;AAC3F,qBAAa;AACb,wCAAgC,cAAcA,OAAM,gBAAgB,oBAAoB;AAAA,MAC1F;AAEA,eAAS,gCAAgC,aAAaA,OAAM,gBAAgB,sBAAsB;AAChG,eAAO,eAAe,MAAM;AAC1B,cAAI,QAAQ;AACZ,cAAI,aAAa,MAAM;AAEvB,eAAK,MAAM,eAAe,iBAAiB,WAAW,eAAe,MAAM;AACzE,uBAAW,SAAS;AACpB,yBAAa;AAAA,UACnB,OAAW;AACL,+CAAmC,aAAaA,OAAM,gBAAgB,oBAAoB;AAAA,UAC3F;AAAA,QACF;AAAA,MACH;AAEA,eAAS,mCAAmC,aAAaA,OAAM,gBAAgB,sBAAsB;AACnG,eAAO,eAAe,MAAM;AAC1B,cAAI,QAAQ;AAEZ,eAAK,MAAM,QAAQ,aAAa,SAAS;AACvC,4BAAgB,KAAK;AAErB,gBAAI;AACF,wCAA0BA,OAAM,OAAO,gBAAgB,oBAAoB;AAAA,YAC5E,SAAQ/G,QAAO;AACd,sCAAwB,OAAO,MAAM,QAAQA,MAAK;AAAA,YACnD;AAED;UACD;AAED,cAAI,UAAU,aAAa;AACzB,yBAAa;AACb;AAAA,UACD;AAED,cAAI,UAAU,MAAM;AAEpB,cAAI,YAAY,MAAM;AACpB,oBAAQ,SAAS,MAAM;AACvB,yBAAa;AACb;AAAA,UACD;AAED,uBAAa,MAAM;AAAA,QACpB;AAAA,MACH;AAEA,eAAS,0BAA0B,cAAc,cAAc,gBAAgB,sBAAsB;AACnG,gBAAQ,aAAa,KAAG;AAAA,UACtB,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK,qBACH;AACE,gBAAK,aAAa,OAAO,aAAa;AACpC;AAEA,kBAAI;AACF,0CAA0B,YAAY,WAAW,YAAY;AAAA,cACzE,UAAoB;AACR,4CAA4B,YAAY;AAAA,cACzC;AAAA,YACX,OAAe;AACL,wCAA0B,YAAY,WAAW,YAAY;AAAA,YAC9D;AAED;AAAA,UACD;AAAA,QACJ;AAAA,MACH;AAEA,eAAS,4BAA4B,YAAY;AAC/C,qBAAa;AACb;MACF;AAEA,eAAS,oCAAoC;AAC3C,eAAO,eAAe,MAAM;AAC1B,cAAI,QAAQ;AACZ,cAAI,QAAQ,MAAM;AAElB,eAAK,WAAW,QAAQ,mBAAmB,SAAS;AAClD,gBAAI,YAAY,MAAM;AAEtB,gBAAI,cAAc,MAAM;AACtB,uBAASL,KAAI,GAAGA,KAAI,UAAU,QAAQA,MAAK;AACzC,oBAAI,gBAAgB,UAAUA,EAAC;AAC/B,6BAAa;AACb,qEAAqD,eAAe,KAAK;AAAA,cAC1E;AAED;AAYE,oBAAI,gBAAgB,MAAM;AAE1B,oBAAI,kBAAkB,MAAM;AAC1B,sBAAI,gBAAgB,cAAc;AAElC,sBAAI,kBAAkB,MAAM;AAC1B,kCAAc,QAAQ;AAEtB,uBAAG;AACD,0BAAI,kBAAkB,cAAc;AACpC,oCAAc,UAAU;AACxB,sCAAgB;AAAA,oBAChC,SAAuB,kBAAkB;AAAA,kBAC5B;AAAA,gBACF;AAAA,cACF;AAED,2BAAa;AAAA,YACd;AAAA,UACF;AAED,eAAK,MAAM,eAAe,iBAAiB,WAAW,UAAU,MAAM;AACpE,kBAAM,SAAS;AACf,yBAAa;AAAA,UACnB,OAAW;AACL;UACD;AAAA,QACF;AAAA,MACH;AAEA,eAAS,uCAAuC;AAC9C,eAAO,eAAe,MAAM;AAC1B,cAAI,QAAQ;AAEZ,eAAK,MAAM,QAAQ,aAAa,SAAS;AACvC,4BAAgB,KAAK;AACrB,wCAA4B,KAAK;AACjC;UACD;AAED,cAAI,UAAU,MAAM;AAEpB,cAAI,YAAY,MAAM;AACpB,oBAAQ,SAAS,MAAM;AACvB,yBAAa;AACb;AAAA,UACD;AAED,uBAAa,MAAM;AAAA,QACpB;AAAA,MACH;AAEA,eAAS,4BAA4B,cAAc;AACjD,gBAAQ,aAAa,KAAG;AAAA,UACtB,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK,qBACH;AACE,gBAAK,aAAa,OAAO,aAAa;AACpC;AACA,0CAA4B,YAAY,WAAW,cAAc,aAAa,MAAM;AACpF,0CAA4B,YAAY;AAAA,YAClD,OAAe;AACL,0CAA4B,YAAY,WAAW,cAAc,aAAa,MAAM;AAAA,YACrF;AAED;AAAA,UACD;AAAA,QACJ;AAAA,MACH;AAEA,eAAS,qDAAqD,oBAAoB,wBAAwB;AACxG,eAAO,eAAe,MAAM;AAC1B,cAAI,QAAQ;AAGZ,0BAAgB,KAAK;AACrB,uDAA6C,OAAO,sBAAsB;AAC1E;AACA,cAAI,QAAQ,MAAM;AAGlB,cAAI,UAAU,MAAM;AAClB,kBAAM,SAAS;AACf,yBAAa;AAAA,UACnB,OAAW;AACL,oEAAwD,kBAAkB;AAAA,UAC3E;AAAA,QACF;AAAA,MACH;AAEA,eAAS,wDAAwD,oBAAoB;AACnF,eAAO,eAAe,MAAM;AAC1B,cAAI,QAAQ;AACZ,cAAI,UAAU,MAAM;AACpB,cAAI,cAAc,MAAM;AAExB;AAIE,oCAAwB,KAAK;AAE7B,gBAAI,UAAU,oBAAoB;AAChC,2BAAa;AACb;AAAA,YACD;AAAA,UACF;AAED,cAAI,YAAY,MAAM;AACpB,oBAAQ,SAAS;AACjB,yBAAa;AACb;AAAA,UACD;AAED,uBAAa;AAAA,QACd;AAAA,MACH;AAEA,eAAS,6CAA6CmH,UAAS,wBAAwB;AACrF,gBAAQA,SAAQ,KAAG;AAAA,UACjB,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK,qBACH;AACE,gBAAKA,SAAQ,OAAO,aAAa;AAC/B;AACA,0CAA4B,WAAWA,UAAS,sBAAsB;AACtE,0CAA4BA,QAAO;AAAA,YAC7C,OAAe;AACL,0CAA4B,WAAWA,UAAS,sBAAsB;AAAA,YACvE;AAED;AAAA,UACD;AAAA,QACJ;AAAA,MACH;AAGA,eAAS,6BAA6B,OAAO;AAC3C;AAGE,kBAAQ,MAAM,KAAG;AAAA,YACf,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK,qBACH;AACE,kBAAI;AACF,0CAA0B,SAAS,WAAW,KAAK;AAAA,cACpD,SAAQ9G,QAAO;AACd,wCAAwB,OAAO,MAAM,QAAQA,MAAK;AAAA,cACnD;AAED;AAAA,YACD;AAAA,YAEH,KAAK,gBACH;AACE,kBAAI,WAAW,MAAM;AAErB,kBAAI;AACF,yBAAS,kBAAiB;AAAA,cAC3B,SAAQA,QAAO;AACd,wCAAwB,OAAO,MAAM,QAAQA,MAAK;AAAA,cACnD;AAED;AAAA,YACD;AAAA,UACJ;AAAA,QACF;AAAA,MACH;AAEA,eAAS,8BAA8B,OAAO;AAC5C;AAGE,kBAAQ,MAAM,KAAG;AAAA,YACf,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK,qBACH;AACE,kBAAI;AACF,0CAA0B,YAAY,WAAW,KAAK;AAAA,cACvD,SAAQA,QAAO;AACd,wCAAwB,OAAO,MAAM,QAAQA,MAAK;AAAA,cACnD;AAED;AAAA,YACD;AAAA,UACJ;AAAA,QACF;AAAA,MACH;AAEA,eAAS,+BAA+B,OAAO;AAC7C;AAGE,kBAAQ,MAAM,KAAG;AAAA,YACf,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK,qBACH;AACE,kBAAI;AACF,4CAA4B,SAAS,WAAW,OAAO,MAAM,MAAM;AAAA,cACpE,SAAQA,QAAO;AACd,wCAAwB,OAAO,MAAM,QAAQA,MAAK;AAAA,cACnD;AAED;AAAA,YACD;AAAA,YAEH,KAAK,gBACH;AACE,kBAAI,WAAW,MAAM;AAErB,kBAAI,OAAO,SAAS,yBAAyB,YAAY;AACvD,+CAA+B,OAAO,MAAM,QAAQ,QAAQ;AAAA,cAC7D;AAED;AAAA,YACD;AAAA,UACJ;AAAA,QACF;AAAA,MACH;AAEA,eAAS,gCAAgC,OAAO;AAC9C;AAGE,kBAAQ,MAAM,KAAG;AAAA,YACf,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK,qBACH;AACE,kBAAI;AACF,4CAA4B,YAAY,WAAW,OAAO,MAAM,MAAM;AAAA,cACvE,SAAQA,QAAO;AACd,wCAAwB,OAAO,MAAM,QAAQA,MAAK;AAAA,cACnD;AAAA,YACF;AAAA,UACJ;AAAA,QACF;AAAA,MACH;AAQA,UAAI,OAAO,WAAW,cAAc,OAAO,KAAK;AAC9C,YAAI,YAAY,OAAO;AACN,kBAAU,oBAAoB;AACvB,kBAAU,2BAA2B;AACjD,kBAAU,eAAe;AACpB,kBAAU,kBAAkB;AACjC,kBAAU,eAAe;AAAA,MACvC;AACA,UAAI,cAAc,CAAA;AAClB,eAAS,iBAAiB;AACxB;AACE,sBAAY,QAAQ,SAAU,YAAY;AACxC,mBAAO,WAAU;AAAA,UACvB,CAAK;AAAA,QACF;AAAA,MACH;AAEA,UAAI,uBAAuB,qBAAqB;AAChD,eAAS,uBAAuB,OAAO;AACrC;AAKE,cAAI;AAAA;AAAA,YACJ,OAAO,6BAA6B,cAAc,2BAA2B;AAAA;AAE7E,cAAI,gBAAgB,OAAO,SAAS;AACpC,iBAAQ,iBAAiB,gCAAgC;AAAA,QAC1D;AAAA,MACH;AACA,eAAS,6BAA6B;AACpC;AACE,cAAI;AAAA;AAAA,YACJ,OAAO,6BAA6B,cAAc,2BAA2B;AAAA;AAE7E,cAAI,CAAC,+BAA+B,qBAAqB,YAAY,MAAM;AAEzE,kBAAM,uEAA4E;AAAA,UACnF;AAED,iBAAO;AAAA,QACR;AAAA,MACH;AAEA,UAAI,OAAO,KAAK;AAChB,UAAI,2BAA2B,qBAAqB,wBAChD,sBAAsB,qBAAqB,mBAC3C,4BAA4B,qBAAqB,yBACjD,yBAAyB,qBAAqB;AAClD,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI;AAAA;AAAA,QAEJ;AAAA;AACA,UAAI,iBAAiB;AACrB,UAAI,mBAAmB;AACvB,UAAI,cAAc;AAClB,UAAI,gBAAgB;AACpB,UAAI,yBAAyB;AAC7B,UAAI,gBAAgB;AACpB,UAAI,qBAAqB;AAEzB,UAAI,mBAAmB;AAEvB,UAAI,qBAAqB;AAEzB,UAAI,iBAAiB;AAErB,UAAI,gCAAgC;AASpC,UAAI,qBAAqB;AACzB,UAAI,2BAA2B,aAAa,OAAO;AAEnD,UAAI,+BAA+B;AAEnC,UAAI,+BAA+B;AAQnC,UAAI,iCAAiC;AAErC,UAAI,4CAA4C;AAEhD,UAAI,gCAAgC;AAEpC,UAAI,qCAAqC;AAGzC,UAAI,sCAAsC;AAG1C,UAAI,+BAA+B;AACnC,UAAI,uBAAuB;AAG3B,UAAI,qCAAqC;AAGzC,UAAI,oBAAoB;AACxB,UAAI,4BAA4B;AAEhC,eAAS,mBAAmB;AAC1B,6CAAqC,IAAK,IAAG;AAAA,MAC/C;AAEA,eAAS,sBAAsB;AAC7B,eAAO;AAAA,MACT;AACA,UAAI,mBAAmB;AACvB,UAAI,qBAAqB;AACzB,UAAI,yCAAyC;AAC7C,UAAI,6BAA6B;AACjC,UAAI,gCAAgC;AACpC,UAAI,6BAA6B;AACjC,UAAI,gCAAgC,CAAA;AACpC,UAAI,4BAA4B;AAEhC,UAAI,sBAAsB;AAC1B,UAAI,oBAAoB;AACxB,UAAI,wBAAwB;AAC5B,UAAI,2BAA2B;AAC/B,UAAI,wCAAwC;AAC5C,UAAI,8BAA8B;AAClC,UAAI,2BAA2B;AAC/B,UAAI,+BAA+B;AAInC,UAAI,mBAAmB;AACvB,UAAI,6BAA6B;AACjC,UAAI,2BAA2B;AAC/B,eAAS,wBAAwB;AAC/B,eAAO;AAAA,MACT;AACA,eAAS,mBAAmB;AAC1B,aAAK,oBAAoB,gBAAgB,oBAAoB,WAAW;AAEtE,iBAAO,IAAG;AAAA,QACX;AAGD,YAAI,qBAAqB,aAAa;AAEpC,iBAAO;AAAA,QACR;AAGD,2BAAmB,IAAG;AACtB,eAAO;AAAA,MACT;AACA,eAAS,kBAAkB,OAAO;AAEhC,YAAI,OAAO,MAAM;AAEjB,aAAK,OAAO,oBAAoB,QAAQ;AACtC,iBAAO;AAAA,QACX,YAAe,mBAAmB,mBAAmB,aAAa,kCAAkC,SAAS;AAUzG,iBAAO,kBAAkB,6BAA6B;AAAA,QACvD;AAED,YAAI,eAAe,yBAA0B,MAAK;AAElD,YAAI,cAAc;AAChB,cAAK,0BAA0B,eAAe,MAAM;AAClD,gBAAI,aAAa,0BAA0B;AAE3C,gBAAI,CAAC,WAAW,gBAAgB;AAC9B,yBAAW,iBAAiB,oBAAI;YACjC;AAED,uBAAW,eAAe,IAAI,KAAK;AAAA,UACpC;AASD,cAAI,+BAA+B,QAAQ;AAEzC,yCAA6B,wBAAuB;AAAA,UACrD;AAED,iBAAO;AAAA,QACR;AAQD,YAAI,aAAa;AAEjB,YAAI,eAAe,QAAQ;AACzB,iBAAO;AAAA,QACR;AAQD,YAAI,YAAY;AAChB,eAAO;AAAA,MACT;AAEA,eAAS,iBAAiB,OAAO;AAK/B,YAAI,OAAO,MAAM;AAEjB,aAAK,OAAO,oBAAoB,QAAQ;AACtC,iBAAO;AAAA,QACR;AAED,eAAO,mBAAkB;AAAA,MAC3B;AAEA,eAAS,sBAAsB+G,OAAM,OAAO,MAAM,WAAW;AAC3D;AAEA;AACE,cAAI,0BAA0B;AAC5B,kBAAM,+CAA+C;AAAA,UACtD;AAAA,QACF;AAED;AACE,cAAI,0BAA0B;AAC5B,oDAAwC;AAAA,UACzC;AAAA,QACF;AAGD,wBAAgBA,OAAM,MAAM,SAAS;AAErC,aAAK,mBAAmB,mBAAmB,WAAWA,UAAS,oBAAoB;AAMjF,2CAAiC,KAAK;AAAA,QAC1C,OAAS;AAGL;AACE,gBAAI,mBAAmB;AACrB,iCAAmBA,OAAM,OAAO,IAAI;AAAA,YACrC;AAAA,UACF;AAED,4CAAkC,KAAK;AAEvC,cAAIA,UAAS,oBAAoB;AAM/B,iBAAM,mBAAmB,mBAAmB,WAAW;AACrD,0DAA4C,WAAW,2CAA2C,IAAI;AAAA,YACvG;AAED,gBAAI,iCAAiC,wBAAwB;AAO3D,kCAAoBA,OAAM,6BAA6B;AAAA,YACxD;AAAA,UACF;AAED,gCAAsBA,OAAM,SAAS;AAErC,cAAI,SAAS,YAAY,qBAAqB,cAAc,MAAM,OAAO,oBAAoB;AAAA,UAC7F,CAAG,uBAAuB,kBAAmB;AAM3C;AACA;UACD;AAAA,QACF;AAAA,MACH;AACA,eAAS,+BAA+BA,OAAM,MAAM,WAAW;AAU7D,YAAID,WAAUC,MAAK;AACnB,QAAAD,SAAQ,QAAQ;AAChB,wBAAgBC,OAAM,MAAM,SAAS;AACrC,8BAAsBA,OAAM,SAAS;AAAA,MACvC;AACA,eAAS,+BAA+B,OAAO;AAG7C;AAAA;AAAA;AAAA,WAEI,mBAAmB,mBAAmB;AAAA;AAAA,MAE5C;AAMA,eAAS,sBAAsBA,OAAM,aAAa;AAChD,YAAI,uBAAuBA,MAAK;AAGhC,kCAA0BA,OAAM,WAAW;AAE3C,YAAI,YAAY,aAAaA,OAAMA,UAAS,qBAAqB,gCAAgC,OAAO;AAExG,YAAI,cAAc,SAAS;AAEzB,cAAI,yBAAyB,MAAM;AACjC,6BAAiB,oBAAoB;AAAA,UACtC;AAED,UAAAA,MAAK,eAAe;AACpB,UAAAA,MAAK,mBAAmB;AACxB;AAAA,QACD;AAGD,YAAI,sBAAsB,uBAAuB,SAAS;AAE1D,YAAI,2BAA2BA,MAAK;AAEpC,YAAI,6BAA6B;AAAA;AAAA;AAAA,QAGjC,EAAG,uBAAuB,YAAY,QAAQ,yBAAyB,sBAAsB;AAC3F;AAIE,gBAAI,wBAAwB,QAAQ,6BAA6B,UAAU;AACzE,oBAAM,4GAA4G;AAAA,YACnH;AAAA,UACF;AAGD;AAAA,QACD;AAED,YAAI,wBAAwB,MAAM;AAEhC,2BAAiB,oBAAoB;AAAA,QACtC;AAGD,YAAI;AAEJ,YAAI,wBAAwB,UAAU;AAGpC,cAAIA,MAAK,QAAQ,YAAY;AAC3B,gBAAK,uBAAuB,qBAAqB,MAAM;AACrD,qCAAuB,0BAA0B;AAAA,YAClD;AAED,uCAA2B,sBAAsB,KAAK,MAAMA,KAAI,CAAC;AAAA,UACvE,OAAW;AACL,iCAAqB,sBAAsB,KAAK,MAAMA,KAAI,CAAC;AAAA,UAC5D;AAED;AAEE,gBAAK,uBAAuB,YAAY,MAAM;AAI5C,qCAAuB,QAAQ,KAAK,kBAAkB;AAAA,YAC9D,OAAa;AACL,gCAAkB,WAAY;AAK5B,qBAAK,oBAAoB,gBAAgB,oBAAoB,WAAW;AAGtE;gBACD;AAAA,cACX,CAAS;AAAA,YACF;AAAA,UACF;AAED,4BAAkB;AAAA,QACtB,OAAS;AACL,cAAI;AAEJ,kBAAQ,qBAAqB,SAAS,GAAC;AAAA,YACrC,KAAK;AACH,uCAAyB;AACzB;AAAA,YAEF,KAAK;AACH,uCAAyB;AACzB;AAAA,YAEF,KAAK;AACH,uCAAyB;AACzB;AAAA,YAEF,KAAK;AACH,uCAAyB;AACzB;AAAA,YAEF;AACE,uCAAyB;AACzB;AAAA,UACH;AAED,4BAAkB,mBAAmB,wBAAwB,4BAA4B,KAAK,MAAMA,KAAI,CAAC;AAAA,QAC1G;AAED,QAAAA,MAAK,mBAAmB;AACxB,QAAAA,MAAK,eAAe;AAAA,MACtB;AAIA,eAAS,4BAA4BA,OAAM,YAAY;AACrD;AACE;QACD;AAID,2BAAmB;AACnB,qCAA6B;AAE7B,aAAK,oBAAoB,gBAAgB,oBAAoB,WAAW;AACtE,gBAAM,IAAI,MAAM,gCAAgC;AAAA,QACjD;AAID,YAAI,uBAAuBA,MAAK;AAChC,YAAI,yBAAyB;AAE7B,YAAI,wBAAwB;AAG1B,cAAIA,MAAK,iBAAiB,sBAAsB;AAI9C,mBAAO;AAAA,UACR;AAAA,QACF;AAID,YAAI,QAAQ,aAAaA,OAAMA,UAAS,qBAAqB,gCAAgC,OAAO;AAEpG,YAAI,UAAU,SAAS;AAErB,iBAAO;AAAA,QACR;AAQD,YAAI,kBAAkB,CAAC,qBAAqBA,OAAM,KAAK,KAAK,CAAC,oBAAoBA,OAAM,KAAK,KAAO,CAAC;AACpG,YAAI,aAAa,kBAAkB,qBAAqBA,OAAM,KAAK,IAAI,eAAeA,OAAM,KAAK;AAEjG,YAAI,eAAe,gBAAgB;AACjC,cAAI,eAAe,aAAa;AAK9B,gBAAI,kBAAkB,oCAAoCA,KAAI;AAE9D,gBAAI,oBAAoB,SAAS;AAC/B,sBAAQ;AACR,2BAAa,2BAA2BA,OAAM,eAAe;AAAA,YAC9D;AAAA,UACF;AAED,cAAI,eAAe,kBAAkB;AACnC,gBAAI,aAAa;AACjB,8BAAkBA,OAAM,OAAO;AAC/B,gCAAoBA,OAAM,KAAK;AAC/B,kCAAsBA,OAAM,IAAG,CAAE;AACjC,kBAAM;AAAA,UACP;AAED,cAAI,eAAe,oBAAoB;AAQrC,gCAAoBA,OAAM,KAAK;AAAA,UACrC,OAAW;AAOL,gBAAI,sBAAsB,CAAC,qBAAqBA,OAAM,KAAK;AAC3D,gBAAI,eAAeA,MAAK,QAAQ;AAEhC,gBAAI,uBAAuB,CAAC,qCAAqC,YAAY,GAAG;AAG9E,2BAAa,eAAeA,OAAM,KAAK;AAEvC,kBAAI,eAAe,aAAa;AAC9B,oBAAI,mBAAmB,oCAAoCA,KAAI;AAE/D,oBAAI,qBAAqB,SAAS;AAChC,0BAAQ;AACR,+BAAa,2BAA2BA,OAAM,gBAAgB;AAAA,gBAE/D;AAAA,cACF;AAED,kBAAI,eAAe,kBAAkB;AACnC,oBAAI,cAAc;AAClB,kCAAkBA,OAAM,OAAO;AAC/B,oCAAoBA,OAAM,KAAK;AAC/B,sCAAsBA,OAAM,IAAG,CAAE;AACjC,sBAAM;AAAA,cACP;AAAA,YACF;AAID,YAAAA,MAAK,eAAe;AACpB,YAAAA,MAAK,gBAAgB;AACrB,mCAAuBA,OAAM,YAAY,KAAK;AAAA,UAC/C;AAAA,QACF;AAED,8BAAsBA,OAAM,IAAG,CAAE;AAEjC,YAAIA,MAAK,iBAAiB,sBAAsB;AAG9C,iBAAO,4BAA4B,KAAK,MAAMA,KAAI;AAAA,QACnD;AAED,eAAO;AAAA,MACT;AAEA,eAAS,2BAA2BA,OAAM,iBAAiB;AAIzD,YAAI,yBAAyB;AAE7B,YAAI,iBAAiBA,KAAI,GAAG;AAY1B,cAAI,qBAAqB,kBAAkBA,OAAM,eAAe;AAChE,6BAAmB,SAAS;AAE5B;AACE,oCAAwBA,MAAK,aAAa;AAAA,UAC3C;AAAA,QACF;AAED,YAAI,aAAa,eAAeA,OAAM,eAAe;AAErD,YAAI,eAAe,aAAa;AAK9B,cAAI,0BAA0B;AAC9B,gDAAsC;AAGtC,cAAI,4BAA4B,MAAM;AACpC,mCAAuB,uBAAuB;AAAA,UAC/C;AAAA,QACF;AAED,eAAO;AAAA,MACT;AAEA,eAAS,uBAAuB,QAAQ;AACtC,YAAI,wCAAwC,MAAM;AAChD,gDAAsC;AAAA,QAC1C,OAAS;AACL,8CAAoC,KAAK,MAAM,qCAAqC,MAAM;AAAA,QAC3F;AAAA,MACH;AAEA,eAAS,uBAAuBA,OAAM,YAAY,OAAO;AACvD,gBAAQ,YAAU;AAAA,UAChB,KAAK;AAAA,UACL,KAAK,kBACH;AACE,kBAAM,IAAI,MAAM,gDAAgD;AAAA,UACjE;AAAA,UAKH,KAAK,aACH;AAGE,uBAAWA,OAAM,qCAAqC,yBAAyB;AAC/E;AAAA,UACD;AAAA,UAEH,KAAK,eACH;AACE,gCAAoBA,OAAM,KAAK;AAG/B,gBAAI,oBAAoB,KAAK;AAAA,YAC7B,CAAC,+BAA8B,GAAI;AAGjC,kBAAI,iBAAiB,+BAA+B,uBAAuB,IAAG;AAE9E,kBAAI,iBAAiB,IAAI;AACvB,oBAAI,YAAY,aAAaA,OAAM,OAAO;AAE1C,oBAAI,cAAc,SAAS;AAEzB;AAAA,gBACD;AAED,oBAAI,iBAAiBA,MAAK;AAE1B,oBAAI,CAAC,gBAAgB,gBAAgB,KAAK,GAAG;AAK3B,mCAAmB;AACnC,iCAAeA,OAAM,cAAc;AACnC;AAAA,gBACD;AAKD,gBAAAA,MAAK,gBAAgB,gBAAgB,WAAW,KAAK,MAAMA,OAAM,qCAAqC,yBAAyB,GAAG,cAAc;AAChJ;AAAA,cACD;AAAA,YACF;AAGD,uBAAWA,OAAM,qCAAqC,yBAAyB;AAC/E;AAAA,UACD;AAAA,UAEH,KAAK,wBACH;AACE,gCAAoBA,OAAM,KAAK;AAE/B,gBAAI,wBAAwB,KAAK,GAAG;AAIlC;AAAA,YACD;AAED,gBAAI,CAAC,+BAA8B,GAAI;AAOrC,kBAAI,sBAAsB,uBAAuBA,OAAM,KAAK;AAC5D,kBAAI,cAAc;AAClB,kBAAI,gBAAgB,IAAK,IAAG;AAE5B,kBAAI,kBAAkB,IAAI,aAAa,IAAI;AAG3C,kBAAI,kBAAkB,IAAI;AAGxB,gBAAAA,MAAK,gBAAgB,gBAAgB,WAAW,KAAK,MAAMA,OAAM,qCAAqC,yBAAyB,GAAG,eAAe;AACjJ;AAAA,cACD;AAAA,YACF;AAGD,uBAAWA,OAAM,qCAAqC,yBAAyB;AAC/E;AAAA,UACD;AAAA,UAEH,KAAK,eACH;AAEE,uBAAWA,OAAM,qCAAqC,yBAAyB;AAC/E;AAAA,UACD;AAAA,UAEH,SACE;AACE,kBAAM,IAAI,MAAM,2BAA2B;AAAA,UAC5C;AAAA,QACJ;AAAA,MACH;AAEA,eAAS,qCAAqC,cAAc;AAI1D,YAAI,OAAO;AAEX,eAAO,MAAM;AACX,cAAI,KAAK,QAAQ,kBAAkB;AACjC,gBAAI,cAAc,KAAK;AAEvB,gBAAI,gBAAgB,MAAM;AACxB,kBAAI,SAAS,YAAY;AAEzB,kBAAI,WAAW,MAAM;AACnB,yBAASpH,KAAI,GAAGA,KAAI,OAAO,QAAQA,MAAK;AACtC,sBAAI,QAAQ,OAAOA,EAAC;AACpB,sBAAI,cAAc,MAAM;AACxB,sBAAI,gBAAgB,MAAM;AAE1B,sBAAI;AACF,wBAAI,CAAC,SAAS,YAAa,GAAE,aAAa,GAAG;AAE3C,6BAAO;AAAA,oBACR;AAAA,kBACF,SAAQK,QAAO;AAGd,2BAAO;AAAA,kBACR;AAAA,gBACF;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAED,cAAI,QAAQ,KAAK;AAEjB,cAAI,KAAK,eAAe,oBAAoB,UAAU,MAAM;AAC1D,kBAAM,SAAS;AACf,mBAAO;AACP;AAAA,UACD;AAED,cAAI,SAAS,cAAc;AACzB,mBAAO;AAAA,UACR;AAED,iBAAO,KAAK,YAAY,MAAM;AAC5B,gBAAI,KAAK,WAAW,QAAQ,KAAK,WAAW,cAAc;AACxD,qBAAO;AAAA,YACR;AAED,mBAAO,KAAK;AAAA,UACb;AAED,eAAK,QAAQ,SAAS,KAAK;AAC3B,iBAAO,KAAK;AAAA,QACb;AAID,eAAO;AAAA,MACT;AAEA,eAAS,oBAAoB+G,OAAM,gBAAgB;AAKjD,yBAAiB,YAAY,gBAAgB,6BAA6B;AAC1E,yBAAiB,YAAY,gBAAgB,yCAAyC;AACtF,0BAAkBA,OAAM,cAAc;AAAA,MACxC;AAIA,eAAS,sBAAsBA,OAAM;AACnC;AACE;QACD;AAED,aAAK,oBAAoB,gBAAgB,oBAAoB,WAAW;AACtE,gBAAM,IAAI,MAAM,gCAAgC;AAAA,QACjD;AAED;AACA,YAAI,QAAQ,aAAaA,OAAM,OAAO;AAEtC,YAAI,CAAC,iBAAiB,OAAO,QAAQ,GAAG;AAEtC,gCAAsBA,OAAM,IAAG,CAAE;AACjC,iBAAO;AAAA,QACR;AAED,YAAI,aAAa,eAAeA,OAAM,KAAK;AAE3C,YAAIA,MAAK,QAAQ,cAAc,eAAe,aAAa;AAKzD,cAAI,kBAAkB,oCAAoCA,KAAI;AAE9D,cAAI,oBAAoB,SAAS;AAC/B,oBAAQ;AACR,yBAAa,2BAA2BA,OAAM,eAAe;AAAA,UAC9D;AAAA,QACF;AAED,YAAI,eAAe,kBAAkB;AACnC,cAAI,aAAa;AACjB,4BAAkBA,OAAM,OAAO;AAC/B,8BAAoBA,OAAM,KAAK;AAC/B,gCAAsBA,OAAM,IAAG,CAAE;AACjC,gBAAM;AAAA,QACP;AAED,YAAI,eAAe,oBAAoB;AACrC,gBAAM,IAAI,MAAM,gDAAgD;AAAA,QACjE;AAID,YAAI,eAAeA,MAAK,QAAQ;AAChC,QAAAA,MAAK,eAAe;AACpB,QAAAA,MAAK,gBAAgB;AACrB,mBAAWA,OAAM,qCAAqC,yBAAyB;AAG/E,8BAAsBA,OAAM,IAAG,CAAE;AACjC,eAAO;AAAA,MACT;AAEA,eAAS,UAAUA,OAAM,OAAO;AAC9B,YAAI,UAAU,SAAS;AACrB,4BAAkBA,OAAM,WAAW,OAAO,QAAQ,CAAC;AACnD,gCAAsBA,OAAM,IAAG,CAAE;AAEjC,eAAK,oBAAoB,gBAAgB,oBAAoB,WAAW;AACtE;AACA;UACD;AAAA,QACF;AAAA,MACH;AACA,eAAS,iBAAiB,IAAIzH,IAAG;AAC/B,YAAI,uBAAuB;AAC3B,4BAAoB;AAEpB,YAAI;AACF,iBAAO,GAAGA,EAAC;AAAA,QACf,UAAY;AACR,6BAAmB;AAGnB,cAAI,qBAAqB;AAAA,UACzB,CAAG,uBAAuB,kBAAmB;AAC3C;AACA;UACD;AAAA,QACF;AAAA,MACH;AACA,eAAS,gBAAgB,IAAIA,IAAGsB,IAAGf,IAAGmB,IAAG;AACvC,YAAI,mBAAmB;AACvB,YAAI,iBAAiB,0BAA0B;AAE/C,YAAI;AACF,oCAA0B,aAAa;AACvC,mCAAyB,qBAAqB;AAC9C,iBAAO,GAAG1B,IAAGsB,IAAGf,IAAGmB,EAAC;AAAA,QACxB,UAAY;AACR,mCAAyB,gBAAgB;AACzC,oCAA0B,aAAa;AAEvC,cAAI,qBAAqB,WAAW;AAClC;UACD;AAAA,QACF;AAAA,MACH;AAIA,eAAS,UAAU,IAAI;AAGrB,YAAI,kCAAkC,QAAQ,8BAA8B,QAAQ,eAAe,oBAAoB,gBAAgB,oBAAoB,WAAW;AACpK;QACD;AAED,YAAI,uBAAuB;AAC3B,4BAAoB;AACpB,YAAI,iBAAiB,0BAA0B;AAC/C,YAAI,mBAAmB;AAEvB,YAAI;AACF,oCAA0B,aAAa;AACvC,mCAAyB,qBAAqB;AAE9C,cAAI,IAAI;AACN,mBAAO,GAAE;AAAA,UACf,OAAW;AACL,mBAAO;AAAA,UACR;AAAA,QACL,UAAY;AACR,mCAAyB,gBAAgB;AACzC,oCAA0B,aAAa;AACvC,6BAAmB;AAInB,eAAK,oBAAoB,gBAAgB,oBAAoB,WAAW;AACtE;UACD;AAAA,QACF;AAAA,MACH;AACA,eAAS,qBAAqB;AAG5B,gBAAS,oBAAoB,gBAAgB,oBAAoB;AAAA,MACnE;AACA,eAAS,gBAAgB,OAAO,OAAO;AACrC,aAAK,0BAA0B,oBAAoB,KAAK;AACxD,6BAAqB,WAAW,oBAAoB,KAAK;AAAA,MAE3D;AACA,eAAS,eAAe,OAAO;AAC7B,6BAAqB,yBAAyB;AAC9C,YAAI,0BAA0B,KAAK;AAAA,MACrC;AAEA,eAAS,kBAAkB+F,OAAM,OAAO;AACtC,QAAAA,MAAK,eAAe;AACpB,QAAAA,MAAK,gBAAgB;AACrB,YAAI,gBAAgBA,MAAK;AAEzB,YAAI,kBAAkB,WAAW;AAG/B,UAAAA,MAAK,gBAAgB;AAErB,wBAAc,aAAa;AAAA,QAC5B;AAED,YAAI,mBAAmB,MAAM;AAC3B,cAAI,kBAAkB,eAAe;AAErC,iBAAO,oBAAoB,MAAM;AAC/B,gBAAID,WAAU,gBAAgB;AAC9B,kCAAsBA,UAAS,eAAe;AAC9C,8BAAkB,gBAAgB;AAAA,UACnC;AAAA,QACF;AAED,6BAAqBC;AACrB,YAAI,qBAAqB,qBAAqBA,MAAK,SAAS,IAAI;AAChE,yBAAiB;AACjB,wCAAgC,qBAAuD;AACvF,uCAA+B;AAC/B,uCAA+B;AAC/B,yCAAiC;AACjC,oDAA4C;AAC5C,wCAAgC;AAChC,6CAAqC;AACrC,8CAAsC;AACtC;AAEA;AACE,kCAAwB,uBAAsB;AAAA,QAC/C;AAED,eAAO;AAAA,MACT;AAEA,eAAS,YAAYA,OAAM,aAAa;AACtC,WAAG;AACD,cAAI,cAAc;AAElB,cAAI;AAEF;AACA;AACA;AAGA,gCAAoB,UAAU;AAE9B,gBAAI,gBAAgB,QAAQ,YAAY,WAAW,MAAM;AAKvD,6CAA+B;AAC/B,6CAA+B;AAO/B,+BAAiB;AACjB;AAAA,YACD;AAED,gBAAI,uBAAuB,YAAY,OAAO,aAAa;AAIzD,uDAAyC,aAAa,IAAI;AAAA,YAC3D;AAED,gBAAI,0BAA0B;AAC5B;AAEA,kBAAI,gBAAgB,QAAQ,OAAO,gBAAgB,YAAY,OAAO,YAAY,SAAS,YAAY;AACrG,oBAAI,WAAW;AACf,uCAAuB,aAAa,UAAU,6BAA6B;AAAA,cACrF,OAAe;AACL,qCAAqB,aAAa,aAAa,6BAA6B;AAAA,cAC7E;AAAA,YACF;AAED,2BAAeA,OAAM,YAAY,QAAQ,aAAa,aAAa,6BAA6B;AAChG,+BAAmB,WAAW;AAAA,UAC/B,SAAQ,uBAAuB;AAE9B,0BAAc;AAEd,gBAAI,mBAAmB,eAAe,gBAAgB,MAAM;AAG1D,4BAAc,YAAY;AAC1B,+BAAiB;AAAA,YACzB,OAAa;AACL,4BAAc;AAAA,YACf;AAED;AAAA,UACD;AAGD;AAAA,QACD,SAAQ;AAAA,MACX;AAEA,eAAS,iBAAiB;AACxB,YAAI,iBAAiB,yBAAyB;AAC9C,iCAAyB,UAAU;AAEnC,YAAI,mBAAmB,MAAM;AAI3B,iBAAO;AAAA,QACX,OAAS;AACL,iBAAO;AAAA,QACR;AAAA,MACH;AAEA,eAAS,cAAc,gBAAgB;AACrC,iCAAyB,UAAU;AAAA,MACrC;AAEA,eAAS,2BAA2B;AAClC,uCAA+B,IAAG;AAAA,MACpC;AACA,eAAS,uBAAuB,MAAM;AACpC,yCAAiC,WAAW,MAAM,8BAA8B;AAAA,MAClF;AACA,eAAS,mBAAmB;AAC1B,YAAI,iCAAiC,gBAAgB;AACnD,yCAA+B;AAAA,QAChC;AAAA,MACH;AACA,eAAS,kCAAkC;AACzC,YAAI,iCAAiC,kBAAkB,iCAAiC,iBAAiB,iCAAiC,aAAa;AACrJ,yCAA+B;AAAA,QAChC;AAID,YAAI,uBAAuB,SAAS,oBAAoB,8BAA8B,KAAK,oBAAoB,yCAAyC,IAAI;AAQ1J,8BAAoB,oBAAoB,6BAA6B;AAAA,QACtE;AAAA,MACH;AACA,eAAS,eAAe/G,QAAO;AAC7B,YAAI,iCAAiC,wBAAwB;AAC3D,yCAA+B;AAAA,QAChC;AAED,YAAI,uCAAuC,MAAM;AAC/C,+CAAqC,CAACA,MAAK;AAAA,QAC/C,OAAS;AACL,6CAAmC,KAAKA,MAAK;AAAA,QAC9C;AAAA,MACH;AAGA,eAAS,2BAA2B;AAGlC,eAAO,iCAAiC;AAAA,MAC1C;AAEA,eAAS,eAAe+G,OAAM,OAAO;AACnC,YAAI,uBAAuB;AAC3B,4BAAoB;AACpB,YAAI,iBAAiB;AAGrB,YAAI,uBAAuBA,SAAQ,kCAAkC,OAAO;AAC1E;AACE,gBAAI,mBAAmB;AACrB,kBAAI,mBAAmBA,MAAK;AAE5B,kBAAI,iBAAiB,OAAO,GAAG;AAC7B,uCAAuBA,OAAM,6BAA6B;AAC1D,iCAAiB,MAAK;AAAA,cACvB;AAMD,0CAA4BA,OAAM,KAAK;AAAA,YACxC;AAAA,UACF;AAED,sCAA4B,uBAAsB;AAClD,4BAAkBA,OAAM,KAAK;AAAA,QAC9B;AAED;AACE,4BAAkB,KAAK;AAAA,QACxB;AAED,WAAG;AACD,cAAI;AACF;AACA;AAAA,UACD,SAAQ,aAAa;AACpB,wBAAYA,OAAM,WAAW;AAAA,UAC9B;AAAA,QACF,SAAQ;AAET;AACA,2BAAmB;AACnB,sBAAc,cAAc;AAE5B,YAAI,mBAAmB,MAAM;AAE3B,gBAAM,IAAI,MAAM,wGAA6G;AAAA,QAC9H;AAED;AACE;QACD;AAGD,6BAAqB;AACrB,wCAAgC;AAChC,eAAO;AAAA,MACT;AAKA,eAAS,eAAe;AAEtB,eAAO,mBAAmB,MAAM;AAC9B,4BAAkB,cAAc;AAAA,QACjC;AAAA,MACH;AAEA,eAAS,qBAAqBA,OAAM,OAAO;AACzC,YAAI,uBAAuB;AAC3B,4BAAoB;AACpB,YAAI,iBAAiB;AAGrB,YAAI,uBAAuBA,SAAQ,kCAAkC,OAAO;AAC1E;AACE,gBAAI,mBAAmB;AACrB,kBAAI,mBAAmBA,MAAK;AAE5B,kBAAI,iBAAiB,OAAO,GAAG;AAC7B,uCAAuBA,OAAM,6BAA6B;AAC1D,iCAAiB,MAAK;AAAA,cACvB;AAMD,0CAA4BA,OAAM,KAAK;AAAA,YACxC;AAAA,UACF;AAED,sCAA4B,uBAAsB;AAClD;AACA,4BAAkBA,OAAM,KAAK;AAAA,QAC9B;AAED;AACE,4BAAkB,KAAK;AAAA,QACxB;AAED,WAAG;AACD,cAAI;AACF;AACA;AAAA,UACD,SAAQ,aAAa;AACpB,wBAAYA,OAAM,WAAW;AAAA,UAC9B;AAAA,QACF,SAAQ;AAET;AACA,sBAAc,cAAc;AAC5B,2BAAmB;AAGnB,YAAI,mBAAmB,MAAM;AAE3B;AACE;UACD;AAED,iBAAO;AAAA,QACX,OAAS;AAEL;AACE;UACD;AAGD,+BAAqB;AACrB,0CAAgC;AAEhC,iBAAO;AAAA,QACR;AAAA,MACH;AAIA,eAAS,qBAAqB;AAE5B,eAAO,mBAAmB,QAAQ,CAAC,eAAe;AAChD,4BAAkB,cAAc;AAAA,QACjC;AAAA,MACH;AAEA,eAAS,kBAAkB,YAAY;AAIrC,YAAID,WAAU,WAAW;AACzB,wBAAgB,UAAU;AAC1B,YAAI;AAEJ,aAAM,WAAW,OAAO,iBAAiB,QAAQ;AAC/C,6BAAmB,UAAU;AAC7B,iBAAO,YAAYA,UAAS,YAAY,kBAAkB;AAC1D,mDAAyC,YAAY,IAAI;AAAA,QAC7D,OAAS;AACL,iBAAO,YAAYA,UAAS,YAAY,kBAAkB;AAAA,QAC3D;AAED;AACA,mBAAW,gBAAgB,WAAW;AAEtC,YAAI,SAAS,MAAM;AAEjB,6BAAmB,UAAU;AAAA,QACjC,OAAS;AACL,2BAAiB;AAAA,QAClB;AAED,4BAAoB,UAAU;AAAA,MAChC;AAEA,eAAS,mBAAmB,YAAY;AAGtC,YAAI,gBAAgB;AAEpB,WAAG;AAID,cAAIA,WAAU,cAAc;AAC5B,cAAI,cAAc,cAAc;AAEhC,eAAK,cAAc,QAAQ,gBAAgB,SAAS;AAClD,4BAAgB,aAAa;AAC7B,gBAAI,OAAO;AAEX,iBAAM,cAAc,OAAO,iBAAiB,QAAQ;AAClD,qBAAO,aAAaA,UAAS,eAAe,kBAAkB;AAAA,YACtE,OAAa;AACL,iCAAmB,aAAa;AAChC,qBAAO,aAAaA,UAAS,eAAe,kBAAkB;AAE9D,uDAAyC,eAAe,KAAK;AAAA,YAC9D;AAED;AAEA,gBAAI,SAAS,MAAM;AAEjB,+BAAiB;AACjB;AAAA,YACD;AAAA,UACP,OAAW;AAIL,gBAAI,QAAQ,WAAWA,UAAS,aAAa;AAG7C,gBAAI,UAAU,MAAM;AAKlB,oBAAM,SAAS;AACf,+BAAiB;AACjB;AAAA,YACD;AAED,iBAAM,cAAc,OAAO,iBAAiB,QAAQ;AAElD,uDAAyC,eAAe,KAAK;AAE7D,kBAAI,iBAAiB,cAAc;AACnC,kBAAI,QAAQ,cAAc;AAE1B,qBAAO,UAAU,MAAM;AACrB,kCAAkB,MAAM;AACxB,wBAAQ,MAAM;AAAA,cACf;AAED,4BAAc,iBAAiB;AAAA,YAChC;AAED,gBAAI,gBAAgB,MAAM;AAExB,0BAAY,SAAS;AACrB,0BAAY,eAAe;AAC3B,0BAAY,YAAY;AAAA,YAChC,OAAa;AAEL,6CAA+B;AAC/B,+BAAiB;AACjB;AAAA,YACD;AAAA,UACF;AAED,cAAI,eAAe,cAAc;AAEjC,cAAI,iBAAiB,MAAM;AAEzB,6BAAiB;AACjB;AAAA,UACD;AAGD,0BAAgB;AAEhB,2BAAiB;AAAA,QACrB,SAAW,kBAAkB;AAG3B,YAAI,iCAAiC,gBAAgB;AACnD,yCAA+B;AAAA,QAChC;AAAA,MACH;AAEA,eAAS,WAAWC,OAAM,mBAAmB,aAAa;AAGxD,YAAI,6BAA6B;AACjC,YAAI,iBAAiB,0BAA0B;AAE/C,YAAI;AACF,oCAA0B,aAAa;AACvC,mCAAyB,qBAAqB;AAC9C,yBAAeA,OAAM,mBAAmB,aAAa,0BAA0B;AAAA,QACnF,UAAY;AACR,oCAA0B,aAAa;AACvC,mCAAyB,0BAA0B;AAAA,QACpD;AAED,eAAO;AAAA,MACT;AAEA,eAAS,eAAeA,OAAM,mBAAmB,aAAa,qBAAqB;AACjF,WAAG;AAOD;QACJ,SAAW,kCAAkC;AAE3C;AAEA,aAAK,oBAAoB,gBAAgB,oBAAoB,WAAW;AACtE,gBAAM,IAAI,MAAM,gCAAgC;AAAA,QACjD;AAED,YAAI,eAAeA,MAAK;AACxB,YAAI,QAAQA,MAAK;AAEjB;AACE,4BAAkB,KAAK;AAAA,QACxB;AAED,YAAI,iBAAiB,MAAM;AAEzB;AACE;UACD;AAED,iBAAO;AAAA,QACX,OAAS;AACL;AACE,gBAAI,UAAU,SAAS;AACrB,oBAAM,iFAAsF;AAAA,YAC7F;AAAA,UACF;AAAA,QACF;AAED,QAAAA,MAAK,eAAe;AACpB,QAAAA,MAAK,gBAAgB;AAErB,YAAI,iBAAiBA,MAAK,SAAS;AACjC,gBAAM,IAAI,MAAM,6GAAkH;AAAA,QACnI;AAID,QAAAA,MAAK,eAAe;AACpB,QAAAA,MAAK,mBAAmB;AAGxB,YAAI,iBAAiB,WAAW,aAAa,OAAO,aAAa,UAAU;AAC3E,yBAAiBA,OAAM,cAAc;AAErC,YAAIA,UAAS,oBAAoB;AAE/B,+BAAqB;AACrB,2BAAiB;AACjB,0CAAgC;AAAA,QACjC;AAOD,aAAK,aAAa,eAAe,iBAAiB,YAAY,aAAa,QAAQ,iBAAiB,SAAS;AAC3G,cAAI,CAAC,4BAA4B;AAC/B,yCAA6B;AAO7B,wCAA4B;AAC5B,+BAAmB,gBAAgB,WAAY;AAC7C;AAIA,qBAAO;AAAA,YACf,CAAO;AAAA,UACF;AAAA,QACF;AAOD,YAAI,qBAAqB,aAAa,gBAAgB,qBAAqB,eAAe,aAAa,kBAAkB;AACzH,YAAI,iBAAiB,aAAa,SAAS,qBAAqB,eAAe,aAAa,kBAAkB;AAE9G,YAAI,qBAAqB,eAAe;AACtC,cAAI,iBAAiB,0BAA0B;AAC/C,oCAA0B,aAAa;AACvC,cAAI,mBAAmB;AACvB,mCAAyB,qBAAqB;AAC9C,cAAI,uBAAuB;AAC3B,8BAAoB;AAEpB,8BAAoB,UAAU;AAOU,sCAA4BA,OAAM,YAAY;AAEtF;AAGE;UACD;AAGD,gCAAsBA,OAAM,cAAc,KAAK;AAE/C,2BAAiBA,MAAK,aAAa;AAKnC,UAAAA,MAAK,UAAU;AAEf;AACE,qCAAyB,KAAK;AAAA,UAC/B;AAED,8BAAoB,cAAcA,OAAM,KAAK;AAE7C;AACE;UACD;AAID;AACA,6BAAmB;AAEnB,mCAAyB,gBAAgB;AACzC,oCAA0B,aAAa;AAAA,QAC3C,OAAS;AAEL,UAAAA,MAAK,UAAU;AAIf;AACE;UACD;AAAA,QACF;AAED,YAAI,4BAA4B;AAEhC,YAAI,4BAA4B;AAG9B,uCAA6B;AAC7B,0CAAgCA;AAChC,uCAA6B;AAAA,QACjC,OAAS;AAEL;AACE,uCAA2B;AAC3B,2CAA+B;AAAA,UAChC;AAAA,QACF;AAGD,yBAAiBA,MAAK;AAWtB,YAAI,mBAAmB,SAAS;AAG9B,mDAAyC;AAAA,QAC1C;AAED;AACE,cAAI,CAAC,2BAA2B;AAC9B,2CAA+BA,MAAK,SAAS,KAAK;AAAA,UACnD;AAAA,QACF;AAED,qBAAa,aAAa,WAAW,mBAAmB;AAExD;AACE,cAAI,mBAAmB;AACrB,YAAAA,MAAK,iBAAiB;UACvB;AAAA,QACF;AAED;AACE;QACD;AAID,8BAAsBA,OAAM,IAAG,CAAE;AAEjC,YAAI,sBAAsB,MAAM;AAG9B,cAAI,qBAAqBA,MAAK;AAE9B,mBAASpH,KAAI,GAAGA,KAAI,kBAAkB,QAAQA,MAAK;AACjD,gBAAI,mBAAmB,kBAAkBA,EAAC;AAC1C,gBAAI,iBAAiB,iBAAiB;AACtC,gBAAI,SAAS,iBAAiB;AAC9B,+BAAmB,iBAAiB,OAAO;AAAA,cACzC;AAAA,cACA;AAAA,YACR,CAAO;AAAA,UACF;AAAA,QACF;AAED,YAAI,kBAAkB;AACpB,6BAAmB;AACnB,cAAI,UAAU;AACd,+BAAqB;AACrB,gBAAM;AAAA,QACP;AAUD,YAAI,iBAAiB,4BAA4B,QAAQ,KAAKoH,MAAK,QAAQ,YAAY;AACrF;QACD;AAGD,yBAAiBA,MAAK;AAEtB,YAAI,iBAAiB,gBAAgB,QAAQ,GAAG;AAC9C;AACE;UACD;AAID,cAAIA,UAAS,uBAAuB;AAClC;AAAA,UACN,OAAW;AACL,gCAAoB;AACpB,oCAAwBA;AAAA,UACzB;AAAA,QACL,OAAS;AACL,8BAAoB;AAAA,QACrB;AAGD;AAEA;AACE;QACD;AAED,eAAO;AAAA,MACT;AAEA,eAAS,sBAAsB;AAO7B,YAAI,kCAAkC,MAAM;AAC1C,cAAI,iBAAiB,qBAAqB,0BAA0B;AACpE,cAAI,WAAW,mBAAmB,sBAAsB,cAAc;AACtE,cAAI,iBAAiB,0BAA0B;AAC/C,cAAI,mBAAmB;AAEvB,cAAI;AACF,sCAA0B,aAAa;AACvC,qCAAyB,QAAQ;AACjC,mBAAO,wBAAuB;AAAA,UACpC,UAAc;AACR,qCAAyB,gBAAgB;AACzC,sCAA0B,aAAa;AAAA,UACxC;AAAA,QACF;AAED,eAAO;AAAA,MACT;AACA,eAAS,oCAAoC,OAAO;AAClD;AACE,wCAA8B,KAAK,KAAK;AAExC,cAAI,CAAC,4BAA4B;AAC/B,yCAA6B;AAC7B,+BAAmB,gBAAgB,WAAY;AAC7C;AACA,qBAAO;AAAA,YACf,CAAO;AAAA,UACF;AAAA,QACF;AAAA,MACH;AAEA,eAAS,0BAA0B;AACjC,YAAI,kCAAkC,MAAM;AAC1C,iBAAO;AAAA,QACR;AAGD,YAAI,cAAc;AAClB,oCAA4B;AAC5B,YAAIA,QAAO;AACX,YAAI,QAAQ;AACZ,wCAAgC;AAIhC,qCAA6B;AAE7B,aAAK,oBAAoB,gBAAgB,oBAAoB,WAAW;AACtE,gBAAM,IAAI,MAAM,uDAAuD;AAAA,QACxE;AAED;AACE,qCAA2B;AAC3B,kDAAwC;AAAA,QACzC;AAED;AACE,oCAA0B,KAAK;AAAA,QAChC;AAED,YAAI,uBAAuB;AAC3B,4BAAoB;AACpB,oCAA4BA,MAAK,OAAO;AACxC,kCAA0BA,OAAMA,MAAK,SAAS,OAAO,WAAW;AAEhE;AACE,cAAI,kBAAkB;AACtB,0CAAgC,CAAA;AAEhC,mBAASpH,KAAI,GAAGA,KAAI,gBAAgB,QAAQA,MAAK;AAC/C,gBAAI,SAAS,gBAAgBA,EAAC;AAC9B,yCAA6BoH,OAAM,MAAM;AAAA,UAC1C;AAAA,QACF;AAED;AACE;QACD;AAED;AACE,yCAA+BA,MAAK,SAAS,IAAI;AAAA,QAClD;AAED,2BAAmB;AACnB;AAEA;AAGE,cAAI,uCAAuC;AACzC,gBAAIA,UAAS,8BAA8B;AACzC;AAAA,YACR,OAAa;AACL,yCAA2B;AAC3B,6CAA+BA;AAAA,YAChC;AAAA,UACP,OAAW;AACL,uCAA2B;AAAA,UAC5B;AAED,qCAA2B;AAC3B,kDAAwC;AAAA,QACzC;AAGD,yBAAiBA,KAAI;AAErB;AACE,cAAI,YAAYA,MAAK,QAAQ;AAC7B,oBAAU,iBAAiB;AAC3B,oBAAU,wBAAwB;AAAA,QACnC;AAED,eAAO;AAAA,MACT;AAEA,eAAS,mCAAmC,UAAU;AACpD,eAAO,2CAA2C,QAAQ,uCAAuC,IAAI,QAAQ;AAAA,MAC/G;AACA,eAAS,gCAAgC,UAAU;AACjD,YAAI,2CAA2C,MAAM;AACnD,mDAAyC,oBAAI,IAAI,CAAC,QAAQ,CAAC;AAAA,QAC/D,OAAS;AACL,iDAAuC,IAAI,QAAQ;AAAA,QACpD;AAAA,MACH;AAEA,eAAS,4BAA4B/G,QAAO;AAC1C,YAAI,CAAC,kBAAkB;AACrB,6BAAmB;AACnB,+BAAqBA;AAAA,QACtB;AAAA,MACH;AAEA,UAAI,kBAAkB;AAEtB,eAAS,8BAA8B,WAAW,aAAaA,QAAO;AACpE,YAAI,YAAY,2BAA2BA,QAAO,WAAW;AAC7D,YAAI,SAAS,sBAAsB,WAAW,WAAW,QAAQ;AACjE,YAAI+G,QAAO,cAAc,WAAW,QAAQ,QAAQ;AACpD,YAAI,YAAY;AAEhB,YAAIA,UAAS,MAAM;AACjB,0BAAgBA,OAAM,UAAU,SAAS;AACzC,gCAAsBA,OAAM,SAAS;AAAA,QACtC;AAAA,MACH;AAEA,eAAS,wBAAwB,aAAa,wBAAwB,SAAS;AAC7E;AACE,mCAAyB,OAAO;AAChC,sCAA4B,KAAK;AAAA,QAClC;AAED,YAAI,YAAY,QAAQ,UAAU;AAGhC,wCAA8B,aAAa,aAAa,OAAO;AAC/D;AAAA,QACD;AAED,YAAI,QAAQ;AAEZ;AACE,kBAAQ;AAAA,QACT;AAED,eAAO,UAAU,MAAM;AACrB,cAAI,MAAM,QAAQ,UAAU;AAC1B,0CAA8B,OAAO,aAAa,OAAO;AACzD;AAAA,UACN,WAAe,MAAM,QAAQ,gBAAgB;AACvC,gBAAI,OAAO,MAAM;AACjB,gBAAI,WAAW,MAAM;AAErB,gBAAI,OAAO,KAAK,6BAA6B,cAAc,OAAO,SAAS,sBAAsB,cAAc,CAAC,mCAAmC,QAAQ,GAAG;AAC5J,kBAAI,YAAY,2BAA2B,SAAS,WAAW;AAC/D,kBAAI,SAAS,uBAAuB,OAAO,WAAW,QAAQ;AAC9D,kBAAIA,QAAO,cAAc,OAAO,QAAQ,QAAQ;AAChD,kBAAI,YAAY;AAEhB,kBAAIA,UAAS,MAAM;AACjB,gCAAgBA,OAAM,UAAU,SAAS;AACzC,sCAAsBA,OAAM,SAAS;AAAA,cACtC;AAED;AAAA,YACD;AAAA,UACF;AAED,kBAAQ,MAAM;AAAA,QACf;AAED;AAME,gBAAM,wRAA4S,OAAO;AAAA,QAC1T;AAAA,MACH;AACA,eAAS,kBAAkBA,OAAM,UAAU,aAAa;AACtD,YAAI,YAAYA,MAAK;AAErB,YAAI,cAAc,MAAM;AAGtB,oBAAU,OAAO,QAAQ;AAAA,QAC1B;AAED,YAAI,YAAY;AAChB,uBAAeA,OAAM,WAAW;AAChC,qDAA6CA,KAAI;AAEjD,YAAI,uBAAuBA,SAAQ,gBAAgB,+BAA+B,WAAW,GAAG;AAQ9F,cAAI,iCAAiC,0BAA0B,iCAAiC,iBAAiB,oBAAoB,6BAA6B,KAAK,IAAG,IAAK,+BAA+B,sBAAsB;AAElO,8BAAkBA,OAAM,OAAO;AAAA,UACrC,OAAW;AAGL,4CAAgC,WAAW,+BAA+B,WAAW;AAAA,UACtF;AAAA,QACF;AAED,8BAAsBA,OAAM,SAAS;AAAA,MACvC;AAEA,eAAS,sBAAsB,eAAe,WAAW;AAKvD,YAAI,cAAc,QAAQ;AAGxB,sBAAY,iBAAiB,aAAa;AAAA,QAC3C;AAGD,YAAI,YAAY;AAChB,YAAIA,QAAO,+BAA+B,eAAe,SAAS;AAElE,YAAIA,UAAS,MAAM;AACjB,0BAAgBA,OAAM,WAAW,SAAS;AAC1C,gCAAsBA,OAAM,SAAS;AAAA,QACtC;AAAA,MACH;AAEA,eAAS,gCAAgC,eAAe;AACtD,YAAI,gBAAgB,cAAc;AAClC,YAAI,YAAY;AAEhB,YAAI,kBAAkB,MAAM;AAC1B,sBAAY,cAAc;AAAA,QAC3B;AAED,8BAAsB,eAAe,SAAS;AAAA,MAChD;AACA,eAAS,qBAAqB,eAAe,UAAU;AACrD,YAAI,YAAY;AAEhB,YAAI;AAEJ,gBAAQ,cAAc,KAAG;AAAA,UACvB,KAAK;AACH,yBAAa,cAAc;AAC3B,gBAAI,gBAAgB,cAAc;AAElC,gBAAI,kBAAkB,MAAM;AAC1B,0BAAY,cAAc;AAAA,YAC3B;AAED;AAAA,UAEF,KAAK;AACH,yBAAa,cAAc;AAC3B;AAAA,UAEF;AACE,kBAAM,IAAI,MAAM,yEAA8E;AAAA,QACjG;AAED,YAAI,eAAe,MAAM;AAGvB,qBAAW,OAAO,QAAQ;AAAA,QAC3B;AAED,8BAAsB,eAAe,SAAS;AAAA,MAChD;AAUA,eAAS,IAAI,aAAa;AACxB,eAAO,cAAc,MAAM,MAAM,cAAc,MAAM,MAAM,cAAc,OAAO,OAAO,cAAc,OAAO,OAAO,cAAc,MAAO,MAAO,cAAc,OAAO,OAAO,KAAK,cAAc,IAAI,IAAI;AAAA,MACxM;AAEA,eAAS,wBAAwB;AAC/B,YAAI,oBAAoB,qBAAqB;AAC3C,8BAAoB;AACpB,kCAAwB;AACxB,gBAAM,IAAI,MAAM,kNAAiO;AAAA,QAClP;AAED;AACE,cAAI,2BAA2B,6BAA6B;AAC1D,uCAA2B;AAC3B,2CAA+B;AAE/B,kBAAM,4MAA2N;AAAA,UAClO;AAAA,QACF;AAAA,MACH;AAEA,eAAS,0CAA0C;AACjD;AACE,kCAAwB,0BAAyB;AAEjD;AACE,oCAAwB,oCAAmC;AAAA,UAC5D;AAAA,QACF;AAAA,MACH;AAEA,eAAS,+BAA+B,OAAO,mBAAmB;AAChE;AAIE,0BAAgB,KAAK;AACrB,6BAAmB,OAAO,gBAAgB,8BAA8B;AAExE,cAAI,mBAAmB;AACrB,+BAAmB,OAAO,iBAAiB,+BAA+B;AAAA,UAC3E;AAED,6BAAmB,OAAO,gBAAgB,4BAA4B;AAEtE,cAAI,mBAAmB;AACrB,+BAAmB,OAAO,iBAAiB,6BAA6B;AAAA,UACzE;AAED;QACD;AAAA,MACH;AAEA,eAAS,mBAAmB,YAAY,YAAY,gBAAgB;AAClE;AAGE,cAAID,WAAU;AACd,cAAI,cAAc;AAElB,iBAAOA,aAAY,MAAM;AACvB,gBAAI,qBAAqBA,SAAQ,eAAe;AAEhD,gBAAIA,aAAY,eAAeA,SAAQ,UAAU,QAAQ,uBAAuB,SAAS;AACvF,cAAAA,WAAUA,SAAQ;AAAA,YAC1B,OAAa;AACL,mBAAKA,SAAQ,QAAQ,gBAAgB,SAAS;AAC5C,+BAAeA,QAAO;AAAA,cACvB;AAED,kBAAIA,SAAQ,YAAY,MAAM;AAC5B,gBAAAA,WAAUA,SAAQ;AAAA,cAC5B,OAAe;AACL,gBAAAA,WAAU,cAAcA,SAAQ;AAAA,cACjC;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACH;AAEA,UAAI,8CAA8C;AAClD,eAAS,yCAAyC,OAAO;AACvD;AACE,eAAK,mBAAmB,mBAAmB,WAAW;AAEpD;AAAA,UACD;AAED,cAAI,EAAE,MAAM,OAAO,iBAAiB;AAClC;AAAA,UACD;AAED,cAAI,MAAM,MAAM;AAEhB,cAAI,QAAQ,0BAA0B,QAAQ,YAAY,QAAQ,kBAAkB,QAAQ,qBAAqB,QAAQ,cAAc,QAAQ,iBAAiB,QAAQ,qBAAqB;AAE3L;AAAA,UACD;AAID,cAAI,gBAAgB,0BAA0B,KAAK,KAAK;AAExD,cAAI,gDAAgD,MAAM;AACxD,gBAAI,4CAA4C,IAAI,aAAa,GAAG;AAClE;AAAA,YACD;AAED,wDAA4C,IAAI,aAAa;AAAA,UACnE,OAAW;AACL,0DAA8C,oBAAI,IAAI,CAAC,aAAa,CAAC;AAAA,UACtE;AAED,cAAI,gBAAgB;AAEpB,cAAI;AACF,4BAAgB,KAAK;AAErB,kBAAM,mPAAkQ;AAAA,UAC9Q,UAAc;AACR,gBAAI,eAAe;AACjB,8BAAgB,KAAK;AAAA,YAC7B,OAAa;AACL;YACD;AAAA,UACF;AAAA,QACF;AAAA,MACH;AACA,UAAI;AAEJ;AACE,YAAI,aAAa;AAEjB,sBAAc,SAAUA,UAAS,YAAY,OAAO;AAMlD,cAAI,6BAA6B,2BAA2B,YAAY,UAAU;AAElF,cAAI;AACF,mBAAO,UAAUA,UAAS,YAAY,KAAK;AAAA,UAC5C,SAAQ,eAAe;AACtB,gBAAI,mCAAkC,KAAM,kBAAkB,QAAQ,OAAO,kBAAkB,YAAY,OAAO,cAAc,SAAS,YAAY;AAGnJ,oBAAM;AAAA,YACP;AAID;AACA;AAIA,kCAAsBA,UAAS,UAAU;AAEzC,uCAA2B,YAAY,0BAA0B;AAEjE,gBAAK,WAAW,OAAO,aAAa;AAElC,iCAAmB,UAAU;AAAA,YAC9B;AAGD,kCAAsB,MAAM,WAAW,MAAMA,UAAS,YAAY,KAAK;AAEvE,gBAAI,eAAc,GAAI;AACpB,kBAAI,cAAc;AAElB,kBAAI,OAAO,gBAAgB,YAAY,gBAAgB,QAAQ,YAAY,oBAAoB,OAAO,kBAAkB,YAAY,kBAAkB,QAAQ,CAAC,cAAc,kBAAkB;AAE7L,8BAAc,mBAAmB;AAAA,cAClC;AAAA,YACF;AAID,kBAAM;AAAA,UACP;AAAA,QACL;AAAA,MACA;AAEA,UAAI,6BAA6B;AACjC,UAAI;AAEJ;AACE,wDAAgD,oBAAI;MACtD;AAEA,eAAS,iCAAiC,OAAO;AAC/C;AACE,cAAI,eAAe,CAAC,8CAA8C;AAChE,oBAAQ,MAAM,KAAG;AAAA,cACf,KAAK;AAAA,cACL,KAAK;AAAA,cACL,KAAK,qBACH;AACE,oBAAI,yBAAyB,kBAAkB,0BAA0B,cAAc,KAAK;AAE5F,oBAAI,YAAY;AAEhB,oBAAI,CAAC,8CAA8C,IAAI,SAAS,GAAG;AACjE,gEAA8C,IAAI,SAAS;AAC3D,sBAAI,wBAAwB,0BAA0B,KAAK,KAAK;AAEhE,wBAAM,oNAA8N,uBAAuB,wBAAwB,sBAAsB;AAAA,gBAC1S;AAED;AAAA,cACD;AAAA,cAEH,KAAK,gBACH;AACE,oBAAI,CAAC,4BAA4B;AAC/B,wBAAM,2IAAqJ;AAE3J,+CAA6B;AAAA,gBAC9B;AAED;AAAA,cACD;AAAA,YACJ;AAAA,UACF;AAAA,QACF;AAAA,MACH;AAEA,eAAS,uBAAuBC,OAAM,OAAO;AAC3C;AACE,cAAI,mBAAmB;AACrB,gBAAI,mBAAmBA,MAAK;AAC5B,6BAAiB,QAAQ,SAAU,iBAAiB;AAClD,iCAAmBA,OAAM,iBAAiB,KAAK;AAAA,YACvD,CAAO;AAAA,UAGF;AAAA,QACF;AAAA,MACH;AACA,UAAI,sBAAsB,CAAA;AAE1B,eAAS,mBAAmB,eAAe,UAAU;AACnD;AAGE,cAAI,WAAW,uBAAuB;AAEtC,cAAI,aAAa,MAAM;AACrB,qBAAS,KAAK,QAAQ;AACtB,mBAAO;AAAA,UACb,OAAW;AACL,mBAAO,iBAAiB,eAAe,QAAQ;AAAA,UAChD;AAAA,QACF;AAAA,MACH;AAEA,eAAS,iBAAiB,cAAc;AACtC,YAAK,iBAAiB,qBAAqB;AACzC;AAAA,QACD;AAGD,eAAO,eAAe,YAAY;AAAA,MACpC;AAEA,eAAS,iCAAiC;AAExC,eAAQ,uBAAuB,YAAY;AAAA,MAC7C;AAEA,eAAS,kCAAkC,OAAO;AAChD;AACE,cAAI,MAAM,OAAO,gBAAgB;AAC/B,gBAAI,CAAC,2BAA0B,GAAI;AAEjC;AAAA,YACD;AAAA,UACP,OAAW;AAEL,gBAAI,CAAC,uBAAsB,GAAI;AAE7B;AAAA,YACD;AAED,gBAAI,qBAAqB,WAAW;AAGlC;AAAA,YACD;AAED,gBAAI,MAAM,QAAQ,qBAAqB,MAAM,QAAQ,cAAc,MAAM,QAAQ,qBAAqB;AAGpG;AAAA,YACD;AAAA,UACF;AAED,cAAI,uBAAuB,YAAY,MAAM;AAC3C,gBAAI,gBAAgB;AAEpB,gBAAI;AACF,8BAAgB,KAAK;AAErB,oBAAM,2XAAwa,0BAA0B,KAAK,CAAC;AAAA,YACtd,UAAgB;AACR,kBAAI,eAAe;AACjB,gCAAgB,KAAK;AAAA,cAC/B,OAAe;AACL;cACD;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACH;AAEA,eAAS,6CAA6CA,OAAM;AAC1D;AACE,cAAIA,MAAK,QAAQ,cAAc,2BAA0B,KAAM,uBAAuB,YAAY,MAAM;AACtG,kBAAM,2ZAA6c;AAAA,UACpd;AAAA,QACF;AAAA,MACH;AAEA,eAAS,4BAA4B,WAAW;AAC9C;AACE,qCAA2B;AAAA,QAC5B;AAAA,MACH;AAGA,UAAI,gBAAgB;AAEpB,UAAI,mBAAmB;AACvB,UAAI,oBAAoB,SAAU,SAAS;AACzC;AACE,0BAAgB;AAAA,QACjB;AAAA,MACH;AACA,eAAS,+BAA+B,MAAM;AAC5C;AACE,cAAI,kBAAkB,MAAM;AAE1B,mBAAO;AAAA,UACR;AAED,cAAI,SAAS,cAAc,IAAI;AAE/B,cAAI,WAAW,QAAW;AACxB,mBAAO;AAAA,UACR;AAGD,iBAAO,OAAO;AAAA,QACf;AAAA,MACH;AACA,eAAS,4BAA4B,MAAM;AAEzC,eAAO,+BAA+B,IAAI;AAAA,MAC5C;AACA,eAAS,iCAAiC,MAAM;AAC9C;AACE,cAAI,kBAAkB,MAAM;AAE1B,mBAAO;AAAA,UACR;AAED,cAAI,SAAS,cAAc,IAAI;AAE/B,cAAI,WAAW,QAAW;AAExB,gBAAI,SAAS,QAAQ,SAAS,UAAa,OAAO,KAAK,WAAW,YAAY;AAI5E,kBAAI,gBAAgB,+BAA+B,KAAK,MAAM;AAE9D,kBAAI,KAAK,WAAW,eAAe;AACjC,oBAAI,gBAAgB;AAAA,kBAClB,UAAU;AAAA,kBACV,QAAQ;AAAA,gBACpB;AAEU,oBAAI,KAAK,gBAAgB,QAAW;AAClC,gCAAc,cAAc,KAAK;AAAA,gBAClC;AAED,uBAAO;AAAA,cACR;AAAA,YACF;AAED,mBAAO;AAAA,UACR;AAGD,iBAAO,OAAO;AAAA,QACf;AAAA,MACH;AACA,eAAS,kCAAkC,OAAO,SAAS;AACzD;AACE,cAAI,kBAAkB,MAAM;AAE1B,mBAAO;AAAA,UACR;AAED,cAAI,WAAW,MAAM;AACrB,cAAI,WAAW,QAAQ;AAEvB,cAAI,uBAAuB;AAC3B,cAAI,mBAAmB,OAAO,aAAa,YAAY,aAAa,OAAO,SAAS,WAAW;AAE/F,kBAAQ,MAAM,KAAG;AAAA,YACf,KAAK,gBACH;AACE,kBAAI,OAAO,aAAa,YAAY;AAClC,uCAAuB;AAAA,cACxB;AAED;AAAA,YACD;AAAA,YAEH,KAAK,mBACH;AACE,kBAAI,OAAO,aAAa,YAAY;AAClC,uCAAuB;AAAA,cACnC,WAAqB,qBAAqB,iBAAiB;AAK/C,uCAAuB;AAAA,cACxB;AAED;AAAA,YACD;AAAA,YAEH,KAAK,YACH;AACE,kBAAI,qBAAqB,wBAAwB;AAC/C,uCAAuB;AAAA,cACnC,WAAqB,qBAAqB,iBAAiB;AAC/C,uCAAuB;AAAA,cACxB;AAED;AAAA,YACD;AAAA,YAEH,KAAK;AAAA,YACL,KAAK,qBACH;AACE,kBAAI,qBAAqB,iBAAiB;AAGxC,uCAAuB;AAAA,cACnC,WAAqB,qBAAqB,iBAAiB;AAC/C,uCAAuB;AAAA,cACxB;AAED;AAAA,YACD;AAAA,YAEH;AACE,qBAAO;AAAA,UACV;AAGD,cAAI,sBAAsB;AAMxB,gBAAI,aAAa,cAAc,QAAQ;AAEvC,gBAAI,eAAe,UAAa,eAAe,cAAc,QAAQ,GAAG;AACtE,qBAAO;AAAA,YACR;AAAA,UACF;AAED,iBAAO;AAAA,QACR;AAAA,MACH;AACA,eAAS,uCAAuC,OAAO;AACrD;AACE,cAAI,kBAAkB,MAAM;AAE1B;AAAA,UACD;AAED,cAAI,OAAO,YAAY,YAAY;AACjC;AAAA,UACD;AAED,cAAI,qBAAqB,MAAM;AAC7B,+BAAmB,oBAAI;UACxB;AAED,2BAAiB,IAAI,KAAK;AAAA,QAC3B;AAAA,MACH;AACA,UAAI,kBAAkB,SAAUA,OAAM,QAAQ;AAC5C;AACE,cAAI,kBAAkB,MAAM;AAE1B;AAAA,UACD;AAED,cAAI,gBAAgB,OAAO,eACvB,kBAAkB,OAAO;AAC7B;AACA,oBAAU,WAAY;AACpB,kDAAsCA,MAAK,SAAS,iBAAiB,aAAa;AAAA,UACxF,CAAK;AAAA,QACF;AAAA,MACH;AACA,UAAI,eAAe,SAAUA,OAAM,SAAS;AAC1C;AACE,cAAIA,MAAK,YAAY,oBAAoB;AAIvC;AAAA,UACD;AAED;AACA,oBAAU,WAAY;AACpB,4BAAgB,SAASA,OAAM,MAAM,IAAI;AAAA,UAC/C,CAAK;AAAA,QACF;AAAA,MACH;AAEA,eAAS,sCAAsC,OAAO,iBAAiB,eAAe;AACpF;AACE,cAAI,YAAY,MAAM,WAClB,QAAQ,MAAM,OACd,UAAU,MAAM,SAChB,MAAM,MAAM,KACZ,OAAO,MAAM;AACjB,cAAI,gBAAgB;AAEpB,kBAAQ,KAAG;AAAA,YACT,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AACH,8BAAgB;AAChB;AAAA,YAEF,KAAK;AACH,8BAAgB,KAAK;AACrB;AAAA,UACH;AAED,cAAI,kBAAkB,MAAM;AAC1B,kBAAM,IAAI,MAAM,qDAAqD;AAAA,UACtE;AAED,cAAI,cAAc;AAClB,cAAI,eAAe;AAEnB,cAAI,kBAAkB,MAAM;AAC1B,gBAAI,SAAS,cAAc,aAAa;AAExC,gBAAI,WAAW,QAAW;AACxB,kBAAI,cAAc,IAAI,MAAM,GAAG;AAC7B,+BAAe;AAAA,cAChB,WAAU,gBAAgB,IAAI,MAAM,GAAG;AACtC,oBAAI,QAAQ,gBAAgB;AAC1B,iCAAe;AAAA,gBAC3B,OAAiB;AACL,gCAAc;AAAA,gBACf;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAED,cAAI,qBAAqB,MAAM;AAC7B,gBAAI,iBAAiB,IAAI,KAAK,KAAK,cAAc,QAAQ,iBAAiB,IAAI,SAAS,GAAG;AACxF,6BAAe;AAAA,YAChB;AAAA,UACF;AAED,cAAI,cAAc;AAChB,kBAAM,qBAAqB;AAAA,UAC5B;AAED,cAAI,gBAAgB,aAAa;AAC/B,gBAAI,QAAQ,+BAA+B,OAAO,QAAQ;AAE1D,gBAAI,UAAU,MAAM;AAClB,oCAAsB,OAAO,OAAO,UAAU,WAAW;AAAA,YAC1D;AAAA,UACF;AAED,cAAI,UAAU,QAAQ,CAAC,cAAc;AACnC,kDAAsC,OAAO,iBAAiB,aAAa;AAAA,UAC5E;AAED,cAAI,YAAY,MAAM;AACpB,kDAAsC,SAAS,iBAAiB,aAAa;AAAA,UAC9E;AAAA,QACF;AAAA,MACH;AAEA,UAAI,8BAA8B,SAAUA,OAAM,UAAU;AAC1D;AACE,cAAI,gBAAgB,oBAAI;AACxB,cAAIrG,SAAQ,IAAI,IAAI,SAAS,IAAI,SAAU,QAAQ;AACjD,mBAAO,OAAO;AAAA,UACf,CAAA,CAAC;AACF,wDAA8CqG,MAAK,SAASrG,QAAO,aAAa;AAChF,iBAAO;AAAA,QACR;AAAA,MACH;AAEA,eAAS,8CAA8C,OAAOA,QAAO,eAAe;AAClF;AACE,cAAI,QAAQ,MAAM,OACd,UAAU,MAAM,SAChB,MAAM,MAAM,KACZ,OAAO,MAAM;AACjB,cAAI,gBAAgB;AAEpB,kBAAQ,KAAG;AAAA,YACT,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AACH,8BAAgB;AAChB;AAAA,YAEF,KAAK;AACH,8BAAgB,KAAK;AACrB;AAAA,UACH;AAED,cAAI,WAAW;AAEf,cAAI,kBAAkB,MAAM;AAC1B,gBAAIA,OAAM,IAAI,aAAa,GAAG;AAC5B,yBAAW;AAAA,YACZ;AAAA,UACF;AAED,cAAI,UAAU;AAIZ,+CAAmC,OAAO,aAAa;AAAA,UAC7D,OAAW;AAEL,gBAAI,UAAU,MAAM;AAClB,4DAA8C,OAAOA,QAAO,aAAa;AAAA,YAC1E;AAAA,UACF;AAED,cAAI,YAAY,MAAM;AACpB,0DAA8C,SAASA,QAAO,aAAa;AAAA,UAC5E;AAAA,QACF;AAAA,MACH;AAEA,eAAS,mCAAmC,OAAO,eAAe;AAChE;AACE,cAAI,qBAAqB,wCAAwC,OAAO,aAAa;AAErF,cAAI,oBAAoB;AACtB;AAAA,UACD;AAGD,cAAI,OAAO;AAEX,iBAAO,MAAM;AACX,oBAAQ,KAAK,KAAG;AAAA,cACd,KAAK;AACH,8BAAc,IAAI,KAAK,SAAS;AAChC;AAAA,cAEF,KAAK;AACH,8BAAc,IAAI,KAAK,UAAU,aAAa;AAC9C;AAAA,cAEF,KAAK;AACH,8BAAc,IAAI,KAAK,UAAU,aAAa;AAC9C;AAAA,YACH;AAED,gBAAI,KAAK,WAAW,MAAM;AACxB,oBAAM,IAAI,MAAM,+BAA+B;AAAA,YAChD;AAED,mBAAO,KAAK;AAAA,UACb;AAAA,QACF;AAAA,MACH;AAEA,eAAS,wCAAwC,OAAO,eAAe;AACrE;AACE,cAAI,OAAO;AACX,cAAI,qBAAqB;AAEzB,iBAAO,MAAM;AACX,gBAAI,KAAK,QAAQ,eAAe;AAE9B,mCAAqB;AACrB,4BAAc,IAAI,KAAK,SAAS;AAAA,YACxC,WAAiB,KAAK,UAAU,MAAM;AAC9B,mBAAK,MAAM,SAAS;AACpB,qBAAO,KAAK;AACZ;AAAA,YACD;AAED,gBAAI,SAAS,OAAO;AAClB,qBAAO;AAAA,YACR;AAED,mBAAO,KAAK,YAAY,MAAM;AAC5B,kBAAI,KAAK,WAAW,QAAQ,KAAK,WAAW,OAAO;AACjD,uBAAO;AAAA,cACR;AAED,qBAAO,KAAK;AAAA,YACb;AAED,iBAAK,QAAQ,SAAS,KAAK;AAC3B,mBAAO,KAAK;AAAA,UACb;AAAA,QACF;AAED,eAAO;AAAA,MACT;AAEA,UAAI;AAEJ;AACE,4BAAoB;AAEpB,YAAI;AACF,cAAI,sBAAsB,OAAO,kBAAkB,CAAE,CAAA;AAGrD,8BAAI,IAAI,CAAC,CAAC,qBAAqB,IAAI,CAAC,CAAC;AACrC,8BAAI,IAAI,CAAC,mBAAmB,CAAC;AAAA,QAE9B,SAAQlB,IAAG;AAEV,8BAAoB;AAAA,QACrB;AAAA,MACH;AAEA,eAAS,UAAU,KAAK,cAAc,KAAK,MAAM;AAE/C,aAAK,MAAM;AACX,aAAK,MAAM;AACX,aAAK,cAAc;AACnB,aAAK,OAAO;AACZ,aAAK,YAAY;AAEjB,aAAK,SAAS;AACd,aAAK,QAAQ;AACb,aAAK,UAAU;AACf,aAAK,QAAQ;AACb,aAAK,MAAM;AACX,aAAK,eAAe;AACpB,aAAK,gBAAgB;AACrB,aAAK,cAAc;AACnB,aAAK,gBAAgB;AACrB,aAAK,eAAe;AACpB,aAAK,OAAO;AAEZ,aAAK,QAAQ;AACb,aAAK,eAAe;AACpB,aAAK,YAAY;AACjB,aAAK,QAAQ;AACb,aAAK,aAAa;AAClB,aAAK,YAAY;AAEjB;AAaE,eAAK,iBAAiB,OAAO;AAC7B,eAAK,kBAAkB,OAAO;AAC9B,eAAK,mBAAmB,OAAO;AAC/B,eAAK,mBAAmB,OAAO;AAI/B,eAAK,iBAAiB;AACtB,eAAK,kBAAkB;AACvB,eAAK,mBAAmB;AACxB,eAAK,mBAAmB;AAAA,QACzB;AAED;AAEE,eAAK,eAAe;AACpB,eAAK,cAAc;AACnB,eAAK,qBAAqB;AAC1B,eAAK,kBAAkB;AAEvB,cAAI,CAAC,qBAAqB,OAAO,OAAO,sBAAsB,YAAY;AACxE,mBAAO,kBAAkB,IAAI;AAAA,UAC9B;AAAA,QACF;AAAA,MACH;AAeA,UAAI,cAAc,SAAU,KAAK,cAAc,KAAK,MAAM;AAExD,eAAO,IAAI,UAAU,KAAK,cAAc,KAAK,IAAI;AAAA,MACnD;AAEA,eAAS,kBAAkB,WAAW;AACpC,YAAI,YAAY,UAAU;AAC1B,eAAO,CAAC,EAAE,aAAa,UAAU;AAAA,MACnC;AAEA,eAAS,0BAA0B,MAAM;AACvC,eAAO,OAAO,SAAS,cAAc,CAAC,kBAAkB,IAAI,KAAK,KAAK,iBAAiB;AAAA,MACzF;AACA,eAAS,wBAAwB,WAAW;AAC1C,YAAI,OAAO,cAAc,YAAY;AACnC,iBAAO,kBAAkB,SAAS,IAAI,iBAAiB;AAAA,QACxD,WAAU,cAAc,UAAa,cAAc,MAAM;AACxD,cAAI,WAAW,UAAU;AAEzB,cAAI,aAAa,wBAAwB;AACvC,mBAAO;AAAA,UACR;AAED,cAAI,aAAa,iBAAiB;AAChC,mBAAO;AAAA,UACR;AAAA,QACF;AAED,eAAO;AAAA,MACT;AAEA,eAAS,qBAAqBsH,UAAS,cAAc;AACnD,YAAIT,kBAAiBS,SAAQ;AAE7B,YAAIT,oBAAmB,MAAM;AAM3B,UAAAA,kBAAiB,YAAYS,SAAQ,KAAK,cAAcA,SAAQ,KAAKA,SAAQ,IAAI;AACjF,UAAAT,gBAAe,cAAcS,SAAQ;AACrC,UAAAT,gBAAe,OAAOS,SAAQ;AAC9B,UAAAT,gBAAe,YAAYS,SAAQ;AAEnC;AAEE,YAAAT,gBAAe,eAAeS,SAAQ;AACtC,YAAAT,gBAAe,cAAcS,SAAQ;AACrC,YAAAT,gBAAe,kBAAkBS,SAAQ;AAAA,UAC1C;AAED,UAAAT,gBAAe,YAAYS;AAC3B,UAAAA,SAAQ,YAAYT;AAAA,QACxB,OAAS;AACL,UAAAA,gBAAe,eAAe;AAE9B,UAAAA,gBAAe,OAAOS,SAAQ;AAG9B,UAAAT,gBAAe,QAAQ;AAEvB,UAAAA,gBAAe,eAAe;AAC9B,UAAAA,gBAAe,YAAY;AAE3B;AAKE,YAAAA,gBAAe,iBAAiB;AAChC,YAAAA,gBAAe,kBAAkB;AAAA,UAClC;AAAA,QACF;AAID,QAAAA,gBAAe,QAAQS,SAAQ,QAAQ;AACvC,QAAAT,gBAAe,aAAaS,SAAQ;AACpC,QAAAT,gBAAe,QAAQS,SAAQ;AAC/B,QAAAT,gBAAe,QAAQS,SAAQ;AAC/B,QAAAT,gBAAe,gBAAgBS,SAAQ;AACvC,QAAAT,gBAAe,gBAAgBS,SAAQ;AACvC,QAAAT,gBAAe,cAAcS,SAAQ;AAGrC,YAAI,sBAAsBA,SAAQ;AAClC,QAAAT,gBAAe,eAAe,wBAAwB,OAAO,OAAO;AAAA,UAClE,OAAO,oBAAoB;AAAA,UAC3B,cAAc,oBAAoB;AAAA,QACtC;AAEE,QAAAA,gBAAe,UAAUS,SAAQ;AACjC,QAAAT,gBAAe,QAAQS,SAAQ;AAC/B,QAAAT,gBAAe,MAAMS,SAAQ;AAE7B;AACE,UAAAT,gBAAe,mBAAmBS,SAAQ;AAC1C,UAAAT,gBAAe,mBAAmBS,SAAQ;AAAA,QAC3C;AAED;AACE,UAAAT,gBAAe,qBAAqBS,SAAQ;AAE5C,kBAAQT,gBAAe,KAAG;AAAA,YACxB,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AACH,cAAAA,gBAAe,OAAO,+BAA+BS,SAAQ,IAAI;AACjE;AAAA,YAEF,KAAK;AACH,cAAAT,gBAAe,OAAO,4BAA4BS,SAAQ,IAAI;AAC9D;AAAA,YAEF,KAAK;AACH,cAAAT,gBAAe,OAAO,iCAAiCS,SAAQ,IAAI;AACnE;AAAA,UACH;AAAA,QACF;AAED,eAAOT;AAAA,MACT;AAEA,eAAS,oBAAoBA,iBAAgBW,cAAa;AASxD,QAAAX,gBAAe,SAAS,aAAa;AAErC,YAAIS,WAAUT,gBAAe;AAE7B,YAAIS,aAAY,MAAM;AAEpB,UAAAT,gBAAe,aAAa;AAC5B,UAAAA,gBAAe,QAAQW;AACvB,UAAAX,gBAAe,QAAQ;AACvB,UAAAA,gBAAe,eAAe;AAC9B,UAAAA,gBAAe,gBAAgB;AAC/B,UAAAA,gBAAe,gBAAgB;AAC/B,UAAAA,gBAAe,cAAc;AAC7B,UAAAA,gBAAe,eAAe;AAC9B,UAAAA,gBAAe,YAAY;AAE3B;AAGE,YAAAA,gBAAe,mBAAmB;AAClC,YAAAA,gBAAe,mBAAmB;AAAA,UACnC;AAAA,QACL,OAAS;AAEL,UAAAA,gBAAe,aAAaS,SAAQ;AACpC,UAAAT,gBAAe,QAAQS,SAAQ;AAC/B,UAAAT,gBAAe,QAAQS,SAAQ;AAC/B,UAAAT,gBAAe,eAAe;AAC9B,UAAAA,gBAAe,YAAY;AAC3B,UAAAA,gBAAe,gBAAgBS,SAAQ;AACvC,UAAAT,gBAAe,gBAAgBS,SAAQ;AACvC,UAAAT,gBAAe,cAAcS,SAAQ;AAErC,UAAAT,gBAAe,OAAOS,SAAQ;AAG9B,cAAI,sBAAsBA,SAAQ;AAClC,UAAAT,gBAAe,eAAe,wBAAwB,OAAO,OAAO;AAAA,YAClE,OAAO,oBAAoB;AAAA,YAC3B,cAAc,oBAAoB;AAAA,UACxC;AAEI;AAGE,YAAAA,gBAAe,mBAAmBS,SAAQ;AAC1C,YAAAT,gBAAe,mBAAmBS,SAAQ;AAAA,UAC3C;AAAA,QACF;AAED,eAAOT;AAAA,MACT;AACA,eAAS,oBAAoB,KAAK,cAAc,oCAAoC;AAClF,YAAI;AAEJ,YAAI,QAAQ,gBAAgB;AAC1B,iBAAO;AAEP,cAAI,iBAAiB,MAAM;AACzB,oBAAQ;AAER;AACE,sBAAQ;AAAA,YACT;AAAA,UACF;AAAA,QACL,OAAS;AACL,iBAAO;AAAA,QACR;AAED,YAAK,mBAAmB;AAItB,kBAAQ;AAAA,QACT;AAED,eAAO,YAAY,UAAU,MAAM,MAAM,IAAI;AAAA,MAC/C;AACA,eAAS,4BAA4B,MACrC,KAAK,cAAc,OAAO,MAAM,OAAO;AACrC,YAAI,WAAW;AAEf,YAAI,eAAe;AAEnB,YAAI,OAAO,SAAS,YAAY;AAC9B,cAAI,kBAAkB,IAAI,GAAG;AAC3B,uBAAW;AAEX;AACE,6BAAe,4BAA4B,YAAY;AAAA,YACxD;AAAA,UACP,OAAW;AACL;AACE,6BAAe,+BAA+B,YAAY;AAAA,YAC3D;AAAA,UACF;AAAA,QACL,WAAa,OAAO,SAAS,UAAU;AACnC,qBAAW;AAAA,QACf,OAAS;AACL;AAAQ,oBAAQ,MAAI;AAAA,cAClB,KAAK;AACH,uBAAO,wBAAwB,aAAa,UAAU,MAAM,OAAO,GAAG;AAAA,cAExE,KAAK;AACH,2BAAW;AACX,wBAAQ;AAER,qBAAM,OAAO,oBAAoB,QAAQ;AAEvC,0BAAQ;AAAA,gBACT;AAED;AAAA,cAEF,KAAK;AACH,uBAAO,wBAAwB,cAAc,MAAM,OAAO,GAAG;AAAA,cAE/D,KAAK;AACH,uBAAO,wBAAwB,cAAc,MAAM,OAAO,GAAG;AAAA,cAE/D,KAAK;AACH,uBAAO,4BAA4B,cAAc,MAAM,OAAO,GAAG;AAAA,cAEnE,KAAK;AACH,uBAAO,yBAAyB,cAAc,MAAM,OAAO,GAAG;AAAA,cAEhE,KAAK;AAAA,cAIL,KAAK;AAAA,cAIL,KAAK;AAAA,cAIL,KAAK;AAAA,cAIL,KAAK;AAAA,cAIL,SACE;AACE,oBAAI,OAAO,SAAS,YAAY,SAAS,MAAM;AAC7C,0BAAQ,KAAK,UAAQ;AAAA,oBACnB,KAAK;AACH,iCAAWJ;AACX,4BAAM;AAAA,oBAER,KAAK;AAEH,iCAAW;AACX,4BAAM;AAAA,oBAER,KAAK;AACH,iCAAW;AAEX;AACE,uCAAe,iCAAiC,YAAY;AAAA,sBAC7D;AAED,4BAAM;AAAA,oBAER,KAAK;AACH,iCAAW;AACX,4BAAM;AAAA,oBAER,KAAK;AACH,iCAAW;AACX,qCAAe;AACf,4BAAM;AAAA,kBACT;AAAA,gBACF;AAED,oBAAI,OAAO;AAEX;AACE,sBAAI,SAAS,UAAa,OAAO,SAAS,YAAY,SAAS,QAAQ,OAAO,KAAK,IAAI,EAAE,WAAW,GAAG;AACrG,4BAAQ;AAAA,kBACT;AAED,sBAAI,YAAY,QAAQ,0BAA0B,KAAK,IAAI;AAE3D,sBAAI,WAAW;AACb,4BAAQ,qCAAqC,YAAY;AAAA,kBAC1D;AAAA,gBACF;AAED,sBAAM,IAAI,MAAM,0HAA+H,eAAe,QAAQ,OAAO,OAAO,OAAO,QAAQ,MAAM,KAAK;AAAA,cAC/M;AAAA,YACJ;AAAA,QACF;AAED,YAAI,QAAQ,YAAY,UAAU,cAAc,KAAK,IAAI;AACzD,cAAM,cAAc;AACpB,cAAM,OAAO;AACb,cAAM,QAAQ;AAEd;AACE,gBAAM,cAAc;AAAA,QACrB;AAED,eAAO;AAAA,MACT;AACA,eAAS,uBAAuB,SAAS,MAAM,OAAO;AACpD,YAAI,QAAQ;AAEZ;AACE,kBAAQ,QAAQ;AAAA,QACjB;AAED,YAAI,OAAO,QAAQ;AACnB,YAAI,MAAM,QAAQ;AAClB,YAAI,eAAe,QAAQ;AAC3B,YAAI,QAAQ,4BAA4B,MAAM,KAAK,cAAc,OAAO,MAAM,KAAK;AAEnF;AACE,gBAAM,eAAe,QAAQ;AAC7B,gBAAM,cAAc,QAAQ;AAAA,QAC7B;AAED,eAAO;AAAA,MACT;AACA,eAAS,wBAAwB,UAAU,MAAM,OAAO,KAAK;AAC3D,YAAI,QAAQ,YAAY,UAAU,UAAU,KAAK,IAAI;AACrD,cAAM,QAAQ;AACd,eAAO;AAAA,MACT;AAEA,eAAS,wBAAwB,cAAc,MAAM,OAAO,KAAK;AAC/D;AACE,cAAI,OAAO,aAAa,OAAO,UAAU;AACvC,kBAAM,6FAA6F,OAAO,aAAa,EAAE;AAAA,UAC1H;AAAA,QACF;AAED,YAAI,QAAQ,YAAY,UAAU,cAAc,KAAK,OAAO,WAAW;AACvE,cAAM,cAAc;AACpB,cAAM,QAAQ;AAEd;AACE,gBAAM,YAAY;AAAA,YAChB,gBAAgB;AAAA,YAChB,uBAAuB;AAAA,UAC7B;AAAA,QACG;AAED,eAAO;AAAA,MACT;AAEA,eAAS,wBAAwB,cAAc,MAAM,OAAO,KAAK;AAC/D,YAAI,QAAQ,YAAY,mBAAmB,cAAc,KAAK,IAAI;AAClE,cAAM,cAAc;AACpB,cAAM,QAAQ;AACd,eAAO;AAAA,MACT;AACA,eAAS,4BAA4B,cAAc,MAAM,OAAO,KAAK;AACnE,YAAI,QAAQ,YAAY,uBAAuB,cAAc,KAAK,IAAI;AACtE,cAAM,cAAc;AACpB,cAAM,QAAQ;AACd,eAAO;AAAA,MACT;AACA,eAAS,yBAAyB,cAAc,MAAM,OAAO,KAAK;AAChE,YAAI,QAAQ,YAAY,oBAAoB,cAAc,KAAK,IAAI;AACnE,cAAM,cAAc;AACpB,cAAM,QAAQ;AACd,YAAI,uBAAuB;AAAA,UACzB,UAAU;AAAA,QACd;AACE,cAAM,YAAY;AAClB,eAAO;AAAA,MACT;AACA,eAAS,oBAAoB3C,UAAS,MAAM,OAAO;AACjD,YAAI,QAAQ,YAAY,UAAUA,UAAS,MAAM,IAAI;AACrD,cAAM,QAAQ;AACd,eAAO;AAAA,MACT;AACA,eAAS,yCAAyC;AAChD,YAAI,QAAQ,YAAY,eAAe,MAAM,MAAM,MAAM;AACzD,cAAM,cAAc;AACpB,eAAO;AAAA,MACT;AACA,eAAS,kCAAkC,gBAAgB;AACzD,YAAI,QAAQ,YAAY,oBAAoB,MAAM,MAAM,MAAM;AAC9D,cAAM,YAAY;AAClB,eAAO;AAAA,MACT;AACA,eAAS,sBAAsB,QAAQ,MAAM,OAAO;AAClD,YAAI,eAAe,OAAO,aAAa,OAAO,OAAO,WAAW;AAChE,YAAI,QAAQ,YAAY,YAAY,cAAc,OAAO,KAAK,IAAI;AAClE,cAAM,QAAQ;AACd,cAAM,YAAY;AAAA,UAChB,eAAe,OAAO;AAAA,UACtB,iBAAiB;AAAA;AAAA,UAEjB,gBAAgB,OAAO;AAAA,QAC3B;AACE,eAAO;AAAA,MACT;AAEA,eAAS,2BAA2B,QAAQ,QAAQ;AAClD,YAAI,WAAW,MAAM;AAGnB,mBAAS,YAAY,wBAAwB,MAAM,MAAM,MAAM;AAAA,QAChE;AAOD,eAAO,MAAM,OAAO;AACpB,eAAO,MAAM,OAAO;AACpB,eAAO,cAAc,OAAO;AAC5B,eAAO,OAAO,OAAO;AACrB,eAAO,YAAY,OAAO;AAC1B,eAAO,SAAS,OAAO;AACvB,eAAO,QAAQ,OAAO;AACtB,eAAO,UAAU,OAAO;AACxB,eAAO,QAAQ,OAAO;AACtB,eAAO,MAAM,OAAO;AACpB,eAAO,eAAe,OAAO;AAC7B,eAAO,gBAAgB,OAAO;AAC9B,eAAO,cAAc,OAAO;AAC5B,eAAO,gBAAgB,OAAO;AAC9B,eAAO,eAAe,OAAO;AAC7B,eAAO,OAAO,OAAO;AACrB,eAAO,QAAQ,OAAO;AACtB,eAAO,eAAe,OAAO;AAC7B,eAAO,YAAY,OAAO;AAC1B,eAAO,QAAQ,OAAO;AACtB,eAAO,aAAa,OAAO;AAC3B,eAAO,YAAY,OAAO;AAE1B;AACE,iBAAO,iBAAiB,OAAO;AAC/B,iBAAO,kBAAkB,OAAO;AAChC,iBAAO,mBAAmB,OAAO;AACjC,iBAAO,mBAAmB,OAAO;AAAA,QAClC;AAED,eAAO,eAAe,OAAO;AAC7B,eAAO,cAAc,OAAO;AAC5B,eAAO,qBAAqB,OAAO;AACnC,eAAO,kBAAkB,OAAO;AAChC,eAAO;AAAA,MACT;AAEA,eAAS,cAAc,eAAe,KAAKuE,UAAS,kBAAkB,oBAAoB;AACxF,aAAK,MAAM;AACX,aAAK,gBAAgB;AACrB,aAAK,kBAAkB;AACvB,aAAK,UAAU;AACf,aAAK,YAAY;AACjB,aAAK,eAAe;AACpB,aAAK,gBAAgB;AACrB,aAAK,UAAU;AACf,aAAK,iBAAiB;AACtB,aAAK,eAAe;AACpB,aAAK,mBAAmB;AACxB,aAAK,aAAa,cAAc,OAAO;AACvC,aAAK,kBAAkB,cAAc,WAAW;AAChD,aAAK,eAAe;AACpB,aAAK,iBAAiB;AACtB,aAAK,cAAc;AACnB,aAAK,eAAe;AACpB,aAAK,mBAAmB;AACxB,aAAK,gBAAgB;AACrB,aAAK,iBAAiB;AACtB,aAAK,gBAAgB,cAAc,OAAO;AAC1C,aAAK,mBAAmB;AACxB,aAAK,qBAAqB;AAE1B;AACE,eAAK,kCAAkC;AAAA,QACxC;AAED;AACE,eAAK,iBAAiB;AACtB,eAAK,wBAAwB;AAAA,QAC9B;AAED;AACE,eAAK,mBAAmB,oBAAI;AAC5B,cAAI,yBAAyB,KAAK,yBAAyB;AAE3D,mBAAS,KAAK,GAAG,KAAK,YAAY,MAAM;AACtC,mCAAuB,KAAK,oBAAI,IAAG,CAAE;AAAA,UACtC;AAAA,QACF;AAED;AACE,kBAAQ,KAAG;AAAA,YACT,KAAK;AACH,mBAAK,iBAAiBA,WAAU,kBAAkB;AAClD;AAAA,YAEF,KAAK;AACH,mBAAK,iBAAiBA,WAAU,cAAc;AAC9C;AAAA,UACH;AAAA,QACF;AAAA,MACH;AAEA,eAAS,gBAAgB,eAAe,KAAKA,UAAS,iBAAiB,oBAAoB,cAAc,oCAIzG,kBAAkB,oBAAoB,qBAAqB;AACzD,YAAId,QAAO,IAAI,cAAc,eAAe,KAAKc,UAAS,kBAAkB,kBAAkB;AAI9F,YAAI,qBAAqB,oBAAoB,KAAK,YAAY;AAC9D,QAAAd,MAAK,UAAU;AACf,2BAAmB,YAAYA;AAE/B;AACE,cAAI,gBAAgB;AAAA,YAClB,SAAS;AAAA,YACT,cAAcc;AAAA,YACd,OAAO;AAAA;AAAA,YAEP,aAAa;AAAA,YACb,2BAA2B;AAAA,UACjC;AACI,6BAAmB,gBAAgB;AAAA,QACpC;AAED,8BAAsB,kBAAkB;AACxC,eAAOd;AAAA,MACT;AAEA,UAAI,eAAe;AAEnB,eAAS,aAAa,UAAU,eAChC,gBAAgB;AACd,YAAI,MAAM,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AAE9E;AACE,iCAAuB,GAAG;AAAA,QAC3B;AAED,eAAO;AAAA;AAAA,UAEL,UAAU;AAAA,UACV,KAAK,OAAO,OAAO,OAAO,KAAK;AAAA,UAC/B;AAAA,UACA;AAAA,UACA;AAAA,QACJ;AAAA,MACA;AAEA,UAAI;AACJ,UAAI;AAEJ;AACE,oCAA4B;AAC5B,2CAAmC,CAAA;AAAA,MACrC;AAEA,eAAS,qBAAqB,iBAAiB;AAC7C,YAAI,CAAC,iBAAiB;AACpB,iBAAO;AAAA,QACR;AAED,YAAI,QAAQ,IAAI,eAAe;AAC/B,YAAI,gBAAgB,2BAA2B,KAAK;AAEpD,YAAI,MAAM,QAAQ,gBAAgB;AAChC,cAAI,YAAY,MAAM;AAEtB,cAAI,kBAAkB,SAAS,GAAG;AAChC,mBAAO,oBAAoB,OAAO,WAAW,aAAa;AAAA,UAC3D;AAAA,QACF;AAED,eAAO;AAAA,MACT;AAEA,eAAS,4BAA4B,WAAW,YAAY;AAC1D;AACE,cAAI,QAAQ,IAAI,SAAS;AAEzB,cAAI,UAAU,QAAW;AACvB,gBAAI,OAAO,UAAU,WAAW,YAAY;AAC1C,oBAAM,IAAI,MAAM,gDAAgD;AAAA,YACxE,OAAa;AACL,kBAAI,OAAO,OAAO,KAAK,SAAS,EAAE,KAAK,GAAG;AAC1C,oBAAM,IAAI,MAAM,wDAAwD,IAAI;AAAA,YAC7E;AAAA,UACF;AAED,cAAI,YAAY,qBAAqB,KAAK;AAE1C,cAAI,cAAc,MAAM;AACtB,mBAAO;AAAA,UACR;AAED,cAAI,UAAU,OAAO,kBAAkB;AACrC,gBAAI,gBAAgB,0BAA0B,KAAK,KAAK;AAExD,gBAAI,CAAC,iCAAiC,aAAa,GAAG;AACpD,+CAAiC,aAAa,IAAI;AAClD,kBAAI,gBAAgB;AAEpB,kBAAI;AACF,gCAAgB,SAAS;AAEzB,oBAAI,MAAM,OAAO,kBAAkB;AACjC,wBAAM,yPAA6Q,YAAY,YAAY,aAAa;AAAA,gBACpU,OAAiB;AACL,wBAAM,gQAAoR,YAAY,YAAY,aAAa;AAAA,gBAChU;AAAA,cACX,UAAkB;AAGR,oBAAI,eAAe;AACjB,kCAAgB,aAAa;AAAA,gBACzC,OAAiB;AACL;gBACD;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAED,iBAAO,UAAU;AAAA,QAClB;AAAA,MACH;AAEA,eAAS,gBAAgB,eAAe,KAAK,oBAAoB,cAAc,oCAAoC,kBAAkB,oBAAoB,qBAAqB;AAC5K,YAAIc,WAAU;AACd,YAAI,kBAAkB;AACtB,eAAO,gBAAgB,eAAe,KAAKA,UAAS,iBAAiB,oBAAoB,cAAc,oCAAoC,kBAAkB,kBAAkB;AAAA,MACjL;AACA,eAAS,yBAAyB,iBAClC,UAAU,eAAe,KAAK,oBAAoB,cAAc,oCAAoC,kBAAkB,oBAAoB,qBAAqB;AAC7J,YAAIA,WAAU;AACd,YAAId,QAAO,gBAAgB,eAAe,KAAKc,UAAS,iBAAiB,oBAAoB,cAAc,oCAAoC,kBAAkB,kBAAkB;AAEnL,QAAAd,MAAK,UAAU,qBAAqB,IAAI;AAOxC,YAAID,WAAUC,MAAK;AACnB,YAAI,YAAY;AAChB,YAAI,OAAO,kBAAkBD,QAAO;AACpC,YAAI,SAAS,aAAa,WAAW,IAAI;AACzC,eAAO,WAAW,aAAa,UAAa,aAAa,OAAO,WAAW;AAC3E,sBAAcA,UAAS,QAAQ,IAAI;AACnC,uCAA+BC,OAAM,MAAM,SAAS;AACpD,eAAOA;AAAA,MACT;AACA,eAAS,gBAAgB,SAAS,WAAW,iBAAiB,UAAU;AACtE;AACE,yBAAe,WAAW,OAAO;AAAA,QAClC;AAED,YAAI,YAAY,UAAU;AAC1B,YAAI,YAAY;AAChB,YAAI,OAAO,kBAAkB,SAAS;AAEtC;AACE,8BAAoB,IAAI;AAAA,QACzB;AAED,YAAI,UAAU,qBAAqB,eAAe;AAElD,YAAI,UAAU,YAAY,MAAM;AAC9B,oBAAU,UAAU;AAAA,QACxB,OAAS;AACL,oBAAU,iBAAiB;AAAA,QAC5B;AAED;AACE,cAAI,eAAe,YAAY,QAAQ,CAAC,2BAA2B;AACjE,wCAA4B;AAE5B,kBAAM,8NAA6O,0BAA0B,OAAO,KAAK,SAAS;AAAA,UACnS;AAAA,QACF;AAED,YAAI,SAAS,aAAa,WAAW,IAAI;AAGzC,eAAO,UAAU;AAAA,UACf;AAAA,QACJ;AACE,mBAAW,aAAa,SAAY,OAAO;AAE3C,YAAI,aAAa,MAAM;AACrB;AACE,gBAAI,OAAO,aAAa,YAAY;AAClC,oBAAM,uGAA4G,QAAQ;AAAA,YAC3H;AAAA,UACF;AAED,iBAAO,WAAW;AAAA,QACnB;AAED,YAAIA,QAAO,cAAc,WAAW,QAAQ,IAAI;AAEhD,YAAIA,UAAS,MAAM;AACjB,gCAAsBA,OAAM,WAAW,MAAM,SAAS;AACtD,8BAAoBA,OAAM,WAAW,IAAI;AAAA,QAC1C;AAED,eAAO;AAAA,MACT;AACA,eAAS,sBAAsB,WAAW;AACxC,YAAI,iBAAiB,UAAU;AAE/B,YAAI,CAAC,eAAe,OAAO;AACzB,iBAAO;AAAA,QACR;AAED,gBAAQ,eAAe,MAAM,KAAG;AAAA,UAC9B,KAAK;AACH,mBAAO,kBAAkB,eAAe,MAAM,SAAS;AAAA,UAEzD;AACE,mBAAO,eAAe,MAAM;AAAA,QAC/B;AAAA,MACH;AACA,eAAS,8BAA8B,OAAO;AAC5C,gBAAQ,MAAM,KAAG;AAAA,UACf,KAAK,UACH;AACE,gBAAIA,QAAO,MAAM;AAEjB,gBAAI,iBAAiBA,KAAI,GAAG;AAE1B,kBAAI,QAAQ,+BAA+BA,KAAI;AAC/C,wBAAUA,OAAM,KAAK;AAAA,YACtB;AAED;AAAA,UACD;AAAA,UAEH,KAAK,mBACH;AACE,sBAAU,WAAY;AACpB,kBAAIA,QAAO,+BAA+B,OAAO,QAAQ;AAEzD,kBAAIA,UAAS,MAAM;AACjB,oBAAI,YAAY;AAChB,sCAAsBA,OAAM,OAAO,UAAU,SAAS;AAAA,cACvD;AAAA,YACX,CAAS;AAID,gBAAI,YAAY;AAChB,uCAA2B,OAAO,SAAS;AAC3C;AAAA,UACD;AAAA,QACJ;AAAA,MACH;AAEA,eAAS,kBAAkB,OAAO,WAAW;AAC3C,YAAI,gBAAgB,MAAM;AAE1B,YAAI,kBAAkB,QAAQ,cAAc,eAAe,MAAM;AAC/D,wBAAc,YAAY,mBAAmB,cAAc,WAAW,SAAS;AAAA,QAChF;AAAA,MACH;AAGA,eAAS,2BAA2B,OAAO,WAAW;AACpD,0BAAkB,OAAO,SAAS;AAClC,YAAI,YAAY,MAAM;AAEtB,YAAI,WAAW;AACb,4BAAkB,WAAW,SAAS;AAAA,QACvC;AAAA,MACH;AACA,eAAS,6BAA6B,OAAO;AAC3C,YAAI,MAAM,QAAQ,mBAAmB;AAKnC;AAAA,QACD;AAED,YAAI,OAAO;AACX,YAAIA,QAAO,+BAA+B,OAAO,IAAI;AAErD,YAAIA,UAAS,MAAM;AACjB,cAAI,YAAY;AAChB,gCAAsBA,OAAM,OAAO,MAAM,SAAS;AAAA,QACnD;AAED,mCAA2B,OAAO,IAAI;AAAA,MACxC;AACA,eAAS,oCAAoC,OAAO;AAClD,YAAI,MAAM,QAAQ,mBAAmB;AAGnC;AAAA,QACD;AAED,YAAI,OAAO,kBAAkB,KAAK;AAClC,YAAIA,QAAO,+BAA+B,OAAO,IAAI;AAErD,YAAIA,UAAS,MAAM;AACjB,cAAI,YAAY;AAChB,gCAAsBA,OAAM,OAAO,MAAM,SAAS;AAAA,QACnD;AAED,mCAA2B,OAAO,IAAI;AAAA,MACxC;AACA,eAAS,8BAA8B,OAAO;AAC5C,YAAI,YAAY,kCAAkC,KAAK;AAEvD,YAAI,cAAc,MAAM;AACtB,iBAAO;AAAA,QACR;AAED,eAAO,UAAU;AAAA,MACnB;AAEA,UAAI,kBAAkB,SAAU,OAAO;AACrC,eAAO;AAAA,MACT;AAEA,eAAS,YAAY,OAAO;AAC1B,eAAO,gBAAgB,KAAK;AAAA,MAC9B;AAEA,UAAI,oBAAoB,SAAU,OAAO;AACvC,eAAO;AAAA,MACT;AAEA,eAAS,cAAc,OAAO;AAC5B,eAAO,kBAAkB,KAAK;AAAA,MAChC;AACA,UAAI,oBAAoB;AACxB,UAAI,8BAA8B;AAClC,UAAI,8BAA8B;AAClC,UAAI,gBAAgB;AACpB,UAAI,0BAA0B;AAC9B,UAAI,0BAA0B;AAC9B,UAAI,iBAAiB;AACrB,UAAI,kBAAkB;AACtB,UAAI,qBAAqB;AAEzB;AACE,YAAI,qBAAqB,SAAU,KAAK,MAAMnH,QAAO;AACnD,cAAI,MAAM,KAAKA,MAAK;AACpB,cAAI,UAAU,QAAQ,GAAG,IAAI,IAAI,MAAK,IAAK,OAAO,IAAI,GAAG;AAEzD,cAAIA,SAAQ,MAAM,KAAK,QAAQ;AAC7B,gBAAI,QAAQ,OAAO,GAAG;AACpB,sBAAQ,OAAO,KAAK,CAAC;AAAA,YAC7B,OAAa;AACL,qBAAO,QAAQ,GAAG;AAAA,YACnB;AAED,mBAAO;AAAA,UACR;AAGD,kBAAQ,GAAG,IAAI,mBAAmB,IAAI,GAAG,GAAG,MAAMA,SAAQ,CAAC;AAC3D,iBAAO;AAAA,QACX;AAEE,YAAI,iBAAiB,SAAU,KAAK,MAAM;AACxC,iBAAO,mBAAmB,KAAK,MAAM,CAAC;AAAA,QAC1C;AAEE,YAAI,qBAAqB,SAAU,KAAK,SAAS,SAASA,QAAO;AAC/D,cAAI,SAAS,QAAQA,MAAK;AAC1B,cAAI,UAAU,QAAQ,GAAG,IAAI,IAAI,MAAK,IAAK,OAAO,IAAI,GAAG;AAEzD,cAAIA,SAAQ,MAAM,QAAQ,QAAQ;AAChC,gBAAI,SAAS,QAAQA,MAAK;AAE1B,oBAAQ,MAAM,IAAI,QAAQ,MAAM;AAEhC,gBAAI,QAAQ,OAAO,GAAG;AACpB,sBAAQ,OAAO,QAAQ,CAAC;AAAA,YAChC,OAAa;AACL,qBAAO,QAAQ,MAAM;AAAA,YACtB;AAAA,UACP,OAAW;AAEL,oBAAQ,MAAM,IAAI;AAAA;AAAA,cAClB,IAAI,MAAM;AAAA,cAAG;AAAA,cAAS;AAAA,cAASA,SAAQ;AAAA,YAAC;AAAA,UACzC;AAED,iBAAO;AAAA,QACX;AAEE,YAAI,iBAAiB,SAAU,KAAK,SAAS,SAAS;AACpD,cAAI,QAAQ,WAAW,QAAQ,QAAQ;AACrC,iBAAK,mDAAmD;AAExD;AAAA,UACN,OAAW;AACL,qBAASD,KAAI,GAAGA,KAAI,QAAQ,SAAS,GAAGA,MAAK;AAC3C,kBAAI,QAAQA,EAAC,MAAM,QAAQA,EAAC,GAAG;AAC7B,qBAAK,0EAA0E;AAE/E;AAAA,cACD;AAAA,YACF;AAAA,UACF;AAED,iBAAO,mBAAmB,KAAK,SAAS,SAAS,CAAC;AAAA,QACtD;AAEE,YAAI,kBAAkB,SAAU,KAAK,MAAMC,QAAO,OAAO;AACvD,cAAIA,UAAS,KAAK,QAAQ;AACxB,mBAAO;AAAA,UACR;AAED,cAAI,MAAM,KAAKA,MAAK;AACpB,cAAI,UAAU,QAAQ,GAAG,IAAI,IAAI,MAAK,IAAK,OAAO,IAAI,GAAG;AAEzD,kBAAQ,GAAG,IAAI,gBAAgB,IAAI,GAAG,GAAG,MAAMA,SAAQ,GAAG,KAAK;AAC/D,iBAAO;AAAA,QACX;AAEE,YAAI,cAAc,SAAU,KAAK,MAAM,OAAO;AAC5C,iBAAO,gBAAgB,KAAK,MAAM,GAAG,KAAK;AAAA,QAC9C;AAEE,YAAI,WAAW,SAAU,OAAO,IAAI;AAGlC,cAAIkI,eAAc,MAAM;AAExB,iBAAOA,iBAAgB,QAAQ,KAAK,GAAG;AACrC,YAAAA,eAAcA,aAAY;AAC1B;AAAA,UACD;AAED,iBAAOA;AAAA,QACX;AAGE,4BAAoB,SAAU,OAAO,IAAI,MAAM,OAAO;AACpD,cAAI,OAAO,SAAS,OAAO,EAAE;AAE7B,cAAI,SAAS,MAAM;AACjB,gBAAI,WAAW,YAAY,KAAK,eAAe,MAAM,KAAK;AAC1D,iBAAK,gBAAgB;AACrB,iBAAK,YAAY;AAMjB,kBAAM,gBAAgB,OAAO,CAAE,GAAE,MAAM,aAAa;AACpD,gBAAIf,QAAO,+BAA+B,OAAO,QAAQ;AAEzD,gBAAIA,UAAS,MAAM;AACjB,oCAAsBA,OAAM,OAAO,UAAU,WAAW;AAAA,YACzD;AAAA,UACF;AAAA,QACL;AAEE,sCAA8B,SAAU,OAAO,IAAI,MAAM;AACvD,cAAI,OAAO,SAAS,OAAO,EAAE;AAE7B,cAAI,SAAS,MAAM;AACjB,gBAAI,WAAW,eAAe,KAAK,eAAe,IAAI;AACtD,iBAAK,gBAAgB;AACrB,iBAAK,YAAY;AAMjB,kBAAM,gBAAgB,OAAO,CAAE,GAAE,MAAM,aAAa;AACpD,gBAAIA,QAAO,+BAA+B,OAAO,QAAQ;AAEzD,gBAAIA,UAAS,MAAM;AACjB,oCAAsBA,OAAM,OAAO,UAAU,WAAW;AAAA,YACzD;AAAA,UACF;AAAA,QACL;AAEE,sCAA8B,SAAU,OAAO,IAAI,SAAS,SAAS;AACnE,cAAI,OAAO,SAAS,OAAO,EAAE;AAE7B,cAAI,SAAS,MAAM;AACjB,gBAAI,WAAW,eAAe,KAAK,eAAe,SAAS,OAAO;AAClE,iBAAK,gBAAgB;AACrB,iBAAK,YAAY;AAMjB,kBAAM,gBAAgB,OAAO,CAAE,GAAE,MAAM,aAAa;AACpD,gBAAIA,QAAO,+BAA+B,OAAO,QAAQ;AAEzD,gBAAIA,UAAS,MAAM;AACjB,oCAAsBA,OAAM,OAAO,UAAU,WAAW;AAAA,YACzD;AAAA,UACF;AAAA,QACL;AAGE,wBAAgB,SAAU,OAAO,MAAM,OAAO;AAC5C,gBAAM,eAAe,YAAY,MAAM,eAAe,MAAM,KAAK;AAEjE,cAAI,MAAM,WAAW;AACnB,kBAAM,UAAU,eAAe,MAAM;AAAA,UACtC;AAED,cAAIA,QAAO,+BAA+B,OAAO,QAAQ;AAEzD,cAAIA,UAAS,MAAM;AACjB,kCAAsBA,OAAM,OAAO,UAAU,WAAW;AAAA,UACzD;AAAA,QACL;AAEE,kCAA0B,SAAU,OAAO,MAAM;AAC/C,gBAAM,eAAe,eAAe,MAAM,eAAe,IAAI;AAE7D,cAAI,MAAM,WAAW;AACnB,kBAAM,UAAU,eAAe,MAAM;AAAA,UACtC;AAED,cAAIA,QAAO,+BAA+B,OAAO,QAAQ;AAEzD,cAAIA,UAAS,MAAM;AACjB,kCAAsBA,OAAM,OAAO,UAAU,WAAW;AAAA,UACzD;AAAA,QACL;AAEE,kCAA0B,SAAU,OAAO,SAAS,SAAS;AAC3D,gBAAM,eAAe,eAAe,MAAM,eAAe,SAAS,OAAO;AAEzE,cAAI,MAAM,WAAW;AACnB,kBAAM,UAAU,eAAe,MAAM;AAAA,UACtC;AAED,cAAIA,QAAO,+BAA+B,OAAO,QAAQ;AAEzD,cAAIA,UAAS,MAAM;AACjB,kCAAsBA,OAAM,OAAO,UAAU,WAAW;AAAA,UACzD;AAAA,QACL;AAEE,yBAAiB,SAAU,OAAO;AAChC,cAAIA,QAAO,+BAA+B,OAAO,QAAQ;AAEzD,cAAIA,UAAS,MAAM;AACjB,kCAAsBA,OAAM,OAAO,UAAU,WAAW;AAAA,UACzD;AAAA,QACL;AAEE,0BAAkB,SAAU,oBAAoB;AAC9C,4BAAkB;AAAA,QACtB;AAEE,6BAAqB,SAAU,sBAAsB;AACnD,8BAAoB;AAAA,QACxB;AAAA,MACA;AAEA,eAAS,wBAAwB,OAAO;AACtC,YAAI,YAAY,qBAAqB,KAAK;AAE1C,YAAI,cAAc,MAAM;AACtB,iBAAO;AAAA,QACR;AAED,eAAO,UAAU;AAAA,MACnB;AAEA,eAAS,6BAA6B,UAAU;AAC9C,eAAO;AAAA,MACT;AAEA,eAAS,6BAA6B;AACpC,eAAO;AAAA,MACT;AAEA,eAAS,mBAAmB,gBAAgB;AAC1C,YAAI,0BAA0B,eAAe;AAC7C,YAAIgB,0BAAyB,qBAAqB;AAClD,eAAO,gBAAgB;AAAA,UACrB,YAAY,eAAe;AAAA,UAC3B,SAAS,eAAe;AAAA,UACxB,qBAAqB,eAAe;AAAA,UACpC,gBAAgB,eAAe;AAAA,UAC/B;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA,sBAAsBA;AAAA,UACtB;AAAA,UACA,yBAAyB,2BAA2B;AAAA;AAAA,UAEpD;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA;AAAA,UAEA,iBAAkB;AAAA;AAAA;AAAA,UAGlB,mBAAmB;AAAA,QACvB,CAAG;AAAA,MACH;AAIA,UAAI,4BAA4B,OAAO,gBAAgB;AAAA;AAAA;AAAA,QAEvD;AAAA,UAAc,SAAU/H,QAAO;AAG7B,gBAAQ,OAAO,EAAEA,MAAK;AAAA,MACxB;AAEA,eAAS,aAAa,cAAc;AAClC,aAAK,gBAAgB;AAAA,MACvB;AAEA,4BAAsB,UAAU,SAAS,aAAa,UAAU,SAAS,SAAU,UAAU;AAC3F,YAAI+G,QAAO,KAAK;AAEhB,YAAIA,UAAS,MAAM;AACjB,gBAAM,IAAI,MAAM,kCAAkC;AAAA,QACnD;AAED;AACE,cAAI,OAAO,UAAU,CAAC,MAAM,YAAY;AACtC,kBAAM,wJAA6J;AAAA,UACpK,WAAU,iBAAiB,UAAU,CAAC,CAAC,GAAG;AACzC,kBAAM,oJAAyJ;AAAA,UAChK,WAAU,OAAO,UAAU,CAAC,MAAM,aAAa;AAC9C,kBAAM,oFAAyF;AAAA,UAChG;AAED,cAAI,YAAYA,MAAK;AAErB,cAAI,UAAU,aAAa,cAAc;AACvC,gBAAI,eAAe,8BAA8BA,MAAK,OAAO;AAE7D,gBAAI,cAAc;AAChB,kBAAI,aAAa,eAAe,WAAW;AACzC,sBAAM,qNAAoO;AAAA,cAC3O;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAED,wBAAgB,UAAUA,OAAM,MAAM,IAAI;AAAA,MAC5C;AAEA,4BAAsB,UAAU,UAAU,aAAa,UAAU,UAAU,WAAY;AACrF;AACE,cAAI,OAAO,UAAU,CAAC,MAAM,YAAY;AACtC,kBAAM,gJAAqJ;AAAA,UAC5J;AAAA,QACF;AAED,YAAIA,QAAO,KAAK;AAEhB,YAAIA,UAAS,MAAM;AACjB,eAAK,gBAAgB;AACrB,cAAI,YAAYA,MAAK;AAErB;AACE,gBAAI,mBAAkB,GAAI;AACxB,oBAAM,kMAA4M;AAAA,YACnN;AAAA,UACF;AAED,oBAAU,WAAY;AACpB,4BAAgB,MAAMA,OAAM,MAAM,IAAI;AAAA,UAC5C,CAAK;AACD,gCAAsB,SAAS;AAAA,QAChC;AAAA,MACH;AAEA,eAAS,WAAW,WAAWN,UAAS;AACtC,YAAI,CAAC,iBAAiB,SAAS,GAAG;AAChC,gBAAM,IAAI,MAAM,yDAAyD;AAAA,QAC1E;AAED,qCAA6B,SAAS;AACtC,YAAI,eAAe;AACnB,YAAI,qCAAqC;AACzC,YAAI,mBAAmB;AACvB,YAAI,qBAAqB;AAGzB,YAAIA,aAAY,QAAQA,aAAY,QAAW;AAC7C;AACE,gBAAIA,SAAQ,SAAS;AACnB,mBAAK,uGAAuG;AAAA,YACpH,OAAa;AACL,kBAAI,OAAOA,aAAY,YAAYA,aAAY,QAAQA,SAAQ,aAAa,oBAAoB;AAC9F,sBAAM,2KAA+L;AAAA,cACtM;AAAA,YACF;AAAA,UACF;AAED,cAAIA,SAAQ,wBAAwB,MAAM;AACxC,2BAAe;AAAA,UAChB;AAED,cAAIA,SAAQ,qBAAqB,QAAW;AAC1C,+BAAmBA,SAAQ;AAAA,UAC5B;AAED,cAAIA,SAAQ,uBAAuB,QAAW;AAC5C,iCAAqBA,SAAQ;AAAA,UAC9B;AAED,cAAIA,SAAQ,wBAAwB,QAAW;AACvB,YAAAA,SAAQ;AAAA,UAC/B;AAAA,QACF;AAED,YAAIM,QAAO,gBAAgB,WAAW,gBAAgB,MAAM,cAAc,oCAAoC,kBAAkB,kBAAkB;AAClJ,4BAAoBA,MAAK,SAAS,SAAS;AAC3C,YAAI,uBAAuB,UAAU,aAAa,eAAe,UAAU,aAAa;AACxF,mCAA2B,oBAAoB;AAC/C,eAAO,IAAI,aAAaA,KAAI;AAAA,MAC9B;AAEA,eAAS,sBAAsB,cAAc;AAC3C,aAAK,gBAAgB;AAAA,MACvB;AAEA,eAAS,kBAAkB,QAAQ;AACjC,YAAI,QAAQ;AACV,uCAA6B,MAAM;AAAA,QACpC;AAAA,MACH;AAEA,4BAAsB,UAAU,6BAA6B;AAC7D,eAAS,YAAY,WAAW,iBAAiBN,UAAS;AACxD,YAAI,CAAC,iBAAiB,SAAS,GAAG;AAChC,gBAAM,IAAI,MAAM,0DAA0D;AAAA,QAC3E;AAED,qCAA6B,SAAS;AAEtC;AACE,cAAI,oBAAoB,QAAW;AACjC,kBAAM,oHAAyH;AAAA,UAChI;AAAA,QACF;AAID,YAAI,qBAAqBA,YAAW,OAAOA,WAAU;AAErD,YAAI,iBAAiBA,YAAW,QAAQA,SAAQ,mBAAmB;AACnE,YAAI,eAAe;AACnB,YAAI,qCAAqC;AACzC,YAAI,mBAAmB;AACvB,YAAI,qBAAqB;AAEzB,YAAIA,aAAY,QAAQA,aAAY,QAAW;AAC7C,cAAIA,SAAQ,wBAAwB,MAAM;AACxC,2BAAe;AAAA,UAChB;AAED,cAAIA,SAAQ,qBAAqB,QAAW;AAC1C,+BAAmBA,SAAQ;AAAA,UAC5B;AAED,cAAIA,SAAQ,uBAAuB,QAAW;AAC5C,iCAAqBA,SAAQ;AAAA,UAC9B;AAAA,QACF;AAED,YAAIM,QAAO,yBAAyB,iBAAiB,MAAM,WAAW,gBAAgB,oBAAoB,cAAc,oCAAoC,kBAAkB,kBAAkB;AAChM,4BAAoBA,MAAK,SAAS,SAAS;AAE3C,mCAA2B,SAAS;AAEpC,YAAI,gBAAgB;AAClB,mBAASpH,KAAI,GAAGA,KAAI,eAAe,QAAQA,MAAK;AAC9C,gBAAI,gBAAgB,eAAeA,EAAC;AACpC,8CAAkCoH,OAAM,aAAa;AAAA,UACtD;AAAA,QACF;AAED,eAAO,IAAI,sBAAsBA,KAAI;AAAA,MACvC;AACA,eAAS,iBAAiB,MAAM;AAC9B,eAAO,CAAC,EAAE,SAAS,KAAK,aAAa,gBAAgB,KAAK,aAAa,iBAAiB,KAAK,aAAa,0BAA0B,CAAC;AAAA,MACvI;AAGA,eAAS,uBAAuB,MAAM;AACpC,eAAO,CAAC,EAAE,SAAS,KAAK,aAAa,gBAAgB,KAAK,aAAa,iBAAiB,KAAK,aAAa,0BAA0B,KAAK,aAAa,gBAAgB,KAAK,cAAc;AAAA,MAC3L;AAEA,eAAS,6BAA6B,WAAW;AAC/C;AACE,cAAI,UAAU,aAAa,gBAAgB,UAAU,WAAW,UAAU,QAAQ,YAAa,MAAK,QAAQ;AAC1G,kBAAM,qQAAyR;AAAA,UAChS;AAED,cAAI,wBAAwB,SAAS,GAAG;AACtC,gBAAI,UAAU,qBAAqB;AACjC,oBAAM,oIAAyI;AAAA,YACvJ,OAAa;AACL,oBAAM,oMAA8M;AAAA,YACrN;AAAA,UACF;AAAA,QACF;AAAA,MACH;AAEA,UAAI,sBAAsB,qBAAqB;AAC/C,UAAI;AAEJ;AACE,iCAAyB,SAAU,WAAW;AAC5C,cAAI,UAAU,uBAAuB,UAAU,aAAa,cAAc;AACxE,gBAAI,eAAe,8BAA8B,UAAU,oBAAoB,OAAO;AAEtF,gBAAI,cAAc;AAChB,kBAAI,aAAa,eAAe,WAAW;AACzC,sBAAM,2NAA0O;AAAA,cACjP;AAAA,YACF;AAAA,UACF;AAED,cAAI,4BAA4B,CAAC,CAAC,UAAU;AAC5C,cAAI,SAAS,+BAA+B,SAAS;AACrD,cAAI,uBAAuB,CAAC,EAAE,UAAU,oBAAoB,MAAM;AAElE,cAAI,wBAAwB,CAAC,2BAA2B;AACtD,kBAAM,mQAAkR;AAAA,UACzR;AAED,cAAI,UAAU,aAAa,gBAAgB,UAAU,WAAW,UAAU,QAAQ,YAAa,MAAK,QAAQ;AAC1G,kBAAM,gRAAoS;AAAA,UAC3S;AAAA,QACL;AAAA,MACA;AAEA,eAAS,+BAA+B,WAAW;AACjD,YAAI,CAAC,WAAW;AACd,iBAAO;AAAA,QACR;AAED,YAAI,UAAU,aAAa,eAAe;AACxC,iBAAO,UAAU;AAAA,QACrB,OAAS;AACL,iBAAO,UAAU;AAAA,QAClB;AAAA,MACH;AAEA,eAAS,yBAAyB;AAAA,MAElC;AAEA,eAAS,iCAAiC,WAAW,iBAAiB,iBAAiB,UAAU,sBAAsB;AACrH,YAAI,sBAAsB;AACxB,cAAI,OAAO,aAAa,YAAY;AAClC,gBAAI,mBAAmB;AAEvB,uBAAW,WAAY;AACrB,kBAAI,WAAW,sBAAsBA,KAAI;AACzC,+BAAiB,KAAK,QAAQ;AAAA,YACtC;AAAA,UACK;AAED,cAAIA,QAAO;AAAA,YAAyB;AAAA,YAAiB;AAAA,YAAU;AAAA,YAAW;AAAA,YAAY;AAAA;AAAA,YACtF;AAAA;AAAA,YACA;AAAA;AAAA,YACA;AAAA;AAAA,YACA;AAAA,UAAsB;AACtB,oBAAU,sBAAsBA;AAChC,8BAAoBA,MAAK,SAAS,SAAS;AAC3C,cAAI,uBAAuB,UAAU,aAAa,eAAe,UAAU,aAAa;AACxF,qCAA2B,oBAAoB;AAC/C;AACA,iBAAOA;AAAA,QACX,OAAS;AAEL,cAAI;AAEJ,iBAAO,cAAc,UAAU,WAAW;AACxC,sBAAU,YAAY,WAAW;AAAA,UAClC;AAED,cAAI,OAAO,aAAa,YAAY;AAClC,gBAAI,oBAAoB;AAExB,uBAAW,WAAY;AACrB,kBAAI,WAAW,sBAAsB,KAAK;AAE1C,gCAAkB,KAAK,QAAQ;AAAA,YACvC;AAAA,UACK;AAED,cAAI,QAAQ;AAAA,YAAgB;AAAA,YAAW;AAAA,YAAY;AAAA;AAAA,YACnD;AAAA;AAAA,YACA;AAAA;AAAA,YACA;AAAA;AAAA,YACA;AAAA,UAAsB;AAEtB,oBAAU,sBAAsB;AAChC,8BAAoB,MAAM,SAAS,SAAS;AAE5C,cAAI,wBAAwB,UAAU,aAAa,eAAe,UAAU,aAAa;AAEzF,qCAA2B,qBAAqB;AAEhD,oBAAU,WAAY;AACpB,4BAAgB,iBAAiB,OAAO,iBAAiB,QAAQ;AAAA,UACvE,CAAK;AACD,iBAAO;AAAA,QACR;AAAA,MACH;AAEA,eAAS,wBAAwB,UAAU,YAAY;AACrD;AACE,cAAI,aAAa,QAAQ,OAAO,aAAa,YAAY;AACvD,kBAAM,mGAAwG,YAAY,QAAQ;AAAA,UACnI;AAAA,QACF;AAAA,MACH;AAEA,eAAS,iCAAiC,iBAAiB,UAAU,WAAW,cAAc,UAAU;AACtG;AACE,iCAAuB,SAAS;AAChC,kCAAwB,aAAa,SAAY,OAAO,UAAU,QAAQ;AAAA,QAC3E;AAED,YAAI,YAAY,UAAU;AAC1B,YAAIA;AAEJ,YAAI,CAAC,WAAW;AAEd,UAAAA,QAAO,iCAAiC,WAAW,UAAU,iBAAiB,UAAU,YAAY;AAAA,QACxG,OAAS;AACL,UAAAA,QAAO;AAEP,cAAI,OAAO,aAAa,YAAY;AAClC,gBAAI,mBAAmB;AAEvB,uBAAW,WAAY;AACrB,kBAAI,WAAW,sBAAsBA,KAAI;AACzC,+BAAiB,KAAK,QAAQ;AAAA,YACtC;AAAA,UACK;AAGD,0BAAgB,UAAUA,OAAM,iBAAiB,QAAQ;AAAA,QAC1D;AAED,eAAO,sBAAsBA,KAAI;AAAA,MACnC;AAEA,eAAS,YAAY,oBAAoB;AACvC;AACE,cAAI,QAAQ,oBAAoB;AAEhC,cAAI,UAAU,QAAQ,MAAM,cAAc,MAAM;AAC9C,gBAAI,0BAA0B,MAAM,UAAU;AAE9C,gBAAI,CAAC,yBAAyB;AAC5B,oBAAM,kRAAsS,yBAAyB,MAAM,IAAI,KAAK,aAAa;AAAA,YAClW;AAED,kBAAM,UAAU,2BAA2B;AAAA,UAC5C;AAAA,QACF;AAED,YAAI,sBAAsB,MAAM;AAC9B,iBAAO;AAAA,QACR;AAED,YAAI,mBAAmB,aAAa,cAAc;AAChD,iBAAO;AAAA,QACR;AAED;AACE,iBAAO,4BAA4B,oBAAoB,aAAa;AAAA,QACrE;AAAA,MACH;AACA,eAAS,QAAQ,SAAS,WAAW,UAAU;AAC7C;AACE,gBAAM,4NAA2O;AAAA,QAClP;AAED,YAAI,CAAC,uBAAuB,SAAS,GAAG;AACtC,gBAAM,IAAI,MAAM,wCAAwC;AAAA,QACzD;AAED;AACE,cAAI,eAAe,wBAAwB,SAAS,KAAK,UAAU,wBAAwB;AAE3F,cAAI,cAAc;AAChB,kBAAM,2LAAqM;AAAA,UAC5M;AAAA,QACF;AAGD,eAAO,iCAAiC,MAAM,SAAS,WAAW,MAAM,QAAQ;AAAA,MAClF;AACA,eAAS,OAAO,SAAS,WAAW,UAAU;AAC5C;AACE,gBAAM,0NAAyO;AAAA,QAChP;AAED,YAAI,CAAC,uBAAuB,SAAS,GAAG;AACtC,gBAAM,IAAI,MAAM,wCAAwC;AAAA,QACzD;AAED;AACE,cAAI,eAAe,wBAAwB,SAAS,KAAK,UAAU,wBAAwB;AAE3F,cAAI,cAAc;AAChB,kBAAM,+KAAyL;AAAA,UAChM;AAAA,QACF;AAED,eAAO,iCAAiC,MAAM,SAAS,WAAW,OAAO,QAAQ;AAAA,MACnF;AACA,eAAS,oCAAoC,iBAAiB,SAAS,eAAe,UAAU;AAC9F;AACE,gBAAM,yQAAwR;AAAA,QAC/R;AAED,YAAI,CAAC,uBAAuB,aAAa,GAAG;AAC1C,gBAAM,IAAI,MAAM,wCAAwC;AAAA,QACzD;AAED,YAAI,mBAAmB,QAAQ,CAAC,IAAI,eAAe,GAAG;AACpD,gBAAM,IAAI,MAAM,iDAAiD;AAAA,QAClE;AAED,eAAO,iCAAiC,iBAAiB,SAAS,eAAe,OAAO,QAAQ;AAAA,MAClG;AACA,eAAS,uBAAuB,WAAW;AACzC,YAAI,CAAC,uBAAuB,SAAS,GAAG;AACtC,gBAAM,IAAI,MAAM,qEAAqE;AAAA,QACtF;AAED;AACE,cAAI,eAAe,wBAAwB,SAAS,KAAK,UAAU,wBAAwB;AAE3F,cAAI,cAAc;AAChB,kBAAM,yLAA8L;AAAA,UACrM;AAAA,QACF;AAED,YAAI,UAAU,qBAAqB;AACjC;AACE,gBAAI,SAAS,+BAA+B,SAAS;AACrD,gBAAI,2BAA2B,UAAU,CAAC,oBAAoB,MAAM;AAEpE,gBAAI,0BAA0B;AAC5B,oBAAM,wGAA6G;AAAA,YACpH;AAAA,UACF;AAGD,oBAAU,WAAY;AACpB,6CAAiC,MAAM,MAAM,WAAW,OAAO,WAAY;AAEzE,wBAAU,sBAAsB;AAChC,oCAAsB,SAAS;AAAA,YACvC,CAAO;AAAA,UACP,CAAK;AAGD,iBAAO;AAAA,QACX,OAAS;AACL;AACE,gBAAI,UAAU,+BAA+B,SAAS;AAEtD,gBAAI,uBAAuB,CAAC,EAAE,WAAW,oBAAoB,OAAO;AAEpE,gBAAI,uBAAuB,UAAU,aAAa,gBAAgB,uBAAuB,UAAU,UAAU,KAAK,CAAC,CAAC,UAAU,WAAW;AAEzI,gBAAI,sBAAsB;AACxB,oBAAM,8HAAmI,uBAAuB,oFAAyF,qGAA0G;AAAA,YACpW;AAAA,UACF;AAED,iBAAO;AAAA,QACR;AAAA,MACH;AAEA,qCAA+B,6BAA6B;AAC5D,oCAA8B,4BAA4B;AAC1D,2CAAqC,mCAAmC;AACxE,kCAA4B,wBAAwB;AACpD,oCAA8B,eAAe;AAE7C;AACE,YAAI,OAAO,QAAQ;AAAA,QACnB,IAAI,aAAa,QAAQ,OAAO,IAAI,UAAU,YAAY,cAAc,OAAO,QAAQ;AAAA,QACvF,IAAI,aAAa,QAAQ,OAAO,IAAI,UAAU,UAAU,cAAc,OAAO,IAAI,UAAU,YAAY,YAAY;AACjH,gBAAM,6IAAkJ;AAAA,QACzJ;AAAA,MACH;AAEA,+BAAyB,wBAAwB;AACjD,gCAA0B,kBAAkB,iBAAiB,SAAS;AAEtE,eAAS,eAAe,UAAU,WAAW;AAC3C,YAAI,MAAM,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AAE9E,YAAI,CAAC,iBAAiB,SAAS,GAAG;AAChC,gBAAM,IAAI,MAAM,wCAAwC;AAAA,QACzD;AAID,eAAO,aAAa,UAAU,WAAW,MAAM,GAAG;AAAA,MACpD;AAEA,eAAS,2BAA2B,iBAAiB,SAAS,eAAe,UAAU;AACrF,eAAO,oCAAoC,iBAAiB,SAAS,eAAe,QAAQ;AAAA,MAC9F;AAEA,UAAI,YAAY;AAAA,QACd,uBAAuB;AAAA;AAAA;AAAA,QAGvB,QAAQ,CAAC,qBAAqB,qBAAqB,8BAA8B,qBAAqB,sBAAsB,gBAAgB;AAAA,MAC9I;AAEA,eAAS,aAAa,WAAWN,UAAS;AACxC;AACE,cAAI,CAAC,UAAU,yBAAyB,MAAQ;AAC9C,kBAAM,6HAAkI;AAAA,UACzI;AAAA,QACF;AAED,eAAO,WAAW,WAAWA,QAAO;AAAA,MACtC;AAEA,eAAS,cAAc,WAAW,iBAAiBA,UAAS;AAC1D;AACE,cAAI,CAAC,UAAU,yBAAyB,MAAQ;AAC9C,kBAAM,8HAAmI;AAAA,UAC1I;AAAA,QACF;AAED,eAAO,YAAY,WAAW,iBAAiBA,QAAO;AAAA,MACxD;AAKA,eAAS,YAAY,IAAI;AACvB;AACE,cAAI,mBAAkB,GAAI;AACxB,kBAAM,uKAAiL;AAAA,UACxL;AAAA,QACF;AAED,eAAO,UAAU,EAAE;AAAA,MACrB;AACA,UAAI,gBAAgB,mBAAmB;AAAA,QACrC,yBAAyB;AAAA,QACzB,YAAa;AAAA,QACb,SAAS;AAAA,QACT,qBAAqB;AAAA,MACvB,CAAC;AAED;AACE,YAAI,CAAC,iBAAiB,aAAa,OAAO,QAAQ,OAAO,MAAM;AAE7D,cAAI,UAAU,UAAU,QAAQ,QAAQ,IAAI,MAAM,UAAU,UAAU,QAAQ,MAAM,MAAM,MAAM,UAAU,UAAU,QAAQ,SAAS,IAAI,IAAI;AAC3I,gBAAI,WAAW,OAAO,SAAS;AAE/B,gBAAI,mBAAmB,KAAK,QAAQ,GAAG;AAErC,sBAAQ,KAAK,gHAA0H,aAAa,UAAU,kHAAuH,KAAK,kBAAkB;AAAA,YAC7S;AAAA,UACF;AAAA,QACF;AAAA,MACH;AAE0D,2BAAA,qDAAG;AACzC,2BAAA,eAAG;AACL,2BAAA,aAAG;AACF,2BAAA,cAAG;AACL,2BAAA,YAAG;AACL,2BAAA,UAAG;AACC,2BAAA,cAAG;AACR,2BAAA,SAAG;AACa,2BAAA,yBAAG;AACF,2BAAA,0BAAG;AACS,2BAAA,sCAAG;AAC/B,2BAAA,UAAG;AAElB,UACE,OAAO,mCAAmC,eAC1C,OAAO,+BAA+B,+BACpC,YACF;AACA,uCAA+B,2BAA2B,IAAI,MAAK,CAAE;AAAA,MACvE;AAAA,IAEA;EACA;ACxo6BO;AACLuB,aAAA,UAAiBzH;AAAAA,EACnB;;ACnCA,MAAIqC,MAAIrC;AAID;AACL,QAAIZ,MAAIiD,IAAE;wBACW,SAAS/C,IAAGoI,IAAG;AAClCtI,UAAE,wBAAwB;AAC1B,UAAI;AACF,eAAOiD,IAAE,WAAW/C,IAAGoI,EAAC;AAAA,MAC9B,UAAc;AACRtI,YAAE,wBAAwB;AAAA,MAC3B;AAAA,IACL;AACE,WAAA,cAAsB,SAASE,IAAGiD,IAAGmF,IAAG;AACtCtI,UAAE,wBAAwB;AAC1B,UAAI;AACF,eAAOiD,IAAE,YAAY/C,IAAGiD,IAAGmF,EAAC;AAAA,MAClC,UAAc;AACRtI,YAAE,wBAAwB;AAAA,MAC3B;AAAA,IACL;AAAA,EACA;;;;;;;;ACjBA,KAAC,WAAY;AAGZ,UAAI,SAAS,CAAE,EAAC;AAGhB,eAASuI,cAAa;AACrB,YAAI,UAAU,CAAA;AAEd,iBAASvI,KAAI,GAAGA,KAAI,UAAU,QAAQA,MAAK;AAC1C,cAAI,MAAM,UAAUA,EAAC;AACrB,cAAI,CAAC;AAAK;AAEV,cAAI,UAAU,OAAO;AAErB,cAAI,YAAY,YAAY,YAAY,UAAU;AACjD,oBAAQ,KAAK,GAAG;AAAA,UAChB,WAAU,MAAM,QAAQ,GAAG,GAAG;AAC9B,gBAAI,IAAI,QAAQ;AACf,kBAAI,QAAQuI,YAAW,MAAM,MAAM,GAAG;AACtC,kBAAI,OAAO;AACV,wBAAQ,KAAK,KAAK;AAAA,cAClB;AAAA,YACD;AAAA,UACL,WAAc,YAAY,UAAU;AAChC,gBAAI,IAAI,aAAa,OAAO,UAAU,YAAY,CAAC,IAAI,SAAS,SAAQ,EAAG,SAAS,eAAe,GAAG;AACrG,sBAAQ,KAAK,IAAI,SAAU,CAAA;AAC3B;AAAA,YACA;AAED,qBAAS,OAAO,KAAK;AACpB,kBAAI,OAAO,KAAK,KAAK,GAAG,KAAK,IAAI,GAAG,GAAG;AACtC,wBAAQ,KAAK,GAAG;AAAA,cAChB;AAAA,YACD;AAAA,UACD;AAAA,QACD;AAED,eAAO,QAAQ,KAAK,GAAG;AAAA,MACvB;AAED,UAAqC,OAAO,SAAS;AACpD,QAAAA,YAAW,UAAUA;AACrB,eAAA,UAAiBA;AAAA,MACnB,OAKQ;AACN,eAAO,aAAaA;AAAA,MACpB;AAAA,IACF;;;;;;;;;;;;;;;ACnDC,KAAC,WAAW;AAGX,UAAIC;AAGJ,UAAI,UAAU;AAGd,UAAI,mBAAmB;AAGvB,UAAI,kBAAkB,mEAClB,kBAAkB,uBAClB,+BAA+B;AAGnC,UAAI,iBAAiB;AAGrB,UAAI,mBAAmB;AAGvB,UAAI,cAAc;AAGlB,UAAI,kBAAkB,GAClB,kBAAkB,GAClB,qBAAqB;AAGzB,UAAI,uBAAuB,GACvB,yBAAyB;AAG7B,UAAI,iBAAiB,GACjB,qBAAqB,GACrB,wBAAwB,GACxB,kBAAkB,GAClB,wBAAwB,IACxB,oBAAoB,IACpB,0BAA0B,IAC1B,gBAAgB,KAChB,kBAAkB,KAClB,iBAAiB;AAGrB,UAAI,uBAAuB,IACvB,yBAAyB;AAG7B,UAAI,YAAY,KACZ,WAAW;AAGf,UAAI,mBAAmB,GACnB,gBAAgB,GAChB,kBAAkB;AAGtB,UAAI,WAAW,IAAI,GACf,mBAAmB,kBACnB,cAAc,uBACd,MAAM,IAAI;AAGd,UAAI,mBAAmB,YACnB,kBAAkB,mBAAmB,GACrC,wBAAwB,qBAAqB;AAGjD,UAAI,YAAY;AAAA,QACd,CAAC,OAAO,aAAa;AAAA,QACrB,CAAC,QAAQ,cAAc;AAAA,QACvB,CAAC,WAAW,kBAAkB;AAAA,QAC9B,CAAC,SAAS,eAAe;AAAA,QACzB,CAAC,cAAc,qBAAqB;AAAA,QACpC,CAAC,QAAQ,cAAc;AAAA,QACvB,CAAC,WAAW,iBAAiB;AAAA,QAC7B,CAAC,gBAAgB,uBAAuB;AAAA,QACxC,CAAC,SAAS,eAAe;AAAA,MAC7B;AAGE,UAAI,UAAU,sBACV,WAAW,kBACX,WAAW,0BACX,UAAU,oBACV,UAAU,iBACV,YAAY,yBACZ,WAAW,kBACX,UAAU,qBACV,SAAS,8BACT,SAAS,gBACT,YAAY,mBACZ,UAAU,iBACV,YAAY,mBACZ,aAAa,oBACb,WAAW,kBACX,YAAY,mBACZ,SAAS,gBACT,YAAY,mBACZ,YAAY,mBACZ,eAAe,sBACf,aAAa,oBACb,aAAa;AAEjB,UAAI,iBAAiB,wBACjB,cAAc,qBACd,aAAa,yBACb,aAAa,yBACb,UAAU,sBACV,WAAW,uBACX,WAAW,uBACX,WAAW,uBACX,kBAAkB,8BAClB,YAAY,wBACZ,YAAY;AAGhB,UAAI,uBAAuB,kBACvB,sBAAsB,sBACtB,wBAAwB;AAG5B,UAAI,gBAAgB,6BAChB,kBAAkB,YAClB,mBAAmB,OAAO,cAAc,MAAM,GAC9C,qBAAqB,OAAO,gBAAgB,MAAM;AAGtD,UAAI,WAAW,oBACX,aAAa,mBACb,gBAAgB;AAGpB,UAAI,eAAe,oDACf,gBAAgB,SAChB,aAAa;AAMjB,UAAI,eAAe,uBACf,kBAAkB,OAAO,aAAa,MAAM;AAGhD,UAAI,cAAc;AAGlB,UAAI,eAAe;AAGnB,UAAI,gBAAgB,6CAChB,gBAAgB,qCAChB,iBAAiB;AAGrB,UAAI,cAAc;AAYlB,UAAI,6BAA6B;AAGjC,UAAI,eAAe;AAMnB,UAAI,eAAe;AAGnB,UAAI,UAAU;AAGd,UAAI,aAAa;AAGjB,UAAI,aAAa;AAGjB,UAAI,eAAe;AAGnB,UAAI,YAAY;AAGhB,UAAI,WAAW;AAGf,UAAI,UAAU;AAGd,UAAI,YAAY;AAGhB,UAAI,oBAAoB;AAGxB,UAAI,gBAAgB,mBAChB,oBAAoB,mBACpB,wBAAwB,mBACxB,sBAAsB,mBACtB,eAAe,oBAAoB,wBAAwB,qBAC3D,iBAAiB,mBACjB,eAAe,6BACf,gBAAgB,wBAChB,iBAAiB,gDACjB,qBAAqB,mBACrB,eAAe,gKACf,eAAe,6BACf,aAAa,kBACb,eAAe,gBAAgB,iBAAiB,qBAAqB;AAGzE,UAAI,SAAS,QACT,WAAW,MAAM,gBAAgB,KACjC,UAAU,MAAM,eAAe,KAC/B,UAAU,MAAM,eAAe,KAC/B,WAAW,QACX,YAAY,MAAM,iBAAiB,KACnC,UAAU,MAAM,eAAe,KAC/B,SAAS,OAAO,gBAAgB,eAAe,WAAW,iBAAiB,eAAe,eAAe,KACzG,SAAS,4BACT,aAAa,QAAQ,UAAU,MAAM,SAAS,KAC9C,cAAc,OAAO,gBAAgB,KACrC,aAAa,mCACb,aAAa,sCACb,UAAU,MAAM,eAAe,KAC/B,QAAQ;AAGZ,UAAI,cAAc,QAAQ,UAAU,MAAM,SAAS,KAC/C,cAAc,QAAQ,UAAU,MAAM,SAAS,KAC/C,kBAAkB,QAAQ,SAAS,0BACnC,kBAAkB,QAAQ,SAAS,0BACnC,WAAW,aAAa,KACxB,WAAW,MAAM,aAAa,MAC9B,YAAY,QAAQ,QAAQ,QAAQ,CAAC,aAAa,YAAY,UAAU,EAAE,KAAK,GAAG,IAAI,MAAM,WAAW,WAAW,MAClH,aAAa,oDACb,aAAa,oDACb,QAAQ,WAAW,WAAW,WAC9B,UAAU,QAAQ,CAAC,WAAW,YAAY,UAAU,EAAE,KAAK,GAAG,IAAI,MAAM,OACxE,WAAW,QAAQ,CAAC,cAAc,UAAU,KAAK,SAAS,YAAY,YAAY,QAAQ,EAAE,KAAK,GAAG,IAAI;AAG5G,UAAI,SAAS,OAAO,QAAQ,GAAG;AAM/B,UAAI,cAAc,OAAO,SAAS,GAAG;AAGrC,UAAI,YAAY,OAAO,SAAS,QAAQ,SAAS,OAAO,WAAW,OAAO,GAAG;AAG7E,UAAI,gBAAgB,OAAO;AAAA,QACzB,UAAU,MAAM,UAAU,MAAM,kBAAkB,QAAQ,CAAC,SAAS,SAAS,GAAG,EAAE,KAAK,GAAG,IAAI;AAAA,QAC9F,cAAc,MAAM,kBAAkB,QAAQ,CAAC,SAAS,UAAU,aAAa,GAAG,EAAE,KAAK,GAAG,IAAI;AAAA,QAChG,UAAU,MAAM,cAAc,MAAM;AAAA,QACpC,UAAU,MAAM;AAAA,QAChB;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACD,EAAC,KAAK,GAAG,GAAG,GAAG;AAGhB,UAAI,eAAe,OAAO,MAAM,QAAQ,gBAAiB,eAAe,aAAa,GAAG;AAGxF,UAAI,mBAAmB;AAGvB,UAAI,eAAe;AAAA,QACjB;AAAA,QAAS;AAAA,QAAU;AAAA,QAAY;AAAA,QAAQ;AAAA,QAAS;AAAA,QAAgB;AAAA,QAChE;AAAA,QAAY;AAAA,QAAa;AAAA,QAAc;AAAA,QAAc;AAAA,QAAO;AAAA,QAAQ;AAAA,QACpE;AAAA,QAAW;AAAA,QAAU;AAAA,QAAO;AAAA,QAAU;AAAA,QAAU;AAAA,QAAa;AAAA,QAC7D;AAAA,QAAqB;AAAA,QAAe;AAAA,QAAe;AAAA,QACnD;AAAA,QAAK;AAAA,QAAgB;AAAA,QAAY;AAAA,QAAY;AAAA,MACjD;AAGE,UAAI,kBAAkB;AAGtB,UAAI,iBAAiB,CAAA;AACrB,qBAAe,UAAU,IAAI,eAAe,UAAU,IACtD,eAAe,OAAO,IAAI,eAAe,QAAQ,IACjD,eAAe,QAAQ,IAAI,eAAe,QAAQ,IAClD,eAAe,eAAe,IAAI,eAAe,SAAS,IAC1D,eAAe,SAAS,IAAI;AAC5B,qBAAe,OAAO,IAAI,eAAe,QAAQ,IACjD,eAAe,cAAc,IAAI,eAAe,OAAO,IACvD,eAAe,WAAW,IAAI,eAAe,OAAO,IACpD,eAAe,QAAQ,IAAI,eAAe,OAAO,IACjD,eAAe,MAAM,IAAI,eAAe,SAAS,IACjD,eAAe,SAAS,IAAI,eAAe,SAAS,IACpD,eAAe,MAAM,IAAI,eAAe,SAAS,IACjD,eAAe,UAAU,IAAI;AAG7B,UAAI,gBAAgB,CAAA;AACpB,oBAAc,OAAO,IAAI,cAAc,QAAQ,IAC/C,cAAc,cAAc,IAAI,cAAc,WAAW,IACzD,cAAc,OAAO,IAAI,cAAc,OAAO,IAC9C,cAAc,UAAU,IAAI,cAAc,UAAU,IACpD,cAAc,OAAO,IAAI,cAAc,QAAQ,IAC/C,cAAc,QAAQ,IAAI,cAAc,MAAM,IAC9C,cAAc,SAAS,IAAI,cAAc,SAAS,IAClD,cAAc,SAAS,IAAI,cAAc,MAAM,IAC/C,cAAc,SAAS,IAAI,cAAc,SAAS,IAClD,cAAc,QAAQ,IAAI,cAAc,eAAe,IACvD,cAAc,SAAS,IAAI,cAAc,SAAS,IAAI;AACtD,oBAAc,QAAQ,IAAI,cAAc,OAAO,IAC/C,cAAc,UAAU,IAAI;AAG5B,UAAI,kBAAkB;AAAA;AAAA,QAEpB,KAAQ;AAAA,QAAM,KAAQ;AAAA,QAAK,KAAQ;AAAA,QAAK,KAAQ;AAAA,QAAK,KAAQ;AAAA,QAAK,KAAQ;AAAA,QAC1E,KAAQ;AAAA,QAAM,KAAQ;AAAA,QAAK,KAAQ;AAAA,QAAK,KAAQ;AAAA,QAAK,KAAQ;AAAA,QAAK,KAAQ;AAAA,QAC1E,KAAQ;AAAA,QAAM,KAAQ;AAAA,QACtB,KAAQ;AAAA,QAAM,KAAQ;AAAA,QACtB,KAAQ;AAAA,QAAM,KAAQ;AAAA,QAAK,KAAQ;AAAA,QAAK,KAAQ;AAAA,QAChD,KAAQ;AAAA,QAAM,KAAQ;AAAA,QAAK,KAAQ;AAAA,QAAK,KAAQ;AAAA,QAChD,KAAQ;AAAA,QAAM,KAAQ;AAAA,QAAK,KAAQ;AAAA,QAAK,KAAQ;AAAA,QAChD,KAAQ;AAAA,QAAM,KAAQ;AAAA,QAAK,KAAQ;AAAA,QAAK,KAAQ;AAAA,QAChD,KAAQ;AAAA,QAAM,KAAQ;AAAA,QACtB,KAAQ;AAAA,QAAM,KAAQ;AAAA,QAAK,KAAQ;AAAA,QAAK,KAAQ;AAAA,QAAK,KAAQ;AAAA,QAAK,KAAQ;AAAA,QAC1E,KAAQ;AAAA,QAAM,KAAQ;AAAA,QAAK,KAAQ;AAAA,QAAK,KAAQ;AAAA,QAAK,KAAQ;AAAA,QAAK,KAAQ;AAAA,QAC1E,KAAQ;AAAA,QAAM,KAAQ;AAAA,QAAK,KAAQ;AAAA,QAAK,KAAQ;AAAA,QAChD,KAAQ;AAAA,QAAM,KAAQ;AAAA,QAAK,KAAQ;AAAA,QAAK,KAAQ;AAAA,QAChD,KAAQ;AAAA,QAAM,KAAQ;AAAA,QAAK,KAAQ;AAAA,QACnC,KAAQ;AAAA,QAAM,KAAQ;AAAA,QACtB,KAAQ;AAAA,QAAM,KAAQ;AAAA,QACtB,KAAQ;AAAA;AAAA,QAER,KAAU;AAAA,QAAM,KAAU;AAAA,QAAK,KAAU;AAAA,QACzC,KAAU;AAAA,QAAM,KAAU;AAAA,QAAK,KAAU;AAAA,QACzC,KAAU;AAAA,QAAM,KAAU;AAAA,QAAK,KAAU;AAAA,QAAK,KAAU;AAAA,QACxD,KAAU;AAAA,QAAM,KAAU;AAAA,QAAK,KAAU;AAAA,QAAK,KAAU;AAAA,QACxD,KAAU;AAAA,QAAM,KAAU;AAAA,QAAK,KAAU;AAAA,QAAK,KAAU;AAAA,QACxD,KAAU;AAAA,QAAM,KAAU;AAAA,QAAK,KAAU;AAAA,QAAK,KAAU;AAAA,QAAK,KAAU;AAAA,QACvE,KAAU;AAAA,QAAM,KAAU;AAAA,QAAK,KAAU;AAAA,QAAK,KAAU;AAAA,QAAK,KAAU;AAAA,QACvE,KAAU;AAAA,QAAM,KAAU;AAAA,QAAK,KAAU;AAAA,QAAK,KAAU;AAAA,QACxD,KAAU;AAAA,QAAM,KAAU;AAAA,QAAK,KAAU;AAAA,QAAK,KAAU;AAAA,QACxD,KAAU;AAAA,QAAM,KAAU;AAAA,QAAK,KAAU;AAAA,QAAK,KAAU;AAAA,QACxD,KAAU;AAAA,QAAM,KAAU;AAAA,QAAK,KAAU;AAAA,QAAK,KAAU;AAAA,QAAK,KAAU;AAAA,QACvE,KAAU;AAAA,QAAM,KAAU;AAAA,QAAK,KAAU;AAAA,QAAK,KAAU;AAAA,QAAK,KAAU;AAAA,QACvE,KAAU;AAAA,QAAM,KAAU;AAAA,QAC1B,KAAU;AAAA,QAAM,KAAU;AAAA,QAAK,KAAU;AAAA,QACzC,KAAU;AAAA,QAAM,KAAU;AAAA,QAAK,KAAU;AAAA,QAAK,KAAU;AAAA,QAAK,KAAU;AAAA,QACvE,KAAU;AAAA,QAAM,KAAU;AAAA,QAAK,KAAU;AAAA,QAAK,KAAU;AAAA,QAAK,KAAU;AAAA,QACvE,KAAU;AAAA,QAAM,KAAU;AAAA,QAAK,KAAU;AAAA,QAAK,KAAU;AAAA,QACxD,KAAU;AAAA,QAAM,KAAU;AAAA,QAAK,KAAU;AAAA,QAAK,KAAU;AAAA,QACxD,KAAU;AAAA,QAAM,KAAU;AAAA,QAAK,KAAU;AAAA,QACzC,KAAU;AAAA,QAAM,KAAU;AAAA,QAAK,KAAU;AAAA,QACzC,KAAU;AAAA,QAAM,KAAU;AAAA,QAAK,KAAU;AAAA,QACzC,KAAU;AAAA,QAAM,KAAU;AAAA,QAAK,KAAU;AAAA,QACzC,KAAU;AAAA,QAAM,KAAU;AAAA,QAAK,KAAU;AAAA,QAAK,KAAU;AAAA,QACxD,KAAU;AAAA,QAAM,KAAU;AAAA,QAAK,KAAU;AAAA,QAAK,KAAU;AAAA,QACxD,KAAU;AAAA,QAAM,KAAU;AAAA,QAAK,KAAU;AAAA,QACzC,KAAU;AAAA,QAAM,KAAU;AAAA,QAAK,KAAU;AAAA,QACzC,KAAU;AAAA,QAAM,KAAU;AAAA,QAAK,KAAU;AAAA,QAAK,KAAU;AAAA,QAAK,KAAU;AAAA,QAAK,KAAU;AAAA,QACtF,KAAU;AAAA,QAAM,KAAU;AAAA,QAAK,KAAU;AAAA,QAAK,KAAU;AAAA,QAAK,KAAU;AAAA,QAAK,KAAU;AAAA,QACtF,KAAU;AAAA,QAAM,KAAU;AAAA,QAC1B,KAAU;AAAA,QAAM,KAAU;AAAA,QAAK,KAAU;AAAA,QACzC,KAAU;AAAA,QAAM,KAAU;AAAA,QAAK,KAAU;AAAA,QACzC,KAAU;AAAA,QAAM,KAAU;AAAA,QAAK,KAAU;AAAA,QACzC,KAAU;AAAA,QAAM,KAAU;AAAA,QAC1B,KAAU;AAAA,QAAM,KAAU;AAAA,QAC1B,KAAU;AAAA,QAAM,KAAU;AAAA,MAC9B;AAGE,UAAI,cAAc;AAAA,QAChB,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,MACT;AAGE,UAAI,gBAAgB;AAAA,QAClB,SAAS;AAAA,QACT,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,UAAU;AAAA,QACV,SAAS;AAAA,MACb;AAGE,UAAI,gBAAgB;AAAA,QAClB,MAAM;AAAA,QACN,KAAK;AAAA,QACL,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,QACV,UAAU;AAAA,MACd;AAGE,UAAI,iBAAiB,YACjB,eAAe;AAGnB,UAAI,aAAa,OAAOC,kBAAU,YAAYA,kBAAUA,eAAO,WAAW,UAAUA;AAGpF,UAAI,WAAW,OAAO,QAAQ,YAAY,QAAQ,KAAK,WAAW,UAAU;AAG5E,UAAI,OAAO,cAAc,YAAY,SAAS,aAAa,EAAC;AAG5D,UAAI,cAA4C,WAAW,CAAC,QAAQ,YAAY;AAGhF,UAAI,aAAa,eAAe,QAA6B,UAAU,CAAC,OAAO,YAAY;AAG3F,UAAI,gBAAgB,cAAc,WAAW,YAAY;AAGzD,UAAI,cAAc,iBAAiB,WAAW;AAG9C,UAAI,WAAY,WAAW;AACzB,YAAI;AAEF,cAAI1H,SAAQ,cAAc,WAAW,WAAW,WAAW,QAAQ,MAAM,EAAE;AAE3E,cAAIA,QAAO;AACT,mBAAOA;AAAA,UACR;AAGD,iBAAO,eAAe,YAAY,WAAW,YAAY,QAAQ,MAAM;AAAA,QAC7E,SAAalB,IAAG;AAAA,QAAE;AAAA,MACf,EAAA;AAGD,UAAI,oBAAoB,YAAY,SAAS,eACzC,aAAa,YAAY,SAAS,QAClC,YAAY,YAAY,SAAS,OACjC,eAAe,YAAY,SAAS,UACpC,YAAY,YAAY,SAAS,OACjC,mBAAmB,YAAY,SAAS;AAc5C,eAAS,MAAM,MAAM,SAAS,MAAM;AAClC,gBAAQ,KAAK,QAAM;AAAA,UACjB,KAAK;AAAG,mBAAO,KAAK,KAAK,OAAO;AAAA,UAChC,KAAK;AAAG,mBAAO,KAAK,KAAK,SAAS,KAAK,CAAC,CAAC;AAAA,UACzC,KAAK;AAAG,mBAAO,KAAK,KAAK,SAAS,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AAAA,UAClD,KAAK;AAAG,mBAAO,KAAK,KAAK,SAAS,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AAAA,QAC5D;AACD,eAAO,KAAK,MAAM,SAAS,IAAI;AAAA,MAChC;AAYD,eAAS,gBAAgB,OAAO,QAAQ,UAAU,aAAa;AAC7D,YAAII,SAAQ,IACR,SAAS,SAAS,OAAO,IAAI,MAAM;AAEvC,eAAO,EAAEA,SAAQ,QAAQ;AACvB,cAAI,QAAQ,MAAMA,MAAK;AACvB,iBAAO,aAAa,OAAO,SAAS,KAAK,GAAG,KAAK;AAAA,QAClD;AACD,eAAO;AAAA,MACR;AAWD,eAAS,UAAU,OAAO,UAAU;AAClC,YAAIA,SAAQ,IACR,SAAS,SAAS,OAAO,IAAI,MAAM;AAEvC,eAAO,EAAEA,SAAQ,QAAQ;AACvB,cAAI,SAAS,MAAMA,MAAK,GAAGA,QAAO,KAAK,MAAM,OAAO;AAClD;AAAA,UACD;AAAA,QACF;AACD,eAAO;AAAA,MACR;AAWD,eAAS,eAAe,OAAO,UAAU;AACvC,YAAI,SAAS,SAAS,OAAO,IAAI,MAAM;AAEvC,eAAO,UAAU;AACf,cAAI,SAAS,MAAM,MAAM,GAAG,QAAQ,KAAK,MAAM,OAAO;AACpD;AAAA,UACD;AAAA,QACF;AACD,eAAO;AAAA,MACR;AAYD,eAAS,WAAW,OAAO,WAAW;AACpC,YAAIA,SAAQ,IACR,SAAS,SAAS,OAAO,IAAI,MAAM;AAEvC,eAAO,EAAEA,SAAQ,QAAQ;AACvB,cAAI,CAAC,UAAU,MAAMA,MAAK,GAAGA,QAAO,KAAK,GAAG;AAC1C,mBAAO;AAAA,UACR;AAAA,QACF;AACD,eAAO;AAAA,MACR;AAWD,eAAS,YAAY,OAAO,WAAW;AACrC,YAAIA,SAAQ,IACR,SAAS,SAAS,OAAO,IAAI,MAAM,QACnC,WAAW,GACX,SAAS,CAAA;AAEb,eAAO,EAAEA,SAAQ,QAAQ;AACvB,cAAI,QAAQ,MAAMA,MAAK;AACvB,cAAI,UAAU,OAAOA,QAAO,KAAK,GAAG;AAClC,mBAAO,UAAU,IAAI;AAAA,UACtB;AAAA,QACF;AACD,eAAO;AAAA,MACR;AAWD,eAAS,cAAc,OAAO,OAAO;AACnC,YAAI,SAAS,SAAS,OAAO,IAAI,MAAM;AACvC,eAAO,CAAC,CAAC,UAAU,YAAY,OAAO,OAAO,CAAC,IAAI;AAAA,MACnD;AAWD,eAAS,kBAAkB,OAAO,OAAO,YAAY;AACnD,YAAIA,SAAQ,IACR,SAAS,SAAS,OAAO,IAAI,MAAM;AAEvC,eAAO,EAAEA,SAAQ,QAAQ;AACvB,cAAI,WAAW,OAAO,MAAMA,MAAK,CAAC,GAAG;AACnC,mBAAO;AAAA,UACR;AAAA,QACF;AACD,eAAO;AAAA,MACR;AAWD,eAAS,SAAS,OAAO,UAAU;AACjC,YAAIA,SAAQ,IACR,SAAS,SAAS,OAAO,IAAI,MAAM,QACnC,SAAS,MAAM,MAAM;AAEzB,eAAO,EAAEA,SAAQ,QAAQ;AACvB,iBAAOA,MAAK,IAAI,SAAS,MAAMA,MAAK,GAAGA,QAAO,KAAK;AAAA,QACpD;AACD,eAAO;AAAA,MACR;AAUD,eAAS,UAAU,OAAO,QAAQ;AAChC,YAAIA,SAAQ,IACR,SAAS,OAAO,QAChB,SAAS,MAAM;AAEnB,eAAO,EAAEA,SAAQ,QAAQ;AACvB,gBAAM,SAASA,MAAK,IAAI,OAAOA,MAAK;AAAA,QACrC;AACD,eAAO;AAAA,MACR;AAcD,eAAS,YAAY,OAAO,UAAU,aAAa,WAAW;AAC5D,YAAIA,SAAQ,IACR,SAAS,SAAS,OAAO,IAAI,MAAM;AAEvC,YAAI,aAAa,QAAQ;AACvB,wBAAc,MAAM,EAAEA,MAAK;AAAA,QAC5B;AACD,eAAO,EAAEA,SAAQ,QAAQ;AACvB,wBAAc,SAAS,aAAa,MAAMA,MAAK,GAAGA,QAAO,KAAK;AAAA,QAC/D;AACD,eAAO;AAAA,MACR;AAcD,eAAS,iBAAiB,OAAO,UAAU,aAAa,WAAW;AACjE,YAAI,SAAS,SAAS,OAAO,IAAI,MAAM;AACvC,YAAI,aAAa,QAAQ;AACvB,wBAAc,MAAM,EAAE,MAAM;AAAA,QAC7B;AACD,eAAO,UAAU;AACf,wBAAc,SAAS,aAAa,MAAM,MAAM,GAAG,QAAQ,KAAK;AAAA,QACjE;AACD,eAAO;AAAA,MACR;AAYD,eAAS,UAAU,OAAO,WAAW;AACnC,YAAIA,SAAQ,IACR,SAAS,SAAS,OAAO,IAAI,MAAM;AAEvC,eAAO,EAAEA,SAAQ,QAAQ;AACvB,cAAI,UAAU,MAAMA,MAAK,GAAGA,QAAO,KAAK,GAAG;AACzC,mBAAO;AAAA,UACR;AAAA,QACF;AACD,eAAO;AAAA,MACR;AASD,UAAI,YAAY,aAAa,QAAQ;AASrC,eAAS,aAAamC,SAAQ;AAC5B,eAAOA,QAAO,MAAM,EAAE;AAAA,MACvB;AASD,eAAS,WAAWA,SAAQ;AAC1B,eAAOA,QAAO,MAAM,WAAW,KAAK,CAAA;AAAA,MACrC;AAaD,eAAS,YAAY,YAAY,WAAW,UAAU;AACpD,YAAI;AACJ,iBAAS,YAAY,SAAS,OAAO,KAAKsG,aAAY;AACpD,cAAI,UAAU,OAAO,KAAKA,WAAU,GAAG;AACrC,qBAAS;AACT,mBAAO;AAAA,UACR;AAAA,QACP,CAAK;AACD,eAAO;AAAA,MACR;AAaD,eAAS,cAAc,OAAO,WAAW,WAAW,WAAW;AAC7D,YAAI,SAAS,MAAM,QACfzI,SAAQ,aAAa,YAAY,IAAI;AAEzC,eAAQ,YAAYA,WAAU,EAAEA,SAAQ,QAAS;AAC/C,cAAI,UAAU,MAAMA,MAAK,GAAGA,QAAO,KAAK,GAAG;AACzC,mBAAOA;AAAA,UACR;AAAA,QACF;AACD,eAAO;AAAA,MACR;AAWD,eAAS,YAAY,OAAO,OAAO,WAAW;AAC5C,eAAO,UAAU,QACb,cAAc,OAAO,OAAO,SAAS,IACrC,cAAc,OAAO,WAAW,SAAS;AAAA,MAC9C;AAYD,eAAS,gBAAgB,OAAO,OAAO,WAAW,YAAY;AAC5D,YAAIA,SAAQ,YAAY,GACpB,SAAS,MAAM;AAEnB,eAAO,EAAEA,SAAQ,QAAQ;AACvB,cAAI,WAAW,MAAMA,MAAK,GAAG,KAAK,GAAG;AACnC,mBAAOA;AAAA,UACR;AAAA,QACF;AACD,eAAO;AAAA,MACR;AASD,eAAS,UAAU,OAAO;AACxB,eAAO,UAAU;AAAA,MAClB;AAWD,eAAS,SAAS,OAAO,UAAU;AACjC,YAAI,SAAS,SAAS,OAAO,IAAI,MAAM;AACvC,eAAO,SAAU,QAAQ,OAAO,QAAQ,IAAI,SAAU;AAAA,MACvD;AASD,eAAS,aAAa,KAAK;AACzB,eAAO,SAAS,QAAQ;AACtB,iBAAO,UAAU,OAAOuI,cAAY,OAAO,GAAG;AAAA,QACpD;AAAA,MACG;AASD,eAAS,eAAe,QAAQ;AAC9B,eAAO,SAAS,KAAK;AACnB,iBAAO,UAAU,OAAOA,cAAY,OAAO,GAAG;AAAA,QACpD;AAAA,MACG;AAeD,eAAS,WAAW,YAAY,UAAU,aAAa,WAAW,UAAU;AAC1E,iBAAS,YAAY,SAAS,OAAOvI,QAAOyI,aAAY;AACtD,wBAAc,aACT,YAAY,OAAO,SACpB,SAAS,aAAa,OAAOzI,QAAOyI,WAAU;AAAA,QACxD,CAAK;AACD,eAAO;AAAA,MACR;AAYD,eAAS,WAAW,OAAO,UAAU;AACnC,YAAI,SAAS,MAAM;AAEnB,cAAM,KAAK,QAAQ;AACnB,eAAO,UAAU;AACf,gBAAM,MAAM,IAAI,MAAM,MAAM,EAAE;AAAA,QAC/B;AACD,eAAO;AAAA,MACR;AAWD,eAAS,QAAQ,OAAO,UAAU;AAChC,YAAI,QACAzI,SAAQ,IACR,SAAS,MAAM;AAEnB,eAAO,EAAEA,SAAQ,QAAQ;AACvB,cAAI,UAAU,SAAS,MAAMA,MAAK,CAAC;AACnC,cAAI,YAAYuI,aAAW;AACzB,qBAAS,WAAWA,cAAY,UAAW,SAAS;AAAA,UACrD;AAAA,QACF;AACD,eAAO;AAAA,MACR;AAWD,eAAS,UAAUrI,IAAG,UAAU;AAC9B,YAAIF,SAAQ,IACR,SAAS,MAAME,EAAC;AAEpB,eAAO,EAAEF,SAAQE,IAAG;AAClB,iBAAOF,MAAK,IAAI,SAASA,MAAK;AAAA,QAC/B;AACD,eAAO;AAAA,MACR;AAWD,eAAS,YAAY,QAAQ,OAAO;AAClC,eAAO,SAAS,OAAO,SAAS,KAAK;AACnC,iBAAO,CAAC,KAAK,OAAO,GAAG,CAAC;AAAA,QAC9B,CAAK;AAAA,MACF;AASD,eAAS,SAASmC,SAAQ;AACxB,eAAOA,UACHA,QAAO,MAAM,GAAG,gBAAgBA,OAAM,IAAI,CAAC,EAAE,QAAQ,aAAa,EAAE,IACpEA;AAAA,MACL;AASD,eAAS,UAAU,MAAM;AACvB,eAAO,SAAS,OAAO;AACrB,iBAAO,KAAK,KAAK;AAAA,QACvB;AAAA,MACG;AAYD,eAAS,WAAW,QAAQ,OAAO;AACjC,eAAO,SAAS,OAAO,SAAS,KAAK;AACnC,iBAAO,OAAO,GAAG;AAAA,QACvB,CAAK;AAAA,MACF;AAUD,eAAS,SAAS,OAAO,KAAK;AAC5B,eAAO,MAAM,IAAI,GAAG;AAAA,MACrB;AAWD,eAAS,gBAAgB,YAAY,YAAY;AAC/C,YAAInC,SAAQ,IACR,SAAS,WAAW;AAExB,eAAO,EAAEA,SAAQ,UAAU,YAAY,YAAY,WAAWA,MAAK,GAAG,CAAC,IAAI,IAAI;AAAA,QAAE;AACjF,eAAOA;AAAA,MACR;AAWD,eAAS,cAAc,YAAY,YAAY;AAC7C,YAAIA,SAAQ,WAAW;AAEvB,eAAOA,YAAW,YAAY,YAAY,WAAWA,MAAK,GAAG,CAAC,IAAI,IAAI;AAAA,QAAE;AACxE,eAAOA;AAAA,MACR;AAUD,eAAS,aAAa,OAAO,aAAa;AACxC,YAAI,SAAS,MAAM,QACf,SAAS;AAEb,eAAO,UAAU;AACf,cAAI,MAAM,MAAM,MAAM,aAAa;AACjC,cAAE;AAAA,UACH;AAAA,QACF;AACD,eAAO;AAAA,MACR;AAUD,UAAI,eAAe,eAAe,eAAe;AASjD,UAAI,iBAAiB,eAAe,WAAW;AAS/C,eAAS,iBAAiB,KAAK;AAC7B,eAAO,OAAO,cAAc,GAAG;AAAA,MAChC;AAUD,eAAS,SAAS,QAAQ,KAAK;AAC7B,eAAO,UAAU,OAAOuI,cAAY,OAAO,GAAG;AAAA,MAC/C;AASD,eAAS,WAAWpG,SAAQ;AAC1B,eAAO,aAAa,KAAKA,OAAM;AAAA,MAChC;AASD,eAAS,eAAeA,SAAQ;AAC9B,eAAO,iBAAiB,KAAKA,OAAM;AAAA,MACpC;AASD,eAAS,gBAAgB,UAAU;AACjC,YAAI,MACA,SAAS,CAAA;AAEb,eAAO,EAAE,OAAO,SAAS,KAAI,GAAI,MAAM;AACrC,iBAAO,KAAK,KAAK,KAAK;AAAA,QACvB;AACD,eAAO;AAAA,MACR;AASD,eAAS,WAAW,KAAK;AACvB,YAAInC,SAAQ,IACR,SAAS,MAAM,IAAI,IAAI;AAE3B,YAAI,QAAQ,SAAS,OAAO,KAAK;AAC/B,iBAAO,EAAEA,MAAK,IAAI,CAAC,KAAK,KAAK;AAAA,QACnC,CAAK;AACD,eAAO;AAAA,MACR;AAUD,eAAS,QAAQ,MAAM,WAAW;AAChC,eAAO,SAAS,KAAK;AACnB,iBAAO,KAAK,UAAU,GAAG,CAAC;AAAA,QAChC;AAAA,MACG;AAWD,eAAS,eAAe,OAAO,aAAa;AAC1C,YAAIA,SAAQ,IACR,SAAS,MAAM,QACf,WAAW,GACX,SAAS,CAAA;AAEb,eAAO,EAAEA,SAAQ,QAAQ;AACvB,cAAI,QAAQ,MAAMA,MAAK;AACvB,cAAI,UAAU,eAAe,UAAU,aAAa;AAClD,kBAAMA,MAAK,IAAI;AACf,mBAAO,UAAU,IAAIA;AAAA,UACtB;AAAA,QACF;AACD,eAAO;AAAA,MACR;AASD,eAAS,WAAW,KAAK;AACvB,YAAIA,SAAQ,IACR,SAAS,MAAM,IAAI,IAAI;AAE3B,YAAI,QAAQ,SAAS,OAAO;AAC1B,iBAAO,EAAEA,MAAK,IAAI;AAAA,QACxB,CAAK;AACD,eAAO;AAAA,MACR;AASD,eAAS,WAAW,KAAK;AACvB,YAAIA,SAAQ,IACR,SAAS,MAAM,IAAI,IAAI;AAE3B,YAAI,QAAQ,SAAS,OAAO;AAC1B,iBAAO,EAAEA,MAAK,IAAI,CAAC,OAAO,KAAK;AAAA,QACrC,CAAK;AACD,eAAO;AAAA,MACR;AAYD,eAAS,cAAc,OAAO,OAAO,WAAW;AAC9C,YAAIA,SAAQ,YAAY,GACpB,SAAS,MAAM;AAEnB,eAAO,EAAEA,SAAQ,QAAQ;AACvB,cAAI,MAAMA,MAAK,MAAM,OAAO;AAC1B,mBAAOA;AAAA,UACR;AAAA,QACF;AACD,eAAO;AAAA,MACR;AAYD,eAAS,kBAAkB,OAAO,OAAO,WAAW;AAClD,YAAIA,SAAQ,YAAY;AACxB,eAAOA,UAAS;AACd,cAAI,MAAMA,MAAK,MAAM,OAAO;AAC1B,mBAAOA;AAAA,UACR;AAAA,QACF;AACD,eAAOA;AAAA,MACR;AASD,eAAS,WAAWmC,SAAQ;AAC1B,eAAO,WAAWA,OAAM,IACpB,YAAYA,OAAM,IAClB,UAAUA,OAAM;AAAA,MACrB;AASD,eAAS,cAAcA,SAAQ;AAC7B,eAAO,WAAWA,OAAM,IACpB,eAAeA,OAAM,IACrB,aAAaA,OAAM;AAAA,MACxB;AAUD,eAAS,gBAAgBA,SAAQ;AAC/B,YAAInC,SAAQmC,QAAO;AAEnB,eAAOnC,YAAW,aAAa,KAAKmC,QAAO,OAAOnC,MAAK,CAAC,GAAG;AAAA,QAAE;AAC7D,eAAOA;AAAA,MACR;AASD,UAAI,mBAAmB,eAAe,aAAa;AASnD,eAAS,YAAYmC,SAAQ;AAC3B,YAAI,SAAS,UAAU,YAAY;AACnC,eAAO,UAAU,KAAKA,OAAM,GAAG;AAC7B,YAAE;AAAA,QACH;AACD,eAAO;AAAA,MACR;AASD,eAAS,eAAeA,SAAQ;AAC9B,eAAOA,QAAO,MAAM,SAAS,KAAK,CAAA;AAAA,MACnC;AASD,eAAS,aAAaA,SAAQ;AAC5B,eAAOA,QAAO,MAAM,aAAa,KAAK,CAAA;AAAA,MACvC;AAiCD,UAAI,eAAgB,SAASuG,cAAa,SAAS;AACjD,kBAAU,WAAW,OAAO,OAAOtG,GAAE,SAAS,KAAK,OAAM,GAAI,SAASA,GAAE,KAAK,MAAM,YAAY,CAAC;AAGhG,YAAIuG,SAAQ,QAAQ,OAChBC,QAAO,QAAQ,MACfC,SAAQ,QAAQ,OAChBC,YAAW,QAAQ,UACnBC,QAAO,QAAQ,MACfC,UAAS,QAAQ,QACjBC,UAAS,QAAQ,QACjBC,UAAS,QAAQ,QACjBC,aAAY,QAAQ;AAGxB,YAAI,aAAaR,OAAM,WACnB,YAAYG,UAAS,WACrB,cAAcE,QAAO;AAGzB,YAAI,aAAa,QAAQ,oBAAoB;AAG7C,YAAI,eAAe,UAAU;AAG7B,YAAI,iBAAiB,YAAY;AAGjC,YAAI,YAAY;AAGhB,YAAI,aAAc,WAAW;AAC3B,cAAI,MAAM,SAAS,KAAK,cAAc,WAAW,QAAQ,WAAW,KAAK,YAAY,EAAE;AACvF,iBAAO,MAAO,mBAAmB,MAAO;AAAA,QACzC,EAAA;AAOD,YAAI,uBAAuB,YAAY;AAGvC,YAAI,mBAAmB,aAAa,KAAKA,OAAM;AAG/C,YAAI,UAAU,KAAK;AAGnB,YAAI,aAAaC;AAAA,UAAO,MACtB,aAAa,KAAK,cAAc,EAAE,QAAQ,cAAc,MAAM,EAC7D,QAAQ,0DAA0D,OAAO,IAAI;AAAA,QACpF;AAGI,YAAIG,UAAS,gBAAgB,QAAQ,SAASb,aAC1Cc,UAAS,QAAQ,QACjBC,cAAa,QAAQ,YACrB,cAAcF,UAASA,QAAO,cAAcb,aAC5C,eAAe,QAAQS,QAAO,gBAAgBA,OAAM,GACpD,eAAeA,QAAO,QACtB,uBAAuB,YAAY,sBACnC,SAAS,WAAW,QACpB,mBAAmBK,UAASA,QAAO,qBAAqBd,aACxD,cAAcc,UAASA,QAAO,WAAWd,aACzC,iBAAiBc,UAASA,QAAO,cAAcd;AAEnD,YAAI,iBAAkB,WAAW;AAC/B,cAAI;AACF,gBAAI,OAAO,UAAUS,SAAQ,gBAAgB;AAC7C,iBAAK,CAAE,GAAE,IAAI,CAAA,CAAE;AACf,mBAAO;AAAA,UACf,SAAepJ,IAAG;AAAA,UAAE;AAAA,QACf,EAAA;AAGD,YAAI,kBAAkB,QAAQ,iBAAiB,KAAK,gBAAgB,QAAQ,cACxE,SAASgJ,SAAQA,MAAK,QAAQ,KAAK,KAAK,OAAOA,MAAK,KACpD,gBAAgB,QAAQ,eAAe,KAAK,cAAc,QAAQ;AAGtE,YAAI,aAAaG,MAAK,MAClB,cAAcA,MAAK,OACnB,mBAAmBC,QAAO,uBAC1B,iBAAiBI,UAASA,QAAO,WAAWb,aAC5C,iBAAiB,QAAQ,UACzB,aAAa,WAAW,MACxB,aAAa,QAAQS,QAAO,MAAMA,OAAM,GACxC,YAAYD,MAAK,KACjB,YAAYA,MAAK,KACjB,YAAYH,MAAK,KACjB,iBAAiB,QAAQ,UACzB,eAAeG,MAAK,QACpB,gBAAgB,WAAW;AAG/B,YAAI,WAAW,UAAU,SAAS,UAAU,GACxCQ,OAAM,UAAU,SAAS,KAAK,GAC9BC,WAAU,UAAU,SAAS,SAAS,GACtCC,OAAM,UAAU,SAAS,KAAK,GAC9BC,WAAU,UAAU,SAAS,SAAS,GACtC,eAAe,UAAUV,SAAQ,QAAQ;AAG7C,YAAI,UAAUU,YAAW,IAAIA;AAG7B,YAAI,YAAY,CAAA;AAGhB,YAAI,qBAAqB,SAAS,QAAQ,GACtC,gBAAgB,SAASH,IAAG,GAC5B,oBAAoB,SAASC,QAAO,GACpC,gBAAgB,SAASC,IAAG,GAC5B,oBAAoB,SAASC,QAAO;AAGxC,YAAI,cAAcL,UAASA,QAAO,YAAYd,aAC1C,gBAAgB,cAAc,YAAY,UAAUA,aACpD,iBAAiB,cAAc,YAAY,WAAWA;AAyH1D,iBAASoB,QAAO,OAAO;AACrB,cAAI,aAAa,KAAK,KAAK,CAAC,QAAQ,KAAK,KAAK,EAAE,iBAAiB,cAAc;AAC7E,gBAAI,iBAAiB,eAAe;AAClC,qBAAO;AAAA,YACR;AACD,gBAAI,eAAe,KAAK,OAAO,aAAa,GAAG;AAC7C,qBAAO,aAAa,KAAK;AAAA,YAC1B;AAAA,UACF;AACD,iBAAO,IAAI,cAAc,KAAK;AAAA,QAC/B;AAUD,YAAI,aAAc,WAAW;AAC3B,mBAAS,SAAS;AAAA,UAAE;AACpB,iBAAO,SAAS,OAAO;AACrB,gBAAI,CAAC,SAAS,KAAK,GAAG;AACpB,qBAAO;YACR;AACD,gBAAI,cAAc;AAChB,qBAAO,aAAa,KAAK;AAAA,YAC1B;AACD,mBAAO,YAAY;AACnB,gBAAIC,UAAS,IAAI;AACjB,mBAAO,YAAYrB;AACnB,mBAAOqB;AAAA,UACf;AAAA,QACK,EAAA;AAOD,iBAAS,aAAa;AAAA,QAErB;AASD,iBAAS,cAAc,OAAO,UAAU;AACtC,eAAK,cAAc;AACnB,eAAK,cAAc;AACnB,eAAK,YAAY,CAAC,CAAC;AACnB,eAAK,YAAY;AACjB,eAAK,aAAarB;AAAAA,QACnB;AAWD,QAAAoB,QAAO,mBAAmB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAQxB,UAAU;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAQV,YAAY;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAQZ,eAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAQf,YAAY;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAQZ,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,YAQT,KAAKA;AAAA,UACN;AAAA,QACP;AAGI,QAAAA,QAAO,YAAY,WAAW;AAC9B,QAAAA,QAAO,UAAU,cAAcA;AAE/B,sBAAc,YAAY,WAAW,WAAW,SAAS;AACzD,sBAAc,UAAU,cAAc;AAWtC,iBAAS,YAAY,OAAO;AAC1B,eAAK,cAAc;AACnB,eAAK,cAAc;AACnB,eAAK,UAAU;AACf,eAAK,eAAe;AACpB,eAAK,gBAAgB;AACrB,eAAK,gBAAgB;AACrB,eAAK,YAAY;QAClB;AAUD,iBAAS,YAAY;AACnB,cAAIC,UAAS,IAAI,YAAY,KAAK,WAAW;AAC7C,UAAAA,QAAO,cAAc,UAAU,KAAK,WAAW;AAC/C,UAAAA,QAAO,UAAU,KAAK;AACtB,UAAAA,QAAO,eAAe,KAAK;AAC3B,UAAAA,QAAO,gBAAgB,UAAU,KAAK,aAAa;AACnD,UAAAA,QAAO,gBAAgB,KAAK;AAC5B,UAAAA,QAAO,YAAY,UAAU,KAAK,SAAS;AAC3C,iBAAOA;AAAA,QACR;AAUD,iBAAS,cAAc;AACrB,cAAI,KAAK,cAAc;AACrB,gBAAIA,UAAS,IAAI,YAAY,IAAI;AACjC,YAAAA,QAAO,UAAU;AACjB,YAAAA,QAAO,eAAe;AAAA,UAC9B,OAAa;AACL,YAAAA,UAAS,KAAK;AACd,YAAAA,QAAO,WAAW;AAAA,UACnB;AACD,iBAAOA;AAAA,QACR;AAUD,iBAAS,YAAY;AACnB,cAAI,QAAQ,KAAK,YAAY,MAAO,GAChC,MAAM,KAAK,SACX,QAAQ,QAAQ,KAAK,GACrB,UAAU,MAAM,GAChB,YAAY,QAAQ,MAAM,SAAS,GACnC,OAAO,QAAQ,GAAG,WAAW,KAAK,SAAS,GAC3C,QAAQ,KAAK,OACb,MAAM,KAAK,KACX,SAAS,MAAM,OACf5J,SAAQ,UAAU,MAAO,QAAQ,GACjC,YAAY,KAAK,eACjB,aAAa,UAAU,QACvB,WAAW,GACX,YAAY,UAAU,QAAQ,KAAK,aAAa;AAEpD,cAAI,CAAC,SAAU,CAAC,WAAW,aAAa,UAAU,aAAa,QAAS;AACtE,mBAAO,iBAAiB,OAAO,KAAK,WAAW;AAAA,UAChD;AACD,cAAI4J,UAAS,CAAA;AAEb;AACA,mBAAO,YAAY,WAAW,WAAW;AACvC,cAAA5J,UAAS;AAET,kBAAI,YAAY,IACZ,QAAQ,MAAMA,MAAK;AAEvB,qBAAO,EAAE,YAAY,YAAY;AAC/B,oBAAI,OAAO,UAAU,SAAS,GAC1B6J,YAAW,KAAK,UAChB,OAAO,KAAK,MACZ,WAAWA,UAAS,KAAK;AAE7B,oBAAI,QAAQ,eAAe;AACzB,0BAAQ;AAAA,gBACpB,WAAqB,CAAC,UAAU;AACpB,sBAAI,QAAQ,kBAAkB;AAC5B,6BAAS;AAAA,kBACvB,OAAmB;AACL,0BAAM;AAAA,kBACP;AAAA,gBACF;AAAA,cACF;AACD,cAAAD,QAAO,UAAU,IAAI;AAAA,YACtB;AACD,iBAAOA;AAAA,QACR;AAGD,oBAAY,YAAY,WAAW,WAAW,SAAS;AACvD,oBAAY,UAAU,cAAc;AAWpC,iBAASE,MAAK,SAAS;AACrB,cAAI9J,SAAQ,IACR,SAAS,WAAW,OAAO,IAAI,QAAQ;AAE3C,eAAK,MAAK;AACV,iBAAO,EAAEA,SAAQ,QAAQ;AACvB,gBAAI,QAAQ,QAAQA,MAAK;AACzB,iBAAK,IAAI,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;AAAA,UAC5B;AAAA,QACF;AASD,iBAAS,YAAY;AACnB,eAAK,WAAW,eAAe,aAAa,IAAI,IAAI,CAAA;AACpD,eAAK,OAAO;AAAA,QACb;AAYD,iBAAS,WAAW,KAAK;AACvB,cAAI4J,UAAS,KAAK,IAAI,GAAG,KAAK,OAAO,KAAK,SAAS,GAAG;AACtD,eAAK,QAAQA,UAAS,IAAI;AAC1B,iBAAOA;AAAA,QACR;AAWD,iBAAS,QAAQ,KAAK;AACpB,cAAI,OAAO,KAAK;AAChB,cAAI,cAAc;AAChB,gBAAIA,UAAS,KAAK,GAAG;AACrB,mBAAOA,YAAW,iBAAiBrB,cAAYqB;AAAA,UAChD;AACD,iBAAO,eAAe,KAAK,MAAM,GAAG,IAAI,KAAK,GAAG,IAAIrB;AAAAA,QACrD;AAWD,iBAAS,QAAQ,KAAK;AACpB,cAAI,OAAO,KAAK;AAChB,iBAAO,eAAgB,KAAK,GAAG,MAAMA,cAAa,eAAe,KAAK,MAAM,GAAG;AAAA,QAChF;AAYD,iBAAS,QAAQ,KAAK,OAAO;AAC3B,cAAI,OAAO,KAAK;AAChB,eAAK,QAAQ,KAAK,IAAI,GAAG,IAAI,IAAI;AACjC,eAAK,GAAG,IAAK,gBAAgB,UAAUA,cAAa,iBAAiB;AACrE,iBAAO;AAAA,QACR;AAGD,QAAAuB,MAAK,UAAU,QAAQ;AACvB,QAAAA,MAAK,UAAU,QAAQ,IAAI;AAC3B,QAAAA,MAAK,UAAU,MAAM;AACrB,QAAAA,MAAK,UAAU,MAAM;AACrB,QAAAA,MAAK,UAAU,MAAM;AAWrB,iBAAS,UAAU,SAAS;AAC1B,cAAI9J,SAAQ,IACR,SAAS,WAAW,OAAO,IAAI,QAAQ;AAE3C,eAAK,MAAK;AACV,iBAAO,EAAEA,SAAQ,QAAQ;AACvB,gBAAI,QAAQ,QAAQA,MAAK;AACzB,iBAAK,IAAI,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;AAAA,UAC5B;AAAA,QACF;AASD,iBAAS,iBAAiB;AACxB,eAAK,WAAW;AAChB,eAAK,OAAO;AAAA,QACb;AAWD,iBAAS,gBAAgB,KAAK;AAC5B,cAAI,OAAO,KAAK,UACZA,SAAQ,aAAa,MAAM,GAAG;AAElC,cAAIA,SAAQ,GAAG;AACb,mBAAO;AAAA,UACR;AACD,cAAI,YAAY,KAAK,SAAS;AAC9B,cAAIA,UAAS,WAAW;AACtB,iBAAK,IAAG;AAAA,UAChB,OAAa;AACL,mBAAO,KAAK,MAAMA,QAAO,CAAC;AAAA,UAC3B;AACD,YAAE,KAAK;AACP,iBAAO;AAAA,QACR;AAWD,iBAAS,aAAa,KAAK;AACzB,cAAI,OAAO,KAAK,UACZA,SAAQ,aAAa,MAAM,GAAG;AAElC,iBAAOA,SAAQ,IAAIuI,cAAY,KAAKvI,MAAK,EAAE,CAAC;AAAA,QAC7C;AAWD,iBAAS,aAAa,KAAK;AACzB,iBAAO,aAAa,KAAK,UAAU,GAAG,IAAI;AAAA,QAC3C;AAYD,iBAAS,aAAa,KAAK,OAAO;AAChC,cAAI,OAAO,KAAK,UACZA,SAAQ,aAAa,MAAM,GAAG;AAElC,cAAIA,SAAQ,GAAG;AACb,cAAE,KAAK;AACP,iBAAK,KAAK,CAAC,KAAK,KAAK,CAAC;AAAA,UAC9B,OAAa;AACL,iBAAKA,MAAK,EAAE,CAAC,IAAI;AAAA,UAClB;AACD,iBAAO;AAAA,QACR;AAGD,kBAAU,UAAU,QAAQ;AAC5B,kBAAU,UAAU,QAAQ,IAAI;AAChC,kBAAU,UAAU,MAAM;AAC1B,kBAAU,UAAU,MAAM;AAC1B,kBAAU,UAAU,MAAM;AAW1B,iBAAS,SAAS,SAAS;AACzB,cAAIA,SAAQ,IACR,SAAS,WAAW,OAAO,IAAI,QAAQ;AAE3C,eAAK,MAAK;AACV,iBAAO,EAAEA,SAAQ,QAAQ;AACvB,gBAAI,QAAQ,QAAQA,MAAK;AACzB,iBAAK,IAAI,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;AAAA,UAC5B;AAAA,QACF;AASD,iBAAS,gBAAgB;AACvB,eAAK,OAAO;AACZ,eAAK,WAAW;AAAA,YACd,QAAQ,IAAI8J;AAAA,YACZ,OAAO,KAAKP,QAAO;AAAA,YACnB,UAAU,IAAIO;AAAA,UACtB;AAAA,QACK;AAWD,iBAAS,eAAe,KAAK;AAC3B,cAAIF,UAAS,WAAW,MAAM,GAAG,EAAE,QAAQ,EAAE,GAAG;AAChD,eAAK,QAAQA,UAAS,IAAI;AAC1B,iBAAOA;AAAA,QACR;AAWD,iBAAS,YAAY,KAAK;AACxB,iBAAO,WAAW,MAAM,GAAG,EAAE,IAAI,GAAG;AAAA,QACrC;AAWD,iBAAS,YAAY,KAAK;AACxB,iBAAO,WAAW,MAAM,GAAG,EAAE,IAAI,GAAG;AAAA,QACrC;AAYD,iBAAS,YAAY,KAAK,OAAO;AAC/B,cAAI,OAAO,WAAW,MAAM,GAAG,GAC3BG,QAAO,KAAK;AAEhB,eAAK,IAAI,KAAK,KAAK;AACnB,eAAK,QAAQ,KAAK,QAAQA,QAAO,IAAI;AACrC,iBAAO;AAAA,QACR;AAGD,iBAAS,UAAU,QAAQ;AAC3B,iBAAS,UAAU,QAAQ,IAAI;AAC/B,iBAAS,UAAU,MAAM;AACzB,iBAAS,UAAU,MAAM;AACzB,iBAAS,UAAU,MAAM;AAYzB,iBAAS,SAASC,SAAQ;AACxB,cAAIhK,SAAQ,IACR,SAASgK,WAAU,OAAO,IAAIA,QAAO;AAEzC,eAAK,WAAW,IAAI;AACpB,iBAAO,EAAEhK,SAAQ,QAAQ;AACvB,iBAAK,IAAIgK,QAAOhK,MAAK,CAAC;AAAA,UACvB;AAAA,QACF;AAYD,iBAAS,YAAY,OAAO;AAC1B,eAAK,SAAS,IAAI,OAAO,cAAc;AACvC,iBAAO;AAAA,QACR;AAWD,iBAAS,YAAY,OAAO;AAC1B,iBAAO,KAAK,SAAS,IAAI,KAAK;AAAA,QAC/B;AAGD,iBAAS,UAAU,MAAM,SAAS,UAAU,OAAO;AACnD,iBAAS,UAAU,MAAM;AAWzB,iBAASiK,OAAM,SAAS;AACtB,cAAI,OAAO,KAAK,WAAW,IAAI,UAAU,OAAO;AAChD,eAAK,OAAO,KAAK;AAAA,QAClB;AASD,iBAAS,aAAa;AACpB,eAAK,WAAW,IAAI;AACpB,eAAK,OAAO;AAAA,QACb;AAWD,iBAAS,YAAY,KAAK;AACxB,cAAI,OAAO,KAAK,UACZL,UAAS,KAAK,QAAQ,EAAE,GAAG;AAE/B,eAAK,OAAO,KAAK;AACjB,iBAAOA;AAAA,QACR;AAWD,iBAAS,SAAS,KAAK;AACrB,iBAAO,KAAK,SAAS,IAAI,GAAG;AAAA,QAC7B;AAWD,iBAAS,SAAS,KAAK;AACrB,iBAAO,KAAK,SAAS,IAAI,GAAG;AAAA,QAC7B;AAYD,iBAAS,SAAS,KAAK,OAAO;AAC5B,cAAI,OAAO,KAAK;AAChB,cAAI,gBAAgB,WAAW;AAC7B,gBAAI,QAAQ,KAAK;AACjB,gBAAI,CAACL,QAAQ,MAAM,SAAS,mBAAmB,GAAI;AACjD,oBAAM,KAAK,CAAC,KAAK,KAAK,CAAC;AACvB,mBAAK,OAAO,EAAE,KAAK;AACnB,qBAAO;AAAA,YACR;AACD,mBAAO,KAAK,WAAW,IAAI,SAAS,KAAK;AAAA,UAC1C;AACD,eAAK,IAAI,KAAK,KAAK;AACnB,eAAK,OAAO,KAAK;AACjB,iBAAO;AAAA,QACR;AAGD,QAAAU,OAAM,UAAU,QAAQ;AACxB,QAAAA,OAAM,UAAU,QAAQ,IAAI;AAC5B,QAAAA,OAAM,UAAU,MAAM;AACtB,QAAAA,OAAM,UAAU,MAAM;AACtB,QAAAA,OAAM,UAAU,MAAM;AAYtB,iBAAS,cAAc,OAAO,WAAW;AACvC,cAAI,QAAQ,QAAQ,KAAK,GACrB,QAAQ,CAAC,SAAS,YAAY,KAAK,GACnC,SAAS,CAAC,SAAS,CAAC,SAAS,SAAS,KAAK,GAC3C,SAAS,CAAC,SAAS,CAAC,SAAS,CAAC,UAAU,aAAa,KAAK,GAC1D,cAAc,SAAS,SAAS,UAAU,QAC1CL,UAAS,cAAc,UAAU,MAAM,QAAQV,OAAM,IAAI,CAAE,GAC3D,SAASU,QAAO;AAEpB,mBAAS,OAAO,OAAO;AACrB,iBAAK,aAAa,eAAe,KAAK,OAAO,GAAG,MAC5C,EAAE;AAAA,aAEC,OAAO;AAAA,YAEN,WAAW,OAAO,YAAY,OAAO;AAAA,YAErC,WAAW,OAAO,YAAY,OAAO,gBAAgB,OAAO;AAAA,YAE7D,QAAQ,KAAK,MAAM,KAClB;AACN,cAAAA,QAAO,KAAK,GAAG;AAAA,YAChB;AAAA,UACF;AACD,iBAAOA;AAAA,QACR;AASD,iBAAS,YAAY,OAAO;AAC1B,cAAI,SAAS,MAAM;AACnB,iBAAO,SAAS,MAAM,WAAW,GAAG,SAAS,CAAC,CAAC,IAAIrB;AAAAA,QACpD;AAUD,iBAAS,gBAAgB,OAAOrI,IAAG;AACjC,iBAAO,YAAY,UAAU,KAAK,GAAG,UAAUA,IAAG,GAAG,MAAM,MAAM,CAAC;AAAA,QACnE;AASD,iBAAS,aAAa,OAAO;AAC3B,iBAAO,YAAY,UAAU,KAAK,CAAC;AAAA,QACpC;AAWD,iBAAS,iBAAiB,QAAQ,KAAK,OAAO;AAC5C,cAAK,UAAUqI,eAAa,CAAC,GAAG,OAAO,GAAG,GAAG,KAAK,KAC7C,UAAUA,eAAa,EAAE,OAAO,SAAU;AAC7C,4BAAgB,QAAQ,KAAK,KAAK;AAAA,UACnC;AAAA,QACF;AAYD,iBAAS,YAAY,QAAQ,KAAK,OAAO;AACvC,cAAI,WAAW,OAAO,GAAG;AACzB,cAAI,EAAE,eAAe,KAAK,QAAQ,GAAG,KAAK,GAAG,UAAU,KAAK,MACvD,UAAUA,eAAa,EAAE,OAAO,SAAU;AAC7C,4BAAgB,QAAQ,KAAK,KAAK;AAAA,UACnC;AAAA,QACF;AAUD,iBAAS,aAAa,OAAO,KAAK;AAChC,cAAI,SAAS,MAAM;AACnB,iBAAO,UAAU;AACf,gBAAI,GAAG,MAAM,MAAM,EAAE,CAAC,GAAG,GAAG,GAAG;AAC7B,qBAAO;AAAA,YACR;AAAA,UACF;AACD,iBAAO;AAAA,QACR;AAaD,iBAAS,eAAe,YAAY,QAAQsB,WAAU,aAAa;AACjE,mBAAS,YAAY,SAAS,OAAO,KAAKpB,aAAY;AACpD,mBAAO,aAAa,OAAOoB,UAAS,KAAK,GAAGpB,WAAU;AAAA,UAC9D,CAAO;AACD,iBAAO;AAAA,QACR;AAWD,iBAAS,WAAW,QAAQ,QAAQ;AAClC,iBAAO,UAAU,WAAW,QAAQ,KAAK,MAAM,GAAG,MAAM;AAAA,QACzD;AAWD,iBAAS,aAAa,QAAQ,QAAQ;AACpC,iBAAO,UAAU,WAAW,QAAQ,OAAO,MAAM,GAAG,MAAM;AAAA,QAC3D;AAWD,iBAAS,gBAAgB,QAAQ,KAAK,OAAO;AAC3C,cAAI,OAAO,eAAe,gBAAgB;AACxC,2BAAe,QAAQ,KAAK;AAAA,cAC1B,gBAAgB;AAAA,cAChB,cAAc;AAAA,cACd,SAAS;AAAA,cACT,YAAY;AAAA,YACtB,CAAS;AAAA,UACT,OAAa;AACL,mBAAO,GAAG,IAAI;AAAA,UACf;AAAA,QACF;AAUD,iBAAS,OAAO,QAAQ,OAAO;AAC7B,cAAIzI,SAAQ,IACR,SAAS,MAAM,QACf4J,UAASjB,OAAM,MAAM,GACrB,OAAO,UAAU;AAErB,iBAAO,EAAE3I,SAAQ,QAAQ;AACvB,YAAA4J,QAAO5J,MAAK,IAAI,OAAOuI,cAAY,IAAI,QAAQ,MAAMvI,MAAK,CAAC;AAAA,UAC5D;AACD,iBAAO4J;AAAA,QACR;AAWD,iBAAS,UAAUvG,SAAQ,OAAO,OAAO;AACvC,cAAIA,YAAWA,SAAQ;AACrB,gBAAI,UAAUkF,aAAW;AACvB,cAAAlF,UAASA,WAAU,QAAQA,UAAS;AAAA,YACrC;AACD,gBAAI,UAAUkF,aAAW;AACvB,cAAAlF,UAASA,WAAU,QAAQA,UAAS;AAAA,YACrC;AAAA,UACF;AACD,iBAAOA;AAAA,QACR;AAkBD,iBAAS,UAAU,OAAO,SAAS,YAAY,KAAK,QAAQ,OAAO;AACjE,cAAIuG,SACA,SAAS,UAAU,iBACnB,SAAS,UAAU,iBACnB,SAAS,UAAU;AAEvB,cAAI,YAAY;AACd,YAAAA,UAAS,SAAS,WAAW,OAAO,KAAK,QAAQ,KAAK,IAAI,WAAW,KAAK;AAAA,UAC3E;AACD,cAAIA,YAAWrB,aAAW;AACxB,mBAAOqB;AAAA,UACR;AACD,cAAI,CAAC,SAAS,KAAK,GAAG;AACpB,mBAAO;AAAA,UACR;AACD,cAAI,QAAQ,QAAQ,KAAK;AACzB,cAAI,OAAO;AACT,YAAAA,UAAS,eAAe,KAAK;AAC7B,gBAAI,CAAC,QAAQ;AACX,qBAAO,UAAU,OAAOA,OAAM;AAAA,YAC/B;AAAA,UACT,OAAa;AACL,gBAAI,MAAM,OAAO,KAAK,GAClB,SAAS,OAAO,WAAW,OAAO;AAEtC,gBAAI,SAAS,KAAK,GAAG;AACnB,qBAAO,YAAY,OAAO,MAAM;AAAA,YACjC;AACD,gBAAI,OAAO,aAAa,OAAO,WAAY,UAAU,CAAC,QAAS;AAC7D,cAAAA,UAAU,UAAU,SAAU,CAAA,IAAK,gBAAgB,KAAK;AACxD,kBAAI,CAAC,QAAQ;AACX,uBAAO,SACH,cAAc,OAAO,aAAaA,SAAQ,KAAK,CAAC,IAChD,YAAY,OAAO,WAAWA,SAAQ,KAAK,CAAC;AAAA,cACjD;AAAA,YACX,OAAe;AACL,kBAAI,CAAC,cAAc,GAAG,GAAG;AACvB,uBAAO,SAAS,QAAQ;cACzB;AACD,cAAAA,UAAS,eAAe,OAAO,KAAK,MAAM;AAAA,YAC3C;AAAA,UACF;AAED,oBAAU,QAAQ,IAAIK;AACtB,cAAI,UAAU,MAAM,IAAI,KAAK;AAC7B,cAAI,SAAS;AACX,mBAAO;AAAA,UACR;AACD,gBAAM,IAAI,OAAOL,OAAM;AAEvB,cAAI,MAAM,KAAK,GAAG;AAChB,kBAAM,QAAQ,SAAS,UAAU;AAC/B,cAAAA,QAAO,IAAI,UAAU,UAAU,SAAS,YAAY,UAAU,OAAO,KAAK,CAAC;AAAA,YACrF,CAAS;AAAA,UACT,WAAiB,MAAM,KAAK,GAAG;AACvB,kBAAM,QAAQ,SAAS,UAAUtE,MAAK;AACpC,cAAAsE,QAAO,IAAItE,MAAK,UAAU,UAAU,SAAS,YAAYA,MAAK,OAAO,KAAK,CAAC;AAAA,YACrF,CAAS;AAAA,UACF;AAED,cAAI,WAAW,SACV,SAAS,eAAe,aACxB,SAAS,SAAS;AAEvB,cAAI,QAAQ,QAAQiD,cAAY,SAAS,KAAK;AAC9C,oBAAU,SAAS,OAAO,SAAS,UAAUjD,MAAK;AAChD,gBAAI,OAAO;AACT,cAAAA,OAAM;AACN,yBAAW,MAAMA,IAAG;AAAA,YACrB;AAED,wBAAYsE,SAAQtE,MAAK,UAAU,UAAU,SAAS,YAAYA,MAAK,OAAO,KAAK,CAAC;AAAA,UAC5F,CAAO;AACD,iBAAOsE;AAAA,QACR;AASD,iBAAS,aAAa,QAAQ;AAC5B,cAAI,QAAQ,KAAK,MAAM;AACvB,iBAAO,SAAS,QAAQ;AACtB,mBAAO,eAAe,QAAQ,QAAQ,KAAK;AAAA,UACnD;AAAA,QACK;AAUD,iBAAS,eAAe,QAAQ,QAAQ,OAAO;AAC7C,cAAI,SAAS,MAAM;AACnB,cAAI,UAAU,MAAM;AAClB,mBAAO,CAAC;AAAA,UACT;AACD,mBAASZ,QAAO,MAAM;AACtB,iBAAO,UAAU;AACf,gBAAI,MAAM,MAAM,MAAM,GAClB,YAAY,OAAO,GAAG,GACtB,QAAQ,OAAO,GAAG;AAEtB,gBAAK,UAAUT,eAAa,EAAE,OAAO,WAAY,CAAC,UAAU,KAAK,GAAG;AAClE,qBAAO;AAAA,YACR;AAAA,UACF;AACD,iBAAO;AAAA,QACR;AAYD,iBAAS,UAAU,MAAM,MAAM,MAAM;AACnC,cAAI,OAAO,QAAQ,YAAY;AAC7B,kBAAM,IAAIY,WAAU,eAAe;AAAA,UACpC;AACD,iBAAOe,YAAW,WAAW;AAAE,iBAAK,MAAM3B,aAAW,IAAI;AAAA,aAAM,IAAI;AAAA,QACpE;AAaD,iBAAS,eAAe,OAAOyB,SAAQH,WAAU,YAAY;AAC3D,cAAI7J,SAAQ,IACRmK,YAAW,eACX,WAAW,MACX,SAAS,MAAM,QACfP,UAAS,CAAE,GACX,eAAeI,QAAO;AAE1B,cAAI,CAAC,QAAQ;AACX,mBAAOJ;AAAA,UACR;AACD,cAAIC,WAAU;AACZ,YAAAG,UAAS,SAASA,SAAQ,UAAUH,SAAQ,CAAC;AAAA,UAC9C;AACD,cAAI,YAAY;AACd,YAAAM,YAAW;AACX,uBAAW;AAAA,UACZ,WACQH,QAAO,UAAU,kBAAkB;AAC1C,YAAAG,YAAW;AACX,uBAAW;AACX,YAAAH,UAAS,IAAI,SAASA,OAAM;AAAA,UAC7B;AACD;AACA,mBAAO,EAAEhK,SAAQ,QAAQ;AACvB,kBAAI,QAAQ,MAAMA,MAAK,GACnB,WAAW6J,aAAY,OAAO,QAAQA,UAAS,KAAK;AAExD,sBAAS,cAAc,UAAU,IAAK,QAAQ;AAC9C,kBAAI,YAAY,aAAa,UAAU;AACrC,oBAAI,cAAc;AAClB,uBAAO,eAAe;AACpB,sBAAIG,QAAO,WAAW,MAAM,UAAU;AACpC,6BAAS;AAAA,kBACV;AAAA,gBACF;AACD,gBAAAJ,QAAO,KAAK,KAAK;AAAA,cAClB,WACQ,CAACO,UAASH,SAAQ,UAAU,UAAU,GAAG;AAChD,gBAAAJ,QAAO,KAAK,KAAK;AAAA,cAClB;AAAA,YACF;AACD,iBAAOA;AAAA,QACR;AAUD,YAAI,WAAW,eAAe,UAAU;AAUxC,YAAI,gBAAgB,eAAe,iBAAiB,IAAI;AAWxD,iBAAS,UAAU,YAAY,WAAW;AACxC,cAAIA,UAAS;AACb,mBAAS,YAAY,SAAS,OAAO5J,QAAOyI,aAAY;AACtD,YAAAmB,UAAS,CAAC,CAAC,UAAU,OAAO5J,QAAOyI,WAAU;AAC7C,mBAAOmB;AAAA,UACf,CAAO;AACD,iBAAOA;AAAA,QACR;AAYD,iBAAS,aAAa,OAAOC,WAAU,YAAY;AACjD,cAAI7J,SAAQ,IACR,SAAS,MAAM;AAEnB,iBAAO,EAAEA,SAAQ,QAAQ;AACvB,gBAAI,QAAQ,MAAMA,MAAK,GACnB,UAAU6J,UAAS,KAAK;AAE5B,gBAAI,WAAW,SAAS,aAAatB,cAC5B,YAAY,WAAW,CAAC,SAAS,OAAO,IACzC,WAAW,SAAS,QAAQ,IAC7B;AACL,kBAAI,WAAW,SACXqB,UAAS;AAAA,YACd;AAAA,UACF;AACD,iBAAOA;AAAA,QACR;AAYD,iBAAS,SAAS,OAAO,OAAO,OAAO,KAAK;AAC1C,cAAI,SAAS,MAAM;AAEnB,kBAAQ,UAAU,KAAK;AACvB,cAAI,QAAQ,GAAG;AACb,oBAAQ,CAAC,QAAQ,SAAS,IAAK,SAAS;AAAA,UACzC;AACD,gBAAO,QAAQrB,eAAa,MAAM,SAAU,SAAS,UAAU,GAAG;AAClE,cAAI,MAAM,GAAG;AACX,mBAAO;AAAA,UACR;AACD,gBAAM,QAAQ,MAAM,IAAI,SAAS,GAAG;AACpC,iBAAO,QAAQ,KAAK;AAClB,kBAAM,OAAO,IAAI;AAAA,UAClB;AACD,iBAAO;AAAA,QACR;AAUD,iBAAS,WAAW,YAAY,WAAW;AACzC,cAAIqB,UAAS,CAAA;AACb,mBAAS,YAAY,SAAS,OAAO5J,QAAOyI,aAAY;AACtD,gBAAI,UAAU,OAAOzI,QAAOyI,WAAU,GAAG;AACvC,cAAAmB,QAAO,KAAK,KAAK;AAAA,YAClB;AAAA,UACT,CAAO;AACD,iBAAOA;AAAA,QACR;AAaD,iBAAS,YAAY,OAAO,OAAO,WAAW,UAAUA,SAAQ;AAC9D,cAAI5J,SAAQ,IACR,SAAS,MAAM;AAEnB,wBAAc,YAAY;AAC1B,UAAA4J,YAAWA,UAAS,CAAA;AAEpB,iBAAO,EAAE5J,SAAQ,QAAQ;AACvB,gBAAI,QAAQ,MAAMA,MAAK;AACvB,gBAAI,QAAQ,KAAK,UAAU,KAAK,GAAG;AACjC,kBAAI,QAAQ,GAAG;AAEb,4BAAY,OAAO,QAAQ,GAAG,WAAW,UAAU4J,OAAM;AAAA,cACrE,OAAiB;AACL,0BAAUA,SAAQ,KAAK;AAAA,cACxB;AAAA,YACX,WAAmB,CAAC,UAAU;AACpB,cAAAA,QAAOA,QAAO,MAAM,IAAI;AAAA,YACzB;AAAA,UACF;AACD,iBAAOA;AAAA,QACR;AAaD,YAAI,UAAU;AAYd,YAAI,eAAe,cAAc,IAAI;AAUrC,iBAAS,WAAW,QAAQC,WAAU;AACpC,iBAAO,UAAU,QAAQ,QAAQA,WAAU,IAAI;AAAA,QAChD;AAUD,iBAAS,gBAAgB,QAAQA,WAAU;AACzC,iBAAO,UAAU,aAAa,QAAQA,WAAU,IAAI;AAAA,QACrD;AAWD,iBAAS,cAAc,QAAQ,OAAO;AACpC,iBAAO,YAAY,OAAO,SAAS,KAAK;AACtC,mBAAO,WAAW,OAAO,GAAG,CAAC;AAAA,UACrC,CAAO;AAAA,QACF;AAUD,iBAAS,QAAQ,QAAQ,MAAM;AAC7B,iBAAO,SAAS,MAAM,MAAM;AAE5B,cAAI7J,SAAQ,GACR,SAAS,KAAK;AAElB,iBAAO,UAAU,QAAQA,SAAQ,QAAQ;AACvC,qBAAS,OAAO,MAAM,KAAKA,QAAO,CAAC,CAAC;AAAA,UACrC;AACD,iBAAQA,UAASA,UAAS,SAAU,SAASuI;AAAAA,QAC9C;AAaD,iBAAS,eAAe,QAAQ,UAAU,aAAa;AACrD,cAAIqB,UAAS,SAAS,MAAM;AAC5B,iBAAO,QAAQ,MAAM,IAAIA,UAAS,UAAUA,SAAQ,YAAY,MAAM,CAAC;AAAA,QACxE;AASD,iBAAS,WAAW,OAAO;AACzB,cAAI,SAAS,MAAM;AACjB,mBAAO,UAAUrB,cAAY,eAAe;AAAA,UAC7C;AACD,iBAAQ,kBAAkB,kBAAkBS,QAAO,KAAK,IACpD,UAAU,KAAK,IACf,eAAe,KAAK;AAAA,QACzB;AAWD,iBAAS,OAAO,OAAO,OAAO;AAC5B,iBAAO,QAAQ;AAAA,QAChB;AAUD,iBAAS,QAAQ,QAAQ,KAAK;AAC5B,iBAAO,UAAU,QAAQ,eAAe,KAAK,QAAQ,GAAG;AAAA,QACzD;AAUD,iBAAS,UAAU,QAAQ,KAAK;AAC9B,iBAAO,UAAU,QAAQ,OAAOA,QAAO,MAAM;AAAA,QAC9C;AAWD,iBAAS,YAAY3F,SAAQ,OAAO,KAAK;AACvC,iBAAOA,WAAU,UAAU,OAAO,GAAG,KAAKA,UAAS,UAAU,OAAO,GAAG;AAAA,QACxE;AAYD,iBAAS,iBAAiB,QAAQwG,WAAU,YAAY;AACtD,cAAIM,YAAW,aAAa,oBAAoB,eAC5C,SAAS,OAAO,CAAC,EAAE,QACnB,YAAY,OAAO,QACnB,WAAW,WACX,SAASxB,OAAM,SAAS,GACxB,YAAY,UACZiB,UAAS,CAAA;AAEb,iBAAO,YAAY;AACjB,gBAAI,QAAQ,OAAO,QAAQ;AAC3B,gBAAI,YAAYC,WAAU;AACxB,sBAAQ,SAAS,OAAO,UAAUA,SAAQ,CAAC;AAAA,YAC5C;AACD,wBAAY,UAAU,MAAM,QAAQ,SAAS;AAC7C,mBAAO,QAAQ,IAAI,CAAC,eAAeA,aAAa,UAAU,OAAO,MAAM,UAAU,OAC7E,IAAI,SAAS,YAAY,KAAK,IAC9BtB;AAAAA,UACL;AACD,kBAAQ,OAAO,CAAC;AAEhB,cAAIvI,SAAQ,IACR,OAAO,OAAO,CAAC;AAEnB;AACA,mBAAO,EAAEA,SAAQ,UAAU4J,QAAO,SAAS,WAAW;AACpD,kBAAI,QAAQ,MAAM5J,MAAK,GACnB,WAAW6J,YAAWA,UAAS,KAAK,IAAI;AAE5C,sBAAS,cAAc,UAAU,IAAK,QAAQ;AAC9C,kBAAI,EAAE,OACE,SAAS,MAAM,QAAQ,IACvBM,UAASP,SAAQ,UAAU,UAAU,IACtC;AACL,2BAAW;AACX,uBAAO,EAAE,UAAU;AACjB,sBAAI,QAAQ,OAAO,QAAQ;AAC3B,sBAAI,EAAE,QACE,SAAS,OAAO,QAAQ,IACxBO,UAAS,OAAO,QAAQ,GAAG,UAAU,UAAU,IACjD;AACJ,6BAAS;AAAA,kBACV;AAAA,gBACF;AACD,oBAAI,MAAM;AACR,uBAAK,KAAK,QAAQ;AAAA,gBACnB;AACD,gBAAAP,QAAO,KAAK,KAAK;AAAA,cAClB;AAAA,YACF;AACD,iBAAOA;AAAA,QACR;AAaD,iBAAS,aAAa,QAAQ,QAAQC,WAAU,aAAa;AAC3D,qBAAW,QAAQ,SAAS,OAAO,KAAKO,SAAQ;AAC9C,mBAAO,aAAaP,UAAS,KAAK,GAAG,KAAKO,OAAM;AAAA,UACxD,CAAO;AACD,iBAAO;AAAA,QACR;AAYD,iBAAS,WAAW,QAAQ,MAAM,MAAM;AACtC,iBAAO,SAAS,MAAM,MAAM;AAC5B,mBAAS,OAAO,QAAQ,IAAI;AAC5B,cAAI,OAAO,UAAU,OAAO,SAAS,OAAO,MAAM,KAAK,IAAI,CAAC,CAAC;AAC7D,iBAAO,QAAQ,OAAO7B,cAAY,MAAM,MAAM,QAAQ,IAAI;AAAA,QAC3D;AASD,iBAAS,gBAAgB,OAAO;AAC9B,iBAAO,aAAa,KAAK,KAAK,WAAW,KAAK,KAAK;AAAA,QACpD;AASD,iBAAS,kBAAkB,OAAO;AAChC,iBAAO,aAAa,KAAK,KAAK,WAAW,KAAK,KAAK;AAAA,QACpD;AASD,iBAAS,WAAW,OAAO;AACzB,iBAAO,aAAa,KAAK,KAAK,WAAW,KAAK,KAAK;AAAA,QACpD;AAgBD,iBAAS,YAAY,OAAO,OAAO,SAAS,YAAY,OAAO;AAC7D,cAAI,UAAU,OAAO;AACnB,mBAAO;AAAA,UACR;AACD,cAAI,SAAS,QAAQ,SAAS,QAAS,CAAC,aAAa,KAAK,KAAK,CAAC,aAAa,KAAK,GAAI;AACpF,mBAAO,UAAU,SAAS,UAAU;AAAA,UACrC;AACD,iBAAO,gBAAgB,OAAO,OAAO,SAAS,YAAY,aAAa,KAAK;AAAA,QAC7E;AAgBD,iBAAS,gBAAgB,QAAQ,OAAO,SAAS,YAAY,WAAW,OAAO;AAC7E,cAAI,WAAW,QAAQ,MAAM,GACzB,WAAW,QAAQ,KAAK,GACxB,SAAS,WAAW,WAAW,OAAO,MAAM,GAC5C,SAAS,WAAW,WAAW,OAAO,KAAK;AAE/C,mBAAS,UAAU,UAAU,YAAY;AACzC,mBAAS,UAAU,UAAU,YAAY;AAEzC,cAAI,WAAW,UAAU,WACrB,WAAW,UAAU,WACrB,YAAY,UAAU;AAE1B,cAAI,aAAa,SAAS,MAAM,GAAG;AACjC,gBAAI,CAAC,SAAS,KAAK,GAAG;AACpB,qBAAO;AAAA,YACR;AACD,uBAAW;AACX,uBAAW;AAAA,UACZ;AACD,cAAI,aAAa,CAAC,UAAU;AAC1B,sBAAU,QAAQ,IAAI0B;AACtB,mBAAQ,YAAY,aAAa,MAAM,IACnC,YAAY,QAAQ,OAAO,SAAS,YAAY,WAAW,KAAK,IAChE,WAAW,QAAQ,OAAO,QAAQ,SAAS,YAAY,WAAW,KAAK;AAAA,UAC5E;AACD,cAAI,EAAE,UAAU,uBAAuB;AACrC,gBAAI,eAAe,YAAY,eAAe,KAAK,QAAQ,aAAa,GACpE,eAAe,YAAY,eAAe,KAAK,OAAO,aAAa;AAEvE,gBAAI,gBAAgB,cAAc;AAChC,kBAAI,eAAe,eAAe,OAAO,MAAO,IAAG,QAC/C,eAAe,eAAe,MAAM,MAAK,IAAK;AAElD,wBAAU,QAAQ,IAAIA;AACtB,qBAAO,UAAU,cAAc,cAAc,SAAS,YAAY,KAAK;AAAA,YACxE;AAAA,UACF;AACD,cAAI,CAAC,WAAW;AACd,mBAAO;AAAA,UACR;AACD,oBAAU,QAAQ,IAAIA;AACtB,iBAAO,aAAa,QAAQ,OAAO,SAAS,YAAY,WAAW,KAAK;AAAA,QACzE;AASD,iBAAS,UAAU,OAAO;AACxB,iBAAO,aAAa,KAAK,KAAK,OAAO,KAAK,KAAK;AAAA,QAChD;AAYD,iBAAS,YAAY,QAAQ,QAAQ,WAAW,YAAY;AAC1D,cAAIjK,SAAQ,UAAU,QAClB,SAASA,QACT,eAAe,CAAC;AAEpB,cAAI,UAAU,MAAM;AAClB,mBAAO,CAAC;AAAA,UACT;AACD,mBAASgJ,QAAO,MAAM;AACtB,iBAAOhJ,UAAS;AACd,gBAAI,OAAO,UAAUA,MAAK;AAC1B,gBAAK,gBAAgB,KAAK,CAAC,IACnB,KAAK,CAAC,MAAM,OAAO,KAAK,CAAC,CAAC,IAC1B,EAAE,KAAK,CAAC,KAAK,SACf;AACJ,qBAAO;AAAA,YACR;AAAA,UACF;AACD,iBAAO,EAAEA,SAAQ,QAAQ;AACvB,mBAAO,UAAUA,MAAK;AACtB,gBAAI,MAAM,KAAK,CAAC,GACZ,WAAW,OAAO,GAAG,GACrB,WAAW,KAAK,CAAC;AAErB,gBAAI,gBAAgB,KAAK,CAAC,GAAG;AAC3B,kBAAI,aAAauI,eAAa,EAAE,OAAO,SAAS;AAC9C,uBAAO;AAAA,cACR;AAAA,YACX,OAAe;AACL,kBAAI,QAAQ,IAAI0B;AAChB,kBAAI,YAAY;AACd,oBAAIL,UAAS,WAAW,UAAU,UAAU,KAAK,QAAQ,QAAQ,KAAK;AAAA,cACvE;AACD,kBAAI,EAAEA,YAAWrB,cACT,YAAY,UAAU,UAAU,uBAAuB,wBAAwB,YAAY,KAAK,IAChGqB,UACD;AACL,uBAAO;AAAA,cACR;AAAA,YACF;AAAA,UACF;AACD,iBAAO;AAAA,QACR;AAUD,iBAAS,aAAa,OAAO;AAC3B,cAAI,CAAC,SAAS,KAAK,KAAK,SAAS,KAAK,GAAG;AACvC,mBAAO;AAAA,UACR;AACD,cAAI,UAAU,WAAW,KAAK,IAAI,aAAa;AAC/C,iBAAO,QAAQ,KAAK,SAAS,KAAK,CAAC;AAAA,QACpC;AASD,iBAAS,aAAa,OAAO;AAC3B,iBAAO,aAAa,KAAK,KAAK,WAAW,KAAK,KAAK;AAAA,QACpD;AASD,iBAAS,UAAU,OAAO;AACxB,iBAAO,aAAa,KAAK,KAAK,OAAO,KAAK,KAAK;AAAA,QAChD;AASD,iBAAS,iBAAiB,OAAO;AAC/B,iBAAO,aAAa,KAAK,KACvB,SAAS,MAAM,MAAM,KAAK,CAAC,CAAC,eAAe,WAAW,KAAK,CAAC;AAAA,QAC/D;AASD,iBAAS,aAAa,OAAO;AAG3B,cAAI,OAAO,SAAS,YAAY;AAC9B,mBAAO;AAAA,UACR;AACD,cAAI,SAAS,MAAM;AACjB,mBAAO;AAAA,UACR;AACD,cAAI,OAAO,SAAS,UAAU;AAC5B,mBAAO,QAAQ,KAAK,IAChB,oBAAoB,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,IACtC,YAAY,KAAK;AAAA,UACtB;AACD,iBAAO,SAAS,KAAK;AAAA,QACtB;AASD,iBAAS,SAAS,QAAQ;AACxB,cAAI,CAAC,YAAY,MAAM,GAAG;AACxB,mBAAO,WAAW,MAAM;AAAA,UACzB;AACD,cAAIA,UAAS,CAAA;AACb,mBAAS,OAAOZ,QAAO,MAAM,GAAG;AAC9B,gBAAI,eAAe,KAAK,QAAQ,GAAG,KAAK,OAAO,eAAe;AAC5D,cAAAY,QAAO,KAAK,GAAG;AAAA,YAChB;AAAA,UACF;AACD,iBAAOA;AAAA,QACR;AASD,iBAAS,WAAW,QAAQ;AAC1B,cAAI,CAAC,SAAS,MAAM,GAAG;AACrB,mBAAO,aAAa,MAAM;AAAA,UAC3B;AACD,cAAI,UAAU,YAAY,MAAM,GAC5BA,UAAS,CAAA;AAEb,mBAAS,OAAO,QAAQ;AACtB,gBAAI,EAAE,OAAO,kBAAkB,WAAW,CAAC,eAAe,KAAK,QAAQ,GAAG,KAAK;AAC7E,cAAAA,QAAO,KAAK,GAAG;AAAA,YAChB;AAAA,UACF;AACD,iBAAOA;AAAA,QACR;AAWD,iBAAS,OAAO,OAAO,OAAO;AAC5B,iBAAO,QAAQ;AAAA,QAChB;AAUD,iBAAS,QAAQ,YAAYC,WAAU;AACrC,cAAI7J,SAAQ,IACR4J,UAAS,YAAY,UAAU,IAAIjB,OAAM,WAAW,MAAM,IAAI;AAElE,mBAAS,YAAY,SAAS,OAAO,KAAKF,aAAY;AACpD,YAAAmB,QAAO,EAAE5J,MAAK,IAAI6J,UAAS,OAAO,KAAKpB,WAAU;AAAA,UACzD,CAAO;AACD,iBAAOmB;AAAA,QACR;AASD,iBAAS,YAAY,QAAQ;AAC3B,cAAI,YAAY,aAAa,MAAM;AACnC,cAAI,UAAU,UAAU,KAAK,UAAU,CAAC,EAAE,CAAC,GAAG;AAC5C,mBAAO,wBAAwB,UAAU,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,EAAE,CAAC,CAAC;AAAA,UAChE;AACD,iBAAO,SAAS,QAAQ;AACtB,mBAAO,WAAW,UAAU,YAAY,QAAQ,QAAQ,SAAS;AAAA,UACzE;AAAA,QACK;AAUD,iBAAS,oBAAoB,MAAM,UAAU;AAC3C,cAAI,MAAM,IAAI,KAAK,mBAAmB,QAAQ,GAAG;AAC/C,mBAAO,wBAAwB,MAAM,IAAI,GAAG,QAAQ;AAAA,UACrD;AACD,iBAAO,SAAS,QAAQ;AACtB,gBAAI,WAAW,IAAI,QAAQ,IAAI;AAC/B,mBAAQ,aAAarB,eAAa,aAAa,WAC3C,MAAM,QAAQ,IAAI,IAClB,YAAY,UAAU,UAAU,uBAAuB,sBAAsB;AAAA,UACzF;AAAA,QACK;AAaD,iBAAS,UAAU,QAAQ,QAAQ,UAAU,YAAY,OAAO;AAC9D,cAAI,WAAW,QAAQ;AACrB;AAAA,UACD;AACD,kBAAQ,QAAQ,SAAS,UAAU,KAAK;AACtC,sBAAU,QAAQ,IAAI0B;AACtB,gBAAI,SAAS,QAAQ,GAAG;AACtB,4BAAc,QAAQ,QAAQ,KAAK,UAAU,WAAW,YAAY,KAAK;AAAA,YAC1E,OACI;AACH,kBAAI,WAAW,aACX,WAAW,QAAQ,QAAQ,GAAG,GAAG,UAAW,MAAM,IAAK,QAAQ,QAAQ,KAAK,IAC5E1B;AAEJ,kBAAI,aAAaA,aAAW;AAC1B,2BAAW;AAAA,cACZ;AACD,+BAAiB,QAAQ,KAAK,QAAQ;AAAA,YACvC;AAAA,UACF,GAAE,MAAM;AAAA,QACV;AAiBD,iBAAS,cAAc,QAAQ,QAAQ,KAAK,UAAU,WAAW,YAAY,OAAO;AAClF,cAAI,WAAW,QAAQ,QAAQ,GAAG,GAC9B,WAAW,QAAQ,QAAQ,GAAG,GAC9B,UAAU,MAAM,IAAI,QAAQ;AAEhC,cAAI,SAAS;AACX,6BAAiB,QAAQ,KAAK,OAAO;AACrC;AAAA,UACD;AACD,cAAI,WAAW,aACX,WAAW,UAAU,UAAW,MAAM,IAAK,QAAQ,QAAQ,KAAK,IAChEA;AAEJ,cAAI,WAAW,aAAaA;AAE5B,cAAI,UAAU;AACZ,gBAAI,QAAQ,QAAQ,QAAQ,GACxB,SAAS,CAAC,SAAS,SAAS,QAAQ,GACpC,UAAU,CAAC,SAAS,CAAC,UAAU,aAAa,QAAQ;AAExD,uBAAW;AACX,gBAAI,SAAS,UAAU,SAAS;AAC9B,kBAAI,QAAQ,QAAQ,GAAG;AACrB,2BAAW;AAAA,cACZ,WACQ,kBAAkB,QAAQ,GAAG;AACpC,2BAAW,UAAU,QAAQ;AAAA,cAC9B,WACQ,QAAQ;AACf,2BAAW;AACX,2BAAW,YAAY,UAAU,IAAI;AAAA,cACtC,WACQ,SAAS;AAChB,2BAAW;AACX,2BAAW,gBAAgB,UAAU,IAAI;AAAA,cAC1C,OACI;AACH,2BAAW,CAAA;AAAA,cACZ;AAAA,YACF,WACQ,cAAc,QAAQ,KAAK,YAAY,QAAQ,GAAG;AACzD,yBAAW;AACX,kBAAI,YAAY,QAAQ,GAAG;AACzB,2BAAW,cAAc,QAAQ;AAAA,cAClC,WACQ,CAAC,SAAS,QAAQ,KAAK,WAAW,QAAQ,GAAG;AACpD,2BAAW,gBAAgB,QAAQ;AAAA,cACpC;AAAA,YACF,OACI;AACH,yBAAW;AAAA,YACZ;AAAA,UACF;AACD,cAAI,UAAU;AAEZ,kBAAM,IAAI,UAAU,QAAQ;AAC5B,sBAAU,UAAU,UAAU,UAAU,YAAY,KAAK;AACzD,kBAAM,QAAQ,EAAE,QAAQ;AAAA,UACzB;AACD,2BAAiB,QAAQ,KAAK,QAAQ;AAAA,QACvC;AAUD,iBAAS,QAAQ,OAAOrI,IAAG;AACzB,cAAI,SAAS,MAAM;AACnB,cAAI,CAAC,QAAQ;AACX;AAAA,UACD;AACD,UAAAA,MAAKA,KAAI,IAAI,SAAS;AACtB,iBAAO,QAAQA,IAAG,MAAM,IAAI,MAAMA,EAAC,IAAIqI;AAAAA,QACxC;AAWD,iBAAS,YAAY,YAAY,WAAW,QAAQ;AAClD,cAAI,UAAU,QAAQ;AACpB,wBAAY,SAAS,WAAW,SAASsB,WAAU;AACjD,kBAAI,QAAQA,SAAQ,GAAG;AACrB,uBAAO,SAAS,OAAO;AACrB,yBAAO,QAAQ,OAAOA,UAAS,WAAW,IAAIA,UAAS,CAAC,IAAIA,SAAQ;AAAA,gBACrE;AAAA,cACF;AACD,qBAAOA;AAAA,YACjB,CAAS;AAAA,UACT,OAAa;AACL,wBAAY,CAAC,QAAQ;AAAA,UACtB;AAED,cAAI7J,SAAQ;AACZ,sBAAY,SAAS,WAAW,UAAU,YAAW,CAAE,CAAC;AAExD,cAAI4J,UAAS,QAAQ,YAAY,SAAS,OAAO,KAAKnB,aAAY;AAChE,gBAAI,WAAW,SAAS,WAAW,SAASoB,WAAU;AACpD,qBAAOA,UAAS,KAAK;AAAA,YAC/B,CAAS;AACD,mBAAO,EAAE,YAAY,UAAU,SAAS,EAAE7J,QAAO,SAAS;UAClE,CAAO;AAED,iBAAO,WAAW4J,SAAQ,SAAS,QAAQ,OAAO;AAChD,mBAAO,gBAAgB,QAAQ,OAAO,MAAM;AAAA,UACpD,CAAO;AAAA,QACF;AAWD,iBAAS,SAAS,QAAQ,OAAO;AAC/B,iBAAO,WAAW,QAAQ,OAAO,SAAS,OAAO,MAAM;AACrD,mBAAO,MAAM,QAAQ,IAAI;AAAA,UACjC,CAAO;AAAA,QACF;AAWD,iBAAS,WAAW,QAAQ,OAAO,WAAW;AAC5C,cAAI5J,SAAQ,IACR,SAAS,MAAM,QACf4J,UAAS,CAAA;AAEb,iBAAO,EAAE5J,SAAQ,QAAQ;AACvB,gBAAI,OAAO,MAAMA,MAAK,GAClB,QAAQ,QAAQ,QAAQ,IAAI;AAEhC,gBAAI,UAAU,OAAO,IAAI,GAAG;AAC1B,sBAAQ4J,SAAQ,SAAS,MAAM,MAAM,GAAG,KAAK;AAAA,YAC9C;AAAA,UACF;AACD,iBAAOA;AAAA,QACR;AASD,iBAAS,iBAAiB,MAAM;AAC9B,iBAAO,SAAS,QAAQ;AACtB,mBAAO,QAAQ,QAAQ,IAAI;AAAA,UACnC;AAAA,QACK;AAaD,iBAAS,YAAY,OAAOI,SAAQH,WAAU,YAAY;AACxD,cAAIQ,WAAU,aAAa,kBAAkB,aACzCrK,SAAQ,IACR,SAASgK,QAAO,QAChB,OAAO;AAEX,cAAI,UAAUA,SAAQ;AACpB,YAAAA,UAAS,UAAUA,OAAM;AAAA,UAC1B;AACD,cAAIH,WAAU;AACZ,mBAAO,SAAS,OAAO,UAAUA,SAAQ,CAAC;AAAA,UAC3C;AACD,iBAAO,EAAE7J,SAAQ,QAAQ;AACvB,gBAAI,YAAY,GACZ,QAAQgK,QAAOhK,MAAK,GACpB,WAAW6J,YAAWA,UAAS,KAAK,IAAI;AAE5C,oBAAQ,YAAYQ,SAAQ,MAAM,UAAU,WAAW,UAAU,KAAK,IAAI;AACxE,kBAAI,SAAS,OAAO;AAClB,uBAAO,KAAK,MAAM,WAAW,CAAC;AAAA,cAC/B;AACD,qBAAO,KAAK,OAAO,WAAW,CAAC;AAAA,YAChC;AAAA,UACF;AACD,iBAAO;AAAA,QACR;AAWD,iBAAS,WAAW,OAAO,SAAS;AAClC,cAAI,SAAS,QAAQ,QAAQ,SAAS,GAClC,YAAY,SAAS;AAEzB,iBAAO,UAAU;AACf,gBAAIrK,SAAQ,QAAQ,MAAM;AAC1B,gBAAI,UAAU,aAAaA,WAAU,UAAU;AAC7C,kBAAI,WAAWA;AACf,kBAAI,QAAQA,MAAK,GAAG;AAClB,uBAAO,KAAK,OAAOA,QAAO,CAAC;AAAA,cACvC,OAAiB;AACL,0BAAU,OAAOA,MAAK;AAAA,cACvB;AAAA,YACF;AAAA,UACF;AACD,iBAAO;AAAA,QACR;AAWD,iBAAS,WAAW,OAAO,OAAO;AAChC,iBAAO,QAAQ,YAAY,aAAY,KAAM,QAAQ,QAAQ,EAAE;AAAA,QAChE;AAaD,iBAAS,UAAU,OAAO,KAAK,MAAM,WAAW;AAC9C,cAAIA,SAAQ,IACR,SAAS,UAAU,YAAY,MAAM,UAAU,QAAQ,EAAE,GAAG,CAAC,GAC7D4J,UAASjB,OAAM,MAAM;AAEzB,iBAAO,UAAU;AACf,YAAAiB,QAAO,YAAY,SAAS,EAAE5J,MAAK,IAAI;AACvC,qBAAS;AAAA,UACV;AACD,iBAAO4J;AAAA,QACR;AAUD,iBAAS,WAAWzH,SAAQjC,IAAG;AAC7B,cAAI0J,UAAS;AACb,cAAI,CAACzH,WAAUjC,KAAI,KAAKA,KAAI,kBAAkB;AAC5C,mBAAO0J;AAAA,UACR;AAGD,aAAG;AACD,gBAAI1J,KAAI,GAAG;AACT,cAAA0J,WAAUzH;AAAA,YACX;AACD,YAAAjC,KAAI,YAAYA,KAAI,CAAC;AACrB,gBAAIA,IAAG;AACL,cAAAiC,WAAUA;AAAA,YACX;AAAA,UACF,SAAQjC;AAET,iBAAO0J;AAAA,QACR;AAUD,iBAAS,SAAS,MAAM,OAAO;AAC7B,iBAAO,YAAY,SAAS,MAAM,OAAO,QAAQ,GAAG,OAAO,EAAE;AAAA,QAC9D;AASD,iBAAS,WAAW,YAAY;AAC9B,iBAAO,YAAY,OAAO,UAAU,CAAC;AAAA,QACtC;AAUD,iBAAS,eAAe,YAAY1J,IAAG;AACrC,cAAI,QAAQ,OAAO,UAAU;AAC7B,iBAAO,YAAY,OAAO,UAAUA,IAAG,GAAG,MAAM,MAAM,CAAC;AAAA,QACxD;AAYD,iBAAS,QAAQ,QAAQ,MAAM,OAAO,YAAY;AAChD,cAAI,CAAC,SAAS,MAAM,GAAG;AACrB,mBAAO;AAAA,UACR;AACD,iBAAO,SAAS,MAAM,MAAM;AAE5B,cAAIF,SAAQ,IACR,SAAS,KAAK,QACd,YAAY,SAAS,GACrB,SAAS;AAEb,iBAAO,UAAU,QAAQ,EAAEA,SAAQ,QAAQ;AACzC,gBAAI,MAAM,MAAM,KAAKA,MAAK,CAAC,GACvB,WAAW;AAEf,gBAAI,QAAQ,eAAe,QAAQ,iBAAiB,QAAQ,aAAa;AACvE,qBAAO;AAAA,YACR;AAED,gBAAIA,UAAS,WAAW;AACtB,kBAAI,WAAW,OAAO,GAAG;AACzB,yBAAW,aAAa,WAAW,UAAU,KAAK,MAAM,IAAIuI;AAC5D,kBAAI,aAAaA,aAAW;AAC1B,2BAAW,SAAS,QAAQ,IACxB,WACC,QAAQ,KAAKvI,SAAQ,CAAC,CAAC,IAAI,CAAA,IAAK,CAAA;AAAA,cACtC;AAAA,YACF;AACD,wBAAY,QAAQ,KAAK,QAAQ;AACjC,qBAAS,OAAO,GAAG;AAAA,UACpB;AACD,iBAAO;AAAA,QACR;AAUD,YAAI,cAAc,CAAC,UAAU,WAAW,SAAS,MAAM,MAAM;AAC3D,kBAAQ,IAAI,MAAM,IAAI;AACtB,iBAAO;AAAA,QACb;AAUI,YAAI,kBAAkB,CAAC,iBAAiB,WAAW,SAAS,MAAMmC,SAAQ;AACxE,iBAAO,eAAe,MAAM,YAAY;AAAA,YACtC,gBAAgB;AAAA,YAChB,cAAc;AAAA,YACd,SAAS,SAASA,OAAM;AAAA,YACxB,YAAY;AAAA,UACpB,CAAO;AAAA,QACP;AASI,iBAAS,YAAY,YAAY;AAC/B,iBAAO,YAAY,OAAO,UAAU,CAAC;AAAA,QACtC;AAWD,iBAAS,UAAU,OAAO,OAAO,KAAK;AACpC,cAAInC,SAAQ,IACR,SAAS,MAAM;AAEnB,cAAI,QAAQ,GAAG;AACb,oBAAQ,CAAC,QAAQ,SAAS,IAAK,SAAS;AAAA,UACzC;AACD,gBAAM,MAAM,SAAS,SAAS;AAC9B,cAAI,MAAM,GAAG;AACX,mBAAO;AAAA,UACR;AACD,mBAAS,QAAQ,MAAM,IAAM,MAAM,UAAW;AAC9C,qBAAW;AAEX,cAAI4J,UAASjB,OAAM,MAAM;AACzB,iBAAO,EAAE3I,SAAQ,QAAQ;AACvB,YAAA4J,QAAO5J,MAAK,IAAI,MAAMA,SAAQ,KAAK;AAAA,UACpC;AACD,iBAAO4J;AAAA,QACR;AAWD,iBAAS,SAAS,YAAY,WAAW;AACvC,cAAIA;AAEJ,mBAAS,YAAY,SAAS,OAAO5J,QAAOyI,aAAY;AACtD,YAAAmB,UAAS,UAAU,OAAO5J,QAAOyI,WAAU;AAC3C,mBAAO,CAACmB;AAAA,UAChB,CAAO;AACD,iBAAO,CAAC,CAACA;AAAA,QACV;AAcD,iBAAS,gBAAgB,OAAO,OAAO,YAAY;AACjD,cAAI,MAAM,GACN,OAAO,SAAS,OAAO,MAAM,MAAM;AAEvC,cAAI,OAAO,SAAS,YAAY,UAAU,SAAS,QAAQ,uBAAuB;AAChF,mBAAO,MAAM,MAAM;AACjB,kBAAI,MAAO,MAAM,SAAU,GACvB,WAAW,MAAM,GAAG;AAExB,kBAAI,aAAa,QAAQ,CAAC,SAAS,QAAQ,MACtC,aAAc,YAAY,QAAU,WAAW,QAAS;AAC3D,sBAAM,MAAM;AAAA,cACxB,OAAiB;AACL,uBAAO;AAAA,cACR;AAAA,YACF;AACD,mBAAO;AAAA,UACR;AACD,iBAAO,kBAAkB,OAAO,OAAO,UAAU,UAAU;AAAA,QAC5D;AAeD,iBAAS,kBAAkB,OAAO,OAAOC,WAAU,YAAY;AAC7D,cAAI,MAAM,GACN,OAAO,SAAS,OAAO,IAAI,MAAM;AACrC,cAAI,SAAS,GAAG;AACd,mBAAO;AAAA,UACR;AAED,kBAAQA,UAAS,KAAK;AACtB,cAAI,WAAW,UAAU,OACrB,YAAY,UAAU,MACtB,cAAc,SAAS,KAAK,GAC5B,iBAAiB,UAAUtB;AAE/B,iBAAO,MAAM,MAAM;AACjB,gBAAI,MAAM,aAAa,MAAM,QAAQ,CAAC,GAClC,WAAWsB,UAAS,MAAM,GAAG,CAAC,GAC9B,eAAe,aAAatB,aAC5B,YAAY,aAAa,MACzB,iBAAiB,aAAa,UAC9B,cAAc,SAAS,QAAQ;AAEnC,gBAAI,UAAU;AACZ,kBAAI,SAAS,cAAc;AAAA,YAC5B,WAAU,gBAAgB;AACzB,uBAAS,mBAAmB,cAAc;AAAA,YAC3C,WAAU,WAAW;AACpB,uBAAS,kBAAkB,iBAAiB,cAAc,CAAC;AAAA,YAC5D,WAAU,aAAa;AACtB,uBAAS,kBAAkB,gBAAgB,CAAC,cAAc,cAAc,CAAC;AAAA,YACnF,WAAmB,aAAa,aAAa;AACnC,uBAAS;AAAA,YACnB,OAAe;AACL,uBAAS,aAAc,YAAY,QAAU,WAAW;AAAA,YACzD;AACD,gBAAI,QAAQ;AACV,oBAAM,MAAM;AAAA,YACtB,OAAe;AACL,qBAAO;AAAA,YACR;AAAA,UACF;AACD,iBAAO,UAAU,MAAM,eAAe;AAAA,QACvC;AAWD,iBAAS,eAAe,OAAOsB,WAAU;AACvC,cAAI7J,SAAQ,IACR,SAAS,MAAM,QACf,WAAW,GACX4J,UAAS,CAAA;AAEb,iBAAO,EAAE5J,SAAQ,QAAQ;AACvB,gBAAI,QAAQ,MAAMA,MAAK,GACnB,WAAW6J,YAAWA,UAAS,KAAK,IAAI;AAE5C,gBAAI,CAAC7J,UAAS,CAAC,GAAG,UAAU,IAAI,GAAG;AACjC,kBAAI,OAAO;AACX,cAAA4J,QAAO,UAAU,IAAI,UAAU,IAAI,IAAI;AAAA,YACxC;AAAA,UACF;AACD,iBAAOA;AAAA,QACR;AAUD,iBAAS,aAAa,OAAO;AAC3B,cAAI,OAAO,SAAS,UAAU;AAC5B,mBAAO;AAAA,UACR;AACD,cAAI,SAAS,KAAK,GAAG;AACnB,mBAAO;AAAA,UACR;AACD,iBAAO,CAAC;AAAA,QACT;AAUD,iBAAS,aAAa,OAAO;AAE3B,cAAI,OAAO,SAAS,UAAU;AAC5B,mBAAO;AAAA,UACR;AACD,cAAI,QAAQ,KAAK,GAAG;AAElB,mBAAO,SAAS,OAAO,YAAY,IAAI;AAAA,UACxC;AACD,cAAI,SAAS,KAAK,GAAG;AACnB,mBAAO,iBAAiB,eAAe,KAAK,KAAK,IAAI;AAAA,UACtD;AACD,cAAIA,UAAU,QAAQ;AACtB,iBAAQA,WAAU,OAAQ,IAAI,SAAU,CAAC,WAAY,OAAOA;AAAA,QAC7D;AAWD,iBAAS,SAAS,OAAOC,WAAU,YAAY;AAC7C,cAAI7J,SAAQ,IACRmK,YAAW,eACX,SAAS,MAAM,QACf,WAAW,MACXP,UAAS,CAAE,GACX,OAAOA;AAEX,cAAI,YAAY;AACd,uBAAW;AACX,YAAAO,YAAW;AAAA,UACZ,WACQ,UAAU,kBAAkB;AACnC,gBAAIxD,OAAMkD,YAAW,OAAO,UAAU,KAAK;AAC3C,gBAAIlD,MAAK;AACP,qBAAO,WAAWA,IAAG;AAAA,YACtB;AACD,uBAAW;AACX,YAAAwD,YAAW;AACX,mBAAO,IAAI;AAAA,UACZ,OACI;AACH,mBAAON,YAAW,CAAE,IAAGD;AAAA,UACxB;AACD;AACA,mBAAO,EAAE5J,SAAQ,QAAQ;AACvB,kBAAI,QAAQ,MAAMA,MAAK,GACnB,WAAW6J,YAAWA,UAAS,KAAK,IAAI;AAE5C,sBAAS,cAAc,UAAU,IAAK,QAAQ;AAC9C,kBAAI,YAAY,aAAa,UAAU;AACrC,oBAAI,YAAY,KAAK;AACrB,uBAAO,aAAa;AAClB,sBAAI,KAAK,SAAS,MAAM,UAAU;AAChC,6BAAS;AAAA,kBACV;AAAA,gBACF;AACD,oBAAIA,WAAU;AACZ,uBAAK,KAAK,QAAQ;AAAA,gBACnB;AACD,gBAAAD,QAAO,KAAK,KAAK;AAAA,cAClB,WACQ,CAACO,UAAS,MAAM,UAAU,UAAU,GAAG;AAC9C,oBAAI,SAASP,SAAQ;AACnB,uBAAK,KAAK,QAAQ;AAAA,gBACnB;AACD,gBAAAA,QAAO,KAAK,KAAK;AAAA,cAClB;AAAA,YACF;AACD,iBAAOA;AAAA,QACR;AAUD,iBAAS,UAAU,QAAQ,MAAM;AAC/B,iBAAO,SAAS,MAAM,MAAM;AAC5B,mBAAS,OAAO,QAAQ,IAAI;AAC5B,iBAAO,UAAU,QAAQ,OAAO,OAAO,MAAM,KAAK,IAAI,CAAC,CAAC;AAAA,QACzD;AAYD,iBAAS,WAAW,QAAQ,MAAM,SAAS,YAAY;AACrD,iBAAO,QAAQ,QAAQ,MAAM,QAAQ,QAAQ,QAAQ,IAAI,CAAC,GAAG,UAAU;AAAA,QACxE;AAaD,iBAAS,UAAU,OAAO,WAAW,QAAQ,WAAW;AACtD,cAAI,SAAS,MAAM,QACf5J,SAAQ,YAAY,SAAS;AAEjC,kBAAQ,YAAYA,WAAU,EAAEA,SAAQ,WACtC,UAAU,MAAMA,MAAK,GAAGA,QAAO,KAAK,GAAG;AAAA,UAAE;AAE3C,iBAAO,SACH,UAAU,OAAQ,YAAY,IAAIA,QAAS,YAAYA,SAAQ,IAAI,MAAQ,IAC3E,UAAU,OAAQ,YAAYA,SAAQ,IAAI,GAAK,YAAY,SAASA;QACzE;AAYD,iBAAS,iBAAiB,OAAO,SAAS;AACxC,cAAI4J,UAAS;AACb,cAAIA,mBAAkB,aAAa;AACjC,YAAAA,UAASA,QAAO;UACjB;AACD,iBAAO,YAAY,SAAS,SAASA,SAAQ,QAAQ;AACnD,mBAAO,OAAO,KAAK,MAAM,OAAO,SAAS,UAAU,CAACA,OAAM,GAAG,OAAO,IAAI,CAAC;AAAA,UAC1E,GAAEA,OAAM;AAAA,QACV;AAYD,iBAAS,QAAQ,QAAQC,WAAU,YAAY;AAC7C,cAAI,SAAS,OAAO;AACpB,cAAI,SAAS,GAAG;AACd,mBAAO,SAAS,SAAS,OAAO,CAAC,CAAC,IAAI,CAAA;AAAA,UACvC;AACD,cAAI7J,SAAQ,IACR4J,UAASjB,OAAM,MAAM;AAEzB,iBAAO,EAAE3I,SAAQ,QAAQ;AACvB,gBAAI,QAAQ,OAAOA,MAAK,GACpB,WAAW;AAEf,mBAAO,EAAE,WAAW,QAAQ;AAC1B,kBAAI,YAAYA,QAAO;AACrB,gBAAA4J,QAAO5J,MAAK,IAAI,eAAe4J,QAAO5J,MAAK,KAAK,OAAO,OAAO,QAAQ,GAAG6J,WAAU,UAAU;AAAA,cAC9F;AAAA,YACF;AAAA,UACF;AACD,iBAAO,SAAS,YAAYD,SAAQ,CAAC,GAAGC,WAAU,UAAU;AAAA,QAC7D;AAWD,iBAAS,cAAc,OAAOG,SAAQ,YAAY;AAChD,cAAIhK,SAAQ,IACR,SAAS,MAAM,QACf,aAAagK,QAAO,QACpBJ,UAAS,CAAA;AAEb,iBAAO,EAAE5J,SAAQ,QAAQ;AACvB,gBAAI,QAAQA,SAAQ,aAAagK,QAAOhK,MAAK,IAAIuI;AACjD,uBAAWqB,SAAQ,MAAM5J,MAAK,GAAG,KAAK;AAAA,UACvC;AACD,iBAAO4J;AAAA,QACR;AASD,iBAAS,oBAAoB,OAAO;AAClC,iBAAO,kBAAkB,KAAK,IAAI,QAAQ,CAAA;AAAA,QAC3C;AASD,iBAAS,aAAa,OAAO;AAC3B,iBAAO,OAAO,SAAS,aAAa,QAAQ;AAAA,QAC7C;AAUD,iBAAS,SAAS,OAAO,QAAQ;AAC/B,cAAI,QAAQ,KAAK,GAAG;AAClB,mBAAO;AAAA,UACR;AACD,iBAAO,MAAM,OAAO,MAAM,IAAI,CAAC,KAAK,IAAI,aAAa,SAAS,KAAK,CAAC;AAAA,QACrE;AAWD,YAAI,WAAW;AAWf,iBAAS,UAAU,OAAO,OAAO,KAAK;AACpC,cAAI,SAAS,MAAM;AACnB,gBAAM,QAAQrB,cAAY,SAAS;AACnC,iBAAQ,CAAC,SAAS,OAAO,SAAU,QAAQ,UAAU,OAAO,OAAO,GAAG;AAAA,QACvE;AAQD,YAAI+B,gBAAe,mBAAmB,SAAS,IAAI;AACjD,iBAAO,KAAK,aAAa,EAAE;AAAA,QACjC;AAUI,iBAAS,YAAY,QAAQ,QAAQ;AACnC,cAAI,QAAQ;AACV,mBAAO,OAAO;UACf;AACD,cAAI,SAAS,OAAO,QAChBV,UAAS,cAAc,YAAY,MAAM,IAAI,IAAI,OAAO,YAAY,MAAM;AAE9E,iBAAO,KAAKA,OAAM;AAClB,iBAAOA;AAAA,QACR;AASD,iBAAS,iBAAiB,aAAa;AACrC,cAAIA,UAAS,IAAI,YAAY,YAAY,YAAY,UAAU;AAC/D,cAAIN,YAAWM,OAAM,EAAE,IAAI,IAAIN,YAAW,WAAW,CAAC;AACtD,iBAAOM;AAAA,QACR;AAUD,iBAAS,cAAc,UAAU,QAAQ;AACvC,cAAI,SAAS,SAAS,iBAAiB,SAAS,MAAM,IAAI,SAAS;AACnE,iBAAO,IAAI,SAAS,YAAY,QAAQ,SAAS,YAAY,SAAS,UAAU;AAAA,QACjF;AASD,iBAAS,YAAY,QAAQ;AAC3B,cAAIA,UAAS,IAAI,OAAO,YAAY,OAAO,QAAQ,QAAQ,KAAK,MAAM,CAAC;AACvE,UAAAA,QAAO,YAAY,OAAO;AAC1B,iBAAOA;AAAA,QACR;AASD,iBAAS,YAAY,QAAQ;AAC3B,iBAAO,gBAAgBZ,QAAO,cAAc,KAAK,MAAM,CAAC,IAAI;QAC7D;AAUD,iBAAS,gBAAgB,YAAY,QAAQ;AAC3C,cAAI,SAAS,SAAS,iBAAiB,WAAW,MAAM,IAAI,WAAW;AACvE,iBAAO,IAAI,WAAW,YAAY,QAAQ,WAAW,YAAY,WAAW,MAAM;AAAA,QACnF;AAUD,iBAAS,iBAAiB,OAAO,OAAO;AACtC,cAAI,UAAU,OAAO;AACnB,gBAAI,eAAe,UAAUT,aACzB,YAAY,UAAU,MACtB,iBAAiB,UAAU,OAC3B,cAAc,SAAS,KAAK;AAEhC,gBAAI,eAAe,UAAUA,aACzB,YAAY,UAAU,MACtB,iBAAiB,UAAU,OAC3B,cAAc,SAAS,KAAK;AAEhC,gBAAK,CAAC,aAAa,CAAC,eAAe,CAAC,eAAe,QAAQ,SACtD,eAAe,gBAAgB,kBAAkB,CAAC,aAAa,CAAC,eAChE,aAAa,gBAAgB,kBAC7B,CAAC,gBAAgB,kBAClB,CAAC,gBAAgB;AACnB,qBAAO;AAAA,YACR;AACD,gBAAK,CAAC,aAAa,CAAC,eAAe,CAAC,eAAe,QAAQ,SACtD,eAAe,gBAAgB,kBAAkB,CAAC,aAAa,CAAC,eAChE,aAAa,gBAAgB,kBAC7B,CAAC,gBAAgB,kBAClB,CAAC,gBAAgB;AACnB,qBAAO;AAAA,YACR;AAAA,UACF;AACD,iBAAO;AAAA,QACR;AAgBD,iBAAS,gBAAgB,QAAQ,OAAO,QAAQ;AAC9C,cAAIvI,SAAQ,IACR,cAAc,OAAO,UACrB,cAAc,MAAM,UACpB,SAAS,YAAY,QACrB,eAAe,OAAO;AAE1B,iBAAO,EAAEA,SAAQ,QAAQ;AACvB,gBAAI4J,UAAS,iBAAiB,YAAY5J,MAAK,GAAG,YAAYA,MAAK,CAAC;AACpE,gBAAI4J,SAAQ;AACV,kBAAI5J,UAAS,cAAc;AACzB,uBAAO4J;AAAA,cACR;AACD,kBAAI,QAAQ,OAAO5J,MAAK;AACxB,qBAAO4J,WAAU,SAAS,SAAS,KAAK;AAAA,YACzC;AAAA,UACF;AAQD,iBAAO,OAAO,QAAQ,MAAM;AAAA,QAC7B;AAaD,iBAAS,YAAY,MAAM,UAAU,SAAS,WAAW;AACvD,cAAI,YAAY,IACZ,aAAa,KAAK,QAClB,gBAAgB,QAAQ,QACxB,YAAY,IACZ,aAAa,SAAS,QACtB,cAAc,UAAU,aAAa,eAAe,CAAC,GACrDA,UAASjB,OAAM,aAAa,WAAW,GACvC,cAAc,CAAC;AAEnB,iBAAO,EAAE,YAAY,YAAY;AAC/B,YAAAiB,QAAO,SAAS,IAAI,SAAS,SAAS;AAAA,UACvC;AACD,iBAAO,EAAE,YAAY,eAAe;AAClC,gBAAI,eAAe,YAAY,YAAY;AACzC,cAAAA,QAAO,QAAQ,SAAS,CAAC,IAAI,KAAK,SAAS;AAAA,YAC5C;AAAA,UACF;AACD,iBAAO,eAAe;AACpB,YAAAA,QAAO,WAAW,IAAI,KAAK,WAAW;AAAA,UACvC;AACD,iBAAOA;AAAA,QACR;AAaD,iBAAS,iBAAiB,MAAM,UAAU,SAAS,WAAW;AAC5D,cAAI,YAAY,IACZ,aAAa,KAAK,QAClB,eAAe,IACf,gBAAgB,QAAQ,QACxB,aAAa,IACb,cAAc,SAAS,QACvB,cAAc,UAAU,aAAa,eAAe,CAAC,GACrDA,UAASjB,OAAM,cAAc,WAAW,GACxC,cAAc,CAAC;AAEnB,iBAAO,EAAE,YAAY,aAAa;AAChC,YAAAiB,QAAO,SAAS,IAAI,KAAK,SAAS;AAAA,UACnC;AACD,cAAI,SAAS;AACb,iBAAO,EAAE,aAAa,aAAa;AACjC,YAAAA,QAAO,SAAS,UAAU,IAAI,SAAS,UAAU;AAAA,UAClD;AACD,iBAAO,EAAE,eAAe,eAAe;AACrC,gBAAI,eAAe,YAAY,YAAY;AACzC,cAAAA,QAAO,SAAS,QAAQ,YAAY,CAAC,IAAI,KAAK,WAAW;AAAA,YAC1D;AAAA,UACF;AACD,iBAAOA;AAAA,QACR;AAUD,iBAAS,UAAU,QAAQ,OAAO;AAChC,cAAI5J,SAAQ,IACR,SAAS,OAAO;AAEpB,oBAAU,QAAQ2I,OAAM,MAAM;AAC9B,iBAAO,EAAE3I,SAAQ,QAAQ;AACvB,kBAAMA,MAAK,IAAI,OAAOA,MAAK;AAAA,UAC5B;AACD,iBAAO;AAAA,QACR;AAYD,iBAAS,WAAW,QAAQ,OAAO,QAAQ,YAAY;AACrD,cAAI,QAAQ,CAAC;AACb,qBAAW,SAAS,CAAA;AAEpB,cAAIA,SAAQ,IACR,SAAS,MAAM;AAEnB,iBAAO,EAAEA,SAAQ,QAAQ;AACvB,gBAAI,MAAM,MAAMA,MAAK;AAErB,gBAAI,WAAW,aACX,WAAW,OAAO,GAAG,GAAG,OAAO,GAAG,GAAG,KAAK,QAAQ,MAAM,IACxDuI;AAEJ,gBAAI,aAAaA,aAAW;AAC1B,yBAAW,OAAO,GAAG;AAAA,YACtB;AACD,gBAAI,OAAO;AACT,8BAAgB,QAAQ,KAAK,QAAQ;AAAA,YAC/C,OAAe;AACL,0BAAY,QAAQ,KAAK,QAAQ;AAAA,YAClC;AAAA,UACF;AACD,iBAAO;AAAA,QACR;AAUD,iBAAS,YAAY,QAAQ,QAAQ;AACnC,iBAAO,WAAW,QAAQ,WAAW,MAAM,GAAG,MAAM;AAAA,QACrD;AAUD,iBAAS,cAAc,QAAQ,QAAQ;AACrC,iBAAO,WAAW,QAAQ,aAAa,MAAM,GAAG,MAAM;AAAA,QACvD;AAUD,iBAAS,iBAAiB,QAAQ,aAAa;AAC7C,iBAAO,SAAS,YAAYsB,WAAU;AACpC,gBAAI,OAAO,QAAQ,UAAU,IAAI,kBAAkB,gBAC/C,cAAc,cAAc,YAAa,IAAG;AAEhD,mBAAO,KAAK,YAAY,QAAQ,YAAYA,WAAU,CAAC,GAAG,WAAW;AAAA,UAC7E;AAAA,QACK;AASD,iBAAS,eAAe,UAAU;AAChC,iBAAO,SAAS,SAAS,QAAQ,SAAS;AACxC,gBAAI7J,SAAQ,IACR,SAAS,QAAQ,QACjB,aAAa,SAAS,IAAI,QAAQ,SAAS,CAAC,IAAIuI,aAChD,QAAQ,SAAS,IAAI,QAAQ,CAAC,IAAIA;AAEtC,yBAAc,SAAS,SAAS,KAAK,OAAO,cAAc,cACrD,UAAU,cACXA;AAEJ,gBAAI,SAAS,eAAe,QAAQ,CAAC,GAAG,QAAQ,CAAC,GAAG,KAAK,GAAG;AAC1D,2BAAa,SAAS,IAAIA,cAAY;AACtC,uBAAS;AAAA,YACV;AACD,qBAASS,QAAO,MAAM;AACtB,mBAAO,EAAEhJ,SAAQ,QAAQ;AACvB,kBAAI,SAAS,QAAQA,MAAK;AAC1B,kBAAI,QAAQ;AACV,yBAAS,QAAQ,QAAQA,QAAO,UAAU;AAAA,cAC3C;AAAA,YACF;AACD,mBAAO;AAAA,UACf,CAAO;AAAA,QACF;AAUD,iBAAS,eAAe,UAAU,WAAW;AAC3C,iBAAO,SAAS,YAAY6J,WAAU;AACpC,gBAAI,cAAc,MAAM;AACtB,qBAAO;AAAA,YACR;AACD,gBAAI,CAAC,YAAY,UAAU,GAAG;AAC5B,qBAAO,SAAS,YAAYA,SAAQ;AAAA,YACrC;AACD,gBAAI,SAAS,WAAW,QACpB7J,SAAQ,YAAY,SAAS,IAC7B,WAAWgJ,QAAO,UAAU;AAEhC,mBAAQ,YAAYhJ,WAAU,EAAEA,SAAQ,QAAS;AAC/C,kBAAI6J,UAAS,SAAS7J,MAAK,GAAGA,QAAO,QAAQ,MAAM,OAAO;AACxD;AAAA,cACD;AAAA,YACF;AACD,mBAAO;AAAA,UACf;AAAA,QACK;AASD,iBAAS,cAAc,WAAW;AAChC,iBAAO,SAAS,QAAQ6J,WAAU,UAAU;AAC1C,gBAAI7J,SAAQ,IACR,WAAWgJ,QAAO,MAAM,GACxB,QAAQ,SAAS,MAAM,GACvB,SAAS,MAAM;AAEnB,mBAAO,UAAU;AACf,kBAAI,MAAM,MAAM,YAAY,SAAS,EAAEhJ,MAAK;AAC5C,kBAAI6J,UAAS,SAAS,GAAG,GAAG,KAAK,QAAQ,MAAM,OAAO;AACpD;AAAA,cACD;AAAA,YACF;AACD,mBAAO;AAAA,UACf;AAAA,QACK;AAYD,iBAAS,WAAW,MAAM,SAAS,SAAS;AAC1C,cAAI,SAAS,UAAU,gBACnB,OAAO,WAAW,IAAI;AAE1B,mBAAS,UAAU;AACjB,gBAAI,KAAM,QAAQ,SAAS,QAAQ,gBAAgB,UAAW,OAAO;AACrE,mBAAO,GAAG,MAAM,SAAS,UAAU,MAAM,SAAS;AAAA,UACnD;AACD,iBAAO;AAAA,QACR;AASD,iBAAS,gBAAgB,YAAY;AACnC,iBAAO,SAAS1H,SAAQ;AACtB,YAAAA,UAAS,SAASA,OAAM;AAExB,gBAAI,aAAa,WAAWA,OAAM,IAC9B,cAAcA,OAAM,IACpBoG;AAEJ,gBAAI,MAAM,aACN,WAAW,CAAC,IACZpG,QAAO,OAAO,CAAC;AAEnB,gBAAI,WAAW,aACX,UAAU,YAAY,CAAC,EAAE,KAAK,EAAE,IAChCA,QAAO,MAAM,CAAC;AAElB,mBAAO,IAAI,UAAU,EAAG,IAAG;AAAA,UACnC;AAAA,QACK;AASD,iBAAS,iBAAiB,UAAU;AAClC,iBAAO,SAASA,SAAQ;AACtB,mBAAO,YAAY,MAAM,OAAOA,OAAM,EAAE,QAAQ,QAAQ,EAAE,CAAC,GAAG,UAAU,EAAE;AAAA,UAClF;AAAA,QACK;AAUD,iBAAS,WAAW,MAAM;AACxB,iBAAO,WAAW;AAIhB,gBAAI,OAAO;AACX,oBAAQ,KAAK,QAAM;AAAA,cACjB,KAAK;AAAG,uBAAO,IAAI;AAAA,cACnB,KAAK;AAAG,uBAAO,IAAI,KAAK,KAAK,CAAC,CAAC;AAAA,cAC/B,KAAK;AAAG,uBAAO,IAAI,KAAK,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AAAA,cACxC,KAAK;AAAG,uBAAO,IAAI,KAAK,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AAAA,cACjD,KAAK;AAAG,uBAAO,IAAI,KAAK,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AAAA,cAC1D,KAAK;AAAG,uBAAO,IAAI,KAAK,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AAAA,cACnE,KAAK;AAAG,uBAAO,IAAI,KAAK,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AAAA,cAC5E,KAAK;AAAG,uBAAO,IAAI,KAAK,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AAAA,YACtF;AACD,gBAAI,cAAc,WAAW,KAAK,SAAS,GACvCyH,UAAS,KAAK,MAAM,aAAa,IAAI;AAIzC,mBAAO,SAASA,OAAM,IAAIA,UAAS;AAAA,UAC3C;AAAA,QACK;AAWD,iBAAS,YAAY,MAAM,SAAS,OAAO;AACzC,cAAI,OAAO,WAAW,IAAI;AAE1B,mBAAS,UAAU;AACjB,gBAAI,SAAS,UAAU,QACnB,OAAOjB,OAAM,MAAM,GACnB3I,SAAQ,QACR,cAAc,UAAU,OAAO;AAEnC,mBAAOA,UAAS;AACd,mBAAKA,MAAK,IAAI,UAAUA,MAAK;AAAA,YAC9B;AACD,gBAAI,UAAW,SAAS,KAAK,KAAK,CAAC,MAAM,eAAe,KAAK,SAAS,CAAC,MAAM,cACzE,CAAE,IACF,eAAe,MAAM,WAAW;AAEpC,sBAAU,QAAQ;AAClB,gBAAI,SAAS,OAAO;AAClB,qBAAO;AAAA,gBACL;AAAA,gBAAM;AAAA,gBAAS;AAAA,gBAAc,QAAQ;AAAA,gBAAauI;AAAAA,gBAClD;AAAA,gBAAM;AAAA,gBAASA;AAAAA,gBAAWA;AAAAA,gBAAW,QAAQ;AAAA,cAAM;AAAA,YACtD;AACD,gBAAI,KAAM,QAAQ,SAAS,QAAQ,gBAAgB,UAAW,OAAO;AACrE,mBAAO,MAAM,IAAI,MAAM,IAAI;AAAA,UAC5B;AACD,iBAAO;AAAA,QACR;AASD,iBAAS,WAAW,eAAe;AACjC,iBAAO,SAAS,YAAY,WAAW,WAAW;AAChD,gBAAI,WAAWS,QAAO,UAAU;AAChC,gBAAI,CAAC,YAAY,UAAU,GAAG;AAC5B,kBAAIa,YAAW,YAAY,WAAW,CAAC;AACvC,2BAAa,KAAK,UAAU;AAC5B,0BAAY,SAAS,KAAK;AAAE,uBAAOA,UAAS,SAAS,GAAG,GAAG,KAAK,QAAQ;AAAA;YACzE;AACD,gBAAI7J,SAAQ,cAAc,YAAY,WAAW,SAAS;AAC1D,mBAAOA,SAAQ,KAAK,SAAS6J,YAAW,WAAW7J,MAAK,IAAIA,MAAK,IAAIuI;AAAAA,UAC7E;AAAA,QACK;AASD,iBAAS,WAAW,WAAW;AAC7B,iBAAO,SAAS,SAAS,OAAO;AAC9B,gBAAI,SAAS,MAAM,QACfvI,SAAQ,QACR,SAAS,cAAc,UAAU;AAErC,gBAAI,WAAW;AACb,oBAAM,QAAO;AAAA,YACd;AACD,mBAAOA,UAAS;AACd,kBAAI,OAAO,MAAMA,MAAK;AACtB,kBAAI,OAAO,QAAQ,YAAY;AAC7B,sBAAM,IAAImJ,WAAU,eAAe;AAAA,cACpC;AACD,kBAAI,UAAU,CAAC,WAAW,YAAY,IAAI,KAAK,WAAW;AACxD,oBAAI,UAAU,IAAI,cAAc,CAAE,GAAE,IAAI;AAAA,cACzC;AAAA,YACF;AACD,YAAAnJ,SAAQ,UAAUA,SAAQ;AAC1B,mBAAO,EAAEA,SAAQ,QAAQ;AACvB,qBAAO,MAAMA,MAAK;AAElB,kBAAI,WAAW,YAAY,IAAI,GAC3B,OAAO,YAAY,YAAY,QAAQ,IAAI,IAAIuI;AAEnD,kBAAI,QAAQ,WAAW,KAAK,CAAC,CAAC,KACxB,KAAK,CAAC,MAAM,gBAAgB,kBAAkB,oBAAoB,oBAClE,CAAC,KAAK,CAAC,EAAE,UAAU,KAAK,CAAC,KAAK,GAC9B;AACJ,0BAAU,QAAQ,YAAY,KAAK,CAAC,CAAC,CAAC,EAAE,MAAM,SAAS,KAAK,CAAC,CAAC;AAAA,cAC1E,OAAiB;AACL,0BAAW,KAAK,UAAU,KAAK,WAAW,IAAI,IAC1C,QAAQ,QAAQ,EAAG,IACnB,QAAQ,KAAK,IAAI;AAAA,cACtB;AAAA,YACF;AACD,mBAAO,WAAW;AAChB,kBAAI,OAAO,WACP,QAAQ,KAAK,CAAC;AAElB,kBAAI,WAAW,KAAK,UAAU,KAAK,QAAQ,KAAK,GAAG;AACjD,uBAAO,QAAQ,MAAM,KAAK,EAAE,MAAK;AAAA,cAClC;AACD,kBAAIvI,SAAQ,GACR4J,UAAS,SAAS,MAAM5J,MAAK,EAAE,MAAM,MAAM,IAAI,IAAI;AAEvD,qBAAO,EAAEA,SAAQ,QAAQ;AACvB,gBAAA4J,UAAS,MAAM5J,MAAK,EAAE,KAAK,MAAM4J,OAAM;AAAA,cACxC;AACD,qBAAOA;AAAA,YACjB;AAAA,UACA,CAAO;AAAA,QACF;AAqBD,iBAAS,aAAa,MAAM,SAAS,SAAS,UAAU,SAAS,eAAe,cAAc,QAAQW,MAAK,OAAO;AAChH,cAAI,QAAQ,UAAU,eAClB,SAAS,UAAU,gBACnB,YAAY,UAAU,oBACtB,YAAY,WAAW,kBAAkB,wBACzC,SAAS,UAAU,gBACnB,OAAO,YAAYhC,cAAY,WAAW,IAAI;AAElD,mBAAS,UAAU;AACjB,gBAAI,SAAS,UAAU,QACnB,OAAOI,OAAM,MAAM,GACnB3I,SAAQ;AAEZ,mBAAOA,UAAS;AACd,mBAAKA,MAAK,IAAI,UAAUA,MAAK;AAAA,YAC9B;AACD,gBAAI,WAAW;AACb,kBAAI,cAAc,UAAU,OAAO,GAC/B,eAAe,aAAa,MAAM,WAAW;AAAA,YAClD;AACD,gBAAI,UAAU;AACZ,qBAAO,YAAY,MAAM,UAAU,SAAS,SAAS;AAAA,YACtD;AACD,gBAAI,eAAe;AACjB,qBAAO,iBAAiB,MAAM,eAAe,cAAc,SAAS;AAAA,YACrE;AACD,sBAAU;AACV,gBAAI,aAAa,SAAS,OAAO;AAC/B,kBAAI,aAAa,eAAe,MAAM,WAAW;AACjD,qBAAO;AAAA,gBACL;AAAA,gBAAM;AAAA,gBAAS;AAAA,gBAAc,QAAQ;AAAA,gBAAa;AAAA,gBAClD;AAAA,gBAAM;AAAA,gBAAY;AAAA,gBAAQuK;AAAA,gBAAK,QAAQ;AAAA,cACnD;AAAA,YACS;AACD,gBAAI,cAAc,SAAS,UAAU,MACjC,KAAK,YAAY,YAAY,IAAI,IAAI;AAEzC,qBAAS,KAAK;AACd,gBAAI,QAAQ;AACV,qBAAO,QAAQ,MAAM,MAAM;AAAA,YACrC,WAAmB,UAAU,SAAS,GAAG;AAC/B,mBAAK,QAAO;AAAA,YACb;AACD,gBAAI,SAASA,OAAM,QAAQ;AACzB,mBAAK,SAASA;AAAA,YACf;AACD,gBAAI,QAAQ,SAAS,QAAQ,gBAAgB,SAAS;AACpD,mBAAK,QAAQ,WAAW,EAAE;AAAA,YAC3B;AACD,mBAAO,GAAG,MAAM,aAAa,IAAI;AAAA,UAClC;AACD,iBAAO;AAAA,QACR;AAUD,iBAAS,eAAe,QAAQ,YAAY;AAC1C,iBAAO,SAAS,QAAQV,WAAU;AAChC,mBAAO,aAAa,QAAQ,QAAQ,WAAWA,SAAQ,GAAG,CAAA,CAAE;AAAA,UACpE;AAAA,QACK;AAUD,iBAAS,oBAAoBW,WAAU,cAAc;AACnD,iBAAO,SAAS,OAAO,OAAO;AAC5B,gBAAIZ;AACJ,gBAAI,UAAUrB,eAAa,UAAUA,aAAW;AAC9C,qBAAO;AAAA,YACR;AACD,gBAAI,UAAUA,aAAW;AACvB,cAAAqB,UAAS;AAAA,YACV;AACD,gBAAI,UAAUrB,aAAW;AACvB,kBAAIqB,YAAWrB,aAAW;AACxB,uBAAO;AAAA,cACR;AACD,kBAAI,OAAO,SAAS,YAAY,OAAO,SAAS,UAAU;AACxD,wBAAQ,aAAa,KAAK;AAC1B,wBAAQ,aAAa,KAAK;AAAA,cACtC,OAAiB;AACL,wBAAQ,aAAa,KAAK;AAC1B,wBAAQ,aAAa,KAAK;AAAA,cAC3B;AACD,cAAAqB,UAASY,UAAS,OAAO,KAAK;AAAA,YAC/B;AACD,mBAAOZ;AAAA,UACf;AAAA,QACK;AASD,iBAAS,WAAW,WAAW;AAC7B,iBAAO,SAAS,SAAS,WAAW;AAClC,wBAAY,SAAS,WAAW,UAAU,YAAW,CAAE,CAAC;AACxD,mBAAO,SAAS,SAAS,MAAM;AAC7B,kBAAI,UAAU;AACd,qBAAO,UAAU,WAAW,SAASC,WAAU;AAC7C,uBAAO,MAAMA,WAAU,SAAS,IAAI;AAAA,cAChD,CAAW;AAAA,YACX,CAAS;AAAA,UACT,CAAO;AAAA,QACF;AAWD,iBAAS,cAAc,QAAQ,OAAO;AACpC,kBAAQ,UAAUtB,cAAY,MAAM,aAAa,KAAK;AAEtD,cAAI,cAAc,MAAM;AACxB,cAAI,cAAc,GAAG;AACnB,mBAAO,cAAc,WAAW,OAAO,MAAM,IAAI;AAAA,UAClD;AACD,cAAIqB,UAAS,WAAW,OAAO,WAAW,SAAS,WAAW,KAAK,CAAC,CAAC;AACrE,iBAAO,WAAW,KAAK,IACnB,UAAU,cAAcA,OAAM,GAAG,GAAG,MAAM,EAAE,KAAK,EAAE,IACnDA,QAAO,MAAM,GAAG,MAAM;AAAA,QAC3B;AAcD,iBAAS,cAAc,MAAM,SAAS,SAAS,UAAU;AACvD,cAAI,SAAS,UAAU,gBACnB,OAAO,WAAW,IAAI;AAE1B,mBAAS,UAAU;AACjB,gBAAI,YAAY,IACZ,aAAa,UAAU,QACvB,YAAY,IACZ,aAAa,SAAS,QACtB,OAAOjB,OAAM,aAAa,UAAU,GACpC,KAAM,QAAQ,SAAS,QAAQ,gBAAgB,UAAW,OAAO;AAErE,mBAAO,EAAE,YAAY,YAAY;AAC/B,mBAAK,SAAS,IAAI,SAAS,SAAS;AAAA,YACrC;AACD,mBAAO,cAAc;AACnB,mBAAK,WAAW,IAAI,UAAU,EAAE,SAAS;AAAA,YAC1C;AACD,mBAAO,MAAM,IAAI,SAAS,UAAU,MAAM,IAAI;AAAA,UAC/C;AACD,iBAAO;AAAA,QACR;AASD,iBAAS,YAAY,WAAW;AAC9B,iBAAO,SAAS,OAAO,KAAK,MAAM;AAChC,gBAAI,QAAQ,OAAO,QAAQ,YAAY,eAAe,OAAO,KAAK,IAAI,GAAG;AACvE,oBAAM,OAAOJ;AAAAA,YACd;AAED,oBAAQ,SAAS,KAAK;AACtB,gBAAI,QAAQA,aAAW;AACrB,oBAAM;AACN,sBAAQ;AAAA,YAClB,OAAe;AACL,oBAAM,SAAS,GAAG;AAAA,YACnB;AACD,mBAAO,SAASA,cAAa,QAAQ,MAAM,IAAI,KAAM,SAAS,IAAI;AAClE,mBAAO,UAAU,OAAO,KAAK,MAAM,SAAS;AAAA,UACpD;AAAA,QACK;AASD,iBAAS,0BAA0BiC,WAAU;AAC3C,iBAAO,SAAS,OAAO,OAAO;AAC5B,gBAAI,EAAE,OAAO,SAAS,YAAY,OAAO,SAAS,WAAW;AAC3D,sBAAQ,SAAS,KAAK;AACtB,sBAAQ,SAAS,KAAK;AAAA,YACvB;AACD,mBAAOA,UAAS,OAAO,KAAK;AAAA,UACpC;AAAA,QACK;AAmBD,iBAAS,cAAc,MAAM,SAAS,UAAU,aAAa,SAAS,UAAU,SAAS,QAAQD,MAAK,OAAO;AAC3G,cAAI,UAAU,UAAU,iBACpB,aAAa,UAAU,UAAUhC,aACjC,kBAAkB,UAAUA,cAAY,SACxC,cAAc,UAAU,WAAWA,aACnC,mBAAmB,UAAUA,cAAY;AAE7C,qBAAY,UAAU,oBAAoB;AAC1C,qBAAW,EAAE,UAAU,0BAA0B;AAEjD,cAAI,EAAE,UAAU,wBAAwB;AACtC,uBAAW,EAAE,iBAAiB;AAAA,UAC/B;AACD,cAAI,UAAU;AAAA,YACZ;AAAA,YAAM;AAAA,YAAS;AAAA,YAAS;AAAA,YAAa;AAAA,YAAY;AAAA,YACjD;AAAA,YAAiB;AAAA,YAAQgC;AAAA,YAAK;AAAA,UACtC;AAEM,cAAIX,UAAS,SAAS,MAAMrB,aAAW,OAAO;AAC9C,cAAI,WAAW,IAAI,GAAG;AACpB,oBAAQqB,SAAQ,OAAO;AAAA,UACxB;AACD,UAAAA,QAAO,cAAc;AACrB,iBAAO,gBAAgBA,SAAQ,MAAM,OAAO;AAAA,QAC7C;AASD,iBAAS,YAAY,YAAY;AAC/B,cAAI,OAAOb,MAAK,UAAU;AAC1B,iBAAO,SAAS1F,SAAQ,WAAW;AACjC,YAAAA,UAAS,SAASA,OAAM;AACxB,wBAAY,aAAa,OAAO,IAAI,UAAU,UAAU,SAAS,GAAG,GAAG;AACvE,gBAAI,aAAa,eAAeA,OAAM,GAAG;AAGvC,kBAAIxB,SAAQ,SAASwB,OAAM,IAAI,KAAK,MAAM,GAAG,GACzC,QAAQ,KAAKxB,MAAK,CAAC,IAAI,OAAO,CAACA,MAAK,CAAC,IAAI,UAAU;AAEvD,cAAAA,SAAQ,SAAS,KAAK,IAAI,KAAK,MAAM,GAAG;AACxC,qBAAO,EAAEA,MAAK,CAAC,IAAI,OAAO,CAACA,MAAK,CAAC,IAAI;AAAA,YACtC;AACD,mBAAO,KAAKwB,OAAM;AAAA,UAC1B;AAAA,QACK;AASD,YAAI,YAAY,EAAEoG,QAAQ,IAAI,WAAW,IAAIA,KAAI,CAAA,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAM,YAAY,OAAO,SAASO,SAAQ;AAClG,iBAAO,IAAIP,KAAIO,OAAM;AAAA,QAC3B;AASI,iBAAS,cAAc,UAAU;AAC/B,iBAAO,SAAS,QAAQ;AACtB,gBAAI,MAAM,OAAO,MAAM;AACvB,gBAAI,OAAO,QAAQ;AACjB,qBAAO,WAAW,MAAM;AAAA,YACzB;AACD,gBAAI,OAAO,QAAQ;AACjB,qBAAO,WAAW,MAAM;AAAA,YACzB;AACD,mBAAO,YAAY,QAAQ,SAAS,MAAM,CAAC;AAAA,UACnD;AAAA,QACK;AA2BD,iBAAS,WAAW,MAAM,SAAS,SAAS,UAAU,SAAS,QAAQO,MAAK,OAAO;AACjF,cAAI,YAAY,UAAU;AAC1B,cAAI,CAAC,aAAa,OAAO,QAAQ,YAAY;AAC3C,kBAAM,IAAIpB,WAAU,eAAe;AAAA,UACpC;AACD,cAAI,SAAS,WAAW,SAAS,SAAS;AAC1C,cAAI,CAAC,QAAQ;AACX,uBAAW,EAAE,oBAAoB;AACjC,uBAAW,UAAUZ;AAAAA,UACtB;AACD,UAAAgC,OAAMA,SAAQhC,cAAYgC,OAAM,UAAU,UAAUA,IAAG,GAAG,CAAC;AAC3D,kBAAQ,UAAUhC,cAAY,QAAQ,UAAU,KAAK;AACrD,oBAAU,UAAU,QAAQ,SAAS;AAErC,cAAI,UAAU,yBAAyB;AACrC,gBAAI,gBAAgB,UAChB,eAAe;AAEnB,uBAAW,UAAUA;AAAAA,UACtB;AACD,cAAI,OAAO,YAAYA,cAAY,QAAQ,IAAI;AAE/C,cAAI,UAAU;AAAA,YACZ;AAAA,YAAM;AAAA,YAAS;AAAA,YAAS;AAAA,YAAU;AAAA,YAAS;AAAA,YAAe;AAAA,YAC1D;AAAA,YAAQgC;AAAA,YAAK;AAAA,UACrB;AAEM,cAAI,MAAM;AACR,sBAAU,SAAS,IAAI;AAAA,UACxB;AACD,iBAAO,QAAQ,CAAC;AAChB,oBAAU,QAAQ,CAAC;AACnB,oBAAU,QAAQ,CAAC;AACnB,qBAAW,QAAQ,CAAC;AACpB,oBAAU,QAAQ,CAAC;AACnB,kBAAQ,QAAQ,CAAC,IAAI,QAAQ,CAAC,MAAMhC,cAC/B,YAAY,IAAI,KAAK,SACtB,UAAU,QAAQ,CAAC,IAAI,QAAQ,CAAC;AAEpC,cAAI,CAAC,SAAS,WAAW,kBAAkB,wBAAwB;AACjE,uBAAW,EAAE,kBAAkB;AAAA,UAChC;AACD,cAAI,CAAC,WAAW,WAAW,gBAAgB;AACzC,gBAAIqB,UAAS,WAAW,MAAM,SAAS,OAAO;AAAA,UAC/C,WAAU,WAAW,mBAAmB,WAAW,uBAAuB;AACzE,YAAAA,UAAS,YAAY,MAAM,SAAS,KAAK;AAAA,UACjD,YAAkB,WAAW,qBAAqB,YAAY,iBAAiB,uBAAuB,CAAC,QAAQ,QAAQ;AAC/G,YAAAA,UAAS,cAAc,MAAM,SAAS,SAAS,QAAQ;AAAA,UAC/D,OAAa;AACL,YAAAA,UAAS,aAAa,MAAMrB,aAAW,OAAO;AAAA,UAC/C;AACD,cAAI,SAAS,OAAO,cAAc;AAClC,iBAAO,gBAAgB,OAAOqB,SAAQ,OAAO,GAAG,MAAM,OAAO;AAAA,QAC9D;AAcD,iBAAS,uBAAuB,UAAU,UAAU,KAAK,QAAQ;AAC/D,cAAI,aAAarB,eACZ,GAAG,UAAU,YAAY,GAAG,CAAC,KAAK,CAAC,eAAe,KAAK,QAAQ,GAAG,GAAI;AACzE,mBAAO;AAAA,UACR;AACD,iBAAO;AAAA,QACR;AAgBD,iBAAS,oBAAoB,UAAU,UAAU,KAAK,QAAQ,QAAQ,OAAO;AAC3E,cAAI,SAAS,QAAQ,KAAK,SAAS,QAAQ,GAAG;AAE5C,kBAAM,IAAI,UAAU,QAAQ;AAC5B,sBAAU,UAAU,UAAUA,aAAW,qBAAqB,KAAK;AACnE,kBAAM,QAAQ,EAAE,QAAQ;AAAA,UACzB;AACD,iBAAO;AAAA,QACR;AAWD,iBAAS,gBAAgB,OAAO;AAC9B,iBAAO,cAAc,KAAK,IAAIA,cAAY;AAAA,QAC3C;AAeD,iBAAS,YAAY,OAAO,OAAO,SAAS,YAAY,WAAW,OAAO;AACxE,cAAI,YAAY,UAAU,sBACtB,YAAY,MAAM,QAClB,YAAY,MAAM;AAEtB,cAAI,aAAa,aAAa,EAAE,aAAa,YAAY,YAAY;AACnE,mBAAO;AAAA,UACR;AAED,cAAI,aAAa,MAAM,IAAI,KAAK;AAChC,cAAI,aAAa,MAAM,IAAI,KAAK;AAChC,cAAI,cAAc,YAAY;AAC5B,mBAAO,cAAc,SAAS,cAAc;AAAA,UAC7C;AACD,cAAIvI,SAAQ,IACR4J,UAAS,MACT,OAAQ,UAAU,yBAA0B,IAAI,aAAWrB;AAE/D,gBAAM,IAAI,OAAO,KAAK;AACtB,gBAAM,IAAI,OAAO,KAAK;AAGtB,iBAAO,EAAEvI,SAAQ,WAAW;AAC1B,gBAAI,WAAW,MAAMA,MAAK,GACtB,WAAW,MAAMA,MAAK;AAE1B,gBAAI,YAAY;AACd,kBAAI,WAAW,YACX,WAAW,UAAU,UAAUA,QAAO,OAAO,OAAO,KAAK,IACzD,WAAW,UAAU,UAAUA,QAAO,OAAO,OAAO,KAAK;AAAA,YAC9D;AACD,gBAAI,aAAauI,aAAW;AAC1B,kBAAI,UAAU;AACZ;AAAA,cACD;AACD,cAAAqB,UAAS;AACT;AAAA,YACD;AAED,gBAAI,MAAM;AACR,kBAAI,CAAC,UAAU,OAAO,SAASa,WAAU,UAAU;AAC7C,oBAAI,CAAC,SAAS,MAAM,QAAQ,MACvB,aAAaA,aAAY,UAAU,UAAUA,WAAU,SAAS,YAAY,KAAK,IAAI;AACxF,yBAAO,KAAK,KAAK,QAAQ;AAAA,gBAC1B;AAAA,cACjB,CAAe,GAAG;AACN,gBAAAb,UAAS;AACT;AAAA,cACD;AAAA,YACX,WAAmB,EACL,aAAa,YACX,UAAU,UAAU,UAAU,SAAS,YAAY,KAAK,IACzD;AACL,cAAAA,UAAS;AACT;AAAA,YACD;AAAA,UACF;AACD,gBAAM,QAAQ,EAAE,KAAK;AACrB,gBAAM,QAAQ,EAAE,KAAK;AACrB,iBAAOA;AAAA,QACR;AAmBD,iBAAS,WAAW,QAAQ,OAAO,KAAK,SAAS,YAAY,WAAW,OAAO;AAC7E,kBAAQ,KAAG;AAAA,YACT,KAAK;AACH,kBAAK,OAAO,cAAc,MAAM,cAC3B,OAAO,cAAc,MAAM,YAAa;AAC3C,uBAAO;AAAA,cACR;AACD,uBAAS,OAAO;AAChB,sBAAQ,MAAM;AAAA,YAEhB,KAAK;AACH,kBAAK,OAAO,cAAc,MAAM,cAC5B,CAAC,UAAU,IAAIN,YAAW,MAAM,GAAG,IAAIA,YAAW,KAAK,CAAC,GAAG;AAC7D,uBAAO;AAAA,cACR;AACD,qBAAO;AAAA,YAET,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAGH,qBAAO,GAAG,CAAC,QAAQ,CAAC,KAAK;AAAA,YAE3B,KAAK;AACH,qBAAO,OAAO,QAAQ,MAAM,QAAQ,OAAO,WAAW,MAAM;AAAA,YAE9D,KAAK;AAAA,YACL,KAAK;AAIH,qBAAO,UAAW,QAAQ;AAAA,YAE5B,KAAK;AACH,kBAAI,UAAU;AAAA,YAEhB,KAAK;AACH,kBAAI,YAAY,UAAU;AAC1B,0BAAY,UAAU;AAEtB,kBAAI,OAAO,QAAQ,MAAM,QAAQ,CAAC,WAAW;AAC3C,uBAAO;AAAA,cACR;AAED,kBAAI,UAAU,MAAM,IAAI,MAAM;AAC9B,kBAAI,SAAS;AACX,uBAAO,WAAW;AAAA,cACnB;AACD,yBAAW;AAGX,oBAAM,IAAI,QAAQ,KAAK;AACvB,kBAAIM,UAAS,YAAY,QAAQ,MAAM,GAAG,QAAQ,KAAK,GAAG,SAAS,YAAY,WAAW,KAAK;AAC/F,oBAAM,QAAQ,EAAE,MAAM;AACtB,qBAAOA;AAAA,YAET,KAAK;AACH,kBAAI,eAAe;AACjB,uBAAO,cAAc,KAAK,MAAM,KAAK,cAAc,KAAK,KAAK;AAAA,cAC9D;AAAA,UACJ;AACD,iBAAO;AAAA,QACR;AAeD,iBAAS,aAAa,QAAQ,OAAO,SAAS,YAAY,WAAW,OAAO;AAC1E,cAAI,YAAY,UAAU,sBACtB,WAAW,WAAW,MAAM,GAC5B,YAAY,SAAS,QACrB,WAAW,WAAW,KAAK,GAC3B,YAAY,SAAS;AAEzB,cAAI,aAAa,aAAa,CAAC,WAAW;AACxC,mBAAO;AAAA,UACR;AACD,cAAI5J,SAAQ;AACZ,iBAAOA,UAAS;AACd,gBAAI,MAAM,SAASA,MAAK;AACxB,gBAAI,EAAE,YAAY,OAAO,QAAQ,eAAe,KAAK,OAAO,GAAG,IAAI;AACjE,qBAAO;AAAA,YACR;AAAA,UACF;AAED,cAAI,aAAa,MAAM,IAAI,MAAM;AACjC,cAAI,aAAa,MAAM,IAAI,KAAK;AAChC,cAAI,cAAc,YAAY;AAC5B,mBAAO,cAAc,SAAS,cAAc;AAAA,UAC7C;AACD,cAAI4J,UAAS;AACb,gBAAM,IAAI,QAAQ,KAAK;AACvB,gBAAM,IAAI,OAAO,MAAM;AAEvB,cAAI,WAAW;AACf,iBAAO,EAAE5J,SAAQ,WAAW;AAC1B,kBAAM,SAASA,MAAK;AACpB,gBAAI,WAAW,OAAO,GAAG,GACrB,WAAW,MAAM,GAAG;AAExB,gBAAI,YAAY;AACd,kBAAI,WAAW,YACX,WAAW,UAAU,UAAU,KAAK,OAAO,QAAQ,KAAK,IACxD,WAAW,UAAU,UAAU,KAAK,QAAQ,OAAO,KAAK;AAAA,YAC7D;AAED,gBAAI,EAAE,aAAauI,cACV,aAAa,YAAY,UAAU,UAAU,UAAU,SAAS,YAAY,KAAK,IAClF,WACD;AACL,cAAAqB,UAAS;AACT;AAAA,YACD;AACD,yBAAa,WAAW,OAAO;AAAA,UAChC;AACD,cAAIA,WAAU,CAAC,UAAU;AACvB,gBAAI,UAAU,OAAO,aACjB,UAAU,MAAM;AAGpB,gBAAI,WAAW,YACV,iBAAiB,UAAU,iBAAiB,UAC7C,EAAE,OAAO,WAAW,cAAc,mBAAmB,WACnD,OAAO,WAAW,cAAc,mBAAmB,UAAU;AACjE,cAAAA,UAAS;AAAA,YACV;AAAA,UACF;AACD,gBAAM,QAAQ,EAAE,MAAM;AACtB,gBAAM,QAAQ,EAAE,KAAK;AACrB,iBAAOA;AAAA,QACR;AASD,iBAAS,SAAS,MAAM;AACtB,iBAAO,YAAY,SAAS,MAAMrB,aAAWjE,QAAO,GAAG,OAAO,EAAE;AAAA,QACjE;AASD,iBAAS,WAAW,QAAQ;AAC1B,iBAAO,eAAe,QAAQ,MAAM,UAAU;AAAA,QAC/C;AAUD,iBAAS,aAAa,QAAQ;AAC5B,iBAAO,eAAe,QAAQ,QAAQ,YAAY;AAAA,QACnD;AASD,YAAI,UAAU,CAAC,UAAU,OAAO,SAAS,MAAM;AAC7C,iBAAO,QAAQ,IAAI,IAAI;AAAA,QAC7B;AASI,iBAAS,YAAY,MAAM;AACzB,cAAIsF,UAAU,KAAK,OAAO,IACtB,QAAQ,UAAUA,OAAM,GACxB,SAAS,eAAe,KAAK,WAAWA,OAAM,IAAI,MAAM,SAAS;AAErE,iBAAO,UAAU;AACf,gBAAI,OAAO,MAAM,MAAM,GACnB,YAAY,KAAK;AACrB,gBAAI,aAAa,QAAQ,aAAa,MAAM;AAC1C,qBAAO,KAAK;AAAA,YACb;AAAA,UACF;AACD,iBAAOA;AAAA,QACR;AASD,iBAAS,UAAU,MAAM;AACvB,cAAI,SAAS,eAAe,KAAKD,SAAQ,aAAa,IAAIA,UAAS;AACnE,iBAAO,OAAO;AAAA,QACf;AAaD,iBAAS,cAAc;AACrB,cAAIC,UAASD,QAAO,YAAY;AAChC,UAAAC,UAASA,YAAW,WAAW,eAAeA;AAC9C,iBAAO,UAAU,SAASA,QAAO,UAAU,CAAC,GAAG,UAAU,CAAC,CAAC,IAAIA;AAAA,QAChE;AAUD,iBAAS,WAAWc,MAAK,KAAK;AAC5B,cAAI,OAAOA,KAAI;AACf,iBAAO,UAAU,GAAG,IAChB,KAAK,OAAO,OAAO,WAAW,WAAW,MAAM,IAC/C,KAAK;AAAA,QACV;AASD,iBAAS,aAAa,QAAQ;AAC5B,cAAId,UAAS,KAAK,MAAM,GACpB,SAASA,QAAO;AAEpB,iBAAO,UAAU;AACf,gBAAI,MAAMA,QAAO,MAAM,GACnB,QAAQ,OAAO,GAAG;AAEtB,YAAAA,QAAO,MAAM,IAAI,CAAC,KAAK,OAAO,mBAAmB,KAAK,CAAC;AAAA,UACxD;AACD,iBAAOA;AAAA,QACR;AAUD,iBAAS,UAAU,QAAQ,KAAK;AAC9B,cAAI,QAAQ,SAAS,QAAQ,GAAG;AAChC,iBAAO,aAAa,KAAK,IAAI,QAAQrB;AAAAA,QACtC;AASD,iBAAS,UAAU,OAAO;AACxB,cAAI,QAAQ,eAAe,KAAK,OAAO,cAAc,GACjD,MAAM,MAAM,cAAc;AAE9B,cAAI;AACF,kBAAM,cAAc,IAAIA;AACxB,gBAAI,WAAW;AAAA,UACvB,SAAe3I,IAAG;AAAA,UAAE;AAEd,cAAIgK,UAAS,qBAAqB,KAAK,KAAK;AAC5C,cAAI,UAAU;AACZ,gBAAI,OAAO;AACT,oBAAM,cAAc,IAAI;AAAA,YAClC,OAAe;AACL,qBAAO,MAAM,cAAc;AAAA,YAC5B;AAAA,UACF;AACD,iBAAOA;AAAA,QACR;AASD,YAAI,aAAa,CAAC,mBAAmB,YAAY,SAAS,QAAQ;AAChE,cAAI,UAAU,MAAM;AAClB,mBAAO;UACR;AACD,mBAASZ,QAAO,MAAM;AACtB,iBAAO,YAAY,iBAAiB,MAAM,GAAG,SAAS,QAAQ;AAC5D,mBAAO,qBAAqB,KAAK,QAAQ,MAAM;AAAA,UACvD,CAAO;AAAA,QACP;AASI,YAAI,eAAe,CAAC,mBAAmB,YAAY,SAAS,QAAQ;AAClE,cAAIY,UAAS,CAAA;AACb,iBAAO,QAAQ;AACb,sBAAUA,SAAQ,WAAW,MAAM,CAAC;AACpC,qBAAS,aAAa,MAAM;AAAA,UAC7B;AACD,iBAAOA;AAAA,QACb;AASI,YAAI,SAAS;AAGb,YAAK,YAAY,OAAO,IAAI,SAAS,IAAI,YAAY,CAAC,CAAC,CAAC,KAAK,eACxDL,QAAO,OAAO,IAAIA,MAAG,KAAK,UAC1BC,YAAW,OAAOA,SAAQ,QAAS,CAAA,KAAK,cACxCC,QAAO,OAAO,IAAIA,MAAG,KAAK,UAC1BC,YAAW,OAAO,IAAIA,UAAO,KAAK,YAAa;AAClD,mBAAS,SAAS,OAAO;AACvB,gBAAIE,UAAS,WAAW,KAAK,GACzB,OAAOA,WAAU,YAAY,MAAM,cAAcrB,aACjD,aAAa,OAAO,SAAS,IAAI,IAAI;AAEzC,gBAAI,YAAY;AACd,sBAAQ,YAAU;AAAA,gBAChB,KAAK;AAAoB,yBAAO;AAAA,gBAChC,KAAK;AAAe,yBAAO;AAAA,gBAC3B,KAAK;AAAmB,yBAAO;AAAA,gBAC/B,KAAK;AAAe,yBAAO;AAAA,gBAC3B,KAAK;AAAmB,yBAAO;AAAA,cAChC;AAAA,YACF;AACD,mBAAOqB;AAAA,UACf;AAAA,QACK;AAYD,iBAAS,QAAQ,OAAO,KAAK,YAAY;AACvC,cAAI5J,SAAQ,IACR,SAAS,WAAW;AAExB,iBAAO,EAAEA,SAAQ,QAAQ;AACvB,gBAAI,OAAO,WAAWA,MAAK,GACvB+J,QAAO,KAAK;AAEhB,oBAAQ,KAAK,MAAI;AAAA,cACf,KAAK;AAAa,yBAASA;AAAM;AAAA,cACjC,KAAK;AAAa,uBAAOA;AAAM;AAAA,cAC/B,KAAK;AAAa,sBAAM,UAAU,KAAK,QAAQA,KAAI;AAAG;AAAA,cACtD,KAAK;AAAa,wBAAQ,UAAU,OAAO,MAAMA,KAAI;AAAG;AAAA,YACzD;AAAA,UACF;AACD,iBAAO,EAAE,SAAS,OAAO,OAAO,IAAG;AAAA,QACpC;AASD,iBAAS,eAAe,QAAQ;AAC9B,cAAI,QAAQ,OAAO,MAAM,aAAa;AACtC,iBAAO,QAAQ,MAAM,CAAC,EAAE,MAAM,cAAc,IAAI;QACjD;AAWD,iBAAS,QAAQ,QAAQ,MAAM,SAAS;AACtC,iBAAO,SAAS,MAAM,MAAM;AAE5B,cAAI/J,SAAQ,IACR,SAAS,KAAK,QACd4J,UAAS;AAEb,iBAAO,EAAE5J,SAAQ,QAAQ;AACvB,gBAAI,MAAM,MAAM,KAAKA,MAAK,CAAC;AAC3B,gBAAI,EAAE4J,UAAS,UAAU,QAAQ,QAAQ,QAAQ,GAAG,IAAI;AACtD;AAAA,YACD;AACD,qBAAS,OAAO,GAAG;AAAA,UACpB;AACD,cAAIA,WAAU,EAAE5J,UAAS,QAAQ;AAC/B,mBAAO4J;AAAA,UACR;AACD,mBAAS,UAAU,OAAO,IAAI,OAAO;AACrC,iBAAO,CAAC,CAAC,UAAU,SAAS,MAAM,KAAK,QAAQ,KAAK,MAAM,MACvD,QAAQ,MAAM,KAAK,YAAY,MAAM;AAAA,QACzC;AASD,iBAAS,eAAe,OAAO;AAC7B,cAAI,SAAS,MAAM,QACfA,UAAS,IAAI,MAAM,YAAY,MAAM;AAGzC,cAAI,UAAU,OAAO,MAAM,CAAC,KAAK,YAAY,eAAe,KAAK,OAAO,OAAO,GAAG;AAChF,YAAAA,QAAO,QAAQ,MAAM;AACrB,YAAAA,QAAO,QAAQ,MAAM;AAAA,UACtB;AACD,iBAAOA;AAAA,QACR;AASD,iBAAS,gBAAgB,QAAQ;AAC/B,iBAAQ,OAAO,OAAO,eAAe,cAAc,CAAC,YAAY,MAAM,IAClE,WAAW,aAAa,MAAM,CAAC,IAC/B;QACL;AAcD,iBAAS,eAAe,QAAQ,KAAK,QAAQ;AAC3C,cAAI,OAAO,OAAO;AAClB,kBAAQ,KAAG;AAAA,YACT,KAAK;AACH,qBAAO,iBAAiB,MAAM;AAAA,YAEhC,KAAK;AAAA,YACL,KAAK;AACH,qBAAO,IAAI,KAAK,CAAC,MAAM;AAAA,YAEzB,KAAK;AACH,qBAAO,cAAc,QAAQ,MAAM;AAAA,YAErC,KAAK;AAAA,YAAY,KAAK;AAAA,YACtB,KAAK;AAAA,YAAS,KAAK;AAAA,YAAU,KAAK;AAAA,YAClC,KAAK;AAAA,YAAU,KAAK;AAAA,YAAiB,KAAK;AAAA,YAAW,KAAK;AACxD,qBAAO,gBAAgB,QAAQ,MAAM;AAAA,YAEvC,KAAK;AACH,qBAAO,IAAI;AAAA,YAEb,KAAK;AAAA,YACL,KAAK;AACH,qBAAO,IAAI,KAAK,MAAM;AAAA,YAExB,KAAK;AACH,qBAAO,YAAY,MAAM;AAAA,YAE3B,KAAK;AACH,qBAAO,IAAI;AAAA,YAEb,KAAK;AACH,qBAAO,YAAY,MAAM;AAAA,UAC5B;AAAA,QACF;AAUD,iBAAS,kBAAkB,QAAQ,SAAS;AAC1C,cAAI,SAAS,QAAQ;AACrB,cAAI,CAAC,QAAQ;AACX,mBAAO;AAAA,UACR;AACD,cAAI,YAAY,SAAS;AACzB,kBAAQ,SAAS,KAAK,SAAS,IAAI,OAAO,MAAM,QAAQ,SAAS;AACjE,oBAAU,QAAQ,KAAK,SAAS,IAAI,OAAO,GAAG;AAC9C,iBAAO,OAAO,QAAQ,eAAe,yBAAyB,UAAU,QAAQ;AAAA,QACjF;AASD,iBAAS,cAAc,OAAO;AAC5B,iBAAO,QAAQ,KAAK,KAAK,YAAY,KAAK,KACxC,CAAC,EAAE,oBAAoB,SAAS,MAAM,gBAAgB;AAAA,QACzD;AAUD,iBAAS,QAAQ,OAAO,QAAQ;AAC9B,cAAI,OAAO,OAAO;AAClB,mBAAS,UAAU,OAAO,mBAAmB;AAE7C,iBAAO,CAAC,CAAC,WACN,QAAQ,YACN,QAAQ,YAAY,SAAS,KAAK,KAAK,OACrC,QAAQ,MAAM,QAAQ,KAAK,KAAK,QAAQ;AAAA,QAChD;AAYD,iBAAS,eAAe,OAAO5J,QAAO,QAAQ;AAC5C,cAAI,CAAC,SAAS,MAAM,GAAG;AACrB,mBAAO;AAAA,UACR;AACD,cAAI,OAAO,OAAOA;AAClB,cAAI,QAAQ,WACH,YAAY,MAAM,KAAK,QAAQA,QAAO,OAAO,MAAM,IACnD,QAAQ,YAAYA,UAAS,QAChC;AACJ,mBAAO,GAAG,OAAOA,MAAK,GAAG,KAAK;AAAA,UAC/B;AACD,iBAAO;AAAA,QACR;AAUD,iBAAS,MAAM,OAAO,QAAQ;AAC5B,cAAI,QAAQ,KAAK,GAAG;AAClB,mBAAO;AAAA,UACR;AACD,cAAI,OAAO,OAAO;AAClB,cAAI,QAAQ,YAAY,QAAQ,YAAY,QAAQ,aAChD,SAAS,QAAQ,SAAS,KAAK,GAAG;AACpC,mBAAO;AAAA,UACR;AACD,iBAAO,cAAc,KAAK,KAAK,KAAK,CAAC,aAAa,KAAK,KAAK,KACzD,UAAU,QAAQ,SAASgJ,QAAO,MAAM;AAAA,QAC5C;AASD,iBAAS,UAAU,OAAO;AACxB,cAAI,OAAO,OAAO;AAClB,iBAAQ,QAAQ,YAAY,QAAQ,YAAY,QAAQ,YAAY,QAAQ,YACvE,UAAU,cACV,UAAU;AAAA,QAChB;AAUD,iBAAS,WAAW,MAAM;AACxB,cAAI,WAAW,YAAY,IAAI,GAC3B,QAAQW,QAAO,QAAQ;AAE3B,cAAI,OAAO,SAAS,cAAc,EAAE,YAAY,YAAY,YAAY;AACtE,mBAAO;AAAA,UACR;AACD,cAAI,SAAS,OAAO;AAClB,mBAAO;AAAA,UACR;AACD,cAAI,OAAO,QAAQ,KAAK;AACxB,iBAAO,CAAC,CAAC,QAAQ,SAAS,KAAK,CAAC;AAAA,QACjC;AASD,iBAAS,SAAS,MAAM;AACtB,iBAAO,CAAC,CAAC,cAAe,cAAc;AAAA,QACvC;AASD,YAAI,aAAa,aAAa,aAAa;AAS3C,iBAAS,YAAY,OAAO;AAC1B,cAAI,OAAO,SAAS,MAAM,aACtB,QAAS,OAAO,QAAQ,cAAc,KAAK,aAAc;AAE7D,iBAAO,UAAU;AAAA,QAClB;AAUD,iBAAS,mBAAmB,OAAO;AACjC,iBAAO,UAAU,SAAS,CAAC,SAAS,KAAK;AAAA,QAC1C;AAWD,iBAAS,wBAAwB,KAAK,UAAU;AAC9C,iBAAO,SAAS,QAAQ;AACtB,gBAAI,UAAU,MAAM;AAClB,qBAAO;AAAA,YACR;AACD,mBAAO,OAAO,GAAG,MAAM,aACpB,aAAapB,eAAc,OAAOS,QAAO,MAAM;AAAA,UAC1D;AAAA,QACK;AAUD,iBAAS,cAAc,MAAM;AAC3B,cAAIY,UAAS,QAAQ,MAAM,SAAS,KAAK;AACvC,gBAAI,MAAM,SAAS,kBAAkB;AACnC,oBAAM,MAAK;AAAA,YACZ;AACD,mBAAO;AAAA,UACf,CAAO;AAED,cAAI,QAAQA,QAAO;AACnB,iBAAOA;AAAA,QACR;AAkBD,iBAAS,UAAU,MAAM,QAAQ;AAC/B,cAAI,UAAU,KAAK,CAAC,GAChB,aAAa,OAAO,CAAC,GACrB,aAAa,UAAU,YACvB,WAAW,cAAc,iBAAiB,qBAAqB;AAEnE,cAAI,UACA,cAAc,iBAAmB,WAAW,mBAC5C,cAAc,iBAAmB,WAAW,mBAAqB,KAAK,CAAC,EAAE,UAAU,OAAO,CAAC,KAC3F,eAAe,gBAAgB,oBAAsB,OAAO,CAAC,EAAE,UAAU,OAAO,CAAC,KAAO,WAAW;AAGvG,cAAI,EAAE,YAAY,UAAU;AAC1B,mBAAO;AAAA,UACR;AAED,cAAI,aAAa,gBAAgB;AAC/B,iBAAK,CAAC,IAAI,OAAO,CAAC;AAElB,0BAAc,UAAU,iBAAiB,IAAI;AAAA,UAC9C;AAED,cAAI,QAAQ,OAAO,CAAC;AACpB,cAAI,OAAO;AACT,gBAAI,WAAW,KAAK,CAAC;AACrB,iBAAK,CAAC,IAAI,WAAW,YAAY,UAAU,OAAO,OAAO,CAAC,CAAC,IAAI;AAC/D,iBAAK,CAAC,IAAI,WAAW,eAAe,KAAK,CAAC,GAAG,WAAW,IAAI,OAAO,CAAC;AAAA,UACrE;AAED,kBAAQ,OAAO,CAAC;AAChB,cAAI,OAAO;AACT,uBAAW,KAAK,CAAC;AACjB,iBAAK,CAAC,IAAI,WAAW,iBAAiB,UAAU,OAAO,OAAO,CAAC,CAAC,IAAI;AACpE,iBAAK,CAAC,IAAI,WAAW,eAAe,KAAK,CAAC,GAAG,WAAW,IAAI,OAAO,CAAC;AAAA,UACrE;AAED,kBAAQ,OAAO,CAAC;AAChB,cAAI,OAAO;AACT,iBAAK,CAAC,IAAI;AAAA,UACX;AAED,cAAI,aAAa,eAAe;AAC9B,iBAAK,CAAC,IAAI,KAAK,CAAC,KAAK,OAAO,OAAO,CAAC,IAAI,UAAU,KAAK,CAAC,GAAG,OAAO,CAAC,CAAC;AAAA,UACrE;AAED,cAAI,KAAK,CAAC,KAAK,MAAM;AACnB,iBAAK,CAAC,IAAI,OAAO,CAAC;AAAA,UACnB;AAED,eAAK,CAAC,IAAI,OAAO,CAAC;AAClB,eAAK,CAAC,IAAI;AAEV,iBAAO;AAAA,QACR;AAWD,iBAAS,aAAa,QAAQ;AAC5B,cAAIA,UAAS,CAAA;AACb,cAAI,UAAU,MAAM;AAClB,qBAAS,OAAOZ,QAAO,MAAM,GAAG;AAC9B,cAAAY,QAAO,KAAK,GAAG;AAAA,YAChB;AAAA,UACF;AACD,iBAAOA;AAAA,QACR;AASD,iBAAS,eAAe,OAAO;AAC7B,iBAAO,qBAAqB,KAAK,KAAK;AAAA,QACvC;AAWD,iBAAS,SAAS,MAAM,OAAOe,YAAW;AACxC,kBAAQ,UAAU,UAAUpC,cAAa,KAAK,SAAS,IAAK,OAAO,CAAC;AACpE,iBAAO,WAAW;AAChB,gBAAI,OAAO,WACPvI,SAAQ,IACR,SAAS,UAAU,KAAK,SAAS,OAAO,CAAC,GACzC,QAAQ2I,OAAM,MAAM;AAExB,mBAAO,EAAE3I,SAAQ,QAAQ;AACvB,oBAAMA,MAAK,IAAI,KAAK,QAAQA,MAAK;AAAA,YAClC;AACD,YAAAA,SAAQ;AACR,gBAAI,YAAY2I,OAAM,QAAQ,CAAC;AAC/B,mBAAO,EAAE3I,SAAQ,OAAO;AACtB,wBAAUA,MAAK,IAAI,KAAKA,MAAK;AAAA,YAC9B;AACD,sBAAU,KAAK,IAAI2K,WAAU,KAAK;AAClC,mBAAO,MAAM,MAAM,MAAM,SAAS;AAAA,UAC1C;AAAA,QACK;AAUD,iBAAS,OAAO,QAAQ,MAAM;AAC5B,iBAAO,KAAK,SAAS,IAAI,SAAS,QAAQ,QAAQ,UAAU,MAAM,GAAG,EAAE,CAAC;AAAA,QACzE;AAYD,iBAAS,QAAQ,OAAO,SAAS;AAC/B,cAAI,YAAY,MAAM,QAClB,SAAS,UAAU,QAAQ,QAAQ,SAAS,GAC5C,WAAW,UAAU,KAAK;AAE9B,iBAAO,UAAU;AACf,gBAAI3K,SAAQ,QAAQ,MAAM;AAC1B,kBAAM,MAAM,IAAI,QAAQA,QAAO,SAAS,IAAI,SAASA,MAAK,IAAIuI;AAAAA,UAC/D;AACD,iBAAO;AAAA,QACR;AAUD,iBAAS,QAAQ,QAAQ,KAAK;AAC5B,cAAI,QAAQ,iBAAiB,OAAO,OAAO,GAAG,MAAM,YAAY;AAC9D;AAAA,UACD;AAED,cAAI,OAAO,aAAa;AACtB;AAAA,UACD;AAED,iBAAO,OAAO,GAAG;AAAA,QAClB;AAgBD,YAAI,UAAU,SAAS,WAAW;AAUlC,YAAI2B,cAAa,iBAAiB,SAAS,MAAM,MAAM;AACrD,iBAAO,KAAK,WAAW,MAAM,IAAI;AAAA,QACvC;AAUI,YAAI,cAAc,SAAS,eAAe;AAY1C,iBAAS,gBAAgB,SAAS,WAAW,SAAS;AACpD,cAAI,SAAU,YAAY;AAC1B,iBAAO,YAAY,SAAS,kBAAkB,QAAQ,kBAAkB,eAAe,MAAM,GAAG,OAAO,CAAC,CAAC;AAAA,QAC1G;AAWD,iBAAS,SAAS,MAAM;AACtB,cAAI,QAAQ,GACR,aAAa;AAEjB,iBAAO,WAAW;AAChB,gBAAI,QAAQ,UAAW,GACnB,YAAY,YAAY,QAAQ;AAEpC,yBAAa;AACb,gBAAI,YAAY,GAAG;AACjB,kBAAI,EAAE,SAAS,WAAW;AACxB,uBAAO,UAAU,CAAC;AAAA,cACnB;AAAA,YACX,OAAe;AACL,sBAAQ;AAAA,YACT;AACD,mBAAO,KAAK,MAAM3B,aAAW,SAAS;AAAA,UAC9C;AAAA,QACK;AAUD,iBAAS,YAAY,OAAOwB,OAAM;AAChC,cAAI/J,SAAQ,IACR,SAAS,MAAM,QACf,YAAY,SAAS;AAEzB,UAAA+J,QAAOA,UAASxB,cAAY,SAASwB;AACrC,iBAAO,EAAE/J,SAAQ+J,OAAM;AACrB,gBAAI,OAAO,WAAW/J,QAAO,SAAS,GAClC,QAAQ,MAAM,IAAI;AAEtB,kBAAM,IAAI,IAAI,MAAMA,MAAK;AACzB,kBAAMA,MAAK,IAAI;AAAA,UAChB;AACD,gBAAM,SAAS+J;AACf,iBAAO;AAAA,QACR;AASD,YAAI,eAAe,cAAc,SAAS5H,SAAQ;AAChD,cAAIyH,UAAS,CAAA;AACb,cAAIzH,QAAO,WAAW,CAAC,MAAM,IAAY;AACvC,YAAAyH,QAAO,KAAK,EAAE;AAAA,UACf;AACD,UAAAzH,QAAO,QAAQ,YAAY,SAAS,OAAOkB,SAAQ,OAAO,WAAW;AACnE,YAAAuG,QAAO,KAAK,QAAQ,UAAU,QAAQ,cAAc,IAAI,IAAKvG,WAAU,KAAM;AAAA,UACrF,CAAO;AACD,iBAAOuG;AAAA,QACb,CAAK;AASD,iBAAS,MAAM,OAAO;AACpB,cAAI,OAAO,SAAS,YAAY,SAAS,KAAK,GAAG;AAC/C,mBAAO;AAAA,UACR;AACD,cAAIA,UAAU,QAAQ;AACtB,iBAAQA,WAAU,OAAQ,IAAI,SAAU,CAAC,WAAY,OAAOA;AAAA,QAC7D;AASD,iBAAS,SAAS,MAAM;AACtB,cAAI,QAAQ,MAAM;AAChB,gBAAI;AACF,qBAAO,aAAa,KAAK,IAAI;AAAA,YACvC,SAAiBhK,IAAG;AAAA,YAAE;AACd,gBAAI;AACF,qBAAQ,OAAO;AAAA,YACzB,SAAiBA,IAAG;AAAA,YAAE;AAAA,UACf;AACD,iBAAO;AAAA,QACR;AAUD,iBAAS,kBAAkB,SAAS,SAAS;AAC3C,oBAAU,WAAW,SAASiC,OAAM;AAClC,gBAAI,QAAQ,OAAOA,MAAK,CAAC;AACzB,gBAAK,UAAUA,MAAK,CAAC,KAAM,CAAC,cAAc,SAAS,KAAK,GAAG;AACzD,sBAAQ,KAAK,KAAK;AAAA,YACnB;AAAA,UACT,CAAO;AACD,iBAAO,QAAQ;QAChB;AASD,iBAAS,aAAa,SAAS;AAC7B,cAAI,mBAAmB,aAAa;AAClC,mBAAO,QAAQ;UAChB;AACD,cAAI+H,UAAS,IAAI,cAAc,QAAQ,aAAa,QAAQ,SAAS;AACrE,UAAAA,QAAO,cAAc,UAAU,QAAQ,WAAW;AAClD,UAAAA,QAAO,YAAa,QAAQ;AAC5B,UAAAA,QAAO,aAAa,QAAQ;AAC5B,iBAAOA;AAAA,QACR;AAyBD,iBAAS,MAAM,OAAOG,OAAM,OAAO;AACjC,cAAK,QAAQ,eAAe,OAAOA,OAAM,KAAK,IAAIA,UAASxB,aAAY;AACrE,YAAAwB,QAAO;AAAA,UACf,OAAa;AACL,YAAAA,QAAO,UAAU,UAAUA,KAAI,GAAG,CAAC;AAAA,UACpC;AACD,cAAI,SAAS,SAAS,OAAO,IAAI,MAAM;AACvC,cAAI,CAAC,UAAUA,QAAO,GAAG;AACvB,mBAAO;UACR;AACD,cAAI/J,SAAQ,GACR,WAAW,GACX4J,UAASjB,OAAM,WAAW,SAASoB,KAAI,CAAC;AAE5C,iBAAO/J,SAAQ,QAAQ;AACrB,YAAA4J,QAAO,UAAU,IAAI,UAAU,OAAO5J,QAAQA,UAAS+J;UACxD;AACD,iBAAOH;AAAA,QACR;AAiBD,iBAAS,QAAQ,OAAO;AACtB,cAAI5J,SAAQ,IACR,SAAS,SAAS,OAAO,IAAI,MAAM,QACnC,WAAW,GACX4J,UAAS,CAAA;AAEb,iBAAO,EAAE5J,SAAQ,QAAQ;AACvB,gBAAI,QAAQ,MAAMA,MAAK;AACvB,gBAAI,OAAO;AACT,cAAA4J,QAAO,UAAU,IAAI;AAAA,YACtB;AAAA,UACF;AACD,iBAAOA;AAAA,QACR;AAwBD,iBAAS,SAAS;AAChB,cAAI,SAAS,UAAU;AACvB,cAAI,CAAC,QAAQ;AACX,mBAAO;UACR;AACD,cAAI,OAAOjB,OAAM,SAAS,CAAC,GACvB,QAAQ,UAAU,CAAC,GACnB3I,SAAQ;AAEZ,iBAAOA,UAAS;AACd,iBAAKA,SAAQ,CAAC,IAAI,UAAUA,MAAK;AAAA,UAClC;AACD,iBAAO,UAAU,QAAQ,KAAK,IAAI,UAAU,KAAK,IAAI,CAAC,KAAK,GAAG,YAAY,MAAM,CAAC,CAAC;AAAA,QACnF;AAuBD,YAAI,aAAa,SAAS,SAAS,OAAOgK,SAAQ;AAChD,iBAAO,kBAAkB,KAAK,IAC1B,eAAe,OAAO,YAAYA,SAAQ,GAAG,mBAAmB,IAAI,CAAC,IACrE;QACV,CAAK;AA4BD,YAAI,eAAe,SAAS,SAAS,OAAOA,SAAQ;AAClD,cAAIH,YAAW,KAAKG,OAAM;AAC1B,cAAI,kBAAkBH,SAAQ,GAAG;AAC/B,YAAAA,YAAWtB;AAAAA,UACZ;AACD,iBAAO,kBAAkB,KAAK,IAC1B,eAAe,OAAO,YAAYyB,SAAQ,GAAG,mBAAmB,IAAI,GAAG,YAAYH,WAAU,CAAC,CAAC,IAC/F;QACV,CAAK;AAyBD,YAAI,iBAAiB,SAAS,SAAS,OAAOG,SAAQ;AACpD,cAAI,aAAa,KAAKA,OAAM;AAC5B,cAAI,kBAAkB,UAAU,GAAG;AACjC,yBAAazB;AAAAA,UACd;AACD,iBAAO,kBAAkB,KAAK,IAC1B,eAAe,OAAO,YAAYyB,SAAQ,GAAG,mBAAmB,IAAI,GAAGzB,aAAW,UAAU,IAC5F;QACV,CAAK;AA2BD,iBAAS,KAAK,OAAOrI,IAAG,OAAO;AAC7B,cAAI,SAAS,SAAS,OAAO,IAAI,MAAM;AACvC,cAAI,CAAC,QAAQ;AACX,mBAAO;UACR;AACD,UAAAA,KAAK,SAASA,OAAMqI,cAAa,IAAI,UAAUrI,EAAC;AAChD,iBAAO,UAAU,OAAOA,KAAI,IAAI,IAAIA,IAAG,MAAM;AAAA,QAC9C;AA2BD,iBAAS,UAAU,OAAOA,IAAG,OAAO;AAClC,cAAI,SAAS,SAAS,OAAO,IAAI,MAAM;AACvC,cAAI,CAAC,QAAQ;AACX,mBAAO;UACR;AACD,UAAAA,KAAK,SAASA,OAAMqI,cAAa,IAAI,UAAUrI,EAAC;AAChD,UAAAA,KAAI,SAASA;AACb,iBAAO,UAAU,OAAO,GAAGA,KAAI,IAAI,IAAIA,EAAC;AAAA,QACzC;AAqCD,iBAAS,eAAe,OAAO,WAAW;AACxC,iBAAQ,SAAS,MAAM,SACnB,UAAU,OAAO,YAAY,WAAW,CAAC,GAAG,MAAM,IAAI,IACtD;QACL;AAqCD,iBAAS,UAAU,OAAO,WAAW;AACnC,iBAAQ,SAAS,MAAM,SACnB,UAAU,OAAO,YAAY,WAAW,CAAC,GAAG,IAAI,IAChD;QACL;AA+BD,iBAAS,KAAK,OAAO,OAAO,OAAO,KAAK;AACtC,cAAI,SAAS,SAAS,OAAO,IAAI,MAAM;AACvC,cAAI,CAAC,QAAQ;AACX,mBAAO;UACR;AACD,cAAI,SAAS,OAAO,SAAS,YAAY,eAAe,OAAO,OAAO,KAAK,GAAG;AAC5E,oBAAQ;AACR,kBAAM;AAAA,UACP;AACD,iBAAO,SAAS,OAAO,OAAO,OAAO,GAAG;AAAA,QACzC;AAqCD,iBAAS,UAAU,OAAO,WAAW,WAAW;AAC9C,cAAI,SAAS,SAAS,OAAO,IAAI,MAAM;AACvC,cAAI,CAAC,QAAQ;AACX,mBAAO;AAAA,UACR;AACD,cAAIF,SAAQ,aAAa,OAAO,IAAI,UAAU,SAAS;AACvD,cAAIA,SAAQ,GAAG;AACb,YAAAA,SAAQ,UAAU,SAASA,QAAO,CAAC;AAAA,UACpC;AACD,iBAAO,cAAc,OAAO,YAAY,WAAW,CAAC,GAAGA,MAAK;AAAA,QAC7D;AAqCD,iBAAS,cAAc,OAAO,WAAW,WAAW;AAClD,cAAI,SAAS,SAAS,OAAO,IAAI,MAAM;AACvC,cAAI,CAAC,QAAQ;AACX,mBAAO;AAAA,UACR;AACD,cAAIA,SAAQ,SAAS;AACrB,cAAI,cAAcuI,aAAW;AAC3B,YAAAvI,SAAQ,UAAU,SAAS;AAC3B,YAAAA,SAAQ,YAAY,IAChB,UAAU,SAASA,QAAO,CAAC,IAC3B,UAAUA,QAAO,SAAS,CAAC;AAAA,UAChC;AACD,iBAAO,cAAc,OAAO,YAAY,WAAW,CAAC,GAAGA,QAAO,IAAI;AAAA,QACnE;AAgBD,iBAASsE,SAAQ,OAAO;AACtB,cAAI,SAAS,SAAS,OAAO,IAAI,MAAM;AACvC,iBAAO,SAAS,YAAY,OAAO,CAAC,IAAI,CAAA;AAAA,QACzC;AAgBD,iBAAS,YAAY,OAAO;AAC1B,cAAI,SAAS,SAAS,OAAO,IAAI,MAAM;AACvC,iBAAO,SAAS,YAAY,OAAO,QAAQ,IAAI,CAAA;AAAA,QAChD;AAsBD,iBAAS,aAAa,OAAO,OAAO;AAClC,cAAI,SAAS,SAAS,OAAO,IAAI,MAAM;AACvC,cAAI,CAAC,QAAQ;AACX,mBAAO;UACR;AACD,kBAAQ,UAAUiE,cAAY,IAAI,UAAU,KAAK;AACjD,iBAAO,YAAY,OAAO,KAAK;AAAA,QAChC;AAiBD,iBAAS,UAAU,OAAO;AACxB,cAAIvI,SAAQ,IACR,SAAS,SAAS,OAAO,IAAI,MAAM,QACnC4J,UAAS,CAAA;AAEb,iBAAO,EAAE5J,SAAQ,QAAQ;AACvB,gBAAI6B,QAAO,MAAM7B,MAAK;AACtB,YAAA4J,QAAO/H,MAAK,CAAC,CAAC,IAAIA,MAAK,CAAC;AAAA,UACzB;AACD,iBAAO+H;AAAA,QACR;AAoBD,iBAAS,KAAK,OAAO;AACnB,iBAAQ,SAAS,MAAM,SAAU,MAAM,CAAC,IAAIrB;AAAAA,QAC7C;AAyBD,iBAAS,QAAQ,OAAO,OAAO,WAAW;AACxC,cAAI,SAAS,SAAS,OAAO,IAAI,MAAM;AACvC,cAAI,CAAC,QAAQ;AACX,mBAAO;AAAA,UACR;AACD,cAAIvI,SAAQ,aAAa,OAAO,IAAI,UAAU,SAAS;AACvD,cAAIA,SAAQ,GAAG;AACb,YAAAA,SAAQ,UAAU,SAASA,QAAO,CAAC;AAAA,UACpC;AACD,iBAAO,YAAY,OAAO,OAAOA,MAAK;AAAA,QACvC;AAgBD,iBAAS,QAAQ,OAAO;AACtB,cAAI,SAAS,SAAS,OAAO,IAAI,MAAM;AACvC,iBAAO,SAAS,UAAU,OAAO,GAAG,EAAE,IAAI;QAC3C;AAmBD,YAAI,eAAe,SAAS,SAAS,QAAQ;AAC3C,cAAI,SAAS,SAAS,QAAQ,mBAAmB;AACjD,iBAAQ,OAAO,UAAU,OAAO,CAAC,MAAM,OAAO,CAAC,IAC3C,iBAAiB,MAAM,IACvB;QACV,CAAK;AAyBD,YAAI,iBAAiB,SAAS,SAAS,QAAQ;AAC7C,cAAI6J,YAAW,KAAK,MAAM,GACtB,SAAS,SAAS,QAAQ,mBAAmB;AAEjD,cAAIA,cAAa,KAAK,MAAM,GAAG;AAC7B,YAAAA,YAAWtB;AAAAA,UACnB,OAAa;AACL,mBAAO,IAAG;AAAA,UACX;AACD,iBAAQ,OAAO,UAAU,OAAO,CAAC,MAAM,OAAO,CAAC,IAC3C,iBAAiB,QAAQ,YAAYsB,WAAU,CAAC,CAAC,IACjD;QACV,CAAK;AAuBD,YAAI,mBAAmB,SAAS,SAAS,QAAQ;AAC/C,cAAI,aAAa,KAAK,MAAM,GACxB,SAAS,SAAS,QAAQ,mBAAmB;AAEjD,uBAAa,OAAO,cAAc,aAAa,aAAatB;AAC5D,cAAI,YAAY;AACd,mBAAO,IAAG;AAAA,UACX;AACD,iBAAQ,OAAO,UAAU,OAAO,CAAC,MAAM,OAAO,CAAC,IAC3C,iBAAiB,QAAQA,aAAW,UAAU,IAC9C;QACV,CAAK;AAiBD,iBAAS,KAAK,OAAO,WAAW;AAC9B,iBAAO,SAAS,OAAO,KAAK,WAAW,KAAK,OAAO,SAAS;AAAA,QAC7D;AAgBD,iBAAS,KAAK,OAAO;AACnB,cAAI,SAAS,SAAS,OAAO,IAAI,MAAM;AACvC,iBAAO,SAAS,MAAM,SAAS,CAAC,IAAIA;AAAAA,QACrC;AAuBD,iBAAS,YAAY,OAAO,OAAO,WAAW;AAC5C,cAAI,SAAS,SAAS,OAAO,IAAI,MAAM;AACvC,cAAI,CAAC,QAAQ;AACX,mBAAO;AAAA,UACR;AACD,cAAIvI,SAAQ;AACZ,cAAI,cAAcuI,aAAW;AAC3B,YAAAvI,SAAQ,UAAU,SAAS;AAC3B,YAAAA,SAAQA,SAAQ,IAAI,UAAU,SAASA,QAAO,CAAC,IAAI,UAAUA,QAAO,SAAS,CAAC;AAAA,UAC/E;AACD,iBAAO,UAAU,QACb,kBAAkB,OAAO,OAAOA,MAAK,IACrC,cAAc,OAAO,WAAWA,QAAO,IAAI;AAAA,QAChD;AAuBD,iBAAS,IAAI,OAAOE,IAAG;AACrB,iBAAQ,SAAS,MAAM,SAAU,QAAQ,OAAO,UAAUA,EAAC,CAAC,IAAIqI;AAAAA,QACjE;AAyBD,YAAI,OAAO,SAAS,OAAO;AAsB3B,iBAAS,QAAQ,OAAOyB,SAAQ;AAC9B,iBAAQ,SAAS,MAAM,UAAUA,WAAUA,QAAO,SAC9C,YAAY,OAAOA,OAAM,IACzB;AAAA,QACL;AAyBD,iBAAS,UAAU,OAAOA,SAAQH,WAAU;AAC1C,iBAAQ,SAAS,MAAM,UAAUG,WAAUA,QAAO,SAC9C,YAAY,OAAOA,SAAQ,YAAYH,WAAU,CAAC,CAAC,IACnD;AAAA,QACL;AAyBD,iBAAS,YAAY,OAAOG,SAAQ,YAAY;AAC9C,iBAAQ,SAAS,MAAM,UAAUA,WAAUA,QAAO,SAC9C,YAAY,OAAOA,SAAQzB,aAAW,UAAU,IAChD;AAAA,QACL;AA0BD,YAAI,SAAS,SAAS,SAAS,OAAO,SAAS;AAC7C,cAAI,SAAS,SAAS,OAAO,IAAI,MAAM,QACnCqB,UAAS,OAAO,OAAO,OAAO;AAElC,qBAAW,OAAO,SAAS,SAAS,SAAS5J,QAAO;AAClD,mBAAO,QAAQA,QAAO,MAAM,IAAI,CAACA,SAAQA;AAAA,UACjD,CAAO,EAAE,KAAK,gBAAgB,CAAC;AAEzB,iBAAO4J;AAAA,QACb,CAAK;AA8BD,iBAASgB,QAAO,OAAO,WAAW;AAChC,cAAIhB,UAAS,CAAA;AACb,cAAI,EAAE,SAAS,MAAM,SAAS;AAC5B,mBAAOA;AAAA,UACR;AACD,cAAI5J,SAAQ,IACR,UAAU,CAAE,GACZ,SAAS,MAAM;AAEnB,sBAAY,YAAY,WAAW,CAAC;AACpC,iBAAO,EAAEA,SAAQ,QAAQ;AACvB,gBAAI,QAAQ,MAAMA,MAAK;AACvB,gBAAI,UAAU,OAAOA,QAAO,KAAK,GAAG;AAClC,cAAA4J,QAAO,KAAK,KAAK;AACjB,sBAAQ,KAAK5J,MAAK;AAAA,YACnB;AAAA,UACF;AACD,qBAAW,OAAO,OAAO;AACzB,iBAAO4J;AAAA,QACR;AAyBD,iBAAS,QAAQ,OAAO;AACtB,iBAAO,SAAS,OAAO,QAAQ,cAAc,KAAK,KAAK;AAAA,QACxD;AAkBD,iBAAS,MAAM,OAAO,OAAO,KAAK;AAChC,cAAI,SAAS,SAAS,OAAO,IAAI,MAAM;AACvC,cAAI,CAAC,QAAQ;AACX,mBAAO;UACR;AACD,cAAI,OAAO,OAAO,OAAO,YAAY,eAAe,OAAO,OAAO,GAAG,GAAG;AACtE,oBAAQ;AACR,kBAAM;AAAA,UACP,OACI;AACH,oBAAQ,SAAS,OAAO,IAAI,UAAU,KAAK;AAC3C,kBAAM,QAAQrB,cAAY,SAAS,UAAU,GAAG;AAAA,UACjD;AACD,iBAAO,UAAU,OAAO,OAAO,GAAG;AAAA,QACnC;AAmBD,iBAAS,YAAY,OAAO,OAAO;AACjC,iBAAO,gBAAgB,OAAO,KAAK;AAAA,QACpC;AA2BD,iBAAS,cAAc,OAAO,OAAOsB,WAAU;AAC7C,iBAAO,kBAAkB,OAAO,OAAO,YAAYA,WAAU,CAAC,CAAC;AAAA,QAChE;AAkBD,iBAAS,cAAc,OAAO,OAAO;AACnC,cAAI,SAAS,SAAS,OAAO,IAAI,MAAM;AACvC,cAAI,QAAQ;AACV,gBAAI7J,SAAQ,gBAAgB,OAAO,KAAK;AACxC,gBAAIA,SAAQ,UAAU,GAAG,MAAMA,MAAK,GAAG,KAAK,GAAG;AAC7C,qBAAOA;AAAA,YACR;AAAA,UACF;AACD,iBAAO;AAAA,QACR;AAoBD,iBAAS,gBAAgB,OAAO,OAAO;AACrC,iBAAO,gBAAgB,OAAO,OAAO,IAAI;AAAA,QAC1C;AA2BD,iBAAS,kBAAkB,OAAO,OAAO6J,WAAU;AACjD,iBAAO,kBAAkB,OAAO,OAAO,YAAYA,WAAU,CAAC,GAAG,IAAI;AAAA,QACtE;AAkBD,iBAAS,kBAAkB,OAAO,OAAO;AACvC,cAAI,SAAS,SAAS,OAAO,IAAI,MAAM;AACvC,cAAI,QAAQ;AACV,gBAAI7J,SAAQ,gBAAgB,OAAO,OAAO,IAAI,IAAI;AAClD,gBAAI,GAAG,MAAMA,MAAK,GAAG,KAAK,GAAG;AAC3B,qBAAOA;AAAA,YACR;AAAA,UACF;AACD,iBAAO;AAAA,QACR;AAiBD,iBAAS,WAAW,OAAO;AACzB,iBAAQ,SAAS,MAAM,SACnB,eAAe,KAAK,IACpB;QACL;AAkBD,iBAAS,aAAa,OAAO6J,WAAU;AACrC,iBAAQ,SAAS,MAAM,SACnB,eAAe,OAAO,YAAYA,WAAU,CAAC,CAAC,IAC9C;QACL;AAgBD,iBAAS,KAAK,OAAO;AACnB,cAAI,SAAS,SAAS,OAAO,IAAI,MAAM;AACvC,iBAAO,SAAS,UAAU,OAAO,GAAG,MAAM,IAAI;QAC/C;AA2BD,iBAAS,KAAK,OAAO3J,IAAG,OAAO;AAC7B,cAAI,EAAE,SAAS,MAAM,SAAS;AAC5B,mBAAO;UACR;AACD,UAAAA,KAAK,SAASA,OAAMqI,cAAa,IAAI,UAAUrI,EAAC;AAChD,iBAAO,UAAU,OAAO,GAAGA,KAAI,IAAI,IAAIA,EAAC;AAAA,QACzC;AA2BD,iBAAS,UAAU,OAAOA,IAAG,OAAO;AAClC,cAAI,SAAS,SAAS,OAAO,IAAI,MAAM;AACvC,cAAI,CAAC,QAAQ;AACX,mBAAO;UACR;AACD,UAAAA,KAAK,SAASA,OAAMqI,cAAa,IAAI,UAAUrI,EAAC;AAChD,UAAAA,KAAI,SAASA;AACb,iBAAO,UAAU,OAAOA,KAAI,IAAI,IAAIA,IAAG,MAAM;AAAA,QAC9C;AAqCD,iBAAS,eAAe,OAAO,WAAW;AACxC,iBAAQ,SAAS,MAAM,SACnB,UAAU,OAAO,YAAY,WAAW,CAAC,GAAG,OAAO,IAAI,IACvD;QACL;AAqCD,iBAAS,UAAU,OAAO,WAAW;AACnC,iBAAQ,SAAS,MAAM,SACnB,UAAU,OAAO,YAAY,WAAW,CAAC,CAAC,IAC1C;QACL;AAkBD,YAAI,QAAQ,SAAS,SAAS,QAAQ;AACpC,iBAAO,SAAS,YAAY,QAAQ,GAAG,mBAAmB,IAAI,CAAC;AAAA,QACrE,CAAK;AAyBD,YAAI,UAAU,SAAS,SAAS,QAAQ;AACtC,cAAI2J,YAAW,KAAK,MAAM;AAC1B,cAAI,kBAAkBA,SAAQ,GAAG;AAC/B,YAAAA,YAAWtB;AAAAA,UACZ;AACD,iBAAO,SAAS,YAAY,QAAQ,GAAG,mBAAmB,IAAI,GAAG,YAAYsB,WAAU,CAAC,CAAC;AAAA,QAC/F,CAAK;AAuBD,YAAI,YAAY,SAAS,SAAS,QAAQ;AACxC,cAAI,aAAa,KAAK,MAAM;AAC5B,uBAAa,OAAO,cAAc,aAAa,aAAatB;AAC5D,iBAAO,SAAS,YAAY,QAAQ,GAAG,mBAAmB,IAAI,GAAGA,aAAW,UAAU;AAAA,QAC5F,CAAK;AAoBD,iBAAS,KAAK,OAAO;AACnB,iBAAQ,SAAS,MAAM,SAAU,SAAS,KAAK,IAAI;QACpD;AAyBD,iBAAS,OAAO,OAAOsB,WAAU;AAC/B,iBAAQ,SAAS,MAAM,SAAU,SAAS,OAAO,YAAYA,WAAU,CAAC,CAAC,IAAI,CAAA;AAAA,QAC9E;AAsBD,iBAAS,SAAS,OAAO,YAAY;AACnC,uBAAa,OAAO,cAAc,aAAa,aAAatB;AAC5D,iBAAQ,SAAS,MAAM,SAAU,SAAS,OAAOA,aAAW,UAAU,IAAI;QAC3E;AAqBD,iBAAS,MAAM,OAAO;AACpB,cAAI,EAAE,SAAS,MAAM,SAAS;AAC5B,mBAAO;UACR;AACD,cAAI,SAAS;AACb,kBAAQ,YAAY,OAAO,SAAS,OAAO;AACzC,gBAAI,kBAAkB,KAAK,GAAG;AAC5B,uBAAS,UAAU,MAAM,QAAQ,MAAM;AACvC,qBAAO;AAAA,YACR;AAAA,UACT,CAAO;AACD,iBAAO,UAAU,QAAQ,SAASvI,QAAO;AACvC,mBAAO,SAAS,OAAO,aAAaA,MAAK,CAAC;AAAA,UAClD,CAAO;AAAA,QACF;AAuBD,iBAAS,UAAU,OAAO6J,WAAU;AAClC,cAAI,EAAE,SAAS,MAAM,SAAS;AAC5B,mBAAO;UACR;AACD,cAAID,UAAS,MAAM,KAAK;AACxB,cAAIC,aAAY,MAAM;AACpB,mBAAOD;AAAA,UACR;AACD,iBAAO,SAASA,SAAQ,SAAS,OAAO;AACtC,mBAAO,MAAMC,WAAUtB,aAAW,KAAK;AAAA,UAC/C,CAAO;AAAA,QACF;AAsBD,YAAI,UAAU,SAAS,SAAS,OAAOyB,SAAQ;AAC7C,iBAAO,kBAAkB,KAAK,IAC1B,eAAe,OAAOA,OAAM,IAC5B;QACV,CAAK;AAoBD,YAAI,MAAM,SAAS,SAAS,QAAQ;AAClC,iBAAO,QAAQ,YAAY,QAAQ,iBAAiB,CAAC;AAAA,QAC3D,CAAK;AAyBD,YAAI,QAAQ,SAAS,SAAS,QAAQ;AACpC,cAAIH,YAAW,KAAK,MAAM;AAC1B,cAAI,kBAAkBA,SAAQ,GAAG;AAC/B,YAAAA,YAAWtB;AAAAA,UACZ;AACD,iBAAO,QAAQ,YAAY,QAAQ,iBAAiB,GAAG,YAAYsB,WAAU,CAAC,CAAC;AAAA,QACrF,CAAK;AAuBD,YAAI,UAAU,SAAS,SAAS,QAAQ;AACtC,cAAI,aAAa,KAAK,MAAM;AAC5B,uBAAa,OAAO,cAAc,aAAa,aAAatB;AAC5D,iBAAO,QAAQ,YAAY,QAAQ,iBAAiB,GAAGA,aAAW,UAAU;AAAA,QAClF,CAAK;AAkBD,YAAI,MAAM,SAAS,KAAK;AAkBxB,iBAAS,UAAU,OAAOyB,SAAQ;AAChC,iBAAO,cAAc,SAAS,CAAA,GAAIA,WAAU,CAAA,GAAI,WAAW;AAAA,QAC5D;AAiBD,iBAAS,cAAc,OAAOA,SAAQ;AACpC,iBAAO,cAAc,SAAS,CAAA,GAAIA,WAAU,CAAA,GAAI,OAAO;AAAA,QACxD;AAsBD,YAAI,UAAU,SAAS,SAAS,QAAQ;AACtC,cAAI,SAAS,OAAO,QAChBH,YAAW,SAAS,IAAI,OAAO,SAAS,CAAC,IAAItB;AAEjD,UAAAsB,YAAW,OAAOA,aAAY,cAAc,OAAO,IAAK,GAAEA,aAAYtB;AACtE,iBAAO,UAAU,QAAQsB,SAAQ;AAAA,QACvC,CAAK;AAiCD,iBAAS,MAAM,OAAO;AACpB,cAAID,UAASD,QAAO,KAAK;AACzB,UAAAC,QAAO,YAAY;AACnB,iBAAOA;AAAA,QACR;AAyBD,iBAAS,IAAI,OAAO,aAAa;AAC/B,sBAAY,KAAK;AACjB,iBAAO;AAAA,QACR;AAyBD,iBAAS,KAAK,OAAO,aAAa;AAChC,iBAAO,YAAY,KAAK;AAAA,QACzB;AAkBD,YAAI,YAAY,SAAS,SAAS,OAAO;AACvC,cAAI,SAAS,MAAM,QACf,QAAQ,SAAS,MAAM,CAAC,IAAI,GAC5B,QAAQ,KAAK,aACb,cAAc,SAAS,QAAQ;AAAE,mBAAO,OAAO,QAAQ,KAAK;AAAA;AAEhE,cAAI,SAAS,KAAK,KAAK,YAAY,UAC/B,EAAE,iBAAiB,gBAAgB,CAAC,QAAQ,KAAK,GAAG;AACtD,mBAAO,KAAK,KAAK,WAAW;AAAA,UAC7B;AACD,kBAAQ,MAAM,MAAM,OAAO,CAAC,SAAS,SAAS,IAAI,EAAE;AACpD,gBAAM,YAAY,KAAK;AAAA,YACrB,QAAQ;AAAA,YACR,QAAQ,CAAC,WAAW;AAAA,YACpB,WAAWrB;AAAAA,UACnB,CAAO;AACD,iBAAO,IAAI,cAAc,OAAO,KAAK,SAAS,EAAE,KAAK,SAAS,OAAO;AACnE,gBAAI,UAAU,CAAC,MAAM,QAAQ;AAC3B,oBAAM,KAAKA,WAAS;AAAA,YACrB;AACD,mBAAO;AAAA,UACf,CAAO;AAAA,QACP,CAAK;AA6BD,iBAAS,eAAe;AACtB,iBAAO,MAAM,IAAI;AAAA,QAClB;AA4BD,iBAAS,gBAAgB;AACvB,iBAAO,IAAI,cAAc,KAAK,MAAK,GAAI,KAAK,SAAS;AAAA,QACtD;AAwBD,iBAAS,cAAc;AACrB,cAAI,KAAK,eAAeA,aAAW;AACjC,iBAAK,aAAa,QAAQ,KAAK,MAAO,CAAA;AAAA,UACvC;AACD,cAAI,OAAO,KAAK,aAAa,KAAK,WAAW,QACzC,QAAQ,OAAOA,cAAY,KAAK,WAAW,KAAK,WAAW;AAE/D,iBAAO,EAAE,QAAQ,MAAM,SAAS,MAAK;AAAA,QACtC;AAoBD,iBAAS,oBAAoB;AAC3B,iBAAO;AAAA,QACR;AA0BD,iBAAS,aAAa,OAAO;AAC3B,cAAIqB,SACAiB,UAAS;AAEb,iBAAOA,mBAAkB,YAAY;AACnC,gBAAIC,SAAQ,aAAaD,OAAM;AAC/B,YAAAC,OAAM,YAAY;AAClB,YAAAA,OAAM,aAAavC;AACnB,gBAAIqB,SAAQ;AACV,uBAAS,cAAckB;AAAA,YACjC,OAAe;AACL,cAAAlB,UAASkB;AAAA,YACV;AACD,gBAAI,WAAWA;AACf,YAAAD,UAASA,QAAO;AAAA,UACjB;AACD,mBAAS,cAAc;AACvB,iBAAOjB;AAAA,QACR;AAsBD,iBAAS,iBAAiB;AACxB,cAAI,QAAQ,KAAK;AACjB,cAAI,iBAAiB,aAAa;AAChC,gBAAI,UAAU;AACd,gBAAI,KAAK,YAAY,QAAQ;AAC3B,wBAAU,IAAI,YAAY,IAAI;AAAA,YAC/B;AACD,sBAAU,QAAQ;AAClB,oBAAQ,YAAY,KAAK;AAAA,cACvB,QAAQ;AAAA,cACR,QAAQ,CAAC,OAAO;AAAA,cAChB,WAAWrB;AAAAA,YACrB,CAAS;AACD,mBAAO,IAAI,cAAc,SAAS,KAAK,SAAS;AAAA,UACjD;AACD,iBAAO,KAAK,KAAK,OAAO;AAAA,QACzB;AAgBD,iBAAS,eAAe;AACtB,iBAAO,iBAAiB,KAAK,aAAa,KAAK,WAAW;AAAA,QAC3D;AA0BD,YAAI,UAAU,iBAAiB,SAASqB,SAAQ,OAAO,KAAK;AAC1D,cAAI,eAAe,KAAKA,SAAQ,GAAG,GAAG;AACpC,cAAEA,QAAO,GAAG;AAAA,UACpB,OAAa;AACL,4BAAgBA,SAAQ,KAAK,CAAC;AAAA,UAC/B;AAAA,QACP,CAAK;AA2CD,iBAAS,MAAM,YAAY,WAAW,OAAO;AAC3C,cAAI,OAAO,QAAQ,UAAU,IAAI,aAAa;AAC9C,cAAI,SAAS,eAAe,YAAY,WAAW,KAAK,GAAG;AACzD,wBAAYrB;AAAAA,UACb;AACD,iBAAO,KAAK,YAAY,YAAY,WAAW,CAAC,CAAC;AAAA,QAClD;AA2CD,iBAAS,OAAO,YAAY,WAAW;AACrC,cAAI,OAAO,QAAQ,UAAU,IAAI,cAAc;AAC/C,iBAAO,KAAK,YAAY,YAAY,WAAW,CAAC,CAAC;AAAA,QAClD;AAsCD,YAAIwC,QAAO,WAAW,SAAS;AAqB/B,YAAI,WAAW,WAAW,aAAa;AAuBvC,iBAAS,QAAQ,YAAYlB,WAAU;AACrC,iBAAO,YAAY,IAAI,YAAYA,SAAQ,GAAG,CAAC;AAAA,QAChD;AAsBD,iBAAS,YAAY,YAAYA,WAAU;AACzC,iBAAO,YAAY,IAAI,YAAYA,SAAQ,GAAG,QAAQ;AAAA,QACvD;AAuBD,iBAAS,aAAa,YAAYA,WAAU,OAAO;AACjD,kBAAQ,UAAUtB,cAAY,IAAI,UAAU,KAAK;AACjD,iBAAO,YAAY,IAAI,YAAYsB,SAAQ,GAAG,KAAK;AAAA,QACpD;AAgCD,iBAAS,QAAQ,YAAYA,WAAU;AACrC,cAAI,OAAO,QAAQ,UAAU,IAAI,YAAY;AAC7C,iBAAO,KAAK,YAAY,YAAYA,WAAU,CAAC,CAAC;AAAA,QACjD;AAsBD,iBAAS,aAAa,YAAYA,WAAU;AAC1C,cAAI,OAAO,QAAQ,UAAU,IAAI,iBAAiB;AAClD,iBAAO,KAAK,YAAY,YAAYA,WAAU,CAAC,CAAC;AAAA,QACjD;AAyBD,YAAI,UAAU,iBAAiB,SAASD,SAAQ,OAAO,KAAK;AAC1D,cAAI,eAAe,KAAKA,SAAQ,GAAG,GAAG;AACpC,YAAAA,QAAO,GAAG,EAAE,KAAK,KAAK;AAAA,UAC9B,OAAa;AACL,4BAAgBA,SAAQ,KAAK,CAAC,KAAK,CAAC;AAAA,UACrC;AAAA,QACP,CAAK;AAgCD,iBAAS,SAAS,YAAY,OAAO,WAAW,OAAO;AACrD,uBAAa,YAAY,UAAU,IAAI,aAAa,OAAO,UAAU;AACrE,sBAAa,aAAa,CAAC,QAAS,UAAU,SAAS,IAAI;AAE3D,cAAI,SAAS,WAAW;AACxB,cAAI,YAAY,GAAG;AACjB,wBAAY,UAAU,SAAS,WAAW,CAAC;AAAA,UAC5C;AACD,iBAAO,SAAS,UAAU,IACrB,aAAa,UAAU,WAAW,QAAQ,OAAO,SAAS,IAAI,KAC9D,CAAC,CAAC,UAAU,YAAY,YAAY,OAAO,SAAS,IAAI;AAAA,QAC9D;AAyBD,YAAI,YAAY,SAAS,SAAS,YAAY,MAAM,MAAM;AACxD,cAAI5J,SAAQ,IACR,SAAS,OAAO,QAAQ,YACxB4J,UAAS,YAAY,UAAU,IAAIjB,OAAM,WAAW,MAAM,IAAI;AAElE,mBAAS,YAAY,SAAS,OAAO;AACnC,YAAAiB,QAAO,EAAE5J,MAAK,IAAI,SAAS,MAAM,MAAM,OAAO,IAAI,IAAI,WAAW,OAAO,MAAM,IAAI;AAAA,UAC1F,CAAO;AACD,iBAAO4J;AAAA,QACb,CAAK;AA8BD,YAAI,QAAQ,iBAAiB,SAASA,SAAQ,OAAO,KAAK;AACxD,0BAAgBA,SAAQ,KAAK,KAAK;AAAA,QACxC,CAAK;AA4CD,iBAAS,IAAI,YAAYC,WAAU;AACjC,cAAI,OAAO,QAAQ,UAAU,IAAI,WAAW;AAC5C,iBAAO,KAAK,YAAY,YAAYA,WAAU,CAAC,CAAC;AAAA,QACjD;AA+BD,iBAAS,QAAQ,YAAY,WAAW,QAAQ,OAAO;AACrD,cAAI,cAAc,MAAM;AACtB,mBAAO;UACR;AACD,cAAI,CAAC,QAAQ,SAAS,GAAG;AACvB,wBAAY,aAAa,OAAO,CAAA,IAAK,CAAC,SAAS;AAAA,UAChD;AACD,mBAAS,QAAQtB,cAAY;AAC7B,cAAI,CAAC,QAAQ,MAAM,GAAG;AACpB,qBAAS,UAAU,OAAO,CAAA,IAAK,CAAC,MAAM;AAAA,UACvC;AACD,iBAAO,YAAY,YAAY,WAAW,MAAM;AAAA,QACjD;AAsCD,YAAI,YAAY,iBAAiB,SAASqB,SAAQ,OAAO,KAAK;AAC5D,UAAAA,QAAO,MAAM,IAAI,CAAC,EAAE,KAAK,KAAK;AAAA,QACpC,GAAO,WAAW;AAAE,iBAAO,CAAC,CAAA,GAAI,CAAA,CAAE;AAAA,QAAI,CAAA;AAuClC,iBAAS,OAAO,YAAYC,WAAU,aAAa;AACjD,cAAI,OAAO,QAAQ,UAAU,IAAI,cAAc,YAC3C,YAAY,UAAU,SAAS;AAEnC,iBAAO,KAAK,YAAY,YAAYA,WAAU,CAAC,GAAG,aAAa,WAAW,QAAQ;AAAA,QACnF;AAwBD,iBAAS,YAAY,YAAYA,WAAU,aAAa;AACtD,cAAI,OAAO,QAAQ,UAAU,IAAI,mBAAmB,YAChD,YAAY,UAAU,SAAS;AAEnC,iBAAO,KAAK,YAAY,YAAYA,WAAU,CAAC,GAAG,aAAa,WAAW,aAAa;AAAA,QACxF;AAoCD,iBAAS,OAAO,YAAY,WAAW;AACrC,cAAI,OAAO,QAAQ,UAAU,IAAI,cAAc;AAC/C,iBAAO,KAAK,YAAY,OAAO,YAAY,WAAW,CAAC,CAAC,CAAC;AAAA,QAC1D;AAgBD,iBAAS,OAAO,YAAY;AAC1B,cAAI,OAAO,QAAQ,UAAU,IAAI,cAAc;AAC/C,iBAAO,KAAK,UAAU;AAAA,QACvB;AAsBD,iBAAS,WAAW,YAAY3J,IAAG,OAAO;AACxC,cAAK,QAAQ,eAAe,YAAYA,IAAG,KAAK,IAAIA,OAAMqI,aAAY;AACpE,YAAArI,KAAI;AAAA,UACZ,OAAa;AACL,YAAAA,KAAI,UAAUA,EAAC;AAAA,UAChB;AACD,cAAI,OAAO,QAAQ,UAAU,IAAI,kBAAkB;AACnD,iBAAO,KAAK,YAAYA,EAAC;AAAA,QAC1B;AAiBD,iBAAS,QAAQ,YAAY;AAC3B,cAAI,OAAO,QAAQ,UAAU,IAAI,eAAe;AAChD,iBAAO,KAAK,UAAU;AAAA,QACvB;AAuBD,iBAAS,KAAK,YAAY;AACxB,cAAI,cAAc,MAAM;AACtB,mBAAO;AAAA,UACR;AACD,cAAI,YAAY,UAAU,GAAG;AAC3B,mBAAO,SAAS,UAAU,IAAI,WAAW,UAAU,IAAI,WAAW;AAAA,UACnE;AACD,cAAI,MAAM,OAAO,UAAU;AAC3B,cAAI,OAAO,UAAU,OAAO,QAAQ;AAClC,mBAAO,WAAW;AAAA,UACnB;AACD,iBAAO,SAAS,UAAU,EAAE;AAAA,QAC7B;AAsCD,iBAAS,KAAK,YAAY,WAAW,OAAO;AAC1C,cAAI,OAAO,QAAQ,UAAU,IAAI,YAAY;AAC7C,cAAI,SAAS,eAAe,YAAY,WAAW,KAAK,GAAG;AACzD,wBAAYqI;AAAAA,UACb;AACD,iBAAO,KAAK,YAAY,YAAY,WAAW,CAAC,CAAC;AAAA,QAClD;AA+BD,YAAI,SAAS,SAAS,SAAS,YAAY,WAAW;AACpD,cAAI,cAAc,MAAM;AACtB,mBAAO;UACR;AACD,cAAI,SAAS,UAAU;AACvB,cAAI,SAAS,KAAK,eAAe,YAAY,UAAU,CAAC,GAAG,UAAU,CAAC,CAAC,GAAG;AACxE,wBAAY,CAAA;AAAA,UACb,WAAU,SAAS,KAAK,eAAe,UAAU,CAAC,GAAG,UAAU,CAAC,GAAG,UAAU,CAAC,CAAC,GAAG;AACjF,wBAAY,CAAC,UAAU,CAAC,CAAC;AAAA,UAC1B;AACD,iBAAO,YAAY,YAAY,YAAY,WAAW,CAAC,GAAG,CAAA,CAAE;AAAA,QAClE,CAAK;AAoBD,YAAI,MAAM,UAAU,WAAW;AAC7B,iBAAO,KAAK,KAAK;QACvB;AA4BI,iBAAS,MAAMrI,IAAG,MAAM;AACtB,cAAI,OAAO,QAAQ,YAAY;AAC7B,kBAAM,IAAIiJ,WAAU,eAAe;AAAA,UACpC;AACD,UAAAjJ,KAAI,UAAUA,EAAC;AACf,iBAAO,WAAW;AAChB,gBAAI,EAAEA,KAAI,GAAG;AACX,qBAAO,KAAK,MAAM,MAAM,SAAS;AAAA,YAClC;AAAA,UACT;AAAA,QACK;AAmBD,iBAAS,IAAI,MAAMA,IAAG,OAAO;AAC3B,UAAAA,KAAI,QAAQqI,cAAYrI;AACxB,UAAAA,KAAK,QAAQA,MAAK,OAAQ,KAAK,SAASA;AACxC,iBAAO,WAAW,MAAM,eAAeqI,aAAWA,aAAWA,aAAWA,aAAWrI,EAAC;AAAA,QACrF;AAmBD,iBAAS,OAAOA,IAAG,MAAM;AACvB,cAAI0J;AACJ,cAAI,OAAO,QAAQ,YAAY;AAC7B,kBAAM,IAAIT,WAAU,eAAe;AAAA,UACpC;AACD,UAAAjJ,KAAI,UAAUA,EAAC;AACf,iBAAO,WAAW;AAChB,gBAAI,EAAEA,KAAI,GAAG;AACX,cAAA0J,UAAS,KAAK,MAAM,MAAM,SAAS;AAAA,YACpC;AACD,gBAAI1J,MAAK,GAAG;AACV,qBAAOqI;AAAAA,YACR;AACD,mBAAOqB;AAAA,UACf;AAAA,QACK;AAqCD,YAAI,OAAO,SAAS,SAAS,MAAM,SAAS,UAAU;AACpD,cAAI,UAAU;AACd,cAAI,SAAS,QAAQ;AACnB,gBAAI,UAAU,eAAe,UAAU,UAAU,IAAI,CAAC;AACtD,uBAAW;AAAA,UACZ;AACD,iBAAO,WAAW,MAAM,SAAS,SAAS,UAAU,OAAO;AAAA,QACjE,CAAK;AA+CD,YAAI,UAAU,SAAS,SAAS,QAAQ,KAAK,UAAU;AACrD,cAAI,UAAU,iBAAiB;AAC/B,cAAI,SAAS,QAAQ;AACnB,gBAAI,UAAU,eAAe,UAAU,UAAU,OAAO,CAAC;AACzD,uBAAW;AAAA,UACZ;AACD,iBAAO,WAAW,KAAK,SAAS,QAAQ,UAAU,OAAO;AAAA,QAC/D,CAAK;AA2CD,iBAAS,MAAM,MAAM,OAAO,OAAO;AACjC,kBAAQ,QAAQrB,cAAY;AAC5B,cAAIqB,UAAS,WAAW,MAAM,iBAAiBrB,aAAWA,aAAWA,aAAWA,aAAWA,aAAW,KAAK;AAC3G,UAAAqB,QAAO,cAAc,MAAM;AAC3B,iBAAOA;AAAA,QACR;AAwCD,iBAAS,WAAW,MAAM,OAAO,OAAO;AACtC,kBAAQ,QAAQrB,cAAY;AAC5B,cAAIqB,UAAS,WAAW,MAAM,uBAAuBrB,aAAWA,aAAWA,aAAWA,aAAWA,aAAW,KAAK;AACjH,UAAAqB,QAAO,cAAc,WAAW;AAChC,iBAAOA;AAAA,QACR;AAwDD,iBAAS,SAAS,MAAM,MAAM,SAAS;AACrC,cAAI,UACA,UACA,SACAA,SACA,SACA,cACA,iBAAiB,GACjB,UAAU,OACV,SAAS,OACT,WAAW;AAEf,cAAI,OAAO,QAAQ,YAAY;AAC7B,kBAAM,IAAIT,WAAU,eAAe;AAAA,UACpC;AACD,iBAAO,SAAS,IAAI,KAAK;AACzB,cAAI,SAAS,OAAO,GAAG;AACrB,sBAAU,CAAC,CAAC,QAAQ;AACpB,qBAAS,aAAa;AACtB,sBAAU,SAAS,UAAU,SAAS,QAAQ,OAAO,KAAK,GAAG,IAAI,IAAI;AACrE,uBAAW,cAAc,UAAU,CAAC,CAAC,QAAQ,WAAW;AAAA,UACzD;AAED,mBAAS,WAAW,MAAM;AACxB,gBAAI,OAAO,UACP,UAAU;AAEd,uBAAW,WAAWZ;AACtB,6BAAiB;AACjB,YAAAqB,UAAS,KAAK,MAAM,SAAS,IAAI;AACjC,mBAAOA;AAAA,UACR;AAED,mBAAS,YAAY,MAAM;AAEzB,6BAAiB;AAEjB,sBAAUM,YAAW,cAAc,IAAI;AAEvC,mBAAO,UAAU,WAAW,IAAI,IAAIN;AAAA,UACrC;AAED,mBAAS,cAAc,MAAM;AAC3B,gBAAI,oBAAoB,OAAO,cAC3B,sBAAsB,OAAO,gBAC7B,cAAc,OAAO;AAEzB,mBAAO,SACH,UAAU,aAAa,UAAU,mBAAmB,IACpD;AAAA,UACL;AAED,mBAAS,aAAa,MAAM;AAC1B,gBAAI,oBAAoB,OAAO,cAC3B,sBAAsB,OAAO;AAKjC,mBAAQ,iBAAiBrB,eAAc,qBAAqB,QACzD,oBAAoB,KAAO,UAAU,uBAAuB;AAAA,UAChE;AAED,mBAAS,eAAe;AACtB,gBAAI,OAAO;AACX,gBAAI,aAAa,IAAI,GAAG;AACtB,qBAAO,aAAa,IAAI;AAAA,YACzB;AAED,sBAAU2B,YAAW,cAAc,cAAc,IAAI,CAAC;AAAA,UACvD;AAED,mBAAS,aAAa,MAAM;AAC1B,sBAAU3B;AAIV,gBAAI,YAAY,UAAU;AACxB,qBAAO,WAAW,IAAI;AAAA,YACvB;AACD,uBAAW,WAAWA;AACtB,mBAAOqB;AAAA,UACR;AAED,mBAAS,SAAS;AAChB,gBAAI,YAAYrB,aAAW;AACzB,cAAA+B,cAAa,OAAO;AAAA,YACrB;AACD,6BAAiB;AACjB,uBAAW,eAAe,WAAW,UAAU/B;AAAAA,UAChD;AAED,mBAAS,QAAQ;AACf,mBAAO,YAAYA,cAAYqB,UAAS,aAAa,IAAK,CAAA;AAAA,UAC3D;AAED,mBAAS,YAAY;AACnB,gBAAI,OAAO,IAAK,GACZ,aAAa,aAAa,IAAI;AAElC,uBAAW;AACX,uBAAW;AACX,2BAAe;AAEf,gBAAI,YAAY;AACd,kBAAI,YAAYrB,aAAW;AACzB,uBAAO,YAAY,YAAY;AAAA,cAChC;AACD,kBAAI,QAAQ;AAEV,gBAAA+B,cAAa,OAAO;AACpB,0BAAUJ,YAAW,cAAc,IAAI;AACvC,uBAAO,WAAW,YAAY;AAAA,cAC/B;AAAA,YACF;AACD,gBAAI,YAAY3B,aAAW;AACzB,wBAAU2B,YAAW,cAAc,IAAI;AAAA,YACxC;AACD,mBAAON;AAAA,UACR;AACD,oBAAU,SAAS;AACnB,oBAAU,QAAQ;AAClB,iBAAO;AAAA,QACR;AAoBD,YAAI,QAAQ,SAAS,SAAS,MAAM,MAAM;AACxC,iBAAO,UAAU,MAAM,GAAG,IAAI;AAAA,QACpC,CAAK;AAqBD,YAAI,QAAQ,SAAS,SAAS,MAAM,MAAM,MAAM;AAC9C,iBAAO,UAAU,MAAM,SAAS,IAAI,KAAK,GAAG,IAAI;AAAA,QACtD,CAAK;AAoBD,iBAAS,KAAK,MAAM;AAClB,iBAAO,WAAW,MAAM,cAAc;AAAA,QACvC;AA8CD,iBAAS,QAAQ,MAAM,UAAU;AAC/B,cAAI,OAAO,QAAQ,cAAe,YAAY,QAAQ,OAAO,YAAY,YAAa;AACpF,kBAAM,IAAIT,WAAU,eAAe;AAAA,UACpC;AACD,cAAI,WAAW,WAAW;AACxB,gBAAI,OAAO,WACP,MAAM,WAAW,SAAS,MAAM,MAAM,IAAI,IAAI,KAAK,CAAC,GACpD,QAAQ,SAAS;AAErB,gBAAI,MAAM,IAAI,GAAG,GAAG;AAClB,qBAAO,MAAM,IAAI,GAAG;AAAA,YACrB;AACD,gBAAIS,UAAS,KAAK,MAAM,MAAM,IAAI;AAClC,qBAAS,QAAQ,MAAM,IAAI,KAAKA,OAAM,KAAK;AAC3C,mBAAOA;AAAA,UACf;AACM,mBAAS,QAAQ,KAAK,QAAQ,SAAS;AACvC,iBAAO;AAAA,QACR;AAGD,gBAAQ,QAAQ;AAsBhB,iBAAS,OAAO,WAAW;AACzB,cAAI,OAAO,aAAa,YAAY;AAClC,kBAAM,IAAIT,WAAU,eAAe;AAAA,UACpC;AACD,iBAAO,WAAW;AAChB,gBAAI,OAAO;AACX,oBAAQ,KAAK,QAAM;AAAA,cACjB,KAAK;AAAG,uBAAO,CAAC,UAAU,KAAK,IAAI;AAAA,cACnC,KAAK;AAAG,uBAAO,CAAC,UAAU,KAAK,MAAM,KAAK,CAAC,CAAC;AAAA,cAC5C,KAAK;AAAG,uBAAO,CAAC,UAAU,KAAK,MAAM,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AAAA,cACrD,KAAK;AAAG,uBAAO,CAAC,UAAU,KAAK,MAAM,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AAAA,YAC/D;AACD,mBAAO,CAAC,UAAU,MAAM,MAAM,IAAI;AAAA,UAC1C;AAAA,QACK;AAoBD,iBAAS,KAAK,MAAM;AAClB,iBAAO,OAAO,GAAG,IAAI;AAAA,QACtB;AAiCD,YAAI,WAAW,SAAS,SAAS,MAAM,YAAY;AACjD,uBAAc,WAAW,UAAU,KAAK,QAAQ,WAAW,CAAC,CAAC,IACzD,SAAS,WAAW,CAAC,GAAG,UAAU,YAAa,CAAA,CAAC,IAChD,SAAS,YAAY,YAAY,CAAC,GAAG,UAAU,YAAa,CAAA,CAAC;AAEjE,cAAI,cAAc,WAAW;AAC7B,iBAAO,SAAS,SAAS,MAAM;AAC7B,gBAAInJ,SAAQ,IACR,SAAS,UAAU,KAAK,QAAQ,WAAW;AAE/C,mBAAO,EAAEA,SAAQ,QAAQ;AACvB,mBAAKA,MAAK,IAAI,WAAWA,MAAK,EAAE,KAAK,MAAM,KAAKA,MAAK,CAAC;AAAA,YACvD;AACD,mBAAO,MAAM,MAAM,MAAM,IAAI;AAAA,UACrC,CAAO;AAAA,QACP,CAAK;AAmCD,YAAI,UAAU,SAAS,SAAS,MAAM,UAAU;AAC9C,cAAI,UAAU,eAAe,UAAU,UAAU,OAAO,CAAC;AACzD,iBAAO,WAAW,MAAM,mBAAmBuI,aAAW,UAAU,OAAO;AAAA,QAC7E,CAAK;AAkCD,YAAI,eAAe,SAAS,SAAS,MAAM,UAAU;AACnD,cAAI,UAAU,eAAe,UAAU,UAAU,YAAY,CAAC;AAC9D,iBAAO,WAAW,MAAM,yBAAyBA,aAAW,UAAU,OAAO;AAAA,QACnF,CAAK;AAwBD,YAAI,QAAQ,SAAS,SAAS,MAAM,SAAS;AAC3C,iBAAO,WAAW,MAAM,iBAAiBA,aAAWA,aAAWA,aAAW,OAAO;AAAA,QACvF,CAAK;AA2BD,iBAAS,KAAK,MAAM,OAAO;AACzB,cAAI,OAAO,QAAQ,YAAY;AAC7B,kBAAM,IAAIY,WAAU,eAAe;AAAA,UACpC;AACD,kBAAQ,UAAUZ,cAAY,QAAQ,UAAU,KAAK;AACrD,iBAAO,SAAS,MAAM,KAAK;AAAA,QAC5B;AAoCD,iBAAS,OAAO,MAAM,OAAO;AAC3B,cAAI,OAAO,QAAQ,YAAY;AAC7B,kBAAM,IAAIY,WAAU,eAAe;AAAA,UACpC;AACD,kBAAQ,SAAS,OAAO,IAAI,UAAU,UAAU,KAAK,GAAG,CAAC;AACzD,iBAAO,SAAS,SAAS,MAAM;AAC7B,gBAAI,QAAQ,KAAK,KAAK,GAClB,YAAY,UAAU,MAAM,GAAG,KAAK;AAExC,gBAAI,OAAO;AACT,wBAAU,WAAW,KAAK;AAAA,YAC3B;AACD,mBAAO,MAAM,MAAM,MAAM,SAAS;AAAA,UAC1C,CAAO;AAAA,QACF;AA8CD,iBAAS,SAAS,MAAM,MAAM,SAAS;AACrC,cAAI,UAAU,MACV,WAAW;AAEf,cAAI,OAAO,QAAQ,YAAY;AAC7B,kBAAM,IAAIA,WAAU,eAAe;AAAA,UACpC;AACD,cAAI,SAAS,OAAO,GAAG;AACrB,sBAAU,aAAa,UAAU,CAAC,CAAC,QAAQ,UAAU;AACrD,uBAAW,cAAc,UAAU,CAAC,CAAC,QAAQ,WAAW;AAAA,UACzD;AACD,iBAAO,SAAS,MAAM,MAAM;AAAA,YAC1B,WAAW;AAAA,YACX,WAAW;AAAA,YACX,YAAY;AAAA,UACpB,CAAO;AAAA,QACF;AAiBD,iBAAS,MAAM,MAAM;AACnB,iBAAO,IAAI,MAAM,CAAC;AAAA,QACnB;AAwBD,iBAAS,KAAK,OAAO,SAAS;AAC5B,iBAAO,QAAQ,aAAa,OAAO,GAAG,KAAK;AAAA,QAC5C;AAqCD,iBAAS,YAAY;AACnB,cAAI,CAAC,UAAU,QAAQ;AACrB,mBAAO;UACR;AACD,cAAI,QAAQ,UAAU,CAAC;AACvB,iBAAO,QAAQ,KAAK,IAAI,QAAQ,CAAC,KAAK;AAAA,QACvC;AA4BD,iBAAS,MAAM,OAAO;AACpB,iBAAO,UAAU,OAAO,kBAAkB;AAAA,QAC3C;AAiCD,iBAAS,UAAU,OAAO,YAAY;AACpC,uBAAa,OAAO,cAAc,aAAa,aAAaZ;AAC5D,iBAAO,UAAU,OAAO,oBAAoB,UAAU;AAAA,QACvD;AAoBD,iBAAS,UAAU,OAAO;AACxB,iBAAO,UAAU,OAAO,kBAAkB,kBAAkB;AAAA,QAC7D;AA8BD,iBAAS,cAAc,OAAO,YAAY;AACxC,uBAAa,OAAO,cAAc,aAAa,aAAaA;AAC5D,iBAAO,UAAU,OAAO,kBAAkB,oBAAoB,UAAU;AAAA,QACzE;AA0BD,iBAAS,WAAW,QAAQ,QAAQ;AAClC,iBAAO,UAAU,QAAQ,eAAe,QAAQ,QAAQ,KAAK,MAAM,CAAC;AAAA,QACrE;AAkCD,iBAAS,GAAG,OAAO,OAAO;AACxB,iBAAO,UAAU,SAAU,UAAU,SAAS,UAAU;AAAA,QACzD;AAyBD,YAAI,KAAK,0BAA0B,MAAM;AAyBzC,YAAI,MAAM,0BAA0B,SAAS,OAAO,OAAO;AACzD,iBAAO,SAAS;AAAA,QACtB,CAAK;AAoBD,YAAI,cAAc,gBAAgB,WAAW;AAAE,iBAAO;AAAA,QAAU,GAAI,IAAI,kBAAkB,SAAS,OAAO;AACxG,iBAAO,aAAa,KAAK,KAAK,eAAe,KAAK,OAAO,QAAQ,KAC/D,CAAC,qBAAqB,KAAK,OAAO,QAAQ;AAAA,QAClD;AAyBI,YAAI,UAAUI,OAAM;AAmBpB,YAAI,gBAAgB,oBAAoB,UAAU,iBAAiB,IAAI;AA2BvE,iBAAS,YAAY,OAAO;AAC1B,iBAAO,SAAS,QAAQ,SAAS,MAAM,MAAM,KAAK,CAAC,WAAW,KAAK;AAAA,QACpE;AA2BD,iBAAS,kBAAkB,OAAO;AAChC,iBAAO,aAAa,KAAK,KAAK,YAAY,KAAK;AAAA,QAChD;AAmBD,iBAAS,UAAU,OAAO;AACxB,iBAAO,UAAU,QAAQ,UAAU,SAChC,aAAa,KAAK,KAAK,WAAW,KAAK,KAAK;AAAA,QAChD;AAmBD,YAAI,WAAW,kBAAkB;AAmBjC,YAAI,SAAS,aAAa,UAAU,UAAU,IAAI;AAmBlD,iBAAS,UAAU,OAAO;AACxB,iBAAO,aAAa,KAAK,KAAK,MAAM,aAAa,KAAK,CAAC,cAAc,KAAK;AAAA,QAC3E;AAmCD,iBAAS,QAAQ,OAAO;AACtB,cAAI,SAAS,MAAM;AACjB,mBAAO;AAAA,UACR;AACD,cAAI,YAAY,KAAK,MAChB,QAAQ,KAAK,KAAK,OAAO,SAAS,YAAY,OAAO,MAAM,UAAU,cACpE,SAAS,KAAK,KAAK,aAAa,KAAK,KAAK,YAAY,KAAK,IAAI;AACnE,mBAAO,CAAC,MAAM;AAAA,UACf;AACD,cAAI,MAAM,OAAO,KAAK;AACtB,cAAI,OAAO,UAAU,OAAO,QAAQ;AAClC,mBAAO,CAAC,MAAM;AAAA,UACf;AACD,cAAI,YAAY,KAAK,GAAG;AACtB,mBAAO,CAAC,SAAS,KAAK,EAAE;AAAA,UACzB;AACD,mBAAS,OAAO,OAAO;AACrB,gBAAI,eAAe,KAAK,OAAO,GAAG,GAAG;AACnC,qBAAO;AAAA,YACR;AAAA,UACF;AACD,iBAAO;AAAA,QACR;AA8BD,iBAAS,QAAQ,OAAO,OAAO;AAC7B,iBAAO,YAAY,OAAO,KAAK;AAAA,QAChC;AAkCD,iBAAS,YAAY,OAAO,OAAO,YAAY;AAC7C,uBAAa,OAAO,cAAc,aAAa,aAAaJ;AAC5D,cAAIqB,UAAS,aAAa,WAAW,OAAO,KAAK,IAAIrB;AACrD,iBAAOqB,YAAWrB,cAAY,YAAY,OAAO,OAAOA,aAAW,UAAU,IAAI,CAAC,CAACqB;AAAA,QACpF;AAoBD,iBAAS,QAAQ,OAAO;AACtB,cAAI,CAAC,aAAa,KAAK,GAAG;AACxB,mBAAO;AAAA,UACR;AACD,cAAI,MAAM,WAAW,KAAK;AAC1B,iBAAO,OAAO,YAAY,OAAO,aAC9B,OAAO,MAAM,WAAW,YAAY,OAAO,MAAM,QAAQ,YAAY,CAAC,cAAc,KAAK;AAAA,QAC7F;AA4BD,iBAASoB,UAAS,OAAO;AACvB,iBAAO,OAAO,SAAS,YAAY,eAAe,KAAK;AAAA,QACxD;AAmBD,iBAAS,WAAW,OAAO;AACzB,cAAI,CAAC,SAAS,KAAK,GAAG;AACpB,mBAAO;AAAA,UACR;AAGD,cAAI,MAAM,WAAW,KAAK;AAC1B,iBAAO,OAAO,WAAW,OAAO,UAAU,OAAO,YAAY,OAAO;AAAA,QACrE;AA4BD,iBAAS,UAAU,OAAO;AACxB,iBAAO,OAAO,SAAS,YAAY,SAAS,UAAU,KAAK;AAAA,QAC5D;AA4BD,iBAAS,SAAS,OAAO;AACvB,iBAAO,OAAO,SAAS,YACrB,QAAQ,MAAM,QAAQ,KAAK,KAAK,SAAS;AAAA,QAC5C;AA2BD,iBAAS,SAAS,OAAO;AACvB,cAAI,OAAO,OAAO;AAClB,iBAAO,SAAS,SAAS,QAAQ,YAAY,QAAQ;AAAA,QACtD;AA0BD,iBAAS,aAAa,OAAO;AAC3B,iBAAO,SAAS,QAAQ,OAAO,SAAS;AAAA,QACzC;AAmBD,YAAI,QAAQ,YAAY,UAAU,SAAS,IAAI;AA8B/C,iBAAS,QAAQ,QAAQ,QAAQ;AAC/B,iBAAO,WAAW,UAAU,YAAY,QAAQ,QAAQ,aAAa,MAAM,CAAC;AAAA,QAC7E;AAkCD,iBAAS,YAAY,QAAQ,QAAQ,YAAY;AAC/C,uBAAa,OAAO,cAAc,aAAa,aAAazC;AAC5D,iBAAO,YAAY,QAAQ,QAAQ,aAAa,MAAM,GAAG,UAAU;AAAA,QACpE;AA8BD,iBAAS0C,OAAM,OAAO;AAIpB,iBAAO,SAAS,KAAK,KAAK,SAAS,CAAC;AAAA,QACrC;AA4BD,iBAAS,SAAS,OAAO;AACvB,cAAI,WAAW,KAAK,GAAG;AACrB,kBAAM,IAAIpC,OAAM,eAAe;AAAA,UAChC;AACD,iBAAO,aAAa,KAAK;AAAA,QAC1B;AAmBD,iBAAS,OAAO,OAAO;AACrB,iBAAO,UAAU;AAAA,QAClB;AAsBD,iBAAS,MAAM,OAAO;AACpB,iBAAO,SAAS;AAAA,QACjB;AA4BD,iBAAS,SAAS,OAAO;AACvB,iBAAO,OAAO,SAAS,YACpB,aAAa,KAAK,KAAK,WAAW,KAAK,KAAK;AAAA,QAChD;AA8BD,iBAAS,cAAc,OAAO;AAC5B,cAAI,CAAC,aAAa,KAAK,KAAK,WAAW,KAAK,KAAK,WAAW;AAC1D,mBAAO;AAAA,UACR;AACD,cAAI,QAAQ,aAAa,KAAK;AAC9B,cAAI,UAAU,MAAM;AAClB,mBAAO;AAAA,UACR;AACD,cAAI,OAAO,eAAe,KAAK,OAAO,aAAa,KAAK,MAAM;AAC9D,iBAAO,OAAO,QAAQ,cAAc,gBAAgB,QAClD,aAAa,KAAK,IAAI,KAAK;AAAA,QAC9B;AAmBD,YAAI,WAAW,eAAe,UAAU,YAAY,IAAI;AA6BxD,iBAAS,cAAc,OAAO;AAC5B,iBAAO,UAAU,KAAK,KAAK,SAAS,CAAC,oBAAoB,SAAS;AAAA,QACnE;AAmBD,YAAI,QAAQ,YAAY,UAAU,SAAS,IAAI;AAmB/C,iBAAS,SAAS,OAAO;AACvB,iBAAO,OAAO,SAAS,YACpB,CAAC,QAAQ,KAAK,KAAK,aAAa,KAAK,KAAK,WAAW,KAAK,KAAK;AAAA,QACnE;AAmBD,iBAAS,SAAS,OAAO;AACvB,iBAAO,OAAO,SAAS,YACpB,aAAa,KAAK,KAAK,WAAW,KAAK,KAAK;AAAA,QAChD;AAmBD,YAAI,eAAe,mBAAmB,UAAU,gBAAgB,IAAI;AAmBpE,iBAAS,YAAY,OAAO;AAC1B,iBAAO,UAAUN;AAAAA,QAClB;AAmBD,iBAAS,UAAU,OAAO;AACxB,iBAAO,aAAa,KAAK,KAAK,OAAO,KAAK,KAAK;AAAA,QAChD;AAmBD,iBAAS,UAAU,OAAO;AACxB,iBAAO,aAAa,KAAK,KAAK,WAAW,KAAK,KAAK;AAAA,QACpD;AAyBD,YAAI,KAAK,0BAA0B,MAAM;AAyBzC,YAAI,MAAM,0BAA0B,SAAS,OAAO,OAAO;AACzD,iBAAO,SAAS;AAAA,QACtB,CAAK;AAyBD,iBAAS,QAAQ,OAAO;AACtB,cAAI,CAAC,OAAO;AACV,mBAAO;UACR;AACD,cAAI,YAAY,KAAK,GAAG;AACtB,mBAAO,SAAS,KAAK,IAAI,cAAc,KAAK,IAAI,UAAU,KAAK;AAAA,UAChE;AACD,cAAI,eAAe,MAAM,WAAW,GAAG;AACrC,mBAAO,gBAAgB,MAAM,WAAW,EAAG,CAAA;AAAA,UAC5C;AACD,cAAI,MAAM,OAAO,KAAK,GAClB,OAAO,OAAO,SAAS,aAAc,OAAO,SAAS,aAAa;AAEtE,iBAAO,KAAK,KAAK;AAAA,QAClB;AAyBD,iBAAS,SAAS,OAAO;AACvB,cAAI,CAAC,OAAO;AACV,mBAAO,UAAU,IAAI,QAAQ;AAAA,UAC9B;AACD,kBAAQ,SAAS,KAAK;AACtB,cAAI,UAAU,YAAY,UAAU,CAAC,UAAU;AAC7C,gBAAI,OAAQ,QAAQ,IAAI,KAAK;AAC7B,mBAAO,OAAO;AAAA,UACf;AACD,iBAAO,UAAU,QAAQ,QAAQ;AAAA,QAClC;AA4BD,iBAAS,UAAU,OAAO;AACxB,cAAIqB,UAAS,SAAS,KAAK,GACvB,YAAYA,UAAS;AAEzB,iBAAOA,YAAWA,UAAU,YAAYA,UAAS,YAAYA,UAAU;AAAA,QACxE;AA6BD,iBAAS,SAAS,OAAO;AACvB,iBAAO,QAAQ,UAAU,UAAU,KAAK,GAAG,GAAG,gBAAgB,IAAI;AAAA,QACnE;AAyBD,iBAAS,SAAS,OAAO;AACvB,cAAI,OAAO,SAAS,UAAU;AAC5B,mBAAO;AAAA,UACR;AACD,cAAI,SAAS,KAAK,GAAG;AACnB,mBAAO;AAAA,UACR;AACD,cAAI,SAAS,KAAK,GAAG;AACnB,gBAAI,QAAQ,OAAO,MAAM,WAAW,aAAa,MAAM,QAAS,IAAG;AACnE,oBAAQ,SAAS,KAAK,IAAK,QAAQ,KAAM;AAAA,UAC1C;AACD,cAAI,OAAO,SAAS,UAAU;AAC5B,mBAAO,UAAU,IAAI,QAAQ,CAAC;AAAA,UAC/B;AACD,kBAAQ,SAAS,KAAK;AACtB,cAAI,WAAW,WAAW,KAAK,KAAK;AACpC,iBAAQ,YAAY,UAAU,KAAK,KAAK,IACpC,aAAa,MAAM,MAAM,CAAC,GAAG,WAAW,IAAI,CAAC,IAC5C,WAAW,KAAK,KAAK,IAAI,MAAM,CAAC;AAAA,QACtC;AA0BD,iBAAS,cAAc,OAAO;AAC5B,iBAAO,WAAW,OAAO,OAAO,KAAK,CAAC;AAAA,QACvC;AA0BD,iBAAS,cAAc,OAAO;AAC5B,iBAAO,QACH,UAAU,UAAU,KAAK,GAAG,CAAC,kBAAkB,gBAAgB,IAC9D,UAAU,IAAI,QAAQ;AAAA,QAC5B;AAuBD,iBAAS,SAAS,OAAO;AACvB,iBAAO,SAAS,OAAO,KAAK,aAAa,KAAK;AAAA,QAC/C;AAoCD,YAAI,SAAS,eAAe,SAAS,QAAQ,QAAQ;AACnD,cAAI,YAAY,MAAM,KAAK,YAAY,MAAM,GAAG;AAC9C,uBAAW,QAAQ,KAAK,MAAM,GAAG,MAAM;AACvC;AAAA,UACD;AACD,mBAAS,OAAO,QAAQ;AACtB,gBAAI,eAAe,KAAK,QAAQ,GAAG,GAAG;AACpC,0BAAY,QAAQ,KAAK,OAAO,GAAG,CAAC;AAAA,YACrC;AAAA,UACF;AAAA,QACP,CAAK;AAiCD,YAAI,WAAW,eAAe,SAAS,QAAQ,QAAQ;AACrD,qBAAW,QAAQ,OAAO,MAAM,GAAG,MAAM;AAAA,QAC/C,CAAK;AA+BD,YAAI,eAAe,eAAe,SAAS,QAAQ,QAAQ,UAAU,YAAY;AAC/E,qBAAW,QAAQ,OAAO,MAAM,GAAG,QAAQ,UAAU;AAAA,QAC3D,CAAK;AA8BD,YAAI,aAAa,eAAe,SAAS,QAAQ,QAAQ,UAAU,YAAY;AAC7E,qBAAW,QAAQ,KAAK,MAAM,GAAG,QAAQ,UAAU;AAAA,QACzD,CAAK;AAmBD,YAAI,KAAK,SAAS,MAAM;AAoCxB,iBAAS,OAAO,WAAW,YAAY;AACrC,cAAIA,UAAS,WAAW,SAAS;AACjC,iBAAO,cAAc,OAAOA,UAAS,WAAWA,SAAQ,UAAU;AAAA,QACnE;AAuBD,YAAI,WAAW,SAAS,SAAS,QAAQ,SAAS;AAChD,mBAASZ,QAAO,MAAM;AAEtB,cAAIhJ,SAAQ;AACZ,cAAI,SAAS,QAAQ;AACrB,cAAI,QAAQ,SAAS,IAAI,QAAQ,CAAC,IAAIuI;AAEtC,cAAI,SAAS,eAAe,QAAQ,CAAC,GAAG,QAAQ,CAAC,GAAG,KAAK,GAAG;AAC1D,qBAAS;AAAA,UACV;AAED,iBAAO,EAAEvI,SAAQ,QAAQ;AACvB,gBAAI,SAAS,QAAQA,MAAK;AAC1B,gBAAI,QAAQ,OAAO,MAAM;AACzB,gBAAI,aAAa;AACjB,gBAAI,cAAc,MAAM;AAExB,mBAAO,EAAE,aAAa,aAAa;AACjC,kBAAI,MAAM,MAAM,UAAU;AAC1B,kBAAI,QAAQ,OAAO,GAAG;AAEtB,kBAAI,UAAUuI,eACT,GAAG,OAAO,YAAY,GAAG,CAAC,KAAK,CAAC,eAAe,KAAK,QAAQ,GAAG,GAAI;AACtE,uBAAO,GAAG,IAAI,OAAO,GAAG;AAAA,cACzB;AAAA,YACF;AAAA,UACF;AAED,iBAAO;AAAA,QACb,CAAK;AAqBD,YAAI,eAAe,SAAS,SAAS,MAAM;AACzC,eAAK,KAAKA,aAAW,mBAAmB;AACxC,iBAAO,MAAM,WAAWA,aAAW,IAAI;AAAA,QAC7C,CAAK;AAqCD,iBAAS,QAAQ,QAAQ,WAAW;AAClC,iBAAO,YAAY,QAAQ,YAAY,WAAW,CAAC,GAAG,UAAU;AAAA,QACjE;AAqCD,iBAAS,YAAY,QAAQ,WAAW;AACtC,iBAAO,YAAY,QAAQ,YAAY,WAAW,CAAC,GAAG,eAAe;AAAA,QACtE;AA8BD,iBAAS,MAAM,QAAQsB,WAAU;AAC/B,iBAAO,UAAU,OACb,SACA,QAAQ,QAAQ,YAAYA,WAAU,CAAC,GAAG,MAAM;AAAA,QACrD;AA4BD,iBAAS,WAAW,QAAQA,WAAU;AACpC,iBAAO,UAAU,OACb,SACA,aAAa,QAAQ,YAAYA,WAAU,CAAC,GAAG,MAAM;AAAA,QAC1D;AA8BD,iBAAS,OAAO,QAAQA,WAAU;AAChC,iBAAO,UAAU,WAAW,QAAQ,YAAYA,WAAU,CAAC,CAAC;AAAA,QAC7D;AA4BD,iBAAS,YAAY,QAAQA,WAAU;AACrC,iBAAO,UAAU,gBAAgB,QAAQ,YAAYA,WAAU,CAAC,CAAC;AAAA,QAClE;AAyBD,iBAAS,UAAU,QAAQ;AACzB,iBAAO,UAAU,OAAO,KAAK,cAAc,QAAQ,KAAK,MAAM,CAAC;AAAA,QAChE;AAyBD,iBAAS,YAAY,QAAQ;AAC3B,iBAAO,UAAU,OAAO,KAAK,cAAc,QAAQ,OAAO,MAAM,CAAC;AAAA,QAClE;AA2BD,iBAAS,IAAI,QAAQ,MAAM,cAAc;AACvC,cAAID,UAAS,UAAU,OAAOrB,cAAY,QAAQ,QAAQ,IAAI;AAC9D,iBAAOqB,YAAWrB,cAAY,eAAeqB;AAAA,QAC9C;AA6BD,iBAAS,IAAI,QAAQ,MAAM;AACzB,iBAAO,UAAU,QAAQ,QAAQ,QAAQ,MAAM,OAAO;AAAA,QACvD;AA4BD,iBAAS,MAAM,QAAQ,MAAM;AAC3B,iBAAO,UAAU,QAAQ,QAAQ,QAAQ,MAAM,SAAS;AAAA,QACzD;AAoBD,YAAI,SAAS,eAAe,SAASA,SAAQ,OAAO,KAAK;AACvD,cAAI,SAAS,QACT,OAAO,MAAM,YAAY,YAAY;AACvC,oBAAQ,qBAAqB,KAAK,KAAK;AAAA,UACxC;AAED,UAAAA,QAAO,KAAK,IAAI;AAAA,QACtB,GAAO,SAAS,QAAQ,CAAC;AA4BrB,YAAI,WAAW,eAAe,SAASA,SAAQ,OAAO,KAAK;AACzD,cAAI,SAAS,QACT,OAAO,MAAM,YAAY,YAAY;AACvC,oBAAQ,qBAAqB,KAAK,KAAK;AAAA,UACxC;AAED,cAAI,eAAe,KAAKA,SAAQ,KAAK,GAAG;AACtC,YAAAA,QAAO,KAAK,EAAE,KAAK,GAAG;AAAA,UAC9B,OAAa;AACL,YAAAA,QAAO,KAAK,IAAI,CAAC,GAAG;AAAA,UACrB;AAAA,QACF,GAAE,WAAW;AAoBd,YAAI,SAAS,SAAS,UAAU;AA8BhC,iBAAS,KAAK,QAAQ;AACpB,iBAAO,YAAY,MAAM,IAAI,cAAc,MAAM,IAAI,SAAS,MAAM;AAAA,QACrE;AAyBD,iBAAS,OAAO,QAAQ;AACtB,iBAAO,YAAY,MAAM,IAAI,cAAc,QAAQ,IAAI,IAAI,WAAW,MAAM;AAAA,QAC7E;AAuBD,iBAAS,QAAQ,QAAQC,WAAU;AACjC,cAAID,UAAS,CAAA;AACb,UAAAC,YAAW,YAAYA,WAAU,CAAC;AAElC,qBAAW,QAAQ,SAAS,OAAO,KAAKO,SAAQ;AAC9C,4BAAgBR,SAAQC,UAAS,OAAO,KAAKO,OAAM,GAAG,KAAK;AAAA,UACnE,CAAO;AACD,iBAAOR;AAAA,QACR;AA8BD,iBAAS,UAAU,QAAQC,WAAU;AACnC,cAAID,UAAS,CAAA;AACb,UAAAC,YAAW,YAAYA,WAAU,CAAC;AAElC,qBAAW,QAAQ,SAAS,OAAO,KAAKO,SAAQ;AAC9C,4BAAgBR,SAAQ,KAAKC,UAAS,OAAO,KAAKO,OAAM,CAAC;AAAA,UACjE,CAAO;AACD,iBAAOR;AAAA,QACR;AAiCD,YAAI,QAAQ,eAAe,SAAS,QAAQ,QAAQ,UAAU;AAC5D,oBAAU,QAAQ,QAAQ,QAAQ;AAAA,QACxC,CAAK;AAiCD,YAAI,YAAY,eAAe,SAAS,QAAQ,QAAQ,UAAU,YAAY;AAC5E,oBAAU,QAAQ,QAAQ,UAAU,UAAU;AAAA,QACpD,CAAK;AAsBD,YAAI,OAAO,SAAS,SAAS,QAAQ,OAAO;AAC1C,cAAIA,UAAS,CAAA;AACb,cAAI,UAAU,MAAM;AAClB,mBAAOA;AAAA,UACR;AACD,cAAI,SAAS;AACb,kBAAQ,SAAS,OAAO,SAAS,MAAM;AACrC,mBAAO,SAAS,MAAM,MAAM;AAC5B,uBAAW,SAAS,KAAK,SAAS;AAClC,mBAAO;AAAA,UACf,CAAO;AACD,qBAAW,QAAQ,aAAa,MAAM,GAAGA,OAAM;AAC/C,cAAI,QAAQ;AACV,YAAAA,UAAS,UAAUA,SAAQ,kBAAkB,kBAAkB,oBAAoB,eAAe;AAAA,UACnG;AACD,cAAI,SAAS,MAAM;AACnB,iBAAO,UAAU;AACf,sBAAUA,SAAQ,MAAM,MAAM,CAAC;AAAA,UAChC;AACD,iBAAOA;AAAA,QACb,CAAK;AAsBD,iBAAS,OAAO,QAAQ,WAAW;AACjC,iBAAO,OAAO,QAAQ,OAAO,YAAY,SAAS,CAAC,CAAC;AAAA,QACrD;AAmBD,YAAI,OAAO,SAAS,SAAS,QAAQ,OAAO;AAC1C,iBAAO,UAAU,OAAO,CAAA,IAAK,SAAS,QAAQ,KAAK;AAAA,QACzD,CAAK;AAoBD,iBAAS,OAAO,QAAQ,WAAW;AACjC,cAAI,UAAU,MAAM;AAClB,mBAAO;UACR;AACD,cAAI,QAAQ,SAAS,aAAa,MAAM,GAAG,SAAS,MAAM;AACxD,mBAAO,CAAC,IAAI;AAAA,UACpB,CAAO;AACD,sBAAY,YAAY,SAAS;AACjC,iBAAO,WAAW,QAAQ,OAAO,SAAS,OAAO,MAAM;AACrD,mBAAO,UAAU,OAAO,KAAK,CAAC,CAAC;AAAA,UACvC,CAAO;AAAA,QACF;AA+BD,iBAAS,OAAO,QAAQ,MAAM,cAAc;AAC1C,iBAAO,SAAS,MAAM,MAAM;AAE5B,cAAI5J,SAAQ,IACR,SAAS,KAAK;AAGlB,cAAI,CAAC,QAAQ;AACX,qBAAS;AACT,qBAASuI;AAAAA,UACV;AACD,iBAAO,EAAEvI,SAAQ,QAAQ;AACvB,gBAAI,QAAQ,UAAU,OAAOuI,cAAY,OAAO,MAAM,KAAKvI,MAAK,CAAC,CAAC;AAClE,gBAAI,UAAUuI,aAAW;AACvB,cAAAvI,SAAQ;AACR,sBAAQ;AAAA,YACT;AACD,qBAAS,WAAW,KAAK,IAAI,MAAM,KAAK,MAAM,IAAI;AAAA,UACnD;AACD,iBAAO;AAAA,QACR;AA8BD,iBAAS,IAAI,QAAQ,MAAM,OAAO;AAChC,iBAAO,UAAU,OAAO,SAAS,QAAQ,QAAQ,MAAM,KAAK;AAAA,QAC7D;AA0BD,iBAAS,QAAQ,QAAQ,MAAM,OAAO,YAAY;AAChD,uBAAa,OAAO,cAAc,aAAa,aAAauI;AAC5D,iBAAO,UAAU,OAAO,SAAS,QAAQ,QAAQ,MAAM,OAAO,UAAU;AAAA,QACzE;AA0BD,YAAI,UAAU,cAAc,IAAI;AA0BhC,YAAI,YAAY,cAAc,MAAM;AAgCpC,iBAAS,UAAU,QAAQsB,WAAU,aAAa;AAChD,cAAI,QAAQ,QAAQ,MAAM,GACtB,YAAY,SAAS,SAAS,MAAM,KAAK,aAAa,MAAM;AAEhE,UAAAA,YAAW,YAAYA,WAAU,CAAC;AAClC,cAAI,eAAe,MAAM;AACvB,gBAAI,OAAO,UAAU,OAAO;AAC5B,gBAAI,WAAW;AACb,4BAAc,QAAQ,IAAI,SAAO;YAClC,WACQ,SAAS,MAAM,GAAG;AACzB,4BAAc,WAAW,IAAI,IAAI,WAAW,aAAa,MAAM,CAAC,IAAI;YACrE,OACI;AACH,4BAAc,CAAA;AAAA,YACf;AAAA,UACF;AACD,WAAC,YAAY,YAAY,YAAY,QAAQ,SAAS,OAAO7J,QAAOoK,SAAQ;AAC1E,mBAAOP,UAAS,aAAa,OAAO7J,QAAOoK,OAAM;AAAA,UACzD,CAAO;AACD,iBAAO;AAAA,QACR;AA6BD,iBAAS,MAAM,QAAQ,MAAM;AAC3B,iBAAO,UAAU,OAAO,OAAO,UAAU,QAAQ,IAAI;AAAA,QACtD;AA6BD,iBAAS,OAAO,QAAQ,MAAM,SAAS;AACrC,iBAAO,UAAU,OAAO,SAAS,WAAW,QAAQ,MAAM,aAAa,OAAO,CAAC;AAAA,QAChF;AA0BD,iBAAS,WAAW,QAAQ,MAAM,SAAS,YAAY;AACrD,uBAAa,OAAO,cAAc,aAAa,aAAa7B;AAC5D,iBAAO,UAAU,OAAO,SAAS,WAAW,QAAQ,MAAM,aAAa,OAAO,GAAG,UAAU;AAAA,QAC5F;AA4BD,iBAAS,OAAO,QAAQ;AACtB,iBAAO,UAAU,OAAO,KAAK,WAAW,QAAQ,KAAK,MAAM,CAAC;AAAA,QAC7D;AA0BD,iBAAS,SAAS,QAAQ;AACxB,iBAAO,UAAU,OAAO,KAAK,WAAW,QAAQ,OAAO,MAAM,CAAC;AAAA,QAC/D;AAuBD,iBAAS,MAAMlF,SAAQ,OAAO,OAAO;AACnC,cAAI,UAAUkF,aAAW;AACvB,oBAAQ;AACR,oBAAQA;AAAAA,UACT;AACD,cAAI,UAAUA,aAAW;AACvB,oBAAQ,SAAS,KAAK;AACtB,oBAAQ,UAAU,QAAQ,QAAQ;AAAA,UACnC;AACD,cAAI,UAAUA,aAAW;AACvB,oBAAQ,SAAS,KAAK;AACtB,oBAAQ,UAAU,QAAQ,QAAQ;AAAA,UACnC;AACD,iBAAO,UAAU,SAASlF,OAAM,GAAG,OAAO,KAAK;AAAA,QAChD;AAwCD,iBAAS,QAAQA,SAAQ,OAAO,KAAK;AACnC,kBAAQ,SAAS,KAAK;AACtB,cAAI,QAAQkF,aAAW;AACrB,kBAAM;AACN,oBAAQ;AAAA,UAChB,OAAa;AACL,kBAAM,SAAS,GAAG;AAAA,UACnB;AACD,UAAAlF,UAAS,SAASA,OAAM;AACxB,iBAAO,YAAYA,SAAQ,OAAO,GAAG;AAAA,QACtC;AAiCD,iBAAS,OAAO,OAAO,OAAO,UAAU;AACtC,cAAI,YAAY,OAAO,YAAY,aAAa,eAAe,OAAO,OAAO,QAAQ,GAAG;AACtF,oBAAQ,WAAWkF;AAAAA,UACpB;AACD,cAAI,aAAaA,aAAW;AAC1B,gBAAI,OAAO,SAAS,WAAW;AAC7B,yBAAW;AACX,sBAAQA;AAAAA,YACT,WACQ,OAAO,SAAS,WAAW;AAClC,yBAAW;AACX,sBAAQA;AAAAA,YACT;AAAA,UACF;AACD,cAAI,UAAUA,eAAa,UAAUA,aAAW;AAC9C,oBAAQ;AACR,oBAAQ;AAAA,UACT,OACI;AACH,oBAAQ,SAAS,KAAK;AACtB,gBAAI,UAAUA,aAAW;AACvB,sBAAQ;AACR,sBAAQ;AAAA,YAClB,OAAe;AACL,sBAAQ,SAAS,KAAK;AAAA,YACvB;AAAA,UACF;AACD,cAAI,QAAQ,OAAO;AACjB,gBAAI,OAAO;AACX,oBAAQ;AACR,oBAAQ;AAAA,UACT;AACD,cAAI,YAAY,QAAQ,KAAK,QAAQ,GAAG;AACtC,gBAAI,OAAO;AACX,mBAAO,UAAU,QAAS,QAAQ,QAAQ,QAAQ,eAAe,UAAU,OAAO,IAAI,SAAS,EAAE,IAAK,KAAK;AAAA,UAC5G;AACD,iBAAO,WAAW,OAAO,KAAK;AAAA,QAC/B;AAwBD,YAAI,YAAY,iBAAiB,SAASqB,SAAQ,MAAM5J,QAAO;AAC7D,iBAAO,KAAK;AACZ,iBAAO4J,WAAU5J,SAAQ,WAAW,IAAI,IAAI;AAAA,QAClD,CAAK;AAiBD,iBAAS,WAAWmC,SAAQ;AAC1B,iBAAO,WAAW,SAASA,OAAM,EAAE,YAAa,CAAA;AAAA,QACjD;AAoBD,iBAAS,OAAOA,SAAQ;AACtB,UAAAA,UAAS,SAASA,OAAM;AACxB,iBAAOA,WAAUA,QAAO,QAAQ,SAAS,YAAY,EAAE,QAAQ,aAAa,EAAE;AAAA,QAC/E;AAyBD,iBAAS,SAASA,SAAQ,QAAQ,UAAU;AAC1C,UAAAA,UAAS,SAASA,OAAM;AACxB,mBAAS,aAAa,MAAM;AAE5B,cAAI,SAASA,QAAO;AACpB,qBAAW,aAAaoG,cACpB,SACA,UAAU,UAAU,QAAQ,GAAG,GAAG,MAAM;AAE5C,cAAI,MAAM;AACV,sBAAY,OAAO;AACnB,iBAAO,YAAY,KAAKpG,QAAO,MAAM,UAAU,GAAG,KAAK;AAAA,QACxD;AA8BD,iBAAS,OAAOA,SAAQ;AACtB,UAAAA,UAAS,SAASA,OAAM;AACxB,iBAAQA,WAAU,mBAAmB,KAAKA,OAAM,IAC5CA,QAAO,QAAQ,iBAAiB,cAAc,IAC9CA;AAAA,QACL;AAiBD,iBAAS,aAAaA,SAAQ;AAC5B,UAAAA,UAAS,SAASA,OAAM;AACxB,iBAAQA,WAAU,gBAAgB,KAAKA,OAAM,IACzCA,QAAO,QAAQ,cAAc,MAAM,IACnCA;AAAA,QACL;AAuBD,YAAI,YAAY,iBAAiB,SAASyH,SAAQ,MAAM5J,QAAO;AAC7D,iBAAO4J,WAAU5J,SAAQ,MAAM,MAAM,KAAK;QAChD,CAAK;AAsBD,YAAI,YAAY,iBAAiB,SAAS4J,SAAQ,MAAM5J,QAAO;AAC7D,iBAAO4J,WAAU5J,SAAQ,MAAM,MAAM,KAAK;QAChD,CAAK;AAmBD,YAAI,aAAa,gBAAgB,aAAa;AAyB9C,iBAAS,IAAImC,SAAQ,QAAQ,OAAO;AAClC,UAAAA,UAAS,SAASA,OAAM;AACxB,mBAAS,UAAU,MAAM;AAEzB,cAAI,YAAY,SAAS,WAAWA,OAAM,IAAI;AAC9C,cAAI,CAAC,UAAU,aAAa,QAAQ;AAClC,mBAAOA;AAAA,UACR;AACD,cAAI,OAAO,SAAS,aAAa;AACjC,iBACE,cAAc,YAAY,GAAG,GAAG,KAAK,IACrCA,UACA,cAAc,WAAW,GAAG,GAAG,KAAK;AAAA,QAEvC;AAyBD,iBAAS,OAAOA,SAAQ,QAAQ,OAAO;AACrC,UAAAA,UAAS,SAASA,OAAM;AACxB,mBAAS,UAAU,MAAM;AAEzB,cAAI,YAAY,SAAS,WAAWA,OAAM,IAAI;AAC9C,iBAAQ,UAAU,YAAY,SACzBA,UAAS,cAAc,SAAS,WAAW,KAAK,IACjDA;AAAA,QACL;AAyBD,iBAAS,SAASA,SAAQ,QAAQ,OAAO;AACvC,UAAAA,UAAS,SAASA,OAAM;AACxB,mBAAS,UAAU,MAAM;AAEzB,cAAI,YAAY,SAAS,WAAWA,OAAM,IAAI;AAC9C,iBAAQ,UAAU,YAAY,SACzB,cAAc,SAAS,WAAW,KAAK,IAAIA,UAC5CA;AAAA,QACL;AA0BD,iBAAS+I,UAAS/I,SAAQ,OAAO,OAAO;AACtC,cAAI,SAAS,SAAS,MAAM;AAC1B,oBAAQ;AAAA,UACT,WAAU,OAAO;AAChB,oBAAQ,CAAC;AAAA,UACV;AACD,iBAAO,eAAe,SAASA,OAAM,EAAE,QAAQ,aAAa,EAAE,GAAG,SAAS,CAAC;AAAA,QAC5E;AAwBD,iBAAS,OAAOA,SAAQjC,IAAG,OAAO;AAChC,cAAK,QAAQ,eAAeiC,SAAQjC,IAAG,KAAK,IAAIA,OAAMqI,aAAY;AAChE,YAAArI,KAAI;AAAA,UACZ,OAAa;AACL,YAAAA,KAAI,UAAUA,EAAC;AAAA,UAChB;AACD,iBAAO,WAAW,SAASiC,OAAM,GAAGjC,EAAC;AAAA,QACtC;AAqBD,iBAAS,UAAU;AACjB,cAAI,OAAO,WACPiC,UAAS,SAAS,KAAK,CAAC,CAAC;AAE7B,iBAAO,KAAK,SAAS,IAAIA,UAASA,QAAO,QAAQ,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AAAA,QAClE;AAuBD,YAAI,YAAY,iBAAiB,SAASyH,SAAQ,MAAM5J,QAAO;AAC7D,iBAAO4J,WAAU5J,SAAQ,MAAM,MAAM,KAAK;QAChD,CAAK;AAqBD,iBAAS,MAAMmC,SAAQ,WAAW,OAAO;AACvC,cAAI,SAAS,OAAO,SAAS,YAAY,eAAeA,SAAQ,WAAW,KAAK,GAAG;AACjF,wBAAY,QAAQoG;AAAAA,UACrB;AACD,kBAAQ,UAAUA,cAAY,mBAAmB,UAAU;AAC3D,cAAI,CAAC,OAAO;AACV,mBAAO;UACR;AACD,UAAApG,UAAS,SAASA,OAAM;AACxB,cAAIA,YACE,OAAO,aAAa,YACnB,aAAa,QAAQ,CAAC,SAAS,SAAS,IACxC;AACL,wBAAY,aAAa,SAAS;AAClC,gBAAI,CAAC,aAAa,WAAWA,OAAM,GAAG;AACpC,qBAAO,UAAU,cAAcA,OAAM,GAAG,GAAG,KAAK;AAAA,YACjD;AAAA,UACF;AACD,iBAAOA,QAAO,MAAM,WAAW,KAAK;AAAA,QACrC;AAuBD,YAAI,YAAY,iBAAiB,SAASyH,SAAQ,MAAM5J,QAAO;AAC7D,iBAAO4J,WAAU5J,SAAQ,MAAM,MAAM,WAAW,IAAI;AAAA,QAC1D,CAAK;AAyBD,iBAAS,WAAWmC,SAAQ,QAAQ,UAAU;AAC5C,UAAAA,UAAS,SAASA,OAAM;AACxB,qBAAW,YAAY,OACnB,IACA,UAAU,UAAU,QAAQ,GAAG,GAAGA,QAAO,MAAM;AAEnD,mBAAS,aAAa,MAAM;AAC5B,iBAAOA,QAAO,MAAM,UAAU,WAAW,OAAO,MAAM,KAAK;AAAA,QAC5D;AA0GD,iBAAS,SAASA,SAAQ,SAAS,OAAO;AAIxC,cAAI,WAAWwH,QAAO;AAEtB,cAAI,SAAS,eAAexH,SAAQ,SAAS,KAAK,GAAG;AACnD,sBAAUoG;AAAAA,UACX;AACD,UAAApG,UAAS,SAASA,OAAM;AACxB,oBAAU,aAAa,CAAE,GAAE,SAAS,UAAU,sBAAsB;AAEpE,cAAI,UAAU,aAAa,IAAI,QAAQ,SAAS,SAAS,SAAS,sBAAsB,GACpF,cAAc,KAAK,OAAO,GAC1B,gBAAgB,WAAW,SAAS,WAAW;AAEnD,cAAI,YACA,cACAnC,SAAQ,GACR,cAAc,QAAQ,eAAe,WACrC,SAAS;AAGb,cAAI,eAAeiJ;AAAA,aAChB,QAAQ,UAAU,WAAW,SAAS,MACvC,YAAY,SAAS,OACpB,gBAAgB,gBAAgB,eAAe,WAAW,SAAS,OACnE,QAAQ,YAAY,WAAW,SAAS;AAAA,YACzC;AAAA,UAAG;AAML,cAAI,YAAY,oBACb,eAAe,KAAK,SAAS,WAAW,KACpC,QAAQ,YAAY,IAAI,QAAQ,OAAO,GAAG,IAC1C,4BAA6B,EAAE,kBAAmB,OACnD;AAEN,UAAA9G,QAAO,QAAQ,cAAc,SAAS,OAAO,aAAa,kBAAkB,iBAAiB,eAAe,QAAQ;AAClH,iCAAqB,mBAAmB;AAGxC,sBAAUA,QAAO,MAAMnC,QAAO,MAAM,EAAE,QAAQ,mBAAmB,gBAAgB;AAGjF,gBAAI,aAAa;AACf,2BAAa;AACb,wBAAU,cAAc,cAAc;AAAA,YACvC;AACD,gBAAI,eAAe;AACjB,6BAAe;AACf,wBAAU,SAAS,gBAAgB;AAAA,YACpC;AACD,gBAAI,kBAAkB;AACpB,wBAAU,mBAAmB,mBAAmB;AAAA,YACjD;AACD,YAAAA,SAAQ,SAAS,MAAM;AAIvB,mBAAO;AAAA,UACf,CAAO;AAED,oBAAU;AAIV,cAAI,WAAW,eAAe,KAAK,SAAS,UAAU,KAAK,QAAQ;AACnE,cAAI,CAAC,UAAU;AACb,qBAAS,mBAAmB,SAAS;AAAA,UACtC,WAGQ,2BAA2B,KAAK,QAAQ,GAAG;AAClD,kBAAM,IAAI6I,OAAM,4BAA4B;AAAA,UAC7C;AAGD,oBAAU,eAAe,OAAO,QAAQ,sBAAsB,EAAE,IAAI,QACjE,QAAQ,qBAAqB,IAAI,EACjC,QAAQ,uBAAuB,KAAK;AAGvC,mBAAS,eAAe,YAAY,SAAS,WAC1C,WACG,KACA,0BAEJ,uBACC,aACI,qBACA,OAEJ,eACG,yFAEA,SAEJ,SACA;AAEF,cAAIe,UAAS,QAAQ,WAAW;AAC9B,mBAAOd,UAAS,aAAa,YAAY,YAAY,MAAM,EACxD,MAAMP,aAAW,aAAa;AAAA,UACzC,CAAO;AAID,UAAAqB,QAAO,SAAS;AAChB,cAAI,QAAQA,OAAM,GAAG;AACnB,kBAAMA;AAAA,UACP;AACD,iBAAOA;AAAA,QACR;AAuBD,iBAAS,QAAQ,OAAO;AACtB,iBAAO,SAAS,KAAK,EAAE;QACxB;AAuBD,iBAAS,QAAQ,OAAO;AACtB,iBAAO,SAAS,KAAK,EAAE;QACxB;AAwBD,iBAAS,KAAKzH,SAAQ,OAAO,OAAO;AAClC,UAAAA,UAAS,SAASA,OAAM;AACxB,cAAIA,YAAW,SAAS,UAAUoG,cAAY;AAC5C,mBAAO,SAASpG,OAAM;AAAA,UACvB;AACD,cAAI,CAACA,WAAU,EAAE,QAAQ,aAAa,KAAK,IAAI;AAC7C,mBAAOA;AAAA,UACR;AACD,cAAI,aAAa,cAAcA,OAAM,GACjC,aAAa,cAAc,KAAK,GAChC,QAAQ,gBAAgB,YAAY,UAAU,GAC9C,MAAM,cAAc,YAAY,UAAU,IAAI;AAElD,iBAAO,UAAU,YAAY,OAAO,GAAG,EAAE,KAAK,EAAE;AAAA,QACjD;AAqBD,iBAAS,QAAQA,SAAQ,OAAO,OAAO;AACrC,UAAAA,UAAS,SAASA,OAAM;AACxB,cAAIA,YAAW,SAAS,UAAUoG,cAAY;AAC5C,mBAAOpG,QAAO,MAAM,GAAG,gBAAgBA,OAAM,IAAI,CAAC;AAAA,UACnD;AACD,cAAI,CAACA,WAAU,EAAE,QAAQ,aAAa,KAAK,IAAI;AAC7C,mBAAOA;AAAA,UACR;AACD,cAAI,aAAa,cAAcA,OAAM,GACjC,MAAM,cAAc,YAAY,cAAc,KAAK,CAAC,IAAI;AAE5D,iBAAO,UAAU,YAAY,GAAG,GAAG,EAAE,KAAK,EAAE;AAAA,QAC7C;AAqBD,iBAAS,UAAUA,SAAQ,OAAO,OAAO;AACvC,UAAAA,UAAS,SAASA,OAAM;AACxB,cAAIA,YAAW,SAAS,UAAUoG,cAAY;AAC5C,mBAAOpG,QAAO,QAAQ,aAAa,EAAE;AAAA,UACtC;AACD,cAAI,CAACA,WAAU,EAAE,QAAQ,aAAa,KAAK,IAAI;AAC7C,mBAAOA;AAAA,UACR;AACD,cAAI,aAAa,cAAcA,OAAM,GACjC,QAAQ,gBAAgB,YAAY,cAAc,KAAK,CAAC;AAE5D,iBAAO,UAAU,YAAY,KAAK,EAAE,KAAK,EAAE;AAAA,QAC5C;AAuCD,iBAAS,SAASA,SAAQ,SAAS;AACjC,cAAI,SAAS,sBACT,WAAW;AAEf,cAAI,SAAS,OAAO,GAAG;AACrB,gBAAI,YAAY,eAAe,UAAU,QAAQ,YAAY;AAC7D,qBAAS,YAAY,UAAU,UAAU,QAAQ,MAAM,IAAI;AAC3D,uBAAW,cAAc,UAAU,aAAa,QAAQ,QAAQ,IAAI;AAAA,UACrE;AACD,UAAAA,UAAS,SAASA,OAAM;AAExB,cAAI,YAAYA,QAAO;AACvB,cAAI,WAAWA,OAAM,GAAG;AACtB,gBAAI,aAAa,cAAcA,OAAM;AACrC,wBAAY,WAAW;AAAA,UACxB;AACD,cAAI,UAAU,WAAW;AACvB,mBAAOA;AAAA,UACR;AACD,cAAI,MAAM,SAAS,WAAW,QAAQ;AACtC,cAAI,MAAM,GAAG;AACX,mBAAO;AAAA,UACR;AACD,cAAIyH,UAAS,aACT,UAAU,YAAY,GAAG,GAAG,EAAE,KAAK,EAAE,IACrCzH,QAAO,MAAM,GAAG,GAAG;AAEvB,cAAI,cAAcoG,aAAW;AAC3B,mBAAOqB,UAAS;AAAA,UACjB;AACD,cAAI,YAAY;AACd,mBAAQA,QAAO,SAAS;AAAA,UACzB;AACD,cAAI,SAAS,SAAS,GAAG;AACvB,gBAAIzH,QAAO,MAAM,GAAG,EAAE,OAAO,SAAS,GAAG;AACvC,kBAAI,OACA,YAAYyH;AAEhB,kBAAI,CAAC,UAAU,QAAQ;AACrB,4BAAYX,QAAO,UAAU,QAAQ,SAAS,QAAQ,KAAK,SAAS,CAAC,IAAI,GAAG;AAAA,cAC7E;AACD,wBAAU,YAAY;AACtB,qBAAQ,QAAQ,UAAU,KAAK,SAAS,GAAI;AAC1C,oBAAI,SAAS,MAAM;AAAA,cACpB;AACD,cAAAW,UAASA,QAAO,MAAM,GAAG,WAAWrB,cAAY,MAAM,MAAM;AAAA,YAC7D;AAAA,UACT,WAAiBpG,QAAO,QAAQ,aAAa,SAAS,GAAG,GAAG,KAAK,KAAK;AAC9D,gBAAInC,SAAQ4J,QAAO,YAAY,SAAS;AACxC,gBAAI5J,SAAQ,IAAI;AACd,cAAA4J,UAASA,QAAO,MAAM,GAAG5J,MAAK;AAAA,YAC/B;AAAA,UACF;AACD,iBAAO4J,UAAS;AAAA,QACjB;AAqBD,iBAAS,SAASzH,SAAQ;AACxB,UAAAA,UAAS,SAASA,OAAM;AACxB,iBAAQA,WAAU,iBAAiB,KAAKA,OAAM,IAC1CA,QAAO,QAAQ,eAAe,gBAAgB,IAC9CA;AAAA,QACL;AAsBD,YAAI,YAAY,iBAAiB,SAASyH,SAAQ,MAAM5J,QAAO;AAC7D,iBAAO4J,WAAU5J,SAAQ,MAAM,MAAM,KAAK;QAChD,CAAK;AAmBD,YAAI,aAAa,gBAAgB,aAAa;AAqB9C,iBAAS,MAAMmC,SAAQ,SAAS,OAAO;AACrC,UAAAA,UAAS,SAASA,OAAM;AACxB,oBAAU,QAAQoG,cAAY;AAE9B,cAAI,YAAYA,aAAW;AACzB,mBAAO,eAAepG,OAAM,IAAI,aAAaA,OAAM,IAAI,WAAWA,OAAM;AAAA,UACzE;AACD,iBAAOA,QAAO,MAAM,OAAO,KAAK,CAAA;AAAA,QACjC;AA0BD,YAAI,UAAU,SAAS,SAAS,MAAM,MAAM;AAC1C,cAAI;AACF,mBAAO,MAAM,MAAMoG,aAAW,IAAI;AAAA,UACnC,SAAQ3I,IAAG;AACV,mBAAO,QAAQA,EAAC,IAAIA,KAAI,IAAIiJ,OAAMjJ,EAAC;AAAA,UACpC;AAAA,QACP,CAAK;AA4BD,YAAI,UAAU,SAAS,SAAS,QAAQ,aAAa;AACnD,oBAAU,aAAa,SAAS,KAAK;AACnC,kBAAM,MAAM,GAAG;AACf,4BAAgB,QAAQ,KAAK,KAAK,OAAO,GAAG,GAAG,MAAM,CAAC;AAAA,UAC9D,CAAO;AACD,iBAAO;AAAA,QACb,CAAK;AA+BD,iBAAS,KAAK,OAAO;AACnB,cAAI,SAAS,SAAS,OAAO,IAAI,MAAM,QACnC,aAAa,YAAW;AAE5B,kBAAQ,CAAC,SAAS,CAAA,IAAK,SAAS,OAAO,SAASiC,OAAM;AACpD,gBAAI,OAAOA,MAAK,CAAC,KAAK,YAAY;AAChC,oBAAM,IAAIsH,WAAU,eAAe;AAAA,YACpC;AACD,mBAAO,CAAC,WAAWtH,MAAK,CAAC,CAAC,GAAGA,MAAK,CAAC,CAAC;AAAA,UAC5C,CAAO;AAED,iBAAO,SAAS,SAAS,MAAM;AAC7B,gBAAI7B,SAAQ;AACZ,mBAAO,EAAEA,SAAQ,QAAQ;AACvB,kBAAI6B,QAAO,MAAM7B,MAAK;AACtB,kBAAI,MAAM6B,MAAK,CAAC,GAAG,MAAM,IAAI,GAAG;AAC9B,uBAAO,MAAMA,MAAK,CAAC,GAAG,MAAM,IAAI;AAAA,cACjC;AAAA,YACF;AAAA,UACT,CAAO;AAAA,QACF;AA0BD,iBAAS,SAAS,QAAQ;AACxB,iBAAO,aAAa,UAAU,QAAQ,eAAe,CAAC;AAAA,QACvD;AAqBD,iBAAS,SAAS,OAAO;AACvB,iBAAO,WAAW;AAChB,mBAAO;AAAA,UACf;AAAA,QACK;AAsBD,iBAAS,UAAU,OAAO,cAAc;AACtC,iBAAQ,SAAS,QAAQ,UAAU,QAAS,eAAe;AAAA,QAC5D;AAwBD,YAAI,OAAO;AAuBX,YAAI,YAAY,WAAW,IAAI;AAkB/B,iBAAS,SAAS,OAAO;AACvB,iBAAO;AAAA,QACR;AA4CD,iBAAS,SAAS,MAAM;AACtB,iBAAO,aAAa,OAAO,QAAQ,aAAa,OAAO,UAAU,MAAM,eAAe,CAAC;AAAA,QACxF;AAqCD,iBAAS,QAAQ,QAAQ;AACvB,iBAAO,YAAY,UAAU,QAAQ,eAAe,CAAC;AAAA,QACtD;AAmCD,iBAAS,gBAAgB,MAAM,UAAU;AACvC,iBAAO,oBAAoB,MAAM,UAAU,UAAU,eAAe,CAAC;AAAA,QACtE;AA0BD,YAAI,SAAS,SAAS,SAAS,MAAM,MAAM;AACzC,iBAAO,SAAS,QAAQ;AACtB,mBAAO,WAAW,QAAQ,MAAM,IAAI;AAAA,UAC5C;AAAA,QACA,CAAK;AAyBD,YAAI,WAAW,SAAS,SAAS,QAAQ,MAAM;AAC7C,iBAAO,SAAS,MAAM;AACpB,mBAAO,WAAW,QAAQ,MAAM,IAAI;AAAA,UAC5C;AAAA,QACA,CAAK;AAsCD,iBAAS,MAAM,QAAQ,QAAQ,SAAS;AACtC,cAAI,QAAQ,KAAK,MAAM,GACnB,cAAc,cAAc,QAAQ,KAAK;AAE7C,cAAI,WAAW,QACX,EAAE,SAAS,MAAM,MAAM,YAAY,UAAU,CAAC,MAAM,UAAU;AAChE,sBAAU;AACV,qBAAS;AACT,qBAAS;AACT,0BAAc,cAAc,QAAQ,KAAK,MAAM,CAAC;AAAA,UACjD;AACD,cAAIsJ,SAAQ,EAAE,SAAS,OAAO,KAAK,WAAW,YAAY,CAAC,CAAC,QAAQ,OAChE,SAAS,WAAW,MAAM;AAE9B,oBAAU,aAAa,SAAS,YAAY;AAC1C,gBAAI,OAAO,OAAO,UAAU;AAC5B,mBAAO,UAAU,IAAI;AACrB,gBAAI,QAAQ;AACV,qBAAO,UAAU,UAAU,IAAI,WAAW;AACxC,oBAAI,WAAW,KAAK;AACpB,oBAAIA,UAAS,UAAU;AACrB,sBAAIvB,UAAS,OAAO,KAAK,WAAW,GAChC,UAAUA,QAAO,cAAc,UAAU,KAAK,WAAW;AAE7D,0BAAQ,KAAK,EAAE,QAAQ,MAAM,QAAQ,WAAW,WAAW,OAAM,CAAE;AACnE,kBAAAA,QAAO,YAAY;AACnB,yBAAOA;AAAA,gBACR;AACD,uBAAO,KAAK,MAAM,QAAQ,UAAU,CAAC,KAAK,MAAO,CAAA,GAAG,SAAS,CAAC;AAAA,cAC1E;AAAA,YACS;AAAA,UACT,CAAO;AAED,iBAAO;AAAA,QACR;AAeD,iBAAS,aAAa;AACpB,cAAI,KAAK,MAAM,MAAM;AACnB,iBAAK,IAAI;AAAA,UACV;AACD,iBAAO;AAAA,QACR;AAcD,iBAAS,OAAO;AAAA,QAEf;AAsBD,iBAAS,OAAO1J,IAAG;AACjB,UAAAA,KAAI,UAAUA,EAAC;AACf,iBAAO,SAAS,SAAS,MAAM;AAC7B,mBAAO,QAAQ,MAAMA,EAAC;AAAA,UAC9B,CAAO;AAAA,QACF;AAoBD,YAAI,OAAO,WAAW,QAAQ;AA8B9B,YAAI,YAAY,WAAW,UAAU;AAiCrC,YAAI,WAAW,WAAW,SAAS;AAwBnC,iBAAS,SAAS,MAAM;AACtB,iBAAO,MAAM,IAAI,IAAI,aAAa,MAAM,IAAI,CAAC,IAAI,iBAAiB,IAAI;AAAA,QACvE;AAuBD,iBAAS,WAAW,QAAQ;AAC1B,iBAAO,SAAS,MAAM;AACpB,mBAAO,UAAU,OAAOqI,cAAY,QAAQ,QAAQ,IAAI;AAAA,UAChE;AAAA,QACK;AA2CD,YAAI,QAAQ;AAsCZ,YAAI,aAAa,YAAY,IAAI;AAoBjC,iBAAS,YAAY;AACnB,iBAAO;QACR;AAeD,iBAAS,YAAY;AACnB,iBAAO;AAAA,QACR;AAoBD,iBAAS,aAAa;AACpB,iBAAO;QACR;AAeD,iBAAS,aAAa;AACpB,iBAAO;AAAA,QACR;AAeD,iBAAS,WAAW;AAClB,iBAAO;AAAA,QACR;AAqBD,iBAAS,MAAMrI,IAAG2J,WAAU;AAC1B,UAAA3J,KAAI,UAAUA,EAAC;AACf,cAAIA,KAAI,KAAKA,KAAI,kBAAkB;AACjC,mBAAO;UACR;AACD,cAAIF,SAAQ,kBACR,SAAS,UAAUE,IAAG,gBAAgB;AAE1C,UAAA2J,YAAW,YAAYA,SAAQ;AAC/B,UAAA3J,MAAK;AAEL,cAAI0J,UAAS,UAAU,QAAQC,SAAQ;AACvC,iBAAO,EAAE7J,SAAQE,IAAG;AAClB,YAAA2J,UAAS7J,MAAK;AAAA,UACf;AACD,iBAAO4J;AAAA,QACR;AAmBD,iBAAS,OAAO,OAAO;AACrB,cAAI,QAAQ,KAAK,GAAG;AAClB,mBAAO,SAAS,OAAO,KAAK;AAAA,UAC7B;AACD,iBAAO,SAAS,KAAK,IAAI,CAAC,KAAK,IAAI,UAAU,aAAa,SAAS,KAAK,CAAC,CAAC;AAAA,QAC3E;AAmBD,iBAAS,SAAS,QAAQ;AACxB,cAAI,KAAK,EAAE;AACX,iBAAO,SAAS,MAAM,IAAI;AAAA,QAC3B;AAmBD,YAAI,MAAM,oBAAoB,SAAS,QAAQ,QAAQ;AACrD,iBAAO,SAAS;AAAA,QACjB,GAAE,CAAC;AAuBJ,YAAI,OAAO,YAAY,MAAM;AAiB7B,YAAI,SAAS,oBAAoB,SAAS,UAAU,SAAS;AAC3D,iBAAO,WAAW;AAAA,QACnB,GAAE,CAAC;AAuBJ,YAAI,QAAQ,YAAY,OAAO;AAoB/B,iBAAS,IAAI,OAAO;AAClB,iBAAQ,SAAS,MAAM,SACnB,aAAa,OAAO,UAAU,MAAM,IACpCrB;AAAAA,QACL;AAyBD,iBAAS,MAAM,OAAOsB,WAAU;AAC9B,iBAAQ,SAAS,MAAM,SACnB,aAAa,OAAO,YAAYA,WAAU,CAAC,GAAG,MAAM,IACpDtB;AAAAA,QACL;AAgBD,iBAAS,KAAK,OAAO;AACnB,iBAAO,SAAS,OAAO,QAAQ;AAAA,QAChC;AAyBD,iBAAS,OAAO,OAAOsB,WAAU;AAC/B,iBAAO,SAAS,OAAO,YAAYA,WAAU,CAAC,CAAC;AAAA,QAChD;AAoBD,iBAAS,IAAI,OAAO;AAClB,iBAAQ,SAAS,MAAM,SACnB,aAAa,OAAO,UAAU,MAAM,IACpCtB;AAAAA,QACL;AAyBD,iBAAS,MAAM,OAAOsB,WAAU;AAC9B,iBAAQ,SAAS,MAAM,SACnB,aAAa,OAAO,YAAYA,WAAU,CAAC,GAAG,MAAM,IACpDtB;AAAAA,QACL;AAiBD,YAAI,WAAW,oBAAoB,SAAS,YAAY,cAAc;AACpE,iBAAO,aAAa;AAAA,QACrB,GAAE,CAAC;AAuBJ,YAAI,QAAQ,YAAY,OAAO;AAiB/B,YAAI,WAAW,oBAAoB,SAAS,SAAS,YAAY;AAC/D,iBAAO,UAAU;AAAA,QAClB,GAAE,CAAC;AAgBJ,iBAAS,IAAI,OAAO;AAClB,iBAAQ,SAAS,MAAM,SACnB,QAAQ,OAAO,QAAQ,IACvB;AAAA,QACL;AAyBD,iBAAS,MAAM,OAAOsB,WAAU;AAC9B,iBAAQ,SAAS,MAAM,SACnB,QAAQ,OAAO,YAAYA,WAAU,CAAC,CAAC,IACvC;AAAA,QACL;AAKD,QAAAF,QAAO,QAAQ;AACf,QAAAA,QAAO,MAAM;AACb,QAAAA,QAAO,SAAS;AAChB,QAAAA,QAAO,WAAW;AAClB,QAAAA,QAAO,eAAe;AACtB,QAAAA,QAAO,aAAa;AACpB,QAAAA,QAAO,KAAK;AACZ,QAAAA,QAAO,SAAS;AAChB,QAAAA,QAAO,OAAO;AACd,QAAAA,QAAO,UAAU;AACjB,QAAAA,QAAO,UAAU;AACjB,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,QAAQ;AACf,QAAAA,QAAO,QAAQ;AACf,QAAAA,QAAO,UAAU;AACjB,QAAAA,QAAO,SAAS;AAChB,QAAAA,QAAO,OAAO;AACd,QAAAA,QAAO,WAAW;AAClB,QAAAA,QAAO,WAAW;AAClB,QAAAA,QAAO,UAAU;AACjB,QAAAA,QAAO,SAAS;AAChB,QAAAA,QAAO,QAAQ;AACf,QAAAA,QAAO,aAAa;AACpB,QAAAA,QAAO,WAAW;AAClB,QAAAA,QAAO,WAAW;AAClB,QAAAA,QAAO,eAAe;AACtB,QAAAA,QAAO,QAAQ;AACf,QAAAA,QAAO,QAAQ;AACf,QAAAA,QAAO,aAAa;AACpB,QAAAA,QAAO,eAAe;AACtB,QAAAA,QAAO,iBAAiB;AACxB,QAAAA,QAAO,OAAO;AACd,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,iBAAiB;AACxB,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,OAAO;AACd,QAAAA,QAAO,SAAS;AAChB,QAAAA,QAAO,UAAU;AACjB,QAAAA,QAAO,cAAc;AACrB,QAAAA,QAAO,eAAe;AACtB,QAAAA,QAAO,UAAUrF;AACjB,QAAAqF,QAAO,cAAc;AACrB,QAAAA,QAAO,eAAe;AACtB,QAAAA,QAAO,OAAO;AACd,QAAAA,QAAO,OAAO;AACd,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,cAAc;AACrB,QAAAA,QAAO,UAAU;AACjB,QAAAA,QAAO,UAAU;AACjB,QAAAA,QAAO,eAAe;AACtB,QAAAA,QAAO,iBAAiB;AACxB,QAAAA,QAAO,mBAAmB;AAC1B,QAAAA,QAAO,SAAS;AAChB,QAAAA,QAAO,WAAW;AAClB,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,WAAW;AAClB,QAAAA,QAAO,QAAQ;AACf,QAAAA,QAAO,OAAO;AACd,QAAAA,QAAO,SAAS;AAChB,QAAAA,QAAO,MAAM;AACb,QAAAA,QAAO,UAAU;AACjB,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,UAAU;AACjB,QAAAA,QAAO,kBAAkB;AACzB,QAAAA,QAAO,UAAU;AACjB,QAAAA,QAAO,QAAQ;AACf,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,SAAS;AAChB,QAAAA,QAAO,WAAW;AAClB,QAAAA,QAAO,QAAQ;AACf,QAAAA,QAAO,SAAS;AAChB,QAAAA,QAAO,SAAS;AAChB,QAAAA,QAAO,OAAO;AACd,QAAAA,QAAO,SAAS;AAChB,QAAAA,QAAO,OAAO;AACd,QAAAA,QAAO,UAAU;AACjB,QAAAA,QAAO,OAAO;AACd,QAAAA,QAAO,WAAW;AAClB,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,WAAW;AAClB,QAAAA,QAAO,UAAU;AACjB,QAAAA,QAAO,eAAe;AACtB,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,OAAO;AACd,QAAAA,QAAO,SAAS;AAChB,QAAAA,QAAO,WAAW;AAClB,QAAAA,QAAO,aAAa;AACpB,QAAAA,QAAO,OAAO;AACd,QAAAA,QAAO,UAAU;AACjB,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,cAAc;AACrB,QAAAA,QAAO,SAAS;AAChB,QAAAA,QAAO,QAAQ;AACf,QAAAA,QAAO,aAAa;AACpB,QAAAA,QAAO,QAAQ;AACf,QAAAA,QAAO,SAAS;AAChB,QAAAA,QAAO,SAASiB;AAChB,QAAAjB,QAAO,OAAO;AACd,QAAAA,QAAO,UAAU;AACjB,QAAAA,QAAO,aAAa;AACpB,QAAAA,QAAO,MAAM;AACb,QAAAA,QAAO,UAAU;AACjB,QAAAA,QAAO,UAAU;AACjB,QAAAA,QAAO,QAAQ;AACf,QAAAA,QAAO,SAAS;AAChB,QAAAA,QAAO,aAAa;AACpB,QAAAA,QAAO,eAAe;AACtB,QAAAA,QAAO,QAAQ;AACf,QAAAA,QAAO,SAAS;AAChB,QAAAA,QAAO,OAAO;AACd,QAAAA,QAAO,OAAO;AACd,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,iBAAiB;AACxB,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,MAAM;AACb,QAAAA,QAAO,WAAW;AAClB,QAAAA,QAAO,OAAO;AACd,QAAAA,QAAO,UAAU;AACjB,QAAAA,QAAO,UAAU;AACjB,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,SAAS;AAChB,QAAAA,QAAO,gBAAgB;AACvB,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,QAAQ;AACf,QAAAA,QAAO,QAAQ;AACf,QAAAA,QAAO,UAAU;AACjB,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,OAAO;AACd,QAAAA,QAAO,SAAS;AAChB,QAAAA,QAAO,WAAW;AAClB,QAAAA,QAAO,QAAQ;AACf,QAAAA,QAAO,QAAQ;AACf,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,SAAS;AAChB,QAAAA,QAAO,aAAa;AACpB,QAAAA,QAAO,SAAS;AAChB,QAAAA,QAAO,WAAW;AAClB,QAAAA,QAAO,UAAU;AACjB,QAAAA,QAAO,QAAQ;AACf,QAAAA,QAAO,OAAO;AACd,QAAAA,QAAO,MAAM;AACb,QAAAA,QAAO,QAAQ;AACf,QAAAA,QAAO,UAAU;AACjB,QAAAA,QAAO,MAAM;AACb,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,gBAAgB;AACvB,QAAAA,QAAO,UAAU;AAGjB,QAAAA,QAAO,UAAU;AACjB,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,SAAS;AAChB,QAAAA,QAAO,aAAa;AAGpB,cAAMA,SAAQA,OAAM;AAKpB,QAAAA,QAAO,MAAM;AACb,QAAAA,QAAO,UAAU;AACjB,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,aAAa;AACpB,QAAAA,QAAO,OAAO;AACd,QAAAA,QAAO,QAAQ;AACf,QAAAA,QAAO,QAAQ;AACf,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,gBAAgB;AACvB,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,aAAa;AACpB,QAAAA,QAAO,SAAS;AAChB,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,SAAS;AAChB,QAAAA,QAAO,WAAW;AAClB,QAAAA,QAAO,KAAK;AACZ,QAAAA,QAAO,SAAS;AAChB,QAAAA,QAAO,eAAe;AACtB,QAAAA,QAAO,QAAQ;AACf,QAAAA,QAAO,OAAOoB;AACd,QAAApB,QAAO,YAAY;AACnB,QAAAA,QAAO,UAAU;AACjB,QAAAA,QAAO,WAAW;AAClB,QAAAA,QAAO,gBAAgB;AACvB,QAAAA,QAAO,cAAc;AACrB,QAAAA,QAAO,QAAQ;AACf,QAAAA,QAAO,UAAU;AACjB,QAAAA,QAAO,eAAe;AACtB,QAAAA,QAAO,QAAQ;AACf,QAAAA,QAAO,aAAa;AACpB,QAAAA,QAAO,SAAS;AAChB,QAAAA,QAAO,cAAc;AACrB,QAAAA,QAAO,MAAM;AACb,QAAAA,QAAO,KAAK;AACZ,QAAAA,QAAO,MAAM;AACb,QAAAA,QAAO,MAAM;AACb,QAAAA,QAAO,QAAQ;AACf,QAAAA,QAAO,OAAO;AACd,QAAAA,QAAO,WAAW;AAClB,QAAAA,QAAO,WAAW;AAClB,QAAAA,QAAO,UAAU;AACjB,QAAAA,QAAO,UAAU;AACjB,QAAAA,QAAO,SAAS;AAChB,QAAAA,QAAO,cAAc;AACrB,QAAAA,QAAO,UAAU;AACjB,QAAAA,QAAO,gBAAgB;AACvB,QAAAA,QAAO,cAAc;AACrB,QAAAA,QAAO,oBAAoB;AAC3B,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,WAAW;AAClB,QAAAA,QAAO,SAAS;AAChB,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,UAAU;AACjB,QAAAA,QAAO,UAAU;AACjB,QAAAA,QAAO,cAAc;AACrB,QAAAA,QAAO,UAAU;AACjB,QAAAA,QAAO,WAAWqB;AAClB,QAAArB,QAAO,aAAa;AACpB,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,WAAW;AAClB,QAAAA,QAAO,QAAQ;AACf,QAAAA,QAAO,UAAU;AACjB,QAAAA,QAAO,cAAc;AACrB,QAAAA,QAAO,QAAQsB;AACf,QAAAtB,QAAO,WAAW;AAClB,QAAAA,QAAO,QAAQ;AACf,QAAAA,QAAO,SAAS;AAChB,QAAAA,QAAO,WAAW;AAClB,QAAAA,QAAO,WAAW;AAClB,QAAAA,QAAO,eAAe;AACtB,QAAAA,QAAO,gBAAgB;AACvB,QAAAA,QAAO,WAAW;AAClB,QAAAA,QAAO,gBAAgB;AACvB,QAAAA,QAAO,QAAQ;AACf,QAAAA,QAAO,WAAW;AAClB,QAAAA,QAAO,WAAW;AAClB,QAAAA,QAAO,eAAe;AACtB,QAAAA,QAAO,cAAc;AACrB,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,OAAO;AACd,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,OAAO;AACd,QAAAA,QAAO,cAAc;AACrB,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,aAAa;AACpB,QAAAA,QAAO,KAAK;AACZ,QAAAA,QAAO,MAAM;AACb,QAAAA,QAAO,MAAM;AACb,QAAAA,QAAO,QAAQ;AACf,QAAAA,QAAO,OAAO;AACd,QAAAA,QAAO,SAAS;AAChB,QAAAA,QAAO,MAAM;AACb,QAAAA,QAAO,QAAQ;AACf,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,aAAa;AACpB,QAAAA,QAAO,aAAa;AACpB,QAAAA,QAAO,WAAW;AAClB,QAAAA,QAAO,WAAW;AAClB,QAAAA,QAAO,MAAM;AACb,QAAAA,QAAO,aAAa;AACpB,QAAAA,QAAO,OAAO;AACd,QAAAA,QAAO,MAAM;AACb,QAAAA,QAAO,MAAM;AACb,QAAAA,QAAO,SAAS;AAChB,QAAAA,QAAO,WAAW;AAClB,QAAAA,QAAO,WAAWuB;AAClB,QAAAvB,QAAO,SAAS;AAChB,QAAAA,QAAO,SAAS;AAChB,QAAAA,QAAO,cAAc;AACrB,QAAAA,QAAO,SAAS;AAChB,QAAAA,QAAO,UAAU;AACjB,QAAAA,QAAO,SAAS;AAChB,QAAAA,QAAO,QAAQ;AACf,QAAAA,QAAO,eAAejB;AACtB,QAAAiB,QAAO,SAAS;AAChB,QAAAA,QAAO,OAAO;AACd,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,OAAO;AACd,QAAAA,QAAO,cAAc;AACrB,QAAAA,QAAO,gBAAgB;AACvB,QAAAA,QAAO,gBAAgB;AACvB,QAAAA,QAAO,kBAAkB;AACzB,QAAAA,QAAO,oBAAoB;AAC3B,QAAAA,QAAO,oBAAoB;AAC3B,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,aAAa;AACpB,QAAAA,QAAO,WAAW;AAClB,QAAAA,QAAO,MAAM;AACb,QAAAA,QAAO,QAAQ;AACf,QAAAA,QAAO,WAAW;AAClB,QAAAA,QAAO,QAAQ;AACf,QAAAA,QAAO,WAAW;AAClB,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,WAAW;AAClB,QAAAA,QAAO,UAAU;AACjB,QAAAA,QAAO,WAAW;AAClB,QAAAA,QAAO,gBAAgB;AACvB,QAAAA,QAAO,WAAW;AAClB,QAAAA,QAAO,UAAU;AACjB,QAAAA,QAAO,OAAO;AACd,QAAAA,QAAO,UAAU;AACjB,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,WAAW;AAClB,QAAAA,QAAO,WAAW;AAClB,QAAAA,QAAO,WAAW;AAClB,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,aAAa;AAGpB,QAAAA,QAAO,OAAO;AACd,QAAAA,QAAO,YAAY;AACnB,QAAAA,QAAO,QAAQ;AAEf,cAAMA,SAAS,WAAW;AACxB,cAAI,SAAS,CAAA;AACb,qBAAWA,SAAQ,SAAS,MAAM,YAAY;AAC5C,gBAAI,CAAC,eAAe,KAAKA,QAAO,WAAW,UAAU,GAAG;AACtD,qBAAO,UAAU,IAAI;AAAA,YACtB;AAAA,UACT,CAAO;AACD,iBAAO;AAAA,QACR,EAAA,GAAK,EAAE,SAAS,MAAK,CAAE;AAWxB,QAAAA,QAAO,UAAU;AAGjB,kBAAU,CAAC,QAAQ,WAAW,SAAS,cAAc,WAAW,cAAc,GAAG,SAAS,YAAY;AACpG,UAAAA,QAAO,UAAU,EAAE,cAAcA;AAAA,QACvC,CAAK;AAGD,kBAAU,CAAC,QAAQ,MAAM,GAAG,SAAS,YAAY3J,QAAO;AACtD,sBAAY,UAAU,UAAU,IAAI,SAASE,IAAG;AAC9C,YAAAA,KAAIA,OAAMqI,cAAY,IAAI,UAAU,UAAUrI,EAAC,GAAG,CAAC;AAEnD,gBAAI0J,UAAU,KAAK,gBAAgB,CAAC5J,SAChC,IAAI,YAAY,IAAI,IACpB,KAAK,MAAK;AAEd,gBAAI4J,QAAO,cAAc;AACvB,cAAAA,QAAO,gBAAgB,UAAU1J,IAAG0J,QAAO,aAAa;AAAA,YAClE,OAAe;AACL,cAAAA,QAAO,UAAU,KAAK;AAAA,gBACpB,QAAQ,UAAU1J,IAAG,gBAAgB;AAAA,gBACrC,QAAQ,cAAc0J,QAAO,UAAU,IAAI,UAAU;AAAA,cACjE,CAAW;AAAA,YACF;AACD,mBAAOA;AAAA,UACf;AAEM,sBAAY,UAAU,aAAa,OAAO,IAAI,SAAS1J,IAAG;AACxD,mBAAO,KAAK,UAAU,UAAU,EAAEA,EAAC,EAAE;UAC7C;AAAA,QACA,CAAK;AAGD,kBAAU,CAAC,UAAU,OAAO,WAAW,GAAG,SAAS,YAAYF,QAAO;AACpE,cAAI,OAAOA,SAAQ,GACf,WAAW,QAAQ,oBAAoB,QAAQ;AAEnD,sBAAY,UAAU,UAAU,IAAI,SAAS6J,WAAU;AACrD,gBAAID,UAAS,KAAK;AAClB,YAAAA,QAAO,cAAc,KAAK;AAAA,cACxB,YAAY,YAAYC,WAAU,CAAC;AAAA,cACnC,QAAQ;AAAA,YAClB,CAAS;AACD,YAAAD,QAAO,eAAeA,QAAO,gBAAgB;AAC7C,mBAAOA;AAAA,UACf;AAAA,QACA,CAAK;AAGD,kBAAU,CAAC,QAAQ,MAAM,GAAG,SAAS,YAAY5J,QAAO;AACtD,cAAI,WAAW,UAAUA,SAAQ,UAAU;AAE3C,sBAAY,UAAU,UAAU,IAAI,WAAW;AAC7C,mBAAO,KAAK,QAAQ,EAAE,CAAC,EAAE,MAAK,EAAG,CAAC;AAAA,UAC1C;AAAA,QACA,CAAK;AAGD,kBAAU,CAAC,WAAW,MAAM,GAAG,SAAS,YAAYA,QAAO;AACzD,cAAI,WAAW,UAAUA,SAAQ,KAAK;AAEtC,sBAAY,UAAU,UAAU,IAAI,WAAW;AAC7C,mBAAO,KAAK,eAAe,IAAI,YAAY,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;AAAA,UAC3E;AAAA,QACA,CAAK;AAED,oBAAY,UAAU,UAAU,WAAW;AACzC,iBAAO,KAAK,OAAO,QAAQ;AAAA,QACjC;AAEI,oBAAY,UAAU,OAAO,SAAS,WAAW;AAC/C,iBAAO,KAAK,OAAO,SAAS,EAAE,KAAI;AAAA,QACxC;AAEI,oBAAY,UAAU,WAAW,SAAS,WAAW;AACnD,iBAAO,KAAK,QAAO,EAAG,KAAK,SAAS;AAAA,QAC1C;AAEI,oBAAY,UAAU,YAAY,SAAS,SAAS,MAAM,MAAM;AAC9D,cAAI,OAAO,QAAQ,YAAY;AAC7B,mBAAO,IAAI,YAAY,IAAI;AAAA,UAC5B;AACD,iBAAO,KAAK,IAAI,SAAS,OAAO;AAC9B,mBAAO,WAAW,OAAO,MAAM,IAAI;AAAA,UAC3C,CAAO;AAAA,QACP,CAAK;AAED,oBAAY,UAAU,SAAS,SAAS,WAAW;AACjD,iBAAO,KAAK,OAAO,OAAO,YAAY,SAAS,CAAC,CAAC;AAAA,QACvD;AAEI,oBAAY,UAAU,QAAQ,SAAS,OAAO,KAAK;AACjD,kBAAQ,UAAU,KAAK;AAEvB,cAAI4J,UAAS;AACb,cAAIA,QAAO,iBAAiB,QAAQ,KAAK,MAAM,IAAI;AACjD,mBAAO,IAAI,YAAYA,OAAM;AAAA,UAC9B;AACD,cAAI,QAAQ,GAAG;AACb,YAAAA,UAASA,QAAO,UAAU,CAAC,KAAK;AAAA,UACjC,WAAU,OAAO;AAChB,YAAAA,UAASA,QAAO,KAAK,KAAK;AAAA,UAC3B;AACD,cAAI,QAAQrB,aAAW;AACrB,kBAAM,UAAU,GAAG;AACnB,YAAAqB,UAAS,MAAM,IAAIA,QAAO,UAAU,CAAC,GAAG,IAAIA,QAAO,KAAK,MAAM,KAAK;AAAA,UACpE;AACD,iBAAOA;AAAA,QACb;AAEI,oBAAY,UAAU,iBAAiB,SAAS,WAAW;AACzD,iBAAO,KAAK,QAAS,EAAC,UAAU,SAAS,EAAE;QACjD;AAEI,oBAAY,UAAU,UAAU,WAAW;AACzC,iBAAO,KAAK,KAAK,gBAAgB;AAAA,QACvC;AAGI,mBAAW,YAAY,WAAW,SAAS,MAAM,YAAY;AAC3D,cAAI,gBAAgB,qCAAqC,KAAK,UAAU,GACpE,UAAU,kBAAkB,KAAK,UAAU,GAC3C,aAAaD,QAAO,UAAW,UAAU,cAAc,SAAS,UAAU,MAAO,UAAU,GAC3F,eAAe,WAAW,QAAQ,KAAK,UAAU;AAErD,cAAI,CAAC,YAAY;AACf;AAAA,UACD;AACD,UAAAA,QAAO,UAAU,UAAU,IAAI,WAAW;AACxC,gBAAI,QAAQ,KAAK,aACb,OAAO,UAAU,CAAC,CAAC,IAAI,WACvB,SAAS,iBAAiB,aAC1BE,YAAW,KAAK,CAAC,GACjB,UAAU,UAAU,QAAQ,KAAK;AAErC,gBAAI,cAAc,SAASuB,QAAO;AAChC,kBAAIxB,UAAS,WAAW,MAAMD,SAAQ,UAAU,CAACyB,MAAK,GAAG,IAAI,CAAC;AAC9D,qBAAQ,WAAW,WAAYxB,QAAO,CAAC,IAAIA;AAAA,YACrD;AAEQ,gBAAI,WAAW,iBAAiB,OAAOC,aAAY,cAAcA,UAAS,UAAU,GAAG;AAErF,uBAAS,UAAU;AAAA,YACpB;AACD,gBAAI,WAAW,KAAK,WAChB,WAAW,CAAC,CAAC,KAAK,YAAY,QAC9B,cAAc,gBAAgB,CAAC,UAC/B,WAAW,UAAU,CAAC;AAE1B,gBAAI,CAAC,gBAAgB,SAAS;AAC5B,sBAAQ,WAAW,QAAQ,IAAI,YAAY,IAAI;AAC/C,kBAAID,UAAS,KAAK,MAAM,OAAO,IAAI;AACnC,cAAAA,QAAO,YAAY,KAAK,EAAE,QAAQ,MAAM,QAAQ,CAAC,WAAW,GAAG,WAAWrB,YAAW,CAAA;AACrF,qBAAO,IAAI,cAAcqB,SAAQ,QAAQ;AAAA,YAC1C;AACD,gBAAI,eAAe,UAAU;AAC3B,qBAAO,KAAK,MAAM,MAAM,IAAI;AAAA,YAC7B;AACD,YAAAA,UAAS,KAAK,KAAK,WAAW;AAC9B,mBAAO,cAAe,UAAUA,QAAO,MAAK,EAAG,CAAC,IAAIA,QAAO,MAAO,IAAIA;AAAA,UAC9E;AAAA,QACA,CAAK;AAGD,kBAAU,CAAC,OAAO,QAAQ,SAAS,QAAQ,UAAU,SAAS,GAAG,SAAS,YAAY;AACpF,cAAI,OAAO,WAAW,UAAU,GAC5B,YAAY,0BAA0B,KAAK,UAAU,IAAI,QAAQ,QACjE,eAAe,kBAAkB,KAAK,UAAU;AAEpD,UAAAD,QAAO,UAAU,UAAU,IAAI,WAAW;AACxC,gBAAI,OAAO;AACX,gBAAI,gBAAgB,CAAC,KAAK,WAAW;AACnC,kBAAI,QAAQ,KAAK;AACjB,qBAAO,KAAK,MAAM,QAAQ,KAAK,IAAI,QAAQ,CAAA,GAAI,IAAI;AAAA,YACpD;AACD,mBAAO,KAAK,SAAS,EAAE,SAASyB,QAAO;AACrC,qBAAO,KAAK,MAAM,QAAQA,MAAK,IAAIA,SAAQ,CAAA,GAAI,IAAI;AAAA,YAC7D,CAAS;AAAA,UACT;AAAA,QACA,CAAK;AAGD,mBAAW,YAAY,WAAW,SAAS,MAAM,YAAY;AAC3D,cAAI,aAAazB,QAAO,UAAU;AAClC,cAAI,YAAY;AACd,gBAAI,MAAM,WAAW,OAAO;AAC5B,gBAAI,CAAC,eAAe,KAAK,WAAW,GAAG,GAAG;AACxC,wBAAU,GAAG,IAAI;YAClB;AACD,sBAAU,GAAG,EAAE,KAAK,EAAE,QAAQ,YAAY,QAAQ,WAAU,CAAE;AAAA,UAC/D;AAAA,QACP,CAAK;AAED,kBAAU,aAAapB,aAAW,kBAAkB,EAAE,IAAI,IAAI,CAAC;AAAA,UAC7D,QAAQ;AAAA,UACR,QAAQA;AAAAA,QACd,CAAK;AAGD,oBAAY,UAAU,QAAQ;AAC9B,oBAAY,UAAU,UAAU;AAChC,oBAAY,UAAU,QAAQ;AAG9B,QAAAoB,QAAO,UAAU,KAAK;AACtB,QAAAA,QAAO,UAAU,QAAQ;AACzB,QAAAA,QAAO,UAAU,SAAS;AAC1B,QAAAA,QAAO,UAAU,OAAO;AACxB,QAAAA,QAAO,UAAU,QAAQ;AACzB,QAAAA,QAAO,UAAU,UAAU;AAC3B,QAAAA,QAAO,UAAU,SAASA,QAAO,UAAU,UAAUA,QAAO,UAAU,QAAQ;AAG9E,QAAAA,QAAO,UAAU,QAAQA,QAAO,UAAU;AAE1C,YAAI,aAAa;AACf,UAAAA,QAAO,UAAU,WAAW,IAAI;AAAA,QACjC;AACD,eAAOA;AAAA,MACX;AAKE,UAAIvH,KAAI;AAiBH,UAAI,YAAY;AAEnB,SAAC,WAAW,UAAUA,IAAG,IAAIA;AAE7B,oBAAY,IAAIA;AAAA,MACjB,OACI;AAEH,aAAK,IAAIA;AAAA,MACV;AAAA,IACH,GAAE,KAAKiJ,cAAI;AAAA;;;ACnzhBJ,QAAM,WAAW;AACjB,QAAM,YAAY;AAClB,QAAM,WAAW;AACjB,QAAM,UAAU;AAGhB,MAAI,WAAW,CAACpL,OAAM;AACzB,QAAIA,OAAM,KAAK;AACX,aAAO;AAAA,IACV,WACQA,OAAM,KAAK;AAChB,aAAO;AAAA,IACV,WACQA,OAAM,KAAK;AAChB,aAAO;AAAA,IACV,OACI;AACD,aAAO;AAAA,IACV;AAAA,EACL;AACO,MAAI,OAAO,CAAC,KAAK,KAAK,WAAW,MAAM,OAAO,QAAQ;AACtD,MAAI,oBAAoB,CAAC,EAAE,QAAQ,SAAS,OAAAD,QAAO,MAAK,MAAO;AAClE,QAAI,QAAQ,QAAQ;AACpB,QAAI,MAAM,SAAS,QAAQ;AAC3B,QAAI,MAAM,SAAS,QAAQ;AAC3B,QAAI,QAAQA,SAAQ;AACpB,WAAO,KAAK,KAAK,KAAK,KAAK;AAAA,EAC/B;AACO,MAAI,UAAU,CAAC,WAAW;AAC7B,QAAI,SAAS;AACb,UAAM,aAAa;AACnB,UAAM,mBAAmB,WAAW;AACpC,aAASD,KAAI,GAAGA,KAAI,QAAQA,MAAK;AAC7B,gBAAU,WAAW,OAAO,KAAK,MAAM,KAAK,OAAM,IAAK,gBAAgB,CAAC;AAAA,IAC3E;AACD,WAAO,MAAM,MAAM;AAAA,EACvB;AACO,WAAS,cAAc,IAAI,WAAW;AACzC,WAAO,WAAW,OAAO;AAAA,MACrB,QAAQ,MAAM,WAAW;AAAA,MACzB,OAAO,QAAQ,cAAc;AACzB,iBAASH,MAAK,aAAa,SAAS;AAChC,cAAIA,GAAE,GAAG,EAAE,GAAG;AAEV,mBAAO,SAAS,GAAG,UAAUA,GAAE,OAAO,aAAa,MAAM,GAAG,IAAI;AAAA,UACnE;AAAA,QACJ;AACD,eAAO,aAAa,aAAa,SAAS,GAAG,CAAA,CAAE,IAAI;AAAA,MACtD;AAAA,MACD,SAAS,CAAAqC,OAAK,WAAW,YAAY,KAAKA,EAAC;AAAA,IACnD,CAAK;AAAA,EACL;AACO,QAAM,qBAAqB,YAAY;AACvC,QAAM,iBAAiB,cAAc,oBAAoB,CAAC,IAAI,SAAS,GAAG,QAAQ,CAAAY,OAAK,sBAAsBA,IAAG,IAAI,CAAC,CAAC;AAC7H,WAAS,sBAAsB,EAAE,YAAY,WAAW,cAAc,OAAQ,GAAE,MAAM;AAClF,QAAI,WAAW,WAAW,KAAK;AAAA,MAC3B,OAAO;AAAA,MACP,SAAS;AAAA,IACZ,CAAA,EAAE,MAAM,kBAAkB,aAAa,OAAO,IAAI,GAAG,kBAAkB,aAAa,KAAK,IAAI,CAAC;AAC/F,QAAI,cAAc,OAAO,eACpB,OAAO,WAAS,CAAC,EAAE,QAAQ,MAAM,OAAO,MAAM,GAAG,CAAC,EAClD,IAAI,WAAS;AACd,UAAI,mBAAmB,WAAW,KAAK;AAAA,QACnC,OAAO;AAAA,QACP,SAAS;AAAA,MACZ,CAAA,EAAE,MAAM,kBAAkB,MAAM,OAAO,IAAI,GAAG,kBAAkB,MAAM,KAAK,IAAI,CAAC;AACjF,aAAO;AAAA,IACf,CAAK;AACD,WAAO,CAAC,UAAU,GAAG,WAAW;AAAA,EACpC;AACO,WAAS,gCAAgC,QAAQ;AACpD,QAAI,UAAU,CAAA;AACd,QAAI,WAAW,CAAA;AACf,QAAI,UAAU,CAAA;AACd,QAAI,WAAW,CAAA;AACf,QAAI,aAAa,CAAA;AACjB,eAAW,QAAQ,OAAO,cAAc;AACpC,UAAI,MAAM,QAAQ,EAAE;AACpB,UAAI,YAAY,QAAQ,EAAE;AAC1B,UAAI,gBAAgB,OAAO,aAAa,IAAI;AAC5C,UAAI,YAAY,OAAO,YAAY,IAAI;AACvC,cAAQ,IAAI,IAAI;AAChB,eAAS,IAAI,IAAI;AACjB,UAAI,YAAY;AAAA,QACZ,YAAY;AAAA,QACZ;AAAA,QACA,cAAc;AAAA,QACd,QAAQ;AAAA,MACpB;AACQ,iBAAW,KAAK,SAAS;AAAA,IAC5B;AACD,eAAW,QAAQ,OAAO,cAAc;AACpC,UAAI,MAAM,QAAQ,EAAE;AACpB,UAAI,YAAY,QAAQ,EAAE;AAC1B,UAAI,gBAAgB,OAAO,aAAa,IAAI;AAC5C,UAAI,YAAY,OAAO,YAAY,IAAI;AACvC,cAAQ,IAAI,IAAI;AAChB,eAAS,IAAI,IAAI;AACjB,UAAI,YAAY;AAAA,QACZ,YAAY;AAAA,QACZ;AAAA,QACA,cAAc;AAAA,QACd,QAAQ;AAAA,MACpB;AACQ,iBAAW,KAAK,SAAS;AAAA,IAC5B;AACD,QAAI,QAAQ;AAAA,MACR,YAAY;AAAA,MACZ,aAAa;AAAA,MACb,YAAY;AAAA,MACZ,aAAa;AAAA,IACrB;AACI,WAAO,CAAC,OAAO,UAAU;AAAA,EAC7B;AACO,MAAI,WAAW,YAAY;AAClC,MAAI,kBAAkB,WAAW,KAAK,EAAE,OAAO,cAAe,CAAA;AACvD,MAAI,cAAc,WAAW,OAAO;AAAA,IACvC,QAAQ,MAAM,WAAW;AAAA,IACzB,OAAO,OAAO,IAAI;AACd,cAAQ,MAAM,IAAI,GAAG,OAAO;AAC5B,eAASjD,MAAK,GAAG;AACb,YAAIA,GAAE,GAAG,QAAQ;AACb,kBAAQ,MAAM,OAAO;AAAA,YACjB,KAAK,CAAC,gBAAgB,MAAM,GAAG,MAAM,IAAI,KAAKA,GAAE,MAAM,IAAI,EAAE,IAAI,CAAC;AAAA,UACrF,CAAiB;AACT,aAAO;AAAA,IACV;AAAA,IACD,SAAS,CAAAqC,OAAK,WAAW,YAAY,KAAKA,EAAC;AAAA,EAC/C,CAAC;AACD,MAAI,eAAe,CAAC,KAAK,aAAa;AAClC,UAAM,KAAK,SAAS,qBAAqB,GAAG,CAAC,EAAE,QAAQ,QAAQ;AAAA,EACnE;AACA,WAAS,WAAW,QAAQ,SAAS,KAAK,QAAQ,CAAA,GAAI;AAClD,QAAI,QAAQ,QAAW;AACnB,YAAM,OAAO,OAAO,GAAG;AACvB,YAAM,OAAO,QAAQ,GAAG;AACxB,mBAAa,MAAM,UAAQ;AACvB,aAAK,UAAU,IAAI,aAAa;AAChC,cAAM,QAAQ,CAAC/B,OAAM,KAAK,UAAU,IAAIA,EAAC,CAAC;AAAA,MACtD,CAAS;AACD,mBAAa,MAAM,UAAQ;AACvB,aAAK,UAAU,IAAI,aAAa;AAChC,cAAM,QAAQ,CAACA,OAAM,KAAK,UAAU,IAAIA,EAAC,CAAC;AAAA,MACtD,CAAS;AAAA,IACJ;AAAA,EACL;AACA,WAAS,WAAW,QAAQ,SAAS,KAAK,QAAQ,CAAA,GAAI;AAClD,QAAI,QAAQ,QAAW;AACnB,YAAM,OAAO,OAAO,GAAG;AACvB,YAAM,OAAO,QAAQ,GAAG;AACxB,mBAAa,MAAM,UAAQ;AACvB,aAAK,UAAU,OAAO,aAAa;AACnC,cAAM,QAAQ,CAACA,OAAM,KAAK,UAAU,OAAOA,EAAC,CAAC;AAAA,MACzD,CAAS;AACD,mBAAa,MAAM,UAAQ;AACvB,aAAK,UAAU,OAAO,aAAa;AACnC,cAAM,QAAQ,CAACA,OAAM,KAAK,UAAU,OAAOA,EAAC,CAAC;AAAA,MACzD,CAAS;AAAA,IACJ;AAAA,EACL;AACO,MAAI,iBAAiB,CAAC,OAAO,KAAK,QAAQ,CAAA,MAAO;AACpD,eAAW,MAAM,YAAY,MAAM,aAAa,KAAK,KAAK;AAAA,EAC9D;AACO,MAAI,iBAAiB,CAAC,OAAO,KAAK,QAAQ,CAAA,MAAO;AACpD,eAAW,MAAM,YAAY,MAAM,aAAa,KAAK,KAAK;AAAA,EAC9D;AACO,MAAI,iBAAiB,CAAC,OAAO,KAAK,QAAQ,CAAA,MAAO;AACpD,eAAW,MAAM,YAAY,MAAM,aAAa,KAAK,KAAK;AAAA,EAC9D;AACO,MAAI,iBAAiB,CAAC,OAAO,KAAK,QAAQ,CAAA,MAAO;AACpD,eAAW,MAAM,YAAY,MAAM,aAAa,KAAK,KAAK;AAAA,EAC9D;AACO,MAAI,sBAAsB,MAAM;AACnC,QAAI,YAAY,YAAY;AAC5B,QAAI,QAAQ,WAAW,OAAO;AAAA,MAC1B,QAAQ,MAAM,WAAW;AAAA,MACzB,OAAO,SAAS,IAAI;AAChB,kBAAU,QAAQ,IAAI,GAAG,OAAO;AAChC,iBAASN,MAAK,GAAG;AACb,cAAIA,GAAE,GAAG,SAAS;AACd,sBAAU,SAAS,GAAG,EAAE,OAAOA,GAAE,OAAO,WAAS,MAAM,IAAI,CAAC;AACpE,eAAO;AAAA,MACV;AAAA,MACD,SAAS,CAAAqC,OAAK,WAAW,YAAY,KAAKA,EAAC;AAAA,IACnD,CAAK;AACD,WAAO,EAAE,WAAW;EACxB;AACO,MAAI,oBAAoB,CAACd,IAAG0B,OAAMA,GAAE,KAAK1B,GAAE,OAAO,CAAC,EAAE,OAAOA,GAAE;AC3LrE,MAAImK,aAAW,CAAC,EAAE,SAAA5H,UAAS,OAAO,KAAK,QAAQ,aAAa;AACxD,QAAIrD,QAAO,SAASqD,QAAO;AAC3B,IAAArD,QAAOA,MAAK,OAAO,CAAC,EAAE,YAAW,IAAKA,MAAK,MAAM,CAAC;AAClD,QAAI,QAAQ,GAAGA,KAAI;AACnB,aAAS,MACH,qCACA;AACN,WAAQ,MAAM;AAAA,MAAc;AAAA,MAAO,EAAE,WAAW,WAAW,GAAG,OAAO,EAAE,SAAS,CAAC,IAAG,CAAE,GAAG,cAAc,QAAQ,cAAc,QAAQ,MAAc;AAAA,MAC/I,MAAM,cAAc,OAAO,EAAE,WAAW,QAAS,GAAE,GAAQ;AAAA,MAC3D,MAAM,cAAc,OAAO,EAAE,WAAW,MAAO,GAAEqD,QAAO;AAAA,IAAC;AAAA,EACjE;AACA,MAAI,YAAY,CAAC,EAAE,OAAO,eAAe;;AACrC,UAAM,OAAO,SAAS;AACtB,QAAI,WAAW;AAAA,MACX;AAAA,QACI,SAAS;AAAA,QACT,OAAO,CAAC,QAAQ,MAAM;AAAA,QACtB,KAAK,SAAS,SAAS;AAAA,QACvB,KAAK,KAAK,YAAY;AAAA,QACtB,QAAQ,MAAM;AACV,yBAAe,OAAO,KAAK,mBAAmB,CAAC,MAAM,CAAC;AACtD,yBAAe,OAAO,KAAK,YAAY,CAAC,MAAM,CAAC;AAAA,QAClD;AAAA,QACD,QAAQ,MAAM;AACV,yBAAe,OAAO,KAAK,mBAAmB,CAAC,MAAM,CAAC;AACtD,yBAAe,OAAO,KAAK,YAAY,CAAC,MAAM,CAAC;AAAA,QAClD;AAAA,MACJ;AAAA,MACD;AAAA,QACI,SAAS;AAAA,QACT,OAAO,CAAC,QAAQ,OAAO;AAAA,QACvB,KAAK,SAAS,SAAS;AAAA,QACvB,KAAK,KAAK,YAAY;AAAA,QACtB,QAAQ,MAAM;AACV,yBAAe,OAAO,KAAK,oBAAoB,CAAC,OAAO,CAAC;AACxD,yBAAe,OAAO,KAAK,YAAY,CAAC,OAAO,CAAC;AAAA,QACnD;AAAA,QACD,QAAQ,MAAM;AACV,yBAAe,OAAO,KAAK,oBAAoB,CAAC,OAAO,CAAC;AACxD,yBAAe,OAAO,KAAK,YAAY,CAAC,OAAO,CAAC;AAAA,QACnD;AAAA,MACJ;AAAA,MACD;AAAA,QACI,SAAS;AAAA,QACT,OAAO,CAAC,QAAQ,KAAK;AAAA,QACrB,KAAK,SAAS,SAAS;AAAA,QACvB,KAAK,KAAK,YAAY;AAAA,QACtB,QAAQ,MAAM;AACV,yBAAe,OAAO,KAAK,mBAAmB,CAAC,KAAK,CAAC;AACrD,yBAAe,OAAO,KAAK,YAAY,CAAC,KAAK,CAAC;AAAA,QACjD;AAAA,QACD,QAAQ,MAAM;AACV,yBAAe,OAAO,KAAK,mBAAmB,CAAC,KAAK,CAAC;AACrD,yBAAe,OAAO,KAAK,YAAY,CAAC,KAAK,CAAC;AAAA,QACjD;AAAA,MACJ;AAAA,MACD;AAAA,QACI,SAAS;AAAA,QACT,OAAO,CAAC,QAAQ,MAAM;AAAA,QACtB,KAAK,SAAS,mBAAmB;AAAA,QACjC,KAAK,GAACzC,MAAA,SAAS,mBAAT,gBAAAA,IAAyB;AAAA,QAC/B,QAAQ,MAAM;AAAA,QACd,QAAQ,MAAM;AAAA,MACjB;AAAA,IACT;AACI,QAAI,QAAQ,SAAS,OAAO,CAAAlB,OAAKA,GAAE,GAAG;AAGtC,QAAI,CAAC,WAAW,YAAY,IAAIwL,aAAQ,SAAC,KAAK;AAC9C,QAAI,CAAC,OAAO,QAAQ,IAAIA,aAAQ,SAAA;AAChC,QAAI,mBAAmB,MAAM;AACzB,mBAAa,IAAI;AACjB,UAAI,UAAU;AACV,qBAAa,KAAK;AACtB,eAAS,OAAO,WAAW,MAAM,aAAa,KAAK,GAAG,GAAG,CAAC;AAAA,IAClE;AACI,WAAQ,MAAM,cAAc,OAAO,EAAE,cAAc,kBAAkB,cAAc,kBAAkB,WAAW,WAAW,EAAE,UAAW,CAAA,EAAG,GAAE,MAAM,IAAI,UAAS,MAAM,cAAcD,YAAU,EAAE,KAAK,KAAK,SAAS,GAAG,MAAM,CAAE,CAAC;AAAA,EACnO;AAAA,EACA,MAAM,4BAA4B,WAAW;AAAA,IAOzC,YAAY,MAAM,OAAO,UAAU,aAAa;AAC5C;AAPJ;AACA;AACA;AACA;AACA;AACA;AAGI,WAAK,OAAO;AACZ,WAAK,QAAQ;AACb,WAAK,WAAW;AAChB,WAAK,cAAc;AACnB,UAAI,MAAM,CAACtK,OAAOA,KAAI,IAAI;AAC1B,WAAK,eAAe;AAAA,QAChB,IAAI,KAAK,SAAS,SAAS,IAAI;AAAA,QAC/B,IAAI,KAAK,SAAS,SAAS,KAAK;AAAA,QAChC,IAAI,KAAK,SAAS,SAAS,IAAI;AAAA,QAC/B,IAAI,KAAK,SAAS,mBAAmB,MAAS;AAAA,MAC1D,EAAU,OAAO,CAACtB,IAAGsB,OAAMtB,KAAIsB,IAAG,CAAC;AAC3B,WAAK,OAAO,KAAK,MAAM,IAAI,OAAO,kBAAkB,SAAS,UAAU,KAAK,MAAM,GAAG,CAAC;AAAA,IACzF;AAAA,IACD,GAAG,OAAO;AAEN,aAAO,KAAK,SAAS,aAAa,MAAM,SAAS;AAAA,IACpD;AAAA,IACD,MAAM,MAAM;;AACR,UAAI,WAAW,kBAAkB,KAAK,SAAS,UAAU,KAAK,MAAM,GAAG;AACvE,UAAI,gBAAgB,KAAK,MAAM,SAAS,WAAW,GAAG,QAAQ;AAC9D,UAAI,YAAY,SAAS,cAAc,KAAK;AAC5C,gBAAU,UAAU,IAAI,kBAAkB;AAC1C,gBAAU,UAAU,IAAI,cAAc,KAAK,YAAY,EAAE;AACzD,UAAI,kBAAkB;AAClB,kBAAU,UAAU,IAAI,mBAAmB;AAC/C,WAAIC,MAAA,KAAK,gBAAL,gBAAAA,IAAkB,cAAc,SAAS,KAAK,KAAK;AACnD,kBAAU,UAAU,IAAI,UAAU;AACtCuK,aAAS,WAAW,SAAS,EAAE,OAAO,MAAM,cAAc,WAAW,EAAE,OAAO,KAAK,OAAO,UAAU,KAAK,SAAU,CAAA,CAAC;AACpH,aAAO;AAAA,IACV;AAAA,IACD,cAAc;AAEV,aAAO;AAAA,IACV;AAAA,EACL;AACO,MAAI,kBAAkB,oBAAmB;AACzC,WAAS,wBAAwB,MAAM,OAAO,YAAY,aAAa;AAC1E,WAAO,WAAW,IAAI,CAAAxK,OAAK,WAAW,OAAO;AAAA,MACzC,QAAQ,IAAI,oBAAoB,MAAM,OAAOA,IAAG,WAAW;AAAA,IACnE,CAAK,EAAE,MAAM,kBAAkBA,GAAE,UAAU,KAAK,MAAM,GAAG,CAAC,CAAC;AAAA,EAC3D;;;;ACnIA,QAAIyK,cAAW,WAAU;AAAc,UAAI,IAAGC,IAAE,GAAEzH,IAAE0H,IAAEtD,IAAExF,IAAEK,IAAEjB,IAAEd,IAAEjB,IAAER,IAAEE,IAAEC,IAAEmB,IAAEoC,IAAElC,IAAEnB,IAAE,GAAE6C,IAAErC,IAAEqL,IAAE3L,IAAE,IAAE,eAAc4L,KAAE,GAAEC,KAAE,GAAE,IAAE,GAAEC,KAAE,GAAEC,KAAE,EAAC,KAAIH,IAAE,OAAMC,IAAE,QAAO,GAAE,MAAKC,GAAC,GAAEE,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAE,IAAE,GAAEC,KAAE,GAAEC,KAAE,EAAC,UAASJ,IAAE,KAAIC,IAAE,OAAMC,IAAE,QAAO,GAAE,MAAKC,GAAC,GAAE,KAAG,UAAShL,KAAE,IAAE,SAAQgD,KAAE,k5HAAi5H,KAAG,EAAC,MAAK,EAAC,OAAM,oBAAmB,UAAS,MAAG,MAAK,EAAC,MAAK,IAAG,KAAI,IAAG,OAAM,IAAG,QAAO,IAAG,OAAM,GAAE,QAAO,EAAC,GAAE,QAAO,KAAI,SAAQ,KAAI,SAAQ,GAAE,SAAQ,GAAE,SAAQ,GAAE,UAAS,GAAE,aAAY,GAAE,YAAW,EAAC,GAAE,QAAO,EAAC,OAAM,sBAAqB,UAAS,MAAG,MAAK,EAAC,MAAK,IAAG,KAAI,IAAG,OAAM,IAAG,QAAO,IAAG,OAAM,GAAE,QAAO,EAAC,GAAE,QAAO,KAAI,SAAQ,KAAI,SAAQ,GAAE,SAAQ,GAAE,SAAQ,GAAE,UAAS,GAAE,aAAY,GAAE,YAAW,EAAC,GAAE,QAAO,EAAC,OAAM,sBAAqB,MAAK,EAAC,MAAK,IAAG,KAAI,IAAG,OAAM,IAAG,QAAO,IAAG,OAAM,GAAE,QAAO,EAAC,GAAE,QAAO,GAAE,SAAQ,GAAE,SAAQ,GAAE,SAAQ,GAAE,SAAQ,GAAE,UAAS,GAAE,aAAY,GAAE,YAAW,IAAG,GAAE,QAAO,EAAC,OAAM,sBAAqB,MAAK,EAAC,MAAK,IAAG,KAAI,IAAG,OAAM,IAAG,QAAO,IAAG,OAAM,GAAE,QAAO,EAAC,GAAE,QAAO,MAAK,SAAQ,GAAE,SAAQ,GAAE,SAAQ,GAAE,SAAQ,GAAE,UAAS,GAAE,aAAY,GAAE,YAAW,KAAI,GAAE,QAAO,EAAC,OAAM,sBAAqB,MAAK,EAAC,MAAK,IAAG,KAAI,IAAG,OAAM,IAAG,QAAO,IAAG,OAAM,GAAE,QAAO,EAAC,GAAE,QAAO,GAAE,SAAQ,KAAI,SAAQ,GAAE,SAAQ,GAAE,SAAQ,GAAE,UAAS,GAAE,aAAY,GAAE,YAAW,IAAG,GAAE,MAAK,EAAC,OAAM,oBAAmB,MAAK,EAAC,MAAK,IAAG,KAAI,KAAI,OAAM,IAAG,QAAO,IAAG,OAAM,IAAG,QAAO,GAAE,GAAE,QAAO,IAAG,SAAQ,GAAE,SAAQ,IAAG,SAAQ,IAAG,SAAQ,GAAE,UAAS,GAAE,GAAE,WAAU,EAAC,OAAM,yBAAwB,UAAS,MAAG,MAAK,EAAC,MAAK,KAAI,KAAI,KAAI,OAAM,KAAI,QAAO,KAAI,OAAM,IAAG,QAAO,GAAE,GAAE,QAAO,IAAG,SAAQ,IAAG,SAAQ,IAAG,SAAQ,IAAG,SAAQ,IAAG,UAAS,EAAC,EAAC,GAAE,IAAE,EAAC,QAAO,IAAG,MAAK,QAAO,QAAO,UAAS,QAAO,UAAS,QAAO,UAAS,QAAO,UAAS,MAAK,QAAO,WAAU,YAAW,GAAED,MAAG,EAAC,MAAK,QAAO,QAAO,UAAS,QAAO,UAAS,QAAO,UAAS,QAAO,UAAS,MAAK,QAAO,WAAU,YAAW,GAAEmI,KAAE,CAACT,IAAEC,IAAE,GAAEC,EAAC,GAAE,IAAE,QAAO,KAAG,EAAC,GAAE,QAAO,GAAE,OAAM,OAAM,SAAQ,QAAO,SAAQ,GAAE,IAAE,IAAG,IAAE,GAAE,IAAE,GAAE,IAAE,KAAI,IAAE,GAAE,IAAE,MAAK,IAAE,IAAG,IAAE,IAAG,KAAG,WAAS,KAAG,OAAI,KAAK,IAAG/I,KAAE,gCAA+B,KAAG,8BAA6BuJ,KAAE,sBAAqB,SAAS,gBAAgB,SAAO,mBAAkB,SAAS,gBAAgB,SAAO,CAAC,OAAO,UAAU,kBAAiB,KAAG,CAACA,MAAG,CAAC,CAAC,SAAS,UAAS,KAAG,mBAAkB,SAAS,gBAAgB,OAAM,KAAG,EAAEA,MAAG,MAAI,CAAC,OAAO,UAAQ,CAAC,OAAO,MAAK,KAAG,CAACA,MAAG,CAAC,MAAI,CAAC,MAAI,CAAC,MAAI,CAAC,OAAO,UAAQ,sBAAqB,SAAS,gBAAgB,OAAM,KAAG,MAAIA,KAAE,MAAG,KAAG,KAAG,EAAC,MAAKJ,IAAE,WAAU,SAAQ,UAAS,GAAE,QAAO,CAAC,IAAG,QAAQ,GAAE,YAAW,CAAC,GAAE,CAAC,GAAE,oBAAmB,OAAG,kBAAiB,aAAY,iBAAgB,MAAI,sBAAqB,CAAC,OAAG,KAAE,GAAE,mBAAkB,CAAC,GAAE,CAAC,EAAC,GAAE,MAAI5L,KAAE,CAAE,EAAC,UAASqL,KAAE,CAAA,EAAG,eAAe,UAAS3L,KAAE2L,GAAE,KAAK,MAAM,GAAE,SAAShM,IAAE;AAAC,YAAIiD,IAAE3C;AAAE,eAAON,MAAG,sBAAoBW,GAAE,KAAKX,EAAC,MAAI,EAAEiD,KAAE,OAAO,eAAejD,EAAC,OAAKM,KAAE2C,GAAE,eAAe,aAAa,KAAGA,GAAE,gBAAc,cAAY,OAAO3C,MAAG0L,GAAE,KAAK1L,EAAC,MAAID;AAAA,MAAE,IAAG,KAAG,OAAO,YAAU,SAASL,IAAE;AAAC,eAAM,YAAU,OAAOA,MAAG,OAAO,SAASA,EAAC;AAAA,MAAC,GAAE,KAAGC,KAAE,EAAC,MAAK,CAAC,MAAI,KAAG,MAAI,CAAC,GAAE,QAAO,CAAC,GAAE,GAAE,GAAE,CAAC,GAAE,WAAU,CAAC,MAAI,GAAE,GAAE,CAAC,GAAE,YAAW,CAAC,GAAE,GAAE,MAAI,CAAC,GAAE,eAAc,CAAC,MAAI,GAAE,MAAI,CAAC,EAAC,GAAEmB,KAAE,MAAI,KAAG,GAAEoC,KAAE,OAAO,yBAAuB,OAAO,4BAA0B,OAAO,+BAA6B,OAAO,2BAAyB,SAASxD,IAAE;AAAC,mBAAWA,IAAEoB,EAAC;AAAA,MAAC,GAAEE,KAAE,OAAO,wBAAsB,OAAO,2BAAyB,OAAO,8BAA4B,OAAO,0BAAwB,SAAStB,IAAE;AAAC,qBAAaA,EAAC;AAAA,MAAC,GAAEG,KAAE,OAAO,YAAU,SAASH,IAAE;AAAC,eAAM,YAAU,OAAOA,MAAG,OAAO,SAASA,EAAC;AAAA,MAAC,GAAE,IAAE,IAAGgD,KAAE,GAAE,EAAC,KAAI,SAAS1C,IAAEN,IAAEiD,IAAEnD,IAAEK,IAAEsI,IAAEjF,IAAE;AAAC,YAAIlC,IAAEX,IAAEqL,IAAE1I,IAAE/B,IAAElB,IAAEmB,IAAEa,IAAEmC,IAAEpB,IAAEuJ,IAAEC,IAAEpK,IAAEG,KAAE,EAAEK;AAAE,iBAAS6J,GAAE7M,IAAEiD,IAAE;AAAC,iBAAM,EAAC,OAAM3C,GAAE2C,EAAC,GAAE,WAAUjD,IAAE,aAAYiD,GAAC;AAAA,QAAC;AAAC,YAAG,YAAU,OAAO9C,OAAIA,KAAEF,GAAEE,EAAC,IAAGG,KAAEA,MAAG,WAAU;AAAA,QAAE,GAAC2C,KAAE7B;AAAE,UAAAT,KAAE,CAACkM,GAAE,GAAE,CAAC,GAAEA,GAAE,GAAE,CAAC,CAAC;AAAA,aAAM;AAAC,cAAGb,KAAE5K,KAAE6B,IAAEtC,KAAE,CAACkM,GAAE,GAAE,CAAC,CAAC,GAAE,MAAI1M,GAAE,CAAC,KAAG,MAAIA,GAAE,CAAC,KAAG,MAAIA,GAAE,CAAC,KAAG,MAAIA,GAAE,CAAC;AAAE,iBAAIoB,KAAEyK,IAAEzK,MAAG,GAAEA,MAAGyK;AAAE,cAAArL,GAAE,KAAKkM,GAAEtL,IAAEA,EAAC,CAAC;AAAA;AAAO,iBAAIlB,KAAEiD,MAAG/B,KAAEyK,MAAG,IAAG3L,MAAG,GAAEA,MAAGiD;AAAE,cAAAd,KAAEoK,KAAED,KAAEvJ,KAAEoB,KAAE,QAAOpB,MAAGoB,MAAGnC,KAAEhC,MAAGgC,MAAGA,IAAEG,KAAE,KAAGmK,KAAE,IAAEtK,MAAGmC,IAAEjD,OAAIC,KAAE,EAAC,IAAGoL,KAAED,KAAEA,KAAE,IAAEtK,MAAGlC,GAAE,CAAC,IAAEqC,KAAErC,GAAE,CAAC,IAAEiD,IAAE,GAAEwJ,KAAEzM,GAAE,CAAC,IAAEqC,KAAErC,GAAE,CAAC,IAAEiD,GAAC,GAAG,MAAIzC,GAAE,KAAKkM,GAAErL,GAAE,GAAEA,GAAE,CAAC,CAAC,GAAED,MAAGyK;AAAG,UAAArL,GAAE,KAAKkM,GAAE,GAAE,CAAC,CAAC;AAAA,QAAC;AAAC,eAAOvL,KAAE,EAAC,QAAOqB,IAAE,eAAc3C,IAAE,UAASiD,IAAE,OAAMnD,IAAE,QAAOa,IAAE,SAAQ,CAAC,CAAC8H,GAAC,GAAE,EAAE,KAAKnH,EAAC,GAAE,UAAKkC,MAAG,GAAGlC,IAAEkC,EAAC,GAAEb;AAAA,MAAC,GAAE,QAAO,SAASrC,IAAE;AAAC,YAAIR;AAAE,UAAE,KAAK,SAASE,IAAEiD,IAAE;AAAC,iBAAOjD,GAAE,WAASM,OAAIR,KAAEmD,IAAE,EAAEjD,GAAE,cAAY;AAAA,QAAM,CAAC,KAAG,EAAE,OAAOF,IAAE,CAAC;AAAA,MAAC,GAAE,OAAM,SAASmD,IAAE3C,IAAER,IAAE;AAAC,UAAE,KAAK,SAASE,IAAE;AAAC,iBAAOA,GAAE,WAASiD,OAAIjD,GAAE,UAAQ,CAAC,CAACM,IAAE,GAAGN,IAAEF,EAAC,GAAE;AAAA,QAAG,CAAC;AAAA,MAAC,GAAE,MAAK,SAASmD,IAAE3C,IAAE;AAAC,YAAIR;AAAE,eAAO,EAAE,KAAK,SAASE,IAAE;AAAC,iBAAOA,GAAE,WAASiD,OAAI3C,KAAE,QAAMN,GAAE,cAAYF,KAAEE,GAAE,OAAOA,GAAE,SAAS,EAAE,cAAYF,MAAG,KAAK,IAAK,IAACE,GAAE,eAAaA,GAAE,UAASA,GAAE,YAAUF,KAAE,IAAEA,KAAGA,KAAE,IAAEA,KAAE,IAAE,IAAEA,OAAIA,KAAE,KAAI,EAAEE,GAAE,cAAY;AAAA,QAAM,CAAC,GAAEF;AAAA,MAAC,GAAE,aAAY,SAASmD,IAAE;AAAC,eAAM,YAAU,OAAOA,KAAEhD,GAAEgD,EAAC,IAAE,MAAM,QAAQA,EAAC,KAAG,CAAC,GAAE,GAAE,GAAE,CAAC,EAAE,MAAM,SAASjD,IAAE;AAAC,iBAAOG,GAAE8C,GAAEjD,EAAC,CAAC,KAAG,KAAGiD,GAAEjD,EAAC,KAAGiD,GAAEjD,EAAC,KAAG;AAAA,QAAC,CAAC,IAAE,CAACiD,GAAE,CAAC,GAAEA,GAAE,CAAC,GAAEA,GAAE,CAAC,GAAEA,GAAE,CAAC,CAAC,IAAE;AAAA,MAAI,EAAC,IAAGT,KAAE,SAASxC,IAAE;AAAC,QAAAA,GAAE,eAAe,UAAU,eAAaA,GAAE,eAAe,UAAU,eAAa,WAAU;AAAC,mBAASG,GAAEH,IAAE;AAAC,iBAAK,UAAQA,IAAE,KAAK,gBAAc,GAAE,KAAK,YAAU,KAAK,QAAQ,QAAO,KAAK,eAAa,MAAK,KAAK,oBAAqB;AAAA,UAAA;AAAC,cAAIyI,KAAE,EAAC,GAAE,KAAI,GAAE,KAAI,GAAE,KAAI,GAAE,KAAI,GAAE,KAAI,GAAE,KAAI,GAAE,KAAI,GAAE,KAAI,GAAE,KAAI,GAAE,KAAI,GAAE,KAAI,GAAE,KAAI,GAAE,KAAI,GAAE,KAAI,GAAE,KAAI,GAAE,KAAI,GAAE,KAAI,GAAE,KAAI,GAAE,KAAI,GAAE,IAAG,GAAEjF,KAAE,OAAKxD,GAAE,UAAU,UAAU,QAAQ,OAAO;AAAE,UAAAG,GAAE,YAAU,EAAC,cAAa,WAAU;AAAC,gBAAIH,KAAE,KAAK,QAAQ,KAAK,aAAa,GAAEiD,KAAEwF,GAAEzI,EAAC,IAAEyI,GAAEzI,EAAC,IAAE;AAAK,gBAAG,SAAOiD,IAAE;AAAC,kBAAG,SAAO,KAAK;AAAa,uBAAO;AAAK,kBAAG,UAAQA,MAAG,QAAMjD,MAAG,QAAMA,MAAG,QAAMA,MAAG,OAAKA,MAAGA,MAAG,QAAM,QAAM,KAAK,eAAa,QAAM,KAAK,eAAa,MAAI,QAAM,KAAK,eAAa,MAAI,KAAK,eAAa;AAAM,uBAAO;AAAA,YAAI;AAAM,mBAAK,iBAAe;AAAE,gBAAIM,KAAE,MAAKR,MAAG,KAAK,eAAamD,IAAG,YAAW;AAAG,mBAAM,QAAMnD,MAAG,QAAMA,KAAEQ,KAAE,CAAC,KAAK,aAAc,CAAA,IAAE,QAAMR,MAAG,QAAMA,MAAG,QAAMA,KAAEQ,KAAE,CAAC,KAAK,aAAY,GAAG,KAAK,aAAY,CAAE,IAAE,QAAMR,MAAG,QAAMA,KAAEQ,KAAE,CAAC,KAAK,gBAAe,KAAK,gBAAe,KAAK,aAAY,GAAG,KAAK,aAAY,CAAE,IAAE,QAAMR,KAAEQ,KAAE,CAAC,KAAK,aAAY,GAAG,KAAK,aAAc,GAAC,KAAK,aAAc,GAAC,KAAK,aAAc,GAAC,KAAK,aAAc,GAAC,KAAK,aAAc,CAAA,IAAE,QAAMR,KAAEQ,KAAE,CAAC,KAAK,aAAY,GAAG,KAAK,aAAc,GAAC,KAAK,aAAc,GAAC,KAAK,cAAe,GAAC,KAAK,cAAe,GAAC,KAAK,gBAAe,KAAK,aAAY,CAAE,IAAE,QAAMR,OAAI,KAAK,oBAAmB,GAAGQ,KAAE,CAAE,IAAE,SAAOA,MAAG,KAAGA,GAAE,QAAQ,IAAI,IAAE,OAAK,EAAC,MAAK2C,IAAE,QAAO3C,GAAC;AAAA,UAAC,GAAE,aAAY,WAAU;AAAC,mBAAO,KAAK,gBAAc,KAAK;AAAA,UAAS,GAAE,iBAAgB,WAAU;AAAC,gBAAIN,KAAE,KAAK,QAAQ,KAAK,aAAa;AAAE,mBAAOyI,GAAEzI,EAAC,IAAEyI,GAAEzI,EAAC,IAAE;AAAA,UAAI,GAAE,wBAAuB,WAAU;AAAC,gBAAG,CAAC,KAAK;AAAc,qBAAM;AAAG,gBAAIA,KAAE,KAAK,gBAAiB;AAAC,mBAAM,QAAMA,MAAG,QAAMA;AAAA,UAAC,GAAE,iBAAgB,WAAU;AAAC,gBAAIA,KAAE,KAAK,QAAQ,KAAK,aAAa;AAAE,mBAAOA,MAAG,QAAM,QAAMA,MAAG,SAAOA,MAAG,QAAOA,MAAG,SAAOA,MAAG,SAAOA;AAAA,UAAE,GAAE,qBAAoB,WAAU;AAAC,mBAAK,KAAK,gBAAc,KAAK,aAAW,KAAK;AAAmB,mBAAK,iBAAe;AAAE,mBAAO,KAAK,gBAAc,KAAK;AAAA,UAAS,GAAE,gCAA+B,WAAU;AAAC,mBAAM,EAAE,KAAK,gBAAc,KAAK,aAAW,CAAC,KAAK,qBAAmB,QAAM,KAAK,QAAQ,KAAK,aAAa,OAAK,KAAK,oBAAqB,KAAE,KAAK,gBAAc,KAAK,aAAW,QAAM,KAAK,QAAQ,KAAK,aAAa,MAAI,KAAK,iBAAe,GAAE,KAAK,wBAAuB,KAAK,gBAAc,KAAK;AAAA,UAAU,GAAE,cAAa,WAAU;AAAC,gBAAIA,KAAE,GAAEiD,KAAE,GAAE3C,KAAE,GAAER,KAAE,GAAEK,KAAE,GAAEsI,KAAE,GAAEjF,KAAE,KAAK;AAAc,gBAAG,KAAK,uBAAsB,KAAK,gBAAc,KAAK,aAAW,QAAM,KAAK,QAAQ,KAAK,aAAa,IAAE,KAAK,iBAAe,IAAE,KAAK,gBAAc,KAAK,aAAW,QAAM,KAAK,QAAQ,KAAK,aAAa,MAAI,KAAK,iBAAe,GAAErD,KAAE,KAAI,KAAK,kBAAgB,KAAK,cAAY,KAAK,QAAQ,KAAK,aAAa,IAAE,OAAK,MAAI,KAAK,QAAQ,KAAK,aAAa,MAAI,QAAM,KAAK,QAAQ,KAAK,aAAa;AAAE,qBAAO;AAAK,qBAAQmB,KAAE,KAAK,eAAc,KAAK,gBAAc,KAAK,aAAW,OAAK,KAAK,QAAQ,KAAK,aAAa,KAAG,KAAK,QAAQ,KAAK,aAAa,KAAG;AAAK,mBAAK,iBAAe;AAAE,gBAAG,KAAK,kBAAgBA;AAAE,uBAAQX,KAAE,KAAK,gBAAc,GAAEqL,KAAE,GAAE1K,MAAGX;AAAG,gBAAAsC,MAAG+I,MAAG,KAAK,QAAQrL,EAAC,IAAE,MAAK,EAAEA,IAAEqL,MAAG;AAAG,gBAAG,KAAK,gBAAc,KAAK,aAAW,QAAM,KAAK,QAAQ,KAAK,aAAa,GAAE;AAAC,kBAAG,KAAK,iBAAe,GAAE,KAAK,iBAAe,KAAK,aAAW,KAAK,QAAQ,KAAK,aAAa,IAAE,OAAK,MAAI,KAAK,QAAQ,KAAK,aAAa;AAAE,uBAAO;AAAK,qBAAK,KAAK,gBAAc,KAAK,aAAW,OAAK,KAAK,QAAQ,KAAK,aAAa,KAAG,KAAK,QAAQ,KAAK,aAAa,KAAG;AAAK,gBAAA1L,MAAG,IAAGR,OAAI,KAAK,QAAQ,OAAO,KAAK,aAAa,IAAE,OAAKQ,IAAE,KAAK,iBAAe;AAAA,YAAC;AAAC,gBAAG,KAAK,kBAAgBkD,MAAG,KAAK,gBAAc,IAAE,KAAK,cAAY,QAAM,KAAK,QAAQ,KAAK,aAAa,KAAG,QAAM,KAAK,QAAQ,KAAK,aAAa,MAAI,QAAM,KAAK,QAAQ,KAAK,gBAAc,CAAC,KAAG,QAAM,KAAK,QAAQ,KAAK,gBAAc,CAAC,GAAE;AAAC,kBAAG,KAAK,iBAAe,GAAE,QAAM,KAAK,QAAQ,KAAK,aAAa,IAAE,KAAK,iBAAe,IAAE,QAAM,KAAK,QAAQ,KAAK,aAAa,MAAI,KAAK,iBAAe,GAAEiF,KAAE,KAAI,KAAK,iBAAe,KAAK,aAAW,KAAK,QAAQ,KAAK,aAAa,IAAE,OAAK,MAAI,KAAK,QAAQ,KAAK,aAAa;AAAE,uBAAO;AAAK,qBAAK,KAAK,gBAAc,KAAK,aAAW,OAAK,KAAK,QAAQ,KAAK,aAAa,KAAG,KAAK,QAAQ,KAAK,aAAa,KAAG;AAAK,gBAAAzI,MAAG,IAAGA,MAAG,KAAK,QAAQ,KAAK,aAAa,IAAE,KAAI,KAAK,iBAAe;AAAA,YAAC;AAAC,gBAAIsD,KAAEL,KAAEnD;AAAE,mBAAOwD,MAAGnD,IAAEH,OAAIsD,MAAG,KAAK,IAAI,IAAGmF,KAAEzI,EAAC,IAAGwD,OAAI,KAAK,gBAAc,QAAM,KAAK,+BAAgC,GAACF;AAAA,UAAE,GAAE,eAAc,WAAU;AAAC,gBAAG,KAAK,iBAAe,KAAK;AAAU,qBAAO;AAAK,gBAAItD,KAAE,MAAKiD,KAAE,KAAK,QAAQ,KAAK,aAAa;AAAE,gBAAG,KAAK,iBAAe,GAAE,QAAMA;AAAE,cAAAjD,KAAE;AAAA,iBAAM;AAAC,kBAAG,QAAMiD;AAAE,uBAAO;AAAK,cAAAjD,KAAE;AAAA,YAAC;AAAC,mBAAO,KAAK,+BAAgC,GAACA;AAAA,UAAC,EAAC;AAAE,mBAASF,GAAEE,IAAE;AAAC,gBAAG,CAACA,MAAG,MAAIA,GAAE;AAAO,qBAAM,CAAA;AAAG,gBAAIiD,KAAE,IAAI9C,GAAEH,EAAC,GAAEM,KAAE,CAAE;AAAC,gBAAG2C,GAAE,uBAAsB;AAAG,qBAAKA,GAAE,YAAa,KAAE;AAAC,oBAAInD,KAAEmD,GAAE,aAAc;AAAC,oBAAG,SAAOnD;AAAE;AAAM,gBAAAQ,GAAE,KAAKR,EAAC;AAAA,cAAC;AAAC,mBAAOQ;AAAA,UAAC;AAAC,mBAASgB,GAAEtB,IAAE;AAAC,mBAAOA,GAAE,IAAI,SAASA,IAAE;AAAC,qBAAM,EAAC,MAAKA,GAAE,MAAK,QAAO,MAAM,UAAU,MAAM,KAAKA,GAAE,MAAM,EAAC;AAAA,YAAC,CAAC;AAAA,UAAC;AAAC,mBAASwB,GAAExB,IAAE;AAAC,gBAAIoD,KAAE,CAAA,GAAGuJ,KAAE,MAAKC,KAAE,MAAKpK,KAAE,MAAKG,KAAE,MAAKkK,KAAE,MAAK5M,KAAE,MAAKmB,KAAE;AAAK,mBAAOpB,GAAE,QAAQ,SAASA,IAAE;AAAC,kBAAIiD,IAAE3C,IAAER,IAAEK,IAAEsI,IAAEjF,IAAElC,IAAEX,IAAEqL,IAAE1I,IAAE/B,IAAElB,IAAEmB,IAAEa,IAAEmC;AAAE,sBAAMxE,GAAE,QAAMqC,KAAErC,GAAE,OAAO,CAAC,GAAEwE,KAAExE,GAAE,OAAO,CAAC,GAAEoD,GAAE,KAAK,EAAC,MAAK,KAAI,QAAO,CAACf,IAAEmC,EAAC,EAAC,CAAC,GAAE7B,KAAE1C,KAAEoC,IAAEwK,KAAEzL,KAAEoD,MAAG,QAAMxE,GAAE,QAAMF,KAAEE,GAAE,OAAO,CAAC,GAAEG,KAAEH,GAAE,OAAO,CAAC,GAAEiD,KAAEjD,GAAE,OAAO,CAAC,GAAEM,KAAEN,GAAE,OAAO,CAAC,GAAEqC,KAAErC,GAAE,OAAO,CAAC,GAAEwE,KAAExE,GAAE,OAAO,CAAC,GAAEoD,GAAE,KAAK,EAAC,MAAK,KAAI,QAAO,CAACtD,IAAEK,IAAE8C,IAAE3C,IAAE+B,IAAEmC,EAAC,EAAC,CAAC,GAAEoI,KAAE3J,IAAET,KAAElC,IAAEqC,KAAEN,IAAEwK,KAAErI,MAAG,QAAMxE,GAAE,QAAMqC,KAAErC,GAAE,OAAO,CAAC,GAAEwE,KAAExE,GAAE,OAAO,CAAC,GAAEoD,GAAE,KAAK,EAAC,MAAK,KAAI,QAAO,CAACf,IAAEmC,EAAC,EAAC,CAAC,GAAE7B,KAAEN,IAAEwK,KAAErI,MAAG,QAAMxE,GAAE,QAAMqC,KAAErC,GAAE,OAAO,CAAC,GAAEoD,GAAE,KAAK,EAAC,MAAK,KAAI,QAAO,CAACf,IAAEwK,EAAC,EAAC,CAAC,GAAElK,KAAEN,MAAG,QAAMrC,GAAE,QAAMwE,KAAExE,GAAE,OAAO,CAAC,GAAEoD,GAAE,KAAK,EAAC,MAAK,KAAI,QAAO,CAACT,IAAE6B,EAAC,EAAC,CAAC,GAAEqI,KAAErI,MAAG,QAAMxE,GAAE,QAAMiD,KAAEjD,GAAE,OAAO,CAAC,GAAEM,KAAEN,GAAE,OAAO,CAAC,GAAEqC,KAAErC,GAAE,OAAO,CAAC,GAAEwE,KAAExE,GAAE,OAAO,CAAC,GAAEwD,KAAE,QAAMmJ,MAAG,QAAMA,MAAGlE,KAAE9F,MAAGA,KAAEiK,KAAGC,MAAGA,KAAErK,QAAKiG,KAAE9F,IAAEkK,KAAGzJ,GAAE,KAAK,EAAC,MAAK,KAAI,QAAO,CAACqF,IAAEjF,IAAEP,IAAE3C,IAAE+B,IAAEmC,EAAC,EAAC,CAAC,GAAEoI,KAAE3J,IAAET,KAAElC,IAAEqC,KAAEN,IAAEwK,KAAErI,MAAG,QAAMxE,GAAE,QAAMqC,KAAErC,GAAE,OAAO,CAAC,GAAEwE,KAAExE,GAAE,OAAO,CAAC,GAAEG,KAAE,QAAMwM,MAAG,QAAMA,MAAG7M,KAAE6C,MAAGA,KAAEiK,KAAGC,MAAGA,KAAErK,QAAK1C,KAAE6C,IAAEkK,KAAGpE,KAAE9F,KAAE,KAAG7C,KAAE6C,MAAG,GAAEa,KAAEqJ,KAAE,KAAG1M,KAAE0M,MAAG,GAAEvL,KAAEe,KAAE,KAAGvC,KAAEuC,MAAG,GAAE1B,KAAE6D,KAAE,KAAGrE,KAAEqE,MAAG,GAAEpB,GAAE,KAAK,EAAC,MAAK,KAAI,QAAO,CAACqF,IAAEjF,IAAElC,IAAEX,IAAE0B,IAAEmC,EAAC,EAAC,CAAC,GAAEoI,KAAE9M,IAAE0C,KAAErC,IAAEwC,KAAEN,IAAEwK,KAAErI,MAAG,QAAMxE,GAAE,QAAMF,KAAEE,GAAE,OAAO,CAAC,GAAEG,KAAEH,GAAE,OAAO,CAAC,GAAEqC,KAAErC,GAAE,OAAO,CAAC,GAAEwE,KAAExE,GAAE,OAAO,CAAC,GAAEyI,KAAE9F,KAAE,KAAG7C,KAAE6C,MAAG,GAAEa,KAAEqJ,KAAE,KAAG1M,KAAE0M,MAAG,GAAEvL,KAAEe,KAAE,KAAGvC,KAAEuC,MAAG,GAAE1B,KAAE6D,KAAE,KAAGrE,KAAEqE,MAAG,GAAEpB,GAAE,KAAK,EAAC,MAAK,KAAI,QAAO,CAACqF,IAAEjF,IAAElC,IAAEX,IAAE0B,IAAEmC,EAAC,EAAC,CAAC,GAAEoI,KAAE9M,IAAE0C,KAAErC,IAAEwC,KAAEN,IAAEwK,KAAErI,MAAG,QAAMxE,GAAE,QAAMgM,KAAEhM,GAAE,OAAO,CAAC,GAAEsD,KAAEtD,GAAE,OAAO,CAAC,GAAEuB,KAAEvB,GAAE,OAAO,CAAC,GAAEK,KAAEL,GAAE,OAAO,CAAC,GAAEwB,KAAExB,GAAE,OAAO,CAAC,GAAEqC,KAAErC,GAAE,OAAO,CAAC,GAAEwE,KAAExE,GAAE,OAAO,CAAC,GAAE,MAAIgM,MAAG,MAAI1I,MAAGF,GAAE,KAAK,EAAC,MAAK,KAAI,QAAO,CAACT,IAAEkK,IAAExK,IAAEmC,IAAEnC,IAAEmC,EAAC,EAAC,CAAC,GAAE7B,KAAEN,IAAEwK,KAAErI,MAAG7B,OAAIN,MAAGwK,OAAIrI,MAAGsI,GAAEnK,IAAEkK,IAAExK,IAAEmC,IAAEwH,IAAE1I,IAAE/B,IAAElB,IAAEmB,EAAC,EAAE,QAAQ,SAASxB,IAAE;AAAC,gBAAAoD,GAAE,KAAK,EAAC,MAAK,KAAI,QAAOpD,GAAC,CAAC,GAAE2C,KAAEN,IAAEwK,KAAErI;AAAA,cAAC,CAAC,KAAG,QAAMxE,GAAE,SAAOoD,GAAE,KAAKpD,EAAC,GAAE2C,KAAE1C,IAAE4M,KAAEzL,KAAGuL,KAAE3M,GAAE;AAAA,YAAI,CAAC,GAAEoD;AAAA,UAAC;AAAC,cAAI9C,KAAEN,GAAE,eAAe,UAAU,cAAaW,KAAEX,GAAE,eAAe,UAAU,iBAAgBqC,KAAErC,GAAE,SAAOA,GAAE,OAAM,IAAG,oBAAmBwE,KAAExE,GAAE,SAAOA,GAAE,OAAM,IAAG,8BAA6B8M,KAAE,SAAS9M,IAAEiD,IAAE3C,IAAER,IAAEK,IAAEsI,IAAEjF,IAAElC,IAAEX,IAAEqL,IAAE;AAAC,qBAAS1I,GAAEtD,IAAEiD,IAAE3C,IAAE;AAAC,qBAAM,EAAC,GAAEN,KAAE,KAAK,IAAIM,EAAC,IAAE2C,KAAE,KAAK,IAAI3C,EAAC,GAAE,GAAEN,KAAE,KAAK,IAAIM,EAAC,IAAE2C,KAAE,KAAK,IAAI3C,EAAC,EAAC;AAAA,YAAC;AAAC,gBAAIiB,IAAElB,IAAEmB,IAAEa,IAAEmC,IAAEpB,IAAEuJ,IAAEC,IAAEpK,IAAEG,IAAEkK,IAAE5M,IAAEmB,IAAE2L,IAAE/J,IAAEgK,MAAGzL,KAAEiC,IAAE,KAAK,KAAGjC,KAAE,MAAKuK,KAAE,CAAA;AAAG,YAAAE,MAAGe,KAAEf,GAAE,CAAC,GAAEhJ,KAAEgJ,GAAE,CAAC,GAAE/L,KAAE+L,GAAE,CAAC,GAAE5K,KAAE4K,GAAE,CAAC,MAAIhM,MAAGK,KAAEiD,GAAEtD,IAAEiD,IAAE,CAAC+J,EAAC,GAAG,GAAE/J,KAAE5C,GAAE,GAAE,KAAG+C,MAAGf,MAAGrC,MAAGM,MAAGkB,KAAE8B,GAAEhD,IAAER,IAAE,CAACkN,EAAC,GAAG,MAAI,KAAG3K,MAAGlC,KAAEA,OAAIqE,MAAGvB,MAAGnD,KAAE0B,GAAE,MAAI,KAAGgD,MAAGiE,KAAEA,SAAMtI,MAAGiD,KAAE,KAAK,KAAKA,EAAC,GAAEqF,MAAGrF,KAAGZ,MAAGmK,KAAExM,KAAEA,OAAIyM,KAAEnE,KAAEA,MAAGkE,KAAEnI,KAAEA,KAAEoI,KAAEvK,KAAEA,IAAEM,KAAEgK,KAAEnI,KAAEA,KAAEoI,KAAEvK,KAAEA,IAAEpC,MAAG4M,MAAGvL,OAAIX,KAAE,KAAG,KAAG,KAAK,KAAK,KAAK,IAAI6B,KAAEG,EAAC,CAAC,KAAGxC,KAAEqE,KAAEiE,MAAGzI,KAAEM,MAAG,GAAEc,KAAEyL,KAAE,CAACpE,KAAEpG,KAAElC,MAAG8C,KAAEnD,MAAG,GAAEiN,KAAE,KAAK,KAAK,aAAa9J,KAAE7B,MAAGqH,IAAG,QAAQ,CAAC,CAAC,CAAC,GAAEzF,KAAE,KAAK,KAAK,aAAalD,KAAEsB,MAAGqH,IAAG,QAAQ,CAAC,CAAC,CAAC,GAAEzI,KAAEC,OAAI8M,KAAE,KAAK,KAAGA,KAAGzM,KAAEL,OAAI+C,KAAE,KAAK,KAAGA,KAAG+J,KAAE,MAAIA,KAAE,IAAE,KAAK,KAAGA,KAAG/J,KAAE,MAAIA,KAAE,IAAE,KAAK,KAAGA,KAAGrC,MAAGqC,KAAE+J,OAAIA,MAAG,IAAE,KAAK,KAAI,CAACpM,MAAGoM,KAAE/J,OAAIA,MAAG,IAAE,KAAK;AAAK,gBAAIiK,IAAE5I,IAAE0H,IAAEmB,KAAElK,KAAE+J;AAAE,iBAAK,IAAIG,EAAC,IAAE,MAAI,KAAK,KAAG,QAAMD,KAAEjK,IAAEqB,KAAE/D,IAAEyL,KAAEjM,IAAEkD,KAAErC,MAAGoM,KAAE/J,KAAE+J,KAAE,MAAI,KAAK,KAAG,MAAI,IAAEA,KAAE,MAAI,KAAK,KAAG,MAAI,IAAGzM,KAAEL,KAAEE,KAAE,KAAK,IAAI6C,EAAC,GAAElD,KAAEsB,KAAEqH,KAAE,KAAK,IAAIzF,EAAC,GAAE8I,KAAEgB,GAAExM,IAAER,IAAEuE,IAAE0H,IAAE5L,IAAEsI,IAAEjF,IAAE,GAAE7C,IAAE,CAACqC,IAAEiK,IAAEhN,IAAEmB,EAAC,CAAC,IAAG8L,KAAElK,KAAE+J;AAAE,gBAAId,KAAE,KAAK,IAAIc,EAAC,GAAEb,KAAE,KAAK,IAAIa,EAAC,GAAEI,KAAE,KAAK,IAAInK,EAAC,GAAEmJ,KAAE,KAAK,IAAInJ,EAAC,GAAEoJ,KAAE,KAAK,IAAIc,KAAE,CAAC,GAAEb,KAAE,IAAE,IAAElM,KAAEiM,IAAEE,KAAE,IAAE,IAAE7D,KAAE2D,IAAEG,KAAE,CAACvM,IAAEiD,EAAC,GAAEmK,KAAE,CAACpN,KAAEqM,KAAEH,IAAEjJ,KAAEqJ,KAAEL,EAAC,GAAEO,KAAE,CAAClM,KAAE+L,KAAEF,IAAErM,KAAEwM,KAAEa,EAAC,GAAEV,KAAE,CAACnM,IAAER,EAAC;AAAE,gBAAGsN,GAAE,CAAC,IAAE,IAAEb,GAAE,CAAC,IAAEa,GAAE,CAAC,GAAEA,GAAE,CAAC,IAAE,IAAEb,GAAE,CAAC,IAAEa,GAAE,CAAC,GAAEpB;AAAE,qBAAM,CAACoB,IAAEZ,IAAEC,EAAC,EAAE,OAAOX,EAAC;AAAE,YAAAA,KAAE,CAACsB,IAAEZ,IAAEC,EAAC,EAAE,OAAOX,EAAC,EAAE,KAAM,EAAC,MAAM,GAAG;AAAE,gBAAIuB,KAAE,IAAGX,KAAE,CAAE;AAAC,mBAAOZ,GAAE,QAAQ,SAAS9L,IAAEiD,IAAE;AAAC,cAAAA,KAAE,IAAEyJ,GAAE,KAAKpJ,GAAEwI,GAAE7I,KAAE,CAAC,GAAE6I,GAAE7I,EAAC,GAAE+J,EAAC,EAAE,CAAC,IAAEN,GAAE,KAAKpJ,GAAEwI,GAAE7I,EAAC,GAAE6I,GAAE7I,KAAE,CAAC,GAAE+J,EAAC,EAAE,CAAC,GAAE,MAAIN,GAAE,WAASW,GAAE,KAAKX,EAAC,GAAEA,KAAE,CAAE;AAAA,YAAC,CAAC,GAAEW;AAAA,UAAC;AAAE,UAAArN,GAAE,eAAe,UAAU,eAAa,SAASA,IAAEiD,IAAE;AAAC,oBAAMjD,OAAI,KAAKqC,EAAC,IAAE,MAAK,KAAKmC,EAAC,IAAE,OAAMlE,GAAE,KAAK,MAAKN,IAAEiD,EAAC;AAAA,UAAC,GAAEjD,GAAE,eAAe,UAAU,kBAAgB,SAASA,IAAEiD,IAAE;AAAC,oBAAMjD,OAAI,KAAKqC,EAAC,IAAE,MAAK,KAAKmC,EAAC,IAAE,OAAM7D,GAAE,KAAK,MAAKX,EAAC;AAAA,UAAC,GAAEA,GAAE,eAAe,UAAU,cAAY,SAASA,IAAE;AAAC,gBAAGA,MAAGA,GAAE,WAAU;AAAC,kBAAG,KAAKwE,EAAC;AAAE,uBAAOlD,GAAE,KAAKkD,EAAC,CAAC;AAAE,mBAAKnC,EAAC,IAAE/B,KAAEgB,GAAE,KAAKe,EAAC,CAAC,KAAG/B,KAAER,GAAE,KAAK,aAAa,GAAG,KAAG,EAAE,GAAE,KAAKuC,EAAC,IAAEf,GAAEhB,EAAC;AAAG,kBAAI2C,KAAEzB,IAAGb,KAAE,IAAGN,KAAEkB,KAAE+B,KAAE0I,KAAE,MAAK1L,GAAE,QAAQ,SAASN,IAAE;AAAC,oBAAIiD,IAAE3C,IAAER,IAAEK,IAAEsI,IAAEjF,IAAElC,KAAEtB,GAAE;AAAK,wBAAMsB,MAAGmH,KAAEzI,GAAE,OAAO,CAAC,GAAEwD,KAAExD,GAAE,OAAO,CAAC,GAAEW,GAAE,KAAK,EAAC,MAAK,KAAI,QAAO,CAAC8H,IAAEjF,EAAC,EAAC,CAAC,GAAEwI,KAAEzK,KAAEkH,IAAEnF,KAAEjD,KAAEmD,MAAG,QAAMlC,MAAGmH,KAAEuD,KAAEhM,GAAE,OAAO,CAAC,GAAEwD,KAAEF,KAAEtD,GAAE,OAAO,CAAC,GAAEW,GAAE,KAAK,EAAC,MAAK,KAAI,QAAO,CAAC8H,IAAEjF,EAAC,EAAC,CAAC,GAAEwI,KAAEzK,KAAEkH,IAAEnF,KAAEjD,KAAEmD,MAAG,QAAMlC,MAAGmH,KAAEzI,GAAE,OAAO,CAAC,GAAEwD,KAAExD,GAAE,OAAO,CAAC,GAAEW,GAAE,KAAK,EAAC,MAAK,KAAI,QAAO,CAAC8H,IAAEjF,EAAC,EAAC,CAAC,GAAEwI,KAAEvD,IAAEnF,KAAEE,MAAG,QAAMlC,MAAGmH,KAAEuD,KAAEhM,GAAE,OAAO,CAAC,GAAEwD,KAAEF,KAAEtD,GAAE,OAAO,CAAC,GAAEW,GAAE,KAAK,EAAC,MAAK,KAAI,QAAO,CAAC8H,IAAEjF,EAAC,EAAC,CAAC,GAAEwI,KAAEvD,IAAEnF,KAAEE,MAAG,QAAMlC,MAAG2B,KAAEjD,GAAE,OAAO,CAAC,GAAEM,KAAEN,GAAE,OAAO,CAAC,GAAEF,KAAEE,GAAE,OAAO,CAAC,GAAEG,KAAEH,GAAE,OAAO,CAAC,GAAEyI,KAAEzI,GAAE,OAAO,CAAC,GAAEwD,KAAExD,GAAE,OAAO,CAAC,GAAEW,GAAE,KAAK,EAAC,MAAK,KAAI,QAAO,CAACsC,IAAE3C,IAAER,IAAEK,IAAEsI,IAAEjF,EAAC,EAAC,CAAC,GAAEwI,KAAEvD,IAAEnF,KAAEE,MAAG,QAAMlC,MAAG2B,KAAE+I,KAAEhM,GAAE,OAAO,CAAC,GAAEM,KAAEgD,KAAEtD,GAAE,OAAO,CAAC,GAAEF,KAAEkM,KAAEhM,GAAE,OAAO,CAAC,GAAEG,KAAEmD,KAAEtD,GAAE,OAAO,CAAC,GAAEyI,KAAEuD,KAAEhM,GAAE,OAAO,CAAC,GAAEwD,KAAEF,KAAEtD,GAAE,OAAO,CAAC,GAAEW,GAAE,KAAK,EAAC,MAAK,KAAI,QAAO,CAACsC,IAAE3C,IAAER,IAAEK,IAAEsI,IAAEjF,EAAC,EAAC,CAAC,GAAEwI,KAAEvD,IAAEnF,KAAEE,MAAG,QAAMlC,MAAG2B,KAAEjD,GAAE,OAAO,CAAC,GAAEM,KAAEN,GAAE,OAAO,CAAC,GAAEyI,KAAEzI,GAAE,OAAO,CAAC,GAAEwD,KAAExD,GAAE,OAAO,CAAC,GAAEW,GAAE,KAAK,EAAC,MAAK,KAAI,QAAO,CAACsC,IAAE3C,IAAEmI,IAAEjF,EAAC,EAAC,CAAC,GAAEwI,KAAEvD,IAAEnF,KAAEE,MAAG,QAAMlC,MAAG2B,KAAE+I,KAAEhM,GAAE,OAAO,CAAC,GAAEM,KAAEgD,KAAEtD,GAAE,OAAO,CAAC,GAAEyI,KAAEuD,KAAEhM,GAAE,OAAO,CAAC,GAAEwD,KAAEF,KAAEtD,GAAE,OAAO,CAAC,GAAEW,GAAE,KAAK,EAAC,MAAK,KAAI,QAAO,CAACsC,IAAE3C,IAAEmI,IAAEjF,EAAC,EAAC,CAAC,GAAEwI,KAAEvD,IAAEnF,KAAEE,MAAG,QAAMlC,MAAGmH,KAAEzI,GAAE,OAAO,CAAC,GAAEwD,KAAExD,GAAE,OAAO,CAAC,GAAEW,GAAE,KAAK,EAAC,MAAK,KAAI,QAAO,CAACX,GAAE,OAAO,CAAC,GAAEA,GAAE,OAAO,CAAC,GAAEA,GAAE,OAAO,CAAC,GAAEA,GAAE,OAAO,CAAC,GAAEA,GAAE,OAAO,CAAC,GAAEyI,IAAEjF,EAAC,EAAC,CAAC,GAAEwI,KAAEvD,IAAEnF,KAAEE,MAAG,QAAMlC,MAAGmH,KAAEuD,KAAEhM,GAAE,OAAO,CAAC,GAAEwD,KAAEF,KAAEtD,GAAE,OAAO,CAAC,GAAEW,GAAE,KAAK,EAAC,MAAK,KAAI,QAAO,CAACX,GAAE,OAAO,CAAC,GAAEA,GAAE,OAAO,CAAC,GAAEA,GAAE,OAAO,CAAC,GAAEA,GAAE,OAAO,CAAC,GAAEA,GAAE,OAAO,CAAC,GAAEyI,IAAEjF,EAAC,EAAC,CAAC,GAAEwI,KAAEvD,IAAEnF,KAAEE,MAAG,QAAMlC,MAAGmH,KAAEzI,GAAE,OAAO,CAAC,GAAEW,GAAE,KAAK,EAAC,MAAK,KAAI,QAAO,CAAC8H,EAAC,EAAC,CAAC,GAAEuD,KAAEvD,MAAG,QAAMnH,MAAGmH,KAAEuD,KAAEhM,GAAE,OAAO,CAAC,GAAEW,GAAE,KAAK,EAAC,MAAK,KAAI,QAAO,CAAC8H,EAAC,EAAC,CAAC,GAAEuD,KAAEvD,MAAG,QAAMnH,MAAGkC,KAAExD,GAAE,OAAO,CAAC,GAAEW,GAAE,KAAK,EAAC,MAAK,KAAI,QAAO,CAAC6C,EAAC,EAAC,CAAC,GAAEF,KAAEE,MAAG,QAAMlC,MAAGkC,KAAEF,KAAEtD,GAAE,OAAO,CAAC,GAAEW,GAAE,KAAK,EAAC,MAAK,KAAI,QAAO,CAAC6C,EAAC,EAAC,CAAC,GAAEF,KAAEE,MAAG,QAAMlC,MAAGxB,KAAEE,GAAE,OAAO,CAAC,GAAEG,KAAEH,GAAE,OAAO,CAAC,GAAEyI,KAAEzI,GAAE,OAAO,CAAC,GAAEwD,KAAExD,GAAE,OAAO,CAAC,GAAEW,GAAE,KAAK,EAAC,MAAK,KAAI,QAAO,CAACb,IAAEK,IAAEsI,IAAEjF,EAAC,EAAC,CAAC,GAAEwI,KAAEvD,IAAEnF,KAAEE,MAAG,QAAMlC,MAAGxB,KAAEkM,KAAEhM,GAAE,OAAO,CAAC,GAAEG,KAAEmD,KAAEtD,GAAE,OAAO,CAAC,GAAEyI,KAAEuD,KAAEhM,GAAE,OAAO,CAAC,GAAEwD,KAAEF,KAAEtD,GAAE,OAAO,CAAC,GAAEW,GAAE,KAAK,EAAC,MAAK,KAAI,QAAO,CAACb,IAAEK,IAAEsI,IAAEjF,EAAC,EAAC,CAAC,GAAEwI,KAAEvD,IAAEnF,KAAEE,MAAG,QAAMlC,MAAGmH,KAAEzI,GAAE,OAAO,CAAC,GAAEwD,KAAExD,GAAE,OAAO,CAAC,GAAEW,GAAE,KAAK,EAAC,MAAK,KAAI,QAAO,CAAC8H,IAAEjF,EAAC,EAAC,CAAC,GAAEwI,KAAEvD,IAAEnF,KAAEE,MAAG,QAAMlC,MAAGmH,KAAEuD,KAAEhM,GAAE,OAAO,CAAC,GAAEwD,KAAEF,KAAEtD,GAAE,OAAO,CAAC,GAAEW,GAAE,KAAK,EAAC,MAAK,KAAI,QAAO,CAAC8H,IAAEjF,EAAC,EAAC,CAAC,GAAEwI,KAAEvD,IAAEnF,KAAEE,MAAG,QAAMlC,MAAG,QAAMA,OAAIX,GAAE,KAAK,EAAC,MAAK,KAAI,QAAO,CAAA,EAAE,CAAC,GAAEqL,KAAEzK,IAAE+B,KAAEjD;AAAA,cAAE,CAAC,GAAEM;AAAI,qBAAO,KAAK6D,EAAC,IAAElD,GAAE2B,EAAC,GAAEA;AAAA,YAAC;AAAC,gBAAG,KAAKZ,EAAC;AAAE,qBAAOf,GAAE,KAAKe,EAAC,CAAC;AAAE,gBAAI1B,IAAEqL,IAAE1I,IAAE/B,IAAElB,IAAEC,KAAER,GAAE,KAAK,aAAa,GAAG,KAAG,EAAE;AAAE,mBAAO,KAAKuC,EAAC,IAAEf,GAAEhB,EAAC,GAAEA;AAAA,UAAC,GAAEN,GAAE,eAAe,UAAU,cAAY,SAASA,IAAE;AAAC,gBAAG,MAAIA,GAAE;AAAO,cAAAwD,KAAE,KAAK,aAAa,KAAI,EAAE,IAAE,KAAK,gBAAgB,GAAG;AAAA,iBAAM;AAAC,uBAAQP,KAAE,IAAG3C,KAAE,GAAER,KAAEE,GAAE,QAAOM,KAAER,IAAEQ,MAAG,GAAE;AAAC,oBAAIH,KAAEH,GAAEM,EAAC;AAAE,oBAAEA,OAAI2C,MAAG,MAAKA,MAAG9C,GAAE,MAAKA,GAAE,UAAQ,IAAEA,GAAE,OAAO,WAAS8C,MAAG,MAAI9C,GAAE,OAAO,KAAK,GAAG;AAAA,cAAE;AAAC,mBAAK,aAAa,KAAI8C,EAAC;AAAA,YAAC;AAAA,UAAC,GAAEjD,GAAE,eAAe,UAAU,cAAY,SAASA,IAAE;AAAC,gBAAIiD,KAAE,KAAK,EAAE,QAAQ,OAAM3C,KAAE,KAAK,EAAE,QAAQ,OAAMR,KAAE,KAAK,MAAM,QAAQ,OAAMK,KAAE,KAAK,OAAO,QAAQ,OAAMsI,KAAE,KAAK,aAAa,IAAI,IAAE,KAAK,GAAG,QAAQ,QAAM,KAAK,GAAG,QAAQ,OAAMjF,KAAE,KAAK,aAAa,IAAI,IAAE,KAAK,GAAG,QAAQ,QAAM,KAAK,GAAG,QAAQ;AAAM,YAAA1D,KAAE,IAAE2I,OAAIA,KAAE3I,KAAE,IAAGK,KAAE,IAAEqD,OAAIA,KAAErD,KAAE;AAAG,gBAAImB,MAAGA,KAAE,CAAC,EAAC,MAAK,KAAI,QAAO,CAAC2B,KAAEwF,IAAEnI,EAAC,EAAC,GAAE,EAAC,MAAK,KAAI,QAAO,CAAC2C,KAAEnD,KAAE2I,EAAC,EAAC,GAAE,EAAC,MAAK,KAAI,QAAO,CAACA,IAAEjF,IAAE,GAAE,GAAE,GAAEP,KAAEnD,IAAEQ,KAAEkD,EAAC,EAAC,GAAE,EAAC,MAAK,KAAI,QAAO,CAAClD,KAAEH,KAAEqD,EAAC,EAAC,GAAE,EAAC,MAAK,KAAI,QAAO,CAACiF,IAAEjF,IAAE,GAAE,GAAE,GAAEP,KAAEnD,KAAE2I,IAAEnI,KAAEH,EAAC,EAAC,GAAE,EAAC,MAAK,KAAI,QAAO,CAAC8C,KAAEwF,EAAC,EAAC,GAAE,EAAC,MAAK,KAAI,QAAO,CAACA,IAAEjF,IAAE,GAAE,GAAE,GAAEP,IAAE3C,KAAEH,KAAEqD,EAAC,EAAC,GAAE,EAAC,MAAK,KAAI,QAAO,CAAClD,KAAEkD,EAAC,EAAC,GAAE,EAAC,MAAK,KAAI,QAAO,CAACiF,IAAEjF,IAAE,GAAE,GAAE,GAAEP,KAAEwF,IAAEnI,EAAC,EAAC,GAAE,EAAC,MAAK,KAAI,QAAO,GAAE,CAAC,GAAG,OAAO,SAASN,IAAE;AAAC,qBAAM,QAAMA,GAAE,QAAM,MAAIA,GAAE,OAAO,CAAC,KAAG,MAAIA,GAAE,OAAO,CAAC;AAAA,YAAC,CAAC;AAAE,mBAAOA,MAAG,SAAKA,GAAE,cAAYsB,KAAEE,GAAEF,EAAC,IAAGA;AAAA,UAAC,GAAEtB,GAAE,iBAAiB,UAAU,cAAY,SAASA,IAAE;AAAC,gBAAIiD,KAAE,KAAK,GAAG,QAAQ,OAAM3C,KAAE,KAAK,GAAG,QAAQ,OAAMR,KAAE,KAAK,EAAE,QAAQ,OAAMK,KAAE,CAAC,EAAC,MAAK,KAAI,QAAO,CAAC8C,KAAEnD,IAAEQ,EAAC,EAAC,GAAE,EAAC,MAAK,KAAI,QAAO,CAACR,IAAEA,IAAE,GAAE,GAAE,GAAEmD,IAAE3C,KAAER,EAAC,EAAC,GAAE,EAAC,MAAK,KAAI,QAAO,CAACA,IAAEA,IAAE,GAAE,GAAE,GAAEmD,KAAEnD,IAAEQ,EAAC,EAAC,GAAE,EAAC,MAAK,KAAI,QAAO,CAACR,IAAEA,IAAE,GAAE,GAAE,GAAEmD,IAAE3C,KAAER,EAAC,EAAC,GAAE,EAAC,MAAK,KAAI,QAAO,CAACA,IAAEA,IAAE,GAAE,GAAE,GAAEmD,KAAEnD,IAAEQ,EAAC,EAAC,GAAE,EAAC,MAAK,KAAI,QAAO,CAAE,EAAA,CAAC;AAAE,mBAAON,MAAG,SAAKA,GAAE,cAAYG,KAAEqB,GAAErB,EAAC,IAAGA;AAAA,UAAC,GAAEH,GAAE,kBAAkB,UAAU,cAAY,SAASA,IAAE;AAAC,gBAAIiD,KAAE,KAAK,GAAG,QAAQ,OAAM3C,KAAE,KAAK,GAAG,QAAQ,OAAMR,KAAE,KAAK,GAAG,QAAQ,OAAMK,KAAE,KAAK,GAAG,QAAQ,OAAMsI,KAAE,CAAC,EAAC,MAAK,KAAI,QAAO,CAACxF,KAAEnD,IAAEQ,EAAC,EAAC,GAAE,EAAC,MAAK,KAAI,QAAO,CAACR,IAAEK,IAAE,GAAE,GAAE,GAAE8C,IAAE3C,KAAEH,EAAC,EAAC,GAAE,EAAC,MAAK,KAAI,QAAO,CAACL,IAAEK,IAAE,GAAE,GAAE,GAAE8C,KAAEnD,IAAEQ,EAAC,EAAC,GAAE,EAAC,MAAK,KAAI,QAAO,CAACR,IAAEK,IAAE,GAAE,GAAE,GAAE8C,IAAE3C,KAAEH,EAAC,EAAC,GAAE,EAAC,MAAK,KAAI,QAAO,CAACL,IAAEK,IAAE,GAAE,GAAE,GAAE8C,KAAEnD,IAAEQ,EAAC,EAAC,GAAE,EAAC,MAAK,KAAI,QAAO,CAAE,EAAA,CAAC;AAAE,mBAAON,MAAG,SAAKA,GAAE,cAAYyI,KAAEjH,GAAEiH,EAAC,IAAGA;AAAA,UAAC,GAAEzI,GAAE,eAAe,UAAU,cAAY,WAAU;AAAC,mBAAM,CAAC,EAAC,MAAK,KAAI,QAAO,CAAC,KAAK,GAAG,QAAQ,OAAM,KAAK,GAAG,QAAQ,KAAK,EAAC,GAAE,EAAC,MAAK,KAAI,QAAO,CAAC,KAAK,GAAG,QAAQ,OAAM,KAAK,GAAG,QAAQ,KAAK,EAAC,CAAC;AAAA,UAAC,GAAEA,GAAE,mBAAmB,UAAU,cAAY,WAAU;AAAC,qBAAQA,KAAE,CAAA,GAAGiD,KAAE,GAAEA,KAAE,KAAK,OAAO,eAAcA,MAAG,GAAE;AAAC,kBAAI3C,KAAE,KAAK,OAAO,QAAQ2C,EAAC;AAAE,cAAAjD,GAAE,KAAK,EAAC,MAAK,MAAIiD,KAAE,MAAI,KAAI,QAAO,CAAC3C,GAAE,GAAEA,GAAE,CAAC,EAAC,CAAC;AAAA,YAAC;AAAC,mBAAON;AAAA,UAAC,GAAEA,GAAE,kBAAkB,UAAU,cAAY,WAAU;AAAC,qBAAQA,KAAE,CAAA,GAAGiD,KAAE,GAAEA,KAAE,KAAK,OAAO,eAAcA,MAAG,GAAE;AAAC,kBAAI3C,KAAE,KAAK,OAAO,QAAQ2C,EAAC;AAAE,cAAAjD,GAAE,KAAK,EAAC,MAAK,MAAIiD,KAAE,MAAI,KAAI,QAAO,CAAC3C,GAAE,GAAEA,GAAE,CAAC,EAAC,CAAC;AAAA,YAAC;AAAC,mBAAON,GAAE,KAAK,EAAC,MAAK,KAAI,QAAO,CAAE,EAAA,CAAC,GAAEA;AAAA,UAAC;AAAA,QAAC;MAAG,GAAE2C,MAAG7C,KAAE,CAAA,GAAG,GAAG,IAAEQ,KAAE,CAAC,SAASN,IAAEiD,IAAE3C,IAAE;AAAC,QAAAA,GAAE,EAAE2C,EAAC;AAAE,YAAInD,KAAE,KAAIK,KAAE,CAAA,GAAGsI,KAAE,OAAO,yBAAuB,OAAO,4BAA0B,OAAO,+BAA6B,OAAO,2BAAyB,SAASzI,IAAE;AAAC,iBAAO,WAAWA,IAAE,MAAI,EAAE;AAAA,QAAC,GAAEwD,KAAE,OAAO,wBAAsB,OAAO,2BAAyB,OAAO,8BAA4B,OAAO,0BAAwB,SAASxD,IAAE;AAAC,iBAAO,aAAaA,EAAC;AAAA,QAAC,GAAEsB,KAAE,KAAK,IAAG,GAAGX,KAAE;AAAO,iBAASqL,KAAG;AAAC,cAAI1L,KAAE,QAAON,KAAE;AAAO,UAAAW,OAAI6C,GAAE,KAAK,QAAO7C,EAAC,GAAEA,KAAE,OAAMR,GAAE,QAAQ,SAASH,IAAE;AAAC,gBAAIiD;AAAE,aAACA,KAAEjD,GAAE,WAASA,GAAE,QAAM,MAAKA,GAAE,SAASiD,EAAC,GAAE3C,KAAE;AAAA,UAAG,CAAC,GAAEA,MAAGgB,KAAE,KAAK,OAAMtB,KAAE,QAAI,KAAK,IAAG,IAAGsB,KAAExB,OAAIE,KAAE,OAAIA,OAAIW,KAAE8H,GAAE,KAAK,QAAOuD,EAAC;AAAA,QAAE;AAAC,iBAAS1I,GAAEhD,IAAE;AAAC,cAAIR,KAAE;AAAG,iBAAOK,GAAE,KAAK,SAASH,IAAEiD,IAAE;AAAC,mBAAOjD,GAAE,aAAWM,OAAIR,KAAEmD,IAAE;AAAA,UAAG,CAAC,GAAEnD;AAAA,QAAC;AAAC,YAAIyB,KAAE,EAAC,KAAI,SAASvB,IAAE;AAAC,cAAIiD,KAAE;AAAO,iBAAM,OAAKK,GAAEtD,EAAC,KAAGG,GAAE,KAAK8C,KAAE,EAAC,UAASjD,GAAC,CAAC,GAAE,SAASA,IAAE;AAAC,YAAAiD,GAAE,QAAMjD,IAAEW,MAAGqL,GAAC;AAAA,UAAE,KAAG;AAAA,QAAI,GAAE,QAAO,SAAShM,IAAE;AAAC,cAAIiD;AAAE,gBAAIA,KAAEK,GAAEtD,EAAC,OAAKG,GAAE,OAAO8C,IAAE,CAAC,GAAE,CAAC9C,GAAE,UAAQQ,OAAI6C,GAAE,KAAK,QAAO7C,EAAC,GAAEA,KAAE;AAAA,QAAM,EAAC;AAAE,QAAAsC,GAAE,UAAQ1B;AAAA,MAAC,CAAC,GAAE,GAAG,IAAEzB,IAAE,GAAG,IAAE,SAASE,IAAEiD,IAAE3C,IAAE;AAAC,WAAG,EAAEN,IAAEiD,EAAC,KAAG,OAAO,eAAejD,IAAEiD,IAAE,EAAC,YAAW,MAAG,KAAI3C,GAAC,CAAC;AAAA,MAAC,GAAE,GAAG,IAAE,SAASN,IAAE;AAAC,uBAAa,OAAO,UAAQ,OAAO,eAAa,OAAO,eAAeA,IAAE,OAAO,aAAY,EAAC,OAAM,SAAQ,CAAC,GAAE,OAAO,eAAeA,IAAE,cAAa,EAAC,OAAM,KAAE,CAAC;AAAA,MAAC,GAAE,GAAG,IAAE,SAASiD,IAAEjD,IAAE;AAAC,YAAG,IAAEA,OAAIiD,KAAE,GAAGA,EAAC,IAAG,IAAEjD;AAAE,iBAAOiD;AAAE,YAAG,IAAEjD,MAAG,YAAU,OAAOiD,MAAGA,MAAGA,GAAE;AAAW,iBAAOA;AAAE,YAAI3C,KAAE,uBAAO,OAAO,IAAI;AAAE,YAAG,GAAG,EAAEA,EAAC,GAAE,OAAO,eAAeA,IAAE,WAAU,EAAC,YAAW,MAAG,OAAM2C,GAAC,CAAC,GAAE,IAAEjD,MAAG,YAAU,OAAOiD;AAAE,mBAAQnD,MAAKmD;AAAE,eAAG,EAAE3C,IAAER,KAAE,SAASE,IAAE;AAAC,qBAAOiD,GAAEjD,EAAC;AAAA,YAAC,GAAE,KAAK,MAAKF,EAAC,CAAC;AAAE,eAAOQ;AAAA,MAAC,GAAE,GAAG,IAAE,SAASN,IAAE;AAAC,YAAIiD,KAAEjD,MAAGA,GAAE,aAAW,WAAU;AAAC,iBAAOA,GAAE;AAAA,QAAO,IAAE,WAAU;AAAC,iBAAOA;AAAA,QAAC;AAAE,eAAO,GAAG,EAAEiD,IAAE,KAAIA,EAAC,GAAEA;AAAA,MAAC,GAAE,GAAG,IAAE,SAASjD,IAAEiD,IAAE;AAAC,eAAO,OAAO,UAAU,eAAe,KAAKjD,IAAEiD,EAAC;AAAA,MAAC,GAAE,GAAG,IAAE,IAAG,GAAG,GAAG,IAAE,CAAC,EAAE,UAAS,KAAG,EAAC,eAAc,EAAC,UAAS,MAAE,GAAE,YAAW,CAAE,GAAC,eAAc,EAAC,UAAS,MAAE,GAAE,kBAAiB,CAAA,GAAG,cAAa,EAAC,UAAS,MAAE,GAAE,gBAAe,EAAC,OAAM,MAAG,UAAS,MAAE,GAAE,aAAY,EAAC,OAAM,MAAG,UAAS,GAAE,GAAE,cAAa,EAAC,OAAM,KAAE,GAAE,iBAAgB,EAAC,OAAM,MAAG,UAAS,MAAE,GAAE,oBAAmB,EAAC,OAAM,KAAE,GAAE,qBAAoB,EAAC,OAAM,KAAE,GAAE,qBAAoB,EAAC,UAAS,MAAE,GAAE,mBAAkB,IAAG,sBAAqB,EAAC,UAAS,MAAE,GAAE,yBAAwB,CAAE,GAAC,2BAA0B,CAAA,GAAG,uBAAsB,EAAC,OAAM,MAAG,UAAS,MAAE,GAAE,oBAAmB,EAAC,OAAM,MAAG,UAAS,GAAE,GAAE,qBAAoB,EAAC,OAAM,KAAE,GAAE,wBAAuB,EAAC,OAAM,MAAG,UAAS,MAAE,GAAE,2BAA0B,EAAC,OAAM,KAAE,GAAE,6BAA4B,EAAC,OAAM,KAAE,GAAE,qBAAoB,EAAC,OAAM,MAAG,UAAS,KAAE,GAAE,yBAAwB,EAAC,OAAM,KAAE,GAAE,eAAc,CAAA,GAAG,0BAAyB,CAAE,GAAC,0BAAyB,EAAC,OAAM,KAAE,GAAE,eAAc,IAAG,WAAU,EAAC,UAAS,KAAE,GAAE,cAAa,EAAC,UAAS,KAAE,GAAE,uBAAsB,EAAC,OAAM,KAAE,GAAE,kBAAiB,EAAC,UAAS,MAAE,GAAE,sBAAqB,EAAC,UAAS,MAAE,GAAE,YAAW,CAAA,GAAG,YAAW,CAAE,GAAC,mBAAkB,IAAG,mBAAkB,CAAA,GAAG,cAAa,CAAE,GAAC,cAAa,CAAA,GAAG,0BAAyB,EAAC,OAAM,MAAG,UAAS,MAAE,GAAE,2BAA0B,EAAC,OAAM,KAAE,GAAE,8BAA6B,EAAC,OAAM,KAAE,GAAE,wBAAuB,EAAC,UAAS,MAAE,GAAE,0BAAyB,EAAC,OAAM,MAAG,UAAS,MAAE,GAAE,uBAAsB,EAAC,OAAM,MAAG,UAAS,GAAE,GAAE,8BAA6B,EAAC,OAAM,KAAE,GAAE,+BAA8B,EAAC,OAAM,KAAE,GAAE,cAAa,EAAC,UAAS,MAAE,GAAE,sBAAqB,EAAC,OAAM,KAAE,GAAE,sBAAqB,EAAC,OAAM,KAAE,EAAC,GAAE4J,KAAE,EAAC,SAAQ,CAAE,GAAC,aAAY,CAAA,GAAG,kBAAiB,CAAE,GAAC,aAAY,CAAA,GAAG,aAAY,CAAE,EAAA,GAAEG,KAAE,QAAO,KAAG,CAAA,GAAG,KAAG,CAAE,GAACM,MAAG,GAAE,KAAG,CAAA,GAAG,KAAG;AAAE,eAAS,GAAGtN,IAAE;AAAC,YAAGF,GAAEE,EAAC;AAAE,iBAAOF,GAAEE,EAAC,EAAE;AAAQ,YAAIiD,KAAEnD,GAAEE,EAAC,IAAE,EAAC,GAAEA,IAAE,GAAE,OAAG,SAAQ,CAAE,EAAA;AAAE,eAAOM,GAAEN,EAAC,EAAE,KAAKiD,GAAE,SAAQA,IAAEA,GAAE,SAAQ,EAAE,GAAEA,GAAE,IAAE,MAAGA,GAAE;AAAA,MAAO;AAAC,eAAS,KAAI;AAAC,YAAI9C,KAAE,KAAK,IAAG,GAAGsI,KAAE;AAAG,QAAAzI,OAAIsB,GAAE,KAAK,QAAOtB,EAAC,GAAEA,KAAE,OAAM,EAAE,QAAQ,SAASA,IAAE;AAAC,cAAIiD,IAAE3C,IAAER;AAAE,cAAGE,GAAE,aAAY;AAAC,iBAAIiD,KAAE9C,KAAEH,GAAE,gBAAcA,GAAE,YAAUA,GAAE,SAAOA,GAAE,aAAW;AAAE,qBAAOF,KAAEE,GAAE,OAAOA,GAAE,YAAUA,GAAE,UAAQ,IAAEA,GAAE,OAAO,SAAO,CAAC,GAAEA,GAAE,cAAcF,GAAE,OAAM,MAAGA,GAAE,WAAUA,GAAE,WAAW,GAAE,MAAKE,GAAE,cAAY;AAAM,gBAAGiD,KAAEjD,GAAE,UAAS;AAAC,kBAAGM,KAAE,KAAK,MAAM2C,KAAEjD,GAAE,QAAQ,GAAEA,GAAE,OAAM;AAAC,oBAAGM,MAAGN,GAAE;AAAU,yBAAOF,KAAEE,GAAE,OAAOA,GAAE,YAAUA,GAAE,UAAQ,IAAEA,GAAE,OAAO,SAAO,CAAC,GAAEA,GAAE,cAAcF,GAAE,OAAM,MAAGA,GAAE,WAAUA,GAAE,WAAW,GAAE,MAAKE,GAAE,cAAY;AAAM,gBAAAA,GAAE,aAAWM;AAAA,cAAC;AAAC,cAAAN,GAAE,eAAaA,GAAE,WAASM,IAAE2C,KAAE9C,KAAEH,GAAE;AAAA,YAAW;AAAC,YAAAA,GAAE,YAAUiD,KAAEjD,GAAE,WAASiD,KAAGnD,KAAEE,GAAE,OAAOA,GAAE,YAAU,KAAK,MAAMiD,KAAE7B,EAAC,CAAC,GAAE,UAAKpB,GAAE,cAAcF,GAAE,OAAM,OAAGA,GAAE,WAAUA,GAAE,WAAW,IAAE2I,KAAE,OAAGzI,GAAE,cAAY;AAAA,UAAI;AAAA,QAAC,CAAC,GAAEyI,OAAIzI,KAAEwD,GAAE,KAAK,QAAO,EAAE;AAAA,MAAE;AAAC,eAAS,GAAGxD,IAAEiD,IAAE;AAAC,QAAAjD,GAAE,cAAY,KAAK,IAAK,GAAC,QAAMiD,OAAIjD,GAAE,eAAaA,GAAE,YAAUA,GAAE,UAAQ,IAAEiD,KAAEA,MAAIjD,GAAE,YAAUA,GAAE,OAAMA,GAAE,YAAU,MAAK,GAAE;AAAA,MAAE;AAAC,eAAS,GAAGiD,IAAE3C,IAAE;AAAC,YAAIN,IAAEF;AAAE,eAAO,OAAOmD,MAAG,OAAO3C,OAAIN,KAAE,GAAGiD,EAAC,IAAE,QAAM,MAAM,QAAQA,EAAC,IAAE,UAAQ,QAAM,GAAG3C,EAAC,IAAE,QAAM,MAAM,QAAQA,EAAC,IAAE,UAAQ,QAAM,UAAQN,KAAE,GAAGF,KAAE,OAAO,KAAKmD,EAAC,EAAE,KAAI,GAAG,OAAO,KAAK3C,EAAC,EAAE,KAAI,CAAE,KAAGR,GAAE,KAAK,SAASE,IAAE;AAAC,iBAAO,GAAGiD,GAAEjD,EAAC,GAAEM,GAAEN,EAAC,CAAC;AAAA,QAAC,CAAC,IAAE,YAAUA,KAAEiD,GAAE,WAAS3C,GAAE,UAAQ2C,GAAE,KAAK,SAASjD,IAAEiD,IAAE;AAAC,iBAAO,GAAGjD,IAAEM,GAAE2C,EAAC,CAAC;AAAA,QAAC,CAAC,IAAEA,OAAI3C;AAAA,MAAE;AAAC,eAAS,GAAGA,IAAE;AAAC,eAAOA,KAAE,GAAGA,EAAC,IAAE,OAAO,KAAKA,EAAC,EAAE,OAAO,SAASN,IAAEiD,IAAE;AAAC,iBAAOjD,GAAEiD,EAAC,IAAE,GAAG3C,GAAE2C,EAAC,CAAC,GAAEjD;AAAA,QAAC,GAAE,CAAE,CAAA,IAAE,MAAM,QAAQM,EAAC,IAAEA,GAAE,IAAI,EAAE,IAAEA,KAAEA;AAAA,MAAC;AAAC,eAAS,GAAGN,IAAE;AAAC,YAAIiD,IAAE3C,IAAER,IAAEK,KAAE,GAAEsI,KAAEzI,MAAGA,KAAE,IAAI,KAAI;AAAG,iBAASwD,GAAExD,IAAE;AAAC,cAAIiD,KAAE,GAAE3C,KAAE8C,GAAE,KAAKpD,EAAC;AAAE,iBAAOM,OAAI2C,KAAE,WAAW3C,GAAE,CAAC,CAAC,GAAEA,GAAE,CAAC,IAAE2C,KAAE,KAAGA,MAAGA,MAAG,MAAIA,KAAE,MAAI,KAAGA,KAAE,KAAG,IAAEA,QAAKA,KAAE,KAAIA;AAAA,QAAC;AAAC,gBAAOA,KAAE,uDAAuD,KAAKjD,EAAC,MAAIM,KAAE2C,GAAE,CAAC,EAAE,eAAcnD,KAAEmD,GAAE,CAAC,EAAE,OAAO,MAAM,SAAS,GAAE,WAAS3C,MAAG,MAAIR,GAAE,UAAQK,KAAEqD,GAAE1D,GAAE,CAAC,CAAC,GAAE2I,KAAE,SAAO3I,GAAE,MAAM,GAAE,CAAC,EAAE,KAAK,IAAI,IAAE,OAAK,WAASQ,MAAG,MAAIR,GAAE,UAAQK,KAAEqD,GAAE1D,GAAE,CAAC,CAAC,GAAE2I,KAAE,SAAO3I,GAAE,MAAM,GAAE,CAAC,EAAE,KAAK,IAAI,IAAE,OAAK,UAAQQ,MAAG,MAAIR,GAAE,UAAQK,KAAEqD,GAAE1D,GAAE,CAAC,CAAC,GAAE2I,KAAE,SAAO3I,GAAE,MAAM,GAAE,CAAC,EAAE,KAAK,IAAI,IAAE,OAAK,WAASQ,MAAG,MAAIR,GAAE,UAAQK,KAAEqD,GAAE1D,GAAE,CAAC,CAAC,GAAE2I,KAAE,UAAQ3I,GAAE,CAAC,IAAE,OAAK,kBAAgBQ,MAAG,KAAGR,GAAE,WAASK,KAAEqD,GAAE1D,GAAE,CAAC,CAAC,GAAE2I,KAAE,iBAAe3I,GAAE,MAAM,GAAE,CAAC,EAAE,KAAK,IAAI,IAAE,SAAOmD,KAAE,0DAA0D,KAAKjD,EAAC,KAAGyI,KAAExF,GAAE,CAAC,KAAG9C,KAAE,SAAS8C,GAAE,CAAC,GAAE,EAAE,IAAE,KAAI,MAAIA,GAAE,CAAC,MAAI9C,KAAE,SAAS8C,GAAE,CAAC,IAAEA,GAAE,CAAC,GAAE,EAAE,IAAE,KAAI,MAAIA,GAAE,CAAC,KAAG,kBAAgBjD,GAAE,wBAAsBG,KAAE,IAAG,CAACA,IAAEsI,EAAC;AAAA,MAAC;AAAC,eAAS,GAAGzI,IAAE;AAAC,eAAM,EAAE,CAACA,MAAGA,GAAE,aAAW,KAAK,gBAAc,cAAY,OAAOA,GAAE;AAAA,MAAsB;AAAC,eAAS,GAAGA,IAAEiD,IAAE;AAAC,YAAI3C,IAAER,IAAEK,IAAEsI,IAAEjF,KAAE,CAAE;AAAC,YAAG,EAAErD,KAAEH,GAAE;AAAe,iBAAO,QAAQ,MAAM,gDAAgD,GAAE;AAAK,YAAGA,GAAE,wBAAwBG,EAAC,IAAE,KAAK;AAA+B,iBAAO,QAAQ,MAAM,oCAAoC,GAAE;AAAK,aAAIL,MAAKQ,KAAEN,GAAE,sBAAuB;AAAC,UAAAwD,GAAE1D,EAAC,IAAEQ,GAAER,EAAC;AAAE,YAAG,CAACmD,IAAE;AAAC,cAAG,EAAEwF,KAAEtI,GAAE;AAAa,mBAAO,QAAQ,MAAM,8CAA8C,GAAE;AAAK,UAAAqD,GAAE,QAAMiF,GAAE,aAAYjF,GAAE,SAAOiF,GAAE,aAAYjF,GAAE,OAAKiF,GAAE,aAAYjF,GAAE,UAAQiF,GAAE;AAAA,QAAW;AAAC,eAAOjF;AAAA,MAAC;AAAC,eAAS,GAAGxD,IAAEiD,IAAE;AAAC,YAAI3C,IAAER,IAAEK,KAAE,CAAE,GAACsI,KAAEzI;AAAE,aAAIiD,KAAEA,MAAG,YAAS;AAAC,cAAG,EAAE3C,KAAEmI,GAAE;AAAe,mBAAO,QAAQ,MAAM,gDAAgD,GAAE;AAAK,cAAG,EAAE3I,KAAEQ,GAAE;AAAa,mBAAO,QAAQ,MAAM,8CAA8C,GAAE;AAAK,cAAGR,OAAImD;AAAE;AAAM,cAAG,EAAEwF,KAAE3I,GAAE;AAAc,mBAAO,QAAQ,MAAM,6BAA6B,GAAE;AAAK,UAAAK,GAAE,QAAQsI,EAAC;AAAA,QAAC;AAAC,eAAOtI;AAAA,MAAC;AAAC,eAAS,GAAGH,IAAEiD,IAAE;AAAC,YAAI3C,IAAER,IAAE2I,KAAE,GAAEjF,KAAE;AAAE,gBAAO1D,KAAE,GAAGE,IAAEiD,KAAEA,MAAG,MAAM,KAAGnD,GAAE,UAAQA,GAAE,QAAQ,SAASE,IAAEiD,IAAE;AAAC,cAAI3C,IAAER,IAAEK,KAAE,GAAGH,IAAE,IAAEiD,EAAC;AAAE,UAAAwF,MAAGtI,GAAE,MAAKqD,MAAGrD,GAAE,KAAIL,MAAGQ,KAAEN,IAAG,cAAc,YAAY,iBAAiBM,IAAE,EAAE,GAAEH,KAAE,EAAC,MAAKG,GAAE,aAAW,WAAWR,GAAE,WAAW,GAAE,KAAIQ,GAAE,YAAU,WAAWR,GAAE,UAAU,EAAC,GAAE2I,MAAGtI,GAAE,MAAKqD,MAAGrD,GAAE;AAAA,QAAG,CAAC,IAAGG,KAAE,GAAGN,IAAE,IAAE,GAAG,QAAMyI,IAAEnI,GAAE,SAAOmI,IAAEnI,GAAE,OAAKkD,IAAElD,GAAE,UAAQkD,IAAElD,MAAG,GAAGN,EAAC,IAAE;AAAA,MAAI;AAAC,eAAS,GAAGA,IAAEiD,IAAE;AAAC,YAAI3C,KAAEN,GAAE,IAAEiD,GAAE,GAAEnD,KAAEE,GAAE,IAAEiD,GAAE;AAAE,eAAO,KAAK,KAAK3C,KAAEA,KAAER,KAAEA,EAAC;AAAA,MAAC;AAAC,eAAS,GAAGE,IAAEiD,IAAE3C,IAAE;AAAC,YAAIR,KAAEmD,GAAE,IAAEjD,GAAE,GAAEG,KAAE8C,GAAE,IAAEjD,GAAE;AAAE,eAAM,EAAC,GAAEA,GAAE,IAAEF,KAAEQ,IAAE,GAAEN,GAAE,IAAEG,KAAEG,IAAE,OAAM,KAAK,MAAMH,IAAEL,EAAC,KAAG,KAAK,KAAG,KAAI;AAAA,MAAC;AAAC,eAAS,GAAGE,IAAEiD,IAAE3C,IAAE;AAAC,YAAIR,KAAE,KAAK,MAAME,GAAE,IAAEiD,GAAE,GAAEA,GAAE,IAAEjD,GAAE,CAAC;AAAE,eAAM,EAAC,GAAEiD,GAAE,IAAE,KAAK,IAAInD,EAAC,IAAEQ,IAAE,GAAE2C,GAAE,IAAE,KAAK,IAAInD,EAAC,IAAEQ,KAAE,GAAE;AAAA,MAAC;AAAC,eAAS,GAAGN,IAAEiD,IAAE3C,IAAER,IAAEK,IAAE;AAAC,YAAIsI,KAAEtI,KAAEA,IAAEqD,KAAEiF,KAAEtI,IAAEmB,KAAE,IAAEnB,IAAEQ,KAAEW,KAAEA,IAAE0K,KAAErL,KAAEW,IAAEgC,KAAE0I,KAAEhM,GAAE,IAAE,IAAEW,KAAER,KAAE8C,GAAE,IAAE,IAAE3B,KAAEmH,KAAEnI,GAAE,IAAEkD,KAAE1D,GAAE,GAAEyB,KAAEyK,KAAEhM,GAAE,IAAE,IAAEW,KAAER,KAAE8C,GAAE,IAAE,IAAE3B,KAAEmH,KAAEnI,GAAE,IAAEkD,KAAE1D,GAAE,GAAEO,KAAEL,GAAE,IAAE,IAAEG,MAAG8C,GAAE,IAAEjD,GAAE,KAAGyI,MAAGnI,GAAE,IAAE,IAAE2C,GAAE,IAAEjD,GAAE,IAAGwB,KAAExB,GAAE,IAAE,IAAEG,MAAG8C,GAAE,IAAEjD,GAAE,KAAGyI,MAAGnI,GAAE,IAAE,IAAE2C,GAAE,IAAEjD,GAAE,IAAGqC,KAAEY,GAAE,IAAE,IAAE9C,MAAGG,GAAE,IAAE2C,GAAE,KAAGwF,MAAG3I,GAAE,IAAE,IAAEQ,GAAE,IAAE2C,GAAE,IAAGuB,KAAEvB,GAAE,IAAE,IAAE9C,MAAGG,GAAE,IAAE2C,GAAE,KAAGwF,MAAG3I,GAAE,IAAE,IAAEQ,GAAE,IAAE2C,GAAE,IAAGG,KAAE9B,KAAEtB,GAAE,IAAEG,KAAE8C,GAAE,GAAE0J,KAAErL,KAAEtB,GAAE,IAAEG,KAAE8C,GAAE,GAAE2J,KAAEtL,KAAEhB,GAAE,IAAEH,KAAEL,GAAE,GAAE0C,KAAElB,KAAEhB,GAAE,IAAEH,KAAEL,GAAE,GAAE6C,KAAE,KAAG,MAAI,KAAK,MAAMtC,KAAEgC,IAAEb,KAAEgD,EAAC,IAAE,KAAK;AAAG,eAAM,EAAC,GAAElB,IAAE,GAAE/B,IAAE,QAAO,EAAC,GAAElB,IAAE,GAAEmB,GAAC,GAAE,MAAK,EAAC,GAAEa,IAAE,GAAEmC,GAAC,GAAE,QAAO,EAAC,GAAEpB,IAAE,GAAEuJ,GAAC,GAAE,MAAK,EAAC,GAAEC,IAAE,GAAEpK,GAAC,GAAE,OAAMG,MAAG,MAAIA,KAAE,OAAK,IAAG;AAAA,MAAC;AAAC,eAAS,GAAGrC,IAAER,IAAEK,IAAEsI,IAAEzI,IAAE;AAAC,iBAASwD,GAAExD,IAAEiD,IAAE3C,IAAER,IAAEK,IAAE;AAAC,iBAAOH,MAAGA,MAAG,KAAGiD,KAAE,IAAE3C,KAAE,IAAER,KAAE,IAAEK,MAAG,IAAE8C,KAAE,KAAG3C,KAAE,IAAER,MAAG,IAAEmD,KAAE,IAAE3C;AAAA,QAAC;AAAC,YAAIgB,IAAEX,IAAEqL,IAAE1I,IAAE/B,KAAE,CAAC,QAAM,QAAM,QAAM,QAAM,QAAM,QAAM,QAAM,QAAM,QAAM,QAAM,QAAM,MAAK,GAAElB,KAAE,GAAEmB,MAAGxB,KAAE,QAAMA,MAAG,IAAEA,KAAE,IAAEA,KAAE,IAAE,IAAEA,MAAG;AAAE,eAAM,CAAC,SAAO,QAAM,SAAO,QAAM,SAAO,QAAM,SAAO,QAAM,SAAO,QAAM,SAAO,MAAK,EAAE,QAAQ,SAASA,IAAEiD,IAAE;AAAC,UAAAtC,KAAE6C,GAAElC,KAAEE,KAAExB,KAAEwB,IAAElB,GAAE,GAAER,GAAE,GAAEK,GAAE,GAAEsI,GAAE,CAAC,GAAEuD,KAAExI,GAAElC,IAAEhB,GAAE,GAAER,GAAE,GAAEK,GAAE,GAAEsI,GAAE,CAAC,GAAEnF,KAAE3C,KAAEA,KAAEqL,KAAEA,IAAE3L,MAAGkB,GAAE0B,EAAC,IAAE,KAAK,KAAKK,EAAC;AAAA,QAAC,CAAC,GAAE9B,KAAEnB;AAAA,MAAC;AAAC,eAAS,GAAGL,IAAEiD,IAAE3C,IAAER,IAAEK,IAAE;AAAC,iBAAQsI,IAAEjF,KAAE,KAAGlC,KAAE,IAAEkC,IAAEiF,KAAE,GAAGzI,IAAEiD,IAAE3C,IAAER,IAAEwB,EAAC,GAAE,EAAE,KAAK,IAAImH,KAAEtI,EAAC,KAAG;AAAM,UAAAmB,OAAImH,KAAEtI,KAAE,IAAE,OAAKqD,MAAG;AAAG,eAAOlC;AAAA,MAAC;AAAC,eAAS,GAAGtB,IAAEM,IAAE;AAAC,YAAIR;AAAE,eAAOE,GAAE,QAAQ,SAASA,IAAE;AAAC,cAAIiD,KAAE3C,KAAEN,GAAE,IAAI,SAASA,IAAE;AAAC,gBAAIiD,KAAE,EAAC,GAAEjD,GAAE,GAAE,GAAEA,GAAE,EAAC;AAAE,mBAAOM,GAAE2C,EAAC,GAAEA;AAAA,UAAC,CAAC,IAAEjD;AAAE,WAACF,KAAEA,MAAG,CAAC,EAAC,MAAK,KAAI,QAAO,CAACmD,GAAE,CAAC,EAAE,GAAEA,GAAE,CAAC,EAAE,CAAC,EAAC,CAAC,GAAG,KAAKA,GAAE,SAAO,MAAIA,GAAE,SAAO,EAAC,MAAK,KAAI,QAAO,CAACA,GAAE,CAAC,EAAE,GAAEA,GAAE,CAAC,EAAE,CAAC,EAAC,IAAE,EAAC,MAAK,KAAI,QAAO,CAACA,GAAE,CAAC,EAAE,GAAEA,GAAE,CAAC,EAAE,GAAEA,GAAE,CAAC,EAAE,GAAEA,GAAE,CAAC,EAAE,GAAEA,GAAE,CAAC,EAAE,GAAEA,GAAE,CAAC,EAAE,CAAC,EAAC,IAAE,EAAC,MAAK,KAAI,QAAO,CAAA,EAAE,CAAC;AAAA,QAAC,CAAC,GAAEnD;AAAA,MAAC;AAAC,eAAS,GAAGE,IAAE;AAAC,YAAIM,KAAE,CAAE,GAACR,KAAE;AAAE,eAAOE,GAAE,QAAQ,SAASA,IAAE;AAAC,cAAIiD,MAAG,MAAIjD,GAAE,SAAO,KAAG,IAAI,MAAM,MAAKA,EAAC;AAAE,UAAAM,GAAE,KAAK2C,EAAC,GAAEnD,MAAGmD;AAAA,QAAC,CAAC,GAAE,EAAC,SAAQ3C,IAAE,QAAOR,GAAC;AAAA,MAAC;AAAC,eAAS,GAAGE,IAAEF,IAAE;AAAC,eAAO,QAAME,MAAG,QAAMF,MAAGE,GAAE,WAASF,GAAE,UAAQE,GAAE,KAAK,SAASA,IAAEiD,IAAE;AAAC,cAAI3C,KAAER,GAAEmD,EAAC;AAAE,iBAAOjD,GAAE,SAAOM,GAAE,QAAMN,GAAE,OAAO,KAAK,SAASA,IAAEiD,IAAE;AAAC,mBAAOjD,OAAIM,GAAE,OAAO2C,EAAC;AAAA,UAAC,CAAC;AAAA,QAAC,CAAC;AAAA,MAAC;AAAC,eAAS,GAAGjD,IAAEiD,IAAE3C,IAAE;AAAC,QAAAN,GAAE,OAAOiD,EAAC,IAAEjD,GAAE,OAAOiD,EAAC,EAAE,QAAQ3C,EAAC,IAAE,KAAGN,GAAE,OAAOiD,EAAC,EAAE,KAAK3C,EAAC,IAAEN,GAAE,OAAOiD,EAAC,IAAE,CAAC3C,EAAC;AAAA,MAAC;AAAC,eAAS,GAAGN,IAAEiD,IAAE3C,IAAE;AAAC,YAAIR;AAAE,QAAAE,GAAE,OAAOiD,EAAC,KAAG,MAAInD,KAAEE,GAAE,OAAOiD,EAAC,EAAE,QAAQ3C,EAAC,MAAIN,GAAE,OAAOiD,EAAC,EAAE,OAAOnD,IAAE,CAAC;AAAA,MAAC;AAAC,eAAS,GAAGE,IAAE;AAAC,QAAAiD,MAAG,aAAaA,EAAC,GAAE,GAAG,KAAKjD,EAAC,GAAEiD,KAAE,WAAW,WAAU;AAAC,aAAG,QAAQ,SAASjD,IAAE;AAAC,YAAAA;UAAG,CAAC,GAAE,KAAG,CAAE;AAAA,QAAA,GAAE,CAAC;AAAA,MAAC;AAAC,eAAS,GAAGA,IAAEiD,IAAE;AAAC,QAAAjD,GAAE,cAAc,QAAQiD,EAAC,IAAE,KAAGjD,GAAE,cAAc,KAAKiD,EAAC;AAAA,MAAC;AAAC,eAAS,GAAGjD,IAAE;AAAC,QAAAA,GAAE,cAAc,QAAQ,SAASA,IAAE;AAAC,cAAIM;AAAE,UAAAA,KAAEN,IAAE,WAAW,WAAU;AAAC,gBAAIA,KAAEM,GAAE,YAAW2C,KAAE3C,GAAE;AAAY,YAAAN,GAAE,aAAaA,GAAE,YAAYM,EAAC,GAAE2C,EAAC;AAAA,UAAC,GAAE,CAAC;AAAA,QAAC,CAAC,GAAEjD,GAAE,gBAAc,CAAE;AAAA,MAAA;AAAC,eAAS,GAAGA,IAAEiD,IAAE3C,IAAER,IAAEK,IAAEsI,IAAEjF,IAAE;AAAC,YAAIlC,IAAEX,IAAEqL;AAAE,iCAAuB1L,MAAG,aAAW,OAAOgD,OAAIL,GAAE,aAAa,UAAS,oBAAoB,GAAEK,KAAEL,GAAE,WAAW,YAAU,iBAAiB,4BAA2BK,KAAEL,GAAE,aAAa,UAAS3C,EAAC,MAAIgB,KAAEnB,GAAE,mBAAoB,GAAE,UAAU,KAAI,GAAE,CAAC,GAAEsI,GAAE,UAAU,QAAQ,WAAWnH,EAAC,GAAE2B,GAAE,aAAa,UAAS,MAAM,GAAE+I,KAAE,UAAM/I,GAAE,aAAa,UAAS3C,EAAC,GAAE,UAAKgD,MAAGmF,GAAE,UAAU,QAAQ,MAAK,IAAI9H,KAAEsC,GAAE,QAAQ,SAAQ+I,MAAGrL,GAAE,IAAE,CAACb,GAAE,OAAMa,GAAE,IAAE,CAACb,GAAE,WAASa,GAAE,IAAEb,GAAE,MAAKa,GAAE,IAAEb,GAAE,MAAKa,GAAE,QAAMb,GAAE,OAAMa,GAAE,SAAOb,GAAE,QAAO,MAAI,GAAGE,IAAEwD,EAAC;AAAA,MAAC;AAAC,eAAS,GAAGxD,IAAEiD,IAAE;AAAC,eAAM,EAAC,MAAKjD,KAAE,cAAY,eAAc,QAAOiD,KAAEA,GAAE,WAAS,MAAIjD,KAAE,SAAO,uBAAqB,KAAI;AAAA,MAAC;AAAC,eAAS,GAAGM,IAAER,IAAE;AAAC,eAAO,KAAKA,EAAC,EAAE,QAAQ,SAASE,IAAE;AAAC,cAAIiD,KAAEnD,GAAEE,EAAC;AAAE,UAAAM,GAAEN,EAAC,IAAE,QAAMiD,GAAE,WAASA,GAAE,QAAM,CAACA,GAAE,UAASA,GAAE,QAAQ,IAAEA,GAAE,WAASA,GAAE,QAAMA,GAAE,WAAS,CAAC,CAAA,GAAG,CAAE,CAAA,IAAE,CAAA,IAAGA,GAAE,WAAS,KAAG;AAAA,QAAI,CAAC;AAAA,MAAC;AAAC,eAAS,GAAGA,IAAEjD,IAAEM,IAAER,IAAEK,IAAE;AAAC,eAAOL,OAAIE,GAAEM,EAAC,MAAIN,GAAEM,EAAC,IAAER,IAAEK,MAAGA,GAAE,QAAQ,SAASH,IAAE;AAAC,UAAAA,GAAEiD,IAAEnD,IAAEQ,EAAC;AAAA,QAAC,CAAC,GAAE;AAAA,MAAG;AAAC,eAAS,GAAGN,IAAE;AAAC,iBAASiD,GAAEjD,IAAEiD,IAAE;AAAC,iBAAOjD,KAAE,WAAWiD,EAAC;AAAA,QAAC;AAAC,YAAI3C,KAAEN,GAAE,UAASF,KAAEE,GAAE,iBAAiBM,GAAE,iBAAgB,EAAE,GAAEH,KAAEH,GAAE,iBAAiBM,GAAE,MAAK,EAAE,GAAEmI,KAAE,EAAC,GAAE,GAAE,GAAE,EAAC;AAAE,eAAM,aAAWtI,GAAE,YAAUsI,GAAE,KAAG,CAAC3I,GAAE,YAAWA,GAAE,iBAAgBA,GAAE,aAAYK,GAAE,YAAWA,GAAE,eAAe,EAAE,OAAO8C,IAAE,CAAC,GAAEwF,GAAE,KAAG,CAAC3I,GAAE,WAAUA,GAAE,gBAAeA,GAAE,YAAWK,GAAE,WAAUA,GAAE,cAAc,EAAE,OAAO8C,IAAE,CAAC,KAAG,aAAWnD,GAAE,aAAW2I,GAAE,KAAG,CAAC3I,GAAE,YAAWA,GAAE,eAAe,EAAE,OAAOmD,IAAE,CAAC,GAAEwF,GAAE,KAAG,CAAC3I,GAAE,WAAUA,GAAE,cAAc,EAAE,OAAOmD,IAAE,CAAC,IAAGwF;AAAA,MAAC;AAAC,eAAS,GAAGzI,IAAE;AAAC,YAAIiD,IAAE3C,KAAEN,GAAE;AAAS,QAAAM,GAAE,eAAekB,EAAC,MAAIyB,KAAG,IAAIjD,GAAE,YAAW,gBAAgBwE,IAAE,eAAe,GAAElE,GAAE,KAAK,YAAY2C,GAAE,eAAe,GAAET,GAAExC,EAAC;AAAA,MAAE;AAAC,eAAS,GAAGgM,IAAE;AAAC,YAAIxJ,IAAEH,IAAEM,IAAE3C,IAAEM,IAAER,IAAEK,IAAEqE,IAAE7D,IAAE2C,IAAE/B,IAAE0B,IAAEwF,IAAEjF,IAAElC,IAAEjB,IAAEmB,IAAE4B,IAAEuJ,IAAEC,KAAEZ,GAAE,SAAQa,KAAEb,GAAE,UAAS/L,KAAE+L,GAAE,UAAS5K,KAAEyL,GAAE,qBAAoBE,KAAE;AAAG,iBAAS/J,GAAEhD,IAAEiD,IAAE;AAAC,cAAI3C,KAAE2C,OAAIgJ,KAAE,EAAC,GAAEjM,GAAE,OAAKA,GAAE,QAAM,GAAE,GAAEA,GAAE,IAAG,IAAEiD,OAAIiJ,KAAE,EAAC,GAAElM,GAAE,OAAM,GAAEA,GAAE,MAAIA,GAAE,SAAO,EAAC,IAAEiD,OAAI,IAAE,EAAC,GAAEjD,GAAE,OAAKA,GAAE,QAAM,GAAE,GAAEA,GAAE,OAAM,IAAE,EAAC,GAAEA,GAAE,MAAK,GAAEA,GAAE,MAAIA,GAAE,SAAO,EAAC;AAAE,iBAAOM,GAAE,WAAS2C,IAAE3C;AAAA,QAAC;AAAC,iBAAS0M,GAAEhN,IAAE;AAAC,iBAAM,EAAC,GAAEA,GAAE,GAAE,GAAEA,GAAE,EAAC;AAAA,QAAC;AAAC,YAAG6M,GAAE,gBAAcD,GAAE,MAAKC,GAAE,2BAAyBA,GAAE,kBAAiBA,GAAE,2BAAyBrK,KAAE,GAAGoK,GAAE,eAAe,GAAEvK,KAAE,CAAC,GAAE,CAAC,EAAE,IAAI,SAASrC,IAAE;AAAC,cAAIiD,IAAE3C,IAAER,IAAEK,KAAEyM,GAAE,SAAS5M,EAAC,GAAEyI,KAAEuD,GAAE,eAAe,SAAShM,EAAC,GAAEwD,KAAE,UAAKiF,KAAE,GAAGtI,GAAE,GAAG,IAAE,MAAKmB,KAAE,UAAKmH,MAAGjF,GAAE,KAAK,iBAAeA,GAAE,KAAK,eAAeA,IAAEwI,EAAC,IAAE,GAAErL,KAAE,UAAK8H,MAAGjF,GAAE,KAAK,cAAYA,GAAE,KAAK,YAAYA,IAAEwI,IAAE1K,EAAC,IAAE,GAAGnB,IAAE6L,GAAE,UAAU;AAAE,iBAAOa,GAAE,0BAA0B7M,EAAC,IAAE,UAAKyI,MAAGjF,GAAE,KAAK,cAAYA,GAAE,KAAK,YAAYA,IAAEwI,IAAE1K,EAAC,KAAGhB,KAAE,SAAO2C,KAAEtC,IAAG,QAAMsC,GAAE,QAAMA,GAAE,OAAKA,GAAE,OAAMnD,KAAE,QAAMmD,GAAE,SAAOA,GAAE,SAAOA,GAAE,MAAIA,GAAE,QAAO,CAAC,EAAC,MAAK,KAAI,QAAO,CAACA,GAAE,MAAKA,GAAE,GAAG,EAAC,GAAE,EAAC,MAAK,KAAI,QAAO,CAAC3C,IAAE2C,GAAE,GAAG,EAAC,GAAE,EAAC,MAAK,KAAI,QAAO,CAAC3C,IAAER,EAAC,EAAC,GAAE,EAAC,MAAK,KAAI,QAAO,CAACmD,GAAE,MAAKnD,EAAC,EAAC,GAAE,EAAC,MAAK,KAAI,QAAO,CAAE,EAAA,CAAC,IAAG+M,GAAE,6BAA6B7M,EAAC,IAAEsB,IAAEX;AAAA,QAAC,CAAC,GAAER,KAAE,IAAGyM,GAAE,SAAS,CAAC,KAAGA,GAAE,SAAS,CAAC,KAAGxL,GAAE,CAAC,IAAE4B,GAAEX,GAAE,CAAC,GAAEuK,GAAE,SAAS,CAAC,CAAC,GAAExL,GAAE,CAAC,IAAE4B,GAAEX,GAAE,CAAC,GAAEuK,GAAE,SAAS,CAAC,CAAC,MAAIA,GAAE,SAAS,CAAC,KAAGA,GAAE,SAAS,CAAC,KAAG9M,KAAE8M,GAAE,SAAS,CAAC,KAAGtM,KAAE,GAAE,MAAIA,KAAE,GAAE,IAAGc,GAAEd,EAAC,IAAE0C,GAAEX,GAAE/B,EAAC,GAAEsM,GAAE,SAAStM,EAAC,CAAC,IAAGN,KAAE0M,GAAE,IAAI,SAAS1M,IAAE;AAAC,iBAAOgD,GAAEX,GAAEvC,EAAC,GAAEE,EAAC;AAAA,QAAC,CAAC,GAAG,QAAQ,SAASA,IAAE;AAAC,cAAIiD,KAAE,GAAGjD,IAAEoB,GAAEd,EAAC,CAAC;AAAE,WAAC2C,KAAE9C,MAAG,OAAKA,QAAKiB,GAAEtB,EAAC,IAAEE,IAAEG,KAAE8C;AAAA,QAAE,CAAC,MAAIjD,KAAE0M,GAAE,IAAI,SAAS1M,IAAE;AAAC,iBAAOgD,GAAEX,GAAE,CAAC,GAAErC,EAAC;AAAA,QAAC,CAAC,GAAE0M,GAAE,IAAI,SAAS1M,IAAE;AAAC,iBAAOgD,GAAEX,GAAE,CAAC,GAAErC,EAAC;AAAA,QAAC,CAAC,EAAE,QAAQ,SAASM,IAAE;AAAC,UAAAN,GAAE,QAAQ,SAASA,IAAE;AAAC,gBAAIiD,KAAE,GAAG3C,IAAEN,EAAC;AAAE,aAACiD,KAAE9C,MAAG,OAAKA,QAAKiB,GAAE,CAAC,IAAEd,IAAEc,GAAE,CAAC,IAAEpB,IAAEG,KAAE8C;AAAA,UAAE,CAAC;AAAA,QAAC,CAAC,IAAG,CAAC,GAAE,CAAC,EAAE,QAAQ,SAASjD,IAAE;AAAC,cAAIiD,IAAE3C;AAAE,UAAAsM,GAAE,SAAS5M,EAAC,MAAIqC,GAAErC,EAAC,EAAE,SAAOqC,GAAErC,EAAC,EAAE,SAAOqC,GAAErC,EAAC,EAAE,SAAOoB,GAAEpB,EAAC,EAAE,aAAWmM,MAAG/K,GAAEpB,EAAC,EAAE,aAAWkM,KAAE7J,GAAErC,EAAC,EAAE,UAAQoB,GAAEpB,EAAC,EAAE,aAAWiM,MAAG7K,GAAEpB,EAAC,EAAE,aAAW,MAAIoB,GAAEpB,EAAC,EAAE,WAAS,KAAGoB,GAAEpB,KAAE,IAAE,CAAC,EAAE,IAAEqC,GAAErC,EAAC,EAAE,MAAI,IAAEiM,MAAG7K,GAAEpB,EAAC,EAAE,WAAS,KAAGoB,GAAEpB,KAAE,IAAE,CAAC,EAAE,IAAEqC,GAAErC,EAAC,EAAE,OAAKkM,KAAEC,MAAGlJ,KAAE7B,GAAEpB,KAAE,IAAE,CAAC,EAAE,IAAEqC,GAAErC,EAAC,EAAE,MAAKM,KAAEc,GAAEpB,KAAE,IAAE,CAAC,EAAE,IAAEqC,GAAErC,EAAC,EAAE,KAAIoB,GAAEpB,EAAC,EAAE,WAAS,KAAK,IAAIiD,EAAC,KAAG,KAAK,IAAI3C,EAAC,IAAE,KAAG2C,KAAEiJ,KAAEC,KAAE,KAAG7L,KAAE,IAAE2L;AAAA,QAAG,CAAC,IAAGY,GAAE,kBAAgB5M,GAAE,iBAAe4M,GAAE,6BAA2B5M,GAAE,4BAA0B,CAAC,GAAE,CAAC,EAAE,KAAK,SAASD,IAAE;AAAC,iBAAO6M,GAAE,wBAAwB7M,EAAC,MAAIC,GAAE,wBAAwBD,EAAC,MAAIG,KAAEiB,GAAEpB,EAAC,GAAEyI,KAAExI,GAAE,oBAAoBD,EAAC,GAAEG,GAAE,MAAIsI,GAAE,KAAGtI,GAAE,MAAIsI,GAAE,KAAGtI,GAAE,aAAWsI,GAAE,cAAYxF,KAAET,GAAExC,EAAC,GAAEM,KAAEL,GAAE,yBAAyBD,EAAC,IAAGF,KAAE,QAAMmD,KAAE,SAAO,MAAM,QAAQA,EAAC,IAAE,UAAQ,cAAY,QAAM3C,KAAE,SAAO,MAAM,QAAQA,EAAC,IAAE,UAAQ,cAAY,WAASR,KAAEmD,GAAE,CAAC,MAAI3C,GAAE,CAAC,KAAG2C,GAAE,CAAC,MAAI3C,GAAE,CAAC,IAAE2C,OAAI3C;AAAI,cAAI2C,IAAE3C,IAAER,IAAEK,IAAEsI;AAAA,QAAC,CAAC,GAAE;AAAC,kBAAOuD,GAAE,SAAS,UAAQrJ,KAAE,CAAE,GAACqJ,GAAE,SAAS,UAAQ,MAAKa,GAAE;YAAe,KAAKR;AAAE,cAAA1J,GAAE,KAAK,CAACqK,GAAE5L,GAAE,CAAC,CAAC,GAAE4L,GAAE5L,GAAE,CAAC,CAAC,CAAC,CAAC;AAAE;AAAA,YAAM,KAAKkL;AAAE,cAAArJ,KAAE,YAAU,OAAOT,GAAE,CAAC,KAAG,IAAEA,GAAE,CAAC,KAAG,YAAU,OAAOA,GAAE,CAAC,KAAG,IAAEA,GAAE,CAAC,GAAEiG,KAAE,MAAIxF,KAAE,KAAG,IAAGO,KAAE,KAAK,MAAMpC,GAAE,CAAC,EAAE,IAAEA,GAAE,CAAC,EAAE,GAAEA,GAAE,CAAC,EAAE,IAAEA,GAAE,CAAC,EAAE,CAAC,GAAEE,KAAEmH,KAAEjF,IAAEnD,KAAE,KAAK,KAAGmD,KAAEiF,IAAEjH,KAAE,GAAGJ,GAAE,CAAC,GAAEA,GAAE,CAAC,CAAC,IAAE,KAAK,KAAK,CAAC,IAAE,IAAGgC,KAAE,EAAC,GAAEhC,GAAE,CAAC,EAAE,IAAE,KAAK,IAAIE,EAAC,IAAEE,IAAE,GAAEJ,GAAE,CAAC,EAAE,IAAE,KAAK,IAAIE,EAAC,IAAEE,KAAE,GAAE,GAAEmL,KAAE,EAAC,GAAEvL,GAAE,CAAC,EAAE,IAAE,KAAK,IAAIf,EAAC,IAAEmB,IAAE,GAAEJ,GAAE,CAAC,EAAE,IAAE,KAAK,IAAIf,EAAC,IAAEmB,KAAE,GAAE,GAAEmB,GAAE,KAAK,CAACqK,GAAE5L,GAAE,CAAC,CAAC,GAAEgC,IAAEuJ,IAAEK,GAAE5L,GAAE,CAAC,CAAC,CAAC,CAAC;AAAE;AAAA,YAAM,KAAKmL;AAAA,YAAE,KAAK;AAAE,cAAA5L,KAAE,CAAC6B,GAAE,CAAC,GAAEqK,GAAE,kBAAgB,IAAE,IAAErK,GAAE,CAAC,CAAC,GAAEc,KAAE,CAAA,GAAG/B,KAAE,CAAE,GAACH,GAAE,QAAQ,SAASpB,IAAEiD,IAAE;AAAC,oBAAI3C,IAAER,IAAEK,IAAEsI,IAAEjF,KAAE7C,GAAEsC,EAAC,GAAE3B,KAAE,MAAM,QAAQkC,EAAC,IAAE,EAAC,GAAEA,GAAE,CAAC,GAAE,GAAEA,GAAE,CAAC,EAAC,IAAE,YAAU,OAAOA,KAAExD,GAAE,aAAWiM,KAAE,EAAC,GAAE,GAAE,GAAE,CAACzI,GAAC,IAAExD,GAAE,aAAWkM,KAAE,EAAC,GAAE1I,IAAE,GAAE,EAAC,IAAExD,GAAE,aAAW,IAAE,EAAC,GAAE,GAAE,GAAEwD,GAAC,IAAE,EAAC,GAAE,CAACA,IAAE,GAAE,EAAC,KAAGlD,KAAEc,GAAE6B,KAAE,IAAE,CAAC,GAAE9C,KAAE,KAAGL,KAAE+M,GAAE,wBAAwB5J,EAAC,KAAG,KAAG,IAAEnD,MAAGA,KAAE,KAAG,IAAE,KAAG,KAAG+M,GAAE,2BAAyB,KAAGA,GAAE,2BAAyB,KAAG,IAAE,IAAG7M,GAAE,aAAWiM,OAAIxD,MAAGzI,GAAE,IAAEM,GAAE,KAAG,KAAGH,OAAIsI,KAAEtI,KAAG,EAAC,GAAE,GAAE,GAAE,CAACsI,GAAC,KAAGzI,GAAE,aAAWkM,OAAIzD,MAAGnI,GAAE,IAAEN,GAAE,KAAG,KAAGG,OAAIsI,KAAEtI,KAAG,EAAC,GAAEsI,IAAE,GAAE,EAAC,KAAGzI,GAAE,aAAW,MAAIyI,MAAGnI,GAAE,IAAEN,GAAE,KAAG,KAAGG,OAAIsI,KAAEtI,KAAG,EAAC,GAAE,GAAE,GAAEsI,GAAC,OAAKA,MAAGzI,GAAE,IAAEM,GAAE,KAAG,KAAGH,OAAIsI,KAAEtI,KAAG,EAAC,GAAE,CAACsI,IAAE,GAAE,EAAC;AAAI,gBAAAnF,GAAEL,EAAC,IAAEjD,GAAE,IAAEsB,GAAE,GAAEC,GAAE0B,EAAC,IAAEjD,GAAE,IAAEsB,GAAE;AAAA,cAAC,CAAC,GAAEqB,GAAE,KAAK,CAACqK,GAAE5L,GAAE,CAAC,CAAC,GAAE,EAAC,GAAEkC,GAAE,CAAC,GAAE,GAAE/B,GAAE,CAAC,EAAC,GAAE,EAAC,GAAE+B,GAAE,CAAC,GAAE,GAAE/B,GAAE,CAAC,EAAC,GAAEyL,GAAE5L,GAAE,CAAC,CAAC,CAAC,CAAC;AAAE;AAAA,YAAM,KAAKoL;AAAE,eAAC,WAAU;AAAC,oBAAI1M,IAAE2I,KAAE,GAAEjF,KAAE,GAAElC,KAAE,GAAEX,KAAE,GAAEqL,KAAE,CAAC,CAAA,GAAG,CAAE,CAAA,GAAE1I,KAAE,CAAE;AAAC,yBAAS/B,GAAEvB,IAAE;AAAC,yBAAOA,OAAIyI,KAAEnH,KAAEtB,OAAIwD,KAAE7C,KAAEX,OAAIsB,KAAEmH,KAAEjF;AAAA,gBAAC;AAAC,yBAASnD,GAAEL,IAAE;AAAC,yBAAOA,OAAIwD,MAAGxD,OAAIW,KAAE,MAAI;AAAA,gBAAG;AAAC,yBAASa,GAAExB,IAAEiD,IAAE3C,IAAE;AAAC,sBAAIR,KAAE,EAAC,GAAEE,GAAE,GAAE,GAAEA,GAAE,EAAC;AAAE,sBAAGM,IAAE;AAAC,wBAAGA,OAAIiB,GAAEvB,GAAE,KAAK;AAAE,4BAAM,IAAI,MAAM,oBAAkBM,EAAC;AAAE,oBAAAR,GAAE,QAAMQ;AAAA,kBAAC;AAAM,oBAAAR,GAAE,QAAME,GAAE;AAAM,yBAAOF,GAAE,UAAQ2I,KAAE3I,GAAE,KAAGmD,KAAEnD,GAAE,UAAQ0D,KAAE1D,GAAE,KAAGmD,KAAEnD,GAAE,UAAQwB,KAAExB,GAAE,KAAGmD,KAAEnD,GAAE,KAAGmD,IAAEnD;AAAA,gBAAC;AAAC,yBAASuC,GAAErC,IAAEiD,IAAE;AAAC,yBAAOA,GAAE,UAAQwF,KAAEzI,GAAE,KAAGiD,GAAE,IAAEA,GAAE,UAAQO,KAAExD,GAAE,KAAGiD,GAAE,IAAEA,GAAE,UAAQ3B,KAAEtB,GAAE,KAAGiD,GAAE,IAAEjD,GAAE,KAAGiD,GAAE;AAAA,gBAAC;AAAC,yBAASuB,GAAExE,IAAEiD,IAAE;AAAC,yBAAOA,GAAE,UAAQwF,MAAGxF,GAAE,UAAQ3B,KAAEtB,GAAE,MAAIiD,GAAE,IAAEjD,GAAE,MAAIiD,GAAE;AAAA,gBAAC;AAAC,yBAASG,GAAEpD,IAAE;AAAC,yBAAOA,GAAE,CAAC,IAAE,EAAC,SAAQ,GAAE,YAAW,EAAC,IAAE,EAAC,SAAQ,GAAE,YAAW,EAAC;AAAA,gBAAC;AAAC,yBAAS2M,GAAE3M,IAAEiD,IAAE3C,IAAE;AAAC,yBAAO,KAAK,IAAI2C,GAAE3C,EAAC,IAAEN,GAAEM,EAAC,CAAC;AAAA,gBAAC;AAAC,yBAASsM,GAAE5M,IAAEiD,IAAE3C,IAAE;AAAC,yBAAM,QAAMA,KAAEN,GAAE,IAAEiD,GAAE,IAAEO,KAAE7C,KAAEX,GAAE,IAAEiD,GAAE,IAAE3B,KAAEmH;AAAA,gBAAC;AAAC,qBAAIrH,GAAE,QAAQ,SAASpB,IAAEiD,IAAE;AAAC,sBAAI3C,IAAER,KAAEkN,GAAEhN,EAAC,GAAEG,KAAEqC,GAAES,EAAC;AAAE,kBAAA3C,KAAE,MAAM,QAAQH,EAAC,IAAEA,GAAE,CAAC,IAAE,IAAE,CAACQ,IAAE,CAACR,GAAE,CAAC,CAAC,IAAE,IAAEA,GAAE,CAAC,IAAE,CAACqD,IAAErD,GAAE,CAAC,CAAC,IAAEA,GAAE,CAAC,IAAE,IAAE,CAACsI,IAAE,CAACtI,GAAE,CAAC,CAAC,IAAE,IAAEA,GAAE,CAAC,IAAE,CAACmB,IAAEnB,GAAE,CAAC,CAAC,IAAE,CAACH,GAAE,UAAS,CAAC,IAAE,YAAU,OAAOG,KAAE,CAACH,GAAE,UAAS,CAAC,IAAE,KAAGG,KAAE,CAACH,GAAE,UAASG,EAAC,IAAE,CAACoB,GAAEvB,GAAE,QAAQ,GAAE,CAACG,EAAC,GAAEL,GAAE,QAAMQ,GAAE,CAAC,GAAEH,KAAEG,GAAE,CAAC,GAAE0L,GAAE/I,EAAC,EAAE,KAAKnD,EAAC,GAAEwD,GAAEL,EAAC,IAAEzB,GAAE1B,IAAEK,EAAC;AAAA,gBAAC,CAAC,GAAE,WAAU;AAAC,sBAAIH,IAAEiD,IAAEnD,IAAEK,IAAEG,KAAE,CAAC+B,GAAEiB,GAAE,CAAC,GAAEA,GAAE,CAAC,CAAC,GAAEjB,GAAEiB,GAAE,CAAC,GAAEA,GAAE,CAAC,CAAC,CAAC,GAAEmF,KAAE,CAACpI,GAAEiD,GAAE,CAAC,EAAE,KAAK,GAAEjD,GAAEiD,GAAE,CAAC,EAAE,KAAK,CAAC;AAAE,sBAAGmF,GAAE,CAAC,MAAIA,GAAE,CAAC,GAAE;AAAC,wBAAGnI,GAAE,CAAC,KAAGA,GAAE,CAAC;AAAE,6BAAO,MAAKkE,GAAElB,GAAE,CAAC,GAAEA,GAAE,CAAC,CAAC,MAAIA,GAAE,CAAC,EAAEmF,GAAE,CAAC,CAAC,MAAInF,GAAE,CAAC,EAAEmF,GAAE,CAAC,CAAC,KAAGuD,GAAE,CAAC,EAAE,KAAK1I,GAAE,CAAC,CAAC,GAAE0I,GAAE,CAAC,EAAE,KAAK1I,GAAE,CAAC,CAAC,MAAItD,KAAEsD,GAAE,CAAC,EAAEmF,GAAE,CAAC,CAAC,KAAGnF,GAAE,CAAC,EAAEmF,GAAE,CAAC,CAAC,IAAEnF,GAAE,CAAC,EAAEmF,GAAE,CAAC,CAAC,KAAG,GAAEuD,GAAE,CAAC,EAAE,KAAKxK,GAAE8B,GAAE,CAAC,GAAE,KAAK,IAAItD,KAAEsD,GAAE,CAAC,EAAEmF,GAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAEuD,GAAE,CAAC,EAAE,KAAKxK,GAAE8B,GAAE,CAAC,GAAE,KAAK,IAAItD,KAAEsD,GAAE,CAAC,EAAEmF,GAAE,CAAC,CAAC,CAAC,CAAC,CAAC;AAAK,oBAAAnI,GAAE,CAAC,MAAIA,GAAE,CAAC,KAAG2C,KAAEG,GAAE9C,EAAC,IAAGR,KAAE6M,GAAErJ,GAAEL,GAAE,UAAU,GAAEK,GAAEL,GAAE,OAAO,GAAEwF,GAAExF,GAAE,UAAU,CAAC,KAAG,MAAIK,GAAEL,GAAE,UAAU,IAAEzB,GAAE8B,GAAEL,GAAE,UAAU,GAAE,IAAEnD,EAAC,IAAGkM,GAAE/I,GAAE,UAAU,EAAE,KAAKK,GAAEL,GAAE,UAAU,CAAC,GAAEK,GAAEL,GAAE,UAAU,IAAEzB,GAAE8B,GAAEL,GAAE,UAAU,GAAE,GAAEuB,GAAElB,GAAEL,GAAE,OAAO,GAAEK,GAAEL,GAAE,UAAU,CAAC,IAAE,QAAMwF,GAAExF,GAAE,UAAU,IAAE3B,KAAEkC,KAAEoJ,GAAEtJ,GAAEL,GAAE,UAAU,GAAEK,GAAEL,GAAE,OAAO,GAAE,QAAMwF,GAAExF,GAAE,UAAU,IAAE,MAAI,GAAG,CAAC,MAAInD,KAAE6M,GAAErJ,GAAE,CAAC,GAAEA,GAAE,CAAC,GAAE,QAAMmF,GAAE,CAAC,IAAE,MAAI,GAAG,GAAEuD,GAAE,QAAQ,SAAShM,IAAEiD,IAAE;AAAC,0BAAI3C,KAAE,MAAI2C,KAAE,IAAE;AAAE,sBAAAjD,GAAE,KAAKsD,GAAEL,EAAC,CAAC,GAAEK,GAAEL,EAAC,IAAEzB,GAAE8B,GAAEL,EAAC,GAAE,GAAE,IAAE,KAAGnD,KAAE8M,GAAEtJ,GAAEL,EAAC,GAAEK,GAAEhD,EAAC,GAAE,QAAMmI,GAAExF,EAAC,IAAE,MAAI,GAAG,IAAE,QAAMwF,GAAExF,EAAC,IAAE3B,KAAEkC,EAAC;AAAA,oBAAC,CAAC;AAAA,kBAAE,OAAK;AAAC,wBAAGlD,GAAE,CAAC,KAAGA,GAAE,CAAC;AAAE,6BAAO,MAAKkE,GAAElB,GAAE,CAAC,GAAEA,GAAE,CAAC,CAAC,IAAE0I,GAAE,CAAC,EAAE,KAAK1I,GAAE,CAAC,CAAC,IAAEkB,GAAElB,GAAE,CAAC,GAAEA,GAAE,CAAC,CAAC,IAAE0I,GAAE,CAAC,EAAE,KAAK1I,GAAE,CAAC,CAAC,IAAE0I,GAAE,CAAC,EAAE,KAAK,QAAMvD,GAAE,CAAC,IAAE,EAAC,GAAEnF,GAAE,CAAC,EAAE,GAAE,GAAEA,GAAE,CAAC,EAAE,EAAC,IAAE,EAAC,GAAEA,GAAE,CAAC,EAAE,GAAE,GAAEA,GAAE,CAAC,EAAE,EAAC,CAAC;AAAG,oBAAAhD,GAAE,CAAC,MAAIA,GAAE,CAAC,KAAG2C,KAAEG,GAAE9C,EAAC,GAAE0L,GAAE/I,GAAE,UAAU,EAAE,KAAKK,GAAEL,GAAE,UAAU,CAAC,GAAEK,GAAEL,GAAE,UAAU,IAAEzB,GAAE8B,GAAEL,GAAE,UAAU,GAAE,GAAE0J,GAAErJ,GAAEL,GAAE,UAAU,GAAEK,GAAEL,GAAE,OAAO,GAAEwF,GAAExF,GAAE,OAAO,CAAC,KAAG,IAAE2J,GAAEtJ,GAAEL,GAAE,UAAU,GAAEK,GAAEL,GAAE,OAAO,GAAEwF,GAAExF,GAAE,OAAO,CAAC,IAAEK,GAAEL,GAAE,OAAO,EAAE,KAAK,MAAI9C,KAAE,CAAC,EAAC,GAAEmD,GAAE,CAAC,EAAE,GAAE,GAAEA,GAAE,CAAC,EAAE,EAAC,GAAE,EAAC,GAAEA,GAAE,CAAC,EAAE,GAAE,GAAEA,GAAE,CAAC,EAAE,EAAC,CAAC,GAAE0I,GAAE,QAAQ,SAAShM,IAAEiD,IAAE;AAAC,0BAAI3C,KAAE,MAAI2C,KAAE,IAAE,GAAEnD,KAAE6M,GAAExM,GAAE8C,EAAC,GAAE9C,GAAEG,EAAC,GAAEmI,GAAExF,EAAC,CAAC;AAAE,sBAAAnD,KAAE,MAAIwD,GAAEL,EAAC,IAAEzB,GAAE8B,GAAEL,EAAC,GAAE,IAAEnD,EAAC,IAAGE,GAAE,KAAKsD,GAAEL,EAAC,CAAC,GAAEK,GAAEL,EAAC,IAAEzB,GAAE8B,GAAEL,EAAC,GAAE,GAAE2J,GAAEtJ,GAAEL,EAAC,GAAEK,GAAEhD,EAAC,GAAEmI,GAAEnI,EAAC,CAAC,CAAC;AAAA,oBAAC,CAAC;AAAA,kBAAE;AAAC,yBAAO;AAAA,gBAAC,EAAG;AAAE;AAAC,gBAAA0L,GAAE,CAAC,EAAE,QAAS,GAACA,GAAE,CAAC,EAAE,OAAOA,GAAE,CAAC,CAAC,EAAE,QAAQ,SAAShM,IAAEiD,IAAE;AAAC,sBAAI3C,KAAE,EAAC,GAAEN,GAAE,GAAE,GAAEA,GAAE,EAAC;AAAE,sBAAEiD,MAAGN,GAAE,KAAK,CAAC7C,IAAEQ,EAAC,CAAC,GAAER,KAAEQ;AAAA,gBAAC,CAAC;AAAA,cAAC;UAAG;AAAC,UAAAkE,KAAE,CAAA,GAAGqI,GAAE,wBAAwB,QAAQ,SAAS7M,IAAEiD,IAAE;AAAC,gBAAI3C,IAAER,IAAEK,IAAEsI,IAAEjF,IAAElC,IAAEX,IAAEqL,IAAE1I,IAAE/B,IAAElB,IAAEmB,KAAE,CAACyB;AAAE,gBAAEjD,KAAE,OAAKM,KAAEqC,GAAE7C,KAAE0B,KAAE,IAAEmB,GAAE,SAAO,CAAC,GAAG,UAAQ6B,GAAE1E,EAAC,IAAE0E,GAAE1E,EAAC,KAAG,GAAG,MAAM,MAAKQ,EAAC,GAAEkE,GAAE1E,EAAC,IAAE,MAAI0E,GAAE1E,EAAC,IAAEE,KAAE,MAAIA,KAAEwE,GAAE1E,EAAC,IAAE,IAAGK,KAAE,GAAGG,GAAE,CAAC,GAAEA,GAAE,CAAC,IAAGkB,KAAExB,KAAEwE,GAAE1E,EAAC,IAAEE,MAAGwE,GAAE1E,EAAC,CAAC,GAAE6C,GAAE7C,EAAC,IAAE0B,KAAE,CAACrB,IAAEG,GAAE,CAAC,CAAC,IAAE,CAACA,GAAE,CAAC,GAAEH,EAAC,GAAEqE,GAAE1E,EAAC,KAAGE,QAAKwE,GAAE1E,EAAC,IAAE0E,GAAE1E,EAAC,KAAG,GAAG,MAAM,MAAKQ,EAAC,GAAEkE,GAAE1E,EAAC,IAAE,MAAI0E,GAAE1E,EAAC,IAAEE,KAAE,MAAIA,KAAEwE,GAAE1E,EAAC,IAAE,IAAGK,KAAE,GAAGG,GAAE,CAAC,GAAEA,GAAE,CAAC,GAAEA,GAAE,CAAC,GAAEA,GAAE,CAAC,GAAE,GAAGA,GAAE,CAAC,GAAEA,GAAE,CAAC,GAAEA,GAAE,CAAC,GAAEA,GAAE,CAAC,GAAEkB,KAAExB,KAAEwE,GAAE1E,EAAC,IAAEE,EAAC,CAAC,GAAEwD,KAAEhC,MAAGiH,KAAEnI,GAAE,CAAC,GAAEH,GAAE,SAAOsI,KAAEnI,GAAE,CAAC,GAAEH,GAAE,SAAQmB,KAAE,KAAK,MAAMmH,GAAE,IAAEtI,GAAE,GAAEA,GAAE,IAAEsI,GAAE,CAAC,GAAE9H,KAAE,GAAGR,IAAEqD,EAAC,GAAErD,GAAE,IAAEsI,GAAE,IAAE,KAAK,IAAInH,EAAC,IAAEtB,IAAEG,GAAE,IAAEsI,GAAE,IAAE,KAAK,IAAInH,EAAC,IAAEtB,KAAE,IAAGwD,GAAE,IAAErD,GAAE,IAAE,KAAK,IAAImB,EAAC,IAAEX,IAAE6C,GAAE,IAAErD,GAAE,IAAE,KAAK,IAAImB,EAAC,IAAEX,KAAE,IAAGgC,GAAE7C,EAAC,IAAE0B,KAAE,CAACrB,IAAEA,GAAE,MAAKA,GAAE,MAAKG,GAAE,CAAC,CAAC,IAAE,CAACA,GAAE,CAAC,GAAEH,GAAE,QAAOA,GAAE,QAAOA,EAAC,GAAEqE,GAAE1E,EAAC,IAAE,SAAOE,KAAE,MAAIM,KAAEqC,GAAE7C,KAAE0B,KAAE,IAAEmB,GAAE,SAAO,CAAC,GAAEqJ,KAAE5K,GAAE6B,EAAC,EAAE,UAASK,KAAE0I,OAAIG,MAAGH,OAAIE,KAAE,MAAI,KAAIlM,MAAGK,KAAE,CAACgC,GAAEY,EAAC,EAAE,OAAKK,KAAE,UAAQ,QAAQ,OAAKtD,KAAEK,KAAGkB,KAAEvB,MAAGgM,OAAIG,MAAGH,OAAIC,KAAE,KAAG,IAAG,MAAI3L,GAAE,SAAOA,GAAEkB,KAAE,IAAElB,GAAE,SAAO,CAAC,EAAEgD,EAAC,KAAG/B,MAAGC,KAAE,CAAC,GAAE,CAAC,IAAE,CAAClB,GAAE,SAAO,GAAEA,GAAE,SAAO,CAAC,GAAG,QAAQ,SAASN,IAAE;AAAC,cAAAM,GAAEN,EAAC,EAAEsD,EAAC,KAAG/B;AAAA,YAAC,CAAC,GAAEiD,GAAE1E,EAAC,IAAE;AAAA,UAAK,CAAC,GAAEG,GAAE,sBAAoB,GAAGmB,EAAC,GAAEnB,GAAE,0BAAwB,GAAG4M,GAAE,uBAAuB,GAAE5M,GAAE,gBAAc4M,GAAE,eAAc5M,GAAE,2BAAyB4M,GAAE,0BAAyB5M,GAAE,2BAAyB,GAAGuC,EAAC,GAAEuK,KAAE,MAAGf,GAAE,OAAO,gBAAcA,GAAE,OAAO,aAAa,QAAQ,SAAShM,IAAE;AAAC,YAAAA,GAAEgM,IAAErJ,EAAC;AAAA,UAAC,CAAC;AAAA,QAAC;AAAC,eAAOoK;AAAA,MAAC;AAAC,eAAS,GAAG9J,IAAE3C,IAAE;AAAC,QAAAA,OAAI2C,GAAE,YAAU,CAAC,CAAC3C,MAAG,CAAC,CAAC2C,GAAE,YAAUA,GAAE,IAAI,MAAM,aAAW3C,KAAE,KAAG,WAAU2C,GAAE,UAAQ3C,IAAE2C,GAAE,UAAQA,GAAE,OAAO,WAASA,GAAE,OAAO,QAAQ,QAAQ,SAASjD,IAAE;AAAC,UAAAA,GAAEiD,IAAE3C,EAAC;AAAA,QAAC,CAAC;AAAA,MAAE;AAAC,eAAS,GAAGN,IAAEiD,IAAE;AAAC,YAAI3C,IAAER,IAAEK,IAAEsI,IAAEjF,IAAEF,IAAE/B,IAAElB,IAAEmB,IAAEa,IAAEf,IAAEX,IAAEqL,IAAExH,IAAEpB,IAAEuJ,IAAEC,IAAEpK,IAAEG,IAAEkK,IAAE5M,IAAEmB,IAAE2L,IAAE/J,IAAEgK,IAAElB,IAAEmB,IAAE5I,IAAE0H,IAAEmB,IAAEjB,IAAEC,IAAEiB,IAAEhB,IAAEC,IAAEC,IAAEC,IAAEC,IAAEa,IAAEZ,IAAEC,IAAEY,IAAEX,IAAEI,IAAES,IAAEC,IAAEC,IAAEC,IAAEC,IAAEC,IAAEC,IAAEC,IAAEC,MAAG;AAAG,QAAA9K,GAAE,SAAO8K,IAAG,QAAMjO,MAAGQ,KAAEN,IAAG,SAAQG,KAAEG,GAAE,UAASmI,KAAEnI,GAAE,QAAOkD,KAAE,OAAGA,KAAE,GAAGlD,IAAEH,IAAE,cAAaL,GAAE,WAAU2I,GAAE,cAAc,KAAGjF,IAAEA,KAAE,GAAGlD,IAAEH,IAAE,iBAAgB,GAAGA,GAAE,UAAU,EAAE,CAAC,IAAE,CAAC,KAAGqD,IAAEA,KAAE,GAAGlD,IAAEH,IAAE,oBAAmBL,GAAE,UAAS2I,GAAE,oBAAoB,KAAGjF,OAAKP,GAAE,QAAM8K,IAAG,UAAQA,IAAG,QAAMxM,MAAG+B,KAAEtD,IAAG,SAAQK,KAAEiD,GAAE,UAAS9B,KAAE8B,GAAE,QAAOjB,KAAE,OAAG,CAAC,GAAE,CAAC,EAAE,QAAQ,SAASrC,IAAE;AAAC,cAAIiD,IAAE3C,IAAER,IAAEK,IAAEsI,IAAEjF,IAAElC,IAAEX,IAAEqL,KAAEzK,GAAE,OAAOvB,EAAC;AAAE,UAAAqC,KAAE,GAAGiB,IAAEjD,GAAE,gBAAeL,IAAEgM,OAAI,EAAE,KAAG3J,IAAEA,KAAE,GAAGiB,IAAEjD,GAAE,aAAYL,IAAEgM,EAAC,KAAG3J,IAAEA,KAAE,GAAGiB,IAAEjD,GAAE,cAAaL,IAAEW,KAAEY,GAAE,YAAYvB,EAAC,KAAGK,GAAE,YAAWmB,GAAE,gBAAgB,KAAGa,IAAEA,KAAE,GAAGiB,IAAEjD,GAAE,iBAAgBL,IAAE,GAAGW,EAAC,EAAE,CAAC,IAAE,CAAC,KAAG0B,IAAE2J,OAAI,OAAK7L,KAAEG,MAAG2C,KAAE,GAAGsB,IAAGyH,EAAC,CAAC,GAAG,SAAOzK,GAAE,WAAWvB,EAAC,GAAEyI,KAAE3I,KAAEmD,GAAE,UAAQ1B,GAAE,WAAWvB,EAAC,GAAE,OAAKG,MAAGE,GAAE,kBAAiBoI,MAAGpI,GAAE,mBAAkBgC,KAAE,GAAGiB,IAAEjD,GAAE,oBAAmBL,IAAEG,EAAC,KAAGkC,IAAEA,KAAE,GAAGiB,IAAEjD,GAAE,qBAAoBL,IAAEyI,EAAC,KAAGpG,IAAEhC,GAAE,6BAA6BL,EAAC,IAAEM,IAAED,GAAE,8BAA8BL,EAAC,IAAEF,KAAGO,GAAE,mBAAmBL,EAAC,IAAEK,GAAE,sBAAsBL,EAAC,IAAEgM,IAAE3L,GAAE,eAAeL,EAAC,KAAGW,KAAEN,GAAE,mBAAiB,GAAG,WAASkB,GAAE,WAAWvB,EAAC,GAAEK,GAAE,wBAAwBL,EAAC,IAAEiD,GAAE,WAAStC,IAAEN,GAAE,sBAAsBL,EAAC,IAAEiD,GAAE,UAAQtC,IAAE6C,KAAEP,GAAE,UAAQtC,IAAEW,KAAE2B,GAAE,UAAQtC,OAAIN,GAAE,wBAAwBL,EAAC,IAAE,CAACK,GAAE,mBAAiB,GAAEA,GAAE,sBAAsBL,EAAC,IAAEwD,KAAElC,KAAE,IAAG,GAAGgC,IAAEjD,GAAE,sBAAqBL,IAAEwD,IAAEhC,GAAE,wBAAwB,GAAE,GAAG8B,IAAEjD,GAAE,sBAAqBL,IAAEsB,IAAEE,GAAE,wBAAwB,GAAEnB,GAAE,yBAAyBL,EAAC,IAAE,CAACK,GAAE,eAAeL,EAAC;AAAA,QAAC,CAAC,GAAEqC,KAAE,GAAGiB,IAAEjD,IAAE,gBAAeA,GAAE,eAAe,CAAC,KAAGA,GAAE,eAAe,CAAC,CAAC,KAAGgC,OAAKY,GAAE,eAAa8K,IAAG,UAAQA,IAAG,eAAa/B,MAAG1K,KAAEtB,IAAG,SAAQwE,KAAElD,GAAE,UAAS8B,KAAE,OAAGA,KAAE,GAAG9B,IAAEkD,IAAE,uBAAsBwH,GAAE,kBAAkB,KAAG5I,IAAEA,KAAE,GAAG9B,IAAEkD,IAAE,qBAAoBwH,GAAE,gBAAgB,KAAG5I,IAAEA,KAAE,GAAG9B,IAAEkD,IAAE,wBAAuB,GAAGA,GAAE,iBAAiB,EAAE,CAAC,IAAE,CAAC,KAAGpB,IAAEzC,KAAE6D,GAAE,mBAAiBwH,GAAE,iBAAgB5I,KAAE,GAAG9B,IAAEkD,IAAE,2BAA0BA,GAAE,mBAAiB,IAAE7D,EAAC,KAAGyC,IAAEA,KAAE,GAAG9B,IAAEkD,IAAE,6BAA4BA,GAAE,uBAAqBA,GAAE,0BAAwB,IAAE,KAAGA,GAAE,mBAAiB7D,EAAC,KAAGyC,OAAKH,GAAE,eAAa8K,IAAG,QAAMA,IAAG,QAAMA,IAAG,iBAAeA,IAAG,eAAanB,MAAGD,KAAE3M,IAAG,SAAQwC,KAAEmK,GAAE,UAAShK,KAAE,OAAG,CAAC,GAAE,CAAC,EAAE,QAAQ,SAAS3C,IAAE;AAAC,cAAIiD,IAAE3C,KAAEkC,GAAE,mBAAmBxC,EAAC,GAAEF,KAAEQ,OAAI,KAAG,GAAGiE,IAAGjE,EAAC,CAAC,IAAE;AAAK,UAAAqC,KAAE,GAAGgK,IAAEnK,GAAE,uBAAsBxC,IAAE4M,GAAE,qBAAqB5M,EAAC,KAAGwC,GAAE,gBAAcA,GAAE,eAAexC,EAAC,KAAG,CAAC,CAACF,MAAG,CAAC,CAACA,GAAE,WAAW,KAAG6C,IAAEA,KAAE,GAAGgK,IAAEnK,GAAE,qBAAoBxC,IAAEiD,KAAE2J,GAAE,mBAAmB5M,EAAC,KAAGwC,GAAE,iBAAiB,KAAGG,IAAEA,KAAE,GAAGgK,IAAEnK,GAAE,wBAAuBxC,IAAE,GAAGiD,EAAC,EAAE,CAAC,IAAE,CAAC,KAAGN,IAAE7C,MAAGA,GAAE,iBAAemD,KAAE2J,GAAE,kBAAkB5M,EAAC,KAAGF,GAAE,eAAamD,KAAEnD,GAAE,aAAYmD,MAAG,IAAEnD,GAAE,aAAY6C,KAAE,GAAGgK,IAAEnK,GAAE,2BAA0BxC,IAAEiD,EAAC,KAAGN,IAAEA,KAAE,GAAGgK,IAAEnK,GAAE,6BAA4BxC,IAAEwC,GAAE,uBAAuBxC,EAAC,IAAEiD,KAAE,MAAIT,GAAE,mBAAiB,GAAG,YAAUoK,GAAE,WAAW5M,EAAC,IAAE,IAAEiD,KAAE,CAAC,KAAGN;AAAA,QAAE,CAAC,GAAEA,OAAKM,GAAE,SAAO8K,IAAG,QAAMA,IAAG,QAAMA,IAAG,eAAaA,IAAG,iBAAeA,IAAG,SAAO3M,MAAGyL,KAAE7M,IAAG,UAAS+M,KAAEF,GAAE,UAAS7J,KAAE6J,GAAE,QAAOG,KAAE,OAAG,CAAC5L,GAAE,iBAAe,GAAGyL,IAAEE,IAAE,cAAa9M,KAAEmB,GAAE,YAAW4B,GAAE,cAAc,MAAI6J,GAAE,SAAS,MAAM,SAAO5M,IAAE+M,KAAE,OAAI,GAAGH,IAAEE,IAAE,oBAAmB9M,KAAEmB,GAAE,kBAAiB4B,GAAE,oBAAoB,MAAI6J,GAAE,UAAU,MAAM,cAAY5M,KAAE,MAAK+M,KAAE,OAAI,MAAI,QAAM,GAAGH,IAAEA,GAAE,SAAS,GAAE,OAAK,GAAGA,IAAEA,GAAE,QAAQ,GAAE,GAAGA,IAAEA,GAAE,YAAY,MAAK,GAAGA,IAAEE,IAAE,uBAAsB9M,KAAEmB,GAAE,qBAAoB4B,GAAE,uBAAuB,MAAI6J,GAAE,gBAAgB,MAAM,UAAQ5M,KAAE,WAAS,QAAO+M,KAAE,OAAI5L,GAAE,wBAAsB,GAAGyL,IAAEE,IAAE,qBAAoB9M,KAAEmB,GAAE,mBAAkB4B,GAAE,qBAAqB,MAAI6J,GAAE,gBAAgB,MAAM,SAAO5M,IAAE+M,KAAE,OAAI,GAAGH,IAAEE,IAAE,2BAA0B9M,KAAEmB,GAAE,yBAAwB4B,GAAE,2BAA2B,MAAI6J,GAAE,qBAAqB,MAAM,cAAY5M,KAAE,MAAK+M,KAAE,MAAG,OAAK,GAAGH,IAAEA,GAAE,mBAAmB,GAAE,GAAGA,IAAEA,GAAE,eAAe,KAAI,GAAGA,IAAEE,IAAE,6BAA4B9M,KAAEmB,GAAE,2BAA0B4B,GAAE,6BAA6B,MAAI6J,GAAE,cAAc,MAAM,cAAY5M,KAAE,MAAK+M,KAAE,MAAG,OAAK,GAAGH,IAAEA,GAAE,mBAAmB,GAAE,GAAGA,IAAEA,GAAE,eAAe,MAAK,GAAGA,IAAEE,IAAE,gBAAe9M,KAAEmB,GAAE,cAAa4B,GAAE,gBAAgB,MAAI6J,GAAE,UAAU,MAAM,UAAQ5M,KAAE,WAAS,QAAO+M,KAAE,OAAI5L,GAAE,gBAAc,CAAC,GAAE,CAAC,EAAE,QAAQ,SAASd,IAAE;AAAC,cAAIN,KAAEoB,GAAE,YAAYd,EAAC,GAAE2C,KAAEjD,OAAI,KAAG,GAAGuE,IAAGvE,EAAC,CAAC,IAAE,MAAKF,KAAE,GAAGQ,IAAE2C,EAAC;AAAE,aAAG4J,IAAEE,GAAE,gBAAezM,IAAEL,KAAEmB,GAAE,eAAed,EAAC,GAAE0C,GAAE,kBAAkB,MAAI6J,GAAE,UAAU,MAAM/M,GAAE,IAAI,IAAEG,KAAE,UAAQ4M,GAAE,eAAevM,EAAC,IAAE,MAAI,QAAO0M,KAAE,OAAI5L,GAAE,eAAed,EAAC,MAAI,GAAGuM,IAAEE,GAAE,aAAYzM,IAAEN,IAAEgD,GAAE,eAAe,MAAI6J,GAAE,WAAWvM,EAAC,EAAE,KAAK,UAAQ,MAAI2C,GAAE,OAAM,GAAG4J,IAAEA,GAAE,aAAavM,EAAC,GAAER,GAAE,QAAOmD,GAAE,MAAK4J,GAAE,KAAIA,GAAE,kBAAkBvM,EAAC,GAAEuM,GAAE,SAAS,GAAEG,KAAE,MAAG,MAAI,GAAGH,IAAEA,GAAE,SAAS,IAAG,GAAGA,IAAEE,GAAE,cAAazM,IAAEL,KAAEmB,GAAE,aAAad,EAAC,GAAE0C,GAAE,gBAAgB,MAAI6J,GAAE,WAAWvM,EAAC,EAAE,MAAM,OAAKL,IAAE+M,KAAE,OAAI,MAAI,MAAI,OAAK,CAAC5L,GAAE,iBAAe,GAAGyL,IAAE,KAAGA,GAAE,eAAaA,GAAE,YAAY,IAAG,CAAC,eAAc,cAAc,EAAE,QAAQ,SAAS7M,IAAE;AAAC,gBAAIiD,KAAE,UAAQjD,KAAE;AAAK,eAAG6M,IAAEE,GAAE9J,EAAC,GAAE3C,IAAEL,KAAEmB,GAAE6B,EAAC,EAAE3C,EAAC,GAAE0C,GAAE,SAAOC,EAAC,CAAC,MAAI4J,GAAE,aAAavM,EAAC,EAAEN,EAAC,EAAE,QAAQ,QAAMC,IAAE+M,KAAE;AAAA,UAAG,CAAC,GAAE,GAAGH,IAAEE,GAAE,uBAAsBzM,IAAEL,KAAEmB,GAAE,sBAAsBd,EAAC,GAAE0C,GAAE,yBAAyB,MAAI/C,MAAG4M,GAAE,WAAWvM,EAAC,EAAE,MAAM,OAAK,UAAQuM,GAAE,aAAavM,EAAC,IAAE,KAAIuM,GAAE,kBAAkBvM,EAAC,EAAE,MAAM,UAAQ,aAAWuM,GAAE,WAAWvM,EAAC,EAAE,MAAM,OAAK,QAAOuM,GAAE,kBAAkBvM,EAAC,EAAE,MAAM,UAAQ,SAAQ0M,KAAE,OAAI5L,GAAE,sBAAsBd,EAAC,MAAI,GAAGuM,IAAEE,GAAE,oBAAmBzM,IAAEN,IAAEgD,GAAE,sBAAsB,MAAI6J,GAAE,kBAAkBvM,EAAC,EAAE,KAAK,UAAQuM,GAAE,gBAAgBvM,EAAC,EAAE,KAAK,UAAQuM,GAAE,uBAAuBvM,EAAC,EAAE,KAAK,UAAQ,MAAI2C,GAAE,OAAM,CAAC4J,GAAE,WAAWvM,EAAC,GAAEuM,GAAE,kBAAkBvM,EAAC,CAAC,EAAE,QAAQ,SAASN,IAAE;AAAC,YAAAA,GAAE,EAAE,QAAQ,QAAMiD,GAAE,KAAK,MAAKjD,GAAE,EAAE,QAAQ,QAAMiD,GAAE,KAAK,KAAIjD,GAAE,MAAM,QAAQ,QAAMiD,GAAE,KAAK,OAAMjD,GAAE,OAAO,QAAQ,QAAMiD,GAAE,KAAK;AAAA,UAAM,CAAC,GAAE+J,KAAE,OAAI,GAAGH,IAAEE,GAAE,qBAAoBzM,IAAEL,KAAEmB,GAAE,oBAAoBd,EAAC,GAAE0C,GAAE,uBAAuB,MAAI6J,GAAE,kBAAkBvM,EAAC,EAAE,MAAM,OAAKL,IAAE+M,KAAE,MAAG,OAAK,GAAGH,IAAEA,GAAE,YAAY,GAAE,GAAGA,IAAEA,GAAE,mBAAmB,KAAI,GAAGA,IAAEE,GAAE,2BAA0BzM,IAAEL,KAAEmB,GAAE,0BAA0Bd,EAAC,GAAE0C,GAAE,6BAA6B,MAAI6J,GAAE,uBAAuBvM,EAAC,EAAE,MAAM,cAAYL,KAAE,MAAK+M,KAAE,OAAI,GAAGH,IAAEE,GAAE,6BAA4BzM,IAAEL,KAAEmB,GAAE,4BAA4Bd,EAAC,GAAE0C,GAAE,+BAA+B,MAAI6J,GAAE,gBAAgBvM,EAAC,EAAE,MAAM,cAAYL,KAAE,MAAK+M,KAAE;AAAA,QAAK,CAAC,GAAEA,OAAK/J,GAAE,YAAU8K,IAAG,QAAMA,IAAG,UAAQA,IAAG,WAAS,GAAG/N,EAAC,KAAIiD,GAAE,QAAM8K,IAAG,cAAYA,IAAG,QAAM1J,MAAGyH,KAAE9L,IAAG,UAAS+L,KAAED,GAAE,UAASoB,KAAEpB,GAAE,SAAS,WAASA,GAAE,SAAS,SAAQG,KAAE5H,GAAE,WAAU6H,KAAE,OAAGgB,OAAIjB,GAAE,KAAGA,GAAE,KAAGiB,GAAE,CAAC,EAAE,CAAC,EAAE,GAAEjB,GAAE,KAAGA,GAAE,KAAGiB,GAAE,CAAC,EAAE,CAAC,EAAE,GAAE7I,GAAE,gBAAc4I,KAAE,GAAGC,IAAE,SAASlN,IAAE;AAAC,UAAAA,GAAE,IAAEiM,GAAE,OAAKA,GAAE,KAAGjM,GAAE,IAAGA,GAAE,IAAEiM,GAAE,OAAKA,GAAE,KAAGjM,GAAE,IAAGA,GAAE,IAAEiM,GAAE,OAAKA,GAAE,KAAGjM,GAAE,IAAGA,GAAE,IAAEiM,GAAE,OAAKA,GAAE,KAAGjM,GAAE;AAAA,QAAE,CAAC,GAAE,GAAGiN,IAAElB,GAAE,aAAa,MAAID,GAAE,SAAS,YAAYmB,EAAC,GAAElB,GAAE,gBAAckB,IAAEf,KAAE,MAAG,MAAI,GAAGJ,IAAEA,GAAE,SAAS,GAAE,GAAGA,IAAEA,GAAE,YAAY,KAAG,MAAI,GAAGA,IAAEA,GAAE,QAAQ,GAAEA,GAAE,OAAO,YAAUA,GAAE,OAAO,SAAS,QAAQ,SAAS9L,IAAE;AAAC,UAAAA,GAAE8L,IAAEmB,EAAC;AAAA,QAAC,CAAC,KAAIf,MAAI6B,IAAG,WAAS5B,MAAGgB,KAAEnN,IAAG,UAASoM,KAAEe,GAAE,UAASd,KAAEF,GAAE,WAAUG,KAAEH,GAAE,cAAaI,KAAEH,GAAE,cAAagB,KAAED,GAAE,IAAI,QAAQ,SAAQX,KAAEW,GAAE,IAAI,OAAMV,KAAE,OAAGY,KAAE,KAAK,IAAIlB,GAAE,mBAAiB,GAAEA,GAAE,sBAAsB,CAAC,KAAG,GAAEA,GAAE,sBAAsB,CAAC,KAAG,CAAC,GAAEO,KAAE,EAAC,IAAGL,GAAE,KAAGgB,IAAE,IAAGhB,GAAE,KAAGgB,IAAE,IAAGhB,GAAE,KAAGgB,IAAE,IAAGhB,GAAE,KAAGgB,GAAC,GAAEF,GAAE,OAAO,oBAAkBA,GAAE,OAAO,iBAAiB,QAAQ,SAASnN,IAAE;AAAC,UAAAA,GAAEmN,IAAET,EAAC;AAAA,QAAC,CAAC,GAAEJ,GAAE,IAAEH,GAAE,aAAWA,GAAE,oBAAkBA,GAAE,eAAaO,GAAE,IAAGJ,GAAE,IAAEH,GAAE,aAAWA,GAAE,oBAAkBA,GAAE,eAAaO,GAAE,IAAGJ,GAAE,QAAMI,GAAE,KAAGA,GAAE,IAAGJ,GAAE,SAAOI,GAAE,KAAGA,GAAE,IAAG,CAAC,KAAI,KAAI,SAAQ,QAAQ,EAAE,QAAQ,SAAS1M,IAAE;AAAC,cAAIiD;AAAE,WAACA,KAAEqJ,GAAEtM,EAAC,OAAKuM,GAAEvM,EAAC,MAAIoN,GAAEpN,EAAC,IAAEuM,GAAEvM,EAAC,IAAEiD,IAAEuJ,GAAE,GAAGxM,EAAC,CAAC,IAAEiD,MAAG,QAAMjD,MAAG,QAAMA,KAAEmN,GAAE,WAAWnN,EAAC,IAAE,KAAG,MAAKyM,KAAE;AAAA,QAAG,CAAC,GAAEA,KAAGsB,IAAG,QAAMP,MAAGV,KAAE9M,IAAG,UAASyN,KAAEX,GAAE,UAASY,KAAE,OAAGF,GAAE,eAAa,CAAC,GAAE,CAAC,EAAE,QAAQ,SAASxN,IAAE;AAAC,UAAAwN,GAAE,yBAAyBxN,EAAC,IAAEwN,GAAE,eAAexN,EAAC,KAAGwN,GAAE,gBAAgBxN,EAAC,KAAGwN,GAAE,sBAAsBxN,EAAC,KAAGwN,GAAE,uBAAuBxN,EAAC;AAAA,QAAC,CAAC,IAAEwN,GAAE,yBAAyB,CAAC,IAAEA,GAAE,yBAAyB,CAAC,IAAE,OAAGA,GAAE,yBAAuBA,GAAE,yBAAyB,CAAC,KAAGA,GAAE,yBAAyB,CAAC,GAAEA,GAAE,uBAAqBA,GAAE,qBAAoBA,GAAE,eAAaA,GAAE,0BAAwBA,GAAE,yBAAyB,CAAC,KAAGA,GAAE,yBAAyB,CAAC,GAAEA,GAAE,mBAAiBA,GAAE,gBAAcA,GAAE,uBAAsBA,GAAE,oBAAkB,CAACA,GAAE,wBAAsBA,GAAE,wBAAsB,CAAC,KAAI,GAAG,EAAE,QAAQ,SAASxN,IAAE;AAAC,cAAIiD,KAAE,gBAAcjD;AAAE,aAAG8M,IAAEW,IAAExK,IAAEsK,KAAEC,GAAEvK,EAAC,CAAC,MAAI6J,GAAE,WAAW9M,EAAC,EAAE,QAAQ,QAAMuN,IAAEG,KAAE;AAAA,QAAG,CAAC,GAAE,GAAGZ,IAAEW,IAAE,oBAAmBF,KAAEC,GAAE,gBAAgB,MAAIV,GAAE,SAAS,MAAM,OAAKS,KAAE,UAAQT,GAAE,aAAW,MAAI,QAAOY,KAAE,MAAG,MAAI,GAAGZ,IAAEA,GAAE,QAAQ,IAAGU,GAAE,qBAAmB,GAAGV,IAAEW,IAAE,wBAAuBF,KAAEC,GAAE,oBAAoB,MAAID,MAAGT,GAAE,WAAW,MAAM,UAAQ,QAAOA,GAAE,cAAc,MAAM,UAAQ,aAAWA,GAAE,WAAW,MAAM,UAAQ,UAASA,GAAE,cAAc,MAAM,UAAQ,SAAQY,KAAE,OAAI,CAAC,KAAI,GAAG,EAAE,QAAQ,SAAS1N,IAAE;AAAC,cAAIiD,KAAE,cAAYjD;AAAE,aAAG8M,IAAEW,IAAExK,IAAEsK,KAAEC,GAAEvK,EAAC,CAAC,MAAI6J,GAAE,SAAS9M,EAAC,EAAE,QAAQ,QAAMuN,IAAEG,KAAE;AAAA,QAAG,CAAC,GAAE,GAAGZ,IAAEW,IAAE,gBAAeF,KAAEC,GAAE,YAAY,MAAIV,GAAE,aAAa,MAAM,UAAQA,GAAE,oBAAoB,MAAM,UAAQS,KAAE,WAAS,QAAOG,KAAE,MAAG,MAAI,GAAGZ,IAAEA,GAAE,YAAY,IAAGU,GAAE,iBAAe,CAAC,GAAE,CAAC,EAAE,QAAQ,SAASxN,IAAE;AAAC,cAAIiD;AAAE,aAAG6J,IAAEW,GAAE,0BAAyBzN,IAAEuN,KAAEC,GAAE,yBAAyBxN,EAAC,CAAC,MAAI8M,GAAE,iBAAiB9M,EAAC,EAAE,MAAM,UAAQuN,KAAE,WAAS,QAAOG,KAAE,MAAG,MAAI,GAAGZ,IAAEA,GAAE,QAAQ,IAAGU,GAAE,yBAAyBxN,EAAC,MAAI,GAAGiD,KAAEuK,GAAE,0BAA0BxN,EAAC,GAAEyN,GAAE,0BAA0BzN,EAAC,CAAC,MAAI8M,GAAE,iBAAiB9M,EAAC,EAAE,YAAYiD,EAAC,GAAEwK,GAAE,0BAA0BzN,EAAC,IAAEiD,IAAEyK,KAAE,OAAI,GAAGZ,IAAEW,GAAE,8BAA6BzN,IAAEuN,KAAEC,GAAE,6BAA6BxN,EAAC,CAAC,MAAI8M,GAAE,iBAAiB9M,EAAC,EAAE,MAAM,cAAYuN,KAAE,MAAKG,KAAE;AAAA,QAAI,CAAC,GAAE,GAAGZ,IAAEW,IAAE,0BAAyBF,KAAEC,GAAE,sBAAsB,MAAIV,GAAE,aAAa,MAAM,UAAQS,KAAE,WAAS,QAAOG,KAAE,OAAIF,GAAE,0BAAwB,CAAC,GAAE,CAAC,EAAE,QAAQ,SAASlN,IAAE;AAAC,cAAIN,KAAEwN,GAAE,sBAAsBlN,EAAC,GAAE2C,KAAEjD,OAAI,KAAG,GAAGuE,IAAGvE,EAAC,CAAC,IAAE,MAAKF,KAAE,GAAGQ,IAAE2C,EAAC;AAAE,aAAG6J,IAAEW,GAAE,0BAAyBnN,IAAEiN,KAAEC,GAAE,yBAAyBlN,EAAC,CAAC,MAAIwM,GAAE,aAAa,MAAMhN,GAAE,IAAI,IAAEyN,KAAE,UAAQT,GAAE,mBAAmBxM,EAAC,IAAE,MAAI,QAAOoN,KAAE,OAAIF,GAAE,yBAAyBlN,EAAC,MAAI,GAAGwM,IAAEW,GAAE,uBAAsBnN,IAAEN,EAAC,MAAI8M,GAAE,sBAAsBxM,EAAC,EAAE,KAAK,UAAQ,MAAI2C,GAAE,OAAM,GAAG6J,IAAEA,GAAE,iBAAiBxM,EAAC,GAAER,GAAE,QAAOmD,GAAE,MAAK6J,GAAE,KAAIA,GAAE,sBAAsBxM,EAAC,GAAEwM,GAAE,YAAY,GAAEY,KAAE,MAAG,OAAK,GAAGZ,IAAEA,GAAE,YAAY,GAAE,GAAGA,IAAEA,GAAE,QAAQ,KAAI,CAAC,eAAc,cAAc,EAAE,QAAQ,SAAS9M,IAAE;AAAC,gBAAIiD,KAAE,oBAAkBjD,KAAE;AAAK,eAAG8M,IAAEW,GAAExK,EAAC,GAAE3C,IAAEiN,KAAEC,GAAEvK,EAAC,EAAE3C,EAAC,CAAC,MAAIwM,GAAE,iBAAiBxM,EAAC,EAAEN,EAAC,EAAE,QAAQ,QAAMuN,IAAEG,KAAE;AAAA,UAAG,CAAC;AAAA,QAAE,CAAC,KAAIF,GAAE,uBAAqB,CAAC,KAAI,GAAG,EAAE,QAAQ,SAASxN,IAAE;AAAC,cAAIiD,KAAE,qBAAmBjD;AAAE,aAAG8M,IAAEW,IAAExK,IAAEsK,KAAEC,GAAEvK,EAAC,CAAC,MAAI6J,GAAE,gBAAgB9M,EAAC,EAAE,QAAQ,QAAMuN,IAAEG,KAAE;AAAA,QAAG,CAAC,GAAEA,KAAGzK,GAAE,WAAS4K,MAAGF,KAAE3N,IAAG,UAAS8N,KAAEH,GAAE,UAAS,OAAO,KAAK,EAAE,EAAE,QAAQ,SAAS3N,IAAE;AAAC,cAAIiD,KAAE,GAAGjD,EAAC,GAAEM,KAAEN,KAAE,YAAWF,KAAEE,KAAE,YAAWG,KAAE0N,GAAE/N,EAAC;AAAE,aAAG6N,IAAEG,IAAExN,IAAEsN,KAAEC,GAAEvN,EAAC,CAAC,KAAGsN,OAAIE,GAAEhO,EAAC,IAAE,GAAGK,EAAC,IAAG8C,GAAE2K,KAAE,SAAO,QAAQ,EAAED,EAAC,KAAGC,MAAG,GAAGzN,IAAE2N,GAAEhO,EAAC,CAAC,MAAImD,GAAE,OAAO0K,EAAC,GAAEG,GAAExN,EAAC,IAAE,MAAGwN,GAAEhO,EAAC,IAAE,GAAGK,EAAC,GAAE8C,GAAE,KAAK0K,EAAC;AAAA,QAAE,CAAC,KAAI,MAAI,OAAKI,IAAG,QAAM,CAACA,IAAG,QAAM,GAAG/N,IAAEA,GAAE,SAAS,GAAE,MAAI+N,IAAG,QAAM,CAACA,IAAG,QAAM,GAAG/N,IAAEA,GAAE,SAAS,GAAE,GAAGA,EAAC;AAAA,MAAC;AAAC,eAASgO,IAAGhO,IAAEiD,IAAE;AAAC,eAAM,EAAC,UAAS,GAAGjD,GAAE,QAAQ,KAAG,IAAEA,GAAE,WAASA,GAAE,WAASiD,GAAE,UAAS,QAAO,EAAE,YAAYjD,GAAE,MAAM,IAAEA,GAAE,SAAO,GAAGiD,GAAE,MAAM,EAAC;AAAA,MAAC;AAAC,eAAS,GAAGjD,IAAEiD,IAAE3C,IAAER,IAAE;AAAC,YAAIK,IAAEsI,KAAEzI,GAAE,UAASwD,KAAExD,GAAE,UAASsB,KAAE,CAAA;AAAG,iBAASX,KAAG;AAAC,WAAC,WAAU,eAAc,kBAAkB,EAAE,QAAQ,SAASX,IAAE;AAAC,YAAAwD,GAAExD,EAAC,IAAEyI,GAAEzI,EAAC;AAAA,UAAC,CAAC;AAAA,QAAC;AAAC,QAAAyI,GAAE,UAAQxF,IAAE3C,MAAGwL,GAAExL,EAAC,MAAImI,GAAE,cAAYnI,IAAEmI,GAAE,mBAAiBuF,IAAG,GAAGlO,EAAC,IAAEA,KAAE,CAAE,GAACgM,GAAExL,EAAC,EAAE,kBAAkB,IAAGgB,GAAE,UAAQmH,GAAE,YAAUjF,GAAE,SAAQlC,GAAE,cAAYmH,GAAE,gBAAcjF,GAAE,aAAYlC,GAAE,mBAAiB,GAAGmH,GAAE,kBAAiBjF,GAAE,gBAAgB,GAAElC,GAAE,eAAaA,GAAE,mBAAiBmH,GAAE,eAAatI,KAAEmB,GAAE,cAAYwK,GAAEtI,GAAE,WAAW,EAAE,KAAKxD,IAAE,MAAG,IAAE,IAAE8L,GAAEtI,GAAE,WAAW,EAAE,KAAKxD,EAAC,GAAEW,GAAC,GAAGmL,GAAEtI,GAAE,WAAW,EAAE,KAAKxD,IAAEG,EAAC,KAAGmB,GAAE,YAAUkC,GAAE,eAAalC,GAAE,eAAawK,GAAEtI,GAAE,WAAW,EAAE,KAAKxD,IAAE,MAAG,IAAE,GAAEW,GAAC,GAAGmL,GAAEtI,GAAE,WAAW,EAAE,KAAKxD,EAAC,KAAGsB,GAAE,YAAUX,GAAG,GAACmL,GAAEtI,GAAE,WAAW,EAAE,MAAMxD,EAAC;AAAA,MAAE;AAAC,eAAS,GAAGA,IAAEiD,IAAE3C,IAAE;AAAC,YAAIR,KAAE,EAAC,OAAME,IAAE,YAAWM,GAAC;AAAE,eAAON,GAAE,YAAY,QAAQiD,EAAC,IAAE,MAAI,CAACA,GAAE,KAAK,QAAMA,GAAE,KAAK,KAAKA,IAAEnD,EAAC,OAAKE,GAAE,YAAY,KAAKiD,EAAC,GAAEA,GAAE,aAAa,KAAKnD,EAAC,GAAE;AAAA,MAAE;AAAC,eAAS,GAAGQ,IAAER,IAAEE,IAAE;AAAC,YAAIG,KAAEG,GAAE,YAAY,QAAQR,EAAC;AAAE,aAAGK,MAAGG,GAAE,YAAY,OAAOH,IAAE,CAAC,GAAEL,GAAE,aAAa,KAAK,SAASE,IAAEiD,IAAE;AAAC,iBAAOjD,GAAE,UAAQM,OAAIR,GAAE,KAAK,UAAQA,GAAE,KAAK,OAAOA,IAAEE,EAAC,GAAEG,KAAE8C,IAAE;AAAA,QAAG,CAAC,MAAInD,GAAE,aAAa,OAAOK,IAAE,CAAC,GAAEH,MAAG,GAAG,WAAU;AAAC,UAAAF,GAAE,aAAa,UAAQ2I,GAAE3I,EAAC;AAAA,QAAC,CAAC;AAAA,MAAE;AAAC,eAAS,GAAGa,IAAEqL,IAAE;AAAC,YAAIhM,IAAEG,IAAEL,IAAEmD,IAAE3C,IAAEmI,IAAEjF,IAAElC,IAAEgC,IAAE/B,IAAElB,IAAEmB,IAAEa,IAAEmC,IAAEpB,IAAEuJ,IAAEC,IAAEpK,KAAE7B,GAAE,SAAQgC,KAAE,CAAE;AAAC,iBAASkK,GAAE7M,IAAEiD,IAAE3C,IAAER,IAAEK,IAAE;AAAC,cAAIsI,KAAE,CAAE;AAAC,iBAAOnI,KAAE,QAAMR,MAAG2I,GAAE,YAAUzI,GAAEM,EAAC,GAAEmI,GAAE,MAAI3I,OAAI2I,GAAE,YAAUzI,IAAEyI,GAAE,MAAInI,OAAImI,GAAE,YAAUzI,IAAEyI,GAAE,MAAIxF,KAAGwF,GAAE,UAAQtI,IAAEsI,GAAE,cAAY,QAAMA,GAAE,SAAQA;AAAA,QAAC;AAAC,iBAASxI,GAAED,IAAEiD,IAAE3C,IAAER,IAAEK,IAAEsI,IAAEjF,IAAE;AAAC,cAAIlC,IAAEX,IAAEqL,IAAE1I,KAAEuJ,GAAE7M,IAAEM,IAAEH,IAAEsI,IAAEjF,EAAC;AAAE,iBAAO,QAAMP,GAAE3C,EAAC,MAAIK,MAAGsC,GAAE3C,EAAC,IAAE,IAAI,YAAW,OAAMgD,GAAE,eAAa3C,OAAI,MAAIqL,KAAElM,GAAEa,EAAC,OAAKqL,OAAI1I,GAAE,UAAUA,GAAE,GAAG,MAAIA,GAAE,UAAUA,GAAE,GAAG,IAAE0I,IAAE1K,KAAE,OAAI,QAAMgC,GAAE,UAAUA,GAAE,GAAG,KAAGA,GAAE,gBAAcA,GAAE,UAAUA,GAAE,GAAG,IAAEA,GAAE,SAAQhC,KAAE,OAAIA;AAAA,QAAC;AAAC,iBAASF,GAAEpB,IAAEiD,IAAE3C,IAAER,IAAEK,IAAEsI,IAAEjF,IAAElC,IAAEX,IAAE;AAAC,cAAIqL,IAAE1I,IAAE/B,IAAElB,IAAEmB,KAAEqL,GAAE7M,IAAEM,IAAEH,IAAEsI,IAAEjF,EAAC;AAAE,cAAG,CAAC1D,IAAE;AAAC,gBAAG,QAAM0B,GAAE;AAAQ,oBAAM,IAAI,MAAM,qBAAmBlB,EAAC;AAAE,YAAAR,KAAE,OAAO0B,GAAE;AAAA,UAAO;AAAC,iBAAO,QAAMyB,GAAE3C,EAAC,MAAIkB,GAAE,gBAAcyB,GAAE3C,EAAC,IAAE,IAAI,YAAa,MAAG,MAAIiB,KAAE+B,KAAEL,GAAE3C,EAAC,IAAG,cAAYD,KAAEP,MAAG,GAAGyB,EAAC,IAAE,OAAOA,OAAIlB,QAAKiD,KAAE3C,MAAG,aAAWb,MAAGwD,KAAEA,GAAE,KAAM,IAACA,IAAE,OAAK,CAAChC,MAAGA,GAAEgC,EAAC,QAAMA,OAAI9B,GAAE,UAAUA,GAAE,GAAG,MAAIA,GAAE,UAAUA,GAAE,GAAG,IAAE8B,IAAE0I,KAAE,OAAI,QAAMxK,GAAE,UAAUA,GAAE,GAAG,KAAGA,GAAE,gBAAcA,GAAE,UAAUA,GAAE,GAAG,IAAEA,GAAE,SAAQwK,KAAE,OAAIA;AAAA,QAAC;AAAC,YAAGA,KAAEA,MAAG,CAAA,GAAG,CAAC,SAAQ,KAAK,EAAE,QAAQ,SAAShM,IAAEiD,IAAE;AAAC,cAAI3C,KAAE0L,GAAEhM,EAAC,GAAEF,KAAE;AAAG,cAAGQ,OAAI,GAAGA,EAAC,MAAIR,KAAEiM,GAAEzL,IAAE,QAAQ,OAAKA,OAAIkC,GAAE,SAASS,EAAC,GAAE;AAAC,gBAAG,UAAKtC,GAAE,eAAe,SAASsC,EAAC,KAAG,GAAGtC,IAAE,GAAG6B,GAAE,SAASS,EAAC,EAAE,GAAG,CAAC,GAAEnD,MAAG,CAAC,GAAGa,IAAE,GAAGL,GAAE,GAAG,GAAEN,EAAC;AAAE,oBAAM,IAAI,MAAM,uBAAuB;AAAE,YAAAwC,GAAE,SAASS,EAAC,IAAE3C,IAAEK,GAAE,eAAe,SAASsC,EAAC,IAAEnD,IAAEK,KAAEwC,GAAE,WAAS;AAAA,UAAE;AAAA,QAAC,CAAC,GAAE,CAACH,GAAE,SAAS,CAAC,KAAG,CAACA,GAAE,SAAS,CAAC,KAAGA,GAAE,SAAS,CAAC,MAAIA,GAAE,SAAS,CAAC;AAAE,gBAAM,IAAI,MAAM,iCAAiC;AAAE,iBAASuK,GAAE/M,IAAE;AAAC,cAAIiD,KAAEwF,GAAE,YAAYkE,GAAE,gBAAgB,IAAG,MAAM,CAAC;AAAE,iBAAO1J,GAAE,KAAGjD,IAAEiD,GAAE,UAAU,UAAQ,aAAa,8BAA6B,CAACA,GAAE,GAAEA,GAAE,GAAEA,GAAE,OAAMA,GAAE,MAAM,EAAE,QAAQ,SAASjD,IAAE;AAAC,YAAAA,GAAE,QAAQ,uBAAuB,UAAU,mBAAkB,CAAC;AAAA,UAAC,CAAC,GAAEiD;AAAA,QAAC;AAAC,iBAASD,GAAEhD,IAAE;AAAC,cAAIiD,KAAEwF,GAAE,YAAYkE,GAAE,gBAAgB,IAAG,QAAQ,CAAC;AAAE,iBAAO1J,GAAE,KAAGjD,IAAEiD,GAAE,YAAY,UAAQ,iBAAiB,6BAA4BA,GAAE,QAAQ,WAASA,GAAE,aAAa,WAAU,SAAS,GAAEA;AAAA,QAAC;AAAC,iBAAS+J,GAAEhN,IAAE;AAAC,iBAAM,CAACA,GAAE,OAAMA,GAAE,MAAM,EAAE,QAAQ,SAASA,IAAE;AAAC,YAAAA,GAAE,QAAQ,uBAAuB,UAAU,2BAA0B,GAAG;AAAA,UAAC,CAAC,GAAEA;AAAA,QAAC;AAAC,QAAAG,OAAIH,KAAE,SAASA,IAAEiD,IAAE;AAAC,cAAI3C,IAAER,IAAEK;AAAE,cAAG,EAAEG,KAAE,GAAGN,EAAC,MAAI,EAAEF,KAAE,GAAGmD,EAAC;AAAG,kBAAM,IAAI,MAAM,oBAAoB;AAAE,iBAAO3C,GAAE,UAAQR,GAAE,WAASQ,GAAE,QAAO,GAAGR,GAAE,QAAO,GAAGQ,GAAE,KAAK,SAAS2C,IAAE;AAAC,mBAAOnD,GAAE,KAAK,SAASE,IAAE;AAAC,qBAAOA,OAAIiD,OAAI9C,KAAEH,GAAE,eAAc;AAAA,YAAG,CAAC;AAAA,UAAC,CAAC,IAAGG,MAAG;AAAA,QAAM,EAAE,UAAKQ,GAAE,eAAe,SAAS,CAAC,IAAE,GAAG6B,GAAE,SAAS,CAAC,EAAE,GAAG,EAAE,UAAQA,GAAE,SAAS,CAAC,GAAE,UAAK7B,GAAE,eAAe,SAAS,CAAC,IAAE,GAAG6B,GAAE,SAAS,CAAC,EAAE,GAAG,EAAE,UAAQA,GAAE,SAAS,CAAC,CAAC,OAAK7B,GAAE,eAAasC,KAAEjD,IAAEoD,MAAGtD,KAAEa,IAAG,UAASgM,KAAE1J,GAAE,UAAS2J,KAAE,IAAE,MAAI9M,GAAE,KAAIA,GAAE,WAAS,IAAG,GAAGsD,IAAE,EAAE,GAAE,OAAO,KAAK,EAAE,EAAE,QAAQ,SAASpD,IAAE;AAAC,cAAIiD,KAAEjD,KAAE;AAAW,UAAAoD,GAAEH,EAAC,MAAI,GAAGjD,EAAC,EAAE,OAAOF,EAAC,GAAEsD,GAAEH,EAAC,IAAE;AAAA,QAAG,CAAC,GAAEnD,GAAE,cAAYA,GAAE,OAAKA,GAAE,WAAW,SAAS,KAAK,YAAYA,GAAE,GAAG,GAAE,GAAGA,GAAE,aAAWmD,EAAC,GAAEnD,GAAE,aAAW,GAAGmD,EAAC,GAAEnD,GAAE,MAAIQ,KAAEqM,GAAE,gBAAgB,IAAG,KAAK,GAAErM,GAAE,UAAU,UAAQ,GAAEA,GAAE,QAAQ,WAASA,GAAE,aAAa,WAAU,SAAS,GAAER,GAAE,OAAK2I,KAAEnI,GAAE,YAAYqM,GAAE,gBAAgB,IAAG,MAAM,CAAC,GAAE7M,GAAE,WAASwB,KAAEmH,GAAE,YAAYkE,GAAE,gBAAgB,IAAG,MAAM,CAAC,GAAErL,GAAE,KAAGgC,KAAEsJ,KAAE,cAAatL,GAAE,UAAU,UAAQ,IAAE,cAAa,OAAKA,GAAE,MAAM,OAAK,SAAQxB,GAAE,YAAUwB,KAAEmH,GAAE,YAAYkE,GAAE,gBAAgB,IAAG,KAAK,CAAC,GAAErL,GAAE,KAAGC,KAAEqL,KAAE,eAActL,GAAE,KAAK,UAAQ,MAAIgC,KAAGE,KAAEiF,GAAE,YAAYkE,GAAE,gBAAgB,IAAG,GAAG,CAAC,GAAG,KAAGtM,KAAEuM,KAAE,SAAQ9M,GAAE,mBAAiB,CAAC,GAAE,CAAC,EAAE,IAAI,WAAU;AAAC,cAAIE,KAAEwD,GAAE,YAAYmJ,GAAE,gBAAgB,IAAG,MAAM,CAAC;AAAE,iBAAO3M,GAAE,UAAU,UAAQ,IAAE,qBAAoBA;AAAA,QAAC,CAAC,GAAEF,GAAE,qBAAmB,CAAC8M,KAAE,uBAAsBA,KAAE,qBAAqB,GAAE9M,GAAE,mBAAiB,CAAC,GAAE,CAAC,EAAE,IAAI,SAASE,IAAE;AAAC,iBAAOgD,GAAElD,GAAE,mBAAmBE,EAAC,CAAC;AAAA,QAAC,CAAC,GAAEF,GAAE,wBAAsB,CAAC,GAAE,CAAC,EAAE,IAAI,SAASE,IAAE;AAAC,cAAIiD,KAAEnD,GAAE,iBAAiBE,EAAC,EAAE,YAAY2M,GAAE,gBAAgB,IAAG,KAAK,CAAC;AAAE,iBAAO1J,GAAE,UAAU,UAAQ,IAAE,2BAA0BA;AAAA,QAAC,CAAC,GAAEnD,GAAE,eAAawB,KAAEkC,GAAE,YAAYmJ,GAAE,gBAAgB,IAAG,KAAK,CAAC,GAAErL,GAAE,UAAU,UAAQ,IAAE,mBAAkBA,GAAE,KAAK,UAAQ,MAAIC,IAAEzB,GAAE,aAAWwB,KAAE0L,GAAEvE,GAAE,YAAYkE,GAAE,gBAAgB,IAAG,MAAM,CAAC,CAAC,GAAErL,GAAE,KAAGE,KAAEoL,KAAE,iBAAgBtL,GAAE,UAAU,UAAQ,IAAE,iBAAgB,OAAKA,GAAE,MAAM,OAAK,UAASxB,GAAE,WAASkN,GAAED,GAAEjN,GAAE,aAAW8M,KAAE,YAAY,CAAC,GAAE9M,GAAE,aAAWwB,KAAExB,GAAE,SAAS,YAAY6M,GAAE,gBAAgB,IAAG,KAAK,CAAC,GAAErL,GAAE,KAAK,UAAQ,MAAIE,IAAE1B,GAAE,gBAAcwB,KAAExB,GAAE,SAAS,YAAY6M,GAAE,gBAAgB,IAAG,KAAK,CAAC,GAAErL,GAAE,UAAU,UAAQ,IAAE,oBAAmBA,GAAE,KAAK,UAAQ,MAAIgC,IAAEhC,GAAE,MAAM,UAAQ,QAAOxB,GAAE,eAAawB,KAAExB,GAAE,SAAS,YAAY6M,GAAE,gBAAgB,IAAG,KAAK,CAAC,GAAErL,GAAE,KAAK,UAAQ,MAAIjB,IAAEP,GAAE,kBAAgBkN,GAAED,GAAE1K,KAAEuK,KAAE,oBAAoB,CAAC,IAAGtL,KAAExB,GAAE,gBAAgB,YAAY6M,GAAE,gBAAgB,IAAG,KAAK,CAAC,GAAG,KAAK,UAAQ,MAAInL,IAAE1B,GAAE,uBAAqBwB,KAAExB,GAAE,gBAAgB,YAAY6M,GAAE,gBAAgB,IAAG,KAAK,CAAC,GAAErL,GAAE,UAAU,UAAQ,IAAE,4BAA2BA,GAAE,KAAK,UAAQ,MAAIgC,IAAExD,GAAE,sBAAoBwB,KAAExB,GAAE,gBAAgB,YAAY6M,GAAE,gBAAgB,IAAG,KAAK,CAAC,GAAErL,GAAE,KAAK,UAAQ,MAAIjB,IAAEP,GAAE,OAAKQ,GAAE,YAAYqM,GAAE,gBAAgB,IAAG,GAAG,CAAC,GAAE7M,GAAE,WAASwB,KAAExB,GAAE,KAAK,YAAY6M,GAAE,gBAAgB,IAAG,KAAK,CAAC,GAAErL,GAAE,KAAK,UAAQ,MAAIC,IAAEzB,GAAE,kBAAgBwB,KAAExB,GAAE,KAAK,YAAY6M,GAAE,gBAAgB,IAAG,KAAK,CAAC,GAAErL,GAAE,KAAK,UAAQ,MAAIC,IAAED,GAAE,MAAM,OAAK,UAAQe,KAAE,KAAIf,GAAE,MAAM,UAAQ,QAAOxB,GAAE,eAAa,CAAC8M,KAAE,gBAAeA,KAAE,cAAc,GAAE9M,GAAE,aAAW,CAAC,GAAE,CAAC,EAAE,IAAI,SAASE,IAAE;AAAC,iBAAO+M,GAAEjN,GAAE,aAAaE,EAAC,CAAC;AAAA,QAAC,CAAC,GAAEF,GAAE,kBAAgB,CAAC,GAAE,CAAC,EAAE,IAAI,SAASE,IAAE;AAAC,cAAIiD,KAAEnD,GAAE,WAAWE,EAAC,EAAE,YAAY2M,GAAE,gBAAgB,IAAG,KAAK,CAAC;AAAE,iBAAO1J,GAAE,UAAU,UAAQ,IAAE,oBAAmBA;AAAA,QAAC,CAAC,GAAEuB,KAAE,CAAE,GAAC1E,GAAE,oBAAkB,CAAC,GAAE,CAAC,EAAE,IAAI,SAASE,IAAE;AAAC,iBAAO+M,GAAEvI,GAAExE,EAAC,IAAE4M,KAAE,wBAAsB5M,EAAC;AAAA,QAAC,CAAC,GAAEF,GAAE,yBAAuB,CAAC,GAAE,CAAC,EAAE,IAAI,SAASE,IAAE;AAAC,cAAIiD,KAAEnD,GAAE,kBAAkBE,EAAC,EAAE,YAAY2M,GAAE,gBAAgB,IAAG,KAAK,CAAC;AAAE,iBAAO1J,GAAE,UAAU,UAAQ,IAAE,4BAA2BA;AAAA,QAAC,CAAC,GAAEnD,GAAE,iBAAe,CAAC8M,KAAE,kBAAiBA,KAAE,gBAAgB,GAAE9M,GAAE,eAAa,CAAC,GAAE,CAAC,EAAE,IAAI,SAASE,IAAE;AAAC,cAAIiD,KAAED,GAAElD,GAAE,eAAeE,EAAC,CAAC;AAAE,iBAAO,OAAKiD,GAAE,YAAY,UAAQ,iBAAiB,iCAAgCA;AAAA,QAAC,CAAC,GAAEnD,GAAE,oBAAkB,CAAC,GAAE,CAAC,EAAE,IAAI,SAASE,IAAE;AAAC,iBAAOF,GAAE,aAAaE,EAAC,EAAE,YAAY2M,GAAE,gBAAgB,IAAG,GAAG,CAAC;AAAA,QAAC,CAAC,GAAE7M,GAAE,aAAW,CAAC,GAAE,CAAC,EAAE,IAAI,SAASE,IAAE;AAAC,iBAAOF,GAAE,kBAAkBE,EAAC,EAAE,YAAY2M,GAAE,gBAAgB,IAAG,KAAK,CAAC;AAAA,QAAC,CAAC,GAAE7M,GAAE,oBAAkB,CAAC,GAAE,CAAC,EAAE,IAAI,SAASE,IAAE;AAAC,cAAIiD,KAAEnD,GAAE,kBAAkBE,EAAC,EAAE,YAAY2M,GAAE,gBAAgB,IAAG,KAAK,CAAC;AAAE,iBAAO1J,GAAE,MAAM,OAAK,UAAQuB,GAAExE,EAAC,IAAE,KAAIiD,GAAE,MAAM,UAAQ,QAAOA;AAAA,QAAC,CAAC,GAAEnD,GAAE,YAAUwB,KAAExB,GAAE,KAAK,YAAY6M,GAAE,gBAAgB,IAAG,KAAK,CAAC,GAAErL,GAAE,UAAU,UAAQ,IAAE,eAAcA,GAAE,KAAK,UAAQ,MAAIC,IAAED,GAAE,MAAM,UAAQ,QAAOxB,GAAE,SAAS,eAAaA,GAAE,UAAQ,GAAEgM,GAAE1I,GAAE,WAAW,EAAE,KAAKtD,IAAE,IAAE,KAAGA,GAAE,YAAUQ,GAAE,MAAM,aAAW,WAAUqM,GAAE,KAAK,YAAYrM,EAAC,GAAE,CAAC,GAAE,GAAE,CAAC,EAAE,QAAQ,SAASN,IAAE;AAAC,cAAIiD,IAAE3C,KAAER,GAAE,QAAQ,SAASE,EAAC;AAAE,UAAAM,MAAGyL,GAAEzL,IAAE,OAAO,MAAI2C,KAAE,GAAG3C,GAAE,GAAG,GAAG,KAAK,WAAS2C,GAAE,KAAK,QAAQA,IAAEnD,EAAC;AAAA,QAAC,CAAC,GAAE6C,GAAE,OAAKA,GAAE,OAAKA,GAAE,cAAYA,GAAE,cAAYA,GAAE,QAAMA,GAAE,SAAO,OAAIA,GAAE,WAAS1C,GAAEuC,IAAEwJ,IAAE,QAAOS,IAAE,MAAK,MAAK,GAAG,IAAI,KAAG9J,GAAE,UAASA,GAAE,WAAS1C,GAAEuC,IAAEwJ,IAAE,eAAcI,IAAE,YAAW,CAAC,KAAGzJ,GAAE,UAASA,GAAE,WAAS1C,GAAEuC,IAAEwJ,IAAE,aAAYI,IAAE,YAAW,CAAC,KAAGzJ,GAAE,UAAS,CAACqJ,GAAE,oBAAmBA,GAAE,gBAAgB,EAAE,QAAQ,SAAShM,IAAEiD,IAAE;AAAC,cAAI3C,IAAER,IAAEK,KAAE;AAAG,kBAAMH,OAAI,MAAM,QAAQA,EAAC,IAAE,GAAGA,GAAE,CAAC,CAAC,KAAG,GAAGA,GAAE,CAAC,CAAC,MAAIG,KAAE,CAACH,GAAE,CAAC,GAAEA,GAAE,CAAC,CAAC,GAAE,MAAM,QAAQwC,GAAE,gBAAgBS,EAAC,CAAC,MAAI3C,KAAEH,IAAEL,KAAE0C,GAAE,gBAAgBS,EAAC,GAAE3C,GAAE,WAASR,GAAE,UAAQQ,GAAE,MAAM,SAASN,IAAEiD,IAAE;AAAC,mBAAOjD,OAAIF,GAAEmD,EAAC;AAAA,UAAC,CAAC,OAAK9C,KAAE,YAAOH,KAAE,IAAI,YAAa,MAAG,IAAEG,KAAE,OAAK,GAAGH,EAAC,KAAG,KAAGA,OAAIG,KAAEH,KAAGG,OAAIqC,GAAE,gBAAgBS,EAAC,MAAI9C,KAAE,SAAK,UAAKA,OAAIqC,GAAE,gBAAgBS,EAAC,IAAE9C,IAAEwC,GAAE,WAAS;AAAA,QAAI,CAAC,GAAEA,GAAE,OAAKvB,GAAEoB,IAAEwJ,IAAE,SAAQ,MAAK,aAAY,MAAK,GAAG,WAAU,MAAK,IAAE,KAAGrJ,GAAE,MAAKA,GAAE,OAAKvB,GAAEoB,IAAEwJ,IAAE,QAAO,MAAK,YAAW,MAAK,GAAG,UAAS,SAAShM,IAAE;AAAC,iBAAO,IAAEA;AAAA,QAAC,CAAC,KAAG2C,GAAE,MAAK,CAAC,aAAY,SAAS,EAAE,QAAQ,SAAS3C,IAAEiD,IAAE;AAAC,UAAAN,GAAE,OAAK1C,GAAEuC,IAAEwJ,IAAEhM,IAAE,GAAE,UAASiD,IAAE,GAAG,OAAOA,EAAC,CAAC,KAAGN,GAAE,MAAKA,GAAE,OAAKvB,GAAEoB,IAAEwJ,IAAEhM,KAAE,SAAQ,UAAS,eAAciD,IAAE,MAAK,MAAK,IAAE,KAAGN,GAAE,MAAKA,GAAE,OAAKvB,GAAEoB,IAAEwJ,IAAEhM,KAAE,QAAO,MAAK,cAAaiD,IAAE,GAAG,WAAWA,EAAC,GAAE,SAASjD,IAAE;AAAC,mBAAO,IAAEA;AAAA,UAAC,CAAC,KAAG2C,GAAE;AAAA,QAAI,CAAC,GAAEA,GAAE,cAAYvB,GAAEoB,IAAEwJ,IAAE,WAAU,MAAK,sBAAqB,MAAK,GAAG,kBAAkB,KAAGrJ,GAAE,aAAYA,GAAE,cAAYvB,GAAEoB,IAAEwJ,IAAE,gBAAe,MAAK,oBAAmB,MAAK,GAAG,kBAAiB,MAAK,IAAE,KAAGrJ,GAAE,aAAYA,GAAE,cAAYvB,GAAEoB,IAAEwJ,IAAE,eAAc,MAAK,mBAAkB,MAAK,GAAG,iBAAgB,SAAShM,IAAE;AAAC,iBAAO,IAAEA,MAAGA,MAAG;AAAA,QAAG,CAAC,KAAG2C,GAAE,aAAY,CAAC,oBAAmB,gBAAgB,EAAE,QAAQ,SAAS3C,IAAEiD,IAAE;AAAC,UAAAN,GAAE,cAAYvB,GAAEoB,IAAEwJ,IAAEhM,IAAE,MAAK,wBAAuBiD,IAAE,GAAG,qBAAqBA,EAAC,CAAC,KAAGN,GAAE,aAAYA,GAAE,cAAYvB,GAAEoB,IAAEwJ,IAAEhM,KAAE,SAAQ,UAAS,sBAAqBiD,IAAE,MAAK,MAAK,IAAE,KAAGN,GAAE,aAAYA,GAAE,cAAYvB,GAAEoB,IAAEwJ,IAAEhM,KAAE,QAAO,MAAK,qBAAoBiD,IAAE,GAAG,kBAAkBA,EAAC,GAAE,SAASjD,IAAE;AAAC,mBAAO,KAAGA;AAAA,UAAC,CAAC,KAAG2C,GAAE;AAAA,QAAW,CAAC,GAAE,CAAC,cAAa,YAAW,aAAa,EAAE,QAAQ,SAAS3C,IAAEiD,IAAE;AAAC,cAAI3C,IAAER,IAAEK,IAAEsI,KAAEuD,GAAEhM,EAAC,GAAEwD,KAAEhB,GAAE,SAASS,EAAC,KAAG,CAACtC,GAAE,eAAe,SAASsC,EAAC,IAAE,GAAGT,GAAE,SAASS,EAAC,EAAE,GAAG,EAAE,OAAKT,GAAE,SAASS,EAAC,GAAE3B,KAAE;AAAG,eAAIhB,KAAE,YAAU,OAAOmI,QAAKA,KAAEA,GAAE,KAAI,KAAKnI,MAAGmI,OAAInH,KAAEyK,GAAEtD,IAAE,OAAO,OAAKA,OAAIjF,IAAE;AAAC,gBAAGhB,GAAE,SAASS,EAAC,MAAI,GAAGtC,IAAE,GAAG6B,GAAE,SAASS,EAAC,EAAE,GAAG,CAAC,GAAET,GAAE,SAASS,EAAC,IAAE,KAAIwF,IAAE;AAAC,kBAAGnH,MAAGxB,KAAE,IAAIK,KAAEsI,IAAG,GAAG,GAAG,aAAa,MAAK,EAAG,QAAQ,SAASzI,IAAE;AAAC,gBAAAF,GAAE,KAAK,aAAaA,IAAEE,EAAC;AAAA,cAAC,CAAC,IAAEG,KAAE,IAAIkE,GAAE,EAAE,cAAa,CAACoE,EAAC,CAAC,GAAE,CAAC,GAAG9H,IAAE,GAAGR,GAAE,GAAG,GAAEH,EAAC;AAAE,sBAAM,IAAI,MAAM,uBAAuB;AAAE,cAAAwC,GAAE,SAASS,EAAC,IAAE9C;AAAA,YAAC;AAAC,YAAAQ,GAAE,eAAe,SAASsC,EAAC,IAAE3B;AAAA,UAAC;AAAA,QAAC,CAAC,GAAE,OAAO,KAAK,EAAE,EAAE,QAAQ,SAASxB,IAAE;AAAC,cAAIE,IAAEiD,IAAEwF,KAAE,GAAG3I,EAAC,GAAEQ,KAAER,KAAE,YAAWK,KAAEL,KAAE;AAAW,mBAAS0D,GAAE1D,IAAE;AAAC,gBAAIK,KAAE;AAAG,mBAAOsI,GAAE,YAAY,QAAQ,SAASzI,IAAE;AAAC,kBAAIiD,KAAEjD,GAAE,CAAC,GAAEM,KAAEN,GAAE,CAAC;AAAE,sBAAMA,GAAE,CAAC,KAAGG,GAAEG,EAAC,MAAIH,GAAEG,EAAC,IAAE,CAAA,KAAK,cAAY,OAAO2C,KAAEA,KAAE,SAAOA,KAAEhD,KAAEmB,IAAG,MAAM,MAAK,CAACjB,IAAEL,EAAC,EAAE,OAAOE,GAAE,MAAM,CAAC,CAAC,CAAC;AAAA,YAAC,CAAC,GAAEG;AAAA,UAAC;AAAC,mBAASmB,GAAEtB,IAAE;AAAC,gBAAIiD,IAAE3C,KAAER,KAAE;AAAe,mBAAOE,GAAE,eAAe,WAAW,IAAE,GAAGA,GAAE,SAAS,IAAEiD,KAAEtC,GAAE,SAASL,EAAC,IAAE0N,IAAGhO,GAAE,WAAUyI,GAAE,kBAAkB,KAAGxF,KAAE,CAAC,CAACjD,GAAE,WAAUW,GAAE,SAASL,EAAC,IAAE2C,KAAE+K,IAAG,CAAE,GAACvF,GAAE,kBAAkB,IAAE,SAAOxF,KAAE,CAAC,CAACwF,GAAE,gBAAe9H,GAAE,SAASL,EAAC,IAAE2C,KAAE+K,IAAG,CAAE,GAACvF,GAAE,kBAAkB,IAAE,OAAMxF;AAAA,UAAC;AAAC,UAAA+I,GAAE,eAAelM,EAAC,MAAIE,KAAEgM,GAAElM,EAAC,GAAE,GAAGE,EAAC,KAAGW,GAAE,SAASL,EAAC,IAAE,MAAG2C,KAAEtC,GAAE,SAASR,EAAC,IAAEqD,GAAExD,EAAC,GAAEyI,GAAE,SAAO9H,GAAE,SAASR,EAAC,EAAE,YAAUmB,GAAEtB,EAAC,OAAKiD,KAAEtC,GAAE,SAASL,EAAC,IAAE,CAAC,CAACN,QAAKW,GAAE,SAASR,EAAC,IAAEqD,GAAE,EAAE,GAAEiF,GAAE,SAAO9H,GAAE,SAASR,EAAC,EAAE,YAAUmB,GAAE,CAAA,CAAE,KAAI,GAAG2B,IAAET,GAAE1C,EAAC,CAAC,MAAI0C,GAAE1C,EAAC,IAAEmD,IAAEN,GAAE,SAAO;AAAA,QAAI,CAAC,GAAE,GAAGhC,IAAEgC,EAAC;AAAA,MAAC;AAAC,eAAS,GAAG3C,IAAEiD,IAAE3C,IAAE;AAAC,YAAIR,KAAE,EAAC,SAAQ,EAAC,UAAS,CAAA,GAAG,UAAS,CAAE,GAAC,iBAAgB,CAAA,GAAG,QAAO,IAAG,aAAY,CAAA,GAAG,YAAW,CAAE,GAAC,sBAAqB,CAAA,GAAG,oBAAmB,CAAE,GAAC,mBAAkB,CAAA,GAAG,UAAS,CAAC,IAAG,IAAG,EAAE,EAAC,GAAE,gBAAe,EAAC,UAAS,CAAC,OAAG,KAAE,GAAE,UAAS,CAAC,OAAG,OAAG,KAAE,EAAC,GAAE,UAAS,IAAG,UAAS,CAAA,GAAG,aAAY,CAAE,GAAC,QAAO,CAAA,GAAG,eAAc,CAAE,EAAA;AAAE,WAAGA,GAAE,UAAS,EAAE,GAAE,GAAGA,GAAE,UAAS,EAAE,GAAE,OAAO,KAAK,EAAE,EAAE,QAAQ,SAASE,IAAE;AAAC,cAAIiD,KAAE,GAAGjD,EAAC,EAAE;AAAM,aAAGF,GAAE,UAASmD,EAAC,GAAE,GAAGnD,GAAE,UAASmD,EAAC,GAAEnD,GAAE,QAAQE,EAAC,IAAE;AAAA,QAAE,CAAC,GAAE,GAAGF,GAAE,UAAS+M,EAAC,GAAE,GAAG/M,GAAE,UAAS+M,EAAC,GAAE/M,GAAE,SAAS,cAAYkN,IAAElN,GAAE,SAAS,mBAAiB,GAAGgM,GAAEkB,EAAC,EAAE,kBAAkB,GAAE,OAAO,eAAe,MAAK,OAAM,EAAC,OAAM,EAAEM,IAAE,CAAC,GAAExN,GAAE,MAAI,KAAK,KAAI,GAAG,KAAK,GAAG,IAAEA,IAAE,MAAI,UAAU,WAASQ,KAAEN,IAAEA,KAAE,OAAMM,KAAEA,MAAG,KAAIN,MAAGiD,QAAK3C,KAAE,GAAGA,EAAC,GAAEN,OAAIM,GAAE,QAAMN,KAAGiD,OAAI3C,GAAE,MAAI2C,MAAInD,GAAE,UAAQA,GAAE,SAAS,UAAQ,CAACQ,GAAE,MAAK,KAAK,WAAWA,EAAC;AAAA,MAAC;AAAC,eAAS,GAAGA,IAAE;AAAC,eAAO,SAASN,IAAE;AAAC,cAAIiD,KAAE,CAAA;AAAG,UAAAA,GAAE3C,EAAC,IAAEN,IAAE,KAAK,WAAWiD,EAAC;AAAA,QAAC;AAAA,MAAC;AAAC,eAAS,GAAGjD,IAAEiD,IAAE;AAAC,YAAI3C,IAAER,KAAE,EAAC,MAAKE,IAAE,UAAS,CAAA,GAAG,UAAS,CAAE,GAAC,cAAa,CAAA,EAAE,GAAEG,KAAE,CAAA;AAAG,QAAAH,GAAE,WAAW,MAAM,SAASA,IAAE;AAAC,iBAAM,EAAE,CAACiD,GAAE,WAAS,YAAU,OAAOjD,GAAE,OAAK,OAAOiD,GAAE,CAAC,MAAIjD,GAAE,OAAK,cAAY,OAAOA,GAAE,QAAM,CAACA,GAAE,KAAKiD,GAAE,CAAC,CAAC,QAAM9C,GAAEH,GAAE,UAAU,IAAEiD,GAAE,MAAO,GAAC;AAAA,QAAG,CAAC,GAAE3C,KAAE2C,GAAE,UAAQ,GAAGA,GAAE,CAAC,CAAC,IAAE,GAAGA,GAAE,CAAC,CAAC,IAAE,CAAA,GAAG,OAAO,KAAK9C,EAAC,EAAE,QAAQ,SAASH,IAAE;AAAC,UAAAM,GAAEN,EAAC,IAAEG,GAAEH,EAAC;AAAA,QAAC,CAAC,GAAEA,GAAE,UAAQ,GAAGF,GAAE,UAASE,GAAE,KAAK,GAAE,GAAGF,GAAE,UAASE,GAAE,KAAK,IAAG,OAAO,eAAe,MAAK,OAAM,EAAC,OAAM,EAAE,GAAE,CAAC,GAAE,OAAO,eAAe,MAAK,aAAY,EAAC,KAAI,WAAU;AAAC,iBAAM,CAAC,GAAG,KAAK,GAAG;AAAA,QAAC,EAAC,CAAC,GAAEF,GAAE,MAAI,KAAK,KAAIE,GAAE,QAAM,CAACA,GAAE,KAAKF,IAAEQ,EAAC,MAAI,GAAG,KAAK,GAAG,IAAER;AAAA,MAAE;AAAC,aAAO,KAAG,EAAC,MAAK,EAAC,OAAM,EAAC,UAAS,CAAE,GAAC,UAAS,CAAA,GAAG,gBAAe,CAAE,EAAA,GAAE,MAAK,MAAG,oBAAmB,EAAC,UAAS,KAAI,QAAO,SAAQ,GAAE,aAAY,CAAC,CAAC,QAAO,OAAM,UAAS,MAAK,MAAK,MAAK,SAASE,IAAE;AAAC,eAAO,IAAEA;AAAA,MAAC,CAAC,GAAE,CAAC,QAAO,OAAM,UAAS,MAAK,MAAK,MAAK,SAASA,IAAE;AAAC,eAAO,IAAEA;AAAA,MAAC,CAAC,CAAC,GAAE,MAAK,SAASA,IAAE;AAAC,WAAGA,IAAE,wBAAuB,GAAG,KAAK,MAAM,GAAEA,GAAE,SAAS,MAAM,mBAAiB,GAAE,GAAG,KAAK,OAAOA,EAAC;AAAA,MAAC,GAAE,QAAO,SAASA,IAAE;AAAC,YAAIiD,KAAEjD,GAAE;AAAS,WAAGA,IAAE,wBAAuB,GAAG,KAAK,MAAM,GAAEiD,GAAE,gBAAc,EAAE,OAAOA,GAAE,WAAW,GAAEA,GAAE,cAAY,OAAMjD,GAAE,SAAS,MAAM,kBAAgB,QAAOA,GAAE,SAAS,MAAM,mBAAiB,GAAE,GAAGA,GAAE,UAAS,GAAG,KAAK,KAAK;AAAA,MAAC,GAAE,QAAO,SAASiD,IAAE;AAAC,YAAIjD,IAAEM,KAAE2C,GAAE,UAASnD,KAAEmD,GAAE,UAAS9C,KAAEL,GAAE,cAAa2I,KAAE;AAAG,QAAAnI,GAAE,WAASH,GAAE,OAAK,IAAEL,GAAE,kBAAiBQ,GAAE,WAASH,GAAE,OAAKL,GAAE,kBAAiBQ,GAAE,iBAAeA,GAAE,WAASA,GAAE,UAASmI,KAAE,GAAGxF,IAAEnD,IAAE,YAAWQ,GAAE,QAAQ,KAAGmI,KAAGA,KAAE,GAAGxF,IAAEnD,IAAE,YAAWQ,GAAE,QAAQ,KAAGmI,QAAKxF,GAAE,SAAS,MAAM,kBAAgBnD,GAAE,WAAS,MAAIA,GAAE,WAAUQ,GAAE,oBAAkBmI,KAAE,GAAGxF,IAAEnD,IAAE,kBAAiBQ,GAAE,cAAc,GAAER,GAAE,qBAAmB2I,MAAG,GAAGnI,GAAE,kBAAiBR,GAAE,gBAAgB,OAAKQ,GAAE,gBAAcN,KAAE,EAAE,KAAKM,GAAE,WAAW,GAAE,EAAE,OAAOA,GAAE,WAAW,IAAGR,GAAE,mBAAiB,OAAMA,GAAE,qBAAmBQ,GAAE,cAAY,EAAE,IAAI,SAASN,IAAE;AAAC,kBAAO,IAAEA,MAAGF,GAAE,iBAAe;AAAA,QAAI,GAAE,SAASE,IAAE;AAAC,UAAAiD,GAAE,SAAS,MAAM,mBAAiBjD;AAAA,QAAC,GAAEM,GAAE,iBAAiB,UAAS,GAAEA,GAAE,iBAAiB,QAAO,OAAGN,EAAC,GAAEF,GAAE,mBAAiB,GAAGQ,GAAE,gBAAgB,MAAIR,GAAE,qBAAmBQ,GAAE,gBAAc,EAAE,OAAOA,GAAE,WAAW,GAAEA,GAAE,cAAY,OAAM2C,GAAE,SAAS,MAAM,mBAAiB,GAAEnD,GAAE,mBAAiB;AAAA,MAAK,EAAC,GAAE,UAAS,EAAC,OAAM,EAAC,kBAAiB,EAAC,OAAM,KAAE,GAAE,kBAAiB,EAAC,OAAM,MAAG,UAAS,KAAE,EAAC,GAAE,aAAY,CAAC,CAAC,QAAO,cAAa,UAAS,WAAU,GAAE,MAAK,MAAK,IAAE,GAAE,CAAC,QAAO,YAAW,UAAS,WAAU,GAAE,MAAK,MAAK,IAAE,CAAC,GAAE,MAAK,SAASE,IAAE;AAAC,YAAIiD,IAAEnD,KAAEE,GAAE,WAAW,UAASM,KAAEN,GAAE,MAAKG,KAAE,IAAE,MAAIH,GAAE,MAAI;AAAY,QAAAA,GAAE,wBAAsBiD,KAAE3C,GAAE,YAAYR,GAAE,gBAAgB,IAAG,gBAAgB,CAAC,GAAEmD,GAAE,KAAG9C,IAAE8C,GAAE,cAAc,UAAQ,aAAa,8BAA6B,CAACA,GAAE,IAAGA,GAAE,IAAGA,GAAE,IAAGA,GAAE,EAAE,EAAE,QAAQ,SAASjD,IAAE;AAAC,UAAAA,GAAE,QAAQ,uBAAuB,UAAU,mBAAkB,CAAC;AAAA,QAAC,CAAC,GAAEA,GAAE,sBAAoB,CAAC,GAAE,CAAC,EAAE,IAAI,SAASiD,IAAE;AAAC,cAAI3C,KAAEN,GAAE,sBAAsB,YAAYF,GAAE,gBAAgB,IAAG,MAAM,CAAC;AAAE,cAAG;AAAC,YAAAQ,GAAE,OAAO,UAAQ2C;AAAA,UAAC,SAAOjD,IAAE;AAAC,gBAAGA,GAAE,SAAO,aAAa;AAA4B,oBAAMA;AAAE,YAAAM,GAAE,aAAa,UAAS2C,EAAC;AAAA,UAAC;AAAC,iBAAO3C;AAAA,QAAC,CAAC,GAAE,GAAGN,IAAE,oBAAmB,GAAG,SAAS,MAAM,GAAE,GAAGA,IAAE,YAAW,GAAG,SAAS,MAAM,GAAEA,GAAE,SAAS,gBAAc,MAAGA,GAAE,SAAS,MAAM,SAAO,UAAQG,KAAE,KAAI,GAAG,SAAS,OAAOH,EAAC;AAAA,MAAC,GAAE,QAAO,SAASA,IAAE;AAAC,QAAAA,GAAE,0BAAwBA,GAAE,KAAK,YAAYA,GAAE,qBAAqB,GAAEA,GAAE,wBAAsBA,GAAE,sBAAoB,OAAM,GAAGA,IAAE,oBAAmB,GAAG,SAAS,MAAM,GAAE,GAAGA,IAAE,YAAW,GAAG,SAAS,MAAM,GAAEA,GAAE,SAAS,gBAAc,OAAGA,GAAE,SAAS,MAAM,SAAOA,GAAE,SAAS,YAAW,GAAGA,GAAE,UAAS,GAAG,SAAS,KAAK;AAAA,MAAC,GAAE,QAAO,SAASF,IAAE;AAAC,YAAIE,IAAEiD,IAAE9C,KAAEL,GAAE,UAAS2I,KAAE3I,GAAE,UAASQ,KAAEmI,GAAE,kBAAiBjF,KAAE1D,GAAE,SAAS,WAASA,GAAE,SAAS;AAAQ,SAAC,GAAE,CAAC,EAAE,QAAQ,SAASE,IAAE;AAAC,UAAAG,GAAE,iBAAiBH,EAAC,IAAEM,GAAE,QAAQN,EAAC,KAAGG,GAAE,aAAaH,EAAC;AAAA,QAAC,CAAC,GAAEiD,KAAEO,GAAE,CAAC,EAAE,CAAC,GAAErD,GAAE,iBAAiB,CAAC,IAAE,EAAC,GAAE8C,GAAE,GAAE,GAAEA,GAAE,EAAC,GAAEA,MAAGjD,KAAEwD,GAAEA,GAAE,SAAO,CAAC,GAAGxD,GAAE,SAAO,CAAC,GAAEG,GAAE,iBAAiB,CAAC,IAAE,EAAC,GAAE8C,GAAE,GAAE,GAAEA,GAAE,EAAC,GAAE,CAAC,GAAE,CAAC,EAAE,QAAQ,SAASA,IAAE;AAAC,cAAI3C;AAAE,aAAGR,IAAE2I,GAAE,kBAAiBxF,IAAE3C,KAAEH,GAAE,iBAAiB8C,EAAC,CAAC,MAAI,MAAI3C,KAAE,GAAGA,EAAC,GAAER,GAAE,oBAAoBmD,EAAC,EAAE,MAAM,YAAU3C,GAAE,CAAC,GAAER,GAAE,oBAAoBmD,EAAC,EAAE,MAAM,cAAY3C,GAAE,CAAC,KAAGR,GAAE,oBAAoBmD,EAAC,EAAE,MAAM,YAAU3C,KAAG,CAAC,KAAI,GAAG,EAAE,QAAQ,SAASN,IAAE;AAAC,aAACM,KAAEH,GAAE,iBAAiB8C,EAAC,EAAEjD,EAAC,OAAKyI,GAAE,iBAAiBxF,EAAC,EAAEjD,EAAC,MAAIF,GAAE,sBAAsBE,MAAGiD,KAAE,EAAE,EAAE,QAAQ,QAAMwF,GAAE,iBAAiBxF,EAAC,EAAEjD,EAAC,IAAEM;AAAA,UAAE,CAAC;AAAA,QAAC,CAAC;AAAA,MAAC,EAAC,GAAE,YAAW,EAAC,OAAM,EAAC,eAAc,IAAG,eAAc,CAAE,GAAC,iBAAgB,CAAA,GAAG,kBAAiB,CAAE,GAAC,oBAAmB,IAAG,cAAa,CAAA,GAAG,cAAa,GAAE,GAAE,aAAY,CAAC,CAAC,QAAO,MAAK,MAAK,MAAK,MAAK,CAAC,GAAE,CAAC,QAAO,MAAK,MAAK,MAAK,MAAK,CAAC,GAAE,CAAC,QAAO,QAAO,MAAK,MAAK,MAAK,GAAE,SAASN,IAAE;AAAC,eAAO,KAAGA;AAAA,MAAC,CAAC,GAAE,CAAC,QAAO,SAAQ,MAAK,MAAK,MAAK,QAAO,MAAK,IAAE,GAAE,CAAC,QAAO,WAAU,MAAK,MAAK,MAAK,KAAG,SAASA,IAAE;AAAC,eAAO,KAAGA,MAAGA,MAAG;AAAA,MAAC,CAAC,CAAC,GAAE,MAAK,SAASiD,IAAE;AAAC,YAAIjD,IAAEM,IAAER,IAAEK,IAAEsI,IAAEjF,KAAEP,GAAE,WAAW,UAAS3B,KAAE2B,GAAE,MAAKtC,KAAE,IAAE,MAAIsC,GAAE,MAAI,eAAc+I,MAAGhM,KAAEwD,IAAElD,KAAEK,IAAE8H,KAAE,CAAE,GAAC,aAAW,OAAOlH,OAAIA,KAAE,CAAC,CAAC,OAAO,0BAAwB,CAAC,KAAIkH,GAAE,aAAW,CAACA,GAAE,YAAU3I,KAAEE,GAAE,gBAAgB,IAAG,QAAQ,CAAC,GAAEF,GAAE,YAAY,UAAQ,aAAa,8BAA6BA,GAAE,EAAE,QAAQ,uBAAuB,UAAU,mBAAkB,CAAC,GAAEA,GAAE,EAAE,QAAQ,uBAAuB,UAAU,mBAAkB,CAAC,GAAEA,GAAE,MAAM,QAAQ,uBAAuB,UAAU,2BAA0B,GAAG,GAAEA,GAAE,OAAO,QAAQ,uBAAuB,UAAU,2BAA0B,GAAG,GAAEA,GAAE,KAAGQ,IAAEiB,MAAGkH,GAAE,YAAUA,GAAE,UAAQtI,KAAEL,GAAE,YAAYE,GAAE,gBAAgB,IAAG,cAAc,CAAC,GAAEyI,GAAE,aAAWtI,GAAE,UAAQsI,GAAE,UAAQ3I,GAAE,YAAYE,GAAE,gBAAgB,IAAG,gBAAgB,CAAC,GAAEyI,GAAE,YAAUtI,KAAEL,GAAE,YAAYE,GAAE,gBAAgB,IAAG,UAAU,CAAC,GAAEG,GAAE,OAAO,UAAQ,cAAaA,KAAEL,GAAE,YAAYE,GAAE,gBAAgB,IAAG,SAAS,CAAC,GAAEyI,GAAE,aAAWtI,GAAE,QAAOA,KAAEL,GAAE,YAAYE,GAAE,gBAAgB,IAAG,aAAa,CAAC,GAAG,IAAI,UAAQ,cAAaG,GAAE,SAAS,UAAQ,sBAAsB,8BAA6BA,KAAEL,GAAE,YAAYE,GAAE,gBAAgB,IAAG,SAAS,CAAC,GAAG,YAAYA,GAAE,gBAAgB,IAAG,aAAa,CAAC,GAAEG,GAAE,YAAYH,GAAE,gBAAgB,IAAG,aAAa,CAAC,EAAE,IAAI,UAAQ,kBAAiByI;AAAG,SAAC,aAAY,aAAY,WAAU,cAAa,YAAY,EAAE,QAAQ,SAASzI,IAAE;AAAC,UAAAiD,GAAE,oBAAkBjD,EAAC,IAAEgM,GAAEhM,EAAC;AAAA,QAAC,CAAC,GAAEgM,GAAE,WAAW,QAAQ,SAAShM,IAAE;AAAC,UAAAsB,GAAE,YAAYtB,EAAC;AAAA,QAAC,CAAC,GAAEiD,GAAE,KAAK,aAAa,UAAS,UAAQtC,KAAE,GAAG,GAAE,GAAGsC,IAAE,oBAAmB,GAAG,WAAW,UAAU,GAAE,GAAG,WAAW,OAAOA,EAAC;AAAA,MAAC,GAAE,QAAO,SAASjD,IAAE;AAAC,YAAIiD,KAAEjD,GAAE;AAAK,QAAAA,GAAE,8BAA4BA,GAAE,0BAA0B,QAAQ,SAASA,IAAE;AAAC,UAAAiD,GAAE,YAAYjD,EAAC;AAAA,QAAC,CAAC,GAAEA,GAAE,2BAAyBA,GAAE,2BAAyBA,GAAE,yBAAuBA,GAAE,4BAA0BA,GAAE,4BAA0B,OAAM,GAAGA,IAAE,oBAAmB,GAAG,WAAW,UAAU,GAAE,GAAGA,IAAE,CAAA,CAAE,GAAEA,GAAE,KAAK,gBAAgB,QAAQ,GAAE,GAAGA,GAAE,UAAS,GAAG,WAAW,KAAK;AAAA,MAAC,GAAE,QAAO,SAASA,IAAE;AAAC,YAAIiD,IAAE3C,IAAER,KAAEE,GAAE,UAASG,KAAEH,GAAE,UAASyI,KAAEtI,GAAE;AAAmB,QAAAL,GAAE,gBAAcmD,KAAEwF,GAAE,IAAG,GAAGzI,IAAEG,IAAE,iBAAgB8C,EAAC,MAAIjD,GAAE,yBAAyB,GAAG,UAAQiD,IAAE3C,KAAE,OAAIR,GAAE,gBAAcmD,KAAEwF,GAAE,IAAG,GAAGzI,IAAEG,IAAE,iBAAgB8C,EAAC,MAAIjD,GAAE,yBAAyB,GAAG,UAAQiD,IAAE3C,KAAE,OAAIR,GAAE,kBAAgBmD,KAAEwF,GAAE,MAAK,GAAGzI,IAAEG,IAAE,mBAAkB8C,EAAC,MAAIjD,GAAE,uBAAuB,gBAAgBiD,IAAEA,EAAC,GAAE3C,KAAE,OAAIA,MAAG,GAAGN,IAAE,CAAA,CAAE,GAAEF,GAAE,mBAAiBmD,KAAEwF,GAAE,OAAM,GAAGzI,IAAEG,IAAE,oBAAmB8C,EAAC,MAAIjD,GAAE,0BAA0B,aAAWiD,KAAGnD,GAAE,qBAAmBmD,KAAEwF,GAAE,SAAQ,GAAGzI,IAAEG,IAAE,sBAAqB8C,EAAC,MAAIjD,GAAE,0BAA0B,eAAaiD;AAAA,MAAE,GAAE,YAAW,SAASnD,IAAEK,IAAE;AAAC,YAAIH,IAAEiD,IAAEwF,KAAE3I,GAAE,UAAS0D,KAAE1D,GAAE;AAAS,gBAAM2I,GAAE,kBAAgBzI,KAAE,IAAEyI,GAAE,kBAAiBxF,KAAE,EAAC,IAAG9C,GAAE,KAAGH,KAAEyI,GAAE,eAAc,IAAGtI,GAAE,KAAGH,KAAEyI,GAAE,eAAc,IAAGtI,GAAE,KAAGH,KAAEyI,GAAE,eAAc,IAAGtI,GAAE,KAAGH,KAAEyI,GAAE,cAAa,GAAG,KAAGtI,GAAE,OAAKA,GAAE,KAAG8C,GAAE,KAAIA,GAAE,KAAG9C,GAAE,OAAKA,GAAE,KAAG8C,GAAE,KAAIA,GAAE,KAAG9C,GAAE,OAAKA,GAAE,KAAG8C,GAAE,KAAIA,GAAE,KAAG9C,GAAE,OAAKA,GAAE,KAAG8C,GAAE,KAAI,CAAC,KAAI,GAAG,EAAE,QAAQ,SAASjD,IAAE;AAAC,cAAIiD,IAAE3C,KAAE,gBAAcN;AAAE,UAAAyI,GAAEnI,EAAC,IAAE2C,KAAE9C,GAAEH,KAAE,GAAG,GAAE,GAAGF,IAAE0D,IAAElD,IAAE2C,EAAC,MAAInD,GAAE,yBAAyBE,EAAC,EAAE,QAAQ,QAAMiD;AAAA,QAAE,CAAC;AAAA,MAAE,EAAC,EAAC,GAAE,OAAO,KAAK,EAAE,EAAE,QAAQ,SAASjD,IAAE;AAAC,YAAIiD,KAAE,GAAGjD,EAAC,GAAEM,KAAE2C,GAAE;AAAM,QAAA3C,GAAEN,KAAE,UAAU,IAAE,EAAC,UAAS,MAAE,GAAEM,GAAEN,KAAE,UAAU,IAAE,EAAC,UAAS,KAAE,GAAEiD,GAAE,SAAO3C,GAAEN,KAAE,cAAc,IAAE,IAAGM,GAAEN,KAAE,SAAS,IAAE,CAAE;AAAA,MAAC,CAAC,GAAE8L,KAAE,EAAC,MAAK,EAAC,oBAAmB,CAAE,GAAC,MAAK,SAAS9L,IAAEiD,IAAE;AAAC,YAAI3C,KAAEN,GAAE;AAAS,QAAAM,GAAE,gBAAc,EAAE,OAAOA,GAAE,WAAW,GAAEA,GAAE,cAAY,OAAMwL,GAAE,KAAK,MAAM9L,IAAEiD,EAAC;AAAA,MAAC,GAAE,OAAM,SAASjD,IAAEiD,IAAE;AAAC,QAAA6I,GAAE,KAAK,KAAK9L,IAAE,IAAE;AAAA,MAAC,GAAE,MAAK,SAASA,IAAEiD,IAAE3C,IAAE;AAAC,YAAIR,KAAEE,GAAE;AAAS,eAAOM,KAAE,QAAMA,KAAEA,KAAEN,GAAE,SAAS,SAAQF,GAAE,cAAY,OAAGmD,MAAG,GAAGjD,IAAEM,EAAC,GAAEA,KAAE,IAAE;AAAA,MAAC,EAAC,GAAE,MAAK,EAAC,oBAAmB,EAAC,UAAS,KAAI,QAAO,SAAQ,GAAE,MAAK,SAASA,IAAEN,IAAE;AAAC,YAAIiD,KAAE3C,GAAE,UAASR,KAAEQ,GAAE;AAAS,QAAA2C,GAAE,eAAa,EAAE,OAAOA,GAAE,WAAW,GAAEA,GAAE,cAAY,EAAE,IAAI,SAASjD,IAAE;AAAC,iBAAOA;AAAA,QAAC,GAAE,SAASA,IAAEiD,IAAE;AAAC,UAAAA,KAAE6I,GAAE,KAAK,KAAKxL,IAAE,IAAE,KAAGA,GAAE,IAAI,MAAM,UAAQN,KAAE,IAAG,OAAK,GAAGM,IAAEA,GAAE,GAAG,GAAE,GAAGA,EAAC;AAAA,QAAG,GAAER,GAAE,iBAAiB,UAAS,GAAEA,GAAE,iBAAiB,QAAO,MAAK,KAAE,GAAEgM,GAAE,KAAK,MAAMxL,IAAEN,EAAC;AAAA,MAAC,GAAE,OAAM,SAASA,IAAEiD,IAAE;AAAC,YAAI3C,IAAER,KAAEE,GAAE;AAAS,QAAAF,GAAE,gBAAcQ,KAAE,EAAE,KAAKR,GAAE,WAAW,IAAG,GAAGE,IAAE,CAAC,GAAEF,GAAE,cAAY,MAAG,EAAE,MAAMA,GAAE,aAAY,CAACE,GAAE,SAAS,SAAQ,QAAMiD,KAAEA,KAAE3C,EAAC;AAAA,MAAC,GAAE,MAAK,SAASN,IAAEiD,IAAE3C,IAAE;AAAC,YAAIR,IAAEK,KAAEH,GAAE;AAAS,eAAOM,KAAE,QAAMA,KAAEA,KAAEN,GAAE,SAAS,SAAQF,KAAEK,GAAE,cAAY,EAAE,KAAKA,GAAE,WAAW,IAAEG,KAAE,IAAE,GAAEH,GAAE,cAAY,OAAG8C,OAAIjD,GAAE,IAAI,MAAM,UAAQM,KAAE,KAAG,KAAI,GAAGN,IAAEM,EAAC,IAAGR;AAAA,MAAC,EAAC,GAAE,MAAK,EAAC,oBAAmB,EAAC,UAAS,KAAI,QAAO,CAAC,MAAI,GAAE,MAAI,CAAC,EAAC,GAAE,MAAK,SAASQ,IAAEN,IAAE;AAAC,YAAIiD,KAAE3C,GAAE,UAASR,KAAEQ,GAAE,UAASkD,KAAElD,GAAE,SAAS,SAAQH,KAAE,GAAGqD,EAAC,GAAElC,KAAEnB,GAAE,SAAQQ,KAAER,GAAE;AAAO,QAAA8C,GAAE,eAAa,EAAE,OAAOA,GAAE,WAAW,GAAEA,GAAE,cAAY,EAAE,IAAI,SAASjD,IAAE;AAAC,cAAIiD,IAAE3C,IAAER,IAAEK,IAAEsI,KAAE;AAAG,cAAG,MAAIzI;AAAE,YAAAM,KAAE,CAAC,CAACkD,GAAE,CAAC,EAAE,CAAC,GAAEA,GAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AAAA,mBAAU,MAAIxD;AAAE,YAAAM,KAAEkD;AAAA,eAAM;AAAC,iBAAIP,KAAEtC,KAAEX,IAAEM,KAAE,CAAA,GAAG2C,MAAG3B,GAAE,EAAEmH,EAAC;AAAG,cAAAnI,GAAE,KAAKkD,GAAEiF,EAAC,CAAC,GAAExF,MAAG3B,GAAEmH,EAAC;AAAE,YAAAxF,OAAI,OAAKnD,KAAE0D,GAAEiF,EAAC,GAAG,SAAOnI,GAAE,KAAK,CAACR,GAAE,CAAC,GAAE,GAAGA,GAAE,CAAC,GAAEA,GAAE,CAAC,GAAEmD,KAAE3B,GAAEmH,EAAC,CAAC,CAAC,CAAC,KAAGtI,KAAE,GAAGL,GAAE,CAAC,GAAEA,GAAE,CAAC,GAAEA,GAAE,CAAC,GAAEA,GAAE,CAAC,GAAE,GAAGA,GAAE,CAAC,GAAEA,GAAE,CAAC,GAAEA,GAAE,CAAC,GAAEA,GAAE,CAAC,GAAEmD,EAAC,CAAC,GAAE3C,GAAE,KAAK,CAACR,GAAE,CAAC,GAAEK,GAAE,QAAOA,GAAE,QAAOA,EAAC,CAAC;AAAA,UAAG;AAAC,iBAAOG;AAAA,QAAC,GAAE,SAASN,IAAEiD,IAAE;AAAC,UAAAA,KAAE6I,GAAE,KAAK,KAAKxL,IAAE,IAAE,KAAGA,GAAE,SAAS,UAAQN,IAAE,GAAGM,IAAE,EAAC,MAAK,KAAE,CAAC;AAAA,QAAE,GAAER,GAAE,iBAAiB,UAAS,GAAEA,GAAE,iBAAiB,QAAO,MAAK,KAAE,GAAEgM,GAAE,KAAK,MAAMxL,IAAEN,EAAC;AAAA,MAAC,GAAE,OAAM,SAASA,IAAEiD,IAAE;AAAC,YAAI3C,IAAER,KAAEE,GAAE;AAAS,QAAAF,GAAE,gBAAcQ,KAAE,EAAE,KAAKR,GAAE,WAAW,IAAG,GAAGE,IAAE,CAAC,GAAEF,GAAE,cAAY,MAAG,GAAGE,IAAE,gBAAe8L,GAAE,KAAK,MAAM,GAAE,EAAE,MAAMhM,GAAE,aAAY,CAACE,GAAE,SAAS,SAAQ,QAAMiD,KAAEA,KAAE3C,EAAC;AAAA,MAAC,GAAE,MAAK,SAASN,IAAEiD,IAAE3C,IAAE;AAAC,YAAIR,IAAEK,KAAEH,GAAE;AAAS,eAAOM,KAAE,QAAMA,KAAEA,KAAEN,GAAE,SAAS,SAAQF,KAAEK,GAAE,cAAY,EAAE,KAAKA,GAAE,WAAW,IAAEG,KAAE,IAAE,GAAEH,GAAE,cAAY,OAAG8C,OAAIjD,GAAE,SAAS,UAAQM,KAAE,OAAK,CAAC,CAACN,GAAE,SAAS,QAAQ,CAAC,EAAE,CAAC,GAAEA,GAAE,SAAS,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,GAAE,GAAGA,IAAE,EAAC,MAAK,KAAE,CAAC,GAAE,GAAGA,IAAEM,EAAC,IAAGR;AAAA,MAAC,GAAE,QAAO,SAASE,IAAE;AAAC,WAAGA,IAAE,gBAAe8L,GAAE,KAAK,MAAM,GAAE9L,GAAE,SAAS,cAAY8L,GAAE,KAAK,KAAK9L,IAAE8L,GAAE,KAAK,KAAK9L,EAAC,CAAC,IAAEA,GAAE,SAAS,mBAAiB;MAAE,EAAC,EAAC,GAAE,CAAC,CAAC,SAAQ,YAAW,CAAC,GAAE,CAAC,OAAM,YAAW,CAAC,GAAE,CAAC,SAAQ,WAAW,GAAE,CAAC,QAAO,UAAU,GAAE,CAAC,sBAAqB,mBAAkB,CAAC,GAAE,CAAC,oBAAmB,mBAAkB,CAAC,GAAE,CAAC,kBAAiB,eAAc,CAAC,GAAE,CAAC,gBAAe,eAAc,CAAC,GAAE,CAAC,iBAAgB,cAAa,CAAC,GAAE,CAAC,eAAc,cAAa,CAAC,GAAE,CAAC,WAAU,oBAAoB,GAAE,CAAC,gBAAe,kBAAkB,GAAE,CAAC,eAAc,iBAAiB,GAAE,CAAC,oBAAmB,wBAAuB,CAAC,GAAE,CAAC,kBAAiB,wBAAuB,CAAC,GAAE,CAAC,yBAAwB,sBAAqB,CAAC,GAAE,CAAC,uBAAsB,sBAAqB,CAAC,GAAE,CAAC,wBAAuB,qBAAoB,CAAC,GAAE,CAAC,sBAAqB,qBAAoB,CAAC,CAAC,EAAE,QAAQ,SAASA,IAAE;AAAC,YAAIiD,KAAEjD,GAAE,CAAC,GAAEM,KAAEN,GAAE,CAAC,GAAEF,KAAEE,GAAE,CAAC;AAAE,eAAO,eAAe,GAAG,WAAUiD,IAAE,EAAC,KAAI,WAAU;AAAC,cAAIjD,KAAE,QAAMF,KAAE,GAAG,KAAK,GAAG,EAAE,QAAQQ,EAAC,EAAER,EAAC,IAAEQ,KAAE,GAAG,KAAK,GAAG,EAAE,QAAQA,EAAC,IAAE,GAAG,KAAK,GAAG,EAAE,QAAQ2C,EAAC;AAAE,iBAAO,QAAMjD,KAAE,IAAE,GAAGA,EAAC;AAAA,QAAC,GAAE,KAAI,GAAGiD,EAAC,GAAE,YAAW,KAAE,CAAC;AAAA,MAAC,CAAC,GAAE,CAAC,CAAC,QAAOwJ,EAAC,GAAE,CAAC,eAAcL,IAAE,YAAW,CAAC,GAAE,CAAC,aAAYA,IAAE,YAAW,CAAC,GAAE,CAAC,aAAY,GAAE,UAAS,CAAC,GAAE,CAAC,WAAU,GAAE,UAAS,CAAC,CAAC,EAAE,QAAQ,SAASpM,IAAE;AAAC,YAAIF,KAAEE,GAAE,CAAC,GAAEG,KAAEH,GAAE,CAAC,GAAEyI,KAAEzI,GAAE,CAAC,GAAEwD,KAAExD,GAAE,CAAC;AAAE,eAAO,eAAe,GAAG,WAAUF,IAAE,EAAC,KAAI,WAAU;AAAC,cAAImD,IAAE3C,KAAE,QAAMkD,KAAE,GAAG,KAAK,GAAG,EAAE,QAAQiF,EAAC,EAAEjF,EAAC,IAAEiF,KAAE,GAAG,KAAK,GAAG,EAAE,QAAQA,EAAC,IAAE,GAAG,KAAK,GAAG,EAAE,QAAQ3I,EAAC;AAAE,iBAAOQ,KAAE,OAAO,KAAKH,EAAC,EAAE,KAAK,SAASH,IAAE;AAAC,mBAAOG,GAAEH,EAAC,MAAIM,OAAI2C,KAAEjD,IAAE;AAAA,UAAG,CAAC,IAAEiD,KAAE,IAAI,MAAM,aAAa,IAAE;AAAA,QAAC,GAAE,KAAI,GAAGnD,EAAC,GAAE,YAAW,KAAE,CAAC;AAAA,MAAC,CAAC,GAAE,OAAO,KAAK,EAAE,EAAE,QAAQ,SAASQ,IAAE;AAAC,YAAIR,KAAE,GAAGQ,EAAC;AAAE,eAAO,eAAe,GAAG,WAAUA,IAAE,EAAC,KAAI,WAAU;AAAC,cAAI0L,IAAEhM,IAAEiD,KAAE,GAAG,KAAK,GAAG,EAAE,QAAQ3C,EAAC;AAAE,iBAAO,GAAG2C,EAAC,KAAG+I,KAAE/I,IAAEjD,KAAEF,GAAE,YAAY,OAAO,SAASE,IAAEiD,IAAE;AAAC,gBAAI3C,IAAER,KAAEmD,GAAE,CAAC,GAAE9C,KAAE8C,GAAE,CAAC,GAAEwF,KAAExF,GAAE,CAAC,GAAEO,KAAEP,GAAE,CAAC,GAAE3B,KAAE2B,GAAE,CAAC,GAAEtC,KAAE,QAAMW,KAAE0K,GAAExI,EAAC,EAAElC,EAAC,IAAEkC,KAAEwI,GAAExI,EAAC,IAAEwI,GAAE7L,EAAC;AAAE,mBAAOH,GAAEG,EAAC,IAAE,SAAOL,KAAEa,KAAE,OAAO,KAAK8H,EAAC,EAAE,KAAK,SAASzI,IAAE;AAAC,qBAAOyI,GAAEzI,EAAC,MAAIW,OAAIL,KAAEN,IAAE;AAAA,YAAG,CAAC,IAAEM,KAAE,IAAI,MAAM,aAAa,IAAE,IAAE,QAAMK,KAAE,IAAE,GAAGA,EAAC,GAAEX;AAAA,UAAC,GAAE,CAAE,CAAA,GAAEF,GAAE,SAAOE,GAAE,YAAU,GAAGgM,GAAE,SAAS,IAAGhM,MAAGiD;AAAA,QAAC,GAAE,KAAI,GAAG3C,EAAC,GAAE,YAAW,KAAE,CAAC;AAAA,MAAC,CAAC,GAAE,CAAC,cAAa,YAAW,aAAa,EAAE,QAAQ,SAASN,IAAEM,IAAE;AAAC,eAAO,eAAe,GAAG,WAAUN,IAAE,EAAC,KAAI,WAAU;AAAC,cAAIA,KAAE,GAAG,KAAK,GAAG,GAAEiD,KAAEjD,GAAE;AAAQ,iBAAOiD,GAAE,SAAS3C,EAAC,KAAG,CAACN,GAAE,eAAe,SAASM,EAAC,IAAE,GAAG2C,GAAE,SAAS3C,EAAC,EAAE,GAAG,EAAE,OAAK2C,GAAE,SAAS3C,EAAC,KAAG;AAAA,QAAE,GAAE,KAAI,GAAGN,EAAC,GAAE,YAAW,KAAE,CAAC;AAAA,MAAC,CAAC,GAAE,GAAG,UAAU,aAAW,SAASA,IAAE;AAAC,eAAO,GAAG,GAAG,KAAK,GAAG,GAAEA,EAAC,GAAE;AAAA,MAAI,GAAE,GAAG,UAAU,WAAS,WAAU;AAAC,eAAO,GAAG,GAAG,KAAK,GAAG,GAAE,EAAC,UAAS,KAAE,CAAC,GAAE;AAAA,MAAI,GAAE,GAAG,UAAU,SAAO,WAAU;AAAC,YAAIiD,KAAE,GAAG,KAAK,GAAG,GAAE3C,KAAE2C,GAAE;AAAS,eAAO,KAAK,EAAE,EAAE,QAAQ,SAASjD,IAAE;AAAC,cAAIiD,KAAEjD,KAAE;AAAU,UAAAM,GAAE2C,EAAC,KAAG,EAAE,OAAO3C,GAAE2C,EAAC,CAAC;AAAA,QAAC,CAAC,GAAE3C,GAAE,eAAa,EAAE,OAAOA,GAAE,WAAW,GAAE2C,GAAE,YAAY,MAAK,EAAG,QAAQ,SAASjD,IAAE;AAAC,aAAGiD,IAAEjD,EAAC;AAAA,QAAC,CAAC,GAAEiD,GAAE,cAAYA,GAAE,OAAKA,GAAE,WAAW,SAAS,KAAK,YAAYA,GAAE,GAAG,GAAE,OAAO,GAAG,KAAK,GAAG;AAAA,MAAC,GAAE,GAAG,UAAU,OAAK,SAASjD,IAAEiD,IAAE;AAAC,eAAO,GAAG,GAAG,KAAK,GAAG,GAAE,MAAGjD,IAAEiD,EAAC,GAAE;AAAA,MAAI,GAAE,GAAG,UAAU,OAAK,SAASjD,IAAEiD,IAAE;AAAC,eAAO,GAAG,GAAG,KAAK,GAAG,GAAE,OAAGjD,IAAEiD,EAAC,GAAE;AAAA,MAAI,GAAEwF,KAAE,SAASxF,IAAE;AAAC,QAAAA,MAAG,GAAGA,GAAE,GAAG,MAAIA,GAAE,aAAa,QAAQ,QAAQ,SAASjD,IAAE;AAAC,aAAGA,GAAE,OAAMiD,IAAE,IAAE;AAAA,QAAC,CAAC,GAAEA,GAAE,KAAK,UAAQA,GAAE,KAAK,OAAOA,EAAC,GAAE,OAAO,GAAGA,GAAE,GAAG;AAAA,MAAE,GAAE,GAAG,UAAU,SAAO,WAAU;AAAC,YAAIA,KAAE,MAAK3C,KAAE,GAAG2C,GAAE,GAAG;AAAE,QAAA3C,OAAIA,GAAE,aAAa,MAAO,EAAC,QAAQ,SAASN,IAAE;AAAC,UAAAM,GAAE,KAAK,aAAaA,IAAEN,EAAC;AAAA,QAAC,CAAC,GAAE,GAAG,WAAU;AAAC,cAAIA,KAAE,GAAGiD,GAAE,GAAG;AAAE,UAAAjD,OAAI,QAAQ,MAAM,sDAAsD,GAAEyI,GAAEzI,EAAC;AAAA,QAAE,CAAC;AAAA,MAAE,GAAEqE,KAAE,IAAG,OAAO,uBAAqBA,IAAE0H,KAAE,SAAS/L,IAAEiD,IAAE;AAAC,eAAOjD,cAAaqE,OAAI,EAAErE,GAAE,aAAWiD,MAAG,GAAGjD,GAAE,GAAG,EAAE,KAAK,SAAOiD,OAAI;AAAA,MAAK,GAAE,IAAE,EAAC,aAAY,EAAC,MAAK,UAAS,YAAW,CAAC,EAAC,YAAW,WAAU,MAAK,GAAE,CAAC,GAAE,MAAK,SAASjD,IAAEiD,IAAE;AAAC,eAAOjD,GAAE,UAAQ,EAAE,YAAY,aAAaiD,GAAE,OAAO,GAAEjD,GAAE,IAAE,EAAE,YAAY,aAAaiD,GAAE,GAAE,IAAE,KAAG,CAAC,KAAG,IAAE,GAAEjD,GAAE,IAAE,EAAE,YAAY,aAAaiD,GAAE,GAAE,IAAE,KAAG,CAAC,KAAG,IAAE,GAAE;AAAA,MAAE,GAAE,cAAa,SAASjD,IAAEiD,IAAE;AAAC,YAAI3C,KAAE2C,GAAE,OAAMnD,KAAE,CAAE,GAACK,KAAEH,GAAE,SAAQyI,KAAEnI,GAAE,QAAQ,SAAS,YAAU2C,GAAE,aAAW,IAAE,CAAC;AAAE,QAAA9C,OAAIsI,OAAItI,KAAEsI,OAAI,SAAS,OAAK,IAAIpE,GAAE,EAAE,aAAY,CAAClE,EAAC,CAAC,IAAE,SAAS,OAAML,GAAEmD,GAAE,UAAU,IAAE9C,IAAE,GAAGG,IAAER,EAAC;AAAA,MAAC,GAAE,aAAY,SAASE,IAAEiD,IAAE;AAAC,YAAI3C,KAAE,GAAGN,GAAE,SAAQiD,GAAE,UAAU,GAAEnD,KAAEQ,GAAE,OAAMH,KAAEG,GAAE;AAAO,eAAOA,GAAE,QAAMA,GAAE,SAAO,GAAEA,GAAE,OAAKA,GAAE,QAAMA,GAAE,OAAKN,GAAE,EAAE,CAAC,KAAGA,GAAE,EAAE,CAAC,IAAEF,KAAE,IAAGQ,GAAE,MAAIA,GAAE,SAAOA,GAAE,MAAIN,GAAE,EAAE,CAAC,KAAGA,GAAE,EAAE,CAAC,IAAEG,KAAE,IAAGG;AAAA,MAAC,GAAE,cAAa,SAASN,IAAEiD,IAAE;AAAC,YAAI3C,IAAER,IAAEK,KAAE;AAAG,eAAO,GAAGH,EAAC,IAAEF,KAAEE,KAAE,YAAU,OAAOA,OAAIM,KAAE8C,GAAE,KAAKpD,EAAC,MAAIM,GAAE,CAAC,MAAIH,KAAE,OAAKL,KAAE,WAAWQ,GAAE,CAAC,CAAC,IAAE,OAAM,QAAMR,OAAImD,MAAG,KAAGnD,MAAG,CAACA,IAAEK,EAAC,IAAE;AAAA,MAAI,GAAE,cAAa,SAASH,IAAE;AAAC,YAAG,QAAMA;AAAE,UAAAA,KAAE,SAAS;AAAA,iBAAa,CAAC,GAAGA,EAAC;AAAE,gBAAM,IAAI,MAAM,2BAA2B;AAAE,eAAOA;AAAA,MAAC,EAAC,GAAE,YAAW,EAAC,MAAK,UAAS,YAAW,CAAC,EAAC,YAAW,WAAU,MAAK,GAAE,GAAE,EAAC,YAAW,SAAQ,MAAK,SAAQ,CAAC,GAAE,OAAM,EAAC,OAAM,CAAE,GAAC,aAAY,CAAA,GAAG,cAAa,CAAE,GAAC,eAAc,IAAG,aAAY,CAAA,GAAG,YAAW,CAAE,GAAC,aAAY,CAAA,GAAG,SAAQ,IAAG,UAAS,CAAA,GAAG,aAAY,EAAC,UAAS,KAAE,GAAE,SAAQ,CAAA,GAAG,SAAQ,GAAE,GAAE,MAAK,SAASG,IAAEH,IAAE;AAAC,YAAIiD,IAAE3C,IAAER,IAAE2I,KAAE,CAAA;AAAG,eAAOtI,GAAE,UAAQ,EAAE,YAAY,aAAaH,GAAE,OAAO,GAAE,YAAU,OAAOA,GAAE,UAAQG,GAAE,QAAMH,GAAE,MAAM,KAAM,IAAE,YAAU,OAAOA,GAAE,cAAYG,GAAE,OAAKH,GAAE,UAAU,KAAM,IAAE,GAAGA,GAAE,IAAI,KAAG,KAAGA,GAAE,SAAOG,GAAE,OAAKH,GAAE,OAAMA,GAAE,SAAOG,GAAE,OAAK,MAAG,GAAGH,GAAE,KAAK,GAAG,KAAG,IAAEA,GAAE,KAAK,QAAMG,GAAE,UAAQH,GAAE,KAAK,MAAK,GAAGA,GAAE,KAAK,GAAG,KAAG,IAAEA,GAAE,KAAK,QAAMG,GAAE,UAAQH,GAAE,KAAK,OAAM,aAAWA,GAAE,QAAMG,GAAE,QAAMH,GAAE,QAAM,cAAYA,GAAE,SAAO,MAAM,QAAQA,GAAE,MAAM,KAAG,KAAGA,GAAE,OAAO,UAAQA,GAAE,OAAO,MAAM,SAASA,IAAE;AAAC,cAAIiD,KAAE,CAAA;AAAG,iBAAM,EAAE,EAAEA,GAAE,IAAE,EAAE,YAAY,aAAajD,GAAE,CAAC,GAAE,IAAE,MAAI,EAAEiD,GAAE,IAAE,EAAE,YAAY,aAAajD,GAAE,CAAC,GAAE,IAAE,QAAMyI,GAAE,KAAKxF,EAAC,IAAGA,GAAE,EAAE,CAAC,KAAGA,GAAE,EAAE,CAAC,OAAK9C,GAAE,WAAS,OAAI;AAAA,QAAG,CAAC,KAAGA,GAAE,QAAMH,GAAE,OAAMG,GAAE,SAAOsI,OAAItI,GAAE,QAAM,QAAOA,GAAE,SAAO,GAAGH,GAAE,MAAM,KAAG,KAAGA,GAAE,SAAOA,GAAE,SAAO,IAAG,WAASG,GAAE,SAAO,aAAWA,GAAE,UAAQA,GAAE,IAAE,EAAE,YAAY,aAAaH,GAAE,GAAE,IAAE,KAAG,CAAC,OAAK,IAAE,GAAEG,GAAE,IAAE,EAAE,YAAY,aAAaH,GAAE,GAAE,IAAE,KAAG,CAAC,OAAK,IAAE,GAAEG,GAAE,QAAM,EAAE,YAAY,aAAaH,GAAE,KAAK,KAAG,CAAC,KAAI,IAAE,GAAEG,GAAE,SAAO,EAAE,YAAY,aAAaH,GAAE,MAAM,KAAG,CAAC,KAAI,IAAE,IAAGG,GAAE,EAAE,CAAC,KAAGA,GAAE,EAAE,CAAC,KAAGA,GAAE,MAAM,CAAC,KAAGA,GAAE,OAAO,CAAC,OAAKA,GAAE,WAAS,QAAK8C,KAAE9C,GAAE,QAAQ,eAAcA,GAAE,MAAIG,KAAE2C,GAAE,gBAAgB,IAAG,KAAK,GAAE3C,GAAE,UAAU,UAAQ,IAAE,eAAcA,GAAE,QAAQ,WAASA,GAAE,aAAa,WAAU,SAAS,GAAEH,GAAE,OAAKG,GAAE,YAAY2C,GAAE,gBAAgB,IAAG,MAAM,CAAC,GAAE9C,GAAE,KAAK,MAAM,OAAKA,GAAE,QAAM,QAAOA,GAAE,UAAQ,OAAGG,GAAE,MAAM,aAAW,UAAS2C,GAAE,KAAK,YAAY3C,EAAC,GAAE,GAAGR,KAAEmD,GAAE,WAAW,GAAE9C,GAAE,aAAW,GAAGL,EAAC,GAAEK,GAAE,cAAY,WAAU;AAAC,cAAIH,IAAEiD,KAAE9C,GAAE,UAASG,KAAEH,GAAE,UAASL,KAAEK,GAAE,aAAa,SAAOA,GAAE,aAAa,CAAC,EAAE,MAAM,WAAS;AAAK,UAAA8C,GAAE,QAAMjD,KAAEG,GAAE,UAAQL,KAAEA,GAAE,aAAW,GAAG,YAAW,GAAGK,IAAEG,IAAE,SAAQN,EAAC,MAAIG,GAAE,KAAK,MAAM,SAAOH;AAAA,QAAE,GAAEG,GAAE,aAAW,WAAU;AAAC,aAAGA,IAAEA,GAAE,aAAa,KAAK,SAASH,IAAE;AAAC,mBAAM,SAAKA,GAAE,MAAM;AAAA,UAAO,CAAC,CAAC;AAAA,QAAC,GAAE;AAAA,MAAE,GAAE,MAAK,SAASA,IAAEiD,IAAE;AAAC,YAAI3C,KAAE2C,GAAE;AAAM,eAAOjD,GAAE,SAAO,GAAGM,IAAE,kBAAiBN,GAAE,WAAW,GAAE,GAAGM,IAAE,WAAUN,GAAE,UAAU,GAAE,GAAG,WAAU;AAAC,UAAAA,GAAE,YAAa,GAACA,GAAE,WAAY;AAAA,QAAA,CAAC,GAAE;AAAA,MAAE,GAAE,QAAO,SAASA,IAAEiD,IAAE;AAAC,YAAI3C,KAAE2C,GAAE;AAAM,QAAAjD,GAAE,SAAO,GAAGM,IAAE,kBAAiBN,GAAE,WAAW,GAAE,GAAGM,IAAE,WAAUN,GAAE,UAAU,GAAE,IAAEA,GAAE,aAAa,UAAQ,GAAG,WAAU;AAAC,UAAAA,GAAE,YAAW,GAAGA,GAAE,WAAU,GAAG,EAAE,WAAW,OAAOA,EAAC,KAAGA,GAAE,aAAa,QAAQ,SAASA,IAAE;AAAC,eAAGA,GAAE,OAAM,EAAC,UAAS,KAAE,CAAC;AAAA,UAAC,CAAC;AAAA,QAAC,CAAC;AAAA,MAAC,GAAE,cAAa,SAASA,IAAEiD,IAAE;AAAC,UAAE,YAAY,aAAajD,IAAEiD,EAAC;AAAA,MAAC,GAAE,QAAO,SAASA,IAAE;AAAC,QAAAA,GAAE,aAAa,WAAS,QAAQ,MAAM,gDAAgD,GAAEA,GAAE,aAAa,QAAQ,SAASjD,IAAE;AAAC,YAAE,WAAW,OAAOiD,IAAEjD,EAAC;AAAA,QAAC,CAAC,IAAGiD,GAAE,IAAI,WAAW,YAAYA,GAAE,GAAG;AAAA,MAAC,GAAE,gBAAe,SAASjD,IAAEiD,IAAE;AAAC,eAAO,EAAE,WAAW,OAAOjD,EAAC,KAAG,IAAEA,GAAE,aAAa,UAAQ,GAAG,WAAU;AAAC,UAAAA,GAAE,aAAa,QAAQ,SAASA,IAAE;AAAC,YAAAA,GAAE,UAAQiD,MAAG,GAAGjD,GAAE,OAAM,EAAC,UAAS,KAAE,CAAC;AAAA,UAAC,CAAC;AAAA,QAAC,CAAC,GAAEA,GAAE,SAAS;AAAA,MAAW,GAAE,aAAY,SAASA,IAAEiD,IAAE;AAAC,YAAI3C,KAAE,GAAGN,GAAE,SAAQiD,GAAE,UAAU;AAAE,eAAO,GAAGjD,GAAE,SAAS,aAAY,SAASA,IAAE;AAAC,UAAAA,GAAE,KAAGM,GAAE,MAAKN,GAAE,KAAGM,GAAE;AAAA,QAAG,CAAC;AAAA,MAAC,GAAE,aAAY,SAASN,IAAEiD,IAAE;AAAC,YAAI3C,KAAE,GAAGN,GAAE,SAAQiD,GAAE,UAAU,GAAEnD,KAAEE,GAAE,SAAS;AAAQ,eAAM,EAAC,MAAKF,GAAE,OAAKQ,GAAE,MAAK,KAAIR,GAAE,MAAIQ,GAAE,KAAI,OAAMR,GAAE,QAAMQ,GAAE,MAAK,QAAOR,GAAE,SAAOQ,GAAE,KAAI,OAAMR,GAAE,OAAM,QAAOA,GAAE,OAAM;AAAA,MAAC,GAAE,QAAO,SAASmD,IAAE;AAAC,YAAInD,IAAEQ,IAAEH,IAAEsI,IAAEzI,IAAEwD,IAAElC,IAAEX,IAAEqL,IAAE1I,IAAE/B,IAAElB,IAAEmB,IAAEa,IAAEmC,IAAEpB,IAAEuJ,IAAEC,IAAEpK,IAAEG,IAAEkK,IAAE5M,IAAEmB,IAAE2L,IAAE/J,IAAEgK,IAAElB,IAAEmB,IAAE5I,IAAE0H,IAAEmB,IAAEjB,IAAEC,KAAEjJ,GAAE,UAASkK,KAAElK,GAAE,UAASkJ,KAAElJ,GAAE,aAAa,SAAOA,GAAE,aAAa,CAAC,EAAE,MAAM,WAAS,MAAKmJ,KAAE,CAAE;AAAC,YAAGA,GAAE,cAAY,GAAGnJ,IAAEiJ,IAAE,eAAc,QAAMjJ,GAAE,OAAKA,GAAE,OAAKkJ,KAAEA,GAAE,mBAAiB,GAAG,QAAQ,GAAErM,KAAE,GAAGmD,GAAE,OAAO,GAAEmJ,GAAE,eAAa,GAAGnJ,IAAEiJ,IAAE,gBAAepM,GAAE,KAAK,GAAEsM,GAAE,gBAAc,GAAGnJ,IAAEiJ,IAAE,iBAAgBpM,GAAE,MAAM,GAAEsM,GAAE,cAAY,GAAGnJ,IAAEiJ,IAAE,eAAcpM,GAAE,IAAI,GAAEsM,GAAE,aAAW,GAAGnJ,IAAEiJ,IAAE,cAAapM,GAAE,GAAG,GAAEsM,GAAE,eAAanJ,GAAE,aAAWmJ,GAAE,gBAAcA,GAAE,gBAAe;AAAC,kBAAOnJ,GAAE,OAAO;AAAA,YAAA,KAAI;AAAO,eAACgK,KAAE,EAAC,MAAKhK,GAAE,EAAE,CAAC,KAAGA,GAAE,EAAE,CAAC,IAAEnD,GAAE,QAAM,IAAG,KAAImD,GAAE,EAAE,CAAC,KAAGA,GAAE,EAAE,CAAC,IAAEnD,GAAE,SAAO,IAAG,OAAMmD,GAAE,MAAM,CAAC,KAAGA,GAAE,MAAM,CAAC,IAAEnD,GAAE,QAAM,IAAG,QAAOmD,GAAE,OAAO,CAAC,KAAGA,GAAE,OAAO,CAAC,IAAEnD,GAAE,SAAO,GAAE,GAAG,QAAMmN,GAAE,OAAKA,GAAE,OAAMA,GAAE,SAAOA,GAAE,MAAIA,GAAE,QAAO7L,KAAE8K,GAAE,cAAY,GAAEW,MAAG5M,KAAE,KAAK,IAAIgN,GAAE,OAAMA,GAAE,MAAM,KAAGhN,KAAE,IAAE,KAAK,QAAMmB,KAAE,GAAE4L,MAAGrK,KAAEM,GAAE,SAAOA,GAAE,UAAQ4J,KAAE5J,GAAE,SAAO4J,KAAE,MAAI7J,KAAEL,MAAGoK,MAAGpK,KAAEvB,MAAG,KAAK,QAAO0K,KAAEnJ,KAAE,IAAGqK,KAAE,CAAC,EAAC,GAAEC,GAAE,OAAKjK,IAAE,GAAEiK,GAAE,MAAIF,GAAC,GAAE,EAAC,GAAEE,GAAE,OAAKF,IAAE,GAAEE,GAAE,MAAIjK,GAAC,GAAE,EAAC,GAAEiK,GAAE,QAAMF,IAAE,GAAEE,GAAE,MAAIjK,GAAC,GAAE,EAAC,GAAEiK,GAAE,QAAMjK,IAAE,GAAEiK,GAAE,MAAIF,GAAC,GAAE,EAAC,GAAEE,GAAE,QAAMjK,IAAE,GAAEiK,GAAE,SAAOF,GAAC,GAAE,EAAC,GAAEE,GAAE,QAAMF,IAAE,GAAEE,GAAE,SAAOjK,GAAC,GAAE,EAAC,GAAEiK,GAAE,OAAKF,IAAE,GAAEE,GAAE,SAAOjK,GAAC,GAAE,EAAC,GAAEiK,GAAE,OAAKjK,IAAE,GAAEiK,GAAE,SAAOF,GAAC,CAAC,GAAEb,GAAE,cAAY,CAAC,CAACc,GAAE,CAAC,GAAE,EAAC,GAAEA,GAAE,CAAC,EAAE,GAAE,GAAEA,GAAE,CAAC,EAAE,IAAElB,GAAC,GAAE,EAAC,GAAEkB,GAAE,CAAC,EAAE,IAAElB,IAAE,GAAEkB,GAAE,CAAC,EAAE,EAAC,GAAEA,GAAE,CAAC,CAAC,CAAC,GAAEA,GAAE,CAAC,EAAE,MAAIA,GAAE,CAAC,EAAE,KAAGd,GAAE,YAAY,KAAK,CAACc,GAAE,CAAC,GAAEA,GAAE,CAAC,CAAC,CAAC,GAAEd,GAAE,YAAY,KAAK,CAACc,GAAE,CAAC,GAAE,EAAC,GAAEA,GAAE,CAAC,EAAE,IAAElB,IAAE,GAAEkB,GAAE,CAAC,EAAE,EAAC,GAAE,EAAC,GAAEA,GAAE,CAAC,EAAE,GAAE,GAAEA,GAAE,CAAC,EAAE,IAAElB,GAAC,GAAEkB,GAAE,CAAC,CAAC,CAAC,GAAEA,GAAE,CAAC,EAAE,MAAIA,GAAE,CAAC,EAAE,KAAGd,GAAE,YAAY,KAAK,CAACc,GAAE,CAAC,GAAEA,GAAE,CAAC,CAAC,CAAC,GAAEd,GAAE,YAAY,KAAK,CAACc,GAAE,CAAC,GAAE,EAAC,GAAEA,GAAE,CAAC,EAAE,GAAE,GAAEA,GAAE,CAAC,EAAE,IAAElB,GAAC,GAAE,EAAC,GAAEkB,GAAE,CAAC,EAAE,IAAElB,IAAE,GAAEkB,GAAE,CAAC,EAAE,EAAC,GAAEA,GAAE,CAAC,CAAC,CAAC,GAAEA,GAAE,CAAC,EAAE,MAAIA,GAAE,CAAC,EAAE,KAAGd,GAAE,YAAY,KAAK,CAACc,GAAE,CAAC,GAAEA,GAAE,CAAC,CAAC,CAAC,GAAEd,GAAE,YAAY,KAAK,CAACc,GAAE,CAAC,GAAE,EAAC,GAAEA,GAAE,CAAC,EAAE,IAAElB,IAAE,GAAEkB,GAAE,CAAC,EAAE,EAAC,GAAE,EAAC,GAAEA,GAAE,CAAC,EAAE,GAAE,GAAEA,GAAE,CAAC,EAAE,IAAElB,GAAC,GAAEkB,GAAE,CAAC,CAAC,CAAC,GAAEA,GAAE,CAAC,EAAE,MAAIA,GAAE,CAAC,EAAE,KAAGd,GAAE,YAAY,KAAK,CAACc,GAAE,CAAC,GAAEA,GAAE,CAAC,CAAC,CAAC,GAAEd,GAAE,YAAY,KAAK,CAAA,CAAE,GAAElJ,KAAEL,KAAEoK,KAAEb,GAAE,cAAY,GAAE,CAAC,EAAC,GAAEe,GAAE,OAAKjK,IAAE,GAAEiK,GAAE,MAAIjK,GAAC,GAAE,EAAC,GAAEiK,GAAE,QAAMjK,IAAE,GAAEiK,GAAE,SAAOjK,GAAC,CAAC,MAAIA,KAAEkJ,GAAE,cAAY,GAAEc,KAAE,CAAC,EAAC,GAAEC,GAAE,OAAKjK,IAAE,GAAEiK,GAAE,MAAIjK,GAAC,GAAE,EAAC,GAAEiK,GAAE,QAAMjK,IAAE,GAAEiK,GAAE,SAAOjK,GAAC,CAAC,GAAEkJ,GAAE,cAAY,CAAC,CAACc,GAAE,CAAC,GAAE,EAAC,GAAEA,GAAE,CAAC,EAAE,GAAE,GAAEA,GAAE,CAAC,EAAE,EAAC,CAAC,GAAE,CAAC,EAAC,GAAEA,GAAE,CAAC,EAAE,GAAE,GAAEA,GAAE,CAAC,EAAE,EAAC,GAAEA,GAAE,CAAC,CAAC,GAAE,CAACA,GAAE,CAAC,GAAE,EAAC,GAAEA,GAAE,CAAC,EAAE,GAAE,GAAEA,GAAE,CAAC,EAAE,EAAC,CAAC,GAAE,CAAA,CAAE,GAAE,CAAC,EAAC,GAAEC,GAAE,OAAKf,GAAE,aAAY,GAAEe,GAAE,MAAIf,GAAE,YAAW,GAAE,EAAC,GAAEe,GAAE,QAAMf,GAAE,aAAY,GAAEe,GAAE,SAAOf,GAAE,YAAW,CAAC,IAAGA,GAAE,UAAQ,EAAC,MAAKc,GAAE,CAAC,EAAE,GAAE,KAAIA,GAAE,CAAC,EAAE,GAAE,OAAMA,GAAE,CAAC,EAAE,GAAE,QAAOA,GAAE,CAAC,EAAE,GAAE,OAAMA,GAAE,CAAC,EAAE,IAAEA,GAAE,CAAC,EAAE,GAAE,QAAOA,GAAE,CAAC,EAAE,IAAEA,GAAE,CAAC,EAAE,EAAC;AAAE;AAAA,YAAM,KAAI;AAAS,eAACxK,KAAE,EAAC,MAAKS,GAAE,EAAE,CAAC,KAAGA,GAAE,EAAE,CAAC,IAAEnD,GAAE,QAAM,IAAG,KAAImD,GAAE,EAAE,CAAC,KAAGA,GAAE,EAAE,CAAC,IAAEnD,GAAE,SAAO,IAAG,OAAMmD,GAAE,MAAM,CAAC,KAAGA,GAAE,MAAM,CAAC,IAAEnD,GAAE,QAAM,IAAG,QAAOmD,GAAE,OAAO,CAAC,KAAGA,GAAE,OAAO,CAAC,IAAEnD,GAAE,SAAO,GAAE,GAAG,SAAO0C,GAAE,WAASA,GAAE,QAAMA,GAAE,SAAO,KAAIA,GAAE,UAAQA,GAAE,QAAMA,GAAE,SAAQA,GAAE,WAASA,GAAE,SAAOA,GAAE,QAAOA,GAAE,QAAMA,GAAE,OAAKA,GAAE,OAAMA,GAAE,SAAOA,GAAE,MAAIA,GAAE,QAAOlB,KAAEkB,GAAE,OAAKA,GAAE,QAAM,GAAE7B,KAAE6B,GAAE,MAAIA,GAAE,SAAO,GAAEhB,KAAE0K,GAAE,cAAY,GAAE7J,KAAEG,GAAE,QAAM,GAAEgC,KAAEhC,GAAE,SAAO,GAAEwJ,KAAE3J,KAAE,KAAK,QAAMb,IAAE8B,KAAEkB,KAAE,KAAK,QAAMhD,IAAED,KAAEyK,KAAE,IAAG3L,KAAEiD,KAAE,IAAGsJ,KAAE,CAAC,EAAC,GAAEtL,KAAE0K,IAAE,GAAErL,GAAC,GAAE,EAAC,GAAEW,IAAE,GAAEX,KAAE2C,GAAC,GAAE,EAAC,GAAEhC,KAAE0K,IAAE,GAAErL,GAAC,GAAE,EAAC,GAAEW,IAAE,GAAEX,KAAE2C,GAAC,CAAC,GAAE4I,GAAE,cAAY,CAAC,CAACU,GAAE,CAAC,GAAE,EAAC,GAAEA,GAAE,CAAC,EAAE,GAAE,GAAEA,GAAE,CAAC,EAAE,IAAEvM,GAAC,GAAE,EAAC,GAAEuM,GAAE,CAAC,EAAE,IAAErL,IAAE,GAAEqL,GAAE,CAAC,EAAE,EAAC,GAAEA,GAAE,CAAC,CAAC,GAAE,CAACA,GAAE,CAAC,GAAE,EAAC,GAAEA,GAAE,CAAC,EAAE,IAAErL,IAAE,GAAEqL,GAAE,CAAC,EAAE,EAAC,GAAE,EAAC,GAAEA,GAAE,CAAC,EAAE,GAAE,GAAEA,GAAE,CAAC,EAAE,IAAEvM,GAAC,GAAEuM,GAAE,CAAC,CAAC,GAAE,CAACA,GAAE,CAAC,GAAE,EAAC,GAAEA,GAAE,CAAC,EAAE,GAAE,GAAEA,GAAE,CAAC,EAAE,IAAEvM,GAAC,GAAE,EAAC,GAAEuM,GAAE,CAAC,EAAE,IAAErL,IAAE,GAAEqL,GAAE,CAAC,EAAE,EAAC,GAAEA,GAAE,CAAC,CAAC,GAAE,CAACA,GAAE,CAAC,GAAE,EAAC,GAAEA,GAAE,CAAC,EAAE,IAAErL,IAAE,GAAEqL,GAAE,CAAC,EAAE,EAAC,GAAE,EAAC,GAAEA,GAAE,CAAC,EAAE,GAAE,GAAEA,GAAE,CAAC,EAAE,IAAEvM,GAAC,GAAEuM,GAAE,CAAC,CAAC,GAAE,CAAE,CAAA,GAAExJ,KAAE4I,KAAE3J,KAAE6J,GAAE,cAAY,GAAES,KAAErJ,KAAEkB,KAAE0H,GAAE,cAAY,GAAEU,KAAE,CAAC,EAAC,GAAEpK,GAAE,OAAKY,IAAE,GAAEZ,GAAE,MAAImK,GAAC,GAAE,EAAC,GAAEnK,GAAE,QAAMY,IAAE,GAAEZ,GAAE,SAAOmK,GAAC,CAAC,GAAET,GAAE,UAAQ,EAAC,MAAKU,GAAE,CAAC,EAAE,GAAE,KAAIA,GAAE,CAAC,EAAE,GAAE,OAAMA,GAAE,CAAC,EAAE,GAAE,QAAOA,GAAE,CAAC,EAAE,GAAE,OAAMA,GAAE,CAAC,EAAE,IAAEA,GAAE,CAAC,EAAE,GAAE,QAAOA,GAAE,CAAC,EAAE,IAAEA,GAAE,CAAC,EAAE,EAAC;AAAE;AAAA,YAAM,KAAI;AAAU,cAAA3J,GAAE,OAAO,QAAQ,SAASjD,IAAE;AAAC,oBAAIiD,KAAEjD,GAAE,EAAE,CAAC,KAAGA,GAAE,EAAE,CAAC,IAAEF,GAAE,QAAM,IAAGQ,KAAEN,GAAE,EAAE,CAAC,KAAGA,GAAE,EAAE,CAAC,IAAEF,GAAE,SAAO;AAAG,gBAAAK,MAAG8C,KAAE9C,GAAE,SAAOA,GAAE,OAAK8C,KAAGA,KAAE9C,GAAE,UAAQA,GAAE,QAAM8C,KAAG3C,KAAEH,GAAE,QAAMA,GAAE,MAAIG,KAAGA,KAAEH,GAAE,WAASA,GAAE,SAAOG,OAAIH,KAAE,EAAC,MAAK8C,IAAE,OAAMA,IAAE,KAAI3C,IAAE,QAAOA,GAAC,GAAEmI,KAAEyD,GAAE,YAAY,KAAK,CAACzD,IAAE,EAAC,GAAExF,IAAE,GAAE3C,GAAC,CAAC,CAAC,IAAE4L,GAAE,cAAY,CAAA,GAAGzD,KAAE,EAAC,GAAExF,IAAE,GAAE3C,GAAC;AAAA,cAAC,CAAC,GAAE4L,GAAE,YAAY,KAAK,EAAE,GAAElM,KAAEkM,GAAE,cAAY,GAAE1I,KAAE,CAAC,EAAC,GAAErD,GAAE,OAAKH,IAAE,GAAEG,GAAE,MAAIH,GAAC,GAAE,EAAC,GAAEG,GAAE,QAAMH,IAAE,GAAEG,GAAE,SAAOH,GAAC,CAAC,GAAEkM,GAAE,UAAQ,EAAC,MAAK1I,GAAE,CAAC,EAAE,GAAE,KAAIA,GAAE,CAAC,EAAE,GAAE,OAAMA,GAAE,CAAC,EAAE,GAAE,QAAOA,GAAE,CAAC,EAAE,GAAE,OAAMA,GAAE,CAAC,EAAE,IAAEA,GAAE,CAAC,EAAE,GAAE,QAAOA,GAAE,CAAC,EAAE,IAAEA,GAAE,CAAC,EAAE,EAAC;AAAA,UAAC;AAAC,UAAA4I,GAAE,cAAYA,GAAE,UAAQ;AAAA,QAAE;AAAC,gBAAOA,GAAE,eAAaA,GAAE,eAAaA,GAAE,gBAAcF,GAAE,WAAS,GAAGA,GAAE,aAAY,SAASlM,IAAE;AAAC,UAAAA,GAAE,KAAGF,GAAE,MAAKE,GAAE,KAAGF,GAAE;AAAA,QAAG,CAAC,IAAG,GAAGmD,IAAEkK,IAAE,eAAc7M,KAAE4L,GAAE,WAAW,MAAIjJ,GAAE,KAAK,MAAM,cAAY3C,KAAE,OAAM,GAAGA,KAAE4L,GAAE,UAASiB,GAAE,QAAQ,MAAIlK,GAAE,KAAK,YAAY3C,EAAC,GAAE6M,GAAE,WAAS7M,IAAE8L,GAAE,WAAS,OAAInJ,GAAE,SAAO,CAACmJ,GAAE,aAAW,CAACA,GAAE,eAAanJ,GAAE,WAASA,GAAE,aAAWiJ,GAAE,UAAQjJ,GAAE,WAAS,IAAEiJ,GAAE,aAAYA,GAAE,UAAQjJ,GAAE,WAASiJ,GAAE,cAAaE,GAAE,OAAK,GAAGnJ,IAAEkK,IAAE,WAAUjB,GAAE,OAAO,KAAGE,GAAE,MAAKA,GAAE,OAAK,GAAGnJ,IAAEkK,IAAE,WAAUjB,GAAE,OAAO,KAAGE,GAAE,MAAKA,GAAE,SAAOnJ,GAAE,KAAK,MAAM,kBAAgBkK,GAAE,UAAQ,MAAIA,GAAE,WAAU9I,KAAE6H,GAAE,aAAYH,KAAEoB,GAAE,aAAYD,KAAEjK,GAAE,IAAI,QAAQ,SAAQgJ,KAAEhJ,GAAE,IAAI,OAAMoB,GAAE,IAAE6H,GAAE,QAAQ,OAAKpM,GAAE,MAAKuE,GAAE,IAAE6H,GAAE,QAAQ,MAAIpM,GAAE,KAAIuE,GAAE,QAAM6H,GAAE,QAAQ,OAAM7H,GAAE,SAAO6H,GAAE,QAAQ,QAAO,CAAC,KAAI,KAAI,SAAQ,QAAQ,EAAE,QAAQ,SAASlM,IAAE;AAAC,WAACM,KAAE+D,GAAErE,EAAC,OAAK+L,GAAE/L,EAAC,MAAIkN,GAAElN,EAAC,IAAE+L,GAAE/L,EAAC,IAAEM,IAAE2L,GAAE,GAAGjM,EAAC,CAAC,IAAEM,MAAG,QAAMN,MAAG,QAAMA,KAAEiD,GAAE,WAAWjD,EAAC,IAAE,KAAG;AAAA,QAAK,CAAC,GAAEoM,GAAE,eAAaA,GAAE,eAAaA,GAAE;AAAA,MAAO,EAAC,GAAE,kBAAiB,EAAC,MAAK,UAAS,YAAW,CAAC,EAAC,YAAW,WAAU,MAAK,GAAE,GAAE,EAAC,YAAW,kBAAiB,MAAK,SAAQ,CAAC,GAAE,OAAM,EAAC,iBAAgB,+PAA8P,gBAAe,IAAG,kBAAiB,aAAY,iBAAgB,WAAU,QAAO,UAAS,GAAE,YAAW,EAAC,iBAAgB,QAAO,iBAAgB,UAAS,GAAE,SAAQ,EAAC,KAAI,GAAE,OAAM,IAAG,QAAO,GAAE,MAAK,EAAC,GAAE,WAAU,IAAG,oBAAmB,EAAC,OAAM,GAAE,KAAI,EAAC,GAAE,gBAAe,EAAC,OAAM,IAAG,QAAO,GAAE,GAAE,SAAQ,CAAC,CAAC,OAAM,KAAK,GAAE,CAAC,SAAQ,OAAO,GAAE,CAAC,UAAS,QAAQ,GAAE,CAAC,QAAO,MAAM,CAAC,GAAE,MAAK,SAAStM,IAAEK,IAAE;AAAC,YAAIsI,IAAExF,IAAEjD,IAAEM,IAAEkD,IAAElC,IAAEX,IAAEqL,IAAE1I,IAAE/B,IAAElB,IAAEmB,KAAE,EAAE,kBAAiBa,KAAE;AAAG,YAAGvC,GAAE,UAAQ,EAAE,YAAY,aAAaK,GAAE,OAAO,GAAE6L,KAAElM,GAAE,SAAQ,GAAGyB,KAAEyK,GAAE,mBAAiB1I,KAAE/B,GAAE,gBAAc+B,GAAE,eAAa0I,cAAa1I,GAAE;AAAa,gBAAM,IAAI,MAAM,gCAAgC;AAAE,eAAO9B,GAAE,MAAM,iBAAeA,GAAE,eAAe,QAAM,QAAMA,GAAE,eAAe,SAAO,MAAK,CAAC,SAAQ,YAAY,EAAE,QAAQ,SAASxB,IAAE;AAAC,cAAIM,KAAEkB,GAAExB,EAAC;AAAE,UAAAF,GAAEE,EAAC,IAAE,OAAO,KAAKM,EAAC,EAAE,OAAO,SAASN,IAAEiD,IAAE;AAAC,mBAAOjD,GAAEiD,EAAC,IAAE3C,GAAE2C,EAAC,GAAEjD;AAAA,UAAC,GAAE,CAAA,CAAE;AAAA,QAAC,CAAC,GAAE,cAAYyI,KAAE3I,GAAE,QAAQ,cAAc,YAAY,iBAAiBA,GAAE,SAAQ,EAAE,GAAG,UAAQA,GAAE,MAAM,UAAQ,iBAAe,WAAS2I,GAAE,YAAU3I,GAAE,MAAM,UAAQ,UAAS,EAAE,iBAAiB,QAAQ,QAAQ,SAASE,IAAE;AAAC,cAAIiD,KAAEjD,GAAE,CAAC,GAAEM,KAAE,YAAUN,GAAE,CAAC;AAAE,qBAAWyI,GAAEnI,EAAC,CAAC,IAAEkB,GAAE,QAAQyB,EAAC,MAAInD,GAAE,MAAMQ,EAAC,IAAEkB,GAAE,QAAQyB,EAAC,IAAE;AAAA,QAAK,CAAC,GAAEnD,GAAE,MAAM,YAAUQ,KAAER,GAAE,QAAQ,MAAM,SAAQA,GAAE,QAAQ,MAAM,UAAQA,GAAE,MAAM,UAAS,EAAE,iBAAiB,QAAQ,QAAQ,SAASE,IAAE;AAAC,cAAIiD,KAAE,YAAUjD,GAAE,CAAC;AAAE,UAAAF,GAAE,MAAMmD,EAAC,MAAIZ,GAAEY,EAAC,IAAEnD,GAAE,QAAQ,MAAMmD,EAAC,GAAEnD,GAAE,QAAQ,MAAMmD,EAAC,IAAEnD,GAAE,MAAMmD,EAAC;AAAA,QAAE,CAAC,IAAGjD,KAAEF,GAAE,QAAQ,yBAAyB,SAAO0B,GAAE,cAAY,MAAInB,KAAEmB,GAAE,WAAU,kBAAgBiH,GAAE,YAAUpI,MAAG,WAAWoI,GAAE,cAAc,IAAE,WAAWA,GAAE,iBAAiB,IAAE,WAAWA,GAAE,UAAU,IAAE,WAAWA,GAAE,aAAa,IAAE,kBAAgBA,GAAE,cAAYpI,MAAG,WAAWoI,GAAE,cAAc,IAAE,WAAWA,GAAE,iBAAiB,IAAG3I,GAAE,MAAM,SAAOO,KAAE,QAAMP,GAAE,MAAM,SAAO,WAAW2I,GAAE,MAAM,KAAGjH,GAAE,YAAUxB,GAAE,UAAQ,OAAMF,GAAE,MAAM,qBAAmB,KAAGE,GAAE,QAAMwB,GAAE,eAAe,QAAMA,GAAE,mBAAmB,QAAM,QAAMA,GAAE,mBAAmB,MAAI,OAAK,WAASA,GAAE,mBAAmB,QAAM,YAAUA,GAAE,mBAAmB,MAAI,MAAK1B,GAAE,MAAM,YAAUA,GAAE,QAAQ,MAAM,UAAQQ,KAAG,EAAE,iBAAiB,QAAQ,QAAQ,SAASN,IAAE;AAAC,cAAIiD,KAAE,YAAUjD,GAAE,CAAC;AAAE,UAAAF,GAAE,MAAMmD,EAAC,MAAInD,GAAE,QAAQ,MAAMmD,EAAC,IAAEZ,GAAEY,EAAC;AAAA,QAAE,CAAC,GAAE,CAAC,SAAQ,YAAY,EAAE,QAAQ,SAASjD,IAAE;AAAC,cAAIiD,KAAEnD,GAAEE,EAAC,GAAEM,KAAEH,GAAEH,EAAC;AAAE,aAAGM,EAAC,KAAG,OAAO,KAAKA,EAAC,EAAE,QAAQ,SAASN,IAAE;AAAC,wBAAU,OAAOM,GAAEN,EAAC,KAAG,GAAGM,GAAEN,EAAC,CAAC,IAAEiD,GAAEjD,EAAC,IAAEM,GAAEN,EAAC,IAAE,QAAMM,GAAEN,EAAC,KAAG,OAAOiD,GAAEjD,EAAC;AAAA,UAAC,CAAC;AAAA,QAAC,CAAC,GAAE,cAAY,OAAOG,GAAE,aAAWQ,KAAER,GAAE,WAAUA,GAAE,kBAAgB2L,GAAE3L,GAAE,cAAc,MAAIL,GAAE,iBAAe0D,KAAErD,GAAE,iBAAgBmB,KAAEnB,GAAE,aAAYL,GAAE,WAASmD,KAAEnD,GAAE,QAAQ,OAAMA,GAAE,aAAW,SAASE,IAAE;AAAC,UAAAF,GAAE,iBAAe0B,GAAE,UAAUyB,IAAE,OAAO,KAAKnD,GAAE,UAAU,CAAC,GAAE0B,GAAE,UAAUyB,IAAEnD,GAAE,UAAU,GAAEA,GAAE,aAAa,QAAQ,SAASE,IAAE;AAAC,eAAGA,GAAE,OAAM,MAAGwD,IAAElC,EAAC;AAAA,UAAC,CAAC,GAAEX,MAAGA,GAAEX,EAAC;AAAA,QAAC,GAAEF,GAAE,aAAW,SAASE,IAAE;AAAC,UAAAwB,GAAE,UAAUyB,IAAEnD,GAAE,cAAc,GAAEA,GAAE,aAAa,QAAQ,SAASE,IAAE;AAAC,eAAGA,GAAE,OAAM,OAAGwD,IAAElC,EAAC;AAAA,UAAC,CAAC,GAAEX,MAAGA,GAAEX,EAAC;AAAA,QAAC,GAAE;AAAA,MAAE,GAAE,MAAK,SAASA,IAAEiD,IAAE;AAAC,YAAI3C,IAAER,IAAEK,IAAEsI,IAAEjF;AAAE,eAAOP,GAAE,MAAM,MAAI,EAAE,iBAAiB,OAAOA,GAAE,OAAM,OAAGjD,GAAE,cAAc,IAAE,GAAG,WAAU;AAAC,YAAE,iBAAiB,OAAOiD,GAAE,OAAM,OAAGjD,GAAE,cAAc;AAAA,QAAC,CAAC,GAAEA,GAAE,YAAUA,GAAE,YAAU,EAAE,iBAAiB,UAAUA,GAAE,UAAS,OAAO,KAAKA,GAAE,KAAK,CAAC,GAAE,EAAE,iBAAiB,UAAUA,GAAE,UAASA,GAAE,KAAK,GAAEA,GAAE,uBAAqBM,KAAEN,GAAE,SAAQF,KAAEE,GAAE,YAAWG,KAAEH,GAAE,YAAW,kBAAiBM,MAAG,kBAAiBA,MAAGA,GAAE,iBAAiB,cAAaR,IAAE,KAAE,GAAEQ,GAAE,iBAAiB,cAAaH,IAAE,KAAE,GAAE,WAAU;AAAC,UAAAG,GAAE,oBAAoB,cAAaR,IAAE,KAAE,GAAEQ,GAAE,oBAAoB,cAAaH,IAAE,KAAE;AAAA,QAAC,MAAI,QAAQ,KAAK,uDAAuD,GAAEsI,KAAE,SAASzI,IAAE;AAAC,UAAAA,GAAE,kBAAgBA,GAAE,kBAAgB,QAAM,KAAK,wBAAwBA,GAAE,aAAa,IAAE,KAAK,mCAAiCF,GAAE,MAAM,MAAK,SAAS;AAAA,QAAC,GAAEQ,GAAE,iBAAiB,aAAYmI,EAAC,GAAEjF,KAAE,SAASxD,IAAE;AAAC,UAAAA,GAAE,kBAAgBA,GAAE,kBAAgB,QAAM,KAAK,wBAAwBA,GAAE,aAAa,IAAE,KAAK,mCAAiCG,GAAE,MAAM,MAAK,SAAS;AAAA,QAAC,GAAEG,GAAE,iBAAiB,YAAWkD,EAAC,GAAE,WAAU;AAAC,UAAAlD,GAAE,oBAAoB,aAAYmI,IAAE,KAAE,GAAEnI,GAAE,oBAAoB,YAAWkD,IAAE,KAAE;AAAA,QAAC,KAAIxD,GAAE,UAAQ,OAAI;AAAA,MAAE,GAAE,QAAO,SAASA,IAAEiD,IAAE;AAAC,QAAAjD,GAAE,WAASA,GAAE,aAAa,UAAQ,MAAIA,GAAE,oBAAmB,GAAG,EAAE,iBAAiB,UAAUA,GAAE,UAASA,GAAE,SAAS,GAAEA,GAAE,UAAQ,QAAI,EAAE,iBAAiB,OAAOiD,GAAE,OAAM,MAAGjD,GAAE,cAAc;AAAA,MAAC,GAAE,cAAa,SAASA,IAAEiD,IAAE;AAAC,UAAE,YAAY,aAAajD,IAAEiD,EAAC;AAAA,MAAC,GAAE,QAAO,SAASA,IAAE;AAAC,QAAAA,GAAE,aAAa,WAAS,QAAQ,MAAM,gDAAgD,GAAEA,GAAE,aAAa,QAAQ,SAASjD,IAAE;AAAC,YAAE,iBAAiB,OAAOiD,IAAEjD,EAAC;AAAA,QAAC,CAAC;AAAA,MAAE,GAAE,aAAY,SAASA,IAAEiD,IAAE;AAAC,eAAO,GAAGjD,GAAE,SAAQiD,GAAE,UAAU;AAAA,MAAC,GAAE,QAAO,SAASjD,IAAEiD,IAAE3C,IAAE;AAAC,QAAAwL,GAAExL,MAAGN,GAAE,SAAS,WAAW,EAAE,KAAKA,IAAE,MAAGiD,EAAC,GAAEjD,GAAE,SAAS,UAAQiD;AAAA,MAAC,GAAE,WAAU,SAAS3C,IAAEN,IAAE;AAAC,eAAOA,GAAE,OAAO,SAASA,IAAEiD,IAAE;AAAC,iBAAOjD,GAAEiD,EAAC,IAAE3C,GAAE2C,EAAC,GAAEjD;AAAA,QAAC,GAAE,CAAA,CAAE;AAAA,MAAC,GAAE,WAAU,SAASiD,IAAE3C,IAAE;AAAC,eAAO,KAAKA,EAAC,EAAE,QAAQ,SAASN,IAAE;AAAC,UAAAiD,GAAEjD,EAAC,IAAEM,GAAEN,EAAC;AAAA,QAAC,CAAC;AAAA,MAAC,EAAC,GAAE,cAAa,EAAC,MAAK,SAAQ,YAAW,CAAC,EAAC,YAAW,QAAO,MAAK,SAAQ,CAAC,GAAE,OAAM,EAAC,OAAM,CAAA,GAAG,GAAE,CAAE,GAAC,GAAE,GAAE,GAAE,gBAAe,CAAC,cAAa,aAAY,eAAc,cAAa,eAAc,YAAW,kBAAiB,WAAU,iBAAgB,eAAc,gBAAgB,GAAE,MAAK,SAASgM,IAAE/I,IAAE;AAAC,eAAM,YAAU,OAAOA,GAAE,SAAO+I,GAAE,OAAK/I,GAAE,KAAK,KAAM,IAAE,CAAC,CAAC+I,GAAE,SAAO,YAAU,OAAO/I,GAAE,UAAQ+I,GAAE,QAAM/I,GAAE,MAAM,KAAM,IAAE+I,GAAE,eAAa,YAAU,OAAO/I,GAAE,eAAaA,GAAE,aAAa,KAAI,IAAG,QAAO,MAAM,QAAQA,GAAE,MAAM,KAAG,GAAGA,GAAE,OAAO,CAAC,CAAC,KAAG,GAAGA,GAAE,OAAO,CAAC,CAAC,MAAI+I,GAAE,SAAO,EAAC,GAAE/I,GAAE,OAAO,CAAC,GAAE,GAAEA,GAAE,OAAO,CAAC,EAAC,IAAG,GAAGA,GAAE,UAAU,MAAI+I,GAAE,aAAW/I,GAAE,aAAY,EAAE,aAAa,eAAe,QAAQ,SAASjD,IAAE;AAAC,kBAAMiD,GAAEjD,EAAC,MAAIgM,GAAEhM,EAAC,IAAEiD,GAAEjD,EAAC;AAAA,QAAE,CAAC,GAAEgM,GAAE,cAAY,SAAShM,IAAE;AAAC,YAAE,aAAa,YAAYgM,IAAEhM,EAAC;AAAA,QAAC,GAAEgM,GAAE,iBAAe,SAAShM,IAAE;AAAC,cAAIiD,IAAE3C,IAAER,IAAEK,IAAEsI,KAAEuD,GAAE,UAASxI,KAAEwI,GAAE,UAAS1K,KAAEtB,GAAE,UAASW,KAAEW,GAAE,oBAAoB0K,GAAE,WAAW;AAAE,kBAAMrL,GAAE,MAAIqL,GAAE,UAAQvD,GAAE,IAAE9H,GAAE,IAAEqL,GAAE,OAAO,GAAEvD,GAAE,IAAE9H,GAAE,IAAEqL,GAAE,OAAO,MAAI/I,KAAE+I,GAAE,SAAO,GAAE1L,KAAE,KAAK,IAAIgB,GAAE,qBAAqB0K,GAAE,WAAW,KAAG,GAAE1K,GAAE,mBAAiB,CAAC,GAAExB,KAAEwB,GAAE,oBAAoB0K,GAAE,cAAY,IAAE,CAAC,GAAErL,GAAE,aAAWwL,MAAGxL,GAAE,aAAWuL,MAAGzD,GAAE,IAAE9H,GAAE,aAAWwL,KAAExL,GAAE,IAAEsC,KAAE+I,GAAE,QAAMrL,GAAE,IAAEsC,IAAEwF,GAAE,IAAE3I,GAAE,IAAEa,GAAE,IAAEA,GAAE,IAAEL,KAAE2C,KAAEtC,GAAE,IAAEL,KAAE2C,KAAE+I,GAAE,WAASvD,GAAE,IAAE3I,GAAE,IAAEa,GAAE,IAAEA,GAAE,IAAEL,KAAE2C,KAAEtC,GAAE,IAAEL,KAAE2C,KAAE+I,GAAE,OAAMvD,GAAE,IAAE9H,GAAE,aAAWsL,KAAEtL,GAAE,IAAEsC,KAAE+I,GAAE,SAAOrL,GAAE,IAAEsC,MAAI,GAAG+I,IAAExI,IAAE,KAAIrD,KAAEsI,GAAE,CAAC,MAAIuD,GAAE,YAAY,EAAE,QAAQ,QAAQ,CAAC,EAAE,QAAM7L,KAAG,GAAG6L,IAAExI,IAAE,KAAIrD,KAAEsI,GAAE,CAAC,MAAIuD,GAAE,YAAY,EAAE,QAAQ,QAAQ,CAAC,EAAE,QAAM7L,KAAE6L,GAAE;AAAA,QAAQ,GAAEA,GAAE,aAAW,SAAShM,IAAE;AAAC,cAAIiD,IAAE3C,IAAER,KAAEkM,GAAE,UAAS7L,KAAE6L,GAAE,UAASvD,KAAEzI,GAAE,SAAS,WAASA,GAAE,SAAS;AAAQ,UAAAyI,OAAIxF,KAAE,EAAE,aAAa,YAAYwF,IAAEuD,GAAE,UAAU,GAAElM,GAAE,IAAEmD,GAAE,IAAE+I,GAAE,QAAM,GAAElM,GAAE,IAAEmD,GAAE,IAAE+I,GAAE,SAAO,GAAE,GAAGA,IAAE7L,IAAE,KAAIG,KAAER,GAAE,CAAC,MAAIkM,GAAE,YAAY,EAAE,QAAQ,QAAQ,CAAC,EAAE,QAAM1L,KAAG,GAAG0L,IAAE7L,IAAE,KAAIG,KAAER,GAAE,CAAC,MAAIkM,GAAE,YAAY,EAAE,QAAQ,QAAQ,CAAC,EAAE,QAAM1L,KAAE0L,GAAE;AAAA,QAAQ,GAAEA,GAAE,aAAW,SAAShM,IAAE;AAAC,YAAE,aAAa,WAAWgM,IAAEhM,EAAC;AAAA,QAAC,GAAE,OAAKgM,GAAE,aAAW,SAAShM,IAAEiD,IAAE;AAAC,cAAI3C,KAAE0L,GAAE;AAAS,kBAAM1L,GAAE,KAAG,EAAE,aAAa,WAAW2C,IAAE,EAAC,GAAE3C,GAAE,GAAE,GAAEA,GAAE,GAAE,OAAM0L,GAAE,OAAM,QAAOA,GAAE,OAAM,GAAEA,GAAE,cAAY,CAAC;AAAA,QAAC,IAAG;AAAA,MAAG,GAAE,aAAY,SAAShM,IAAEiD,IAAE;AAAC,YAAI3C,IAAER,KAAEE,GAAE,UAASG,KAAEH,GAAE,UAASyI,KAAExF,GAAE;AAAS,QAAAnD,GAAE,QAAMQ,KAAEN,GAAE,SAAOyI,GAAE,YAAW,GAAGzI,IAAEG,IAAE,SAAQG,EAAC,MAAIN,GAAE,UAAU,OAAKM;AAAA,MAAE,GAAE,YAAW,SAASN,IAAEiD,IAAE;AAAC,YAAI3C,KAAE,SAAK2C,GAAE;AAAQ,QAAA3C,OAAIN,GAAE,YAAUA,GAAE,UAAU,aAAWM,KAAE,KAAG,UAASN,GAAE,UAAQM;AAAA,MAAE,GAAE,YAAW,SAASN,IAAEiD,IAAE3C,IAAE;AAAC,YAAIR,KAAE,EAAC,IAAGmD,GAAE,IAAE3C,IAAE,IAAG2C,GAAE,IAAE3C,IAAE,IAAG2C,GAAE,IAAEA,GAAE,QAAM3C,IAAE,IAAG2C,GAAE,IAAEA,GAAE,SAAO3C,GAAC;AAAE,QAAAR,GAAE,KAAGE,GAAE,OAAKA,GAAE,KAAGF,GAAE,KAAIA,GAAE,KAAGE,GAAE,OAAKA,GAAE,KAAGF,GAAE,KAAIA,GAAE,KAAGE,GAAE,OAAKA,GAAE,KAAGF,GAAE,KAAIA,GAAE,KAAGE,GAAE,OAAKA,GAAE,KAAGF,GAAE;AAAA,MAAG,GAAE,SAAQ,SAASE,IAAEiD,IAAE3C,IAAER,IAAEK,IAAE;AAAC,YAAIsI,IAAEjF,IAAElC,IAAEX,IAAEqL,IAAE1I,KAAEL,GAAE,gBAAgB,IAAG,MAAM;AAAE,eAAOK,GAAE,cAAYtD,IAAE,CAACsD,GAAE,GAAEA,GAAE,CAAC,EAAE,QAAQ,SAAStD,IAAE;AAAC,cAAIiD,KAAE3C,GAAE,gBAAiB;AAAC,UAAA2C,GAAE,uBAAuB,UAAU,mBAAkB,CAAC,GAAEjD,GAAE,QAAQ,WAAWiD,EAAC;AAAA,QAAC,CAAC,GAAE,aAAW,OAAOZ,OAAIA,KAAE,gBAAeiB,GAAE,QAAOnD,MAAG,CAACkC,MAAGmB,KAAEP,GAAE,gBAAgB,IAAG,MAAM,GAAEK,GAAE,KAAGxD,IAAE0D,GAAE,YAAYF,EAAC,IAAG3C,MAAG8H,KAAExF,GAAE,gBAAgB,IAAG,GAAG,GAAG,YAAYA,GAAE,gBAAgB,IAAG,KAAK,CAAC,GAAG,KAAK,UAAQ,MAAInD,KAAGwB,KAAEmH,GAAE,YAAYxF,GAAE,gBAAgB,IAAG,KAAK,CAAC,GAAG,KAAK,UAAQ,MAAInD,KAAGkM,KAAErL,GAAE,OAAO,iBAAe,SAAQ,EAAC,aAAY2C,IAAE,WAAUA,GAAE,OAAM,WAAUhC,GAAE,OAAM,aAAY0K,IAAE,WAAUvD,GAAE,OAAM,YAAW,CAACjF,IAAEiF,EAAC,EAAC,MAAIuD,KAAE1I,GAAE,OAAMnD,OAAI6L,GAAE,iBAAe,SAAQA,GAAE,aAAW,WAAU,EAAC,aAAY1I,IAAE,WAAU0I,IAAE,WAAUA,IAAE,aAAY7L,KAAE6L,KAAE,MAAK,WAAUA,IAAE,YAAW,CAAC1I,EAAC,EAAC;AAAA,MAAE,GAAE,aAAY,SAAStD,IAAEiD,IAAE;AAAC,YAAI3C,IAAER,IAAEK,KAAE,GAAGH,EAAC,GAAEyI,KAAEtI,GAAE,SAAQqD,KAAErD,GAAE,QAAOmB,KAAE,IAAGX,KAAE6C,KAAE,KAAGP,MAAG;AAAG,YAAGtC,MAAG;AAAE,iBAAO,OAAKL,KAAEN,GAAE,CAAC,GAAG,SAAO,GAAGM,GAAE,CAAC,GAAEA,GAAE,CAAC,GAAE,CAAC,IAAE,GAAGA,GAAE,CAAC,GAAEA,GAAE,CAAC,GAAEA,GAAE,CAAC,GAAEA,GAAE,CAAC,GAAE,CAAC;AAAE,YAAGkD,MAAG7C;AAAE,iBAAO,OAAKL,KAAEN,GAAEA,GAAE,SAAO,CAAC,GAAG,SAAO,GAAGM,GAAE,CAAC,GAAEA,GAAE,CAAC,GAAE,CAAC,IAAE,GAAGA,GAAE,CAAC,GAAEA,GAAE,CAAC,GAAEA,GAAE,CAAC,GAAEA,GAAE,CAAC,GAAE,CAAC;AAAE,aAAIR,KAAE,CAAE,GAACa,KAAE8H,GAAE,EAAEnH,EAAC;AAAG,UAAAxB,GAAE,KAAKE,GAAEsB,EAAC,CAAC,GAAEX,MAAG8H,GAAEnH,EAAC;AAAE,eAAO,OAAKhB,KAAEN,GAAEsB,EAAC,GAAG,SAAO,GAAGhB,GAAE,CAAC,GAAEA,GAAE,CAAC,GAAEK,KAAE8H,GAAEnH,EAAC,CAAC,IAAE,GAAGhB,GAAE,CAAC,GAAEA,GAAE,CAAC,GAAEA,GAAE,CAAC,GAAEA,GAAE,CAAC,GAAE,GAAGA,GAAE,CAAC,GAAEA,GAAE,CAAC,GAAEA,GAAE,CAAC,GAAEA,GAAE,CAAC,GAAEK,EAAC,CAAC;AAAA,MAAC,GAAE,SAAQ,SAASsC,IAAE3C,IAAE;AAAC,YAAIN,IAAEF,IAAEK,KAAE,EAAE,aAAa,QAAQ8C,GAAE,MAAK3C,GAAE,WAAW,UAASA,GAAE,KAAI,IAAE,mBAAiB2C,GAAE,KAAIA,GAAE,YAAY;AAAE,SAAC,eAAc,aAAY,aAAY,YAAY,EAAE,QAAQ,SAASjD,IAAE;AAAC,UAAAiD,GAAEjD,EAAC,IAAEG,GAAEH,EAAC;AAAA,QAAC,CAAC,GAAEiD,GAAE,UAAQ,OAAGA,GAAE,UAAU,aAAW,UAAS,EAAE,aAAa,eAAe,QAAQ,SAASjD,IAAE;AAAC,kBAAMiD,GAAEjD,EAAC,MAAIG,GAAE,UAAUH,EAAC,IAAEiD,GAAEjD,EAAC;AAAA,QAAE,CAAC,GAAEG,GAAE,WAAW,QAAQ,SAASH,IAAE;AAAC,UAAAM,GAAE,IAAI,YAAYN,EAAC;AAAA,QAAC,CAAC,GAAEA,KAAEG,GAAE,YAAY,QAAS,GAAC8C,GAAE,QAAMjD,GAAE,OAAMiD,GAAE,SAAOjD,GAAE,QAAOiD,GAAE,iBAAenD,KAAE,MAAIA,KAAEE,GAAE,SAAO,KAAG,KAAGF,KAAE,IAAE,IAAEA,IAAEK,GAAE,YAAY,cAAYL,KAAE,MAAKK,GAAE,YAAY,SAAO8C,GAAE,eAAcA,GAAE,cAAYnD,MAAG,GAAE,GAAGmD,GAAE,UAAS,EAAE,aAAa,KAAK,GAAEA,GAAE,YAAY3C,EAAC,GAAE2C,GAAE,cAAYA,GAAE,eAAe3C,EAAC,IAAE2C,GAAE,WAAW3C,EAAC,GAAE,MAAI,GAAGA,IAAE,CAAA,CAAE,GAAE2C,GAAE,WAAW3C,EAAC;AAAA,MAAC,GAAE,MAAK,SAASN,IAAEiD,IAAE;AAAC,YAAI3C,KAAE2C,GAAE;AAAM,eAAOjD,GAAE,SAAO,GAAGM,IAAE,kBAAiBN,GAAE,WAAW,IAAGA,GAAE,cAAY,iBAAeiD,GAAE,cAAY,eAAaA,GAAE,eAAajD,GAAE,cAAY,iBAAeiD,GAAE,aAAW,IAAE,GAAE,GAAG3C,IAAE,gBAAeN,GAAE,cAAc,GAAEA,GAAE,WAAS,GAAGM,IAAE,4BAA2BN,GAAE,cAAc,GAAE,GAAGM,IAAE,wBAAuBN,GAAE,cAAc,MAAI,GAAGM,IAAE,YAAWN,GAAE,UAAU,GAAE,GAAGM,IAAE,WAAUN,GAAE,UAAU,GAAE,MAAI,GAAGM,IAAE,oBAAmBN,GAAE,UAAU,GAAE,EAAE,aAAa,QAAQA,IAAEM,EAAC,GAAE;AAAA,MAAE,GAAE,QAAO,SAASN,IAAEiD,IAAE;AAAC,YAAI3C,KAAE2C,GAAE;AAAM,QAAAjD,GAAE,eAAaA,GAAE,WAAW,QAAQ,SAASA,IAAE;AAAC,UAAAM,GAAE,IAAI,YAAYN,EAAC;AAAA,QAAC,CAAC,GAAEA,GAAE,cAAYA,GAAE,YAAUA,GAAE,YAAUA,GAAE,aAAW,OAAM,GAAGA,GAAE,UAAS,EAAE,aAAa,KAAK,GAAE,GAAGA,GAAE,UAAS,EAAE,aAAa,KAAK,GAAEA,GAAE,SAAO,GAAGM,IAAE,kBAAiBN,GAAE,WAAW,GAAEA,GAAE,eAAa,GAAGM,IAAE,gBAAeN,GAAE,cAAc,GAAEA,GAAE,WAAS,GAAGM,IAAE,4BAA2BN,GAAE,cAAc,GAAE,GAAGM,IAAE,wBAAuBN,GAAE,cAAc,MAAI,GAAGM,IAAE,YAAWN,GAAE,UAAU,GAAE,GAAGM,IAAE,WAAUN,GAAE,UAAU,GAAE,OAAK,GAAGM,IAAE,oBAAmBN,GAAE,UAAU,GAAE,GAAGM,IAAE,CAAA,CAAE;AAAA,MAAE,GAAE,cAAa,SAASN,IAAEiD,IAAE;AAAC,YAAI3C,KAAE2C,GAAE,OAAMnD,KAAE,CAAE;AAAC,QAAAA,GAAEmD,GAAE,UAAU,IAAE,IAAG,GAAG3C,IAAER,EAAC;AAAA,MAAC,GAAE,QAAO,SAASmD,IAAE;AAAC,QAAAA,GAAE,aAAa,WAAS,QAAQ,MAAM,gDAAgD,GAAEA,GAAE,aAAa,QAAQ,SAASjD,IAAE;AAAC,YAAE,aAAa,OAAOiD,IAAEjD,EAAC;AAAA,QAAC,CAAC;AAAA,MAAE,EAAC,GAAE,WAAU,EAAC,MAAK,SAAQ,YAAW,CAAC,EAAC,YAAW,QAAO,MAAK,SAAQ,CAAC,GAAE,OAAM,EAAC,OAAM,CAAA,GAAG,aAAY,CAAE,GAAC,UAAS,GAAE,GAAE,MAAK,SAASW,IAAEsC,IAAE;AAAC,eAAM,YAAU,OAAOA,GAAE,SAAOtC,GAAE,OAAKsC,GAAE,KAAK,KAAI,IAAI,CAAC,CAACtC,GAAE,SAAO,YAAU,OAAOsC,GAAE,UAAQtC,GAAE,QAAMsC,GAAE,MAAM,KAAM,IAAEtC,GAAE,eAAa,YAAU,OAAOsC,GAAE,eAAaA,GAAE,aAAa,KAAI,IAAG,QAAO,GAAGA,GAAE,UAAU,MAAItC,GAAE,aAAWsC,GAAE,aAAY,EAAE,aAAa,eAAe,QAAQ,SAASjD,IAAE;AAAC,kBAAMiD,GAAEjD,EAAC,MAAIW,GAAEX,EAAC,IAAEiD,GAAEjD,EAAC;AAAA,QAAE,CAAC,GAAEW,GAAE,cAAY,SAASX,IAAE;AAAC,YAAE,aAAa,YAAYW,IAAEX,EAAC;AAAA,QAAC,GAAEW,GAAE,aAAW,SAASX,IAAE;AAAC,cAAIiD,IAAE3C,KAAEK,GAAE,UAASb,KAAEa,GAAE,UAASR,KAAEH,GAAE,UAASyI,KAAEzI,GAAE,SAAS,WAASA,GAAE,SAAS;AAAQ,UAAAyI,OAAInI,GAAE,WAAS2C,KAAE,EAAE,UAAU,kBAAkBwF,IAAEtI,GAAE,mBAAiB,IAAEQ,GAAE,cAAY,IAAEA,GAAE,SAAO,GAAE,OAAKA,GAAE,MAAM,GAAE,GAAGsC,IAAEnD,GAAE,QAAQ,MAAIa,GAAE,QAAQ,YAAYsC,EAAC,GAAEnD,GAAE,WAASmD,IAAEtC,GAAE,OAAKA,GAAE,YAAY,QAAS,GAACA,GAAE,kBAAkBX,EAAC;AAAA,QAAG,GAAEW,GAAE,oBAAkB,SAASX,IAAE;AAAC,cAAIiD,IAAE9C,IAAEG,IAAER,IAAE2I,KAAE9H,GAAE,UAAS6C,KAAE7C,GAAE,UAASW,KAAEtB,GAAE;AAAS,UAAAyI,GAAE,aAAW,MAAI9H,GAAE,YAAU,CAACA,GAAE,eAAaL,KAAEmI,GAAE,SAAS,OAAO,SAASzI,IAAEiD,IAAE;AAAC,gBAAI3C,IAAER,KAAEmD,GAAE;AAAO,oBAAOA,GAAE,MAAI;AAAA,cAAE,KAAI;AAAI,gBAAA9C,KAAE,EAAC,GAAEL,GAAE,CAAC,GAAE,GAAEA,GAAE,CAAC,EAAC;AAAE;AAAA,cAAM,KAAI;AAAI,gBAAAQ,KAAE,EAAC,GAAER,GAAE,CAAC,GAAE,GAAEA,GAAE,CAAC,EAAC,GAAEK,OAAIH,MAAG,GAAGG,IAAEG,EAAC,IAAGH,KAAEG;AAAE;AAAA,cAAM,KAAI;AAAI,gBAAAA,KAAE,EAAC,GAAER,GAAE,CAAC,GAAE,GAAEA,GAAE,CAAC,EAAC,GAAEK,OAAIH,MAAG,GAAGG,IAAE,EAAC,GAAEL,GAAE,CAAC,GAAE,GAAEA,GAAE,CAAC,EAAC,GAAE,EAAC,GAAEA,GAAE,CAAC,GAAE,GAAEA,GAAE,CAAC,EAAC,GAAEQ,EAAC,IAAGH,KAAEG;AAAA,YAAC;AAAC,mBAAON;AAAA,UAAC,GAAE,CAAC,GAAEF,KAAE,MAAIa,GAAE,WAAS,IAAE,MAAIA,GAAE,WAASL,KAAEA,KAAE,GAAE,MAAIK,GAAE,aAAWsC,KAAE,KAAK,IAAI3B,GAAE,qBAAqBX,GAAE,QAAQ,KAAG,GAAEW,GAAE,mBAAiB,CAAC,IAAEX,GAAE,cAAY,IAAEA,GAAE,SAAO,GAAEb,MAAGA,MAAG,MAAIa,GAAE,WAASsC,KAAE,CAACA,MAAG,IAAE,IAAE3C,KAAER,KAAEQ,KAAER,KAAGa,GAAE,eAAab,MAAGA,MAAGa,GAAE,cAAY,IAAE,IAAEL,KAAER,KAAEQ,KAAER,KAAG2I,GAAE,cAAY3I,IAAE,GAAGa,IAAE6C,IAAE,eAAc1D,EAAC,MAAIa,GAAE,UAAU,YAAY,QAAQ,QAAMb;AAAA,QAAI,GAAEa,GAAE,aAAW,SAASX,IAAE;AAAC,YAAE,aAAa,WAAWW,IAAEX,EAAC;AAAA,QAAC,GAAE,OAAKW,GAAE,aAAW,SAASX,IAAEiD,IAAE;AAAC,UAAAtC,GAAE,QAAM,EAAE,aAAa,WAAWsC,IAAEtC,GAAE,MAAKA,GAAE,cAAY,CAAC;AAAA,QAAC,IAAG;AAAA,MAAG,GAAE,mBAAkB,SAASX,IAAEC,IAAEK,IAAE;AAAC,YAAIc,IAAEtB,IAAEiN,KAAE,CAAA;AAAG,iBAAS/J,GAAEhD,IAAEiD,IAAE;AAAC,iBAAO,KAAK,IAAIjD,GAAE,IAAEiD,GAAE,CAAC,IAAE,KAAG,KAAK,IAAIjD,GAAE,IAAEiD,GAAE,CAAC,IAAE;AAAA,QAAC;AAAC,eAAOjD,GAAE,QAAQ,SAASA,IAAE;AAAC,cAAIiD,IAAE3C,IAAER,IAAEK,IAAEsI,IAAEjF,IAAElC,IAAEX,IAAEqL,IAAE1I,IAAE/B,IAAElB,IAAEmB,IAAEa,IAAEmC,IAAEpB,IAAEuJ,IAAEC,IAAEpK,IAAEG,IAAEkK;AAAE,gBAAI7M,GAAE,UAAQ4M,KAAE5M,GAAE,CAAC,GAAEwC,KAAExC,GAAE,CAAC,GAAE2C,KAAE1C,IAAE4M,KAAE,KAAK,MAAMD,GAAE,IAAEpK,GAAE,GAAEA,GAAE,IAAEoK,GAAE,CAAC,IAAE,MAAG,KAAK,IAAG3J,KAAE,CAAC,EAAC,GAAE2J,GAAE,IAAE,KAAK,IAAIC,EAAC,IAAElK,IAAE,GAAEiK,GAAE,IAAE,KAAK,IAAIC,EAAC,IAAElK,KAAE,GAAE,GAAE,EAAC,GAAEH,GAAE,IAAE,KAAK,IAAIqK,EAAC,IAAElK,IAAE,GAAEH,GAAE,IAAE,KAAK,IAAIqK,EAAC,IAAElK,KAAE,GAAE,CAAC,GAAEvB,MAAGtB,KAAEsB,GAAE,QAAO,MAAIjB,KAAE,KAAK,MAAML,GAAE,CAAC,EAAE,IAAEA,GAAE,CAAC,EAAE,GAAEA,GAAE,CAAC,EAAE,IAAEA,GAAE,CAAC,EAAE,CAAC,IAAE,KAAK,MAAME,GAAE,CAAC,EAAE,IAAEA,GAAE,CAAC,EAAE,GAAEA,GAAE,CAAC,EAAE,IAAEA,GAAE,CAAC,EAAE,CAAC,MAAIG,MAAG,KAAK,KAAGG,KAAE,EAAC,MAAK,QAAO,QAAO2C,IAAE,QAAO,KAAE,KAAGO,KAAE,GAAG1D,GAAE,CAAC,GAAEA,GAAE,CAAC,GAAEG,EAAC,GAAEwI,KAAE,GAAGxF,GAAE,CAAC,GAAEA,GAAE,CAAC,GAAEhD,EAAC,GAAEU,KAAEb,GAAE,CAAC,GAAEwD,KAAEmF,IAAElH,KAAE0B,GAAE,CAAC,GAAE5C,MAAG2L,KAAExI,IAAG,IAAE7C,GAAE,GAAEa,KAAEwK,GAAE,IAAErL,GAAE,GAAE0B,KAAEd,GAAE,IAAE+B,GAAE,GAAEkB,KAAEjD,GAAE,IAAE+B,GAAE,GAAEF,MAAG,CAAC5B,MAAGb,GAAE,IAAE2C,GAAE,KAAGjD,MAAGM,GAAE,IAAE2C,GAAE,OAAK,CAACjB,KAAEb,KAAEnB,KAAEmE,KAAGmI,MAAGtK,MAAG1B,GAAE,IAAE2C,GAAE,KAAGkB,MAAG7D,GAAE,IAAE2C,GAAE,OAAK,CAACjB,KAAEb,KAAEnB,KAAEmE,KAAGlE,MAAGgB,KAAE,KAAG8B,MAAGA,MAAG,KAAG,KAAGuJ,MAAGA,MAAG,IAAE,EAAC,GAAEhM,GAAE,IAAEgM,KAAEtM,IAAE,GAAEM,GAAE,IAAEgM,KAAEnL,GAAC,IAAE,QAAM,EAAC,MAAK,QAAO,QAAO,CAAC1B,GAAE,CAAC,IAAEwB,IAAE2B,GAAE,CAAC,CAAC,EAAC,KAAGnD,GAAE,CAAC,IAAEkD,GAAEyF,IAAEjF,EAAC,IAAEiF,KAAEjF,IAAE,EAAC,MAAK,QAAO,QAAO,CAACiF,IAAExF,GAAE,CAAC,CAAC,EAAC,IAAG7B,GAAE,MAAI,GAAGtB,GAAE,CAAC,GAAEA,GAAE,CAAC,CAAC,MAAIQ,KAAE,EAAC,MAAK,QAAO,QAAO2C,GAAC,GAAE3C,GAAE,MAAI,GAAGA,GAAE,OAAO,CAAC,GAAEA,GAAE,OAAO,CAAC,CAAC,GAAEyM,GAAE,KAAK3L,KAAEd,EAAC,MAAIyM,GAAE,KAAK,EAAC,MAAK,SAAQ,QAAO,SAAS/M,IAAEiD,IAAE3C,IAAER,IAAEK,IAAEsI,IAAE;AAAC,qBAAQjF,IAAElC,IAAEX,KAAE,GAAGX,IAAEiD,IAAE3C,IAAER,EAAC,IAAE2I,IAAEuD,KAAE,KAAGvD,KAAEtI,KAAEA,KAAEsI,KAAE9H,KAAEA,KAAG2C,KAAE,IAAG/B,KAAE,GAAED,MAAG,MAAIkC,KAAE,GAAGxD,IAAEiD,IAAE3C,IAAER,IAAEyB,EAAC,GAAG,UAAQ,KAAK,KAAG,MAAK+B,GAAE,KAAK,EAAC,GAAEE,GAAE,IAAE,KAAK,IAAIlC,EAAC,IAAEnB,IAAE,GAAEqD,GAAE,IAAE,KAAK,IAAIlC,EAAC,IAAEnB,KAAE,GAAE,CAAC,GAAE,EAAE,KAAGoB;AAAI,mBAAGA,MAAGyK,QAAKzK,KAAE;AAAG,mBAAO+B;AAAA,UAAC,EAAEtD,GAAE,CAAC,GAAEA,GAAE,CAAC,GAAEA,GAAE,CAAC,GAAEA,GAAE,CAAC,GAAEC,IAAE,EAAE,EAAC,CAAC,GAAEmB,KAAE;AAAA,QAAK,CAAC,GAAEA,KAAE,MAAK2L,GAAE,QAAQ,SAAS/M,IAAE;AAAC,cAAIiD;AAAE,UAAA7B,KAAE,WAASpB,GAAE,QAAMA,GAAE,WAASoB,GAAE,MAAInB,OAAIgD,KAAE7B,GAAE,QAAQ,CAAC,IAAE,GAAG6B,GAAE,CAAC,GAAEA,GAAE,CAAC,GAAE,CAAChD,EAAC,GAAEmB,GAAE,MAAI,GAAG6B,GAAE,CAAC,GAAEA,GAAE,CAAC,CAAC,MAAI7B,GAAE,SAAO,MAAKA,GAAE,MAAI,IAAGpB,GAAE,MAAIC,KAAEK,OAAI2C,KAAEjD,GAAE,QAAQ,CAAC,IAAE,GAAGiD,GAAE,CAAC,GAAEA,GAAE,CAAC,GAAE,EAAEhD,KAAEK,GAAE,GAAEN,GAAE,MAAI,GAAGiD,GAAE,CAAC,GAAEA,GAAE,CAAC,CAAC,MAAIjD,GAAE,SAAO,MAAKA,GAAE,MAAI,KAAIA,MAAG;AAAA,QAAI,CAAC,GAAE+M,GAAE,OAAO,SAAS9J,IAAEjD,IAAE;AAAC,cAAIM,KAAEN,GAAE;AAAO,iBAAOM,OAAIR,MAAGkD,GAAE1C,GAAE,CAAC,GAAER,EAAC,KAAGmD,GAAE,KAAK,EAAC,MAAK,KAAI,QAAO,CAAC3C,GAAE,CAAC,EAAE,GAAEA,GAAE,CAAC,EAAE,CAAC,EAAC,CAAC,GAAE,WAASN,GAAE,OAAKiD,GAAE,KAAK,EAAC,MAAK,KAAI,QAAO,CAAC3C,GAAE,CAAC,EAAE,GAAEA,GAAE,CAAC,EAAE,CAAC,EAAC,CAAC,KAAGA,GAAE,SAAQA,GAAE,QAAQ,SAASN,IAAE;AAAC,YAAAiD,GAAE,KAAK,EAAC,MAAK,KAAI,QAAO,CAACjD,GAAE,GAAEA,GAAE,CAAC,EAAC,CAAC;AAAA,UAAC,CAAC,IAAGF,KAAEQ,GAAEA,GAAE,SAAO,CAAC,IAAG2C;AAAA,QAAC,GAAE,CAAA,CAAE;AAAA,MAAC,GAAE,SAAQ,SAASjD,IAAEiD,IAAE3C,IAAER,IAAE;AAAC,YAAIK,IAAEsI,IAAEjF,IAAElC,IAAEX,IAAEqL,IAAE1I,IAAE/B,IAAElB,KAAE4C,GAAE,gBAAgB,IAAG,MAAM,GAAEzB,KAAEnB,GAAE,YAAY4C,GAAE,gBAAgB,IAAG,MAAM,CAAC;AAAE,eAAOzB,GAAE,KAAGrB,KAAEG,KAAE,UAASgB,MAAGkC,KAAEP,GAAE,gBAAgB,IAAG,MAAM,GAAG,YAAYA,GAAE,gBAAgB,IAAG,UAAU,CAAC,GAAG,KAAK,UAAQ,MAAI9C,IAAEmB,GAAE,YAAY,QAAQ,uBAAuB,UAAU,mBAAkB,CAAC,GAAEA,GAAE,cAAYtB,IAAE,aAAW,OAAOqC,OAAIA,KAAE,gBAAemB,GAAE,QAAO1D,MAAG,CAACuC,MAAGmB,GAAE,KAAGiF,KAAEnI,KAAE,SAAQD,GAAE,YAAYmD,EAAC,IAAGF,MAAG3C,KAAEsC,GAAE,gBAAgB,IAAG,GAAG,GAAG,YAAYA,GAAE,gBAAgB,IAAG,KAAK,CAAC,GAAG,KAAK,UAAQ,MAAIwF,KAAGuD,KAAErL,GAAE,YAAYsC,GAAE,gBAAgB,IAAG,KAAK,CAAC,GAAG,KAAK,UAAQ,MAAIwF,KAAGlH,KAAE+B,GAAE,OAAO,iBAAe,SAAQ,EAAC,aAAYE,IAAE,SAAQhC,IAAE,WAAUF,IAAE,WAAUkC,GAAE,OAAM,WAAUwI,GAAE,OAAM,aAAYzK,IAAE,WAAUZ,GAAE,OAAM,YAAW,CAACN,IAAEM,EAAC,EAAC,MAAIY,KAAEiC,GAAE,OAAM1D,OAAIyB,GAAE,iBAAe,SAAQA,GAAE,aAAW,WAAU,EAAC,aAAYiC,IAAE,SAAQhC,IAAE,WAAUF,IAAE,WAAUC,IAAE,WAAUA,IAAE,aAAYzB,KAAEyB,KAAE,MAAK,WAAUA,IAAE,YAAW,CAAClB,IAAEmD,EAAC,EAAC;AAAA,MAAE,GAAE,SAAQ,SAASP,IAAE3C,IAAE;AAAC,YAAIN,IAAEF,IAAEK,KAAE,EAAE,UAAU,QAAQ8C,GAAE,MAAK3C,GAAE,WAAW,UAAS,IAAE,gBAAc2C,GAAE,KAAIA,GAAE,YAAY;AAAE,SAAC,eAAc,WAAU,aAAY,aAAY,aAAY,YAAY,EAAE,QAAQ,SAASjD,IAAE;AAAC,UAAAiD,GAAEjD,EAAC,IAAEG,GAAEH,EAAC;AAAA,QAAC,CAAC,GAAEiD,GAAE,UAAQ,OAAGA,GAAE,UAAU,aAAW,UAAS,EAAE,aAAa,eAAe,QAAQ,SAASjD,IAAE;AAAC,kBAAMiD,GAAEjD,EAAC,MAAIG,GAAE,UAAUH,EAAC,IAAEiD,GAAEjD,EAAC;AAAA,QAAE,CAAC,GAAEG,GAAE,WAAW,QAAQ,SAASH,IAAE;AAAC,UAAAM,GAAE,IAAI,YAAYN,EAAC;AAAA,QAAC,CAAC,GAAEG,GAAE,QAAQ,YAAY,CAAC,EAAC,MAAK,KAAI,QAAO,CAAC,GAAE,GAAG,EAAC,GAAE,EAAC,MAAK,KAAI,QAAO,CAAC,GAAG,EAAC,CAAC,CAAC,GAAEH,KAAEG,GAAE,YAAY,QAAS,GAACA,GAAE,UAAU,aAAW,CAAC,SAAQ,OAAM,QAAQ,EAAE8C,GAAE,QAAQ,GAAE,MAAIA,GAAE,YAAUA,GAAE,cAAY9C,GAAE,UAAU,YAAY,QAAQ,uBAAuB,UAAU,2BAA0B,EAAE,GAAE8C,GAAE,SAAOjD,GAAE,QAAOiD,GAAE,iBAAenD,KAAE,MAAIA,KAAEE,GAAE,SAAO,KAAG,KAAGF,KAAE,IAAE,IAAEA,IAAEK,GAAE,YAAY,cAAYL,KAAE,MAAKK,GAAE,YAAY,SAAO8C,GAAE,eAAcA,GAAE,cAAYnD,MAAG,GAAE,GAAGmD,GAAE,UAAS,EAAE,UAAU,KAAK,GAAEA,GAAE,YAAY3C,EAAC,GAAE2C,GAAE,WAAW3C,EAAC,GAAE2C,GAAE,kBAAkB3C,EAAC,GAAE,MAAI,GAAGA,IAAE,EAAE,GAAE2C,GAAE,WAAW3C,EAAC;AAAA,MAAC,GAAE,MAAK,SAASN,IAAEiD,IAAE;AAAC,YAAI3C,KAAE2C,GAAE;AAAM,eAAOjD,GAAE,SAAO,GAAGM,IAAE,kBAAiBN,GAAE,WAAW,GAAE,GAAGM,IAAE,wBAAuBN,GAAE,UAAU,GAAE,GAAGM,IAAE,YAAWN,GAAE,UAAU,GAAEA,GAAE,WAAS,iBAAeiD,GAAE,aAAW,IAAE,eAAaA,GAAE,aAAW,IAAE,GAAE,MAAIjD,GAAE,YAAU,CAACA,GAAE,cAAY,GAAGM,IAAE,4BAA2BN,GAAE,iBAAiB,GAAE,GAAGM,IAAE,WAAUN,GAAE,UAAU,GAAE,MAAI,GAAGM,IAAE,oBAAmBN,GAAE,UAAU,GAAE,EAAE,UAAU,QAAQA,IAAEM,EAAC,GAAE;AAAA,MAAE,GAAE,QAAO,SAASN,IAAEiD,IAAE;AAAC,YAAI3C,KAAE2C,GAAE;AAAM,QAAAjD,GAAE,eAAaA,GAAE,WAAW,QAAQ,SAASA,IAAE;AAAC,UAAAM,GAAE,IAAI,YAAYN,EAAC;AAAA,QAAC,CAAC,GAAEA,GAAE,cAAYA,GAAE,UAAQA,GAAE,YAAUA,GAAE,YAAUA,GAAE,YAAUA,GAAE,aAAW,OAAM,GAAGA,GAAE,UAAS,EAAE,UAAU,KAAK,GAAE,GAAGA,GAAE,UAAS,EAAE,UAAU,KAAK,GAAEA,GAAE,SAAO,GAAGM,IAAE,kBAAiBN,GAAE,WAAW,GAAE,GAAGM,IAAE,wBAAuBN,GAAE,UAAU,GAAE,GAAGM,IAAE,YAAWN,GAAE,UAAU,GAAE,MAAIA,GAAE,YAAU,CAACA,GAAE,cAAY,GAAGM,IAAE,4BAA2BN,GAAE,iBAAiB,GAAE,GAAGM,IAAE,WAAUN,GAAE,UAAU,GAAE,OAAK,GAAGM,IAAE,oBAAmBN,GAAE,UAAU,GAAE,GAAGM,IAAE,CAAE,CAAA;AAAA,MAAE,GAAE,cAAa,SAASN,IAAEiD,IAAE;AAAC,YAAI3C,KAAE2C,GAAE,OAAMnD,KAAE,CAAA;AAAG,QAAAA,GAAEmD,GAAE,UAAU,IAAE,IAAG,GAAG3C,IAAER,EAAC;AAAA,MAAC,GAAE,QAAO,SAASmD,IAAE;AAAC,QAAAA,GAAE,aAAa,WAAS,QAAQ,MAAM,gDAAgD,GAAEA,GAAE,aAAa,QAAQ,SAASjD,IAAE;AAAC,YAAE,UAAU,OAAOiD,IAAEjD,EAAC;AAAA,QAAC,CAAC;AAAA,MAAE,EAAC,EAAC,GAAE,OAAO,KAAK,CAAC,EAAE,QAAQ,SAASA,IAAE;AAAC,WAAGA,EAAC,IAAE,WAAU;AAAC,iBAAO,IAAIqE,GAAE,EAAErE,EAAC,GAAE,MAAM,UAAU,MAAM,KAAK,SAAS,CAAC;AAAA,QAAC;AAAA,MAAC,CAAC,GAAE,GAAG,yBAAuB,MAAG,OAAO,iBAAiB,UAAS2C,GAAE,IAAI,WAAU;AAAC,WAAG,0BAAwB,OAAO,KAAK,EAAE,EAAE,QAAQ,SAAS3C,IAAE;AAAC,aAAG,GAAGA,EAAC,GAAE,EAAC,UAAS,KAAE,CAAC;AAAA,QAAC,CAAC;AAAA,MAAC,CAAC,GAAE,KAAE,GAAE;AAAA,IAAE;AAAI,KAAC,SAASA,IAAEiD,IAAE;AAAsD,aAAA,UAAeA,GAAwE;AAAA,IAAA,EAAEwI,gBAAK,WAAU;AAAC,aAAOI;AAAA,IAAU,CAAC;AAAA;;;ACOv1kG,MAAI,gBAAgB,MAAM,cAAc,CAAA,CAAE;AAC1C,MAAIoC,gBAAc,MAAM,cAAc,MAAS;AAC/C,MAAI,cAAc,MAAM,cAAc,CAAA,CAAE;AACxC,MAAI,eAAe,MAAM,cAAc,MAAS;AAChD,MAAI,YAAY,CAAC,MAAM,UAAU;AAC7B,QAAI,QAAQ,kBAAkB,MAAM,OAAO,KAAK,MAAM,GAAG;AACzD,QAAI,MAAM,kBAAkB,MAAM,KAAK,KAAK,MAAM,GAAG;AACrD,WAAO,KAAK,MAAM,IAAI,YAAY,OAAO,GAAG;AAAA,EAChD;AACA,MAAI,kBAAkB,CAAC,EAAE,YAAY;AACjC,QAAI,UAAUC,wBAAW,WAAW;AACpC,QAAI,mBAAmB,CAAC,EAAE,UAAU,OAAA9N,OAAK,MAAO;AAC5C,UAAI,OAAO,CAAC,GAAG,SAAS,SAASA,OAAM,SAAQ,CAAE;AACjD,aAAQ,MAAM;AAAA,QAAc,YAAY;AAAA,QAAU,EAAE,OAAO,KAAM;AAAA,QAC7D,MAAM,cAAc,MAAM,EAAE,WAAW,KAAK,KAAK,GAAG,GAAG,kBAAkB,YAAY,QAAQ;AAAA,MAAC;AAAA,IAC1G;AAEI,WAAQ,MAAM;AAAA,MAAc;AAAA,MAAS,EAAE,WAAW,QAAS;AAAA,MACvD,MAAM;AAAA,QAAc;AAAA,QAAS;AAAA,QACzB,MAAM,cAAc,MAAM,MAAM,MAAM,SAAS,QAAS,MAAM,MAAM,IAAI,CAAC,IAAID,OAAO,MAAM;AAAA,UAAc;AAAA,UAAkB,EAAE,KAAKA,IAAG,OAAOA,GAAG;AAAA,UAC1I,MAAM,cAAc,WAAW,EAAE,OAAO,GAAI,CAAA;AAAA,QAAC,CAAE,IAAM,MAAM;AAAA,UAAc,MAAM;AAAA,UAAU;AAAA,UACzF,MAAM,MAAM,CAAC,EAAE,IAAI,CAAC,IAAIA,OAAO,MAAM;AAAA,YAAc;AAAA,YAAkB,EAAE,KAAKA,IAAG,OAAOA,GAAG;AAAA,YACrF,MAAM,cAAc,WAAW,EAAE,OAAO,GAAE,CAAE;AAAA,UAAC,CAAE;AAAA,UACnD,MAAM,cAAc,MAAM,MAAM,KAAK;AAAA,UACrC,MAAM;AAAA,YAAc;AAAA,YAAkB,EAAE,OAAO,IAAK;AAAA,YAChD,MAAM,cAAc,WAAW,EAAE,OAAO,MAAM,MAAM,CAAC,EAAC,CAAE;AAAA,UAAC;AAAA,QAAC,CAAE;AAAA,MAAC;AAAA,IAAC;AAAA,EAClF;AACA,MAAI,aAAa,CAACwC,IAAG,MAAM;AACvB,QAAI,QAAQA,GAAE,OAAO,KAAK,CAAC,CAAC,EAAE,MAAM,MAAM,EAAE;AAC5C,QAAI,CAAC,OAAO;AACR,UAAI,WAAW,KAAK,UAAUA,IAAG,QAAW,CAAC;AAC7C,YAAM,IAAI,MAAM,yBAAyB,CAAC,gBAAgB,QAAQ,EAAE;AAAA,IACvE;AACD,WAAO,MAAM,CAAC,EAAE;AAAA,EACpB;AACA,MAAI,cAAc,CAAC,WAAW;AAC1B,QAAI,WAAW,WAAW,QAAQ,SAAS;AAC3C,WAAO;AAAA,EACX;AACA,MAAI,WAAW,CAAC,QAAQ;AACpB,QAAI,UAAU,WAAW,KAAK,KAAK;AACnC,QAAI,SAAS,WAAW,SAAS,KAAK;AACtC,WAAO,YAAY,MAAM;AAAA,EAC7B;AACA,MAAI,aAAa,CAAC,UAAU;AACxB,QAAI,MAAM,eAAe;AACrB;AACJ,QAAI,aAAa,MAAM,WAAW;AAClC,QAAI;AACJ,QAAI,eAAe,UAAU;AACzB,UAAI,MAAM,WAAW,OAAO,KAAK;AACjC,iBAAW,SAAS,GAAG;AAAA,IAC1B,WACQ,eAAe,OAAO;AAC3B,iBAAW,SAAS,KAAK;AAAA,IAC5B,WACQ,eAAe,OAAO;AAC3B,UAAI,SAAS,WAAW,OAAO,GAAG;AAClC,iBAAW,YAAY,MAAM;AAAA,IAChC,OACI;AACD,YAAM,IAAI,MAAM,6BAA6B,UAAU,EAAE;AAAA,IAC5D;AACD,QAAI,MAAM,SAAS,OAAO,CAAC,EAAE,CAAC;AAC9B,WAAO;AAAA,EACX;AACA,MAAI,UAAU,CAAC,EAAE,YAAY;AACzB,QAAI,UAAUuL,wBAAW,WAAW;AACpC,QAAI,SAASA,wBAAW,aAAa;AACrC,QAAI,MAAM,WAAW,KAAK;AAC1B,QAAI,OAAO,CAAC,OAAO;AACf,aAAO,MAAM,cAAc,WAAW,EAAE,OAAO,IAAG,CAAE;AACxD,QAAI,MAAM,SAAS,UAAU,CAAC,OAAO,eAAe;AAChD,UAAI,WAAW,WAAW,OAAO,KAAK;AACtC,UAAIC,OAAM,SAAS,OAAO,CAAC,EAAE,CAAC;AAC9B,aAAO,MAAM,cAAc,WAAW,EAAE,OAAOA,KAAG,CAAE;AAAA,IACvD;AACD,QAAI,UAAU,MAAM,WAAW,MAAM;AACrC,QAAI,UAAU,MAAM,OAAO,SAAS,KAAK,MAAM,OAAO,CAAC,EAAE,CAAC,MAAM;AAChE,QAAI,WAAW,MAAM,OAAO,WAAW,GAAG;AACtC,UAAI,OAAO,CAAC,GAAG,SAAS,SAAS,GAAG;AACpC,UAAI,QAAQ,MAAM,OAAO,CAAC,EAAE,CAAC;AAC7B,UAAI,QAAS,MAAM;AAAA,QAAc,YAAY;AAAA,QAAU,EAAE,OAAO,KAAM;AAAA,QAClE,MAAM,cAAc,WAAW,EAAE,OAAO,MAAK,CAAE;AAAA,MAAC;AACpD,UAAI,cAAc,MAAM,SAAS,SAC7B,CAAC,OAAO,iBACR,WAAW,MAAM,KAAK,MAAM;AAChC,aAAQ,MAAM,cAAc,QAAQ,EAAE,WAAW,KAAK,KAAK,GAAG,EAAG,GAAE,cAAe,MAAM;AAAA,QAAc,MAAM;AAAA,QAAU;AAAA,QAClH;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MAAG,IAAM,MAAM;AAAA,QAAc,MAAM;AAAA,QAAU;AAAA,QAC7C;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MAAK,CAAE;AAAA,IACd;AACD,QAAI,QAAQ,MAAM,OAAO,IAAI,CAAC,CAAC,GAAGxL,EAAC,GAAGxC,OAAM;AACxC,UAAI,OAAO,CAAC,GAAG,SAAS,SAASA,GAAE,SAAQ,CAAE;AAC7C,aAAQ,MAAM;AAAA,QAAc;AAAA,QAAM,EAAE,KAAK,GAAG,WAAW,KAAK,KAAK,GAAG,EAAG;AAAA,QACnE,MAAM;AAAA,UAAc,YAAY;AAAA,UAAU,EAAE,OAAO,KAAM;AAAA,UACrD,MAAM,cAAc,WAAW,EAAE,OAAOwC,GAAC,CAAE;AAAA,QAAC;AAAA,MAAC;AAAA,IAC7D,CAAK;AACD,WAAQ,MAAM;AAAA,MAAc,MAAM;AAAA,MAAU;AAAA,MACxC;AAAA,MACA,MAAM;AAAA,QAAc;AAAA,QAAS;AAAA,QACzB,MAAM,cAAc,SAAS,MAAM,UAAW,MAAM,cAAc,MAAM,MAAM,KAAK,IAAM,MAAM,OAAO,IAAI,CAAC,CAAC,GAAG,EAAE,GAAGxC,OAAO,MAAM;AAAA,UAAc;AAAA,UAAM,EAAE,KAAKA,GAAG;AAAA,UAC3J,MAAM,cAAc,MAAM,MAAM,CAAC;AAAA,UACjC,MAAMA,EAAC;AAAA,QAAC,CAAE,CAAE;AAAA,MAAC;AAAA,IAAC;AAAA,EAC9B;AACA,MAAI,cAAc,CAAC,EAAE,OAAO,EAAE,MAAM,MAAO,EAAA,MAAO;AAC9C,QAAI,SAAS+N,wBAAW,aAAa;AACrC,QAAI,UAAU,KAAK,QAAQ,SAAS,SAC9B,QAAQ,KAAK,QAAQ,MAAM,KAAK,KAChC,SAAS,KAAK,QAAQ,MAAM,KAAK,IAAI,KAAK,QAAQ,MAAM,KAAK;AACnE,QAAI,QAAQ,CAAC,GAAG,KAAK,KAAK;AAC1B,QAAI,WAAW,EAAE,KAAK,KAAK;AAC3B,QAAI,QAAQ,YAAY,SAAS,SAAS,aAAa,SAAS,QAAQ;AACxE,QAAI,YAAY,SAAS,SAAS,WAAW,SAAS,UAAU;AAC5D,YAAM,IAAG;AACb,QAAI,YAAY,MAAM,IAAI,UAAQ,KAAK,SAAS,UAC1C,SAAS,KAAK,KAAK,KACnB,KAAK,SAAS,UACV,SAAS,KAAK,KAAK,KACnB,KAAK,SAAS,aACV,SAAS,KAAK,MAAM,CAAC,CAAC,KACtB,EAAE;AAChB,QAAI,QAAQ;AAAA,MACR,iBAAiB,CAAC,SAAS,GAAG,SAAS,EAAE,KAAK,GAAG;AAAA,IACzD;AACI,QAAI,OAAO;AACP,YAAM,qBAAqB,IAAI;AAAA,QAC3B;AAAA,QACA,GAAG,UAAU,MAAM,GAAG,EAAE;AAAA,QACxB,SAAS,MAAM,CAAC,CAAC;AAAA,MAC7B,EAAU,KAAK,GAAG;AAAA,IACb;AACD,QAAI,UAAW,MAAM,cAAc,QAAQ,EAAE,WAAW,WAAW,GAAG,SAAS,GAAQ;AACvF,WAAO,OAAO,iBAAiB,QAAS,MAAM;AAAA,MAAc;AAAA,MAAS;AAAA,MACjE,MAAM;AAAA,QAAc;AAAA,QAAS;AAAA,QACzB,MAAM;AAAA,UAAc;AAAA,UAAM;AAAA,UACtB,MAAM,cAAc,MAAM,MAAM,KAAK;AAAA,UACrC,MAAM,cAAc,MAAM,MAAM,OAAO;AAAA,QAAC;AAAA,QAC5C,MAAM;AAAA,UAAc;AAAA,UAAM;AAAA,UACtB,MAAM,cAAc,MAAM,MAAM,KAAK;AAAA,UACrC,MAAM,cAAc,MAAM,MAAM,MAAM,SAAQ,CAAE;AAAA,QAAC;AAAA,MAAC;AAAA,IAAC,IAAM;AAAA,EACzE;AACA,MAAI,YAAY,CAAC,EAAE,YAAY;AAC3B,QAAI,UAAUA,wBAAW,WAAW;AACpC,QAAI,QAAQA,wBAAW,YAAY;AACnC,WAAQ,MAAM,cAAc,MAAM,UAAU,MAAM,MAAM,SAAS,UAC7D,MAAM,SAAS,UACf,MAAM,SAAS,SACf,MAAM,SAAS,UAAW,MAAM,MAAM,aAAc,MAAM,SAAS,SAAU,OAAO,aAAa,MAAM,KAAK,EAAE,QAAQ,KAAK,GAAQ,IAAK,MAAM,SAAS,UAAW,MAAM;AAAA,MAAc,MAAM;AAAA,MAAU;AAAA,MACtM,MAAM;AAAA,QAAc;AAAA,QAAS;AAAA,QACzB,MAAM;AAAA,UAAc;AAAA,UAAS;AAAA,UACzB,MAAM,cAAc,MAAM,MAAM,MAAM,MAAM,IAAI,CAACvL,IAAGxC,OAAM;AACtD,gBAAI,OAAO,CAAC,GAAG,SAAS,SAASA,GAAE,SAAQ,CAAE;AAC7C,mBAAQ,MAAM;AAAA,cAAc;AAAA,cAAM,EAAE,KAAKA,IAAG,WAAW,KAAK,KAAK,GAAG,EAAG;AAAA,cACnE,MAAM;AAAA,gBAAc,YAAY;AAAA,gBAAU,EAAE,OAAO,KAAM;AAAA,gBACrD,MAAM,cAAc,WAAW,EAAE,OAAOwC,GAAC,CAAE;AAAA,cAAC;AAAA,YAAC;AAAA,UACzE,CAAiB,CAAC;AAAA,QAAC;AAAA,MAAC;AAAA,IAAC,IAAK,MAAM,SAAS,QAAS,MAAM,cAAc,SAAS,EAAE,OAAO,MAAM,MAAK,CAAE,IAAK,MAAM,SAAS,YAAa,MAAM,cAAc,aAAa,EAAE,OAAO,MAAM,OAAO,IAAK,MAAM,SAAS,UAAW,MAAM,cAAc,iBAAiB,EAAE,OAAO,MAAM,MAAO,CAAA,IAAK,MAAM,SAAS,iBAAkB,MAAM;AAC3T,UAAI,UAAU,SACV,MAAM,SAAS,yBACf,MAAM,MAAM,aAAa,MAAM,MAAM;AACzC,aAAQ,MAAM,cAAc,QAAQ,EAAE,WAAW,WAAW,eAAe,EAAE,OAAO,QAAO,CAAE,EAAG,GAAE,GAAQ;AAAA,IAClH,OAAa,MAAM,cAAc,MAAM,UAAU,MAAM,MAAM,CAAE;AAAA,EAC/D;AACA,MAAI,aAAa,CAAC,EAAE,OAAAvC,QAAO,OAAQ,MAAK,OAAO,WAAW,IAAK,MAAM,cAAc,OAAO,EAAE,WAAW,wBAAwB,eAAe,IAAM,MAAM;AAAA,IAAc;AAAA,IAAS,EAAE,WAAW,SAAU;AAAA,IACpM,MAAM,cAAc,SAAS,MAAM,OAAO,IAAI,CAAC,EAAE,MAAAK,OAAM,OAAO,YAAW,GAAIN,OAAM;AAC/E,UAAI,OAAO,CAAC,SAASC,OAAM,SAAQ,GAAIK,KAAI;AAE3C,UAAI,UAAU,YAAY,KAAK,CAAAc,OAAKA,GAAE,WAAW,CAAC;AAClD,aAAQ,MAAM;AAAA,QAAc;AAAA,QAAM,EAAE,KAAKpB,IAAG,WAAW,WAAW,EAAE,OAAO,QAAS,CAAA,EAAG;AAAA,QACnF,MAAM,cAAc,MAAM,MAAMM,KAAI;AAAA,QACpC,MAAM;AAAA,UAAc;AAAA,UAAM,EAAE,WAAW,KAAK,KAAK,GAAG,GAAG,kBAAkB,QAAS;AAAA,UAC9E,MAAM;AAAA,YAAc,YAAY;AAAA,YAAU,EAAE,OAAO,KAAM;AAAA,YACrD,MAAM,cAAc,WAAW,EAAE,MAAc,CAAA;AAAA,UAAC;AAAA,QAAC;AAAA,MAAC;AAAA,IACtE,CAAK,CAAC;AAAA,EAAC;AACP,MAAI,SAAS,CAAC,EAAE,UAAU,UAAW,MAAM,MAAM;AAAA,IAAc;AAAA,IAAO,EAAE,WAAW,UAAU,aAAa,EAAE,GAAI;AAAA,IAC5G,MAAM,cAAc,OAAO,EAAE,WAAW,cAAe,GAAE,QAAQ;AAAA,IACjE,MAAM,cAAc,OAAO,EAAE,WAAW,YAAW,CAAE;AAAA,EAAC;AAC1D,MAAI,YAAY,CAAC,EAAE,OAAAL,QAAO,YAAY;AAClC,QAAIsD,QAAOwK,wBAAWD,aAAW;AACnB,cAAUvK,OAAM,MAAM,QAAQ;AAC5C,WAAQ,MAAM;AAAA,MAAc;AAAA,MAAO,EAAE,WAAW,QAAS;AAAA,MACrD,MAAM,cAAc,QAAQ,EAAE,WAAW,eAAgB,GAAE,MAAM,IAAI;AAAA,MACjB;AAAA,MACpD,MAAM,cAAc,YAAY,EAAE,OAAOtD,QAAO,QAAQ,MAAM,OAAQ,CAAA;AAAA,IAAC;AAAA,EAC/E;AACA,MAAI,YAAY,CAAC,EAAE,YAAa,MAAM;AAAA,IAAc;AAAA,IAAO,EAAE,WAAW,eAAgB;AAAA,IACpF,MAAM,cAAc,QAAQ,EAAE,WAAW,gBAAiB,GAAE,OAAO;AAAA,IACnE,MAAM,cAAc,OAAO,EAAE,WAAW,SAAQ,GAAI,MAAM,OAAO,IAAI,CAAC,OAAOD,OAAO,MAAM,cAAc,WAAW,EAAE,KAAKA,IAAG,OAAOA,IAAG,MAAc,CAAA,CAAE,CAAC;AAAA,EAAC;AAC7J,MAAI,WAAW,CAAC,EAAE,WAAY,MAAM;AAAA,IAAc;AAAA,IAAO,EAAE,WAAW,cAAe;AAAA,IACjF,MAAM,cAAc,QAAQ,EAAE,WAAW,gBAAiB,GAAE,MAAM;AAAA,IAClE,MAAM;AAAA,MAAc;AAAA,MAAS;AAAA,MACzB,MAAM,cAAc,SAAS,MAAM,KAAK,UAAU,IAAI,CAAC,OAAOA,OAAM;AAChE,YAAI,OAAO,CAAC,QAAQA,GAAE,SAAU,CAAA;AAChC,eAAQ,MAAM;AAAA,UAAc;AAAA,UAAM,EAAE,KAAKA,GAAG;AAAA,UACxC,MAAM;AAAA,YAAc;AAAA,YAAM,EAAE,WAAW,KAAK,KAAK,GAAG,GAAG,kBAAkB,OAAQ;AAAA,YAC7E,MAAM;AAAA,cAAc,YAAY;AAAA,cAAU,EAAE,OAAO,KAAM;AAAA,cACrD,MAAM,cAAc,WAAW,EAAE,MAAc,CAAA;AAAA,YAAC;AAAA,UAAC;AAAA,QAAC;AAAA,MAC1E,CAAS,CAAC;AAAA,IAAC;AAAA,EAAC;AACZ,aAAW,yBAAyB;AAEpC,QAAM,UAAU;AAAA;AAAA,IAEZ,OAAO;AAAA,MACH;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACH;AAAA;AAAA,IAED,MAAM;AAAA,MACF;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACH;AAAA,EACL;AACA,MAAI,eAAe,CAAC,cAAc,kBAAkB,sBAAsB;AACtEiO,iBAAAA,UAAU,MAAM;AACZ,UAAI,YAAY,aAAa;AAC7B,UAAI,gBAAgB,iBAAiB;AACrC,UAAI,iBAAiB,kBAAkB;AACvC,UAAI,UAAU,cAAc,iBAAiB,UAAU;AAGvD,UAAI,cAAc,iBAAiB,SAAS,IAAI,EAAE,iBAAiB,qBAAqB;AACxF,UAAI,QAAQ,CAAC,QAAQ;AACjB,YAAI,MAAM,cAAc,cAAc,IAAI,IAAI,OAAO,GAAG,CAAC,EAAE;AAC3D,YAAI,CAAC;AACD,gBAAM,IAAI,MAAM,iDAAiD,IAAI,OAAO,GAAG,CAAC,EAAE;AACtF,eAAO;AAAA,MACnB;AACQ,UAAI,kBAAkB,CAAC,OAAO,GAAG,QAAQ,OAAO,MAAM,OAAO,SAAS;AAItE,UAAI,YAAY,CAAA;AAChB,UAAI,WAAW,MAAM,KAAK,OAAO,EAAE,IAAI,SAAO;AAC1C,YAAI,SAAS,IAAI,QAAQ;AACzB,YAAI,MAAM,MAAM,MAAM;AACtB,YAAI,WAAW,IAAI,QAAQ,eACrB,MAAM,IAAI,QAAQ,YAAY,IAC9B;AACN,YAAI,YAAY,IAAI,QAAQ;AAC5B,YAAI,QAAQ;AAAA,UACR,WAAW,gBAAgB,GAAG;AAAA,UAC9B,WAAW,gBAAgB,GAAG;AAAA,QAC9C;AACY,YAAI,EAAE,UAAU;AACZ,oBAAU,MAAM,IAAI;AACxB,YAAI,WAAW,UAAU,MAAM;AAC/B,kBAAU,MAAM,KAAK;AACrB,eAAO,EAAE,KAAK,KAAK,UAAU,QAAQ,WAAW,UAAU;MACtE,CAAS;AAID,UAAI,SAAS,EAAE,QAAQ,UAAU,OAAO;AAExC,UAAI,YAAY,CAAC,KAAKjO,OAAM;AACxB,YAAI;AACA,cAAI,EAAE,WAAW,cAAc,IAAI;AAGnC,cAAI,cAAc,cAAc,UAAU,cAAc,UAAU,SAAS;AAC3E,cAAI;AACJ,cAAI,IAAI,UAAU;AAId,wBAAY,WAAW,WAAW,IAAI,KAAK;AAAA,cACvC,OAAO;AAAA,cACP,OAAO,IAAI,SAAS,aAChB,IAAI,IAAI,cACR,IAAI,IAAI;AAAA,cACZ,QAAQ;AAAA,cACR,GAAG;AAAA,cACH,WAAW,cAAc,0BAA0B;AAAA,YAC3E,CAAqB;AAAA,UACJ,WACQ,cAAc,WAAW,cAAc,SAAS;AAGrD,wBAAY,WAAW,YAAY,IAAI,KAAK,EAAE,GAAG,QAAQ,GAAG,MAAK,CAAE;AAAA,UACtE,WACQ,IAAI,cAAc,UAAU;AACjC,wBAAY,IAAI;AAAA,UACnB,OACI;AACD,gBAAIF,KAAI,cAAc,UAAU,MAAM;AAGtC,gBAAIuE,KAAI,kBAAkB;AAAA,cACtB,QAAQ;AAAA,cACR,SAAS;AAAA,cACT,OAAO,IAAI;AAAA,cACX,OAAO,UAAU,IAAI,MAAM,IAAI;AAAA,YACvD,CAAqB;AACD,wBAAY,WAAW,YAAY,IAAI,KAAK;AAAA,cACxC,GAAG,GAAGvE,EAAC;AAAA,cACP,GAAG,GAAGuE,EAAC;AAAA,YAC/B,CAAqB;AAAA,UACJ;AACD,gBAAM,qBAAqB,CAAC,QAAQ,QAAQ,KAAK;AACjD,cAAI,SAAS,mBAAmB,KAAK,CAAA7D,OAAK,SAAS,gBAAgB,UAAU,SAASA,EAAC,CAAC;AACxF,cAAI0N,SAAQ,SAAS,SAAS;AAC9B,cAAI,UAAU,QAAQA,MAAK;AAC3B,cAAI,QAAQ,QAAQlO,KAAI,QAAQ,MAAM;AACtC,cAAI,aAAa,IAAI,IAAI,QAAQ,QAAQ,MAAM;AAC/C,cAAI,cAAc,SAAS,MAAM;AACjC,cAAI;AACA,oBAAQ,MAAM,QAAQ,QAAQ,KAAK,WAAW,GAAG;AACrD,cAAI,qBAAqB;AACzB,cAAI,mBAAmB;AACvB,cAAI,IAAI,MAAM,cAAc,WAAW,IAAI,MAAM,cAAc,QAAQ;AACnE,iCAAqB;AACrB,+BAAmB,MAAMA,KAAI;AAAA,UAChC;AACD,cAAI,OAAO,IAAI,WAAW,IAAI,KAAK,WAAW;AAAA,YAC1C;AAAA,YACA,MAAM;AAAA,YACN,aAAa;AAAA,YACb;AAAA,YACA,WAAW,IAAI;AAAA,YACf;AAAA,YACA;AAAA,UACpB,CAAiB;AAGD,cAAI,eAAe,CAAC,cAAc;AAClC,cAAI,IAAI;AACJ,yBAAa,KAAK,yBAAyB;AAC/C,cAAI,cAAc,aAAa,IAAI,SAAO;AACtC,gBAAI,KAAK,SAAS,KAAK,cAAc,YAAY,GAAG,EAAE;AACtD,gBAAI,CAAC;AACD,oBAAM,IAAI,MAAM,+BAA+B,GAAG,EAAE;AACxD,mBAAO;AAAA,UAC3B,CAAiB;AACD,sBAAY,QAAQ,QAAM,eAAe,YAAY,EAAE,CAAC;AACxD,iBAAO,EAAE,MAAM;QAClB,SACMH,IAAG;AACN,kBAAQ,MAAM,gCAAgCA,GAAE,KAAK;AACrD,iBAAO;AAAA,QACV;AAAA,MACb;AACQ,UAAI,QAAQ,OAAO,QAAQ,MAAM,EAC5B,QAAQ,CAAC,CAAC,IAAI,IAAI,MAAM,KAAK,IAAI,CAAC,KAAKG,OAAM,UAAU,KAAKA,EAAC,CAAC,CAAC,EAC/D,OAAO,SAAO,QAAQ,MAAS;AAGpC,UAAI,YAAY,MAAM;AAClB,YAAI,UAAU,cAAc;AAC5B,YAAIF,KAAI,QAAQ,OAAO,OAAO,UAAU,UAAU;AAClD,YAAIuE,KAAI,QAAQ,MAAM,OAAO,UAAU,UAAU;AACjD,eAAO,CAACvE,IAAGuE,EAAC;AAAA,MACxB;AACQ,UAAI,yBAAyB,CAACvE,IAAGuE,OAAM;AACnC,cAAM,QAAQ,CAAC,EAAE,KAAM,MAAK,KAAK,SAAQ,CAAE;AAC3C,uBAAe,MAAM,YAAY,cAAcvE,EAAC,QAAQuE,EAAC;AAAA,MACrE;AACQ,UAAI,aAAa;AACjB,6BAAuB,GAAG,UAAU;AACpC,UAAI,WAAW,YAAY,MAAM;AAC7B,YAAI,YAAY;AAChB,YAAI,UAAU,CAAC,MAAM,WAAW,CAAC,KAAK,UAAU,CAAC,MAAM,WAAW,CAAC,GAAG;AAClE,iCAAuB,GAAG,SAAS;AAAA,QACtC;AACD,qBAAa;AAAA,MAChB,GAAE,GAAG;AACN,aAAO,MAAM;AACT,sBAAc,QAAQ;AACtB,cAAM,QAAQ,CAAC,EAAE,kBAAkB;AAC/B,sBAAY,QAAQ,QAAM;AACtB,eAAG,WAAW,YAAY,EAAE;AAAA,UAChD,CAAiB;AAAA,QACjB,CAAa;AAAA,MACb;AAAA,IACA,CAAK;AAAA,EAGL;AACA,MAAI,WAAW,CAAC,EAAE,MAAM,OAAApE,QAAO,aAAY,MAAO;AAC9C,QAAI,mBAAmBkO,oBAAO,IAAI;AAClC,QAAI,oBAAoBA,oBAAO,IAAI;AACnC,QAAI,QAAQJ,wBAAW,YAAY;AACnC,iBAAa,cAAc,kBAAkB,iBAAiB;AAC9D,WAAQ,MAAM;AAAA,MAAc;AAAA,MAAO,EAAE,WAAW,OAAQ;AAAA,MACpD,MAAM;AAAA,QAAc;AAAA,QAAO,EAAE,WAAW,cAAe;AAAA,QACnD,MAAM,cAAc,gBAAgB,EAAE,OAAO9N,QAAO,MAAM,UAAU,QAAW;AAAA,QAC/E,UAAU,SAAa,MAAM;AAAA,UAAc;AAAA,UAAQ,EAAE,WAAW,qBAAsB;AAAA,UAClF;AAAA,UACA;AAAA,UACA,MAAM,SAAS,wBAAyB,MAAM,cAAc,MAAM,UAAU,MAAM,yCAAyC,IAAM,MAAM;AAAA,QAAM,IAAK;AAAA,MAAI;AAAA,MAC9J,MAAM;AAAA,QAAc;AAAA,QAAO,EAAE,WAAW,oBAAoB,KAAK,iBAAkB;AAAA,QAC/E,MAAM,cAAc,OAAO,EAAE,WAAW,mBAAmB,KAAK,mBAAmB;AAAA,QACnF,MAAM;AAAA,UAAc;AAAA,UAAO,EAAE,WAAW,wBAAyB;AAAA,UAC7D,MAAM,cAAc,WAAW,EAAE,OAAO,KAAK,OAAO;AAAA,UACpD,KAAK,KAAK,UAAU,SAAS,IAAK,MAAM,cAAc,UAAU,EAAE,MAAM,KAAK,KAAM,CAAA,IAAK;AAAA,QAAI;AAAA,MAAC;AAAA,IAAC;AAAA,EAC9G;AACA,MAAI,kBAAkB,CAAC,EAAE,OAAO,aAAa;AACzC,QAAI,MAAMkO,oBAAO,IAAI;AACrB,QAAI,CAAC,eAAe,gBAAgB,IAAI3C,aAAQ,UAAC,iCAAQ,kBAAiB,KAAK;AAC/E,QAAI,CAAC,eAAe,gBAAgB,IAAIA,aAAQ,SAAC,KAAK;AACtD,QAAI,iBAAgB,iCAAQ,cACtB,QACA;AACN,WAAQ,MAAM;AAAA,MAAc,cAAc;AAAA,MAAU,EAAE,OAAO,EAAE,GAAG,QAAQ,gBAAgC;AAAA,MACtG,MAAM;AAAA,QAAc;AAAA,QAAO,EAAE,KAAU,WAAW,eAAe,OAAO,EAAE,cAAa,GAAI,cAAc,MAAM,iBAAiB,IAAI,GAAG,cAAc,MAAM,iBAAiB,KAAK,EAAG;AAAA,QAChL,MAAM;AAAA,UAAc;AAAA,UAAU,EAAE,MAAM,UAAU,WAAW,WAAW,kBAAkB,EAAE,QAAQ,cAAa,CAAE,GAAG,SAAS,MAAM,iBAAiB,CAAC,aAAa,GAAG,OAAO,EAAE,SAAS,gBAAgB,MAAM,MAAO;AAAA,UAChN,MAAM,cAAc,KAAK,EAAE,WAAW,mBAAoB,CAAA;AAAA,QAAC;AAAA,QAC/D,MAAM,MAAM,IAAI,CAAC,MAAMxL,OAAM;AACzB,cAAI,QAAQA,OAAM,MAAM,MAAM,SAAS,KAAK,MAAM,OAAO,SAAS,UAC5D,MAAM,OAAO,QACb;AACN,iBAAQ,MAAM;AAAA,YAAc,aAAa;AAAA,YAAU,EAAE,KAAKA,IAAG,OAAO,MAAO;AAAA,YACvE,MAAM,cAAc,UAAU,EAAE,OAAOA,IAAG,MAAY,cAAc,IAAG,CAAE;AAAA,UAAC;AAAA,QACjF,CAAA;AAAA,MAAC;AAAA,IAAC;AAAA,EACf;AACA,MAAI,cAAc,CAAC,MAAM,OAAO,UAAU;AACtC,QAAI,WAAW,CAAC,GAAG,KAAK,EAAE,QAAO;AACjC,QAAI,eAAe,MAAM,IAAI,SAAO;AAChC,UAAI,aAAa,SAAS,UAAU,UAAQ;AACxC,YAAI,QAAQ,EAAE,KAAK,KAAK,MAAM,MAAM;AACpC,YAAI,cAAc,kBAAkB,MAAM,UAAU,OAAO,KAAK,MAAM,GAAG,KAAK,OAC1E,OAAO,kBAAkB,MAAM,UAAU,KAAK,KAAK,MAAM,GAAG;AAChE,YAAI,eAAe,MAAM,kBAAkB,MAAM,SAAS,OAAO,KAAK,MAAM,GAAG;AAC/E,eAAO,eAAe;AAAA,MAClC,CAAS;AACD,UAAI,eAAe;AACf,cAAM,IAAI,MAAM,kCAAkC,KAAK,UAAU,KAAK,QAAW,CAAC,CAAC,EAAE;AACzF,aAAO,CAAC,MAAM,SAAS,YAAY,KAAK,SAAS,UAAU,CAAC;AAAA,IACpE,CAAK;AACD,QAAI,cAAc,EAAE,OAAO,cAAc,CAAC,CAAC,GAAG,MAAM,GAAG;AACvD,WAAO;AAAA,MACH,YAAY,IAAI,CAAC,CAAC,UAAU,IAAI,MAAM,IAAI;AAAA,MAC1C,YAAY,IAAI,CAAC,CAAC,UAAU,OAAO,IAAI,MAAM,IAAI;AAAA,IACzD;AAAA,EACA;AACA,MAAI,iBAAiB,CAAC,EAAE,OAAAC,QAAO,WAAW;AACtC,WAAQ,MAAM;AAAA,MAAc;AAAA,MAAQ,EAAE,WAAW,WAAW,eAAe,EAAE,KAAI,CAAE,EAAG;AAAA,MAClF,MAAM;AAAA,QAAc;AAAA,QAAQ;AAAA,QACxB;AAAA,QACAA,SAAQ;AAAA,MAAC;AAAA,IAAC;AAAA,EACtB;AAAA,EACA,MAAM,yBAAyB,WAAW;AAAA,IAGtC,YAAYA,QAAO,MAAM;AACrB;AAHJ;AACA;AAGI,WAAK,QAAQA;AACb,WAAK,OAAO;AAAA,IACf;AAAA,IACD,QAAQ;AACJ,UAAI,YAAY,SAAS,cAAc,MAAM;AAC7CwL,aAAS,WAAW,SAAS,EAAE,OAAO,MAAM,cAAc,gBAAgB,EAAE,OAAO,KAAK,OAAO,MAAM,KAAK,KAAM,CAAA,CAAC;AACjH,aAAO;AAAA,IACV;AAAA,EACL;AACO,MAAI,cAAc,oBAAmB;AACrC,WAAS,kBAAkB,MAAM,WAAW,OAAO,QAAQ,aAAa;AAC3E,QAAI,OAAOA,OAAS,WAAW,SAAS;AACxC,QAAI,SAAQ,2CAAa,oBAAmB;AAC5C,QAAI;AACJ,QAAI,MAAM,SAAS,GAAG;AAClB,UAAI,CAAC,aAAa,aAAa,IAAI,YAAY,MAAM,MAAM,OAAO,KAAK;AACvE,qBAAe;AACf,YAAM,QAAQ;AAAA,IACjB,OACI;AACD,qBAAe,MAAM,MAAM,IAAI,UAAQ,kBAAkB,EAAE,KAAK,KAAK,MAAM,MAAM,EAAE,SAAS,KAAK,KAAK,MAAM,GAAG,CAAC;AAAA,IACnH;AACD,QAAI,QAAQ,aAAa,IAAI,CAAC,MAAMzL,OAAM,WAAW,OAAO;AAAA,MACxD,QAAQ,IAAI,iBAAiBA,IAAGA,OAAM,MAAM,MAAM,SAAS,KAAK,MAAM,OAAO,SAAS,OAAO;AAAA,IACrG,CAAK,EAAE,MAAM,IAAI,CAAC;AACd,SAAK,SAAS;AAAA,MACV,SAAS,CAAC,YAAY,UAAU,GAAG,KAAK,CAAC;AAAA,IACjD,CAAK;AACD,SAAK,OAAO,MAAM;AAAA,MAAc8N,cAAY;AAAA,MAAU,EAAE,OAAO,KAAM;AAAA,MACjE,MAAM,cAAc,iBAAiB,EAAE,OAAc,QAAgB;AAAA,IAAC,CAAC;AAAA,EAC/E;AC1eA,MAAI,WAAW,CAAC,EAAE,MAAM,YAAY;AAIhC,QAAI,WAAW,MAAM;AACjB,UAAI,OAAO,SAAS,KAAK,IAAI;AAC7B,UAAI,OAAO,CAAC,EAAE,SAAU,MAAM,MAAM,cAAc,QAAQ,EAAE,WAAW,WAAW,QAAQ,IAAI,EAAC,GAAI,QAAQ;AAC3G,UAAI,KAAK,KAAK,SAAS,QAAQ;AAC3B,eAAO,KAAK,KAAK,QAAS,MAAM;AAAA,UAAc;AAAA,UAAO,EAAE,WAAW,qBAAqB,OAAO,YAAY,IAAI,kFAAmF;AAAA,UAC7L,MAAM,cAAc,MAAM,MAAM,KAAK,IAAI;AAAA,QAAC,IAAM,MAAM;AAAA,UAAc;AAAA,UAAO,EAAE,WAAW,kBAAkB,OAAO,qBAAqB,IAAI,kFAAmF;AAAA,UAC7N,MAAM,cAAc,MAAM,MAAM,GAAQ;AAAA,QAAC;AAAA,MAChD,WACQ,KAAK,KAAK,SAAS,OAAO;AAC/B,eAAQ,MAAM;AAAA,UAAc;AAAA,UAAO,EAAE,WAAW,2BAA2B,OAAO,YAAY,IAAI,uEAAwE;AAAA,UACtK,MAAM,cAAc,OAAO,EAAE,WAAW,gBAAe,CAAE;AAAA,UACzD,MAAM,cAAc,MAAM,MAAM,KAAK,IAAI;AAAA,QAAC;AAAA,MACjD,OACI;AACD,eAAQ,MAAM;AAAA,UAAc;AAAA,UAAO,EAAE,OAAO,qBAAqB,IAAI,yEAA0E;AAAA,UAC3I,MAAM,cAAc,QAAQ,EAAE,WAAW,gBAAiB,GAAE,GAAG;AAAA,UAC/D,MAAM,cAAc,MAAM,MAAM,KAAK,IAAI;AAAA,QAAC;AAAA,MACjD;AAAA,IACT;AACI,WAAQ,MAAM,cAAc,MAAM,EAAE,cAAc,MAAM;AAChD,qBAAe,OAAO,KAAK,SAAS,CAAC,SAAS,KAAK,IAAI,CAAC,CAAC;AACzD,qBAAe,OAAO,KAAK,SAAS,CAAC,SAAS,KAAK,IAAI,CAAC,CAAC;AAAA,IAC5D,GAAE,cAAc,MAAM;AACnB,qBAAe,OAAO,KAAK,SAAS,CAAC,SAAS,KAAK,IAAI,CAAC,CAAC;AACzD,qBAAe,OAAO,KAAK,SAAS,CAAC,SAAS,KAAK,IAAI,CAAC,CAAC;AAAA,IAC5D,GAAE,WAAW,eAAe,SAAU,CAAA;AAAA,EAC/C;AACA,MAAI,cAAc,CAAC,EAAE,MAAM,OAAO,MAAK,MAAO;AAM1C,QAAI,cAAc;AAAA,MACd;AAAA,QACI,MAAM;AAAA,QACN,QAAQ;AAAA,UACJ;AAAA,YACI,OAAO,EAAE,MAAM,QAAQ,OAAO,EAAG;AAAA,YACjC,MAAM;AAAA,YACN,MAAM;AAAA,UACT;AAAA,UACD;AAAA,YACI,OAAO,EAAE,MAAM,MAAO;AAAA,YACtB,MAAM;AAAA,YACN,MAAM;AAAA,UACT;AAAA,QACJ;AAAA,MACJ;AAAA,MACD;AAAA,QACI,MAAM;AAAA,QACN,QAAQ;AAAA,UACJ;AAAA,YACI,OAAO,EAAE,MAAM,QAAQ,OAAO,EAAG;AAAA,YACjC,MAAM;AAAA,YACN,MAAM;AAAA,UACT;AAAA,UACD;AAAA,YACI,OAAO,EAAE,MAAM,MAAO;AAAA,YACtB,MAAM;AAAA,YACN,MAAM;AAAA,UACT;AAAA,QACJ;AAAA,MACJ;AAAA,MACD;AAAA,QACI,MAAM;AAAA,QACN,QAAQ;AAAA,UACJ;AAAA,YACI,OAAO,EAAE,MAAM,QAAQ,OAAO,EAAG;AAAA,YACjC,MAAM;AAAA,YACN,MAAM;AAAA,UACT;AAAA,UACD;AAAA,YACI,OAAO,EAAE,MAAM,MAAO;AAAA,YACtB,MAAM;AAAA,YACN,MAAM;AAAA,UACT;AAAA,QACJ;AAAA,MACJ;AAAA,MACD;AAAA,QACI,MAAM;AAAA,QACN,QAAQ;AAAA,UACJ;AAAA,YACI,OAAO,EAAE,MAAM,QAAQ,OAAO,EAAG;AAAA,YACjC,MAAM;AAAA,YACN,MAAM;AAAA,UACT;AAAA,UACD;AAAA,YACI,OAAO,EAAE,MAAM,MAAO;AAAA,YACtB,MAAM;AAAA,YACN,MAAM;AAAA,UACT;AAAA,QACJ;AAAA,MACJ;AAAA,MACD;AAAA,QACI,MAAM;AAAA,QACN,QAAQ;AAAA,UACJ;AAAA,YACI,OAAO,EAAE,MAAM,QAAQ,OAAO,EAAG;AAAA,YACjC,MAAM;AAAA,YACN,MAAM;AAAA,UACT;AAAA,UACD;AAAA,YACI,OAAO,EAAE,MAAM,MAAO;AAAA,YACtB,MAAM;AAAA,YACN,MAAM;AAAA,UACT;AAAA,QACJ;AAAA,MACJ;AAAA,IACT;AACI,QAAI,MAAM;AACV;AAAM,eAAS,EAAE,MAAM,OAAM,KAAM,aAAa;AAC5C,iBAAS,EAAE,OAAO,MAAM,KAAI,KAAM,QAAQ;AACtC,cAAI,EAAE,QAAQ,MAAM,IAAI,EAAE,MAAM,MAAM,IAAI,GAAG;AACzC,kBAAO,MAAM,cAAc,KAAK,EAAE,WAAW,SAAS,IAAI,+BAA+B,OAAO,KAAI,CAAE;AACtG,kBAAM;AAAA,UAIT;AAAA,QACJ;AAAA,MACJ;AACD,QAAI,SAAS,CAACtL,OAAMA,GAAE,SAAS,UAAUA,GAAE,SAAS,SAASA,GAAE,QAAQ;AACvE,QAAI,UAAU,OAAO,MAAM,UAAU;AACrC,QAAI,QAAQ;AAAA,MACR;AAAA,QACI,MAAM;AAAA,QACN,MAAM,MAAM,YAAY;AAAA,QACxB,SAAS,OAAO,MAAM,iBAAiB;AAAA,QACvC;AAAA,MACH;AAAA,MACD;AAAA,QACI,MAAM;AAAA,QACN,MAAM,MAAM,YAAY;AAAA,QACxB,SAAS,OAAO,MAAM,kBAAkB;AAAA,QACxC;AAAA,MACH;AAAA,MACD;AAAA,QACI,MAAM;AAAA,QACN,MAAM,MAAM,YAAY;AAAA,QACxB,SAAS,OAAO,MAAM,iBAAiB;AAAA,QACvC;AAAA,MACH;AAAA,IACT;AACI,QAAI,UAAU,MAAM,cAAc,MAAM,EAAE,WAAW,oBAAoB,IAAI;AAC7E,WAAQ,MAAM;AAAA,MAAc;AAAA,MAAM;AAAA,MAC9B;AAAA,MACA,MAAM,cAAc,MAAM,EAAE,WAAW,kBAAmB,GAAE,GAAG;AAAA,MAC/D,MAAM,IAAI,UAAS,MAAM,cAAc,UAAU,EAAE,KAAK,KAAK,MAAM,MAAY,MAAc,CAAA,CAAE;AAAA,IAAC;AAAA,EACxG;AACA,MAAI,eAAe,CAAC,SAAS;AACzB,WAAO,KAAK,SAAS;AAAA,EACzB;AACA,MAAI,YAAY,CAAC,EAAE,MAAM,MAAO,MAAM,MAAM;AAAA,IAAc;AAAA,IAAS,EAAE,WAAW,kBAAmB;AAAA,IAC/F,MAAM,cAAc,SAAS,MAAM,KAAK,IAAI,CAAC,CAAC,MAAM,KAAK,GAAGxC,OAAO,MAAM,cAAc,aAAa,EAAE,KAAKA,IAAG,MAAY,OAAc,MAAc,CAAA,CAAE,CAAC;AAAA,EAAC;AAG9J,MAAI,sBAAsB,CAAC,EAAE,SAAS,QAAQ,MAAK,MAAO;AACtD,QAAI,CAAC,YAAY,aAAa,IAAIwL,aAAQ,SAAC,KAAK;AAChD,QAAI,iBAAiB,OAAO,SAAS,IAAK,MAAM;AAAA,MAAc,MAAM;AAAA,MAAU;AAAA,MAC1E,MAAM,cAAc,OAAO,EAAE,WAAW,yCAA0C,GAAE,OAAsB;AAAA,MAC1G,MAAM;AAAA,QAAc;AAAA,QAAO,EAAE,WAAW,WAAW,EAAE,iBAAiB,CAAC,WAAU,CAAE,EAAG;AAAA,QAClF,MAAM,cAAc,WAAW,EAAE,MAAM,QAAQ,MAAc,CAAA;AAAA,MAAC;AAAA,IAAC,IAAK;AAC5E;AAAA;AAAA,MAEA,MAAM;AAAA,QAAc;AAAA,QAAO,EAAE,WAAW,WAAW,wBAAwB;AAAA,UACnE,mBAAmB,OAAO,SAAS;AAAA,QACtC,CAAA,GAAG,SAAS,MAAM,cAAc,CAAC,UAAU,EAAG;AAAA,QAC/C,MAAM,cAAc,WAAW,EAAE,MAAM,SAAS,OAAc;AAAA,QAC9D;AAAA,MAAc;AAAA;AAAA,EACtB;AAGA,MAAI,WAAW,CAAC,EAAE,QAAQ,cAAc,QAAQ,MAAM,YAAY;AAC9D,QAAI,CAAC,SAAS,UAAU,IAAIA,aAAQ,SAAC,IAAI;AACzC,QAAI,WAAW;AACf,QAAI,UAAU;AACd,QAAI,WAAW,OAAO,IAAI,CAAC,OAAOxL,OAAM;AACpC,UAAI,CAAC,cAAc,WAAW,IAAI,EAAE,UAAU,MAAM,OAAO,CAAC,CAAC,MAAMqC,EAAC,MAAM,CAAC,CAAC,KAAK,MAAM,YAAY,CAAC;AACpG,aAAQ,MAAM,cAAc,qBAAqB,EAAE,KAAKrC,IAAG,SAAS,cAAc,QAAQ,aAAa,MAAc,CAAA;AAAA,IAC7H,CAAK;AACD,WAAQ,MAAM;AAAA,MAAc;AAAA,MAAO,EAAE,WAAW,mBAAoB;AAAA,MAChE,MAAM,cAAc,QAAQ,EAAE,WAAW,sBAAsB,SAAS,MAAM,WAAW,CAAC,OAAO,EAAC,GAAI,UAAU,UAAU,QAAQ;AAAA,MAClI,MAAM;AAAA,QAAc;AAAA,QAAO,EAAE,WAAW,WAAW,yBAAyB;AAAA,UACpE,gBAAgB,CAAC;AAAA,QACjC,CAAa,EAAG;AAAA,QACJ,MAAM,cAAc,OAAO,EAAE,WAAW,qBAAsB,GAAE,MAAM;AAAA,QACtE;AAAA,MAAQ;AAAA,IAAC;AAAA,EACrB;AAAA,EACA,MAAM,iCAAiC,WAAW;AAAA,IAO9C,YAAY,MAAM,MAAM,OAAO,aAAa;AACxC;AAPJ;AACA;AACA;AACA;AACA;AACA;AAGI,WAAK,OAAO;AACZ,WAAK,OAAO;AACZ,WAAK,QAAQ;AACb,WAAK,cAAc;AACnB,WAAK,OAAO,KAAK,MAAM,IAAI,OAAO,kBAAkB,aAAa,IAAI,GAAG,KAAK,MAAM,GAAG,CAAC;AAAA,IAC1F;AAAA,IACD,GAAG,OAAO;AAEN,aAAO,KAAK,KAAK,WAAW,MAAM,KAAK;AAAA,IAC1C;AAAA,IACD,QAAQ;;AACJ,UAAI,YAAY,SAAS,cAAc,MAAM;AAC7C,UAAIyD,OAAM,KAAK,KAAK,MAAM;AAC1B,UAAI,WAAW,KAAK;AACpB,UAAI,cAAc,KAAK,eAAe,KAAK,YAAY,cAAc,SAAS,IACxE,KAAK,YAAY,cAAc,SAAS,SAAS,MAAM,IACvD;AACN,UAAI,aAAa;AACjB,eAAS,QAAQA,KAAI,aAAa;AAC9B,qBAAa,KAAK,IAAI,YAAY,KAAK,MAAM;AAAA,MAChD;AACD,UAAI,UAAU,IAAI,aAAa,SAAS;AACxC,UAAI,SAAS,IAAI,OAAO,OAAO;AAC/B,UAAI,YAAWvC,MAAA,KAAK,gBAAL,gBAAAA,IAAkB,cAAc,SAAS;AACxD,UAAI,KAAK,qCACH,IAAI,aAAW,QAAQ,SAAS,YAChC,EAAE,aAAa,QAAQ,KAAK,IAC5B,QAAQ,OACT,IAAI,CAAAV,OAAK,IAAIA,EAAC,KACd,KAAK;AACV,UAAIW,KAAI,IAAI,OAAO,MAAM,OAAO;AAChC,UAAI,SAAS,KAAK,KAAK;AACvBsK,aAAS,WAAW,SAAS,EAAE,OAAO,MAAM,cAAc,UAAU,EAAE,QAAgB,cAActK,IAAG,QAAgB,MAAM,aAAa,OAAO,KAAK,MAAO,CAAA,CAAC;AAC9J,aAAO;AAAA,IACV;AAAA,IACD,cAAc;AACV,aAAO;AAAA,IACV;AAAA,EACL;AACO,MAAI,YAAY,oBAAmB;AACnC,WAAS,oBAAoB,MAAM,OAAO,YAAY,aAAa;AACtE,WAAO,WAAW,IAAI,UAAQ,WAAW,OAAO;AAAA,MAC5C,QAAQ,IAAI,yBAAyB,MAAM,MAAM,OAAO,WAAW;AAAA,MACnE,MAAM;AAAA,IACd,CAAK,EAAE,MAAM,kBAAkB,aAAa,IAAI,GAAG,KAAK,MAAM,GAAG,CAAC,CAAC;AAAA,EACnE;ACzPO,WAAS,2BAA2B,MAAM,SAAS,aAAa;AACnE,QAAI,YAAY,CAAA;AAChB,QAAI,gBAAgB,CAAA;AACpB,QAAI,cAAc,CAAA;AAClB,YAAQ,QAAQ,SAAO;AACnB,UAAI,CAAC,OAAO,WAAW,IAAI,gCAAgC,GAAG;AAC9D,UAAI,KAAK,wBAAwB,MAAM,OAAO,IAAI,YAAY,2CAAa,UAAU;AACrF,UAAI,KAAK,oBAAoB,MAAM,OAAO,IAAI,OAAO,2CAAa,OAAO;AACzE,oBAAc,KAAK,EAAE;AACrB,gBAAU,KAAK,EAAE;AACjB,kBAAY,KAAK,WAAW;AAAA,IACpC,CAAK;AACD,WAAO;AAAA,MACH,SAAS,UAAU,KAAM;AAAA,MACzB,YAAY,EAAE,OAAO,cAAc,KAAI,GAAI,CAAAE,OAAKA,GAAE,IAAI;AAAA,MACtD,OAAO,YAAY,KAAM;AAAA,IACjC;AAAA,EACA;AACO,WAAS,kBAAkB,MAAMwD,cAAa,KAAK;AACtD,YAAQ,MAAM,8BAA8B,GAAG;AAC/C,QAAIA,iBAAgB,QAAW;AAC3B,UAAI,WAAW,OAAO,2BAAK,OAAO,MAAM;AACxC,UAAI,gBAAgB,OAAO,2BAAK,UAAU,MAAM;AAChD,WAAK,SAAS;AAAA,QACV,SAAS;AAAA,UACL,mBAAmB,GAAGA,aAAY,KAAK;AAAA,UACvC,UAAU,UAAU,GAAG,WAAWA,aAAY,UAAU,EAAE;AAAA,UAC1D,gBAAgB,UAAU,GAAG,gBAAgBA,aAAY,aAAa,EAAE;AAAA,QAC3E;AAAA,MACb,CAAS;AAAA,IACJ;AAAA,EACL;;ACrBA,QAAM,qBAAqB,IAAI,IAAI,uBAAuB;AACnD,QAAM,qBAAqB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOhC,KAAI;AACN,MAAI,WAAW,IAAI;AACnB,MAAI,iBAAiB,IAAI;AACzB,MAAI,aAAa,CAAC,EAAE,WAAY,MAAM;AAAA,IAAc;AAAA,IAAU,EAAE,MAAM,UAAU,WAAW,aAAa,SAAS,MAAM;AAC/G,UAAI,WAAW,KAAK,MAAM,IAAI,SAAS,KAAK,IAAI;AAChD,gBAAU,UAAU,UAAU,QAAQ;AAAA,IAC9C,EAAO;AAAA,IACH,MAAM,cAAc,KAAK,EAAE,WAAW,aAAY,CAAE;AAAA,EAAC;AACzD,MAAI,aAAa,CAAC,EAAE,gBAAgB;AAChC,QAAI,CAAC,QAAQ,SAAS,IAAI2G,aAAQ,SAAC,IAAI;AACvCyC,iBAAAA,UAAU,MAAM;AACZ,UAAI,CAAC;AACD,kBAAU,UAAU,IAAI,aAAa;AAAA;AAErC,kBAAU,UAAU,OAAO,aAAa;AAAA,IACpD,GAAO,CAAC,MAAM,CAAC;AACX;AAAA;AAAA,MAEA,MAAM;AAAA,QAAc;AAAA,QAAU,EAAE,WAAW,aAAa,SAAS,MAAM,UAAU,CAAC,MAAM,EAAG;AAAA,QACvF,MAAM,cAAc,KAAK,EAAE,WAAW,MAAM,SAAS,WAAW,cAAc,GAAE,CAAE;AAAA,MAAC;AAAA;AAAA,EAC3F;AACA,MAAI,0BAA0B,WAAW,eAAe,GAAG,CAAC,QAAQ;AAChE,QAAI,IAAI,YAAY;AAChB,UAAI,KAAK,SAAS;AAAA,QACd,SAAS;AAAA,UACL,gBAAgB,UAAU,GAAG,EAAE;AAAA,UAC/B,UAAU,UAAU,GAAG,EAAE;AAAA,UACzB,YAAY,UAAU,GAAG,EAAE;AAAA,QAC9B;AAAA,MACb,CAAS;AAAA,IACJ;AAAA,EACL,CAAC;AAAA,EACM,MAAM,OAAO;AAAA,IAchB,YAAY,KAAKG,QAAO7K,QAAO,oBAAoB,eAAe,SAAO;AACrE,cAAQ,MAAM,qBAAqB;AACnC,cAAQ,MAAM,GAAG;AAAA,IACzB,GAAO,YAAY,oBAAoB,aAAa,OAAO,iBAAiB,+BAA+B,aAAa,IAAI;AAhBxH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wCAAa;AAKT,WAAK,QAAQ6K;AACb,WAAK,eAAe;AACpB,WAAK,YAAY;AACjB,WAAK,aAAa;AAClB,WAAK,iBAAiB;AACtB,WAAK,aAAa;AAClB,WAAK,UAAU,IAAI,IAAI,UAAU;AACjC,UAAI,eAAe,YAAY,OAAO;AAAA,QAClC,KAAK7K;AAAA,QACL,YAAY;AAAA,UACR,eAAe,GAAG6K,MAAK;AAAA,UACvB,SAAS,GAAG,YAAY,SAAS,GAAG,UAAU,CAAC;AAAA,UAC/C,WAAW,SAAS,GAAG,CAAC,UAAU;AAAA,UAClC;AAAA,UACAA;AAAA,UACA,KAAM;AAAA,UACN,WAAW,GAAG,IAAI;AAAA,UAClB;AAAA,UACA;AAAA,UACA,gBAAgB;AAAA,UAChB,UAAU;AAAA,UACV,YAAY;AAAA,QACf;AAAA,MACb,CAAS;AACD,WAAK,kBAAkB,SAAS,cAAc,KAAK;AACnD,WAAK,OAAO,IAAI,WAAW;AAAA,QACvB,OAAO;AAAA,QACP,QAAQ,KAAK;AAAA,MACzB,CAAS;AACD,UAAI,kBAAkB,SAAS,cAAc,KAAK;AAClD,WAAK,gBAAgB3C,OAAS,WAAW,eAAe;AACxD,WAAK,WAAU;AACf,WAAK,gBAAgB,YAAY,eAAe;AAChD,WAAK,uBAAuB,SAAS,cAAc,KAAK;AACxD,UAAI,YAAY,KAAK,eAAe;AACpC,UAAI,YAAY,KAAK,oBAAoB;AAAA,IAC5C;AAAA,IACD,aAAa;AACT,WAAK,cAAc,OAAO,MAAM;AAAA,QAAc;AAAA,QAAO,EAAE,WAAW,iBAAkB;AAAA,QAChF,MAAM,cAAc,OAAO,EAAE,WAAW,eAAe,MAAM,KAAK,KAAK,OAAO,EAAE,IAAI,CAAC,QAAQzL,OAAM,WAAW,SAAU,MAAM,cAAc,YAAY,EAAE,KAAKA,IAAG,MAAM,KAAK,KAAM,CAAA,IAAK,WAAW,QAAS,MAAM,cAAc,YAAY,EAAE,KAAKA,IAAG,WAAW,KAAK,gBAAiB,CAAA,IAAK,IAAI,CAAC;AAAA,QACjS,KAAK,aAAc,MAAM,cAAc,OAAO;AAAA;AAAA,UAE1C,yBAAyB,EAAE,QAAQ,KAAK,eAAc;AAAA,SAAI,IAAK;AAAA,MAAI,CAAC;AAAA,IAC/E;AAAA,IACD,iBAAiB;AACb,aAAO,KAAK,KAAK,MAAM,IAAI,SAAQ;AAAA,IACtC;AAAA,IACD,YAAY,YAAY;AACpB,WAAK,KAAK,SAAS;AAAA,QACf,SAAS,CAAC,eAAe,YAAY,CAAC,GAAG,YAAY,KAAK,KAAK,CAAC,CAAC;AAAA,MAC7E,CAAS;AAAA,IACJ;AAAA,IACD,gBAAgBkC,IAAG;AACf,WAAK,KAAK,SAAS;AAAA,QACf,SAAS,CAACA,GAAE,WAAW,GAAG,CAAE,CAAA,CAAC;AAAA,MACzC,CAAS;AAAA,IACJ;AAAA,IACD,oBAAoBA,IAAG,kBAAkB,OAAO;AAC5C,UAAI,aAAa,iBAAiB,IAAI,CAAAM,OAAKN,GAAE,WAAWM,IAAG,KAAK,CAAC;AACjE,WAAK,KAAK,SAAS;AAAA,QACf,SAAS,CAACN,GAAE,WAAW,GAAG,UAAU,CAAC;AAAA,MACjD,CAAS;AAAA,IACJ;AAAA,IACD,MAAM,kBAAkB,KAAK;AAIzB,YAAM,KAAK,gBAAgB,eAAe;AAAA,QACtC,QAAQ;AAAA,MACpB,CAAS;AAED,wBAAkB,KAAK,MAAM,KAAK,kBAAkB,GAAG;AAAA,IAC1D;AAAA,IACD,UAAU;AACN,WAAK,KAAK;IACb;AAAA;AAAA,IAED,MAAM,oBAAoB,UAAU,QAAQ;AACxC,UAAI,WAAW,KAAK;AACpB,UAAI,cAAc,IAAI,IAAI,UAAU,KAAK,SAAS;AAClD,UAAI,oBAAoB,MAAM,MAAM,aAAa;AAAA,QAC7C,QAAQ;AAAA,QACR,SAAS;AAAA,UACL,gBAAgB;AAAA,QACnB;AAAA,QACD,MAAM,KAAK,UAAU;AAAA,UACjB,MAAM;AAAA,UACN;AAAA,QAChB,CAAa;AAAA,MACb,CAAS;AACD,UAAI,iBAAiB,MAAM,kBAAkB;AAC7C,aAAO;AAAA,IACV;AAAA,IACD,kBAAkB,OAAO,QAAQ,aAAa;AAC1C,UAAI,iCAAQ,UAAU;AAClB,aAAK,KAAK;AACV,aAAK,cAAc;MACtB;AACD,wBAAkB,KAAK,MAAM,KAAK,sBAAsB,OAAO,QAAQ,WAAW;AAAA,IACrF;AAAA,IACD,MAAM,gBAAgB,WAAW,EAAE,UAAU,QAAQ,YAAa,IAAG,IAAI;AACrE,cAAQ,MAAM,wBAAwB,SAAS,EAAE;AACjD,UAAI,CAAC,UAAU;AACX,YAAI,iBAAiB,MAAM,KAAK,oBAAoB,WAAW,MAAM;AACrE,YAAI,eAAe,SAAS;AACxB,qBAAW,KAAK,MAAM,eAAe,MAAM;AAC3C,eAAK,aAAa;AAAA,YACd,MAAM;AAAA,YACN,OAAO,eAAe;AAAA,UAC1C,CAAiB;AAAA,QACJ,OACI;AACD,iBAAO,KAAK,aAAa;AAAA,YACrB,MAAM;AAAA,YACN,OAAO,eAAe;AAAA,UAC1C,CAAiB;AAAA,QACJ;AAAA,MACJ;AACD,WAAI,2CAAa,iBAAgB,YAAY,aAAa,SAAS,GAAG;AAClE,aAAK,KAAK,SAAS;AAAA,UACf,SAAS,YAAY,aAAa,IAAI,UAAQ,SAAS,GAAG,EAAE,KAAI,CAAE,CAAC;AAAA,QACnF,CAAa;AACD,aAAK,QAAQ,IAAI,KAAK;AAAA,MACzB;AACD,UAAI,iCAAQ,YAAY;AACpB,aAAK,aAAa;AAAA,MACrB;AACD,WAAK,WAAU;AACf,UAAI,cAAc,eAAe;AAC7B,YAAI,QAAQ,UAAU;AAClB,eAAK,kBAAkB,SAAS,IAAI,QAAQ,2CAAa,MAAM;AAAA,QAClE,OACI;AACD,eAAK,aAAa,SAAS,GAAG;AAAA,QACjC;AAAA,MACJ,WACQ,cAAc,eAAe;AAclC,YAAI,OAAO;AACX,YAAI,UAAU,CAAA;AACd,mBAAW,OAAO,MAAM;AACpB,cAAI,QAAQ,KAAK;AACb,oBAAQ,KAAK,IAAI,EAAE;AAAA,UACtB,OACI;AACD,iBAAK,aAAa,IAAI,GAAG;AAAA,UAC5B;AAAA,QACJ;AACD,aAAK,mBAAmB,2BAA2B,KAAK,MAAM,SAAS,WAAW;AAClF,0BAAkB,KAAK,MAAM,KAAK,kBAAkB,MAAM;AAAA,MAC7D;AAAA,IACJ;AAAA,EACL;AC5OA,WAAS,EAAEY,IAAE;AAAC,WAAOA,GAAE,MAAM,GAAG,EAAE,CAAC;AAAA,EAAC;AAAC,WAAS,EAAEA,IAAE;AAAC,WAAM,QAAMA,KAAE,WAAS;AAAA,EAAO;AAAC,WAAS3C,IAAE2C,IAAE;AAAC,WAAOA,GAAE,MAAM,GAAG,EAAE,CAAC;AAAA,EAAC;AAAC,WAASwF,IAAExF,IAAE;AAAC,WAAM,CAAC,OAAM,QAAQ,EAAE,SAAS3C,IAAE2C,EAAC,CAAC,IAAE,MAAI;AAAA,EAAG;AAAC,WAAS9C,IAAEA,IAAEmB,IAAExB,IAAE;AAAC,QAAG,EAAC,WAAU0D,IAAE,UAAS7C,GAAC,IAAER;AAAE,UAAME,KAAEmD,GAAE,IAAEA,GAAE,QAAM,IAAE7C,GAAE,QAAM,GAAE0B,KAAEmB,GAAE,IAAEA,GAAE,SAAO,IAAE7C,GAAE,SAAO,GAAEyC,KAAEqF,IAAEnH,EAAC,GAAE0K,KAAE,EAAE5I,EAAC,GAAE,IAAEI,GAAEwI,EAAC,IAAE,IAAErL,GAAEqL,EAAC,IAAE,GAAExK,KAAE,QAAM4B;AAAE,QAAI7B;AAAE,YAAOjB,IAAEgB,EAAC;MAAG,KAAI;AAAM,QAAAC,KAAE,EAAC,GAAElB,IAAE,GAAEmD,GAAE,IAAE7C,GAAE,OAAM;AAAE;AAAA,MAAM,KAAI;AAAS,QAAAY,KAAE,EAAC,GAAElB,IAAE,GAAEmD,GAAE,IAAEA,GAAE,OAAM;AAAE;AAAA,MAAM,KAAI;AAAQ,QAAAjC,KAAE,EAAC,GAAEiC,GAAE,IAAEA,GAAE,OAAM,GAAEnB,GAAC;AAAE;AAAA,MAAM,KAAI;AAAO,QAAAd,KAAE,EAAC,GAAEiC,GAAE,IAAE7C,GAAE,OAAM,GAAE0B,GAAC;AAAE;AAAA,MAAM;AAAQ,QAAAd,KAAE,EAAC,GAAEiC,GAAE,GAAE,GAAEA,GAAE,EAAC;AAAA,IAAC;AAAC,YAAO,EAAElC,EAAC;MAAG,KAAI;AAAQ,QAAAC,GAAE6B,EAAC,KAAG,KAAGtD,MAAG0B,KAAE,KAAG;AAAG;AAAA,MAAM,KAAI;AAAM,QAAAD,GAAE6B,EAAC,KAAG,KAAGtD,MAAG0B,KAAE,KAAG;AAAA,IAAE;AAAC,WAAOD;AAAA,EAAC;AAAC,QAAMD,MAAE,OAAM2B,IAAEjD,IAAEM,OAAI;AAAC,UAAK,EAAC,WAAUmI,KAAE,UAAS,UAASnH,KAAE,YAAW,YAAWxB,KAAE,CAAA,GAAG,UAAS0D,GAAC,IAAElD,IAAEK,KAAEb,GAAE,OAAO,OAAO,GAAEO,KAAE,OAAM,QAAMmD,GAAE,QAAM,SAAOA,GAAE,MAAMxD,EAAC;AAAG,QAAIqC,KAAE,MAAMmB,GAAE,gBAAgB,EAAC,WAAUP,IAAE,UAASjD,IAAE,UAASsB,GAAC,CAAC,GAAE,EAAC,GAAE8B,IAAE,GAAE4I,GAAC,IAAE7L,IAAEkC,IAAEoG,IAAEpI,EAAC,GAAE,IAAEoI,IAAEjH,KAAE,CAAE,GAACD,KAAE;AAAE,aAAQjB,KAAE,GAAEA,KAAEK,GAAE,QAAOL,MAAI;AAAC,YAAK,EAAC,MAAKR,IAAE,IAAGwD,GAAC,IAAE3C,GAAEL,EAAC,GAAE,EAAC,GAAEkE,IAAE,GAAEvE,IAAE,MAAK+C,IAAE,OAAML,GAAC,IAAE,MAAMW,GAAE,EAAC,GAAEF,IAAE,GAAE4I,IAAE,kBAAiBvD,IAAE,WAAU,GAAE,UAASnH,IAAE,gBAAeE,IAAE,OAAMa,IAAE,UAASmB,IAAE,UAAS,EAAC,WAAUP,IAAE,UAASjD,GAAC,EAAC,CAAC;AAAE,MAAAoD,KAAE,QAAMoB,KAAEA,KAAEpB,IAAE4I,KAAE,QAAM/L,KAAEA,KAAE+L,IAAExK,KAAE,EAAC,GAAGA,IAAE,CAAC1B,EAAC,GAAE,EAAC,GAAG0B,GAAE1B,EAAC,GAAE,GAAGkD,GAAC,EAAC,GAAEL,MAAGpB,MAAG,OAAKA,MAAI,YAAU,OAAOoB,OAAIA,GAAE,cAAY,IAAEA,GAAE,YAAWA,GAAE,UAAQN,KAAE,SAAKM,GAAE,QAAM,MAAMa,GAAE,gBAAgB,EAAC,WAAUP,IAAE,UAASjD,IAAE,UAASsB,GAAC,CAAC,IAAEqB,GAAE,QAAQ,EAAC,GAAES,IAAE,GAAE4I,GAAC,IAAE7L,IAAEkC,IAAE,GAAEhC,EAAC,IAAIC,KAAE;AAAA,IAAG;AAAC,WAAM,EAAC,GAAE8C,IAAE,GAAE4I,IAAE,WAAU,GAAE,UAAS1K,IAAE,gBAAeE,GAAC;AAAA,EAAC;AAAsL,WAASb,IAAEsC,IAAE;AAAC,WAAM,EAAC,GAAGA,IAAE,KAAIA,GAAE,GAAE,MAAKA,GAAE,GAAE,OAAMA,GAAE,IAAEA,GAAE,OAAM,QAAOA,GAAE,IAAEA,GAAE,OAAM;AAAA,EAAC;AAA8lC,QAAqvBzB,MAAE,CAAC,OAAM,SAAQ,UAAS,MAAM;AAAIA,MAAE,OAAQ,CAACyB,IAAEjD,OAAIiD,GAAE,OAAOjD,IAAEA,KAAE,UAASA,KAAE,MAAM,GAAG,CAAA,CAAE;ACAr2G,WAAS,EAAEiD,IAAE;AAAC,QAAIjD;AAAE,YAAO,QAAMiD,MAAG,SAAOjD,KAAEiD,GAAE,iBAAe,SAAOjD,GAAE,gBAAc;AAAA,EAAM;AAAC,WAAS,EAAEiD,IAAE;AAAC,WAAO,EAAEA,EAAC,EAAE,iBAAiBA,EAAC;AAAA,EAAC;AAAC,WAAS,EAAEA,IAAE;AAAC,WAAOA,cAAa,EAAEA,EAAC,EAAE;AAAA,EAAI;AAAC,WAAS,EAAEA,IAAE;AAAC,WAAO,EAAEA,EAAC,KAAGA,GAAE,YAAU,IAAI,gBAAc;AAAA,EAAW;AAAC,WAAS,EAAEA,IAAE;AAAC,WAAOA,cAAa,eAAaA,cAAa,EAAEA,EAAC,EAAE;AAAA,EAAW;AAAC,WAAS,EAAEA,IAAE;AAAC,WAAM,eAAa,OAAO,eAAaA,cAAa,EAAEA,EAAC,EAAE,cAAYA,cAAa;AAAA,EAAW;AAAC,WAAS,EAAEA,IAAE;AAAC,UAAK,EAAC,UAASjD,IAAE,WAAUM,IAAE,WAAUH,IAAE,SAAQmB,GAAC,IAAE,EAAE2B,EAAC;AAAE,WAAM,kCAAkC,KAAKjD,KAAEG,KAAEG,EAAC,KAAG,CAAC,CAAC,UAAS,UAAU,EAAE,SAASgB,EAAC;AAAA,EAAC;AAAC,WAAS,EAAE2B,IAAE;AAAC,WAAM,CAAC,SAAQ,MAAK,IAAI,EAAE,SAAS,EAAEA,EAAC,CAAC;AAAA,EAAC;AAAC,WAAS,EAAEA,IAAE;AAAC,UAAMjD,KAAE,KAAIM,KAAE,EAAE2C,EAAC;AAAE,WAAM,WAAS3C,GAAE,aAAW,WAASA,GAAE,eAAa,CAAC,CAACA,GAAE,iBAAe,aAAWA,GAAE,iBAAe,CAACN,MAAG,CAAC,CAACM,GAAE,kBAAgB,WAASA,GAAE,kBAAgB,CAACN,MAAG,CAAC,CAACM,GAAE,UAAQ,WAASA,GAAE,UAAQ,CAAC,aAAY,eAAc,QAAQ,EAAE,KAAM,CAAA2C,QAAI3C,GAAE,cAAY,IAAI,SAAS2C,EAAC,CAAC,KAAI,CAAC,SAAQ,UAAS,UAAS,SAAS,EAAE,KAAM,CAAAA,QAAI3C,GAAE,WAAS,IAAI,SAAS2C,EAAC,CAAC;AAAA,EAAE;AAAC,WAAS,IAAG;AAAC,WAAM,EAAE,eAAa,OAAO,OAAK,CAAC,IAAI,aAAW,IAAI,SAAS,2BAA0B,MAAM;AAAA,EAAC;AAAC,WAAS,EAAEA,IAAE;AAAC,WAAM,CAAC,QAAO,QAAO,WAAW,EAAE,SAAS,EAAEA,EAAC,CAAC;AAAA,EAAC;AAAM,QAAC,IAAE,KAAK,KAAI,IAAE,KAAK,KAAI,IAAE,KAAK,OAAmB,IAAE,CAAAA,QAAI,EAAC,GAAEA,IAAE,GAAEA,GAAC;AAAG,WAAS,EAAEA,IAAE;AAAC,UAAMjD,KAAE,EAAEiD,EAAC;AAAE,QAAI3C,KAAE,WAAWN,GAAE,KAAK,KAAG,GAAEG,KAAE,WAAWH,GAAE,MAAM,KAAG;AAAE,UAAMsB,KAAE,EAAE2B,EAAC,GAAEO,KAAElC,KAAE2B,GAAE,cAAY3C,IAAEK,KAAEW,KAAE2B,GAAE,eAAa9C,IAAEkC,KAAE,EAAE/B,EAAC,MAAIkD,MAAG,EAAErD,EAAC,MAAIQ;AAAE,WAAO0B,OAAI/B,KAAEkD,IAAErD,KAAEQ,KAAG,EAAC,OAAML,IAAE,QAAOH,IAAE,GAAEkC,GAAC;AAAA,EAAC;AAAC,WAAS,EAAEY,IAAE;AAAC,WAAOA,cAAa,WAASA,cAAa,EAAEA,EAAC,EAAE;AAAA,EAAO;AAAC,WAAS,EAAEA,IAAE;AAAC,WAAO,EAAEA,EAAC,IAAEA,KAAEA,GAAE;AAAA,EAAc;AAAC,WAAS,EAAEA,IAAE;AAAC,UAAMjD,KAAE,EAAEiD,EAAC;AAAE,QAAG,CAAC,EAAEjD,EAAC;AAAE,aAAO,EAAE,CAAC;AAAE,UAAMM,KAAEN,GAAE,yBAAwB,EAAC,OAAMyI,IAAE,QAAOtI,IAAE,GAAEmB,GAAC,IAAE,EAAEtB,EAAC;AAAE,QAAIwD,MAAGlC,KAAE,EAAEhB,GAAE,KAAK,IAAEA,GAAE,SAAOmI,IAAE9H,MAAGW,KAAE,EAAEhB,GAAE,MAAM,IAAEA,GAAE,UAAQH;AAAE,WAAOqD,MAAG,OAAO,SAASA,EAAC,MAAIA,KAAE,IAAG7C,MAAG,OAAO,SAASA,EAAC,MAAIA,KAAE,IAAG,EAAC,GAAE6C,IAAE,GAAE7C,GAAC;AAAA,EAAC;AAAC,QAAM,IAAE,EAAE,CAAC;AAAE,WAAS,EAAEsC,IAAE;AAAC,UAAMjD,KAAE,EAAEiD,EAAC;AAAE,WAAO,OAAKjD,GAAE,iBAAe,EAAC,GAAEA,GAAE,eAAe,YAAW,GAAEA,GAAE,eAAe,UAAS,IAAE;AAAA,EAAC;AAAC,WAAS,EAAEA,IAAEyI,IAAEtI,IAAEmB,IAAE;AAAC,eAASmH,OAAIA,KAAE,QAAI,WAAStI,OAAIA,KAAE;AAAI,UAAME,KAAEL,GAAE,sBAAuB,GAACwD,KAAE,EAAExD,EAAC;AAAE,QAAIW,KAAE,EAAE,CAAC;AAAE,IAAA8H,OAAInH,KAAE,EAAEA,EAAC,MAAIX,KAAE,EAAEW,EAAC,KAAGX,KAAE,EAAEX,EAAC;AAAG,UAAMqC,KAAE,SAASY,IAAEjD,IAAEyI,IAAE;AAAC,aAAO,WAASzI,OAAIA,KAAE,QAAI,EAAE,CAACyI,MAAGzI,MAAGyI,OAAI,EAAExF,EAAC,MAAIjD;AAAA,IAAC,EAAEwD,IAAErD,IAAEmB,EAAC,IAAE,EAAEkC,EAAC,IAAE,EAAE,CAAC;AAAE,QAAIwI,MAAG3L,GAAE,OAAKgC,GAAE,KAAG1B,GAAE,GAAEb,MAAGO,GAAE,MAAIgC,GAAE,KAAG1B,GAAE,GAAEa,KAAEnB,GAAE,QAAMM,GAAE,GAAE2C,KAAEjD,GAAE,SAAOM,GAAE;AAAE,QAAG6C,IAAE;AAAC,YAAMP,KAAE,EAAEO,EAAC,GAAExD,KAAEsB,MAAG,EAAEA,EAAC,IAAE,EAAEA,EAAC,IAAEA;AAAE,UAAImH,KAAExF,GAAE;AAAa,aAAKwF,MAAGnH,MAAGtB,OAAIiD,MAAG;AAAC,cAAMA,KAAE,EAAEwF,EAAC,GAAEzI,KAAEyI,GAAE,yBAAwBtI,KAAE,iBAAiBsI,EAAC,GAAEnH,KAAEtB,GAAE,QAAMyI,GAAE,aAAW,WAAWtI,GAAE,WAAW,KAAG8C,GAAE,GAAE5C,KAAEL,GAAE,OAAKyI,GAAE,YAAU,WAAWtI,GAAE,UAAU,KAAG8C,GAAE;AAAE,QAAA+I,MAAG/I,GAAE,GAAEnD,MAAGmD,GAAE,GAAEzB,MAAGyB,GAAE,GAAEK,MAAGL,GAAE,GAAE+I,MAAG1K,IAAExB,MAAGO,IAAEoI,KAAE,EAAEA,EAAC,EAAE;AAAA,MAAY;AAAA,IAAC;AAAC,WAAOxF,IAAE,EAAC,OAAMzB,IAAE,QAAO8B,IAAE,GAAE0I,IAAE,GAAElM,GAAC,CAAC;AAAA,EAAC;AAAC,WAAS,EAAEmD,IAAE;AAAC,WAAO,EAAEA,EAAC,IAAE,EAAC,YAAWA,GAAE,YAAW,WAAUA,GAAE,UAAS,IAAE,EAAC,YAAWA,GAAE,aAAY,WAAUA,GAAE,YAAW;AAAA,EAAC;AAAC,WAAS,EAAEA,IAAE;AAAC,QAAIjD;AAAE,WAAO,SAAOA,MAAG,EAAEiD,EAAC,IAAEA,GAAE,gBAAcA,GAAE,aAAW,OAAO,YAAU,SAAOjD,GAAE;AAAA,EAAe;AAAC,WAAS,EAAEiD,IAAE;AAAC,WAAO,EAAE,EAAEA,EAAC,CAAC,EAAE,OAAK,EAAEA,EAAC,EAAE;AAAA,EAAU;AAAC,WAAS,EAAEA,IAAE;AAAC,QAAG,WAAS,EAAEA,EAAC;AAAE,aAAOA;AAAE,UAAMjD,KAAEiD,GAAE,gBAAcA,GAAE,cAAY,EAAEA,EAAC,KAAGA,GAAE,QAAM,EAAEA,EAAC;AAAE,WAAO,EAAEjD,EAAC,IAAEA,GAAE,OAAKA;AAAA,EAAC;AAAC,WAAS,EAAEiD,IAAE;AAAC,UAAMjD,KAAE,EAAEiD,EAAC;AAAE,WAAO,EAAEjD,EAAC,IAAEiD,GAAE,gBAAcA,GAAE,cAAc,OAAKA,GAAE,OAAK,EAAEjD,EAAC,KAAG,EAAEA,EAAC,IAAEA,KAAE,EAAEA,EAAC;AAAA,EAAC;AAAC,WAAS,EAAEiD,IAAEjD,IAAE;AAAC,QAAIyI;AAAE,eAASzI,OAAIA,KAAE,CAAE;AAAE,UAAMG,KAAE,EAAE8C,EAAC,GAAE3B,KAAEnB,QAAK,SAAOsI,KAAExF,GAAE,iBAAe,SAAOwF,GAAE,OAAMpI,KAAE,EAAEF,EAAC;AAAE,WAAOmB,KAAEtB,GAAE,OAAOK,IAAEA,GAAE,kBAAgB,CAAE,GAAC,EAAEF,EAAC,IAAEA,KAAE,CAAE,CAAA,IAAEH,GAAE,OAAOG,IAAE,EAAEA,EAAC,CAAC;AAAA,EAAC;AAAC,WAAS,EAAEH,IAAEG,IAAEmB,IAAE;AAAC,QAAIkC;AAAE,QAAG,eAAarD;AAAE,MAAAqD,KAAE,SAASP,IAAEjD,IAAE;AAAC,cAAMyI,KAAE,EAAExF,EAAC,GAAE9C,KAAE,EAAE8C,EAAC,GAAE3B,KAAEmH,GAAE;AAAe,YAAIpI,KAAEF,GAAE,aAAYqD,KAAErD,GAAE,cAAaQ,KAAE,GAAE0B,KAAE;AAAE,YAAGf,IAAE;AAAC,UAAAjB,KAAEiB,GAAE,OAAMkC,KAAElC,GAAE;AAAO,gBAAM2B,KAAE,EAAC;AAAG,WAAC,CAACA,MAAGA,MAAG,YAAUjD,QAAKW,KAAEW,GAAE,YAAWe,KAAEf,GAAE;AAAA,QAAU;AAAC,eAAM,EAAC,OAAMjB,IAAE,QAAOmD,IAAE,GAAE7C,IAAE,GAAE0B,GAAC;AAAA,MAAC,EAAErC,IAAEsB,EAAC;AAAA,aAAU,eAAanB;AAAE,MAAAqD,KAAE,SAASP,IAAE;AAAC,cAAMjD,KAAE,EAAEiD,EAAC,GAAE3C,KAAE,EAAE2C,EAAC,GAAE9C,KAAE8C,GAAE,cAAc,MAAK3B,KAAE,EAAEtB,GAAE,aAAYA,GAAE,aAAYG,GAAE,aAAYA,GAAE,WAAW,GAAEE,KAAE,EAAEL,GAAE,cAAaA,GAAE,cAAaG,GAAE,cAAaA,GAAE,YAAY;AAAE,YAAIqD,KAAE,CAAClD,GAAE,aAAW,EAAE2C,EAAC;AAAE,cAAMtC,KAAE,CAACL,GAAE;AAAU,eAAM,UAAQ,EAAEH,EAAC,EAAE,cAAYqD,MAAG,EAAExD,GAAE,aAAYG,GAAE,WAAW,IAAEmB,KAAG,EAAC,OAAMA,IAAE,QAAOjB,IAAE,GAAEmD,IAAE,GAAE7C,GAAC;AAAA,MAAC,EAAE,EAAEX,EAAC,CAAC;AAAA,aAAU,EAAEG,EAAC;AAAE,MAAAqD,KAAE,SAASP,IAAEjD,IAAE;AAAC,cAAMM,KAAE,EAAE2C,IAAE,MAAG,YAAUjD,EAAC,GAAEyI,KAAEnI,GAAE,MAAI2C,GAAE,WAAU9C,KAAEG,GAAE,OAAK2C,GAAE,YAAW3B,KAAE,EAAE2B,EAAC,IAAE,EAAEA,EAAC,IAAE,EAAE,CAAC;AAAE,eAAM,EAAC,OAAMA,GAAE,cAAY3B,GAAE,GAAE,QAAO2B,GAAE,eAAa3B,GAAE,GAAE,GAAEnB,KAAEmB,GAAE,GAAE,GAAEmH,KAAEnH,GAAE,EAAC;AAAA,MAAC,EAAEnB,IAAEmB,EAAC;AAAA,SAAM;AAAC,YAAM2B,KAAE,EAAEjD,EAAC;AAAE,MAAAwD,KAAE,EAAC,GAAGrD,IAAE,GAAEA,GAAE,IAAE8C,GAAE,GAAE,GAAE9C,GAAE,IAAE8C,GAAE,EAAC;AAAA,IAAC;AAAC,WAAOA,IAAEO,EAAC;AAAA,EAAC;AAAC,WAAS,EAAEP,IAAEjD,IAAE;AAAC,UAAMM,KAAE,EAAE2C,EAAC;AAAE,WAAM,EAAE3C,OAAIN,MAAG,CAAC,EAAEM,EAAC,KAAG,EAAEA,EAAC,OAAK,YAAU,EAAEA,EAAC,EAAE,YAAU,EAAEA,IAAEN,EAAC;AAAA,EAAE;AAAC,WAAS,EAAEiD,IAAEjD,IAAEM,IAAE;AAAC,UAAMmI,KAAE,EAAEzI,EAAC,GAAEG,KAAE,EAAEH,EAAC,GAAEwD,KAAE,YAAUlD,IAAE+B,KAAE,EAAEY,IAAE,MAAGO,IAAExD,EAAC;AAAE,QAAIgM,KAAE,EAAC,YAAW,GAAE,WAAU,EAAC;AAAE,UAAMlM,KAAE,EAAE,CAAC;AAAE,QAAG2I,MAAG,CAACA,MAAG,CAACjF;AAAE,WAAI,WAAS,EAAExD,EAAC,KAAG,EAAEG,EAAC,OAAK6L,KAAE,EAAEhM,EAAC,IAAG,EAAEA,EAAC,GAAE;AAAC,cAAMiD,KAAE,EAAEjD,IAAE,MAAGwD,IAAExD,EAAC;AAAE,QAAAF,GAAE,IAAEmD,GAAE,IAAEjD,GAAE,YAAWF,GAAE,IAAEmD,GAAE,IAAEjD,GAAE;AAAA,MAAS;AAAM,QAAAG,OAAIL,GAAE,IAAE,EAAEK,EAAC;AAAG,WAAM,EAAC,GAAEkC,GAAE,OAAK2J,GAAE,aAAWlM,GAAE,GAAE,GAAEuC,GAAE,MAAI2J,GAAE,YAAUlM,GAAE,GAAE,OAAMuC,GAAE,OAAM,QAAOA,GAAE,OAAM;AAAA,EAAC;AAAC,WAAS,EAAEY,IAAEjD,IAAE;AAAC,WAAO,EAAEiD,EAAC,KAAG,YAAU,EAAEA,EAAC,EAAE,WAASjD,KAAEA,GAAEiD,EAAC,IAAEA,GAAE,eAAa;AAAA,EAAI;AAAC,WAAS,EAAEA,IAAEjD,IAAE;AAAC,UAAMG,KAAE,EAAE8C,EAAC;AAAE,QAAG,CAAC,EAAEA,EAAC;AAAE,aAAO9C;AAAE,QAAIqD,KAAE,EAAEP,IAAEjD,EAAC;AAAE,WAAKwD,MAAG,EAAEA,EAAC,KAAG,aAAW,EAAEA,EAAC,EAAE;AAAU,MAAAA,KAAE,EAAEA,IAAExD,EAAC;AAAE,WAAOwD,OAAI,WAAS,EAAEA,EAAC,KAAG,WAAS,EAAEA,EAAC,KAAG,aAAW,EAAEA,EAAC,EAAE,YAAU,CAAC,EAAEA,EAAC,KAAGrD,KAAEqD,MAAG,SAASP,IAAE;AAAC,UAAIjD,KAAE,EAAEiD,EAAC;AAAE,aAAK,EAAEjD,EAAC,KAAG,CAAC,EAAEA,EAAC,KAAG;AAAC,YAAG,EAAEA,EAAC;AAAE,iBAAOA;AAAE,QAAAA,KAAE,EAAEA,EAAC;AAAA,MAAC;AAAC,aAAO;AAAA,IAAI,EAAEiD,EAAC,KAAG9C;AAAA,EAAC;AAAC,QAAM,IAAE,EAAC,uDAAsD,SAAS8C,IAAE;AAAC,QAAG,EAAC,MAAKjD,IAAE,cAAaM,IAAE,UAASmI,GAAC,IAAExF;AAAE,UAAM9C,KAAE,EAAEG,EAAC,GAAEkD,KAAE,EAAElD,EAAC;AAAE,QAAGA,OAAIkD;AAAE,aAAOxD;AAAE,QAAIqC,KAAE,EAAC,YAAW,GAAE,WAAU,EAAC,GAAE2J,KAAE,EAAE,CAAC;AAAE,UAAMlM,KAAE,EAAE,CAAC;AAAE,SAAIK,MAAG,CAACA,MAAG,YAAUsI,SAAM,WAAS,EAAEnI,EAAC,KAAG,EAAEkD,EAAC,OAAKnB,KAAE,EAAE/B,EAAC,IAAG,EAAEA,EAAC,IAAG;AAAC,YAAM2C,KAAE,EAAE3C,EAAC;AAAE,MAAA0L,KAAE,EAAE1L,EAAC,GAAER,GAAE,IAAEmD,GAAE,IAAE3C,GAAE,YAAWR,GAAE,IAAEmD,GAAE,IAAE3C,GAAE;AAAA,IAAS;AAAC,WAAM,EAAC,OAAMN,GAAE,QAAMgM,GAAE,GAAE,QAAOhM,GAAE,SAAOgM,GAAE,GAAE,GAAEhM,GAAE,IAAEgM,GAAE,IAAE3J,GAAE,aAAW2J,GAAE,IAAElM,GAAE,GAAE,GAAEE,GAAE,IAAEgM,GAAE,IAAE3J,GAAE,YAAU2J,GAAE,IAAElM,GAAE,EAAC;AAAA,EAAC,GAAE,oBAAmB,GAAE,iBAAgB,SAASmD,IAAE;AAAC,QAAG,EAAC,SAAQjD,IAAE,UAASM,IAAE,cAAaH,IAAE,UAASE,GAAC,IAAE4C;AAAE,UAAMO,KAAE,CAAC,GAAG,wBAAsBlD,KAAE,SAAS2C,IAAEjD,IAAE;AAAC,YAAMM,KAAEN,GAAE,IAAIiD,EAAC;AAAE,UAAG3C;AAAE,eAAOA;AAAE,UAAIH,KAAE,EAAE8C,EAAC,EAAE,OAAQ,CAAAA,OAAG,EAAEA,EAAC,KAAG,WAAS,EAAEA,EAAC,CAAC,GAAG5C,KAAE;AAAK,YAAMmD,KAAE,YAAU,EAAEP,EAAC,EAAE;AAAS,UAAIZ,KAAEmB,KAAE,EAAEP,EAAC,IAAEA;AAAE,aAAK,EAAEZ,EAAC,KAAG,CAAC,EAAEA,EAAC,KAAG;AAAC,cAAMrC,KAAE,EAAEqC,EAAC,GAAE/B,KAAE,EAAE+B,EAAC;AAAE,QAAA/B,MAAG,YAAUN,GAAE,aAAWK,KAAE,QAAOmD,KAAE,CAAClD,MAAG,CAACD,KAAE,CAACC,MAAG,aAAWN,GAAE,YAAUK,MAAG,CAAC,YAAW,OAAO,EAAE,SAASA,GAAE,QAAQ,KAAG,EAAEgC,EAAC,KAAG,CAAC/B,MAAG,EAAE2C,IAAEZ,EAAC,KAAGlC,KAAEA,GAAE,OAAQ,CAAA8C,OAAGA,OAAIZ,MAAIhC,KAAEL,IAAEqC,KAAE,EAAEA,EAAC;AAAA,MAAC;AAAC,aAAOrC,GAAE,IAAIiD,IAAE9C,EAAC,GAAEA;AAAA,IAAC,EAAEH,IAAE,KAAK,EAAE,IAAE,GAAG,OAAOM,EAAC,GAAEH,EAAC,GAAEkC,KAAEmB,GAAE,CAAC,GAAE1D,KAAE0D,GAAE,OAAQ,CAACP,IAAE3C,OAAI;AAAC,YAAMmI,KAAE,EAAEzI,IAAEM,IAAED,EAAC;AAAE,aAAO4C,GAAE,MAAI,EAAEwF,GAAE,KAAIxF,GAAE,GAAG,GAAEA,GAAE,QAAM,EAAEwF,GAAE,OAAMxF,GAAE,KAAK,GAAEA,GAAE,SAAO,EAAEwF,GAAE,QAAOxF,GAAE,MAAM,GAAEA,GAAE,OAAK,EAAEwF,GAAE,MAAKxF,GAAE,IAAI,GAAEA;AAAA,IAAC,GAAG,EAAEjD,IAAEqC,IAAEhC,EAAC,CAAC;AAAE,WAAM,EAAC,OAAMP,GAAE,QAAMA,GAAE,MAAK,QAAOA,GAAE,SAAOA,GAAE,KAAI,GAAEA,GAAE,MAAK,GAAEA,GAAE,IAAG;AAAA,EAAC,GAAE,iBAAgB,GAAE,iBAAgB,eAAemD,IAAE;AAAC,QAAG,EAAC,WAAUjD,IAAE,UAASM,IAAE,UAASmI,GAAC,IAAExF;AAAE,UAAM9C,KAAE,KAAK,mBAAiB,GAAEmB,KAAE,KAAK;AAAc,WAAM,EAAC,WAAU,EAAEtB,IAAE,MAAMG,GAAEG,EAAC,GAAEmI,EAAC,GAAE,UAAS,EAAC,GAAE,GAAE,GAAE,GAAE,GAAG,MAAMnH,GAAEhB,EAAC,EAAC,EAAC;AAAA,EAAC,GAAE,gBAAe,SAAS2C,IAAE;AAAC,WAAO,MAAM,KAAKA,GAAE,eAAgB,CAAA;AAAA,EAAC,GAAE,eAAc,SAASA,IAAE;AAAC,WAAO,EAAEA,EAAC;AAAA,EAAC,GAAE,UAAS,GAAE,WAAU,GAAE,OAAM,SAASA,IAAE;AAAC,WAAM,UAAQ,iBAAiBA,EAAC,EAAE;AAAA,EAAS,EAAC;AAA+/C,QAAM,IAAE,CAACA,IAAE3C,IAAEmI,OAAI;AAAC,UAAMtI,KAAE,oBAAI,OAAImB,KAAE,EAAC,UAAS,GAAE,GAAGmH,GAAC,GAAEpI,KAAE,EAAC,GAAGiB,GAAE,UAAS,IAAGnB,GAAC;AAAE,WAAOH,IAAEiD,IAAE3C,IAAE,EAAC,GAAGgB,IAAE,UAASjB,GAAC,CAAC;AAAA,EAAC;AC4CzsQ,MAAI,QAAQ,OAAO,aAAa,cAAcmO,aAAAA,kBAAkBJ,aAAAA;AAIhE,WAAS,UAAUtO,IAAGsB,IAAG;AACvB,QAAItB,OAAMsB,IAAG;AACX,aAAO;AAAA,IACR;AACD,QAAI,OAAOtB,OAAM,OAAOsB,IAAG;AACzB,aAAO;AAAA,IACR;AACD,QAAI,OAAOtB,OAAM,cAAcA,GAAE,eAAesB,GAAE,YAAY;AAC5D,aAAO;AAAA,IACR;AACD,QAAI,QAAQjB,IAAG;AACf,QAAIL,MAAKsB,MAAK,OAAOtB,MAAK,UAAU;AAClC,UAAI,MAAM,QAAQA,EAAC,GAAG;AACpB,iBAASA,GAAE;AACX,YAAI,UAAUsB,GAAE;AAAQ,iBAAO;AAC/B,aAAKjB,KAAI,QAAQA,SAAQ,KAAI;AAC3B,cAAI,CAAC,UAAUL,GAAEK,EAAC,GAAGiB,GAAEjB,EAAC,CAAC,GAAG;AAC1B,mBAAO;AAAA,UACR;AAAA,QACF;AACD,eAAO;AAAA,MACR;AACD,aAAO,OAAO,KAAKL,EAAC;AACpB,eAAS,KAAK;AACd,UAAI,WAAW,OAAO,KAAKsB,EAAC,EAAE,QAAQ;AACpC,eAAO;AAAA,MACR;AACD,WAAKjB,KAAI,QAAQA,SAAQ,KAAI;AAC3B,YAAI,CAAC,OAAO,UAAU,eAAe,KAAKiB,IAAG,KAAKjB,EAAC,CAAC,GAAG;AACrD,iBAAO;AAAA,QACR;AAAA,MACF;AACD,WAAKA,KAAI,QAAQA,SAAQ,KAAI;AAC3B,cAAM,MAAM,KAAKA,EAAC;AAClB,YAAI,QAAQ,YAAYL,GAAE,UAAU;AAClC;AAAA,QACD;AACD,YAAI,CAAC,UAAUA,GAAE,GAAG,GAAGsB,GAAE,GAAG,CAAC,GAAG;AAC9B,iBAAO;AAAA,QACR;AAAA,MACF;AACD,aAAO;AAAA,IACR;AACD,WAAOtB,OAAMA,MAAKsB,OAAMA;AAAA,EAC1B;AAEA,WAAS,aAAa,OAAO;AAC3B,UAAM,MAAMqN,oBAAa,KAAK;AAC9B,UAAM,MAAM;AACV,UAAI,UAAU;AAAA,IAClB,CAAG;AACD,WAAO;AAAA,EACT;AAMA,WAAS,YAAY,SAAS;AAC5B,QAAI,YAAY,QAAQ;AACtB,gBAAU,CAAA;AAAA,IACX;AACD,UAAM;AAAA,MACJ,YAAY;AAAA,MACZ,WAAW;AAAA,MACX,aAAa,CAAE;AAAA,MACf;AAAA,MACA;AAAA,MACA;AAAA,IACD,IAAG;AACJ,UAAM,CAAC,MAAM,OAAO,IAAIC,sBAAe;AAAA,MACrC,GAAG;AAAA,MACH,GAAG;AAAA,MACH;AAAA,MACA;AAAA,MACA,gBAAgB,CAAE;AAAA,MAClB,cAAc;AAAA,IAClB,CAAG;AACD,UAAM,CAAC,kBAAkB,mBAAmB,IAAIA,aAAc,SAAC,UAAU;AACzE,QAAI,CAAC,UAAU,kBAAkB,UAAU,GAAG;AAC5C,0BAAoB,UAAU;AAAA,IAC/B;AACD,UAAM,eAAeD,oBAAa,IAAI;AACtC,UAAM,cAAcA,oBAAa,IAAI;AACrC,UAAM,UAAUA,oBAAa,IAAI;AACjC,UAAM,0BAA0B,aAAa,oBAAoB;AACjE,UAAM,cAAc,aAAa,QAAQ;AACzC,UAAM,CAAC,WAAW,aAAa,IAAIC,aAAc,SAAC,IAAI;AACtD,UAAM,CAAC,UAAU,YAAY,IAAIA,aAAc,SAAC,IAAI;AACpD,UAAM,eAAeC,aAAiB,YAAC,UAAQ;AAC7C,UAAI,aAAa,YAAY,MAAM;AACjC,qBAAa,UAAU;AACvB,sBAAc,IAAI;AAAA,MACnB;AAAA,IACF,GAAE,CAAE,CAAA;AACL,UAAM,cAAcA,aAAiB,YAAC,UAAQ;AAC5C,UAAI,YAAY,YAAY,MAAM;AAChC,oBAAY,UAAU;AACtB,qBAAa,IAAI;AAAA,MAClB;AAAA,IACF,GAAE,CAAE,CAAA;AACL,UAAM,SAASA,aAAAA,YAAkB,MAAM;AACrC,UAAI,CAAC,aAAa,WAAW,CAAC,YAAY,SAAS;AACjD;AAAA,MACD;AACD,YAAM,SAAS;AAAA,QACb;AAAA,QACA;AAAA,QACA,YAAY;AAAA,MAClB;AACI,UAAI,YAAY,SAAS;AACvB,eAAO,WAAW,YAAY;AAAA,MAC/B;AACDC,QAAgB,aAAa,SAAS,YAAY,SAAS,MAAM,EAAE,KAAK,CAAA/M,UAAQ;AAC9E,cAAM,WAAW;AAAA,UACf,GAAGA;AAAA,UACH,cAAc;AAAA,QACtB;AACM,YAAI,aAAa,WAAW,CAAC,UAAU,QAAQ,SAAS,QAAQ,GAAG;AACjE,kBAAQ,UAAU;AAClBgN,0BAAAA,UAAmB,MAAM;AACvB,oBAAQ,QAAQ;AAAA,UAC1B,CAAS;AAAA,QACF;AAAA,MACP,CAAK;AAAA,IACF,GAAE,CAAC,kBAAkB,WAAW,UAAU,WAAW,CAAC;AACvD,UAAM,MAAM;AACV,UAAI,SAAS,SAAS,QAAQ,QAAQ,cAAc;AAClD,gBAAQ,QAAQ,eAAe;AAC/B,gBAAQ,CAAAhN,WAAS;AAAA,UACf,GAAGA;AAAA,UACH,cAAc;AAAA,QACf,EAAC;AAAA,MACH;AAAA,IACL,GAAK,CAAC,IAAI,CAAC;AACT,UAAM,eAAe4M,oBAAa,KAAK;AACvC,UAAM,MAAM;AACV,mBAAa,UAAU;AACvB,aAAO,MAAM;AACX,qBAAa,UAAU;AAAA,MAC7B;AAAA,IACG,GAAE,CAAE,CAAA;AACL,UAAM,MAAM;AACV,UAAI,aAAa,UAAU;AACzB,YAAI,wBAAwB,SAAS;AACnC,iBAAO,wBAAwB,QAAQ,WAAW,UAAU,MAAM;AAAA,QAC1E,OAAa;AACL;QACD;AAAA,MACF;AAAA,IACF,GAAE,CAAC,WAAW,UAAU,QAAQ,uBAAuB,CAAC;AACzD,UAAM,OAAOK,aAAAA,QAAc,OAAO;AAAA,MAChC,WAAW;AAAA,MACX,UAAU;AAAA,MACV;AAAA,MACA;AAAA,IACD,IAAG,CAAC,cAAc,WAAW,CAAC;AAC/B,UAAM,WAAWA,aAAAA,QAAc,OAAO;AAAA,MACpC;AAAA,MACA;AAAA,IACD,IAAG,CAAC,WAAW,QAAQ,CAAC;AACzB,WAAOA,aAAa,QAAC,OAAO;AAAA,MAC1B,GAAG;AAAA,MACH;AAAA,MACA;AAAA,MACA;AAAA,MACA,WAAW;AAAA,MACX,UAAU;AAAA,IACd,IAAM,CAAC,MAAM,QAAQ,MAAM,UAAU,cAAc,WAAW,CAAC;AAAA,EAC/D;AChNA,QAAM,gBAAgB,YAAU;AAC5B,QAAI,SAAS,UAAU,OAAO,KAAK;AACnC,WAAO,OAAO,OAAO,kBAAkB,MAAM,IAAI,OAAO,QAAQ,yBAAyB,MAAM,IAAI;AAAA,EACvG;AACA,WAAS,QAAQzM,IAAG,QAAQ;AACxB,WAAO,CAAC,EAAE,OAAO,eAAe;AAC5B,UAAI,MAAM;AACN,eAAO;AACX,UAAI,KAAKA,GAAE,QAAQ,KAAK;AACxB,UAAI,CAAC;AACD,eAAO;AACX,eAAS,MAAM,OAAO,EAAE,CAAC;AACzB,aAAO;AAAA,IACf;AAAA,EACA;AAOA,QAAM,oBAAiC;AAAA,IAAQ;AAAA,IAAmB;AAAA;AAAA;AAelE,QAAM,qBAAkC;AAAA,IAAQ;AAAA,IAAoB;AAAA;AAAA;AAapE,QAAM,2BAAwC;AAAA,IAAQ,CAACoG,IAAG9H,OAAM,mBAAmB8H,IAAG9H,IAAG,mBAAmBA,EAAC,CAAC;AAAA,IAAG;AAAA;AAAA,EAAC;AAClH,WAAS,UAAU,OAAO,MAAM,MAAM,UAAU,KAAK,MAAM;AACvD,QAAI,OAAO,MAAM,eAAe,iBAAiB,GAAG;AACpD,WAAO,KAAK,SAAS,KAAK,CAAC,IAAI,CAAA;AAAA,EACnC;AACA,QAAM,eAAe;AAKrB,WAAS,iBAAiB,OAAO,EAAE,MAAM,MAAO,GAAE,MAAM,IAAI;AACxD,QAAI,aAAa,MAAM,SAAS,OAAO,cAAc,IAAI;AACzD,QAAI,YAAY,MAAM,SAAS,IAAI,KAAK,YAAY;AACpD,QAAI,cAAc,OAAO,KAAK,UAAU,EAAE,CAAC,EAAE,QAAQ,aAAa,OAAO,KAAK,SAAS,EAAE,CAAC,EAAE;AAC5F,QAAI,YAAY,WAAW,SAAS;AACpC,QAAI,WAAW,MAAM,YAAY,KAAK,QAAQ,SAAS,KAAK,QACxD,UAAU,MAAM,YAAY,aAAa,MAAM,MAAM,KAAK,OAAO;AACjE,aAAO;AAAA,QAAE,MAAM,EAAE,KAAK,OAAO,aAAa,QAAQ,eAAe,EAAG;AAAA,QAChE,OAAO,EAAE,KAAK,KAAK,YAAY,QAAQ,cAAc,EAAC;AAAA;IAC7D;AACD,QAAI,WAAW;AACf,QAAI,KAAK,QAAQ,IAAI,cAAc;AAC/B,kBAAY,UAAU,MAAM,SAAS,MAAM,EAAE;AAAA,IAChD,OACI;AACD,kBAAY,MAAM,SAAS,MAAM,OAAO,YAAY;AACpD,gBAAU,MAAM,SAAS,KAAK,cAAc,EAAE;AAAA,IACjD;AACD,QAAI,aAAa,OAAO,KAAK,SAAS,EAAE,CAAC,EAAE,QAAQ,WAAW,OAAO,KAAK,OAAO,EAAE,CAAC,EAAE;AACtF,QAAI,SAAS,QAAQ,SAAS,WAAW,MAAM;AAC/C,QAAI,UAAU,MAAM,YAAY,aAAa,KAAK,MAAM,KAAK,QACzD,QAAQ,MAAM,QAAQ,SAAS,MAAM,MAAM,KAAK,OAAO;AACvD,aAAO;AAAA,QAAE,MAAM;AAAA,UAAE,KAAK,OAAO,aAAa,KAAK;AAAA,UACvC,QAAQ,KAAK,KAAK,UAAU,OAAO,aAAa,KAAK,MAAM,CAAC,IAAI,IAAI;AAAA,QAAG;AAAA,QAC3E,OAAO;AAAA,UAAE,KAAK,KAAK,WAAW,MAAM;AAAA,UAChC,QAAQ,KAAK,KAAK,QAAQ,OAAO,SAAS,CAAC,CAAC,IAAI,IAAI;AAAA,QAAG;AAAA,MAAA;AAAA,IAClE;AACD,WAAO;AAAA,EACX;AACA,WAAS,mBAAmB,OAAO;AAC/B,QAAI,SAAS,CAAA;AACb,aAASW,MAAK,MAAM,UAAU,QAAQ;AAClC,UAAI,WAAW,MAAM,IAAI,OAAOA,GAAE,IAAI;AACtC,UAAI,SAASA,GAAE,MAAM,SAAS,KAAK,WAAW,MAAM,IAAI,OAAOA,GAAE,EAAE;AACnE,UAAI,OAAO,OAAO,SAAS;AAC3B,UAAI,QAAQ,KAAK,OAAO,IAAI,EAAE,KAAK,SAAS;AACxC,eAAO,IAAI,EAAE,KAAK,OAAO;AAAA;AAEzB,eAAO,KAAK,EAAE,MAAM,SAAS,MAAM,IAAI,OAAO,GAAE,CAAE;AAAA,IACzD;AACD,WAAO;AAAA,EACX;AAGA,WAAS,mBAAmB,QAAQ,OAAO,SAAS,MAAM,UAAU,QAAQ;AACxE,QAAI,SAAS,OAAO,IAAI,CAAAA,OAAK,UAAU,OAAOA,GAAE,IAAI,EAAE,KAAK;AAC3D,QAAI,CAAC,OAAO,MAAM,CAAAjB,OAAKA,EAAC;AACpB,aAAO;AACX,QAAI,WAAW,OAAO,IAAI,CAACiB,IAAGnB,OAAM,iBAAiB,OAAO,OAAOA,EAAC,GAAGmB,GAAE,MAAMA,GAAE,EAAE,CAAC;AACpF,QAAI,UAAU,KAAmC,CAAC,SAAS,MAAM,CAAAjB,OAAKA,EAAC,GAAG;AACtE,aAAO,EAAE,SAAS,MAAM,QAAQ,OAAO,IAAI,CAAC,OAAOF,OAAM;AACjD,YAAI,SAASA,EAAC;AACV,iBAAO;AACX,eAAO,CAAC,EAAE,MAAM,MAAM,MAAM,QAAQ,OAAOA,EAAC,EAAE,OAAO,IAAG,GAAI,EAAE,MAAM,MAAM,IAAI,QAAQ,MAAM,OAAOA,EAAC,EAAE,MAAK,CAAE;AAAA,MAChH,CAAA,CAAC,EAAC;AAAA,IACV,WACQ,UAAU,KAAiC,SAAS,KAAK,CAAAE,OAAKA,EAAC,GAAG;AACvE,UAAI,UAAU,CAAA;AACd,eAASF,KAAI,GAAG4O,UAAS5O,KAAI,SAAS,QAAQA;AAC1C,YAAI4O,WAAU,SAAS5O,EAAC,GAAG;AACvB,cAAI,QAAQ,OAAOA,EAAC,GAAG,EAAE,MAAM,MAAO,IAAG4O;AACzC,kBAAQ,KAAK,EAAE,MAAM,KAAK,MAAM,MAAM,KAAK,QAAQ,IAAI,KAAK,MAAM,KAAK,UAAU,EAAE,MAAM,MAAM,MAAM,MAAM,QAAQ,IAAI,MAAM,MAAM,MAAM,MAAM,OAAQ,CAAA;AAAA,QAC1J;AACL,aAAO,EAAE,QAAO;AAAA,IACnB;AACD,WAAO;AAAA,EACX;AAEA,WAAS,kBAAkB,QAAQ,OAAO,SAAS,MAAM,UAAU,QAAQ;AACvE,QAAI,QAAQ,CAAA;AACZ,QAAI,WAAW;AACf,aAAS,EAAE,MAAM,GAAE,KAAM,QAAQ;AAC7B,UAAI,SAAS,MAAM,QAAQ,YAAY;AACvC,eAAS,MAAM,MAAM,OAAO,MAAK;AAC7B,YAAI,OAAO,MAAM,IAAI,OAAO,GAAG;AAC/B,YAAI,KAAK,OAAO,aAAa,QAAQ,MAAM,KAAK,KAAK,OAAO;AACxD,qBAAW,KAAK;AAChB,cAAI,QAAQ,UAAU,OAAO,GAAG,EAAE;AAClC,cAAI,CAAC;AACD;AACJ,cAAI,SAAS,OAAO,KAAK,KAAK,IAAI,EAAE,CAAC,EAAE;AACvC,cAAI,QAAQ,UAAU,KAAK;AAC3B,cAAIA,WAAU,KAAK,KAAK,MAAM,QAAQ,SAAS,MAAM,MAAM,KAAK,QAAQ,SAAS;AACjF,cAAI,SAAS,KAAK,KAAK,UAAU,SAAS;AACtC,wBAAY;AAChB,gBAAM,KAAK,EAAE,MAAM,SAAAA,UAAS,OAAO,QAAQ,OAAO,QAAQ,MAAK,CAAE;AAAA,QACpE;AACD,cAAM,KAAK,KAAK;AAAA,MACnB;AACD,UAAI,YAAY;AACZ,iBAAS5O,KAAI,QAAQA,KAAI,MAAM,QAAQA;AACnC,cAAI,MAAMA,EAAC,EAAE,SAAS,MAAMA,EAAC,EAAE,KAAK,KAAK;AACrC,kBAAMA,EAAC,EAAE,SAAS;AAAA;AAC9B,UAAI,MAAM,UAAU,SAAS;AACzB,cAAM,MAAM,EAAE,SAAS;AAAA,IAC9B;AACD,QAAI,UAAU,KAAmC,MAAM,KAAK,CAAAqD,OAAKA,GAAE,UAAU,MAAM,CAACA,GAAE,SAASA,GAAE,OAAO,GAAG;AACvG,UAAI,UAAU,CAAA;AACd,eAAS,EAAE,MAAM,OAAO,QAAQ,OAAO,OAAM,KAAM;AAC/C,YAAI,UAAU,CAAC;AACX,kBAAQ,KAAK,EAAE,MAAM,KAAK,OAAO,QAAQ,QAAQ,QAAQ,IAAG,CAAE;AACtE,UAAI,YAAY,MAAM,QAAQ,OAAO;AACrC,aAAO,EAAE,SAAS,WAAW,WAAW,MAAM,UAAU,IAAI,WAAW,CAAC;IAC3E,WACQ,UAAU,KAAiC,MAAM,KAAK,CAAAA,OAAKA,GAAE,WAAW,CAAC,GAAG;AACjF,UAAI,UAAU,CAAA;AACd,eAAS,EAAE,MAAM,SAAAuL,UAAS,MAAO,KAAI;AACjC,YAAIA,YAAW,GAAG;AACd,cAAI,OAAO,KAAK,OAAOA,UAAS,KAAK,OAAO,MAAM;AAClD,cAAI,KAAK,KAAK,KAAK,KAAK,IAAI,KAAK;AAC7B;AACJ,kBAAQ,KAAK,EAAE,MAAM,GAAI,CAAA;AAAA,QAC5B;AACL,aAAO,EAAE,QAAO;AAAA,IACnB;AACD,WAAO;AAAA,EACX;AAEA,QAAM,cAA2B,2BAAW;AAQ5C,QAAM,iBAA8B,2BAAW;AAQ/C,QAAM,kBAA+B,sBAAM;AAC3C,QAAM,gBAA6B,sBAAM,OAAO;AAAA,IAC5C,QAAQ,SAAS;AACb,aAAO,cAAc,SAAS;AAAA,QAC1B,UAAU;AAAA,QACV,eAAe;AAAA,MAC3B,GAAW,EAAE,UAAU,KAAK,KAAK,eAAe,KAAK,IAAG,CAAE;AAAA,IACrD;AAAA,EACL,CAAC;AACD,WAAS,UAAU,SAAS;AACxB,QAAI,MAAM;AACV,YAAQ,kBAAkB,CAACvM,IAAG,OAAO,MAAM,EAAE;AAC7C,WAAO;AAAA,EACX;AACA,QAAM,gBAA6B,2BAAW,OAAO;AAAA,IACjD,SAAS;AACL,aAAO,aAAa;AAAA,IACvB;AAAA,IACD,OAAO,OAAO,IAAI;AACd,UAAI,SAAS,GAAG,MAAM,MAAM,aAAa;AACzC,UAAI,WAAW,GAAG,WAAW,WAAW;AACxC,UAAI,UAAU;AACV,YAAI,YAAY,GAAG,aAAa,gBAAgB,OAAO,UAAU,GAAG,OAAO,CAAC,IAAI;AAChF,YAAI,OAAO,UAAU,gBAAgB,IAAI,SAAS,GAAG,OAAO,SAAS;AACrE,YAAI,QAAQ,QAAQ,IAA0B,MAAM,SAAS,MAAM;AACnE,YAAI;AACA,kBAAQ,aAAa,OAAO,MAAM,QAAQ,OAAO,UAAU,IAAI;AAAA;AAE/D,kBAAQ,aAAa,OAAO,GAAG,WAAW,SAAS;AACvD,eAAO,IAAI,aAAa,QAAQ,IAA0B,SAAS,OAAO,OAAO,QAAQ,IAA0B,QAAQ,SAAS,IAAI;AAAA,MAC3I;AACD,UAAI,UAAU,GAAG,WAAW,cAAc;AAC1C,UAAI,WAAW,UAAU,WAAW;AAChC,gBAAQ,MAAM;AAClB,UAAI,GAAG,WAAW,YAAY,YAAY,MAAM;AAC5C,eAAO,CAAC,GAAG,QAAQ,QAAQ,MAAM,WAAW,GAAG,QAAQ,IAAI,IAAI;AACnE,UAAI,QAAQ,UAAU,gBAAgB,EAAE;AACxC,UAAI,OAAO,GAAG,WAAW,YAAY,IAAI,GAAG,YAAY,GAAG,WAAW,YAAY,SAAS;AAC3F,UAAI;AACA,gBAAQ,MAAM,WAAW,OAAO,MAAM,WAAW,OAAO,eAAe,OAAO,QAAQ;AAAA,eACjF,GAAG;AACR,gBAAQ,MAAM,aAAa,GAAG,WAAW,WAAW,MAAM,WAAW,OAAO,aAAa;AAC7F,UAAI,WAAW,UAAU,WAAW;AAChC,gBAAQ,MAAM;AAClB,aAAO;AAAA,IACV;AAAA,IACD,OAAO,OAAO;AACV,aAAO,EAAE,MAAM,MAAM,KAAK,IAAI,CAAAxC,OAAKA,GAAE,OAAQ,CAAA,GAAG,QAAQ,MAAM,OAAO,IAAI,CAAAA,OAAKA,GAAE,OAAQ,CAAA;IAC3F;AAAA,IACD,SAAS,MAAM;AACX,aAAO,IAAI,aAAa,KAAK,KAAK,IAAI,UAAU,QAAQ,GAAG,KAAK,OAAO,IAAI,UAAU,QAAQ,CAAC;AAAA,IACjG;AAAA,EACL,CAAC;AAID,WAAS,QAAQ,SAAS,IAAI;AAC1B,WAAO;AAAA,MACH;AAAA,MACA,cAAc,GAAG,MAAM;AAAA,MACvB,WAAW,iBAAiB;AAAA,QACxB,YAAYA,IAAG,MAAM;AACjB,cAAI6F,WAAU7F,GAAE,aAAa,gBAAgB,OAAOA,GAAE,aAAa,gBAAgB,OAAO;AAC1F,cAAI,CAAC6F;AACD,mBAAO;AACX,UAAA7F,GAAE,eAAc;AAChB,iBAAO6F,SAAQ,IAAI;AAAA,QACtB;AAAA,MACb,CAAS;AAAA,IACT;AAAA,EACA;AASA,WAAS,IAAI,MAAM,WAAW;AAC1B,WAAO,SAAU,EAAE,OAAO,YAAY;AAClC,UAAI,CAAC,aAAa,MAAM;AACpB,eAAO;AACX,UAAI,eAAe,MAAM,MAAM,eAAe,KAAK;AACnD,UAAI,CAAC;AACD,eAAO;AACX,UAAI,KAAK,aAAa,IAAI,MAAM,OAAO,SAAS;AAChD,UAAI,CAAC;AACD,eAAO;AACX,eAAS,EAAE;AACX,aAAO;AAAA,IACf;AAAA,EACA;AAKA,QAAM,OAAoB,oBAAI,GAAyB,KAAK;AAK5D,QAAM,OAAoB,oBAAI,GAA2B,KAAK;AAI9D,QAAM,gBAA6B,oBAAI,GAAyB,IAAI;AAIpE,QAAM,gBAA6B,oBAAI,GAA2B,IAAI;AAAA,EAoBtE,MAAM,UAAU;AAAA,IACZ,YAMA,SAEA,SAGA,QAEA,gBAGA,iBAAiB;AACb,WAAK,UAAU;AACf,WAAK,UAAU;AACf,WAAK,SAAS;AACd,WAAK,iBAAiB;AACtB,WAAK,kBAAkB;AAAA,IAC1B;AAAA,IACD,YAAY,OAAO;AACf,aAAO,IAAI,UAAU,KAAK,SAAS,KAAK,SAAS,KAAK,QAAQ,KAAK,gBAAgB,KAAK;AAAA,IAC3F;AAAA,IACD,SAAS;AACL,UAAIxE,KAAI+D,KAAI;AACZ,aAAO;AAAA,QACH,UAAU/D,MAAK,KAAK,aAAa,QAAQA,QAAO,SAAS,SAASA,IAAG,OAAQ;AAAA,QAC7E,SAAS+D,MAAK,KAAK,YAAY,QAAQA,QAAO,SAAS,SAASA,IAAG,OAAQ;AAAA,QAC3E,iBAAiB,KAAK,KAAK,oBAAoB,QAAQ,OAAO,SAAS,SAAS,GAAG,OAAQ;AAAA,QAC3F,iBAAiB,KAAK,gBAAgB,IAAI,CAAAzE,OAAKA,GAAE,QAAQ;AAAA,MACrE;AAAA,IACK;AAAA,IACD,OAAO,SAAS,MAAM;AAClB,aAAO,IAAI,UAAU,KAAK,WAAW,UAAU,SAAS,KAAK,OAAO,GAAG,CAAA,GAAI,KAAK,UAAU,WAAW,SAAS,KAAK,MAAM,GAAG,KAAK,kBAAkB,gBAAgB,SAAS,KAAK,cAAc,GAAG,KAAK,gBAAgB,IAAI,gBAAgB,QAAQ,CAAC;AAAA,IACvP;AAAA;AAAA;AAAA;AAAA,IAID,OAAO,gBAAgB,IAAI,WAAW;AAClC,UAAI,UAAU;AACd,eAAS,UAAU,GAAG,WAAW,MAAM,eAAe,GAAG;AACrD,YAAI,SAAS,OAAO,EAAE;AACtB,YAAI,OAAO;AACP,oBAAU,QAAQ,OAAO,MAAM;AAAA,MACtC;AACD,UAAI,CAAC,QAAQ,UAAU,GAAG,QAAQ;AAC9B,eAAO;AACX,aAAO,IAAI,UAAU,GAAG,QAAQ,OAAO,GAAG,WAAW,GAAG,GAAG,SAAS,QAAW,aAAa,GAAG,WAAW,WAAW,IAAI;AAAA,IAC5H;AAAA,IACD,OAAO,UAAU,YAAY;AACzB,aAAO,IAAI,UAAU,QAAW,MAAM,QAAW,QAAW,UAAU;AAAA,IACzE;AAAA,EACL;AACA,WAAS,aAAa,QAAQ,IAAI,QAAQ,UAAU;AAChD,QAAI,QAAQ,KAAK,IAAI,SAAS,KAAK,KAAK,SAAS,IAAI;AACrD,QAAI,YAAY,OAAO,MAAM,OAAO,EAAE;AACtC,cAAU,KAAK,QAAQ;AACvB,WAAO;AAAA,EACX;AACA,WAAS,WAAWb,IAAGsB,IAAG;AACtB,QAAI,SAAS,CAAA,GAAI4N,cAAa;AAC9B,IAAAlP,GAAE,kBAAkB,CAACuC,IAAGY,OAAM,OAAO,KAAKZ,IAAGY,EAAC,CAAC;AAC/C,IAAA7B,GAAE,kBAAkB,CAAC4E,KAAI,IAAI3D,IAAGY,OAAM;AAClC,eAAS9C,KAAI,GAAGA,KAAI,OAAO,UAAS;AAChC,YAAI,OAAO,OAAOA,IAAG,GAAG,KAAK,OAAOA,IAAG;AACvC,YAAI8C,MAAK,QAAQZ,MAAK;AAClB,UAAA2M,cAAa;AAAA,MACpB;AAAA,IACT,CAAK;AACD,WAAOA;AAAA,EACX;AACA,WAAS,iBAAiBlP,IAAGsB,IAAG;AAC5B,WAAOtB,GAAE,OAAO,UAAUsB,GAAE,OAAO,UAC/BtB,GAAE,OAAO,OAAO,CAACwB,IAAGnB,OAAMmB,GAAE,SAASF,GAAE,OAAOjB,EAAC,EAAE,KAAK,EAAE,WAAW;AAAA,EAC3E;AACA,WAAS,KAAKL,IAAGsB,IAAG;AAChB,WAAO,CAACtB,GAAE,SAASsB,KAAI,CAACA,GAAE,SAAStB,KAAIA,GAAE,OAAOsB,EAAC;AAAA,EACrD;AACA,QAAM,OAAO,CAAA;AACb,QAAM,wBAAwB;AAC9B,WAAS,aAAa,QAAQ,WAAW;AACrC,QAAI,CAAC,OAAO,QAAQ;AAChB,aAAO,CAAC,UAAU,UAAU,CAAC,SAAS,CAAC,CAAC;AAAA,IAC3C,OACI;AACD,UAAI,YAAY,OAAO,OAAO,SAAS,CAAC;AACxC,UAAI,OAAO,UAAU,gBAAgB,MAAM,KAAK,IAAI,GAAG,UAAU,gBAAgB,SAAS,qBAAqB,CAAC;AAChH,UAAI,KAAK,UAAU,KAAK,KAAK,SAAS,CAAC,EAAE,GAAG,SAAS;AACjD,eAAO;AACX,WAAK,KAAK,SAAS;AACnB,aAAO,aAAa,QAAQ,OAAO,SAAS,GAAG,KAAK,UAAU,YAAY,IAAI,CAAC;AAAA,IAClF;AAAA,EACL;AAEA,WAAS,aAAa,QAAQ;AAC1B,QAAI,OAAO,OAAO,OAAO,SAAS,CAAC;AACnC,QAAI,YAAY,OAAO;AACvB,cAAU,OAAO,SAAS,CAAC,IAAI,KAAK,YAAY,KAAK,gBAAgB,MAAM,GAAG,KAAK,gBAAgB,SAAS,CAAC,CAAC;AAC9G,WAAO;AAAA,EACX;AAIA,WAAS,mBAAmB,QAAQ,SAAS;AACzC,QAAI,CAAC,OAAO;AACR,aAAO;AACX,QAAI,SAAS,OAAO,QAAQ,aAAa;AACzC,WAAO,QAAQ;AACX,UAAI,QAAQ,SAAS,OAAO,SAAS,CAAC,GAAG,SAAS,UAAU;AAC5D,UAAI,MAAM,WAAW,CAAC,MAAM,QAAQ,SAAS,MAAM,QAAQ,QAAQ;AAC/D,YAAI,SAAS,OAAO,MAAM,GAAG,MAAM;AACnC,eAAO,SAAS,CAAC,IAAI;AACrB,eAAO;AAAA,MACV,OACI;AACD,kBAAU,MAAM;AAChB;AACA,qBAAa,MAAM;AAAA,MACtB;AAAA,IACJ;AACD,WAAO,WAAW,SAAS,CAAC,UAAU,UAAU,UAAU,CAAC,IAAI;AAAA,EACnE;AACA,WAAS,SAAS,OAAO,SAAS,iBAAiB;AAC/C,QAAI,aAAa,KAAK,MAAM,gBAAgB,SAAS,MAAM,gBAAgB,IAAI,CAAAT,OAAKA,GAAE,IAAI,OAAO,CAAC,IAAI,MAAM,eAAe;AAE3H,QAAI,CAAC,MAAM;AACP,aAAO,UAAU,UAAU,UAAU;AACzC,QAAI,gBAAgB,MAAM,QAAQ,IAAI,OAAO,GAAG,SAAS,QAAQ,QAAQ,MAAM,SAAS,IAAI;AAC5F,QAAI,cAAc,MAAM,SAAS,MAAM,OAAO,YAAY,MAAM,IAAI;AACpE,WAAO,IAAI,UAAU,eAAe,YAAY,WAAW,MAAM,SAAS,OAAO,GAAG,aAAa,MAAM,eAAe,IAAI,MAAM,GAAG,UAAU;AAAA,EACjJ;AACA,QAAM,oBAAoB;AAAA,EAC1B,MAAM,aAAa;AAAA,IACf,YAAY,MAAM,QAAQ,WAAW,GAAG,gBAAgB,QAAW;AAC/D,WAAK,OAAO;AACZ,WAAK,SAAS;AACd,WAAK,WAAW;AAChB,WAAK,gBAAgB;AAAA,IACxB;AAAA,IACD,UAAU;AACN,aAAO,KAAK,WAAW,IAAI,aAAa,KAAK,MAAM,KAAK,MAAM,IAAI;AAAA,IACrE;AAAA,IACD,WAAW,OAAO,MAAM,WAAW,eAAe,QAAQ;AACtD,UAAI,OAAO,KAAK,MAAM,YAAY,KAAK,KAAK,SAAS,CAAC;AACtD,UAAI,aAAa,UAAU,WAAW,CAAC,UAAU,QAAQ,SAAS,MAAM,YACnE,CAAC,aAAa,kBAAkB,KAAK,SAAS,OAC7C,CAAC,UAAU,gBAAgB,UACzB,OAAO,KAAK,WAAW,iBACvB,WAAW,UAAU,SAAS,MAAM,OAAO;AAAA,MAE3C,aAAa,uBAAuB;AACxC,eAAO,aAAa,MAAM,KAAK,SAAS,GAAG,QAAQ,IAAI,UAAU,MAAM,QAAQ,QAAQ,UAAU,OAAO,GAAG,KAAK,MAAM,SAAS,UAAU,OAAO,GAAG,UAAU,QAAQ,UAAU,gBAAgB,IAAI,CAAC;AAAA,MACvM,OACI;AACD,eAAO,aAAa,MAAM,KAAK,QAAQ,QAAQ,KAAK;AAAA,MACvD;AACD,aAAO,IAAI,aAAa,MAAM,MAAM,MAAM,SAAS;AAAA,IACtD;AAAA,IACD,aAAa,WAAW,MAAM,WAAW,eAAe;AACpD,UAAI,OAAO,KAAK,KAAK,SAAS,KAAK,KAAK,KAAK,KAAK,SAAS,CAAC,EAAE,kBAAkB;AAChF,UAAI,KAAK,SAAS,KACd,OAAO,KAAK,WAAW,iBACvB,aAAa,KAAK,iBAAiB,aAAa,gBAAgB,KAAK,SAAS,KAC9E,iBAAiB,KAAK,KAAK,SAAS,CAAC,GAAG,SAAS;AACjD,eAAO;AACX,aAAO,IAAI,aAAa,aAAa,KAAK,MAAM,SAAS,GAAG,KAAK,QAAQ,MAAM,SAAS;AAAA,IAC3F;AAAA,IACD,WAAW,SAAS;AAChB,aAAO,IAAI,aAAa,mBAAmB,KAAK,MAAM,OAAO,GAAG,mBAAmB,KAAK,QAAQ,OAAO,GAAG,KAAK,UAAU,KAAK,aAAa;AAAA,IAC9I;AAAA,IACD,IAAI,MAAM,OAAO,WAAW;AACxB,UAAI,SAAS,QAAQ,IAA0B,KAAK,OAAO,KAAK;AAChE,UAAI,OAAO,UAAU;AACjB,eAAO;AACX,UAAI,QAAQ,OAAO,OAAO,SAAS,CAAC;AACpC,UAAI,aAAa,MAAM,gBAAgB,QAAQ;AAC3C,eAAO,MAAM,OAAO;AAAA,UAChB,WAAW,MAAM,gBAAgB,MAAM,gBAAgB,SAAS,CAAC;AAAA,UACjE,aAAa,YAAY,GAAG,EAAE,MAAM,MAAM,aAAa,MAAM,GAAG;AAAA,UAChE,WAAW,QAAQ,IAA0B,gBAAgB;AAAA,UAC7D,gBAAgB;AAAA,QAChC,CAAa;AAAA,MACJ,WACQ,CAAC,MAAM,SAAS;AACrB,eAAO;AAAA,MACV,OACI;AACD,YAAI,OAAO,OAAO,UAAU,IAAI,OAAO,OAAO,MAAM,GAAG,OAAO,SAAS,CAAC;AACxE,YAAI,MAAM;AACN,iBAAO,mBAAmB,MAAM,MAAM,MAAM;AAChD,eAAO,MAAM,OAAO;AAAA,UAChB,SAAS,MAAM;AAAA,UACf,WAAW,MAAM;AAAA,UACjB,SAAS,MAAM;AAAA,UACf,aAAa,YAAY,GAAG,EAAE,MAAM,KAAI,CAAE;AAAA,UAC1C,QAAQ;AAAA,UACR,WAAW,QAAQ,IAA0B,SAAS;AAAA,UACtD,gBAAgB;AAAA,QAChC,CAAa;AAAA,MACJ;AAAA,IACJ;AAAA,EACL;AACA,eAAa,QAAqB,oBAAI,aAAa,MAAM,IAAI;AAS7D,QAAM,gBAAgB;AAAA,IAClB,EAAE,KAAK,SAAS,KAAK,MAAM,gBAAgB,KAAM;AAAA,IACjD,EAAE,KAAK,SAAS,KAAK,eAAe,KAAK,MAAM,gBAAgB,KAAM;AAAA,IACrE,EAAE,OAAO,gBAAgB,KAAK,MAAM,gBAAgB,KAAM;AAAA,IAC1D,EAAE,KAAK,SAAS,KAAK,eAAe,gBAAgB,KAAM;AAAA,IAC1D,EAAE,KAAK,SAAS,KAAK,eAAe,KAAK,eAAe,gBAAgB,KAAM;AAAA,EAClF;AAEA,WAAS,UAAU,KAAK,IAAI;AACxB,WAAO,gBAAgB,OAAO,IAAI,OAAO,IAAI,EAAE,GAAG,IAAI,SAAS;AAAA,EACnE;AACA,WAAS,OAAO,OAAO,WAAW;AAC9B,WAAO,MAAM,OAAO,EAAE,WAAW,gBAAgB,MAAM,WAAW,SAAQ,CAAE;AAAA,EAChF;AACA,WAAS,QAAQ,EAAE,OAAO,SAAQ,GAAI,KAAK;AACvC,QAAI,YAAY,UAAU,MAAM,WAAW,GAAG;AAC9C,QAAI,UAAU,GAAG,MAAM,SAAS;AAC5B,aAAO;AACX,aAAS,OAAO,OAAO,SAAS,CAAC;AACjC,WAAO;AAAA,EACX;AACA,WAAS,SAAS,OAAO,SAAS;AAC9B,WAAO,gBAAgB,OAAO,UAAU,MAAM,KAAK,MAAM,IAAI;AAAA,EACjE;AACA,WAAS,aAAa,MAAM,SAAS;AACjC,WAAO,QAAQ,MAAM,WAAS,MAAM,QAAQ,KAAK,WAAW,OAAO,OAAO,IAAI,SAAS,OAAO,OAAO,CAAC;AAAA,EAC1G;AACA,WAAS,YAAY,MAAM;AACvB,WAAO,KAAK,gBAAgB,KAAK,MAAM,UAAU,KAAK,IAAI,KAAK,UAAU;AAAA,EAC7E;AAKA,QAAM,iBAAiB,UAAQ,aAAa,MAAM,CAAC,YAAY,IAAI,CAAC;AAIpE,QAAM,kBAAkB,UAAQ,aAAa,MAAM,YAAY,IAAI,CAAC;AASpE,WAAS,cAAc,MAAM,SAAS;AAClC,WAAO,QAAQ,MAAM,WAAS,MAAM,QAAQ,KAAK,YAAY,OAAO,OAAO,IAAI,SAAS,OAAO,OAAO,CAAC;AAAA,EAC3G;AAKA,QAAM,kBAAkB,UAAQ,cAAc,MAAM,CAAC,YAAY,IAAI,CAAC;AAItE,QAAM,mBAAmB,UAAQ,cAAc,MAAM,YAAY,IAAI,CAAC;AA0DtE,WAAS,gBAAgB,OAAO,MAAM,aAAa;AAC/C,QAAI,KAAK,KAAK,KAAK,WAAW;AAC1B,aAAO;AACX,QAAI,MAAM,KAAK,KAAK,KAAK;AACzB,WAAO,QAAQ,MAAM,KAAK,YAAY,KAAK,MAAM,SAAS,KAAK,MAAM,KAAK,EAAE,CAAC,MAAM,KAAK;AAAA,EAC5F;AACA,WAAS,aAAa,OAAO,OAAO,SAAS;AACzC,QAAI,MAAM,WAAW,KAAK,EAAE,aAAa,MAAM,IAAI;AACnD,QAAI,cAAc,UAAU,SAAS,WAAW,SAAS;AAGzD,aAAS,KAAK,MAAM,UAAQ;AACxB,UAAI,OAAO,UAAU,IAAI,WAAW,EAAE,IAAI,IAAI,YAAY,EAAE;AAC5D,UAAI,CAAC;AACD;AACJ,UAAI,gBAAgB,OAAO,MAAM,WAAW;AACxC,cAAM;AAAA;AAEN,aAAK,UAAU,KAAK,KAAK,KAAK;AAAA,IACrC;AACD,QAAIyF,WAAU,IAAI,KAAK,KAAK,WAAW,GAAG,OAAO;AACjD,QAAIA,aAAY,QAAQ,UAAU,cAAc,OAAO,IAAI,MAAM,CAAC,IAAI,cAAc,OAAO,IAAI,IAAI,EAAE,MAAM,MAAM;AAC7G,eAAS,UAAU,MAAM,IAAI,KAAK,MAAM,IAAI;AAAA;AAE5C,eAAS,UAAU,IAAI,KAAK,IAAI;AACpC,WAAO,gBAAgB,OAAO,QAAQ,UAAU,KAAK,CAAC;AAAA,EAC1D;AAIA,QAAM,mBAAmB,UAAQ,QAAQ,MAAM,WAAS,aAAa,KAAK,OAAO,OAAO,CAAC,YAAY,IAAI,CAAC,CAAC;AAI3G,QAAM,oBAAoB,UAAQ,QAAQ,MAAM,WAAS,aAAa,KAAK,OAAO,OAAO,YAAY,IAAI,CAAC,CAAC;AAC3G,WAAS,aAAa,MAAM,SAAS;AACjC,WAAO,QAAQ,MAAM,WAAS;AAC1B,UAAI,CAAC,MAAM;AACP,eAAO,SAAS,OAAO,OAAO;AAClC,UAAI,QAAQ,KAAK,eAAe,OAAO,OAAO;AAC9C,aAAO,MAAM,QAAQ,MAAM,OAAO,QAAQ,KAAK,mBAAmB,OAAO,OAAO;AAAA,IACxF,CAAK;AAAA,EACL;AAIA,QAAM,eAAe,UAAQ,aAAa,MAAM,KAAK;AAIrD,QAAM,iBAAiB,UAAQ,aAAa,MAAM,IAAI;AACtD,WAAS,WAAW,MAAM;AACtB,WAAO,KAAK,IAAI,KAAK,mBAAmB,KAAK,IAAI,KAAK,IAAI,cAAc,WAAW,IAAI,CAAC;AAAA,EAC5F;AACA,WAAS,aAAa,MAAM,SAAS;AACjC,QAAI,EAAE,MAAO,IAAG,MAAM,YAAY,UAAU,MAAM,WAAW,WAAS;AAClE,aAAO,MAAM,QAAQ,KAAK,eAAe,OAAO,SAAS,WAAW,IAAI,CAAC,IAAI,SAAS,OAAO,OAAO;AAAA,IAC5G,CAAK;AACD,QAAI,UAAU,GAAG,MAAM,SAAS;AAC5B,aAAO;AACX,QAAI,WAAW,KAAK,YAAY,MAAM,UAAU,KAAK,IAAI;AACzD,QAAI,aAAa,KAAK,UAAU,sBAAqB;AACrD,QAAI;AACJ,QAAI,YAAY,SAAS,MAAM,WAAW,OAAO,SAAS,SAAS,WAAW,UAC1E,SAAS,MAAM,WAAW,OAAO,KAAK,UAAU,eAAe,KAAK,UAAU,YAAY,KAAK,UAAU;AACzG,eAAS,WAAW,eAAe,UAAU,KAAK,MAAM,EAAE,GAAG,SAAS,SAAS,SAAS,MAAM,WAAW,IAAK,CAAA;AAClH,SAAK,SAAS,OAAO,OAAO,SAAS,GAAG,EAAE,SAAS,OAAM,CAAE;AAC3D,WAAO;AAAA,EACX;AAIA,QAAM,eAAe,UAAQ,aAAa,MAAM,KAAK;AAIrD,QAAM,iBAAiB,UAAQ,aAAa,MAAM,IAAI;AACtD,WAAS,mBAAmB,MAAM,OAAO,SAAS;AAC9C,QAAI,OAAO,KAAK,YAAY,MAAM,IAAI,GAAG,QAAQ,KAAK,mBAAmB,OAAO,OAAO;AACvF,QAAI,MAAM,QAAQ,MAAM,QAAQ,MAAM,SAAS,UAAU,KAAK,KAAK,KAAK;AACpE,cAAQ,KAAK,mBAAmB,OAAO,SAAS,KAAK;AACzD,QAAI,CAAC,WAAW,MAAM,QAAQ,KAAK,QAAQ,KAAK,QAAQ;AACpD,UAAI,QAAQ,OAAO,KAAK,KAAK,MAAM,SAAS,KAAK,MAAM,KAAK,IAAI,KAAK,OAAO,KAAK,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE;AAC/F,UAAI,SAAS,MAAM,QAAQ,KAAK,OAAO;AACnC,gBAAQ,gBAAgB,OAAO,KAAK,OAAO,KAAK;AAAA,IACvD;AACD,WAAO;AAAA,EACX;AAKA,QAAM,4BAA4B,UAAQ,QAAQ,MAAM,WAAS,mBAAmB,MAAM,OAAO,IAAI,CAAC;AAOtG,QAAM,6BAA6B,UAAQ,QAAQ,MAAM,WAAS,mBAAmB,MAAM,OAAO,KAAK,CAAC;AAIxG,QAAM,yBAAyB,UAAQ,QAAQ,MAAM,WAAS,mBAAmB,MAAM,OAAO,CAAC,YAAY,IAAI,CAAC,CAAC;AAIjH,QAAM,0BAA0B,UAAQ,QAAQ,MAAM,WAAS,mBAAmB,MAAM,OAAO,YAAY,IAAI,CAAC,CAAC;AAIjH,QAAM,kBAAkB,UAAQ,QAAQ,MAAM,WAAS,gBAAgB,OAAO,KAAK,YAAY,MAAM,IAAI,EAAE,MAAM,CAAC,CAAC;AAInH,QAAM,gBAAgB,UAAQ,QAAQ,MAAM,WAAS,gBAAgB,OAAO,KAAK,YAAY,MAAM,IAAI,EAAE,IAAI,EAAE,CAAC;AAChH,WAAS,kBAAkB,OAAO,UAAUb,SAAQ;AAChD,QAAI,QAAQ,OAAO,YAAY,UAAU,MAAM,WAAW,WAAS;AAC/D,UAAI,WAAW,cAAc,OAAO,MAAM,MAAM,EAAE,KAC3C,cAAc,OAAO,MAAM,MAAM,CAAC,KACjC,MAAM,OAAO,KAAK,cAAc,OAAO,MAAM,OAAO,GAAG,CAAC,KACxD,MAAM,OAAO,MAAM,IAAI,UAAU,cAAc,OAAO,MAAM,OAAO,GAAG,EAAE;AAChF,UAAI,CAAC,YAAY,CAAC,SAAS;AACvB,eAAO;AACX,cAAQ;AACR,UAAI,OAAO,SAAS,MAAM,QAAQ,MAAM,OAAO,SAAS,IAAI,KAAK,SAAS,IAAI;AAC9E,aAAOA,UAAS,gBAAgB,MAAM,MAAM,QAAQ,IAAI,IAAI,gBAAgB,OAAO,IAAI;AAAA,IAC/F,CAAK;AACD,QAAI,CAAC;AACD,aAAO;AACX,aAAS,OAAO,OAAO,SAAS,CAAC;AACjC,WAAO;AAAA,EACX;AAKA,QAAM,wBAAwB,CAAC,EAAE,OAAO,SAAQ,MAAO,kBAAkB,OAAO,UAAU,KAAK;AAM/F,WAAS,UAAU,MAAM,KAAK;AAC1B,QAAI,YAAY,UAAU,KAAK,MAAM,WAAW,WAAS;AACrD,UAAI,OAAO,IAAI,KAAK;AACpB,aAAO,gBAAgB,MAAM,MAAM,QAAQ,KAAK,MAAM,KAAK,UAAU;AAAA,IAC7E,CAAK;AACD,QAAI,UAAU,GAAG,KAAK,MAAM,SAAS;AACjC,aAAO;AACX,SAAK,SAAS,OAAO,KAAK,OAAO,SAAS,CAAC;AAC3C,WAAO;AAAA,EACX;AACA,WAAS,aAAa,MAAM,SAAS;AACjC,WAAO,UAAU,MAAM,WAAS,KAAK,WAAW,OAAO,OAAO,CAAC;AAAA,EACnE;AAKA,QAAM,iBAAiB,UAAQ,aAAa,MAAM,CAAC,YAAY,IAAI,CAAC;AAIpE,QAAM,kBAAkB,UAAQ,aAAa,MAAM,YAAY,IAAI,CAAC;AASpE,WAAS,cAAc,MAAM,SAAS;AAClC,WAAO,UAAU,MAAM,WAAS,KAAK,YAAY,OAAO,OAAO,CAAC;AAAA,EACpE;AAKA,QAAM,kBAAkB,UAAQ,cAAc,MAAM,CAAC,YAAY,IAAI,CAAC;AAItE,QAAM,mBAAmB,UAAQ,cAAc,MAAM,YAAY,IAAI,CAAC;AAuBtE,QAAM,mBAAmB,UAAQ,UAAU,MAAM,WAAS,aAAa,KAAK,OAAO,OAAO,CAAC,YAAY,IAAI,CAAC,CAAC;AAI7G,QAAM,oBAAoB,UAAQ,UAAU,MAAM,WAAS,aAAa,KAAK,OAAO,OAAO,YAAY,IAAI,CAAC,CAAC;AAC7G,WAAS,aAAa,MAAM,SAAS;AACjC,WAAO,UAAU,MAAM,WAAS,KAAK,eAAe,OAAO,OAAO,CAAC;AAAA,EACvE;AAIA,QAAM,eAAe,UAAQ,aAAa,MAAM,KAAK;AAIrD,QAAM,iBAAiB,UAAQ,aAAa,MAAM,IAAI;AACtD,WAAS,aAAa,MAAM,SAAS;AACjC,WAAO,UAAU,MAAM,WAAS,KAAK,eAAe,OAAO,SAAS,WAAW,IAAI,CAAC,CAAC;AAAA,EACzF;AAIA,QAAM,eAAe,UAAQ,aAAa,MAAM,KAAK;AAIrD,QAAM,iBAAiB,UAAQ,aAAa,MAAM,IAAI;AAItD,QAAM,4BAA4B,UAAQ,UAAU,MAAM,WAAS,mBAAmB,MAAM,OAAO,IAAI,CAAC;AAIxG,QAAM,6BAA6B,UAAQ,UAAU,MAAM,WAAS,mBAAmB,MAAM,OAAO,KAAK,CAAC;AAI1G,QAAM,yBAAyB,UAAQ,UAAU,MAAM,WAAS,mBAAmB,MAAM,OAAO,CAAC,YAAY,IAAI,CAAC,CAAC;AAInH,QAAM,0BAA0B,UAAQ,UAAU,MAAM,WAAS,mBAAmB,MAAM,OAAO,YAAY,IAAI,CAAC,CAAC;AAInH,QAAM,kBAAkB,UAAQ,UAAU,MAAM,WAAS,gBAAgB,OAAO,KAAK,YAAY,MAAM,IAAI,EAAE,IAAI,CAAC;AAIlH,QAAM,gBAAgB,UAAQ,UAAU,MAAM,WAAS,gBAAgB,OAAO,KAAK,YAAY,MAAM,IAAI,EAAE,EAAE,CAAC;AAI9G,QAAM,iBAAiB,CAAC,EAAE,OAAO,eAAe;AAC5C,aAAS,OAAO,OAAO,EAAE,QAAQ,EAAG,CAAA,CAAC;AACrC,WAAO;AAAA,EACX;AAIA,QAAM,eAAe,CAAC,EAAE,OAAO,eAAe;AAC1C,aAAS,OAAO,OAAO,EAAE,QAAQ,MAAM,IAAI,OAAQ,CAAA,CAAC;AACpD,WAAO;AAAA,EACX;AAIA,QAAM,iBAAiB,CAAC,EAAE,OAAO,eAAe;AAC5C,aAAS,OAAO,OAAO,EAAE,QAAQ,MAAM,UAAU,KAAK,QAAQ,MAAM,EAAC,CAAE,CAAC;AACxE,WAAO;AAAA,EACX;AAIA,QAAM,eAAe,CAAC,EAAE,OAAO,eAAe;AAC1C,aAAS,OAAO,OAAO,EAAE,QAAQ,MAAM,UAAU,KAAK,QAAQ,MAAM,MAAM,IAAI,OAAM,CAAE,CAAC;AACvF,WAAO;AAAA,EACX;AAIA,QAAM,YAAY,CAAC,EAAE,OAAO,eAAe;AACvC,aAAS,MAAM,OAAO,EAAE,WAAW,EAAE,QAAQ,GAAG,MAAM,MAAM,IAAI,OAAM,GAAI,WAAW,SAAU,CAAA,CAAC;AAChG,WAAO;AAAA,EACX;AAIA,QAAM,aAAa,CAAC,EAAE,OAAO,eAAe;AACxC,QAAI,SAAS,mBAAmB,KAAK,EAAE,IAAI,CAAC,EAAE,MAAM,GAAE,MAAO,gBAAgB,MAAM,MAAM,KAAK,IAAI,KAAK,GAAG,MAAM,IAAI,MAAM,CAAC,CAAC;AAC5H,aAAS,MAAM,OAAO,EAAE,WAAW,gBAAgB,OAAO,MAAM,GAAG,WAAW,SAAQ,CAAE,CAAC;AACzF,WAAO;AAAA,EACX;AAOA,QAAM,qBAAqB,CAAC,EAAE,OAAO,eAAe;AAChD,QAAI,YAAY,UAAU,MAAM,WAAW,WAAS;AAChD,UAAIlE;AACJ,UAAI,UAAU,WAAW,KAAK,EAAE,aAAa,MAAM,MAAM,CAAC;AAC1D,aAAO,EAAG,QAAQ,OAAO,MAAM,QAAQ,QAAQ,MAAM,MAAM,MACtD,QAAQ,KAAK,MAAM,MAAM,QAAQ,QAAQ,MAAM,QAChD,GAAGA,MAAK,QAAQ,YAAY,QAAQA,QAAO,SAAS,SAASA,IAAG;AAChE,kBAAU,QAAQ;AACtB,aAAO,gBAAgB,MAAM,QAAQ,IAAI,QAAQ,IAAI;AAAA,IAC7D,CAAK;AACD,aAAS,OAAO,OAAO,SAAS,CAAC;AACjC,WAAO;AAAA,EACX;AAMA,QAAM,oBAAoB,CAAC,EAAE,OAAO,eAAe;AAC/C,QAAI,MAAM,MAAM,WAAW,YAAY;AACvC,QAAI,IAAI,OAAO,SAAS;AACpB,kBAAY,gBAAgB,OAAO,CAAC,IAAI,IAAI,CAAC;AAAA,aACxC,CAAC,IAAI,KAAK;AACf,kBAAY,gBAAgB,OAAO,CAAC,gBAAgB,OAAO,IAAI,KAAK,IAAI,CAAC,CAAC;AAC9E,QAAI,CAAC;AACD,aAAO;AACX,aAAS,OAAO,OAAO,SAAS,CAAC;AACjC,WAAO;AAAA,EACX;AACA,WAAS,SAAS,QAAQ,IAAI;AAC1B,QAAI,OAAO,MAAM;AACb,aAAO;AACX,QAAI,QAAQ,oBAAoB,EAAE,MAAK,IAAK;AAC5C,QAAI,UAAU,MAAM,cAAc,WAAS;AACvC,UAAI,EAAE,MAAM,GAAI,IAAG;AACnB,UAAI,QAAQ,IAAI;AACZ,YAAI,UAAU,GAAG,IAAI;AACrB,YAAI,UAAU,MAAM;AAChB,kBAAQ;AACR,oBAAU,WAAW,QAAQ,SAAS,KAAK;AAAA,QAC9C,WACQ,UAAU,MAAM;AACrB,kBAAQ;AACR,oBAAU,WAAW,QAAQ,SAAS,IAAI;AAAA,QAC7C;AACD,eAAO,KAAK,IAAI,MAAM,OAAO;AAC7B,aAAK,KAAK,IAAI,IAAI,OAAO;AAAA,MAC5B,OACI;AACD,eAAO,WAAW,QAAQ,MAAM,KAAK;AACrC,aAAK,WAAW,QAAQ,IAAI,IAAI;AAAA,MACnC;AACD,aAAO,QAAQ,KAAK,EAAE,MAAO,IAAG,EAAE,SAAS,EAAE,MAAM,GAAE,GAAI,OAAO,gBAAgB,OAAO,IAAI,EAAC;AAAA,IACpG,CAAK;AACD,QAAI,QAAQ,QAAQ;AAChB,aAAO;AACX,WAAO,SAAS,MAAM,OAAO,SAAS;AAAA,MAClC,gBAAgB;AAAA,MAChB,WAAW;AAAA,MACX,SAAS,SAAS,qBAAqB,WAAW,SAAS,GAAG,MAAM,OAAO,mBAAmB,CAAC,IAAI;AAAA,IACtG,CAAA,CAAC;AACF,WAAO;AAAA,EACX;AACA,WAAS,WAAW,QAAQ,KAAK,SAAS;AACtC,QAAI,kBAAkB;AAClB,eAAS,UAAU,OAAO,MAAM,MAAM,WAAW,YAAY,EAAE,IAAI,CAAAgB,OAAKA,GAAE,MAAM,CAAC;AAC7E,eAAO,QAAQ,KAAK,KAAK,CAAC,MAAM,OAAO;AACnC,cAAI,OAAO,OAAO,KAAK;AACnB,kBAAM,UAAU,KAAK;AAAA,QACzC,CAAa;AACT,WAAO;AAAA,EACX;AACA,QAAM,eAAe,CAAC,QAAQ,YAAY,SAAS,QAAQ,SAAO;AAC9D,QAAI,EAAE,MAAK,IAAK,QAAQ,OAAO,MAAM,IAAI,OAAO,GAAG,GAAG,QAAQ;AAC9D,QAAI,CAAC,WAAW,MAAM,KAAK,QAAQ,MAAM,KAAK,OAAO,OACjD,CAAC,SAAS,KAAK,SAAS,KAAK,KAAK,MAAM,GAAG,MAAM,KAAK,IAAI,CAAC,GAAG;AAC9D,UAAI,OAAO,OAAO,SAAS,CAAC,KAAK;AAC7B,eAAO,MAAM;AACjB,UAAI,MAAM,YAAY,QAAQ,MAAM,OAAO,GAAG,OAAO,MAAM,cAAc,KAAK,KAAK,cAAc,KAAK;AACtG,eAASlC,KAAI,GAAGA,KAAI,QAAQ,OAAO,OAAO,SAAS,IAAIA,EAAC,KAAK,KAAKA;AAC9D;AACJ,kBAAY;AAAA,IACf,OACI;AACD,kBAAY,iBAAiB,KAAK,MAAM,MAAM,KAAK,MAAM,SAAS,OAAO,IAAI,KAAK;AAClF,UAAI,aAAa,OAAO,KAAK,WAAW,UAAU,MAAM,IAAI,QAAQ;AAChE,qBAAa,UAAU,IAAI;AAAA,IAClC;AACD,WAAO;AAAA,EACX,CAAC;AAKD,QAAM,qBAAqB,UAAQ,aAAa,MAAM,KAAK;AAI3D,QAAM,oBAAoB,UAAQ,aAAa,MAAM,IAAI;AACzD,QAAM,gBAAgB,CAAC,QAAQ,YAAY,SAAS,QAAQ,WAAS;AACjE,QAAI,MAAM,OAAO,EAAE,UAAU,QAAQ,OAAO,MAAM,IAAI,OAAO,GAAG;AAChE,QAAI,aAAa,MAAM,gBAAgB,GAAG;AAC1C,aAAS,MAAM,UAAQ;AACnB,UAAI,QAAQ,UAAU,KAAK,KAAK,KAAK,OAAO;AACxC,YAAI,OAAO,SAAS,KAAK,WAAW,UAAU,MAAM,IAAI,QAAQ;AAC5D,iBAAO,UAAU,IAAI;AACzB;AAAA,MACH;AACD,UAAI,OAAO,iBAAiB,KAAK,MAAM,MAAM,KAAK,MAAM,OAAO,IAAI,KAAK;AACxE,UAAI,WAAW,KAAK,KAAK,MAAM,KAAK,IAAI,KAAK,IAAI,IAAI,KAAK,MAAM,KAAK,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI;AAC/F,UAAI,UAAU,WAAW,QAAQ;AACjC,UAAI,OAAO,QAAQ,WAAW;AAC1B;AACJ,UAAI,YAAY,OAAO,OAAO;AAC1B,cAAM;AACV,YAAM;AAAA,IACT;AACD,WAAO;AAAA,EACX,CAAC;AAMD,QAAM,sBAAsB,YAAU,cAAc,QAAQ,KAAK;AAIjE,QAAM,qBAAqB,YAAU,cAAc,QAAQ,IAAI;AAM/D,QAAM,kBAAkB,UAAQ,SAAS,MAAM,SAAO;AAClD,QAAI,UAAU,KAAK,YAAY,GAAG,EAAE;AACpC,WAAO,MAAM,UAAU,UAAU,KAAK,IAAI,KAAK,MAAM,IAAI,QAAQ,MAAM,CAAC;AAAA,EAC5E,CAAC;AAMD,QAAM,oBAAoB,UAAQ,SAAS,MAAM,SAAO;AACpD,QAAI,YAAY,KAAK,YAAY,GAAG,EAAE;AACtC,WAAO,MAAM,YAAY,YAAY,KAAK,IAAI,GAAG,MAAM,CAAC;AAAA,EAC5D,CAAC;AAiCD,QAAM,YAAY,CAAC,EAAE,OAAO,eAAe;AACvC,QAAI,MAAM;AACN,aAAO;AACX,QAAI,UAAU,MAAM,cAAc,WAAS;AACvC,aAAO;AAAA,QAAE,SAAS,EAAE,MAAM,MAAM,MAAM,IAAI,MAAM,IAAI,QAAQ,KAAK,GAAG,CAAC,IAAI,EAAE,CAAC,EAAG;AAAA,QAC3E,OAAO,gBAAgB,OAAO,MAAM,IAAI;AAAA,MAAC;AAAA,IACrD,CAAK;AACD,aAAS,MAAM,OAAO,SAAS,EAAE,gBAAgB,MAAM,WAAW,QAAS,CAAA,CAAC;AAC5E,WAAO;AAAA,EACX;AAIA,QAAM,iBAAiB,CAAC,EAAE,OAAO,eAAe;AAC5C,QAAI,MAAM;AACN,aAAO;AACX,QAAI,UAAU,MAAM,cAAc,WAAS;AACvC,UAAI,CAAC,MAAM,SAAS,MAAM,QAAQ,KAAK,MAAM,QAAQ,MAAM,IAAI;AAC3D,eAAO,EAAE,MAAK;AAClB,UAAI,MAAM,MAAM,MAAM,OAAO,MAAM,IAAI,OAAO,GAAG;AACjD,UAAI,OAAO,OAAO,KAAK,OAAO,MAAM,IAAI,iBAAiB,KAAK,MAAM,MAAM,KAAK,MAAM,KAAK,IAAI,KAAK;AACnG,UAAI,KAAK,OAAO,KAAK,KAAK,MAAM,IAAI,iBAAiB,KAAK,MAAM,MAAM,KAAK,MAAM,IAAI,IAAI,KAAK;AAC9F,aAAO;AAAA,QAAE,SAAS,EAAE,MAAM,IAAI,QAAQ,MAAM,IAAI,MAAM,KAAK,EAAE,EAAE,OAAO,MAAM,IAAI,MAAM,MAAM,GAAG,CAAC,EAAG;AAAA,QAC/F,OAAO,gBAAgB,OAAO,EAAE;AAAA,MAAC;AAAA,IAC7C,CAAK;AACD,QAAI,QAAQ,QAAQ;AAChB,aAAO;AACX,aAAS,MAAM,OAAO,SAAS,EAAE,gBAAgB,MAAM,WAAW,iBAAkB,CAAA,CAAC;AACrF,WAAO;AAAA,EACX;AACA,WAAS,mBAAmB,OAAO;AAC/B,QAAI,SAAS,CAAA,GAAI,OAAO;AACxB,aAAS,SAAS,MAAM,UAAU,QAAQ;AACtC,UAAI,YAAY,MAAM,IAAI,OAAO,MAAM,IAAI,GAAG,UAAU,MAAM,IAAI,OAAO,MAAM,EAAE;AACjF,UAAI,CAAC,MAAM,SAAS,MAAM,MAAM,QAAQ;AACpC,kBAAU,MAAM,IAAI,OAAO,MAAM,KAAK,CAAC;AAC3C,UAAI,QAAQ,UAAU,QAAQ;AAC1B,YAAI,OAAO,OAAO,OAAO,SAAS,CAAC;AACnC,aAAK,KAAK,QAAQ;AAClB,aAAK,OAAO,KAAK,KAAK;AAAA,MACzB,OACI;AACD,eAAO,KAAK,EAAE,MAAM,UAAU,MAAM,IAAI,QAAQ,IAAI,QAAQ,CAAC,KAAK,EAAG,CAAA;AAAA,MACxE;AACD,aAAO,QAAQ,SAAS;AAAA,IAC3B;AACD,WAAO;AAAA,EACX;AACA,WAAS,SAAS,OAAO,UAAU,SAAS;AACxC,QAAI,MAAM;AACN,aAAO;AACX,QAAI,UAAU,CAAA,GAAI,SAAS;AAC3B,aAAS,SAAS,mBAAmB,KAAK,GAAG;AACzC,UAAI,UAAU,MAAM,MAAM,MAAM,IAAI,SAAS,MAAM,QAAQ;AACvD;AACJ,UAAI,WAAW,MAAM,IAAI,OAAO,UAAU,MAAM,KAAK,IAAI,MAAM,OAAO,CAAC;AACvE,UAAI,OAAO,SAAS,SAAS;AAC7B,UAAI,SAAS;AACT,gBAAQ,KAAK,EAAE,MAAM,MAAM,IAAI,IAAI,SAAS,GAAI,GAAE,EAAE,MAAM,MAAM,MAAM,QAAQ,SAAS,OAAO,MAAM,UAAS,CAAE;AAC/G,iBAASmB,MAAK,MAAM;AAChB,iBAAO,KAAK,gBAAgB,MAAM,KAAK,IAAI,MAAM,IAAI,QAAQA,GAAE,SAAS,IAAI,GAAG,KAAK,IAAI,MAAM,IAAI,QAAQA,GAAE,OAAO,IAAI,CAAC,CAAC;AAAA,MAChI,OACI;AACD,gBAAQ,KAAK,EAAE,MAAM,SAAS,MAAM,IAAI,MAAM,KAAM,GAAE,EAAE,MAAM,MAAM,IAAI,QAAQ,MAAM,YAAY,SAAS,KAAI,CAAE;AACjH,iBAASA,MAAK,MAAM;AAChB,iBAAO,KAAK,gBAAgB,MAAMA,GAAE,SAAS,MAAMA,GAAE,OAAO,IAAI,CAAC;AAAA,MACxE;AAAA,IACJ;AACD,QAAI,CAAC,QAAQ;AACT,aAAO;AACX,aAAS,MAAM,OAAO;AAAA,MAClB;AAAA,MACA,gBAAgB;AAAA,MAChB,WAAW,gBAAgB,OAAO,QAAQ,MAAM,UAAU,SAAS;AAAA,MACnE,WAAW;AAAA,IACd,CAAA,CAAC;AACF,WAAO;AAAA,EACX;AAIA,QAAM,aAAa,CAAC,EAAE,OAAO,SAAQ,MAAO,SAAS,OAAO,UAAU,KAAK;AAI3E,QAAM,eAAe,CAAC,EAAE,OAAO,SAAQ,MAAO,SAAS,OAAO,UAAU,IAAI;AAC5E,WAAS,SAAS,OAAO,UAAU,SAAS;AACxC,QAAI,MAAM;AACN,aAAO;AACX,QAAI,UAAU,CAAA;AACd,aAAS,SAAS,mBAAmB,KAAK,GAAG;AACzC,UAAI;AACA,gBAAQ,KAAK,EAAE,MAAM,MAAM,MAAM,QAAQ,MAAM,IAAI,MAAM,MAAM,MAAM,MAAM,EAAE,IAAI,MAAM,UAAS,CAAE;AAAA;AAElG,gBAAQ,KAAK,EAAE,MAAM,MAAM,IAAI,QAAQ,MAAM,YAAY,MAAM,IAAI,MAAM,MAAM,MAAM,MAAM,EAAE,EAAC,CAAE;AAAA,IACvG;AACD,aAAS,MAAM,OAAO,EAAE,SAAS,gBAAgB,MAAM,WAAW,iBAAkB,CAAA,CAAC;AACrF,WAAO;AAAA,EACX;AAIA,QAAM,aAAa,CAAC,EAAE,OAAO,SAAQ,MAAO,SAAS,OAAO,UAAU,KAAK;AAI3E,QAAM,eAAe,CAAC,EAAE,OAAO,SAAQ,MAAO,SAAS,OAAO,UAAU,IAAI;AAI5E,QAAM,aAAa,UAAQ;AACvB,QAAI,KAAK,MAAM;AACX,aAAO;AACX,QAAI,EAAE,MAAO,IAAG,MAAM,UAAU,MAAM,QAAQ,mBAAmB,KAAK,EAAE,IAAI,CAAC,EAAE,MAAM,GAAE,MAAO;AAC1F,UAAI,OAAO;AACP;AAAA,eACK,KAAK,MAAM,IAAI;AACpB;AACJ,aAAO,EAAE,MAAM;IAClB,CAAA,CAAC;AACF,QAAI,YAAY,UAAU,MAAM,WAAW,WAAS,KAAK,eAAe,OAAO,IAAI,CAAC,EAAE,IAAI,OAAO;AACjG,SAAK,SAAS,EAAE,SAAS,WAAW,gBAAgB,MAAM,WAAW,cAAa,CAAE;AACpF,WAAO;AAAA,EACX;AAQA,WAAS,kBAAkB,OAAO,KAAK;AACnC,QAAI,iBAAiB,KAAK,MAAM,SAAS,MAAM,GAAG,MAAM,CAAC,CAAC;AACtD,aAAO,EAAE,MAAM,KAAK,IAAI,IAAG;AAC/B,QAAI,UAAU,WAAW,KAAK,EAAE,aAAa,GAAG;AAChD,QAAI,SAAS,QAAQ,YAAY,GAAG,GAAG,QAAQ,QAAQ,WAAW,GAAG,GAAG;AACxE,QAAI,UAAU,SAAS,OAAO,MAAM,OAAO,MAAM,QAAQ,QACpD,WAAW,OAAO,KAAK,KAAK,SAAS,QAAQ,MAAM,SAAS,QAAQ,MAAM,IAAI,IAAI,MACnF,MAAM,IAAI,OAAO,OAAO,EAAE,EAAE,QAAQ,MAAM,IAAI,OAAO,MAAM,IAAI,EAAE;AACjE,aAAO,EAAE,MAAM,OAAO,IAAI,IAAI,MAAM;AACxC,WAAO;AAAA,EACX;AAQA,QAAM,yBAAsC,iCAAiB,KAAK;AAIlE,QAAM,kBAA+B,iCAAiB,IAAI;AAC1D,WAAS,iBAAiB,OAAO;AAC7B,WAAO,CAAC,EAAE,OAAO,eAAe;AAC5B,UAAI,MAAM;AACN,eAAO;AACX,UAAI,UAAU,MAAM,cAAc,WAAS;AACvC,YAAI,EAAE,MAAM,GAAE,IAAK,OAAO,OAAO,MAAM,IAAI,OAAO,IAAI;AACtD,YAAI,UAAU,CAAC,SAAS,QAAQ,MAAM,kBAAkB,OAAO,IAAI;AACnE,YAAI;AACA,iBAAO,MAAM,MAAM,KAAK,KAAK,OAAO,MAAM,IAAI,OAAO,EAAE,GAAG;AAC9D,YAAI,KAAK,IAAI,cAAc,OAAO,EAAE,eAAe,MAAM,qBAAqB,CAAC,CAAC,QAAO,CAAE;AACzF,YAAI,SAAS,eAAe,IAAI,IAAI;AACpC,YAAI,UAAU;AACV,mBAAS,OAAO,KAAK,MAAM,IAAI,OAAO,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE;AACzD,eAAO,KAAK,KAAK,MAAM,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI,CAAC;AACtD;AACJ,YAAI;AACA,WAAC,EAAE,MAAM,GAAI,IAAG;AAAA,iBACX,OAAO,KAAK,QAAQ,OAAO,KAAK,OAAO,OAAO,CAAC,KAAK,KAAK,KAAK,KAAK,MAAM,GAAG,IAAI,CAAC;AACtF,iBAAO,KAAK;AAChB,YAAIyB,UAAS,CAAC,IAAI,aAAa,OAAO,MAAM,CAAC;AAC7C,YAAI;AACA,UAAAA,QAAO,KAAK,aAAa,OAAO,GAAG,WAAW,KAAK,MAAM,EAAE,CAAC,CAAC;AACjE,eAAO;AAAA,UAAE,SAAS,EAAE,MAAM,IAAI,QAAQ,KAAK,GAAGA,OAAM,EAAG;AAAA,UACnD,OAAO,gBAAgB,OAAO,OAAO,IAAIA,QAAO,CAAC,EAAE,MAAM;AAAA;MACzE,CAAS;AACD,eAAS,MAAM,OAAO,SAAS,EAAE,gBAAgB,MAAM,WAAW,QAAS,CAAA,CAAC;AAC5E,aAAO;AAAA,IACf;AAAA,EACA;AACA,WAAS,qBAAqB,OAAOV,IAAG;AACpC,QAAI,SAAS;AACb,WAAO,MAAM,cAAc,WAAS;AAChC,UAAI,UAAU,CAAA;AACd,eAAS,MAAM,MAAM,MAAM,OAAO,MAAM,MAAK;AACzC,YAAI,OAAO,MAAM,IAAI,OAAO,GAAG;AAC/B,YAAI,KAAK,SAAS,WAAW,MAAM,SAAS,MAAM,KAAK,KAAK,OAAO;AAC/D,UAAAA,GAAE,MAAM,SAAS,KAAK;AACtB,mBAAS,KAAK;AAAA,QACjB;AACD,cAAM,KAAK,KAAK;AAAA,MACnB;AACD,UAAI,YAAY,MAAM,QAAQ,OAAO;AACrC,aAAO;AAAA,QAAE;AAAA,QACL,OAAO,gBAAgB,MAAM,UAAU,OAAO,MAAM,QAAQ,CAAC,GAAG,UAAU,OAAO,MAAM,MAAM,CAAC,CAAC;AAAA;IAC3G,CAAK;AAAA,EACL;AAMA,QAAM,kBAAkB,CAAC,EAAE,OAAO,eAAe;AAC7C,QAAI,MAAM;AACN,aAAO;AACX,QAAI,UAAU,uBAAO,OAAO,IAAI;AAChC,QAAI,UAAU,IAAI,cAAc,OAAO,EAAE,qBAAqB,WAAS;AAC/D,UAAI,QAAQ,QAAQ,KAAK;AACzB,aAAO,SAAS,OAAO,KAAK;AAAA,IAC/B,EAAA,CAAE;AACP,QAAI,UAAU,qBAAqB,OAAO,CAAC,MAAM4M,UAAS,UAAU;AAChE,UAAI,SAAS,eAAe,SAAS,KAAK,IAAI;AAC9C,UAAI,UAAU;AACV;AACJ,UAAI,CAAC,KAAK,KAAK,KAAK,IAAI;AACpB,iBAAS;AACb,UAAI,MAAM,OAAO,KAAK,KAAK,IAAI,EAAE,CAAC;AAClC,UAAI,OAAO,aAAa,OAAO,MAAM;AACrC,UAAI,OAAO,QAAQ,MAAM,OAAO,KAAK,OAAO,IAAI,QAAQ;AACpD,gBAAQ,KAAK,IAAI,IAAI;AACrB,QAAAA,SAAQ,KAAK,EAAE,MAAM,KAAK,MAAM,IAAI,KAAK,OAAO,IAAI,QAAQ,QAAQ,KAAM,CAAA;AAAA,MAC7E;AAAA,IACT,CAAK;AACD,QAAI,CAAC,QAAQ,QAAQ;AACjB,eAAS,MAAM,OAAO,SAAS,EAAE,WAAW,SAAU,CAAA,CAAC;AAC3D,WAAO;AAAA,EACX;AAKA,QAAM,aAAa,CAAC,EAAE,OAAO,eAAe;AACxC,QAAI,MAAM;AACN,aAAO;AACX,aAAS,MAAM,OAAO,qBAAqB,OAAO,CAAC,MAAM,YAAY;AACjE,cAAQ,KAAK,EAAE,MAAM,KAAK,MAAM,QAAQ,MAAM,MAAM,UAAU,EAAG,CAAA;AAAA,IACpE,CAAA,GAAG,EAAE,WAAW,eAAc,CAAE,CAAC;AAClC,WAAO;AAAA,EACX;AAKA,QAAM,aAAa,CAAC,EAAE,OAAO,eAAe;AACxC,QAAI,MAAM;AACN,aAAO;AACX,aAAS,MAAM,OAAO,qBAAqB,OAAO,CAAC,MAAM,YAAY;AACjE,UAAI,QAAQ,OAAO,KAAK,KAAK,IAAI,EAAE,CAAC;AACpC,UAAI,CAAC;AACD;AACJ,UAAI,MAAM,YAAY,OAAO,MAAM,OAAO,GAAG,OAAO;AACpD,UAAIlM,UAAS,aAAa,OAAO,KAAK,IAAI,GAAG,MAAM,cAAc,KAAK,CAAC,CAAC;AACxE,aAAO,OAAO,MAAM,UAAU,OAAOA,QAAO,UAAU,MAAM,WAAW,IAAI,KAAKA,QAAO,WAAW,IAAI;AAClG;AACJ,cAAQ,KAAK,EAAE,MAAM,KAAK,OAAO,MAAM,IAAI,KAAK,OAAO,MAAM,QAAQ,QAAQA,QAAO,MAAM,IAAI,EAAC,CAAE;AAAA,IACpG,CAAA,GAAG,EAAE,WAAW,gBAAe,CAAE,CAAC;AACnC,WAAO;AAAA,EACX;AA+BA,QAAM,mBAAmB;AAAA,IACrB,EAAE,KAAK,UAAU,KAAK,gBAAgB,OAAO,gBAAgB,gBAAgB,KAAM;AAAA,IACnF,EAAE,KAAK,UAAU,KAAK,iBAAiB,OAAO,gBAAiB;AAAA,IAC/D,EAAE,KAAK,UAAU,KAAK,cAAc,OAAO,aAAc;AAAA,IACzD,EAAE,KAAK,UAAU,KAAK,gBAAgB,OAAO,eAAgB;AAAA,IAC7D,EAAE,KAAK,UAAU,KAAK,iBAAiB,OAAO,gBAAiB;AAAA,IAC/D,EAAE,KAAK,UAAU,KAAK,eAAe,OAAO,cAAe;AAAA,IAC3D,EAAE,KAAK,UAAU,KAAK,kBAAmB;AAAA,IACzC,EAAE,KAAK,UAAU,KAAK,mBAAoB;AAAA,IAC1C,EAAE,KAAK,UAAU,KAAK,gBAAiB;AAAA,IACvC,EAAE,KAAK,cAAc,KAAK,oBAAqB;AAAA,IAC/C,EAAE,KAAK,UAAU,KAAK,UAAW;AAAA,IACjC,EAAE,KAAK,UAAU,KAAK,eAAgB;AAAA,IACtC,EAAE,KAAK,UAAU,KAAK,eAAgB;AAAA,EAC1C;AAkCA,QAAM,iBAA8B;AAAA,IAChC,EAAE,KAAK,aAAa,KAAK,gBAAgB,OAAO,gBAAgB,gBAAgB,KAAM;AAAA,IACtF,EAAE,KAAK,iBAAiB,KAAK,iBAAiB,KAAK,iBAAiB,OAAO,iBAAiB,gBAAgB,KAAM;AAAA,IAClH,EAAE,KAAK,iBAAiB,KAAK,wBAAwB,OAAO,wBAAwB,gBAAgB,KAAM;AAAA,IAC1G,EAAE,KAAK,cAAc,KAAK,iBAAiB,OAAO,iBAAiB,gBAAgB,KAAM;AAAA,IACzF,EAAE,KAAK,kBAAkB,KAAK,kBAAkB,KAAK,kBAAkB,OAAO,kBAAkB,gBAAgB,KAAM;AAAA,IACtH,EAAE,KAAK,kBAAkB,KAAK,yBAAyB,OAAO,yBAAyB,gBAAgB,KAAM;AAAA,IAC7G,EAAE,KAAK,WAAW,KAAK,cAAc,OAAO,cAAc,gBAAgB,KAAM;AAAA,IAChF,EAAE,KAAK,eAAe,KAAK,gBAAgB,OAAO,eAAgB;AAAA,IAClE,EAAE,KAAK,gBAAgB,KAAK,cAAc,OAAO,aAAc;AAAA,IAC/D,EAAE,KAAK,aAAa,KAAK,gBAAgB,OAAO,gBAAgB,gBAAgB,KAAM;AAAA,IACtF,EAAE,KAAK,iBAAiB,KAAK,cAAc,OAAO,aAAc;AAAA,IAChE,EAAE,KAAK,kBAAkB,KAAK,gBAAgB,OAAO,eAAgB;AAAA,IACrE,EAAE,KAAK,UAAU,KAAK,cAAc,OAAO,aAAc;AAAA,IACzD,EAAE,KAAK,YAAY,KAAK,gBAAgB,OAAO,eAAgB;AAAA,IAC/D,EAAE,KAAK,QAAQ,KAAK,4BAA4B,OAAO,4BAA4B,gBAAgB,KAAM;AAAA,IACzG,EAAE,KAAK,YAAY,KAAK,gBAAgB,OAAO,eAAgB;AAAA,IAC/D,EAAE,KAAK,OAAO,KAAK,2BAA2B,OAAO,2BAA2B,gBAAgB,KAAM;AAAA,IACtG,EAAE,KAAK,WAAW,KAAK,cAAc,OAAO,aAAc;AAAA,IAC1D,EAAE,KAAK,SAAS,KAAK,uBAAwB;AAAA,IAC7C,EAAE,KAAK,SAAS,KAAK,UAAW;AAAA,IAChC,EAAE,KAAK,aAAa,KAAK,oBAAoB,OAAO,mBAAoB;AAAA,IACxE,EAAE,KAAK,UAAU,KAAK,kBAAmB;AAAA,IACzC,EAAE,KAAK,iBAAiB,KAAK,iBAAiB,KAAK,oBAAqB;AAAA,IACxE,EAAE,KAAK,cAAc,KAAK,cAAc,KAAK,mBAAoB;AAAA,IACjE,EAAE,KAAK,iBAAiB,KAAK,kBAAmB;AAAA,IAChD,EAAE,KAAK,cAAc,KAAK,gBAAiB;AAAA,EAC/C,EAAE,OAAoB,iCAAiB,IAAI,CAAA3B,QAAM,EAAE,KAAKA,GAAE,KAAK,KAAKA,GAAE,KAAK,OAAOA,GAAE,MAAK,EAAG,CAAC;AAuB7F,QAAM,gBAA6B;AAAA,IAC/B,EAAE,KAAK,iBAAiB,KAAK,kBAAkB,KAAK,kBAAkB,OAAO,iBAAkB;AAAA,IAC/F,EAAE,KAAK,kBAAkB,KAAK,mBAAmB,KAAK,mBAAmB,OAAO,kBAAmB;AAAA,IACnG,EAAE,KAAK,eAAe,KAAK,WAAY;AAAA,IACvC,EAAE,KAAK,qBAAqB,KAAK,WAAY;AAAA,IAC7C,EAAE,KAAK,iBAAiB,KAAK,aAAc;AAAA,IAC3C,EAAE,KAAK,uBAAuB,KAAK,aAAc;AAAA,IACjD,EAAE,KAAK,UAAU,KAAK,kBAAmB;AAAA,IACzC,EAAE,KAAK,aAAa,KAAK,gBAAiB;AAAA,IAC1C,EAAE,KAAK,SAAS,KAAK,UAAU,KAAK,WAAY;AAAA,IAChD,EAAE,KAAK,SAAS,KAAK,oBAAoB,gBAAgB,KAAM;AAAA,IAC/D,EAAE,KAAK,SAAS,KAAK,WAAY;AAAA,IACjC,EAAE,KAAK,SAAS,KAAK,WAAY;AAAA,IACjC,EAAE,KAAK,cAAc,KAAK,gBAAiB;AAAA,IAC3C,EAAE,KAAK,eAAe,KAAK,WAAY;AAAA,IACvC,EAAE,KAAK,gBAAgB,KAAK,sBAAuB;AAAA,IACnD,EAAE,KAAK,SAAS,KAAK,cAAe;AAAA,IACpC,EAAE,KAAK,SAAS,KAAK,mBAAoB;AAAA,EAC7C,EAAE,OAAO,cAAc;ACzgDvB,MAAI,KAAK,CAAC,KAAU,UAAkB,EAAE,KAAK,OAAO,QAAQ,IAAI,GAAG;AACnE,MAAI,KAAK,CAAC,IAAoB,SAAiB,GAAG6B,KAAE,EAAE,GAAU,IAAI;AAEpE,MAAI,iBAAiB,eAAe,OAAO;AAAA,IACzC,GAAG,WAAW,SAAS;AAAA,IACvB,GAAG,eAAe,SAAS;AAAA,IAC3B,GAAG,gBAAgB,SAAS;AAAA,IAC5B,GAAG,cAAc,SAAS;AAAA;AAAA,IAE1B,GAAG,YAAY,MAAM;AAAA,IACrB,GAAG,WAAW,MAAM;AAAA,IACpB,GAAG,WAAW,SAAS;AAAA,IACvB,GAAG,UAAU,QAAQ;AAAA,IACrB,GAAG,aAAa,QAAQ;AAAA,IACxB,GAAG,UAAU,QAAQ;AAAA,IACrB,GAAG,WAAW,QAAQ;AAAA,IACtB,GAAG,SAAS,QAAQ;AAAA,IACpB,GAAG,UAAU,QAAQ;AAAA,IACrB,GAAG,WAAW,SAAS;AAAA,IACvB,GAAG,QAAQ,mBAAmB;AAAA,IAC9B,GAAG,YAAY,UAAU;AAAA,IACzB,GAAGA,KAAE,SAASA,KAAE,WAAWA,KAAE,YAAY,CAAC,GAAG,OAAO;AAAA,EACtD,CAAC;AAED,MAAI,oBAAoB,MAAM;AAC5B,QAAI,kBAAkB,CAACjD,OAAqBA,GAAE,gBAAgB;AAC9D,WAAO,WAAW,iBAAiB;AAAA,MACjC,SAAS,MAAM;AACb,iBAAS,gBAAgB;AAAA,UACvB;AAAA,UACA;AAAA,UACA;AAAA,QAAA;AAAA,MAEJ;AAAA,MACA,UAAU,MAAM;AACd,iBAAS,gBAAgB;AAAA,UACvB;AAAA,UACA;AAAA,UACA;AAAA,QAAA;AAAA,MAEJ;AAAA,IAAA,CACD;AAAA,EACH;AAEO,MAAI,SAAoB,MAAM;AAAA,IACnC,sBAAsB;AAAA,IACtB,QAAQ;AAAA,IACR,cAAc;AAAA,IACd,mBAAmB,gBAAgB,EAAE,UAAU,MAAM;AAAA,IACrD,OAAO,GAAG,CAAC,GAAG,eAAe,GAAG,aAAa,CAAC;AAAA,IAC9C,kBAAkB;AAAA,EACpB,GAAG;;ACtDH,QAAM,iBAAiB;AACvB,QAAM,aAAa;AAkBnB,MAAI,cAAc,MAAM,cAAc,EAAE;AAGxC,MAAI,4BAA4B,CAAC,YAAqB;AACpDwO,iBAAAA,gBAAgB,MAAM;AACpB,UAAI,SAAS;AACX,YAAI,kBAAkB,CAACxO,OAAqBA,GAAE,gBAAgB;AAU9D,iBAAS,gBAAgB;AAAA,UACvB;AAAA,UACA;AAAA,UACA;AAAA,QAAA;AAGK,eAAA,MACL,SAAS,gBAAgB;AAAA,UACvB;AAAA,UACA;AAAA,UACA;AAAA,QAAA;AAAA,MAEN;AAAA,IAAA,GACC,CAAC,OAAO,CAAC;AAAA,EACd;AAEA,MAAI,kBAAkB,CAAC;AAAA,IACrB;AAAA,IACA;AAAA,IACA;AAAA,EACF,MAIM;AACJ,QAAI,CAAC,MAAM,OAAO,IAAI2L,sBAAS,KAAK;AACpC,QAAI,EAAE,GAAA1L,IAAG,GAAAuE,IAAG,UAAU,KAAA,IAAS,YAAY;AAAA,MACzC,WAAW;AAAA,MACX;AAAA,IAAA,CACD;AAID,8BAA0B,IAAI;AAE9B,QAAI,UAAU,SAAS,MAAM,QAAQ,KAAK,CAAC;AAGzC,WAAA0K,kCAAA,KAAC,OAAI,EAAA,WAAU,oBACb,UAAA;AAAA,MAAAC,kCAAA;AAAA,QAAC;AAAA,QAAA;AAAA,UACC,MAAK;AAAA,UACL;AAAA,UACA,SAAS,MAAM,QAAQ,CAAC,IAAI;AAAA,UAC5B,KAAK,KAAK;AAAA,UAET,UAAA;AAAA,QAAA;AAAA,MACH;AAAA,MACC,OACCD,kCAAA;AAAA,QAAC;AAAA,QAAA;AAAA,UACC,WAAU;AAAA,UACV,KAAK,KAAK;AAAA,UACV,OAAO;AAAA,YACL,UAAU;AAAA,YACV,KAAK1K,MAAK;AAAA,YACV,MAAMvE,MAAK;AAAA,UACb;AAAA,UAEA,UAAA;AAAA,YAAAkP,kCAAA;AAAA,cAAC;AAAA,cAAA;AAAA,gBACC,MAAK;AAAA,gBACL,WAAU;AAAA,gBACV,SAAS,MAAM,QAAQ,KAAK;AAAA,gBAC7B,UAAA;AAAA,cAAA;AAAA,YAED;AAAA,YACC;AAAA,UAAA;AAAA,QAAA;AAAA,MAAA,IAED;AAAA,IACN,EAAA,CAAA;AAAA,EAEJ;AAEA,MAAI,cAAc,MACfA,kCAAAA,IAAA,iBAAA,EAAgB,OAAO,gBAAgB,YAAY,MACjD,UAAS,CAAA,UAAA;AACJ,QAAAzL,QAAOwK,wBAAW,WAAW;AAC7B,QAAA,WAAoD,CAAC,UAAe;AACtE,UAAI,OAAO,IAAI,SAAS,MAAM,MAAa;AAC3C,UAAI,WAAW,KAAK,IAAI,UAAU,EAAG,SAAS;AAC9C,aAAO,UAAW,IAAI,gBAAgB,EAAE,MAAAxK,OAAM,UAAU;AACxD,YAAM,eAAe;AACf;IAAA;AAER,WAEIwL,kCAAA,KAAAE,4BAAA,EAAA,UAAA;AAAA,MAAAD,kCAAAA,IAAC,QAAG,UAAY,eAAA,CAAA;AAAA,MAChBA,kCAAAA,IAAC,OAAE,UAGH,kIAAA,CAAA;AAAA,MACAD,kCAAAA,KAAC,UAAK,UACJ,UAAA;AAAA,QAAAC,kCAAAA,IAAC,SACC,UAACA,kCAAA,IAAA,YAAA,EAAS,MAAK,YAAW,cAAW,gBAAe,EACtD,CAAA;AAAA,QACAA,kCAAAA,IAAC,SACC,UAACA,kCAAA,IAAA,SAAA,EAAM,MAAK,UAAS,cAAW,uBAAsB,EACxD,CAAA;AAAA,MAAA,GACF;AAAA,IACF,EAAA,CAAA;AAAA,EAEJ,EACF,CAAA;AAGF,MAAI,eAAe,MAChBA,kCAAA,IAAA,iBAAA,EAAgB,OAAO,yBAAyB,YAAY,KAC1D,UAAA,MAEGD,kCAAA,KAAAE,kBAAA,UAAA,EAAA,UAAA;AAAA,IAAAD,kCAAAA,IAAC,QAAG,UAAqB,wBAAA,CAAA;AAAA,2CACxB,KAAE,EAAA,UAAA;AAAA,MAAA;AAAA,MAE8D;AAAA,MAC/DA,kCAAA;AAAA,QAAC;AAAA,QAAA;AAAA,UACC,MAAK;AAAA,UACL,QAAO;AAAA,UACP,KAAI;AAAA,UACL,UAAA;AAAA,QAAA;AAAA,MAED;AAAA,MAAI;AAAA,IAAA,GAEN;AAAA,EAAA,EACF,CAAA,EAEJ,CAAA;AAGF,MAAI,YAAY,MACbD,kCAAAA,KAAA,OAAA,EAAI,WAAU,cACb,UAAA;AAAA,IAAAC,kCAAA,IAAC,aAAY,EAAA;AAAA,0CACZ,cAAa,EAAA;AAAA,EAAA,EAChB,CAAA;AAGF,SAAO,sBAAsB,CAAC,SAAsB;AAClD,SAAK,iBAAiC,IAAI,UAAU,EAAE,EAAE,QAAQ,CAAQ,SAAA;AACjE,WAAA,UAAU,OAAO,UAAU;AAC3B,WAAA,UAAU,IAAI,cAAc;AAEjC,UAAI,iBAAiB,CAAKxO,OACxBA,KAAI,KAAK,MAAMA,EAAC,IAAI;AAEtB,UAAIoD,YAAW,eAAe,KAAK,QAAQ,UAAW,MAAM;AAC5D,UAAI,kBACF,eAAe,KAAK,QAAQ,eAAgB,MAAM;AAEhD,UAAA;AACJ,UAAI,CAACA,WAAU;AAET,YAAA,UAAU,SAAS,cAAc,KAAK;AAClC,gBAAA,UAAU,IAAI,WAAW;AAGhB,yBAAA,SAAS,cAAc,QAAQ;AAChD,uBAAe,YAAY;AAE3B,gBAAQ,YAAY,cAAc;AAClC,aAAK,YAAY,OAAO;AAAA,MAC1B;AAEA,UAAI,cAAc,eAAuB,KAAK,QAAQ,IAAI;AAC1D,UAAI,CAAC;AAAmB,cAAA,IAAI,MAAM,6BAA6B;AAE3D,UAAA,OAAO,aAAa,iBAAiB;AACnC,YAAA,YAAY,SAAS,cAAc,KAAK;AAC5C,aAAK,YAAY,SAAS;AACjB6H,eAAA,WAAW,SAAS,EAAE;AAAA,UAC7BuD,kCAAAA,IAAC,YAAY,UAAZ,EAAqB,OAAO,aAC3B,UAAAA,sCAAC,YAAU,CAAA,GACb;AAAA,QAAA;AAAA,MAEJ;AAEI,UAAA,YAAY,KAAK,QAAQ,YACzB,IAAI,IAAI,KAAK,QAAQ,SAAS,IAC9B;AAEJ,UAAI,iBAAiB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAYrB,UAAI,KAAK,IAAI;AAAA,QACX;AAAA,QACA;AAAA,QACA;AAAA,QACA,CAAO,QAAA;AACL,kBAAQ,MAAM,GAAG;AAAA,QACnB;AAAA,QACA;AAAA,QACApL;AAAA,QACA;AAAA,QACA,CAAC,MAAM;AAAA,MAAA;AAGT,UAAI,aAAa,eAAyB,KAAK,QAAQ,UAAU;AACjE,UAAI,CAAC;AAAkB,cAAA,IAAI,MAAM,mCAAmC;AAEpE,UAAI,YAAY;AAAA,QACd,KAAK,QAAQ;AAAA,MAAA;AAEf,UAAI,SAAS,eAAoB,KAAK,QAAQ,MAAM;AACpD,UAAI,cAAc;AAAA,QAChB,KAAK,QAAQ;AAAA,MAAA;AAGf,UAAI,WAAW;AACb,mBAAW,QAAQ,CAAa,cAAA;AAC9B,aAAG,gBAAgB,WAAW;AAAA,YAC5B,UAAU,UAAW,SAAS;AAAA,YAC9B;AAAA,YACA;AAAA,UAAA,CACD;AAAA,QAAA,CACF;AAAA,MACH;AAEgB,uDAAA,iBAAiB,SAAS,CAAKvB,OAAA;AAC7C,mBAAY,QAAQ,CAAa,cAAA,GAAG,gBAAgB,WAAY,CAAE,CAAA,CAAC;AAAA,MAAA;AAAA,IACpE,CACF;AAAA,EACH;AAEA,SAAO;AAAA,IACL;AAAA,IACA,MAAM,oBAAoB,SAAS,IAAI;AAAA,IACvC;AAAA,EACF;;","x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,23,28,29,30,31]}