quran/node_modules/firebase/firebase-firestore-lite.js.map

{"version":3,"file":"firebase-firestore-lite.js","sources":["../util/src/crypt.ts","../util/src/defaults.ts","../util/src/global.ts","../util/src/errors.ts","../util/src/obj.ts","../util/src/compat.ts","../logger/src/logger.ts","../firestore/dist/lite/index.browser.esm2017.js","../util/src/emulator.ts","../component/src/component.ts"],"sourcesContent":["/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nconst stringToByteArray = function (str: string): number[] {\n  // TODO(user): Use native implementations if/when available\n  const out: number[] = [];\n  let p = 0;\n  for (let i = 0; i < str.length; i++) {\n    let c = str.charCodeAt(i);\n    if (c < 128) {\n      out[p++] = c;\n    } else if (c < 2048) {\n      out[p++] = (c >> 6) | 192;\n      out[p++] = (c & 63) | 128;\n    } else if (\n      (c & 0xfc00) === 0xd800 &&\n      i + 1 < str.length &&\n      (str.charCodeAt(i + 1) & 0xfc00) === 0xdc00\n    ) {\n      // Surrogate Pair\n      c = 0x10000 + ((c & 0x03ff) << 10) + (str.charCodeAt(++i) & 0x03ff);\n      out[p++] = (c >> 18) | 240;\n      out[p++] = ((c >> 12) & 63) | 128;\n      out[p++] = ((c >> 6) & 63) | 128;\n      out[p++] = (c & 63) | 128;\n    } else {\n      out[p++] = (c >> 12) | 224;\n      out[p++] = ((c >> 6) & 63) | 128;\n      out[p++] = (c & 63) | 128;\n    }\n  }\n  return out;\n};\n\n/**\n * Turns an array of numbers into the string given by the concatenation of the\n * characters to which the numbers correspond.\n * @param bytes Array of numbers representing characters.\n * @return Stringification of the array.\n */\nconst byteArrayToString = function (bytes: number[]): string {\n  // TODO(user): Use native implementations if/when available\n  const out: string[] = [];\n  let pos = 0,\n    c = 0;\n  while (pos < bytes.length) {\n    const c1 = bytes[pos++];\n    if (c1 < 128) {\n      out[c++] = String.fromCharCode(c1);\n    } else if (c1 > 191 && c1 < 224) {\n      const c2 = bytes[pos++];\n      out[c++] = String.fromCharCode(((c1 & 31) << 6) | (c2 & 63));\n    } else if (c1 > 239 && c1 < 365) {\n      // Surrogate Pair\n      const c2 = bytes[pos++];\n      const c3 = bytes[pos++];\n      const c4 = bytes[pos++];\n      const u =\n        (((c1 & 7) << 18) | ((c2 & 63) << 12) | ((c3 & 63) << 6) | (c4 & 63)) -\n        0x10000;\n      out[c++] = String.fromCharCode(0xd800 + (u >> 10));\n      out[c++] = String.fromCharCode(0xdc00 + (u & 1023));\n    } else {\n      const c2 = bytes[pos++];\n      const c3 = bytes[pos++];\n      out[c++] = String.fromCharCode(\n        ((c1 & 15) << 12) | ((c2 & 63) << 6) | (c3 & 63)\n      );\n    }\n  }\n  return out.join('');\n};\n\ninterface Base64 {\n  byteToCharMap_: { [key: number]: string } | null;\n  charToByteMap_: { [key: string]: number } | null;\n  byteToCharMapWebSafe_: { [key: number]: string } | null;\n  charToByteMapWebSafe_: { [key: string]: number } | null;\n  ENCODED_VALS_BASE: string;\n  readonly ENCODED_VALS: string;\n  readonly ENCODED_VALS_WEBSAFE: string;\n  HAS_NATIVE_SUPPORT: boolean;\n  encodeByteArray(input: number[] | Uint8Array, webSafe?: boolean): string;\n  encodeString(input: string, webSafe?: boolean): string;\n  decodeString(input: string, webSafe: boolean): string;\n  decodeStringToByteArray(input: string, webSafe: boolean): number[];\n  init_(): void;\n}\n\n// We define it as an object literal instead of a class because a class compiled down to es5 can't\n// be treeshaked. https://github.com/rollup/rollup/issues/1691\n// Static lookup maps, lazily populated by init_()\nexport const base64: Base64 = {\n  /**\n   * Maps bytes to characters.\n   */\n  byteToCharMap_: null,\n\n  /**\n   * Maps characters to bytes.\n   */\n  charToByteMap_: null,\n\n  /**\n   * Maps bytes to websafe characters.\n   * @private\n   */\n  byteToCharMapWebSafe_: null,\n\n  /**\n   * Maps websafe characters to bytes.\n   * @private\n   */\n  charToByteMapWebSafe_: null,\n\n  /**\n   * Our default alphabet, shared between\n   * ENCODED_VALS and ENCODED_VALS_WEBSAFE\n   */\n  ENCODED_VALS_BASE:\n    'ABCDEFGHIJKLMNOPQRSTUVWXYZ' + 'abcdefghijklmnopqrstuvwxyz' + '0123456789',\n\n  /**\n   * Our default alphabet. Value 64 (=) is special; it means \"nothing.\"\n   */\n  get ENCODED_VALS() {\n    return this.ENCODED_VALS_BASE + '+/=';\n  },\n\n  /**\n   * Our websafe alphabet.\n   */\n  get ENCODED_VALS_WEBSAFE() {\n    return this.ENCODED_VALS_BASE + '-_.';\n  },\n\n  /**\n   * Whether this browser supports the atob and btoa functions. This extension\n   * started at Mozilla but is now implemented by many browsers. We use the\n   * ASSUME_* variables to avoid pulling in the full useragent detection library\n   * but still allowing the standard per-browser compilations.\n   *\n   */\n  HAS_NATIVE_SUPPORT: typeof atob === 'function',\n\n  /**\n   * Base64-encode an array of bytes.\n   *\n   * @param input An array of bytes (numbers with\n   *     value in [0, 255]) to encode.\n   * @param webSafe Boolean indicating we should use the\n   *     alternative alphabet.\n   * @return The base64 encoded string.\n   */\n  encodeByteArray(input: number[] | Uint8Array, webSafe?: boolean): string {\n    if (!Array.isArray(input)) {\n      throw Error('encodeByteArray takes an array as a parameter');\n    }\n\n    this.init_();\n\n    const byteToCharMap = webSafe\n      ? this.byteToCharMapWebSafe_!\n      : this.byteToCharMap_!;\n\n    const output = [];\n\n    for (let i = 0; i < input.length; i += 3) {\n      const byte1 = input[i];\n      const haveByte2 = i + 1 < input.length;\n      const byte2 = haveByte2 ? input[i + 1] : 0;\n      const haveByte3 = i + 2 < input.length;\n      const byte3 = haveByte3 ? input[i + 2] : 0;\n\n      const outByte1 = byte1 >> 2;\n      const outByte2 = ((byte1 & 0x03) << 4) | (byte2 >> 4);\n      let outByte3 = ((byte2 & 0x0f) << 2) | (byte3 >> 6);\n      let outByte4 = byte3 & 0x3f;\n\n      if (!haveByte3) {\n        outByte4 = 64;\n\n        if (!haveByte2) {\n          outByte3 = 64;\n        }\n      }\n\n      output.push(\n        byteToCharMap[outByte1],\n        byteToCharMap[outByte2],\n        byteToCharMap[outByte3],\n        byteToCharMap[outByte4]\n      );\n    }\n\n    return output.join('');\n  },\n\n  /**\n   * Base64-encode a string.\n   *\n   * @param input A string to encode.\n   * @param webSafe If true, we should use the\n   *     alternative alphabet.\n   * @return The base64 encoded string.\n   */\n  encodeString(input: string, webSafe?: boolean): string {\n    // Shortcut for Mozilla browsers that implement\n    // a native base64 encoder in the form of \"btoa/atob\"\n    if (this.HAS_NATIVE_SUPPORT && !webSafe) {\n      return btoa(input);\n    }\n    return this.encodeByteArray(stringToByteArray(input), webSafe);\n  },\n\n  /**\n   * Base64-decode a string.\n   *\n   * @param input to decode.\n   * @param webSafe True if we should use the\n   *     alternative alphabet.\n   * @return string representing the decoded value.\n   */\n  decodeString(input: string, webSafe: boolean): string {\n    // Shortcut for Mozilla browsers that implement\n    // a native base64 encoder in the form of \"btoa/atob\"\n    if (this.HAS_NATIVE_SUPPORT && !webSafe) {\n      return atob(input);\n    }\n    return byteArrayToString(this.decodeStringToByteArray(input, webSafe));\n  },\n\n  /**\n   * Base64-decode a string.\n   *\n   * In base-64 decoding, groups of four characters are converted into three\n   * bytes.  If the encoder did not apply padding, the input length may not\n   * be a multiple of 4.\n   *\n   * In this case, the last group will have fewer than 4 characters, and\n   * padding will be inferred.  If the group has one or two characters, it decodes\n   * to one byte.  If the group has three characters, it decodes to two bytes.\n   *\n   * @param input Input to decode.\n   * @param webSafe True if we should use the web-safe alphabet.\n   * @return bytes representing the decoded value.\n   */\n  decodeStringToByteArray(input: string, webSafe: boolean): number[] {\n    this.init_();\n\n    const charToByteMap = webSafe\n      ? this.charToByteMapWebSafe_!\n      : this.charToByteMap_!;\n\n    const output: number[] = [];\n\n    for (let i = 0; i < input.length; ) {\n      const byte1 = charToByteMap[input.charAt(i++)];\n\n      const haveByte2 = i < input.length;\n      const byte2 = haveByte2 ? charToByteMap[input.charAt(i)] : 0;\n      ++i;\n\n      const haveByte3 = i < input.length;\n      const byte3 = haveByte3 ? charToByteMap[input.charAt(i)] : 64;\n      ++i;\n\n      const haveByte4 = i < input.length;\n      const byte4 = haveByte4 ? charToByteMap[input.charAt(i)] : 64;\n      ++i;\n\n      if (byte1 == null || byte2 == null || byte3 == null || byte4 == null) {\n        throw new DecodeBase64StringError();\n      }\n\n      const outByte1 = (byte1 << 2) | (byte2 >> 4);\n      output.push(outByte1);\n\n      if (byte3 !== 64) {\n        const outByte2 = ((byte2 << 4) & 0xf0) | (byte3 >> 2);\n        output.push(outByte2);\n\n        if (byte4 !== 64) {\n          const outByte3 = ((byte3 << 6) & 0xc0) | byte4;\n          output.push(outByte3);\n        }\n      }\n    }\n\n    return output;\n  },\n\n  /**\n   * Lazy static initialization function. Called before\n   * accessing any of the static map variables.\n   * @private\n   */\n  init_() {\n    if (!this.byteToCharMap_) {\n      this.byteToCharMap_ = {};\n      this.charToByteMap_ = {};\n      this.byteToCharMapWebSafe_ = {};\n      this.charToByteMapWebSafe_ = {};\n\n      // We want quick mappings back and forth, so we precompute two maps.\n      for (let i = 0; i < this.ENCODED_VALS.length; i++) {\n        this.byteToCharMap_[i] = this.ENCODED_VALS.charAt(i);\n        this.charToByteMap_[this.byteToCharMap_[i]] = i;\n        this.byteToCharMapWebSafe_[i] = this.ENCODED_VALS_WEBSAFE.charAt(i);\n        this.charToByteMapWebSafe_[this.byteToCharMapWebSafe_[i]] = i;\n\n        // Be forgiving when decoding and correctly decode both encodings.\n        if (i >= this.ENCODED_VALS_BASE.length) {\n          this.charToByteMap_[this.ENCODED_VALS_WEBSAFE.charAt(i)] = i;\n          this.charToByteMapWebSafe_[this.ENCODED_VALS.charAt(i)] = i;\n        }\n      }\n    }\n  }\n};\n\n/**\n * An error encountered while decoding base64 string.\n */\nexport class DecodeBase64StringError extends Error {\n  readonly name = 'DecodeBase64StringError';\n}\n\n/**\n * URL-safe base64 encoding\n */\nexport const base64Encode = function (str: string): string {\n  const utf8Bytes = stringToByteArray(str);\n  return base64.encodeByteArray(utf8Bytes, true);\n};\n\n/**\n * URL-safe base64 encoding (without \".\" padding in the end).\n * e.g. Used in JSON Web Token (JWT) parts.\n */\nexport const base64urlEncodeWithoutPadding = function (str: string): string {\n  // Use base64url encoding and remove padding in the end (dot characters).\n  return base64Encode(str).replace(/\\./g, '');\n};\n\n/**\n * URL-safe base64 decoding\n *\n * NOTE: DO NOT use the global atob() function - it does NOT support the\n * base64Url variant encoding.\n *\n * @param str To be decoded\n * @return Decoded result, if possible\n */\nexport const base64Decode = function (str: string): string | null {\n  try {\n    return base64.decodeString(str, true);\n  } catch (e) {\n    console.error('base64Decode failed: ', e);\n  }\n  return null;\n};\n","/**\n * @license\n * Copyright 2022 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { base64Decode } from './crypt';\nimport { getGlobal } from './global';\n\n/**\n * Keys for experimental properties on the `FirebaseDefaults` object.\n * @public\n */\nexport type ExperimentalKey = 'authTokenSyncURL' | 'authIdTokenMaxAge';\n\n/**\n * An object that can be injected into the environment as __FIREBASE_DEFAULTS__,\n * either as a property of globalThis, a shell environment variable, or a\n * cookie.\n *\n * This object can be used to automatically configure and initialize\n * a Firebase app as well as any emulators.\n *\n * @public\n */\nexport interface FirebaseDefaults {\n  config?: Record<string, string>;\n  emulatorHosts?: Record<string, string>;\n  _authTokenSyncURL?: string;\n  _authIdTokenMaxAge?: number;\n  /**\n   * Override Firebase's runtime environment detection and\n   * force the SDK to act as if it were in the specified environment.\n   */\n  forceEnvironment?: 'browser' | 'node';\n  [key: string]: unknown;\n}\n\ndeclare global {\n  // Need `var` for this to work.\n  // eslint-disable-next-line no-var\n  var __FIREBASE_DEFAULTS__: FirebaseDefaults | undefined;\n}\n\nconst getDefaultsFromGlobal = (): FirebaseDefaults | undefined =>\n  getGlobal().__FIREBASE_DEFAULTS__;\n\n/**\n * Attempt to read defaults from a JSON string provided to\n * process(.)env(.)__FIREBASE_DEFAULTS__ or a JSON file whose path is in\n * process(.)env(.)__FIREBASE_DEFAULTS_PATH__\n * The dots are in parens because certain compilers (Vite?) cannot\n * handle seeing that variable in comments.\n * See https://github.com/firebase/firebase-js-sdk/issues/6838\n */\nconst getDefaultsFromEnvVariable = (): FirebaseDefaults | undefined => {\n  if (typeof process === 'undefined' || typeof process.env === 'undefined') {\n    return;\n  }\n  const defaultsJsonString = process.env.__FIREBASE_DEFAULTS__;\n  if (defaultsJsonString) {\n    return JSON.parse(defaultsJsonString);\n  }\n};\n\nconst getDefaultsFromCookie = (): FirebaseDefaults | undefined => {\n  if (typeof document === 'undefined') {\n    return;\n  }\n  let match;\n  try {\n    match = document.cookie.match(/__FIREBASE_DEFAULTS__=([^;]+)/);\n  } catch (e) {\n    // Some environments such as Angular Universal SSR have a\n    // `document` object but error on accessing `document.cookie`.\n    return;\n  }\n  const decoded = match && base64Decode(match[1]);\n  return decoded && JSON.parse(decoded);\n};\n\n/**\n * Get the __FIREBASE_DEFAULTS__ object. It checks in order:\n * (1) if such an object exists as a property of `globalThis`\n * (2) if such an object was provided on a shell environment variable\n * (3) if such an object exists in a cookie\n * @public\n */\nexport const getDefaults = (): FirebaseDefaults | undefined => {\n  try {\n    return (\n      getDefaultsFromGlobal() ||\n      getDefaultsFromEnvVariable() ||\n      getDefaultsFromCookie()\n    );\n  } catch (e) {\n    /**\n     * Catch-all for being unable to get __FIREBASE_DEFAULTS__ due\n     * to any environment case we have not accounted for. Log to\n     * info instead of swallowing so we can find these unknown cases\n     * and add paths for them if needed.\n     */\n    console.info(`Unable to get __FIREBASE_DEFAULTS__ due to: ${e}`);\n    return;\n  }\n};\n\n/**\n * Returns emulator host stored in the __FIREBASE_DEFAULTS__ object\n * for the given product.\n * @returns a URL host formatted like `127.0.0.1:9999` or `[::1]:4000` if available\n * @public\n */\nexport const getDefaultEmulatorHost = (\n  productName: string\n): string | undefined => getDefaults()?.emulatorHosts?.[productName];\n\n/**\n * Returns emulator hostname and port stored in the __FIREBASE_DEFAULTS__ object\n * for the given product.\n * @returns a pair of hostname and port like `[\"::1\", 4000]` if available\n * @public\n */\nexport const getDefaultEmulatorHostnameAndPort = (\n  productName: string\n): [hostname: string, port: number] | undefined => {\n  const host = getDefaultEmulatorHost(productName);\n  if (!host) {\n    return undefined;\n  }\n  const separatorIndex = host.lastIndexOf(':'); // Finding the last since IPv6 addr also has colons.\n  if (separatorIndex <= 0 || separatorIndex + 1 === host.length) {\n    throw new Error(`Invalid host ${host} with no separate hostname and port!`);\n  }\n  // eslint-disable-next-line no-restricted-globals\n  const port = parseInt(host.substring(separatorIndex + 1), 10);\n  if (host[0] === '[') {\n    // Bracket-quoted `[ipv6addr]:port` => return \"ipv6addr\" (without brackets).\n    return [host.substring(1, separatorIndex - 1), port];\n  } else {\n    return [host.substring(0, separatorIndex), port];\n  }\n};\n\n/**\n * Returns Firebase app config stored in the __FIREBASE_DEFAULTS__ object.\n * @public\n */\nexport const getDefaultAppConfig = (): Record<string, string> | undefined =>\n  getDefaults()?.config;\n\n/**\n * Returns an experimental setting on the __FIREBASE_DEFAULTS__ object (properties\n * prefixed by \"_\")\n * @public\n */\nexport const getExperimentalSetting = <T extends ExperimentalKey>(\n  name: T\n): FirebaseDefaults[`_${T}`] =>\n  getDefaults()?.[`_${name}`] as FirebaseDefaults[`_${T}`];\n","/**\n * @license\n * Copyright 2022 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/**\n * Polyfill for `globalThis` object.\n * @returns the `globalThis` object for the given environment.\n * @public\n */\nexport function getGlobal(): typeof globalThis {\n  if (typeof self !== 'undefined') {\n    return self;\n  }\n  if (typeof window !== 'undefined') {\n    return window;\n  }\n  if (typeof global !== 'undefined') {\n    return global;\n  }\n  throw new Error('Unable to locate global object.');\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * @fileoverview Standardized Firebase Error.\n *\n * Usage:\n *\n *   // Typescript string literals for type-safe codes\n *   type Err =\n *     'unknown' |\n *     'object-not-found'\n *     ;\n *\n *   // Closure enum for type-safe error codes\n *   // at-enum {string}\n *   var Err = {\n *     UNKNOWN: 'unknown',\n *     OBJECT_NOT_FOUND: 'object-not-found',\n *   }\n *\n *   let errors: Map<Err, string> = {\n *     'generic-error': \"Unknown error\",\n *     'file-not-found': \"Could not find file: {$file}\",\n *   };\n *\n *   // Type-safe function - must pass a valid error code as param.\n *   let error = new ErrorFactory<Err>('service', 'Service', errors);\n *\n *   ...\n *   throw error.create(Err.GENERIC);\n *   ...\n *   throw error.create(Err.FILE_NOT_FOUND, {'file': fileName});\n *   ...\n *   // Service: Could not file file: foo.txt (service/file-not-found).\n *\n *   catch (e) {\n *     assert(e.message === \"Could not find file: foo.txt.\");\n *     if ((e as FirebaseError)?.code === 'service/file-not-found') {\n *       console.log(\"Could not read file: \" + e['file']);\n *     }\n *   }\n */\n\nexport type ErrorMap<ErrorCode extends string> = {\n  readonly [K in ErrorCode]: string;\n};\n\nconst ERROR_NAME = 'FirebaseError';\n\nexport interface StringLike {\n  toString(): string;\n}\n\nexport interface ErrorData {\n  [key: string]: unknown;\n}\n\n// Based on code from:\n// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Error#Custom_Error_Types\nexport class FirebaseError extends Error {\n  /** The custom name for all FirebaseErrors. */\n  readonly name: string = ERROR_NAME;\n\n  constructor(\n    /** The error code for this error. */\n    readonly code: string,\n    message: string,\n    /** Custom data for this error. */\n    public customData?: Record<string, unknown>\n  ) {\n    super(message);\n\n    // Fix For ES5\n    // https://github.com/Microsoft/TypeScript-wiki/blob/master/Breaking-Changes.md#extending-built-ins-like-error-array-and-map-may-no-longer-work\n    Object.setPrototypeOf(this, FirebaseError.prototype);\n\n    // Maintains proper stack trace for where our error was thrown.\n    // Only available on V8.\n    if (Error.captureStackTrace) {\n      Error.captureStackTrace(this, ErrorFactory.prototype.create);\n    }\n  }\n}\n\nexport class ErrorFactory<\n  ErrorCode extends string,\n  ErrorParams extends { readonly [K in ErrorCode]?: ErrorData } = {}\n> {\n  constructor(\n    private readonly service: string,\n    private readonly serviceName: string,\n    private readonly errors: ErrorMap<ErrorCode>\n  ) {}\n\n  create<K extends ErrorCode>(\n    code: K,\n    ...data: K extends keyof ErrorParams ? [ErrorParams[K]] : []\n  ): FirebaseError {\n    const customData = (data[0] as ErrorData) || {};\n    const fullCode = `${this.service}/${code}`;\n    const template = this.errors[code];\n\n    const message = template ? replaceTemplate(template, customData) : 'Error';\n    // Service Name: Error message (service/code).\n    const fullMessage = `${this.serviceName}: ${message} (${fullCode}).`;\n\n    const error = new FirebaseError(fullCode, fullMessage, customData);\n\n    return error;\n  }\n}\n\nfunction replaceTemplate(template: string, data: ErrorData): string {\n  return template.replace(PATTERN, (_, key) => {\n    const value = data[key];\n    return value != null ? String(value) : `<${key}?>`;\n  });\n}\n\nconst PATTERN = /\\{\\$([^}]+)}/g;\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nexport function contains<T extends object>(obj: T, key: string): boolean {\n  return Object.prototype.hasOwnProperty.call(obj, key);\n}\n\nexport function safeGet<T extends object, K extends keyof T>(\n  obj: T,\n  key: K\n): T[K] | undefined {\n  if (Object.prototype.hasOwnProperty.call(obj, key)) {\n    return obj[key];\n  } else {\n    return undefined;\n  }\n}\n\nexport function isEmpty(obj: object): obj is {} {\n  for (const key in obj) {\n    if (Object.prototype.hasOwnProperty.call(obj, key)) {\n      return false;\n    }\n  }\n  return true;\n}\n\nexport function map<K extends string, V, U>(\n  obj: { [key in K]: V },\n  fn: (value: V, key: K, obj: { [key in K]: V }) => U,\n  contextObj?: unknown\n): { [key in K]: U } {\n  const res: Partial<{ [key in K]: U }> = {};\n  for (const key in obj) {\n    if (Object.prototype.hasOwnProperty.call(obj, key)) {\n      res[key] = fn.call(contextObj, obj[key], key, obj);\n    }\n  }\n  return res as { [key in K]: U };\n}\n\n/**\n * Deep equal two objects. Support Arrays and Objects.\n */\nexport function deepEqual(a: object, b: object): boolean {\n  if (a === b) {\n    return true;\n  }\n\n  const aKeys = Object.keys(a);\n  const bKeys = Object.keys(b);\n  for (const k of aKeys) {\n    if (!bKeys.includes(k)) {\n      return false;\n    }\n\n    const aProp = (a as Record<string, unknown>)[k];\n    const bProp = (b as Record<string, unknown>)[k];\n    if (isObject(aProp) && isObject(bProp)) {\n      if (!deepEqual(aProp, bProp)) {\n        return false;\n      }\n    } else if (aProp !== bProp) {\n      return false;\n    }\n  }\n\n  for (const k of bKeys) {\n    if (!aKeys.includes(k)) {\n      return false;\n    }\n  }\n  return true;\n}\n\nfunction isObject(thing: unknown): thing is object {\n  return thing !== null && typeof thing === 'object';\n}\n","/**\n * @license\n * Copyright 2021 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nexport interface Compat<T> {\n  _delegate: T;\n}\n\nexport function getModularInstance<ExpService>(\n  service: Compat<ExpService> | ExpService\n): ExpService {\n  if (service && (service as Compat<ExpService>)._delegate) {\n    return (service as Compat<ExpService>)._delegate;\n  } else {\n    return service as ExpService;\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nexport type LogLevelString =\n  | 'debug'\n  | 'verbose'\n  | 'info'\n  | 'warn'\n  | 'error'\n  | 'silent';\n\nexport interface LogOptions {\n  level: LogLevelString;\n}\n\nexport type LogCallback = (callbackParams: LogCallbackParams) => void;\n\nexport interface LogCallbackParams {\n  level: LogLevelString;\n  message: string;\n  args: unknown[];\n  type: string;\n}\n\n/**\n * A container for all of the Logger instances\n */\nexport const instances: Logger[] = [];\n\n/**\n * The JS SDK supports 5 log levels and also allows a user the ability to\n * silence the logs altogether.\n *\n * The order is a follows:\n * DEBUG < VERBOSE < INFO < WARN < ERROR\n *\n * All of the log types above the current log level will be captured (i.e. if\n * you set the log level to `INFO`, errors will still be logged, but `DEBUG` and\n * `VERBOSE` logs will not)\n */\nexport enum LogLevel {\n  DEBUG,\n  VERBOSE,\n  INFO,\n  WARN,\n  ERROR,\n  SILENT\n}\n\nconst levelStringToEnum: { [key in LogLevelString]: LogLevel } = {\n  'debug': LogLevel.DEBUG,\n  'verbose': LogLevel.VERBOSE,\n  'info': LogLevel.INFO,\n  'warn': LogLevel.WARN,\n  'error': LogLevel.ERROR,\n  'silent': LogLevel.SILENT\n};\n\n/**\n * The default log level\n */\nconst defaultLogLevel: LogLevel = LogLevel.INFO;\n\n/**\n * We allow users the ability to pass their own log handler. We will pass the\n * type of log, the current log level, and any other arguments passed (i.e. the\n * messages that the user wants to log) to this function.\n */\nexport type LogHandler = (\n  loggerInstance: Logger,\n  logType: LogLevel,\n  ...args: unknown[]\n) => void;\n\n/**\n * By default, `console.debug` is not displayed in the developer console (in\n * chrome). To avoid forcing users to have to opt-in to these logs twice\n * (i.e. once for firebase, and once in the console), we are sending `DEBUG`\n * logs to the `console.log` function.\n */\nconst ConsoleMethod = {\n  [LogLevel.DEBUG]: 'log',\n  [LogLevel.VERBOSE]: 'log',\n  [LogLevel.INFO]: 'info',\n  [LogLevel.WARN]: 'warn',\n  [LogLevel.ERROR]: 'error'\n};\n\n/**\n * The default log handler will forward DEBUG, VERBOSE, INFO, WARN, and ERROR\n * messages on to their corresponding console counterparts (if the log method\n * is supported by the current log level)\n */\nconst defaultLogHandler: LogHandler = (instance, logType, ...args): void => {\n  if (logType < instance.logLevel) {\n    return;\n  }\n  const now = new Date().toISOString();\n  const method = ConsoleMethod[logType as keyof typeof ConsoleMethod];\n  if (method) {\n    console[method as 'log' | 'info' | 'warn' | 'error'](\n      `[${now}]  ${instance.name}:`,\n      ...args\n    );\n  } else {\n    throw new Error(\n      `Attempted to log a message with an invalid logType (value: ${logType})`\n    );\n  }\n};\n\nexport class Logger {\n  /**\n   * Gives you an instance of a Logger to capture messages according to\n   * Firebase's logging scheme.\n   *\n   * @param name The name that the logs will be associated with\n   */\n  constructor(public name: string) {\n    /**\n     * Capture the current instance for later use\n     */\n    instances.push(this);\n  }\n\n  /**\n   * The log level of the given Logger instance.\n   */\n  private _logLevel = defaultLogLevel;\n\n  get logLevel(): LogLevel {\n    return this._logLevel;\n  }\n\n  set logLevel(val: LogLevel) {\n    if (!(val in LogLevel)) {\n      throw new TypeError(`Invalid value \"${val}\" assigned to \\`logLevel\\``);\n    }\n    this._logLevel = val;\n  }\n\n  // Workaround for setter/getter having to be the same type.\n  setLogLevel(val: LogLevel | LogLevelString): void {\n    this._logLevel = typeof val === 'string' ? levelStringToEnum[val] : val;\n  }\n\n  /**\n   * The main (internal) log handler for the Logger instance.\n   * Can be set to a new function in internal package code but not by user.\n   */\n  private _logHandler: LogHandler = defaultLogHandler;\n  get logHandler(): LogHandler {\n    return this._logHandler;\n  }\n  set logHandler(val: LogHandler) {\n    if (typeof val !== 'function') {\n      throw new TypeError('Value assigned to `logHandler` must be a function');\n    }\n    this._logHandler = val;\n  }\n\n  /**\n   * The optional, additional, user-defined log handler for the Logger instance.\n   */\n  private _userLogHandler: LogHandler | null = null;\n  get userLogHandler(): LogHandler | null {\n    return this._userLogHandler;\n  }\n  set userLogHandler(val: LogHandler | null) {\n    this._userLogHandler = val;\n  }\n\n  /**\n   * The functions below are all based on the `console` interface\n   */\n\n  debug(...args: unknown[]): void {\n    this._userLogHandler && this._userLogHandler(this, LogLevel.DEBUG, ...args);\n    this._logHandler(this, LogLevel.DEBUG, ...args);\n  }\n  log(...args: unknown[]): void {\n    this._userLogHandler &&\n      this._userLogHandler(this, LogLevel.VERBOSE, ...args);\n    this._logHandler(this, LogLevel.VERBOSE, ...args);\n  }\n  info(...args: unknown[]): void {\n    this._userLogHandler && this._userLogHandler(this, LogLevel.INFO, ...args);\n    this._logHandler(this, LogLevel.INFO, ...args);\n  }\n  warn(...args: unknown[]): void {\n    this._userLogHandler && this._userLogHandler(this, LogLevel.WARN, ...args);\n    this._logHandler(this, LogLevel.WARN, ...args);\n  }\n  error(...args: unknown[]): void {\n    this._userLogHandler && this._userLogHandler(this, LogLevel.ERROR, ...args);\n    this._logHandler(this, LogLevel.ERROR, ...args);\n  }\n}\n\nexport function setLogLevel(level: LogLevelString | LogLevel): void {\n  instances.forEach(inst => {\n    inst.setLogLevel(level);\n  });\n}\n\nexport function setUserLogHandler(\n  logCallback: LogCallback | null,\n  options?: LogOptions\n): void {\n  for (const instance of instances) {\n    let customLogLevel: LogLevel | null = null;\n    if (options && options.level) {\n      customLogLevel = levelStringToEnum[options.level];\n    }\n    if (logCallback === null) {\n      instance.userLogHandler = null;\n    } else {\n      instance.userLogHandler = (\n        instance: Logger,\n        level: LogLevel,\n        ...args: unknown[]\n      ) => {\n        const message = args\n          .map(arg => {\n            if (arg == null) {\n              return null;\n            } else if (typeof arg === 'string') {\n              return arg;\n            } else if (typeof arg === 'number' || typeof arg === 'boolean') {\n              return arg.toString();\n            } else if (arg instanceof Error) {\n              return arg.message;\n            } else {\n              try {\n                return JSON.stringify(arg);\n              } catch (ignored) {\n                return null;\n              }\n            }\n          })\n          .filter(arg => arg)\n          .join(' ');\n        if (level >= (customLogLevel ?? instance.logLevel)) {\n          logCallback({\n            level: LogLevel[level].toLowerCase() as LogLevelString,\n            message,\n            args,\n            type: instance.name\n          });\n        }\n      };\n    }\n  }\n}\n","import { _getProvider, getApp as t, _removeServiceInstance as e, _registerComponent as n, registerVersion as r, SDK_VERSION as s } from \"@firebase/app\";\n\nimport { Component as i } from \"@firebase/component\";\n\nimport { Logger as o, LogLevel as u } from \"@firebase/logger\";\n\nimport { FirebaseError as c, getDefaultEmulatorHostnameAndPort as a, createMockUserToken as h, getModularInstance as l, deepEqual as f } from \"@firebase/util\";\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * Simple wrapper around a nullable UID. Mostly exists to make code more\n * readable.\n */\nclass d {\n    constructor(t) {\n        this.uid = t;\n    }\n    isAuthenticated() {\n        return null != this.uid;\n    }\n    /**\n     * Returns a key representing this user, suitable for inclusion in a\n     * dictionary.\n     */    toKey() {\n        return this.isAuthenticated() ? \"uid:\" + this.uid : \"anonymous-user\";\n    }\n    isEqual(t) {\n        return t.uid === this.uid;\n    }\n}\n\n/** A user with a null UID. */ d.UNAUTHENTICATED = new d(null), \n// TODO(mikelehen): Look into getting a proper uid-equivalent for\n// non-FirebaseAuth providers.\nd.GOOGLE_CREDENTIALS = new d(\"google-credentials-uid\"), d.FIRST_PARTY = new d(\"first-party-uid\"), \nd.MOCK_USER = new d(\"mock-user\");\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nlet w = \"9.23.0\";\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nconst m = new o(\"@firebase/firestore\");\n\n/**\n * Sets the verbosity of Cloud Firestore logs (debug, error, or silent).\n *\n * @param logLevel - The verbosity you set for activity and error logging. Can\n *   be any of the following values:\n *\n *   <ul>\n *     <li>`debug` for the most verbose logging level, primarily for\n *     debugging.</li>\n *     <li>`error` to log errors only.</li>\n *     <li><code>`silent` to turn off logging.</li>\n *   </ul>\n */ function p(t) {\n    m.setLogLevel(t);\n}\n\nfunction y(t, ...e) {\n    if (m.logLevel <= u.DEBUG) {\n        const n = e.map(v);\n        m.debug(`Firestore (${w}): ${t}`, ...n);\n    }\n}\n\nfunction g(t, ...e) {\n    if (m.logLevel <= u.ERROR) {\n        const n = e.map(v);\n        m.error(`Firestore (${w}): ${t}`, ...n);\n    }\n}\n\n/**\n * @internal\n */ function _(t, ...e) {\n    if (m.logLevel <= u.WARN) {\n        const n = e.map(v);\n        m.warn(`Firestore (${w}): ${t}`, ...n);\n    }\n}\n\n/**\n * Converts an additional log parameter to a string representation.\n */ function v(t) {\n    if (\"string\" == typeof t) return t;\n    try {\n        return e = t, JSON.stringify(e);\n    } catch (e) {\n        // Converting to JSON failed, just log the object directly\n        return t;\n    }\n    /**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n    /** Formats an object as a JSON string, suitable for logging. */\n    var e;\n}\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * Unconditionally fails, throwing an Error with the given message.\n * Messages are stripped in production builds.\n *\n * Returns `never` and can be used in expressions:\n * @example\n * let futureVar = fail('not implemented yet');\n */ function b(t = \"Unexpected state\") {\n    // Log the failure in addition to throw an exception, just in case the\n    // exception is swallowed.\n    const e = `FIRESTORE (${w}) INTERNAL ASSERTION FAILED: ` + t;\n    // NOTE: We don't use FirestoreError here because these are internal failures\n    // that cannot be handled by the user. (Also it would create a circular\n    // dependency between the error and assert modules which doesn't work.)\n    throw g(e), new Error(e);\n}\n\n/**\n * Fails if the given assertion condition is false, throwing an Error with the\n * given message if it did.\n *\n * Messages are stripped in production builds.\n */ function E(t, e) {\n    t || b();\n}\n\n/**\n * Casts `obj` to `T`. In non-production builds, verifies that `obj` is an\n * instance of `T` before casting.\n */ function I(t, \n// eslint-disable-next-line @typescript-eslint/no-explicit-any\ne) {\n    return t;\n}\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */ const T = \"ok\", A = \"cancelled\", R = \"unknown\", P = \"invalid-argument\", V = \"deadline-exceeded\", $ = \"not-found\", N = \"already-exists\", D = \"permission-denied\", F = \"unauthenticated\", x = \"resource-exhausted\", S = \"failed-precondition\", q = \"aborted\", O = \"out-of-range\", k = \"unimplemented\", C = \"internal\", M = \"unavailable\", L = \"data-loss\";\n\n/** An error returned by a Firestore operation. */ class U extends c {\n    /** @hideconstructor */\n    constructor(\n    /**\n     * The backend error code associated with this error.\n     */\n    t, \n    /**\n     * A custom error description.\n     */\n    e) {\n        super(t, e), this.code = t, this.message = e, \n        // HACK: We write a toString property directly because Error is not a real\n        // class and so inheritance does not work correctly. We could alternatively\n        // do the same \"back-door inheritance\" trick that FirebaseError does.\n        this.toString = () => `${this.name}: [code=${this.code}]: ${this.message}`;\n    }\n}\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */ class j {\n    constructor() {\n        this.promise = new Promise(((t, e) => {\n            this.resolve = t, this.reject = e;\n        }));\n    }\n}\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */ class B {\n    constructor(t, e) {\n        this.user = e, this.type = \"OAuth\", this.headers = new Map, this.headers.set(\"Authorization\", `Bearer ${t}`);\n    }\n}\n\n/**\n * A CredentialsProvider that always yields an empty token.\n * @internal\n */ class Q {\n    getToken() {\n        return Promise.resolve(null);\n    }\n    invalidateToken() {}\n    start(t, e) {\n        // Fire with initial user.\n        t.enqueueRetryable((() => e(d.UNAUTHENTICATED)));\n    }\n    shutdown() {}\n}\n\n/**\n * A CredentialsProvider that always returns a constant token. Used for\n * emulator token mocking.\n */ class z {\n    constructor(t) {\n        this.token = t, \n        /**\n         * Stores the listener registered with setChangeListener()\n         * This isn't actually necessary since the UID never changes, but we use this\n         * to verify the listen contract is adhered to in tests.\n         */\n        this.changeListener = null;\n    }\n    getToken() {\n        return Promise.resolve(this.token);\n    }\n    invalidateToken() {}\n    start(t, e) {\n        this.changeListener = e, \n        // Fire with initial user.\n        t.enqueueRetryable((() => e(this.token.user)));\n    }\n    shutdown() {\n        this.changeListener = null;\n    }\n}\n\n/** Credential provider for the Lite SDK. */ class W {\n    constructor(t) {\n        this.auth = null, t.onInit((t => {\n            this.auth = t;\n        }));\n    }\n    getToken() {\n        return this.auth ? this.auth.getToken().then((t => t ? (E(\"string\" == typeof t.accessToken), \n        new B(t.accessToken, new d(this.auth.getUid()))) : null)) : Promise.resolve(null);\n    }\n    invalidateToken() {}\n    start(t, e) {}\n    shutdown() {}\n}\n\n/*\n * FirstPartyToken provides a fresh token each time its value\n * is requested, because if the token is too old, requests will be rejected.\n * Technically this may no longer be necessary since the SDK should gracefully\n * recover from unauthenticated errors (see b/33147818 for context), but it's\n * safer to keep the implementation as-is.\n */ class G {\n    constructor(t, e, n) {\n        this.t = t, this.i = e, this.o = n, this.type = \"FirstParty\", this.user = d.FIRST_PARTY, \n        this.u = new Map;\n    }\n    /**\n     * Gets an authorization token, using a provided factory function, or return\n     * null.\n     */    h() {\n        return this.o ? this.o() : null;\n    }\n    get headers() {\n        this.u.set(\"X-Goog-AuthUser\", this.t);\n        // Use array notation to prevent minification\n        const t = this.h();\n        return t && this.u.set(\"Authorization\", t), this.i && this.u.set(\"X-Goog-Iam-Authorization-Token\", this.i), \n        this.u;\n    }\n}\n\n/*\n * Provides user credentials required for the Firestore JavaScript SDK\n * to authenticate the user, using technique that is only available\n * to applications hosted by Google.\n */ class K {\n    constructor(t, e, n) {\n        this.t = t, this.i = e, this.o = n;\n    }\n    getToken() {\n        return Promise.resolve(new G(this.t, this.i, this.o));\n    }\n    start(t, e) {\n        // Fire with initial uid.\n        t.enqueueRetryable((() => e(d.FIRST_PARTY)));\n    }\n    shutdown() {}\n    invalidateToken() {}\n}\n\nclass Y {\n    constructor(t) {\n        this.value = t, this.type = \"AppCheck\", this.headers = new Map, t && t.length > 0 && this.headers.set(\"x-firebase-appcheck\", this.value);\n    }\n}\n\n/** AppCheck token provider for the Lite SDK. */ class H {\n    constructor(t) {\n        this.l = t, this.appCheck = null, t.onInit((t => {\n            this.appCheck = t;\n        }));\n    }\n    getToken() {\n        return this.appCheck ? this.appCheck.getToken().then((t => t ? (E(\"string\" == typeof t.token), \n        new Y(t.token)) : null)) : Promise.resolve(null);\n    }\n    invalidateToken() {}\n    start(t, e) {}\n    shutdown() {}\n}\n\n/**\n * Builds a CredentialsProvider depending on the type of\n * the credentials passed in.\n */\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nclass J {\n    /**\n     * Constructs a DatabaseInfo using the provided host, databaseId and\n     * persistenceKey.\n     *\n     * @param databaseId - The database to use.\n     * @param appId - The Firebase App Id.\n     * @param persistenceKey - A unique identifier for this Firestore's local\n     * storage (used in conjunction with the databaseId).\n     * @param host - The Firestore backend host to connect to.\n     * @param ssl - Whether to use SSL when connecting.\n     * @param forceLongPolling - Whether to use the forceLongPolling option\n     * when using WebChannel as the network transport.\n     * @param autoDetectLongPolling - Whether to use the detectBufferingProxy\n     * option when using WebChannel as the network transport.\n     * @param longPollingOptions Options that configure long-polling.\n     * @param useFetchStreams Whether to use the Fetch API instead of\n     * XMLHTTPRequest\n     */\n    constructor(t, e, n, r, s, i, o, u, c) {\n        this.databaseId = t, this.appId = e, this.persistenceKey = n, this.host = r, this.ssl = s, \n        this.forceLongPolling = i, this.autoDetectLongPolling = o, this.longPollingOptions = u, \n        this.useFetchStreams = c;\n    }\n}\n\n/** The default database name for a project. */\n/**\n * Represents the database ID a Firestore client is associated with.\n * @internal\n */\nclass X {\n    constructor(t, e) {\n        this.projectId = t, this.database = e || \"(default)\";\n    }\n    static empty() {\n        return new X(\"\", \"\");\n    }\n    get isDefaultDatabase() {\n        return \"(default)\" === this.database;\n    }\n    isEqual(t) {\n        return t instanceof X && t.projectId === this.projectId && t.database === this.database;\n    }\n}\n\n/**\n * Path represents an ordered sequence of string segments.\n */\nclass Z {\n    constructor(t, e, n) {\n        void 0 === e ? e = 0 : e > t.length && b(), void 0 === n ? n = t.length - e : n > t.length - e && b(), \n        this.segments = t, this.offset = e, this.len = n;\n    }\n    get length() {\n        return this.len;\n    }\n    isEqual(t) {\n        return 0 === Z.comparator(this, t);\n    }\n    child(t) {\n        const e = this.segments.slice(this.offset, this.limit());\n        return t instanceof Z ? t.forEach((t => {\n            e.push(t);\n        })) : e.push(t), this.construct(e);\n    }\n    /** The index of one past the last segment of the path. */    limit() {\n        return this.offset + this.length;\n    }\n    popFirst(t) {\n        return t = void 0 === t ? 1 : t, this.construct(this.segments, this.offset + t, this.length - t);\n    }\n    popLast() {\n        return this.construct(this.segments, this.offset, this.length - 1);\n    }\n    firstSegment() {\n        return this.segments[this.offset];\n    }\n    lastSegment() {\n        return this.get(this.length - 1);\n    }\n    get(t) {\n        return this.segments[this.offset + t];\n    }\n    isEmpty() {\n        return 0 === this.length;\n    }\n    isPrefixOf(t) {\n        if (t.length < this.length) return !1;\n        for (let e = 0; e < this.length; e++) if (this.get(e) !== t.get(e)) return !1;\n        return !0;\n    }\n    isImmediateParentOf(t) {\n        if (this.length + 1 !== t.length) return !1;\n        for (let e = 0; e < this.length; e++) if (this.get(e) !== t.get(e)) return !1;\n        return !0;\n    }\n    forEach(t) {\n        for (let e = this.offset, n = this.limit(); e < n; e++) t(this.segments[e]);\n    }\n    toArray() {\n        return this.segments.slice(this.offset, this.limit());\n    }\n    static comparator(t, e) {\n        const n = Math.min(t.length, e.length);\n        for (let r = 0; r < n; r++) {\n            const n = t.get(r), s = e.get(r);\n            if (n < s) return -1;\n            if (n > s) return 1;\n        }\n        return t.length < e.length ? -1 : t.length > e.length ? 1 : 0;\n    }\n}\n\n/**\n * A slash-separated path for navigating resources (documents and collections)\n * within Firestore.\n *\n * @internal\n */ class tt extends Z {\n    construct(t, e, n) {\n        return new tt(t, e, n);\n    }\n    canonicalString() {\n        // NOTE: The client is ignorant of any path segments containing escape\n        // sequences (e.g. __id123__) and just passes them through raw (they exist\n        // for legacy reasons and should not be used frequently).\n        return this.toArray().join(\"/\");\n    }\n    toString() {\n        return this.canonicalString();\n    }\n    /**\n     * Creates a resource path from the given slash-delimited string. If multiple\n     * arguments are provided, all components are combined. Leading and trailing\n     * slashes from all components are ignored.\n     */    static fromString(...t) {\n        // NOTE: The client is ignorant of any path segments containing escape\n        // sequences (e.g. __id123__) and just passes them through raw (they exist\n        // for legacy reasons and should not be used frequently).\n        const e = [];\n        for (const n of t) {\n            if (n.indexOf(\"//\") >= 0) throw new U(P, `Invalid segment (${n}). Paths must not contain // in them.`);\n            // Strip leading and traling slashed.\n                        e.push(...n.split(\"/\").filter((t => t.length > 0)));\n        }\n        return new tt(e);\n    }\n    static emptyPath() {\n        return new tt([]);\n    }\n}\n\nconst et = /^[_a-zA-Z][_a-zA-Z0-9]*$/;\n\n/**\n * A dot-separated path for navigating sub-objects within a document.\n * @internal\n */ class nt extends Z {\n    construct(t, e, n) {\n        return new nt(t, e, n);\n    }\n    /**\n     * Returns true if the string could be used as a segment in a field path\n     * without escaping.\n     */    static isValidIdentifier(t) {\n        return et.test(t);\n    }\n    canonicalString() {\n        return this.toArray().map((t => (t = t.replace(/\\\\/g, \"\\\\\\\\\").replace(/`/g, \"\\\\`\"), \n        nt.isValidIdentifier(t) || (t = \"`\" + t + \"`\"), t))).join(\".\");\n    }\n    toString() {\n        return this.canonicalString();\n    }\n    /**\n     * Returns true if this field references the key of a document.\n     */    isKeyField() {\n        return 1 === this.length && \"__name__\" === this.get(0);\n    }\n    /**\n     * The field designating the key of a document.\n     */    static keyField() {\n        return new nt([ \"__name__\" ]);\n    }\n    /**\n     * Parses a field string from the given server-formatted string.\n     *\n     * - Splitting the empty string is not allowed (for now at least).\n     * - Empty segments within the string (e.g. if there are two consecutive\n     *   separators) are not allowed.\n     *\n     * TODO(b/37244157): we should make this more strict. Right now, it allows\n     * non-identifier path components, even if they aren't escaped.\n     */    static fromServerFormat(t) {\n        const e = [];\n        let n = \"\", r = 0;\n        const s = () => {\n            if (0 === n.length) throw new U(P, `Invalid field path (${t}). Paths must not be empty, begin with '.', end with '.', or contain '..'`);\n            e.push(n), n = \"\";\n        };\n        let i = !1;\n        for (;r < t.length; ) {\n            const e = t[r];\n            if (\"\\\\\" === e) {\n                if (r + 1 === t.length) throw new U(P, \"Path has trailing escape character: \" + t);\n                const e = t[r + 1];\n                if (\"\\\\\" !== e && \".\" !== e && \"`\" !== e) throw new U(P, \"Path has invalid escape sequence: \" + t);\n                n += e, r += 2;\n            } else \"`\" === e ? (i = !i, r++) : \".\" !== e || i ? (n += e, r++) : (s(), r++);\n        }\n        if (s(), i) throw new U(P, \"Unterminated ` in path: \" + t);\n        return new nt(e);\n    }\n    static emptyPath() {\n        return new nt([]);\n    }\n}\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * @internal\n */ class rt {\n    constructor(t) {\n        this.path = t;\n    }\n    static fromPath(t) {\n        return new rt(tt.fromString(t));\n    }\n    static fromName(t) {\n        return new rt(tt.fromString(t).popFirst(5));\n    }\n    static empty() {\n        return new rt(tt.emptyPath());\n    }\n    get collectionGroup() {\n        return this.path.popLast().lastSegment();\n    }\n    /** Returns true if the document is in the specified collectionId. */    hasCollectionId(t) {\n        return this.path.length >= 2 && this.path.get(this.path.length - 2) === t;\n    }\n    /** Returns the collection group (i.e. the name of the parent collection) for this key. */    getCollectionGroup() {\n        return this.path.get(this.path.length - 2);\n    }\n    /** Returns the fully qualified path to the parent collection. */    getCollectionPath() {\n        return this.path.popLast();\n    }\n    isEqual(t) {\n        return null !== t && 0 === tt.comparator(this.path, t.path);\n    }\n    toString() {\n        return this.path.toString();\n    }\n    static comparator(t, e) {\n        return tt.comparator(t.path, e.path);\n    }\n    static isDocumentKey(t) {\n        return t.length % 2 == 0;\n    }\n    /**\n     * Creates and returns a new document key with the given segments.\n     *\n     * @param segments - The segments of the path to the document\n     * @returns A new instance of DocumentKey\n     */    static fromSegments(t) {\n        return new rt(new tt(t.slice()));\n    }\n}\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */ function st(t, e, n) {\n    if (!n) throw new U(P, `Function ${t}() cannot be called with an empty ${e}.`);\n}\n\n/**\n * Validates that two boolean options are not set at the same time.\n * @internal\n */\n/**\n * Validates that `path` refers to a document (indicated by the fact it contains\n * an even numbers of segments).\n */\nfunction it(t) {\n    if (!rt.isDocumentKey(t)) throw new U(P, `Invalid document reference. Document references must have an even number of segments, but ${t} has ${t.length}.`);\n}\n\n/**\n * Validates that `path` refers to a collection (indicated by the fact it\n * contains an odd numbers of segments).\n */ function ot(t) {\n    if (rt.isDocumentKey(t)) throw new U(P, `Invalid collection reference. Collection references must have an odd number of segments, but ${t} has ${t.length}.`);\n}\n\n/**\n * Returns true if it's a non-null object without a custom prototype\n * (i.e. excludes Array, Date, etc.).\n */\n/** Returns a string describing the type / value of the provided input. */\nfunction ut(t) {\n    if (void 0 === t) return \"undefined\";\n    if (null === t) return \"null\";\n    if (\"string\" == typeof t) return t.length > 20 && (t = `${t.substring(0, 20)}...`), \n    JSON.stringify(t);\n    if (\"number\" == typeof t || \"boolean\" == typeof t) return \"\" + t;\n    if (\"object\" == typeof t) {\n        if (t instanceof Array) return \"an array\";\n        {\n            const e = \n            /** try to get the constructor name for an object. */\n            function(t) {\n                if (t.constructor) return t.constructor.name;\n                return null;\n            }\n            /**\n * Casts `obj` to `T`, optionally unwrapping Compat types to expose the\n * underlying instance. Throws if  `obj` is not an instance of `T`.\n *\n * This cast is used in the Lite and Full SDK to verify instance types for\n * arguments passed to the public API.\n * @internal\n */ (t);\n            return e ? `a custom ${e} object` : \"an object\";\n        }\n    }\n    return \"function\" == typeof t ? \"a function\" : b();\n}\n\nfunction ct(t, \n// eslint-disable-next-line @typescript-eslint/no-explicit-any\ne) {\n    if (\"_delegate\" in t && (\n    // Unwrap Compat types\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    t = t._delegate), !(t instanceof e)) {\n        if (e.name === t.constructor.name) throw new U(P, \"Type does not match the expected instance. Did you pass a reference from a different Firestore SDK?\");\n        {\n            const n = ut(t);\n            throw new U(P, `Expected type '${e.name}', but it was: ${n}`);\n        }\n    }\n    return t;\n}\n\nfunction at(t, e) {\n    if (e <= 0) throw new U(P, `Function ${t}() requires a positive number, but it was: ${e}.`);\n}\n\n/**\n * @license\n * Copyright 2023 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * Compares two `ExperimentalLongPollingOptions` objects for equality.\n */\n/**\n * Creates and returns a new `ExperimentalLongPollingOptions` with the same\n * option values as the given instance.\n */\nfunction ht(t) {\n    const e = {};\n    return void 0 !== t.timeoutSeconds && (e.timeoutSeconds = t.timeoutSeconds), e;\n}\n\n/**\n * @license\n * Copyright 2023 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * The value returned from the most recent invocation of\n * `generateUniqueDebugId()`, or null if it has never been invoked.\n */ let lt = null;\n\n/**\n * Generates and returns an initial value for `lastUniqueDebugId`.\n *\n * The returned value is randomly selected from a range of integers that are\n * represented as 8 hexadecimal digits. This means that (within reason) any\n * numbers generated by incrementing the returned number by 1 will also be\n * represented by 8 hexadecimal digits. This leads to all \"IDs\" having the same\n * length when converted to a hexadecimal string, making reading logs containing\n * these IDs easier to follow. And since the return value is randomly selected\n * it will help to differentiate between logs from different executions.\n */\n/**\n * Generates and returns a unique ID as a hexadecimal string.\n *\n * The returned ID is intended to be used in debug logging messages to help\n * correlate log messages that may be spatially separated in the logs, but\n * logically related. For example, a network connection could include the same\n * \"debug ID\" string in all of its log messages to help trace a specific\n * connection over time.\n *\n * @return the 10-character generated ID (e.g. \"0xa1b2c3d4\").\n */\nfunction ft() {\n    return null === lt ? lt = 268435456 + Math.round(2147483648 * Math.random()) : lt++, \n    \"0x\" + lt.toString(16);\n}\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * Returns whether a variable is either undefined or null.\n */ function dt(t) {\n    return null == t;\n}\n\n/** Returns whether the value represents -0. */ function wt(t) {\n    // Detect if the value is -0.0. Based on polyfill from\n    // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/is\n    return 0 === t && 1 / t == -1 / 0;\n}\n\n/**\n * Returns whether a value is an integer and in the safe integer range\n * @param value - The value to test for being an integer and in the safe range\n */\n/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nconst mt = {\n    BatchGetDocuments: \"batchGet\",\n    Commit: \"commit\",\n    RunQuery: \"runQuery\",\n    RunAggregationQuery: \"runAggregationQuery\"\n};\n\n/**\n * Maps RPC names to the corresponding REST endpoint name.\n *\n * We use array notation to avoid mangling.\n */\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * Error Codes describing the different ways GRPC can fail. These are copied\n * directly from GRPC's sources here:\n *\n * https://github.com/grpc/grpc/blob/bceec94ea4fc5f0085d81235d8e1c06798dc341a/include/grpc%2B%2B/impl/codegen/status_code_enum.h\n *\n * Important! The names of these identifiers matter because the string forms\n * are used for reverse lookups from the webchannel stream. Do NOT change the\n * names of these identifiers or change this into a const enum.\n */\nvar pt, yt;\n\n/**\n * Converts an HTTP Status Code to the equivalent error code.\n *\n * @param status - An HTTP Status Code, like 200, 404, 503, etc.\n * @returns The equivalent Code. Unknown status codes are mapped to\n *     Code.UNKNOWN.\n */\nfunction gt(t) {\n    if (void 0 === t) return g(\"RPC_ERROR\", \"HTTP error has no status\"), R;\n    // The canonical error codes for Google APIs [1] specify mapping onto HTTP\n    // status codes but the mapping is not bijective. In each case of ambiguity\n    // this function chooses a primary error.\n    \n    // [1]\n    // https://github.com/googleapis/googleapis/blob/master/google/rpc/code.proto\n        switch (t) {\n      case 200:\n        // OK\n        return T;\n\n      case 400:\n        // Bad Request\n        return S;\n\n        // Other possibilities based on the forward mapping\n        // return Code.INVALID_ARGUMENT;\n        // return Code.OUT_OF_RANGE;\n              case 401:\n        // Unauthorized\n        return F;\n\n      case 403:\n        // Forbidden\n        return D;\n\n      case 404:\n        // Not Found\n        return $;\n\n      case 409:\n        // Conflict\n        return q;\n\n        // Other possibilities:\n        // return Code.ALREADY_EXISTS;\n              case 416:\n        // Range Not Satisfiable\n        return O;\n\n      case 429:\n        // Too Many Requests\n        return x;\n\n      case 499:\n        // Client Closed Request\n        return A;\n\n      case 500:\n        // Internal Server Error\n        return R;\n\n        // Other possibilities:\n        // return Code.INTERNAL;\n        // return Code.DATA_LOSS;\n              case 501:\n        // Unimplemented\n        return k;\n\n      case 503:\n        // Service Unavailable\n        return M;\n\n      case 504:\n        // Gateway Timeout\n        return V;\n\n      default:\n        return t >= 200 && t < 300 ? T : t >= 400 && t < 500 ? S : t >= 500 && t < 600 ? C : R;\n    }\n}\n\n/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * A Rest-based connection that relies on the native HTTP stack\n * (e.g. `fetch` or a polyfill).\n */ (yt = pt || (pt = {}))[yt.OK = 0] = \"OK\", yt[yt.CANCELLED = 1] = \"CANCELLED\", \nyt[yt.UNKNOWN = 2] = \"UNKNOWN\", yt[yt.INVALID_ARGUMENT = 3] = \"INVALID_ARGUMENT\", \nyt[yt.DEADLINE_EXCEEDED = 4] = \"DEADLINE_EXCEEDED\", yt[yt.NOT_FOUND = 5] = \"NOT_FOUND\", \nyt[yt.ALREADY_EXISTS = 6] = \"ALREADY_EXISTS\", yt[yt.PERMISSION_DENIED = 7] = \"PERMISSION_DENIED\", \nyt[yt.UNAUTHENTICATED = 16] = \"UNAUTHENTICATED\", yt[yt.RESOURCE_EXHAUSTED = 8] = \"RESOURCE_EXHAUSTED\", \nyt[yt.FAILED_PRECONDITION = 9] = \"FAILED_PRECONDITION\", yt[yt.ABORTED = 10] = \"ABORTED\", \nyt[yt.OUT_OF_RANGE = 11] = \"OUT_OF_RANGE\", yt[yt.UNIMPLEMENTED = 12] = \"UNIMPLEMENTED\", \nyt[yt.INTERNAL = 13] = \"INTERNAL\", yt[yt.UNAVAILABLE = 14] = \"UNAVAILABLE\", yt[yt.DATA_LOSS = 15] = \"DATA_LOSS\";\n\nclass _t extends \n/**\n * Base class for all Rest-based connections to the backend (WebChannel and\n * HTTP).\n */\nclass {\n    constructor(t) {\n        this.databaseInfo = t, this.databaseId = t.databaseId;\n        const e = t.ssl ? \"https\" : \"http\";\n        this.m = e + \"://\" + t.host, this.p = \"projects/\" + this.databaseId.projectId + \"/databases/\" + this.databaseId.database + \"/documents\";\n    }\n    get g() {\n        // Both `invokeRPC()` and `invokeStreamingRPC()` use their `path` arguments to determine\n        // where to run the query, and expect the `request` to NOT specify the \"path\".\n        return !1;\n    }\n    v(t, e, n, r, s) {\n        const i = ft(), o = this.I(t, e);\n        y(\"RestConnection\", `Sending RPC '${t}' ${i}:`, o, n);\n        const u = {};\n        return this.T(u, r, s), this.A(t, o, u, n).then((e => (y(\"RestConnection\", `Received RPC '${t}' ${i}: `, e), \n        e)), (e => {\n            throw _(\"RestConnection\", `RPC '${t}' ${i} failed with error: `, e, \"url: \", o, \"request:\", n), \n            e;\n        }));\n    }\n    R(t, e, n, r, s, i) {\n        // The REST API automatically aggregates all of the streamed results, so we\n        // can just use the normal invoke() method.\n        return this.v(t, e, n, r, s);\n    }\n    /**\n     * Modifies the headers for a request, adding any authorization token if\n     * present and any additional headers for the request.\n     */    T(t, e, n) {\n        t[\"X-Goog-Api-Client\"] = \"gl-js/ fire/\" + w, \n        // Content-Type: text/plain will avoid preflight requests which might\n        // mess with CORS and redirects by proxies. If we add custom headers\n        // we will need to change this code to potentially use the $httpOverwrite\n        // parameter supported by ESF to avoid triggering preflight requests.\n        t[\"Content-Type\"] = \"text/plain\", this.databaseInfo.appId && (t[\"X-Firebase-GMPID\"] = this.databaseInfo.appId), \n        e && e.headers.forEach(((e, n) => t[n] = e)), n && n.headers.forEach(((e, n) => t[n] = e));\n    }\n    I(t, e) {\n        const n = mt[t];\n        return `${this.m}/v1/${e}:${n}`;\n    }\n} {\n    /**\n     * @param databaseInfo - The connection info.\n     * @param fetchImpl - `fetch` or a Polyfill that implements the fetch API.\n     */\n    constructor(t, e) {\n        super(t), this.P = e;\n    }\n    V(t, e) {\n        throw new Error(\"Not supported by FetchConnection\");\n    }\n    async A(t, e, n, r) {\n        var s;\n        const i = JSON.stringify(r);\n        let o;\n        try {\n            o = await this.P(e, {\n                method: \"POST\",\n                headers: n,\n                body: i\n            });\n        } catch (t) {\n            const e = t;\n            throw new U(gt(e.status), \"Request failed with error: \" + e.statusText);\n        }\n        if (!o.ok) {\n            let t = await o.json();\n            Array.isArray(t) && (t = t[0]);\n            const e = null === (s = null == t ? void 0 : t.error) || void 0 === s ? void 0 : s.message;\n            throw new U(gt(o.status), `Request failed with error: ${null != e ? e : o.statusText}`);\n        }\n        return o.json();\n    }\n}\n\n/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/** Initializes the HTTP connection for the REST API. */\n/**\n * @license\n * Copyright 2023 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * Concrete implementation of the Aggregate type.\n */\nclass vt {\n    constructor(t, e, n) {\n        this.alias = t, this.$ = e, this.fieldPath = n;\n    }\n}\n\n/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * Generates `nBytes` of random bytes.\n *\n * If `nBytes < 0` , an error will be thrown.\n */ function bt(t) {\n    // Polyfills for IE and WebWorker by using `self` and `msCrypto` when `crypto` is not available.\n    const e = \n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    \"undefined\" != typeof self && (self.crypto || self.msCrypto), n = new Uint8Array(t);\n    if (e && \"function\" == typeof e.getRandomValues) e.getRandomValues(n); else \n    // Falls back to Math.random\n    for (let e = 0; e < t; e++) n[e] = Math.floor(256 * Math.random());\n    return n;\n}\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */ class Et {\n    static N() {\n        // Alphanumeric characters\n        const t = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789\", e = Math.floor(256 / t.length) * t.length;\n        // The largest byte value that is a multiple of `char.length`.\n                let n = \"\";\n        for (;n.length < 20; ) {\n            const r = bt(40);\n            for (let s = 0; s < r.length; ++s) \n            // Only accept values that are [0, maxMultiple), this ensures they can\n            // be evenly mapped to indices of `chars` via a modulo operation.\n            n.length < 20 && r[s] < e && (n += t.charAt(r[s] % t.length));\n        }\n        return n;\n    }\n}\n\nfunction It(t, e) {\n    return t < e ? -1 : t > e ? 1 : 0;\n}\n\n/** Helper to compare arrays using isEqual(). */ function Tt(t, e, n) {\n    return t.length === e.length && t.every(((t, r) => n(t, e[r])));\n}\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */ function At(t) {\n    let e = 0;\n    for (const n in t) Object.prototype.hasOwnProperty.call(t, n) && e++;\n    return e;\n}\n\nfunction Rt(t, e) {\n    for (const n in t) Object.prototype.hasOwnProperty.call(t, n) && e(n, t[n]);\n}\n\n/**\n * @license\n * Copyright 2023 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * An error encountered while decoding base64 string.\n */\nclass Pt extends Error {\n    constructor() {\n        super(...arguments), this.name = \"Base64DecodeError\";\n    }\n}\n\n/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/** Converts a Base64 encoded string to a binary string. */\n/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * Immutable class that represents a \"proto\" byte string.\n *\n * Proto byte strings can either be Base64-encoded strings or Uint8Arrays when\n * sent on the wire. This class abstracts away this differentiation by holding\n * the proto byte string in a common class that must be converted into a string\n * before being sent as a proto.\n * @internal\n */\nclass Vt {\n    constructor(t) {\n        this.binaryString = t;\n    }\n    static fromBase64String(t) {\n        const e = function(t) {\n            try {\n                return atob(t);\n            } catch (t) {\n                // Check that `DOMException` is defined before using it to avoid\n                // \"ReferenceError: Property 'DOMException' doesn't exist\" in react-native.\n                // (https://github.com/firebase/firebase-js-sdk/issues/7115)\n                throw \"undefined\" != typeof DOMException && t instanceof DOMException ? new Pt(\"Invalid base64 string: \" + t) : t;\n            }\n        }\n        /** Converts a binary string to a Base64 encoded string. */ (t);\n        return new Vt(e);\n    }\n    static fromUint8Array(t) {\n        // TODO(indexing); Remove the copy of the byte string here as this method\n        // is frequently called during indexing.\n        const e = \n        /**\n * Helper function to convert an Uint8array to a binary string.\n */\n        function(t) {\n            let e = \"\";\n            for (let n = 0; n < t.length; ++n) e += String.fromCharCode(t[n]);\n            return e;\n        }\n        /**\n * Helper function to convert a binary string to an Uint8Array.\n */ (t);\n        return new Vt(e);\n    }\n    [Symbol.iterator]() {\n        let t = 0;\n        return {\n            next: () => t < this.binaryString.length ? {\n                value: this.binaryString.charCodeAt(t++),\n                done: !1\n            } : {\n                value: void 0,\n                done: !0\n            }\n        };\n    }\n    toBase64() {\n        return t = this.binaryString, btoa(t);\n        var t;\n    }\n    toUint8Array() {\n        return function(t) {\n            const e = new Uint8Array(t.length);\n            for (let n = 0; n < t.length; n++) e[n] = t.charCodeAt(n);\n            return e;\n        }\n        /**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n        // A RegExp matching ISO 8601 UTC timestamps with optional fraction.\n        (this.binaryString);\n    }\n    approximateByteSize() {\n        return 2 * this.binaryString.length;\n    }\n    compareTo(t) {\n        return It(this.binaryString, t.binaryString);\n    }\n    isEqual(t) {\n        return this.binaryString === t.binaryString;\n    }\n}\n\nVt.EMPTY_BYTE_STRING = new Vt(\"\");\n\nconst $t = new RegExp(/^\\d{4}-\\d\\d-\\d\\dT\\d\\d:\\d\\d:\\d\\d(?:\\.(\\d+))?Z$/);\n\n/**\n * Converts the possible Proto values for a timestamp value into a \"seconds and\n * nanos\" representation.\n */ function Nt(t) {\n    // The json interface (for the browser) will return an iso timestamp string,\n    // while the proto js library (for node) will return a\n    // google.protobuf.Timestamp instance.\n    if (E(!!t), \"string\" == typeof t) {\n        // The date string can have higher precision (nanos) than the Date class\n        // (millis), so we do some custom parsing here.\n        // Parse the nanos right out of the string.\n        let e = 0;\n        const n = $t.exec(t);\n        if (E(!!n), n[1]) {\n            // Pad the fraction out to 9 digits (nanos).\n            let t = n[1];\n            t = (t + \"000000000\").substr(0, 9), e = Number(t);\n        }\n        // Parse the date to get the seconds.\n                const r = new Date(t);\n        return {\n            seconds: Math.floor(r.getTime() / 1e3),\n            nanos: e\n        };\n    }\n    return {\n        seconds: Dt(t.seconds),\n        nanos: Dt(t.nanos)\n    };\n}\n\n/**\n * Converts the possible Proto types for numbers into a JavaScript number.\n * Returns 0 if the value is not numeric.\n */ function Dt(t) {\n    // TODO(bjornick): Handle int64 greater than 53 bits.\n    return \"number\" == typeof t ? t : \"string\" == typeof t ? Number(t) : 0;\n}\n\n/** Converts the possible Proto types for Blobs into a ByteString. */ function Ft(t) {\n    return \"string\" == typeof t ? Vt.fromBase64String(t) : Vt.fromUint8Array(t);\n}\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n// The earliest date supported by Firestore timestamps (0001-01-01T00:00:00Z).\n/**\n * A `Timestamp` represents a point in time independent of any time zone or\n * calendar, represented as seconds and fractions of seconds at nanosecond\n * resolution in UTC Epoch time.\n *\n * It is encoded using the Proleptic Gregorian Calendar which extends the\n * Gregorian calendar backwards to year one. It is encoded assuming all minutes\n * are 60 seconds long, i.e. leap seconds are \"smeared\" so that no leap second\n * table is needed for interpretation. Range is from 0001-01-01T00:00:00Z to\n * 9999-12-31T23:59:59.999999999Z.\n *\n * For examples and further specifications, refer to the\n * {@link https://github.com/google/protobuf/blob/master/src/google/protobuf/timestamp.proto | Timestamp definition}.\n */\nclass xt {\n    /**\n     * Creates a new timestamp.\n     *\n     * @param seconds - The number of seconds of UTC time since Unix epoch\n     *     1970-01-01T00:00:00Z. Must be from 0001-01-01T00:00:00Z to\n     *     9999-12-31T23:59:59Z inclusive.\n     * @param nanoseconds - The non-negative fractions of a second at nanosecond\n     *     resolution. Negative second values with fractions must still have\n     *     non-negative nanoseconds values that count forward in time. Must be\n     *     from 0 to 999,999,999 inclusive.\n     */\n    constructor(\n    /**\n     * The number of seconds of UTC time since Unix epoch 1970-01-01T00:00:00Z.\n     */\n    t, \n    /**\n     * The fractions of a second at nanosecond resolution.*\n     */\n    e) {\n        if (this.seconds = t, this.nanoseconds = e, e < 0) throw new U(P, \"Timestamp nanoseconds out of range: \" + e);\n        if (e >= 1e9) throw new U(P, \"Timestamp nanoseconds out of range: \" + e);\n        if (t < -62135596800) throw new U(P, \"Timestamp seconds out of range: \" + t);\n        // This will break in the year 10,000.\n                if (t >= 253402300800) throw new U(P, \"Timestamp seconds out of range: \" + t);\n    }\n    /**\n     * Creates a new timestamp with the current date, with millisecond precision.\n     *\n     * @returns a new timestamp representing the current date.\n     */    static now() {\n        return xt.fromMillis(Date.now());\n    }\n    /**\n     * Creates a new timestamp from the given date.\n     *\n     * @param date - The date to initialize the `Timestamp` from.\n     * @returns A new `Timestamp` representing the same point in time as the given\n     *     date.\n     */    static fromDate(t) {\n        return xt.fromMillis(t.getTime());\n    }\n    /**\n     * Creates a new timestamp from the given number of milliseconds.\n     *\n     * @param milliseconds - Number of milliseconds since Unix epoch\n     *     1970-01-01T00:00:00Z.\n     * @returns A new `Timestamp` representing the same point in time as the given\n     *     number of milliseconds.\n     */    static fromMillis(t) {\n        const e = Math.floor(t / 1e3), n = Math.floor(1e6 * (t - 1e3 * e));\n        return new xt(e, n);\n    }\n    /**\n     * Converts a `Timestamp` to a JavaScript `Date` object. This conversion\n     * causes a loss of precision since `Date` objects only support millisecond\n     * precision.\n     *\n     * @returns JavaScript `Date` object representing the same point in time as\n     *     this `Timestamp`, with millisecond precision.\n     */    toDate() {\n        return new Date(this.toMillis());\n    }\n    /**\n     * Converts a `Timestamp` to a numeric timestamp (in milliseconds since\n     * epoch). This operation causes a loss of precision.\n     *\n     * @returns The point in time corresponding to this timestamp, represented as\n     *     the number of milliseconds since Unix epoch 1970-01-01T00:00:00Z.\n     */    toMillis() {\n        return 1e3 * this.seconds + this.nanoseconds / 1e6;\n    }\n    _compareTo(t) {\n        return this.seconds === t.seconds ? It(this.nanoseconds, t.nanoseconds) : It(this.seconds, t.seconds);\n    }\n    /**\n     * Returns true if this `Timestamp` is equal to the provided one.\n     *\n     * @param other - The `Timestamp` to compare against.\n     * @returns true if this `Timestamp` is equal to the provided one.\n     */    isEqual(t) {\n        return t.seconds === this.seconds && t.nanoseconds === this.nanoseconds;\n    }\n    /** Returns a textual representation of this `Timestamp`. */    toString() {\n        return \"Timestamp(seconds=\" + this.seconds + \", nanoseconds=\" + this.nanoseconds + \")\";\n    }\n    /** Returns a JSON-serializable representation of this `Timestamp`. */    toJSON() {\n        return {\n            seconds: this.seconds,\n            nanoseconds: this.nanoseconds\n        };\n    }\n    /**\n     * Converts this object to a primitive string, which allows `Timestamp` objects\n     * to be compared using the `>`, `<=`, `>=` and `>` operators.\n     */    valueOf() {\n        // This method returns a string of the form <seconds>.<nanoseconds> where\n        // <seconds> is translated to have a non-negative value and both <seconds>\n        // and <nanoseconds> are left-padded with zeroes to be a consistent length.\n        // Strings with this format then have a lexiographical ordering that matches\n        // the expected ordering. The <seconds> translation is done to avoid having\n        // a leading negative sign (i.e. a leading '-' character) in its string\n        // representation, which would affect its lexiographical ordering.\n        const t = this.seconds - -62135596800;\n        // Note: Up to 12 decimal digits are required to represent all valid\n        // 'seconds' values.\n                return String(t).padStart(12, \"0\") + \".\" + String(this.nanoseconds).padStart(9, \"0\");\n    }\n}\n\n/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * Represents a locally-applied ServerTimestamp.\n *\n * Server Timestamps are backed by MapValues that contain an internal field\n * `__type__` with a value of `server_timestamp`. The previous value and local\n * write time are stored in its `__previous_value__` and `__local_write_time__`\n * fields respectively.\n *\n * Notes:\n * - ServerTimestampValue instances are created as the result of applying a\n *   transform. They can only exist in the local view of a document. Therefore\n *   they do not need to be parsed or serialized.\n * - When evaluated locally (e.g. for snapshot.data()), they by default\n *   evaluate to `null`. This behavior can be configured by passing custom\n *   FieldValueOptions to value().\n * - With respect to other ServerTimestampValues, they sort by their\n *   localWriteTime.\n */ function St(t) {\n    var e, n;\n    return \"server_timestamp\" === (null === (n = ((null === (e = null == t ? void 0 : t.mapValue) || void 0 === e ? void 0 : e.fields) || {}).__type__) || void 0 === n ? void 0 : n.stringValue);\n}\n\n/**\n * Returns the value of the field before this ServerTimestamp was set.\n *\n * Preserving the previous values allows the user to display the last resoled\n * value until the backend responds with the timestamp.\n */ function qt(t) {\n    const e = t.mapValue.fields.__previous_value__;\n    return St(e) ? qt(e) : e;\n}\n\n/**\n * Returns the local time at which this timestamp was first set.\n */ function Ot(t) {\n    const e = Nt(t.mapValue.fields.__local_write_time__.timestampValue);\n    return new xt(e.seconds, e.nanos);\n}\n\n/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */ const kt = {\n    fields: {\n        __type__: {\n            stringValue: \"__max__\"\n        }\n    }\n};\n\n/** Extracts the backend's type order for the provided value. */\nfunction Ct(t) {\n    return \"nullValue\" in t ? 0 /* TypeOrder.NullValue */ : \"booleanValue\" in t ? 1 /* TypeOrder.BooleanValue */ : \"integerValue\" in t || \"doubleValue\" in t ? 2 /* TypeOrder.NumberValue */ : \"timestampValue\" in t ? 3 /* TypeOrder.TimestampValue */ : \"stringValue\" in t ? 5 /* TypeOrder.StringValue */ : \"bytesValue\" in t ? 6 /* TypeOrder.BlobValue */ : \"referenceValue\" in t ? 7 /* TypeOrder.RefValue */ : \"geoPointValue\" in t ? 8 /* TypeOrder.GeoPointValue */ : \"arrayValue\" in t ? 9 /* TypeOrder.ArrayValue */ : \"mapValue\" in t ? St(t) ? 4 /* TypeOrder.ServerTimestampValue */ : \n    /** Returns true if the Value represents the canonical {@link #MAX_VALUE} . */\n    function(t) {\n        return \"__max__\" === (((t.mapValue || {}).fields || {}).__type__ || {}).stringValue;\n    }\n    /**\n * @license\n * Copyright 2022 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n    /**\n * Represents a bound of a query.\n *\n * The bound is specified with the given components representing a position and\n * whether it's just before or just after the position (relative to whatever the\n * query order is).\n *\n * The position represents a logical index position for a query. It's a prefix\n * of values for the (potentially implicit) order by clauses of a query.\n *\n * Bound provides a function to determine whether a document comes before or\n * after a bound. This is influenced by whether the position is just before or\n * just after the provided values.\n */ (t) ? 9007199254740991 /* TypeOrder.MaxValue */ : 10 /* TypeOrder.ObjectValue */ : b();\n}\n\n/** Tests `left` and `right` for equality based on the backend semantics. */ function Mt(t, e) {\n    if (t === e) return !0;\n    const n = Ct(t);\n    if (n !== Ct(e)) return !1;\n    switch (n) {\n      case 0 /* TypeOrder.NullValue */ :\n      case 9007199254740991 /* TypeOrder.MaxValue */ :\n        return !0;\n\n      case 1 /* TypeOrder.BooleanValue */ :\n        return t.booleanValue === e.booleanValue;\n\n      case 4 /* TypeOrder.ServerTimestampValue */ :\n        return Ot(t).isEqual(Ot(e));\n\n      case 3 /* TypeOrder.TimestampValue */ :\n        return function(t, e) {\n            if (\"string\" == typeof t.timestampValue && \"string\" == typeof e.timestampValue && t.timestampValue.length === e.timestampValue.length) \n            // Use string equality for ISO 8601 timestamps\n            return t.timestampValue === e.timestampValue;\n            const n = Nt(t.timestampValue), r = Nt(e.timestampValue);\n            return n.seconds === r.seconds && n.nanos === r.nanos;\n        }(t, e);\n\n      case 5 /* TypeOrder.StringValue */ :\n        return t.stringValue === e.stringValue;\n\n      case 6 /* TypeOrder.BlobValue */ :\n        return function(t, e) {\n            return Ft(t.bytesValue).isEqual(Ft(e.bytesValue));\n        }(t, e);\n\n      case 7 /* TypeOrder.RefValue */ :\n        return t.referenceValue === e.referenceValue;\n\n      case 8 /* TypeOrder.GeoPointValue */ :\n        return function(t, e) {\n            return Dt(t.geoPointValue.latitude) === Dt(e.geoPointValue.latitude) && Dt(t.geoPointValue.longitude) === Dt(e.geoPointValue.longitude);\n        }(t, e);\n\n      case 2 /* TypeOrder.NumberValue */ :\n        return function(t, e) {\n            if (\"integerValue\" in t && \"integerValue\" in e) return Dt(t.integerValue) === Dt(e.integerValue);\n            if (\"doubleValue\" in t && \"doubleValue\" in e) {\n                const n = Dt(t.doubleValue), r = Dt(e.doubleValue);\n                return n === r ? wt(n) === wt(r) : isNaN(n) && isNaN(r);\n            }\n            return !1;\n        }(t, e);\n\n      case 9 /* TypeOrder.ArrayValue */ :\n        return Tt(t.arrayValue.values || [], e.arrayValue.values || [], Mt);\n\n      case 10 /* TypeOrder.ObjectValue */ :\n        return function(t, e) {\n            const n = t.mapValue.fields || {}, r = e.mapValue.fields || {};\n            if (At(n) !== At(r)) return !1;\n            for (const t in n) if (n.hasOwnProperty(t) && (void 0 === r[t] || !Mt(n[t], r[t]))) return !1;\n            return !0;\n        }\n        /** Returns true if the ArrayValue contains the specified element. */ (t, e);\n\n      default:\n        return b();\n    }\n}\n\nfunction Lt(t, e) {\n    return void 0 !== (t.values || []).find((t => Mt(t, e)));\n}\n\nfunction Ut(t, e) {\n    if (t === e) return 0;\n    const n = Ct(t), r = Ct(e);\n    if (n !== r) return It(n, r);\n    switch (n) {\n      case 0 /* TypeOrder.NullValue */ :\n      case 9007199254740991 /* TypeOrder.MaxValue */ :\n        return 0;\n\n      case 1 /* TypeOrder.BooleanValue */ :\n        return It(t.booleanValue, e.booleanValue);\n\n      case 2 /* TypeOrder.NumberValue */ :\n        return function(t, e) {\n            const n = Dt(t.integerValue || t.doubleValue), r = Dt(e.integerValue || e.doubleValue);\n            return n < r ? -1 : n > r ? 1 : n === r ? 0 : \n            // one or both are NaN.\n            isNaN(n) ? isNaN(r) ? 0 : -1 : 1;\n        }(t, e);\n\n      case 3 /* TypeOrder.TimestampValue */ :\n        return jt(t.timestampValue, e.timestampValue);\n\n      case 4 /* TypeOrder.ServerTimestampValue */ :\n        return jt(Ot(t), Ot(e));\n\n      case 5 /* TypeOrder.StringValue */ :\n        return It(t.stringValue, e.stringValue);\n\n      case 6 /* TypeOrder.BlobValue */ :\n        return function(t, e) {\n            const n = Ft(t), r = Ft(e);\n            return n.compareTo(r);\n        }(t.bytesValue, e.bytesValue);\n\n      case 7 /* TypeOrder.RefValue */ :\n        return function(t, e) {\n            const n = t.split(\"/\"), r = e.split(\"/\");\n            for (let t = 0; t < n.length && t < r.length; t++) {\n                const e = It(n[t], r[t]);\n                if (0 !== e) return e;\n            }\n            return It(n.length, r.length);\n        }(t.referenceValue, e.referenceValue);\n\n      case 8 /* TypeOrder.GeoPointValue */ :\n        return function(t, e) {\n            const n = It(Dt(t.latitude), Dt(e.latitude));\n            if (0 !== n) return n;\n            return It(Dt(t.longitude), Dt(e.longitude));\n        }(t.geoPointValue, e.geoPointValue);\n\n      case 9 /* TypeOrder.ArrayValue */ :\n        return function(t, e) {\n            const n = t.values || [], r = e.values || [];\n            for (let t = 0; t < n.length && t < r.length; ++t) {\n                const e = Ut(n[t], r[t]);\n                if (e) return e;\n            }\n            return It(n.length, r.length);\n        }(t.arrayValue, e.arrayValue);\n\n      case 10 /* TypeOrder.ObjectValue */ :\n        return function(t, e) {\n            if (t === kt && e === kt) return 0;\n            if (t === kt) return 1;\n            if (e === kt) return -1;\n            const n = t.fields || {}, r = Object.keys(n), s = e.fields || {}, i = Object.keys(s);\n            // Even though MapValues are likely sorted correctly based on their insertion\n            // order (e.g. when received from the backend), local modifications can bring\n            // elements out of order. We need to re-sort the elements to ensure that\n            // canonical IDs are independent of insertion order.\n            r.sort(), i.sort();\n            for (let t = 0; t < r.length && t < i.length; ++t) {\n                const e = It(r[t], i[t]);\n                if (0 !== e) return e;\n                const o = Ut(n[r[t]], s[i[t]]);\n                if (0 !== o) return o;\n            }\n            return It(r.length, i.length);\n        }\n        /** Returns a reference value for the provided database and key. */ (t.mapValue, e.mapValue);\n\n      default:\n        throw b();\n    }\n}\n\nfunction jt(t, e) {\n    if (\"string\" == typeof t && \"string\" == typeof e && t.length === e.length) return It(t, e);\n    const n = Nt(t), r = Nt(e), s = It(n.seconds, r.seconds);\n    return 0 !== s ? s : It(n.nanos, r.nanos);\n}\n\nfunction Bt(t, e) {\n    return {\n        referenceValue: `projects/${t.projectId}/databases/${t.database}/documents/${e.path.canonicalString()}`\n    };\n}\n\n/** Returns true if `value` is an ArrayValue. */ function Qt(t) {\n    return !!t && \"arrayValue\" in t;\n}\n\n/** Returns true if `value` is a NullValue. */ function zt(t) {\n    return !!t && \"nullValue\" in t;\n}\n\n/** Returns true if `value` is NaN. */ function Wt(t) {\n    return !!t && \"doubleValue\" in t && isNaN(Number(t.doubleValue));\n}\n\n/** Returns true if `value` is a MapValue. */ function Gt(t) {\n    return !!t && \"mapValue\" in t;\n}\n\n/** Creates a deep copy of `source`. */ function Kt(t) {\n    if (t.geoPointValue) return {\n        geoPointValue: Object.assign({}, t.geoPointValue)\n    };\n    if (t.timestampValue && \"object\" == typeof t.timestampValue) return {\n        timestampValue: Object.assign({}, t.timestampValue)\n    };\n    if (t.mapValue) {\n        const e = {\n            mapValue: {\n                fields: {}\n            }\n        };\n        return Rt(t.mapValue.fields, ((t, n) => e.mapValue.fields[t] = Kt(n))), e;\n    }\n    if (t.arrayValue) {\n        const e = {\n            arrayValue: {\n                values: []\n            }\n        };\n        for (let n = 0; n < (t.arrayValue.values || []).length; ++n) e.arrayValue.values[n] = Kt(t.arrayValue.values[n]);\n        return e;\n    }\n    return Object.assign({}, t);\n}\n\nclass Yt {\n    constructor(t, e) {\n        this.position = t, this.inclusive = e;\n    }\n}\n\nfunction Ht(t, e) {\n    if (null === t) return null === e;\n    if (null === e) return !1;\n    if (t.inclusive !== e.inclusive || t.position.length !== e.position.length) return !1;\n    for (let n = 0; n < t.position.length; n++) {\n        if (!Mt(t.position[n], e.position[n])) return !1;\n    }\n    return !0;\n}\n\n/**\n * @license\n * Copyright 2022 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */ class Jt {}\n\nclass Xt extends Jt {\n    constructor(t, e, n) {\n        super(), this.field = t, this.op = e, this.value = n;\n    }\n    /**\n     * Creates a filter based on the provided arguments.\n     */    static create(t, e, n) {\n        return t.isKeyField() ? \"in\" /* Operator.IN */ === e || \"not-in\" /* Operator.NOT_IN */ === e ? this.createKeyFieldInFilter(t, e, n) : new ee(t, e, n) : \"array-contains\" /* Operator.ARRAY_CONTAINS */ === e ? new ie(t, n) : \"in\" /* Operator.IN */ === e ? new oe(t, n) : \"not-in\" /* Operator.NOT_IN */ === e ? new ue(t, n) : \"array-contains-any\" /* Operator.ARRAY_CONTAINS_ANY */ === e ? new ce(t, n) : new Xt(t, e, n);\n    }\n    static createKeyFieldInFilter(t, e, n) {\n        return \"in\" /* Operator.IN */ === e ? new ne(t, n) : new re(t, n);\n    }\n    matches(t) {\n        const e = t.data.field(this.field);\n        // Types do not have to match in NOT_EQUAL filters.\n                return \"!=\" /* Operator.NOT_EQUAL */ === this.op ? null !== e && this.matchesComparison(Ut(e, this.value)) : null !== e && Ct(this.value) === Ct(e) && this.matchesComparison(Ut(e, this.value));\n        // Only compare types with matching backend order (such as double and int).\n        }\n    matchesComparison(t) {\n        switch (this.op) {\n          case \"<\" /* Operator.LESS_THAN */ :\n            return t < 0;\n\n          case \"<=\" /* Operator.LESS_THAN_OR_EQUAL */ :\n            return t <= 0;\n\n          case \"==\" /* Operator.EQUAL */ :\n            return 0 === t;\n\n          case \"!=\" /* Operator.NOT_EQUAL */ :\n            return 0 !== t;\n\n          case \">\" /* Operator.GREATER_THAN */ :\n            return t > 0;\n\n          case \">=\" /* Operator.GREATER_THAN_OR_EQUAL */ :\n            return t >= 0;\n\n          default:\n            return b();\n        }\n    }\n    isInequality() {\n        return [ \"<\" /* Operator.LESS_THAN */ , \"<=\" /* Operator.LESS_THAN_OR_EQUAL */ , \">\" /* Operator.GREATER_THAN */ , \">=\" /* Operator.GREATER_THAN_OR_EQUAL */ , \"!=\" /* Operator.NOT_EQUAL */ , \"not-in\" /* Operator.NOT_IN */ ].indexOf(this.op) >= 0;\n    }\n    getFlattenedFilters() {\n        return [ this ];\n    }\n    getFilters() {\n        return [ this ];\n    }\n    getFirstInequalityField() {\n        return this.isInequality() ? this.field : null;\n    }\n}\n\nclass Zt extends Jt {\n    constructor(t, e) {\n        super(), this.filters = t, this.op = e, this.D = null;\n    }\n    /**\n     * Creates a filter based on the provided arguments.\n     */    static create(t, e) {\n        return new Zt(t, e);\n    }\n    matches(t) {\n        return \"and\" /* CompositeOperator.AND */ === this.op ? void 0 === this.filters.find((e => !e.matches(t))) : void 0 !== this.filters.find((e => e.matches(t)));\n    }\n    getFlattenedFilters() {\n        return null !== this.D || (this.D = this.filters.reduce(((t, e) => t.concat(e.getFlattenedFilters())), [])), \n        this.D;\n    }\n    // Returns a mutable copy of `this.filters`\n    getFilters() {\n        return Object.assign([], this.filters);\n    }\n    getFirstInequalityField() {\n        const t = this.F((t => t.isInequality()));\n        return null !== t ? t.field : null;\n    }\n    // Performs a depth-first search to find and return the first FieldFilter in the composite filter\n    // that satisfies the predicate. Returns `null` if none of the FieldFilters satisfy the\n    // predicate.\n    F(t) {\n        for (const e of this.getFlattenedFilters()) if (t(e)) return e;\n        return null;\n    }\n}\n\nfunction te(t, e) {\n    return t instanceof Xt ? function(t, e) {\n        return e instanceof Xt && t.op === e.op && t.field.isEqual(e.field) && Mt(t.value, e.value);\n    }(t, e) : t instanceof Zt ? function(t, e) {\n        if (e instanceof Zt && t.op === e.op && t.filters.length === e.filters.length) {\n            return t.filters.reduce(((t, n, r) => t && te(n, e.filters[r])), !0);\n        }\n        return !1;\n    }\n    /** Filter that matches on key fields (i.e. '__name__'). */ (t, e) : void b();\n}\n\nclass ee extends Xt {\n    constructor(t, e, n) {\n        super(t, e, n), this.key = rt.fromName(n.referenceValue);\n    }\n    matches(t) {\n        const e = rt.comparator(t.key, this.key);\n        return this.matchesComparison(e);\n    }\n}\n\n/** Filter that matches on key fields within an array. */ class ne extends Xt {\n    constructor(t, e) {\n        super(t, \"in\" /* Operator.IN */ , e), this.keys = se(\"in\" /* Operator.IN */ , e);\n    }\n    matches(t) {\n        return this.keys.some((e => e.isEqual(t.key)));\n    }\n}\n\n/** Filter that matches on key fields not present within an array. */ class re extends Xt {\n    constructor(t, e) {\n        super(t, \"not-in\" /* Operator.NOT_IN */ , e), this.keys = se(\"not-in\" /* Operator.NOT_IN */ , e);\n    }\n    matches(t) {\n        return !this.keys.some((e => e.isEqual(t.key)));\n    }\n}\n\nfunction se(t, e) {\n    var n;\n    return ((null === (n = e.arrayValue) || void 0 === n ? void 0 : n.values) || []).map((t => rt.fromName(t.referenceValue)));\n}\n\n/** A Filter that implements the array-contains operator. */ class ie extends Xt {\n    constructor(t, e) {\n        super(t, \"array-contains\" /* Operator.ARRAY_CONTAINS */ , e);\n    }\n    matches(t) {\n        const e = t.data.field(this.field);\n        return Qt(e) && Lt(e.arrayValue, this.value);\n    }\n}\n\n/** A Filter that implements the IN operator. */ class oe extends Xt {\n    constructor(t, e) {\n        super(t, \"in\" /* Operator.IN */ , e);\n    }\n    matches(t) {\n        const e = t.data.field(this.field);\n        return null !== e && Lt(this.value.arrayValue, e);\n    }\n}\n\n/** A Filter that implements the not-in operator. */ class ue extends Xt {\n    constructor(t, e) {\n        super(t, \"not-in\" /* Operator.NOT_IN */ , e);\n    }\n    matches(t) {\n        if (Lt(this.value.arrayValue, {\n            nullValue: \"NULL_VALUE\"\n        })) return !1;\n        const e = t.data.field(this.field);\n        return null !== e && !Lt(this.value.arrayValue, e);\n    }\n}\n\n/** A Filter that implements the array-contains-any operator. */ class ce extends Xt {\n    constructor(t, e) {\n        super(t, \"array-contains-any\" /* Operator.ARRAY_CONTAINS_ANY */ , e);\n    }\n    matches(t) {\n        const e = t.data.field(this.field);\n        return !(!Qt(e) || !e.arrayValue.values) && e.arrayValue.values.some((t => Lt(this.value.arrayValue, t)));\n    }\n}\n\n/**\n * @license\n * Copyright 2022 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * An ordering on a field, in some Direction. Direction defaults to ASCENDING.\n */ class ae {\n    constructor(t, e = \"asc\" /* Direction.ASCENDING */) {\n        this.field = t, this.dir = e;\n    }\n}\n\nfunction he(t, e) {\n    return t.dir === e.dir && t.field.isEqual(e.field);\n}\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * A version of a document in Firestore. This corresponds to the version\n * timestamp, such as update_time or read_time.\n */ class le {\n    constructor(t) {\n        this.timestamp = t;\n    }\n    static fromTimestamp(t) {\n        return new le(t);\n    }\n    static min() {\n        return new le(new xt(0, 0));\n    }\n    static max() {\n        return new le(new xt(253402300799, 999999999));\n    }\n    compareTo(t) {\n        return this.timestamp._compareTo(t.timestamp);\n    }\n    isEqual(t) {\n        return this.timestamp.isEqual(t.timestamp);\n    }\n    /** Returns a number representation of the version for use in spec tests. */    toMicroseconds() {\n        // Convert to microseconds.\n        return 1e6 * this.timestamp.seconds + this.timestamp.nanoseconds / 1e3;\n    }\n    toString() {\n        return \"SnapshotVersion(\" + this.timestamp.toString() + \")\";\n    }\n    toTimestamp() {\n        return this.timestamp;\n    }\n}\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n// An immutable sorted map implementation, based on a Left-leaning Red-Black\n// tree.\nclass fe {\n    constructor(t, e) {\n        this.comparator = t, this.root = e || we.EMPTY;\n    }\n    // Returns a copy of the map, with the specified key/value added or replaced.\n    insert(t, e) {\n        return new fe(this.comparator, this.root.insert(t, e, this.comparator).copy(null, null, we.BLACK, null, null));\n    }\n    // Returns a copy of the map, with the specified key removed.\n    remove(t) {\n        return new fe(this.comparator, this.root.remove(t, this.comparator).copy(null, null, we.BLACK, null, null));\n    }\n    // Returns the value of the node with the given key, or null.\n    get(t) {\n        let e = this.root;\n        for (;!e.isEmpty(); ) {\n            const n = this.comparator(t, e.key);\n            if (0 === n) return e.value;\n            n < 0 ? e = e.left : n > 0 && (e = e.right);\n        }\n        return null;\n    }\n    // Returns the index of the element in this sorted map, or -1 if it doesn't\n    // exist.\n    indexOf(t) {\n        // Number of nodes that were pruned when descending right\n        let e = 0, n = this.root;\n        for (;!n.isEmpty(); ) {\n            const r = this.comparator(t, n.key);\n            if (0 === r) return e + n.left.size;\n            r < 0 ? n = n.left : (\n            // Count all nodes left of the node plus the node itself\n            e += n.left.size + 1, n = n.right);\n        }\n        // Node not found\n                return -1;\n    }\n    isEmpty() {\n        return this.root.isEmpty();\n    }\n    // Returns the total number of nodes in the map.\n    get size() {\n        return this.root.size;\n    }\n    // Returns the minimum key in the map.\n    minKey() {\n        return this.root.minKey();\n    }\n    // Returns the maximum key in the map.\n    maxKey() {\n        return this.root.maxKey();\n    }\n    // Traverses the map in key order and calls the specified action function\n    // for each key/value pair. If action returns true, traversal is aborted.\n    // Returns the first truthy value returned by action, or the last falsey\n    // value returned by action.\n    inorderTraversal(t) {\n        return this.root.inorderTraversal(t);\n    }\n    forEach(t) {\n        this.inorderTraversal(((e, n) => (t(e, n), !1)));\n    }\n    toString() {\n        const t = [];\n        return this.inorderTraversal(((e, n) => (t.push(`${e}:${n}`), !1))), `{${t.join(\", \")}}`;\n    }\n    // Traverses the map in reverse key order and calls the specified action\n    // function for each key/value pair. If action returns true, traversal is\n    // aborted.\n    // Returns the first truthy value returned by action, or the last falsey\n    // value returned by action.\n    reverseTraversal(t) {\n        return this.root.reverseTraversal(t);\n    }\n    // Returns an iterator over the SortedMap.\n    getIterator() {\n        return new de(this.root, null, this.comparator, !1);\n    }\n    getIteratorFrom(t) {\n        return new de(this.root, t, this.comparator, !1);\n    }\n    getReverseIterator() {\n        return new de(this.root, null, this.comparator, !0);\n    }\n    getReverseIteratorFrom(t) {\n        return new de(this.root, t, this.comparator, !0);\n    }\n}\n\n // end SortedMap\n// An iterator over an LLRBNode.\nclass de {\n    constructor(t, e, n, r) {\n        this.isReverse = r, this.nodeStack = [];\n        let s = 1;\n        for (;!t.isEmpty(); ) if (s = e ? n(t.key, e) : 1, \n        // flip the comparison if we're going in reverse\n        e && r && (s *= -1), s < 0) \n        // This node is less than our start key. ignore it\n        t = this.isReverse ? t.left : t.right; else {\n            if (0 === s) {\n                // This node is exactly equal to our start key. Push it on the stack,\n                // but stop iterating;\n                this.nodeStack.push(t);\n                break;\n            }\n            // This node is greater than our start key, add it to the stack and move\n            // to the next one\n            this.nodeStack.push(t), t = this.isReverse ? t.right : t.left;\n        }\n    }\n    getNext() {\n        let t = this.nodeStack.pop();\n        const e = {\n            key: t.key,\n            value: t.value\n        };\n        if (this.isReverse) for (t = t.left; !t.isEmpty(); ) this.nodeStack.push(t), t = t.right; else for (t = t.right; !t.isEmpty(); ) this.nodeStack.push(t), \n        t = t.left;\n        return e;\n    }\n    hasNext() {\n        return this.nodeStack.length > 0;\n    }\n    peek() {\n        if (0 === this.nodeStack.length) return null;\n        const t = this.nodeStack[this.nodeStack.length - 1];\n        return {\n            key: t.key,\n            value: t.value\n        };\n    }\n}\n\n // end SortedMapIterator\n// Represents a node in a Left-leaning Red-Black tree.\nclass we {\n    constructor(t, e, n, r, s) {\n        this.key = t, this.value = e, this.color = null != n ? n : we.RED, this.left = null != r ? r : we.EMPTY, \n        this.right = null != s ? s : we.EMPTY, this.size = this.left.size + 1 + this.right.size;\n    }\n    // Returns a copy of the current node, optionally replacing pieces of it.\n    copy(t, e, n, r, s) {\n        return new we(null != t ? t : this.key, null != e ? e : this.value, null != n ? n : this.color, null != r ? r : this.left, null != s ? s : this.right);\n    }\n    isEmpty() {\n        return !1;\n    }\n    // Traverses the tree in key order and calls the specified action function\n    // for each node. If action returns true, traversal is aborted.\n    // Returns the first truthy value returned by action, or the last falsey\n    // value returned by action.\n    inorderTraversal(t) {\n        return this.left.inorderTraversal(t) || t(this.key, this.value) || this.right.inorderTraversal(t);\n    }\n    // Traverses the tree in reverse key order and calls the specified action\n    // function for each node. If action returns true, traversal is aborted.\n    // Returns the first truthy value returned by action, or the last falsey\n    // value returned by action.\n    reverseTraversal(t) {\n        return this.right.reverseTraversal(t) || t(this.key, this.value) || this.left.reverseTraversal(t);\n    }\n    // Returns the minimum node in the tree.\n    min() {\n        return this.left.isEmpty() ? this : this.left.min();\n    }\n    // Returns the maximum key in the tree.\n    minKey() {\n        return this.min().key;\n    }\n    // Returns the maximum key in the tree.\n    maxKey() {\n        return this.right.isEmpty() ? this.key : this.right.maxKey();\n    }\n    // Returns new tree, with the key/value added.\n    insert(t, e, n) {\n        let r = this;\n        const s = n(t, r.key);\n        return r = s < 0 ? r.copy(null, null, null, r.left.insert(t, e, n), null) : 0 === s ? r.copy(null, e, null, null, null) : r.copy(null, null, null, null, r.right.insert(t, e, n)), \n        r.fixUp();\n    }\n    removeMin() {\n        if (this.left.isEmpty()) return we.EMPTY;\n        let t = this;\n        return t.left.isRed() || t.left.left.isRed() || (t = t.moveRedLeft()), t = t.copy(null, null, null, t.left.removeMin(), null), \n        t.fixUp();\n    }\n    // Returns new tree, with the specified item removed.\n    remove(t, e) {\n        let n, r = this;\n        if (e(t, r.key) < 0) r.left.isEmpty() || r.left.isRed() || r.left.left.isRed() || (r = r.moveRedLeft()), \n        r = r.copy(null, null, null, r.left.remove(t, e), null); else {\n            if (r.left.isRed() && (r = r.rotateRight()), r.right.isEmpty() || r.right.isRed() || r.right.left.isRed() || (r = r.moveRedRight()), \n            0 === e(t, r.key)) {\n                if (r.right.isEmpty()) return we.EMPTY;\n                n = r.right.min(), r = r.copy(n.key, n.value, null, null, r.right.removeMin());\n            }\n            r = r.copy(null, null, null, null, r.right.remove(t, e));\n        }\n        return r.fixUp();\n    }\n    isRed() {\n        return this.color;\n    }\n    // Returns new tree after performing any needed rotations.\n    fixUp() {\n        let t = this;\n        return t.right.isRed() && !t.left.isRed() && (t = t.rotateLeft()), t.left.isRed() && t.left.left.isRed() && (t = t.rotateRight()), \n        t.left.isRed() && t.right.isRed() && (t = t.colorFlip()), t;\n    }\n    moveRedLeft() {\n        let t = this.colorFlip();\n        return t.right.left.isRed() && (t = t.copy(null, null, null, null, t.right.rotateRight()), \n        t = t.rotateLeft(), t = t.colorFlip()), t;\n    }\n    moveRedRight() {\n        let t = this.colorFlip();\n        return t.left.left.isRed() && (t = t.rotateRight(), t = t.colorFlip()), t;\n    }\n    rotateLeft() {\n        const t = this.copy(null, null, we.RED, null, this.right.left);\n        return this.right.copy(null, null, this.color, t, null);\n    }\n    rotateRight() {\n        const t = this.copy(null, null, we.RED, this.left.right, null);\n        return this.left.copy(null, null, this.color, null, t);\n    }\n    colorFlip() {\n        const t = this.left.copy(null, null, !this.left.color, null, null), e = this.right.copy(null, null, !this.right.color, null, null);\n        return this.copy(null, null, !this.color, t, e);\n    }\n    // For testing.\n    checkMaxDepth() {\n        const t = this.check();\n        return Math.pow(2, t) <= this.size + 1;\n    }\n    // In a balanced RB tree, the black-depth (number of black nodes) from root to\n    // leaves is equal on both sides.  This function verifies that or asserts.\n    check() {\n        if (this.isRed() && this.left.isRed()) throw b();\n        if (this.right.isRed()) throw b();\n        const t = this.left.check();\n        if (t !== this.right.check()) throw b();\n        return t + (this.isRed() ? 0 : 1);\n    }\n}\n\n // end LLRBNode\n// Empty node is shared between all LLRB trees.\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\nwe.EMPTY = null, we.RED = !0, we.BLACK = !1;\n\n// end LLRBEmptyNode\nwe.EMPTY = new \n// Represents an empty node (a leaf node in the Red-Black Tree).\nclass {\n    constructor() {\n        this.size = 0;\n    }\n    get key() {\n        throw b();\n    }\n    get value() {\n        throw b();\n    }\n    get color() {\n        throw b();\n    }\n    get left() {\n        throw b();\n    }\n    get right() {\n        throw b();\n    }\n    // Returns a copy of the current node.\n    copy(t, e, n, r, s) {\n        return this;\n    }\n    // Returns a copy of the tree, with the specified key/value added.\n    insert(t, e, n) {\n        return new we(t, e);\n    }\n    // Returns a copy of the tree, with the specified key removed.\n    remove(t, e) {\n        return this;\n    }\n    isEmpty() {\n        return !0;\n    }\n    inorderTraversal(t) {\n        return !1;\n    }\n    reverseTraversal(t) {\n        return !1;\n    }\n    minKey() {\n        return null;\n    }\n    maxKey() {\n        return null;\n    }\n    isRed() {\n        return !1;\n    }\n    // For testing.\n    checkMaxDepth() {\n        return !0;\n    }\n    check() {\n        return 0;\n    }\n};\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * SortedSet is an immutable (copy-on-write) collection that holds elements\n * in order specified by the provided comparator.\n *\n * NOTE: if provided comparator returns 0 for two elements, we consider them to\n * be equal!\n */\nclass me {\n    constructor(t) {\n        this.comparator = t, this.data = new fe(this.comparator);\n    }\n    has(t) {\n        return null !== this.data.get(t);\n    }\n    first() {\n        return this.data.minKey();\n    }\n    last() {\n        return this.data.maxKey();\n    }\n    get size() {\n        return this.data.size;\n    }\n    indexOf(t) {\n        return this.data.indexOf(t);\n    }\n    /** Iterates elements in order defined by \"comparator\" */    forEach(t) {\n        this.data.inorderTraversal(((e, n) => (t(e), !1)));\n    }\n    /** Iterates over `elem`s such that: range[0] &lt;= elem &lt; range[1]. */    forEachInRange(t, e) {\n        const n = this.data.getIteratorFrom(t[0]);\n        for (;n.hasNext(); ) {\n            const r = n.getNext();\n            if (this.comparator(r.key, t[1]) >= 0) return;\n            e(r.key);\n        }\n    }\n    /**\n     * Iterates over `elem`s such that: start &lt;= elem until false is returned.\n     */    forEachWhile(t, e) {\n        let n;\n        for (n = void 0 !== e ? this.data.getIteratorFrom(e) : this.data.getIterator(); n.hasNext(); ) {\n            if (!t(n.getNext().key)) return;\n        }\n    }\n    /** Finds the least element greater than or equal to `elem`. */    firstAfterOrEqual(t) {\n        const e = this.data.getIteratorFrom(t);\n        return e.hasNext() ? e.getNext().key : null;\n    }\n    getIterator() {\n        return new pe(this.data.getIterator());\n    }\n    getIteratorFrom(t) {\n        return new pe(this.data.getIteratorFrom(t));\n    }\n    /** Inserts or updates an element */    add(t) {\n        return this.copy(this.data.remove(t).insert(t, !0));\n    }\n    /** Deletes an element */    delete(t) {\n        return this.has(t) ? this.copy(this.data.remove(t)) : this;\n    }\n    isEmpty() {\n        return this.data.isEmpty();\n    }\n    unionWith(t) {\n        let e = this;\n        // Make sure `result` always refers to the larger one of the two sets.\n                return e.size < t.size && (e = t, t = this), t.forEach((t => {\n            e = e.add(t);\n        })), e;\n    }\n    isEqual(t) {\n        if (!(t instanceof me)) return !1;\n        if (this.size !== t.size) return !1;\n        const e = this.data.getIterator(), n = t.data.getIterator();\n        for (;e.hasNext(); ) {\n            const t = e.getNext().key, r = n.getNext().key;\n            if (0 !== this.comparator(t, r)) return !1;\n        }\n        return !0;\n    }\n    toArray() {\n        const t = [];\n        return this.forEach((e => {\n            t.push(e);\n        })), t;\n    }\n    toString() {\n        const t = [];\n        return this.forEach((e => t.push(e))), \"SortedSet(\" + t.toString() + \")\";\n    }\n    copy(t) {\n        const e = new me(this.comparator);\n        return e.data = t, e;\n    }\n}\n\nclass pe {\n    constructor(t) {\n        this.iter = t;\n    }\n    getNext() {\n        return this.iter.getNext().key;\n    }\n    hasNext() {\n        return this.iter.hasNext();\n    }\n}\n\n/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * Provides a set of fields that can be used to partially patch a document.\n * FieldMask is used in conjunction with ObjectValue.\n * Examples:\n *   foo - Overwrites foo entirely with the provided value. If foo is not\n *         present in the companion ObjectValue, the field is deleted.\n *   foo.bar - Overwrites only the field bar of the object foo.\n *             If foo is not an object, foo is replaced with an object\n *             containing foo\n */ class ye {\n    constructor(t) {\n        this.fields = t, \n        // TODO(dimond): validation of FieldMask\n        // Sort the field mask to support `FieldMask.isEqual()` and assert below.\n        t.sort(nt.comparator);\n    }\n    static empty() {\n        return new ye([]);\n    }\n    /**\n     * Returns a new FieldMask object that is the result of adding all the given\n     * fields paths to this field mask.\n     */    unionWith(t) {\n        let e = new me(nt.comparator);\n        for (const t of this.fields) e = e.add(t);\n        for (const n of t) e = e.add(n);\n        return new ye(e.toArray());\n    }\n    /**\n     * Verifies that `fieldPath` is included by at least one field in this field\n     * mask.\n     *\n     * This is an O(n) operation, where `n` is the size of the field mask.\n     */    covers(t) {\n        for (const e of this.fields) if (e.isPrefixOf(t)) return !0;\n        return !1;\n    }\n    isEqual(t) {\n        return Tt(this.fields, t.fields, ((t, e) => t.isEqual(e)));\n    }\n}\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * An ObjectValue represents a MapValue in the Firestore Proto and offers the\n * ability to add and remove fields (via the ObjectValueBuilder).\n */ class ge {\n    constructor(t) {\n        this.value = t;\n    }\n    static empty() {\n        return new ge({\n            mapValue: {}\n        });\n    }\n    /**\n     * Returns the value at the given path or null.\n     *\n     * @param path - the path to search\n     * @returns The value at the path or null if the path is not set.\n     */    field(t) {\n        if (t.isEmpty()) return this.value;\n        {\n            let e = this.value;\n            for (let n = 0; n < t.length - 1; ++n) if (e = (e.mapValue.fields || {})[t.get(n)], \n            !Gt(e)) return null;\n            return e = (e.mapValue.fields || {})[t.lastSegment()], e || null;\n        }\n    }\n    /**\n     * Sets the field to the provided value.\n     *\n     * @param path - The field path to set.\n     * @param value - The value to set.\n     */    set(t, e) {\n        this.getFieldsMap(t.popLast())[t.lastSegment()] = Kt(e);\n    }\n    /**\n     * Sets the provided fields to the provided values.\n     *\n     * @param data - A map of fields to values (or null for deletes).\n     */    setAll(t) {\n        let e = nt.emptyPath(), n = {}, r = [];\n        t.forEach(((t, s) => {\n            if (!e.isImmediateParentOf(s)) {\n                // Insert the accumulated changes at this parent location\n                const t = this.getFieldsMap(e);\n                this.applyChanges(t, n, r), n = {}, r = [], e = s.popLast();\n            }\n            t ? n[s.lastSegment()] = Kt(t) : r.push(s.lastSegment());\n        }));\n        const s = this.getFieldsMap(e);\n        this.applyChanges(s, n, r);\n    }\n    /**\n     * Removes the field at the specified path. If there is no field at the\n     * specified path, nothing is changed.\n     *\n     * @param path - The field path to remove.\n     */    delete(t) {\n        const e = this.field(t.popLast());\n        Gt(e) && e.mapValue.fields && delete e.mapValue.fields[t.lastSegment()];\n    }\n    isEqual(t) {\n        return Mt(this.value, t.value);\n    }\n    /**\n     * Returns the map that contains the leaf element of `path`. If the parent\n     * entry does not yet exist, or if it is not a map, a new map will be created.\n     */    getFieldsMap(t) {\n        let e = this.value;\n        e.mapValue.fields || (e.mapValue = {\n            fields: {}\n        });\n        for (let n = 0; n < t.length; ++n) {\n            let r = e.mapValue.fields[t.get(n)];\n            Gt(r) && r.mapValue.fields || (r = {\n                mapValue: {\n                    fields: {}\n                }\n            }, e.mapValue.fields[t.get(n)] = r), e = r;\n        }\n        return e.mapValue.fields;\n    }\n    /**\n     * Modifies `fieldsMap` by adding, replacing or deleting the specified\n     * entries.\n     */    applyChanges(t, e, n) {\n        Rt(e, ((e, n) => t[e] = n));\n        for (const e of n) delete t[e];\n    }\n    clone() {\n        return new ge(Kt(this.value));\n    }\n}\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * Represents a document in Firestore with a key, version, data and whether it\n * has local mutations applied to it.\n *\n * Documents can transition between states via `convertToFoundDocument()`,\n * `convertToNoDocument()` and `convertToUnknownDocument()`. If a document does\n * not transition to one of these states even after all mutations have been\n * applied, `isValidDocument()` returns false and the document should be removed\n * from all views.\n */ class _e {\n    constructor(t, e, n, r, s, i, o) {\n        this.key = t, this.documentType = e, this.version = n, this.readTime = r, this.createTime = s, \n        this.data = i, this.documentState = o;\n    }\n    /**\n     * Creates a document with no known version or data, but which can serve as\n     * base document for mutations.\n     */    static newInvalidDocument(t) {\n        return new _e(t, 0 /* DocumentType.INVALID */ , \n        /* version */ le.min(), \n        /* readTime */ le.min(), \n        /* createTime */ le.min(), ge.empty(), 0 /* DocumentState.SYNCED */);\n    }\n    /**\n     * Creates a new document that is known to exist with the given data at the\n     * given version.\n     */    static newFoundDocument(t, e, n, r) {\n        return new _e(t, 1 /* DocumentType.FOUND_DOCUMENT */ , \n        /* version */ e, \n        /* readTime */ le.min(), \n        /* createTime */ n, r, 0 /* DocumentState.SYNCED */);\n    }\n    /** Creates a new document that is known to not exist at the given version. */    static newNoDocument(t, e) {\n        return new _e(t, 2 /* DocumentType.NO_DOCUMENT */ , \n        /* version */ e, \n        /* readTime */ le.min(), \n        /* createTime */ le.min(), ge.empty(), 0 /* DocumentState.SYNCED */);\n    }\n    /**\n     * Creates a new document that is known to exist at the given version but\n     * whose data is not known (e.g. a document that was updated without a known\n     * base document).\n     */    static newUnknownDocument(t, e) {\n        return new _e(t, 3 /* DocumentType.UNKNOWN_DOCUMENT */ , \n        /* version */ e, \n        /* readTime */ le.min(), \n        /* createTime */ le.min(), ge.empty(), 2 /* DocumentState.HAS_COMMITTED_MUTATIONS */);\n    }\n    /**\n     * Changes the document type to indicate that it exists and that its version\n     * and data are known.\n     */    convertToFoundDocument(t, e) {\n        // If a document is switching state from being an invalid or deleted\n        // document to a valid (FOUND_DOCUMENT) document, either due to receiving an\n        // update from Watch or due to applying a local set mutation on top\n        // of a deleted document, our best guess about its createTime would be the\n        // version at which the document transitioned to a FOUND_DOCUMENT.\n        return !this.createTime.isEqual(le.min()) || 2 /* DocumentType.NO_DOCUMENT */ !== this.documentType && 0 /* DocumentType.INVALID */ !== this.documentType || (this.createTime = t), \n        this.version = t, this.documentType = 1 /* DocumentType.FOUND_DOCUMENT */ , this.data = e, \n        this.documentState = 0 /* DocumentState.SYNCED */ , this;\n    }\n    /**\n     * Changes the document type to indicate that it doesn't exist at the given\n     * version.\n     */    convertToNoDocument(t) {\n        return this.version = t, this.documentType = 2 /* DocumentType.NO_DOCUMENT */ , \n        this.data = ge.empty(), this.documentState = 0 /* DocumentState.SYNCED */ , this;\n    }\n    /**\n     * Changes the document type to indicate that it exists at a given version but\n     * that its data is not known (e.g. a document that was updated without a known\n     * base document).\n     */    convertToUnknownDocument(t) {\n        return this.version = t, this.documentType = 3 /* DocumentType.UNKNOWN_DOCUMENT */ , \n        this.data = ge.empty(), this.documentState = 2 /* DocumentState.HAS_COMMITTED_MUTATIONS */ , \n        this;\n    }\n    setHasCommittedMutations() {\n        return this.documentState = 2 /* DocumentState.HAS_COMMITTED_MUTATIONS */ , this;\n    }\n    setHasLocalMutations() {\n        return this.documentState = 1 /* DocumentState.HAS_LOCAL_MUTATIONS */ , this.version = le.min(), \n        this;\n    }\n    setReadTime(t) {\n        return this.readTime = t, this;\n    }\n    get hasLocalMutations() {\n        return 1 /* DocumentState.HAS_LOCAL_MUTATIONS */ === this.documentState;\n    }\n    get hasCommittedMutations() {\n        return 2 /* DocumentState.HAS_COMMITTED_MUTATIONS */ === this.documentState;\n    }\n    get hasPendingWrites() {\n        return this.hasLocalMutations || this.hasCommittedMutations;\n    }\n    isValidDocument() {\n        return 0 /* DocumentType.INVALID */ !== this.documentType;\n    }\n    isFoundDocument() {\n        return 1 /* DocumentType.FOUND_DOCUMENT */ === this.documentType;\n    }\n    isNoDocument() {\n        return 2 /* DocumentType.NO_DOCUMENT */ === this.documentType;\n    }\n    isUnknownDocument() {\n        return 3 /* DocumentType.UNKNOWN_DOCUMENT */ === this.documentType;\n    }\n    isEqual(t) {\n        return t instanceof _e && this.key.isEqual(t.key) && this.version.isEqual(t.version) && this.documentType === t.documentType && this.documentState === t.documentState && this.data.isEqual(t.data);\n    }\n    mutableCopy() {\n        return new _e(this.key, this.documentType, this.version, this.readTime, this.createTime, this.data.clone(), this.documentState);\n    }\n    toString() {\n        return `Document(${this.key}, ${this.version}, ${JSON.stringify(this.data.value)}, {createTime: ${this.createTime}}), {documentType: ${this.documentType}}), {documentState: ${this.documentState}})`;\n    }\n}\n\n/**\n * @license\n * Copyright 2019 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n// Visible for testing\nclass ve {\n    constructor(t, e = null, n = [], r = [], s = null, i = null, o = null) {\n        this.path = t, this.collectionGroup = e, this.orderBy = n, this.filters = r, this.limit = s, \n        this.startAt = i, this.endAt = o, this.S = null;\n    }\n}\n\n/**\n * Initializes a Target with a path and optional additional query constraints.\n * Path must currently be empty if this is a collection group query.\n *\n * NOTE: you should always construct `Target` from `Query.toTarget` instead of\n * using this factory method, because `Query` provides an implicit `orderBy`\n * property.\n */ function be(t, e = null, n = [], r = [], s = null, i = null, o = null) {\n    return new ve(t, e, n, r, s, i, o);\n}\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * Query encapsulates all the query attributes we support in the SDK. It can\n * be run against the LocalStore, as well as be converted to a `Target` to\n * query the RemoteStore results.\n *\n * Visible for testing.\n */\nclass Ee {\n    /**\n     * Initializes a Query with a path and optional additional query constraints.\n     * Path must currently be empty if this is a collection group query.\n     */\n    constructor(t, e = null, n = [], r = [], s = null, i = \"F\" /* LimitType.First */ , o = null, u = null) {\n        this.path = t, this.collectionGroup = e, this.explicitOrderBy = n, this.filters = r, \n        this.limit = s, this.limitType = i, this.startAt = o, this.endAt = u, this.q = null, \n        // The corresponding `Target` of this `Query` instance.\n        this.O = null, this.startAt, this.endAt;\n    }\n}\n\n/** Creates a new Query for a query that matches all documents at `path` */ function Ie(t) {\n    return t.explicitOrderBy.length > 0 ? t.explicitOrderBy[0].field : null;\n}\n\nfunction Te(t) {\n    for (const e of t.filters) {\n        const t = e.getFirstInequalityField();\n        if (null !== t) return t;\n    }\n    return null;\n}\n\n/**\n * Creates a new Query for a collection group query that matches all documents\n * within the provided collection group.\n */\n/**\n * Returns whether the query matches a collection group rather than a specific\n * collection.\n */\nfunction Ae(t) {\n    return null !== t.collectionGroup;\n}\n\n/**\n * Returns the implicit order by constraint that is used to execute the Query,\n * which can be different from the order by constraints the user provided (e.g.\n * the SDK and backend always orders by `__name__`).\n */ function Re(t) {\n    const e = I(t);\n    if (null === e.q) {\n        e.q = [];\n        const t = Te(e), n = Ie(e);\n        if (null !== t && null === n) \n        // In order to implicitly add key ordering, we must also add the\n        // inequality filter field for it to be a valid query.\n        // Note that the default inequality field and key ordering is ascending.\n        t.isKeyField() || e.q.push(new ae(t)), e.q.push(new ae(nt.keyField(), \"asc\" /* Direction.ASCENDING */)); else {\n            let t = !1;\n            for (const n of e.explicitOrderBy) e.q.push(n), n.field.isKeyField() && (t = !0);\n            if (!t) {\n                // The order of the implicit key ordering always matches the last\n                // explicit order by\n                const t = e.explicitOrderBy.length > 0 ? e.explicitOrderBy[e.explicitOrderBy.length - 1].dir : \"asc\" /* Direction.ASCENDING */;\n                e.q.push(new ae(nt.keyField(), t));\n            }\n        }\n    }\n    return e.q;\n}\n\n/**\n * Converts this `Query` instance to it's corresponding `Target` representation.\n */ function Pe(t) {\n    const e = I(t);\n    if (!e.O) if (\"F\" /* LimitType.First */ === e.limitType) e.O = be(e.path, e.collectionGroup, Re(e), e.filters, e.limit, e.startAt, e.endAt); else {\n        // Flip the orderBy directions since we want the last results\n        const t = [];\n        for (const n of Re(e)) {\n            const e = \"desc\" /* Direction.DESCENDING */ === n.dir ? \"asc\" /* Direction.ASCENDING */ : \"desc\" /* Direction.DESCENDING */;\n            t.push(new ae(n.field, e));\n        }\n        // We need to swap the cursors to match the now-flipped query ordering.\n                const n = e.endAt ? new Yt(e.endAt.position, e.endAt.inclusive) : null, r = e.startAt ? new Yt(e.startAt.position, e.startAt.inclusive) : null;\n        // Now return as a LimitType.First query.\n        e.O = be(e.path, e.collectionGroup, t, e.filters, e.limit, n, r);\n    }\n    return e.O;\n}\n\nfunction Ve(t, e) {\n    e.getFirstInequalityField(), Te(t);\n    const n = t.filters.concat([ e ]);\n    return new Ee(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);\n}\n\nfunction $e(t, e) {\n    return function(t, e) {\n        if (t.limit !== e.limit) return !1;\n        if (t.orderBy.length !== e.orderBy.length) return !1;\n        for (let n = 0; n < t.orderBy.length; n++) if (!he(t.orderBy[n], e.orderBy[n])) return !1;\n        if (t.filters.length !== e.filters.length) return !1;\n        for (let n = 0; n < t.filters.length; n++) if (!te(t.filters[n], e.filters[n])) return !1;\n        return t.collectionGroup === e.collectionGroup && !!t.path.isEqual(e.path) && !!Ht(t.startAt, e.startAt) && Ht(t.endAt, e.endAt);\n    }(Pe(t), Pe(e)) && t.limitType === e.limitType;\n}\n\n/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * Returns an DoubleValue for `value` that is encoded based the serializer's\n * `useProto3Json` setting.\n */\n/**\n * Returns a value for a number that's appropriate to put into a proto.\n * The return value is an IntegerValue if it can safely represent the value,\n * otherwise a DoubleValue is returned.\n */\nfunction Ne(t, e) {\n    return function(t) {\n        return \"number\" == typeof t && Number.isInteger(t) && !wt(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;\n    }(e) ? \n    /**\n * Returns an IntegerValue for `value`.\n */\n    function(t) {\n        return {\n            integerValue: \"\" + t\n        };\n    }(e) : function(t, e) {\n        if (t.useProto3Json) {\n            if (isNaN(e)) return {\n                doubleValue: \"NaN\"\n            };\n            if (e === 1 / 0) return {\n                doubleValue: \"Infinity\"\n            };\n            if (e === -1 / 0) return {\n                doubleValue: \"-Infinity\"\n            };\n        }\n        return {\n            doubleValue: wt(e) ? \"-0\" : e\n        };\n    }(t, e);\n}\n\n/**\n * @license\n * Copyright 2018 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/** Used to represent a field transform on a mutation. */ class De {\n    constructor() {\n        // Make sure that the structural type of `TransformOperation` is unique.\n        // See https://github.com/microsoft/TypeScript/issues/5451\n        this._ = void 0;\n    }\n}\n\n/** Transforms a value into a server-generated timestamp. */ class Fe extends De {}\n\n/** Transforms an array value via a union operation. */ class xe extends De {\n    constructor(t) {\n        super(), this.elements = t;\n    }\n}\n\n/** Transforms an array value via a remove operation. */ class Se extends De {\n    constructor(t) {\n        super(), this.elements = t;\n    }\n}\n\n/**\n * Implements the backend semantics for locally computed NUMERIC_ADD (increment)\n * transforms. Converts all field values to integers or doubles, but unlike the\n * backend does not cap integer values at 2^63. Instead, JavaScript number\n * arithmetic is used and precision loss can occur for values greater than 2^53.\n */ class qe extends De {\n    constructor(t, e) {\n        super(), this.serializer = t, this.k = e;\n    }\n}\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/** A field path and the TransformOperation to perform upon it. */ class Oe {\n    constructor(t, e) {\n        this.field = t, this.transform = e;\n    }\n}\n\n/**\n * Encodes a precondition for a mutation. This follows the model that the\n * backend accepts with the special case of an explicit \"empty\" precondition\n * (meaning no precondition).\n */ class ke {\n    constructor(t, e) {\n        this.updateTime = t, this.exists = e;\n    }\n    /** Creates a new empty Precondition. */    static none() {\n        return new ke;\n    }\n    /** Creates a new Precondition with an exists flag. */    static exists(t) {\n        return new ke(void 0, t);\n    }\n    /** Creates a new Precondition based on a version a document exists at. */    static updateTime(t) {\n        return new ke(t);\n    }\n    /** Returns whether this Precondition is empty. */    get isNone() {\n        return void 0 === this.updateTime && void 0 === this.exists;\n    }\n    isEqual(t) {\n        return this.exists === t.exists && (this.updateTime ? !!t.updateTime && this.updateTime.isEqual(t.updateTime) : !t.updateTime);\n    }\n}\n\n/**\n * A mutation describes a self-contained change to a document. Mutations can\n * create, replace, delete, and update subsets of documents.\n *\n * Mutations not only act on the value of the document but also its version.\n *\n * For local mutations (mutations that haven't been committed yet), we preserve\n * the existing version for Set and Patch mutations. For Delete mutations, we\n * reset the version to 0.\n *\n * Here's the expected transition table.\n *\n * MUTATION           APPLIED TO            RESULTS IN\n *\n * SetMutation        Document(v3)          Document(v3)\n * SetMutation        NoDocument(v3)        Document(v0)\n * SetMutation        InvalidDocument(v0)   Document(v0)\n * PatchMutation      Document(v3)          Document(v3)\n * PatchMutation      NoDocument(v3)        NoDocument(v3)\n * PatchMutation      InvalidDocument(v0)   UnknownDocument(v3)\n * DeleteMutation     Document(v3)          NoDocument(v0)\n * DeleteMutation     NoDocument(v3)        NoDocument(v0)\n * DeleteMutation     InvalidDocument(v0)   NoDocument(v0)\n *\n * For acknowledged mutations, we use the updateTime of the WriteResponse as\n * the resulting version for Set and Patch mutations. As deletes have no\n * explicit update time, we use the commitTime of the WriteResponse for\n * Delete mutations.\n *\n * If a mutation is acknowledged by the backend but fails the precondition check\n * locally, we transition to an `UnknownDocument` and rely on Watch to send us\n * the updated version.\n *\n * Field transforms are used only with Patch and Set Mutations. We use the\n * `updateTransforms` message to store transforms, rather than the `transforms`s\n * messages.\n *\n * ## Subclassing Notes\n *\n * Every type of mutation needs to implement its own applyToRemoteDocument() and\n * applyToLocalView() to implement the actual behavior of applying the mutation\n * to some source document (see `setMutationApplyToRemoteDocument()` for an\n * example).\n */ class Ce {}\n\n/**\n * A mutation that creates or replaces the document at the given key with the\n * object value contents.\n */ class Me extends Ce {\n    constructor(t, e, n, r = []) {\n        super(), this.key = t, this.value = e, this.precondition = n, this.fieldTransforms = r, \n        this.type = 0 /* MutationType.Set */;\n    }\n    getFieldMask() {\n        return null;\n    }\n}\n\n/**\n * A mutation that modifies fields of the document at the given key with the\n * given values. The values are applied through a field mask:\n *\n *  * When a field is in both the mask and the values, the corresponding field\n *    is updated.\n *  * When a field is in neither the mask nor the values, the corresponding\n *    field is unmodified.\n *  * When a field is in the mask but not in the values, the corresponding field\n *    is deleted.\n *  * When a field is not in the mask but is in the values, the values map is\n *    ignored.\n */ class Le extends Ce {\n    constructor(t, e, n, r, s = []) {\n        super(), this.key = t, this.data = e, this.fieldMask = n, this.precondition = r, \n        this.fieldTransforms = s, this.type = 1 /* MutationType.Patch */;\n    }\n    getFieldMask() {\n        return this.fieldMask;\n    }\n}\n\n/** A mutation that deletes the document at the given key. */ class Ue extends Ce {\n    constructor(t, e) {\n        super(), this.key = t, this.precondition = e, this.type = 2 /* MutationType.Delete */ , \n        this.fieldTransforms = [];\n    }\n    getFieldMask() {\n        return null;\n    }\n}\n\n/**\n * A mutation that verifies the existence of the document at the given key with\n * the provided precondition.\n *\n * The `verify` operation is only used in Transactions, and this class serves\n * primarily to facilitate serialization into protos.\n */ class je extends Ce {\n    constructor(t, e) {\n        super(), this.key = t, this.precondition = e, this.type = 3 /* MutationType.Verify */ , \n        this.fieldTransforms = [];\n    }\n    getFieldMask() {\n        return null;\n    }\n}\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */ const Be = (() => {\n    const t = {\n        asc: \"ASCENDING\",\n        desc: \"DESCENDING\"\n    };\n    return t;\n})(), Qe = (() => {\n    const t = {\n        \"<\": \"LESS_THAN\",\n        \"<=\": \"LESS_THAN_OR_EQUAL\",\n        \">\": \"GREATER_THAN\",\n        \">=\": \"GREATER_THAN_OR_EQUAL\",\n        \"==\": \"EQUAL\",\n        \"!=\": \"NOT_EQUAL\",\n        \"array-contains\": \"ARRAY_CONTAINS\",\n        in: \"IN\",\n        \"not-in\": \"NOT_IN\",\n        \"array-contains-any\": \"ARRAY_CONTAINS_ANY\"\n    };\n    return t;\n})(), ze = (() => {\n    const t = {\n        and: \"AND\",\n        or: \"OR\"\n    };\n    return t;\n})();\n\n/**\n * This class generates JsonObject values for the Datastore API suitable for\n * sending to either GRPC stub methods or via the JSON/HTTP REST API.\n *\n * The serializer supports both Protobuf.js and Proto3 JSON formats. By\n * setting `useProto3Json` to true, the serializer will use the Proto3 JSON\n * format.\n *\n * For a description of the Proto3 JSON format check\n * https://developers.google.com/protocol-buffers/docs/proto3#json\n *\n * TODO(klimt): We can remove the databaseId argument if we keep the full\n * resource name in documents.\n */\nclass We {\n    constructor(t, e) {\n        this.databaseId = t, this.useProto3Json = e;\n    }\n}\n\n/**\n * Returns a value for a number (or null) that's appropriate to put into\n * a google.protobuf.Int32Value proto.\n * DO NOT USE THIS FOR ANYTHING ELSE.\n * This method cheats. It's typed as returning \"number\" because that's what\n * our generated proto interfaces say Int32Value must be. But GRPC actually\n * expects a { value: <number> } struct.\n */\n/**\n * Returns a value for a Date that's appropriate to put into a proto.\n */\nfunction Ge(t, e) {\n    if (t.useProto3Json) {\n        return `${new Date(1e3 * e.seconds).toISOString().replace(/\\.\\d*/, \"\").replace(\"Z\", \"\")}.${(\"000000000\" + e.nanoseconds).slice(-9)}Z`;\n    }\n    return {\n        seconds: \"\" + e.seconds,\n        nanos: e.nanoseconds\n    };\n}\n\n/**\n * Returns a value for bytes that's appropriate to put in a proto.\n *\n * Visible for testing.\n */\nfunction Ke(t, e) {\n    return t.useProto3Json ? e.toBase64() : e.toUint8Array();\n}\n\nfunction Ye(t, e) {\n    return Ge(t, e.toTimestamp());\n}\n\nfunction He(t) {\n    return E(!!t), le.fromTimestamp(function(t) {\n        const e = Nt(t);\n        return new xt(e.seconds, e.nanos);\n    }(t));\n}\n\nfunction Je(t, e) {\n    return function(t) {\n        return new tt([ \"projects\", t.projectId, \"databases\", t.database ]);\n    }(t).child(\"documents\").child(e).canonicalString();\n}\n\nfunction Xe(t, e) {\n    return Je(t.databaseId, e.path);\n}\n\nfunction Ze(t, e) {\n    const n = function(t) {\n        const e = tt.fromString(t);\n        return E(dn(e)), e;\n    }(e);\n    if (n.get(1) !== t.databaseId.projectId) throw new U(P, \"Tried to deserialize key from different project: \" + n.get(1) + \" vs \" + t.databaseId.projectId);\n    if (n.get(3) !== t.databaseId.database) throw new U(P, \"Tried to deserialize key from different database: \" + n.get(3) + \" vs \" + t.databaseId.database);\n    return new rt((E((r = n).length > 4 && \"documents\" === r.get(4)), r.popFirst(5)));\n    var r;\n    /** Creates a Document proto from key and fields (but no create/update time) */}\n\nfunction tn(t, e) {\n    return Je(t.databaseId, e);\n}\n\nfunction en(t) {\n    return new tt([ \"projects\", t.databaseId.projectId, \"databases\", t.databaseId.database ]).canonicalString();\n}\n\nfunction nn(t, e, n) {\n    return {\n        name: Xe(t, e),\n        fields: n.value.mapValue.fields\n    };\n}\n\nfunction rn(t, e) {\n    return \"found\" in e ? function(t, e) {\n        E(!!e.found), e.found.name, e.found.updateTime;\n        const n = Ze(t, e.found.name), r = He(e.found.updateTime), s = e.found.createTime ? He(e.found.createTime) : le.min(), i = new ge({\n            mapValue: {\n                fields: e.found.fields\n            }\n        });\n        return _e.newFoundDocument(n, r, s, i);\n    }(t, e) : \"missing\" in e ? function(t, e) {\n        E(!!e.missing), E(!!e.readTime);\n        const n = Ze(t, e.missing), r = He(e.readTime);\n        return _e.newNoDocument(n, r);\n    }(t, e) : b();\n}\n\nfunction sn(t, e) {\n    let n;\n    if (e instanceof Me) n = {\n        update: nn(t, e.key, e.value)\n    }; else if (e instanceof Ue) n = {\n        delete: Xe(t, e.key)\n    }; else if (e instanceof Le) n = {\n        update: nn(t, e.key, e.data),\n        updateMask: fn(e.fieldMask)\n    }; else {\n        if (!(e instanceof je)) return b();\n        n = {\n            verify: Xe(t, e.key)\n        };\n    }\n    return e.fieldTransforms.length > 0 && (n.updateTransforms = e.fieldTransforms.map((t => function(t, e) {\n        const n = e.transform;\n        if (n instanceof Fe) return {\n            fieldPath: e.field.canonicalString(),\n            setToServerValue: \"REQUEST_TIME\"\n        };\n        if (n instanceof xe) return {\n            fieldPath: e.field.canonicalString(),\n            appendMissingElements: {\n                values: n.elements\n            }\n        };\n        if (n instanceof Se) return {\n            fieldPath: e.field.canonicalString(),\n            removeAllFromArray: {\n                values: n.elements\n            }\n        };\n        if (n instanceof qe) return {\n            fieldPath: e.field.canonicalString(),\n            increment: n.k\n        };\n        throw b();\n    }(0, t)))), e.precondition.isNone || (n.currentDocument = function(t, e) {\n        return void 0 !== e.updateTime ? {\n            updateTime: Ye(t, e.updateTime)\n        } : void 0 !== e.exists ? {\n            exists: e.exists\n        } : b();\n    }(t, e.precondition)), n;\n}\n\nfunction on(t, e) {\n    // Dissect the path into parent, collectionId, and optional key filter.\n    const n = {\n        structuredQuery: {}\n    }, r = e.path;\n    null !== e.collectionGroup ? (n.parent = tn(t, r), n.structuredQuery.from = [ {\n        collectionId: e.collectionGroup,\n        allDescendants: !0\n    } ]) : (n.parent = tn(t, r.popLast()), n.structuredQuery.from = [ {\n        collectionId: r.lastSegment()\n    } ]);\n    const s = function(t) {\n        if (0 === t.length) return;\n        return ln(Zt.create(t, \"and\" /* CompositeOperator.AND */));\n    }(e.filters);\n    s && (n.structuredQuery.where = s);\n    const i = function(t) {\n        if (0 === t.length) return;\n        return t.map((t => \n        // visible for testing\n        function(t) {\n            return {\n                field: hn(t.field),\n                direction: un(t.dir)\n            };\n        }\n        // visible for testing\n        (t)));\n    }(e.orderBy);\n    i && (n.structuredQuery.orderBy = i);\n    const o = function(t, e) {\n        return t.useProto3Json || dt(e) ? e : {\n            value: e\n        };\n    }(t, e.limit);\n    var u;\n    return null !== o && (n.structuredQuery.limit = o), e.startAt && (n.structuredQuery.startAt = {\n        before: (u = e.startAt).inclusive,\n        values: u.position\n    }), e.endAt && (n.structuredQuery.endAt = function(t) {\n        return {\n            before: !t.inclusive,\n            values: t.position\n        };\n    }\n    // visible for testing\n    (e.endAt)), n;\n}\n\nfunction un(t) {\n    return Be[t];\n}\n\n// visible for testing\nfunction cn(t) {\n    return Qe[t];\n}\n\nfunction an(t) {\n    return ze[t];\n}\n\nfunction hn(t) {\n    return {\n        fieldPath: t.canonicalString()\n    };\n}\n\nfunction ln(t) {\n    return t instanceof Xt ? function(t) {\n        if (\"==\" /* Operator.EQUAL */ === t.op) {\n            if (Wt(t.value)) return {\n                unaryFilter: {\n                    field: hn(t.field),\n                    op: \"IS_NAN\"\n                }\n            };\n            if (zt(t.value)) return {\n                unaryFilter: {\n                    field: hn(t.field),\n                    op: \"IS_NULL\"\n                }\n            };\n        } else if (\"!=\" /* Operator.NOT_EQUAL */ === t.op) {\n            if (Wt(t.value)) return {\n                unaryFilter: {\n                    field: hn(t.field),\n                    op: \"IS_NOT_NAN\"\n                }\n            };\n            if (zt(t.value)) return {\n                unaryFilter: {\n                    field: hn(t.field),\n                    op: \"IS_NOT_NULL\"\n                }\n            };\n        }\n        return {\n            fieldFilter: {\n                field: hn(t.field),\n                op: cn(t.op),\n                value: t.value\n            }\n        };\n    }(t) : t instanceof Zt ? function(t) {\n        const e = t.getFilters().map((t => ln(t)));\n        if (1 === e.length) return e[0];\n        return {\n            compositeFilter: {\n                op: an(t.op),\n                filters: e\n            }\n        };\n    }(t) : b();\n}\n\nfunction fn(t) {\n    const e = [];\n    return t.fields.forEach((t => e.push(t.canonicalString()))), {\n        fieldPaths: e\n    };\n}\n\nfunction dn(t) {\n    // Resource names have at least 4 components (project ID, database ID)\n    return t.length >= 4 && \"projects\" === t.get(0) && \"databases\" === t.get(2);\n}\n\n/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */ function wn(t) {\n    return new We(t, /* useProto3Json= */ !0);\n}\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * A helper for running delayed tasks following an exponential backoff curve\n * between attempts.\n *\n * Each delay is made up of a \"base\" delay which follows the exponential\n * backoff curve, and a +/- 50% \"jitter\" that is calculated and added to the\n * base delay. This prevents clients from accidentally synchronizing their\n * delays causing spikes of load to the backend.\n */\nclass mn {\n    constructor(\n    /**\n     * The AsyncQueue to run backoff operations on.\n     */\n    t, \n    /**\n     * The ID to use when scheduling backoff operations on the AsyncQueue.\n     */\n    e, \n    /**\n     * The initial delay (used as the base delay on the first retry attempt).\n     * Note that jitter will still be applied, so the actual delay could be as\n     * little as 0.5*initialDelayMs.\n     */\n    n = 1e3\n    /**\n     * The multiplier to use to determine the extended base delay after each\n     * attempt.\n     */ , r = 1.5\n    /**\n     * The maximum base delay after which no further backoff is performed.\n     * Note that jitter will still be applied, so the actual delay could be as\n     * much as 1.5*maxDelayMs.\n     */ , s = 6e4) {\n        this.C = t, this.timerId = e, this.M = n, this.L = r, this.U = s, this.j = 0, this.B = null, \n        /** The last backoff attempt, as epoch milliseconds. */\n        this.W = Date.now(), this.reset();\n    }\n    /**\n     * Resets the backoff delay.\n     *\n     * The very next backoffAndWait() will have no delay. If it is called again\n     * (i.e. due to an error), initialDelayMs (plus jitter) will be used, and\n     * subsequent ones will increase according to the backoffFactor.\n     */    reset() {\n        this.j = 0;\n    }\n    /**\n     * Resets the backoff delay to the maximum delay (e.g. for use after a\n     * RESOURCE_EXHAUSTED error).\n     */    G() {\n        this.j = this.U;\n    }\n    /**\n     * Returns a promise that resolves after currentDelayMs, and increases the\n     * delay for any subsequent attempts. If there was a pending backoff operation\n     * already, it will be canceled.\n     */    K(t) {\n        // Cancel any pending backoff operation.\n        this.cancel();\n        // First schedule using the current base (which may be 0 and should be\n        // honored as such).\n        const e = Math.floor(this.j + this.Y()), n = Math.max(0, Date.now() - this.W), r = Math.max(0, e - n);\n        // Guard against lastAttemptTime being in the future due to a clock change.\n                r > 0 && y(\"ExponentialBackoff\", `Backing off for ${r} ms (base delay: ${this.j} ms, delay with jitter: ${e} ms, last attempt: ${n} ms ago)`), \n        this.B = this.C.enqueueAfterDelay(this.timerId, r, (() => (this.W = Date.now(), \n        t()))), \n        // Apply backoff factor to determine next delay and ensure it is within\n        // bounds.\n        this.j *= this.L, this.j < this.M && (this.j = this.M), this.j > this.U && (this.j = this.U);\n    }\n    H() {\n        null !== this.B && (this.B.skipDelay(), this.B = null);\n    }\n    cancel() {\n        null !== this.B && (this.B.cancel(), this.B = null);\n    }\n    /** Returns a random value in the range [-currentBaseMs/2, currentBaseMs/2] */    Y() {\n        return (Math.random() - .5) * this.j;\n    }\n}\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * Datastore and its related methods are a wrapper around the external Google\n * Cloud Datastore grpc API, which provides an interface that is more convenient\n * for the rest of the client SDK architecture to consume.\n */\n/**\n * An implementation of Datastore that exposes additional state for internal\n * consumption.\n */\nclass pn extends class {} {\n    constructor(t, e, n, r) {\n        super(), this.authCredentials = t, this.appCheckCredentials = e, this.connection = n, \n        this.serializer = r, this.J = !1;\n    }\n    X() {\n        if (this.J) throw new U(S, \"The client has already been terminated.\");\n    }\n    /** Invokes the provided RPC with auth and AppCheck tokens. */    v(t, e, n) {\n        return this.X(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((([r, s]) => this.connection.v(t, e, n, r, s))).catch((t => {\n            throw \"FirebaseError\" === t.name ? (t.code === F && (this.authCredentials.invalidateToken(), \n            this.appCheckCredentials.invalidateToken()), t) : new U(R, t.toString());\n        }));\n    }\n    /** Invokes the provided RPC with streamed results with auth and AppCheck tokens. */    R(t, e, n, r) {\n        return this.X(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((([s, i]) => this.connection.R(t, e, n, s, i, r))).catch((t => {\n            throw \"FirebaseError\" === t.name ? (t.code === F && (this.authCredentials.invalidateToken(), \n            this.appCheckCredentials.invalidateToken()), t) : new U(R, t.toString());\n        }));\n    }\n    terminate() {\n        this.J = !0;\n    }\n}\n\n// TODO(firestorexp): Make sure there is only one Datastore instance per\n// firestore-exp client.\nasync function yn(t, e) {\n    const n = I(t), r = en(n.serializer) + \"/documents\", s = {\n        writes: e.map((t => sn(n.serializer, t)))\n    };\n    await n.v(\"Commit\", r, s);\n}\n\nasync function gn(t, e) {\n    const n = I(t), r = en(n.serializer) + \"/documents\", s = {\n        documents: e.map((t => Xe(n.serializer, t)))\n    }, i = await n.R(\"BatchGetDocuments\", r, s, e.length), o = new Map;\n    i.forEach((t => {\n        const e = rn(n.serializer, t);\n        o.set(e.key.toString(), e);\n    }));\n    const u = [];\n    return e.forEach((t => {\n        const e = o.get(t.toString());\n        E(!!e), u.push(e);\n    })), u;\n}\n\nasync function _n(t, e) {\n    const n = I(t), r = on(n.serializer, Pe(e));\n    return (await n.R(\"RunQuery\", r.parent, {\n        structuredQuery: r.structuredQuery\n    })).filter((t => !!t.document)).map((t => function(t, e, n) {\n        const r = Ze(t, e.name), s = He(e.updateTime), i = e.createTime ? He(e.createTime) : le.min(), o = new ge({\n            mapValue: {\n                fields: e.fields\n            }\n        }), u = _e.newFoundDocument(r, s, i, o);\n        return n && u.setHasCommittedMutations(), n ? u.setHasCommittedMutations() : u;\n    }(n.serializer, t.document, void 0)));\n}\n\nasync function vn(t, e, n) {\n    var r;\n    const s = I(t), {request: i, Z: o} = function(t, e, n) {\n        const r = on(t, e), s = {}, i = [];\n        let o = 0;\n        return n.forEach((t => {\n            // Map all client-side aliases to a unique short-form\n            // alias. This avoids issues with client-side aliases that\n            // exceed the 1500-byte string size limit.\n            const e = \"aggregate_\" + o++;\n            s[e] = t.alias, \"count\" === t.$ ? i.push({\n                alias: e,\n                count: {}\n            }) : \"avg\" === t.$ ? i.push({\n                alias: e,\n                avg: {\n                    field: hn(t.fieldPath)\n                }\n            }) : \"sum\" === t.$ && i.push({\n                alias: e,\n                sum: {\n                    field: hn(t.fieldPath)\n                }\n            });\n        })), {\n            request: {\n                structuredAggregationQuery: {\n                    aggregations: i,\n                    structuredQuery: r.structuredQuery\n                },\n                parent: r.parent\n            },\n            Z: s\n        };\n    }(s.serializer, Pe(e), n), u = i.parent;\n    s.connection.g || delete i.parent;\n    const c = (await s.R(\"RunAggregationQuery\", u, i, /*expectedResponseCount=*/ 1)).filter((t => !!t.result));\n    // Omit RunAggregationQueryResponse that only contain readTimes.\n        E(1 === c.length);\n    // Remap the short-form aliases that were sent to the server\n    // to the client-side aliases. Users will access the results\n    // using the client-side alias.\n    const a = null === (r = c[0].result) || void 0 === r ? void 0 : r.aggregateFields;\n    return Object.keys(a).reduce(((t, e) => (t[o[e]] = a[e], t)), {});\n}\n\n/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */ const bn = new Map;\n\n/**\n * An instance map that ensures only one Datastore exists per Firestore\n * instance.\n */\n/**\n * Returns an initialized and started Datastore for the given Firestore\n * instance. Callers must invoke removeComponents() when the Firestore\n * instance is terminated.\n */\nfunction En(t) {\n    if (t._terminated) throw new U(S, \"The client has already been terminated.\");\n    if (!bn.has(t)) {\n        y(\"ComponentProvider\", \"Initializing Datastore\");\n        const i = function(t) {\n            return new _t(t, fetch.bind(null));\n        }((e = t._databaseId, n = t.app.options.appId || \"\", r = t._persistenceKey, s = t._freezeSettings(), \n        new J(e, n, r, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, ht(s.experimentalLongPollingOptions), s.useFetchStreams))), o = wn(t._databaseId), u = function(t, e, n, r) {\n            return new pn(t, e, n, r);\n        }(t._authCredentials, t._appCheckCredentials, i, o);\n        bn.set(t, u);\n    }\n    var e, n, r, s;\n    /**\n * @license\n * Copyright 2018 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */    return bn.get(t);\n}\n\n/**\n * Removes all components associated with the provided instance. Must be called\n * when the `Firestore` instance is terminated.\n */\n/**\n * A concrete type describing all the values that can be applied via a\n * user-supplied `FirestoreSettings` object. This is a separate type so that\n * defaults can be supplied and the value can be checked for equality.\n */\nclass In {\n    constructor(t) {\n        var e, n;\n        if (void 0 === t.host) {\n            if (void 0 !== t.ssl) throw new U(P, \"Can't provide ssl option if host option is not set\");\n            this.host = \"firestore.googleapis.com\", this.ssl = true;\n        } else this.host = t.host, this.ssl = null === (e = t.ssl) || void 0 === e || e;\n        if (this.credentials = t.credentials, this.ignoreUndefinedProperties = !!t.ignoreUndefinedProperties, \n        this.cache = t.localCache, void 0 === t.cacheSizeBytes) this.cacheSizeBytes = 41943040; else {\n            if (-1 !== t.cacheSizeBytes && t.cacheSizeBytes < 1048576) throw new U(P, \"cacheSizeBytes must be at least 1048576\");\n            this.cacheSizeBytes = t.cacheSizeBytes;\n        }\n        !function(t, e, n, r) {\n            if (!0 === e && !0 === r) throw new U(P, `${t} and ${n} cannot be used together.`);\n        }(\"experimentalForceLongPolling\", t.experimentalForceLongPolling, \"experimentalAutoDetectLongPolling\", t.experimentalAutoDetectLongPolling), \n        this.experimentalForceLongPolling = !!t.experimentalForceLongPolling, this.experimentalForceLongPolling ? this.experimentalAutoDetectLongPolling = !1 : void 0 === t.experimentalAutoDetectLongPolling ? this.experimentalAutoDetectLongPolling = true : \n        // For backwards compatibility, coerce the value to boolean even though\n        // the TypeScript compiler has narrowed the type to boolean already.\n        // noinspection PointlessBooleanExpressionJS\n        this.experimentalAutoDetectLongPolling = !!t.experimentalAutoDetectLongPolling, \n        this.experimentalLongPollingOptions = ht(null !== (n = t.experimentalLongPollingOptions) && void 0 !== n ? n : {}), \n        function(t) {\n            if (void 0 !== t.timeoutSeconds) {\n                if (isNaN(t.timeoutSeconds)) throw new U(P, `invalid long polling timeout: ${t.timeoutSeconds} (must not be NaN)`);\n                if (t.timeoutSeconds < 5) throw new U(P, `invalid long polling timeout: ${t.timeoutSeconds} (minimum allowed value is 5)`);\n                if (t.timeoutSeconds > 30) throw new U(P, `invalid long polling timeout: ${t.timeoutSeconds} (maximum allowed value is 30)`);\n            }\n        }\n        /**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n        /**\n * The Cloud Firestore service interface.\n *\n * Do not call this constructor directly. Instead, use {@link (getFirestore:1)}.\n */ (this.experimentalLongPollingOptions), this.useFetchStreams = !!t.useFetchStreams;\n    }\n    isEqual(t) {\n        return this.host === t.host && this.ssl === t.ssl && this.credentials === t.credentials && this.cacheSizeBytes === t.cacheSizeBytes && this.experimentalForceLongPolling === t.experimentalForceLongPolling && this.experimentalAutoDetectLongPolling === t.experimentalAutoDetectLongPolling && (e = this.experimentalLongPollingOptions, \n        n = t.experimentalLongPollingOptions, e.timeoutSeconds === n.timeoutSeconds) && this.ignoreUndefinedProperties === t.ignoreUndefinedProperties && this.useFetchStreams === t.useFetchStreams;\n        var e, n;\n    }\n}\n\nclass Tn {\n    /** @hideconstructor */\n    constructor(t, e, n, r) {\n        this._authCredentials = t, this._appCheckCredentials = e, this._databaseId = n, \n        this._app = r, \n        /**\n         * Whether it's a Firestore or Firestore Lite instance.\n         */\n        this.type = \"firestore-lite\", this._persistenceKey = \"(lite)\", this._settings = new In({}), \n        this._settingsFrozen = !1;\n    }\n    /**\n     * The {@link @firebase/app#FirebaseApp} associated with this `Firestore` service\n     * instance.\n     */    get app() {\n        if (!this._app) throw new U(S, \"Firestore was not initialized using the Firebase SDK. 'app' is not available\");\n        return this._app;\n    }\n    get _initialized() {\n        return this._settingsFrozen;\n    }\n    get _terminated() {\n        return void 0 !== this._terminateTask;\n    }\n    _setSettings(t) {\n        if (this._settingsFrozen) throw new U(S, \"Firestore has already been started and its settings can no longer be changed. You can only modify settings before calling any other methods on a Firestore object.\");\n        this._settings = new In(t), void 0 !== t.credentials && (this._authCredentials = function(t) {\n            if (!t) return new Q;\n            switch (t.type) {\n              case \"firstParty\":\n                return new K(t.sessionIndex || \"0\", t.iamToken || null, t.authTokenFactory || null);\n\n              case \"provider\":\n                return t.client;\n\n              default:\n                throw new U(P, \"makeAuthCredentialsProvider failed due to invalid credential type\");\n            }\n        }(t.credentials));\n    }\n    _getSettings() {\n        return this._settings;\n    }\n    _freezeSettings() {\n        return this._settingsFrozen = !0, this._settings;\n    }\n    _delete() {\n        return this._terminateTask || (this._terminateTask = this._terminate()), this._terminateTask;\n    }\n    /** Returns a JSON-serializable representation of this `Firestore` instance. */    toJSON() {\n        return {\n            app: this._app,\n            databaseId: this._databaseId,\n            settings: this._settings\n        };\n    }\n    /**\n     * Terminates all components used by this client. Subclasses can override\n     * this method to clean up their own dependencies, but must also call this\n     * method.\n     *\n     * Only ever called once.\n     */    _terminate() {\n        return function(t) {\n            const e = bn.get(t);\n            e && (y(\"ComponentProvider\", \"Removing Datastore\"), bn.delete(t), e.terminate());\n        }(this), Promise.resolve();\n    }\n}\n\nfunction An(t, e, n) {\n    n || (n = \"(default)\");\n    const r = _getProvider(t, \"firestore/lite\");\n    if (r.isInitialized(n)) throw new U(S, \"Firestore can only be initialized once per app.\");\n    return r.initialize({\n        options: e,\n        instanceIdentifier: n\n    });\n}\n\nfunction Rn(e, n) {\n    const r = \"object\" == typeof e ? e : t(), s = \"string\" == typeof e ? e : n || \"(default)\", i = _getProvider(r, \"firestore/lite\").getImmediate({\n        identifier: s\n    });\n    if (!i._initialized) {\n        const t = a(\"firestore\");\n        t && Pn(i, ...t);\n    }\n    return i;\n}\n\n/**\n * Modify this instance to communicate with the Cloud Firestore emulator.\n *\n * Note: This must be called before this instance has been used to do any\n * operations.\n *\n * @param firestore - The `Firestore` instance to configure to connect to the\n * emulator.\n * @param host - the emulator host (ex: localhost).\n * @param port - the emulator port (ex: 9000).\n * @param options.mockUserToken - the mock auth token to use for unit testing\n * Security Rules.\n */ function Pn(t, e, n, r = {}) {\n    var s;\n    const i = (t = ct(t, Tn))._getSettings(), o = `${e}:${n}`;\n    if (\"firestore.googleapis.com\" !== i.host && i.host !== o && _(\"Host has been set in both settings() and connectFirestoreEmulator(), emulator host will be used.\"), \n    t._setSettings(Object.assign(Object.assign({}, i), {\n        host: o,\n        ssl: !1\n    })), r.mockUserToken) {\n        let e, n;\n        if (\"string\" == typeof r.mockUserToken) e = r.mockUserToken, n = d.MOCK_USER; else {\n            // Let createMockUserToken validate first (catches common mistakes like\n            // invalid field \"uid\" and missing field \"sub\" / \"user_id\".)\n            e = h(r.mockUserToken, null === (s = t._app) || void 0 === s ? void 0 : s.options.projectId);\n            const i = r.mockUserToken.sub || r.mockUserToken.user_id;\n            if (!i) throw new U(P, \"mockUserToken must contain 'sub' or 'user_id' field!\");\n            n = new d(i);\n        }\n        t._authCredentials = new z(new B(e, n));\n    }\n}\n\n/**\n * Terminates the provided `Firestore` instance.\n *\n * After calling `terminate()` only the `clearIndexedDbPersistence()` functions\n * may be used. Any other function will throw a `FirestoreError`. Termination\n * does not cancel any pending writes, and any promises that are awaiting a\n * response from the server will not be resolved.\n *\n * To restart after termination, create a new instance of `Firestore` with\n * {@link (getFirestore:1)}.\n *\n * Note: Under normal circumstances, calling `terminate()` is not required. This\n * function is useful only when you want to force this instance to release all of\n * its resources or in combination with {@link clearIndexedDbPersistence} to\n * ensure that all local state is destroyed between test runs.\n *\n * @param firestore - The `Firestore` instance to terminate.\n * @returns A `Promise` that is resolved when the instance has been successfully\n * terminated.\n */ function Vn(t) {\n    return t = ct(t, Tn), e(t.app, \"firestore/lite\"), t._delete();\n}\n\n/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * @license\n * Copyright 2022 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * Represents an aggregation that can be performed by Firestore.\n */\n// eslint-disable-next-line @typescript-eslint/no-unused-vars\nclass $n {\n    /**\n     * Create a new AggregateField<T>\n     * @param _aggregateType Specifies the type of aggregation operation to perform.\n     * @param _internalFieldPath Optionally specifies the field that is aggregated.\n     * @internal\n     */\n    constructor(\n    // TODO (sum/avg) make aggregateType public when the feature is supported\n    t = \"count\", e) {\n        this._aggregateType = t, this._internalFieldPath = e, \n        /** A type string to uniquely identify instances of this class. */\n        this.type = \"AggregateField\";\n    }\n}\n\n/**\n * The results of executing an aggregation query.\n */ class Nn {\n    /** @hideconstructor */\n    constructor(t, e, n) {\n        this._userDataWriter = e, this._data = n, \n        /** A type string to uniquely identify instances of this class. */\n        this.type = \"AggregateQuerySnapshot\", this.query = t;\n    }\n    /**\n     * Returns the results of the aggregations performed over the underlying\n     * query.\n     *\n     * The keys of the returned object will be the same as those of the\n     * `AggregateSpec` object specified to the aggregation method, and the values\n     * will be the corresponding aggregation result.\n     *\n     * @returns The results of the aggregations performed over the underlying\n     * query.\n     */    data() {\n        return this._userDataWriter.convertObjectMap(this._data);\n    }\n}\n\n/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * A `DocumentReference` refers to a document location in a Firestore database\n * and can be used to write, read, or listen to the location. The document at\n * the referenced location may or may not exist.\n */ class Dn {\n    /** @hideconstructor */\n    constructor(t, \n    /**\n     * If provided, the `FirestoreDataConverter` associated with this instance.\n     */\n    e, n) {\n        this.converter = e, this._key = n, \n        /** The type of this Firestore reference. */\n        this.type = \"document\", this.firestore = t;\n    }\n    get _path() {\n        return this._key.path;\n    }\n    /**\n     * The document's identifier within its collection.\n     */    get id() {\n        return this._key.path.lastSegment();\n    }\n    /**\n     * A string representing the path of the referenced document (relative\n     * to the root of the database).\n     */    get path() {\n        return this._key.path.canonicalString();\n    }\n    /**\n     * The collection this `DocumentReference` belongs to.\n     */    get parent() {\n        return new xn(this.firestore, this.converter, this._key.path.popLast());\n    }\n    withConverter(t) {\n        return new Dn(this.firestore, t, this._key);\n    }\n}\n\n/**\n * A `Query` refers to a query which you can read or listen to. You can also\n * construct refined `Query` objects by adding filters and ordering.\n */ class Fn {\n    // This is the lite version of the Query class in the main SDK.\n    /** @hideconstructor protected */\n    constructor(t, \n    /**\n     * If provided, the `FirestoreDataConverter` associated with this instance.\n     */\n    e, n) {\n        this.converter = e, this._query = n, \n        /** The type of this Firestore reference. */\n        this.type = \"query\", this.firestore = t;\n    }\n    withConverter(t) {\n        return new Fn(this.firestore, t, this._query);\n    }\n}\n\n/**\n * A `CollectionReference` object can be used for adding documents, getting\n * document references, and querying for documents (using {@link (query:1)}).\n */ class xn extends Fn {\n    /** @hideconstructor */\n    constructor(t, e, n) {\n        super(t, e, new Ee(n)), this._path = n, \n        /** The type of this Firestore reference. */\n        this.type = \"collection\";\n    }\n    /** The collection's identifier. */    get id() {\n        return this._query.path.lastSegment();\n    }\n    /**\n     * A string representing the path of the referenced collection (relative\n     * to the root of the database).\n     */    get path() {\n        return this._query.path.canonicalString();\n    }\n    /**\n     * A reference to the containing `DocumentReference` if this is a\n     * subcollection. If this isn't a subcollection, the reference is null.\n     */    get parent() {\n        const t = this._path.popLast();\n        return t.isEmpty() ? null : new Dn(this.firestore, \n        /* converter= */ null, new rt(t));\n    }\n    withConverter(t) {\n        return new xn(this.firestore, t, this._path);\n    }\n}\n\nfunction Sn(t, e, ...n) {\n    if (t = l(t), st(\"collection\", \"path\", e), t instanceof Tn) {\n        const r = tt.fromString(e, ...n);\n        return ot(r), new xn(t, /* converter= */ null, r);\n    }\n    {\n        if (!(t instanceof Dn || t instanceof xn)) throw new U(P, \"Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore\");\n        const r = t._path.child(tt.fromString(e, ...n));\n        return ot(r), new xn(t.firestore, \n        /* converter= */ null, r);\n    }\n}\n\n// TODO(firestorelite): Consider using ErrorFactory -\n// https://github.com/firebase/firebase-js-sdk/blob/0131e1f/packages/util/src/errors.ts#L106\n/**\n * Creates and returns a new `Query` instance that includes all documents in the\n * database that are contained in a collection or subcollection with the\n * given `collectionId`.\n *\n * @param firestore - A reference to the root `Firestore` instance.\n * @param collectionId - Identifies the collections to query over. Every\n * collection or subcollection with this ID as the last segment of its path\n * will be included. Cannot contain a slash.\n * @returns The created `Query`.\n */ function qn(t, e) {\n    if (t = ct(t, Tn), st(\"collectionGroup\", \"collection id\", e), e.indexOf(\"/\") >= 0) throw new U(P, `Invalid collection ID '${e}' passed to function collectionGroup(). Collection IDs must not contain '/'.`);\n    return new Fn(t, \n    /* converter= */ null, function(t) {\n        return new Ee(tt.emptyPath(), t);\n    }(e));\n}\n\nfunction On(t, e, ...n) {\n    if (t = l(t), \n    // We allow omission of 'pathString' but explicitly prohibit passing in both\n    // 'undefined' and 'null'.\n    1 === arguments.length && (e = Et.N()), st(\"doc\", \"path\", e), t instanceof Tn) {\n        const r = tt.fromString(e, ...n);\n        return it(r), new Dn(t, \n        /* converter= */ null, new rt(r));\n    }\n    {\n        if (!(t instanceof Dn || t instanceof xn)) throw new U(P, \"Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore\");\n        const r = t._path.child(tt.fromString(e, ...n));\n        return it(r), new Dn(t.firestore, t instanceof xn ? t.converter : null, new rt(r));\n    }\n}\n\n/**\n * Returns true if the provided references are equal.\n *\n * @param left - A reference to compare.\n * @param right - A reference to compare.\n * @returns true if the references point to the same location in the same\n * Firestore database.\n */ function kn(t, e) {\n    return t = l(t), e = l(e), (t instanceof Dn || t instanceof xn) && (e instanceof Dn || e instanceof xn) && (t.firestore === e.firestore && t.path === e.path && t.converter === e.converter);\n}\n\n/**\n * Returns true if the provided queries point to the same collection and apply\n * the same constraints.\n *\n * @param left - A `Query` to compare.\n * @param right - A `Query` to compare.\n * @returns true if the references point to the same location in the same\n * Firestore database.\n */ function Cn(t, e) {\n    return t = l(t), e = l(e), t instanceof Fn && e instanceof Fn && (t.firestore === e.firestore && $e(t._query, e._query) && t.converter === e.converter);\n}\n\n/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * An immutable object representing an array of bytes.\n */ class Mn {\n    /** @hideconstructor */\n    constructor(t) {\n        this._byteString = t;\n    }\n    /**\n     * Creates a new `Bytes` object from the given Base64 string, converting it to\n     * bytes.\n     *\n     * @param base64 - The Base64 string used to create the `Bytes` object.\n     */    static fromBase64String(t) {\n        try {\n            return new Mn(Vt.fromBase64String(t));\n        } catch (t) {\n            throw new U(P, \"Failed to construct data from Base64 string: \" + t);\n        }\n    }\n    /**\n     * Creates a new `Bytes` object from the given Uint8Array.\n     *\n     * @param array - The Uint8Array used to create the `Bytes` object.\n     */    static fromUint8Array(t) {\n        return new Mn(Vt.fromUint8Array(t));\n    }\n    /**\n     * Returns the underlying bytes as a Base64-encoded string.\n     *\n     * @returns The Base64-encoded string created from the `Bytes` object.\n     */    toBase64() {\n        return this._byteString.toBase64();\n    }\n    /**\n     * Returns the underlying bytes in a new `Uint8Array`.\n     *\n     * @returns The Uint8Array created from the `Bytes` object.\n     */    toUint8Array() {\n        return this._byteString.toUint8Array();\n    }\n    /**\n     * Returns a string representation of the `Bytes` object.\n     *\n     * @returns A string representation of the `Bytes` object.\n     */    toString() {\n        return \"Bytes(base64: \" + this.toBase64() + \")\";\n    }\n    /**\n     * Returns true if this `Bytes` object is equal to the provided one.\n     *\n     * @param other - The `Bytes` object to compare against.\n     * @returns true if this `Bytes` object is equal to the provided one.\n     */    isEqual(t) {\n        return this._byteString.isEqual(t._byteString);\n    }\n}\n\n/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * A `FieldPath` refers to a field in a document. The path may consist of a\n * single field name (referring to a top-level field in the document), or a\n * list of field names (referring to a nested field in the document).\n *\n * Create a `FieldPath` by providing field names. If more than one field\n * name is provided, the path will point to a nested field in a document.\n */ class Ln {\n    /**\n     * Creates a `FieldPath` from the provided field names. If more than one field\n     * name is provided, the path will point to a nested field in a document.\n     *\n     * @param fieldNames - A list of field names.\n     */\n    constructor(...t) {\n        for (let e = 0; e < t.length; ++e) if (0 === t[e].length) throw new U(P, \"Invalid field name at argument $(i + 1). Field names must not be empty.\");\n        this._internalPath = new nt(t);\n    }\n    /**\n     * Returns true if this `FieldPath` is equal to the provided one.\n     *\n     * @param other - The `FieldPath` to compare against.\n     * @returns true if this `FieldPath` is equal to the provided one.\n     */    isEqual(t) {\n        return this._internalPath.isEqual(t._internalPath);\n    }\n}\n\n/**\n * Returns a special sentinel `FieldPath` to refer to the ID of a document.\n * It can be used in queries to sort or filter by the document ID.\n */ function Un() {\n    return new Ln(\"__name__\");\n}\n\n/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * Sentinel values that can be used when writing document fields with `set()`\n * or `update()`.\n */ class jn {\n    /**\n     * @param _methodName - The public API endpoint that returns this class.\n     * @hideconstructor\n     */\n    constructor(t) {\n        this._methodName = t;\n    }\n}\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * An immutable object representing a geographic location in Firestore. The\n * location is represented as latitude/longitude pair.\n *\n * Latitude values are in the range of [-90, 90].\n * Longitude values are in the range of [-180, 180].\n */ class Bn {\n    /**\n     * Creates a new immutable `GeoPoint` object with the provided latitude and\n     * longitude values.\n     * @param latitude - The latitude as number between -90 and 90.\n     * @param longitude - The longitude as number between -180 and 180.\n     */\n    constructor(t, e) {\n        if (!isFinite(t) || t < -90 || t > 90) throw new U(P, \"Latitude must be a number between -90 and 90, but was: \" + t);\n        if (!isFinite(e) || e < -180 || e > 180) throw new U(P, \"Longitude must be a number between -180 and 180, but was: \" + e);\n        this._lat = t, this._long = e;\n    }\n    /**\n     * The latitude of this `GeoPoint` instance.\n     */    get latitude() {\n        return this._lat;\n    }\n    /**\n     * The longitude of this `GeoPoint` instance.\n     */    get longitude() {\n        return this._long;\n    }\n    /**\n     * Returns true if this `GeoPoint` is equal to the provided one.\n     *\n     * @param other - The `GeoPoint` to compare against.\n     * @returns true if this `GeoPoint` is equal to the provided one.\n     */    isEqual(t) {\n        return this._lat === t._lat && this._long === t._long;\n    }\n    /** Returns a JSON-serializable representation of this GeoPoint. */    toJSON() {\n        return {\n            latitude: this._lat,\n            longitude: this._long\n        };\n    }\n    /**\n     * Actually private to JS consumers of our API, so this function is prefixed\n     * with an underscore.\n     */    _compareTo(t) {\n        return It(this._lat, t._lat) || It(this._long, t._long);\n    }\n}\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */ const Qn = /^__.*__$/;\n\n/** The result of parsing document data (e.g. for a setData call). */ class zn {\n    constructor(t, e, n) {\n        this.data = t, this.fieldMask = e, this.fieldTransforms = n;\n    }\n    toMutation(t, e) {\n        return null !== this.fieldMask ? new Le(t, this.data, this.fieldMask, e, this.fieldTransforms) : new Me(t, this.data, e, this.fieldTransforms);\n    }\n}\n\n/** The result of parsing \"update\" data (i.e. for an updateData call). */ class Wn {\n    constructor(t, \n    // The fieldMask does not include document transforms.\n    e, n) {\n        this.data = t, this.fieldMask = e, this.fieldTransforms = n;\n    }\n    toMutation(t, e) {\n        return new Le(t, this.data, this.fieldMask, e, this.fieldTransforms);\n    }\n}\n\nfunction Gn(t) {\n    switch (t) {\n      case 0 /* UserDataSource.Set */ :\n // fall through\n              case 2 /* UserDataSource.MergeSet */ :\n // fall through\n              case 1 /* UserDataSource.Update */ :\n        return !0;\n\n      case 3 /* UserDataSource.Argument */ :\n      case 4 /* UserDataSource.ArrayArgument */ :\n        return !1;\n\n      default:\n        throw b();\n    }\n}\n\n/** A \"context\" object passed around while parsing user data. */ class Kn {\n    /**\n     * Initializes a ParseContext with the given source and path.\n     *\n     * @param settings - The settings for the parser.\n     * @param databaseId - The database ID of the Firestore instance.\n     * @param serializer - The serializer to use to generate the Value proto.\n     * @param ignoreUndefinedProperties - Whether to ignore undefined properties\n     * rather than throw.\n     * @param fieldTransforms - A mutable list of field transforms encountered\n     * while parsing the data.\n     * @param fieldMask - A mutable list of field paths encountered while parsing\n     * the data.\n     *\n     * TODO(b/34871131): We don't support array paths right now, so path can be\n     * null to indicate the context represents any location within an array (in\n     * which case certain features will not work and errors will be somewhat\n     * compromised).\n     */\n    constructor(t, e, n, r, s, i) {\n        this.settings = t, this.databaseId = e, this.serializer = n, this.ignoreUndefinedProperties = r, \n        // Minor hack: If fieldTransforms is undefined, we assume this is an\n        // external call and we need to validate the entire path.\n        void 0 === s && this.tt(), this.fieldTransforms = s || [], this.fieldMask = i || [];\n    }\n    get path() {\n        return this.settings.path;\n    }\n    get et() {\n        return this.settings.et;\n    }\n    /** Returns a new context with the specified settings overwritten. */    nt(t) {\n        return new Kn(Object.assign(Object.assign({}, this.settings), t), this.databaseId, this.serializer, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);\n    }\n    rt(t) {\n        var e;\n        const n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), r = this.nt({\n            path: n,\n            st: !1\n        });\n        return r.it(t), r;\n    }\n    ot(t) {\n        var e;\n        const n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), r = this.nt({\n            path: n,\n            st: !1\n        });\n        return r.tt(), r;\n    }\n    ut(t) {\n        // TODO(b/34871131): We don't support array paths right now; so make path\n        // undefined.\n        return this.nt({\n            path: void 0,\n            st: !0\n        });\n    }\n    ct(t) {\n        return wr(t, this.settings.methodName, this.settings.ht || !1, this.path, this.settings.lt);\n    }\n    /** Returns 'true' if 'fieldPath' was traversed when creating this context. */    contains(t) {\n        return void 0 !== this.fieldMask.find((e => t.isPrefixOf(e))) || void 0 !== this.fieldTransforms.find((e => t.isPrefixOf(e.field)));\n    }\n    tt() {\n        // TODO(b/34871131): Remove null check once we have proper paths for fields\n        // within arrays.\n        if (this.path) for (let t = 0; t < this.path.length; t++) this.it(this.path.get(t));\n    }\n    it(t) {\n        if (0 === t.length) throw this.ct(\"Document fields must not be empty\");\n        if (Gn(this.et) && Qn.test(t)) throw this.ct('Document fields cannot begin and end with \"__\"');\n    }\n}\n\n/**\n * Helper for parsing raw user input (provided via the API) into internal model\n * classes.\n */ class Yn {\n    constructor(t, e, n) {\n        this.databaseId = t, this.ignoreUndefinedProperties = e, this.serializer = n || wn(t);\n    }\n    /** Creates a new top-level parse context. */    ft(t, e, n, r = !1) {\n        return new Kn({\n            et: t,\n            methodName: e,\n            lt: n,\n            path: nt.emptyPath(),\n            st: !1,\n            ht: r\n        }, this.databaseId, this.serializer, this.ignoreUndefinedProperties);\n    }\n}\n\nfunction Hn(t) {\n    const e = t._freezeSettings(), n = wn(t._databaseId);\n    return new Yn(t._databaseId, !!e.ignoreUndefinedProperties, n);\n}\n\n/** Parse document data from a set() call. */ function Jn(t, e, n, r, s, i = {}) {\n    const o = t.ft(i.merge || i.mergeFields ? 2 /* UserDataSource.MergeSet */ : 0 /* UserDataSource.Set */ , e, n, s);\n    hr(\"Data must be an object, but it was:\", o, r);\n    const u = cr(r, o);\n    let c, a;\n    if (i.merge) c = new ye(o.fieldMask), a = o.fieldTransforms; else if (i.mergeFields) {\n        const t = [];\n        for (const r of i.mergeFields) {\n            const s = lr(e, r, n);\n            if (!o.contains(s)) throw new U(P, `Field '${s}' is specified in your field mask but missing from your input data.`);\n            mr(t, s) || t.push(s);\n        }\n        c = new ye(t), a = o.fieldTransforms.filter((t => c.covers(t.field)));\n    } else c = null, a = o.fieldTransforms;\n    return new zn(new ge(u), c, a);\n}\n\nclass Xn extends jn {\n    _toFieldTransform(t) {\n        if (2 /* UserDataSource.MergeSet */ !== t.et) throw 1 /* UserDataSource.Update */ === t.et ? t.ct(`${this._methodName}() can only appear at the top level of your update data`) : t.ct(`${this._methodName}() cannot be used with set() unless you pass {merge:true}`);\n        // No transform to add for a delete, but we need to add it to our\n        // fieldMask so it gets deleted.\n        return t.fieldMask.push(t.path), null;\n    }\n    isEqual(t) {\n        return t instanceof Xn;\n    }\n}\n\n/**\n * Creates a child context for parsing SerializableFieldValues.\n *\n * This is different than calling `ParseContext.contextWith` because it keeps\n * the fieldTransforms and fieldMask separate.\n *\n * The created context has its `dataSource` set to `UserDataSource.Argument`.\n * Although these values are used with writes, any elements in these FieldValues\n * are not considered writes since they cannot contain any FieldValue sentinels,\n * etc.\n *\n * @param fieldValue - The sentinel FieldValue for which to create a child\n *     context.\n * @param context - The parent context.\n * @param arrayElement - Whether or not the FieldValue has an array.\n */ function Zn(t, e, n) {\n    return new Kn({\n        et: 3 /* UserDataSource.Argument */ ,\n        lt: e.settings.lt,\n        methodName: t._methodName,\n        st: n\n    }, e.databaseId, e.serializer, e.ignoreUndefinedProperties);\n}\n\nclass tr extends jn {\n    _toFieldTransform(t) {\n        return new Oe(t.path, new Fe);\n    }\n    isEqual(t) {\n        return t instanceof tr;\n    }\n}\n\nclass er extends jn {\n    constructor(t, e) {\n        super(t), this.dt = e;\n    }\n    _toFieldTransform(t) {\n        const e = Zn(this, t, \n        /*array=*/ !0), n = this.dt.map((t => ur(t, e))), r = new xe(n);\n        return new Oe(t.path, r);\n    }\n    isEqual(t) {\n        // TODO(mrschmidt): Implement isEquals\n        return this === t;\n    }\n}\n\nclass nr extends jn {\n    constructor(t, e) {\n        super(t), this.dt = e;\n    }\n    _toFieldTransform(t) {\n        const e = Zn(this, t, \n        /*array=*/ !0), n = this.dt.map((t => ur(t, e))), r = new Se(n);\n        return new Oe(t.path, r);\n    }\n    isEqual(t) {\n        // TODO(mrschmidt): Implement isEquals\n        return this === t;\n    }\n}\n\nclass rr extends jn {\n    constructor(t, e) {\n        super(t), this.wt = e;\n    }\n    _toFieldTransform(t) {\n        const e = new qe(t.serializer, Ne(t.serializer, this.wt));\n        return new Oe(t.path, e);\n    }\n    isEqual(t) {\n        // TODO(mrschmidt): Implement isEquals\n        return this === t;\n    }\n}\n\n/** Parse update data from an update() call. */ function sr(t, e, n, r) {\n    const s = t.ft(1 /* UserDataSource.Update */ , e, n);\n    hr(\"Data must be an object, but it was:\", s, r);\n    const i = [], o = ge.empty();\n    Rt(r, ((t, r) => {\n        const u = dr(e, t, n);\n        // For Compat types, we have to \"extract\" the underlying types before\n        // performing validation.\n                r = l(r);\n        const c = s.ot(u);\n        if (r instanceof Xn) \n        // Add it to the field mask, but don't add anything to updateData.\n        i.push(u); else {\n            const t = ur(r, c);\n            null != t && (i.push(u), o.set(u, t));\n        }\n    }));\n    const u = new ye(i);\n    return new Wn(o, u, s.fieldTransforms);\n}\n\n/** Parse update data from a list of field/value arguments. */ function ir(t, e, n, r, s, i) {\n    const o = t.ft(1 /* UserDataSource.Update */ , e, n), u = [ lr(e, r, n) ], c = [ s ];\n    if (i.length % 2 != 0) throw new U(P, `Function ${e}() needs to be called with an even number of arguments that alternate between field names and values.`);\n    for (let t = 0; t < i.length; t += 2) u.push(lr(e, i[t])), c.push(i[t + 1]);\n    const a = [], h = ge.empty();\n    // We iterate in reverse order to pick the last value for a field if the\n    // user specified the field multiple times.\n    for (let t = u.length - 1; t >= 0; --t) if (!mr(a, u[t])) {\n        const e = u[t];\n        let n = c[t];\n        // For Compat types, we have to \"extract\" the underlying types before\n        // performing validation.\n                n = l(n);\n        const r = o.ot(e);\n        if (n instanceof Xn) \n        // Add it to the field mask, but don't add anything to updateData.\n        a.push(e); else {\n            const t = ur(n, r);\n            null != t && (a.push(e), h.set(e, t));\n        }\n    }\n    const f = new ye(a);\n    return new Wn(h, f, o.fieldTransforms);\n}\n\n/**\n * Parse a \"query value\" (e.g. value in a where filter or a value in a cursor\n * bound).\n *\n * @param allowArrays - Whether the query value is an array that may directly\n * contain additional arrays (e.g. the operand of an `in` query).\n */ function or(t, e, n, r = !1) {\n    return ur(n, t.ft(r ? 4 /* UserDataSource.ArrayArgument */ : 3 /* UserDataSource.Argument */ , e));\n}\n\n/**\n * Parses user data to Protobuf Values.\n *\n * @param input - Data to be parsed.\n * @param context - A context object representing the current path being parsed,\n * the source of the data being parsed, etc.\n * @returns The parsed value, or null if the value was a FieldValue sentinel\n * that should not be included in the resulting parsed data.\n */ function ur(t, e) {\n    if (ar(\n    // Unwrap the API type from the Compat SDK. This will return the API type\n    // from firestore-exp.\n    t = l(t))) return hr(\"Unsupported field value:\", e, t), cr(t, e);\n    if (t instanceof jn) \n    // FieldValues usually parse into transforms (except deleteField())\n    // in which case we do not want to include this field in our parsed data\n    // (as doing so will overwrite the field directly prior to the transform\n    // trying to transform it). So we don't add this location to\n    // context.fieldMask and we return null as our parsing result.\n    /**\n * \"Parses\" the provided FieldValueImpl, adding any necessary transforms to\n * context.fieldTransforms.\n */\n    return function(t, e) {\n        // Sentinels are only supported with writes, and not within arrays.\n        if (!Gn(e.et)) throw e.ct(`${t._methodName}() can only be used with update() and set()`);\n        if (!e.path) throw e.ct(`${t._methodName}() is not currently supported inside arrays`);\n        const n = t._toFieldTransform(e);\n        n && e.fieldTransforms.push(n);\n    }\n    /**\n * Helper to parse a scalar value (i.e. not an Object, Array, or FieldValue)\n *\n * @returns The parsed value\n */ (t, e), null;\n    if (void 0 === t && e.ignoreUndefinedProperties) \n    // If the input is undefined it can never participate in the fieldMask, so\n    // don't handle this below. If `ignoreUndefinedProperties` is false,\n    // `parseScalarValue` will reject an undefined value.\n    return null;\n    if (\n    // If context.path is null we are inside an array and we don't support\n    // field mask paths more granular than the top-level array.\n    e.path && e.fieldMask.push(e.path), t instanceof Array) {\n        // TODO(b/34871131): Include the path containing the array in the error\n        // message.\n        // In the case of IN queries, the parsed data is an array (representing\n        // the set of values to be included for the IN query) that may directly\n        // contain additional arrays (each representing an individual field\n        // value), so we disable this validation.\n        if (e.settings.st && 4 /* UserDataSource.ArrayArgument */ !== e.et) throw e.ct(\"Nested arrays are not supported\");\n        return function(t, e) {\n            const n = [];\n            let r = 0;\n            for (const s of t) {\n                let t = ur(s, e.ut(r));\n                null == t && (\n                // Just include nulls in the array for fields being replaced with a\n                // sentinel.\n                t = {\n                    nullValue: \"NULL_VALUE\"\n                }), n.push(t), r++;\n            }\n            return {\n                arrayValue: {\n                    values: n\n                }\n            };\n        }(t, e);\n    }\n    return function(t, e) {\n        if (null === (t = l(t))) return {\n            nullValue: \"NULL_VALUE\"\n        };\n        if (\"number\" == typeof t) return Ne(e.serializer, t);\n        if (\"boolean\" == typeof t) return {\n            booleanValue: t\n        };\n        if (\"string\" == typeof t) return {\n            stringValue: t\n        };\n        if (t instanceof Date) {\n            const n = xt.fromDate(t);\n            return {\n                timestampValue: Ge(e.serializer, n)\n            };\n        }\n        if (t instanceof xt) {\n            // Firestore backend truncates precision down to microseconds. To ensure\n            // offline mode works the same with regards to truncation, perform the\n            // truncation immediately without waiting for the backend to do that.\n            const n = new xt(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));\n            return {\n                timestampValue: Ge(e.serializer, n)\n            };\n        }\n        if (t instanceof Bn) return {\n            geoPointValue: {\n                latitude: t.latitude,\n                longitude: t.longitude\n            }\n        };\n        if (t instanceof Mn) return {\n            bytesValue: Ke(e.serializer, t._byteString)\n        };\n        if (t instanceof Dn) {\n            const n = e.databaseId, r = t.firestore._databaseId;\n            if (!r.isEqual(n)) throw e.ct(`Document reference is for database ${r.projectId}/${r.database} but should be for database ${n.projectId}/${n.database}`);\n            return {\n                referenceValue: Je(t.firestore._databaseId || e.databaseId, t._key.path)\n            };\n        }\n        throw e.ct(`Unsupported field value: ${ut(t)}`);\n    }\n    /**\n * Checks whether an object looks like a JSON object that should be converted\n * into a struct. Normal class/prototype instances are considered to look like\n * JSON objects since they should be converted to a struct value. Arrays, Dates,\n * GeoPoints, etc. are not considered to look like JSON objects since they map\n * to specific FieldValue types other than ObjectValue.\n */ (t, e);\n}\n\nfunction cr(t, e) {\n    const n = {};\n    return !function(t) {\n        for (const e in t) if (Object.prototype.hasOwnProperty.call(t, e)) return !1;\n        return !0;\n    }(t) ? Rt(t, ((t, r) => {\n        const s = ur(r, e.rt(t));\n        null != s && (n[t] = s);\n    })) : \n    // If we encounter an empty object, we explicitly add it to the update\n    // mask to ensure that the server creates a map entry.\n    e.path && e.path.length > 0 && e.fieldMask.push(e.path), {\n        mapValue: {\n            fields: n\n        }\n    };\n}\n\nfunction ar(t) {\n    return !(\"object\" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof xt || t instanceof Bn || t instanceof Mn || t instanceof Dn || t instanceof jn);\n}\n\nfunction hr(t, e, n) {\n    if (!ar(n) || !function(t) {\n        return \"object\" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));\n    }(n)) {\n        const r = ut(n);\n        throw \"an object\" === r ? e.ct(t + \" a custom object\") : e.ct(t + \" \" + r);\n    }\n}\n\n/**\n * Helper that calls fromDotSeparatedString() but wraps any error thrown.\n */ function lr(t, e, n) {\n    if ((\n    // If required, replace the FieldPath Compat class with with the firestore-exp\n    // FieldPath.\n    e = l(e)) instanceof Ln) return e._internalPath;\n    if (\"string\" == typeof e) return dr(t, e);\n    throw wr(\"Field path arguments must be of type string or \", t, \n    /* hasConverter= */ !1, \n    /* path= */ void 0, n);\n}\n\n/**\n * Matches any characters in a field path string that are reserved.\n */ const fr = new RegExp(\"[~\\\\*/\\\\[\\\\]]\");\n\n/**\n * Wraps fromDotSeparatedString with an error message about the method that\n * was thrown.\n * @param methodName - The publicly visible method name\n * @param path - The dot-separated string form of a field path which will be\n * split on dots.\n * @param targetDoc - The document against which the field path will be\n * evaluated.\n */ function dr(t, e, n) {\n    if (e.search(fr) >= 0) throw wr(`Invalid field path (${e}). Paths must not contain '~', '*', '/', '[', or ']'`, t, \n    /* hasConverter= */ !1, \n    /* path= */ void 0, n);\n    try {\n        return new Ln(...e.split(\".\"))._internalPath;\n    } catch (r) {\n        throw wr(`Invalid field path (${e}). Paths must not be empty, begin with '.', end with '.', or contain '..'`, t, \n        /* hasConverter= */ !1, \n        /* path= */ void 0, n);\n    }\n}\n\nfunction wr(t, e, n, r, s) {\n    const i = r && !r.isEmpty(), o = void 0 !== s;\n    let u = `Function ${e}() called with invalid data`;\n    n && (u += \" (via `toFirestore()`)\"), u += \". \";\n    let c = \"\";\n    return (i || o) && (c += \" (found\", i && (c += ` in field ${r}`), o && (c += ` in document ${s}`), \n    c += \")\"), new U(P, u + t + c);\n}\n\n/** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */ function mr(t, e) {\n    return t.some((t => t.isEqual(e)));\n}\n\n/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * A `DocumentSnapshot` contains data read from a document in your Firestore\n * database. The data can be extracted with `.data()` or `.get(<field>)` to\n * get a specific field.\n *\n * For a `DocumentSnapshot` that points to a non-existing document, any data\n * access will return 'undefined'. You can use the `exists()` method to\n * explicitly verify a document's existence.\n */ class pr {\n    // Note: This class is stripped down version of the DocumentSnapshot in\n    // the legacy SDK. The changes are:\n    // - No support for SnapshotMetadata.\n    // - No support for SnapshotOptions.\n    /** @hideconstructor protected */\n    constructor(t, e, n, r, s) {\n        this._firestore = t, this._userDataWriter = e, this._key = n, this._document = r, \n        this._converter = s;\n    }\n    /** Property of the `DocumentSnapshot` that provides the document's ID. */    get id() {\n        return this._key.path.lastSegment();\n    }\n    /**\n     * The `DocumentReference` for the document included in the `DocumentSnapshot`.\n     */    get ref() {\n        return new Dn(this._firestore, this._converter, this._key);\n    }\n    /**\n     * Signals whether or not the document at the snapshot's location exists.\n     *\n     * @returns true if the document exists.\n     */    exists() {\n        return null !== this._document;\n    }\n    /**\n     * Retrieves all fields in the document as an `Object`. Returns `undefined` if\n     * the document doesn't exist.\n     *\n     * @returns An `Object` containing all fields in the document or `undefined`\n     * if the document doesn't exist.\n     */    data() {\n        if (this._document) {\n            if (this._converter) {\n                // We only want to use the converter and create a new DocumentSnapshot\n                // if a converter has been provided.\n                const t = new yr(this._firestore, this._userDataWriter, this._key, this._document, \n                /* converter= */ null);\n                return this._converter.fromFirestore(t);\n            }\n            return this._userDataWriter.convertValue(this._document.data.value);\n        }\n    }\n    /**\n     * Retrieves the field specified by `fieldPath`. Returns `undefined` if the\n     * document or field doesn't exist.\n     *\n     * @param fieldPath - The path (for example 'foo' or 'foo.bar') to a specific\n     * field.\n     * @returns The data at the specified field location or undefined if no such\n     * field exists in the document.\n     */\n    // We are using `any` here to avoid an explicit cast by our users.\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    get(t) {\n        if (this._document) {\n            const e = this._document.data.field(vr(\"DocumentSnapshot.get\", t));\n            if (null !== e) return this._userDataWriter.convertValue(e);\n        }\n    }\n}\n\n/**\n * A `QueryDocumentSnapshot` contains data read from a document in your\n * Firestore database as part of a query. The document is guaranteed to exist\n * and its data can be extracted with `.data()` or `.get(<field>)` to get a\n * specific field.\n *\n * A `QueryDocumentSnapshot` offers the same API surface as a\n * `DocumentSnapshot`. Since query results contain only existing documents, the\n * `exists` property will always be true and `data()` will never return\n * 'undefined'.\n */ class yr extends pr {\n    /**\n     * Retrieves all fields in the document as an `Object`.\n     *\n     * @override\n     * @returns An `Object` containing all fields in the document.\n     */\n    data() {\n        return super.data();\n    }\n}\n\n/**\n * A `QuerySnapshot` contains zero or more `DocumentSnapshot` objects\n * representing the results of a query. The documents can be accessed as an\n * array via the `docs` property or enumerated using the `forEach` method. The\n * number of documents can be determined via the `empty` and `size`\n * properties.\n */ class gr {\n    /** @hideconstructor */\n    constructor(t, e) {\n        this._docs = e, this.query = t;\n    }\n    /** An array of all the documents in the `QuerySnapshot`. */    get docs() {\n        return [ ...this._docs ];\n    }\n    /** The number of documents in the `QuerySnapshot`. */    get size() {\n        return this.docs.length;\n    }\n    /** True if there are no documents in the `QuerySnapshot`. */    get empty() {\n        return 0 === this.docs.length;\n    }\n    /**\n     * Enumerates all of the documents in the `QuerySnapshot`.\n     *\n     * @param callback - A callback to be called with a `QueryDocumentSnapshot` for\n     * each document in the snapshot.\n     * @param thisArg - The `this` binding for the callback.\n     */    forEach(t, e) {\n        this._docs.forEach(t, e);\n    }\n}\n\n/**\n * Returns true if the provided snapshots are equal.\n *\n * @param left - A snapshot to compare.\n * @param right - A snapshot to compare.\n * @returns true if the snapshots are equal.\n */ function _r(t, e) {\n    return t = l(t), e = l(e), t instanceof pr && e instanceof pr ? t._firestore === e._firestore && t._key.isEqual(e._key) && (null === t._document ? null === e._document : t._document.isEqual(e._document)) && t._converter === e._converter : t instanceof gr && e instanceof gr && (Cn(t.query, e.query) && Tt(t.docs, e.docs, _r));\n}\n\n/**\n * Helper that calls `fromDotSeparatedString()` but wraps any error thrown.\n */ function vr(t, e) {\n    return \"string\" == typeof e ? dr(t, e) : e instanceof Ln ? e._internalPath : e._delegate._internalPath;\n}\n\n/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * An `AppliableConstraint` is an abstraction of a constraint that can be applied\n * to a Firestore query.\n */\nclass br {}\n\n/**\n * A `QueryConstraint` is used to narrow the set of documents returned by a\n * Firestore query. `QueryConstraint`s are created by invoking {@link where},\n * {@link orderBy}, {@link (startAt:1)}, {@link (startAfter:1)}, {@link\n * (endBefore:1)}, {@link (endAt:1)}, {@link limit}, {@link limitToLast} and\n * can then be passed to {@link (query:1)} to create a new query instance that\n * also contains this `QueryConstraint`.\n */ class Er extends br {}\n\nfunction Ir(t, e, ...n) {\n    let r = [];\n    e instanceof br && r.push(e), r = r.concat(n), function(t) {\n        const e = t.filter((t => t instanceof Rr)).length, n = t.filter((t => t instanceof Tr)).length;\n        if (e > 1 || e > 0 && n > 0) throw new U(P, \"InvalidQuery. When using composite filters, you cannot use more than one filter at the top level. Consider nesting the multiple filters within an `and(...)` statement. For example: change `query(query, where(...), or(...))` to `query(query, and(where(...), or(...)))`.\");\n    }\n    /**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n    /**\n * Converts Firestore's internal types to the JavaScript types that we expose\n * to the user.\n *\n * @internal\n */ (r);\n    for (const e of r) t = e._apply(t);\n    return t;\n}\n\n/**\n * A `QueryFieldFilterConstraint` is used to narrow the set of documents returned by\n * a Firestore query by filtering on one or more document fields.\n * `QueryFieldFilterConstraint`s are created by invoking {@link where} and can then\n * be passed to {@link (query:1)} to create a new query instance that also contains\n * this `QueryFieldFilterConstraint`.\n */ class Tr extends Er {\n    /**\n     * @internal\n     */\n    constructor(t, e, n) {\n        super(), this._field = t, this._op = e, this._value = n, \n        /** The type of this query constraint */\n        this.type = \"where\";\n    }\n    static _create(t, e, n) {\n        return new Tr(t, e, n);\n    }\n    _apply(t) {\n        const e = this._parse(t);\n        return Br(t._query, e), new Fn(t.firestore, t.converter, Ve(t._query, e));\n    }\n    _parse(t) {\n        const e = Hn(t.firestore), n = function(t, e, n, r, s, i, o) {\n            let u;\n            if (s.isKeyField()) {\n                if (\"array-contains\" /* Operator.ARRAY_CONTAINS */ === i || \"array-contains-any\" /* Operator.ARRAY_CONTAINS_ANY */ === i) throw new U(P, `Invalid Query. You can't perform '${i}' queries on documentId().`);\n                if (\"in\" /* Operator.IN */ === i || \"not-in\" /* Operator.NOT_IN */ === i) {\n                    jr(o, i);\n                    const e = [];\n                    for (const n of o) e.push(Ur(r, t, n));\n                    u = {\n                        arrayValue: {\n                            values: e\n                        }\n                    };\n                } else u = Ur(r, t, o);\n            } else \"in\" /* Operator.IN */ !== i && \"not-in\" /* Operator.NOT_IN */ !== i && \"array-contains-any\" /* Operator.ARRAY_CONTAINS_ANY */ !== i || jr(o, i), \n            u = or(n, e, o, \n            /* allowArrays= */ \"in\" /* Operator.IN */ === i || \"not-in\" /* Operator.NOT_IN */ === i);\n            return Xt.create(s, i, u);\n        }(t._query, \"where\", e, t.firestore._databaseId, this._field, this._op, this._value);\n        return n;\n    }\n}\n\n/**\n * Creates a {@link QueryFieldFilterConstraint} that enforces that documents\n * must contain the specified field and that the value should satisfy the\n * relation constraint provided.\n *\n * @param fieldPath - The path to compare\n * @param opStr - The operation string (e.g \"&lt;\", \"&lt;=\", \"==\", \"&lt;\",\n *   \"&lt;=\", \"!=\").\n * @param value - The value for comparison\n * @returns The created {@link QueryFieldFilterConstraint}.\n */ function Ar(t, e, n) {\n    const r = e, s = vr(\"where\", t);\n    return Tr._create(s, r, n);\n}\n\n/**\n * A `QueryCompositeFilterConstraint` is used to narrow the set of documents\n * returned by a Firestore query by performing the logical OR or AND of multiple\n * {@link QueryFieldFilterConstraint}s or {@link QueryCompositeFilterConstraint}s.\n * `QueryCompositeFilterConstraint`s are created by invoking {@link or} or\n * {@link and} and can then be passed to {@link (query:1)} to create a new query\n * instance that also contains the `QueryCompositeFilterConstraint`.\n */ class Rr extends br {\n    /**\n     * @internal\n     */\n    constructor(\n    /** The type of this query constraint */\n    t, e) {\n        super(), this.type = t, this._queryConstraints = e;\n    }\n    static _create(t, e) {\n        return new Rr(t, e);\n    }\n    _parse(t) {\n        const e = this._queryConstraints.map((e => e._parse(t))).filter((t => t.getFilters().length > 0));\n        return 1 === e.length ? e[0] : Zt.create(e, this._getOperator());\n    }\n    _apply(t) {\n        const e = this._parse(t);\n        return 0 === e.getFilters().length ? t : (function(t, e) {\n            let n = t;\n            const r = e.getFlattenedFilters();\n            for (const t of r) Br(n, t), n = Ve(n, t);\n        }\n        // Checks if any of the provided filter operators are included in the given list of filters and\n        // returns the first one that is, or null if none are.\n        (t._query, e), new Fn(t.firestore, t.converter, Ve(t._query, e)));\n    }\n    _getQueryConstraints() {\n        return this._queryConstraints;\n    }\n    _getOperator() {\n        return \"and\" === this.type ? \"and\" /* CompositeOperator.AND */ : \"or\" /* CompositeOperator.OR */;\n    }\n}\n\n/**\n * Creates a new {@link QueryCompositeFilterConstraint} that is a disjunction of\n * the given filter constraints. A disjunction filter includes a document if it\n * satisfies any of the given filters.\n *\n * @param queryConstraints - Optional. The list of\n * {@link QueryFilterConstraint}s to perform a disjunction for. These must be\n * created with calls to {@link where}, {@link or}, or {@link and}.\n * @returns The newly created {@link QueryCompositeFilterConstraint}.\n */ function Pr(...t) {\n    // Only support QueryFilterConstraints\n    return t.forEach((t => zr(\"or\", t))), Rr._create(\"or\" /* CompositeOperator.OR */ , t);\n}\n\n/**\n * Creates a new {@link QueryCompositeFilterConstraint} that is a conjunction of\n * the given filter constraints. A conjunction filter includes a document if it\n * satisfies all of the given filters.\n *\n * @param queryConstraints - Optional. The list of\n * {@link QueryFilterConstraint}s to perform a conjunction for. These must be\n * created with calls to {@link where}, {@link or}, or {@link and}.\n * @returns The newly created {@link QueryCompositeFilterConstraint}.\n */ function Vr(...t) {\n    // Only support QueryFilterConstraints\n    return t.forEach((t => zr(\"and\", t))), Rr._create(\"and\" /* CompositeOperator.AND */ , t);\n}\n\n/**\n * A `QueryOrderByConstraint` is used to sort the set of documents returned by a\n * Firestore query. `QueryOrderByConstraint`s are created by invoking\n * {@link orderBy} and can then be passed to {@link (query:1)} to create a new query\n * instance that also contains this `QueryOrderByConstraint`.\n *\n * Note: Documents that do not contain the orderBy field will not be present in\n * the query result.\n */ class $r extends Er {\n    /**\n     * @internal\n     */\n    constructor(t, e) {\n        super(), this._field = t, this._direction = e, \n        /** The type of this query constraint */\n        this.type = \"orderBy\";\n    }\n    static _create(t, e) {\n        return new $r(t, e);\n    }\n    _apply(t) {\n        const e = function(t, e, n) {\n            if (null !== t.startAt) throw new U(P, \"Invalid query. You must not call startAt() or startAfter() before calling orderBy().\");\n            if (null !== t.endAt) throw new U(P, \"Invalid query. You must not call endAt() or endBefore() before calling orderBy().\");\n            const r = new ae(e, n);\n            return function(t, e) {\n                if (null === Ie(t)) {\n                    // This is the first order by. It must match any inequality.\n                    const n = Te(t);\n                    null !== n && Qr(t, n, e.field);\n                }\n            }(t, r), r;\n        }\n        /**\n * Create a `Bound` from a query and a document.\n *\n * Note that the `Bound` will always include the key of the document\n * and so only the provided document will compare equal to the returned\n * position.\n *\n * Will throw if the document does not contain all fields of the order by\n * of the query or if any of the fields in the order by are an uncommitted\n * server timestamp.\n */ (t._query, this._field, this._direction);\n        return new Fn(t.firestore, t.converter, function(t, e) {\n            // TODO(dimond): validate that orderBy does not list the same key twice.\n            const n = t.explicitOrderBy.concat([ e ]);\n            return new Ee(t.path, t.collectionGroup, n, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);\n        }(t._query, e));\n    }\n}\n\n/**\n * Creates a {@link QueryOrderByConstraint} that sorts the query result by the\n * specified field, optionally in descending order instead of ascending.\n *\n * Note: Documents that do not contain the specified field will not be present\n * in the query result.\n *\n * @param fieldPath - The field to sort by.\n * @param directionStr - Optional direction to sort by ('asc' or 'desc'). If\n * not specified, order will be ascending.\n * @returns The created {@link QueryOrderByConstraint}.\n */ function Nr(t, e = \"asc\") {\n    const n = e, r = vr(\"orderBy\", t);\n    return $r._create(r, n);\n}\n\n/**\n * A `QueryLimitConstraint` is used to limit the number of documents returned by\n * a Firestore query.\n * `QueryLimitConstraint`s are created by invoking {@link limit} or\n * {@link limitToLast} and can then be passed to {@link (query:1)} to create a new\n * query instance that also contains this `QueryLimitConstraint`.\n */ class Dr extends Er {\n    /**\n     * @internal\n     */\n    constructor(\n    /** The type of this query constraint */\n    t, e, n) {\n        super(), this.type = t, this._limit = e, this._limitType = n;\n    }\n    static _create(t, e, n) {\n        return new Dr(t, e, n);\n    }\n    _apply(t) {\n        return new Fn(t.firestore, t.converter, function(t, e, n) {\n            return new Ee(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), e, n, t.startAt, t.endAt);\n        }(t._query, this._limit, this._limitType));\n    }\n}\n\n/**\n * Creates a {@link QueryLimitConstraint} that only returns the first matching\n * documents.\n *\n * @param limit - The maximum number of items to return.\n * @returns The created {@link QueryLimitConstraint}.\n */ function Fr(t) {\n    return at(\"limit\", t), Dr._create(\"limit\", t, \"F\" /* LimitType.First */);\n}\n\n/**\n * Creates a {@link QueryLimitConstraint} that only returns the last matching\n * documents.\n *\n * You must specify at least one `orderBy` clause for `limitToLast` queries,\n * otherwise an exception will be thrown during execution.\n *\n * @param limit - The maximum number of items to return.\n * @returns The created {@link QueryLimitConstraint}.\n */ function xr(t) {\n    return at(\"limitToLast\", t), Dr._create(\"limitToLast\", t, \"L\" /* LimitType.Last */);\n}\n\n/**\n * A `QueryStartAtConstraint` is used to exclude documents from the start of a\n * result set returned by a Firestore query.\n * `QueryStartAtConstraint`s are created by invoking {@link (startAt:1)} or\n * {@link (startAfter:1)} and can then be passed to {@link (query:1)} to create a\n * new query instance that also contains this `QueryStartAtConstraint`.\n */ class Sr extends Er {\n    /**\n     * @internal\n     */\n    constructor(\n    /** The type of this query constraint */\n    t, e, n) {\n        super(), this.type = t, this._docOrFields = e, this._inclusive = n;\n    }\n    static _create(t, e, n) {\n        return new Sr(t, e, n);\n    }\n    _apply(t) {\n        const e = Lr(t, this.type, this._docOrFields, this._inclusive);\n        return new Fn(t.firestore, t.converter, function(t, e) {\n            return new Ee(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);\n        }(t._query, e));\n    }\n}\n\nfunction qr(...t) {\n    return Sr._create(\"startAt\", t, \n    /*inclusive=*/ !0);\n}\n\nfunction Or(...t) {\n    return Sr._create(\"startAfter\", t, \n    /*inclusive=*/ !1);\n}\n\n/**\n * A `QueryEndAtConstraint` is used to exclude documents from the end of a\n * result set returned by a Firestore query.\n * `QueryEndAtConstraint`s are created by invoking {@link (endAt:1)} or\n * {@link (endBefore:1)} and can then be passed to {@link (query:1)} to create a new\n * query instance that also contains this `QueryEndAtConstraint`.\n */ class kr extends Er {\n    /**\n     * @internal\n     */\n    constructor(\n    /** The type of this query constraint */\n    t, e, n) {\n        super(), this.type = t, this._docOrFields = e, this._inclusive = n;\n    }\n    static _create(t, e, n) {\n        return new kr(t, e, n);\n    }\n    _apply(t) {\n        const e = Lr(t, this.type, this._docOrFields, this._inclusive);\n        return new Fn(t.firestore, t.converter, function(t, e) {\n            return new Ee(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);\n        }(t._query, e));\n    }\n}\n\nfunction Cr(...t) {\n    return kr._create(\"endBefore\", t, \n    /*inclusive=*/ !1);\n}\n\nfunction Mr(...t) {\n    return kr._create(\"endAt\", t, \n    /*inclusive=*/ !0);\n}\n\n/** Helper function to create a bound from a document or fields */ function Lr(t, e, n, r) {\n    if (n[0] = l(n[0]), n[0] instanceof pr) return function(t, e, n, r, s) {\n        if (!r) throw new U($, `Can't use a DocumentSnapshot that doesn't exist for ${n}().`);\n        const i = [];\n        // Because people expect to continue/end a query at the exact document\n        // provided, we need to use the implicit sort order rather than the explicit\n        // sort order, because it's guaranteed to contain the document key. That way\n        // the position becomes unambiguous and the query continues/ends exactly at\n        // the provided document. Without the key (by using the explicit sort\n        // orders), multiple documents could match the position, yielding duplicate\n        // results.\n                for (const n of Re(t)) if (n.field.isKeyField()) i.push(Bt(e, r.key)); else {\n            const t = r.data.field(n.field);\n            if (St(t)) throw new U(P, 'Invalid query. You are trying to start or end a query using a document for which the field \"' + n.field + '\" is an uncommitted server timestamp. (Since the value of this field is unknown, you cannot start/end a query with it.)');\n            if (null === t) {\n                const t = n.field.canonicalString();\n                throw new U(P, `Invalid query. You are trying to start or end a query using a document for which the field '${t}' (used as the orderBy) does not exist.`);\n            }\n            i.push(t);\n        }\n        return new Yt(i, s);\n    }\n    /**\n * Converts a list of field values to a `Bound` for the given query.\n */ (t._query, t.firestore._databaseId, e, n[0]._document, r);\n    {\n        const s = Hn(t.firestore);\n        return function(t, e, n, r, s, i) {\n            // Use explicit order by's because it has to match the query the user made\n            const o = t.explicitOrderBy;\n            if (s.length > o.length) throw new U(P, `Too many arguments provided to ${r}(). The number of arguments must be less than or equal to the number of orderBy() clauses`);\n            const u = [];\n            for (let i = 0; i < s.length; i++) {\n                const c = s[i];\n                if (o[i].field.isKeyField()) {\n                    if (\"string\" != typeof c) throw new U(P, `Invalid query. Expected a string for document ID in ${r}(), but got a ${typeof c}`);\n                    if (!Ae(t) && -1 !== c.indexOf(\"/\")) throw new U(P, `Invalid query. When querying a collection and ordering by documentId(), the value passed to ${r}() must be a plain document ID, but '${c}' contains a slash.`);\n                    const n = t.path.child(tt.fromString(c));\n                    if (!rt.isDocumentKey(n)) throw new U(P, `Invalid query. When querying a collection group and ordering by documentId(), the value passed to ${r}() must result in a valid document path, but '${n}' is not because it contains an odd number of segments.`);\n                    const s = new rt(n);\n                    u.push(Bt(e, s));\n                } else {\n                    const t = or(n, r, c);\n                    u.push(t);\n                }\n            }\n            return new Yt(u, i);\n        }\n        /**\n * Parses the given `documentIdValue` into a `ReferenceValue`, throwing\n * appropriate errors if the value is anything other than a `DocumentReference`\n * or `string`, or if the string is malformed.\n */ (t._query, t.firestore._databaseId, s, e, n, r);\n    }\n}\n\nfunction Ur(t, e, n) {\n    if (\"string\" == typeof (n = l(n))) {\n        if (\"\" === n) throw new U(P, \"Invalid query. When querying with documentId(), you must provide a valid document ID, but it was an empty string.\");\n        if (!Ae(e) && -1 !== n.indexOf(\"/\")) throw new U(P, `Invalid query. When querying a collection by documentId(), you must provide a plain document ID, but '${n}' contains a '/' character.`);\n        const r = e.path.child(tt.fromString(n));\n        if (!rt.isDocumentKey(r)) throw new U(P, `Invalid query. When querying a collection group by documentId(), the value provided must result in a valid document path, but '${r}' is not because it has an odd number of segments (${r.length}).`);\n        return Bt(t, new rt(r));\n    }\n    if (n instanceof Dn) return Bt(t, n._key);\n    throw new U(P, `Invalid query. When querying with documentId(), you must provide a valid string or a DocumentReference, but it was: ${ut(n)}.`);\n}\n\n/**\n * Validates that the value passed into a disjunctive filter satisfies all\n * array requirements.\n */ function jr(t, e) {\n    if (!Array.isArray(t) || 0 === t.length) throw new U(P, `Invalid Query. A non-empty array is required for '${e.toString()}' filters.`);\n}\n\n/**\n * Given an operator, returns the set of operators that cannot be used with it.\n *\n * This is not a comprehensive check, and this function should be removed in the\n * long term. Validations should occur in the Firestore backend.\n *\n * Operators in a query must adhere to the following set of rules:\n * 1. Only one inequality per query.\n * 2. `NOT_IN` cannot be used with array, disjunctive, or `NOT_EQUAL` operators.\n */ function Br(t, e) {\n    if (e.isInequality()) {\n        const n = Te(t), r = e.field;\n        if (null !== n && !n.isEqual(r)) throw new U(P, `Invalid query. All where filters with an inequality (<, <=, !=, not-in, >, or >=) must be on the same field. But you have inequality filters on '${n.toString()}' and '${r.toString()}'`);\n        const s = Ie(t);\n        null !== s && Qr(t, r, s);\n    }\n    const n = function(t, e) {\n        for (const n of t) for (const t of n.getFlattenedFilters()) if (e.indexOf(t.op) >= 0) return t.op;\n        return null;\n    }(t.filters, function(t) {\n        switch (t) {\n          case \"!=\" /* Operator.NOT_EQUAL */ :\n            return [ \"!=\" /* Operator.NOT_EQUAL */ , \"not-in\" /* Operator.NOT_IN */ ];\n\n          case \"array-contains-any\" /* Operator.ARRAY_CONTAINS_ANY */ :\n          case \"in\" /* Operator.IN */ :\n            return [ \"not-in\" /* Operator.NOT_IN */ ];\n\n          case \"not-in\" /* Operator.NOT_IN */ :\n            return [ \"array-contains-any\" /* Operator.ARRAY_CONTAINS_ANY */ , \"in\" /* Operator.IN */ , \"not-in\" /* Operator.NOT_IN */ , \"!=\" /* Operator.NOT_EQUAL */ ];\n\n          default:\n            return [];\n        }\n    }(e.op));\n    if (null !== n) \n    // Special case when it's a duplicate op to give a slightly clearer error message.\n    throw n === e.op ? new U(P, `Invalid query. You cannot use more than one '${e.op.toString()}' filter.`) : new U(P, `Invalid query. You cannot use '${e.op.toString()}' filters with '${n.toString()}' filters.`);\n}\n\nfunction Qr(t, e, n) {\n    if (!n.isEqual(e)) throw new U(P, `Invalid query. You have a where filter with an inequality (<, <=, !=, not-in, >, or >=) on field '${e.toString()}' and so you must also use '${e.toString()}' as your first argument to orderBy(), but your first orderBy() is on field '${n.toString()}' instead.`);\n}\n\nfunction zr(t, e) {\n    if (!(e instanceof Tr || e instanceof Rr)) throw new U(P, `Function ${t}() requires AppliableConstraints created with a call to 'where(...)', 'or(...)', or 'and(...)'.`);\n}\n\n/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * Converts custom model object of type T into `DocumentData` by applying the\n * converter if it exists.\n *\n * This function is used when converting user objects to `DocumentData`\n * because we want to provide the user with a more specific error message if\n * their `set()` or fails due to invalid data originating from a `toFirestore()`\n * call.\n */\nfunction Wr(t, e, n) {\n    let r;\n    // Cast to `any` in order to satisfy the union type constraint on\n    // toFirestore().\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    return r = t ? n && (n.merge || n.mergeFields) ? t.toFirestore(e, n) : t.toFirestore(e) : e, \n    r;\n}\n\nclass Gr extends class {\n    convertValue(t, e = \"none\") {\n        switch (Ct(t)) {\n          case 0 /* TypeOrder.NullValue */ :\n            return null;\n\n          case 1 /* TypeOrder.BooleanValue */ :\n            return t.booleanValue;\n\n          case 2 /* TypeOrder.NumberValue */ :\n            return Dt(t.integerValue || t.doubleValue);\n\n          case 3 /* TypeOrder.TimestampValue */ :\n            return this.convertTimestamp(t.timestampValue);\n\n          case 4 /* TypeOrder.ServerTimestampValue */ :\n            return this.convertServerTimestamp(t, e);\n\n          case 5 /* TypeOrder.StringValue */ :\n            return t.stringValue;\n\n          case 6 /* TypeOrder.BlobValue */ :\n            return this.convertBytes(Ft(t.bytesValue));\n\n          case 7 /* TypeOrder.RefValue */ :\n            return this.convertReference(t.referenceValue);\n\n          case 8 /* TypeOrder.GeoPointValue */ :\n            return this.convertGeoPoint(t.geoPointValue);\n\n          case 9 /* TypeOrder.ArrayValue */ :\n            return this.convertArray(t.arrayValue, e);\n\n          case 10 /* TypeOrder.ObjectValue */ :\n            return this.convertObject(t.mapValue, e);\n\n          default:\n            throw b();\n        }\n    }\n    convertObject(t, e) {\n        return this.convertObjectMap(t.fields, e);\n    }\n    /**\n     * @internal\n     */    convertObjectMap(t, e = \"none\") {\n        const n = {};\n        return Rt(t, ((t, r) => {\n            n[t] = this.convertValue(r, e);\n        })), n;\n    }\n    convertGeoPoint(t) {\n        return new Bn(Dt(t.latitude), Dt(t.longitude));\n    }\n    convertArray(t, e) {\n        return (t.values || []).map((t => this.convertValue(t, e)));\n    }\n    convertServerTimestamp(t, e) {\n        switch (e) {\n          case \"previous\":\n            const n = qt(t);\n            return null == n ? null : this.convertValue(n, e);\n\n          case \"estimate\":\n            return this.convertTimestamp(Ot(t));\n\n          default:\n            return null;\n        }\n    }\n    convertTimestamp(t) {\n        const e = Nt(t);\n        return new xt(e.seconds, e.nanos);\n    }\n    convertDocumentKey(t, e) {\n        const n = tt.fromString(t);\n        E(dn(n));\n        const r = new X(n.get(1), n.get(3)), s = new rt(n.popFirst(5));\n        return r.isEqual(e) || \n        // TODO(b/64130202): Somehow support foreign references.\n        g(`Document ${s} contains a document reference within a different database (${r.projectId}/${r.database}) which is not supported. It will be treated as a reference in the current database (${e.projectId}/${e.database}) instead.`), \n        s;\n    }\n} {\n    constructor(t) {\n        super(), this.firestore = t;\n    }\n    convertBytes(t) {\n        return new Mn(t);\n    }\n    convertReference(t) {\n        const e = this.convertDocumentKey(t, this.firestore._databaseId);\n        return new Dn(this.firestore, /* converter= */ null, e);\n    }\n}\n\n/**\n * Reads the document referred to by the specified document reference.\n *\n * All documents are directly fetched from the server, even if the document was\n * previously read or modified. Recent modifications are only reflected in the\n * retrieved `DocumentSnapshot` if they have already been applied by the\n * backend. If the client is offline, the read fails. If you like to use\n * caching or see local modifications, please use the full Firestore SDK.\n *\n * @param reference - The reference of the document to fetch.\n * @returns A Promise resolved with a `DocumentSnapshot` containing the current\n * document contents.\n */ function Kr(t) {\n    const e = En((t = ct(t, Dn)).firestore), n = new Gr(t.firestore);\n    return gn(e, [ t._key ]).then((e => {\n        E(1 === e.length);\n        const r = e[0];\n        return new pr(t.firestore, n, t._key, r.isFoundDocument() ? r : null, t.converter);\n    }));\n}\n\n/**\n * Executes the query and returns the results as a {@link QuerySnapshot}.\n *\n * All queries are executed directly by the server, even if the the query was\n * previously executed. Recent modifications are only reflected in the retrieved\n * results if they have already been applied by the backend. If the client is\n * offline, the operation fails. To see previously cached result and local\n * modifications, use the full Firestore SDK.\n *\n * @param query - The `Query` to execute.\n * @returns A Promise that will be resolved with the results of the query.\n */ function Yr(t) {\n    !function(t) {\n        if (\"L\" /* LimitType.Last */ === t.limitType && 0 === t.explicitOrderBy.length) throw new U(k, \"limitToLast() queries require specifying at least one orderBy() clause\");\n    }((t = ct(t, Fn))._query);\n    const e = En(t.firestore), n = new Gr(t.firestore);\n    return _n(e, t._query).then((e => {\n        const r = e.map((e => new yr(t.firestore, n, e.key, e, t.converter)));\n        return \"L\" /* LimitType.Last */ === t._query.limitType && \n        // Limit to last queries reverse the orderBy constraint that was\n        // specified by the user. As such, we need to reverse the order of the\n        // results to return the documents in the expected order.\n        r.reverse(), new gr(t, r);\n    }));\n}\n\nfunction Hr(t, e, n) {\n    const r = Wr((t = ct(t, Dn)).converter, e, n), s = Jn(Hn(t.firestore), \"setDoc\", t._key, r, null !== t.converter, n);\n    return yn(En(t.firestore), [ s.toMutation(t._key, ke.none()) ]);\n}\n\nfunction Jr(t, e, n, ...r) {\n    const s = Hn((t = ct(t, Dn)).firestore);\n    // For Compat types, we have to \"extract\" the underlying types before\n    // performing validation.\n        let i;\n    i = \"string\" == typeof (e = l(e)) || e instanceof Ln ? ir(s, \"updateDoc\", t._key, e, n, r) : sr(s, \"updateDoc\", t._key, e);\n    return yn(En(t.firestore), [ i.toMutation(t._key, ke.exists(!0)) ]);\n}\n\n/**\n * Deletes the document referred to by the specified `DocumentReference`.\n *\n * The deletion will only be reflected in document reads that occur after the\n * returned promise resolves. If the client is offline, the\n * delete fails. If you would like to see local modifications or buffer writes\n * until the client is online, use the full Firestore SDK.\n *\n * @param reference - A reference to the document to delete.\n * @returns A `Promise` resolved once the document has been successfully\n * deleted from the backend.\n */ function Xr(t) {\n    return yn(En((t = ct(t, Dn)).firestore), [ new Ue(t._key, ke.none()) ]);\n}\n\n/**\n * Add a new document to specified `CollectionReference` with the given data,\n * assigning it a document ID automatically.\n *\n * The result of this write will only be reflected in document reads that occur\n * after the returned promise resolves. If the client is offline, the\n * write fails. If you would like to see local modifications or buffer writes\n * until the client is online, use the full Firestore SDK.\n *\n * @param reference - A reference to the collection to add this document to.\n * @param data - An Object containing the data for the new document.\n * @throws Error - If the provided input is not a valid Firestore document.\n * @returns A `Promise` resolved with a `DocumentReference` pointing to the\n * newly created document after it has been written to the backend.\n */ function Zr(t, e) {\n    const n = On(t = ct(t, xn)), r = Wr(t.converter, e), s = Jn(Hn(t.firestore), \"addDoc\", n._key, r, null !== n.converter, {});\n    return yn(En(t.firestore), [ s.toMutation(n._key, ke.exists(!1)) ]).then((() => n));\n}\n\n/**\n * @license\n * Copyright 2022 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * Calculates the number of documents in the result set of the given query,\n * without actually downloading the documents.\n *\n * Using this function to count the documents is efficient because only the\n * final count, not the documents' data, is downloaded. This function can even\n * count the documents if the result set would be prohibitively large to\n * download entirely (e.g. thousands of documents).\n *\n * @param query - The query whose result set size to calculate.\n * @returns A Promise that will be resolved with the count; the count can be\n * retrieved from `snapshot.data().count`, where `snapshot` is the\n * `AggregateQuerySnapshot` to which the returned Promise resolves.\n */ function ts(t) {\n    return es(t, {\n        count: ss()\n    });\n}\n\n/**\n * Calculates the specified aggregations over the documents in the result\n * set of the given query, without actually downloading the documents.\n *\n * Using this function to perform aggregations is efficient because only the\n * final aggregation values, not the documents' data, is downloaded. This\n * function can even perform aggregations of the documents if the result set\n * would be prohibitively large to download entirely (e.g. thousands of documents).\n *\n * @param query The query whose result set to aggregate over.\n * @param aggregateSpec An `AggregateSpec` object that specifies the aggregates\n * to perform over the result set. The AggregateSpec specifies aliases for each\n * aggregate, which can be used to retrieve the aggregate result.\n * @example\n * ```typescript\n * const aggregateSnapshot = await getAggregate(query, {\n *   countOfDocs: count(),\n *   totalHours: sum('hours'),\n *   averageScore: average('score')\n * });\n *\n * const countOfDocs: number = aggregateSnapshot.data().countOfDocs;\n * const totalHours: number = aggregateSnapshot.data().totalHours;\n * const averageScore: number | null = aggregateSnapshot.data().averageScore;\n * ```\n * @internal TODO (sum/avg) remove when public\n */ function es(t, e) {\n    const n = ct(t.firestore, Tn), r = En(n), s = function(t, e) {\n        const n = [];\n        for (const r in t) Object.prototype.hasOwnProperty.call(t, r) && n.push(e(t[r], r, t));\n        return n;\n    }(e, ((t, e) => new vt(e, t._aggregateType, t._internalFieldPath)));\n    // Run the aggregation and convert the results\n    return vn(r, t._query, s).then((e => function(t, e, n) {\n        const r = new Gr(t);\n        return new Nn(e, r, n);\n    }\n    /**\n * Create an AggregateField object that can be used to compute the sum of\n * a specified field over a range of documents in the result set of a query.\n * @param field Specifies the field to sum across the result set.\n * @internal TODO (sum/avg) remove when public\n */ (n, t, e)));\n}\n\nfunction ns(t) {\n    return new $n(\"sum\", lr(\"sum\", t));\n}\n\n/**\n * Create an AggregateField object that can be used to compute the average of\n * a specified field over a range of documents in the result set of a query.\n * @param field Specifies the field to average across the result set.\n * @internal TODO (sum/avg) remove when public\n */ function rs(t) {\n    return new $n(\"avg\", lr(\"average\", t));\n}\n\n/**\n * Create an AggregateField object that can be used to compute the count of\n * documents in the result set of a query.\n * @internal TODO (sum/avg) remove when public\n */ function ss() {\n    return new $n(\"count\");\n}\n\n/**\n * Compares two 'AggregateField` instances for equality.\n *\n * @param left Compare this AggregateField to the `right`.\n * @param right Compare this AggregateField to the `left`.\n * @internal TODO (sum/avg) remove when public\n */ function is(t, e) {\n    var n, r;\n    return t instanceof $n && e instanceof $n && t._aggregateType === e._aggregateType && (null === (n = t._internalFieldPath) || void 0 === n ? void 0 : n.canonicalString()) === (null === (r = e._internalFieldPath) || void 0 === r ? void 0 : r.canonicalString());\n}\n\n/**\n * Compares two `AggregateQuerySnapshot` instances for equality.\n *\n * Two `AggregateQuerySnapshot` instances are considered \"equal\" if they have\n * underlying queries that compare equal, and the same data.\n *\n * @param left - The first `AggregateQuerySnapshot` to compare.\n * @param right - The second `AggregateQuerySnapshot` to compare.\n *\n * @returns `true` if the objects are \"equal\", as defined above, or `false`\n * otherwise.\n */ function os(t, e) {\n    return Cn(t.query, e.query) && f(t.data(), e.data());\n}\n\n/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * Returns a sentinel for use with {@link @firebase/firestore/lite#(updateDoc:1)} or\n * {@link @firebase/firestore/lite#(setDoc:1)} with `{merge: true}` to mark a field for deletion.\n */ function us() {\n    return new Xn(\"deleteField\");\n}\n\n/**\n * Returns a sentinel used with {@link @firebase/firestore/lite#(setDoc:1)} or {@link @firebase/firestore/lite#(updateDoc:1)} to\n * include a server-generated timestamp in the written data.\n */ function cs() {\n    return new tr(\"serverTimestamp\");\n}\n\n/**\n * Returns a special value that can be used with {@link @firebase/firestore/lite#(setDoc:1)} or {@link\n * @firebase/firestore/lite#(updateDoc:1)} that tells the server to union the given elements with any array\n * value that already exists on the server. Each specified element that doesn't\n * already exist in the array will be added to the end. If the field being\n * modified is not already an array it will be overwritten with an array\n * containing exactly the specified elements.\n *\n * @param elements - The elements to union into the array.\n * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or\n * `updateDoc()`.\n */ function as(...t) {\n    // NOTE: We don't actually parse the data until it's used in set() or\n    // update() since we'd need the Firestore instance to do this.\n    return new er(\"arrayUnion\", t);\n}\n\n/**\n * Returns a special value that can be used with {@link (setDoc:1)} or {@link\n * updateDoc:1} that tells the server to remove the given elements from any\n * array value that already exists on the server. All instances of each element\n * specified will be removed from the array. If the field being modified is not\n * already an array it will be overwritten with an empty array.\n *\n * @param elements - The elements to remove from the array.\n * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or\n * `updateDoc()`\n */ function hs(...t) {\n    // NOTE: We don't actually parse the data until it's used in set() or\n    // update() since we'd need the Firestore instance to do this.\n    return new nr(\"arrayRemove\", t);\n}\n\n/**\n * Returns a special value that can be used with {@link @firebase/firestore/lite#(setDoc:1)} or {@link\n * @firebase/firestore/lite#(updateDoc:1)} that tells the server to increment the field's current value by\n * the given value.\n *\n * If either the operand or the current field value uses floating point\n * precision, all arithmetic follows IEEE 754 semantics. If both values are\n * integers, values outside of JavaScript's safe number range\n * (`Number.MIN_SAFE_INTEGER` to `Number.MAX_SAFE_INTEGER`) are also subject to\n * precision loss. Furthermore, once processed by the Firestore backend, all\n * integer operations are capped between -2^63 and 2^63-1.\n *\n * If the current field value is not of type `number`, or if the field does not\n * yet exist, the transformation sets the field to the given value.\n *\n * @param n - The value to increment by.\n * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or\n * `updateDoc()`\n */ function ls(t) {\n    return new rr(\"increment\", t);\n}\n\n/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * A write batch, used to perform multiple writes as a single atomic unit.\n *\n * A `WriteBatch` object can be acquired by calling {@link writeBatch}. It\n * provides methods for adding writes to the write batch. None of the writes\n * will be committed (or visible locally) until {@link WriteBatch.commit} is\n * called.\n */ class fs {\n    /** @hideconstructor */\n    constructor(t, e) {\n        this._firestore = t, this._commitHandler = e, this._mutations = [], this._committed = !1, \n        this._dataReader = Hn(t);\n    }\n    set(t, e, n) {\n        this._verifyNotCommitted();\n        const r = ds(t, this._firestore), s = Wr(r.converter, e, n), i = Jn(this._dataReader, \"WriteBatch.set\", r._key, s, null !== r.converter, n);\n        return this._mutations.push(i.toMutation(r._key, ke.none())), this;\n    }\n    update(t, e, n, ...r) {\n        this._verifyNotCommitted();\n        const s = ds(t, this._firestore);\n        // For Compat types, we have to \"extract\" the underlying types before\n        // performing validation.\n                let i;\n        return i = \"string\" == typeof (e = l(e)) || e instanceof Ln ? ir(this._dataReader, \"WriteBatch.update\", s._key, e, n, r) : sr(this._dataReader, \"WriteBatch.update\", s._key, e), \n        this._mutations.push(i.toMutation(s._key, ke.exists(!0))), this;\n    }\n    /**\n     * Deletes the document referred to by the provided {@link DocumentReference}.\n     *\n     * @param documentRef - A reference to the document to be deleted.\n     * @returns This `WriteBatch` instance. Used for chaining method calls.\n     */    delete(t) {\n        this._verifyNotCommitted();\n        const e = ds(t, this._firestore);\n        return this._mutations = this._mutations.concat(new Ue(e._key, ke.none())), this;\n    }\n    /**\n     * Commits all of the writes in this write batch as a single atomic unit.\n     *\n     * The result of these writes will only be reflected in document reads that\n     * occur after the returned promise resolves. If the client is offline, the\n     * write fails. If you would like to see local modifications or buffer writes\n     * until the client is online, use the full Firestore SDK.\n     *\n     * @returns A `Promise` resolved once all of the writes in the batch have been\n     * successfully written to the backend as an atomic unit (note that it won't\n     * resolve while you're offline).\n     */    commit() {\n        return this._verifyNotCommitted(), this._committed = !0, this._mutations.length > 0 ? this._commitHandler(this._mutations) : Promise.resolve();\n    }\n    _verifyNotCommitted() {\n        if (this._committed) throw new U(S, \"A write batch can no longer be used after commit() has been called.\");\n    }\n}\n\nfunction ds(t, e) {\n    if ((t = l(t)).firestore !== e) throw new U(P, \"Provided document reference is from a different Firestore instance.\");\n    return t;\n}\n\n/**\n * Creates a write batch, used for performing multiple writes as a single\n * atomic operation. The maximum number of writes allowed in a single WriteBatch\n * is 500.\n *\n * The result of these writes will only be reflected in document reads that\n * occur after the returned promise resolves. If the client is offline, the\n * write fails. If you would like to see local modifications or buffer writes\n * until the client is online, use the full Firestore SDK.\n *\n * @returns A `WriteBatch` that can be used to atomically execute multiple\n * writes.\n */ function ws(t) {\n    const e = En(t = ct(t, Tn));\n    return new fs(t, (t => yn(e, t)));\n}\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * Internal transaction object responsible for accumulating the mutations to\n * perform and the base versions for any documents read.\n */ class ms {\n    constructor(t) {\n        this.datastore = t, \n        // The version of each document that was read during this transaction.\n        this.readVersions = new Map, this.mutations = [], this.committed = !1, \n        /**\n         * A deferred usage error that occurred previously in this transaction that\n         * will cause the transaction to fail once it actually commits.\n         */\n        this.lastWriteError = null, \n        /**\n         * Set of documents that have been written in the transaction.\n         *\n         * When there's more than one write to the same key in a transaction, any\n         * writes after the first are handled differently.\n         */\n        this.writtenDocs = new Set;\n    }\n    async lookup(t) {\n        if (this.ensureCommitNotCalled(), this.mutations.length > 0) throw new U(P, \"Firestore transactions require all reads to be executed before all writes.\");\n        const e = await gn(this.datastore, t);\n        return e.forEach((t => this.recordVersion(t))), e;\n    }\n    set(t, e) {\n        this.write(e.toMutation(t, this.precondition(t))), this.writtenDocs.add(t.toString());\n    }\n    update(t, e) {\n        try {\n            this.write(e.toMutation(t, this.preconditionForUpdate(t)));\n        } catch (t) {\n            this.lastWriteError = t;\n        }\n        this.writtenDocs.add(t.toString());\n    }\n    delete(t) {\n        this.write(new Ue(t, this.precondition(t))), this.writtenDocs.add(t.toString());\n    }\n    async commit() {\n        if (this.ensureCommitNotCalled(), this.lastWriteError) throw this.lastWriteError;\n        const t = this.readVersions;\n        // For each mutation, note that the doc was written.\n                this.mutations.forEach((e => {\n            t.delete(e.key.toString());\n        })), \n        // For each document that was read but not written to, we want to perform\n        // a `verify` operation.\n        t.forEach(((t, e) => {\n            const n = rt.fromPath(e);\n            this.mutations.push(new je(n, this.precondition(n)));\n        })), await yn(this.datastore, this.mutations), this.committed = !0;\n    }\n    recordVersion(t) {\n        let e;\n        if (t.isFoundDocument()) e = t.version; else {\n            if (!t.isNoDocument()) throw b();\n            // Represent a deleted doc using SnapshotVersion.min().\n            e = le.min();\n        }\n        const n = this.readVersions.get(t.key.toString());\n        if (n) {\n            if (!e.isEqual(n)) \n            // This transaction will fail no matter what.\n            throw new U(q, \"Document version changed between two reads.\");\n        } else this.readVersions.set(t.key.toString(), e);\n    }\n    /**\n     * Returns the version of this document when it was read in this transaction,\n     * as a precondition, or no precondition if it was not read.\n     */    precondition(t) {\n        const e = this.readVersions.get(t.toString());\n        return !this.writtenDocs.has(t.toString()) && e ? e.isEqual(le.min()) ? ke.exists(!1) : ke.updateTime(e) : ke.none();\n    }\n    /**\n     * Returns the precondition for a document if the operation is an update.\n     */    preconditionForUpdate(t) {\n        const e = this.readVersions.get(t.toString());\n        // The first time a document is written, we want to take into account the\n        // read time and existence\n                if (!this.writtenDocs.has(t.toString()) && e) {\n            if (e.isEqual(le.min())) \n            // The document doesn't exist, so fail the transaction.\n            // This has to be validated locally because you can't send a\n            // precondition that a document does not exist without changing the\n            // semantics of the backend write to be an insert. This is the reverse\n            // of what we want, since we want to assert that the document doesn't\n            // exist but then send the update and have it fail. Since we can't\n            // express that to the backend, we have to validate locally.\n            // Note: this can change once we can send separate verify writes in the\n            // transaction.\n            throw new U(P, \"Can't update a document that doesn't exist.\");\n            // Document exists, base precondition on document update time.\n                        return ke.updateTime(e);\n        }\n        // Document was not read, so we just use the preconditions for a blind\n        // update.\n        return ke.exists(!0);\n    }\n    write(t) {\n        this.ensureCommitNotCalled(), this.mutations.push(t);\n    }\n    ensureCommitNotCalled() {}\n}\n\n/**\n * @license\n * Copyright 2022 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */ const ps = {\n    maxAttempts: 5\n};\n\n/**\n * @license\n * Copyright 2019 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * TransactionRunner encapsulates the logic needed to run and retry transactions\n * with backoff.\n */\nclass ys {\n    constructor(t, e, n, r, s) {\n        this.asyncQueue = t, this.datastore = e, this.options = n, this.updateFunction = r, \n        this.deferred = s, this.yt = n.maxAttempts, this.gt = new mn(this.asyncQueue, \"transaction_retry\" /* TimerId.TransactionRetry */);\n    }\n    /** Runs the transaction and sets the result on deferred. */    run() {\n        this.yt -= 1, this._t();\n    }\n    _t() {\n        this.gt.K((async () => {\n            const t = new ms(this.datastore), e = this.vt(t);\n            e && e.then((e => {\n                this.asyncQueue.enqueueAndForget((() => t.commit().then((() => {\n                    this.deferred.resolve(e);\n                })).catch((t => {\n                    this.bt(t);\n                }))));\n            })).catch((t => {\n                this.bt(t);\n            }));\n        }));\n    }\n    vt(t) {\n        try {\n            const e = this.updateFunction(t);\n            return !dt(e) && e.catch && e.then ? e : (this.deferred.reject(Error(\"Transaction callback must return a Promise\")), \n            null);\n        } catch (t) {\n            // Do not retry errors thrown by user provided updateFunction.\n            return this.deferred.reject(t), null;\n        }\n    }\n    bt(t) {\n        this.yt > 0 && this.Et(t) ? (this.yt -= 1, this.asyncQueue.enqueueAndForget((() => (this._t(), \n        Promise.resolve())))) : this.deferred.reject(t);\n    }\n    Et(t) {\n        if (\"FirebaseError\" === t.name) {\n            // In transactions, the backend will fail outdated reads with FAILED_PRECONDITION and\n            // non-matching document versions with ABORTED. These errors should be retried.\n            const e = t.code;\n            return \"aborted\" === e || \"failed-precondition\" === e || \"already-exists\" === e || !\n            /**\n * Determines whether an error code represents a permanent error when received\n * in response to a non-write operation.\n *\n * See isPermanentWriteError for classifying write errors.\n */\n            function(t) {\n                switch (t) {\n                  default:\n                    return b();\n\n                  case A:\n                  case R:\n                  case V:\n                  case x:\n                  case C:\n                  case M:\n // Unauthenticated means something went wrong with our token and we need\n                    // to retry with new credentials which will happen automatically.\n                                      case F:\n                    return !1;\n\n                  case P:\n                  case $:\n                  case N:\n                  case D:\n                  case S:\n // Aborted might be retried in some scenarios, but that is dependant on\n                    // the context and should handled individually by the calling code.\n                    // See https://cloud.google.com/apis/design/errors.\n                                      case q:\n                  case O:\n                  case k:\n                  case L:\n                    return !0;\n                }\n            }(e);\n        }\n        return !1;\n    }\n}\n\n/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/** The Platform's 'document' implementation or null if not available. */ function gs() {\n    // `document` is not always available, e.g. in ReactNative and WebWorkers.\n    // eslint-disable-next-line no-restricted-globals\n    return \"undefined\" != typeof document ? document : null;\n}\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * Represents an operation scheduled to be run in the future on an AsyncQueue.\n *\n * It is created via DelayedOperation.createAndSchedule().\n *\n * Supports cancellation (via cancel()) and early execution (via skipDelay()).\n *\n * Note: We implement `PromiseLike` instead of `Promise`, as the `Promise` type\n * in newer versions of TypeScript defines `finally`, which is not available in\n * IE.\n */ class _s {\n    constructor(t, e, n, r, s) {\n        this.asyncQueue = t, this.timerId = e, this.targetTimeMs = n, this.op = r, this.removalCallback = s, \n        this.deferred = new j, this.then = this.deferred.promise.then.bind(this.deferred.promise), \n        // It's normal for the deferred promise to be canceled (due to cancellation)\n        // and so we attach a dummy catch callback to avoid\n        // 'UnhandledPromiseRejectionWarning' log spam.\n        this.deferred.promise.catch((t => {}));\n    }\n    /**\n     * Creates and returns a DelayedOperation that has been scheduled to be\n     * executed on the provided asyncQueue after the provided delayMs.\n     *\n     * @param asyncQueue - The queue to schedule the operation on.\n     * @param id - A Timer ID identifying the type of operation this is.\n     * @param delayMs - The delay (ms) before the operation should be scheduled.\n     * @param op - The operation to run.\n     * @param removalCallback - A callback to be called synchronously once the\n     *   operation is executed or canceled, notifying the AsyncQueue to remove it\n     *   from its delayedOperations list.\n     *   PORTING NOTE: This exists to prevent making removeDelayedOperation() and\n     *   the DelayedOperation class public.\n     */    static createAndSchedule(t, e, n, r, s) {\n        const i = Date.now() + n, o = new _s(t, e, i, r, s);\n        return o.start(n), o;\n    }\n    /**\n     * Starts the timer. This is called immediately after construction by\n     * createAndSchedule().\n     */    start(t) {\n        this.timerHandle = setTimeout((() => this.handleDelayElapsed()), t);\n    }\n    /**\n     * Queues the operation to run immediately (if it hasn't already been run or\n     * canceled).\n     */    skipDelay() {\n        return this.handleDelayElapsed();\n    }\n    /**\n     * Cancels the operation if it hasn't already been executed or canceled. The\n     * promise will be rejected.\n     *\n     * As long as the operation has not yet been run, calling cancel() provides a\n     * guarantee that the operation will not be run.\n     */    cancel(t) {\n        null !== this.timerHandle && (this.clearTimeout(), this.deferred.reject(new U(A, \"Operation cancelled\" + (t ? \": \" + t : \"\"))));\n    }\n    handleDelayElapsed() {\n        this.asyncQueue.enqueueAndForget((() => null !== this.timerHandle ? (this.clearTimeout(), \n        this.op().then((t => this.deferred.resolve(t)))) : Promise.resolve()));\n    }\n    clearTimeout() {\n        null !== this.timerHandle && (this.removalCallback(this), clearTimeout(this.timerHandle), \n        this.timerHandle = null);\n    }\n}\n\n/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */ class vs {\n    constructor() {\n        // The last promise in the queue.\n        this.It = Promise.resolve(), \n        // A list of retryable operations. Retryable operations are run in order and\n        // retried with backoff.\n        this.Tt = [], \n        // Is this AsyncQueue being shut down? Once it is set to true, it will not\n        // be changed again.\n        this.At = !1, \n        // Operations scheduled to be queued in the future. Operations are\n        // automatically removed after they are run or canceled.\n        this.Rt = [], \n        // visible for testing\n        this.Pt = null, \n        // Flag set while there's an outstanding AsyncQueue operation, used for\n        // assertion sanity-checks.\n        this.Vt = !1, \n        // Enabled during shutdown on Safari to prevent future access to IndexedDB.\n        this.$t = !1, \n        // List of TimerIds to fast-forward delays for.\n        this.Nt = [], \n        // Backoff timer used to schedule retries for retryable operations\n        this.gt = new mn(this, \"async_queue_retry\" /* TimerId.AsyncQueueRetry */), \n        // Visibility handler that triggers an immediate retry of all retryable\n        // operations. Meant to speed up recovery when we regain file system access\n        // after page comes into foreground.\n        this.Dt = () => {\n            const t = gs();\n            t && y(\"AsyncQueue\", \"Visibility state changed to \" + t.visibilityState), this.gt.H();\n        };\n        const t = gs();\n        t && \"function\" == typeof t.addEventListener && t.addEventListener(\"visibilitychange\", this.Dt);\n    }\n    get isShuttingDown() {\n        return this.At;\n    }\n    /**\n     * Adds a new operation to the queue without waiting for it to complete (i.e.\n     * we ignore the Promise result).\n     */    enqueueAndForget(t) {\n        // eslint-disable-next-line @typescript-eslint/no-floating-promises\n        this.enqueue(t);\n    }\n    enqueueAndForgetEvenWhileRestricted(t) {\n        this.Ft(), \n        // eslint-disable-next-line @typescript-eslint/no-floating-promises\n        this.xt(t);\n    }\n    enterRestrictedMode(t) {\n        if (!this.At) {\n            this.At = !0, this.$t = t || !1;\n            const e = gs();\n            e && \"function\" == typeof e.removeEventListener && e.removeEventListener(\"visibilitychange\", this.Dt);\n        }\n    }\n    enqueue(t) {\n        if (this.Ft(), this.At) \n        // Return a Promise which never resolves.\n        return new Promise((() => {}));\n        // Create a deferred Promise that we can return to the callee. This\n        // allows us to return a \"hanging Promise\" only to the callee and still\n        // advance the queue even when the operation is not run.\n                const e = new j;\n        return this.xt((() => this.At && this.$t ? Promise.resolve() : (t().then(e.resolve, e.reject), \n        e.promise))).then((() => e.promise));\n    }\n    enqueueRetryable(t) {\n        this.enqueueAndForget((() => (this.Tt.push(t), this.St())));\n    }\n    /**\n     * Runs the next operation from the retryable queue. If the operation fails,\n     * reschedules with backoff.\n     */    async St() {\n        if (0 !== this.Tt.length) {\n            try {\n                await this.Tt[0](), this.Tt.shift(), this.gt.reset();\n            } catch (t) {\n                if (!\n                /**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n                /** Verifies whether `e` is an IndexedDbTransactionError. */\n                function(t) {\n                    // Use name equality, as instanceof checks on errors don't work with errors\n                    // that wrap other errors.\n                    return \"IndexedDbTransactionError\" === t.name;\n                }\n                /**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */ (t)) throw t;\n // Failure will be handled by AsyncQueue\n                                y(\"AsyncQueue\", \"Operation failed with retryable error: \" + t);\n            }\n            this.Tt.length > 0 && \n            // If there are additional operations, we re-schedule `retryNextOp()`.\n            // This is necessary to run retryable operations that failed during\n            // their initial attempt since we don't know whether they are already\n            // enqueued. If, for example, `op1`, `op2`, `op3` are enqueued and `op1`\n            // needs to  be re-run, we will run `op1`, `op1`, `op2` using the\n            // already enqueued calls to `retryNextOp()`. `op3()` will then run in the\n            // call scheduled here.\n            // Since `backoffAndRun()` cancels an existing backoff and schedules a\n            // new backoff on every call, there is only ever a single additional\n            // operation in the queue.\n            this.gt.K((() => this.St()));\n        }\n    }\n    xt(t) {\n        const e = this.It.then((() => (this.Vt = !0, t().catch((t => {\n            this.Pt = t, this.Vt = !1;\n            const e = \n            /**\n * Chrome includes Error.message in Error.stack. Other browsers do not.\n * This returns expected output of message + stack when available.\n * @param error - Error or FirestoreError\n */\n            function(t) {\n                let e = t.message || \"\";\n                t.stack && (e = t.stack.includes(t.message) ? t.stack : t.message + \"\\n\" + t.stack);\n                return e;\n            }\n            /**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n            // TODO(mrschmidt) Consider using `BaseTransaction` as the base class in the\n            // legacy SDK.\n            /**\n * A reference to a transaction.\n *\n * The `Transaction` object passed to a transaction's `updateFunction` provides\n * the methods to read and write data within the transaction context. See\n * {@link runTransaction}.\n */ (t);\n            // Re-throw the error so that this.tail becomes a rejected Promise and\n            // all further attempts to chain (via .then) will just short-circuit\n            // and return the rejected Promise.\n            throw g(\"INTERNAL UNHANDLED ERROR: \", e), t;\n        })).then((t => (this.Vt = !1, t))))));\n        return this.It = e, e;\n    }\n    enqueueAfterDelay(t, e, n) {\n        this.Ft(), \n        // Fast-forward delays for timerIds that have been overriden.\n        this.Nt.indexOf(t) > -1 && (e = 0);\n        const r = _s.createAndSchedule(this, t, e, n, (t => this.qt(t)));\n        return this.Rt.push(r), r;\n    }\n    Ft() {\n        this.Pt && b();\n    }\n    verifyOperationInProgress() {}\n    /**\n     * Waits until all currently queued tasks are finished executing. Delayed\n     * operations are not run.\n     */    async Ot() {\n        // Operations in the queue prior to draining may have enqueued additional\n        // operations. Keep draining the queue until the tail is no longer advanced,\n        // which indicates that no more new operations were enqueued and that all\n        // operations were executed.\n        let t;\n        do {\n            t = this.It, await t;\n        } while (t !== this.It);\n    }\n    /**\n     * For Tests: Determine if a delayed operation with a particular TimerId\n     * exists.\n     */    kt(t) {\n        for (const e of this.Rt) if (e.timerId === t) return !0;\n        return !1;\n    }\n    /**\n     * For Tests: Runs some or all delayed operations early.\n     *\n     * @param lastTimerId - Delayed operations up to and including this TimerId\n     * will be drained. Pass TimerId.All to run all delayed operations.\n     * @returns a Promise that resolves once all operations have been run.\n     */    Ct(t) {\n        // Note that draining may generate more delayed ops, so we do that first.\n        return this.Ot().then((() => {\n            // Run ops in the same order they'd run if they ran naturally.\n            this.Rt.sort(((t, e) => t.targetTimeMs - e.targetTimeMs));\n            for (const e of this.Rt) if (e.skipDelay(), \"all\" /* TimerId.All */ !== t && e.timerId === t) break;\n            return this.Ot();\n        }));\n    }\n    /**\n     * For Tests: Skip all subsequent delays for a timer id.\n     */    Mt(t) {\n        this.Nt.push(t);\n    }\n    /** Called once a DelayedOperation is run or canceled. */    qt(t) {\n        // NOTE: indexOf / slice are O(n), but delayedOperations is expected to be small.\n        const e = this.Rt.indexOf(t);\n        this.Rt.splice(e, 1);\n    }\n}\n\nclass bs {\n    /** @hideconstructor */\n    constructor(t, e) {\n        this._firestore = t, this._transaction = e, this._dataReader = Hn(t);\n    }\n    /**\n     * Reads the document referenced by the provided {@link DocumentReference}.\n     *\n     * @param documentRef - A reference to the document to be read.\n     * @returns A `DocumentSnapshot` with the read data.\n     */    get(t) {\n        const e = ds(t, this._firestore), n = new Gr(this._firestore);\n        return this._transaction.lookup([ e._key ]).then((t => {\n            if (!t || 1 !== t.length) return b();\n            const r = t[0];\n            if (r.isFoundDocument()) return new pr(this._firestore, n, r.key, r, e.converter);\n            if (r.isNoDocument()) return new pr(this._firestore, n, e._key, null, e.converter);\n            throw b();\n        }));\n    }\n    set(t, e, n) {\n        const r = ds(t, this._firestore), s = Wr(r.converter, e, n), i = Jn(this._dataReader, \"Transaction.set\", r._key, s, null !== r.converter, n);\n        return this._transaction.set(r._key, i), this;\n    }\n    update(t, e, n, ...r) {\n        const s = ds(t, this._firestore);\n        // For Compat types, we have to \"extract\" the underlying types before\n        // performing validation.\n                let i;\n        return i = \"string\" == typeof (e = l(e)) || e instanceof Ln ? ir(this._dataReader, \"Transaction.update\", s._key, e, n, r) : sr(this._dataReader, \"Transaction.update\", s._key, e), \n        this._transaction.update(s._key, i), this;\n    }\n    /**\n     * Deletes the document referred to by the provided {@link DocumentReference}.\n     *\n     * @param documentRef - A reference to the document to be deleted.\n     * @returns This `Transaction` instance. Used for chaining method calls.\n     */    delete(t) {\n        const e = ds(t, this._firestore);\n        return this._transaction.delete(e._key), this;\n    }\n}\n\n/**\n * Executes the given `updateFunction` and then attempts to commit the changes\n * applied within the transaction. If any document read within the transaction\n * has changed, Cloud Firestore retries the `updateFunction`. If it fails to\n * commit after 5 attempts, the transaction fails.\n *\n * The maximum number of writes allowed in a single transaction is 500.\n *\n * @param firestore - A reference to the Firestore database to run this\n * transaction against.\n * @param updateFunction - The function to execute within the transaction\n * context.\n * @param options - An options object to configure maximum number of attempts to\n * commit.\n * @returns If the transaction completed successfully or was explicitly aborted\n * (the `updateFunction` returned a failed promise), the promise returned by the\n * `updateFunction `is returned here. Otherwise, if the transaction failed, a\n * rejected promise with the corresponding failure error is returned.\n */ function Es(t, e, n) {\n    const r = En(t = ct(t, Tn)), s = Object.assign(Object.assign({}, ps), n);\n    !function(t) {\n        if (t.maxAttempts < 1) throw new U(P, \"Max attempts must be at least 1\");\n    }(s);\n    const i = new j;\n    return new ys(new vs, r, s, (n => e(new bs(t, n))), i).run(), i.promise;\n}\n\n/**\n * Firestore Lite\n *\n * @remarks Firestore Lite is a small online-only SDK that allows read\n * and write access to your Firestore database. All operations connect\n * directly to the backend, and `onSnapshot()` APIs are not supported.\n * @packageDocumentation\n */ !function(t) {\n    w = t;\n}(`${s}_lite`), n(new i(\"firestore/lite\", ((t, {instanceIdentifier: e, options: n}) => {\n    const r = t.getProvider(\"app\").getImmediate(), s = new Tn(new W(t.getProvider(\"auth-internal\")), new H(t.getProvider(\"app-check-internal\")), function(t, e) {\n        if (!Object.prototype.hasOwnProperty.apply(t.options, [ \"projectId\" ])) throw new U(P, '\"projectId\" not provided in firebase.initializeApp.');\n        return new X(t.options.projectId, e);\n    }\n    /**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */ (r, e), r);\n    return n && s._setSettings(n), s;\n}), \"PUBLIC\").setMultipleInstances(!0)), \n// RUNTIME_ENV and BUILD_TARGET are replaced by real values during the compilation\nr(\"firestore-lite\", \"3.13.0\", \"\"), r(\"firestore-lite\", \"3.13.0\", \"__BUILD_TARGET__\");\n\nexport { $n as AggregateField, Nn as AggregateQuerySnapshot, Mn as Bytes, xn as CollectionReference, Dn as DocumentReference, pr as DocumentSnapshot, Ln as FieldPath, jn as FieldValue, Tn as Firestore, U as FirestoreError, Bn as GeoPoint, Fn as Query, Rr as QueryCompositeFilterConstraint, Er as QueryConstraint, yr as QueryDocumentSnapshot, kr as QueryEndAtConstraint, Tr as QueryFieldFilterConstraint, Dr as QueryLimitConstraint, $r as QueryOrderByConstraint, gr as QuerySnapshot, Sr as QueryStartAtConstraint, xt as Timestamp, bs as Transaction, fs as WriteBatch, Zr as addDoc, is as aggregateFieldEqual, os as aggregateQuerySnapshotEqual, Vr as and, hs as arrayRemove, as as arrayUnion, rs as average, Sn as collection, qn as collectionGroup, Pn as connectFirestoreEmulator, ss as count, Xr as deleteDoc, us as deleteField, On as doc, Un as documentId, Mr as endAt, Cr as endBefore, es as getAggregate, ts as getCount, Kr as getDoc, Yr as getDocs, Rn as getFirestore, ls as increment, An as initializeFirestore, Fr as limit, xr as limitToLast, Pr as or, Nr as orderBy, Ir as query, Cn as queryEqual, kn as refEqual, Es as runTransaction, cs as serverTimestamp, Hr as setDoc, p as setLogLevel, _r as snapshotEqual, Or as startAfter, qr as startAt, ns as sum, Vn as terminate, Jr as updateDoc, Ar as where, ws as writeBatch };\n//# sourceMappingURL=index.browser.esm2017.js.map\n","/**\n * @license\n * Copyright 2021 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { base64urlEncodeWithoutPadding } from './crypt';\n\n// Firebase Auth tokens contain snake_case claims following the JWT standard / convention.\n/* eslint-disable camelcase */\n\nexport type FirebaseSignInProvider =\n  | 'custom'\n  | 'email'\n  | 'password'\n  | 'phone'\n  | 'anonymous'\n  | 'google.com'\n  | 'facebook.com'\n  | 'github.com'\n  | 'twitter.com'\n  | 'microsoft.com'\n  | 'apple.com';\n\ninterface FirebaseIdToken {\n  // Always set to https://securetoken.google.com/PROJECT_ID\n  iss: string;\n\n  // Always set to PROJECT_ID\n  aud: string;\n\n  // The user's unique ID\n  sub: string;\n\n  // The token issue time, in seconds since epoch\n  iat: number;\n\n  // The token expiry time, normally 'iat' + 3600\n  exp: number;\n\n  // The user's unique ID. Must be equal to 'sub'\n  user_id: string;\n\n  // The time the user authenticated, normally 'iat'\n  auth_time: number;\n\n  // The sign in provider, only set when the provider is 'anonymous'\n  provider_id?: 'anonymous';\n\n  // The user's primary email\n  email?: string;\n\n  // The user's email verification status\n  email_verified?: boolean;\n\n  // The user's primary phone number\n  phone_number?: string;\n\n  // The user's display name\n  name?: string;\n\n  // The user's profile photo URL\n  picture?: string;\n\n  // Information on all identities linked to this user\n  firebase: {\n    // The primary sign-in provider\n    sign_in_provider: FirebaseSignInProvider;\n\n    // A map of providers to the user's list of unique identifiers from\n    // each provider\n    identities?: { [provider in FirebaseSignInProvider]?: string[] };\n  };\n\n  // Custom claims set by the developer\n  [claim: string]: unknown;\n\n  uid?: never; // Try to catch a common mistake of \"uid\" (should be \"sub\" instead).\n}\n\nexport type EmulatorMockTokenOptions = ({ user_id: string } | { sub: string }) &\n  Partial<FirebaseIdToken>;\n\nexport function createMockUserToken(\n  token: EmulatorMockTokenOptions,\n  projectId?: string\n): string {\n  if (token.uid) {\n    throw new Error(\n      'The \"uid\" field is no longer supported by mockUserToken. Please use \"sub\" instead for Firebase Auth User ID.'\n    );\n  }\n  // Unsecured JWTs use \"none\" as the algorithm.\n  const header = {\n    alg: 'none',\n    type: 'JWT'\n  };\n\n  const project = projectId || 'demo-project';\n  const iat = token.iat || 0;\n  const sub = token.sub || token.user_id;\n  if (!sub) {\n    throw new Error(\"mockUserToken must contain 'sub' or 'user_id' field!\");\n  }\n\n  const payload: FirebaseIdToken = {\n    // Set all required fields to decent defaults\n    iss: `https://securetoken.google.com/${project}`,\n    aud: project,\n    iat,\n    exp: iat + 3600,\n    auth_time: iat,\n    sub,\n    user_id: sub,\n    firebase: {\n      sign_in_provider: 'custom',\n      identities: {}\n    },\n\n    // Override with user options\n    ...token\n  };\n\n  // Unsecured JWTs use the empty string as a signature.\n  const signature = '';\n  return [\n    base64urlEncodeWithoutPadding(JSON.stringify(header)),\n    base64urlEncodeWithoutPadding(JSON.stringify(payload)),\n    signature\n  ].join('.');\n}\n","/**\n * @license\n * Copyright 2019 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nimport {\n  InstantiationMode,\n  InstanceFactory,\n  ComponentType,\n  Dictionary,\n  Name,\n  onInstanceCreatedCallback\n} from './types';\n\n/**\n * Component for service name T, e.g. `auth`, `auth-internal`\n */\nexport class Component<T extends Name = Name> {\n  multipleInstances = false;\n  /**\n   * Properties to be added to the service namespace\n   */\n  serviceProps: Dictionary = {};\n\n  instantiationMode = InstantiationMode.LAZY;\n\n  onInstanceCreated: onInstanceCreatedCallback<T> | null = null;\n\n  /**\n   *\n   * @param name The public service name, e.g. app, auth, firestore, database\n   * @param instanceFactory Service factory responsible for creating the public interface\n   * @param type whether the service provided by the component is public or private\n   */\n  constructor(\n    readonly name: T,\n    readonly instanceFactory: InstanceFactory<T>,\n    readonly type: ComponentType\n  ) {}\n\n  setInstantiationMode(mode: InstantiationMode): this {\n    this.instantiationMode = mode;\n    return this;\n  }\n\n  setMultipleInstances(multipleInstances: boolean): this {\n    this.multipleInstances = multipleInstances;\n    return this;\n  }\n\n  setServiceProps(props: Dictionary): this {\n    this.serviceProps = props;\n    return this;\n  }\n\n  setInstanceCreatedCallback(callback: onInstanceCreatedCallback<T>): this {\n    this.onInstanceCreated = callback;\n    return this;\n  }\n}\n"],"names":["stringToByteArray","str","out","p","i","length","c","charCodeAt","base64","byteToCharMap_","charToByteMap_","byteToCharMapWebSafe_","charToByteMapWebSafe_","ENCODED_VALS_BASE","ENCODED_VALS","this","ENCODED_VALS_WEBSAFE","HAS_NATIVE_SUPPORT","atob","encodeByteArray","input","webSafe","Array","isArray","Error","init_","byteToCharMap","output","byte1","haveByte2","byte2","haveByte3","byte3","outByte1","outByte2","outByte3","outByte4","push","join","encodeString","btoa","decodeString","bytes","pos","c1","String","fromCharCode","c2","u","c3","byteArrayToString","decodeStringToByteArray","charToByteMap","charAt","byte4","DecodeBase64StringError","constructor","name","base64urlEncodeWithoutPadding","utf8Bytes","base64Encode","replace","getDefaultsFromGlobal","self","window","global","getGlobal","__FIREBASE_DEFAULTS__","getDefaultsFromCookie","document","match","cookie","e","decoded","console","error","base64Decode","JSON","parse","getDefaults","process","env","defaultsJsonString","getDefaultsFromEnvVariable","info","getDefaultEmulatorHostnameAndPort","productName","host","_a","_b","emulatorHosts","getDefaultEmulatorHost","separatorIndex","lastIndexOf","port","parseInt","substring","FirebaseError","code","message","customData","super","Object","setPrototypeOf","prototype","captureStackTrace","ErrorFactory","create","service","serviceName","errors","data","fullCode","template","PATTERN","_","key","value","replaceTemplate","fullMessage","deepEqual","a","b","aKeys","keys","bKeys","k","includes","aProp","bProp","isObject","thing","getModularInstance","_delegate","LogLevel","levelStringToEnum","debug","DEBUG","verbose","VERBOSE","INFO","warn","WARN","ERROR","silent","SILENT","defaultLogLevel","ConsoleMethod","defaultLogHandler","instance","logType","args","logLevel","now","Date","toISOString","method","d","t","uid","isAuthenticated","toKey","isEqual","UNAUTHENTICATED","GOOGLE_CREDENTIALS","FIRST_PARTY","MOCK_USER","w","m","_logLevel","_logHandler","_userLogHandler","val","TypeError","setLogLevel","logHandler","userLogHandler","log","y","n","map","v","g","stringify","E","I","A","R","P","V","$","D","F","x","S","q","O","C","M","U","toString","j","promise","Promise","resolve","reject","B","user","type","headers","Map","set","Q","getToken","invalidateToken","start","enqueueRetryable","shutdown","z","token","changeListener","W","auth","onInit","then","accessToken","getUid","G","o","h","K","Y","H","l","appCheck","J","r","s","databaseId","appId","persistenceKey","ssl","forceLongPolling","autoDetectLongPolling","longPollingOptions","useFetchStreams","X","projectId","database","static","isDefaultDatabase","Z","segments","offset","len","comparator","child","slice","limit","forEach","construct","popFirst","popLast","firstSegment","lastSegment","get","isEmpty","isPrefixOf","isImmediateParentOf","toArray","Math","min","tt","canonicalString","indexOf","split","filter","et","nt","test","isValidIdentifier","isKeyField","rt","path","fromString","emptyPath","collectionGroup","hasCollectionId","getCollectionGroup","getCollectionPath","st","it","isDocumentKey","ot","ut","ct","at","ht","timeoutSeconds","lt","dt","wt","mt","BatchGetDocuments","Commit","RunQuery","RunAggregationQuery","pt","yt","gt","OK","CANCELLED","UNKNOWN","INVALID_ARGUMENT","DEADLINE_EXCEEDED","NOT_FOUND","ALREADY_EXISTS","PERMISSION_DENIED","RESOURCE_EXHAUSTED","FAILED_PRECONDITION","ABORTED","OUT_OF_RANGE","UNIMPLEMENTED","INTERNAL","UNAVAILABLE","DATA_LOSS","_t","databaseInfo","round","random","T","async","body","status","statusText","ok","json","vt","alias","fieldPath","bt","crypto","msCrypto","Uint8Array","getRandomValues","floor","Et","It","Tt","every","At","hasOwnProperty","call","Rt","Pt","arguments","Vt","binaryString","DOMException","Symbol","iterator","next","done","toBase64","toUint8Array","approximateByteSize","compareTo","EMPTY_BYTE_STRING","$t","RegExp","Nt","exec","substr","Number","seconds","getTime","nanos","Dt","Ft","fromBase64String","fromUint8Array","xt","nanoseconds","fromMillis","toDate","toMillis","_compareTo","toJSON","valueOf","padStart","St","mapValue","fields","__type__","stringValue","qt","__previous_value__","Ot","__local_write_time__","timestampValue","kt","Ct","Mt","booleanValue","bytesValue","referenceValue","geoPointValue","latitude","longitude","integerValue","doubleValue","isNaN","arrayValue","values","Lt","find","Ut","jt","sort","Bt","Qt","zt","Wt","Gt","Kt","assign","Yt","position","inclusive","Ht","Jt","Xt","field","op","createKeyFieldInFilter","ee","ie","oe","ue","ce","ne","re","matches","matchesComparison","isInequality","getFlattenedFilters","getFilters","getFirstInequalityField","Zt","filters","reduce","concat","te","fromName","se","some","nullValue","ae","dir","he","le","timestamp","toMicroseconds","toTimestamp","fe","root","we","EMPTY","insert","copy","BLACK","remove","left","right","size","minKey","maxKey","inorderTraversal","reverseTraversal","getIterator","de","getIteratorFrom","getReverseIterator","getReverseIteratorFrom","isReverse","nodeStack","getNext","pop","hasNext","peek","color","RED","fixUp","removeMin","isRed","moveRedLeft","rotateRight","moveRedRight","rotateLeft","colorFlip","checkMaxDepth","check","pow","me","has","first","last","forEachInRange","forEachWhile","firstAfterOrEqual","pe","add","delete","unionWith","iter","ye","covers","ge","getFieldsMap","setAll","applyChanges","clone","_e","documentType","version","readTime","createTime","documentState","empty","convertToFoundDocument","convertToNoDocument","convertToUnknownDocument","setHasCommittedMutations","setHasLocalMutations","setReadTime","hasLocalMutations","hasCommittedMutations","hasPendingWrites","isValidDocument","isFoundDocument","isNoDocument","isUnknownDocument","mutableCopy","ve","orderBy","startAt","endAt","be","Ee","explicitOrderBy","limitType","Ie","Te","Ae","Re","keyField","Pe","Ve","Ne","isInteger","MAX_SAFE_INTEGER","MIN_SAFE_INTEGER","useProto3Json","De","Fe","xe","elements","Se","qe","serializer","Oe","transform","ke","updateTime","exists","isNone","Ce","Me","precondition","fieldTransforms","getFieldMask","Le","fieldMask","Ue","je","Be","asc","desc","Qe","in","ze","and","or","We","Ge","Ke","Ye","He","fromTimestamp","Je","Xe","Ze","dn","tn","en","nn","on","structuredQuery","parent","from","collectionId","allDescendants","ln","where","hn","direction","un","before","cn","an","unaryFilter","fieldFilter","compositeFilter","fn","fieldPaths","wn","mn","timerId","L","reset","cancel","max","enqueueAfterDelay","skipDelay","pn","authCredentials","appCheckCredentials","connection","all","catch","terminate","yn","writes","update","updateMask","verify","updateTransforms","setToServerValue","appendMissingElements","removeAllFromArray","increment","currentDocument","sn","gn","documents","found","newFoundDocument","missing","newNoDocument","rn","bn","En","_terminated","fetch","bind","_databaseId","app","options","_persistenceKey","_freezeSettings","experimentalForceLongPolling","experimentalAutoDetectLongPolling","experimentalLongPollingOptions","_authCredentials","_appCheckCredentials","In","credentials","ignoreUndefinedProperties","cache","localCache","cacheSizeBytes","Tn","_app","_settings","_settingsFrozen","_initialized","_terminateTask","_setSettings","sessionIndex","iamToken","authTokenFactory","client","_getSettings","_delete","_terminate","settings","An","_getProvider","isInitialized","initialize","instanceIdentifier","Rn","getImmediate","identifier","Pn","mockUserToken","project","iat","sub","user_id","payload","iss","aud","exp","auth_time","firebase","sign_in_provider","identities","alg","Vn","$n","_aggregateType","_internalFieldPath","Nn","_userDataWriter","_data","query","convertObjectMap","Dn","converter","_key","firestore","_path","id","xn","withConverter","Fn","_query","Sn","qn","On","N","kn","Cn","$e","Mn","_byteString","Ln","_internalPath","Un","jn","_methodName","Bn","isFinite","_lat","_long","Qn","zn","toMutation","Wn","Gn","Kn","wr","methodName","contains","Yn","ft","Hn","Jn","merge","mergeFields","hr","cr","lr","mr","Xn","_toFieldTransform","Zn","tr","er","ur","nr","rr","sr","dr","ir","f","ar","fromDate","getPrototypeOf","fr","search","pr","_firestore","_document","_converter","ref","yr","fromFirestore","convertValue","vr","gr","_docs","docs","_r","br","Er","Ir","Rr","Tr","_apply","_field","_op","_value","_parse","Br","jr","Ur","Ar","_create","_queryConstraints","_getOperator","_getQueryConstraints","Pr","zr","Vr","$r","_direction","Qr","Nr","Dr","_limit","_limitType","Fr","xr","Sr","_docOrFields","_inclusive","Lr","qr","Or","kr","Cr","Mr","Wr","toFirestore","Gr","convertTimestamp","convertServerTimestamp","convertBytes","convertReference","convertGeoPoint","convertArray","convertObject","convertDocumentKey","Kr","Yr","_n","reverse","Hr","none","Jr","Xr","Zr","ts","es","count","ss","request","avg","sum","structuredAggregationQuery","aggregations","result","aggregateFields","vn","ns","rs","is","os","us","cs","as","hs","ls","fs","_commitHandler","_mutations","_committed","_dataReader","_verifyNotCommitted","ds","commit","ws","ms","datastore","readVersions","mutations","committed","lastWriteError","writtenDocs","Set","ensureCommitNotCalled","recordVersion","write","preconditionForUpdate","fromPath","ps","maxAttempts","ys","asyncQueue","updateFunction","deferred","run","enqueueAndForget","gs","_s","targetTimeMs","removalCallback","timerHandle","setTimeout","handleDelayElapsed","clearTimeout","vs","visibilityState","addEventListener","isShuttingDown","enqueue","enqueueAndForgetEvenWhileRestricted","enterRestrictedMode","removeEventListener","shift","stack","createAndSchedule","verifyOperationInProgress","splice","bs","_transaction","lookup","Es","instanceFactory","multipleInstances","serviceProps","instantiationMode","onInstanceCreated","setInstantiationMode","mode","setMultipleInstances","setServiceProps","props","setInstanceCreatedCallback","callback","getProvider","apply"],"mappings":"mJAiBA,MAAMA,EAAoB,SAAUC,GAElC,MAAMC,EAAgB,GACtB,IAAIC,EAAI,EACR,IAAK,IAAIC,EAAI,EAAGA,EAAIH,EAAII,OAAQD,IAAK,CACnC,IAAIE,EAAIL,EAAIM,WAAWH,GACnBE,EAAI,IACNJ,EAAIC,KAAOG,EACFA,EAAI,MACbJ,EAAIC,KAAQG,GAAK,EAAK,IACtBJ,EAAIC,KAAY,GAAJG,EAAU,KAEL,QAAZ,MAAJA,IACDF,EAAI,EAAIH,EAAII,QACyB,QAAZ,MAAxBJ,EAAIM,WAAWH,EAAI,KAGpBE,EAAI,QAAgB,KAAJA,IAAe,KAA6B,KAAtBL,EAAIM,aAAaH,IACvDF,EAAIC,KAAQG,GAAK,GAAM,IACvBJ,EAAIC,KAASG,GAAK,GAAM,GAAM,IAC9BJ,EAAIC,KAASG,GAAK,EAAK,GAAM,IAC7BJ,EAAIC,KAAY,GAAJG,EAAU,MAEtBJ,EAAIC,KAAQG,GAAK,GAAM,IACvBJ,EAAIC,KAASG,GAAK,EAAK,GAAM,IAC7BJ,EAAIC,KAAY,GAAJG,EAAU,KAG1B,OAAOJ,GA6DIM,EAAiB,CAI5BC,eAAgB,KAKhBC,eAAgB,KAMhBC,sBAAuB,KAMvBC,sBAAuB,KAMvBC,kBACE,iEAKEC,mBACF,OAAOC,KAAKF,kBAAoB,OAM9BG,2BACF,OAAOD,KAAKF,kBAAoB,OAUlCI,mBAAoC,mBAATC,KAW3BC,gBAAgBC,EAA8BC,GAC5C,IAAKC,MAAMC,QAAQH,GACjB,MAAMI,MAAM,iDAGdT,KAAKU,QAEL,MAAMC,EAAgBL,EAClBN,KAAKJ,sBACLI,KAAKN,eAEHkB,EAAS,GAEf,IAAK,IAAIvB,EAAI,EAAGA,EAAIgB,EAAMf,OAAQD,GAAK,EAAG,CACxC,MAAMwB,EAAQR,EAAMhB,GACdyB,EAAYzB,EAAI,EAAIgB,EAAMf,OAC1ByB,EAAQD,EAAYT,EAAMhB,EAAI,GAAK,EACnC2B,EAAY3B,EAAI,EAAIgB,EAAMf,OAC1B2B,EAAQD,EAAYX,EAAMhB,EAAI,GAAK,EAEnC6B,EAAWL,GAAS,EACpBM,GAAqB,EAARN,IAAiB,EAAME,GAAS,EACnD,IAAIK,GAAqB,GAARL,IAAiB,EAAME,GAAS,EAC7CI,EAAmB,GAARJ,EAEVD,IACHK,EAAW,GAENP,IACHM,EAAW,KAIfR,EAAOU,KACLX,EAAcO,GACdP,EAAcQ,GACdR,EAAcS,GACdT,EAAcU,IAIlB,OAAOT,EAAOW,KAAK,KAWrBC,aAAanB,EAAeC,GAG1B,OAAIN,KAAKE,qBAAuBI,EACvBmB,KAAKpB,GAEPL,KAAKI,gBAAgBnB,EAAkBoB,GAAQC,IAWxDoB,aAAarB,EAAeC,GAG1B,OAAIN,KAAKE,qBAAuBI,EACvBH,KAAKE,GA3LQ,SAAUsB,GAElC,MAAMxC,EAAgB,GACtB,IAAIyC,EAAM,EACRrC,EAAI,EACN,KAAOqC,EAAMD,EAAMrC,QAAQ,CACzB,MAAMuC,EAAKF,EAAMC,KACjB,GAAIC,EAAK,IACP1C,EAAII,KAAOuC,OAAOC,aAAaF,QAC1B,GAAIA,EAAK,KAAOA,EAAK,IAAK,CAC/B,MAAMG,EAAKL,EAAMC,KACjBzC,EAAII,KAAOuC,OAAOC,cAAoB,GAALF,IAAY,EAAW,GAALG,QAC9C,GAAIH,EAAK,KAAOA,EAAK,IAAK,CAE/B,MAGMI,IACI,EAALJ,IAAW,IAAa,GAJlBF,EAAMC,OAImB,IAAa,GAHtCD,EAAMC,OAGuC,EAAW,GAFxDD,EAAMC,MAGf,MACFzC,EAAII,KAAOuC,OAAOC,aAAa,OAAUE,GAAK,KAC9C9C,EAAII,KAAOuC,OAAOC,aAAa,OAAc,KAAJE,QACpC,CACL,MAAMD,EAAKL,EAAMC,KACXM,EAAKP,EAAMC,KACjBzC,EAAII,KAAOuC,OAAOC,cACT,GAALF,IAAY,IAAa,GAALG,IAAY,EAAW,GAALE,IAI9C,OAAO/C,EAAIoC,KAAK,IA+JPY,CAAkBnC,KAAKoC,wBAAwB/B,EAAOC,KAkB/D8B,wBAAwB/B,EAAeC,GACrCN,KAAKU,QAEL,MAAM2B,EAAgB/B,EAClBN,KAAKH,sBACLG,KAAKL,eAEHiB,EAAmB,GAEzB,IAAK,IAAIvB,EAAI,EAAGA,EAAIgB,EAAMf,QAAU,CAClC,MAAMuB,EAAQwB,EAAchC,EAAMiC,OAAOjD,MAGnC0B,EADY1B,EAAIgB,EAAMf,OACF+C,EAAchC,EAAMiC,OAAOjD,IAAM,IACzDA,EAEF,MACM4B,EADY5B,EAAIgB,EAAMf,OACF+C,EAAchC,EAAMiC,OAAOjD,IAAM,KACzDA,EAEF,MACMkD,EADYlD,EAAIgB,EAAMf,OACF+C,EAAchC,EAAMiC,OAAOjD,IAAM,GAG3D,KAFEA,EAEW,MAATwB,GAA0B,MAATE,GAA0B,MAATE,GAA0B,MAATsB,EACrD,MAAM,IAAIC,EAGZ,MAAMtB,EAAYL,GAAS,EAAME,GAAS,EAG1C,GAFAH,EAAOU,KAAKJ,GAEE,KAAVD,EAAc,CAChB,MAAME,EAAaJ,GAAS,EAAK,IAASE,GAAS,EAGnD,GAFAL,EAAOU,KAAKH,GAEE,KAAVoB,EAAc,CAChB,MAAMnB,EAAaH,GAAS,EAAK,IAAQsB,EACzC3B,EAAOU,KAAKF,KAKlB,OAAOR,GAQTF,QACE,IAAKV,KAAKN,eAAgB,CACxBM,KAAKN,eAAiB,GACtBM,KAAKL,eAAiB,GACtBK,KAAKJ,sBAAwB,GAC7BI,KAAKH,sBAAwB,GAG7B,IAAK,IAAIR,EAAI,EAAGA,EAAIW,KAAKD,aAAaT,OAAQD,IAC5CW,KAAKN,eAAeL,GAAKW,KAAKD,aAAauC,OAAOjD,GAClDW,KAAKL,eAAeK,KAAKN,eAAeL,IAAMA,EAC9CW,KAAKJ,sBAAsBP,GAAKW,KAAKC,qBAAqBqC,OAAOjD,GACjEW,KAAKH,sBAAsBG,KAAKJ,sBAAsBP,IAAMA,EAGxDA,GAAKW,KAAKF,kBAAkBR,SAC9BU,KAAKL,eAAeK,KAAKC,qBAAqBqC,OAAOjD,IAAMA,EAC3DW,KAAKH,sBAAsBG,KAAKD,aAAauC,OAAOjD,IAAMA,MAU9D,MAAOmD,UAAgC/B,MAA7CgC,kCACWzC,KAAI0C,KAAG,2BAMX,MASMC,EAAgC,SAAUzD,GAErD,OAX0B,SAAUA,GACpC,MAAM0D,EAAY3D,EAAkBC,GACpC,OAAOO,EAAOW,gBAAgBwC,GAAW,GASlCC,CAAa3D,GAAK4D,QAAQ,MAAO,KC7S1C,MAAMC,EAAwB,ICjCd,WACd,GAAoB,oBAATC,KACT,OAAOA,KAET,GAAsB,oBAAXC,OACT,OAAOA,OAET,GAAsB,oBAAXC,OACT,OAAOA,OAET,MAAM,IAAIzC,MAAM,mCDwBhB0C,GAAYC,sBAoBRC,EAAwB,KAC5B,GAAwB,oBAAbC,SACT,OAEF,IAAIC,EACJ,IACEA,EAAQD,SAASE,OAAOD,MAAM,iCAC9B,MAAOE,GAGP,OAEF,MAAMC,EAAUH,GDwRU,SAAUrE,GACpC,IACE,OAAOO,EAAOiC,aAAaxC,GAAK,GAChC,MAAOuE,GACPE,QAAQC,MAAM,wBAAyBH,GAEzC,OAAO,KC9RkBI,CAAaN,EAAM,IAC5C,OAAOG,GAAWI,KAAKC,MAAML,IAUlBM,EAAc,KACzB,IACE,OACEjB,KApC6B,MACjC,GAAuB,oBAAZkB,cAAkD,IAAhBA,QAAQC,IACnD,OAEF,MAAMC,EAAqBF,QAAQC,IAAId,sBACvC,OAAIe,EACKL,KAAKC,MAAMI,QADpB,GAgCIC,IACAf,IAEF,MAAOI,GAQP,YADAE,QAAQU,KAAK,+CAA+CZ,OAqBnDa,EACXC,IAEA,MAAMC,EAb8B,CACpCD,IACuB,IAAAE,EAAAC,EAAA,OAA4B,QAA5BA,EAAe,QAAfD,EAAAT,WAAe,IAAAS,OAAA,EAAAA,EAAAE,qBAAa,IAAAD,OAAA,EAAAA,EAAGH,IAWzCK,CAAuBL,GACpC,IAAKC,EACH,OAEF,MAAMK,EAAiBL,EAAKM,YAAY,KACxC,GAAID,GAAkB,GAAKA,EAAiB,IAAML,EAAKlF,OACrD,MAAM,IAAImB,MAAM,gBAAgB+D,yCAGlC,MAAMO,EAAOC,SAASR,EAAKS,UAAUJ,EAAiB,GAAI,IAC1D,MAAgB,MAAZL,EAAK,GAEA,CAACA,EAAKS,UAAU,EAAGJ,EAAiB,GAAIE,GAExC,CAACP,EAAKS,UAAU,EAAGJ,GAAiBE,IE9EzC,MAAOG,UAAsBzE,MAIjCgC,YAEW0C,EACTC,EAEOC,GAEPC,MAAMF,GALGpF,KAAImF,KAAJA,EAGFnF,KAAUqF,WAAVA,EAPArF,KAAI0C,KAdI,gBA2Bf6C,OAAOC,eAAexF,KAAMkF,EAAcO,WAItChF,MAAMiF,mBACRjF,MAAMiF,kBAAkB1F,KAAM2F,EAAaF,UAAUG,SAK9C,MAAAD,EAIXlD,YACmBoD,EACAC,EACAC,GAFA/F,KAAO6F,QAAPA,EACA7F,KAAW8F,YAAXA,EACA9F,KAAM+F,OAANA,EAGnBH,OACET,KACGa,GAEH,MAAMX,EAAcW,EAAK,IAAoB,GACvCC,EAAW,GAAGjG,KAAK6F,WAAWV,IAC9Be,EAAWlG,KAAK+F,OAAOZ,GAEvBC,EAAUc,EAUpB,SAAyBA,EAAkBF,GACzC,OAAOE,EAASpD,QAAQqD,GAAS,CAACC,EAAGC,KACnC,MAAMC,EAAQN,EAAKK,GACnB,OAAgB,MAATC,EAAgBxE,OAAOwE,GAAS,IAAID,SAbhBE,CAAgBL,EAAUb,GAAc,QAE7DmB,EAAc,GAAGxG,KAAK8F,gBAAgBV,MAAYa,MAIxD,OAFc,IAAIf,EAAce,EAAUO,EAAanB,IAa3D,MAAMc,EAAU,gBC3EA,SAAAM,EAAUC,EAAWC,GACnC,GAAID,IAAMC,EACR,OAAO,EAGT,MAAMC,EAAQrB,OAAOsB,KAAKH,GACpBI,EAAQvB,OAAOsB,KAAKF,GAC1B,IAAK,MAAMI,KAAKH,EAAO,CACrB,IAAKE,EAAME,SAASD,GAClB,OAAO,EAGT,MAAME,EAASP,EAA8BK,GACvCG,EAASP,EAA8BI,GAC7C,GAAII,EAASF,IAAUE,EAASD,IAC9B,IAAKT,EAAUQ,EAAOC,GACpB,OAAO,OAEJ,GAAID,IAAUC,EACnB,OAAO,EAIX,IAAK,MAAMH,KAAKD,EACd,IAAKF,EAAMI,SAASD,GAClB,OAAO,EAGX,OAAO,EAGT,SAASI,EAASC,GAChB,OAAiB,OAAVA,GAAmC,iBAAVA,ECrE5B,SAAUC,EACdxB,GAEA,OAAIA,GAAYA,EAA+ByB,UACrCzB,EAA+ByB,UAEhCzB,MC2BC0B,GAAZ,SAAYA,GACVA,EAAAA,EAAA,MAAA,GAAA,QACAA,EAAAA,EAAA,QAAA,GAAA,UACAA,EAAAA,EAAA,KAAA,GAAA,OACAA,EAAAA,EAAA,KAAA,GAAA,OACAA,EAAAA,EAAA,MAAA,GAAA,QACAA,EAAAA,EAAA,OAAA,GAAA,SANF,CAAYA,IAAAA,EAOX,KAED,MAAMC,EAA2D,CAC/DC,MAASF,EAASG,MAClBC,QAAWJ,EAASK,QACpBvD,KAAQkD,EAASM,KACjBC,KAAQP,EAASQ,KACjBnE,MAAS2D,EAASS,MAClBC,OAAUV,EAASW,QAMfC,EAA4BZ,EAASM,KAmBrCO,EAAgB,CACpB,CAACb,EAASG,OAAQ,MAClB,CAACH,EAASK,SAAU,MACpB,CAACL,EAASM,MAAO,OACjB,CAACN,EAASQ,MAAO,OACjB,CAACR,EAASS,OAAQ,SAQdK,EAAgC,CAACC,EAAUC,KAAYC,KAC3D,GAAID,EAAUD,EAASG,SACrB,OAEF,MAAMC,GAAM,IAAIC,MAAOC,cACjBC,EAAST,EAAcG,GAC7B,IAAIM,EAMF,MAAM,IAAIpI,MACR,8DAA8D8H,MANhE5E,QAAQkF,GACN,IAAIH,OAASJ,EAAS5F,WACnB8F,ICxFT,MAAMM,EACFrG,YAAYsG,GACR/I,KAAKgJ,IAAMD,EAEfE,kBACI,OAAO,MAAQjJ,KAAKgJ,IAKjBE,QACH,OAAOlJ,KAAKiJ,kBAAoB,OAASjJ,KAAKgJ,IAAM,iBAExDG,QAAQJ,GACJ,OAAOA,EAAEC,MAAQhJ,KAAKgJ,KAICF,EAAEM,gBAAkB,IAAIN,EAAE,MAGzDA,EAAEO,mBAAqB,IAAIP,EAAE,0BAA2BA,EAAEQ,YAAc,IAAIR,EAAE,mBAC9EA,EAAES,UAAY,IAAIT,EAAE,aAkBpB,IAAIU,EAAI,SAkBR,MAAMC,EAAI,IDuCG,MAOXhH,YAAmBC,GAAA1C,KAAI0C,KAAJA,EAUX1C,KAAS0J,UAAGvB,EAsBZnI,KAAW2J,YAAetB,EAc1BrI,KAAe4J,gBAAsB,KAlCzCnB,eACF,OAAOzI,KAAK0J,UAGVjB,aAASoB,GACX,KAAMA,KAAOtC,GACX,MAAM,IAAIuC,UAAU,kBAAkBD,+BAExC7J,KAAK0J,UAAYG,EAInBE,YAAYF,GACV7J,KAAK0J,UAA2B,iBAARG,EAAmBrC,EAAkBqC,GAAOA,EAQlEG,iBACF,OAAOhK,KAAK2J,YAEVK,eAAWH,GACb,GAAmB,mBAARA,EACT,MAAM,IAAIC,UAAU,qDAEtB9J,KAAK2J,YAAcE,EAOjBI,qBACF,OAAOjK,KAAK4J,gBAEVK,mBAAeJ,GACjB7J,KAAK4J,gBAAkBC,EAOzBpC,SAASe,GACPxI,KAAK4J,iBAAmB5J,KAAK4J,gBAAgB5J,KAAMuH,EAASG,SAAUc,GACtExI,KAAK2J,YAAY3J,KAAMuH,EAASG,SAAUc,GAE5C0B,OAAO1B,GACLxI,KAAK4J,iBACH5J,KAAK4J,gBAAgB5J,KAAMuH,EAASK,WAAYY,GAClDxI,KAAK2J,YAAY3J,KAAMuH,EAASK,WAAYY,GAE9CnE,QAAQmE,GACNxI,KAAK4J,iBAAmB5J,KAAK4J,gBAAgB5J,KAAMuH,EAASM,QAASW,GACrExI,KAAK2J,YAAY3J,KAAMuH,EAASM,QAASW,GAE3CV,QAAQU,GACNxI,KAAK4J,iBAAmB5J,KAAK4J,gBAAgB5J,KAAMuH,EAASQ,QAASS,GACrExI,KAAK2J,YAAY3J,KAAMuH,EAASQ,QAASS,GAE3C5E,SAAS4E,GACPxI,KAAK4J,iBAAmB5J,KAAK4J,gBAAgB5J,KAAMuH,EAASS,SAAUQ,GACtExI,KAAK2J,YAAY3J,KAAMuH,EAASS,SAAUQ,KC3H9B,uBAcZ,SAASpJ,EAAE2J,GACXU,EAAEM,YAAYhB,GAGlB,SAASoB,EAAEpB,KAAMtF,GACb,GAAIgG,EAAEhB,UAAYxG,EAAEyF,MAAO,CACvB,MAAM0C,EAAI3G,EAAE4G,IAAIC,GAChBb,EAAEhC,MAAM,cAAc+B,OAAOT,OAAQqB,IAI7C,SAASG,EAAExB,KAAMtF,GACb,GAAIgG,EAAEhB,UAAYxG,EAAE+F,MAAO,CACvB,MAAMoC,EAAI3G,EAAE4G,IAAIC,GAChBb,EAAE7F,MAAM,cAAc4F,OAAOT,OAAQqB,IAMzC,SAAShE,EAAE2C,KAAMtF,GACjB,GAAIgG,EAAEhB,UAAYxG,EAAE8F,KAAM,CACtB,MAAMqC,EAAI3G,EAAE4G,IAAIC,GAChBb,EAAE3B,KAAK,cAAc0B,OAAOT,OAAQqB,IAMxC,SAASE,EAAEvB,GACX,GAAI,iBAAmBA,EAAG,OAAOA,EACjC,IACI,OAAOtF,EAAIsF,EAAGjF,KAAK0G,UAAU/G,GAC/B,MAAOA,GAEL,OAAOsF,EAmBX,IAAItF,EA0BJ,SAASkD,EAAEoC,EAAI,oBAGf,MAAMtF,EAAI,cAAc+F,iCAAmCT,EAI3D,MAAMwB,EAAE9G,GAAI,IAAIhD,MAAMgD,GAQtB,SAASgH,EAAE1B,EAAGtF,GACdsF,GAAKpC,IAML,SAAS+D,EAAE3B,EAEftF,GACI,OAAOsF,EAkBP,MAAgB4B,EAAI,YAAaC,EAAI,UAAWC,EAAI,mBAAoBC,EAAI,oBAAqBC,EAAI,YAAmCC,EAAI,oBAAqBC,EAAI,kBAAmBC,EAAI,qBAAsBC,EAAI,sBAAuBC,EAAI,UAAWC,EAAI,eAAgBtE,EAAI,gBAAiBuE,EAAI,WAAYC,EAAI,cAE1Q,MAAMC,UAAUjM,EAE/DkD,YAIAsG,EAIAtF,GACI6B,MAAMyD,EAAGtF,GAAIzD,KAAKmF,KAAO4D,EAAG/I,KAAKoF,QAAU3B,EAI3CzD,KAAKyL,SAAW,IAAM,GAAGzL,KAAK0C,eAAe1C,KAAKmF,UAAUnF,KAAKoF,WAmBrE,MAAMsG,EACNjJ,cACIzC,KAAK2L,QAAU,IAAIC,SAAO,CAAG7C,EAAGtF,KAC5BzD,KAAK6L,QAAU9C,EAAG/I,KAAK8L,OAASrI,MAoBxC,MAAMsI,EACNtJ,YAAYsG,EAAGtF,GACXzD,KAAKgM,KAAOvI,EAAGzD,KAAKiM,KAAO,QAASjM,KAAKkM,QAAU,IAAIC,IAAKnM,KAAKkM,QAAQE,IAAI,gBAAiB,UAAUrD,MAO5G,MAAMsD,EACNC,WACI,OAAOV,QAAQC,QAAQ,MAE3BU,mBACAC,MAAMzD,EAAGtF,GAELsF,EAAE0D,kBAAgB,IAAQhJ,EAAEqF,EAAEM,mBAElCsD,aAMA,MAAMC,GACNlK,YAAYsG,GACR/I,KAAK4M,MAAQ7D,EAMb/I,KAAK6M,eAAiB,KAE1BP,WACI,OAAOV,QAAQC,QAAQ7L,KAAK4M,OAEhCL,mBACAC,MAAMzD,EAAGtF,GACLzD,KAAK6M,eAAiBpJ,EAEtBsF,EAAE0D,kBAAgB,IAAQhJ,EAAEzD,KAAK4M,MAAMZ,QAE3CU,WACI1M,KAAK6M,eAAiB,MAIe,MAAMC,GAC/CrK,YAAYsG,GACR/I,KAAK+M,KAAO,KAAMhE,EAAEiE,QAAQjE,IACxB/I,KAAK+M,KAAOhE,KAGpBuD,WACI,OAAOtM,KAAK+M,KAAO/M,KAAK+M,KAAKT,WAAWW,MAAMlE,GAAKA,GAAK0B,EAAE,iBAAmB1B,EAAEmE,aAC/E,IAAInB,EAAEhD,EAAEmE,YAAa,IAAIpE,EAAE9I,KAAK+M,KAAKI,YAAc,OAASvB,QAAQC,QAAQ,MAEhFU,mBACAC,MAAMzD,EAAGtF,IACTiJ,aASA,MAAMU,GACN3K,YAAYsG,EAAGtF,EAAG2G,GACdpK,KAAK+I,EAAIA,EAAG/I,KAAKX,EAAIoE,EAAGzD,KAAKqN,EAAIjD,EAAGpK,KAAKiM,KAAO,aAAcjM,KAAKgM,KAAOlD,EAAEQ,YAC5EtJ,KAAKiC,EAAI,IAAIkK,IAKVmB,IACH,OAAOtN,KAAKqN,EAAIrN,KAAKqN,IAAM,KAE3BnB,cACAlM,KAAKiC,EAAEmK,IAAI,kBAAmBpM,KAAK+I,GAEnC,MAAMA,EAAI/I,KAAKsN,IACf,OAAOvE,GAAK/I,KAAKiC,EAAEmK,IAAI,gBAAiBrD,GAAI/I,KAAKX,GAAKW,KAAKiC,EAAEmK,IAAI,iCAAkCpM,KAAKX,GACxGW,KAAKiC,GAQT,MAAMsL,GACN9K,YAAYsG,EAAGtF,EAAG2G,GACdpK,KAAK+I,EAAIA,EAAG/I,KAAKX,EAAIoE,EAAGzD,KAAKqN,EAAIjD,EAErCkC,WACI,OAAOV,QAAQC,QAAQ,IAAIuB,GAAEpN,KAAK+I,EAAG/I,KAAKX,EAAGW,KAAKqN,IAEtDb,MAAMzD,EAAGtF,GAELsF,EAAE0D,kBAAgB,IAAQhJ,EAAEqF,EAAEQ,eAElCoD,YACAH,oBAGJ,MAAMiB,GACF/K,YAAYsG,GACR/I,KAAKsG,MAAQyC,EAAG/I,KAAKiM,KAAO,WAAYjM,KAAKkM,QAAU,IAAIC,IAAKpD,GAAKA,EAAEzJ,OAAS,GAAKU,KAAKkM,QAAQE,IAAI,sBAAuBpM,KAAKsG,QAIzF,MAAMmH,GACnDhL,YAAYsG,GACR/I,KAAK0N,EAAI3E,EAAG/I,KAAK2N,SAAW,KAAM5E,EAAEiE,QAAQjE,IACxC/I,KAAK2N,SAAW5E,KAGxBuD,WACI,OAAOtM,KAAK2N,SAAW3N,KAAK2N,SAASrB,WAAWW,MAAMlE,GAAKA,GAAK0B,EAAE,iBAAmB1B,EAAE6D,OACvF,IAAIY,GAAEzE,EAAE6D,QAAU,OAAShB,QAAQC,QAAQ,MAE/CU,mBACAC,MAAMzD,EAAGtF,IACTiJ,aAuBJ,MAAMkB,GAmBFnL,YAAYsG,EAAGtF,EAAG2G,EAAGyD,EAAGC,EAAGzO,EAAGgO,EAAGpL,EAAG1C,GAChCS,KAAK+N,WAAahF,EAAG/I,KAAKgO,MAAQvK,EAAGzD,KAAKiO,eAAiB7D,EAAGpK,KAAKwE,KAAOqJ,EAAG7N,KAAKkO,IAAMJ,EACxF9N,KAAKmO,iBAAmB9O,EAAGW,KAAKoO,sBAAwBf,EAAGrN,KAAKqO,mBAAqBpM,EACrFjC,KAAKsO,gBAAkB/O,GAS/B,MAAMgP,GACF9L,YAAYsG,EAAGtF,GACXzD,KAAKwO,UAAYzF,EAAG/I,KAAKyO,SAAWhL,GAAK,YAE7CiL,eACI,OAAO,IAAIH,GAAE,GAAI,IAEjBI,wBACA,MAAO,cAAgB3O,KAAKyO,SAEhCtF,QAAQJ,GACJ,OAAOA,aAAawF,IAAKxF,EAAEyF,YAAcxO,KAAKwO,WAAazF,EAAE0F,WAAazO,KAAKyO,UAOvF,MAAMG,GACFnM,YAAYsG,EAAGtF,EAAG2G,QACd,IAAW3G,EAAIA,EAAI,EAAIA,EAAIsF,EAAEzJ,QAAUqH,SAAK,IAAWyD,EAAIA,EAAIrB,EAAEzJ,OAASmE,EAAI2G,EAAIrB,EAAEzJ,OAASmE,GAAKkD,IAClG3G,KAAK6O,SAAW9F,EAAG/I,KAAK8O,OAASrL,EAAGzD,KAAK+O,IAAM3E,EAE/C9K,aACA,OAAOU,KAAK+O,IAEhB5F,QAAQJ,GACJ,OAAO,IAAM6F,GAAEI,WAAWhP,KAAM+I,GAEpCkG,MAAMlG,GACF,MAAMtF,EAAIzD,KAAK6O,SAASK,MAAMlP,KAAK8O,OAAQ9O,KAAKmP,SAChD,OAAOpG,aAAa6F,GAAI7F,EAAEqG,SAASrG,IAC/BtF,EAAEnC,KAAKyH,MACLtF,EAAEnC,KAAKyH,GAAI/I,KAAKqP,UAAU5L,GAE0B0L,QAC1D,OAAOnP,KAAK8O,OAAS9O,KAAKV,OAE9BgQ,SAASvG,GACL,OAAOA,OAAI,IAAWA,EAAI,EAAIA,EAAG/I,KAAKqP,UAAUrP,KAAK6O,SAAU7O,KAAK8O,OAAS/F,EAAG/I,KAAKV,OAASyJ,GAElGwG,UACI,OAAOvP,KAAKqP,UAAUrP,KAAK6O,SAAU7O,KAAK8O,OAAQ9O,KAAKV,OAAS,GAEpEkQ,eACI,OAAOxP,KAAK6O,SAAS7O,KAAK8O,QAE9BW,cACI,OAAOzP,KAAK0P,IAAI1P,KAAKV,OAAS,GAElCoQ,IAAI3G,GACA,OAAO/I,KAAK6O,SAAS7O,KAAK8O,OAAS/F,GAEvC4G,UACI,OAAO,IAAM3P,KAAKV,OAEtBsQ,WAAW7G,GACP,GAAIA,EAAEzJ,OAASU,KAAKV,OAAQ,OAAO,EACnC,IAAK,IAAImE,EAAI,EAAGA,EAAIzD,KAAKV,OAAQmE,IAAK,GAAIzD,KAAK0P,IAAIjM,KAAOsF,EAAE2G,IAAIjM,GAAI,OAAO,EAC3E,OAAO,EAEXoM,oBAAoB9G,GAChB,GAAI/I,KAAKV,OAAS,IAAMyJ,EAAEzJ,OAAQ,OAAO,EACzC,IAAK,IAAImE,EAAI,EAAGA,EAAIzD,KAAKV,OAAQmE,IAAK,GAAIzD,KAAK0P,IAAIjM,KAAOsF,EAAE2G,IAAIjM,GAAI,OAAO,EAC3E,OAAO,EAEX2L,QAAQrG,GACJ,IAAK,IAAItF,EAAIzD,KAAK8O,OAAQ1E,EAAIpK,KAAKmP,QAAS1L,EAAI2G,EAAG3G,IAAKsF,EAAE/I,KAAK6O,SAASpL,IAE5EqM,UACI,OAAO9P,KAAK6O,SAASK,MAAMlP,KAAK8O,OAAQ9O,KAAKmP,SAEjDT,kBAAkB3F,EAAGtF,GACjB,MAAM2G,EAAI2F,KAAKC,IAAIjH,EAAEzJ,OAAQmE,EAAEnE,QAC/B,IAAK,IAAIuO,EAAI,EAAGA,EAAIzD,EAAGyD,IAAK,CACxB,MAAMzD,EAAIrB,EAAE2G,IAAI7B,GAAIC,EAAIrK,EAAEiM,IAAI7B,GAC9B,GAAIzD,EAAI0D,EAAG,OAAQ,EACnB,GAAI1D,EAAI0D,EAAG,OAAO,EAEtB,OAAO/E,EAAEzJ,OAASmE,EAAEnE,QAAU,EAAIyJ,EAAEzJ,OAASmE,EAAEnE,OAAS,EAAI,GAShE,MAAM2Q,WAAWrB,GACjBS,UAAUtG,EAAGtF,EAAG2G,GACZ,OAAO,IAAI6F,GAAGlH,EAAGtF,EAAG2G,GAExB8F,kBAII,OAAOlQ,KAAK8P,UAAUvO,KAAK,KAE/BkK,WACI,OAAOzL,KAAKkQ,kBAMTxB,qBAAqB3F,GAIxB,MAAMtF,EAAI,GACV,IAAK,MAAM2G,KAAKrB,EAAG,CACf,GAAIqB,EAAE+F,QAAQ,OAAS,EAAG,MAAM,IAAI3E,EAAEX,EAAG,oBAAoBT,0CAEjD3G,EAAEnC,QAAQ8I,EAAEgG,MAAM,KAAKC,QAAQtH,GAAKA,EAAEzJ,OAAS,KAE/D,OAAO,IAAI2Q,GAAGxM,GAElBiL,mBACI,OAAO,IAAIuB,GAAG,KAItB,MAAMK,GAAK,2BAKP,MAAMC,WAAW3B,GACjBS,UAAUtG,EAAGtF,EAAG2G,GACZ,OAAO,IAAImG,GAAGxH,EAAGtF,EAAG2G,GAKjBsE,yBAAyB3F,GAC5B,OAAOuH,GAAGE,KAAKzH,GAEnBmH,kBACI,OAAOlQ,KAAK8P,UAAUzF,KAAKtB,IAAMA,EAAIA,EAAEjG,QAAQ,MAAO,QAAQA,QAAQ,KAAM,OAC5EyN,GAAGE,kBAAkB1H,KAAOA,EAAI,IAAMA,EAAI,KAAMA,KAAKxH,KAAK,KAE9DkK,WACI,OAAOzL,KAAKkQ,kBAITQ,aACH,OAAO,IAAM1Q,KAAKV,QAAU,aAAeU,KAAK0P,IAAI,GAIjDhB,kBACH,OAAO,IAAI6B,GAAG,CAAE,aAWb7B,wBAAwB3F,GAC3B,MAAMtF,EAAI,GACV,IAAI2G,EAAI,GAAIyD,EAAI,EAChB,MAAMC,EAAI,KACN,GAAI,IAAM1D,EAAE9K,OAAQ,MAAM,IAAIkM,EAAEX,EAAG,uBAAuB9B,8EAC1DtF,EAAEnC,KAAK8I,GAAIA,EAAI,IAEnB,IAAI/K,GAAI,EACR,KAAMwO,EAAI9E,EAAEzJ,QAAU,CAClB,MAAMmE,EAAIsF,EAAE8E,GACZ,GAAI,OAASpK,EAAG,CACZ,GAAIoK,EAAI,IAAM9E,EAAEzJ,OAAQ,MAAM,IAAIkM,EAAEX,EAAG,uCAAyC9B,GAChF,MAAMtF,EAAIsF,EAAE8E,EAAI,GAChB,GAAI,OAASpK,GAAK,MAAQA,GAAK,MAAQA,EAAG,MAAM,IAAI+H,EAAEX,EAAG,qCAAuC9B,GAChGqB,GAAK3G,EAAGoK,GAAK,MACV,MAAQpK,GAAKpE,GAAKA,EAAGwO,KAAO,MAAQpK,GAAKpE,GAAK+K,GAAK3G,EAAGoK,MAAQC,IAAKD,KAE9E,GAAIC,IAAKzO,EAAG,MAAM,IAAImM,EAAEX,EAAG,2BAA6B9B,GACxD,OAAO,IAAIwH,GAAG9M,GAElBiL,mBACI,OAAO,IAAI6B,GAAG,KAsBlB,MAAMI,GACNlO,YAAYsG,GACR/I,KAAK4Q,KAAO7H,EAEhB2F,gBAAgB3F,GACZ,OAAO,IAAI4H,GAAGV,GAAGY,WAAW9H,IAEhC2F,gBAAgB3F,GACZ,OAAO,IAAI4H,GAAGV,GAAGY,WAAW9H,GAAGuG,SAAS,IAE5CZ,eACI,OAAO,IAAIiC,GAAGV,GAAGa,aAEjBC,sBACA,OAAO/Q,KAAK4Q,KAAKrB,UAAUE,cAE0CuB,gBAAgBjI,GACrF,OAAO/I,KAAK4Q,KAAKtR,QAAU,GAAKU,KAAK4Q,KAAKlB,IAAI1P,KAAK4Q,KAAKtR,OAAS,KAAOyJ,EAEkBkI,qBAC1F,OAAOjR,KAAK4Q,KAAKlB,IAAI1P,KAAK4Q,KAAKtR,OAAS,GAEyB4R,oBACjE,OAAOlR,KAAK4Q,KAAKrB,UAErBpG,QAAQJ,GACJ,OAAO,OAASA,GAAK,IAAMkH,GAAGjB,WAAWhP,KAAK4Q,KAAM7H,EAAE6H,MAE1DnF,WACI,OAAOzL,KAAK4Q,KAAKnF,WAErBiD,kBAAkB3F,EAAGtF,GACjB,OAAOwM,GAAGjB,WAAWjG,EAAE6H,KAAMnN,EAAEmN,MAEnClC,qBAAqB3F,GACjB,OAAOA,EAAEzJ,OAAS,GAAK,EAOpBoP,oBAAoB3F,GACvB,OAAO,IAAI4H,GAAG,IAAIV,GAAGlH,EAAEmG,WAmB3B,SAASiC,GAAGpI,EAAGtF,EAAG2G,GAClB,IAAKA,EAAG,MAAM,IAAIoB,EAAEX,EAAG,YAAY9B,sCAAsCtF,MAW7E,SAAS2N,GAAGrI,GACR,IAAK4H,GAAGU,cAActI,GAAI,MAAM,IAAIyC,EAAEX,EAAG,6FAA6F9B,SAASA,EAAEzJ,WAMjJ,SAASgS,GAAGvI,GACZ,GAAI4H,GAAGU,cAActI,GAAI,MAAM,IAAIyC,EAAEX,EAAG,gGAAgG9B,SAASA,EAAEzJ,WAQvJ,SAASiS,GAAGxI,GACR,QAAI,IAAWA,EAAG,MAAO,YACzB,GAAI,OAASA,EAAG,MAAO,OACvB,GAAI,iBAAmBA,EAAG,OAAOA,EAAEzJ,OAAS,KAAOyJ,EAAI,GAAGA,EAAE9D,UAAU,EAAG,UACzEnB,KAAK0G,UAAUzB,GACf,GAAI,iBAAmBA,GAAK,kBAAoBA,EAAG,MAAO,GAAKA,EAC/D,GAAI,iBAAmBA,EAAG,CACtB,GAAIA,aAAaxI,MAAO,MAAO,WAC/B,CACI,MAAMkD,EAEN,SAASsF,GACL,OAAIA,EAAEtG,YAAoBsG,EAAEtG,YAAYC,KACjC,KAFX,CAWPqG,GACO,OAAOtF,EAAI,YAAYA,WAAa,aAG5C,MAAO,mBAAqBsF,EAAI,aAAepC,IAGnD,SAAS6K,GAAGzI,EAEZtF,GACI,GAAI,cAAesF,IAGnBA,EAAIA,EAAEzB,aAAcyB,aAAatF,GAAI,CACjC,GAAIA,EAAEf,OAASqG,EAAEtG,YAAYC,KAAM,MAAM,IAAI8I,EAAEX,EAAG,uGAClD,CACI,MAAMT,EAAImH,GAAGxI,GACb,MAAM,IAAIyC,EAAEX,EAAG,kBAAkBpH,EAAEf,sBAAsB0H,MAGjE,OAAOrB,EAGX,SAAS0I,GAAG1I,EAAGtF,GACX,GAAIA,GAAK,EAAG,MAAM,IAAI+H,EAAEX,EAAG,YAAY9B,+CAA+CtF,MA0B1F,SAASiO,GAAG3I,GACR,MAAMtF,EAAI,GACV,YAAO,IAAWsF,EAAE4I,iBAAmBlO,EAAEkO,eAAiB5I,EAAE4I,gBAAiBlO,EAsB7E,IAAImO,GAAK,KA+CT,SAASC,GAAG9I,GACZ,OAAO,MAAQA,EAG6B,SAAS+I,GAAG/I,GAGxD,OAAO,IAAMA,GAAK,EAAIA,IAAK,EAAA,EAuB/B,MAAMgJ,GAAK,CACPC,kBAAmB,WACnBC,OAAQ,SACRC,SAAU,WACVC,oBAAqB,uBAkCzB,IAAIC,GAAIC,GASR,SAASC,GAAGvJ,GACR,QAAI,IAAWA,EAAG,OAAOwB,EAAE,YAAa,4BAA6BK,EAOjE,OAAQ7B,GACV,KAAK,IAEH,MA9vBM,KAgwBR,KAAK,IAEH,OAAOoC,EAKD,KAAK,IAEX,OAAOF,EAET,KAAK,IAEH,OAAOD,EAET,KAAK,IAEH,OAAOD,EAET,KAAK,IAEH,OAAOK,EAID,KAAK,IAEX,OAAOC,EAET,KAAK,IAEH,OAAOH,EAET,KAAK,IAEH,OAAOP,EAET,KAAK,IAEH,OAAOC,EAKD,KAAK,IAEX,OAAO7D,EAET,KAAK,IAEH,OAAOwE,EAET,KAAK,IAEH,OAAOT,EAET,QACE,OAAO/B,GAAK,KAAOA,EAAI,IAzzBjB,KAyzB2BA,GAAK,KAAOA,EAAI,IAAMoC,EAAIpC,GAAK,KAAOA,EAAI,IAAMuC,EAAIV,IAuBxFyH,GAAKD,KAAOA,GAAK,KAAKC,GAAGE,GAAK,GAAK,KAAMF,GAAGA,GAAGG,UAAY,GAAK,YACrEH,GAAGA,GAAGI,QAAU,GAAK,UAAWJ,GAAGA,GAAGK,iBAAmB,GAAK,mBAC9DL,GAAGA,GAAGM,kBAAoB,GAAK,oBAAqBN,GAAGA,GAAGO,UAAY,GAAK,YAC3EP,GAAGA,GAAGQ,eAAiB,GAAK,iBAAkBR,GAAGA,GAAGS,kBAAoB,GAAK,oBAC7ET,GAAGA,GAAGjJ,gBAAkB,IAAM,kBAAmBiJ,GAAGA,GAAGU,mBAAqB,GAAK,qBACjFV,GAAGA,GAAGW,oBAAsB,GAAK,sBAAuBX,GAAGA,GAAGY,QAAU,IAAM,UAC9EZ,GAAGA,GAAGa,aAAe,IAAM,eAAgBb,GAAGA,GAAGc,cAAgB,IAAM,gBACvEd,GAAGA,GAAGe,SAAW,IAAM,WAAYf,GAAGA,GAAGgB,YAAc,IAAM,cAAehB,GAAGA,GAAGiB,UAAY,IAAM,YAEpG,MAAMC,WAKN,MACI9Q,YAAYsG,GACR/I,KAAKwT,aAAezK,EAAG/I,KAAK+N,WAAahF,EAAEgF,WAC3C,MAAMtK,EAAIsF,EAAEmF,IAAM,QAAU,OAC5BlO,KAAKyJ,EAAIhG,EAAI,MAAQsF,EAAEvE,KAAMxE,KAAKZ,EAAI,YAAcY,KAAK+N,WAAWS,UAAY,cAAgBxO,KAAK+N,WAAWU,SAAW,aAE3HlE,QAGA,OAAO,EAEXD,EAAEvB,EAAGtF,EAAG2G,EAAGyD,EAAGC,GACV,MAAMzO,GA1NH,OAASuS,GAAKA,GAAK,UAAY7B,KAAK0D,MAAM,WAAa1D,KAAK2D,UAAY9B,KAC/E,KAAOA,GAAGnG,SAAS,KAyNC4B,EAAIrN,KAAK0K,EAAE3B,EAAGtF,GAC9B0G,EAAE,iBAAkB,gBAAgBpB,MAAM1J,KAAMgO,EAAGjD,GACnD,MAAMnI,EAAI,GACV,OAAOjC,KAAK2T,EAAE1R,EAAG4L,EAAGC,GAAI9N,KAAK2K,EAAE5B,EAAGsE,EAAGpL,EAAGmI,GAAG6C,MAAMxJ,IAAM0G,EAAE,iBAAkB,iBAAiBpB,MAAM1J,MAAOoE,GACzGA,KAAMA,IACF,MAAM2C,EAAE,iBAAkB,QAAQ2C,MAAM1J,wBAAyBoE,EAAG,QAAS4J,EAAG,WAAYjD,GAC5F3G,KAGRmH,EAAE7B,EAAGtF,EAAG2G,EAAGyD,EAAGC,EAAGzO,GAGb,OAAOW,KAAKsK,EAAEvB,EAAGtF,EAAG2G,EAAGyD,EAAGC,GAKvB6F,EAAE5K,EAAGtF,EAAG2G,GACXrB,EAAE,qBAAuB,eAAiBS,EAK1CT,EAAE,gBAAkB,aAAc/I,KAAKwT,aAAaxF,QAAUjF,EAAE,oBAAsB/I,KAAKwT,aAAaxF,OACxGvK,GAAKA,EAAEyI,QAAQkD,SAAS,CAAC3L,EAAG2G,IAAMrB,EAAEqB,GAAK3G,IAAK2G,GAAKA,EAAE8B,QAAQkD,UAAU3L,EAAG2G,IAAMrB,EAAEqB,GAAK3G,IAE3FiH,EAAE3B,EAAGtF,GACD,MAAM2G,EAAI2H,GAAGhJ,GACb,MAAO,GAAG/I,KAAKyJ,QAAQhG,KAAK2G,MAOhC3H,YAAYsG,EAAGtF,GACX6B,MAAMyD,GAAI/I,KAAK6K,EAAIpH,EAEvBqH,EAAE/B,EAAGtF,GACD,MAAM,IAAIhD,MAAM,oCAEpBmT,QAAQ7K,EAAGtF,EAAG2G,EAAGyD,GACb,IAAIC,EACJ,MAAMzO,EAAIyE,KAAK0G,UAAUqD,GACzB,IAAIR,EACJ,IACIA,QAAUrN,KAAK6K,EAAEpH,EAAG,CAChBoF,OAAQ,OACRqD,QAAS9B,EACTyJ,KAAMxU,IAEZ,MAAO0J,GACL,MAAMtF,EAAIsF,EACV,MAAM,IAAIyC,EAAE8G,GAAG7O,EAAEqQ,QAAS,8BAAgCrQ,EAAEsQ,YAEhE,IAAK1G,EAAE2G,GAAI,CACP,IAAIjL,QAAUsE,EAAE4G,OAChB1T,MAAMC,QAAQuI,KAAOA,EAAIA,EAAE,IAC3B,MAAMtF,EAAI,QAAUqK,EAAI,MAAQ/E,OAAI,EAASA,EAAEnF,aAAU,IAAWkK,OAAI,EAASA,EAAE1I,QACnF,MAAM,IAAIoG,EAAE8G,GAAGjF,EAAEyG,QAAS,8BAA8B,MAAQrQ,EAAIA,EAAI4J,EAAE0G,cAE9E,OAAO1G,EAAE4G,QAwCjB,MAAMC,GACFzR,YAAYsG,EAAGtF,EAAG2G,GACdpK,KAAKmU,MAAQpL,EAAG/I,KAAK+K,EAAItH,EAAGzD,KAAKoU,UAAYhK,GAwBjD,SAASiK,GAAGtL,GAEZ,MAAMtF,EAEN,oBAAsBT,OAASA,KAAKsR,QAAUtR,KAAKuR,UAAWnK,EAAI,IAAIoK,WAAWzL,GACjF,GAAItF,GAAK,mBAAqBA,EAAEgR,gBAAiBhR,EAAEgR,gBAAgBrK,QAEnE,IAAK,IAAI3G,EAAI,EAAGA,EAAIsF,EAAGtF,IAAK2G,EAAE3G,GAAKsM,KAAK2E,MAAM,IAAM3E,KAAK2D,UACzD,OAAOtJ,EAkBP,MAAMuK,GACNjG,WAEI,MAAM3F,EAAI,iEAAkEtF,EAAIsM,KAAK2E,MAAM,IAAM3L,EAAEzJ,QAAUyJ,EAAEzJ,OAEvG,IAAI8K,EAAI,GAChB,KAAMA,EAAE9K,OAAS,IAAM,CACnB,MAAMuO,EAAIwG,GAAG,IACb,IAAK,IAAIvG,EAAI,EAAGA,EAAID,EAAEvO,SAAUwO,EAGhC1D,EAAE9K,OAAS,IAAMuO,EAAEC,GAAKrK,IAAM2G,GAAKrB,EAAEzG,OAAOuL,EAAEC,GAAK/E,EAAEzJ,SAEzD,OAAO8K,GAIf,SAASwK,GAAG7L,EAAGtF,GACX,OAAOsF,EAAItF,GAAK,EAAIsF,EAAItF,EAAI,EAAI,EAGa,SAASoR,GAAG9L,EAAGtF,EAAG2G,GAC/D,OAAOrB,EAAEzJ,SAAWmE,EAAEnE,QAAUyJ,EAAE+L,OAAO,CAAC/L,EAAG8E,IAAMzD,EAAErB,EAAGtF,EAAEoK,MAkB1D,SAASkH,GAAGhM,GACZ,IAAItF,EAAI,EACR,IAAK,MAAM2G,KAAKrB,EAAGxD,OAAOE,UAAUuP,eAAeC,KAAKlM,EAAGqB,IAAM3G,IACjE,OAAOA,EAGX,SAASyR,GAAGnM,EAAGtF,GACX,IAAK,MAAM2G,KAAKrB,EAAGxD,OAAOE,UAAUuP,eAAeC,KAAKlM,EAAGqB,IAAM3G,EAAE2G,EAAGrB,EAAEqB,IAsB5E,MAAM+K,WAAW1U,MACbgC,cACI6C,SAAS8P,WAAYpV,KAAK0C,KAAO,qBA8CzC,MAAM2S,GACF5S,YAAYsG,GACR/I,KAAKsV,aAAevM,EAExB2F,wBAAwB3F,GACpB,MAAMtF,EAAI,SAASsF,GACf,IACI,OAAO5I,KAAK4I,GACd,MAAOA,GAIL,KAAM,oBAAsBwM,cAAgBxM,aAAawM,aAAe,IAAIJ,GAAG,0BAA4BpM,GAAKA,GAP9G,CAUmDA,GAC7D,OAAO,IAAIsM,GAAG5R,GAElBiL,sBAAsB3F,GAGlB,MAAMtF,EAIN,SAASsF,GACL,IAAItF,EAAI,GACR,IAAK,IAAI2G,EAAI,EAAGA,EAAIrB,EAAEzJ,SAAU8K,EAAG3G,GAAK3B,OAAOC,aAAagH,EAAEqB,IAC9D,OAAO3G,EAHX,CAOHsF,GACG,OAAO,IAAIsM,GAAG5R,GAElB,CAAC+R,OAAOC,YACJ,IAAI1M,EAAI,EACR,MAAO,CACH2M,KAAM,IAAM3M,EAAI/I,KAAKsV,aAAahW,OAAS,CACvCgH,MAAOtG,KAAKsV,aAAa9V,WAAWuJ,KACpC4M,MAAM,GACN,CACArP,WAAO,EACPqP,MAAM,IAIlBC,WACI,OAAO7M,EAAI/I,KAAKsV,aAAc7T,KAAKsH,GACnC,IAAIA,EAER8M,eACI,OAAO,SAAS9M,GACZ,MAAMtF,EAAI,IAAI+Q,WAAWzL,EAAEzJ,QAC3B,IAAK,IAAI8K,EAAI,EAAGA,EAAIrB,EAAEzJ,OAAQ8K,IAAK3G,EAAE2G,GAAKrB,EAAEvJ,WAAW4K,GACvD,OAAO3G,EAHJ,CAsBNzD,KAAKsV,cAEVQ,sBACI,OAAO,EAAI9V,KAAKsV,aAAahW,OAEjCyW,UAAUhN,GACN,OAAO6L,GAAG5U,KAAKsV,aAAcvM,EAAEuM,cAEnCnM,QAAQJ,GACJ,OAAO/I,KAAKsV,eAAiBvM,EAAEuM,cAIvCD,GAAGW,kBAAoB,IAAIX,GAAG,IAE9B,MAAMY,GAAK,IAAIC,OAAO,iDAKlB,SAASC,GAAGpN,GAIZ,GAAI0B,IAAI1B,GAAI,iBAAmBA,EAAG,CAI9B,IAAItF,EAAI,EACR,MAAM2G,EAAI6L,GAAGG,KAAKrN,GAClB,GAAI0B,IAAIL,GAAIA,EAAE,GAAI,CAEd,IAAIrB,EAAIqB,EAAE,GACVrB,GAAKA,EAAI,aAAasN,OAAO,EAAG,GAAI5S,EAAI6S,OAAOvN,GAG3C,MAAM8E,EAAI,IAAIlF,KAAKI,GAC3B,MAAO,CACHwN,QAASxG,KAAK2E,MAAM7G,EAAE2I,UAAY,KAClCC,MAAOhT,GAGf,MAAO,CACH8S,QAASG,GAAG3N,EAAEwN,SACdE,MAAOC,GAAG3N,EAAE0N,QAOhB,SAASC,GAAG3N,GAEZ,MAAO,iBAAmBA,EAAIA,EAAI,iBAAmBA,EAAIuN,OAAOvN,GAAK,EAGH,SAAS4N,GAAG5N,GAC9E,MAAO,iBAAmBA,EAAIsM,GAAGuB,iBAAiB7N,GAAKsM,GAAGwB,eAAe9N,GAkC7E,MAAM+N,GAYFrU,YAIAsG,EAIAtF,GACI,GAAIzD,KAAKuW,QAAUxN,EAAG/I,KAAK+W,YAActT,EAAGA,EAAI,EAAG,MAAM,IAAI+H,EAAEX,EAAG,uCAAyCpH,GAC3G,GAAIA,GAAK,IAAK,MAAM,IAAI+H,EAAEX,EAAG,uCAAyCpH,GACtE,GAAIsF,GAAK,YAAa,MAAM,IAAIyC,EAAEX,EAAG,mCAAqC9B,GAElE,GAAIA,GAAK,aAAc,MAAM,IAAIyC,EAAEX,EAAG,mCAAqC9B,GAMhF2F,aACH,OAAOoI,GAAGE,WAAWrO,KAAKD,OAQvBgG,gBAAgB3F,GACnB,OAAO+N,GAAGE,WAAWjO,EAAEyN,WASpB9H,kBAAkB3F,GACrB,MAAMtF,EAAIsM,KAAK2E,MAAM3L,EAAI,KAAMqB,EAAI2F,KAAK2E,MAAM,KAAO3L,EAAI,IAAMtF,IAC/D,OAAO,IAAIqT,GAAGrT,EAAG2G,GASd6M,SACH,OAAO,IAAItO,KAAK3I,KAAKkX,YAQlBA,WACH,OAAO,IAAMlX,KAAKuW,QAAUvW,KAAK+W,YAAc,IAEnDI,WAAWpO,GACP,OAAO/I,KAAKuW,UAAYxN,EAAEwN,QAAU3B,GAAG5U,KAAK+W,YAAahO,EAAEgO,aAAenC,GAAG5U,KAAKuW,QAASxN,EAAEwN,SAO1FpN,QAAQJ,GACX,OAAOA,EAAEwN,UAAYvW,KAAKuW,SAAWxN,EAAEgO,cAAgB/W,KAAK+W,YAEAtL,WAC5D,MAAO,qBAAuBzL,KAAKuW,QAAU,iBAAmBvW,KAAK+W,YAAc,IAEbK,SACtE,MAAO,CACHb,QAASvW,KAAKuW,QACdQ,YAAa/W,KAAK+W,aAMnBM,UAQH,MAAMtO,EAAI/I,KAAKuW,UAAW,YAGlB,OAAOzU,OAAOiH,GAAGuO,SAAS,GAAI,KAAO,IAAMxV,OAAO9B,KAAK+W,aAAaO,SAAS,EAAG,MAqC5F,SAASC,GAAGxO,GACZ,IAAItF,EAAG2G,EACP,MAAO,sBAAwB,QAAUA,IAAM,QAAU3G,EAAI,MAAQsF,OAAI,EAASA,EAAEyO,gBAAa,IAAW/T,OAAI,EAASA,EAAEgU,SAAW,IAAIC,gBAAa,IAAWtN,OAAI,EAASA,EAAEuN,aAQjL,SAASC,GAAG7O,GACZ,MAAMtF,EAAIsF,EAAEyO,SAASC,OAAOI,mBAC5B,OAAON,GAAG9T,GAAKmU,GAAGnU,GAAKA,EAKvB,SAASqU,GAAG/O,GACZ,MAAMtF,EAAI0S,GAAGpN,EAAEyO,SAASC,OAAOM,qBAAqBC,gBACpD,OAAO,IAAIlB,GAAGrT,EAAE8S,QAAS9S,EAAEgT,OAkB3B,MAAMwB,GAAK,CACXR,OAAQ,CACJC,SAAU,CACNC,YAAa,aAMzB,SAASO,GAAGnP,GACR,MAAO,cAAeA,EAAI,EAA8B,iBAAkBA,EAAI,EAAiC,iBAAkBA,GAAK,gBAAiBA,EAAI,EAAgC,mBAAoBA,EAAI,EAAmC,gBAAiBA,EAAI,EAAgC,eAAgBA,EAAI,EAA8B,mBAAoBA,EAAI,EAA6B,kBAAmBA,EAAI,EAAkC,eAAgBA,EAAI,EAA+B,aAAcA,EAAIwO,GAAGxO,GAAK,EAExhB,SAASA,GACL,MAAO,eAAiBA,EAAEyO,UAAY,IAAIC,QAAU,IAAIC,UAAY,IAAIC,YAD5E,CAgCC5O,GAAK,iBAA4C,GAAiCpC,IAGV,SAASwR,GAAGpP,EAAGtF,GACxF,GAAIsF,IAAMtF,EAAG,OAAO,EACpB,MAAM2G,EAAI8N,GAAGnP,GACb,GAAIqB,IAAM8N,GAAGzU,GAAI,OAAO,EACxB,OAAQ2G,GACN,KAAK,EACL,KAAK,iBACH,OAAO,EAET,KAAK,EACH,OAAOrB,EAAEqP,eAAiB3U,EAAE2U,aAE9B,KAAK,EACH,OAAON,GAAG/O,GAAGI,QAAQ2O,GAAGrU,IAE1B,KAAK,EACH,OAAO,SAASsF,EAAGtF,GACf,GAAI,iBAAmBsF,EAAEiP,gBAAkB,iBAAmBvU,EAAEuU,gBAAkBjP,EAAEiP,eAAe1Y,SAAWmE,EAAEuU,eAAe1Y,OAE/H,OAAOyJ,EAAEiP,iBAAmBvU,EAAEuU,eAC9B,MAAM5N,EAAI+L,GAAGpN,EAAEiP,gBAAiBnK,EAAIsI,GAAG1S,EAAEuU,gBACzC,OAAO5N,EAAEmM,UAAY1I,EAAE0I,SAAWnM,EAAEqM,QAAU5I,EAAE4I,MAL7C,CAML1N,EAAGtF,GAEP,KAAK,EACH,OAAOsF,EAAE4O,cAAgBlU,EAAEkU,YAE7B,KAAK,EACH,OAAO,SAAS5O,EAAGtF,GACf,OAAOkT,GAAG5N,EAAEsP,YAAYlP,QAAQwN,GAAGlT,EAAE4U,aADlC,CAELtP,EAAGtF,GAEP,KAAK,EACH,OAAOsF,EAAEuP,iBAAmB7U,EAAE6U,eAEhC,KAAK,EACH,OAAO,SAASvP,EAAGtF,GACf,OAAOiT,GAAG3N,EAAEwP,cAAcC,YAAc9B,GAAGjT,EAAE8U,cAAcC,WAAa9B,GAAG3N,EAAEwP,cAAcE,aAAe/B,GAAGjT,EAAE8U,cAAcE,WAD1H,CAEL1P,EAAGtF,GAEP,KAAK,EACH,OAAO,SAASsF,EAAGtF,GACf,GAAI,iBAAkBsF,GAAK,iBAAkBtF,EAAG,OAAOiT,GAAG3N,EAAE2P,gBAAkBhC,GAAGjT,EAAEiV,cACnF,GAAI,gBAAiB3P,GAAK,gBAAiBtF,EAAG,CAC1C,MAAM2G,EAAIsM,GAAG3N,EAAE4P,aAAc9K,EAAI6I,GAAGjT,EAAEkV,aACtC,OAAOvO,IAAMyD,EAAIiE,GAAG1H,KAAO0H,GAAGjE,GAAK+K,MAAMxO,IAAMwO,MAAM/K,GAEzD,OAAO,EANJ,CAOL9E,EAAGtF,GAEP,KAAK,EACH,OAAOoR,GAAG9L,EAAE8P,WAAWC,QAAU,GAAIrV,EAAEoV,WAAWC,QAAU,GAAIX,IAElE,KAAK,GACH,OAAO,SAASpP,EAAGtF,GACf,MAAM2G,EAAIrB,EAAEyO,SAASC,QAAU,GAAI5J,EAAIpK,EAAE+T,SAASC,QAAU,GAC5D,GAAI1C,GAAG3K,KAAO2K,GAAGlH,GAAI,OAAO,EAC5B,IAAK,MAAM9E,KAAKqB,EAAG,GAAIA,EAAE4K,eAAejM,UAAO,IAAW8E,EAAE9E,KAAOoP,GAAG/N,EAAErB,GAAI8E,EAAE9E,KAAM,OAAO,EAC3F,OAAO,EAJJ,CAMgEA,EAAGtF,GAE5E,QACE,OAAOkD,KAIf,SAASoS,GAAGhQ,EAAGtF,GACX,YAAO,KAAYsF,EAAE+P,QAAU,IAAIE,MAAMjQ,GAAKoP,GAAGpP,EAAGtF,KAGxD,SAASwV,GAAGlQ,EAAGtF,GACX,GAAIsF,IAAMtF,EAAG,OAAO,EACpB,MAAM2G,EAAI8N,GAAGnP,GAAI8E,EAAIqK,GAAGzU,GACxB,GAAI2G,IAAMyD,EAAG,OAAO+G,GAAGxK,EAAGyD,GAC1B,OAAQzD,GACN,KAAK,EACL,KAAK,iBACH,OAAO,EAET,KAAK,EACH,OAAOwK,GAAG7L,EAAEqP,aAAc3U,EAAE2U,cAE9B,KAAK,EACH,OAAO,SAASrP,EAAGtF,GACf,MAAM2G,EAAIsM,GAAG3N,EAAE2P,cAAgB3P,EAAE4P,aAAc9K,EAAI6I,GAAGjT,EAAEiV,cAAgBjV,EAAEkV,aAC1E,OAAOvO,EAAIyD,GAAK,EAAIzD,EAAIyD,EAAI,EAAIzD,IAAMyD,EAAI,EAE1C+K,MAAMxO,GAAKwO,MAAM/K,GAAK,GAAK,EAAI,EAJ5B,CAKL9E,EAAGtF,GAEP,KAAK,EACH,OAAOyV,GAAGnQ,EAAEiP,eAAgBvU,EAAEuU,gBAEhC,KAAK,EACH,OAAOkB,GAAGpB,GAAG/O,GAAI+O,GAAGrU,IAEtB,KAAK,EACH,OAAOmR,GAAG7L,EAAE4O,YAAalU,EAAEkU,aAE7B,KAAK,EACH,OAAO,SAAS5O,EAAGtF,GACf,MAAM2G,EAAIuM,GAAG5N,GAAI8E,EAAI8I,GAAGlT,GACxB,OAAO2G,EAAE2L,UAAUlI,GAFhB,CAGL9E,EAAEsP,WAAY5U,EAAE4U,YAEpB,KAAK,EACH,OAAO,SAAStP,EAAGtF,GACf,MAAM2G,EAAIrB,EAAEqH,MAAM,KAAMvC,EAAIpK,EAAE2M,MAAM,KACpC,IAAK,IAAIrH,EAAI,EAAGA,EAAIqB,EAAE9K,QAAUyJ,EAAI8E,EAAEvO,OAAQyJ,IAAK,CAC/C,MAAMtF,EAAImR,GAAGxK,EAAErB,GAAI8E,EAAE9E,IACrB,GAAI,IAAMtF,EAAG,OAAOA,EAExB,OAAOmR,GAAGxK,EAAE9K,OAAQuO,EAAEvO,QANnB,CAOLyJ,EAAEuP,eAAgB7U,EAAE6U,gBAExB,KAAK,EACH,OAAO,SAASvP,EAAGtF,GACf,MAAM2G,EAAIwK,GAAG8B,GAAG3N,EAAEyP,UAAW9B,GAAGjT,EAAE+U,WAClC,OAAI,IAAMpO,EAAUA,EACbwK,GAAG8B,GAAG3N,EAAE0P,WAAY/B,GAAGjT,EAAEgV,YAH7B,CAIL1P,EAAEwP,cAAe9U,EAAE8U,eAEvB,KAAK,EACH,OAAO,SAASxP,EAAGtF,GACf,MAAM2G,EAAIrB,EAAE+P,QAAU,GAAIjL,EAAIpK,EAAEqV,QAAU,GAC1C,IAAK,IAAI/P,EAAI,EAAGA,EAAIqB,EAAE9K,QAAUyJ,EAAI8E,EAAEvO,SAAUyJ,EAAG,CAC/C,MAAMtF,EAAIwV,GAAG7O,EAAErB,GAAI8E,EAAE9E,IACrB,GAAItF,EAAG,OAAOA,EAElB,OAAOmR,GAAGxK,EAAE9K,OAAQuO,EAAEvO,QANnB,CAOLyJ,EAAE8P,WAAYpV,EAAEoV,YAEpB,KAAK,GACH,OAAO,SAAS9P,EAAGtF,GACf,GAAIsF,IAAMkP,IAAMxU,IAAMwU,GAAI,OAAO,EACjC,GAAIlP,IAAMkP,GAAI,OAAO,EACrB,GAAIxU,IAAMwU,GAAI,OAAQ,EACtB,MAAM7N,EAAIrB,EAAE0O,QAAU,GAAI5J,EAAItI,OAAOsB,KAAKuD,GAAI0D,EAAIrK,EAAEgU,QAAU,GAAIpY,EAAIkG,OAAOsB,KAAKiH,GAKlFD,EAAEsL,OAAQ9Z,EAAE8Z,OACZ,IAAK,IAAIpQ,EAAI,EAAGA,EAAI8E,EAAEvO,QAAUyJ,EAAI1J,EAAEC,SAAUyJ,EAAG,CAC/C,MAAMtF,EAAImR,GAAG/G,EAAE9E,GAAI1J,EAAE0J,IACrB,GAAI,IAAMtF,EAAG,OAAOA,EACpB,MAAM4J,EAAI4L,GAAG7O,EAAEyD,EAAE9E,IAAK+E,EAAEzO,EAAE0J,KAC1B,GAAI,IAAMsE,EAAG,OAAOA,EAExB,OAAOuH,GAAG/G,EAAEvO,OAAQD,EAAEC,QAhBnB,CAkB8DyJ,EAAEyO,SAAU/T,EAAE+T,UAErF,QACE,MAAM7Q,KAId,SAASuS,GAAGnQ,EAAGtF,GACX,GAAI,iBAAmBsF,GAAK,iBAAmBtF,GAAKsF,EAAEzJ,SAAWmE,EAAEnE,OAAQ,OAAOsV,GAAG7L,EAAGtF,GACxF,MAAM2G,EAAI+L,GAAGpN,GAAI8E,EAAIsI,GAAG1S,GAAIqK,EAAI8G,GAAGxK,EAAEmM,QAAS1I,EAAE0I,SAChD,OAAO,IAAMzI,EAAIA,EAAI8G,GAAGxK,EAAEqM,MAAO5I,EAAE4I,OAGvC,SAAS2C,GAAGrQ,EAAGtF,GACX,MAAO,CACH6U,eAAgB,YAAYvP,EAAEyF,uBAAuBzF,EAAE0F,sBAAsBhL,EAAEmN,KAAKV,qBAI3C,SAASmJ,GAAGtQ,GACzD,QAASA,GAAK,eAAgBA,EAGa,SAASuQ,GAAGvQ,GACvD,QAASA,GAAK,cAAeA,EAGM,SAASwQ,GAAGxQ,GAC/C,QAASA,GAAK,gBAAiBA,GAAK6P,MAAMtC,OAAOvN,EAAE4P,cAGT,SAASa,GAAGzQ,GACtD,QAASA,GAAK,aAAcA,EAGQ,SAAS0Q,GAAG1Q,GAChD,GAAIA,EAAEwP,cAAe,MAAO,CACxBA,cAAehT,OAAOmU,OAAO,GAAI3Q,EAAEwP,gBAEvC,GAAIxP,EAAEiP,gBAAkB,iBAAmBjP,EAAEiP,eAAgB,MAAO,CAChEA,eAAgBzS,OAAOmU,OAAO,GAAI3Q,EAAEiP,iBAExC,GAAIjP,EAAEyO,SAAU,CACZ,MAAM/T,EAAI,CACN+T,SAAU,CACNC,OAAQ,KAGhB,OAAOvC,GAAGnM,EAAEyO,SAASC,QAAS,CAAC1O,EAAGqB,IAAM3G,EAAE+T,SAASC,OAAO1O,GAAK0Q,GAAGrP,KAAM3G,EAE5E,GAAIsF,EAAE8P,WAAY,CACd,MAAMpV,EAAI,CACNoV,WAAY,CACRC,OAAQ,KAGhB,IAAK,IAAI1O,EAAI,EAAGA,GAAKrB,EAAE8P,WAAWC,QAAU,IAAIxZ,SAAU8K,EAAG3G,EAAEoV,WAAWC,OAAO1O,GAAKqP,GAAG1Q,EAAE8P,WAAWC,OAAO1O,IAC7G,OAAO3G,EAEX,OAAO8B,OAAOmU,OAAO,GAAI3Q,GAG7B,MAAM4Q,GACFlX,YAAYsG,EAAGtF,GACXzD,KAAK4Z,SAAW7Q,EAAG/I,KAAK6Z,UAAYpW,GAI5C,SAASqW,GAAG/Q,EAAGtF,GACX,GAAI,OAASsF,EAAG,OAAO,OAAStF,EAChC,GAAI,OAASA,EAAG,OAAO,EACvB,GAAIsF,EAAE8Q,YAAcpW,EAAEoW,WAAa9Q,EAAE6Q,SAASta,SAAWmE,EAAEmW,SAASta,OAAQ,OAAO,EACnF,IAAK,IAAI8K,EAAI,EAAGA,EAAIrB,EAAE6Q,SAASta,OAAQ8K,IACnC,IAAK+N,GAAGpP,EAAE6Q,SAASxP,GAAI3G,EAAEmW,SAASxP,IAAK,OAAO,EAElD,OAAO,EAkBP,MAAM2P,IAEV,MAAMC,WAAWD,GACbtX,YAAYsG,EAAGtF,EAAG2G,GACd9E,QAAStF,KAAKia,MAAQlR,EAAG/I,KAAKka,GAAKzW,EAAGzD,KAAKsG,MAAQ8D,EAIhDsE,cAAc3F,EAAGtF,EAAG2G,GACvB,OAAOrB,EAAE2H,aAAe,OAA2BjN,GAAK,WAAmCA,EAAIzD,KAAKma,uBAAuBpR,EAAGtF,EAAG2G,GAAK,IAAIgQ,GAAGrR,EAAGtF,EAAG2G,GAAK,mBAAmD3G,EAAI,IAAI4W,GAAGtR,EAAGqB,GAAK,OAA2B3G,EAAI,IAAI6W,GAAGvR,EAAGqB,GAAK,WAAmC3G,EAAI,IAAI8W,GAAGxR,EAAGqB,GAAK,uBAA2D3G,EAAI,IAAI+W,GAAGzR,EAAGqB,GAAK,IAAI4P,GAAGjR,EAAGtF,EAAG2G,GAEjasE,8BAA8B3F,EAAGtF,EAAG2G,GAChC,MAAO,OAA2B3G,EAAI,IAAIgX,GAAG1R,EAAGqB,GAAK,IAAIsQ,GAAG3R,EAAGqB,GAEnEuQ,QAAQ5R,GACJ,MAAMtF,EAAIsF,EAAE/C,KAAKiU,MAAMja,KAAKia,OAEpB,MAAO,OAAkCja,KAAKka,GAAK,OAASzW,GAAKzD,KAAK4a,kBAAkB3B,GAAGxV,EAAGzD,KAAKsG,QAAU,OAAS7C,GAAKyU,GAAGlY,KAAKsG,SAAW4R,GAAGzU,IAAMzD,KAAK4a,kBAAkB3B,GAAGxV,EAAGzD,KAAKsG,QAGrMsU,kBAAkB7R,GACd,OAAQ/I,KAAKka,IACX,IAAK,IACH,OAAOnR,EAAI,EAEb,IAAK,KACH,OAAOA,GAAK,EAEd,IAAK,KACH,OAAO,IAAMA,EAEf,IAAK,KACH,OAAO,IAAMA,EAEf,IAAK,IACH,OAAOA,EAAI,EAEb,IAAK,KACH,OAAOA,GAAK,EAEd,QACE,OAAOpC,KAGfkU,eACI,MAAO,CAAE,IAA+B,KAAyC,IAAkC,KAA4C,KAAgC,UAAiC1K,QAAQnQ,KAAKka,KAAO,EAExPY,sBACI,MAAO,CAAE9a,MAEb+a,aACI,MAAO,CAAE/a,MAEbgb,0BACI,OAAOhb,KAAK6a,eAAiB7a,KAAKia,MAAQ,MAIlD,MAAMgB,WAAWlB,GACbtX,YAAYsG,EAAGtF,GACX6B,QAAStF,KAAKkb,QAAUnS,EAAG/I,KAAKka,GAAKzW,EAAGzD,KAAKgL,EAAI,KAI9C0D,cAAc3F,EAAGtF,GACpB,OAAO,IAAIwX,GAAGlS,EAAGtF,GAErBkX,QAAQ5R,GACJ,MAAO,QAAsC/I,KAAKka,QAAK,IAAWla,KAAKkb,QAAQlC,MAAMvV,IAAMA,EAAEkX,QAAQ5R,UAAO,IAAW/I,KAAKkb,QAAQlC,MAAMvV,GAAKA,EAAEkX,QAAQ5R,KAE7J+R,sBACI,OAAO,OAAS9a,KAAKgL,IAAMhL,KAAKgL,EAAIhL,KAAKkb,QAAQC,QAAM,CAAGpS,EAAGtF,IAAMsF,EAAEqS,OAAO3X,EAAEqX,wBAAyB,KACvG9a,KAAKgL,EAGT+P,aACI,OAAOxV,OAAOmU,OAAO,GAAI1Z,KAAKkb,SAElCF,0BACI,MAAMjS,EAAI/I,KAAKiL,GAAGlC,GAAKA,EAAE8R,iBACzB,OAAO,OAAS9R,EAAIA,EAAEkR,MAAQ,KAKlChP,EAAElC,GACE,IAAK,MAAMtF,KAAKzD,KAAK8a,sBAAuB,GAAI/R,EAAEtF,GAAI,OAAOA,EAC7D,OAAO,MAIf,SAAS4X,GAAGtS,EAAGtF,GACX,OAAOsF,aAAaiR,GAAK,SAASjR,EAAGtF,GACjC,OAAOA,aAAauW,IAAMjR,EAAEmR,KAAOzW,EAAEyW,IAAMnR,EAAEkR,MAAM9Q,QAAQ1F,EAAEwW,QAAU9B,GAAGpP,EAAEzC,MAAO7C,EAAE6C,OADhE,CAEvByC,EAAGtF,GAAKsF,aAAakS,GAAK,SAASlS,EAAGtF,GACpC,OAAIA,aAAawX,IAAMlS,EAAEmR,KAAOzW,EAAEyW,IAAMnR,EAAEmS,QAAQ5b,SAAWmE,EAAEyX,QAAQ5b,QAC5DyJ,EAAEmS,QAAQC,QAAQ,CAACpS,EAAGqB,EAAGyD,IAAM9E,GAAKsS,GAAGjR,EAAG3G,EAAEyX,QAAQrN,MAAM,GAF7C,CAMiC9E,EAAGtF,QAAUkD,IAG9E,MAAMyT,WAAWJ,GACbvX,YAAYsG,EAAGtF,EAAG2G,GACd9E,MAAMyD,EAAGtF,EAAG2G,GAAIpK,KAAKqG,IAAMsK,GAAG2K,SAASlR,EAAEkO,gBAE7CqC,QAAQ5R,GACJ,MAAMtF,EAAIkN,GAAG3B,WAAWjG,EAAE1C,IAAKrG,KAAKqG,KACpC,OAAOrG,KAAK4a,kBAAkBnX,IAIoB,MAAMgX,WAAWT,GACvEvX,YAAYsG,EAAGtF,GACX6B,MAAMyD,EAAG,KAAyBtF,GAAIzD,KAAK6G,KAAO0U,GAAG,KAAyB9X,GAElFkX,QAAQ5R,GACJ,OAAO/I,KAAK6G,KAAK2U,MAAM/X,GAAKA,EAAE0F,QAAQJ,EAAE1C,QAIsB,MAAMqU,WAAWV,GACnFvX,YAAYsG,EAAGtF,GACX6B,MAAMyD,EAAG,SAAiCtF,GAAIzD,KAAK6G,KAAO0U,GAAG,SAAiC9X,GAElGkX,QAAQ5R,GACJ,OAAQ/I,KAAK6G,KAAK2U,MAAM/X,GAAKA,EAAE0F,QAAQJ,EAAE1C,QAIjD,SAASkV,GAAGxS,EAAGtF,GACX,IAAI2G,EACJ,QAAS,QAAUA,EAAI3G,EAAEoV,kBAAe,IAAWzO,OAAI,EAASA,EAAE0O,SAAW,IAAIzO,KAAKtB,GAAK4H,GAAG2K,SAASvS,EAAEuP,kBAGhD,MAAM+B,WAAWL,GAC1EvX,YAAYsG,EAAGtF,GACX6B,MAAMyD,EAAG,iBAAiDtF,GAE9DkX,QAAQ5R,GACJ,MAAMtF,EAAIsF,EAAE/C,KAAKiU,MAAMja,KAAKia,OAC5B,OAAOZ,GAAG5V,IAAMsV,GAAGtV,EAAEoV,WAAY7Y,KAAKsG,QAIG,MAAMgU,WAAWN,GAC9DvX,YAAYsG,EAAGtF,GACX6B,MAAMyD,EAAG,KAAyBtF,GAEtCkX,QAAQ5R,GACJ,MAAMtF,EAAIsF,EAAE/C,KAAKiU,MAAMja,KAAKia,OAC5B,OAAO,OAASxW,GAAKsV,GAAG/Y,KAAKsG,MAAMuS,WAAYpV,IAIF,MAAM8W,WAAWP,GAClEvX,YAAYsG,EAAGtF,GACX6B,MAAMyD,EAAG,SAAiCtF,GAE9CkX,QAAQ5R,GACJ,GAAIgQ,GAAG/Y,KAAKsG,MAAMuS,WAAY,CAC1B4C,UAAW,eACX,OAAO,EACX,MAAMhY,EAAIsF,EAAE/C,KAAKiU,MAAMja,KAAKia,OAC5B,OAAO,OAASxW,IAAMsV,GAAG/Y,KAAKsG,MAAMuS,WAAYpV,IAIS,MAAM+W,WAAWR,GAC9EvX,YAAYsG,EAAGtF,GACX6B,MAAMyD,EAAG,qBAAyDtF,GAEtEkX,QAAQ5R,GACJ,MAAMtF,EAAIsF,EAAE/C,KAAKiU,MAAMja,KAAKia,OAC5B,SAAUZ,GAAG5V,KAAOA,EAAEoV,WAAWC,SAAWrV,EAAEoV,WAAWC,OAAO0C,MAAMzS,GAAKgQ,GAAG/Y,KAAKsG,MAAMuS,WAAY9P,MAsBzG,MAAM2S,GACNjZ,YAAYsG,EAAGtF,EAAI,OACfzD,KAAKia,MAAQlR,EAAG/I,KAAK2b,IAAMlY,GAInC,SAASmY,GAAG7S,EAAGtF,GACX,OAAOsF,EAAE4S,MAAQlY,EAAEkY,KAAO5S,EAAEkR,MAAM9Q,QAAQ1F,EAAEwW,OAsB5C,MAAM4B,GACNpZ,YAAYsG,GACR/I,KAAK8b,UAAY/S,EAErB2F,qBAAqB3F,GACjB,OAAO,IAAI8S,GAAG9S,GAElB2F,aACI,OAAO,IAAImN,GAAG,IAAI/E,GAAG,EAAG,IAE5BpI,aACI,OAAO,IAAImN,GAAG,IAAI/E,GAAG,aAAc,YAEvCf,UAAUhN,GACN,OAAO/I,KAAK8b,UAAU3E,WAAWpO,EAAE+S,WAEvC3S,QAAQJ,GACJ,OAAO/I,KAAK8b,UAAU3S,QAAQJ,EAAE+S,WAE4CC,iBAE5E,OAAO,IAAM/b,KAAK8b,UAAUvF,QAAUvW,KAAK8b,UAAU/E,YAAc,IAEvEtL,WACI,MAAO,mBAAqBzL,KAAK8b,UAAUrQ,WAAa,IAE5DuQ,cACI,OAAOhc,KAAK8b,WAsBpB,MAAMG,GACFxZ,YAAYsG,EAAGtF,GACXzD,KAAKgP,WAAajG,EAAG/I,KAAKkc,KAAOzY,GAAK0Y,GAAGC,MAG7CC,OAAOtT,EAAGtF,GACN,OAAO,IAAIwY,GAAGjc,KAAKgP,WAAYhP,KAAKkc,KAAKG,OAAOtT,EAAGtF,EAAGzD,KAAKgP,YAAYsN,KAAK,KAAM,KAAMH,GAAGI,MAAO,KAAM,OAG5GC,OAAOzT,GACH,OAAO,IAAIkT,GAAGjc,KAAKgP,WAAYhP,KAAKkc,KAAKM,OAAOzT,EAAG/I,KAAKgP,YAAYsN,KAAK,KAAM,KAAMH,GAAGI,MAAO,KAAM,OAGzG7M,IAAI3G,GACA,IAAItF,EAAIzD,KAAKkc,KACb,MAAOzY,EAAEkM,WAAa,CAClB,MAAMvF,EAAIpK,KAAKgP,WAAWjG,EAAGtF,EAAE4C,KAC/B,GAAI,IAAM+D,EAAG,OAAO3G,EAAE6C,MACtB8D,EAAI,EAAI3G,EAAIA,EAAEgZ,KAAOrS,EAAI,IAAM3G,EAAIA,EAAEiZ,OAEzC,OAAO,KAIXvM,QAAQpH,GAEJ,IAAItF,EAAI,EAAG2G,EAAIpK,KAAKkc,KACpB,MAAO9R,EAAEuF,WAAa,CAClB,MAAM9B,EAAI7N,KAAKgP,WAAWjG,EAAGqB,EAAE/D,KAC/B,GAAI,IAAMwH,EAAG,OAAOpK,EAAI2G,EAAEqS,KAAKE,KAC/B9O,EAAI,EAAIzD,EAAIA,EAAEqS,MAEdhZ,GAAK2G,EAAEqS,KAAKE,KAAO,EAAGvS,EAAIA,EAAEsS,OAGxB,OAAQ,EAEpB/M,UACI,OAAO3P,KAAKkc,KAAKvM,UAGjBgN,WACA,OAAO3c,KAAKkc,KAAKS,KAGrBC,SACI,OAAO5c,KAAKkc,KAAKU,SAGrBC,SACI,OAAO7c,KAAKkc,KAAKW,SAMrBC,iBAAiB/T,GACb,OAAO/I,KAAKkc,KAAKY,iBAAiB/T,GAEtCqG,QAAQrG,GACJ/I,KAAK8c,kBAAgB,CAAGrZ,EAAG2G,KAAOrB,EAAEtF,EAAG2G,IAAI,KAE/CqB,WACI,MAAM1C,EAAI,GACV,OAAO/I,KAAK8c,kBAAkB,CAACrZ,EAAG2G,KAAOrB,EAAEzH,KAAK,GAAGmC,KAAK2G,MAAM,KAAO,IAAIrB,EAAExH,KAAK,SAOpFwb,iBAAiBhU,GACb,OAAO/I,KAAKkc,KAAKa,iBAAiBhU,GAGtCiU,cACI,OAAO,IAAIC,GAAGjd,KAAKkc,KAAM,KAAMlc,KAAKgP,YAAY,GAEpDkO,gBAAgBnU,GACZ,OAAO,IAAIkU,GAAGjd,KAAKkc,KAAMnT,EAAG/I,KAAKgP,YAAY,GAEjDmO,qBACI,OAAO,IAAIF,GAAGjd,KAAKkc,KAAM,KAAMlc,KAAKgP,YAAY,GAEpDoO,uBAAuBrU,GACnB,OAAO,IAAIkU,GAAGjd,KAAKkc,KAAMnT,EAAG/I,KAAKgP,YAAY,IAMrD,MAAMiO,GACFxa,YAAYsG,EAAGtF,EAAG2G,EAAGyD,GACjB7N,KAAKqd,UAAYxP,EAAG7N,KAAKsd,UAAY,GACrC,IAAIxP,EAAI,EACR,MAAO/E,EAAE4G,WAAa,GAAI7B,EAAIrK,EAAI2G,EAAErB,EAAE1C,IAAK5C,GAAK,EAEhDA,GAAKoK,IAAMC,IAAM,GAAIA,EAAI,EAEzB/E,EAAI/I,KAAKqd,UAAYtU,EAAE0T,KAAO1T,EAAE2T,UAAY,CACxC,GAAI,IAAM5O,EAAG,CAGT9N,KAAKsd,UAAUhc,KAAKyH,GACpB,MAIJ/I,KAAKsd,UAAUhc,KAAKyH,GAAIA,EAAI/I,KAAKqd,UAAYtU,EAAE2T,MAAQ3T,EAAE0T,MAGjEc,UACI,IAAIxU,EAAI/I,KAAKsd,UAAUE,MACvB,MAAM/Z,EAAI,CACN4C,IAAK0C,EAAE1C,IACPC,MAAOyC,EAAEzC,OAEb,GAAItG,KAAKqd,UAAW,IAAKtU,EAAIA,EAAE0T,MAAO1T,EAAE4G,WAAa3P,KAAKsd,UAAUhc,KAAKyH,GAAIA,EAAIA,EAAE2T,WAAY,IAAK3T,EAAIA,EAAE2T,OAAQ3T,EAAE4G,WAAa3P,KAAKsd,UAAUhc,KAAKyH,GACrJA,EAAIA,EAAE0T,KACN,OAAOhZ,EAEXga,UACI,OAAOzd,KAAKsd,UAAUhe,OAAS,EAEnCoe,OACI,GAAI,IAAM1d,KAAKsd,UAAUhe,OAAQ,OAAO,KACxC,MAAMyJ,EAAI/I,KAAKsd,UAAUtd,KAAKsd,UAAUhe,OAAS,GACjD,MAAO,CACH+G,IAAK0C,EAAE1C,IACPC,MAAOyC,EAAEzC,QAOrB,MAAM6V,GACF1Z,YAAYsG,EAAGtF,EAAG2G,EAAGyD,EAAGC,GACpB9N,KAAKqG,IAAM0C,EAAG/I,KAAKsG,MAAQ7C,EAAGzD,KAAK2d,MAAQ,MAAQvT,EAAIA,EAAI+R,GAAGyB,IAAK5d,KAAKyc,KAAO,MAAQ5O,EAAIA,EAAIsO,GAAGC,MAClGpc,KAAK0c,MAAQ,MAAQ5O,EAAIA,EAAIqO,GAAGC,MAAOpc,KAAK2c,KAAO3c,KAAKyc,KAAKE,KAAO,EAAI3c,KAAK0c,MAAMC,KAGvFL,KAAKvT,EAAGtF,EAAG2G,EAAGyD,EAAGC,GACb,OAAO,IAAIqO,GAAG,MAAQpT,EAAIA,EAAI/I,KAAKqG,IAAK,MAAQ5C,EAAIA,EAAIzD,KAAKsG,MAAO,MAAQ8D,EAAIA,EAAIpK,KAAK2d,MAAO,MAAQ9P,EAAIA,EAAI7N,KAAKyc,KAAM,MAAQ3O,EAAIA,EAAI9N,KAAK0c,OAEpJ/M,UACI,OAAO,EAMXmN,iBAAiB/T,GACb,OAAO/I,KAAKyc,KAAKK,iBAAiB/T,IAAMA,EAAE/I,KAAKqG,IAAKrG,KAAKsG,QAAUtG,KAAK0c,MAAMI,iBAAiB/T,GAMnGgU,iBAAiBhU,GACb,OAAO/I,KAAK0c,MAAMK,iBAAiBhU,IAAMA,EAAE/I,KAAKqG,IAAKrG,KAAKsG,QAAUtG,KAAKyc,KAAKM,iBAAiBhU,GAGnGiH,MACI,OAAOhQ,KAAKyc,KAAK9M,UAAY3P,KAAOA,KAAKyc,KAAKzM,MAGlD4M,SACI,OAAO5c,KAAKgQ,MAAM3J,IAGtBwW,SACI,OAAO7c,KAAK0c,MAAM/M,UAAY3P,KAAKqG,IAAMrG,KAAK0c,MAAMG,SAGxDR,OAAOtT,EAAGtF,EAAG2G,GACT,IAAIyD,EAAI7N,KACR,MAAM8N,EAAI1D,EAAErB,EAAG8E,EAAExH,KACjB,OAAOwH,EAAIC,EAAI,EAAID,EAAEyO,KAAK,KAAM,KAAM,KAAMzO,EAAE4O,KAAKJ,OAAOtT,EAAGtF,EAAG2G,GAAI,MAAQ,IAAM0D,EAAID,EAAEyO,KAAK,KAAM7Y,EAAG,KAAM,KAAM,MAAQoK,EAAEyO,KAAK,KAAM,KAAM,KAAM,KAAMzO,EAAE6O,MAAML,OAAOtT,EAAGtF,EAAG2G,IAC9KyD,EAAEgQ,QAENC,YACI,GAAI9d,KAAKyc,KAAK9M,UAAW,OAAOwM,GAAGC,MACnC,IAAIrT,EAAI/I,KACR,OAAO+I,EAAE0T,KAAKsB,SAAWhV,EAAE0T,KAAKA,KAAKsB,UAAYhV,EAAIA,EAAEiV,eAAgBjV,EAAIA,EAAEuT,KAAK,KAAM,KAAM,KAAMvT,EAAE0T,KAAKqB,YAAa,MACxH/U,EAAE8U,QAGNrB,OAAOzT,EAAGtF,GACN,IAAI2G,EAAGyD,EAAI7N,KACX,GAAIyD,EAAEsF,EAAG8E,EAAExH,KAAO,EAAGwH,EAAE4O,KAAK9M,WAAa9B,EAAE4O,KAAKsB,SAAWlQ,EAAE4O,KAAKA,KAAKsB,UAAYlQ,EAAIA,EAAEmQ,eACzFnQ,EAAIA,EAAEyO,KAAK,KAAM,KAAM,KAAMzO,EAAE4O,KAAKD,OAAOzT,EAAGtF,GAAI,UAAY,CAC1D,GAAIoK,EAAE4O,KAAKsB,UAAYlQ,EAAIA,EAAEoQ,eAAgBpQ,EAAE6O,MAAM/M,WAAa9B,EAAE6O,MAAMqB,SAAWlQ,EAAE6O,MAAMD,KAAKsB,UAAYlQ,EAAIA,EAAEqQ,gBACpH,IAAMza,EAAEsF,EAAG8E,EAAExH,KAAM,CACf,GAAIwH,EAAE6O,MAAM/M,UAAW,OAAOwM,GAAGC,MACjChS,EAAIyD,EAAE6O,MAAM1M,MAAOnC,EAAIA,EAAEyO,KAAKlS,EAAE/D,IAAK+D,EAAE9D,MAAO,KAAM,KAAMuH,EAAE6O,MAAMoB,aAEtEjQ,EAAIA,EAAEyO,KAAK,KAAM,KAAM,KAAM,KAAMzO,EAAE6O,MAAMF,OAAOzT,EAAGtF,IAEzD,OAAOoK,EAAEgQ,QAEbE,QACI,OAAO/d,KAAK2d,MAGhBE,QACI,IAAI9U,EAAI/I,KACR,OAAO+I,EAAE2T,MAAMqB,UAAYhV,EAAE0T,KAAKsB,UAAYhV,EAAIA,EAAEoV,cAAepV,EAAE0T,KAAKsB,SAAWhV,EAAE0T,KAAKA,KAAKsB,UAAYhV,EAAIA,EAAEkV,eACnHlV,EAAE0T,KAAKsB,SAAWhV,EAAE2T,MAAMqB,UAAYhV,EAAIA,EAAEqV,aAAcrV,EAE9DiV,cACI,IAAIjV,EAAI/I,KAAKoe,YACb,OAAOrV,EAAE2T,MAAMD,KAAKsB,UAAYhV,EAAIA,EAAEuT,KAAK,KAAM,KAAM,KAAM,KAAMvT,EAAE2T,MAAMuB,eAC3ElV,EAAIA,EAAEoV,aAAcpV,EAAIA,EAAEqV,aAAcrV,EAE5CmV,eACI,IAAInV,EAAI/I,KAAKoe,YACb,OAAOrV,EAAE0T,KAAKA,KAAKsB,UAAYhV,EAAIA,EAAEkV,cAAelV,EAAIA,EAAEqV,aAAcrV,EAE5EoV,aACI,MAAMpV,EAAI/I,KAAKsc,KAAK,KAAM,KAAMH,GAAGyB,IAAK,KAAM5d,KAAK0c,MAAMD,MACzD,OAAOzc,KAAK0c,MAAMJ,KAAK,KAAM,KAAMtc,KAAK2d,MAAO5U,EAAG,MAEtDkV,cACI,MAAMlV,EAAI/I,KAAKsc,KAAK,KAAM,KAAMH,GAAGyB,IAAK5d,KAAKyc,KAAKC,MAAO,MACzD,OAAO1c,KAAKyc,KAAKH,KAAK,KAAM,KAAMtc,KAAK2d,MAAO,KAAM5U,GAExDqV,YACI,MAAMrV,EAAI/I,KAAKyc,KAAKH,KAAK,KAAM,MAAOtc,KAAKyc,KAAKkB,MAAO,KAAM,MAAOla,EAAIzD,KAAK0c,MAAMJ,KAAK,KAAM,MAAOtc,KAAK0c,MAAMiB,MAAO,KAAM,MAC7H,OAAO3d,KAAKsc,KAAK,KAAM,MAAOtc,KAAK2d,MAAO5U,EAAGtF,GAGjD4a,gBACI,MAAMtV,EAAI/I,KAAKse,QACf,OAAOvO,KAAKwO,IAAI,EAAGxV,IAAM/I,KAAK2c,KAAO,EAIzC2B,QACI,GAAIte,KAAK+d,SAAW/d,KAAKyc,KAAKsB,QAAS,MAAMpX,IAC7C,GAAI3G,KAAK0c,MAAMqB,QAAS,MAAMpX,IAC9B,MAAMoC,EAAI/I,KAAKyc,KAAK6B,QACpB,GAAIvV,IAAM/I,KAAK0c,MAAM4B,QAAS,MAAM3X,IACpC,OAAOoC,GAAK/I,KAAK+d,QAAU,EAAI,IAOvC5B,GAAGC,MAAQ,KAAMD,GAAGyB,KAAM,EAAIzB,GAAGI,OAAQ,EAGzCJ,GAAGC,MAAQ,IAEX,MACI3Z,cACIzC,KAAK2c,KAAO,EAEZtW,UACA,MAAMM,IAENL,YACA,MAAMK,IAENgX,YACA,MAAMhX,IAEN8V,WACA,MAAM9V,IAEN+V,YACA,MAAM/V,IAGV2V,KAAKvT,EAAGtF,EAAG2G,EAAGyD,EAAGC,GACb,OAAO9N,KAGXqc,OAAOtT,EAAGtF,EAAG2G,GACT,OAAO,IAAI+R,GAAGpT,EAAGtF,GAGrB+Y,OAAOzT,EAAGtF,GACN,OAAOzD,KAEX2P,UACI,OAAO,EAEXmN,iBAAiB/T,GACb,OAAO,EAEXgU,iBAAiBhU,GACb,OAAO,EAEX6T,SACI,OAAO,KAEXC,SACI,OAAO,KAEXkB,QACI,OAAO,EAGXM,gBACI,OAAO,EAEXC,QACI,OAAO,IA2Bf,MAAME,GACF/b,YAAYsG,GACR/I,KAAKgP,WAAajG,EAAG/I,KAAKgG,KAAO,IAAIiW,GAAGjc,KAAKgP,YAEjDyP,IAAI1V,GACA,OAAO,OAAS/I,KAAKgG,KAAK0J,IAAI3G,GAElC2V,QACI,OAAO1e,KAAKgG,KAAK4W,SAErB+B,OACI,OAAO3e,KAAKgG,KAAK6W,SAEjBF,WACA,OAAO3c,KAAKgG,KAAK2W,KAErBxM,QAAQpH,GACJ,OAAO/I,KAAKgG,KAAKmK,QAAQpH,GAEgCqG,QAAQrG,GACjE/I,KAAKgG,KAAK8W,kBAAkB,CAACrZ,EAAG2G,KAAOrB,EAAEtF,IAAI,KAE6Bmb,eAAe7V,EAAGtF,GAC5F,MAAM2G,EAAIpK,KAAKgG,KAAKkX,gBAAgBnU,EAAE,IACtC,KAAMqB,EAAEqT,WAAa,CACjB,MAAM5P,EAAIzD,EAAEmT,UACZ,GAAIvd,KAAKgP,WAAWnB,EAAExH,IAAK0C,EAAE,KAAO,EAAG,OACvCtF,EAAEoK,EAAExH,MAKLwY,aAAa9V,EAAGtF,GACnB,IAAI2G,EACJ,IAAKA,OAAI,IAAW3G,EAAIzD,KAAKgG,KAAKkX,gBAAgBzZ,GAAKzD,KAAKgG,KAAKgX,cAAe5S,EAAEqT,WAC9E,IAAK1U,EAAEqB,EAAEmT,UAAUlX,KAAM,OAGkCyY,kBAAkB/V,GACjF,MAAMtF,EAAIzD,KAAKgG,KAAKkX,gBAAgBnU,GACpC,OAAOtF,EAAEga,UAAYha,EAAE8Z,UAAUlX,IAAM,KAE3C2W,cACI,OAAO,IAAI+B,GAAG/e,KAAKgG,KAAKgX,eAE5BE,gBAAgBnU,GACZ,OAAO,IAAIgW,GAAG/e,KAAKgG,KAAKkX,gBAAgBnU,IAEJiW,IAAIjW,GACxC,OAAO/I,KAAKsc,KAAKtc,KAAKgG,KAAKwW,OAAOzT,GAAGsT,OAAOtT,GAAG,IAEtBkW,OAAOlW,GAChC,OAAO/I,KAAKye,IAAI1V,GAAK/I,KAAKsc,KAAKtc,KAAKgG,KAAKwW,OAAOzT,IAAM/I,KAE1D2P,UACI,OAAO3P,KAAKgG,KAAK2J,UAErBuP,UAAUnW,GACN,IAAItF,EAAIzD,KAEA,OAAOyD,EAAEkZ,KAAO5T,EAAE4T,OAASlZ,EAAIsF,EAAGA,EAAI/I,MAAO+I,EAAEqG,SAASrG,IAC5DtF,EAAIA,EAAEub,IAAIjW,MACTtF,EAET0F,QAAQJ,GACJ,KAAMA,aAAayV,IAAK,OAAO,EAC/B,GAAIxe,KAAK2c,OAAS5T,EAAE4T,KAAM,OAAO,EACjC,MAAMlZ,EAAIzD,KAAKgG,KAAKgX,cAAe5S,EAAIrB,EAAE/C,KAAKgX,cAC9C,KAAMvZ,EAAEga,WAAa,CACjB,MAAM1U,EAAItF,EAAE8Z,UAAUlX,IAAKwH,EAAIzD,EAAEmT,UAAUlX,IAC3C,GAAI,IAAMrG,KAAKgP,WAAWjG,EAAG8E,GAAI,OAAO,EAE5C,OAAO,EAEXiC,UACI,MAAM/G,EAAI,GACV,OAAO/I,KAAKoP,SAAS3L,IACjBsF,EAAEzH,KAAKmC,MACNsF,EAET0C,WACI,MAAM1C,EAAI,GACV,OAAO/I,KAAKoP,SAAS3L,GAAKsF,EAAEzH,KAAKmC,KAAM,aAAesF,EAAE0C,WAAa,IAEzE6Q,KAAKvT,GACD,MAAMtF,EAAI,IAAI+a,GAAGxe,KAAKgP,YACtB,OAAOvL,EAAEuC,KAAO+C,EAAGtF,GAI3B,MAAMsb,GACFtc,YAAYsG,GACR/I,KAAKmf,KAAOpW,EAEhBwU,UACI,OAAOvd,KAAKmf,KAAK5B,UAAUlX,IAE/BoX,UACI,OAAOzd,KAAKmf,KAAK1B,WA6BrB,MAAM2B,GACN3c,YAAYsG,GACR/I,KAAKyX,OAAS1O,EAGdA,EAAEoQ,KAAK5I,GAAGvB,YAEdN,eACI,OAAO,IAAI0Q,GAAG,IAKXF,UAAUnW,GACb,IAAItF,EAAI,IAAI+a,GAAGjO,GAAGvB,YAClB,IAAK,MAAMjG,KAAK/I,KAAKyX,OAAQhU,EAAIA,EAAEub,IAAIjW,GACvC,IAAK,MAAMqB,KAAKrB,EAAGtF,EAAIA,EAAEub,IAAI5U,GAC7B,OAAO,IAAIgV,GAAG3b,EAAEqM,WAObuP,OAAOtW,GACV,IAAK,MAAMtF,KAAKzD,KAAKyX,OAAQ,GAAIhU,EAAEmM,WAAW7G,GAAI,OAAO,EACzD,OAAO,EAEXI,QAAQJ,GACJ,OAAO8L,GAAG7U,KAAKyX,OAAQ1O,EAAE0O,QAAM,CAAI1O,EAAGtF,IAAMsF,EAAEI,QAAQ1F,MAuB1D,MAAM6b,GACN7c,YAAYsG,GACR/I,KAAKsG,MAAQyC,EAEjB2F,eACI,OAAO,IAAI4Q,GAAG,CACV9H,SAAU,KAQXyC,MAAMlR,GACT,GAAIA,EAAE4G,UAAW,OAAO3P,KAAKsG,MAC7B,CACI,IAAI7C,EAAIzD,KAAKsG,MACb,IAAK,IAAI8D,EAAI,EAAGA,EAAIrB,EAAEzJ,OAAS,IAAK8K,EAAG,GAAI3G,GAAKA,EAAE+T,SAASC,QAAU,IAAI1O,EAAE2G,IAAItF,KAC9EoP,GAAG/V,GAAI,OAAO,KACf,OAAOA,GAAKA,EAAE+T,SAASC,QAAU,IAAI1O,EAAE0G,eAAgBhM,GAAK,MAQ7D2I,IAAIrD,EAAGtF,GACVzD,KAAKuf,aAAaxW,EAAEwG,WAAWxG,EAAE0G,eAAiBgK,GAAGhW,GAMlD+b,OAAOzW,GACV,IAAItF,EAAI8M,GAAGO,YAAa1G,EAAI,GAAIyD,EAAI,GACpC9E,EAAEqG,SAAO,CAAGrG,EAAG+E,KACX,IAAKrK,EAAEoM,oBAAoB/B,GAAI,CAE3B,MAAM/E,EAAI/I,KAAKuf,aAAa9b,GAC5BzD,KAAKyf,aAAa1W,EAAGqB,EAAGyD,GAAIzD,EAAI,GAAIyD,EAAI,GAAIpK,EAAIqK,EAAEyB,UAEtDxG,EAAIqB,EAAE0D,EAAE2B,eAAiBgK,GAAG1Q,GAAK8E,EAAEvM,KAAKwM,EAAE2B,kBAE9C,MAAM3B,EAAI9N,KAAKuf,aAAa9b,GAC5BzD,KAAKyf,aAAa3R,EAAG1D,EAAGyD,GAOrBoR,OAAOlW,GACV,MAAMtF,EAAIzD,KAAKia,MAAMlR,EAAEwG,WACvBiK,GAAG/V,IAAMA,EAAE+T,SAASC,eAAiBhU,EAAE+T,SAASC,OAAO1O,EAAE0G,eAE7DtG,QAAQJ,GACJ,OAAOoP,GAAGnY,KAAKsG,MAAOyC,EAAEzC,OAKrBiZ,aAAaxW,GAChB,IAAItF,EAAIzD,KAAKsG,MACb7C,EAAE+T,SAASC,SAAWhU,EAAE+T,SAAW,CAC/BC,OAAQ,KAEZ,IAAK,IAAIrN,EAAI,EAAGA,EAAIrB,EAAEzJ,SAAU8K,EAAG,CAC/B,IAAIyD,EAAIpK,EAAE+T,SAASC,OAAO1O,EAAE2G,IAAItF,IAChCoP,GAAG3L,IAAMA,EAAE2J,SAASC,SAAW5J,EAAI,CAC/B2J,SAAU,CACNC,OAAQ,KAEbhU,EAAE+T,SAASC,OAAO1O,EAAE2G,IAAItF,IAAMyD,GAAIpK,EAAIoK,EAE7C,OAAOpK,EAAE+T,SAASC,OAKfgI,aAAa1W,EAAGtF,EAAG2G,GACtB8K,GAAGzR,GAAI,CAACA,EAAG2G,IAAMrB,EAAEtF,GAAK2G,IACxB,IAAK,MAAM3G,KAAK2G,SAAUrB,EAAEtF,GAEhCic,QACI,OAAO,IAAIJ,GAAG7F,GAAGzZ,KAAKsG,SA6B1B,MAAMqZ,GACNld,YAAYsG,EAAGtF,EAAG2G,EAAGyD,EAAGC,EAAGzO,EAAGgO,GAC1BrN,KAAKqG,IAAM0C,EAAG/I,KAAK4f,aAAenc,EAAGzD,KAAK6f,QAAUzV,EAAGpK,KAAK8f,SAAWjS,EAAG7N,KAAK+f,WAAajS,EAC5F9N,KAAKgG,KAAO3G,EAAGW,KAAKggB,cAAgB3S,EAKjCqB,0BAA0B3F,GAC7B,OAAO,IAAI4W,GAAG5W,EAAG,EACH8S,GAAG7L,MACF6L,GAAG7L,MACD6L,GAAG7L,MAAOsP,GAAGW,QAAS,GAKpCvR,wBAAwB3F,EAAGtF,EAAG2G,EAAGyD,GACpC,OAAO,IAAI8R,GAAG5W,EAAG,EACHtF,EACCoY,GAAG7L,MACD5F,EAAGyD,EAAG,GAEuDa,qBAAqB3F,EAAGtF,GACtG,OAAO,IAAIkc,GAAG5W,EAAG,EACHtF,EACCoY,GAAG7L,MACD6L,GAAG7L,MAAOsP,GAAGW,QAAS,GAMpCvR,0BAA0B3F,EAAGtF,GAChC,OAAO,IAAIkc,GAAG5W,EAAG,EACHtF,EACCoY,GAAG7L,MACD6L,GAAG7L,MAAOsP,GAAGW,QAAS,GAKpCC,uBAAuBnX,EAAGtF,GAM7B,OAAQzD,KAAK+f,WAAW5W,QAAQ0S,GAAG7L,QAAU,IAAqChQ,KAAK4f,cAAgB,IAAiC5f,KAAK4f,eAAiB5f,KAAK+f,WAAahX,GAChL/I,KAAK6f,QAAU9W,EAAG/I,KAAK4f,aAAe,EAAsC5f,KAAKgG,KAAOvC,EACxFzD,KAAKggB,cAAgB,EAA+BhgB,KAKjDmgB,oBAAoBpX,GACvB,OAAO/I,KAAK6f,QAAU9W,EAAG/I,KAAK4f,aAAe,EAC7C5f,KAAKgG,KAAOsZ,GAAGW,QAASjgB,KAAKggB,cAAgB,EAA+BhgB,KAMzEogB,yBAAyBrX,GAC5B,OAAO/I,KAAK6f,QAAU9W,EAAG/I,KAAK4f,aAAe,EAC7C5f,KAAKgG,KAAOsZ,GAAGW,QAASjgB,KAAKggB,cAAgB,EAC7ChgB,KAEJqgB,2BACI,OAAOrgB,KAAKggB,cAAgB,EAAgDhgB,KAEhFsgB,uBACI,OAAOtgB,KAAKggB,cAAgB,EAA4ChgB,KAAK6f,QAAUhE,GAAG7L,MAC1FhQ,KAEJugB,YAAYxX,GACR,OAAO/I,KAAK8f,SAAW/W,EAAG/I,KAE1BwgB,wBACA,OAAO,IAA8CxgB,KAAKggB,cAE1DS,4BACA,OAAO,IAAkDzgB,KAAKggB,cAE9DU,uBACA,OAAO1gB,KAAKwgB,mBAAqBxgB,KAAKygB,sBAE1CE,kBACI,OAAO,IAAiC3gB,KAAK4f,aAEjDgB,kBACI,OAAO,IAAwC5gB,KAAK4f,aAExDiB,eACI,OAAO,IAAqC7gB,KAAK4f,aAErDkB,oBACI,OAAO,IAA0C9gB,KAAK4f,aAE1DzW,QAAQJ,GACJ,OAAOA,aAAa4W,IAAM3f,KAAKqG,IAAI8C,QAAQJ,EAAE1C,MAAQrG,KAAK6f,QAAQ1W,QAAQJ,EAAE8W,UAAY7f,KAAK4f,eAAiB7W,EAAE6W,cAAgB5f,KAAKggB,gBAAkBjX,EAAEiX,eAAiBhgB,KAAKgG,KAAKmD,QAAQJ,EAAE/C,MAElM+a,cACI,OAAO,IAAIpB,GAAG3f,KAAKqG,IAAKrG,KAAK4f,aAAc5f,KAAK6f,QAAS7f,KAAK8f,SAAU9f,KAAK+f,WAAY/f,KAAKgG,KAAK0Z,QAAS1f,KAAKggB,eAErHvU,WACI,MAAO,YAAYzL,KAAKqG,QAAQrG,KAAK6f,YAAY/b,KAAK0G,UAAUxK,KAAKgG,KAAKM,wBAAwBtG,KAAK+f,gCAAgC/f,KAAK4f,mCAAmC5f,KAAKggB,mBAqB5L,MAAMgB,GACFve,YAAYsG,EAAGtF,EAAI,KAAM2G,EAAI,GAAIyD,EAAI,GAAIC,EAAI,KAAMzO,EAAI,KAAMgO,EAAI,MAC7DrN,KAAK4Q,KAAO7H,EAAG/I,KAAK+Q,gBAAkBtN,EAAGzD,KAAKihB,QAAU7W,EAAGpK,KAAKkb,QAAUrN,EAAG7N,KAAKmP,MAAQrB,EAC1F9N,KAAKkhB,QAAU7hB,EAAGW,KAAKmhB,MAAQ9T,EAAGrN,KAAKmL,EAAI,MAW/C,SAASiW,GAAGrY,EAAGtF,EAAI,KAAM2G,EAAI,GAAIyD,EAAI,GAAIC,EAAI,KAAMzO,EAAI,KAAMgO,EAAI,MACjE,OAAO,IAAI2T,GAAGjY,EAAGtF,EAAG2G,EAAGyD,EAAGC,EAAGzO,EAAGgO,GA0BpC,MAAMgU,GAKF5e,YAAYsG,EAAGtF,EAAI,KAAM2G,EAAI,GAAIyD,EAAI,GAAIC,EAAI,KAAMzO,EAAI,IAA4BgO,EAAI,KAAMpL,EAAI,MAC7FjC,KAAK4Q,KAAO7H,EAAG/I,KAAK+Q,gBAAkBtN,EAAGzD,KAAKshB,gBAAkBlX,EAAGpK,KAAKkb,QAAUrN,EAClF7N,KAAKmP,MAAQrB,EAAG9N,KAAKuhB,UAAYliB,EAAGW,KAAKkhB,QAAU7T,EAAGrN,KAAKmhB,MAAQlf,EAAGjC,KAAKoL,EAAI,KAE/EpL,KAAKqL,EAAI,KAAMrL,KAAKkhB,QAASlhB,KAAKmhB,OAIkC,SAASK,GAAGzY,GACpF,OAAOA,EAAEuY,gBAAgBhiB,OAAS,EAAIyJ,EAAEuY,gBAAgB,GAAGrH,MAAQ,KAGvE,SAASwH,GAAG1Y,GACR,IAAK,MAAMtF,KAAKsF,EAAEmS,QAAS,CACvB,MAAMnS,EAAItF,EAAEuX,0BACZ,GAAI,OAASjS,EAAG,OAAOA,EAE3B,OAAO,KAWX,SAAS2Y,GAAG3Y,GACR,OAAO,OAASA,EAAEgI,gBAOlB,SAAS4Q,GAAG5Y,GACZ,MAAMtF,EAAIiH,EAAE3B,GACZ,GAAI,OAAStF,EAAE2H,EAAG,CACd3H,EAAE2H,EAAI,GACN,MAAMrC,EAAI0Y,GAAGhe,GAAI2G,EAAIoX,GAAG/d,GACxB,GAAI,OAASsF,GAAK,OAASqB,EAI3BrB,EAAE2H,cAAgBjN,EAAE2H,EAAE9J,KAAK,IAAIoa,GAAG3S,IAAKtF,EAAE2H,EAAE9J,KAAK,IAAIoa,GAAGnL,GAAGqR,WAAY,YAAwC,CAC1G,IAAI7Y,GAAI,EACR,IAAK,MAAMqB,KAAK3G,EAAE6d,gBAAiB7d,EAAE2H,EAAE9J,KAAK8I,GAAIA,EAAE6P,MAAMvJ,eAAiB3H,GAAI,GAC7E,IAAKA,EAAG,CAGJ,MAAMA,EAAItF,EAAE6d,gBAAgBhiB,OAAS,EAAImE,EAAE6d,gBAAgB7d,EAAE6d,gBAAgBhiB,OAAS,GAAGqc,IAAM,MAC/FlY,EAAE2H,EAAE9J,KAAK,IAAIoa,GAAGnL,GAAGqR,WAAY7Y,MAI3C,OAAOtF,EAAE2H,EAKT,SAASyW,GAAG9Y,GACZ,MAAMtF,EAAIiH,EAAE3B,GACZ,IAAKtF,EAAE4H,EAAG,GAAI,MAA8B5H,EAAE8d,UAAW9d,EAAE4H,EAAI+V,GAAG3d,EAAEmN,KAAMnN,EAAEsN,gBAAiB4Q,GAAGle,GAAIA,EAAEyX,QAASzX,EAAE0L,MAAO1L,EAAEyd,QAASzd,EAAE0d,WAAa,CAE9I,MAAMpY,EAAI,GACV,IAAK,MAAMqB,KAAKuX,GAAGle,GAAI,CACnB,MAAMA,EAAI,SAAsC2G,EAAEuR,IAAM,MAAkC,OAC1F5S,EAAEzH,KAAK,IAAIoa,GAAGtR,EAAE6P,MAAOxW,IAGnB,MAAM2G,EAAI3G,EAAE0d,MAAQ,IAAIxH,GAAGlW,EAAE0d,MAAMvH,SAAUnW,EAAE0d,MAAMtH,WAAa,KAAMhM,EAAIpK,EAAEyd,QAAU,IAAIvH,GAAGlW,EAAEyd,QAAQtH,SAAUnW,EAAEyd,QAAQrH,WAAa,KAElJpW,EAAE4H,EAAI+V,GAAG3d,EAAEmN,KAAMnN,EAAEsN,gBAAiBhI,EAAGtF,EAAEyX,QAASzX,EAAE0L,MAAO/E,EAAGyD,GAElE,OAAOpK,EAAE4H,EAGb,SAASyW,GAAG/Y,EAAGtF,GACXA,EAAEuX,0BAA2ByG,GAAG1Y,GAChC,MAAMqB,EAAIrB,EAAEmS,QAAQE,OAAO,CAAE3X,IAC7B,OAAO,IAAI4d,GAAGtY,EAAE6H,KAAM7H,EAAEgI,gBAAiBhI,EAAEuY,gBAAgBpS,QAAS9E,EAAGrB,EAAEoG,MAAOpG,EAAEwY,UAAWxY,EAAEmY,QAASnY,EAAEoY,OAuC9G,SAASY,GAAGhZ,EAAGtF,GACX,OAAO,SAASsF,GACZ,MAAO,iBAAmBA,GAAKuN,OAAO0L,UAAUjZ,KAAO+I,GAAG/I,IAAMA,GAAKuN,OAAO2L,kBAAoBlZ,GAAKuN,OAAO4L,iBADzG,CAELze,GAIF,SAASsF,GACL,MAAO,CACH2P,aAAc,GAAK3P,GAF3B,CAIEtF,GAAK,SAASsF,EAAGtF,GACf,GAAIsF,EAAEoZ,cAAe,CACjB,GAAIvJ,MAAMnV,GAAI,MAAO,CACjBkV,YAAa,OAEjB,GAAIlV,IAAM,EAAA,EAAO,MAAO,CACpBkV,YAAa,YAEjB,GAAIlV,KAAM,EAAA,EAAQ,MAAO,CACrBkV,YAAa,aAGrB,MAAO,CACHA,YAAa7G,GAAGrO,GAAK,KAAOA,GAb7B,CAeLsF,EAAGtF,GAmBiD,MAAM2e,GAC5D3f,cAGIzC,KAAKoG,OAAI,GAI4C,MAAMic,WAAWD,IAEtB,MAAME,WAAWF,GACrE3f,YAAYsG,GACRzD,QAAStF,KAAKuiB,SAAWxZ,GAIwB,MAAMyZ,WAAWJ,GACtE3f,YAAYsG,GACRzD,QAAStF,KAAKuiB,SAAWxZ,GAS7B,MAAM0Z,WAAWL,GACjB3f,YAAYsG,EAAGtF,GACX6B,QAAStF,KAAK0iB,WAAa3Z,EAAG/I,KAAK+G,EAAItD,GAoBoB,MAAMkf,GACrElgB,YAAYsG,EAAGtF,GACXzD,KAAKia,MAAQlR,EAAG/I,KAAK4iB,UAAYnf,GAQrC,MAAMof,GACNpgB,YAAYsG,EAAGtF,GACXzD,KAAK8iB,WAAa/Z,EAAG/I,KAAK+iB,OAAStf,EAEKiL,cACxC,OAAO,IAAImU,GAE2CnU,cAAc3F,GACpE,OAAO,IAAI8Z,QAAG,EAAQ9Z,GAEoD2F,kBAAkB3F,GAC5F,OAAO,IAAI8Z,GAAG9Z,GAEwCia,aACtD,YAAO,IAAWhjB,KAAK8iB,iBAAc,IAAW9iB,KAAK+iB,OAEzD5Z,QAAQJ,GACJ,OAAO/I,KAAK+iB,SAAWha,EAAEga,SAAW/iB,KAAK8iB,aAAe/Z,EAAE+Z,YAAc9iB,KAAK8iB,WAAW3Z,QAAQJ,EAAE+Z,aAAe/Z,EAAE+Z,aA+CvH,MAAMG,IAKN,MAAMC,WAAWD,GACjBxgB,YAAYsG,EAAGtF,EAAG2G,EAAGyD,EAAI,IACrBvI,QAAStF,KAAKqG,IAAM0C,EAAG/I,KAAKsG,MAAQ7C,EAAGzD,KAAKmjB,aAAe/Y,EAAGpK,KAAKojB,gBAAkBvV,EACrF7N,KAAKiM,KAAO,EAEhBoX,eACI,OAAO,MAgBX,MAAMC,WAAWL,GACjBxgB,YAAYsG,EAAGtF,EAAG2G,EAAGyD,EAAGC,EAAI,IACxBxI,QAAStF,KAAKqG,IAAM0C,EAAG/I,KAAKgG,KAAOvC,EAAGzD,KAAKujB,UAAYnZ,EAAGpK,KAAKmjB,aAAetV,EAC9E7N,KAAKojB,gBAAkBtV,EAAG9N,KAAKiM,KAAO,EAE1CoX,eACI,OAAOrjB,KAAKujB,WAI0C,MAAMC,WAAWP,GAC3ExgB,YAAYsG,EAAGtF,GACX6B,QAAStF,KAAKqG,IAAM0C,EAAG/I,KAAKmjB,aAAe1f,EAAGzD,KAAKiM,KAAO,EAC1DjM,KAAKojB,gBAAkB,GAE3BC,eACI,OAAO,MAUX,MAAMI,WAAWR,GACjBxgB,YAAYsG,EAAGtF,GACX6B,QAAStF,KAAKqG,IAAM0C,EAAG/I,KAAKmjB,aAAe1f,EAAGzD,KAAKiM,KAAO,EAC1DjM,KAAKojB,gBAAkB,GAE3BC,eACI,OAAO,MAmBX,MAAMK,GACI,CACNC,IAAK,YACLC,KAAM,cAGRC,GACQ,CACN,IAAK,YACL,KAAM,qBACN,IAAK,eACL,KAAM,wBACN,KAAM,QACN,KAAM,YACN,iBAAkB,iBAClBC,GAAI,KACJ,SAAU,SACV,qBAAsB,sBAGxBC,GACQ,CACNC,IAAK,MACLC,GAAI,MAmBZ,MAAMC,GACFzhB,YAAYsG,EAAGtF,GACXzD,KAAK+N,WAAahF,EAAG/I,KAAKmiB,cAAgB1e,GAelD,SAAS0gB,GAAGpb,EAAGtF,GACX,OAAIsF,EAAEoZ,cACK,GAAG,IAAIxZ,KAAK,IAAMlF,EAAE8S,SAAS3N,cAAc9F,QAAQ,QAAS,IAAIA,QAAQ,IAAK,QAAQ,YAAcW,EAAEsT,aAAa7H,OAAO,MAE7H,CACHqH,QAAS,GAAK9S,EAAE8S,QAChBE,MAAOhT,EAAEsT,aASjB,SAASqN,GAAGrb,EAAGtF,GACX,OAAOsF,EAAEoZ,cAAgB1e,EAAEmS,WAAanS,EAAEoS,eAG9C,SAASwO,GAAGtb,EAAGtF,GACX,OAAO0gB,GAAGpb,EAAGtF,EAAEuY,eAGnB,SAASsI,GAAGvb,GACR,OAAO0B,IAAI1B,GAAI8S,GAAG0I,cAAc,SAASxb,GACrC,MAAMtF,EAAI0S,GAAGpN,GACb,OAAO,IAAI+N,GAAGrT,EAAE8S,QAAS9S,EAAEgT,OAFC,CAG9B1N,IAGN,SAASyb,GAAGzb,EAAGtF,GACX,OAAO,SAASsF,GACZ,OAAO,IAAIkH,GAAG,CAAE,WAAYlH,EAAEyF,UAAW,YAAazF,EAAE0F,WADrD,CAEL1F,GAAGkG,MAAM,aAAaA,MAAMxL,GAAGyM,kBAGrC,SAASuU,GAAG1b,EAAGtF,GACX,OAAO+gB,GAAGzb,EAAEgF,WAAYtK,EAAEmN,MAG9B,SAAS8T,GAAG3b,EAAGtF,GACX,MAAM2G,EAAI,SAASrB,GACf,MAAMtF,EAAIwM,GAAGY,WAAW9H,GACxB,OAAO0B,EAAEka,GAAGlhB,IAAKA,EAFX,CAGRA,GACF,GAAI2G,EAAEsF,IAAI,KAAO3G,EAAEgF,WAAWS,UAAW,MAAM,IAAIhD,EAAEX,EAAG,oDAAsDT,EAAEsF,IAAI,GAAK,OAAS3G,EAAEgF,WAAWS,WAC/I,GAAIpE,EAAEsF,IAAI,KAAO3G,EAAEgF,WAAWU,SAAU,MAAM,IAAIjD,EAAEX,EAAG,qDAAuDT,EAAEsF,IAAI,GAAK,OAAS3G,EAAEgF,WAAWU,UAC/I,OAAO,IAAIkC,IAAIlG,GAAGoD,EAAIzD,GAAG9K,OAAS,GAAK,cAAgBuO,EAAE6B,IAAI,IAAK7B,EAAEyB,SAAS,KAC7E,IAAIzB,EAGR,SAAS+W,GAAG7b,EAAGtF,GACX,OAAO+gB,GAAGzb,EAAEgF,WAAYtK,GAG5B,SAASohB,GAAG9b,GACR,OAAO,IAAIkH,GAAG,CAAE,WAAYlH,EAAEgF,WAAWS,UAAW,YAAazF,EAAEgF,WAAWU,WAAYyB,kBAG9F,SAAS4U,GAAG/b,EAAGtF,EAAG2G,GACd,MAAO,CACH1H,KAAM+hB,GAAG1b,EAAGtF,GACZgU,OAAQrN,EAAE9D,MAAMkR,SAASC,QAmEjC,SAASsN,GAAGhc,EAAGtF,GAEX,MAAM2G,EAAI,CACN4a,gBAAiB,IAClBnX,EAAIpK,EAAEmN,KACT,OAASnN,EAAEsN,iBAAmB3G,EAAE6a,OAASL,GAAG7b,EAAG8E,GAAIzD,EAAE4a,gBAAgBE,KAAO,CAAE,CAC1EC,aAAc1hB,EAAEsN,gBAChBqU,gBAAgB,MACZhb,EAAE6a,OAASL,GAAG7b,EAAG8E,EAAE0B,WAAYnF,EAAE4a,gBAAgBE,KAAO,CAAE,CAC9DC,aAActX,EAAE4B,iBAEpB,MAAM3B,EAAI,SAAS/E,GACf,GAAI,IAAMA,EAAEzJ,OACZ,OAAO+lB,GAAGpK,GAAGrV,OAAOmD,EAAG,QAFjB,CAGRtF,EAAEyX,SACJpN,IAAM1D,EAAE4a,gBAAgBM,MAAQxX,GAChC,MAAMzO,EAAI,SAAS0J,GACf,GAAI,IAAMA,EAAEzJ,OACZ,OAAOyJ,EAAEsB,KAAKtB,GAEd,SAASA,GACL,MAAO,CACHkR,MAAOsL,GAAGxc,EAAEkR,OACZuL,UAAWC,GAAG1c,EAAE4S,MAHxB,CAOC5S,KAXK,CAYRtF,EAAEwd,SACJ5hB,IAAM+K,EAAE4a,gBAAgB/D,QAAU5hB,GAClC,MAAMgO,EAAI,SAAStE,EAAGtF,GAClB,OAAOsF,EAAEoZ,eAAiBtQ,GAAGpO,GAAKA,EAAI,CAClC6C,MAAO7C,GAFL,CAIRsF,EAAGtF,EAAE0L,OACP,IAAIlN,EACJ,OAAO,OAASoL,IAAMjD,EAAE4a,gBAAgB7V,MAAQ9B,GAAI5J,EAAEyd,UAAY9W,EAAE4a,gBAAgB9D,QAAU,CAC1FwE,QAASzjB,EAAIwB,EAAEyd,SAASrH,UACxBf,OAAQ7W,EAAE2X,WACVnW,EAAE0d,QAAU/W,EAAE4a,gBAAgB7D,MAAQ,SAASpY,GAC/C,MAAO,CACH2c,QAAS3c,EAAE8Q,UACXf,OAAQ/P,EAAE6Q,UAHwB,CAOzCnW,EAAE0d,QAAS/W,EAGhB,SAASqb,GAAG1c,GACR,OAAO2a,GAAG3a,GAId,SAAS4c,GAAG5c,GACR,OAAO8a,GAAG9a,GAGd,SAAS6c,GAAG7c,GACR,OAAOgb,GAAGhb,GAGd,SAASwc,GAAGxc,GACR,MAAO,CACHqL,UAAWrL,EAAEmH,mBAIrB,SAASmV,GAAGtc,GACR,OAAOA,aAAaiR,GAAK,SAASjR,GAC9B,GAAI,OAA8BA,EAAEmR,GAAI,CACpC,GAAIX,GAAGxQ,EAAEzC,OAAQ,MAAO,CACpBuf,YAAa,CACT5L,MAAOsL,GAAGxc,EAAEkR,OACZC,GAAI,WAGZ,GAAIZ,GAAGvQ,EAAEzC,OAAQ,MAAO,CACpBuf,YAAa,CACT5L,MAAOsL,GAAGxc,EAAEkR,OACZC,GAAI,iBAGT,GAAI,OAAkCnR,EAAEmR,GAAI,CAC/C,GAAIX,GAAGxQ,EAAEzC,OAAQ,MAAO,CACpBuf,YAAa,CACT5L,MAAOsL,GAAGxc,EAAEkR,OACZC,GAAI,eAGZ,GAAIZ,GAAGvQ,EAAEzC,OAAQ,MAAO,CACpBuf,YAAa,CACT5L,MAAOsL,GAAGxc,EAAEkR,OACZC,GAAI,gBAIhB,MAAO,CACH4L,YAAa,CACT7L,MAAOsL,GAAGxc,EAAEkR,OACZC,GAAIyL,GAAG5c,EAAEmR,IACT5T,MAAOyC,EAAEzC,QAhCI,CAmCvByC,GAAKA,aAAakS,GAAK,SAASlS,GAC9B,MAAMtF,EAAIsF,EAAEgS,aAAa1Q,KAAKtB,GAAKsc,GAAGtc,KACtC,OAAI,IAAMtF,EAAEnE,OAAemE,EAAE,GACtB,CACHsiB,gBAAiB,CACb7L,GAAI0L,GAAG7c,EAAEmR,IACTgB,QAASzX,IANI,CASvBsF,GAAKpC,IAGX,SAASqf,GAAGjd,GACR,MAAMtF,EAAI,GACV,OAAOsF,EAAE0O,OAAOrI,SAASrG,GAAKtF,EAAEnC,KAAKyH,EAAEmH,qBAAsB,CACzD+V,WAAYxiB,GAIpB,SAASkhB,GAAG5b,GAER,OAAOA,EAAEzJ,QAAU,GAAK,aAAeyJ,EAAE2G,IAAI,IAAM,cAAgB3G,EAAE2G,IAAI,GAkBzE,SAASwW,GAAGnd,GACZ,OAAO,IAAImb,GAAGnb,GAAwB,GA4B1C,MAAMod,GACF1jB,YAIAsG,EAIAtF,EAMA2G,EAAI,IAIEyD,EAAI,IAKJC,EAAI,KACN9N,KAAKsL,EAAIvC,EAAG/I,KAAKomB,QAAU3iB,EAAGzD,KAAKuL,EAAInB,EAAGpK,KAAKqmB,EAAIxY,EAAG7N,KAAKwL,EAAIsC,EAAG9N,KAAK0L,EAAI,EAAG1L,KAAK+L,EAAI,KAEvF/L,KAAK8M,EAAInE,KAAKD,MAAO1I,KAAKsmB,QAQvBA,QACHtmB,KAAK0L,EAAI,EAKN0B,IACHpN,KAAK0L,EAAI1L,KAAKwL,EAMX+B,EAAExE,GAEL/I,KAAKumB,SAGL,MAAM9iB,EAAIsM,KAAK2E,MAAM1U,KAAK0L,EAAI1L,KAAKwN,KAAMpD,EAAI2F,KAAKyW,IAAI,EAAG7d,KAAKD,MAAQ1I,KAAK8M,GAAIe,EAAIkC,KAAKyW,IAAI,EAAG/iB,EAAI2G,GAE3FyD,EAAI,GAAK1D,EAAE,qBAAsB,mBAAmB0D,qBAAqB7N,KAAK0L,4BAA4BjI,uBAAuB2G,aACzIpK,KAAK+L,EAAI/L,KAAKsL,EAAEmb,kBAAkBzmB,KAAKomB,QAASvY,GAAI,KAAO7N,KAAK8M,EAAInE,KAAKD,MACzEK,OAGA/I,KAAK0L,GAAK1L,KAAKqmB,EAAGrmB,KAAK0L,EAAI1L,KAAKuL,IAAMvL,KAAK0L,EAAI1L,KAAKuL,GAAIvL,KAAK0L,EAAI1L,KAAKwL,IAAMxL,KAAK0L,EAAI1L,KAAKwL,GAE9FiC,IACI,OAASzN,KAAK+L,IAAM/L,KAAK+L,EAAE2a,YAAa1mB,KAAK+L,EAAI,MAErDwa,SACI,OAASvmB,KAAK+L,IAAM/L,KAAK+L,EAAEwa,SAAUvmB,KAAK+L,EAAI,MAEgCyB,IAC9E,OAAQuC,KAAK2D,SAAW,IAAM1T,KAAK0L,GA6B3C,MAAMib,WAAW,QACblkB,YAAYsG,EAAGtF,EAAG2G,EAAGyD,GACjBvI,QAAStF,KAAK4mB,gBAAkB7d,EAAG/I,KAAK6mB,oBAAsBpjB,EAAGzD,KAAK8mB,WAAa1c,EACnFpK,KAAK0iB,WAAa7U,EAAG7N,KAAK4N,GAAI,EAElCW,IACI,GAAIvO,KAAK4N,EAAG,MAAM,IAAIpC,EAAEL,EAAG,2CAEmCb,EAAEvB,EAAGtF,EAAG2G,GACtE,OAAOpK,KAAKuO,IAAK3C,QAAQmb,IAAI,CAAE/mB,KAAK4mB,gBAAgBta,WAAYtM,KAAK6mB,oBAAoBva,aAAcW,QAAQY,EAAGC,KAAO9N,KAAK8mB,WAAWxc,EAAEvB,EAAGtF,EAAG2G,EAAGyD,EAAGC,KAAKkZ,OAAOje,IAC/J,KAAM,kBAAoBA,EAAErG,MAAQqG,EAAE5D,OAAS8F,IAAMjL,KAAK4mB,gBAAgBra,kBAC1EvM,KAAK6mB,oBAAoBta,mBAAoBxD,GAAK,IAAIyC,EAAEZ,EAAG7B,EAAE0C,eAGmBb,EAAE7B,EAAGtF,EAAG2G,EAAGyD,GAC/F,OAAO7N,KAAKuO,IAAK3C,QAAQmb,IAAI,CAAE/mB,KAAK4mB,gBAAgBta,WAAYtM,KAAK6mB,oBAAoBva,aAAcW,MAAI,EAAIa,EAAGzO,KAAOW,KAAK8mB,WAAWlc,EAAE7B,EAAGtF,EAAG2G,EAAG0D,EAAGzO,EAAGwO,KAAKmZ,OAAOje,IAClK,KAAM,kBAAoBA,EAAErG,MAAQqG,EAAE5D,OAAS8F,IAAMjL,KAAK4mB,gBAAgBra,kBAC1EvM,KAAK6mB,oBAAoBta,mBAAoBxD,GAAK,IAAIyC,EAAEZ,EAAG7B,EAAE0C,eAGrEwb,YACIjnB,KAAK4N,GAAI,GAMjBgG,eAAesT,GAAGne,EAAGtF,GACjB,MAAM2G,EAAIM,EAAE3B,GAAI8E,EAAIgX,GAAGza,EAAEsY,YAAc,aAAc5U,EAAI,CACrDqZ,OAAQ1jB,EAAE4G,KAAKtB,GA1VvB,SAAYA,EAAGtF,GACX,IAAI2G,EACJ,GAAI3G,aAAayf,GAAI9Y,EAAI,CACrBgd,OAAQtC,GAAG/b,EAAGtF,EAAE4C,IAAK5C,EAAE6C,aACnB,GAAI7C,aAAa+f,GAAIpZ,EAAI,CAC7B6U,OAAQwF,GAAG1b,EAAGtF,EAAE4C,WACZ,GAAI5C,aAAa6f,GAAIlZ,EAAI,CAC7Bgd,OAAQtC,GAAG/b,EAAGtF,EAAE4C,IAAK5C,EAAEuC,MACvBqhB,WAAYrB,GAAGviB,EAAE8f,gBACb,CACJ,KAAM9f,aAAaggB,IAAK,OAAO9c,IAC/ByD,EAAI,CACAkd,OAAQ7C,GAAG1b,EAAGtF,EAAE4C,MAGxB,OAAO5C,EAAE2f,gBAAgB9jB,OAAS,IAAM8K,EAAEmd,iBAAmB9jB,EAAE2f,gBAAgB/Y,KAAKtB,GAAK,SAASA,EAAGtF,GACjG,MAAM2G,EAAI3G,EAAEmf,UACZ,GAAIxY,aAAaiY,GAAI,MAAO,CACxBjO,UAAW3Q,EAAEwW,MAAM/J,kBACnBsX,iBAAkB,gBAEtB,GAAIpd,aAAakY,GAAI,MAAO,CACxBlO,UAAW3Q,EAAEwW,MAAM/J,kBACnBuX,sBAAuB,CACnB3O,OAAQ1O,EAAEmY,WAGlB,GAAInY,aAAaoY,GAAI,MAAO,CACxBpO,UAAW3Q,EAAEwW,MAAM/J,kBACnBwX,mBAAoB,CAChB5O,OAAQ1O,EAAEmY,WAGlB,GAAInY,aAAaqY,GAAI,MAAO,CACxBrO,UAAW3Q,EAAEwW,MAAM/J,kBACnByX,UAAWvd,EAAErD,GAEjB,MAAMJ,IAtB+E,CAuBvF,EAAGoC,MAAOtF,EAAE0f,aAAaH,SAAW5Y,EAAEwd,gBAAkB,SAAS7e,EAAGtF,GAClE,YAAO,IAAWA,EAAEqf,WAAa,CAC7BA,WAAYuB,GAAGtb,EAAGtF,EAAEqf,kBACpB,IAAWrf,EAAEsf,OAAS,CACtBA,OAAQtf,EAAEsf,QACVpc,IALkD,CAMxDoC,EAAGtF,EAAE0f,eAAgB/Y,EA8SCyd,CAAGzd,EAAEsY,WAAY3Z,YAEnCqB,EAAEE,EAAE,SAAUuD,EAAGC,GAG3B8F,eAAekU,GAAG/e,EAAGtF,GACjB,MAAM2G,EAAIM,EAAE3B,GAAI8E,EAAIgX,GAAGza,EAAEsY,YAAc,aAAc5U,EAAI,CACrDia,UAAWtkB,EAAE4G,KAAKtB,GAAK0b,GAAGra,EAAEsY,WAAY3Z,MACzC1J,QAAU+K,EAAEQ,EAAE,oBAAqBiD,EAAGC,EAAGrK,EAAEnE,QAAS+N,EAAI,IAAIlB,IAC/D9M,EAAE+P,SAASrG,IACP,MAAMtF,EApXd,SAAYsF,EAAGtF,GACX,MAAO,UAAWA,EAAI,SAASsF,EAAGtF,GAC9BgH,IAAIhH,EAAEukB,OAAQvkB,EAAEukB,MAAMtlB,KAAMe,EAAEukB,MAAMlF,WACpC,MAAM1Y,EAAIsa,GAAG3b,EAAGtF,EAAEukB,MAAMtlB,MAAOmL,EAAIyW,GAAG7gB,EAAEukB,MAAMlF,YAAahV,EAAIrK,EAAEukB,MAAMjI,WAAauE,GAAG7gB,EAAEukB,MAAMjI,YAAclE,GAAG7L,MAAO3Q,EAAI,IAAIigB,GAAG,CAC9H9H,SAAU,CACNC,OAAQhU,EAAEukB,MAAMvQ,UAGxB,OAAOkI,GAAGsI,iBAAiB7d,EAAGyD,EAAGC,EAAGzO,GAPlB,CAQpB0J,EAAGtF,GAAK,YAAaA,EAAI,SAASsF,EAAGtF,GACnCgH,IAAIhH,EAAEykB,SAAUzd,IAAIhH,EAAEqc,UACtB,MAAM1V,EAAIsa,GAAG3b,EAAGtF,EAAEykB,SAAUra,EAAIyW,GAAG7gB,EAAEqc,UACrC,OAAOH,GAAGwI,cAAc/d,EAAGyD,GAHJ,CAIzB9E,EAAGtF,GAAKkD,IAuWIyhB,CAAGhe,EAAEsY,WAAY3Z,GAC3BsE,EAAEjB,IAAI3I,EAAE4C,IAAIoF,WAAYhI,MAE5B,MAAMxB,EAAI,GACV,OAAOwB,EAAE2L,SAASrG,IACd,MAAMtF,EAAI4J,EAAEqC,IAAI3G,EAAE0C,YAClBhB,IAAIhH,GAAIxB,EAAEX,KAAKmC,MACdxB,EA8EL,MAAMomB,GAAK,IAAIlc,IAWnB,SAASmc,GAAGvf,GACR,GAAIA,EAAEwf,YAAa,MAAM,IAAI/c,EAAEL,EAAG,2CAClC,IAAKkd,GAAG5J,IAAI1V,GAAI,CACZoB,EAAE,oBAAqB,0BACvB,MAAM9K,EAAI,SAAS0J,GACf,OAAO,IAAIwK,GAAGxK,EAAGyf,MAAMC,KAAK,OADtB,EAEPhlB,EAAIsF,EAAE2f,YAAate,EAAIrB,EAAE4f,IAAIC,QAAQ5a,OAAS,GAAIH,EAAI9E,EAAE8f,gBAAiB/a,EAAI/E,EAAE+f,kBAClF,IAAIlb,GAAEnK,EAAG2G,EAAGyD,EAAGC,EAAEtJ,KAAMsJ,EAAEI,IAAKJ,EAAEib,6BAA8Bjb,EAAEkb,kCAAmCtX,GAAG5D,EAAEmb,gCAAiCnb,EAAEQ,mBAAoBjB,EAAI6Y,GAAGnd,EAAE2f,aAAczmB,EAAI,SAAS8G,EAAGtF,EAAG2G,EAAGyD,GACxM,OAAO,IAAI8Y,GAAG5d,EAAGtF,EAAG2G,EAAGyD,GAD+J,CAExL9E,EAAEmgB,iBAAkBngB,EAAEogB,qBAAsB9pB,EAAGgO,GACjDgb,GAAGjc,IAAIrD,EAAG9G,GAEd,IAAIwB,EAAG2G,EAAGyD,EAAGC,EAgBV,OAAOua,GAAG3Y,IAAI3G,GAYrB,MAAMqgB,GACF3mB,YAAYsG,GACR,IAAItF,EAAG2G,EACP,QAAI,IAAWrB,EAAEvE,KAAM,CACnB,QAAI,IAAWuE,EAAEmF,IAAK,MAAM,IAAI1C,EAAEX,EAAG,sDACrC7K,KAAKwE,KAAO,2BAA4BxE,KAAKkO,KAAM,OAChDlO,KAAKwE,KAAOuE,EAAEvE,KAAMxE,KAAKkO,IAAM,QAAUzK,EAAIsF,EAAEmF,WAAQ,IAAWzK,GAAKA,EAC9E,GAAIzD,KAAKqpB,YAActgB,EAAEsgB,YAAarpB,KAAKspB,4BAA8BvgB,EAAEugB,0BAC3EtpB,KAAKupB,MAAQxgB,EAAEygB,gBAAY,IAAWzgB,EAAE0gB,eAAgBzpB,KAAKypB,eAAiB,aAAe,CACzF,IAAK,IAAM1gB,EAAE0gB,gBAAkB1gB,EAAE0gB,eAAiB,QAAS,MAAM,IAAIje,EAAEX,EAAG,2CAC1E7K,KAAKypB,eAAiB1gB,EAAE0gB,gBAE3B,SAAS1gB,EAAGtF,EAAG2G,EAAGyD,GACf,IAAI,IAAOpK,IAAK,IAAOoK,EAAG,MAAM,IAAIrC,EAAEX,EAAG,+FAD5C,CAEC,EAAgC9B,EAAEggB,6BAA8B,EAAqChgB,EAAEigB,mCACzGhpB,KAAK+oB,+BAAiChgB,EAAEggB,6BAA8B/oB,KAAK+oB,6BAA+B/oB,KAAKgpB,mCAAoC,OAAK,IAAWjgB,EAAEigB,kCAAoChpB,KAAKgpB,mCAAoC,EAIlPhpB,KAAKgpB,oCAAsCjgB,EAAEigB,kCAC7ChpB,KAAKipB,+BAAiCvX,GAAG,QAAUtH,EAAIrB,EAAEkgB,sCAAmC,IAAW7e,EAAIA,EAAI,IAC/G,SAASrB,GACL,QAAI,IAAWA,EAAE4I,eAAgB,CAC7B,GAAIiH,MAAM7P,EAAE4I,gBAAiB,MAAM,IAAInG,EAAEX,EAAG,iCAAiC9B,EAAE4I,oCAC/E,GAAI5I,EAAE4I,eAAiB,EAAG,MAAM,IAAInG,EAAEX,EAAG,iCAAiC9B,EAAE4I,+CAC5E,GAAI5I,EAAE4I,eAAiB,GAAI,MAAM,IAAInG,EAAEX,EAAG,iCAAiC9B,EAAE4I,iDAJrF,CA2BH3R,KAAKipB,gCAAiCjpB,KAAKsO,kBAAoBvF,EAAEuF,gBAElEnF,QAAQJ,GACJ,OAAO/I,KAAKwE,OAASuE,EAAEvE,MAAQxE,KAAKkO,MAAQnF,EAAEmF,KAAOlO,KAAKqpB,cAAgBtgB,EAAEsgB,aAAerpB,KAAKypB,iBAAmB1gB,EAAE0gB,gBAAkBzpB,KAAK+oB,+BAAiChgB,EAAEggB,8BAAgC/oB,KAAKgpB,oCAAsCjgB,EAAEigB,oCAAsCvlB,EAAIzD,KAAKipB,+BAC3S7e,EAAIrB,EAAEkgB,+BAAgCxlB,EAAEkO,iBAAmBvH,EAAEuH,iBAAmB3R,KAAKspB,4BAA8BvgB,EAAEugB,2BAA6BtpB,KAAKsO,kBAAoBvF,EAAEuF,gBAC7K,IAAI7K,EAAG2G,GAIf,MAAMsf,GAEFjnB,YAAYsG,EAAGtF,EAAG2G,EAAGyD,GACjB7N,KAAKkpB,iBAAmBngB,EAAG/I,KAAKmpB,qBAAuB1lB,EAAGzD,KAAK0oB,YAActe,EAC7EpK,KAAK2pB,KAAO9b,EAIZ7N,KAAKiM,KAAO,iBAAkBjM,KAAK6oB,gBAAkB,SAAU7oB,KAAK4pB,UAAY,IAAIR,GAAG,IACvFppB,KAAK6pB,iBAAkB,EAKhBlB,UACP,IAAK3oB,KAAK2pB,KAAM,MAAM,IAAIne,EAAEL,EAAG,gFAC/B,OAAOnL,KAAK2pB,KAEZG,mBACA,OAAO9pB,KAAK6pB,gBAEZtB,kBACA,YAAO,IAAWvoB,KAAK+pB,eAE3BC,aAAajhB,GACT,GAAI/I,KAAK6pB,gBAAiB,MAAM,IAAIre,EAAEL,EAAG,sKACzCnL,KAAK4pB,UAAY,IAAIR,GAAGrgB,QAAI,IAAWA,EAAEsgB,cAAgBrpB,KAAKkpB,iBAAmB,SAASngB,GACtF,IAAKA,EAAG,OAAO,IAAIsD,EACnB,OAAQtD,EAAEkD,MACR,IAAK,aACH,OAAO,IAAIsB,GAAExE,EAAEkhB,cAAgB,IAAKlhB,EAAEmhB,UAAY,KAAMnhB,EAAEohB,kBAAoB,MAEhF,IAAK,WACH,OAAOphB,EAAEqhB,OAEX,QACE,MAAM,IAAI5e,EAAEX,EAAG,sEAV0D,CAY/E9B,EAAEsgB,cAERgB,eACI,OAAOrqB,KAAK4pB,UAEhBd,kBACI,OAAO9oB,KAAK6pB,iBAAkB,EAAI7pB,KAAK4pB,UAE3CU,UACI,OAAOtqB,KAAK+pB,iBAAmB/pB,KAAK+pB,eAAiB/pB,KAAKuqB,cAAevqB,KAAK+pB,eAEC3S,SAC/E,MAAO,CACHuR,IAAK3oB,KAAK2pB,KACV5b,WAAY/N,KAAK0oB,YACjB8B,SAAUxqB,KAAK4pB,WAShBW,aACH,OAAO,SAASxhB,GACZ,MAAMtF,EAAI4kB,GAAG3Y,IAAI3G,GACjBtF,IAAM0G,EAAE,oBAAqB,sBAAuBke,GAAGpJ,OAAOlW,GAAItF,EAAEwjB,aAFjE,CAGLjnB,MAAO4L,QAAQC,WAIzB,SAAS4e,GAAG1hB,EAAGtF,EAAG2G,GACdA,IAAMA,EAAI,aACV,MAAMyD,EAAI6c,EAAa3hB,EAAG,kBAC1B,GAAI8E,EAAE8c,cAAcvgB,GAAI,MAAM,IAAIoB,EAAEL,EAAG,mDACvC,OAAO0C,EAAE+c,WAAW,CAChBhC,QAASnlB,EACTonB,mBAAoBzgB,IAI5B,SAAS0gB,GAAGrnB,EAAG2G,GACX,MAAMyD,EAAI,iBAAmBpK,EAAIA,EAAIsF,IAAK+E,EAAI,iBAAmBrK,EAAIA,EAAI2G,GAAK,YAAa/K,EAAIqrB,EAAa7c,EAAG,kBAAkBkd,aAAa,CAC1IC,WAAYld,IAEhB,IAAKzO,EAAEyqB,aAAc,CACjB,MAAM/gB,EAAIrC,EAAE,aACZqC,GAAKkiB,GAAG5rB,KAAM0J,GAElB,OAAO1J,EAeP,SAAS4rB,GAAGliB,EAAGtF,EAAG2G,EAAGyD,EAAI,IACzB,IAAIC,EACJ,MAAMzO,GAAK0J,EAAIyI,GAAGzI,EAAG2gB,KAAKW,eAAgBhd,EAAI,GAAG5J,KAAK2G,IACtD,GAAI,6BAA+B/K,EAAEmF,MAAQnF,EAAEmF,OAAS6I,GAAKjH,EAAE,oGAC/D2C,EAAEihB,aAAazkB,OAAOmU,OAAOnU,OAAOmU,OAAO,GAAIra,GAAI,CAC/CmF,KAAM6I,EACNa,KAAK,KACJL,EAAEqd,cAAe,CAClB,IAAIznB,EAAG2G,EACP,GAAI,iBAAmByD,EAAEqd,cAAeznB,EAAIoK,EAAEqd,cAAe9gB,EAAItB,EAAES,cAAgB,CAG/E9F,EChkII,SACdmJ,EACA4B,GAEA,GAAI5B,EAAM5D,IACR,MAAM,IAAIvI,MACR,gHAIJ,MAKM0qB,EAAU3c,GAAa,eACvB4c,EAAMxe,EAAMwe,KAAO,EACnBC,EAAMze,EAAMye,KAAOze,EAAM0e,QAC/B,IAAKD,EACH,MAAM,IAAI5qB,MAAM,wDAGlB,MAAM8qB,EAAOhmB,OAAAmU,OAAA,CAEX8R,IAAK,kCAAkCL,IACvCM,IAAKN,EACLC,IAAAA,EACAM,IAAKN,EAAM,KACXO,UAAWP,EACXC,IAAAA,EACAC,QAASD,EACTO,SAAU,CACRC,iBAAkB,SAClBC,WAAY,KAIXlf,GAKL,MAAO,CACLjK,EAA8BmB,KAAK0G,UAjCtB,CACbuhB,IAAK,OACL9f,KAAM,SAgCNtJ,EAA8BmB,KAAK0G,UAAU+gB,IAH7B,IAKhBhqB,KAAK,KDkhIO+L,CAAEO,EAAEqd,cAAe,QAAUpd,EAAI/E,EAAE4gB,YAAS,IAAW7b,OAAI,EAASA,EAAE8a,QAAQpa,WAClF,MAAMnP,EAAIwO,EAAEqd,cAAcG,KAAOxd,EAAEqd,cAAcI,QACjD,IAAKjsB,EAAG,MAAM,IAAImM,EAAEX,EAAG,wDACvBT,EAAI,IAAItB,EAAEzJ,GAEd0J,EAAEmgB,iBAAmB,IAAIvc,GAAE,IAAIZ,EAAEtI,EAAG2G,KAuBxC,SAAS4hB,GAAGjjB,GACZ,OAAOA,EAAIyI,GAAGzI,EAAG2gB,IAAKjmB,EAAEsF,EAAE4f,IAAK,kBAAmB5f,EAAEuhB,UAuCxD,MAAM2B,GAOFxpB,YAEAsG,EAAI,QAAStF,GACTzD,KAAKksB,eAAiBnjB,EAAG/I,KAAKmsB,mBAAqB1oB,EAEnDzD,KAAKiM,KAAO,kBAMhB,MAAMmgB,GAEN3pB,YAAYsG,EAAGtF,EAAG2G,GACdpK,KAAKqsB,gBAAkB5oB,EAAGzD,KAAKssB,MAAQliB,EAEvCpK,KAAKiM,KAAO,yBAA0BjM,KAAKusB,MAAQxjB,EAYhD/C,OACH,OAAOhG,KAAKqsB,gBAAgBG,iBAAiBxsB,KAAKssB,QAwBtD,MAAMG,GAENhqB,YAAYsG,EAIZtF,EAAG2G,GACCpK,KAAK0sB,UAAYjpB,EAAGzD,KAAK2sB,KAAOviB,EAEhCpK,KAAKiM,KAAO,WAAYjM,KAAK4sB,UAAY7jB,EAEzC8jB,YACA,OAAO7sB,KAAK2sB,KAAK/b,KAIVkc,SACP,OAAO9sB,KAAK2sB,KAAK/b,KAAKnB,cAKfmB,WACP,OAAO5Q,KAAK2sB,KAAK/b,KAAKV,kBAIf+U,aACP,OAAO,IAAI8H,GAAG/sB,KAAK4sB,UAAW5sB,KAAK0sB,UAAW1sB,KAAK2sB,KAAK/b,KAAKrB,WAEjEyd,cAAcjkB,GACV,OAAO,IAAI0jB,GAAGzsB,KAAK4sB,UAAW7jB,EAAG/I,KAAK2sB,OAO1C,MAAMM,GAGNxqB,YAAYsG,EAIZtF,EAAG2G,GACCpK,KAAK0sB,UAAYjpB,EAAGzD,KAAKktB,OAAS9iB,EAElCpK,KAAKiM,KAAO,QAASjM,KAAK4sB,UAAY7jB,EAE1CikB,cAAcjkB,GACV,OAAO,IAAIkkB,GAAGjtB,KAAK4sB,UAAW7jB,EAAG/I,KAAKktB,SAO1C,MAAMH,WAAWE,GAEjBxqB,YAAYsG,EAAGtF,EAAG2G,GACd9E,MAAMyD,EAAGtF,EAAG,IAAI4d,GAAGjX,IAAKpK,KAAK6sB,MAAQziB,EAErCpK,KAAKiM,KAAO,aAE2B6gB,SACvC,OAAO9sB,KAAKktB,OAAOtc,KAAKnB,cAKjBmB,WACP,OAAO5Q,KAAKktB,OAAOtc,KAAKV,kBAKjB+U,aACP,MAAMlc,EAAI/I,KAAK6sB,MAAMtd,UACrB,OAAOxG,EAAE4G,UAAY,KAAO,IAAI8c,GAAGzsB,KAAK4sB,UACvB,KAAM,IAAIjc,GAAG5H,IAElCikB,cAAcjkB,GACV,OAAO,IAAIgkB,GAAG/sB,KAAK4sB,UAAW7jB,EAAG/I,KAAK6sB,QAI9C,SAASM,GAAGpkB,EAAGtF,KAAM2G,GACjB,GAAIrB,EAAI2E,EAAE3E,GAAIoI,GAAG,aAAc,OAAQ1N,GAAIsF,aAAa2gB,GAAI,CACxD,MAAM7b,EAAIoC,GAAGY,WAAWpN,KAAM2G,GAC9B,OAAOkH,GAAGzD,GAAI,IAAIkf,GAAGhkB,EAAoB,KAAM8E,GAEnD,CACI,KAAM9E,aAAa0jB,IAAM1jB,aAAagkB,IAAK,MAAM,IAAIvhB,EAAEX,EAAG,iHAC1D,MAAMgD,EAAI9E,EAAE8jB,MAAM5d,MAAMgB,GAAGY,WAAWpN,KAAM2G,IAC5C,OAAOkH,GAAGzD,GAAI,IAAIkf,GAAGhkB,EAAE6jB,UACN,KAAM/e,IAgB3B,SAASuf,GAAGrkB,EAAGtF,GACf,GAAIsF,EAAIyI,GAAGzI,EAAG2gB,IAAKvY,GAAG,kBAAmB,gBAAiB1N,GAAIA,EAAE0M,QAAQ,MAAQ,EAAG,MAAM,IAAI3E,EAAEX,EAAG,0BAA0BpH,iFAC5H,OAAO,IAAIwpB,GAAGlkB,EACG,KAAM,SAASA,GAC5B,OAAO,IAAIsY,GAAGpR,GAAGa,YAAa/H,GADX,CAErBtF,IAGN,SAAS4pB,GAAGtkB,EAAGtF,KAAM2G,GACjB,GAAIrB,EAAI2E,EAAE3E,GAGV,IAAMqM,UAAU9V,SAAWmE,EAAIkR,GAAG2Y,KAAMnc,GAAG,MAAO,OAAQ1N,GAAIsF,aAAa2gB,GAAI,CAC3E,MAAM7b,EAAIoC,GAAGY,WAAWpN,KAAM2G,GAC9B,OAAOgH,GAAGvD,GAAI,IAAI4e,GAAG1jB,EACJ,KAAM,IAAI4H,GAAG9C,IAElC,CACI,KAAM9E,aAAa0jB,IAAM1jB,aAAagkB,IAAK,MAAM,IAAIvhB,EAAEX,EAAG,iHAC1D,MAAMgD,EAAI9E,EAAE8jB,MAAM5d,MAAMgB,GAAGY,WAAWpN,KAAM2G,IAC5C,OAAOgH,GAAGvD,GAAI,IAAI4e,GAAG1jB,EAAE6jB,UAAW7jB,aAAagkB,GAAKhkB,EAAE2jB,UAAY,KAAM,IAAI/b,GAAG9C,KAWnF,SAAS0f,GAAGxkB,EAAGtF,GACf,OAAOsF,EAAI2E,EAAE3E,GAAItF,EAAIiK,EAAEjK,IAAKsF,aAAa0jB,IAAM1jB,aAAagkB,MAAQtpB,aAAagpB,IAAMhpB,aAAaspB,KAAQhkB,EAAE6jB,YAAcnpB,EAAEmpB,WAAa7jB,EAAE6H,OAASnN,EAAEmN,MAAQ7H,EAAE2jB,YAAcjpB,EAAEipB,UAWlL,SAASc,GAAGzkB,EAAGtF,GACf,OAAOsF,EAAI2E,EAAE3E,GAAItF,EAAIiK,EAAEjK,GAAIsF,aAAakkB,IAAMxpB,aAAawpB,IAAOlkB,EAAE6jB,YAAcnpB,EAAEmpB,WA31CxF,SAAY7jB,EAAGtF,GACX,OAAO,SAASsF,EAAGtF,GACf,GAAIsF,EAAEoG,QAAU1L,EAAE0L,MAAO,OAAO,EAChC,GAAIpG,EAAEkY,QAAQ3hB,SAAWmE,EAAEwd,QAAQ3hB,OAAQ,OAAO,EAClD,IAAK,IAAI8K,EAAI,EAAGA,EAAIrB,EAAEkY,QAAQ3hB,OAAQ8K,IAAK,IAAKwR,GAAG7S,EAAEkY,QAAQ7W,GAAI3G,EAAEwd,QAAQ7W,IAAK,OAAO,EACvF,GAAIrB,EAAEmS,QAAQ5b,SAAWmE,EAAEyX,QAAQ5b,OAAQ,OAAO,EAClD,IAAK,IAAI8K,EAAI,EAAGA,EAAIrB,EAAEmS,QAAQ5b,OAAQ8K,IAAK,IAAKiR,GAAGtS,EAAEmS,QAAQ9Q,GAAI3G,EAAEyX,QAAQ9Q,IAAK,OAAO,EACvF,OAAOrB,EAAEgI,kBAAoBtN,EAAEsN,mBAAqBhI,EAAE6H,KAAKzH,QAAQ1F,EAAEmN,SAAWkJ,GAAG/Q,EAAEmY,QAASzd,EAAEyd,UAAYpH,GAAG/Q,EAAEoY,MAAO1d,EAAE0d,OANvH,CAOLU,GAAG9Y,GAAI8Y,GAAGpe,KAAOsF,EAAEwY,YAAc9d,EAAE8d,UAm1C4DkM,CAAG1kB,EAAEmkB,OAAQzpB,EAAEypB,SAAWnkB,EAAE2jB,YAAcjpB,EAAEipB,UAqB7I,MAAMgB,GAENjrB,YAAYsG,GACR/I,KAAK2tB,YAAc5kB,EAOhB2F,wBAAwB3F,GAC3B,IACI,OAAO,IAAI2kB,GAAGrY,GAAGuB,iBAAiB7N,IACpC,MAAOA,GACL,MAAM,IAAIyC,EAAEX,EAAG,gDAAkD9B,IAOlE2F,sBAAsB3F,GACzB,OAAO,IAAI2kB,GAAGrY,GAAGwB,eAAe9N,IAM7B6M,WACH,OAAO5V,KAAK2tB,YAAY/X,WAMrBC,eACH,OAAO7V,KAAK2tB,YAAY9X,eAMrBpK,WACH,MAAO,iBAAmBzL,KAAK4V,WAAa,IAOzCzM,QAAQJ,GACX,OAAO/I,KAAK2tB,YAAYxkB,QAAQJ,EAAE4kB,cA2BtC,MAAMC,GAONnrB,eAAesG,GACX,IAAK,IAAItF,EAAI,EAAGA,EAAIsF,EAAEzJ,SAAUmE,EAAG,GAAI,IAAMsF,EAAEtF,GAAGnE,OAAQ,MAAM,IAAIkM,EAAEX,EAAG,2EACzE7K,KAAK6tB,cAAgB,IAAItd,GAAGxH,GAOzBI,QAAQJ,GACX,OAAO/I,KAAK6tB,cAAc1kB,QAAQJ,EAAE8kB,gBAOxC,SAASC,KACT,OAAO,IAAIF,GAAG,YAsBd,MAAMG,GAKNtrB,YAAYsG,GACR/I,KAAKguB,YAAcjlB,GA0BvB,MAAMklB,GAONxrB,YAAYsG,EAAGtF,GACX,IAAKyqB,SAASnlB,IAAMA,GAAK,IAAMA,EAAI,GAAI,MAAM,IAAIyC,EAAEX,EAAG,0DAA4D9B,GAClH,IAAKmlB,SAASzqB,IAAMA,GAAK,KAAOA,EAAI,IAAK,MAAM,IAAI+H,EAAEX,EAAG,6DAA+DpH,GACvHzD,KAAKmuB,KAAOplB,EAAG/I,KAAKouB,MAAQ3qB,EAIrB+U,eACP,OAAOxY,KAAKmuB,KAIL1V,gBACP,OAAOzY,KAAKouB,MAOTjlB,QAAQJ,GACX,OAAO/I,KAAKmuB,OAASplB,EAAEolB,MAAQnuB,KAAKouB,QAAUrlB,EAAEqlB,MAEmBhX,SACnE,MAAO,CACHoB,SAAUxY,KAAKmuB,KACf1V,UAAWzY,KAAKouB,OAMjBjX,WAAWpO,GACd,OAAO6L,GAAG5U,KAAKmuB,KAAMplB,EAAEolB,OAASvZ,GAAG5U,KAAKouB,MAAOrlB,EAAEqlB,QAmBrD,MAAMC,GAAK,WAEuD,MAAMC,GACxE7rB,YAAYsG,EAAGtF,EAAG2G,GACdpK,KAAKgG,KAAO+C,EAAG/I,KAAKujB,UAAY9f,EAAGzD,KAAKojB,gBAAkBhZ,EAE9DmkB,WAAWxlB,EAAGtF,GACV,OAAO,OAASzD,KAAKujB,UAAY,IAAID,GAAGva,EAAG/I,KAAKgG,KAAMhG,KAAKujB,UAAW9f,EAAGzD,KAAKojB,iBAAmB,IAAIF,GAAGna,EAAG/I,KAAKgG,KAAMvC,EAAGzD,KAAKojB,kBAI5D,MAAMoL,GAC5E/rB,YAAYsG,EAEZtF,EAAG2G,GACCpK,KAAKgG,KAAO+C,EAAG/I,KAAKujB,UAAY9f,EAAGzD,KAAKojB,gBAAkBhZ,EAE9DmkB,WAAWxlB,EAAGtF,GACV,OAAO,IAAI6f,GAAGva,EAAG/I,KAAKgG,KAAMhG,KAAKujB,UAAW9f,EAAGzD,KAAKojB,kBAI5D,SAASqL,GAAG1lB,GACR,OAAQA,GACN,KAAK,EAEG,KAAK,EAEL,KAAK,EACX,OAAO,EAET,KAAK,EACL,KAAK,EACH,OAAO,EAET,QACE,MAAMpC,KAImD,MAAM+nB,GAmBnEjsB,YAAYsG,EAAGtF,EAAG2G,EAAGyD,EAAGC,EAAGzO,GACvBW,KAAKwqB,SAAWzhB,EAAG/I,KAAK+N,WAAatK,EAAGzD,KAAK0iB,WAAatY,EAAGpK,KAAKspB,0BAA4Bzb,OAG9F,IAAWC,GAAK9N,KAAKiQ,KAAMjQ,KAAKojB,gBAAkBtV,GAAK,GAAI9N,KAAKujB,UAAYlkB,GAAK,GAEjFuR,WACA,OAAO5Q,KAAKwqB,SAAS5Z,KAErBN,SACA,OAAOtQ,KAAKwqB,SAASla,GAEgDC,GAAGxH,GACxE,OAAO,IAAI2lB,GAAGnpB,OAAOmU,OAAOnU,OAAOmU,OAAO,GAAI1Z,KAAKwqB,UAAWzhB,GAAI/I,KAAK+N,WAAY/N,KAAK0iB,WAAY1iB,KAAKspB,0BAA2BtpB,KAAKojB,gBAAiBpjB,KAAKujB,WAEnK5S,GAAG5H,GACC,IAAItF,EACJ,MAAM2G,EAAI,QAAU3G,EAAIzD,KAAK4Q,YAAS,IAAWnN,OAAI,EAASA,EAAEwL,MAAMlG,GAAI8E,EAAI7N,KAAKuQ,GAAG,CAClFK,KAAMxG,EACN+G,IAAI,IAER,OAAOtD,EAAEuD,GAAGrI,GAAI8E,EAEpByD,GAAGvI,GACC,IAAItF,EACJ,MAAM2G,EAAI,QAAU3G,EAAIzD,KAAK4Q,YAAS,IAAWnN,OAAI,EAASA,EAAEwL,MAAMlG,GAAI8E,EAAI7N,KAAKuQ,GAAG,CAClFK,KAAMxG,EACN+G,IAAI,IAER,OAAOtD,EAAEoC,KAAMpC,EAEnB0D,GAAGxI,GAGC,OAAO/I,KAAKuQ,GAAG,CACXK,UAAM,EACNO,IAAI,IAGZK,GAAGzI,GACC,OAAO4lB,GAAG5lB,EAAG/I,KAAKwqB,SAASoE,WAAY5uB,KAAKwqB,SAAS9Y,KAAM,EAAI1R,KAAK4Q,KAAM5Q,KAAKwqB,SAAS5Y,IAEVid,SAAS9lB,GACvF,YAAO,IAAW/I,KAAKujB,UAAUvK,MAAMvV,GAAKsF,EAAE6G,WAAWnM,WAAQ,IAAWzD,KAAKojB,gBAAgBpK,MAAMvV,GAAKsF,EAAE6G,WAAWnM,EAAEwW,SAE/HhK,KAGI,GAAIjQ,KAAK4Q,KAAM,IAAK,IAAI7H,EAAI,EAAGA,EAAI/I,KAAK4Q,KAAKtR,OAAQyJ,IAAK/I,KAAKoR,GAAGpR,KAAK4Q,KAAKlB,IAAI3G,IAEpFqI,GAAGrI,GACC,GAAI,IAAMA,EAAEzJ,OAAQ,MAAMU,KAAKwR,GAAG,qCAClC,GAAIid,GAAGzuB,KAAKsQ,KAAO+d,GAAG7d,KAAKzH,GAAI,MAAM/I,KAAKwR,GAAG,mDAOjD,MAAMsd,GACNrsB,YAAYsG,EAAGtF,EAAG2G,GACdpK,KAAK+N,WAAahF,EAAG/I,KAAKspB,0BAA4B7lB,EAAGzD,KAAK0iB,WAAatY,GAAK8b,GAAGnd,GAEtCgmB,GAAGhmB,EAAGtF,EAAG2G,EAAGyD,GAAI,GAC7D,OAAO,IAAI6gB,GAAG,CACVpe,GAAIvH,EACJ6lB,WAAYnrB,EACZmO,GAAIxH,EACJwG,KAAML,GAAGO,YACTK,IAAI,EACJO,GAAI7D,GACL7N,KAAK+N,WAAY/N,KAAK0iB,WAAY1iB,KAAKspB,4BAIlD,SAAS0F,GAAGjmB,GACR,MAAMtF,EAAIsF,EAAE+f,kBAAmB1e,EAAI8b,GAAGnd,EAAE2f,aACxC,OAAO,IAAIoG,GAAG/lB,EAAE2f,cAAejlB,EAAE6lB,0BAA2Blf,GAGlB,SAAS6kB,GAAGlmB,EAAGtF,EAAG2G,EAAGyD,EAAGC,EAAGzO,EAAI,IACzE,MAAMgO,EAAItE,EAAEgmB,GAAG1vB,EAAE6vB,OAAS7vB,EAAE8vB,YAAc,EAAkC,EAA6B1rB,EAAG2G,EAAG0D,GAC/GshB,GAAG,sCAAuC/hB,EAAGQ,GAC7C,MAAM5L,EAAIotB,GAAGxhB,EAAGR,GAChB,IAAI9N,EAAGmH,EACP,GAAIrH,EAAE6vB,MAAO3vB,EAAI,IAAI6f,GAAG/R,EAAEkW,WAAY7c,EAAI2G,EAAE+V,qBAAsB,GAAI/jB,EAAE8vB,YAAa,CACjF,MAAMpmB,EAAI,GACV,IAAK,MAAM8E,KAAKxO,EAAE8vB,YAAa,CAC3B,MAAMrhB,EAAIwhB,GAAG7rB,EAAGoK,EAAGzD,GACnB,IAAKiD,EAAEwhB,SAAS/gB,GAAI,MAAM,IAAItC,EAAEX,EAAG,UAAUiD,wEAC7CyhB,GAAGxmB,EAAG+E,IAAM/E,EAAEzH,KAAKwM,GAEvBvO,EAAI,IAAI6f,GAAGrW,GAAIrC,EAAI2G,EAAE+V,gBAAgB/S,QAAQtH,GAAKxJ,EAAE8f,OAAOtW,EAAEkR,cAC1D1a,EAAI,KAAMmH,EAAI2G,EAAE+V,gBACvB,OAAO,IAAIkL,GAAG,IAAIhP,GAAGrd,GAAI1C,EAAGmH,GAGhC,MAAM8oB,WAAWzB,GACb0B,kBAAkB1mB,GACd,GAAI,IAAoCA,EAAEuH,GAAI,MAAM,IAAkCvH,EAAEuH,GAAKvH,EAAEyI,GAAG,GAAGxR,KAAKguB,sEAAwEjlB,EAAEyI,GAAG,GAAGxR,KAAKguB,wEAG/L,OAAOjlB,EAAEwa,UAAUjiB,KAAKyH,EAAE6H,MAAO,KAErCzH,QAAQJ,GACJ,OAAOA,aAAaymB,IAmBxB,SAASE,GAAG3mB,EAAGtF,EAAG2G,GAClB,OAAO,IAAIskB,GAAG,CACVpe,GAAI,EACJsB,GAAInO,EAAE+mB,SAAS5Y,GACfgd,WAAY7lB,EAAEilB,YACd7c,GAAI/G,GACL3G,EAAEsK,WAAYtK,EAAEif,WAAYjf,EAAE6lB,2BAGrC,MAAMqG,WAAW5B,GACb0B,kBAAkB1mB,GACd,OAAO,IAAI4Z,GAAG5Z,EAAE6H,KAAM,IAAIyR,IAE9BlZ,QAAQJ,GACJ,OAAOA,aAAa4mB,IAI5B,MAAMC,WAAW7B,GACbtrB,YAAYsG,EAAGtF,GACX6B,MAAMyD,GAAI/I,KAAK6R,GAAKpO,EAExBgsB,kBAAkB1mB,GACd,MAAMtF,EAAIisB,GAAG1vB,KAAM+I,GACR,GAAKqB,EAAIpK,KAAK6R,GAAGxH,KAAKtB,GAAK8mB,GAAG9mB,EAAGtF,KAAMoK,EAAI,IAAIyU,GAAGlY,GAC7D,OAAO,IAAIuY,GAAG5Z,EAAE6H,KAAM/C,GAE1B1E,QAAQJ,GAEJ,OAAO/I,OAAS+I,GAIxB,MAAM+mB,WAAW/B,GACbtrB,YAAYsG,EAAGtF,GACX6B,MAAMyD,GAAI/I,KAAK6R,GAAKpO,EAExBgsB,kBAAkB1mB,GACd,MAAMtF,EAAIisB,GAAG1vB,KAAM+I,GACR,GAAKqB,EAAIpK,KAAK6R,GAAGxH,KAAKtB,GAAK8mB,GAAG9mB,EAAGtF,KAAMoK,EAAI,IAAI2U,GAAGpY,GAC7D,OAAO,IAAIuY,GAAG5Z,EAAE6H,KAAM/C,GAE1B1E,QAAQJ,GAEJ,OAAO/I,OAAS+I,GAIxB,MAAMgnB,WAAWhC,GACbtrB,YAAYsG,EAAGtF,GACX6B,MAAMyD,GAAI/I,KAAK8R,GAAKrO,EAExBgsB,kBAAkB1mB,GACd,MAAMtF,EAAI,IAAIgf,GAAG1Z,EAAE2Z,WAAYX,GAAGhZ,EAAE2Z,WAAY1iB,KAAK8R,KACrD,OAAO,IAAI6Q,GAAG5Z,EAAE6H,KAAMnN,GAE1B0F,QAAQJ,GAEJ,OAAO/I,OAAS+I,GAIwB,SAASinB,GAAGjnB,EAAGtF,EAAG2G,EAAGyD,GACjE,MAAMC,EAAI/E,EAAEgmB,GAAG,EAAgCtrB,EAAG2G,GAClDglB,GAAG,sCAAuCthB,EAAGD,GAC7C,MAAMxO,EAAI,GAAIgO,EAAIiS,GAAGW,QACrB/K,GAAGrH,GAAC,CAAI9E,EAAG8E,KACP,MAAM5L,EAAIguB,GAAGxsB,EAAGsF,EAAGqB,GAGXyD,EAAIH,EAAEG,GACd,MAAMtO,EAAIuO,EAAEwD,GAAGrP,GACf,GAAI4L,aAAa2hB,GAEjBnwB,EAAEiC,KAAKW,OAAS,CACZ,MAAM8G,EAAI8mB,GAAGhiB,EAAGtO,GAChB,MAAQwJ,IAAM1J,EAAEiC,KAAKW,GAAIoL,EAAEjB,IAAInK,EAAG8G,QAG1C,MAAM9G,EAAI,IAAImd,GAAG/f,GACjB,OAAO,IAAImvB,GAAGnhB,EAAGpL,EAAG6L,EAAEsV,iBAGqC,SAAS8M,GAAGnnB,EAAGtF,EAAG2G,EAAGyD,EAAGC,EAAGzO,GACtF,MAAMgO,EAAItE,EAAEgmB,GAAG,EAAgCtrB,EAAG2G,GAAInI,EAAI,CAAEqtB,GAAG7rB,EAAGoK,EAAGzD,IAAM7K,EAAI,CAAEuO,GACjF,GAAIzO,EAAEC,OAAS,GAAK,EAAG,MAAM,IAAIkM,EAAEX,EAAG,YAAYpH,0GAClD,IAAK,IAAIsF,EAAI,EAAGA,EAAI1J,EAAEC,OAAQyJ,GAAK,EAAG9G,EAAEX,KAAKguB,GAAG7rB,EAAGpE,EAAE0J,KAAMxJ,EAAE+B,KAAKjC,EAAE0J,EAAI,IACxE,MAAMrC,EAAI,GAAI4G,EAAIgS,GAAGW,QAGrB,IAAK,IAAIlX,EAAI9G,EAAE3C,OAAS,EAAGyJ,GAAK,IAAKA,EAAG,IAAKwmB,GAAG7oB,EAAGzE,EAAE8G,IAAK,CACtD,MAAMtF,EAAIxB,EAAE8G,GACZ,IAAIqB,EAAI7K,EAAEwJ,GAGFqB,EAAIsD,EAAEtD,GACd,MAAMyD,EAAIR,EAAEiE,GAAG7N,GACf,GAAI2G,aAAaolB,GAEjB9oB,EAAEpF,KAAKmC,OAAS,CACZ,MAAMsF,EAAI8mB,GAAGzlB,EAAGyD,GAChB,MAAQ9E,IAAMrC,EAAEpF,KAAKmC,GAAI6J,EAAElB,IAAI3I,EAAGsF,KAG1C,MAAMonB,EAAI,IAAI/Q,GAAG1Y,GACjB,OAAO,IAAI8nB,GAAGlhB,EAAG6iB,EAAG9iB,EAAE+V,iBAStB,SAASa,GAAGlb,EAAGtF,EAAG2G,EAAGyD,GAAI,GACzB,OAAOgiB,GAAGzlB,EAAGrB,EAAEgmB,GAAGlhB,EAAI,EAAuC,EAAkCpK,IAW/F,SAASosB,GAAG9mB,EAAGtF,GACf,GAAI2sB,GAGJrnB,EAAI2E,EAAE3E,IAAK,OAAOqmB,GAAG,2BAA4B3rB,EAAGsF,GAAIsmB,GAAGtmB,EAAGtF,GAC9D,GAAIsF,aAAaglB,GAUjB,OAAO,SAAShlB,EAAGtF,GAEf,IAAKgrB,GAAGhrB,EAAE6M,IAAK,MAAM7M,EAAE+N,GAAG,GAAGzI,EAAEilB,0DAC/B,IAAKvqB,EAAEmN,KAAM,MAAMnN,EAAE+N,GAAG,GAAGzI,EAAEilB,0DAC7B,MAAM5jB,EAAIrB,EAAE0mB,kBAAkBhsB,GAC9B2G,GAAK3G,EAAE2f,gBAAgB9hB,KAAK8I,GALzB,CAWNrB,EAAGtF,GAAI,KACR,QAAI,IAAWsF,GAAKtF,EAAE6lB,0BAItB,OAAO,KACP,GAGA7lB,EAAEmN,MAAQnN,EAAE8f,UAAUjiB,KAAKmC,EAAEmN,MAAO7H,aAAaxI,MAAO,CAOpD,GAAIkD,EAAE+mB,SAASrZ,IAAM,IAAyC1N,EAAE6M,GAAI,MAAM7M,EAAE+N,GAAG,mCAC/E,OAAO,SAASzI,EAAGtF,GACf,MAAM2G,EAAI,GACV,IAAIyD,EAAI,EACR,IAAK,MAAMC,KAAK/E,EAAG,CACf,IAAIA,EAAI8mB,GAAG/hB,EAAGrK,EAAE8N,GAAG1D,IACnB,MAAQ9E,IAGRA,EAAI,CACA0S,UAAW,eACXrR,EAAE9I,KAAKyH,GAAI8E,IAEnB,MAAO,CACHgL,WAAY,CACRC,OAAQ1O,IAdb,CAiBLrB,EAAGtF,GAET,OAAO,SAASsF,EAAGtF,GACf,GAAI,QAAUsF,EAAI2E,EAAE3E,IAAK,MAAO,CAC5B0S,UAAW,cAEf,GAAI,iBAAmB1S,EAAG,OAAOgZ,GAAGte,EAAEif,WAAY3Z,GAClD,GAAI,kBAAoBA,EAAG,MAAO,CAC9BqP,aAAcrP,GAElB,GAAI,iBAAmBA,EAAG,MAAO,CAC7B4O,YAAa5O,GAEjB,GAAIA,aAAaJ,KAAM,CACnB,MAAMyB,EAAI0M,GAAGuZ,SAAStnB,GACtB,MAAO,CACHiP,eAAgBmM,GAAG1gB,EAAEif,WAAYtY,IAGzC,GAAIrB,aAAa+N,GAAI,CAIjB,MAAM1M,EAAI,IAAI0M,GAAG/N,EAAEwN,QAAS,IAAMxG,KAAK2E,MAAM3L,EAAEgO,YAAc,MAC7D,MAAO,CACHiB,eAAgBmM,GAAG1gB,EAAEif,WAAYtY,IAGzC,GAAIrB,aAAaklB,GAAI,MAAO,CACxB1V,cAAe,CACXC,SAAUzP,EAAEyP,SACZC,UAAW1P,EAAE0P,YAGrB,GAAI1P,aAAa2kB,GAAI,MAAO,CACxBrV,WAAY+L,GAAG3gB,EAAEif,WAAY3Z,EAAE4kB,cAEnC,GAAI5kB,aAAa0jB,GAAI,CACjB,MAAMriB,EAAI3G,EAAEsK,WAAYF,EAAI9E,EAAE6jB,UAAUlE,YACxC,IAAK7a,EAAE1E,QAAQiB,GAAI,MAAM3G,EAAE+N,GAAG,sCAAsC3D,EAAEW,aAAaX,EAAEY,uCAAuCrE,EAAEoE,aAAapE,EAAEqE,YAC7I,MAAO,CACH6J,eAAgBkM,GAAGzb,EAAE6jB,UAAUlE,aAAejlB,EAAEsK,WAAYhF,EAAE4jB,KAAK/b,OAG3E,MAAMnN,EAAE+N,GAAG,4BAA4BD,GAAGxI,MA1CvC,CAkDNA,EAAGtF,GAGR,SAAS4rB,GAAGtmB,EAAGtF,GACX,MAAM2G,EAAI,GACV,OAAQ,SAASrB,GACb,IAAK,MAAMtF,KAAKsF,EAAG,GAAIxD,OAAOE,UAAUuP,eAAeC,KAAKlM,EAAGtF,GAAI,OAAO,EAC1E,OAAO,EAFH,CAGNsF,GAMFtF,EAAEmN,MAAQnN,EAAEmN,KAAKtR,OAAS,GAAKmE,EAAE8f,UAAUjiB,KAAKmC,EAAEmN,MAN3CsE,GAAGnM,GAAC,CAAIA,EAAG8E,KACd,MAAMC,EAAI+hB,GAAGhiB,EAAGpK,EAAEkN,GAAG5H,IACrB,MAAQ+E,IAAM1D,EAAErB,GAAK+E,MAIgC,CACrD0J,SAAU,CACNC,OAAQrN,IAKpB,SAASgmB,GAAGrnB,GACR,QAAS,iBAAmBA,GAAK,OAASA,GAAKA,aAAaxI,OAASwI,aAAaJ,MAAQI,aAAa+N,IAAM/N,aAAaklB,IAAMllB,aAAa2kB,IAAM3kB,aAAa0jB,IAAM1jB,aAAaglB,IAGvL,SAASqB,GAAGrmB,EAAGtF,EAAG2G,GACd,IAAKgmB,GAAGhmB,KAAO,SAASrB,GACpB,MAAO,iBAAmBA,GAAK,OAASA,IAAMxD,OAAO+qB,eAAevnB,KAAOxD,OAAOE,WAAa,OAASF,OAAO+qB,eAAevnB,IADnH,CAEbqB,GAAI,CACF,MAAMyD,EAAI0D,GAAGnH,GACb,KAAM,cAAgByD,EAAIpK,EAAE+N,GAAGzI,EAAI,oBAAsBtF,EAAE+N,GAAGzI,EAAI,IAAM8E,IAM5E,SAASyhB,GAAGvmB,EAAGtF,EAAG2G,GAClB,IAGA3G,EAAIiK,EAAEjK,cAAemqB,GAAI,OAAOnqB,EAAEoqB,cAClC,GAAI,iBAAmBpqB,EAAG,OAAOwsB,GAAGlnB,EAAGtF,GACvC,MAAMkrB,GAAG,kDAAmD5lB,GACxC,OACR,EAAQqB,GAKpB,MAAMmmB,GAAK,IAAIra,OAAO,iBAUtB,SAAS+Z,GAAGlnB,EAAGtF,EAAG2G,GAClB,GAAI3G,EAAE+sB,OAAOD,KAAO,EAAG,MAAM5B,GAAG,uBAAuBlrB,wDAAyDsF,GAC5F,OACR,EAAQqB,GACpB,IACI,OAAO,IAAIwjB,MAAMnqB,EAAE2M,MAAM,MAAMyd,cACjC,MAAOhgB,GACL,MAAM8gB,GAAG,uBAAuBlrB,6EAA8EsF,GAC1F,OACR,EAAQqB,IAI5B,SAASukB,GAAG5lB,EAAGtF,EAAG2G,EAAGyD,EAAGC,GACpB,MAAMzO,EAAIwO,IAAMA,EAAE8B,UAAWtC,OAAI,IAAWS,EAC5C,IAAI7L,EAAI,YAAYwB,+BACpB2G,IAAMnI,GAAK,0BAA2BA,GAAK,KAC3C,IAAI1C,EAAI,GACR,OAAQF,GAAKgO,KAAO9N,GAAK,UAAWF,IAAME,GAAK,aAAasO,KAAMR,IAAM9N,GAAK,gBAAgBuO,KAC7FvO,GAAK,KAAM,IAAIiM,EAAEX,EAAG5I,EAAI8G,EAAIxJ,GAGyC,SAASgwB,GAAGxmB,EAAGtF,GACpF,OAAOsF,EAAEyS,MAAMzS,GAAKA,EAAEI,QAAQ1F,KA2B9B,MAAMgtB,GAMNhuB,YAAYsG,EAAGtF,EAAG2G,EAAGyD,EAAGC,GACpB9N,KAAK0wB,WAAa3nB,EAAG/I,KAAKqsB,gBAAkB5oB,EAAGzD,KAAK2sB,KAAOviB,EAAGpK,KAAK2wB,UAAY9iB,EAC/E7N,KAAK4wB,WAAa9iB,EAE4Dgf,SAC9E,OAAO9sB,KAAK2sB,KAAK/b,KAAKnB,cAIfohB,UACP,OAAO,IAAIpE,GAAGzsB,KAAK0wB,WAAY1wB,KAAK4wB,WAAY5wB,KAAK2sB,MAMlD5J,SACH,OAAO,OAAS/iB,KAAK2wB,UAQlB3qB,OACH,GAAIhG,KAAK2wB,UAAW,CAChB,GAAI3wB,KAAK4wB,WAAY,CAGjB,MAAM7nB,EAAI,IAAI+nB,GAAG9wB,KAAK0wB,WAAY1wB,KAAKqsB,gBAAiBrsB,KAAK2sB,KAAM3sB,KAAK2wB,UACvD,MACjB,OAAO3wB,KAAK4wB,WAAWG,cAAchoB,GAEzC,OAAO/I,KAAKqsB,gBAAgB2E,aAAahxB,KAAK2wB,UAAU3qB,KAAKM,QAcrEoJ,IAAI3G,GACA,GAAI/I,KAAK2wB,UAAW,CAChB,MAAMltB,EAAIzD,KAAK2wB,UAAU3qB,KAAKiU,MAAMgX,GAAG,uBAAwBloB,IAC/D,GAAI,OAAStF,EAAG,OAAOzD,KAAKqsB,gBAAgB2E,aAAavtB,KAejE,MAAMqtB,WAAWL,GAOjBzqB,OACI,OAAOV,MAAMU,QAUjB,MAAMkrB,GAENzuB,YAAYsG,EAAGtF,GACXzD,KAAKmxB,MAAQ1tB,EAAGzD,KAAKusB,MAAQxjB,EAEmCqoB,WAChE,MAAO,IAAKpxB,KAAKmxB,OAEyCxU,WAC1D,OAAO3c,KAAKoxB,KAAK9xB,OAEgD2gB,YACjE,OAAO,IAAMjgB,KAAKoxB,KAAK9xB,OAQpB8P,QAAQrG,EAAGtF,GACdzD,KAAKmxB,MAAM/hB,QAAQrG,EAAGtF,IAU1B,SAAS4tB,GAAGtoB,EAAGtF,GACf,OAAOsF,EAAI2E,EAAE3E,GAAItF,EAAIiK,EAAEjK,GAAIsF,aAAa0nB,IAAMhtB,aAAagtB,GAAK1nB,EAAE2nB,aAAejtB,EAAEitB,YAAc3nB,EAAE4jB,KAAKxjB,QAAQ1F,EAAEkpB,QAAU,OAAS5jB,EAAE4nB,UAAY,OAASltB,EAAEktB,UAAY5nB,EAAE4nB,UAAUxnB,QAAQ1F,EAAEktB,aAAe5nB,EAAE6nB,aAAentB,EAAEmtB,WAAa7nB,aAAamoB,IAAMztB,aAAaytB,IAAO1D,GAAGzkB,EAAEwjB,MAAO9oB,EAAE8oB,QAAU1X,GAAG9L,EAAEqoB,KAAM3tB,EAAE2tB,KAAMC,IAKjU,SAASJ,GAAGloB,EAAGtF,GACf,MAAO,iBAAmBA,EAAIwsB,GAAGlnB,EAAGtF,GAAKA,aAAamqB,GAAKnqB,EAAEoqB,cAAgBpqB,EAAE6D,UAAUumB,cAuB7F,MAAMyD,IASF,MAAMC,WAAWD,IAErB,SAASE,GAAGzoB,EAAGtF,KAAM2G,GACjB,IAAIyD,EAAI,GACRpK,aAAa6tB,IAAMzjB,EAAEvM,KAAKmC,GAAIoK,EAAIA,EAAEuN,OAAOhR,GAAI,SAASrB,GACpD,MAAMtF,EAAIsF,EAAEsH,QAAQtH,GAAKA,aAAa0oB,KAAKnyB,OAAQ8K,EAAIrB,EAAEsH,QAAQtH,GAAKA,aAAa2oB,KAAKpyB,OACxF,GAAImE,EAAI,GAAKA,EAAI,GAAK2G,EAAI,EAAG,MAAM,IAAIoB,EAAEX,EAAG,gRAFD,CAyB9CgD,GACD,IAAK,MAAMpK,KAAKoK,EAAG9E,EAAItF,EAAEkuB,OAAO5oB,GAChC,OAAOA,EASP,MAAM2oB,WAAWH,GAIjB9uB,YAAYsG,EAAGtF,EAAG2G,GACd9E,QAAStF,KAAK4xB,OAAS7oB,EAAG/I,KAAK6xB,IAAMpuB,EAAGzD,KAAK8xB,OAAS1nB,EAEtDpK,KAAKiM,KAAO,QAEhByC,eAAe3F,EAAGtF,EAAG2G,GACjB,OAAO,IAAIsnB,GAAG3oB,EAAGtF,EAAG2G,GAExBunB,OAAO5oB,GACH,MAAMtF,EAAIzD,KAAK+xB,OAAOhpB,GACtB,OAAOipB,GAAGjpB,EAAEmkB,OAAQzpB,GAAI,IAAIwpB,GAAGlkB,EAAE6jB,UAAW7jB,EAAE2jB,UAAW5K,GAAG/Y,EAAEmkB,OAAQzpB,IAE1EsuB,OAAOhpB,GACH,MAAMtF,EAAIurB,GAAGjmB,EAAE6jB,WAAYxiB,EAAI,SAASrB,EAAGtF,EAAG2G,EAAGyD,EAAGC,EAAGzO,EAAGgO,GACtD,IAAIpL,EACJ,GAAI6L,EAAE4C,aAAc,CAChB,GAAI,mBAAmDrR,GAAK,uBAA2DA,EAAG,MAAM,IAAImM,EAAEX,EAAG,qCAAqCxL,+BAC9K,GAAI,OAA2BA,GAAK,WAAmCA,EAAG,CACtE4yB,GAAG5kB,EAAGhO,GACN,MAAMoE,EAAI,GACV,IAAK,MAAM2G,KAAKiD,EAAG5J,EAAEnC,KAAK4wB,GAAGrkB,EAAG9E,EAAGqB,IACnCnI,EAAI,CACA4W,WAAY,CACRC,OAAQrV,SAGbxB,EAAIiwB,GAAGrkB,EAAG9E,EAAGsE,OACjB,OAA2BhO,GAAK,WAAmCA,GAAK,uBAA2DA,GAAK4yB,GAAG5kB,EAAGhO,GACrJ4C,EAAIgiB,GAAG7Z,EAGC,QAHKiD,EACM,OAA2BhO,GAAK,WAAmCA,GACtF,OAAO2a,GAAGpU,OAAOkI,EAAGzO,EAAG4C,GAjBI,CAkB7B8G,EAAEmkB,OAAQ,EAASzpB,EAAGsF,EAAE6jB,UAAUlE,YAAa1oB,KAAK4xB,OAAQ5xB,KAAK6xB,IAAK7xB,KAAK8xB,QAC7E,OAAO1nB,GAcX,SAAS+nB,GAAGppB,EAAGtF,EAAG2G,GAClB,MAAMyD,EAAIpK,EAAGqK,EAAImjB,GAAG,QAASloB,GAC7B,OAAO2oB,GAAGU,QAAQtkB,EAAGD,EAAGzD,GAUxB,MAAMqnB,WAAWH,GAIjB7uB,YAEAsG,EAAGtF,GACC6B,QAAStF,KAAKiM,KAAOlD,EAAG/I,KAAKqyB,kBAAoB5uB,EAErDiL,eAAe3F,EAAGtF,GACd,OAAO,IAAIguB,GAAG1oB,EAAGtF,GAErBsuB,OAAOhpB,GACH,MAAMtF,EAAIzD,KAAKqyB,kBAAkBhoB,KAAK5G,GAAKA,EAAEsuB,OAAOhpB,KAAKsH,QAAQtH,GAAKA,EAAEgS,aAAazb,OAAS,IAC9F,OAAO,IAAMmE,EAAEnE,OAASmE,EAAE,GAAKwX,GAAGrV,OAAOnC,EAAGzD,KAAKsyB,gBAErDX,OAAO5oB,GACH,MAAMtF,EAAIzD,KAAK+xB,OAAOhpB,GACtB,OAAO,IAAMtF,EAAEsX,aAAazb,OAASyJ,GAAK,SAASA,EAAGtF,GAClD,IAAI2G,EAAIrB,EACR,MAAM8E,EAAIpK,EAAEqX,sBACZ,IAAK,MAAM/R,KAAK8E,EAAGmkB,GAAG5nB,EAAGrB,GAAIqB,EAAI0X,GAAG1X,EAAGrB,GAHD,CAOzCA,EAAEmkB,OAAQzpB,GAAI,IAAIwpB,GAAGlkB,EAAE6jB,UAAW7jB,EAAE2jB,UAAW5K,GAAG/Y,EAAEmkB,OAAQzpB,KAEjE8uB,uBACI,OAAOvyB,KAAKqyB,kBAEhBC,eACI,MAAO,QAAUtyB,KAAKiM,KAAO,MAAoC,MAarE,SAASumB,MAAMzpB,GAEf,OAAOA,EAAEqG,SAASrG,GAAK0pB,GAAG,KAAM1pB,KAAM0oB,GAAGW,QAAQ,KAAkCrpB,GAYnF,SAAS2pB,MAAM3pB,GAEf,OAAOA,EAAEqG,SAASrG,GAAK0pB,GAAG,MAAO1pB,KAAM0oB,GAAGW,QAAQ,MAAoCrpB,GAWtF,MAAM4pB,WAAWpB,GAIjB9uB,YAAYsG,EAAGtF,GACX6B,QAAStF,KAAK4xB,OAAS7oB,EAAG/I,KAAK4yB,WAAanvB,EAE5CzD,KAAKiM,KAAO,UAEhByC,eAAe3F,EAAGtF,GACd,OAAO,IAAIkvB,GAAG5pB,EAAGtF,GAErBkuB,OAAO5oB,GACH,MAAMtF,EAAI,SAASsF,EAAGtF,EAAG2G,GACrB,GAAI,OAASrB,EAAEmY,QAAS,MAAM,IAAI1V,EAAEX,EAAG,wFACvC,GAAI,OAAS9B,EAAEoY,MAAO,MAAM,IAAI3V,EAAEX,EAAG,qFACrC,MAAMgD,EAAI,IAAI6N,GAAGjY,EAAG2G,GACpB,OAAO,SAASrB,EAAGtF,GACf,GAAI,OAAS+d,GAAGzY,GAAI,CAEhB,MAAMqB,EAAIqX,GAAG1Y,GACb,OAASqB,GAAKyoB,GAAG9pB,EAAGqB,EAAG3G,EAAEwW,QAJ1B,CAMLlR,EAAG8E,GAAIA,EAVH,CAsBb9E,EAAEmkB,OAAQltB,KAAK4xB,OAAQ5xB,KAAK4yB,YACzB,OAAO,IAAI3F,GAAGlkB,EAAE6jB,UAAW7jB,EAAE2jB,UAAW,SAAS3jB,EAAGtF,GAEhD,MAAM2G,EAAIrB,EAAEuY,gBAAgBlG,OAAO,CAAE3X,IACrC,OAAO,IAAI4d,GAAGtY,EAAE6H,KAAM7H,EAAEgI,gBAAiB3G,EAAGrB,EAAEmS,QAAQhM,QAASnG,EAAEoG,MAAOpG,EAAEwY,UAAWxY,EAAEmY,QAASnY,EAAEoY,OAH9D,CAItCpY,EAAEmkB,OAAQzpB,KAehB,SAASqvB,GAAG/pB,EAAGtF,EAAI,OACnB,MAAM2G,EAAI3G,EAAGoK,EAAIojB,GAAG,UAAWloB,GAC/B,OAAO4pB,GAAGP,QAAQvkB,EAAGzD,GASrB,MAAM2oB,WAAWxB,GAIjB9uB,YAEAsG,EAAGtF,EAAG2G,GACF9E,QAAStF,KAAKiM,KAAOlD,EAAG/I,KAAKgzB,OAASvvB,EAAGzD,KAAKizB,WAAa7oB,EAE/DsE,eAAe3F,EAAGtF,EAAG2G,GACjB,OAAO,IAAI2oB,GAAGhqB,EAAGtF,EAAG2G,GAExBunB,OAAO5oB,GACH,OAAO,IAAIkkB,GAAGlkB,EAAE6jB,UAAW7jB,EAAE2jB,UAAW,SAAS3jB,EAAGtF,EAAG2G,GACnD,OAAO,IAAIiX,GAAGtY,EAAE6H,KAAM7H,EAAEgI,gBAAiBhI,EAAEuY,gBAAgBpS,QAASnG,EAAEmS,QAAQhM,QAASzL,EAAG2G,EAAGrB,EAAEmY,QAASnY,EAAEoY,OADtE,CAEtCpY,EAAEmkB,OAAQltB,KAAKgzB,OAAQhzB,KAAKizB,cAUlC,SAASC,GAAGnqB,GACZ,OAAO0I,GAAG,QAAS1I,GAAIgqB,GAAGX,QAAQ,QAASrpB,EAAG,KAY9C,SAASoqB,GAAGpqB,GACZ,OAAO0I,GAAG,cAAe1I,GAAIgqB,GAAGX,QAAQ,cAAerpB,EAAG,KAS1D,MAAMqqB,WAAW7B,GAIjB9uB,YAEAsG,EAAGtF,EAAG2G,GACF9E,QAAStF,KAAKiM,KAAOlD,EAAG/I,KAAKqzB,aAAe5vB,EAAGzD,KAAKszB,WAAalpB,EAErEsE,eAAe3F,EAAGtF,EAAG2G,GACjB,OAAO,IAAIgpB,GAAGrqB,EAAGtF,EAAG2G,GAExBunB,OAAO5oB,GACH,MAAMtF,EAAI8vB,GAAGxqB,EAAG/I,KAAKiM,KAAMjM,KAAKqzB,aAAcrzB,KAAKszB,YACnD,OAAO,IAAIrG,GAAGlkB,EAAE6jB,UAAW7jB,EAAE2jB,UAAW,SAAS3jB,EAAGtF,GAChD,OAAO,IAAI4d,GAAGtY,EAAE6H,KAAM7H,EAAEgI,gBAAiBhI,EAAEuY,gBAAgBpS,QAASnG,EAAEmS,QAAQhM,QAASnG,EAAEoG,MAAOpG,EAAEwY,UAAW9d,EAAGsF,EAAEoY,OAD9E,CAEtCpY,EAAEmkB,OAAQzpB,KAIpB,SAAS+vB,MAAMzqB,GACX,OAAOqqB,GAAGhB,QAAQ,UAAWrpB,GACd,GAGnB,SAAS0qB,MAAM1qB,GACX,OAAOqqB,GAAGhB,QAAQ,aAAcrpB,GACjB,GASf,MAAM2qB,WAAWnC,GAIjB9uB,YAEAsG,EAAGtF,EAAG2G,GACF9E,QAAStF,KAAKiM,KAAOlD,EAAG/I,KAAKqzB,aAAe5vB,EAAGzD,KAAKszB,WAAalpB,EAErEsE,eAAe3F,EAAGtF,EAAG2G,GACjB,OAAO,IAAIspB,GAAG3qB,EAAGtF,EAAG2G,GAExBunB,OAAO5oB,GACH,MAAMtF,EAAI8vB,GAAGxqB,EAAG/I,KAAKiM,KAAMjM,KAAKqzB,aAAcrzB,KAAKszB,YACnD,OAAO,IAAIrG,GAAGlkB,EAAE6jB,UAAW7jB,EAAE2jB,UAAW,SAAS3jB,EAAGtF,GAChD,OAAO,IAAI4d,GAAGtY,EAAE6H,KAAM7H,EAAEgI,gBAAiBhI,EAAEuY,gBAAgBpS,QAASnG,EAAEmS,QAAQhM,QAASnG,EAAEoG,MAAOpG,EAAEwY,UAAWxY,EAAEmY,QAASzd,GADpF,CAEtCsF,EAAEmkB,OAAQzpB,KAIpB,SAASkwB,MAAM5qB,GACX,OAAO2qB,GAAGtB,QAAQ,YAAarpB,GAChB,GAGnB,SAAS6qB,MAAM7qB,GACX,OAAO2qB,GAAGtB,QAAQ,QAASrpB,GACZ,GAGgD,SAASwqB,GAAGxqB,EAAGtF,EAAG2G,EAAGyD,GACpF,GAAIzD,EAAE,GAAKsD,EAAEtD,EAAE,IAAKA,EAAE,aAAcqmB,GAAI,OAAO,SAAS1nB,EAAGtF,EAAG2G,EAAGyD,EAAGC,GAChE,IAAKD,EAAG,MAAM,IAAIrC,EAAET,EAAG,uDAAuDX,QAC9E,MAAM/K,EAAI,GAQF,IAAK,MAAM+K,KAAKuX,GAAG5Y,GAAI,GAAIqB,EAAE6P,MAAMvJ,aAAcrR,EAAEiC,KAAK8X,GAAG3V,EAAGoK,EAAExH,UAAY,CAChF,MAAM0C,EAAI8E,EAAE7H,KAAKiU,MAAM7P,EAAE6P,OACzB,GAAI1C,GAAGxO,GAAI,MAAM,IAAIyC,EAAEX,EAAG,+FAAiGT,EAAE6P,MAAQ,2HACrI,GAAI,OAASlR,EAAG,CACZ,MAAMA,EAAIqB,EAAE6P,MAAM/J,kBAClB,MAAM,IAAI1E,EAAEX,EAAG,+FAA+F9B,4CAElH1J,EAAEiC,KAAKyH,GAEX,OAAO,IAAI4Q,GAAGta,EAAGyO,GAnB0B,CAuB9C/E,EAAEmkB,OAAQnkB,EAAE6jB,UAAUlE,YAAajlB,EAAG2G,EAAE,GAAGumB,UAAW9iB,GACvD,CACI,MAAMC,EAAIkhB,GAAGjmB,EAAE6jB,WACf,OAAO,SAAS7jB,EAAGtF,EAAG2G,EAAGyD,EAAGC,EAAGzO,GAE3B,MAAMgO,EAAItE,EAAEuY,gBACZ,GAAIxT,EAAExO,OAAS+N,EAAE/N,OAAQ,MAAM,IAAIkM,EAAEX,EAAG,kCAAkCgD,8FAC1E,MAAM5L,EAAI,GACV,IAAK,IAAI5C,EAAI,EAAGA,EAAIyO,EAAExO,OAAQD,IAAK,CAC/B,MAAME,EAAIuO,EAAEzO,GACZ,GAAIgO,EAAEhO,GAAG4a,MAAMvJ,aAAc,CACzB,GAAI,iBAAmBnR,EAAG,MAAM,IAAIiM,EAAEX,EAAG,uDAAuDgD,yBAAyBtO,KACzH,IAAKmiB,GAAG3Y,KAAO,IAAMxJ,EAAE4Q,QAAQ,KAAM,MAAM,IAAI3E,EAAEX,EAAG,+FAA+FgD,yCAAyCtO,wBAC5L,MAAM6K,EAAIrB,EAAE6H,KAAK3B,MAAMgB,GAAGY,WAAWtR,IACrC,IAAKoR,GAAGU,cAAcjH,GAAI,MAAM,IAAIoB,EAAEX,EAAG,qGAAqGgD,kDAAkDzD,4DAChM,MAAM0D,EAAI,IAAI6C,GAAGvG,GACjBnI,EAAEX,KAAK8X,GAAG3V,EAAGqK,QACV,CACH,MAAM/E,EAAIkb,GAAG7Z,EAAGyD,EAAGtO,GACnB0C,EAAEX,KAAKyH,IAGf,OAAO,IAAI4Q,GAAG1X,EAAG5C,GAnBd,CAyBV0J,EAAEmkB,OAAQnkB,EAAE6jB,UAAUlE,YAAa5a,EAAGrK,EAAG2G,EAAGyD,IAIjD,SAASqkB,GAAGnpB,EAAGtF,EAAG2G,GACd,GAAI,iBAAoBA,EAAIsD,EAAEtD,IAAK,CAC/B,GAAI,KAAOA,EAAG,MAAM,IAAIoB,EAAEX,EAAG,qHAC7B,IAAK6W,GAAGje,KAAO,IAAM2G,EAAE+F,QAAQ,KAAM,MAAM,IAAI3E,EAAEX,EAAG,yGAAyGT,gCAC7J,MAAMyD,EAAIpK,EAAEmN,KAAK3B,MAAMgB,GAAGY,WAAWzG,IACrC,IAAKuG,GAAGU,cAAcxD,GAAI,MAAM,IAAIrC,EAAEX,EAAG,kIAAkIgD,uDAAuDA,EAAEvO,YACpO,OAAO8Z,GAAGrQ,EAAG,IAAI4H,GAAG9C,IAExB,GAAIzD,aAAaqiB,GAAI,OAAOrT,GAAGrQ,EAAGqB,EAAEuiB,MACpC,MAAM,IAAInhB,EAAEX,EAAG,uHAAuH0G,GAAGnH,OAMzI,SAAS6nB,GAAGlpB,EAAGtF,GACf,IAAKlD,MAAMC,QAAQuI,IAAM,IAAMA,EAAEzJ,OAAQ,MAAM,IAAIkM,EAAEX,EAAG,qDAAqDpH,EAAEgI,wBAY/G,SAASumB,GAAGjpB,EAAGtF,GACf,GAAIA,EAAEoX,eAAgB,CAClB,MAAMzQ,EAAIqX,GAAG1Y,GAAI8E,EAAIpK,EAAEwW,MACvB,GAAI,OAAS7P,IAAMA,EAAEjB,QAAQ0E,GAAI,MAAM,IAAIrC,EAAEX,EAAG,oJAAoJT,EAAEqB,oBAAoBoC,EAAEpC,eAC5N,MAAMqC,EAAI0T,GAAGzY,GACb,OAAS+E,GAAK+kB,GAAG9pB,EAAG8E,EAAGC,GAE3B,MAAM1D,EAAI,SAASrB,EAAGtF,GAClB,IAAK,MAAM2G,KAAKrB,EAAG,IAAK,MAAMA,KAAKqB,EAAE0Q,sBAAuB,GAAIrX,EAAE0M,QAAQpH,EAAEmR,KAAO,EAAG,OAAOnR,EAAEmR,GAC/F,OAAO,KAFD,CAGRnR,EAAEmS,QAAS,SAASnS,GAClB,OAAQA,GACN,IAAK,KACH,MAAO,CAAE,KAAgC,UAE3C,IAAK,qBACL,IAAK,KACH,MAAO,CAAE,UAEX,IAAK,SACH,MAAO,CAAE,qBAAyD,KAAyB,SAAiC,MAE9H,QACE,MAAO,IAbF,CAeXtF,EAAEyW,KACJ,GAAI,OAAS9P,EAEb,MAAMA,IAAM3G,EAAEyW,GAAK,IAAI1O,EAAEX,EAAG,gDAAgDpH,EAAEyW,GAAGzO,uBAAyB,IAAID,EAAEX,EAAG,kCAAkCpH,EAAEyW,GAAGzO,6BAA6BrB,EAAEqB,wBAG7L,SAASonB,GAAG9pB,EAAGtF,EAAG2G,GACd,IAAKA,EAAEjB,QAAQ1F,GAAI,MAAM,IAAI+H,EAAEX,EAAG,qGAAqGpH,EAAEgI,yCAAyChI,EAAEgI,0FAA0FrB,EAAEqB,wBAGpR,SAASgnB,GAAG1pB,EAAGtF,GACX,KAAMA,aAAaiuB,IAAMjuB,aAAaguB,IAAK,MAAM,IAAIjmB,EAAEX,EAAG,YAAY9B,oGA4B1E,SAAS8qB,GAAG9qB,EAAGtF,EAAG2G,GACd,IAAIyD,EAIJ,OAAOA,EAAI9E,EAAIqB,IAAMA,EAAE8kB,OAAS9kB,EAAE+kB,aAAepmB,EAAE+qB,YAAYrwB,EAAG2G,GAAKrB,EAAE+qB,YAAYrwB,GAAKA,EAC1FoK,EAGJ,MAAMkmB,WAAW,MACb/C,aAAajoB,EAAGtF,EAAI,QAChB,OAAQyU,GAAGnP,IACT,KAAK,EACH,OAAO,KAET,KAAK,EACH,OAAOA,EAAEqP,aAEX,KAAK,EACH,OAAO1B,GAAG3N,EAAE2P,cAAgB3P,EAAE4P,aAEhC,KAAK,EACH,OAAO3Y,KAAKg0B,iBAAiBjrB,EAAEiP,gBAEjC,KAAK,EACH,OAAOhY,KAAKi0B,uBAAuBlrB,EAAGtF,GAExC,KAAK,EACH,OAAOsF,EAAE4O,YAEX,KAAK,EACH,OAAO3X,KAAKk0B,aAAavd,GAAG5N,EAAEsP,aAEhC,KAAK,EACH,OAAOrY,KAAKm0B,iBAAiBprB,EAAEuP,gBAEjC,KAAK,EACH,OAAOtY,KAAKo0B,gBAAgBrrB,EAAEwP,eAEhC,KAAK,EACH,OAAOvY,KAAKq0B,aAAatrB,EAAE8P,WAAYpV,GAEzC,KAAK,GACH,OAAOzD,KAAKs0B,cAAcvrB,EAAEyO,SAAU/T,GAExC,QACE,MAAMkD,KAGd2tB,cAAcvrB,EAAGtF,GACb,OAAOzD,KAAKwsB,iBAAiBzjB,EAAE0O,OAAQhU,GAIpC+oB,iBAAiBzjB,EAAGtF,EAAI,QAC3B,MAAM2G,EAAI,GACV,OAAO8K,GAAGnM,IAAKA,EAAG8E,KACdzD,EAAErB,GAAK/I,KAAKgxB,aAAanjB,EAAGpK,MAC3B2G,EAETgqB,gBAAgBrrB,GACZ,OAAO,IAAIklB,GAAGvX,GAAG3N,EAAEyP,UAAW9B,GAAG3N,EAAE0P,YAEvC4b,aAAatrB,EAAGtF,GACZ,OAAQsF,EAAE+P,QAAU,IAAIzO,KAAKtB,GAAK/I,KAAKgxB,aAAajoB,EAAGtF,KAE3DwwB,uBAAuBlrB,EAAGtF,GACtB,OAAQA,GACN,IAAK,WACH,MAAM2G,EAAIwN,GAAG7O,GACb,OAAO,MAAQqB,EAAI,KAAOpK,KAAKgxB,aAAa5mB,EAAG3G,GAEjD,IAAK,WACH,OAAOzD,KAAKg0B,iBAAiBlc,GAAG/O,IAElC,QACE,OAAO,MAGfirB,iBAAiBjrB,GACb,MAAMtF,EAAI0S,GAAGpN,GACb,OAAO,IAAI+N,GAAGrT,EAAE8S,QAAS9S,EAAEgT,OAE/B8d,mBAAmBxrB,EAAGtF,GAClB,MAAM2G,EAAI6F,GAAGY,WAAW9H,GACxB0B,EAAEka,GAAGva,IACL,MAAMyD,EAAI,IAAIU,GAAEnE,EAAEsF,IAAI,GAAItF,EAAEsF,IAAI,IAAK5B,EAAI,IAAI6C,GAAGvG,EAAEkF,SAAS,IAC3D,OAAOzB,EAAE1E,QAAQ1F,IAEjB8G,EAAE,YAAYuD,gEAAgED,EAAEW,aAAaX,EAAEY,gGAAgGhL,EAAE+K,aAAa/K,EAAEgL,sBAChNX,IAGJrL,YAAYsG,GACRzD,QAAStF,KAAK4sB,UAAY7jB,EAE9BmrB,aAAanrB,GACT,OAAO,IAAI2kB,GAAG3kB,GAElBorB,iBAAiBprB,GACb,MAAMtF,EAAIzD,KAAKu0B,mBAAmBxrB,EAAG/I,KAAK4sB,UAAUlE,aACpD,OAAO,IAAI+D,GAAGzsB,KAAK4sB,UAA4B,KAAMnpB,IAgBzD,SAAS+wB,GAAGzrB,GACZ,MAAMtF,EAAI6kB,IAAIvf,EAAIyI,GAAGzI,EAAG0jB,KAAKG,WAAYxiB,EAAI,IAAI2pB,GAAGhrB,EAAE6jB,WACtD,OAAO9E,GAAGrkB,EAAG,CAAEsF,EAAE4jB,OAAQ1f,MAAMxJ,IAC3BgH,EAAE,IAAMhH,EAAEnE,QACV,MAAMuO,EAAIpK,EAAE,GACZ,OAAO,IAAIgtB,GAAG1nB,EAAE6jB,UAAWxiB,EAAGrB,EAAE4jB,KAAM9e,EAAE+S,kBAAoB/S,EAAI,KAAM9E,EAAE2jB,cAe5E,SAAS+H,GAAG1rB,IACX,SAASA,GACN,GAAI,MAA6BA,EAAEwY,WAAa,IAAMxY,EAAEuY,gBAAgBhiB,OAAQ,MAAM,IAAIkM,EAAEzE,EAAG,0EADlG,EAEEgC,EAAIyI,GAAGzI,EAAGkkB,KAAKC,QAClB,MAAMzpB,EAAI6kB,GAAGvf,EAAE6jB,WAAYxiB,EAAI,IAAI2pB,GAAGhrB,EAAE6jB,WACxC,OAxmEJhZ,eAAkB7K,EAAGtF,GACjB,MAAM2G,EAAIM,EAAE3B,GAAI8E,EAAIkX,GAAG3a,EAAEsY,WAAYb,GAAGpe,IACxC,aAAc2G,EAAEQ,EAAE,WAAYiD,EAAEoX,OAAQ,CACpCD,gBAAiBnX,EAAEmX,mBACnB3U,QAAQtH,KAAOA,EAAEzF,WAAW+G,KAAKtB,GAAK,SAASA,EAAGtF,EAAG2G,GACrD,MAAMyD,EAAI6W,GAAG3b,EAAGtF,EAAEf,MAAOoL,EAAIwW,GAAG7gB,EAAEqf,YAAazjB,EAAIoE,EAAEsc,WAAauE,GAAG7gB,EAAEsc,YAAclE,GAAG7L,MAAO3C,EAAI,IAAIiS,GAAG,CACtG9H,SAAU,CACNC,OAAQhU,EAAEgU,UAGlB,OADQkI,GAAGsI,iBAAiBpa,EAAGC,EAAGzO,EAAGgO,GALC,CAOxCjD,EAAEsY,WAAY3Z,EAAEzF,YA6lEXoxB,CAAGjxB,EAAGsF,EAAEmkB,QAAQjgB,MAAMxJ,IACzB,MAAMoK,EAAIpK,EAAE4G,KAAK5G,GAAK,IAAIqtB,GAAG/nB,EAAE6jB,UAAWxiB,EAAG3G,EAAE4C,IAAK5C,EAAGsF,EAAE2jB,aACzD,MAAO,MAA6B3jB,EAAEmkB,OAAO3L,WAI7C1T,EAAE8mB,UAAW,IAAIzD,GAAGnoB,EAAG8E,MAI/B,SAAS+mB,GAAG7rB,EAAGtF,EAAG2G,GACd,MAAMyD,EAAIgmB,IAAI9qB,EAAIyI,GAAGzI,EAAG0jB,KAAKC,UAAWjpB,EAAG2G,GAAI0D,EAAImhB,GAAGD,GAAGjmB,EAAE6jB,WAAY,SAAU7jB,EAAE4jB,KAAM9e,EAAG,OAAS9E,EAAE2jB,UAAWtiB,GAClH,OAAO8c,GAAGoB,GAAGvf,EAAE6jB,WAAY,CAAE9e,EAAEygB,WAAWxlB,EAAE4jB,KAAM9J,GAAGgS,UAGzD,SAASC,GAAG/rB,EAAGtF,EAAG2G,KAAMyD,GACpB,MAAMC,EAAIkhB,IAAIjmB,EAAIyI,GAAGzI,EAAG0jB,KAAKG,WAGzB,IAAIvtB,EAER,OADAA,EAAI,iBAAoBoE,EAAIiK,EAAEjK,KAAOA,aAAamqB,GAAKsC,GAAGpiB,EAAG,YAAa/E,EAAE4jB,KAAMlpB,EAAG2G,EAAGyD,GAAKmiB,GAAGliB,EAAG,YAAa/E,EAAE4jB,KAAMlpB,GACjHyjB,GAAGoB,GAAGvf,EAAE6jB,WAAY,CAAEvtB,EAAEkvB,WAAWxlB,EAAE4jB,KAAM9J,GAAGE,QAAO,MAc5D,SAASgS,GAAGhsB,GACZ,OAAOme,GAAGoB,IAAIvf,EAAIyI,GAAGzI,EAAG0jB,KAAKG,WAAY,CAAE,IAAIpJ,GAAGza,EAAE4jB,KAAM9J,GAAGgS,UAiB7D,SAASG,GAAGjsB,EAAGtF,GACf,MAAM2G,EAAIijB,GAAGtkB,EAAIyI,GAAGzI,EAAGgkB,KAAMlf,EAAIgmB,GAAG9qB,EAAE2jB,UAAWjpB,GAAIqK,EAAImhB,GAAGD,GAAGjmB,EAAE6jB,WAAY,SAAUxiB,EAAEuiB,KAAM9e,EAAG,OAASzD,EAAEsiB,UAAW,IACxH,OAAOxF,GAAGoB,GAAGvf,EAAE6jB,WAAY,CAAE9e,EAAEygB,WAAWnkB,EAAEuiB,KAAM9J,GAAGE,QAAO,MAAQ9V,MAAI,IAAQ7C,IAgChF,SAAS6qB,GAAGlsB,GACZ,OAAOmsB,GAAGnsB,EAAG,CACTosB,MAAOC,OA8BX,SAASF,GAAGnsB,EAAGtF,GACf,MAAM2G,EAAIoH,GAAGzI,EAAE6jB,UAAWlD,IAAK7b,EAAIya,GAAGle,GAAI0D,EAAI,SAAS/E,EAAGtF,GACtD,MAAM2G,EAAI,GACV,IAAK,MAAMyD,KAAK9E,EAAGxD,OAAOE,UAAUuP,eAAeC,KAAKlM,EAAG8E,IAAMzD,EAAE9I,KAAKmC,EAAEsF,EAAE8E,GAAIA,IAChF,OAAOzD,EAHmC,CAI5C3G,GAAI,CAACsF,EAAGtF,IAAM,IAAIyQ,GAAGzQ,EAAGsF,EAAEmjB,eAAgBnjB,EAAEojB,sBAE9C,OAxtEJvY,eAAkB7K,EAAGtF,EAAG2G,GACpB,IAAIyD,EACJ,MAAMC,EAAIpD,EAAE3B,IAAKssB,QAASh2B,EAAGuP,EAAGvB,GAAK,SAAStE,EAAGtF,EAAG2G,GAChD,MAAMyD,EAAIkX,GAAGhc,EAAGtF,GAAIqK,EAAI,GAAIzO,EAAI,GAChC,IAAIgO,EAAI,EACR,OAAOjD,EAAEgF,SAASrG,IAId,MAAMtF,EAAI,aAAe4J,IACzBS,EAAErK,GAAKsF,EAAEoL,MAAO,UAAYpL,EAAEgC,EAAI1L,EAAEiC,KAAK,CACrC6S,MAAO1Q,EACP0xB,MAAO,KACN,QAAUpsB,EAAEgC,EAAI1L,EAAEiC,KAAK,CACxB6S,MAAO1Q,EACP6xB,IAAK,CACDrb,MAAOsL,GAAGxc,EAAEqL,cAEf,QAAUrL,EAAEgC,GAAK1L,EAAEiC,KAAK,CACzB6S,MAAO1Q,EACP8xB,IAAK,CACDtb,MAAOsL,GAAGxc,EAAEqL,iBAGnB,CACDihB,QAAS,CACLG,2BAA4B,CACxBC,aAAcp2B,EACd2lB,gBAAiBnX,EAAEmX,iBAEvBC,OAAQpX,EAAEoX,QAEdrW,EAAGd,GA9B0B,CAgCnCA,EAAE4U,WAAYb,GAAGpe,GAAI2G,GAAInI,EAAI5C,EAAE4lB,OACjCnX,EAAEgZ,WAAWvc,UAAYlL,EAAE4lB,OAC3B,MAAM1lB,SAAWuO,EAAElD,EAAE,sBAAuB3I,EAAG5C,EAA8B,IAAIgR,QAAQtH,KAAOA,EAAE2sB,SAE9FjrB,EAAE,IAAMlL,EAAED,QAId,MAAMoH,EAAI,QAAUmH,EAAItO,EAAE,GAAGm2B,cAAW,IAAW7nB,OAAI,EAASA,EAAE8nB,gBAClE,OAAOpwB,OAAOsB,KAAKH,GAAGyU,QAAQ,CAACpS,EAAGtF,KAAOsF,EAAEsE,EAAE5J,IAAMiD,EAAEjD,GAAIsF,IAAK,IA6qEvD6sB,CAAG/nB,EAAG9E,EAAEmkB,OAAQpf,GAAGb,MAAMxJ,GAAK,SAASsF,EAAGtF,EAAG2G,GAChD,MAAMyD,EAAI,IAAIkmB,GAAGhrB,GACjB,OAAO,IAAIqjB,GAAG3oB,EAAGoK,EAAGzD,GAFa,CASpCA,EAAGrB,EAAGtF,KAGX,SAASoyB,GAAG9sB,GACR,OAAO,IAAIkjB,GAAG,MAAOqD,GAAG,MAAOvmB,IAQ/B,SAAS+sB,GAAG/sB,GACZ,OAAO,IAAIkjB,GAAG,MAAOqD,GAAG,UAAWvmB,IAOnC,SAASqsB,KACT,OAAO,IAAInJ,GAAG,SASd,SAAS8J,GAAGhtB,EAAGtF,GACf,IAAI2G,EAAGyD,EACP,OAAO9E,aAAakjB,IAAMxoB,aAAawoB,IAAMljB,EAAEmjB,iBAAmBzoB,EAAEyoB,iBAAmB,QAAU9hB,EAAIrB,EAAEojB,0BAAuB,IAAW/hB,OAAI,EAASA,EAAE8F,sBAAwB,QAAUrC,EAAIpK,EAAE0oB,0BAAuB,IAAWte,OAAI,EAASA,EAAEqC,mBAcjP,SAAS8lB,GAAGjtB,EAAGtF,GACf,OAAO+pB,GAAGzkB,EAAEwjB,MAAO9oB,EAAE8oB,QAAU4D,EAAEpnB,EAAE/C,OAAQvC,EAAEuC,QAsB7C,SAASiwB,KACT,OAAO,IAAIzG,GAAG,eAMd,SAAS0G,KACT,OAAO,IAAIvG,GAAG,mBAcd,SAASwG,MAAMptB,GAGf,OAAO,IAAI6mB,GAAG,aAAc7mB,GAa5B,SAASqtB,MAAMrtB,GAGf,OAAO,IAAI+mB,GAAG,cAAe/mB,GAqB7B,SAASstB,GAAGttB,GACZ,OAAO,IAAIgnB,GAAG,YAAahnB,GA0B3B,MAAMutB,GAEN7zB,YAAYsG,EAAGtF,GACXzD,KAAK0wB,WAAa3nB,EAAG/I,KAAKu2B,eAAiB9yB,EAAGzD,KAAKw2B,WAAa,GAAIx2B,KAAKy2B,YAAa,EACtFz2B,KAAK02B,YAAc1H,GAAGjmB,GAE1BqD,IAAIrD,EAAGtF,EAAG2G,GACNpK,KAAK22B,sBACL,MAAM9oB,EAAI+oB,GAAG7tB,EAAG/I,KAAK0wB,YAAa5iB,EAAI+lB,GAAGhmB,EAAE6e,UAAWjpB,EAAG2G,GAAI/K,EAAI4vB,GAAGjvB,KAAK02B,YAAa,iBAAkB7oB,EAAE8e,KAAM7e,EAAG,OAASD,EAAE6e,UAAWtiB,GACzI,OAAOpK,KAAKw2B,WAAWl1B,KAAKjC,EAAEkvB,WAAW1gB,EAAE8e,KAAM9J,GAAGgS,SAAU70B,KAElEonB,OAAOre,EAAGtF,EAAG2G,KAAMyD,GACf7N,KAAK22B,sBACL,MAAM7oB,EAAI8oB,GAAG7tB,EAAG/I,KAAK0wB,YAGb,IAAIrxB,EACZ,OAAOA,EAAI,iBAAoBoE,EAAIiK,EAAEjK,KAAOA,aAAamqB,GAAKsC,GAAGlwB,KAAK02B,YAAa,oBAAqB5oB,EAAE6e,KAAMlpB,EAAG2G,EAAGyD,GAAKmiB,GAAGhwB,KAAK02B,YAAa,oBAAqB5oB,EAAE6e,KAAMlpB,GAC7KzD,KAAKw2B,WAAWl1B,KAAKjC,EAAEkvB,WAAWzgB,EAAE6e,KAAM9J,GAAGE,QAAO,KAAO/iB,KAOxDif,OAAOlW,GACV/I,KAAK22B,sBACL,MAAMlzB,EAAImzB,GAAG7tB,EAAG/I,KAAK0wB,YACrB,OAAO1wB,KAAKw2B,WAAax2B,KAAKw2B,WAAWpb,OAAO,IAAIoI,GAAG/f,EAAEkpB,KAAM9J,GAAGgS,SAAU70B,KAazE62B,SACH,OAAO72B,KAAK22B,sBAAuB32B,KAAKy2B,YAAa,EAAIz2B,KAAKw2B,WAAWl3B,OAAS,EAAIU,KAAKu2B,eAAev2B,KAAKw2B,YAAc5qB,QAAQC,UAEzI8qB,sBACI,GAAI32B,KAAKy2B,WAAY,MAAM,IAAIjrB,EAAEL,EAAG,wEAI5C,SAASyrB,GAAG7tB,EAAGtF,GACX,IAAKsF,EAAI2E,EAAE3E,IAAI6jB,YAAcnpB,EAAG,MAAM,IAAI+H,EAAEX,EAAG,uEAC/C,OAAO9B,EAeP,SAAS+tB,GAAG/tB,GACZ,MAAMtF,EAAI6kB,GAAGvf,EAAIyI,GAAGzI,EAAG2gB,KACvB,OAAO,IAAI4M,GAAGvtB,GAAIA,GAAKme,GAAGzjB,EAAGsF,KAsB7B,MAAMguB,GACNt0B,YAAYsG,GACR/I,KAAKg3B,UAAYjuB,EAEjB/I,KAAKi3B,aAAe,IAAI9qB,IAAKnM,KAAKk3B,UAAY,GAAIl3B,KAAKm3B,WAAY,EAKnEn3B,KAAKo3B,eAAiB,KAOtBp3B,KAAKq3B,YAAc,IAAIC,IAE3B1jB,aAAa7K,GACT,GAAI/I,KAAKu3B,wBAAyBv3B,KAAKk3B,UAAU53B,OAAS,EAAG,MAAM,IAAIkM,EAAEX,EAAG,8EAC5E,MAAMpH,QAAUqkB,GAAG9nB,KAAKg3B,UAAWjuB,GACnC,OAAOtF,EAAE2L,SAASrG,GAAK/I,KAAKw3B,cAAczuB,KAAMtF,EAEpD2I,IAAIrD,EAAGtF,GACHzD,KAAKy3B,MAAMh0B,EAAE8qB,WAAWxlB,EAAG/I,KAAKmjB,aAAapa,KAAM/I,KAAKq3B,YAAYrY,IAAIjW,EAAE0C,YAE9E2b,OAAOre,EAAGtF,GACN,IACIzD,KAAKy3B,MAAMh0B,EAAE8qB,WAAWxlB,EAAG/I,KAAK03B,sBAAsB3uB,KACxD,MAAOA,GACL/I,KAAKo3B,eAAiBruB,EAE1B/I,KAAKq3B,YAAYrY,IAAIjW,EAAE0C,YAE3BwT,OAAOlW,GACH/I,KAAKy3B,MAAM,IAAIjU,GAAGza,EAAG/I,KAAKmjB,aAAapa,KAAM/I,KAAKq3B,YAAYrY,IAAIjW,EAAE0C,YAExEmI,eACI,GAAI5T,KAAKu3B,wBAAyBv3B,KAAKo3B,eAAgB,MAAMp3B,KAAKo3B,eAClE,MAAMruB,EAAI/I,KAAKi3B,aAEPj3B,KAAKk3B,UAAU9nB,SAAS3L,IAC5BsF,EAAEkW,OAAOxb,EAAE4C,IAAIoF,eAInB1C,EAAEqG,SAAO,CAAGrG,EAAGtF,KACX,MAAM2G,EAAIuG,GAAGgnB,SAASl0B,GACtBzD,KAAKk3B,UAAU51B,KAAK,IAAImiB,GAAGrZ,EAAGpK,KAAKmjB,aAAa/Y,cACzC8c,GAAGlnB,KAAKg3B,UAAWh3B,KAAKk3B,WAAYl3B,KAAKm3B,WAAY,EAEpEK,cAAczuB,GACV,IAAItF,EACJ,GAAIsF,EAAE6X,kBAAmBnd,EAAIsF,EAAE8W,YAAc,CACzC,IAAK9W,EAAE8X,eAAgB,MAAMla,IAE7BlD,EAAIoY,GAAG7L,MAEX,MAAM5F,EAAIpK,KAAKi3B,aAAavnB,IAAI3G,EAAE1C,IAAIoF,YACtC,GAAIrB,GACA,IAAK3G,EAAE0F,QAAQiB,GAEf,MAAM,IAAIoB,EAAEJ,EAAG,oDACZpL,KAAKi3B,aAAa7qB,IAAIrD,EAAE1C,IAAIoF,WAAYhI,GAK5C0f,aAAapa,GAChB,MAAMtF,EAAIzD,KAAKi3B,aAAavnB,IAAI3G,EAAE0C,YAClC,OAAQzL,KAAKq3B,YAAY5Y,IAAI1V,EAAE0C,aAAehI,EAAIA,EAAE0F,QAAQ0S,GAAG7L,OAAS6S,GAAGE,QAAO,GAAMF,GAAGC,WAAWrf,GAAKof,GAAGgS,OAI3G6C,sBAAsB3uB,GACzB,MAAMtF,EAAIzD,KAAKi3B,aAAavnB,IAAI3G,EAAE0C,YAG1B,IAAKzL,KAAKq3B,YAAY5Y,IAAI1V,EAAE0C,aAAehI,EAAG,CAClD,GAAIA,EAAE0F,QAAQ0S,GAAG7L,OAUjB,MAAM,IAAIxE,EAAEX,EAAG,+CAEH,OAAOgY,GAAGC,WAAWrf,GAIrC,OAAOof,GAAGE,QAAO,GAErB0U,MAAM1uB,GACF/I,KAAKu3B,wBAAyBv3B,KAAKk3B,UAAU51B,KAAKyH,GAEtDwuB,0BAkBA,MAAMK,GAAK,CACXC,YAAa,GAuBjB,MAAMC,GACFr1B,YAAYsG,EAAGtF,EAAG2G,EAAGyD,EAAGC,GACpB9N,KAAK+3B,WAAahvB,EAAG/I,KAAKg3B,UAAYvzB,EAAGzD,KAAK4oB,QAAUxe,EAAGpK,KAAKg4B,eAAiBnqB,EACjF7N,KAAKi4B,SAAWnqB,EAAG9N,KAAKqS,GAAKjI,EAAEytB,YAAa73B,KAAKsS,GAAK,IAAI6T,GAAGnmB,KAAK+3B,WAAY,qBAElBG,MAC5Dl4B,KAAKqS,IAAM,EAAGrS,KAAKuT,KAEvBA,KACIvT,KAAKsS,GAAG/E,aACJ,MAAMxE,EAAI,IAAIguB,GAAG/2B,KAAKg3B,WAAYvzB,EAAIzD,KAAKkU,GAAGnL,GAC9CtF,GAAKA,EAAEwJ,MAAMxJ,IACTzD,KAAK+3B,WAAWI,kBAAkB,IAAMpvB,EAAE8tB,SAAS5pB,WAC/CjN,KAAKi4B,SAASpsB,QAAQpI,MACtBujB,OAAOje,IACP/I,KAAKqU,GAAGtL,WAEZie,OAAOje,IACP/I,KAAKqU,GAAGtL,SAIpBmL,GAAGnL,GACC,IACI,MAAMtF,EAAIzD,KAAKg4B,eAAejvB,GAC9B,OAAQ8I,GAAGpO,IAAMA,EAAEujB,OAASvjB,EAAEwJ,KAAOxJ,GAAKzD,KAAKi4B,SAASnsB,OAAOrL,MAAM,+CACrE,MACF,MAAOsI,GAEL,OAAO/I,KAAKi4B,SAASnsB,OAAO/C,GAAI,MAGxCsL,GAAGtL,GACC/I,KAAKqS,GAAK,GAAKrS,KAAK2U,GAAG5L,IAAM/I,KAAKqS,IAAM,EAAGrS,KAAK+3B,WAAWI,kBAAkB,KAAOn4B,KAAKuT,KACzF3H,QAAQC,cAAgB7L,KAAKi4B,SAASnsB,OAAO/C,GAEjD4L,GAAG5L,GACC,GAAI,kBAAoBA,EAAErG,KAAM,CAG5B,MAAMe,EAAIsF,EAAE5D,KACZ,MAAO,YAAc1B,GAAK,wBAA0BA,GAAK,mBAAqBA,IAO9E,SAASsF,GACL,OAAQA,GACN,QACE,OAAOpC,IAET,KAAKgE,EACL,KAAKC,EACL,KAAKE,EACL,KAAKI,EACL,KAAKI,EACL,KAAKC,EAGe,KAAKN,EACvB,OAAO,EAET,KAAKJ,EACL,KAAKE,EACL,IA50MwG,iBA60MxG,KAAKC,EACL,KAAKG,EAIe,KAAKC,EACzB,KAAKC,EACL,KAAKtE,EACL,IAr1M8T,YAs1M5T,OAAO,GA5Bf,CA8BEtD,GAEN,OAAO,GAoB2D,SAAS20B,KAG/E,MAAO,oBAAsB90B,SAAWA,SAAW,KA6BnD,MAAM+0B,GACN51B,YAAYsG,EAAGtF,EAAG2G,EAAGyD,EAAGC,GACpB9N,KAAK+3B,WAAahvB,EAAG/I,KAAKomB,QAAU3iB,EAAGzD,KAAKs4B,aAAeluB,EAAGpK,KAAKka,GAAKrM,EAAG7N,KAAKu4B,gBAAkBzqB,EAClG9N,KAAKi4B,SAAW,IAAIvsB,EAAG1L,KAAKiN,KAAOjN,KAAKi4B,SAAStsB,QAAQsB,KAAKwb,KAAKzoB,KAAKi4B,SAAStsB,SAIjF3L,KAAKi4B,SAAStsB,QAAQqb,OAAOje,QAe1B2F,yBAAyB3F,EAAGtF,EAAG2G,EAAGyD,EAAGC,GACxC,MAAMzO,EAAIsJ,KAAKD,MAAQ0B,EAAGiD,EAAI,IAAIgrB,GAAGtvB,EAAGtF,EAAGpE,EAAGwO,EAAGC,GACjD,OAAOT,EAAEb,MAAMpC,GAAIiD,EAKhBb,MAAMzD,GACT/I,KAAKw4B,YAAcC,YAAY,IAAMz4B,KAAK04B,sBAAuB3vB,GAK9D2d,YACH,OAAO1mB,KAAK04B,qBAQTnS,OAAOxd,GACV,OAAS/I,KAAKw4B,cAAgBx4B,KAAK24B,eAAgB34B,KAAKi4B,SAASnsB,OAAO,IAAIN,EAAEb,EAAG,uBAAyB5B,EAAI,KAAOA,EAAI,OAE7H2vB,qBACI14B,KAAK+3B,WAAWI,sBAAwB,OAASn4B,KAAKw4B,aAAex4B,KAAK24B,eAC1E34B,KAAKka,KAAKjN,MAAMlE,GAAK/I,KAAKi4B,SAASpsB,QAAQ9C,MAAQ6C,QAAQC,YAE/D8sB,eACI,OAAS34B,KAAKw4B,cAAgBx4B,KAAKu4B,gBAAgBv4B,MAAO24B,aAAa34B,KAAKw4B,aAC5Ex4B,KAAKw4B,YAAc,OAmBvB,MAAMI,GACNn2B,cAEIzC,KAAK4U,GAAKhJ,QAAQC,UAGlB7L,KAAK6U,GAAK,GAGV7U,KAAK+U,IAAK,EAGV/U,KAAKkV,GAAK,GAEVlV,KAAKmV,GAAK,KAGVnV,KAAKqV,IAAK,EAEVrV,KAAKiW,IAAK,EAEVjW,KAAKmW,GAAK,GAEVnW,KAAKsS,GAAK,IAAI6T,GAAGnmB,KAAM,qBAIvBA,KAAK0W,GAAK,KACN,MAAM3N,EAAIqvB,KACVrvB,GAAKoB,EAAE,aAAc,+BAAiCpB,EAAE8vB,iBAAkB74B,KAAKsS,GAAG7E,KAEtF,MAAM1E,EAAIqvB,KACVrvB,GAAK,mBAAqBA,EAAE+vB,kBAAoB/vB,EAAE+vB,iBAAiB,mBAAoB94B,KAAK0W,IAE5FqiB,qBACA,OAAO/4B,KAAK+U,GAKTojB,iBAAiBpvB,GAEpB/I,KAAKg5B,QAAQjwB,GAEjBkwB,oCAAoClwB,GAChC/I,KAAK2W,KAEL3W,KAAK8W,GAAG/N,GAEZmwB,oBAAoBnwB,GAChB,IAAK/I,KAAK+U,GAAI,CACV/U,KAAK+U,IAAK,EAAI/U,KAAKiW,GAAKlN,IAAK,EAC7B,MAAMtF,EAAI20B,KACV30B,GAAK,mBAAqBA,EAAE01B,qBAAuB11B,EAAE01B,oBAAoB,mBAAoBn5B,KAAK0W,KAG1GsiB,QAAQjwB,GACJ,GAAI/I,KAAK2W,KAAM3W,KAAK+U,GAEpB,OAAO,IAAInJ,kBAIH,MAAMnI,EAAI,IAAIiI,EACtB,OAAO1L,KAAK8W,IAAI,IAAM9W,KAAK+U,IAAM/U,KAAKiW,GAAKrK,QAAQC,WAAa9C,IAAIkE,KAAKxJ,EAAEoI,QAASpI,EAAEqI,QACtFrI,EAAEkI,WAAWsB,MAAI,IAAQxJ,EAAEkI,UAE/Bc,iBAAiB1D,GACb/I,KAAKm4B,kBAAgB,KAASn4B,KAAK6U,GAAGvT,KAAKyH,GAAI/I,KAAKuX,QAKjD3D,WACH,GAAI,IAAM5T,KAAK6U,GAAGvV,OAAQ,CACtB,UACUU,KAAK6U,GAAG,KAAM7U,KAAK6U,GAAGukB,QAASp5B,KAAKsS,GAAGgU,QAC/C,MAAOvd,GACL,IAkBA,SAASA,GAGL,MAAO,8BAAgCA,EAAErG,KAH7C,CAoBXqG,GAAI,MAAMA,EAEiBoB,EAAE,aAAc,0CAA4CpB,GAEhF/I,KAAK6U,GAAGvV,OAAS,GAWjBU,KAAKsS,GAAG/E,GAAC,IAAQvN,KAAKuX,QAG9BT,GAAG/N,GACC,MAAMtF,EAAIzD,KAAK4U,GAAG3H,MAAI,KAASjN,KAAKqV,IAAK,EAAItM,IAAIie,OAAOje,IACpD/I,KAAKmV,GAAKpM,EAAG/I,KAAKqV,IAAK,EACvB,MAAM5R,EAMN,SAASsF,GACL,IAAItF,EAAIsF,EAAE3D,SAAW,GAErB,OADA2D,EAAEswB,QAAU51B,EAAIsF,EAAEswB,MAAMryB,SAAS+B,EAAE3D,SAAW2D,EAAEswB,MAAQtwB,EAAE3D,QAAU,KAAO2D,EAAEswB,OACtE51B,EAHX,CA6BPsF,GAIO,MAAMwB,EAAE,6BAA8B9G,GAAIsF,KAC1CkE,MAAMlE,IAAM/I,KAAKqV,IAAK,EAAItM,QAC9B,OAAO/I,KAAK4U,GAAKnR,EAAGA,EAExBgjB,kBAAkB1d,EAAGtF,EAAG2G,GACpBpK,KAAK2W,KAEL3W,KAAKmW,GAAGhG,QAAQpH,IAAM,IAAMtF,EAAI,GAChC,MAAMoK,EAAIwqB,GAAGiB,kBAAkBt5B,KAAM+I,EAAGtF,EAAG2G,GAAIrB,GAAK/I,KAAK4X,GAAG7O,KAC5D,OAAO/I,KAAKkV,GAAG5T,KAAKuM,GAAIA,EAE5B8I,KACI3W,KAAKmV,IAAMxO,IAEf4yB,6BAIO3lB,WAKH,IAAI7K,EACJ,GACIA,EAAI/I,KAAK4U,SAAU7L,QACdA,IAAM/I,KAAK4U,IAKjBqD,GAAGlP,GACN,IAAK,MAAMtF,KAAKzD,KAAKkV,GAAI,GAAIzR,EAAE2iB,UAAYrd,EAAG,OAAO,EACrD,OAAO,EAQJmP,GAAGnP,GAEN,OAAO/I,KAAK8X,KAAK7K,WAEbjN,KAAKkV,GAAGiE,MAAI,CAAGpQ,EAAGtF,IAAMsF,EAAEuvB,aAAe70B,EAAE60B,eAC3C,IAAK,MAAM70B,KAAKzD,KAAKkV,GAAI,GAAIzR,EAAEijB,YAAa,QAA4B3d,GAAKtF,EAAE2iB,UAAYrd,EAAG,MAC9F,OAAO/I,KAAK8X,QAKbK,GAAGpP,GACN/I,KAAKmW,GAAG7U,KAAKyH,GAE4C6O,GAAG7O,GAE5D,MAAMtF,EAAIzD,KAAKkV,GAAG/E,QAAQpH,GAC1B/I,KAAKkV,GAAGskB,OAAO/1B,EAAG,IAI1B,MAAMg2B,GAEFh3B,YAAYsG,EAAGtF,GACXzD,KAAK0wB,WAAa3nB,EAAG/I,KAAK05B,aAAej2B,EAAGzD,KAAK02B,YAAc1H,GAAGjmB,GAO/D2G,IAAI3G,GACP,MAAMtF,EAAImzB,GAAG7tB,EAAG/I,KAAK0wB,YAAatmB,EAAI,IAAI2pB,GAAG/zB,KAAK0wB,YAClD,OAAO1wB,KAAK05B,aAAaC,OAAO,CAAEl2B,EAAEkpB,OAAQ1f,MAAMlE,IAC9C,IAAKA,GAAK,IAAMA,EAAEzJ,OAAQ,OAAOqH,IACjC,MAAMkH,EAAI9E,EAAE,GACZ,GAAI8E,EAAE+S,kBAAmB,OAAO,IAAI6P,GAAGzwB,KAAK0wB,WAAYtmB,EAAGyD,EAAExH,IAAKwH,EAAGpK,EAAEipB,WACvE,GAAI7e,EAAEgT,eAAgB,OAAO,IAAI4P,GAAGzwB,KAAK0wB,WAAYtmB,EAAG3G,EAAEkpB,KAAM,KAAMlpB,EAAEipB,WACxE,MAAM/lB,OAGdyF,IAAIrD,EAAGtF,EAAG2G,GACN,MAAMyD,EAAI+oB,GAAG7tB,EAAG/I,KAAK0wB,YAAa5iB,EAAI+lB,GAAGhmB,EAAE6e,UAAWjpB,EAAG2G,GAAI/K,EAAI4vB,GAAGjvB,KAAK02B,YAAa,kBAAmB7oB,EAAE8e,KAAM7e,EAAG,OAASD,EAAE6e,UAAWtiB,GAC1I,OAAOpK,KAAK05B,aAAattB,IAAIyB,EAAE8e,KAAMttB,GAAIW,KAE7ConB,OAAOre,EAAGtF,EAAG2G,KAAMyD,GACf,MAAMC,EAAI8oB,GAAG7tB,EAAG/I,KAAK0wB,YAGb,IAAIrxB,EACZ,OAAOA,EAAI,iBAAoBoE,EAAIiK,EAAEjK,KAAOA,aAAamqB,GAAKsC,GAAGlwB,KAAK02B,YAAa,qBAAsB5oB,EAAE6e,KAAMlpB,EAAG2G,EAAGyD,GAAKmiB,GAAGhwB,KAAK02B,YAAa,qBAAsB5oB,EAAE6e,KAAMlpB,GAC/KzD,KAAK05B,aAAatS,OAAOtZ,EAAE6e,KAAMttB,GAAIW,KAOlCif,OAAOlW,GACV,MAAMtF,EAAImzB,GAAG7tB,EAAG/I,KAAK0wB,YACrB,OAAO1wB,KAAK05B,aAAaza,OAAOxb,EAAEkpB,MAAO3sB,MAsB7C,SAAS45B,GAAG7wB,EAAGtF,EAAG2G,GAClB,MAAMyD,EAAIya,GAAGvf,EAAIyI,GAAGzI,EAAG2gB,KAAM5b,EAAIvI,OAAOmU,OAAOnU,OAAOmU,OAAO,GAAIke,IAAKxtB,IACrE,SAASrB,GACN,GAAIA,EAAE8uB,YAAc,EAAG,MAAM,IAAIrsB,EAAEX,EAAG,mCADzC,CAECiD,GACF,MAAMzO,EAAI,IAAIqM,EACd,OAAO,IAAIosB,GAAG,IAAIc,GAAI/qB,EAAGC,GAAI1D,GAAK3G,EAAE,IAAIg2B,GAAG1wB,EAAGqB,KAAM/K,GAAG64B,MAAO74B,EAAEsM,QAWhEnC,EACF,GAAGsE,SAAW1D,EAAE,IEt9NL,MAiBX3H,YACWC,EACAm3B,EACA5tB,GAFAjM,KAAI0C,KAAJA,EACA1C,KAAe65B,gBAAfA,EACA75B,KAAIiM,KAAJA,EAnBXjM,KAAiB85B,mBAAG,EAIpB95B,KAAY+5B,aAAe,GAE3B/5B,KAAAg6B,kBAA2C,OAE3Ch6B,KAAiBi6B,kBAAwC,KAczDC,qBAAqBC,GAEnB,OADAn6B,KAAKg6B,kBAAoBG,EAClBn6B,KAGTo6B,qBAAqBN,GAEnB,OADA95B,KAAK85B,kBAAoBA,EAClB95B,KAGTq6B,gBAAgBC,GAEd,OADAt6B,KAAK+5B,aAAeO,EACbt6B,KAGTu6B,2BAA2BC,GAEzB,OADAx6B,KAAKi6B,kBAAoBO,EAClBx6B,OF86Na,kBAAgB,CAAI+I,GAAI8hB,mBAAoBpnB,EAAGmlB,QAASxe,MAC5E,MAAMyD,EAAI9E,EAAE0xB,YAAY,OAAO1P,eAAgBjd,EAAI,IAAI4b,GAAG,IAAI5c,GAAE/D,EAAE0xB,YAAY,kBAAmB,IAAIhtB,GAAE1E,EAAE0xB,YAAY,uBAAwB,SAAS1xB,EAAGtF,GACrJ,IAAK8B,OAAOE,UAAUuP,eAAe0lB,MAAM3xB,EAAE6f,QAAS,CAAE,cAAgB,MAAM,IAAIpd,EAAEX,EAAG,uDACvF,OAAO,IAAI0D,GAAExF,EAAE6f,QAAQpa,UAAW/K,GAFuG,CAmB5IoK,EAAGpK,GAAIoK,GACR,OAAOzD,GAAK0D,EAAEkc,aAAa5f,GAAI0D,IAC/B,UAAUssB,sBAAqB,IAEnCvsB,EAAE,iBAAkB,SAAU,IAAKA,EAAE,iBAAkB,SAAU","preExistingComment":"firebase-firestore-lite.js.map"}