{"version":3,"file":"firebase-firestore.js","sources":["../util/src/crypt.ts","../util/src/defaults.ts","../util/src/global.ts","../util/src/environment.ts","../util/src/errors.ts","../util/src/obj.ts","../util/src/compat.ts","../component/src/component.ts","../logger/src/logger.ts","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/base.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/disposable/disposable.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/array/array.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/events/event.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/events/browserfeature.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/string/internal.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/labs/useragent/util.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/reflect/reflect.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/useragent/useragent.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/labs/useragent/browser.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/labs/useragent/engine.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/net/xhrio.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/events/browserevent.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/events/eventtype.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/events/listenable.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/events/listenablekey.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/events/listener.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/events/listenermap.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/object/object.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/events/events.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/events/eventtarget.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/json/json.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/async/workqueue.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/async/run.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/async/freelist.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/async/throwexception.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/timer/timer.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/async/throttle.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/events/eventhandler.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/labs/net/webchannel/webchanneldebug.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/labs/net/webchannel/requeststats.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/net/errorcode.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/net/eventtype.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/net/xmlhttpfactory.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/labs/net/webchannel.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/net/xmlhttp.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/labs/net/webchannel/channelrequest.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/labs/net/webchannel/environment.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/labs/net/webchannel/webchannelbase.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/uri/uri.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/disposable/dispose.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/labs/net/webchannel/wirev8.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/string/string.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/labs/net/webchannel/forwardchannelrequestpool.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/structs/structs.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/uri/utils.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/json/nativejsonprocessor.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/labs/net/webchannel/netutils.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/net/fetchxmlhttpfactory.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/functions/functions.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/json/hybrid.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/net/httpstatus.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/net/rpc/httpcors.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/labs/net/webchannel/webchannelbasetransport.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/labs/net/webchannel/wire.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/labs/net/webchanneltransport.js","../webchannel-wrapper/dist/temp/src/index.js","../firestore/dist/index.esm2017.js","../webchannel-wrapper/node_modules/google-closure-library/closure/goog/labs/net/webchanneltransportfactory.js","../util/src/emulator.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 Error();\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 * 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\nimport { CONSTANTS } from './constants';\nimport { getDefaults } from './defaults';\n\n/**\n * Returns navigator.userAgent string or '' if it's not defined.\n * @return user agent string\n */\nexport function getUA(): string {\n  if (\n    typeof navigator !== 'undefined' &&\n    typeof navigator['userAgent'] === 'string'\n  ) {\n    return navigator['userAgent'];\n  } else {\n    return '';\n  }\n}\n\n/**\n * Detect Cordova / PhoneGap / Ionic frameworks on a mobile device.\n *\n * Deliberately does not rely on checking `file://` URLs (as this fails PhoneGap\n * in the Ripple emulator) nor Cordova `onDeviceReady`, which would normally\n * wait for a callback.\n */\nexport function isMobileCordova(): boolean {\n  return (\n    typeof window !== 'undefined' &&\n    // @ts-ignore Setting up an broadly applicable index signature for Window\n    // just to deal with this case would probably be a bad idea.\n    !!(window['cordova'] || window['phonegap'] || window['PhoneGap']) &&\n    /ios|iphone|ipod|ipad|android|blackberry|iemobile/i.test(getUA())\n  );\n}\n\n/**\n * Detect Node.js.\n *\n * @return true if Node.js environment is detected or specified.\n */\n// Node detection logic from: https://github.com/iliakan/detect-node/\nexport function isNode(): boolean {\n  const forceEnvironment = getDefaults()?.forceEnvironment;\n  if (forceEnvironment === 'node') {\n    return true;\n  } else if (forceEnvironment === 'browser') {\n    return false;\n  }\n\n  try {\n    return (\n      Object.prototype.toString.call(global.process) === '[object process]'\n    );\n  } catch (e) {\n    return false;\n  }\n}\n\n/**\n * Detect Browser Environment\n */\nexport function isBrowser(): boolean {\n  return typeof self === 'object' && self.self === self;\n}\n\n/**\n * Detect browser extensions (Chrome and Firefox at least).\n */\ninterface BrowserRuntime {\n  id?: unknown;\n}\ndeclare const chrome: { runtime?: BrowserRuntime };\ndeclare const browser: { runtime?: BrowserRuntime };\nexport function isBrowserExtension(): boolean {\n  const runtime =\n    typeof chrome === 'object'\n      ? chrome.runtime\n      : typeof browser === 'object'\n      ? browser.runtime\n      : undefined;\n  return typeof runtime === 'object' && runtime.id !== undefined;\n}\n\n/**\n * Detect React Native.\n *\n * @return true if ReactNative environment is detected.\n */\nexport function isReactNative(): boolean {\n  return (\n    typeof navigator === 'object' && navigator['product'] === 'ReactNative'\n  );\n}\n\n/** Detects Electron apps. */\nexport function isElectron(): boolean {\n  return getUA().indexOf('Electron/') >= 0;\n}\n\n/** Detects Internet Explorer. */\nexport function isIE(): boolean {\n  const ua = getUA();\n  return ua.indexOf('MSIE ') >= 0 || ua.indexOf('Trident/') >= 0;\n}\n\n/** Detects Universal Windows Platform apps. */\nexport function isUWP(): boolean {\n  return getUA().indexOf('MSAppHost/') >= 0;\n}\n\n/**\n * Detect whether the current SDK build is the Node version.\n *\n * @return true if it's the Node SDK build.\n */\nexport function isNodeSdk(): boolean {\n  return CONSTANTS.NODE_CLIENT === true || CONSTANTS.NODE_ADMIN === true;\n}\n\n/** Returns true if we are running in Safari. */\nexport function isSafari(): boolean {\n  return (\n    !isNode() &&\n    navigator.userAgent.includes('Safari') &&\n    !navigator.userAgent.includes('Chrome')\n  );\n}\n\n/**\n * This method checks if indexedDB is supported by current browser/service worker context\n * @return true if indexedDB is supported by current browser/service worker context\n */\nexport function isIndexedDBAvailable(): boolean {\n  try {\n    return typeof indexedDB === 'object';\n  } catch (e) {\n    return false;\n  }\n}\n\n/**\n * This method validates browser/sw context for indexedDB by opening a dummy indexedDB database and reject\n * if errors occur during the database open operation.\n *\n * @throws exception if current browser/sw context can't run idb.open (ex: Safari iframe, Firefox\n * private browsing)\n */\nexport function validateIndexedDBOpenable(): Promise<boolean> {\n  return new Promise((resolve, reject) => {\n    try {\n      let preExist: boolean = true;\n      const DB_CHECK_NAME =\n        'validate-browser-context-for-indexeddb-analytics-module';\n      const request = self.indexedDB.open(DB_CHECK_NAME);\n      request.onsuccess = () => {\n        request.result.close();\n        // delete database only when it doesn't pre-exist\n        if (!preExist) {\n          self.indexedDB.deleteDatabase(DB_CHECK_NAME);\n        }\n        resolve(true);\n      };\n      request.onupgradeneeded = () => {\n        preExist = false;\n      };\n\n      request.onerror = () => {\n        reject(request.error?.message || '');\n      };\n    } catch (error) {\n      reject(error);\n    }\n  });\n}\n\n/**\n *\n * This method checks whether cookie is enabled within current browser\n * @return true if cookie is enabled within current browser\n */\nexport function areCookiesEnabled(): boolean {\n  if (typeof navigator === 'undefined' || !navigator.cookieEnabled) {\n    return false;\n  }\n  return true;\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 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","/**\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","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Bootstrap for the Google JS Library (Closure).\n *\n * In uncompiled mode base.js will attempt to load Closure's deps file, unless\n * the global <code>CLOSURE_NO_DEPS</code> is set to true.  This allows projects\n * to include their own deps file(s) from different locations.\n *\n * Avoid including base.js more than once. This is strictly discouraged and not\n * supported. goog.require(...) won't work properly in that case.\n *\n * @provideGoog\n */\n\n\n/**\n * @define {boolean} Overridden to true by the compiler.\n */\nvar COMPILED = false;\n\n\n/**\n * Base namespace for the Closure library.  Checks to see goog is already\n * defined in the current scope before assigning to prevent clobbering if\n * base.js is loaded more than once.\n *\n * @const\n */\nvar goog = goog || {};\n\n/**\n * Reference to the global object.\n * https://www.ecma-international.org/ecma-262/9.0/index.html#sec-global-object\n *\n * More info on this implementation here:\n * https://docs.google.com/document/d/1NAeW4Wk7I7FV0Y2tcUFvQdGMc89k2vdgSXInw8_nvCI/edit\n *\n * @const\n * @suppress {undefinedVars} self won't be referenced unless `this` is falsy.\n * @type {!Global}\n */\ngoog.global =\n    // Check `this` first for backwards compatibility.\n    // Valid unless running as an ES module or in a function wrapper called\n    //   without setting `this` properly.\n    // Note that base.js can't usefully be imported as an ES module, but it may\n    // be compiled into bundles that are loadable as ES modules.\n    this ||\n    // https://developer.mozilla.org/en-US/docs/Web/API/Window/self\n    // For in-page browser environments and workers.\n    self;\n\n\n/**\n * A hook for overriding the define values in uncompiled mode.\n *\n * In uncompiled mode, `CLOSURE_UNCOMPILED_DEFINES` may be defined before\n * loading base.js.  If a key is defined in `CLOSURE_UNCOMPILED_DEFINES`,\n * `goog.define` will use the value instead of the default value.  This\n * allows flags to be overwritten without compilation (this is normally\n * accomplished with the compiler's \"define\" flag).\n *\n * Example:\n * <pre>\n *   var CLOSURE_UNCOMPILED_DEFINES = {'goog.DEBUG': false};\n * </pre>\n *\n * @type {Object<string, (string|number|boolean)>|undefined}\n */\ngoog.global.CLOSURE_UNCOMPILED_DEFINES;\n\n\n/**\n * A hook for overriding the define values in uncompiled or compiled mode,\n * like CLOSURE_UNCOMPILED_DEFINES but effective in compiled code.  In\n * uncompiled code CLOSURE_UNCOMPILED_DEFINES takes precedence.\n *\n * Also unlike CLOSURE_UNCOMPILED_DEFINES the values must be number, boolean or\n * string literals or the compiler will emit an error.\n *\n * While any @define value may be set, only those set with goog.define will be\n * effective for uncompiled code.\n *\n * Example:\n * <pre>\n *   var CLOSURE_DEFINES = {'goog.DEBUG': false} ;\n * </pre>\n *\n * Currently the Closure Compiler will only recognize very simple definitions of\n * this value when looking for values to apply to compiled code and ignore all\n * other references.  Specifically, it looks the value defined at the variable\n * declaration, as with the example above.\n *\n * TODO(user): Improve the recognized definitions.\n *\n * @type {!Object<string, (string|number|boolean)>|null|undefined}\n */\ngoog.global.CLOSURE_DEFINES;\n\n\n/**\n * Builds an object structure for the provided namespace path, ensuring that\n * names that already exist are not overwritten. For example:\n * \"a.b.c\" -> a = {};a.b={};a.b.c={};\n * Used by goog.provide and goog.exportSymbol.\n * @param {string} name The name of the object that this file defines.\n * @param {*=} object The object to expose at the end of the path.\n * @param {boolean=} overwriteImplicit If object is set and a previous call\n *     implicitly constructed the namespace given by name, this parameter\n *     controls whether object should overwrite the implicitly constructed\n *     namespace or be merged into it. Defaults to false.\n * @param {?Object=} objectToExportTo The object to add the path to; if this\n *     field is not specified, its value defaults to `goog.global`.\n * @private\n */\ngoog.exportPath_ = function(name, object, overwriteImplicit, objectToExportTo) {\n  var parts = name.split('.');\n  var cur = objectToExportTo || goog.global;\n\n  // Internet Explorer exhibits strange behavior when throwing errors from\n  // methods externed in this manner.  See the testExportSymbolExceptions in\n  // base_test.html for an example.\n  if (!(parts[0] in cur) && typeof cur.execScript != 'undefined') {\n    cur.execScript('var ' + parts[0]);\n  }\n\n  for (var part; parts.length && (part = parts.shift());) {\n    if (!parts.length && object !== undefined) {\n      if (!overwriteImplicit && goog.isObject(object) &&\n          goog.isObject(cur[part])) {\n        // Merge properties on object (the input parameter) with the existing\n        // implicitly defined namespace, so as to not clobber previously\n        // defined child namespaces.\n        for (var prop in object) {\n          if (object.hasOwnProperty(prop)) {\n            cur[part][prop] = object[prop];\n          }\n        }\n      } else {\n        // Either there is no existing implicit namespace, or overwriteImplicit\n        // is set to true, so directly assign object (the input parameter) to\n        // the namespace.\n        cur[part] = object;\n      }\n    } else if (cur[part] && cur[part] !== Object.prototype[part]) {\n      cur = cur[part];\n    } else {\n      cur = cur[part] = {};\n    }\n  }\n};\n\n\n/**\n * Defines a named value. In uncompiled mode, the value is retrieved from\n * CLOSURE_DEFINES or CLOSURE_UNCOMPILED_DEFINES if the object is defined and\n * has the property specified, and otherwise used the defined defaultValue.\n * When compiled the default can be overridden using the compiler options or the\n * value set in the CLOSURE_DEFINES object. Returns the defined value so that it\n * can be used safely in modules. Note that the value type MUST be either\n * boolean, number, or string.\n *\n * @param {string} name The distinguished name to provide.\n * @param {T} defaultValue\n * @return {T} The defined value.\n * @template T\n */\ngoog.define = function(name, defaultValue) {\n  var value = defaultValue;\n  if (!COMPILED) {\n    var uncompiledDefines = goog.global.CLOSURE_UNCOMPILED_DEFINES;\n    var defines = goog.global.CLOSURE_DEFINES;\n    if (uncompiledDefines &&\n        // Anti DOM-clobbering runtime check (b/37736576).\n        /** @type {?} */ (uncompiledDefines).nodeType === undefined &&\n        Object.prototype.hasOwnProperty.call(uncompiledDefines, name)) {\n      value = uncompiledDefines[name];\n    } else if (\n        defines &&\n        // Anti DOM-clobbering runtime check (b/37736576).\n        /** @type {?} */ (defines).nodeType === undefined &&\n        Object.prototype.hasOwnProperty.call(defines, name)) {\n      value = defines[name];\n    }\n  }\n  return value;\n};\n\n\n/**\n * @define {number} Integer year indicating the set of browser features that are\n * guaranteed to be present.  This is defined to include exactly features that\n * work correctly on all \"modern\" browsers that are stable on January 1 of the\n * specified year.  For example,\n * ```js\n * if (goog.FEATURESET_YEAR >= 2019) {\n *   // use APIs known to be available on all major stable browsers Jan 1, 2019\n * } else {\n *   // polyfill for older browsers\n * }\n * ```\n * This is intended to be the primary define for removing\n * unnecessary browser compatibility code (such as ponyfills and workarounds),\n * and should inform the default value for most other defines:\n * ```js\n * const ASSUME_NATIVE_PROMISE =\n *     goog.define('ASSUME_NATIVE_PROMISE', goog.FEATURESET_YEAR >= 2016);\n * ```\n *\n * The default assumption is that IE9 is the lowest supported browser, which was\n * first available Jan 1, 2012.\n *\n * TODO(user): Reference more thorough documentation when it's available.\n */\ngoog.FEATURESET_YEAR = goog.define('goog.FEATURESET_YEAR', 2012);\n\n\n/**\n * @define {boolean} DEBUG is provided as a convenience so that debugging code\n * that should not be included in a production. It can be easily stripped\n * by specifying --define goog.DEBUG=false to the Closure Compiler aka\n * JSCompiler. For example, most toString() methods should be declared inside an\n * \"if (goog.DEBUG)\" conditional because they are generally used for debugging\n * purposes and it is difficult for the JSCompiler to statically determine\n * whether they are used.\n */\ngoog.DEBUG = goog.define('goog.DEBUG', true);\n\n\n/**\n * @define {string} LOCALE defines the locale being used for compilation. It is\n * used to select locale specific data to be compiled in js binary. BUILD rule\n * can specify this value by \"--define goog.LOCALE=<locale_name>\" as a compiler\n * option.\n *\n * Take into account that the locale code format is important. You should use\n * the canonical Unicode format with hyphen as a delimiter. Language must be\n * lowercase, Language Script - Capitalized, Region - UPPERCASE.\n * There are few examples: pt-BR, en, en-US, sr-Latin-BO, zh-Hans-CN.\n *\n * See more info about locale codes here:\n * http://www.unicode.org/reports/tr35/#Unicode_Language_and_Locale_Identifiers\n *\n * For language codes you should use values defined by ISO 693-1. See it here\n * http://www.w3.org/WAI/ER/IG/ert/iso639.htm. There is only one exception from\n * this rule: the Hebrew language. For legacy reasons the old code (iw) should\n * be used instead of the new code (he).\n *\n */\ngoog.LOCALE = goog.define('goog.LOCALE', 'en');  // default to en\n\n\n/**\n * This method is intended to be used for bookkeeping purposes.  We would\n * like to distinguish uses of goog.LOCALE used for code stripping purposes\n * and uses of goog.LOCALE for other uses (such as URL parameters).\n *\n * This allows us to ban direct uses of goog.LOCALE and to ensure that all\n * code has been transformed to our new localization build scheme.\n *\n * @return {string}\n *\n */\ngoog.getLocale = function() {\n  return goog.LOCALE;\n};\n\n\n/**\n * @define {boolean} Whether this code is running on trusted sites.\n *\n * On untrusted sites, several native functions can be defined or overridden by\n * external libraries like Prototype, Datejs, and JQuery and setting this flag\n * to false forces closure to use its own implementations when possible.\n *\n * If your JavaScript can be loaded by a third party site and you are wary about\n * relying on non-standard implementations, specify\n * \"--define goog.TRUSTED_SITE=false\" to the compiler.\n */\ngoog.TRUSTED_SITE = goog.define('goog.TRUSTED_SITE', true);\n\n\n/**\n * @define {boolean} Whether code that calls {@link goog.setTestOnly} should\n *     be disallowed in the compilation unit.\n */\ngoog.DISALLOW_TEST_ONLY_CODE =\n    goog.define('goog.DISALLOW_TEST_ONLY_CODE', COMPILED && !goog.DEBUG);\n\n\n/**\n * @define {boolean} Whether to use a Chrome app CSP-compliant method for\n *     loading scripts via goog.require. @see appendScriptSrcNode_.\n */\ngoog.ENABLE_CHROME_APP_SAFE_SCRIPT_LOADING =\n    goog.define('goog.ENABLE_CHROME_APP_SAFE_SCRIPT_LOADING', false);\n\n\n/**\n * Defines a namespace in Closure.\n *\n * A namespace may only be defined once in a codebase. It may be defined using\n * goog.provide() or goog.module().\n *\n * The presence of one or more goog.provide() calls in a file indicates\n * that the file defines the given objects/namespaces.\n * Provided symbols must not be null or undefined.\n *\n * In addition, goog.provide() creates the object stubs for a namespace\n * (for example, goog.provide(\"goog.foo.bar\") will create the object\n * goog.foo.bar if it does not already exist).\n *\n * Build tools also scan for provide/require/module statements\n * to discern dependencies, build dependency files (see deps.js), etc.\n *\n * @see goog.require\n * @see goog.module\n * @param {string} name Namespace provided by this file in the form\n *     \"goog.package.part\".\n * deprecated Use goog.module (see b/159289405)\n */\ngoog.provide = function(name) {\n  if (goog.isInModuleLoader_()) {\n    throw new Error('goog.provide cannot be used within a module.');\n  }\n  if (!COMPILED) {\n    // Ensure that the same namespace isn't provided twice.\n    // A goog.module/goog.provide maps a goog.require to a specific file\n    if (goog.isProvided_(name)) {\n      throw new Error('Namespace \"' + name + '\" already declared.');\n    }\n  }\n\n  goog.constructNamespace_(name);\n};\n\n\n/**\n * @param {string} name Namespace provided by this file in the form\n *     \"goog.package.part\".\n * @param {?Object=} object The object to embed in the namespace.\n * @param {boolean=} overwriteImplicit If object is set and a previous call\n *     implicitly constructed the namespace given by name, this parameter\n *     controls whether opt_obj should overwrite the implicitly constructed\n *     namespace or be merged into it. Defaults to false.\n * @private\n */\ngoog.constructNamespace_ = function(name, object, overwriteImplicit) {\n  if (!COMPILED) {\n    delete goog.implicitNamespaces_[name];\n\n    var namespace = name;\n    while ((namespace = namespace.substring(0, namespace.lastIndexOf('.')))) {\n      if (goog.getObjectByName(namespace)) {\n        break;\n      }\n      goog.implicitNamespaces_[namespace] = true;\n    }\n  }\n\n  goog.exportPath_(name, object, overwriteImplicit);\n};\n\n\n/**\n * According to the CSP3 spec a nonce must be a valid base64 string.\n * @see https://www.w3.org/TR/CSP3/#grammardef-base64-value\n * @private @const\n */\ngoog.NONCE_PATTERN_ = /^[\\w+/_-]+[=]{0,2}$/;\n\n\n/**\n * Returns CSP nonce, if set for any script tag.\n * @param {?Window=} opt_window The window context used to retrieve the nonce.\n *     Defaults to global context.\n * @return {string} CSP nonce or empty string if no nonce is present.\n * @private\n */\ngoog.getScriptNonce_ = function(opt_window) {\n  var doc = (opt_window || goog.global).document;\n  var script = doc.querySelector && doc.querySelector('script[nonce]');\n  if (script) {\n    // Try to get the nonce from the IDL property first, because browsers that\n    // implement additional nonce protection features (currently only Chrome) to\n    // prevent nonce stealing via CSS do not expose the nonce via attributes.\n    // See https://github.com/whatwg/html/issues/2369\n    var nonce = script['nonce'] || script.getAttribute('nonce');\n    if (nonce && goog.NONCE_PATTERN_.test(nonce)) {\n      return nonce;\n    }\n  }\n  return '';\n};\n\n\n/**\n * Module identifier validation regexp.\n * Note: This is a conservative check, it is very possible to be more lenient,\n *   the primary exclusion here is \"/\" and \"\\\" and a leading \".\", these\n *   restrictions are intended to leave the door open for using goog.require\n *   with relative file paths rather than module identifiers.\n * @private\n */\ngoog.VALID_MODULE_RE_ = /^[a-zA-Z_$][a-zA-Z0-9._$]*$/;\n\n\n/**\n * Defines a module in Closure.\n *\n * Marks that this file must be loaded as a module and claims the namespace.\n *\n * A namespace may only be defined once in a codebase. It may be defined using\n * goog.provide() or goog.module().\n *\n * goog.module() has three requirements:\n * - goog.module may not be used in the same file as goog.provide.\n * - goog.module must be the first statement in the file.\n * - only one goog.module is allowed per file.\n *\n * When a goog.module annotated file is loaded, it is enclosed in\n * a strict function closure. This means that:\n * - any variables declared in a goog.module file are private to the file\n * (not global), though the compiler is expected to inline the module.\n * - The code must obey all the rules of \"strict\" JavaScript.\n * - the file will be marked as \"use strict\"\n *\n * NOTE: unlike goog.provide, goog.module does not declare any symbols by\n * itself. If declared symbols are desired, use\n * goog.module.declareLegacyNamespace().\n *\n *\n * See the public goog.module proposal: http://goo.gl/Va1hin\n *\n * @param {string} name Namespace provided by this file in the form\n *     \"goog.package.part\", is expected but not required.\n * @return {void}\n */\ngoog.module = function(name) {\n  if (typeof name !== 'string' || !name ||\n      name.search(goog.VALID_MODULE_RE_) == -1) {\n    throw new Error('Invalid module identifier');\n  }\n  if (!goog.isInGoogModuleLoader_()) {\n    throw new Error(\n        'Module ' + name + ' has been loaded incorrectly. Note, ' +\n        'modules cannot be loaded as normal scripts. They require some kind of ' +\n        'pre-processing step. You\\'re likely trying to load a module via a ' +\n        'script tag or as a part of a concatenated bundle without rewriting the ' +\n        'module. For more info see: ' +\n        'https://github.com/google/closure-library/wiki/goog.module:-an-ES6-module-like-alternative-to-goog.provide.');\n  }\n  if (goog.moduleLoaderState_.moduleName) {\n    throw new Error('goog.module may only be called once per module.');\n  }\n\n  // Store the module name for the loader.\n  goog.moduleLoaderState_.moduleName = name;\n  if (!COMPILED) {\n    // Ensure that the same namespace isn't provided twice.\n    // A goog.module/goog.provide maps a goog.require to a specific file\n    if (goog.isProvided_(name)) {\n      throw new Error('Namespace \"' + name + '\" already declared.');\n    }\n    delete goog.implicitNamespaces_[name];\n  }\n};\n\n\n/**\n * @param {string} name The module identifier.\n * @return {?} The module exports for an already loaded module or null.\n *\n * Note: This is not an alternative to goog.require, it does not\n * indicate a hard dependency, instead it is used to indicate\n * an optional dependency or to access the exports of a module\n * that has already been loaded.\n * @suppress {missingProvide}\n */\ngoog.module.get = function(name) {\n  return goog.module.getInternal_(name);\n};\n\n\n/**\n * @param {string} name The module identifier.\n * @return {?} The module exports for an already loaded module or null.\n * @private\n */\ngoog.module.getInternal_ = function(name) {\n  if (!COMPILED) {\n    if (name in goog.loadedModules_) {\n      return goog.loadedModules_[name].exports;\n    } else if (!goog.implicitNamespaces_[name]) {\n      var ns = goog.getObjectByName(name);\n      return ns != null ? ns : null;\n    }\n  }\n  return null;\n};\n\n\n/**\n * Types of modules the debug loader can load.\n * @enum {string}\n */\ngoog.ModuleType = {\n  ES6: 'es6',\n  GOOG: 'goog'\n};\n\n\n/**\n * @private {?{\n *   moduleName: (string|undefined),\n *   declareLegacyNamespace:boolean,\n *   type: ?goog.ModuleType\n * }}\n */\ngoog.moduleLoaderState_ = null;\n\n\n/**\n * @private\n * @return {boolean} Whether a goog.module or an es6 module is currently being\n *     initialized.\n */\ngoog.isInModuleLoader_ = function() {\n  return goog.isInGoogModuleLoader_() || goog.isInEs6ModuleLoader_();\n};\n\n\n/**\n * @private\n * @return {boolean} Whether a goog.module is currently being initialized.\n */\ngoog.isInGoogModuleLoader_ = function() {\n  return !!goog.moduleLoaderState_ &&\n      goog.moduleLoaderState_.type == goog.ModuleType.GOOG;\n};\n\n\n/**\n * @private\n * @return {boolean} Whether an es6 module is currently being initialized.\n */\ngoog.isInEs6ModuleLoader_ = function() {\n  var inLoader = !!goog.moduleLoaderState_ &&\n      goog.moduleLoaderState_.type == goog.ModuleType.ES6;\n\n  if (inLoader) {\n    return true;\n  }\n\n  var jscomp = goog.global['$jscomp'];\n\n  if (jscomp) {\n    // jscomp may not have getCurrentModulePath if this is a compiled bundle\n    // that has some of the runtime, but not all of it. This can happen if\n    // optimizations are turned on so the unused runtime is removed but renaming\n    // and Closure pass are off (so $jscomp is still named $jscomp and the\n    // goog.provide/require calls still exist).\n    if (typeof jscomp.getCurrentModulePath != 'function') {\n      return false;\n    }\n\n    // Bundled ES6 module.\n    return !!jscomp.getCurrentModulePath();\n  }\n\n  return false;\n};\n\n\n/**\n * Provide the module's exports as a globally accessible object under the\n * module's declared name.  This is intended to ease migration to goog.module\n * for files that have existing usages.\n * @suppress {missingProvide}\n */\ngoog.module.declareLegacyNamespace = function() {\n  if (!COMPILED && !goog.isInGoogModuleLoader_()) {\n    throw new Error(\n        'goog.module.declareLegacyNamespace must be called from ' +\n        'within a goog.module');\n  }\n  if (!COMPILED && !goog.moduleLoaderState_.moduleName) {\n    throw new Error(\n        'goog.module must be called prior to ' +\n        'goog.module.declareLegacyNamespace.');\n  }\n  goog.moduleLoaderState_.declareLegacyNamespace = true;\n};\n\n\n/**\n * Associates an ES6 module with a Closure module ID so that is available via\n * goog.require. The associated ID  acts like a goog.module ID - it does not\n * create any global names, it is merely available via goog.require /\n * goog.module.get / goog.forwardDeclare / goog.requireType. goog.require and\n * goog.module.get will return the entire module as if it was import *'d. This\n * allows Closure files to reference ES6 modules for the sake of migration.\n *\n * @param {string} namespace\n * @suppress {missingProvide}\n */\ngoog.declareModuleId = function(namespace) {\n  if (!COMPILED) {\n    if (!goog.isInEs6ModuleLoader_()) {\n      throw new Error(\n          'goog.declareModuleId may only be called from ' +\n          'within an ES6 module');\n    }\n    if (goog.moduleLoaderState_ && goog.moduleLoaderState_.moduleName) {\n      throw new Error(\n          'goog.declareModuleId may only be called once per module.');\n    }\n    if (namespace in goog.loadedModules_) {\n      throw new Error(\n          'Module with namespace \"' + namespace + '\" already exists.');\n    }\n  }\n  if (goog.moduleLoaderState_) {\n    // Not bundled - debug loading.\n    goog.moduleLoaderState_.moduleName = namespace;\n  } else {\n    // Bundled - not debug loading, no module loader state.\n    var jscomp = goog.global['$jscomp'];\n    if (!jscomp || typeof jscomp.getCurrentModulePath != 'function') {\n      throw new Error(\n          'Module with namespace \"' + namespace +\n          '\" has been loaded incorrectly.');\n    }\n    var exports = jscomp.require(jscomp.getCurrentModulePath());\n    goog.loadedModules_[namespace] = {\n      exports: exports,\n      type: goog.ModuleType.ES6,\n      moduleId: namespace\n    };\n  }\n};\n\n\n/**\n * Marks that the current file should only be used for testing, and never for\n * live code in production.\n *\n * In the case of unit tests, the message may optionally be an exact namespace\n * for the test (e.g. 'goog.stringTest'). The linter will then ignore the extra\n * provide (if not explicitly defined in the code).\n *\n * @param {string=} opt_message Optional message to add to the error that's\n *     raised when used in production code.\n */\ngoog.setTestOnly = function(opt_message) {\n  if (goog.DISALLOW_TEST_ONLY_CODE) {\n    opt_message = opt_message || '';\n    throw new Error(\n        'Importing test-only code into non-debug environment' +\n        (opt_message ? ': ' + opt_message : '.'));\n  }\n};\n\n\n/**\n * Forward declares a symbol. This is an indication to the compiler that the\n * symbol may be used in the source yet is not required and may not be provided\n * in compilation.\n *\n * The most common usage of forward declaration is code that takes a type as a\n * function parameter but does not need to require it. By forward declaring\n * instead of requiring, no hard dependency is made, and (if not required\n * elsewhere) the namespace may never be required and thus, not be pulled\n * into the JavaScript binary. If it is required elsewhere, it will be type\n * checked as normal.\n *\n * Before using goog.forwardDeclare, please read the documentation at\n * https://github.com/google/closure-compiler/wiki/Bad-Type-Annotation to\n * understand the options and tradeoffs when working with forward declarations.\n *\n * @param {string} name The namespace to forward declare in the form of\n *     \"goog.package.part\".\n * @deprecated See go/noforwarddeclaration, Use `goog.requireType` instead.\n */\ngoog.forwardDeclare = function(name) {};\n\n\n/**\n * Forward declare type information. Used to assign types to goog.global\n * referenced object that would otherwise result in unknown type references\n * and thus block property disambiguation.\n */\ngoog.forwardDeclare('Document');\ngoog.forwardDeclare('HTMLScriptElement');\ngoog.forwardDeclare('XMLHttpRequest');\n\n\nif (!COMPILED) {\n  /**\n   * Check if the given name has been goog.provided. This will return false for\n   * names that are available only as implicit namespaces.\n   * @param {string} name name of the object to look for.\n   * @return {boolean} Whether the name has been provided.\n   * @private\n   */\n  goog.isProvided_ = function(name) {\n    return (name in goog.loadedModules_) ||\n        (!goog.implicitNamespaces_[name] && goog.getObjectByName(name) != null);\n  };\n\n  /**\n   * Namespaces implicitly defined by goog.provide. For example,\n   * goog.provide('goog.events.Event') implicitly declares that 'goog' and\n   * 'goog.events' must be namespaces.\n   *\n   * @type {!Object<string, (boolean|undefined)>}\n   * @private\n   */\n  goog.implicitNamespaces_ = {'goog.module': true};\n\n  // NOTE: We add goog.module as an implicit namespace as goog.module is defined\n  // here and because the existing module package has not been moved yet out of\n  // the goog.module namespace. This satisifies both the debug loader and\n  // ahead-of-time dependency management.\n}\n\n\n/**\n * Returns an object based on its fully qualified external name.  The object\n * is not found if null or undefined.  If you are using a compilation pass that\n * renames property names beware that using this function will not find renamed\n * properties.\n *\n * @param {string} name The fully qualified name.\n * @param {Object=} opt_obj The object within which to look; default is\n *     |goog.global|.\n * @return {?} The value (object or primitive) or, if not found, null.\n */\ngoog.getObjectByName = function(name, opt_obj) {\n  var parts = name.split('.');\n  var cur = opt_obj || goog.global;\n  for (var i = 0; i < parts.length; i++) {\n    cur = cur[parts[i]];\n    if (cur == null) {\n      return null;\n    }\n  }\n  return cur;\n};\n\n\n/**\n * Adds a dependency from a file to the files it requires.\n * @param {string} relPath The path to the js file.\n * @param {!Array<string>} provides An array of strings with\n *     the names of the objects this file provides.\n * @param {!Array<string>} requires An array of strings with\n *     the names of the objects this file requires.\n * @param {boolean|!Object<string>=} opt_loadFlags Parameters indicating\n *     how the file must be loaded.  The boolean 'true' is equivalent\n *     to {'module': 'goog'} for backwards-compatibility.  Valid properties\n *     and values include {'module': 'goog'} and {'lang': 'es6'}.\n */\ngoog.addDependency = function(relPath, provides, requires, opt_loadFlags) {\n  if (!COMPILED && goog.DEPENDENCIES_ENABLED) {\n    goog.debugLoader_.addDependency(relPath, provides, requires, opt_loadFlags);\n  }\n};\n\n\n// NOTE(nnaze): The debug DOM loader was included in base.js as an original way\n// to do \"debug-mode\" development.  The dependency system can sometimes be\n// confusing, as can the debug DOM loader's asynchronous nature.\n//\n// With the DOM loader, a call to goog.require() is not blocking -- the script\n// will not load until some point after the current script.  If a namespace is\n// needed at runtime, it needs to be defined in a previous script, or loaded via\n// require() with its registered dependencies.\n//\n// User-defined namespaces may need their own deps file. For a reference on\n// creating a deps file, see:\n// Externally: https://developers.google.com/closure/library/docs/depswriter\n//\n// Because of legacy clients, the DOM loader can't be easily removed from\n// base.js.  Work was done to make it disableable or replaceable for\n// different environments (DOM-less JavaScript interpreters like Rhino or V8,\n// for example). See bootstrap/ for more information.\n\n\n/**\n * @define {boolean} Whether to enable the debug loader.\n *\n * If enabled, a call to goog.require() will attempt to load the namespace by\n * appending a script tag to the DOM (if the namespace has been registered).\n *\n * If disabled, goog.require() will simply assert that the namespace has been\n * provided (and depend on the fact that some outside tool correctly ordered\n * the script).\n */\ngoog.ENABLE_DEBUG_LOADER = goog.define('goog.ENABLE_DEBUG_LOADER', true);\n\n\n/**\n * @param {string} msg\n * @private\n */\ngoog.logToConsole_ = function(msg) {\n  if (goog.global.console) {\n    goog.global.console['error'](msg);\n  }\n};\n\n\n/**\n * Implements a system for the dynamic resolution of dependencies that works in\n * parallel with the BUILD system.\n *\n * Note that all calls to goog.require will be stripped by the compiler.\n *\n * @see goog.provide\n * @param {string} namespace Namespace (as was given in goog.provide,\n *     goog.module, or goog.declareModuleId) in the form\n *     \"goog.package.part\".\n * @return {?} If called within a goog.module or ES6 module file, the associated\n *     namespace or module otherwise null.\n */\ngoog.require = function(namespace) {\n  if (!COMPILED) {\n    // Might need to lazy load on old IE.\n    if (goog.ENABLE_DEBUG_LOADER) {\n      goog.debugLoader_.requested(namespace);\n    }\n\n    // If the object already exists we do not need to do anything.\n    if (goog.isProvided_(namespace)) {\n      if (goog.isInModuleLoader_()) {\n        return goog.module.getInternal_(namespace);\n      }\n    } else if (goog.ENABLE_DEBUG_LOADER) {\n      var moduleLoaderState = goog.moduleLoaderState_;\n      goog.moduleLoaderState_ = null;\n      try {\n        goog.debugLoader_.load_(namespace);\n      } finally {\n        goog.moduleLoaderState_ = moduleLoaderState;\n      }\n    }\n\n    return null;\n  }\n};\n\n\n/**\n * Requires a symbol for its type information. This is an indication to the\n * compiler that the symbol may appear in type annotations, yet it is not\n * referenced at runtime.\n *\n * When called within a goog.module or ES6 module file, the return value may be\n * assigned to or destructured into a variable, but it may not be otherwise used\n * in code outside of a type annotation.\n *\n * Note that all calls to goog.requireType will be stripped by the compiler.\n *\n * @param {string} namespace Namespace (as was given in goog.provide,\n *     goog.module, or goog.declareModuleId) in the form\n *     \"goog.package.part\".\n * @return {?}\n */\ngoog.requireType = function(namespace) {\n  // Return an empty object so that single-level destructuring of the return\n  // value doesn't crash at runtime when using the debug loader. Multi-level\n  // destructuring isn't supported.\n  return {};\n};\n\n\n/**\n * Path for included scripts.\n * @type {string}\n */\ngoog.basePath = '';\n\n\n/**\n * A hook for overriding the base path.\n * @type {string|undefined}\n */\ngoog.global.CLOSURE_BASE_PATH;\n\n\n/**\n * Whether to attempt to load Closure's deps file. By default, when uncompiled,\n * deps files will attempt to be loaded.\n * @type {boolean|undefined}\n */\ngoog.global.CLOSURE_NO_DEPS;\n\n\n/**\n * A function to import a single script. This is meant to be overridden when\n * Closure is being run in non-HTML contexts, such as web workers. It's defined\n * in the global scope so that it can be set before base.js is loaded, which\n * allows deps.js to be imported properly.\n *\n * The first parameter the script source, which is a relative URI. The second,\n * optional parameter is the script contents, in the event the script needed\n * transformation. It should return true if the script was imported, false\n * otherwise.\n * @type {(function(string, string=): boolean)|undefined}\n */\ngoog.global.CLOSURE_IMPORT_SCRIPT;\n\n\n/**\n * Null function used for default values of callbacks, etc.\n * @return {void} Nothing.\n * @deprecated use '()=>{}' or 'function(){}' instead.\n */\ngoog.nullFunction = function() {};\n\n\n/**\n * When defining a class Foo with an abstract method bar(), you can do:\n * Foo.prototype.bar = goog.abstractMethod\n *\n * Now if a subclass of Foo fails to override bar(), an error will be thrown\n * when bar() is invoked.\n *\n * @type {!Function}\n * @throws {Error} when invoked to indicate the method should be overridden.\n * @deprecated Use \"@abstract\" annotation instead of goog.abstractMethod in new\n *     code. See\n *     https://github.com/google/closure-compiler/wiki/@abstract-classes-and-methods\n */\ngoog.abstractMethod = function() {\n  throw new Error('unimplemented abstract method');\n};\n\n\n/**\n * Adds a `getInstance` static method that always returns the same\n * instance object.\n * @param {!Function} ctor The constructor for the class to add the static\n *     method to.\n * @suppress {missingProperties} 'instance_' isn't a property on 'Function'\n *     but we don't have a better type to use here.\n */\ngoog.addSingletonGetter = function(ctor) {\n  // instance_ is immediately set to prevent issues with sealed constructors\n  // such as are encountered when a constructor is returned as the export object\n  // of a goog.module in unoptimized code.\n  // Delcare type to avoid conformance violations that ctor.instance_ is unknown\n  /** @type {undefined|!Object} @suppress {underscore} */\n  ctor.instance_ = undefined;\n  ctor.getInstance = function() {\n    if (ctor.instance_) {\n      return ctor.instance_;\n    }\n    if (goog.DEBUG) {\n      // NOTE: JSCompiler can't optimize away Array#push.\n      goog.instantiatedSingletons_[goog.instantiatedSingletons_.length] = ctor;\n    }\n    // Cast to avoid conformance violations that ctor.instance_ is unknown\n    return /** @type {!Object|undefined} */ (ctor.instance_) = new ctor;\n  };\n};\n\n\n/**\n * All singleton classes that have been instantiated, for testing. Don't read\n * it directly, use the `goog.testing.singleton` module. The compiler\n * removes this variable if unused.\n * @type {!Array<!Function>}\n * @private\n */\ngoog.instantiatedSingletons_ = [];\n\n\n/**\n * @define {boolean} Whether to load goog.modules using `eval` when using\n * the debug loader.  This provides a better debugging experience as the\n * source is unmodified and can be edited using Chrome Workspaces or similar.\n * However in some environments the use of `eval` is banned\n * so we provide an alternative.\n */\ngoog.LOAD_MODULE_USING_EVAL = goog.define('goog.LOAD_MODULE_USING_EVAL', true);\n\n\n/**\n * @define {boolean} Whether the exports of goog.modules should be sealed when\n * possible.\n */\ngoog.SEAL_MODULE_EXPORTS = goog.define('goog.SEAL_MODULE_EXPORTS', goog.DEBUG);\n\n\n/**\n * The registry of initialized modules:\n * The module identifier or path to module exports map.\n * @private @const {!Object<string, {exports:?,type:string,moduleId:string}>}\n */\ngoog.loadedModules_ = {};\n\n\n/**\n * True if the debug loader enabled and used.\n * @const {boolean}\n */\ngoog.DEPENDENCIES_ENABLED = !COMPILED && goog.ENABLE_DEBUG_LOADER;\n\n\n/**\n * @define {string} How to decide whether to transpile.  Valid values\n * are 'always', 'never', and 'detect'.  The default ('detect') is to\n * use feature detection to determine which language levels need\n * transpilation.\n */\n// NOTE(sdh): we could expand this to accept a language level to bypass\n// detection: e.g. goog.TRANSPILE == 'es5' would transpile ES6 files but\n// would leave ES3 and ES5 files alone.\ngoog.TRANSPILE = goog.define('goog.TRANSPILE', 'detect');\n\n/**\n * @define {boolean} If true assume that ES modules have already been\n * transpiled by the jscompiler (in the same way that transpile.js would\n * transpile them - to jscomp modules). Useful only for servers that wish to use\n * the debug loader and transpile server side. Thus this is only respected if\n * goog.TRANSPILE is \"never\".\n */\ngoog.ASSUME_ES_MODULES_TRANSPILED =\n    goog.define('goog.ASSUME_ES_MODULES_TRANSPILED', false);\n\n\n/**\n * @define {string} If a file needs to be transpiled what the output language\n * should be. By default this is the highest language level this file detects\n * the current environment supports. Generally this flag should not be set, but\n * it could be useful to override. Example: If the current environment supports\n * ES6 then by default ES7+ files will be transpiled to ES6, unless this is\n * overridden.\n *\n * Valid values include: es3, es5, es6, es7, and es8. Anything not recognized\n * is treated as es3.\n *\n * Note that setting this value does not force transpilation. Just if\n * transpilation occurs this will be the output. So this is most useful when\n * goog.TRANSPILE is set to 'always' and then forcing the language level to be\n * something lower than what the environment detects.\n */\ngoog.TRANSPILE_TO_LANGUAGE = goog.define('goog.TRANSPILE_TO_LANGUAGE', '');\n\n\n/**\n * @define {string} Path to the transpiler.  Executing the script at this\n * path (relative to base.js) should define a function $jscomp.transpile.\n */\ngoog.TRANSPILER = goog.define('goog.TRANSPILER', 'transpile.js');\n\n\n/**\n * @define {string} Trusted Types policy name. If non-empty then Closure will\n * use Trusted Types.\n */\ngoog.TRUSTED_TYPES_POLICY_NAME =\n    goog.define('goog.TRUSTED_TYPES_POLICY_NAME', 'goog');\n\n\n/**\n * @package {?boolean}\n * Visible for testing.\n */\ngoog.hasBadLetScoping = null;\n\n\n/**\n * @param {function(?):?|string} moduleDef The module definition.\n */\ngoog.loadModule = function(moduleDef) {\n  // NOTE: we allow function definitions to be either in the from\n  // of a string to eval (which keeps the original source intact) or\n  // in a eval forbidden environment (CSP) we allow a function definition\n  // which in its body must call `goog.module`, and return the exports\n  // of the module.\n  var previousState = goog.moduleLoaderState_;\n  try {\n    goog.moduleLoaderState_ = {\n      moduleName: '',\n      declareLegacyNamespace: false,\n      type: goog.ModuleType.GOOG\n    };\n    var origExports = {};\n    var exports = origExports;\n    if (typeof moduleDef === 'function') {\n      exports = moduleDef.call(undefined, exports);\n    } else if (typeof moduleDef === 'string') {\n      exports = goog.loadModuleFromSource_.call(undefined, exports, moduleDef);\n    } else {\n      throw new Error('Invalid module definition');\n    }\n\n    var moduleName = goog.moduleLoaderState_.moduleName;\n    if (typeof moduleName === 'string' && moduleName) {\n      // Don't seal legacy namespaces as they may be used as a parent of\n      // another namespace\n      if (goog.moduleLoaderState_.declareLegacyNamespace) {\n        // Whether exports was overwritten via default export assignment.\n        // This is important for legacy namespaces as it dictates whether\n        // previously a previously loaded implicit namespace should be clobbered\n        // or not.\n        var isDefaultExport = origExports !== exports;\n        goog.constructNamespace_(moduleName, exports, isDefaultExport);\n      } else if (\n          goog.SEAL_MODULE_EXPORTS && Object.seal &&\n          typeof exports == 'object' && exports != null) {\n        Object.seal(exports);\n      }\n\n      var data = {\n        exports: exports,\n        type: goog.ModuleType.GOOG,\n        moduleId: goog.moduleLoaderState_.moduleName\n      };\n      goog.loadedModules_[moduleName] = data;\n    } else {\n      throw new Error('Invalid module name \\\"' + moduleName + '\\\"');\n    }\n  } finally {\n    goog.moduleLoaderState_ = previousState;\n  }\n};\n\n\n/**\n * @private @const\n */\ngoog.loadModuleFromSource_ =\n    /** @type {function(!Object, string):?} */ (function(exports) {\n      // NOTE: we avoid declaring parameters or local variables here to avoid\n      // masking globals or leaking values into the module definition.\n      'use strict';\n      eval(goog.CLOSURE_EVAL_PREFILTER_.createScript(arguments[1]));\n      return exports;\n    });\n\n\n/**\n * Normalize a file path by removing redundant \"..\" and extraneous \".\" file\n * path components.\n * @param {string} path\n * @return {string}\n * @private\n */\ngoog.normalizePath_ = function(path) {\n  var components = path.split('/');\n  var i = 0;\n  while (i < components.length) {\n    if (components[i] == '.') {\n      components.splice(i, 1);\n    } else if (\n        i && components[i] == '..' && components[i - 1] &&\n        components[i - 1] != '..') {\n      components.splice(--i, 2);\n    } else {\n      i++;\n    }\n  }\n  return components.join('/');\n};\n\n\n/**\n * Provides a hook for loading a file when using Closure's goog.require() API\n * with goog.modules.  In particular this hook is provided to support Node.js.\n *\n * @type {(function(string):string)|undefined}\n */\ngoog.global.CLOSURE_LOAD_FILE_SYNC;\n\n\n/**\n * Loads file by synchronous XHR. Should not be used in production environments.\n * @param {string} src Source URL.\n * @return {?string} File contents, or null if load failed.\n * @private\n */\ngoog.loadFileSync_ = function(src) {\n  if (goog.global.CLOSURE_LOAD_FILE_SYNC) {\n    return goog.global.CLOSURE_LOAD_FILE_SYNC(src);\n  } else {\n    try {\n      /** @type {XMLHttpRequest} */\n      var xhr = new goog.global['XMLHttpRequest']();\n      xhr.open('get', src, false);\n      xhr.send();\n      // NOTE: Successful http: requests have a status of 200, but successful\n      // file: requests may have a status of zero.  Any other status, or a\n      // thrown exception (particularly in case of file: requests) indicates\n      // some sort of error, which we treat as a missing or unavailable file.\n      return xhr.status == 0 || xhr.status == 200 ? xhr.responseText : null;\n    } catch (err) {\n      // No need to rethrow or log, since errors should show up on their own.\n      return null;\n    }\n  }\n};\n\n\n/**\n * Lazily retrieves the transpiler and applies it to the source.\n * @param {string} code JS code.\n * @param {string} path Path to the code.\n * @param {string} target Language level output.\n * @return {string} The transpiled code.\n * @private\n */\ngoog.transpile_ = function(code, path, target) {\n  var jscomp = goog.global['$jscomp'];\n  if (!jscomp) {\n    goog.global['$jscomp'] = jscomp = {};\n  }\n  var transpile = jscomp.transpile;\n  if (!transpile) {\n    var transpilerPath = goog.basePath + goog.TRANSPILER;\n    var transpilerCode = goog.loadFileSync_(transpilerPath);\n    if (transpilerCode) {\n      // This must be executed synchronously, since by the time we know we\n      // need it, we're about to load and write the ES6 code synchronously,\n      // so a normal script-tag load will be too slow. Wrapped in a function\n      // so that code is eval'd in the global scope.\n      (function() {\n        (0, eval)(transpilerCode + '\\n//# sourceURL=' + transpilerPath);\n      }).call(goog.global);\n      // Even though the transpiler is optional, if $gwtExport is found, it's\n      // a sign the transpiler was loaded and the $jscomp.transpile *should*\n      // be there.\n      if (goog.global['$gwtExport'] && goog.global['$gwtExport']['$jscomp'] &&\n          !goog.global['$gwtExport']['$jscomp']['transpile']) {\n        throw new Error(\n            'The transpiler did not properly export the \"transpile\" ' +\n            'method. $gwtExport: ' + JSON.stringify(goog.global['$gwtExport']));\n      }\n      // transpile.js only exports a single $jscomp function, transpile. We\n      // grab just that and add it to the existing definition of $jscomp which\n      // contains the polyfills.\n      goog.global['$jscomp'].transpile =\n          goog.global['$gwtExport']['$jscomp']['transpile'];\n      jscomp = goog.global['$jscomp'];\n      transpile = jscomp.transpile;\n    }\n  }\n  if (!transpile) {\n    // The transpiler is an optional component.  If it's not available then\n    // replace it with a pass-through function that simply logs.\n    var suffix = ' requires transpilation but no transpiler was found.';\n    transpile = jscomp.transpile = function(code, path) {\n      // TODO(sdh): figure out some way to get this error to show up\n      // in test results, noting that the failure may occur in many\n      // different ways, including in loadModule() before the test\n      // runner even comes up.\n      goog.logToConsole_(path + suffix);\n      return code;\n    };\n  }\n  // Note: any transpilation errors/warnings will be logged to the console.\n  return transpile(code, path, target);\n};\n\n//==============================================================================\n// Language Enhancements\n//==============================================================================\n\n\n/**\n * This is a \"fixed\" version of the typeof operator.  It differs from the typeof\n * operator in such a way that null returns 'null' and arrays return 'array'.\n * @param {?} value The value to get the type of.\n * @return {string} The name of the type.\n */\ngoog.typeOf = function(value) {\n  var s = typeof value;\n\n  if (s != 'object') {\n    return s;\n  }\n\n  if (!value) {\n    return 'null';\n  }\n\n  if (Array.isArray(value)) {\n    return 'array';\n  }\n  return s;\n};\n\n\n/**\n * Returns true if the object looks like an array. To qualify as array like\n * the value needs to be either a NodeList or an object with a Number length\n * property. Note that for this function neither strings nor functions are\n * considered \"array-like\".\n *\n * @param {?} val Variable to test.\n * @return {boolean} Whether variable is an array.\n */\ngoog.isArrayLike = function(val) {\n  var type = goog.typeOf(val);\n  // We do not use goog.isObject here in order to exclude function values.\n  return type == 'array' || type == 'object' && typeof val.length == 'number';\n};\n\n\n/**\n * Returns true if the object looks like a Date. To qualify as Date-like the\n * value needs to be an object and have a getFullYear() function.\n * @param {?} val Variable to test.\n * @return {boolean} Whether variable is a like a Date.\n */\ngoog.isDateLike = function(val) {\n  return goog.isObject(val) && typeof val.getFullYear == 'function';\n};\n\n\n/**\n * Returns true if the specified value is an object.  This includes arrays and\n * functions.\n * @param {?} val Variable to test.\n * @return {boolean} Whether variable is an object.\n */\ngoog.isObject = function(val) {\n  var type = typeof val;\n  return type == 'object' && val != null || type == 'function';\n  // return Object(val) === val also works, but is slower, especially if val is\n  // not an object.\n};\n\n\n/**\n * Gets a unique ID for an object. This mutates the object so that further calls\n * with the same object as a parameter returns the same value. The unique ID is\n * guaranteed to be unique across the current session amongst objects that are\n * passed into `getUid`. There is no guarantee that the ID is unique or\n * consistent across sessions. It is unsafe to generate unique ID for function\n * prototypes.\n *\n * @param {Object} obj The object to get the unique ID for.\n * @return {number} The unique ID for the object.\n */\ngoog.getUid = function(obj) {\n  // TODO(arv): Make the type stricter, do not accept null.\n  return Object.prototype.hasOwnProperty.call(obj, goog.UID_PROPERTY_) &&\n      obj[goog.UID_PROPERTY_] ||\n      (obj[goog.UID_PROPERTY_] = ++goog.uidCounter_);\n};\n\n\n/**\n * Whether the given object is already assigned a unique ID.\n *\n * This does not modify the object.\n *\n * @param {!Object} obj The object to check.\n * @return {boolean} Whether there is an assigned unique id for the object.\n */\ngoog.hasUid = function(obj) {\n  return !!obj[goog.UID_PROPERTY_];\n};\n\n\n/**\n * Removes the unique ID from an object. This is useful if the object was\n * previously mutated using `goog.getUid` in which case the mutation is\n * undone.\n * @param {Object} obj The object to remove the unique ID field from.\n */\ngoog.removeUid = function(obj) {\n  // TODO(arv): Make the type stricter, do not accept null.\n\n  // In IE, DOM nodes are not instances of Object and throw an exception if we\n  // try to delete.  Instead we try to use removeAttribute.\n  if (obj !== null && 'removeAttribute' in obj) {\n    obj.removeAttribute(goog.UID_PROPERTY_);\n  }\n\n  try {\n    delete obj[goog.UID_PROPERTY_];\n  } catch (ex) {\n  }\n};\n\n\n/**\n * Name for unique ID property. Initialized in a way to help avoid collisions\n * with other closure JavaScript on the same page.\n * @type {string}\n * @private\n */\ngoog.UID_PROPERTY_ = 'closure_uid_' + ((Math.random() * 1e9) >>> 0);\n\n\n/**\n * Counter for UID.\n * @type {number}\n * @private\n */\ngoog.uidCounter_ = 0;\n\n\n/**\n * Clones a value. The input may be an Object, Array, or basic type. Objects and\n * arrays will be cloned recursively.\n *\n * WARNINGS:\n * <code>goog.cloneObject</code> does not detect reference loops. Objects that\n * refer to themselves will cause infinite recursion.\n *\n * <code>goog.cloneObject</code> is unaware of unique identifiers, and copies\n * UIDs created by <code>getUid</code> into cloned results.\n *\n * @param {*} obj The value to clone.\n * @return {*} A clone of the input value.\n * @deprecated goog.cloneObject is unsafe. Prefer the goog.object methods.\n */\ngoog.cloneObject = function(obj) {\n  var type = goog.typeOf(obj);\n  if (type == 'object' || type == 'array') {\n    if (typeof obj.clone === 'function') {\n      return obj.clone();\n    }\n    if (typeof Map !== 'undefined' && obj instanceof Map) {\n      return new Map(obj);\n    } else if (typeof Set !== 'undefined' && obj instanceof Set) {\n      return new Set(obj);\n    }\n    var clone = type == 'array' ? [] : {};\n    for (var key in obj) {\n      clone[key] = goog.cloneObject(obj[key]);\n    }\n    return clone;\n  }\n\n  return obj;\n};\n\n\n/**\n * A native implementation of goog.bind.\n * @param {?function(this:T, ...)} fn A function to partially apply.\n * @param {T} selfObj Specifies the object which this should point to when the\n *     function is run.\n * @param {...*} var_args Additional arguments that are partially applied to the\n *     function.\n * @return {!Function} A partially-applied form of the function goog.bind() was\n *     invoked as a method of.\n * @template T\n * @private\n */\ngoog.bindNative_ = function(fn, selfObj, var_args) {\n  return /** @type {!Function} */ (fn.call.apply(fn.bind, arguments));\n};\n\n\n/**\n * A pure-JS implementation of goog.bind.\n * @param {?function(this:T, ...)} fn A function to partially apply.\n * @param {T} selfObj Specifies the object which this should point to when the\n *     function is run.\n * @param {...*} var_args Additional arguments that are partially applied to the\n *     function.\n * @return {!Function} A partially-applied form of the function goog.bind() was\n *     invoked as a method of.\n * @template T\n * @private\n */\ngoog.bindJs_ = function(fn, selfObj, var_args) {\n  if (!fn) {\n    throw new Error();\n  }\n\n  if (arguments.length > 2) {\n    var boundArgs = Array.prototype.slice.call(arguments, 2);\n    return function() {\n      // Prepend the bound arguments to the current arguments.\n      var newArgs = Array.prototype.slice.call(arguments);\n      Array.prototype.unshift.apply(newArgs, boundArgs);\n      return fn.apply(selfObj, newArgs);\n    };\n\n  } else {\n    return function() {\n      return fn.apply(selfObj, arguments);\n    };\n  }\n};\n\n\n/**\n * Partially applies this function to a particular 'this object' and zero or\n * more arguments. The result is a new function with some arguments of the first\n * function pre-filled and the value of this 'pre-specified'.\n *\n * Remaining arguments specified at call-time are appended to the pre-specified\n * ones.\n *\n * Also see: {@link #partial}.\n *\n * Usage:\n * <pre>var barMethBound = goog.bind(myFunction, myObj, 'arg1', 'arg2');\n * barMethBound('arg3', 'arg4');</pre>\n *\n * @param {?function(this:T, ...)} fn A function to partially apply.\n * @param {T} selfObj Specifies the object which this should point to when the\n *     function is run.\n * @param {...*} var_args Additional arguments that are partially applied to the\n *     function.\n * @return {!Function} A partially-applied form of the function goog.bind() was\n *     invoked as a method of.\n * @template T\n * @suppress {deprecated} See above.\n * @deprecated use `=> {}` or Function.prototype.bind instead.\n */\ngoog.bind = function(fn, selfObj, var_args) {\n  // TODO(nicksantos): narrow the type signature.\n  if (Function.prototype.bind &&\n      // NOTE(nicksantos): Somebody pulled base.js into the default Chrome\n      // extension environment. This means that for Chrome extensions, they get\n      // the implementation of Function.prototype.bind that calls goog.bind\n      // instead of the native one. Even worse, we don't want to introduce a\n      // circular dependency between goog.bind and Function.prototype.bind, so\n      // we have to hack this to make sure it works correctly.\n      Function.prototype.bind.toString().indexOf('native code') != -1) {\n    goog.bind = goog.bindNative_;\n  } else {\n    goog.bind = goog.bindJs_;\n  }\n  return goog.bind.apply(null, arguments);\n};\n\n\n/**\n * Like goog.bind(), except that a 'this object' is not required. Useful when\n * the target function is already bound.\n *\n * Usage:\n * var g = goog.partial(f, arg1, arg2);\n * g(arg3, arg4);\n *\n * @param {Function} fn A function to partially apply.\n * @param {...*} var_args Additional arguments that are partially applied to fn.\n * @return {!Function} A partially-applied form of the function goog.partial()\n *     was invoked as a method of.\n */\ngoog.partial = function(fn, var_args) {\n  var args = Array.prototype.slice.call(arguments, 1);\n  return function() {\n    // Clone the array (with slice()) and append additional arguments\n    // to the existing arguments.\n    var newArgs = args.slice();\n    newArgs.push.apply(newArgs, arguments);\n    return fn.apply(/** @type {?} */ (this), newArgs);\n  };\n};\n\n\n/**\n * Copies all the members of a source object to a target object. This method\n * does not work on all browsers for all objects that contain keys such as\n * toString or hasOwnProperty. Use goog.object.extend for this purpose.\n *\n * NOTE: Some have advocated for the use of goog.mixin to setup classes\n * with multiple inheritence (traits, mixins, etc).  However, as it simply\n * uses \"for in\", this is not compatible with ES6 classes whose methods are\n * non-enumerable.  Changing this, would break cases where non-enumerable\n * properties are not expected.\n *\n * @param {Object} target Target.\n * @param {Object} source Source.\n * @deprecated Prefer Object.assign\n */\ngoog.mixin = function(target, source) {\n  for (var x in source) {\n    target[x] = source[x];\n  }\n\n  // For IE7 or lower, the for-in-loop does not contain any properties that are\n  // not enumerable on the prototype object (for example, isPrototypeOf from\n  // Object.prototype) but also it will not include 'replace' on objects that\n  // extend String and change 'replace' (not that it is common for anyone to\n  // extend anything except Object).\n};\n\n\n/**\n * @return {number} An integer value representing the number of milliseconds\n *     between midnight, January 1, 1970 and the current time.\n * @deprecated Use Date.now\n */\ngoog.now = function() {\n  return Date.now();\n};\n\n\n/**\n * Evals JavaScript in the global scope.\n *\n * Throws an exception if neither execScript or eval is defined.\n * @param {string|!TrustedScript} script JavaScript string.\n */\ngoog.globalEval = function(script) {\n  (0, eval)(script);\n};\n\n\n/**\n * Optional map of CSS class names to obfuscated names used with\n * goog.getCssName().\n * @private {!Object<string, string>|undefined}\n * @see goog.setCssNameMapping\n */\ngoog.cssNameMapping_;\n\n\n/**\n * Optional obfuscation style for CSS class names. Should be set to either\n * 'BY_WHOLE' or 'BY_PART' if defined.\n * @type {string|undefined}\n * @private\n * @see goog.setCssNameMapping\n */\ngoog.cssNameMappingStyle_;\n\n\n\n/**\n * A hook for modifying the default behavior goog.getCssName. The function\n * if present, will receive the standard output of the goog.getCssName as\n * its input.\n *\n * @type {(function(string):string)|undefined}\n */\ngoog.global.CLOSURE_CSS_NAME_MAP_FN;\n\n\n/**\n * Handles strings that are intended to be used as CSS class names.\n *\n * This function works in tandem with @see goog.setCssNameMapping.\n *\n * Without any mapping set, the arguments are simple joined with a hyphen and\n * passed through unaltered.\n *\n * When there is a mapping, there are two possible styles in which these\n * mappings are used. In the BY_PART style, each part (i.e. in between hyphens)\n * of the passed in css name is rewritten according to the map. In the BY_WHOLE\n * style, the full css name is looked up in the map directly. If a rewrite is\n * not specified by the map, the compiler will output a warning.\n *\n * When the mapping is passed to the compiler, it will replace calls to\n * goog.getCssName with the strings from the mapping, e.g.\n *     var x = goog.getCssName('foo');\n *     var y = goog.getCssName(this.baseClass, 'active');\n *  becomes:\n *     var x = 'foo';\n *     var y = this.baseClass + '-active';\n *\n * If one argument is passed it will be processed, if two are passed only the\n * modifier will be processed, as it is assumed the first argument was generated\n * as a result of calling goog.getCssName.\n *\n * @param {string} className The class name.\n * @param {string=} opt_modifier A modifier to be appended to the class name.\n * @return {string} The class name or the concatenation of the class name and\n *     the modifier.\n */\ngoog.getCssName = function(className, opt_modifier) {\n  // String() is used for compatibility with compiled soy where the passed\n  // className can be non-string objects.\n  if (String(className).charAt(0) == '.') {\n    throw new Error(\n        'className passed in goog.getCssName must not start with \".\".' +\n        ' You passed: ' + className);\n  }\n\n  var getMapping = function(cssName) {\n    return goog.cssNameMapping_[cssName] || cssName;\n  };\n\n  var renameByParts = function(cssName) {\n    // Remap all the parts individually.\n    var parts = cssName.split('-');\n    var mapped = [];\n    for (var i = 0; i < parts.length; i++) {\n      mapped.push(getMapping(parts[i]));\n    }\n    return mapped.join('-');\n  };\n\n  var rename;\n  if (goog.cssNameMapping_) {\n    rename =\n        goog.cssNameMappingStyle_ == 'BY_WHOLE' ? getMapping : renameByParts;\n  } else {\n    rename = function(a) {\n      return a;\n    };\n  }\n\n  var result =\n      opt_modifier ? className + '-' + rename(opt_modifier) : rename(className);\n\n  // The special CLOSURE_CSS_NAME_MAP_FN allows users to specify further\n  // processing of the class name.\n  if (goog.global.CLOSURE_CSS_NAME_MAP_FN) {\n    return goog.global.CLOSURE_CSS_NAME_MAP_FN(result);\n  }\n\n  return result;\n};\n\n\n/**\n * Sets the map to check when returning a value from goog.getCssName(). Example:\n * <pre>\n * goog.setCssNameMapping({\n *   \"goog\": \"a\",\n *   \"disabled\": \"b\",\n * });\n *\n * var x = goog.getCssName('goog');\n * // The following evaluates to: \"a a-b\".\n * goog.getCssName('goog') + ' ' + goog.getCssName(x, 'disabled')\n * </pre>\n * When declared as a map of string literals to string literals, the JSCompiler\n * will replace all calls to goog.getCssName() using the supplied map if the\n * --process_closure_primitives flag is set.\n *\n * @param {!Object} mapping A map of strings to strings where keys are possible\n *     arguments to goog.getCssName() and values are the corresponding values\n *     that should be returned.\n * @param {string=} opt_style The style of css name mapping. There are two valid\n *     options: 'BY_PART', and 'BY_WHOLE'.\n * @see goog.getCssName for a description.\n */\ngoog.setCssNameMapping = function(mapping, opt_style) {\n  goog.cssNameMapping_ = mapping;\n  goog.cssNameMappingStyle_ = opt_style;\n};\n\n\n/**\n * To use CSS renaming in compiled mode, one of the input files should have a\n * call to goog.setCssNameMapping() with an object literal that the JSCompiler\n * can extract and use to replace all calls to goog.getCssName(). In uncompiled\n * mode, JavaScript code should be loaded before this base.js file that declares\n * a global variable, CLOSURE_CSS_NAME_MAPPING, which is used below. This is\n * to ensure that the mapping is loaded before any calls to goog.getCssName()\n * are made in uncompiled mode.\n *\n * A hook for overriding the CSS name mapping.\n * @type {!Object<string, string>|undefined}\n */\ngoog.global.CLOSURE_CSS_NAME_MAPPING;\n\n\nif (!COMPILED && goog.global.CLOSURE_CSS_NAME_MAPPING) {\n  // This does not call goog.setCssNameMapping() because the JSCompiler\n  // requires that goog.setCssNameMapping() be called with an object literal.\n  goog.cssNameMapping_ = goog.global.CLOSURE_CSS_NAME_MAPPING;\n}\n\n\n/**\n * Gets a localized message.\n *\n * This function is a compiler primitive. If you give the compiler a localized\n * message bundle, it will replace the string at compile-time with a localized\n * version, and expand goog.getMsg call to a concatenated string.\n *\n * Messages must be initialized in the form:\n * <code>\n * var MSG_NAME = goog.getMsg('Hello {$placeholder}', {'placeholder': 'world'});\n * </code>\n *\n * This function produces a string which should be treated as plain text. Use\n * {@link goog.html.SafeHtmlFormatter} in conjunction with goog.getMsg to\n * produce SafeHtml.\n *\n * @param {string} str Translatable string, places holders in the form {$foo}.\n * @param {Object<string, string>=} opt_values Maps place holder name to value.\n * @param {{html: (boolean|undefined),\n *         unescapeHtmlEntities: (boolean|undefined)}=} opt_options Options:\n *     html: Escape '<' in str to '&lt;'. Used by Closure Templates where the\n *     generated code size and performance is critical which is why {@link\n *     goog.html.SafeHtmlFormatter} is not used. The value must be literal true\n *     or false.\n *     unescapeHtmlEntities: Unescape common html entities: &gt;, &lt;, &apos;,\n *     &quot; and &amp;. Used for messages not in HTML context, such as with\n *     `textContent` property.\n * @return {string} message with placeholders filled.\n */\ngoog.getMsg = function(str, opt_values, opt_options) {\n  if (opt_options && opt_options.html) {\n    // Note that '&' is not replaced because the translation can contain HTML\n    // entities.\n    str = str.replace(/</g, '&lt;');\n  }\n  if (opt_options && opt_options.unescapeHtmlEntities) {\n    // Note that \"&amp;\" must be the last to avoid \"creating\" new entities.\n    str = str.replace(/&lt;/g, '<')\n              .replace(/&gt;/g, '>')\n              .replace(/&apos;/g, '\\'')\n              .replace(/&quot;/g, '\"')\n              .replace(/&amp;/g, '&');\n  }\n  if (opt_values) {\n    str = str.replace(/\\{\\$([^}]+)}/g, function(match, key) {\n      return (opt_values != null && key in opt_values) ? opt_values[key] :\n                                                         match;\n    });\n  }\n  return str;\n};\n\n\n/**\n * Gets a localized message. If the message does not have a translation, gives a\n * fallback message.\n *\n * This is useful when introducing a new message that has not yet been\n * translated into all languages.\n *\n * This function is a compiler primitive. Must be used in the form:\n * <code>var x = goog.getMsgWithFallback(MSG_A, MSG_B);</code>\n * where MSG_A and MSG_B were initialized with goog.getMsg.\n *\n * @param {string} a The preferred message.\n * @param {string} b The fallback message.\n * @return {string} The best translated message.\n */\ngoog.getMsgWithFallback = function(a, b) {\n  return a;\n};\n\n\n/**\n * Exposes an unobfuscated global namespace path for the given object.\n * Note that fields of the exported object *will* be obfuscated, unless they are\n * exported in turn via this function or goog.exportProperty.\n *\n * Also handy for making public items that are defined in anonymous closures.\n *\n * ex. goog.exportSymbol('public.path.Foo', Foo);\n *\n * ex. goog.exportSymbol('public.path.Foo.staticFunction', Foo.staticFunction);\n *     public.path.Foo.staticFunction();\n *\n * ex. goog.exportSymbol('public.path.Foo.prototype.myMethod',\n *                       Foo.prototype.myMethod);\n *     new public.path.Foo().myMethod();\n *\n * @param {string} publicPath Unobfuscated name to export.\n * @param {*} object Object the name should point to.\n * @param {?Object=} objectToExportTo The object to add the path to; default\n *     is goog.global.\n */\ngoog.exportSymbol = function(publicPath, object, objectToExportTo) {\n  goog.exportPath_(\n      publicPath, object, /* overwriteImplicit= */ true, objectToExportTo);\n};\n\n\n/**\n * Exports a property unobfuscated into the object's namespace.\n * ex. goog.exportProperty(Foo, 'staticFunction', Foo.staticFunction);\n * ex. goog.exportProperty(Foo.prototype, 'myMethod', Foo.prototype.myMethod);\n * @param {Object} object Object whose static property is being exported.\n * @param {string} publicName Unobfuscated name to export.\n * @param {*} symbol Object the name should point to.\n */\ngoog.exportProperty = function(object, publicName, symbol) {\n  object[publicName] = symbol;\n};\n\n\n/**\n * Inherit the prototype methods from one constructor into another.\n *\n * Usage:\n * <pre>\n * function ParentClass(a, b) { }\n * ParentClass.prototype.foo = function(a) { };\n *\n * function ChildClass(a, b, c) {\n *   ChildClass.base(this, 'constructor', a, b);\n * }\n * goog.inherits(ChildClass, ParentClass);\n *\n * var child = new ChildClass('a', 'b', 'see');\n * child.foo(); // This works.\n * </pre>\n *\n * @param {!Function} childCtor Child class.\n * @param {!Function} parentCtor Parent class.\n * @suppress {strictMissingProperties} superClass_ and base is not defined on\n *    Function.\n * @deprecated Use ECMAScript class syntax instead.\n */\ngoog.inherits = function(childCtor, parentCtor) {\n  /** @constructor */\n  function tempCtor() {}\n  tempCtor.prototype = parentCtor.prototype;\n  childCtor.superClass_ = parentCtor.prototype;\n  childCtor.prototype = new tempCtor();\n  /** @override */\n  childCtor.prototype.constructor = childCtor;\n\n  /**\n   * Calls superclass constructor/method.\n   *\n   * This function is only available if you use goog.inherits to\n   * express inheritance relationships between classes.\n   *\n   * NOTE: This is a replacement for goog.base and for superClass_\n   * property defined in childCtor.\n   *\n   * @param {!Object} me Should always be \"this\".\n   * @param {string} methodName The method name to call. Calling\n   *     superclass constructor can be done with the special string\n   *     'constructor'.\n   * @param {...*} var_args The arguments to pass to superclass\n   *     method/constructor.\n   * @return {*} The return value of the superclass method/constructor.\n   */\n  childCtor.base = function(me, methodName, var_args) {\n    // Copying using loop to avoid deop due to passing arguments object to\n    // function. This is faster in many JS engines as of late 2014.\n    var args = new Array(arguments.length - 2);\n    for (var i = 2; i < arguments.length; i++) {\n      args[i - 2] = arguments[i];\n    }\n    return parentCtor.prototype[methodName].apply(me, args);\n  };\n};\n\n\n/**\n * Allow for aliasing within scope functions.  This function exists for\n * uncompiled code - in compiled code the calls will be inlined and the aliases\n * applied.  In uncompiled code the function is simply run since the aliases as\n * written are valid JavaScript.\n *\n *\n * @param {function()} fn Function to call.  This function can contain aliases\n *     to namespaces (e.g. \"var dom = goog.dom\") or classes\n *     (e.g. \"var Timer = goog.Timer\").\n * @deprecated Use goog.module instead.\n */\ngoog.scope = function(fn) {\n  if (goog.isInModuleLoader_()) {\n    throw new Error('goog.scope is not supported within a module.');\n  }\n  fn.call(goog.global);\n};\n\n\n/*\n * To support uncompiled, strict mode bundles that use eval to divide source\n * like so:\n *    eval('someSource;//# sourceUrl sourcefile.js');\n * We need to export the globally defined symbols \"goog\" and \"COMPILED\".\n * Exporting \"goog\" breaks the compiler optimizations, so we required that\n * be defined externally.\n * NOTE: We don't use goog.exportSymbol here because we don't want to trigger\n * extern generation when that compiler option is enabled.\n */\nif (!COMPILED) {\n  goog.global['COMPILED'] = COMPILED;\n}\n\n\n//==============================================================================\n// goog.defineClass implementation\n//==============================================================================\n\n\n/**\n * Creates a restricted form of a Closure \"class\":\n *   - from the compiler's perspective, the instance returned from the\n *     constructor is sealed (no new properties may be added).  This enables\n *     better checks.\n *   - the compiler will rewrite this definition to a form that is optimal\n *     for type checking and optimization (initially this will be a more\n *     traditional form).\n *\n * @param {Function} superClass The superclass, Object or null.\n * @param {goog.defineClass.ClassDescriptor} def\n *     An object literal describing\n *     the class.  It may have the following properties:\n *     \"constructor\": the constructor function\n *     \"statics\": an object literal containing methods to add to the constructor\n *        as \"static\" methods or a function that will receive the constructor\n *        function as its only parameter to which static properties can\n *        be added.\n *     all other properties are added to the prototype.\n * @return {!Function} The class constructor.\n * @deprecated Use ECMAScript class syntax instead.\n */\ngoog.defineClass = function(superClass, def) {\n  // TODO(johnlenz): consider making the superClass an optional parameter.\n  var constructor = def.constructor;\n  var statics = def.statics;\n  // Wrap the constructor prior to setting up the prototype and static methods.\n  if (!constructor || constructor == Object.prototype.constructor) {\n    constructor = function() {\n      throw new Error(\n          'cannot instantiate an interface (no constructor defined).');\n    };\n  }\n\n  var cls = goog.defineClass.createSealingConstructor_(constructor, superClass);\n  if (superClass) {\n    goog.inherits(cls, superClass);\n  }\n\n  // Remove all the properties that should not be copied to the prototype.\n  delete def.constructor;\n  delete def.statics;\n\n  goog.defineClass.applyProperties_(cls.prototype, def);\n  if (statics != null) {\n    if (statics instanceof Function) {\n      statics(cls);\n    } else {\n      goog.defineClass.applyProperties_(cls, statics);\n    }\n  }\n\n  return cls;\n};\n\n\n/**\n * @typedef {{\n *   constructor: (!Function|undefined),\n *   statics: (Object|undefined|function(Function):void)\n * }}\n */\ngoog.defineClass.ClassDescriptor;\n\n\n/**\n * @define {boolean} Whether the instances returned by goog.defineClass should\n *     be sealed when possible.\n *\n * When sealing is disabled the constructor function will not be wrapped by\n * goog.defineClass, making it incompatible with ES6 class methods.\n */\ngoog.defineClass.SEAL_CLASS_INSTANCES =\n    goog.define('goog.defineClass.SEAL_CLASS_INSTANCES', goog.DEBUG);\n\n\n/**\n * If goog.defineClass.SEAL_CLASS_INSTANCES is enabled and Object.seal is\n * defined, this function will wrap the constructor in a function that seals the\n * results of the provided constructor function.\n *\n * @param {!Function} ctr The constructor whose results maybe be sealed.\n * @param {Function} superClass The superclass constructor.\n * @return {!Function} The replacement constructor.\n * @private\n */\ngoog.defineClass.createSealingConstructor_ = function(ctr, superClass) {\n  if (!goog.defineClass.SEAL_CLASS_INSTANCES) {\n    // Do now wrap the constructor when sealing is disabled. Angular code\n    // depends on this for injection to work properly.\n    return ctr;\n  }\n\n  // NOTE: The sealing behavior has been removed\n\n  /**\n   * @this {Object}\n   * @return {?}\n   */\n  var wrappedCtr = function() {\n    // Don't seal an instance of a subclass when it calls the constructor of\n    // its super class as there is most likely still setup to do.\n    var instance = ctr.apply(this, arguments) || this;\n    instance[goog.UID_PROPERTY_] = instance[goog.UID_PROPERTY_];\n\n    return instance;\n  };\n\n  return wrappedCtr;\n};\n\n\n\n// TODO(johnlenz): share these values with the goog.object\n/**\n * The names of the fields that are defined on Object.prototype.\n * @type {!Array<string>}\n * @private\n * @const\n */\ngoog.defineClass.OBJECT_PROTOTYPE_FIELDS_ = [\n  'constructor', 'hasOwnProperty', 'isPrototypeOf', 'propertyIsEnumerable',\n  'toLocaleString', 'toString', 'valueOf'\n];\n\n\n// TODO(johnlenz): share this function with the goog.object\n/**\n * @param {!Object} target The object to add properties to.\n * @param {!Object} source The object to copy properties from.\n * @private\n */\ngoog.defineClass.applyProperties_ = function(target, source) {\n  // TODO(johnlenz): update this to support ES5 getters/setters\n\n  var key;\n  for (key in source) {\n    if (Object.prototype.hasOwnProperty.call(source, key)) {\n      target[key] = source[key];\n    }\n  }\n\n  // For IE the for-in-loop does not contain any properties that are not\n  // enumerable on the prototype object (for example isPrototypeOf from\n  // Object.prototype) and it will also not include 'replace' on objects that\n  // extend String and change 'replace' (not that it is common for anyone to\n  // extend anything except Object).\n  for (var i = 0; i < goog.defineClass.OBJECT_PROTOTYPE_FIELDS_.length; i++) {\n    key = goog.defineClass.OBJECT_PROTOTYPE_FIELDS_[i];\n    if (Object.prototype.hasOwnProperty.call(source, key)) {\n      target[key] = source[key];\n    }\n  }\n};\n\n/**\n * Returns the parameter.\n * @param {string} s\n * @return {string}\n * @private\n */\ngoog.identity_ = function(s) {\n  return s;\n};\n\n\n/**\n * Creates Trusted Types policy if Trusted Types are supported by the browser.\n * The policy just blesses any string as a Trusted Type. It is not visibility\n * restricted because anyone can also call trustedTypes.createPolicy directly.\n * However, the allowed names should be restricted by a HTTP header and the\n * reference to the created policy should be visibility restricted.\n * @param {string} name\n * @return {?TrustedTypePolicy}\n */\ngoog.createTrustedTypesPolicy = function(name) {\n  var policy = null;\n  var policyFactory = goog.global.trustedTypes;\n  if (!policyFactory || !policyFactory.createPolicy) {\n    return policy;\n  }\n  // trustedTypes.createPolicy throws if called with a name that is already\n  // registered, even in report-only mode. Until the API changes, catch the\n  // error not to break the applications functionally. In such case, the code\n  // will fall back to using regular Safe Types.\n  // TODO(koto): Remove catching once createPolicy API stops throwing.\n  try {\n    policy = policyFactory.createPolicy(name, {\n      createHTML: goog.identity_,\n      createScript: goog.identity_,\n      createScriptURL: goog.identity_\n    });\n  } catch (e) {\n    goog.logToConsole_(e.message);\n  }\n  return policy;\n};\n\n// There's a bug in the compiler where without collapse properties the\n// Closure namespace defines do not guard code correctly. To help reduce code\n// size also check for !COMPILED even though it redundant until this is fixed.\nif (!COMPILED && goog.DEPENDENCIES_ENABLED) {\n\n\n  /**\n   * Tries to detect whether the current browser is Edge, based on the user\n   * agent. This matches only pre-Chromium Edge.\n   * @see https://docs.microsoft.com/en-us/microsoft-edge/web-platform/user-agent-string\n   * @return {boolean} True if the current browser is Edge.\n   * @private\n   */\n  goog.isEdge_ = function() {\n    var userAgent = goog.global.navigator && goog.global.navigator.userAgent ?\n        goog.global.navigator.userAgent :\n        '';\n    var edgeRe = /Edge\\/(\\d+)(\\.\\d)*/i;\n    return !!userAgent.match(edgeRe);\n  };\n\n\n  /**\n   * Tries to detect whether is in the context of an HTML document.\n   * @return {boolean} True if it looks like HTML document.\n   * @private\n   */\n  goog.inHtmlDocument_ = function() {\n    /** @type {!Document} */\n    var doc = goog.global.document;\n    return doc != null && 'write' in doc;  // XULDocument misses write.\n  };\n\n\n  /**\n   * We'd like to check for if the document readyState is 'loading'; however\n   * there are bugs on IE 10 and below where the readyState being anything other\n   * than 'complete' is not reliable.\n   * @return {boolean}\n   * @private\n   */\n  goog.isDocumentLoading_ = function() {\n    // attachEvent is available on IE 6 thru 10 only, and thus can be used to\n    // detect those browsers.\n    /** @type {!HTMLDocument} */\n    var doc = goog.global.document;\n    return doc.attachEvent ? doc.readyState != 'complete' :\n                             doc.readyState == 'loading';\n  };\n\n\n  /**\n   * Tries to detect the base path of base.js script that bootstraps Closure.\n   * @private\n   */\n  goog.findBasePath_ = function() {\n    if (goog.global.CLOSURE_BASE_PATH != undefined &&\n        // Anti DOM-clobbering runtime check (b/37736576).\n        typeof goog.global.CLOSURE_BASE_PATH === 'string') {\n      goog.basePath = goog.global.CLOSURE_BASE_PATH;\n      return;\n    } else if (!goog.inHtmlDocument_()) {\n      return;\n    }\n    /** @type {!Document} */\n    var doc = goog.global.document;\n    // If we have a currentScript available, use it exclusively.\n    var currentScript = doc.currentScript;\n    if (currentScript) {\n      var scripts = [currentScript];\n    } else {\n      var scripts = doc.getElementsByTagName('SCRIPT');\n    }\n    // Search backwards since the current script is in almost all cases the one\n    // that has base.js.\n    for (var i = scripts.length - 1; i >= 0; --i) {\n      var script = /** @type {!HTMLScriptElement} */ (scripts[i]);\n      var src = script.src;\n      var qmark = src.lastIndexOf('?');\n      var l = qmark == -1 ? src.length : qmark;\n      if (src.substr(l - 7, 7) == 'base.js') {\n        goog.basePath = src.substr(0, l - 7);\n        return;\n      }\n    }\n  };\n\n  goog.findBasePath_();\n\n  /** @struct @constructor @final */\n  goog.Transpiler = function() {\n    /** @private {?Object<string, boolean>} */\n    this.requiresTranspilation_ = null;\n    /** @private {string} */\n    this.transpilationTarget_ = goog.TRANSPILE_TO_LANGUAGE;\n  };\n  /**\n   * Returns a newly created map from language mode string to a boolean\n   * indicating whether transpilation should be done for that mode as well as\n   * the highest level language that this environment supports.\n   *\n   * Guaranteed invariant:\n   * For any two modes, l1 and l2 where l2 is a newer mode than l1,\n   * `map[l1] == true` implies that `map[l2] == true`.\n   *\n   * Note this method is extracted and used elsewhere, so it cannot rely on\n   * anything external (it should easily be able to be transformed into a\n   * standalone, top level function).\n   *\n   * @private\n   * @return {{\n   *   target: string,\n   *   map: !Object<string, boolean>\n   * }}\n   */\n  goog.Transpiler.prototype.createRequiresTranspilation_ = function() {\n    var transpilationTarget = 'es3';\n    var /** !Object<string, boolean> */ requiresTranspilation = {'es3': false};\n    var transpilationRequiredForAllLaterModes = false;\n\n    /**\n     * Adds an entry to requiresTranspliation for the given language mode.\n     *\n     * IMPORTANT: Calls must be made in order from oldest to newest language\n     * mode.\n     * @param {string} modeName\n     * @param {function(): boolean} isSupported Returns true if the JS engine\n     *     supports the given mode.\n     */\n    function addNewerLanguageTranspilationCheck(modeName, isSupported) {\n      if (transpilationRequiredForAllLaterModes) {\n        requiresTranspilation[modeName] = true;\n      } else if (isSupported()) {\n        transpilationTarget = modeName;\n        requiresTranspilation[modeName] = false;\n      } else {\n        requiresTranspilation[modeName] = true;\n        transpilationRequiredForAllLaterModes = true;\n      }\n    }\n\n    /**\n     * Does the given code evaluate without syntax errors and return a truthy\n     * result?\n     */\n    function /** boolean */ evalCheck(/** string */ code) {\n      try {\n        return !!eval(goog.CLOSURE_EVAL_PREFILTER_.createScript(code));\n      } catch (ignored) {\n        return false;\n      }\n    }\n\n    // Identify ES3-only browsers by their incorrect treatment of commas.\n    addNewerLanguageTranspilationCheck('es5', function() {\n      return evalCheck('[1,].length==1');\n    });\n    addNewerLanguageTranspilationCheck('es6', function() {\n      // Edge has a non-deterministic (i.e., not reproducible) bug with ES6:\n      // https://github.com/Microsoft/ChakraCore/issues/1496.\n      if (goog.isEdge_()) {\n        // The Reflect.construct test below is flaky on Edge. It can sometimes\n        // pass or fail on 40 15.15063, so just exit early for Edge and treat\n        // it as ES5. Until we're on a more up to date version just always use\n        // ES5. See https://github.com/Microsoft/ChakraCore/issues/3217.\n        return false;\n      }\n      // Test es6: [FF50 (?), Edge 14 (?), Chrome 50]\n      //   (a) default params (specifically shadowing locals),\n      //   (b) destructuring, (c) block-scoped functions,\n      //   (d) for-of (const), (e) new.target/Reflect.construct\n      var es6fullTest =\n          'class X{constructor(){if(new.target!=String)throw 1;this.x=42}}' +\n          'let q=Reflect.construct(X,[],String);if(q.x!=42||!(q instanceof ' +\n          'String))throw 1;for(const a of[2,3]){if(a==2)continue;function ' +\n          'f(z={a}){let a=0;return z.a}{function f(){return 0;}}return f()' +\n          '==3}';\n\n      return evalCheck('(()=>{\"use strict\";' + es6fullTest + '})()');\n    });\n    // ** and **= are the only new features in 'es7'\n    addNewerLanguageTranspilationCheck('es7', function() {\n      return evalCheck('2**3==8');\n    });\n    // async functions are the only new features in 'es8'\n    addNewerLanguageTranspilationCheck('es8', function() {\n      return evalCheck('async()=>1,1');\n    });\n    addNewerLanguageTranspilationCheck('es9', function() {\n      return evalCheck('({...rest}={}),1');\n    });\n    // optional catch binding, unescaped unicode paragraph separator in strings\n    addNewerLanguageTranspilationCheck('es_2019', function() {\n      return evalCheck('let r;try{r=\"\\u2029\"}catch{};r');\n    });\n    // optional chaining, nullish coalescing\n    // untested/unsupported: bigint, import meta\n    addNewerLanguageTranspilationCheck('es_2020', function() {\n      return evalCheck('null?.x??1');\n    });\n    addNewerLanguageTranspilationCheck('es_next', function() {\n      return false;  // assume it always need to transpile\n    });\n    return {target: transpilationTarget, map: requiresTranspilation};\n  };\n\n\n  /**\n   * Determines whether the given language needs to be transpiled.\n   * @param {string} lang\n   * @param {string|undefined} module\n   * @return {boolean}\n   */\n  goog.Transpiler.prototype.needsTranspile = function(lang, module) {\n    if (goog.TRANSPILE == 'always') {\n      return true;\n    } else if (goog.TRANSPILE == 'never') {\n      return false;\n    } else if (!this.requiresTranspilation_) {\n      var obj = this.createRequiresTranspilation_();\n      this.requiresTranspilation_ = obj.map;\n      this.transpilationTarget_ = this.transpilationTarget_ || obj.target;\n    }\n    if (lang in this.requiresTranspilation_) {\n      if (this.requiresTranspilation_[lang]) {\n        return true;\n      } else if (\n          goog.inHtmlDocument_() && module == 'es6' &&\n          !('noModule' in goog.global.document.createElement('script'))) {\n        return true;\n      } else {\n        return false;\n      }\n    } else {\n      throw new Error('Unknown language mode: ' + lang);\n    }\n  };\n\n\n  /**\n   * Lazily retrieves the transpiler and applies it to the source.\n   * @param {string} code JS code.\n   * @param {string} path Path to the code.\n   * @return {string} The transpiled code.\n   */\n  goog.Transpiler.prototype.transpile = function(code, path) {\n    // TODO(johnplaisted): We should delete goog.transpile_ and just have this\n    // function. But there's some compile error atm where goog.global is being\n    // stripped incorrectly without this.\n    return goog.transpile_(code, path, this.transpilationTarget_);\n  };\n\n\n  /** @private @final {!goog.Transpiler} */\n  goog.transpiler_ = new goog.Transpiler();\n\n  /**\n   * Rewrites closing script tags in input to avoid ending an enclosing script\n   * tag.\n   *\n   * @param {string} str\n   * @return {string}\n   * @private\n   */\n  goog.protectScriptTag_ = function(str) {\n    return str.replace(/<\\/(SCRIPT)/ig, '\\\\x3c/$1');\n  };\n\n\n  /**\n   * A debug loader is responsible for downloading and executing javascript\n   * files in an unbundled, uncompiled environment.\n   *\n   * This can be custimized via the setDependencyFactory method, or by\n   * CLOSURE_IMPORT_SCRIPT/CLOSURE_LOAD_FILE_SYNC.\n   *\n   * @struct @constructor @final @private\n   */\n  goog.DebugLoader_ = function() {\n    /** @private @const {!Object<string, !goog.Dependency>} */\n    this.dependencies_ = {};\n    /** @private @const {!Object<string, string>} */\n    this.idToPath_ = {};\n    /** @private @const {!Object<string, boolean>} */\n    this.written_ = {};\n    /** @private @const {!Array<!goog.Dependency>} */\n    this.loadingDeps_ = [];\n    /** @private {!Array<!goog.Dependency>} */\n    this.depsToLoad_ = [];\n    /** @private {boolean} */\n    this.paused_ = false;\n    /** @private {!goog.DependencyFactory} */\n    this.factory_ = new goog.DependencyFactory(goog.transpiler_);\n    /** @private @const {!Object<string, !Function>} */\n    this.deferredCallbacks_ = {};\n    /** @private @const {!Array<string>} */\n    this.deferredQueue_ = [];\n  };\n\n  /**\n   * @param {!Array<string>} namespaces\n   * @param {function(): undefined} callback Function to call once all the\n   *     namespaces have loaded.\n   */\n  goog.DebugLoader_.prototype.bootstrap = function(namespaces, callback) {\n    var cb = callback;\n    function resolve() {\n      if (cb) {\n        goog.global.setTimeout(cb, 0);\n        cb = null;\n      }\n    }\n\n    if (!namespaces.length) {\n      resolve();\n      return;\n    }\n\n    var deps = [];\n    for (var i = 0; i < namespaces.length; i++) {\n      var path = this.getPathFromDeps_(namespaces[i]);\n      if (!path) {\n        throw new Error('Unregonized namespace: ' + namespaces[i]);\n      }\n      deps.push(this.dependencies_[path]);\n    }\n\n    var require = goog.require;\n    var loaded = 0;\n    for (var i = 0; i < namespaces.length; i++) {\n      require(namespaces[i]);\n      deps[i].onLoad(function() {\n        if (++loaded == namespaces.length) {\n          resolve();\n        }\n      });\n    }\n  };\n\n\n  /**\n   * Loads the Closure Dependency file.\n   *\n   * Exposed a public function so CLOSURE_NO_DEPS can be set to false, base\n   * loaded, setDependencyFactory called, and then this called. i.e. allows\n   * custom loading of the deps file.\n   */\n  goog.DebugLoader_.prototype.loadClosureDeps = function() {\n    // Circumvent addDependency, which would try to transpile deps.js if\n    // transpile is set to always.\n    var relPath = 'deps.js';\n    this.depsToLoad_.push(this.factory_.createDependency(\n        goog.normalizePath_(goog.basePath + relPath), relPath, [], [], {},\n        false));\n    this.loadDeps_();\n  };\n\n\n  /**\n   * Notifies the debug loader when a dependency has been requested.\n   *\n   * @param {string} absPathOrId Path of the dependency or goog id.\n   * @param {boolean=} opt_force\n   */\n  goog.DebugLoader_.prototype.requested = function(absPathOrId, opt_force) {\n    var path = this.getPathFromDeps_(absPathOrId);\n    if (path &&\n        (opt_force || this.areDepsLoaded_(this.dependencies_[path].requires))) {\n      var callback = this.deferredCallbacks_[path];\n      if (callback) {\n        delete this.deferredCallbacks_[path];\n        callback();\n      }\n    }\n  };\n\n\n  /**\n   * Sets the dependency factory, which can be used to create custom\n   * goog.Dependency implementations to control how dependencies are loaded.\n   *\n   * @param {!goog.DependencyFactory} factory\n   */\n  goog.DebugLoader_.prototype.setDependencyFactory = function(factory) {\n    this.factory_ = factory;\n  };\n\n\n  /**\n   * Travserses the dependency graph and queues the given dependency, and all of\n   * its transitive dependencies, for loading and then starts loading if not\n   * paused.\n   *\n   * @param {string} namespace\n   * @private\n   */\n  goog.DebugLoader_.prototype.load_ = function(namespace) {\n    if (!this.getPathFromDeps_(namespace)) {\n      var errorMessage = 'goog.require could not find: ' + namespace;\n      goog.logToConsole_(errorMessage);\n    } else {\n      var loader = this;\n\n      var deps = [];\n\n      /** @param {string} namespace */\n      var visit = function(namespace) {\n        var path = loader.getPathFromDeps_(namespace);\n\n        if (!path) {\n          throw new Error('Bad dependency path or symbol: ' + namespace);\n        }\n\n        if (loader.written_[path]) {\n          return;\n        }\n\n        loader.written_[path] = true;\n\n        var dep = loader.dependencies_[path];\n        for (var i = 0; i < dep.requires.length; i++) {\n          if (!goog.isProvided_(dep.requires[i])) {\n            visit(dep.requires[i]);\n          }\n        }\n\n        deps.push(dep);\n      };\n\n      visit(namespace);\n\n      var wasLoading = !!this.depsToLoad_.length;\n      this.depsToLoad_ = this.depsToLoad_.concat(deps);\n\n      if (!this.paused_ && !wasLoading) {\n        this.loadDeps_();\n      }\n    }\n  };\n\n\n  /**\n   * Loads any queued dependencies until they are all loaded or paused.\n   *\n   * @private\n   */\n  goog.DebugLoader_.prototype.loadDeps_ = function() {\n    var loader = this;\n    var paused = this.paused_;\n\n    while (this.depsToLoad_.length && !paused) {\n      (function() {\n        var loadCallDone = false;\n        var dep = loader.depsToLoad_.shift();\n\n        var loaded = false;\n        loader.loading_(dep);\n\n        var controller = {\n          pause: function() {\n            if (loadCallDone) {\n              throw new Error('Cannot call pause after the call to load.');\n            } else {\n              paused = true;\n            }\n          },\n          resume: function() {\n            if (loadCallDone) {\n              loader.resume_();\n            } else {\n              // Some dep called pause and then resume in the same load call.\n              // Just keep running this same loop.\n              paused = false;\n            }\n          },\n          loaded: function() {\n            if (loaded) {\n              throw new Error('Double call to loaded.');\n            }\n\n            loaded = true;\n            loader.loaded_(dep);\n          },\n          pending: function() {\n            // Defensive copy.\n            var pending = [];\n            for (var i = 0; i < loader.loadingDeps_.length; i++) {\n              pending.push(loader.loadingDeps_[i]);\n            }\n            return pending;\n          },\n          /**\n           * @param {goog.ModuleType} type\n           */\n          setModuleState: function(type) {\n            goog.moduleLoaderState_ = {\n              type: type,\n              moduleName: '',\n              declareLegacyNamespace: false\n            };\n          },\n          /** @type {function(string, string, string=)} */\n          registerEs6ModuleExports: function(\n              path, exports, opt_closureNamespace) {\n            if (opt_closureNamespace) {\n              goog.loadedModules_[opt_closureNamespace] = {\n                exports: exports,\n                type: goog.ModuleType.ES6,\n                moduleId: opt_closureNamespace || ''\n              };\n            }\n          },\n          /** @type {function(string, ?)} */\n          registerGoogModuleExports: function(moduleId, exports) {\n            goog.loadedModules_[moduleId] = {\n              exports: exports,\n              type: goog.ModuleType.GOOG,\n              moduleId: moduleId\n            };\n          },\n          clearModuleState: function() {\n            goog.moduleLoaderState_ = null;\n          },\n          defer: function(callback) {\n            if (loadCallDone) {\n              throw new Error(\n                  'Cannot register with defer after the call to load.');\n            }\n            loader.defer_(dep, callback);\n          },\n          areDepsLoaded: function() {\n            return loader.areDepsLoaded_(dep.requires);\n          }\n        };\n\n        try {\n          dep.load(controller);\n        } finally {\n          loadCallDone = true;\n        }\n      })();\n    }\n\n    if (paused) {\n      this.pause_();\n    }\n  };\n\n\n  /** @private */\n  goog.DebugLoader_.prototype.pause_ = function() {\n    this.paused_ = true;\n  };\n\n\n  /** @private */\n  goog.DebugLoader_.prototype.resume_ = function() {\n    if (this.paused_) {\n      this.paused_ = false;\n      this.loadDeps_();\n    }\n  };\n\n\n  /**\n   * Marks the given dependency as loading (load has been called but it has not\n   * yet marked itself as finished). Useful for dependencies that want to know\n   * what else is loading. Example: goog.modules cannot eval if there are\n   * loading dependencies.\n   *\n   * @param {!goog.Dependency} dep\n   * @private\n   */\n  goog.DebugLoader_.prototype.loading_ = function(dep) {\n    this.loadingDeps_.push(dep);\n  };\n\n\n  /**\n   * Marks the given dependency as having finished loading and being available\n   * for require.\n   *\n   * @param {!goog.Dependency} dep\n   * @private\n   */\n  goog.DebugLoader_.prototype.loaded_ = function(dep) {\n    for (var i = 0; i < this.loadingDeps_.length; i++) {\n      if (this.loadingDeps_[i] == dep) {\n        this.loadingDeps_.splice(i, 1);\n        break;\n      }\n    }\n\n    for (var i = 0; i < this.deferredQueue_.length; i++) {\n      if (this.deferredQueue_[i] == dep.path) {\n        this.deferredQueue_.splice(i, 1);\n        break;\n      }\n    }\n\n    if (this.loadingDeps_.length == this.deferredQueue_.length &&\n        !this.depsToLoad_.length) {\n      // Something has asked to load these, but they may not be directly\n      // required again later, so load them now that we know we're done loading\n      // everything else. e.g. a goog module entry point.\n      while (this.deferredQueue_.length) {\n        this.requested(this.deferredQueue_.shift(), true);\n      }\n    }\n\n    dep.loaded();\n  };\n\n\n  /**\n   * @param {!Array<string>} pathsOrIds\n   * @return {boolean}\n   * @private\n   */\n  goog.DebugLoader_.prototype.areDepsLoaded_ = function(pathsOrIds) {\n    for (var i = 0; i < pathsOrIds.length; i++) {\n      var path = this.getPathFromDeps_(pathsOrIds[i]);\n      if (!path ||\n          (!(path in this.deferredCallbacks_) &&\n           !goog.isProvided_(pathsOrIds[i]))) {\n        return false;\n      }\n    }\n\n    return true;\n  };\n\n\n  /**\n   * @param {string} absPathOrId\n   * @return {?string}\n   * @private\n   */\n  goog.DebugLoader_.prototype.getPathFromDeps_ = function(absPathOrId) {\n    if (absPathOrId in this.idToPath_) {\n      return this.idToPath_[absPathOrId];\n    } else if (absPathOrId in this.dependencies_) {\n      return absPathOrId;\n    } else {\n      return null;\n    }\n  };\n\n\n  /**\n   * @param {!goog.Dependency} dependency\n   * @param {!Function} callback\n   * @private\n   */\n  goog.DebugLoader_.prototype.defer_ = function(dependency, callback) {\n    this.deferredCallbacks_[dependency.path] = callback;\n    this.deferredQueue_.push(dependency.path);\n  };\n\n\n  /**\n   * Interface for goog.Dependency implementations to have some control over\n   * loading of dependencies.\n   *\n   * @record\n   */\n  goog.LoadController = function() {};\n\n\n  /**\n   * Tells the controller to halt loading of more dependencies.\n   */\n  goog.LoadController.prototype.pause = function() {};\n\n\n  /**\n   * Tells the controller to resume loading of more dependencies if paused.\n   */\n  goog.LoadController.prototype.resume = function() {};\n\n\n  /**\n   * Tells the controller that this dependency has finished loading.\n   *\n   * This causes this to be removed from pending() and any load callbacks to\n   * fire.\n   */\n  goog.LoadController.prototype.loaded = function() {};\n\n\n  /**\n   * List of dependencies on which load has been called but which have not\n   * called loaded on their controller. This includes the current dependency.\n   *\n   * @return {!Array<!goog.Dependency>}\n   */\n  goog.LoadController.prototype.pending = function() {};\n\n\n  /**\n   * Registers an object as an ES6 module's exports so that goog.modules may\n   * require it by path.\n   *\n   * @param {string} path Full path of the module.\n   * @param {?} exports\n   * @param {string=} opt_closureNamespace Closure namespace to associate with\n   *     this module.\n   */\n  goog.LoadController.prototype.registerEs6ModuleExports = function(\n      path, exports, opt_closureNamespace) {};\n\n\n  /**\n   * Sets the current module state.\n   *\n   * @param {goog.ModuleType} type Type of module.\n   */\n  goog.LoadController.prototype.setModuleState = function(type) {};\n\n\n  /**\n   * Clears the current module state.\n   */\n  goog.LoadController.prototype.clearModuleState = function() {};\n\n\n  /**\n   * Registers a callback to call once the dependency is actually requested\n   * via goog.require + all of the immediate dependencies have been loaded or\n   * all other files have been loaded. Allows for lazy loading until\n   * require'd without pausing dependency loading, which is needed on old IE.\n   *\n   * @param {!Function} callback\n   */\n  goog.LoadController.prototype.defer = function(callback) {};\n\n\n  /**\n   * @return {boolean}\n   */\n  goog.LoadController.prototype.areDepsLoaded = function() {};\n\n\n  /**\n   * Basic super class for all dependencies Closure Library can load.\n   *\n   * This default implementation is designed to load untranspiled, non-module\n   * scripts in a web broswer.\n   *\n   * For transpiled non-goog.module files {@see goog.TranspiledDependency}.\n   * For goog.modules see {@see goog.GoogModuleDependency}.\n   * For untranspiled ES6 modules {@see goog.Es6ModuleDependency}.\n   *\n   * @param {string} path Absolute path of this script.\n   * @param {string} relativePath Path of this script relative to goog.basePath.\n   * @param {!Array<string>} provides goog.provided or goog.module symbols\n   *     in this file.\n   * @param {!Array<string>} requires goog symbols or relative paths to Closure\n   *     this depends on.\n   * @param {!Object<string, string>} loadFlags\n   * @struct @constructor\n   */\n  goog.Dependency = function(\n      path, relativePath, provides, requires, loadFlags) {\n    /** @const */\n    this.path = path;\n    /** @const */\n    this.relativePath = relativePath;\n    /** @const */\n    this.provides = provides;\n    /** @const */\n    this.requires = requires;\n    /** @const */\n    this.loadFlags = loadFlags;\n    /** @private {boolean} */\n    this.loaded_ = false;\n    /** @private {!Array<function()>} */\n    this.loadCallbacks_ = [];\n  };\n\n\n  /**\n   * @return {string} The pathname part of this dependency's path if it is a\n   *     URI.\n   */\n  goog.Dependency.prototype.getPathName = function() {\n    var pathName = this.path;\n    var protocolIndex = pathName.indexOf('://');\n    if (protocolIndex >= 0) {\n      pathName = pathName.substring(protocolIndex + 3);\n      var slashIndex = pathName.indexOf('/');\n      if (slashIndex >= 0) {\n        pathName = pathName.substring(slashIndex + 1);\n      }\n    }\n    return pathName;\n  };\n\n\n  /**\n   * @param {function()} callback Callback to fire as soon as this has loaded.\n   * @final\n   */\n  goog.Dependency.prototype.onLoad = function(callback) {\n    if (this.loaded_) {\n      callback();\n    } else {\n      this.loadCallbacks_.push(callback);\n    }\n  };\n\n\n  /**\n   * Marks this dependency as loaded and fires any callbacks registered with\n   * onLoad.\n   * @final\n   */\n  goog.Dependency.prototype.loaded = function() {\n    this.loaded_ = true;\n    var callbacks = this.loadCallbacks_;\n    this.loadCallbacks_ = [];\n    for (var i = 0; i < callbacks.length; i++) {\n      callbacks[i]();\n    }\n  };\n\n\n  /**\n   * Whether or not document.written / appended script tags should be deferred.\n   *\n   * @private {boolean}\n   */\n  goog.Dependency.defer_ = false;\n\n\n  /**\n   * Map of script ready / state change callbacks. Old IE cannot handle putting\n   * these properties on goog.global.\n   *\n   * @private @const {!Object<string, function(?):undefined>}\n   */\n  goog.Dependency.callbackMap_ = {};\n\n\n  /**\n   * @param {function(...?):?} callback\n   * @return {string}\n   * @private\n   */\n  goog.Dependency.registerCallback_ = function(callback) {\n    var key = Math.random().toString(32);\n    goog.Dependency.callbackMap_[key] = callback;\n    return key;\n  };\n\n\n  /**\n   * @param {string} key\n   * @private\n   */\n  goog.Dependency.unregisterCallback_ = function(key) {\n    delete goog.Dependency.callbackMap_[key];\n  };\n\n\n  /**\n   * @param {string} key\n   * @param {...?} var_args\n   * @private\n   * @suppress {unusedPrivateMembers}\n   */\n  goog.Dependency.callback_ = function(key, var_args) {\n    if (key in goog.Dependency.callbackMap_) {\n      var callback = goog.Dependency.callbackMap_[key];\n      var args = [];\n      for (var i = 1; i < arguments.length; i++) {\n        args.push(arguments[i]);\n      }\n      callback.apply(undefined, args);\n    } else {\n      var errorMessage = 'Callback key ' + key +\n          ' does not exist (was base.js loaded more than once?).';\n      throw Error(errorMessage);\n    }\n  };\n\n\n  /**\n   * Starts loading this dependency. This dependency can pause loading if it\n   * needs to and resume it later via the controller interface.\n   *\n   * When this is loaded it should call controller.loaded(). Note that this will\n   * end up calling the loaded method of this dependency; there is no need to\n   * call it explicitly.\n   *\n   * @param {!goog.LoadController} controller\n   */\n  goog.Dependency.prototype.load = function(controller) {\n    if (goog.global.CLOSURE_IMPORT_SCRIPT) {\n      if (goog.global.CLOSURE_IMPORT_SCRIPT(this.path)) {\n        controller.loaded();\n      } else {\n        controller.pause();\n      }\n      return;\n    }\n\n    if (!goog.inHtmlDocument_()) {\n      goog.logToConsole_(\n          'Cannot use default debug loader outside of HTML documents.');\n      if (this.relativePath == 'deps.js') {\n        // Some old code is relying on base.js auto loading deps.js failing with\n        // no error before later setting CLOSURE_IMPORT_SCRIPT.\n        // CLOSURE_IMPORT_SCRIPT should be set *before* base.js is loaded, or\n        // CLOSURE_NO_DEPS set to true.\n        goog.logToConsole_(\n            'Consider setting CLOSURE_IMPORT_SCRIPT before loading base.js, ' +\n            'or setting CLOSURE_NO_DEPS to true.');\n        controller.loaded();\n      } else {\n        controller.pause();\n      }\n      return;\n    }\n\n    /** @type {!HTMLDocument} */\n    var doc = goog.global.document;\n\n    // If the user tries to require a new symbol after document load,\n    // something has gone terribly wrong. Doing a document.write would\n    // wipe out the page. This does not apply to the CSP-compliant method\n    // of writing script tags.\n    if (doc.readyState == 'complete' &&\n        !goog.ENABLE_CHROME_APP_SAFE_SCRIPT_LOADING) {\n      // Certain test frameworks load base.js multiple times, which tries\n      // to write deps.js each time. If that happens, just fail silently.\n      // These frameworks wipe the page between each load of base.js, so this\n      // is OK.\n      var isDeps = /\\bdeps.js$/.test(this.path);\n      if (isDeps) {\n        controller.loaded();\n        return;\n      } else {\n        throw Error('Cannot write \"' + this.path + '\" after document load');\n      }\n    }\n\n    var nonce = goog.getScriptNonce_();\n    if (!goog.ENABLE_CHROME_APP_SAFE_SCRIPT_LOADING &&\n        goog.isDocumentLoading_()) {\n      var key;\n      var callback = function(script) {\n        if (script.readyState && script.readyState != 'complete') {\n          script.onload = callback;\n          return;\n        }\n        goog.Dependency.unregisterCallback_(key);\n        controller.loaded();\n      };\n      key = goog.Dependency.registerCallback_(callback);\n\n      var defer = goog.Dependency.defer_ ? ' defer' : '';\n      var nonceAttr = nonce ? ' nonce=\"' + nonce + '\"' : '';\n      var script = '<script src=\"' + this.path + '\"' + nonceAttr + defer +\n          ' id=\"script-' + key + '\"><\\/script>';\n\n      script += '<script' + nonceAttr + '>';\n\n      if (goog.Dependency.defer_) {\n        script += 'document.getElementById(\\'script-' + key +\n            '\\').onload = function() {\\n' +\n            '  goog.Dependency.callback_(\\'' + key + '\\', this);\\n' +\n            '};\\n';\n      } else {\n        script += 'goog.Dependency.callback_(\\'' + key +\n            '\\', document.getElementById(\\'script-' + key + '\\'));';\n      }\n\n      script += '<\\/script>';\n\n      doc.write(\n          goog.TRUSTED_TYPES_POLICY_ ?\n              goog.TRUSTED_TYPES_POLICY_.createHTML(script) :\n              script);\n    } else {\n      var scriptEl =\n          /** @type {!HTMLScriptElement} */ (doc.createElement('script'));\n      scriptEl.defer = goog.Dependency.defer_;\n      scriptEl.async = false;\n\n      // If CSP nonces are used, propagate them to dynamically created scripts.\n      // This is necessary to allow nonce-based CSPs without 'strict-dynamic'.\n      if (nonce) {\n        scriptEl.nonce = nonce;\n      }\n\n      scriptEl.onload = function() {\n        scriptEl.onload = null;\n        controller.loaded();\n      };\n\n      scriptEl.src = goog.TRUSTED_TYPES_POLICY_ ?\n          goog.TRUSTED_TYPES_POLICY_.createScriptURL(this.path) :\n          this.path;\n      doc.head.appendChild(scriptEl);\n    }\n  };\n\n\n  /**\n   * @param {string} path Absolute path of this script.\n   * @param {string} relativePath Path of this script relative to goog.basePath.\n   * @param {!Array<string>} provides Should be an empty array.\n   *     TODO(johnplaisted) add support for adding closure namespaces to ES6\n   *     modules for interop purposes.\n   * @param {!Array<string>} requires goog symbols or relative paths to Closure\n   *     this depends on.\n   * @param {!Object<string, string>} loadFlags\n   * @struct @constructor\n   * @extends {goog.Dependency}\n   */\n  goog.Es6ModuleDependency = function(\n      path, relativePath, provides, requires, loadFlags) {\n    goog.Es6ModuleDependency.base(\n        this, 'constructor', path, relativePath, provides, requires, loadFlags);\n  };\n  goog.inherits(goog.Es6ModuleDependency, goog.Dependency);\n\n\n  /**\n   * @override\n   * @param {!goog.LoadController} controller\n   */\n  goog.Es6ModuleDependency.prototype.load = function(controller) {\n    if (goog.global.CLOSURE_IMPORT_SCRIPT) {\n      if (goog.global.CLOSURE_IMPORT_SCRIPT(this.path)) {\n        controller.loaded();\n      } else {\n        controller.pause();\n      }\n      return;\n    }\n\n    if (!goog.inHtmlDocument_()) {\n      goog.logToConsole_(\n          'Cannot use default debug loader outside of HTML documents.');\n      controller.pause();\n      return;\n    }\n\n    /** @type {!HTMLDocument} */\n    var doc = goog.global.document;\n\n    var dep = this;\n\n    // TODO(johnplaisted): Does document.writing really speed up anything? Any\n    // difference between this and just waiting for interactive mode and then\n    // appending?\n    function write(src, contents) {\n      var nonceAttr = '';\n      var nonce = goog.getScriptNonce_();\n      if (nonce) {\n        nonceAttr = ' nonce=\"' + nonce + '\"';\n      }\n\n      if (contents) {\n        var script = '<script type=\"module\" crossorigin' + nonceAttr + '>' +\n            contents + '</' +\n            'script>';\n        doc.write(\n            goog.TRUSTED_TYPES_POLICY_ ?\n                goog.TRUSTED_TYPES_POLICY_.createHTML(script) :\n                script);\n      } else {\n        var script = '<script type=\"module\" crossorigin src=\"' + src + '\"' +\n            nonceAttr + '></' +\n            'script>';\n        doc.write(\n            goog.TRUSTED_TYPES_POLICY_ ?\n                goog.TRUSTED_TYPES_POLICY_.createHTML(script) :\n                script);\n      }\n    }\n\n    function append(src, contents) {\n      var scriptEl =\n          /** @type {!HTMLScriptElement} */ (doc.createElement('script'));\n      scriptEl.defer = true;\n      scriptEl.async = false;\n      scriptEl.type = 'module';\n      scriptEl.setAttribute('crossorigin', true);\n\n      // If CSP nonces are used, propagate them to dynamically created scripts.\n      // This is necessary to allow nonce-based CSPs without 'strict-dynamic'.\n      var nonce = goog.getScriptNonce_();\n      if (nonce) {\n        scriptEl.nonce = nonce;\n      }\n\n      if (contents) {\n        scriptEl.text = goog.TRUSTED_TYPES_POLICY_ ?\n            goog.TRUSTED_TYPES_POLICY_.createScript(contents) :\n            contents;\n      } else {\n        scriptEl.src = goog.TRUSTED_TYPES_POLICY_ ?\n            goog.TRUSTED_TYPES_POLICY_.createScriptURL(src) :\n            src;\n      }\n\n      doc.head.appendChild(scriptEl);\n    }\n\n    var create;\n\n    if (goog.isDocumentLoading_()) {\n      create = write;\n      // We can ONLY call document.write if we are guaranteed that any\n      // non-module script tags document.written after this are deferred.\n      // Small optimization, in theory document.writing is faster.\n      goog.Dependency.defer_ = true;\n    } else {\n      create = append;\n    }\n\n    // Write 4 separate tags here:\n    // 1) Sets the module state at the correct time (just before execution).\n    // 2) A src node for this, which just hopefully lets the browser load it a\n    //    little early (no need to parse #3).\n    // 3) Import the module and register it.\n    // 4) Clear the module state at the correct time. Guaranteed to run even\n    //    if there is an error in the module (#3 will not run if there is an\n    //    error in the module).\n    var beforeKey = goog.Dependency.registerCallback_(function() {\n      goog.Dependency.unregisterCallback_(beforeKey);\n      controller.setModuleState(goog.ModuleType.ES6);\n    });\n    create(undefined, 'goog.Dependency.callback_(\"' + beforeKey + '\")');\n\n    // TODO(johnplaisted): Does this really speed up anything?\n    create(this.path, undefined);\n\n    var registerKey = goog.Dependency.registerCallback_(function(exports) {\n      goog.Dependency.unregisterCallback_(registerKey);\n      controller.registerEs6ModuleExports(\n          dep.path, exports, goog.moduleLoaderState_.moduleName);\n    });\n    create(\n        undefined,\n        'import * as m from \"' + this.path + '\"; goog.Dependency.callback_(\"' +\n            registerKey + '\", m)');\n\n    var afterKey = goog.Dependency.registerCallback_(function() {\n      goog.Dependency.unregisterCallback_(afterKey);\n      controller.clearModuleState();\n      controller.loaded();\n    });\n    create(undefined, 'goog.Dependency.callback_(\"' + afterKey + '\")');\n  };\n\n\n  /**\n   * Superclass of any dependency that needs to be loaded into memory,\n   * transformed, and then eval'd (goog.modules and transpiled files).\n   *\n   * @param {string} path Absolute path of this script.\n   * @param {string} relativePath Path of this script relative to goog.basePath.\n   * @param {!Array<string>} provides goog.provided or goog.module symbols\n   *     in this file.\n   * @param {!Array<string>} requires goog symbols or relative paths to Closure\n   *     this depends on.\n   * @param {!Object<string, string>} loadFlags\n   * @struct @constructor @abstract\n   * @extends {goog.Dependency}\n   */\n  goog.TransformedDependency = function(\n      path, relativePath, provides, requires, loadFlags) {\n    goog.TransformedDependency.base(\n        this, 'constructor', path, relativePath, provides, requires, loadFlags);\n    /** @private {?string} */\n    this.contents_ = null;\n\n    /**\n     * Whether to lazily make the synchronous XHR (when goog.require'd) or make\n     * the synchronous XHR when initially loading. On FireFox 61 there is a bug\n     * where an ES6 module cannot make a synchronous XHR (rather, it can, but if\n     * it does then no other ES6 modules will load after).\n     *\n     * tl;dr we lazy load due to bugs on older browsers and eager load due to\n     * bugs on newer ones.\n     *\n     * https://bugzilla.mozilla.org/show_bug.cgi?id=1477090\n     *\n     * @private @const {boolean}\n     */\n    this.lazyFetch_ = !goog.inHtmlDocument_() ||\n        !('noModule' in goog.global.document.createElement('script'));\n  };\n  goog.inherits(goog.TransformedDependency, goog.Dependency);\n\n\n  /**\n   * @override\n   * @param {!goog.LoadController} controller\n   */\n  goog.TransformedDependency.prototype.load = function(controller) {\n    var dep = this;\n\n    function fetch() {\n      dep.contents_ = goog.loadFileSync_(dep.path);\n\n      if (dep.contents_) {\n        dep.contents_ = dep.transform(dep.contents_);\n        if (dep.contents_) {\n          dep.contents_ += '\\n//# sourceURL=' + dep.path;\n        }\n      }\n    }\n\n    if (goog.global.CLOSURE_IMPORT_SCRIPT) {\n      fetch();\n      if (this.contents_ &&\n          goog.global.CLOSURE_IMPORT_SCRIPT('', this.contents_)) {\n        this.contents_ = null;\n        controller.loaded();\n      } else {\n        controller.pause();\n      }\n      return;\n    }\n\n\n    var isEs6 = this.loadFlags['module'] == goog.ModuleType.ES6;\n\n    if (!this.lazyFetch_) {\n      fetch();\n    }\n\n    function load() {\n      if (dep.lazyFetch_) {\n        fetch();\n      }\n\n      if (!dep.contents_) {\n        // loadFileSync_ or transform are responsible. Assume they logged an\n        // error.\n        return;\n      }\n\n      if (isEs6) {\n        controller.setModuleState(goog.ModuleType.ES6);\n      }\n\n      var namespace;\n\n      try {\n        var contents = dep.contents_;\n        dep.contents_ = null;\n        goog.globalEval(goog.CLOSURE_EVAL_PREFILTER_.createScript(contents));\n        if (isEs6) {\n          namespace = goog.moduleLoaderState_.moduleName;\n        }\n      } finally {\n        if (isEs6) {\n          controller.clearModuleState();\n        }\n      }\n\n      if (isEs6) {\n        // Due to circular dependencies this may not be available for require\n        // right now.\n        goog.global['$jscomp']['require']['ensure'](\n            [dep.getPathName()], function() {\n              controller.registerEs6ModuleExports(\n                  dep.path,\n                  goog.global['$jscomp']['require'](dep.getPathName()),\n                  namespace);\n            });\n      }\n\n      controller.loaded();\n    }\n\n    // Do not fetch now; in FireFox 47 the synchronous XHR doesn't block all\n    // events. If we fetched now and then document.write'd the contents the\n    // document.write would be an eval and would execute too soon! Instead write\n    // a script tag to fetch and eval synchronously at the correct time.\n    function fetchInOwnScriptThenLoad() {\n      /** @type {!HTMLDocument} */\n      var doc = goog.global.document;\n\n      var key = goog.Dependency.registerCallback_(function() {\n        goog.Dependency.unregisterCallback_(key);\n        load();\n      });\n\n      var nonce = goog.getScriptNonce_();\n      var nonceAttr = nonce ? ' nonce=\"' + nonce + '\"' : '';\n      var script = '<script' + nonceAttr + '>' +\n          goog.protectScriptTag_('goog.Dependency.callback_(\"' + key + '\");') +\n          '</' +\n          'script>';\n      doc.write(\n          goog.TRUSTED_TYPES_POLICY_ ?\n              goog.TRUSTED_TYPES_POLICY_.createHTML(script) :\n              script);\n    }\n\n    // If one thing is pending it is this.\n    var anythingElsePending = controller.pending().length > 1;\n\n    // Additionally if we are meant to defer scripts but the page is still\n    // loading (e.g. an ES6 module is loading) then also defer. Or if we are\n    // meant to defer and anything else is pending then defer (those may be\n    // scripts that did not need transformation and are just script tags with\n    // defer set to true, and we need to evaluate after that deferred script).\n    var needsAsyncLoading = goog.Dependency.defer_ &&\n        (anythingElsePending || goog.isDocumentLoading_());\n\n    if (needsAsyncLoading) {\n      // Note that we only defer when we have to rather than 100% of the time.\n      // Always defering would work, but then in theory the order of\n      // goog.require calls would then matter. We want to enforce that most of\n      // the time the order of the require calls does not matter.\n      controller.defer(function() {\n        load();\n      });\n      return;\n    }\n    // TODO(johnplaisted): Externs are missing onreadystatechange for\n    // HTMLDocument.\n    /** @type {?} */\n    var doc = goog.global.document;\n\n    var isInternetExplorerOrEdge = goog.inHtmlDocument_() &&\n        ('ActiveXObject' in goog.global || goog.isEdge_());\n\n    // Don't delay in any version of IE or pre-Chromium Edge. There's a bug\n    // around this that will cause out of order script execution. This means\n    // that on older IE ES6 modules will load too early (while the document is\n    // still loading + the dom is not available). The other option is to load\n    // too late (when the document is complete and the onload even will never\n    // fire). This seems to be the lesser of two evils as scripts already act\n    // like the former.\n    if (isEs6 && goog.inHtmlDocument_() && goog.isDocumentLoading_() &&\n        !isInternetExplorerOrEdge) {\n      goog.Dependency.defer_ = true;\n      // Transpiled ES6 modules still need to load like regular ES6 modules,\n      // aka only after the document is interactive.\n      controller.pause();\n      var oldCallback = doc.onreadystatechange;\n      doc.onreadystatechange = function() {\n        if (doc.readyState == 'interactive') {\n          doc.onreadystatechange = oldCallback;\n          load();\n          controller.resume();\n        }\n        if (typeof oldCallback === 'function') {\n          oldCallback.apply(undefined, arguments);\n        }\n      };\n    } else {\n      // Always eval on old IE.\n      if (!goog.inHtmlDocument_() || !goog.isDocumentLoading_()) {\n        load();\n      } else {\n        fetchInOwnScriptThenLoad();\n      }\n    }\n  };\n\n\n  /**\n   * @param {string} contents\n   * @return {string}\n   * @abstract\n   */\n  goog.TransformedDependency.prototype.transform = function(contents) {};\n\n\n  /**\n   * Any non-goog.module dependency which needs to be transpiled before eval.\n   *\n   * @param {string} path Absolute path of this script.\n   * @param {string} relativePath Path of this script relative to goog.basePath.\n   * @param {!Array<string>} provides goog.provided or goog.module symbols\n   *     in this file.\n   * @param {!Array<string>} requires goog symbols or relative paths to Closure\n   *     this depends on.\n   * @param {!Object<string, string>} loadFlags\n   * @param {!goog.Transpiler} transpiler\n   * @struct @constructor\n   * @extends {goog.TransformedDependency}\n   */\n  goog.TranspiledDependency = function(\n      path, relativePath, provides, requires, loadFlags, transpiler) {\n    goog.TranspiledDependency.base(\n        this, 'constructor', path, relativePath, provides, requires, loadFlags);\n    /** @protected @const*/\n    this.transpiler = transpiler;\n  };\n  goog.inherits(goog.TranspiledDependency, goog.TransformedDependency);\n\n\n  /**\n   * @override\n   * @param {string} contents\n   * @return {string}\n   */\n  goog.TranspiledDependency.prototype.transform = function(contents) {\n    // Transpile with the pathname so that ES6 modules are domain agnostic.\n    return this.transpiler.transpile(contents, this.getPathName());\n  };\n\n\n  /**\n   * An ES6 module dependency that was transpiled to a jscomp module outside\n   * of the debug loader, e.g. server side.\n   *\n   * @param {string} path Absolute path of this script.\n   * @param {string} relativePath Path of this script relative to goog.basePath.\n   * @param {!Array<string>} provides goog.provided or goog.module symbols\n   *     in this file.\n   * @param {!Array<string>} requires goog symbols or relative paths to Closure\n   *     this depends on.\n   * @param {!Object<string, string>} loadFlags\n   * @struct @constructor\n   * @extends {goog.TransformedDependency}\n   */\n  goog.PreTranspiledEs6ModuleDependency = function(\n      path, relativePath, provides, requires, loadFlags) {\n    goog.PreTranspiledEs6ModuleDependency.base(\n        this, 'constructor', path, relativePath, provides, requires, loadFlags);\n  };\n  goog.inherits(\n      goog.PreTranspiledEs6ModuleDependency, goog.TransformedDependency);\n\n\n  /**\n   * @override\n   * @param {string} contents\n   * @return {string}\n   */\n  goog.PreTranspiledEs6ModuleDependency.prototype.transform = function(\n      contents) {\n    return contents;\n  };\n\n\n  /**\n   * A goog.module, transpiled or not. Will always perform some minimal\n   * transformation even when not transpiled to wrap in a goog.loadModule\n   * statement.\n   *\n   * @param {string} path Absolute path of this script.\n   * @param {string} relativePath Path of this script relative to goog.basePath.\n   * @param {!Array<string>} provides goog.provided or goog.module symbols\n   *     in this file.\n   * @param {!Array<string>} requires goog symbols or relative paths to Closure\n   *     this depends on.\n   * @param {!Object<string, string>} loadFlags\n   * @param {boolean} needsTranspile\n   * @param {!goog.Transpiler} transpiler\n   * @struct @constructor\n   * @extends {goog.TransformedDependency}\n   */\n  goog.GoogModuleDependency = function(\n      path, relativePath, provides, requires, loadFlags, needsTranspile,\n      transpiler) {\n    goog.GoogModuleDependency.base(\n        this, 'constructor', path, relativePath, provides, requires, loadFlags);\n    /** @private @const */\n    this.needsTranspile_ = needsTranspile;\n    /** @private @const */\n    this.transpiler_ = transpiler;\n  };\n  goog.inherits(goog.GoogModuleDependency, goog.TransformedDependency);\n\n\n  /**\n   * @override\n   * @param {string} contents\n   * @return {string}\n   */\n  goog.GoogModuleDependency.prototype.transform = function(contents) {\n    if (this.needsTranspile_) {\n      contents = this.transpiler_.transpile(contents, this.getPathName());\n    }\n\n    if (!goog.LOAD_MODULE_USING_EVAL || goog.global.JSON === undefined) {\n      return '' +\n          'goog.loadModule(function(exports) {' +\n          '\"use strict\";' + contents +\n          '\\n' +  // terminate any trailing single line comment.\n          ';return exports' +\n          '});' +\n          '\\n//# sourceURL=' + this.path + '\\n';\n    } else {\n      return '' +\n          'goog.loadModule(' +\n          goog.global.JSON.stringify(\n              contents + '\\n//# sourceURL=' + this.path + '\\n') +\n          ');';\n    }\n  };\n\n\n  /**\n   * @param {string} relPath\n   * @param {!Array<string>|undefined} provides\n   * @param {!Array<string>} requires\n   * @param {boolean|!Object<string>=} opt_loadFlags\n   * @see goog.addDependency\n   */\n  goog.DebugLoader_.prototype.addDependency = function(\n      relPath, provides, requires, opt_loadFlags) {\n    provides = provides || [];\n    relPath = relPath.replace(/\\\\/g, '/');\n    var path = goog.normalizePath_(goog.basePath + relPath);\n    if (!opt_loadFlags || typeof opt_loadFlags === 'boolean') {\n      opt_loadFlags = opt_loadFlags ? {'module': goog.ModuleType.GOOG} : {};\n    }\n    var dep = this.factory_.createDependency(\n        path, relPath, provides, requires, opt_loadFlags,\n        goog.transpiler_.needsTranspile(\n            opt_loadFlags['lang'] || 'es3', opt_loadFlags['module']));\n    this.dependencies_[path] = dep;\n    for (var i = 0; i < provides.length; i++) {\n      this.idToPath_[provides[i]] = path;\n    }\n    this.idToPath_[relPath] = path;\n  };\n\n\n  /**\n   * Creates goog.Dependency instances for the debug loader to load.\n   *\n   * Should be overridden to have the debug loader use custom subclasses of\n   * goog.Dependency.\n   *\n   * @param {!goog.Transpiler} transpiler\n   * @struct @constructor\n   */\n  goog.DependencyFactory = function(transpiler) {\n    /** @protected @const */\n    this.transpiler = transpiler;\n  };\n\n\n  /**\n   * @param {string} path Absolute path of the file.\n   * @param {string} relativePath Path relative to closure’s base.js.\n   * @param {!Array<string>} provides Array of provided goog.provide/module ids.\n   * @param {!Array<string>} requires Array of required goog.provide/module /\n   *     relative ES6 module paths.\n   * @param {!Object<string, string>} loadFlags\n   * @param {boolean} needsTranspile True if the file needs to be transpiled\n   *     per the goog.Transpiler.\n   * @return {!goog.Dependency}\n   */\n  goog.DependencyFactory.prototype.createDependency = function(\n      path, relativePath, provides, requires, loadFlags, needsTranspile) {\n\n    if (loadFlags['module'] == goog.ModuleType.GOOG) {\n      return new goog.GoogModuleDependency(\n          path, relativePath, provides, requires, loadFlags, needsTranspile,\n          this.transpiler);\n    } else if (needsTranspile) {\n      return new goog.TranspiledDependency(\n          path, relativePath, provides, requires, loadFlags, this.transpiler);\n    } else {\n      if (loadFlags['module'] == goog.ModuleType.ES6) {\n        if (goog.TRANSPILE == 'never' && goog.ASSUME_ES_MODULES_TRANSPILED) {\n          return new goog.PreTranspiledEs6ModuleDependency(\n              path, relativePath, provides, requires, loadFlags);\n        } else {\n          return new goog.Es6ModuleDependency(\n              path, relativePath, provides, requires, loadFlags);\n        }\n      } else {\n        return new goog.Dependency(\n            path, relativePath, provides, requires, loadFlags);\n      }\n    }\n  };\n\n\n  /** @private @const */\n  goog.debugLoader_ = new goog.DebugLoader_();\n\n\n  /**\n   * Loads the Closure Dependency file.\n   *\n   * Exposed a public function so CLOSURE_NO_DEPS can be set to false, base\n   * loaded, setDependencyFactory called, and then this called. i.e. allows\n   * custom loading of the deps file.\n   */\n  goog.loadClosureDeps = function() {\n    goog.debugLoader_.loadClosureDeps();\n  };\n\n\n  /**\n   * Sets the dependency factory, which can be used to create custom\n   * goog.Dependency implementations to control how dependencies are loaded.\n   *\n   * Note: if you wish to call this function and provide your own implemnetation\n   * it is a wise idea to set CLOSURE_NO_DEPS to true, otherwise the dependency\n   * file and all of its goog.addDependency calls will use the default factory.\n   * You can call goog.loadClosureDeps to load the Closure dependency file\n   * later, after your factory is injected.\n   *\n   * @param {!goog.DependencyFactory} factory\n   */\n  goog.setDependencyFactory = function(factory) {\n    goog.debugLoader_.setDependencyFactory(factory);\n  };\n\n\n  /**\n   * Trusted Types policy for the debug loader.\n   * @private @const {?TrustedTypePolicy}\n   */\n  goog.TRUSTED_TYPES_POLICY_ = goog.TRUSTED_TYPES_POLICY_NAME ?\n      goog.createTrustedTypesPolicy(goog.TRUSTED_TYPES_POLICY_NAME + '#base') :\n      null;\n\n  if (!goog.global.CLOSURE_NO_DEPS) {\n    goog.debugLoader_.loadClosureDeps();\n  }\n\n\n  /**\n   * Bootstraps the given namespaces and calls the callback once they are\n   * available either via goog.require. This is a replacement for using\n   * `goog.require` to bootstrap Closure JavaScript. Previously a `goog.require`\n   * in an HTML file would guarantee that the require'd namespace was available\n   * in the next immediate script tag. With ES6 modules this no longer a\n   * guarantee.\n   *\n   * @param {!Array<string>} namespaces\n   * @param {function(): ?} callback Function to call once all the namespaces\n   *     have loaded. Always called asynchronously.\n   */\n  goog.bootstrap = function(namespaces, callback) {\n    goog.debugLoader_.bootstrap(namespaces, callback);\n  };\n}\n\n\nif (!COMPILED) {\n  var isChrome87 = false;\n  // Cannot run check for Chrome <87 bug in case of strict CSP environments.\n  // TODO(user): Remove once Chrome <87 bug is no longer a problem.\n  try {\n    isChrome87 = eval(goog.global.trustedTypes.emptyScript) !==\n        goog.global.trustedTypes.emptyScript;\n  } catch (err) {\n  }\n\n  /**\n   * Trusted Types for running dev servers.\n   *\n   * @private @const\n   */\n  goog.CLOSURE_EVAL_PREFILTER_ =\n      // Detect Chrome <87 bug with TT and eval.\n      goog.global.trustedTypes && isChrome87 &&\n          goog.createTrustedTypesPolicy('goog#base#devonly#eval') ||\n      {createScript: goog.identity_};\n}\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Implements the disposable interface.\n */\n\ngoog.provide('goog.Disposable');\n\ngoog.require('goog.disposable.IDisposable');\ngoog.require('goog.dispose');\n/**\n * TODO(user): Remove this require.\n * @suppress {extraRequire}\n */\ngoog.require('goog.disposeAll');\n\n/**\n * Class that provides the basic implementation for disposable objects. If your\n * class holds references or resources that can't be collected by standard GC,\n * it should extend this class or implement the disposable interface (defined\n * in goog.disposable.IDisposable). See description of\n * goog.disposable.IDisposable for examples of cleanup.\n * @constructor\n * @implements {goog.disposable.IDisposable}\n */\ngoog.Disposable = function() {\n  'use strict';\n  /**\n   * If monitoring the goog.Disposable instances is enabled, stores the creation\n   * stack trace of the Disposable instance.\n   * @type {string|undefined}\n   */\n  this.creationStack;\n\n  if (goog.Disposable.MONITORING_MODE != goog.Disposable.MonitoringMode.OFF) {\n    if (goog.Disposable.INCLUDE_STACK_ON_CREATION) {\n      this.creationStack = new Error().stack;\n    }\n    goog.Disposable.instances_[goog.getUid(this)] = this;\n  }\n  // Support sealing\n  this.disposed_ = this.disposed_;\n  this.onDisposeCallbacks_ = this.onDisposeCallbacks_;\n};\n\n\n/**\n * @enum {number} Different monitoring modes for Disposable.\n */\ngoog.Disposable.MonitoringMode = {\n  /**\n   * No monitoring.\n   */\n  OFF: 0,\n  /**\n   * Creating and disposing the goog.Disposable instances is monitored. All\n   * disposable objects need to call the `goog.Disposable` base\n   * constructor. The PERMANENT mode must be switched on before creating any\n   * goog.Disposable instances.\n   */\n  PERMANENT: 1,\n  /**\n   * INTERACTIVE mode can be switched on and off on the fly without producing\n   * errors. It also doesn't warn if the disposable objects don't call the\n   * `goog.Disposable` base constructor.\n   */\n  INTERACTIVE: 2\n};\n\n\n/**\n * @define {number} The monitoring mode of the goog.Disposable\n *     instances. Default is OFF. Switching on the monitoring is only\n *     recommended for debugging because it has a significant impact on\n *     performance and memory usage. If switched off, the monitoring code\n *     compiles down to 0 bytes.\n */\ngoog.Disposable.MONITORING_MODE =\n    goog.define('goog.Disposable.MONITORING_MODE', 0);\n\n\n/**\n * @define {boolean} Whether to attach creation stack to each created disposable\n *     instance; This is only relevant for when MonitoringMode != OFF.\n */\ngoog.Disposable.INCLUDE_STACK_ON_CREATION =\n    goog.define('goog.Disposable.INCLUDE_STACK_ON_CREATION', true);\n\n\n/**\n * Maps the unique ID of every undisposed `goog.Disposable` object to\n * the object itself.\n * @type {!Object<number, !goog.Disposable>}\n * @private\n */\ngoog.Disposable.instances_ = {};\n\n\n/**\n * @return {!Array<!goog.Disposable>} All `goog.Disposable` objects that\n *     haven't been disposed of.\n */\ngoog.Disposable.getUndisposedObjects = function() {\n  'use strict';\n  var ret = [];\n  for (var id in goog.Disposable.instances_) {\n    if (goog.Disposable.instances_.hasOwnProperty(id)) {\n      ret.push(goog.Disposable.instances_[Number(id)]);\n    }\n  }\n  return ret;\n};\n\n\n/**\n * Clears the registry of undisposed objects but doesn't dispose of them.\n */\ngoog.Disposable.clearUndisposedObjects = function() {\n  'use strict';\n  goog.Disposable.instances_ = {};\n};\n\n\n/**\n * Whether the object has been disposed of.\n * @type {boolean}\n * @private\n */\ngoog.Disposable.prototype.disposed_ = false;\n\n\n/**\n * Callbacks to invoke when this object is disposed.\n * @type {Array<!Function>}\n * @private\n */\ngoog.Disposable.prototype.onDisposeCallbacks_;\n\n\n/**\n * @return {boolean} Whether the object has been disposed of.\n * @override\n */\ngoog.Disposable.prototype.isDisposed = function() {\n  'use strict';\n  return this.disposed_;\n};\n\n\n/**\n * @return {boolean} Whether the object has been disposed of.\n * @deprecated Use {@link #isDisposed} instead.\n */\ngoog.Disposable.prototype.getDisposed = goog.Disposable.prototype.isDisposed;\n\n\n/**\n * Disposes of the object. If the object hasn't already been disposed of, calls\n * {@link #disposeInternal}. Classes that extend `goog.Disposable` should\n * override {@link #disposeInternal} in order to cleanup references, resources\n * and other disposable objects. Reentrant.\n *\n * @return {void} Nothing.\n * @override\n */\ngoog.Disposable.prototype.dispose = function() {\n  'use strict';\n  if (!this.disposed_) {\n    // Set disposed_ to true first, in case during the chain of disposal this\n    // gets disposed recursively.\n    this.disposed_ = true;\n    this.disposeInternal();\n    if (goog.Disposable.MONITORING_MODE != goog.Disposable.MonitoringMode.OFF) {\n      var uid = goog.getUid(this);\n      if (goog.Disposable.MONITORING_MODE ==\n              goog.Disposable.MonitoringMode.PERMANENT &&\n          !goog.Disposable.instances_.hasOwnProperty(uid)) {\n        throw new Error(\n            this + ' did not call the goog.Disposable base ' +\n            'constructor or was disposed of after a clearUndisposedObjects ' +\n            'call');\n      }\n      if (goog.Disposable.MONITORING_MODE !=\n              goog.Disposable.MonitoringMode.OFF &&\n          this.onDisposeCallbacks_ && this.onDisposeCallbacks_.length > 0) {\n        throw new Error(\n            this + ' did not empty its onDisposeCallbacks queue. This ' +\n            'probably means it overrode dispose() or disposeInternal() ' +\n            'without calling the superclass\\' method.');\n      }\n      delete goog.Disposable.instances_[uid];\n    }\n  }\n};\n\n\n/**\n * Associates a disposable object with this object so that they will be disposed\n * together.\n * @param {goog.disposable.IDisposable} disposable that will be disposed when\n *     this object is disposed.\n */\ngoog.Disposable.prototype.registerDisposable = function(disposable) {\n  'use strict';\n  this.addOnDisposeCallback(goog.partial(goog.dispose, disposable));\n};\n\n\n/**\n * Invokes a callback function when this object is disposed. Callbacks are\n * invoked in the order in which they were added. If a callback is added to\n * an already disposed Disposable, it will be called immediately.\n * @param {function(this:T):?} callback The callback function.\n * @param {T=} opt_scope An optional scope to call the callback in.\n * @template T\n */\ngoog.Disposable.prototype.addOnDisposeCallback = function(callback, opt_scope) {\n  'use strict';\n  if (this.disposed_) {\n    opt_scope !== undefined ? callback.call(opt_scope) : callback();\n    return;\n  }\n  if (!this.onDisposeCallbacks_) {\n    this.onDisposeCallbacks_ = [];\n  }\n\n  this.onDisposeCallbacks_.push(\n      opt_scope !== undefined ? goog.bind(callback, opt_scope) : callback);\n};\n\n\n/**\n * Performs appropriate cleanup. See description of goog.disposable.IDisposable\n * for examples. Classes that extend `goog.Disposable` should override this\n * method. Not reentrant. To avoid calling it twice, it must only be called from\n * the subclass' `disposeInternal` method. Everywhere else the public `dispose`\n * method must be used. For example:\n *\n * <pre>\n * mypackage.MyClass = function() {\n * mypackage.MyClass.base(this, 'constructor');\n *     // Constructor logic specific to MyClass.\n *     ...\n *   };\n *   goog.inherits(mypackage.MyClass, goog.Disposable);\n *\n *   mypackage.MyClass.prototype.disposeInternal = function() {\n *     // Dispose logic specific to MyClass.\n *     ...\n *     // Call superclass's disposeInternal at the end of the subclass's, like\n *     // in C++, to avoid hard-to-catch issues.\n *     mypackage.MyClass.base(this, 'disposeInternal');\n *   };\n * </pre>\n *\n * @protected\n */\ngoog.Disposable.prototype.disposeInternal = function() {\n  'use strict';\n  if (this.onDisposeCallbacks_) {\n    while (this.onDisposeCallbacks_.length) {\n      this.onDisposeCallbacks_.shift()();\n    }\n  }\n};\n\n\n/**\n * Returns True if we can verify the object is disposed.\n * Calls `isDisposed` on the argument if it supports it.  If obj\n * is not an object with an isDisposed() method, return false.\n * @param {*} obj The object to investigate.\n * @return {boolean} True if we can verify the object is disposed.\n */\ngoog.Disposable.isDisposed = function(obj) {\n  'use strict';\n  if (obj && typeof obj.isDisposed == 'function') {\n    return obj.isDisposed();\n  }\n  return false;\n};\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Utilities for manipulating arrays.\n */\n\n\ngoog.module('goog.array');\ngoog.module.declareLegacyNamespace();\n\nconst asserts = goog.require('goog.asserts');\n\n\n/**\n * @define {boolean} NATIVE_ARRAY_PROTOTYPES indicates whether the code should\n * rely on Array.prototype functions, if available.\n *\n * The Array.prototype functions can be defined by external libraries like\n * Prototype and setting this flag to false forces closure to use its own\n * goog.array implementation.\n *\n * If your javascript can be loaded by a third party site and you are wary about\n * relying on the prototype functions, specify\n * \"--define goog.NATIVE_ARRAY_PROTOTYPES=false\" to the JSCompiler.\n *\n * Setting goog.TRUSTED_SITE to false will automatically set\n * NATIVE_ARRAY_PROTOTYPES to false.\n */\ngoog.NATIVE_ARRAY_PROTOTYPES =\n    goog.define('goog.NATIVE_ARRAY_PROTOTYPES', goog.TRUSTED_SITE);\n\n\n/**\n * @define {boolean} If true, JSCompiler will use the native implementation of\n * array functions where appropriate (e.g., `Array#filter`) and remove the\n * unused pure JS implementation.\n */\nconst ASSUME_NATIVE_FUNCTIONS = goog.define(\n    'goog.array.ASSUME_NATIVE_FUNCTIONS', goog.FEATURESET_YEAR > 2012);\nexports.ASSUME_NATIVE_FUNCTIONS = ASSUME_NATIVE_FUNCTIONS;\n\n\n/**\n * Returns the last element in an array without removing it.\n * Same as {@link goog.array.last}.\n * @param {IArrayLike<T>|string} array The array.\n * @return {T} Last item in array.\n * @template T\n */\nfunction peek(array) {\n  return array[array.length - 1];\n}\nexports.peek = peek;\n\n\n/**\n * Returns the last element in an array without removing it.\n * Same as {@link goog.array.peek}.\n * @param {IArrayLike<T>|string} array The array.\n * @return {T} Last item in array.\n * @template T\n */\nexports.last = peek;\n\n// NOTE(arv): Since most of the array functions are generic it allows you to\n// pass an array-like object. Strings have a length and are considered array-\n// like. However, the 'in' operator does not work on strings so we cannot just\n// use the array path even if the browser supports indexing into strings. We\n// therefore end up splitting the string.\n\n\n/**\n * Returns the index of the first element of an array with a specified value, or\n * -1 if the element is not present in the array.\n *\n * See {@link http://tinyurl.com/developer-mozilla-org-array-indexof}\n *\n * @param {IArrayLike<T>|string} arr The array to be searched.\n * @param {T} obj The object for which we are searching.\n * @param {number=} opt_fromIndex The index at which to start the search. If\n *     omitted the search starts at index 0.\n * @return {number} The index of the first matching array element.\n * @template T\n */\nconst indexOf = goog.NATIVE_ARRAY_PROTOTYPES &&\n        (ASSUME_NATIVE_FUNCTIONS || Array.prototype.indexOf) ?\n    function(arr, obj, opt_fromIndex) {\n      asserts.assert(arr.length != null);\n\n      return Array.prototype.indexOf.call(arr, obj, opt_fromIndex);\n    } :\n    function(arr, obj, opt_fromIndex) {\n      const fromIndex = opt_fromIndex == null ?\n          0 :\n          (opt_fromIndex < 0 ? Math.max(0, arr.length + opt_fromIndex) :\n                               opt_fromIndex);\n\n      if (typeof arr === 'string') {\n        // Array.prototype.indexOf uses === so only strings should be found.\n        if (typeof obj !== 'string' || obj.length != 1) {\n          return -1;\n        }\n        return arr.indexOf(obj, fromIndex);\n      }\n\n      for (let i = fromIndex; i < arr.length; i++) {\n        if (i in arr && arr[i] === obj) return i;\n      }\n      return -1;\n    };\nexports.indexOf = indexOf;\n\n\n/**\n * Returns the index of the last element of an array with a specified value, or\n * -1 if the element is not present in the array.\n *\n * See {@link http://tinyurl.com/developer-mozilla-org-array-lastindexof}\n *\n * @param {!IArrayLike<T>|string} arr The array to be searched.\n * @param {T} obj The object for which we are searching.\n * @param {?number=} opt_fromIndex The index at which to start the search. If\n *     omitted the search starts at the end of the array.\n * @return {number} The index of the last matching array element.\n * @template T\n */\nconst lastIndexOf = goog.NATIVE_ARRAY_PROTOTYPES &&\n        (ASSUME_NATIVE_FUNCTIONS || Array.prototype.lastIndexOf) ?\n    function(arr, obj, opt_fromIndex) {\n      asserts.assert(arr.length != null);\n\n      // Firefox treats undefined and null as 0 in the fromIndex argument which\n      // leads it to always return -1\n      const fromIndex = opt_fromIndex == null ? arr.length - 1 : opt_fromIndex;\n      return Array.prototype.lastIndexOf.call(arr, obj, fromIndex);\n    } :\n    function(arr, obj, opt_fromIndex) {\n      let fromIndex = opt_fromIndex == null ? arr.length - 1 : opt_fromIndex;\n\n      if (fromIndex < 0) {\n        fromIndex = Math.max(0, arr.length + fromIndex);\n      }\n\n      if (typeof arr === 'string') {\n        // Array.prototype.lastIndexOf uses === so only strings should be found.\n        if (typeof obj !== 'string' || obj.length != 1) {\n          return -1;\n        }\n        return arr.lastIndexOf(obj, fromIndex);\n      }\n\n      for (let i = fromIndex; i >= 0; i--) {\n        if (i in arr && arr[i] === obj) return i;\n      }\n      return -1;\n    };\nexports.lastIndexOf = lastIndexOf;\n\n\n/**\n * Calls a function for each element in an array. Skips holes in the array.\n * See {@link http://tinyurl.com/developer-mozilla-org-array-foreach}\n *\n * @param {IArrayLike<T>|string} arr Array or array like object over\n *     which to iterate.\n * @param {?function(this: S, T, number, ?): ?} f The function to call for every\n *     element. This function takes 3 arguments (the element, the index and the\n *     array). The return value is ignored.\n * @param {S=} opt_obj The object to be used as the value of 'this' within f.\n * @template T,S\n */\nconst forEach = goog.NATIVE_ARRAY_PROTOTYPES &&\n        (ASSUME_NATIVE_FUNCTIONS || Array.prototype.forEach) ?\n    function(arr, f, opt_obj) {\n      asserts.assert(arr.length != null);\n\n      Array.prototype.forEach.call(arr, f, opt_obj);\n    } :\n    function(arr, f, opt_obj) {\n      const l = arr.length;  // must be fixed during loop... see docs\n      const arr2 = (typeof arr === 'string') ? arr.split('') : arr;\n      for (let i = 0; i < l; i++) {\n        if (i in arr2) {\n          f.call(/** @type {?} */ (opt_obj), arr2[i], i, arr);\n        }\n      }\n    };\nexports.forEach = forEach;\n\n\n/**\n * Calls a function for each element in an array, starting from the last\n * element rather than the first.\n *\n * @param {IArrayLike<T>|string} arr Array or array\n *     like object over which to iterate.\n * @param {?function(this: S, T, number, ?): ?} f The function to call for every\n *     element. This function\n *     takes 3 arguments (the element, the index and the array). The return\n *     value is ignored.\n * @param {S=} opt_obj The object to be used as the value of 'this'\n *     within f.\n * @template T,S\n */\nfunction forEachRight(arr, f, opt_obj) {\n  const l = arr.length;  // must be fixed during loop... see docs\n  const arr2 = (typeof arr === 'string') ? arr.split('') : arr;\n  for (let i = l - 1; i >= 0; --i) {\n    if (i in arr2) {\n      f.call(/** @type {?} */ (opt_obj), arr2[i], i, arr);\n    }\n  }\n}\nexports.forEachRight = forEachRight;\n\n\n/**\n * Calls a function for each element in an array, and if the function returns\n * true adds the element to a new array.\n *\n * See {@link http://tinyurl.com/developer-mozilla-org-array-filter}\n *\n * @param {IArrayLike<T>|string} arr Array or array\n *     like object over which to iterate.\n * @param {?function(this:S, T, number, ?):boolean} f The function to call for\n *     every element. This function\n *     takes 3 arguments (the element, the index and the array) and must\n *     return a Boolean. If the return value is true the element is added to the\n *     result array. If it is false the element is not included.\n * @param {S=} opt_obj The object to be used as the value of 'this'\n *     within f.\n * @return {!Array<T>} a new array in which only elements that passed the test\n *     are present.\n * @template T,S\n */\nconst filter = goog.NATIVE_ARRAY_PROTOTYPES &&\n        (ASSUME_NATIVE_FUNCTIONS || Array.prototype.filter) ?\n    function(arr, f, opt_obj) {\n      asserts.assert(arr.length != null);\n\n      return Array.prototype.filter.call(arr, f, opt_obj);\n    } :\n    function(arr, f, opt_obj) {\n      const l = arr.length;  // must be fixed during loop... see docs\n      const res = [];\n      let resLength = 0;\n      const arr2 = (typeof arr === 'string') ? arr.split('') : arr;\n      for (let i = 0; i < l; i++) {\n        if (i in arr2) {\n          const val = arr2[i];  // in case f mutates arr2\n          if (f.call(/** @type {?} */ (opt_obj), val, i, arr)) {\n            res[resLength++] = val;\n          }\n        }\n      }\n      return res;\n    };\nexports.filter = filter;\n\n\n/**\n * Calls a function for each element in an array and inserts the result into a\n * new array.\n *\n * See {@link http://tinyurl.com/developer-mozilla-org-array-map}\n *\n * @param {IArrayLike<VALUE>|string} arr Array or array like object\n *     over which to iterate.\n * @param {function(this:THIS, VALUE, number, ?): RESULT} f The function to call\n *     for every element. This function takes 3 arguments (the element,\n *     the index and the array) and should return something. The result will be\n *     inserted into a new array.\n * @param {THIS=} opt_obj The object to be used as the value of 'this' within f.\n * @return {!Array<RESULT>} a new array with the results from f.\n * @template THIS, VALUE, RESULT\n */\nconst map = goog.NATIVE_ARRAY_PROTOTYPES &&\n        (ASSUME_NATIVE_FUNCTIONS || Array.prototype.map) ?\n    function(arr, f, opt_obj) {\n      asserts.assert(arr.length != null);\n\n      return Array.prototype.map.call(arr, f, opt_obj);\n    } :\n    function(arr, f, opt_obj) {\n      const l = arr.length;  // must be fixed during loop... see docs\n      const res = new Array(l);\n      const arr2 = (typeof arr === 'string') ? arr.split('') : arr;\n      for (let i = 0; i < l; i++) {\n        if (i in arr2) {\n          res[i] = f.call(/** @type {?} */ (opt_obj), arr2[i], i, arr);\n        }\n      }\n      return res;\n    };\nexports.map = map;\n\n\n/**\n * Passes every element of an array into a function and accumulates the result.\n *\n * See {@link http://tinyurl.com/developer-mozilla-org-array-reduce}\n * Note that this implementation differs from the native Array.prototype.reduce\n * in that the initial value is assumed to be defined (the MDN docs linked above\n * recommend not omitting this parameter, although it is technically optional).\n *\n * For example:\n * var a = [1, 2, 3, 4];\n * reduce(a, function(r, v, i, arr) {return r + v;}, 0);\n * returns 10\n *\n * @param {IArrayLike<T>|string} arr Array or array\n *     like object over which to iterate.\n * @param {function(this:S, R, T, number, ?) : R} f The function to call for\n *     every element. This function\n *     takes 4 arguments (the function's previous result or the initial value,\n *     the value of the current array element, the current array index, and the\n *     array itself)\n *     function(previousValue, currentValue, index, array).\n * @param {?} val The initial value to pass into the function on the first call.\n * @param {S=} opt_obj  The object to be used as the value of 'this'\n *     within f.\n * @return {R} Result of evaluating f repeatedly across the values of the array.\n * @template T,S,R\n */\nconst reduce = goog.NATIVE_ARRAY_PROTOTYPES &&\n        (ASSUME_NATIVE_FUNCTIONS || Array.prototype.reduce) ?\n    function(arr, f, val, opt_obj) {\n      asserts.assert(arr.length != null);\n      if (opt_obj) {\n        f = goog.bind(f, opt_obj);\n      }\n      return Array.prototype.reduce.call(arr, f, val);\n    } :\n    function(arr, f, val, opt_obj) {\n      let rval = val;\n      forEach(arr, function(val, index) {\n        rval = f.call(/** @type {?} */ (opt_obj), rval, val, index, arr);\n      });\n      return rval;\n    };\nexports.reduce = reduce;\n\n\n/**\n * Passes every element of an array into a function and accumulates the result,\n * starting from the last element and working towards the first.\n *\n * See {@link http://tinyurl.com/developer-mozilla-org-array-reduceright}\n *\n * For example:\n * var a = ['a', 'b', 'c'];\n * reduceRight(a, function(r, v, i, arr) {return r + v;}, '');\n * returns 'cba'\n *\n * @param {IArrayLike<T>|string} arr Array or array\n *     like object over which to iterate.\n * @param {?function(this:S, R, T, number, ?) : R} f The function to call for\n *     every element. This function\n *     takes 4 arguments (the function's previous result or the initial value,\n *     the value of the current array element, the current array index, and the\n *     array itself)\n *     function(previousValue, currentValue, index, array).\n * @param {?} val The initial value to pass into the function on the first call.\n * @param {S=} opt_obj The object to be used as the value of 'this'\n *     within f.\n * @return {R} Object returned as a result of evaluating f repeatedly across the\n *     values of the array.\n * @template T,S,R\n */\nconst reduceRight = goog.NATIVE_ARRAY_PROTOTYPES &&\n        (ASSUME_NATIVE_FUNCTIONS || Array.prototype.reduceRight) ?\n    function(arr, f, val, opt_obj) {\n      asserts.assert(arr.length != null);\n      asserts.assert(f != null);\n      if (opt_obj) {\n        f = goog.bind(f, opt_obj);\n      }\n      return Array.prototype.reduceRight.call(arr, f, val);\n    } :\n    function(arr, f, val, opt_obj) {\n      let rval = val;\n      forEachRight(arr, function(val, index) {\n        rval = f.call(/** @type {?} */ (opt_obj), rval, val, index, arr);\n      });\n      return rval;\n    };\nexports.reduceRight = reduceRight;\n\n\n/**\n * Calls f for each element of an array. If any call returns true, some()\n * returns true (without checking the remaining elements). If all calls\n * return false, some() returns false.\n *\n * See {@link http://tinyurl.com/developer-mozilla-org-array-some}\n *\n * @param {IArrayLike<T>|string} arr Array or array\n *     like object over which to iterate.\n * @param {?function(this:S, T, number, ?) : boolean} f The function to call for\n *     for every element. This function takes 3 arguments (the element, the\n *     index and the array) and should return a boolean.\n * @param {S=} opt_obj  The object to be used as the value of 'this'\n *     within f.\n * @return {boolean} true if any element passes the test.\n * @template T,S\n */\nconst some = goog.NATIVE_ARRAY_PROTOTYPES &&\n        (ASSUME_NATIVE_FUNCTIONS || Array.prototype.some) ?\n    function(arr, f, opt_obj) {\n      asserts.assert(arr.length != null);\n\n      return Array.prototype.some.call(arr, f, opt_obj);\n    } :\n    function(arr, f, opt_obj) {\n      const l = arr.length;  // must be fixed during loop... see docs\n      const arr2 = (typeof arr === 'string') ? arr.split('') : arr;\n      for (let i = 0; i < l; i++) {\n        if (i in arr2 && f.call(/** @type {?} */ (opt_obj), arr2[i], i, arr)) {\n          return true;\n        }\n      }\n      return false;\n    };\nexports.some = some;\n\n\n/**\n * Call f for each element of an array. If all calls return true, every()\n * returns true. If any call returns false, every() returns false and\n * does not continue to check the remaining elements.\n *\n * See {@link http://tinyurl.com/developer-mozilla-org-array-every}\n *\n * @param {IArrayLike<T>|string} arr Array or array\n *     like object over which to iterate.\n * @param {?function(this:S, T, number, ?) : boolean} f The function to call for\n *     for every element. This function takes 3 arguments (the element, the\n *     index and the array) and should return a boolean.\n * @param {S=} opt_obj The object to be used as the value of 'this'\n *     within f.\n * @return {boolean} false if any element fails the test.\n * @template T,S\n */\nconst every = goog.NATIVE_ARRAY_PROTOTYPES &&\n        (ASSUME_NATIVE_FUNCTIONS || Array.prototype.every) ?\n    function(arr, f, opt_obj) {\n      asserts.assert(arr.length != null);\n\n      return Array.prototype.every.call(arr, f, opt_obj);\n    } :\n    function(arr, f, opt_obj) {\n      const l = arr.length;  // must be fixed during loop... see docs\n      const arr2 = (typeof arr === 'string') ? arr.split('') : arr;\n      for (let i = 0; i < l; i++) {\n        if (i in arr2 && !f.call(/** @type {?} */ (opt_obj), arr2[i], i, arr)) {\n          return false;\n        }\n      }\n      return true;\n    };\nexports.every = every;\n\n\n/**\n * Counts the array elements that fulfill the predicate, i.e. for which the\n * callback function returns true. Skips holes in the array.\n *\n * @param {!IArrayLike<T>|string} arr Array or array like object\n *     over which to iterate.\n * @param {function(this: S, T, number, ?): boolean} f The function to call for\n *     every element. Takes 3 arguments (the element, the index and the array).\n * @param {S=} opt_obj The object to be used as the value of 'this' within f.\n * @return {number} The number of the matching elements.\n * @template T,S\n */\nfunction count(arr, f, opt_obj) {\n  let count = 0;\n  forEach(arr, function(element, index, arr) {\n    if (f.call(/** @type {?} */ (opt_obj), element, index, arr)) {\n      ++count;\n    }\n  }, opt_obj);\n  return count;\n}\nexports.count = count;\n\n\n/**\n * Search an array for the first element that satisfies a given condition and\n * return that element.\n * @param {IArrayLike<T>|string} arr Array or array\n *     like object over which to iterate.\n * @param {?function(this:S, T, number, ?) : boolean} f The function to call\n *     for every element. This function takes 3 arguments (the element, the\n *     index and the array) and should return a boolean.\n * @param {S=} opt_obj An optional \"this\" context for the function.\n * @return {T|null} The first array element that passes the test, or null if no\n *     element is found.\n * @template T,S\n */\nfunction find(arr, f, opt_obj) {\n  const i = findIndex(arr, f, opt_obj);\n  return i < 0 ? null : typeof arr === 'string' ? arr.charAt(i) : arr[i];\n}\nexports.find = find;\n\n\n/**\n * Search an array for the first element that satisfies a given condition and\n * return its index.\n * @param {IArrayLike<T>|string} arr Array or array\n *     like object over which to iterate.\n * @param {?function(this:S, T, number, ?) : boolean} f The function to call for\n *     every element. This function\n *     takes 3 arguments (the element, the index and the array) and should\n *     return a boolean.\n * @param {S=} opt_obj An optional \"this\" context for the function.\n * @return {number} The index of the first array element that passes the test,\n *     or -1 if no element is found.\n * @template T,S\n */\nfunction findIndex(arr, f, opt_obj) {\n  const l = arr.length;  // must be fixed during loop... see docs\n  const arr2 = (typeof arr === 'string') ? arr.split('') : arr;\n  for (let i = 0; i < l; i++) {\n    if (i in arr2 && f.call(/** @type {?} */ (opt_obj), arr2[i], i, arr)) {\n      return i;\n    }\n  }\n  return -1;\n}\nexports.findIndex = findIndex;\n\n\n/**\n * Search an array (in reverse order) for the last element that satisfies a\n * given condition and return that element.\n * @param {IArrayLike<T>|string} arr Array or array\n *     like object over which to iterate.\n * @param {?function(this:S, T, number, ?) : boolean} f The function to call\n *     for every element. This function\n *     takes 3 arguments (the element, the index and the array) and should\n *     return a boolean.\n * @param {S=} opt_obj An optional \"this\" context for the function.\n * @return {T|null} The last array element that passes the test, or null if no\n *     element is found.\n * @template T,S\n */\nfunction findRight(arr, f, opt_obj) {\n  const i = findIndexRight(arr, f, opt_obj);\n  return i < 0 ? null : typeof arr === 'string' ? arr.charAt(i) : arr[i];\n}\nexports.findRight = findRight;\n\n\n/**\n * Search an array (in reverse order) for the last element that satisfies a\n * given condition and return its index.\n * @param {IArrayLike<T>|string} arr Array or array\n *     like object over which to iterate.\n * @param {?function(this:S, T, number, ?) : boolean} f The function to call\n *     for every element. This function\n *     takes 3 arguments (the element, the index and the array) and should\n *     return a boolean.\n * @param {S=} opt_obj An optional \"this\" context for the function.\n * @return {number} The index of the last array element that passes the test,\n *     or -1 if no element is found.\n * @template T,S\n */\nfunction findIndexRight(arr, f, opt_obj) {\n  const l = arr.length;  // must be fixed during loop... see docs\n  const arr2 = (typeof arr === 'string') ? arr.split('') : arr;\n  for (let i = l - 1; i >= 0; i--) {\n    if (i in arr2 && f.call(/** @type {?} */ (opt_obj), arr2[i], i, arr)) {\n      return i;\n    }\n  }\n  return -1;\n}\nexports.findIndexRight = findIndexRight;\n\n\n/**\n * Whether the array contains the given object.\n * @param {IArrayLike<?>|string} arr The array to test for the presence of the\n *     element.\n * @param {*} obj The object for which to test.\n * @return {boolean} true if obj is present.\n */\nfunction contains(arr, obj) {\n  return indexOf(arr, obj) >= 0;\n}\nexports.contains = contains;\n\n\n/**\n * Whether the array is empty.\n * @param {IArrayLike<?>|string} arr The array to test.\n * @return {boolean} true if empty.\n */\nfunction isEmpty(arr) {\n  return arr.length == 0;\n}\nexports.isEmpty = isEmpty;\n\n\n/**\n * Clears the array.\n * @param {IArrayLike<?>} arr Array or array like object to clear.\n */\nfunction clear(arr) {\n  // For non real arrays we don't have the magic length so we delete the\n  // indices.\n  if (!Array.isArray(arr)) {\n    for (let i = arr.length - 1; i >= 0; i--) {\n      delete arr[i];\n    }\n  }\n  arr.length = 0;\n}\nexports.clear = clear;\n\n\n/**\n * Pushes an item into an array, if it's not already in the array.\n * @param {Array<T>} arr Array into which to insert the item.\n * @param {T} obj Value to add.\n * @template T\n */\nfunction insert(arr, obj) {\n  if (!contains(arr, obj)) {\n    arr.push(obj);\n  }\n}\nexports.insert = insert;\n\n\n/**\n * Inserts an object at the given index of the array.\n * @param {IArrayLike<?>} arr The array to modify.\n * @param {*} obj The object to insert.\n * @param {number=} opt_i The index at which to insert the object. If omitted,\n *      treated as 0. A negative index is counted from the end of the array.\n */\nfunction insertAt(arr, obj, opt_i) {\n  splice(arr, opt_i, 0, obj);\n}\nexports.insertAt = insertAt;\n\n\n/**\n * Inserts at the given index of the array, all elements of another array.\n * @param {IArrayLike<?>} arr The array to modify.\n * @param {IArrayLike<?>} elementsToAdd The array of elements to add.\n * @param {number=} opt_i The index at which to insert the object. If omitted,\n *      treated as 0. A negative index is counted from the end of the array.\n */\nfunction insertArrayAt(arr, elementsToAdd, opt_i) {\n  goog.partial(splice, arr, opt_i, 0).apply(null, elementsToAdd);\n}\nexports.insertArrayAt = insertArrayAt;\n\n\n/**\n * Inserts an object into an array before a specified object.\n * @param {Array<T>} arr The array to modify.\n * @param {T} obj The object to insert.\n * @param {T=} opt_obj2 The object before which obj should be inserted. If obj2\n *     is omitted or not found, obj is inserted at the end of the array.\n * @template T\n */\nfunction insertBefore(arr, obj, opt_obj2) {\n  let i;\n  if (arguments.length == 2 || (i = indexOf(arr, opt_obj2)) < 0) {\n    arr.push(obj);\n  } else {\n    insertAt(arr, obj, i);\n  }\n}\nexports.insertBefore = insertBefore;\n\n\n/**\n * Removes the first occurrence of a particular value from an array.\n * @param {IArrayLike<T>} arr Array from which to remove\n *     value.\n * @param {T} obj Object to remove.\n * @return {boolean} True if an element was removed.\n * @template T\n */\nfunction remove(arr, obj) {\n  const i = indexOf(arr, obj);\n  let rv;\n  if ((rv = i >= 0)) {\n    removeAt(arr, i);\n  }\n  return rv;\n}\nexports.remove = remove;\n\n\n/**\n * Removes the last occurrence of a particular value from an array.\n * @param {!IArrayLike<T>} arr Array from which to remove value.\n * @param {T} obj Object to remove.\n * @return {boolean} True if an element was removed.\n * @template T\n */\nfunction removeLast(arr, obj) {\n  const i = lastIndexOf(arr, obj);\n  if (i >= 0) {\n    removeAt(arr, i);\n    return true;\n  }\n  return false;\n}\nexports.removeLast = removeLast;\n\n\n/**\n * Removes from an array the element at index i\n * @param {IArrayLike<?>} arr Array or array like object from which to\n *     remove value.\n * @param {number} i The index to remove.\n * @return {boolean} True if an element was removed.\n */\nfunction removeAt(arr, i) {\n  asserts.assert(arr.length != null);\n\n  // use generic form of splice\n  // splice returns the removed items and if successful the length of that\n  // will be 1\n  return Array.prototype.splice.call(arr, i, 1).length == 1;\n}\nexports.removeAt = removeAt;\n\n\n/**\n * Removes the first value that satisfies the given condition.\n * @param {IArrayLike<T>} arr Array or array\n *     like object over which to iterate.\n * @param {?function(this:S, T, number, ?) : boolean} f The function to call\n *     for every element. This function\n *     takes 3 arguments (the element, the index and the array) and should\n *     return a boolean.\n * @param {S=} opt_obj An optional \"this\" context for the function.\n * @return {boolean} True if an element was removed.\n * @template T,S\n */\nfunction removeIf(arr, f, opt_obj) {\n  const i = findIndex(arr, f, opt_obj);\n  if (i >= 0) {\n    removeAt(arr, i);\n    return true;\n  }\n  return false;\n}\nexports.removeIf = removeIf;\n\n\n/**\n * Removes all values that satisfy the given condition.\n * @param {IArrayLike<T>} arr Array or array\n *     like object over which to iterate.\n * @param {?function(this:S, T, number, ?) : boolean} f The function to call\n *     for every element. This function\n *     takes 3 arguments (the element, the index and the array) and should\n *     return a boolean.\n * @param {S=} opt_obj An optional \"this\" context for the function.\n * @return {number} The number of items removed\n * @template T,S\n */\nfunction removeAllIf(arr, f, opt_obj) {\n  let removedCount = 0;\n  forEachRight(arr, function(val, index) {\n    if (f.call(/** @type {?} */ (opt_obj), val, index, arr)) {\n      if (removeAt(arr, index)) {\n        removedCount++;\n      }\n    }\n  });\n  return removedCount;\n}\nexports.removeAllIf = removeAllIf;\n\n\n/**\n * Returns a new array that is the result of joining the arguments.  If arrays\n * are passed then their items are added, however, if non-arrays are passed they\n * will be added to the return array as is.\n *\n * Note that ArrayLike objects will be added as is, rather than having their\n * items added.\n *\n * concat([1, 2], [3, 4]) -> [1, 2, 3, 4]\n * concat(0, [1, 2]) -> [0, 1, 2]\n * concat([1, 2], null) -> [1, 2, null]\n *\n * There is bug in all current versions of IE (6, 7 and 8) where arrays created\n * in an iframe become corrupted soon (not immediately) after the iframe is\n * destroyed. This is common if loading data via goog.net.IframeIo, for example.\n * This corruption only affects the concat method which will start throwing\n * Catastrophic Errors (#-2147418113).\n *\n * See http://endoflow.com/scratch/corrupted-arrays.html for a test case.\n *\n * Internally goog.array should use this, so that all methods will continue to\n * work on these broken array objects.\n *\n * @param {...*} var_args Items to concatenate.  Arrays will have each item\n *     added, while primitives and objects will be added as is.\n * @return {!Array<?>} The new resultant array.\n */\nfunction concat(var_args) {\n  return Array.prototype.concat.apply([], arguments);\n}\nexports.concat = concat;\n\n\n/**\n * Returns a new array that contains the contents of all the arrays passed.\n * @param {...!Array<T>} var_args\n * @return {!Array<T>}\n * @template T\n */\nfunction join(var_args) {\n  return Array.prototype.concat.apply([], arguments);\n}\nexports.join = join;\n\n\n/**\n * Converts an object to an array.\n * @param {IArrayLike<T>|string} object  The object to convert to an\n *     array.\n * @return {!Array<T>} The object converted into an array. If object has a\n *     length property, every property indexed with a non-negative number\n *     less than length will be included in the result. If object does not\n *     have a length property, an empty array will be returned.\n * @template T\n */\nfunction toArray(object) {\n  const length = object.length;\n\n  // If length is not a number the following is false. This case is kept for\n  // backwards compatibility since there are callers that pass objects that are\n  // not array like.\n  if (length > 0) {\n    const rv = new Array(length);\n    for (let i = 0; i < length; i++) {\n      rv[i] = object[i];\n    }\n    return rv;\n  }\n  return [];\n}\nexports.toArray = toArray;\n\n\n/**\n * Does a shallow copy of an array.\n * @param {IArrayLike<T>|string} arr  Array or array-like object to\n *     clone.\n * @return {!Array<T>} Clone of the input array.\n * @template T\n */\nconst clone = toArray;\nexports.clone = clone;\n\n\n/**\n * Extends an array with another array, element, or \"array like\" object.\n * This function operates 'in-place', it does not create a new Array.\n *\n * Example:\n * var a = [];\n * extend(a, [0, 1]);\n * a; // [0, 1]\n * extend(a, 2);\n * a; // [0, 1, 2]\n *\n * @param {Array<VALUE>} arr1  The array to modify.\n * @param {...(IArrayLike<VALUE>|VALUE)} var_args The elements or arrays of\n *     elements to add to arr1.\n * @template VALUE\n */\nfunction extend(arr1, var_args) {\n  for (let i = 1; i < arguments.length; i++) {\n    const arr2 = arguments[i];\n    if (goog.isArrayLike(arr2)) {\n      const len1 = arr1.length || 0;\n      const len2 = arr2.length || 0;\n      arr1.length = len1 + len2;\n      for (let j = 0; j < len2; j++) {\n        arr1[len1 + j] = arr2[j];\n      }\n    } else {\n      arr1.push(arr2);\n    }\n  }\n}\nexports.extend = extend;\n\n\n/**\n * Adds or removes elements from an array. This is a generic version of Array\n * splice. This means that it might work on other objects similar to arrays,\n * such as the arguments object.\n *\n * @param {IArrayLike<T>} arr The array to modify.\n * @param {number|undefined} index The index at which to start changing the\n *     array. If not defined, treated as 0.\n * @param {number} howMany How many elements to remove (0 means no removal. A\n *     value below 0 is treated as zero and so is any other non number. Numbers\n *     are floored).\n * @param {...T} var_args Optional, additional elements to insert into the\n *     array.\n * @return {!Array<T>} the removed elements.\n * @template T\n */\nfunction splice(arr, index, howMany, var_args) {\n  asserts.assert(arr.length != null);\n\n  return Array.prototype.splice.apply(arr, slice(arguments, 1));\n}\nexports.splice = splice;\n\n\n/**\n * Returns a new array from a segment of an array. This is a generic version of\n * Array slice. This means that it might work on other objects similar to\n * arrays, such as the arguments object.\n *\n * @param {IArrayLike<T>|string} arr The array from\n * which to copy a segment.\n * @param {number} start The index of the first element to copy.\n * @param {number=} opt_end The index after the last element to copy.\n * @return {!Array<T>} A new array containing the specified segment of the\n *     original array.\n * @template T\n */\nfunction slice(arr, start, opt_end) {\n  asserts.assert(arr.length != null);\n\n  // passing 1 arg to slice is not the same as passing 2 where the second is\n  // null or undefined (in that case the second argument is treated as 0).\n  // we could use slice on the arguments object and then use apply instead of\n  // testing the length\n  if (arguments.length <= 2) {\n    return Array.prototype.slice.call(arr, start);\n  } else {\n    return Array.prototype.slice.call(arr, start, opt_end);\n  }\n}\nexports.slice = slice;\n\n\n/**\n * Removes all duplicates from an array (retaining only the first\n * occurrence of each array element).  This function modifies the\n * array in place and doesn't change the order of the non-duplicate items.\n *\n * For objects, duplicates are identified as having the same unique ID as\n * defined by {@link goog.getUid}.\n *\n * Alternatively you can specify a custom hash function that returns a unique\n * value for each item in the array it should consider unique.\n *\n * Runtime: N,\n * Worstcase space: 2N (no dupes)\n *\n * @param {IArrayLike<T>} arr The array from which to remove\n *     duplicates.\n * @param {Array=} opt_rv An optional array in which to return the results,\n *     instead of performing the removal inplace.  If specified, the original\n *     array will remain unchanged.\n * @param {function(T):string=} opt_hashFn An optional function to use to\n *     apply to every item in the array. This function should return a unique\n *     value for each item in the array it should consider unique.\n * @template T\n */\nfunction removeDuplicates(arr, opt_rv, opt_hashFn) {\n  const returnArray = opt_rv || arr;\n  const defaultHashFn = function(item) {\n    // Prefix each type with a single character representing the type to\n    // prevent conflicting keys (e.g. true and 'true').\n    return goog.isObject(item) ? 'o' + goog.getUid(item) :\n                                 (typeof item).charAt(0) + item;\n  };\n  const hashFn = opt_hashFn || defaultHashFn;\n\n  let cursorInsert = 0;\n  let cursorRead = 0;\n  const seen = {};\n\n  while (cursorRead < arr.length) {\n    const current = arr[cursorRead++];\n    const key = hashFn(current);\n    if (!Object.prototype.hasOwnProperty.call(seen, key)) {\n      seen[key] = true;\n      returnArray[cursorInsert++] = current;\n    }\n  }\n  returnArray.length = cursorInsert;\n}\nexports.removeDuplicates = removeDuplicates;\n\n\n/**\n * Searches the specified array for the specified target using the binary\n * search algorithm.  If no opt_compareFn is specified, elements are compared\n * using <code>defaultCompare</code>, which compares the elements\n * using the built in < and > operators.  This will produce the expected\n * behavior for homogeneous arrays of String(s) and Number(s). The array\n * specified <b>must</b> be sorted in ascending order (as defined by the\n * comparison function).  If the array is not sorted, results are undefined.\n * If the array contains multiple instances of the specified target value, the\n * left-most instance will be found.\n *\n * Runtime: O(log n)\n *\n * @param {IArrayLike<VALUE>} arr The array to be searched.\n * @param {TARGET} target The sought value.\n * @param {function(TARGET, VALUE): number=} opt_compareFn Optional comparison\n *     function by which the array is ordered. Should take 2 arguments to\n *     compare, the target value and an element from your array, and return a\n *     negative number, zero, or a positive number depending on whether the\n *     first argument is less than, equal to, or greater than the second.\n * @return {number} Lowest index of the target value if found, otherwise\n *     (-(insertion point) - 1). The insertion point is where the value should\n *     be inserted into arr to preserve the sorted property.  Return value >= 0\n *     iff target is found.\n * @template TARGET, VALUE\n */\nfunction binarySearch(arr, target, opt_compareFn) {\n  return binarySearch_(\n      arr, opt_compareFn || defaultCompare, false /* isEvaluator */, target);\n}\nexports.binarySearch = binarySearch;\n\n\n/**\n * Selects an index in the specified array using the binary search algorithm.\n * The evaluator receives an element and determines whether the desired index\n * is before, at, or after it.  The evaluator must be consistent (formally,\n * map(map(arr, evaluator, opt_obj), goog.math.sign)\n * must be monotonically non-increasing).\n *\n * Runtime: O(log n)\n *\n * @param {IArrayLike<VALUE>} arr The array to be searched.\n * @param {function(this:THIS, VALUE, number, ?): number} evaluator\n *     Evaluator function that receives 3 arguments (the element, the index and\n *     the array). Should return a negative number, zero, or a positive number\n *     depending on whether the desired index is before, at, or after the\n *     element passed to it.\n * @param {THIS=} opt_obj The object to be used as the value of 'this'\n *     within evaluator.\n * @return {number} Index of the leftmost element matched by the evaluator, if\n *     such exists; otherwise (-(insertion point) - 1). The insertion point is\n *     the index of the first element for which the evaluator returns negative,\n *     or arr.length if no such element exists. The return value is non-negative\n *     iff a match is found.\n * @template THIS, VALUE\n */\nfunction binarySelect(arr, evaluator, opt_obj) {\n  return binarySearch_(\n      arr, evaluator, true /* isEvaluator */, undefined /* opt_target */,\n      opt_obj);\n}\nexports.binarySelect = binarySelect;\n\n\n/**\n * Implementation of a binary search algorithm which knows how to use both\n * comparison functions and evaluators. If an evaluator is provided, will call\n * the evaluator with the given optional data object, conforming to the\n * interface defined in binarySelect. Otherwise, if a comparison function is\n * provided, will call the comparison function against the given data object.\n *\n * This implementation purposefully does not use goog.bind or goog.partial for\n * performance reasons.\n *\n * Runtime: O(log n)\n *\n * @param {IArrayLike<?>} arr The array to be searched.\n * @param {function(?, ?, ?): number | function(?, ?): number} compareFn\n *     Either an evaluator or a comparison function, as defined by binarySearch\n *     and binarySelect above.\n * @param {boolean} isEvaluator Whether the function is an evaluator or a\n *     comparison function.\n * @param {?=} opt_target If the function is a comparison function, then\n *     this is the target to binary search for.\n * @param {Object=} opt_selfObj If the function is an evaluator, this is an\n *     optional this object for the evaluator.\n * @return {number} Lowest index of the target value if found, otherwise\n *     (-(insertion point) - 1). The insertion point is where the value should\n *     be inserted into arr to preserve the sorted property.  Return value >= 0\n *     iff target is found.\n * @private\n */\nfunction binarySearch_(arr, compareFn, isEvaluator, opt_target, opt_selfObj) {\n  let left = 0;            // inclusive\n  let right = arr.length;  // exclusive\n  let found;\n  while (left < right) {\n    const middle = left + ((right - left) >>> 1);\n    let compareResult;\n    if (isEvaluator) {\n      compareResult = compareFn.call(opt_selfObj, arr[middle], middle, arr);\n    } else {\n      // NOTE(dimvar): To avoid this cast, we'd have to use function overloading\n      // for the type of binarySearch_, which the type system can't express yet.\n      compareResult = /** @type {function(?, ?): number} */ (compareFn)(\n          opt_target, arr[middle]);\n    }\n    if (compareResult > 0) {\n      left = middle + 1;\n    } else {\n      right = middle;\n      // We are looking for the lowest index so we can't return immediately.\n      found = !compareResult;\n    }\n  }\n  // left is the index if found, or the insertion point otherwise.\n  // Avoiding bitwise not operator, as that causes a loss in precision for array\n  // indexes outside the bounds of a 32-bit signed integer.  Array indexes have\n  // a maximum value of 2^32-2 https://tc39.es/ecma262/#array-index\n  return found ? left : -left - 1;\n}\n\n\n/**\n * Sorts the specified array into ascending order.  If no opt_compareFn is\n * specified, elements are compared using\n * <code>defaultCompare</code>, which compares the elements using\n * the built in < and > operators.  This will produce the expected behavior\n * for homogeneous arrays of String(s) and Number(s), unlike the native sort,\n * but will give unpredictable results for heterogeneous lists of strings and\n * numbers with different numbers of digits.\n *\n * This sort is not guaranteed to be stable.\n *\n * Runtime: Same as `Array.prototype.sort`\n *\n * @param {Array<T>} arr The array to be sorted.\n * @param {?function(T,T):number=} opt_compareFn Optional comparison\n *     function by which the\n *     array is to be ordered. Should take 2 arguments to compare, and return a\n *     negative number, zero, or a positive number depending on whether the\n *     first argument is less than, equal to, or greater than the second.\n * @template T\n */\nfunction sort(arr, opt_compareFn) {\n  // TODO(arv): Update type annotation since null is not accepted.\n  arr.sort(opt_compareFn || defaultCompare);\n}\nexports.sort = sort;\n\n\n/**\n * Sorts the specified array into ascending order in a stable way.  If no\n * opt_compareFn is specified, elements are compared using\n * <code>defaultCompare</code>, which compares the elements using\n * the built in < and > operators.  This will produce the expected behavior\n * for homogeneous arrays of String(s) and Number(s).\n *\n * Runtime: Same as `Array.prototype.sort`, plus an additional\n * O(n) overhead of copying the array twice.\n *\n * @param {Array<T>} arr The array to be sorted.\n * @param {?function(T, T): number=} opt_compareFn Optional comparison function\n *     by which the array is to be ordered. Should take 2 arguments to compare,\n *     and return a negative number, zero, or a positive number depending on\n *     whether the first argument is less than, equal to, or greater than the\n *     second.\n * @template T\n */\nfunction stableSort(arr, opt_compareFn) {\n  const compArr = new Array(arr.length);\n  for (let i = 0; i < arr.length; i++) {\n    compArr[i] = {index: i, value: arr[i]};\n  }\n  const valueCompareFn = opt_compareFn || defaultCompare;\n  function stableCompareFn(obj1, obj2) {\n    return valueCompareFn(obj1.value, obj2.value) || obj1.index - obj2.index;\n  }\n  sort(compArr, stableCompareFn);\n  for (let i = 0; i < arr.length; i++) {\n    arr[i] = compArr[i].value;\n  }\n}\nexports.stableSort = stableSort;\n\n\n/**\n * Sort the specified array into ascending order based on item keys\n * returned by the specified key function.\n * If no opt_compareFn is specified, the keys are compared in ascending order\n * using <code>defaultCompare</code>.\n *\n * Runtime: O(S(f(n)), where S is runtime of <code>sort</code>\n * and f(n) is runtime of the key function.\n *\n * @param {Array<T>} arr The array to be sorted.\n * @param {function(T): K} keyFn Function taking array element and returning\n *     a key used for sorting this element.\n * @param {?function(K, K): number=} opt_compareFn Optional comparison function\n *     by which the keys are to be ordered. Should take 2 arguments to compare,\n *     and return a negative number, zero, or a positive number depending on\n *     whether the first argument is less than, equal to, or greater than the\n *     second.\n * @template T,K\n */\nfunction sortByKey(arr, keyFn, opt_compareFn) {\n  const keyCompareFn = opt_compareFn || defaultCompare;\n  sort(arr, function(a, b) {\n    return keyCompareFn(keyFn(a), keyFn(b));\n  });\n}\nexports.sortByKey = sortByKey;\n\n\n/**\n * Sorts an array of objects by the specified object key and compare\n * function. If no compare function is provided, the key values are\n * compared in ascending order using <code>defaultCompare</code>.\n * This won't work for keys that get renamed by the compiler. So use\n * {'foo': 1, 'bar': 2} rather than {foo: 1, bar: 2}.\n * @param {Array<Object>} arr An array of objects to sort.\n * @param {string} key The object key to sort by.\n * @param {Function=} opt_compareFn The function to use to compare key\n *     values.\n */\nfunction sortObjectsByKey(arr, key, opt_compareFn) {\n  sortByKey(arr, function(obj) {\n    return obj[key];\n  }, opt_compareFn);\n}\nexports.sortObjectsByKey = sortObjectsByKey;\n\n\n/**\n * Tells if the array is sorted.\n * @param {!IArrayLike<T>} arr The array.\n * @param {?function(T,T):number=} opt_compareFn Function to compare the\n *     array elements.\n *     Should take 2 arguments to compare, and return a negative number, zero,\n *     or a positive number depending on whether the first argument is less\n *     than, equal to, or greater than the second.\n * @param {boolean=} opt_strict If true no equal elements are allowed.\n * @return {boolean} Whether the array is sorted.\n * @template T\n */\nfunction isSorted(arr, opt_compareFn, opt_strict) {\n  const compare = opt_compareFn || defaultCompare;\n  for (let i = 1; i < arr.length; i++) {\n    const compareResult = compare(arr[i - 1], arr[i]);\n    if (compareResult > 0 || compareResult == 0 && opt_strict) {\n      return false;\n    }\n  }\n  return true;\n}\nexports.isSorted = isSorted;\n\n\n/**\n * Compares two arrays for equality. Two arrays are considered equal if they\n * have the same length and their corresponding elements are equal according to\n * the comparison function.\n *\n * @param {IArrayLike<A>} arr1 The first array to compare.\n * @param {IArrayLike<B>} arr2 The second array to compare.\n * @param {?function(A,B):boolean=} opt_equalsFn Optional comparison function.\n *     Should take 2 arguments to compare, and return true if the arguments\n *     are equal. Defaults to {@link goog.array.defaultCompareEquality} which\n *     compares the elements using the built-in '===' operator.\n * @return {boolean} Whether the two arrays are equal.\n * @template A\n * @template B\n */\nfunction equals(arr1, arr2, opt_equalsFn) {\n  if (!goog.isArrayLike(arr1) || !goog.isArrayLike(arr2) ||\n      arr1.length != arr2.length) {\n    return false;\n  }\n  const l = arr1.length;\n  const equalsFn = opt_equalsFn || defaultCompareEquality;\n  for (let i = 0; i < l; i++) {\n    if (!equalsFn(arr1[i], arr2[i])) {\n      return false;\n    }\n  }\n  return true;\n}\nexports.equals = equals;\n\n\n/**\n * 3-way array compare function.\n * @param {!IArrayLike<VALUE>} arr1 The first array to\n *     compare.\n * @param {!IArrayLike<VALUE>} arr2 The second array to\n *     compare.\n * @param {function(VALUE, VALUE): number=} opt_compareFn Optional comparison\n *     function by which the array is to be ordered. Should take 2 arguments to\n *     compare, and return a negative number, zero, or a positive number\n *     depending on whether the first argument is less than, equal to, or\n *     greater than the second.\n * @return {number} Negative number, zero, or a positive number depending on\n *     whether the first argument is less than, equal to, or greater than the\n *     second.\n * @template VALUE\n */\nfunction compare3(arr1, arr2, opt_compareFn) {\n  const compare = opt_compareFn || defaultCompare;\n  const l = Math.min(arr1.length, arr2.length);\n  for (let i = 0; i < l; i++) {\n    const result = compare(arr1[i], arr2[i]);\n    if (result != 0) {\n      return result;\n    }\n  }\n  return defaultCompare(arr1.length, arr2.length);\n}\nexports.compare3 = compare3;\n\n\n/**\n * Compares its two arguments for order, using the built in < and >\n * operators.\n * @param {VALUE} a The first object to be compared.\n * @param {VALUE} b The second object to be compared.\n * @return {number} A negative number, zero, or a positive number as the first\n *     argument is less than, equal to, or greater than the second,\n *     respectively.\n * @template VALUE\n */\nfunction defaultCompare(a, b) {\n  return a > b ? 1 : a < b ? -1 : 0;\n}\nexports.defaultCompare = defaultCompare;\n\n\n/**\n * Compares its two arguments for inverse order, using the built in < and >\n * operators.\n * @param {VALUE} a The first object to be compared.\n * @param {VALUE} b The second object to be compared.\n * @return {number} A negative number, zero, or a positive number as the first\n *     argument is greater than, equal to, or less than the second,\n *     respectively.\n * @template VALUE\n */\nfunction inverseDefaultCompare(a, b) {\n  return -defaultCompare(a, b);\n}\nexports.inverseDefaultCompare = inverseDefaultCompare;\n\n\n/**\n * Compares its two arguments for equality, using the built in === operator.\n * @param {*} a The first object to compare.\n * @param {*} b The second object to compare.\n * @return {boolean} True if the two arguments are equal, false otherwise.\n */\nfunction defaultCompareEquality(a, b) {\n  return a === b;\n}\nexports.defaultCompareEquality = defaultCompareEquality;\n\n\n/**\n * Inserts a value into a sorted array. The array is not modified if the\n * value is already present.\n * @param {IArrayLike<VALUE>} array The array to modify.\n * @param {VALUE} value The object to insert.\n * @param {function(VALUE, VALUE): number=} opt_compareFn Optional comparison\n *     function by which the array is ordered. Should take 2 arguments to\n *     compare, and return a negative number, zero, or a positive number\n *     depending on whether the first argument is less than, equal to, or\n *     greater than the second.\n * @return {boolean} True if an element was inserted.\n * @template VALUE\n */\nfunction binaryInsert(array, value, opt_compareFn) {\n  const index = binarySearch(array, value, opt_compareFn);\n  if (index < 0) {\n    insertAt(array, value, -(index + 1));\n    return true;\n  }\n  return false;\n}\nexports.binaryInsert = binaryInsert;\n\n\n/**\n * Removes a value from a sorted array.\n * @param {!IArrayLike<VALUE>} array The array to modify.\n * @param {VALUE} value The object to remove.\n * @param {function(VALUE, VALUE): number=} opt_compareFn Optional comparison\n *     function by which the array is ordered. Should take 2 arguments to\n *     compare, and return a negative number, zero, or a positive number\n *     depending on whether the first argument is less than, equal to, or\n *     greater than the second.\n * @return {boolean} True if an element was removed.\n * @template VALUE\n */\nfunction binaryRemove(array, value, opt_compareFn) {\n  const index = binarySearch(array, value, opt_compareFn);\n  return (index >= 0) ? removeAt(array, index) : false;\n}\nexports.binaryRemove = binaryRemove;\n\n\n/**\n * Splits an array into disjoint buckets according to a splitting function.\n * @param {IArrayLike<T>} array The array.\n * @param {function(this:S, T, number, !IArrayLike<T>):?} sorter Function to\n *     call for every element.  This takes 3 arguments (the element, the index\n *     and the array) and must return a valid object key (a string, number,\n *     etc), or undefined, if that object should not be placed in a bucket.\n * @param {S=} opt_obj The object to be used as the value of 'this' within\n *     sorter.\n * @return {!Object<!Array<T>>} An object, with keys being all of the unique\n *     return values of sorter, and values being arrays containing the items for\n *     which the splitter returned that key.\n * @template T,S\n */\nfunction bucket(array, sorter, opt_obj) {\n  const buckets = {};\n\n  for (let i = 0; i < array.length; i++) {\n    const value = array[i];\n    const key = sorter.call(/** @type {?} */ (opt_obj), value, i, array);\n    if (key !== undefined) {\n      // Push the value to the right bucket, creating it if necessary.\n      const bucket = buckets[key] || (buckets[key] = []);\n      bucket.push(value);\n    }\n  }\n\n  return buckets;\n}\nexports.bucket = bucket;\n\n\n/**\n * Splits an array into disjoint buckets according to a splitting function.\n * @param {!IArrayLike<V>} array The array.\n * @param {function(V, number, !IArrayLike<V>):(K|undefined)} sorter Function to\n *     call for every element.  This takes 3 arguments (the element, the index,\n *     and the array) and must return a value to use as a key, or undefined, if\n *     that object should not be placed in a bucket.\n * @return {!Map<K, !Array<V>>} A map, with keys being all of the unique\n *     return values of sorter, and values being arrays containing the items for\n *     which the splitter returned that key.\n * @template K,V\n */\nfunction bucketToMap(array, sorter) {\n  const /** !Map<K, !Array<V>> */ buckets = new Map();\n\n  for (let i = 0; i < array.length; i++) {\n    const value = array[i];\n    const key = sorter(value, i, array);\n    if (key !== undefined) {\n      // Push the value to the right bucket, creating it if necessary.\n      let bucket = buckets.get(key);\n      if (!bucket) {\n        bucket = [];\n        buckets.set(key, bucket);\n      }\n      bucket.push(value);\n    }\n  }\n\n  return buckets;\n}\nexports.bucketToMap = bucketToMap;\n\n\n/**\n * Creates a new object built from the provided array and the key-generation\n * function.\n * @param {IArrayLike<T>} arr Array or array like object over\n *     which to iterate whose elements will be the values in the new object.\n * @param {?function(this:S, T, number, ?) : string} keyFunc The function to\n *     call for every element. This function takes 3 arguments (the element, the\n *     index and the array) and should return a string that will be used as the\n *     key for the element in the new object. If the function returns the same\n *     key for more than one element, the value for that key is\n *     implementation-defined.\n * @param {S=} opt_obj The object to be used as the value of 'this'\n *     within keyFunc.\n * @return {!Object<T>} The new object.\n * @template T,S\n */\nfunction toObject(arr, keyFunc, opt_obj) {\n  const ret = {};\n  forEach(arr, function(element, index) {\n    ret[keyFunc.call(/** @type {?} */ (opt_obj), element, index, arr)] =\n        element;\n  });\n  return ret;\n}\nexports.toObject = toObject;\n\n\n/**\n * Creates a new ES6 Map built from the provided array and the key-generation\n * function.\n * @param {!IArrayLike<V>} arr Array or array like object over which to iterate\n *     whose elements will be the values in the new object.\n * @param {?function(V, number, ?) : K} keyFunc The function to call for every\n *     element. This function takes 3 arguments (the element, the index, and the\n *     array) and should return a value that will be used as the key for the\n *     element in the new object. If the function returns the same key for more\n *     than one element, the value for that key is implementation-defined.\n * @return {!Map<K, V>} The new map.\n * @template K,V\n */\nfunction toMap(arr, keyFunc) {\n  const /** !Map<K, V> */ map = new Map();\n\n  for (let i = 0; i < arr.length; i++) {\n    const element = arr[i];\n    map.set(keyFunc(element, i, arr), element);\n  }\n\n  return map;\n}\nexports.toMap = toMap;\n\n\n/**\n * Creates a range of numbers in an arithmetic progression.\n *\n * Range takes 1, 2, or 3 arguments:\n * <pre>\n * range(5) is the same as range(0, 5, 1) and produces [0, 1, 2, 3, 4]\n * range(2, 5) is the same as range(2, 5, 1) and produces [2, 3, 4]\n * range(-2, -5, -1) produces [-2, -3, -4]\n * range(-2, -5, 1) produces [], since stepping by 1 wouldn't ever reach -5.\n * </pre>\n *\n * @param {number} startOrEnd The starting value of the range if an end argument\n *     is provided. Otherwise, the start value is 0, and this is the end value.\n * @param {number=} opt_end The optional end value of the range.\n * @param {number=} opt_step The step size between range values. Defaults to 1\n *     if opt_step is undefined or 0.\n * @return {!Array<number>} An array of numbers for the requested range. May be\n *     an empty array if adding the step would not converge toward the end\n *     value.\n */\nfunction range(startOrEnd, opt_end, opt_step) {\n  const array = [];\n  let start = 0;\n  let end = startOrEnd;\n  const step = opt_step || 1;\n  if (opt_end !== undefined) {\n    start = startOrEnd;\n    end = opt_end;\n  }\n\n  if (step * (end - start) < 0) {\n    // Sign mismatch: start + step will never reach the end value.\n    return [];\n  }\n\n  if (step > 0) {\n    for (let i = start; i < end; i += step) {\n      array.push(i);\n    }\n  } else {\n    for (let i = start; i > end; i += step) {\n      array.push(i);\n    }\n  }\n  return array;\n}\nexports.range = range;\n\n\n/**\n * Returns an array consisting of the given value repeated N times.\n *\n * @param {VALUE} value The value to repeat.\n * @param {number} n The repeat count.\n * @return {!Array<VALUE>} An array with the repeated value.\n * @template VALUE\n */\nfunction repeat(value, n) {\n  const array = [];\n  for (let i = 0; i < n; i++) {\n    array[i] = value;\n  }\n  return array;\n}\nexports.repeat = repeat;\n\n\n/**\n * Returns an array consisting of every argument with all arrays\n * expanded in-place recursively.\n *\n * @param {...*} var_args The values to flatten.\n * @return {!Array<?>} An array containing the flattened values.\n */\nfunction flatten(var_args) {\n  const CHUNK_SIZE = 8192;\n\n  const result = [];\n  for (let i = 0; i < arguments.length; i++) {\n    const element = arguments[i];\n    if (Array.isArray(element)) {\n      for (let c = 0; c < element.length; c += CHUNK_SIZE) {\n        const chunk = slice(element, c, c + CHUNK_SIZE);\n        const recurseResult = flatten.apply(null, chunk);\n        for (let r = 0; r < recurseResult.length; r++) {\n          result.push(recurseResult[r]);\n        }\n      }\n    } else {\n      result.push(element);\n    }\n  }\n  return result;\n}\nexports.flatten = flatten;\n\n\n/**\n * Rotates an array in-place. After calling this method, the element at\n * index i will be the element previously at index (i - n) %\n * array.length, for all values of i between 0 and array.length - 1,\n * inclusive.\n *\n * For example, suppose list comprises [t, a, n, k, s]. After invoking\n * rotate(array, 1) (or rotate(array, -4)), array will comprise [s, t, a, n, k].\n *\n * @param {!Array<T>} array The array to rotate.\n * @param {number} n The amount to rotate.\n * @return {!Array<T>} The array.\n * @template T\n */\nfunction rotate(array, n) {\n  asserts.assert(array.length != null);\n\n  if (array.length) {\n    n %= array.length;\n    if (n > 0) {\n      Array.prototype.unshift.apply(array, array.splice(-n, n));\n    } else if (n < 0) {\n      Array.prototype.push.apply(array, array.splice(0, -n));\n    }\n  }\n  return array;\n}\nexports.rotate = rotate;\n\n\n/**\n * Moves one item of an array to a new position keeping the order of the rest\n * of the items. Example use case: keeping a list of JavaScript objects\n * synchronized with the corresponding list of DOM elements after one of the\n * elements has been dragged to a new position.\n * @param {!IArrayLike<?>} arr The array to modify.\n * @param {number} fromIndex Index of the item to move between 0 and\n *     `arr.length - 1`.\n * @param {number} toIndex Target index between 0 and `arr.length - 1`.\n */\nfunction moveItem(arr, fromIndex, toIndex) {\n  asserts.assert(fromIndex >= 0 && fromIndex < arr.length);\n  asserts.assert(toIndex >= 0 && toIndex < arr.length);\n  // Remove 1 item at fromIndex.\n  const removedItems = Array.prototype.splice.call(arr, fromIndex, 1);\n  // Insert the removed item at toIndex.\n  Array.prototype.splice.call(arr, toIndex, 0, removedItems[0]);\n  // We don't use goog.array.insertAt and goog.array.removeAt, because they're\n  // significantly slower than splice.\n}\nexports.moveItem = moveItem;\n\n\n/**\n * Creates a new array for which the element at position i is an array of the\n * ith element of the provided arrays.  The returned array will only be as long\n * as the shortest array provided; additional values are ignored.  For example,\n * the result of zipping [1, 2] and [3, 4, 5] is [[1,3], [2, 4]].\n *\n * This is similar to the zip() function in Python.  See {@link\n * http://docs.python.org/library/functions.html#zip}\n *\n * @param {...!IArrayLike<?>} var_args Arrays to be combined.\n * @return {!Array<!Array<?>>} A new array of arrays created from\n *     provided arrays.\n */\nfunction zip(var_args) {\n  if (!arguments.length) {\n    return [];\n  }\n  const result = [];\n  let minLen = arguments[0].length;\n  for (let i = 1; i < arguments.length; i++) {\n    if (arguments[i].length < minLen) {\n      minLen = arguments[i].length;\n    }\n  }\n  for (let i = 0; i < minLen; i++) {\n    const value = [];\n    for (let j = 0; j < arguments.length; j++) {\n      value.push(arguments[j][i]);\n    }\n    result.push(value);\n  }\n  return result;\n}\nexports.zip = zip;\n\n\n/**\n * Shuffles the values in the specified array using the Fisher-Yates in-place\n * shuffle (also known as the Knuth Shuffle). By default, calls Math.random()\n * and so resets the state of that random number generator. Similarly, may reset\n * the state of any other specified random number generator.\n *\n * Runtime: O(n)\n *\n * @param {!Array<?>} arr The array to be shuffled.\n * @param {function():number=} opt_randFn Optional random function to use for\n *     shuffling.\n *     Takes no arguments, and returns a random number on the interval [0, 1).\n *     Defaults to Math.random() using JavaScript's built-in Math library.\n */\nfunction shuffle(arr, opt_randFn) {\n  const randFn = opt_randFn || Math.random;\n\n  for (let i = arr.length - 1; i > 0; i--) {\n    // Choose a random array index in [0, i] (inclusive with i).\n    const j = Math.floor(randFn() * (i + 1));\n\n    const tmp = arr[i];\n    arr[i] = arr[j];\n    arr[j] = tmp;\n  }\n}\nexports.shuffle = shuffle;\n\n\n/**\n * Returns a new array of elements from arr, based on the indexes of elements\n * provided by index_arr. For example, the result of index copying\n * ['a', 'b', 'c'] with index_arr [1,0,0,2] is ['b', 'a', 'a', 'c'].\n *\n * @param {!IArrayLike<T>} arr The array to get a indexed copy from.\n * @param {!IArrayLike<number>} index_arr An array of indexes to get from arr.\n * @return {!Array<T>} A new array of elements from arr in index_arr order.\n * @template T\n */\nfunction copyByIndex(arr, index_arr) {\n  const result = [];\n  forEach(index_arr, function(index) {\n    result.push(arr[index]);\n  });\n  return result;\n}\nexports.copyByIndex = copyByIndex;\n\n\n/**\n * Maps each element of the input array into zero or more elements of the output\n * array.\n *\n * @param {!IArrayLike<VALUE>|string} arr Array or array like object\n *     over which to iterate.\n * @param {function(this:THIS, VALUE, number, ?): !Array<RESULT>} f The function\n *     to call for every element. This function takes 3 arguments (the element,\n *     the index and the array) and should return an array. The result will be\n *     used to extend a new array.\n * @param {THIS=} opt_obj The object to be used as the value of 'this' within f.\n * @return {!Array<RESULT>} a new array with the concatenation of all arrays\n *     returned from f.\n * @template THIS, VALUE, RESULT\n */\nfunction concatMap(arr, f, opt_obj) {\n  return concat.apply([], map(arr, f, opt_obj));\n}\nexports.concatMap = concatMap;\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview A base class for event objects.\n */\n\n\ngoog.provide('goog.events.Event');\n\n/**\n * goog.events.Event no longer depends on goog.Disposable. Keep requiring\n * goog.Disposable here to not break projects which assume this dependency.\n * @suppress {extraRequire}\n */\ngoog.require('goog.Disposable');\ngoog.require('goog.events.EventId');\n\n\n/**\n * A base class for event objects, so that they can support preventDefault and\n * stopPropagation.\n *\n * @param {string|!goog.events.EventId} type Event Type.\n * @param {Object=} opt_target Reference to the object that is the target of\n *     this event. It has to implement the `EventTarget` interface\n *     declared at {@link http://developer.mozilla.org/en/DOM/EventTarget}.\n * @constructor\n */\ngoog.events.Event = function(type, opt_target) {\n  'use strict';\n  /**\n   * Event type.\n   * @type {string}\n   */\n  this.type = type instanceof goog.events.EventId ? String(type) : type;\n\n  /**\n   * TODO(tbreisacher): The type should probably be\n   * EventTarget|goog.events.EventTarget.\n   *\n   * Target of the event.\n   * @type {Object|undefined}\n   */\n  this.target = opt_target;\n\n  /**\n   * Object that had the listener attached.\n   * @type {Object|undefined}\n   */\n  this.currentTarget = this.target;\n\n  /**\n   * Whether to cancel the event in internal capture/bubble processing for IE.\n   * @type {boolean}\n   * @private\n   */\n  this.propagationStopped_ = false;\n\n  /**\n   * Whether the default action has been prevented.\n   * This is a property to match the W3C specification at\n   * {@link http://www.w3.org/TR/DOM-Level-3-Events/\n   * #events-event-type-defaultPrevented}.\n   * Must be treated as read-only outside the class.\n   * @type {boolean}\n   */\n  this.defaultPrevented = false;\n};\n\n/**\n * @return {boolean} true iff internal propagation has been stopped.\n */\ngoog.events.Event.prototype.hasPropagationStopped = function() {\n  'use strict';\n  return this.propagationStopped_;\n};\n\n/**\n * Stops event propagation.\n * @return {void}\n */\ngoog.events.Event.prototype.stopPropagation = function() {\n  'use strict';\n  this.propagationStopped_ = true;\n};\n\n\n/**\n * Prevents the default action, for example a link redirecting to a url.\n * @return {void}\n */\ngoog.events.Event.prototype.preventDefault = function() {\n  'use strict';\n  this.defaultPrevented = true;\n};\n\n\n/**\n * Stops the propagation of the event. It is equivalent to\n * `e.stopPropagation()`, but can be used as the callback argument of\n * {@link goog.events.listen} without declaring another function.\n * @param {!goog.events.Event} e An event.\n * @return {void}\n */\ngoog.events.Event.stopPropagation = function(e) {\n  'use strict';\n  e.stopPropagation();\n};\n\n\n/**\n * Prevents the default action. It is equivalent to\n * `e.preventDefault()`, but can be used as the callback argument of\n * {@link goog.events.listen} without declaring another function.\n * @param {!goog.events.Event} e An event.\n * @return {void}\n */\ngoog.events.Event.preventDefault = function(e) {\n  'use strict';\n  e.preventDefault();\n};\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Browser capability checks for the events package.\n */\n\ngoog.module('goog.events.BrowserFeature');\ngoog.module.declareLegacyNamespace();\n\n\n/**\n * Tricks Closure Compiler into believing that a function is pure.  The compiler\n * assumes that any `valueOf` function is pure, without analyzing its contents.\n *\n * @param {function(): T} fn\n * @return {T}\n * @template T\n */\nconst purify = (fn) => {\n  return ({valueOf: fn}).valueOf();\n};\n\n\n/**\n * Enum of browser capabilities.\n * @enum {boolean}\n */\nexports = {\n  /**\n   * Whether touch is enabled in the browser.\n   */\n  TOUCH_ENABLED:\n      ('ontouchstart' in goog.global ||\n       !!(goog.global['document'] && document.documentElement &&\n          'ontouchstart' in document.documentElement) ||\n       // IE10 uses non-standard touch events, so it has a different check.\n       !!(goog.global['navigator'] &&\n          (goog.global['navigator']['maxTouchPoints'] ||\n           goog.global['navigator']['msMaxTouchPoints']))),\n\n  /**\n   * Whether addEventListener supports W3C standard pointer events.\n   * http://www.w3.org/TR/pointerevents/\n   */\n  POINTER_EVENTS: ('PointerEvent' in goog.global),\n\n  /**\n   * Whether addEventListener supports MSPointer events (only used in IE10).\n   * http://msdn.microsoft.com/en-us/library/ie/hh772103(v=vs.85).aspx\n   * http://msdn.microsoft.com/library/hh673557(v=vs.85).aspx\n   */\n  MSPOINTER_EVENTS:\n      ('MSPointerEvent' in goog.global &&\n       !!(goog.global['navigator'] &&\n          goog.global['navigator']['msPointerEnabled'])),\n\n  /**\n   * Whether addEventListener supports {passive: true}.\n   * https://developers.google.com/web/updates/2016/06/passive-event-listeners\n   */\n  PASSIVE_EVENTS: purify(function() {\n    // If we're in a web worker or other custom environment, we can't tell.\n    if (!goog.global.addEventListener || !Object.defineProperty) {  // IE 8\n      return false;\n    }\n\n    var passive = false;\n    var options = Object.defineProperty({}, 'passive', {\n      get: function() {\n        passive = true;\n      }\n    });\n    try {\n      goog.global.addEventListener('test', goog.nullFunction, options);\n      goog.global.removeEventListener('test', goog.nullFunction, options);\n    } catch (e) {\n    }\n\n    return passive;\n  })\n};\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview String functions called from Closure packages that couldn't\n * depend on each other. Outside Closure, use goog.string function which\n * delegate to these.\n */\n\n\ngoog.provide('goog.string.internal');\n\n\n/**\n * Fast prefix-checker.\n * @param {string} str The string to check.\n * @param {string} prefix A string to look for at the start of `str`.\n * @return {boolean} True if `str` begins with `prefix`.\n * @see goog.string.startsWith\n */\ngoog.string.internal.startsWith = function(str, prefix) {\n  'use strict';\n  return str.lastIndexOf(prefix, 0) == 0;\n};\n\n\n/**\n * Fast suffix-checker.\n * @param {string} str The string to check.\n * @param {string} suffix A string to look for at the end of `str`.\n * @return {boolean} True if `str` ends with `suffix`.\n * @see goog.string.endsWith\n */\ngoog.string.internal.endsWith = function(str, suffix) {\n  'use strict';\n  const l = str.length - suffix.length;\n  return l >= 0 && str.indexOf(suffix, l) == l;\n};\n\n\n/**\n * Case-insensitive prefix-checker.\n * @param {string} str The string to check.\n * @param {string} prefix  A string to look for at the end of `str`.\n * @return {boolean} True if `str` begins with `prefix` (ignoring\n *     case).\n * @see goog.string.caseInsensitiveStartsWith\n */\ngoog.string.internal.caseInsensitiveStartsWith = function(str, prefix) {\n  'use strict';\n  return goog.string.internal.caseInsensitiveCompare(\n             prefix, str.substr(0, prefix.length)) == 0;\n};\n\n\n/**\n * Case-insensitive suffix-checker.\n * @param {string} str The string to check.\n * @param {string} suffix A string to look for at the end of `str`.\n * @return {boolean} True if `str` ends with `suffix` (ignoring\n *     case).\n * @see goog.string.caseInsensitiveEndsWith\n */\ngoog.string.internal.caseInsensitiveEndsWith = function(str, suffix) {\n  'use strict';\n  return (\n      goog.string.internal.caseInsensitiveCompare(\n          suffix, str.substr(str.length - suffix.length, suffix.length)) == 0);\n};\n\n\n/**\n * Case-insensitive equality checker.\n * @param {string} str1 First string to check.\n * @param {string} str2 Second string to check.\n * @return {boolean} True if `str1` and `str2` are the same string,\n *     ignoring case.\n * @see goog.string.caseInsensitiveEquals\n */\ngoog.string.internal.caseInsensitiveEquals = function(str1, str2) {\n  'use strict';\n  return str1.toLowerCase() == str2.toLowerCase();\n};\n\n\n/**\n * Checks if a string is empty or contains only whitespaces.\n * @param {string} str The string to check.\n * @return {boolean} Whether `str` is empty or whitespace only.\n * @see goog.string.isEmptyOrWhitespace\n */\ngoog.string.internal.isEmptyOrWhitespace = function(str) {\n  'use strict';\n  // testing length == 0 first is actually slower in all browsers (about the\n  // same in Opera).\n  // Since IE doesn't include non-breaking-space (0xa0) in their \\s character\n  // class (as required by section 7.2 of the ECMAScript spec), we explicitly\n  // include it in the regexp to enforce consistent cross-browser behavior.\n  return /^[\\s\\xa0]*$/.test(str);\n};\n\n\n/**\n * Trims white spaces to the left and right of a string.\n * @param {string} str The string to trim.\n * @return {string} A trimmed copy of `str`.\n */\ngoog.string.internal.trim =\n    (goog.TRUSTED_SITE && String.prototype.trim) ? function(str) {\n      'use strict';\n      return str.trim();\n    } : function(str) {\n      'use strict';\n      // Since IE doesn't include non-breaking-space (0xa0) in their \\s\n      // character class (as required by section 7.2 of the ECMAScript spec),\n      // we explicitly include it in the regexp to enforce consistent\n      // cross-browser behavior.\n      // NOTE: We don't use String#replace because it might have side effects\n      // causing this function to not compile to 0 bytes.\n      return /^[\\s\\xa0]*([\\s\\S]*?)[\\s\\xa0]*$/.exec(str)[1];\n    };\n\n\n/**\n * A string comparator that ignores case.\n * -1 = str1 less than str2\n *  0 = str1 equals str2\n *  1 = str1 greater than str2\n *\n * @param {string} str1 The string to compare.\n * @param {string} str2 The string to compare `str1` to.\n * @return {number} The comparator result, as described above.\n * @see goog.string.caseInsensitiveCompare\n */\ngoog.string.internal.caseInsensitiveCompare = function(str1, str2) {\n  'use strict';\n  const test1 = String(str1).toLowerCase();\n  const test2 = String(str2).toLowerCase();\n\n  if (test1 < test2) {\n    return -1;\n  } else if (test1 == test2) {\n    return 0;\n  } else {\n    return 1;\n  }\n};\n\n\n/**\n * Converts \\n to <br>s or <br />s.\n * @param {string} str The string in which to convert newlines.\n * @param {boolean=} opt_xml Whether to use XML compatible tags.\n * @return {string} A copy of `str` with converted newlines.\n * @see goog.string.newLineToBr\n */\ngoog.string.internal.newLineToBr = function(str, opt_xml) {\n  'use strict';\n  return str.replace(/(\\r\\n|\\r|\\n)/g, opt_xml ? '<br />' : '<br>');\n};\n\n\n/**\n * Escapes double quote '\"' and single quote '\\'' characters in addition to\n * '&', '<', and '>' so that a string can be included in an HTML tag attribute\n * value within double or single quotes.\n * @param {string} str string to be escaped.\n * @param {boolean=} opt_isLikelyToContainHtmlChars\n * @return {string} An escaped copy of `str`.\n * @see goog.string.htmlEscape\n */\ngoog.string.internal.htmlEscape = function(\n    str, opt_isLikelyToContainHtmlChars) {\n  'use strict';\n  if (opt_isLikelyToContainHtmlChars) {\n    str = str.replace(goog.string.internal.AMP_RE_, '&amp;')\n              .replace(goog.string.internal.LT_RE_, '&lt;')\n              .replace(goog.string.internal.GT_RE_, '&gt;')\n              .replace(goog.string.internal.QUOT_RE_, '&quot;')\n              .replace(goog.string.internal.SINGLE_QUOTE_RE_, '&#39;')\n              .replace(goog.string.internal.NULL_RE_, '&#0;');\n    return str;\n\n  } else {\n    // quick test helps in the case when there are no chars to replace, in\n    // worst case this makes barely a difference to the time taken\n    if (!goog.string.internal.ALL_RE_.test(str)) return str;\n\n    // str.indexOf is faster than regex.test in this case\n    if (str.indexOf('&') != -1) {\n      str = str.replace(goog.string.internal.AMP_RE_, '&amp;');\n    }\n    if (str.indexOf('<') != -1) {\n      str = str.replace(goog.string.internal.LT_RE_, '&lt;');\n    }\n    if (str.indexOf('>') != -1) {\n      str = str.replace(goog.string.internal.GT_RE_, '&gt;');\n    }\n    if (str.indexOf('\"') != -1) {\n      str = str.replace(goog.string.internal.QUOT_RE_, '&quot;');\n    }\n    if (str.indexOf('\\'') != -1) {\n      str = str.replace(goog.string.internal.SINGLE_QUOTE_RE_, '&#39;');\n    }\n    if (str.indexOf('\\x00') != -1) {\n      str = str.replace(goog.string.internal.NULL_RE_, '&#0;');\n    }\n    return str;\n  }\n};\n\n\n/**\n * Regular expression that matches an ampersand, for use in escaping.\n * @const {!RegExp}\n * @private\n */\ngoog.string.internal.AMP_RE_ = /&/g;\n\n\n/**\n * Regular expression that matches a less than sign, for use in escaping.\n * @const {!RegExp}\n * @private\n */\ngoog.string.internal.LT_RE_ = /</g;\n\n\n/**\n * Regular expression that matches a greater than sign, for use in escaping.\n * @const {!RegExp}\n * @private\n */\ngoog.string.internal.GT_RE_ = />/g;\n\n\n/**\n * Regular expression that matches a double quote, for use in escaping.\n * @const {!RegExp}\n * @private\n */\ngoog.string.internal.QUOT_RE_ = /\"/g;\n\n\n/**\n * Regular expression that matches a single quote, for use in escaping.\n * @const {!RegExp}\n * @private\n */\ngoog.string.internal.SINGLE_QUOTE_RE_ = /'/g;\n\n\n/**\n * Regular expression that matches null character, for use in escaping.\n * @const {!RegExp}\n * @private\n */\ngoog.string.internal.NULL_RE_ = /\\x00/g;\n\n\n/**\n * Regular expression that matches any character that needs to be escaped.\n * @const {!RegExp}\n * @private\n */\ngoog.string.internal.ALL_RE_ = /[\\x00&<>\"']/;\n\n\n/**\n * Do escaping of whitespace to preserve spatial formatting. We use character\n * entity #160 to make it safer for xml.\n * @param {string} str The string in which to escape whitespace.\n * @param {boolean=} opt_xml Whether to use XML compatible tags.\n * @return {string} An escaped copy of `str`.\n * @see goog.string.whitespaceEscape\n */\ngoog.string.internal.whitespaceEscape = function(str, opt_xml) {\n  'use strict';\n  // This doesn't use goog.string.preserveSpaces for backwards compatibility.\n  return goog.string.internal.newLineToBr(\n      str.replace(/  /g, ' &#160;'), opt_xml);\n};\n\n\n/**\n * Determines whether a string contains a substring.\n * @param {string} str The string to search.\n * @param {string} subString The substring to search for.\n * @return {boolean} Whether `str` contains `subString`.\n * @see goog.string.contains\n */\ngoog.string.internal.contains = function(str, subString) {\n  'use strict';\n  return str.indexOf(subString) != -1;\n};\n\n\n/**\n * Determines whether a string contains a substring, ignoring case.\n * @param {string} str The string to search.\n * @param {string} subString The substring to search for.\n * @return {boolean} Whether `str` contains `subString`.\n * @see goog.string.caseInsensitiveContains\n */\ngoog.string.internal.caseInsensitiveContains = function(str, subString) {\n  'use strict';\n  return goog.string.internal.contains(\n      str.toLowerCase(), subString.toLowerCase());\n};\n\n\n/**\n * Compares two version numbers.\n *\n * @param {string|number} version1 Version of first item.\n * @param {string|number} version2 Version of second item.\n *\n * @return {number}  1 if `version1` is higher.\n *                   0 if arguments are equal.\n *                  -1 if `version2` is higher.\n * @see goog.string.compareVersions\n */\ngoog.string.internal.compareVersions = function(version1, version2) {\n  'use strict';\n  let order = 0;\n  // Trim leading and trailing whitespace and split the versions into\n  // subversions.\n  const v1Subs = goog.string.internal.trim(String(version1)).split('.');\n  const v2Subs = goog.string.internal.trim(String(version2)).split('.');\n  const subCount = Math.max(v1Subs.length, v2Subs.length);\n\n  // Iterate over the subversions, as long as they appear to be equivalent.\n  for (let subIdx = 0; order == 0 && subIdx < subCount; subIdx++) {\n    let v1Sub = v1Subs[subIdx] || '';\n    let v2Sub = v2Subs[subIdx] || '';\n\n    do {\n      // Split the subversions into pairs of numbers and qualifiers (like 'b').\n      // Two different RegExp objects are use to make it clear the code\n      // is side-effect free\n      const v1Comp = /(\\d*)(\\D*)(.*)/.exec(v1Sub) || ['', '', '', ''];\n      const v2Comp = /(\\d*)(\\D*)(.*)/.exec(v2Sub) || ['', '', '', ''];\n      // Break if there are no more matches.\n      if (v1Comp[0].length == 0 && v2Comp[0].length == 0) {\n        break;\n      }\n\n      // Parse the numeric part of the subversion. A missing number is\n      // equivalent to 0.\n      const v1CompNum = v1Comp[1].length == 0 ? 0 : parseInt(v1Comp[1], 10);\n      const v2CompNum = v2Comp[1].length == 0 ? 0 : parseInt(v2Comp[1], 10);\n\n      // Compare the subversion components. The number has the highest\n      // precedence. Next, if the numbers are equal, a subversion without any\n      // qualifier is always higher than a subversion with any qualifier. Next,\n      // the qualifiers are compared as strings.\n      order = goog.string.internal.compareElements_(v1CompNum, v2CompNum) ||\n          goog.string.internal.compareElements_(\n              v1Comp[2].length == 0, v2Comp[2].length == 0) ||\n          goog.string.internal.compareElements_(v1Comp[2], v2Comp[2]);\n      // Stop as soon as an inequality is discovered.\n\n      v1Sub = v1Comp[3];\n      v2Sub = v2Comp[3];\n    } while (order == 0);\n  }\n\n  return order;\n};\n\n\n/**\n * Compares elements of a version number.\n *\n * @param {string|number|boolean} left An element from a version number.\n * @param {string|number|boolean} right An element from a version number.\n *\n * @return {number}  1 if `left` is higher.\n *                   0 if arguments are equal.\n *                  -1 if `right` is higher.\n * @private\n */\ngoog.string.internal.compareElements_ = function(left, right) {\n  'use strict';\n  if (left < right) {\n    return -1;\n  } else if (left > right) {\n    return 1;\n  }\n  return 0;\n};\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Utilities used by goog.labs.userAgent tools. These functions\n * should not be used outside of goog.labs.userAgent.*.\n *\n */\n\ngoog.module('goog.labs.userAgent.util');\ngoog.module.declareLegacyNamespace();\n\nconst {USE_CLIENT_HINTS} = goog.require('goog.labs.userAgent');\nconst {caseInsensitiveContains, contains} = goog.require('goog.string.internal');\n\n/**\n * @const {boolean} If true, use navigator.userAgentData without check.\n * TODO(user): FEATURESET_YEAR >= 2023 if it supports mobile and all the\n * brands we need.  See https://caniuse.com/mdn-api_navigator_useragentdata.\n */\nconst ASSUME_CLIENT_HINTS_SUPPORT = false;\n\n/**\n * Gets the native userAgent string from navigator if it exists.\n * If navigator or navigator.userAgent string is missing, returns an empty\n * string.\n * @return {string}\n */\nfunction getNativeUserAgentString() {\n  const navigator = getNavigator();\n  if (navigator) {\n    const userAgent = navigator.userAgent;\n    if (userAgent) {\n      return userAgent;\n    }\n  }\n  return '';\n}\n\n/**\n * Gets the native userAgentData object from navigator if it exists.\n * If navigator.userAgentData object is missing or USE_CLIENT_HINTS is set to\n * false, returns null.\n * @return {?NavigatorUAData}\n */\nfunction getNativeUserAgentData() {\n  if (!USE_CLIENT_HINTS) {\n    return null;\n  }\n  const navigator = getNavigator();\n  // TODO(user): Use navigator?.userAgent ?? null once it's supported.\n  if (navigator) {\n    return navigator.userAgentData || null;\n  }\n  return null;\n}\n\n/**\n * Getter for the native navigator.\n * @return {!Navigator}\n */\nfunction getNavigator() {\n  return goog.global.navigator;\n}\n\n/**\n * A possible override for applications which wish to not check\n * navigator.userAgent but use a specified value for detection instead.\n * @type {?string}\n */\nlet userAgentInternal = null;\n\n/**\n * A possible override for applications which wish to not check\n * navigator.userAgentData but use a specified value for detection instead.\n * @type {?NavigatorUAData}\n */\nlet userAgentDataInternal = getNativeUserAgentData();\n\n/**\n * Override the user agent string with the given value.\n * This should only be used for testing within the goog.labs.userAgent\n * namespace.\n * Pass `null` to use the native browser object instead.\n * @param {?string=} userAgent The userAgent override.\n * @return {void}\n */\nfunction setUserAgent(userAgent = undefined) {\n  userAgentInternal =\n      typeof userAgent === 'string' ? userAgent : getNativeUserAgentString();\n}\n\n/** @return {string} The user agent string. */\nfunction getUserAgent() {\n  return userAgentInternal == null ? getNativeUserAgentString() :\n                                     userAgentInternal;\n}\n\n/**\n * Override the user agent data object with the given value.\n * This should only be used for testing within the goog.labs.userAgent\n * namespace.\n * Pass `null` to specify the absence of userAgentData. Note that this behavior\n * is different from setUserAgent.\n * @param {?NavigatorUAData} userAgentData The userAgentData override.\n */\nfunction setUserAgentData(userAgentData) {\n  userAgentDataInternal = userAgentData;\n}\n\n/**\n * If the user agent data object was overridden using setUserAgentData,\n * reset it so that it uses the native browser object instead, if it exists.\n */\nfunction resetUserAgentData() {\n  userAgentDataInternal = getNativeUserAgentData();\n}\n\n/** @return {?NavigatorUAData} Navigator.userAgentData if exist */\nfunction getUserAgentData() {\n  return userAgentDataInternal;\n}\n\n/**\n * Checks if any string in userAgentData.brands matches str.\n * Returns false if userAgentData is not supported.\n * @param {string} str\n * @return {boolean} Whether any brand string from userAgentData contains the\n *     given string.\n */\nfunction matchUserAgentDataBrand(str) {\n  const data = getUserAgentData();\n  if (!data) return false;\n  return data.brands.some(({brand}) => brand && contains(brand, str));\n}\n\n/**\n * @param {string} str\n * @return {boolean} Whether the user agent contains the given string.\n */\nfunction matchUserAgent(str) {\n  const userAgent = getUserAgent();\n  return contains(userAgent, str);\n}\n\n/**\n * @param {string} str\n * @return {boolean} Whether the user agent contains the given string, ignoring\n *     case.\n */\nfunction matchUserAgentIgnoreCase(str) {\n  const userAgent = getUserAgent();\n  return caseInsensitiveContains(userAgent, str);\n}\n\n/**\n * Parses the user agent into tuples for each section.\n * @param {string} userAgent\n * @return {!Array<!Array<string>>} Tuples of key, version, and the contents of\n *     the parenthetical.\n */\nfunction extractVersionTuples(userAgent) {\n  // Matches each section of a user agent string.\n  // Example UA:\n  // Mozilla/5.0 (iPad; U; CPU OS 3_2_1 like Mac OS X; en-us)\n  // AppleWebKit/531.21.10 (KHTML, like Gecko) Mobile/7B405\n  // This has three version tuples: Mozilla, AppleWebKit, and Mobile.\n\n  const versionRegExp = new RegExp(\n      // Key. Note that a key may have a space.\n      // (i.e. 'Mobile Safari' in 'Mobile Safari/5.0')\n      '([A-Z][\\\\w ]+)' +\n\n          '/' +                // slash\n          '([^\\\\s]+)' +        // version (i.e. '5.0b')\n          '\\\\s*' +             // whitespace\n          '(?:\\\\((.*?)\\\\))?',  // parenthetical info. parentheses not matched.\n      'g');\n\n  const data = [];\n  let match;\n\n  // Iterate and collect the version tuples.  Each iteration will be the\n  // next regex match.\n  while (match = versionRegExp.exec(userAgent)) {\n    data.push([\n      match[1],  // key\n      match[2],  // value\n      // || undefined as this is not undefined in IE7 and IE8\n      match[3] || undefined  // info\n    ]);\n  }\n\n  return data;\n}\n\nexports = {\n  ASSUME_CLIENT_HINTS_SUPPORT,\n  extractVersionTuples,\n  getNativeUserAgentString,\n  getUserAgent,\n  getUserAgentData,\n  matchUserAgent,\n  matchUserAgentDataBrand,\n  matchUserAgentIgnoreCase,\n  resetUserAgentData,\n  setUserAgent,\n  setUserAgentData,\n};\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Useful compiler idioms.\n */\n\ngoog.provide('goog.reflect');\n\n\n/**\n * Syntax for object literal casts.\n * @see http://go/jscompiler-renaming\n * @see https://goo.gl/CRs09P\n *\n * Use this if you have an object literal whose keys need to have the same names\n * as the properties of some class even after they are renamed by the compiler.\n *\n * @param {!Function} type Type to cast to.\n * @param {Object} object Object literal to cast.\n * @return {Object} The object literal.\n */\ngoog.reflect.object = function(type, object) {\n  'use strict';\n  return object;\n};\n\n/**\n * Syntax for renaming property strings.\n * @see http://go/jscompiler-renaming\n * @see https://goo.gl/CRs09P\n *\n * Use this if you have an need to access a property as a string, but want\n * to also have the property renamed by the compiler. In contrast to\n * goog.reflect.object, this method takes an instance of an object.\n *\n * Properties must be simple names (not qualified names).\n *\n * @param {string} prop Name of the property\n * @param {!Object} object Instance of the object whose type will be used\n *     for renaming\n * @return {string} The renamed property.\n */\ngoog.reflect.objectProperty = function(prop, object) {\n  'use strict';\n  return prop;\n};\n\n/**\n * To assert to the compiler that an operation is needed when it would\n * otherwise be stripped. For example:\n * <code>\n *     // Force a layout\n *     goog.reflect.sinkValue(dialog.offsetHeight);\n * </code>\n * @param {T} x\n * @return {T}\n * @template T\n */\ngoog.reflect.sinkValue = function(x) {\n  'use strict';\n  goog.reflect.sinkValue[' '](x);\n  return x;\n};\n\n\n/**\n * The compiler should optimize this function away iff no one ever uses\n * goog.reflect.sinkValue.\n */\ngoog.reflect.sinkValue[' '] = goog.nullFunction;\n\n\n/**\n * Check if a property can be accessed without throwing an exception.\n * @param {Object} obj The owner of the property.\n * @param {string} prop The property name.\n * @return {boolean} Whether the property is accessible. Will also return true\n *     if obj is null.\n */\ngoog.reflect.canAccessProperty = function(obj, prop) {\n  'use strict';\n  try {\n    goog.reflect.sinkValue(obj[prop]);\n    return true;\n  } catch (e) {\n  }\n  return false;\n};\n\n\n/**\n * Retrieves a value from a cache given a key. The compiler provides special\n * consideration for this call such that it is generally considered side-effect\n * free. However, if the `opt_keyFn` or `valueFn` have side-effects\n * then the entire call is considered to have side-effects.\n *\n * Conventionally storing the value on the cache would be considered a\n * side-effect and preclude unused calls from being pruned, ie. even if\n * the value was never used, it would still always be stored in the cache.\n *\n * Providing a side-effect free `valueFn` and `opt_keyFn`\n * allows unused calls to `goog.reflect.cache` to be pruned.\n *\n * @param {!Object<K, V>} cacheObj The object that contains the cached values.\n * @param {?} key The key to lookup in the cache. If it is not string or number\n *     then a `opt_keyFn` should be provided. The key is also used as the\n *     parameter to the `valueFn`.\n * @param {function(?):V} valueFn The value provider to use to calculate the\n *     value to store in the cache. This function should be side-effect free\n *     to take advantage of the optimization.\n * @param {function(?):K=} opt_keyFn The key provider to determine the cache\n *     map key. This should be used if the given key is not a string or number.\n *     If not provided then the given key is used. This function should be\n *     side-effect free to take advantage of the optimization.\n * @return {V} The cached or calculated value.\n * @template K\n * @template V\n */\ngoog.reflect.cache = function(cacheObj, key, valueFn, opt_keyFn) {\n  'use strict';\n  const storedKey = opt_keyFn ? opt_keyFn(key) : key;\n\n  if (Object.prototype.hasOwnProperty.call(cacheObj, storedKey)) {\n    return cacheObj[storedKey];\n  }\n\n  return (cacheObj[storedKey] = valueFn(key));\n};\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Rendering engine detection.\n * @see <a href=\"http://www.useragentstring.com/\">User agent strings</a>\n * For information on the browser brand (such as Safari versus Chrome), see\n * goog.userAgent.product.\n * @see ../demos/useragent.html\n */\n\ngoog.provide('goog.userAgent');\n\ngoog.require('goog.labs.userAgent.browser');\ngoog.require('goog.labs.userAgent.engine');\ngoog.require('goog.labs.userAgent.platform');\ngoog.require('goog.labs.userAgent.util');\ngoog.require('goog.reflect');\ngoog.require('goog.string.internal');\n\n\n/**\n * @define {boolean} Whether we know at compile-time that the browser is IE.\n */\ngoog.userAgent.ASSUME_IE = goog.define('goog.userAgent.ASSUME_IE', false);\n\n\n/**\n * @define {boolean} Whether we know at compile-time that the browser is EDGE,\n * referring to EdgeHTML based Edge.\n */\ngoog.userAgent.ASSUME_EDGE = goog.define('goog.userAgent.ASSUME_EDGE', false);\n\n\n/**\n * @define {boolean} Whether we know at compile-time that the browser is GECKO.\n */\ngoog.userAgent.ASSUME_GECKO = goog.define('goog.userAgent.ASSUME_GECKO', false);\n\n\n/**\n * @define {boolean} Whether we know at compile-time that the browser is WEBKIT.\n */\ngoog.userAgent.ASSUME_WEBKIT =\n    goog.define('goog.userAgent.ASSUME_WEBKIT', false);\n\n\n/**\n * @define {boolean} Whether we know at compile-time that the browser is a\n *     mobile device running WebKit e.g. iPhone or Android.\n */\ngoog.userAgent.ASSUME_MOBILE_WEBKIT =\n    goog.define('goog.userAgent.ASSUME_MOBILE_WEBKIT', false);\n\n\n/**\n * @define {boolean} Whether we know at compile-time that the browser is OPERA,\n * referring to Presto-based Opera.\n */\ngoog.userAgent.ASSUME_OPERA = goog.define('goog.userAgent.ASSUME_OPERA', false);\n\n\n/**\n * @define {boolean} Whether the\n *     `goog.userAgent.isVersionOrHigher`\n *     function will return true for any version.\n */\ngoog.userAgent.ASSUME_ANY_VERSION =\n    goog.define('goog.userAgent.ASSUME_ANY_VERSION', false);\n\n\n/**\n * Whether we know the browser engine at compile-time.\n * @type {boolean}\n * @private\n */\ngoog.userAgent.BROWSER_KNOWN_ = goog.userAgent.ASSUME_IE ||\n    goog.userAgent.ASSUME_EDGE || goog.userAgent.ASSUME_GECKO ||\n    goog.userAgent.ASSUME_MOBILE_WEBKIT || goog.userAgent.ASSUME_WEBKIT ||\n    goog.userAgent.ASSUME_OPERA;\n\n\n/**\n * Returns the userAgent string for the current browser.\n *\n * @return {string} The userAgent string.\n */\ngoog.userAgent.getUserAgentString = function() {\n  'use strict';\n  return goog.labs.userAgent.util.getUserAgent();\n};\n\n\n/**\n * @return {?Navigator} The native navigator object.\n */\ngoog.userAgent.getNavigatorTyped = function() {\n  'use strict';\n  // Need a local navigator reference instead of using the global one,\n  // to avoid the rare case where they reference different objects.\n  // (in a WorkerPool, for example).\n  return goog.global['navigator'] || null;\n};\n\n\n/**\n * TODO(nnaze): Change type to \"Navigator\" and update compilation targets.\n * @return {?Object} The native navigator object.\n */\ngoog.userAgent.getNavigator = function() {\n  'use strict';\n  return goog.userAgent.getNavigatorTyped();\n};\n\n\n/**\n * Whether the user agent is Presto-based Opera.\n * @type {boolean}\n */\ngoog.userAgent.OPERA = goog.userAgent.BROWSER_KNOWN_ ?\n    goog.userAgent.ASSUME_OPERA :\n    goog.labs.userAgent.browser.isOpera();\n\n\n/**\n * Whether the user agent is Internet Explorer.\n * @type {boolean}\n */\ngoog.userAgent.IE = goog.userAgent.BROWSER_KNOWN_ ?\n    goog.userAgent.ASSUME_IE :\n    goog.labs.userAgent.browser.isIE();\n\n\n/**\n * Whether the user agent is Microsoft Edge (EdgeHTML based).\n * @type {boolean}\n */\ngoog.userAgent.EDGE = goog.userAgent.BROWSER_KNOWN_ ?\n    goog.userAgent.ASSUME_EDGE :\n    goog.labs.userAgent.engine.isEdge();\n\n\n/**\n * Whether the user agent is MS Internet Explorer or MS Edge (EdgeHTML based).\n * @type {boolean}\n */\ngoog.userAgent.EDGE_OR_IE = goog.userAgent.EDGE || goog.userAgent.IE;\n\n\n/**\n * Whether the user agent is Gecko. Gecko is the rendering engine used by\n * Mozilla, Firefox, and others.\n * @type {boolean}\n */\ngoog.userAgent.GECKO = goog.userAgent.BROWSER_KNOWN_ ?\n    goog.userAgent.ASSUME_GECKO :\n    goog.labs.userAgent.engine.isGecko();\n\n\n/**\n * Whether the user agent is WebKit. WebKit is the rendering engine that\n * Safari, Edge Chromium, Opera Chromium, Android and others use.\n * @type {boolean}\n */\ngoog.userAgent.WEBKIT = goog.userAgent.BROWSER_KNOWN_ ?\n    goog.userAgent.ASSUME_WEBKIT || goog.userAgent.ASSUME_MOBILE_WEBKIT :\n    goog.labs.userAgent.engine.isWebKit();\n\n\n/**\n * Whether the user agent is running on a mobile device.\n *\n * This is a separate function so that the logic can be tested.\n *\n * TODO(nnaze): Investigate swapping in goog.labs.userAgent.device.isMobile().\n *\n * @return {boolean} Whether the user agent is running on a mobile device.\n * @private\n */\ngoog.userAgent.isMobile_ = function() {\n  'use strict';\n  return goog.userAgent.WEBKIT &&\n      goog.labs.userAgent.util.matchUserAgent('Mobile');\n};\n\n\n/**\n * Whether the user agent is running on a mobile device.\n *\n * TODO(nnaze): Consider deprecating MOBILE when labs.userAgent\n *   is promoted as the gecko/webkit logic is likely inaccurate.\n *\n * @type {boolean}\n */\ngoog.userAgent.MOBILE =\n    goog.userAgent.ASSUME_MOBILE_WEBKIT || goog.userAgent.isMobile_();\n\n\n/**\n * Used while transitioning code to use WEBKIT instead.\n * @type {boolean}\n * @deprecated Use {@link goog.userAgent.product.SAFARI} instead.\n * TODO(nicksantos): Delete this from goog.userAgent.\n */\ngoog.userAgent.SAFARI = goog.userAgent.WEBKIT;\n\n\n/**\n * @return {string} the platform (operating system) the user agent is running\n *     on. Default to empty string because navigator.platform may not be defined\n *     (on Rhino, for example).\n * @private\n */\ngoog.userAgent.determinePlatform_ = function() {\n  'use strict';\n  var navigator = goog.userAgent.getNavigatorTyped();\n  return navigator && navigator.platform || '';\n};\n\n\n/**\n * The platform (operating system) the user agent is running on. Default to\n * empty string because navigator.platform may not be defined (on Rhino, for\n * example).\n * @type {string}\n */\ngoog.userAgent.PLATFORM = goog.userAgent.determinePlatform_();\n\n\n/**\n * @define {boolean} Whether the user agent is running on a Macintosh operating\n *     system.\n */\ngoog.userAgent.ASSUME_MAC = goog.define('goog.userAgent.ASSUME_MAC', false);\n\n\n/**\n * @define {boolean} Whether the user agent is running on a Windows operating\n *     system.\n */\ngoog.userAgent.ASSUME_WINDOWS =\n    goog.define('goog.userAgent.ASSUME_WINDOWS', false);\n\n\n/**\n * @define {boolean} Whether the user agent is running on a Linux operating\n *     system.\n */\ngoog.userAgent.ASSUME_LINUX = goog.define('goog.userAgent.ASSUME_LINUX', false);\n\n\n/**\n * @define {boolean} Whether the user agent is running on a X11 windowing\n *     system.\n */\ngoog.userAgent.ASSUME_X11 = goog.define('goog.userAgent.ASSUME_X11', false);\n\n\n/**\n * @define {boolean} Whether the user agent is running on Android.\n */\ngoog.userAgent.ASSUME_ANDROID =\n    goog.define('goog.userAgent.ASSUME_ANDROID', false);\n\n\n/**\n * @define {boolean} Whether the user agent is running on an iPhone.\n */\ngoog.userAgent.ASSUME_IPHONE =\n    goog.define('goog.userAgent.ASSUME_IPHONE', false);\n\n\n/**\n * @define {boolean} Whether the user agent is running on an iPad.\n */\ngoog.userAgent.ASSUME_IPAD = goog.define('goog.userAgent.ASSUME_IPAD', false);\n\n\n/**\n * @define {boolean} Whether the user agent is running on an iPod.\n */\ngoog.userAgent.ASSUME_IPOD = goog.define('goog.userAgent.ASSUME_IPOD', false);\n\n\n/**\n * @define {boolean} Whether the user agent is running on KaiOS.\n */\ngoog.userAgent.ASSUME_KAIOS = goog.define('goog.userAgent.ASSUME_KAIOS', false);\n\n\n/**\n * @type {boolean}\n * @private\n */\ngoog.userAgent.PLATFORM_KNOWN_ = goog.userAgent.ASSUME_MAC ||\n    goog.userAgent.ASSUME_WINDOWS || goog.userAgent.ASSUME_LINUX ||\n    goog.userAgent.ASSUME_X11 || goog.userAgent.ASSUME_ANDROID ||\n    goog.userAgent.ASSUME_IPHONE || goog.userAgent.ASSUME_IPAD ||\n    goog.userAgent.ASSUME_IPOD;\n\n\n/**\n * Whether the user agent is running on a Macintosh operating system.\n * @type {boolean}\n */\ngoog.userAgent.MAC = goog.userAgent.PLATFORM_KNOWN_ ?\n    goog.userAgent.ASSUME_MAC :\n    goog.labs.userAgent.platform.isMacintosh();\n\n\n/**\n * Whether the user agent is running on a Windows operating system.\n * @type {boolean}\n */\ngoog.userAgent.WINDOWS = goog.userAgent.PLATFORM_KNOWN_ ?\n    goog.userAgent.ASSUME_WINDOWS :\n    goog.labs.userAgent.platform.isWindows();\n\n\n/**\n * Whether the user agent is Linux per the legacy behavior of\n * goog.userAgent.LINUX, which considered ChromeOS to also be\n * Linux.\n * @return {boolean}\n * @private\n */\ngoog.userAgent.isLegacyLinux_ = function() {\n  'use strict';\n  return goog.labs.userAgent.platform.isLinux() ||\n      goog.labs.userAgent.platform.isChromeOS();\n};\n\n\n/**\n * Whether the user agent is running on a Linux operating system.\n *\n * Note that goog.userAgent.LINUX considers ChromeOS to be Linux,\n * while goog.labs.userAgent.platform considers ChromeOS and\n * Linux to be different OSes.\n *\n * @type {boolean}\n */\ngoog.userAgent.LINUX = goog.userAgent.PLATFORM_KNOWN_ ?\n    goog.userAgent.ASSUME_LINUX :\n    goog.userAgent.isLegacyLinux_();\n\n\n/**\n * @return {boolean} Whether the user agent is an X11 windowing system.\n * @private\n */\ngoog.userAgent.isX11_ = function() {\n  'use strict';\n  var navigator = goog.userAgent.getNavigatorTyped();\n  return !!navigator &&\n      goog.string.internal.contains(navigator['appVersion'] || '', 'X11');\n};\n\n\n/**\n * Whether the user agent is running on a X11 windowing system.\n * @type {boolean}\n */\ngoog.userAgent.X11 = goog.userAgent.PLATFORM_KNOWN_ ?\n    goog.userAgent.ASSUME_X11 :\n    goog.userAgent.isX11_();\n\n\n/**\n * Whether the user agent is running on Android.\n * @type {boolean}\n */\ngoog.userAgent.ANDROID = goog.userAgent.PLATFORM_KNOWN_ ?\n    goog.userAgent.ASSUME_ANDROID :\n    goog.labs.userAgent.platform.isAndroid();\n\n\n/**\n * Whether the user agent is running on an iPhone.\n * @type {boolean}\n */\ngoog.userAgent.IPHONE = goog.userAgent.PLATFORM_KNOWN_ ?\n    goog.userAgent.ASSUME_IPHONE :\n    goog.labs.userAgent.platform.isIphone();\n\n\n/**\n * Whether the user agent is running on an iPad.\n * @type {boolean}\n */\ngoog.userAgent.IPAD = goog.userAgent.PLATFORM_KNOWN_ ?\n    goog.userAgent.ASSUME_IPAD :\n    goog.labs.userAgent.platform.isIpad();\n\n\n/**\n * Whether the user agent is running on an iPod.\n * @type {boolean}\n */\ngoog.userAgent.IPOD = goog.userAgent.PLATFORM_KNOWN_ ?\n    goog.userAgent.ASSUME_IPOD :\n    goog.labs.userAgent.platform.isIpod();\n\n\n/**\n * Whether the user agent is running on iOS.\n * @type {boolean}\n */\ngoog.userAgent.IOS = goog.userAgent.PLATFORM_KNOWN_ ?\n    (goog.userAgent.ASSUME_IPHONE || goog.userAgent.ASSUME_IPAD ||\n     goog.userAgent.ASSUME_IPOD) :\n    goog.labs.userAgent.platform.isIos();\n\n/**\n * Whether the user agent is running on KaiOS.\n * @type {boolean}\n */\ngoog.userAgent.KAIOS = goog.userAgent.PLATFORM_KNOWN_ ?\n    goog.userAgent.ASSUME_KAIOS :\n    goog.labs.userAgent.platform.isKaiOS();\n\n\n/**\n * @return {string} The string that describes the version number of the user\n *     agent.\n * @private\n */\ngoog.userAgent.determineVersion_ = function() {\n  'use strict';\n  // All browsers have different ways to detect the version and they all have\n  // different naming schemes.\n  // version is a string rather than a number because it may contain 'b', 'a',\n  // and so on.\n  var version = '';\n  var arr = goog.userAgent.getVersionRegexResult_();\n  if (arr) {\n    version = arr ? arr[1] : '';\n  }\n\n  if (goog.userAgent.IE) {\n    // IE9 can be in document mode 9 but be reporting an inconsistent user agent\n    // version.  If it is identifying as a version lower than 9 we take the\n    // documentMode as the version instead.  IE8 has similar behavior.\n    // It is recommended to set the X-UA-Compatible header to ensure that IE9\n    // uses documentMode 9.\n    var docMode = goog.userAgent.getDocumentMode_();\n    if (docMode != null && docMode > parseFloat(version)) {\n      return String(docMode);\n    }\n  }\n\n  return version;\n};\n\n\n/**\n * @return {?IArrayLike<string>|undefined} The version regex matches from\n *     parsing the user\n *     agent string. These regex statements must be executed inline so they can\n *     be compiled out by the closure compiler with the rest of the useragent\n *     detection logic when ASSUME_* is specified.\n * @private\n */\ngoog.userAgent.getVersionRegexResult_ = function() {\n  'use strict';\n  var userAgent = goog.userAgent.getUserAgentString();\n  if (goog.userAgent.GECKO) {\n    return /rv\\:([^\\);]+)(\\)|;)/.exec(userAgent);\n  }\n  if (goog.userAgent.EDGE) {\n    return /Edge\\/([\\d\\.]+)/.exec(userAgent);\n  }\n  if (goog.userAgent.IE) {\n    return /\\b(?:MSIE|rv)[: ]([^\\);]+)(\\)|;)/.exec(userAgent);\n  }\n  if (goog.userAgent.WEBKIT) {\n    // WebKit/125.4\n    return /WebKit\\/(\\S+)/.exec(userAgent);\n  }\n  if (goog.userAgent.OPERA) {\n    // If none of the above browsers were detected but the browser is Opera, the\n    // only string that is of interest is 'Version/<number>'.\n    return /(?:Version)[ \\/]?(\\S+)/.exec(userAgent);\n  }\n  return undefined;\n};\n\n\n/**\n * @return {number|undefined} Returns the document mode (for testing).\n * @private\n */\ngoog.userAgent.getDocumentMode_ = function() {\n  'use strict';\n  // NOTE(user): goog.userAgent may be used in context where there is no DOM.\n  var doc = goog.global['document'];\n  return doc ? doc['documentMode'] : undefined;\n};\n\n\n/**\n * The version of the user agent. This is a string because it might contain\n * 'b' (as in beta) as well as multiple dots.\n * @type {string}\n */\ngoog.userAgent.VERSION = goog.userAgent.determineVersion_();\n\n\n/**\n * Compares two version numbers.\n *\n * @param {string} v1 Version of first item.\n * @param {string} v2 Version of second item.\n *\n * @return {number}  1 if first argument is higher\n *                   0 if arguments are equal\n *                  -1 if second argument is higher.\n * @deprecated Use goog.string.compareVersions.\n */\ngoog.userAgent.compare = function(v1, v2) {\n  'use strict';\n  return goog.string.internal.compareVersions(v1, v2);\n};\n\n\n/**\n * Cache for {@link goog.userAgent.isVersionOrHigher}.\n * Calls to compareVersions are surprisingly expensive and, as a browser's\n * version number is unlikely to change during a session, we cache the results.\n * @const\n * @private\n */\ngoog.userAgent.isVersionOrHigherCache_ = {};\n\n\n/**\n * Whether the user agent version is higher or the same as the given version.\n * NOTE: When checking the version numbers for Firefox and Safari, be sure to\n * use the engine's version, not the browser's version number.  For example,\n * Firefox 3.0 corresponds to Gecko 1.9 and Safari 3.0 to Webkit 522.11.\n * Opera and Internet Explorer versions match the product release number.<br>\n * @see <a href=\"http://en.wikipedia.org/wiki/Safari_version_history\">\n *     Webkit</a>\n * @see <a href=\"http://en.wikipedia.org/wiki/Gecko_engine\">Gecko</a>\n *\n * @param {string|number} version The version to check.\n * @return {boolean} Whether the user agent version is higher or the same as\n *     the given version.\n */\ngoog.userAgent.isVersionOrHigher = function(version) {\n  'use strict';\n  return goog.userAgent.ASSUME_ANY_VERSION ||\n      goog.reflect.cache(\n          goog.userAgent.isVersionOrHigherCache_, version, function() {\n            'use strict';\n            return goog.string.internal.compareVersions(\n                       goog.userAgent.VERSION, version) >= 0;\n          });\n};\n\n\n/**\n * Whether the IE effective document mode is higher or the same as the given\n * document mode version.\n * NOTE: Only for IE, return false for another browser.\n *\n * @param {number} documentMode The document mode version to check.\n * @return {boolean} Whether the IE effective document mode is higher or the\n *     same as the given version.\n */\ngoog.userAgent.isDocumentModeOrHigher = function(documentMode) {\n  'use strict';\n  return Number(goog.userAgent.DOCUMENT_MODE) >= documentMode;\n};\n\n\n/**\n * Deprecated alias to `goog.userAgent.isDocumentModeOrHigher`.\n * @param {number} version The version to check.\n * @return {boolean} Whether the IE effective document mode is higher or the\n *      same as the given version.\n * @deprecated Use goog.userAgent.isDocumentModeOrHigher().\n */\ngoog.userAgent.isDocumentMode = goog.userAgent.isDocumentModeOrHigher;\n\n\n/**\n * For IE version < 7, documentMode is undefined, so attempt to use the\n * CSS1Compat property to see if we are in standards mode. If we are in\n * standards mode, treat the browser version as the document mode. Otherwise,\n * IE is emulating version 5.\n *\n * NOTE(user): Support for IE < 7 is long gone, so this is now simplified.\n * It returns document.documentMode for IE and undefined for everything else.\n *\n * @type {number|undefined}\n * @const\n */\ngoog.userAgent.DOCUMENT_MODE = (function() {\n  'use strict';\n  var doc = goog.global['document'];\n  if (!doc || !goog.userAgent.IE) return undefined;\n  // This must be an IE user agent.\n  var documentMode = goog.userAgent.getDocumentMode_();\n  if (documentMode) return documentMode;\n  // The user agent version string begins with the major version.\n  // Parse the major version and truncate anything following.\n  var ieVersion = parseInt(goog.userAgent.VERSION, 10);\n  return ieVersion || undefined;\n})();\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Closure user agent detection (Browser).\n * @see <a href=\"http://www.useragentstring.com/\">User agent strings</a>\n * For more information on rendering engine, platform, or device see the other\n * sub-namespaces in goog.labs.userAgent, goog.labs.userAgent.platform,\n * goog.labs.userAgent.device respectively.)\n */\n\ngoog.module('goog.labs.userAgent.browser');\ngoog.module.declareLegacyNamespace();\n\nconst googAsserts = goog.require('goog.asserts');\nconst util = goog.require('goog.labs.userAgent.util');\nconst {AsyncValue, Version} = goog.require('goog.labs.userAgent.highEntropy.highEntropyValue');\nconst {compareVersions} = goog.require('goog.string.internal');\nconst {fullVersionList, hasFullVersionList} = goog.require('goog.labs.userAgent.highEntropy.highEntropyData');\n\n// TODO(nnaze): Refactor to remove excessive exclusion logic in matching\n// functions.\n\n/**\n * A browser brand represents an opaque string that is used for making\n * brand-specific version checks in userAgentData.\n * @enum {string}\n */\nconst Brand = {\n  /**\n   * The browser brand for Android Browser.\n   * Do not depend on the value of this string. Because Android Browser has not\n   * implemented userAgentData yet, the value of this string is not guaranteed\n   * to stay the same in future revisions.\n   */\n  ANDROID_BROWSER: 'Android Browser',\n  /**\n   * The browser brand for Chromium, including Chromium-based Edge and Opera.\n   */\n  CHROMIUM: 'Chromium',\n  /**\n   * The browser brand for Edge.\n   * This brand can be used to get the version of both EdgeHTML and\n   * Chromium-based Edge.\n   */\n  EDGE: 'Microsoft Edge',\n  /**\n   * The browser brand for Firefox.\n   * Do not depend on the value of this string. Because Firefox has not\n   * implemented userAgentData yet, the value of this string is not guaranteed\n   * to stay the same in future revisions.\n   */\n  FIREFOX: 'Firefox',\n  /**\n   * The browser brand for Internet Explorer.\n   * Do not depend on the value of this string. Because IE will never support\n   * userAgentData, the value of this string should be treated as opaque (it's\n   * used internally for legacy-userAgent fallback).\n   */\n  IE: 'Internet Explorer',\n  /**\n   * The browser brand for Opera.\n   * This brand can be used to get the version of both Presto- and\n   * Chromium-based Opera.\n   */\n  OPERA: 'Opera',\n  /**\n   * The browser brand for Safari.\n   * Do not depend on the value of this string. Because Safari has not\n   * implemented userAgentData yet, the value of this string is not guaranteed\n   * to stay the same in future revisions.\n   */\n  SAFARI: 'Safari',\n  /**\n   * The browser brand for Silk.\n   * See\n   * https://docs.aws.amazon.com/silk/latest/developerguide/what-is-silk.html\n   * Do not depend on the value of this string. Because Silk does not\n   * identify itself in userAgentData yet, the value of this string is not\n   * guaranteed to stay the same in future revisions.\n   */\n  SILK: 'Silk',\n};\nexports.Brand = Brand;\n\n/**\n * @return {boolean} Whether to use navigator.userAgentData to determine\n * browser's brand.\n */\nfunction useUserAgentDataBrand() {\n  if (util.ASSUME_CLIENT_HINTS_SUPPORT) return true;\n  const userAgentData = util.getUserAgentData();\n  return !!userAgentData && userAgentData.brands.length > 0;\n}\n\n/**\n * @return {boolean} Whether the user's browser is Opera. Note: Chromium based\n *     Opera (Opera 15+) is detected as Chrome to avoid unnecessary special\n *     casing.\n */\nfunction matchOpera() {\n  if (useUserAgentDataBrand()) {\n    // Pre-Chromium Edge doesn't support navigator.userAgentData.\n    return false;\n  }\n  return util.matchUserAgent('Opera');\n}\n\n/** @return {boolean} Whether the user's browser is IE. */\nfunction matchIE() {\n  if (useUserAgentDataBrand()) {\n    // IE doesn't support navigator.userAgentData.\n    return false;\n  }\n  return util.matchUserAgent('Trident') || util.matchUserAgent('MSIE');\n}\n\n/**\n * @return {boolean} Whether the user's browser is Edge. This refers to\n *     EdgeHTML based Edge.\n */\nfunction matchEdgeHtml() {\n  if (useUserAgentDataBrand()) {\n    // Pre-Chromium Edge doesn't support navigator.userAgentData.\n    return false;\n  }\n  return util.matchUserAgent('Edge');\n}\n\n/** @return {boolean} Whether the user's browser is Chromium based Edge. */\nfunction matchEdgeChromium() {\n  if (useUserAgentDataBrand()) {\n    return util.matchUserAgentDataBrand(Brand.EDGE);\n  }\n  return util.matchUserAgent('Edg/');\n}\n\n/** @return {boolean} Whether the user's browser is Chromium based Opera. */\nfunction matchOperaChromium() {\n  if (useUserAgentDataBrand()) {\n    return util.matchUserAgentDataBrand(Brand.OPERA);\n  }\n  return util.matchUserAgent('OPR');\n}\n\n/** @return {boolean} Whether the user's browser is Firefox. */\nfunction matchFirefox() {\n  // Firefox doesn't support navigator.userAgentData yet, so use\n  // navigator.userAgent.\n  return util.matchUserAgent('Firefox') || util.matchUserAgent('FxiOS');\n}\n\n/** @return {boolean} Whether the user's browser is Safari. */\nfunction matchSafari() {\n  // Apple-based browsers don't support navigator.userAgentData yet, so use\n  // navigator.userAgent.\n  return util.matchUserAgent('Safari') &&\n      !(matchChrome() || matchCoast() || matchOpera() || matchEdgeHtml() ||\n        matchEdgeChromium() || matchOperaChromium() || matchFirefox() ||\n        isSilk() || util.matchUserAgent('Android'));\n}\n\n/**\n * @return {boolean} Whether the user's browser is Coast (Opera's Webkit-based\n *     iOS browser).\n */\nfunction matchCoast() {\n  if (useUserAgentDataBrand()) {\n    // Coast doesn't support navigator.userAgentData.\n    return false;\n  }\n  return util.matchUserAgent('Coast');\n}\n\n/** @return {boolean} Whether the user's browser is iOS Webview. */\nfunction matchIosWebview() {\n  // Apple-based browsers don't support navigator.userAgentData yet, so use\n  // navigator.userAgent.\n  // iOS Webview does not show up as Chrome or Safari.\n  return (util.matchUserAgent('iPad') || util.matchUserAgent('iPhone')) &&\n      !matchSafari() && !matchChrome() && !matchCoast() && !matchFirefox() &&\n      util.matchUserAgent('AppleWebKit');\n}\n\n/**\n * @return {boolean} Whether the user's browser is any Chromium browser. This\n *     returns true for Chrome, Opera 15+, and Edge Chromium.\n */\nfunction matchChrome() {\n  if (useUserAgentDataBrand()) {\n    return util.matchUserAgentDataBrand(Brand.CHROMIUM);\n  }\n  return ((util.matchUserAgent('Chrome') || util.matchUserAgent('CriOS')) &&\n          !matchEdgeHtml()) ||\n      isSilk();\n}\n\n/** @return {boolean} Whether the user's browser is the Android browser. */\nfunction matchAndroidBrowser() {\n  // Android can appear in the user agent string for Chrome on Android.\n  // This is not the Android standalone browser if it does.\n  return util.matchUserAgent('Android') &&\n      !(isChrome() || isFirefox() || isOpera() || isSilk());\n}\n\n/** @return {boolean} Whether the user's browser is Opera. */\nconst isOpera = matchOpera;\nexports.isOpera = isOpera;\n\n/** @return {boolean} Whether the user's browser is IE. */\nconst isIE = matchIE;\nexports.isIE = isIE;\n\n/** @return {boolean} Whether the user's browser is EdgeHTML based Edge. */\nconst isEdge = matchEdgeHtml;\nexports.isEdge = isEdge;\n\n/** @return {boolean} Whether the user's browser is Chromium based Edge. */\nconst isEdgeChromium = matchEdgeChromium;\nexports.isEdgeChromium = isEdgeChromium;\n\n/** @return {boolean} Whether the user's browser is Chromium based Opera. */\nconst isOperaChromium = matchOperaChromium;\nexports.isOperaChromium = isOperaChromium;\n\n/** @return {boolean} Whether the user's browser is Firefox. */\nconst isFirefox = matchFirefox;\nexports.isFirefox = isFirefox;\n\n/** @return {boolean} Whether the user's browser is Safari. */\nconst isSafari = matchSafari;\nexports.isSafari = isSafari;\n\n/**\n * @return {boolean} Whether the user's browser is Coast (Opera's Webkit-based\n *     iOS browser).\n */\nconst isCoast = matchCoast;\nexports.isCoast = isCoast;\n\n/** @return {boolean} Whether the user's browser is iOS Webview. */\nconst isIosWebview = matchIosWebview;\nexports.isIosWebview = isIosWebview;\n\n/**\n * @return {boolean} Whether the user's browser is any Chromium based browser (\n *     Chrome, Blink-based Opera (15+) and Edge Chromium).\n */\nconst isChrome = matchChrome;\nexports.isChrome = isChrome;\n\n/** @return {boolean} Whether the user's browser is the Android browser. */\nconst isAndroidBrowser = matchAndroidBrowser;\nexports.isAndroidBrowser = isAndroidBrowser;\n\n/**\n * For more information, see:\n * http://docs.aws.amazon.com/silk/latest/developerguide/user-agent.html\n * @return {boolean} Whether the user's browser is Silk.\n */\nfunction isSilk() {\n  // As of Silk 93, Silk does not identify itself in userAgentData.brands.\n  // When Silk changes this behavior, update this method to call\n  // matchUserAgentDataBrand (akin to isChrome, etc.)\n  return util.matchUserAgent('Silk');\n}\nexports.isSilk = isSilk;\n\n/**\n * A helper function that returns a function mapping a list of candidate\n * version tuple keys to the first version string present under a key.\n * Ex:\n * <code>\n * // Arg extracted from \"Foo/1.2.3 Bar/0.2021\"\n * const mapVersion = createVersionMap([[\"Foo\", \"1.2.3\"], [\"Bar\", \"0.2021\"]]);\n * mapVersion([\"Bar\", \"Foo\"]); // returns \"0.2021\"\n * mapVersion([\"Baz\", \"Foo\"]); // returns \"1.2.3\"\n * mapVersion([\"Baz\", \"???\"]); // returns \"\"\n * </code>\n * @param {!Array<!Array<string>>} versionTuples Version tuples pre-extracted\n *     from a user agent string.\n * @return {function(!Array<string>): string} The version string, or empty\n * string if it doesn't exist under the given key.\n */\nfunction createVersionMap(versionTuples) {\n  // Construct a map for easy lookup.\n  const versionMap = {};\n  versionTuples.forEach((tuple) => {\n    // Note that the tuple is of length three, but we only care about the\n    // first two.\n    const key = tuple[0];\n    const value = tuple[1];\n    versionMap[key] = value;\n  });\n\n  // Gives the value with the first key it finds, otherwise empty string.\n  return (keys) => versionMap[keys.find((key) => key in versionMap)] || '';\n}\n\n/**\n * Returns the browser version.\n *\n * Note that for browsers with multiple brands, this function assumes a primary\n * brand and returns the version for that brand.\n *\n * Additionally, this function is not userAgentData-aware and will return\n * incorrect values when the User Agent string is frozen. The current status of\n * User Agent string freezing is available here:\n * https://www.chromestatus.com/feature/5704553745874944\n *\n * To mitigate both of these potential issues, use\n * getVersionStringForLogging() or fullVersionOf() instead.\n *\n * @return {string} The browser version or empty string if version cannot be\n *     determined. Note that for Internet Explorer, this returns the version of\n *     the browser, not the version of the rendering engine. (IE 8 in\n *     compatibility mode will return 8.0 rather than 7.0. To determine the\n *     rendering engine version, look at document.documentMode instead. See\n *     http://msdn.microsoft.com/en-us/library/cc196988(v=vs.85).aspx for more\n *     details.)\n */\nfunction getVersion() {\n  const userAgentString = util.getUserAgent();\n\n  // Special case IE since IE's version is inside the parenthesis and\n  // without the '/'.\n  if (isIE()) {\n    return getIEVersion(userAgentString);\n  }\n\n  const versionTuples = util.extractVersionTuples(userAgentString);\n  const lookUpValueWithKeys = createVersionMap(versionTuples);\n\n  // Check Opera before Chrome since Opera 15+ has \"Chrome\" in the string.\n  // See\n  // http://my.opera.com/ODIN/blog/2013/07/15/opera-user-agent-strings-opera-15-and-beyond\n  if (isOpera()) {\n    // Opera 10 has Version/10.0 but Opera/9.8, so look for \"Version\" first.\n    // Opera uses 'OPR' for more recent UAs.\n    return lookUpValueWithKeys(['Version', 'Opera']);\n  }\n\n  // Check Edge before Chrome since it has Chrome in the string.\n  if (isEdge()) {\n    return lookUpValueWithKeys(['Edge']);\n  }\n\n  // Check Chromium Edge before Chrome since it has Chrome in the string.\n  if (isEdgeChromium()) {\n    return lookUpValueWithKeys(['Edg']);\n  }\n\n  // Check Silk before Chrome since it may have Chrome in its string and be\n  // treated as Chrome.\n  if (isSilk()) {\n    return lookUpValueWithKeys(['Silk']);\n  }\n\n  if (isChrome()) {\n    return lookUpValueWithKeys(['Chrome', 'CriOS', 'HeadlessChrome']);\n  }\n\n  // Usually products browser versions are in the third tuple after \"Mozilla\"\n  // and the engine.\n  const tuple = versionTuples[2];\n  return tuple && tuple[1] || '';\n}\nexports.getVersion = getVersion;\n\n/**\n * Returns whether the current browser's version is at least as high as the\n * given one.\n *\n * Note that for browsers with multiple brands, this function assumes a primary\n * brand and checks the version for that brand.\n *\n * Additionally, this function is not userAgentData-aware and will return\n * incorrect values when the User Agent string is frozen. The current status of\n * User Agent string freezing is available here:\n * https://www.chromestatus.com/feature/5704553745874944\n *\n * To mitigate both of these potential issues, use isAtLeast()/isAtMost() or\n * fullVersionOf() instead.\n *\n * @param {string|number} version The version to check.\n * @return {boolean} Whether the browser version is higher or the same as the\n *     given version.\n * @deprecated Use isAtLeast()/isAtMost() instead.\n */\nfunction isVersionOrHigher(version) {\n  return compareVersions(getVersion(), version) >= 0;\n}\nexports.isVersionOrHigher = isVersionOrHigher;\n\n/**\n * A helper function to determine IE version. More information:\n * http://msdn.microsoft.com/en-us/library/ie/bg182625(v=vs.85).aspx#uaString\n * http://msdn.microsoft.com/en-us/library/hh869301(v=vs.85).aspx\n * http://blogs.msdn.com/b/ie/archive/2010/03/23/introducing-ie9-s-user-agent-string.aspx\n * http://blogs.msdn.com/b/ie/archive/2009/01/09/the-internet-explorer-8-user-agent-string-updated-edition.aspx\n * @param {string} userAgent the User-Agent.\n * @return {string}\n */\nfunction getIEVersion(userAgent) {\n  // IE11 may identify itself as MSIE 9.0 or MSIE 10.0 due to an IE 11 upgrade\n  // bug. Example UA:\n  // Mozilla/5.0 (MSIE 9.0; Windows NT 6.1; WOW64; Trident/7.0; rv:11.0)\n  // like Gecko.\n  // See http://www.whatismybrowser.com/developers/unknown-user-agent-fragments.\n  const rv = /rv: *([\\d\\.]*)/.exec(userAgent);\n  if (rv && rv[1]) {\n    return rv[1];\n  }\n\n  let version = '';\n  const msie = /MSIE +([\\d\\.]+)/.exec(userAgent);\n  if (msie && msie[1]) {\n    // IE in compatibility mode usually identifies itself as MSIE 7.0; in this\n    // case, use the Trident version to determine the version of IE. For more\n    // details, see the links above.\n    const tridentVersion = /Trident\\/(\\d.\\d)/.exec(userAgent);\n    if (msie[1] == '7.0') {\n      if (tridentVersion && tridentVersion[1]) {\n        switch (tridentVersion[1]) {\n          case '4.0':\n            version = '8.0';\n            break;\n          case '5.0':\n            version = '9.0';\n            break;\n          case '6.0':\n            version = '10.0';\n            break;\n          case '7.0':\n            version = '11.0';\n            break;\n        }\n      } else {\n        version = '7.0';\n      }\n    } else {\n      version = msie[1];\n    }\n  }\n  return version;\n}\n\n/**\n * A helper function to return the navigator.userAgent-supplied full version\n * number of the current browser or an empty string, based on whether the\n * current browser is the one specified.\n * @param {string} browser The brand whose version should be returned.\n * @return {string}\n */\nfunction getFullVersionFromUserAgentString(browser) {\n  const userAgentString = util.getUserAgent();\n  // Special case IE since IE's version is inside the parenthesis and\n  // without the '/'.\n  if (browser === Brand.IE) {\n    return isIE() ? getIEVersion(userAgentString) : '';\n  }\n\n  const versionTuples = util.extractVersionTuples(userAgentString);\n  const lookUpValueWithKeys = createVersionMap(versionTuples);\n  switch (browser) {\n    case Brand.OPERA:\n      // Opera 10 has Version/10.0 but Opera/9.8, so look for \"Version\"\n      // first. Opera uses 'OPR' for more recent UAs.\n      if (isOpera()) {\n        return lookUpValueWithKeys(['Version', 'Opera']);\n      } else if (isOperaChromium()) {\n        return lookUpValueWithKeys(['OPR']);\n      }\n      break;\n    case Brand.EDGE:\n      if (isEdge()) {\n        return lookUpValueWithKeys(['Edge']);\n      } else if (isEdgeChromium()) {\n        return lookUpValueWithKeys(['Edg']);\n      }\n      break;\n    case Brand.CHROMIUM:\n      if (isChrome()) {\n        return lookUpValueWithKeys(['Chrome', 'CriOS', 'HeadlessChrome']);\n      }\n      break;\n  }\n\n  // For the following browsers, the browser version is in the third tuple after\n  // \"Mozilla\" and the engine.\n  if ((browser === Brand.FIREFOX && isFirefox()) ||\n      (browser === Brand.SAFARI && isSafari()) ||\n      (browser === Brand.ANDROID_BROWSER && isAndroidBrowser()) ||\n      (browser === Brand.SILK && isSilk())) {\n    const tuple = versionTuples[2];\n    return tuple && tuple[1] || '';\n  }\n\n  return '';\n}\n\n/**\n * Returns the major version of the given browser brand, or NaN if the current\n * browser is not the given brand.\n * Note that the major version number may be different depending on which\n * browser is specified. The returned value can be used to make browser version\n * comparisons using comparison operators.\n * @deprecated Use isAtLeast or isAtMost instead.\n * @param {!Brand} browser The brand whose version should be returned.\n * @return {number} The major version number associated with the current\n * browser under the given brand, or NaN if the current browser doesn't match\n * the given brand.\n */\nfunction versionOf(browser) {\n  let versionParts;\n  // Silk currently does not identify itself in its userAgentData.brands array,\n  // so if checking its version, always fall back to the user agent string.\n  if (useUserAgentDataBrand() && browser !== Brand.SILK) {\n    const data = util.getUserAgentData();\n    const matchingBrand = data.brands.find(({brand}) => brand === browser);\n    if (!matchingBrand || !matchingBrand.version) {\n      return NaN;\n    }\n    versionParts = matchingBrand.version.split('.');\n  } else {\n    const fullVersion = getFullVersionFromUserAgentString(browser);\n    if (fullVersion === '') {\n      return NaN;\n    }\n    versionParts = fullVersion.split('.');\n  }\n  if (versionParts.length === 0) {\n    return NaN;\n  }\n  const majorVersion = versionParts[0];\n  return Number(majorVersion);  // Returns NaN if it is not parseable.\n}\nexports.versionOf = versionOf;\n\n/**\n * Returns true if the current browser matches the given brand and is at least\n * the given major version. The major version must be a whole number (i.e.\n * decimals should not be used to represent a minor version).\n * @param {!Brand} brand The brand whose version should be returned.\n * @param {number} majorVersion The major version number to compare against.\n *     This must be a whole number.\n * @return {boolean} Whether the current browser both matches the given brand\n *     and is at least the given version.\n */\nfunction isAtLeast(brand, majorVersion) {\n  googAsserts.assert(\n      Math.floor(majorVersion) === majorVersion,\n      'Major version must be an integer');\n  return versionOf(brand) >= majorVersion;\n}\nexports.isAtLeast = isAtLeast;\n\n/**\n * Returns true if the current browser matches the given brand and is at most\n * the given version. The major version must be a whole number (i.e. decimals\n * should not be used to represent a minor version).\n * @param {!Brand} brand The brand whose version should be returned.\n * @param {number} majorVersion The major version number to compare against.\n *     This must be a whole number.\n * @return {boolean} Whether the current browser both matches the given brand\n *     and is at most the given version.\n */\nfunction isAtMost(brand, majorVersion) {\n  googAsserts.assert(\n      Math.floor(majorVersion) === majorVersion,\n      'Major version must be an integer');\n  return versionOf(brand) <= majorVersion;\n}\nexports.isAtMost = isAtMost;\n\n/**\n * Loads the high-entropy browser brand/version data and wraps the correct\n * version string in a Version object.\n * @implements {AsyncValue<!Version>}\n */\nclass HighEntropyBrandVersion {\n  /**\n   * @param {string} brand The brand whose version is retrieved in this\n   *     container.\n   */\n  constructor(brand) {\n    /**\n     * @const {string}\n     * @private\n     */\n    this.brand_ = brand;\n  }\n\n  /**\n   * @return {!Version|undefined}\n   * @override\n   */\n  getIfLoaded() {\n    const loadedVersionList = fullVersionList.getIfLoaded();\n    if (loadedVersionList !== undefined) {\n      const matchingBrand =\n          loadedVersionList.find(({brand}) => this.brand_ === brand);\n      googAsserts.assertExists(matchingBrand);\n      return new Version(matchingBrand.version);\n    }\n    return;\n  }\n\n  /**\n   * @return {!Promise<!Version>}\n   * @override\n   */\n  async load() {\n    const loadedVersionList = await fullVersionList.load();\n    const matchingBrand =\n        loadedVersionList.find(({brand}) => this.brand_ === brand);\n    googAsserts.assertExists(matchingBrand);\n    return new Version(matchingBrand.version);\n  }\n}\n\n/**\n * Wraps a version string in a Version object.\n * @implements {AsyncValue<!Version>}\n */\nclass UserAgentStringFallbackBrandVersion {\n  /**\n   * @param {string} versionString\n   */\n  constructor(versionString) {\n    /**\n     * @const {!Version}\n     * @private\n     */\n    this.version_ = new Version(versionString);\n  }\n\n  /**\n   * @return {!Version|undefined}\n   * @override\n   */\n  getIfLoaded() {\n    return this.version_;\n  }\n\n  /**\n   * @return {!Promise<!Version>}\n   * @override\n   */\n  async load() {\n    return this.version_;\n  }\n}\n\n/**\n * Requests all full browser versions to be cached.  When the returned promise\n * resolves, subsequent calls to `fullVersionOf(...).getIfLoaded()` will return\n * a value.\n *\n * This method should be avoided in favor of directly awaiting\n * `fullVersionOf(...).load()` where it is used.\n *\n * @return {!Promise<void>}\n */\nasync function loadFullVersions() {\n  if (useUserAgentDataBrand() && hasFullVersionList()) {\n    await fullVersionList.load();\n  }\n}\nexports.loadFullVersions = loadFullVersions;\n\n/**\n * Returns an object that provides access to the full version string of the\n * current browser -- or undefined, based on whether the current browser matches\n * the requested browser brand. Note that the full version string is a\n * high-entropy value, and must be asynchronously loaded before it can be\n * accessed synchronously.\n * @param {!Brand} browser The brand whose version should be returned.\n * @return {!AsyncValue<!Version>|undefined} An object that can be used\n *     to get or load the full version string as a high-entropy value, or\n * undefined if the current browser doesn't match the given brand.\n */\nfunction fullVersionOf(browser) {\n  // Silk currently does not identify itself in its userAgentData.brands array,\n  // so if checking its version, always fall back to the user agent string.\n  if (useUserAgentDataBrand() && hasFullVersionList()) {\n    const data = util.getUserAgentData();\n    // Operate under the assumption that the low-entropy and high-entropy lists\n    // of brand/version pairs contain an identical set of brands. Therefore, if\n    // the low-entropy list doesn't contain the given brand, return undefined.\n    if (!data.brands.find(({brand}) => brand === browser)) {\n      return undefined;\n    }\n    return new HighEntropyBrandVersion(browser);\n  } else {\n    const fullVersionFromUserAgentString =\n        getFullVersionFromUserAgentString(browser);\n    if (fullVersionFromUserAgentString === '') {\n      return undefined;\n    }\n    return new UserAgentStringFallbackBrandVersion(\n        fullVersionFromUserAgentString);\n  }\n}\nexports.fullVersionOf = fullVersionOf;\n\n/**\n * Returns a version string for the current browser or undefined, based on\n * whether the current browser is the one specified.\n * This value should ONLY be used for logging/debugging purposes. Do not use it\n * to branch code paths. For comparing versions, use isAtLeast()/isAtMost() or\n * fullVersionOf() instead.\n * @param {!Brand} browser The brand whose version should be returned.\n * @return {string} The version as a string.\n */\nfunction getVersionStringForLogging(browser) {\n  if (useUserAgentDataBrand()) {\n    const fullVersionObj = fullVersionOf(browser);\n    if (fullVersionObj) {\n      const fullVersion = fullVersionObj.getIfLoaded();\n      if (fullVersion) {\n        return fullVersion.toVersionStringForLogging();\n      }\n      // No full version, return the major version instead.\n      const data = util.getUserAgentData();\n      const matchingBrand = data.brands.find(({brand}) => brand === browser);\n      // Checking for the existence of matchingBrand is not necessary because\n      // the existence of fullVersionObj implies that there is already a\n      // matching brand.\n      googAsserts.assertExists(matchingBrand);\n      return matchingBrand.version;\n    }\n    // If fullVersionObj is undefined, this doesn't mean that the full version\n    // is unavailable, but rather that the current browser doesn't match the\n    // input `browser` argument.\n    return '';\n  } else {\n    return getFullVersionFromUserAgentString(browser);\n  }\n}\nexports.getVersionStringForLogging = getVersionStringForLogging;\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Closure user agent detection.\n * @see http://en.wikipedia.org/wiki/User_agent\n * For more information on browser brand, platform, or device see the other\n * sub-namespaces in goog.labs.userAgent (browser, platform, and device).\n */\n\ngoog.module('goog.labs.userAgent.engine');\ngoog.module.declareLegacyNamespace();\n\nconst googArray = goog.require('goog.array');\nconst googString = goog.require('goog.string.internal');\nconst util = goog.require('goog.labs.userAgent.util');\n\n/**\n * @return {boolean} Whether the rendering engine is Presto.\n */\nfunction isPresto() {\n  return util.matchUserAgent('Presto');\n}\n\n/**\n * @return {boolean} Whether the rendering engine is Trident.\n */\nfunction isTrident() {\n  // IE only started including the Trident token in IE8.\n  return util.matchUserAgent('Trident') || util.matchUserAgent('MSIE');\n}\n\n/**\n * @return {boolean} Whether the rendering engine is EdgeHTML.\n */\nfunction isEdge() {\n  return util.matchUserAgent('Edge');\n}\n\n/**\n * @return {boolean} Whether the rendering engine is WebKit. This will return\n * true for Chrome, Blink-based Opera (15+), Edge Chromium and Safari.\n */\nfunction isWebKit() {\n  return util.matchUserAgentIgnoreCase('WebKit') && !isEdge();\n}\n\n/**\n * @return {boolean} Whether the rendering engine is Gecko.\n */\nfunction isGecko() {\n  return util.matchUserAgent('Gecko') && !isWebKit() && !isTrident() &&\n      !isEdge();\n}\n\n/**\n * @return {string} The rendering engine's version or empty string if version\n *     can't be determined.\n */\nfunction getVersion() {\n  const userAgentString = util.getUserAgent();\n  if (userAgentString) {\n    const tuples = util.extractVersionTuples(userAgentString);\n\n    const engineTuple = getEngineTuple(tuples);\n    if (engineTuple) {\n      // In Gecko, the version string is either in the browser info or the\n      // Firefox version.  See Gecko user agent string reference:\n      // http://goo.gl/mULqa\n      if (engineTuple[0] == 'Gecko') {\n        return getVersionForKey(tuples, 'Firefox');\n      }\n\n      return engineTuple[1];\n    }\n\n    // MSIE has only one version identifier, and the Trident version is\n    // specified in the parenthetical. IE Edge is covered in the engine tuple\n    // detection.\n    const browserTuple = tuples[0];\n    let info;\n    if (browserTuple && (info = browserTuple[2])) {\n      const match = /Trident\\/([^\\s;]+)/.exec(info);\n      if (match) {\n        return match[1];\n      }\n    }\n  }\n  return '';\n}\n\n/**\n * @param {!Array<!Array<string>>} tuples Extracted version tuples.\n * @return {!Array<string>|undefined} The engine tuple or undefined if not\n *     found.\n */\nfunction getEngineTuple(tuples) {\n  if (!isEdge()) {\n    return tuples[1];\n  }\n  for (let i = 0; i < tuples.length; i++) {\n    const tuple = tuples[i];\n    if (tuple[0] == 'Edge') {\n      return tuple;\n    }\n  }\n}\n\n/**\n * @param {string|number} version The version to check.\n * @return {boolean} Whether the rendering engine version is higher or the same\n *     as the given version.\n */\nfunction isVersionOrHigher(version) {\n  return googString.compareVersions(getVersion(), version) >= 0;\n}\n\n/**\n * @param {!Array<!Array<string>>} tuples Version tuples.\n * @param {string} key The key to look for.\n * @return {string} The version string of the given key, if present.\n *     Otherwise, the empty string.\n */\nfunction getVersionForKey(tuples, key) {\n  // TODO(nnaze): Move to util if useful elsewhere.\n\n  const pair = googArray.find(tuples, function(pair) {\n    return key == pair[0];\n  });\n\n  return pair && pair[1] || '';\n}\n\nexports = {\n  getVersion,\n  isEdge,\n  isGecko,\n  isPresto,\n  isTrident,\n  isVersionOrHigher,\n  isWebKit,\n};\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Wrapper class for handling XmlHttpRequests.\n *\n * One off requests can be sent through goog.net.XhrIo.send() or an\n * instance can be created to send multiple requests.  Each request uses its\n * own XmlHttpRequest object and handles clearing of the event callback to\n * ensure no leaks.\n *\n * XhrIo is event based, it dispatches events on success, failure, finishing,\n * ready-state change, or progress (download and upload).\n *\n * The ready-state or timeout event fires first, followed by\n * a generic completed event. Then the abort, error, or success event\n * is fired as appropriate. Progress events are fired as they are\n * received. Lastly, the ready event will fire to indicate that the\n * object may be used to make another request.\n *\n * The error event may also be called before completed and\n * ready-state-change if the XmlHttpRequest.open() or .send() methods throw.\n *\n * This class does not support multiple requests, queuing, or prioritization.\n *\n * When progress events are supported by the browser, and progress is\n * enabled via .setProgressEventsEnabled(true), the\n * goog.net.EventType.PROGRESS event will be the re-dispatched browser\n * progress event. Additionally, a DOWNLOAD_PROGRESS or UPLOAD_PROGRESS event\n * will be fired for download and upload progress respectively.\n */\n\n\ngoog.provide('goog.net.XhrIo');\ngoog.provide('goog.net.XhrIo.ResponseType');\n\ngoog.require('goog.Timer');\ngoog.require('goog.array');\ngoog.require('goog.asserts');\ngoog.require('goog.collections.maps');\ngoog.require('goog.debug.entryPointRegistry');\ngoog.require('goog.events.EventTarget');\ngoog.require('goog.json.hybrid');\ngoog.require('goog.log');\ngoog.require('goog.net.ErrorCode');\ngoog.require('goog.net.EventType');\ngoog.require('goog.net.HttpStatus');\ngoog.require('goog.net.XmlHttp');\ngoog.require('goog.object');\ngoog.require('goog.string');\ngoog.require('goog.uri.utils');\ngoog.require('goog.userAgent');\ngoog.requireType('goog.Uri');\ngoog.requireType('goog.debug.ErrorHandler');\ngoog.requireType('goog.net.XhrLike');\ngoog.requireType('goog.net.XmlHttpFactory');\n\ngoog.scope(function() {\n\n'use strict';\n/**\n * Basic class for handling XMLHttpRequests.\n * @param {goog.net.XmlHttpFactory=} opt_xmlHttpFactory Factory to use when\n *     creating XMLHttpRequest objects.\n * @constructor\n * @extends {goog.events.EventTarget}\n */\ngoog.net.XhrIo = function(opt_xmlHttpFactory) {\n  'use strict';\n  XhrIo.base(this, 'constructor');\n\n  /**\n   * Map of default headers to add to every request, use:\n   * XhrIo.headers.set(name, value)\n   * @type {!Map<string,string>}\n   */\n  this.headers = new Map();\n\n  /**\n   * Optional XmlHttpFactory\n   * @private {goog.net.XmlHttpFactory}\n   */\n  this.xmlHttpFactory_ = opt_xmlHttpFactory || null;\n\n  /**\n   * Whether XMLHttpRequest is active.  A request is active from the time send()\n   * is called until onReadyStateChange() is complete, or error() or abort()\n   * is called.\n   * @private {boolean}\n   */\n  this.active_ = false;\n\n  /**\n   * The XMLHttpRequest object that is being used for the transfer.\n   * @private {?goog.net.XhrLike.OrNative}\n   */\n  this.xhr_ = null;\n\n  /**\n   * The options to use with the current XMLHttpRequest object.\n   * @private {?Object}\n   */\n  this.xhrOptions_ = null;\n\n  /**\n   * Last URL that was requested.\n   * @private {string|goog.Uri}\n   */\n  this.lastUri_ = '';\n\n  /**\n   * Method for the last request.\n   * @private {string}\n   */\n  this.lastMethod_ = '';\n\n  /**\n   * Last error code.\n   * @private {!goog.net.ErrorCode}\n   */\n  this.lastErrorCode_ = goog.net.ErrorCode.NO_ERROR;\n\n  /**\n   * Last error message.\n   * @private {Error|string}\n   */\n  this.lastError_ = '';\n\n  /**\n   * Used to ensure that we don't dispatch an multiple ERROR events. This can\n   * happen in IE when it does a synchronous load and one error is handled in\n   * the ready state change and one is handled due to send() throwing an\n   * exception.\n   * @private {boolean}\n   */\n  this.errorDispatched_ = false;\n\n  /**\n   * Used to make sure we don't fire the complete event from inside a send call.\n   * @private {boolean}\n   */\n  this.inSend_ = false;\n\n  /**\n   * Used in determining if a call to {@link #onReadyStateChange_} is from\n   * within a call to this.xhr_.open.\n   * @private {boolean}\n   */\n  this.inOpen_ = false;\n\n  /**\n   * Used in determining if a call to {@link #onReadyStateChange_} is from\n   * within a call to this.xhr_.abort.\n   * @private {boolean}\n   */\n  this.inAbort_ = false;\n\n  /**\n   * Number of milliseconds after which an incomplete request will be aborted\n   * and a {@link goog.net.EventType.TIMEOUT} event raised; 0 means no timeout\n   * is set.\n   * @private {number}\n   */\n  this.timeoutInterval_ = 0;\n\n  /**\n   * Timer to track request timeout.\n   * @private {?number}\n   */\n  this.timeoutId_ = null;\n\n  /**\n   * The requested type for the response. The empty string means use the default\n   * XHR behavior.\n   * @private {goog.net.XhrIo.ResponseType}\n   */\n  this.responseType_ = ResponseType.DEFAULT;\n\n  /**\n   * Whether a \"credentialed\" request is to be sent (one that is aware of\n   * cookies and authentication). This is applicable only for cross-domain\n   * requests and more recent browsers that support this part of the HTTP Access\n   * Control standard.\n   *\n   * @see http://www.w3.org/TR/XMLHttpRequest/#the-withcredentials-attribute\n   *\n   * @private {boolean}\n   */\n  this.withCredentials_ = false;\n\n  /**\n   * Whether progress events are enabled for this request. This is\n   * disabled by default because setting a progress event handler\n   * causes pre-flight OPTIONS requests to be sent for CORS requests,\n   * even in cases where a pre-flight request would not otherwise be\n   * sent.\n   *\n   * @see http://xhr.spec.whatwg.org/#security-considerations\n   *\n   * Note that this can cause problems for Firefox 22 and below, as an\n   * older \"LSProgressEvent\" will be dispatched by the browser. That\n   * progress event is no longer supported, and can lead to failures,\n   * including throwing exceptions.\n   *\n   * @see http://bugzilla.mozilla.org/show_bug.cgi?id=845631\n   * @see b/23469793\n   *\n   * @private {boolean}\n   */\n  this.progressEventsEnabled_ = false;\n\n  /**\n   * True if we can use XMLHttpRequest's timeout directly.\n   * @private {boolean}\n   */\n  this.useXhr2Timeout_ = false;\n\n  /**\n   * Specification for Trust Token operations (issuance, signing, and\n   * redemption).\n   * @private {?TrustTokenAttributeType}\n   */\n  this.trustToken_ = null;\n};\ngoog.inherits(goog.net.XhrIo, goog.events.EventTarget);\n\nconst XhrIo = goog.net.XhrIo;\n\n/**\n * Response types that may be requested for XMLHttpRequests.\n * @enum {string}\n * @see http://www.w3.org/TR/XMLHttpRequest/#the-responsetype-attribute\n */\ngoog.net.XhrIo.ResponseType = {\n  DEFAULT: '',\n  TEXT: 'text',\n  DOCUMENT: 'document',\n  // Not supported as of Chrome 10.0.612.1 dev\n  BLOB: 'blob',\n  ARRAY_BUFFER: 'arraybuffer',\n};\n\nconst ResponseType = goog.net.XhrIo.ResponseType;\n\n\n/**\n * A reference to the XhrIo logger\n * @private {?goog.log.Logger}\n * @const\n */\ngoog.net.XhrIo.prototype.logger_ = goog.log.getLogger('goog.net.XhrIo');\n\n\n/**\n * The Content-Type HTTP header name\n * @type {string}\n */\ngoog.net.XhrIo.CONTENT_TYPE_HEADER = 'Content-Type';\n\n\n/**\n * The Content-Transfer-Encoding HTTP header name\n * @type {string}\n */\ngoog.net.XhrIo.CONTENT_TRANSFER_ENCODING = 'Content-Transfer-Encoding';\n\n\n/**\n * The pattern matching the 'http' and 'https' URI schemes\n * @type {!RegExp}\n */\ngoog.net.XhrIo.HTTP_SCHEME_PATTERN = /^https?$/i;\n\nconst HTTP_SCHEME_PATTERN = goog.net.XhrIo.HTTP_SCHEME_PATTERN;\n\n\n/**\n * The methods that typically come along with form data.  We set different\n * headers depending on whether the HTTP action is one of these.\n * @type {!Array<string>}\n */\ngoog.net.XhrIo.METHODS_WITH_FORM_DATA = ['POST', 'PUT'];\n\n\n/**\n * The Content-Type HTTP header value for a url-encoded form\n * @type {string}\n */\ngoog.net.XhrIo.FORM_CONTENT_TYPE =\n    'application/x-www-form-urlencoded;charset=utf-8';\n\n\n/**\n * The XMLHttpRequest Level two timeout delay ms property name.\n *\n * @see http://www.w3.org/TR/XMLHttpRequest/#the-timeout-attribute\n *\n * @private {string}\n * @const\n */\ngoog.net.XhrIo.XHR2_TIMEOUT_ = 'timeout';\n\n\n/**\n * The XMLHttpRequest Level two ontimeout handler property name.\n *\n * @see http://www.w3.org/TR/XMLHttpRequest/#the-timeout-attribute\n *\n * @private {string}\n * @const\n */\ngoog.net.XhrIo.XHR2_ON_TIMEOUT_ = 'ontimeout';\n\n\n/**\n * All non-disposed instances of goog.net.XhrIo created\n * by {@link goog.net.XhrIo.send} are in this Array.\n * @see goog.net.XhrIo.cleanup\n * @private {!Array<!goog.net.XhrIo>}\n */\ngoog.net.XhrIo.sendInstances_ = [];\n\n\n/**\n * Static send that creates a short lived instance of XhrIo to send the\n * request.\n * @see goog.net.XhrIo.cleanup\n * @param {string|goog.Uri} url Uri to make request to.\n * @param {?function(this:goog.net.XhrIo, ?)=} opt_callback Callback function\n *     for when request is complete.\n * @param {string=} opt_method Send method, default: GET.\n * @param {ArrayBuffer|ArrayBufferView|Blob|Document|FormData|string=}\n *     opt_content Body data.\n * @param {(?Object|?goog.collections.maps.MapLike<string, string>)=}\n *     opt_headers Map of headers to add to the request.\n * @param {number=} opt_timeoutInterval Number of milliseconds after which an\n *     incomplete request will be aborted; 0 means no timeout is set.\n * @param {boolean=} opt_withCredentials Whether to send credentials with the\n *     request. Default to false. See {@link goog.net.XhrIo#setWithCredentials}.\n * @return {!goog.net.XhrIo} The sent XhrIo.\n */\ngoog.net.XhrIo.send = function(\n    url, opt_callback, opt_method, opt_content, opt_headers,\n    opt_timeoutInterval, opt_withCredentials) {\n  'use strict';\n  const x = new goog.net.XhrIo();\n  goog.net.XhrIo.sendInstances_.push(x);\n  if (opt_callback) {\n    x.listen(goog.net.EventType.COMPLETE, opt_callback);\n  }\n  x.listenOnce(goog.net.EventType.READY, x.cleanupSend_);\n  if (opt_timeoutInterval) {\n    x.setTimeoutInterval(opt_timeoutInterval);\n  }\n  if (opt_withCredentials) {\n    x.setWithCredentials(opt_withCredentials);\n  }\n  x.send(url, opt_method, opt_content, opt_headers);\n  return x;\n};\n\n\n/**\n * Disposes all non-disposed instances of goog.net.XhrIo created by\n * {@link goog.net.XhrIo.send}.\n * {@link goog.net.XhrIo.send} cleans up the goog.net.XhrIo instance\n * it creates when the request completes or fails.  However, if\n * the request never completes, then the goog.net.XhrIo is not disposed.\n * This can occur if the window is unloaded before the request completes.\n * We could have {@link goog.net.XhrIo.send} return the goog.net.XhrIo\n * it creates and make the client of {@link goog.net.XhrIo.send} be\n * responsible for disposing it in this case.  However, this makes things\n * significantly more complicated for the client, and the whole point\n * of {@link goog.net.XhrIo.send} is that it's simple and easy to use.\n * Clients of {@link goog.net.XhrIo.send} should call\n * {@link goog.net.XhrIo.cleanup} when doing final\n * cleanup on window unload.\n */\ngoog.net.XhrIo.cleanup = function() {\n  'use strict';\n  const instances = goog.net.XhrIo.sendInstances_;\n  while (instances.length) {\n    instances.pop().dispose();\n  }\n};\n\n\n/**\n * Installs exception protection for all entry point introduced by\n * goog.net.XhrIo instances which are not protected by\n * {@link goog.debug.ErrorHandler#protectWindowSetTimeout},\n * {@link goog.debug.ErrorHandler#protectWindowSetInterval}, or\n * {@link goog.events.protectBrowserEventEntryPoint}.\n *\n * @param {goog.debug.ErrorHandler} errorHandler Error handler with which to\n *     protect the entry point(s).\n */\ngoog.net.XhrIo.protectEntryPoints = function(errorHandler) {\n  'use strict';\n  goog.net.XhrIo.prototype.onReadyStateChangeEntryPoint_ =\n      errorHandler.protectEntryPoint(\n          goog.net.XhrIo.prototype.onReadyStateChangeEntryPoint_);\n};\n\n\n/**\n * Disposes of the specified goog.net.XhrIo created by\n * {@link goog.net.XhrIo.send} and removes it from\n * {@link goog.net.XhrIo.pendingStaticSendInstances_}.\n * @private\n */\ngoog.net.XhrIo.prototype.cleanupSend_ = function() {\n  'use strict';\n  this.dispose();\n  goog.array.remove(goog.net.XhrIo.sendInstances_, this);\n};\n\n\n/**\n * Returns the number of milliseconds after which an incomplete request will be\n * aborted, or 0 if no timeout is set.\n * @return {number} Timeout interval in milliseconds.\n */\ngoog.net.XhrIo.prototype.getTimeoutInterval = function() {\n  'use strict';\n  return this.timeoutInterval_;\n};\n\n\n/**\n * Sets the number of milliseconds after which an incomplete request will be\n * aborted and a {@link goog.net.EventType.TIMEOUT} event raised; 0 means no\n * timeout is set.\n * @param {number} ms Timeout interval in milliseconds; 0 means none.\n */\ngoog.net.XhrIo.prototype.setTimeoutInterval = function(ms) {\n  'use strict';\n  this.timeoutInterval_ = Math.max(0, ms);\n};\n\n\n/**\n * Sets the desired type for the response. At time of writing, this is only\n * supported in very recent versions of WebKit (10.0.612.1 dev and later).\n *\n * If this is used, the response may only be accessed via {@link #getResponse}.\n *\n * @param {goog.net.XhrIo.ResponseType} type The desired type for the response.\n */\ngoog.net.XhrIo.prototype.setResponseType = function(type) {\n  'use strict';\n  this.responseType_ = type;\n};\n\n\n/**\n * Gets the desired type for the response.\n * @return {goog.net.XhrIo.ResponseType} The desired type for the response.\n */\ngoog.net.XhrIo.prototype.getResponseType = function() {\n  'use strict';\n  return this.responseType_;\n};\n\n\n/**\n * Sets whether a \"credentialed\" request that is aware of cookie and\n * authentication information should be made. This option is only supported by\n * browsers that support HTTP Access Control. As of this writing, this option\n * is not supported in IE.\n *\n * @param {boolean} withCredentials Whether this should be a \"credentialed\"\n *     request.\n */\ngoog.net.XhrIo.prototype.setWithCredentials = function(withCredentials) {\n  'use strict';\n  this.withCredentials_ = withCredentials;\n};\n\n\n/**\n * Gets whether a \"credentialed\" request is to be sent.\n * @return {boolean} The desired type for the response.\n */\ngoog.net.XhrIo.prototype.getWithCredentials = function() {\n  'use strict';\n  return this.withCredentials_;\n};\n\n\n/**\n * Sets whether progress events are enabled for this request. Note\n * that progress events require pre-flight OPTIONS request handling\n * for CORS requests, and may cause trouble with older browsers. See\n * progressEventsEnabled_ for details.\n * @param {boolean} enabled Whether progress events should be enabled.\n */\ngoog.net.XhrIo.prototype.setProgressEventsEnabled = function(enabled) {\n  'use strict';\n  this.progressEventsEnabled_ = enabled;\n};\n\n\n/**\n * Gets whether progress events are enabled.\n * @return {boolean} Whether progress events are enabled for this request.\n */\ngoog.net.XhrIo.prototype.getProgressEventsEnabled = function() {\n  'use strict';\n  return this.progressEventsEnabled_;\n};\n\n/**\n * Specify a Trust Tokens operation to execute alongside the request.\n * @param {!TrustTokenAttributeType} trustToken a Trust Tokens operation to\n *     execute.\n */\ngoog.net.XhrIo.prototype.setTrustToken = function(trustToken) {\n  'use strict';\n  this.trustToken_ = trustToken;\n};\n\n/**\n * Instance send that actually uses XMLHttpRequest to make a server call.\n * @param {string|goog.Uri} url Uri to make request to.\n * @param {string=} opt_method Send method, default: GET.\n * @param {ArrayBuffer|ArrayBufferView|Blob|Document|FormData|string=}\n *     opt_content Body data.\n * @param {(?Object|?goog.collections.maps.MapLike<string, string>)=}\n *     opt_headers Map of headers to add to the request.\n * @suppress {deprecated} Use deprecated goog.structs.forEach to allow different\n * types of parameters for opt_headers.\n */\ngoog.net.XhrIo.prototype.send = function(\n    url, opt_method, opt_content, opt_headers) {\n  'use strict';\n  if (this.xhr_) {\n    throw new Error(\n        '[goog.net.XhrIo] Object is active with another request=' +\n        this.lastUri_ + '; newUri=' + url);\n  }\n\n  const method = opt_method ? opt_method.toUpperCase() : 'GET';\n\n  this.lastUri_ = url;\n  this.lastError_ = '';\n  this.lastErrorCode_ = goog.net.ErrorCode.NO_ERROR;\n  this.lastMethod_ = method;\n  this.errorDispatched_ = false;\n  this.active_ = true;\n\n  // Use the factory to create the XHR object and options\n  this.xhr_ = this.createXhr();\n  this.xhrOptions_ = this.xmlHttpFactory_ ? this.xmlHttpFactory_.getOptions() :\n                                            goog.net.XmlHttp.getOptions();\n\n  // Set up the onreadystatechange callback\n  this.xhr_.onreadystatechange = goog.bind(this.onReadyStateChange_, this);\n\n  // Set up upload/download progress events, if progress events are supported.\n  if (this.getProgressEventsEnabled() && 'onprogress' in this.xhr_) {\n    this.xhr_.onprogress = goog.bind(function(e) {\n      'use strict';\n      this.onProgressHandler_(e, true);\n    }, this);\n    if (this.xhr_.upload) {\n      this.xhr_.upload.onprogress = goog.bind(this.onProgressHandler_, this);\n    }\n  }\n\n  /**\n   * Try to open the XMLHttpRequest (always async), if an error occurs here it\n   * is generally permission denied\n   */\n  try {\n    goog.log.fine(this.logger_, this.formatMsg_('Opening Xhr'));\n    this.inOpen_ = true;\n    this.xhr_.open(method, String(url), true);  // Always async!\n    this.inOpen_ = false;\n  } catch (err) {\n    goog.log.fine(\n        this.logger_, this.formatMsg_('Error opening Xhr: ' + err.message));\n    this.error_(goog.net.ErrorCode.EXCEPTION, err);\n    return;\n  }\n\n  // We can't use null since this won't allow requests with form data to have a\n  // content length specified which will cause some proxies to return a 411\n  // error.\n  const content = opt_content || '';\n\n  const headers = new Map(this.headers);\n\n  // Add headers specific to this request\n  if (opt_headers) {\n    if (Object.getPrototypeOf(opt_headers) === Object.prototype) {\n      for (let key in opt_headers) {\n        headers.set(key, opt_headers[key]);\n      }\n    } else if (\n        typeof opt_headers.keys === 'function' &&\n        typeof opt_headers.get === 'function') {\n      for (const key of opt_headers.keys()) {\n        headers.set(key, opt_headers.get(key));\n      }\n    } else {\n      throw new Error(\n          'Unknown input type for opt_headers: ' + String(opt_headers));\n    }\n  }\n\n  // Find whether a content type header is set, ignoring case.\n  // HTTP header names are case-insensitive.  See:\n  // http://www.w3.org/Protocols/rfc2616/rfc2616-sec4.html#sec4.2\n  const contentTypeKey =\n      Array.from(headers.keys())\n          .find(\n              header => goog.string.caseInsensitiveEquals(\n                  goog.net.XhrIo.CONTENT_TYPE_HEADER, header));\n\n  const contentIsFormData =\n      (goog.global['FormData'] && (content instanceof goog.global['FormData']));\n  if (goog.array.contains(goog.net.XhrIo.METHODS_WITH_FORM_DATA, method) &&\n      !contentTypeKey && !contentIsFormData) {\n    // For requests typically with form data, default to the url-encoded form\n    // content type unless this is a FormData request.  For FormData,\n    // the browser will automatically add a multipart/form-data content type\n    // with an appropriate multipart boundary.\n    headers.set(\n        goog.net.XhrIo.CONTENT_TYPE_HEADER, goog.net.XhrIo.FORM_CONTENT_TYPE);\n  }\n\n  // Add the headers to the Xhr object\n  for (const [key, value] of headers) {\n    this.xhr_.setRequestHeader(key, value);\n  }\n\n  if (this.responseType_) {\n    this.xhr_.responseType = this.responseType_;\n  }\n  // Set xhr_.withCredentials only when the value is different, or else in\n  // synchronous XMLHtppRequest.open Firefox will throw an exception.\n  // https://bugzilla.mozilla.org/show_bug.cgi?id=736340\n  if ('withCredentials' in this.xhr_ &&\n      this.xhr_.withCredentials !== this.withCredentials_) {\n    this.xhr_.withCredentials = this.withCredentials_;\n  }\n\n  if ('setTrustToken' in this.xhr_ && this.trustToken_) {\n    try {\n      this.xhr_.setTrustToken(this.trustToken_);\n    } catch (err) {\n      goog.log.fine(\n          this.logger_, this.formatMsg_('Error SetTrustToken: ' + err.message));\n    }\n  }\n  /**\n   * Try to send the request, or other wise report an error (404 not found).\n   */\n  try {\n    this.cleanUpTimeoutTimer_();  // Paranoid, should never be running.\n    if (this.timeoutInterval_ > 0) {\n      this.useXhr2Timeout_ = goog.net.XhrIo.shouldUseXhr2Timeout_(this.xhr_);\n      goog.log.fine(\n          this.logger_,\n          this.formatMsg_(\n              'Will abort after ' + this.timeoutInterval_ +\n              'ms if incomplete, xhr2 ' + this.useXhr2Timeout_));\n      if (this.useXhr2Timeout_) {\n        this.xhr_[goog.net.XhrIo.XHR2_TIMEOUT_] = this.timeoutInterval_;\n        this.xhr_[goog.net.XhrIo.XHR2_ON_TIMEOUT_] =\n            goog.bind(this.timeout_, this);\n      } else {\n        this.timeoutId_ =\n            goog.Timer.callOnce(this.timeout_, this.timeoutInterval_, this);\n      }\n    }\n    goog.log.fine(this.logger_, this.formatMsg_('Sending request'));\n    this.inSend_ = true;\n    this.xhr_.send(content);\n    this.inSend_ = false;\n\n  } catch (err) {\n    goog.log.fine(this.logger_, this.formatMsg_('Send error: ' + err.message));\n    this.error_(goog.net.ErrorCode.EXCEPTION, err);\n  }\n};\n\n\n/**\n * Determines if the argument is an XMLHttpRequest that supports the level 2\n * timeout value and event.\n *\n * Currently, FF 21.0 OS X has the fields but won't actually call the timeout\n * handler.  Perhaps the confusion in the bug referenced below hasn't\n * entirely been resolved.\n *\n * @see http://www.w3.org/TR/XMLHttpRequest/#the-timeout-attribute\n * @see https://bugzilla.mozilla.org/show_bug.cgi?id=525816\n *\n * @param {!goog.net.XhrLike.OrNative} xhr The request.\n * @return {boolean} True if the request supports level 2 timeout.\n * @private\n */\ngoog.net.XhrIo.shouldUseXhr2Timeout_ = function(xhr) {\n  'use strict';\n  return goog.userAgent.IE && goog.userAgent.isVersionOrHigher(9) &&\n      typeof xhr[goog.net.XhrIo.XHR2_TIMEOUT_] === 'number' &&\n      xhr[goog.net.XhrIo.XHR2_ON_TIMEOUT_] !== undefined;\n};\n\n\n/**\n * Creates a new XHR object.\n * @return {!goog.net.XhrLike.OrNative} The newly created XHR object.\n * @protected\n */\ngoog.net.XhrIo.prototype.createXhr = function() {\n  'use strict';\n  return this.xmlHttpFactory_ ? this.xmlHttpFactory_.createInstance() :\n                                goog.net.XmlHttp();\n};\n\n\n/**\n * The request didn't complete after {@link goog.net.XhrIo#timeoutInterval_}\n * milliseconds; raises a {@link goog.net.EventType.TIMEOUT} event and aborts\n * the request.\n * @private\n */\ngoog.net.XhrIo.prototype.timeout_ = function() {\n  'use strict';\n  if (typeof goog == 'undefined') {\n    // If goog is undefined then the callback has occurred as the application\n    // is unloading and will error.  Thus we let it silently fail.\n  } else if (this.xhr_) {\n    this.lastError_ =\n        'Timed out after ' + this.timeoutInterval_ + 'ms, aborting';\n    this.lastErrorCode_ = goog.net.ErrorCode.TIMEOUT;\n    goog.log.fine(this.logger_, this.formatMsg_(this.lastError_));\n    this.dispatchEvent(goog.net.EventType.TIMEOUT);\n    this.abort(goog.net.ErrorCode.TIMEOUT);\n  }\n};\n\n\n/**\n * Something errorred, so inactivate, fire error callback and clean up\n * @param {goog.net.ErrorCode} errorCode The error code.\n * @param {Error} err The error object.\n * @private\n */\ngoog.net.XhrIo.prototype.error_ = function(errorCode, err) {\n  'use strict';\n  this.active_ = false;\n  if (this.xhr_) {\n    this.inAbort_ = true;\n    this.xhr_.abort();  // Ensures XHR isn't hung (FF)\n    this.inAbort_ = false;\n  }\n  this.lastError_ = err;\n  this.lastErrorCode_ = errorCode;\n  this.dispatchErrors_();\n  this.cleanUpXhr_();\n};\n\n\n/**\n * Dispatches COMPLETE and ERROR in case of an error. This ensures that we do\n * not dispatch multiple error events.\n * @private\n */\ngoog.net.XhrIo.prototype.dispatchErrors_ = function() {\n  'use strict';\n  if (!this.errorDispatched_) {\n    this.errorDispatched_ = true;\n    this.dispatchEvent(goog.net.EventType.COMPLETE);\n    this.dispatchEvent(goog.net.EventType.ERROR);\n  }\n};\n\n\n/**\n * Abort the current XMLHttpRequest\n * @param {goog.net.ErrorCode=} opt_failureCode Optional error code to use -\n *     defaults to ABORT.\n */\ngoog.net.XhrIo.prototype.abort = function(opt_failureCode) {\n  'use strict';\n  if (this.xhr_ && this.active_) {\n    goog.log.fine(this.logger_, this.formatMsg_('Aborting'));\n    this.active_ = false;\n    this.inAbort_ = true;\n    this.xhr_.abort();\n    this.inAbort_ = false;\n    this.lastErrorCode_ = opt_failureCode || goog.net.ErrorCode.ABORT;\n    this.dispatchEvent(goog.net.EventType.COMPLETE);\n    this.dispatchEvent(goog.net.EventType.ABORT);\n    this.cleanUpXhr_();\n  }\n};\n\n\n/**\n * Nullifies all callbacks to reduce risks of leaks.\n * @override\n * @protected\n */\ngoog.net.XhrIo.prototype.disposeInternal = function() {\n  'use strict';\n  if (this.xhr_) {\n    // We explicitly do not call xhr_.abort() unless active_ is still true.\n    // This is to avoid unnecessarily aborting a successful request when\n    // dispose() is called in a callback triggered by a complete response, but\n    // in which browser cleanup has not yet finished.\n    // (See http://b/issue?id=1684217.)\n    if (this.active_) {\n      this.active_ = false;\n      this.inAbort_ = true;\n      this.xhr_.abort();\n      this.inAbort_ = false;\n    }\n    this.cleanUpXhr_(true);\n  }\n\n  XhrIo.base(this, 'disposeInternal');\n};\n\n\n/**\n * Internal handler for the XHR object's readystatechange event.  This method\n * checks the status and the readystate and fires the correct callbacks.\n * If the request has ended, the handlers are cleaned up and the XHR object is\n * nullified.\n * @private\n */\ngoog.net.XhrIo.prototype.onReadyStateChange_ = function() {\n  'use strict';\n  if (this.isDisposed()) {\n    // This method is the target of an untracked goog.Timer.callOnce().\n    return;\n  }\n  if (!this.inOpen_ && !this.inSend_ && !this.inAbort_) {\n    // Were not being called from within a call to this.xhr_.send\n    // this.xhr_.abort, or this.xhr_.open, so this is an entry point\n    this.onReadyStateChangeEntryPoint_();\n  } else {\n    this.onReadyStateChangeHelper_();\n  }\n};\n\n\n/**\n * Used to protect the onreadystatechange handler entry point.  Necessary\n * as {#onReadyStateChange_} maybe called from within send or abort, this\n * method is only called when {#onReadyStateChange_} is called as an\n * entry point.\n * {@see #protectEntryPoints}\n * @private\n */\ngoog.net.XhrIo.prototype.onReadyStateChangeEntryPoint_ = function() {\n  'use strict';\n  this.onReadyStateChangeHelper_();\n};\n\n\n/**\n * Helper for {@link #onReadyStateChange_}.  This is used so that\n * entry point calls to {@link #onReadyStateChange_} can be routed through\n * {@link #onReadyStateChangeEntryPoint_}.\n * @private\n */\ngoog.net.XhrIo.prototype.onReadyStateChangeHelper_ = function() {\n  'use strict';\n  if (!this.active_) {\n    // can get called inside abort call\n    return;\n  }\n\n  if (typeof goog == 'undefined') {\n    // NOTE(user): If goog is undefined then the callback has occurred as the\n    // application is unloading and will error.  Thus we let it silently fail.\n\n  } else if (\n      this.xhrOptions_[goog.net.XmlHttp.OptionType.LOCAL_REQUEST_ERROR] &&\n      this.getReadyState() == goog.net.XmlHttp.ReadyState.COMPLETE &&\n      this.getStatus() == 2) {\n    // NOTE(user): In IE if send() errors on a *local* request the readystate\n    // is still changed to COMPLETE.  We need to ignore it and allow the\n    // try/catch around send() to pick up the error.\n    goog.log.fine(\n        this.logger_,\n        this.formatMsg_('Local request error detected and ignored'));\n\n  } else {\n    // In IE when the response has been cached we sometimes get the callback\n    // from inside the send call and this usually breaks code that assumes that\n    // XhrIo is asynchronous.  If that is the case we delay the callback\n    // using a timer.\n    if (this.inSend_ &&\n        this.getReadyState() == goog.net.XmlHttp.ReadyState.COMPLETE) {\n      goog.Timer.callOnce(this.onReadyStateChange_, 0, this);\n      return;\n    }\n\n    this.dispatchEvent(goog.net.EventType.READY_STATE_CHANGE);\n\n    // readyState indicates the transfer has finished\n    if (this.isComplete()) {\n      goog.log.fine(this.logger_, this.formatMsg_('Request complete'));\n\n      this.active_ = false;\n\n      try {\n        // Call the specific callbacks for success or failure. Only call the\n        // success if the status is 200 (HTTP_OK) or 304 (HTTP_CACHED)\n        if (this.isSuccess()) {\n          this.dispatchEvent(goog.net.EventType.COMPLETE);\n          this.dispatchEvent(goog.net.EventType.SUCCESS);\n        } else {\n          this.lastErrorCode_ = goog.net.ErrorCode.HTTP_ERROR;\n          this.lastError_ =\n              this.getStatusText() + ' [' + this.getStatus() + ']';\n          this.dispatchErrors_();\n        }\n      } finally {\n        this.cleanUpXhr_();\n      }\n    }\n  }\n};\n\n\n/**\n * Internal handler for the XHR object's onprogress event. Fires both a generic\n * PROGRESS event and either a DOWNLOAD_PROGRESS or UPLOAD_PROGRESS event to\n * allow specific binding for each XHR progress event.\n * @param {!ProgressEvent} e XHR progress event.\n * @param {boolean=} opt_isDownload Whether the current progress event is from a\n *     download. Used to determine whether DOWNLOAD_PROGRESS or UPLOAD_PROGRESS\n *     event should be dispatched.\n * @private\n */\ngoog.net.XhrIo.prototype.onProgressHandler_ = function(e, opt_isDownload) {\n  'use strict';\n  goog.asserts.assert(\n      e.type === goog.net.EventType.PROGRESS,\n      'goog.net.EventType.PROGRESS is of the same type as raw XHR progress.');\n  this.dispatchEvent(\n      goog.net.XhrIo.buildProgressEvent_(e, goog.net.EventType.PROGRESS));\n  this.dispatchEvent(goog.net.XhrIo.buildProgressEvent_(\n      e,\n      opt_isDownload ? goog.net.EventType.DOWNLOAD_PROGRESS :\n                       goog.net.EventType.UPLOAD_PROGRESS));\n};\n\n\n/**\n * Creates a representation of the native ProgressEvent. IE doesn't support\n * constructing ProgressEvent via \"new\", and the alternatives (e.g.,\n * ProgressEvent.initProgressEvent) are non-standard or deprecated.\n * @param {!ProgressEvent} e XHR progress event.\n * @param {!goog.net.EventType} eventType The type of the event.\n * @return {!ProgressEvent} The progress event.\n * @private\n */\ngoog.net.XhrIo.buildProgressEvent_ = function(e, eventType) {\n  'use strict';\n  return /** @type {!ProgressEvent} */ ({\n    type: eventType,\n    lengthComputable: e.lengthComputable,\n    loaded: e.loaded,\n    total: e.total,\n  });\n};\n\n\n/**\n * Remove the listener to protect against leaks, and nullify the XMLHttpRequest\n * object.\n * @param {boolean=} opt_fromDispose If this is from the dispose (don't want to\n *     fire any events).\n * @private\n */\ngoog.net.XhrIo.prototype.cleanUpXhr_ = function(opt_fromDispose) {\n  'use strict';\n  if (this.xhr_) {\n    // Cancel any pending timeout event handler.\n    this.cleanUpTimeoutTimer_();\n\n    // Save reference so we can mark it as closed after the READY event.  The\n    // READY event may trigger another request, thus we must nullify this.xhr_\n    const xhr = this.xhr_;\n    const clearedOnReadyStateChange =\n        this.xhrOptions_[goog.net.XmlHttp.OptionType.USE_NULL_FUNCTION] ?\n        goog.nullFunction :\n        null;\n    this.xhr_ = null;\n    this.xhrOptions_ = null;\n\n    if (!opt_fromDispose) {\n      this.dispatchEvent(goog.net.EventType.READY);\n    }\n\n    try {\n      // NOTE(user): Not nullifying in FireFox can still leak if the callbacks\n      // are defined in the same scope as the instance of XhrIo. But, IE doesn't\n      // allow you to set the onreadystatechange to NULL so nullFunction is\n      // used.\n      xhr.onreadystatechange = clearedOnReadyStateChange;\n    } catch (e) {\n      // This seems to occur with a Gears HTTP request. Delayed the setting of\n      // this onreadystatechange until after READY is sent out and catching the\n      // error to see if we can track down the problem.\n      goog.log.error(\n          this.logger_,\n          'Problem encountered resetting onreadystatechange: ' + e.message);\n    }\n  }\n};\n\n\n/**\n * Make sure the timeout timer isn't running.\n * @private\n */\ngoog.net.XhrIo.prototype.cleanUpTimeoutTimer_ = function() {\n  'use strict';\n  if (this.xhr_ && this.useXhr2Timeout_) {\n    this.xhr_[goog.net.XhrIo.XHR2_ON_TIMEOUT_] = null;\n  }\n  if (this.timeoutId_) {\n    goog.Timer.clear(this.timeoutId_);\n    this.timeoutId_ = null;\n  }\n};\n\n\n/**\n * @return {boolean} Whether there is an active request.\n */\ngoog.net.XhrIo.prototype.isActive = function() {\n  'use strict';\n  return !!this.xhr_;\n};\n\n\n/**\n * @return {boolean} Whether the request has completed.\n */\ngoog.net.XhrIo.prototype.isComplete = function() {\n  'use strict';\n  return this.getReadyState() == goog.net.XmlHttp.ReadyState.COMPLETE;\n};\n\n\n/**\n * @return {boolean} Whether the request completed with a success.\n */\ngoog.net.XhrIo.prototype.isSuccess = function() {\n  'use strict';\n  const status = this.getStatus();\n  // A zero status code is considered successful for local files.\n  return goog.net.HttpStatus.isSuccess(status) ||\n      status === 0 && !this.isLastUriEffectiveSchemeHttp_();\n};\n\n\n/**\n * @return {boolean} whether the effective scheme of the last URI that was\n *     fetched was 'http' or 'https'.\n * @private\n */\ngoog.net.XhrIo.prototype.isLastUriEffectiveSchemeHttp_ = function() {\n  'use strict';\n  const scheme = goog.uri.utils.getEffectiveScheme(String(this.lastUri_));\n  return HTTP_SCHEME_PATTERN.test(scheme);\n};\n\n\n/**\n * Get the readystate from the Xhr object\n * Will only return correct result when called from the context of a callback\n * @return {goog.net.XmlHttp.ReadyState} goog.net.XmlHttp.ReadyState.*.\n */\ngoog.net.XhrIo.prototype.getReadyState = function() {\n  'use strict';\n  return this.xhr_ ?\n      /** @type {goog.net.XmlHttp.ReadyState} */ (this.xhr_.readyState) :\n      goog.net.XmlHttp.ReadyState.UNINITIALIZED;\n};\n\n\n/**\n * Get the status from the Xhr object\n * Will only return correct result when called from the context of a callback\n * @return {number} Http status.\n */\ngoog.net.XhrIo.prototype.getStatus = function() {\n  'use strict';\n  /**\n   * IE doesn't like you checking status until the readystate is greater than 2\n   * (i.e. it is receiving or complete).  The try/catch is used for when the\n   * page is unloading and an ERROR_NOT_AVAILABLE may occur when accessing xhr_.\n   */\n  try {\n    return this.getReadyState() > goog.net.XmlHttp.ReadyState.LOADED ?\n        this.xhr_.status :\n        -1;\n  } catch (e) {\n    return -1;\n  }\n};\n\n\n/**\n * Get the status text from the Xhr object\n * Will only return correct result when called from the context of a callback\n * @return {string} Status text.\n */\ngoog.net.XhrIo.prototype.getStatusText = function() {\n  'use strict';\n  /**\n   * IE doesn't like you checking status until the readystate is greater than 2\n   * (i.e. it is receiving or complete).  The try/catch is used for when the\n   * page is unloading and an ERROR_NOT_AVAILABLE may occur when accessing xhr_.\n   */\n  try {\n    return this.getReadyState() > goog.net.XmlHttp.ReadyState.LOADED ?\n        this.xhr_.statusText :\n        '';\n  } catch (e) {\n    goog.log.fine(this.logger_, 'Can not get status: ' + e.message);\n    return '';\n  }\n};\n\n\n/**\n * Get the last Uri that was requested\n * @return {string} Last Uri.\n */\ngoog.net.XhrIo.prototype.getLastUri = function() {\n  'use strict';\n  return String(this.lastUri_);\n};\n\n\n/**\n * Get the response text from the Xhr object\n * Will only return correct result when called from the context of a callback.\n * @return {string} Result from the server, or '' if no result available.\n */\ngoog.net.XhrIo.prototype.getResponseText = function() {\n  'use strict';\n  try {\n    return this.xhr_ ? this.xhr_.responseText : '';\n  } catch (e) {\n    // http://www.w3.org/TR/XMLHttpRequest/#the-responsetext-attribute\n    // states that responseText should return '' (and responseXML null)\n    // when the state is not LOADING or DONE. Instead, IE can\n    // throw unexpected exceptions, for example when a request is aborted\n    // or no data is available yet.\n    goog.log.fine(this.logger_, 'Can not get responseText: ' + e.message);\n    return '';\n  }\n};\n\n\n/**\n * Get the response body from the Xhr object. This property is only available\n * in IE since version 7 according to MSDN:\n * http://msdn.microsoft.com/en-us/library/ie/ms534368(v=vs.85).aspx\n * Will only return correct result when called from the context of a callback.\n *\n * One option is to construct a VBArray from the returned object and convert\n * it to a JavaScript array using the toArray method:\n * `(new window['VBArray'](xhrIo.getResponseBody())).toArray()`\n * This will result in an array of numbers in the range of [0..255]\n *\n * Another option is to use the VBScript CStr method to convert it into a\n * string as outlined in http://stackoverflow.com/questions/1919972\n *\n * @return {Object} Binary result from the server or null if not available.\n */\ngoog.net.XhrIo.prototype.getResponseBody = function() {\n  'use strict';\n  try {\n    if (this.xhr_ && 'responseBody' in this.xhr_) {\n      return this.xhr_['responseBody'];\n    }\n  } catch (e) {\n    // IE can throw unexpected exceptions, for example when a request is aborted\n    // or no data is yet available.\n    goog.log.fine(this.logger_, 'Can not get responseBody: ' + e.message);\n  }\n  return null;\n};\n\n\n/**\n * Get the response XML from the Xhr object\n * Will only return correct result when called from the context of a callback.\n * @return {Document} The DOM Document representing the XML file, or null\n * if no result available.\n */\ngoog.net.XhrIo.prototype.getResponseXml = function() {\n  'use strict';\n  try {\n    return this.xhr_ ? this.xhr_.responseXML : null;\n  } catch (e) {\n    goog.log.fine(this.logger_, 'Can not get responseXML: ' + e.message);\n    return null;\n  }\n};\n\n\n/**\n * Get the response and evaluates it as JSON from the Xhr object\n * Will only return correct result when called from the context of a callback\n * @param {string=} opt_xssiPrefix Optional XSSI prefix string to use for\n *     stripping of the response before parsing. This needs to be set only if\n *     your backend server prepends the same prefix string to the JSON response.\n * @throws Error if the response text is invalid JSON.\n * @return {Object|undefined} JavaScript object.\n */\ngoog.net.XhrIo.prototype.getResponseJson = function(opt_xssiPrefix) {\n  'use strict';\n  if (!this.xhr_) {\n    return undefined;\n  }\n\n  let responseText = this.xhr_.responseText;\n  if (opt_xssiPrefix && responseText.indexOf(opt_xssiPrefix) == 0) {\n    responseText = responseText.substring(opt_xssiPrefix.length);\n  }\n\n  return goog.json.hybrid.parse(responseText);\n};\n\n\n/**\n * Get the response as the type specificed by {@link #setResponseType}. At time\n * of writing, this is only directly supported in very recent versions of WebKit\n * (10.0.612.1 dev and later). If the field is not supported directly, we will\n * try to emulate it.\n *\n * Emulating the response means following the rules laid out at\n * http://www.w3.org/TR/XMLHttpRequest/#the-response-attribute\n *\n * On browsers with no support for this (Chrome < 10, Firefox < 4, etc), only\n * response types of DEFAULT or TEXT may be used, and the response returned will\n * be the text response.\n *\n * On browsers with Mozilla's draft support for array buffers (Firefox 4, 5),\n * only response types of DEFAULT, TEXT, and ARRAY_BUFFER may be used, and the\n * response returned will be either the text response or the Mozilla\n * implementation of the array buffer response.\n *\n * On browsers will full support, any valid response type supported by the\n * browser may be used, and the response provided by the browser will be\n * returned.\n *\n * @return {*} The response.\n */\ngoog.net.XhrIo.prototype.getResponse = function() {\n  'use strict';\n  try {\n    if (!this.xhr_) {\n      return null;\n    }\n    if ('response' in this.xhr_) {\n      return this.xhr_.response;\n    }\n    switch (this.responseType_) {\n      case ResponseType.DEFAULT:\n      case ResponseType.TEXT:\n        return this.xhr_.responseText;\n      // DOCUMENT and BLOB don't need to be handled here because they are\n      // introduced in the same spec that adds the .response field, and would\n      // have been caught above.\n      // ARRAY_BUFFER needs an implementation for Firefox 4, where it was\n      // implemented using a draft spec rather than the final spec.\n      case ResponseType.ARRAY_BUFFER:\n        if ('mozResponseArrayBuffer' in this.xhr_) {\n          return this.xhr_.mozResponseArrayBuffer;\n        }\n    }\n    // Fell through to a response type that is not supported on this browser.\n    goog.log.error(\n        this.logger_,\n        'Response type ' + this.responseType_ + ' is not ' +\n            'supported on this browser');\n    return null;\n  } catch (e) {\n    goog.log.fine(this.logger_, 'Can not get response: ' + e.message);\n    return null;\n  }\n};\n\n\n/**\n * Get the value of the response-header with the given name from the Xhr object\n * Will only return correct result when called from the context of a callback\n * and the request has completed\n * @param {string} key The name of the response-header to retrieve.\n * @return {string|undefined} The value of the response-header named key.\n */\ngoog.net.XhrIo.prototype.getResponseHeader = function(key) {\n  'use strict';\n  if (!this.xhr_ || !this.isComplete()) {\n    return undefined;\n  }\n\n  const value = this.xhr_.getResponseHeader(key);\n  return value === null ? undefined : value;\n};\n\n\n/**\n * Gets the text of all the headers in the response.\n * Will only return correct result when called from the context of a callback\n * and the request has completed.\n * @return {string} The value of the response headers or empty string.\n */\ngoog.net.XhrIo.prototype.getAllResponseHeaders = function() {\n  'use strict';\n  // getAllResponseHeaders can return null if no response has been received,\n  // ensure we always return an empty string.\n  return this.xhr_ && this.isComplete() ?\n      (this.xhr_.getAllResponseHeaders() || '') :\n      '';\n};\n\n\n/**\n * Returns all response headers as a key-value map.\n * Multiple values for the same header key can be combined into one,\n * separated by a comma and a space.\n * Note that the native getResponseHeader method for retrieving a single header\n * does a case insensitive match on the header name. This method does not\n * include any case normalization logic, it will just return a key-value\n * representation of the headers.\n * See: http://www.w3.org/TR/XMLHttpRequest/#the-getresponseheader()-method\n * @return {!Object<string, string>} An object with the header keys as keys\n *     and header values as values.\n */\ngoog.net.XhrIo.prototype.getResponseHeaders = function() {\n  'use strict';\n  // TODO(user): Make this function parse headers as per the spec\n  // (https://tools.ietf.org/html/rfc2616#section-4.2).\n\n  const headersObject = {};\n  const headersArray = this.getAllResponseHeaders().split('\\r\\n');\n  for (let i = 0; i < headersArray.length; i++) {\n    if (goog.string.isEmptyOrWhitespace(headersArray[i])) {\n      continue;\n    }\n    const keyValue =\n        goog.string.splitLimit(headersArray[i], ':', /* maxSplitCount= */ 1);\n    const key = keyValue[0];\n    let value = keyValue[1];\n\n    if (typeof value !== 'string') {\n      // There must be a value but it can be the empty string.\n      continue;\n    }\n\n    // Whitespace at the start and end of the value is meaningless.\n    value = value.trim();\n    // The key should not contain whitespace but we currently ignore that.\n\n    const values = headersObject[key] || [];\n    headersObject[key] = values;\n    values.push(value);\n  }\n\n  return goog.object.map(headersObject, function(values) {\n    'use strict';\n    return values.join(', ');\n  });\n};\n\n\n/**\n * Get the value of the response-header with the given name from the Xhr object.\n * As opposed to {@link #getResponseHeader}, this method does not require that\n * the request has completed.\n * @param {string} key The name of the response-header to retrieve.\n * @return {?string} The value of the response-header, or null if it is\n *     unavailable.\n */\ngoog.net.XhrIo.prototype.getStreamingResponseHeader = function(key) {\n  'use strict';\n  return this.xhr_ ? this.xhr_.getResponseHeader(key) : null;\n};\n\n\n/**\n * Gets the text of all the headers in the response. As opposed to\n * {@link #getAllResponseHeaders}, this method does not require that the request\n * has completed.\n * @return {string} The value of the response headers or empty string.\n */\ngoog.net.XhrIo.prototype.getAllStreamingResponseHeaders = function() {\n  'use strict';\n  return this.xhr_ ? this.xhr_.getAllResponseHeaders() : '';\n};\n\n\n/**\n * Get the last error message\n * @return {!goog.net.ErrorCode} Last error code.\n */\ngoog.net.XhrIo.prototype.getLastErrorCode = function() {\n  'use strict';\n  return this.lastErrorCode_;\n};\n\n\n/**\n * Get the last error message\n * @return {string} Last error message.\n */\ngoog.net.XhrIo.prototype.getLastError = function() {\n  'use strict';\n  return typeof this.lastError_ === 'string' ? this.lastError_ :\n                                               String(this.lastError_);\n};\n\n\n/**\n * Adds the last method, status and URI to the message.  This is used to add\n * this information to the logging calls.\n * @param {string} msg The message text that we want to add the extra text to.\n * @return {string} The message with the extra text appended.\n * @private\n */\ngoog.net.XhrIo.prototype.formatMsg_ = function(msg) {\n  'use strict';\n  return msg + ' [' + this.lastMethod_ + ' ' + this.lastUri_ + ' ' +\n      this.getStatus() + ']';\n};\n\n\n// Register the xhr handler as an entry point, so that\n// it can be monitored for exception handling, etc.\ngoog.debug.entryPointRegistry.register(\n    /**\n     * @param {function(!Function): !Function} transformer The transforming\n     *     function.\n     */\n    function(transformer) {\n      'use strict';\n      goog.net.XhrIo.prototype.onReadyStateChangeEntryPoint_ =\n          transformer(goog.net.XhrIo.prototype.onReadyStateChangeEntryPoint_);\n    });\n});  // goog.scope\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview A patched, standardized event object for browser events.\n *\n * <pre>\n * The patched event object contains the following members:\n * - type           {string}    Event type, e.g. 'click'\n * - target         {Object}    The element that actually triggered the event\n * - currentTarget  {Object}    The element the listener is attached to\n * - relatedTarget  {Object}    For mouseover and mouseout, the previous object\n * - offsetX        {number}    X-coordinate relative to target\n * - offsetY        {number}    Y-coordinate relative to target\n * - clientX        {number}    X-coordinate relative to viewport\n * - clientY        {number}    Y-coordinate relative to viewport\n * - screenX        {number}    X-coordinate relative to the edge of the screen\n * - screenY        {number}    Y-coordinate relative to the edge of the screen\n * - button         {number}    Mouse button. Use isButton() to test.\n * - keyCode        {number}    Key-code\n * - ctrlKey        {boolean}   Was ctrl key depressed\n * - altKey         {boolean}   Was alt key depressed\n * - shiftKey       {boolean}   Was shift key depressed\n * - metaKey        {boolean}   Was meta key depressed\n * - pointerId      {number}    Pointer ID\n * - pointerType    {string}    Pointer type, e.g. 'mouse', 'pen', or 'touch'\n * - defaultPrevented {boolean} Whether the default action has been prevented\n * - state          {Object}    History state object\n *\n * NOTE: The keyCode member contains the raw browser keyCode. For normalized\n * key and character code use {@link goog.events.KeyHandler}.\n * </pre>\n */\n\ngoog.provide('goog.events.BrowserEvent');\ngoog.provide('goog.events.BrowserEvent.MouseButton');\ngoog.provide('goog.events.BrowserEvent.PointerType');\n\ngoog.require('goog.debug');\ngoog.require('goog.events.Event');\ngoog.require('goog.events.EventType');\ngoog.require('goog.reflect');\ngoog.require('goog.userAgent');\n\n/**\n * Accepts a browser event object and creates a patched, cross browser event\n * object.\n * The content of this object will not be initialized if no event object is\n * provided. If this is the case, init() needs to be invoked separately.\n * @param {Event=} opt_e Browser event object.\n * @param {EventTarget=} opt_currentTarget Current target for event.\n * @constructor\n * @extends {goog.events.Event}\n */\ngoog.events.BrowserEvent = function(opt_e, opt_currentTarget) {\n  'use strict';\n  goog.events.BrowserEvent.base(this, 'constructor', opt_e ? opt_e.type : '');\n\n  /**\n   * Target that fired the event.\n   * @override\n   * @type {?Node}\n   */\n  this.target = null;\n\n  /**\n   * Node that had the listener attached.\n   * @override\n   * @type {?Node|undefined}\n   */\n  this.currentTarget = null;\n\n  /**\n   * For mouseover and mouseout events, the related object for the event.\n   * @type {?Node}\n   */\n  this.relatedTarget = null;\n\n  /**\n   * X-coordinate relative to target.\n   * @type {number}\n   */\n  this.offsetX = 0;\n\n  /**\n   * Y-coordinate relative to target.\n   * @type {number}\n   */\n  this.offsetY = 0;\n\n  /**\n   * X-coordinate relative to the window.\n   * @type {number}\n   */\n  this.clientX = 0;\n\n  /**\n   * Y-coordinate relative to the window.\n   * @type {number}\n   */\n  this.clientY = 0;\n\n  /**\n   * X-coordinate relative to the monitor.\n   * @type {number}\n   */\n  this.screenX = 0;\n\n  /**\n   * Y-coordinate relative to the monitor.\n   * @type {number}\n   */\n  this.screenY = 0;\n\n  /**\n   * Which mouse button was pressed.\n   * @type {number}\n   */\n  this.button = 0;\n\n  /**\n   * Key of key press.\n   * @type {string}\n   */\n  this.key = '';\n\n  /**\n   * Keycode of key press.\n   * @type {number}\n   */\n  this.keyCode = 0;\n\n  /**\n   * Keycode of key press.\n   * @type {number}\n   */\n  this.charCode = 0;\n\n  /**\n   * Whether control was pressed at time of event.\n   * @type {boolean}\n   */\n  this.ctrlKey = false;\n\n  /**\n   * Whether alt was pressed at time of event.\n   * @type {boolean}\n   */\n  this.altKey = false;\n\n  /**\n   * Whether shift was pressed at time of event.\n   * @type {boolean}\n   */\n  this.shiftKey = false;\n\n  /**\n   * Whether the meta key was pressed at time of event.\n   * @type {boolean}\n   */\n  this.metaKey = false;\n\n  /**\n   * History state object, only set for PopState events where it's a copy of the\n   * state object provided to pushState or replaceState.\n   * @type {?Object}\n   */\n  this.state = null;\n\n  /**\n   * Whether the default platform modifier key was pressed at time of event.\n   * (This is control for all platforms except Mac, where it's Meta.)\n   * @type {boolean}\n   */\n  this.platformModifierKey = false;\n\n  /**\n   * @type {number}\n   */\n  this.pointerId = 0;\n\n  /**\n   * @type {string}\n   */\n  this.pointerType = '';\n\n  /**\n   * The browser event object.\n   * @private {?Event}\n   */\n  this.event_ = null;\n\n  if (opt_e) {\n    this.init(opt_e, opt_currentTarget);\n  }\n};\ngoog.inherits(goog.events.BrowserEvent, goog.events.Event);\n\n/**\n * @define {boolean} If true, use the layerX and layerY properties of a native\n * browser event over the offsetX and offsetY properties, which cause expensive\n * reflow. If layerX or layerY is not defined, offsetX and offsetY will be used\n * as usual.\n */\ngoog.events.BrowserEvent.USE_LAYER_XY_AS_OFFSET_XY =\n    goog.define('goog.events.BrowserEvent.USE_LAYER_XY_AS_OFFSET_XY', false);\n\n\n/**\n * Normalized button constants for the mouse.\n * @enum {number}\n */\ngoog.events.BrowserEvent.MouseButton = {\n  LEFT: 0,\n  MIDDLE: 1,\n  RIGHT: 2\n};\n\n\n/**\n * Normalized pointer type constants for pointer events.\n * @enum {string}\n */\ngoog.events.BrowserEvent.PointerType = {\n  MOUSE: 'mouse',\n  PEN: 'pen',\n  TOUCH: 'touch'\n};\n\n\n/**\n * Static data for mapping mouse buttons.\n * @type {!Array<number>}\n * @deprecated Use `goog.events.BrowserEvent.IE_BUTTON_MAP` instead.\n */\ngoog.events.BrowserEvent.IEButtonMap = goog.debug.freeze([\n  1,  // LEFT\n  4,  // MIDDLE\n  2   // RIGHT\n]);\n\n\n/**\n * Static data for mapping mouse buttons.\n * @const {!Array<number>}\n */\ngoog.events.BrowserEvent.IE_BUTTON_MAP = goog.events.BrowserEvent.IEButtonMap;\n\n\n/**\n * Static data for mapping MSPointerEvent types to PointerEvent types.\n * @const {!Object<number, goog.events.BrowserEvent.PointerType>}\n */\ngoog.events.BrowserEvent.IE_POINTER_TYPE_MAP = goog.debug.freeze({\n  2: goog.events.BrowserEvent.PointerType.TOUCH,\n  3: goog.events.BrowserEvent.PointerType.PEN,\n  4: goog.events.BrowserEvent.PointerType.MOUSE\n});\n\n\n/**\n * Accepts a browser event object and creates a patched, cross browser event\n * object.\n * @param {Event} e Browser event object.\n * @param {EventTarget=} opt_currentTarget Current target for event.\n */\ngoog.events.BrowserEvent.prototype.init = function(e, opt_currentTarget) {\n  'use strict';\n  var type = this.type = e.type;\n\n  /**\n   * On touch devices use the first \"changed touch\" as the relevant touch.\n   * @type {?Touch}\n   */\n  var relevantTouch =\n      e.changedTouches && e.changedTouches.length ? e.changedTouches[0] : null;\n\n  // TODO(nicksantos): Change this.target to type EventTarget.\n  this.target = /** @type {Node} */ (e.target) || e.srcElement;\n\n  // TODO(nicksantos): Change this.currentTarget to type EventTarget.\n  this.currentTarget = /** @type {Node} */ (opt_currentTarget);\n\n  var relatedTarget = /** @type {Node} */ (e.relatedTarget);\n  if (relatedTarget) {\n    // There's a bug in FireFox where sometimes, relatedTarget will be a\n    // chrome element, and accessing any property of it will get a permission\n    // denied exception. See:\n    // https://bugzilla.mozilla.org/show_bug.cgi?id=497780\n    if (goog.userAgent.GECKO) {\n      if (!goog.reflect.canAccessProperty(relatedTarget, 'nodeName')) {\n        relatedTarget = null;\n      }\n    }\n  } else if (type == goog.events.EventType.MOUSEOVER) {\n    relatedTarget = e.fromElement;\n  } else if (type == goog.events.EventType.MOUSEOUT) {\n    relatedTarget = e.toElement;\n  }\n\n  this.relatedTarget = relatedTarget;\n\n  if (relevantTouch) {\n    this.clientX = relevantTouch.clientX !== undefined ? relevantTouch.clientX :\n                                                         relevantTouch.pageX;\n    this.clientY = relevantTouch.clientY !== undefined ? relevantTouch.clientY :\n                                                         relevantTouch.pageY;\n    this.screenX = relevantTouch.screenX || 0;\n    this.screenY = relevantTouch.screenY || 0;\n  } else {\n    if (goog.events.BrowserEvent.USE_LAYER_XY_AS_OFFSET_XY) {\n      this.offsetX = (e.layerX !== undefined) ? e.layerX : e.offsetX;\n      this.offsetY = (e.layerY !== undefined) ? e.layerY : e.offsetY;\n    } else {\n      // Webkit emits a lame warning whenever layerX/layerY is accessed.\n      // http://code.google.com/p/chromium/issues/detail?id=101733\n      this.offsetX = (goog.userAgent.WEBKIT || e.offsetX !== undefined) ?\n          e.offsetX :\n          e.layerX;\n      this.offsetY = (goog.userAgent.WEBKIT || e.offsetY !== undefined) ?\n          e.offsetY :\n          e.layerY;\n    }\n    this.clientX = e.clientX !== undefined ? e.clientX : e.pageX;\n    this.clientY = e.clientY !== undefined ? e.clientY : e.pageY;\n    this.screenX = e.screenX || 0;\n    this.screenY = e.screenY || 0;\n  }\n\n  this.button = e.button;\n\n  this.keyCode = e.keyCode || 0;\n  this.key = e.key || '';\n  this.charCode = e.charCode || (type == 'keypress' ? e.keyCode : 0);\n  this.ctrlKey = e.ctrlKey;\n  this.altKey = e.altKey;\n  this.shiftKey = e.shiftKey;\n  this.metaKey = e.metaKey;\n  this.platformModifierKey = goog.userAgent.MAC ? e.metaKey : e.ctrlKey;\n  this.pointerId = e.pointerId || 0;\n  this.pointerType = goog.events.BrowserEvent.getPointerType_(e);\n  this.state = e.state;\n  this.event_ = e;\n  if (e.defaultPrevented) {\n    // Sync native event state to internal state via super class, where default\n    // prevention is implemented and managed.\n    goog.events.BrowserEvent.superClass_.preventDefault.call(this);\n  }\n};\n\n\n/**\n * Tests to see which button was pressed during the event. This is really only\n * useful in IE and Gecko browsers. And in IE, it's only useful for\n * mousedown/mouseup events, because click only fires for the left mouse button.\n *\n * Safari 2 only reports the left button being clicked, and uses the value '1'\n * instead of 0. Opera only reports a mousedown event for the middle button, and\n * no mouse events for the right button. Opera has default behavior for left and\n * middle click that can only be overridden via a configuration setting.\n *\n * There's a nice table of this mess at http://www.unixpapa.com/js/mouse.html.\n *\n * @param {goog.events.BrowserEvent.MouseButton} button The button\n *     to test for.\n * @return {boolean} True if button was pressed.\n */\ngoog.events.BrowserEvent.prototype.isButton = function(button) {\n  'use strict';\n  return this.event_.button == button;\n};\n\n\n/**\n * Whether this has an \"action\"-producing mouse button.\n *\n * By definition, this includes left-click on windows/linux, and left-click\n * without the ctrl key on Macs.\n *\n * @return {boolean} The result.\n */\ngoog.events.BrowserEvent.prototype.isMouseActionButton = function() {\n  'use strict';\n  // Ctrl+click should never behave like a left-click on mac, regardless of\n  // whether or not the browser will actually ever emit such an event.  If\n  // we see it, treat it like right-click always.\n  return this.isButton(goog.events.BrowserEvent.MouseButton.LEFT) &&\n      !(goog.userAgent.MAC && this.ctrlKey);\n};\n\n\n/**\n * @override\n */\ngoog.events.BrowserEvent.prototype.stopPropagation = function() {\n  'use strict';\n  goog.events.BrowserEvent.superClass_.stopPropagation.call(this);\n  if (this.event_.stopPropagation) {\n    this.event_.stopPropagation();\n  } else {\n    this.event_.cancelBubble = true;\n  }\n};\n\n\n/**\n * @override\n */\ngoog.events.BrowserEvent.prototype.preventDefault = function() {\n  'use strict';\n  goog.events.BrowserEvent.superClass_.preventDefault.call(this);\n  var be = this.event_;\n  if (!be.preventDefault) {\n    be.returnValue = false;\n  } else {\n    be.preventDefault();\n  }\n};\n\n\n/**\n * @return {Event} The underlying browser event object.\n */\ngoog.events.BrowserEvent.prototype.getBrowserEvent = function() {\n  'use strict';\n  return this.event_;\n};\n\n\n/**\n * Extracts the pointer type from the given event.\n * @param {!Event} e\n * @return {string} The pointer type, e.g. 'mouse', 'pen', or 'touch'.\n * @private\n */\ngoog.events.BrowserEvent.getPointerType_ = function(e) {\n  'use strict';\n  if (typeof (e.pointerType) === 'string') {\n    return e.pointerType;\n  }\n  // IE10 uses integer codes for pointer type.\n  // https://msdn.microsoft.com/en-us/library/hh772359(v=vs.85).aspx\n  return goog.events.BrowserEvent.IE_POINTER_TYPE_MAP[e.pointerType] || '';\n};\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Event Types.\n */\n\n\ngoog.provide('goog.events.EventType');\ngoog.provide('goog.events.EventTypeHelpers');\ngoog.provide('goog.events.MouseAsMouseEventType');\ngoog.provide('goog.events.MouseEvents');\ngoog.provide('goog.events.PointerAsMouseEventType');\ngoog.provide('goog.events.PointerAsTouchEventType');\ngoog.provide('goog.events.PointerFallbackEventType');\ngoog.provide('goog.events.PointerTouchFallbackEventType');\n\ngoog.require('goog.events.BrowserFeature');\ngoog.require('goog.userAgent');\n\n\n/**\n * Returns a prefixed event name for the current browser.\n * @param {string} eventName The name of the event.\n * @return {string} The prefixed event name.\n * @private\n */\ngoog.events.EventTypeHelpers.getVendorPrefixedName_ = function(eventName) {\n  'use strict';\n  return goog.userAgent.WEBKIT ? 'webkit' + eventName : eventName.toLowerCase();\n};\n\n\n/**\n * Constants for event names.\n * @enum {string}\n */\ngoog.events.EventType = {\n  // Mouse events\n  CLICK: 'click',\n  RIGHTCLICK: 'rightclick',\n  DBLCLICK: 'dblclick',\n  AUXCLICK: 'auxclick',\n  MOUSEDOWN: 'mousedown',\n  MOUSEUP: 'mouseup',\n  MOUSEOVER: 'mouseover',\n  MOUSEOUT: 'mouseout',\n  MOUSEMOVE: 'mousemove',\n  MOUSEENTER: 'mouseenter',\n  MOUSELEAVE: 'mouseleave',\n\n  // Non-existent event; will never fire. This exists as a mouse counterpart to\n  // POINTERCANCEL.\n  MOUSECANCEL: 'mousecancel',\n\n  // Selection events.\n  // https://www.w3.org/TR/selection-api/\n  SELECTIONCHANGE: 'selectionchange',\n  SELECTSTART: 'selectstart',  // IE, Safari, Chrome\n\n  // Wheel events\n  // http://www.w3.org/TR/DOM-Level-3-Events/#events-wheelevents\n  WHEEL: 'wheel',\n\n  // Key events\n  KEYPRESS: 'keypress',\n  KEYDOWN: 'keydown',\n  KEYUP: 'keyup',\n\n  // Focus\n  BLUR: 'blur',\n  FOCUS: 'focus',\n  DEACTIVATE: 'deactivate',  // IE only\n  FOCUSIN: 'focusin',\n  FOCUSOUT: 'focusout',\n\n  // Forms\n  CHANGE: 'change',\n  RESET: 'reset',\n  SELECT: 'select',\n  SUBMIT: 'submit',\n  INPUT: 'input',\n  PROPERTYCHANGE: 'propertychange',  // IE only\n\n  // Drag and drop\n  DRAGSTART: 'dragstart',\n  DRAG: 'drag',\n  DRAGENTER: 'dragenter',\n  DRAGOVER: 'dragover',\n  DRAGLEAVE: 'dragleave',\n  DROP: 'drop',\n  DRAGEND: 'dragend',\n\n  // Touch events\n  // Note that other touch events exist, but we should follow the W3C list here.\n  // http://www.w3.org/TR/touch-events/#list-of-touchevent-types\n  TOUCHSTART: 'touchstart',\n  TOUCHMOVE: 'touchmove',\n  TOUCHEND: 'touchend',\n  TOUCHCANCEL: 'touchcancel',\n\n  // Misc\n  BEFOREUNLOAD: 'beforeunload',\n  CONSOLEMESSAGE: 'consolemessage',\n  CONTEXTMENU: 'contextmenu',\n  DEVICECHANGE: 'devicechange',\n  DEVICEMOTION: 'devicemotion',\n  DEVICEORIENTATION: 'deviceorientation',\n  DOMCONTENTLOADED: 'DOMContentLoaded',\n  ERROR: 'error',\n  HELP: 'help',\n  LOAD: 'load',\n  LOSECAPTURE: 'losecapture',\n  ORIENTATIONCHANGE: 'orientationchange',\n  READYSTATECHANGE: 'readystatechange',\n  RESIZE: 'resize',\n  SCROLL: 'scroll',\n  UNLOAD: 'unload',\n\n  // Media events\n  CANPLAY: 'canplay',\n  CANPLAYTHROUGH: 'canplaythrough',\n  DURATIONCHANGE: 'durationchange',\n  EMPTIED: 'emptied',\n  ENDED: 'ended',\n  LOADEDDATA: 'loadeddata',\n  LOADEDMETADATA: 'loadedmetadata',\n  PAUSE: 'pause',\n  PLAY: 'play',\n  PLAYING: 'playing',\n  PROGRESS: 'progress',\n  RATECHANGE: 'ratechange',\n  SEEKED: 'seeked',\n  SEEKING: 'seeking',\n  STALLED: 'stalled',\n  SUSPEND: 'suspend',\n  TIMEUPDATE: 'timeupdate',\n  VOLUMECHANGE: 'volumechange',\n  WAITING: 'waiting',\n\n  // Media Source Extensions events\n  // https://www.w3.org/TR/media-source/#mediasource-events\n  SOURCEOPEN: 'sourceopen',\n  SOURCEENDED: 'sourceended',\n  SOURCECLOSED: 'sourceclosed',\n  // https://www.w3.org/TR/media-source/#sourcebuffer-events\n  ABORT: 'abort',\n  UPDATE: 'update',\n  UPDATESTART: 'updatestart',\n  UPDATEEND: 'updateend',\n\n  // HTML 5 History events\n  // See http://www.w3.org/TR/html5/browsers.html#event-definitions-0\n  HASHCHANGE: 'hashchange',\n  PAGEHIDE: 'pagehide',\n  PAGESHOW: 'pageshow',\n  POPSTATE: 'popstate',\n\n  // Copy and Paste\n  // Support is limited. Make sure it works on your favorite browser\n  // before using.\n  // http://www.quirksmode.org/dom/events/cutcopypaste.html\n  COPY: 'copy',\n  PASTE: 'paste',\n  CUT: 'cut',\n  BEFORECOPY: 'beforecopy',\n  BEFORECUT: 'beforecut',\n  BEFOREPASTE: 'beforepaste',\n\n  // HTML5 online/offline events.\n  // http://www.w3.org/TR/offline-webapps/#related\n  ONLINE: 'online',\n  OFFLINE: 'offline',\n\n  // HTML 5 worker events\n  MESSAGE: 'message',\n  CONNECT: 'connect',\n\n  // Service Worker Events - ServiceWorkerGlobalScope context\n  // See https://w3c.github.io/ServiceWorker/#execution-context-events\n  // Note: message event defined in worker events section\n  INSTALL: 'install',\n  ACTIVATE: 'activate',\n  FETCH: 'fetch',\n  FOREIGNFETCH: 'foreignfetch',\n  MESSAGEERROR: 'messageerror',\n\n  // Service Worker Events - Document context\n  // See https://w3c.github.io/ServiceWorker/#document-context-events\n  STATECHANGE: 'statechange',\n  UPDATEFOUND: 'updatefound',\n  CONTROLLERCHANGE: 'controllerchange',\n\n  // CSS animation events.\n  ANIMATIONSTART:\n      goog.events.EventTypeHelpers.getVendorPrefixedName_('AnimationStart'),\n  ANIMATIONEND:\n      goog.events.EventTypeHelpers.getVendorPrefixedName_('AnimationEnd'),\n  ANIMATIONITERATION:\n      goog.events.EventTypeHelpers.getVendorPrefixedName_('AnimationIteration'),\n\n  // CSS transition events. Based on the browser support described at:\n  // https://developer.mozilla.org/en/css/css_transitions#Browser_compatibility\n  TRANSITIONEND:\n      goog.events.EventTypeHelpers.getVendorPrefixedName_('TransitionEnd'),\n\n  // W3C Pointer Events\n  // http://www.w3.org/TR/pointerevents/\n  POINTERDOWN: 'pointerdown',\n  POINTERUP: 'pointerup',\n  POINTERCANCEL: 'pointercancel',\n  POINTERMOVE: 'pointermove',\n  POINTEROVER: 'pointerover',\n  POINTEROUT: 'pointerout',\n  POINTERENTER: 'pointerenter',\n  POINTERLEAVE: 'pointerleave',\n  GOTPOINTERCAPTURE: 'gotpointercapture',\n  LOSTPOINTERCAPTURE: 'lostpointercapture',\n\n  // IE specific events.\n  // See http://msdn.microsoft.com/en-us/library/ie/hh772103(v=vs.85).aspx\n  // Note: these events will be supplanted in IE11.\n  MSGESTURECHANGE: 'MSGestureChange',\n  MSGESTUREEND: 'MSGestureEnd',\n  MSGESTUREHOLD: 'MSGestureHold',\n  MSGESTURESTART: 'MSGestureStart',\n  MSGESTURETAP: 'MSGestureTap',\n  MSGOTPOINTERCAPTURE: 'MSGotPointerCapture',\n  MSINERTIASTART: 'MSInertiaStart',\n  MSLOSTPOINTERCAPTURE: 'MSLostPointerCapture',\n  MSPOINTERCANCEL: 'MSPointerCancel',\n  MSPOINTERDOWN: 'MSPointerDown',\n  MSPOINTERENTER: 'MSPointerEnter',\n  MSPOINTERHOVER: 'MSPointerHover',\n  MSPOINTERLEAVE: 'MSPointerLeave',\n  MSPOINTERMOVE: 'MSPointerMove',\n  MSPOINTEROUT: 'MSPointerOut',\n  MSPOINTEROVER: 'MSPointerOver',\n  MSPOINTERUP: 'MSPointerUp',\n\n  // Native IMEs/input tools events.\n  TEXT: 'text',\n  // The textInput event is supported in IE9+, but only in lower case. All other\n  // browsers use the camel-case event name.\n  TEXTINPUT: goog.userAgent.IE ? 'textinput' : 'textInput',\n  COMPOSITIONSTART: 'compositionstart',\n  COMPOSITIONUPDATE: 'compositionupdate',\n  COMPOSITIONEND: 'compositionend',\n\n  // The beforeinput event is initially only supported in Safari. See\n  // https://bugs.chromium.org/p/chromium/issues/detail?id=342670 for Chrome\n  // implementation tracking.\n  BEFOREINPUT: 'beforeinput',\n\n  // Webview tag events\n  // See https://developer.chrome.com/apps/tags/webview\n  EXIT: 'exit',\n  LOADABORT: 'loadabort',\n  LOADCOMMIT: 'loadcommit',\n  LOADREDIRECT: 'loadredirect',\n  LOADSTART: 'loadstart',\n  LOADSTOP: 'loadstop',\n  RESPONSIVE: 'responsive',\n  SIZECHANGED: 'sizechanged',\n  UNRESPONSIVE: 'unresponsive',\n\n  // HTML5 Page Visibility API.  See details at\n  // `goog.labs.dom.PageVisibilityMonitor`.\n  VISIBILITYCHANGE: 'visibilitychange',\n\n  // LocalStorage event.\n  STORAGE: 'storage',\n\n  // DOM Level 2 mutation events (deprecated).\n  DOMSUBTREEMODIFIED: 'DOMSubtreeModified',\n  DOMNODEINSERTED: 'DOMNodeInserted',\n  DOMNODEREMOVED: 'DOMNodeRemoved',\n  DOMNODEREMOVEDFROMDOCUMENT: 'DOMNodeRemovedFromDocument',\n  DOMNODEINSERTEDINTODOCUMENT: 'DOMNodeInsertedIntoDocument',\n  DOMATTRMODIFIED: 'DOMAttrModified',\n  DOMCHARACTERDATAMODIFIED: 'DOMCharacterDataModified',\n\n  // Print events.\n  BEFOREPRINT: 'beforeprint',\n  AFTERPRINT: 'afterprint',\n\n  // Web app manifest events.\n  BEFOREINSTALLPROMPT: 'beforeinstallprompt',\n  APPINSTALLED: 'appinstalled'\n};\n\n\n/**\n * Returns one of the given pointer fallback event names in order of preference:\n *   1. pointerEventName\n *   2. msPointerEventName\n *   3. fallbackEventName\n * @param {string} pointerEventName\n * @param {string} msPointerEventName\n * @param {string} fallbackEventName\n * @return {string} The supported pointer or fallback (mouse or touch) event\n *     name.\n * @private\n */\ngoog.events.EventTypeHelpers.getPointerFallbackEventName_ = function(\n    pointerEventName, msPointerEventName, fallbackEventName) {\n  'use strict';\n  if (goog.events.BrowserFeature.POINTER_EVENTS) {\n    return pointerEventName;\n  }\n  if (goog.events.BrowserFeature.MSPOINTER_EVENTS) {\n    return msPointerEventName;\n  }\n  return fallbackEventName;\n};\n\n\n/**\n * Constants for pointer event names that fall back to corresponding mouse event\n * names on unsupported platforms. These are intended to be drop-in replacements\n * for corresponding values in `goog.events.EventType`.\n * @enum {string}\n */\ngoog.events.PointerFallbackEventType = {\n  POINTERDOWN: goog.events.EventTypeHelpers.getPointerFallbackEventName_(\n      goog.events.EventType.POINTERDOWN, goog.events.EventType.MSPOINTERDOWN,\n      goog.events.EventType.MOUSEDOWN),\n  POINTERUP: goog.events.EventTypeHelpers.getPointerFallbackEventName_(\n      goog.events.EventType.POINTERUP, goog.events.EventType.MSPOINTERUP,\n      goog.events.EventType.MOUSEUP),\n  POINTERCANCEL: goog.events.EventTypeHelpers.getPointerFallbackEventName_(\n      goog.events.EventType.POINTERCANCEL,\n      goog.events.EventType.MSPOINTERCANCEL,\n      // When falling back to mouse events, there is no MOUSECANCEL equivalent\n      // of POINTERCANCEL. In this case POINTERUP already falls back to MOUSEUP\n      // which represents both UP and CANCEL. POINTERCANCEL does not fall back\n      // to MOUSEUP to prevent listening twice on the same event.\n      goog.events.EventType.MOUSECANCEL),\n  POINTERMOVE: goog.events.EventTypeHelpers.getPointerFallbackEventName_(\n      goog.events.EventType.POINTERMOVE, goog.events.EventType.MSPOINTERMOVE,\n      goog.events.EventType.MOUSEMOVE),\n  POINTEROVER: goog.events.EventTypeHelpers.getPointerFallbackEventName_(\n      goog.events.EventType.POINTEROVER, goog.events.EventType.MSPOINTEROVER,\n      goog.events.EventType.MOUSEOVER),\n  POINTEROUT: goog.events.EventTypeHelpers.getPointerFallbackEventName_(\n      goog.events.EventType.POINTEROUT, goog.events.EventType.MSPOINTEROUT,\n      goog.events.EventType.MOUSEOUT),\n  POINTERENTER: goog.events.EventTypeHelpers.getPointerFallbackEventName_(\n      goog.events.EventType.POINTERENTER, goog.events.EventType.MSPOINTERENTER,\n      goog.events.EventType.MOUSEENTER),\n  POINTERLEAVE: goog.events.EventTypeHelpers.getPointerFallbackEventName_(\n      goog.events.EventType.POINTERLEAVE, goog.events.EventType.MSPOINTERLEAVE,\n      goog.events.EventType.MOUSELEAVE)\n};\n\n\n/**\n * Constants for pointer event names that fall back to corresponding touch event\n * names on unsupported platforms. These are intended to be drop-in replacements\n * for corresponding values in `goog.events.EventType`.\n * @enum {string}\n */\ngoog.events.PointerTouchFallbackEventType = {\n  POINTERDOWN: goog.events.EventTypeHelpers.getPointerFallbackEventName_(\n      goog.events.EventType.POINTERDOWN, goog.events.EventType.MSPOINTERDOWN,\n      goog.events.EventType.TOUCHSTART),\n  POINTERUP: goog.events.EventTypeHelpers.getPointerFallbackEventName_(\n      goog.events.EventType.POINTERUP, goog.events.EventType.MSPOINTERUP,\n      goog.events.EventType.TOUCHEND),\n  POINTERCANCEL: goog.events.EventTypeHelpers.getPointerFallbackEventName_(\n      goog.events.EventType.POINTERCANCEL,\n      goog.events.EventType.MSPOINTERCANCEL, goog.events.EventType.TOUCHCANCEL),\n  POINTERMOVE: goog.events.EventTypeHelpers.getPointerFallbackEventName_(\n      goog.events.EventType.POINTERMOVE, goog.events.EventType.MSPOINTERMOVE,\n      goog.events.EventType.TOUCHMOVE)\n};\n\n\n/**\n * Mapping of mouse event names to underlying browser event names.\n * @typedef {{\n *     MOUSEDOWN: string,\n *     MOUSEUP: string,\n *     MOUSECANCEL:string,\n *     MOUSEMOVE:string,\n *     MOUSEOVER:string,\n *     MOUSEOUT:string,\n *     MOUSEENTER:string,\n *     MOUSELEAVE: string,\n * }}\n */\ngoog.events.MouseEvents;\n\n\n/**\n * An alias for `goog.events.EventType.MOUSE*` event types that is overridden by\n * corresponding `POINTER*` event types.\n * @const {!goog.events.MouseEvents}\n */\ngoog.events.PointerAsMouseEventType = {\n  MOUSEDOWN: goog.events.PointerFallbackEventType.POINTERDOWN,\n  MOUSEUP: goog.events.PointerFallbackEventType.POINTERUP,\n  MOUSECANCEL: goog.events.PointerFallbackEventType.POINTERCANCEL,\n  MOUSEMOVE: goog.events.PointerFallbackEventType.POINTERMOVE,\n  MOUSEOVER: goog.events.PointerFallbackEventType.POINTEROVER,\n  MOUSEOUT: goog.events.PointerFallbackEventType.POINTEROUT,\n  MOUSEENTER: goog.events.PointerFallbackEventType.POINTERENTER,\n  MOUSELEAVE: goog.events.PointerFallbackEventType.POINTERLEAVE\n};\n\n\n/**\n * An alias for `goog.events.EventType.MOUSE*` event types that continue to use\n * mouse events.\n * @const {!goog.events.MouseEvents}\n */\ngoog.events.MouseAsMouseEventType = {\n  MOUSEDOWN: goog.events.EventType.MOUSEDOWN,\n  MOUSEUP: goog.events.EventType.MOUSEUP,\n  MOUSECANCEL: goog.events.EventType.MOUSECANCEL,\n  MOUSEMOVE: goog.events.EventType.MOUSEMOVE,\n  MOUSEOVER: goog.events.EventType.MOUSEOVER,\n  MOUSEOUT: goog.events.EventType.MOUSEOUT,\n  MOUSEENTER: goog.events.EventType.MOUSEENTER,\n  MOUSELEAVE: goog.events.EventType.MOUSELEAVE\n};\n\n\n/**\n * An alias for `goog.events.EventType.TOUCH*` event types that is overridden by\n * corresponding `POINTER*` event types.\n * @enum {string}\n */\ngoog.events.PointerAsTouchEventType = {\n  TOUCHCANCEL: goog.events.PointerTouchFallbackEventType.POINTERCANCEL,\n  TOUCHEND: goog.events.PointerTouchFallbackEventType.POINTERUP,\n  TOUCHMOVE: goog.events.PointerTouchFallbackEventType.POINTERMOVE,\n  TOUCHSTART: goog.events.PointerTouchFallbackEventType.POINTERDOWN\n};\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview An interface for a listenable JavaScript object.\n */\n\ngoog.provide('goog.events.Listenable');\n\ngoog.requireType('goog.events.EventId');\ngoog.requireType('goog.events.EventLike');\ngoog.requireType('goog.events.ListenableKey');\n\n\n/**\n * A listenable interface. A listenable is an object with the ability\n * to dispatch/broadcast events to \"event listeners\" registered via\n * listen/listenOnce.\n *\n * The interface allows for an event propagation mechanism similar\n * to one offered by native browser event targets, such as\n * capture/bubble mechanism, stopping propagation, and preventing\n * default actions. Capture/bubble mechanism depends on the ancestor\n * tree constructed via `#getParentEventTarget`; this tree\n * must be directed acyclic graph. The meaning of default action(s)\n * in preventDefault is specific to a particular use case.\n *\n * Implementations that do not support capture/bubble or can not have\n * a parent listenable can simply not implement any ability to set the\n * parent listenable (and have `#getParentEventTarget` return\n * null).\n *\n * Implementation of this class can be used with or independently from\n * goog.events.\n *\n * Implementation must call `#addImplementation(implClass)`.\n *\n * @interface\n * @see goog.events\n * @see http://www.w3.org/TR/DOM-Level-2-Events/events.html\n */\ngoog.events.Listenable = function() {};\n\n\n/**\n * An expando property to indicate that an object implements\n * goog.events.Listenable.\n *\n * See addImplementation/isImplementedBy.\n *\n * @type {string}\n * @const\n */\ngoog.events.Listenable.IMPLEMENTED_BY_PROP =\n    'closure_listenable_' + ((Math.random() * 1e6) | 0);\n\n\n/**\n * Marks a given class (constructor) as an implementation of\n * Listenable, so that we can query that fact at runtime. The class\n * must have already implemented the interface.\n * @param {function(new:goog.events.Listenable,...)} cls The class constructor.\n *     The corresponding class must have already implemented the interface.\n */\ngoog.events.Listenable.addImplementation = function(cls) {\n  'use strict';\n  cls.prototype[goog.events.Listenable.IMPLEMENTED_BY_PROP] = true;\n};\n\n\n/**\n * @param {?Object} obj The object to check.\n * @return {boolean} Whether a given instance implements Listenable. The\n *     class/superclass of the instance must call addImplementation.\n */\ngoog.events.Listenable.isImplementedBy = function(obj) {\n  'use strict';\n  return !!(obj && obj[goog.events.Listenable.IMPLEMENTED_BY_PROP]);\n};\n\n\n/**\n * Adds an event listener. A listener can only be added once to an\n * object and if it is added again the key for the listener is\n * returned. Note that if the existing listener is a one-off listener\n * (registered via listenOnce), it will no longer be a one-off\n * listener after a call to listen().\n *\n * @param {string|!goog.events.EventId<EVENTOBJ>} type The event type id.\n * @param {function(this:SCOPE, EVENTOBJ):(boolean|undefined)} listener Callback\n *     method.\n * @param {boolean=} opt_useCapture Whether to fire in capture phase\n *     (defaults to false).\n * @param {SCOPE=} opt_listenerScope Object in whose scope to call the\n *     listener.\n * @return {!goog.events.ListenableKey} Unique key for the listener.\n * @template SCOPE,EVENTOBJ\n */\ngoog.events.Listenable.prototype.listen = function(\n    type, listener, opt_useCapture, opt_listenerScope) {};\n\n\n/**\n * Adds an event listener that is removed automatically after the\n * listener fired once.\n *\n * If an existing listener already exists, listenOnce will do\n * nothing. In particular, if the listener was previously registered\n * via listen(), listenOnce() will not turn the listener into a\n * one-off listener. Similarly, if there is already an existing\n * one-off listener, listenOnce does not modify the listeners (it is\n * still a once listener).\n *\n * @param {string|!goog.events.EventId<EVENTOBJ>} type The event type id.\n * @param {function(this:SCOPE, EVENTOBJ):(boolean|undefined)} listener Callback\n *     method.\n * @param {boolean=} opt_useCapture Whether to fire in capture phase\n *     (defaults to false).\n * @param {SCOPE=} opt_listenerScope Object in whose scope to call the\n *     listener.\n * @return {!goog.events.ListenableKey} Unique key for the listener.\n * @template SCOPE,EVENTOBJ\n */\ngoog.events.Listenable.prototype.listenOnce = function(\n    type, listener, opt_useCapture, opt_listenerScope) {};\n\n\n/**\n * Removes an event listener which was added with listen() or listenOnce().\n *\n * @param {string|!goog.events.EventId<EVENTOBJ>} type The event type id.\n * @param {function(this:SCOPE, EVENTOBJ):(boolean|undefined)} listener Callback\n *     method.\n * @param {boolean=} opt_useCapture Whether to fire in capture phase\n *     (defaults to false).\n * @param {SCOPE=} opt_listenerScope Object in whose scope to call\n *     the listener.\n * @return {boolean} Whether any listener was removed.\n * @template SCOPE,EVENTOBJ\n */\ngoog.events.Listenable.prototype.unlisten = function(\n    type, listener, opt_useCapture, opt_listenerScope) {};\n\n\n/**\n * Removes an event listener which was added with listen() by the key\n * returned by listen().\n *\n * @param {!goog.events.ListenableKey} key The key returned by\n *     listen() or listenOnce().\n * @return {boolean} Whether any listener was removed.\n */\ngoog.events.Listenable.prototype.unlistenByKey = function(key) {};\n\n\n/**\n * Dispatches an event (or event like object) and calls all listeners\n * listening for events of this type. The type of the event is decided by the\n * type property on the event object.\n *\n * If any of the listeners returns false OR calls preventDefault then this\n * function will return false.  If one of the capture listeners calls\n * stopPropagation, then the bubble listeners won't fire.\n *\n * @param {?goog.events.EventLike} e Event object.\n * @return {boolean} If anyone called preventDefault on the event object (or\n *     if any of the listeners returns false) this will also return false.\n */\ngoog.events.Listenable.prototype.dispatchEvent = function(e) {};\n\n\n/**\n * Removes all listeners from this listenable. If type is specified,\n * it will only remove listeners of the particular type. otherwise all\n * registered listeners will be removed.\n *\n * @param {string|!goog.events.EventId=} opt_type Type of event to remove,\n *     default is to remove all types.\n * @return {number} Number of listeners removed.\n */\ngoog.events.Listenable.prototype.removeAllListeners = function(opt_type) {};\n\n\n/**\n * Returns the parent of this event target to use for capture/bubble\n * mechanism.\n *\n * NOTE(chrishenry): The name reflects the original implementation of\n * custom event target (`goog.events.EventTarget`). We decided\n * that changing the name is not worth it.\n *\n * @return {?goog.events.Listenable} The parent EventTarget or null if\n *     there is no parent.\n */\ngoog.events.Listenable.prototype.getParentEventTarget = function() {};\n\n\n/**\n * Fires all registered listeners in this listenable for the given\n * type and capture mode, passing them the given eventObject. This\n * does not perform actual capture/bubble. Only implementors of the\n * interface should be using this.\n *\n * @param {string|!goog.events.EventId<EVENTOBJ>} type The type of the\n *     listeners to fire.\n * @param {boolean} capture The capture mode of the listeners to fire.\n * @param {EVENTOBJ} eventObject The event object to fire.\n * @return {boolean} Whether all listeners succeeded without\n *     attempting to prevent default behavior. If any listener returns\n *     false or called goog.events.Event#preventDefault, this returns\n *     false.\n * @template EVENTOBJ\n */\ngoog.events.Listenable.prototype.fireListeners = function(\n    type, capture, eventObject) {};\n\n\n/**\n * Gets all listeners in this listenable for the given type and\n * capture mode.\n *\n * @param {string|!goog.events.EventId} type The type of the listeners to fire.\n * @param {boolean} capture The capture mode of the listeners to fire.\n * @return {!Array<!goog.events.ListenableKey>} An array of registered\n *     listeners.\n * @template EVENTOBJ\n */\ngoog.events.Listenable.prototype.getListeners = function(type, capture) {};\n\n\n/**\n * Gets the goog.events.ListenableKey for the event or null if no such\n * listener is in use.\n *\n * @param {string|!goog.events.EventId<EVENTOBJ>} type The name of the event\n *     without the 'on' prefix.\n * @param {function(this:SCOPE, EVENTOBJ):(boolean|undefined)} listener The\n *     listener function to get.\n * @param {boolean} capture Whether the listener is a capturing listener.\n * @param {SCOPE=} opt_listenerScope Object in whose scope to call the\n *     listener.\n * @return {?goog.events.ListenableKey} the found listener or null if not found.\n * @template SCOPE,EVENTOBJ\n */\ngoog.events.Listenable.prototype.getListener = function(\n    type, listener, capture, opt_listenerScope) {};\n\n\n/**\n * Whether there is any active listeners matching the specified\n * signature. If either the type or capture parameters are\n * unspecified, the function will match on the remaining criteria.\n *\n * @param {string|!goog.events.EventId<EVENTOBJ>=} opt_type Event type.\n * @param {boolean=} opt_capture Whether to check for capture or bubble\n *     listeners.\n * @return {boolean} Whether there is any active listeners matching\n *     the requested type and/or capture phase.\n * @template EVENTOBJ\n */\ngoog.events.Listenable.prototype.hasListener = function(\n    opt_type, opt_capture) {};\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview An interface that describes a single registered listener.\n */\ngoog.provide('goog.events.ListenableKey');\n\ngoog.requireType('goog.events.Listenable');\n\n\n/**\n * An interface that describes a single registered listener.\n * @interface\n */\ngoog.events.ListenableKey = function() {};\n\n\n/**\n * Counter used to create a unique key\n * @type {number}\n * @private\n */\ngoog.events.ListenableKey.counter_ = 0;\n\n\n/**\n * Reserves a key to be used for ListenableKey#key field.\n * @return {number} A number to be used to fill ListenableKey#key\n *     field.\n */\ngoog.events.ListenableKey.reserveKey = function() {\n  'use strict';\n  return ++goog.events.ListenableKey.counter_;\n};\n\n\n/**\n * The source event target.\n * @type {?Object|?goog.events.Listenable}\n */\ngoog.events.ListenableKey.prototype.src;\n\n\n/**\n * The event type the listener is listening to.\n * @type {string}\n */\ngoog.events.ListenableKey.prototype.type;\n\n\n/**\n * The listener function.\n * @type {function(?):?|{handleEvent:function(?):?}|null}\n */\ngoog.events.ListenableKey.prototype.listener;\n\n\n/**\n * Whether the listener works on capture phase.\n * @type {boolean}\n */\ngoog.events.ListenableKey.prototype.capture;\n\n\n/**\n * The 'this' object for the listener function's scope.\n * @type {?Object|undefined}\n */\ngoog.events.ListenableKey.prototype.handler;\n\n\n/**\n * A globally unique number to identify the key.\n * @type {number}\n */\ngoog.events.ListenableKey.prototype.key;\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Listener object.\n * @see ../demos/events.html\n */\n\ngoog.provide('goog.events.Listener');\n\ngoog.require('goog.events.ListenableKey');\ngoog.requireType('goog.events.Listenable');\n\n\n\n/**\n * Simple class that stores information about a listener\n * @param {function(?):?} listener Callback function.\n * @param {Function} proxy Wrapper for the listener that patches the event.\n * @param {EventTarget|goog.events.Listenable} src Source object for\n *     the event.\n * @param {string} type Event type.\n * @param {boolean} capture Whether in capture or bubble phase.\n * @param {Object=} opt_handler Object in whose context to execute the callback.\n * @implements {goog.events.ListenableKey}\n * @constructor\n */\ngoog.events.Listener = function(\n    listener, proxy, src, type, capture, opt_handler) {\n  'use strict';\n  if (goog.events.Listener.ENABLE_MONITORING) {\n    this.creationStack = new Error().stack;\n  }\n\n  /** @override */\n  this.listener = listener;\n\n  /**\n   * A wrapper over the original listener. This is used solely to\n   * handle native browser events (it is used to simulate the capture\n   * phase and to patch the event object).\n   * @type {Function}\n   */\n  this.proxy = proxy;\n\n  /**\n   * Object or node that callback is listening to\n   * @type {EventTarget|goog.events.Listenable}\n   */\n  this.src = src;\n\n  /**\n   * The event type.\n   * @const {string}\n   */\n  this.type = type;\n\n  /**\n   * Whether the listener is being called in the capture or bubble phase\n   * @const {boolean}\n   */\n  this.capture = !!capture;\n\n  /**\n   * Optional object whose context to execute the listener in\n   * @type {Object|undefined}\n   */\n  this.handler = opt_handler;\n\n  /**\n   * The key of the listener.\n   * @const {number}\n   * @override\n   */\n  this.key = goog.events.ListenableKey.reserveKey();\n\n  /**\n   * Whether to remove the listener after it has been called.\n   * @type {boolean}\n   */\n  this.callOnce = false;\n\n  /**\n   * Whether the listener has been removed.\n   * @type {boolean}\n   */\n  this.removed = false;\n};\n\n\n/**\n * @define {boolean} Whether to enable the monitoring of the\n *     goog.events.Listener instances. Switching on the monitoring is only\n *     recommended for debugging because it has a significant impact on\n *     performance and memory usage. If switched off, the monitoring code\n *     compiles down to 0 bytes.\n */\ngoog.events.Listener.ENABLE_MONITORING =\n    goog.define('goog.events.Listener.ENABLE_MONITORING', false);\n\n\n/**\n * If monitoring the goog.events.Listener instances is enabled, stores the\n * creation stack trace of the Disposable instance.\n * @type {string}\n */\ngoog.events.Listener.prototype.creationStack;\n\n\n/**\n * Marks this listener as removed. This also remove references held by\n * this listener object (such as listener and event source).\n */\ngoog.events.Listener.prototype.markAsRemoved = function() {\n  'use strict';\n  this.removed = true;\n  this.listener = null;\n  this.proxy = null;\n  this.src = null;\n  this.handler = null;\n};\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview A map of listeners that provides utility functions to\n * deal with listeners on an event target. Used by\n * `goog.events.EventTarget`.\n *\n * WARNING: Do not use this class from outside goog.events package.\n *\n */\n\ngoog.provide('goog.events.ListenerMap');\n\ngoog.require('goog.array');\ngoog.require('goog.events.Listener');\ngoog.require('goog.object');\ngoog.requireType('goog.events.EventId');\ngoog.requireType('goog.events.Listenable');\ngoog.requireType('goog.events.ListenableKey');\n\n\n\n/**\n * Creates a new listener map.\n * @param {EventTarget|goog.events.Listenable} src The src object.\n * @constructor\n * @final\n */\ngoog.events.ListenerMap = function(src) {\n  'use strict';\n  /** @type {EventTarget|goog.events.Listenable} */\n  this.src = src;\n\n  /**\n   * Maps of event type to an array of listeners.\n   * @type {!Object<string, !Array<!goog.events.Listener>>}\n   */\n  this.listeners = {};\n\n  /**\n   * The count of types in this map that have registered listeners.\n   * @private {number}\n   */\n  this.typeCount_ = 0;\n};\n\n\n/**\n * @return {number} The count of event types in this map that actually\n *     have registered listeners.\n */\ngoog.events.ListenerMap.prototype.getTypeCount = function() {\n  'use strict';\n  return this.typeCount_;\n};\n\n\n/**\n * @return {number} Total number of registered listeners.\n */\ngoog.events.ListenerMap.prototype.getListenerCount = function() {\n  'use strict';\n  var count = 0;\n  for (var type in this.listeners) {\n    count += this.listeners[type].length;\n  }\n  return count;\n};\n\n\n/**\n * Adds an event listener. A listener can only be added once to an\n * object and if it is added again the key for the listener is\n * returned.\n *\n * Note that a one-off listener will not change an existing listener,\n * if any. On the other hand a normal listener will change existing\n * one-off listener to become a normal listener.\n *\n * @param {string|!goog.events.EventId} type The listener event type.\n * @param {!Function} listener This listener callback method.\n * @param {boolean} callOnce Whether the listener is a one-off\n *     listener.\n * @param {boolean=} opt_useCapture The capture mode of the listener.\n * @param {Object=} opt_listenerScope Object in whose scope to call the\n *     listener.\n * @return {!goog.events.ListenableKey} Unique key for the listener.\n */\ngoog.events.ListenerMap.prototype.add = function(\n    type, listener, callOnce, opt_useCapture, opt_listenerScope) {\n  'use strict';\n  var typeStr = type.toString();\n  var listenerArray = this.listeners[typeStr];\n  if (!listenerArray) {\n    listenerArray = this.listeners[typeStr] = [];\n    this.typeCount_++;\n  }\n\n  var listenerObj;\n  var index = goog.events.ListenerMap.findListenerIndex_(\n      listenerArray, listener, opt_useCapture, opt_listenerScope);\n  if (index > -1) {\n    listenerObj = listenerArray[index];\n    if (!callOnce) {\n      // Ensure that, if there is an existing callOnce listener, it is no\n      // longer a callOnce listener.\n      listenerObj.callOnce = false;\n    }\n  } else {\n    listenerObj = new goog.events.Listener(\n        listener, null, this.src, typeStr, !!opt_useCapture, opt_listenerScope);\n    listenerObj.callOnce = callOnce;\n    listenerArray.push(listenerObj);\n  }\n  return listenerObj;\n};\n\n\n/**\n * Removes a matching listener.\n * @param {string|!goog.events.EventId} type The listener event type.\n * @param {!Function} listener This listener callback method.\n * @param {boolean=} opt_useCapture The capture mode of the listener.\n * @param {Object=} opt_listenerScope Object in whose scope to call the\n *     listener.\n * @return {boolean} Whether any listener was removed.\n */\ngoog.events.ListenerMap.prototype.remove = function(\n    type, listener, opt_useCapture, opt_listenerScope) {\n  'use strict';\n  var typeStr = type.toString();\n  if (!(typeStr in this.listeners)) {\n    return false;\n  }\n\n  var listenerArray = this.listeners[typeStr];\n  var index = goog.events.ListenerMap.findListenerIndex_(\n      listenerArray, listener, opt_useCapture, opt_listenerScope);\n  if (index > -1) {\n    var listenerObj = listenerArray[index];\n    listenerObj.markAsRemoved();\n    goog.array.removeAt(listenerArray, index);\n    if (listenerArray.length == 0) {\n      delete this.listeners[typeStr];\n      this.typeCount_--;\n    }\n    return true;\n  }\n  return false;\n};\n\n\n/**\n * Removes the given listener object.\n * @param {!goog.events.ListenableKey} listener The listener to remove.\n * @return {boolean} Whether the listener is removed.\n */\ngoog.events.ListenerMap.prototype.removeByKey = function(listener) {\n  'use strict';\n  var type = listener.type;\n  if (!(type in this.listeners)) {\n    return false;\n  }\n\n  var removed = goog.array.remove(this.listeners[type], listener);\n  if (removed) {\n    /** @type {!goog.events.Listener} */ (listener).markAsRemoved();\n    if (this.listeners[type].length == 0) {\n      delete this.listeners[type];\n      this.typeCount_--;\n    }\n  }\n  return removed;\n};\n\n\n/**\n * Removes all listeners from this map. If opt_type is provided, only\n * listeners that match the given type are removed.\n * @param {string|!goog.events.EventId=} opt_type Type of event to remove.\n * @return {number} Number of listeners removed.\n */\ngoog.events.ListenerMap.prototype.removeAll = function(opt_type) {\n  'use strict';\n  var typeStr = opt_type && opt_type.toString();\n  var count = 0;\n  for (var type in this.listeners) {\n    if (!typeStr || type == typeStr) {\n      var listenerArray = this.listeners[type];\n      for (var i = 0; i < listenerArray.length; i++) {\n        ++count;\n        listenerArray[i].markAsRemoved();\n      }\n      delete this.listeners[type];\n      this.typeCount_--;\n    }\n  }\n  return count;\n};\n\n\n/**\n * Gets all listeners that match the given type and capture mode. The\n * returned array is a copy (but the listener objects are not).\n * @param {string|!goog.events.EventId} type The type of the listeners\n *     to retrieve.\n * @param {boolean} capture The capture mode of the listeners to retrieve.\n * @return {!Array<!goog.events.ListenableKey>} An array of matching\n *     listeners.\n */\ngoog.events.ListenerMap.prototype.getListeners = function(type, capture) {\n  'use strict';\n  var listenerArray = this.listeners[type.toString()];\n  var rv = [];\n  if (listenerArray) {\n    for (var i = 0; i < listenerArray.length; ++i) {\n      var listenerObj = listenerArray[i];\n      if (listenerObj.capture == capture) {\n        rv.push(listenerObj);\n      }\n    }\n  }\n  return rv;\n};\n\n\n/**\n * Gets the goog.events.ListenableKey for the event or null if no such\n * listener is in use.\n *\n * @param {string|!goog.events.EventId} type The type of the listener\n *     to retrieve.\n * @param {!Function} listener The listener function to get.\n * @param {boolean} capture Whether the listener is a capturing listener.\n * @param {Object=} opt_listenerScope Object in whose scope to call the\n *     listener.\n * @return {goog.events.ListenableKey} the found listener or null if not found.\n */\ngoog.events.ListenerMap.prototype.getListener = function(\n    type, listener, capture, opt_listenerScope) {\n  'use strict';\n  var listenerArray = this.listeners[type.toString()];\n  var i = -1;\n  if (listenerArray) {\n    i = goog.events.ListenerMap.findListenerIndex_(\n        listenerArray, listener, capture, opt_listenerScope);\n  }\n  return i > -1 ? listenerArray[i] : null;\n};\n\n\n/**\n * Whether there is a matching listener. If either the type or capture\n * parameters are unspecified, the function will match on the\n * remaining criteria.\n *\n * @param {string|!goog.events.EventId=} opt_type The type of the listener.\n * @param {boolean=} opt_capture The capture mode of the listener.\n * @return {boolean} Whether there is an active listener matching\n *     the requested type and/or capture phase.\n */\ngoog.events.ListenerMap.prototype.hasListener = function(\n    opt_type, opt_capture) {\n  'use strict';\n  var hasType = (opt_type !== undefined);\n  var typeStr = hasType ? opt_type.toString() : '';\n  var hasCapture = (opt_capture !== undefined);\n\n  return goog.object.some(this.listeners, function(listenerArray, type) {\n    'use strict';\n    for (var i = 0; i < listenerArray.length; ++i) {\n      if ((!hasType || listenerArray[i].type == typeStr) &&\n          (!hasCapture || listenerArray[i].capture == opt_capture)) {\n        return true;\n      }\n    }\n\n    return false;\n  });\n};\n\n\n/**\n * Finds the index of a matching goog.events.Listener in the given\n * listenerArray.\n * @param {!Array<!goog.events.Listener>} listenerArray Array of listener.\n * @param {!Function} listener The listener function.\n * @param {boolean=} opt_useCapture The capture flag for the listener.\n * @param {Object=} opt_listenerScope The listener scope.\n * @return {number} The index of the matching listener within the\n *     listenerArray.\n * @private\n */\ngoog.events.ListenerMap.findListenerIndex_ = function(\n    listenerArray, listener, opt_useCapture, opt_listenerScope) {\n  'use strict';\n  for (var i = 0; i < listenerArray.length; ++i) {\n    var listenerObj = listenerArray[i];\n    if (!listenerObj.removed && listenerObj.listener == listener &&\n        listenerObj.capture == !!opt_useCapture &&\n        listenerObj.handler == opt_listenerScope) {\n      return i;\n    }\n  }\n  return -1;\n};\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Utilities for manipulating objects/maps/hashes.\n */\ngoog.module('goog.object');\ngoog.module.declareLegacyNamespace();\n\n/**\n * Calls a function for each element in an object/map/hash.\n * @param {?Object<K,V>} obj The object over which to iterate.\n * @param {function(this:T,V,?,?Object<K,V>):?} f The function to call for every\n *     element. This function takes 3 arguments (the value, the key and the\n *     object) and the return value is ignored.\n * @param {T=} opt_obj This is used as the 'this' object within f.\n * @return {void}\n * @template T,K,V\n */\nfunction forEach(obj, f, opt_obj) {\n  for (const key in obj) {\n    f.call(/** @type {?} */ (opt_obj), obj[key], key, obj);\n  }\n}\n\n/**\n * Calls a function for each element in an object/map/hash. If that call returns\n * true, adds the element to a new object.\n * @param {?Object<K,V>} obj The object over which to iterate.\n * @param {function(this:T,V,?,?Object<K,V>):boolean} f The function to call for\n *     every element. This function takes 3 arguments (the value, the key and\n *     the object) and should return a boolean. If the return value is true the\n *     element is added to the result object. If it is false the element is not\n *     included.\n * @param {T=} opt_obj This is used as the 'this' object within f.\n * @return {!Object<K,V>} a new object in which only elements that passed the\n *     test are present.\n * @template T,K,V\n */\nfunction filter(obj, f, opt_obj) {\n  const res = {};\n  for (const key in obj) {\n    if (f.call(/** @type {?} */ (opt_obj), obj[key], key, obj)) {\n      res[key] = obj[key];\n    }\n  }\n  return res;\n}\n\n/**\n * For every element in an object/map/hash calls a function and inserts the\n * result into a new object.\n * @param {?Object<K,V>} obj The object over which to iterate.\n * @param {function(this:T,V,?,?Object<K,V>):R} f The function to call for every\n *     element. This function takes 3 arguments (the value, the key and the\n *     object) and should return something. The result will be inserted into a\n *     new object.\n * @param {T=} opt_obj This is used as the 'this' object within f.\n * @return {!Object<K,R>} a new object with the results from f.\n * @template T,K,V,R\n */\nfunction map(obj, f, opt_obj) {\n  const res = {};\n  for (const key in obj) {\n    res[key] = f.call(/** @type {?} */ (opt_obj), obj[key], key, obj);\n  }\n  return res;\n}\n\n/**\n * Calls a function for each element in an object/map/hash. If any\n * call returns true, returns true (without checking the rest). If\n * all calls return false, returns false.\n * @param {?Object<K,V>} obj The object to check.\n * @param {function(this:T,V,?,?Object<K,V>):boolean} f The function to call for\n *     every element. This function takes 3 arguments (the value, the key and\n *     the object) and should return a boolean.\n * @param {T=} opt_obj This is used as the 'this' object within f.\n * @return {boolean} true if any element passes the test.\n * @template T,K,V\n */\nfunction some(obj, f, opt_obj) {\n  for (const key in obj) {\n    if (f.call(/** @type {?} */ (opt_obj), obj[key], key, obj)) {\n      return true;\n    }\n  }\n  return false;\n}\n\n/**\n * Calls a function for each element in an object/map/hash. If\n * all calls return true, returns true. If any call returns false, returns\n * false at this point and does not continue to check the remaining elements.\n * @param {?Object<K,V>} obj The object to check.\n * @param {?function(this:T,V,?,?Object<K,V>):boolean} f The function to call\n *     for every element. This function takes 3 arguments (the value, the key\n *     and the object) and should return a boolean.\n * @param {T=} opt_obj This is used as the 'this' object within f.\n * @return {boolean} false if any element fails the test.\n * @template T,K,V\n */\nfunction every(obj, f, opt_obj) {\n  for (const key in obj) {\n    if (!f.call(/** @type {?} */ (opt_obj), obj[key], key, obj)) {\n      return false;\n    }\n  }\n  return true;\n}\n\n/**\n * Returns the number of key-value pairs in the object map.\n * @param {?Object} obj The object for which to get the number of key-value\n *     pairs.\n * @return {number} The number of key-value pairs in the object map.\n */\nfunction getCount(obj) {\n  let rv = 0;\n  for (const key in obj) {\n    rv++;\n  }\n  return rv;\n}\n\n/**\n * Returns one key from the object map, if any exists.\n * For map literals the returned key will be the first one in most of the\n * browsers (a know exception is Konqueror).\n * @param {?Object} obj The object to pick a key from.\n * @return {string|undefined} The key or undefined if the object is empty.\n */\nfunction getAnyKey(obj) {\n  for (const key in obj) {\n    return key;\n  }\n}\n\n/**\n * Returns one value from the object map, if any exists.\n * For map literals the returned value will be the first one in most of the\n * browsers (a know exception is Konqueror).\n * @param {?Object<K,V>} obj The object to pick a value from.\n * @return {V|undefined} The value or undefined if the object is empty.\n * @template K,V\n */\nfunction getAnyValue(obj) {\n  for (const key in obj) {\n    return obj[key];\n  }\n}\n\n/**\n * Whether the object/hash/map contains the given object as a value.\n * An alias for containsValue(obj, val).\n * @param {?Object<K,V>} obj The object in which to look for val.\n * @param {V} val The object for which to check.\n * @return {boolean} true if val is present.\n * @template K,V\n */\nfunction contains(obj, val) {\n  return containsValue(obj, val);\n}\n\n/**\n * Returns the values of the object/map/hash.\n * @param {?Object<K,V>} obj The object from which to get the values.\n * @return {!Array<V>} The values in the object/map/hash.\n * @template K,V\n */\nfunction getValues(obj) {\n  const res = [];\n  let i = 0;\n  for (const key in obj) {\n    res[i++] = obj[key];\n  }\n  return res;\n}\n\n/**\n * Returns the keys of the object/map/hash.\n * @param {?Object} obj The object from which to get the keys.\n * @return {!Array<string>} Array of property keys.\n */\nfunction getKeys(obj) {\n  const res = [];\n  let i = 0;\n  for (const key in obj) {\n    res[i++] = key;\n  }\n  return res;\n}\n\n/**\n * Get a value from an object multiple levels deep.  This is useful for\n * pulling values from deeply nested objects, such as JSON responses.\n * Example usage: getValueByKeys(jsonObj, 'foo', 'entries', 3)\n * @param {?Object} obj An object to get the value from. Can be array-like.\n * @param {...(string|number|!IArrayLike<number|string>)} var_args A number of\n *     keys (as strings, or numbers, for array-like objects). Can also be\n *     specified as a single array of keys.\n * @return {*} The resulting value. If, at any point, the value for a key in the\n *     current object is null or undefined, returns undefined.\n */\nfunction getValueByKeys(obj, var_args) {\n  const isArrayLike = goog.isArrayLike(var_args);\n  const keys = isArrayLike ?\n      /** @type {!IArrayLike<number|string>} */ (var_args) :\n      arguments;\n\n  // Start with the 2nd parameter for the variable parameters syntax.\n  for (let i = isArrayLike ? 0 : 1; i < keys.length; i++) {\n    if (obj == null) return undefined;\n    obj = obj[keys[i]];\n  }\n\n  return obj;\n}\n\n/**\n * Whether the object/map/hash contains the given key.\n * @param {?Object} obj The object in which to look for key.\n * @param {?} key The key for which to check.\n * @return {boolean} true If the map contains the key.\n */\nfunction containsKey(obj, key) {\n  return obj !== null && key in obj;\n}\n\n/**\n * Whether the object/map/hash contains the given value. This is O(n).\n * @param {?Object<K,V>} obj The object in which to look for val.\n * @param {V} val The value for which to check.\n * @return {boolean} true If the map contains the value.\n * @template K,V\n */\nfunction containsValue(obj, val) {\n  for (const key in obj) {\n    if (obj[key] == val) {\n      return true;\n    }\n  }\n  return false;\n}\n\n/**\n * Searches an object for an element that satisfies the given condition and\n * returns its key.\n * @param {?Object<K,V>} obj The object to search in.\n * @param {function(this:T,V,string,?Object<K,V>):boolean} f The function to\n *     call for every element. Takes 3 arguments (the value, the key and the\n *     object) and should return a boolean.\n * @param {T=} thisObj An optional \"this\" context for the function.\n * @return {string|undefined} The key of an element for which the function\n *     returns true or undefined if no such element is found.\n * @template T,K,V\n */\nfunction findKey(obj, f, thisObj = undefined) {\n  for (const key in obj) {\n    if (f.call(/** @type {?} */ (thisObj), obj[key], key, obj)) {\n      return key;\n    }\n  }\n  return undefined;\n}\n\n/**\n * Searches an object for an element that satisfies the given condition and\n * returns its value.\n * @param {?Object<K,V>} obj The object to search in.\n * @param {function(this:T,V,string,?Object<K,V>):boolean} f The function to\n *     call for every element. Takes 3 arguments (the value, the key and the\n *     object) and should return a boolean.\n * @param {T=} thisObj An optional \"this\" context for the function.\n * @return {V} The value of an element for which the function returns true or\n *     undefined if no such element is found.\n * @template T,K,V\n */\nfunction findValue(obj, f, thisObj = undefined) {\n  const key = findKey(obj, f, thisObj);\n  return key && obj[key];\n}\n\n/**\n * Whether the object/map/hash is empty.\n * @param {?Object} obj The object to test.\n * @return {boolean} true if obj is empty.\n */\nfunction isEmpty(obj) {\n  for (const key in obj) {\n    return false;\n  }\n  return true;\n}\n\n/**\n * Removes all key value pairs from the object/map/hash.\n * @param {?Object} obj The object to clear.\n * @return {void}\n */\nfunction clear(obj) {\n  for (const i in obj) {\n    delete obj[i];\n  }\n}\n\n/**\n * Removes a key-value pair based on the key.\n * @param {?Object} obj The object from which to remove the key.\n * @param {?} key The key to remove.\n * @return {boolean} Whether an element was removed.\n */\nfunction remove(obj, key) {\n  let rv;\n  if (rv = key in /** @type {!Object} */ (obj)) {\n    delete obj[key];\n  }\n  return rv;\n}\n\n/**\n * Adds a key-value pair to the object. Throws an exception if the key is\n * already in use. Use set if you want to change an existing pair.\n * @param {?Object<K,V>} obj The object to which to add the key-value pair.\n * @param {string} key The key to add.\n * @param {V} val The value to add.\n * @return {void}\n * @template K,V\n */\nfunction add(obj, key, val) {\n  if (obj !== null && key in obj) {\n    throw new Error(`The object already contains the key \"${key}\"`);\n  }\n  set(obj, key, val);\n}\n\n/**\n * Returns the value for the given key.\n * @param {?Object<K,V>} obj The object from which to get the value.\n * @param {string} key The key for which to get the value.\n * @param {R=} val The value to return if no item is found for the given key\n *     (default is undefined).\n * @return {V|R|undefined} The value for the given key.\n * @template K,V,R\n */\nfunction get(obj, key, val = undefined) {\n  if (obj !== null && key in obj) {\n    return obj[key];\n  }\n  return val;\n}\n\n/**\n * Adds a key-value pair to the object/map/hash.\n * @param {?Object<K,V>} obj The object to which to add the key-value pair.\n * @param {string} key The key to add.\n * @param {V} value The value to add.\n * @template K,V\n * @return {void}\n */\nfunction set(obj, key, value) {\n  obj[key] = value;\n}\n\n/**\n * Adds a key-value pair to the object/map/hash if it doesn't exist yet.\n * @param {?Object<K,V>} obj The object to which to add the key-value pair.\n * @param {string} key The key to add.\n * @param {V} value The value to add if the key wasn't present.\n * @return {V} The value of the entry at the end of the function.\n * @template K,V\n */\nfunction setIfUndefined(obj, key, value) {\n  return key in /** @type {!Object} */ (obj) ? obj[key] : (obj[key] = value);\n}\n\n/**\n * Sets a key and value to an object if the key is not set. The value will be\n * the return value of the given function. If the key already exists, the\n * object will not be changed and the function will not be called (the function\n * will be lazily evaluated -- only called if necessary).\n * This function is particularly useful when used with an `Object` which is\n * acting as a cache.\n * @param {?Object<K,V>} obj The object to which to add the key-value pair.\n * @param {string} key The key to add.\n * @param {function():V} f The value to add if the key wasn't present.\n * @return {V} The value of the entry at the end of the function.\n * @template K,V\n */\nfunction setWithReturnValueIfNotSet(obj, key, f) {\n  if (key in obj) {\n    return obj[key];\n  }\n\n  const val = f();\n  obj[key] = val;\n  return val;\n}\n\n/**\n * Compares two objects for equality using === on the values.\n * @param {!Object<K,V>} a\n * @param {!Object<K,V>} b\n * @return {boolean}\n * @template K,V\n */\nfunction equals(a, b) {\n  for (const k in a) {\n    if (!(k in b) || a[k] !== b[k]) {\n      return false;\n    }\n  }\n  for (const k in b) {\n    if (!(k in a)) {\n      return false;\n    }\n  }\n  return true;\n}\n\n/**\n * Returns a shallow clone of the object.\n * @param {?Object<K,V>} obj Object to clone.\n * @return {!Object<K,V>} Clone of the input object.\n * @template K,V\n */\nfunction clone(obj) {\n  const res = {};\n  for (const key in obj) {\n    res[key] = obj[key];\n  }\n  return res;\n}\n\n/**\n * Clones a value. The input may be an Object, Array, or basic type. Objects and\n * arrays will be cloned recursively.\n * WARNINGS:\n * <code>unsafeClone</code> does not detect reference loops. Objects\n * that refer to themselves will cause infinite recursion.\n * <code>unsafeClone</code> is unaware of unique identifiers, and\n * copies UIDs created by <code>getUid</code> into cloned results.\n * @param {T} obj The value to clone.\n * @return {T} A clone of the input value.\n * @template T\n */\nfunction unsafeClone(obj) {\n  if (!obj || typeof obj !== 'object') return obj;\n  if (typeof obj.clone === 'function') return obj.clone();\n  if (typeof Map !== 'undefined' && obj instanceof Map) {\n    return new Map(obj);\n  } else if (typeof Set !== 'undefined' && obj instanceof Set) {\n    return new Set(obj);\n  }\n  const clone = Array.isArray(obj) ? [] :\n      typeof ArrayBuffer === 'function' &&\n          typeof ArrayBuffer.isView === 'function' && ArrayBuffer.isView(obj) &&\n          !(obj instanceof DataView) ?\n                                     new obj.constructor(obj.length) :\n                                     {};\n  for (const key in obj) {\n    clone[key] = unsafeClone(obj[key]);\n  }\n  return clone;\n}\n\n/**\n * Returns a new object in which all the keys and values are interchanged\n * (keys become values and values become keys). If multiple keys map to the\n * same value, the chosen transposed value is implementation-dependent.\n * @param {?Object} obj The object to transpose.\n * @return {!Object} The transposed object.\n */\nfunction transpose(obj) {\n  const transposed = {};\n  for (const key in obj) {\n    transposed[obj[key]] = key;\n  }\n  return transposed;\n}\n\n/**\n * The names of the fields that are defined on Object.prototype.\n * @type {!Array<string>}\n */\nconst PROTOTYPE_FIELDS = [\n  'constructor',\n  'hasOwnProperty',\n  'isPrototypeOf',\n  'propertyIsEnumerable',\n  'toLocaleString',\n  'toString',\n  'valueOf',\n];\n\n/**\n * Extends an object with another object.\n * This operates 'in-place'; it does not create a new Object.\n * Example:\n * var o = {};\n * extend(o, {a: 0, b: 1});\n * o; // {a: 0, b: 1}\n * extend(o, {b: 2, c: 3});\n * o; // {a: 0, b: 2, c: 3}\n * @param {?Object} target The object to modify. Existing properties will be\n *     overwritten if they are also present in one of the objects in `var_args`.\n * @param {...(?Object|undefined)} var_args The objects from which values\n *     will be copied.\n * @return {void}\n * @deprecated Prefer Object.assign\n */\nfunction extend(target, var_args) {\n  let key;\n  let source;\n  for (let i = 1; i < arguments.length; i++) {\n    source = arguments[i];\n    for (key in source) {\n      target[key] = source[key];\n    }\n\n    // For IE the for-in-loop does not contain any properties that are not\n    // enumerable on the prototype object (for example isPrototypeOf from\n    // Object.prototype) and it will also not include 'replace' on objects that\n    // extend String and change 'replace' (not that it is common for anyone to\n    // extend anything except Object).\n\n    for (let j = 0; j < PROTOTYPE_FIELDS.length; j++) {\n      key = PROTOTYPE_FIELDS[j];\n      if (Object.prototype.hasOwnProperty.call(source, key)) {\n        target[key] = source[key];\n      }\n    }\n  }\n}\n\n/**\n * Creates a new object built from the key-value pairs provided as arguments.\n * @param {...*} var_args If only one argument is provided and it is an array\n *     then this is used as the arguments, otherwise even arguments are used as\n *     the property names and odd arguments are used as the property values.\n * @return {!Object} The new object.\n * @throws {!Error} If there are uneven number of arguments or there is only one\n *     non array argument.\n */\nfunction create(var_args) {\n  const argLength = arguments.length;\n  if (argLength == 1 && Array.isArray(arguments[0])) {\n    return create.apply(null, arguments[0]);\n  }\n\n  if (argLength % 2) {\n    throw new Error('Uneven number of arguments');\n  }\n\n  const rv = {};\n  for (let i = 0; i < argLength; i += 2) {\n    rv[arguments[i]] = arguments[i + 1];\n  }\n  return rv;\n}\n\n/**\n * Creates a new object where the property names come from the arguments but\n * the value is always set to true\n * @param {...*} var_args If only one argument is provided and it is an array\n *     then this is used as the arguments, otherwise the arguments are used as\n *     the property names.\n * @return {!Object} The new object.\n */\nfunction createSet(var_args) {\n  const argLength = arguments.length;\n  if (argLength == 1 && Array.isArray(arguments[0])) {\n    return createSet.apply(null, arguments[0]);\n  }\n\n  const rv = {};\n  for (let i = 0; i < argLength; i++) {\n    rv[arguments[i]] = true;\n  }\n  return rv;\n}\n\n/**\n * Creates an immutable view of the underlying object, if the browser\n * supports immutable objects.\n * In default mode, writes to this view will fail silently. In strict mode,\n * they will throw an error.\n * @param {!Object<K,V>} obj An object.\n * @return {!Object<K,V>} An immutable view of that object, or the original\n *     object if this browser does not support immutables.\n * @template K,V\n */\nfunction createImmutableView(obj) {\n  let result = obj;\n  if (Object.isFrozen && !Object.isFrozen(obj)) {\n    result = Object.create(obj);\n    Object.freeze(result);\n  }\n  return result;\n}\n\n/**\n * @param {!Object} obj An object.\n * @return {boolean} Whether this is an immutable view of the object.\n */\nfunction isImmutableView(obj) {\n  return !!Object.isFrozen && Object.isFrozen(obj);\n}\n\n/**\n * Get all properties names on a given Object regardless of enumerability.\n * <p> If the browser does not support `Object.getOwnPropertyNames` nor\n * `Object.getPrototypeOf` then this is equivalent to using\n * `getKeys`\n * @param {?Object} obj The object to get the properties of.\n * @param {boolean=} includeObjectPrototype Whether properties defined on\n *     `Object.prototype` should be included in the result.\n * @param {boolean=} includeFunctionPrototype Whether properties defined on\n *     `Function.prototype` should be included in the result.\n * @return {!Array<string>}\n * @public\n */\nfunction getAllPropertyNames(\n    obj, includeObjectPrototype = undefined,\n    includeFunctionPrototype = undefined) {\n  if (!obj) {\n    return [];\n  }\n\n  // Naively use a for..in loop to get the property names if the browser doesn't\n  // support any other APIs for getting it.\n  if (!Object.getOwnPropertyNames || !Object.getPrototypeOf) {\n    return getKeys(obj);\n  }\n\n  const visitedSet = {};\n\n  // Traverse the prototype chain and add all properties to the visited set.\n  let proto = obj;\n  while (proto && (proto !== Object.prototype || !!includeObjectPrototype) &&\n         (proto !== Function.prototype || !!includeFunctionPrototype)) {\n    const names = Object.getOwnPropertyNames(proto);\n    for (let i = 0; i < names.length; i++) {\n      visitedSet[names[i]] = true;\n    }\n    proto = Object.getPrototypeOf(proto);\n  }\n\n  return getKeys(visitedSet);\n}\n\n/**\n * Given a ES5 or ES6 class reference, return its super class / super\n * constructor.\n * This should be used in rare cases where you need to walk up the inheritance\n * tree (this is generally a bad idea). But this work with ES5 and ES6 classes,\n * unlike relying on the superClass_ property.\n * Note: To start walking up the hierarchy from an instance call this with its\n * `constructor` property; e.g. `getSuperClass(instance.constructor)`.\n * @param {function(new: ?)} constructor\n * @return {?Object}\n */\nfunction getSuperClass(constructor) {\n  const proto = Object.getPrototypeOf(constructor.prototype);\n  return proto && proto.constructor;\n}\n\nexports = {\n  add,\n  clear,\n  clone,\n  contains,\n  containsKey,\n  containsValue,\n  create,\n  createImmutableView,\n  createSet,\n  equals,\n  every,\n  extend,\n  filter,\n  findKey,\n  findValue,\n  forEach,\n  get,\n  getAllPropertyNames,\n  getAnyKey,\n  getAnyValue,\n  getCount,\n  getKeys,\n  getSuperClass,\n  getValueByKeys,\n  getValues,\n  isEmpty,\n  isImmutableView,\n  map,\n  remove,\n  set,\n  setIfUndefined,\n  setWithReturnValueIfNotSet,\n  some,\n  transpose,\n  unsafeClone,\n};\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview An event manager for both native browser event\n * targets and custom JavaScript event targets\n * (`goog.events.Listenable`). This provides an abstraction\n * over browsers' event systems.\n *\n * It also provides a simulation of W3C event model's capture phase in\n * Internet Explorer (IE 8 and below). Caveat: the simulation does not\n * interact well with listeners registered directly on the elements\n * (bypassing goog.events) or even with listeners registered via\n * goog.events in a separate JS binary. In these cases, we provide\n * no ordering guarantees.\n *\n * The listeners will receive a \"patched\" event object. Such event object\n * contains normalized values for certain event properties that differs in\n * different browsers.\n *\n * Example usage:\n * <pre>\n * goog.events.listen(myNode, 'click', function(e) { alert('woo') });\n * goog.events.listen(myNode, 'mouseover', mouseHandler, true);\n * goog.events.unlisten(myNode, 'mouseover', mouseHandler, true);\n * goog.events.removeAll(myNode);\n * </pre>\n *\n *                                            in IE and event object patching]\n *\n * @see ../demos/events.html\n * @see ../demos/event-propagation.html\n * @see ../demos/stopevent.html\n */\n\n// IMPLEMENTATION NOTES:\n// goog.events stores an auxiliary data structure on each EventTarget\n// source being listened on. This allows us to take advantage of GC,\n// having the data structure GC'd when the EventTarget is GC'd. This\n// GC behavior is equivalent to using W3C DOM Events directly.\n\ngoog.provide('goog.events');\ngoog.provide('goog.events.CaptureSimulationMode');\ngoog.provide('goog.events.Key');\ngoog.provide('goog.events.ListenableType');\n\ngoog.require('goog.asserts');\ngoog.require('goog.debug.entryPointRegistry');\ngoog.require('goog.events.BrowserEvent');\ngoog.require('goog.events.BrowserFeature');\ngoog.require('goog.events.Listenable');\ngoog.require('goog.events.ListenerMap');\ngoog.requireType('goog.debug.ErrorHandler');\ngoog.requireType('goog.events.EventId');\ngoog.requireType('goog.events.EventLike');\ngoog.requireType('goog.events.EventWrapper');\ngoog.requireType('goog.events.ListenableKey');\ngoog.requireType('goog.events.Listener');\n\n\n/**\n * @typedef {number|goog.events.ListenableKey}\n */\ngoog.events.Key;\n\n\n/**\n * @typedef {EventTarget|goog.events.Listenable}\n */\ngoog.events.ListenableType;\n\n\n/**\n * Property name on a native event target for the listener map\n * associated with the event target.\n * @private @const {string}\n */\ngoog.events.LISTENER_MAP_PROP_ = 'closure_lm_' + ((Math.random() * 1e6) | 0);\n\n\n/**\n * String used to prepend to IE event types.\n * @const\n * @private\n */\ngoog.events.onString_ = 'on';\n\n\n/**\n * Map of computed \"on<eventname>\" strings for IE event types. Caching\n * this removes an extra object allocation in goog.events.listen which\n * improves IE6 performance.\n * @const\n * @dict\n * @private\n */\ngoog.events.onStringMap_ = {};\n\n\n/**\n * @enum {number} Different capture simulation mode for IE8-.\n */\ngoog.events.CaptureSimulationMode = {\n  /**\n   * Does not perform capture simulation. Will asserts in IE8- when you\n   * add capture listeners.\n   */\n  OFF_AND_FAIL: 0,\n\n  /**\n   * Does not perform capture simulation, silently ignore capture\n   * listeners.\n   */\n  OFF_AND_SILENT: 1,\n\n  /**\n   * Performs capture simulation.\n   */\n  ON: 2\n};\n\n\n/**\n * @define {number} The capture simulation mode for IE8-. By default,\n *     this is ON.\n */\ngoog.events.CAPTURE_SIMULATION_MODE =\n    goog.define('goog.events.CAPTURE_SIMULATION_MODE', 2);\n\n\n/**\n * Estimated count of total native listeners.\n * @private {number}\n */\ngoog.events.listenerCountEstimate_ = 0;\n\n\n/**\n * Adds an event listener for a specific event on a native event\n * target (such as a DOM element) or an object that has implemented\n * {@link goog.events.Listenable}. A listener can only be added once\n * to an object and if it is added again the key for the listener is\n * returned. Note that if the existing listener is a one-off listener\n * (registered via listenOnce), it will no longer be a one-off\n * listener after a call to listen().\n *\n * @param {EventTarget|goog.events.Listenable} src The node to listen\n *     to events on.\n * @param {string|Array<string>|\n *     !goog.events.EventId<EVENTOBJ>|!Array<!goog.events.EventId<EVENTOBJ>>}\n *     type Event type or array of event types.\n * @param {function(this:T, EVENTOBJ):?|{handleEvent:function(?):?}|null}\n *     listener Callback method, or an object with a handleEvent function.\n *     WARNING: passing an Object is now softly deprecated.\n * @param {(boolean|!AddEventListenerOptions)=} opt_options\n * @param {T=} opt_handler Element in whose scope to call the listener.\n * @return {goog.events.Key} Unique key for the listener.\n * @template T,EVENTOBJ\n */\ngoog.events.listen = function(src, type, listener, opt_options, opt_handler) {\n  'use strict';\n  if (opt_options && opt_options.once) {\n    return goog.events.listenOnce(\n        src, type, listener, opt_options, opt_handler);\n  }\n  if (Array.isArray(type)) {\n    for (var i = 0; i < type.length; i++) {\n      goog.events.listen(src, type[i], listener, opt_options, opt_handler);\n    }\n    return null;\n  }\n\n  listener = goog.events.wrapListener(listener);\n  if (goog.events.Listenable.isImplementedBy(src)) {\n    var capture =\n        goog.isObject(opt_options) ? !!opt_options.capture : !!opt_options;\n    return src.listen(\n        /** @type {string|!goog.events.EventId} */ (type), listener, capture,\n        opt_handler);\n  } else {\n    return goog.events.listen_(\n        /** @type {!EventTarget} */ (src), type, listener,\n        /* callOnce */ false, opt_options, opt_handler);\n  }\n};\n\n\n/**\n * Adds an event listener for a specific event on a native event\n * target. A listener can only be added once to an object and if it\n * is added again the key for the listener is returned.\n *\n * Note that a one-off listener will not change an existing listener,\n * if any. On the other hand a normal listener will change existing\n * one-off listener to become a normal listener.\n *\n * @param {EventTarget} src The node to listen to events on.\n * @param {string|?goog.events.EventId<EVENTOBJ>} type Event type.\n * @param {!Function} listener Callback function.\n * @param {boolean} callOnce Whether the listener is a one-off\n *     listener or otherwise.\n * @param {(boolean|!AddEventListenerOptions)=} opt_options\n * @param {Object=} opt_handler Element in whose scope to call the listener.\n * @return {goog.events.ListenableKey} Unique key for the listener.\n * @template EVENTOBJ\n * @private\n */\ngoog.events.listen_ = function(\n    src, type, listener, callOnce, opt_options, opt_handler) {\n  'use strict';\n  if (!type) {\n    throw new Error('Invalid event type');\n  }\n\n  var capture =\n      goog.isObject(opt_options) ? !!opt_options.capture : !!opt_options;\n\n  var listenerMap = goog.events.getListenerMap_(src);\n  if (!listenerMap) {\n    src[goog.events.LISTENER_MAP_PROP_] = listenerMap =\n        new goog.events.ListenerMap(src);\n  }\n\n  var listenerObj = /** @type {goog.events.Listener} */ (\n      listenerMap.add(type, listener, callOnce, capture, opt_handler));\n\n  // If the listenerObj already has a proxy, it has been set up\n  // previously. We simply return.\n  if (listenerObj.proxy) {\n    return listenerObj;\n  }\n\n  var proxy = goog.events.getProxy();\n  listenerObj.proxy = proxy;\n\n  proxy.src = src;\n  proxy.listener = listenerObj;\n\n  // Attach the proxy through the browser's API\n  if (src.addEventListener) {\n    // Don't pass an object as `capture` if the browser doesn't support that.\n    if (!goog.events.BrowserFeature.PASSIVE_EVENTS) {\n      opt_options = capture;\n    }\n    // Don't break tests that expect a boolean.\n    if (opt_options === undefined) opt_options = false;\n    src.addEventListener(type.toString(), proxy, opt_options);\n  } else if (src.attachEvent) {\n    // The else if above used to be an unconditional else. It would call\n    // attachEvent come gws or high water. This would sometimes throw an\n    // exception on IE11, spoiling the day of some callers. The previous\n    // incarnation of this code, from 2007, indicates that it replaced an\n    // earlier still version that caused excess allocations on IE6.\n    src.attachEvent(goog.events.getOnString_(type.toString()), proxy);\n  } else if (src.addListener && src.removeListener) {\n    // In IE, MediaQueryList uses addListener() insteadd of addEventListener. In\n    // Safari, there is no global for the MediaQueryList constructor, so we just\n    // check whether the object \"looks like\" MediaQueryList.\n    goog.asserts.assert(\n        type === 'change', 'MediaQueryList only has a change event');\n    src.addListener(proxy);\n  } else {\n    throw new Error('addEventListener and attachEvent are unavailable.');\n  }\n\n  goog.events.listenerCountEstimate_++;\n  return listenerObj;\n};\n\n\n/**\n * Helper function for returning a proxy function.\n * @return {!Function} A new or reused function object.\n */\ngoog.events.getProxy = function() {\n  'use strict';\n  const proxyCallbackFunction = goog.events.handleBrowserEvent_;\n  const f = function(eventObject) {\n    return proxyCallbackFunction.call(f.src, f.listener, eventObject);\n  };\n  return f;\n};\n\n\n/**\n * Adds an event listener for a specific event on a native event\n * target (such as a DOM element) or an object that has implemented\n * {@link goog.events.Listenable}. After the event has fired the event\n * listener is removed from the target.\n *\n * If an existing listener already exists, listenOnce will do\n * nothing. In particular, if the listener was previously registered\n * via listen(), listenOnce() will not turn the listener into a\n * one-off listener. Similarly, if there is already an existing\n * one-off listener, listenOnce does not modify the listeners (it is\n * still a once listener).\n *\n * @param {EventTarget|goog.events.Listenable} src The node to listen\n *     to events on.\n * @param {string|Array<string>|\n *     !goog.events.EventId<EVENTOBJ>|!Array<!goog.events.EventId<EVENTOBJ>>}\n *     type Event type or array of event types.\n * @param {function(this:T, EVENTOBJ):?|{handleEvent:function(?):?}|null}\n *     listener Callback method.\n * @param {(boolean|!AddEventListenerOptions)=} opt_options\n * @param {T=} opt_handler Element in whose scope to call the listener.\n * @return {goog.events.Key} Unique key for the listener.\n * @template T,EVENTOBJ\n */\ngoog.events.listenOnce = function(\n    src, type, listener, opt_options, opt_handler) {\n  'use strict';\n  if (Array.isArray(type)) {\n    for (var i = 0; i < type.length; i++) {\n      goog.events.listenOnce(src, type[i], listener, opt_options, opt_handler);\n    }\n    return null;\n  }\n\n  listener = goog.events.wrapListener(listener);\n  if (goog.events.Listenable.isImplementedBy(src)) {\n    var capture =\n        goog.isObject(opt_options) ? !!opt_options.capture : !!opt_options;\n    return src.listenOnce(\n        /** @type {string|!goog.events.EventId} */ (type), listener, capture,\n        opt_handler);\n  } else {\n    return goog.events.listen_(\n        /** @type {!EventTarget} */ (src), type, listener,\n        /* callOnce */ true, opt_options, opt_handler);\n  }\n};\n\n\n/**\n * Adds an event listener with a specific event wrapper on a DOM Node or an\n * object that has implemented {@link goog.events.Listenable}. A listener can\n * only be added once to an object.\n *\n * @param {EventTarget|goog.events.Listenable} src The target to\n *     listen to events on.\n * @param {goog.events.EventWrapper} wrapper Event wrapper to use.\n * @param {function(this:T, ?):?|{handleEvent:function(?):?}|null} listener\n *     Callback method, or an object with a handleEvent function.\n * @param {boolean=} opt_capt Whether to fire in capture phase (defaults to\n *     false).\n * @param {T=} opt_handler Element in whose scope to call the listener.\n * @template T\n */\ngoog.events.listenWithWrapper = function(\n    src, wrapper, listener, opt_capt, opt_handler) {\n  'use strict';\n  wrapper.listen(src, listener, opt_capt, opt_handler);\n};\n\n\n/**\n * Removes an event listener which was added with listen().\n *\n * @param {EventTarget|goog.events.Listenable} src The target to stop\n *     listening to events on.\n * @param {string|Array<string>|\n *     !goog.events.EventId<EVENTOBJ>|!Array<!goog.events.EventId<EVENTOBJ>>}\n *     type Event type or array of event types to unlisten to.\n * @param {function(?):?|{handleEvent:function(?):?}|null} listener The\n *     listener function to remove.\n * @param {(boolean|!EventListenerOptions)=} opt_options\n *     whether the listener is fired during the capture or bubble phase of the\n *     event.\n * @param {Object=} opt_handler Element in whose scope to call the listener.\n * @return {?boolean} indicating whether the listener was there to remove.\n * @template EVENTOBJ\n */\ngoog.events.unlisten = function(src, type, listener, opt_options, opt_handler) {\n  'use strict';\n  if (Array.isArray(type)) {\n    for (var i = 0; i < type.length; i++) {\n      goog.events.unlisten(src, type[i], listener, opt_options, opt_handler);\n    }\n    return null;\n  }\n  var capture =\n      goog.isObject(opt_options) ? !!opt_options.capture : !!opt_options;\n\n  listener = goog.events.wrapListener(listener);\n  if (goog.events.Listenable.isImplementedBy(src)) {\n    return src.unlisten(\n        /** @type {string|!goog.events.EventId} */ (type), listener, capture,\n        opt_handler);\n  }\n\n  if (!src) {\n    // TODO(chrishenry): We should tighten the API to only accept\n    // non-null objects, or add an assertion here.\n    return false;\n  }\n\n  var listenerMap = goog.events.getListenerMap_(\n      /** @type {!EventTarget} */ (src));\n  if (listenerMap) {\n    var listenerObj = listenerMap.getListener(\n        /** @type {string|!goog.events.EventId} */ (type), listener, capture,\n        opt_handler);\n    if (listenerObj) {\n      return goog.events.unlistenByKey(listenerObj);\n    }\n  }\n\n  return false;\n};\n\n\n/**\n * Removes an event listener which was added with listen() by the key\n * returned by listen().\n *\n * @param {goog.events.Key} key The key returned by listen() for this\n *     event listener.\n * @return {boolean} indicating whether the listener was there to remove.\n */\ngoog.events.unlistenByKey = function(key) {\n  'use strict';\n  // TODO(chrishenry): Remove this check when tests that rely on this\n  // are fixed.\n  if (typeof key === 'number') {\n    return false;\n  }\n\n  var listener = key;\n  if (!listener || listener.removed) {\n    return false;\n  }\n\n  var src = listener.src;\n  if (goog.events.Listenable.isImplementedBy(src)) {\n    return /** @type {!goog.events.Listenable} */ (src).unlistenByKey(listener);\n  }\n\n  var type = listener.type;\n  var proxy = listener.proxy;\n  if (src.removeEventListener) {\n    src.removeEventListener(type, proxy, listener.capture);\n  } else if (src.detachEvent) {\n    src.detachEvent(goog.events.getOnString_(type), proxy);\n  } else if (src.addListener && src.removeListener) {\n    src.removeListener(proxy);\n  }\n  goog.events.listenerCountEstimate_--;\n\n  var listenerMap = goog.events.getListenerMap_(\n      /** @type {!EventTarget} */ (src));\n  // TODO(chrishenry): Try to remove this conditional and execute the\n  // first branch always. This should be safe.\n  if (listenerMap) {\n    listenerMap.removeByKey(listener);\n    if (listenerMap.getTypeCount() == 0) {\n      // Null the src, just because this is simple to do (and useful\n      // for IE <= 7).\n      listenerMap.src = null;\n      // We don't use delete here because IE does not allow delete\n      // on a window object.\n      src[goog.events.LISTENER_MAP_PROP_] = null;\n    }\n  } else {\n    /** @type {!goog.events.Listener} */ (listener).markAsRemoved();\n  }\n\n  return true;\n};\n\n\n/**\n * Removes an event listener which was added with listenWithWrapper().\n *\n * @param {EventTarget|goog.events.Listenable} src The target to stop\n *     listening to events on.\n * @param {goog.events.EventWrapper} wrapper Event wrapper to use.\n * @param {function(?):?|{handleEvent:function(?):?}|null} listener The\n *     listener function to remove.\n * @param {boolean=} opt_capt In DOM-compliant browsers, this determines\n *     whether the listener is fired during the capture or bubble phase of the\n *     event.\n * @param {Object=} opt_handler Element in whose scope to call the listener.\n */\ngoog.events.unlistenWithWrapper = function(\n    src, wrapper, listener, opt_capt, opt_handler) {\n  'use strict';\n  wrapper.unlisten(src, listener, opt_capt, opt_handler);\n};\n\n\n/**\n * Removes all listeners from an object. You can also optionally\n * remove listeners of a particular type.\n *\n * @param {Object|undefined} obj Object to remove listeners from. Must be an\n *     EventTarget or a goog.events.Listenable.\n * @param {string|!goog.events.EventId=} opt_type Type of event to remove.\n *     Default is all types.\n * @return {number} Number of listeners removed.\n */\ngoog.events.removeAll = function(obj, opt_type) {\n  'use strict';\n  // TODO(chrishenry): Change the type of obj to\n  // (!EventTarget|!goog.events.Listenable).\n\n  if (!obj) {\n    return 0;\n  }\n\n  if (goog.events.Listenable.isImplementedBy(obj)) {\n    return /** @type {?} */ (obj).removeAllListeners(opt_type);\n  }\n\n  var listenerMap = goog.events.getListenerMap_(\n      /** @type {!EventTarget} */ (obj));\n  if (!listenerMap) {\n    return 0;\n  }\n\n  var count = 0;\n  var typeStr = opt_type && opt_type.toString();\n  for (var type in listenerMap.listeners) {\n    if (!typeStr || type == typeStr) {\n      // Clone so that we don't need to worry about unlistenByKey\n      // changing the content of the ListenerMap.\n      var listeners = listenerMap.listeners[type].concat();\n      for (var i = 0; i < listeners.length; ++i) {\n        if (goog.events.unlistenByKey(listeners[i])) {\n          ++count;\n        }\n      }\n    }\n  }\n  return count;\n};\n\n\n/**\n * Gets the listeners for a given object, type and capture phase.\n *\n * @param {Object} obj Object to get listeners for.\n * @param {string|!goog.events.EventId} type Event type.\n * @param {boolean} capture Capture phase?.\n * @return {!Array<!goog.events.Listener>} Array of listener objects.\n */\ngoog.events.getListeners = function(obj, type, capture) {\n  'use strict';\n  if (goog.events.Listenable.isImplementedBy(obj)) {\n    return /** @type {!goog.events.Listenable} */ (obj).getListeners(\n        type, capture);\n  } else {\n    if (!obj) {\n      // TODO(chrishenry): We should tighten the API to accept\n      // !EventTarget|goog.events.Listenable, and add an assertion here.\n      return [];\n    }\n\n    var listenerMap = goog.events.getListenerMap_(\n        /** @type {!EventTarget} */ (obj));\n    return listenerMap ? listenerMap.getListeners(type, capture) : [];\n  }\n};\n\n\n/**\n * Gets the goog.events.Listener for the event or null if no such listener is\n * in use.\n *\n * @param {EventTarget|goog.events.Listenable} src The target from\n *     which to get listeners.\n * @param {?string|!goog.events.EventId<EVENTOBJ>} type The type of the event.\n * @param {function(EVENTOBJ):?|{handleEvent:function(?):?}|null} listener The\n *     listener function to get.\n * @param {boolean=} opt_capt In DOM-compliant browsers, this determines\n *                            whether the listener is fired during the\n *                            capture or bubble phase of the event.\n * @param {Object=} opt_handler Element in whose scope to call the listener.\n * @return {goog.events.ListenableKey} the found listener or null if not found.\n * @template EVENTOBJ\n */\ngoog.events.getListener = function(src, type, listener, opt_capt, opt_handler) {\n  'use strict';\n  // TODO(chrishenry): Change type from ?string to string, or add assertion.\n  type = /** @type {string} */ (type);\n  listener = goog.events.wrapListener(listener);\n  var capture = !!opt_capt;\n  if (goog.events.Listenable.isImplementedBy(src)) {\n    return src.getListener(type, listener, capture, opt_handler);\n  }\n\n  if (!src) {\n    // TODO(chrishenry): We should tighten the API to only accept\n    // non-null objects, or add an assertion here.\n    return null;\n  }\n\n  var listenerMap = goog.events.getListenerMap_(\n      /** @type {!EventTarget} */ (src));\n  if (listenerMap) {\n    return listenerMap.getListener(type, listener, capture, opt_handler);\n  }\n  return null;\n};\n\n\n/**\n * Returns whether an event target has any active listeners matching the\n * specified signature. If either the type or capture parameters are\n * unspecified, the function will match on the remaining criteria.\n *\n * @param {EventTarget|goog.events.Listenable} obj Target to get\n *     listeners for.\n * @param {string|!goog.events.EventId=} opt_type Event type.\n * @param {boolean=} opt_capture Whether to check for capture or bubble-phase\n *     listeners.\n * @return {boolean} Whether an event target has one or more listeners matching\n *     the requested type and/or capture phase.\n */\ngoog.events.hasListener = function(obj, opt_type, opt_capture) {\n  'use strict';\n  if (goog.events.Listenable.isImplementedBy(obj)) {\n    return obj.hasListener(opt_type, opt_capture);\n  }\n\n  var listenerMap = goog.events.getListenerMap_(\n      /** @type {!EventTarget} */ (obj));\n  return !!listenerMap && listenerMap.hasListener(opt_type, opt_capture);\n};\n\n\n/**\n * Provides a nice string showing the normalized event objects public members\n * @param {Object} e Event Object.\n * @return {string} String of the public members of the normalized event object.\n */\ngoog.events.expose = function(e) {\n  'use strict';\n  var str = [];\n  for (var key in e) {\n    if (e[key] && e[key].id) {\n      str.push(key + ' = ' + e[key] + ' (' + e[key].id + ')');\n    } else {\n      str.push(key + ' = ' + e[key]);\n    }\n  }\n  return str.join('\\n');\n};\n\n\n/**\n * Returns a string with on prepended to the specified type. This is used for IE\n * which expects \"on\" to be prepended. This function caches the string in order\n * to avoid extra allocations in steady state.\n * @param {string} type Event type.\n * @return {string} The type string with 'on' prepended.\n * @private\n */\ngoog.events.getOnString_ = function(type) {\n  'use strict';\n  if (type in goog.events.onStringMap_) {\n    return goog.events.onStringMap_[type];\n  }\n  return goog.events.onStringMap_[type] = goog.events.onString_ + type;\n};\n\n\n/**\n * Fires an object's listeners of a particular type and phase\n *\n * @param {Object} obj Object whose listeners to call.\n * @param {string|!goog.events.EventId} type Event type.\n * @param {boolean} capture Which event phase.\n * @param {Object} eventObject Event object to be passed to listener.\n * @return {boolean} True if all listeners returned true else false.\n */\ngoog.events.fireListeners = function(obj, type, capture, eventObject) {\n  'use strict';\n  if (goog.events.Listenable.isImplementedBy(obj)) {\n    return /** @type {!goog.events.Listenable} */ (obj).fireListeners(\n        type, capture, eventObject);\n  }\n\n  return goog.events.fireListeners_(obj, type, capture, eventObject);\n};\n\n\n/**\n * Fires an object's listeners of a particular type and phase.\n * @param {Object} obj Object whose listeners to call.\n * @param {string|!goog.events.EventId} type Event type.\n * @param {boolean} capture Which event phase.\n * @param {Object} eventObject Event object to be passed to listener.\n * @return {boolean} True if all listeners returned true else false.\n * @private\n */\ngoog.events.fireListeners_ = function(obj, type, capture, eventObject) {\n  'use strict';\n  /** @type {boolean} */\n  var retval = true;\n\n  var listenerMap = goog.events.getListenerMap_(\n      /** @type {EventTarget} */ (obj));\n  if (listenerMap) {\n    // TODO(chrishenry): Original code avoids array creation when there\n    // is no listener, so we do the same. If this optimization turns\n    // out to be not required, we can replace this with\n    // listenerMap.getListeners(type, capture) instead, which is simpler.\n    var listenerArray = listenerMap.listeners[type.toString()];\n    if (listenerArray) {\n      listenerArray = listenerArray.concat();\n      for (var i = 0; i < listenerArray.length; i++) {\n        var listener = listenerArray[i];\n        // We might not have a listener if the listener was removed.\n        if (listener && listener.capture == capture && !listener.removed) {\n          var result = goog.events.fireListener(listener, eventObject);\n          retval = retval && (result !== false);\n        }\n      }\n    }\n  }\n  return retval;\n};\n\n\n/**\n * Fires a listener with a set of arguments\n *\n * @param {goog.events.Listener} listener The listener object to call.\n * @param {Object} eventObject The event object to pass to the listener.\n * @return {*} Result of listener.\n */\ngoog.events.fireListener = function(listener, eventObject) {\n  'use strict';\n  var listenerFn = listener.listener;\n  var listenerHandler = listener.handler || listener.src;\n\n  if (listener.callOnce) {\n    goog.events.unlistenByKey(listener);\n  }\n  return listenerFn.call(listenerHandler, eventObject);\n};\n\n\n/**\n * Gets the total number of listeners currently in the system.\n * @return {number} Number of listeners.\n * @deprecated This returns estimated count, now that Closure no longer\n * stores a central listener registry. We still return an estimation\n * to keep existing listener-related tests passing. In the near future,\n * this function will be removed.\n */\ngoog.events.getTotalListenerCount = function() {\n  'use strict';\n  return goog.events.listenerCountEstimate_;\n};\n\n\n/**\n * Dispatches an event (or event like object) and calls all listeners\n * listening for events of this type. The type of the event is decided by the\n * type property on the event object.\n *\n * If any of the listeners returns false OR calls preventDefault then this\n * function will return false.  If one of the capture listeners calls\n * stopPropagation, then the bubble listeners won't fire.\n *\n * @param {goog.events.Listenable} src The event target.\n * @param {goog.events.EventLike} e Event object.\n * @return {boolean} If anyone called preventDefault on the event object (or\n *     if any of the handlers returns false) this will also return false.\n *     If there are no handlers, or if all handlers return true, this returns\n *     true.\n */\ngoog.events.dispatchEvent = function(src, e) {\n  'use strict';\n  goog.asserts.assert(\n      goog.events.Listenable.isImplementedBy(src),\n      'Can not use goog.events.dispatchEvent with ' +\n          'non-goog.events.Listenable instance.');\n  return src.dispatchEvent(e);\n};\n\n\n/**\n * Installs exception protection for the browser event entry point using the\n * given error handler.\n *\n * @param {goog.debug.ErrorHandler} errorHandler Error handler with which to\n *     protect the entry point.\n */\ngoog.events.protectBrowserEventEntryPoint = function(errorHandler) {\n  'use strict';\n  goog.events.handleBrowserEvent_ =\n      errorHandler.protectEntryPoint(goog.events.handleBrowserEvent_);\n};\n\n\n/**\n * Handles an event and dispatches it to the correct listeners. This\n * function is a proxy for the real listener the user specified.\n *\n * @param {goog.events.Listener} listener The listener object.\n * @param {Event=} opt_evt Optional event object that gets passed in via the\n *     native event handlers.\n * @return {*} Result of the event handler.\n * @this {EventTarget} The object or Element that fired the event.\n * @private\n */\ngoog.events.handleBrowserEvent_ = function(listener, opt_evt) {\n  'use strict';\n  if (listener.removed) {\n    return true;\n  }\n\n  // Otherwise, simply fire the listener.\n  return goog.events.fireListener(\n      listener, new goog.events.BrowserEvent(opt_evt, this));\n};\n\n\n/**\n * This is used to mark the IE event object so we do not do the Closure pass\n * twice for a bubbling event.\n * @param {Event} e The IE browser event.\n * @private\n */\ngoog.events.markIeEvent_ = function(e) {\n  'use strict';\n  // Only the keyCode and the returnValue can be changed. We use keyCode for\n  // non keyboard events.\n  // event.returnValue is a bit more tricky. It is undefined by default. A\n  // boolean false prevents the default action. In a window.onbeforeunload and\n  // the returnValue is non undefined it will be alerted. However, we will only\n  // modify the returnValue for keyboard events. We can get a problem if non\n  // closure events sets the keyCode or the returnValue\n\n  var useReturnValue = false;\n\n  if (e.keyCode == 0) {\n    // We cannot change the keyCode in case that srcElement is input[type=file].\n    // We could test that that is the case but that would allocate 3 objects.\n    // If we use try/catch we will only allocate extra objects in the case of a\n    // failure.\n\n    try {\n      e.keyCode = -1;\n      return;\n    } catch (ex) {\n      useReturnValue = true;\n    }\n  }\n\n  if (useReturnValue ||\n      /** @type {boolean|undefined} */ (e.returnValue) == undefined) {\n    e.returnValue = true;\n  }\n};\n\n\n/**\n * This is used to check if an IE event has already been handled by the Closure\n * system so we do not do the Closure pass twice for a bubbling event.\n * @param {Event} e  The IE browser event.\n * @return {boolean} True if the event object has been marked.\n * @private\n */\ngoog.events.isMarkedIeEvent_ = function(e) {\n  'use strict';\n  return e.keyCode < 0 || e.returnValue != undefined;\n};\n\n\n/**\n * Counter to create unique event ids.\n * @private {number}\n */\ngoog.events.uniqueIdCounter_ = 0;\n\n\n/**\n * Creates a unique event id.\n *\n * @param {string} identifier The identifier.\n * @return {string} A unique identifier.\n * @idGenerator {unique}\n */\ngoog.events.getUniqueId = function(identifier) {\n  'use strict';\n  return identifier + '_' + goog.events.uniqueIdCounter_++;\n};\n\n\n/**\n * @param {EventTarget} src The source object.\n * @return {goog.events.ListenerMap} A listener map for the given\n *     source object, or null if none exists.\n * @private\n */\ngoog.events.getListenerMap_ = function(src) {\n  'use strict';\n  var listenerMap = src[goog.events.LISTENER_MAP_PROP_];\n  // IE serializes the property as well (e.g. when serializing outer\n  // HTML). So we must check that the value is of the correct type.\n  return listenerMap instanceof goog.events.ListenerMap ? listenerMap : null;\n};\n\n\n/**\n * Expando property for listener function wrapper for Object with\n * handleEvent.\n * @private @const {string}\n */\ngoog.events.LISTENER_WRAPPER_PROP_ =\n    '__closure_events_fn_' + ((Math.random() * 1e9) >>> 0);\n\n\n/**\n * @param {Object|Function} listener The listener function or an\n *     object that contains handleEvent method.\n * @return {!Function} Either the original function or a function that\n *     calls obj.handleEvent. If the same listener is passed to this\n *     function more than once, the same function is guaranteed to be\n *     returned.\n */\ngoog.events.wrapListener = function(listener) {\n  'use strict';\n  goog.asserts.assert(listener, 'Listener can not be null.');\n\n  if (typeof listener === 'function') {\n    return listener;\n  }\n\n  goog.asserts.assert(\n      listener.handleEvent, 'An object listener must have handleEvent method.');\n  if (!listener[goog.events.LISTENER_WRAPPER_PROP_]) {\n    listener[goog.events.LISTENER_WRAPPER_PROP_] = function(e) {\n      'use strict';\n      return /** @type {?} */ (listener).handleEvent(e);\n    };\n  }\n  return listener[goog.events.LISTENER_WRAPPER_PROP_];\n};\n\n\n// Register the browser event handler as an entry point, so that\n// it can be monitored for exception handling, etc.\ngoog.debug.entryPointRegistry.register(\n    /**\n     * @param {function(!Function): !Function} transformer The transforming\n     *     function.\n     */\n    function(transformer) {\n      'use strict';\n      goog.events.handleBrowserEvent_ =\n          transformer(goog.events.handleBrowserEvent_);\n    });\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview A disposable implementation of a custom\n * listenable/event target. See also: documentation for\n * `goog.events.Listenable`.\n *\n * @see ../demos/eventtarget.html\n * @see goog.events.Listenable\n */\n\ngoog.provide('goog.events.EventTarget');\n\ngoog.require('goog.Disposable');\ngoog.require('goog.asserts');\ngoog.require('goog.events');\ngoog.require('goog.events.Event');\ngoog.require('goog.events.Listenable');\ngoog.require('goog.events.ListenerMap');\ngoog.require('goog.object');\ngoog.requireType('goog.events.EventId');\ngoog.requireType('goog.events.EventLike');\ngoog.requireType('goog.events.ListenableKey');\n\n\n\n/**\n * An implementation of `goog.events.Listenable` with full W3C\n * EventTarget-like support (capture/bubble mechanism, stopping event\n * propagation, preventing default actions).\n *\n * You may subclass this class to turn your class into a Listenable.\n *\n * Unless propagation is stopped, an event dispatched by an\n * EventTarget will bubble to the parent returned by\n * `getParentEventTarget`. To set the parent, call\n * `setParentEventTarget`. Subclasses that don't support\n * changing the parent can override the setter to throw an error.\n *\n * Example usage:\n * <pre>\n *   var source = new goog.events.EventTarget();\n *   function handleEvent(e) {\n *     alert('Type: ' + e.type + '; Target: ' + e.target);\n *   }\n *   source.listen('foo', handleEvent);\n *   // Or: goog.events.listen(source, 'foo', handleEvent);\n *   ...\n *   source.dispatchEvent('foo');  // will call handleEvent\n *   ...\n *   source.unlisten('foo', handleEvent);\n *   // Or: goog.events.unlisten(source, 'foo', handleEvent);\n * </pre>\n *\n * @constructor\n * @extends {goog.Disposable}\n * @implements {goog.events.Listenable}\n */\ngoog.events.EventTarget = function() {\n  'use strict';\n  goog.Disposable.call(this);\n\n  /**\n   * Maps of event type to an array of listeners.\n   * @private {!goog.events.ListenerMap}\n   */\n  this.eventTargetListeners_ = new goog.events.ListenerMap(this);\n\n  /**\n   * The object to use for event.target. Useful when mixing in an\n   * EventTarget to another object.\n   * @private {!Object}\n   */\n  this.actualEventTarget_ = this;\n\n  /**\n   * Parent event target, used during event bubbling.\n   *\n   * TODO(chrishenry): Change this to goog.events.Listenable. This\n   * currently breaks people who expect getParentEventTarget to return\n   * goog.events.EventTarget.\n   *\n   * @private {?goog.events.EventTarget}\n   */\n  this.parentEventTarget_ = null;\n};\ngoog.inherits(goog.events.EventTarget, goog.Disposable);\ngoog.events.Listenable.addImplementation(goog.events.EventTarget);\n\n\n/**\n * An artificial cap on the number of ancestors you can have. This is mainly\n * for loop detection.\n * @const {number}\n * @private\n */\ngoog.events.EventTarget.MAX_ANCESTORS_ = 1000;\n\n\n/**\n * Returns the parent of this event target to use for bubbling.\n *\n * @return {goog.events.EventTarget} The parent EventTarget or null if\n *     there is no parent.\n * @override\n */\ngoog.events.EventTarget.prototype.getParentEventTarget = function() {\n  'use strict';\n  return this.parentEventTarget_;\n};\n\n\n/**\n * Sets the parent of this event target to use for capture/bubble\n * mechanism.\n * @param {goog.events.EventTarget} parent Parent listenable (null if none).\n */\ngoog.events.EventTarget.prototype.setParentEventTarget = function(parent) {\n  'use strict';\n  this.parentEventTarget_ = parent;\n};\n\n\n/**\n * Adds an event listener to the event target. The same handler can only be\n * added once per the type. Even if you add the same handler multiple times\n * using the same type then it will only be called once when the event is\n * dispatched.\n *\n * @param {string|!goog.events.EventId} type The type of the event to listen for\n * @param {function(?):?|{handleEvent:function(?):?}|null} handler The function\n *     to handle the event. The handler can also be an object that implements\n *     the handleEvent method which takes the event object as argument.\n * @param {boolean=} opt_capture In DOM-compliant browsers, this determines\n *     whether the listener is fired during the capture or bubble phase\n *     of the event.\n * @param {Object=} opt_handlerScope Object in whose scope to call\n *     the listener.\n * @deprecated Use `#listen` instead, when possible. Otherwise, use\n *     `goog.events.listen` if you are passing Object\n *     (instead of Function) as handler.\n */\ngoog.events.EventTarget.prototype.addEventListener = function(\n    type, handler, opt_capture, opt_handlerScope) {\n  'use strict';\n  goog.events.listen(this, type, handler, opt_capture, opt_handlerScope);\n};\n\n\n/**\n * Removes an event listener from the event target. The handler must be the\n * same object as the one added. If the handler has not been added then\n * nothing is done.\n *\n * @param {string|!goog.events.EventId} type The type of the event to listen for\n * @param {function(?):?|{handleEvent:function(?):?}|null} handler The function\n *     to handle the event. The handler can also be an object that implements\n *     the handleEvent method which takes the event object as argument.\n * @param {boolean=} opt_capture In DOM-compliant browsers, this determines\n *     whether the listener is fired during the capture or bubble phase\n *     of the event.\n * @param {Object=} opt_handlerScope Object in whose scope to call\n *     the listener.\n * @deprecated Use `#unlisten` instead, when possible. Otherwise, use\n *     `goog.events.unlisten` if you are passing Object\n *     (instead of Function) as handler.\n */\ngoog.events.EventTarget.prototype.removeEventListener = function(\n    type, handler, opt_capture, opt_handlerScope) {\n  'use strict';\n  goog.events.unlisten(this, type, handler, opt_capture, opt_handlerScope);\n};\n\n\n/**\n * @param {?goog.events.EventLike} e Event object.\n * @return {boolean} If anyone called preventDefault on the event object (or\n *     if any of the listeners returns false) this will also return false.\n * @override\n */\ngoog.events.EventTarget.prototype.dispatchEvent = function(e) {\n  'use strict';\n  this.assertInitialized_();\n\n  var ancestorsTree, ancestor = this.getParentEventTarget();\n  if (ancestor) {\n    ancestorsTree = [];\n    var ancestorCount = 1;\n    for (; ancestor; ancestor = ancestor.getParentEventTarget()) {\n      ancestorsTree.push(ancestor);\n      goog.asserts.assert(\n          (++ancestorCount < goog.events.EventTarget.MAX_ANCESTORS_),\n          'infinite loop');\n    }\n  }\n\n  return goog.events.EventTarget.dispatchEventInternal_(\n      this.actualEventTarget_, e, ancestorsTree);\n};\n\n\n/**\n * Removes listeners from this object.  Classes that extend EventTarget may\n * need to override this method in order to remove references to DOM Elements\n * and additional listeners.\n * @override\n * @protected\n */\ngoog.events.EventTarget.prototype.disposeInternal = function() {\n  'use strict';\n  goog.events.EventTarget.superClass_.disposeInternal.call(this);\n\n  this.removeAllListeners();\n  this.parentEventTarget_ = null;\n};\n\n\n/**\n * @param {string|!goog.events.EventId<EVENTOBJ>} type The event type id.\n * @param {function(this:SCOPE, EVENTOBJ):(boolean|undefined)} listener Callback\n *     method.\n * @param {boolean=} opt_useCapture Whether to fire in capture phase\n *     (defaults to false).\n * @param {SCOPE=} opt_listenerScope Object in whose scope to call the\n *     listener.\n * @return {!goog.events.ListenableKey} Unique key for the listener.\n * @template SCOPE,EVENTOBJ\n * @override\n */\ngoog.events.EventTarget.prototype.listen = function(\n    type, listener, opt_useCapture, opt_listenerScope) {\n  'use strict';\n  this.assertInitialized_();\n  return this.eventTargetListeners_.add(\n      String(type), listener, false /* callOnce */, opt_useCapture,\n      opt_listenerScope);\n};\n\n\n/**\n * @param {string|!goog.events.EventId<EVENTOBJ>} type The event type id.\n * @param {function(this:SCOPE, EVENTOBJ):(boolean|undefined)} listener Callback\n *     method.\n * @param {boolean=} opt_useCapture Whether to fire in capture phase\n *     (defaults to false).\n * @param {SCOPE=} opt_listenerScope Object in whose scope to call the\n *     listener.\n * @return {!goog.events.ListenableKey} Unique key for the listener.\n * @template SCOPE,EVENTOBJ\n * @override\n */\ngoog.events.EventTarget.prototype.listenOnce = function(\n    type, listener, opt_useCapture, opt_listenerScope) {\n  'use strict';\n  return this.eventTargetListeners_.add(\n      String(type), listener, true /* callOnce */, opt_useCapture,\n      opt_listenerScope);\n};\n\n\n/**\n * @param {string|!goog.events.EventId<EVENTOBJ>} type The event type id.\n * @param {function(this:SCOPE, EVENTOBJ):(boolean|undefined)} listener Callback\n *     method.\n * @param {boolean=} opt_useCapture Whether to fire in capture phase\n *     (defaults to false).\n * @param {SCOPE=} opt_listenerScope Object in whose scope to call\n *     the listener.\n * @return {boolean} Whether any listener was removed.\n * @template SCOPE,EVENTOBJ\n * @override\n */\ngoog.events.EventTarget.prototype.unlisten = function(\n    type, listener, opt_useCapture, opt_listenerScope) {\n  'use strict';\n  return this.eventTargetListeners_.remove(\n      String(type), listener, opt_useCapture, opt_listenerScope);\n};\n\n\n/**\n * @param {!goog.events.ListenableKey} key The key returned by\n *     listen() or listenOnce().\n * @return {boolean} Whether any listener was removed.\n * @override\n */\ngoog.events.EventTarget.prototype.unlistenByKey = function(key) {\n  'use strict';\n  return this.eventTargetListeners_.removeByKey(key);\n};\n\n\n/**\n * @param {string|!goog.events.EventId=} opt_type Type of event to remove,\n *     default is to remove all types.\n * @return {number} Number of listeners removed.\n * @override\n */\ngoog.events.EventTarget.prototype.removeAllListeners = function(opt_type) {\n  'use strict';\n  // TODO(chrishenry): Previously, removeAllListeners can be called on\n  // uninitialized EventTarget, so we preserve that behavior. We\n  // should remove this when usages that rely on that fact are purged.\n  if (!this.eventTargetListeners_) {\n    return 0;\n  }\n  return this.eventTargetListeners_.removeAll(opt_type);\n};\n\n\n/**\n * @param {string|!goog.events.EventId<EVENTOBJ>} type The type of the\n *     listeners to fire.\n * @param {boolean} capture The capture mode of the listeners to fire.\n * @param {EVENTOBJ} eventObject The event object to fire.\n * @return {boolean} Whether all listeners succeeded without\n *     attempting to prevent default behavior. If any listener returns\n *     false or called goog.events.Event#preventDefault, this returns\n *     false.\n * @template EVENTOBJ\n * @override\n */\ngoog.events.EventTarget.prototype.fireListeners = function(\n    type, capture, eventObject) {\n  'use strict';\n  // TODO(chrishenry): Original code avoids array creation when there\n  // is no listener, so we do the same. If this optimization turns\n  // out to be not required, we can replace this with\n  // getListeners(type, capture) instead, which is simpler.\n  var listenerArray = this.eventTargetListeners_.listeners[String(type)];\n  if (!listenerArray) {\n    return true;\n  }\n  listenerArray = listenerArray.concat();\n\n  var rv = true;\n  for (var i = 0; i < listenerArray.length; ++i) {\n    var listener = listenerArray[i];\n    // We might not have a listener if the listener was removed.\n    if (listener && !listener.removed && listener.capture == capture) {\n      var listenerFn = listener.listener;\n      var listenerHandler = listener.handler || listener.src;\n\n      if (listener.callOnce) {\n        this.unlistenByKey(listener);\n      }\n      rv = listenerFn.call(listenerHandler, eventObject) !== false && rv;\n    }\n  }\n\n  return rv && !eventObject.defaultPrevented;\n};\n\n\n/**\n * @param {string|!goog.events.EventId} type The type of the listeners to fire.\n * @param {boolean} capture The capture mode of the listeners to fire.\n * @return {!Array<!goog.events.ListenableKey>} An array of registered\n *     listeners.\n * @template EVENTOBJ\n * @override\n */\ngoog.events.EventTarget.prototype.getListeners = function(type, capture) {\n  'use strict';\n  return this.eventTargetListeners_.getListeners(String(type), capture);\n};\n\n\n/**\n * @param {string|!goog.events.EventId<EVENTOBJ>} type The name of the event\n *     without the 'on' prefix.\n * @param {function(this:SCOPE, EVENTOBJ):(boolean|undefined)} listener The\n *     listener function to get.\n * @param {boolean} capture Whether the listener is a capturing listener.\n * @param {SCOPE=} opt_listenerScope Object in whose scope to call the\n *     listener.\n * @return {?goog.events.ListenableKey} the found listener or null if not found.\n * @template SCOPE,EVENTOBJ\n * @override\n */\ngoog.events.EventTarget.prototype.getListener = function(\n    type, listener, capture, opt_listenerScope) {\n  'use strict';\n  return this.eventTargetListeners_.getListener(\n      String(type), listener, capture, opt_listenerScope);\n};\n\n\n/**\n * @param {string|!goog.events.EventId<EVENTOBJ>=} opt_type Event type.\n * @param {boolean=} opt_capture Whether to check for capture or bubble\n *     listeners.\n * @return {boolean} Whether there is any active listeners matching\n *     the requested type and/or capture phase.\n * @template EVENTOBJ\n * @override\n */\ngoog.events.EventTarget.prototype.hasListener = function(\n    opt_type, opt_capture) {\n  'use strict';\n  var id = (opt_type !== undefined) ? String(opt_type) : undefined;\n  return this.eventTargetListeners_.hasListener(id, opt_capture);\n};\n\n\n/**\n * Sets the target to be used for `event.target` when firing\n * event. Mainly used for testing. For example, see\n * `goog.testing.events.mixinListenable`.\n * @param {!Object} target The target.\n */\ngoog.events.EventTarget.prototype.setTargetForTesting = function(target) {\n  'use strict';\n  this.actualEventTarget_ = target;\n};\n\n\n/**\n * Asserts that the event target instance is initialized properly.\n * @private\n */\ngoog.events.EventTarget.prototype.assertInitialized_ = function() {\n  'use strict';\n  goog.asserts.assert(\n      this.eventTargetListeners_,\n      'Event target is not initialized. Did you call the superclass ' +\n          '(goog.events.EventTarget) constructor?');\n};\n\n\n/**\n * Dispatches the given event on the ancestorsTree.\n *\n * @param {!Object} target The target to dispatch on.\n * @param {goog.events.Event|Object|string} e The event object.\n * @param {Array<goog.events.Listenable>=} opt_ancestorsTree The ancestors\n *     tree of the target, in reverse order from the closest ancestor\n *     to the root event target. May be null if the target has no ancestor.\n * @return {boolean} If anyone called preventDefault on the event object (or\n *     if any of the listeners returns false) this will also return false.\n * @private\n */\ngoog.events.EventTarget.dispatchEventInternal_ = function(\n    target, e, opt_ancestorsTree) {\n  'use strict';\n  /** @suppress {missingProperties} */\n  var type = e.type || /** @type {string} */ (e);\n\n  // If accepting a string or object, create a custom event object so that\n  // preventDefault and stopPropagation work with the event.\n  if (typeof e === 'string') {\n    e = new goog.events.Event(e, target);\n  } else if (!(e instanceof goog.events.Event)) {\n    var oldEvent = e;\n    e = new goog.events.Event(type, target);\n    goog.object.extend(e, oldEvent);\n  } else {\n    e.target = e.target || target;\n  }\n\n  var rv = true, currentTarget;\n\n  // Executes all capture listeners on the ancestors, if any.\n  if (opt_ancestorsTree) {\n    for (var i = opt_ancestorsTree.length - 1;\n         !e.hasPropagationStopped() && i >= 0; i--) {\n      currentTarget = e.currentTarget = opt_ancestorsTree[i];\n      rv = currentTarget.fireListeners(type, true, e) && rv;\n    }\n  }\n\n  // Executes capture and bubble listeners on the target.\n  if (!e.hasPropagationStopped()) {\n    currentTarget = /** @type {?} */ (e.currentTarget = target);\n    rv = currentTarget.fireListeners(type, true, e) && rv;\n    if (!e.hasPropagationStopped()) {\n      rv = currentTarget.fireListeners(type, false, e) && rv;\n    }\n  }\n\n  // Executes all bubble listeners on the ancestors, if any.\n  if (opt_ancestorsTree) {\n    for (i = 0; !e.hasPropagationStopped() && i < opt_ancestorsTree.length;\n         i++) {\n      currentTarget = e.currentTarget = opt_ancestorsTree[i];\n      rv = currentTarget.fireListeners(type, false, e) && rv;\n    }\n  }\n\n  return rv;\n};\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview JSON utility functions.\n */\n\n\ngoog.provide('goog.json');\ngoog.provide('goog.json.Replacer');\ngoog.provide('goog.json.Reviver');\ngoog.provide('goog.json.Serializer');\n\n\n/**\n * @define {boolean} If true, use the native JSON parsing API.\n * NOTE: The default `goog.json.parse` implementation is able to handle\n * invalid JSON. JSPB used to produce invalid JSON which is not the case\n * anymore so this is safe to enable for parsing JSPB. Using native JSON is\n * faster and safer than the default implementation using `eval`.\n */\ngoog.json.USE_NATIVE_JSON = goog.define('goog.json.USE_NATIVE_JSON', false);\n\n/**\n * @define {boolean} If true, try the native JSON parsing API first. If it\n * fails, log an error and use `eval` instead. This is useful when\n * transitioning to `goog.json.USE_NATIVE_JSON`. The error logger needs to\n * be set by `goog.json.setErrorLogger`. If it is not set then the error\n * is ignored.\n */\ngoog.json.TRY_NATIVE_JSON = goog.define('goog.json.TRY_NATIVE_JSON', true);\n\n\n/**\n * Tests if a string is an invalid JSON string. This only ensures that we are\n * not using any invalid characters\n * @param {string} s The string to test.\n * @return {boolean} True if the input is a valid JSON string.\n */\ngoog.json.isValid = function(s) {\n  'use strict';\n  // All empty whitespace is not valid.\n  if (/^\\s*$/.test(s)) {\n    return false;\n  }\n\n  // This is taken from http://www.json.org/json2.js which is released to the\n  // public domain.\n  // Changes: We dissallow \\u2028 Line separator and \\u2029 Paragraph separator\n  // inside strings.  We also treat \\u2028 and \\u2029 as whitespace which they\n  // are in the RFC but IE and Safari does not match \\s to these so we need to\n  // include them in the reg exps in all places where whitespace is allowed.\n  // We allowed \\x7f inside strings because some tools don't escape it,\n  // e.g. http://www.json.org/java/org/json/JSONObject.java\n\n  // Parsing happens in three stages. In the first stage, we run the text\n  // against regular expressions that look for non-JSON patterns. We are\n  // especially concerned with '()' and 'new' because they can cause invocation,\n  // and '=' because it can cause mutation. But just to be safe, we want to\n  // reject all unexpected forms.\n\n  // We split the first stage into 4 regexp operations in order to work around\n  // crippling inefficiencies in IE's and Safari's regexp engines. First we\n  // replace all backslash pairs with '@' (a non-JSON character). Second, we\n  // replace all simple value tokens with ']' characters, but only when followed\n  // by a colon, comma, closing bracket or end of string. Third, we delete all\n  // open brackets that follow a colon or comma or that begin the text. Finally,\n  // we look to see that the remaining characters are only whitespace or ']' or\n  // ',' or ':' or '{' or '}'. If that is so, then the text is safe for eval.\n\n  // Don't make these static since they have the global flag.\n  const backslashesRe = /\\\\[\"\\\\\\/bfnrtu]/g;\n  const simpleValuesRe =\n      /(?:\"[^\"\\\\\\n\\r\\u2028\\u2029\\x00-\\x08\\x0a-\\x1f]*\"|true|false|null|-?\\d+(?:\\.\\d*)?(?:[eE][+\\-]?\\d+)?)[\\s\\u2028\\u2029]*(?=:|,|]|}|$)/g;\n  const openBracketsRe = /(?:^|:|,)(?:[\\s\\u2028\\u2029]*\\[)+/g;\n  const remainderRe = /^[\\],:{}\\s\\u2028\\u2029]*$/;\n\n  return remainderRe.test(\n      s.replace(backslashesRe, '@')\n          .replace(simpleValuesRe, ']')\n          .replace(openBracketsRe, ''));\n};\n\n/**\n * Logs a parsing error in `JSON.parse` solvable by using `eval`\n * if `goog.json.TRY_NATIVE_JSON` is enabled.\n * @private {function(string, !Error)} The first parameter is the error message,\n *     the second is the exception thrown by `JSON.parse`.\n */\ngoog.json.errorLogger_ = goog.nullFunction;\n\n\n/**\n * Sets an error logger to use if there's a recoverable parsing error and\n * `goog.json.TRY_NATIVE_JSON` is enabled.\n * @param {function(string, !Error)} errorLogger The first parameter is the\n *     error message, the second is the exception thrown by `JSON.parse`.\n */\ngoog.json.setErrorLogger = function(errorLogger) {\n  'use strict';\n  goog.json.errorLogger_ = errorLogger;\n};\n\n\n/**\n * Parses a JSON string and returns the result. This throws an exception if\n * the string is an invalid JSON string.\n *\n * Note that this is very slow on large strings. Use JSON.parse if possible.\n *\n * @param {*} s The JSON string to parse.\n * @throws Error if s is invalid JSON.\n * @return {Object} The object generated from the JSON string, or null.\n * @deprecated Use JSON.parse.\n */\ngoog.json.parse = goog.json.USE_NATIVE_JSON ?\n    /** @type {function(*):Object} */ (goog.global['JSON']['parse']) :\n    function(s) {\n      'use strict';\n      let error;\n      if (goog.json.TRY_NATIVE_JSON) {\n        try {\n          return goog.global['JSON']['parse'](s);\n        } catch (ex) {\n          error = ex;\n        }\n      }\n      const o = String(s);\n      if (goog.json.isValid(o)) {\n\n        try {\n          const result = /** @type {?Object} */ (eval('(' + o + ')'));\n          if (error) {\n            goog.json.errorLogger_('Invalid JSON: ' + o, error);\n          }\n          return result;\n        } catch (ex) {\n        }\n      }\n      throw new Error('Invalid JSON string: ' + o);\n    };\n\n\n/**\n * JSON replacer, as defined in Section 15.12.3 of the ES5 spec.\n * @see http://ecma-international.org/ecma-262/5.1/#sec-15.12.3\n *\n * TODO(nicksantos): Array should also be a valid replacer.\n *\n * @typedef {function(this:Object, string, *): *}\n */\ngoog.json.Replacer;\n\n\n/**\n * JSON reviver, as defined in Section 15.12.2 of the ES5 spec.\n * @see http://ecma-international.org/ecma-262/5.1/#sec-15.12.3\n *\n * @typedef {function(this:Object, string, *): *}\n */\ngoog.json.Reviver;\n\n\n/**\n * Serializes an object or a value to a JSON string.\n *\n * @param {*} object The object to serialize.\n * @param {?goog.json.Replacer=} opt_replacer A replacer function\n *     called for each (key, value) pair that determines how the value\n *     should be serialized. By defult, this just returns the value\n *     and allows default serialization to kick in.\n * @throws Error if there are loops in the object graph.\n * @return {string} A JSON string representation of the input.\n */\ngoog.json.serialize = goog.json.USE_NATIVE_JSON ?\n    /** @type {function(*, ?goog.json.Replacer=):string} */\n    (goog.global['JSON']['stringify']) :\n    function(object, opt_replacer) {\n      'use strict';\n      // NOTE(nicksantos): Currently, we never use JSON.stringify.\n      //\n      // The last time I evaluated this, JSON.stringify had subtle bugs and\n      // behavior differences on all browsers, and the performance win was not\n      // large enough to justify all the issues. This may change in the future\n      // as browser implementations get better.\n      //\n      // assertSerialize in json_test contains if branches for the cases\n      // that fail.\n      return new goog.json.Serializer(opt_replacer).serialize(object);\n    };\n\n\n\n/**\n * Class that is used to serialize JSON objects to a string.\n * @param {?goog.json.Replacer=} opt_replacer Replacer.\n * @constructor\n */\ngoog.json.Serializer = function(opt_replacer) {\n  'use strict';\n  /**\n   * @type {goog.json.Replacer|null|undefined}\n   * @private\n   */\n  this.replacer_ = opt_replacer;\n};\n\n\n/**\n * Serializes an object or a value to a JSON string.\n *\n * @param {*} object The object to serialize.\n * @throws Error if there are loops in the object graph.\n * @return {string} A JSON string representation of the input.\n */\ngoog.json.Serializer.prototype.serialize = function(object) {\n  'use strict';\n  const sb = [];\n  this.serializeInternal(object, sb);\n  return sb.join('');\n};\n\n\n/**\n * Serializes a generic value to a JSON string\n * @protected\n * @param {*} object The object to serialize.\n * @param {Array<string>} sb Array used as a string builder.\n * @throws Error if there are loops in the object graph.\n */\ngoog.json.Serializer.prototype.serializeInternal = function(object, sb) {\n  'use strict';\n  if (object == null) {\n    // undefined == null so this branch covers undefined as well as null\n    sb.push('null');\n    return;\n  }\n\n  if (typeof object == 'object') {\n    if (Array.isArray(object)) {\n      this.serializeArray(object, sb);\n      return;\n    } else if (\n        object instanceof String || object instanceof Number ||\n        object instanceof Boolean) {\n      object = object.valueOf();\n      // Fall through to switch below.\n    } else {\n      this.serializeObject_(/** @type {!Object} */ (object), sb);\n      return;\n    }\n  }\n\n  switch (typeof object) {\n    case 'string':\n      this.serializeString_(object, sb);\n      break;\n    case 'number':\n      this.serializeNumber_(object, sb);\n      break;\n    case 'boolean':\n      sb.push(String(object));\n      break;\n    case 'function':\n      sb.push('null');\n      break;\n    default:\n      throw new Error('Unknown type: ' + typeof object);\n  }\n};\n\n\n/**\n * Character mappings used internally for goog.string.quote\n * @private\n * @type {!Object}\n */\ngoog.json.Serializer.charToJsonCharCache_ = {\n  '\\\"': '\\\\\"',\n  '\\\\': '\\\\\\\\',\n  '/': '\\\\/',\n  '\\b': '\\\\b',\n  '\\f': '\\\\f',\n  '\\n': '\\\\n',\n  '\\r': '\\\\r',\n  '\\t': '\\\\t',\n\n  '\\x0B': '\\\\u000b'  // '\\v' is not supported in JScript\n};\n\n\n/**\n * Regular expression used to match characters that need to be replaced.\n * The S60 browser has a bug where unicode characters are not matched by\n * regular expressions. The condition below detects such behaviour and\n * adjusts the regular expression accordingly.\n * @private\n * @type {!RegExp}\n */\ngoog.json.Serializer.charsToReplace_ = /\\uffff/.test('\\uffff') ?\n    /[\\\\\\\"\\x00-\\x1f\\x7f-\\uffff]/g :\n    /[\\\\\\\"\\x00-\\x1f\\x7f-\\xff]/g;\n\n\n/**\n * Serializes a string to a JSON string\n * @private\n * @param {string} s The string to serialize.\n * @param {Array<string>} sb Array used as a string builder.\n */\ngoog.json.Serializer.prototype.serializeString_ = function(s, sb) {\n  'use strict';\n  // The official JSON implementation does not work with international\n  // characters.\n  sb.push('\"', s.replace(goog.json.Serializer.charsToReplace_, function(c) {\n    'use strict';\n    // caching the result improves performance by a factor 2-3\n    let rv = goog.json.Serializer.charToJsonCharCache_[c];\n    if (!rv) {\n      rv = '\\\\u' + (c.charCodeAt(0) | 0x10000).toString(16).substr(1);\n      goog.json.Serializer.charToJsonCharCache_[c] = rv;\n    }\n    return rv;\n  }), '\"');\n};\n\n\n/**\n * Serializes a number to a JSON string\n * @private\n * @param {number} n The number to serialize.\n * @param {Array<string>} sb Array used as a string builder.\n */\ngoog.json.Serializer.prototype.serializeNumber_ = function(n, sb) {\n  'use strict';\n  sb.push(isFinite(n) && !isNaN(n) ? String(n) : 'null');\n};\n\n\n/**\n * Serializes an array to a JSON string\n * @param {Array<string>} arr The array to serialize.\n * @param {Array<string>} sb Array used as a string builder.\n * @protected\n */\ngoog.json.Serializer.prototype.serializeArray = function(arr, sb) {\n  'use strict';\n  const l = arr.length;\n  sb.push('[');\n  let sep = '';\n  for (let i = 0; i < l; i++) {\n    sb.push(sep);\n\n    const value = arr[i];\n    this.serializeInternal(\n        this.replacer_ ? this.replacer_.call(arr, String(i), value) : value,\n        sb);\n\n    sep = ',';\n  }\n  sb.push(']');\n};\n\n\n/**\n * Serializes an object to a JSON string\n * @private\n * @param {!Object} obj The object to serialize.\n * @param {Array<string>} sb Array used as a string builder.\n */\ngoog.json.Serializer.prototype.serializeObject_ = function(obj, sb) {\n  'use strict';\n  sb.push('{');\n  let sep = '';\n  for (const key in obj) {\n    if (Object.prototype.hasOwnProperty.call(obj, key)) {\n      const value = obj[key];\n      // Skip functions.\n      if (typeof value != 'function') {\n        sb.push(sep);\n        this.serializeString_(key, sb);\n        sb.push(':');\n\n        this.serializeInternal(\n            this.replacer_ ? this.replacer_.call(obj, key, value) : value, sb);\n\n        sep = ',';\n      }\n    }\n  }\n  sb.push('}');\n};\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\ngoog.module('goog.async.WorkQueue');\ngoog.module.declareLegacyNamespace();\n\nconst FreeList = goog.require('goog.async.FreeList');\nconst {assert} = goog.require('goog.asserts');\n\n// TODO(johnlenz): generalize the WorkQueue if this is used by more\n// than goog.async.run.\n\n\n/**\n * A low GC workqueue. The key elements of this design:\n *   - avoids the need for goog.bind or equivalent by carrying scope\n *   - avoids the need for array reallocation by using a linked list\n *   - minimizes work entry objects allocation by recycling objects\n * @final\n * @struct\n */\nclass WorkQueue {\n  constructor() {\n    this.workHead_ = null;\n    this.workTail_ = null;\n  }\n\n  /**\n   * @param {function()} fn\n   * @param {Object|null|undefined} scope\n   */\n  add(fn, scope) {\n    const item = this.getUnusedItem_();\n    item.set(fn, scope);\n\n    if (this.workTail_) {\n      this.workTail_.next = item;\n      this.workTail_ = item;\n    } else {\n      assert(!this.workHead_);\n      this.workHead_ = item;\n      this.workTail_ = item;\n    }\n  }\n\n  /**\n   * @return {?WorkItem}\n   */\n  remove() {\n    let item = null;\n\n    if (this.workHead_) {\n      item = this.workHead_;\n      this.workHead_ = this.workHead_.next;\n      if (!this.workHead_) {\n        this.workTail_ = null;\n      }\n      item.next = null;\n    }\n    return item;\n  }\n\n  /**\n   * @param {!WorkItem} item\n   */\n  returnUnused(item) {\n    WorkQueue.freelist_.put(item);\n  }\n\n  /**\n   * @return {!WorkItem}\n   * @private\n   */\n  getUnusedItem_() {\n    return WorkQueue.freelist_.get();\n  }\n}\n\n/** @define {number} The maximum number of entries to keep for recycling. */\nWorkQueue.DEFAULT_MAX_UNUSED =\n    goog.define('goog.async.WorkQueue.DEFAULT_MAX_UNUSED', 100);\n\n/** @const @private {!FreeList<!WorkItem>} */\nWorkQueue.freelist_ = new FreeList(\n    () => new WorkItem(), item => item.reset(), WorkQueue.DEFAULT_MAX_UNUSED);\n\n/**\n * @final\n * @struct\n */\nclass WorkItem {\n  constructor() {\n    /** @type {?function()} */\n    this.fn = null;\n    /** @type {?Object|null|undefined} */\n    this.scope = null;\n    /** @type {?WorkItem} */\n    this.next = null;\n  }\n\n  /**\n   * @param {function()} fn\n   * @param {Object|null|undefined} scope\n   */\n  set(fn, scope) {\n    'use strict';\n    this.fn = fn;\n    this.scope = scope;\n    this.next = null;\n  }\n\n  /** Reset the work item so they don't prevent GC before reuse */\n  reset() {\n    this.fn = null;\n    this.scope = null;\n    this.next = null;\n  }\n}\n\nexports = WorkQueue;\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\ngoog.provide('goog.async.run');\n\ngoog.require('goog.async.WorkQueue');\ngoog.require('goog.async.nextTick');\ngoog.require('goog.async.throwException');\n\n/**\n * @define {boolean} If true, use the global Promise to implement goog.async.run\n * assuming either the native, or polyfill version will be used. Does still\n * permit tests to use forceNextTick.\n */\ngoog.ASSUME_NATIVE_PROMISE = goog.define('goog.ASSUME_NATIVE_PROMISE', false);\n\n/**\n * Fires the provided callback just before the current callstack unwinds, or as\n * soon as possible after the current JS execution context.\n * @param {function(this:THIS)} callback\n * @param {THIS=} opt_context Object to use as the \"this value\" when calling\n *     the provided function.\n * @template THIS\n */\ngoog.async.run = function(callback, opt_context) {\n  'use strict';\n  if (!goog.async.run.schedule_) {\n    goog.async.run.initializeRunner_();\n  }\n  if (!goog.async.run.workQueueScheduled_) {\n    // Nothing is currently scheduled, schedule it now.\n    goog.async.run.schedule_();\n    goog.async.run.workQueueScheduled_ = true;\n  }\n\n  goog.async.run.workQueue_.add(callback, opt_context);\n};\n\n\n/**\n * Initializes the function to use to process the work queue.\n * @private\n */\ngoog.async.run.initializeRunner_ = function() {\n  'use strict';\n  if (goog.ASSUME_NATIVE_PROMISE ||\n      (goog.global.Promise && goog.global.Promise.resolve)) {\n    // Use goog.global.Promise instead of just Promise because the relevant\n    // externs may be missing, and don't alias it because this could confuse the\n    // compiler into thinking the polyfill is required when it should be treated\n    // as optional.\n    var promise = goog.global.Promise.resolve(undefined);\n    goog.async.run.schedule_ = function() {\n      'use strict';\n      promise.then(goog.async.run.processWorkQueue);\n    };\n  } else {\n    goog.async.run.schedule_ = function() {\n      'use strict';\n      goog.async.nextTick(goog.async.run.processWorkQueue);\n    };\n  }\n};\n\n\n/**\n * Forces goog.async.run to use nextTick instead of Promise.\n *\n * This should only be done in unit tests. It's useful because MockClock\n * replaces nextTick, but not the browser Promise implementation, so it allows\n * Promise-based code to be tested with MockClock.\n *\n * However, we also want to run promises if the MockClock is no longer in\n * control so we schedule a backup \"setTimeout\" to the unmocked timeout if\n * provided.\n *\n * @param {function(function())=} opt_realSetTimeout\n */\ngoog.async.run.forceNextTick = function(opt_realSetTimeout) {\n  'use strict';\n  goog.async.run.schedule_ = function() {\n    'use strict';\n    goog.async.nextTick(goog.async.run.processWorkQueue);\n    if (opt_realSetTimeout) {\n      opt_realSetTimeout(goog.async.run.processWorkQueue);\n    }\n  };\n};\n\n\n/**\n * The function used to schedule work asynchronousely.\n * @private {function()}\n */\ngoog.async.run.schedule_;\n\n\n/** @private {boolean} */\ngoog.async.run.workQueueScheduled_ = false;\n\n\n/** @private {!goog.async.WorkQueue} */\ngoog.async.run.workQueue_ = new goog.async.WorkQueue();\n\n\nif (goog.DEBUG) {\n  /**\n   * Reset the work queue. Only available for tests in debug mode.\n   */\n  goog.async.run.resetQueue = function() {\n    'use strict';\n    goog.async.run.workQueueScheduled_ = false;\n    goog.async.run.workQueue_ = new goog.async.WorkQueue();\n  };\n\n\n  /**\n   * Resets the scheduler. Only available for tests in debug mode.\n   */\n  goog.async.run.resetSchedulerForTest = function() {\n    goog.async.run.initializeRunner_();\n  };\n}\n\n\n/**\n * Run any pending goog.async.run work items. This function is not intended\n * for general use, but for use by entry point handlers to run items ahead of\n * goog.async.nextTick.\n */\ngoog.async.run.processWorkQueue = function() {\n  'use strict';\n  // NOTE: additional work queue items may be added while processing.\n  var item = null;\n  while (item = goog.async.run.workQueue_.remove()) {\n    try {\n      item.fn.call(item.scope);\n    } catch (e) {\n      goog.async.throwException(e);\n    }\n    goog.async.run.workQueue_.returnUnused(item);\n  }\n\n  // There are no more work items, allow processing to be scheduled again.\n  goog.async.run.workQueueScheduled_ = false;\n};\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Simple freelist.\n *\n * An anterative to goog.structs.SimplePool, it imposes the requirement that the\n * objects in the list contain a \"next\" property that can be used to maintain\n * the pool.\n */\n\ngoog.provide('goog.async.FreeList');\n\n\n/**\n * @template ITEM\n */\ngoog.async.FreeList = class {\n  /**\n   * @param {function():ITEM} create\n   * @param {function(ITEM):void} reset\n   * @param {number} limit\n   */\n  constructor(create, reset, limit) {\n    /** @private @const {number} */\n    this.limit_ = limit;\n    /** @private @const {function()} */\n    this.create_ = create;\n    /** @private @const {function(ITEM):void} */\n    this.reset_ = reset;\n\n    /** @private {number} */\n    this.occupants_ = 0;\n    /** @private {ITEM} */\n    this.head_ = null;\n  }\n\n  /**\n   * @return {ITEM}\n   */\n  get() {\n    let item;\n    if (this.occupants_ > 0) {\n      this.occupants_--;\n      item = this.head_;\n      this.head_ = item.next;\n      item.next = null;\n    } else {\n      item = this.create_();\n    }\n    return item;\n  }\n\n  /**\n   * @param {ITEM} item An item available for possible future reuse.\n   */\n  put(item) {\n    this.reset_(item);\n    if (this.occupants_ < this.limit_) {\n      this.occupants_++;\n      item.next = this.head_;\n      this.head_ = item;\n    }\n  }\n\n  /**\n   * Visible for testing.\n   * @package\n   * @return {number}\n   */\n  occupants() {\n    return this.occupants_;\n  }\n};\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Provides a function to throw an error without interrupting\n * the current execution context.\n */\n\ngoog.module('goog.async.throwException');\ngoog.module.declareLegacyNamespace();\n\n/**\n * Throw an item without interrupting the current execution context.  For\n * example, if processing a group of items in a loop, sometimes it is useful\n * to report an error while still allowing the rest of the batch to be\n * processed.\n * @param {*} exception\n */\nfunction throwException(exception) {\n  // Each throw needs to be in its own context.\n  goog.global.setTimeout(() => {\n    throw exception;\n  }, 0);\n}\nexports = throwException;\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview A timer class to which other classes and objects can listen on.\n * This is only an abstraction above `setInterval`.\n *\n * @see ../demos/timers.html\n */\n\ngoog.provide('goog.Timer');\n\ngoog.require('goog.Promise');\ngoog.require('goog.events.EventTarget');\ngoog.requireType('goog.Thenable');\n\n\n\n/**\n * Class for handling timing events.\n *\n * @param {number=} opt_interval Number of ms between ticks (default: 1ms).\n * @param {Object=} opt_timerObject  An object that has `setTimeout`,\n *     `setInterval`, `clearTimeout` and `clearInterval`\n *     (e.g., `window`).\n * @constructor\n * @extends {goog.events.EventTarget}\n */\ngoog.Timer = function(opt_interval, opt_timerObject) {\n  'use strict';\n  goog.events.EventTarget.call(this);\n\n  /**\n   * Number of ms between ticks\n   * @private {number}\n   */\n  this.interval_ = opt_interval || 1;\n\n  /**\n   * An object that implements `setTimeout`, `setInterval`,\n   * `clearTimeout` and `clearInterval`. We default to the window\n   * object. Changing this on {@link goog.Timer.prototype} changes the object\n   * for all timer instances which can be useful if your environment has some\n   * other implementation of timers than the `window` object.\n   * @private {{setTimeout:!Function, clearTimeout:!Function}}\n   */\n  this.timerObject_ = /** @type {{setTimeout, clearTimeout}} */ (\n      opt_timerObject || goog.Timer.defaultTimerObject);\n\n  /**\n   * Cached `tick_` bound to the object for later use in the timer.\n   * @private {Function}\n   * @const\n   */\n  this.boundTick_ = goog.bind(this.tick_, this);\n\n  /**\n   * Firefox browser often fires the timer event sooner (sometimes MUCH sooner)\n   * than the requested timeout. So we compare the time to when the event was\n   * last fired, and reschedule if appropriate. See also\n   * {@link goog.Timer.intervalScale}.\n   * @private {number}\n   */\n  this.last_ = goog.now();\n};\ngoog.inherits(goog.Timer, goog.events.EventTarget);\n\n\n/**\n * Maximum timeout value.\n *\n * Timeout values too big to fit into a signed 32-bit integer may cause overflow\n * in FF, Safari, and Chrome, resulting in the timeout being scheduled\n * immediately. It makes more sense simply not to schedule these timeouts, since\n * 24.8 days is beyond a reasonable expectation for the browser to stay open.\n *\n * @private {number}\n * @const\n */\ngoog.Timer.MAX_TIMEOUT_ = 2147483647;\n\n\n/**\n * A timer ID that cannot be returned by any known implementation of\n * `window.setTimeout`. Passing this value to `window.clearTimeout`\n * should therefore be a no-op.\n *\n * @private {number}\n * @const\n */\ngoog.Timer.INVALID_TIMEOUT_ID_ = -1;\n\n\n/**\n * Whether this timer is enabled\n * @type {boolean}\n */\ngoog.Timer.prototype.enabled = false;\n\n\n/**\n * An object that implements `setTimeout`, `setInterval`,\n * `clearTimeout` and `clearInterval`. We default to the global\n * object. Changing `goog.Timer.defaultTimerObject` changes the object for\n * all timer instances which can be useful if your environment has some other\n * implementation of timers you'd like to use.\n * @type {{setTimeout, clearTimeout}}\n */\ngoog.Timer.defaultTimerObject = goog.global;\n\n\n/**\n * Variable that controls the timer error correction. If the timer is called\n * before the requested interval times `intervalScale`, which often\n * happens on Mozilla, the timer is rescheduled.\n * @see {@link #last_}\n * @type {number}\n */\ngoog.Timer.intervalScale = 0.8;\n\n\n/**\n * Variable for storing the result of `setInterval`.\n * @private {?number}\n */\ngoog.Timer.prototype.timer_ = null;\n\n\n/**\n * Gets the interval of the timer.\n * @return {number} interval Number of ms between ticks.\n */\ngoog.Timer.prototype.getInterval = function() {\n  'use strict';\n  return this.interval_;\n};\n\n\n/**\n * Sets the interval of the timer.\n * @param {number} interval Number of ms between ticks.\n */\ngoog.Timer.prototype.setInterval = function(interval) {\n  'use strict';\n  this.interval_ = interval;\n  if (this.timer_ && this.enabled) {\n    // Stop and then start the timer to reset the interval.\n    this.stop();\n    this.start();\n  } else if (this.timer_) {\n    this.stop();\n  }\n};\n\n\n/**\n * Callback for the `setTimeout` used by the timer.\n * @private\n */\ngoog.Timer.prototype.tick_ = function() {\n  'use strict';\n  if (this.enabled) {\n    var elapsed = goog.now() - this.last_;\n    if (elapsed > 0 && elapsed < this.interval_ * goog.Timer.intervalScale) {\n      this.timer_ = this.timerObject_.setTimeout(\n          this.boundTick_, this.interval_ - elapsed);\n      return;\n    }\n\n    // Prevents setInterval from registering a duplicate timeout when called\n    // in the timer event handler.\n    if (this.timer_) {\n      this.timerObject_.clearTimeout(this.timer_);\n      this.timer_ = null;\n    }\n\n    this.dispatchTick();\n    // The timer could be stopped in the timer event handler.\n    if (this.enabled) {\n      // Stop and start to ensure there is always only one timeout even if\n      // start is called in the timer event handler.\n      this.stop();\n      this.start();\n    }\n  }\n};\n\n\n/**\n * Dispatches the TICK event. This is its own method so subclasses can override.\n */\ngoog.Timer.prototype.dispatchTick = function() {\n  'use strict';\n  this.dispatchEvent(goog.Timer.TICK);\n};\n\n\n/**\n * Starts the timer.\n */\ngoog.Timer.prototype.start = function() {\n  'use strict';\n  this.enabled = true;\n\n  // If there is no interval already registered, start it now\n  if (!this.timer_) {\n    // IMPORTANT!\n    // window.setInterval in FireFox has a bug - it fires based on\n    // absolute time, rather than on relative time. What this means\n    // is that if a computer is sleeping/hibernating for 24 hours\n    // and the timer interval was configured to fire every 1000ms,\n    // then after the PC wakes up the timer will fire, in rapid\n    // succession, 3600*24 times.\n    // This bug is described here and is already fixed, but it will\n    // take time to propagate, so for now I am switching this over\n    // to setTimeout logic.\n    //     https://bugzilla.mozilla.org/show_bug.cgi?id=376643\n    //\n    this.timer_ = this.timerObject_.setTimeout(this.boundTick_, this.interval_);\n    this.last_ = goog.now();\n  }\n};\n\n\n/**\n * Stops the timer.\n */\ngoog.Timer.prototype.stop = function() {\n  'use strict';\n  this.enabled = false;\n  if (this.timer_) {\n    this.timerObject_.clearTimeout(this.timer_);\n    this.timer_ = null;\n  }\n};\n\n\n/** @override */\ngoog.Timer.prototype.disposeInternal = function() {\n  'use strict';\n  goog.Timer.superClass_.disposeInternal.call(this);\n  this.stop();\n  delete this.timerObject_;\n};\n\n\n/**\n * Constant for the timer's event type.\n * @const\n */\ngoog.Timer.TICK = 'tick';\n\n\n/**\n * Calls the given function once, after the optional pause.\n * <p>\n * The function is always called asynchronously, even if the delay is 0. This\n * is a common trick to schedule a function to run after a batch of browser\n * event processing.\n *\n * @param {function(this:SCOPE)|{handleEvent:function()}|null} listener Function\n *     or object that has a handleEvent method.\n * @param {number=} opt_delay Milliseconds to wait; default is 0.\n * @param {SCOPE=} opt_handler Object in whose scope to call the listener.\n * @return {number} A handle to the timer ID.\n * @template SCOPE\n */\ngoog.Timer.callOnce = function(listener, opt_delay, opt_handler) {\n  'use strict';\n  if (typeof listener === 'function') {\n    if (opt_handler) {\n      listener = goog.bind(listener, opt_handler);\n    }\n  } else if (listener && typeof listener.handleEvent == 'function') {\n    // using typeof to prevent strict js warning\n    listener = goog.bind(listener.handleEvent, listener);\n  } else {\n    throw new Error('Invalid listener argument');\n  }\n\n  if (Number(opt_delay) > goog.Timer.MAX_TIMEOUT_) {\n    // Timeouts greater than MAX_INT return immediately due to integer\n    // overflow in many browsers.  Since MAX_INT is 24.8 days, just don't\n    // schedule anything at all.\n    return goog.Timer.INVALID_TIMEOUT_ID_;\n  } else {\n    return goog.Timer.defaultTimerObject.setTimeout(listener, opt_delay || 0);\n  }\n};\n\n\n/**\n * Clears a timeout initiated by {@link #callOnce}.\n * @param {?number} timerId A timer ID.\n */\ngoog.Timer.clear = function(timerId) {\n  'use strict';\n  goog.Timer.defaultTimerObject.clearTimeout(timerId);\n};\n\n\n/**\n * @param {number} delay Milliseconds to wait.\n * @param {(RESULT|goog.Thenable<RESULT>|Thenable)=} opt_result The value\n *     with which the promise will be resolved.\n * @return {!goog.Promise<RESULT>} A promise that will be resolved after\n *     the specified delay, unless it is canceled first.\n * @template RESULT\n */\ngoog.Timer.promise = function(delay, opt_result) {\n  'use strict';\n  var timerKey = null;\n  return new goog\n      .Promise(function(resolve, reject) {\n        'use strict';\n        timerKey = goog.Timer.callOnce(function() {\n          'use strict';\n          resolve(opt_result);\n        }, delay);\n        if (timerKey == goog.Timer.INVALID_TIMEOUT_ID_) {\n          reject(new Error('Failed to schedule timer.'));\n        }\n      })\n      .thenCatch(function(error) {\n        'use strict';\n        // Clear the timer. The most likely reason is \"cancel\" signal.\n        goog.Timer.clear(timerKey);\n        throw error;\n      });\n};\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Definition of the goog.async.Throttle class.\n *\n * @see ../demos/timers.html\n */\n\ngoog.module('goog.async.Throttle');\ngoog.module.declareLegacyNamespace();\n\nconst Disposable = goog.require('goog.Disposable');\nconst Timer = goog.require('goog.Timer');\n\n\n/**\n * Throttle will perform an action that is passed in no more than once\n * per interval (specified in milliseconds). If it gets multiple signals\n * to perform the action while it is waiting, it will only perform the action\n * once at the end of the interval.\n * @final\n * @template T\n */\nclass Throttle extends Disposable {\n  /**\n   * @param {function(this: T, ...?)} listener Function to callback when the\n   *     action is triggered.\n   * @param {number} interval Interval over which to throttle. The listener can\n   *     only be called once per interval.\n   * @param {T=} handler Object in whose scope to call the listener.\n   */\n  constructor(listener, interval, handler) {\n    super();\n    /**\n     * Function to callback\n     * @type {function(this: T, ...?)}\n     * @private\n     */\n    this.listener_ = handler != null ? listener.bind(handler) : listener;\n\n    /**\n     * Interval for the throttle time\n     * @type {number}\n     * @private\n     */\n    this.interval_ = interval;\n\n    /**\n     * The last arguments passed into `fire`, or null if there is no pending\n     * call.\n     * @private {?IArrayLike}\n     */\n    this.args_ = null;\n\n    /**\n     * Indicates that the action is pending and needs to be fired.\n     * @type {boolean}\n     * @private\n     */\n    this.shouldFire_ = false;\n\n    /**\n     * Indicates the count of nested pauses currently in effect on the throttle.\n     * When this count is not zero, fired actions will be postponed until the\n     * throttle is resumed enough times to drop the pause count to zero.\n     * @type {number}\n     * @private\n     */\n    this.pauseCount_ = 0;\n\n    /**\n     * Timer for scheduling the next callback\n     * @type {?number}\n     * @private\n     */\n    this.timer_ = null;\n  }\n\n  /**\n   * Notifies the throttle that the action has happened. It will throttle\n   * the call so that the callback is not called too often according to the\n   * interval parameter passed to the constructor, passing the arguments\n   * from the last call of this function into the throttled function.\n   * @param {...?} var_args Arguments to pass on to the throttled function.\n   */\n  fire(var_args) {\n    this.args_ = arguments;\n    if (!this.timer_ && !this.pauseCount_) {\n      this.doAction_();\n    } else {\n      this.shouldFire_ = true;\n    }\n  }\n\n  /**\n   * Cancels any pending action callback. The throttle can be restarted by\n   * calling {@link #fire}.\n   */\n  stop() {\n    if (this.timer_) {\n      Timer.clear(this.timer_);\n      this.timer_ = null;\n      this.shouldFire_ = false;\n      this.args_ = null;\n    }\n  }\n\n  /**\n   * Pauses the throttle.  All pending and future action callbacks will be\n   * delayed until the throttle is resumed.  Pauses can be nested.\n   */\n  pause() {\n    this.pauseCount_++;\n  }\n\n  /**\n   * Resumes the throttle.  If doing so drops the pausing count to zero,\n   * pending action callbacks will be executed as soon as possible, but\n   * still no sooner than an interval's delay after the previous call.\n   * Future action callbacks will be executed as normal.\n   */\n  resume() {\n    this.pauseCount_--;\n    if (!this.pauseCount_ && this.shouldFire_ && !this.timer_) {\n      this.shouldFire_ = false;\n      this.doAction_();\n    }\n  }\n\n  /** @override */\n  disposeInternal() {\n    super.disposeInternal();\n    this.stop();\n  }\n\n  /**\n   * Handler for the timer to fire the throttle\n   * @private\n   */\n  onTimer_() {\n    this.timer_ = null;\n\n    if (this.shouldFire_ && !this.pauseCount_) {\n      this.shouldFire_ = false;\n      this.doAction_();\n    }\n  }\n\n  /**\n   * Calls the callback\n   * @private\n   */\n  doAction_() {\n    this.timer_ = Timer.callOnce(() => this.onTimer_(), this.interval_);\n    const args = this.args_;\n    // release memory first so it always happens even if listener throws\n    this.args_ = null;\n    this.listener_.apply(null, args);\n  }\n}\n\nexports = Throttle;\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Class to create objects which want to handle multiple events\n * and have their listeners easily cleaned up via a dispose method.\n *\n * Example:\n * <pre>\n * function Something() {\n *   Something.base(this);\n *\n *   ... set up object ...\n *\n *   // Add event listeners\n *   this.listen(this.starEl, goog.events.EventType.CLICK, this.handleStar);\n *   this.listen(this.headerEl, goog.events.EventType.CLICK, this.expand);\n *   this.listen(this.collapseEl, goog.events.EventType.CLICK, this.collapse);\n *   this.listen(this.infoEl, goog.events.EventType.MOUSEOVER, this.showHover);\n *   this.listen(this.infoEl, goog.events.EventType.MOUSEOUT, this.hideHover);\n * }\n * goog.inherits(Something, goog.events.EventHandler);\n *\n * Something.prototype.disposeInternal = function() {\n *   Something.base(this, 'disposeInternal');\n *   goog.dom.removeNode(this.container);\n * };\n *\n *\n * // Then elsewhere:\n *\n * var activeSomething = null;\n * function openSomething() {\n *   activeSomething = new Something();\n * }\n *\n * function closeSomething() {\n *   if (activeSomething) {\n *     activeSomething.dispose();  // Remove event listeners\n *     activeSomething = null;\n *   }\n * }\n * </pre>\n */\n\ngoog.provide('goog.events.EventHandler');\n\ngoog.require('goog.Disposable');\ngoog.require('goog.events');\ngoog.require('goog.object');\ngoog.requireType('goog.events.Event');\ngoog.requireType('goog.events.EventId');\ngoog.requireType('goog.events.EventTarget');\ngoog.requireType('goog.events.EventWrapper');\n\n\n\n/**\n * Super class for objects that want to easily manage a number of event\n * listeners.  It allows a short cut to listen and also provides a quick way\n * to remove all events listeners belonging to this object.\n * @param {SCOPE=} opt_scope Object in whose scope to call the listeners.\n * @constructor\n * @extends {goog.Disposable}\n * @template SCOPE\n */\ngoog.events.EventHandler = function(opt_scope) {\n  'use strict';\n  goog.Disposable.call(this);\n  // TODO(mknichel): Rename this to this.scope_ and fix the classes in google3\n  // that access this private variable. :(\n  this.handler_ = opt_scope;\n\n  /**\n   * Keys for events that are being listened to.\n   * @type {!Object<!goog.events.Key>}\n   * @private\n   */\n  this.keys_ = {};\n};\ngoog.inherits(goog.events.EventHandler, goog.Disposable);\n\n\n/**\n * Utility array used to unify the cases of listening for an array of types\n * and listening for a single event, without using recursion or allocating\n * an array each time.\n * @type {!Array<string>}\n * @const\n * @private\n */\ngoog.events.EventHandler.typeArray_ = [];\n\n\n/**\n * Listen to an event on a Listenable.  If the function is omitted then the\n * EventHandler's handleEvent method will be used.\n * @param {goog.events.ListenableType} src Event source.\n * @param {string|Array<string>|\n *     !goog.events.EventId<EVENTOBJ>|!Array<!goog.events.EventId<EVENTOBJ>>}\n *     type Event type to listen for or array of event types.\n * @param {function(this:SCOPE, EVENTOBJ):?|{handleEvent:function(?):?}|null=}\n *     opt_fn Optional callback function to be used as the listener or an object\n *     with handleEvent function.\n * @param {(boolean|!AddEventListenerOptions)=} opt_options\n * @return {THIS} This object, allowing for chaining of calls.\n * @this {THIS}\n * @template EVENTOBJ, THIS\n */\ngoog.events.EventHandler.prototype.listen = function(\n    src, type, opt_fn, opt_options) {\n  'use strict';\n  var self = /** @type {!goog.events.EventHandler} */ (this);\n  return self.listen_(src, type, opt_fn, opt_options);\n};\n\n\n/**\n * Listen to an event on a Listenable.  If the function is omitted then the\n * EventHandler's handleEvent method will be used.\n * @param {goog.events.ListenableType} src Event source.\n * @param {string|Array<string>|\n *     !goog.events.EventId<EVENTOBJ>|!Array<!goog.events.EventId<EVENTOBJ>>}\n *     type Event type to listen for or array of event types.\n * @param {function(this:T, EVENTOBJ):?|{handleEvent:function(this:T, ?):?}|\n *     null|undefined} fn Optional callback function to be used as the\n *     listener or an object with handleEvent function.\n * @param {boolean|!AddEventListenerOptions|undefined} options\n * @param {T} scope Object in whose scope to call the listener.\n * @return {THIS} This object, allowing for chaining of calls.\n * @this {THIS}\n * @template T, EVENTOBJ, THIS\n */\ngoog.events.EventHandler.prototype.listenWithScope = function(\n    src, type, fn, options, scope) {\n  'use strict';\n  var self = /** @type {!goog.events.EventHandler} */ (this);\n  // TODO(mknichel): Deprecate this function.\n  return self.listen_(src, type, fn, options, scope);\n};\n\n\n/**\n * Listen to an event on a Listenable.  If the function is omitted then the\n * EventHandler's handleEvent method will be used.\n * @param {goog.events.ListenableType} src Event source.\n * @param {string|Array<string>|\n *     !goog.events.EventId<EVENTOBJ>|!Array<!goog.events.EventId<EVENTOBJ>>}\n *     type Event type to listen for or array of event types.\n * @param {function(EVENTOBJ):?|{handleEvent:function(?):?}|null=} opt_fn\n *     Optional callback function to be used as the listener or an object with\n *     handleEvent function.\n * @param {(boolean|!AddEventListenerOptions)=} opt_options\n * @param {Object=} opt_scope Object in whose scope to call the listener.\n * @return {THIS} This object, allowing for chaining of calls.\n * @this {THIS}\n * @template EVENTOBJ, THIS\n * @private\n */\ngoog.events.EventHandler.prototype.listen_ = function(\n    src, type, opt_fn, opt_options, opt_scope) {\n  'use strict';\n  var self = /** @type {!goog.events.EventHandler} */ (this);\n  if (!Array.isArray(type)) {\n    if (type) {\n      goog.events.EventHandler.typeArray_[0] = type.toString();\n    }\n    type = goog.events.EventHandler.typeArray_;\n  }\n  for (var i = 0; i < type.length; i++) {\n    var listenerObj = goog.events.listen(\n        src, type[i], opt_fn || self.handleEvent, opt_options || false,\n        opt_scope || self.handler_ || self);\n\n    if (!listenerObj) {\n      // When goog.events.listen run on OFF_AND_FAIL or OFF_AND_SILENT\n      // (goog.events.CaptureSimulationMode) in IE8-, it will return null\n      // value.\n      return self;\n    }\n\n    var key = listenerObj.key;\n    self.keys_[key] = listenerObj;\n  }\n\n  return self;\n};\n\n\n/**\n * Listen to an event on a Listenable.  If the function is omitted, then the\n * EventHandler's handleEvent method will be used. After the event has fired the\n * event listener is removed from the target. If an array of event types is\n * provided, each event type will be listened to once.\n * @param {goog.events.ListenableType} src Event source.\n * @param {string|Array<string>|\n *     !goog.events.EventId<EVENTOBJ>|!Array<!goog.events.EventId<EVENTOBJ>>}\n *     type Event type to listen for or array of event types.\n * @param {function(this:SCOPE, EVENTOBJ):?|{handleEvent:function(?):?}|null=}\n * opt_fn\n *    Optional callback function to be used as the listener or an object with\n *    handleEvent function.\n * @param {(boolean|!AddEventListenerOptions)=} opt_options\n * @return {THIS} This object, allowing for chaining of calls.\n * @this {THIS}\n * @template EVENTOBJ, THIS\n */\ngoog.events.EventHandler.prototype.listenOnce = function(\n    src, type, opt_fn, opt_options) {\n  'use strict';\n  var self = /** @type {!goog.events.EventHandler} */ (this);\n  return self.listenOnce_(src, type, opt_fn, opt_options);\n};\n\n\n/**\n * Listen to an event on a Listenable.  If the function is omitted, then the\n * EventHandler's handleEvent method will be used. After the event has fired the\n * event listener is removed from the target. If an array of event types is\n * provided, each event type will be listened to once.\n * @param {goog.events.ListenableType} src Event source.\n * @param {string|Array<string>|\n *     !goog.events.EventId<EVENTOBJ>|!Array<!goog.events.EventId<EVENTOBJ>>}\n *     type Event type to listen for or array of event types.\n * @param {function(this:T, EVENTOBJ):?|{handleEvent:function(this:T, ?):?}|\n *     null|undefined} fn Optional callback function to be used as the\n *     listener or an object with handleEvent function.\n * @param {boolean|undefined} capture Optional whether to use capture phase.\n * @param {T} scope Object in whose scope to call the listener.\n * @return {THIS} This object, allowing for chaining of calls.\n * @this {THIS}\n * @template T, EVENTOBJ, THIS\n */\ngoog.events.EventHandler.prototype.listenOnceWithScope = function(\n    src, type, fn, capture, scope) {\n  'use strict';\n  var self = /** @type {!goog.events.EventHandler} */ (this);\n  // TODO(mknichel): Deprecate this function.\n  return self.listenOnce_(src, type, fn, capture, scope);\n};\n\n\n/**\n * Listen to an event on a Listenable.  If the function is omitted, then the\n * EventHandler's handleEvent method will be used. After the event has fired\n * the event listener is removed from the target. If an array of event types is\n * provided, each event type will be listened to once.\n * @param {goog.events.ListenableType} src Event source.\n * @param {string|Array<string>|\n *     !goog.events.EventId<EVENTOBJ>|!Array<!goog.events.EventId<EVENTOBJ>>}\n *     type Event type to listen for or array of event types.\n * @param {function(EVENTOBJ):?|{handleEvent:function(?):?}|null=} opt_fn\n *    Optional callback function to be used as the listener or an object with\n *    handleEvent function.\n * @param {(boolean|!AddEventListenerOptions)=} opt_options\n * @param {Object=} opt_scope Object in whose scope to call the listener.\n * @return {THIS} This object, allowing for chaining of calls.\n * @this {THIS}\n * @template EVENTOBJ, THIS\n * @private\n */\ngoog.events.EventHandler.prototype.listenOnce_ = function(\n    src, type, opt_fn, opt_options, opt_scope) {\n  'use strict';\n  var self = /** @type {!goog.events.EventHandler} */ (this);\n  if (Array.isArray(type)) {\n    for (var i = 0; i < type.length; i++) {\n      self.listenOnce_(src, type[i], opt_fn, opt_options, opt_scope);\n    }\n  } else {\n    var listenerObj = goog.events.listenOnce(\n        src, type, opt_fn || self.handleEvent, opt_options,\n        opt_scope || self.handler_ || self);\n    if (!listenerObj) {\n      // When goog.events.listen run on OFF_AND_FAIL or OFF_AND_SILENT\n      // (goog.events.CaptureSimulationMode) in IE8-, it will return null\n      // value.\n      return self;\n    }\n\n    var key = listenerObj.key;\n    self.keys_[key] = listenerObj;\n  }\n\n  return self;\n};\n\n\n/**\n * Adds an event listener with a specific event wrapper on a DOM Node or an\n * object that has implemented {@link goog.events.EventTarget}. A listener can\n * only be added once to an object.\n *\n * @param {EventTarget|goog.events.EventTarget} src The node to listen to\n *     events on.\n * @param {goog.events.EventWrapper} wrapper Event wrapper to use.\n * @param {function(this:SCOPE, ?):?|{handleEvent:function(?):?}|null} listener\n *     Callback method, or an object with a handleEvent function.\n * @param {boolean=} opt_capt Whether to fire in capture phase (defaults to\n *     false).\n * @return {THIS} This object, allowing for chaining of calls.\n * @this {THIS}\n * @template THIS\n */\ngoog.events.EventHandler.prototype.listenWithWrapper = function(\n    src, wrapper, listener, opt_capt) {\n  'use strict';\n  var self = /** @type {!goog.events.EventHandler} */ (this);\n  // TODO(mknichel): Remove the opt_scope from this function and then\n  // templatize it.\n  return self.listenWithWrapper_(src, wrapper, listener, opt_capt);\n};\n\n\n/**\n * Adds an event listener with a specific event wrapper on a DOM Node or an\n * object that has implemented {@link goog.events.EventTarget}. A listener can\n * only be added once to an object.\n *\n * @param {EventTarget|goog.events.EventTarget} src The node to listen to\n *     events on.\n * @param {goog.events.EventWrapper} wrapper Event wrapper to use.\n * @param {function(this:T, ?):?|{handleEvent:function(this:T, ?):?}|null}\n *     listener Optional callback function to be used as the\n *     listener or an object with handleEvent function.\n * @param {boolean|undefined} capture Optional whether to use capture phase.\n * @param {T} scope Object in whose scope to call the listener.\n * @return {THIS} This object, allowing for chaining of calls.\n * @this {THIS}\n * @template T, THIS\n */\ngoog.events.EventHandler.prototype.listenWithWrapperAndScope = function(\n    src, wrapper, listener, capture, scope) {\n  'use strict';\n  var self = /** @type {!goog.events.EventHandler} */ (this);\n  // TODO(mknichel): Deprecate this function.\n  return self.listenWithWrapper_(src, wrapper, listener, capture, scope);\n};\n\n\n/**\n * Adds an event listener with a specific event wrapper on a DOM Node or an\n * object that has implemented {@link goog.events.EventTarget}. A listener can\n * only be added once to an object.\n *\n * @param {EventTarget|goog.events.EventTarget} src The node to listen to\n *     events on.\n * @param {goog.events.EventWrapper} wrapper Event wrapper to use.\n * @param {function(?):?|{handleEvent:function(?):?}|null} listener Callback\n *     method, or an object with a handleEvent function.\n * @param {boolean=} opt_capt Whether to fire in capture phase (defaults to\n *     false).\n * @param {Object=} opt_scope Element in whose scope to call the listener.\n * @return {THIS} This object, allowing for chaining of calls.\n * @this {THIS}\n * @template THIS\n * @private\n */\ngoog.events.EventHandler.prototype.listenWithWrapper_ = function(\n    src, wrapper, listener, opt_capt, opt_scope) {\n  'use strict';\n  var self = /** @type {!goog.events.EventHandler} */ (this);\n  wrapper.listen(\n      src, listener, opt_capt, opt_scope || self.handler_ || self, self);\n  return self;\n};\n\n\n/**\n * @return {number} Number of listeners registered by this handler.\n */\ngoog.events.EventHandler.prototype.getListenerCount = function() {\n  'use strict';\n  var count = 0;\n  for (var key in this.keys_) {\n    if (Object.prototype.hasOwnProperty.call(this.keys_, key)) {\n      count++;\n    }\n  }\n  return count;\n};\n\n\n/**\n * Unlistens on an event.\n * @param {goog.events.ListenableType} src Event source.\n * @param {string|Array<string>|\n *     !goog.events.EventId<EVENTOBJ>|!Array<!goog.events.EventId<EVENTOBJ>>}\n *     type Event type or array of event types to unlisten to.\n * @param {function(this:?, EVENTOBJ):?|{handleEvent:function(?):?}|null=}\n *     opt_fn Optional callback function to be used as the listener or an object\n *     with handleEvent function.\n * @param {(boolean|!EventListenerOptions)=} opt_options\n * @param {Object=} opt_scope Object in whose scope to call the listener.\n * @return {THIS} This object, allowing for chaining of calls.\n * @this {THIS}\n * @template EVENTOBJ, THIS\n */\ngoog.events.EventHandler.prototype.unlisten = function(\n    src, type, opt_fn, opt_options, opt_scope) {\n  'use strict';\n  var self = /** @type {!goog.events.EventHandler} */ (this);\n  if (Array.isArray(type)) {\n    for (var i = 0; i < type.length; i++) {\n      self.unlisten(src, type[i], opt_fn, opt_options, opt_scope);\n    }\n  } else {\n    var capture =\n        goog.isObject(opt_options) ? !!opt_options.capture : !!opt_options;\n    var listener = goog.events.getListener(\n        src, type, opt_fn || self.handleEvent, capture,\n        opt_scope || self.handler_ || self);\n\n    if (listener) {\n      goog.events.unlistenByKey(listener);\n      delete self.keys_[listener.key];\n    }\n  }\n\n  return self;\n};\n\n\n/**\n * Removes an event listener which was added with listenWithWrapper().\n *\n * @param {EventTarget|goog.events.EventTarget} src The target to stop\n *     listening to events on.\n * @param {goog.events.EventWrapper} wrapper Event wrapper to use.\n * @param {function(?):?|{handleEvent:function(?):?}|null} listener The\n *     listener function to remove.\n * @param {boolean=} opt_capt In DOM-compliant browsers, this determines\n *     whether the listener is fired during the capture or bubble phase of the\n *     event.\n * @param {Object=} opt_scope Element in whose scope to call the listener.\n * @return {THIS} This object, allowing for chaining of calls.\n * @this {THIS}\n * @template THIS\n */\ngoog.events.EventHandler.prototype.unlistenWithWrapper = function(\n    src, wrapper, listener, opt_capt, opt_scope) {\n  'use strict';\n  var self = /** @type {!goog.events.EventHandler} */ (this);\n  wrapper.unlisten(\n      src, listener, opt_capt, opt_scope || self.handler_ || self, self);\n  return self;\n};\n\n\n/**\n * Unlistens to all events.\n */\ngoog.events.EventHandler.prototype.removeAll = function() {\n  'use strict';\n  goog.object.forEach(this.keys_, function(listenerObj, key) {\n    'use strict';\n    if (this.keys_.hasOwnProperty(key)) {\n      goog.events.unlistenByKey(listenerObj);\n    }\n  }, this);\n\n  this.keys_ = {};\n};\n\n\n/**\n * Disposes of this EventHandler and removes all listeners that it registered.\n * @override\n * @protected\n */\ngoog.events.EventHandler.prototype.disposeInternal = function() {\n  'use strict';\n  goog.events.EventHandler.superClass_.disposeInternal.call(this);\n  this.removeAll();\n};\n\n\n/**\n * Default event handler\n * @param {goog.events.Event} e Event object.\n */\ngoog.events.EventHandler.prototype.handleEvent = function(e) {\n  'use strict';\n  throw new Error('EventHandler.handleEvent not implemented');\n};\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Provides a utility for tracing and debugging WebChannel\n *     requests.\n *\n */\n\n\ngoog.provide('goog.labs.net.webChannel.WebChannelDebug');\n\ngoog.require('goog.json');\ngoog.require('goog.log');\ngoog.requireType('goog.Uri');\ngoog.requireType('goog.net.XmlHttp.ReadyState');\n\n\n\n/**\n * Logs and keeps a buffer of debugging info for the Channel.\n *\n * @constructor\n * @struct\n * @final\n */\ngoog.labs.net.webChannel.WebChannelDebug = function() {\n  'use strict';\n  /**\n   * The logger instance.\n   * @const\n   * @private {?goog.log.Logger}\n   */\n  this.logger_ = goog.log.getLogger('goog.labs.net.webChannel.WebChannelDebug');\n\n  /**\n   * Whether to enable redact. Defaults to true.\n   * @private {boolean}\n   */\n  this.redactEnabled_ = true;\n};\n\n\ngoog.scope(function() {\n'use strict';\nvar WebChannelDebug = goog.labs.net.webChannel.WebChannelDebug;\n\n\n/**\n * Turns off redact.\n */\nWebChannelDebug.prototype.disableRedact = function() {\n  'use strict';\n  this.redactEnabled_ = false;\n};\n\n\n/**\n * Logs that the browser went offline during the lifetime of a request.\n * @param {goog.Uri} url The URL being requested.\n */\nWebChannelDebug.prototype.browserOfflineResponse = function(url) {\n  'use strict';\n  this.info(function() {\n    'use strict';\n    return 'BROWSER_OFFLINE: ' + url;\n  });\n};\n\n\n/**\n * Logs an XmlHttp request..\n * @param {string} verb The request type (GET/POST).\n * @param {goog.Uri} uri The request destination.\n * @param {string|number|undefined} id The request id.\n * @param {number} attempt Which attempt # the request was.\n * @param {?string} postData The data posted in the request.\n */\nWebChannelDebug.prototype.xmlHttpChannelRequest = function(\n    verb, uri, id, attempt, postData) {\n  'use strict';\n  var self = this;\n  this.info(function() {\n    'use strict';\n    return 'XMLHTTP REQ (' + id + ') [attempt ' + attempt + ']: ' + verb +\n        '\\n' + uri + '\\n' + self.maybeRedactPostData_(postData);\n  });\n};\n\n\n/**\n * Logs the meta data received from an XmlHttp request.\n * @param {string} verb The request type (GET/POST).\n * @param {goog.Uri} uri The request destination.\n * @param {string|number|undefined} id The request id.\n * @param {number} attempt Which attempt # the request was.\n * @param {goog.net.XmlHttp.ReadyState} readyState The ready state.\n * @param {number} statusCode The HTTP status code.\n */\nWebChannelDebug.prototype.xmlHttpChannelResponseMetaData = function(\n    verb, uri, id, attempt, readyState, statusCode) {\n  'use strict';\n  this.info(function() {\n    'use strict';\n    return 'XMLHTTP RESP (' + id + ') [ attempt ' + attempt + ']: ' + verb +\n        '\\n' + uri + '\\n' + readyState + ' ' + statusCode;\n  });\n};\n\n\n/**\n * Logs the response data received from an XmlHttp request.\n * @param {string|number|undefined} id The request id.\n * @param {?string} responseText The response text.\n * @param {?string=} opt_desc Optional request description.\n */\nWebChannelDebug.prototype.xmlHttpChannelResponseText = function(\n    id, responseText, opt_desc) {\n  'use strict';\n  var self = this;\n  this.info(function() {\n    'use strict';\n    return 'XMLHTTP TEXT (' + id + '): ' + self.redactResponse_(responseText) +\n        (opt_desc ? ' ' + opt_desc : '');\n  });\n};\n\n\n/**\n * Logs a request timeout.\n * @param {goog.Uri} uri The uri that timed out.\n */\nWebChannelDebug.prototype.timeoutResponse = function(uri) {\n  'use strict';\n  this.info(function() {\n    'use strict';\n    return 'TIMEOUT: ' + uri;\n  });\n};\n\n\n/**\n * Logs a debug message.\n * @param {!goog.log.Loggable} text The message.\n */\nWebChannelDebug.prototype.debug = function(text) {\n  'use strict';\n  goog.log.fine(this.logger_, text);\n};\n\n\n/**\n * Logs an exception\n * @param {Error} e The error or error event.\n * @param {goog.log.Loggable=} opt_msg The optional message,\n *     defaults to 'Exception'.\n */\nWebChannelDebug.prototype.dumpException = function(e, opt_msg) {\n  'use strict';\n  goog.log.error(this.logger_, opt_msg || 'Exception', e);\n};\n\n\n/**\n * Logs an info message.\n * @param {!goog.log.Loggable} text The message.\n */\nWebChannelDebug.prototype.info = function(text) {\n  'use strict';\n  goog.log.info(this.logger_, text);\n};\n\n\n/**\n * Logs a warning message.\n * @param {!goog.log.Loggable} text The message.\n */\nWebChannelDebug.prototype.warning = function(text) {\n  'use strict';\n  goog.log.warning(this.logger_, text);\n};\n\n\n/**\n * Logs a severe message.\n * @param {!goog.log.Loggable} text The message.\n */\nWebChannelDebug.prototype.severe = function(text) {\n  'use strict';\n  goog.log.error(this.logger_, text);\n};\n\n\n/**\n * Removes potentially private data from a response so that we don't\n * accidentally save private and personal data to the server logs.\n * @param {?string} responseText A JSON response to clean.\n * @return {?string} The cleaned response.\n * @private\n */\nWebChannelDebug.prototype.redactResponse_ = function(responseText) {\n  'use strict';\n  if (!this.redactEnabled_) {\n    return responseText;\n  }\n\n  if (!responseText) {\n    return null;\n  }\n\n  try {\n    var responseArray = JSON.parse(responseText);\n    if (responseArray) {\n      for (var i = 0; i < responseArray.length; i++) {\n        if (Array.isArray(responseArray[i])) {\n          this.maybeRedactArray_(responseArray[i]);\n        }\n      }\n    }\n\n    return goog.json.serialize(responseArray);\n  } catch (e) {\n    this.debug('Exception parsing expected JS array - probably was not JS');\n    return responseText;\n  }\n};\n\n\n/**\n * Removes data from a response array that may be sensitive.\n * @param {!Array<?>} array The array to clean.\n * @private\n */\nWebChannelDebug.prototype.maybeRedactArray_ = function(array) {\n  'use strict';\n  if (array.length < 2) {\n    return;\n  }\n  var dataPart = array[1];\n  if (!Array.isArray(dataPart)) {\n    return;\n  }\n  if (dataPart.length < 1) {\n    return;\n  }\n\n  var type = dataPart[0];\n  if (type != 'noop' && type != 'stop' && type != 'close') {\n    // redact all fields in the array\n    for (var i = 1; i < dataPart.length; i++) {\n      dataPart[i] = '';\n    }\n  }\n};\n\n\n/**\n * Removes potentially private data from a request POST body so that we don't\n * accidentally save private and personal data to the server logs.\n * @param {?string} data The data string to clean.\n * @return {?string} The data string with sensitive data replaced by 'redacted'.\n * @private\n */\nWebChannelDebug.prototype.maybeRedactPostData_ = function(data) {\n  'use strict';\n  if (!this.redactEnabled_) {\n    return data;\n  }\n\n  if (!data) {\n    return null;\n  }\n  var out = '';\n  var params = data.split('&');\n  for (var i = 0; i < params.length; i++) {\n    var param = params[i];\n    var keyValue = param.split('=');\n    if (keyValue.length > 1) {\n      var key = keyValue[0];\n      var value = keyValue[1];\n\n      var keyParts = key.split('_');\n      if (keyParts.length >= 2 && keyParts[1] == 'type') {\n        out += key + '=' + value + '&';\n      } else {\n        out += key + '=' +\n            'redacted' +\n            '&';\n      }\n    }\n  }\n  return out;\n};\n});  // goog.scope\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Static utilities for collecting stats associated with\n * ChannelRequest.\n *\n */\n\n\ngoog.provide('goog.labs.net.webChannel.requestStats');\ngoog.provide('goog.labs.net.webChannel.requestStats.Event');\ngoog.provide('goog.labs.net.webChannel.requestStats.ServerReachability');\ngoog.provide('goog.labs.net.webChannel.requestStats.ServerReachabilityEvent');\ngoog.provide('goog.labs.net.webChannel.requestStats.Stat');\ngoog.provide('goog.labs.net.webChannel.requestStats.StatEvent');\ngoog.provide('goog.labs.net.webChannel.requestStats.TimingEvent');\n\ngoog.require('goog.events.Event');\ngoog.require('goog.events.EventTarget');\n\n\ngoog.scope(function() {\n'use strict';\nconst requestStats = goog.labs.net.webChannel.requestStats;\n\n\n/**\n * Events fired.\n * @const\n */\nrequestStats.Event = {};\n\n\n/**\n * Singleton event target for firing stat events\n * @type {?goog.events.EventTarget}\n * @private\n */\nrequestStats.eventTarget_ = null;\n\n/**\n * Singleton event target for firing stat events\n * @return {!goog.events.EventTarget}\n * @private\n */\nrequestStats.getStatEventTarget_ = function() {\n  'use strict';\n  requestStats.eventTarget_ =\n      requestStats.eventTarget_ || new goog.events.EventTarget();\n  return requestStats.eventTarget_;\n};\n\n/**\n * The type of event that occurs every time some information about how reachable\n * the server is is discovered.\n */\nrequestStats.Event.SERVER_REACHABILITY_EVENT = 'serverreachability';\n\n\n/**\n * Types of events which reveal information about the reachability of the\n * server.\n * @enum {number}\n */\nrequestStats.ServerReachability = {\n  REQUEST_MADE: 1,\n  REQUEST_SUCCEEDED: 2,\n  REQUEST_FAILED: 3,\n  BACK_CHANNEL_ACTIVITY: 4  // any response data received\n};\n\n\n\n/**\n * Event class for SERVER_REACHABILITY_EVENT.\n *\n * @param {goog.events.EventTarget} target The stat event target for\n       the channel.\n * @param {requestStats.ServerReachability} reachabilityType\n *     The reachability event type.\n * @constructor\n * @extends {goog.events.Event}\n */\nrequestStats.ServerReachabilityEvent = function(target, reachabilityType) {\n  'use strict';\n  goog.events.Event.call(\n      this, requestStats.Event.SERVER_REACHABILITY_EVENT, target);\n\n  /**\n   * @type {requestStats.ServerReachability}\n   */\n  this.reachabilityType = reachabilityType;\n};\ngoog.inherits(requestStats.ServerReachabilityEvent, goog.events.Event);\n\n\n/**\n * Notify the channel that a particular fine grained network event has occurred.\n * Should be considered package-private.\n * @param {requestStats.ServerReachability} reachabilityType\n *     The reachability event type.\n */\nrequestStats.notifyServerReachabilityEvent = function(reachabilityType) {\n  'use strict';\n  const target = requestStats.getStatEventTarget_();\n  target.dispatchEvent(\n      new requestStats.ServerReachabilityEvent(target, reachabilityType));\n};\n\n\n/**\n * Stat Event that fires when things of interest happen that may be useful for\n * applications to know about for stats or debugging purposes.\n */\nrequestStats.Event.STAT_EVENT = 'statevent';\n\n\n/**\n * Enum that identifies events for statistics that are interesting to track.\n * @enum {number}\n */\nrequestStats.Stat = {\n  /** Event indicating a new connection attempt. */\n  CONNECT_ATTEMPT: 0,\n\n  /** Event indicating a connection error due to a general network problem. */\n  ERROR_NETWORK: 1,\n\n  /**\n   * Event indicating a connection error that isn't due to a general network\n   * problem.\n   */\n  ERROR_OTHER: 2,\n\n  /** Event indicating the start of test stage one. */\n  TEST_STAGE_ONE_START: 3,\n\n  /** Event indicating the start of test stage two. */\n  TEST_STAGE_TWO_START: 4,\n\n  /** Event indicating the first piece of test data was received. */\n  TEST_STAGE_TWO_DATA_ONE: 5,\n\n  /**\n   * Event indicating that the second piece of test data was received and it was\n   * received separately from the first.\n   */\n  TEST_STAGE_TWO_DATA_TWO: 6,\n\n  /** Event indicating both pieces of test data were received simultaneously. */\n  TEST_STAGE_TWO_DATA_BOTH: 7,\n\n  /** Event indicating stage one of the test request failed. */\n  TEST_STAGE_ONE_FAILED: 8,\n\n  /** Event indicating stage two of the test request failed. */\n  TEST_STAGE_TWO_FAILED: 9,\n\n  /**\n   * Event indicating that a buffering proxy is likely between the client and\n   * the server.\n   */\n  PROXY: 10,\n\n  /**\n   * Event indicating that no buffering proxy is likely between the client and\n   * the server.\n   */\n  NOPROXY: 11,\n\n  /** Event indicating an unknown SID error. */\n  REQUEST_UNKNOWN_SESSION_ID: 12,\n\n  /** Event indicating a bad status code was received. */\n  REQUEST_BAD_STATUS: 13,\n\n  /** Event indicating incomplete data was received */\n  REQUEST_INCOMPLETE_DATA: 14,\n\n  /** Event indicating bad data was received */\n  REQUEST_BAD_DATA: 15,\n\n  /** Event indicating no data was received when data was expected. */\n  REQUEST_NO_DATA: 16,\n\n  /** Event indicating a request timeout. */\n  REQUEST_TIMEOUT: 17,\n\n  /**\n   * Event indicating that the server never received our hanging GET and so it\n   * is being retried.\n   */\n  BACKCHANNEL_MISSING: 18,\n\n  /**\n   * Event indicating that we have determined that our hanging GET is not\n   * receiving data when it should be. Thus it is dead dead and will be retried.\n   */\n  BACKCHANNEL_DEAD: 19,\n\n  /**\n   * The browser declared itself offline during the lifetime of a request, or\n   * was offline when a request was initially made.\n   */\n  BROWSER_OFFLINE: 20\n};\n\n\n\n/**\n * Event class for STAT_EVENT.\n *\n * @param {goog.events.EventTarget} eventTarget The stat event target for\n       the channel.\n * @param {requestStats.Stat} stat The stat.\n * @constructor\n * @extends {goog.events.Event}\n */\nrequestStats.StatEvent = function(eventTarget, stat) {\n  'use strict';\n  goog.events.Event.call(this, requestStats.Event.STAT_EVENT, eventTarget);\n\n  /**\n   * The stat\n   * @type {requestStats.Stat}\n   */\n  this.stat = stat;\n};\ngoog.inherits(requestStats.StatEvent, goog.events.Event);\n\n\n/**\n * Returns the singleton event target for stat events.\n * @return {!goog.events.EventTarget} The event target for stat events.\n */\nrequestStats.getStatEventTarget = function() {\n  'use strict';\n  return requestStats.getStatEventTarget_();\n};\n\n\n/**\n * Helper function to call the stat event callback.\n * @param {requestStats.Stat} stat The stat.\n */\nrequestStats.notifyStatEvent = function(stat) {\n  'use strict';\n  const target = requestStats.getStatEventTarget_();\n  target.dispatchEvent(new requestStats.StatEvent(target, stat));\n};\n\n\n/**\n * An event that fires when POST requests complete successfully, indicating\n * the size of the POST and the round trip time.\n */\nrequestStats.Event.TIMING_EVENT = 'timingevent';\n\n\n\n/**\n * Event class for requestStats.Event.TIMING_EVENT\n *\n * @param {goog.events.EventTarget} target The stat event target for\n       the channel.\n * @param {number} size The number of characters in the POST data.\n * @param {number} rtt The total round trip time from POST to response in MS.\n * @param {number} retries The number of times the POST had to be retried.\n * @constructor\n * @extends {goog.events.Event}\n */\nrequestStats.TimingEvent = function(target, size, rtt, retries) {\n  'use strict';\n  goog.events.Event.call(this, requestStats.Event.TIMING_EVENT, target);\n\n  /**\n   * @type {number}\n   */\n  this.size = size;\n\n  /**\n   * @type {number}\n   */\n  this.rtt = rtt;\n\n  /**\n   * @type {number}\n   */\n  this.retries = retries;\n};\ngoog.inherits(requestStats.TimingEvent, goog.events.Event);\n\n\n/**\n * Helper function to notify listeners about POST request performance.\n *\n * @param {number} size Number of characters in the POST data.\n * @param {number} rtt The amount of time from POST start to response.\n * @param {number} retries The number of times the POST had to be retried.\n */\nrequestStats.notifyTimingEvent = function(size, rtt, retries) {\n  'use strict';\n  const target = requestStats.getStatEventTarget_();\n  target.dispatchEvent(\n      new requestStats.TimingEvent(target, size, rtt, retries));\n};\n\n\n/**\n * Allows the application to set an execution hooks for when a channel\n * starts processing requests. This is useful to track timing or logging\n * special information. The function takes no parameters and return void.\n * @param {Function} startHook  The function for the start hook.\n */\nrequestStats.setStartThreadExecutionHook = function(startHook) {\n  'use strict';\n  requestStats.startExecutionHook_ = startHook;\n};\n\n\n/**\n * Allows the application to set an execution hooks for when a channel\n * stops processing requests. This is useful to track timing or logging\n * special information. The function takes no parameters and return void.\n * @param {Function} endHook  The function for the end hook.\n */\nrequestStats.setEndThreadExecutionHook = function(endHook) {\n  'use strict';\n  requestStats.endExecutionHook_ = endHook;\n};\n\n\n/**\n * Application provided execution hook for the start hook.\n *\n * @type {Function}\n * @private\n */\nrequestStats.startExecutionHook_ = function() {};\n\n\n/**\n * Application provided execution hook for the end hook.\n *\n * @type {Function}\n * @private\n */\nrequestStats.endExecutionHook_ = function() {};\n\n\n/**\n * Helper function to call the start hook\n */\nrequestStats.onStartExecution = function() {\n  'use strict';\n  requestStats.startExecutionHook_();\n};\n\n\n/**\n * Helper function to call the end hook\n */\nrequestStats.onEndExecution = function() {\n  'use strict';\n  requestStats.endExecutionHook_();\n};\n\n\n/**\n * Wrapper around SafeTimeout which calls the start and end execution hooks\n * with a try...finally block.\n * @param {Function} fn The callback function.\n * @param {number} ms The time in MS for the timer.\n * @return {number} The ID of the timer.\n */\nrequestStats.setTimeout = function(fn, ms) {\n  'use strict';\n  if (typeof fn !== 'function') {\n    throw new Error('Fn must not be null and must be a function');\n  }\n  return goog.global.setTimeout(function() {\n    'use strict';\n    requestStats.onStartExecution();\n    try {\n      fn();\n    } finally {\n      requestStats.onEndExecution();\n    }\n  }, ms);\n};\n});  // goog.scope\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Error codes shared between goog.net.IframeIo and\n * goog.net.XhrIo.\n */\n\ngoog.provide('goog.net.ErrorCode');\n\n\n/**\n * Error codes\n * @enum {number}\n */\ngoog.net.ErrorCode = {\n\n  /**\n   * There is no error condition.\n   */\n  NO_ERROR: 0,\n\n  /**\n   * The most common error from iframeio, unfortunately, is that the browser\n   * responded with an error page that is classed as a different domain. The\n   * situations, are when a browser error page  is shown -- 404, access denied,\n   * DNS failure, connection reset etc.)\n   *\n   */\n  ACCESS_DENIED: 1,\n\n  /**\n   * Currently the only case where file not found will be caused is when the\n   * code is running on the local file system and a non-IE browser makes a\n   * request to a file that doesn't exist.\n   */\n  FILE_NOT_FOUND: 2,\n\n  /**\n   * If Firefox shows a browser error page, such as a connection reset by\n   * server or access denied, then it will fail silently without the error or\n   * load handlers firing.\n   */\n  FF_SILENT_ERROR: 3,\n\n  /**\n   * Custom error provided by the client through the error check hook.\n   */\n  CUSTOM_ERROR: 4,\n\n  /**\n   * Exception was thrown while processing the request.\n   */\n  EXCEPTION: 5,\n\n  /**\n   * The Http response returned a non-successful http status code.\n   */\n  HTTP_ERROR: 6,\n\n  /**\n   * The request was aborted.\n   */\n  ABORT: 7,\n\n  /**\n   * The request timed out.\n   */\n  TIMEOUT: 8,\n\n  /**\n   * The resource is not available offline.\n   */\n  OFFLINE: 9,\n};\n\n\n/**\n * Returns a friendly error message for an error code. These messages are for\n * debugging and are not localized.\n * @param {goog.net.ErrorCode} errorCode An error code.\n * @return {string} A message for debugging.\n */\ngoog.net.ErrorCode.getDebugMessage = function(errorCode) {\n  'use strict';\n  switch (errorCode) {\n    case goog.net.ErrorCode.NO_ERROR:\n      return 'No Error';\n\n    case goog.net.ErrorCode.ACCESS_DENIED:\n      return 'Access denied to content document';\n\n    case goog.net.ErrorCode.FILE_NOT_FOUND:\n      return 'File not found';\n\n    case goog.net.ErrorCode.FF_SILENT_ERROR:\n      return 'Firefox silently errored';\n\n    case goog.net.ErrorCode.CUSTOM_ERROR:\n      return 'Application custom error';\n\n    case goog.net.ErrorCode.EXCEPTION:\n      return 'An exception occurred';\n\n    case goog.net.ErrorCode.HTTP_ERROR:\n      return 'Http response at 400 or 500 level';\n\n    case goog.net.ErrorCode.ABORT:\n      return 'Request was aborted';\n\n    case goog.net.ErrorCode.TIMEOUT:\n      return 'Request timed out';\n\n    case goog.net.ErrorCode.OFFLINE:\n      return 'The resource is not available offline';\n\n    default:\n      return 'Unrecognized error code';\n  }\n};\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Common events for the network classes.\n */\n\n\ngoog.provide('goog.net.EventType');\n\n\n/**\n * Event names for network events\n * @enum {string}\n */\ngoog.net.EventType = {\n  COMPLETE: 'complete',\n  SUCCESS: 'success',\n  ERROR: 'error',\n  ABORT: 'abort',\n  READY: 'ready',\n  READY_STATE_CHANGE: 'readystatechange',\n  TIMEOUT: 'timeout',\n  INCREMENTAL_DATA: 'incrementaldata',\n  PROGRESS: 'progress',\n  // DOWNLOAD_PROGRESS and UPLOAD_PROGRESS are special events dispatched by\n  // goog.net.XhrIo to allow binding listeners specific to each type of\n  // progress.\n  DOWNLOAD_PROGRESS: 'downloadprogress',\n  UPLOAD_PROGRESS: 'uploadprogress',\n};\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Interface for a factory for creating XMLHttpRequest objects\n * and metadata about them.\n */\n\ngoog.provide('goog.net.XmlHttpFactory');\n\n/** @suppress {extraRequire} Typedef. */\ngoog.require('goog.net.XhrLike');\n\n\n\n/**\n * Abstract base class for an XmlHttpRequest factory.\n * @constructor\n */\ngoog.net.XmlHttpFactory = function() {};\n\n\n/**\n * Cache of options - we only actually call internalGetOptions once.\n * @type {?Object}\n * @private\n */\ngoog.net.XmlHttpFactory.prototype.cachedOptions_ = null;\n\n\n/**\n * @return {!goog.net.XhrLike.OrNative} A new XhrLike instance.\n */\ngoog.net.XmlHttpFactory.prototype.createInstance = goog.abstractMethod;\n\n\n/**\n * @return {Object} Options describing how xhr objects obtained from this\n *     factory should be used.\n */\ngoog.net.XmlHttpFactory.prototype.getOptions = function() {\n  'use strict';\n  return this.cachedOptions_ ||\n      (this.cachedOptions_ = this.internalGetOptions());\n};\n\n\n/**\n * Override this method in subclasses to preserve the caching offered by\n * getOptions().\n * @return {Object} Options describing how xhr objects obtained from this\n *     factory should be used.\n * @protected\n */\ngoog.net.XmlHttpFactory.prototype.internalGetOptions = goog.abstractMethod;\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview The API spec for the WebChannel messaging library.\n *\n * Similar to HTML5 WebSocket, WebChannel offers an abstraction for\n * point-to-point socket-like communication between a browser client and\n * a remote origin.\n *\n * WebChannels are created via <code>WebChannel</code>. Multiple WebChannels\n * may be multiplexed over the same WebChannelTransport, which encapsulates\n * the underlying physical connectivity over standard wire protocols\n * such as HTTP.\n *\n * A WebChannel in turn represents a logical communication channel between\n * the client and server endpoint. A WebChannel remains open for as long\n * as the client or server endpoint allows.\n *\n * Messages are delivered in-order and reliably over the same WebChannel,\n * and the choice of the underlying wire protocols is completely transparent\n * to the API users.\n *\n * Note that we have no immediate plan to move this API out of labs. While\n * the implementation is production ready, the API is subject to change.\n */\n\ngoog.provide('goog.net.WebChannel');\ngoog.provide('goog.net.WebChannel.Options');\n\ngoog.require('goog.events');\ngoog.require('goog.events.Event');\ngoog.require('goog.events.Listenable');\ngoog.require('goog.net.XmlHttpFactory');\n\n\n\n/**\n * A WebChannel represents a logical bi-directional channel over which the\n * client communicates with a remote server that holds the other endpoint\n * of the channel. A WebChannel is always created in the context of a shared\n * {@link WebChannelTransport} instance. It is up to the underlying client-side\n * and server-side implementations to decide how or when multiplexing is\n * to be enabled.\n *\n * @interface\n * @extends {goog.events.Listenable}\n */\ngoog.net.WebChannel = function() {};\n\n\n\n/**\n * This interface defines a pluggable API to allow WebChannel runtime to support\n * customized algorithms in order to recover from transient failures such as\n * those failures caused by network or proxies (intermediaries).\n *\n * The algorithm may also choose to fail-fast, e.g. switch the client to some\n * offline mode.\n *\n * Extra measurements and logging could also be implemented in the custom\n * module, which has the full knowledge of all the state transitions\n * (due to failures).\n *\n * A default algorithm will be provided by the webchannel library itself. Custom\n * algorithms are expected to be tailored to specific client platforms or\n * networking environments, e.g. mobile, cellular network.\n *\n * @interface\n */\ngoog.net.WebChannel.FailureRecovery = function() {};\n\n\n/**\n * Configuration spec for newly created WebChannel instances.\n *\n * WebChannels are configured in the context of the containing\n * {@link WebChannelTransport}. The configuration parameters are specified\n * when a new instance of WebChannel is created via {@link WebChannelTransport}.\n * @record\n */\ngoog.net.WebChannel.Options = function() {};\n\n/**\n * Transport-metadata support.\n *\n * Custom HTTP headers to be added to every message sent to the\n * server. This object is mutable, and custom headers may be changed, removed,\n * or added during the runtime after a channel has been opened.\n *\n * Custom headers may trigger CORS preflight. See other related options.\n * @type {!Object<string, string>|undefined}\n */\ngoog.net.WebChannel.Options.prototype.messageHeaders;\n\n/**\n * Transport-metadata support.\n *\n * Similar to messageHeaders, but any custom HTTP headers will\n * be sent only once when the channel is opened as part of the handshae request.\n * Typical usage is to send an auth header to the server, which only checks\n * the auth header at the time during the handshake when the channel is opened.\n * @type {!Object<string, string>|undefined}\n */\ngoog.net.WebChannel.Options.prototype.initMessageHeaders;\n\n/**\n * Sent as initMessageHeaders via X-WebChannel-Content-Type,\n * to inform the server the MIME type of WebChannel messages.\n * @type {string|undefined}\n */\ngoog.net.WebChannel.Options.prototype.messageContentType;\n\n/**\n * Transport-metadata support.\n *\n * Custom url query parameters to be added to every message\n * sent to the server. This object is mutable, and custom parameters may be\n * changed, removed or added during the runtime after a channel has been opened.\n *\n * TODO: initMessageUrlParams\n * TODO: closeMessageUrlParams  (custom url query params to be added to the\n * channel-close message. Custom headers are not supported due to the use of\n * SendBeacon)\n *\n * @type {!Object<string, string>|undefined}\n */\ngoog.net.WebChannel.Options.prototype.messageUrlParams;\n\n/**\n * Whether a special header should be added to\n * each message so that the server can dispatch webchannel messages without\n * knowing the URL path prefix. Defaults to false.\n * @type {boolean|undefined}\n */\ngoog.net.WebChannel.Options.prototype.clientProtocolHeaderRequired;\n\n/**\n * The maximum number of in-flight HTTP requests allowed\n * when SPDY is enabled. Currently we only detect SPDY in Chrome.\n * This parameter defaults to 10. When SPDY is not enabled, this parameter\n * will have no effect.\n * @type {number|undefined}\n */\ngoog.net.WebChannel.Options.prototype.concurrentRequestLimit;\n\n/**\n * Setting this to true to allow the use of sub-domains\n * (as configured by the server) to send XHRs with the CORS withCredentials\n * bit set to true.\n * @type {boolean|undefined}\n */\ngoog.net.WebChannel.Options.prototype.supportsCrossDomainXhr;\n\n/**\n * Whether to bypass v8 encoding of client-sent messages.\n * This defaults to false now due to legacy servers. New applications should\n * always configure this option to true.\n * @type {boolean|undefined}\n */\ngoog.net.WebChannel.Options.prototype.sendRawJson;\n\n/**\n * The URL parameter name that contains the session id (for sticky routing of\n * HTTP requests). When this param is specified, a server that supports this\n * option will respond with an opaque session id as part of the initial\n * handshake (via the X-HTTP-Session-Id header); and all the subsequent requests\n * will contain the httpSessionIdParam. This option will take precedence over\n * any duplicated parameter specified with messageUrlParams, whose value will be\n * ignored.\n * @type {string|undefined}\n */\ngoog.net.WebChannel.Options.prototype.httpSessionIdParam;\n\n/**\n * The URL parameter name to allow custom HTTP\n * headers to be overwritten as a URL param to bypass CORS preflight.\n *\n * @type {string|undefined}\n */\ngoog.net.WebChannel.Options.prototype.httpHeadersOverwriteParam;\n\n/**\n * Whether to encode Options.initMessageHeaders in the HTTP request body.\n * This option defaults to false. If true, Options.httpHeadersOverwriteParam\n * will be ignored.\n *\n * This option should not be set if Options.fastHandshake is set (which\n * uses GET for handshake).\n *\n * Web-only feature.\n *\n * @type {boolean|undefined}\n */\ngoog.net.WebChannel.Options.prototype.encodeInitMessageHeaders;\n\n/**\n * Whether to force long-polling from client to server.\n * This defaults to false. Long-polling may be necessary when a (MITM) proxy\n * is buffering data sent by the server.\n * @type {boolean|undefined}\n */\ngoog.net.WebChannel.Options.prototype.forceLongPolling;\n\n/**\n * Whether to enable automatic detection of buffering proxies. In the presence\n * of any buffering proxy, webchannel will use long-polling to send messages\n * from the server to the client. This option defaults to false.\n * Currently when fastHandshake is enabled, this option will be ignored.\n * Compared to \"forceLongPolling\", this option may introduce up to 2-RTT\n * extra latency for delivering messages generated immediately after the\n * handshake.\n * @type {boolean|undefined}\n */\ngoog.net.WebChannel.Options.prototype.detectBufferingProxy;\n\n/**\n * Enable true 0-RTT message delivery, including\n * leveraging QUIC 0-RTT (which requires GET to be used). This option\n * defaults to false. Note it is allowed to send messages before Open event is\n * received, after a channel has been opened. In order to enable 0-RTT,\n * messages will be encoded as part of URL and therefore there needs be a size\n * limit for those initial messages that are sent immediately as part of the\n * GET handshake request. With sendRawJson=true, this limit is currently set\n * to 4K chars and data beyond this limit will be buffered till the handshake\n * (1-RTT) finishes. With sendRawJson=false, it's up to the application\n * to limit the amount of data that is sent as part of the handshake.\n * @type {boolean|undefined}\n */\ngoog.net.WebChannel.Options.prototype.fastHandshake;\n\n/**\n * Enable the blocking RPC semantics for the handshake:\n * 1) the completion of handshake is blocked by the server-side application\n * logic for handling the handshake (HTTP) request; 2) the client application\n * will inspect the handshake (HTTP) response headers as generated\n * by the server application (v.s. by only the webchannel runtime). This option\n * defaults to false.\n * @type {boolean|undefined}\n */\ngoog.net.WebChannel.Options.prototype.blockingHandshake;\n\n/**\n * Whether to disable logging redact. By default, redact is\n * enabled to remove any message payload or user-provided info\n * from closure logs.\n * @type {boolean|undefined}\n */\ngoog.net.WebChannel.Options.prototype.disableRedact;\n\n/**\n * Inform the server about the client profile to enable\n * customized configs that are optimized for certain clients or environments.\n * Currently this information is sent via X-WebChannel-Client-Profile header.\n * @type {string|undefined}\n */\ngoog.net.WebChannel.Options.prototype.clientProfile;\n\n/**\n * The internal channel parameter name to allow\n * experimental channel configurations. Supported options include fastfail,\n * baseRetryDelayMs, retryDelaySeedMs, forwardChannelMaxRetries and\n * forwardChannelRequestTimeoutMs. Note that these options are subject to\n * change.\n * @type {!Object<string, boolean|number>|undefined}\n */\ngoog.net.WebChannel.Options.prototype.internalChannelParams;\n\n/**\n * Allows the caller to override the factory used to create\n * XMLHttpRequest objects. This is introduced to disable CORS on firefox OS.\n * @type {!goog.net.XmlHttpFactory|undefined}\n */\ngoog.net.WebChannel.Options.prototype.xmlHttpFactory;\n\n/**\n * Client-side thresholds that decide when to refresh\n * an underlying HTTP request, to limit memory consumption due to XHR buffering\n * or compression context. The client-side thresholds should be significantly\n * smaller than the server-side thresholds. This allows the client to eliminate\n * any latency introduced by request refreshing, i.e. an RTT window during which\n * messages may be buffered on the server-side. Supported params include\n * totalBytesReceived, totalDurationMs.\n * @type {!Object<string, number>|undefined}\n */\ngoog.net.WebChannel.Options.prototype.requestRefreshThresholds;\n\n/**\n * This is an experimental feature to use WHATWG Fetch/streams (when supported)\n * for the backchannel. If a custom 'xmlHttpFactory' is speficied, this option\n * will not be effective. This option defaults to false now and will eventually\n * be turned on by default.\n * @type {boolean|undefined}\n */\ngoog.net.WebChannel.Options.prototype.useFetchStreams;\n\n/**\n * Opt-in to enable Chrome origin trials from the WebChannel client. See\n * https://github.com/GoogleChrome/OriginTrials\n *\n * Origin trial history:\n * - fetch upload (11/2020 - 07/2021)\n * https://developers.chrome.com/origintrials/#/view_trial/3524066708417413121\n *\n * Participating in the origin trials will help Chrome to release new Web\n * platform features sooner, which will in turn help improve WebChannel\n * performance.\n *\n * Origin trials are not expected to interfere with WebChannel wire messages\n * and should not introduce any noticeable overhead.\n *\n * This is enabled by default with any on-going origin-trial.\n *\n * @type {boolean|undefined}\n */\ngoog.net.WebChannel.Options.prototype.enableOriginTrials;\n\n\n/**\n * Types that are allowed as message data.\n *\n * Note that JS objects (sent by the client) can only have string encoded\n * values due to the limitation of the current wire protocol.\n *\n * Unicode strings (sent by the server) may or may not need be escaped, as\n * decided by the server.\n *\n * @typedef {(!ArrayBuffer|!Blob|!Object<string, !Object|string>|!Array|string)}\n */\ngoog.net.WebChannel.MessageData;\n\n\n/**\n * Open the WebChannel against the URI specified in the constructor.\n */\ngoog.net.WebChannel.prototype.open = goog.abstractMethod;\n\n\n/**\n * Close the WebChannel.\n *\n * This is a full close (shutdown) with no guarantee of FIFO delivery in respect\n * to any in-flight messages sent to the server.\n *\n * If you need such a guarantee, see the Half the halfClose() method.\n */\ngoog.net.WebChannel.prototype.close = goog.abstractMethod;\n\n\n/**\n * Half-close the WebChannel.\n *\n * Half-close semantics:\n * 1. delivered as a regular message in FIFO programming order\n * 2. the server is expected to return a half-close too (with or without\n *    application involved), which will trigger a full close (shutdown)\n *    on the client side\n * 3. for now, the half-close event defined for server-initiated\n *    half-close is not exposed to the client application\n * 4. a client-side half-close may be triggered internally when the client\n *    receives a half-close from the server; and the client is expected to\n *    do a full close after the half-close is acked and delivered\n *    on the server-side.\n * 5. Full close is always a forced one. See the close() method.\n *\n * New messages sent after halfClose() will be dropped.\n *\n * NOTE: This is not yet implemented, and will throw an exception if called.\n */\ngoog.net.WebChannel.prototype.halfClose = goog.abstractMethod;\n\n\n/**\n * Sends a message to the server that maintains the other endpoint of\n * the WebChannel.\n *\n * O-RTT behavior:\n * 1. messages sent before open() is called will always be delivered as\n *    part of the handshake, i.e. with 0-RTT\n * 2. messages sent after open() is called but before the OPEN event\n *    is received will be delivered as part of the handshake if\n *    send() is called from the same execution context as open().\n * 3. otherwise, those messages will be buffered till the handshake\n *    is completed (which will fire the OPEN event).\n *\n * @param {!goog.net.WebChannel.MessageData} message The message to send.\n */\ngoog.net.WebChannel.prototype.send = goog.abstractMethod;\n\n\n/**\n * Common events fired by WebChannels.\n * @enum {string}\n */\ngoog.net.WebChannel.EventType = {\n  /** Dispatched when the channel is opened. */\n  OPEN: goog.events.getUniqueId('open'),\n\n  /** Dispatched when the channel is closed. */\n  CLOSE: goog.events.getUniqueId('close'),\n\n  /**\n   * Dispatched when the channel is aborted due to errors.\n   *\n   * For backward compatibility reasons, a CLOSE event will also be\n   * dispatched, following the ERROR event, which indicates that the channel\n   * has been completely shutdown .\n   */\n  ERROR: goog.events.getUniqueId('error'),\n\n  /** Dispatched when the channel has received a new message. */\n  MESSAGE: goog.events.getUniqueId('message')\n};\n\n\n\n/**\n * The event interface for the MESSAGE event.\n *\n * @constructor\n * @extends {goog.events.Event}\n */\ngoog.net.WebChannel.MessageEvent = function() {\n  'use strict';\n  goog.net.WebChannel.MessageEvent.base(\n      this, 'constructor', goog.net.WebChannel.EventType.MESSAGE);\n};\ngoog.inherits(goog.net.WebChannel.MessageEvent, goog.events.Event);\n\n\n/**\n * The content of the message received from the server.\n *\n * @type {!goog.net.WebChannel.MessageData}\n */\ngoog.net.WebChannel.MessageEvent.prototype.data;\n\n\n/**\n * The metadata key when the MESSAGE event represents a metadata message.\n *\n * @type {string|undefined}\n */\ngoog.net.WebChannel.MessageEvent.prototype.metadataKey;\n\n\n/**\n * Metadata as HTTP status code. Typically sent before the channel is\n * half-closed by the server. To be implemented.\n *\n * @type {number|undefined}\n */\ngoog.net.WebChannel.MessageEvent.prototype.statusCode;\n\n\n/**\n * Metadata as HTTP headers. Typically sent before the channel is\n * half-closed by the server. To be implemented.\n *\n * @type {!Object<string, string>|undefined}\n */\ngoog.net.WebChannel.MessageEvent.prototype.responseHeaders;\n\n\n/**\n * WebChannel level error conditions.\n *\n * Summary of error debugging and reporting in WebChannel:\n *\n * Network Error\n * 1. By default the webchannel library will set the error status to\n *    NETWORK_ERROR when a channel has to be aborted or closed. NETWORK_ERROR\n *    may be recovered by the application by retrying and opening a new channel.\n * 2. There may be lost messages (not acked by the server) when a channel is\n *    aborted. Currently we don't have a public API to retrieve messages that\n *    are waiting to be acked on the client side. File a bug if you think it\n *    is useful to expose such an API.\n * 3. Details of why a channel fails are available via closure debug logs,\n *    and stats events (see webchannel/requeststats.js). Those are internal\n *    stats and are subject to change. File a bug if you think it's useful to\n *    version and expose such stats as part of the WebChannel API.\n *\n * Server Error\n * 1. SERVER_ERROR is intended to indicate a non-recoverable condition, e.g.\n *    when auth fails.\n * 2. We don't currently generate any such errors, because most of the time\n *    it's the responsibility of upper-layer frameworks or the application\n *    itself to indicate to the client why a webchannel has been failed\n *    by the server.\n * 3. When a channel is failed by the server explicitly, we still signal\n *    NETWORK_ERROR to the client. Explicit server failure may happen when the\n *    server does a fail-over, or becomes overloaded, or conducts a forced\n *    shutdown etc.\n * 4. We use some heuristic to decide if the network (aka cloud) is down\n *    v.s. the actual server is down.\n *\n *  RuntimeProperties.getLastStatusCode is a useful state that we expose to\n *  the client to indicate the HTTP response status code of the last HTTP\n *  request initiated by the WebChannel client library, for debugging\n *  purposes only.\n *\n *  See WebChannel.Options.backChannelFailureRecovery and\n *  WebChannel.FailureRecovery to install a custom failure-recovery algorithm.\n *\n * @enum {number}\n */\ngoog.net.WebChannel.ErrorStatus = {\n  /** No error has occurred. */\n  OK: 0,\n\n  /** Communication to the server has failed. */\n  NETWORK_ERROR: 1,\n\n  /** The server fails to accept or process the WebChannel. */\n  SERVER_ERROR: 2\n};\n\n\n\n/**\n * The event interface for the ERROR event.\n *\n * @constructor\n * @extends {goog.events.Event}\n */\ngoog.net.WebChannel.ErrorEvent = function() {\n  'use strict';\n  goog.net.WebChannel.ErrorEvent.base(\n      this, 'constructor', goog.net.WebChannel.EventType.ERROR);\n};\ngoog.inherits(goog.net.WebChannel.ErrorEvent, goog.events.Event);\n\n\n/**\n * The error status.\n *\n * @type {!goog.net.WebChannel.ErrorStatus}\n */\ngoog.net.WebChannel.ErrorEvent.prototype.status;\n\n\n/**\n * @return {!goog.net.WebChannel.RuntimeProperties} The runtime properties\n * of the WebChannel instance.\n */\ngoog.net.WebChannel.prototype.getRuntimeProperties = goog.abstractMethod;\n\n\n\n/**\n * The runtime properties of the WebChannel instance.\n *\n * This class is defined for debugging and monitoring purposes, as well as for\n * runtime functions that the application may choose to manage by itself.\n *\n * @interface\n */\ngoog.net.WebChannel.RuntimeProperties = function() {};\n\n\n/**\n * @return {number} The effective limit for the number of concurrent HTTP\n * requests that are allowed to be made for sending messages from the client\n * to the server. When SPDY is not enabled, this limit will be one.\n */\ngoog.net.WebChannel.RuntimeProperties.prototype.getConcurrentRequestLimit =\n    goog.abstractMethod;\n\n\n/**\n * For applications that need support multiple channels (e.g. from\n * different tabs) to the same origin, use this method to decide if SPDY is\n * enabled and therefore it is safe to open multiple channels.\n *\n * If SPDY is disabled, the application may choose to limit the number of active\n * channels to one or use other means such as sub-domains to work around\n * the browser connection limit.\n *\n * @return {boolean} Whether SPDY is enabled for the origin against which\n * the channel is created.\n */\ngoog.net.WebChannel.RuntimeProperties.prototype.isSpdyEnabled =\n    goog.abstractMethod;\n\n\n/**\n * @return {number} The number of requests (for sending messages to the server)\n * that are pending. If this number is approaching the value of\n * getConcurrentRequestLimit(), client-to-server message delivery may experience\n * a higher latency.\n */\ngoog.net.WebChannel.RuntimeProperties.prototype.getPendingRequestCount =\n    goog.abstractMethod;\n\n\n/**\n * For applications to query the current HTTP session id, sent by the server\n * during the initial handshake.\n *\n * @return {?string} the HTTP session id or null if no HTTP session is in use.\n */\ngoog.net.WebChannel.RuntimeProperties.prototype.getHttpSessionId =\n    goog.abstractMethod;\n\n\n/**\n * Experimental API.\n *\n * This method generates an in-band commit request to the server, which will\n * ack the commit request as soon as all messages sent prior to this commit\n * request have been committed by the application.\n *\n * Committing a message has a stronger semantics than delivering a message\n * to the application. Detail spec:\n * https://github.com/bidiweb/webchannel/blob/master/commit.md\n *\n * Timeout or cancellation is not supported and the application is expected to\n * abort the channel if the commit-ack fails to arrive in time.\n *\n * ===\n *\n * This is currently implemented only in the client layer and the commit\n * callback will be invoked after all the pending client-sent messages have been\n * delivered by the server-side webchannel endpoint. This semantics is\n * different and weaker than what's required for end-to-end ack which requires\n * the server application to ack the in-order delivery of messages that are sent\n * before the commit request is issued.\n *\n * Commit should only be called after the channel open event is received.\n * Duplicated commits are allowed and only the last callback is guaranteed.\n * Commit called after the channel has been closed will be ignored.\n *\n * @param {function()} callback The callback will be invoked once an\n * ack has been received for the current commit or any newly issued commit.\n */\ngoog.net.WebChannel.RuntimeProperties.prototype.commit = goog.abstractMethod;\n\n\n/**\n * This method may be used by the application to recover from a peer failure\n * or to enable sender-initiated flow-control.\n *\n * Detail spec: https://github.com/bidiweb/webchannel/blob/master/commit.md\n *\n * Note that the caller should NOT modify the list of returned messages.\n *\n * @return {!Array<!goog.net.WebChannel.MessageData>} The list of messages that\n * have not received commit-ack from the server; or if no commit has been\n * issued, the list of messages that have not been delivered to the server\n * application.\n */\ngoog.net.WebChannel.RuntimeProperties.prototype.getNonAckedMessages =\n    goog.abstractMethod;\n\n\n/**\n * A low water-mark message count to notify the application when the\n * flow-control condition is cleared, that is, when the application is\n * able to send more messages.\n *\n * We expect the application to configure a high water-mark message count,\n * which is checked via getNonAckedMessageCount(). When the high water-mark\n * is exceeded, the application should install a callback via this method\n * to be notified when to start to send new messages.\n *\n * This is not yet implemented.\n *\n * @param {number} count The low water-mark count. It is an error to pass\n * a non-positive value.\n * @param {function()} callback The call back to notify the application\n * when NonAckedMessageCount is below the specified low water-mark count.\n * Any previously registered callback is cleared. This new callback will\n * be cleared once it has been fired, or when the channel is closed or aborted.\n */\ngoog.net.WebChannel.RuntimeProperties.prototype.notifyNonAckedMessageCount =\n    goog.abstractMethod;\n\n\n/**\n * Experimental API.\n *\n * This method registers a callback to handle the commit request sent\n * by the server. Commit protocol spec:\n * https://github.com/bidiweb/webchannel/blob/master/commit.md\n *\n * This is not yet implemented.\n *\n * @param {function(!Object)} callback The callback will take an opaque\n * commitId which needs be passed back to the server when an ack-commit\n * response is generated by the client application, via ackCommit().\n */\ngoog.net.WebChannel.RuntimeProperties.prototype.onCommit = goog.abstractMethod;\n\n\n/**\n * Experimental API.\n *\n * This method is used by the application to generate an ack-commit response\n * for the given commitId. Commit protocol spec:\n * https://github.com/bidiweb/webchannel/blob/master/commit.md\n *\n * This is not yet implemented.\n *\n * @param {!Object} commitId The commitId which denotes the commit request\n * from the server that needs be ack'ed.\n */\ngoog.net.WebChannel.RuntimeProperties.prototype.ackCommit = goog.abstractMethod;\n\n\n/**\n * Transport-metadata support.\n *\n * TODO: getLastResponseHeaders (only for non-200 status)\n * TODO: getInitStatusCode   (handshake)\n * TODO: getInitResponseHeaders  (handshake)\n *\n * Note that response headers from client-initiated close (abort) are not\n * available.\n *\n * In future when client-initiated half-close is supported, its response status\n * will be available via this API.\n *\n * @return {number} The non-200 HTTP status code received that causes the\n * channel to be aborted.\n */\ngoog.net.WebChannel.RuntimeProperties.prototype.getLastStatusCode =\n    goog.abstractMethod;\n\n\n/**\n * Enum to indicate the current recovery state.\n *\n * @enum {string}\n */\ngoog.net.WebChannel.FailureRecovery.State = {\n  /** Initial state. */\n  INIT: 'init',\n\n  /** Once a failure has been detected. */\n  FAILED: 'failed',\n\n  /**\n   * Once a recovery operation has been issued, e.g. a new request to resume\n   * communication.\n   */\n  RECOVERING: 'recovering',\n\n  /** The channel has been closed.  */\n  CLOSED: 'closed'\n};\n\n\n/**\n * Enum to indicate different failure conditions as detected by the webchannel\n * runtime.\n *\n * This enum is to be used only between the runtime and FailureRecovery module,\n * and new states are expected to be introduced in future.\n *\n * @enum {string}\n */\ngoog.net.WebChannel.FailureRecovery.FailureCondition = {\n  /**\n   * The HTTP response returned a non-successful http status code.\n   */\n  HTTP_ERROR: 'http_error',\n\n  /**\n   * The request was aborted.\n   */\n  ABORT: 'abort',\n\n  /**\n   * The request timed out.\n   */\n  TIMEOUT: 'timeout',\n\n  /**\n   * Exception was thrown while processing the request/response.\n   */\n  EXCEPTION: 'exception'\n};\n\n\n/**\n * @return {!goog.net.WebChannel.FailureRecovery.State} the current state,\n * mainly for debugging use.\n */\ngoog.net.WebChannel.FailureRecovery.prototype.getState = goog.abstractMethod;\n\n\n/**\n * This method is for WebChannel runtime to set the current failure condition\n * and to provide a callback for the algorithm to signal to the runtime\n * when it is time to issue a recovery operation, e.g. a new request to the\n * server.\n *\n * Supported transitions include:\n *   INIT->FAILED\n *   FAILED->FAILED (re-entry ok)\n *   RECOVERY->FAILED.\n *\n * Ignored if state == CLOSED.\n *\n * Advanced implementations are expected to track all the state transitions\n * and their timestamps for monitoring purposes.\n *\n * @param {!goog.net.WebChannel.FailureRecovery.FailureCondition} failure The\n * new failure condition generated by the WebChannel runtime.\n * @param {!Function} operation The callback function to the WebChannel\n * runtime to issue a recovery operation, e.g. a new request. E.g. the default\n * recovery algorithm will issue timeout-based recovery operations.\n * Post-condition for the callback: state transition to RECOVERING.\n *\n * @return {!goog.net.WebChannel.FailureRecovery.State} The updated state\n * as decided by the failure recovery module. Upon a recoverable failure event,\n * the state is transitioned to RECOVERING; or the state is transitioned to\n * FAILED which indicates a fail-fast decision for the runtime to execute.\n */\ngoog.net.WebChannel.FailureRecovery.prototype.setFailure = goog.abstractMethod;\n\n\n/**\n * The Webchannel runtime needs call this method when webchannel is closed or\n * aborted.\n *\n * Once the instance is closed, any access to the instance will be a no-op.\n */\ngoog.net.WebChannel.FailureRecovery.prototype.close = goog.abstractMethod;\n\n\n/**\n * A request header to indicate to the server the messaging protocol\n * each HTTP message is speaking.\n *\n * @type {string}\n */\ngoog.net.WebChannel.X_CLIENT_PROTOCOL = 'X-Client-Protocol';\n\n\n/**\n * The value for x-client-protocol when the messaging protocol is WebChannel.\n *\n * @type {string}\n */\ngoog.net.WebChannel.X_CLIENT_PROTOCOL_WEB_CHANNEL = 'webchannel';\n\n\n/**\n * A response header for the server to signal the wire-protocol that\n * the browser establishes with the server (or proxy), e.g. \"spdy\" (aka http/2)\n * \"quic\". This information avoids the need to use private APIs to decide if\n * HTTP requests are multiplexed etc.\n *\n * @type {string}\n */\ngoog.net.WebChannel.X_CLIENT_WIRE_PROTOCOL = 'X-Client-Wire-Protocol';\n\n\n/**\n * A response header for the server to send back the HTTP session id as part of\n * the initial handshake. The value of the HTTP session id is opaque to the\n * WebChannel protocol.\n *\n * @type {string}\n */\ngoog.net.WebChannel.X_HTTP_SESSION_ID = 'X-HTTP-Session-Id';\n\n\n/**\n * A response header for the server to send back any initial response data as a\n * header to avoid any possible buffering by an intermediary, which may\n * be undesired during the handshake.\n *\n * @type {string}\n */\ngoog.net.WebChannel.X_HTTP_INITIAL_RESPONSE = 'X-HTTP-Initial-Response';\n\n\n/**\n * A request header for specifying the content-type of WebChannel messages,\n * e.g. application-defined JSON encoding styles. Currently this header\n * is sent by the client via initMessageHeaders when the channel is opened.\n *\n * @type {string}\n */\ngoog.net.WebChannel.X_WEBCHANNEL_CONTENT_TYPE = 'X-WebChannel-Content-Type';\n\n\n/**\n * A request header for specifying the client profile in order to apply\n * customized config params on the server side, e.g. timeouts.\n *\n * @type {string}\n */\ngoog.net.WebChannel.X_WEBCHANNEL_CLIENT_PROFILE = 'X-WebChannel-Client-Profile';\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Low level handling of XMLHttpRequest.\n */\n\ngoog.provide('goog.net.DefaultXmlHttpFactory');\ngoog.provide('goog.net.XmlHttp');\ngoog.provide('goog.net.XmlHttp.OptionType');\ngoog.provide('goog.net.XmlHttp.ReadyState');\ngoog.provide('goog.net.XmlHttpDefines');\n\ngoog.require('goog.asserts');\ngoog.require('goog.net.WrapperXmlHttpFactory');\ngoog.require('goog.net.XmlHttpFactory');\ngoog.requireType('goog.net.XhrLike');\n\n\n/**\n * Static class for creating XMLHttpRequest objects.\n * @return {!goog.net.XhrLike.OrNative} A new XMLHttpRequest object.\n */\ngoog.net.XmlHttp = function() {\n  'use strict';\n  return goog.net.XmlHttp.factory_.createInstance();\n};\n\n\n/**\n * @define {boolean} Whether to assume XMLHttpRequest exists. Setting this to\n *     true bypasses the ActiveX probing code.\n * NOTE(ruilopes): Due to the way JSCompiler works, this define *will not* strip\n * out the ActiveX probing code from binaries.  To achieve this, use\n * `goog.net.XmlHttpDefines.ASSUME_NATIVE_XHR` instead.\n * TODO(ruilopes): Collapse both defines.\n */\ngoog.net.XmlHttp.ASSUME_NATIVE_XHR =\n    goog.define('goog.net.XmlHttp.ASSUME_NATIVE_XHR', false);\n\n\n/** @const */\ngoog.net.XmlHttpDefines = {};\n\n\n/**\n * @define {boolean} Whether to assume XMLHttpRequest exists. Setting this to\n *     true eliminates the ActiveX probing code.\n */\ngoog.net.XmlHttpDefines.ASSUME_NATIVE_XHR =\n    goog.define('goog.net.XmlHttpDefines.ASSUME_NATIVE_XHR', false);\n\n\n/**\n * Gets the options to use with the XMLHttpRequest objects obtained using\n * the static methods.\n * @return {Object} The options.\n */\ngoog.net.XmlHttp.getOptions = function() {\n  'use strict';\n  return goog.net.XmlHttp.factory_.getOptions();\n};\n\n\n/**\n * Type of options that an XmlHttp object can have.\n * @enum {number}\n */\ngoog.net.XmlHttp.OptionType = {\n  /**\n   * Whether a goog.nullFunction should be used to clear the onreadystatechange\n   * handler instead of null.\n   */\n  USE_NULL_FUNCTION: 0,\n\n  /**\n   * NOTE(user): In IE if send() errors on a *local* request the readystate\n   * is still changed to COMPLETE.  We need to ignore it and allow the\n   * try/catch around send() to pick up the error.\n   */\n  LOCAL_REQUEST_ERROR: 1,\n};\n\n\n/**\n * Status constants for XMLHTTP, matches:\n * https://msdn.microsoft.com/en-us/library/ms534361(v=vs.85).aspx\n * @enum {number}\n */\ngoog.net.XmlHttp.ReadyState = {\n  /**\n   * Constant for when xmlhttprequest.readyState is uninitialized\n   */\n  UNINITIALIZED: 0,\n\n  /**\n   * Constant for when xmlhttprequest.readyState is loading.\n   */\n  LOADING: 1,\n\n  /**\n   * Constant for when xmlhttprequest.readyState is loaded.\n   */\n  LOADED: 2,\n\n  /**\n   * Constant for when xmlhttprequest.readyState is in an interactive state.\n   */\n  INTERACTIVE: 3,\n\n  /**\n   * Constant for when xmlhttprequest.readyState is completed\n   */\n  COMPLETE: 4,\n};\n\n\n/**\n * The global factory instance for creating XMLHttpRequest objects.\n * @type {goog.net.XmlHttpFactory}\n * @private\n */\ngoog.net.XmlHttp.factory_;\n\n\n/**\n * Sets the factories for creating XMLHttpRequest objects and their options.\n * @param {Function} factory The factory for XMLHttpRequest objects.\n * @param {Function} optionsFactory The factory for options.\n * @deprecated Use setGlobalFactory instead.\n */\ngoog.net.XmlHttp.setFactory = function(factory, optionsFactory) {\n  'use strict';\n  goog.net.XmlHttp.setGlobalFactory(new goog.net.WrapperXmlHttpFactory(\n      goog.asserts.assert(factory), goog.asserts.assert(optionsFactory)));\n};\n\n\n/**\n * Sets the global factory object.\n * @param {!goog.net.XmlHttpFactory} factory New global factory object.\n */\ngoog.net.XmlHttp.setGlobalFactory = function(factory) {\n  'use strict';\n  goog.net.XmlHttp.factory_ = factory;\n};\n\n\n\n/**\n * Default factory to use when creating xhr objects.  You probably shouldn't be\n * instantiating this directly, but rather using it via goog.net.XmlHttp.\n * @extends {goog.net.XmlHttpFactory}\n * @constructor\n */\ngoog.net.DefaultXmlHttpFactory = function() {\n  'use strict';\n  goog.net.XmlHttpFactory.call(this);\n};\ngoog.inherits(goog.net.DefaultXmlHttpFactory, goog.net.XmlHttpFactory);\n\n\n/** @override */\ngoog.net.DefaultXmlHttpFactory.prototype.createInstance = function() {\n  'use strict';\n  const progId = this.getProgId_();\n  if (progId) {\n    return new ActiveXObject(progId);\n  } else {\n    return new XMLHttpRequest();\n  }\n};\n\n\n/** @override */\ngoog.net.DefaultXmlHttpFactory.prototype.internalGetOptions = function() {\n  'use strict';\n  const progId = this.getProgId_();\n  const options = {};\n  if (progId) {\n    options[goog.net.XmlHttp.OptionType.USE_NULL_FUNCTION] = true;\n    options[goog.net.XmlHttp.OptionType.LOCAL_REQUEST_ERROR] = true;\n  }\n  return options;\n};\n\n\n/**\n * The ActiveX PROG ID string to use to create xhr's in IE. Lazily initialized.\n * @type {string|undefined}\n * @private\n */\ngoog.net.DefaultXmlHttpFactory.prototype.ieProgId_;\n\n\n/**\n * Initialize the private state used by other functions.\n * @return {string} The ActiveX PROG ID string to use to create xhr's in IE.\n * @private\n */\ngoog.net.DefaultXmlHttpFactory.prototype.getProgId_ = function() {\n  'use strict';\n  if (goog.net.XmlHttp.ASSUME_NATIVE_XHR ||\n      goog.net.XmlHttpDefines.ASSUME_NATIVE_XHR) {\n    return '';\n  }\n\n  // The following blog post describes what PROG IDs to use to create the\n  // XMLHTTP object in Internet Explorer:\n  // http://blogs.msdn.com/xmlteam/archive/2006/10/23/using-the-right-version-of-msxml-in-internet-explorer.aspx\n  // However we do not (yet) fully trust that this will be OK for old versions\n  // of IE on Win9x so we therefore keep the last 2.\n  if (!this.ieProgId_ && typeof XMLHttpRequest == 'undefined' &&\n      typeof ActiveXObject != 'undefined') {\n    // Candidate Active X types.\n    const ACTIVE_X_IDENTS = [\n      'MSXML2.XMLHTTP.6.0',\n      'MSXML2.XMLHTTP.3.0',\n      'MSXML2.XMLHTTP',\n      'Microsoft.XMLHTTP',\n    ];\n    for (let i = 0; i < ACTIVE_X_IDENTS.length; i++) {\n      const candidate = ACTIVE_X_IDENTS[i];\n\n      try {\n        new ActiveXObject(candidate);\n        // NOTE(user): cannot assign progid and return candidate in one line\n        // because JSCompiler complaings: BUG 658126\n        this.ieProgId_ = candidate;\n        return candidate;\n      } catch (e) {\n        // do nothing; try next choice\n      }\n    }\n\n    // couldn't find any matches\n    throw new Error(\n        'Could not create ActiveXObject. ActiveX might be disabled,' +\n        ' or MSXML might not be installed');\n  }\n\n  return /** @type {string} */ (this.ieProgId_);\n};\n\n\n// Set the global factory to an instance of the default factory.\ngoog.net.XmlHttp.setGlobalFactory(new goog.net.DefaultXmlHttpFactory());\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Definition of the ChannelRequest class. The request\n * object encapsulates the logic for making a single request, either for the\n * forward channel, back channel, or test channel, to the server. It contains\n * the logic for the two types of transports we use:\n * XMLHTTP and Image request. It provides timeout detection. More transports\n * to be added in future, such as Fetch, WebSocket.\n *\n */\n\n\ngoog.provide('goog.labs.net.webChannel.ChannelRequest');\n\ngoog.require('goog.Timer');\ngoog.require('goog.asserts');\ngoog.require('goog.async.Throttle');\ngoog.require('goog.dispose');\ngoog.require('goog.events.EventHandler');\ngoog.require('goog.labs.net.webChannel.Channel');\ngoog.require('goog.labs.net.webChannel.WebChannelDebug');\ngoog.require('goog.labs.net.webChannel.environment');\ngoog.require('goog.labs.net.webChannel.requestStats');\ngoog.require('goog.net.ErrorCode');\ngoog.require('goog.net.EventType');\ngoog.require('goog.net.WebChannel');\ngoog.require('goog.net.XmlHttp');\ngoog.require('goog.object');\ngoog.require('goog.string');\ngoog.require('goog.userAgent');\ngoog.requireType('goog.Uri');\ngoog.requireType('goog.events.Event');\ngoog.requireType('goog.labs.net.webChannel.Wire.QueuedMap');\ngoog.requireType('goog.net.XhrIo');\n\n\n\n/**\n * A new ChannelRequest is created for each request to the server.\n *\n * @param {goog.labs.net.webChannel.Channel} channel\n *     The channel that owns this request.\n * @param {goog.labs.net.webChannel.WebChannelDebug} channelDebug A\n *     WebChannelDebug to use for logging.\n * @param {string=} opt_sessionId The session id for the channel.\n * @param {string|number=} opt_requestId The request id for this request.\n * @param {number=} opt_retryId The retry id for this request.\n * @constructor\n * @struct\n * @final\n */\ngoog.labs.net.webChannel.ChannelRequest = function(\n    channel, channelDebug, opt_sessionId, opt_requestId, opt_retryId) {\n  'use strict';\n  /**\n   * The channel object that owns the request.\n   * @private {goog.labs.net.webChannel.Channel}\n   */\n  this.channel_ = channel;\n\n  /**\n   * The channel debug to use for logging\n   * @private {goog.labs.net.webChannel.WebChannelDebug}\n   */\n  this.channelDebug_ = channelDebug;\n\n  /**\n   * The Session ID for the channel.\n   * @private {string|undefined}\n   */\n  this.sid_ = opt_sessionId;\n\n  /**\n   * The RID (request ID) for the request.\n   * @private {string|number|undefined}\n   */\n  this.rid_ = opt_requestId;\n\n  /**\n   * The attempt number of the current request.\n   * @private {number}\n   */\n  this.retryId_ = opt_retryId || 1;\n\n  /**\n   * An object to keep track of the channel request event listeners.\n   * @private {!goog.events.EventHandler<\n   *     !goog.labs.net.webChannel.ChannelRequest>}\n   */\n  this.eventHandler_ = new goog.events.EventHandler(this);\n\n  /**\n   * The timeout in ms before failing the request.\n   * @private {number}\n   */\n  this.timeout_ = goog.labs.net.webChannel.ChannelRequest.TIMEOUT_MS_;\n\n  /**\n   * A timer for polling responseText in browsers that don't fire\n   * onreadystatechange during incremental loading of responseText.\n   * @private {goog.Timer}\n   */\n  this.pollingTimer_ =\n      new goog.Timer(goog.labs.net.webChannel.environment.getPollingInterval());\n\n  /**\n   * Extra HTTP headers to add to all the requests sent to the server.\n   * @private {?Object}\n   */\n  this.extraHeaders_ = null;\n\n\n  /**\n   * Whether the request was successful. This is only set to true after the\n   * request successfully completes.\n   * @private {boolean}\n   */\n  this.successful_ = false;\n\n\n  /**\n   * The TimerID of the timer used to detect if the request has timed-out.\n   * @type {?number}\n   * @private\n   */\n  this.watchDogTimerId_ = null;\n\n  /**\n   * The time in the future when the request will timeout.\n   * @private {?number}\n   */\n  this.watchDogTimeoutTime_ = null;\n\n  /**\n   * The time the request started.\n   * @private {?number}\n   */\n  this.requestStartTime_ = null;\n\n  /**\n   * The type of request (XMLHTTP, IMG)\n   * @private {?number}\n   */\n  this.type_ = null;\n\n  /**\n   * The base Uri for the request. The includes all the parameters except the\n   * one that indicates the retry number.\n   * @private {?goog.Uri}\n   */\n  this.baseUri_ = null;\n\n  /**\n   * The request Uri that was actually used for the most recent request attempt.\n   * @private {?goog.Uri}\n   */\n  this.requestUri_ = null;\n\n  /**\n   * The post data, if the request is a post.\n   * @private {?string}\n   */\n  this.postData_ = null;\n\n  /**\n   * An array of pending messages that we have either received a non-successful\n   * response for, or no response at all, and which therefore may or may not\n   * have been received by the server.\n   * @private {!Array<goog.labs.net.webChannel.Wire.QueuedMap>}\n   */\n  this.pendingMessages_ = [];\n\n  /**\n   * The XhrLte request if the request is using XMLHTTP\n   * @private {?goog.net.XhrIo}\n   */\n  this.xmlHttp_ = null;\n\n  /**\n   * The position of where the next unprocessed chunk starts in the response\n   * text.\n   * @private {number}\n   */\n  this.xmlHttpChunkStart_ = 0;\n\n  /**\n   * The verb (Get or Post) for the request.\n   * @private {?string}\n   */\n  this.verb_ = null;\n\n  /**\n   * The last error if the request failed.\n   * @private {?goog.labs.net.webChannel.ChannelRequest.Error}\n   */\n  this.lastError_ = null;\n\n  /**\n   * The last status code received.\n   * @private {number}\n   */\n  this.lastStatusCode_ = -1;\n\n  /**\n   * Whether the request has been cancelled due to a call to cancel.\n   * @private {boolean}\n   */\n  this.cancelled_ = false;\n\n  /**\n   * A throttle time in ms for readystatechange events for the backchannel.\n   * Useful for throttling when ready state is INTERACTIVE (partial data).\n   * If set to zero no throttle is used.\n   *\n   * See WebChannelBase.prototype.readyStateChangeThrottleMs_\n   *\n   * @private {number}\n   */\n  this.readyStateChangeThrottleMs_ = 0;\n\n  /**\n   * The throttle for readystatechange events for the current request, or null\n   * if there is none.\n   * @private {?goog.async.Throttle}\n   */\n  this.readyStateChangeThrottle_ = null;\n\n  /**\n   * Whether to the result is expected to be encoded for chunking and thus\n   * requires decoding.\n   * @private {boolean}\n   */\n  this.decodeChunks_ = false;\n\n  /**\n   * Whether to decode x-http-initial-response.\n   * @private {boolean}\n   */\n  this.decodeInitialResponse_ = false;\n\n  /**\n   * Whether x-http-initial-response has been decoded (dispatched).\n   * @private {boolean}\n   */\n  this.initialResponseDecoded_ = false;\n\n  /**\n   * Whether the first byte of response body has arrived, for a successful\n   * response.\n   * @private {boolean}\n   */\n  this.firstByteReceived_ = false;\n\n  /**\n   * The current state of fetch responses if webchannel is using WHATWG\n   * fetch/streams.\n   * @private {!goog.labs.net.webChannel.FetchResponseState}\n   */\n  this.fetchResponseState_ = new goog.labs.net.webChannel.FetchResponseState();\n};\n\n/**\n * A collection of fetch/stream properties.\n * @struct\n * @constructor\n */\ngoog.labs.net.webChannel.FetchResponseState = function() {\n  'use strict';\n  /**\n   * The TextDecoder for decoding Uint8Array responses from fetch request.\n   * @type {?goog.global.TextDecoder}\n   */\n  this.textDecoder = null;\n\n  /**\n   * The unconsumed response text from the fetch requests.\n   * @type {string}\n   */\n  this.responseBuffer = '';\n\n  /**\n   * Whether or not the response body has arrived.\n   * @type {boolean}\n   */\n  this.responseArrivedForFetch = false;\n};\n\n\ngoog.scope(function() {\n'use strict';\nconst WebChannel = goog.net.WebChannel;\nconst Channel = goog.labs.net.webChannel.Channel;\nconst ChannelRequest = goog.labs.net.webChannel.ChannelRequest;\nconst FetchResponseState = goog.labs.net.webChannel.FetchResponseState;\nconst requestStats = goog.labs.net.webChannel.requestStats;\nconst WebChannelDebug = goog.labs.net.webChannel.WebChannelDebug;\nconst environment = goog.labs.net.webChannel.environment;\n\n/**\n * Default timeout in MS for a request. The server must return data within this\n * time limit for the request to not timeout.\n * @private {number}\n */\nChannelRequest.TIMEOUT_MS_ = 45 * 1000;\n\n\n/**\n * Enum for channel requests type\n * @enum {number}\n * @private\n */\nChannelRequest.Type_ = {\n  /**\n   * XMLHTTP requests.\n   */\n  XML_HTTP: 1,\n\n  /**\n   * IMG requests.\n   */\n  CLOSE_REQUEST: 2\n};\n\n\n/**\n * Enum type for identifying an error.\n * @enum {number}\n */\nChannelRequest.Error = {\n  /**\n   * Errors due to a non-200 status code.\n   */\n  STATUS: 0,\n\n  /**\n   * Errors due to no data being returned.\n   */\n  NO_DATA: 1,\n\n  /**\n   * Errors due to a timeout.\n   */\n  TIMEOUT: 2,\n\n  /**\n   * Errors due to the server returning an unknown.\n   */\n  UNKNOWN_SESSION_ID: 3,\n\n  /**\n   * Errors due to bad data being received.\n   */\n  BAD_DATA: 4,\n\n  /**\n   * Errors due to the handler throwing an exception.\n   */\n  HANDLER_EXCEPTION: 5,\n\n  /**\n   * The browser declared itself offline during the request.\n   */\n  BROWSER_OFFLINE: 6\n};\n\n\n/**\n * Returns a useful error string for debugging based on the specified error\n * code.\n * @param {?ChannelRequest.Error} errorCode The error code.\n * @param {number} statusCode The HTTP status code.\n * @return {string} The error string for the given code combination.\n */\nChannelRequest.errorStringFromCode = function(errorCode, statusCode) {\n  'use strict';\n  switch (errorCode) {\n    case ChannelRequest.Error.STATUS:\n      return 'Non-200 return code (' + statusCode + ')';\n    case ChannelRequest.Error.NO_DATA:\n      return 'XMLHTTP failure (no data)';\n    case ChannelRequest.Error.TIMEOUT:\n      return 'HttpConnection timeout';\n    default:\n      return 'Unknown error';\n  }\n};\n\n\n/**\n * Sentinel value used to indicate an invalid chunk in a multi-chunk response.\n * @private {!Object}\n */\nChannelRequest.INVALID_CHUNK_ = {};\n\n\n/**\n * Sentinel value used to indicate an incomplete chunk in a multi-chunk\n * response.\n * @private {!Object}\n */\nChannelRequest.INCOMPLETE_CHUNK_ = {};\n\n\n/**\n * Returns whether XHR streaming is supported on this browser.\n *\n * @return {boolean} Whether XHR streaming is supported.\n * @see http://code.google.com/p/closure-library/issues/detail?id=346\n */\nChannelRequest.supportsXhrStreaming = function() {\n  'use strict';\n  return !goog.userAgent.IE || goog.userAgent.isDocumentModeOrHigher(10);\n};\n\n\n/**\n * Sets extra HTTP headers to add to all the requests sent to the server.\n *\n * @param {Object} extraHeaders The HTTP headers.\n */\nChannelRequest.prototype.setExtraHeaders = function(extraHeaders) {\n  'use strict';\n  this.extraHeaders_ = extraHeaders;\n};\n\n\n/**\n * Overrides the default HTTP method.\n *\n * @param {string} verb The HTTP method\n */\nChannelRequest.prototype.setVerb = function(verb) {\n  'use strict';\n  this.verb_ = verb;\n};\n\n\n/**\n * Sets the timeout for a request\n *\n * @param {number} timeout   The timeout in MS for when we fail the request.\n */\nChannelRequest.prototype.setTimeout = function(timeout) {\n  'use strict';\n  this.timeout_ = timeout;\n};\n\n\n/**\n * Sets the throttle for handling onreadystatechange events for the request.\n *\n * @param {number} throttle The throttle in ms.  A value of zero indicates\n *     no throttle.\n */\nChannelRequest.prototype.setReadyStateChangeThrottle = function(throttle) {\n  'use strict';\n  this.readyStateChangeThrottleMs_ = throttle;\n};\n\n\n/**\n * Sets the pending messages that this request is handling.\n *\n * @param {!Array<goog.labs.net.webChannel.Wire.QueuedMap>} pendingMessages\n *     The pending messages for this request.\n */\nChannelRequest.prototype.setPendingMessages = function(pendingMessages) {\n  'use strict';\n  this.pendingMessages_ = pendingMessages;\n};\n\n\n/**\n * Gets the pending messages that this request is handling, in case of a retry.\n *\n * @return {!Array<goog.labs.net.webChannel.Wire.QueuedMap>} The pending\n *     messages for this request.\n */\nChannelRequest.prototype.getPendingMessages = function() {\n  'use strict';\n  return this.pendingMessages_;\n};\n\n\n/**\n * Uses XMLHTTP to send an HTTP POST to the server.\n *\n * @param {goog.Uri} uri  The uri of the request.\n * @param {?string} postData  The data for the post body.\n * @param {boolean} decodeChunks  Whether to the result is expected to be\n *     encoded for chunking and thus requires decoding.\n */\nChannelRequest.prototype.xmlHttpPost = function(uri, postData, decodeChunks) {\n  'use strict';\n  this.type_ = ChannelRequest.Type_.XML_HTTP;\n  this.baseUri_ = uri.clone().makeUnique();\n  this.postData_ = postData;\n  this.decodeChunks_ = decodeChunks;\n  this.sendXmlHttp_(null /* hostPrefix */);\n};\n\n\n/**\n * Uses XMLHTTP to send an HTTP GET to the server.\n *\n * @param {goog.Uri} uri  The uri of the request.\n * @param {boolean} decodeChunks  Whether to the result is expected to be\n *     encoded for chunking and thus requires decoding.\n * @param {?string} hostPrefix  The host prefix, if we might be using a\n *     secondary domain.  Note that it should also be in the URL, adding this\n *     won't cause it to be added to the URL.\n */\nChannelRequest.prototype.xmlHttpGet = function(uri, decodeChunks, hostPrefix) {\n  'use strict';\n  this.type_ = ChannelRequest.Type_.XML_HTTP;\n  this.baseUri_ = uri.clone().makeUnique();\n  this.postData_ = null;\n  this.decodeChunks_ = decodeChunks;\n\n  this.sendXmlHttp_(hostPrefix);\n};\n\n\n/**\n * Sends a request via XMLHTTP according to the current state of the request\n * object.\n *\n * @param {?string} hostPrefix The host prefix, if we might be using a secondary\n *     domain.\n * @private\n */\nChannelRequest.prototype.sendXmlHttp_ = function(hostPrefix) {\n  'use strict';\n  this.requestStartTime_ = Date.now();\n  this.ensureWatchDogTimer_();\n\n  // clone the base URI to create the request URI. The request uri has the\n  // attempt number as a parameter which helps in debugging.\n  this.requestUri_ = this.baseUri_.clone();\n  this.requestUri_.setParameterValues('t', this.retryId_);\n\n  // send the request either as a POST or GET\n  this.xmlHttpChunkStart_ = 0;\n  const useSecondaryDomains = this.channel_.shouldUseSecondaryDomains();\n  this.fetchResponseState_ = new FetchResponseState();\n  // If the request is a GET request, start a backchannel to transfer streaming\n  // data. Note that WebChannel GET request can also be used for closing the\n  // channel as in method ChannelRequest#sendCloseRequest.\n  // The second parameter of Channel#createXhrIo is JS only.\n  this.xmlHttp_ = this.channel_.createXhrIo(\n      useSecondaryDomains ? hostPrefix : null, !this.postData_);\n\n  if (this.readyStateChangeThrottleMs_ > 0) {\n    this.readyStateChangeThrottle_ = new goog.async.Throttle(\n        goog.bind(this.xmlHttpHandler_, this, this.xmlHttp_),\n        this.readyStateChangeThrottleMs_);\n  }\n\n  this.eventHandler_.listen(\n      this.xmlHttp_, goog.net.EventType.READY_STATE_CHANGE,\n      this.readyStateChangeHandler_);\n\n  const headers =\n      this.extraHeaders_ ? goog.object.clone(this.extraHeaders_) : {};\n  if (this.postData_) {\n    if (!this.verb_) {\n      this.verb_ = 'POST';\n    }\n    headers['Content-Type'] = 'application/x-www-form-urlencoded';\n    this.xmlHttp_.send(this.requestUri_, this.verb_, this.postData_, headers);\n  } else {\n    this.verb_ = 'GET';\n    this.xmlHttp_.send(this.requestUri_, this.verb_, null, headers);\n  }\n  requestStats.notifyServerReachabilityEvent(\n      requestStats.ServerReachability.REQUEST_MADE);\n  this.channelDebug_.xmlHttpChannelRequest(\n      this.verb_, this.requestUri_, this.rid_, this.retryId_, this.postData_);\n};\n\n\n/**\n * Handles a readystatechange event.\n * @param {goog.events.Event} evt The event.\n * @private\n */\nChannelRequest.prototype.readyStateChangeHandler_ = function(evt) {\n  'use strict';\n  const xhr = /** @type {goog.net.XhrIo} */ (evt.target);\n  const throttle = this.readyStateChangeThrottle_;\n  if (throttle &&\n      xhr.getReadyState() == goog.net.XmlHttp.ReadyState.INTERACTIVE) {\n    // Only throttle in the partial data case.\n    this.channelDebug_.debug('Throttling readystatechange.');\n    throttle.fire();\n  } else {\n    // If we haven't throttled, just handle response directly.\n    this.xmlHttpHandler_(xhr);\n  }\n};\n\n\n/**\n * XmlHttp handler\n * @param {goog.net.XhrIo} xmlhttp The XhrIo object for the current request.\n * @private\n */\nChannelRequest.prototype.xmlHttpHandler_ = function(xmlhttp) {\n  'use strict';\n  requestStats.onStartExecution();\n\n  try {\n    if (xmlhttp == this.xmlHttp_) {\n      this.onXmlHttpReadyStateChanged_();\n    } else {\n      this.channelDebug_.warning(\n          'Called back with an ' +\n          'unexpected xmlhttp');\n    }\n  } catch (ex) {\n    this.channelDebug_.debug('Failed call to OnXmlHttpReadyStateChanged_');\n    if (this.hasResponseBody_()) {\n      const channelRequest = this;\n      this.channelDebug_.dumpException(ex, function() {\n        'use strict';\n        return 'ResponseText: ' + channelRequest.xmlHttp_.getResponseText();\n      });\n    } else {\n      this.channelDebug_.dumpException(ex, 'No response text');\n    }\n  } finally {\n    requestStats.onEndExecution();\n  }\n};\n\n\n/**\n * Called by the readystate handler for XMLHTTP requests.\n *\n * @private\n */\nChannelRequest.prototype.onXmlHttpReadyStateChanged_ = function() {\n  'use strict';\n  const readyState = this.xmlHttp_.getReadyState();\n  const errorCode = this.xmlHttp_.getLastErrorCode();\n  const statusCode = this.xmlHttp_.getStatus();\n\n  // we get partial results in browsers that support ready state interactive.\n  // We also make sure that getResponseText is not null in interactive mode\n  // before we continue.\n  if (readyState < goog.net.XmlHttp.ReadyState.INTERACTIVE ||\n      (readyState == goog.net.XmlHttp.ReadyState.INTERACTIVE &&\n       !environment.isPollingRequired() &&  // otherwise, go on to startPolling\n       !this.hasResponseBody_())) {\n    return;  // not yet ready\n  }\n\n  // Dispatch any appropriate network events.\n  if (!this.cancelled_ && readyState == goog.net.XmlHttp.ReadyState.COMPLETE &&\n      errorCode != goog.net.ErrorCode.ABORT) {\n    // Pretty conservative, these are the only known scenarios which we'd\n    // consider indicative of a truly non-functional network connection.\n    if (errorCode == goog.net.ErrorCode.TIMEOUT || statusCode <= 0) {\n      requestStats.notifyServerReachabilityEvent(\n          requestStats.ServerReachability.REQUEST_FAILED);\n    } else {\n      requestStats.notifyServerReachabilityEvent(\n          requestStats.ServerReachability.REQUEST_SUCCEEDED);\n    }\n  }\n\n  // got some data so cancel the watchdog timer\n  this.cancelWatchDogTimer_();\n\n  const status = this.xmlHttp_.getStatus();\n  this.lastStatusCode_ = status;\n  const responseText = this.decodeXmlHttpResponse_();\n\n  if (!this.hasResponseBody_()) {\n    const channelRequest = this;\n    this.channelDebug_.debug(function() {\n      'use strict';\n      return 'No response text for uri ' + channelRequest.requestUri_ +\n          ' status ' + status;\n    });\n  }\n  this.successful_ = (status == 200);\n\n  this.channelDebug_.xmlHttpChannelResponseMetaData(\n      /** @type {string} */ (this.verb_), this.requestUri_, this.rid_,\n      this.retryId_, readyState, status);\n\n  if (!this.successful_) {\n    if (status == 400 && responseText.indexOf('Unknown SID') > 0) {\n      // the server error string will include 'Unknown SID' which indicates the\n      // server doesn't know about the session (maybe it got restarted, maybe\n      // the user got moved to another server, etc.,). Handlers can special\n      // case this error\n      this.lastError_ = ChannelRequest.Error.UNKNOWN_SESSION_ID;\n      requestStats.notifyStatEvent(\n          requestStats.Stat.REQUEST_UNKNOWN_SESSION_ID);\n      this.channelDebug_.warning('XMLHTTP Unknown SID (' + this.rid_ + ')');\n    } else {\n      this.lastError_ = ChannelRequest.Error.STATUS;\n      requestStats.notifyStatEvent(requestStats.Stat.REQUEST_BAD_STATUS);\n      this.channelDebug_.warning(\n          'XMLHTTP Bad status ' + status + ' (' + this.rid_ + ')');\n    }\n    this.cleanup_();\n    this.dispatchFailure_();\n    return;\n  }\n\n  if (this.shouldCheckInitialResponse_()) {\n    const initialResponse = this.getInitialResponse_();\n    if (initialResponse) {\n      this.channelDebug_.xmlHttpChannelResponseText(\n          this.rid_, initialResponse,\n          'Initial handshake response via ' +\n              WebChannel.X_HTTP_INITIAL_RESPONSE);\n      this.initialResponseDecoded_ = true;\n      this.safeOnRequestData_(initialResponse);\n    } else {\n      this.successful_ = false;\n      this.lastError_ = ChannelRequest.Error.UNKNOWN_SESSION_ID;  // fail-fast\n      requestStats.notifyStatEvent(\n          requestStats.Stat.REQUEST_UNKNOWN_SESSION_ID);\n      this.channelDebug_.warning(\n          'XMLHTTP Missing X_HTTP_INITIAL_RESPONSE' +\n          ' (' + this.rid_ + ')');\n      this.cleanup_();\n      this.dispatchFailure_();\n      return;\n    }\n  }\n\n  if (this.decodeChunks_) {\n    this.decodeNextChunks_(readyState, responseText);\n    if (environment.isPollingRequired() && this.successful_ &&\n        readyState == goog.net.XmlHttp.ReadyState.INTERACTIVE) {\n      this.startPolling_();\n    }\n  } else {\n    this.channelDebug_.xmlHttpChannelResponseText(\n        this.rid_, responseText, null);\n    this.safeOnRequestData_(responseText);\n  }\n\n  if (readyState == goog.net.XmlHttp.ReadyState.COMPLETE) {\n    this.cleanup_();\n  }\n\n  if (!this.successful_) {\n    return;\n  }\n\n  if (!this.cancelled_) {\n    if (readyState == goog.net.XmlHttp.ReadyState.COMPLETE) {\n      this.channel_.onRequestComplete(this);\n    } else {\n      // The default is false, the result from this callback shouldn't carry\n      // over to the next callback, otherwise the request looks successful if\n      // the watchdog timer gets called\n      this.successful_ = false;\n      this.ensureWatchDogTimer_();\n    }\n  }\n};\n\n\n/**\n * Whether we need check the initial-response header that is sent during the\n * fast handshake.\n *\n * @return {boolean} true if the initial-response header is yet to be processed.\n * @private\n */\nChannelRequest.prototype.shouldCheckInitialResponse_ = function() {\n  'use strict';\n  return this.decodeInitialResponse_ && !this.initialResponseDecoded_;\n};\n\n\n/**\n * Queries the initial response header that is sent during the handshake.\n *\n * @return {?string} The non-empty header value or null.\n * @private\n */\nChannelRequest.prototype.getInitialResponse_ = function() {\n  'use strict';\n  if (this.xmlHttp_) {\n    const value = this.xmlHttp_.getStreamingResponseHeader(\n        WebChannel.X_HTTP_INITIAL_RESPONSE);\n    if (value && !goog.string.isEmptyOrWhitespace(value)) {\n      return value;\n    }\n  }\n\n  return null;\n};\n\n\n/**\n * Check if the initial response header has been handled.\n *\n * @return {boolean} true if X_HTTP_INITIAL_RESPONSE has been handled.\n */\nChannelRequest.prototype.isInitialResponseDecoded = function() {\n  'use strict';\n  return this.initialResponseDecoded_;\n};\n\n\n/**\n * Decodes X_HTTP_INITIAL_RESPONSE if present.\n */\nChannelRequest.prototype.setDecodeInitialResponse = function() {\n  'use strict';\n  this.decodeInitialResponse_ = true;\n};\n\n\n\n/**\n * Decodes the responses from XhrIo object.\n * @returns {string} responseText\n * @private\n */\nChannelRequest.prototype.decodeXmlHttpResponse_ = function() {\n  'use strict';\n  if (!this.useFetchStreamsForResponse_()) {\n    return this.xmlHttp_.getResponseText();\n  }\n  const responseChunks =\n      /** @type {!Array<!Uint8Array>} */ (this.xmlHttp_.getResponse());\n  let responseText = '';\n  const responseLength = responseChunks.length;\n  const requestCompleted =\n      this.xmlHttp_.getReadyState() == goog.net.XmlHttp.ReadyState.COMPLETE;\n  if (!this.fetchResponseState_.textDecoder) {\n    if (typeof TextDecoder === 'undefined') {\n      this.channelDebug_.severe(\n          'TextDecoder is not supported by this browser.');\n      this.cleanup_();\n      this.dispatchFailure_();\n      return '';\n    }\n    this.fetchResponseState_.textDecoder = new goog.global.TextDecoder();\n  }\n  for (let i = 0; i < responseLength; i++) {\n    this.fetchResponseState_.responseArrivedForFetch = true;\n    const isLastChunk = requestCompleted && i == responseLength - 1;\n    responseText += this.fetchResponseState_.textDecoder.decode(\n        responseChunks[i], {stream: isLastChunk});\n  }\n  responseChunks.splice(0, responseLength);\n  this.fetchResponseState_.responseBuffer += responseText;\n  this.xmlHttpChunkStart_ = 0;\n  return this.fetchResponseState_.responseBuffer;\n};\n\n\n/**\n * Whether or not the response has response body.\n * @private\n * @returns {boolean}\n */\nChannelRequest.prototype.hasResponseBody_ = function() {\n  'use strict';\n  if (!this.xmlHttp_) {\n    return false;\n  }\n  if (this.fetchResponseState_.responseArrivedForFetch) {\n    return true;\n  }\n  return !(!this.xmlHttp_.getResponseText() && !this.xmlHttp_.getResponse());\n};\n\n/**\n * Whether or not the response body is streamed.\n * @private\n * @returns {boolean}\n */\nChannelRequest.prototype.useFetchStreamsForResponse_ = function() {\n  'use strict';\n  if (!this.xmlHttp_) {\n    return false;\n  }\n  return (\n      this.verb_ == 'GET' && this.type_ != ChannelRequest.Type_.CLOSE_REQUEST &&\n      this.channel_.usesFetchStreams());\n};\n\n\n/**\n * Resets the response buffer if the saved chunk has been processed.\n * @private\n * @param {string|!Object|undefined} chunkText\n */\nChannelRequest.prototype.maybeResetBuffer_ = function(chunkText) {\n  'use strict';\n  if (this.useFetchStreamsForResponse_() &&\n      chunkText != ChannelRequest.INCOMPLETE_CHUNK_ &&\n      chunkText != ChannelRequest.INVALID_CHUNK_) {\n    this.fetchResponseState_.responseBuffer = '';\n    this.xmlHttpChunkStart_ = 0;\n  }\n};\n\n\n/**\n * Decodes the next set of available chunks in the response.\n * @param {number} readyState The value of readyState.\n * @param {string} responseText The value of responseText.\n * @private\n */\nChannelRequest.prototype.decodeNextChunks_ = function(\n    readyState, responseText) {\n  'use strict';\n  let decodeNextChunksSuccessful = true;\n\n  let chunkText;\n  while (!this.cancelled_ && this.xmlHttpChunkStart_ < responseText.length) {\n    chunkText = this.getNextChunk_(responseText);\n    if (chunkText == ChannelRequest.INCOMPLETE_CHUNK_) {\n      if (readyState == goog.net.XmlHttp.ReadyState.COMPLETE) {\n        // should have consumed entire response when the request is done\n        this.lastError_ = ChannelRequest.Error.BAD_DATA;\n        requestStats.notifyStatEvent(requestStats.Stat.REQUEST_INCOMPLETE_DATA);\n        decodeNextChunksSuccessful = false;\n      }\n      this.channelDebug_.xmlHttpChannelResponseText(\n          this.rid_, null, '[Incomplete Response]');\n      break;\n    } else if (chunkText == ChannelRequest.INVALID_CHUNK_) {\n      this.lastError_ = ChannelRequest.Error.BAD_DATA;\n      requestStats.notifyStatEvent(requestStats.Stat.REQUEST_BAD_DATA);\n      this.channelDebug_.xmlHttpChannelResponseText(\n          this.rid_, responseText, '[Invalid Chunk]');\n      decodeNextChunksSuccessful = false;\n      break;\n    } else {\n      this.channelDebug_.xmlHttpChannelResponseText(\n          this.rid_, /** @type {string} */ (chunkText), null);\n      this.safeOnRequestData_(/** @type {string} */ (chunkText));\n    }\n  }\n\n  this.maybeResetBuffer_(chunkText);\n\n  if (readyState == goog.net.XmlHttp.ReadyState.COMPLETE &&\n      responseText.length == 0 &&\n      !this.fetchResponseState_.responseArrivedForFetch) {\n    // also an error if we didn't get any response\n    this.lastError_ = ChannelRequest.Error.NO_DATA;\n    requestStats.notifyStatEvent(requestStats.Stat.REQUEST_NO_DATA);\n    decodeNextChunksSuccessful = false;\n  }\n\n  this.successful_ = this.successful_ && decodeNextChunksSuccessful;\n\n  if (!decodeNextChunksSuccessful) {\n    // malformed response - we make this trigger retry logic\n    this.channelDebug_.xmlHttpChannelResponseText(\n        this.rid_, responseText, '[Invalid Chunked Response]');\n    this.cleanup_();\n    this.dispatchFailure_();\n  } else {\n    if (responseText.length > 0 && !this.firstByteReceived_) {\n      this.firstByteReceived_ = true;\n      this.channel_.onFirstByteReceived(this, responseText);\n    }\n  }\n};\n\n\n/**\n * Polls the response for new data.\n * @private\n */\nChannelRequest.prototype.pollResponse_ = function() {\n  'use strict';\n  if (!this.xmlHttp_) {\n    return;  // already closed\n  }\n  const readyState = this.xmlHttp_.getReadyState();\n  const responseText = this.xmlHttp_.getResponseText();\n  if (this.xmlHttpChunkStart_ < responseText.length) {\n    this.cancelWatchDogTimer_();\n    this.decodeNextChunks_(readyState, responseText);\n    if (this.successful_ &&\n        readyState != goog.net.XmlHttp.ReadyState.COMPLETE) {\n      this.ensureWatchDogTimer_();\n    }\n  }\n};\n\n\n/**\n * Starts a polling interval for changes to responseText of the\n * XMLHttpRequest, for browsers that don't fire onreadystatechange\n * as data comes in incrementally.  This timer is disabled in\n * cleanup_().\n * @private\n */\nChannelRequest.prototype.startPolling_ = function() {\n  'use strict';\n  this.eventHandler_.listen(\n      this.pollingTimer_, goog.Timer.TICK, this.pollResponse_);\n  this.pollingTimer_.start();\n};\n\n\n/**\n * Returns the next chunk of a chunk-encoded response. This is not standard\n * HTTP chunked encoding because browsers don't expose the chunk boundaries to\n * the application through XMLHTTP. So we have an additional chunk encoding at\n * the application level that lets us tell where the beginning and end of\n * individual responses are so that we can only try to eval a complete JS array.\n *\n * The encoding is the size of the chunk encoded as a decimal string followed\n * by a newline followed by the data.\n *\n * @param {string} responseText The response text from the XMLHTTP response.\n * @return {string|!Object} The next chunk string or a sentinel object\n *                         indicating a special condition.\n * @private\n */\nChannelRequest.prototype.getNextChunk_ = function(responseText) {\n  'use strict';\n  const sizeStartIndex = this.xmlHttpChunkStart_;\n  const sizeEndIndex = responseText.indexOf('\\n', sizeStartIndex);\n  if (sizeEndIndex == -1) {\n    return ChannelRequest.INCOMPLETE_CHUNK_;\n  }\n\n  const sizeAsString = responseText.substring(sizeStartIndex, sizeEndIndex);\n  const size = Number(sizeAsString);\n  if (isNaN(size)) {\n    return ChannelRequest.INVALID_CHUNK_;\n  }\n\n  const chunkStartIndex = sizeEndIndex + 1;\n  if (chunkStartIndex + size > responseText.length) {\n    return ChannelRequest.INCOMPLETE_CHUNK_;\n  }\n\n  const chunkText = responseText.substr(chunkStartIndex, size);\n  this.xmlHttpChunkStart_ = chunkStartIndex + size;\n  return chunkText;\n};\n\n\n/**\n * Uses an IMG tag or navigator.sendBeacon to send an HTTP get to the server.\n *\n * This is only currently used to terminate the connection, as an IMG tag is\n * the most reliable way to send something to the server while the page\n * is getting torn down.\n *\n * Navigator.sendBeacon is available on Chrome and Firefox as a formal\n * solution to ensure delivery without blocking window close. See\n * https://developer.mozilla.org/en-US/docs/Web/API/Navigator/sendBeacon\n *\n * For Chrome Apps, sendBeacon is always necessary due to Content Security\n * Policy (CSP) violation of using an IMG tag.\n *\n * For react-native, we use xhr to send the actual close request, and assume\n * there is no page-close issue with react-native.\n *\n * @param {goog.Uri} uri The uri to send a request to.\n */\nChannelRequest.prototype.sendCloseRequest = function(uri) {\n  'use strict';\n  this.type_ = ChannelRequest.Type_.CLOSE_REQUEST;\n  this.baseUri_ = uri.clone().makeUnique();\n\n  let requestSent = false;\n\n  if (goog.global.navigator && goog.global.navigator.sendBeacon) {\n    // empty string body to avoid 413 error on chrome < 41\n    requestSent =\n        goog.global.navigator.sendBeacon(this.baseUri_.toString(), '');\n  }\n\n  if (!requestSent && goog.global.Image) {\n    const eltImg = new Image();\n    eltImg.src = this.baseUri_;\n    requestSent = true;\n  }\n\n  if (!requestSent) {\n    // no handler is set to match the sendBeacon/Image behavior\n    this.xmlHttp_ = this.channel_.createXhrIo(null);\n    this.xmlHttp_.send(this.baseUri_);\n  }\n\n  this.requestStartTime_ = Date.now();\n  this.ensureWatchDogTimer_();\n};\n\n\n/**\n * Cancels the request no matter what the underlying transport is.\n */\nChannelRequest.prototype.cancel = function() {\n  'use strict';\n  this.cancelled_ = true;\n  this.cleanup_();\n};\n\n\n/**\n * Resets the timeout.\n *\n * @param {number=} opt_timeout The new timeout\n */\nChannelRequest.prototype.resetTimeout = function(opt_timeout) {\n  'use strict';\n  if (opt_timeout) {\n    this.setTimeout(opt_timeout);\n  }\n  // restart only if a timer is currently set\n  if (this.watchDogTimerId_) {\n    this.cancelWatchDogTimer_();\n    this.ensureWatchDogTimer_();\n  }\n};\n\n\n/**\n * Ensures that there is watchdog timeout which is used to ensure that\n * the connection completes in time.\n *\n * @private\n */\nChannelRequest.prototype.ensureWatchDogTimer_ = function() {\n  'use strict';\n  this.watchDogTimeoutTime_ = Date.now() + this.timeout_;\n  this.startWatchDogTimer_(this.timeout_);\n};\n\n\n/**\n * Starts the watchdog timer which is used to ensure that the connection\n * completes in time.\n * @param {number} time The number of milliseconds to wait.\n * @private\n */\nChannelRequest.prototype.startWatchDogTimer_ = function(time) {\n  'use strict';\n  if (this.watchDogTimerId_ != null) {\n    // assertion\n    throw new Error('WatchDog timer not null');\n  }\n  this.watchDogTimerId_ =\n      requestStats.setTimeout(goog.bind(this.onWatchDogTimeout_, this), time);\n};\n\n\n/**\n * Cancels the watchdog timer if it has been started.\n *\n * @private\n */\nChannelRequest.prototype.cancelWatchDogTimer_ = function() {\n  'use strict';\n  if (this.watchDogTimerId_) {\n    goog.global.clearTimeout(this.watchDogTimerId_);\n    this.watchDogTimerId_ = null;\n  }\n};\n\n\n/**\n * Called when the watchdog timer is triggered. It also handles a case where it\n * is called too early which we suspect may be happening sometimes\n * (not sure why)\n *\n * @private\n */\nChannelRequest.prototype.onWatchDogTimeout_ = function() {\n  'use strict';\n  this.watchDogTimerId_ = null;\n  const now = Date.now();\n  goog.asserts.assert(\n      this.watchDogTimeoutTime_, 'WatchDog timeout time missing?');\n  if (now - this.watchDogTimeoutTime_ >= 0) {\n    this.handleTimeout_();\n  } else {\n    // got called too early for some reason\n    this.channelDebug_.warning('WatchDog timer called too early');\n    this.startWatchDogTimer_(this.watchDogTimeoutTime_ - now);\n  }\n};\n\n\n/**\n * Called when the request has actually timed out. Will cleanup and notify the\n * channel of the failure.\n *\n * @private\n */\nChannelRequest.prototype.handleTimeout_ = function() {\n  'use strict';\n  if (this.successful_) {\n    // Should never happen.\n    this.channelDebug_.severe(\n        'Received watchdog timeout even though request loaded successfully');\n  }\n\n  this.channelDebug_.timeoutResponse(this.requestUri_);\n\n  // IMG or SendBeacon requests never notice if they were successful,\n  // and always 'time out'. This fact says nothing about reachability.\n  if (this.type_ != ChannelRequest.Type_.CLOSE_REQUEST) {\n    requestStats.notifyServerReachabilityEvent(\n        requestStats.ServerReachability.REQUEST_FAILED);\n    requestStats.notifyStatEvent(requestStats.Stat.REQUEST_TIMEOUT);\n  }\n\n  this.cleanup_();\n\n  // Set error and dispatch failure.\n  // This is called for CLOSE_REQUEST too to ensure channel_.onRequestComplete.\n  this.lastError_ = ChannelRequest.Error.TIMEOUT;\n  this.dispatchFailure_();\n};\n\n\n/**\n * Notifies the channel that this request failed.\n * @private\n */\nChannelRequest.prototype.dispatchFailure_ = function() {\n  'use strict';\n  if (this.channel_.isClosed() || this.cancelled_) {\n    return;\n  }\n\n  this.channel_.onRequestComplete(this);\n};\n\n\n/**\n * Cleans up the objects used to make the request. This function is\n * idempotent.\n *\n * @private\n */\nChannelRequest.prototype.cleanup_ = function() {\n  'use strict';\n  this.cancelWatchDogTimer_();\n\n  goog.dispose(this.readyStateChangeThrottle_);\n  this.readyStateChangeThrottle_ = null;\n\n  // Stop the polling timer, if necessary.\n  this.pollingTimer_.stop();\n\n  // Unhook all event handlers.\n  this.eventHandler_.removeAll();\n\n  if (this.xmlHttp_) {\n    // clear out this.xmlHttp_ before aborting so we handle getting reentered\n    // inside abort\n    const xmlhttp = this.xmlHttp_;\n    this.xmlHttp_ = null;\n    xmlhttp.abort();\n    xmlhttp.dispose();\n  }\n};\n\n\n/**\n * Indicates whether the request was successful. Only valid after the handler\n * is called to indicate completion of the request.\n *\n * @return {boolean} True if the request succeeded.\n */\nChannelRequest.prototype.getSuccess = function() {\n  'use strict';\n  return this.successful_;\n};\n\n\n/**\n * If the request was not successful, returns the reason.\n *\n * @return {?ChannelRequest.Error}  The last error.\n */\nChannelRequest.prototype.getLastError = function() {\n  'use strict';\n  return this.lastError_;\n};\n\n\n/**\n * Returns the status code of the last request.\n * @return {number} The status code of the last request.\n */\nChannelRequest.prototype.getLastStatusCode = function() {\n  'use strict';\n  return this.lastStatusCode_;\n};\n\n\n/**\n * Returns the session id for this channel.\n *\n * @return {string|undefined} The session ID.\n */\nChannelRequest.prototype.getSessionId = function() {\n  'use strict';\n  return this.sid_;\n};\n\n\n/**\n * Returns the request id for this request. Each request has a unique request\n * id and the request IDs are a sequential increasing count.\n *\n * @return {string|number|undefined} The request ID.\n */\nChannelRequest.prototype.getRequestId = function() {\n  'use strict';\n  return this.rid_;\n};\n\n\n/**\n * Returns the data for a post, if this request is a post.\n *\n * @return {?string} The POST data provided by the request initiator.\n */\nChannelRequest.prototype.getPostData = function() {\n  'use strict';\n  return this.postData_;\n};\n\n\n/**\n * Returns the XhrIo request object.\n *\n * @return {?goog.net.XhrIo} Any XhrIo request created for this object.\n */\nChannelRequest.prototype.getXhr = function() {\n  'use strict';\n  return this.xmlHttp_;\n};\n\n\n/**\n * Returns the time that the request started, if it has started.\n *\n * @return {?number} The time the request started, as returned by Date.now().\n */\nChannelRequest.prototype.getRequestStartTime = function() {\n  'use strict';\n  return this.requestStartTime_;\n};\n\n\n/**\n * Helper to call the callback's onRequestData, which catches any\n * exception.\n * @param {string} data The request data.\n * @private\n */\nChannelRequest.prototype.safeOnRequestData_ = function(data) {\n  'use strict';\n  try {\n    this.channel_.onRequestData(this, data);\n    const stats = requestStats.ServerReachability;\n    requestStats.notifyServerReachabilityEvent(stats.BACK_CHANNEL_ACTIVITY);\n  } catch (e) {\n    // Dump debug info, but keep going without closing the channel.\n    this.channelDebug_.dumpException(e, 'Error in httprequest callback');\n  }\n};\n\n\n/**\n * Convenience factory method.\n *\n * @param {Channel} channel The channel object that owns this request.\n * @param {WebChannelDebug} channelDebug A WebChannelDebug to use for logging.\n * @param {string=} opt_sessionId  The session id for the channel.\n * @param {string|number=} opt_requestId  The request id for this request.\n * @param {number=} opt_retryId  The retry id for this request.\n * @return {!ChannelRequest} The created channel request.\n */\nChannelRequest.createChannelRequest = function(\n    channel, channelDebug, opt_sessionId, opt_requestId, opt_retryId) {\n  'use strict';\n  return new ChannelRequest(\n      channel, channelDebug, opt_sessionId, opt_requestId, opt_retryId);\n};\n});  // goog.scope\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview A single module to define user-agent specific environment\n * details.\n *\n */\n\ngoog.module('goog.labs.net.webChannel.environment');\n\ngoog.module.declareLegacyNamespace();\n\nvar userAgent = goog.require('goog.userAgent');\n\n\n/**\n * The default polling interval in millis for Edge.\n *\n * Currently on edge, new-chunk events may be not be fired (at all) if a new\n * chunk arrives within 50ms following the previous chunk. This may be fixed\n * in future, which requires changes to the whatwg spec too.\n *\n * @private @const {number}\n */\nvar EDGE_POLLING_INTERVAL_ = 125;\n\n\n/**\n * History:\n *\n * IE11 is still using Trident, the traditional engine for IE.\n * Edge is using EdgeHTML, a fork of Trident. We are seeing the same issue\n * on IE-11 (reported in 2017), so treat IE the same as Edge for now.\n *\n * We used to do polling for Opera (only) with an 250ms interval, because Opera\n * only fires readyState == INTERACTIVE once. Opera switched to WebKit in 2013,\n * and then to Blink (chrome).\n *\n * TODO(user): check the raw UA string to keep polling for old, mobile operas\n * that may still be affected. For old Opera, double the polling interval\n * to 250ms.\n *\n * @return {boolean} True if polling is required with XHR.\n */\nexports.isPollingRequired = function() {\n  return userAgent.EDGE_OR_IE;\n};\n\n\n/**\n * How often to poll (in MS) for changes to responseText in browsers that don't\n * fire onreadystatechange during incremental loading of the response body.\n *\n * @return {number|undefined} The polling interval (MS) for the current U-A;\n * or undefined if polling is not supposed to be enabled.\n */\nexports.getPollingInterval = function() {\n  if (userAgent.EDGE_OR_IE) {\n    return EDGE_POLLING_INTERVAL_;\n  }\n\n  return undefined;\n};\n\n/**\n * Origin trial token for google.com\n *\n * https://developers.chrome.com/origintrials/#/trials\n *\n * http://googlechrome.github.io/OriginTrials/check-token.html\n * Origin: https://google.com:443\n * Matches Subdomains? Yes\n * Matches Third-party? Yes\n * Feature: FetchUploadStreaming\n * Up to Chrome 95 (ends with the rollout of next Chrome release), no later\n * than Nov 9, 2021\n *\n * Token for googleapis.com will be registered after google.com's is deployed.\n *\n */\nconst OT_TOKEN_GOOGLE_COM =\n    'A0eNbltY1nd4MP7XTHXnTxWogDL6mWTdgIIKfKOTJoUHNbFFMZQBoiHHjJ9UK9lgYndWFaxOWR7ld8uUjcWmcwIAAAB/eyJvcmlnaW4iOiJodHRwczovL2dvb2dsZS5jb206NDQzIiwiZmVhdHVyZSI6IkZldGNoVXBsb2FkU3RyZWFtaW5nIiwiZXhwaXJ5IjoxNjM2NTAyMzk5LCJpc1N1YmRvbWFpbiI6dHJ1ZSwiaXNUaGlyZFBhcnR5Ijp0cnVlfQ==';\n\n\n/**\n * Creates ReadableStream to upload\n * @return {!ReadableStream} ReadableStream to upload\n */\nfunction createStream() {\n  const encoder = new goog.global.TextEncoder();\n  return new goog.global.ReadableStream({\n    start: controller => {\n      for (const obj of ['test\\r\\n', 'test\\r\\n']) {\n        controller.enqueue(encoder.encode(obj));\n      }\n      controller.close();\n    }\n  });\n}\n\n/**\n * Detect the user agent is chrome and its version is higher than M90.\n * This code is hard-coded from goog.labs.userAgent.browser to avoid file size\n * increasing.\n * @return {boolean} Whether the above is true.\n */\nfunction isChromeM90OrHigher() {\n  const userAgentStr = function() {\n    const navigator = goog.global.navigator;\n    if (navigator) {\n      const userAgent = navigator.userAgent;\n      if (userAgent) {\n        return userAgent;\n      }\n    }\n    return '';\n  }();\n\n  const matchUserAgent = function(str) {\n    return userAgentStr.indexOf(str) != -1;\n  };\n\n  if (!matchUserAgent('Chrome') || matchUserAgent('Edg')) {\n    return false;\n  }\n\n  const match = /Chrome\\/(\\d+)/.exec(userAgentStr);\n  const chromeVersion = parseInt(match[1], 10);\n  return chromeVersion >= 90;\n}\n\n/**\n * Detect the URL origin is *.google.com.\n * @param {string} url The target URL.\n * @return {boolean} Whether the above is true.\n */\nfunction isUrlGoogle(url) {\n  const match = /\\/\\/([^\\/]+)\\//.exec(url);\n  if (!match) {\n    return false;\n  }\n  const origin = match[1];\n  return origin.endsWith('google.com');\n}\n\n/**\n * The flag to run the origin trials code only once.\n */\nlet isStartOriginTrialsCalled = false;\n\n/**\n * For Fetch/upload OT, make three requests against the server endpoint.\n * POST requests contain only dummy payload.\n *\n * https://developers.chrome.com/origintrials/#/view_trial/3524066708417413121\n *\n * This function is expected to be called from background during the handshake.\n * Exceptions will be logged by the caller.\n *\n * No stats or logs are collected on the client-side. To be disabled once the\n * OT is expired.\n *\n * @param {string} path The base URL path for the requests\n * @param {function(*)} logError A function to execute when exceptions are\n *     caught.\n */\nexports.startOriginTrials = function(path, logError) {\n  if (isStartOriginTrialsCalled) {\n    return;\n  }\n  isStartOriginTrialsCalled = true;\n  // NE: may need check if path has already contains query params?\n\n  // Accept only Chrome M90 or later due to service worker support.\n  if (!isChromeM90OrHigher()) {\n    return;\n  }\n\n  // Accept only only google.com and subdoamins.\n  if (!isUrlGoogle(path)) {\n    return;\n  }\n  // Since 3P OT is not supported yet, we should check the current page matches\n  // the path (absolute one?) to disable this OT for cross-origin calls\n  if (!window || !window.document || !isUrlGoogle(window.document.URL)) {\n    return;\n  }\n\n  // Enable origin trial by injecting OT <meta> tag\n  const tokenElement =\n      /** @type {! HTMLMetaElement} */ (document.createElement('meta'));\n  tokenElement.httpEquiv = 'origin-trial';\n  tokenElement.content = OT_TOKEN_GOOGLE_COM;\n  // appendChild() synchronously enables OT.\n  document.head.appendChild(tokenElement);\n\n  // Check if fetch upload stream is actually enabled.\n  // By the spec, Streaming request doesn't has the Content-Type header:\n  // https://fetch.spec.whatwg.org/#concept-bodyinit-extract\n  // If Chrome doesn't support Streaming, the body stream is converted to a\n  // string \"[object ReadableStream]\" for fallback then it has \"Content-Type:\n  // text/plain;charset=UTF-8\".\n  const supportsRequestStreams = !new Request('', {\n                                    body: new ReadableStream(),\n                                    method: 'POST',\n                                  }).headers.has('Content-Type');\n  if (!supportsRequestStreams) {\n    return;\n  }\n\n  // 1st req:  path?ot=1\n  // non-streaming upload request\n  goog.global.fetch(`${path}?ot=1`, {method: 'POST', body: 'test\\r\\n'})\n      .catch(logError);\n\n  // 2nd req:  path?ot=2\n  // h2-only streaming upload request\n  goog.global\n      .fetch(`${path}?ot=2`, {\n        method: 'POST',\n        body: createStream(),\n        allowHTTP1ForStreamingUpload: false,\n      })\n      .catch(logError);\n\n  // 3rd req:  path?ot=3\n  // h1-allowed streaming upload request\n  goog.global\n      .fetch(`${path}?ot=3`, {\n        method: 'POST',\n        body: createStream(),\n        allowHTTP1ForStreamingUpload: true,\n      })\n      .catch(logError);\n\n  // Example calling a Chrome API:\n  // goog.global.chrome.loadTimes().wasFetchedViaSpdy\n};\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Base WebChannel implementation.\n */\n\n\ngoog.provide('goog.labs.net.webChannel.WebChannelBase');\n\ngoog.require('goog.Uri');\ngoog.require('goog.array');\ngoog.require('goog.asserts');\ngoog.require('goog.async.run');\ngoog.require('goog.collections.maps');\ngoog.require('goog.json');\ngoog.require('goog.labs.net.webChannel.Channel');\ngoog.require('goog.labs.net.webChannel.ChannelRequest');\ngoog.require('goog.labs.net.webChannel.ConnectionState');\ngoog.require('goog.labs.net.webChannel.ForwardChannelRequestPool');\ngoog.require('goog.labs.net.webChannel.WebChannelDebug');\ngoog.require('goog.labs.net.webChannel.Wire');\ngoog.require('goog.labs.net.webChannel.WireV8');\ngoog.require('goog.labs.net.webChannel.environment');\ngoog.require('goog.labs.net.webChannel.netUtils');\ngoog.require('goog.labs.net.webChannel.requestStats');\ngoog.require('goog.net.FetchXmlHttpFactory');\ngoog.require('goog.net.WebChannel');\ngoog.require('goog.net.XhrIo');\ngoog.require('goog.net.XmlHttpFactory');\ngoog.require('goog.net.rpc.HttpCors');\ngoog.require('goog.object');\ngoog.require('goog.string');\ngoog.require('goog.structs');\n\ngoog.scope(function() {\n'use strict';\nconst WebChannel = goog.net.WebChannel;\nconst ChannelRequest = goog.labs.net.webChannel.ChannelRequest;\nconst ConnectionState = goog.labs.net.webChannel.ConnectionState;\nconst ForwardChannelRequestPool =\n    goog.labs.net.webChannel.ForwardChannelRequestPool;\nconst WebChannelDebug = goog.labs.net.webChannel.WebChannelDebug;\nconst Wire = goog.labs.net.webChannel.Wire;\nconst WireV8 = goog.labs.net.webChannel.WireV8;\nconst environment = goog.labs.net.webChannel.environment;\nconst netUtils = goog.labs.net.webChannel.netUtils;\nconst requestStats = goog.labs.net.webChannel.requestStats;\n\nconst httpCors = goog.module.get('goog.net.rpc.HttpCors');\n\n/**\n * @define {boolean} If WebChannel should compile with Origin Trial features.\n */\nconst ALLOW_ORIGIN_TRIAL_FEATURES =\n    goog.define('goog.net.webChannel.ALLOW_ORIGIN_TRIAL_FEATURES', true);\n\n/**\n * Gets an internal channel parameter in a type-safe way.\n *\n * @param {string} paramName the key of the parameter to fetch.\n * @param {!T} defaultValue the default value to return\n * @param {!goog.net.WebChannel.Options=} options Configuration for the\n *        WebChannel instance.\n * @return {T}\n * @template T\n */\nfunction getInternalChannelParam(paramName, defaultValue, options) {\n  if (!options || !options.internalChannelParams) {\n    return defaultValue;\n  }\n  return /** @type {T} */ (options.internalChannelParams[paramName]) ||\n      defaultValue;\n}\n\n/**\n * This WebChannel implementation is branched off goog.net.BrowserChannel\n * for now. Ongoing changes to goog.net.BrowserChannel will be back\n * ported to this implementation as needed.\n *\n * @param {!goog.net.WebChannel.Options=} opt_options Configuration for the\n *        WebChannel instance.\n * @param {number=} opt_clientVersion An application-specific version number\n *        that is sent to the server when connected.\n * @param {!ConnectionState=} opt_conn Previously determined connection\n *        conditions.\n * @constructor\n * @struct\n * @implements {goog.labs.net.webChannel.Channel}\n */\ngoog.labs.net.webChannel.WebChannelBase = function(\n    opt_options, opt_clientVersion, opt_conn) {\n  'use strict';\n  /**\n   * The client library version (capabilities).\n   * @private {number}\n   */\n  this.clientVersion_ = opt_clientVersion || 0;\n\n  /**\n   * The server library version (capabilities).\n   * @private {number}\n   */\n  this.serverVersion_ = 0;\n\n\n  /**\n   * An array of queued maps that need to be sent to the server.\n   * @private {!Array<Wire.QueuedMap>}\n   */\n  this.outgoingMaps_ = [];\n\n  /**\n   * The channel debug used for logging\n   * @private {!WebChannelDebug}\n   */\n  this.channelDebug_ = new WebChannelDebug();\n\n  /**\n   * Connectivity state.\n   * @private {!ConnectionState}\n   */\n  this.connState_ = opt_conn || new ConnectionState();\n\n  /**\n   * Extra HTTP headers to add to all the requests sent to the server.\n   * @private {?Object}\n   */\n  this.extraHeaders_ = null;\n\n  /**\n   * Extra HTTP headers to add to the init request(s) sent to the server.\n   * @private {?Object}\n   */\n  this.initHeaders_ = null;\n\n  /**\n   * @private {?string} The URL param name to overwrite custom HTTP headers\n   * to bypass CORS preflight.\n   */\n  this.httpHeadersOverwriteParam_ = null;\n\n  /**\n   * Extra parameters to add to all the requests sent to the server.\n   * @private {?Object}\n   */\n  this.extraParams_ = null;\n\n  /**\n   * Parameter name for the http session id.\n   * @private {?string}\n   */\n  this.httpSessionIdParam_ = null;\n\n  /**\n   * The http session id, to be sent with httpSessionIdParam_ with each\n   * request after the initial handshake.\n   * @private {?string}\n   */\n  this.httpSessionId_ = null;\n\n  /**\n   * The ChannelRequest object for the backchannel.\n   * @private {?ChannelRequest}\n   */\n  this.backChannelRequest_ = null;\n\n  /**\n   * The relative path (in the context of the page hosting the browser channel)\n   * for making requests to the server.\n   * @private {?string}\n   */\n  this.path_ = null;\n\n  /**\n   * The absolute URI for the forwardchannel request.\n   * @private {?goog.Uri}\n   */\n  this.forwardChannelUri_ = null;\n\n  /**\n   * The absolute URI for the backchannel request.\n   * @private {?goog.Uri}\n   */\n  this.backChannelUri_ = null;\n\n  /**\n   * A subdomain prefix for using a subdomain in IE for the backchannel\n   * requests.\n   * @private {?string}\n   */\n  this.hostPrefix_ = null;\n\n  /**\n   * Whether we allow the use of a subdomain in IE for the backchannel requests.\n   * @private {boolean}\n   */\n  this.allowHostPrefix_ = true;\n\n  /**\n   * The next id to use for the RID (request identifier) parameter. This\n   * identifier uniquely identifies the forward channel request.\n   * @private {number}\n   */\n  this.nextRid_ = 0;\n\n  /**\n   * The id to use for the next outgoing map. This identifier uniquely\n   * identifies a sent map.\n   * @private {number}\n   */\n  this.nextMapId_ = 0;\n\n  /**\n   * Whether to fail forward-channel requests after one try or a few tries.\n   * @private {boolean}\n   */\n  this.failFast_ = getInternalChannelParam('failFast', false, opt_options);\n\n  /**\n   * The handler that receive callbacks for state changes and data.\n   * @private {?goog.labs.net.webChannel.WebChannelBase.Handler}\n   */\n  this.handler_ = null;\n\n  /**\n   * Timer identifier for asynchronously making a forward channel request.\n   * This is set to true if the func is scheduled with async.run, which\n   * is equivalent to setTimeout(0).\n   * @private {?number|?boolean}\n   */\n  this.forwardChannelTimerId_ = null;\n\n  /**\n   * Timer identifier for asynchronously making a back channel request.\n   * @private {?number}\n   */\n  this.backChannelTimerId_ = null;\n\n  /**\n   * Timer identifier for the timer that waits for us to retry the backchannel\n   * in the case where it is dead and no longer receiving data.\n   * @private {?number}\n   */\n  this.deadBackChannelTimerId_ = null;\n\n  /**\n   * Whether the client's network conditions can support streamed responses.\n   * @private {?boolean}\n   */\n  this.enableStreaming_ = null;\n\n  /**\n   * Whether streaming mode is allowed. In certain debugging situations, it's\n   * useful to disable this.\n   * @private {boolean}\n   */\n  this.allowStreamingMode_ = true;\n\n  /**\n   * The array identifier of the last array received from the server for the\n   * backchannel request.\n   * @private {number}\n   */\n  this.lastArrayId_ = -1;\n\n  /**\n   * The array id of the last array sent by the server that we know about.\n   * @private {number}\n   */\n  this.lastPostResponseArrayId_ = -1;\n\n  /**\n   * The last status code received (until `State.CLOSED` is reached).\n   * @private {number}\n   */\n  this.lastStatusCode_ = -1;\n\n  /**\n   * Number of times we have retried the current forward channel request.\n   * @private {number}\n   */\n  this.forwardChannelRetryCount_ = 0;\n\n  /**\n   * Number of times in a row that we have retried the current back channel\n   * request and received no data.\n   * @private {number}\n   */\n  this.backChannelRetryCount_ = 0;\n\n  /**\n   * The attempt id for the current back channel request. Starts at 1 and\n   * increments for each reconnect. The server uses this to log if our\n   * connection is flaky or not.\n   * @private {number}\n   */\n  this.backChannelAttemptId_ = 0;\n\n  /**\n   * The base part of the time before firing next retry request. Default is 5\n   * seconds. Note that a random delay is added (see {@link retryDelaySeedMs_})\n   * for all retries, and linear backoff is applied to the sum for subsequent\n   * retries.\n   * @private {number}\n   */\n  this.baseRetryDelayMs_ =\n      getInternalChannelParam('baseRetryDelayMs', 5 * 1000, opt_options);\n\n  /**\n   * A random time between 0 and this number of MS is added to the\n   * {@link baseRetryDelayMs_}. Default is 10 seconds.\n   * @private {number}\n   */\n  this.retryDelaySeedMs_ =\n      getInternalChannelParam('retryDelaySeedMs', 10 * 1000, opt_options);\n\n  /**\n   * Maximum number of attempts to connect to the server for forward channel\n   * requests. Defaults to 2.\n   * @private {number}\n   */\n  this.forwardChannelMaxRetries_ =\n      getInternalChannelParam('forwardChannelMaxRetries', 2, opt_options);\n\n  /**\n   * The timeout in milliseconds for a forward channel request. Defaults to 20\n   * seconds. Note that part of this timeout can be randomized.\n   * @private {number}\n   */\n  this.forwardChannelRequestTimeoutMs_ = getInternalChannelParam(\n      'forwardChannelRequestTimeoutMs', 20 * 1000, opt_options);\n\n  /**\n   * The custom factory used to create XMLHttpRequest objects.\n   * @private {!goog.net.XmlHttpFactory | undefined}\n   */\n  this.xmlHttpFactory_ =\n      (opt_options && opt_options.xmlHttpFactory) || undefined;\n\n  /**\n   * Whether or not this channel uses WHATWG Fetch/streams.\n   * @private {boolean}\n   */\n  this.usesFetchStreams_ =\n      (opt_options && opt_options.useFetchStreams) || false;\n\n  /**\n   * The timeout in milliseconds for a back channel request. Defaults to using\n   * the timeout configured in ChannelRequest (45s). If server-side\n   * keepaliveInterval is known to the client, set the backchannel request\n   * timeout to 1.5 * keepaliveInterval (ms).\n   *\n   * @private {number|undefined}\n   */\n  this.backChannelRequestTimeoutMs_ = undefined;\n\n  /**\n   * A throttle time in ms for readystatechange events for the backchannel.\n   * Useful for throttling when ready state is INTERACTIVE (partial data).\n   *\n   * This throttle is useful if the server sends large data chunks down the\n   * backchannel.  It prevents examining XHR partial data on every readystate\n   * change event.  This is useful because large chunks can trigger hundreds\n   * of readystatechange events, each of which takes ~5ms or so to handle,\n   * in turn making the UI unresponsive for a significant period.\n   *\n   * If set to zero no throttle is used.\n   * @private {number}\n   */\n  this.readyStateChangeThrottleMs_ = 0;\n\n  /**\n   * Whether cross origin requests are supported for the channel.\n   *\n   * See {@link goog.net.XhrIo#setWithCredentials}.\n   * @private {boolean}\n   */\n  this.supportsCrossDomainXhrs_ =\n      (opt_options && opt_options.supportsCrossDomainXhr) || false;\n\n  /**\n   * The current session id.\n   * @private {string}\n   */\n  this.sid_ = '';\n\n  /**\n   * The current ChannelRequest pool for the forward channel.\n   * @private {!ForwardChannelRequestPool}\n   */\n  this.forwardChannelRequestPool_ = new ForwardChannelRequestPool(\n      opt_options && opt_options.concurrentRequestLimit);\n\n  /**\n   * The V8 codec.\n   * @private {!WireV8}\n   */\n  this.wireCodec_ = new WireV8();\n\n  /**\n   * Whether to turn on the fast handshake behavior.\n   *\n   * @private {boolean}\n   */\n  this.fastHandshake_ = (opt_options && opt_options.fastHandshake) || false;\n\n  /**\n   * Whether to encode initMessageHeaders in the body.\n   *\n   * @private {boolean}\n   */\n  this.encodeInitMessageHeaders_ =\n      (opt_options && opt_options.encodeInitMessageHeaders) || false;\n\n  if (this.fastHandshake_ && this.encodeInitMessageHeaders_) {\n    this.channelDebug_.warning(\n        'Ignore encodeInitMessageHeaders because fastHandshake is set.');\n    this.encodeInitMessageHeaders_ = false;\n  }\n\n  /**\n   * Whether to signal to the server to enable blocking handshake.\n   *\n   * @private {boolean}\n   */\n  this.blockingHandshake_ =\n      (opt_options && opt_options.blockingHandshake) || false;\n\n\n  if (opt_options && opt_options.disableRedact) {\n    this.channelDebug_.disableRedact();\n  }\n\n  if (opt_options && opt_options.forceLongPolling) {\n    this.allowStreamingMode_ = false;\n  }\n\n  /**\n   * Whether to detect buffering proxies.\n   *\n   * fastHandshake + detectBufferingProxy are yet to be implemented.\n   *\n   * @private {boolean}\n   */\n  this.detectBufferingProxy_ =\n      (!this.fastHandshake_ && this.allowStreamingMode_ && opt_options &&\n       opt_options.detectBufferingProxy) ||\n      false;\n\n  /**\n   * Callback when all the pending client-sent messages have been flushed.\n   *\n   * @private {function()|undefined}\n   */\n  this.forwardChannelFlushedCallback_ = undefined;\n\n  /**\n   * TODO(user): move all backchannel states to its own class similar to\n   * forwardchannelrequestpool.js and log more stats.\n   *\n   * The estimated handshake RTT (ms) as measured from when the handshake\n   * request is sent and when the handshake response headers are received.\n   * If the value is 0, the RTT is unknown.\n   *\n   * @private {number}\n   */\n  this.handshakeRttMs_ = 0;\n\n  /**\n   * If BP detection is done or still in progress.\n   * Should only be checked when detectBufferingProxy is turned on.\n   * @private {boolean}\n   */\n  this.bpDetectionDone_ = false;\n\n  /**\n   * The timer for detecting buffering proxy. This needs be reset with each\n   * backchannel request. If this is not null, bpDetectionDone_ == false.\n   * @private {?number}\n   */\n  this.bpDetectionTimerId_ = null;\n\n  /***\n   * Whether to attempt Chrome Origin Trials as part of the handshake.\n   * @private @const {boolean}\n   */\n  this.enableOriginTrials_ = ALLOW_ORIGIN_TRIAL_FEATURES &&\n      (!opt_options || opt_options.enableOriginTrials !== false);\n\n  /**\n   * The array of non-acked maps at the time of channel close. Refer to\n   * `getNonAckedMessagesWithClosedChannel()` API for definitions of non-acked\n   * messages.\n   *\n   * @private {?Array<!Wire.QueuedMap>}\n   */\n  this.nonAckedMapsAtChannelClose_ = null;\n};\n\nconst WebChannelBase = goog.labs.net.webChannel.WebChannelBase;\n\n\n/**\n * The channel version that we negotiated with the server for this session.\n * Starts out as the version we request, and then is changed to the negotiated\n * version after the initial open.\n * @private {number}\n */\nWebChannelBase.prototype.channelVersion_ = Wire.LATEST_CHANNEL_VERSION;\n\n\n/**\n * Enum type for the channel state machine.\n * @enum {number}\n */\nWebChannelBase.State = {\n  /** The channel is closed. */\n  CLOSED: 0,\n\n  /** The channel has been initialized but hasn't yet initiated a connection. */\n  INIT: 1,\n\n  /** The channel is in the process of opening a connection to the server. */\n  OPENING: 2,\n\n  /** The channel is open. */\n  OPENED: 3\n};\n\n\n/**\n * The current state of the WebChannel.\n * @private {!WebChannelBase.State}\n */\nWebChannelBase.prototype.state_ = WebChannelBase.State.INIT;\n\n\n/**\n * The timeout in milliseconds for a forward channel request.\n * @type {number}\n */\nWebChannelBase.FORWARD_CHANNEL_RETRY_TIMEOUT = 20 * 1000;\n\n\n/**\n * Maximum number of attempts to connect to the server for back channel\n * requests.\n * @type {number}\n */\nWebChannelBase.BACK_CHANNEL_MAX_RETRIES = 3;\n\n\n/**\n * A number in MS of how long we guess the maxmium amount of time a round trip\n * to the server should take. In the future this could be substituted with a\n * real measurement of the RTT.\n * @type {number}\n */\nWebChannelBase.RTT_ESTIMATE = 3 * 1000;\n\n\n/**\n * When retrying for an inactive channel, we will multiply the total delay by\n * this number.\n * @type {number}\n */\nWebChannelBase.INACTIVE_CHANNEL_RETRY_FACTOR = 2;\n\n\n/**\n * Enum type for identifying an error.\n * @enum {number}\n */\nWebChannelBase.Error = {\n  /** Value that indicates no error has occurred. */\n  OK: 0,\n\n  /** An error due to a request failing. */\n  REQUEST_FAILED: 2,\n\n  /** An error due to the user being logged out. */\n  LOGGED_OUT: 4,\n\n  /** An error due to server response which contains no data. */\n  NO_DATA: 5,\n\n  /** An error due to a server response indicating an unknown session id */\n  UNKNOWN_SESSION_ID: 6,\n\n  /** An error due to a server response requesting to stop the channel. */\n  STOP: 7,\n\n  /** A general network error. */\n  NETWORK: 8,\n\n  /** An error due to bad data being returned from the server. */\n  BAD_DATA: 10,\n\n  /** An error due to a response that is not parsable. */\n  BAD_RESPONSE: 11\n};\n\n\n/**\n * Internal enum type for the two channel types.\n * @enum {number}\n * @private\n */\nWebChannelBase.ChannelType_ = {\n  FORWARD_CHANNEL: 1,\n\n  BACK_CHANNEL: 2\n};\n\n\n/**\n * The maximum number of maps that can be sent in one POST. Should match\n * MAX_MAPS_PER_REQUEST on the server code.\n * @type {number}\n * @private\n */\nWebChannelBase.MAX_MAPS_PER_REQUEST_ = 1000;\n\n\n/**\n * The maximum number of utf-8 chars that can be sent in one GET to enable 0-RTT\n * handshake.\n *\n *  @const @private {number}\n */\nWebChannelBase.MAX_CHARS_PER_GET_ = 4 * 1024;\n\n\n/**\n * A guess at a cutoff at which to no longer assume the backchannel is dead\n * when we are slow to receive data. Number in bytes.\n *\n * Assumption: The worst bandwidth we work on is 50 kilobits/sec\n * 50kbits/sec * (1 byte / 8 bits) * 6 sec dead backchannel timeout\n * @type {number}\n */\nWebChannelBase.OUTSTANDING_DATA_BACKCHANNEL_RETRY_CUTOFF = 37500;\n\n\n/**\n * @return {number} The server version or 0 if undefined\n */\nWebChannelBase.prototype.getServerVersion = function() {\n  'use strict';\n  return this.serverVersion_;\n};\n\n\n/**\n * @return {!ForwardChannelRequestPool} The forward channel request pool.\n */\nWebChannelBase.prototype.getForwardChannelRequestPool = function() {\n  'use strict';\n  return this.forwardChannelRequestPool_;\n};\n\n\n/**\n * @return {!Object} The codec object.\n */\nWebChannelBase.prototype.getWireCodec = function() {\n  'use strict';\n  return this.wireCodec_;\n};\n\n\n/**\n * Returns the logger.\n *\n * @return {!WebChannelDebug} The channel debug object.\n */\nWebChannelBase.prototype.getChannelDebug = function() {\n  'use strict';\n  return this.channelDebug_;\n};\n\n\n/**\n * Sets the logger.\n *\n * @param {!WebChannelDebug} channelDebug The channel debug object.\n */\nWebChannelBase.prototype.setChannelDebug = function(channelDebug) {\n  'use strict';\n  this.channelDebug_ = channelDebug;\n};\n\n\n/**\n * Starts the channel. This initiates connections to the server.\n *\n * @param {string} channelPath  The path for the channel connection.\n * @param {!Object=} opt_extraParams Extra parameter keys and values to add to\n *     the requests.\n * @param {string=} opt_oldSessionId  Session ID from a previous session.\n * @param {number=} opt_oldArrayId  The last array ID from a previous session.\n */\nWebChannelBase.prototype.connect = function(\n    channelPath, opt_extraParams, opt_oldSessionId, opt_oldArrayId) {\n  'use strict';\n  this.channelDebug_.debug('connect()');\n\n  this.startOriginTrials_(channelPath);\n\n  requestStats.notifyStatEvent(requestStats.Stat.CONNECT_ATTEMPT);\n\n  this.path_ = channelPath;\n  this.extraParams_ = opt_extraParams || {};\n\n  // Attach parameters about the previous session if reconnecting.\n  if (opt_oldSessionId && opt_oldArrayId !== undefined) {\n    this.extraParams_['OSID'] = opt_oldSessionId;\n    this.extraParams_['OAID'] = opt_oldArrayId;\n  }\n\n  this.enableStreaming_ = this.allowStreamingMode_;\n  this.connectChannel_();\n};\n\n\n/**\n * Disconnects and closes the channel.\n */\nWebChannelBase.prototype.disconnect = function() {\n  'use strict';\n  this.channelDebug_.debug('disconnect()');\n\n  this.cancelRequests_();\n\n  if (this.state_ == WebChannelBase.State.OPENED) {\n    const rid = this.nextRid_++;\n    const uri = this.forwardChannelUri_.clone();\n    uri.setParameterValue('SID', this.sid_);\n    uri.setParameterValue('RID', rid);\n    uri.setParameterValue('TYPE', 'terminate');\n\n    this.addAdditionalParams_(uri);\n\n    const request = ChannelRequest.createChannelRequest(\n        this, this.channelDebug_, this.sid_, rid);\n    request.sendCloseRequest(uri);\n  }\n\n  this.onClose_();\n};\n\n\n/**\n * Returns the session id of the channel. Only available after the\n * channel has been opened.\n * @return {string} Session ID.\n */\nWebChannelBase.prototype.getSessionId = function() {\n  'use strict';\n  return this.sid_;\n};\n\n\n/**\n * Starts the connection.\n * @private\n */\nWebChannelBase.prototype.connectChannel_ = function() {\n  'use strict';\n  this.channelDebug_.debug('connectChannel_()');\n  this.ensureInState_(WebChannelBase.State.INIT, WebChannelBase.State.CLOSED);\n  this.forwardChannelUri_ =\n      this.getForwardChannelUri(/** @type {string} */ (this.path_));\n  this.ensureForwardChannel_();\n};\n\n\n/**\n * Starts the Origin Trials.\n * @param {string} channelPath  The path for the channel connection.\n * @private\n */\nWebChannelBase.prototype.startOriginTrials_ = function(channelPath) {\n  'use strict';\n\n  if (!this.enableOriginTrials_) {\n    return;\n  }\n\n  this.channelDebug_.info('Origin Trials enabled.');\n  goog.async.run(goog.bind(this.runOriginTrials_, this, channelPath));\n};\n\n\n/**\n * Runs the Origin Trials.\n * @param {string} channelPath  The path for the channel connection.\n * @private\n */\nWebChannelBase.prototype.runOriginTrials_ = function(channelPath) {\n  'use strict';\n\n  try {\n    // Since startOriginTrials might throw exceptions asynchronously, we should\n    // capture it in promise-catch.\n    environment.startOriginTrials(channelPath, e => {\n      this.channelDebug_.dumpException(\n          /** @type {?Error} */ (e), 'Error in running origin trials');\n    });\n    this.channelDebug_.info('Origin Trials invoked: ' + channelPath);\n  } catch (e) {\n    this.channelDebug_.dumpException(e, 'Error in running origin trials');\n  }\n};\n\n\n/**\n * Cancels backchannel request.\n * @private\n */\nWebChannelBase.prototype.cancelBackChannelRequest_ = function() {\n  'use strict';\n  if (this.backChannelRequest_) {\n    this.clearBpDetectionTimer_();\n    this.backChannelRequest_.cancel();\n    this.backChannelRequest_ = null;\n  }\n};\n\n\n/**\n * Cancels all outstanding requests.\n * @private\n */\nWebChannelBase.prototype.cancelRequests_ = function() {\n  'use strict';\n  this.cancelBackChannelRequest_();\n\n  if (this.backChannelTimerId_) {\n    goog.global.clearTimeout(this.backChannelTimerId_);\n    this.backChannelTimerId_ = null;\n  }\n\n  this.clearDeadBackchannelTimer_();\n\n  this.forwardChannelRequestPool_.cancel();\n\n  if (this.forwardChannelTimerId_) {\n    this.clearForwardChannelTimer_();\n  }\n};\n\n\n/**\n * Clears the forward channel timer.\n * @private\n */\nWebChannelBase.prototype.clearForwardChannelTimer_ = function() {\n  'use strict';\n  if (typeof this.forwardChannelTimerId_ === 'number') {\n    goog.global.clearTimeout(this.forwardChannelTimerId_);\n  }\n\n  this.forwardChannelTimerId_ = null;\n};\n\n\n/**\n * Returns the extra HTTP headers to add to all the requests sent to the server.\n *\n * @return {Object} The HTTP headers, or null.\n */\nWebChannelBase.prototype.getExtraHeaders = function() {\n  'use strict';\n  return this.extraHeaders_;\n};\n\n\n/**\n * Sets extra HTTP headers to add to all the requests sent to the server.\n *\n * @param {Object} extraHeaders The HTTP headers, or null.\n */\nWebChannelBase.prototype.setExtraHeaders = function(extraHeaders) {\n  'use strict';\n  this.extraHeaders_ = extraHeaders;\n};\n\n\n/**\n * Returns the extra HTTP headers to add to the init requests\n * sent to the server.\n *\n * @return {Object} The HTTP headers, or null.\n */\nWebChannelBase.prototype.getInitHeaders = function() {\n  'use strict';\n  return this.initHeaders_;\n};\n\n\n/**\n * Sets extra HTTP headers to add to the init requests sent to the server.\n *\n * @param {Object} initHeaders The HTTP headers, or null.\n */\nWebChannelBase.prototype.setInitHeaders = function(initHeaders) {\n  'use strict';\n  this.initHeaders_ = initHeaders;\n};\n\n\n/**\n * Sets the URL param name to overwrite custom HTTP headers.\n *\n * @param {string} httpHeadersOverwriteParam The URL param name.\n */\nWebChannelBase.prototype.setHttpHeadersOverwriteParam = function(\n    httpHeadersOverwriteParam) {\n  'use strict';\n  this.httpHeadersOverwriteParam_ = httpHeadersOverwriteParam;\n};\n\n\n/**\n * @override\n */\nWebChannelBase.prototype.setHttpSessionIdParam = function(httpSessionIdParam) {\n  'use strict';\n  this.httpSessionIdParam_ = httpSessionIdParam;\n};\n\n\n/**\n * @override\n */\nWebChannelBase.prototype.getHttpSessionIdParam = function() {\n  'use strict';\n  return this.httpSessionIdParam_;\n};\n\n\n/**\n * @override\n */\nWebChannelBase.prototype.setHttpSessionId = function(httpSessionId) {\n  'use strict';\n  this.httpSessionId_ = httpSessionId;\n};\n\n\n/**\n * @override\n */\nWebChannelBase.prototype.getHttpSessionId = function() {\n  'use strict';\n  return this.httpSessionId_;\n};\n\n\n/**\n * Sets the throttle for handling onreadystatechange events for the request.\n *\n * @param {number} throttle The throttle in ms.  A value of zero indicates\n *     no throttle.\n */\nWebChannelBase.prototype.setReadyStateChangeThrottle = function(throttle) {\n  'use strict';\n  this.readyStateChangeThrottleMs_ = throttle;\n};\n\n\n/**\n * Sets whether cross origin requests are supported for the channel.\n *\n * Setting this allows the creation of requests to secondary domains and\n * sends XHRs with the CORS withCredentials bit set to true.\n *\n * In order for cross-origin requests to work, the server will also need to set\n * CORS response headers as per:\n * https://developer.mozilla.org/en-US/docs/HTTP_access_control\n *\n * See {@link goog.net.XhrIo#setWithCredentials}.\n * @param {boolean} supportCrossDomain Whether cross domain XHRs are supported.\n */\nWebChannelBase.prototype.setSupportsCrossDomainXhrs = function(\n    supportCrossDomain) {\n  'use strict';\n  this.supportsCrossDomainXhrs_ = supportCrossDomain;\n};\n\n\n/**\n * Returns the handler used for channel callback events.\n *\n * @return {WebChannelBase.Handler} The handler.\n */\nWebChannelBase.prototype.getHandler = function() {\n  'use strict';\n  return this.handler_;\n};\n\n\n/**\n * Sets the handler used for channel callback events.\n * @param {WebChannelBase.Handler} handler The handler to set.\n */\nWebChannelBase.prototype.setHandler = function(handler) {\n  'use strict';\n  this.handler_ = handler;\n};\n\n\n/**\n * Returns whether the channel allows the use of a subdomain. There may be\n * cases where this isn't allowed.\n * @return {boolean} Whether a host prefix is allowed.\n */\nWebChannelBase.prototype.getAllowHostPrefix = function() {\n  'use strict';\n  return this.allowHostPrefix_;\n};\n\n\n/**\n * Sets whether the channel allows the use of a subdomain. There may be cases\n * where this isn't allowed, for example, logging in with troutboard where\n * using a subdomain causes Apache to force the user to authenticate twice.\n * @param {boolean} allowHostPrefix Whether a host prefix is allowed.\n */\nWebChannelBase.prototype.setAllowHostPrefix = function(allowHostPrefix) {\n  'use strict';\n  this.allowHostPrefix_ = allowHostPrefix;\n};\n\n\n/**\n * Returns whether the channel is buffered or not.  This may be\n * queried in the WebChannelBase.okToMakeRequest() callback.\n *\n * @return {boolean} Whether the channel is buffered.\n */\nWebChannelBase.prototype.isBuffered = function() {\n  'use strict';\n  return !this.enableStreaming_;\n};\n\n\n/**\n * Returns whether streaming mode is allowed. In certain debugging situations,\n * it's useful for the application to have a way to disable streaming mode for a\n * user.\n\n * @return {boolean} Whether streaming mode is allowed.\n */\nWebChannelBase.prototype.getAllowStreamingMode = function() {\n  'use strict';\n  return this.allowStreamingMode_;\n};\n\n\n/**\n * Sets whether streaming mode is allowed. In certain debugging situations, it's\n * useful for the application to have a way to disable streaming mode for a\n * user.\n * @param {boolean} allowStreamingMode  Whether streaming mode is allowed.\n */\nWebChannelBase.prototype.setAllowStreamingMode = function(allowStreamingMode) {\n  'use strict';\n  this.allowStreamingMode_ = allowStreamingMode;\n};\n\n\n/**\n * Sends a request to the server. The format of the request is a Map data\n * structure of key/value pairs. These maps are then encoded in a format\n * suitable for the wire and then reconstituted as a Map data structure that\n * the server can process.\n * @param {!Object|!goog.collections.maps.MapLike} map The map to send.\n * @param {!Object=} opt_context The context associated with the map.\n */\nWebChannelBase.prototype.sendMap = function(map, opt_context) {\n  'use strict';\n  goog.asserts.assert(\n      this.state_ != WebChannelBase.State.CLOSED,\n      'Invalid operation: sending map when state is closed');\n\n  // We can only send 1000 maps per POST, but typically we should never have\n  // that much to send, so warn if we exceed that (we still send all the maps).\n  if (this.outgoingMaps_.length == WebChannelBase.MAX_MAPS_PER_REQUEST_) {\n    // severe() is temporary so that we get these uploaded and can figure out\n    // what's causing them. Afterwards can change to warning().\n    this.channelDebug_.severe(function() {\n      'use strict';\n      return 'Already have ' + WebChannelBase.MAX_MAPS_PER_REQUEST_ +\n          ' queued maps upon queueing ' + goog.json.serialize(map);\n    });\n  }\n\n  this.outgoingMaps_.push(\n      new Wire.QueuedMap(this.nextMapId_++, map, opt_context));\n\n  // Messages need be buffered during OPENING to avoid server-side race\n  if (this.state_ == WebChannelBase.State.OPENED) {\n    this.ensureForwardChannel_();\n  }\n};\n\n\n/**\n * When set to true, this changes the behavior of the forward channel so it\n * will not retry requests; it will fail after one network failure, and if\n * there was already one network failure, the request will fail immediately.\n * @param {boolean} failFast  Whether or not to fail fast.\n */\nWebChannelBase.prototype.setFailFast = function(failFast) {\n  'use strict';\n  this.failFast_ = failFast;\n  this.channelDebug_.info('setFailFast: ' + failFast);\n  if ((this.forwardChannelRequestPool_.hasPendingRequest() ||\n       this.forwardChannelTimerId_) &&\n      this.forwardChannelRetryCount_ > this.getForwardChannelMaxRetries()) {\n    const self = this;\n    this.channelDebug_.info(function() {\n      'use strict';\n      return 'Retry count ' + self.forwardChannelRetryCount_ +\n          ' > new maxRetries ' + self.getForwardChannelMaxRetries() +\n          '. Fail immediately!';\n    });\n\n    if (!this.forwardChannelRequestPool_.forceComplete(\n            goog.bind(this.onRequestComplete, this))) {\n      // i.e., this.forwardChannelTimerId_\n      this.clearForwardChannelTimer_();\n      // The error code from the last failed request is gone, so just use a\n      // generic one.\n      this.signalError_(WebChannelBase.Error.REQUEST_FAILED);\n    }\n  }\n};\n\n\n/**\n * @return {number} The max number of forward-channel retries, which will be 0\n * in fail-fast mode.\n */\nWebChannelBase.prototype.getForwardChannelMaxRetries = function() {\n  'use strict';\n  return this.failFast_ ? 0 : this.forwardChannelMaxRetries_;\n};\n\n\n/**\n * Sets the maximum number of attempts to connect to the server for forward\n * channel requests.\n * @param {number} retries The maximum number of attempts.\n */\nWebChannelBase.prototype.setForwardChannelMaxRetries = function(retries) {\n  'use strict';\n  this.forwardChannelMaxRetries_ = retries;\n};\n\n\n/**\n * Sets the timeout for a forward channel request.\n * @param {number} timeoutMs The timeout in milliseconds.\n */\nWebChannelBase.prototype.setForwardChannelRequestTimeout = function(timeoutMs) {\n  'use strict';\n  this.forwardChannelRequestTimeoutMs_ = timeoutMs;\n};\n\n\n/**\n * @return {number} The max number of back-channel retries, which is a constant.\n */\nWebChannelBase.prototype.getBackChannelMaxRetries = function() {\n  'use strict';\n  // Back-channel retries is a constant.\n  return WebChannelBase.BACK_CHANNEL_MAX_RETRIES;\n};\n\n\n/**\n * @override\n */\nWebChannelBase.prototype.isClosed = function() {\n  'use strict';\n  return this.state_ == WebChannelBase.State.CLOSED;\n};\n\n\n/**\n * Returns the channel state.\n * @return {WebChannelBase.State} The current state of the channel.\n */\nWebChannelBase.prototype.getState = function() {\n  'use strict';\n  return this.state_;\n};\n\n\n/**\n * @return {number} The last status code received (until `State.CLOSED` is\n * reached).\n */\nWebChannelBase.prototype.getLastStatusCode = function() {\n  'use strict';\n  return this.lastStatusCode_;\n};\n\n\n/**\n * @return {number} The last array id received.\n */\nWebChannelBase.prototype.getLastArrayId = function() {\n  'use strict';\n  return this.lastArrayId_;\n};\n\n\n/**\n * Returns whether there are outstanding requests servicing the channel.\n * @return {boolean} true if there are outstanding requests.\n */\nWebChannelBase.prototype.hasOutstandingRequests = function() {\n  'use strict';\n  return this.getOutstandingRequests_() != 0;\n};\n\n\n/**\n * Returns the number of outstanding requests.\n * @return {number} The number of outstanding requests to the server.\n * @private\n */\nWebChannelBase.prototype.getOutstandingRequests_ = function() {\n  'use strict';\n  let count = 0;\n  if (this.backChannelRequest_) {\n    count++;\n  }\n  count += this.forwardChannelRequestPool_.getRequestCount();\n  return count;\n};\n\n\n/**\n * Ensures that a forward channel request is scheduled.\n * @private\n */\nWebChannelBase.prototype.ensureForwardChannel_ = function() {\n  'use strict';\n  if (this.forwardChannelRequestPool_.isFull()) {\n    // enough connection in process - no need to start a new request\n    return;\n  }\n\n  if (this.forwardChannelTimerId_) {\n    // no need to start a new request - one is already scheduled\n    return;\n  }\n\n  // Use async.run instead of setTimeout(0) to avoid the 1s message delay\n  // from chrome/firefox background tabs\n  this.forwardChannelTimerId_ = true;\n  goog.async.run(this.onStartForwardChannelTimer_, this);\n\n  this.forwardChannelRetryCount_ = 0;\n};\n\n\n/**\n * Schedules a forward-channel retry for the specified request, unless the max\n * retries has been reached.\n * @param {!ChannelRequest} request The failed request to retry.\n * @return {boolean} true iff a retry was scheduled.\n * @private\n */\nWebChannelBase.prototype.maybeRetryForwardChannel_ = function(request) {\n  'use strict';\n  if (this.forwardChannelRequestPool_.getRequestCount() >=\n      this.forwardChannelRequestPool_.getMaxSize() -\n          (this.forwardChannelTimerId_ ? 1 : 0)) {\n    // Should be impossible to be called in this state.\n    this.channelDebug_.severe('Unexpected retry request is scheduled.');\n    return false;\n  }\n\n  if (this.forwardChannelTimerId_) {\n    this.channelDebug_.debug(\n        'Use the retry request that is already scheduled.');\n    this.outgoingMaps_ =\n        request.getPendingMessages().concat(this.outgoingMaps_);\n    return true;\n  }\n\n  // No retry for open_() and fail-fast\n  if (this.state_ == WebChannelBase.State.INIT ||\n      this.state_ == WebChannelBase.State.OPENING ||\n      (this.forwardChannelRetryCount_ >= this.getForwardChannelMaxRetries())) {\n    return false;\n  }\n\n  this.channelDebug_.debug('Going to retry POST');\n\n  this.forwardChannelTimerId_ = requestStats.setTimeout(\n      goog.bind(this.onStartForwardChannelTimer_, this, request),\n      this.getRetryTime_(this.forwardChannelRetryCount_));\n  this.forwardChannelRetryCount_++;\n  return true;\n};\n\n\n/**\n * Timer callback for ensureForwardChannel\n * @param {ChannelRequest=} opt_retryRequest A failed request\n * to retry.\n * @private\n */\nWebChannelBase.prototype.onStartForwardChannelTimer_ = function(\n    opt_retryRequest) {\n  'use strict';\n  // null is possible if scheduled with async.run\n  if (this.forwardChannelTimerId_) {\n    this.forwardChannelTimerId_ = null;\n    this.startForwardChannel_(opt_retryRequest);\n  }\n};\n\n\n/**\n * Begins a new forward channel operation to the server.\n * @param {ChannelRequest=} opt_retryRequest A failed request to retry.\n * @private\n */\nWebChannelBase.prototype.startForwardChannel_ = function(opt_retryRequest) {\n  'use strict';\n  this.channelDebug_.debug('startForwardChannel_');\n  if (!this.okToMakeRequest_()) {\n    return;  // channel is cancelled\n  } else if (this.state_ == WebChannelBase.State.INIT) {\n    if (opt_retryRequest) {\n      this.channelDebug_.severe('Not supposed to retry the open');\n      return;\n    }\n    this.open_();\n    this.state_ = WebChannelBase.State.OPENING;\n  } else if (this.state_ == WebChannelBase.State.OPENED) {\n    if (opt_retryRequest) {\n      this.makeForwardChannelRequest_(opt_retryRequest);\n      return;\n    }\n\n    if (this.outgoingMaps_.length == 0) {\n      this.channelDebug_.debug(\n          'startForwardChannel_ returned: ' +\n          'nothing to send');\n      // no need to start a new forward channel request\n      return;\n    }\n\n    if (this.forwardChannelRequestPool_.isFull()) {\n      // Should be impossible to be called in this state.\n      this.channelDebug_.severe(\n          'startForwardChannel_ returned: ' +\n          'connection already in progress');\n      return;\n    }\n\n    this.makeForwardChannelRequest_();\n    this.channelDebug_.debug('startForwardChannel_ finished, sent request');\n  }\n};\n\n\n/**\n * Establishes a new channel session with the server.\n * @private\n */\nWebChannelBase.prototype.open_ = function() {\n  'use strict';\n  this.channelDebug_.debug('open_()');\n  this.nextRid_ = Math.floor(Math.random() * 100000);\n\n  const rid = this.nextRid_++;\n  const request =\n      ChannelRequest.createChannelRequest(this, this.channelDebug_, '', rid);\n\n  // mix the init headers\n  let extraHeaders = this.extraHeaders_;\n  if (this.initHeaders_) {\n    if (extraHeaders) {\n      extraHeaders = goog.object.clone(extraHeaders);\n      goog.object.extend(extraHeaders, this.initHeaders_);\n    } else {\n      extraHeaders = this.initHeaders_;\n    }\n  }\n\n  if (this.httpHeadersOverwriteParam_ === null &&\n      !this.encodeInitMessageHeaders_) {\n    request.setExtraHeaders(extraHeaders);\n    extraHeaders = null;\n  }\n\n  let requestText = this.dequeueOutgoingMaps_(\n      request,\n      this.fastHandshake_ ? this.getMaxNumMessagesForFastHandshake_() :\n                            WebChannelBase.MAX_MAPS_PER_REQUEST_);\n\n  const uri = this.forwardChannelUri_.clone();\n  uri.setParameterValue('RID', rid);\n\n  if (this.clientVersion_ > 0) {\n    uri.setParameterValue('CVER', this.clientVersion_);\n  }\n\n  // http-session-id to be generated as the response\n  if (this.getHttpSessionIdParam()) {\n    uri.setParameterValue(\n        WebChannel.X_HTTP_SESSION_ID, this.getHttpSessionIdParam());\n  }\n\n  this.addAdditionalParams_(uri);\n\n  if (extraHeaders) {\n    if (this.encodeInitMessageHeaders_) {\n      let encodedHeaders =\n          httpCors.generateEncodedHttpHeadersOverwriteParam(extraHeaders);\n      requestText = 'headers=' + encodedHeaders + '&' + requestText;\n    } else if (this.httpHeadersOverwriteParam_) {\n      httpCors.setHttpHeadersWithOverwriteParam(\n          uri, this.httpHeadersOverwriteParam_, extraHeaders);\n    }  // else - should not happen\n  }\n\n  this.forwardChannelRequestPool_.addRequest(request);\n\n  if (this.blockingHandshake_) {\n    uri.setParameterValue('TYPE', 'init');  // default to blocking in future\n  }\n\n  // Check the option and use GET to enable QUIC 0-RTT\n  if (this.fastHandshake_) {\n    uri.setParameterValue('$req', requestText);\n\n    // enable handshake upgrade\n    uri.setParameterValue('SID', 'null');\n    request.setDecodeInitialResponse();\n\n    request.xmlHttpPost(uri, null, true);  // Send as a GET\n  } else {\n    request.xmlHttpPost(uri, requestText, true);\n  }\n};\n\n\n/**\n * @return {number} The number of raw JSON messages to be encoded\n * with the fast-handshake (GET) request, including zero. If messages are not\n * encoded as raw JSON data, return WebChannelBase.MAX_MAPS_PER_REQUEST_\n * @private\n */\nWebChannelBase.prototype.getMaxNumMessagesForFastHandshake_ = function() {\n  'use strict';\n  let total = 0;\n  for (let i = 0; i < this.outgoingMaps_.length; i++) {\n    const map = this.outgoingMaps_[i];\n    const size = map.getRawDataSize();\n    if (size === undefined) {\n      break;\n    }\n    total += size;\n\n    if (total > WebChannelBase.MAX_CHARS_PER_GET_) {\n      return i;\n    }\n\n    if (total === WebChannelBase.MAX_CHARS_PER_GET_ ||\n        i === this.outgoingMaps_.length - 1) {\n      return i + 1;\n    }\n  }\n\n  return WebChannelBase.MAX_MAPS_PER_REQUEST_;\n};\n\n\n\n/**\n * Makes a forward channel request using XMLHTTP.\n * @param {!ChannelRequest=} opt_retryRequest A failed request to retry.\n * @private\n */\nWebChannelBase.prototype.makeForwardChannelRequest_ = function(\n    opt_retryRequest) {\n  'use strict';\n  let rid;\n  if (opt_retryRequest) {\n    rid = opt_retryRequest.getRequestId();  // Reuse the same RID for a retry\n  } else {\n    rid = this.nextRid_++;\n  }\n\n  const uri = this.forwardChannelUri_.clone();\n  uri.setParameterValue('SID', this.sid_);\n  uri.setParameterValue('RID', rid);\n  uri.setParameterValue('AID', this.lastArrayId_);\n\n  this.addAdditionalParams_(uri);\n\n  if (this.httpHeadersOverwriteParam_ && this.extraHeaders_) {\n    httpCors.setHttpHeadersWithOverwriteParam(\n        uri, this.httpHeadersOverwriteParam_, this.extraHeaders_);\n  }\n\n  const request = ChannelRequest.createChannelRequest(\n      this, this.channelDebug_, this.sid_, rid,\n      this.forwardChannelRetryCount_ + 1);\n\n  if (this.httpHeadersOverwriteParam_ === null) {\n    request.setExtraHeaders(this.extraHeaders_);\n  }\n\n  let requestText;\n  if (opt_retryRequest) {\n    this.requeuePendingMaps_(opt_retryRequest);\n  }\n  requestText =\n      this.dequeueOutgoingMaps_(request, WebChannelBase.MAX_MAPS_PER_REQUEST_);\n\n  // Randomize from 50%-100% of the forward channel timeout to avoid\n  // a big hit if servers happen to die at once.\n  request.setTimeout(\n      Math.round(this.forwardChannelRequestTimeoutMs_ * 0.50) +\n      Math.round(this.forwardChannelRequestTimeoutMs_ * 0.50 * Math.random()));\n  this.forwardChannelRequestPool_.addRequest(request);\n  request.xmlHttpPost(uri, requestText, true);\n};\n\n\n/**\n * Adds additional query parameters from `extraParams_` and `handler_` to the\n * given URI.\n * @param {!goog.Uri} uri The URI to add the parameters to.\n * @private\n */\nWebChannelBase.prototype.addAdditionalParams_ = function(uri) {\n  'use strict';\n  if (this.extraParams_) {\n    goog.object.forEach(this.extraParams_, function(value, key) {\n      'use strict';\n      uri.setParameterValue(key, value);\n    });\n  }\n\n  if (this.handler_) {\n    const params = this.handler_.getAdditionalParams(this);\n    if (params) {\n      goog.structs.forEach(params, function(value, key, coll) {\n        'use strict';\n        uri.setParameterValue(key, value);\n      });\n    }\n  }\n};\n\n\n/**\n * Returns the request text from the outgoing maps and resets it.\n * @param {!ChannelRequest} request The new request for sending the messages.\n * @param {number} maxNum The maximum number of messages to be encoded\n * @return {string} The encoded request text created from all the currently\n *                  queued outgoing maps.\n * @private\n */\nWebChannelBase.prototype.dequeueOutgoingMaps_ = function(request, maxNum) {\n  'use strict';\n  const count = Math.min(this.outgoingMaps_.length, maxNum);\n\n  const badMapHandler = this.handler_ ?\n      goog.bind(this.handler_.badMapError, this.handler_, this) :\n      null;\n  const result = this.wireCodec_.encodeMessageQueue(\n      this.outgoingMaps_, count, badMapHandler);\n\n  request.setPendingMessages(this.outgoingMaps_.splice(0, count));\n\n  return result;\n};\n\n\n/**\n * Requeues unacknowledged sent arrays for retransmission in the next forward\n * channel request.\n * @param {!ChannelRequest} retryRequest A failed request to retry.\n * @private\n */\nWebChannelBase.prototype.requeuePendingMaps_ = function(retryRequest) {\n  'use strict';\n  this.outgoingMaps_ =\n      retryRequest.getPendingMessages().concat(this.outgoingMaps_);\n};\n\n\n/**\n * Ensures there is a backchannel request for receiving data from the server.\n * @private\n */\nWebChannelBase.prototype.ensureBackChannel_ = function() {\n  'use strict';\n  if (this.backChannelRequest_) {\n    // already have one\n    return;\n  }\n\n  if (this.backChannelTimerId_) {\n    // no need to start a new request - one is already scheduled\n    return;\n  }\n\n  this.backChannelAttemptId_ = 1;\n\n  // Use async.run instead of setTimeout(0) to avoid the 1s message delay\n  // from chrome/firefox background tabs\n  // backChannelTimerId_ stays unset, as with setTimeout(0)\n  goog.async.run(this.onStartBackChannelTimer_, this);\n\n  this.backChannelRetryCount_ = 0;\n};\n\n\n/**\n * Schedules a back-channel retry, unless the max retries has been reached.\n * @return {boolean} true iff a retry was scheduled.\n * @private\n */\nWebChannelBase.prototype.maybeRetryBackChannel_ = function() {\n  'use strict';\n  if (this.backChannelRequest_ || this.backChannelTimerId_) {\n    // Should be impossible to be called in this state.\n    this.channelDebug_.severe('Request already in progress');\n    return false;\n  }\n\n  if (this.backChannelRetryCount_ >= this.getBackChannelMaxRetries()) {\n    return false;\n  }\n\n  this.channelDebug_.debug('Going to retry GET');\n\n  this.backChannelAttemptId_++;\n  this.backChannelTimerId_ = requestStats.setTimeout(\n      goog.bind(this.onStartBackChannelTimer_, this),\n      this.getRetryTime_(this.backChannelRetryCount_));\n  this.backChannelRetryCount_++;\n  return true;\n};\n\n\n/**\n * Timer callback for ensureBackChannel_.\n * @private\n */\nWebChannelBase.prototype.onStartBackChannelTimer_ = function() {\n  'use strict';\n  this.backChannelTimerId_ = null;\n  this.startBackChannel_();\n\n  if (!this.detectBufferingProxy_) {\n    return;\n  }\n\n  if (this.bpDetectionDone_) {\n    return;\n  }\n\n  if (this.backChannelRequest_ == null || this.handshakeRttMs_ <= 0) {\n    this.channelDebug_.warning(\n        'Skip bpDetectionTimerId_ ' + this.backChannelRequest_ + ' ' +\n        this.handshakeRttMs_);\n    return;\n  }\n\n  // This goes with each new request until bpDetectionDone_\n  const bpDetectionTimeout = 2 * this.handshakeRttMs_;\n  this.channelDebug_.info('BP detection timer enabled: ' + bpDetectionTimeout);\n\n  this.bpDetectionTimerId_ = requestStats.setTimeout(\n      goog.bind(this.onBpDetectionTimer_, this), bpDetectionTimeout);\n};\n\n\n/**\n * Timer callback for bpDetection.\n * @private\n */\nWebChannelBase.prototype.onBpDetectionTimer_ = function() {\n  'use strict';\n  if (!this.bpDetectionTimerId_) {\n    this.channelDebug_.warning('Invalid operation.');\n    return;\n  }\n\n  this.bpDetectionTimerId_ = null;\n  this.channelDebug_.info('BP detection timeout reached.');\n\n  goog.asserts.assert(\n      this.backChannelRequest_ != null,\n      'Invalid state: no backchannel request');\n\n  // We wait for extra response payload in addition to just headers to\n  // cancel the timer.\n  if (this.backChannelRequest_.getXhr() != null) {\n    const responseData = this.backChannelRequest_.getXhr().getResponseText();\n    if (responseData) {\n      this.channelDebug_.warning(\n          'Timer should have been cancelled : ' + responseData);\n    }\n  }\n\n  // Enable long-polling\n  this.channelDebug_.info(\n      'Buffering proxy detected and switch to long-polling!');\n  this.enableStreaming_ = false;\n\n  this.bpDetectionDone_ = true;\n  requestStats.notifyStatEvent(requestStats.Stat.PROXY);\n\n  // Cancel the request and start a new one immediately\n  this.cancelBackChannelRequest_();\n  this.startBackChannel_();\n};\n\n\n/**\n * Clears the timer for BP detection.\n * @private\n */\nWebChannelBase.prototype.clearBpDetectionTimer_ = function() {\n  'use strict';\n  if (this.bpDetectionTimerId_ != null) {\n    this.channelDebug_.debug('Cancel the BP detection timer.');\n    goog.global.clearTimeout(this.bpDetectionTimerId_);\n    this.bpDetectionTimerId_ = null;\n  }\n};\n\n\n/**\n * Begins a new back channel operation to the server.\n * @private\n */\nWebChannelBase.prototype.startBackChannel_ = function() {\n  'use strict';\n  if (!this.okToMakeRequest_()) {\n    // channel is cancelled\n    return;\n  }\n\n  this.channelDebug_.debug('Creating new HttpRequest');\n  this.backChannelRequest_ = ChannelRequest.createChannelRequest(\n      this, this.channelDebug_, this.sid_, 'rpc', this.backChannelAttemptId_);\n\n  if (this.httpHeadersOverwriteParam_ === null) {\n    this.backChannelRequest_.setExtraHeaders(this.extraHeaders_);\n  }\n\n  this.backChannelRequest_.setReadyStateChangeThrottle(\n      this.readyStateChangeThrottleMs_);\n  const uri = this.backChannelUri_.clone();\n  uri.setParameterValue('RID', 'rpc');\n  uri.setParameterValue('SID', this.sid_);\n  uri.setParameterValue('CI', this.enableStreaming_ ? '0' : '1');\n  uri.setParameterValue('AID', this.lastArrayId_);\n  uri.setParameterValue('TYPE', 'xmlhttp');\n\n  this.addAdditionalParams_(uri);\n\n  if (this.httpHeadersOverwriteParam_ && this.extraHeaders_) {\n    httpCors.setHttpHeadersWithOverwriteParam(\n        uri, this.httpHeadersOverwriteParam_, this.extraHeaders_);\n  }\n\n  if (this.backChannelRequestTimeoutMs_) {\n    this.backChannelRequest_.setTimeout(this.backChannelRequestTimeoutMs_);\n  }\n\n  this.backChannelRequest_.xmlHttpGet(\n      uri, true /* decodeChunks */, this.hostPrefix_);\n\n  this.channelDebug_.debug('New Request created');\n};\n\n\n/**\n * Gives the handler a chance to return an error code and stop channel\n * execution. A handler might want to do this to check that the user is still\n * logged in, for example.\n * @private\n * @return {boolean} If it's OK to make a request.\n */\nWebChannelBase.prototype.okToMakeRequest_ = function() {\n  'use strict';\n  if (this.handler_) {\n    const result = this.handler_.okToMakeRequest(this);\n    if (result != WebChannelBase.Error.OK) {\n      this.channelDebug_.debug(\n          'Handler returned error code from okToMakeRequest');\n      this.signalError_(result);\n      return false;\n    }\n  }\n  return true;\n};\n\n\n/**\n * @override\n */\nWebChannelBase.prototype.onFirstByteReceived = function(request, responseText) {\n  'use strict';\n  if (this.backChannelRequest_ == request && this.detectBufferingProxy_) {\n    if (!this.bpDetectionDone_) {\n      this.channelDebug_.info(\n          'Great, no buffering proxy detected. Bytes received: ' +\n          responseText.length);\n      goog.asserts.assert(\n          this.bpDetectionTimerId_, 'Timer should not have been cancelled.');\n      this.clearBpDetectionTimer_();\n      this.bpDetectionDone_ = true;\n      requestStats.notifyStatEvent(requestStats.Stat.NOPROXY);\n    }\n  }\n};\n\n\n/**\n * @override\n */\nWebChannelBase.prototype.onRequestData = function(request, responseText) {\n  'use strict';\n  if (this.state_ == WebChannelBase.State.CLOSED ||\n      (this.backChannelRequest_ != request &&\n       !this.forwardChannelRequestPool_.hasRequest(request))) {\n    // either CLOSED or a request we don't know about (perhaps an old request)\n    return;\n  }\n\n  // first to check if request has been upgraded to backchannel\n  if (!request.isInitialResponseDecoded() &&\n      this.forwardChannelRequestPool_.hasRequest(request) &&\n      this.state_ == WebChannelBase.State.OPENED) {\n    let response;\n    try {\n      response = this.wireCodec_.decodeMessage(responseText);\n    } catch (ex) {\n      response = null;\n    }\n    if (Array.isArray(response) && response.length == 3) {\n      this.handlePostResponse_(/** @type {!Array<?>} */ (response), request);\n      this.onForwardChannelFlushed_();\n    } else {\n      this.channelDebug_.debug('Bad POST response data returned');\n      this.signalError_(WebChannelBase.Error.BAD_RESPONSE);\n    }\n  } else {\n    if (request.isInitialResponseDecoded() ||\n        this.backChannelRequest_ == request) {\n      this.clearDeadBackchannelTimer_();\n    }\n\n    if (!goog.string.isEmptyOrWhitespace(responseText)) {\n      let response = this.wireCodec_.decodeMessage(responseText);\n      this.onInput_(/** @type {!Array<?>} */ (response), request);\n    }\n  }\n};\n\n\n/**\n * Checks if we need call the flush callback.\n *\n * @private\n */\nWebChannelBase.prototype.onForwardChannelFlushed_ = function() {\n  'use strict';\n  if (this.forwardChannelRequestPool_.getRequestCount() <= 1) {\n    if (this.forwardChannelFlushedCallback_) {\n      try {\n        this.forwardChannelFlushedCallback_();\n      } catch (ex) {\n        this.channelDebug_.dumpException(\n            ex, 'Exception from forwardChannelFlushedCallback_ ');\n      }\n      // reset\n      this.forwardChannelFlushedCallback_ = undefined;\n    }\n  }\n};\n\n\n/**\n * Handles a POST response from the server.\n * @param {Array<number>} responseValues The key value pairs in\n *     the POST response.\n * @param {!ChannelRequest} forwardReq The forward channel request that\n * triggers this function call.\n * @private\n */\nWebChannelBase.prototype.handlePostResponse_ = function(\n    responseValues, forwardReq) {\n  'use strict';\n  // The first response value is set to 0 if server is missing backchannel.\n  if (responseValues[0] == 0) {\n    this.handleBackchannelMissing_(forwardReq);\n    return;\n  }\n  this.lastPostResponseArrayId_ = responseValues[1];\n  const outstandingArrays = this.lastPostResponseArrayId_ - this.lastArrayId_;\n  if (0 < outstandingArrays) {\n    const numOutstandingBackchannelBytes = responseValues[2];\n    this.channelDebug_.debug(\n        numOutstandingBackchannelBytes + ' bytes (in ' + outstandingArrays +\n        ' arrays) are outstanding on the BackChannel');\n    if (!this.shouldRetryBackChannel_(numOutstandingBackchannelBytes)) {\n      return;\n    }\n    if (!this.deadBackChannelTimerId_) {\n      // We expect to receive data within 2 RTTs or we retry the backchannel.\n      this.deadBackChannelTimerId_ = requestStats.setTimeout(\n          goog.bind(this.onBackChannelDead_, this),\n          2 * WebChannelBase.RTT_ESTIMATE);\n    }\n  }\n};\n\n\n/**\n * Handles a POST response from the server telling us that it has detected that\n * we have no hanging GET connection.\n * @param {!ChannelRequest} forwardReq The forward channel request that\n * triggers this function call.\n * @private\n */\nWebChannelBase.prototype.handleBackchannelMissing_ = function(forwardReq) {\n  'use strict';\n  // As long as the back channel was started before the POST was sent,\n  // we should retry the backchannel. We give a slight buffer of RTT_ESTIMATE\n  // so as not to excessively retry the backchannel\n  this.channelDebug_.debug('Server claims our backchannel is missing.');\n  if (this.backChannelTimerId_) {\n    this.channelDebug_.debug('But we are currently starting the request.');\n    return;\n  } else if (!this.backChannelRequest_) {\n    this.channelDebug_.warning('We do not have a BackChannel established');\n  } else if (\n      this.backChannelRequest_.getRequestStartTime() +\n          WebChannelBase.RTT_ESTIMATE <\n      forwardReq.getRequestStartTime()) {\n    this.clearDeadBackchannelTimer_();\n    this.cancelBackChannelRequest_();\n  } else {\n    return;\n  }\n  this.maybeRetryBackChannel_();\n  requestStats.notifyStatEvent(requestStats.Stat.BACKCHANNEL_MISSING);\n};\n\n\n/**\n * Determines whether we should start the process of retrying a possibly\n * dead backchannel.\n * @param {number} outstandingBytes The number of bytes for which the server has\n *     not yet received acknowledgement.\n * @return {boolean} Whether to start the backchannel retry timer.\n * @private\n */\nWebChannelBase.prototype.shouldRetryBackChannel_ = function(outstandingBytes) {\n  'use strict';\n  // Not too many outstanding bytes, not buffered and not after a retry.\n  return outstandingBytes <\n      WebChannelBase.OUTSTANDING_DATA_BACKCHANNEL_RETRY_CUTOFF &&\n      !this.isBuffered() && this.backChannelRetryCount_ == 0;\n};\n\n\n/**\n * Decides which host prefix should be used, if any.  If there is a handler,\n * allows the handler to validate a host prefix provided by the server, and\n * optionally override it.\n * @param {?string} serverHostPrefix The host prefix provided by the server.\n * @return {?string} The host prefix to actually use, if any. Will return null\n *     if the use of host prefixes was disabled via setAllowHostPrefix().\n * @override\n */\nWebChannelBase.prototype.correctHostPrefix = function(serverHostPrefix) {\n  'use strict';\n  if (this.allowHostPrefix_) {\n    if (this.handler_) {\n      return this.handler_.correctHostPrefix(serverHostPrefix);\n    }\n    return serverHostPrefix;\n  }\n  return null;\n};\n\n\n/**\n * Handles the timer that indicates that our backchannel is no longer able to\n * successfully receive data from the server.\n * @private\n */\nWebChannelBase.prototype.onBackChannelDead_ = function() {\n  'use strict';\n  if (this.deadBackChannelTimerId_ != null) {\n    this.deadBackChannelTimerId_ = null;\n    this.cancelBackChannelRequest_();\n    this.maybeRetryBackChannel_();\n    requestStats.notifyStatEvent(requestStats.Stat.BACKCHANNEL_DEAD);\n  }\n};\n\n\n/**\n * Clears the timer that indicates that our backchannel is no longer able to\n * successfully receive data from the server.\n * @private\n */\nWebChannelBase.prototype.clearDeadBackchannelTimer_ = function() {\n  'use strict';\n  if (this.deadBackChannelTimerId_ != null) {\n    goog.global.clearTimeout(this.deadBackChannelTimerId_);\n    this.deadBackChannelTimerId_ = null;\n  }\n};\n\n\n/**\n * Returns whether or not the given error/status combination is fatal or not.\n * On fatal errors we immediately close the session rather than retrying the\n * failed request.\n * @param {?ChannelRequest.Error} error The error code for the\n * failed request.\n * @param {number} statusCode The last HTTP status code.\n * @return {boolean} Whether or not the error is fatal.\n * @private\n */\nWebChannelBase.isFatalError_ = function(error, statusCode) {\n  'use strict';\n  return error == ChannelRequest.Error.UNKNOWN_SESSION_ID ||\n      (error == ChannelRequest.Error.STATUS && statusCode > 0);\n};\n\n\n/**\n * @override\n */\nWebChannelBase.prototype.onRequestComplete = function(request) {\n  'use strict';\n  this.channelDebug_.debug('Request complete');\n  let type;\n  let pendingMessages = null;\n  if (this.backChannelRequest_ == request) {\n    this.clearDeadBackchannelTimer_();\n    this.clearBpDetectionTimer_();\n    this.backChannelRequest_ = null;\n    type = WebChannelBase.ChannelType_.BACK_CHANNEL;\n  } else if (this.forwardChannelRequestPool_.hasRequest(request)) {\n    pendingMessages = request.getPendingMessages();\n    this.forwardChannelRequestPool_.removeRequest(request);\n    type = WebChannelBase.ChannelType_.FORWARD_CHANNEL;\n  } else {\n    // return if it was an old request from a previous session\n    return;\n  }\n\n  if (this.state_ == WebChannelBase.State.CLOSED) {\n    return;\n  }\n\n  this.lastStatusCode_ = request.getLastStatusCode();\n\n  if (request.getSuccess()) {\n    if (type == WebChannelBase.ChannelType_.FORWARD_CHANNEL) {\n      const size = request.getPostData() ? request.getPostData().length : 0;\n      requestStats.notifyTimingEvent(\n          size, Date.now() - request.getRequestStartTime(),\n          this.forwardChannelRetryCount_);\n      this.ensureForwardChannel_();\n      this.onSuccess_(request);\n    } else {  // i.e., back-channel\n      this.ensureBackChannel_();\n    }\n    return;\n  }\n  // Else unsuccessful. Fall through.\n\n  const lastError = request.getLastError();\n  if (!WebChannelBase.isFatalError_(lastError, this.lastStatusCode_)) {\n    // Maybe retry.\n    const self = this;\n    this.channelDebug_.debug(function() {\n      'use strict';\n      return 'Maybe retrying, last error: ' +\n          ChannelRequest.errorStringFromCode(lastError, self.lastStatusCode_);\n    });\n    if (type == WebChannelBase.ChannelType_.FORWARD_CHANNEL) {\n      if (this.maybeRetryForwardChannel_(request)) {\n        return;\n      }\n    }\n    if (type == WebChannelBase.ChannelType_.BACK_CHANNEL) {\n      if (this.maybeRetryBackChannel_()) {\n        return;\n      }\n    }\n    // Else exceeded max retries. Fall through.\n    this.channelDebug_.debug('Exceeded max number of retries');\n  } else {\n    // Else fatal error. Fall through and mark the pending maps as failed.\n    this.channelDebug_.debug('Not retrying due to error type');\n  }\n\n\n  // Abort the channel now\n\n  // Record pending messages from the failed request\n  if (pendingMessages && pendingMessages.length > 0) {\n    this.forwardChannelRequestPool_.addPendingMessages(pendingMessages);\n  }\n\n  this.channelDebug_.debug('Error: HTTP request failed');\n  switch (lastError) {\n    case ChannelRequest.Error.NO_DATA:\n      this.signalError_(WebChannelBase.Error.NO_DATA);\n      break;\n    case ChannelRequest.Error.BAD_DATA:\n      this.signalError_(WebChannelBase.Error.BAD_DATA);\n      break;\n    case ChannelRequest.Error.UNKNOWN_SESSION_ID:\n      this.signalError_(WebChannelBase.Error.UNKNOWN_SESSION_ID);\n      break;\n    default:\n      this.signalError_(WebChannelBase.Error.REQUEST_FAILED);\n      break;\n  }\n};\n\n\n/**\n * @param {number} retryCount Number of retries so far.\n * @return {number} Time in ms before firing next retry request.\n * @private\n */\nWebChannelBase.prototype.getRetryTime_ = function(retryCount) {\n  'use strict';\n  let retryTime = this.baseRetryDelayMs_ +\n      Math.floor(Math.random() * this.retryDelaySeedMs_);\n  if (!this.isActive()) {\n    this.channelDebug_.debug('Inactive channel');\n    retryTime = retryTime * WebChannelBase.INACTIVE_CHANNEL_RETRY_FACTOR;\n  }\n  // Backoff for subsequent retries\n  retryTime *= retryCount;\n  return retryTime;\n};\n\n\n/**\n * @param {number} baseDelayMs The base part of the retry delay, in ms.\n * @param {number} delaySeedMs A random delay between 0 and this is added to\n *     the base part.\n */\nWebChannelBase.prototype.setRetryDelay = function(baseDelayMs, delaySeedMs) {\n  'use strict';\n  this.baseRetryDelayMs_ = baseDelayMs;\n  this.retryDelaySeedMs_ = delaySeedMs;\n};\n\n\n/**\n * Apply any handshake control headers.\n * @param {!ChannelRequest} request The underlying request object\n * @private\n */\nWebChannelBase.prototype.applyControlHeaders_ = function(request) {\n  'use strict';\n  const xhr = request.getXhr();\n  if (xhr) {\n    const clientProtocol =\n        xhr.getStreamingResponseHeader(WebChannel.X_CLIENT_WIRE_PROTOCOL);\n    if (clientProtocol) {\n      this.forwardChannelRequestPool_.applyClientProtocol(clientProtocol);\n    }\n\n    if (this.getHttpSessionIdParam()) {\n      const httpSessionIdHeader =\n          xhr.getStreamingResponseHeader(WebChannel.X_HTTP_SESSION_ID);\n      if (httpSessionIdHeader) {\n        this.setHttpSessionId(httpSessionIdHeader);\n        // update the cached uri\n        const httpSessionIdParam = this.getHttpSessionIdParam();\n\n        this.forwardChannelUri_.setParameterValue(\n            /** @type {string} */ (httpSessionIdParam),  // never null\n            httpSessionIdHeader);\n      } else {\n        this.channelDebug_.warning(\n            'Missing X_HTTP_SESSION_ID in the handshake response');\n      }\n    }\n  }\n};\n\n\n/**\n * Processes the data returned by the server.\n * @param {!Array<!Array<?>>} respArray The response array returned\n *     by the server.\n * @param {!ChannelRequest} request The underlying request object\n * @private\n */\nWebChannelBase.prototype.onInput_ = function(respArray, request) {\n  'use strict';\n  const batch =\n      this.handler_ && this.handler_.channelHandleMultipleArrays ? [] : null;\n  for (let i = 0; i < respArray.length; i++) {\n    let nextArray = respArray[i];\n    this.lastArrayId_ = nextArray[0];\n    nextArray = nextArray[1];\n    if (this.state_ == WebChannelBase.State.OPENING) {\n      if (nextArray[0] == 'c') {\n        this.sid_ = nextArray[1];\n        this.hostPrefix_ = this.correctHostPrefix(nextArray[2]);\n\n        const negotiatedVersion = nextArray[3];\n        if (negotiatedVersion != null) {\n          this.channelVersion_ = negotiatedVersion;\n          this.channelDebug_.info('VER=' + this.channelVersion_);\n        }\n\n        const negotiatedServerVersion = nextArray[4];\n        if (negotiatedServerVersion != null) {\n          this.serverVersion_ = negotiatedServerVersion;\n          this.channelDebug_.info('SVER=' + this.serverVersion_);\n        }\n\n        // CVER=22\n        const serverKeepaliveMs = nextArray[5];\n        if (serverKeepaliveMs != null &&\n            typeof serverKeepaliveMs === 'number' && serverKeepaliveMs > 0) {\n          const timeout = 1.5 * serverKeepaliveMs;\n          this.backChannelRequestTimeoutMs_ = timeout;\n          this.channelDebug_.info('backChannelRequestTimeoutMs_=' + timeout);\n        }\n\n        this.applyControlHeaders_(request);\n\n        this.state_ = WebChannelBase.State.OPENED;\n        if (this.handler_) {\n          this.handler_.channelOpened(this);\n        }\n\n        if (this.detectBufferingProxy_) {\n          this.handshakeRttMs_ = Date.now() - request.getRequestStartTime();\n          this.channelDebug_.info(\n              'Handshake RTT: ' + this.handshakeRttMs_ + 'ms');\n        }\n\n        this.startBackchannelAfterHandshake_(request);\n\n        if (this.outgoingMaps_.length > 0) {\n          this.ensureForwardChannel_();\n        }\n      } else if (nextArray[0] == 'stop' || nextArray[0] == 'close') {\n        // treat close also as an abort\n        this.signalError_(WebChannelBase.Error.STOP);\n      }\n    } else if (this.state_ == WebChannelBase.State.OPENED) {\n      if (nextArray[0] == 'stop' || nextArray[0] == 'close') {\n        if (batch && !(batch.length === 0)) {\n          this.handler_.channelHandleMultipleArrays(this, batch);\n          batch.length = 0;\n        }\n        if (nextArray[0] == 'stop') {\n          this.signalError_(WebChannelBase.Error.STOP);\n        } else {\n          this.disconnect();\n        }\n      } else if (nextArray[0] == 'noop') {\n        // ignore - noop to keep connection happy\n      } else {\n        if (batch) {\n          batch.push(nextArray);\n        } else if (this.handler_) {\n          this.handler_.channelHandleArray(this, nextArray);\n        }\n      }\n      // We have received useful data on the back-channel, so clear its retry\n      // count. We do this because back-channels by design do not complete\n      // quickly, so on a flaky connection we could have many fail to complete\n      // fully but still deliver a lot of data before they fail. We don't want\n      // to count such failures towards the retry limit, because we don't want\n      // to give up on a session if we can still receive data.\n      this.backChannelRetryCount_ = 0;\n    }\n  }\n  if (batch && !(batch.length === 0)) {\n    this.handler_.channelHandleMultipleArrays(this, batch);\n  }\n};\n\n\n/**\n * Starts the backchannel after the handshake.\n *\n * @param {!ChannelRequest} request The underlying request object\n * @private\n */\nWebChannelBase.prototype.startBackchannelAfterHandshake_ = function(request) {\n  'use strict';\n  this.backChannelUri_ = this.getBackChannelUri(\n      this.hostPrefix_, /** @type {string} */ (this.path_));\n\n  if (request.isInitialResponseDecoded()) {\n    this.channelDebug_.debug('Upgrade the handshake request to a backchannel.');\n    this.forwardChannelRequestPool_.removeRequest(request);\n    request.resetTimeout(this.backChannelRequestTimeoutMs_);\n    this.backChannelRequest_ = request;\n  } else {\n    this.ensureBackChannel_();\n  }\n};\n\n\n/**\n * Helper to ensure the channel is in the expected state.\n * @param {...number} var_args The channel must be in one of the indicated\n *     states.\n * @private\n */\nWebChannelBase.prototype.ensureInState_ = function(var_args) {\n  'use strict';\n  goog.asserts.assert(\n      goog.array.contains(arguments, this.state_),\n      'Unexpected channel state: %s', this.state_);\n};\n\n\n/**\n * Signals an error has occurred.\n * @param {WebChannelBase.Error} error The error code for the failure.\n * @private\n */\nWebChannelBase.prototype.signalError_ = function(error) {\n  'use strict';\n  this.channelDebug_.info('Error code ' + error);\n  if (error == WebChannelBase.Error.REQUEST_FAILED) {\n    // Create a separate Internet connection to check\n    // if it's a server error or user's network error.\n    let imageUri = null;\n    if (this.handler_) {\n      imageUri = this.handler_.getNetworkTestImageUri(this);\n    }\n    netUtils.testNetwork(goog.bind(this.testNetworkCallback_, this), imageUri);\n  } else {\n    requestStats.notifyStatEvent(requestStats.Stat.ERROR_OTHER);\n  }\n  this.onError_(error);\n};\n\n\n/**\n * Callback for netUtils.testNetwork during error handling.\n * @param {boolean} networkUp Whether the network is up.\n * @private\n */\nWebChannelBase.prototype.testNetworkCallback_ = function(networkUp) {\n  'use strict';\n  if (networkUp) {\n    this.channelDebug_.info('Successfully pinged google.com');\n    requestStats.notifyStatEvent(requestStats.Stat.ERROR_OTHER);\n  } else {\n    this.channelDebug_.info('Failed to ping google.com');\n    requestStats.notifyStatEvent(requestStats.Stat.ERROR_NETWORK);\n    // Do not call onError_ again to eliminate duplicated Error events.\n  }\n};\n\n\n/**\n * Called when messages have been successfully sent from the queue.\n * @param {!ChannelRequest} request The request object\n * @private\n */\nWebChannelBase.prototype.onSuccess_ = function(request) {\n  'use strict';\n  if (this.handler_) {\n    this.handler_.channelSuccess(this, request);\n  }\n};\n\n\n/**\n * Called when we've determined the final error for a channel. It closes the\n * notifiers the handler of the error and closes the channel.\n * @param {WebChannelBase.Error} error  The error code for the failure.\n * @private\n */\nWebChannelBase.prototype.onError_ = function(error) {\n  'use strict';\n  this.channelDebug_.debug('HttpChannel: error - ' + error);\n  this.state_ = WebChannelBase.State.CLOSED;\n  if (this.handler_) {\n    this.handler_.channelError(this, error);\n  }\n  this.onClose_();\n  this.cancelRequests_();\n};\n\n\n/**\n * Called when the channel has been closed. It notifiers the handler of the\n * event, and reports any pending or undelivered maps.\n * @private\n */\nWebChannelBase.prototype.onClose_ = function() {\n  'use strict';\n  this.state_ = WebChannelBase.State.CLOSED;\n  this.nonAckedMapsAtChannelClose_ = [];\n  if (this.handler_) {\n    const pendingMessages =\n        this.forwardChannelRequestPool_.getPendingMessages();\n\n    if (pendingMessages.length == 0 && this.outgoingMaps_.length == 0) {\n      this.handler_.channelClosed(this);\n    } else {\n      this.channelDebug_.debug(\n          () => 'Number of undelivered maps' +\n              ', pending: ' + pendingMessages.length +\n              ', outgoing: ' + this.outgoingMaps_.length);\n\n      goog.array.extend(this.nonAckedMapsAtChannelClose_, pendingMessages);\n      goog.array.extend(this.nonAckedMapsAtChannelClose_, this.outgoingMaps_);\n\n      this.forwardChannelRequestPool_.clearPendingMessages();\n\n      const copyOfUndeliveredMaps = goog.array.clone(this.outgoingMaps_);\n      this.outgoingMaps_.length = 0;\n\n      this.handler_.channelClosed(this, pendingMessages, copyOfUndeliveredMaps);\n    }\n  }\n};\n\n/**\n * @return {!Array<!Wire.QueuedMap>} Returns the list of non-acked maps, both\n * during an active channel or after the channel is closed. Refer to the\n * `getNonAckedMessages()` API for definitions of non-acked messages.\n */\nWebChannelBase.prototype.getNonAckedMaps = function() {\n  if (this.state_ == WebChannelBase.State.CLOSED) {\n    goog.asserts.assert(\n        this.nonAckedMapsAtChannelClose_ != null,\n        'nonAckedMapsAtChannelClose_ is not set after channel close.');\n    return this.nonAckedMapsAtChannelClose_;\n  }\n\n  // The underlying message objects are not cloned and thus exposes a mutability\n  // risk, but is chosen to make strict equality (i.e. ===) checks possible for\n  // callers.\n  let unAckedMaps = [];\n  goog.array.extend(\n      unAckedMaps, this.forwardChannelRequestPool_.getPendingMessages());\n  goog.array.extend(unAckedMaps, this.outgoingMaps_);\n\n  return unAckedMaps;\n};\n\n\n/**\n * @override\n */\nWebChannelBase.prototype.getForwardChannelUri = function(path) {\n  'use strict';\n  const uri = this.createDataUri(null, path);\n  this.channelDebug_.debug('GetForwardChannelUri: ' + uri);\n  return uri;\n};\n\n\n/**\n * @override\n */\nWebChannelBase.prototype.getConnectionState = function() {\n  'use strict';\n  return this.connState_;\n};\n\n\n/**\n * @override\n */\nWebChannelBase.prototype.getBackChannelUri = function(hostPrefix, path) {\n  'use strict';\n  const uri = this.createDataUri(\n      this.shouldUseSecondaryDomains() ? hostPrefix : null, path);\n  this.channelDebug_.debug('GetBackChannelUri: ' + uri);\n  return uri;\n};\n\n\n/**\n * @override\n */\nWebChannelBase.prototype.createDataUri = function(\n    hostPrefix, path, opt_overridePort) {\n  'use strict';\n  let uri = goog.Uri.parse(path);\n  const uriAbsolute = (uri.getDomain() != '');\n  if (uriAbsolute) {\n    if (hostPrefix) {\n      uri.setDomain(hostPrefix + '.' + uri.getDomain());\n    }\n\n    uri.setPort(opt_overridePort || uri.getPort());\n  } else {\n    const locationPage = goog.global.location;\n    let hostName;\n    if (hostPrefix) {\n      hostName = hostPrefix + '.' + locationPage.hostname;\n    } else {\n      hostName = locationPage.hostname;\n    }\n\n    const port = opt_overridePort || +locationPage.port;\n\n    uri = goog.Uri.create(locationPage.protocol, null, hostName, port, path);\n  }\n\n  const param = this.getHttpSessionIdParam();\n  const value = this.getHttpSessionId();\n  if (param && value) {\n    uri.setParameterValue(param, value);\n  }\n\n  // Add the protocol version to the URI.\n  uri.setParameterValue('VER', this.channelVersion_);\n\n  this.addAdditionalParams_(uri);\n\n  return uri;\n};\n\n/**\n * @override\n * @param {?string} hostPrefix The host prefix, if we need an XhrIo object\n *     capable of calling a secondary domain.\n * @param {boolean=} isStreaming Whether or not fetch/streams are enabled for\n *     the underlying HTTP request.\n * @return {!goog.net.XhrIo} A new XhrIo object.\n */\nWebChannelBase.prototype.createXhrIo = function(hostPrefix, isStreaming) {\n  'use strict';\n  if (hostPrefix && !this.supportsCrossDomainXhrs_) {\n    throw new Error('Can\\'t create secondary domain capable XhrIo object.');\n  }\n  let xhr;\n  if (isStreaming && this.usesFetchStreams_ && !this.xmlHttpFactory_) {\n    xhr = new goog.net.XhrIo(\n        new goog.net.FetchXmlHttpFactory({streamBinaryChunks: true}));\n  } else {\n    xhr = new goog.net.XhrIo(this.xmlHttpFactory_);\n  }\n  xhr.setWithCredentials(this.supportsCrossDomainXhrs_);\n  return xhr;\n};\n\n\n/**\n * @override\n */\nWebChannelBase.prototype.isActive = function() {\n  'use strict';\n  return !!this.handler_ && this.handler_.isActive(this);\n};\n\n\n/**\n * @override\n */\nWebChannelBase.prototype.shouldUseSecondaryDomains = function() {\n  'use strict';\n  return this.supportsCrossDomainXhrs_;\n};\n\n\n/**\n * Sets (overwrites) the forward channel flush callback.\n *\n * @param {function()} callback The callback to be invoked.\n */\nWebChannelBase.prototype.setForwardChannelFlushCallback = function(callback) {\n  'use strict';\n  this.forwardChannelFlushedCallback_ = callback;\n};\n\n\n/**\n * Abstract base class for the channel handler\n * @constructor\n * @struct\n */\nWebChannelBase.Handler = function() {};\n\n\n/**\n * Callback handler for when a batch of response arrays is received from the\n * server. When null, batched dispatching is disabled.\n * @type {?function(!WebChannelBase, !Array<!Array<?>>)}\n */\nWebChannelBase.Handler.prototype.channelHandleMultipleArrays = null;\n\n\n/**\n * Whether it's okay to make a request to the server. A handler can return\n * false if the channel should fail. For example, if the user has logged out,\n * the handler may want all requests to fail immediately.\n * @param {WebChannelBase} channel The channel.\n * @return {WebChannelBase.Error} An error code. The code should\n * return WebChannelBase.Error.OK to indicate it's okay. Any other\n * error code will cause a failure.\n */\nWebChannelBase.Handler.prototype.okToMakeRequest = function(channel) {\n  'use strict';\n  return WebChannelBase.Error.OK;\n};\n\n\n/**\n * Indicates the WebChannel has successfully negotiated with the server\n * and can now send and receive data.\n * @param {WebChannelBase} channel The channel.\n */\nWebChannelBase.Handler.prototype.channelOpened = function(channel) {};\n\n\n/**\n * New input is available for the application to process.\n *\n * @param {WebChannelBase} channel The channel.\n * @param {Array<?>} array The data array.\n */\nWebChannelBase.Handler.prototype.channelHandleArray = function(\n    channel, array) {};\n\n\n/**\n * Indicates messages that have been successfully sent on the channel.\n *\n * @param {WebChannelBase} channel The channel.\n * @param {!ChannelRequest} request The request object that contains\n *     the pending messages that have been successfully delivered to the server.\n */\nWebChannelBase.Handler.prototype.channelSuccess = function(channel, request) {};\n\n\n/**\n * Indicates an error occurred on the WebChannel.\n *\n * @param {WebChannelBase} channel The channel.\n * @param {WebChannelBase.Error} error The error code.\n */\nWebChannelBase.Handler.prototype.channelError = function(channel, error) {};\n\n\n/**\n * Indicates the WebChannel is closed. Also notifies about which maps,\n * if any, that may not have been delivered to the server.\n * @param {WebChannelBase} channel The channel.\n * @param {Array<Wire.QueuedMap>=} opt_pendingMaps The\n *     array of pending maps, which may or may not have been delivered to the\n *     server.\n * @param {Array<Wire.QueuedMap>=} opt_undeliveredMaps\n *     The array of undelivered maps, which have definitely not been delivered\n *     to the server.\n */\nWebChannelBase.Handler.prototype.channelClosed = function(\n    channel, opt_pendingMaps, opt_undeliveredMaps) {};\n\n\n/**\n * Gets any parameters that should be added at the time another connection is\n * made to the server.\n * @param {WebChannelBase} channel The channel.\n * @return {!Object} Extra parameter keys and values to add to the requests.\n */\nWebChannelBase.Handler.prototype.getAdditionalParams = function(channel) {\n  'use strict';\n  return {};\n};\n\n\n/**\n * Gets the URI of an image that can be used to test network connectivity.\n * @param {WebChannelBase} channel The channel.\n * @return {goog.Uri?} A custom URI to load for the network test.\n */\nWebChannelBase.Handler.prototype.getNetworkTestImageUri = function(channel) {\n  'use strict';\n  return null;\n};\n\n\n/**\n * Gets whether this channel is currently active. This is used to determine the\n * length of time to wait before retrying.\n * @param {WebChannelBase} channel The channel.\n * @return {boolean} Whether the channel is currently active.\n */\nWebChannelBase.Handler.prototype.isActive = function(channel) {\n  'use strict';\n  return true;\n};\n\n/**\n * Whether or not this channel uses WHATWG Fetch/streams.\n * @override\n * @return {boolean}\n */\nWebChannelBase.prototype.usesFetchStreams = function() {\n  'use strict';\n  return this.usesFetchStreams_;\n};\n\n\n/**\n * Called by the channel if enumeration of the map throws an exception.\n * @param {WebChannelBase} channel The channel.\n * @param {Object} map The map that can't be enumerated.\n */\nWebChannelBase.Handler.prototype.badMapError = function(channel, map) {};\n\n\n/**\n * Allows the handler to override a host prefix provided by the server. Will\n * be called whenever the channel has received such a prefix and is considering\n * its use.\n * @param {?string} serverHostPrefix The host prefix provided by the server.\n * @return {?string} The host prefix the client should use.\n */\nWebChannelBase.Handler.prototype.correctHostPrefix = function(\n    serverHostPrefix) {\n  'use strict';\n  return serverHostPrefix;\n};\n});  // goog.scope\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Class for parsing and formatting URIs.\n *\n * This package is deprecated in favour of the Closure URL package (goog.url)\n * when manipulating URIs for use by a browser. This package uses regular\n * expressions to parse a potential URI which can fall out of sync with how a\n * browser will actually interpret the URI. See\n * `goog.uri.utils.setUrlPackageSupportLoggingHandler` for one way to identify\n * URIs that should instead be parsed using the URL package.\n *\n * Use goog.Uri(string) to parse a URI string.  Use goog.Uri.create(...) to\n * create a new instance of the goog.Uri object from Uri parts.\n *\n * e.g: <code>var myUri = new goog.Uri(window.location);</code>\n *\n * Implements RFC 3986 for parsing/formatting URIs.\n * http://www.ietf.org/rfc/rfc3986.txt\n *\n * Some changes have been made to the interface (more like .NETs), though the\n * internal representation is now of un-encoded parts, this will change the\n * behavior slightly.\n */\n\ngoog.provide('goog.Uri');\ngoog.provide('goog.Uri.QueryData');\n\ngoog.require('goog.array');\ngoog.require('goog.asserts');\ngoog.require('goog.collections.maps');\ngoog.require('goog.string');\ngoog.require('goog.structs');\ngoog.require('goog.uri.utils');\ngoog.require('goog.uri.utils.ComponentIndex');\ngoog.require('goog.uri.utils.StandardQueryParam');\n\n\n\n/**\n * This class contains setters and getters for the parts of the URI.\n * The <code>getXyz</code>/<code>setXyz</code> methods return the decoded part\n * -- so<code>goog.Uri.parse('/foo%20bar').getPath()</code> will return the\n * decoded path, <code>/foo bar</code>.\n *\n * Reserved characters (see RFC 3986 section 2.2) can be present in\n * their percent-encoded form in scheme, domain, and path URI components and\n * will not be auto-decoded. For example:\n * <code>goog.Uri.parse('rel%61tive/path%2fto/resource').getPath()</code> will\n * return <code>relative/path%2fto/resource</code>.\n *\n * The constructor accepts an optional unparsed, raw URI string.  The parser\n * is relaxed, so special characters that aren't escaped but don't cause\n * ambiguities will not cause parse failures.\n *\n * All setters return <code>this</code> and so may be chained, a la\n * <code>goog.Uri.parse('/foo').setFragment('part').toString()</code>.\n *\n * @param {*=} opt_uri Optional string URI to parse\n *        (use goog.Uri.create() to create a URI from parts), or if\n *        a goog.Uri is passed, a clone is created.\n * @param {boolean=} opt_ignoreCase If true, #getParameterValue will ignore\n * the case of the parameter name.\n *\n * @throws URIError If opt_uri is provided and URI is malformed (that is,\n *     if decodeURIComponent fails on any of the URI components).\n * @constructor\n * @struct\n */\ngoog.Uri = function(opt_uri, opt_ignoreCase) {\n  'use strict';\n  /**\n   * Scheme such as \"http\".\n   * @private {string}\n   */\n  this.scheme_ = '';\n\n  /**\n   * User credentials in the form \"username:password\".\n   * @private {string}\n   */\n  this.userInfo_ = '';\n\n  /**\n   * Domain part, e.g. \"www.google.com\".\n   * @private {string}\n   */\n  this.domain_ = '';\n\n  /**\n   * Port, e.g. 8080.\n   * @private {?number}\n   */\n  this.port_ = null;\n\n  /**\n   * Path, e.g. \"/tests/img.png\".\n   * @private {string}\n   */\n  this.path_ = '';\n\n  /**\n   * The fragment without the #.\n   * @private {string}\n   */\n  this.fragment_ = '';\n\n  /**\n   * Whether or not this Uri should be treated as Read Only.\n   * @private {boolean}\n   */\n  this.isReadOnly_ = false;\n\n  /**\n   * Whether or not to ignore case when comparing query params.\n   * @private {boolean}\n   */\n  this.ignoreCase_ = false;\n\n  /**\n   * Object representing query data.\n   * @private {!goog.Uri.QueryData}\n   */\n  this.queryData_;\n\n  // Parse in the uri string\n  var m;\n  if (opt_uri instanceof goog.Uri) {\n    this.ignoreCase_ = (opt_ignoreCase !== undefined) ? opt_ignoreCase :\n                                                        opt_uri.getIgnoreCase();\n    this.setScheme(opt_uri.getScheme());\n    this.setUserInfo(opt_uri.getUserInfo());\n    this.setDomain(opt_uri.getDomain());\n    this.setPort(opt_uri.getPort());\n    this.setPath(opt_uri.getPath());\n    this.setQueryData(opt_uri.getQueryData().clone());\n    this.setFragment(opt_uri.getFragment());\n  } else if (opt_uri && (m = goog.uri.utils.split(String(opt_uri)))) {\n    this.ignoreCase_ = !!opt_ignoreCase;\n\n    // Set the parts -- decoding as we do so.\n    // COMPATIBILITY NOTE - In IE, unmatched fields may be empty strings,\n    // whereas in other browsers they will be undefined.\n    this.setScheme(m[goog.uri.utils.ComponentIndex.SCHEME] || '', true);\n    this.setUserInfo(m[goog.uri.utils.ComponentIndex.USER_INFO] || '', true);\n    this.setDomain(m[goog.uri.utils.ComponentIndex.DOMAIN] || '', true);\n    this.setPort(m[goog.uri.utils.ComponentIndex.PORT]);\n    this.setPath(m[goog.uri.utils.ComponentIndex.PATH] || '', true);\n    this.setQueryData(m[goog.uri.utils.ComponentIndex.QUERY_DATA] || '', true);\n    this.setFragment(m[goog.uri.utils.ComponentIndex.FRAGMENT] || '', true);\n\n  } else {\n    this.ignoreCase_ = !!opt_ignoreCase;\n    this.queryData_ = new goog.Uri.QueryData(null, this.ignoreCase_);\n  }\n};\n\n\n/**\n * Parameter name added to stop caching.\n * @type {string}\n */\ngoog.Uri.RANDOM_PARAM = goog.uri.utils.StandardQueryParam.RANDOM;\n\n\n/**\n * @return {string} The string form of the url.\n * @override\n */\ngoog.Uri.prototype.toString = function() {\n  'use strict';\n  var out = [];\n\n  var scheme = this.getScheme();\n  if (scheme) {\n    out.push(\n        goog.Uri.encodeSpecialChars_(\n            scheme, goog.Uri.reDisallowedInSchemeOrUserInfo_, true),\n        ':');\n  }\n\n  var domain = this.getDomain();\n  if (domain || scheme == 'file') {\n    out.push('//');\n\n    var userInfo = this.getUserInfo();\n    if (userInfo) {\n      out.push(\n          goog.Uri.encodeSpecialChars_(\n              userInfo, goog.Uri.reDisallowedInSchemeOrUserInfo_, true),\n          '@');\n    }\n\n    out.push(goog.Uri.removeDoubleEncoding_(goog.string.urlEncode(domain)));\n\n    var port = this.getPort();\n    if (port != null) {\n      out.push(':', String(port));\n    }\n  }\n\n  var path = this.getPath();\n  if (path) {\n    if (this.hasDomain() && path.charAt(0) != '/') {\n      out.push('/');\n    }\n    out.push(goog.Uri.encodeSpecialChars_(\n        path,\n        path.charAt(0) == '/' ? goog.Uri.reDisallowedInAbsolutePath_ :\n                                goog.Uri.reDisallowedInRelativePath_,\n        true));\n  }\n\n  var query = this.getEncodedQuery();\n  if (query) {\n    out.push('?', query);\n  }\n\n  var fragment = this.getFragment();\n  if (fragment) {\n    out.push(\n        '#',\n        goog.Uri.encodeSpecialChars_(\n            fragment, goog.Uri.reDisallowedInFragment_));\n  }\n  return out.join('');\n};\n\n\n/**\n * Resolves the given relative URI (a goog.Uri object), using the URI\n * represented by this instance as the base URI.\n *\n * There are several kinds of relative URIs:<br>\n * 1. foo - replaces the last part of the path, the whole query and fragment<br>\n * 2. /foo - replaces the path, the query and fragment<br>\n * 3. //foo - replaces everything from the domain on.  foo is a domain name<br>\n * 4. ?foo - replace the query and fragment<br>\n * 5. #foo - replace the fragment only\n *\n * Additionally, if relative URI has a non-empty path, all \"..\" and \".\"\n * segments will be resolved, as described in RFC 3986.\n *\n * @param {!goog.Uri} relativeUri The relative URI to resolve.\n * @return {!goog.Uri} The resolved URI.\n */\ngoog.Uri.prototype.resolve = function(relativeUri) {\n  'use strict';\n  var absoluteUri = this.clone();\n\n  // we satisfy these conditions by looking for the first part of relativeUri\n  // that is not blank and applying defaults to the rest\n\n  var overridden = relativeUri.hasScheme();\n\n  if (overridden) {\n    absoluteUri.setScheme(relativeUri.getScheme());\n  } else {\n    overridden = relativeUri.hasUserInfo();\n  }\n\n  if (overridden) {\n    absoluteUri.setUserInfo(relativeUri.getUserInfo());\n  } else {\n    overridden = relativeUri.hasDomain();\n  }\n\n  if (overridden) {\n    absoluteUri.setDomain(relativeUri.getDomain());\n  } else {\n    overridden = relativeUri.hasPort();\n  }\n\n  var path = relativeUri.getPath();\n  if (overridden) {\n    absoluteUri.setPort(relativeUri.getPort());\n  } else {\n    overridden = relativeUri.hasPath();\n    if (overridden) {\n      // resolve path properly\n      if (path.charAt(0) != '/') {\n        // path is relative\n        if (this.hasDomain() && !this.hasPath()) {\n          // RFC 3986, section 5.2.3, case 1\n          path = '/' + path;\n        } else {\n          // RFC 3986, section 5.2.3, case 2\n          var lastSlashIndex = absoluteUri.getPath().lastIndexOf('/');\n          if (lastSlashIndex != -1) {\n            path = absoluteUri.getPath().substr(0, lastSlashIndex + 1) + path;\n          }\n        }\n      }\n      path = goog.Uri.removeDotSegments(path);\n    }\n  }\n\n  if (overridden) {\n    absoluteUri.setPath(path);\n  } else {\n    overridden = relativeUri.hasQuery();\n  }\n\n  if (overridden) {\n    absoluteUri.setQueryData(relativeUri.getQueryData().clone());\n  } else {\n    overridden = relativeUri.hasFragment();\n  }\n\n  if (overridden) {\n    absoluteUri.setFragment(relativeUri.getFragment());\n  }\n\n  return absoluteUri;\n};\n\n\n/**\n * Clones the URI instance.\n * @return {!goog.Uri} New instance of the URI object.\n */\ngoog.Uri.prototype.clone = function() {\n  'use strict';\n  return new goog.Uri(this);\n};\n\n\n/**\n * @return {string} The encoded scheme/protocol for the URI.\n */\ngoog.Uri.prototype.getScheme = function() {\n  'use strict';\n  return this.scheme_;\n};\n\n\n/**\n * Sets the scheme/protocol.\n * @throws URIError If opt_decode is true and newScheme is malformed (that is,\n *     if decodeURIComponent fails).\n * @param {string} newScheme New scheme value.\n * @param {boolean=} opt_decode Optional param for whether to decode new value.\n * @return {!goog.Uri} Reference to this URI object.\n */\ngoog.Uri.prototype.setScheme = function(newScheme, opt_decode) {\n  'use strict';\n  this.enforceReadOnly();\n  this.scheme_ =\n      opt_decode ? goog.Uri.decodeOrEmpty_(newScheme, true) : newScheme;\n\n  // remove an : at the end of the scheme so somebody can pass in\n  // window.location.protocol\n  if (this.scheme_) {\n    this.scheme_ = this.scheme_.replace(/:$/, '');\n  }\n  return this;\n};\n\n\n/**\n * @return {boolean} Whether the scheme has been set.\n */\ngoog.Uri.prototype.hasScheme = function() {\n  'use strict';\n  return !!this.scheme_;\n};\n\n\n/**\n * @return {string} The decoded user info.\n */\ngoog.Uri.prototype.getUserInfo = function() {\n  'use strict';\n  return this.userInfo_;\n};\n\n\n/**\n * Sets the userInfo.\n * @throws URIError If opt_decode is true and newUserInfo is malformed (that is,\n *     if decodeURIComponent fails).\n * @param {string} newUserInfo New userInfo value.\n * @param {boolean=} opt_decode Optional param for whether to decode new value.\n * @return {!goog.Uri} Reference to this URI object.\n */\ngoog.Uri.prototype.setUserInfo = function(newUserInfo, opt_decode) {\n  'use strict';\n  this.enforceReadOnly();\n  this.userInfo_ =\n      opt_decode ? goog.Uri.decodeOrEmpty_(newUserInfo) : newUserInfo;\n  return this;\n};\n\n\n/**\n * @return {boolean} Whether the user info has been set.\n */\ngoog.Uri.prototype.hasUserInfo = function() {\n  'use strict';\n  return !!this.userInfo_;\n};\n\n\n/**\n * @return {string} The decoded domain.\n */\ngoog.Uri.prototype.getDomain = function() {\n  'use strict';\n  return this.domain_;\n};\n\n\n/**\n * Sets the domain.\n * @throws URIError If opt_decode is true and newDomain is malformed (that is,\n *     if decodeURIComponent fails).\n * @param {string} newDomain New domain value.\n * @param {boolean=} opt_decode Optional param for whether to decode new value.\n * @return {!goog.Uri} Reference to this URI object.\n */\ngoog.Uri.prototype.setDomain = function(newDomain, opt_decode) {\n  'use strict';\n  this.enforceReadOnly();\n  this.domain_ =\n      opt_decode ? goog.Uri.decodeOrEmpty_(newDomain, true) : newDomain;\n  return this;\n};\n\n\n/**\n * @return {boolean} Whether the domain has been set.\n */\ngoog.Uri.prototype.hasDomain = function() {\n  'use strict';\n  return !!this.domain_;\n};\n\n\n/**\n * @return {?number} The port number.\n */\ngoog.Uri.prototype.getPort = function() {\n  'use strict';\n  return this.port_;\n};\n\n\n/**\n * Sets the port number.\n * @param {*} newPort Port number. Will be explicitly casted to a number.\n * @return {!goog.Uri} Reference to this URI object.\n */\ngoog.Uri.prototype.setPort = function(newPort) {\n  'use strict';\n  this.enforceReadOnly();\n\n  if (newPort) {\n    newPort = Number(newPort);\n    if (isNaN(newPort) || newPort < 0) {\n      throw new Error('Bad port number ' + newPort);\n    }\n    this.port_ = newPort;\n  } else {\n    this.port_ = null;\n  }\n\n  return this;\n};\n\n\n/**\n * @return {boolean} Whether the port has been set.\n */\ngoog.Uri.prototype.hasPort = function() {\n  'use strict';\n  return this.port_ != null;\n};\n\n\n/**\n * @return {string} The decoded path.\n */\ngoog.Uri.prototype.getPath = function() {\n  'use strict';\n  return this.path_;\n};\n\n\n/**\n * Sets the path.\n * @throws URIError If opt_decode is true and newPath is malformed (that is,\n *     if decodeURIComponent fails).\n * @param {string} newPath New path value.\n * @param {boolean=} opt_decode Optional param for whether to decode new value.\n * @return {!goog.Uri} Reference to this URI object.\n */\ngoog.Uri.prototype.setPath = function(newPath, opt_decode) {\n  'use strict';\n  this.enforceReadOnly();\n  this.path_ = opt_decode ? goog.Uri.decodeOrEmpty_(newPath, true) : newPath;\n  return this;\n};\n\n\n/**\n * @return {boolean} Whether the path has been set.\n */\ngoog.Uri.prototype.hasPath = function() {\n  'use strict';\n  return !!this.path_;\n};\n\n\n/**\n * @return {boolean} Whether the query string has been set.\n */\ngoog.Uri.prototype.hasQuery = function() {\n  'use strict';\n  return this.queryData_.toString() !== '';\n};\n\n\n/**\n * Sets the query data.\n * @param {goog.Uri.QueryData|string|undefined} queryData QueryData object.\n * @param {boolean=} opt_decode Optional param for whether to decode new value.\n *     Applies only if queryData is a string.\n * @return {!goog.Uri} Reference to this URI object.\n */\ngoog.Uri.prototype.setQueryData = function(queryData, opt_decode) {\n  'use strict';\n  this.enforceReadOnly();\n\n  if (queryData instanceof goog.Uri.QueryData) {\n    this.queryData_ = queryData;\n    this.queryData_.setIgnoreCase(this.ignoreCase_);\n  } else {\n    if (!opt_decode) {\n      // QueryData accepts encoded query string, so encode it if\n      // opt_decode flag is not true.\n      queryData = goog.Uri.encodeSpecialChars_(\n          queryData, goog.Uri.reDisallowedInQuery_);\n    }\n    this.queryData_ = new goog.Uri.QueryData(queryData, this.ignoreCase_);\n  }\n\n  return this;\n};\n\n\n/**\n * Sets the URI query.\n * @param {string} newQuery New query value.\n * @param {boolean=} opt_decode Optional param for whether to decode new value.\n * @return {!goog.Uri} Reference to this URI object.\n */\ngoog.Uri.prototype.setQuery = function(newQuery, opt_decode) {\n  'use strict';\n  return this.setQueryData(newQuery, opt_decode);\n};\n\n\n/**\n * @return {string} The encoded URI query, not including the ?.\n */\ngoog.Uri.prototype.getEncodedQuery = function() {\n  'use strict';\n  return this.queryData_.toString();\n};\n\n\n/**\n * @return {string} The decoded URI query, not including the ?.\n */\ngoog.Uri.prototype.getDecodedQuery = function() {\n  'use strict';\n  return this.queryData_.toDecodedString();\n};\n\n\n/**\n * Returns the query data.\n * @return {!goog.Uri.QueryData} QueryData object.\n */\ngoog.Uri.prototype.getQueryData = function() {\n  'use strict';\n  return this.queryData_;\n};\n\n\n/**\n * @return {string} The encoded URI query, not including the ?.\n *\n * Warning: This method, unlike other getter methods, returns encoded\n * value, instead of decoded one.\n */\ngoog.Uri.prototype.getQuery = function() {\n  'use strict';\n  return this.getEncodedQuery();\n};\n\n\n/**\n * Sets the value of the named query parameters, clearing previous values for\n * that key.\n *\n * @param {string} key The parameter to set.\n * @param {*} value The new value. Value does not need to be encoded.\n * @return {!goog.Uri} Reference to this URI object.\n */\ngoog.Uri.prototype.setParameterValue = function(key, value) {\n  'use strict';\n  this.enforceReadOnly();\n  this.queryData_.set(key, value);\n  return this;\n};\n\n\n/**\n * Sets the values of the named query parameters, clearing previous values for\n * that key.  Not new values will currently be moved to the end of the query\n * string.\n *\n * So, <code>goog.Uri.parse('foo?a=b&c=d&e=f').setParameterValues('c', ['new'])\n * </code> yields <tt>foo?a=b&e=f&c=new</tt>.</p>\n *\n * @param {string} key The parameter to set.\n * @param {*} values The new values. If values is a single\n *     string then it will be treated as the sole value. Values do not need to\n *     be encoded.\n * @return {!goog.Uri} Reference to this URI object.\n */\ngoog.Uri.prototype.setParameterValues = function(key, values) {\n  'use strict';\n  this.enforceReadOnly();\n\n  if (!Array.isArray(values)) {\n    values = [String(values)];\n  }\n\n  this.queryData_.setValues(key, values);\n\n  return this;\n};\n\n\n/**\n * Returns the value<b>s</b> for a given cgi parameter as a list of decoded\n * query parameter values.\n * @param {string} name The parameter to get values for.\n * @return {!Array<?>} The values for a given cgi parameter as a list of\n *     decoded query parameter values.\n */\ngoog.Uri.prototype.getParameterValues = function(name) {\n  'use strict';\n  return this.queryData_.getValues(name);\n};\n\n\n/**\n * Returns the first value for a given cgi parameter or undefined if the given\n * parameter name does not appear in the query string.\n * @param {string} paramName Unescaped parameter name.\n * @return {string|undefined} The first value for a given cgi parameter or\n *     undefined if the given parameter name does not appear in the query\n *     string.\n */\ngoog.Uri.prototype.getParameterValue = function(paramName) {\n  'use strict';\n  return /** @type {string|undefined} */ (this.queryData_.get(paramName));\n};\n\n\n/**\n * @return {string} The URI fragment, not including the #.\n */\ngoog.Uri.prototype.getFragment = function() {\n  'use strict';\n  return this.fragment_;\n};\n\n\n/**\n * Sets the URI fragment.\n * @throws URIError If opt_decode is true and newFragment is malformed (that is,\n *     if decodeURIComponent fails).\n * @param {string} newFragment New fragment value.\n * @param {boolean=} opt_decode Optional param for whether to decode new value.\n * @return {!goog.Uri} Reference to this URI object.\n */\ngoog.Uri.prototype.setFragment = function(newFragment, opt_decode) {\n  'use strict';\n  this.enforceReadOnly();\n  this.fragment_ =\n      opt_decode ? goog.Uri.decodeOrEmpty_(newFragment) : newFragment;\n  return this;\n};\n\n\n/**\n * @return {boolean} Whether the URI has a fragment set.\n */\ngoog.Uri.prototype.hasFragment = function() {\n  'use strict';\n  return !!this.fragment_;\n};\n\n\n/**\n * Returns true if this has the same domain as that of uri2.\n * @param {!goog.Uri} uri2 The URI object to compare to.\n * @return {boolean} true if same domain; false otherwise.\n */\ngoog.Uri.prototype.hasSameDomainAs = function(uri2) {\n  'use strict';\n  return ((!this.hasDomain() && !uri2.hasDomain()) ||\n          this.getDomain() == uri2.getDomain()) &&\n      ((!this.hasPort() && !uri2.hasPort()) ||\n       this.getPort() == uri2.getPort());\n};\n\n\n/**\n * Adds a random parameter to the Uri.\n * @return {!goog.Uri} Reference to this Uri object.\n */\ngoog.Uri.prototype.makeUnique = function() {\n  'use strict';\n  this.enforceReadOnly();\n  this.setParameterValue(goog.Uri.RANDOM_PARAM, goog.string.getRandomString());\n\n  return this;\n};\n\n\n/**\n * Removes the named query parameter.\n *\n * @param {string} key The parameter to remove.\n * @return {!goog.Uri} Reference to this URI object.\n */\ngoog.Uri.prototype.removeParameter = function(key) {\n  'use strict';\n  this.enforceReadOnly();\n  this.queryData_.remove(key);\n  return this;\n};\n\n\n/**\n * Sets whether Uri is read only. If this goog.Uri is read-only,\n * enforceReadOnly_ will be called at the start of any function that may modify\n * this Uri.\n * @param {boolean} isReadOnly whether this goog.Uri should be read only.\n * @return {!goog.Uri} Reference to this Uri object.\n */\ngoog.Uri.prototype.setReadOnly = function(isReadOnly) {\n  'use strict';\n  this.isReadOnly_ = isReadOnly;\n  return this;\n};\n\n\n/**\n * @return {boolean} Whether the URI is read only.\n */\ngoog.Uri.prototype.isReadOnly = function() {\n  'use strict';\n  return this.isReadOnly_;\n};\n\n\n/**\n * Checks if this Uri has been marked as read only, and if so, throws an error.\n * This should be called whenever any modifying function is called.\n */\ngoog.Uri.prototype.enforceReadOnly = function() {\n  'use strict';\n  if (this.isReadOnly_) {\n    throw new Error('Tried to modify a read-only Uri');\n  }\n};\n\n\n/**\n * Sets whether to ignore case.\n * NOTE: If there are already key/value pairs in the QueryData, and\n * ignoreCase_ is set to false, the keys will all be lower-cased.\n * @param {boolean} ignoreCase whether this goog.Uri should ignore case.\n * @return {!goog.Uri} Reference to this Uri object.\n */\ngoog.Uri.prototype.setIgnoreCase = function(ignoreCase) {\n  'use strict';\n  this.ignoreCase_ = ignoreCase;\n  if (this.queryData_) {\n    this.queryData_.setIgnoreCase(ignoreCase);\n  }\n  return this;\n};\n\n\n/**\n * @return {boolean} Whether to ignore case.\n */\ngoog.Uri.prototype.getIgnoreCase = function() {\n  'use strict';\n  return this.ignoreCase_;\n};\n\n\n//==============================================================================\n// Static members\n//==============================================================================\n\n\n/**\n * Creates a uri from the string form.  Basically an alias of new goog.Uri().\n * If a Uri object is passed to parse then it will return a clone of the object.\n *\n * @throws URIError If parsing the URI is malformed. The passed URI components\n *     should all be parseable by decodeURIComponent.\n * @param {*} uri Raw URI string or instance of Uri\n *     object.\n * @param {boolean=} opt_ignoreCase Whether to ignore the case of parameter\n * names in #getParameterValue.\n * @return {!goog.Uri} The new URI object.\n */\ngoog.Uri.parse = function(uri, opt_ignoreCase) {\n  'use strict';\n  return uri instanceof goog.Uri ? uri.clone() :\n                                   new goog.Uri(uri, opt_ignoreCase);\n};\n\n\n/**\n * Creates a new goog.Uri object from unencoded parts.\n *\n * @param {?string=} opt_scheme Scheme/protocol or full URI to parse.\n * @param {?string=} opt_userInfo username:password.\n * @param {?string=} opt_domain www.google.com.\n * @param {?number=} opt_port 9830.\n * @param {?string=} opt_path /some/path/to/a/file.html.\n * @param {string|goog.Uri.QueryData=} opt_query a=1&b=2.\n * @param {?string=} opt_fragment The fragment without the #.\n * @param {boolean=} opt_ignoreCase Whether to ignore parameter name case in\n *     #getParameterValue.\n *\n * @return {!goog.Uri} The new URI object.\n */\ngoog.Uri.create = function(\n    opt_scheme, opt_userInfo, opt_domain, opt_port, opt_path, opt_query,\n    opt_fragment, opt_ignoreCase) {\n  'use strict';\n  var uri = new goog.Uri(null, opt_ignoreCase);\n\n  // Only set the parts if they are defined and not empty strings.\n  opt_scheme && uri.setScheme(opt_scheme);\n  opt_userInfo && uri.setUserInfo(opt_userInfo);\n  opt_domain && uri.setDomain(opt_domain);\n  opt_port && uri.setPort(opt_port);\n  opt_path && uri.setPath(opt_path);\n  opt_query && uri.setQueryData(opt_query);\n  opt_fragment && uri.setFragment(opt_fragment);\n\n  return uri;\n};\n\n\n/**\n * Resolves a relative Uri against a base Uri, accepting both strings and\n * Uri objects.\n *\n * @param {*} base Base Uri.\n * @param {*} rel Relative Uri.\n * @return {!goog.Uri} Resolved uri.\n */\ngoog.Uri.resolve = function(base, rel) {\n  'use strict';\n  if (!(base instanceof goog.Uri)) {\n    base = goog.Uri.parse(base);\n  }\n\n  if (!(rel instanceof goog.Uri)) {\n    rel = goog.Uri.parse(rel);\n  }\n\n  return base.resolve(rel);\n};\n\n\n/**\n * Removes dot segments in given path component, as described in\n * RFC 3986, section 5.2.4.\n *\n * @param {string} path A non-empty path component.\n * @return {string} Path component with removed dot segments.\n */\ngoog.Uri.removeDotSegments = function(path) {\n  'use strict';\n  if (path == '..' || path == '.') {\n    return '';\n\n  } else if (\n      !goog.string.contains(path, './') && !goog.string.contains(path, '/.')) {\n    // This optimization detects uris which do not contain dot-segments,\n    // and as a consequence do not require any processing.\n    return path;\n\n  } else {\n    var leadingSlash = goog.string.startsWith(path, '/');\n    var segments = path.split('/');\n    var out = [];\n\n    for (var pos = 0; pos < segments.length;) {\n      var segment = segments[pos++];\n\n      if (segment == '.') {\n        if (leadingSlash && pos == segments.length) {\n          out.push('');\n        }\n      } else if (segment == '..') {\n        if (out.length > 1 || out.length == 1 && out[0] != '') {\n          out.pop();\n        }\n        if (leadingSlash && pos == segments.length) {\n          out.push('');\n        }\n      } else {\n        out.push(segment);\n        leadingSlash = true;\n      }\n    }\n\n    return out.join('/');\n  }\n};\n\n\n/**\n * Decodes a value or returns the empty string if it isn't defined or empty.\n * @throws URIError If decodeURIComponent fails to decode val.\n * @param {string|undefined} val Value to decode.\n * @param {boolean=} opt_preserveReserved If true, restricted characters will\n *     not be decoded.\n * @return {string} Decoded value.\n * @private\n */\ngoog.Uri.decodeOrEmpty_ = function(val, opt_preserveReserved) {\n  'use strict';\n  // Don't use UrlDecode() here because val is not a query parameter.\n  if (!val) {\n    return '';\n  }\n\n  // decodeURI has the same output for '%2f' and '%252f'. We double encode %25\n  // so that we can distinguish between the 2 inputs. This is later undone by\n  // removeDoubleEncoding_.\n  return opt_preserveReserved ? decodeURI(val.replace(/%25/g, '%2525')) :\n                                decodeURIComponent(val);\n};\n\n\n/**\n * If unescapedPart is non null, then escapes any characters in it that aren't\n * valid characters in a url and also escapes any special characters that\n * appear in extra.\n *\n * @param {*} unescapedPart The string to encode.\n * @param {RegExp} extra A character set of characters in [\\01-\\177].\n * @param {boolean=} opt_removeDoubleEncoding If true, remove double percent\n *     encoding.\n * @return {?string} null iff unescapedPart == null.\n * @private\n */\ngoog.Uri.encodeSpecialChars_ = function(\n    unescapedPart, extra, opt_removeDoubleEncoding) {\n  'use strict';\n  if (typeof unescapedPart === 'string') {\n    var encoded = encodeURI(unescapedPart).replace(extra, goog.Uri.encodeChar_);\n    if (opt_removeDoubleEncoding) {\n      // encodeURI double-escapes %XX sequences used to represent restricted\n      // characters in some URI components, remove the double escaping here.\n      encoded = goog.Uri.removeDoubleEncoding_(encoded);\n    }\n    return encoded;\n  }\n  return null;\n};\n\n\n/**\n * Converts a character in [\\01-\\177] to its unicode character equivalent.\n * @param {string} ch One character string.\n * @return {string} Encoded string.\n * @private\n */\ngoog.Uri.encodeChar_ = function(ch) {\n  'use strict';\n  var n = ch.charCodeAt(0);\n  return '%' + ((n >> 4) & 0xf).toString(16) + (n & 0xf).toString(16);\n};\n\n\n/**\n * Removes double percent-encoding from a string.\n * @param  {string} doubleEncodedString String\n * @return {string} String with double encoding removed.\n * @private\n */\ngoog.Uri.removeDoubleEncoding_ = function(doubleEncodedString) {\n  'use strict';\n  return doubleEncodedString.replace(/%25([0-9a-fA-F]{2})/g, '%$1');\n};\n\n\n/**\n * Regular expression for characters that are disallowed in the scheme or\n * userInfo part of the URI.\n * @type {RegExp}\n * @private\n */\ngoog.Uri.reDisallowedInSchemeOrUserInfo_ = /[#\\/\\?@]/g;\n\n\n/**\n * Regular expression for characters that are disallowed in a relative path.\n * Colon is included due to RFC 3986 3.3.\n * @type {RegExp}\n * @private\n */\ngoog.Uri.reDisallowedInRelativePath_ = /[\\#\\?:]/g;\n\n\n/**\n * Regular expression for characters that are disallowed in an absolute path.\n * @type {RegExp}\n * @private\n */\ngoog.Uri.reDisallowedInAbsolutePath_ = /[\\#\\?]/g;\n\n\n/**\n * Regular expression for characters that are disallowed in the query.\n * @type {RegExp}\n * @private\n */\ngoog.Uri.reDisallowedInQuery_ = /[\\#\\?@]/g;\n\n\n/**\n * Regular expression for characters that are disallowed in the fragment.\n * @type {RegExp}\n * @private\n */\ngoog.Uri.reDisallowedInFragment_ = /#/g;\n\n\n/**\n * Checks whether two URIs have the same domain.\n * @param {string} uri1String First URI string.\n * @param {string} uri2String Second URI string.\n * @return {boolean} true if the two URIs have the same domain; false otherwise.\n */\ngoog.Uri.haveSameDomain = function(uri1String, uri2String) {\n  'use strict';\n  // Differs from goog.uri.utils.haveSameDomain, since this ignores scheme.\n  // TODO(gboyer): Have this just call goog.uri.util.haveSameDomain.\n  var pieces1 = goog.uri.utils.split(uri1String);\n  var pieces2 = goog.uri.utils.split(uri2String);\n  return pieces1[goog.uri.utils.ComponentIndex.DOMAIN] ==\n      pieces2[goog.uri.utils.ComponentIndex.DOMAIN] &&\n      pieces1[goog.uri.utils.ComponentIndex.PORT] ==\n      pieces2[goog.uri.utils.ComponentIndex.PORT];\n};\n\n\n\n/**\n * Class used to represent URI query parameters.  It is essentially a hash of\n * name-value pairs, though a name can be present more than once.\n *\n * Has the same interface as the collections in goog.structs.\n *\n * @param {?string=} opt_query Optional encoded query string to parse into\n *     the object.\n * @param {boolean=} opt_ignoreCase If true, ignore the case of the parameter\n *     name in #get.\n * @constructor\n * @struct\n * @final\n */\ngoog.Uri.QueryData = function(opt_query, opt_ignoreCase) {\n  'use strict';\n  /**\n   * The map containing name/value or name/array-of-values pairs.\n   * May be null if it requires parsing from the query string.\n   *\n   * We need to use a Map because we cannot guarantee that the key names will\n   * not be problematic for IE.\n   *\n   * @private {?Map<string, !Array<*>>}\n   */\n  this.keyMap_ = null;\n\n  /**\n   * The number of params, or null if it requires computing.\n   * @private {?number}\n   */\n  this.count_ = null;\n\n  /**\n   * Encoded query string, or null if it requires computing from the key map.\n   * @private {?string}\n   */\n  this.encodedQuery_ = opt_query || null;\n\n  /**\n   * If true, ignore the case of the parameter name in #get.\n   * @private {boolean}\n   */\n  this.ignoreCase_ = !!opt_ignoreCase;\n};\n\n\n/**\n * If the underlying key map is not yet initialized, it parses the\n * query string and fills the map with parsed data.\n * @private\n */\ngoog.Uri.QueryData.prototype.ensureKeyMapInitialized_ = function() {\n  'use strict';\n  if (!this.keyMap_) {\n    this.keyMap_ = /** @type {!Map<string, !Array<*>>} */ (new Map());\n    this.count_ = 0;\n    if (this.encodedQuery_) {\n      var self = this;\n      goog.uri.utils.parseQueryData(this.encodedQuery_, function(name, value) {\n        'use strict';\n        self.add(goog.string.urlDecode(name), value);\n      });\n    }\n  }\n};\n\n\n/**\n * Creates a new query data instance from a map of names and values.\n *\n * @param {!goog.collections.maps.MapLike<string, ?>|!Object} map Map of string\n *     parameter names to parameter value. If parameter value is an array, it is\n *     treated as if the key maps to each individual value in the\n *     array.\n * @param {boolean=} opt_ignoreCase If true, ignore the case of the parameter\n *     name in #get.\n * @return {!goog.Uri.QueryData} The populated query data instance.\n */\ngoog.Uri.QueryData.createFromMap = function(map, opt_ignoreCase) {\n  'use strict';\n  var keys = goog.structs.getKeys(map);\n  if (typeof keys == 'undefined') {\n    throw new Error('Keys are undefined');\n  }\n\n  var queryData = new goog.Uri.QueryData(null, opt_ignoreCase);\n  var values = goog.structs.getValues(map);\n  for (var i = 0; i < keys.length; i++) {\n    var key = keys[i];\n    var value = values[i];\n    if (!Array.isArray(value)) {\n      queryData.add(key, value);\n    } else {\n      queryData.setValues(key, value);\n    }\n  }\n  return queryData;\n};\n\n\n/**\n * Creates a new query data instance from parallel arrays of parameter names\n * and values. Allows for duplicate parameter names. Throws an error if the\n * lengths of the arrays differ.\n *\n * @param {!Array<string>} keys Parameter names.\n * @param {!Array<?>} values Parameter values.\n * @param {boolean=} opt_ignoreCase If true, ignore the case of the parameter\n *     name in #get.\n * @return {!goog.Uri.QueryData} The populated query data instance.\n */\ngoog.Uri.QueryData.createFromKeysValues = function(\n    keys, values, opt_ignoreCase) {\n  'use strict';\n  if (keys.length != values.length) {\n    throw new Error('Mismatched lengths for keys/values');\n  }\n  var queryData = new goog.Uri.QueryData(null, opt_ignoreCase);\n  for (var i = 0; i < keys.length; i++) {\n    queryData.add(keys[i], values[i]);\n  }\n  return queryData;\n};\n\n\n/**\n * @return {?number} The number of parameters.\n */\ngoog.Uri.QueryData.prototype.getCount = function() {\n  'use strict';\n  this.ensureKeyMapInitialized_();\n  return this.count_;\n};\n\n\n/**\n * Adds a key value pair.\n * @param {string} key Name.\n * @param {*} value Value.\n * @return {!goog.Uri.QueryData} Instance of this object.\n */\ngoog.Uri.QueryData.prototype.add = function(key, value) {\n  'use strict';\n  this.ensureKeyMapInitialized_();\n  this.invalidateCache_();\n\n  key = this.getKeyName_(key);\n  var values = this.keyMap_.get(key);\n  if (!values) {\n    this.keyMap_.set(key, (values = []));\n  }\n  values.push(value);\n  this.count_ = goog.asserts.assertNumber(this.count_) + 1;\n  return this;\n};\n\n\n/**\n * Removes all the params with the given key.\n * @param {string} key Name.\n * @return {boolean} Whether any parameter was removed.\n */\ngoog.Uri.QueryData.prototype.remove = function(key) {\n  'use strict';\n  this.ensureKeyMapInitialized_();\n\n  key = this.getKeyName_(key);\n  if (this.keyMap_.has(key)) {\n    this.invalidateCache_();\n\n    // Decrement parameter count.\n    this.count_ =\n        goog.asserts.assertNumber(this.count_) - this.keyMap_.get(key).length;\n    return this.keyMap_.delete(key);\n  }\n  return false;\n};\n\n\n/**\n * Clears the parameters.\n */\ngoog.Uri.QueryData.prototype.clear = function() {\n  'use strict';\n  this.invalidateCache_();\n  this.keyMap_ = null;\n  this.count_ = 0;\n};\n\n\n/**\n * @return {boolean} Whether we have any parameters.\n */\ngoog.Uri.QueryData.prototype.isEmpty = function() {\n  'use strict';\n  this.ensureKeyMapInitialized_();\n  return this.count_ == 0;\n};\n\n\n/**\n * Whether there is a parameter with the given name\n * @param {string} key The parameter name to check for.\n * @return {boolean} Whether there is a parameter with the given name.\n */\ngoog.Uri.QueryData.prototype.containsKey = function(key) {\n  'use strict';\n  this.ensureKeyMapInitialized_();\n  key = this.getKeyName_(key);\n  return this.keyMap_.has(key);\n};\n\n\n/**\n * Whether there is a parameter with the given value.\n * @param {*} value The value to check for.\n * @return {boolean} Whether there is a parameter with the given value.\n */\ngoog.Uri.QueryData.prototype.containsValue = function(value) {\n  'use strict';\n  // NOTE(arv): This solution goes through all the params even if it was the\n  // first param. We can get around this by not reusing code or by switching to\n  // iterators.\n  var vals = this.getValues();\n  return goog.array.contains(vals, value);\n};\n\n\n/**\n * Runs a callback on every key-value pair in the map, including duplicate keys.\n * This won't maintain original order when duplicate keys are interspersed (like\n * getKeys() / getValues()).\n * @param {function(this:SCOPE, ?, string, !goog.Uri.QueryData)} f\n * @param {SCOPE=} opt_scope The value of \"this\" inside f.\n * @template SCOPE\n */\ngoog.Uri.QueryData.prototype.forEach = function(f, opt_scope) {\n  'use strict';\n  this.ensureKeyMapInitialized_();\n  this.keyMap_.forEach(function(values, key) {\n    'use strict';\n    values.forEach(function(value) {\n      'use strict';\n      f.call(opt_scope, value, key, this);\n    }, this);\n  }, this);\n};\n\n\n/**\n * Returns all the keys of the parameters. If a key is used multiple times\n * it will be included multiple times in the returned array\n * @return {!Array<string>} All the keys of the parameters.\n */\ngoog.Uri.QueryData.prototype.getKeys = function() {\n  'use strict';\n  this.ensureKeyMapInitialized_();\n  // We need to get the values to know how many keys to add.\n  const vals = Array.from(this.keyMap_.values());\n  const keys = Array.from(this.keyMap_.keys());\n  const rv = [];\n  for (let i = 0; i < keys.length; i++) {\n    const val = vals[i];\n    for (let j = 0; j < val.length; j++) {\n      rv.push(keys[i]);\n    }\n  }\n  return rv;\n};\n\n\n/**\n * Returns all the values of the parameters with the given name. If the query\n * data has no such key this will return an empty array. If no key is given\n * all values wil be returned.\n * @param {string=} opt_key The name of the parameter to get the values for.\n * @return {!Array<?>} All the values of the parameters with the given name.\n */\ngoog.Uri.QueryData.prototype.getValues = function(opt_key) {\n  'use strict';\n  this.ensureKeyMapInitialized_();\n  let rv = [];\n  if (typeof opt_key === 'string') {\n    if (this.containsKey(opt_key)) {\n      rv = rv.concat(this.keyMap_.get(this.getKeyName_(opt_key)));\n    }\n  } else {\n    // Return all values.\n    const values = Array.from(this.keyMap_.values());\n    for (let i = 0; i < values.length; i++) {\n      rv = rv.concat(values[i]);\n    }\n  }\n  return rv;\n};\n\n\n/**\n * Sets a key value pair and removes all other keys with the same value.\n *\n * @param {string} key Name.\n * @param {*} value Value.\n * @return {!goog.Uri.QueryData} Instance of this object.\n */\ngoog.Uri.QueryData.prototype.set = function(key, value) {\n  'use strict';\n  this.ensureKeyMapInitialized_();\n  this.invalidateCache_();\n\n  // TODO(chrishenry): This could be better written as\n  // this.remove(key), this.add(key, value), but that would reorder\n  // the key (since the key is first removed and then added at the\n  // end) and we would have to fix unit tests that depend on key\n  // ordering.\n  key = this.getKeyName_(key);\n  if (this.containsKey(key)) {\n    this.count_ =\n        goog.asserts.assertNumber(this.count_) - this.keyMap_.get(key).length;\n  }\n  this.keyMap_.set(key, [value]);\n  this.count_ = goog.asserts.assertNumber(this.count_) + 1;\n  return this;\n};\n\n\n/**\n * Returns the first value associated with the key. If the query data has no\n * such key this will return undefined or the optional default.\n * @param {string} key The name of the parameter to get the value for.\n * @param {*=} opt_default The default value to return if the query data\n *     has no such key.\n * @return {*} The first string value associated with the key, or opt_default\n *     if there's no value.\n */\ngoog.Uri.QueryData.prototype.get = function(key, opt_default) {\n  'use strict';\n  if (!key) {\n    return opt_default;\n  }\n  var values = this.getValues(key);\n  return values.length > 0 ? String(values[0]) : opt_default;\n};\n\n\n/**\n * Sets the values for a key. If the key already exists, this will\n * override all of the existing values that correspond to the key.\n * @param {string} key The key to set values for.\n * @param {!Array<?>} values The values to set.\n */\ngoog.Uri.QueryData.prototype.setValues = function(key, values) {\n  'use strict';\n  this.remove(key);\n\n  if (values.length > 0) {\n    this.invalidateCache_();\n    this.keyMap_.set(this.getKeyName_(key), goog.array.clone(values));\n    this.count_ = goog.asserts.assertNumber(this.count_) + values.length;\n  }\n};\n\n\n/**\n * @return {string} Encoded query string.\n * @override\n */\ngoog.Uri.QueryData.prototype.toString = function() {\n  'use strict';\n  if (this.encodedQuery_) {\n    return this.encodedQuery_;\n  }\n\n  if (!this.keyMap_) {\n    return '';\n  }\n\n  const sb = [];\n\n  // In the past, we use this.getKeys() and this.getVals(), but that\n  // generates a lot of allocations as compared to simply iterating\n  // over the keys.\n  const keys = Array.from(this.keyMap_.keys());\n  for (var i = 0; i < keys.length; i++) {\n    const key = keys[i];\n    const encodedKey = goog.string.urlEncode(key);\n    const val = this.getValues(key);\n    for (var j = 0; j < val.length; j++) {\n      var param = encodedKey;\n      // Ensure that null and undefined are encoded into the url as\n      // literal strings.\n      if (val[j] !== '') {\n        param += '=' + goog.string.urlEncode(val[j]);\n      }\n      sb.push(param);\n    }\n  }\n\n  return this.encodedQuery_ = sb.join('&');\n};\n\n\n/**\n * @throws URIError If URI is malformed (that is, if decodeURIComponent fails on\n *     any of the URI components).\n * @return {string} Decoded query string.\n */\ngoog.Uri.QueryData.prototype.toDecodedString = function() {\n  'use strict';\n  return goog.Uri.decodeOrEmpty_(this.toString());\n};\n\n\n/**\n * Invalidate the cache.\n * @private\n */\ngoog.Uri.QueryData.prototype.invalidateCache_ = function() {\n  'use strict';\n  this.encodedQuery_ = null;\n};\n\n\n/**\n * Removes all keys that are not in the provided list. (Modifies this object.)\n * @param {Array<string>} keys The desired keys.\n * @return {!goog.Uri.QueryData} a reference to this object.\n */\ngoog.Uri.QueryData.prototype.filterKeys = function(keys) {\n  'use strict';\n  this.ensureKeyMapInitialized_();\n  this.keyMap_.forEach(function(value, key) {\n    'use strict';\n    if (!goog.array.contains(keys, key)) {\n      this.remove(key);\n    }\n  }, this);\n  return this;\n};\n\n\n/**\n * Clone the query data instance.\n * @return {!goog.Uri.QueryData} New instance of the QueryData object.\n */\ngoog.Uri.QueryData.prototype.clone = function() {\n  'use strict';\n  var rv = new goog.Uri.QueryData();\n  rv.encodedQuery_ = this.encodedQuery_;\n  if (this.keyMap_) {\n    rv.keyMap_ = /** @type {!Map<string, !Array<*>>} */ (new Map(this.keyMap_));\n    rv.count_ = this.count_;\n  }\n  return rv;\n};\n\n\n/**\n * Helper function to get the key name from a JavaScript object. Converts\n * the object to a string, and to lower case if necessary.\n * @private\n * @param {*} arg The object to get a key name from.\n * @return {string} valid key name which can be looked up in #keyMap_.\n */\ngoog.Uri.QueryData.prototype.getKeyName_ = function(arg) {\n  'use strict';\n  var keyName = String(arg);\n  if (this.ignoreCase_) {\n    keyName = keyName.toLowerCase();\n  }\n  return keyName;\n};\n\n\n/**\n * Ignore case in parameter names.\n * NOTE: If there are already key/value pairs in the QueryData, and\n * ignoreCase_ is set to false, the keys will all be lower-cased.\n * @param {boolean} ignoreCase whether this goog.Uri should ignore case.\n */\ngoog.Uri.QueryData.prototype.setIgnoreCase = function(ignoreCase) {\n  'use strict';\n  var resetKeys = ignoreCase && !this.ignoreCase_;\n  if (resetKeys) {\n    this.ensureKeyMapInitialized_();\n    this.invalidateCache_();\n    this.keyMap_.forEach(function(value, key) {\n      'use strict';\n      var lowerCase = key.toLowerCase();\n      if (key != lowerCase) {\n        this.remove(key);\n        this.setValues(lowerCase, value);\n      }\n    }, this);\n  }\n  this.ignoreCase_ = ignoreCase;\n};\n\n\n/**\n * Extends a query data object with another query data or map like object. This\n * operates 'in-place', it does not create a new QueryData object.\n *\n * @param {...(?goog.Uri.QueryData|?goog.collections.maps.MapLike<?,\n *     ?>|?Object)} var_args The object from which key value pairs will be\n *     copied. Note: does not accept null.\n * @suppress {deprecated} Use deprecated goog.structs.forEach to allow different\n * types of parameters.\n */\ngoog.Uri.QueryData.prototype.extend = function(var_args) {\n  'use strict';\n  for (var i = 0; i < arguments.length; i++) {\n    var data = arguments[i];\n    goog.structs.forEach(data, function(value, key) {\n      'use strict';\n      this.add(key, value);\n    }, this);\n  }\n};\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview The dispose method is used to clean up references and\n * resources.\n */\n\ngoog.module('goog.dispose');\ngoog.module.declareLegacyNamespace();\n\n/**\n * Calls `dispose` on the argument if it supports it. If obj is not an\n *     object with a dispose() method, this is a no-op.\n * @param {*} obj The object to dispose of.\n */\nfunction dispose(obj) {\n  if (obj && typeof obj.dispose == 'function') {\n    obj.dispose();\n  }\n}\nexports = dispose;\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Codec functions of the v8 wire protocol. Eventually we'd want\n * to support pluggable wire-format to improve wire efficiency and to enable\n * binary encoding. Such support will require an interface class, which\n * will be added later.\n *\n */\n\n\ngoog.provide('goog.labs.net.webChannel.WireV8');\n\ngoog.require('goog.asserts');\ngoog.require('goog.collections.maps');\ngoog.require('goog.json');\ngoog.require('goog.json.NativeJsonProcessor');\ngoog.require('goog.labs.net.webChannel.Wire');\ngoog.require('goog.structs');\ngoog.requireType('goog.string.Parser');\n\n\n\n/**\n * The v8 codec class.\n *\n * @constructor\n * @struct\n */\ngoog.labs.net.webChannel.WireV8 = function() {\n  'use strict';\n  /**\n   * Parser for a response payload. The parser should return an array.\n   * @private {!goog.string.Parser}\n   */\n  this.parser_ = new goog.json.NativeJsonProcessor();\n};\n\n\ngoog.scope(function() {\n'use strict';\nconst WireV8 = goog.labs.net.webChannel.WireV8;\nconst Wire = goog.labs.net.webChannel.Wire;\n\n\n/**\n * Encodes a standalone message into the wire format.\n *\n * May throw exception if the message object contains any invalid elements.\n *\n * @param {!Object|!goog.collections.maps.MapLike} message The message data.\n *     V8 only support JS objects (or Map).\n * @param {!Array<string>} buffer The text buffer to write the message to.\n * @param {string=} opt_prefix The prefix for each field of the object.\n */\nWireV8.prototype.encodeMessage = function(message, buffer, opt_prefix) {\n  'use strict';\n  const prefix = opt_prefix || '';\n  try {\n    goog.structs.forEach(message, function(value, key) {\n      'use strict';\n      let encodedValue = value;\n      if (goog.isObject(value)) {\n        encodedValue = goog.json.serialize(value);\n      }  // keep the fast-path for primitive types\n      buffer.push(prefix + key + '=' + encodeURIComponent(encodedValue));\n    });\n  } catch (ex) {\n    // We send a map here because lots of the retry logic relies on map IDs,\n    // so we have to send something (possibly redundant).\n    buffer.push(\n        prefix + 'type' +\n        '=' + encodeURIComponent('_badmap'));\n    throw ex;\n  }\n};\n\n\n/**\n * Encodes all the buffered messages of the forward channel.\n *\n * @param {!Array<Wire.QueuedMap>} messageQueue The message data.\n *     V8 only support JS objects.\n * @param {number} count The number of messages to be encoded.\n * @param {?function(!Object)} badMapHandler Callback for bad messages.\n * @return {string} the encoded messages\n */\nWireV8.prototype.encodeMessageQueue = function(\n    messageQueue, count, badMapHandler) {\n  'use strict';\n  let offset = -1;\n  while (true) {\n    const sb = ['count=' + count];\n    // To save a bit of bandwidth, specify the base mapId and the rest as\n    // offsets from it.\n    if (offset == -1) {\n      if (count > 0) {\n        offset = messageQueue[0].mapId;\n        sb.push('ofs=' + offset);\n      } else {\n        offset = 0;\n      }\n    } else {\n      sb.push('ofs=' + offset);\n    }\n    let done = true;\n    for (let i = 0; i < count; i++) {\n      let mapId = messageQueue[i].mapId;\n      const map = messageQueue[i].map;\n      mapId -= offset;\n      if (mapId < 0) {\n        // redo the encoding in case of retry/reordering, plus extra space\n        offset = Math.max(0, messageQueue[i].mapId - 100);\n        done = false;\n        continue;\n      }\n      try {\n        this.encodeMessage(map, sb, 'req' + mapId + '_');\n      } catch (ex) {\n        if (badMapHandler) {\n          badMapHandler(map);\n        }\n      }\n    }\n    if (done) {\n      return sb.join('&');\n    }\n  }\n};\n\n\n/**\n * Decodes a standalone message received from the wire. May throw exception\n * if text is ill-formatted.\n *\n * Must be valid JSON as it is insecure to use eval() to decode JS literals;\n * and eval() is disallowed in Chrome apps too.\n *\n * Invalid JS literals include null array elements, quotas etc.\n *\n * @param {string} messageText The string content as received from the wire.\n * @return {*} The decoded message object.\n */\nWireV8.prototype.decodeMessage = function(messageText) {\n  'use strict';\n  const response = this.parser_.parse(messageText);\n  goog.asserts.assert(Array.isArray(response));  // throw exception\n  return response;\n};\n});  // goog.scope\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Utilities for string manipulation.\n */\n\n\n/**\n * Namespace for string utilities\n */\ngoog.provide('goog.string');\ngoog.provide('goog.string.Unicode');\n\ngoog.require('goog.dom.safe');\ngoog.require('goog.html.uncheckedconversions');\ngoog.require('goog.string.Const');\ngoog.require('goog.string.internal');\n\n\n/**\n * @define {boolean} Enables HTML escaping of lowercase letter \"e\" which helps\n * with detection of double-escaping as this letter is frequently used.\n */\ngoog.string.DETECT_DOUBLE_ESCAPING =\n    goog.define('goog.string.DETECT_DOUBLE_ESCAPING', false);\n\n\n/**\n * @define {boolean} Whether to force non-dom html unescaping.\n */\ngoog.string.FORCE_NON_DOM_HTML_UNESCAPING =\n    goog.define('goog.string.FORCE_NON_DOM_HTML_UNESCAPING', false);\n\n\n/**\n * Common Unicode string characters.\n * @enum {string}\n */\ngoog.string.Unicode = {\n  NBSP: '\\xa0'\n};\n\n\n/**\n * Fast prefix-checker.\n * @param {string} str The string to check.\n * @param {string} prefix A string to look for at the start of `str`.\n * @return {boolean} True if `str` begins with `prefix`.\n */\ngoog.string.startsWith = goog.string.internal.startsWith;\n\n\n/**\n * Fast suffix-checker.\n * @param {string} str The string to check.\n * @param {string} suffix A string to look for at the end of `str`.\n * @return {boolean} True if `str` ends with `suffix`.\n */\ngoog.string.endsWith = goog.string.internal.endsWith;\n\n\n/**\n * Case-insensitive prefix-checker.\n * @param {string} str The string to check.\n * @param {string} prefix  A string to look for at the end of `str`.\n * @return {boolean} True if `str` begins with `prefix` (ignoring\n *     case).\n */\ngoog.string.caseInsensitiveStartsWith =\n    goog.string.internal.caseInsensitiveStartsWith;\n\n\n/**\n * Case-insensitive suffix-checker.\n * @param {string} str The string to check.\n * @param {string} suffix A string to look for at the end of `str`.\n * @return {boolean} True if `str` ends with `suffix` (ignoring\n *     case).\n */\ngoog.string.caseInsensitiveEndsWith =\n    goog.string.internal.caseInsensitiveEndsWith;\n\n\n/**\n * Case-insensitive equality checker.\n * @param {string} str1 First string to check.\n * @param {string} str2 Second string to check.\n * @return {boolean} True if `str1` and `str2` are the same string,\n *     ignoring case.\n */\ngoog.string.caseInsensitiveEquals = goog.string.internal.caseInsensitiveEquals;\n\n\n/**\n * Does simple python-style string substitution.\n * subs(\"foo%s hot%s\", \"bar\", \"dog\") becomes \"foobar hotdog\".\n * @param {string} str The string containing the pattern.\n * @param {...*} var_args The items to substitute into the pattern.\n * @return {string} A copy of `str` in which each occurrence of\n *     {@code %s} has been replaced an argument from `var_args`.\n */\ngoog.string.subs = function(str, var_args) {\n  'use strict';\n  const splitParts = str.split('%s');\n  let returnString = '';\n\n  const subsArguments = Array.prototype.slice.call(arguments, 1);\n  while (subsArguments.length &&\n         // Replace up to the last split part. We are inserting in the\n         // positions between split parts.\n         splitParts.length > 1) {\n    returnString += splitParts.shift() + subsArguments.shift();\n  }\n\n  return returnString + splitParts.join('%s');  // Join unused '%s'\n};\n\n\n/**\n * Converts multiple whitespace chars (spaces, non-breaking-spaces, new lines\n * and tabs) to a single space, and strips leading and trailing whitespace.\n * @param {string} str Input string.\n * @return {string} A copy of `str` with collapsed whitespace.\n */\ngoog.string.collapseWhitespace = function(str) {\n  'use strict';\n  // Since IE doesn't include non-breaking-space (0xa0) in their \\s character\n  // class (as required by section 7.2 of the ECMAScript spec), we explicitly\n  // include it in the regexp to enforce consistent cross-browser behavior.\n  return str.replace(/[\\s\\xa0]+/g, ' ').replace(/^\\s+|\\s+$/g, '');\n};\n\n\n/**\n * Checks if a string is empty or contains only whitespaces.\n * @param {string} str The string to check.\n * @return {boolean} Whether `str` is empty or whitespace only.\n */\ngoog.string.isEmptyOrWhitespace = goog.string.internal.isEmptyOrWhitespace;\n\n\n/**\n * Checks if a string is empty.\n * @param {string} str The string to check.\n * @return {boolean} Whether `str` is empty.\n */\ngoog.string.isEmptyString = function(str) {\n  'use strict';\n  return str.length == 0;\n};\n\n\n/**\n * Checks if a string is empty or contains only whitespaces.\n *\n * @param {string} str The string to check.\n * @return {boolean} Whether `str` is empty or whitespace only.\n * @deprecated Use goog.string.isEmptyOrWhitespace instead.\n */\ngoog.string.isEmpty = goog.string.isEmptyOrWhitespace;\n\n\n/**\n * Checks if a string is null, undefined, empty or contains only whitespaces.\n * @param {*} str The string to check.\n * @return {boolean} Whether `str` is null, undefined, empty, or\n *     whitespace only.\n * @deprecated Use goog.string.isEmptyOrWhitespace(goog.string.makeSafe(str))\n *     instead.\n */\ngoog.string.isEmptyOrWhitespaceSafe = function(str) {\n  'use strict';\n  return goog.string.isEmptyOrWhitespace(goog.string.makeSafe(str));\n};\n\n\n/**\n * Checks if a string is null, undefined, empty or contains only whitespaces.\n *\n * @param {*} str The string to check.\n * @return {boolean} Whether `str` is null, undefined, empty, or\n *     whitespace only.\n * @deprecated Use goog.string.isEmptyOrWhitespace instead.\n */\ngoog.string.isEmptySafe = goog.string.isEmptyOrWhitespaceSafe;\n\n\n/**\n * Checks if a string is all breaking whitespace.\n * @param {string} str The string to check.\n * @return {boolean} Whether the string is all breaking whitespace.\n */\ngoog.string.isBreakingWhitespace = function(str) {\n  'use strict';\n  return !/[^\\t\\n\\r ]/.test(str);\n};\n\n\n/**\n * Checks if a string contains all letters.\n * @param {string} str string to check.\n * @return {boolean} True if `str` consists entirely of letters.\n */\ngoog.string.isAlpha = function(str) {\n  'use strict';\n  return !/[^a-zA-Z]/.test(str);\n};\n\n\n/**\n * Checks if a string contains only numbers.\n * @param {*} str string to check. If not a string, it will be\n *     casted to one.\n * @return {boolean} True if `str` is numeric.\n */\ngoog.string.isNumeric = function(str) {\n  'use strict';\n  return !/[^0-9]/.test(str);\n};\n\n\n/**\n * Checks if a string contains only numbers or letters.\n * @param {string} str string to check.\n * @return {boolean} True if `str` is alphanumeric.\n */\ngoog.string.isAlphaNumeric = function(str) {\n  'use strict';\n  return !/[^a-zA-Z0-9]/.test(str);\n};\n\n\n/**\n * Checks if a character is a space character.\n * @param {string} ch Character to check.\n * @return {boolean} True if `ch` is a space.\n */\ngoog.string.isSpace = function(ch) {\n  'use strict';\n  return ch == ' ';\n};\n\n\n/**\n * Checks if a character is a valid unicode character.\n * @param {string} ch Character to check.\n * @return {boolean} True if `ch` is a valid unicode character.\n */\ngoog.string.isUnicodeChar = function(ch) {\n  'use strict';\n  return ch.length == 1 && ch >= ' ' && ch <= '~' ||\n      ch >= '\\u0080' && ch <= '\\uFFFD';\n};\n\n\n/**\n * Takes a string and replaces newlines with a space. Multiple lines are\n * replaced with a single space.\n * @param {string} str The string from which to strip newlines.\n * @return {string} A copy of `str` stripped of newlines.\n */\ngoog.string.stripNewlines = function(str) {\n  'use strict';\n  return str.replace(/(\\r\\n|\\r|\\n)+/g, ' ');\n};\n\n\n/**\n * Replaces Windows and Mac new lines with unix style: \\r or \\r\\n with \\n.\n * @param {string} str The string to in which to canonicalize newlines.\n * @return {string} `str` A copy of {@code} with canonicalized newlines.\n */\ngoog.string.canonicalizeNewlines = function(str) {\n  'use strict';\n  return str.replace(/(\\r\\n|\\r|\\n)/g, '\\n');\n};\n\n\n/**\n * Normalizes whitespace in a string, replacing all whitespace chars with\n * a space.\n * @param {string} str The string in which to normalize whitespace.\n * @return {string} A copy of `str` with all whitespace normalized.\n */\ngoog.string.normalizeWhitespace = function(str) {\n  'use strict';\n  return str.replace(/\\xa0|\\s/g, ' ');\n};\n\n\n/**\n * Normalizes spaces in a string, replacing all consecutive spaces and tabs\n * with a single space. Replaces non-breaking space with a space.\n * @param {string} str The string in which to normalize spaces.\n * @return {string} A copy of `str` with all consecutive spaces and tabs\n *    replaced with a single space.\n */\ngoog.string.normalizeSpaces = function(str) {\n  'use strict';\n  return str.replace(/\\xa0|[ \\t]+/g, ' ');\n};\n\n\n/**\n * Removes the breaking spaces from the left and right of the string and\n * collapses the sequences of breaking spaces in the middle into single spaces.\n * The original and the result strings render the same way in HTML.\n * @param {string} str A string in which to collapse spaces.\n * @return {string} Copy of the string with normalized breaking spaces.\n */\ngoog.string.collapseBreakingSpaces = function(str) {\n  'use strict';\n  return str.replace(/[\\t\\r\\n ]+/g, ' ')\n      .replace(/^[\\t\\r\\n ]+|[\\t\\r\\n ]+$/g, '');\n};\n\n\n/**\n * Trims white spaces to the left and right of a string.\n * @param {string} str The string to trim.\n * @return {string} A trimmed copy of `str`.\n */\ngoog.string.trim = goog.string.internal.trim;\n\n\n/**\n * Trims whitespaces at the left end of a string.\n * @param {string} str The string to left trim.\n * @return {string} A trimmed copy of `str`.\n */\ngoog.string.trimLeft = function(str) {\n  'use strict';\n  // Since IE doesn't include non-breaking-space (0xa0) in their \\s character\n  // class (as required by section 7.2 of the ECMAScript spec), we explicitly\n  // include it in the regexp to enforce consistent cross-browser behavior.\n  return str.replace(/^[\\s\\xa0]+/, '');\n};\n\n\n/**\n * Trims whitespaces at the right end of a string.\n * @param {string} str The string to right trim.\n * @return {string} A trimmed copy of `str`.\n */\ngoog.string.trimRight = function(str) {\n  'use strict';\n  // Since IE doesn't include non-breaking-space (0xa0) in their \\s character\n  // class (as required by section 7.2 of the ECMAScript spec), we explicitly\n  // include it in the regexp to enforce consistent cross-browser behavior.\n  return str.replace(/[\\s\\xa0]+$/, '');\n};\n\n\n/**\n * A string comparator that ignores case.\n * -1 = str1 less than str2\n *  0 = str1 equals str2\n *  1 = str1 greater than str2\n *\n * @param {string} str1 The string to compare.\n * @param {string} str2 The string to compare `str1` to.\n * @return {number} The comparator result, as described above.\n */\ngoog.string.caseInsensitiveCompare =\n    goog.string.internal.caseInsensitiveCompare;\n\n\n/**\n * Compares two strings interpreting their numeric substrings as numbers.\n *\n * @param {string} str1 First string.\n * @param {string} str2 Second string.\n * @param {!RegExp} tokenizerRegExp Splits a string into substrings of\n *     non-negative integers, non-numeric characters and optionally fractional\n *     numbers starting with a decimal point.\n * @return {number} Negative if str1 < str2, 0 is str1 == str2, positive if\n *     str1 > str2.\n * @private\n */\ngoog.string.numberAwareCompare_ = function(str1, str2, tokenizerRegExp) {\n  'use strict';\n  if (str1 == str2) {\n    return 0;\n  }\n  if (!str1) {\n    return -1;\n  }\n  if (!str2) {\n    return 1;\n  }\n\n  // Using match to split the entire string ahead of time turns out to be faster\n  // for most inputs than using RegExp.exec or iterating over each character.\n  const tokens1 = str1.toLowerCase().match(tokenizerRegExp);\n  const tokens2 = str2.toLowerCase().match(tokenizerRegExp);\n\n  const count = Math.min(tokens1.length, tokens2.length);\n\n  for (let i = 0; i < count; i++) {\n    const a = tokens1[i];\n    const b = tokens2[i];\n\n    // Compare pairs of tokens, returning if one token sorts before the other.\n    if (a != b) {\n      // Only if both tokens are integers is a special comparison required.\n      // Decimal numbers are sorted as strings (e.g., '.09' < '.1').\n      const num1 = parseInt(a, 10);\n      if (!isNaN(num1)) {\n        const num2 = parseInt(b, 10);\n        if (!isNaN(num2) && num1 - num2) {\n          return num1 - num2;\n        }\n      }\n      return a < b ? -1 : 1;\n    }\n  }\n\n  // If one string is a substring of the other, the shorter string sorts first.\n  if (tokens1.length != tokens2.length) {\n    return tokens1.length - tokens2.length;\n  }\n\n  // The two strings must be equivalent except for case (perfect equality is\n  // tested at the head of the function.) Revert to default ASCII string\n  // comparison to stabilize the sort.\n  return str1 < str2 ? -1 : 1;\n};\n\n\n/**\n * String comparison function that handles non-negative integer numbers in a\n * way humans might expect. Using this function, the string 'File 2.jpg' sorts\n * before 'File 10.jpg', and 'Version 1.9' before 'Version 1.10'. The comparison\n * is mostly case-insensitive, though strings that are identical except for case\n * are sorted with the upper-case strings before lower-case.\n *\n * This comparison function is up to 50x slower than either the default or the\n * case-insensitive compare. It should not be used in time-critical code, but\n * should be fast enough to sort several hundred short strings (like filenames)\n * with a reasonable delay.\n *\n * @param {string} str1 The string to compare in a numerically sensitive way.\n * @param {string} str2 The string to compare `str1` to.\n * @return {number} less than 0 if str1 < str2, 0 if str1 == str2, greater than\n *     0 if str1 > str2.\n */\ngoog.string.intAwareCompare = function(str1, str2) {\n  'use strict';\n  return goog.string.numberAwareCompare_(str1, str2, /\\d+|\\D+/g);\n};\n\n\n/**\n * String comparison function that handles non-negative integer and fractional\n * numbers in a way humans might expect. Using this function, the string\n * 'File 2.jpg' sorts before 'File 10.jpg', and '3.14' before '3.2'. Equivalent\n * to {@link goog.string.intAwareCompare} apart from the way how it interprets\n * dots.\n *\n * @param {string} str1 The string to compare in a numerically sensitive way.\n * @param {string} str2 The string to compare `str1` to.\n * @return {number} less than 0 if str1 < str2, 0 if str1 == str2, greater than\n *     0 if str1 > str2.\n */\ngoog.string.floatAwareCompare = function(str1, str2) {\n  'use strict';\n  return goog.string.numberAwareCompare_(str1, str2, /\\d+|\\.\\d+|\\D+/g);\n};\n\n\n/**\n * Alias for {@link goog.string.floatAwareCompare}.\n *\n * @param {string} str1\n * @param {string} str2\n * @return {number}\n */\ngoog.string.numerateCompare = goog.string.floatAwareCompare;\n\n\n/**\n * URL-encodes a string\n * @param {*} str The string to url-encode.\n * @return {string} An encoded copy of `str` that is safe for urls.\n *     Note that '#', ':', and other characters used to delimit portions\n *     of URLs *will* be encoded.\n */\ngoog.string.urlEncode = function(str) {\n  'use strict';\n  return encodeURIComponent(String(str));\n};\n\n\n/**\n * URL-decodes the string. We need to specially handle '+'s because\n * the javascript library doesn't convert them to spaces.\n * @param {string} str The string to url decode.\n * @return {string} The decoded `str`.\n */\ngoog.string.urlDecode = function(str) {\n  'use strict';\n  return decodeURIComponent(str.replace(/\\+/g, ' '));\n};\n\n\n/**\n * Converts \\n to <br>s or <br />s.\n * @param {string} str The string in which to convert newlines.\n * @param {boolean=} opt_xml Whether to use XML compatible tags.\n * @return {string} A copy of `str` with converted newlines.\n */\ngoog.string.newLineToBr = goog.string.internal.newLineToBr;\n\n\n/**\n * Escapes double quote '\"' and single quote '\\'' characters in addition to\n * '&', '<', and '>' so that a string can be included in an HTML tag attribute\n * value within double or single quotes.\n *\n * It should be noted that > doesn't need to be escaped for the HTML or XML to\n * be valid, but it has been decided to escape it for consistency with other\n * implementations.\n *\n * With goog.string.DETECT_DOUBLE_ESCAPING, this function escapes also the\n * lowercase letter \"e\".\n *\n * NOTE(user):\n * HtmlEscape is often called during the generation of large blocks of HTML.\n * Using statics for the regular expressions and strings is an optimization\n * that can more than half the amount of time IE spends in this function for\n * large apps, since strings and regexes both contribute to GC allocations.\n *\n * Testing for the presence of a character before escaping increases the number\n * of function calls, but actually provides a speed increase for the average\n * case -- since the average case often doesn't require the escaping of all 4\n * characters and indexOf() is much cheaper than replace().\n * The worst case does suffer slightly from the additional calls, therefore the\n * opt_isLikelyToContainHtmlChars option has been included for situations\n * where all 4 HTML entities are very likely to be present and need escaping.\n *\n * Some benchmarks (times tended to fluctuate +-0.05ms):\n *                                     FireFox                     IE6\n * (no chars / average (mix of cases) / all 4 chars)\n * no checks                     0.13 / 0.22 / 0.22         0.23 / 0.53 / 0.80\n * indexOf                       0.08 / 0.17 / 0.26         0.22 / 0.54 / 0.84\n * indexOf + re test             0.07 / 0.17 / 0.28         0.19 / 0.50 / 0.85\n *\n * An additional advantage of checking if replace actually needs to be called\n * is a reduction in the number of object allocations, so as the size of the\n * application grows the difference between the various methods would increase.\n *\n * @param {string} str string to be escaped.\n * @param {boolean=} opt_isLikelyToContainHtmlChars Don't perform a check to see\n *     if the character needs replacing - use this option if you expect each of\n *     the characters to appear often. Leave false if you expect few html\n *     characters to occur in your strings, such as if you are escaping HTML.\n * @return {string} An escaped copy of `str`.\n */\ngoog.string.htmlEscape = function(str, opt_isLikelyToContainHtmlChars) {\n  'use strict';\n  str = goog.string.internal.htmlEscape(str, opt_isLikelyToContainHtmlChars);\n  if (goog.string.DETECT_DOUBLE_ESCAPING) {\n    str = str.replace(goog.string.E_RE_, '&#101;');\n  }\n  return str;\n};\n\n\n/**\n * Regular expression that matches a lowercase letter \"e\", for use in escaping.\n * @const {!RegExp}\n * @private\n */\ngoog.string.E_RE_ = /e/g;\n\n\n/**\n * Unescapes an HTML string.\n *\n * @param {string} str The string to unescape.\n * @return {string} An unescaped copy of `str`.\n */\ngoog.string.unescapeEntities = function(str) {\n  'use strict';\n  if (goog.string.contains(str, '&')) {\n    // We are careful not to use a DOM if we do not have one or we explicitly\n    // requested non-DOM html unescaping.\n    if (!goog.string.FORCE_NON_DOM_HTML_UNESCAPING &&\n        'document' in goog.global) {\n      return goog.string.unescapeEntitiesUsingDom_(str);\n    } else {\n      // Fall back on pure XML entities\n      return goog.string.unescapePureXmlEntities_(str);\n    }\n  }\n  return str;\n};\n\n\n/**\n * Unescapes a HTML string using the provided document.\n *\n * @param {string} str The string to unescape.\n * @param {!Document} document A document to use in escaping the string.\n * @return {string} An unescaped copy of `str`.\n */\ngoog.string.unescapeEntitiesWithDocument = function(str, document) {\n  'use strict';\n  if (goog.string.contains(str, '&')) {\n    return goog.string.unescapeEntitiesUsingDom_(str, document);\n  }\n  return str;\n};\n\n\n/**\n * Unescapes an HTML string using a DOM to resolve non-XML, non-numeric\n * entities. This function is XSS-safe and whitespace-preserving.\n * @private\n * @param {string} str The string to unescape.\n * @param {Document=} opt_document An optional document to use for creating\n *     elements. If this is not specified then the default window.document\n *     will be used.\n * @return {string} The unescaped `str` string.\n */\ngoog.string.unescapeEntitiesUsingDom_ = function(str, opt_document) {\n  'use strict';\n  /** @type {!Object<string, string>} */\n  const seen = {'&amp;': '&', '&lt;': '<', '&gt;': '>', '&quot;': '\"'};\n  /** @type {!Element} */\n  let div;\n  if (opt_document) {\n    div = opt_document.createElement('div');\n  } else {\n    div = goog.global.document.createElement('div');\n  }\n  // Match as many valid entity characters as possible. If the actual entity\n  // happens to be shorter, it will still work as innerHTML will return the\n  // trailing characters unchanged. Since the entity characters do not include\n  // open angle bracket, there is no chance of XSS from the innerHTML use.\n  // Since no whitespace is passed to innerHTML, whitespace is preserved.\n  return str.replace(goog.string.HTML_ENTITY_PATTERN_, function(s, entity) {\n    'use strict';\n    // Check for cached entity.\n    let value = seen[s];\n    if (value) {\n      return value;\n    }\n    // Check for numeric entity.\n    if (entity.charAt(0) == '#') {\n      // Prefix with 0 so that hex entities (e.g. &#x10) parse as hex numbers.\n      const n = Number('0' + entity.substr(1));\n      if (!isNaN(n)) {\n        value = String.fromCharCode(n);\n      }\n    }\n    // Fall back to innerHTML otherwise.\n    if (!value) {\n      // Append a non-entity character to avoid a bug in Webkit that parses\n      // an invalid entity at the end of innerHTML text as the empty string.\n      goog.dom.safe.setInnerHtml(\n          div,\n          goog.html.uncheckedconversions\n              .safeHtmlFromStringKnownToSatisfyTypeContract(\n                  goog.string.Const.from('Single HTML entity.'), s + ' '));\n      // Then remove the trailing character from the result.\n      value = div.firstChild.nodeValue.slice(0, -1);\n    }\n    // Cache and return.\n    return seen[s] = value;\n  });\n};\n\n\n/**\n * Unescapes XML entities.\n * @private\n * @param {string} str The string to unescape.\n * @return {string} An unescaped copy of `str`.\n */\ngoog.string.unescapePureXmlEntities_ = function(str) {\n  'use strict';\n  return str.replace(/&([^;]+);/g, function(s, entity) {\n    'use strict';\n    switch (entity) {\n      case 'amp':\n        return '&';\n      case 'lt':\n        return '<';\n      case 'gt':\n        return '>';\n      case 'quot':\n        return '\"';\n      default:\n        if (entity.charAt(0) == '#') {\n          // Prefix with 0 so that hex entities (e.g. &#x10) parse as hex.\n          const n = Number('0' + entity.substr(1));\n          if (!isNaN(n)) {\n            return String.fromCharCode(n);\n          }\n        }\n        // For invalid entities we just return the entity\n        return s;\n    }\n  });\n};\n\n\n/**\n * Regular expression that matches an HTML entity.\n * See also HTML5: Tokenization / Tokenizing character references.\n * @private\n * @type {!RegExp}\n */\ngoog.string.HTML_ENTITY_PATTERN_ = /&([^;\\s<&]+);?/g;\n\n\n/**\n * Do escaping of whitespace to preserve spatial formatting. We use character\n * entity #160 to make it safer for xml.\n * @param {string} str The string in which to escape whitespace.\n * @param {boolean=} opt_xml Whether to use XML compatible tags.\n * @return {string} An escaped copy of `str`.\n */\ngoog.string.whitespaceEscape = function(str, opt_xml) {\n  'use strict';\n  // This doesn't use goog.string.preserveSpaces for backwards compatibility.\n  return goog.string.newLineToBr(str.replace(/  /g, ' &#160;'), opt_xml);\n};\n\n\n/**\n * Preserve spaces that would be otherwise collapsed in HTML by replacing them\n * with non-breaking space Unicode characters.\n * @param {string} str The string in which to preserve whitespace.\n * @return {string} A copy of `str` with preserved whitespace.\n */\ngoog.string.preserveSpaces = function(str) {\n  'use strict';\n  return str.replace(/(^|[\\n ]) /g, '$1' + goog.string.Unicode.NBSP);\n};\n\n\n/**\n * Strip quote characters around a string.  The second argument is a string of\n * characters to treat as quotes.  This can be a single character or a string of\n * multiple character and in that case each of those are treated as possible\n * quote characters. For example:\n *\n * <pre>\n * goog.string.stripQuotes('\"abc\"', '\"`') --> 'abc'\n * goog.string.stripQuotes('`abc`', '\"`') --> 'abc'\n * </pre>\n *\n * @param {string} str The string to strip.\n * @param {string} quoteChars The quote characters to strip.\n * @return {string} A copy of `str` without the quotes.\n */\ngoog.string.stripQuotes = function(str, quoteChars) {\n  'use strict';\n  const length = quoteChars.length;\n  for (let i = 0; i < length; i++) {\n    const quoteChar = length == 1 ? quoteChars : quoteChars.charAt(i);\n    if (str.charAt(0) == quoteChar && str.charAt(str.length - 1) == quoteChar) {\n      return str.substring(1, str.length - 1);\n    }\n  }\n  return str;\n};\n\n\n/**\n * Truncates a string to a certain length and adds '...' if necessary.  The\n * length also accounts for the ellipsis, so a maximum length of 10 and a string\n * 'Hello World!' produces 'Hello W...'.\n * @param {string} str The string to truncate.\n * @param {number} chars Max number of characters.\n * @param {boolean=} opt_protectEscapedCharacters Whether to protect escaped\n *     characters from being cut off in the middle.\n * @return {string} The truncated `str` string.\n */\ngoog.string.truncate = function(str, chars, opt_protectEscapedCharacters) {\n  'use strict';\n  if (opt_protectEscapedCharacters) {\n    str = goog.string.unescapeEntities(str);\n  }\n\n  if (str.length > chars) {\n    str = str.substring(0, chars - 3) + '...';\n  }\n\n  if (opt_protectEscapedCharacters) {\n    str = goog.string.htmlEscape(str);\n  }\n\n  return str;\n};\n\n\n/**\n * Truncate a string in the middle, adding \"...\" if necessary,\n * and favoring the beginning of the string.\n * @param {string} str The string to truncate the middle of.\n * @param {number} chars Max number of characters.\n * @param {boolean=} opt_protectEscapedCharacters Whether to protect escaped\n *     characters from being cutoff in the middle.\n * @param {number=} opt_trailingChars Optional number of trailing characters to\n *     leave at the end of the string, instead of truncating as close to the\n *     middle as possible.\n * @return {string} A truncated copy of `str`.\n */\ngoog.string.truncateMiddle = function(\n    str, chars, opt_protectEscapedCharacters, opt_trailingChars) {\n  'use strict';\n  if (opt_protectEscapedCharacters) {\n    str = goog.string.unescapeEntities(str);\n  }\n\n  if (opt_trailingChars && str.length > chars) {\n    if (opt_trailingChars > chars) {\n      opt_trailingChars = chars;\n    }\n    const endPoint = str.length - opt_trailingChars;\n    const startPoint = chars - opt_trailingChars;\n    str = str.substring(0, startPoint) + '...' + str.substring(endPoint);\n  } else if (str.length > chars) {\n    // Favor the beginning of the string:\n    let half = Math.floor(chars / 2);\n    const endPos = str.length - half;\n    half += chars % 2;\n    str = str.substring(0, half) + '...' + str.substring(endPos);\n  }\n\n  if (opt_protectEscapedCharacters) {\n    str = goog.string.htmlEscape(str);\n  }\n\n  return str;\n};\n\n\n/**\n * Special chars that need to be escaped for goog.string.quote.\n * @private {!Object<string, string>}\n */\ngoog.string.specialEscapeChars_ = {\n  '\\0': '\\\\0',\n  '\\b': '\\\\b',\n  '\\f': '\\\\f',\n  '\\n': '\\\\n',\n  '\\r': '\\\\r',\n  '\\t': '\\\\t',\n  '\\x0B': '\\\\x0B',  // '\\v' is not supported in JScript\n  '\"': '\\\\\"',\n  '\\\\': '\\\\\\\\',\n  // To support the use case of embedding quoted strings inside of script\n  // tags, we have to make sure HTML comments and opening/closing script tags do\n  // not appear in the resulting string. The specific strings that must be\n  // escaped are documented at:\n  // https://html.spec.whatwg.org/multipage/scripting.html#restrictions-for-contents-of-script-elements\n  '<': '\\\\u003C'  // NOTE: JSON.parse crashes on '\\\\x3c'.\n};\n\n\n/**\n * Character mappings used internally for goog.string.escapeChar.\n * @private {!Object<string, string>}\n */\ngoog.string.jsEscapeCache_ = {\n  '\\'': '\\\\\\''\n};\n\n\n/**\n * Encloses a string in double quotes and escapes characters so that the\n * string is a valid JS string. The resulting string is safe to embed in\n * `<script>` tags as \"<\" is escaped.\n * @param {string} s The string to quote.\n * @return {string} A copy of `s` surrounded by double quotes.\n */\ngoog.string.quote = function(s) {\n  'use strict';\n  s = String(s);\n  const sb = ['\"'];\n  for (let i = 0; i < s.length; i++) {\n    const ch = s.charAt(i);\n    const cc = ch.charCodeAt(0);\n    sb[i + 1] = goog.string.specialEscapeChars_[ch] ||\n        ((cc > 31 && cc < 127) ? ch : goog.string.escapeChar(ch));\n  }\n  sb.push('\"');\n  return sb.join('');\n};\n\n\n/**\n * Takes a string and returns the escaped string for that input string.\n * @param {string} str The string to escape.\n * @return {string} An escaped string representing `str`.\n */\ngoog.string.escapeString = function(str) {\n  'use strict';\n  const sb = [];\n  for (let i = 0; i < str.length; i++) {\n    sb[i] = goog.string.escapeChar(str.charAt(i));\n  }\n  return sb.join('');\n};\n\n\n/**\n * Takes a character and returns the escaped string for that character. For\n * example escapeChar(String.fromCharCode(15)) -> \"\\\\x0E\".\n * @param {string} c The character to escape.\n * @return {string} An escaped string representing `c`.\n */\ngoog.string.escapeChar = function(c) {\n  'use strict';\n  if (c in goog.string.jsEscapeCache_) {\n    return goog.string.jsEscapeCache_[c];\n  }\n\n  if (c in goog.string.specialEscapeChars_) {\n    return goog.string.jsEscapeCache_[c] = goog.string.specialEscapeChars_[c];\n  }\n\n  let rv = c;\n  const cc = c.charCodeAt(0);\n  if (cc > 31 && cc < 127) {\n    rv = c;\n  } else {\n    // tab is 9 but handled above\n    if (cc < 256) {\n      rv = '\\\\x';\n      if (cc < 16 || cc > 256) {\n        rv += '0';\n      }\n    } else {\n      rv = '\\\\u';\n      if (cc < 4096) {  // \\u1000\n        rv += '0';\n      }\n    }\n    rv += cc.toString(16).toUpperCase();\n  }\n\n  return goog.string.jsEscapeCache_[c] = rv;\n};\n\n\n/**\n * Determines whether a string contains a substring.\n * @param {string} str The string to search.\n * @param {string} subString The substring to search for.\n * @return {boolean} Whether `str` contains `subString`.\n */\ngoog.string.contains = goog.string.internal.contains;\n\n\n/**\n * Determines whether a string contains a substring, ignoring case.\n * @param {string} str The string to search.\n * @param {string} subString The substring to search for.\n * @return {boolean} Whether `str` contains `subString`.\n */\ngoog.string.caseInsensitiveContains =\n    goog.string.internal.caseInsensitiveContains;\n\n\n/**\n * Returns the non-overlapping occurrences of ss in s.\n * If either s or ss evalutes to false, then returns zero.\n * @param {string} s The string to look in.\n * @param {string} ss The string to look for.\n * @return {number} Number of occurrences of ss in s.\n */\ngoog.string.countOf = function(s, ss) {\n  'use strict';\n  return s && ss ? s.split(ss).length - 1 : 0;\n};\n\n\n/**\n * Removes a substring of a specified length at a specific\n * index in a string.\n * @param {string} s The base string from which to remove.\n * @param {number} index The index at which to remove the substring.\n * @param {number} stringLength The length of the substring to remove.\n * @return {string} A copy of `s` with the substring removed or the full\n *     string if nothing is removed or the input is invalid.\n */\ngoog.string.removeAt = function(s, index, stringLength) {\n  'use strict';\n  let resultStr = s;\n  // If the index is greater or equal to 0 then remove substring\n  if (index >= 0 && index < s.length && stringLength > 0) {\n    resultStr = s.substr(0, index) +\n        s.substr(index + stringLength, s.length - index - stringLength);\n  }\n  return resultStr;\n};\n\n\n/**\n * Removes the first occurrence of a substring from a string.\n * @param {string} str The base string from which to remove.\n * @param {string} substr The string to remove.\n * @return {string} A copy of `str` with `substr` removed or the\n *     full string if nothing is removed.\n */\ngoog.string.remove = function(str, substr) {\n  'use strict';\n  return str.replace(substr, '');\n};\n\n\n/**\n *  Removes all occurrences of a substring from a string.\n *  @param {string} s The base string from which to remove.\n *  @param {string} ss The string to remove.\n *  @return {string} A copy of `s` with `ss` removed or the full\n *      string if nothing is removed.\n */\ngoog.string.removeAll = function(s, ss) {\n  'use strict';\n  const re = new RegExp(goog.string.regExpEscape(ss), 'g');\n  return s.replace(re, '');\n};\n\n\n/**\n *  Replaces all occurrences of a substring of a string with a new substring.\n *  @param {string} s The base string from which to remove.\n *  @param {string} ss The string to replace.\n *  @param {string} replacement The replacement string.\n *  @return {string} A copy of `s` with `ss` replaced by\n *      `replacement` or the original string if nothing is replaced.\n */\ngoog.string.replaceAll = function(s, ss, replacement) {\n  'use strict';\n  const re = new RegExp(goog.string.regExpEscape(ss), 'g');\n  return s.replace(re, replacement.replace(/\\$/g, '$$$$'));\n};\n\n\n/**\n * Escapes characters in the string that are not safe to use in a RegExp.\n * @param {*} s The string to escape. If not a string, it will be casted\n *     to one.\n * @return {string} A RegExp safe, escaped copy of `s`.\n */\ngoog.string.regExpEscape = function(s) {\n  'use strict';\n  return String(s)\n      .replace(/([-()\\[\\]{}+?*.$\\^|,:#<!\\\\])/g, '\\\\$1')\n      .replace(/\\x08/g, '\\\\x08');\n};\n\n\n/**\n * Repeats a string n times.\n * @param {string} string The string to repeat.\n * @param {number} length The number of times to repeat.\n * @return {string} A string containing `length` repetitions of\n *     `string`.\n */\ngoog.string.repeat = (String.prototype.repeat) ? function(string, length) {\n  'use strict';\n  // The native method is over 100 times faster than the alternative.\n  return string.repeat(length);\n} : function(string, length) {\n  'use strict';\n  return new Array(length + 1).join(string);\n};\n\n\n/**\n * Pads number to given length and optionally rounds it to a given precision.\n * For example:\n * <pre>padNumber(1.25, 2, 3) -> '01.250'\n * padNumber(1.25, 2) -> '01.25'\n * padNumber(1.25, 2, 1) -> '01.3'\n * padNumber(1.25, 0) -> '1.25'</pre>\n *\n * @param {number} num The number to pad.\n * @param {number} length The desired length.\n * @param {number=} opt_precision The desired precision.\n * @return {string} `num` as a string with the given options.\n */\ngoog.string.padNumber = function(num, length, opt_precision) {\n  'use strict';\n  if (!Number.isFinite(num)) return String(num);\n  let s =\n      (opt_precision !== undefined) ? num.toFixed(opt_precision) : String(num);\n  let index = s.indexOf('.');\n  if (index === -1) {\n    index = s.length;\n  }\n  const sign = s[0] === '-' ? '-' : '';\n  if (sign) {\n    s = s.substring(1);\n  }\n  return sign + goog.string.repeat('0', Math.max(0, length - index)) + s;\n};\n\n\n/**\n * Returns a string representation of the given object, with\n * null and undefined being returned as the empty string.\n *\n * @param {*} obj The object to convert.\n * @return {string} A string representation of the `obj`.\n */\ngoog.string.makeSafe = function(obj) {\n  'use strict';\n  return obj == null ? '' : String(obj);\n};\n\n/**\n * Returns a string with at least 64-bits of randomness.\n *\n * Doesn't trust JavaScript's random function entirely. Uses a combination of\n * random and current timestamp, and then encodes the string in base-36 to\n * make it shorter.\n *\n * @return {string} A random string, e.g. sn1s7vb4gcic.\n */\ngoog.string.getRandomString = function() {\n  'use strict';\n  const x = 2147483648;\n  return Math.floor(Math.random() * x).toString(36) +\n      Math.abs(Math.floor(Math.random() * x) ^ goog.now()).toString(36);\n};\n\n\n/**\n * Compares two version numbers.\n *\n * @param {string|number} version1 Version of first item.\n * @param {string|number} version2 Version of second item.\n *\n * @return {number}  1 if `version1` is higher.\n *                   0 if arguments are equal.\n *                  -1 if `version2` is higher.\n */\ngoog.string.compareVersions = goog.string.internal.compareVersions;\n\n\n/**\n * String hash function similar to java.lang.String.hashCode().\n * The hash code for a string is computed as\n * s[0] * 31 ^ (n - 1) + s[1] * 31 ^ (n - 2) + ... + s[n - 1],\n * where s[i] is the ith character of the string and n is the length of\n * the string. We mod the result to make it between 0 (inclusive) and 2^32\n * (exclusive).\n * @param {string} str A string.\n * @return {number} Hash value for `str`, between 0 (inclusive) and 2^32\n *  (exclusive). The empty string returns 0.\n */\ngoog.string.hashCode = function(str) {\n  'use strict';\n  let result = 0;\n  for (let i = 0; i < str.length; ++i) {\n    // Normalize to 4 byte range, 0 ... 2^32.\n    result = (31 * result + str.charCodeAt(i)) >>> 0;\n  }\n  return result;\n};\n\n\n/**\n * The most recent unique ID. |0 is equivalent to Math.floor in this case.\n * @type {number}\n * @private\n */\ngoog.string.uniqueStringCounter_ = Math.random() * 0x80000000 | 0;\n\n\n/**\n * Generates and returns a string which is unique in the current document.\n * This is useful, for example, to create unique IDs for DOM elements.\n * @return {string} A unique id.\n */\ngoog.string.createUniqueString = function() {\n  'use strict';\n  return 'goog_' + goog.string.uniqueStringCounter_++;\n};\n\n\n/**\n * Converts the supplied string to a number, which may be Infinity or NaN.\n * This function strips whitespace: (toNumber(' 123') === 123)\n * This function accepts scientific notation: (toNumber('1e1') === 10)\n *\n * This is better than JavaScript's built-in conversions because, sadly:\n *     (Number(' ') === 0) and (parseFloat('123a') === 123)\n *\n * @param {string} str The string to convert.\n * @return {number} The number the supplied string represents, or NaN.\n */\ngoog.string.toNumber = function(str) {\n  'use strict';\n  const num = Number(str);\n  if (num == 0 && goog.string.isEmptyOrWhitespace(str)) {\n    return NaN;\n  }\n  return num;\n};\n\n\n/**\n * Returns whether the given string is lower camel case (e.g. \"isFooBar\").\n *\n * Note that this assumes the string is entirely letters.\n * @see http://en.wikipedia.org/wiki/CamelCase#Variations_and_synonyms\n *\n * @param {string} str String to test.\n * @return {boolean} Whether the string is lower camel case.\n */\ngoog.string.isLowerCamelCase = function(str) {\n  'use strict';\n  return /^[a-z]+([A-Z][a-z]*)*$/.test(str);\n};\n\n\n/**\n * Returns whether the given string is upper camel case (e.g. \"FooBarBaz\").\n *\n * Note that this assumes the string is entirely letters.\n * @see http://en.wikipedia.org/wiki/CamelCase#Variations_and_synonyms\n *\n * @param {string} str String to test.\n * @return {boolean} Whether the string is upper camel case.\n */\ngoog.string.isUpperCamelCase = function(str) {\n  'use strict';\n  return /^([A-Z][a-z]*)+$/.test(str);\n};\n\n\n/**\n * Converts a string from selector-case to camelCase (e.g. from\n * \"multi-part-string\" to \"multiPartString\"), useful for converting\n * CSS selectors and HTML dataset keys to their equivalent JS properties.\n * @param {string} str The string in selector-case form.\n * @return {string} The string in camelCase form.\n */\ngoog.string.toCamelCase = function(str) {\n  'use strict';\n  return String(str).replace(/\\-([a-z])/g, function(all, match) {\n    'use strict';\n    return match.toUpperCase();\n  });\n};\n\n\n/**\n * Converts a string from camelCase to selector-case (e.g. from\n * \"multiPartString\" to \"multi-part-string\"), useful for converting JS\n * style and dataset properties to equivalent CSS selectors and HTML keys.\n * @param {string} str The string in camelCase form.\n * @return {string} The string in selector-case form.\n */\ngoog.string.toSelectorCase = function(str) {\n  'use strict';\n  return String(str).replace(/([A-Z])/g, '-$1').toLowerCase();\n};\n\n\n/**\n * Converts a string into TitleCase. First character of the string is always\n * capitalized in addition to the first letter of every subsequent word.\n * Words are delimited by one or more whitespaces by default. Custom delimiters\n * can optionally be specified to replace the default, which doesn't preserve\n * whitespace delimiters and instead must be explicitly included if needed.\n *\n * Default delimiter => \" \":\n *    goog.string.toTitleCase('oneTwoThree')    => 'OneTwoThree'\n *    goog.string.toTitleCase('one two three')  => 'One Two Three'\n *    goog.string.toTitleCase('  one   two   ') => '  One   Two   '\n *    goog.string.toTitleCase('one_two_three')  => 'One_two_three'\n *    goog.string.toTitleCase('one-two-three')  => 'One-two-three'\n *\n * Custom delimiter => \"_-.\":\n *    goog.string.toTitleCase('oneTwoThree', '_-.')       => 'OneTwoThree'\n *    goog.string.toTitleCase('one two three', '_-.')     => 'One two three'\n *    goog.string.toTitleCase('  one   two   ', '_-.')    => '  one   two   '\n *    goog.string.toTitleCase('one_two_three', '_-.')     => 'One_Two_Three'\n *    goog.string.toTitleCase('one-two-three', '_-.')     => 'One-Two-Three'\n *    goog.string.toTitleCase('one...two...three', '_-.') => 'One...Two...Three'\n *    goog.string.toTitleCase('one. two. three', '_-.')   => 'One. two. three'\n *    goog.string.toTitleCase('one-two.three', '_-.')     => 'One-Two.Three'\n *\n * @param {string} str String value in camelCase form.\n * @param {string=} opt_delimiters Custom delimiter character set used to\n *      distinguish words in the string value. Each character represents a\n *      single delimiter. When provided, default whitespace delimiter is\n *      overridden and must be explicitly included if needed.\n * @return {string} String value in TitleCase form.\n */\ngoog.string.toTitleCase = function(str, opt_delimiters) {\n  'use strict';\n  let delimiters = (typeof opt_delimiters === 'string') ?\n      goog.string.regExpEscape(opt_delimiters) :\n      '\\\\s';\n\n  // For IE8, we need to prevent using an empty character set. Otherwise,\n  // incorrect matching will occur.\n  delimiters = delimiters ? '|[' + delimiters + ']+' : '';\n\n  const regexp = new RegExp('(^' + delimiters + ')([a-z])', 'g');\n  return str.replace(regexp, function(all, p1, p2) {\n    'use strict';\n    return p1 + p2.toUpperCase();\n  });\n};\n\n\n/**\n * Capitalizes a string, i.e. converts the first letter to uppercase\n * and all other letters to lowercase, e.g.:\n *\n * goog.string.capitalize('one')     => 'One'\n * goog.string.capitalize('ONE')     => 'One'\n * goog.string.capitalize('one two') => 'One two'\n *\n * Note that this function does not trim initial whitespace.\n *\n * @param {string} str String value to capitalize.\n * @return {string} String value with first letter in uppercase.\n */\ngoog.string.capitalize = function(str) {\n  'use strict';\n  return String(str.charAt(0)).toUpperCase() +\n      String(str.substr(1)).toLowerCase();\n};\n\n\n/**\n * Parse a string in decimal or hexidecimal ('0xFFFF') form.\n *\n * To parse a particular radix, please use parseInt(string, radix) directly. See\n * https://developer.mozilla.org/en/JavaScript/Reference/Global_Objects/parseInt\n *\n * This is a wrapper for the built-in parseInt function that will only parse\n * numbers as base 10 or base 16.  Some JS implementations assume strings\n * starting with \"0\" are intended to be octal. ES3 allowed but discouraged\n * this behavior. ES5 forbids it.  This function emulates the ES5 behavior.\n *\n * For more information, see Mozilla JS Reference: http://goo.gl/8RiFj\n *\n * @param {string|number|null|undefined} value The value to be parsed.\n * @return {number} The number, parsed. If the string failed to parse, this\n *     will be NaN.\n */\ngoog.string.parseInt = function(value) {\n  'use strict';\n  // Force finite numbers to strings.\n  if (isFinite(value)) {\n    value = String(value);\n  }\n\n  if (typeof value === 'string') {\n    // If the string starts with '0x' or '-0x', parse as hex.\n    return /^\\s*-?0x/i.test(value) ? parseInt(value, 16) : parseInt(value, 10);\n  }\n\n  return NaN;\n};\n\n\n/**\n * Splits a string on a separator a limited number of times.\n *\n * This implementation is more similar to Python or Java, where the limit\n * parameter specifies the maximum number of splits rather than truncating\n * the number of results.\n *\n * See http://docs.python.org/2/library/stdtypes.html#str.split\n * See JavaDoc: http://goo.gl/F2AsY\n * See Mozilla reference: http://goo.gl/dZdZs\n *\n * @param {string} str String to split.\n * @param {string} separator The separator.\n * @param {number} limit The limit to the number of splits. The resulting array\n *     will have a maximum length of limit+1.  Negative numbers are the same\n *     as zero.\n * @return {!Array<string>} The string, split.\n */\ngoog.string.splitLimit = function(str, separator, limit) {\n  'use strict';\n  const parts = str.split(separator);\n  const returnVal = [];\n\n  // Only continue doing this while we haven't hit the limit and we have\n  // parts left.\n  while (limit > 0 && parts.length) {\n    returnVal.push(parts.shift());\n    limit--;\n  }\n\n  // If there are remaining parts, append them to the end.\n  if (parts.length) {\n    returnVal.push(parts.join(separator));\n  }\n\n  return returnVal;\n};\n\n\n/**\n * Finds the characters to the right of the last instance of any separator\n *\n * This function is similar to goog.string.path.baseName, except it can take a\n * list of characters to split the string on. It will return the rightmost\n * grouping of characters to the right of any separator as a left-to-right\n * oriented string.\n *\n * @see goog.string.path.baseName\n * @param {string} str The string\n * @param {string|!Array<string>} separators A list of separator characters\n * @return {string} The last part of the string with respect to the separators\n */\ngoog.string.lastComponent = function(str, separators) {\n  'use strict';\n  if (!separators) {\n    return str;\n  } else if (typeof separators == 'string') {\n    separators = [separators];\n  }\n\n  let lastSeparatorIndex = -1;\n  for (let i = 0; i < separators.length; i++) {\n    if (separators[i] == '') {\n      continue;\n    }\n    const currentSeparatorIndex = str.lastIndexOf(separators[i]);\n    if (currentSeparatorIndex > lastSeparatorIndex) {\n      lastSeparatorIndex = currentSeparatorIndex;\n    }\n  }\n  if (lastSeparatorIndex == -1) {\n    return str;\n  }\n  return str.slice(lastSeparatorIndex + 1);\n};\n\n\n/**\n * Computes the Levenshtein edit distance between two strings.\n * @param {string} a\n * @param {string} b\n * @return {number} The edit distance between the two strings.\n */\ngoog.string.editDistance = function(a, b) {\n  'use strict';\n  const v0 = [];\n  const v1 = [];\n\n  if (a == b) {\n    return 0;\n  }\n\n  if (!a.length || !b.length) {\n    return Math.max(a.length, b.length);\n  }\n\n  for (let i = 0; i < b.length + 1; i++) {\n    v0[i] = i;\n  }\n\n  for (let i = 0; i < a.length; i++) {\n    v1[0] = i + 1;\n\n    for (let j = 0; j < b.length; j++) {\n      const cost = Number(a[i] != b[j]);\n      // Cost for the substring is the minimum of adding one character, removing\n      // one character, or a swap.\n      v1[j + 1] = Math.min(v1[j] + 1, v0[j + 1] + 1, v0[j] + cost);\n    }\n\n    for (let j = 0; j < v0.length; j++) {\n      v0[j] = v1[j];\n    }\n  }\n\n  return v1[b.length];\n};\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview A pool of forward channel requests to enable real-time\n * messaging from the client to server.\n *\n */\n\ngoog.module('goog.labs.net.webChannel.ForwardChannelRequestPool');\n\ngoog.module.declareLegacyNamespace();\n\nconst ChannelRequest = goog.require('goog.labs.net.webChannel.ChannelRequest');\nconst Wire = goog.require('goog.labs.net.webChannel.Wire');\nconst array = goog.require('goog.array');\nconst googString = goog.require('goog.string');\n\n\n/**\n * This class represents the state of all forward channel requests.\n *\n * @param {number=} opt_maxPoolSize The maximum pool size.\n *\n * @struct @constructor @final\n */\nconst ForwardChannelRequestPool = function(opt_maxPoolSize) {\n  /**\n   * The max pool size as configured.\n   *\n   * @private {number}\n   */\n  this.maxPoolSizeConfigured_ =\n      opt_maxPoolSize || ForwardChannelRequestPool.MAX_POOL_SIZE_;\n\n  /**\n   * The current size limit of the request pool. This limit is meant to be\n   * read-only after the channel is fully opened.\n   *\n   * If SPDY or HTTP2 is enabled, set it to the max pool size, which is also\n   * configurable.\n   *\n   * @private {number}\n   */\n  this.maxSize_ = ForwardChannelRequestPool.isSpdyOrHttp2Enabled_() ?\n      this.maxPoolSizeConfigured_ :\n      1;\n\n  /**\n   * The container for all the pending request objects.\n   *\n   * @private {?Set<?ChannelRequest>}\n   */\n  this.requestPool_ = null;\n\n  if (this.maxSize_ > 1) {\n    this.requestPool_ = new Set();\n  }\n\n  /**\n   * The single request object when the pool size is limited to one.\n   *\n   * @private {?ChannelRequest}\n   */\n  this.request_ = null;\n\n  /**\n   * Saved pending messages when the pool is cancelled.\n   *\n   * @private {!Array<Wire.QueuedMap>}\n   */\n  this.pendingMessages_ = [];\n};\n\n\n/**\n * The default size limit of the request pool.\n *\n * @private {number}\n */\nForwardChannelRequestPool.MAX_POOL_SIZE_ = 10;\n\n\n/**\n * @return {boolean} True if SPDY or HTTP2 is enabled. Uses chrome-specific APIs\n *     as a fallback and will always return false for other browsers where\n *     PerformanceNavigationTiming is not available.\n * @private\n */\nForwardChannelRequestPool.isSpdyOrHttp2Enabled_ = function() {\n  if (goog.global.PerformanceNavigationTiming) {\n    const entrys = /** @type {!Array<!PerformanceNavigationTiming>} */ (\n        goog.global.performance.getEntriesByType('navigation'));\n    return entrys.length > 0 &&\n        (entrys[0].nextHopProtocol == 'hq' ||\n         entrys[0].nextHopProtocol == 'h2');\n  }\n  return !!(\n      goog.global.chrome && goog.global.chrome.loadTimes &&\n      goog.global.chrome.loadTimes() &&\n      goog.global.chrome.loadTimes().wasFetchedViaSpdy);\n};\n\n\n/**\n * Once we know the client protocol (from the handshake), check if we need\n * enable the request pool accordingly. This is more robust than using\n * browser-internal APIs (specific to Chrome).\n *\n * @param {string} clientProtocol The client protocol\n */\nForwardChannelRequestPool.prototype.applyClientProtocol = function(\n    clientProtocol) {\n  if (this.requestPool_) {\n    return;\n  }\n\n  if (googString.contains(clientProtocol, 'spdy') ||\n      googString.contains(clientProtocol, 'quic') ||\n      googString.contains(clientProtocol, 'h2')) {\n    this.maxSize_ = this.maxPoolSizeConfigured_;\n    this.requestPool_ = new Set();\n    if (this.request_) {\n      this.addRequest(this.request_);\n      this.request_ = null;\n    }\n  }\n};\n\n\n/**\n * @return {boolean} True if the pool is full.\n */\nForwardChannelRequestPool.prototype.isFull = function() {\n  if (this.request_) {\n    return true;\n  }\n\n  if (this.requestPool_) {\n    return this.requestPool_.size >= this.maxSize_;\n  }\n\n  return false;\n};\n\n\n/**\n * @return {number} The current size limit.\n */\nForwardChannelRequestPool.prototype.getMaxSize = function() {\n  return this.maxSize_;\n};\n\n\n/**\n * @return {number} The number of pending requests in the pool.\n */\nForwardChannelRequestPool.prototype.getRequestCount = function() {\n  if (this.request_) {\n    return 1;\n  }\n\n  if (this.requestPool_) {\n    return this.requestPool_.size;\n  }\n\n  return 0;\n};\n\n\n/**\n * @param {ChannelRequest} req The channel request.\n * @return {boolean} True if the request is a included inside the pool.\n */\nForwardChannelRequestPool.prototype.hasRequest = function(req) {\n  if (this.request_) {\n    return this.request_ == req;\n  }\n\n  if (this.requestPool_) {\n    return this.requestPool_.has(req);\n  }\n\n  return false;\n};\n\n\n/**\n * Adds a new request to the pool.\n *\n * @param {!ChannelRequest} req The new channel request.\n */\nForwardChannelRequestPool.prototype.addRequest = function(req) {\n  if (this.requestPool_) {\n    this.requestPool_.add(req);\n  } else {\n    this.request_ = req;\n  }\n};\n\n\n/**\n * Removes the given request from the pool.\n *\n * @param {ChannelRequest} req The channel request.\n * @return {boolean} Whether the request has been removed from the pool.\n */\nForwardChannelRequestPool.prototype.removeRequest = function(req) {\n  if (this.request_ && this.request_ == req) {\n    this.request_ = null;\n    return true;\n  }\n\n  if (this.requestPool_ && this.requestPool_.has(req)) {\n    this.requestPool_.delete(req);\n    return true;\n  }\n\n  return false;\n};\n\n\n/**\n * Clears the pool and cancel all the pending requests.\n */\nForwardChannelRequestPool.prototype.cancel = function() {\n  // save any pending messages\n  this.pendingMessages_ = this.getPendingMessages();\n\n  if (this.request_) {\n    this.request_.cancel();\n    this.request_ = null;\n    return;\n  }\n\n  if (this.requestPool_ && this.requestPool_.size !== 0) {\n    for (const val of this.requestPool_.values()) {\n      val.cancel();\n    }\n    this.requestPool_.clear();\n  }\n};\n\n\n/**\n * @return {boolean} Whether there are any pending requests.\n */\nForwardChannelRequestPool.prototype.hasPendingRequest = function() {\n  return (this.request_ != null) ||\n      (this.requestPool_ != null && this.requestPool_.size !== 0);\n};\n\n\n/**\n * @return {!Array<Wire.QueuedMap>} All the pending messages from the pool,\n *     as a new array.\n */\nForwardChannelRequestPool.prototype.getPendingMessages = function() {\n  if (this.request_ != null) {\n    return this.pendingMessages_.concat(this.request_.getPendingMessages());\n  }\n\n  if (this.requestPool_ != null && this.requestPool_.size !== 0) {\n    let result = this.pendingMessages_;\n    for (const val of this.requestPool_.values()) {\n      result = result.concat(val.getPendingMessages());\n    }\n    return result;\n  }\n\n  return array.clone(this.pendingMessages_);\n};\n\n\n/**\n * Records pending messages, e.g. when a request receives a failed response.\n *\n * @param {!Array<Wire.QueuedMap>} messages Pending messages.\n */\nForwardChannelRequestPool.prototype.addPendingMessages = function(messages) {\n  this.pendingMessages_ = this.pendingMessages_.concat(messages);\n};\n\n\n/**\n * Clears any recorded pending messages.\n */\nForwardChannelRequestPool.prototype.clearPendingMessages = function() {\n  this.pendingMessages_.length = 0;\n};\n\n\n/**\n * Cancels all pending requests and force the completion of channel requests.\n *\n * Need go through the standard onRequestComplete logic to expose the max-retry\n * failure in the standard way.\n *\n * @param {function(!ChannelRequest)} onComplete The completion callback.\n * @return {boolean} true if any request has been forced to complete.\n */\nForwardChannelRequestPool.prototype.forceComplete = function(onComplete) {\n  if (this.request_ != null) {\n    this.request_.cancel();\n    onComplete(this.request_);\n    return true;\n  }\n\n  if (this.requestPool_ && this.requestPool_.size !== 0) {\n    for (const val of this.requestPool_.values()) {\n      val.cancel();\n      onComplete(val);\n    }\n    return true;\n  }\n\n  return false;\n};\n\nexports = ForwardChannelRequestPool;\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Generics method for collection-like classes and objects.\n *\n *\n * This file contains functions to work with collections. It supports using\n * Map, Set, Array and Object and other classes that implement collection-like\n * methods.\n * @suppress {strictMissingProperties}\n */\n\n\ngoog.provide('goog.structs');\n\ngoog.require('goog.array');\ngoog.require('goog.object');\n\n\n// We treat an object as a dictionary if it has getKeys or it is an object that\n// isn't arrayLike.\n\n\n/**\n * Returns the number of values in the collection-like object.\n * @param {Object} col The collection-like object.\n * @return {number} The number of values in the collection-like object.\n */\ngoog.structs.getCount = function(col) {\n  'use strict';\n  if (col.getCount && typeof col.getCount == 'function') {\n    return col.getCount();\n  }\n  if (goog.isArrayLike(col) || typeof col === 'string') {\n    return col.length;\n  }\n  return goog.object.getCount(col);\n};\n\n\n/**\n * Returns the values of the collection-like object.\n * @param {Object} col The collection-like object.\n * @return {!Array<?>} The values in the collection-like object.\n */\ngoog.structs.getValues = function(col) {\n  'use strict';\n  if (col.getValues && typeof col.getValues == 'function') {\n    return col.getValues();\n  }\n  // ES6 Map and Set both define a values function that returns an iterator.\n  // The typeof check allows the compiler to remove the Map and Set polyfills\n  // if they are otherwise unused throughout the entire binary.\n  if ((typeof Map !== 'undefined' && col instanceof Map) ||\n      (typeof Set !== 'undefined' && col instanceof Set)) {\n    return Array.from(col.values());\n  }\n  if (typeof col === 'string') {\n    return col.split('');\n  }\n  if (goog.isArrayLike(col)) {\n    var rv = [];\n    var l = col.length;\n    for (var i = 0; i < l; i++) {\n      rv.push(col[i]);\n    }\n    return rv;\n  }\n  return goog.object.getValues(col);\n};\n\n\n/**\n * Returns the keys of the collection. Some collections have no notion of\n * keys/indexes and this function will return undefined in those cases.\n * @param {Object} col The collection-like object.\n * @return {!Array|undefined} The keys in the collection.\n */\ngoog.structs.getKeys = function(col) {\n  'use strict';\n  if (col.getKeys && typeof col.getKeys == 'function') {\n    return col.getKeys();\n  }\n  // if we have getValues but no getKeys we know this is a key-less collection\n  if (col.getValues && typeof col.getValues == 'function') {\n    return undefined;\n  }\n  // ES6 Map and Set both define a keys function that returns an iterator. For\n  // Sets this iterates over the same values as the values iterator.\n  // The typeof check allows the compiler to remove the Map and Set polyfills\n  // if they are otherwise unused throughout the entire binary.\n  if (typeof Map !== 'undefined' && col instanceof Map) {\n    return Array.from(col.keys());\n  }\n  // Unlike the native Set, goog.structs.Set does not expose keys as the values.\n  if (typeof Set !== 'undefined' && col instanceof Set) {\n    return undefined;\n  }\n  if (goog.isArrayLike(col) || typeof col === 'string') {\n    var rv = [];\n    var l = col.length;\n    for (var i = 0; i < l; i++) {\n      rv.push(i);\n    }\n    return rv;\n  }\n\n  return goog.object.getKeys(col);\n};\n\n\n/**\n * Whether the collection contains the given value. This is O(n) and uses\n * equals (==) to test the existence.\n * @param {Object} col The collection-like object.\n * @param {*} val The value to check for.\n * @return {boolean} True if the map contains the value.\n */\ngoog.structs.contains = function(col, val) {\n  'use strict';\n  if (col.contains && typeof col.contains == 'function') {\n    return col.contains(val);\n  }\n  if (col.containsValue && typeof col.containsValue == 'function') {\n    return col.containsValue(val);\n  }\n  if (goog.isArrayLike(col) || typeof col === 'string') {\n    return goog.array.contains(/** @type {!Array<?>} */ (col), val);\n  }\n  return goog.object.containsValue(col, val);\n};\n\n\n/**\n * Whether the collection is empty.\n * @param {Object} col The collection-like object.\n * @return {boolean} True if empty.\n */\ngoog.structs.isEmpty = function(col) {\n  'use strict';\n  if (col.isEmpty && typeof col.isEmpty == 'function') {\n    return col.isEmpty();\n  }\n\n  // We do not use goog.string.isEmptyOrWhitespace because here we treat the\n  // string as\n  // collection and as such even whitespace matters\n\n  if (goog.isArrayLike(col) || typeof col === 'string') {\n    return /** @type {!Array<?>} */ (col).length === 0;\n  }\n  return goog.object.isEmpty(col);\n};\n\n\n/**\n * Removes all the elements from the collection.\n * @param {Object} col The collection-like object.\n * @return {void}\n */\ngoog.structs.clear = function(col) {\n  'use strict';\n  // NOTE(arv): This should not contain strings because strings are immutable\n  if (col.clear && typeof col.clear == 'function') {\n    col.clear();\n  } else if (goog.isArrayLike(col)) {\n    goog.array.clear(/** @type {IArrayLike<?>} */ (col));\n  } else {\n    goog.object.clear(col);\n  }\n};\n\n\n/**\n * Calls a function for each value in a collection. The function takes\n * three arguments; the value, the key and the collection.\n *\n * @param {S} col The collection-like object.\n * @param {function(this:T,?,?,S):?} f The function to call for every value.\n *     This function takes\n *     3 arguments (the value, the key or undefined if the collection has no\n *     notion of keys, and the collection) and the return value is irrelevant.\n * @param {T=} opt_obj The object to be used as the value of 'this'\n *     within `f`.\n * @return {void}\n * @template T,S\n * @deprecated Use a more specific method, e.g. native Array.prototype.forEach,\n *     or for-of.\n */\ngoog.structs.forEach = function(col, f, opt_obj) {\n  'use strict';\n  if (col.forEach && typeof col.forEach == 'function') {\n    col.forEach(f, opt_obj);\n  } else if (goog.isArrayLike(col) || typeof col === 'string') {\n    Array.prototype.forEach.call(/** @type {!Array<?>} */ (col), f, opt_obj);\n  } else {\n    var keys = goog.structs.getKeys(col);\n    var values = goog.structs.getValues(col);\n    var l = values.length;\n    for (var i = 0; i < l; i++) {\n      f.call(/** @type {?} */ (opt_obj), values[i], keys && keys[i], col);\n    }\n  }\n};\n\n\n/**\n * Calls a function for every value in the collection. When a call returns true,\n * adds the value to a new collection (Array is returned by default).\n *\n * @param {S} col The collection-like object.\n * @param {function(this:T,?,?,S):boolean} f The function to call for every\n *     value. This function takes\n *     3 arguments (the value, the key or undefined if the collection has no\n *     notion of keys, and the collection) and should return a Boolean. If the\n *     return value is true the value is added to the result collection. If it\n *     is false the value is not included.\n * @param {T=} opt_obj The object to be used as the value of 'this'\n *     within `f`.\n * @return {!Object|!Array<?>} A new collection where the passed values are\n *     present. If col is a key-less collection an array is returned.  If col\n *     has keys and values a plain old JS object is returned.\n * @template T,S\n */\ngoog.structs.filter = function(col, f, opt_obj) {\n  'use strict';\n  if (typeof col.filter == 'function') {\n    return col.filter(f, opt_obj);\n  }\n  if (goog.isArrayLike(col) || typeof col === 'string') {\n    return Array.prototype.filter.call(\n        /** @type {!Array<?>} */ (col), f, opt_obj);\n  }\n\n  var rv;\n  var keys = goog.structs.getKeys(col);\n  var values = goog.structs.getValues(col);\n  var l = values.length;\n  if (keys) {\n    rv = {};\n    for (var i = 0; i < l; i++) {\n      if (f.call(/** @type {?} */ (opt_obj), values[i], keys[i], col)) {\n        rv[keys[i]] = values[i];\n      }\n    }\n  } else {\n    // We should not use Array#filter here since we want to make sure that\n    // the index is undefined as well as make sure that col is passed to the\n    // function.\n    rv = [];\n    for (var i = 0; i < l; i++) {\n      if (f.call(opt_obj, values[i], undefined, col)) {\n        rv.push(values[i]);\n      }\n    }\n  }\n  return rv;\n};\n\n\n/**\n * Calls a function for every value in the collection and adds the result into a\n * new collection (defaults to creating a new Array).\n *\n * @param {S} col The collection-like object.\n * @param {function(this:T,?,?,S):V} f The function to call for every value.\n *     This function takes 3 arguments (the value, the key or undefined if the\n *     collection has no notion of keys, and the collection) and should return\n *     something. The result will be used as the value in the new collection.\n * @param {T=} opt_obj  The object to be used as the value of 'this'\n *     within `f`.\n * @return {!Object<V>|!Array<V>} A new collection with the new values.  If\n *     col is a key-less collection an array is returned.  If col has keys and\n *     values a plain old JS object is returned.\n * @template T,S,V\n */\ngoog.structs.map = function(col, f, opt_obj) {\n  'use strict';\n  if (typeof col.map == 'function') {\n    return col.map(f, opt_obj);\n  }\n  if (goog.isArrayLike(col) || typeof col === 'string') {\n    return Array.prototype.map.call(/** @type {!Array<?>} */ (col), f, opt_obj);\n  }\n\n  var rv;\n  var keys = goog.structs.getKeys(col);\n  var values = goog.structs.getValues(col);\n  var l = values.length;\n  if (keys) {\n    rv = {};\n    for (var i = 0; i < l; i++) {\n      rv[keys[i]] = f.call(/** @type {?} */ (opt_obj), values[i], keys[i], col);\n    }\n  } else {\n    // We should not use Array#map here since we want to make sure that\n    // the index is undefined as well as make sure that col is passed to the\n    // function.\n    rv = [];\n    for (var i = 0; i < l; i++) {\n      rv[i] = f.call(/** @type {?} */ (opt_obj), values[i], undefined, col);\n    }\n  }\n  return rv;\n};\n\n\n/**\n * Calls f for each value in a collection. If any call returns true this returns\n * true (without checking the rest). If all returns false this returns false.\n *\n * @param {S} col The collection-like object.\n * @param {function(this:T,?,?,S):boolean} f The function to call for every\n *     value. This function takes 3 arguments (the value, the key or undefined\n *     if the collection has no notion of keys, and the collection) and should\n *     return a boolean.\n * @param {T=} opt_obj  The object to be used as the value of 'this'\n *     within `f`.\n * @return {boolean} True if any value passes the test.\n * @template T,S\n */\ngoog.structs.some = function(col, f, opt_obj) {\n  'use strict';\n  if (typeof col.some == 'function') {\n    return col.some(f, opt_obj);\n  }\n  if (goog.isArrayLike(col) || typeof col === 'string') {\n    return Array.prototype.some.call(\n        /** @type {!Array<?>} */ (col), f, opt_obj);\n  }\n  var keys = goog.structs.getKeys(col);\n  var values = goog.structs.getValues(col);\n  var l = values.length;\n  for (var i = 0; i < l; i++) {\n    if (f.call(/** @type {?} */ (opt_obj), values[i], keys && keys[i], col)) {\n      return true;\n    }\n  }\n  return false;\n};\n\n\n/**\n * Calls f for each value in a collection. If all calls return true this return\n * true this returns true. If any returns false this returns false at this point\n *  and does not continue to check the remaining values.\n *\n * @param {S} col The collection-like object.\n * @param {function(this:T,?,?,S):boolean} f The function to call for every\n *     value. This function takes 3 arguments (the value, the key or\n *     undefined if the collection has no notion of keys, and the collection)\n *     and should return a boolean.\n * @param {T=} opt_obj  The object to be used as the value of 'this'\n *     within `f`.\n * @return {boolean} True if all key-value pairs pass the test.\n * @template T,S\n */\ngoog.structs.every = function(col, f, opt_obj) {\n  'use strict';\n  if (typeof col.every == 'function') {\n    return col.every(f, opt_obj);\n  }\n  if (goog.isArrayLike(col) || typeof col === 'string') {\n    return Array.prototype.every.call(\n        /** @type {!Array<?>} */ (col), f, opt_obj);\n  }\n  var keys = goog.structs.getKeys(col);\n  var values = goog.structs.getValues(col);\n  var l = values.length;\n  for (var i = 0; i < l; i++) {\n    if (!f.call(/** @type {?} */ (opt_obj), values[i], keys && keys[i], col)) {\n      return false;\n    }\n  }\n  return true;\n};\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Simple utilities for dealing with URI strings.\n *\n * This package is deprecated in favour of the Closure URL package (goog.url)\n * when manipulating URIs for use by a browser. This package uses regular\n * expressions to parse a potential URI which can fall out of sync with how a\n * browser will actually interpret the URI. See\n * `goog.uri.utils.setUrlPackageSupportLoggingHandler` for one way to identify\n * URIs that should instead be parsed using the URL package.\n *\n * This is intended to be a lightweight alternative to constructing goog.Uri\n * objects.  Whereas goog.Uri adds several kilobytes to the binary regardless\n * of how much of its functionality you use, this is designed to be a set of\n * mostly-independent utilities so that the compiler includes only what is\n * necessary for the task.  Estimated savings of porting is 5k pre-gzip and\n * 1.5k post-gzip.  To ensure the savings remain, future developers should\n * avoid adding new functionality to existing functions, but instead create\n * new ones and factor out shared code.\n *\n * Many of these utilities have limited functionality, tailored to common\n * cases.  The query parameter utilities assume that the parameter keys are\n * already encoded, since most keys are compile-time alphanumeric strings.  The\n * query parameter mutation utilities also do not tolerate fragment identifiers.\n *\n * By design, these functions can be slower than goog.Uri equivalents.\n * Repeated calls to some of functions may be quadratic in behavior for IE,\n * although the effect is somewhat limited given the 2kb limit.\n *\n * One advantage of the limited functionality here is that this approach is\n * less sensitive to differences in URI encodings than goog.Uri, since these\n * functions operate on strings directly, rather than decoding them and\n * then re-encoding.\n *\n * Uses features of RFC 3986 for parsing/formatting URIs:\n *   http://www.ietf.org/rfc/rfc3986.txt\n */\n\ngoog.provide('goog.uri.utils');\ngoog.provide('goog.uri.utils.ComponentIndex');\ngoog.provide('goog.uri.utils.QueryArray');\ngoog.provide('goog.uri.utils.QueryValue');\ngoog.provide('goog.uri.utils.StandardQueryParam');\n\ngoog.require('goog.asserts');\ngoog.require('goog.string');\n\n\n/**\n * Character codes inlined to avoid object allocations due to charCode.\n * @enum {number}\n * @private\n */\ngoog.uri.utils.CharCode_ = {\n  AMPERSAND: 38,\n  EQUAL: 61,\n  HASH: 35,\n  QUESTION: 63\n};\n\n\n/**\n * Builds a URI string from already-encoded parts.\n *\n * No encoding is performed.  Any component may be omitted as either null or\n * undefined.\n *\n * @param {?string=} opt_scheme The scheme such as 'http'.\n * @param {?string=} opt_userInfo The user name before the '@'.\n * @param {?string=} opt_domain The domain such as 'www.google.com', already\n *     URI-encoded.\n * @param {(string|number|null)=} opt_port The port number.\n * @param {?string=} opt_path The path, already URI-encoded.  If it is not\n *     empty, it must begin with a slash.\n * @param {?string=} opt_queryData The URI-encoded query data.\n * @param {?string=} opt_fragment The URI-encoded fragment identifier.\n * @return {string} The fully combined URI.\n */\ngoog.uri.utils.buildFromEncodedParts = function(\n    opt_scheme, opt_userInfo, opt_domain, opt_port, opt_path, opt_queryData,\n    opt_fragment) {\n  'use strict';\n  var out = '';\n\n  if (opt_scheme) {\n    out += opt_scheme + ':';\n  }\n\n  if (opt_domain) {\n    out += '//';\n\n    if (opt_userInfo) {\n      out += opt_userInfo + '@';\n    }\n\n    out += opt_domain;\n\n    if (opt_port) {\n      out += ':' + opt_port;\n    }\n  }\n\n  if (opt_path) {\n    out += opt_path;\n  }\n\n  if (opt_queryData) {\n    out += '?' + opt_queryData;\n  }\n\n  if (opt_fragment) {\n    out += '#' + opt_fragment;\n  }\n\n  return out;\n};\n\n\n/**\n * A regular expression for breaking a URI into its component parts.\n *\n * {@link http://www.ietf.org/rfc/rfc3986.txt} says in Appendix B\n * As the \"first-match-wins\" algorithm is identical to the \"greedy\"\n * disambiguation method used by POSIX regular expressions, it is natural and\n * commonplace to use a regular expression for parsing the potential five\n * components of a URI reference.\n *\n * The following line is the regular expression for breaking-down a\n * well-formed URI reference into its components.\n *\n * <pre>\n * ^(([^:/?#]+):)?(//([^/?#]*))?([^?#]*)(\\?([^#]*))?(#(.*))?\n *  12            3  4          5       6  7        8 9\n * </pre>\n *\n * The numbers in the second line above are only to assist readability; they\n * indicate the reference points for each subexpression (i.e., each paired\n * parenthesis). We refer to the value matched for subexpression <n> as $<n>.\n * For example, matching the above expression to\n * <pre>\n *     http://www.ics.uci.edu/pub/ietf/uri/#Related\n * </pre>\n * results in the following subexpression matches:\n * <pre>\n *    $1 = http:\n *    $2 = http\n *    $3 = //www.ics.uci.edu\n *    $4 = www.ics.uci.edu\n *    $5 = /pub/ietf/uri/\n *    $6 = <undefined>\n *    $7 = <undefined>\n *    $8 = #Related\n *    $9 = Related\n * </pre>\n * where <undefined> indicates that the component is not present, as is the\n * case for the query component in the above example. Therefore, we can\n * determine the value of the five components as\n * <pre>\n *    scheme    = $2\n *    authority = $4\n *    path      = $5\n *    query     = $7\n *    fragment  = $9\n * </pre>\n *\n * The regular expression has been modified slightly to expose the\n * userInfo, domain, and port separately from the authority.\n * The modified version yields\n * <pre>\n *    $1 = http              scheme\n *    $2 = <undefined>       userInfo -\\\n *    $3 = www.ics.uci.edu   domain     | authority\n *    $4 = <undefined>       port     -/\n *    $5 = /pub/ietf/uri/    path\n *    $6 = <undefined>       query without ?\n *    $7 = Related           fragment without #\n * </pre>\n *\n * TODO(user): separate out the authority terminating characters once this\n * file is moved to ES6.\n * @type {!RegExp}\n * @private\n */\ngoog.uri.utils.splitRe_ = new RegExp(\n    '^' +  // Anchor against the entire string.\n    '(?:' +\n    '([^:/?#.]+)' +  // scheme - ignore special characters\n                     // used by other URL parts such as :,\n                     // ?, /, #, and .\n    ':)?' +\n    '(?://' +\n    '(?:([^\\\\\\\\/?#]*)@)?' +  // userInfo\n    '([^\\\\\\\\/?#]*?)' +       // domain\n    '(?::([0-9]+))?' +       // port\n    '(?=[\\\\\\\\/?#]|$)' +      // authority-terminating character.\n    ')?' +\n    '([^?#]+)?' +          // path\n    '(?:\\\\?([^#]*))?' +    // query\n    '(?:#([\\\\s\\\\S]*))?' +  // fragment. Can't use '.*' with 's' flag as Firefox\n                           // doesn't support the flag, and can't use an\n                           // \"everything set\" ([^]) as IE10 doesn't match any\n                           // characters with it.\n    '$');\n\n\n/**\n * The index of each URI component in the return value of goog.uri.utils.split.\n * @enum {number}\n */\ngoog.uri.utils.ComponentIndex = {\n  SCHEME: 1,\n  USER_INFO: 2,\n  DOMAIN: 3,\n  PORT: 4,\n  PATH: 5,\n  QUERY_DATA: 6,\n  FRAGMENT: 7\n};\n\n/**\n * @type {?function(string)}\n * @private\n */\ngoog.uri.utils.urlPackageSupportLoggingHandler_ = null;\n\n/**\n * @param {?function(string)} handler The handler function to call when a URI\n *     with a protocol that is better supported by the Closure URL package is\n *     detected.\n */\ngoog.uri.utils.setUrlPackageSupportLoggingHandler = function(handler) {\n  'use strict';\n  goog.uri.utils.urlPackageSupportLoggingHandler_ = handler;\n};\n\n/**\n * Splits a URI into its component parts.\n *\n * Each component can be accessed via the component indices; for example:\n * <pre>\n * goog.uri.utils.split(someStr)[goog.uri.utils.ComponentIndex.QUERY_DATA];\n * </pre>\n *\n * @param {string} uri The URI string to examine.\n * @return {!Array<string|undefined>} Each component still URI-encoded.\n *     Each component that is present will contain the encoded value, whereas\n *     components that are not present will be undefined or empty, depending\n *     on the browser's regular expression implementation.  Never null, since\n *     arbitrary strings may still look like path names.\n */\ngoog.uri.utils.split = function(uri) {\n  'use strict';\n  // See @return comment -- never null.\n  var result = /** @type {!Array<string|undefined>} */ (\n      uri.match(goog.uri.utils.splitRe_));\n  if (goog.uri.utils.urlPackageSupportLoggingHandler_ &&\n      ['http', 'https', 'ws', 'wss',\n       'ftp'].indexOf(result[goog.uri.utils.ComponentIndex.SCHEME]) >= 0) {\n    goog.uri.utils.urlPackageSupportLoggingHandler_(uri);\n  }\n  return result;\n};\n\n\n/**\n * @param {?string} uri A possibly null string.\n * @param {boolean=} opt_preserveReserved If true, percent-encoding of RFC-3986\n *     reserved characters will not be removed.\n * @return {?string} The string URI-decoded, or null if uri is null.\n * @private\n */\ngoog.uri.utils.decodeIfPossible_ = function(uri, opt_preserveReserved) {\n  'use strict';\n  if (!uri) {\n    return uri;\n  }\n\n  return opt_preserveReserved ? decodeURI(uri) : decodeURIComponent(uri);\n};\n\n\n/**\n * Gets a URI component by index.\n *\n * It is preferred to use the getPathEncoded() variety of functions ahead,\n * since they are more readable.\n *\n * @param {goog.uri.utils.ComponentIndex} componentIndex The component index.\n * @param {string} uri The URI to examine.\n * @return {?string} The still-encoded component, or null if the component\n *     is not present.\n * @private\n */\ngoog.uri.utils.getComponentByIndex_ = function(componentIndex, uri) {\n  'use strict';\n  // Convert undefined, null, and empty string into null.\n  return goog.uri.utils.split(uri)[componentIndex] || null;\n};\n\n\n/**\n * @param {string} uri The URI to examine.\n * @return {?string} The protocol or scheme, or null if none.  Does not\n *     include trailing colons or slashes.\n */\ngoog.uri.utils.getScheme = function(uri) {\n  'use strict';\n  return goog.uri.utils.getComponentByIndex_(\n      goog.uri.utils.ComponentIndex.SCHEME, uri);\n};\n\n\n/**\n * Gets the effective scheme for the URL.  If the URL is relative then the\n * scheme is derived from the page's location.\n * @param {string} uri The URI to examine.\n * @return {string} The protocol or scheme, always lower case.\n */\ngoog.uri.utils.getEffectiveScheme = function(uri) {\n  'use strict';\n  var scheme = goog.uri.utils.getScheme(uri);\n  if (!scheme && goog.global.self && goog.global.self.location) {\n    var protocol = goog.global.self.location.protocol;\n    scheme = protocol.substr(0, protocol.length - 1);\n  }\n  // NOTE: When called from a web worker in Firefox 3.5, location may be null.\n  // All other browsers with web workers support self.location from the worker.\n  return scheme ? scheme.toLowerCase() : '';\n};\n\n\n/**\n * @param {string} uri The URI to examine.\n * @return {?string} The user name still encoded, or null if none.\n */\ngoog.uri.utils.getUserInfoEncoded = function(uri) {\n  'use strict';\n  return goog.uri.utils.getComponentByIndex_(\n      goog.uri.utils.ComponentIndex.USER_INFO, uri);\n};\n\n\n/**\n * @param {string} uri The URI to examine.\n * @return {?string} The decoded user info, or null if none.\n */\ngoog.uri.utils.getUserInfo = function(uri) {\n  'use strict';\n  return goog.uri.utils.decodeIfPossible_(\n      goog.uri.utils.getUserInfoEncoded(uri));\n};\n\n\n/**\n * @param {string} uri The URI to examine.\n * @return {?string} The domain name still encoded, or null if none.\n */\ngoog.uri.utils.getDomainEncoded = function(uri) {\n  'use strict';\n  return goog.uri.utils.getComponentByIndex_(\n      goog.uri.utils.ComponentIndex.DOMAIN, uri);\n};\n\n\n/**\n * @param {string} uri The URI to examine.\n * @return {?string} The decoded domain, or null if none.\n */\ngoog.uri.utils.getDomain = function(uri) {\n  'use strict';\n  return goog.uri.utils.decodeIfPossible_(\n      goog.uri.utils.getDomainEncoded(uri), true /* opt_preserveReserved */);\n};\n\n\n/**\n * @param {string} uri The URI to examine.\n * @return {?number} The port number, or null if none.\n */\ngoog.uri.utils.getPort = function(uri) {\n  'use strict';\n  // Coerce to a number.  If the result of getComponentByIndex_ is null or\n  // non-numeric, the number coersion yields NaN.  This will then return\n  // null for all non-numeric cases (though also zero, which isn't a relevant\n  // port number).\n  return Number(\n             goog.uri.utils.getComponentByIndex_(\n                 goog.uri.utils.ComponentIndex.PORT, uri)) ||\n      null;\n};\n\n\n/**\n * @param {string} uri The URI to examine.\n * @return {?string} The path still encoded, or null if none. Includes the\n *     leading slash, if any.\n */\ngoog.uri.utils.getPathEncoded = function(uri) {\n  'use strict';\n  return goog.uri.utils.getComponentByIndex_(\n      goog.uri.utils.ComponentIndex.PATH, uri);\n};\n\n\n/**\n * @param {string} uri The URI to examine.\n * @return {?string} The decoded path, or null if none.  Includes the leading\n *     slash, if any.\n */\ngoog.uri.utils.getPath = function(uri) {\n  'use strict';\n  return goog.uri.utils.decodeIfPossible_(\n      goog.uri.utils.getPathEncoded(uri), true /* opt_preserveReserved */);\n};\n\n\n/**\n * @param {string} uri The URI to examine.\n * @return {?string} The query data still encoded, or null if none.  Does not\n *     include the question mark itself.\n */\ngoog.uri.utils.getQueryData = function(uri) {\n  'use strict';\n  return goog.uri.utils.getComponentByIndex_(\n      goog.uri.utils.ComponentIndex.QUERY_DATA, uri);\n};\n\n\n/**\n * @param {string} uri The URI to examine.\n * @return {?string} The fragment identifier, or null if none.  Does not\n *     include the hash mark itself.\n */\ngoog.uri.utils.getFragmentEncoded = function(uri) {\n  'use strict';\n  // The hash mark may not appear in any other part of the URL.\n  var hashIndex = uri.indexOf('#');\n  return hashIndex < 0 ? null : uri.substr(hashIndex + 1);\n};\n\n\n/**\n * @param {string} uri The URI to examine.\n * @param {?string} fragment The encoded fragment identifier, or null if none.\n *     Does not include the hash mark itself.\n * @return {string} The URI with the fragment set.\n */\ngoog.uri.utils.setFragmentEncoded = function(uri, fragment) {\n  'use strict';\n  return goog.uri.utils.removeFragment(uri) + (fragment ? '#' + fragment : '');\n};\n\n\n/**\n * @param {string} uri The URI to examine.\n * @return {?string} The decoded fragment identifier, or null if none.  Does\n *     not include the hash mark.\n */\ngoog.uri.utils.getFragment = function(uri) {\n  'use strict';\n  return goog.uri.utils.decodeIfPossible_(\n      goog.uri.utils.getFragmentEncoded(uri));\n};\n\n\n/**\n * Extracts everything up to the port of the URI.\n * @param {string} uri The URI string.\n * @return {string} Everything up to and including the port.\n */\ngoog.uri.utils.getHost = function(uri) {\n  'use strict';\n  var pieces = goog.uri.utils.split(uri);\n  return goog.uri.utils.buildFromEncodedParts(\n      pieces[goog.uri.utils.ComponentIndex.SCHEME],\n      pieces[goog.uri.utils.ComponentIndex.USER_INFO],\n      pieces[goog.uri.utils.ComponentIndex.DOMAIN],\n      pieces[goog.uri.utils.ComponentIndex.PORT]);\n};\n\n\n/**\n * Returns the origin for a given URL.\n * @param {string} uri The URI string.\n * @return {string} Everything up to and including the port.\n */\ngoog.uri.utils.getOrigin = function(uri) {\n  'use strict';\n  var pieces = goog.uri.utils.split(uri);\n  return goog.uri.utils.buildFromEncodedParts(\n      pieces[goog.uri.utils.ComponentIndex.SCHEME], null /* opt_userInfo */,\n      pieces[goog.uri.utils.ComponentIndex.DOMAIN],\n      pieces[goog.uri.utils.ComponentIndex.PORT]);\n};\n\n\n/**\n * Extracts the path of the URL and everything after.\n * @param {string} uri The URI string.\n * @return {string} The URI, starting at the path and including the query\n *     parameters and fragment identifier.\n */\ngoog.uri.utils.getPathAndAfter = function(uri) {\n  'use strict';\n  var pieces = goog.uri.utils.split(uri);\n  return goog.uri.utils.buildFromEncodedParts(\n      null, null, null, null, pieces[goog.uri.utils.ComponentIndex.PATH],\n      pieces[goog.uri.utils.ComponentIndex.QUERY_DATA],\n      pieces[goog.uri.utils.ComponentIndex.FRAGMENT]);\n};\n\n\n/**\n * Gets the URI with the fragment identifier removed.\n * @param {string} uri The URI to examine.\n * @return {string} Everything preceding the hash mark.\n */\ngoog.uri.utils.removeFragment = function(uri) {\n  'use strict';\n  // The hash mark may not appear in any other part of the URL.\n  var hashIndex = uri.indexOf('#');\n  return hashIndex < 0 ? uri : uri.substr(0, hashIndex);\n};\n\n\n/**\n * Ensures that two URI's have the exact same domain, scheme, and port.\n *\n * Unlike the version in goog.Uri, this checks protocol, and therefore is\n * suitable for checking against the browser's same-origin policy.\n *\n * @param {string} uri1 The first URI.\n * @param {string} uri2 The second URI.\n * @return {boolean} Whether they have the same scheme, domain and port.\n */\ngoog.uri.utils.haveSameDomain = function(uri1, uri2) {\n  'use strict';\n  var pieces1 = goog.uri.utils.split(uri1);\n  var pieces2 = goog.uri.utils.split(uri2);\n  return pieces1[goog.uri.utils.ComponentIndex.DOMAIN] ==\n      pieces2[goog.uri.utils.ComponentIndex.DOMAIN] &&\n      pieces1[goog.uri.utils.ComponentIndex.SCHEME] ==\n      pieces2[goog.uri.utils.ComponentIndex.SCHEME] &&\n      pieces1[goog.uri.utils.ComponentIndex.PORT] ==\n      pieces2[goog.uri.utils.ComponentIndex.PORT];\n};\n\n\n/**\n * Asserts that there are no fragment or query identifiers, only in uncompiled\n * mode.\n * @param {string} uri The URI to examine.\n * @private\n */\ngoog.uri.utils.assertNoFragmentsOrQueries_ = function(uri) {\n  'use strict';\n  goog.asserts.assert(\n      uri.indexOf('#') < 0 && uri.indexOf('?') < 0,\n      'goog.uri.utils: Fragment or query identifiers are not supported: [%s]',\n      uri);\n};\n\n\n/**\n * Supported query parameter values by the parameter serializing utilities.\n *\n * If a value is null or undefined, the key-value pair is skipped, as an easy\n * way to omit parameters conditionally.  Non-array parameters are converted\n * to a string and URI encoded.  Array values are expanded into multiple\n * &key=value pairs, with each element stringized and URI-encoded.\n *\n * @typedef {*}\n */\ngoog.uri.utils.QueryValue;\n\n\n/**\n * An array representing a set of query parameters with alternating keys\n * and values.\n *\n * Keys are assumed to be URI encoded already and live at even indices.  See\n * goog.uri.utils.QueryValue for details on how parameter values are encoded.\n *\n * Example:\n * <pre>\n * var data = [\n *   // Simple param: ?name=BobBarker\n *   'name', 'BobBarker',\n *   // Conditional param -- may be omitted entirely.\n *   'specialDietaryNeeds', hasDietaryNeeds() ? getDietaryNeeds() : null,\n *   // Multi-valued param: &house=LosAngeles&house=NewYork&house=null\n *   'house', ['LosAngeles', 'NewYork', null]\n * ];\n * </pre>\n *\n * @typedef {!Array<string|goog.uri.utils.QueryValue>}\n */\ngoog.uri.utils.QueryArray;\n\n\n/**\n * Parses encoded query parameters and calls callback function for every\n * parameter found in the string.\n *\n * Missing value of parameter (e.g. “…&key&…”) is treated as if the value was an\n * empty string.  Keys may be empty strings (e.g. “…&=value&…”) which also means\n * that “…&=&…” and “…&&…” will result in an empty key and value.\n *\n * @param {string} encodedQuery Encoded query string excluding question mark at\n *     the beginning.\n * @param {function(string, string)} callback Function called for every\n *     parameter found in query string.  The first argument (name) will not be\n *     urldecoded (so the function is consistent with buildQueryData), but the\n *     second will.  If the parameter has no value (i.e. “=” was not present)\n *     the second argument (value) will be an empty string.\n */\ngoog.uri.utils.parseQueryData = function(encodedQuery, callback) {\n  'use strict';\n  if (!encodedQuery) {\n    return;\n  }\n  var pairs = encodedQuery.split('&');\n  for (var i = 0; i < pairs.length; i++) {\n    var indexOfEquals = pairs[i].indexOf('=');\n    var name = null;\n    var value = null;\n    if (indexOfEquals >= 0) {\n      name = pairs[i].substring(0, indexOfEquals);\n      value = pairs[i].substring(indexOfEquals + 1);\n    } else {\n      name = pairs[i];\n    }\n    callback(name, value ? goog.string.urlDecode(value) : '');\n  }\n};\n\n\n/**\n * Split the URI into 3 parts where the [1] is the queryData without a leading\n * '?'. For example, the URI http://foo.com/bar?a=b#abc returns\n * ['http://foo.com/bar','a=b','#abc'].\n * @param {string} uri The URI to parse.\n * @return {!Array<string>} An array representation of uri of length 3 where the\n *     middle value is the queryData without a leading '?'.\n * @private\n */\ngoog.uri.utils.splitQueryData_ = function(uri) {\n  'use strict';\n  // Find the query data and hash.\n  var hashIndex = uri.indexOf('#');\n  if (hashIndex < 0) {\n    hashIndex = uri.length;\n  }\n  var questionIndex = uri.indexOf('?');\n  var queryData;\n  if (questionIndex < 0 || questionIndex > hashIndex) {\n    questionIndex = hashIndex;\n    queryData = '';\n  } else {\n    queryData = uri.substring(questionIndex + 1, hashIndex);\n  }\n  return [uri.substr(0, questionIndex), queryData, uri.substr(hashIndex)];\n};\n\n\n/**\n * Join an array created by splitQueryData_ back into a URI.\n * @param {!Array<string>} parts A URI in the form generated by splitQueryData_.\n * @return {string} The joined URI.\n * @private\n */\ngoog.uri.utils.joinQueryData_ = function(parts) {\n  'use strict';\n  return parts[0] + (parts[1] ? '?' + parts[1] : '') + parts[2];\n};\n\n\n/**\n * @param {string} queryData\n * @param {string} newData\n * @return {string}\n * @private\n */\ngoog.uri.utils.appendQueryData_ = function(queryData, newData) {\n  'use strict';\n  if (!newData) {\n    return queryData;\n  }\n  return queryData ? queryData + '&' + newData : newData;\n};\n\n\n/**\n * @param {string} uri\n * @param {string} queryData\n * @return {string}\n * @private\n */\ngoog.uri.utils.appendQueryDataToUri_ = function(uri, queryData) {\n  'use strict';\n  if (!queryData) {\n    return uri;\n  }\n  var parts = goog.uri.utils.splitQueryData_(uri);\n  parts[1] = goog.uri.utils.appendQueryData_(parts[1], queryData);\n  return goog.uri.utils.joinQueryData_(parts);\n};\n\n\n/**\n * Appends key=value pairs to an array, supporting multi-valued objects.\n * @param {*} key The key prefix.\n * @param {goog.uri.utils.QueryValue} value The value to serialize.\n * @param {!Array<string>} pairs The array to which the 'key=value' strings\n *     should be appended.\n * @private\n */\ngoog.uri.utils.appendKeyValuePairs_ = function(key, value, pairs) {\n  'use strict';\n  goog.asserts.assertString(key);\n  if (Array.isArray(value)) {\n    // Convince the compiler it's an array.\n    goog.asserts.assertArray(value);\n    for (var j = 0; j < value.length; j++) {\n      // Convert to string explicitly, to short circuit the null and array\n      // logic in this function -- this ensures that null and undefined get\n      // written as literal 'null' and 'undefined', and arrays don't get\n      // expanded out but instead encoded in the default way.\n      goog.uri.utils.appendKeyValuePairs_(key, String(value[j]), pairs);\n    }\n  } else if (value != null) {\n    // Skip a top-level null or undefined entirely.\n    pairs.push(\n        key +\n        // Check for empty string. Zero gets encoded into the url as literal\n        // strings.  For empty string, skip the equal sign, to be consistent\n        // with UriBuilder.java.\n        (value === '' ? '' : '=' + goog.string.urlEncode(value)));\n  }\n};\n\n\n/**\n * Builds a query data string from a sequence of alternating keys and values.\n * Currently generates \"&key&\" for empty args.\n *\n * @param {!IArrayLike<string|goog.uri.utils.QueryValue>} keysAndValues\n *     Alternating keys and values. See the QueryArray typedef.\n * @param {number=} opt_startIndex A start offset into the arary, defaults to 0.\n * @return {string} The encoded query string, in the form 'a=1&b=2'.\n */\ngoog.uri.utils.buildQueryData = function(keysAndValues, opt_startIndex) {\n  'use strict';\n  goog.asserts.assert(\n      Math.max(keysAndValues.length - (opt_startIndex || 0), 0) % 2 == 0,\n      'goog.uri.utils: Key/value lists must be even in length.');\n\n  var params = [];\n  for (var i = opt_startIndex || 0; i < keysAndValues.length; i += 2) {\n    var key = /** @type {string} */ (keysAndValues[i]);\n    goog.uri.utils.appendKeyValuePairs_(key, keysAndValues[i + 1], params);\n  }\n  return params.join('&');\n};\n\n\n/**\n * Builds a query data string from a map.\n * Currently generates \"&key&\" for empty args.\n *\n * @param {!Object<string, goog.uri.utils.QueryValue>} map An object where keys\n *     are URI-encoded parameter keys, and the values are arbitrary types\n *     or arrays. Keys with a null value are dropped.\n * @return {string} The encoded query string, in the form 'a=1&b=2'.\n */\ngoog.uri.utils.buildQueryDataFromMap = function(map) {\n  'use strict';\n  var params = [];\n  for (var key in map) {\n    goog.uri.utils.appendKeyValuePairs_(key, map[key], params);\n  }\n  return params.join('&');\n};\n\n\n/**\n * Appends URI parameters to an existing URI.\n *\n * The variable arguments may contain alternating keys and values.  Keys are\n * assumed to be already URI encoded.  The values should not be URI-encoded,\n * and will instead be encoded by this function.\n * <pre>\n * appendParams('http://www.foo.com?existing=true',\n *     'key1', 'value1',\n *     'key2', 'value?willBeEncoded',\n *     'key3', ['valueA', 'valueB', 'valueC'],\n *     'key4', null);\n * result: 'http://www.foo.com?existing=true&' +\n *     'key1=value1&' +\n *     'key2=value%3FwillBeEncoded&' +\n *     'key3=valueA&key3=valueB&key3=valueC'\n * </pre>\n *\n * A single call to this function will not exhibit quadratic behavior in IE,\n * whereas multiple repeated calls may, although the effect is limited by\n * fact that URL's generally can't exceed 2kb.\n *\n * @param {string} uri The original URI, which may already have query data.\n * @param {...(goog.uri.utils.QueryArray|goog.uri.utils.QueryValue)}\n * var_args\n *     An array or argument list conforming to goog.uri.utils.QueryArray.\n * @return {string} The URI with all query parameters added.\n */\ngoog.uri.utils.appendParams = function(uri, var_args) {\n  'use strict';\n  var queryData = arguments.length == 2 ?\n      goog.uri.utils.buildQueryData(arguments[1], 0) :\n      goog.uri.utils.buildQueryData(arguments, 1);\n  return goog.uri.utils.appendQueryDataToUri_(uri, queryData);\n};\n\n\n/**\n * Appends query parameters from a map.\n *\n * @param {string} uri The original URI, which may already have query data.\n * @param {!Object<goog.uri.utils.QueryValue>} map An object where keys are\n *     URI-encoded parameter keys, and the values are arbitrary types or arrays.\n *     Keys with a null value are dropped.\n * @return {string} The new parameters.\n */\ngoog.uri.utils.appendParamsFromMap = function(uri, map) {\n  'use strict';\n  var queryData = goog.uri.utils.buildQueryDataFromMap(map);\n  return goog.uri.utils.appendQueryDataToUri_(uri, queryData);\n};\n\n\n/**\n * Appends a single URI parameter.\n *\n * Repeated calls to this can exhibit quadratic behavior in IE6 due to the\n * way string append works, though it should be limited given the 2kb limit.\n *\n * @param {string} uri The original URI, which may already have query data.\n * @param {string} key The key, which must already be URI encoded.\n * @param {*=} opt_value The value, which will be stringized and encoded\n *     (assumed not already to be encoded).  If omitted, undefined, or null, the\n *     key will be added as a valueless parameter.\n * @return {string} The URI with the query parameter added.\n */\ngoog.uri.utils.appendParam = function(uri, key, opt_value) {\n  'use strict';\n  var value = (opt_value != null) ? '=' + goog.string.urlEncode(opt_value) : '';\n  return goog.uri.utils.appendQueryDataToUri_(uri, key + value);\n};\n\n\n/**\n * Finds the next instance of a query parameter with the specified name.\n *\n * Does not instantiate any objects.\n *\n * @param {string} uri The URI to search.  May contain a fragment identifier\n *     if opt_hashIndex is specified.\n * @param {number} startIndex The index to begin searching for the key at.  A\n *     match may be found even if this is one character after the ampersand.\n * @param {string} keyEncoded The URI-encoded key.\n * @param {number} hashOrEndIndex Index to stop looking at.  If a hash\n *     mark is present, it should be its index, otherwise it should be the\n *     length of the string.\n * @return {number} The position of the first character in the key's name,\n *     immediately after either a question mark or a dot.\n * @private\n */\ngoog.uri.utils.findParam_ = function(\n    uri, startIndex, keyEncoded, hashOrEndIndex) {\n  'use strict';\n  var index = startIndex;\n  var keyLength = keyEncoded.length;\n\n  // Search for the key itself and post-filter for surronuding punctuation,\n  // rather than expensively building a regexp.\n  while ((index = uri.indexOf(keyEncoded, index)) >= 0 &&\n         index < hashOrEndIndex) {\n    var precedingChar = uri.charCodeAt(index - 1);\n    // Ensure that the preceding character is '&' or '?'.\n    if (precedingChar == goog.uri.utils.CharCode_.AMPERSAND ||\n        precedingChar == goog.uri.utils.CharCode_.QUESTION) {\n      // Ensure the following character is '&', '=', '#', or NaN\n      // (end of string).\n      var followingChar = uri.charCodeAt(index + keyLength);\n      if (!followingChar || followingChar == goog.uri.utils.CharCode_.EQUAL ||\n          followingChar == goog.uri.utils.CharCode_.AMPERSAND ||\n          followingChar == goog.uri.utils.CharCode_.HASH) {\n        return index;\n      }\n    }\n    index += keyLength + 1;\n  }\n\n  return -1;\n};\n\n\n/**\n * Regular expression for finding a hash mark or end of string.\n * @type {RegExp}\n * @private\n */\ngoog.uri.utils.hashOrEndRe_ = /#|$/;\n\n\n/**\n * Determines if the URI contains a specific key.\n *\n * Performs no object instantiations.\n *\n * @param {string} uri The URI to process.  May contain a fragment\n *     identifier.\n * @param {string} keyEncoded The URI-encoded key.  Case-sensitive.\n * @return {boolean} Whether the key is present.\n */\ngoog.uri.utils.hasParam = function(uri, keyEncoded) {\n  'use strict';\n  return goog.uri.utils.findParam_(\n             uri, 0, keyEncoded, uri.search(goog.uri.utils.hashOrEndRe_)) >= 0;\n};\n\n\n/**\n * Gets the first value of a query parameter.\n * @param {string} uri The URI to process.  May contain a fragment.\n * @param {string} keyEncoded The URI-encoded key.  Case-sensitive.\n * @return {?string} The first value of the parameter (URI-decoded), or null\n *     if the parameter is not found.\n */\ngoog.uri.utils.getParamValue = function(uri, keyEncoded) {\n  'use strict';\n  var hashOrEndIndex = uri.search(goog.uri.utils.hashOrEndRe_);\n  var foundIndex =\n      goog.uri.utils.findParam_(uri, 0, keyEncoded, hashOrEndIndex);\n\n  if (foundIndex < 0) {\n    return null;\n  } else {\n    var endPosition = uri.indexOf('&', foundIndex);\n    if (endPosition < 0 || endPosition > hashOrEndIndex) {\n      endPosition = hashOrEndIndex;\n    }\n    // Progress forth to the end of the \"key=\" or \"key&\" substring.\n    foundIndex += keyEncoded.length + 1;\n    // Use substr, because it (unlike substring) will return empty string\n    // if foundIndex > endPosition.\n    return goog.string.urlDecode(\n        uri.substr(foundIndex, endPosition - foundIndex));\n  }\n};\n\n\n/**\n * Gets all values of a query parameter.\n * @param {string} uri The URI to process.  May contain a fragment.\n * @param {string} keyEncoded The URI-encoded key.  Case-sensitive.\n * @return {!Array<string>} All URI-decoded values with the given key.\n *     If the key is not found, this will have length 0, but never be null.\n */\ngoog.uri.utils.getParamValues = function(uri, keyEncoded) {\n  'use strict';\n  var hashOrEndIndex = uri.search(goog.uri.utils.hashOrEndRe_);\n  var position = 0;\n  var foundIndex;\n  var result = [];\n\n  while ((foundIndex = goog.uri.utils.findParam_(\n              uri, position, keyEncoded, hashOrEndIndex)) >= 0) {\n    // Find where this parameter ends, either the '&' or the end of the\n    // query parameters.\n    position = uri.indexOf('&', foundIndex);\n    if (position < 0 || position > hashOrEndIndex) {\n      position = hashOrEndIndex;\n    }\n\n    // Progress forth to the end of the \"key=\" or \"key&\" substring.\n    foundIndex += keyEncoded.length + 1;\n    // Use substr, because it (unlike substring) will return empty string\n    // if foundIndex > position.\n    result.push(\n        goog.string.urlDecode(uri.substr(foundIndex, position - foundIndex)));\n  }\n\n  return result;\n};\n\n\n/**\n * Regexp to find trailing question marks and ampersands.\n * @type {RegExp}\n * @private\n */\ngoog.uri.utils.trailingQueryPunctuationRe_ = /[?&]($|#)/;\n\n\n/**\n * Removes all instances of a query parameter.\n * @param {string} uri The URI to process.  Must not contain a fragment.\n * @param {string} keyEncoded The URI-encoded key.\n * @return {string} The URI with all instances of the parameter removed.\n */\ngoog.uri.utils.removeParam = function(uri, keyEncoded) {\n  'use strict';\n  var hashOrEndIndex = uri.search(goog.uri.utils.hashOrEndRe_);\n  var position = 0;\n  var foundIndex;\n  var buffer = [];\n\n  // Look for a query parameter.\n  while ((foundIndex = goog.uri.utils.findParam_(\n              uri, position, keyEncoded, hashOrEndIndex)) >= 0) {\n    // Get the portion of the query string up to, but not including, the ?\n    // or & starting the parameter.\n    buffer.push(uri.substring(position, foundIndex));\n    // Progress to immediately after the '&'.  If not found, go to the end.\n    // Avoid including the hash mark.\n    position = Math.min(\n        (uri.indexOf('&', foundIndex) + 1) || hashOrEndIndex, hashOrEndIndex);\n  }\n\n  // Append everything that is remaining.\n  buffer.push(uri.substr(position));\n\n  // Join the buffer, and remove trailing punctuation that remains.\n  return buffer.join('').replace(\n      goog.uri.utils.trailingQueryPunctuationRe_, '$1');\n};\n\n\n/**\n * Replaces all existing definitions of a parameter with a single definition.\n *\n * Repeated calls to this can exhibit quadratic behavior due to the need to\n * find existing instances and reconstruct the string, though it should be\n * limited given the 2kb limit.  Consider using appendParams or setParamsFromMap\n * to update multiple parameters in bulk.\n *\n * @param {string} uri The original URI, which may already have query data.\n * @param {string} keyEncoded The key, which must already be URI encoded.\n * @param {*} value The value, which will be stringized and encoded (assumed\n *     not already to be encoded).\n * @return {string} The URI with the query parameter added.\n */\ngoog.uri.utils.setParam = function(uri, keyEncoded, value) {\n  'use strict';\n  return goog.uri.utils.appendParam(\n      goog.uri.utils.removeParam(uri, keyEncoded), keyEncoded, value);\n};\n\n\n/**\n * Effeciently set or remove multiple query parameters in a URI. Order of\n * unchanged parameters will not be modified, all updated parameters will be\n * appended to the end of the query. Params with values of null or undefined are\n * removed.\n *\n * @param {string} uri The URI to process.\n * @param {!Object<string, goog.uri.utils.QueryValue>} params A list of\n *     parameters to update. If null or undefined, the param will be removed.\n * @return {string} An updated URI where the query data has been updated with\n *     the params.\n */\ngoog.uri.utils.setParamsFromMap = function(uri, params) {\n  'use strict';\n  var parts = goog.uri.utils.splitQueryData_(uri);\n  var queryData = parts[1];\n  var buffer = [];\n  if (queryData) {\n    queryData.split('&').forEach(function(pair) {\n      'use strict';\n      var indexOfEquals = pair.indexOf('=');\n      var name = indexOfEquals >= 0 ? pair.substr(0, indexOfEquals) : pair;\n      if (!params.hasOwnProperty(name)) {\n        buffer.push(pair);\n      }\n    });\n  }\n  parts[1] = goog.uri.utils.appendQueryData_(\n      buffer.join('&'), goog.uri.utils.buildQueryDataFromMap(params));\n  return goog.uri.utils.joinQueryData_(parts);\n};\n\n\n/**\n * Generates a URI path using a given URI and a path with checks to\n * prevent consecutive \"//\". The baseUri passed in must not contain\n * query or fragment identifiers. The path to append may not contain query or\n * fragment identifiers.\n *\n * @param {string} baseUri URI to use as the base.\n * @param {string} path Path to append.\n * @return {string} Updated URI.\n */\ngoog.uri.utils.appendPath = function(baseUri, path) {\n  'use strict';\n  goog.uri.utils.assertNoFragmentsOrQueries_(baseUri);\n\n  // Remove any trailing '/'\n  if (goog.string.endsWith(baseUri, '/')) {\n    baseUri = baseUri.substr(0, baseUri.length - 1);\n  }\n  // Remove any leading '/'\n  if (goog.string.startsWith(path, '/')) {\n    path = path.substr(1);\n  }\n  return '' + baseUri + '/' + path;\n};\n\n\n/**\n * Replaces the path.\n * @param {string} uri URI to use as the base.\n * @param {string} path New path.\n * @return {string} Updated URI.\n */\ngoog.uri.utils.setPath = function(uri, path) {\n  'use strict';\n  // Add any missing '/'.\n  if (!goog.string.startsWith(path, '/')) {\n    path = '/' + path;\n  }\n  var parts = goog.uri.utils.split(uri);\n  return goog.uri.utils.buildFromEncodedParts(\n      parts[goog.uri.utils.ComponentIndex.SCHEME],\n      parts[goog.uri.utils.ComponentIndex.USER_INFO],\n      parts[goog.uri.utils.ComponentIndex.DOMAIN],\n      parts[goog.uri.utils.ComponentIndex.PORT], path,\n      parts[goog.uri.utils.ComponentIndex.QUERY_DATA],\n      parts[goog.uri.utils.ComponentIndex.FRAGMENT]);\n};\n\n\n/**\n * Standard supported query parameters.\n * @enum {string}\n */\ngoog.uri.utils.StandardQueryParam = {\n\n  /** Unused parameter for unique-ifying. */\n  RANDOM: 'zx'\n};\n\n\n/**\n * Sets the zx parameter of a URI to a random value.\n * @param {string} uri Any URI.\n * @return {string} That URI with the \"zx\" parameter added or replaced to\n *     contain a random string.\n */\ngoog.uri.utils.makeUnique = function(uri) {\n  'use strict';\n  return goog.uri.utils.setParam(\n      uri, goog.uri.utils.StandardQueryParam.RANDOM,\n      goog.string.getRandomString());\n};\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n\n/**\n * @fileoverview Defines a class for parsing JSON using the browser's built in\n * JSON library.\n */\n\ngoog.provide('goog.json.NativeJsonProcessor');\n\ngoog.require('goog.asserts');\ngoog.require('goog.json.Processor');\n\n\n\n/**\n * A class that parses and stringifies JSON using the browser's built-in JSON\n * library, if it is available.\n *\n * Note that the native JSON api has subtle differences across browsers, so\n * use this implementation with care.  See json_test#assertSerialize\n * for details on the differences from goog.json.\n *\n * This implementation is signficantly faster than goog.json, at least on\n * Chrome.  See json_perf.html for a perf test showing the difference.\n *\n * @param {?goog.json.Replacer=} opt_replacer An optional replacer to use during\n *     serialization.\n * @param {?goog.json.Reviver=} opt_reviver An optional reviver to use during\n *     parsing.\n * @constructor\n * @implements {goog.json.Processor}\n * @final\n */\ngoog.json.NativeJsonProcessor = function(opt_replacer, opt_reviver) {\n  'use strict';\n  goog.asserts.assert(goog.global['JSON'] !== undefined, 'JSON not defined');\n\n  /**\n   * @type {goog.json.Replacer|null|undefined}\n   * @private\n   */\n  this.replacer_ = opt_replacer;\n\n  /**\n   * @type {goog.json.Reviver|null|undefined}\n   * @private\n   */\n  this.reviver_ = opt_reviver;\n};\n\n\n/** @override */\ngoog.json.NativeJsonProcessor.prototype.stringify = function(object) {\n  'use strict';\n  return goog.global['JSON'].stringify(object, this.replacer_);\n};\n\n\n/** @override */\ngoog.json.NativeJsonProcessor.prototype.parse = function(s) {\n  'use strict';\n  return goog.global['JSON'].parse(s, this.reviver_);\n};\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Utility functions for managing networking, such as\n * testing network connectivity.\n *\n */\n\n\ngoog.provide('goog.labs.net.webChannel.netUtils');\n\ngoog.require('goog.Uri');\ngoog.require('goog.labs.net.webChannel.WebChannelDebug');\n\ngoog.scope(function() {\n'use strict';\nconst netUtils = goog.labs.net.webChannel.netUtils;\nconst WebChannelDebug = goog.labs.net.webChannel.WebChannelDebug;\n\n\n/**\n * Default timeout to allow for URI pings.\n * @type {number}\n */\nnetUtils.NETWORK_TIMEOUT = 10000;\n\n\n/**\n * Pings the network with an image URI to check if an error is a server error\n * or user's network error.\n *\n * The caller needs to add a 'rand' parameter to make sure the response is\n * not fulfilled by browser cache.\n *\n * @param {function(boolean)} callback The function to call back with results.\n * @param {goog.Uri=} opt_imageUri The URI (of an image) to use for the network\n *     test.\n */\nnetUtils.testNetwork = function(callback, opt_imageUri) {\n  'use strict';\n  let uri = opt_imageUri;\n  if (!uri) {\n    // default google.com image\n    uri = new goog.Uri('//www.google.com/images/cleardot.gif');\n\n    if (!(goog.global.location && goog.global.location.protocol == 'http')) {\n      uri.setScheme('https');  // e.g. chrome-extension\n    }\n    uri.makeUnique();\n  }\n\n  netUtils.testLoadImage(uri.toString(), netUtils.NETWORK_TIMEOUT, callback);\n};\n\n\n/**\n * Test loading the given image, retrying if necessary.\n * @param {string} url URL to the image.\n * @param {number} timeout Milliseconds before giving up.\n * @param {function(boolean)} callback Function to call with results.\n * @param {number} retries The number of times to retry.\n * @param {!WebChannelDebug} channelDebug The debug object\n * @param {number=} opt_pauseBetweenRetriesMS Optional number of milliseconds\n *     between retries - defaults to 0.\n */\nnetUtils.testLoadImageWithRetries = function(\n    url, timeout, callback, retries, channelDebug, opt_pauseBetweenRetriesMS) {\n  'use strict';\n  channelDebug.debug('TestLoadImageWithRetries: ' + opt_pauseBetweenRetriesMS);\n  if (retries == 0) {\n    // no more retries, give up\n    callback(false);\n    return;\n  }\n\n  const pauseBetweenRetries = opt_pauseBetweenRetriesMS || 0;\n  retries--;\n  netUtils.testLoadImage(url, timeout, function(succeeded) {\n    'use strict';\n    if (succeeded) {\n      callback(true);\n    } else {\n      // try again\n      goog.global.setTimeout(function() {\n        'use strict';\n        netUtils.testLoadImageWithRetries(\n            url, timeout, callback, retries, channelDebug, pauseBetweenRetries);\n      }, pauseBetweenRetries);\n    }\n  });\n};\n\n\n/**\n * Test loading the given image.\n * @param {string} url URL to the image.\n * @param {number} timeout Milliseconds before giving up.\n * @param {function(boolean)} callback Function to call with results.\n * @suppress {strictMissingProperties} Part of the go/strict_warnings_migration\n */\nnetUtils.testLoadImage = function(url, timeout, callback) {\n  'use strict';\n  const channelDebug = new WebChannelDebug();\n  channelDebug.debug('TestLoadImage: loading ' + url);\n  if (goog.global.Image) {\n    const img = new Image();\n    img.onload = goog.partial(\n        netUtils.imageCallback_, channelDebug, img, 'TestLoadImage: loaded',\n        true, callback);\n    img.onerror = goog.partial(\n        netUtils.imageCallback_, channelDebug, img, 'TestLoadImage: error',\n        false, callback);\n    img.onabort = goog.partial(\n        netUtils.imageCallback_, channelDebug, img, 'TestLoadImage: abort',\n        false, callback);\n    img.ontimeout = goog.partial(\n        netUtils.imageCallback_, channelDebug, img, 'TestLoadImage: timeout',\n        false, callback);\n\n    goog.global.setTimeout(function() {\n      'use strict';\n      if (img.ontimeout) {\n        img.ontimeout();\n      }\n    }, timeout);\n    img.src = url;\n  } else {\n    // log ERROR_OTHER from environements where Image is not supported\n    callback(false);\n  }\n};\n\n\n/**\n * Wrap the image callback with debug and cleanup logic.\n * @param {!WebChannelDebug} channelDebug The WebChannelDebug object.\n * @param {!Image} img The image element.\n * @param {string} debugText The debug text.\n * @param {boolean} result The result of image loading.\n * @param {function(boolean)} callback The image callback.\n * @private\n */\nnetUtils.imageCallback_ = function(\n    channelDebug, img, debugText, result, callback) {\n  'use strict';\n  try {\n    channelDebug.debug(debugText);\n    netUtils.clearImageCallbacks_(img);\n    callback(result);\n  } catch (e) {\n    channelDebug.dumpException(e);\n  }\n};\n\n\n/**\n * Clears handlers to avoid memory leaks.\n * @param {Image} img The image to clear handlers from.\n * @private\n * @suppress {strictMissingProperties} Part of the go/strict_warnings_migration\n */\nnetUtils.clearImageCallbacks_ = function(img) {\n  'use strict';\n  img.onload = null;\n  img.onerror = null;\n  img.onabort = null;\n  img.ontimeout = null;\n};\n});  // goog.scope\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\ngoog.provide('goog.net.FetchXmlHttp');\ngoog.provide('goog.net.FetchXmlHttpFactory');\n\ngoog.require('goog.asserts');\ngoog.require('goog.events.EventTarget');\ngoog.require('goog.functions');\ngoog.require('goog.log');\ngoog.require('goog.net.XhrLike');\ngoog.require('goog.net.XmlHttpFactory');\n\n\n\n/**\n * @record\n */\ngoog.net.FetchXmlHttpFactoryOptions = function() {\n  /**\n   * @type {!WorkerGlobalScope|undefined} The Service Worker global scope.\n   */\n  this.worker;\n\n  /**\n   * @type {boolean|undefined} Whether to store the FetchXmlHttp response as an\n   * array of Uint8Arrays.  If this is true then the 'responseType' attribute\n   * must be empty.\n   */\n  this.streamBinaryChunks;\n};\n\n\n\n/**\n * Factory for creating Xhr objects that uses the native fetch() method.\n * https://developer.mozilla.org/en-US/docs/Web/API/Fetch_API\n * @param {!goog.net.FetchXmlHttpFactoryOptions} opts\n * @extends {goog.net.XmlHttpFactory}\n * @struct\n * @constructor\n */\ngoog.net.FetchXmlHttpFactory = function(opts) {\n  'use strict';\n  goog.net.FetchXmlHttpFactory.base(this, 'constructor');\n\n  /** @private @final {?WorkerGlobalScope} */\n  this.worker_ = opts.worker || null;\n\n  /** @private @final {boolean} */\n  this.streamBinaryChunks_ = opts.streamBinaryChunks || false;\n\n  /** @private {!RequestCredentials|undefined} */\n  this.credentialsMode_ = undefined;\n\n  /** @private {!RequestCache|undefined} */\n  this.cacheMode_ = undefined;\n};\ngoog.inherits(goog.net.FetchXmlHttpFactory, goog.net.XmlHttpFactory);\n\n\n/** @override */\ngoog.net.FetchXmlHttpFactory.prototype.createInstance = function() {\n  'use strict';\n  const instance =\n      new goog.net.FetchXmlHttp(this.worker_, this.streamBinaryChunks_);\n  if (this.credentialsMode_) {\n    instance.setCredentialsMode(this.credentialsMode_);\n  }\n  if (this.cacheMode_) {\n    instance.setCacheMode(this.cacheMode_);\n  }\n  return instance;\n};\n\n\n/** @override */\ngoog.net.FetchXmlHttpFactory.prototype.internalGetOptions =\n    goog.functions.constant({});\n\n\n/**\n * @param {!RequestCredentials} credentialsMode The credentials mode of the\n *     Service Worker fetch.\n */\ngoog.net.FetchXmlHttpFactory.prototype.setCredentialsMode = function(\n    credentialsMode) {\n  'use strict';\n  this.credentialsMode_ = credentialsMode;\n};\n\n\n/**\n * @param {!RequestCache} cacheMode The cache mode of the Service Worker fetch.\n */\ngoog.net.FetchXmlHttpFactory.prototype.setCacheMode = function(cacheMode) {\n  'use strict';\n  this.cacheMode_ = cacheMode;\n};\n\n\n\n/**\n * FetchXmlHttp object constructor.\n * @param {?WorkerGlobalScope} worker\n * @param {boolean} streamBinaryChunks\n * @extends {goog.events.EventTarget}\n * @implements {goog.net.XhrLike}\n * @constructor\n * @struct\n */\ngoog.net.FetchXmlHttp = function(worker, streamBinaryChunks) {\n  'use strict';\n  goog.net.FetchXmlHttp.base(this, 'constructor');\n\n  /** @private @final {?WorkerGlobalScope} */\n  this.worker_ = worker;\n\n  /** @private @final {boolean} */\n  this.streamBinaryChunks_ = streamBinaryChunks;\n\n  /** @private {RequestCredentials|undefined} */\n  this.credentialsMode_ = undefined;\n\n  /** @private {RequestCache|undefined} */\n  this.cacheMode_ = undefined;\n\n  /**\n   * Request state.\n   * @type {goog.net.FetchXmlHttp.RequestState}\n   */\n  this.readyState = goog.net.FetchXmlHttp.RequestState.UNSENT;\n\n  /**\n   * HTTP status.\n   * @type {number}\n   */\n  this.status = 0;\n\n  /**\n   * HTTP status string.\n   * @type {string}\n   */\n  this.statusText = '';\n\n  /**\n   * Content of the response.\n   * @type {string|!ArrayBuffer|!Array<!Uint8Array>}\n   */\n  this.response = '';\n\n  /**\n   * Content of the response.\n   * @type {string}\n   */\n  this.responseText = '';\n\n  /**\n   * The type of the response.  If this is set to 'arraybuffer' the request will\n   * be discrete, streaming is only supported for text encoded requests.\n   * @type {string}\n   */\n  this.responseType = '';\n\n  /**\n   * Document response entity body.\n   * NOTE: This is always null and not supported by this class.\n   * @final {null}\n   */\n  this.responseXML = null;\n\n  /**\n   * Method to call when the state changes.\n   * @type {?function()}\n   */\n  this.onreadystatechange = null;\n\n  /** @private {!Headers} */\n  this.requestHeaders_ = new Headers();\n\n  /** @private {?Headers} */\n  this.responseHeaders_ = null;\n\n  /**\n   * Request method (GET or POST).\n   * @private {string}\n   */\n  this.method_ = 'GET';\n\n  /**\n   * Request URL.\n   * @private {string}\n   */\n  this.url_ = '';\n\n  /**\n   * Whether the request is in progress.\n   * @private {boolean}\n   */\n  this.inProgress_ = false;\n\n  /** @private @final {?goog.log.Logger} */\n  this.logger_ = goog.log.getLogger('goog.net.FetchXmlHttp');\n\n  /** @private {?Response} */\n  this.fetchResponse_ = null;\n\n  /** @private {!ReadableStreamDefaultReader|null} */\n  this.currentReader_ = null;\n\n  /** @private {?TextDecoder} */\n  this.textDecoder_ = null;\n};\ngoog.inherits(goog.net.FetchXmlHttp, goog.events.EventTarget);\n\n\n/**\n * State of the requests.\n * @enum {number}\n */\ngoog.net.FetchXmlHttp.RequestState = {\n  UNSENT: 0,\n  OPENED: 1,\n  HEADER_RECEIVED: 2,\n  LOADING: 3,\n  DONE: 4,\n};\n\n\n/** @override */\ngoog.net.FetchXmlHttp.prototype.open = function(method, url, opt_async) {\n  'use strict';\n  goog.asserts.assert(!!opt_async, 'Only async requests are supported.');\n  if (this.readyState != goog.net.FetchXmlHttp.RequestState.UNSENT) {\n    this.abort();\n    throw new Error('Error reopening a connection');\n  }\n\n  this.method_ = method;\n  this.url_ = url;\n\n  this.readyState = goog.net.FetchXmlHttp.RequestState.OPENED;\n  this.dispatchCallback_();\n};\n\n\n/** @override */\ngoog.net.FetchXmlHttp.prototype.send = function(opt_data) {\n  'use strict';\n  if (this.readyState != goog.net.FetchXmlHttp.RequestState.OPENED) {\n    this.abort();\n    throw new Error('need to call open() first. ');\n  }\n\n  this.inProgress_ = true;\n  const requestInit = {\n    headers: this.requestHeaders_,\n    method: this.method_,\n    credentials: this.credentialsMode_,\n    cache: this.cacheMode_,\n  };\n  if (opt_data) {\n    requestInit['body'] = opt_data;\n  }\n\n  (this.worker_ || goog.global)\n      .fetch(new Request(this.url_, /** @type {!RequestInit} */ (requestInit)))\n      .then(\n          this.handleResponse_.bind(this), this.handleSendFailure_.bind(this));\n};\n\n\n/** @override */\ngoog.net.FetchXmlHttp.prototype.abort = function() {\n  'use strict';\n  this.response = this.responseText = '';\n  this.requestHeaders_ = new Headers();\n  this.status = 0;\n\n  if (!!this.currentReader_) {\n    this.currentReader_.cancel('Request was aborted.')\n        .catch(\n            e => goog.log.warning(\n                this.logger_, 'Fetch reader cancellation error.', e));\n  }\n\n  if (((this.readyState >= goog.net.FetchXmlHttp.RequestState.OPENED) &&\n       this.inProgress_) &&\n      (this.readyState != goog.net.FetchXmlHttp.RequestState.DONE)) {\n    this.inProgress_ = false;\n    this.requestDone_();\n  }\n\n  this.readyState = goog.net.FetchXmlHttp.RequestState.UNSENT;\n};\n\n\n/**\n * Handles the fetch response.\n * @param {!Response} response\n * @private\n */\ngoog.net.FetchXmlHttp.prototype.handleResponse_ = function(response) {\n  'use strict';\n  if (!this.inProgress_) {\n    // The request was aborted, ignore.\n    return;\n  }\n\n  this.fetchResponse_ = response;\n\n  if (!this.responseHeaders_) {\n    this.status = this.fetchResponse_.status;\n    this.statusText = this.fetchResponse_.statusText;\n    this.responseHeaders_ = response.headers;\n    this.readyState = goog.net.FetchXmlHttp.RequestState.HEADER_RECEIVED;\n    this.dispatchCallback_();\n  }\n  // A callback may abort the request.\n  if (!this.inProgress_) {\n    // The request was aborted, ignore.\n    return;\n  }\n\n  this.readyState = goog.net.FetchXmlHttp.RequestState.LOADING;\n  this.dispatchCallback_();\n  // A callback may abort the request.\n  if (!this.inProgress_) {\n    // The request was aborted, ignore.\n    return;\n  }\n\n  if (this.responseType === 'arraybuffer') {\n    response.arrayBuffer().then(\n        this.handleResponseArrayBuffer_.bind(this),\n        this.handleSendFailure_.bind(this));\n  } else if (\n      typeof (goog.global.ReadableStream) !== 'undefined' &&\n      'body' in response) {\n    this.currentReader_ =\n        /** @type {!ReadableStreamDefaultReader} */ (response.body.getReader());\n    if (this.streamBinaryChunks_) {\n      if (this.responseType) {\n        throw new Error(\n            'responseType must be empty for \"streamBinaryChunks\" mode responses.');\n      }\n      this.response = [];\n    } else {\n      this.response = this.responseText = '';\n      this.textDecoder_ = new TextDecoder();\n    }\n    this.readInputFromFetch_();\n  } else {\n    response.text().then(\n        this.handleResponseText_.bind(this),\n        this.handleSendFailure_.bind(this));\n  }\n};\n\n\n/**\n * Reads the next chunk of data from the fetch response.\n * @private\n */\ngoog.net.FetchXmlHttp.prototype.readInputFromFetch_ = function() {\n  'use strict';\n  this.currentReader_.read()\n      .then(this.handleDataFromStream_.bind(this))\n      .catch(this.handleSendFailure_.bind(this));\n};\n\n\n/**\n * Handles a chunk of data from the fetch response stream reader.\n * @param {!IIterableResult} result\n * @private\n */\ngoog.net.FetchXmlHttp.prototype.handleDataFromStream_ = function(result) {\n  'use strict';\n  if (!this.inProgress_) {\n    // The request was aborted, ignore.\n    return;\n  }\n\n  if (this.streamBinaryChunks_ && result.value) {\n    // When streamBinaryChunks_ is enabled, \"response\" is an array\n    /** @type {!Array} */ (this.response)\n        .push(/** @type {!Uint8Array} */ (result.value));\n  } else if (!this.streamBinaryChunks_) {\n    const dataPacket = result.value ?\n        /** @type {!Uint8Array} */ (result.value) :\n        new Uint8Array(0);\n    const newText =\n        this.textDecoder_.decode(dataPacket, {stream: !result.done});\n    if (newText) {\n      this.responseText += newText;\n      this.response = this.responseText;\n    }\n  }\n  if (result.done) {\n    this.requestDone_();\n  } else {\n    this.dispatchCallback_();\n  }\n\n  if (this.readyState == goog.net.FetchXmlHttp.RequestState.LOADING) {\n    this.readInputFromFetch_();\n  }\n};\n\n/**\n * Handles the response text.\n * @param {string} responseText\n * @private\n */\ngoog.net.FetchXmlHttp.prototype.handleResponseText_ = function(responseText) {\n  'use strict';\n  if (!this.inProgress_) {\n    // The request was aborted, ignore.\n    return;\n  }\n  this.response = this.responseText = responseText;\n  this.requestDone_();\n};\n\n\n/**\n * Handles the response text.\n * @param {!ArrayBuffer} responseArrayBuffer\n * @private\n */\ngoog.net.FetchXmlHttp.prototype.handleResponseArrayBuffer_ = function(\n    responseArrayBuffer) {\n  'use strict';\n  if (!this.inProgress_) {\n    // The request was aborted, ignore.\n    return;\n  }\n  this.response = responseArrayBuffer;\n  this.requestDone_();\n};\n\n\n/**\n * Handles the send failure.\n * @param {*} error\n * @private\n */\ngoog.net.FetchXmlHttp.prototype.handleSendFailure_ = function(error) {\n  'use strict';\n  const e = error instanceof Error ? error : Error(error);\n  goog.log.warning(this.logger_, 'Failed to fetch url ' + this.url_, e);\n  if (!this.inProgress_) {\n    // The request was aborted, ignore.\n    return;\n  }\n  this.requestDone_();\n};\n\n\n/**\n * Sets the request state to DONE and performs cleanup.\n * @private\n */\ngoog.net.FetchXmlHttp.prototype.requestDone_ = function() {\n  'use strict';\n  this.readyState = goog.net.FetchXmlHttp.RequestState.DONE;\n\n  this.fetchResponse_ = null;\n  this.currentReader_ = null;\n  this.textDecoder_ = null;\n\n  this.dispatchCallback_();\n};\n\n\n/** @override */\ngoog.net.FetchXmlHttp.prototype.setRequestHeader = function(header, value) {\n  'use strict';\n  this.requestHeaders_.append(header, value);\n};\n\n\n/** @override */\ngoog.net.FetchXmlHttp.prototype.getResponseHeader = function(header) {\n  'use strict';\n  // TODO(user): This method should return null when the headers are not\n  // present or the specified header is missing. The externs need to be fixed.\n  if (!this.responseHeaders_) {\n    goog.log.warning(\n        this.logger_,\n        'Attempting to get response header but no headers have been received ' +\n            'for url: ' + this.url_);\n    return '';\n  }\n  return this.responseHeaders_.get(header.toLowerCase()) || '';\n};\n\n\n/** @override */\ngoog.net.FetchXmlHttp.prototype.getAllResponseHeaders = function() {\n  'use strict';\n  if (!this.responseHeaders_) {\n    goog.log.warning(\n        this.logger_,\n        'Attempting to get all response headers but no headers have been ' +\n            'received for url: ' + this.url_);\n    return '';\n  }\n  const lines = [];\n  const iter = this.responseHeaders_.entries();\n  let entry = iter.next();\n  while (!entry.done) {\n    const pair = entry.value;\n    lines.push(pair[0] + ': ' + pair[1]);\n    entry = iter.next();\n  }\n  return lines.join('\\r\\n');\n};\n\n\n/**\n * @param {!RequestCredentials} credentialsMode The credentials mode of the\n *     Service Worker fetch.\n */\ngoog.net.FetchXmlHttp.prototype.setCredentialsMode = function(credentialsMode) {\n  'use strict';\n  this.credentialsMode_ = credentialsMode;\n};\n\n/**\n * @return {!RequestCredentials|undefined} The credentials mode of the\n *     Service Worker fetch.\n */\ngoog.net.FetchXmlHttp.prototype.getCredentialsMode = function() {\n  'use strict';\n  return this.credentialsMode_;\n};\n\n/**\n * @param {!RequestCache} cacheMode The cache mode of the Service Worker fetch.\n */\ngoog.net.FetchXmlHttp.prototype.setCacheMode = function(cacheMode) {\n  'use strict';\n  this.cacheMode_ = cacheMode;\n};\n\n\n/**\n * Dispatches the callback, if the callback attribute is defined.\n * @private\n */\ngoog.net.FetchXmlHttp.prototype.dispatchCallback_ = function() {\n  'use strict';\n  if (this.onreadystatechange) {\n    this.onreadystatechange.call(this);\n  }\n};\n\n// Polyfill XmlHttpRequest's withCredentials property for specifying whether to\n// include credentials on cross domain requests.\nObject.defineProperty(goog.net.FetchXmlHttp.prototype, 'withCredentials', {\n  get:\n      /**\n       * @this {goog.net.FetchXmlHttp}\n       * @return {boolean} Whether to include credentials in cross domain\n       *     requests.\n       */\n      function() {\n        'use strict';\n        return this.getCredentialsMode() === 'include';\n      },\n\n  set:\n      /**\n       * @param {boolean} value Whether to include credentials in cross domain\n       *     requests.\n       * @this {goog.net.FetchXmlHttp}\n       **/\n      function(value) {\n        'use strict';\n        this.setCredentialsMode(value ? 'include' : 'same-origin');\n      }\n});\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Utilities for creating functions. Loosely inspired by these\n * java classes from the Guava library:\n * com.google.common.base.Functions\n * https://google.github.io/guava/releases/snapshot-jre/api/docs/index.html?com/google/common/base/Functions.html\n *\n * com.google.common.base.Predicates\n * https://google.github.io/guava/releases/snapshot-jre/api/docs/index.html?com/google/common/base/Predicates.html\n *\n * More about these can be found at\n * https://github.com/google/guava/wiki/FunctionalExplained\n */\n\n\ngoog.provide('goog.functions');\n\n\n/**\n * Creates a function that always returns the same value.\n * @param {T} retValue The value to return.\n * @return {function():T} The new function.\n * @template T\n */\ngoog.functions.constant = function(retValue) {\n  'use strict';\n  return function() {\n    'use strict';\n    return retValue;\n  };\n};\n\n\n/**\n * Always returns false.\n * @type {function(...): boolean}\n */\ngoog.functions.FALSE = function() {\n  'use strict';\n  return false;\n};\n\n\n/**\n * Always returns true.\n * @type {function(...): boolean}\n */\ngoog.functions.TRUE = function() {\n  'use strict';\n  return true;\n};\n\n\n/**\n * Always returns `null`.\n * @type {function(...): null}\n */\ngoog.functions.NULL = function() {\n  'use strict';\n  return null;\n};\n\n\n/**\n * Always returns `undefined`.\n * @type {function(...): undefined}\n */\ngoog.functions.UNDEFINED = function() {\n  return undefined;\n};\n\n/**\n * Always returns `undefined` (loosely-typed version).\n * @type {!Function}\n */\ngoog.functions.EMPTY = /** @type {?} */ (goog.functions.UNDEFINED);\n\n\n/**\n * A simple function that returns the first argument of whatever is passed\n * into it.\n * @param {T=} opt_returnValue The single value that will be returned.\n * @param {...*} var_args Optional trailing arguments. These are ignored.\n * @return {T} The first argument passed in, or undefined if nothing was passed.\n * @template T\n */\ngoog.functions.identity = function(opt_returnValue, var_args) {\n  'use strict';\n  return opt_returnValue;\n};\n\n\n/**\n * Creates a function that always throws an error with the given message.\n * @param {string} message The error message.\n * @return {!Function} The error-throwing function.\n */\ngoog.functions.error = function(message) {\n  'use strict';\n  return function() {\n    'use strict';\n    throw new Error(message);\n  };\n};\n\n\n/**\n * Creates a function that throws the given object.\n * @param {*} err An object to be thrown.\n * @return {!Function} The error-throwing function.\n */\ngoog.functions.fail = function(err) {\n  'use strict';\n  return function() {\n    'use strict';\n    throw err;\n  };\n};\n\n\n/**\n * Given a function, create a function that keeps opt_numArgs arguments and\n * silently discards all additional arguments.\n * @param {Function} f The original function.\n * @param {number=} opt_numArgs The number of arguments to keep. Defaults to 0.\n * @return {!Function} A version of f that only keeps the first opt_numArgs\n *     arguments.\n */\ngoog.functions.lock = function(f, opt_numArgs) {\n  'use strict';\n  opt_numArgs = opt_numArgs || 0;\n  return function() {\n    'use strict';\n    const self = /** @type {*} */ (this);\n    return f.apply(self, Array.prototype.slice.call(arguments, 0, opt_numArgs));\n  };\n};\n\n\n/**\n * Creates a function that returns its nth argument.\n * @param {number} n The position of the return argument.\n * @return {!Function} A new function.\n */\ngoog.functions.nth = function(n) {\n  'use strict';\n  return function() {\n    'use strict';\n    return arguments[n];\n  };\n};\n\n\n/**\n * Like goog.partial(), except that arguments are added after arguments to the\n * returned function.\n *\n * Usage:\n * function f(arg1, arg2, arg3, arg4) { ... }\n * var g = goog.functions.partialRight(f, arg3, arg4);\n * g(arg1, arg2);\n *\n * @param {!Function} fn A function to partially apply.\n * @param {...*} var_args Additional arguments that are partially applied to fn\n *     at the end.\n * @return {!Function} A partially-applied form of the function goog.partial()\n *     was invoked as a method of.\n */\ngoog.functions.partialRight = function(fn, var_args) {\n  'use strict';\n  const rightArgs = Array.prototype.slice.call(arguments, 1);\n  return function() {\n    'use strict';\n    // Even in strict mode, IE10/11 and Edge (non-Chromium) use global context\n    // when free-calling functions. To catch cases where people were using this\n    // erroneously, we explicitly change the context to undefined to match\n    // strict mode specifications.\n    let self = /** @type {*} */ (this);\n    if (self === goog.global) {\n      self = undefined;\n    }\n    const newArgs = Array.prototype.slice.call(arguments);\n    newArgs.push.apply(newArgs, rightArgs);\n    return fn.apply(self, newArgs);\n  };\n};\n\n\n/**\n * Given a function, create a new function that swallows its return value\n * and replaces it with a new one.\n * @param {Function} f A function.\n * @param {T} retValue A new return value.\n * @return {function(...?):T} A new function.\n * @template T\n */\ngoog.functions.withReturnValue = function(f, retValue) {\n  'use strict';\n  return goog.functions.sequence(f, goog.functions.constant(retValue));\n};\n\n\n/**\n * Creates a function that returns whether its argument equals the given value.\n *\n * Example:\n * var key = goog.object.findKey(obj, goog.functions.equalTo('needle'));\n *\n * @param {*} value The value to compare to.\n * @param {boolean=} opt_useLooseComparison Whether to use a loose (==)\n *     comparison rather than a strict (===) one. Defaults to false.\n * @return {function(*):boolean} The new function.\n */\ngoog.functions.equalTo = function(value, opt_useLooseComparison) {\n  'use strict';\n  return function(other) {\n    'use strict';\n    return opt_useLooseComparison ? (value == other) : (value === other);\n  };\n};\n\n\n/**\n * Creates the composition of the functions passed in.\n * For example, (goog.functions.compose(f, g))(a) is equivalent to f(g(a)).\n * @param {function(...?):T} fn The final function.\n * @param {...Function} var_args A list of functions.\n * @return {function(...?):T} The composition of all inputs.\n * @template T\n */\ngoog.functions.compose = function(fn, var_args) {\n  'use strict';\n  const functions = arguments;\n  const length = functions.length;\n  return function() {\n    'use strict';\n    const self = /** @type {*} */ (this);\n    let result;\n    if (length) {\n      result = functions[length - 1].apply(self, arguments);\n    }\n\n    for (let i = length - 2; i >= 0; i--) {\n      result = functions[i].call(self, result);\n    }\n    return result;\n  };\n};\n\n\n/**\n * Creates a function that calls the functions passed in in sequence, and\n * returns the value of the last function. For example,\n * (goog.functions.sequence(f, g))(x) is equivalent to f(x),g(x).\n * @param {...Function} var_args A list of functions.\n * @return {!Function} A function that calls all inputs in sequence.\n */\ngoog.functions.sequence = function(var_args) {\n  'use strict';\n  const functions = arguments;\n  const length = functions.length;\n  return function() {\n    'use strict';\n    const self = /** @type {*} */ (this);\n    let result;\n    for (let i = 0; i < length; i++) {\n      result = functions[i].apply(self, arguments);\n    }\n    return result;\n  };\n};\n\n\n/**\n * Creates a function that returns true if each of its components evaluates\n * to true. The components are evaluated in order, and the evaluation will be\n * short-circuited as soon as a function returns false.\n * For example, (goog.functions.and(f, g))(x) is equivalent to f(x) && g(x).\n * @param {...Function} var_args A list of functions.\n * @return {function(...?):boolean} A function that ANDs its component\n *      functions.\n */\ngoog.functions.and = function(var_args) {\n  'use strict';\n  const functions = arguments;\n  const length = functions.length;\n  return function() {\n    'use strict';\n    const self = /** @type {*} */ (this);\n    for (let i = 0; i < length; i++) {\n      if (!functions[i].apply(self, arguments)) {\n        return false;\n      }\n    }\n    return true;\n  };\n};\n\n\n/**\n * Creates a function that returns true if any of its components evaluates\n * to true. The components are evaluated in order, and the evaluation will be\n * short-circuited as soon as a function returns true.\n * For example, (goog.functions.or(f, g))(x) is equivalent to f(x) || g(x).\n * @param {...Function} var_args A list of functions.\n * @return {function(...?):boolean} A function that ORs its component\n *    functions.\n */\ngoog.functions.or = function(var_args) {\n  'use strict';\n  const functions = arguments;\n  const length = functions.length;\n  return function() {\n    'use strict';\n    const self = /** @type {*} */ (this);\n    for (let i = 0; i < length; i++) {\n      if (functions[i].apply(self, arguments)) {\n        return true;\n      }\n    }\n    return false;\n  };\n};\n\n\n/**\n * Creates a function that returns the Boolean opposite of a provided function.\n * For example, (goog.functions.not(f))(x) is equivalent to !f(x).\n * @param {!Function} f The original function.\n * @return {function(...?):boolean} A function that delegates to f and returns\n * opposite.\n */\ngoog.functions.not = function(f) {\n  'use strict';\n  return function() {\n    'use strict';\n    const self = /** @type {*} */ (this);\n    return !f.apply(self, arguments);\n  };\n};\n\n\n/**\n * Generic factory function to construct an object given the constructor\n * and the arguments. Intended to be bound to create object factories.\n *\n * Example:\n *\n * var factory = goog.partial(goog.functions.create, Class);\n *\n * @param {function(new:T, ...)} constructor The constructor for the Object.\n * @param {...*} var_args The arguments to be passed to the constructor.\n * @return {T} A new instance of the class given in `constructor`.\n * @template T\n * @deprecated This function does not work with ES6 class constructors. Use\n *     arrow functions + spread args instead.\n */\ngoog.functions.create = function(constructor, var_args) {\n  'use strict';\n  /**\n   * @constructor\n   * @final\n   */\n  const temp = function() {};\n  temp.prototype = constructor.prototype;\n\n  // obj will have constructor's prototype in its chain and\n  // 'obj instanceof constructor' will be true.\n  const obj = new temp();\n\n  // obj is initialized by constructor.\n  // arguments is only array-like so lacks shift(), but can be used with\n  // the Array prototype function.\n  constructor.apply(obj, Array.prototype.slice.call(arguments, 1));\n  return obj;\n};\n\n\n/**\n * @define {boolean} Whether the return value cache should be used.\n *    This should only be used to disable caches when testing.\n */\ngoog.functions.CACHE_RETURN_VALUE =\n    goog.define('goog.functions.CACHE_RETURN_VALUE', true);\n\n\n/**\n * Gives a wrapper function that caches the return value of a parameterless\n * function when first called.\n *\n * When called for the first time, the given function is called and its\n * return value is cached (thus this is only appropriate for idempotent\n * functions).  Subsequent calls will return the cached return value. This\n * allows the evaluation of expensive functions to be delayed until first used.\n *\n * To cache the return values of functions with parameters, see goog.memoize.\n *\n * @param {function():T} fn A function to lazily evaluate.\n * @return {function():T} A wrapped version the function.\n * @template T\n */\ngoog.functions.cacheReturnValue = function(fn) {\n  'use strict';\n  let called = false;\n  let value;\n\n  return function() {\n    'use strict';\n    if (!goog.functions.CACHE_RETURN_VALUE) {\n      return fn();\n    }\n\n    if (!called) {\n      value = fn();\n      called = true;\n    }\n\n    return value;\n  };\n};\n\n\n/**\n * Wraps a function to allow it to be called, at most, once. All\n * additional calls are no-ops.\n *\n * This is particularly useful for initialization functions\n * that should be called, at most, once.\n *\n * @param {function():*} f Function to call.\n * @return {function():undefined} Wrapped function.\n */\ngoog.functions.once = function(f) {\n  'use strict';\n  // Keep a reference to the function that we null out when we're done with\n  // it -- that way, the function can be GC'd when we're done with it.\n  let inner = f;\n  return function() {\n    'use strict';\n    if (inner) {\n      const tmp = inner;\n      inner = null;\n      tmp();\n    }\n  };\n};\n\n\n/**\n * Wraps a function to allow it to be called, at most, once per interval\n * (specified in milliseconds). If the wrapper function is called N times within\n * that interval, only the Nth call will go through.\n *\n * This is particularly useful for batching up repeated actions where the\n * last action should win. This can be used, for example, for refreshing an\n * autocomplete pop-up every so often rather than updating with every keystroke,\n * since the final text typed by the user is the one that should produce the\n * final autocomplete results. For more stateful debouncing with support for\n * pausing, resuming, and canceling debounced actions, use\n * `goog.async.Debouncer`.\n *\n * @param {function(this:SCOPE, ...?)} f Function to call.\n * @param {number} interval Interval over which to debounce. The function will\n *     only be called after the full interval has elapsed since the last call.\n * @param {SCOPE=} opt_scope Object in whose scope to call the function.\n * @return {function(...?): undefined} Wrapped function.\n * @template SCOPE\n */\ngoog.functions.debounce = function(f, interval, opt_scope) {\n  'use strict';\n  let timeout = 0;\n  return /** @type {function(...?)} */ (function(var_args) {\n    'use strict';\n    goog.global.clearTimeout(timeout);\n    const args = arguments;\n    timeout = goog.global.setTimeout(function() {\n      'use strict';\n      f.apply(opt_scope, args);\n    }, interval);\n  });\n};\n\n\n/**\n * Wraps a function to allow it to be called, at most, once per interval\n * (specified in milliseconds). If the wrapper function is called N times in\n * that interval, both the 1st and the Nth calls will go through.\n *\n * This is particularly useful for limiting repeated user requests where the\n * the last action should win, but you also don't want to wait until the end of\n * the interval before sending a request out, as it leads to a perception of\n * slowness for the user.\n *\n * @param {function(this:SCOPE, ...?)} f Function to call.\n * @param {number} interval Interval over which to throttle. The function can\n *     only be called once per interval.\n * @param {SCOPE=} opt_scope Object in whose scope to call the function.\n * @return {function(...?): undefined} Wrapped function.\n * @template SCOPE\n */\ngoog.functions.throttle = function(f, interval, opt_scope) {\n  'use strict';\n  let timeout = 0;\n  let shouldFire = false;\n  let storedArgs = [];\n\n  const handleTimeout = function() {\n    'use strict';\n    timeout = 0;\n    if (shouldFire) {\n      shouldFire = false;\n      fire();\n    }\n  };\n\n  const fire = function() {\n    'use strict';\n    timeout = goog.global.setTimeout(handleTimeout, interval);\n    let args = storedArgs;\n    storedArgs = [];  // Avoid a space leak by clearing stored arguments.\n    f.apply(opt_scope, args);\n  };\n\n  return /** @type {function(...?)} */ (function(var_args) {\n    'use strict';\n    storedArgs = arguments;\n    if (!timeout) {\n      fire();\n    } else {\n      shouldFire = true;\n    }\n  });\n};\n\n\n/**\n * Wraps a function to allow it to be called, at most, once per interval\n * (specified in milliseconds). If the wrapper function is called N times within\n * that interval, only the 1st call will go through.\n *\n * This is particularly useful for limiting repeated user requests where the\n * first request is guaranteed to have all the data required to perform the\n * final action, so there's no need to wait until the end of the interval before\n * sending the request out.\n *\n * @param {function(this:SCOPE, ...?)} f Function to call.\n * @param {number} interval Interval over which to rate-limit. The function will\n *     only be called once per interval, and ignored for the remainer of the\n *     interval.\n * @param {SCOPE=} opt_scope Object in whose scope to call the function.\n * @return {function(...?): undefined} Wrapped function.\n * @template SCOPE\n */\ngoog.functions.rateLimit = function(f, interval, opt_scope) {\n  'use strict';\n  let timeout = 0;\n\n  const handleTimeout = function() {\n    'use strict';\n    timeout = 0;\n  };\n\n  return /** @type {function(...?)} */ (function(var_args) {\n    'use strict';\n    if (!timeout) {\n      timeout = goog.global.setTimeout(handleTimeout, interval);\n      f.apply(opt_scope, arguments);\n    }\n  });\n};\n\n/**\n * Returns true if the specified value is a function.\n * @param {*} val Variable to test.\n * @return {boolean} Whether variable is a function.\n */\ngoog.functions.isFunction = (val) => {\n  return typeof val === 'function';\n};\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n\n/**\n * @fileoverview Utility to attempt native JSON processing, falling back to\n *     goog.json if not available.\n *\n *     This is intended as a drop-in for current users of goog.json who want\n *     to take advantage of native JSON if present.\n */\n\ngoog.provide('goog.json.hybrid');\n\ngoog.require('goog.asserts');\ngoog.require('goog.json');\n\n\n/**\n * Attempts to serialize the JSON string natively, falling back to\n * `goog.json.serialize` if unsuccessful.\n * @param {!Object} obj JavaScript object to serialize to JSON.\n * @return {string} Resulting JSON string.\n */\ngoog.json.hybrid.stringify = goog.json.USE_NATIVE_JSON ?\n    goog.global['JSON']['stringify'] :\n    function(obj) {\n      'use strict';\n      if (goog.global.JSON) {\n        try {\n          return goog.global.JSON.stringify(obj);\n        } catch (e) {\n          // Native serialization failed.  Fall through to retry with\n          // goog.json.serialize.\n        }\n      }\n\n      return goog.json.serialize(obj);\n    };\n\n\n/**\n * Attempts to parse the JSON string natively, falling back to\n * the supplied `fallbackParser` if unsuccessful.\n * @param {string} jsonString JSON string to parse.\n * @param {function(string):Object} fallbackParser Fallback JSON parser used\n *     if native\n * @return {?Object} Resulting JSON object.\n * @private\n */\ngoog.json.hybrid.parse_ = function(jsonString, fallbackParser) {\n  'use strict';\n  if (goog.global.JSON) {\n    try {\n      var obj = goog.global.JSON.parse(jsonString);\n      goog.asserts.assert(typeof obj == 'object');\n      return /** @type {?Object} */ (obj);\n    } catch (e) {\n      // Native parse failed.  Fall through to retry with goog.json.parse.\n    }\n  }\n\n  return fallbackParser(jsonString);\n};\n\n\n/**\n * Attempts to parse the JSON string natively, falling back to\n * `goog.json.parse` if unsuccessful.\n * @param {string} jsonString JSON string to parse.\n * @return {?Object} Resulting JSON object.\n */\ngoog.json.hybrid.parse = goog.json.USE_NATIVE_JSON ?\n    goog.global['JSON']['parse'] :\n    function(jsonString) {\n      'use strict';\n      return goog.json.hybrid.parse_(jsonString, goog.json.parse);\n    };\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Constants for HTTP status codes.\n */\n\ngoog.provide('goog.net.HttpStatus');\n\n\n/**\n * HTTP Status Codes defined in RFC 2616, RFC 6585, RFC 4918 and RFC 7538.\n * @see http://www.w3.org/Protocols/rfc2616/rfc2616-sec10.html\n * @see http://tools.ietf.org/html/rfc6585\n * @see https://tools.ietf.org/html/rfc4918\n * @see https://tools.ietf.org/html/rfc7538\n * @enum {number}\n */\ngoog.net.HttpStatus = {\n  // Informational 1xx\n  CONTINUE: 100,\n  SWITCHING_PROTOCOLS: 101,\n\n  // Successful 2xx\n  OK: 200,\n  CREATED: 201,\n  ACCEPTED: 202,\n  NON_AUTHORITATIVE_INFORMATION: 203,\n  NO_CONTENT: 204,\n  RESET_CONTENT: 205,\n  PARTIAL_CONTENT: 206,\n  MULTI_STATUS: 207,\n\n  // Redirection 3xx\n  MULTIPLE_CHOICES: 300,\n  MOVED_PERMANENTLY: 301,\n  FOUND: 302,\n  SEE_OTHER: 303,\n  NOT_MODIFIED: 304,\n  USE_PROXY: 305,\n  TEMPORARY_REDIRECT: 307,\n  PERMANENT_REDIRECT: 308,\n\n  // Client Error 4xx\n  BAD_REQUEST: 400,\n  UNAUTHORIZED: 401,\n  PAYMENT_REQUIRED: 402,\n  FORBIDDEN: 403,\n  NOT_FOUND: 404,\n  METHOD_NOT_ALLOWED: 405,\n  NOT_ACCEPTABLE: 406,\n  PROXY_AUTHENTICATION_REQUIRED: 407,\n  REQUEST_TIMEOUT: 408,\n  CONFLICT: 409,\n  GONE: 410,\n  LENGTH_REQUIRED: 411,\n  PRECONDITION_FAILED: 412,\n  REQUEST_ENTITY_TOO_LARGE: 413,\n  REQUEST_URI_TOO_LONG: 414,\n  UNSUPPORTED_MEDIA_TYPE: 415,\n  REQUEST_RANGE_NOT_SATISFIABLE: 416,\n  EXPECTATION_FAILED: 417,\n  UNPROCESSABLE_ENTITY: 422,\n  LOCKED: 423,\n  FAILED_DEPENDENCY: 424,\n  PRECONDITION_REQUIRED: 428,\n  TOO_MANY_REQUESTS: 429,\n  REQUEST_HEADER_FIELDS_TOO_LARGE: 431,\n  CLIENT_CLOSED_REQUEST: 499,  // Nonstandard, used by GRPC\n\n  // Server Error 5xx\n  INTERNAL_SERVER_ERROR: 500,\n  NOT_IMPLEMENTED: 501,\n  BAD_GATEWAY: 502,\n  SERVICE_UNAVAILABLE: 503,\n  GATEWAY_TIMEOUT: 504,\n  HTTP_VERSION_NOT_SUPPORTED: 505,\n  INSUFFICIENT_STORAGE: 507,\n  NETWORK_AUTHENTICATION_REQUIRED: 511,\n\n  /*\n   * IE returns this code for 204 due to its use of URLMon, which returns this\n   * code for 'Operation Aborted'. The status text is 'Unknown', the response\n   * headers are ''. Known to occur on IE 6 on XP through IE9 on Win7.\n   */\n  QUIRK_IE_NO_CONTENT: 1223,\n};\n\n\n/**\n * Returns whether the given status should be considered successful.\n *\n * Successful codes are OK (200), CREATED (201), ACCEPTED (202),\n * NO CONTENT (204), PARTIAL CONTENT (206), NOT MODIFIED (304),\n * and IE's no content code (1223).\n *\n * @param {number} status The status code to test.\n * @return {boolean} Whether the status code should be considered successful.\n */\ngoog.net.HttpStatus.isSuccess = function(status) {\n  'use strict';\n  switch (status) {\n    case goog.net.HttpStatus.OK:\n    case goog.net.HttpStatus.CREATED:\n    case goog.net.HttpStatus.ACCEPTED:\n    case goog.net.HttpStatus.NO_CONTENT:\n    case goog.net.HttpStatus.PARTIAL_CONTENT:\n    case goog.net.HttpStatus.NOT_MODIFIED:\n    case goog.net.HttpStatus.QUIRK_IE_NO_CONTENT:\n      return true;\n\n    default:\n      return false;\n  }\n};\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Provides CORS support for HTTP based RPC requests.\n *\n * As part of net.rpc package, CORS features provided by this class\n * depend on the server support. Please check related specs to decide how\n * to enable any of the features provided by this class.\n */\n\ngoog.module('goog.net.rpc.HttpCors');\n\nconst GoogUri = goog.require('goog.Uri');\nconst googObject = goog.require('goog.object');\nconst googString = goog.require('goog.string');\nconst googUriUtils = goog.require('goog.uri.utils');\n\n\n/**\n * The default URL parameter name to overwrite http headers with a URL param\n * to avoid CORS preflight.\n *\n * See https://github.com/whatwg/fetch/issues/210#issue-129531743 for the spec.\n *\n * @type {string}\n */\nexports.HTTP_HEADERS_PARAM_NAME = '$httpHeaders';\n\n\n/**\n * The default URL parameter name to overwrite http method with a URL param\n * to avoid CORS preflight.\n *\n * See https://github.com/whatwg/fetch/issues/210#issue-129531743 for the spec.\n *\n * @type {string}\n */\nexports.HTTP_METHOD_PARAM_NAME = '$httpMethod';\n\n\n/**\n * Generates the URL parameter value with custom headers encoded as\n * HTTP/1.1 headers block.\n *\n * @param {!Object<string, string>} headers The custom headers.\n * @return {string} The URL param to overwrite custom HTTP headers.\n */\nexports.generateHttpHeadersOverwriteParam = function(headers) {\n  let result = '';\n  googObject.forEach(headers, function(value, key) {\n    result += key;\n    result += ':';\n    result += value;\n    result += '\\r\\n';\n  });\n  return result;\n};\n\n\n/**\n * Generates the URL-encoded URL parameter value with custom headers encoded as\n * HTTP/1.1 headers block.\n *\n * @param {!Object<string, string>} headers The custom headers.\n * @return {string} The URL param to overwrite custom HTTP headers.\n */\nexports.generateEncodedHttpHeadersOverwriteParam = function(headers) {\n  return googString.urlEncode(\n      exports.generateHttpHeadersOverwriteParam(headers));\n};\n\n\n/**\n * Sets custom HTTP headers via an overwrite URL param.\n *\n * @param {!GoogUri|string} url The URI object or a string path.\n * @param {string} urlParam The URL param name.\n * @param {!Object<string, string>} extraHeaders The HTTP headers.\n * @return {!GoogUri|string} The URI object or a string path with headers\n * encoded as a url param.\n */\nexports.setHttpHeadersWithOverwriteParam = function(\n    url, urlParam, extraHeaders) {\n  if (googObject.isEmpty(extraHeaders)) {\n    return url;\n  }\n  const httpHeaders = exports.generateHttpHeadersOverwriteParam(extraHeaders);\n  if (typeof url === 'string') {\n    return googUriUtils.appendParam(\n        url, googString.urlEncode(urlParam), httpHeaders);\n  } else {\n    url.setParameterValue(urlParam, httpHeaders);  // duplicate removed!\n    return url;\n  }\n};\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Implementation of a WebChannel transport using WebChannelBase.\n *\n * When WebChannelBase is used as the underlying transport, the capabilities\n * of the WebChannel are limited to what's supported by the implementation.\n * Particularly, multiplexing is not possible, and only strings are\n * supported as message types.\n */\n\ngoog.provide('goog.labs.net.webChannel.WebChannelBaseTransport');\n\ngoog.require('goog.asserts');\ngoog.require('goog.collections.maps');\ngoog.require('goog.events.EventTarget');\ngoog.require('goog.json');\ngoog.require('goog.labs.net.webChannel.ChannelRequest');\ngoog.require('goog.labs.net.webChannel.WebChannelBase');\ngoog.require('goog.labs.net.webChannel.Wire');\ngoog.require('goog.log');\ngoog.require('goog.net.WebChannel');\ngoog.require('goog.net.WebChannelTransport');\ngoog.require('goog.object');\ngoog.require('goog.string');\n\n\n\n/**\n * Implementation of {@link goog.net.WebChannelTransport} with\n * {@link goog.labs.net.webChannel.WebChannelBase} as the underlying channel\n * implementation.\n *\n * @constructor\n * @struct\n * @implements {goog.net.WebChannelTransport}\n * @final\n */\ngoog.labs.net.webChannel.WebChannelBaseTransport = function() {\n  'use strict';\n  if (!goog.labs.net.webChannel.ChannelRequest.supportsXhrStreaming()) {\n    throw new Error('Environmental error: no available transport.');\n  }\n};\n\n\ngoog.scope(function() {\n'use strict';\nconst WebChannelBaseTransport =\n    goog.labs.net.webChannel.WebChannelBaseTransport;\nconst WebChannelBase = goog.labs.net.webChannel.WebChannelBase;\nconst Wire = goog.labs.net.webChannel.Wire;\n\n\n/**\n * @override\n */\nWebChannelBaseTransport.prototype.createWebChannel = function(\n    url, opt_options) {\n  'use strict';\n  return new WebChannelBaseTransport.Channel(url, opt_options);\n};\n\n\n\n/**\n * Implementation of the {@link goog.net.WebChannel} interface.\n *\n * @param {string} url The URL path for the new WebChannel instance.\n * @param {!goog.net.WebChannel.Options=} opt_options Configuration for the\n *     new WebChannel instance.\n *\n * @constructor\n * @implements {goog.net.WebChannel}\n * @extends {goog.events.EventTarget}\n * @final\n */\nWebChannelBaseTransport.Channel = function(url, opt_options) {\n  'use strict';\n  WebChannelBaseTransport.Channel.base(this, 'constructor');\n\n  /**\n   * @private {!WebChannelBase} The underlying channel object.\n   */\n  this.channel_ = new WebChannelBase(\n      opt_options, goog.net.WebChannelTransport.CLIENT_VERSION);\n\n  /**\n   * @private {string} The URL of the target server end-point.\n   */\n  this.url_ = url;\n\n  /**\n   * @private {goog.log.Logger} The logger for this class.\n   */\n  this.logger_ =\n      goog.log.getLogger('goog.labs.net.webChannel.WebChannelBaseTransport');\n\n  /**\n   * @private {Object<string, string>} Extra URL parameters\n   * to be added to each HTTP request.\n   */\n  this.messageUrlParams_ =\n      (opt_options && opt_options.messageUrlParams) || null;\n\n  let messageHeaders = (opt_options && opt_options.messageHeaders) || null;\n\n  // default is false\n  if (opt_options && opt_options.clientProtocolHeaderRequired) {\n    if (messageHeaders) {\n      goog.object.set(\n          messageHeaders, goog.net.WebChannel.X_CLIENT_PROTOCOL,\n          goog.net.WebChannel.X_CLIENT_PROTOCOL_WEB_CHANNEL);\n    } else {\n      messageHeaders = goog.object.create(\n          goog.net.WebChannel.X_CLIENT_PROTOCOL,\n          goog.net.WebChannel.X_CLIENT_PROTOCOL_WEB_CHANNEL);\n    }\n  }\n\n  this.channel_.setExtraHeaders(messageHeaders);\n\n  let initHeaders = (opt_options && opt_options.initMessageHeaders) || null;\n\n  if (opt_options && opt_options.messageContentType) {\n    if (initHeaders) {\n      goog.object.set(\n          initHeaders, goog.net.WebChannel.X_WEBCHANNEL_CONTENT_TYPE,\n          opt_options.messageContentType);\n    } else {\n      initHeaders = goog.object.create(\n          goog.net.WebChannel.X_WEBCHANNEL_CONTENT_TYPE,\n          opt_options.messageContentType);\n    }\n  }\n\n  if (opt_options && opt_options.clientProfile) {\n    if (initHeaders) {\n      goog.object.set(\n          initHeaders, goog.net.WebChannel.X_WEBCHANNEL_CLIENT_PROFILE,\n          opt_options.clientProfile);\n    } else {\n      initHeaders = goog.object.create(\n          goog.net.WebChannel.X_WEBCHANNEL_CLIENT_PROFILE,\n          opt_options.clientProfile);\n    }\n  }\n\n  this.channel_.setInitHeaders(initHeaders);\n\n  const httpHeadersOverwriteParam =\n      opt_options && opt_options.httpHeadersOverwriteParam;\n  if (httpHeadersOverwriteParam &&\n      !goog.string.isEmptyOrWhitespace(httpHeadersOverwriteParam)) {\n    this.channel_.setHttpHeadersOverwriteParam(httpHeadersOverwriteParam);\n  }\n\n  /**\n   * @private {boolean} Whether to enable CORS.\n   */\n  this.supportsCrossDomainXhr_ =\n      (opt_options && opt_options.supportsCrossDomainXhr) || false;\n\n  /**\n   * @private {boolean} Whether to send raw Json and bypass v8 wire format.\n   */\n  this.sendRawJson_ = (opt_options && opt_options.sendRawJson) || false;\n\n  // Note that httpSessionIdParam will be ignored if the same parameter name\n  // has already been specified with messageUrlParams\n  const httpSessionIdParam = opt_options && opt_options.httpSessionIdParam;\n  if (httpSessionIdParam &&\n      !goog.string.isEmptyOrWhitespace(httpSessionIdParam)) {\n    this.channel_.setHttpSessionIdParam(httpSessionIdParam);\n    if (goog.object.containsKey(this.messageUrlParams_, httpSessionIdParam)) {\n      goog.object.remove(this.messageUrlParams_, httpSessionIdParam);\n      goog.log.warning(\n          this.logger_,\n          'Ignore httpSessionIdParam also specified with messageUrlParams: ' +\n              httpSessionIdParam);\n    }\n  }\n\n  /**\n   * The channel handler.\n   *\n   * @private {!WebChannelBaseTransport.Channel.Handler_}\n   */\n  this.channelHandler_ = new WebChannelBaseTransport.Channel.Handler_(this);\n};\ngoog.inherits(WebChannelBaseTransport.Channel, goog.events.EventTarget);\n\n\n/**\n * @override\n */\nWebChannelBaseTransport.Channel.prototype.open = function() {\n  'use strict';\n  this.channel_.setHandler(this.channelHandler_);\n  if (this.supportsCrossDomainXhr_) {\n    this.channel_.setSupportsCrossDomainXhrs(true);\n  }\n  this.channel_.connect(this.url_, (this.messageUrlParams_ || undefined));\n};\n\n\n/**\n * @override\n */\nWebChannelBaseTransport.Channel.prototype.close = function() {\n  'use strict';\n  this.channel_.disconnect();\n};\n\n\n/**\n * @override\n */\nWebChannelBaseTransport.Channel.prototype.halfClose = function() {\n  'use strict';\n  // to be implemented\n  throw new Error('Not implemented');\n};\n\n\n/**\n * The WebChannelBase only supports object types.\n *\n * @param {!goog.net.WebChannel.MessageData} message The message to send.\n *\n * @override\n */\nWebChannelBaseTransport.Channel.prototype.send = function(message) {\n  'use strict';\n  this.channel_.sendMap(this.messageToMapObject_(message));\n};\n\n\n/**\n * Converts a message to the map used by the underlying channel.\n *\n * @param {!goog.net.WebChannel.MessageData} message\n * @return {!Object|!goog.collections.maps.MapLike}\n */\nWebChannelBaseTransport.Channel.prototype.messageToMapObject_ = function(\n    message) {\n  'use strict';\n  goog.asserts.assert(\n      goog.isObject(message) || typeof message === 'string',\n      'only object type or raw string is supported');\n\n  if (typeof message === 'string') {\n    const rawJson = {};\n    rawJson[Wire.RAW_DATA_KEY] = message;\n    return rawJson;\n  }\n\n  if (this.sendRawJson_) {\n    const rawJson = {};\n    rawJson[Wire.RAW_DATA_KEY] = goog.json.serialize(message);\n    return rawJson;\n  }\n\n  return message;\n};\n\n\n/**\n * Converts the map used by the underlying channel to a message.\n *\n * NOTE: In the case of the message being JS Object or string, the exact same\n * object passed during `messageToMapObject_()` is returned. In the case of raw\n * JSON, an equal (but not the same) object is returned (due to serialization).\n *\n * @param {!Object|!goog.collections.maps.MapLike} map\n * @return {!goog.net.WebChannel.MessageData}\n */\nWebChannelBaseTransport.Channel.prototype.mapObjectToMessage_ = function(map) {\n  'use strict';\n  if (Wire.RAW_DATA_KEY in map) {\n    const rawMessage = map[Wire.RAW_DATA_KEY];\n\n    if (this.sendRawJson_) {\n      return /** @type {!goog.net.WebChannel.MessageData} */ (\n          goog.json.parse(rawMessage));\n    } else {  // string message\n      return rawMessage;\n    }\n  }\n\n  return map;\n};\n\n\n/**\n * @override\n */\nWebChannelBaseTransport.Channel.prototype.disposeInternal = function() {\n  'use strict';\n  this.channel_.setHandler(null);\n  delete this.channelHandler_;\n  this.channel_.disconnect();\n  delete this.channel_;\n\n  WebChannelBaseTransport.Channel.base(this, 'disposeInternal');\n};\n\n\n\n/**\n * The message event.\n *\n * @param {!Array<?>|!Object} array The data array from the underlying channel.\n * @constructor\n * @extends {goog.net.WebChannel.MessageEvent}\n * @final\n */\nWebChannelBaseTransport.Channel.MessageEvent = function(array) {\n  'use strict';\n  WebChannelBaseTransport.Channel.MessageEvent.base(this, 'constructor');\n\n  // single-metadata only\n  const metadata = array['__sm__'];\n  if (metadata) {\n    this.metadataKey = goog.object.getAnyKey(metadata);\n    if (this.metadataKey) {\n      this.data = goog.object.get(metadata, this.metadataKey);\n    } else {\n      this.data = metadata;  // empty\n    }\n  } else {\n    this.data = array;\n  }\n};\ngoog.inherits(\n    WebChannelBaseTransport.Channel.MessageEvent,\n    goog.net.WebChannel.MessageEvent);\n\n\n\n/**\n * The error event.\n *\n * @param {WebChannelBase.Error} error The error code.\n * @constructor\n * @extends {goog.net.WebChannel.ErrorEvent}\n * @final\n */\nWebChannelBaseTransport.Channel.ErrorEvent = function(error) {\n  'use strict';\n  WebChannelBaseTransport.Channel.ErrorEvent.base(this, 'constructor');\n\n  /**\n   * High-level status code.\n   */\n  this.status = goog.net.WebChannel.ErrorStatus.NETWORK_ERROR;\n\n  /**\n   * @const {WebChannelBase.Error} Internal error code, for debugging use only.\n   */\n  this.errorCode = error;\n};\ngoog.inherits(\n    WebChannelBaseTransport.Channel.ErrorEvent, goog.net.WebChannel.ErrorEvent);\n\n\n\n/**\n * Implementation of {@link WebChannelBase.Handler} interface.\n *\n * @param {!WebChannelBaseTransport.Channel} channel The enclosing WebChannel.\n *\n * @constructor\n * @extends {WebChannelBase.Handler}\n * @private\n */\nWebChannelBaseTransport.Channel.Handler_ = function(channel) {\n  'use strict';\n  WebChannelBaseTransport.Channel.Handler_.base(this, 'constructor');\n\n  /**\n   * @type {!WebChannelBaseTransport.Channel}\n   * @private\n   */\n  this.channel_ = channel;\n};\ngoog.inherits(WebChannelBaseTransport.Channel.Handler_, WebChannelBase.Handler);\n\n\n/**\n * @override\n */\nWebChannelBaseTransport.Channel.Handler_.prototype.channelOpened = function(\n    channel) {\n  'use strict';\n  goog.log.info(\n      this.channel_.logger_, 'WebChannel opened on ' + this.channel_.url_);\n  this.channel_.dispatchEvent(goog.net.WebChannel.EventType.OPEN);\n};\n\n\n/**\n * @override\n */\nWebChannelBaseTransport.Channel.Handler_.prototype.channelHandleArray =\n    function(channel, array) {\n  'use strict';\n  goog.asserts.assert(array, 'array expected to be defined');\n  this.channel_.dispatchEvent(\n      new WebChannelBaseTransport.Channel.MessageEvent(array));\n};\n\n\n/**\n * @override\n */\nWebChannelBaseTransport.Channel.Handler_.prototype.channelError = function(\n    channel, error) {\n  'use strict';\n  goog.log.info(\n      this.channel_.logger_,\n      'WebChannel aborted on ' + this.channel_.url_ +\n          ' due to channel error: ' + error);\n  this.channel_.dispatchEvent(\n      new WebChannelBaseTransport.Channel.ErrorEvent(error));\n};\n\n\n/**\n * @override\n */\nWebChannelBaseTransport.Channel.Handler_.prototype.channelClosed = function(\n    channel, opt_pendingMaps, opt_undeliveredMaps) {\n  'use strict';\n  goog.log.info(\n      this.channel_.logger_, 'WebChannel closed on ' + this.channel_.url_);\n  this.channel_.dispatchEvent(goog.net.WebChannel.EventType.CLOSE);\n};\n\n\n/**\n * @override\n */\nWebChannelBaseTransport.Channel.prototype.getRuntimeProperties = function() {\n  'use strict';\n  return new WebChannelBaseTransport.ChannelProperties(this, this.channel_);\n};\n\n\n\n/**\n * Implementation of the {@link goog.net.WebChannel.RuntimeProperties}.\n *\n * @param {!WebChannelBaseTransport.Channel} transportChannel The transport\n *     channel object.\n * @param {!WebChannelBase} channel The underlying channel object.\n *\n * @constructor\n * @implements {goog.net.WebChannel.RuntimeProperties}\n * @final\n */\nWebChannelBaseTransport.ChannelProperties = function(\n    transportChannel, channel) {\n  'use strict';\n  /**\n   * The transport channel object.\n   *\n   * @private @const {!WebChannelBaseTransport.Channel}\n   */\n  this.transportChannel_ = transportChannel;\n\n  /**\n   * The underlying channel object.\n   *\n   * @private @const {!WebChannelBase}\n   */\n  this.channel_ = channel;\n};\n\n\n/**\n * @override\n */\nWebChannelBaseTransport.ChannelProperties.prototype.getConcurrentRequestLimit =\n    function() {\n  'use strict';\n  return this.channel_.getForwardChannelRequestPool().getMaxSize();\n};\n\n\n/**\n * @override\n */\nWebChannelBaseTransport.ChannelProperties.prototype.isSpdyEnabled = function() {\n  'use strict';\n  return this.getConcurrentRequestLimit() > 1;\n};\n\n\n/**\n * @override\n */\nWebChannelBaseTransport.ChannelProperties.prototype.getPendingRequestCount =\n    function() {\n  'use strict';\n  return this.channel_.getForwardChannelRequestPool().getRequestCount();\n};\n\n\n/**\n * @override\n * @return {!Array<!goog.net.WebChannel.MessageData>}\n */\nWebChannelBaseTransport.ChannelProperties.prototype.getNonAckedMessages =\n    function() {\n  'use strict';\n  return this.channel_.getNonAckedMaps().map(\n      queued_map => this.transportChannel_.mapObjectToMessage_(queued_map.map));\n};\n\n\n/**\n * @override\n */\nWebChannelBaseTransport.ChannelProperties.prototype.getHttpSessionId =\n    function() {\n  'use strict';\n  return this.channel_.getHttpSessionId();\n};\n\n\n/**\n * @override\n */\nWebChannelBaseTransport.ChannelProperties.prototype.commit = function(\n    callback) {\n  'use strict';\n  this.channel_.setForwardChannelFlushCallback(callback);\n};\n\n\n/**\n * @override\n */\nWebChannelBaseTransport.ChannelProperties.prototype.notifyNonAckedMessageCount =\n    goog.abstractMethod;\n\n\n/**\n * @override\n */\nWebChannelBaseTransport.ChannelProperties.prototype.onCommit =\n    goog.abstractMethod;\n\n\n/**\n * @override\n */\nWebChannelBaseTransport.ChannelProperties.prototype.ackCommit =\n    goog.abstractMethod;\n\n\n/** @override */\nWebChannelBaseTransport.ChannelProperties.prototype.getLastStatusCode =\n    function() {\n  'use strict';\n  return this.channel_.getLastStatusCode();\n};\n});  // goog.scope\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Interface and shared data structures for implementing\n * different wire protocol versions.\n */\ngoog.provide('goog.labs.net.webChannel.Wire');\ngoog.provide('goog.labs.net.webChannel.Wire.QueuedMap');\n\n\n\ngoog.require('goog.collections.maps');\n\n\n\n/**\n * The interface class.\n * @interface\n */\ngoog.labs.net.webChannel.Wire = class {\n  constructor() {}\n};\n\n\n/**\n * The latest protocol version that this class supports. We request this version\n * from the server when opening the connection. Should match\n * LATEST_CHANNEL_VERSION on the server code.\n * @type {number}\n */\ngoog.labs.net.webChannel.Wire.LATEST_CHANNEL_VERSION = 8;\n\n\n/**\n * The JSON field key for the raw data wrapper object.\n * @type {string}\n */\ngoog.labs.net.webChannel.Wire.RAW_DATA_KEY = '__data__';\n\n\n\n/**\n * Simple container class for a (mapId, map) pair.\n */\ngoog.labs.net.webChannel.Wire.QueuedMap = class {\n  /**\n   * @param {number} mapId The id for this map.\n   * @param {!Object|!goog.collections.maps.MapLike} map The map itself.\n   * @param {!Object=} opt_context The context associated with the map.\n   */\n  constructor(mapId, map, opt_context) {\n    'use strict';\n    /**\n     * The id for this map.\n     * @type {number}\n     */\n    this.mapId = mapId;\n\n    /**\n     * The map itself.\n     * @type {!Object|!goog.collections.maps.MapLike}\n     */\n    this.map = map;\n\n    /**\n     * The context for the map.\n     * @type {Object}\n     */\n    this.context = opt_context || null;\n  }\n\n  /**\n   * @return {number|undefined} the size of the raw JSON message or\n   * undefined if the message is not encoded as a raw JSON message\n   */\n  getRawDataSize() {\n    'use strict';\n    if (goog.labs.net.webChannel.Wire.RAW_DATA_KEY in this.map) {\n      const data = this.map[goog.labs.net.webChannel.Wire.RAW_DATA_KEY];\n      if (typeof data === 'string') {\n        return data.length;\n      }\n    }\n\n    return undefined;\n  }\n};\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Transport support for WebChannel.\n *\n * The <code>WebChannelTransport</code> implementation serves as the factory\n * for <code>WebChannel</code>, which offers an abstraction for\n * point-to-point socket-like communication similar to what BrowserChannel\n * or HTML5 WebSocket offers.\n */\n\ngoog.provide('goog.net.WebChannelTransport');\n\ngoog.requireType('goog.net.WebChannel');\ngoog.requireType('goog.net.WebChannel.Options');\n\n\n\n/**\n * A WebChannelTransport instance represents a shared context of logical\n * connectivity between a browser client and a remote origin.\n *\n * Over a single WebChannelTransport instance, multiple WebChannels may be\n * created against different URLs, which may all share the same\n * underlying connectivity (i.e. TCP connection) whenever possible.\n *\n * When multi-domains are supported, such as CORS, multiple origins may be\n * supported over a single WebChannelTransport instance at the same time.\n *\n * Sharing between different window contexts such as tabs is not addressed\n * by WebChannelTransport. Applications may choose HTML5 shared workers\n * or other techniques to access the same transport instance\n * across different window contexts.\n *\n * @interface\n */\ngoog.net.WebChannelTransport = function() {};\n\n\n/**\n * The client version. This integer value will be passed to the server\n * when a channel is opened to inform the server the client \"capabilities\".\n *\n * Wire protocol version is a different concept and is internal to the\n * transport implementation.\n *\n * @const\n * @type {number}\n */\ngoog.net.WebChannelTransport.CLIENT_VERSION = 22;\n\n\n/**\n * Create a new WebChannel instance.\n *\n * The new WebChannel is to be opened against the server-side resource\n * as specified by the given URL. See {@link goog.net.WebChannel} for detailed\n * semantics.\n *\n * @param {string} url The URL path for the new WebChannel instance.\n * @param {!goog.net.WebChannel.Options=} opt_options Configuration for the\n *     new WebChannel instance. The configuration object is reusable after\n *     the new channel instance is created.\n * @return {!goog.net.WebChannel} the newly created WebChannel instance.\n */\ngoog.net.WebChannelTransport.prototype.createWebChannel = goog.abstractMethod;\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/**\n * Bring in closure-library dependencies\n */\n\ngoog.provide('firebase.webchannel.wrapper');\n\n// goog.net.WebChannelTransport\ngoog.require('goog.net.createWebChannelTransport');\ngoog.require('goog.net.FetchXmlHttpFactory');\ngoog.require('goog.labs.net.webChannel.requestStats');\ngoog.require('goog.labs.net.webChannel.WebChannelBaseTransport');\n\n/**\n * NOTE: The `createWebChannel` function takes an options object as a second param\n * whose properties are typically mangled. We override these in externs/overrides.js\n * Without those externs, this does not function properly.\n */\ngoog.labs.net.webChannel.WebChannelBaseTransport.prototype['createWebChannel'] =\n  goog.labs.net.webChannel.WebChannelBaseTransport.prototype.createWebChannel;\ngoog.labs.net.webChannel.WebChannelBaseTransport.Channel.prototype['send'] =\n  goog.labs.net.webChannel.WebChannelBaseTransport.Channel.prototype.send;\ngoog.labs.net.webChannel.WebChannelBaseTransport.Channel.prototype['open'] =\n  goog.labs.net.webChannel.WebChannelBaseTransport.Channel.prototype.open;\ngoog.labs.net.webChannel.WebChannelBaseTransport.Channel.prototype['close'] =\n  goog.labs.net.webChannel.WebChannelBaseTransport.Channel.prototype.close;\n\n// goog.net.ErrorCode\ngoog.require('goog.net.ErrorCode');\ngoog.net.ErrorCode['NO_ERROR'] = goog.net.ErrorCode.NO_ERROR;\ngoog.net.ErrorCode['TIMEOUT'] = goog.net.ErrorCode.TIMEOUT;\ngoog.net.ErrorCode['HTTP_ERROR'] = goog.net.ErrorCode.HTTP_ERROR;\n\n// goog.net.ErrorType\ngoog.require('goog.net.EventType');\ngoog.net.EventType['COMPLETE'] = goog.net.EventType.COMPLETE;\n\n// goog.net.WebChannel\ngoog.require('goog.net.WebChannel');\ngoog.require('goog.events.EventTarget');\ngoog.net.WebChannel['EventType'] = goog.net.WebChannel.EventType;\ngoog.net.WebChannel.EventType['OPEN'] = goog.net.WebChannel.EventType.OPEN;\ngoog.net.WebChannel.EventType['CLOSE'] = goog.net.WebChannel.EventType.CLOSE;\ngoog.net.WebChannel.EventType['ERROR'] = goog.net.WebChannel.EventType.ERROR;\ngoog.net.WebChannel.EventType['MESSAGE'] =\n  goog.net.WebChannel.EventType.MESSAGE;\ngoog.events.EventTarget.prototype['listen'] =\n  goog.events.EventTarget.prototype.listen;\n\ngoog.require('goog.net.XhrIo');\ngoog.net.XhrIo.prototype['listenOnce'] = goog.net.XhrIo.prototype.listenOnce;\ngoog.net.XhrIo.prototype['getLastError'] =\n  goog.net.XhrIo.prototype.getLastError;\ngoog.net.XhrIo.prototype['getLastErrorCode'] =\n  goog.net.XhrIo.prototype.getLastErrorCode;\ngoog.net.XhrIo.prototype['getStatus'] = goog.net.XhrIo.prototype.getStatus;\ngoog.net.XhrIo.prototype['getResponseJson'] =\n  goog.net.XhrIo.prototype.getResponseJson;\ngoog.net.XhrIo.prototype['getResponseText'] =\n  goog.net.XhrIo.prototype.getResponseText;\ngoog.net.XhrIo.prototype['send'] = goog.net.XhrIo.prototype.send;\ngoog.net.XhrIo.prototype['setWithCredentials'] =\n  goog.net.XhrIo.prototype.setWithCredentials;\n\nmodule['exports']['createWebChannelTransport'] =\n  goog.net.createWebChannelTransport;\nmodule['exports']['getStatEventTarget'] =\n  goog.labs.net.webChannel.requestStats.getStatEventTarget;\nmodule['exports']['ErrorCode'] = goog.net.ErrorCode;\nmodule['exports']['EventType'] = goog.net.EventType;\nmodule['exports']['Event'] = goog.labs.net.webChannel.requestStats.Event;\nmodule['exports']['Stat'] = goog.labs.net.webChannel.requestStats.Stat;\nmodule['exports']['FetchXmlHttpFactory'] = goog.net.FetchXmlHttpFactory;\nmodule['exports']['WebChannel'] = goog.net.WebChannel;\nmodule['exports']['XhrIo'] = goog.net.XhrIo;\n","import { _getProvider, getApp as t, _removeServiceInstance as e, _registerComponent as n, registerVersion as s, SDK_VERSION as i } from \"@firebase/app\";\n\nimport { Component as r } from \"@firebase/component\";\n\nimport { Logger as o, LogLevel as u } from \"@firebase/logger\";\n\nimport { FirebaseError as c, getUA as a, isIndexedDBAvailable as h, isSafari as l, createMockUserToken as f, getModularInstance as d, deepEqual as _, getDefaultEmulatorHostnameAndPort as w } from \"@firebase/util\";\n\nimport { XhrIo as m, EventType as g, ErrorCode as y, createWebChannelTransport as p, getStatEventTarget as I, FetchXmlHttpFactory as T, WebChannel as E, Event as A, Stat as R } from \"@firebase/webchannel-wrapper\";\n\nconst b = \"@firebase/firestore\";\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 P {\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. */ P.UNAUTHENTICATED = new P(null), \n// TODO(mikelehen): Look into getting a proper uid-equivalent for\n// non-FirebaseAuth providers.\nP.GOOGLE_CREDENTIALS = new P(\"google-credentials-uid\"), P.FIRST_PARTY = new P(\"first-party-uid\"), \nP.MOCK_USER = new P(\"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 v = \"9.16.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 V = new o(\"@firebase/firestore\");\n\n// Helper methods are needed because variables can't be exported as read/write\nfunction S() {\n    return V.logLevel;\n}\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 D(t) {\n    V.setLogLevel(t);\n}\n\nfunction C(t, ...e) {\n    if (V.logLevel <= u.DEBUG) {\n        const n = e.map(k);\n        V.debug(`Firestore (${v}): ${t}`, ...n);\n    }\n}\n\nfunction x(t, ...e) {\n    if (V.logLevel <= u.ERROR) {\n        const n = e.map(k);\n        V.error(`Firestore (${v}): ${t}`, ...n);\n    }\n}\n\n/**\n * @internal\n */ function N(t, ...e) {\n    if (V.logLevel <= u.WARN) {\n        const n = e.map(k);\n        V.warn(`Firestore (${v}): ${t}`, ...n);\n    }\n}\n\n/**\n * Converts an additional log parameter to a string representation.\n */ function k(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 O(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 (${v}) 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 x(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 M(t, e) {\n    t || O();\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 * The code of callsites invoking this function are stripped out in production\n * builds. Any side-effects of code within the debugAssert() invocation will not\n * happen in this case.\n *\n * @internal\n */ function F(t, e) {\n    t || O();\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 $(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 B = {\n    // Causes are copied from:\n    // https://github.com/grpc/grpc/blob/bceec94ea4fc5f0085d81235d8e1c06798dc341a/include/grpc%2B%2B/impl/codegen/status_code_enum.h\n    /** Not an error; returned on success. */\n    OK: \"ok\",\n    /** The operation was cancelled (typically by the caller). */\n    CANCELLED: \"cancelled\",\n    /** Unknown error or an error from a different error domain. */\n    UNKNOWN: \"unknown\",\n    /**\n     * Client specified an invalid argument. Note that this differs from\n     * FAILED_PRECONDITION. INVALID_ARGUMENT indicates arguments that are\n     * problematic regardless of the state of the system (e.g., a malformed file\n     * name).\n     */\n    INVALID_ARGUMENT: \"invalid-argument\",\n    /**\n     * Deadline expired before operation could complete. For operations that\n     * change the state of the system, this error may be returned even if the\n     * operation has completed successfully. For example, a successful response\n     * from a server could have been delayed long enough for the deadline to\n     * expire.\n     */\n    DEADLINE_EXCEEDED: \"deadline-exceeded\",\n    /** Some requested entity (e.g., file or directory) was not found. */\n    NOT_FOUND: \"not-found\",\n    /**\n     * Some entity that we attempted to create (e.g., file or directory) already\n     * exists.\n     */\n    ALREADY_EXISTS: \"already-exists\",\n    /**\n     * The caller does not have permission to execute the specified operation.\n     * PERMISSION_DENIED must not be used for rejections caused by exhausting\n     * some resource (use RESOURCE_EXHAUSTED instead for those errors).\n     * PERMISSION_DENIED must not be used if the caller can not be identified\n     * (use UNAUTHENTICATED instead for those errors).\n     */\n    PERMISSION_DENIED: \"permission-denied\",\n    /**\n     * The request does not have valid authentication credentials for the\n     * operation.\n     */\n    UNAUTHENTICATED: \"unauthenticated\",\n    /**\n     * Some resource has been exhausted, perhaps a per-user quota, or perhaps the\n     * entire file system is out of space.\n     */\n    RESOURCE_EXHAUSTED: \"resource-exhausted\",\n    /**\n     * Operation was rejected because the system is not in a state required for\n     * the operation's execution. For example, directory to be deleted may be\n     * non-empty, an rmdir operation is applied to a non-directory, etc.\n     *\n     * A litmus test that may help a service implementor in deciding\n     * between FAILED_PRECONDITION, ABORTED, and UNAVAILABLE:\n     *  (a) Use UNAVAILABLE if the client can retry just the failing call.\n     *  (b) Use ABORTED if the client should retry at a higher-level\n     *      (e.g., restarting a read-modify-write sequence).\n     *  (c) Use FAILED_PRECONDITION if the client should not retry until\n     *      the system state has been explicitly fixed. E.g., if an \"rmdir\"\n     *      fails because the directory is non-empty, FAILED_PRECONDITION\n     *      should be returned since the client should not retry unless\n     *      they have first fixed up the directory by deleting files from it.\n     *  (d) Use FAILED_PRECONDITION if the client performs conditional\n     *      REST Get/Update/Delete on a resource and the resource on the\n     *      server does not match the condition. E.g., conflicting\n     *      read-modify-write on the same resource.\n     */\n    FAILED_PRECONDITION: \"failed-precondition\",\n    /**\n     * The operation was aborted, typically due to a concurrency issue like\n     * sequencer check failures, transaction aborts, etc.\n     *\n     * See litmus test above for deciding between FAILED_PRECONDITION, ABORTED,\n     * and UNAVAILABLE.\n     */\n    ABORTED: \"aborted\",\n    /**\n     * Operation was attempted past the valid range. E.g., seeking or reading\n     * past end of file.\n     *\n     * Unlike INVALID_ARGUMENT, this error indicates a problem that may be fixed\n     * if the system state changes. For example, a 32-bit file system will\n     * generate INVALID_ARGUMENT if asked to read at an offset that is not in the\n     * range [0,2^32-1], but it will generate OUT_OF_RANGE if asked to read from\n     * an offset past the current file size.\n     *\n     * There is a fair bit of overlap between FAILED_PRECONDITION and\n     * OUT_OF_RANGE. We recommend using OUT_OF_RANGE (the more specific error)\n     * when it applies so that callers who are iterating through a space can\n     * easily look for an OUT_OF_RANGE error to detect when they are done.\n     */\n    OUT_OF_RANGE: \"out-of-range\",\n    /** Operation is not implemented or not supported/enabled in this service. */\n    UNIMPLEMENTED: \"unimplemented\",\n    /**\n     * Internal errors. Means some invariants expected by underlying System has\n     * been broken. If you see one of these errors, Something is very broken.\n     */\n    INTERNAL: \"internal\",\n    /**\n     * The service is currently unavailable. This is a most likely a transient\n     * condition and may be corrected by retrying with a backoff.\n     *\n     * See litmus test above for deciding between FAILED_PRECONDITION, ABORTED,\n     * and UNAVAILABLE.\n     */\n    UNAVAILABLE: \"unavailable\",\n    /** Unrecoverable data loss or corruption. */\n    DATA_LOSS: \"data-loss\"\n};\n\n/** An error returned by a Firestore operation. */ class L 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 q {\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 U {\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 K {\n    getToken() {\n        return Promise.resolve(null);\n    }\n    invalidateToken() {}\n    start(t, e) {\n        // Fire with initial user.\n        t.enqueueRetryable((() => e(P.UNAUTHENTICATED)));\n    }\n    shutdown() {}\n}\n\n/**\n * A CredentialsProvider that always returns a constant token. Used for\n * emulator token mocking.\n */ class G {\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\nclass Q {\n    constructor(t) {\n        this.t = t, \n        /** Tracks the current User. */\n        this.currentUser = P.UNAUTHENTICATED, \n        /**\n         * Counter used to detect if the token changed while a getToken request was\n         * outstanding.\n         */\n        this.i = 0, this.forceRefresh = !1, this.auth = null;\n    }\n    start(t, e) {\n        let n = this.i;\n        // A change listener that prevents double-firing for the same token change.\n                const s = t => this.i !== n ? (n = this.i, e(t)) : Promise.resolve();\n        // A promise that can be waited on to block on the next token change.\n        // This promise is re-created after each change.\n                let i = new q;\n        this.o = () => {\n            this.i++, this.currentUser = this.u(), i.resolve(), i = new q, t.enqueueRetryable((() => s(this.currentUser)));\n        };\n        const r = () => {\n            const e = i;\n            t.enqueueRetryable((async () => {\n                await e.promise, await s(this.currentUser);\n            }));\n        }, o = t => {\n            C(\"FirebaseAuthCredentialsProvider\", \"Auth detected\"), this.auth = t, this.auth.addAuthTokenListener(this.o), \n            r();\n        };\n        this.t.onInit((t => o(t))), \n        // Our users can initialize Auth right after Firestore, so we give it\n        // a chance to register itself with the component framework before we\n        // determine whether to start up in unauthenticated mode.\n        setTimeout((() => {\n            if (!this.auth) {\n                const t = this.t.getImmediate({\n                    optional: !0\n                });\n                t ? o(t) : (\n                // If auth is still not available, proceed with `null` user\n                C(\"FirebaseAuthCredentialsProvider\", \"Auth not yet detected\"), i.resolve(), i = new q);\n            }\n        }), 0), r();\n    }\n    getToken() {\n        // Take note of the current value of the tokenCounter so that this method\n        // can fail (with an ABORTED error) if there is a token change while the\n        // request is outstanding.\n        const t = this.i, e = this.forceRefresh;\n        return this.forceRefresh = !1, this.auth ? this.auth.getToken(e).then((e => \n        // Cancel the request since the token changed while the request was\n        // outstanding so the response is potentially for a previous user (which\n        // user, we can't be sure).\n        this.i !== t ? (C(\"FirebaseAuthCredentialsProvider\", \"getToken aborted due to token change.\"), \n        this.getToken()) : e ? (M(\"string\" == typeof e.accessToken), new U(e.accessToken, this.currentUser)) : null)) : Promise.resolve(null);\n    }\n    invalidateToken() {\n        this.forceRefresh = !0;\n    }\n    shutdown() {\n        this.auth && this.auth.removeAuthTokenListener(this.o);\n    }\n    // Auth.getUid() can return null even with a user logged in. It is because\n    // getUid() is synchronous, but the auth code populating Uid is asynchronous.\n    // This method should only be called in the AuthTokenListener callback\n    // to guarantee to get the actual user.\n    u() {\n        const t = this.auth && this.auth.getUid();\n        return M(null === t || \"string\" == typeof t), new P(t);\n    }\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 j {\n    constructor(t, e, n, s) {\n        this.h = t, this.l = e, this.m = n, this.g = s, this.type = \"FirstParty\", this.user = P.FIRST_PARTY, \n        this.p = new Map;\n    }\n    /** Gets an authorization token, using a provided factory function, or falling back to First Party GAPI. */    I() {\n        return this.g ? this.g() : (\n        // Make sure this really is a Gapi client.\n        M(!(\"object\" != typeof this.h || null === this.h || !this.h.auth || !this.h.auth.getAuthHeaderValueForFirstParty)), \n        this.h.auth.getAuthHeaderValueForFirstParty([]));\n    }\n    get headers() {\n        this.p.set(\"X-Goog-AuthUser\", this.l);\n        // Use array notation to prevent minification\n        const t = this.I();\n        return t && this.p.set(\"Authorization\", t), this.m && this.p.set(\"X-Goog-Iam-Authorization-Token\", this.m), \n        this.p;\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 W {\n    constructor(t, e, n, s) {\n        this.h = t, this.l = e, this.m = n, this.g = s;\n    }\n    getToken() {\n        return Promise.resolve(new j(this.h, this.l, this.m, this.g));\n    }\n    start(t, e) {\n        // Fire with initial uid.\n        t.enqueueRetryable((() => e(P.FIRST_PARTY)));\n    }\n    shutdown() {}\n    invalidateToken() {}\n}\n\nclass z {\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\nclass H {\n    constructor(t) {\n        this.T = t, this.forceRefresh = !1, this.appCheck = null, this.A = null;\n    }\n    start(t, e) {\n        const n = t => {\n            null != t.error && C(\"FirebaseAppCheckTokenProvider\", `Error getting App Check token; using placeholder token instead. Error: ${t.error.message}`);\n            const n = t.token !== this.A;\n            return this.A = t.token, C(\"FirebaseAppCheckTokenProvider\", `Received ${n ? \"new\" : \"existing\"} token.`), \n            n ? e(t.token) : Promise.resolve();\n        };\n        this.o = e => {\n            t.enqueueRetryable((() => n(e)));\n        };\n        const s = t => {\n            C(\"FirebaseAppCheckTokenProvider\", \"AppCheck detected\"), this.appCheck = t, this.appCheck.addTokenListener(this.o);\n        };\n        this.T.onInit((t => s(t))), \n        // Our users can initialize AppCheck after Firestore, so we give it\n        // a chance to register itself with the component framework.\n        setTimeout((() => {\n            if (!this.appCheck) {\n                const t = this.T.getImmediate({\n                    optional: !0\n                });\n                t ? s(t) : \n                // If AppCheck is still not available, proceed without it.\n                C(\"FirebaseAppCheckTokenProvider\", \"AppCheck not yet detected\");\n            }\n        }), 0);\n    }\n    getToken() {\n        const t = this.forceRefresh;\n        return this.forceRefresh = !1, this.appCheck ? this.appCheck.getToken(t).then((t => t ? (M(\"string\" == typeof t.token), \n        this.A = t.token, new z(t.token)) : null)) : Promise.resolve(null);\n    }\n    invalidateToken() {\n        this.forceRefresh = !0;\n    }\n    shutdown() {\n        this.appCheck && this.appCheck.removeTokenListener(this.o);\n    }\n}\n\n/**\n * An AppCheck token provider that always yields an empty token.\n * @internal\n */ class J {\n    getToken() {\n        return Promise.resolve(new z(\"\"));\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 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 */\nfunction Y(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 X {\n    static R() {\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 s = Y(40);\n            for (let i = 0; i < s.length; ++i) \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 && s[i] < e && (n += t.charAt(s[i] % t.length));\n        }\n        return n;\n    }\n}\n\nfunction Z(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, s) => n(t, e[s])));\n}\n\n/**\n * Returns the immediate lexicographically-following string. This is useful to\n * construct an inclusive range for indexeddb iterators.\n */ function et(t) {\n    // Return the input string, with an additional NUL byte appended.\n    return t + \"\\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// 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 nt {\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 L(B.INVALID_ARGUMENT, \"Timestamp nanoseconds out of range: \" + e);\n        if (e >= 1e9) throw new L(B.INVALID_ARGUMENT, \"Timestamp nanoseconds out of range: \" + e);\n        if (t < -62135596800) throw new L(B.INVALID_ARGUMENT, \"Timestamp seconds out of range: \" + t);\n        // This will break in the year 10,000.\n                if (t >= 253402300800) throw new L(B.INVALID_ARGUMENT, \"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 nt.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 nt.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 nt(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 ? Z(this.nanoseconds, t.nanoseconds) : Z(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 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 st {\n    constructor(t) {\n        this.timestamp = t;\n    }\n    static fromTimestamp(t) {\n        return new st(t);\n    }\n    static min() {\n        return new st(new nt(0, 0));\n    }\n    static max() {\n        return new st(new nt(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/**\n * Path represents an ordered sequence of string segments.\n */\nclass it {\n    constructor(t, e, n) {\n        void 0 === e ? e = 0 : e > t.length && O(), void 0 === n ? n = t.length - e : n > t.length - e && O(), \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 === it.comparator(this, t);\n    }\n    child(t) {\n        const e = this.segments.slice(this.offset, this.limit());\n        return t instanceof it ? 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 s = 0; s < n; s++) {\n            const n = t.get(s), i = e.get(s);\n            if (n < i) return -1;\n            if (n > i) 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 rt extends it {\n    construct(t, e, n) {\n        return new rt(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 L(B.INVALID_ARGUMENT, `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 rt(e);\n    }\n    static emptyPath() {\n        return new rt([]);\n    }\n}\n\nconst ot = /^[_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 ut extends it {\n    construct(t, e, n) {\n        return new ut(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 ot.test(t);\n    }\n    canonicalString() {\n        return this.toArray().map((t => (t = t.replace(/\\\\/g, \"\\\\\\\\\").replace(/`/g, \"\\\\`\"), \n        ut.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 ut([ \"__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 = \"\", s = 0;\n        const i = () => {\n            if (0 === n.length) throw new L(B.INVALID_ARGUMENT, `Invalid field path (${t}). Paths must not be empty, begin with '.', end with '.', or contain '..'`);\n            e.push(n), n = \"\";\n        };\n        let r = !1;\n        for (;s < t.length; ) {\n            const e = t[s];\n            if (\"\\\\\" === e) {\n                if (s + 1 === t.length) throw new L(B.INVALID_ARGUMENT, \"Path has trailing escape character: \" + t);\n                const e = t[s + 1];\n                if (\"\\\\\" !== e && \".\" !== e && \"`\" !== e) throw new L(B.INVALID_ARGUMENT, \"Path has invalid escape sequence: \" + t);\n                n += e, s += 2;\n            } else \"`\" === e ? (r = !r, s++) : \".\" !== e || r ? (n += e, s++) : (i(), s++);\n        }\n        if (i(), r) throw new L(B.INVALID_ARGUMENT, \"Unterminated ` in path: \" + t);\n        return new ut(e);\n    }\n    static emptyPath() {\n        return new ut([]);\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 ct {\n    constructor(t) {\n        this.path = t;\n    }\n    static fromPath(t) {\n        return new ct(rt.fromString(t));\n    }\n    static fromName(t) {\n        return new ct(rt.fromString(t).popFirst(5));\n    }\n    static empty() {\n        return new ct(rt.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 === rt.comparator(this.path, t.path);\n    }\n    toString() {\n        return this.path.toString();\n    }\n    static comparator(t, e) {\n        return rt.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 ct(new rt(t.slice()));\n    }\n}\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/**\n * The initial mutation batch id for each index. Gets updated during index\n * backfill.\n */\n/**\n * An index definition for field indexes in Firestore.\n *\n * Every index is associated with a collection. The definition contains a list\n * of fields and their index kind (which can be `ASCENDING`, `DESCENDING` or\n * `CONTAINS` for ArrayContains/ArrayContainsAny queries).\n *\n * Unlike the backend, the SDK does not differentiate between collection or\n * collection group-scoped indices. Every index can be used for both single\n * collection and collection group queries.\n */\nclass at {\n    constructor(\n    /**\n     * The index ID. Returns -1 if the index ID is not available (e.g. the index\n     * has not yet been persisted).\n     */\n    t, \n    /** The collection ID this index applies to. */\n    e, \n    /** The field segments for this index. */\n    n, \n    /** Shows how up-to-date the index is for the current user. */\n    s) {\n        this.indexId = t, this.collectionGroup = e, this.fields = n, this.indexState = s;\n    }\n}\n\n/** An ID for an index that has not yet been added to persistence.  */\n/** Returns the ArrayContains/ArrayContainsAny segment for this index. */\nfunction ht(t) {\n    return t.fields.find((t => 2 /* IndexKind.CONTAINS */ === t.kind));\n}\n\n/** Returns all directional (ascending/descending) segments for this index. */ function lt(t) {\n    return t.fields.filter((t => 2 /* IndexKind.CONTAINS */ !== t.kind));\n}\n\n/**\n * Returns the order of the document key component for the given index.\n *\n * PORTING NOTE: This is only used in the Web IndexedDb implementation.\n */\n/**\n * Compares indexes by collection group and segments. Ignores update time and\n * index ID.\n */\nfunction ft(t, e) {\n    let n = Z(t.collectionGroup, e.collectionGroup);\n    if (0 !== n) return n;\n    for (let s = 0; s < Math.min(t.fields.length, e.fields.length); ++s) if (n = _t(t.fields[s], e.fields[s]), \n    0 !== n) return n;\n    return Z(t.fields.length, e.fields.length);\n}\n\n/** Returns a debug representation of the field index */ at.UNKNOWN_ID = -1;\n\n/** An index component consisting of field path and index type.  */\nclass dt {\n    constructor(\n    /** The field path of the component. */\n    t, \n    /** The fields sorting order. */\n    e) {\n        this.fieldPath = t, this.kind = e;\n    }\n}\n\nfunction _t(t, e) {\n    const n = ut.comparator(t.fieldPath, e.fieldPath);\n    return 0 !== n ? n : Z(t.kind, e.kind);\n}\n\n/**\n * Stores the \"high water mark\" that indicates how updated the Index is for the\n * current user.\n */ class wt {\n    constructor(\n    /**\n     * Indicates when the index was last updated (relative to other indexes).\n     */\n    t, \n    /** The the latest indexed read time, document and batch id. */\n    e) {\n        this.sequenceNumber = t, this.offset = e;\n    }\n    /** The state of an index that has not yet been backfilled. */    static empty() {\n        return new wt(0, yt.min());\n    }\n}\n\n/**\n * Creates an offset that matches all documents with a read time higher than\n * `readTime`.\n */ function mt(t, e) {\n    // We want to create an offset that matches all documents with a read time\n    // greater than the provided read time. To do so, we technically need to\n    // create an offset for `(readTime, MAX_DOCUMENT_KEY)`. While we could use\n    // Unicode codepoints to generate MAX_DOCUMENT_KEY, it is much easier to use\n    // `(readTime + 1, DocumentKey.empty())` since `> DocumentKey.empty()` matches\n    // all valid document IDs.\n    const n = t.toTimestamp().seconds, s = t.toTimestamp().nanoseconds + 1, i = st.fromTimestamp(1e9 === s ? new nt(n + 1, 0) : new nt(n, s));\n    return new yt(i, ct.empty(), e);\n}\n\n/** Creates a new offset based on the provided document. */ function gt(t) {\n    return new yt(t.readTime, t.key, -1);\n}\n\n/**\n * Stores the latest read time, document and batch ID that were processed for an\n * index.\n */ class yt {\n    constructor(\n    /**\n     * The latest read time version that has been indexed by Firestore for this\n     * field index.\n     */\n    t, \n    /**\n     * The key of the last document that was indexed for this query. Use\n     * `DocumentKey.empty()` if no document has been indexed.\n     */\n    e, \n    /*\n     * The largest mutation batch id that's been processed by Firestore.\n     */\n    n) {\n        this.readTime = t, this.documentKey = e, this.largestBatchId = n;\n    }\n    /** Returns an offset that sorts before all regular offsets. */    static min() {\n        return new yt(st.min(), ct.empty(), -1);\n    }\n    /** Returns an offset that sorts after all regular offsets. */    static max() {\n        return new yt(st.max(), ct.empty(), -1);\n    }\n}\n\nfunction pt(t, e) {\n    let n = t.readTime.compareTo(e.readTime);\n    return 0 !== n ? n : (n = ct.comparator(t.documentKey, e.documentKey), 0 !== n ? n : Z(t.largestBatchId, e.largestBatchId));\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 It = \"The current tab is not in the required state to perform this operation. It might be necessary to refresh the browser tab.\";\n\n/**\n * A base class representing a persistence transaction, encapsulating both the\n * transaction's sequence numbers as well as a list of onCommitted listeners.\n *\n * When you call Persistence.runTransaction(), it will create a transaction and\n * pass it to your callback. You then pass it to any method that operates\n * on persistence.\n */ class Tt {\n    constructor() {\n        this.onCommittedListeners = [];\n    }\n    addOnCommittedListener(t) {\n        this.onCommittedListeners.push(t);\n    }\n    raiseOnCommittedEvent() {\n        this.onCommittedListeners.forEach((t => 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 * Verifies the error thrown by a LocalStore operation. If a LocalStore\n * operation fails because the primary lease has been taken by another client,\n * we ignore the error (the persistence layer will immediately call\n * `applyPrimaryLease` to propagate the primary state change). All other errors\n * are re-thrown.\n *\n * @param err - An error returned by a LocalStore operation.\n * @returns A Promise that resolves after we recovered, or the original error.\n */ async function Et(t) {\n    if (t.code !== B.FAILED_PRECONDITION || t.message !== It) throw t;\n    C(\"LocalStore\", \"Unexpectedly lost primary lease\");\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 * PersistencePromise is essentially a re-implementation of Promise except\n * it has a .next() method instead of .then() and .next() and .catch() callbacks\n * are executed synchronously when a PersistencePromise resolves rather than\n * asynchronously (Promise implementations use setImmediate() or similar).\n *\n * This is necessary to interoperate with IndexedDB which will automatically\n * commit transactions if control is returned to the event loop without\n * synchronously initiating another operation on the transaction.\n *\n * NOTE: .then() and .catch() only allow a single consumer, unlike normal\n * Promises.\n */ class At {\n    constructor(t) {\n        // NOTE: next/catchCallback will always point to our own wrapper functions,\n        // not the user's raw next() or catch() callbacks.\n        this.nextCallback = null, this.catchCallback = null, \n        // When the operation resolves, we'll set result or error and mark isDone.\n        this.result = void 0, this.error = void 0, this.isDone = !1, \n        // Set to true when .then() or .catch() are called and prevents additional\n        // chaining.\n        this.callbackAttached = !1, t((t => {\n            this.isDone = !0, this.result = t, this.nextCallback && \n            // value should be defined unless T is Void, but we can't express\n            // that in the type system.\n            this.nextCallback(t);\n        }), (t => {\n            this.isDone = !0, this.error = t, this.catchCallback && this.catchCallback(t);\n        }));\n    }\n    catch(t) {\n        return this.next(void 0, t);\n    }\n    next(t, e) {\n        return this.callbackAttached && O(), this.callbackAttached = !0, this.isDone ? this.error ? this.wrapFailure(e, this.error) : this.wrapSuccess(t, this.result) : new At(((n, s) => {\n            this.nextCallback = e => {\n                this.wrapSuccess(t, e).next(n, s);\n            }, this.catchCallback = t => {\n                this.wrapFailure(e, t).next(n, s);\n            };\n        }));\n    }\n    toPromise() {\n        return new Promise(((t, e) => {\n            this.next(t, e);\n        }));\n    }\n    wrapUserFunction(t) {\n        try {\n            const e = t();\n            return e instanceof At ? e : At.resolve(e);\n        } catch (t) {\n            return At.reject(t);\n        }\n    }\n    wrapSuccess(t, e) {\n        return t ? this.wrapUserFunction((() => t(e))) : At.resolve(e);\n    }\n    wrapFailure(t, e) {\n        return t ? this.wrapUserFunction((() => t(e))) : At.reject(e);\n    }\n    static resolve(t) {\n        return new At(((e, n) => {\n            e(t);\n        }));\n    }\n    static reject(t) {\n        return new At(((e, n) => {\n            n(t);\n        }));\n    }\n    static waitFor(\n    // Accept all Promise types in waitFor().\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    t) {\n        return new At(((e, n) => {\n            let s = 0, i = 0, r = !1;\n            t.forEach((t => {\n                ++s, t.next((() => {\n                    ++i, r && i === s && e();\n                }), (t => n(t)));\n            })), r = !0, i === s && e();\n        }));\n    }\n    /**\n     * Given an array of predicate functions that asynchronously evaluate to a\n     * boolean, implements a short-circuiting `or` between the results. Predicates\n     * will be evaluated until one of them returns `true`, then stop. The final\n     * result will be whether any of them returned `true`.\n     */    static or(t) {\n        let e = At.resolve(!1);\n        for (const n of t) e = e.next((t => t ? At.resolve(t) : n()));\n        return e;\n    }\n    static forEach(t, e) {\n        const n = [];\n        return t.forEach(((t, s) => {\n            n.push(e.call(this, t, s));\n        })), this.waitFor(n);\n    }\n    /**\n     * Concurrently map all array elements through asynchronous function.\n     */    static mapArray(t, e) {\n        return new At(((n, s) => {\n            const i = t.length, r = new Array(i);\n            let o = 0;\n            for (let u = 0; u < i; u++) {\n                const c = u;\n                e(t[c]).next((t => {\n                    r[c] = t, ++o, o === i && n(r);\n                }), (t => s(t)));\n            }\n        }));\n    }\n    /**\n     * An alternative to recursive PersistencePromise calls, that avoids\n     * potential memory problems from unbounded chains of promises.\n     *\n     * The `action` will be called repeatedly while `condition` is true.\n     */    static doWhile(t, e) {\n        return new At(((n, s) => {\n            const i = () => {\n                !0 === t() ? e().next((() => {\n                    i();\n                }), s) : n();\n            };\n            i();\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 */\n// References to `window` are guarded by SimpleDb.isAvailable()\n/* eslint-disable no-restricted-globals */\n/**\n * Wraps an IDBTransaction and exposes a store() method to get a handle to a\n * specific object store.\n */\nclass Rt {\n    constructor(t, e) {\n        this.action = t, this.transaction = e, this.aborted = !1, \n        /**\n         * A `Promise` that resolves with the result of the IndexedDb transaction.\n         */\n        this.P = new q, this.transaction.oncomplete = () => {\n            this.P.resolve();\n        }, this.transaction.onabort = () => {\n            e.error ? this.P.reject(new vt(t, e.error)) : this.P.resolve();\n        }, this.transaction.onerror = e => {\n            const n = xt(e.target.error);\n            this.P.reject(new vt(t, n));\n        };\n    }\n    static open(t, e, n, s) {\n        try {\n            return new Rt(e, t.transaction(s, n));\n        } catch (t) {\n            throw new vt(e, t);\n        }\n    }\n    get v() {\n        return this.P.promise;\n    }\n    abort(t) {\n        t && this.P.reject(t), this.aborted || (C(\"SimpleDb\", \"Aborting transaction:\", t ? t.message : \"Client-initiated abort\"), \n        this.aborted = !0, this.transaction.abort());\n    }\n    V() {\n        // If the browser supports V3 IndexedDB, we invoke commit() explicitly to\n        // speed up index DB processing if the event loop remains blocks.\n        // eslint-disable-next-line @typescript-eslint/no-explicit-any\n        const t = this.transaction;\n        this.aborted || \"function\" != typeof t.commit || t.commit();\n    }\n    /**\n     * Returns a SimpleDbStore<KeyType, ValueType> for the specified store. All\n     * operations performed on the SimpleDbStore happen within the context of this\n     * transaction and it cannot be used anymore once the transaction is\n     * completed.\n     *\n     * Note that we can't actually enforce that the KeyType and ValueType are\n     * correct, but they allow type safety through the rest of the consuming code.\n     */    store(t) {\n        const e = this.transaction.objectStore(t);\n        return new St(e);\n    }\n}\n\n/**\n * Provides a wrapper around IndexedDb with a simplified interface that uses\n * Promise-like return values to chain operations. Real promises cannot be used\n * since .then() continuations are executed asynchronously (e.g. via\n * .setImmediate), which would cause IndexedDB to end the transaction.\n * See PersistencePromise for more details.\n */ class bt {\n    /*\n     * Creates a new SimpleDb wrapper for IndexedDb database `name`.\n     *\n     * Note that `version` must not be a downgrade. IndexedDB does not support\n     * downgrading the schema version. We currently do not support any way to do\n     * versioning outside of IndexedDB's versioning mechanism, as only\n     * version-upgrade transactions are allowed to do things like create\n     * objectstores.\n     */\n    constructor(t, e, n) {\n        this.name = t, this.version = e, this.S = n;\n        // NOTE: According to https://bugs.webkit.org/show_bug.cgi?id=197050, the\n        // bug we're checking for should exist in iOS >= 12.2 and < 13, but for\n        // whatever reason it's much harder to hit after 12.2 so we only proactively\n        // log on 12.2.\n        12.2 === bt.D(a()) && x(\"Firestore persistence suffers from a bug in iOS 12.2 Safari that may cause your app to stop working. See https://stackoverflow.com/q/56496296/110915 for details and a potential workaround.\");\n    }\n    /** Deletes the specified database. */    static delete(t) {\n        return C(\"SimpleDb\", \"Removing database:\", t), Dt(window.indexedDB.deleteDatabase(t)).toPromise();\n    }\n    /** Returns true if IndexedDB is available in the current environment. */    static C() {\n        if (!h()) return !1;\n        if (bt.N()) return !0;\n        // We extensively use indexed array values and compound keys,\n        // which IE and Edge do not support. However, they still have indexedDB\n        // defined on the window, so we need to check for them here and make sure\n        // to return that persistence is not enabled for those browsers.\n        // For tracking support of this feature, see here:\n        // https://developer.microsoft.com/en-us/microsoft-edge/platform/status/indexeddbarraysandmultientrysupport/\n        // Check the UA string to find out the browser.\n                const t = a(), e = bt.D(t), n = 0 < e && e < 10, s = bt.k(t), i = 0 < s && s < 4.5;\n        // IE 10\n        // ua = 'Mozilla/5.0 (compatible; MSIE 10.0; Windows NT 6.2; Trident/6.0)';\n        // IE 11\n        // ua = 'Mozilla/5.0 (Windows NT 6.3; Trident/7.0; rv:11.0) like Gecko';\n        // Edge\n        // ua = 'Mozilla/5.0 (Windows NT 10.0; WOW64) AppleWebKit/537.36 (KHTML,\n        // like Gecko) Chrome/39.0.2171.71 Safari/537.36 Edge/12.0';\n        // iOS Safari: Disable for users running iOS version < 10.\n                return !(t.indexOf(\"MSIE \") > 0 || t.indexOf(\"Trident/\") > 0 || t.indexOf(\"Edge/\") > 0 || n || i);\n    }\n    /**\n     * Returns true if the backing IndexedDB store is the Node IndexedDBShim\n     * (see https://github.com/axemclion/IndexedDBShim).\n     */    static N() {\n        var t;\n        return \"undefined\" != typeof process && \"YES\" === (null === (t = process.env) || void 0 === t ? void 0 : t.O);\n    }\n    /** Helper to get a typed SimpleDbStore from a transaction. */    static M(t, e) {\n        return t.store(e);\n    }\n    // visible for testing\n    /** Parse User Agent to determine iOS version. Returns -1 if not found. */\n    static D(t) {\n        const e = t.match(/i(?:phone|pad|pod) os ([\\d_]+)/i), n = e ? e[1].split(\"_\").slice(0, 2).join(\".\") : \"-1\";\n        return Number(n);\n    }\n    // visible for testing\n    /** Parse User Agent to determine Android version. Returns -1 if not found. */\n    static k(t) {\n        const e = t.match(/Android ([\\d.]+)/i), n = e ? e[1].split(\".\").slice(0, 2).join(\".\") : \"-1\";\n        return Number(n);\n    }\n    /**\n     * Opens the specified database, creating or upgrading it if necessary.\n     */    async F(t) {\n        return this.db || (C(\"SimpleDb\", \"Opening database:\", this.name), this.db = await new Promise(((e, n) => {\n            // TODO(mikelehen): Investigate browser compatibility.\n            // https://developer.mozilla.org/en-US/docs/Web/API/IndexedDB_API/Using_IndexedDB\n            // suggests IE9 and older WebKit browsers handle upgrade\n            // differently. They expect setVersion, as described here:\n            // https://developer.mozilla.org/en-US/docs/Web/API/IDBVersionChangeRequest/setVersion\n            const s = indexedDB.open(this.name, this.version);\n            s.onsuccess = t => {\n                const n = t.target.result;\n                e(n);\n            }, s.onblocked = () => {\n                n(new vt(t, \"Cannot upgrade IndexedDB schema while another tab is open. Close all tabs that access Firestore and reload this page to proceed.\"));\n            }, s.onerror = e => {\n                const s = e.target.error;\n                \"VersionError\" === s.name ? n(new L(B.FAILED_PRECONDITION, \"A newer version of the Firestore SDK was previously used and so the persisted data is not compatible with the version of the SDK you are now using. The SDK will operate with persistence disabled. If you need persistence, please re-upgrade to a newer version of the SDK or else clear the persisted IndexedDB data for your app to start fresh.\")) : \"InvalidStateError\" === s.name ? n(new L(B.FAILED_PRECONDITION, \"Unable to open an IndexedDB connection. This could be due to running in a private browsing session on a browser whose private browsing sessions do not support IndexedDB: \" + s)) : n(new vt(t, s));\n            }, s.onupgradeneeded = t => {\n                C(\"SimpleDb\", 'Database \"' + this.name + '\" requires upgrade from version:', t.oldVersion);\n                const e = t.target.result;\n                this.S.$(e, s.transaction, t.oldVersion, this.version).next((() => {\n                    C(\"SimpleDb\", \"Database upgrade to version \" + this.version + \" complete\");\n                }));\n            };\n        }))), this.B && (this.db.onversionchange = t => this.B(t)), this.db;\n    }\n    L(t) {\n        this.B = t, this.db && (this.db.onversionchange = e => t(e));\n    }\n    async runTransaction(t, e, n, s) {\n        const i = \"readonly\" === e;\n        let r = 0;\n        for (;;) {\n            ++r;\n            try {\n                this.db = await this.F(t);\n                const e = Rt.open(this.db, t, i ? \"readonly\" : \"readwrite\", n), r = s(e).next((t => (e.V(), \n                t))).catch((t => (\n                // Abort the transaction if there was an error.\n                e.abort(t), At.reject(t)))).toPromise();\n                // As noted above, errors are propagated by aborting the transaction. So\n                // we swallow any error here to avoid the browser logging it as unhandled.\n                return r.catch((() => {})), \n                // Wait for the transaction to complete (i.e. IndexedDb's onsuccess event to\n                // fire), but still return the original transactionFnResult back to the\n                // caller.\n                await e.v, r;\n            } catch (t) {\n                const e = t, n = \"FirebaseError\" !== e.name && r < 3;\n                // TODO(schmidt-sebastian): We could probably be smarter about this and\n                // not retry exceptions that are likely unrecoverable (such as quota\n                // exceeded errors).\n                // Note: We cannot use an instanceof check for FirestoreException, since the\n                // exception is wrapped in a generic error by our async/await handling.\n                                if (C(\"SimpleDb\", \"Transaction failed with error:\", e.message, \"Retrying:\", n), \n                this.close(), !n) return Promise.reject(e);\n            }\n        }\n    }\n    close() {\n        this.db && this.db.close(), this.db = void 0;\n    }\n}\n\n/**\n * A controller for iterating over a key range or index. It allows an iterate\n * callback to delete the currently-referenced object, or jump to a new key\n * within the key range or index.\n */ class Pt {\n    constructor(t) {\n        this.q = t, this.U = !1, this.K = null;\n    }\n    get isDone() {\n        return this.U;\n    }\n    get G() {\n        return this.K;\n    }\n    set cursor(t) {\n        this.q = t;\n    }\n    /**\n     * This function can be called to stop iteration at any point.\n     */    done() {\n        this.U = !0;\n    }\n    /**\n     * This function can be called to skip to that next key, which could be\n     * an index or a primary key.\n     */    j(t) {\n        this.K = t;\n    }\n    /**\n     * Delete the current cursor value from the object store.\n     *\n     * NOTE: You CANNOT do this with a keysOnly query.\n     */    delete() {\n        return Dt(this.q.delete());\n    }\n}\n\n/** An error that wraps exceptions that thrown during IndexedDB execution. */ class vt extends L {\n    constructor(t, e) {\n        super(B.UNAVAILABLE, `IndexedDB transaction '${t}' failed: ${e}`), this.name = \"IndexedDbTransactionError\";\n    }\n}\n\n/** Verifies whether `e` is an IndexedDbTransactionError. */ function Vt(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/**\n * A wrapper around an IDBObjectStore providing an API that:\n *\n * 1) Has generic KeyType / ValueType parameters to provide strongly-typed\n * methods for acting against the object store.\n * 2) Deals with IndexedDB's onsuccess / onerror event callbacks, making every\n * method return a PersistencePromise instead.\n * 3) Provides a higher-level API to avoid needing to do excessive wrapping of\n * intermediate IndexedDB types (IDBCursorWithValue, etc.)\n */ class St {\n    constructor(t) {\n        this.store = t;\n    }\n    put(t, e) {\n        let n;\n        return void 0 !== e ? (C(\"SimpleDb\", \"PUT\", this.store.name, t, e), n = this.store.put(e, t)) : (C(\"SimpleDb\", \"PUT\", this.store.name, \"<auto-key>\", t), \n        n = this.store.put(t)), Dt(n);\n    }\n    /**\n     * Adds a new value into an Object Store and returns the new key. Similar to\n     * IndexedDb's `add()`, this method will fail on primary key collisions.\n     *\n     * @param value - The object to write.\n     * @returns The key of the value to add.\n     */    add(t) {\n        C(\"SimpleDb\", \"ADD\", this.store.name, t, t);\n        return Dt(this.store.add(t));\n    }\n    /**\n     * Gets the object with the specified key from the specified store, or null\n     * if no object exists with the specified key.\n     *\n     * @key The key of the object to get.\n     * @returns The object with the specified key or null if no object exists.\n     */    get(t) {\n        // We're doing an unsafe cast to ValueType.\n        // eslint-disable-next-line @typescript-eslint/no-explicit-any\n        return Dt(this.store.get(t)).next((e => (\n        // Normalize nonexistence to null.\n        void 0 === e && (e = null), C(\"SimpleDb\", \"GET\", this.store.name, t, e), e)));\n    }\n    delete(t) {\n        C(\"SimpleDb\", \"DELETE\", this.store.name, t);\n        return Dt(this.store.delete(t));\n    }\n    /**\n     * If we ever need more of the count variants, we can add overloads. For now,\n     * all we need is to count everything in a store.\n     *\n     * Returns the number of rows in the store.\n     */    count() {\n        C(\"SimpleDb\", \"COUNT\", this.store.name);\n        return Dt(this.store.count());\n    }\n    W(t, e) {\n        const n = this.options(t, e);\n        // Use `getAll()` if the browser supports IndexedDB v3, as it is roughly\n        // 20% faster. Unfortunately, getAll() does not support custom indices.\n                if (n.index || \"function\" != typeof this.store.getAll) {\n            const t = this.cursor(n), e = [];\n            return this.H(t, ((t, n) => {\n                e.push(n);\n            })).next((() => e));\n        }\n        {\n            const t = this.store.getAll(n.range);\n            return new At(((e, n) => {\n                t.onerror = t => {\n                    n(t.target.error);\n                }, t.onsuccess = t => {\n                    e(t.target.result);\n                };\n            }));\n        }\n    }\n    /**\n     * Loads the first `count` elements from the provided index range. Loads all\n     * elements if no limit is provided.\n     */    J(t, e) {\n        const n = this.store.getAll(t, null === e ? void 0 : e);\n        return new At(((t, e) => {\n            n.onerror = t => {\n                e(t.target.error);\n            }, n.onsuccess = e => {\n                t(e.target.result);\n            };\n        }));\n    }\n    Y(t, e) {\n        C(\"SimpleDb\", \"DELETE ALL\", this.store.name);\n        const n = this.options(t, e);\n        n.X = !1;\n        const s = this.cursor(n);\n        return this.H(s, ((t, e, n) => n.delete()));\n    }\n    Z(t, e) {\n        let n;\n        e ? n = t : (n = {}, e = t);\n        const s = this.cursor(n);\n        return this.H(s, e);\n    }\n    /**\n     * Iterates over a store, but waits for the given callback to complete for\n     * each entry before iterating the next entry. This allows the callback to do\n     * asynchronous work to determine if this iteration should continue.\n     *\n     * The provided callback should return `true` to continue iteration, and\n     * `false` otherwise.\n     */    tt(t) {\n        const e = this.cursor({});\n        return new At(((n, s) => {\n            e.onerror = t => {\n                const e = xt(t.target.error);\n                s(e);\n            }, e.onsuccess = e => {\n                const s = e.target.result;\n                s ? t(s.primaryKey, s.value).next((t => {\n                    t ? s.continue() : n();\n                })) : n();\n            };\n        }));\n    }\n    H(t, e) {\n        const n = [];\n        return new At(((s, i) => {\n            t.onerror = t => {\n                i(t.target.error);\n            }, t.onsuccess = t => {\n                const i = t.target.result;\n                if (!i) return void s();\n                const r = new Pt(i), o = e(i.primaryKey, i.value, r);\n                if (o instanceof At) {\n                    const t = o.catch((t => (r.done(), At.reject(t))));\n                    n.push(t);\n                }\n                r.isDone ? s() : null === r.G ? i.continue() : i.continue(r.G);\n            };\n        })).next((() => At.waitFor(n)));\n    }\n    options(t, e) {\n        let n;\n        return void 0 !== t && (\"string\" == typeof t ? n = t : e = t), {\n            index: n,\n            range: e\n        };\n    }\n    cursor(t) {\n        let e = \"next\";\n        if (t.reverse && (e = \"prev\"), t.index) {\n            const n = this.store.index(t.index);\n            return t.X ? n.openKeyCursor(t.range, e) : n.openCursor(t.range, e);\n        }\n        return this.store.openCursor(t.range, e);\n    }\n}\n\n/**\n * Wraps an IDBRequest in a PersistencePromise, using the onsuccess / onerror\n * handlers to resolve / reject the PersistencePromise as appropriate.\n */ function Dt(t) {\n    return new At(((e, n) => {\n        t.onsuccess = t => {\n            const n = t.target.result;\n            e(n);\n        }, t.onerror = t => {\n            const e = xt(t.target.error);\n            n(e);\n        };\n    }));\n}\n\n// Guard so we only report the error once.\nlet Ct = !1;\n\nfunction xt(t) {\n    const e = bt.D(a());\n    if (e >= 12.2 && e < 13) {\n        const e = \"An internal error was encountered in the Indexed Database server\";\n        if (t.message.indexOf(e) >= 0) {\n            // Wrap error in a more descriptive one.\n            const t = new L(\"internal\", `IOS_INDEXEDDB_BUG1: IndexedDb has thrown '${e}'. This is likely due to an unavoidable bug in iOS. See https://stackoverflow.com/q/56496296/110915 for details and a potential workaround.`);\n            return Ct || (Ct = !0, \n            // Throw a global exception outside of this promise chain, for the user to\n            // potentially catch.\n            setTimeout((() => {\n                throw t;\n            }), 0)), t;\n        }\n    }\n    return t;\n}\n\n/** This class is responsible for the scheduling of Index Backfiller. */\nclass Nt {\n    constructor(t, e) {\n        this.asyncQueue = t, this.et = e, this.task = null;\n    }\n    start() {\n        this.nt(15e3);\n    }\n    stop() {\n        this.task && (this.task.cancel(), this.task = null);\n    }\n    get started() {\n        return null !== this.task;\n    }\n    nt(t) {\n        C(\"IndexBackiller\", `Scheduled in ${t}ms`), this.task = this.asyncQueue.enqueueAfterDelay(\"index_backfill\" /* TimerId.IndexBackfill */ , t, (async () => {\n            this.task = null;\n            try {\n                C(\"IndexBackiller\", `Documents written: ${await this.et.st()}`);\n            } catch (t) {\n                Vt(t) ? C(\"IndexBackiller\", \"Ignoring IndexedDB error during index backfill: \", t) : await Et(t);\n            }\n            await this.nt(6e4);\n        }));\n    }\n}\n\n/** Implements the steps for backfilling indexes. */ class kt {\n    constructor(\n    /**\n     * LocalStore provides access to IndexManager and LocalDocumentView.\n     * These properties will update when the user changes. Consequently,\n     * making a local copy of IndexManager and LocalDocumentView will require\n     * updates over time. The simpler solution is to rely on LocalStore to have\n     * an up-to-date references to IndexManager and LocalDocumentStore.\n     */\n    t, e) {\n        this.localStore = t, this.persistence = e;\n    }\n    async st(t = 50) {\n        return this.persistence.runTransaction(\"Backfill Indexes\", \"readwrite-primary\", (e => this.it(e, t)));\n    }\n    /** Writes index entries until the cap is reached. Returns the number of documents processed. */    it(t, e) {\n        const n = new Set;\n        let s = e, i = !0;\n        return At.doWhile((() => !0 === i && s > 0), (() => this.localStore.indexManager.getNextCollectionGroupToUpdate(t).next((e => {\n            if (null !== e && !n.has(e)) return C(\"IndexBackiller\", `Processing collection: ${e}`), \n            this.rt(t, e, s).next((t => {\n                s -= t, n.add(e);\n            }));\n            i = !1;\n        })))).next((() => e - s));\n    }\n    /**\n     * Writes entries for the provided collection group. Returns the number of documents processed.\n     */    rt(t, e, n) {\n        // Use the earliest offset of all field indexes to query the local cache.\n        return this.localStore.indexManager.getMinOffsetFromCollectionGroup(t, e).next((s => this.localStore.localDocuments.getNextDocuments(t, e, s, n).next((n => {\n            const i = n.changes;\n            return this.localStore.indexManager.updateIndexEntries(t, i).next((() => this.ot(s, n))).next((n => (C(\"IndexBackiller\", `Updating offset: ${n}`), \n            this.localStore.indexManager.updateCollectionGroup(t, e, n)))).next((() => i.size));\n        }))));\n    }\n    /** Returns the next offset based on the provided documents. */    ot(t, e) {\n        let n = t;\n        return e.changes.forEach(((t, e) => {\n            const s = gt(e);\n            pt(s, n) > 0 && (n = s);\n        })), new yt(n.readTime, n.documentKey, Math.max(e.batchId, t.largestBatchId));\n    }\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/**\n * `ListenSequence` is a monotonic sequence. It is initialized with a minimum value to\n * exceed. All subsequent calls to next will return increasing values. If provided with a\n * `SequenceNumberSyncer`, it will additionally bump its next value when told of a new value, as\n * well as write out sequence numbers that it produces via `next()`.\n */ class Ot {\n    constructor(t, e) {\n        this.previousValue = t, e && (e.sequenceNumberHandler = t => this.ut(t), this.ct = t => e.writeSequenceNumber(t));\n    }\n    ut(t) {\n        return this.previousValue = Math.max(t, this.previousValue), this.previousValue;\n    }\n    next() {\n        const t = ++this.previousValue;\n        return this.ct && this.ct(t), t;\n    }\n}\n\nOt.at = -1;\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 Mt {\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 useFetchStreams Whether to use the Fetch API instead of\n     * XMLHTTPRequest\n     */\n    constructor(t, e, n, s, i, r, o, u) {\n        this.databaseId = t, this.appId = e, this.persistenceKey = n, this.host = s, this.ssl = i, \n        this.forceLongPolling = r, this.autoDetectLongPolling = o, this.useFetchStreams = u;\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 Ft {\n    constructor(t, e) {\n        this.projectId = t, this.database = e || \"(default)\";\n    }\n    static empty() {\n        return new Ft(\"\", \"\");\n    }\n    get isDefaultDatabase() {\n        return \"(default)\" === this.database;\n    }\n    isEqual(t) {\n        return t instanceof Ft && t.projectId === this.projectId && t.database === this.database;\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 */\nfunction $t(t) {\n    let e = 0;\n    for (const n in t) Object.prototype.hasOwnProperty.call(t, n) && e++;\n    return e;\n}\n\nfunction Bt(t, e) {\n    for (const n in t) Object.prototype.hasOwnProperty.call(t, n) && e(n, t[n]);\n}\n\nfunction Lt(t) {\n    for (const e in t) if (Object.prototype.hasOwnProperty.call(t, e)) return !1;\n    return !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/** Sentinel value that sorts before any Mutation Batch ID. */\n/**\n * Returns whether a variable is either undefined or null.\n */\nfunction qt(t) {\n    return null == t;\n}\n\n/** Returns whether the value represents -0. */ function Ut(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 */ function Kt(t) {\n    return \"number\" == typeof t && Number.isInteger(t) && !Ut(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;\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/** True if and only if the Base64 conversion functions are available. */\nfunction Gt() {\n    return \"undefined\" != typeof atob;\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 * 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 */ class Qt {\n    constructor(t) {\n        this.binaryString = t;\n    }\n    static fromBase64String(t) {\n        const e = atob(t);\n        return new Qt(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 Qt(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        /** Converts a binary string to a Base64 encoded string. */\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 Z(this.binaryString, t.binaryString);\n    }\n    isEqual(t) {\n        return this.binaryString === t.binaryString;\n    }\n}\n\nQt.EMPTY_BYTE_STRING = new Qt(\"\");\n\nconst jt = 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 Wt(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 (M(!!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 = jt.exec(t);\n        if (M(!!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 s = new Date(t);\n        return {\n            seconds: Math.floor(s.getTime() / 1e3),\n            nanos: e\n        };\n    }\n    return {\n        seconds: zt(t.seconds),\n        nanos: zt(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 zt(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 Ht(t) {\n    return \"string\" == typeof t ? Qt.fromBase64String(t) : Qt.fromUint8Array(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 * 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 Jt(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 * Creates a new ServerTimestamp proto value (using the internal format).\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 */\nfunction Yt(t) {\n    const e = t.mapValue.fields.__previous_value__;\n    return Jt(e) ? Yt(e) : e;\n}\n\n/**\n * Returns the local time at which this timestamp was first set.\n */ function Xt(t) {\n    const e = Wt(t.mapValue.fields.__local_write_time__.timestampValue);\n    return new nt(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 Zt = {\n    mapValue: {\n        fields: {\n            __type__: {\n                stringValue: \"__max__\"\n            }\n        }\n    }\n}, te = {\n    nullValue: \"NULL_VALUE\"\n};\n\n/** Extracts the backend's type order for the provided value. */\nfunction ee(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 ? Jt(t) ? 4 /* TypeOrder.ServerTimestampValue */ : we(t) ? 9007199254740991 /* TypeOrder.MaxValue */ : 10 /* TypeOrder.ObjectValue */ : O();\n}\n\n/** Tests `left` and `right` for equality based on the backend semantics. */ function ne(t, e) {\n    if (t === e) return !0;\n    const n = ee(t);\n    if (n !== ee(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 Xt(t).isEqual(Xt(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 = Wt(t.timestampValue), s = Wt(e.timestampValue);\n            return n.seconds === s.seconds && n.nanos === s.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 Ht(t.bytesValue).isEqual(Ht(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 zt(t.geoPointValue.latitude) === zt(e.geoPointValue.latitude) && zt(t.geoPointValue.longitude) === zt(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 zt(t.integerValue) === zt(e.integerValue);\n            if (\"doubleValue\" in t && \"doubleValue\" in e) {\n                const n = zt(t.doubleValue), s = zt(e.doubleValue);\n                return n === s ? Ut(n) === Ut(s) : isNaN(n) && isNaN(s);\n            }\n            return !1;\n        }(t, e);\n\n      case 9 /* TypeOrder.ArrayValue */ :\n        return tt(t.arrayValue.values || [], e.arrayValue.values || [], ne);\n\n      case 10 /* TypeOrder.ObjectValue */ :\n        return function(t, e) {\n            const n = t.mapValue.fields || {}, s = e.mapValue.fields || {};\n            if ($t(n) !== $t(s)) return !1;\n            for (const t in n) if (n.hasOwnProperty(t) && (void 0 === s[t] || !ne(n[t], s[t]))) return !1;\n            return !0;\n        }\n        /** Returns true if the ArrayValue contains the specified element. */ (t, e);\n\n      default:\n        return O();\n    }\n}\n\nfunction se(t, e) {\n    return void 0 !== (t.values || []).find((t => ne(t, e)));\n}\n\nfunction ie(t, e) {\n    if (t === e) return 0;\n    const n = ee(t), s = ee(e);\n    if (n !== s) return Z(n, s);\n    switch (n) {\n      case 0 /* TypeOrder.NullValue */ :\n      case 9007199254740991 /* TypeOrder.MaxValue */ :\n        return 0;\n\n      case 1 /* TypeOrder.BooleanValue */ :\n        return Z(t.booleanValue, e.booleanValue);\n\n      case 2 /* TypeOrder.NumberValue */ :\n        return function(t, e) {\n            const n = zt(t.integerValue || t.doubleValue), s = zt(e.integerValue || e.doubleValue);\n            return n < s ? -1 : n > s ? 1 : n === s ? 0 : \n            // one or both are NaN.\n            isNaN(n) ? isNaN(s) ? 0 : -1 : 1;\n        }(t, e);\n\n      case 3 /* TypeOrder.TimestampValue */ :\n        return re(t.timestampValue, e.timestampValue);\n\n      case 4 /* TypeOrder.ServerTimestampValue */ :\n        return re(Xt(t), Xt(e));\n\n      case 5 /* TypeOrder.StringValue */ :\n        return Z(t.stringValue, e.stringValue);\n\n      case 6 /* TypeOrder.BlobValue */ :\n        return function(t, e) {\n            const n = Ht(t), s = Ht(e);\n            return n.compareTo(s);\n        }(t.bytesValue, e.bytesValue);\n\n      case 7 /* TypeOrder.RefValue */ :\n        return function(t, e) {\n            const n = t.split(\"/\"), s = e.split(\"/\");\n            for (let t = 0; t < n.length && t < s.length; t++) {\n                const e = Z(n[t], s[t]);\n                if (0 !== e) return e;\n            }\n            return Z(n.length, s.length);\n        }(t.referenceValue, e.referenceValue);\n\n      case 8 /* TypeOrder.GeoPointValue */ :\n        return function(t, e) {\n            const n = Z(zt(t.latitude), zt(e.latitude));\n            if (0 !== n) return n;\n            return Z(zt(t.longitude), zt(e.longitude));\n        }(t.geoPointValue, e.geoPointValue);\n\n      case 9 /* TypeOrder.ArrayValue */ :\n        return function(t, e) {\n            const n = t.values || [], s = e.values || [];\n            for (let t = 0; t < n.length && t < s.length; ++t) {\n                const e = ie(n[t], s[t]);\n                if (e) return e;\n            }\n            return Z(n.length, s.length);\n        }(t.arrayValue, e.arrayValue);\n\n      case 10 /* TypeOrder.ObjectValue */ :\n        return function(t, e) {\n            if (t === Zt.mapValue && e === Zt.mapValue) return 0;\n            if (t === Zt.mapValue) return 1;\n            if (e === Zt.mapValue) return -1;\n            const n = t.fields || {}, s = Object.keys(n), i = e.fields || {}, r = Object.keys(i);\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            s.sort(), r.sort();\n            for (let t = 0; t < s.length && t < r.length; ++t) {\n                const e = Z(s[t], r[t]);\n                if (0 !== e) return e;\n                const o = ie(n[s[t]], i[r[t]]);\n                if (0 !== o) return o;\n            }\n            return Z(s.length, r.length);\n        }\n        /**\n * Generates the canonical ID for the provided field value (as used in Target\n * serialization).\n */ (t.mapValue, e.mapValue);\n\n      default:\n        throw O();\n    }\n}\n\nfunction re(t, e) {\n    if (\"string\" == typeof t && \"string\" == typeof e && t.length === e.length) return Z(t, e);\n    const n = Wt(t), s = Wt(e), i = Z(n.seconds, s.seconds);\n    return 0 !== i ? i : Z(n.nanos, s.nanos);\n}\n\nfunction oe(t) {\n    return ue(t);\n}\n\nfunction ue(t) {\n    return \"nullValue\" in t ? \"null\" : \"booleanValue\" in t ? \"\" + t.booleanValue : \"integerValue\" in t ? \"\" + t.integerValue : \"doubleValue\" in t ? \"\" + t.doubleValue : \"timestampValue\" in t ? function(t) {\n        const e = Wt(t);\n        return `time(${e.seconds},${e.nanos})`;\n    }(t.timestampValue) : \"stringValue\" in t ? t.stringValue : \"bytesValue\" in t ? Ht(t.bytesValue).toBase64() : \"referenceValue\" in t ? (n = t.referenceValue, \n    ct.fromName(n).toString()) : \"geoPointValue\" in t ? `geo(${(e = t.geoPointValue).latitude},${e.longitude})` : \"arrayValue\" in t ? function(t) {\n        let e = \"[\", n = !0;\n        for (const s of t.values || []) n ? n = !1 : e += \",\", e += ue(s);\n        return e + \"]\";\n    }\n    /** Returns a reference value for the provided database and key. */ (t.arrayValue) : \"mapValue\" in t ? function(t) {\n        // Iteration order in JavaScript is not guaranteed. To ensure that we generate\n        // matching canonical IDs for identical maps, we need to sort the keys.\n        const e = Object.keys(t.fields || {}).sort();\n        let n = \"{\", s = !0;\n        for (const i of e) s ? s = !1 : n += \",\", n += `${i}:${ue(t.fields[i])}`;\n        return n + \"}\";\n    }(t.mapValue) : O();\n    var e, n;\n}\n\nfunction ce(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 IntegerValue . */ function ae(t) {\n    return !!t && \"integerValue\" in t;\n}\n\n/** Returns true if `value` is a DoubleValue. */\n/** Returns true if `value` is an ArrayValue. */\nfunction he(t) {\n    return !!t && \"arrayValue\" in t;\n}\n\n/** Returns true if `value` is a NullValue. */ function le(t) {\n    return !!t && \"nullValue\" in t;\n}\n\n/** Returns true if `value` is NaN. */ function fe(t) {\n    return !!t && \"doubleValue\" in t && isNaN(Number(t.doubleValue));\n}\n\n/** Returns true if `value` is a MapValue. */ function de(t) {\n    return !!t && \"mapValue\" in t;\n}\n\n/** Creates a deep copy of `source`. */ function _e(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 Bt(t.mapValue.fields, ((t, n) => e.mapValue.fields[t] = _e(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] = _e(t.arrayValue.values[n]);\n        return e;\n    }\n    return Object.assign({}, t);\n}\n\n/** Returns true if the Value represents the canonical {@link #MAX_VALUE} . */ function we(t) {\n    return \"__max__\" === (((t.mapValue || {}).fields || {}).__type__ || {}).stringValue;\n}\n\n/** Returns the lowest value for the given value type (inclusive). */ function me(t) {\n    return \"nullValue\" in t ? te : \"booleanValue\" in t ? {\n        booleanValue: !1\n    } : \"integerValue\" in t || \"doubleValue\" in t ? {\n        doubleValue: NaN\n    } : \"timestampValue\" in t ? {\n        timestampValue: {\n            seconds: Number.MIN_SAFE_INTEGER\n        }\n    } : \"stringValue\" in t ? {\n        stringValue: \"\"\n    } : \"bytesValue\" in t ? {\n        bytesValue: \"\"\n    } : \"referenceValue\" in t ? ce(Ft.empty(), ct.empty()) : \"geoPointValue\" in t ? {\n        geoPointValue: {\n            latitude: -90,\n            longitude: -180\n        }\n    } : \"arrayValue\" in t ? {\n        arrayValue: {}\n    } : \"mapValue\" in t ? {\n        mapValue: {}\n    } : O();\n}\n\n/** Returns the largest value for the given value type (exclusive). */ function ge(t) {\n    return \"nullValue\" in t ? {\n        booleanValue: !1\n    } : \"booleanValue\" in t ? {\n        doubleValue: NaN\n    } : \"integerValue\" in t || \"doubleValue\" in t ? {\n        timestampValue: {\n            seconds: Number.MIN_SAFE_INTEGER\n        }\n    } : \"timestampValue\" in t ? {\n        stringValue: \"\"\n    } : \"stringValue\" in t ? {\n        bytesValue: \"\"\n    } : \"bytesValue\" in t ? ce(Ft.empty(), ct.empty()) : \"referenceValue\" in t ? {\n        geoPointValue: {\n            latitude: -90,\n            longitude: -180\n        }\n    } : \"geoPointValue\" in t ? {\n        arrayValue: {}\n    } : \"arrayValue\" in t ? {\n        mapValue: {}\n    } : \"mapValue\" in t ? Zt : O();\n}\n\nfunction ye(t, e) {\n    const n = ie(t.value, e.value);\n    return 0 !== n ? n : t.inclusive && !e.inclusive ? -1 : !t.inclusive && e.inclusive ? 1 : 0;\n}\n\nfunction pe(t, e) {\n    const n = ie(t.value, e.value);\n    return 0 !== n ? n : t.inclusive && !e.inclusive ? 1 : !t.inclusive && e.inclusive ? -1 : 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 */\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 */ class Ie {\n    constructor(t, e) {\n        this.position = t, this.inclusive = e;\n    }\n}\n\nfunction Te(t, e, n) {\n    let s = 0;\n    for (let i = 0; i < t.position.length; i++) {\n        const r = e[i], o = t.position[i];\n        if (r.field.isKeyField()) s = ct.comparator(ct.fromName(o.referenceValue), n.key); else {\n            s = ie(o, n.data.field(r.field));\n        }\n        if (\"desc\" /* Direction.DESCENDING */ === r.dir && (s *= -1), 0 !== s) break;\n    }\n    return s;\n}\n\n/**\n * Returns true if a document sorts after a bound using the provided sort\n * order.\n */ function Ee(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 (!ne(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 Ae {}\n\nclass Re extends Ae {\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 ke(t, e, n) : \"array-contains\" /* Operator.ARRAY_CONTAINS */ === e ? new $e(t, n) : \"in\" /* Operator.IN */ === e ? new Be(t, n) : \"not-in\" /* Operator.NOT_IN */ === e ? new Le(t, n) : \"array-contains-any\" /* Operator.ARRAY_CONTAINS_ANY */ === e ? new qe(t, n) : new Re(t, e, n);\n    }\n    static createKeyFieldInFilter(t, e, n) {\n        return \"in\" /* Operator.IN */ === e ? new Oe(t, n) : new Me(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(ie(e, this.value)) : null !== e && ee(this.value) === ee(e) && this.matchesComparison(ie(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 O();\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 be extends Ae {\n    constructor(t, e) {\n        super(), this.filters = t, this.op = e, this.ht = null;\n    }\n    /**\n     * Creates a filter based on the provided arguments.\n     */    static create(t, e) {\n        return new be(t, e);\n    }\n    matches(t) {\n        return Pe(this) ? 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.ht || (this.ht = this.filters.reduce(((t, e) => t.concat(e.getFlattenedFilters())), [])), \n        this.ht;\n    }\n    // Returns a mutable copy of `this.filters`\n    getFilters() {\n        return Object.assign([], this.filters);\n    }\n    getFirstInequalityField() {\n        const t = this.lt((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    lt(t) {\n        for (const e of this.getFlattenedFilters()) if (t(e)) return e;\n        return null;\n    }\n}\n\nfunction Pe(t) {\n    return \"and\" /* CompositeOperator.AND */ === t.op;\n}\n\nfunction ve(t) {\n    return \"or\" /* CompositeOperator.OR */ === t.op;\n}\n\n/**\n * Returns true if this filter is a conjunction of field filters only. Returns false otherwise.\n */ function Ve(t) {\n    return Se(t) && Pe(t);\n}\n\n/**\n * Returns true if this filter does not contain any composite filters. Returns false otherwise.\n */ function Se(t) {\n    for (const e of t.filters) if (e instanceof be) return !1;\n    return !0;\n}\n\nfunction De(t) {\n    if (t instanceof Re) \n    // TODO(b/29183165): Technically, this won't be unique if two values have\n    // the same description, such as the int 3 and the string \"3\". So we should\n    // add the types in here somehow, too.\n    return t.field.canonicalString() + t.op.toString() + oe(t.value);\n    if (Ve(t)) \n    // Older SDK versions use an implicit AND operation between their filters.\n    // In the new SDK versions, the developer may use an explicit AND filter.\n    // To stay consistent with the old usages, we add a special case to ensure\n    // the canonical ID for these two are the same. For example:\n    // `col.whereEquals(\"a\", 1).whereEquals(\"b\", 2)` should have the same\n    // canonical ID as `col.where(and(equals(\"a\",1), equals(\"b\",2)))`.\n    return t.filters.map((t => De(t))).join(\",\");\n    {\n        // filter instanceof CompositeFilter\n        const e = t.filters.map((t => De(t))).join(\",\");\n        return `${t.op}(${e})`;\n    }\n}\n\nfunction Ce(t, e) {\n    return t instanceof Re ? function(t, e) {\n        return e instanceof Re && t.op === e.op && t.field.isEqual(e.field) && ne(t.value, e.value);\n    }(t, e) : t instanceof be ? function(t, e) {\n        if (e instanceof be && t.op === e.op && t.filters.length === e.filters.length) {\n            return t.filters.reduce(((t, n, s) => t && Ce(n, e.filters[s])), !0);\n        }\n        return !1;\n    }\n    /**\n * Returns a new composite filter that contains all filter from\n * `compositeFilter` plus all the given filters in `otherFilters`.\n */ (t, e) : void O();\n}\n\nfunction xe(t, e) {\n    const n = t.filters.concat(e);\n    return be.create(n, t.op);\n}\n\n/** Returns a debug description for `filter`. */ function Ne(t) {\n    return t instanceof Re ? function(t) {\n        return `${t.field.canonicalString()} ${t.op} ${oe(t.value)}`;\n    }\n    /** Filter that matches on key fields (i.e. '__name__'). */ (t) : t instanceof be ? function(t) {\n        return t.op.toString() + \" {\" + t.getFilters().map(Ne).join(\" ,\") + \"}\";\n    }(t) : \"Filter\";\n}\n\nclass ke extends Re {\n    constructor(t, e, n) {\n        super(t, e, n), this.key = ct.fromName(n.referenceValue);\n    }\n    matches(t) {\n        const e = ct.comparator(t.key, this.key);\n        return this.matchesComparison(e);\n    }\n}\n\n/** Filter that matches on key fields within an array. */ class Oe extends Re {\n    constructor(t, e) {\n        super(t, \"in\" /* Operator.IN */ , e), this.keys = Fe(\"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 Me extends Re {\n    constructor(t, e) {\n        super(t, \"not-in\" /* Operator.NOT_IN */ , e), this.keys = Fe(\"not-in\" /* Operator.NOT_IN */ , e);\n    }\n    matches(t) {\n        return !this.keys.some((e => e.isEqual(t.key)));\n    }\n}\n\nfunction Fe(t, e) {\n    var n;\n    return ((null === (n = e.arrayValue) || void 0 === n ? void 0 : n.values) || []).map((t => ct.fromName(t.referenceValue)));\n}\n\n/** A Filter that implements the array-contains operator. */ class $e extends Re {\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 he(e) && se(e.arrayValue, this.value);\n    }\n}\n\n/** A Filter that implements the IN operator. */ class Be extends Re {\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 && se(this.value.arrayValue, e);\n    }\n}\n\n/** A Filter that implements the not-in operator. */ class Le extends Re {\n    constructor(t, e) {\n        super(t, \"not-in\" /* Operator.NOT_IN */ , e);\n    }\n    matches(t) {\n        if (se(this.value.arrayValue, {\n            nullValue: \"NULL_VALUE\"\n        })) return !1;\n        const e = t.data.field(this.field);\n        return null !== e && !se(this.value.arrayValue, e);\n    }\n}\n\n/** A Filter that implements the array-contains-any operator. */ class qe extends Re {\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 !(!he(e) || !e.arrayValue.values) && e.arrayValue.values.some((t => se(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 Ue {\n    constructor(t, e = \"asc\" /* Direction.ASCENDING */) {\n        this.field = t, this.dir = e;\n    }\n}\n\nfunction Ke(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// An immutable sorted map implementation, based on a Left-leaning Red-Black\n// tree.\nclass Ge {\n    constructor(t, e) {\n        this.comparator = t, this.root = e || je.EMPTY;\n    }\n    // Returns a copy of the map, with the specified key/value added or replaced.\n    insert(t, e) {\n        return new Ge(this.comparator, this.root.insert(t, e, this.comparator).copy(null, null, je.BLACK, null, null));\n    }\n    // Returns a copy of the map, with the specified key removed.\n    remove(t) {\n        return new Ge(this.comparator, this.root.remove(t, this.comparator).copy(null, null, je.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 s = this.comparator(t, n.key);\n            if (0 === s) return e + n.left.size;\n            s < 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 Qe(this.root, null, this.comparator, !1);\n    }\n    getIteratorFrom(t) {\n        return new Qe(this.root, t, this.comparator, !1);\n    }\n    getReverseIterator() {\n        return new Qe(this.root, null, this.comparator, !0);\n    }\n    getReverseIteratorFrom(t) {\n        return new Qe(this.root, t, this.comparator, !0);\n    }\n}\n\n // end SortedMap\n// An iterator over an LLRBNode.\nclass Qe {\n    constructor(t, e, n, s) {\n        this.isReverse = s, this.nodeStack = [];\n        let i = 1;\n        for (;!t.isEmpty(); ) if (i = e ? n(t.key, e) : 1, \n        // flip the comparison if we're going in reverse\n        e && s && (i *= -1), i < 0) \n        // This node is less than our start key. ignore it\n        t = this.isReverse ? t.left : t.right; else {\n            if (0 === i) {\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 je {\n    constructor(t, e, n, s, i) {\n        this.key = t, this.value = e, this.color = null != n ? n : je.RED, this.left = null != s ? s : je.EMPTY, \n        this.right = null != i ? i : je.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, s, i) {\n        return new je(null != t ? t : this.key, null != e ? e : this.value, null != n ? n : this.color, null != s ? s : this.left, null != i ? i : 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 s = this;\n        const i = n(t, s.key);\n        return s = i < 0 ? s.copy(null, null, null, s.left.insert(t, e, n), null) : 0 === i ? s.copy(null, e, null, null, null) : s.copy(null, null, null, null, s.right.insert(t, e, n)), \n        s.fixUp();\n    }\n    removeMin() {\n        if (this.left.isEmpty()) return je.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, s = this;\n        if (e(t, s.key) < 0) s.left.isEmpty() || s.left.isRed() || s.left.left.isRed() || (s = s.moveRedLeft()), \n        s = s.copy(null, null, null, s.left.remove(t, e), null); else {\n            if (s.left.isRed() && (s = s.rotateRight()), s.right.isEmpty() || s.right.isRed() || s.right.left.isRed() || (s = s.moveRedRight()), \n            0 === e(t, s.key)) {\n                if (s.right.isEmpty()) return je.EMPTY;\n                n = s.right.min(), s = s.copy(n.key, n.value, null, null, s.right.removeMin());\n            }\n            s = s.copy(null, null, null, null, s.right.remove(t, e));\n        }\n        return s.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, je.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, je.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 O();\n        if (this.right.isRed()) throw O();\n        const t = this.left.check();\n        if (t !== this.right.check()) throw O();\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\nje.EMPTY = null, je.RED = !0, je.BLACK = !1;\n\n// end LLRBEmptyNode\nje.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 O();\n    }\n    get value() {\n        throw O();\n    }\n    get color() {\n        throw O();\n    }\n    get left() {\n        throw O();\n    }\n    get right() {\n        throw O();\n    }\n    // Returns a copy of the current node.\n    copy(t, e, n, s, i) {\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 je(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 We {\n    constructor(t) {\n        this.comparator = t, this.data = new Ge(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 s = n.getNext();\n            if (this.comparator(s.key, t[1]) >= 0) return;\n            e(s.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 ze(this.data.getIterator());\n    }\n    getIteratorFrom(t) {\n        return new ze(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 We)) 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, s = n.getNext().key;\n            if (0 !== this.comparator(t, s)) 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 We(this.comparator);\n        return e.data = t, e;\n    }\n}\n\nclass ze {\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 * Compares two sorted sets for equality using their natural ordering. The\n * method computes the intersection and invokes `onAdd` for every element that\n * is in `after` but not `before`. `onRemove` is invoked for every element in\n * `before` but missing from `after`.\n *\n * The method creates a copy of both `before` and `after` and runs in O(n log\n * n), where n is the size of the two lists.\n *\n * @param before - The elements that exist in the original set.\n * @param after - The elements to diff against the original set.\n * @param comparator - The comparator for the elements in before and after.\n * @param onAdd - A function to invoke for every element that is part of `\n * after` but not `before`.\n * @param onRemove - A function to invoke for every element that is part of\n * `before` but not `after`.\n */\n/**\n * Returns the next element from the iterator or `undefined` if none available.\n */\nfunction He(t) {\n    return t.hasNext() ? t.getNext() : void 0;\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 Je {\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(ut.comparator);\n    }\n    static empty() {\n        return new Je([]);\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 We(ut.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 Je(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 Ye {\n    constructor(t) {\n        this.value = t;\n    }\n    static empty() {\n        return new Ye({\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            !de(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()] = _e(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 = ut.emptyPath(), n = {}, s = [];\n        t.forEach(((t, i) => {\n            if (!e.isImmediateParentOf(i)) {\n                // Insert the accumulated changes at this parent location\n                const t = this.getFieldsMap(e);\n                this.applyChanges(t, n, s), n = {}, s = [], e = i.popLast();\n            }\n            t ? n[i.lastSegment()] = _e(t) : s.push(i.lastSegment());\n        }));\n        const i = this.getFieldsMap(e);\n        this.applyChanges(i, n, s);\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        de(e) && e.mapValue.fields && delete e.mapValue.fields[t.lastSegment()];\n    }\n    isEqual(t) {\n        return ne(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 s = e.mapValue.fields[t.get(n)];\n            de(s) && s.mapValue.fields || (s = {\n                mapValue: {\n                    fields: {}\n                }\n            }, e.mapValue.fields[t.get(n)] = s), e = s;\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        Bt(e, ((e, n) => t[e] = n));\n        for (const e of n) delete t[e];\n    }\n    clone() {\n        return new Ye(_e(this.value));\n    }\n}\n\n/**\n * Returns a FieldMask built from all fields in a MapValue.\n */ function Xe(t) {\n    const e = [];\n    return Bt(t.fields, ((t, n) => {\n        const s = new ut([ t ]);\n        if (de(n)) {\n            const t = Xe(n.mapValue).fields;\n            if (0 === t.length) \n            // Preserve the empty map by adding it to the FieldMask.\n            e.push(s); else \n            // For nested and non-empty ObjectValues, add the FieldPath of the\n            // leaf nodes.\n            for (const n of t) e.push(s.child(n));\n        } else \n        // For nested and non-empty ObjectValues, add the FieldPath of the leaf\n        // nodes.\n        e.push(s);\n    })), new Je(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 * 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 Ze {\n    constructor(t, e, n, s, i, r, o) {\n        this.key = t, this.documentType = e, this.version = n, this.readTime = s, this.createTime = i, \n        this.data = r, 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 Ze(t, 0 /* DocumentType.INVALID */ , \n        /* version */ st.min(), \n        /* readTime */ st.min(), \n        /* createTime */ st.min(), Ye.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, s) {\n        return new Ze(t, 1 /* DocumentType.FOUND_DOCUMENT */ , \n        /* version */ e, \n        /* readTime */ st.min(), \n        /* createTime */ n, s, 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 Ze(t, 2 /* DocumentType.NO_DOCUMENT */ , \n        /* version */ e, \n        /* readTime */ st.min(), \n        /* createTime */ st.min(), Ye.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 Ze(t, 3 /* DocumentType.UNKNOWN_DOCUMENT */ , \n        /* version */ e, \n        /* readTime */ st.min(), \n        /* createTime */ st.min(), Ye.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(st.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 = Ye.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 = Ye.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 = st.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 Ze && 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 Ze(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 * Compares the value for field `field` in the provided documents. Throws if\n * the field does not exist in both documents.\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 tn {\n    constructor(t, e = null, n = [], s = [], i = null, r = null, o = null) {\n        this.path = t, this.collectionGroup = e, this.orderBy = n, this.filters = s, this.limit = i, \n        this.startAt = r, this.endAt = o, this.ft = 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 en(t, e = null, n = [], s = [], i = null, r = null, o = null) {\n    return new tn(t, e, n, s, i, r, o);\n}\n\nfunction nn(t) {\n    const e = $(t);\n    if (null === e.ft) {\n        let t = e.path.canonicalString();\n        null !== e.collectionGroup && (t += \"|cg:\" + e.collectionGroup), t += \"|f:\", t += e.filters.map((t => De(t))).join(\",\"), \n        t += \"|ob:\", t += e.orderBy.map((t => function(t) {\n            // TODO(b/29183165): Make this collision robust.\n            return t.field.canonicalString() + t.dir;\n        }(t))).join(\",\"), qt(e.limit) || (t += \"|l:\", t += e.limit), e.startAt && (t += \"|lb:\", \n        t += e.startAt.inclusive ? \"b:\" : \"a:\", t += e.startAt.position.map((t => oe(t))).join(\",\")), \n        e.endAt && (t += \"|ub:\", t += e.endAt.inclusive ? \"a:\" : \"b:\", t += e.endAt.position.map((t => oe(t))).join(\",\")), \n        e.ft = t;\n    }\n    return e.ft;\n}\n\nfunction sn(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 (!Ke(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 (!Ce(t.filters[n], e.filters[n])) return !1;\n    return t.collectionGroup === e.collectionGroup && (!!t.path.isEqual(e.path) && (!!Ee(t.startAt, e.startAt) && Ee(t.endAt, e.endAt)));\n}\n\nfunction rn(t) {\n    return ct.isDocumentKey(t.path) && null === t.collectionGroup && 0 === t.filters.length;\n}\n\n/** Returns the field filters that target the given field path. */ function on(t, e) {\n    return t.filters.filter((t => t instanceof Re && t.field.isEqual(e)));\n}\n\n/**\n * Returns the values that are used in ARRAY_CONTAINS or ARRAY_CONTAINS_ANY\n * filters. Returns `null` if there are no such filters.\n */\n/**\n * Returns the value to use as the lower bound for ascending index segment at\n * the provided `fieldPath` (or the upper bound for an descending segment).\n */\nfunction un(t, e, n) {\n    let s = te, i = !0;\n    // Process all filters to find a value for the current field segment\n    for (const n of on(t, e)) {\n        let t = te, e = !0;\n        switch (n.op) {\n          case \"<\" /* Operator.LESS_THAN */ :\n          case \"<=\" /* Operator.LESS_THAN_OR_EQUAL */ :\n            t = me(n.value);\n            break;\n\n          case \"==\" /* Operator.EQUAL */ :\n          case \"in\" /* Operator.IN */ :\n          case \">=\" /* Operator.GREATER_THAN_OR_EQUAL */ :\n            t = n.value;\n            break;\n\n          case \">\" /* Operator.GREATER_THAN */ :\n            t = n.value, e = !1;\n            break;\n\n          case \"!=\" /* Operator.NOT_EQUAL */ :\n          case \"not-in\" /* Operator.NOT_IN */ :\n            t = te;\n // Remaining filters cannot be used as lower bounds.\n                }\n        ye({\n            value: s,\n            inclusive: i\n        }, {\n            value: t,\n            inclusive: e\n        }) < 0 && (s = t, i = e);\n    }\n    // If there is an additional bound, compare the values against the existing\n    // range to see if we can narrow the scope.\n        if (null !== n) for (let r = 0; r < t.orderBy.length; ++r) {\n        if (t.orderBy[r].field.isEqual(e)) {\n            const t = n.position[r];\n            ye({\n                value: s,\n                inclusive: i\n            }, {\n                value: t,\n                inclusive: n.inclusive\n            }) < 0 && (s = t, i = n.inclusive);\n            break;\n        }\n    }\n    return {\n        value: s,\n        inclusive: i\n    };\n}\n\n/**\n * Returns the value to use as the upper bound for ascending index segment at\n * the provided `fieldPath` (or the lower bound for a descending segment).\n */ function cn(t, e, n) {\n    let s = Zt, i = !0;\n    // Process all filters to find a value for the current field segment\n    for (const n of on(t, e)) {\n        let t = Zt, e = !0;\n        switch (n.op) {\n          case \">=\" /* Operator.GREATER_THAN_OR_EQUAL */ :\n          case \">\" /* Operator.GREATER_THAN */ :\n            t = ge(n.value), e = !1;\n            break;\n\n          case \"==\" /* Operator.EQUAL */ :\n          case \"in\" /* Operator.IN */ :\n          case \"<=\" /* Operator.LESS_THAN_OR_EQUAL */ :\n            t = n.value;\n            break;\n\n          case \"<\" /* Operator.LESS_THAN */ :\n            t = n.value, e = !1;\n            break;\n\n          case \"!=\" /* Operator.NOT_EQUAL */ :\n          case \"not-in\" /* Operator.NOT_IN */ :\n            t = Zt;\n // Remaining filters cannot be used as upper bounds.\n                }\n        pe({\n            value: s,\n            inclusive: i\n        }, {\n            value: t,\n            inclusive: e\n        }) > 0 && (s = t, i = e);\n    }\n    // If there is an additional bound, compare the values against the existing\n    // range to see if we can narrow the scope.\n        if (null !== n) for (let r = 0; r < t.orderBy.length; ++r) {\n        if (t.orderBy[r].field.isEqual(e)) {\n            const t = n.position[r];\n            pe({\n                value: s,\n                inclusive: i\n            }, {\n                value: t,\n                inclusive: n.inclusive\n            }) > 0 && (s = t, i = n.inclusive);\n            break;\n        }\n    }\n    return {\n        value: s,\n        inclusive: i\n    };\n}\n\n/** Returns the number of segments of a perfect index for this target. */\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 an {\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 = [], s = [], i = null, r = \"F\" /* LimitType.First */ , o = null, u = null) {\n        this.path = t, this.collectionGroup = e, this.explicitOrderBy = n, this.filters = s, \n        this.limit = i, this.limitType = r, this.startAt = o, this.endAt = u, this.dt = null, \n        // The corresponding `Target` of this `Query` instance.\n        this._t = null, this.startAt, this.endAt;\n    }\n}\n\n/** Creates a new Query instance with the options provided. */ function hn(t, e, n, s, i, r, o, u) {\n    return new an(t, e, n, s, i, r, o, u);\n}\n\n/** Creates a new Query for a query that matches all documents at `path` */ function ln(t) {\n    return new an(t);\n}\n\n/**\n * Helper to convert a collection group query into a collection query at a\n * specific path. This is used when executing collection group queries, since\n * we have to split the query into a set of collection queries at multiple\n * paths.\n */\n/**\n * Returns true if this query does not specify any query constraints that\n * could remove results.\n */\nfunction fn(t) {\n    return 0 === t.filters.length && null === t.limit && null == t.startAt && null == t.endAt && (0 === t.explicitOrderBy.length || 1 === t.explicitOrderBy.length && t.explicitOrderBy[0].field.isKeyField());\n}\n\nfunction dn(t) {\n    return t.explicitOrderBy.length > 0 ? t.explicitOrderBy[0].field : null;\n}\n\nfunction _n(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 wn(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 mn(t) {\n    const e = $(t);\n    if (null === e.dt) {\n        e.dt = [];\n        const t = _n(e), n = dn(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.dt.push(new Ue(t)), e.dt.push(new Ue(ut.keyField(), \"asc\" /* Direction.ASCENDING */)); else {\n            let t = !1;\n            for (const n of e.explicitOrderBy) e.dt.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.dt.push(new Ue(ut.keyField(), t));\n            }\n        }\n    }\n    return e.dt;\n}\n\n/**\n * Converts this `Query` instance to it's corresponding `Target` representation.\n */ function gn(t) {\n    const e = $(t);\n    if (!e._t) if (\"F\" /* LimitType.First */ === e.limitType) e._t = en(e.path, e.collectionGroup, mn(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 mn(e)) {\n            const e = \"desc\" /* Direction.DESCENDING */ === n.dir ? \"asc\" /* Direction.ASCENDING */ : \"desc\" /* Direction.DESCENDING */;\n            t.push(new Ue(n.field, e));\n        }\n        // We need to swap the cursors to match the now-flipped query ordering.\n                const n = e.endAt ? new Ie(e.endAt.position, e.endAt.inclusive) : null, s = e.startAt ? new Ie(e.startAt.position, e.startAt.inclusive) : null;\n        // Now return as a LimitType.First query.\n        e._t = en(e.path, e.collectionGroup, t, e.filters, e.limit, n, s);\n    }\n    return e._t;\n}\n\nfunction yn(t, e) {\n    e.getFirstInequalityField(), _n(t);\n    const n = t.filters.concat([ e ]);\n    return new an(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);\n}\n\nfunction pn(t, e, n) {\n    return new an(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), e, n, t.startAt, t.endAt);\n}\n\nfunction In(t, e) {\n    return sn(gn(t), gn(e)) && t.limitType === e.limitType;\n}\n\n// TODO(b/29183165): This is used to get a unique string from a query to, for\n// example, use as a dictionary key, but the implementation is subject to\n// collisions. Make it collision-free.\nfunction Tn(t) {\n    return `${nn(gn(t))}|lt:${t.limitType}`;\n}\n\nfunction En(t) {\n    return `Query(target=${function(t) {\n        let e = t.path.canonicalString();\n        return null !== t.collectionGroup && (e += \" collectionGroup=\" + t.collectionGroup), \n        t.filters.length > 0 && (e += `, filters: [${t.filters.map((t => Ne(t))).join(\", \")}]`), \n        qt(t.limit) || (e += \", limit: \" + t.limit), t.orderBy.length > 0 && (e += `, orderBy: [${t.orderBy.map((t => function(t) {\n            return `${t.field.canonicalString()} (${t.dir})`;\n        }(t))).join(\", \")}]`), t.startAt && (e += \", startAt: \", e += t.startAt.inclusive ? \"b:\" : \"a:\", \n        e += t.startAt.position.map((t => oe(t))).join(\",\")), t.endAt && (e += \", endAt: \", \n        e += t.endAt.inclusive ? \"a:\" : \"b:\", e += t.endAt.position.map((t => oe(t))).join(\",\")), \n        `Target(${e})`;\n    }(gn(t))}; limitType=${t.limitType})`;\n}\n\n/** Returns whether `doc` matches the constraints of `query`. */ function An(t, e) {\n    return e.isFoundDocument() && function(t, e) {\n        const n = e.key.path;\n        return null !== t.collectionGroup ? e.key.hasCollectionId(t.collectionGroup) && t.path.isPrefixOf(n) : ct.isDocumentKey(t.path) ? t.path.isEqual(n) : t.path.isImmediateParentOf(n);\n    }\n    /**\n * A document must have a value for every ordering clause in order to show up\n * in the results.\n */ (t, e) && function(t, e) {\n        // We must use `queryOrderBy()` to get the list of all orderBys (both implicit and explicit).\n        // Note that for OR queries, orderBy applies to all disjunction terms and implicit orderBys must\n        // be taken into account. For example, the query \"a > 1 || b==1\" has an implicit \"orderBy a\" due\n        // to the inequality, and is evaluated as \"a > 1 orderBy a || b==1 orderBy a\".\n        // A document with content of {b:1} matches the filters, but does not match the orderBy because\n        // it's missing the field 'a'.\n        for (const n of mn(t)) \n        // order by key always matches\n        if (!n.field.isKeyField() && null === e.data.field(n.field)) return !1;\n        return !0;\n    }(t, e) && function(t, e) {\n        for (const n of t.filters) if (!n.matches(e)) return !1;\n        return !0;\n    }\n    /** Makes sure a document is within the bounds, if provided. */ (t, e) && function(t, e) {\n        if (t.startAt && !\n        /**\n * Returns true if a document sorts before a bound using the provided sort\n * order.\n */\n        function(t, e, n) {\n            const s = Te(t, e, n);\n            return t.inclusive ? s <= 0 : s < 0;\n        }(t.startAt, mn(t), e)) return !1;\n        if (t.endAt && !function(t, e, n) {\n            const s = Te(t, e, n);\n            return t.inclusive ? s >= 0 : s > 0;\n        }(t.endAt, mn(t), e)) return !1;\n        return !0;\n    }\n    /**\n * Returns the collection group that this query targets.\n *\n * PORTING NOTE: This is only used in the Web SDK to facilitate multi-tab\n * synchronization for query results.\n */ (t, e);\n}\n\nfunction Rn(t) {\n    return t.collectionGroup || (t.path.length % 2 == 1 ? t.path.lastSegment() : t.path.get(t.path.length - 2));\n}\n\n/**\n * Returns a new comparator function that can be used to compare two documents\n * based on the Query's ordering constraint.\n */ function bn(t) {\n    return (e, n) => {\n        let s = !1;\n        for (const i of mn(t)) {\n            const t = Pn(i, e, n);\n            if (0 !== t) return t;\n            s = s || i.field.isKeyField();\n        }\n        return 0;\n    };\n}\n\nfunction Pn(t, e, n) {\n    const s = t.field.isKeyField() ? ct.comparator(e.key, n.key) : function(t, e, n) {\n        const s = e.data.field(t), i = n.data.field(t);\n        return null !== s && null !== i ? ie(s, i) : O();\n    }(t.field, e, n);\n    switch (t.dir) {\n      case \"asc\" /* Direction.ASCENDING */ :\n        return s;\n\n      case \"desc\" /* Direction.DESCENDING */ :\n        return -1 * s;\n\n      default:\n        return O();\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 * Returns an DoubleValue for `value` that is encoded based the serializer's\n * `useProto3Json` setting.\n */ function vn(t, e) {\n    if (t.wt) {\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: Ut(e) ? \"-0\" : e\n    };\n}\n\n/**\n * Returns an IntegerValue for `value`.\n */ function Vn(t) {\n    return {\n        integerValue: \"\" + t\n    };\n}\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 */ function Sn(t, e) {\n    return Kt(e) ? Vn(e) : vn(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 Dn {\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/**\n * Computes the local transform result against the provided `previousValue`,\n * optionally using the provided localWriteTime.\n */ function Cn(t, e, n) {\n    return t instanceof kn ? function(t, e) {\n        const n = {\n            fields: {\n                __type__: {\n                    stringValue: \"server_timestamp\"\n                },\n                __local_write_time__: {\n                    timestampValue: {\n                        seconds: t.seconds,\n                        nanos: t.nanoseconds\n                    }\n                }\n            }\n        };\n        return e && (n.fields.__previous_value__ = e), {\n            mapValue: n\n        };\n    }(n, e) : t instanceof On ? Mn(t, e) : t instanceof Fn ? $n(t, e) : function(t, e) {\n        // PORTING NOTE: Since JavaScript's integer arithmetic is limited to 53 bit\n        // precision and resolves overflows by reducing precision, we do not\n        // manually cap overflows at 2^63.\n        const n = Nn(t, e), s = Ln(n) + Ln(t.gt);\n        return ae(n) && ae(t.gt) ? Vn(s) : vn(t.yt, s);\n    }(t, e);\n}\n\n/**\n * Computes a final transform result after the transform has been acknowledged\n * by the server, potentially using the server-provided transformResult.\n */ function xn(t, e, n) {\n    // The server just sends null as the transform result for array operations,\n    // so we have to calculate a result the same as we do for local\n    // applications.\n    return t instanceof On ? Mn(t, e) : t instanceof Fn ? $n(t, e) : n;\n}\n\n/**\n * If this transform operation is not idempotent, returns the base value to\n * persist for this transform. If a base value is returned, the transform\n * operation is always applied to this base value, even if document has\n * already been updated.\n *\n * Base values provide consistent behavior for non-idempotent transforms and\n * allow us to return the same latency-compensated value even if the backend\n * has already applied the transform operation. The base value is null for\n * idempotent transforms, as they can be re-played even if the backend has\n * already applied them.\n *\n * @returns a base value to store along with the mutation, or null for\n * idempotent transforms.\n */ function Nn(t, e) {\n    return t instanceof Bn ? ae(n = e) || function(t) {\n        return !!t && \"doubleValue\" in t;\n    }\n    /** Returns true if `value` is either an IntegerValue or a DoubleValue. */ (n) ? e : {\n        integerValue: 0\n    } : null;\n    var n;\n}\n\n/** Transforms a value into a server-generated timestamp. */\nclass kn extends Dn {}\n\n/** Transforms an array value via a union operation. */ class On extends Dn {\n    constructor(t) {\n        super(), this.elements = t;\n    }\n}\n\nfunction Mn(t, e) {\n    const n = qn(e);\n    for (const e of t.elements) n.some((t => ne(t, e))) || n.push(e);\n    return {\n        arrayValue: {\n            values: n\n        }\n    };\n}\n\n/** Transforms an array value via a remove operation. */ class Fn extends Dn {\n    constructor(t) {\n        super(), this.elements = t;\n    }\n}\n\nfunction $n(t, e) {\n    let n = qn(e);\n    for (const e of t.elements) n = n.filter((t => !ne(t, e)));\n    return {\n        arrayValue: {\n            values: n\n        }\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 Bn extends Dn {\n    constructor(t, e) {\n        super(), this.yt = t, this.gt = e;\n    }\n}\n\nfunction Ln(t) {\n    return zt(t.integerValue || t.doubleValue);\n}\n\nfunction qn(t) {\n    return he(t) && t.arrayValue.values ? t.arrayValue.values.slice() : [];\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 Un {\n    constructor(t, e) {\n        this.field = t, this.transform = e;\n    }\n}\n\nfunction Kn(t, e) {\n    return t.field.isEqual(e.field) && function(t, e) {\n        return t instanceof On && e instanceof On || t instanceof Fn && e instanceof Fn ? tt(t.elements, e.elements, ne) : t instanceof Bn && e instanceof Bn ? ne(t.gt, e.gt) : t instanceof kn && e instanceof kn;\n    }(t.transform, e.transform);\n}\n\n/** The result of successfully applying a mutation to the backend. */\nclass Gn {\n    constructor(\n    /**\n     * The version at which the mutation was committed:\n     *\n     * - For most operations, this is the updateTime in the WriteResult.\n     * - For deletes, the commitTime of the WriteResponse (because deletes are\n     *   not stored and have no updateTime).\n     *\n     * Note that these versions can be different: No-op writes will not change\n     * the updateTime even though the commitTime advances.\n     */\n    t, \n    /**\n     * The resulting fields returned from the backend after a mutation\n     * containing field transforms has been committed. Contains one FieldValue\n     * for each FieldTransform that was in the mutation.\n     *\n     * Will be empty if the mutation did not contain any field transforms.\n     */\n    e) {\n        this.version = t, this.transformResults = 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 Qn {\n    constructor(t, e) {\n        this.updateTime = t, this.exists = e;\n    }\n    /** Creates a new empty Precondition. */    static none() {\n        return new Qn;\n    }\n    /** Creates a new Precondition with an exists flag. */    static exists(t) {\n        return new Qn(void 0, t);\n    }\n    /** Creates a new Precondition based on a version a document exists at. */    static updateTime(t) {\n        return new Qn(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/** Returns true if the preconditions is valid for the given document. */ function jn(t, e) {\n    return void 0 !== t.updateTime ? e.isFoundDocument() && e.version.isEqual(t.updateTime) : void 0 === t.exists || t.exists === e.isFoundDocument();\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 Wn {}\n\n/**\n * A utility method to calculate a `Mutation` representing the overlay from the\n * final state of the document, and a `FieldMask` representing the fields that\n * are mutated by the local mutations.\n */ function zn(t, e) {\n    if (!t.hasLocalMutations || e && 0 === e.fields.length) return null;\n    // mask is null when sets or deletes are applied to the current document.\n        if (null === e) return t.isNoDocument() ? new is(t.key, Qn.none()) : new Zn(t.key, t.data, Qn.none());\n    {\n        const n = t.data, s = Ye.empty();\n        let i = new We(ut.comparator);\n        for (let t of e.fields) if (!i.has(t)) {\n            let e = n.field(t);\n            // If we are deleting a nested field, we take the immediate parent as\n            // the mask used to construct the resulting mutation.\n            // Justification: Nested fields can create parent fields implicitly. If\n            // only a leaf entry is deleted in later mutations, the parent field\n            // should still remain, but we may have lost this information.\n            // Consider mutation (foo.bar 1), then mutation (foo.bar delete()).\n            // This leaves the final result (foo, {}). Despite the fact that `doc`\n            // has the correct result, `foo` is not in `mask`, and the resulting\n            // mutation would miss `foo`.\n                        null === e && t.length > 1 && (t = t.popLast(), e = n.field(t)), null === e ? s.delete(t) : s.set(t, e), \n            i = i.add(t);\n        }\n        return new ts(t.key, s, new Je(i.toArray()), Qn.none());\n    }\n}\n\n/**\n * Applies this mutation to the given document for the purposes of computing a\n * new remote document. If the input document doesn't match the expected state\n * (e.g. it is invalid or outdated), the document type may transition to\n * unknown.\n *\n * @param mutation - The mutation to apply.\n * @param document - The document to mutate. The input document can be an\n *     invalid document if the client has no knowledge of the pre-mutation state\n *     of the document.\n * @param mutationResult - The result of applying the mutation from the backend.\n */ function Hn(t, e, n) {\n    t instanceof Zn ? function(t, e, n) {\n        // Unlike setMutationApplyToLocalView, if we're applying a mutation to a\n        // remote document the server has accepted the mutation so the precondition\n        // must have held.\n        const s = t.value.clone(), i = ns(t.fieldTransforms, e, n.transformResults);\n        s.setAll(i), e.convertToFoundDocument(n.version, s).setHasCommittedMutations();\n    }(t, e, n) : t instanceof ts ? function(t, e, n) {\n        if (!jn(t.precondition, e)) \n        // Since the mutation was not rejected, we know that the precondition\n        // matched on the backend. We therefore must not have the expected version\n        // of the document in our cache and convert to an UnknownDocument with a\n        // known updateTime.\n        return void e.convertToUnknownDocument(n.version);\n        const s = ns(t.fieldTransforms, e, n.transformResults), i = e.data;\n        i.setAll(es(t)), i.setAll(s), e.convertToFoundDocument(n.version, i).setHasCommittedMutations();\n    }(t, e, n) : function(t, e, n) {\n        // Unlike applyToLocalView, if we're applying a mutation to a remote\n        // document the server has accepted the mutation so the precondition must\n        // have held.\n        e.convertToNoDocument(n.version).setHasCommittedMutations();\n    }(0, e, n);\n}\n\n/**\n * Applies this mutation to the given document for the purposes of computing\n * the new local view of a document. If the input document doesn't match the\n * expected state, the document is not modified.\n *\n * @param mutation - The mutation to apply.\n * @param document - The document to mutate. The input document can be an\n *     invalid document if the client has no knowledge of the pre-mutation state\n *     of the document.\n * @param previousMask - The fields that have been updated before applying this mutation.\n * @param localWriteTime - A timestamp indicating the local write time of the\n *     batch this mutation is a part of.\n * @returns A `FieldMask` representing the fields that are changed by applying this mutation.\n */ function Jn(t, e, n, s) {\n    return t instanceof Zn ? function(t, e, n, s) {\n        if (!jn(t.precondition, e)) \n        // The mutation failed to apply (e.g. a document ID created with add()\n        // caused a name collision).\n        return n;\n        const i = t.value.clone(), r = ss(t.fieldTransforms, s, e);\n        return i.setAll(r), e.convertToFoundDocument(e.version, i).setHasLocalMutations(), \n        null;\n // SetMutation overwrites all fields.\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 */ (t, e, n, s) : t instanceof ts ? function(t, e, n, s) {\n        if (!jn(t.precondition, e)) return n;\n        const i = ss(t.fieldTransforms, s, e), r = e.data;\n        if (r.setAll(es(t)), r.setAll(i), e.convertToFoundDocument(e.version, r).setHasLocalMutations(), \n        null === n) return null;\n        return n.unionWith(t.fieldMask.fields).unionWith(t.fieldTransforms.map((t => t.field)));\n    }\n    /**\n * Returns a FieldPath/Value map with the content of the PatchMutation.\n */ (t, e, n, s) : function(t, e, n) {\n        if (jn(t.precondition, e)) return e.convertToNoDocument(e.version).setHasLocalMutations(), \n        null;\n        return 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 */ (t, e, n);\n}\n\n/**\n * If this mutation is not idempotent, returns the base value to persist with\n * this mutation. If a base value is returned, the mutation is always applied\n * to this base value, even if document has already been updated.\n *\n * The base value is a sparse object that consists of only the document\n * fields for which this mutation contains a non-idempotent transformation\n * (e.g. a numeric increment). The provided value guarantees consistent\n * behavior for non-idempotent transforms and allow us to return the same\n * latency-compensated value even if the backend has already applied the\n * mutation. The base value is null for idempotent mutations, as they can be\n * re-played even if the backend has already applied them.\n *\n * @returns a base value to store along with the mutation, or null for\n * idempotent mutations.\n */ function Yn(t, e) {\n    let n = null;\n    for (const s of t.fieldTransforms) {\n        const t = e.data.field(s.field), i = Nn(s.transform, t || null);\n        null != i && (null === n && (n = Ye.empty()), n.set(s.field, i));\n    }\n    return n || null;\n}\n\nfunction Xn(t, e) {\n    return t.type === e.type && (!!t.key.isEqual(e.key) && (!!t.precondition.isEqual(e.precondition) && (!!function(t, e) {\n        return void 0 === t && void 0 === e || !(!t || !e) && tt(t, e, ((t, e) => Kn(t, e)));\n    }(t.fieldTransforms, e.fieldTransforms) && (0 /* MutationType.Set */ === t.type ? t.value.isEqual(e.value) : 1 /* MutationType.Patch */ !== t.type || t.data.isEqual(e.data) && t.fieldMask.isEqual(e.fieldMask)))));\n}\n\n/**\n * A mutation that creates or replaces the document at the given key with the\n * object value contents.\n */ class Zn extends Wn {\n    constructor(t, e, n, s = []) {\n        super(), this.key = t, this.value = e, this.precondition = n, this.fieldTransforms = s, \n        this.type = 0 /* MutationType.Set */;\n    }\n    getFieldMask() {\n        return null;\n    }\n}\n\nclass ts extends Wn {\n    constructor(t, e, n, s, i = []) {\n        super(), this.key = t, this.data = e, this.fieldMask = n, this.precondition = s, \n        this.fieldTransforms = i, this.type = 1 /* MutationType.Patch */;\n    }\n    getFieldMask() {\n        return this.fieldMask;\n    }\n}\n\nfunction es(t) {\n    const e = new Map;\n    return t.fieldMask.fields.forEach((n => {\n        if (!n.isEmpty()) {\n            const s = t.data.field(n);\n            e.set(n, s);\n        }\n    })), e;\n}\n\n/**\n * Creates a list of \"transform results\" (a transform result is a field value\n * representing the result of applying a transform) for use after a mutation\n * containing transforms has been acknowledged by the server.\n *\n * @param fieldTransforms - The field transforms to apply the result to.\n * @param mutableDocument - The current state of the document after applying all\n * previous mutations.\n * @param serverTransformResults - The transform results received by the server.\n * @returns The transform results list.\n */ function ns(t, e, n) {\n    const s = new Map;\n    M(t.length === n.length);\n    for (let i = 0; i < n.length; i++) {\n        const r = t[i], o = r.transform, u = e.data.field(r.field);\n        s.set(r.field, xn(o, u, n[i]));\n    }\n    return s;\n}\n\n/**\n * Creates a list of \"transform results\" (a transform result is a field value\n * representing the result of applying a transform) for use when applying a\n * transform locally.\n *\n * @param fieldTransforms - The field transforms to apply the result to.\n * @param localWriteTime - The local time of the mutation (used to\n *     generate ServerTimestampValues).\n * @param mutableDocument - The document to apply transforms on.\n * @returns The transform results list.\n */ function ss(t, e, n) {\n    const s = new Map;\n    for (const i of t) {\n        const t = i.transform, r = n.data.field(i.field);\n        s.set(i.field, Cn(t, r, e));\n    }\n    return s;\n}\n\n/** A mutation that deletes the document at the given key. */ class is extends Wn {\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\nclass rs extends Wn {\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 */ class os {\n    // TODO(b/33078163): just use simplest form of existence filter for now\n    constructor(t) {\n        this.count = 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 * 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 */ var us, cs;\n\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 */\nfunction as(t) {\n    switch (t) {\n      default:\n        return O();\n\n      case B.CANCELLED:\n      case B.UNKNOWN:\n      case B.DEADLINE_EXCEEDED:\n      case B.RESOURCE_EXHAUSTED:\n      case B.INTERNAL:\n      case B.UNAVAILABLE:\n // Unauthenticated means something went wrong with our token and we need\n        // to retry with new credentials which will happen automatically.\n              case B.UNAUTHENTICATED:\n        return !1;\n\n      case B.INVALID_ARGUMENT:\n      case B.NOT_FOUND:\n      case B.ALREADY_EXISTS:\n      case B.PERMISSION_DENIED:\n      case B.FAILED_PRECONDITION:\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 B.ABORTED:\n      case B.OUT_OF_RANGE:\n      case B.UNIMPLEMENTED:\n      case B.DATA_LOSS:\n        return !0;\n    }\n}\n\n/**\n * Determines whether an error code represents a permanent error when received\n * in response to a write operation.\n *\n * Write operations must be handled specially because as of b/119437764, ABORTED\n * errors on the write stream should be retried too (even though ABORTED errors\n * are not generally retryable).\n *\n * Note that during the initial handshake on the write stream an ABORTED error\n * signals that we should discard our stream token (i.e. it is permanent). This\n * means a handshake error should be classified with isPermanentError, above.\n */\n/**\n * Maps an error Code from GRPC status code number, like 0, 1, or 14. These\n * are not the same as HTTP status codes.\n *\n * @returns The Code equivalent to the given GRPC status code. Fails if there\n *     is no match.\n */\nfunction hs(t) {\n    if (void 0 === t) \n    // This shouldn't normally happen, but in certain error cases (like trying\n    // to send invalid proto messages) we may get an error with no GRPC code.\n    return x(\"GRPC error has no .code\"), B.UNKNOWN;\n    switch (t) {\n      case us.OK:\n        return B.OK;\n\n      case us.CANCELLED:\n        return B.CANCELLED;\n\n      case us.UNKNOWN:\n        return B.UNKNOWN;\n\n      case us.DEADLINE_EXCEEDED:\n        return B.DEADLINE_EXCEEDED;\n\n      case us.RESOURCE_EXHAUSTED:\n        return B.RESOURCE_EXHAUSTED;\n\n      case us.INTERNAL:\n        return B.INTERNAL;\n\n      case us.UNAVAILABLE:\n        return B.UNAVAILABLE;\n\n      case us.UNAUTHENTICATED:\n        return B.UNAUTHENTICATED;\n\n      case us.INVALID_ARGUMENT:\n        return B.INVALID_ARGUMENT;\n\n      case us.NOT_FOUND:\n        return B.NOT_FOUND;\n\n      case us.ALREADY_EXISTS:\n        return B.ALREADY_EXISTS;\n\n      case us.PERMISSION_DENIED:\n        return B.PERMISSION_DENIED;\n\n      case us.FAILED_PRECONDITION:\n        return B.FAILED_PRECONDITION;\n\n      case us.ABORTED:\n        return B.ABORTED;\n\n      case us.OUT_OF_RANGE:\n        return B.OUT_OF_RANGE;\n\n      case us.UNIMPLEMENTED:\n        return B.UNIMPLEMENTED;\n\n      case us.DATA_LOSS:\n        return B.DATA_LOSS;\n\n      default:\n        return O();\n    }\n}\n\n/**\n * Converts an HTTP response's error status to the equivalent error code.\n *\n * @param status - An HTTP error response status (\"FAILED_PRECONDITION\",\n * \"UNKNOWN\", etc.)\n * @returns The equivalent Code. Non-matching responses are mapped to\n *     Code.UNKNOWN.\n */ (cs = us || (us = {}))[cs.OK = 0] = \"OK\", cs[cs.CANCELLED = 1] = \"CANCELLED\", \ncs[cs.UNKNOWN = 2] = \"UNKNOWN\", cs[cs.INVALID_ARGUMENT = 3] = \"INVALID_ARGUMENT\", \ncs[cs.DEADLINE_EXCEEDED = 4] = \"DEADLINE_EXCEEDED\", cs[cs.NOT_FOUND = 5] = \"NOT_FOUND\", \ncs[cs.ALREADY_EXISTS = 6] = \"ALREADY_EXISTS\", cs[cs.PERMISSION_DENIED = 7] = \"PERMISSION_DENIED\", \ncs[cs.UNAUTHENTICATED = 16] = \"UNAUTHENTICATED\", cs[cs.RESOURCE_EXHAUSTED = 8] = \"RESOURCE_EXHAUSTED\", \ncs[cs.FAILED_PRECONDITION = 9] = \"FAILED_PRECONDITION\", cs[cs.ABORTED = 10] = \"ABORTED\", \ncs[cs.OUT_OF_RANGE = 11] = \"OUT_OF_RANGE\", cs[cs.UNIMPLEMENTED = 12] = \"UNIMPLEMENTED\", \ncs[cs.INTERNAL = 13] = \"INTERNAL\", cs[cs.UNAVAILABLE = 14] = \"UNAVAILABLE\", cs[cs.DATA_LOSS = 15] = \"DATA_LOSS\";\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 map implementation that uses objects as keys. Objects must have an\n * associated equals function and must be immutable. Entries in the map are\n * stored together with the key being produced from the mapKeyFn. This map\n * automatically handles collisions of keys.\n */\nclass ls {\n    constructor(t, e) {\n        this.mapKeyFn = t, this.equalsFn = e, \n        /**\n         * The inner map for a key/value pair. Due to the possibility of collisions we\n         * keep a list of entries that we do a linear search through to find an actual\n         * match. Note that collisions should be rare, so we still expect near\n         * constant time lookups in practice.\n         */\n        this.inner = {}, \n        /** The number of entries stored in the map */\n        this.innerSize = 0;\n    }\n    /** Get a value for this key, or undefined if it does not exist. */    get(t) {\n        const e = this.mapKeyFn(t), n = this.inner[e];\n        if (void 0 !== n) for (const [e, s] of n) if (this.equalsFn(e, t)) return s;\n    }\n    has(t) {\n        return void 0 !== this.get(t);\n    }\n    /** Put this key and value in the map. */    set(t, e) {\n        const n = this.mapKeyFn(t), s = this.inner[n];\n        if (void 0 === s) return this.inner[n] = [ [ t, e ] ], void this.innerSize++;\n        for (let n = 0; n < s.length; n++) if (this.equalsFn(s[n][0], t)) \n        // This is updating an existing entry and does not increase `innerSize`.\n        return void (s[n] = [ t, e ]);\n        s.push([ t, e ]), this.innerSize++;\n    }\n    /**\n     * Remove this key from the map. Returns a boolean if anything was deleted.\n     */    delete(t) {\n        const e = this.mapKeyFn(t), n = this.inner[e];\n        if (void 0 === n) return !1;\n        for (let s = 0; s < n.length; s++) if (this.equalsFn(n[s][0], t)) return 1 === n.length ? delete this.inner[e] : n.splice(s, 1), \n        this.innerSize--, !0;\n        return !1;\n    }\n    forEach(t) {\n        Bt(this.inner, ((e, n) => {\n            for (const [e, s] of n) t(e, s);\n        }));\n    }\n    isEmpty() {\n        return Lt(this.inner);\n    }\n    size() {\n        return this.innerSize;\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 fs = new Ge(ct.comparator);\n\nfunction ds() {\n    return fs;\n}\n\nconst _s = new Ge(ct.comparator);\n\nfunction ws(...t) {\n    let e = _s;\n    for (const n of t) e = e.insert(n.key, n);\n    return e;\n}\n\nfunction ms(t) {\n    let e = _s;\n    return t.forEach(((t, n) => e = e.insert(t, n.overlayedDocument))), e;\n}\n\nfunction gs() {\n    return ps();\n}\n\nfunction ys() {\n    return ps();\n}\n\nfunction ps() {\n    return new ls((t => t.toString()), ((t, e) => t.isEqual(e)));\n}\n\nconst Is = new Ge(ct.comparator);\n\nconst Ts = new We(ct.comparator);\n\nfunction Es(...t) {\n    let e = Ts;\n    for (const n of t) e = e.add(n);\n    return e;\n}\n\nconst As = new We(Z);\n\nfunction Rs() {\n    return As;\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 event from the RemoteStore. It is split into targetChanges (changes to the\n * state or the set of documents in our watched targets) and documentUpdates\n * (changes to the actual documents).\n */ class bs {\n    constructor(\n    /**\n     * The snapshot version this event brings us up to, or MIN if not set.\n     */\n    t, \n    /**\n     * A map from target to changes to the target. See TargetChange.\n     */\n    e, \n    /**\n     * A set of targets that is known to be inconsistent. Listens for these\n     * targets should be re-established without resume tokens.\n     */\n    n, \n    /**\n     * A set of which documents have changed or been deleted, along with the\n     * doc's new values (if not deleted).\n     */\n    s, \n    /**\n     * A set of which document updates are due only to limbo resolution targets.\n     */\n    i) {\n        this.snapshotVersion = t, this.targetChanges = e, this.targetMismatches = n, this.documentUpdates = s, \n        this.resolvedLimboDocuments = i;\n    }\n    /**\n     * HACK: Views require RemoteEvents in order to determine whether the view is\n     * CURRENT, but secondary tabs don't receive remote events. So this method is\n     * used to create a synthesized RemoteEvent that can be used to apply a\n     * CURRENT status change to a View, for queries executed in a different tab.\n     */\n    // PORTING NOTE: Multi-tab only\n    static createSynthesizedRemoteEventForCurrentChange(t, e, n) {\n        const s = new Map;\n        return s.set(t, Ps.createSynthesizedTargetChangeForCurrentChange(t, e, n)), new bs(st.min(), s, Rs(), ds(), Es());\n    }\n}\n\n/**\n * A TargetChange specifies the set of changes for a specific target as part of\n * a RemoteEvent. These changes track which documents are added, modified or\n * removed, as well as the target's resume token and whether the target is\n * marked CURRENT.\n * The actual changes *to* documents are not part of the TargetChange since\n * documents may be part of multiple targets.\n */ class Ps {\n    constructor(\n    /**\n     * An opaque, server-assigned token that allows watching a query to be resumed\n     * after disconnecting without retransmitting all the data that matches the\n     * query. The resume token essentially identifies a point in time from which\n     * the server should resume sending results.\n     */\n    t, \n    /**\n     * The \"current\" (synced) status of this target. Note that \"current\"\n     * has special meaning in the RPC protocol that implies that a target is\n     * both up-to-date and consistent with the rest of the watch stream.\n     */\n    e, \n    /**\n     * The set of documents that were newly assigned to this target as part of\n     * this remote event.\n     */\n    n, \n    /**\n     * The set of documents that were already assigned to this target but received\n     * an update during this remote event.\n     */\n    s, \n    /**\n     * The set of documents that were removed from this target as part of this\n     * remote event.\n     */\n    i) {\n        this.resumeToken = t, this.current = e, this.addedDocuments = n, this.modifiedDocuments = s, \n        this.removedDocuments = i;\n    }\n    /**\n     * This method is used to create a synthesized TargetChanges that can be used to\n     * apply a CURRENT status change to a View (for queries executed in a different\n     * tab) or for new queries (to raise snapshots with correct CURRENT status).\n     */    static createSynthesizedTargetChangeForCurrentChange(t, e, n) {\n        return new Ps(n, e, Es(), Es(), Es());\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 changed document and a list of target ids to which this change\n * applies.\n *\n * If document has been deleted NoDocument will be provided.\n */ class vs {\n    constructor(\n    /** The new document applies to all of these targets. */\n    t, \n    /** The new document is removed from all of these targets. */\n    e, \n    /** The key of the document for this change. */\n    n, \n    /**\n     * The new document or NoDocument if it was deleted. Is null if the\n     * document went out of view without the server sending a new document.\n     */\n    s) {\n        this.It = t, this.removedTargetIds = e, this.key = n, this.Tt = s;\n    }\n}\n\nclass Vs {\n    constructor(t, e) {\n        this.targetId = t, this.Et = e;\n    }\n}\n\nclass Ss {\n    constructor(\n    /** What kind of change occurred to the watch target. */\n    t, \n    /** The target IDs that were added/removed/set. */\n    e, \n    /**\n     * An opaque, server-assigned token that allows watching a target to be\n     * resumed after disconnecting without retransmitting all the data that\n     * matches the target. The resume token essentially identifies a point in\n     * time from which the server should resume sending results.\n     */\n    n = Qt.EMPTY_BYTE_STRING\n    /** An RPC error indicating why the watch failed. */ , s = null) {\n        this.state = t, this.targetIds = e, this.resumeToken = n, this.cause = s;\n    }\n}\n\n/** Tracks the internal state of a Watch target. */ class Ds {\n    constructor() {\n        /**\n         * The number of pending responses (adds or removes) that we are waiting on.\n         * We only consider targets active that have no pending responses.\n         */\n        this.At = 0, \n        /**\n         * Keeps track of the document changes since the last raised snapshot.\n         *\n         * These changes are continuously updated as we receive document updates and\n         * always reflect the current set of changes against the last issued snapshot.\n         */\n        this.Rt = Ns(), \n        /** See public getters for explanations of these fields. */\n        this.bt = Qt.EMPTY_BYTE_STRING, this.Pt = !1, \n        /**\n         * Whether this target state should be included in the next snapshot. We\n         * initialize to true so that newly-added targets are included in the next\n         * RemoteEvent.\n         */\n        this.vt = !0;\n    }\n    /**\n     * Whether this target has been marked 'current'.\n     *\n     * 'Current' has special meaning in the RPC protocol: It implies that the\n     * Watch backend has sent us all changes up to the point at which the target\n     * was added and that the target is consistent with the rest of the watch\n     * stream.\n     */    get current() {\n        return this.Pt;\n    }\n    /** The last resume token sent to us for this target. */    get resumeToken() {\n        return this.bt;\n    }\n    /** Whether this target has pending target adds or target removes. */    get Vt() {\n        return 0 !== this.At;\n    }\n    /** Whether we have modified any state that should trigger a snapshot. */    get St() {\n        return this.vt;\n    }\n    /**\n     * Applies the resume token to the TargetChange, but only when it has a new\n     * value. Empty resumeTokens are discarded.\n     */    Dt(t) {\n        t.approximateByteSize() > 0 && (this.vt = !0, this.bt = t);\n    }\n    /**\n     * Creates a target change from the current set of changes.\n     *\n     * To reset the document changes after raising this snapshot, call\n     * `clearPendingChanges()`.\n     */    Ct() {\n        let t = Es(), e = Es(), n = Es();\n        return this.Rt.forEach(((s, i) => {\n            switch (i) {\n              case 0 /* ChangeType.Added */ :\n                t = t.add(s);\n                break;\n\n              case 2 /* ChangeType.Modified */ :\n                e = e.add(s);\n                break;\n\n              case 1 /* ChangeType.Removed */ :\n                n = n.add(s);\n                break;\n\n              default:\n                O();\n            }\n        })), new Ps(this.bt, this.Pt, t, e, n);\n    }\n    /**\n     * Resets the document changes and sets `hasPendingChanges` to false.\n     */    xt() {\n        this.vt = !1, this.Rt = Ns();\n    }\n    Nt(t, e) {\n        this.vt = !0, this.Rt = this.Rt.insert(t, e);\n    }\n    kt(t) {\n        this.vt = !0, this.Rt = this.Rt.remove(t);\n    }\n    Ot() {\n        this.At += 1;\n    }\n    Mt() {\n        this.At -= 1;\n    }\n    Ft() {\n        this.vt = !0, this.Pt = !0;\n    }\n}\n\n/**\n * A helper class to accumulate watch changes into a RemoteEvent.\n */\nclass Cs {\n    constructor(t) {\n        this.$t = t, \n        /** The internal state of all tracked targets. */\n        this.Bt = new Map, \n        /** Keeps track of the documents to update since the last raised snapshot. */\n        this.Lt = ds(), \n        /** A mapping of document keys to their set of target IDs. */\n        this.qt = xs(), \n        /**\n         * A list of targets with existence filter mismatches. These targets are\n         * known to be inconsistent and their listens needs to be re-established by\n         * RemoteStore.\n         */\n        this.Ut = new We(Z);\n    }\n    /**\n     * Processes and adds the DocumentWatchChange to the current set of changes.\n     */    Kt(t) {\n        for (const e of t.It) t.Tt && t.Tt.isFoundDocument() ? this.Gt(e, t.Tt) : this.Qt(e, t.key, t.Tt);\n        for (const e of t.removedTargetIds) this.Qt(e, t.key, t.Tt);\n    }\n    /** Processes and adds the WatchTargetChange to the current set of changes. */    jt(t) {\n        this.forEachTarget(t, (e => {\n            const n = this.Wt(e);\n            switch (t.state) {\n              case 0 /* WatchTargetChangeState.NoChange */ :\n                this.zt(e) && n.Dt(t.resumeToken);\n                break;\n\n              case 1 /* WatchTargetChangeState.Added */ :\n                // We need to decrement the number of pending acks needed from watch\n                // for this targetId.\n                n.Mt(), n.Vt || \n                // We have a freshly added target, so we need to reset any state\n                // that we had previously. This can happen e.g. when remove and add\n                // back a target for existence filter mismatches.\n                n.xt(), n.Dt(t.resumeToken);\n                break;\n\n              case 2 /* WatchTargetChangeState.Removed */ :\n                // We need to keep track of removed targets to we can post-filter and\n                // remove any target changes.\n                // We need to decrement the number of pending acks needed from watch\n                // for this targetId.\n                n.Mt(), n.Vt || this.removeTarget(e);\n                break;\n\n              case 3 /* WatchTargetChangeState.Current */ :\n                this.zt(e) && (n.Ft(), n.Dt(t.resumeToken));\n                break;\n\n              case 4 /* WatchTargetChangeState.Reset */ :\n                this.zt(e) && (\n                // Reset the target and synthesizes removes for all existing\n                // documents. The backend will re-add any documents that still\n                // match the target before it sends the next global snapshot.\n                this.Ht(e), n.Dt(t.resumeToken));\n                break;\n\n              default:\n                O();\n            }\n        }));\n    }\n    /**\n     * Iterates over all targetIds that the watch change applies to: either the\n     * targetIds explicitly listed in the change or the targetIds of all currently\n     * active targets.\n     */    forEachTarget(t, e) {\n        t.targetIds.length > 0 ? t.targetIds.forEach(e) : this.Bt.forEach(((t, n) => {\n            this.zt(n) && e(n);\n        }));\n    }\n    /**\n     * Handles existence filters and synthesizes deletes for filter mismatches.\n     * Targets that are invalidated by filter mismatches are added to\n     * `pendingTargetResets`.\n     */    Jt(t) {\n        const e = t.targetId, n = t.Et.count, s = this.Yt(e);\n        if (s) {\n            const t = s.target;\n            if (rn(t)) if (0 === n) {\n                // The existence filter told us the document does not exist. We deduce\n                // that this document does not exist and apply a deleted document to\n                // our updates. Without applying this deleted document there might be\n                // another query that will raise this document as part of a snapshot\n                // until it is resolved, essentially exposing inconsistency between\n                // queries.\n                const n = new ct(t.path);\n                this.Qt(e, n, Ze.newNoDocument(n, st.min()));\n            } else M(1 === n); else {\n                this.Xt(e) !== n && (\n                // Existence filter mismatch: We reset the mapping and raise a new\n                // snapshot with `isFromCache:true`.\n                this.Ht(e), this.Ut = this.Ut.add(e));\n            }\n        }\n    }\n    /**\n     * Converts the currently accumulated state into a remote event at the\n     * provided snapshot version. Resets the accumulated changes before returning.\n     */    Zt(t) {\n        const e = new Map;\n        this.Bt.forEach(((n, s) => {\n            const i = this.Yt(s);\n            if (i) {\n                if (n.current && rn(i.target)) {\n                    // Document queries for document that don't exist can produce an empty\n                    // result set. To update our local cache, we synthesize a document\n                    // delete if we have not previously received the document. This\n                    // resolves the limbo state of the document, removing it from\n                    // limboDocumentRefs.\n                    // TODO(dimond): Ideally we would have an explicit lookup target\n                    // instead resulting in an explicit delete message and we could\n                    // remove this special logic.\n                    const e = new ct(i.target.path);\n                    null !== this.Lt.get(e) || this.te(s, e) || this.Qt(s, e, Ze.newNoDocument(e, t));\n                }\n                n.St && (e.set(s, n.Ct()), n.xt());\n            }\n        }));\n        let n = Es();\n        // We extract the set of limbo-only document updates as the GC logic\n        // special-cases documents that do not appear in the target cache.\n        \n        // TODO(gsoltis): Expand on this comment once GC is available in the JS\n        // client.\n                this.qt.forEach(((t, e) => {\n            let s = !0;\n            e.forEachWhile((t => {\n                const e = this.Yt(t);\n                return !e || 2 /* TargetPurpose.LimboResolution */ === e.purpose || (s = !1, !1);\n            })), s && (n = n.add(t));\n        })), this.Lt.forEach(((e, n) => n.setReadTime(t)));\n        const s = new bs(t, e, this.Ut, this.Lt, n);\n        return this.Lt = ds(), this.qt = xs(), this.Ut = new We(Z), s;\n    }\n    /**\n     * Adds the provided document to the internal list of document updates and\n     * its document key to the given target's mapping.\n     */\n    // Visible for testing.\n    Gt(t, e) {\n        if (!this.zt(t)) return;\n        const n = this.te(t, e.key) ? 2 /* ChangeType.Modified */ : 0 /* ChangeType.Added */;\n        this.Wt(t).Nt(e.key, n), this.Lt = this.Lt.insert(e.key, e), this.qt = this.qt.insert(e.key, this.ee(e.key).add(t));\n    }\n    /**\n     * Removes the provided document from the target mapping. If the\n     * document no longer matches the target, but the document's state is still\n     * known (e.g. we know that the document was deleted or we received the change\n     * that caused the filter mismatch), the new document can be provided\n     * to update the remote document cache.\n     */\n    // Visible for testing.\n    Qt(t, e, n) {\n        if (!this.zt(t)) return;\n        const s = this.Wt(t);\n        this.te(t, e) ? s.Nt(e, 1 /* ChangeType.Removed */) : \n        // The document may have entered and left the target before we raised a\n        // snapshot, so we can just ignore the change.\n        s.kt(e), this.qt = this.qt.insert(e, this.ee(e).delete(t)), n && (this.Lt = this.Lt.insert(e, n));\n    }\n    removeTarget(t) {\n        this.Bt.delete(t);\n    }\n    /**\n     * Returns the current count of documents in the target. This includes both\n     * the number of documents that the LocalStore considers to be part of the\n     * target as well as any accumulated changes.\n     */    Xt(t) {\n        const e = this.Wt(t).Ct();\n        return this.$t.getRemoteKeysForTarget(t).size + e.addedDocuments.size - e.removedDocuments.size;\n    }\n    /**\n     * Increment the number of acks needed from watch before we can consider the\n     * server to be 'in-sync' with the client's active targets.\n     */    Ot(t) {\n        this.Wt(t).Ot();\n    }\n    Wt(t) {\n        let e = this.Bt.get(t);\n        return e || (e = new Ds, this.Bt.set(t, e)), e;\n    }\n    ee(t) {\n        let e = this.qt.get(t);\n        return e || (e = new We(Z), this.qt = this.qt.insert(t, e)), e;\n    }\n    /**\n     * Verifies that the user is still interested in this target (by calling\n     * `getTargetDataForTarget()`) and that we are not waiting for pending ADDs\n     * from watch.\n     */    zt(t) {\n        const e = null !== this.Yt(t);\n        return e || C(\"WatchChangeAggregator\", \"Detected inactive target\", t), e;\n    }\n    /**\n     * Returns the TargetData for an active target (i.e. a target that the user\n     * is still interested in that has no outstanding target change requests).\n     */    Yt(t) {\n        const e = this.Bt.get(t);\n        return e && e.Vt ? null : this.$t.ne(t);\n    }\n    /**\n     * Resets the state of a Watch target to its initial state (e.g. sets\n     * 'current' to false, clears the resume token and removes its target mapping\n     * from all documents).\n     */    Ht(t) {\n        this.Bt.set(t, new Ds);\n        this.$t.getRemoteKeysForTarget(t).forEach((e => {\n            this.Qt(t, e, /*updatedDocument=*/ null);\n        }));\n    }\n    /**\n     * Returns whether the LocalStore considers the document to be part of the\n     * specified target.\n     */    te(t, e) {\n        return this.$t.getRemoteKeysForTarget(t).has(e);\n    }\n}\n\nfunction xs() {\n    return new Ge(ct.comparator);\n}\n\nfunction Ns() {\n    return new Ge(ct.comparator);\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 ks = (() => {\n    const t = {\n        asc: \"ASCENDING\",\n        desc: \"DESCENDING\"\n    };\n    return t;\n})(), Os = (() => {\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})(), Ms = (() => {\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 Fs {\n    constructor(t, e) {\n        this.databaseId = t, this.wt = e;\n    }\n}\n\n/**\n * Returns a value for a Date that's appropriate to put into a proto.\n */\nfunction $s(t, e) {\n    if (t.wt) {\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 Bs(t, e) {\n    return t.wt ? e.toBase64() : e.toUint8Array();\n}\n\n/**\n * Returns a ByteString based on the proto string value.\n */ function Ls(t, e) {\n    return $s(t, e.toTimestamp());\n}\n\nfunction qs(t) {\n    return M(!!t), st.fromTimestamp(function(t) {\n        const e = Wt(t);\n        return new nt(e.seconds, e.nanos);\n    }(t));\n}\n\nfunction Us(t, e) {\n    return function(t) {\n        return new rt([ \"projects\", t.projectId, \"databases\", t.database ]);\n    }(t).child(\"documents\").child(e).canonicalString();\n}\n\nfunction Ks(t) {\n    const e = rt.fromString(t);\n    return M(wi(e)), e;\n}\n\nfunction Gs(t, e) {\n    return Us(t.databaseId, e.path);\n}\n\nfunction Qs(t, e) {\n    const n = Ks(e);\n    if (n.get(1) !== t.databaseId.projectId) throw new L(B.INVALID_ARGUMENT, \"Tried to deserialize key from different project: \" + n.get(1) + \" vs \" + t.databaseId.projectId);\n    if (n.get(3) !== t.databaseId.database) throw new L(B.INVALID_ARGUMENT, \"Tried to deserialize key from different database: \" + n.get(3) + \" vs \" + t.databaseId.database);\n    return new ct(Hs(n));\n}\n\nfunction js(t, e) {\n    return Us(t.databaseId, e);\n}\n\nfunction Ws(t) {\n    const e = Ks(t);\n    // In v1beta1 queries for collections at the root did not have a trailing\n    // \"/documents\". In v1 all resource paths contain \"/documents\". Preserve the\n    // ability to read the v1beta1 form for compatibility with queries persisted\n    // in the local target cache.\n        return 4 === e.length ? rt.emptyPath() : Hs(e);\n}\n\nfunction zs(t) {\n    return new rt([ \"projects\", t.databaseId.projectId, \"databases\", t.databaseId.database ]).canonicalString();\n}\n\nfunction Hs(t) {\n    return M(t.length > 4 && \"documents\" === t.get(4)), t.popFirst(5);\n}\n\n/** Creates a Document proto from key and fields (but no create/update time) */ function Js(t, e, n) {\n    return {\n        name: Gs(t, e),\n        fields: n.value.mapValue.fields\n    };\n}\n\nfunction Ys(t, e, n) {\n    const s = Qs(t, e.name), i = qs(e.updateTime), r = e.createTime ? qs(e.createTime) : st.min(), o = new Ye({\n        mapValue: {\n            fields: e.fields\n        }\n    }), u = Ze.newFoundDocument(s, i, r, o);\n    return n && u.setHasCommittedMutations(), n ? u.setHasCommittedMutations() : u;\n}\n\nfunction Xs(t, e) {\n    return \"found\" in e ? function(t, e) {\n        M(!!e.found), e.found.name, e.found.updateTime;\n        const n = Qs(t, e.found.name), s = qs(e.found.updateTime), i = e.found.createTime ? qs(e.found.createTime) : st.min(), r = new Ye({\n            mapValue: {\n                fields: e.found.fields\n            }\n        });\n        return Ze.newFoundDocument(n, s, i, r);\n    }(t, e) : \"missing\" in e ? function(t, e) {\n        M(!!e.missing), M(!!e.readTime);\n        const n = Qs(t, e.missing), s = qs(e.readTime);\n        return Ze.newNoDocument(n, s);\n    }(t, e) : O();\n}\n\nfunction Zs(t, e) {\n    let n;\n    if (\"targetChange\" in e) {\n        e.targetChange;\n        // proto3 default value is unset in JSON (undefined), so use 'NO_CHANGE'\n        // if unset\n        const s = function(t) {\n            return \"NO_CHANGE\" === t ? 0 /* WatchTargetChangeState.NoChange */ : \"ADD\" === t ? 1 /* WatchTargetChangeState.Added */ : \"REMOVE\" === t ? 2 /* WatchTargetChangeState.Removed */ : \"CURRENT\" === t ? 3 /* WatchTargetChangeState.Current */ : \"RESET\" === t ? 4 /* WatchTargetChangeState.Reset */ : O();\n        }(e.targetChange.targetChangeType || \"NO_CHANGE\"), i = e.targetChange.targetIds || [], r = function(t, e) {\n            return t.wt ? (M(void 0 === e || \"string\" == typeof e), Qt.fromBase64String(e || \"\")) : (M(void 0 === e || e instanceof Uint8Array), \n            Qt.fromUint8Array(e || new Uint8Array));\n        }(t, e.targetChange.resumeToken), o = e.targetChange.cause, u = o && function(t) {\n            const e = void 0 === t.code ? B.UNKNOWN : hs(t.code);\n            return new L(e, t.message || \"\");\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 */ (o);\n        n = new Ss(s, i, r, u || null);\n    } else if (\"documentChange\" in e) {\n        e.documentChange;\n        const s = e.documentChange;\n        s.document, s.document.name, s.document.updateTime;\n        const i = Qs(t, s.document.name), r = qs(s.document.updateTime), o = s.document.createTime ? qs(s.document.createTime) : st.min(), u = new Ye({\n            mapValue: {\n                fields: s.document.fields\n            }\n        }), c = Ze.newFoundDocument(i, r, o, u), a = s.targetIds || [], h = s.removedTargetIds || [];\n        n = new vs(a, h, c.key, c);\n    } else if (\"documentDelete\" in e) {\n        e.documentDelete;\n        const s = e.documentDelete;\n        s.document;\n        const i = Qs(t, s.document), r = s.readTime ? qs(s.readTime) : st.min(), o = Ze.newNoDocument(i, r), u = s.removedTargetIds || [];\n        n = new vs([], u, o.key, o);\n    } else if (\"documentRemove\" in e) {\n        e.documentRemove;\n        const s = e.documentRemove;\n        s.document;\n        const i = Qs(t, s.document), r = s.removedTargetIds || [];\n        n = new vs([], r, i, null);\n    } else {\n        if (!(\"filter\" in e)) return O();\n        {\n            e.filter;\n            const t = e.filter;\n            t.targetId;\n            const s = t.count || 0, i = new os(s), r = t.targetId;\n            n = new Vs(r, i);\n        }\n    }\n    return n;\n}\n\nfunction ti(t, e) {\n    let n;\n    if (e instanceof Zn) n = {\n        update: Js(t, e.key, e.value)\n    }; else if (e instanceof is) n = {\n        delete: Gs(t, e.key)\n    }; else if (e instanceof ts) n = {\n        update: Js(t, e.key, e.data),\n        updateMask: _i(e.fieldMask)\n    }; else {\n        if (!(e instanceof rs)) return O();\n        n = {\n            verify: Gs(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 kn) return {\n            fieldPath: e.field.canonicalString(),\n            setToServerValue: \"REQUEST_TIME\"\n        };\n        if (n instanceof On) return {\n            fieldPath: e.field.canonicalString(),\n            appendMissingElements: {\n                values: n.elements\n            }\n        };\n        if (n instanceof Fn) return {\n            fieldPath: e.field.canonicalString(),\n            removeAllFromArray: {\n                values: n.elements\n            }\n        };\n        if (n instanceof Bn) return {\n            fieldPath: e.field.canonicalString(),\n            increment: n.gt\n        };\n        throw O();\n    }(0, t)))), e.precondition.isNone || (n.currentDocument = function(t, e) {\n        return void 0 !== e.updateTime ? {\n            updateTime: Ls(t, e.updateTime)\n        } : void 0 !== e.exists ? {\n            exists: e.exists\n        } : O();\n    }(t, e.precondition)), n;\n}\n\nfunction ei(t, e) {\n    const n = e.currentDocument ? function(t) {\n        return void 0 !== t.updateTime ? Qn.updateTime(qs(t.updateTime)) : void 0 !== t.exists ? Qn.exists(t.exists) : Qn.none();\n    }(e.currentDocument) : Qn.none(), s = e.updateTransforms ? e.updateTransforms.map((e => function(t, e) {\n        let n = null;\n        if (\"setToServerValue\" in e) M(\"REQUEST_TIME\" === e.setToServerValue), n = new kn; else if (\"appendMissingElements\" in e) {\n            const t = e.appendMissingElements.values || [];\n            n = new On(t);\n        } else if (\"removeAllFromArray\" in e) {\n            const t = e.removeAllFromArray.values || [];\n            n = new Fn(t);\n        } else \"increment\" in e ? n = new Bn(t, e.increment) : O();\n        const s = ut.fromServerFormat(e.fieldPath);\n        return new Un(s, n);\n    }(t, e))) : [];\n    if (e.update) {\n        e.update.name;\n        const i = Qs(t, e.update.name), r = new Ye({\n            mapValue: {\n                fields: e.update.fields\n            }\n        });\n        if (e.updateMask) {\n            const t = function(t) {\n                const e = t.fieldPaths || [];\n                return new Je(e.map((t => ut.fromServerFormat(t))));\n            }(e.updateMask);\n            return new ts(i, r, t, n, s);\n        }\n        return new Zn(i, r, n, s);\n    }\n    if (e.delete) {\n        const s = Qs(t, e.delete);\n        return new is(s, n);\n    }\n    if (e.verify) {\n        const s = Qs(t, e.verify);\n        return new rs(s, n);\n    }\n    return O();\n}\n\nfunction ni(t, e) {\n    return t && t.length > 0 ? (M(void 0 !== e), t.map((t => function(t, e) {\n        // NOTE: Deletes don't have an updateTime.\n        let n = t.updateTime ? qs(t.updateTime) : qs(e);\n        return n.isEqual(st.min()) && (\n        // The Firestore Emulator currently returns an update time of 0 for\n        // deletes of non-existing documents (rather than null). This breaks the\n        // test \"get deleted doc while offline with source=cache\" as NoDocuments\n        // with version 0 are filtered by IndexedDb's RemoteDocumentCache.\n        // TODO(#2149): Remove this when Emulator is fixed\n        n = qs(e)), new Gn(n, t.transformResults || []);\n    }(t, e)))) : [];\n}\n\nfunction si(t, e) {\n    return {\n        documents: [ js(t, e.path) ]\n    };\n}\n\nfunction ii(t, e) {\n    // Dissect the path into parent, collectionId, and optional key filter.\n    const n = {\n        structuredQuery: {}\n    }, s = e.path;\n    null !== e.collectionGroup ? (n.parent = js(t, s), n.structuredQuery.from = [ {\n        collectionId: e.collectionGroup,\n        allDescendants: !0\n    } ]) : (n.parent = js(t, s.popLast()), n.structuredQuery.from = [ {\n        collectionId: s.lastSegment()\n    } ]);\n    const i = function(t) {\n        if (0 === t.length) return;\n        return di(be.create(t, \"and\" /* CompositeOperator.AND */));\n    }(e.filters);\n    i && (n.structuredQuery.where = i);\n    const r = function(t) {\n        if (0 === t.length) return;\n        return t.map((t => \n        // visible for testing\n        function(t) {\n            return {\n                field: li(t.field),\n                direction: ci(t.dir)\n            };\n        }(t)));\n    }(e.orderBy);\n    r && (n.structuredQuery.orderBy = r);\n    const o = function(t, e) {\n        return t.wt || qt(e) ? e : {\n            value: e\n        };\n    }\n    /**\n * Returns a number (or null) from a google.protobuf.Int32Value proto.\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    }(e.endAt)), n;\n}\n\nfunction ri(t) {\n    let e = Ws(t.parent);\n    const n = t.structuredQuery, s = n.from ? n.from.length : 0;\n    let i = null;\n    if (s > 0) {\n        M(1 === s);\n        const t = n.from[0];\n        t.allDescendants ? i = t.collectionId : e = e.child(t.collectionId);\n    }\n    let r = [];\n    n.where && (r = function(t) {\n        const e = ui(t);\n        if (e instanceof be && Ve(e)) return e.getFilters();\n        return [ e ];\n    }(n.where));\n    let o = [];\n    n.orderBy && (o = n.orderBy.map((t => function(t) {\n        return new Ue(fi(t.field), \n        // visible for testing\n        function(t) {\n            switch (t) {\n              case \"ASCENDING\":\n                return \"asc\" /* Direction.ASCENDING */;\n\n              case \"DESCENDING\":\n                return \"desc\" /* Direction.DESCENDING */;\n\n              default:\n                return;\n            }\n        }\n        // visible for testing\n        (t.direction));\n    }\n    // visible for testing\n    (t))));\n    let u = null;\n    n.limit && (u = function(t) {\n        let e;\n        return e = \"object\" == typeof t ? t.value : t, qt(e) ? null : e;\n    }(n.limit));\n    let c = null;\n    n.startAt && (c = function(t) {\n        const e = !!t.before, n = t.values || [];\n        return new Ie(n, e);\n    }(n.startAt));\n    let a = null;\n    return n.endAt && (a = function(t) {\n        const e = !t.before, n = t.values || [];\n        return new Ie(n, e);\n    }\n    // visible for testing\n    (n.endAt)), hn(e, i, o, r, u, \"F\" /* LimitType.First */ , c, a);\n}\n\nfunction oi(t, e) {\n    const n = function(t, e) {\n        switch (e) {\n          case 0 /* TargetPurpose.Listen */ :\n            return null;\n\n          case 1 /* TargetPurpose.ExistenceFilterMismatch */ :\n            return \"existence-filter-mismatch\";\n\n          case 2 /* TargetPurpose.LimboResolution */ :\n            return \"limbo-document\";\n\n          default:\n            return O();\n        }\n    }(0, e.purpose);\n    return null == n ? null : {\n        \"goog-listen-tags\": n\n    };\n}\n\nfunction ui(t) {\n    return void 0 !== t.unaryFilter ? function(t) {\n        switch (t.unaryFilter.op) {\n          case \"IS_NAN\":\n            const e = fi(t.unaryFilter.field);\n            return Re.create(e, \"==\" /* Operator.EQUAL */ , {\n                doubleValue: NaN\n            });\n\n          case \"IS_NULL\":\n            const n = fi(t.unaryFilter.field);\n            return Re.create(n, \"==\" /* Operator.EQUAL */ , {\n                nullValue: \"NULL_VALUE\"\n            });\n\n          case \"IS_NOT_NAN\":\n            const s = fi(t.unaryFilter.field);\n            return Re.create(s, \"!=\" /* Operator.NOT_EQUAL */ , {\n                doubleValue: NaN\n            });\n\n          case \"IS_NOT_NULL\":\n            const i = fi(t.unaryFilter.field);\n            return Re.create(i, \"!=\" /* Operator.NOT_EQUAL */ , {\n                nullValue: \"NULL_VALUE\"\n            });\n\n          default:\n            return O();\n        }\n    }(t) : void 0 !== t.fieldFilter ? function(t) {\n        return Re.create(fi(t.fieldFilter.field), function(t) {\n            switch (t) {\n              case \"EQUAL\":\n                return \"==\" /* Operator.EQUAL */;\n\n              case \"NOT_EQUAL\":\n                return \"!=\" /* Operator.NOT_EQUAL */;\n\n              case \"GREATER_THAN\":\n                return \">\" /* Operator.GREATER_THAN */;\n\n              case \"GREATER_THAN_OR_EQUAL\":\n                return \">=\" /* Operator.GREATER_THAN_OR_EQUAL */;\n\n              case \"LESS_THAN\":\n                return \"<\" /* Operator.LESS_THAN */;\n\n              case \"LESS_THAN_OR_EQUAL\":\n                return \"<=\" /* Operator.LESS_THAN_OR_EQUAL */;\n\n              case \"ARRAY_CONTAINS\":\n                return \"array-contains\" /* Operator.ARRAY_CONTAINS */;\n\n              case \"IN\":\n                return \"in\" /* Operator.IN */;\n\n              case \"NOT_IN\":\n                return \"not-in\" /* Operator.NOT_IN */;\n\n              case \"ARRAY_CONTAINS_ANY\":\n                return \"array-contains-any\" /* Operator.ARRAY_CONTAINS_ANY */;\n\n              default:\n                return O();\n            }\n        }(t.fieldFilter.op), t.fieldFilter.value);\n    }(t) : void 0 !== t.compositeFilter ? function(t) {\n        return be.create(t.compositeFilter.filters.map((t => ui(t))), function(t) {\n            switch (t) {\n              case \"AND\":\n                return \"and\" /* CompositeOperator.AND */;\n\n              case \"OR\":\n                return \"or\" /* CompositeOperator.OR */;\n\n              default:\n                return O();\n            }\n        }(t.compositeFilter.op));\n    }(t) : O();\n}\n\nfunction ci(t) {\n    return ks[t];\n}\n\nfunction ai(t) {\n    return Os[t];\n}\n\nfunction hi(t) {\n    return Ms[t];\n}\n\nfunction li(t) {\n    return {\n        fieldPath: t.canonicalString()\n    };\n}\n\nfunction fi(t) {\n    return ut.fromServerFormat(t.fieldPath);\n}\n\nfunction di(t) {\n    return t instanceof Re ? function(t) {\n        if (\"==\" /* Operator.EQUAL */ === t.op) {\n            if (fe(t.value)) return {\n                unaryFilter: {\n                    field: li(t.field),\n                    op: \"IS_NAN\"\n                }\n            };\n            if (le(t.value)) return {\n                unaryFilter: {\n                    field: li(t.field),\n                    op: \"IS_NULL\"\n                }\n            };\n        } else if (\"!=\" /* Operator.NOT_EQUAL */ === t.op) {\n            if (fe(t.value)) return {\n                unaryFilter: {\n                    field: li(t.field),\n                    op: \"IS_NOT_NAN\"\n                }\n            };\n            if (le(t.value)) return {\n                unaryFilter: {\n                    field: li(t.field),\n                    op: \"IS_NOT_NULL\"\n                }\n            };\n        }\n        return {\n            fieldFilter: {\n                field: li(t.field),\n                op: ai(t.op),\n                value: t.value\n            }\n        };\n    }(t) : t instanceof be ? function(t) {\n        const e = t.getFilters().map((t => di(t)));\n        if (1 === e.length) return e[0];\n        return {\n            compositeFilter: {\n                op: hi(t.op),\n                filters: e\n            }\n        };\n    }(t) : O();\n}\n\nfunction _i(t) {\n    const e = [];\n    return t.fields.forEach((t => e.push(t.canonicalString()))), {\n        fieldPaths: e\n    };\n}\n\nfunction wi(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 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 * Encodes a resource path into a IndexedDb-compatible string form.\n */\nfunction mi(t) {\n    let e = \"\";\n    for (let n = 0; n < t.length; n++) e.length > 0 && (e = yi(e)), e = gi(t.get(n), e);\n    return yi(e);\n}\n\n/** Encodes a single segment of a resource path into the given result */ function gi(t, e) {\n    let n = e;\n    const s = t.length;\n    for (let e = 0; e < s; e++) {\n        const s = t.charAt(e);\n        switch (s) {\n          case \"\\0\":\n            n += \"\u0001\u0010\";\n            break;\n\n          case \"\u0001\":\n            n += \"\u0001\u0011\";\n            break;\n\n          default:\n            n += s;\n        }\n    }\n    return n;\n}\n\n/** Encodes a path separator into the given result */ function yi(t) {\n    return t + \"\u0001\u0001\";\n}\n\n/**\n * Decodes the given IndexedDb-compatible string form of a resource path into\n * a ResourcePath instance. Note that this method is not suitable for use with\n * decoding resource names from the server; those are One Platform format\n * strings.\n */ function pi(t) {\n    // Event the empty path must encode as a path of at least length 2. A path\n    // with exactly 2 must be the empty path.\n    const e = t.length;\n    if (M(e >= 2), 2 === e) return M(\"\u0001\" === t.charAt(0) && \"\u0001\" === t.charAt(1)), rt.emptyPath();\n    // Escape characters cannot exist past the second-to-last position in the\n    // source value.\n        const n = e - 2, s = [];\n    let i = \"\";\n    for (let r = 0; r < e; ) {\n        // The last two characters of a valid encoded path must be a separator, so\n        // there must be an end to this segment.\n        const e = t.indexOf(\"\u0001\", r);\n        (e < 0 || e > n) && O();\n        switch (t.charAt(e + 1)) {\n          case \"\u0001\":\n            const n = t.substring(r, e);\n            let o;\n            0 === i.length ? \n            // Avoid copying for the common case of a segment that excludes \\0\n            // and \\001\n            o = n : (i += n, o = i, i = \"\"), s.push(o);\n            break;\n\n          case \"\u0010\":\n            i += t.substring(r, e), i += \"\\0\";\n            break;\n\n          case \"\u0011\":\n            // The escape character can be used in the output to encode itself.\n            i += t.substring(r, e + 1);\n            break;\n\n          default:\n            O();\n        }\n        r = e + 2;\n    }\n    return new rt(s);\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 Ii = [ \"userId\", \"batchId\" ];\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 * Name of the IndexedDb object store.\n *\n * Note that the name 'owner' is chosen to ensure backwards compatibility with\n * older clients that only supported single locked access to the persistence\n * layer.\n */\n/**\n * Creates a [userId, encodedPath] key for use in the DbDocumentMutations\n * index to iterate over all at document mutations for a given path or lower.\n */\nfunction Ti(t, e) {\n    return [ t, mi(e) ];\n}\n\n/**\n * Creates a full index key of [userId, encodedPath, batchId] for inserting\n * and deleting into the DbDocumentMutations index.\n */ function Ei(t, e, n) {\n    return [ t, mi(e), n ];\n}\n\n/**\n * Because we store all the useful information for this store in the key,\n * there is no useful information to store as the value. The raw (unencoded)\n * path cannot be stored because IndexedDb doesn't store prototype\n * information.\n */ const Ai = {}, Ri = [ \"prefixPath\", \"collectionGroup\", \"readTime\", \"documentId\" ], bi = [ \"prefixPath\", \"collectionGroup\", \"documentId\" ], Pi = [ \"collectionGroup\", \"readTime\", \"prefixPath\", \"documentId\" ], vi = [ \"canonicalId\", \"targetId\" ], Vi = [ \"targetId\", \"path\" ], Si = [ \"path\", \"targetId\" ], Di = [ \"collectionId\", \"parent\" ], Ci = [ \"indexId\", \"uid\" ], xi = [ \"uid\", \"sequenceNumber\" ], Ni = [ \"indexId\", \"uid\", \"arrayValue\", \"directionalValue\", \"orderedDocumentKey\", \"documentKey\" ], ki = [ \"indexId\", \"uid\", \"orderedDocumentKey\" ], Oi = [ \"userId\", \"collectionPath\", \"documentId\" ], Mi = [ \"userId\", \"collectionPath\", \"largestBatchId\" ], Fi = [ \"userId\", \"collectionGroup\", \"largestBatchId\" ], $i = [ ...[ ...[ ...[ ...[ \"mutationQueues\", \"mutations\", \"documentMutations\", \"remoteDocuments\", \"targets\", \"owner\", \"targetGlobal\", \"targetDocuments\" ], \"clientMetadata\" ], \"remoteDocumentGlobal\" ], \"collectionParents\" ], \"bundles\", \"namedQueries\" ], Bi = [ ...$i, \"documentOverlays\" ], Li = [ \"mutationQueues\", \"mutations\", \"documentMutations\", \"remoteDocumentsV14\", \"targets\", \"owner\", \"targetGlobal\", \"targetDocuments\", \"clientMetadata\", \"remoteDocumentGlobal\", \"collectionParents\", \"bundles\", \"namedQueries\", \"documentOverlays\" ], qi = Li, Ui = [ ...qi, \"indexConfiguration\", \"indexState\", \"indexEntries\" ];\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 */\nclass Ki extends Tt {\n    constructor(t, e) {\n        super(), this.se = t, this.currentSequenceNumber = e;\n    }\n}\n\nfunction Gi(t, e) {\n    const n = $(t);\n    return bt.M(n.se, 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 * A batch of mutations that will be sent as one unit to the backend.\n */ class Qi {\n    /**\n     * @param batchId - The unique ID of this mutation batch.\n     * @param localWriteTime - The original write time of this mutation.\n     * @param baseMutations - Mutations that are used to populate the base\n     * values when this mutation is applied locally. This can be used to locally\n     * overwrite values that are persisted in the remote document cache. Base\n     * mutations are never sent to the backend.\n     * @param mutations - The user-provided mutations in this mutation batch.\n     * User-provided mutations are applied both locally and remotely on the\n     * backend.\n     */\n    constructor(t, e, n, s) {\n        this.batchId = t, this.localWriteTime = e, this.baseMutations = n, this.mutations = s;\n    }\n    /**\n     * Applies all the mutations in this MutationBatch to the specified document\n     * to compute the state of the remote document\n     *\n     * @param document - The document to apply mutations to.\n     * @param batchResult - The result of applying the MutationBatch to the\n     * backend.\n     */    applyToRemoteDocument(t, e) {\n        const n = e.mutationResults;\n        for (let e = 0; e < this.mutations.length; e++) {\n            const s = this.mutations[e];\n            if (s.key.isEqual(t.key)) {\n                Hn(s, t, n[e]);\n            }\n        }\n    }\n    /**\n     * Computes the local view of a document given all the mutations in this\n     * batch.\n     *\n     * @param document - The document to apply mutations to.\n     * @param mutatedFields - Fields that have been updated before applying this mutation batch.\n     * @returns A `FieldMask` representing all the fields that are mutated.\n     */    applyToLocalView(t, e) {\n        // First, apply the base state. This allows us to apply non-idempotent\n        // transform against a consistent set of values.\n        for (const n of this.baseMutations) n.key.isEqual(t.key) && (e = Jn(n, t, e, this.localWriteTime));\n        // Second, apply all user-provided mutations.\n                for (const n of this.mutations) n.key.isEqual(t.key) && (e = Jn(n, t, e, this.localWriteTime));\n        return e;\n    }\n    /**\n     * Computes the local view for all provided documents given the mutations in\n     * this batch. Returns a `DocumentKey` to `Mutation` map which can be used to\n     * replace all the mutation applications.\n     */    applyToLocalDocumentSet(t, e) {\n        // TODO(mrschmidt): This implementation is O(n^2). If we apply the mutations\n        // directly (as done in `applyToLocalView()`), we can reduce the complexity\n        // to O(n).\n        const n = ys();\n        return this.mutations.forEach((s => {\n            const i = t.get(s.key), r = i.overlayedDocument;\n            // TODO(mutabledocuments): This method should take a MutableDocumentMap\n            // and we should remove this cast.\n                        let o = this.applyToLocalView(r, i.mutatedFields);\n            // Set mutatedFields to null if the document is only from local mutations.\n            // This creates a Set or Delete mutation, instead of trying to create a\n            // patch mutation as the overlay.\n                        o = e.has(s.key) ? null : o;\n            const u = zn(r, o);\n            null !== u && n.set(s.key, u), r.isValidDocument() || r.convertToNoDocument(st.min());\n        })), n;\n    }\n    keys() {\n        return this.mutations.reduce(((t, e) => t.add(e.key)), Es());\n    }\n    isEqual(t) {\n        return this.batchId === t.batchId && tt(this.mutations, t.mutations, ((t, e) => Xn(t, e))) && tt(this.baseMutations, t.baseMutations, ((t, e) => Xn(t, e)));\n    }\n}\n\n/** The result of applying a mutation batch to the backend. */ class ji {\n    constructor(t, e, n, \n    /**\n     * A pre-computed mapping from each mutated document to the resulting\n     * version.\n     */\n    s) {\n        this.batch = t, this.commitVersion = e, this.mutationResults = n, this.docVersions = s;\n    }\n    /**\n     * Creates a new MutationBatchResult for the given batch and results. There\n     * must be one result for each mutation in the batch. This static factory\n     * caches a document=&gt;version mapping (docVersions).\n     */    static from(t, e, n) {\n        M(t.mutations.length === n.length);\n        let s = Is;\n        const i = t.mutations;\n        for (let t = 0; t < i.length; t++) s = s.insert(i[t].key, n[t].version);\n        return new ji(t, e, n, s);\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 * Representation of an overlay computed by Firestore.\n *\n * Holds information about a mutation and the largest batch id in Firestore when\n * the mutation was created.\n */ class Wi {\n    constructor(t, e) {\n        this.largestBatchId = t, this.mutation = e;\n    }\n    getKey() {\n        return this.mutation.key;\n    }\n    isEqual(t) {\n        return null !== t && this.mutation === t.mutation;\n    }\n    toString() {\n        return `Overlay{\\n      largestBatchId: ${this.largestBatchId},\\n      mutation: ${this.mutation.toString()}\\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 */\n/**\n * An immutable set of metadata that the local store tracks for each target.\n */ class zi {\n    constructor(\n    /** The target being listened to. */\n    t, \n    /**\n     * The target ID to which the target corresponds; Assigned by the\n     * LocalStore for user listens and by the SyncEngine for limbo watches.\n     */\n    e, \n    /** The purpose of the target. */\n    n, \n    /**\n     * The sequence number of the last transaction during which this target data\n     * was modified.\n     */\n    s, \n    /** The latest snapshot version seen for this target. */\n    i = st.min()\n    /**\n     * The maximum snapshot version at which the associated view\n     * contained no limbo documents.\n     */ , r = st.min()\n    /**\n     * An opaque, server-assigned token that allows watching a target to be\n     * resumed after disconnecting without retransmitting all the data that\n     * matches the target. The resume token essentially identifies a point in\n     * time from which the server should resume sending results.\n     */ , o = Qt.EMPTY_BYTE_STRING) {\n        this.target = t, this.targetId = e, this.purpose = n, this.sequenceNumber = s, this.snapshotVersion = i, \n        this.lastLimboFreeSnapshotVersion = r, this.resumeToken = o;\n    }\n    /** Creates a new target data instance with an updated sequence number. */    withSequenceNumber(t) {\n        return new zi(this.target, this.targetId, this.purpose, t, this.snapshotVersion, this.lastLimboFreeSnapshotVersion, this.resumeToken);\n    }\n    /**\n     * Creates a new target data instance with an updated resume token and\n     * snapshot version.\n     */    withResumeToken(t, e) {\n        return new zi(this.target, this.targetId, this.purpose, this.sequenceNumber, e, this.lastLimboFreeSnapshotVersion, t);\n    }\n    /**\n     * Creates a new target data instance with an updated last limbo free\n     * snapshot version number.\n     */    withLastLimboFreeSnapshotVersion(t) {\n        return new zi(this.target, this.targetId, this.purpose, this.sequenceNumber, this.snapshotVersion, t, this.resumeToken);\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/** Serializer for values stored in the LocalStore. */ class Hi {\n    constructor(t) {\n        this.ie = t;\n    }\n}\n\n/** Decodes a remote document from storage locally to a Document. */ function Ji(t, e) {\n    let n;\n    if (e.document) n = Ys(t.ie, e.document, !!e.hasCommittedMutations); else if (e.noDocument) {\n        const t = ct.fromSegments(e.noDocument.path), s = tr(e.noDocument.readTime);\n        n = Ze.newNoDocument(t, s), e.hasCommittedMutations && n.setHasCommittedMutations();\n    } else {\n        if (!e.unknownDocument) return O();\n        {\n            const t = ct.fromSegments(e.unknownDocument.path), s = tr(e.unknownDocument.version);\n            n = Ze.newUnknownDocument(t, s);\n        }\n    }\n    return e.readTime && n.setReadTime(function(t) {\n        const e = new nt(t[0], t[1]);\n        return st.fromTimestamp(e);\n    }(e.readTime)), n;\n}\n\n/** Encodes a document for storage locally. */ function Yi(t, e) {\n    const n = e.key, s = {\n        prefixPath: n.getCollectionPath().popLast().toArray(),\n        collectionGroup: n.collectionGroup,\n        documentId: n.path.lastSegment(),\n        readTime: Xi(e.readTime),\n        hasCommittedMutations: e.hasCommittedMutations\n    };\n    if (e.isFoundDocument()) s.document = function(t, e) {\n        return {\n            name: Gs(t, e.key),\n            fields: e.data.value.mapValue.fields,\n            updateTime: $s(t, e.version.toTimestamp()),\n            createTime: $s(t, e.createTime.toTimestamp())\n        };\n    }(t.ie, e); else if (e.isNoDocument()) s.noDocument = {\n        path: n.path.toArray(),\n        readTime: Zi(e.version)\n    }; else {\n        if (!e.isUnknownDocument()) return O();\n        s.unknownDocument = {\n            path: n.path.toArray(),\n            version: Zi(e.version)\n        };\n    }\n    return s;\n}\n\nfunction Xi(t) {\n    const e = t.toTimestamp();\n    return [ e.seconds, e.nanoseconds ];\n}\n\nfunction Zi(t) {\n    const e = t.toTimestamp();\n    return {\n        seconds: e.seconds,\n        nanoseconds: e.nanoseconds\n    };\n}\n\nfunction tr(t) {\n    const e = new nt(t.seconds, t.nanoseconds);\n    return st.fromTimestamp(e);\n}\n\n/** Encodes a batch of mutations into a DbMutationBatch for local storage. */\n/** Decodes a DbMutationBatch into a MutationBatch */\nfunction er(t, e) {\n    const n = (e.baseMutations || []).map((e => ei(t.ie, e)));\n    // Squash old transform mutations into existing patch or set mutations.\n    // The replacement of representing `transforms` with `update_transforms`\n    // on the SDK means that old `transform` mutations stored in IndexedDB need\n    // to be updated to `update_transforms`.\n    // TODO(b/174608374): Remove this code once we perform a schema migration.\n        for (let t = 0; t < e.mutations.length - 1; ++t) {\n        const n = e.mutations[t];\n        if (t + 1 < e.mutations.length && void 0 !== e.mutations[t + 1].transform) {\n            const s = e.mutations[t + 1];\n            n.updateTransforms = s.transform.fieldTransforms, e.mutations.splice(t + 1, 1), \n            ++t;\n        }\n    }\n    const s = e.mutations.map((e => ei(t.ie, e))), i = nt.fromMillis(e.localWriteTimeMs);\n    return new Qi(e.batchId, i, n, s);\n}\n\n/** Decodes a DbTarget into TargetData */ function nr(t) {\n    const e = tr(t.readTime), n = void 0 !== t.lastLimboFreeSnapshotVersion ? tr(t.lastLimboFreeSnapshotVersion) : st.min();\n    let s;\n    var i;\n    return void 0 !== t.query.documents ? (M(1 === (i = t.query).documents.length), \n    s = gn(ln(Ws(i.documents[0])))) : s = function(t) {\n        return gn(ri(t));\n    }(t.query), new zi(s, t.targetId, 0 /* TargetPurpose.Listen */ , t.lastListenSequenceNumber, e, n, Qt.fromBase64String(t.resumeToken));\n}\n\n/** Encodes TargetData into a DbTarget for storage locally. */ function sr(t, e) {\n    const n = Zi(e.snapshotVersion), s = Zi(e.lastLimboFreeSnapshotVersion);\n    let i;\n    i = rn(e.target) ? si(t.ie, e.target) : ii(t.ie, e.target);\n    // We can't store the resumeToken as a ByteString in IndexedDb, so we\n    // convert it to a base64 string for storage.\n        const r = e.resumeToken.toBase64();\n    // lastListenSequenceNumber is always 0 until we do real GC.\n        return {\n        targetId: e.targetId,\n        canonicalId: nn(e.target),\n        readTime: n,\n        resumeToken: r,\n        lastListenSequenceNumber: e.sequenceNumber,\n        lastLimboFreeSnapshotVersion: s,\n        query: i\n    };\n}\n\n/**\n * A helper function for figuring out what kind of query has been stored.\n */\n/**\n * Encodes a `BundledQuery` from bundle proto to a Query object.\n *\n * This reconstructs the original query used to build the bundle being loaded,\n * including features exists only in SDKs (for example: limit-to-last).\n */\nfunction ir(t) {\n    const e = ri({\n        parent: t.parent,\n        structuredQuery: t.structuredQuery\n    });\n    return \"LAST\" === t.limitType ? pn(e, e.limit, \"L\" /* LimitType.Last */) : e;\n}\n\n/** Encodes a NamedQuery proto object to a NamedQuery model object. */\n/** Encodes a DbDocumentOverlay object to an Overlay model object. */\nfunction rr(t, e) {\n    return new Wi(e.largestBatchId, ei(t.ie, e.overlayMutation));\n}\n\n/** Decodes an Overlay model object into a DbDocumentOverlay object. */\n/**\n * Returns the DbDocumentOverlayKey corresponding to the given user and\n * document key.\n */\nfunction or(t, e) {\n    const n = e.path.lastSegment();\n    return [ t, mi(e.path.popLast()), n ];\n}\n\nfunction ur(t, e, n, s) {\n    return {\n        indexId: t,\n        uid: e.uid || \"\",\n        sequenceNumber: n,\n        readTime: Zi(s.readTime),\n        documentKey: mi(s.documentKey.path),\n        largestBatchId: s.largestBatchId\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 cr {\n    getBundleMetadata(t, e) {\n        return ar(t).get(e).next((t => {\n            if (t) return {\n                id: (e = t).bundleId,\n                createTime: tr(e.createTime),\n                version: e.version\n            };\n            /** Encodes a DbBundle to a BundleMetadata object. */\n            var e;\n            /** Encodes a BundleMetadata to a DbBundle. */        }));\n    }\n    saveBundleMetadata(t, e) {\n        return ar(t).put({\n            bundleId: (n = e).id,\n            createTime: Zi(qs(n.createTime)),\n            version: n.version\n        });\n        var n;\n        /** Encodes a DbNamedQuery to a NamedQuery. */    }\n    getNamedQuery(t, e) {\n        return hr(t).get(e).next((t => {\n            if (t) return {\n                name: (e = t).name,\n                query: ir(e.bundledQuery),\n                readTime: tr(e.readTime)\n            };\n            var e;\n            /** Encodes a NamedQuery from a bundle proto to a DbNamedQuery. */        }));\n    }\n    saveNamedQuery(t, e) {\n        return hr(t).put(function(t) {\n            return {\n                name: t.name,\n                readTime: Zi(qs(t.readTime)),\n                bundledQuery: t.bundledQuery\n            };\n        }(e));\n    }\n}\n\n/**\n * Helper to get a typed SimpleDbStore for the bundles object store.\n */ function ar(t) {\n    return Gi(t, \"bundles\");\n}\n\n/**\n * Helper to get a typed SimpleDbStore for the namedQueries object store.\n */ function hr(t) {\n    return Gi(t, \"namedQueries\");\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 * Implementation of DocumentOverlayCache using IndexedDb.\n */ class lr {\n    /**\n     * @param serializer - The document serializer.\n     * @param userId - The userId for which we are accessing overlays.\n     */\n    constructor(t, e) {\n        this.yt = t, this.userId = e;\n    }\n    static re(t, e) {\n        const n = e.uid || \"\";\n        return new lr(t, n);\n    }\n    getOverlay(t, e) {\n        return fr(t).get(or(this.userId, e)).next((t => t ? rr(this.yt, t) : null));\n    }\n    getOverlays(t, e) {\n        const n = gs();\n        return At.forEach(e, (e => this.getOverlay(t, e).next((t => {\n            null !== t && n.set(e, t);\n        })))).next((() => n));\n    }\n    saveOverlays(t, e, n) {\n        const s = [];\n        return n.forEach(((n, i) => {\n            const r = new Wi(e, i);\n            s.push(this.oe(t, r));\n        })), At.waitFor(s);\n    }\n    removeOverlaysForBatchId(t, e, n) {\n        const s = new Set;\n        // Get the set of unique collection paths.\n                e.forEach((t => s.add(mi(t.getCollectionPath()))));\n        const i = [];\n        return s.forEach((e => {\n            const s = IDBKeyRange.bound([ this.userId, e, n ], [ this.userId, e, n + 1 ], \n            /*lowerOpen=*/ !1, \n            /*upperOpen=*/ !0);\n            i.push(fr(t).Y(\"collectionPathOverlayIndex\", s));\n        })), At.waitFor(i);\n    }\n    getOverlaysForCollection(t, e, n) {\n        const s = gs(), i = mi(e), r = IDBKeyRange.bound([ this.userId, i, n ], [ this.userId, i, Number.POSITIVE_INFINITY ], \n        /*lowerOpen=*/ !0);\n        return fr(t).W(\"collectionPathOverlayIndex\", r).next((t => {\n            for (const e of t) {\n                const t = rr(this.yt, e);\n                s.set(t.getKey(), t);\n            }\n            return s;\n        }));\n    }\n    getOverlaysForCollectionGroup(t, e, n, s) {\n        const i = gs();\n        let r;\n        // We want batch IDs larger than `sinceBatchId`, and so the lower bound\n        // is not inclusive.\n                const o = IDBKeyRange.bound([ this.userId, e, n ], [ this.userId, e, Number.POSITIVE_INFINITY ], \n        /*lowerOpen=*/ !0);\n        return fr(t).Z({\n            index: \"collectionGroupOverlayIndex\",\n            range: o\n        }, ((t, e, n) => {\n            // We do not want to return partial batch overlays, even if the size\n            // of the result set exceeds the given `count` argument. Therefore, we\n            // continue to aggregate results even after the result size exceeds\n            // `count` if there are more overlays from the `currentBatchId`.\n            const o = rr(this.yt, e);\n            i.size() < s || o.largestBatchId === r ? (i.set(o.getKey(), o), r = o.largestBatchId) : n.done();\n        })).next((() => i));\n    }\n    oe(t, e) {\n        return fr(t).put(function(t, e, n) {\n            const [s, i, r] = or(e, n.mutation.key);\n            return {\n                userId: e,\n                collectionPath: i,\n                documentId: r,\n                collectionGroup: n.mutation.key.getCollectionGroup(),\n                largestBatchId: n.largestBatchId,\n                overlayMutation: ti(t.ie, n.mutation)\n            };\n        }(this.yt, this.userId, e));\n    }\n}\n\n/**\n * Helper to get a typed SimpleDbStore for the document overlay object store.\n */ function fr(t) {\n    return Gi(t, \"documentOverlays\");\n}\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// Note: This code is copied from the backend. Code that is not used by\n// Firestore was removed.\n/** Firestore index value writer.  */\nclass dr {\n    constructor() {}\n    // The write methods below short-circuit writing terminators for values\n    // containing a (terminating) truncated value.\n    // As an example, consider the resulting encoding for:\n    // [\"bar\", [2, \"foo\"]] -> (STRING, \"bar\", TERM, ARRAY, NUMBER, 2, STRING, \"foo\", TERM, TERM, TERM)\n    // [\"bar\", [2, truncated(\"foo\")]] -> (STRING, \"bar\", TERM, ARRAY, NUMBER, 2, STRING, \"foo\", TRUNC)\n    // [\"bar\", truncated([\"foo\"])] -> (STRING, \"bar\", TERM, ARRAY. STRING, \"foo\", TERM, TRUNC)\n    /** Writes an index value.  */\n    ue(t, e) {\n        this.ce(t, e), \n        // Write separator to split index values\n        // (see go/firestore-storage-format#encodings).\n        e.ae();\n    }\n    ce(t, e) {\n        if (\"nullValue\" in t) this.he(e, 5); else if (\"booleanValue\" in t) this.he(e, 10), \n        e.le(t.booleanValue ? 1 : 0); else if (\"integerValue\" in t) this.he(e, 15), e.le(zt(t.integerValue)); else if (\"doubleValue\" in t) {\n            const n = zt(t.doubleValue);\n            isNaN(n) ? this.he(e, 13) : (this.he(e, 15), Ut(n) ? \n            // -0.0, 0 and 0.0 are all considered the same\n            e.le(0) : e.le(n));\n        } else if (\"timestampValue\" in t) {\n            const n = t.timestampValue;\n            this.he(e, 20), \"string\" == typeof n ? e.fe(n) : (e.fe(`${n.seconds || \"\"}`), e.le(n.nanos || 0));\n        } else if (\"stringValue\" in t) this.de(t.stringValue, e), this._e(e); else if (\"bytesValue\" in t) this.he(e, 30), \n        e.we(Ht(t.bytesValue)), this._e(e); else if (\"referenceValue\" in t) this.me(t.referenceValue, e); else if (\"geoPointValue\" in t) {\n            const n = t.geoPointValue;\n            this.he(e, 45), e.le(n.latitude || 0), e.le(n.longitude || 0);\n        } else \"mapValue\" in t ? we(t) ? this.he(e, Number.MAX_SAFE_INTEGER) : (this.ge(t.mapValue, e), \n        this._e(e)) : \"arrayValue\" in t ? (this.ye(t.arrayValue, e), this._e(e)) : O();\n    }\n    de(t, e) {\n        this.he(e, 25), this.pe(t, e);\n    }\n    pe(t, e) {\n        e.fe(t);\n    }\n    ge(t, e) {\n        const n = t.fields || {};\n        this.he(e, 55);\n        for (const t of Object.keys(n)) this.de(t, e), this.ce(n[t], e);\n    }\n    ye(t, e) {\n        const n = t.values || [];\n        this.he(e, 50);\n        for (const t of n) this.ce(t, e);\n    }\n    me(t, e) {\n        this.he(e, 37);\n        ct.fromName(t).path.forEach((t => {\n            this.he(e, 60), this.pe(t, e);\n        }));\n    }\n    he(t, e) {\n        t.le(e);\n    }\n    _e(t) {\n        // While the SDK does not implement truncation, the truncation marker is\n        // used to terminate all variable length values (which are strings, bytes,\n        // references, arrays and maps).\n        t.le(2);\n    }\n}\n\ndr.Ie = new dr;\n\n/**\n * Counts the number of zeros in a byte.\n *\n * Visible for testing.\n */\nfunction _r(t) {\n    if (0 === t) return 8;\n    let e = 0;\n    return t >> 4 == 0 && (\n    // Test if the first four bits are zero.\n    e += 4, t <<= 4), t >> 6 == 0 && (\n    // Test if the first two (or next two) bits are zero.\n    e += 2, t <<= 2), t >> 7 == 0 && (\n    // Test if the remaining bit is zero.\n    e += 1), e;\n}\n\n/** Counts the number of leading zeros in the given byte array. */\n/**\n * Returns the number of bytes required to store \"value\". Leading zero bytes\n * are skipped.\n */\nfunction wr(t) {\n    // This is just the number of bytes for the unsigned representation of the number.\n    const e = 64 - function(t) {\n        let e = 0;\n        for (let n = 0; n < 8; ++n) {\n            const s = _r(255 & t[n]);\n            if (e += s, 8 !== s) break;\n        }\n        return e;\n    }(t);\n    return Math.ceil(e / 8);\n}\n\n/**\n * OrderedCodeWriter is a minimal-allocation implementation of the writing\n * behavior defined by the backend.\n *\n * The code is ported from its Java counterpart.\n */ class mr {\n    constructor() {\n        this.buffer = new Uint8Array(1024), this.position = 0;\n    }\n    Te(t) {\n        const e = t[Symbol.iterator]();\n        let n = e.next();\n        for (;!n.done; ) this.Ee(n.value), n = e.next();\n        this.Ae();\n    }\n    Re(t) {\n        const e = t[Symbol.iterator]();\n        let n = e.next();\n        for (;!n.done; ) this.be(n.value), n = e.next();\n        this.Pe();\n    }\n    /** Writes utf8 bytes into this byte sequence, ascending. */    ve(t) {\n        for (const e of t) {\n            const t = e.charCodeAt(0);\n            if (t < 128) this.Ee(t); else if (t < 2048) this.Ee(960 | t >>> 6), this.Ee(128 | 63 & t); else if (e < \"\\ud800\" || \"\\udbff\" < e) this.Ee(480 | t >>> 12), \n            this.Ee(128 | 63 & t >>> 6), this.Ee(128 | 63 & t); else {\n                const t = e.codePointAt(0);\n                this.Ee(240 | t >>> 18), this.Ee(128 | 63 & t >>> 12), this.Ee(128 | 63 & t >>> 6), \n                this.Ee(128 | 63 & t);\n            }\n        }\n        this.Ae();\n    }\n    /** Writes utf8 bytes into this byte sequence, descending */    Ve(t) {\n        for (const e of t) {\n            const t = e.charCodeAt(0);\n            if (t < 128) this.be(t); else if (t < 2048) this.be(960 | t >>> 6), this.be(128 | 63 & t); else if (e < \"\\ud800\" || \"\\udbff\" < e) this.be(480 | t >>> 12), \n            this.be(128 | 63 & t >>> 6), this.be(128 | 63 & t); else {\n                const t = e.codePointAt(0);\n                this.be(240 | t >>> 18), this.be(128 | 63 & t >>> 12), this.be(128 | 63 & t >>> 6), \n                this.be(128 | 63 & t);\n            }\n        }\n        this.Pe();\n    }\n    Se(t) {\n        // Values are encoded with a single byte length prefix, followed by the\n        // actual value in big-endian format with leading 0 bytes dropped.\n        const e = this.De(t), n = wr(e);\n        this.Ce(1 + n), this.buffer[this.position++] = 255 & n;\n        // Write the length\n        for (let t = e.length - n; t < e.length; ++t) this.buffer[this.position++] = 255 & e[t];\n    }\n    xe(t) {\n        // Values are encoded with a single byte length prefix, followed by the\n        // inverted value in big-endian format with leading 0 bytes dropped.\n        const e = this.De(t), n = wr(e);\n        this.Ce(1 + n), this.buffer[this.position++] = ~(255 & n);\n        // Write the length\n        for (let t = e.length - n; t < e.length; ++t) this.buffer[this.position++] = ~(255 & e[t]);\n    }\n    /**\n     * Writes the \"infinity\" byte sequence that sorts after all other byte\n     * sequences written in ascending order.\n     */    Ne() {\n        this.ke(255), this.ke(255);\n    }\n    /**\n     * Writes the \"infinity\" byte sequence that sorts before all other byte\n     * sequences written in descending order.\n     */    Oe() {\n        this.Me(255), this.Me(255);\n    }\n    /**\n     * Resets the buffer such that it is the same as when it was newly\n     * constructed.\n     */    reset() {\n        this.position = 0;\n    }\n    seed(t) {\n        this.Ce(t.length), this.buffer.set(t, this.position), this.position += t.length;\n    }\n    /** Makes a copy of the encoded bytes in this buffer.  */    Fe() {\n        return this.buffer.slice(0, this.position);\n    }\n    /**\n     * Encodes `val` into an encoding so that the order matches the IEEE 754\n     * floating-point comparison results with the following exceptions:\n     *   -0.0 < 0.0\n     *   all non-NaN < NaN\n     *   NaN = NaN\n     */    De(t) {\n        const e = \n        /** Converts a JavaScript number to a byte array (using big endian encoding). */\n        function(t) {\n            const e = new DataView(new ArrayBuffer(8));\n            return e.setFloat64(0, t, /* littleEndian= */ !1), new Uint8Array(e.buffer);\n        }(t), n = 0 != (128 & e[0]);\n        // Check if the first bit is set. We use a bit mask since value[0] is\n        // encoded as a number from 0 to 255.\n                // Revert the two complement to get natural ordering\n        e[0] ^= n ? 255 : 128;\n        for (let t = 1; t < e.length; ++t) e[t] ^= n ? 255 : 0;\n        return e;\n    }\n    /** Writes a single byte ascending to the buffer. */    Ee(t) {\n        const e = 255 & t;\n        0 === e ? (this.ke(0), this.ke(255)) : 255 === e ? (this.ke(255), this.ke(0)) : this.ke(e);\n    }\n    /** Writes a single byte descending to the buffer.  */    be(t) {\n        const e = 255 & t;\n        0 === e ? (this.Me(0), this.Me(255)) : 255 === e ? (this.Me(255), this.Me(0)) : this.Me(t);\n    }\n    Ae() {\n        this.ke(0), this.ke(1);\n    }\n    Pe() {\n        this.Me(0), this.Me(1);\n    }\n    ke(t) {\n        this.Ce(1), this.buffer[this.position++] = t;\n    }\n    Me(t) {\n        this.Ce(1), this.buffer[this.position++] = ~t;\n    }\n    Ce(t) {\n        const e = t + this.position;\n        if (e <= this.buffer.length) return;\n        // Try doubling.\n                let n = 2 * this.buffer.length;\n        // Still not big enough? Just allocate the right size.\n                n < e && (n = e);\n        // Create the new buffer.\n                const s = new Uint8Array(n);\n        s.set(this.buffer), // copy old data\n        this.buffer = s;\n    }\n}\n\nclass gr {\n    constructor(t) {\n        this.$e = t;\n    }\n    we(t) {\n        this.$e.Te(t);\n    }\n    fe(t) {\n        this.$e.ve(t);\n    }\n    le(t) {\n        this.$e.Se(t);\n    }\n    ae() {\n        this.$e.Ne();\n    }\n}\n\nclass yr {\n    constructor(t) {\n        this.$e = t;\n    }\n    we(t) {\n        this.$e.Re(t);\n    }\n    fe(t) {\n        this.$e.Ve(t);\n    }\n    le(t) {\n        this.$e.xe(t);\n    }\n    ae() {\n        this.$e.Oe();\n    }\n}\n\n/**\n * Implements `DirectionalIndexByteEncoder` using `OrderedCodeWriter` for the\n * actual encoding.\n */ class pr {\n    constructor() {\n        this.$e = new mr, this.Be = new gr(this.$e), this.Le = new yr(this.$e);\n    }\n    seed(t) {\n        this.$e.seed(t);\n    }\n    qe(t) {\n        return 0 /* IndexKind.ASCENDING */ === t ? this.Be : this.Le;\n    }\n    Fe() {\n        return this.$e.Fe();\n    }\n    reset() {\n        this.$e.reset();\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/** Represents an index entry saved by the SDK in persisted storage. */ class Ir {\n    constructor(t, e, n, s) {\n        this.indexId = t, this.documentKey = e, this.arrayValue = n, this.directionalValue = s;\n    }\n    /**\n     * Returns an IndexEntry entry that sorts immediately after the current\n     * directional value.\n     */    Ue() {\n        const t = this.directionalValue.length, e = 0 === t || 255 === this.directionalValue[t - 1] ? t + 1 : t, n = new Uint8Array(e);\n        return n.set(this.directionalValue, 0), e !== t ? n.set([ 0 ], this.directionalValue.length) : ++n[n.length - 1], \n        new Ir(this.indexId, this.documentKey, this.arrayValue, n);\n    }\n}\n\nfunction Tr(t, e) {\n    let n = t.indexId - e.indexId;\n    return 0 !== n ? n : (n = Er(t.arrayValue, e.arrayValue), 0 !== n ? n : (n = Er(t.directionalValue, e.directionalValue), \n    0 !== n ? n : ct.comparator(t.documentKey, e.documentKey)));\n}\n\nfunction Er(t, e) {\n    for (let n = 0; n < t.length && n < e.length; ++n) {\n        const s = t[n] - e[n];\n        if (0 !== s) return s;\n    }\n    return t.length - e.length;\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 * A light query planner for Firestore.\n *\n * This class matches a `FieldIndex` against a Firestore Query `Target`. It\n * determines whether a given index can be used to serve the specified target.\n *\n * The following table showcases some possible index configurations:\n *\n * Query                                               | Index\n * -----------------------------------------------------------------------------\n * where('a', '==', 'a').where('b', '==', 'b')         | a ASC, b DESC\n * where('a', '==', 'a').where('b', '==', 'b')         | a ASC\n * where('a', '==', 'a').where('b', '==', 'b')         | b DESC\n * where('a', '>=', 'a').orderBy('a')                  | a ASC\n * where('a', '>=', 'a').orderBy('a', 'desc')          | a DESC\n * where('a', '>=', 'a').orderBy('a').orderBy('b')     | a ASC, b ASC\n * where('a', '>=', 'a').orderBy('a').orderBy('b')     | a ASC\n * where('a', 'array-contains', 'a').orderBy('b')      | a CONTAINS, b ASCENDING\n * where('a', 'array-contains', 'a').orderBy('b')      | a CONTAINS\n */ class Ar {\n    constructor(t) {\n        this.collectionId = null != t.collectionGroup ? t.collectionGroup : t.path.lastSegment(), \n        this.Ke = t.orderBy, this.Ge = [];\n        for (const e of t.filters) {\n            const t = e;\n            t.isInequality() ? this.Qe = t : this.Ge.push(t);\n        }\n    }\n    /**\n     * Returns whether the index can be used to serve the TargetIndexMatcher's\n     * target.\n     *\n     * An index is considered capable of serving the target when:\n     * - The target uses all index segments for its filters and orderBy clauses.\n     *   The target can have additional filter and orderBy clauses, but not\n     *   fewer.\n     * - If an ArrayContains/ArrayContainsAnyfilter is used, the index must also\n     *   have a corresponding `CONTAINS` segment.\n     * - All directional index segments can be mapped to the target as a series of\n     *   equality filters, a single inequality filter and a series of orderBy\n     *   clauses.\n     * - The segments that represent the equality filters may appear out of order.\n     * - The optional segment for the inequality filter must appear after all\n     *   equality segments.\n     * - The segments that represent that orderBy clause of the target must appear\n     *   in order after all equality and inequality segments. Single orderBy\n     *   clauses cannot be skipped, but a continuous orderBy suffix may be\n     *   omitted.\n     */    je(t) {\n        M(t.collectionGroup === this.collectionId);\n        // If there is an array element, find a matching filter.\n        const e = ht(t);\n        if (void 0 !== e && !this.We(e)) return !1;\n        const n = lt(t);\n        let s = 0, i = 0;\n        // Process all equalities first. Equalities can appear out of order.\n        for (;s < n.length && this.We(n[s]); ++s) ;\n        // If we already have processed all segments, all segments are used to serve\n        // the equality filters and we do not need to map any segments to the\n        // target's inequality and orderBy clauses.\n                if (s === n.length) return !0;\n        // If there is an inequality filter, the next segment must match both the\n        // filter and the first orderBy clause.\n                if (void 0 !== this.Qe) {\n            const t = n[s];\n            if (!this.ze(this.Qe, t) || !this.He(this.Ke[i++], t)) return !1;\n            ++s;\n        }\n        // All remaining segments need to represent the prefix of the target's\n        // orderBy.\n                for (;s < n.length; ++s) {\n            const t = n[s];\n            if (i >= this.Ke.length || !this.He(this.Ke[i++], t)) return !1;\n        }\n        return !0;\n    }\n    We(t) {\n        for (const e of this.Ge) if (this.ze(e, t)) return !0;\n        return !1;\n    }\n    ze(t, e) {\n        if (void 0 === t || !t.field.isEqual(e.fieldPath)) return !1;\n        const n = \"array-contains\" /* Operator.ARRAY_CONTAINS */ === t.op || \"array-contains-any\" /* Operator.ARRAY_CONTAINS_ANY */ === t.op;\n        return 2 /* IndexKind.CONTAINS */ === e.kind === n;\n    }\n    He(t, e) {\n        return !!t.field.isEqual(e.fieldPath) && (0 /* IndexKind.ASCENDING */ === e.kind && \"asc\" /* Direction.ASCENDING */ === t.dir || 1 /* IndexKind.DESCENDING */ === e.kind && \"desc\" /* Direction.DESCENDING */ === t.dir);\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 * Provides utility functions that help with boolean logic transformations needed for handling\n * complex filters used in queries.\n */\n/**\n * The `in` filter is only a syntactic sugar over a disjunction of equalities. For instance: `a in\n * [1,2,3]` is in fact `a==1 || a==2 || a==3`. This method expands any `in` filter in the given\n * input into a disjunction of equality filters and returns the expanded filter.\n */ function Rr(t) {\n    var e, n;\n    if (M(t instanceof Re || t instanceof be), t instanceof Re) {\n        if (t instanceof Be) {\n            const s = (null === (n = null === (e = t.value.arrayValue) || void 0 === e ? void 0 : e.values) || void 0 === n ? void 0 : n.map((e => Re.create(t.field, \"==\" /* Operator.EQUAL */ , e)))) || [];\n            return be.create(s, \"or\" /* CompositeOperator.OR */);\n        }\n        // We have reached other kinds of field filters.\n        return t;\n    }\n    // We have a composite filter.\n        const s = t.filters.map((t => Rr(t)));\n    return be.create(s, t.op);\n}\n\n/**\n * Given a composite filter, returns the list of terms in its disjunctive normal form.\n *\n * <p>Each element in the return value is one term of the resulting DNF. For instance: For the\n * input: (A || B) && C, the DNF form is: (A && C) || (B && C), and the return value is a list\n * with two elements: a composite filter that performs (A && C), and a composite filter that\n * performs (B && C).\n *\n * @param filter the composite filter to calculate DNF transform for.\n * @return the terms in the DNF transform.\n */ function br(t) {\n    if (0 === t.getFilters().length) return [];\n    const e = Sr(Rr(t));\n    return M(Vr(e)), Pr(e) || vr(e) ? [ e ] : e.getFilters();\n}\n\n/** Returns true if the given filter is a single field filter. e.g. (a == 10). */ function Pr(t) {\n    return t instanceof Re;\n}\n\n/**\n * Returns true if the given filter is the conjunction of one or more field filters. e.g. (a == 10\n * && b == 20)\n */ function vr(t) {\n    return t instanceof be && Ve(t);\n}\n\n/**\n * Returns whether or not the given filter is in disjunctive normal form (DNF).\n *\n * <p>In boolean logic, a disjunctive normal form (DNF) is a canonical normal form of a logical\n * formula consisting of a disjunction of conjunctions; it can also be described as an OR of ANDs.\n *\n * <p>For more info, visit: https://en.wikipedia.org/wiki/Disjunctive_normal_form\n */ function Vr(t) {\n    return Pr(t) || vr(t) || \n    /**\n * Returns true if the given filter is the disjunction of one or more \"flat conjunctions\" and\n * field filters. e.g. (a == 10) || (b==20 && c==30)\n */\n    function(t) {\n        if (t instanceof be && ve(t)) {\n            for (const e of t.getFilters()) if (!Pr(e) && !vr(e)) return !1;\n            return !0;\n        }\n        return !1;\n    }(t);\n}\n\nfunction Sr(t) {\n    if (M(t instanceof Re || t instanceof be), t instanceof Re) return t;\n    if (1 === t.filters.length) return Sr(t.filters[0]);\n    // Compute DNF for each of the subfilters first\n        const e = t.filters.map((t => Sr(t)));\n    let n = be.create(e, t.op);\n    return n = xr(n), Vr(n) ? n : (M(n instanceof be), M(Pe(n)), M(n.filters.length > 1), \n    n.filters.reduce(((t, e) => Dr(t, e))));\n}\n\nfunction Dr(t, e) {\n    let n;\n    return M(t instanceof Re || t instanceof be), M(e instanceof Re || e instanceof be), \n    // FieldFilter FieldFilter\n    n = t instanceof Re ? e instanceof Re ? function(t, e) {\n        // Conjunction distribution for two field filters is the conjunction of them.\n        return be.create([ t, e ], \"and\" /* CompositeOperator.AND */);\n    }(t, e) : Cr(t, e) : e instanceof Re ? Cr(e, t) : function(t, e) {\n        // There are four cases:\n        // (A & B) & (C & D) --> (A & B & C & D)\n        // (A & B) & (C | D) --> (A & B & C) | (A & B & D)\n        // (A | B) & (C & D) --> (C & D & A) | (C & D & B)\n        // (A | B) & (C | D) --> (A & C) | (A & D) | (B & C) | (B & D)\n        // Case 1 is a merge.\n        if (M(t.filters.length > 0 && e.filters.length > 0), Pe(t) && Pe(e)) return xe(t, e.getFilters());\n        // Case 2,3,4 all have at least one side (lhs or rhs) that is a disjunction. In all three cases\n        // we should take each element of the disjunction and distribute it over the other side, and\n        // return the disjunction of the distribution results.\n                const n = ve(t) ? t : e, s = ve(t) ? e : t, i = n.filters.map((t => Dr(t, s)));\n        return be.create(i, \"or\" /* CompositeOperator.OR */);\n    }(t, e), xr(n);\n}\n\nfunction Cr(t, e) {\n    // There are two cases:\n    // A & (B & C) --> (A & B & C)\n    // A & (B | C) --> (A & B) | (A & C)\n    if (Pe(e)) \n    // Case 1\n    return xe(e, t.getFilters());\n    {\n        // Case 2\n        const n = e.filters.map((e => Dr(t, e)));\n        return be.create(n, \"or\" /* CompositeOperator.OR */);\n    }\n}\n\n/**\n * Applies the associativity property to the given filter and returns the resulting filter.\n *\n * <ul>\n *   <li>A | (B | C) == (A | B) | C == (A | B | C)\n *   <li>A & (B & C) == (A & B) & C == (A & B & C)\n * </ul>\n *\n * <p>For more info, visit: https://en.wikipedia.org/wiki/Associative_property#Propositional_logic\n */ function xr(t) {\n    if (M(t instanceof Re || t instanceof be), t instanceof Re) return t;\n    const e = t.getFilters();\n    // If the composite filter only contains 1 filter, apply associativity to it.\n        if (1 === e.length) return xr(e[0]);\n    // Associativity applied to a flat composite filter results is itself.\n        if (Se(t)) return t;\n    // First apply associativity to all subfilters. This will in turn recursively apply\n    // associativity to all nested composite filters and field filters.\n        const n = e.map((t => xr(t))), s = [];\n    // For composite subfilters that perform the same kind of logical operation as `compositeFilter`\n    // take out their filters and add them to `compositeFilter`. For example:\n    // compositeFilter = (A | (B | C | D))\n    // compositeSubfilter = (B | C | D)\n    // Result: (A | B | C | D)\n    // Note that the `compositeSubfilter` has been eliminated, and its filters (B, C, D) have been\n    // added to the top-level \"compositeFilter\".\n        return n.forEach((e => {\n        e instanceof Re ? s.push(e) : e instanceof be && (e.op === t.op ? \n        // compositeFilter: (A | (B | C))\n        // compositeSubfilter: (B | C)\n        // Result: (A | B | C)\n        s.push(...e.filters) : \n        // compositeFilter: (A | (B & C))\n        // compositeSubfilter: (B & C)\n        // Result: (A | (B & C))\n        s.push(e));\n    })), 1 === s.length ? s[0] : be.create(s, t.op);\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 * An in-memory implementation of IndexManager.\n */ class Nr {\n    constructor() {\n        this.Je = new kr;\n    }\n    addToCollectionParentIndex(t, e) {\n        return this.Je.add(e), At.resolve();\n    }\n    getCollectionParents(t, e) {\n        return At.resolve(this.Je.getEntries(e));\n    }\n    addFieldIndex(t, e) {\n        // Field indices are not supported with memory persistence.\n        return At.resolve();\n    }\n    deleteFieldIndex(t, e) {\n        // Field indices are not supported with memory persistence.\n        return At.resolve();\n    }\n    getDocumentsMatchingTarget(t, e) {\n        // Field indices are not supported with memory persistence.\n        return At.resolve(null);\n    }\n    getIndexType(t, e) {\n        // Field indices are not supported with memory persistence.\n        return At.resolve(0 /* IndexType.NONE */);\n    }\n    getFieldIndexes(t, e) {\n        // Field indices are not supported with memory persistence.\n        return At.resolve([]);\n    }\n    getNextCollectionGroupToUpdate(t) {\n        // Field indices are not supported with memory persistence.\n        return At.resolve(null);\n    }\n    getMinOffset(t, e) {\n        return At.resolve(yt.min());\n    }\n    getMinOffsetFromCollectionGroup(t, e) {\n        return At.resolve(yt.min());\n    }\n    updateCollectionGroup(t, e, n) {\n        // Field indices are not supported with memory persistence.\n        return At.resolve();\n    }\n    updateIndexEntries(t, e) {\n        // Field indices are not supported with memory persistence.\n        return At.resolve();\n    }\n}\n\n/**\n * Internal implementation of the collection-parent index exposed by MemoryIndexManager.\n * Also used for in-memory caching by IndexedDbIndexManager and initial index population\n * in indexeddb_schema.ts\n */ class kr {\n    constructor() {\n        this.index = {};\n    }\n    // Returns false if the entry already existed.\n    add(t) {\n        const e = t.lastSegment(), n = t.popLast(), s = this.index[e] || new We(rt.comparator), i = !s.has(n);\n        return this.index[e] = s.add(n), i;\n    }\n    has(t) {\n        const e = t.lastSegment(), n = t.popLast(), s = this.index[e];\n        return s && s.has(n);\n    }\n    getEntries(t) {\n        return (this.index[t] || new We(rt.comparator)).toArray();\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 */ const Or = new Uint8Array(0);\n\n/**\n * A persisted implementation of IndexManager.\n *\n * PORTING NOTE: Unlike iOS and Android, the Web SDK does not memoize index\n * data as it supports multi-tab access.\n */\nclass Mr {\n    constructor(t, e) {\n        this.user = t, this.databaseId = e, \n        /**\n         * An in-memory copy of the index entries we've already written since the SDK\n         * launched. Used to avoid re-writing the same entry repeatedly.\n         *\n         * This is *NOT* a complete cache of what's in persistence and so can never be\n         * used to satisfy reads.\n         */\n        this.Ye = new kr, \n        /**\n         * Maps from a target to its equivalent list of sub-targets. Each sub-target\n         * contains only one term from the target's disjunctive normal form (DNF).\n         */\n        this.Xe = new ls((t => nn(t)), ((t, e) => sn(t, e))), this.uid = t.uid || \"\";\n    }\n    /**\n     * Adds a new entry to the collection parent index.\n     *\n     * Repeated calls for the same collectionPath should be avoided within a\n     * transaction as IndexedDbIndexManager only caches writes once a transaction\n     * has been committed.\n     */    addToCollectionParentIndex(t, e) {\n        if (!this.Ye.has(e)) {\n            const n = e.lastSegment(), s = e.popLast();\n            t.addOnCommittedListener((() => {\n                // Add the collection to the in memory cache only if the transaction was\n                // successfully committed.\n                this.Ye.add(e);\n            }));\n            const i = {\n                collectionId: n,\n                parent: mi(s)\n            };\n            return Fr(t).put(i);\n        }\n        return At.resolve();\n    }\n    getCollectionParents(t, e) {\n        const n = [], s = IDBKeyRange.bound([ e, \"\" ], [ et(e), \"\" ], \n        /*lowerOpen=*/ !1, \n        /*upperOpen=*/ !0);\n        return Fr(t).W(s).next((t => {\n            for (const s of t) {\n                // This collectionId guard shouldn't be necessary (and isn't as long\n                // as we're running in a real browser), but there's a bug in\n                // indexeddbshim that breaks our range in our tests running in node:\n                // https://github.com/axemclion/IndexedDBShim/issues/334\n                if (s.collectionId !== e) break;\n                n.push(pi(s.parent));\n            }\n            return n;\n        }));\n    }\n    addFieldIndex(t, e) {\n        // TODO(indexing): Verify that the auto-incrementing index ID works in\n        // Safari & Firefox.\n        const n = Br(t), s = function(t) {\n            return {\n                indexId: t.indexId,\n                collectionGroup: t.collectionGroup,\n                fields: t.fields.map((t => [ t.fieldPath.canonicalString(), t.kind ]))\n            };\n        }(e);\n        delete s.indexId;\n        // `indexId` is auto-populated by IndexedDb\n        const i = n.add(s);\n        if (e.indexState) {\n            const n = Lr(t);\n            return i.next((t => {\n                n.put(ur(t, this.user, e.indexState.sequenceNumber, e.indexState.offset));\n            }));\n        }\n        return i.next();\n    }\n    deleteFieldIndex(t, e) {\n        const n = Br(t), s = Lr(t), i = $r(t);\n        return n.delete(e.indexId).next((() => s.delete(IDBKeyRange.bound([ e.indexId ], [ e.indexId + 1 ], \n        /*lowerOpen=*/ !1, \n        /*upperOpen=*/ !0)))).next((() => i.delete(IDBKeyRange.bound([ e.indexId ], [ e.indexId + 1 ], \n        /*lowerOpen=*/ !1, \n        /*upperOpen=*/ !0))));\n    }\n    getDocumentsMatchingTarget(t, e) {\n        const n = $r(t);\n        let s = !0;\n        const i = new Map;\n        return At.forEach(this.Ze(e), (e => this.tn(t, e).next((t => {\n            s && (s = !!t), i.set(e, t);\n        })))).next((() => {\n            if (s) {\n                let t = Es();\n                const s = [];\n                return At.forEach(i, ((i, r) => {\n                    var o;\n                    C(\"IndexedDbIndexManager\", `Using index ${o = i, `id=${o.indexId}|cg=${o.collectionGroup}|f=${o.fields.map((t => `${t.fieldPath}:${t.kind}`)).join(\",\")}`} to execute ${nn(e)}`);\n                    const u = function(t, e) {\n                        const n = ht(e);\n                        if (void 0 === n) return null;\n                        for (const e of on(t, n.fieldPath)) switch (e.op) {\n                          case \"array-contains-any\" /* Operator.ARRAY_CONTAINS_ANY */ :\n                            return e.value.arrayValue.values || [];\n\n                          case \"array-contains\" /* Operator.ARRAY_CONTAINS */ :\n                            return [ e.value ];\n                            // Remaining filters are not array filters.\n                                                }\n                        return null;\n                    }\n                    /**\n * Returns the list of values that are used in != or NOT_IN filters. Returns\n * `null` if there are no such filters.\n */ (r, i), c = function(t, e) {\n                        const n = new Map;\n                        for (const s of lt(e)) for (const e of on(t, s.fieldPath)) switch (e.op) {\n                          case \"==\" /* Operator.EQUAL */ :\n                          case \"in\" /* Operator.IN */ :\n                            // Encode equality prefix, which is encoded in the index value before\n                            // the inequality (e.g. `a == 'a' && b != 'b'` is encoded to\n                            // `value != 'ab'`).\n                            n.set(s.fieldPath.canonicalString(), e.value);\n                            break;\n\n                          case \"not-in\" /* Operator.NOT_IN */ :\n                          case \"!=\" /* Operator.NOT_EQUAL */ :\n                            // NotIn/NotEqual is always a suffix. There cannot be any remaining\n                            // segments and hence we can return early here.\n                            return n.set(s.fieldPath.canonicalString(), e.value), Array.from(n.values());\n                            // Remaining filters cannot be used as notIn bounds.\n                                                }\n                        return null;\n                    }\n                    /**\n * Returns a lower bound of field values that can be used as a starting point to\n * scan the index defined by `fieldIndex`. Returns `MIN_VALUE` if no lower bound\n * exists.\n */ (r, i), a = function(t, e) {\n                        const n = [];\n                        let s = !0;\n                        // For each segment, retrieve a lower bound if there is a suitable filter or\n                        // startAt.\n                                                for (const i of lt(e)) {\n                            const e = 0 /* IndexKind.ASCENDING */ === i.kind ? un(t, i.fieldPath, t.startAt) : cn(t, i.fieldPath, t.startAt);\n                            n.push(e.value), s && (s = e.inclusive);\n                        }\n                        return new Ie(n, s);\n                    }\n                    /**\n * Returns an upper bound of field values that can be used as an ending point\n * when scanning the index defined by `fieldIndex`. Returns `MAX_VALUE` if no\n * upper bound exists.\n */ (r, i), h = function(t, e) {\n                        const n = [];\n                        let s = !0;\n                        // For each segment, retrieve an upper bound if there is a suitable filter or\n                        // endAt.\n                                                for (const i of lt(e)) {\n                            const e = 0 /* IndexKind.ASCENDING */ === i.kind ? cn(t, i.fieldPath, t.endAt) : un(t, i.fieldPath, t.endAt);\n                            n.push(e.value), s && (s = e.inclusive);\n                        }\n                        return new Ie(n, s);\n                    }(r, i), l = this.en(i, r, a), f = this.en(i, r, h), d = this.nn(i, r, c), _ = this.sn(i.indexId, u, l, a.inclusive, f, h.inclusive, d);\n                    return At.forEach(_, (i => n.J(i, e.limit).next((e => {\n                        e.forEach((e => {\n                            const n = ct.fromSegments(e.documentKey);\n                            t.has(n) || (t = t.add(n), s.push(n));\n                        }));\n                    }))));\n                })).next((() => s));\n            }\n            return At.resolve(null);\n        }));\n    }\n    Ze(t) {\n        let e = this.Xe.get(t);\n        if (e) return e;\n        if (0 === t.filters.length) e = [ t ]; else {\n            e = br(be.create(t.filters, \"and\" /* CompositeOperator.AND */)).map((e => en(t.path, t.collectionGroup, t.orderBy, e.getFilters(), t.limit, t.startAt, t.endAt)));\n        }\n        return this.Xe.set(t, e), e;\n    }\n    /**\n     * Constructs a key range query on `DbIndexEntryStore` that unions all\n     * bounds.\n     */    sn(t, e, n, s, i, r, o) {\n        // The number of total index scans we union together. This is similar to a\n        // distributed normal form, but adapted for array values. We create a single\n        // index range per value in an ARRAY_CONTAINS or ARRAY_CONTAINS_ANY filter\n        // combined with the values from the query bounds.\n        const u = (null != e ? e.length : 1) * Math.max(n.length, i.length), c = u / (null != e ? e.length : 1), a = [];\n        for (let h = 0; h < u; ++h) {\n            const u = e ? this.rn(e[h / c]) : Or, l = this.on(t, u, n[h % c], s), f = this.un(t, u, i[h % c], r), d = o.map((e => this.on(t, u, e, \n            /* inclusive= */ !0)));\n            a.push(...this.createRange(l, f, d));\n        }\n        return a;\n    }\n    /** Generates the lower bound for `arrayValue` and `directionalValue`. */    on(t, e, n, s) {\n        const i = new Ir(t, ct.empty(), e, n);\n        return s ? i : i.Ue();\n    }\n    /** Generates the upper bound for `arrayValue` and `directionalValue`. */    un(t, e, n, s) {\n        const i = new Ir(t, ct.empty(), e, n);\n        return s ? i.Ue() : i;\n    }\n    tn(t, e) {\n        const n = new Ar(e), s = null != e.collectionGroup ? e.collectionGroup : e.path.lastSegment();\n        return this.getFieldIndexes(t, s).next((t => {\n            // Return the index with the most number of segments.\n            let e = null;\n            for (const s of t) {\n                n.je(s) && (!e || s.fields.length > e.fields.length) && (e = s);\n            }\n            return e;\n        }));\n    }\n    getIndexType(t, e) {\n        let n = 2 /* IndexType.FULL */;\n        const s = this.Ze(e);\n        return At.forEach(s, (e => this.tn(t, e).next((t => {\n            t ? 0 /* IndexType.NONE */ !== n && t.fields.length < function(t) {\n                let e = new We(ut.comparator), n = !1;\n                for (const s of t.filters) for (const t of s.getFlattenedFilters()) \n                // __name__ is not an explicit segment of any index, so we don't need to\n                // count it.\n                t.field.isKeyField() || (\n                // ARRAY_CONTAINS or ARRAY_CONTAINS_ANY filters must be counted separately.\n                // For instance, it is possible to have an index for \"a ARRAY a ASC\". Even\n                // though these are on the same field, they should be counted as two\n                // separate segments in an index.\n                \"array-contains\" /* Operator.ARRAY_CONTAINS */ === t.op || \"array-contains-any\" /* Operator.ARRAY_CONTAINS_ANY */ === t.op ? n = !0 : e = e.add(t.field));\n                for (const n of t.orderBy) \n                // __name__ is not an explicit segment of any index, so we don't need to\n                // count it.\n                n.field.isKeyField() || (e = e.add(n.field));\n                return e.size + (n ? 1 : 0);\n            }(e) && (n = 1 /* IndexType.PARTIAL */) : n = 0 /* IndexType.NONE */;\n        })))).next((() => \n        // OR queries have more than one sub-target (one sub-target per DNF term). We currently consider\n        // OR queries that have a `limit` to have a partial index. For such queries we perform sorting\n        // and apply the limit in memory as a post-processing step.\n        function(t) {\n            return null !== t.limit;\n        }(e) && s.length > 1 && 2 /* IndexType.FULL */ === n ? 1 /* IndexType.PARTIAL */ : n));\n    }\n    /**\n     * Returns the byte encoded form of the directional values in the field index.\n     * Returns `null` if the document does not have all fields specified in the\n     * index.\n     */    cn(t, e) {\n        const n = new pr;\n        for (const s of lt(t)) {\n            const t = e.data.field(s.fieldPath);\n            if (null == t) return null;\n            const i = n.qe(s.kind);\n            dr.Ie.ue(t, i);\n        }\n        return n.Fe();\n    }\n    /** Encodes a single value to the ascending index format. */    rn(t) {\n        const e = new pr;\n        return dr.Ie.ue(t, e.qe(0 /* IndexKind.ASCENDING */)), e.Fe();\n    }\n    /**\n     * Returns an encoded form of the document key that sorts based on the key\n     * ordering of the field index.\n     */    an(t, e) {\n        const n = new pr;\n        return dr.Ie.ue(ce(this.databaseId, e), n.qe(function(t) {\n            const e = lt(t);\n            return 0 === e.length ? 0 /* IndexKind.ASCENDING */ : e[e.length - 1].kind;\n        }(t))), n.Fe();\n    }\n    /**\n     * Encodes the given field values according to the specification in `target`.\n     * For IN queries, a list of possible values is returned.\n     */    nn(t, e, n) {\n        if (null === n) return [];\n        let s = [];\n        s.push(new pr);\n        let i = 0;\n        for (const r of lt(t)) {\n            const t = n[i++];\n            for (const n of s) if (this.hn(e, r.fieldPath) && he(t)) s = this.ln(s, r, t); else {\n                const e = n.qe(r.kind);\n                dr.Ie.ue(t, e);\n            }\n        }\n        return this.fn(s);\n    }\n    /**\n     * Encodes the given bounds according to the specification in `target`. For IN\n     * queries, a list of possible values is returned.\n     */    en(t, e, n) {\n        return this.nn(t, e, n.position);\n    }\n    /** Returns the byte representation for the provided encoders. */    fn(t) {\n        const e = [];\n        for (let n = 0; n < t.length; ++n) e[n] = t[n].Fe();\n        return e;\n    }\n    /**\n     * Creates a separate encoder for each element of an array.\n     *\n     * The method appends each value to all existing encoders (e.g. filter(\"a\",\n     * \"==\", \"a1\").filter(\"b\", \"in\", [\"b1\", \"b2\"]) becomes [\"a1,b1\", \"a1,b2\"]). A\n     * list of new encoders is returned.\n     */    ln(t, e, n) {\n        const s = [ ...t ], i = [];\n        for (const t of n.arrayValue.values || []) for (const n of s) {\n            const s = new pr;\n            s.seed(n.Fe()), dr.Ie.ue(t, s.qe(e.kind)), i.push(s);\n        }\n        return i;\n    }\n    hn(t, e) {\n        return !!t.filters.find((t => t instanceof Re && t.field.isEqual(e) && (\"in\" /* Operator.IN */ === t.op || \"not-in\" /* Operator.NOT_IN */ === t.op)));\n    }\n    getFieldIndexes(t, e) {\n        const n = Br(t), s = Lr(t);\n        return (e ? n.W(\"collectionGroupIndex\", IDBKeyRange.bound(e, e)) : n.W()).next((t => {\n            const e = [];\n            return At.forEach(t, (t => s.get([ t.indexId, this.uid ]).next((n => {\n                e.push(function(t, e) {\n                    const n = e ? new wt(e.sequenceNumber, new yt(tr(e.readTime), new ct(pi(e.documentKey)), e.largestBatchId)) : wt.empty(), s = t.fields.map((([t, e]) => new dt(ut.fromServerFormat(t), e)));\n                    return new at(t.indexId, t.collectionGroup, s, n);\n                }(t, n));\n            })))).next((() => e));\n        }));\n    }\n    getNextCollectionGroupToUpdate(t) {\n        return this.getFieldIndexes(t).next((t => 0 === t.length ? null : (t.sort(((t, e) => {\n            const n = t.indexState.sequenceNumber - e.indexState.sequenceNumber;\n            return 0 !== n ? n : Z(t.collectionGroup, e.collectionGroup);\n        })), t[0].collectionGroup)));\n    }\n    updateCollectionGroup(t, e, n) {\n        const s = Br(t), i = Lr(t);\n        return this.dn(t).next((t => s.W(\"collectionGroupIndex\", IDBKeyRange.bound(e, e)).next((e => At.forEach(e, (e => i.put(ur(e.indexId, this.user, t, n))))))));\n    }\n    updateIndexEntries(t, e) {\n        // Porting Note: `getFieldIndexes()` on Web does not cache index lookups as\n        // it could be used across different IndexedDB transactions. As any cached\n        // data might be invalidated by other multi-tab clients, we can only trust\n        // data within a single IndexedDB transaction. We therefore add a cache\n        // here.\n        const n = new Map;\n        return At.forEach(e, ((e, s) => {\n            const i = n.get(e.collectionGroup);\n            return (i ? At.resolve(i) : this.getFieldIndexes(t, e.collectionGroup)).next((i => (n.set(e.collectionGroup, i), \n            At.forEach(i, (n => this._n(t, e, n).next((e => {\n                const i = this.wn(s, n);\n                return e.isEqual(i) ? At.resolve() : this.mn(t, s, n, e, i);\n            })))))));\n        }));\n    }\n    gn(t, e, n, s) {\n        return $r(t).put({\n            indexId: s.indexId,\n            uid: this.uid,\n            arrayValue: s.arrayValue,\n            directionalValue: s.directionalValue,\n            orderedDocumentKey: this.an(n, e.key),\n            documentKey: e.key.path.toArray()\n        });\n    }\n    yn(t, e, n, s) {\n        return $r(t).delete([ s.indexId, this.uid, s.arrayValue, s.directionalValue, this.an(n, e.key), e.key.path.toArray() ]);\n    }\n    _n(t, e, n) {\n        const s = $r(t);\n        let i = new We(Tr);\n        return s.Z({\n            index: \"documentKeyIndex\",\n            range: IDBKeyRange.only([ n.indexId, this.uid, this.an(n, e) ])\n        }, ((t, s) => {\n            i = i.add(new Ir(n.indexId, e, s.arrayValue, s.directionalValue));\n        })).next((() => i));\n    }\n    /** Creates the index entries for the given document. */    wn(t, e) {\n        let n = new We(Tr);\n        const s = this.cn(e, t);\n        if (null == s) return n;\n        const i = ht(e);\n        if (null != i) {\n            const r = t.data.field(i.fieldPath);\n            if (he(r)) for (const i of r.arrayValue.values || []) n = n.add(new Ir(e.indexId, t.key, this.rn(i), s));\n        } else n = n.add(new Ir(e.indexId, t.key, Or, s));\n        return n;\n    }\n    /**\n     * Updates the index entries for the provided document by deleting entries\n     * that are no longer referenced in `newEntries` and adding all newly added\n     * entries.\n     */    mn(t, e, n, s, i) {\n        C(\"IndexedDbIndexManager\", \"Updating index entries for document '%s'\", e.key);\n        const r = [];\n        return function(t, e, n, s, i) {\n            const r = t.getIterator(), o = e.getIterator();\n            let u = He(r), c = He(o);\n            // Walk through the two sets at the same time, using the ordering defined by\n            // `comparator`.\n            for (;u || c; ) {\n                let t = !1, e = !1;\n                if (u && c) {\n                    const s = n(u, c);\n                    s < 0 ? \n                    // The element was removed if the next element in our ordered\n                    // walkthrough is only in `before`.\n                    e = !0 : s > 0 && (\n                    // The element was added if the next element in our ordered walkthrough\n                    // is only in `after`.\n                    t = !0);\n                } else null != u ? e = !0 : t = !0;\n                t ? (s(c), c = He(o)) : e ? (i(u), u = He(r)) : (u = He(r), c = He(o));\n            }\n        }(s, i, Tr, (\n        /* onAdd= */ s => {\n            r.push(this.gn(t, e, n, s));\n        }), (\n        /* onRemove= */ s => {\n            r.push(this.yn(t, e, n, s));\n        })), At.waitFor(r);\n    }\n    dn(t) {\n        let e = 1;\n        return Lr(t).Z({\n            index: \"sequenceNumberIndex\",\n            reverse: !0,\n            range: IDBKeyRange.upperBound([ this.uid, Number.MAX_SAFE_INTEGER ])\n        }, ((t, n, s) => {\n            s.done(), e = n.sequenceNumber + 1;\n        })).next((() => e));\n    }\n    /**\n     * Returns a new set of IDB ranges that splits the existing range and excludes\n     * any values that match the `notInValue` from these ranges. As an example,\n     * '[foo > 2 && foo != 3]` becomes  `[foo > 2 && < 3, foo > 3]`.\n     */    createRange(t, e, n) {\n        // The notIn values need to be sorted and unique so that we can return a\n        // sorted set of non-overlapping ranges.\n        n = n.sort(((t, e) => Tr(t, e))).filter(((t, e, n) => !e || 0 !== Tr(t, n[e - 1])));\n        const s = [];\n        s.push(t);\n        for (const i of n) {\n            const n = Tr(i, t), r = Tr(i, e);\n            if (0 === n) \n            // `notInValue` is the lower bound. We therefore need to raise the bound\n            // to the next value.\n            s[0] = t.Ue(); else if (n > 0 && r < 0) \n            // `notInValue` is in the middle of the range\n            s.push(i), s.push(i.Ue()); else if (r > 0) \n            // `notInValue` (and all following values) are out of the range\n            break;\n        }\n        s.push(e);\n        const i = [];\n        for (let t = 0; t < s.length; t += 2) {\n            // If we encounter two bounds that will create an unmatchable key range,\n            // then we return an empty set of key ranges.\n            if (this.pn(s[t], s[t + 1])) return [];\n            const e = [ s[t].indexId, this.uid, s[t].arrayValue, s[t].directionalValue, Or, [] ], n = [ s[t + 1].indexId, this.uid, s[t + 1].arrayValue, s[t + 1].directionalValue, Or, [] ];\n            i.push(IDBKeyRange.bound(e, n));\n        }\n        return i;\n    }\n    pn(t, e) {\n        // If lower bound is greater than the upper bound, then the key\n        // range can never be matched.\n        return Tr(t, e) > 0;\n    }\n    getMinOffsetFromCollectionGroup(t, e) {\n        return this.getFieldIndexes(t, e).next(qr);\n    }\n    getMinOffset(t, e) {\n        return At.mapArray(this.Ze(e), (e => this.tn(t, e).next((t => t || O())))).next(qr);\n    }\n}\n\n/**\n * Helper to get a typed SimpleDbStore for the collectionParents\n * document store.\n */ function Fr(t) {\n    return Gi(t, \"collectionParents\");\n}\n\n/**\n * Helper to get a typed SimpleDbStore for the index entry object store.\n */ function $r(t) {\n    return Gi(t, \"indexEntries\");\n}\n\n/**\n * Helper to get a typed SimpleDbStore for the index configuration object store.\n */ function Br(t) {\n    return Gi(t, \"indexConfiguration\");\n}\n\n/**\n * Helper to get a typed SimpleDbStore for the index state object store.\n */ function Lr(t) {\n    return Gi(t, \"indexState\");\n}\n\nfunction qr(t) {\n    M(0 !== t.length);\n    let e = t[0].indexState.offset, n = e.largestBatchId;\n    for (let s = 1; s < t.length; s++) {\n        const i = t[s].indexState.offset;\n        pt(i, e) < 0 && (e = i), n < i.largestBatchId && (n = i.largestBatchId);\n    }\n    return new yt(e.readTime, e.documentKey, n);\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 */ const Ur = {\n    didRun: !1,\n    sequenceNumbersCollected: 0,\n    targetsRemoved: 0,\n    documentsRemoved: 0\n};\n\nclass Kr {\n    constructor(\n    // When we attempt to collect, we will only do so if the cache size is greater than this\n    // threshold. Passing `COLLECTION_DISABLED` here will cause collection to always be skipped.\n    t, \n    // The percentage of sequence numbers that we will attempt to collect\n    e, \n    // A cap on the total number of sequence numbers that will be collected. This prevents\n    // us from collecting a huge number of sequence numbers if the cache has grown very large.\n    n) {\n        this.cacheSizeCollectionThreshold = t, this.percentileToCollect = e, this.maximumSequenceNumbersToCollect = n;\n    }\n    static withCacheSize(t) {\n        return new Kr(t, Kr.DEFAULT_COLLECTION_PERCENTILE, Kr.DEFAULT_MAX_SEQUENCE_NUMBERS_TO_COLLECT);\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 * Delete a mutation batch and the associated document mutations.\n * @returns A PersistencePromise of the document mutations that were removed.\n */\nfunction Gr(t, e, n) {\n    const s = t.store(\"mutations\"), i = t.store(\"documentMutations\"), r = [], o = IDBKeyRange.only(n.batchId);\n    let u = 0;\n    const c = s.Z({\n        range: o\n    }, ((t, e, n) => (u++, n.delete())));\n    r.push(c.next((() => {\n        M(1 === u);\n    })));\n    const a = [];\n    for (const t of n.mutations) {\n        const s = Ei(e, t.key.path, n.batchId);\n        r.push(i.delete(s)), a.push(t.key);\n    }\n    return At.waitFor(r).next((() => a));\n}\n\n/**\n * Returns an approximate size for the given document.\n */ function Qr(t) {\n    if (!t) return 0;\n    let e;\n    if (t.document) e = t.document; else if (t.unknownDocument) e = t.unknownDocument; else {\n        if (!t.noDocument) throw O();\n        e = t.noDocument;\n    }\n    return JSON.stringify(e).length;\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 mutation queue for a specific user, backed by IndexedDB. */ Kr.DEFAULT_COLLECTION_PERCENTILE = 10, \nKr.DEFAULT_MAX_SEQUENCE_NUMBERS_TO_COLLECT = 1e3, Kr.DEFAULT = new Kr(41943040, Kr.DEFAULT_COLLECTION_PERCENTILE, Kr.DEFAULT_MAX_SEQUENCE_NUMBERS_TO_COLLECT), \nKr.DISABLED = new Kr(-1, 0, 0);\n\nclass jr {\n    constructor(\n    /**\n     * The normalized userId (e.g. null UID => \"\" userId) used to store /\n     * retrieve mutations.\n     */\n    t, e, n, s) {\n        this.userId = t, this.yt = e, this.indexManager = n, this.referenceDelegate = s, \n        /**\n         * Caches the document keys for pending mutation batches. If the mutation\n         * has been removed from IndexedDb, the cached value may continue to\n         * be used to retrieve the batch's document keys. To remove a cached value\n         * locally, `removeCachedMutationKeys()` should be invoked either directly\n         * or through `removeMutationBatches()`.\n         *\n         * With multi-tab, when the primary client acknowledges or rejects a mutation,\n         * this cache is used by secondary clients to invalidate the local\n         * view of the documents that were previously affected by the mutation.\n         */\n        // PORTING NOTE: Multi-tab only.\n        this.In = {};\n    }\n    /**\n     * Creates a new mutation queue for the given user.\n     * @param user - The user for which to create a mutation queue.\n     * @param serializer - The serializer to use when persisting to IndexedDb.\n     */    static re(t, e, n, s) {\n        // TODO(mcg): Figure out what constraints there are on userIDs\n        // In particular, are there any reserved characters? are empty ids allowed?\n        // For the moment store these together in the same mutations table assuming\n        // that empty userIDs aren't allowed.\n        M(\"\" !== t.uid);\n        const i = t.isAuthenticated() ? t.uid : \"\";\n        return new jr(i, e, n, s);\n    }\n    checkEmpty(t) {\n        let e = !0;\n        const n = IDBKeyRange.bound([ this.userId, Number.NEGATIVE_INFINITY ], [ this.userId, Number.POSITIVE_INFINITY ]);\n        return zr(t).Z({\n            index: \"userMutationsIndex\",\n            range: n\n        }, ((t, n, s) => {\n            e = !1, s.done();\n        })).next((() => e));\n    }\n    addMutationBatch(t, e, n, s) {\n        const i = Hr(t), r = zr(t);\n        // The IndexedDb implementation in Chrome (and Firefox) does not handle\n        // compound indices that include auto-generated keys correctly. To ensure\n        // that the index entry is added correctly in all browsers, we perform two\n        // writes: The first write is used to retrieve the next auto-generated Batch\n        // ID, and the second write populates the index and stores the actual\n        // mutation batch.\n        // See: https://bugs.chromium.org/p/chromium/issues/detail?id=701972\n        // We write an empty object to obtain key\n        // eslint-disable-next-line @typescript-eslint/no-explicit-any\n        return r.add({}).next((o => {\n            M(\"number\" == typeof o);\n            const u = new Qi(o, e, n, s), c = function(t, e, n) {\n                const s = n.baseMutations.map((e => ti(t.ie, e))), i = n.mutations.map((e => ti(t.ie, e)));\n                return {\n                    userId: e,\n                    batchId: n.batchId,\n                    localWriteTimeMs: n.localWriteTime.toMillis(),\n                    baseMutations: s,\n                    mutations: i\n                };\n            }(this.yt, this.userId, u), a = [];\n            let h = new We(((t, e) => Z(t.canonicalString(), e.canonicalString())));\n            for (const t of s) {\n                const e = Ei(this.userId, t.key.path, o);\n                h = h.add(t.key.path.popLast()), a.push(r.put(c)), a.push(i.put(e, Ai));\n            }\n            return h.forEach((e => {\n                a.push(this.indexManager.addToCollectionParentIndex(t, e));\n            })), t.addOnCommittedListener((() => {\n                this.In[o] = u.keys();\n            })), At.waitFor(a).next((() => u));\n        }));\n    }\n    lookupMutationBatch(t, e) {\n        return zr(t).get(e).next((t => t ? (M(t.userId === this.userId), er(this.yt, t)) : null));\n    }\n    /**\n     * Returns the document keys for the mutation batch with the given batchId.\n     * For primary clients, this method returns `null` after\n     * `removeMutationBatches()` has been called. Secondary clients return a\n     * cached result until `removeCachedMutationKeys()` is invoked.\n     */\n    // PORTING NOTE: Multi-tab only.\n    Tn(t, e) {\n        return this.In[e] ? At.resolve(this.In[e]) : this.lookupMutationBatch(t, e).next((t => {\n            if (t) {\n                const n = t.keys();\n                return this.In[e] = n, n;\n            }\n            return null;\n        }));\n    }\n    getNextMutationBatchAfterBatchId(t, e) {\n        const n = e + 1, s = IDBKeyRange.lowerBound([ this.userId, n ]);\n        let i = null;\n        return zr(t).Z({\n            index: \"userMutationsIndex\",\n            range: s\n        }, ((t, e, s) => {\n            e.userId === this.userId && (M(e.batchId >= n), i = er(this.yt, e)), s.done();\n        })).next((() => i));\n    }\n    getHighestUnacknowledgedBatchId(t) {\n        const e = IDBKeyRange.upperBound([ this.userId, Number.POSITIVE_INFINITY ]);\n        let n = -1;\n        return zr(t).Z({\n            index: \"userMutationsIndex\",\n            range: e,\n            reverse: !0\n        }, ((t, e, s) => {\n            n = e.batchId, s.done();\n        })).next((() => n));\n    }\n    getAllMutationBatches(t) {\n        const e = IDBKeyRange.bound([ this.userId, -1 ], [ this.userId, Number.POSITIVE_INFINITY ]);\n        return zr(t).W(\"userMutationsIndex\", e).next((t => t.map((t => er(this.yt, t)))));\n    }\n    getAllMutationBatchesAffectingDocumentKey(t, e) {\n        // Scan the document-mutation index starting with a prefix starting with\n        // the given documentKey.\n        const n = Ti(this.userId, e.path), s = IDBKeyRange.lowerBound(n), i = [];\n        return Hr(t).Z({\n            range: s\n        }, ((n, s, r) => {\n            const [o, u, c] = n, a = pi(u);\n            // Only consider rows matching exactly the specific key of\n            // interest. Note that because we order by path first, and we\n            // order terminators before path separators, we'll encounter all\n            // the index rows for documentKey contiguously. In particular, all\n            // the rows for documentKey will occur before any rows for\n            // documents nested in a subcollection beneath documentKey so we\n            // can stop as soon as we hit any such row.\n                        if (o === this.userId && e.path.isEqual(a)) \n            // Look up the mutation batch in the store.\n            return zr(t).get(c).next((t => {\n                if (!t) throw O();\n                M(t.userId === this.userId), i.push(er(this.yt, t));\n            }));\n            r.done();\n        })).next((() => i));\n    }\n    getAllMutationBatchesAffectingDocumentKeys(t, e) {\n        let n = new We(Z);\n        const s = [];\n        return e.forEach((e => {\n            const i = Ti(this.userId, e.path), r = IDBKeyRange.lowerBound(i), o = Hr(t).Z({\n                range: r\n            }, ((t, s, i) => {\n                const [r, o, u] = t, c = pi(o);\n                // Only consider rows matching exactly the specific key of\n                // interest. Note that because we order by path first, and we\n                // order terminators before path separators, we'll encounter all\n                // the index rows for documentKey contiguously. In particular, all\n                // the rows for documentKey will occur before any rows for\n                // documents nested in a subcollection beneath documentKey so we\n                // can stop as soon as we hit any such row.\n                                r === this.userId && e.path.isEqual(c) ? n = n.add(u) : i.done();\n            }));\n            s.push(o);\n        })), At.waitFor(s).next((() => this.En(t, n)));\n    }\n    getAllMutationBatchesAffectingQuery(t, e) {\n        const n = e.path, s = n.length + 1, i = Ti(this.userId, n), r = IDBKeyRange.lowerBound(i);\n        // Collect up unique batchIDs encountered during a scan of the index. Use a\n        // SortedSet to accumulate batch IDs so they can be traversed in order in a\n        // scan of the main table.\n        let o = new We(Z);\n        return Hr(t).Z({\n            range: r\n        }, ((t, e, i) => {\n            const [r, u, c] = t, a = pi(u);\n            r === this.userId && n.isPrefixOf(a) ? \n            // Rows with document keys more than one segment longer than the\n            // query path can't be matches. For example, a query on 'rooms'\n            // can't match the document /rooms/abc/messages/xyx.\n            // TODO(mcg): we'll need a different scanner when we implement\n            // ancestor queries.\n            a.length === s && (o = o.add(c)) : i.done();\n        })).next((() => this.En(t, o)));\n    }\n    En(t, e) {\n        const n = [], s = [];\n        // TODO(rockwood): Implement this using iterate.\n        return e.forEach((e => {\n            s.push(zr(t).get(e).next((t => {\n                if (null === t) throw O();\n                M(t.userId === this.userId), n.push(er(this.yt, t));\n            })));\n        })), At.waitFor(s).next((() => n));\n    }\n    removeMutationBatch(t, e) {\n        return Gr(t.se, this.userId, e).next((n => (t.addOnCommittedListener((() => {\n            this.An(e.batchId);\n        })), At.forEach(n, (e => this.referenceDelegate.markPotentiallyOrphaned(t, e))))));\n    }\n    /**\n     * Clears the cached keys for a mutation batch. This method should be\n     * called by secondary clients after they process mutation updates.\n     *\n     * Note that this method does not have to be called from primary clients as\n     * the corresponding cache entries are cleared when an acknowledged or\n     * rejected batch is removed from the mutation queue.\n     */\n    // PORTING NOTE: Multi-tab only\n    An(t) {\n        delete this.In[t];\n    }\n    performConsistencyCheck(t) {\n        return this.checkEmpty(t).next((e => {\n            if (!e) return At.resolve();\n            // Verify that there are no entries in the documentMutations index if\n            // the queue is empty.\n                        const n = IDBKeyRange.lowerBound([ this.userId ]);\n            const s = [];\n            return Hr(t).Z({\n                range: n\n            }, ((t, e, n) => {\n                if (t[0] === this.userId) {\n                    const e = pi(t[1]);\n                    s.push(e);\n                } else n.done();\n            })).next((() => {\n                M(0 === s.length);\n            }));\n        }));\n    }\n    containsKey(t, e) {\n        return Wr(t, this.userId, e);\n    }\n    // PORTING NOTE: Multi-tab only (state is held in memory in other clients).\n    /** Returns the mutation queue's metadata from IndexedDb. */\n    Rn(t) {\n        return Jr(t).get(this.userId).next((t => t || {\n            userId: this.userId,\n            lastAcknowledgedBatchId: -1,\n            lastStreamToken: \"\"\n        }));\n    }\n}\n\n/**\n * @returns true if the mutation queue for the given user contains a pending\n *         mutation for the given key.\n */ function Wr(t, e, n) {\n    const s = Ti(e, n.path), i = s[1], r = IDBKeyRange.lowerBound(s);\n    let o = !1;\n    return Hr(t).Z({\n        range: r,\n        X: !0\n    }, ((t, n, s) => {\n        const [r, u, /*batchID*/ c] = t;\n        r === e && u === i && (o = !0), s.done();\n    })).next((() => o));\n}\n\n/** Returns true if any mutation queue contains the given document. */\n/**\n * Helper to get a typed SimpleDbStore for the mutations object store.\n */\nfunction zr(t) {\n    return Gi(t, \"mutations\");\n}\n\n/**\n * Helper to get a typed SimpleDbStore for the mutationQueues object store.\n */ function Hr(t) {\n    return Gi(t, \"documentMutations\");\n}\n\n/**\n * Helper to get a typed SimpleDbStore for the mutationQueues object store.\n */ function Jr(t) {\n    return Gi(t, \"mutationQueues\");\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/** Offset to ensure non-overlapping target ids. */\n/**\n * Generates monotonically increasing target IDs for sending targets to the\n * watch stream.\n *\n * The client constructs two generators, one for the target cache, and one for\n * for the sync engine (to generate limbo documents targets). These\n * generators produce non-overlapping IDs (by using even and odd IDs\n * respectively).\n *\n * By separating the target ID space, the query cache can generate target IDs\n * that persist across client restarts, while sync engine can independently\n * generate in-memory target IDs that are transient and can be reused after a\n * restart.\n */\nclass Yr {\n    constructor(t) {\n        this.bn = t;\n    }\n    next() {\n        return this.bn += 2, this.bn;\n    }\n    static Pn() {\n        // The target cache generator must return '2' in its first call to `next()`\n        // as there is no differentiation in the protocol layer between an unset\n        // number and the number '0'. If we were to sent a target with target ID\n        // '0', the backend would consider it unset and replace it with its own ID.\n        return new Yr(0);\n    }\n    static vn() {\n        // Sync engine assigns target IDs for limbo document detection.\n        return new Yr(-1);\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 Xr {\n    constructor(t, e) {\n        this.referenceDelegate = t, this.yt = e;\n    }\n    // PORTING NOTE: We don't cache global metadata for the target cache, since\n    // some of it (in particular `highestTargetId`) can be modified by secondary\n    // tabs. We could perhaps be more granular (and e.g. still cache\n    // `lastRemoteSnapshotVersion` in memory) but for simplicity we currently go\n    // to IndexedDb whenever we need to read metadata. We can revisit if it turns\n    // out to have a meaningful performance impact.\n    allocateTargetId(t) {\n        return this.Vn(t).next((e => {\n            const n = new Yr(e.highestTargetId);\n            return e.highestTargetId = n.next(), this.Sn(t, e).next((() => e.highestTargetId));\n        }));\n    }\n    getLastRemoteSnapshotVersion(t) {\n        return this.Vn(t).next((t => st.fromTimestamp(new nt(t.lastRemoteSnapshotVersion.seconds, t.lastRemoteSnapshotVersion.nanoseconds))));\n    }\n    getHighestSequenceNumber(t) {\n        return this.Vn(t).next((t => t.highestListenSequenceNumber));\n    }\n    setTargetsMetadata(t, e, n) {\n        return this.Vn(t).next((s => (s.highestListenSequenceNumber = e, n && (s.lastRemoteSnapshotVersion = n.toTimestamp()), \n        e > s.highestListenSequenceNumber && (s.highestListenSequenceNumber = e), this.Sn(t, s))));\n    }\n    addTargetData(t, e) {\n        return this.Dn(t, e).next((() => this.Vn(t).next((n => (n.targetCount += 1, this.Cn(e, n), \n        this.Sn(t, n))))));\n    }\n    updateTargetData(t, e) {\n        return this.Dn(t, e);\n    }\n    removeTargetData(t, e) {\n        return this.removeMatchingKeysForTargetId(t, e.targetId).next((() => Zr(t).delete(e.targetId))).next((() => this.Vn(t))).next((e => (M(e.targetCount > 0), \n        e.targetCount -= 1, this.Sn(t, e))));\n    }\n    /**\n     * Drops any targets with sequence number less than or equal to the upper bound, excepting those\n     * present in `activeTargetIds`. Document associations for the removed targets are also removed.\n     * Returns the number of targets removed.\n     */    removeTargets(t, e, n) {\n        let s = 0;\n        const i = [];\n        return Zr(t).Z(((r, o) => {\n            const u = nr(o);\n            u.sequenceNumber <= e && null === n.get(u.targetId) && (s++, i.push(this.removeTargetData(t, u)));\n        })).next((() => At.waitFor(i))).next((() => s));\n    }\n    /**\n     * Call provided function with each `TargetData` that we have cached.\n     */    forEachTarget(t, e) {\n        return Zr(t).Z(((t, n) => {\n            const s = nr(n);\n            e(s);\n        }));\n    }\n    Vn(t) {\n        return to(t).get(\"targetGlobalKey\").next((t => (M(null !== t), t)));\n    }\n    Sn(t, e) {\n        return to(t).put(\"targetGlobalKey\", e);\n    }\n    Dn(t, e) {\n        return Zr(t).put(sr(this.yt, e));\n    }\n    /**\n     * In-place updates the provided metadata to account for values in the given\n     * TargetData. Saving is done separately. Returns true if there were any\n     * changes to the metadata.\n     */    Cn(t, e) {\n        let n = !1;\n        return t.targetId > e.highestTargetId && (e.highestTargetId = t.targetId, n = !0), \n        t.sequenceNumber > e.highestListenSequenceNumber && (e.highestListenSequenceNumber = t.sequenceNumber, \n        n = !0), n;\n    }\n    getTargetCount(t) {\n        return this.Vn(t).next((t => t.targetCount));\n    }\n    getTargetData(t, e) {\n        // Iterating by the canonicalId may yield more than one result because\n        // canonicalId values are not required to be unique per target. This query\n        // depends on the queryTargets index to be efficient.\n        const n = nn(e), s = IDBKeyRange.bound([ n, Number.NEGATIVE_INFINITY ], [ n, Number.POSITIVE_INFINITY ]);\n        let i = null;\n        return Zr(t).Z({\n            range: s,\n            index: \"queryTargetsIndex\"\n        }, ((t, n, s) => {\n            const r = nr(n);\n            // After finding a potential match, check that the target is\n            // actually equal to the requested target.\n                        sn(e, r.target) && (i = r, s.done());\n        })).next((() => i));\n    }\n    addMatchingKeys(t, e, n) {\n        // PORTING NOTE: The reverse index (documentsTargets) is maintained by\n        // IndexedDb.\n        const s = [], i = eo(t);\n        return e.forEach((e => {\n            const r = mi(e.path);\n            s.push(i.put({\n                targetId: n,\n                path: r\n            })), s.push(this.referenceDelegate.addReference(t, n, e));\n        })), At.waitFor(s);\n    }\n    removeMatchingKeys(t, e, n) {\n        // PORTING NOTE: The reverse index (documentsTargets) is maintained by\n        // IndexedDb.\n        const s = eo(t);\n        return At.forEach(e, (e => {\n            const i = mi(e.path);\n            return At.waitFor([ s.delete([ n, i ]), this.referenceDelegate.removeReference(t, n, e) ]);\n        }));\n    }\n    removeMatchingKeysForTargetId(t, e) {\n        const n = eo(t), s = IDBKeyRange.bound([ e ], [ e + 1 ], \n        /*lowerOpen=*/ !1, \n        /*upperOpen=*/ !0);\n        return n.delete(s);\n    }\n    getMatchingKeysForTargetId(t, e) {\n        const n = IDBKeyRange.bound([ e ], [ e + 1 ], \n        /*lowerOpen=*/ !1, \n        /*upperOpen=*/ !0), s = eo(t);\n        let i = Es();\n        return s.Z({\n            range: n,\n            X: !0\n        }, ((t, e, n) => {\n            const s = pi(t[1]), r = new ct(s);\n            i = i.add(r);\n        })).next((() => i));\n    }\n    containsKey(t, e) {\n        const n = mi(e.path), s = IDBKeyRange.bound([ n ], [ et(n) ], \n        /*lowerOpen=*/ !1, \n        /*upperOpen=*/ !0);\n        let i = 0;\n        return eo(t).Z({\n            index: \"documentTargetsIndex\",\n            X: !0,\n            range: s\n        }, (([t, e], n, s) => {\n            // Having a sentinel row for a document does not count as containing that document;\n            // For the target cache, containing the document means the document is part of some\n            // target.\n            0 !== t && (i++, s.done());\n        })).next((() => i > 0));\n    }\n    /**\n     * Looks up a TargetData entry by target ID.\n     *\n     * @param targetId - The target ID of the TargetData entry to look up.\n     * @returns The cached TargetData entry, or null if the cache has no entry for\n     * the target.\n     */\n    // PORTING NOTE: Multi-tab only.\n    ne(t, e) {\n        return Zr(t).get(e).next((t => t ? nr(t) : null));\n    }\n}\n\n/**\n * Helper to get a typed SimpleDbStore for the queries object store.\n */ function Zr(t) {\n    return Gi(t, \"targets\");\n}\n\n/**\n * Helper to get a typed SimpleDbStore for the target globals object store.\n */ function to(t) {\n    return Gi(t, \"targetGlobal\");\n}\n\n/**\n * Helper to get a typed SimpleDbStore for the document target object store.\n */ function eo(t) {\n    return Gi(t, \"targetDocuments\");\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 no([t, e], [n, s]) {\n    const i = Z(t, n);\n    return 0 === i ? Z(e, s) : i;\n}\n\n/**\n * Used to calculate the nth sequence number. Keeps a rolling buffer of the\n * lowest n values passed to `addElement`, and finally reports the largest of\n * them in `maxValue`.\n */ class so {\n    constructor(t) {\n        this.xn = t, this.buffer = new We(no), this.Nn = 0;\n    }\n    kn() {\n        return ++this.Nn;\n    }\n    On(t) {\n        const e = [ t, this.kn() ];\n        if (this.buffer.size < this.xn) this.buffer = this.buffer.add(e); else {\n            const t = this.buffer.last();\n            no(e, t) < 0 && (this.buffer = this.buffer.delete(t).add(e));\n        }\n    }\n    get maxValue() {\n        // Guaranteed to be non-empty. If we decide we are not collecting any\n        // sequence numbers, nthSequenceNumber below short-circuits. If we have\n        // decided that we are collecting n sequence numbers, it's because n is some\n        // percentage of the existing sequence numbers. That means we should never\n        // be in a situation where we are collecting sequence numbers but don't\n        // actually have any.\n        return this.buffer.last()[0];\n    }\n}\n\n/**\n * This class is responsible for the scheduling of LRU garbage collection. It handles checking\n * whether or not GC is enabled, as well as which delay to use before the next run.\n */ class io {\n    constructor(t, e, n) {\n        this.garbageCollector = t, this.asyncQueue = e, this.localStore = n, this.Mn = null;\n    }\n    start() {\n        -1 !== this.garbageCollector.params.cacheSizeCollectionThreshold && this.Fn(6e4);\n    }\n    stop() {\n        this.Mn && (this.Mn.cancel(), this.Mn = null);\n    }\n    get started() {\n        return null !== this.Mn;\n    }\n    Fn(t) {\n        C(\"LruGarbageCollector\", `Garbage collection scheduled in ${t}ms`), this.Mn = this.asyncQueue.enqueueAfterDelay(\"lru_garbage_collection\" /* TimerId.LruGarbageCollection */ , t, (async () => {\n            this.Mn = null;\n            try {\n                await this.localStore.collectGarbage(this.garbageCollector);\n            } catch (t) {\n                Vt(t) ? C(\"LruGarbageCollector\", \"Ignoring IndexedDB error during garbage collection: \", t) : await Et(t);\n            }\n            await this.Fn(3e5);\n        }));\n    }\n}\n\n/** Implements the steps for LRU garbage collection. */ class ro {\n    constructor(t, e) {\n        this.$n = t, this.params = e;\n    }\n    calculateTargetCount(t, e) {\n        return this.$n.Bn(t).next((t => Math.floor(e / 100 * t)));\n    }\n    nthSequenceNumber(t, e) {\n        if (0 === e) return At.resolve(Ot.at);\n        const n = new so(e);\n        return this.$n.forEachTarget(t, (t => n.On(t.sequenceNumber))).next((() => this.$n.Ln(t, (t => n.On(t))))).next((() => n.maxValue));\n    }\n    removeTargets(t, e, n) {\n        return this.$n.removeTargets(t, e, n);\n    }\n    removeOrphanedDocuments(t, e) {\n        return this.$n.removeOrphanedDocuments(t, e);\n    }\n    collect(t, e) {\n        return -1 === this.params.cacheSizeCollectionThreshold ? (C(\"LruGarbageCollector\", \"Garbage collection skipped; disabled\"), \n        At.resolve(Ur)) : this.getCacheSize(t).next((n => n < this.params.cacheSizeCollectionThreshold ? (C(\"LruGarbageCollector\", `Garbage collection skipped; Cache size ${n} is lower than threshold ${this.params.cacheSizeCollectionThreshold}`), \n        Ur) : this.qn(t, e)));\n    }\n    getCacheSize(t) {\n        return this.$n.getCacheSize(t);\n    }\n    qn(t, e) {\n        let n, s, i, r, o, c, a;\n        const h = Date.now();\n        return this.calculateTargetCount(t, this.params.percentileToCollect).next((e => (\n        // Cap at the configured max\n        e > this.params.maximumSequenceNumbersToCollect ? (C(\"LruGarbageCollector\", `Capping sequence numbers to collect down to the maximum of ${this.params.maximumSequenceNumbersToCollect} from ${e}`), \n        s = this.params.maximumSequenceNumbersToCollect) : s = e, r = Date.now(), this.nthSequenceNumber(t, s)))).next((s => (n = s, \n        o = Date.now(), this.removeTargets(t, n, e)))).next((e => (i = e, c = Date.now(), \n        this.removeOrphanedDocuments(t, n)))).next((t => {\n            if (a = Date.now(), S() <= u.DEBUG) {\n                C(\"LruGarbageCollector\", `LRU Garbage Collection\\n\\tCounted targets in ${r - h}ms\\n\\tDetermined least recently used ${s} in ` + (o - r) + \"ms\\n\" + `\\tRemoved ${i} targets in ` + (c - o) + \"ms\\n\" + `\\tRemoved ${t} documents in ` + (a - c) + \"ms\\n\" + `Total Duration: ${a - h}ms`);\n            }\n            return At.resolve({\n                didRun: !0,\n                sequenceNumbersCollected: s,\n                targetsRemoved: i,\n                documentsRemoved: t\n            });\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/** Provides LRU functionality for IndexedDB persistence. */\nclass oo {\n    constructor(t, e) {\n        this.db = t, this.garbageCollector = function(t, e) {\n            return new ro(t, e);\n        }(this, e);\n    }\n    Bn(t) {\n        const e = this.Un(t);\n        return this.db.getTargetCache().getTargetCount(t).next((t => e.next((e => t + e))));\n    }\n    Un(t) {\n        let e = 0;\n        return this.Ln(t, (t => {\n            e++;\n        })).next((() => e));\n    }\n    forEachTarget(t, e) {\n        return this.db.getTargetCache().forEachTarget(t, e);\n    }\n    Ln(t, e) {\n        return this.Kn(t, ((t, n) => e(n)));\n    }\n    addReference(t, e, n) {\n        return uo(t, n);\n    }\n    removeReference(t, e, n) {\n        return uo(t, n);\n    }\n    removeTargets(t, e, n) {\n        return this.db.getTargetCache().removeTargets(t, e, n);\n    }\n    markPotentiallyOrphaned(t, e) {\n        return uo(t, e);\n    }\n    /**\n     * Returns true if anything would prevent this document from being garbage\n     * collected, given that the document in question is not present in any\n     * targets and has a sequence number less than or equal to the upper bound for\n     * the collection run.\n     */    Gn(t, e) {\n        return function(t, e) {\n            let n = !1;\n            return Jr(t).tt((s => Wr(t, s, e).next((t => (t && (n = !0), At.resolve(!t)))))).next((() => n));\n        }(t, e);\n    }\n    removeOrphanedDocuments(t, e) {\n        const n = this.db.getRemoteDocumentCache().newChangeBuffer(), s = [];\n        let i = 0;\n        return this.Kn(t, ((r, o) => {\n            if (o <= e) {\n                const e = this.Gn(t, r).next((e => {\n                    if (!e) \n                    // Our size accounting requires us to read all documents before\n                    // removing them.\n                    return i++, n.getEntry(t, r).next((() => (n.removeEntry(r, st.min()), eo(t).delete([ 0, mi(r.path) ]))));\n                }));\n                s.push(e);\n            }\n        })).next((() => At.waitFor(s))).next((() => n.apply(t))).next((() => i));\n    }\n    removeTarget(t, e) {\n        const n = e.withSequenceNumber(t.currentSequenceNumber);\n        return this.db.getTargetCache().updateTargetData(t, n);\n    }\n    updateLimboDocument(t, e) {\n        return uo(t, e);\n    }\n    /**\n     * Call provided function for each document in the cache that is 'orphaned'. Orphaned\n     * means not a part of any target, so the only entry in the target-document index for\n     * that document will be the sentinel row (targetId 0), which will also have the sequence\n     * number for the last time the document was accessed.\n     */    Kn(t, e) {\n        const n = eo(t);\n        let s, i = Ot.at;\n        return n.Z({\n            index: \"documentTargetsIndex\"\n        }, (([t, n], {path: r, sequenceNumber: o}) => {\n            0 === t ? (\n            // if nextToReport is valid, report it, this is a new key so the\n            // last one must not be a member of any targets.\n            i !== Ot.at && e(new ct(pi(s)), i), \n            // set nextToReport to be this sequence number. It's the next one we\n            // might report, if we don't find any targets for this document.\n            // Note that the sequence number must be defined when the targetId\n            // is 0.\n            i = o, s = r) : \n            // set nextToReport to be invalid, we know we don't need to report\n            // this one since we found a target for it.\n            i = Ot.at;\n        })).next((() => {\n            // Since we report sequence numbers after getting to the next key, we\n            // need to check if the last key we iterated over was an orphaned\n            // document and report it.\n            i !== Ot.at && e(new ct(pi(s)), i);\n        }));\n    }\n    getCacheSize(t) {\n        return this.db.getRemoteDocumentCache().getSize(t);\n    }\n}\n\nfunction uo(t, e) {\n    return eo(t).put(\n    /**\n * @returns A value suitable for writing a sentinel row in the target-document\n * store.\n */\n    function(t, e) {\n        return {\n            targetId: 0,\n            path: mi(t.path),\n            sequenceNumber: e\n        };\n    }(e, t.currentSequenceNumber));\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 in-memory buffer of entries to be written to a RemoteDocumentCache.\n * It can be used to batch up a set of changes to be written to the cache, but\n * additionally supports reading entries back with the `getEntry()` method,\n * falling back to the underlying RemoteDocumentCache if no entry is\n * buffered.\n *\n * Entries added to the cache *must* be read first. This is to facilitate\n * calculating the size delta of the pending changes.\n *\n * PORTING NOTE: This class was implemented then removed from other platforms.\n * If byte-counting ends up being needed on the other platforms, consider\n * porting this class as part of that implementation work.\n */ class co {\n    constructor() {\n        // A mapping of document key to the new cache entry that should be written.\n        this.changes = new ls((t => t.toString()), ((t, e) => t.isEqual(e))), this.changesApplied = !1;\n    }\n    /**\n     * Buffers a `RemoteDocumentCache.addEntry()` call.\n     *\n     * You can only modify documents that have already been retrieved via\n     * `getEntry()/getEntries()` (enforced via IndexedDbs `apply()`).\n     */    addEntry(t) {\n        this.assertNotApplied(), this.changes.set(t.key, t);\n    }\n    /**\n     * Buffers a `RemoteDocumentCache.removeEntry()` call.\n     *\n     * You can only remove documents that have already been retrieved via\n     * `getEntry()/getEntries()` (enforced via IndexedDbs `apply()`).\n     */    removeEntry(t, e) {\n        this.assertNotApplied(), this.changes.set(t, Ze.newInvalidDocument(t).setReadTime(e));\n    }\n    /**\n     * Looks up an entry in the cache. The buffered changes will first be checked,\n     * and if no buffered change applies, this will forward to\n     * `RemoteDocumentCache.getEntry()`.\n     *\n     * @param transaction - The transaction in which to perform any persistence\n     *     operations.\n     * @param documentKey - The key of the entry to look up.\n     * @returns The cached document or an invalid document if we have nothing\n     * cached.\n     */    getEntry(t, e) {\n        this.assertNotApplied();\n        const n = this.changes.get(e);\n        return void 0 !== n ? At.resolve(n) : this.getFromCache(t, e);\n    }\n    /**\n     * Looks up several entries in the cache, forwarding to\n     * `RemoteDocumentCache.getEntry()`.\n     *\n     * @param transaction - The transaction in which to perform any persistence\n     *     operations.\n     * @param documentKeys - The keys of the entries to look up.\n     * @returns A map of cached documents, indexed by key. If an entry cannot be\n     *     found, the corresponding key will be mapped to an invalid document.\n     */    getEntries(t, e) {\n        return this.getAllFromCache(t, e);\n    }\n    /**\n     * Applies buffered changes to the underlying RemoteDocumentCache, using\n     * the provided transaction.\n     */    apply(t) {\n        return this.assertNotApplied(), this.changesApplied = !0, this.applyChanges(t);\n    }\n    /** Helper to assert this.changes is not null  */    assertNotApplied() {}\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 * The RemoteDocumentCache for IndexedDb. To construct, invoke\n * `newIndexedDbRemoteDocumentCache()`.\n */ class ao {\n    constructor(t) {\n        this.yt = t;\n    }\n    setIndexManager(t) {\n        this.indexManager = t;\n    }\n    /**\n     * Adds the supplied entries to the cache.\n     *\n     * All calls of `addEntry` are required to go through the RemoteDocumentChangeBuffer\n     * returned by `newChangeBuffer()` to ensure proper accounting of metadata.\n     */    addEntry(t, e, n) {\n        return _o(t).put(n);\n    }\n    /**\n     * Removes a document from the cache.\n     *\n     * All calls of `removeEntry`  are required to go through the RemoteDocumentChangeBuffer\n     * returned by `newChangeBuffer()` to ensure proper accounting of metadata.\n     */    removeEntry(t, e, n) {\n        return _o(t).delete(\n        /**\n * Returns a key that can be used for document lookups via the primary key of\n * the DbRemoteDocument object store.\n */\n        function(t, e) {\n            const n = t.path.toArray();\n            return [ \n            /* prefix path */ n.slice(0, n.length - 2), \n            /* collection id */ n[n.length - 2], Xi(e), \n            /* document id */ n[n.length - 1] ];\n        }\n        /**\n * Returns a key that can be used for document lookups on the\n * `DbRemoteDocumentDocumentCollectionGroupIndex` index.\n */ (e, n));\n    }\n    /**\n     * Updates the current cache size.\n     *\n     * Callers to `addEntry()` and `removeEntry()` *must* call this afterwards to update the\n     * cache's metadata.\n     */    updateMetadata(t, e) {\n        return this.getMetadata(t).next((n => (n.byteSize += e, this.Qn(t, n))));\n    }\n    getEntry(t, e) {\n        let n = Ze.newInvalidDocument(e);\n        return _o(t).Z({\n            index: \"documentKeyIndex\",\n            range: IDBKeyRange.only(wo(e))\n        }, ((t, s) => {\n            n = this.jn(e, s);\n        })).next((() => n));\n    }\n    /**\n     * Looks up an entry in the cache.\n     *\n     * @param documentKey - The key of the entry to look up.\n     * @returns The cached document entry and its size.\n     */    Wn(t, e) {\n        let n = {\n            size: 0,\n            document: Ze.newInvalidDocument(e)\n        };\n        return _o(t).Z({\n            index: \"documentKeyIndex\",\n            range: IDBKeyRange.only(wo(e))\n        }, ((t, s) => {\n            n = {\n                document: this.jn(e, s),\n                size: Qr(s)\n            };\n        })).next((() => n));\n    }\n    getEntries(t, e) {\n        let n = ds();\n        return this.zn(t, e, ((t, e) => {\n            const s = this.jn(t, e);\n            n = n.insert(t, s);\n        })).next((() => n));\n    }\n    /**\n     * Looks up several entries in the cache.\n     *\n     * @param documentKeys - The set of keys entries to look up.\n     * @returns A map of documents indexed by key and a map of sizes indexed by\n     *     key (zero if the document does not exist).\n     */    Hn(t, e) {\n        let n = ds(), s = new Ge(ct.comparator);\n        return this.zn(t, e, ((t, e) => {\n            const i = this.jn(t, e);\n            n = n.insert(t, i), s = s.insert(t, Qr(e));\n        })).next((() => ({\n            documents: n,\n            Jn: s\n        })));\n    }\n    zn(t, e, n) {\n        if (e.isEmpty()) return At.resolve();\n        let s = new We(go);\n        e.forEach((t => s = s.add(t)));\n        const i = IDBKeyRange.bound(wo(s.first()), wo(s.last())), r = s.getIterator();\n        let o = r.getNext();\n        return _o(t).Z({\n            index: \"documentKeyIndex\",\n            range: i\n        }, ((t, e, s) => {\n            const i = ct.fromSegments([ ...e.prefixPath, e.collectionGroup, e.documentId ]);\n            // Go through keys not found in cache.\n                        for (;o && go(o, i) < 0; ) n(o, null), o = r.getNext();\n            o && o.isEqual(i) && (\n            // Key found in cache.\n            n(o, e), o = r.hasNext() ? r.getNext() : null), \n            // Skip to the next key (if there is one).\n            o ? s.j(wo(o)) : s.done();\n        })).next((() => {\n            // The rest of the keys are not in the cache. One case where `iterate`\n            // above won't go through them is when the cache is empty.\n            for (;o; ) n(o, null), o = r.hasNext() ? r.getNext() : null;\n        }));\n    }\n    getAllFromCollection(t, e, n) {\n        const s = [ e.popLast().toArray(), e.lastSegment(), Xi(n.readTime), n.documentKey.path.isEmpty() ? \"\" : n.documentKey.path.lastSegment() ], i = [ e.popLast().toArray(), e.lastSegment(), [ Number.MAX_SAFE_INTEGER, Number.MAX_SAFE_INTEGER ], \"\" ];\n        return _o(t).W(IDBKeyRange.bound(s, i, !0)).next((t => {\n            let e = ds();\n            for (const n of t) {\n                const t = this.jn(ct.fromSegments(n.prefixPath.concat(n.collectionGroup, n.documentId)), n);\n                e = e.insert(t.key, t);\n            }\n            return e;\n        }));\n    }\n    getAllFromCollectionGroup(t, e, n, s) {\n        let i = ds();\n        const r = mo(e, n), o = mo(e, yt.max());\n        return _o(t).Z({\n            index: \"collectionGroupIndex\",\n            range: IDBKeyRange.bound(r, o, !0)\n        }, ((t, e, n) => {\n            const r = this.jn(ct.fromSegments(e.prefixPath.concat(e.collectionGroup, e.documentId)), e);\n            i = i.insert(r.key, r), i.size === s && n.done();\n        })).next((() => i));\n    }\n    newChangeBuffer(t) {\n        return new lo(this, !!t && t.trackRemovals);\n    }\n    getSize(t) {\n        return this.getMetadata(t).next((t => t.byteSize));\n    }\n    getMetadata(t) {\n        return fo(t).get(\"remoteDocumentGlobalKey\").next((t => (M(!!t), t)));\n    }\n    Qn(t, e) {\n        return fo(t).put(\"remoteDocumentGlobalKey\", e);\n    }\n    /**\n     * Decodes `dbRemoteDoc` and returns the document (or an invalid document if\n     * the document corresponds to the format used for sentinel deletes).\n     */    jn(t, e) {\n        if (e) {\n            const t = Ji(this.yt, e);\n            // Whether the document is a sentinel removal and should only be used in the\n            // `getNewDocumentChanges()`\n                        if (!(t.isNoDocument() && t.version.isEqual(st.min()))) return t;\n        }\n        return Ze.newInvalidDocument(t);\n    }\n}\n\n/** Creates a new IndexedDbRemoteDocumentCache. */ function ho(t) {\n    return new ao(t);\n}\n\n/**\n * Handles the details of adding and updating documents in the IndexedDbRemoteDocumentCache.\n *\n * Unlike the MemoryRemoteDocumentChangeBuffer, the IndexedDb implementation computes the size\n * delta for all submitted changes. This avoids having to re-read all documents from IndexedDb\n * when we apply the changes.\n */ class lo extends co {\n    /**\n     * @param documentCache - The IndexedDbRemoteDocumentCache to apply the changes to.\n     * @param trackRemovals - Whether to create sentinel deletes that can be tracked by\n     * `getNewDocumentChanges()`.\n     */\n    constructor(t, e) {\n        super(), this.Yn = t, this.trackRemovals = e, \n        // A map of document sizes and read times prior to applying the changes in\n        // this buffer.\n        this.Xn = new ls((t => t.toString()), ((t, e) => t.isEqual(e)));\n    }\n    applyChanges(t) {\n        const e = [];\n        let n = 0, s = new We(((t, e) => Z(t.canonicalString(), e.canonicalString())));\n        return this.changes.forEach(((i, r) => {\n            const o = this.Xn.get(i);\n            if (e.push(this.Yn.removeEntry(t, i, o.readTime)), r.isValidDocument()) {\n                const u = Yi(this.Yn.yt, r);\n                s = s.add(i.path.popLast());\n                const c = Qr(u);\n                n += c - o.size, e.push(this.Yn.addEntry(t, i, u));\n            } else if (n -= o.size, this.trackRemovals) {\n                // In order to track removals, we store a \"sentinel delete\" in the\n                // RemoteDocumentCache. This entry is represented by a NoDocument\n                // with a version of 0 and ignored by `maybeDecodeDocument()` but\n                // preserved in `getNewDocumentChanges()`.\n                const n = Yi(this.Yn.yt, r.convertToNoDocument(st.min()));\n                e.push(this.Yn.addEntry(t, i, n));\n            }\n        })), s.forEach((n => {\n            e.push(this.Yn.indexManager.addToCollectionParentIndex(t, n));\n        })), e.push(this.Yn.updateMetadata(t, n)), At.waitFor(e);\n    }\n    getFromCache(t, e) {\n        // Record the size of everything we load from the cache so we can compute a delta later.\n        return this.Yn.Wn(t, e).next((t => (this.Xn.set(e, {\n            size: t.size,\n            readTime: t.document.readTime\n        }), t.document)));\n    }\n    getAllFromCache(t, e) {\n        // Record the size of everything we load from the cache so we can compute\n        // a delta later.\n        return this.Yn.Hn(t, e).next((({documents: t, Jn: e}) => (\n        // Note: `getAllFromCache` returns two maps instead of a single map from\n        // keys to `DocumentSizeEntry`s. This is to allow returning the\n        // `MutableDocumentMap` directly, without a conversion.\n        e.forEach(((e, n) => {\n            this.Xn.set(e, {\n                size: n,\n                readTime: t.get(e).readTime\n            });\n        })), t)));\n    }\n}\n\nfunction fo(t) {\n    return Gi(t, \"remoteDocumentGlobal\");\n}\n\n/**\n * Helper to get a typed SimpleDbStore for the remoteDocuments object store.\n */ function _o(t) {\n    return Gi(t, \"remoteDocumentsV14\");\n}\n\n/**\n * Returns a key that can be used for document lookups on the\n * `DbRemoteDocumentDocumentKeyIndex` index.\n */ function wo(t) {\n    const e = t.path.toArray();\n    return [ \n    /* prefix path */ e.slice(0, e.length - 2), \n    /* collection id */ e[e.length - 2], \n    /* document id */ e[e.length - 1] ];\n}\n\nfunction mo(t, e) {\n    const n = e.documentKey.path.toArray();\n    return [ \n    /* collection id */ t, Xi(e.readTime), \n    /* prefix path */ n.slice(0, n.length - 2), \n    /* document id */ n.length > 0 ? n[n.length - 1] : \"\" ];\n}\n\n/**\n * Comparator that compares document keys according to the primary key sorting\n * used by the `DbRemoteDocumentDocument` store (by prefix path, collection id\n * and then document ID).\n *\n * Visible for testing.\n */ function go(t, e) {\n    const n = t.path.toArray(), s = e.path.toArray();\n    // The ordering is based on https://chromium.googlesource.com/chromium/blink/+/fe5c21fef94dae71c1c3344775b8d8a7f7e6d9ec/Source/modules/indexeddb/IDBKey.cpp#74\n    let i = 0;\n    for (let t = 0; t < n.length - 2 && t < s.length - 2; ++t) if (i = Z(n[t], s[t]), \n    i) return i;\n    return i = Z(n.length, s.length), i || (i = Z(n[n.length - 2], s[s.length - 2]), \n    i || Z(n[n.length - 1], s[s.length - 1]));\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 * Schema Version for the Web client:\n * 1.  Initial version including Mutation Queue, Query Cache, and Remote\n *     Document Cache\n * 2.  Used to ensure a targetGlobal object exists and add targetCount to it. No\n *     longer required because migration 3 unconditionally clears it.\n * 3.  Dropped and re-created Query Cache to deal with cache corruption related\n *     to limbo resolution. Addresses\n *     https://github.com/firebase/firebase-ios-sdk/issues/1548\n * 4.  Multi-Tab Support.\n * 5.  Removal of held write acks.\n * 6.  Create document global for tracking document cache size.\n * 7.  Ensure every cached document has a sentinel row with a sequence number.\n * 8.  Add collection-parent index for Collection Group queries.\n * 9.  Change RemoteDocumentChanges store to be keyed by readTime rather than\n *     an auto-incrementing ID. This is required for Index-Free queries.\n * 10. Rewrite the canonical IDs to the explicit Protobuf-based format.\n * 11. Add bundles and named_queries for bundle support.\n * 12. Add document overlays.\n * 13. Rewrite the keys of the remote document cache to allow for efficient\n *     document lookup via `getAll()`.\n * 14. Add overlays.\n * 15. Add indexing support.\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 local view (overlay) of a document, and the fields that are\n * locally mutated.\n */\nclass yo {\n    constructor(t, \n    /**\n     * The fields that are locally mutated by patch mutations.\n     *\n     * If the overlayed\tdocument is from set or delete mutations, this is `null`.\n     * If there is no overlay (mutation) for the document, this is an empty `FieldMask`.\n     */\n    e) {\n        this.overlayedDocument = t, this.mutatedFields = 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 * A readonly view of the local state of all documents we're tracking (i.e. we\n * have a cached version in remoteDocumentCache or local mutations for the\n * document). The view is computed by applying the mutations in the\n * MutationQueue to the RemoteDocumentCache.\n */ class po {\n    constructor(t, e, n, s) {\n        this.remoteDocumentCache = t, this.mutationQueue = e, this.documentOverlayCache = n, \n        this.indexManager = s;\n    }\n    /**\n     * Get the local view of the document identified by `key`.\n     *\n     * @returns Local view of the document or null if we don't have any cached\n     * state for it.\n     */    getDocument(t, e) {\n        let n = null;\n        return this.documentOverlayCache.getOverlay(t, e).next((s => (n = s, this.remoteDocumentCache.getEntry(t, e)))).next((t => (null !== n && Jn(n.mutation, t, Je.empty(), nt.now()), \n        t)));\n    }\n    /**\n     * Gets the local view of the documents identified by `keys`.\n     *\n     * If we don't have cached state for a document in `keys`, a NoDocument will\n     * be stored for that key in the resulting set.\n     */    getDocuments(t, e) {\n        return this.remoteDocumentCache.getEntries(t, e).next((e => this.getLocalViewOfDocuments(t, e, Es()).next((() => e))));\n    }\n    /**\n     * Similar to `getDocuments`, but creates the local view from the given\n     * `baseDocs` without retrieving documents from the local store.\n     *\n     * @param transaction - The transaction this operation is scoped to.\n     * @param docs - The documents to apply local mutations to get the local views.\n     * @param existenceStateChanged - The set of document keys whose existence state\n     *   is changed. This is useful to determine if some documents overlay needs\n     *   to be recalculated.\n     */    getLocalViewOfDocuments(t, e, n = Es()) {\n        const s = gs();\n        return this.populateOverlays(t, s, e).next((() => this.computeViews(t, e, s, n).next((t => {\n            let e = ws();\n            return t.forEach(((t, n) => {\n                e = e.insert(t, n.overlayedDocument);\n            })), e;\n        }))));\n    }\n    /**\n     * Gets the overlayed documents for the given document map, which will include\n     * the local view of those documents and a `FieldMask` indicating which fields\n     * are mutated locally, `null` if overlay is a Set or Delete mutation.\n     */    getOverlayedDocuments(t, e) {\n        const n = gs();\n        return this.populateOverlays(t, n, e).next((() => this.computeViews(t, e, n, Es())));\n    }\n    /**\n     * Fetches the overlays for {@code docs} and adds them to provided overlay map\n     * if the map does not already contain an entry for the given document key.\n     */    populateOverlays(t, e, n) {\n        const s = [];\n        return n.forEach((t => {\n            e.has(t) || s.push(t);\n        })), this.documentOverlayCache.getOverlays(t, s).next((t => {\n            t.forEach(((t, n) => {\n                e.set(t, n);\n            }));\n        }));\n    }\n    /**\n     * Computes the local view for the given documents.\n     *\n     * @param docs - The documents to compute views for. It also has the base\n     *   version of the documents.\n     * @param overlays - The overlays that need to be applied to the given base\n     *   version of the documents.\n     * @param existenceStateChanged - A set of documents whose existence states\n     *   might have changed. This is used to determine if we need to re-calculate\n     *   overlays from mutation queues.\n     * @return A map represents the local documents view.\n     */    computeViews(t, e, n, s) {\n        let i = ds();\n        const r = ps(), o = ps();\n        return e.forEach(((t, e) => {\n            const o = n.get(e.key);\n            // Recalculate an overlay if the document's existence state changed due to\n            // a remote event *and* the overlay is a PatchMutation. This is because\n            // document existence state can change if some patch mutation's\n            // preconditions are met.\n            // NOTE: we recalculate when `overlay` is undefined as well, because there\n            // might be a patch mutation whose precondition does not match before the\n            // change (hence overlay is undefined), but would now match.\n                        s.has(e.key) && (void 0 === o || o.mutation instanceof ts) ? i = i.insert(e.key, e) : void 0 !== o ? (r.set(e.key, o.mutation.getFieldMask()), \n            Jn(o.mutation, e, o.mutation.getFieldMask(), nt.now())) : \n            // no overlay exists\n            // Using EMPTY to indicate there is no overlay for the document.\n            r.set(e.key, Je.empty());\n        })), this.recalculateAndSaveOverlays(t, i).next((t => (t.forEach(((t, e) => r.set(t, e))), \n        e.forEach(((t, e) => {\n            var n;\n            return o.set(t, new yo(e, null !== (n = r.get(t)) && void 0 !== n ? n : null));\n        })), o)));\n    }\n    recalculateAndSaveOverlays(t, e) {\n        const n = ps();\n        // A reverse lookup map from batch id to the documents within that batch.\n                let s = new Ge(((t, e) => t - e)), i = Es();\n        return this.mutationQueue.getAllMutationBatchesAffectingDocumentKeys(t, e).next((t => {\n            for (const i of t) i.keys().forEach((t => {\n                const r = e.get(t);\n                if (null === r) return;\n                let o = n.get(t) || Je.empty();\n                o = i.applyToLocalView(r, o), n.set(t, o);\n                const u = (s.get(i.batchId) || Es()).add(t);\n                s = s.insert(i.batchId, u);\n            }));\n        })).next((() => {\n            const r = [], o = s.getReverseIterator();\n            // Iterate in descending order of batch IDs, and skip documents that are\n            // already saved.\n                        for (;o.hasNext(); ) {\n                const s = o.getNext(), u = s.key, c = s.value, a = ys();\n                c.forEach((t => {\n                    if (!i.has(t)) {\n                        const s = zn(e.get(t), n.get(t));\n                        null !== s && a.set(t, s), i = i.add(t);\n                    }\n                })), r.push(this.documentOverlayCache.saveOverlays(t, u, a));\n            }\n            return At.waitFor(r);\n        })).next((() => n));\n    }\n    /**\n     * Recalculates overlays by reading the documents from remote document cache\n     * first, and saves them after they are calculated.\n     */    recalculateAndSaveOverlaysForDocumentKeys(t, e) {\n        return this.remoteDocumentCache.getEntries(t, e).next((e => this.recalculateAndSaveOverlays(t, e)));\n    }\n    /**\n     * Performs a query against the local view of all documents.\n     *\n     * @param transaction - The persistence transaction.\n     * @param query - The query to match documents against.\n     * @param offset - Read time and key to start scanning by (exclusive).\n     */    getDocumentsMatchingQuery(t, e, n) {\n        /**\n * Returns whether the query matches a single document by path (rather than a\n * collection).\n */\n        return function(t) {\n            return ct.isDocumentKey(t.path) && null === t.collectionGroup && 0 === t.filters.length;\n        }(e) ? this.getDocumentsMatchingDocumentQuery(t, e.path) : wn(e) ? this.getDocumentsMatchingCollectionGroupQuery(t, e, n) : this.getDocumentsMatchingCollectionQuery(t, e, n);\n    }\n    /**\n     * Given a collection group, returns the next documents that follow the provided offset, along\n     * with an updated batch ID.\n     *\n     * <p>The documents returned by this method are ordered by remote version from the provided\n     * offset. If there are no more remote documents after the provided offset, documents with\n     * mutations in order of batch id from the offset are returned. Since all documents in a batch are\n     * returned together, the total number of documents returned can exceed {@code count}.\n     *\n     * @param transaction\n     * @param collectionGroup The collection group for the documents.\n     * @param offset The offset to index into.\n     * @param count The number of documents to return\n     * @return A LocalWriteResult with the documents that follow the provided offset and the last processed batch id.\n     */    getNextDocuments(t, e, n, s) {\n        return this.remoteDocumentCache.getAllFromCollectionGroup(t, e, n, s).next((i => {\n            const r = s - i.size > 0 ? this.documentOverlayCache.getOverlaysForCollectionGroup(t, e, n.largestBatchId, s - i.size) : At.resolve(gs());\n            // The callsite will use the largest batch ID together with the latest read time to create\n            // a new index offset. Since we only process batch IDs if all remote documents have been read,\n            // no overlay will increase the overall read time. This is why we only need to special case\n            // the batch id.\n                        let o = -1, u = i;\n            return r.next((e => At.forEach(e, ((e, n) => (o < n.largestBatchId && (o = n.largestBatchId), \n            i.get(e) ? At.resolve() : this.remoteDocumentCache.getEntry(t, e).next((t => {\n                u = u.insert(e, t);\n            }))))).next((() => this.populateOverlays(t, e, i))).next((() => this.computeViews(t, u, e, Es()))).next((t => ({\n                batchId: o,\n                changes: ms(t)\n            })))));\n        }));\n    }\n    getDocumentsMatchingDocumentQuery(t, e) {\n        // Just do a simple document lookup.\n        return this.getDocument(t, new ct(e)).next((t => {\n            let e = ws();\n            return t.isFoundDocument() && (e = e.insert(t.key, t)), e;\n        }));\n    }\n    getDocumentsMatchingCollectionGroupQuery(t, e, n) {\n        const s = e.collectionGroup;\n        let i = ws();\n        return this.indexManager.getCollectionParents(t, s).next((r => At.forEach(r, (r => {\n            const o = function(t, e) {\n                return new an(e, \n                /*collectionGroup=*/ null, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);\n            }(e, r.child(s));\n            return this.getDocumentsMatchingCollectionQuery(t, o, n).next((t => {\n                t.forEach(((t, e) => {\n                    i = i.insert(t, e);\n                }));\n            }));\n        })).next((() => i))));\n    }\n    getDocumentsMatchingCollectionQuery(t, e, n) {\n        // Query the remote documents and overlay mutations.\n        let s;\n        return this.remoteDocumentCache.getAllFromCollection(t, e.path, n).next((i => (s = i, \n        this.documentOverlayCache.getOverlaysForCollection(t, e.path, n.largestBatchId)))).next((t => {\n            // As documents might match the query because of their overlay we need to\n            // include documents for all overlays in the initial document set.\n            t.forEach(((t, e) => {\n                const n = e.getKey();\n                null === s.get(n) && (s = s.insert(n, Ze.newInvalidDocument(n)));\n            }));\n            // Apply the overlays and match against the query.\n            let n = ws();\n            return s.forEach(((s, i) => {\n                const r = t.get(s);\n                void 0 !== r && Jn(r.mutation, i, Je.empty(), nt.now()), \n                // Finally, insert the documents that still match the query\n                An(e, i) && (n = n.insert(s, i));\n            })), n;\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 */ class Io {\n    constructor(t) {\n        this.yt = t, this.Zn = new Map, this.ts = new Map;\n    }\n    getBundleMetadata(t, e) {\n        return At.resolve(this.Zn.get(e));\n    }\n    saveBundleMetadata(t, e) {\n        /** Decodes a BundleMetadata proto into a BundleMetadata object. */\n        var n;\n        return this.Zn.set(e.id, {\n            id: (n = e).id,\n            version: n.version,\n            createTime: qs(n.createTime)\n        }), At.resolve();\n    }\n    getNamedQuery(t, e) {\n        return At.resolve(this.ts.get(e));\n    }\n    saveNamedQuery(t, e) {\n        return this.ts.set(e.name, function(t) {\n            return {\n                name: t.name,\n                query: ir(t.bundledQuery),\n                readTime: qs(t.readTime)\n            };\n        }(e)), At.resolve();\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 in-memory implementation of DocumentOverlayCache.\n */ class To {\n    constructor() {\n        // A map sorted by DocumentKey, whose value is a pair of the largest batch id\n        // for the overlay and the overlay itself.\n        this.overlays = new Ge(ct.comparator), this.es = new Map;\n    }\n    getOverlay(t, e) {\n        return At.resolve(this.overlays.get(e));\n    }\n    getOverlays(t, e) {\n        const n = gs();\n        return At.forEach(e, (e => this.getOverlay(t, e).next((t => {\n            null !== t && n.set(e, t);\n        })))).next((() => n));\n    }\n    saveOverlays(t, e, n) {\n        return n.forEach(((n, s) => {\n            this.oe(t, e, s);\n        })), At.resolve();\n    }\n    removeOverlaysForBatchId(t, e, n) {\n        const s = this.es.get(n);\n        return void 0 !== s && (s.forEach((t => this.overlays = this.overlays.remove(t))), \n        this.es.delete(n)), At.resolve();\n    }\n    getOverlaysForCollection(t, e, n) {\n        const s = gs(), i = e.length + 1, r = new ct(e.child(\"\")), o = this.overlays.getIteratorFrom(r);\n        for (;o.hasNext(); ) {\n            const t = o.getNext().value, r = t.getKey();\n            if (!e.isPrefixOf(r.path)) break;\n            // Documents from sub-collections\n                        r.path.length === i && (t.largestBatchId > n && s.set(t.getKey(), t));\n        }\n        return At.resolve(s);\n    }\n    getOverlaysForCollectionGroup(t, e, n, s) {\n        let i = new Ge(((t, e) => t - e));\n        const r = this.overlays.getIterator();\n        for (;r.hasNext(); ) {\n            const t = r.getNext().value;\n            if (t.getKey().getCollectionGroup() === e && t.largestBatchId > n) {\n                let e = i.get(t.largestBatchId);\n                null === e && (e = gs(), i = i.insert(t.largestBatchId, e)), e.set(t.getKey(), t);\n            }\n        }\n        const o = gs(), u = i.getIterator();\n        for (;u.hasNext(); ) {\n            if (u.getNext().value.forEach(((t, e) => o.set(t, e))), o.size() >= s) break;\n        }\n        return At.resolve(o);\n    }\n    oe(t, e, n) {\n        // Remove the association of the overlay to its batch id.\n        const s = this.overlays.get(n.key);\n        if (null !== s) {\n            const t = this.es.get(s.largestBatchId).delete(n.key);\n            this.es.set(s.largestBatchId, t);\n        }\n        this.overlays = this.overlays.insert(n.key, new Wi(e, n));\n        // Create the association of this overlay to the given largestBatchId.\n        let i = this.es.get(e);\n        void 0 === i && (i = Es(), this.es.set(e, i)), this.es.set(e, i.add(n.key));\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 * A collection of references to a document from some kind of numbered entity\n * (either a target ID or batch ID). As references are added to or removed from\n * the set corresponding events are emitted to a registered garbage collector.\n *\n * Each reference is represented by a DocumentReference object. Each of them\n * contains enough information to uniquely identify the reference. They are all\n * stored primarily in a set sorted by key. A document is considered garbage if\n * there's no references in that set (this can be efficiently checked thanks to\n * sorting by key).\n *\n * ReferenceSet also keeps a secondary set that contains references sorted by\n * IDs. This one is used to efficiently implement removal of all references by\n * some target ID.\n */ class Eo {\n    constructor() {\n        // A set of outstanding references to a document sorted by key.\n        this.ns = new We(Ao.ss), \n        // A set of outstanding references to a document sorted by target id.\n        this.rs = new We(Ao.os);\n    }\n    /** Returns true if the reference set contains no references. */    isEmpty() {\n        return this.ns.isEmpty();\n    }\n    /** Adds a reference to the given document key for the given ID. */    addReference(t, e) {\n        const n = new Ao(t, e);\n        this.ns = this.ns.add(n), this.rs = this.rs.add(n);\n    }\n    /** Add references to the given document keys for the given ID. */    us(t, e) {\n        t.forEach((t => this.addReference(t, e)));\n    }\n    /**\n     * Removes a reference to the given document key for the given\n     * ID.\n     */    removeReference(t, e) {\n        this.cs(new Ao(t, e));\n    }\n    hs(t, e) {\n        t.forEach((t => this.removeReference(t, e)));\n    }\n    /**\n     * Clears all references with a given ID. Calls removeRef() for each key\n     * removed.\n     */    ls(t) {\n        const e = new ct(new rt([])), n = new Ao(e, t), s = new Ao(e, t + 1), i = [];\n        return this.rs.forEachInRange([ n, s ], (t => {\n            this.cs(t), i.push(t.key);\n        })), i;\n    }\n    fs() {\n        this.ns.forEach((t => this.cs(t)));\n    }\n    cs(t) {\n        this.ns = this.ns.delete(t), this.rs = this.rs.delete(t);\n    }\n    ds(t) {\n        const e = new ct(new rt([])), n = new Ao(e, t), s = new Ao(e, t + 1);\n        let i = Es();\n        return this.rs.forEachInRange([ n, s ], (t => {\n            i = i.add(t.key);\n        })), i;\n    }\n    containsKey(t) {\n        const e = new Ao(t, 0), n = this.ns.firstAfterOrEqual(e);\n        return null !== n && t.isEqual(n.key);\n    }\n}\n\nclass Ao {\n    constructor(t, e) {\n        this.key = t, this._s = e;\n    }\n    /** Compare by key then by ID */    static ss(t, e) {\n        return ct.comparator(t.key, e.key) || Z(t._s, e._s);\n    }\n    /** Compare by ID then by key */    static os(t, e) {\n        return Z(t._s, e._s) || ct.comparator(t.key, e.key);\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 Ro {\n    constructor(t, e) {\n        this.indexManager = t, this.referenceDelegate = e, \n        /**\n         * The set of all mutations that have been sent but not yet been applied to\n         * the backend.\n         */\n        this.mutationQueue = [], \n        /** Next value to use when assigning sequential IDs to each mutation batch. */\n        this.ws = 1, \n        /** An ordered mapping between documents and the mutations batch IDs. */\n        this.gs = new We(Ao.ss);\n    }\n    checkEmpty(t) {\n        return At.resolve(0 === this.mutationQueue.length);\n    }\n    addMutationBatch(t, e, n, s) {\n        const i = this.ws;\n        this.ws++, this.mutationQueue.length > 0 && this.mutationQueue[this.mutationQueue.length - 1];\n        const r = new Qi(i, e, n, s);\n        this.mutationQueue.push(r);\n        // Track references by document key and index collection parents.\n        for (const e of s) this.gs = this.gs.add(new Ao(e.key, i)), this.indexManager.addToCollectionParentIndex(t, e.key.path.popLast());\n        return At.resolve(r);\n    }\n    lookupMutationBatch(t, e) {\n        return At.resolve(this.ys(e));\n    }\n    getNextMutationBatchAfterBatchId(t, e) {\n        const n = e + 1, s = this.ps(n), i = s < 0 ? 0 : s;\n        // The requested batchId may still be out of range so normalize it to the\n        // start of the queue.\n                return At.resolve(this.mutationQueue.length > i ? this.mutationQueue[i] : null);\n    }\n    getHighestUnacknowledgedBatchId() {\n        return At.resolve(0 === this.mutationQueue.length ? -1 : this.ws - 1);\n    }\n    getAllMutationBatches(t) {\n        return At.resolve(this.mutationQueue.slice());\n    }\n    getAllMutationBatchesAffectingDocumentKey(t, e) {\n        const n = new Ao(e, 0), s = new Ao(e, Number.POSITIVE_INFINITY), i = [];\n        return this.gs.forEachInRange([ n, s ], (t => {\n            const e = this.ys(t._s);\n            i.push(e);\n        })), At.resolve(i);\n    }\n    getAllMutationBatchesAffectingDocumentKeys(t, e) {\n        let n = new We(Z);\n        return e.forEach((t => {\n            const e = new Ao(t, 0), s = new Ao(t, Number.POSITIVE_INFINITY);\n            this.gs.forEachInRange([ e, s ], (t => {\n                n = n.add(t._s);\n            }));\n        })), At.resolve(this.Is(n));\n    }\n    getAllMutationBatchesAffectingQuery(t, e) {\n        // Use the query path as a prefix for testing if a document matches the\n        // query.\n        const n = e.path, s = n.length + 1;\n        // Construct a document reference for actually scanning the index. Unlike\n        // the prefix the document key in this reference must have an even number of\n        // segments. The empty segment can be used a suffix of the query path\n        // because it precedes all other segments in an ordered traversal.\n        let i = n;\n        ct.isDocumentKey(i) || (i = i.child(\"\"));\n        const r = new Ao(new ct(i), 0);\n        // Find unique batchIDs referenced by all documents potentially matching the\n        // query.\n                let o = new We(Z);\n        return this.gs.forEachWhile((t => {\n            const e = t.key.path;\n            return !!n.isPrefixOf(e) && (\n            // Rows with document keys more than one segment longer than the query\n            // path can't be matches. For example, a query on 'rooms' can't match\n            // the document /rooms/abc/messages/xyx.\n            // TODO(mcg): we'll need a different scanner when we implement\n            // ancestor queries.\n            e.length === s && (o = o.add(t._s)), !0);\n        }), r), At.resolve(this.Is(o));\n    }\n    Is(t) {\n        // Construct an array of matching batches, sorted by batchID to ensure that\n        // multiple mutations affecting the same document key are applied in order.\n        const e = [];\n        return t.forEach((t => {\n            const n = this.ys(t);\n            null !== n && e.push(n);\n        })), e;\n    }\n    removeMutationBatch(t, e) {\n        M(0 === this.Ts(e.batchId, \"removed\")), this.mutationQueue.shift();\n        let n = this.gs;\n        return At.forEach(e.mutations, (s => {\n            const i = new Ao(s.key, e.batchId);\n            return n = n.delete(i), this.referenceDelegate.markPotentiallyOrphaned(t, s.key);\n        })).next((() => {\n            this.gs = n;\n        }));\n    }\n    An(t) {\n        // No-op since the memory mutation queue does not maintain a separate cache.\n    }\n    containsKey(t, e) {\n        const n = new Ao(e, 0), s = this.gs.firstAfterOrEqual(n);\n        return At.resolve(e.isEqual(s && s.key));\n    }\n    performConsistencyCheck(t) {\n        return this.mutationQueue.length, At.resolve();\n    }\n    /**\n     * Finds the index of the given batchId in the mutation queue and asserts that\n     * the resulting index is within the bounds of the queue.\n     *\n     * @param batchId - The batchId to search for\n     * @param action - A description of what the caller is doing, phrased in passive\n     * form (e.g. \"acknowledged\" in a routine that acknowledges batches).\n     */    Ts(t, e) {\n        return this.ps(t);\n    }\n    /**\n     * Finds the index of the given batchId in the mutation queue. This operation\n     * is O(1).\n     *\n     * @returns The computed index of the batch with the given batchId, based on\n     * the state of the queue. Note this index can be negative if the requested\n     * batchId has already been remvoed from the queue or past the end of the\n     * queue if the batchId is larger than the last added batch.\n     */    ps(t) {\n        if (0 === this.mutationQueue.length) \n        // As an index this is past the end of the queue\n        return 0;\n        // Examine the front of the queue to figure out the difference between the\n        // batchId and indexes in the array. Note that since the queue is ordered\n        // by batchId, if the first batch has a larger batchId then the requested\n        // batchId doesn't exist in the queue.\n                return t - this.mutationQueue[0].batchId;\n    }\n    /**\n     * A version of lookupMutationBatch that doesn't return a promise, this makes\n     * other functions that uses this code easier to read and more efficent.\n     */    ys(t) {\n        const e = this.ps(t);\n        if (e < 0 || e >= this.mutationQueue.length) return null;\n        return this.mutationQueue[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 * The memory-only RemoteDocumentCache for IndexedDb. To construct, invoke\n * `newMemoryRemoteDocumentCache()`.\n */\nclass bo {\n    /**\n     * @param sizer - Used to assess the size of a document. For eager GC, this is\n     * expected to just return 0 to avoid unnecessarily doing the work of\n     * calculating the size.\n     */\n    constructor(t) {\n        this.Es = t, \n        /** Underlying cache of documents and their read times. */\n        this.docs = new Ge(ct.comparator), \n        /** Size of all cached documents. */\n        this.size = 0;\n    }\n    setIndexManager(t) {\n        this.indexManager = t;\n    }\n    /**\n     * Adds the supplied entry to the cache and updates the cache size as appropriate.\n     *\n     * All calls of `addEntry`  are required to go through the RemoteDocumentChangeBuffer\n     * returned by `newChangeBuffer()`.\n     */    addEntry(t, e) {\n        const n = e.key, s = this.docs.get(n), i = s ? s.size : 0, r = this.Es(e);\n        return this.docs = this.docs.insert(n, {\n            document: e.mutableCopy(),\n            size: r\n        }), this.size += r - i, this.indexManager.addToCollectionParentIndex(t, n.path.popLast());\n    }\n    /**\n     * Removes the specified entry from the cache and updates the cache size as appropriate.\n     *\n     * All calls of `removeEntry` are required to go through the RemoteDocumentChangeBuffer\n     * returned by `newChangeBuffer()`.\n     */    removeEntry(t) {\n        const e = this.docs.get(t);\n        e && (this.docs = this.docs.remove(t), this.size -= e.size);\n    }\n    getEntry(t, e) {\n        const n = this.docs.get(e);\n        return At.resolve(n ? n.document.mutableCopy() : Ze.newInvalidDocument(e));\n    }\n    getEntries(t, e) {\n        let n = ds();\n        return e.forEach((t => {\n            const e = this.docs.get(t);\n            n = n.insert(t, e ? e.document.mutableCopy() : Ze.newInvalidDocument(t));\n        })), At.resolve(n);\n    }\n    getAllFromCollection(t, e, n) {\n        let s = ds();\n        // Documents are ordered by key, so we can use a prefix scan to narrow down\n        // the documents we need to match the query against.\n                const i = new ct(e.child(\"\")), r = this.docs.getIteratorFrom(i);\n        for (;r.hasNext(); ) {\n            const {key: t, value: {document: i}} = r.getNext();\n            if (!e.isPrefixOf(t.path)) break;\n            t.path.length > e.length + 1 || (pt(gt(i), n) <= 0 || (s = s.insert(i.key, i.mutableCopy())));\n        }\n        return At.resolve(s);\n    }\n    getAllFromCollectionGroup(t, e, n, s) {\n        // This method should only be called from the IndexBackfiller if persistence\n        // is enabled.\n        O();\n    }\n    As(t, e) {\n        return At.forEach(this.docs, (t => e(t)));\n    }\n    newChangeBuffer(t) {\n        // `trackRemovals` is ignores since the MemoryRemoteDocumentCache keeps\n        // a separate changelog and does not need special handling for removals.\n        return new Po(this);\n    }\n    getSize(t) {\n        return At.resolve(this.size);\n    }\n}\n\n/**\n * Creates a new memory-only RemoteDocumentCache.\n *\n * @param sizer - Used to assess the size of a document. For eager GC, this is\n * expected to just return 0 to avoid unnecessarily doing the work of\n * calculating the size.\n */\n/**\n * Handles the details of adding and updating documents in the MemoryRemoteDocumentCache.\n */\nclass Po extends co {\n    constructor(t) {\n        super(), this.Yn = t;\n    }\n    applyChanges(t) {\n        const e = [];\n        return this.changes.forEach(((n, s) => {\n            s.isValidDocument() ? e.push(this.Yn.addEntry(t, s)) : this.Yn.removeEntry(n);\n        })), At.waitFor(e);\n    }\n    getFromCache(t, e) {\n        return this.Yn.getEntry(t, e);\n    }\n    getAllFromCache(t, e) {\n        return this.Yn.getEntries(t, 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 */ class vo {\n    constructor(t) {\n        this.persistence = t, \n        /**\n         * Maps a target to the data about that target\n         */\n        this.Rs = new ls((t => nn(t)), sn), \n        /** The last received snapshot version. */\n        this.lastRemoteSnapshotVersion = st.min(), \n        /** The highest numbered target ID encountered. */\n        this.highestTargetId = 0, \n        /** The highest sequence number encountered. */\n        this.bs = 0, \n        /**\n         * A ordered bidirectional mapping between documents and the remote target\n         * IDs.\n         */\n        this.Ps = new Eo, this.targetCount = 0, this.vs = Yr.Pn();\n    }\n    forEachTarget(t, e) {\n        return this.Rs.forEach(((t, n) => e(n))), At.resolve();\n    }\n    getLastRemoteSnapshotVersion(t) {\n        return At.resolve(this.lastRemoteSnapshotVersion);\n    }\n    getHighestSequenceNumber(t) {\n        return At.resolve(this.bs);\n    }\n    allocateTargetId(t) {\n        return this.highestTargetId = this.vs.next(), At.resolve(this.highestTargetId);\n    }\n    setTargetsMetadata(t, e, n) {\n        return n && (this.lastRemoteSnapshotVersion = n), e > this.bs && (this.bs = e), \n        At.resolve();\n    }\n    Dn(t) {\n        this.Rs.set(t.target, t);\n        const e = t.targetId;\n        e > this.highestTargetId && (this.vs = new Yr(e), this.highestTargetId = e), t.sequenceNumber > this.bs && (this.bs = t.sequenceNumber);\n    }\n    addTargetData(t, e) {\n        return this.Dn(e), this.targetCount += 1, At.resolve();\n    }\n    updateTargetData(t, e) {\n        return this.Dn(e), At.resolve();\n    }\n    removeTargetData(t, e) {\n        return this.Rs.delete(e.target), this.Ps.ls(e.targetId), this.targetCount -= 1, \n        At.resolve();\n    }\n    removeTargets(t, e, n) {\n        let s = 0;\n        const i = [];\n        return this.Rs.forEach(((r, o) => {\n            o.sequenceNumber <= e && null === n.get(o.targetId) && (this.Rs.delete(r), i.push(this.removeMatchingKeysForTargetId(t, o.targetId)), \n            s++);\n        })), At.waitFor(i).next((() => s));\n    }\n    getTargetCount(t) {\n        return At.resolve(this.targetCount);\n    }\n    getTargetData(t, e) {\n        const n = this.Rs.get(e) || null;\n        return At.resolve(n);\n    }\n    addMatchingKeys(t, e, n) {\n        return this.Ps.us(e, n), At.resolve();\n    }\n    removeMatchingKeys(t, e, n) {\n        this.Ps.hs(e, n);\n        const s = this.persistence.referenceDelegate, i = [];\n        return s && e.forEach((e => {\n            i.push(s.markPotentiallyOrphaned(t, e));\n        })), At.waitFor(i);\n    }\n    removeMatchingKeysForTargetId(t, e) {\n        return this.Ps.ls(e), At.resolve();\n    }\n    getMatchingKeysForTargetId(t, e) {\n        const n = this.Ps.ds(e);\n        return At.resolve(n);\n    }\n    containsKey(t, e) {\n        return At.resolve(this.Ps.containsKey(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 * A memory-backed instance of Persistence. Data is stored only in RAM and\n * not persisted across sessions.\n */\nclass Vo {\n    /**\n     * The constructor accepts a factory for creating a reference delegate. This\n     * allows both the delegate and this instance to have strong references to\n     * each other without having nullable fields that would then need to be\n     * checked or asserted on every access.\n     */\n    constructor(t, e) {\n        this.Vs = {}, this.overlays = {}, this.Ss = new Ot(0), this.Ds = !1, this.Ds = !0, \n        this.referenceDelegate = t(this), this.Cs = new vo(this);\n        this.indexManager = new Nr, this.remoteDocumentCache = function(t) {\n            return new bo(t);\n        }((t => this.referenceDelegate.xs(t))), this.yt = new Hi(e), this.Ns = new Io(this.yt);\n    }\n    start() {\n        return Promise.resolve();\n    }\n    shutdown() {\n        // No durable state to ensure is closed on shutdown.\n        return this.Ds = !1, Promise.resolve();\n    }\n    get started() {\n        return this.Ds;\n    }\n    setDatabaseDeletedListener() {\n        // No op.\n    }\n    setNetworkEnabled() {\n        // No op.\n    }\n    getIndexManager(t) {\n        // We do not currently support indices for memory persistence, so we can\n        // return the same shared instance of the memory index manager.\n        return this.indexManager;\n    }\n    getDocumentOverlayCache(t) {\n        let e = this.overlays[t.toKey()];\n        return e || (e = new To, this.overlays[t.toKey()] = e), e;\n    }\n    getMutationQueue(t, e) {\n        let n = this.Vs[t.toKey()];\n        return n || (n = new Ro(e, this.referenceDelegate), this.Vs[t.toKey()] = n), n;\n    }\n    getTargetCache() {\n        return this.Cs;\n    }\n    getRemoteDocumentCache() {\n        return this.remoteDocumentCache;\n    }\n    getBundleCache() {\n        return this.Ns;\n    }\n    runTransaction(t, e, n) {\n        C(\"MemoryPersistence\", \"Starting transaction:\", t);\n        const s = new So(this.Ss.next());\n        return this.referenceDelegate.ks(), n(s).next((t => this.referenceDelegate.Os(s).next((() => t)))).toPromise().then((t => (s.raiseOnCommittedEvent(), \n        t)));\n    }\n    Ms(t, e) {\n        return At.or(Object.values(this.Vs).map((n => () => n.containsKey(t, e))));\n    }\n}\n\n/**\n * Memory persistence is not actually transactional, but future implementations\n * may have transaction-scoped state.\n */ class So extends Tt {\n    constructor(t) {\n        super(), this.currentSequenceNumber = t;\n    }\n}\n\nclass Do {\n    constructor(t) {\n        this.persistence = t, \n        /** Tracks all documents that are active in Query views. */\n        this.Fs = new Eo, \n        /** The list of documents that are potentially GCed after each transaction. */\n        this.$s = null;\n    }\n    static Bs(t) {\n        return new Do(t);\n    }\n    get Ls() {\n        if (this.$s) return this.$s;\n        throw O();\n    }\n    addReference(t, e, n) {\n        return this.Fs.addReference(n, e), this.Ls.delete(n.toString()), At.resolve();\n    }\n    removeReference(t, e, n) {\n        return this.Fs.removeReference(n, e), this.Ls.add(n.toString()), At.resolve();\n    }\n    markPotentiallyOrphaned(t, e) {\n        return this.Ls.add(e.toString()), At.resolve();\n    }\n    removeTarget(t, e) {\n        this.Fs.ls(e.targetId).forEach((t => this.Ls.add(t.toString())));\n        const n = this.persistence.getTargetCache();\n        return n.getMatchingKeysForTargetId(t, e.targetId).next((t => {\n            t.forEach((t => this.Ls.add(t.toString())));\n        })).next((() => n.removeTargetData(t, e)));\n    }\n    ks() {\n        this.$s = new Set;\n    }\n    Os(t) {\n        // Remove newly orphaned documents.\n        const e = this.persistence.getRemoteDocumentCache().newChangeBuffer();\n        return At.forEach(this.Ls, (n => {\n            const s = ct.fromPath(n);\n            return this.qs(t, s).next((t => {\n                t || e.removeEntry(s, st.min());\n            }));\n        })).next((() => (this.$s = null, e.apply(t))));\n    }\n    updateLimboDocument(t, e) {\n        return this.qs(t, e).next((t => {\n            t ? this.Ls.delete(e.toString()) : this.Ls.add(e.toString());\n        }));\n    }\n    xs(t) {\n        // For eager GC, we don't care about the document size, there are no size thresholds.\n        return 0;\n    }\n    qs(t, e) {\n        return At.or([ () => At.resolve(this.Fs.containsKey(e)), () => this.persistence.getTargetCache().containsKey(t, e), () => this.persistence.Ms(t, e) ]);\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/** Performs database creation and schema upgrades. */ class Co {\n    constructor(t) {\n        this.yt = t;\n    }\n    /**\n     * Performs database creation and schema upgrades.\n     *\n     * Note that in production, this method is only ever used to upgrade the schema\n     * to SCHEMA_VERSION. Different values of toVersion are only used for testing\n     * and local feature development.\n     */    $(t, e, n, s) {\n        const i = new Rt(\"createOrUpgrade\", e);\n        n < 1 && s >= 1 && (function(t) {\n            t.createObjectStore(\"owner\");\n        }(t), function(t) {\n            t.createObjectStore(\"mutationQueues\", {\n                keyPath: \"userId\"\n            });\n            t.createObjectStore(\"mutations\", {\n                keyPath: \"batchId\",\n                autoIncrement: !0\n            }).createIndex(\"userMutationsIndex\", Ii, {\n                unique: !0\n            }), t.createObjectStore(\"documentMutations\");\n        }\n        /**\n * Upgrade function to migrate the 'mutations' store from V1 to V3. Loads\n * and rewrites all data.\n */ (t), xo(t), function(t) {\n            t.createObjectStore(\"remoteDocuments\");\n        }(t));\n        // Migration 2 to populate the targetGlobal object no longer needed since\n        // migration 3 unconditionally clears it.\n                let r = At.resolve();\n        return n < 3 && s >= 3 && (\n        // Brand new clients don't need to drop and recreate--only clients that\n        // potentially have corrupt data.\n        0 !== n && (!function(t) {\n            t.deleteObjectStore(\"targetDocuments\"), t.deleteObjectStore(\"targets\"), t.deleteObjectStore(\"targetGlobal\");\n        }(t), xo(t)), r = r.next((() => \n        /**\n * Creates the target global singleton row.\n *\n * @param txn - The version upgrade transaction for indexeddb\n */\n        function(t) {\n            const e = t.store(\"targetGlobal\"), n = {\n                highestTargetId: 0,\n                highestListenSequenceNumber: 0,\n                lastRemoteSnapshotVersion: st.min().toTimestamp(),\n                targetCount: 0\n            };\n            return e.put(\"targetGlobalKey\", n);\n        }(i)))), n < 4 && s >= 4 && (0 !== n && (\n        // Schema version 3 uses auto-generated keys to generate globally unique\n        // mutation batch IDs (this was previously ensured internally by the\n        // client). To migrate to the new schema, we have to read all mutations\n        // and write them back out. We preserve the existing batch IDs to guarantee\n        // consistency with other object stores. Any further mutation batch IDs will\n        // be auto-generated.\n        r = r.next((() => function(t, e) {\n            return e.store(\"mutations\").W().next((n => {\n                t.deleteObjectStore(\"mutations\");\n                t.createObjectStore(\"mutations\", {\n                    keyPath: \"batchId\",\n                    autoIncrement: !0\n                }).createIndex(\"userMutationsIndex\", Ii, {\n                    unique: !0\n                });\n                const s = e.store(\"mutations\"), i = n.map((t => s.put(t)));\n                return At.waitFor(i);\n            }));\n        }(t, i)))), r = r.next((() => {\n            !function(t) {\n                t.createObjectStore(\"clientMetadata\", {\n                    keyPath: \"clientId\"\n                });\n            }(t);\n        }))), n < 5 && s >= 5 && (r = r.next((() => this.Us(i)))), n < 6 && s >= 6 && (r = r.next((() => (function(t) {\n            t.createObjectStore(\"remoteDocumentGlobal\");\n        }(t), this.Ks(i))))), n < 7 && s >= 7 && (r = r.next((() => this.Gs(i)))), n < 8 && s >= 8 && (r = r.next((() => this.Qs(t, i)))), \n        n < 9 && s >= 9 && (r = r.next((() => {\n            // Multi-Tab used to manage its own changelog, but this has been moved\n            // to the DbRemoteDocument object store itself. Since the previous change\n            // log only contained transient data, we can drop its object store.\n            !function(t) {\n                t.objectStoreNames.contains(\"remoteDocumentChanges\") && t.deleteObjectStore(\"remoteDocumentChanges\");\n            }(t);\n            // Note: Schema version 9 used to create a read time index for the\n            // RemoteDocumentCache. This is now done with schema version 13.\n                }))), n < 10 && s >= 10 && (r = r.next((() => this.js(i)))), n < 11 && s >= 11 && (r = r.next((() => {\n            !function(t) {\n                t.createObjectStore(\"bundles\", {\n                    keyPath: \"bundleId\"\n                });\n            }(t), function(t) {\n                t.createObjectStore(\"namedQueries\", {\n                    keyPath: \"name\"\n                });\n            }(t);\n        }))), n < 12 && s >= 12 && (r = r.next((() => {\n            !function(t) {\n                const e = t.createObjectStore(\"documentOverlays\", {\n                    keyPath: Oi\n                });\n                e.createIndex(\"collectionPathOverlayIndex\", Mi, {\n                    unique: !1\n                }), e.createIndex(\"collectionGroupOverlayIndex\", Fi, {\n                    unique: !1\n                });\n            }(t);\n        }))), n < 13 && s >= 13 && (r = r.next((() => function(t) {\n            const e = t.createObjectStore(\"remoteDocumentsV14\", {\n                keyPath: Ri\n            });\n            e.createIndex(\"documentKeyIndex\", bi), e.createIndex(\"collectionGroupIndex\", Pi);\n        }(t))).next((() => this.Ws(t, i))).next((() => t.deleteObjectStore(\"remoteDocuments\")))), \n        n < 14 && s >= 14 && (r = r.next((() => this.zs(t, i)))), n < 15 && s >= 15 && (r = r.next((() => function(t) {\n            t.createObjectStore(\"indexConfiguration\", {\n                keyPath: \"indexId\",\n                autoIncrement: !0\n            }).createIndex(\"collectionGroupIndex\", \"collectionGroup\", {\n                unique: !1\n            });\n            t.createObjectStore(\"indexState\", {\n                keyPath: Ci\n            }).createIndex(\"sequenceNumberIndex\", xi, {\n                unique: !1\n            });\n            t.createObjectStore(\"indexEntries\", {\n                keyPath: Ni\n            }).createIndex(\"documentKeyIndex\", ki, {\n                unique: !1\n            });\n        }(t)))), r;\n    }\n    Ks(t) {\n        let e = 0;\n        return t.store(\"remoteDocuments\").Z(((t, n) => {\n            e += Qr(n);\n        })).next((() => {\n            const n = {\n                byteSize: e\n            };\n            return t.store(\"remoteDocumentGlobal\").put(\"remoteDocumentGlobalKey\", n);\n        }));\n    }\n    Us(t) {\n        const e = t.store(\"mutationQueues\"), n = t.store(\"mutations\");\n        return e.W().next((e => At.forEach(e, (e => {\n            const s = IDBKeyRange.bound([ e.userId, -1 ], [ e.userId, e.lastAcknowledgedBatchId ]);\n            return n.W(\"userMutationsIndex\", s).next((n => At.forEach(n, (n => {\n                M(n.userId === e.userId);\n                const s = er(this.yt, n);\n                return Gr(t, e.userId, s).next((() => {}));\n            }))));\n        }))));\n    }\n    /**\n     * Ensures that every document in the remote document cache has a corresponding sentinel row\n     * with a sequence number. Missing rows are given the most recently used sequence number.\n     */    Gs(t) {\n        const e = t.store(\"targetDocuments\"), n = t.store(\"remoteDocuments\");\n        return t.store(\"targetGlobal\").get(\"targetGlobalKey\").next((t => {\n            const s = [];\n            return n.Z(((n, i) => {\n                const r = new rt(n), o = function(t) {\n                    return [ 0, mi(t) ];\n                }(r);\n                s.push(e.get(o).next((n => n ? At.resolve() : (n => e.put({\n                    targetId: 0,\n                    path: mi(n),\n                    sequenceNumber: t.highestListenSequenceNumber\n                }))(r))));\n            })).next((() => At.waitFor(s)));\n        }));\n    }\n    Qs(t, e) {\n        // Create the index.\n        t.createObjectStore(\"collectionParents\", {\n            keyPath: Di\n        });\n        const n = e.store(\"collectionParents\"), s = new kr, i = t => {\n            if (s.add(t)) {\n                const e = t.lastSegment(), s = t.popLast();\n                return n.put({\n                    collectionId: e,\n                    parent: mi(s)\n                });\n            }\n        };\n        // Helper to add an index entry iff we haven't already written it.\n                // Index existing remote documents.\n        return e.store(\"remoteDocuments\").Z({\n            X: !0\n        }, ((t, e) => {\n            const n = new rt(t);\n            return i(n.popLast());\n        })).next((() => e.store(\"documentMutations\").Z({\n            X: !0\n        }, (([t, e, n], s) => {\n            const r = pi(e);\n            return i(r.popLast());\n        }))));\n    }\n    js(t) {\n        const e = t.store(\"targets\");\n        return e.Z(((t, n) => {\n            const s = nr(n), i = sr(this.yt, s);\n            return e.put(i);\n        }));\n    }\n    Ws(t, e) {\n        const n = e.store(\"remoteDocuments\"), s = [];\n        return n.Z(((t, n) => {\n            const i = e.store(\"remoteDocumentsV14\"), r = (o = n, o.document ? new ct(rt.fromString(o.document.name).popFirst(5)) : o.noDocument ? ct.fromSegments(o.noDocument.path) : o.unknownDocument ? ct.fromSegments(o.unknownDocument.path) : O()).path.toArray();\n            var o;\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 u = {\n                prefixPath: r.slice(0, r.length - 2),\n                collectionGroup: r[r.length - 2],\n                documentId: r[r.length - 1],\n                readTime: n.readTime || [ 0, 0 ],\n                unknownDocument: n.unknownDocument,\n                noDocument: n.noDocument,\n                document: n.document,\n                hasCommittedMutations: !!n.hasCommittedMutations\n            };\n            s.push(i.put(u));\n        })).next((() => At.waitFor(s)));\n    }\n    zs(t, e) {\n        const n = e.store(\"mutations\"), s = ho(this.yt), i = new Vo(Do.Bs, this.yt.ie);\n        return n.W().next((t => {\n            const n = new Map;\n            return t.forEach((t => {\n                var e;\n                let s = null !== (e = n.get(t.userId)) && void 0 !== e ? e : Es();\n                er(this.yt, t).keys().forEach((t => s = s.add(t))), n.set(t.userId, s);\n            })), At.forEach(n, ((t, n) => {\n                const r = new P(n), o = lr.re(this.yt, r), u = i.getIndexManager(r), c = jr.re(r, this.yt, u, i.referenceDelegate);\n                return new po(s, c, o, u).recalculateAndSaveOverlaysForDocumentKeys(new Ki(e, Ot.at), t).next();\n            }));\n        }));\n    }\n}\n\nfunction xo(t) {\n    t.createObjectStore(\"targetDocuments\", {\n        keyPath: Vi\n    }).createIndex(\"documentTargetsIndex\", Si, {\n        unique: !0\n    });\n    // NOTE: This is unique only because the TargetId is the suffix.\n    t.createObjectStore(\"targets\", {\n        keyPath: \"targetId\"\n    }).createIndex(\"queryTargetsIndex\", vi, {\n        unique: !0\n    }), t.createObjectStore(\"targetGlobal\");\n}\n\nconst No = \"Failed to obtain exclusive access to the persistence layer. To allow shared access, multi-tab synchronization has to be enabled in all tabs. If you are using `experimentalForceOwningTab:true`, make sure that only one tab has persistence enabled at any given time.\";\n\n/**\n * Oldest acceptable age in milliseconds for client metadata before the client\n * is considered inactive and its associated data is garbage collected.\n */\n/**\n * An IndexedDB-backed instance of Persistence. Data is stored persistently\n * across sessions.\n *\n * On Web only, the Firestore SDKs support shared access to its persistence\n * layer. This allows multiple browser tabs to read and write to IndexedDb and\n * to synchronize state even without network connectivity. Shared access is\n * currently optional and not enabled unless all clients invoke\n * `enablePersistence()` with `{synchronizeTabs:true}`.\n *\n * In multi-tab mode, if multiple clients are active at the same time, the SDK\n * will designate one client as the “primary client”. An effort is made to pick\n * a visible, network-connected and active client, and this client is\n * responsible for letting other clients know about its presence. The primary\n * client writes a unique client-generated identifier (the client ID) to\n * IndexedDb’s “owner” store every 4 seconds. If the primary client fails to\n * update this entry, another client can acquire the lease and take over as\n * primary.\n *\n * Some persistence operations in the SDK are designated as primary-client only\n * operations. This includes the acknowledgment of mutations and all updates of\n * remote documents. The effects of these operations are written to persistence\n * and then broadcast to other tabs via LocalStorage (see\n * `WebStorageSharedClientState`), which then refresh their state from\n * persistence.\n *\n * Similarly, the primary client listens to notifications sent by secondary\n * clients to discover persistence changes written by secondary clients, such as\n * the addition of new mutations and query targets.\n *\n * If multi-tab is not enabled and another tab already obtained the primary\n * lease, IndexedDbPersistence enters a failed state and all subsequent\n * operations will automatically fail.\n *\n * Additionally, there is an optimization so that when a tab is closed, the\n * primary lease is released immediately (this is especially important to make\n * sure that a refreshed tab is able to immediately re-acquire the primary\n * lease). Unfortunately, IndexedDB cannot be reliably used in window.unload\n * since it is an asynchronous API. So in addition to attempting to give up the\n * lease, the leaseholder writes its client ID to a \"zombiedClient\" entry in\n * LocalStorage which acts as an indicator that another tab should go ahead and\n * take the primary lease immediately regardless of the current lease timestamp.\n *\n * TODO(b/114226234): Remove `synchronizeTabs` section when multi-tab is no\n * longer optional.\n */\nclass ko {\n    constructor(\n    /**\n     * Whether to synchronize the in-memory state of multiple tabs and share\n     * access to local persistence.\n     */\n    t, e, n, s, i, r, o, u, c, \n    /**\n     * If set to true, forcefully obtains database access. Existing tabs will\n     * no longer be able to access IndexedDB.\n     */\n    a, h = 15) {\n        if (this.allowTabSynchronization = t, this.persistenceKey = e, this.clientId = n, \n        this.Hs = i, this.window = r, this.document = o, this.Js = c, this.Ys = a, this.Xs = h, \n        this.Ss = null, this.Ds = !1, this.isPrimary = !1, this.networkEnabled = !0, \n        /** Our window.unload handler, if registered. */\n        this.Zs = null, this.inForeground = !1, \n        /** Our 'visibilitychange' listener if registered. */\n        this.ti = null, \n        /** The client metadata refresh task. */\n        this.ei = null, \n        /** The last time we garbage collected the client metadata object store. */\n        this.ni = Number.NEGATIVE_INFINITY, \n        /** A listener to notify on primary state changes. */\n        this.si = t => Promise.resolve(), !ko.C()) throw new L(B.UNIMPLEMENTED, \"This platform is either missing IndexedDB or is known to have an incomplete implementation. Offline persistence has been disabled.\");\n        this.referenceDelegate = new oo(this, s), this.ii = e + \"main\", this.yt = new Hi(u), \n        this.ri = new bt(this.ii, this.Xs, new Co(this.yt)), this.Cs = new Xr(this.referenceDelegate, this.yt), \n        this.remoteDocumentCache = ho(this.yt), this.Ns = new cr, this.window && this.window.localStorage ? this.oi = this.window.localStorage : (this.oi = null, \n        !1 === a && x(\"IndexedDbPersistence\", \"LocalStorage is unavailable. As a result, persistence may not work reliably. In particular enablePersistence() could fail immediately after refreshing the page.\"));\n    }\n    /**\n     * Attempt to start IndexedDb persistence.\n     *\n     * @returns Whether persistence was enabled.\n     */    start() {\n        // NOTE: This is expected to fail sometimes (in the case of another tab\n        // already having the persistence lock), so it's the first thing we should\n        // do.\n        return this.ui().then((() => {\n            if (!this.isPrimary && !this.allowTabSynchronization) \n            // Fail `start()` if `synchronizeTabs` is disabled and we cannot\n            // obtain the primary lease.\n            throw new L(B.FAILED_PRECONDITION, No);\n            return this.ci(), this.ai(), this.hi(), this.runTransaction(\"getHighestListenSequenceNumber\", \"readonly\", (t => this.Cs.getHighestSequenceNumber(t)));\n        })).then((t => {\n            this.Ss = new Ot(t, this.Js);\n        })).then((() => {\n            this.Ds = !0;\n        })).catch((t => (this.ri && this.ri.close(), Promise.reject(t))));\n    }\n    /**\n     * Registers a listener that gets called when the primary state of the\n     * instance changes. Upon registering, this listener is invoked immediately\n     * with the current primary state.\n     *\n     * PORTING NOTE: This is only used for Web multi-tab.\n     */    li(t) {\n        return this.si = async e => {\n            if (this.started) return t(e);\n        }, t(this.isPrimary);\n    }\n    /**\n     * Registers a listener that gets called when the database receives a\n     * version change event indicating that it has deleted.\n     *\n     * PORTING NOTE: This is only used for Web multi-tab.\n     */    setDatabaseDeletedListener(t) {\n        this.ri.L((async e => {\n            // Check if an attempt is made to delete IndexedDB.\n            null === e.newVersion && await t();\n        }));\n    }\n    /**\n     * Adjusts the current network state in the client's metadata, potentially\n     * affecting the primary lease.\n     *\n     * PORTING NOTE: This is only used for Web multi-tab.\n     */    setNetworkEnabled(t) {\n        this.networkEnabled !== t && (this.networkEnabled = t, \n        // Schedule a primary lease refresh for immediate execution. The eventual\n        // lease update will be propagated via `primaryStateListener`.\n        this.Hs.enqueueAndForget((async () => {\n            this.started && await this.ui();\n        })));\n    }\n    /**\n     * Updates the client metadata in IndexedDb and attempts to either obtain or\n     * extend the primary lease for the local client. Asynchronously notifies the\n     * primary state listener if the client either newly obtained or released its\n     * primary lease.\n     */    ui() {\n        return this.runTransaction(\"updateClientMetadataAndTryBecomePrimary\", \"readwrite\", (t => Mo(t).put({\n            clientId: this.clientId,\n            updateTimeMs: Date.now(),\n            networkEnabled: this.networkEnabled,\n            inForeground: this.inForeground\n        }).next((() => {\n            if (this.isPrimary) return this.fi(t).next((t => {\n                t || (this.isPrimary = !1, this.Hs.enqueueRetryable((() => this.si(!1))));\n            }));\n        })).next((() => this.di(t))).next((e => this.isPrimary && !e ? this._i(t).next((() => !1)) : !!e && this.wi(t).next((() => !0)))))).catch((t => {\n            if (Vt(t)) \n            // Proceed with the existing state. Any subsequent access to\n            // IndexedDB will verify the lease.\n            return C(\"IndexedDbPersistence\", \"Failed to extend owner lease: \", t), this.isPrimary;\n            if (!this.allowTabSynchronization) throw t;\n            return C(\"IndexedDbPersistence\", \"Releasing owner lease after error during lease refresh\", t), \n            /* isPrimary= */ !1;\n        })).then((t => {\n            this.isPrimary !== t && this.Hs.enqueueRetryable((() => this.si(t))), this.isPrimary = t;\n        }));\n    }\n    fi(t) {\n        return Oo(t).get(\"owner\").next((t => At.resolve(this.mi(t))));\n    }\n    gi(t) {\n        return Mo(t).delete(this.clientId);\n    }\n    /**\n     * If the garbage collection threshold has passed, prunes the\n     * RemoteDocumentChanges and the ClientMetadata store based on the last update\n     * time of all clients.\n     */    async yi() {\n        if (this.isPrimary && !this.pi(this.ni, 18e5)) {\n            this.ni = Date.now();\n            const t = await this.runTransaction(\"maybeGarbageCollectMultiClientState\", \"readwrite-primary\", (t => {\n                const e = Gi(t, \"clientMetadata\");\n                return e.W().next((t => {\n                    const n = this.Ii(t, 18e5), s = t.filter((t => -1 === n.indexOf(t)));\n                    // Delete metadata for clients that are no longer considered active.\n                    return At.forEach(s, (t => e.delete(t.clientId))).next((() => s));\n                }));\n            })).catch((() => []));\n            // Delete potential leftover entries that may continue to mark the\n            // inactive clients as zombied in LocalStorage.\n            // Ideally we'd delete the IndexedDb and LocalStorage zombie entries for\n            // the client atomically, but we can't. So we opt to delete the IndexedDb\n            // entries first to avoid potentially reviving a zombied client.\n                        if (this.oi) for (const e of t) this.oi.removeItem(this.Ti(e.clientId));\n        }\n    }\n    /**\n     * Schedules a recurring timer to update the client metadata and to either\n     * extend or acquire the primary lease if the client is eligible.\n     */    hi() {\n        this.ei = this.Hs.enqueueAfterDelay(\"client_metadata_refresh\" /* TimerId.ClientMetadataRefresh */ , 4e3, (() => this.ui().then((() => this.yi())).then((() => this.hi()))));\n    }\n    /** Checks whether `client` is the local client. */    mi(t) {\n        return !!t && t.ownerId === this.clientId;\n    }\n    /**\n     * Evaluate the state of all active clients and determine whether the local\n     * client is or can act as the holder of the primary lease. Returns whether\n     * the client is eligible for the lease, but does not actually acquire it.\n     * May return 'false' even if there is no active leaseholder and another\n     * (foreground) client should become leaseholder instead.\n     */    di(t) {\n        if (this.Ys) return At.resolve(!0);\n        return Oo(t).get(\"owner\").next((e => {\n            // A client is eligible for the primary lease if:\n            // - its network is enabled and the client's tab is in the foreground.\n            // - its network is enabled and no other client's tab is in the\n            //   foreground.\n            // - every clients network is disabled and the client's tab is in the\n            //   foreground.\n            // - every clients network is disabled and no other client's tab is in\n            //   the foreground.\n            // - the `forceOwningTab` setting was passed in.\n            if (null !== e && this.pi(e.leaseTimestampMs, 5e3) && !this.Ei(e.ownerId)) {\n                if (this.mi(e) && this.networkEnabled) return !0;\n                if (!this.mi(e)) {\n                    if (!e.allowTabSynchronization) \n                    // Fail the `canActAsPrimary` check if the current leaseholder has\n                    // not opted into multi-tab synchronization. If this happens at\n                    // client startup, we reject the Promise returned by\n                    // `enablePersistence()` and the user can continue to use Firestore\n                    // with in-memory persistence.\n                    // If this fails during a lease refresh, we will instead block the\n                    // AsyncQueue from executing further operations. Note that this is\n                    // acceptable since mixing & matching different `synchronizeTabs`\n                    // settings is not supported.\n                    // TODO(b/114226234): Remove this check when `synchronizeTabs` can\n                    // no longer be turned off.\n                    throw new L(B.FAILED_PRECONDITION, No);\n                    return !1;\n                }\n            }\n            return !(!this.networkEnabled || !this.inForeground) || Mo(t).W().next((t => void 0 === this.Ii(t, 5e3).find((t => {\n                if (this.clientId !== t.clientId) {\n                    const e = !this.networkEnabled && t.networkEnabled, n = !this.inForeground && t.inForeground, s = this.networkEnabled === t.networkEnabled;\n                    if (e || n && s) return !0;\n                }\n                return !1;\n            }))));\n        })).next((t => (this.isPrimary !== t && C(\"IndexedDbPersistence\", `Client ${t ? \"is\" : \"is not\"} eligible for a primary lease.`), \n        t)));\n    }\n    async shutdown() {\n        // The shutdown() operations are idempotent and can be called even when\n        // start() aborted (e.g. because it couldn't acquire the persistence lease).\n        this.Ds = !1, this.Ai(), this.ei && (this.ei.cancel(), this.ei = null), this.Ri(), \n        this.bi(), \n        // Use `SimpleDb.runTransaction` directly to avoid failing if another tab\n        // has obtained the primary lease.\n        await this.ri.runTransaction(\"shutdown\", \"readwrite\", [ \"owner\", \"clientMetadata\" ], (t => {\n            const e = new Ki(t, Ot.at);\n            return this._i(e).next((() => this.gi(e)));\n        })), this.ri.close(), \n        // Remove the entry marking the client as zombied from LocalStorage since\n        // we successfully deleted its metadata from IndexedDb.\n        this.Pi();\n    }\n    /**\n     * Returns clients that are not zombied and have an updateTime within the\n     * provided threshold.\n     */    Ii(t, e) {\n        return t.filter((t => this.pi(t.updateTimeMs, e) && !this.Ei(t.clientId)));\n    }\n    /**\n     * Returns the IDs of the clients that are currently active. If multi-tab\n     * is not supported, returns an array that only contains the local client's\n     * ID.\n     *\n     * PORTING NOTE: This is only used for Web multi-tab.\n     */    vi() {\n        return this.runTransaction(\"getActiveClients\", \"readonly\", (t => Mo(t).W().next((t => this.Ii(t, 18e5).map((t => t.clientId))))));\n    }\n    get started() {\n        return this.Ds;\n    }\n    getMutationQueue(t, e) {\n        return jr.re(t, this.yt, e, this.referenceDelegate);\n    }\n    getTargetCache() {\n        return this.Cs;\n    }\n    getRemoteDocumentCache() {\n        return this.remoteDocumentCache;\n    }\n    getIndexManager(t) {\n        return new Mr(t, this.yt.ie.databaseId);\n    }\n    getDocumentOverlayCache(t) {\n        return lr.re(this.yt, t);\n    }\n    getBundleCache() {\n        return this.Ns;\n    }\n    runTransaction(t, e, n) {\n        C(\"IndexedDbPersistence\", \"Starting transaction:\", t);\n        const s = \"readonly\" === e ? \"readonly\" : \"readwrite\", i = 15 === (r = this.Xs) ? Ui : 14 === r ? qi : 13 === r ? Li : 12 === r ? Bi : 11 === r ? $i : void O();\n        /** Returns the object stores for the provided schema. */\n        var r;\n        let o;\n        // Do all transactions as readwrite against all object stores, since we\n        // are the only reader/writer.\n                return this.ri.runTransaction(t, s, i, (s => (o = new Ki(s, this.Ss ? this.Ss.next() : Ot.at), \n        \"readwrite-primary\" === e ? this.fi(o).next((t => !!t || this.di(o))).next((e => {\n            if (!e) throw x(`Failed to obtain primary lease for action '${t}'.`), this.isPrimary = !1, \n            this.Hs.enqueueRetryable((() => this.si(!1))), new L(B.FAILED_PRECONDITION, It);\n            return n(o);\n        })).next((t => this.wi(o).next((() => t)))) : this.Vi(o).next((() => n(o)))))).then((t => (o.raiseOnCommittedEvent(), \n        t)));\n    }\n    /**\n     * Verifies that the current tab is the primary leaseholder or alternatively\n     * that the leaseholder has opted into multi-tab synchronization.\n     */\n    // TODO(b/114226234): Remove this check when `synchronizeTabs` can no longer\n    // be turned off.\n    Vi(t) {\n        return Oo(t).get(\"owner\").next((t => {\n            if (null !== t && this.pi(t.leaseTimestampMs, 5e3) && !this.Ei(t.ownerId) && !this.mi(t) && !(this.Ys || this.allowTabSynchronization && t.allowTabSynchronization)) throw new L(B.FAILED_PRECONDITION, No);\n        }));\n    }\n    /**\n     * Obtains or extends the new primary lease for the local client. This\n     * method does not verify that the client is eligible for this lease.\n     */    wi(t) {\n        const e = {\n            ownerId: this.clientId,\n            allowTabSynchronization: this.allowTabSynchronization,\n            leaseTimestampMs: Date.now()\n        };\n        return Oo(t).put(\"owner\", e);\n    }\n    static C() {\n        return bt.C();\n    }\n    /** Checks the primary lease and removes it if we are the current primary. */    _i(t) {\n        const e = Oo(t);\n        return e.get(\"owner\").next((t => this.mi(t) ? (C(\"IndexedDbPersistence\", \"Releasing primary lease.\"), \n        e.delete(\"owner\")) : At.resolve()));\n    }\n    /** Verifies that `updateTimeMs` is within `maxAgeMs`. */    pi(t, e) {\n        const n = Date.now();\n        return !(t < n - e) && (!(t > n) || (x(`Detected an update time that is in the future: ${t} > ${n}`), \n        !1));\n    }\n    ci() {\n        null !== this.document && \"function\" == typeof this.document.addEventListener && (this.ti = () => {\n            this.Hs.enqueueAndForget((() => (this.inForeground = \"visible\" === this.document.visibilityState, \n            this.ui())));\n        }, this.document.addEventListener(\"visibilitychange\", this.ti), this.inForeground = \"visible\" === this.document.visibilityState);\n    }\n    Ri() {\n        this.ti && (this.document.removeEventListener(\"visibilitychange\", this.ti), this.ti = null);\n    }\n    /**\n     * Attaches a window.unload handler that will synchronously write our\n     * clientId to a \"zombie client id\" location in LocalStorage. This can be used\n     * by tabs trying to acquire the primary lease to determine that the lease\n     * is no longer valid even if the timestamp is recent. This is particularly\n     * important for the refresh case (so the tab correctly re-acquires the\n     * primary lease). LocalStorage is used for this rather than IndexedDb because\n     * it is a synchronous API and so can be used reliably from  an unload\n     * handler.\n     */    ai() {\n        var t;\n        \"function\" == typeof (null === (t = this.window) || void 0 === t ? void 0 : t.addEventListener) && (this.Zs = () => {\n            // Note: In theory, this should be scheduled on the AsyncQueue since it\n            // accesses internal state. We execute this code directly during shutdown\n            // to make sure it gets a chance to run.\n            this.Ai(), l() && navigator.appVersion.match(/Version\\/1[45]/) && \n            // On Safari 14 and 15, we do not run any cleanup actions as it might\n            // trigger a bug that prevents Safari from re-opening IndexedDB during\n            // the next page load.\n            // See https://bugs.webkit.org/show_bug.cgi?id=226547\n            this.Hs.enterRestrictedMode(/* purgeExistingTasks= */ !0), this.Hs.enqueueAndForget((() => this.shutdown()));\n        }, this.window.addEventListener(\"pagehide\", this.Zs));\n    }\n    bi() {\n        this.Zs && (this.window.removeEventListener(\"pagehide\", this.Zs), this.Zs = null);\n    }\n    /**\n     * Returns whether a client is \"zombied\" based on its LocalStorage entry.\n     * Clients become zombied when their tab closes without running all of the\n     * cleanup logic in `shutdown()`.\n     */    Ei(t) {\n        var e;\n        try {\n            const n = null !== (null === (e = this.oi) || void 0 === e ? void 0 : e.getItem(this.Ti(t)));\n            return C(\"IndexedDbPersistence\", `Client '${t}' ${n ? \"is\" : \"is not\"} zombied in LocalStorage`), \n            n;\n        } catch (t) {\n            // Gracefully handle if LocalStorage isn't working.\n            return x(\"IndexedDbPersistence\", \"Failed to get zombied client id.\", t), !1;\n        }\n    }\n    /**\n     * Record client as zombied (a client that had its tab closed). Zombied\n     * clients are ignored during primary tab selection.\n     */    Ai() {\n        if (this.oi) try {\n            this.oi.setItem(this.Ti(this.clientId), String(Date.now()));\n        } catch (t) {\n            // Gracefully handle if LocalStorage isn't available / working.\n            x(\"Failed to set zombie client id.\", t);\n        }\n    }\n    /** Removes the zombied client entry if it exists. */    Pi() {\n        if (this.oi) try {\n            this.oi.removeItem(this.Ti(this.clientId));\n        } catch (t) {\n            // Ignore\n        }\n    }\n    Ti(t) {\n        return `firestore_zombie_${this.persistenceKey}_${t}`;\n    }\n}\n\n/**\n * Helper to get a typed SimpleDbStore for the primary client object store.\n */ function Oo(t) {\n    return Gi(t, \"owner\");\n}\n\n/**\n * Helper to get a typed SimpleDbStore for the client metadata object store.\n */ function Mo(t) {\n    return Gi(t, \"clientMetadata\");\n}\n\n/**\n * Generates a string used as a prefix when storing data in IndexedDB and\n * LocalStorage.\n */ function Fo(t, e) {\n    // Use two different prefix formats:\n    //   * firestore / persistenceKey / projectID . databaseID / ...\n    //   * firestore / persistenceKey / projectID / ...\n    // projectIDs are DNS-compatible names and cannot contain dots\n    // so there's no danger of collisions.\n    let n = t.projectId;\n    return t.isDefaultDatabase || (n += \".\" + t.database), \"firestore/\" + 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 * A set of changes to what documents are currently in view and out of view for\n * a given query. These changes are sent to the LocalStore by the View (via\n * the SyncEngine) and are used to pin / unpin documents as appropriate.\n */\nclass $o {\n    constructor(t, e, n, s) {\n        this.targetId = t, this.fromCache = e, this.Si = n, this.Di = s;\n    }\n    static Ci(t, e) {\n        let n = Es(), s = Es();\n        for (const t of e.docChanges) switch (t.type) {\n          case 0 /* ChangeType.Added */ :\n            n = n.add(t.doc.key);\n            break;\n\n          case 1 /* ChangeType.Removed */ :\n            s = s.add(t.doc.key);\n // do nothing\n                }\n        return new $o(t, e.fromCache, n, s);\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/**\n * The Firestore query engine.\n *\n * Firestore queries can be executed in three modes. The Query Engine determines\n * what mode to use based on what data is persisted. The mode only determines\n * the runtime complexity of the query - the result set is equivalent across all\n * implementations.\n *\n * The Query engine will use indexed-based execution if a user has configured\n * any index that can be used to execute query (via `setIndexConfiguration()`).\n * Otherwise, the engine will try to optimize the query by re-using a previously\n * persisted query result. If that is not possible, the query will be executed\n * via a full collection scan.\n *\n * Index-based execution is the default when available. The query engine\n * supports partial indexed execution and merges the result from the index\n * lookup with documents that have not yet been indexed. The index evaluation\n * matches the backend's format and as such, the SDK can use indexing for all\n * queries that the backend supports.\n *\n * If no index exists, the query engine tries to take advantage of the target\n * document mapping in the TargetCache. These mappings exists for all queries\n * that have been synced with the backend at least once and allow the query\n * engine to only read documents that previously matched a query plus any\n * documents that were edited after the query was last listened to.\n *\n * There are some cases when this optimization is not guaranteed to produce\n * the same results as full collection scans. In these cases, query\n * processing falls back to full scans. These cases are:\n *\n * - Limit queries where a document that matched the query previously no longer\n *   matches the query.\n *\n * - Limit queries where a document edit may cause the document to sort below\n *   another document that is in the local cache.\n *\n * - Queries that have never been CURRENT or free of limbo documents.\n */ class Bo {\n    constructor() {\n        this.xi = !1;\n    }\n    /** Sets the document view to query against. */    initialize(t, e) {\n        this.Ni = t, this.indexManager = e, this.xi = !0;\n    }\n    /** Returns all local documents matching the specified query. */    getDocumentsMatchingQuery(t, e, n, s) {\n        return this.ki(t, e).next((i => i || this.Oi(t, e, s, n))).next((n => n || this.Mi(t, e)));\n    }\n    /**\n     * Performs an indexed query that evaluates the query based on a collection's\n     * persisted index values. Returns `null` if an index is not available.\n     */    ki(t, e) {\n        if (fn(e)) \n        // Queries that match all documents don't benefit from using\n        // key-based lookups. It is more efficient to scan all documents in a\n        // collection, rather than to perform individual lookups.\n        return At.resolve(null);\n        let n = gn(e);\n        return this.indexManager.getIndexType(t, n).next((s => 0 /* IndexType.NONE */ === s ? null : (null !== e.limit && 1 /* IndexType.PARTIAL */ === s && (\n        // We cannot apply a limit for targets that are served using a partial\n        // index. If a partial index will be used to serve the target, the\n        // query may return a superset of documents that match the target\n        // (e.g. if the index doesn't include all the target's filters), or\n        // may return the correct set of documents in the wrong order (e.g. if\n        // the index doesn't include a segment for one of the orderBys).\n        // Therefore, a limit should not be applied in such cases.\n        e = pn(e, null, \"F\" /* LimitType.First */), n = gn(e)), this.indexManager.getDocumentsMatchingTarget(t, n).next((s => {\n            const i = Es(...s);\n            return this.Ni.getDocuments(t, i).next((s => this.indexManager.getMinOffset(t, n).next((n => {\n                const r = this.Fi(e, s);\n                return this.$i(e, r, i, n.readTime) ? this.ki(t, pn(e, null, \"F\" /* LimitType.First */)) : this.Bi(t, r, e, n);\n            }))));\n        })))));\n    }\n    /**\n     * Performs a query based on the target's persisted query mapping. Returns\n     * `null` if the mapping is not available or cannot be used.\n     */    Oi(t, e, n, s) {\n        return fn(e) || s.isEqual(st.min()) ? this.Mi(t, e) : this.Ni.getDocuments(t, n).next((i => {\n            const r = this.Fi(e, i);\n            return this.$i(e, r, n, s) ? this.Mi(t, e) : (S() <= u.DEBUG && C(\"QueryEngine\", \"Re-using previous result from %s to execute query: %s\", s.toString(), En(e)), \n            this.Bi(t, r, e, mt(s, -1)));\n        }));\n        // Queries that have never seen a snapshot without limbo free documents\n        // should also be run as a full collection scan.\n        }\n    /** Applies the query filter and sorting to the provided documents.  */    Fi(t, e) {\n        // Sort the documents and re-apply the query filter since previously\n        // matching documents do not necessarily still match the query.\n        let n = new We(bn(t));\n        return e.forEach(((e, s) => {\n            An(t, s) && (n = n.add(s));\n        })), n;\n    }\n    /**\n     * Determines if a limit query needs to be refilled from cache, making it\n     * ineligible for index-free execution.\n     *\n     * @param query - The query.\n     * @param sortedPreviousResults - The documents that matched the query when it\n     * was last synchronized, sorted by the query's comparator.\n     * @param remoteKeys - The document keys that matched the query at the last\n     * snapshot.\n     * @param limboFreeSnapshotVersion - The version of the snapshot when the\n     * query was last synchronized.\n     */    $i(t, e, n, s) {\n        if (null === t.limit) \n        // Queries without limits do not need to be refilled.\n        return !1;\n        if (n.size !== e.size) \n        // The query needs to be refilled if a previously matching document no\n        // longer matches.\n        return !0;\n        // Limit queries are not eligible for index-free query execution if there is\n        // a potential that an older document from cache now sorts before a document\n        // that was previously part of the limit. This, however, can only happen if\n        // the document at the edge of the limit goes out of limit.\n        // If a document that is not the limit boundary sorts differently,\n        // the boundary of the limit itself did not change and documents from cache\n        // will continue to be \"rejected\" by this boundary. Therefore, we can ignore\n        // any modifications that don't affect the last document.\n                const i = \"F\" /* LimitType.First */ === t.limitType ? e.last() : e.first();\n        return !!i && (i.hasPendingWrites || i.version.compareTo(s) > 0);\n    }\n    Mi(t, e) {\n        return S() <= u.DEBUG && C(\"QueryEngine\", \"Using full collection scan to execute query:\", En(e)), \n        this.Ni.getDocumentsMatchingQuery(t, e, yt.min());\n    }\n    /**\n     * Combines the results from an indexed execution with the remaining documents\n     * that have not yet been indexed.\n     */    Bi(t, e, n, s) {\n        // Retrieve all results for documents that were updated since the offset.\n        return this.Ni.getDocumentsMatchingQuery(t, n, s).next((t => (\n        // Merge with existing results\n        e.forEach((e => {\n            t = t.insert(e.key, e);\n        })), t)));\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 * Implements `LocalStore` interface.\n *\n * Note: some field defined in this class might have public access level, but\n * the class is not exported so they are only accessible from this module.\n * This is useful to implement optional features (like bundles) in free\n * functions, such that they are tree-shakeable.\n */\nclass Lo {\n    constructor(\n    /** Manages our in-memory or durable persistence. */\n    t, e, n, s) {\n        this.persistence = t, this.Li = e, this.yt = s, \n        /**\n         * Maps a targetID to data about its target.\n         *\n         * PORTING NOTE: We are using an immutable data structure on Web to make re-runs\n         * of `applyRemoteEvent()` idempotent.\n         */\n        this.qi = new Ge(Z), \n        /** Maps a target to its targetID. */\n        // TODO(wuandy): Evaluate if TargetId can be part of Target.\n        this.Ui = new ls((t => nn(t)), sn), \n        /**\n         * A per collection group index of the last read time processed by\n         * `getNewDocumentChanges()`.\n         *\n         * PORTING NOTE: This is only used for multi-tab synchronization.\n         */\n        this.Ki = new Map, this.Gi = t.getRemoteDocumentCache(), this.Cs = t.getTargetCache(), \n        this.Ns = t.getBundleCache(), this.Qi(n);\n    }\n    Qi(t) {\n        // TODO(indexing): Add spec tests that test these components change after a\n        // user change\n        this.documentOverlayCache = this.persistence.getDocumentOverlayCache(t), this.indexManager = this.persistence.getIndexManager(t), \n        this.mutationQueue = this.persistence.getMutationQueue(t, this.indexManager), this.localDocuments = new po(this.Gi, this.mutationQueue, this.documentOverlayCache, this.indexManager), \n        this.Gi.setIndexManager(this.indexManager), this.Li.initialize(this.localDocuments, this.indexManager);\n    }\n    collectGarbage(t) {\n        return this.persistence.runTransaction(\"Collect garbage\", \"readwrite-primary\", (e => t.collect(e, this.qi)));\n    }\n}\n\nfunction qo(\n/** Manages our in-memory or durable persistence. */\nt, e, n, s) {\n    return new Lo(t, e, n, s);\n}\n\n/**\n * Tells the LocalStore that the currently authenticated user has changed.\n *\n * In response the local store switches the mutation queue to the new user and\n * returns any resulting document changes.\n */\n// PORTING NOTE: Android and iOS only return the documents affected by the\n// change.\nasync function Uo(t, e) {\n    const n = $(t);\n    return await n.persistence.runTransaction(\"Handle user change\", \"readonly\", (t => {\n        // Swap out the mutation queue, grabbing the pending mutation batches\n        // before and after.\n        let s;\n        return n.mutationQueue.getAllMutationBatches(t).next((i => (s = i, n.Qi(e), n.mutationQueue.getAllMutationBatches(t)))).next((e => {\n            const i = [], r = [];\n            // Union the old/new changed keys.\n            let o = Es();\n            for (const t of s) {\n                i.push(t.batchId);\n                for (const e of t.mutations) o = o.add(e.key);\n            }\n            for (const t of e) {\n                r.push(t.batchId);\n                for (const e of t.mutations) o = o.add(e.key);\n            }\n            // Return the set of all (potentially) changed documents and the list\n            // of mutation batch IDs that were affected by change.\n                        return n.localDocuments.getDocuments(t, o).next((t => ({\n                ji: t,\n                removedBatchIds: i,\n                addedBatchIds: r\n            })));\n        }));\n    }));\n}\n\n/* Accepts locally generated Mutations and commit them to storage. */\n/**\n * Acknowledges the given batch.\n *\n * On the happy path when a batch is acknowledged, the local store will\n *\n *  + remove the batch from the mutation queue;\n *  + apply the changes to the remote document cache;\n *  + recalculate the latency compensated view implied by those changes (there\n *    may be mutations in the queue that affect the documents but haven't been\n *    acknowledged yet); and\n *  + give the changed documents back the sync engine\n *\n * @returns The resulting (modified) documents.\n */\nfunction Ko(t, e) {\n    const n = $(t);\n    return n.persistence.runTransaction(\"Acknowledge batch\", \"readwrite-primary\", (t => {\n        const s = e.batch.keys(), i = n.Gi.newChangeBuffer({\n            trackRemovals: !0\n        });\n        return function(t, e, n, s) {\n            const i = n.batch, r = i.keys();\n            let o = At.resolve();\n            return r.forEach((t => {\n                o = o.next((() => s.getEntry(e, t))).next((e => {\n                    const r = n.docVersions.get(t);\n                    M(null !== r), e.version.compareTo(r) < 0 && (i.applyToRemoteDocument(e, n), e.isValidDocument() && (\n                    // We use the commitVersion as the readTime rather than the\n                    // document's updateTime since the updateTime is not advanced\n                    // for updates that do not modify the underlying document.\n                    e.setReadTime(n.commitVersion), s.addEntry(e)));\n                }));\n            })), o.next((() => t.mutationQueue.removeMutationBatch(e, i)));\n        }\n        /** Returns the local view of the documents affected by a mutation batch. */\n        // PORTING NOTE: Multi-Tab only.\n        (n, t, e, i).next((() => i.apply(t))).next((() => n.mutationQueue.performConsistencyCheck(t))).next((() => n.documentOverlayCache.removeOverlaysForBatchId(t, s, e.batch.batchId))).next((() => n.localDocuments.recalculateAndSaveOverlaysForDocumentKeys(t, function(t) {\n            let e = Es();\n            for (let n = 0; n < t.mutationResults.length; ++n) {\n                t.mutationResults[n].transformResults.length > 0 && (e = e.add(t.batch.mutations[n].key));\n            }\n            return e;\n        }\n        /**\n * Removes mutations from the MutationQueue for the specified batch;\n * LocalDocuments will be recalculated.\n *\n * @returns The resulting modified documents.\n */ (e)))).next((() => n.localDocuments.getDocuments(t, s)));\n    }));\n}\n\n/**\n * Returns the last consistent snapshot processed (used by the RemoteStore to\n * determine whether to buffer incoming snapshots from the backend).\n */\nfunction Go(t) {\n    const e = $(t);\n    return e.persistence.runTransaction(\"Get last remote snapshot version\", \"readonly\", (t => e.Cs.getLastRemoteSnapshotVersion(t)));\n}\n\n/**\n * Updates the \"ground-state\" (remote) documents. We assume that the remote\n * event reflects any write batches that have been acknowledged or rejected\n * (i.e. we do not re-apply local mutations to updates from this event).\n *\n * LocalDocuments are re-calculated if there are remaining mutations in the\n * queue.\n */ function Qo(t, e) {\n    const n = $(t), s = e.snapshotVersion;\n    let i = n.qi;\n    return n.persistence.runTransaction(\"Apply remote event\", \"readwrite-primary\", (t => {\n        const r = n.Gi.newChangeBuffer({\n            trackRemovals: !0\n        });\n        // Reset newTargetDataByTargetMap in case this transaction gets re-run.\n                i = n.qi;\n        const o = [];\n        e.targetChanges.forEach(((r, u) => {\n            const c = i.get(u);\n            if (!c) return;\n            // Only update the remote keys if the target is still active. This\n            // ensures that we can persist the updated target data along with\n            // the updated assignment.\n                        o.push(n.Cs.removeMatchingKeys(t, r.removedDocuments, u).next((() => n.Cs.addMatchingKeys(t, r.addedDocuments, u))));\n            let a = c.withSequenceNumber(t.currentSequenceNumber);\n            e.targetMismatches.has(u) ? a = a.withResumeToken(Qt.EMPTY_BYTE_STRING, st.min()).withLastLimboFreeSnapshotVersion(st.min()) : r.resumeToken.approximateByteSize() > 0 && (a = a.withResumeToken(r.resumeToken, s)), \n            i = i.insert(u, a), \n            // Update the target data if there are target changes (or if\n            // sufficient time has passed since the last update).\n            /**\n * Returns true if the newTargetData should be persisted during an update of\n * an active target. TargetData should always be persisted when a target is\n * being released and should not call this function.\n *\n * While the target is active, TargetData updates can be omitted when nothing\n * about the target has changed except metadata like the resume token or\n * snapshot version. Occasionally it's worth the extra write to prevent these\n * values from getting too stale after a crash, but this doesn't have to be\n * too frequent.\n */\n            function(t, e, n) {\n                // Always persist target data if we don't already have a resume token.\n                if (0 === t.resumeToken.approximateByteSize()) return !0;\n                // Don't allow resume token changes to be buffered indefinitely. This\n                // allows us to be reasonably up-to-date after a crash and avoids needing\n                // to loop over all active queries on shutdown. Especially in the browser\n                // we may not get time to do anything interesting while the current tab is\n                // closing.\n                                if (e.snapshotVersion.toMicroseconds() - t.snapshotVersion.toMicroseconds() >= 3e8) return !0;\n                // Otherwise if the only thing that has changed about a target is its resume\n                // token it's not worth persisting. Note that the RemoteStore keeps an\n                // in-memory view of the currently active targets which includes the current\n                // resume token, so stream failure or user changes will still use an\n                // up-to-date resume token regardless of what we do here.\n                                return n.addedDocuments.size + n.modifiedDocuments.size + n.removedDocuments.size > 0;\n            }\n            /**\n * Notifies local store of the changed views to locally pin documents.\n */ (c, a, r) && o.push(n.Cs.updateTargetData(t, a));\n        }));\n        let u = ds(), c = Es();\n        // HACK: The only reason we allow a null snapshot version is so that we\n        // can synthesize remote events when we get permission denied errors while\n        // trying to resolve the state of a locally cached document that is in\n        // limbo.\n        if (e.documentUpdates.forEach((s => {\n            e.resolvedLimboDocuments.has(s) && o.push(n.persistence.referenceDelegate.updateLimboDocument(t, s));\n        })), \n        // Each loop iteration only affects its \"own\" doc, so it's safe to get all\n        // the remote documents in advance in a single call.\n        o.push(jo(t, r, e.documentUpdates).next((t => {\n            u = t.Wi, c = t.zi;\n        }))), !s.isEqual(st.min())) {\n            const e = n.Cs.getLastRemoteSnapshotVersion(t).next((e => n.Cs.setTargetsMetadata(t, t.currentSequenceNumber, s)));\n            o.push(e);\n        }\n        return At.waitFor(o).next((() => r.apply(t))).next((() => n.localDocuments.getLocalViewOfDocuments(t, u, c))).next((() => u));\n    })).then((t => (n.qi = i, t)));\n}\n\n/**\n * Populates document change buffer with documents from backend or a bundle.\n * Returns the document changes resulting from applying those documents, and\n * also a set of documents whose existence state are changed as a result.\n *\n * @param txn - Transaction to use to read existing documents from storage.\n * @param documentBuffer - Document buffer to collect the resulted changes to be\n *        applied to storage.\n * @param documents - Documents to be applied.\n */ function jo(t, e, n) {\n    let s = Es(), i = Es();\n    return n.forEach((t => s = s.add(t))), e.getEntries(t, s).next((t => {\n        let s = ds();\n        return n.forEach(((n, r) => {\n            const o = t.get(n);\n            // Check if see if there is a existence state change for this document.\n                        r.isFoundDocument() !== o.isFoundDocument() && (i = i.add(n)), \n            // Note: The order of the steps below is important, since we want\n            // to ensure that rejected limbo resolutions (which fabricate\n            // NoDocuments with SnapshotVersion.min()) never add documents to\n            // cache.\n            r.isNoDocument() && r.version.isEqual(st.min()) ? (\n            // NoDocuments with SnapshotVersion.min() are used in manufactured\n            // events. We remove these documents from cache since we lost\n            // access.\n            e.removeEntry(n, r.readTime), s = s.insert(n, r)) : !o.isValidDocument() || r.version.compareTo(o.version) > 0 || 0 === r.version.compareTo(o.version) && o.hasPendingWrites ? (e.addEntry(r), \n            s = s.insert(n, r)) : C(\"LocalStore\", \"Ignoring outdated watch update for \", n, \". Current version:\", o.version, \" Watch version:\", r.version);\n        })), {\n            Wi: s,\n            zi: i\n        };\n    }));\n}\n\n/**\n * Gets the mutation batch after the passed in batchId in the mutation queue\n * or null if empty.\n * @param afterBatchId - If provided, the batch to search after.\n * @returns The next mutation or null if there wasn't one.\n */\nfunction Wo(t, e) {\n    const n = $(t);\n    return n.persistence.runTransaction(\"Get next mutation batch\", \"readonly\", (t => (void 0 === e && (e = -1), \n    n.mutationQueue.getNextMutationBatchAfterBatchId(t, e))));\n}\n\n/**\n * Reads the current value of a Document with a given key or null if not\n * found - used for testing.\n */\n/**\n * Assigns the given target an internal ID so that its results can be pinned so\n * they don't get GC'd. A target must be allocated in the local store before\n * the store can be used to manage its view.\n *\n * Allocating an already allocated `Target` will return the existing `TargetData`\n * for that `Target`.\n */\nfunction zo(t, e) {\n    const n = $(t);\n    return n.persistence.runTransaction(\"Allocate target\", \"readwrite\", (t => {\n        let s;\n        return n.Cs.getTargetData(t, e).next((i => i ? (\n        // This target has been listened to previously, so reuse the\n        // previous targetID.\n        // TODO(mcg): freshen last accessed date?\n        s = i, At.resolve(s)) : n.Cs.allocateTargetId(t).next((i => (s = new zi(e, i, 0 /* TargetPurpose.Listen */ , t.currentSequenceNumber), \n        n.Cs.addTargetData(t, s).next((() => s)))))));\n    })).then((t => {\n        // If Multi-Tab is enabled, the existing target data may be newer than\n        // the in-memory data\n        const s = n.qi.get(t.targetId);\n        return (null === s || t.snapshotVersion.compareTo(s.snapshotVersion) > 0) && (n.qi = n.qi.insert(t.targetId, t), \n        n.Ui.set(e, t.targetId)), t;\n    }));\n}\n\n/**\n * Returns the TargetData as seen by the LocalStore, including updates that may\n * have not yet been persisted to the TargetCache.\n */\n// Visible for testing.\n/**\n * Unpins all the documents associated with the given target. If\n * `keepPersistedTargetData` is set to false and Eager GC enabled, the method\n * directly removes the associated target data from the target cache.\n *\n * Releasing a non-existing `Target` is a no-op.\n */\n// PORTING NOTE: `keepPersistedTargetData` is multi-tab only.\nasync function Ho(t, e, n) {\n    const s = $(t), i = s.qi.get(e), r = n ? \"readwrite\" : \"readwrite-primary\";\n    try {\n        n || await s.persistence.runTransaction(\"Release target\", r, (t => s.persistence.referenceDelegate.removeTarget(t, i)));\n    } catch (t) {\n        if (!Vt(t)) throw t;\n        // All `releaseTarget` does is record the final metadata state for the\n        // target, but we've been recording this periodically during target\n        // activity. If we lose this write this could cause a very slight\n        // difference in the order of target deletion during GC, but we\n        // don't define exact LRU semantics so this is acceptable.\n        C(\"LocalStore\", `Failed to update sequence numbers for target ${e}: ${t}`);\n    }\n    s.qi = s.qi.remove(e), s.Ui.delete(i.target);\n}\n\n/**\n * Runs the specified query against the local store and returns the results,\n * potentially taking advantage of query data from previous executions (such\n * as the set of remote keys).\n *\n * @param usePreviousResults - Whether results from previous executions can\n * be used to optimize this query execution.\n */ function Jo(t, e, n) {\n    const s = $(t);\n    let i = st.min(), r = Es();\n    return s.persistence.runTransaction(\"Execute query\", \"readonly\", (t => function(t, e, n) {\n        const s = $(t), i = s.Ui.get(n);\n        return void 0 !== i ? At.resolve(s.qi.get(i)) : s.Cs.getTargetData(e, n);\n    }(s, t, gn(e)).next((e => {\n        if (e) return i = e.lastLimboFreeSnapshotVersion, s.Cs.getMatchingKeysForTargetId(t, e.targetId).next((t => {\n            r = t;\n        }));\n    })).next((() => s.Li.getDocumentsMatchingQuery(t, e, n ? i : st.min(), n ? r : Es()))).next((t => (Zo(s, Rn(e), t), \n    {\n        documents: t,\n        Hi: r\n    })))));\n}\n\n// PORTING NOTE: Multi-Tab only.\nfunction Yo(t, e) {\n    const n = $(t), s = $(n.Cs), i = n.qi.get(e);\n    return i ? Promise.resolve(i.target) : n.persistence.runTransaction(\"Get target data\", \"readonly\", (t => s.ne(t, e).next((t => t ? t.target : null))));\n}\n\n/**\n * Returns the set of documents that have been updated since the last call.\n * If this is the first call, returns the set of changes since client\n * initialization. Further invocations will return document that have changed\n * since the prior call.\n */\n// PORTING NOTE: Multi-Tab only.\nfunction Xo(t, e) {\n    const n = $(t), s = n.Ki.get(e) || st.min();\n    // Get the current maximum read time for the collection. This should always\n    // exist, but to reduce the chance for regressions we default to\n    // SnapshotVersion.Min()\n    // TODO(indexing): Consider removing the default value.\n        return n.persistence.runTransaction(\"Get new document changes\", \"readonly\", (t => n.Gi.getAllFromCollectionGroup(t, e, mt(s, -1), \n    /* limit= */ Number.MAX_SAFE_INTEGER))).then((t => (Zo(n, e, t), t)));\n}\n\n/** Sets the collection group's maximum read time from the given documents. */\n// PORTING NOTE: Multi-Tab only.\nfunction Zo(t, e, n) {\n    let s = t.Ki.get(e) || st.min();\n    n.forEach(((t, e) => {\n        e.readTime.compareTo(s) > 0 && (s = e.readTime);\n    })), t.Ki.set(e, s);\n}\n\n/**\n * Creates a new target using the given bundle name, which will be used to\n * hold the keys of all documents from the bundle in query-document mappings.\n * This ensures that the loaded documents do not get garbage collected\n * right away.\n */\n/**\n * Applies the documents from a bundle to the \"ground-state\" (remote)\n * documents.\n *\n * LocalDocuments are re-calculated if there are remaining mutations in the\n * queue.\n */\nasync function tu(t, e, n, s) {\n    const i = $(t);\n    let r = Es(), o = ds();\n    for (const t of n) {\n        const n = e.Ji(t.metadata.name);\n        t.document && (r = r.add(n));\n        const s = e.Yi(t);\n        s.setReadTime(e.Xi(t.metadata.readTime)), o = o.insert(n, s);\n    }\n    const u = i.Gi.newChangeBuffer({\n        trackRemovals: !0\n    }), c = await zo(i, function(t) {\n        // It is OK that the path used for the query is not valid, because this will\n        // not be read and queried.\n        return gn(ln(rt.fromString(`__bundle__/docs/${t}`)));\n    }(s));\n    // Allocates a target to hold all document keys from the bundle, such that\n    // they will not get garbage collected right away.\n        return i.persistence.runTransaction(\"Apply bundle documents\", \"readwrite\", (t => jo(t, u, o).next((e => (u.apply(t), \n    e))).next((e => i.Cs.removeMatchingKeysForTargetId(t, c.targetId).next((() => i.Cs.addMatchingKeys(t, r, c.targetId))).next((() => i.localDocuments.getLocalViewOfDocuments(t, e.Wi, e.zi))).next((() => e.Wi))))));\n}\n\n/**\n * Returns a promise of a boolean to indicate if the given bundle has already\n * been loaded and the create time is newer than the current loading bundle.\n */\n/**\n * Saves the given `NamedQuery` to local persistence.\n */\nasync function eu(t, e, n = Es()) {\n    // Allocate a target for the named query such that it can be resumed\n    // from associated read time if users use it to listen.\n    // NOTE: this also means if no corresponding target exists, the new target\n    // will remain active and will not get collected, unless users happen to\n    // unlisten the query somehow.\n    const s = await zo(t, gn(ir(e.bundledQuery))), i = $(t);\n    return i.persistence.runTransaction(\"Save named query\", \"readwrite\", (t => {\n        const r = qs(e.readTime);\n        // Simply save the query itself if it is older than what the SDK already\n        // has.\n                if (s.snapshotVersion.compareTo(r) >= 0) return i.Ns.saveNamedQuery(t, e);\n        // Update existing target data because the query from the bundle is newer.\n                const o = s.withResumeToken(Qt.EMPTY_BYTE_STRING, r);\n        return i.qi = i.qi.insert(o.targetId, o), i.Cs.updateTargetData(t, o).next((() => i.Cs.removeMatchingKeysForTargetId(t, s.targetId))).next((() => i.Cs.addMatchingKeys(t, n, s.targetId))).next((() => i.Ns.saveNamedQuery(t, e)));\n    }));\n}\n\n/** Assembles the key for a client state in WebStorage */\nfunction nu(t, e) {\n    return `firestore_clients_${t}_${e}`;\n}\n\n// The format of the WebStorage key that stores the mutation state is:\n//     firestore_mutations_<persistence_prefix>_<batch_id>\n//     (for unauthenticated users)\n// or: firestore_mutations_<persistence_prefix>_<batch_id>_<user_uid>\n\n// 'user_uid' is last to avoid needing to escape '_' characters that it might\n// contain.\n/** Assembles the key for a mutation batch in WebStorage */\nfunction su(t, e, n) {\n    let s = `firestore_mutations_${t}_${n}`;\n    return e.isAuthenticated() && (s += `_${e.uid}`), s;\n}\n\n// The format of the WebStorage key that stores a query target's metadata is:\n//     firestore_targets_<persistence_prefix>_<target_id>\n/** Assembles the key for a query state in WebStorage */\nfunction iu(t, e) {\n    return `firestore_targets_${t}_${e}`;\n}\n\n// The WebStorage prefix that stores the primary tab's online state. The\n// format of the key is:\n//     firestore_online_state_<persistence_prefix>\n/**\n * Holds the state of a mutation batch, including its user ID, batch ID and\n * whether the batch is 'pending', 'acknowledged' or 'rejected'.\n */\n// Visible for testing\nclass ru {\n    constructor(t, e, n, s) {\n        this.user = t, this.batchId = e, this.state = n, this.error = s;\n    }\n    /**\n     * Parses a MutationMetadata from its JSON representation in WebStorage.\n     * Logs a warning and returns null if the format of the data is not valid.\n     */    static Zi(t, e, n) {\n        const s = JSON.parse(n);\n        let i, r = \"object\" == typeof s && -1 !== [ \"pending\", \"acknowledged\", \"rejected\" ].indexOf(s.state) && (void 0 === s.error || \"object\" == typeof s.error);\n        return r && s.error && (r = \"string\" == typeof s.error.message && \"string\" == typeof s.error.code, \n        r && (i = new L(s.error.code, s.error.message))), r ? new ru(t, e, s.state, i) : (x(\"SharedClientState\", `Failed to parse mutation state for ID '${e}': ${n}`), \n        null);\n    }\n    tr() {\n        const t = {\n            state: this.state,\n            updateTimeMs: Date.now()\n        };\n        return this.error && (t.error = {\n            code: this.error.code,\n            message: this.error.message\n        }), JSON.stringify(t);\n    }\n}\n\n/**\n * Holds the state of a query target, including its target ID and whether the\n * target is 'not-current', 'current' or 'rejected'.\n */\n// Visible for testing\nclass ou {\n    constructor(t, e, n) {\n        this.targetId = t, this.state = e, this.error = n;\n    }\n    /**\n     * Parses a QueryTargetMetadata from its JSON representation in WebStorage.\n     * Logs a warning and returns null if the format of the data is not valid.\n     */    static Zi(t, e) {\n        const n = JSON.parse(e);\n        let s, i = \"object\" == typeof n && -1 !== [ \"not-current\", \"current\", \"rejected\" ].indexOf(n.state) && (void 0 === n.error || \"object\" == typeof n.error);\n        return i && n.error && (i = \"string\" == typeof n.error.message && \"string\" == typeof n.error.code, \n        i && (s = new L(n.error.code, n.error.message))), i ? new ou(t, n.state, s) : (x(\"SharedClientState\", `Failed to parse target state for ID '${t}': ${e}`), \n        null);\n    }\n    tr() {\n        const t = {\n            state: this.state,\n            updateTimeMs: Date.now()\n        };\n        return this.error && (t.error = {\n            code: this.error.code,\n            message: this.error.message\n        }), JSON.stringify(t);\n    }\n}\n\n/**\n * This class represents the immutable ClientState for a client read from\n * WebStorage, containing the list of active query targets.\n */ class uu {\n    constructor(t, e) {\n        this.clientId = t, this.activeTargetIds = e;\n    }\n    /**\n     * Parses a RemoteClientState from the JSON representation in WebStorage.\n     * Logs a warning and returns null if the format of the data is not valid.\n     */    static Zi(t, e) {\n        const n = JSON.parse(e);\n        let s = \"object\" == typeof n && n.activeTargetIds instanceof Array, i = Rs();\n        for (let t = 0; s && t < n.activeTargetIds.length; ++t) s = Kt(n.activeTargetIds[t]), \n        i = i.add(n.activeTargetIds[t]);\n        return s ? new uu(t, i) : (x(\"SharedClientState\", `Failed to parse client data for instance '${t}': ${e}`), \n        null);\n    }\n}\n\n/**\n * This class represents the online state for all clients participating in\n * multi-tab. The online state is only written to by the primary client, and\n * used in secondary clients to update their query views.\n */ class cu {\n    constructor(t, e) {\n        this.clientId = t, this.onlineState = e;\n    }\n    /**\n     * Parses a SharedOnlineState from its JSON representation in WebStorage.\n     * Logs a warning and returns null if the format of the data is not valid.\n     */    static Zi(t) {\n        const e = JSON.parse(t);\n        return \"object\" == typeof e && -1 !== [ \"Unknown\", \"Online\", \"Offline\" ].indexOf(e.onlineState) && \"string\" == typeof e.clientId ? new cu(e.clientId, e.onlineState) : (x(\"SharedClientState\", `Failed to parse online state: ${t}`), \n        null);\n    }\n}\n\n/**\n * Metadata state of the local client. Unlike `RemoteClientState`, this class is\n * mutable and keeps track of all pending mutations, which allows us to\n * update the range of pending mutation batch IDs as new mutations are added or\n * removed.\n *\n * The data in `LocalClientState` is not read from WebStorage and instead\n * updated via its instance methods. The updated state can be serialized via\n * `toWebStorageJSON()`.\n */\n// Visible for testing.\nclass au {\n    constructor() {\n        this.activeTargetIds = Rs();\n    }\n    er(t) {\n        this.activeTargetIds = this.activeTargetIds.add(t);\n    }\n    nr(t) {\n        this.activeTargetIds = this.activeTargetIds.delete(t);\n    }\n    /**\n     * Converts this entry into a JSON-encoded format we can use for WebStorage.\n     * Does not encode `clientId` as it is part of the key in WebStorage.\n     */    tr() {\n        const t = {\n            activeTargetIds: this.activeTargetIds.toArray(),\n            updateTimeMs: Date.now()\n        };\n        return JSON.stringify(t);\n    }\n}\n\n/**\n * `WebStorageSharedClientState` uses WebStorage (window.localStorage) as the\n * backing store for the SharedClientState. It keeps track of all active\n * clients and supports modifications of the local client's data.\n */ class hu {\n    constructor(t, e, n, s, i) {\n        this.window = t, this.Hs = e, this.persistenceKey = n, this.sr = s, this.syncEngine = null, \n        this.onlineStateHandler = null, this.sequenceNumberHandler = null, this.ir = this.rr.bind(this), \n        this.ur = new Ge(Z), this.started = !1, \n        /**\n         * Captures WebStorage events that occur before `start()` is called. These\n         * events are replayed once `WebStorageSharedClientState` is started.\n         */\n        this.cr = [];\n        // Escape the special characters mentioned here:\n        // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Regular_Expressions\n        const r = n.replace(/[.*+?^${}()|[\\]\\\\]/g, \"\\\\$&\");\n        this.storage = this.window.localStorage, this.currentUser = i, this.ar = nu(this.persistenceKey, this.sr), \n        this.hr = \n        /** Assembles the key for the current sequence number. */\n        function(t) {\n            return `firestore_sequence_number_${t}`;\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 */ (this.persistenceKey), this.ur = this.ur.insert(this.sr, new au), this.lr = new RegExp(`^firestore_clients_${r}_([^_]*)$`), \n        this.dr = new RegExp(`^firestore_mutations_${r}_(\\\\d+)(?:_(.*))?$`), this._r = new RegExp(`^firestore_targets_${r}_(\\\\d+)$`), \n        this.wr = \n        /** Assembles the key for the online state of the primary tab. */\n        function(t) {\n            return `firestore_online_state_${t}`;\n        }\n        // The WebStorage prefix that plays as a event to indicate the remote documents\n        // might have changed due to some secondary tabs loading a bundle.\n        // format of the key is:\n        //     firestore_bundle_loaded_v2_<persistenceKey>\n        // The version ending with \"v2\" stores the list of modified collection groups.\n        (this.persistenceKey), this.mr = function(t) {\n            return `firestore_bundle_loaded_v2_${t}`;\n        }\n        // The WebStorage key prefix for the key that stores the last sequence number allocated. The key\n        // looks like 'firestore_sequence_number_<persistence_prefix>'.\n        (this.persistenceKey), \n        // Rather than adding the storage observer during start(), we add the\n        // storage observer during initialization. This ensures that we collect\n        // events before other components populate their initial state (during their\n        // respective start() calls). Otherwise, we might for example miss a\n        // mutation that is added after LocalStore's start() processed the existing\n        // mutations but before we observe WebStorage events.\n        this.window.addEventListener(\"storage\", this.ir);\n    }\n    /** Returns 'true' if WebStorage is available in the current environment. */    static C(t) {\n        return !(!t || !t.localStorage);\n    }\n    async start() {\n        // Retrieve the list of existing clients to backfill the data in\n        // SharedClientState.\n        const t = await this.syncEngine.vi();\n        for (const e of t) {\n            if (e === this.sr) continue;\n            const t = this.getItem(nu(this.persistenceKey, e));\n            if (t) {\n                const n = uu.Zi(e, t);\n                n && (this.ur = this.ur.insert(n.clientId, n));\n            }\n        }\n        this.gr();\n        // Check if there is an existing online state and call the callback handler\n        // if applicable.\n        const e = this.storage.getItem(this.wr);\n        if (e) {\n            const t = this.yr(e);\n            t && this.pr(t);\n        }\n        for (const t of this.cr) this.rr(t);\n        this.cr = [], \n        // Register a window unload hook to remove the client metadata entry from\n        // WebStorage even if `shutdown()` was not called.\n        this.window.addEventListener(\"pagehide\", (() => this.shutdown())), this.started = !0;\n    }\n    writeSequenceNumber(t) {\n        this.setItem(this.hr, JSON.stringify(t));\n    }\n    getAllActiveQueryTargets() {\n        return this.Ir(this.ur);\n    }\n    isActiveQueryTarget(t) {\n        let e = !1;\n        return this.ur.forEach(((n, s) => {\n            s.activeTargetIds.has(t) && (e = !0);\n        })), e;\n    }\n    addPendingMutation(t) {\n        this.Tr(t, \"pending\");\n    }\n    updateMutationState(t, e, n) {\n        this.Tr(t, e, n), \n        // Once a final mutation result is observed by other clients, they no longer\n        // access the mutation's metadata entry. Since WebStorage replays events\n        // in order, it is safe to delete the entry right after updating it.\n        this.Er(t);\n    }\n    addLocalQueryTarget(t) {\n        let e = \"not-current\";\n        // Lookup an existing query state if the target ID was already registered\n        // by another tab\n                if (this.isActiveQueryTarget(t)) {\n            const n = this.storage.getItem(iu(this.persistenceKey, t));\n            if (n) {\n                const s = ou.Zi(t, n);\n                s && (e = s.state);\n            }\n        }\n        return this.Ar.er(t), this.gr(), e;\n    }\n    removeLocalQueryTarget(t) {\n        this.Ar.nr(t), this.gr();\n    }\n    isLocalQueryTarget(t) {\n        return this.Ar.activeTargetIds.has(t);\n    }\n    clearQueryState(t) {\n        this.removeItem(iu(this.persistenceKey, t));\n    }\n    updateQueryState(t, e, n) {\n        this.Rr(t, e, n);\n    }\n    handleUserChange(t, e, n) {\n        e.forEach((t => {\n            this.Er(t);\n        })), this.currentUser = t, n.forEach((t => {\n            this.addPendingMutation(t);\n        }));\n    }\n    setOnlineState(t) {\n        this.br(t);\n    }\n    notifyBundleLoaded(t) {\n        this.Pr(t);\n    }\n    shutdown() {\n        this.started && (this.window.removeEventListener(\"storage\", this.ir), this.removeItem(this.ar), \n        this.started = !1);\n    }\n    getItem(t) {\n        const e = this.storage.getItem(t);\n        return C(\"SharedClientState\", \"READ\", t, e), e;\n    }\n    setItem(t, e) {\n        C(\"SharedClientState\", \"SET\", t, e), this.storage.setItem(t, e);\n    }\n    removeItem(t) {\n        C(\"SharedClientState\", \"REMOVE\", t), this.storage.removeItem(t);\n    }\n    rr(t) {\n        // Note: The function is typed to take Event to be interface-compatible with\n        // `Window.addEventListener`.\n        const e = t;\n        if (e.storageArea === this.storage) {\n            if (C(\"SharedClientState\", \"EVENT\", e.key, e.newValue), e.key === this.ar) return void x(\"Received WebStorage notification for local change. Another client might have garbage-collected our state\");\n            this.Hs.enqueueRetryable((async () => {\n                if (this.started) {\n                    if (null !== e.key) if (this.lr.test(e.key)) {\n                        if (null == e.newValue) {\n                            const t = this.vr(e.key);\n                            return this.Vr(t, null);\n                        }\n                        {\n                            const t = this.Sr(e.key, e.newValue);\n                            if (t) return this.Vr(t.clientId, t);\n                        }\n                    } else if (this.dr.test(e.key)) {\n                        if (null !== e.newValue) {\n                            const t = this.Dr(e.key, e.newValue);\n                            if (t) return this.Cr(t);\n                        }\n                    } else if (this._r.test(e.key)) {\n                        if (null !== e.newValue) {\n                            const t = this.Nr(e.key, e.newValue);\n                            if (t) return this.kr(t);\n                        }\n                    } else if (e.key === this.wr) {\n                        if (null !== e.newValue) {\n                            const t = this.yr(e.newValue);\n                            if (t) return this.pr(t);\n                        }\n                    } else if (e.key === this.hr) {\n                        const t = function(t) {\n                            let e = Ot.at;\n                            if (null != t) try {\n                                const n = JSON.parse(t);\n                                M(\"number\" == typeof n), e = n;\n                            } catch (t) {\n                                x(\"SharedClientState\", \"Failed to read sequence number from WebStorage\", t);\n                            }\n                            return e;\n                        }\n                        /**\n * `MemorySharedClientState` is a simple implementation of SharedClientState for\n * clients using memory persistence. The state in this class remains fully\n * isolated and no synchronization is performed.\n */ (e.newValue);\n                        t !== Ot.at && this.sequenceNumberHandler(t);\n                    } else if (e.key === this.mr) {\n                        const t = this.Or(e.newValue);\n                        await Promise.all(t.map((t => this.syncEngine.Mr(t))));\n                    }\n                } else this.cr.push(e);\n            }));\n        }\n    }\n    get Ar() {\n        return this.ur.get(this.sr);\n    }\n    gr() {\n        this.setItem(this.ar, this.Ar.tr());\n    }\n    Tr(t, e, n) {\n        const s = new ru(this.currentUser, t, e, n), i = su(this.persistenceKey, this.currentUser, t);\n        this.setItem(i, s.tr());\n    }\n    Er(t) {\n        const e = su(this.persistenceKey, this.currentUser, t);\n        this.removeItem(e);\n    }\n    br(t) {\n        const e = {\n            clientId: this.sr,\n            onlineState: t\n        };\n        this.storage.setItem(this.wr, JSON.stringify(e));\n    }\n    Rr(t, e, n) {\n        const s = iu(this.persistenceKey, t), i = new ou(t, e, n);\n        this.setItem(s, i.tr());\n    }\n    Pr(t) {\n        const e = JSON.stringify(Array.from(t));\n        this.setItem(this.mr, e);\n    }\n    /**\n     * Parses a client state key in WebStorage. Returns null if the key does not\n     * match the expected key format.\n     */    vr(t) {\n        const e = this.lr.exec(t);\n        return e ? e[1] : null;\n    }\n    /**\n     * Parses a client state in WebStorage. Returns 'null' if the value could not\n     * be parsed.\n     */    Sr(t, e) {\n        const n = this.vr(t);\n        return uu.Zi(n, e);\n    }\n    /**\n     * Parses a mutation batch state in WebStorage. Returns 'null' if the value\n     * could not be parsed.\n     */    Dr(t, e) {\n        const n = this.dr.exec(t), s = Number(n[1]), i = void 0 !== n[2] ? n[2] : null;\n        return ru.Zi(new P(i), s, e);\n    }\n    /**\n     * Parses a query target state from WebStorage. Returns 'null' if the value\n     * could not be parsed.\n     */    Nr(t, e) {\n        const n = this._r.exec(t), s = Number(n[1]);\n        return ou.Zi(s, e);\n    }\n    /**\n     * Parses an online state from WebStorage. Returns 'null' if the value\n     * could not be parsed.\n     */    yr(t) {\n        return cu.Zi(t);\n    }\n    Or(t) {\n        return JSON.parse(t);\n    }\n    async Cr(t) {\n        if (t.user.uid === this.currentUser.uid) return this.syncEngine.Fr(t.batchId, t.state, t.error);\n        C(\"SharedClientState\", `Ignoring mutation for non-active user ${t.user.uid}`);\n    }\n    kr(t) {\n        return this.syncEngine.$r(t.targetId, t.state, t.error);\n    }\n    Vr(t, e) {\n        const n = e ? this.ur.insert(t, e) : this.ur.remove(t), s = this.Ir(this.ur), i = this.Ir(n), r = [], o = [];\n        return i.forEach((t => {\n            s.has(t) || r.push(t);\n        })), s.forEach((t => {\n            i.has(t) || o.push(t);\n        })), this.syncEngine.Br(r, o).then((() => {\n            this.ur = n;\n        }));\n    }\n    pr(t) {\n        // We check whether the client that wrote this online state is still active\n        // by comparing its client ID to the list of clients kept active in\n        // IndexedDb. If a client does not update their IndexedDb client state\n        // within 5 seconds, it is considered inactive and we don't emit an online\n        // state event.\n        this.ur.get(t.clientId) && this.onlineStateHandler(t.onlineState);\n    }\n    Ir(t) {\n        let e = Rs();\n        return t.forEach(((t, n) => {\n            e = e.unionWith(n.activeTargetIds);\n        })), e;\n    }\n}\n\nclass lu {\n    constructor() {\n        this.Lr = new au, this.qr = {}, this.onlineStateHandler = null, this.sequenceNumberHandler = null;\n    }\n    addPendingMutation(t) {\n        // No op.\n    }\n    updateMutationState(t, e, n) {\n        // No op.\n    }\n    addLocalQueryTarget(t) {\n        return this.Lr.er(t), this.qr[t] || \"not-current\";\n    }\n    updateQueryState(t, e, n) {\n        this.qr[t] = e;\n    }\n    removeLocalQueryTarget(t) {\n        this.Lr.nr(t);\n    }\n    isLocalQueryTarget(t) {\n        return this.Lr.activeTargetIds.has(t);\n    }\n    clearQueryState(t) {\n        delete this.qr[t];\n    }\n    getAllActiveQueryTargets() {\n        return this.Lr.activeTargetIds;\n    }\n    isActiveQueryTarget(t) {\n        return this.Lr.activeTargetIds.has(t);\n    }\n    start() {\n        return this.Lr = new au, Promise.resolve();\n    }\n    handleUserChange(t, e, n) {\n        // No op.\n    }\n    setOnlineState(t) {\n        // No op.\n    }\n    shutdown() {}\n    writeSequenceNumber(t) {}\n    notifyBundleLoaded(t) {\n        // No op.\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 */ class fu {\n    Ur(t) {\n        // No-op.\n    }\n    shutdown() {\n        // No-op.\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// References to `window` are guarded by BrowserConnectivityMonitor.isAvailable()\n/* eslint-disable no-restricted-globals */\n/**\n * Browser implementation of ConnectivityMonitor.\n */\nclass du {\n    constructor() {\n        this.Kr = () => this.Gr(), this.Qr = () => this.jr(), this.Wr = [], this.zr();\n    }\n    Ur(t) {\n        this.Wr.push(t);\n    }\n    shutdown() {\n        window.removeEventListener(\"online\", this.Kr), window.removeEventListener(\"offline\", this.Qr);\n    }\n    zr() {\n        window.addEventListener(\"online\", this.Kr), window.addEventListener(\"offline\", this.Qr);\n    }\n    Gr() {\n        C(\"ConnectivityMonitor\", \"Network connectivity changed: AVAILABLE\");\n        for (const t of this.Wr) t(0 /* NetworkStatus.AVAILABLE */);\n    }\n    jr() {\n        C(\"ConnectivityMonitor\", \"Network connectivity changed: UNAVAILABLE\");\n        for (const t of this.Wr) t(1 /* NetworkStatus.UNAVAILABLE */);\n    }\n    // TODO(chenbrian): Consider passing in window either into this component or\n    // here for testing via FakeWindow.\n    /** Checks that all used attributes of window are available. */\n    static C() {\n        return \"undefined\" != typeof window && void 0 !== window.addEventListener && void 0 !== window.removeEventListener;\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 */ const _u = {\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 * Provides a simple helper class that implements the Stream interface to\n * bridge to other implementations that are streams but do not implement the\n * interface. The stream callbacks are invoked with the callOn... methods.\n */\nclass wu {\n    constructor(t) {\n        this.Hr = t.Hr, this.Jr = t.Jr;\n    }\n    Yr(t) {\n        this.Xr = t;\n    }\n    Zr(t) {\n        this.eo = t;\n    }\n    onMessage(t) {\n        this.no = t;\n    }\n    close() {\n        this.Jr();\n    }\n    send(t) {\n        this.Hr(t);\n    }\n    so() {\n        this.Xr();\n    }\n    io(t) {\n        this.eo(t);\n    }\n    ro(t) {\n        this.no(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 */ class mu 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.oo = e + \"://\" + t.host, this.uo = \"projects/\" + this.databaseId.projectId + \"/databases/\" + this.databaseId.database + \"/documents\";\n    }\n    get co() {\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    ao(t, e, n, s, i) {\n        const r = this.ho(t, e);\n        C(\"RestConnection\", \"Sending: \", r, n);\n        const o = {};\n        return this.lo(o, s, i), this.fo(t, r, o, n).then((t => (C(\"RestConnection\", \"Received: \", t), \n        t)), (e => {\n            throw N(\"RestConnection\", `${t} failed with error: `, e, \"url: \", r, \"request:\", n), \n            e;\n        }));\n    }\n    _o(t, e, n, s, i, r) {\n        // The REST API automatically aggregates all of the streamed results, so we\n        // can just use the normal invoke() method.\n        return this.ao(t, e, n, s, i);\n    }\n    /**\n     * Modifies the headers for a request, adding any authorization token if\n     * present and any additional headers for the request.\n     */    lo(t, e, n) {\n        t[\"X-Goog-Api-Client\"] = \"gl-js/ fire/\" + v, \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    ho(t, e) {\n        const n = _u[t];\n        return `${this.oo}/v1/${e}:${n}`;\n    }\n} {\n    constructor(t) {\n        super(t), this.forceLongPolling = t.forceLongPolling, this.autoDetectLongPolling = t.autoDetectLongPolling, \n        this.useFetchStreams = t.useFetchStreams;\n    }\n    fo(t, e, n, s) {\n        return new Promise(((i, r) => {\n            const o = new m;\n            o.setWithCredentials(!0), o.listenOnce(g.COMPLETE, (() => {\n                try {\n                    switch (o.getLastErrorCode()) {\n                      case y.NO_ERROR:\n                        const e = o.getResponseJson();\n                        C(\"Connection\", \"XHR received:\", JSON.stringify(e)), i(e);\n                        break;\n\n                      case y.TIMEOUT:\n                        C(\"Connection\", 'RPC \"' + t + '\" timed out'), r(new L(B.DEADLINE_EXCEEDED, \"Request time out\"));\n                        break;\n\n                      case y.HTTP_ERROR:\n                        const n = o.getStatus();\n                        if (C(\"Connection\", 'RPC \"' + t + '\" failed with status:', n, \"response text:\", o.getResponseText()), \n                        n > 0) {\n                            let t = o.getResponseJson();\n                            Array.isArray(t) && (t = t[0]);\n                            const e = null == t ? void 0 : t.error;\n                            if (e && e.status && e.message) {\n                                const t = function(t) {\n                                    const e = t.toLowerCase().replace(/_/g, \"-\");\n                                    return Object.values(B).indexOf(e) >= 0 ? e : B.UNKNOWN;\n                                }(e.status);\n                                r(new L(t, e.message));\n                            } else r(new L(B.UNKNOWN, \"Server responded with status \" + o.getStatus()));\n                        } else \n                        // If we received an HTTP_ERROR but there's no status code,\n                        // it's most probably a connection issue\n                        r(new L(B.UNAVAILABLE, \"Connection failed.\"));\n                        break;\n\n                      default:\n                        O();\n                    }\n                } finally {\n                    C(\"Connection\", 'RPC \"' + t + '\" completed.');\n                }\n            }));\n            const u = JSON.stringify(s);\n            o.send(e, \"POST\", u, n, 15);\n        }));\n    }\n    wo(t, e, n) {\n        const s = [ this.oo, \"/\", \"google.firestore.v1.Firestore\", \"/\", t, \"/channel\" ], i = p(), r = I(), o = {\n            // Required for backend stickiness, routing behavior is based on this\n            // parameter.\n            httpSessionIdParam: \"gsessionid\",\n            initMessageHeaders: {},\n            messageUrlParams: {\n                // This param is used to improve routing and project isolation by the\n                // backend and must be included in every request.\n                database: `projects/${this.databaseId.projectId}/databases/${this.databaseId.database}`\n            },\n            sendRawJson: !0,\n            supportsCrossDomainXhr: !0,\n            internalChannelParams: {\n                // Override the default timeout (randomized between 10-20 seconds) since\n                // a large write batch on a slow internet connection may take a long\n                // time to send to the backend. Rather than have WebChannel impose a\n                // tight timeout which could lead to infinite timeouts and retries, we\n                // set it very large (5-10 minutes) and rely on the browser's builtin\n                // timeouts to kick in if the request isn't working.\n                forwardChannelRequestTimeoutMs: 6e5\n            },\n            forceLongPolling: this.forceLongPolling,\n            detectBufferingProxy: this.autoDetectLongPolling\n        };\n        this.useFetchStreams && (o.xmlHttpFactory = new T({})), this.lo(o.initMessageHeaders, e, n), \n        // Sending the custom headers we just added to request.initMessageHeaders\n        // (Authorization, etc.) will trigger the browser to make a CORS preflight\n        // request because the XHR will no longer meet the criteria for a \"simple\"\n        // CORS request:\n        // https://developer.mozilla.org/en-US/docs/Web/HTTP/CORS#Simple_requests\n        // Therefore to avoid the CORS preflight request (an extra network\n        // roundtrip), we use the encodeInitMessageHeaders option to specify that\n        // the headers should instead be encoded in the request's POST payload,\n        // which is recognized by the webchannel backend.\n        o.encodeInitMessageHeaders = !0;\n        const u = s.join(\"\");\n        C(\"Connection\", \"Creating WebChannel: \" + u, o);\n        const c = i.createWebChannel(u, o);\n        // WebChannel supports sending the first message with the handshake - saving\n        // a network round trip. However, it will have to call send in the same\n        // JS event loop as open. In order to enforce this, we delay actually\n        // opening the WebChannel until send is called. Whether we have called\n        // open is tracked with this variable.\n                let a = !1, h = !1;\n        // A flag to determine whether the stream was closed (by us or through an\n        // error/close event) to avoid delivering multiple close events or sending\n        // on a closed stream\n                const l = new wu({\n            Hr: t => {\n                h ? C(\"Connection\", \"Not sending because WebChannel is closed:\", t) : (a || (C(\"Connection\", \"Opening WebChannel transport.\"), \n                c.open(), a = !0), C(\"Connection\", \"WebChannel sending:\", t), c.send(t));\n            },\n            Jr: () => c.close()\n        }), f = (t, e, n) => {\n            // TODO(dimond): closure typing seems broken because WebChannel does\n            // not implement goog.events.Listenable\n            t.listen(e, (t => {\n                try {\n                    n(t);\n                } catch (t) {\n                    setTimeout((() => {\n                        throw t;\n                    }), 0);\n                }\n            }));\n        };\n        // Closure events are guarded and exceptions are swallowed, so catch any\n        // exception and rethrow using a setTimeout so they become visible again.\n        // Note that eventually this function could go away if we are confident\n        // enough the code is exception free.\n                return f(c, E.EventType.OPEN, (() => {\n            h || C(\"Connection\", \"WebChannel transport opened.\");\n        })), f(c, E.EventType.CLOSE, (() => {\n            h || (h = !0, C(\"Connection\", \"WebChannel transport closed\"), l.io());\n        })), f(c, E.EventType.ERROR, (t => {\n            h || (h = !0, N(\"Connection\", \"WebChannel transport errored:\", t), l.io(new L(B.UNAVAILABLE, \"The operation could not be completed\")));\n        })), f(c, E.EventType.MESSAGE, (t => {\n            var e;\n            if (!h) {\n                const n = t.data[0];\n                M(!!n);\n                // TODO(b/35143891): There is a bug in One Platform that caused errors\n                // (and only errors) to be wrapped in an extra array. To be forward\n                // compatible with the bug we need to check either condition. The latter\n                // can be removed once the fix has been rolled out.\n                // Use any because msgData.error is not typed.\n                const s = n, i = s.error || (null === (e = s[0]) || void 0 === e ? void 0 : e.error);\n                if (i) {\n                    C(\"Connection\", \"WebChannel received error:\", i);\n                    // error.status will be a string like 'OK' or 'NOT_FOUND'.\n                    const t = i.status;\n                    let e = \n                    /**\n * Maps an error Code from a GRPC status identifier like 'NOT_FOUND'.\n *\n * @returns The Code equivalent to the given status string or undefined if\n *     there is no match.\n */\n                    function(t) {\n                        // lookup by string\n                        // eslint-disable-next-line @typescript-eslint/no-explicit-any\n                        const e = us[t];\n                        if (void 0 !== e) return hs(e);\n                    }(t), n = i.message;\n                    void 0 === e && (e = B.INTERNAL, n = \"Unknown error status: \" + t + \" with message \" + i.message), \n                    // Mark closed so no further events are propagated\n                    h = !0, l.io(new L(e, n)), c.close();\n                } else C(\"Connection\", \"WebChannel received:\", n), l.ro(n);\n            }\n        })), f(r, A.STAT_EVENT, (t => {\n            t.stat === R.PROXY ? C(\"Connection\", \"Detected buffering proxy\") : t.stat === R.NOPROXY && C(\"Connection\", \"Detected no buffering proxy\");\n        })), setTimeout((() => {\n            // Technically we could/should wait for the WebChannel opened event,\n            // but because we want to send the first message with the WebChannel\n            // handshake we pretend the channel opened here (asynchronously), and\n            // then delay the actual open until the first message is sent.\n            l.so();\n        }), 0), l;\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 WebChannelConnection for the browser. */\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 'window' implementation or null if not available. */\nfunction gu() {\n    // `window` is not always available, e.g. in ReactNative and WebWorkers.\n    // eslint-disable-next-line no-restricted-globals\n    return \"undefined\" != typeof window ? window : null;\n}\n\n/** The Platform's 'document' implementation or null if not available. */ function yu() {\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 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 pu(t) {\n    return new Fs(t, /* useProto3Json= */ !0);\n}\n\n/**\n * An instance of the Platform's 'TextEncoder' implementation.\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 Iu {\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     */ , s = 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     */ , i = 6e4) {\n        this.Hs = t, this.timerId = e, this.mo = n, this.yo = s, this.po = i, this.Io = 0, \n        this.To = null, \n        /** The last backoff attempt, as epoch milliseconds. */\n        this.Eo = 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.Io = 0;\n    }\n    /**\n     * Resets the backoff delay to the maximum delay (e.g. for use after a\n     * RESOURCE_EXHAUSTED error).\n     */    Ao() {\n        this.Io = this.po;\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     */    Ro(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.Io + this.bo()), n = Math.max(0, Date.now() - this.Eo), s = Math.max(0, e - n);\n        // Guard against lastAttemptTime being in the future due to a clock change.\n                s > 0 && C(\"ExponentialBackoff\", `Backing off for ${s} ms (base delay: ${this.Io} ms, delay with jitter: ${e} ms, last attempt: ${n} ms ago)`), \n        this.To = this.Hs.enqueueAfterDelay(this.timerId, s, (() => (this.Eo = Date.now(), \n        t()))), \n        // Apply backoff factor to determine next delay and ensure it is within\n        // bounds.\n        this.Io *= this.yo, this.Io < this.mo && (this.Io = this.mo), this.Io > this.po && (this.Io = this.po);\n    }\n    Po() {\n        null !== this.To && (this.To.skipDelay(), this.To = null);\n    }\n    cancel() {\n        null !== this.To && (this.To.cancel(), this.To = null);\n    }\n    /** Returns a random value in the range [-currentBaseMs/2, currentBaseMs/2] */    bo() {\n        return (Math.random() - .5) * this.Io;\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 * A PersistentStream is an abstract base class that represents a streaming RPC\n * to the Firestore backend. It's built on top of the connections own support\n * for streaming RPCs, and adds several critical features for our clients:\n *\n *   - Exponential backoff on failure\n *   - Authentication via CredentialsProvider\n *   - Dispatching all callbacks into the shared worker queue\n *   - Closing idle streams after 60 seconds of inactivity\n *\n * Subclasses of PersistentStream implement serialization of models to and\n * from the JSON representation of the protocol buffers for a specific\n * streaming RPC.\n *\n * ## Starting and Stopping\n *\n * Streaming RPCs are stateful and need to be start()ed before messages can\n * be sent and received. The PersistentStream will call the onOpen() function\n * of the listener once the stream is ready to accept requests.\n *\n * Should a start() fail, PersistentStream will call the registered onClose()\n * listener with a FirestoreError indicating what went wrong.\n *\n * A PersistentStream can be started and stopped repeatedly.\n *\n * Generic types:\n *  SendType: The type of the outgoing message of the underlying\n *    connection stream\n *  ReceiveType: The type of the incoming message of the underlying\n *    connection stream\n *  ListenerType: The type of the listener that will be used for callbacks\n */\nclass Tu {\n    constructor(t, e, n, s, i, r, o, u) {\n        this.Hs = t, this.vo = n, this.Vo = s, this.connection = i, this.authCredentialsProvider = r, \n        this.appCheckCredentialsProvider = o, this.listener = u, this.state = 0 /* PersistentStreamState.Initial */ , \n        /**\n         * A close count that's incremented every time the stream is closed; used by\n         * getCloseGuardedDispatcher() to invalidate callbacks that happen after\n         * close.\n         */\n        this.So = 0, this.Do = null, this.Co = null, this.stream = null, this.xo = new Iu(t, e);\n    }\n    /**\n     * Returns true if start() has been called and no error has occurred. True\n     * indicates the stream is open or in the process of opening (which\n     * encompasses respecting backoff, getting auth tokens, and starting the\n     * actual RPC). Use isOpen() to determine if the stream is open and ready for\n     * outbound requests.\n     */    No() {\n        return 1 /* PersistentStreamState.Starting */ === this.state || 5 /* PersistentStreamState.Backoff */ === this.state || this.ko();\n    }\n    /**\n     * Returns true if the underlying RPC is open (the onOpen() listener has been\n     * called) and the stream is ready for outbound requests.\n     */    ko() {\n        return 2 /* PersistentStreamState.Open */ === this.state || 3 /* PersistentStreamState.Healthy */ === this.state;\n    }\n    /**\n     * Starts the RPC. Only allowed if isStarted() returns false. The stream is\n     * not immediately ready for use: onOpen() will be invoked when the RPC is\n     * ready for outbound requests, at which point isOpen() will return true.\n     *\n     * When start returns, isStarted() will return true.\n     */    start() {\n        4 /* PersistentStreamState.Error */ !== this.state ? this.auth() : this.Oo();\n    }\n    /**\n     * Stops the RPC. This call is idempotent and allowed regardless of the\n     * current isStarted() state.\n     *\n     * When stop returns, isStarted() and isOpen() will both return false.\n     */    async stop() {\n        this.No() && await this.close(0 /* PersistentStreamState.Initial */);\n    }\n    /**\n     * After an error the stream will usually back off on the next attempt to\n     * start it. If the error warrants an immediate restart of the stream, the\n     * sender can use this to indicate that the receiver should not back off.\n     *\n     * Each error will call the onClose() listener. That function can decide to\n     * inhibit backoff if required.\n     */    Mo() {\n        this.state = 0 /* PersistentStreamState.Initial */ , this.xo.reset();\n    }\n    /**\n     * Marks this stream as idle. If no further actions are performed on the\n     * stream for one minute, the stream will automatically close itself and\n     * notify the stream's onClose() handler with Status.OK. The stream will then\n     * be in a !isStarted() state, requiring the caller to start the stream again\n     * before further use.\n     *\n     * Only streams that are in state 'Open' can be marked idle, as all other\n     * states imply pending network operations.\n     */    Fo() {\n        // Starts the idle time if we are in state 'Open' and are not yet already\n        // running a timer (in which case the previous idle timeout still applies).\n        this.ko() && null === this.Do && (this.Do = this.Hs.enqueueAfterDelay(this.vo, 6e4, (() => this.$o())));\n    }\n    /** Sends a message to the underlying stream. */    Bo(t) {\n        this.Lo(), this.stream.send(t);\n    }\n    /** Called by the idle timer when the stream should close due to inactivity. */    async $o() {\n        if (this.ko()) \n        // When timing out an idle stream there's no reason to force the stream into backoff when\n        // it restarts so set the stream state to Initial instead of Error.\n        return this.close(0 /* PersistentStreamState.Initial */);\n    }\n    /** Marks the stream as active again. */    Lo() {\n        this.Do && (this.Do.cancel(), this.Do = null);\n    }\n    /** Cancels the health check delayed operation. */    qo() {\n        this.Co && (this.Co.cancel(), this.Co = null);\n    }\n    /**\n     * Closes the stream and cleans up as necessary:\n     *\n     * * closes the underlying GRPC stream;\n     * * calls the onClose handler with the given 'error';\n     * * sets internal stream state to 'finalState';\n     * * adjusts the backoff timer based on the error\n     *\n     * A new stream can be opened by calling start().\n     *\n     * @param finalState - the intended state of the stream after closing.\n     * @param error - the error the connection was closed with.\n     */    async close(t, e) {\n        // Cancel any outstanding timers (they're guaranteed not to execute).\n        this.Lo(), this.qo(), this.xo.cancel(), \n        // Invalidates any stream-related callbacks (e.g. from auth or the\n        // underlying stream), guaranteeing they won't execute.\n        this.So++, 4 /* PersistentStreamState.Error */ !== t ? \n        // If this is an intentional close ensure we don't delay our next connection attempt.\n        this.xo.reset() : e && e.code === B.RESOURCE_EXHAUSTED ? (\n        // Log the error. (Probably either 'quota exceeded' or 'max queue length reached'.)\n        x(e.toString()), x(\"Using maximum backoff delay to prevent overloading the backend.\"), \n        this.xo.Ao()) : e && e.code === B.UNAUTHENTICATED && 3 /* PersistentStreamState.Healthy */ !== this.state && (\n        // \"unauthenticated\" error means the token was rejected. This should rarely\n        // happen since both Auth and AppCheck ensure a sufficient TTL when we\n        // request a token. If a user manually resets their system clock this can\n        // fail, however. In this case, we should get a Code.UNAUTHENTICATED error\n        // before we received the first message and we need to invalidate the token\n        // to ensure that we fetch a new token.\n        this.authCredentialsProvider.invalidateToken(), this.appCheckCredentialsProvider.invalidateToken()), \n        // Clean up the underlying stream because we are no longer interested in events.\n        null !== this.stream && (this.Uo(), this.stream.close(), this.stream = null), \n        // This state must be assigned before calling onClose() to allow the callback to\n        // inhibit backoff or otherwise manipulate the state in its non-started state.\n        this.state = t, \n        // Notify the listener that the stream closed.\n        await this.listener.Zr(e);\n    }\n    /**\n     * Can be overridden to perform additional cleanup before the stream is closed.\n     * Calling super.tearDown() is not required.\n     */    Uo() {}\n    auth() {\n        this.state = 1 /* PersistentStreamState.Starting */;\n        const t = this.Ko(this.So), e = this.So;\n        // TODO(mikelehen): Just use dispatchIfNotClosed, but see TODO below.\n                Promise.all([ this.authCredentialsProvider.getToken(), this.appCheckCredentialsProvider.getToken() ]).then((([t, n]) => {\n            // Stream can be stopped while waiting for authentication.\n            // TODO(mikelehen): We really should just use dispatchIfNotClosed\n            // and let this dispatch onto the queue, but that opened a spec test can\n            // of worms that I don't want to deal with in this PR.\n            this.So === e && \n            // Normally we'd have to schedule the callback on the AsyncQueue.\n            // However, the following calls are safe to be called outside the\n            // AsyncQueue since they don't chain asynchronous calls\n            this.Go(t, n);\n        }), (e => {\n            t((() => {\n                const t = new L(B.UNKNOWN, \"Fetching auth token failed: \" + e.message);\n                return this.Qo(t);\n            }));\n        }));\n    }\n    Go(t, e) {\n        const n = this.Ko(this.So);\n        this.stream = this.jo(t, e), this.stream.Yr((() => {\n            n((() => (this.state = 2 /* PersistentStreamState.Open */ , this.Co = this.Hs.enqueueAfterDelay(this.Vo, 1e4, (() => (this.ko() && (this.state = 3 /* PersistentStreamState.Healthy */), \n            Promise.resolve()))), this.listener.Yr())));\n        })), this.stream.Zr((t => {\n            n((() => this.Qo(t)));\n        })), this.stream.onMessage((t => {\n            n((() => this.onMessage(t)));\n        }));\n    }\n    Oo() {\n        this.state = 5 /* PersistentStreamState.Backoff */ , this.xo.Ro((async () => {\n            this.state = 0 /* PersistentStreamState.Initial */ , this.start();\n        }));\n    }\n    // Visible for tests\n    Qo(t) {\n        // In theory the stream could close cleanly, however, in our current model\n        // we never expect this to happen because if we stop a stream ourselves,\n        // this callback will never be called. To prevent cases where we retry\n        // without a backoff accidentally, we set the stream to error in all cases.\n        return C(\"PersistentStream\", `close with error: ${t}`), this.stream = null, this.close(4 /* PersistentStreamState.Error */ , t);\n    }\n    /**\n     * Returns a \"dispatcher\" function that dispatches operations onto the\n     * AsyncQueue but only runs them if closeCount remains unchanged. This allows\n     * us to turn auth / stream callbacks into no-ops if the stream is closed /\n     * re-opened, etc.\n     */    Ko(t) {\n        return e => {\n            this.Hs.enqueueAndForget((() => this.So === t ? e() : (C(\"PersistentStream\", \"stream callback skipped by getCloseGuardedDispatcher.\"), \n            Promise.resolve())));\n        };\n    }\n}\n\n/**\n * A PersistentStream that implements the Listen RPC.\n *\n * Once the Listen stream has called the onOpen() listener, any number of\n * listen() and unlisten() calls can be made to control what changes will be\n * sent from the server for ListenResponses.\n */ class Eu extends Tu {\n    constructor(t, e, n, s, i, r) {\n        super(t, \"listen_stream_connection_backoff\" /* TimerId.ListenStreamConnectionBackoff */ , \"listen_stream_idle\" /* TimerId.ListenStreamIdle */ , \"health_check_timeout\" /* TimerId.HealthCheckTimeout */ , e, n, s, r), \n        this.yt = i;\n    }\n    jo(t, e) {\n        return this.connection.wo(\"Listen\", t, e);\n    }\n    onMessage(t) {\n        // A successful response means the stream is healthy\n        this.xo.reset();\n        const e = Zs(this.yt, t), n = function(t) {\n            // We have only reached a consistent snapshot for the entire stream if there\n            // is a read_time set and it applies to all targets (i.e. the list of\n            // targets is empty). The backend is guaranteed to send such responses.\n            if (!(\"targetChange\" in t)) return st.min();\n            const e = t.targetChange;\n            return e.targetIds && e.targetIds.length ? st.min() : e.readTime ? qs(e.readTime) : st.min();\n        }(t);\n        return this.listener.Wo(e, n);\n    }\n    /**\n     * Registers interest in the results of the given target. If the target\n     * includes a resumeToken it will be included in the request. Results that\n     * affect the target will be streamed back as WatchChange messages that\n     * reference the targetId.\n     */    zo(t) {\n        const e = {};\n        e.database = zs(this.yt), e.addTarget = function(t, e) {\n            let n;\n            const s = e.target;\n            return n = rn(s) ? {\n                documents: si(t, s)\n            } : {\n                query: ii(t, s)\n            }, n.targetId = e.targetId, e.resumeToken.approximateByteSize() > 0 ? n.resumeToken = Bs(t, e.resumeToken) : e.snapshotVersion.compareTo(st.min()) > 0 && (\n            // TODO(wuandy): Consider removing above check because it is most likely true.\n            // Right now, many tests depend on this behaviour though (leaving min() out\n            // of serialization).\n            n.readTime = $s(t, e.snapshotVersion.toTimestamp())), n;\n        }(this.yt, t);\n        const n = oi(this.yt, t);\n        n && (e.labels = n), this.Bo(e);\n    }\n    /**\n     * Unregisters interest in the results of the target associated with the\n     * given targetId.\n     */    Ho(t) {\n        const e = {};\n        e.database = zs(this.yt), e.removeTarget = t, this.Bo(e);\n    }\n}\n\n/**\n * A Stream that implements the Write RPC.\n *\n * The Write RPC requires the caller to maintain special streamToken\n * state in between calls, to help the server understand which responses the\n * client has processed by the time the next request is made. Every response\n * will contain a streamToken; this value must be passed to the next\n * request.\n *\n * After calling start() on this stream, the next request must be a handshake,\n * containing whatever streamToken is on hand. Once a response to this\n * request is received, all pending mutations may be submitted. When\n * submitting multiple batches of mutations at the same time, it's\n * okay to use the same streamToken for the calls to writeMutations.\n *\n * TODO(b/33271235): Use proto types\n */ class Au extends Tu {\n    constructor(t, e, n, s, i, r) {\n        super(t, \"write_stream_connection_backoff\" /* TimerId.WriteStreamConnectionBackoff */ , \"write_stream_idle\" /* TimerId.WriteStreamIdle */ , \"health_check_timeout\" /* TimerId.HealthCheckTimeout */ , e, n, s, r), \n        this.yt = i, this.Jo = !1;\n    }\n    /**\n     * Tracks whether or not a handshake has been successfully exchanged and\n     * the stream is ready to accept mutations.\n     */    get Yo() {\n        return this.Jo;\n    }\n    // Override of PersistentStream.start\n    start() {\n        this.Jo = !1, this.lastStreamToken = void 0, super.start();\n    }\n    Uo() {\n        this.Jo && this.Xo([]);\n    }\n    jo(t, e) {\n        return this.connection.wo(\"Write\", t, e);\n    }\n    onMessage(t) {\n        if (\n        // Always capture the last stream token.\n        M(!!t.streamToken), this.lastStreamToken = t.streamToken, this.Jo) {\n            // A successful first write response means the stream is healthy,\n            // Note, that we could consider a successful handshake healthy, however,\n            // the write itself might be causing an error we want to back off from.\n            this.xo.reset();\n            const e = ni(t.writeResults, t.commitTime), n = qs(t.commitTime);\n            return this.listener.Zo(n, e);\n        }\n        // The first response is always the handshake response\n        return M(!t.writeResults || 0 === t.writeResults.length), this.Jo = !0, this.listener.tu();\n    }\n    /**\n     * Sends an initial streamToken to the server, performing the handshake\n     * required to make the StreamingWrite RPC work. Subsequent\n     * calls should wait until onHandshakeComplete was called.\n     */    eu() {\n        // TODO(dimond): Support stream resumption. We intentionally do not set the\n        // stream token on the handshake, ignoring any stream token we might have.\n        const t = {};\n        t.database = zs(this.yt), this.Bo(t);\n    }\n    /** Sends a group of mutations to the Firestore backend to apply. */    Xo(t) {\n        const e = {\n            streamToken: this.lastStreamToken,\n            writes: t.map((t => ti(this.yt, t)))\n        };\n        this.Bo(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 * 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 Ru extends class {} {\n    constructor(t, e, n, s) {\n        super(), this.authCredentials = t, this.appCheckCredentials = e, this.connection = n, \n        this.yt = s, this.nu = !1;\n    }\n    su() {\n        if (this.nu) throw new L(B.FAILED_PRECONDITION, \"The client has already been terminated.\");\n    }\n    /** Invokes the provided RPC with auth and AppCheck tokens. */    ao(t, e, n) {\n        return this.su(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((([s, i]) => this.connection.ao(t, e, n, s, i))).catch((t => {\n            throw \"FirebaseError\" === t.name ? (t.code === B.UNAUTHENTICATED && (this.authCredentials.invalidateToken(), \n            this.appCheckCredentials.invalidateToken()), t) : new L(B.UNKNOWN, t.toString());\n        }));\n    }\n    /** Invokes the provided RPC with streamed results with auth and AppCheck tokens. */    _o(t, e, n, s) {\n        return this.su(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((([i, r]) => this.connection._o(t, e, n, i, r, s))).catch((t => {\n            throw \"FirebaseError\" === t.name ? (t.code === B.UNAUTHENTICATED && (this.authCredentials.invalidateToken(), \n            this.appCheckCredentials.invalidateToken()), t) : new L(B.UNKNOWN, t.toString());\n        }));\n    }\n    terminate() {\n        this.nu = !0;\n    }\n}\n\n// TODO(firestorexp): Make sure there is only one Datastore instance per\n// firestore-exp client.\nasync function bu(t, e) {\n    const n = $(t), s = function(t, e) {\n        const n = ii(t, e);\n        return {\n            structuredAggregationQuery: {\n                aggregations: [ {\n                    count: {},\n                    alias: \"count_alias\"\n                } ],\n                structuredQuery: n.structuredQuery\n            },\n            parent: n.parent\n        };\n    }(n.yt, gn(e)), i = s.parent;\n    n.connection.co || delete s.parent;\n    return (await n._o(\"RunAggregationQuery\", i, s, /*expectedResponseCount=*/ 1)).filter((t => !!t.result)).map((t => t.result.aggregateFields));\n}\n\n/**\n * A component used by the RemoteStore to track the OnlineState (that is,\n * whether or not the client as a whole should be considered to be online or\n * offline), implementing the appropriate heuristics.\n *\n * In particular, when the client is trying to connect to the backend, we\n * allow up to MAX_WATCH_STREAM_FAILURES within ONLINE_STATE_TIMEOUT_MS for\n * a connection to succeed. If we have too many failures or the timeout elapses,\n * then we set the OnlineState to Offline, and the client will behave as if\n * it is offline (get()s will return cached data, etc.).\n */\nclass Pu {\n    constructor(t, e) {\n        this.asyncQueue = t, this.onlineStateHandler = e, \n        /** The current OnlineState. */\n        this.state = \"Unknown\" /* OnlineState.Unknown */ , \n        /**\n         * A count of consecutive failures to open the stream. If it reaches the\n         * maximum defined by MAX_WATCH_STREAM_FAILURES, we'll set the OnlineState to\n         * Offline.\n         */\n        this.iu = 0, \n        /**\n         * A timer that elapses after ONLINE_STATE_TIMEOUT_MS, at which point we\n         * transition from OnlineState.Unknown to OnlineState.Offline without waiting\n         * for the stream to actually fail (MAX_WATCH_STREAM_FAILURES times).\n         */\n        this.ru = null, \n        /**\n         * Whether the client should log a warning message if it fails to connect to\n         * the backend (initially true, cleared after a successful stream, or if we've\n         * logged the message already).\n         */\n        this.ou = !0;\n    }\n    /**\n     * Called by RemoteStore when a watch stream is started (including on each\n     * backoff attempt).\n     *\n     * If this is the first attempt, it sets the OnlineState to Unknown and starts\n     * the onlineStateTimer.\n     */    uu() {\n        0 === this.iu && (this.cu(\"Unknown\" /* OnlineState.Unknown */), this.ru = this.asyncQueue.enqueueAfterDelay(\"online_state_timeout\" /* TimerId.OnlineStateTimeout */ , 1e4, (() => (this.ru = null, \n        this.au(\"Backend didn't respond within 10 seconds.\"), this.cu(\"Offline\" /* OnlineState.Offline */), \n        Promise.resolve()))));\n    }\n    /**\n     * Updates our OnlineState as appropriate after the watch stream reports a\n     * failure. The first failure moves us to the 'Unknown' state. We then may\n     * allow multiple failures (based on MAX_WATCH_STREAM_FAILURES) before we\n     * actually transition to the 'Offline' state.\n     */    hu(t) {\n        \"Online\" /* OnlineState.Online */ === this.state ? this.cu(\"Unknown\" /* OnlineState.Unknown */) : (this.iu++, \n        this.iu >= 1 && (this.lu(), this.au(`Connection failed 1 times. Most recent error: ${t.toString()}`), \n        this.cu(\"Offline\" /* OnlineState.Offline */)));\n    }\n    /**\n     * Explicitly sets the OnlineState to the specified state.\n     *\n     * Note that this resets our timers / failure counters, etc. used by our\n     * Offline heuristics, so must not be used in place of\n     * handleWatchStreamStart() and handleWatchStreamFailure().\n     */    set(t) {\n        this.lu(), this.iu = 0, \"Online\" /* OnlineState.Online */ === t && (\n        // We've connected to watch at least once. Don't warn the developer\n        // about being offline going forward.\n        this.ou = !1), this.cu(t);\n    }\n    cu(t) {\n        t !== this.state && (this.state = t, this.onlineStateHandler(t));\n    }\n    au(t) {\n        const e = `Could not reach Cloud Firestore backend. ${t}\\nThis typically indicates that your device does not have a healthy Internet connection at the moment. The client will operate in offline mode until it is able to successfully connect to the backend.`;\n        this.ou ? (x(e), this.ou = !1) : C(\"OnlineStateTracker\", e);\n    }\n    lu() {\n        null !== this.ru && (this.ru.cancel(), this.ru = 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 */ class vu {\n    constructor(\n    /**\n     * The local store, used to fill the write pipeline with outbound mutations.\n     */\n    t, \n    /** The client-side proxy for interacting with the backend. */\n    e, n, s, i) {\n        this.localStore = t, this.datastore = e, this.asyncQueue = n, this.remoteSyncer = {}, \n        /**\n         * A list of up to MAX_PENDING_WRITES writes that we have fetched from the\n         * LocalStore via fillWritePipeline() and have or will send to the write\n         * stream.\n         *\n         * Whenever writePipeline.length > 0 the RemoteStore will attempt to start or\n         * restart the write stream. When the stream is established the writes in the\n         * pipeline will be sent in order.\n         *\n         * Writes remain in writePipeline until they are acknowledged by the backend\n         * and thus will automatically be re-sent if the stream is interrupted /\n         * restarted before they're acknowledged.\n         *\n         * Write responses from the backend are linked to their originating request\n         * purely based on order, and so we can just shift() writes from the front of\n         * the writePipeline as we receive responses.\n         */\n        this.fu = [], \n        /**\n         * A mapping of watched targets that the client cares about tracking and the\n         * user has explicitly called a 'listen' for this target.\n         *\n         * These targets may or may not have been sent to or acknowledged by the\n         * server. On re-establishing the listen stream, these targets should be sent\n         * to the server. The targets removed with unlistens are removed eagerly\n         * without waiting for confirmation from the listen stream.\n         */\n        this.du = new Map, \n        /**\n         * A set of reasons for why the RemoteStore may be offline. If empty, the\n         * RemoteStore may start its network connections.\n         */\n        this._u = new Set, \n        /**\n         * Event handlers that get called when the network is disabled or enabled.\n         *\n         * PORTING NOTE: These functions are used on the Web client to create the\n         * underlying streams (to support tree-shakeable streams). On Android and iOS,\n         * the streams are created during construction of RemoteStore.\n         */\n        this.wu = [], this.mu = i, this.mu.Ur((t => {\n            n.enqueueAndForget((async () => {\n                // Porting Note: Unlike iOS, `restartNetwork()` is called even when the\n                // network becomes unreachable as we don't have any other way to tear\n                // down our streams.\n                Mu(this) && (C(\"RemoteStore\", \"Restarting streams for network reachability change.\"), \n                await async function(t) {\n                    const e = $(t);\n                    e._u.add(4 /* OfflineCause.ConnectivityChange */), await Su(e), e.gu.set(\"Unknown\" /* OnlineState.Unknown */), \n                    e._u.delete(4 /* OfflineCause.ConnectivityChange */), await Vu(e);\n                }(this));\n            }));\n        })), this.gu = new Pu(n, s);\n    }\n}\n\nasync function Vu(t) {\n    if (Mu(t)) for (const e of t.wu) await e(/* enabled= */ !0);\n}\n\n/**\n * Temporarily disables the network. The network can be re-enabled using\n * enableNetwork().\n */ async function Su(t) {\n    for (const e of t.wu) await e(/* enabled= */ !1);\n}\n\n/**\n * Starts new listen for the given target. Uses resume token if provided. It\n * is a no-op if the target of given `TargetData` is already being listened to.\n */\nfunction Du(t, e) {\n    const n = $(t);\n    n.du.has(e.targetId) || (\n    // Mark this as something the client is currently listening for.\n    n.du.set(e.targetId, e), Ou(n) ? \n    // The listen will be sent in onWatchStreamOpen\n    ku(n) : tc(n).ko() && xu(n, e));\n}\n\n/**\n * Removes the listen from server. It is a no-op if the given target id is\n * not being listened to.\n */ function Cu(t, e) {\n    const n = $(t), s = tc(n);\n    n.du.delete(e), s.ko() && Nu(n, e), 0 === n.du.size && (s.ko() ? s.Fo() : Mu(n) && \n    // Revert to OnlineState.Unknown if the watch stream is not open and we\n    // have no listeners, since without any listens to send we cannot\n    // confirm if the stream is healthy and upgrade to OnlineState.Online.\n    n.gu.set(\"Unknown\" /* OnlineState.Unknown */));\n}\n\n/**\n * We need to increment the the expected number of pending responses we're due\n * from watch so we wait for the ack to process any messages from this target.\n */ function xu(t, e) {\n    t.yu.Ot(e.targetId), tc(t).zo(e);\n}\n\n/**\n * We need to increment the expected number of pending responses we're due\n * from watch so we wait for the removal on the server before we process any\n * messages from this target.\n */ function Nu(t, e) {\n    t.yu.Ot(e), tc(t).Ho(e);\n}\n\nfunction ku(t) {\n    t.yu = new Cs({\n        getRemoteKeysForTarget: e => t.remoteSyncer.getRemoteKeysForTarget(e),\n        ne: e => t.du.get(e) || null\n    }), tc(t).start(), t.gu.uu();\n}\n\n/**\n * Returns whether the watch stream should be started because it's necessary\n * and has not yet been started.\n */ function Ou(t) {\n    return Mu(t) && !tc(t).No() && t.du.size > 0;\n}\n\nfunction Mu(t) {\n    return 0 === $(t)._u.size;\n}\n\nfunction Fu(t) {\n    t.yu = void 0;\n}\n\nasync function $u(t) {\n    t.du.forEach(((e, n) => {\n        xu(t, e);\n    }));\n}\n\nasync function Bu(t, e) {\n    Fu(t), \n    // If we still need the watch stream, retry the connection.\n    Ou(t) ? (t.gu.hu(e), ku(t)) : \n    // No need to restart watch stream because there are no active targets.\n    // The online state is set to unknown because there is no active attempt\n    // at establishing a connection\n    t.gu.set(\"Unknown\" /* OnlineState.Unknown */);\n}\n\nasync function Lu(t, e, n) {\n    if (\n    // Mark the client as online since we got a message from the server\n    t.gu.set(\"Online\" /* OnlineState.Online */), e instanceof Ss && 2 /* WatchTargetChangeState.Removed */ === e.state && e.cause) \n    // There was an error on a target, don't wait for a consistent snapshot\n    // to raise events\n    try {\n        await \n        /** Handles an error on a target */\n        async function(t, e) {\n            const n = e.cause;\n            for (const s of e.targetIds) \n            // A watched target might have been removed already.\n            t.du.has(s) && (await t.remoteSyncer.rejectListen(s, n), t.du.delete(s), t.yu.removeTarget(s));\n        }\n        /**\n * Attempts to fill our write pipeline with writes from the LocalStore.\n *\n * Called internally to bootstrap or refill the write pipeline and by\n * SyncEngine whenever there are new mutations to process.\n *\n * Starts the write stream if necessary.\n */ (t, e);\n    } catch (n) {\n        C(\"RemoteStore\", \"Failed to remove targets %s: %s \", e.targetIds.join(\",\"), n), \n        await qu(t, n);\n    } else if (e instanceof vs ? t.yu.Kt(e) : e instanceof Vs ? t.yu.Jt(e) : t.yu.jt(e), \n    !n.isEqual(st.min())) try {\n        const e = await Go(t.localStore);\n        n.compareTo(e) >= 0 && \n        // We have received a target change with a global snapshot if the snapshot\n        // version is not equal to SnapshotVersion.min().\n        await \n        /**\n * Takes a batch of changes from the Datastore, repackages them as a\n * RemoteEvent, and passes that on to the listener, which is typically the\n * SyncEngine.\n */\n        function(t, e) {\n            const n = t.yu.Zt(e);\n            // Update in-memory resume tokens. LocalStore will update the\n            // persistent view of these when applying the completed RemoteEvent.\n                        return n.targetChanges.forEach(((n, s) => {\n                if (n.resumeToken.approximateByteSize() > 0) {\n                    const i = t.du.get(s);\n                    // A watched target might have been removed already.\n                                        i && t.du.set(s, i.withResumeToken(n.resumeToken, e));\n                }\n            })), \n            // Re-establish listens for the targets that have been invalidated by\n            // existence filter mismatches.\n            n.targetMismatches.forEach((e => {\n                const n = t.du.get(e);\n                if (!n) \n                // A watched target might have been removed already.\n                return;\n                // Clear the resume token for the target, since we're in a known mismatch\n                // state.\n                                t.du.set(e, n.withResumeToken(Qt.EMPTY_BYTE_STRING, n.snapshotVersion)), \n                // Cause a hard reset by unwatching and rewatching immediately, but\n                // deliberately don't send a resume token so that we get a full update.\n                Nu(t, e);\n                // Mark the target we send as being on behalf of an existence filter\n                // mismatch, but don't actually retain that in listenTargets. This ensures\n                // that we flag the first re-listen this way without impacting future\n                // listens of this target (that might happen e.g. on reconnect).\n                const s = new zi(n.target, e, 1 /* TargetPurpose.ExistenceFilterMismatch */ , n.sequenceNumber);\n                xu(t, s);\n            })), t.remoteSyncer.applyRemoteEvent(n);\n        }(t, n);\n    } catch (e) {\n        C(\"RemoteStore\", \"Failed to raise snapshot:\", e), await qu(t, e);\n    }\n}\n\n/**\n * Recovery logic for IndexedDB errors that takes the network offline until\n * `op` succeeds. Retries are scheduled with backoff using\n * `enqueueRetryable()`. If `op()` is not provided, IndexedDB access is\n * validated via a generic operation.\n *\n * The returned Promise is resolved once the network is disabled and before\n * any retry attempt.\n */ async function qu(t, e, n) {\n    if (!Vt(e)) throw e;\n    t._u.add(1 /* OfflineCause.IndexedDbFailed */), \n    // Disable network and raise offline snapshots\n    await Su(t), t.gu.set(\"Offline\" /* OnlineState.Offline */), n || (\n    // Use a simple read operation to determine if IndexedDB recovered.\n    // Ideally, we would expose a health check directly on SimpleDb, but\n    // RemoteStore only has access to persistence through LocalStore.\n    n = () => Go(t.localStore)), \n    // Probe IndexedDB periodically and re-enable network\n    t.asyncQueue.enqueueRetryable((async () => {\n        C(\"RemoteStore\", \"Retrying IndexedDB access\"), await n(), t._u.delete(1 /* OfflineCause.IndexedDbFailed */), \n        await Vu(t);\n    }));\n}\n\n/**\n * Executes `op`. If `op` fails, takes the network offline until `op`\n * succeeds. Returns after the first attempt.\n */ function Uu(t, e) {\n    return e().catch((n => qu(t, n, e)));\n}\n\nasync function Ku(t) {\n    const e = $(t), n = ec(e);\n    let s = e.fu.length > 0 ? e.fu[e.fu.length - 1].batchId : -1;\n    for (;Gu(e); ) try {\n        const t = await Wo(e.localStore, s);\n        if (null === t) {\n            0 === e.fu.length && n.Fo();\n            break;\n        }\n        s = t.batchId, Qu(e, t);\n    } catch (t) {\n        await qu(e, t);\n    }\n    ju(e) && Wu(e);\n}\n\n/**\n * Returns true if we can add to the write pipeline (i.e. the network is\n * enabled and the write pipeline is not full).\n */ function Gu(t) {\n    return Mu(t) && t.fu.length < 10;\n}\n\n/**\n * Queues additional writes to be sent to the write stream, sending them\n * immediately if the write stream is established.\n */ function Qu(t, e) {\n    t.fu.push(e);\n    const n = ec(t);\n    n.ko() && n.Yo && n.Xo(e.mutations);\n}\n\nfunction ju(t) {\n    return Mu(t) && !ec(t).No() && t.fu.length > 0;\n}\n\nfunction Wu(t) {\n    ec(t).start();\n}\n\nasync function zu(t) {\n    ec(t).eu();\n}\n\nasync function Hu(t) {\n    const e = ec(t);\n    // Send the write pipeline now that the stream is established.\n        for (const n of t.fu) e.Xo(n.mutations);\n}\n\nasync function Ju(t, e, n) {\n    const s = t.fu.shift(), i = ji.from(s, e, n);\n    await Uu(t, (() => t.remoteSyncer.applySuccessfulWrite(i))), \n    // It's possible that with the completion of this mutation another\n    // slot has freed up.\n    await Ku(t);\n}\n\nasync function Yu(t, e) {\n    // If the write stream closed after the write handshake completes, a write\n    // operation failed and we fail the pending operation.\n    e && ec(t).Yo && \n    // This error affects the actual write.\n    await async function(t, e) {\n        // Only handle permanent errors here. If it's transient, just let the retry\n        // logic kick in.\n        if (n = e.code, as(n) && n !== B.ABORTED) {\n            // This was a permanent error, the request itself was the problem\n            // so it's not going to succeed if we resend it.\n            const n = t.fu.shift();\n            // In this case it's also unlikely that the server itself is melting\n            // down -- this was just a bad request so inhibit backoff on the next\n            // restart.\n                        ec(t).Mo(), await Uu(t, (() => t.remoteSyncer.rejectFailedWrite(n.batchId, e))), \n            // It's possible that with the completion of this mutation\n            // another slot has freed up.\n            await Ku(t);\n        }\n        var n;\n    }(t, e), \n    // The write stream might have been started by refilling the write\n    // pipeline for failed writes\n    ju(t) && Wu(t);\n}\n\nasync function Xu(t, e) {\n    const n = $(t);\n    n.asyncQueue.verifyOperationInProgress(), C(\"RemoteStore\", \"RemoteStore received new credentials\");\n    const s = Mu(n);\n    // Tear down and re-create our network streams. This will ensure we get a\n    // fresh auth token for the new user and re-fill the write pipeline with\n    // new mutations from the LocalStore (since mutations are per-user).\n        n._u.add(3 /* OfflineCause.CredentialChange */), await Su(n), s && \n    // Don't set the network status to Unknown if we are offline.\n    n.gu.set(\"Unknown\" /* OnlineState.Unknown */), await n.remoteSyncer.handleCredentialChange(e), \n    n._u.delete(3 /* OfflineCause.CredentialChange */), await Vu(n);\n}\n\n/**\n * Toggles the network state when the client gains or loses its primary lease.\n */ async function Zu(t, e) {\n    const n = $(t);\n    e ? (n._u.delete(2 /* OfflineCause.IsSecondary */), await Vu(n)) : e || (n._u.add(2 /* OfflineCause.IsSecondary */), \n    await Su(n), n.gu.set(\"Unknown\" /* OnlineState.Unknown */));\n}\n\n/**\n * If not yet initialized, registers the WatchStream and its network state\n * callback with `remoteStoreImpl`. Returns the existing stream if one is\n * already available.\n *\n * PORTING NOTE: On iOS and Android, the WatchStream gets registered on startup.\n * This is not done on Web to allow it to be tree-shaken.\n */ function tc(t) {\n    return t.pu || (\n    // Create stream (but note that it is not started yet).\n    t.pu = function(t, e, n) {\n        const s = $(t);\n        return s.su(), new Eu(e, s.connection, s.authCredentials, s.appCheckCredentials, s.yt, 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 */ (t.datastore, t.asyncQueue, {\n        Yr: $u.bind(null, t),\n        Zr: Bu.bind(null, t),\n        Wo: Lu.bind(null, t)\n    }), t.wu.push((async e => {\n        e ? (t.pu.Mo(), Ou(t) ? ku(t) : t.gu.set(\"Unknown\" /* OnlineState.Unknown */)) : (await t.pu.stop(), \n        Fu(t));\n    }))), t.pu;\n}\n\n/**\n * If not yet initialized, registers the WriteStream and its network state\n * callback with `remoteStoreImpl`. Returns the existing stream if one is\n * already available.\n *\n * PORTING NOTE: On iOS and Android, the WriteStream gets registered on startup.\n * This is not done on Web to allow it to be tree-shaken.\n */ function ec(t) {\n    return t.Iu || (\n    // Create stream (but note that it is not started yet).\n    t.Iu = function(t, e, n) {\n        const s = $(t);\n        return s.su(), new Au(e, s.connection, s.authCredentials, s.appCheckCredentials, s.yt, n);\n    }(t.datastore, t.asyncQueue, {\n        Yr: zu.bind(null, t),\n        Zr: Yu.bind(null, t),\n        tu: Hu.bind(null, t),\n        Zo: Ju.bind(null, t)\n    }), t.wu.push((async e => {\n        e ? (t.Iu.Mo(), \n        // This will start the write stream if necessary.\n        await Ku(t)) : (await t.Iu.stop(), t.fu.length > 0 && (C(\"RemoteStore\", `Stopping write stream with ${t.fu.length} pending writes`), \n        t.fu = []));\n    }))), t.Iu;\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 */\nclass nc {\n    constructor(t, e, n, s, i) {\n        this.asyncQueue = t, this.timerId = e, this.targetTimeMs = n, this.op = s, this.removalCallback = i, \n        this.deferred = new q, 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, s, i) {\n        const r = Date.now() + n, o = new nc(t, e, r, s, i);\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 L(B.CANCELLED, \"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 * Returns a FirestoreError that can be surfaced to the user if the provided\n * error is an IndexedDbTransactionError. Re-throws the error otherwise.\n */ function sc(t, e) {\n    if (x(\"AsyncQueue\", `${e}: ${t}`), Vt(t)) return new L(B.UNAVAILABLE, `${e}: ${t}`);\n    throw 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 * DocumentSet is an immutable (copy-on-write) collection that holds documents\n * in order specified by the provided comparator. We always add a document key\n * comparator on top of what is provided to guarantee document equality based on\n * the key.\n */ class ic {\n    /** The default ordering is by key if the comparator is omitted */\n    constructor(t) {\n        // We are adding document key comparator to the end as it's the only\n        // guaranteed unique property of a document.\n        this.comparator = t ? (e, n) => t(e, n) || ct.comparator(e.key, n.key) : (t, e) => ct.comparator(t.key, e.key), \n        this.keyedMap = ws(), this.sortedSet = new Ge(this.comparator);\n    }\n    /**\n     * Returns an empty copy of the existing DocumentSet, using the same\n     * comparator.\n     */    static emptySet(t) {\n        return new ic(t.comparator);\n    }\n    has(t) {\n        return null != this.keyedMap.get(t);\n    }\n    get(t) {\n        return this.keyedMap.get(t);\n    }\n    first() {\n        return this.sortedSet.minKey();\n    }\n    last() {\n        return this.sortedSet.maxKey();\n    }\n    isEmpty() {\n        return this.sortedSet.isEmpty();\n    }\n    /**\n     * Returns the index of the provided key in the document set, or -1 if the\n     * document key is not present in the set;\n     */    indexOf(t) {\n        const e = this.keyedMap.get(t);\n        return e ? this.sortedSet.indexOf(e) : -1;\n    }\n    get size() {\n        return this.sortedSet.size;\n    }\n    /** Iterates documents in order defined by \"comparator\" */    forEach(t) {\n        this.sortedSet.inorderTraversal(((e, n) => (t(e), !1)));\n    }\n    /** Inserts or updates a document with the same key */    add(t) {\n        // First remove the element if we have it.\n        const e = this.delete(t.key);\n        return e.copy(e.keyedMap.insert(t.key, t), e.sortedSet.insert(t, null));\n    }\n    /** Deletes a document with a given key */    delete(t) {\n        const e = this.get(t);\n        return e ? this.copy(this.keyedMap.remove(t), this.sortedSet.remove(e)) : this;\n    }\n    isEqual(t) {\n        if (!(t instanceof ic)) return !1;\n        if (this.size !== t.size) return !1;\n        const e = this.sortedSet.getIterator(), n = t.sortedSet.getIterator();\n        for (;e.hasNext(); ) {\n            const t = e.getNext().key, s = n.getNext().key;\n            if (!t.isEqual(s)) return !1;\n        }\n        return !0;\n    }\n    toString() {\n        const t = [];\n        return this.forEach((e => {\n            t.push(e.toString());\n        })), 0 === t.length ? \"DocumentSet ()\" : \"DocumentSet (\\n  \" + t.join(\"  \\n\") + \"\\n)\";\n    }\n    copy(t, e) {\n        const n = new ic;\n        return n.comparator = this.comparator, n.keyedMap = t, n.sortedSet = 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 */\n/**\n * DocumentChangeSet keeps track of a set of changes to docs in a query, merging\n * duplicate events for the same doc.\n */ class rc {\n    constructor() {\n        this.Tu = new Ge(ct.comparator);\n    }\n    track(t) {\n        const e = t.doc.key, n = this.Tu.get(e);\n        n ? \n        // Merge the new change with the existing change.\n        0 /* ChangeType.Added */ !== t.type && 3 /* ChangeType.Metadata */ === n.type ? this.Tu = this.Tu.insert(e, t) : 3 /* ChangeType.Metadata */ === t.type && 1 /* ChangeType.Removed */ !== n.type ? this.Tu = this.Tu.insert(e, {\n            type: n.type,\n            doc: t.doc\n        }) : 2 /* ChangeType.Modified */ === t.type && 2 /* ChangeType.Modified */ === n.type ? this.Tu = this.Tu.insert(e, {\n            type: 2 /* ChangeType.Modified */ ,\n            doc: t.doc\n        }) : 2 /* ChangeType.Modified */ === t.type && 0 /* ChangeType.Added */ === n.type ? this.Tu = this.Tu.insert(e, {\n            type: 0 /* ChangeType.Added */ ,\n            doc: t.doc\n        }) : 1 /* ChangeType.Removed */ === t.type && 0 /* ChangeType.Added */ === n.type ? this.Tu = this.Tu.remove(e) : 1 /* ChangeType.Removed */ === t.type && 2 /* ChangeType.Modified */ === n.type ? this.Tu = this.Tu.insert(e, {\n            type: 1 /* ChangeType.Removed */ ,\n            doc: n.doc\n        }) : 0 /* ChangeType.Added */ === t.type && 1 /* ChangeType.Removed */ === n.type ? this.Tu = this.Tu.insert(e, {\n            type: 2 /* ChangeType.Modified */ ,\n            doc: t.doc\n        }) : \n        // This includes these cases, which don't make sense:\n        // Added->Added\n        // Removed->Removed\n        // Modified->Added\n        // Removed->Modified\n        // Metadata->Added\n        // Removed->Metadata\n        O() : this.Tu = this.Tu.insert(e, t);\n    }\n    Eu() {\n        const t = [];\n        return this.Tu.inorderTraversal(((e, n) => {\n            t.push(n);\n        })), t;\n    }\n}\n\nclass oc {\n    constructor(t, e, n, s, i, r, o, u, c) {\n        this.query = t, this.docs = e, this.oldDocs = n, this.docChanges = s, this.mutatedKeys = i, \n        this.fromCache = r, this.syncStateChanged = o, this.excludesMetadataChanges = u, \n        this.hasCachedResults = c;\n    }\n    /** Returns a view snapshot as if all documents in the snapshot were added. */    static fromInitialDocuments(t, e, n, s, i) {\n        const r = [];\n        return e.forEach((t => {\n            r.push({\n                type: 0 /* ChangeType.Added */ ,\n                doc: t\n            });\n        })), new oc(t, e, ic.emptySet(e), r, n, s, \n        /* syncStateChanged= */ !0, \n        /* excludesMetadataChanges= */ !1, i);\n    }\n    get hasPendingWrites() {\n        return !this.mutatedKeys.isEmpty();\n    }\n    isEqual(t) {\n        if (!(this.fromCache === t.fromCache && this.hasCachedResults === t.hasCachedResults && this.syncStateChanged === t.syncStateChanged && this.mutatedKeys.isEqual(t.mutatedKeys) && In(this.query, t.query) && this.docs.isEqual(t.docs) && this.oldDocs.isEqual(t.oldDocs))) return !1;\n        const e = this.docChanges, n = t.docChanges;\n        if (e.length !== n.length) return !1;\n        for (let t = 0; t < e.length; t++) if (e[t].type !== n[t].type || !e[t].doc.isEqual(n[t].doc)) return !1;\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 * Holds the listeners and the last received ViewSnapshot for a query being\n * tracked by EventManager.\n */ class uc {\n    constructor() {\n        this.Au = void 0, this.listeners = [];\n    }\n}\n\nclass cc {\n    constructor() {\n        this.queries = new ls((t => Tn(t)), In), this.onlineState = \"Unknown\" /* OnlineState.Unknown */ , \n        this.Ru = new Set;\n    }\n}\n\nasync function ac(t, e) {\n    const n = $(t), s = e.query;\n    let i = !1, r = n.queries.get(s);\n    if (r || (i = !0, r = new uc), i) try {\n        r.Au = await n.onListen(s);\n    } catch (t) {\n        const n = sc(t, `Initialization of query '${En(e.query)}' failed`);\n        return void e.onError(n);\n    }\n    if (n.queries.set(s, r), r.listeners.push(e), \n    // Run global snapshot listeners if a consistent snapshot has been emitted.\n    e.bu(n.onlineState), r.Au) {\n        e.Pu(r.Au) && dc(n);\n    }\n}\n\nasync function hc(t, e) {\n    const n = $(t), s = e.query;\n    let i = !1;\n    const r = n.queries.get(s);\n    if (r) {\n        const t = r.listeners.indexOf(e);\n        t >= 0 && (r.listeners.splice(t, 1), i = 0 === r.listeners.length);\n    }\n    if (i) return n.queries.delete(s), n.onUnlisten(s);\n}\n\nfunction lc(t, e) {\n    const n = $(t);\n    let s = !1;\n    for (const t of e) {\n        const e = t.query, i = n.queries.get(e);\n        if (i) {\n            for (const e of i.listeners) e.Pu(t) && (s = !0);\n            i.Au = t;\n        }\n    }\n    s && dc(n);\n}\n\nfunction fc(t, e, n) {\n    const s = $(t), i = s.queries.get(e);\n    if (i) for (const t of i.listeners) t.onError(n);\n    // Remove all listeners. NOTE: We don't need to call syncEngine.unlisten()\n    // after an error.\n        s.queries.delete(e);\n}\n\n// Call all global snapshot listeners that have been set.\nfunction dc(t) {\n    t.Ru.forEach((t => {\n        t.next();\n    }));\n}\n\n/**\n * QueryListener takes a series of internal view snapshots and determines\n * when to raise the event.\n *\n * It uses an Observer to dispatch events.\n */ class _c {\n    constructor(t, e, n) {\n        this.query = t, this.vu = e, \n        /**\n         * Initial snapshots (e.g. from cache) may not be propagated to the wrapped\n         * observer. This flag is set to true once we've actually raised an event.\n         */\n        this.Vu = !1, this.Su = null, this.onlineState = \"Unknown\" /* OnlineState.Unknown */ , \n        this.options = n || {};\n    }\n    /**\n     * Applies the new ViewSnapshot to this listener, raising a user-facing event\n     * if applicable (depending on what changed, whether the user has opted into\n     * metadata-only changes, etc.). Returns true if a user-facing event was\n     * indeed raised.\n     */    Pu(t) {\n        if (!this.options.includeMetadataChanges) {\n            // Remove the metadata only changes.\n            const e = [];\n            for (const n of t.docChanges) 3 /* ChangeType.Metadata */ !== n.type && e.push(n);\n            t = new oc(t.query, t.docs, t.oldDocs, e, t.mutatedKeys, t.fromCache, t.syncStateChanged, \n            /* excludesMetadataChanges= */ !0, t.hasCachedResults);\n        }\n        let e = !1;\n        return this.Vu ? this.Du(t) && (this.vu.next(t), e = !0) : this.Cu(t, this.onlineState) && (this.xu(t), \n        e = !0), this.Su = t, e;\n    }\n    onError(t) {\n        this.vu.error(t);\n    }\n    /** Returns whether a snapshot was raised. */    bu(t) {\n        this.onlineState = t;\n        let e = !1;\n        return this.Su && !this.Vu && this.Cu(this.Su, t) && (this.xu(this.Su), e = !0), \n        e;\n    }\n    Cu(t, e) {\n        // Always raise the first event when we're synced\n        if (!t.fromCache) return !0;\n        // NOTE: We consider OnlineState.Unknown as online (it should become Offline\n        // or Online if we wait long enough).\n                const n = \"Offline\" /* OnlineState.Offline */ !== e;\n        // Don't raise the event if we're online, aren't synced yet (checked\n        // above) and are waiting for a sync.\n                return (!this.options.Nu || !n) && (!t.docs.isEmpty() || t.hasCachedResults || \"Offline\" /* OnlineState.Offline */ === e);\n        // Raise data from cache if we have any documents, have cached results before,\n        // or we are offline.\n        }\n    Du(t) {\n        // We don't need to handle includeDocumentMetadataChanges here because\n        // the Metadata only changes have already been stripped out if needed.\n        // At this point the only changes we will see are the ones we should\n        // propagate.\n        if (t.docChanges.length > 0) return !0;\n        const e = this.Su && this.Su.hasPendingWrites !== t.hasPendingWrites;\n        return !(!t.syncStateChanged && !e) && !0 === this.options.includeMetadataChanges;\n        // Generally we should have hit one of the cases above, but it's possible\n        // to get here if there were only metadata docChanges and they got\n        // stripped out.\n        }\n    xu(t) {\n        t = oc.fromInitialDocuments(t.query, t.docs, t.mutatedKeys, t.fromCache, t.hasCachedResults), \n        this.Vu = !0, this.vu.next(t);\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 complete element in the bundle stream, together with the byte length it\n * occupies in the stream.\n */ class wc {\n    constructor(t, \n    // How many bytes this element takes to store in the bundle.\n    e) {\n        this.ku = t, this.byteLength = e;\n    }\n    Ou() {\n        return \"metadata\" in this.ku;\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 * Helper to convert objects from bundles to model objects in the SDK.\n */ class mc {\n    constructor(t) {\n        this.yt = t;\n    }\n    Ji(t) {\n        return Qs(this.yt, t);\n    }\n    /**\n     * Converts a BundleDocument to a MutableDocument.\n     */    Yi(t) {\n        return t.metadata.exists ? Ys(this.yt, t.document, !1) : Ze.newNoDocument(this.Ji(t.metadata.name), this.Xi(t.metadata.readTime));\n    }\n    Xi(t) {\n        return qs(t);\n    }\n}\n\n/**\n * A class to process the elements from a bundle, load them into local\n * storage and provide progress update while loading.\n */ class gc {\n    constructor(t, e, n) {\n        this.Mu = t, this.localStore = e, this.yt = n, \n        /** Batched queries to be saved into storage */\n        this.queries = [], \n        /** Batched documents to be saved into storage */\n        this.documents = [], \n        /** The collection groups affected by this bundle. */\n        this.collectionGroups = new Set, this.progress = yc(t);\n    }\n    /**\n     * Adds an element from the bundle to the loader.\n     *\n     * Returns a new progress if adding the element leads to a new progress,\n     * otherwise returns null.\n     */    Fu(t) {\n        this.progress.bytesLoaded += t.byteLength;\n        let e = this.progress.documentsLoaded;\n        if (t.ku.namedQuery) this.queries.push(t.ku.namedQuery); else if (t.ku.documentMetadata) {\n            this.documents.push({\n                metadata: t.ku.documentMetadata\n            }), t.ku.documentMetadata.exists || ++e;\n            const n = rt.fromString(t.ku.documentMetadata.name);\n            this.collectionGroups.add(n.get(n.length - 2));\n        } else t.ku.document && (this.documents[this.documents.length - 1].document = t.ku.document, \n        ++e);\n        return e !== this.progress.documentsLoaded ? (this.progress.documentsLoaded = e, \n        Object.assign({}, this.progress)) : null;\n    }\n    $u(t) {\n        const e = new Map, n = new mc(this.yt);\n        for (const s of t) if (s.metadata.queries) {\n            const t = n.Ji(s.metadata.name);\n            for (const n of s.metadata.queries) {\n                const s = (e.get(n) || Es()).add(t);\n                e.set(n, s);\n            }\n        }\n        return e;\n    }\n    /**\n     * Update the progress to 'Success' and return the updated progress.\n     */    async complete() {\n        const t = await tu(this.localStore, new mc(this.yt), this.documents, this.Mu.id), e = this.$u(this.documents);\n        for (const t of this.queries) await eu(this.localStore, t, e.get(t.name));\n        return this.progress.taskState = \"Success\", {\n            progress: this.progress,\n            Bu: this.collectionGroups,\n            Lu: t\n        };\n    }\n}\n\n/**\n * Returns a `LoadBundleTaskProgress` representing the initial progress of\n * loading a bundle.\n */ function yc(t) {\n    return {\n        taskState: \"Running\",\n        documentsLoaded: 0,\n        bytesLoaded: 0,\n        totalDocuments: t.totalDocuments,\n        totalBytes: t.totalBytes\n    };\n}\n\n/**\n * Returns a `LoadBundleTaskProgress` representing the progress that the loading\n * has succeeded.\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 pc {\n    constructor(t) {\n        this.key = t;\n    }\n}\n\nclass Ic {\n    constructor(t) {\n        this.key = t;\n    }\n}\n\n/**\n * View is responsible for computing the final merged truth of what docs are in\n * a query. It gets notified of local and remote changes to docs, and applies\n * the query filters and limits to determine the most correct possible results.\n */ class Tc {\n    constructor(t, \n    /** Documents included in the remote target */\n    e) {\n        this.query = t, this.qu = e, this.Uu = null, this.hasCachedResults = !1, \n        /**\n         * A flag whether the view is current with the backend. A view is considered\n         * current after it has seen the current flag from the backend and did not\n         * lose consistency within the watch stream (e.g. because of an existence\n         * filter mismatch).\n         */\n        this.current = !1, \n        /** Documents in the view but not in the remote target */\n        this.Ku = Es(), \n        /** Document Keys that have local changes */\n        this.mutatedKeys = Es(), this.Gu = bn(t), this.Qu = new ic(this.Gu);\n    }\n    /**\n     * The set of remote documents that the server has told us belongs to the target associated with\n     * this view.\n     */    get ju() {\n        return this.qu;\n    }\n    /**\n     * Iterates over a set of doc changes, applies the query limit, and computes\n     * what the new results should be, what the changes were, and whether we may\n     * need to go back to the local cache for more results. Does not make any\n     * changes to the view.\n     * @param docChanges - The doc changes to apply to this view.\n     * @param previousChanges - If this is being called with a refill, then start\n     *        with this set of docs and changes instead of the current view.\n     * @returns a new set of docs, changes, and refill flag.\n     */    Wu(t, e) {\n        const n = e ? e.zu : new rc, s = e ? e.Qu : this.Qu;\n        let i = e ? e.mutatedKeys : this.mutatedKeys, r = s, o = !1;\n        // Track the last doc in a (full) limit. This is necessary, because some\n        // update (a delete, or an update moving a doc past the old limit) might\n        // mean there is some other document in the local cache that either should\n        // come (1) between the old last limit doc and the new last document, in the\n        // case of updates, or (2) after the new last document, in the case of\n        // deletes. So we keep this doc at the old limit to compare the updates to.\n        // Note that this should never get used in a refill (when previousChanges is\n        // set), because there will only be adds -- no deletes or updates.\n        const u = \"F\" /* LimitType.First */ === this.query.limitType && s.size === this.query.limit ? s.last() : null, c = \"L\" /* LimitType.Last */ === this.query.limitType && s.size === this.query.limit ? s.first() : null;\n        // Drop documents out to meet limit/limitToLast requirement.\n        if (t.inorderTraversal(((t, e) => {\n            const a = s.get(t), h = An(this.query, e) ? e : null, l = !!a && this.mutatedKeys.has(a.key), f = !!h && (h.hasLocalMutations || \n            // We only consider committed mutations for documents that were\n            // mutated during the lifetime of the view.\n            this.mutatedKeys.has(h.key) && h.hasCommittedMutations);\n            let d = !1;\n            // Calculate change\n                        if (a && h) {\n                a.data.isEqual(h.data) ? l !== f && (n.track({\n                    type: 3 /* ChangeType.Metadata */ ,\n                    doc: h\n                }), d = !0) : this.Hu(a, h) || (n.track({\n                    type: 2 /* ChangeType.Modified */ ,\n                    doc: h\n                }), d = !0, (u && this.Gu(h, u) > 0 || c && this.Gu(h, c) < 0) && (\n                // This doc moved from inside the limit to outside the limit.\n                // That means there may be some other doc in the local cache\n                // that should be included instead.\n                o = !0));\n            } else !a && h ? (n.track({\n                type: 0 /* ChangeType.Added */ ,\n                doc: h\n            }), d = !0) : a && !h && (n.track({\n                type: 1 /* ChangeType.Removed */ ,\n                doc: a\n            }), d = !0, (u || c) && (\n            // A doc was removed from a full limit query. We'll need to\n            // requery from the local cache to see if we know about some other\n            // doc that should be in the results.\n            o = !0));\n            d && (h ? (r = r.add(h), i = f ? i.add(t) : i.delete(t)) : (r = r.delete(t), i = i.delete(t)));\n        })), null !== this.query.limit) for (;r.size > this.query.limit; ) {\n            const t = \"F\" /* LimitType.First */ === this.query.limitType ? r.last() : r.first();\n            r = r.delete(t.key), i = i.delete(t.key), n.track({\n                type: 1 /* ChangeType.Removed */ ,\n                doc: t\n            });\n        }\n        return {\n            Qu: r,\n            zu: n,\n            $i: o,\n            mutatedKeys: i\n        };\n    }\n    Hu(t, e) {\n        // We suppress the initial change event for documents that were modified as\n        // part of a write acknowledgment (e.g. when the value of a server transform\n        // is applied) as Watch will send us the same document again.\n        // By suppressing the event, we only raise two user visible events (one with\n        // `hasPendingWrites` and the final state of the document) instead of three\n        // (one with `hasPendingWrites`, the modified document with\n        // `hasPendingWrites` and the final state of the document).\n        return t.hasLocalMutations && e.hasCommittedMutations && !e.hasLocalMutations;\n    }\n    /**\n     * Updates the view with the given ViewDocumentChanges and optionally updates\n     * limbo docs and sync state from the provided target change.\n     * @param docChanges - The set of changes to make to the view's docs.\n     * @param updateLimboDocuments - Whether to update limbo documents based on\n     *        this change.\n     * @param targetChange - A target change to apply for computing limbo docs and\n     *        sync state.\n     * @returns A new ViewChange with the given docs, changes, and sync state.\n     */\n    // PORTING NOTE: The iOS/Android clients always compute limbo document changes.\n    applyChanges(t, e, n) {\n        const s = this.Qu;\n        this.Qu = t.Qu, this.mutatedKeys = t.mutatedKeys;\n        // Sort changes based on type and query comparator\n        const i = t.zu.Eu();\n        i.sort(((t, e) => function(t, e) {\n            const n = t => {\n                switch (t) {\n                  case 0 /* ChangeType.Added */ :\n                    return 1;\n\n                  case 2 /* ChangeType.Modified */ :\n                  case 3 /* ChangeType.Metadata */ :\n                    // A metadata change is converted to a modified change at the public\n                    // api layer.  Since we sort by document key and then change type,\n                    // metadata and modified changes must be sorted equivalently.\n                    return 2;\n\n                  case 1 /* ChangeType.Removed */ :\n                    return 0;\n\n                  default:\n                    return O();\n                }\n            };\n            return n(t) - n(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 */ (t.type, e.type) || this.Gu(t.doc, e.doc))), this.Ju(n);\n        const r = e ? this.Yu() : [], o = 0 === this.Ku.size && this.current ? 1 /* SyncState.Synced */ : 0 /* SyncState.Local */ , u = o !== this.Uu;\n        if (this.Uu = o, 0 !== i.length || u) {\n            return {\n                snapshot: new oc(this.query, t.Qu, s, i, t.mutatedKeys, 0 /* SyncState.Local */ === o, u, \n                /* excludesMetadataChanges= */ !1, !!n && n.resumeToken.approximateByteSize() > 0),\n                Xu: r\n            };\n        }\n        // no changes\n        return {\n            Xu: r\n        };\n    }\n    /**\n     * Applies an OnlineState change to the view, potentially generating a\n     * ViewChange if the view's syncState changes as a result.\n     */    bu(t) {\n        return this.current && \"Offline\" /* OnlineState.Offline */ === t ? (\n        // If we're offline, set `current` to false and then call applyChanges()\n        // to refresh our syncState and generate a ViewChange as appropriate. We\n        // are guaranteed to get a new TargetChange that sets `current` back to\n        // true once the client is back online.\n        this.current = !1, this.applyChanges({\n            Qu: this.Qu,\n            zu: new rc,\n            mutatedKeys: this.mutatedKeys,\n            $i: !1\n        }, \n        /* updateLimboDocuments= */ !1)) : {\n            Xu: []\n        };\n    }\n    /**\n     * Returns whether the doc for the given key should be in limbo.\n     */    Zu(t) {\n        // If the remote end says it's part of this query, it's not in limbo.\n        return !this.qu.has(t) && (\n        // The local store doesn't think it's a result, so it shouldn't be in limbo.\n        !!this.Qu.has(t) && !this.Qu.get(t).hasLocalMutations);\n    }\n    /**\n     * Updates syncedDocuments, current, and limbo docs based on the given change.\n     * Returns the list of changes to which docs are in limbo.\n     */    Ju(t) {\n        t && (t.addedDocuments.forEach((t => this.qu = this.qu.add(t))), t.modifiedDocuments.forEach((t => {})), \n        t.removedDocuments.forEach((t => this.qu = this.qu.delete(t))), this.current = t.current);\n    }\n    Yu() {\n        // We can only determine limbo documents when we're in-sync with the server.\n        if (!this.current) return [];\n        // TODO(klimt): Do this incrementally so that it's not quadratic when\n        // updating many documents.\n                const t = this.Ku;\n        this.Ku = Es(), this.Qu.forEach((t => {\n            this.Zu(t.key) && (this.Ku = this.Ku.add(t.key));\n        }));\n        // Diff the new limbo docs with the old limbo docs.\n        const e = [];\n        return t.forEach((t => {\n            this.Ku.has(t) || e.push(new Ic(t));\n        })), this.Ku.forEach((n => {\n            t.has(n) || e.push(new pc(n));\n        })), e;\n    }\n    /**\n     * Update the in-memory state of the current view with the state read from\n     * persistence.\n     *\n     * We update the query view whenever a client's primary status changes:\n     * - When a client transitions from primary to secondary, it can miss\n     *   LocalStorage updates and its query views may temporarily not be\n     *   synchronized with the state on disk.\n     * - For secondary to primary transitions, the client needs to update the list\n     *   of `syncedDocuments` since secondary clients update their query views\n     *   based purely on synthesized RemoteEvents.\n     *\n     * @param queryResult.documents - The documents that match the query according\n     * to the LocalStore.\n     * @param queryResult.remoteKeys - The keys of the documents that match the\n     * query according to the backend.\n     *\n     * @returns The ViewChange that resulted from this synchronization.\n     */\n    // PORTING NOTE: Multi-tab only.\n    tc(t) {\n        this.qu = t.Hi, this.Ku = Es();\n        const e = this.Wu(t.documents);\n        return this.applyChanges(e, /*updateLimboDocuments=*/ !0);\n    }\n    /**\n     * Returns a view snapshot as if this query was just listened to. Contains\n     * a document add for every existing document and the `fromCache` and\n     * `hasPendingWrites` status of the already established view.\n     */\n    // PORTING NOTE: Multi-tab only.\n    ec() {\n        return oc.fromInitialDocuments(this.query, this.Qu, this.mutatedKeys, 0 /* SyncState.Local */ === this.Uu, this.hasCachedResults);\n    }\n}\n\n/**\n * QueryView contains all of the data that SyncEngine needs to keep track of for\n * a particular query.\n */\nclass Ec {\n    constructor(\n    /**\n     * The query itself.\n     */\n    t, \n    /**\n     * The target number created by the client that is used in the watch\n     * stream to identify this query.\n     */\n    e, \n    /**\n     * The view is responsible for computing the final merged truth of what\n     * docs are in the query. It gets notified of local and remote changes,\n     * and applies the query filters and limits to determine the most correct\n     * possible results.\n     */\n    n) {\n        this.query = t, this.targetId = e, this.view = n;\n    }\n}\n\n/** Tracks a limbo resolution. */ class Ac {\n    constructor(t) {\n        this.key = t, \n        /**\n         * Set to true once we've received a document. This is used in\n         * getRemoteKeysForTarget() and ultimately used by WatchChangeAggregator to\n         * decide whether it needs to manufacture a delete event for the target once\n         * the target is CURRENT.\n         */\n        this.nc = !1;\n    }\n}\n\n/**\n * An implementation of `SyncEngine` coordinating with other parts of SDK.\n *\n * The parts of SyncEngine that act as a callback to RemoteStore need to be\n * registered individually. This is done in `syncEngineWrite()` and\n * `syncEngineListen()` (as well as `applyPrimaryState()`) as these methods\n * serve as entry points to RemoteStore's functionality.\n *\n * Note: some field defined in this class might have public access level, but\n * the class is not exported so they are only accessible from this module.\n * This is useful to implement optional features (like bundles) in free\n * functions, such that they are tree-shakeable.\n */ class Rc {\n    constructor(t, e, n, \n    // PORTING NOTE: Manages state synchronization in multi-tab environments.\n    s, i, r) {\n        this.localStore = t, this.remoteStore = e, this.eventManager = n, this.sharedClientState = s, \n        this.currentUser = i, this.maxConcurrentLimboResolutions = r, this.sc = {}, this.ic = new ls((t => Tn(t)), In), \n        this.rc = new Map, \n        /**\n         * The keys of documents that are in limbo for which we haven't yet started a\n         * limbo resolution query. The strings in this set are the result of calling\n         * `key.path.canonicalString()` where `key` is a `DocumentKey` object.\n         *\n         * The `Set` type was chosen because it provides efficient lookup and removal\n         * of arbitrary elements and it also maintains insertion order, providing the\n         * desired queue-like FIFO semantics.\n         */\n        this.oc = new Set, \n        /**\n         * Keeps track of the target ID for each document that is in limbo with an\n         * active target.\n         */\n        this.uc = new Ge(ct.comparator), \n        /**\n         * Keeps track of the information about an active limbo resolution for each\n         * active target ID that was started for the purpose of limbo resolution.\n         */\n        this.cc = new Map, this.ac = new Eo, \n        /** Stores user completion handlers, indexed by User and BatchId. */\n        this.hc = {}, \n        /** Stores user callbacks waiting for all pending writes to be acknowledged. */\n        this.lc = new Map, this.fc = Yr.vn(), this.onlineState = \"Unknown\" /* OnlineState.Unknown */ , \n        // The primary state is set to `true` or `false` immediately after Firestore\n        // startup. In the interim, a client should only be considered primary if\n        // `isPrimary` is true.\n        this.dc = void 0;\n    }\n    get isPrimaryClient() {\n        return !0 === this.dc;\n    }\n}\n\n/**\n * Initiates the new listen, resolves promise when listen enqueued to the\n * server. All the subsequent view snapshots or errors are sent to the\n * subscribed handlers. Returns the initial snapshot.\n */\nasync function bc(t, e) {\n    const n = ta(t);\n    let s, i;\n    const r = n.ic.get(e);\n    if (r) \n    // PORTING NOTE: With Multi-Tab Web, it is possible that a query view\n    // already exists when EventManager calls us for the first time. This\n    // happens when the primary tab is already listening to this query on\n    // behalf of another tab and the user of the primary also starts listening\n    // to the query. EventManager will not have an assigned target ID in this\n    // case and calls `listen` to obtain this ID.\n    s = r.targetId, n.sharedClientState.addLocalQueryTarget(s), i = r.view.ec(); else {\n        const t = await zo(n.localStore, gn(e));\n        n.isPrimaryClient && Du(n.remoteStore, t);\n        const r = n.sharedClientState.addLocalQueryTarget(t.targetId);\n        s = t.targetId, i = await Pc(n, e, s, \"current\" === r, t.resumeToken);\n    }\n    return i;\n}\n\n/**\n * Registers a view for a previously unknown query and computes its initial\n * snapshot.\n */ async function Pc(t, e, n, s, i) {\n    // PORTING NOTE: On Web only, we inject the code that registers new Limbo\n    // targets based on view changes. This allows us to only depend on Limbo\n    // changes when user code includes queries.\n    t._c = (e, n, s) => async function(t, e, n, s) {\n        let i = e.view.Wu(n);\n        i.$i && (\n        // The query has a limit and some docs were removed, so we need\n        // to re-run the query against the local store to make sure we\n        // didn't lose any good docs that had been past the limit.\n        i = await Jo(t.localStore, e.query, \n        /* usePreviousResults= */ !1).then((({documents: t}) => e.view.Wu(t, i))));\n        const r = s && s.targetChanges.get(e.targetId), o = e.view.applyChanges(i, \n        /* updateLimboDocuments= */ t.isPrimaryClient, r);\n        return Bc(t, e.targetId, o.Xu), o.snapshot;\n    }(t, e, n, s);\n    const r = await Jo(t.localStore, e, \n    /* usePreviousResults= */ !0), o = new Tc(e, r.Hi), u = o.Wu(r.documents), c = Ps.createSynthesizedTargetChangeForCurrentChange(n, s && \"Offline\" /* OnlineState.Offline */ !== t.onlineState, i), a = o.applyChanges(u, \n    /* updateLimboDocuments= */ t.isPrimaryClient, c);\n    Bc(t, n, a.Xu);\n    const h = new Ec(e, n, o);\n    return t.ic.set(e, h), t.rc.has(n) ? t.rc.get(n).push(e) : t.rc.set(n, [ e ]), a.snapshot;\n}\n\n/** Stops listening to the query. */ async function vc(t, e) {\n    const n = $(t), s = n.ic.get(e), i = n.rc.get(s.targetId);\n    if (i.length > 1) return n.rc.set(s.targetId, i.filter((t => !In(t, e)))), void n.ic.delete(e);\n    // No other queries are mapped to the target, clean up the query and the target.\n        if (n.isPrimaryClient) {\n        // We need to remove the local query target first to allow us to verify\n        // whether any other client is still interested in this target.\n        n.sharedClientState.removeLocalQueryTarget(s.targetId);\n        n.sharedClientState.isActiveQueryTarget(s.targetId) || await Ho(n.localStore, s.targetId, \n        /*keepPersistedTargetData=*/ !1).then((() => {\n            n.sharedClientState.clearQueryState(s.targetId), Cu(n.remoteStore, s.targetId), \n            Fc(n, s.targetId);\n        })).catch(Et);\n    } else Fc(n, s.targetId), await Ho(n.localStore, s.targetId, \n    /*keepPersistedTargetData=*/ !0);\n}\n\n/**\n * Initiates the write of local mutation batch which involves adding the\n * writes to the mutation queue, notifying the remote store about new\n * mutations and raising events for any changes this write caused.\n *\n * The promise returned by this call is resolved when the above steps\n * have completed, *not* when the write was acked by the backend. The\n * userCallback is resolved once the write was acked/rejected by the\n * backend (or failed locally for any other reason).\n */ async function Vc(t, e, n) {\n    const s = ea(t);\n    try {\n        const t = await function(t, e) {\n            const n = $(t), s = nt.now(), i = e.reduce(((t, e) => t.add(e.key)), Es());\n            let r, o;\n            return n.persistence.runTransaction(\"Locally write mutations\", \"readwrite\", (t => {\n                // Figure out which keys do not have a remote version in the cache, this\n                // is needed to create the right overlay mutation: if no remote version\n                // presents, we do not need to create overlays as patch mutations.\n                // TODO(Overlay): Is there a better way to determine this? Using the\n                //  document version does not work because local mutations set them back\n                //  to 0.\n                let u = ds(), c = Es();\n                return n.Gi.getEntries(t, i).next((t => {\n                    u = t, u.forEach(((t, e) => {\n                        e.isValidDocument() || (c = c.add(t));\n                    }));\n                })).next((() => n.localDocuments.getOverlayedDocuments(t, u))).next((i => {\n                    r = i;\n                    // For non-idempotent mutations (such as `FieldValue.increment()`),\n                    // we record the base state in a separate patch mutation. This is\n                    // later used to guarantee consistent values and prevents flicker\n                    // even if the backend sends us an update that already includes our\n                    // transform.\n                    const o = [];\n                    for (const t of e) {\n                        const e = Yn(t, r.get(t.key).overlayedDocument);\n                        null != e && \n                        // NOTE: The base state should only be applied if there's some\n                        // existing document to override, so use a Precondition of\n                        // exists=true\n                        o.push(new ts(t.key, e, Xe(e.value.mapValue), Qn.exists(!0)));\n                    }\n                    return n.mutationQueue.addMutationBatch(t, s, o, e);\n                })).next((e => {\n                    o = e;\n                    const s = e.applyToLocalDocumentSet(r, c);\n                    return n.documentOverlayCache.saveOverlays(t, e.batchId, s);\n                }));\n            })).then((() => ({\n                batchId: o.batchId,\n                changes: ms(r)\n            })));\n        }(s.localStore, e);\n        s.sharedClientState.addPendingMutation(t.batchId), function(t, e, n) {\n            let s = t.hc[t.currentUser.toKey()];\n            s || (s = new Ge(Z));\n            s = s.insert(e, n), t.hc[t.currentUser.toKey()] = s;\n        }\n        /**\n * Resolves or rejects the user callback for the given batch and then discards\n * it.\n */ (s, t.batchId, n), await Uc(s, t.changes), await Ku(s.remoteStore);\n    } catch (t) {\n        // If we can't persist the mutation, we reject the user callback and\n        // don't send the mutation. The user can then retry the write.\n        const e = sc(t, \"Failed to persist write\");\n        n.reject(e);\n    }\n}\n\n/**\n * Applies one remote event to the sync engine, notifying any views of the\n * changes, and releasing any pending mutation batches that would become\n * visible because of the snapshot version the remote event contains.\n */ async function Sc(t, e) {\n    const n = $(t);\n    try {\n        const t = await Qo(n.localStore, e);\n        // Update `receivedDocument` as appropriate for any limbo targets.\n                e.targetChanges.forEach(((t, e) => {\n            const s = n.cc.get(e);\n            s && (\n            // Since this is a limbo resolution lookup, it's for a single document\n            // and it could be added, modified, or removed, but not a combination.\n            M(t.addedDocuments.size + t.modifiedDocuments.size + t.removedDocuments.size <= 1), \n            t.addedDocuments.size > 0 ? s.nc = !0 : t.modifiedDocuments.size > 0 ? M(s.nc) : t.removedDocuments.size > 0 && (M(s.nc), \n            s.nc = !1));\n        })), await Uc(n, t, e);\n    } catch (t) {\n        await Et(t);\n    }\n}\n\n/**\n * Applies an OnlineState change to the sync engine and notifies any views of\n * the change.\n */ function Dc(t, e, n) {\n    const s = $(t);\n    // If we are the secondary client, we explicitly ignore the remote store's\n    // online state (the local client may go offline, even though the primary\n    // tab remains online) and only apply the primary tab's online state from\n    // SharedClientState.\n        if (s.isPrimaryClient && 0 /* OnlineStateSource.RemoteStore */ === n || !s.isPrimaryClient && 1 /* OnlineStateSource.SharedClientState */ === n) {\n        const t = [];\n        s.ic.forEach(((n, s) => {\n            const i = s.view.bu(e);\n            i.snapshot && t.push(i.snapshot);\n        })), function(t, e) {\n            const n = $(t);\n            n.onlineState = e;\n            let s = !1;\n            n.queries.forEach(((t, n) => {\n                for (const t of n.listeners) \n                // Run global snapshot listeners if a consistent snapshot has been emitted.\n                t.bu(e) && (s = !0);\n            })), s && dc(n);\n        }(s.eventManager, e), t.length && s.sc.Wo(t), s.onlineState = e, s.isPrimaryClient && s.sharedClientState.setOnlineState(e);\n    }\n}\n\n/**\n * Rejects the listen for the given targetID. This can be triggered by the\n * backend for any active target.\n *\n * @param syncEngine - The sync engine implementation.\n * @param targetId - The targetID corresponds to one previously initiated by the\n * user as part of TargetData passed to listen() on RemoteStore.\n * @param err - A description of the condition that has forced the rejection.\n * Nearly always this will be an indication that the user is no longer\n * authorized to see the data matching the target.\n */ async function Cc(t, e, n) {\n    const s = $(t);\n    // PORTING NOTE: Multi-tab only.\n        s.sharedClientState.updateQueryState(e, \"rejected\", n);\n    const i = s.cc.get(e), r = i && i.key;\n    if (r) {\n        // TODO(klimt): We really only should do the following on permission\n        // denied errors, but we don't have the cause code here.\n        // It's a limbo doc. Create a synthetic event saying it was deleted.\n        // This is kind of a hack. Ideally, we would have a method in the local\n        // store to purge a document. However, it would be tricky to keep all of\n        // the local store's invariants with another method.\n        let t = new Ge(ct.comparator);\n        // TODO(b/217189216): This limbo document should ideally have a read time,\n        // so that it is picked up by any read-time based scans. The backend,\n        // however, does not send a read time for target removals.\n                t = t.insert(r, Ze.newNoDocument(r, st.min()));\n        const n = Es().add(r), i = new bs(st.min(), \n        /* targetChanges= */ new Map, \n        /* targetMismatches= */ new We(Z), t, n);\n        await Sc(s, i), \n        // Since this query failed, we won't want to manually unlisten to it.\n        // We only remove it from bookkeeping after we successfully applied the\n        // RemoteEvent. If `applyRemoteEvent()` throws, we want to re-listen to\n        // this query when the RemoteStore restarts the Watch stream, which should\n        // re-trigger the target failure.\n        s.uc = s.uc.remove(r), s.cc.delete(e), qc(s);\n    } else await Ho(s.localStore, e, \n    /* keepPersistedTargetData */ !1).then((() => Fc(s, e, n))).catch(Et);\n}\n\nasync function xc(t, e) {\n    const n = $(t), s = e.batch.batchId;\n    try {\n        const t = await Ko(n.localStore, e);\n        // The local store may or may not be able to apply the write result and\n        // raise events immediately (depending on whether the watcher is caught\n        // up), so we raise user callbacks first so that they consistently happen\n        // before listen events.\n                Mc(n, s, /*error=*/ null), Oc(n, s), n.sharedClientState.updateMutationState(s, \"acknowledged\"), \n        await Uc(n, t);\n    } catch (t) {\n        await Et(t);\n    }\n}\n\nasync function Nc(t, e, n) {\n    const s = $(t);\n    try {\n        const t = await function(t, e) {\n            const n = $(t);\n            return n.persistence.runTransaction(\"Reject batch\", \"readwrite-primary\", (t => {\n                let s;\n                return n.mutationQueue.lookupMutationBatch(t, e).next((e => (M(null !== e), s = e.keys(), \n                n.mutationQueue.removeMutationBatch(t, e)))).next((() => n.mutationQueue.performConsistencyCheck(t))).next((() => n.documentOverlayCache.removeOverlaysForBatchId(t, s, e))).next((() => n.localDocuments.recalculateAndSaveOverlaysForDocumentKeys(t, s))).next((() => n.localDocuments.getDocuments(t, s)));\n            }));\n        }\n        /**\n * Returns the largest (latest) batch id in mutation queue that is pending\n * server response.\n *\n * Returns `BATCHID_UNKNOWN` if the queue is empty.\n */ (s.localStore, e);\n        // The local store may or may not be able to apply the write result and\n        // raise events immediately (depending on whether the watcher is caught up),\n        // so we raise user callbacks first so that they consistently happen before\n        // listen events.\n                Mc(s, e, n), Oc(s, e), s.sharedClientState.updateMutationState(e, \"rejected\", n), \n        await Uc(s, t);\n    } catch (n) {\n        await Et(n);\n    }\n}\n\n/**\n * Registers a user callback that resolves when all pending mutations at the moment of calling\n * are acknowledged .\n */ async function kc(t, e) {\n    const n = $(t);\n    Mu(n.remoteStore) || C(\"SyncEngine\", \"The network is disabled. The task returned by 'awaitPendingWrites()' will not complete until the network is enabled.\");\n    try {\n        const t = await function(t) {\n            const e = $(t);\n            return e.persistence.runTransaction(\"Get highest unacknowledged batch id\", \"readonly\", (t => e.mutationQueue.getHighestUnacknowledgedBatchId(t)));\n        }(n.localStore);\n        if (-1 === t) \n        // Trigger the callback right away if there is no pending writes at the moment.\n        return void e.resolve();\n        const s = n.lc.get(t) || [];\n        s.push(e), n.lc.set(t, s);\n    } catch (t) {\n        const n = sc(t, \"Initialization of waitForPendingWrites() operation failed\");\n        e.reject(n);\n    }\n}\n\n/**\n * Triggers the callbacks that are waiting for this batch id to get acknowledged by server,\n * if there are any.\n */ function Oc(t, e) {\n    (t.lc.get(e) || []).forEach((t => {\n        t.resolve();\n    })), t.lc.delete(e);\n}\n\n/** Reject all outstanding callbacks waiting for pending writes to complete. */ function Mc(t, e, n) {\n    const s = $(t);\n    let i = s.hc[s.currentUser.toKey()];\n    // NOTE: Mutations restored from persistence won't have callbacks, so it's\n    // okay for there to be no callback for this ID.\n        if (i) {\n        const t = i.get(e);\n        t && (n ? t.reject(n) : t.resolve(), i = i.remove(e)), s.hc[s.currentUser.toKey()] = i;\n    }\n}\n\nfunction Fc(t, e, n = null) {\n    t.sharedClientState.removeLocalQueryTarget(e);\n    for (const s of t.rc.get(e)) t.ic.delete(s), n && t.sc.wc(s, n);\n    if (t.rc.delete(e), t.isPrimaryClient) {\n        t.ac.ls(e).forEach((e => {\n            t.ac.containsKey(e) || \n            // We removed the last reference for this key\n            $c(t, e);\n        }));\n    }\n}\n\nfunction $c(t, e) {\n    t.oc.delete(e.path.canonicalString());\n    // It's possible that the target already got removed because the query failed. In that case,\n    // the key won't exist in `limboTargetsByKey`. Only do the cleanup if we still have the target.\n    const n = t.uc.get(e);\n    null !== n && (Cu(t.remoteStore, n), t.uc = t.uc.remove(e), t.cc.delete(n), qc(t));\n}\n\nfunction Bc(t, e, n) {\n    for (const s of n) if (s instanceof pc) t.ac.addReference(s.key, e), Lc(t, s); else if (s instanceof Ic) {\n        C(\"SyncEngine\", \"Document no longer in limbo: \" + s.key), t.ac.removeReference(s.key, e);\n        t.ac.containsKey(s.key) || \n        // We removed the last reference for this key\n        $c(t, s.key);\n    } else O();\n}\n\nfunction Lc(t, e) {\n    const n = e.key, s = n.path.canonicalString();\n    t.uc.get(n) || t.oc.has(s) || (C(\"SyncEngine\", \"New document in limbo: \" + n), t.oc.add(s), \n    qc(t));\n}\n\n/**\n * Starts listens for documents in limbo that are enqueued for resolution,\n * subject to a maximum number of concurrent resolutions.\n *\n * Without bounding the number of concurrent resolutions, the server can fail\n * with \"resource exhausted\" errors which can lead to pathological client\n * behavior as seen in https://github.com/firebase/firebase-js-sdk/issues/2683.\n */ function qc(t) {\n    for (;t.oc.size > 0 && t.uc.size < t.maxConcurrentLimboResolutions; ) {\n        const e = t.oc.values().next().value;\n        t.oc.delete(e);\n        const n = new ct(rt.fromString(e)), s = t.fc.next();\n        t.cc.set(s, new Ac(n)), t.uc = t.uc.insert(n, s), Du(t.remoteStore, new zi(gn(ln(n.path)), s, 2 /* TargetPurpose.LimboResolution */ , Ot.at));\n    }\n}\n\nasync function Uc(t, e, n) {\n    const s = $(t), i = [], r = [], o = [];\n    s.ic.isEmpty() || (s.ic.forEach(((t, u) => {\n        o.push(s._c(u, e, n).then((t => {\n            // Update views if there are actual changes.\n            if (\n            // If there are changes, or we are handling a global snapshot, notify\n            // secondary clients to update query state.\n            (t || n) && s.isPrimaryClient && s.sharedClientState.updateQueryState(u.targetId, (null == t ? void 0 : t.fromCache) ? \"not-current\" : \"current\"), \n            t) {\n                i.push(t);\n                const e = $o.Ci(u.targetId, t);\n                r.push(e);\n            }\n        })));\n    })), await Promise.all(o), s.sc.Wo(i), await async function(t, e) {\n        const n = $(t);\n        try {\n            await n.persistence.runTransaction(\"notifyLocalViewChanges\", \"readwrite\", (t => At.forEach(e, (e => At.forEach(e.Si, (s => n.persistence.referenceDelegate.addReference(t, e.targetId, s))).next((() => At.forEach(e.Di, (s => n.persistence.referenceDelegate.removeReference(t, e.targetId, s)))))))));\n        } catch (t) {\n            if (!Vt(t)) throw t;\n            // If `notifyLocalViewChanges` fails, we did not advance the sequence\n            // number for the documents that were included in this transaction.\n            // This might trigger them to be deleted earlier than they otherwise\n            // would have, but it should not invalidate the integrity of the data.\n            C(\"LocalStore\", \"Failed to update sequence numbers: \" + t);\n        }\n        for (const t of e) {\n            const e = t.targetId;\n            if (!t.fromCache) {\n                const t = n.qi.get(e), s = t.snapshotVersion, i = t.withLastLimboFreeSnapshotVersion(s);\n                // Advance the last limbo free snapshot version\n                                n.qi = n.qi.insert(e, i);\n            }\n        }\n    }(s.localStore, r));\n}\n\nasync function Kc(t, e) {\n    const n = $(t);\n    if (!n.currentUser.isEqual(e)) {\n        C(\"SyncEngine\", \"User change. New user:\", e.toKey());\n        const t = await Uo(n.localStore, e);\n        n.currentUser = e, \n        // Fails tasks waiting for pending writes requested by previous user.\n        function(t, e) {\n            t.lc.forEach((t => {\n                t.forEach((t => {\n                    t.reject(new L(B.CANCELLED, e));\n                }));\n            })), t.lc.clear();\n        }(n, \"'waitForPendingWrites' promise is rejected due to a user change.\"), \n        // TODO(b/114226417): Consider calling this only in the primary tab.\n        n.sharedClientState.handleUserChange(e, t.removedBatchIds, t.addedBatchIds), await Uc(n, t.ji);\n    }\n}\n\nfunction Gc(t, e) {\n    const n = $(t), s = n.cc.get(e);\n    if (s && s.nc) return Es().add(s.key);\n    {\n        let t = Es();\n        const s = n.rc.get(e);\n        if (!s) return t;\n        for (const e of s) {\n            const s = n.ic.get(e);\n            t = t.unionWith(s.view.ju);\n        }\n        return t;\n    }\n}\n\n/**\n * Reconcile the list of synced documents in an existing view with those\n * from persistence.\n */ async function Qc(t, e) {\n    const n = $(t), s = await Jo(n.localStore, e.query, \n    /* usePreviousResults= */ !0), i = e.view.tc(s);\n    return n.isPrimaryClient && Bc(n, e.targetId, i.Xu), i;\n}\n\n/**\n * Retrieves newly changed documents from remote document cache and raises\n * snapshots if needed.\n */\n// PORTING NOTE: Multi-Tab only.\nasync function jc(t, e) {\n    const n = $(t);\n    return Xo(n.localStore, e).then((t => Uc(n, t)));\n}\n\n/** Applies a mutation state to an existing batch.  */\n// PORTING NOTE: Multi-Tab only.\nasync function Wc(t, e, n, s) {\n    const i = $(t), r = await function(t, e) {\n        const n = $(t), s = $(n.mutationQueue);\n        return n.persistence.runTransaction(\"Lookup mutation documents\", \"readonly\", (t => s.Tn(t, e).next((e => e ? n.localDocuments.getDocuments(t, e) : At.resolve(null)))));\n    }\n    // PORTING NOTE: Multi-Tab only.\n    (i.localStore, e);\n    null !== r ? (\"pending\" === n ? \n    // If we are the primary client, we need to send this write to the\n    // backend. Secondary clients will ignore these writes since their remote\n    // connection is disabled.\n    await Ku(i.remoteStore) : \"acknowledged\" === n || \"rejected\" === n ? (\n    // NOTE: Both these methods are no-ops for batches that originated from\n    // other clients.\n    Mc(i, e, s || null), Oc(i, e), function(t, e) {\n        $($(t).mutationQueue).An(e);\n    }\n    // PORTING NOTE: Multi-Tab only.\n    (i.localStore, e)) : O(), await Uc(i, r)) : \n    // A throttled tab may not have seen the mutation before it was completed\n    // and removed from the mutation queue, in which case we won't have cached\n    // the affected documents. In this case we can safely ignore the update\n    // since that means we didn't apply the mutation locally at all (if we\n    // had, we would have cached the affected documents), and so we will just\n    // see any resulting document changes via normal remote document updates\n    // as applicable.\n    C(\"SyncEngine\", \"Cannot apply mutation batch with id: \" + e);\n}\n\n/** Applies a query target change from a different tab. */\n// PORTING NOTE: Multi-Tab only.\nasync function zc(t, e) {\n    const n = $(t);\n    if (ta(n), ea(n), !0 === e && !0 !== n.dc) {\n        // Secondary tabs only maintain Views for their local listeners and the\n        // Views internal state may not be 100% populated (in particular\n        // secondary tabs don't track syncedDocuments, the set of documents the\n        // server considers to be in the target). So when a secondary becomes\n        // primary, we need to need to make sure that all views for all targets\n        // match the state on disk.\n        const t = n.sharedClientState.getAllActiveQueryTargets(), e = await Hc(n, t.toArray());\n        n.dc = !0, await Zu(n.remoteStore, !0);\n        for (const t of e) Du(n.remoteStore, t);\n    } else if (!1 === e && !1 !== n.dc) {\n        const t = [];\n        let e = Promise.resolve();\n        n.rc.forEach(((s, i) => {\n            n.sharedClientState.isLocalQueryTarget(i) ? t.push(i) : e = e.then((() => (Fc(n, i), \n            Ho(n.localStore, i, \n            /*keepPersistedTargetData=*/ !0)))), Cu(n.remoteStore, i);\n        })), await e, await Hc(n, t), \n        // PORTING NOTE: Multi-Tab only.\n        function(t) {\n            const e = $(t);\n            e.cc.forEach(((t, n) => {\n                Cu(e.remoteStore, n);\n            })), e.ac.fs(), e.cc = new Map, e.uc = new Ge(ct.comparator);\n        }\n        /**\n * Reconcile the query views of the provided query targets with the state from\n * persistence. Raises snapshots for any changes that affect the local\n * client and returns the updated state of all target's query data.\n *\n * @param syncEngine - The sync engine implementation\n * @param targets - the list of targets with views that need to be recomputed\n * @param transitionToPrimary - `true` iff the tab transitions from a secondary\n * tab to a primary tab\n */\n        // PORTING NOTE: Multi-Tab only.\n        (n), n.dc = !1, await Zu(n.remoteStore, !1);\n    }\n}\n\nasync function Hc(t, e, n) {\n    const s = $(t), i = [], r = [];\n    for (const t of e) {\n        let e;\n        const n = s.rc.get(t);\n        if (n && 0 !== n.length) {\n            // For queries that have a local View, we fetch their current state\n            // from LocalStore (as the resume token and the snapshot version\n            // might have changed) and reconcile their views with the persisted\n            // state (the list of syncedDocuments may have gotten out of sync).\n            e = await zo(s.localStore, gn(n[0]));\n            for (const t of n) {\n                const e = s.ic.get(t), n = await Qc(s, e);\n                n.snapshot && r.push(n.snapshot);\n            }\n        } else {\n            // For queries that never executed on this client, we need to\n            // allocate the target in LocalStore and initialize a new View.\n            const n = await Yo(s.localStore, t);\n            e = await zo(s.localStore, n), await Pc(s, Jc(n), t, \n            /*current=*/ !1, e.resumeToken);\n        }\n        i.push(e);\n    }\n    return s.sc.Wo(r), i;\n}\n\n/**\n * Creates a `Query` object from the specified `Target`. There is no way to\n * obtain the original `Query`, so we synthesize a `Query` from the `Target`\n * object.\n *\n * The synthesized result might be different from the original `Query`, but\n * since the synthesized `Query` should return the same results as the\n * original one (only the presentation of results might differ), the potential\n * difference will not cause issues.\n */\n// PORTING NOTE: Multi-Tab only.\nfunction Jc(t) {\n    return hn(t.path, t.collectionGroup, t.orderBy, t.filters, t.limit, \"F\" /* LimitType.First */ , t.startAt, t.endAt);\n}\n\n/** Returns the IDs of the clients that are currently active. */\n// PORTING NOTE: Multi-Tab only.\nfunction Yc(t) {\n    const e = $(t);\n    return $($(e.localStore).persistence).vi();\n}\n\n/** Applies a query target change from a different tab. */\n// PORTING NOTE: Multi-Tab only.\nasync function Xc(t, e, n, s) {\n    const i = $(t);\n    if (i.dc) \n    // If we receive a target state notification via WebStorage, we are\n    // either already secondary or another tab has taken the primary lease.\n    return void C(\"SyncEngine\", \"Ignoring unexpected query state notification.\");\n    const r = i.rc.get(e);\n    if (r && r.length > 0) switch (n) {\n      case \"current\":\n      case \"not-current\":\n        {\n            const t = await Xo(i.localStore, Rn(r[0])), s = bs.createSynthesizedRemoteEventForCurrentChange(e, \"current\" === n, Qt.EMPTY_BYTE_STRING);\n            await Uc(i, t, s);\n            break;\n        }\n\n      case \"rejected\":\n        await Ho(i.localStore, e, \n        /* keepPersistedTargetData */ !0), Fc(i, e, s);\n        break;\n\n      default:\n        O();\n    }\n}\n\n/** Adds or removes Watch targets for queries from different tabs. */ async function Zc(t, e, n) {\n    const s = ta(t);\n    if (s.dc) {\n        for (const t of e) {\n            if (s.rc.has(t)) {\n                // A target might have been added in a previous attempt\n                C(\"SyncEngine\", \"Adding an already active target \" + t);\n                continue;\n            }\n            const e = await Yo(s.localStore, t), n = await zo(s.localStore, e);\n            await Pc(s, Jc(e), n.targetId, \n            /*current=*/ !1, n.resumeToken), Du(s.remoteStore, n);\n        }\n        for (const t of n) \n        // Check that the target is still active since the target might have been\n        // removed if it has been rejected by the backend.\n        s.rc.has(t) && \n        // Release queries that are still active.\n        await Ho(s.localStore, t, \n        /* keepPersistedTargetData */ !1).then((() => {\n            Cu(s.remoteStore, t), Fc(s, t);\n        })).catch(Et);\n    }\n}\n\nfunction ta(t) {\n    const e = $(t);\n    return e.remoteStore.remoteSyncer.applyRemoteEvent = Sc.bind(null, e), e.remoteStore.remoteSyncer.getRemoteKeysForTarget = Gc.bind(null, e), \n    e.remoteStore.remoteSyncer.rejectListen = Cc.bind(null, e), e.sc.Wo = lc.bind(null, e.eventManager), \n    e.sc.wc = fc.bind(null, e.eventManager), e;\n}\n\nfunction ea(t) {\n    const e = $(t);\n    return e.remoteStore.remoteSyncer.applySuccessfulWrite = xc.bind(null, e), e.remoteStore.remoteSyncer.rejectFailedWrite = Nc.bind(null, e), \n    e;\n}\n\n/**\n * Loads a Firestore bundle into the SDK. The returned promise resolves when\n * the bundle finished loading.\n *\n * @param syncEngine - SyncEngine to use.\n * @param bundleReader - Bundle to load into the SDK.\n * @param task - LoadBundleTask used to update the loading progress to public API.\n */ function na(t, e, n) {\n    const s = $(t);\n    // eslint-disable-next-line @typescript-eslint/no-floating-promises\n        (\n    /** Loads a bundle and returns the list of affected collection groups. */\n    async function(t, e, n) {\n        try {\n            const s = await e.getMetadata();\n            if (await function(t, e) {\n                const n = $(t), s = qs(e.createTime);\n                return n.persistence.runTransaction(\"hasNewerBundle\", \"readonly\", (t => n.Ns.getBundleMetadata(t, e.id))).then((t => !!t && t.createTime.compareTo(s) >= 0));\n            }\n            /**\n * Saves the given `BundleMetadata` to local persistence.\n */ (t.localStore, s)) return await e.close(), n._completeWith(function(t) {\n                return {\n                    taskState: \"Success\",\n                    documentsLoaded: t.totalDocuments,\n                    bytesLoaded: t.totalBytes,\n                    totalDocuments: t.totalDocuments,\n                    totalBytes: t.totalBytes\n                };\n            }(s)), Promise.resolve(new Set);\n            n._updateProgress(yc(s));\n            const i = new gc(s, t.localStore, e.yt);\n            let r = await e.mc();\n            for (;r; ) {\n                const t = await i.Fu(r);\n                t && n._updateProgress(t), r = await e.mc();\n            }\n            const o = await i.complete();\n            return await Uc(t, o.Lu, \n            /* remoteEvent */ void 0), \n            // Save metadata, so loading the same bundle will skip.\n            await function(t, e) {\n                const n = $(t);\n                return n.persistence.runTransaction(\"Save bundle\", \"readwrite\", (t => n.Ns.saveBundleMetadata(t, e)));\n            }\n            /**\n * Returns a promise of a `NamedQuery` associated with given query name. Promise\n * resolves to undefined if no persisted data can be found.\n */ (t.localStore, s), n._completeWith(o.progress), Promise.resolve(o.Bu);\n        } catch (t) {\n            return N(\"SyncEngine\", `Loading bundle failed with ${t}`), n._failWith(t), Promise.resolve(new Set);\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 all components needed for Firestore with in-memory persistence.\n * Uses EagerGC garbage collection.\n */)(s, e, n).then((t => {\n        s.sharedClientState.notifyBundleLoaded(t);\n    }));\n}\n\nclass sa {\n    constructor() {\n        this.synchronizeTabs = !1;\n    }\n    async initialize(t) {\n        this.yt = pu(t.databaseInfo.databaseId), this.sharedClientState = this.gc(t), this.persistence = this.yc(t), \n        await this.persistence.start(), this.localStore = this.Ic(t), this.gcScheduler = this.Tc(t, this.localStore), \n        this.indexBackfillerScheduler = this.Ec(t, this.localStore);\n    }\n    Tc(t, e) {\n        return null;\n    }\n    Ec(t, e) {\n        return null;\n    }\n    Ic(t) {\n        return qo(this.persistence, new Bo, t.initialUser, this.yt);\n    }\n    yc(t) {\n        return new Vo(Do.Bs, this.yt);\n    }\n    gc(t) {\n        return new lu;\n    }\n    async terminate() {\n        this.gcScheduler && this.gcScheduler.stop(), await this.sharedClientState.shutdown(), \n        await this.persistence.shutdown();\n    }\n}\n\n/**\n * Provides all components needed for Firestore with IndexedDB persistence.\n */ class ia extends sa {\n    constructor(t, e, n) {\n        super(), this.Ac = t, this.cacheSizeBytes = e, this.forceOwnership = n, this.synchronizeTabs = !1;\n    }\n    async initialize(t) {\n        await super.initialize(t), await this.Ac.initialize(this, t), \n        // Enqueue writes from a previous session\n        await ea(this.Ac.syncEngine), await Ku(this.Ac.remoteStore), \n        // NOTE: This will immediately call the listener, so we make sure to\n        // set it after localStore / remoteStore are started.\n        await this.persistence.li((() => (this.gcScheduler && !this.gcScheduler.started && this.gcScheduler.start(), \n        this.indexBackfillerScheduler && !this.indexBackfillerScheduler.started && this.indexBackfillerScheduler.start(), \n        Promise.resolve())));\n    }\n    Ic(t) {\n        return qo(this.persistence, new Bo, t.initialUser, this.yt);\n    }\n    Tc(t, e) {\n        const n = this.persistence.referenceDelegate.garbageCollector;\n        return new io(n, t.asyncQueue, e);\n    }\n    Ec(t, e) {\n        const n = new kt(e, this.persistence);\n        return new Nt(t.asyncQueue, n);\n    }\n    yc(t) {\n        const e = Fo(t.databaseInfo.databaseId, t.databaseInfo.persistenceKey), n = void 0 !== this.cacheSizeBytes ? Kr.withCacheSize(this.cacheSizeBytes) : Kr.DEFAULT;\n        return new ko(this.synchronizeTabs, e, t.clientId, n, t.asyncQueue, gu(), yu(), this.yt, this.sharedClientState, !!this.forceOwnership);\n    }\n    gc(t) {\n        return new lu;\n    }\n}\n\n/**\n * Provides all components needed for Firestore with multi-tab IndexedDB\n * persistence.\n *\n * In the legacy client, this provider is used to provide both multi-tab and\n * non-multi-tab persistence since we cannot tell at build time whether\n * `synchronizeTabs` will be enabled.\n */ class ra extends ia {\n    constructor(t, e) {\n        super(t, e, /* forceOwnership= */ !1), this.Ac = t, this.cacheSizeBytes = e, this.synchronizeTabs = !0;\n    }\n    async initialize(t) {\n        await super.initialize(t);\n        const e = this.Ac.syncEngine;\n        this.sharedClientState instanceof hu && (this.sharedClientState.syncEngine = {\n            Fr: Wc.bind(null, e),\n            $r: Xc.bind(null, e),\n            Br: Zc.bind(null, e),\n            vi: Yc.bind(null, e),\n            Mr: jc.bind(null, e)\n        }, await this.sharedClientState.start()), \n        // NOTE: This will immediately call the listener, so we make sure to\n        // set it after localStore / remoteStore are started.\n        await this.persistence.li((async t => {\n            await zc(this.Ac.syncEngine, t), this.gcScheduler && (t && !this.gcScheduler.started ? this.gcScheduler.start() : t || this.gcScheduler.stop()), \n            this.indexBackfillerScheduler && (t && !this.indexBackfillerScheduler.started ? this.indexBackfillerScheduler.start() : t || this.indexBackfillerScheduler.stop());\n        }));\n    }\n    gc(t) {\n        const e = gu();\n        if (!hu.C(e)) throw new L(B.UNIMPLEMENTED, \"IndexedDB persistence is only available on platforms that support LocalStorage.\");\n        const n = Fo(t.databaseInfo.databaseId, t.databaseInfo.persistenceKey);\n        return new hu(e, t.asyncQueue, n, t.clientId, t.initialUser);\n    }\n}\n\n/**\n * Initializes and wires the components that are needed to interface with the\n * network.\n */ class oa {\n    async initialize(t, e) {\n        this.localStore || (this.localStore = t.localStore, this.sharedClientState = t.sharedClientState, \n        this.datastore = this.createDatastore(e), this.remoteStore = this.createRemoteStore(e), \n        this.eventManager = this.createEventManager(e), this.syncEngine = this.createSyncEngine(e, \n        /* startAsPrimary=*/ !t.synchronizeTabs), this.sharedClientState.onlineStateHandler = t => Dc(this.syncEngine, t, 1 /* OnlineStateSource.SharedClientState */), \n        this.remoteStore.remoteSyncer.handleCredentialChange = Kc.bind(null, this.syncEngine), \n        await Zu(this.remoteStore, this.syncEngine.isPrimaryClient));\n    }\n    createEventManager(t) {\n        return new cc;\n    }\n    createDatastore(t) {\n        const e = pu(t.databaseInfo.databaseId), n = (s = t.databaseInfo, new mu(s));\n        var s;\n        /** Return the Platform-specific connectivity monitor. */        return function(t, e, n, s) {\n            return new Ru(t, e, n, s);\n        }(t.authCredentials, t.appCheckCredentials, n, e);\n    }\n    createRemoteStore(t) {\n        return e = this.localStore, n = this.datastore, s = t.asyncQueue, i = t => Dc(this.syncEngine, t, 0 /* OnlineStateSource.RemoteStore */), \n        r = du.C() ? new du : new fu, new vu(e, n, s, i, r);\n        var e, n, s, i, r;\n        /** Re-enables the network. Idempotent. */    }\n    createSyncEngine(t, e) {\n        return function(t, e, n, \n        // PORTING NOTE: Manages state synchronization in multi-tab environments.\n        s, i, r, o) {\n            const u = new Rc(t, e, n, s, i, r);\n            return o && (u.dc = !0), u;\n        }(this.localStore, this.remoteStore, this.eventManager, this.sharedClientState, t.initialUser, t.maxConcurrentLimboResolutions, e);\n    }\n    terminate() {\n        return async function(t) {\n            const e = $(t);\n            C(\"RemoteStore\", \"RemoteStore shutting down.\"), e._u.add(5 /* OfflineCause.Shutdown */), \n            await Su(e), e.mu.shutdown(), \n            // Set the OnlineState to Unknown (rather than Offline) to avoid potentially\n            // triggering spurious listener events with cached data, etc.\n            e.gu.set(\"Unknown\" /* OnlineState.Unknown */);\n        }(this.remoteStore);\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 ua(t, e, n) {\n    if (!n) throw new L(B.INVALID_ARGUMENT, `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 */ function ca(t, e, n, s) {\n    if (!0 === e && !0 === s) throw new L(B.INVALID_ARGUMENT, `${t} and ${n} cannot be used together.`);\n}\n\n/**\n * Validates that `path` refers to a document (indicated by the fact it contains\n * an even numbers of segments).\n */ function aa(t) {\n    if (!ct.isDocumentKey(t)) throw new L(B.INVALID_ARGUMENT, `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 ha(t) {\n    if (ct.isDocumentKey(t)) throw new L(B.INVALID_ARGUMENT, `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 la(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\" : O();\n}\n\nfunction fa(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 L(B.INVALID_ARGUMENT, \"Type does not match the expected instance. Did you pass a reference from a different Firestore SDK?\");\n        {\n            const n = la(t);\n            throw new L(B.INVALID_ARGUMENT, `Expected type '${e.name}', but it was: ${n}`);\n        }\n    }\n    return t;\n}\n\nfunction da(t, e) {\n    if (e <= 0) throw new L(B.INVALID_ARGUMENT, `Function ${t}() requires a positive number, but it was: ${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 */ const _a = new Map;\n\n/**\n * An instance map that ensures only one Datastore exists per Firestore\n * instance.\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 wa {\n    constructor(t) {\n        var e;\n        if (void 0 === t.host) {\n            if (void 0 !== t.ssl) throw new L(B.INVALID_ARGUMENT, \"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        void 0 === t.cacheSizeBytes) this.cacheSizeBytes = 41943040; else {\n            if (-1 !== t.cacheSizeBytes && t.cacheSizeBytes < 1048576) throw new L(B.INVALID_ARGUMENT, \"cacheSizeBytes must be at least 1048576\");\n            this.cacheSizeBytes = t.cacheSizeBytes;\n        }\n        this.experimentalForceLongPolling = !!t.experimentalForceLongPolling, this.experimentalAutoDetectLongPolling = !!t.experimentalAutoDetectLongPolling, \n        this.useFetchStreams = !!t.useFetchStreams, ca(\"experimentalForceLongPolling\", t.experimentalForceLongPolling, \"experimentalAutoDetectLongPolling\", t.experimentalAutoDetectLongPolling);\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 && this.ignoreUndefinedProperties === t.ignoreUndefinedProperties && this.useFetchStreams === t.useFetchStreams;\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 * The Cloud Firestore service interface.\n *\n * Do not call this constructor directly. Instead, use {@link (getFirestore:1)}.\n */ class ma {\n    /** @hideconstructor */\n    constructor(t, e, n, s) {\n        this._authCredentials = t, this._appCheckCredentials = e, this._databaseId = n, \n        this._app = s, \n        /**\n         * Whether it's a Firestore or Firestore Lite instance.\n         */\n        this.type = \"firestore-lite\", this._persistenceKey = \"(lite)\", this._settings = new wa({}), \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 L(B.FAILED_PRECONDITION, \"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 L(B.FAILED_PRECONDITION, \"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 wa(t), void 0 !== t.credentials && (this._authCredentials = function(t) {\n            if (!t) return new K;\n            switch (t.type) {\n              case \"gapi\":\n                const e = t.client;\n                return new W(e, t.sessionIndex || \"0\", t.iamToken || null, t.authTokenFactory || null);\n\n              case \"provider\":\n                return t.client;\n\n              default:\n                throw new L(B.INVALID_ARGUMENT, \"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        /**\n * Removes all components associated with the provided instance. Must be called\n * when the `Firestore` instance is terminated.\n */\n        return function(t) {\n            const e = _a.get(t);\n            e && (C(\"ComponentProvider\", \"Removing Datastore\"), _a.delete(t), e.terminate());\n        }(this), Promise.resolve();\n    }\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 ga(t, e, n, s = {}) {\n    var i;\n    const r = (t = fa(t, ma))._getSettings();\n    if (\"firestore.googleapis.com\" !== r.host && r.host !== e && N(\"Host has been set in both settings() and useEmulator(), emulator host will be used\"), \n    t._setSettings(Object.assign(Object.assign({}, r), {\n        host: `${e}:${n}`,\n        ssl: !1\n    })), s.mockUserToken) {\n        let e, n;\n        if (\"string\" == typeof s.mockUserToken) e = s.mockUserToken, n = P.MOCK_USER; else {\n            // Let createMockUserToken validate first (catches common mistakes like\n            // invalid field \"uid\" and missing field \"sub\" / \"user_id\".)\n            e = f(s.mockUserToken, null === (i = t._app) || void 0 === i ? void 0 : i.options.projectId);\n            const r = s.mockUserToken.sub || s.mockUserToken.user_id;\n            if (!r) throw new L(B.INVALID_ARGUMENT, \"mockUserToken must contain 'sub' or 'user_id' field!\");\n            n = new P(r);\n        }\n        t._authCredentials = new G(new U(e, 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 * 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 ya {\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 Ia(this.firestore, this.converter, this._key.path.popLast());\n    }\n    withConverter(t) {\n        return new ya(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 pa {\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 pa(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}).\n */ class Ia extends pa {\n    /** @hideconstructor */\n    constructor(t, e, n) {\n        super(t, e, ln(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 ya(this.firestore, \n        /* converter= */ null, new ct(t));\n    }\n    withConverter(t) {\n        return new Ia(this.firestore, t, this._path);\n    }\n}\n\nfunction Ta(t, e, ...n) {\n    if (t = d(t), ua(\"collection\", \"path\", e), t instanceof ma) {\n        const s = rt.fromString(e, ...n);\n        return ha(s), new Ia(t, /* converter= */ null, s);\n    }\n    {\n        if (!(t instanceof ya || t instanceof Ia)) throw new L(B.INVALID_ARGUMENT, \"Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore\");\n        const s = t._path.child(rt.fromString(e, ...n));\n        return ha(s), new Ia(t.firestore, \n        /* converter= */ null, s);\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 Ea(t, e) {\n    if (t = fa(t, ma), ua(\"collectionGroup\", \"collection id\", e), e.indexOf(\"/\") >= 0) throw new L(B.INVALID_ARGUMENT, `Invalid collection ID '${e}' passed to function collectionGroup(). Collection IDs must not contain '/'.`);\n    return new pa(t, \n    /* converter= */ null, function(t) {\n        return new an(rt.emptyPath(), t);\n    }(e));\n}\n\nfunction Aa(t, e, ...n) {\n    if (t = d(t), \n    // We allow omission of 'pathString' but explicitly prohibit passing in both\n    // 'undefined' and 'null'.\n    1 === arguments.length && (e = X.R()), ua(\"doc\", \"path\", e), t instanceof ma) {\n        const s = rt.fromString(e, ...n);\n        return aa(s), new ya(t, \n        /* converter= */ null, new ct(s));\n    }\n    {\n        if (!(t instanceof ya || t instanceof Ia)) throw new L(B.INVALID_ARGUMENT, \"Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore\");\n        const s = t._path.child(rt.fromString(e, ...n));\n        return aa(s), new ya(t.firestore, t instanceof Ia ? t.converter : null, new ct(s));\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 Ra(t, e) {\n    return t = d(t), e = d(e), (t instanceof ya || t instanceof Ia) && (e instanceof ya || e instanceof Ia) && (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 ba(t, e) {\n    return t = d(t), e = d(e), t instanceof pa && e instanceof pa && (t.firestore === e.firestore && In(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 * How many bytes to read each time when `ReadableStreamReader.read()` is\n * called. Only applicable for byte streams that we control (e.g. those backed\n * by an UInt8Array).\n */\n/**\n * Builds a `ByteStreamReader` from a UInt8Array.\n * @param source - The data source to use.\n * @param bytesPerRead - How many bytes each `read()` from the returned reader\n *        will read.\n */\nfunction Pa(t, e = 10240) {\n    let n = 0;\n    // The TypeScript definition for ReadableStreamReader changed. We use\n    // `any` here to allow this code to compile with different versions.\n    // See https://github.com/microsoft/TypeScript/issues/42970\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n        return {\n        // eslint-disable-next-line @typescript-eslint/no-explicit-any\n        async read() {\n            if (n < t.byteLength) {\n                const s = {\n                    value: t.slice(n, n + e),\n                    done: !1\n                };\n                return n += e, s;\n            }\n            return {\n                done: !0\n            };\n        },\n        async cancel() {},\n        releaseLock() {},\n        closed: Promise.reject(\"unimplemented\")\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 * On web, a `ReadableStream` is wrapped around by a `ByteStreamReader`.\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 wrapper implementation of Observer<T> that will dispatch events\n * asynchronously. To allow immediate silencing, a mute call is added which\n * causes events scheduled to no longer be raised.\n */\nclass va {\n    constructor(t) {\n        this.observer = t, \n        /**\n         * When set to true, will not raise future events. Necessary to deal with\n         * async detachment of listener.\n         */\n        this.muted = !1;\n    }\n    next(t) {\n        this.observer.next && this.Rc(this.observer.next, t);\n    }\n    error(t) {\n        this.observer.error ? this.Rc(this.observer.error, t) : x(\"Uncaught Error in snapshot listener:\", t.toString());\n    }\n    bc() {\n        this.muted = !0;\n    }\n    Rc(t, e) {\n        this.muted || setTimeout((() => {\n            this.muted || t(e);\n        }), 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 * A class representing a bundle.\n *\n * Takes a bundle stream or buffer, and presents abstractions to read bundled\n * elements out of the underlying content.\n */ class Va {\n    constructor(\n    /** The reader to read from underlying binary bundle data source. */\n    t, e) {\n        this.Pc = t, this.yt = e, \n        /** Cached bundle metadata. */\n        this.metadata = new q, \n        /**\n         * Internal buffer to hold bundle content, accumulating incomplete element\n         * content.\n         */\n        this.buffer = new Uint8Array, this.vc = new TextDecoder(\"utf-8\"), \n        // Read the metadata (which is the first element).\n        this.Vc().then((t => {\n            t && t.Ou() ? this.metadata.resolve(t.ku.metadata) : this.metadata.reject(new Error(`The first element of the bundle is not a metadata, it is\\n             ${JSON.stringify(null == t ? void 0 : t.ku)}`));\n        }), (t => this.metadata.reject(t)));\n    }\n    close() {\n        return this.Pc.cancel();\n    }\n    async getMetadata() {\n        return this.metadata.promise;\n    }\n    async mc() {\n        // Makes sure metadata is read before proceeding.\n        return await this.getMetadata(), this.Vc();\n    }\n    /**\n     * Reads from the head of internal buffer, and pulling more data from\n     * underlying stream if a complete element cannot be found, until an\n     * element(including the prefixed length and the JSON string) is found.\n     *\n     * Once a complete element is read, it is dropped from internal buffer.\n     *\n     * Returns either the bundled element, or null if we have reached the end of\n     * the stream.\n     */    async Vc() {\n        const t = await this.Sc();\n        if (null === t) return null;\n        const e = this.vc.decode(t), n = Number(e);\n        isNaN(n) && this.Dc(`length string (${e}) is not valid number`);\n        const s = await this.Cc(n);\n        return new wc(JSON.parse(s), t.length + n);\n    }\n    /** First index of '{' from the underlying buffer. */    xc() {\n        return this.buffer.findIndex((t => t === \"{\".charCodeAt(0)));\n    }\n    /**\n     * Reads from the beginning of the internal buffer, until the first '{', and\n     * return the content.\n     *\n     * If reached end of the stream, returns a null.\n     */    async Sc() {\n        for (;this.xc() < 0; ) {\n            if (await this.Nc()) break;\n        }\n        // Broke out of the loop because underlying stream is closed, and there\n        // happens to be no more data to process.\n                if (0 === this.buffer.length) return null;\n        const t = this.xc();\n        // Broke out of the loop because underlying stream is closed, but still\n        // cannot find an open bracket.\n                t < 0 && this.Dc(\"Reached the end of bundle when a length string is expected.\");\n        const e = this.buffer.slice(0, t);\n        // Update the internal buffer to drop the read length.\n                return this.buffer = this.buffer.slice(t), e;\n    }\n    /**\n     * Reads from a specified position from the internal buffer, for a specified\n     * number of bytes, pulling more data from the underlying stream if needed.\n     *\n     * Returns a string decoded from the read bytes.\n     */    async Cc(t) {\n        for (;this.buffer.length < t; ) {\n            await this.Nc() && this.Dc(\"Reached the end of bundle when more is expected.\");\n        }\n        const e = this.vc.decode(this.buffer.slice(0, t));\n        // Update the internal buffer to drop the read json string.\n                return this.buffer = this.buffer.slice(t), e;\n    }\n    Dc(t) {\n        // eslint-disable-next-line @typescript-eslint/no-floating-promises\n        throw this.Pc.cancel(), new Error(`Invalid bundle format: ${t}`);\n    }\n    /**\n     * Pulls more data from underlying stream to internal buffer.\n     * Returns a boolean indicating whether the stream is finished.\n     */    async Nc() {\n        const t = await this.Pc.read();\n        if (!t.done) {\n            const e = new Uint8Array(this.buffer.length + t.value.length);\n            e.set(this.buffer), e.set(t.value, this.buffer.length), this.buffer = e;\n        }\n        return t.done;\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 * Represents an aggregation that can be performed by Firestore.\n */\n// eslint-disable-next-line @typescript-eslint/no-unused-vars\nclass Sa {\n    constructor() {\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 Da {\n    /** @hideconstructor */\n    constructor(t, e) {\n        this._data = e, \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._data;\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 * CountQueryRunner encapsulates the logic needed to run the count aggregation\n * queries.\n */ class Ca {\n    constructor(t, e, n) {\n        this.query = t, this.datastore = e, this.userDataWriter = n;\n    }\n    run() {\n        return bu(this.datastore, this.query._query).then((t => {\n            M(void 0 !== t[0]);\n            const e = Object.entries(t[0]).filter((([t, e]) => \"count_alias\" === t)).map((([t, e]) => this.userDataWriter.convertValue(e)))[0];\n            return M(\"number\" == typeof e), Promise.resolve(new Da(this.query, {\n                count: e\n            }));\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 */\n/**\n * Internal transaction object responsible for accumulating the mutations to\n * perform and the base versions for any documents read.\n */ class xa {\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 L(B.INVALID_ARGUMENT, \"Firestore transactions require all reads to be executed before all writes.\");\n        const e = await async function(t, e) {\n            const n = $(t), s = zs(n.yt) + \"/documents\", i = {\n                documents: e.map((t => Gs(n.yt, t)))\n            }, r = await n._o(\"BatchGetDocuments\", s, i, e.length), o = new Map;\n            r.forEach((t => {\n                const e = Xs(n.yt, 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                M(!!e), u.push(e);\n            })), u;\n        }(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 is(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 = ct.fromPath(e);\n            this.mutations.push(new rs(n, this.precondition(n)));\n        })), await async function(t, e) {\n            const n = $(t), s = zs(n.yt) + \"/documents\", i = {\n                writes: e.map((t => ti(n.yt, t)))\n            };\n            await n.ao(\"Commit\", s, i);\n        }(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 O();\n            // Represent a deleted doc using SnapshotVersion.min().\n            e = st.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 L(B.ABORTED, \"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(st.min()) ? Qn.exists(!1) : Qn.updateTime(e) : Qn.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(st.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 L(B.INVALID_ARGUMENT, \"Can't update a document that doesn't exist.\");\n            // Document exists, base precondition on document update time.\n                        return Qn.updateTime(e);\n        }\n        // Document was not read, so we just use the preconditions for a blind\n        // update.\n        return Qn.exists(!0);\n    }\n    write(t) {\n        this.ensureCommitNotCalled(), this.mutations.push(t);\n    }\n    ensureCommitNotCalled() {}\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 */ class Na {\n    constructor(t, e, n, s, i) {\n        this.asyncQueue = t, this.datastore = e, this.options = n, this.updateFunction = s, \n        this.deferred = i, this.kc = n.maxAttempts, this.xo = new Iu(this.asyncQueue, \"transaction_retry\" /* TimerId.TransactionRetry */);\n    }\n    /** Runs the transaction and sets the result on deferred. */    run() {\n        this.kc -= 1, this.Oc();\n    }\n    Oc() {\n        this.xo.Ro((async () => {\n            const t = new xa(this.datastore), e = this.Mc(t);\n            e && e.then((e => {\n                this.asyncQueue.enqueueAndForget((() => t.commit().then((() => {\n                    this.deferred.resolve(e);\n                })).catch((t => {\n                    this.Fc(t);\n                }))));\n            })).catch((t => {\n                this.Fc(t);\n            }));\n        }));\n    }\n    Mc(t) {\n        try {\n            const e = this.updateFunction(t);\n            return !qt(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    Fc(t) {\n        this.kc > 0 && this.$c(t) ? (this.kc -= 1, this.asyncQueue.enqueueAndForget((() => (this.Oc(), \n        Promise.resolve())))) : this.deferred.reject(t);\n    }\n    $c(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 || !as(e);\n        }\n        return !1;\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 * FirestoreClient is a top-level class that constructs and owns all of the\n * pieces of the client SDK architecture. It is responsible for creating the\n * async queue that is shared by all of the other components in the system.\n */\nclass ka {\n    constructor(t, e, \n    /**\n     * Asynchronous queue responsible for all of our internal processing. When\n     * we get incoming work from the user (via public API) or the network\n     * (incoming GRPC messages), we should always schedule onto this queue.\n     * This ensures all of our work is properly serialized (e.g. we don't\n     * start processing a new operation while the previous one is waiting for\n     * an async I/O to complete).\n     */\n    n, s) {\n        this.authCredentials = t, this.appCheckCredentials = e, this.asyncQueue = n, this.databaseInfo = s, \n        this.user = P.UNAUTHENTICATED, this.clientId = X.R(), this.authCredentialListener = () => Promise.resolve(), \n        this.appCheckCredentialListener = () => Promise.resolve(), this.authCredentials.start(n, (async t => {\n            C(\"FirestoreClient\", \"Received user=\", t.uid), await this.authCredentialListener(t), \n            this.user = t;\n        })), this.appCheckCredentials.start(n, (t => (C(\"FirestoreClient\", \"Received new app check token=\", t), \n        this.appCheckCredentialListener(t, this.user))));\n    }\n    async getConfiguration() {\n        return {\n            asyncQueue: this.asyncQueue,\n            databaseInfo: this.databaseInfo,\n            clientId: this.clientId,\n            authCredentials: this.authCredentials,\n            appCheckCredentials: this.appCheckCredentials,\n            initialUser: this.user,\n            maxConcurrentLimboResolutions: 100\n        };\n    }\n    setCredentialChangeListener(t) {\n        this.authCredentialListener = t;\n    }\n    setAppCheckTokenChangeListener(t) {\n        this.appCheckCredentialListener = t;\n    }\n    /**\n     * Checks that the client has not been terminated. Ensures that other methods on\n     * this class cannot be called after the client is terminated.\n     */    verifyNotTerminated() {\n        if (this.asyncQueue.isShuttingDown) throw new L(B.FAILED_PRECONDITION, \"The client has already been terminated.\");\n    }\n    terminate() {\n        this.asyncQueue.enterRestrictedMode();\n        const t = new q;\n        return this.asyncQueue.enqueueAndForgetEvenWhileRestricted((async () => {\n            try {\n                this.onlineComponents && await this.onlineComponents.terminate(), this.offlineComponents && await this.offlineComponents.terminate(), \n                // The credentials provider must be terminated after shutting down the\n                // RemoteStore as it will prevent the RemoteStore from retrieving auth\n                // tokens.\n                this.authCredentials.shutdown(), this.appCheckCredentials.shutdown(), t.resolve();\n            } catch (e) {\n                const n = sc(e, \"Failed to shutdown persistence\");\n                t.reject(n);\n            }\n        })), t.promise;\n    }\n}\n\nasync function Oa(t, e) {\n    t.asyncQueue.verifyOperationInProgress(), C(\"FirestoreClient\", \"Initializing OfflineComponentProvider\");\n    const n = await t.getConfiguration();\n    await e.initialize(n);\n    let s = n.initialUser;\n    t.setCredentialChangeListener((async t => {\n        s.isEqual(t) || (await Uo(e.localStore, t), s = t);\n    })), \n    // When a user calls clearPersistence() in one client, all other clients\n    // need to be terminated to allow the delete to succeed.\n    e.persistence.setDatabaseDeletedListener((() => t.terminate())), t.offlineComponents = e;\n}\n\nasync function Ma(t, e) {\n    t.asyncQueue.verifyOperationInProgress();\n    const n = await Fa(t);\n    C(\"FirestoreClient\", \"Initializing OnlineComponentProvider\");\n    const s = await t.getConfiguration();\n    await e.initialize(n, s), \n    // The CredentialChangeListener of the online component provider takes\n    // precedence over the offline component provider.\n    t.setCredentialChangeListener((t => Xu(e.remoteStore, t))), t.setAppCheckTokenChangeListener(((t, n) => Xu(e.remoteStore, n))), \n    t.onlineComponents = e;\n}\n\nasync function Fa(t) {\n    return t.offlineComponents || (C(\"FirestoreClient\", \"Using default OfflineComponentProvider\"), \n    await Oa(t, new sa)), t.offlineComponents;\n}\n\nasync function $a(t) {\n    return t.onlineComponents || (C(\"FirestoreClient\", \"Using default OnlineComponentProvider\"), \n    await Ma(t, new oa)), t.onlineComponents;\n}\n\nfunction Ba(t) {\n    return Fa(t).then((t => t.persistence));\n}\n\nfunction La(t) {\n    return Fa(t).then((t => t.localStore));\n}\n\nfunction qa(t) {\n    return $a(t).then((t => t.remoteStore));\n}\n\nfunction Ua(t) {\n    return $a(t).then((t => t.syncEngine));\n}\n\nfunction Ka(t) {\n    return $a(t).then((t => t.datastore));\n}\n\nasync function Ga(t) {\n    const e = await $a(t), n = e.eventManager;\n    return n.onListen = bc.bind(null, e.syncEngine), n.onUnlisten = vc.bind(null, e.syncEngine), \n    n;\n}\n\n/** Enables the network connection and re-enqueues all pending operations. */ function Qa(t) {\n    return t.asyncQueue.enqueue((async () => {\n        const e = await Ba(t), n = await qa(t);\n        return e.setNetworkEnabled(!0), function(t) {\n            const e = $(t);\n            return e._u.delete(0 /* OfflineCause.UserDisabled */), Vu(e);\n        }(n);\n    }));\n}\n\n/** Disables the network connection. Pending operations will not complete. */ function ja(t) {\n    return t.asyncQueue.enqueue((async () => {\n        const e = await Ba(t), n = await qa(t);\n        return e.setNetworkEnabled(!1), async function(t) {\n            const e = $(t);\n            e._u.add(0 /* OfflineCause.UserDisabled */), await Su(e), \n            // Set the OnlineState to Offline so get()s return from cache, etc.\n            e.gu.set(\"Offline\" /* OnlineState.Offline */);\n        }(n);\n    }));\n}\n\n/**\n * Returns a Promise that resolves when all writes that were pending at the time\n * this method was called received server acknowledgement. An acknowledgement\n * can be either acceptance or rejection.\n */ function Wa(t, e) {\n    const n = new q;\n    return t.asyncQueue.enqueueAndForget((async () => async function(t, e, n) {\n        try {\n            const s = await function(t, e) {\n                const n = $(t);\n                return n.persistence.runTransaction(\"read document\", \"readonly\", (t => n.localDocuments.getDocument(t, e)));\n            }(t, e);\n            s.isFoundDocument() ? n.resolve(s) : s.isNoDocument() ? n.resolve(null) : n.reject(new L(B.UNAVAILABLE, \"Failed to get document from cache. (However, this document may exist on the server. Run again without setting 'source' in the GetOptions to attempt to retrieve the document from the server.)\"));\n        } catch (t) {\n            const s = sc(t, `Failed to get document '${e} from cache`);\n            n.reject(s);\n        }\n    }\n    /**\n * Retrieves a latency-compensated document from the backend via a\n * SnapshotListener.\n */ (await La(t), e, n))), n.promise;\n}\n\nfunction za(t, e, n = {}) {\n    const s = new q;\n    return t.asyncQueue.enqueueAndForget((async () => function(t, e, n, s, i) {\n        const r = new va({\n            next: r => {\n                // Remove query first before passing event to user to avoid\n                // user actions affecting the now stale query.\n                e.enqueueAndForget((() => hc(t, o)));\n                const u = r.docs.has(n);\n                !u && r.fromCache ? \n                // TODO(dimond): If we're online and the document doesn't\n                // exist then we resolve with a doc.exists set to false. If\n                // we're offline however, we reject the Promise in this\n                // case. Two options: 1) Cache the negative response from\n                // the server so we can deliver that even when you're\n                // offline 2) Actually reject the Promise in the online case\n                // if the document doesn't exist.\n                i.reject(new L(B.UNAVAILABLE, \"Failed to get document because the client is offline.\")) : u && r.fromCache && s && \"server\" === s.source ? i.reject(new L(B.UNAVAILABLE, 'Failed to get document from server. (However, this document does exist in the local cache. Run again without setting source to \"server\" to retrieve the cached document.)')) : i.resolve(r);\n            },\n            error: t => i.reject(t)\n        }), o = new _c(ln(n.path), r, {\n            includeMetadataChanges: !0,\n            Nu: !0\n        });\n        return ac(t, o);\n    }(await Ga(t), t.asyncQueue, e, n, s))), s.promise;\n}\n\nfunction Ha(t, e) {\n    const n = new q;\n    return t.asyncQueue.enqueueAndForget((async () => async function(t, e, n) {\n        try {\n            const s = await Jo(t, e, \n            /* usePreviousResults= */ !0), i = new Tc(e, s.Hi), r = i.Wu(s.documents), o = i.applyChanges(r, \n            /* updateLimboDocuments= */ !1);\n            n.resolve(o.snapshot);\n        } catch (t) {\n            const s = sc(t, `Failed to execute query '${e} against cache`);\n            n.reject(s);\n        }\n    }\n    /**\n * Retrieves a latency-compensated query snapshot from the backend via a\n * SnapshotListener.\n */ (await La(t), e, n))), n.promise;\n}\n\nfunction Ja(t, e, n = {}) {\n    const s = new q;\n    return t.asyncQueue.enqueueAndForget((async () => function(t, e, n, s, i) {\n        const r = new va({\n            next: n => {\n                // Remove query first before passing event to user to avoid\n                // user actions affecting the now stale query.\n                e.enqueueAndForget((() => hc(t, o))), n.fromCache && \"server\" === s.source ? i.reject(new L(B.UNAVAILABLE, 'Failed to get documents from server. (However, these documents may exist in the local cache. Run again without setting source to \"server\" to retrieve the cached documents.)')) : i.resolve(n);\n            },\n            error: t => i.reject(t)\n        }), o = new _c(n, r, {\n            includeMetadataChanges: !0,\n            Nu: !0\n        });\n        return ac(t, o);\n    }(await Ga(t), t.asyncQueue, e, n, s))), s.promise;\n}\n\nfunction Ya(t, e) {\n    const n = new va(e);\n    return t.asyncQueue.enqueueAndForget((async () => function(t, e) {\n        $(t).Ru.add(e), \n        // Immediately fire an initial event, indicating all existing listeners\n        // are in-sync.\n        e.next();\n    }(await Ga(t), n))), () => {\n        n.bc(), t.asyncQueue.enqueueAndForget((async () => function(t, e) {\n            $(t).Ru.delete(e);\n        }(await Ga(t), n)));\n    };\n}\n\n/**\n * Takes an updateFunction in which a set of reads and writes can be performed\n * atomically. In the updateFunction, the client can read and write values\n * using the supplied transaction object. After the updateFunction, all\n * changes will be committed. If a retryable error occurs (ex: some other\n * client has changed any of the data referenced), then the updateFunction\n * will be called again after a backoff. If the updateFunction still fails\n * after all retries, then the transaction will be rejected.\n *\n * The transaction object passed to the updateFunction contains methods for\n * accessing documents and collections. Unlike other datastore access, data\n * accessed with the transaction will not reflect local changes that have not\n * been committed. For this reason, it is required that all reads are\n * performed before any writes. Transactions must be performed while online.\n */ function Xa(t, e, n, s) {\n    const i = function(t, e) {\n        let n;\n        n = \"string\" == typeof t ? (new TextEncoder).encode(t) : t;\n        return function(t, e) {\n            return new Va(t, e);\n        }(function(t, e) {\n            if (t instanceof Uint8Array) return Pa(t, e);\n            if (t instanceof ArrayBuffer) return Pa(new Uint8Array(t), e);\n            if (t instanceof ReadableStream) return t.getReader();\n            throw new Error(\"Source of `toByteStreamReader` has to be a ArrayBuffer or ReadableStream\");\n        }(n), 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, pu(e));\n    t.asyncQueue.enqueueAndForget((async () => {\n        na(await Ua(t), i, s);\n    }));\n}\n\nfunction Za(t, e) {\n    return t.asyncQueue.enqueue((async () => function(t, e) {\n        const n = $(t);\n        return n.persistence.runTransaction(\"Get named query\", \"readonly\", (t => n.Ns.getNamedQuery(t, e)));\n    }(await La(t), e)));\n}\n\nclass th {\n    constructor() {\n        // The last promise in the queue.\n        this.Bc = Promise.resolve(), \n        // A list of retryable operations. Retryable operations are run in order and\n        // retried with backoff.\n        this.Lc = [], \n        // Is this AsyncQueue being shut down? Once it is set to true, it will not\n        // be changed again.\n        this.qc = !1, \n        // Operations scheduled to be queued in the future. Operations are\n        // automatically removed after they are run or canceled.\n        this.Uc = [], \n        // visible for testing\n        this.Kc = null, \n        // Flag set while there's an outstanding AsyncQueue operation, used for\n        // assertion sanity-checks.\n        this.Gc = !1, \n        // Enabled during shutdown on Safari to prevent future access to IndexedDB.\n        this.Qc = !1, \n        // List of TimerIds to fast-forward delays for.\n        this.jc = [], \n        // Backoff timer used to schedule retries for retryable operations\n        this.xo = new Iu(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.Wc = () => {\n            const t = yu();\n            t && C(\"AsyncQueue\", \"Visibility state changed to \" + t.visibilityState), this.xo.Po();\n        };\n        const t = yu();\n        t && \"function\" == typeof t.addEventListener && t.addEventListener(\"visibilitychange\", this.Wc);\n    }\n    get isShuttingDown() {\n        return this.qc;\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.zc(), \n        // eslint-disable-next-line @typescript-eslint/no-floating-promises\n        this.Hc(t);\n    }\n    enterRestrictedMode(t) {\n        if (!this.qc) {\n            this.qc = !0, this.Qc = t || !1;\n            const e = yu();\n            e && \"function\" == typeof e.removeEventListener && e.removeEventListener(\"visibilitychange\", this.Wc);\n        }\n    }\n    enqueue(t) {\n        if (this.zc(), this.qc) \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 q;\n        return this.Hc((() => this.qc && this.Qc ? Promise.resolve() : (t().then(e.resolve, e.reject), \n        e.promise))).then((() => e.promise));\n    }\n    enqueueRetryable(t) {\n        this.enqueueAndForget((() => (this.Lc.push(t), this.Jc())));\n    }\n    /**\n     * Runs the next operation from the retryable queue. If the operation fails,\n     * reschedules with backoff.\n     */    async Jc() {\n        if (0 !== this.Lc.length) {\n            try {\n                await this.Lc[0](), this.Lc.shift(), this.xo.reset();\n            } catch (t) {\n                if (!Vt(t)) throw t;\n // Failure will be handled by AsyncQueue\n                                C(\"AsyncQueue\", \"Operation failed with retryable error: \" + t);\n            }\n            this.Lc.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.xo.Ro((() => this.Jc()));\n        }\n    }\n    Hc(t) {\n        const e = this.Bc.then((() => (this.Gc = !0, t().catch((t => {\n            this.Kc = t, this.Gc = !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 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 */ (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 x(\"INTERNAL UNHANDLED ERROR: \", e), t;\n        })).then((t => (this.Gc = !1, t))))));\n        return this.Bc = e, e;\n    }\n    enqueueAfterDelay(t, e, n) {\n        this.zc(), \n        // Fast-forward delays for timerIds that have been overriden.\n        this.jc.indexOf(t) > -1 && (e = 0);\n        const s = nc.createAndSchedule(this, t, e, n, (t => this.Yc(t)));\n        return this.Uc.push(s), s;\n    }\n    zc() {\n        this.Kc && O();\n    }\n    verifyOperationInProgress() {}\n    /**\n     * Waits until all currently queued tasks are finished executing. Delayed\n     * operations are not run.\n     */    async Xc() {\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.Bc, await t;\n        } while (t !== this.Bc);\n    }\n    /**\n     * For Tests: Determine if a delayed operation with a particular TimerId\n     * exists.\n     */    Zc(t) {\n        for (const e of this.Uc) 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     */    ta(t) {\n        // Note that draining may generate more delayed ops, so we do that first.\n        return this.Xc().then((() => {\n            // Run ops in the same order they'd run if they ran naturally.\n            this.Uc.sort(((t, e) => t.targetTimeMs - e.targetTimeMs));\n            for (const e of this.Uc) if (e.skipDelay(), \"all\" /* TimerId.All */ !== t && e.timerId === t) break;\n            return this.Xc();\n        }));\n    }\n    /**\n     * For Tests: Skip all subsequent delays for a timer id.\n     */    ea(t) {\n        this.jc.push(t);\n    }\n    /** Called once a DelayedOperation is run or canceled. */    Yc(t) {\n        // NOTE: indexOf / slice are O(n), but delayedOperations is expected to be small.\n        const e = this.Uc.indexOf(t);\n        this.Uc.splice(e, 1);\n    }\n}\n\nfunction eh(t) {\n    /**\n * Returns true if obj is an object and contains at least one of the specified\n * methods.\n */\n    return function(t, e) {\n        if (\"object\" != typeof t || null === t) return !1;\n        const n = t;\n        for (const t of e) if (t in n && \"function\" == typeof n[t]) return !0;\n        return !1;\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 the task of loading a Firestore bundle. It provides progress of bundle\n * loading, as well as task completion and error events.\n *\n * The API is compatible with `Promise<LoadBundleTaskProgress>`.\n */ (t, [ \"next\", \"error\", \"complete\" ]);\n}\n\nclass nh {\n    constructor() {\n        this._progressObserver = {}, this._taskCompletionResolver = new q, this._lastProgress = {\n            taskState: \"Running\",\n            totalBytes: 0,\n            totalDocuments: 0,\n            bytesLoaded: 0,\n            documentsLoaded: 0\n        };\n    }\n    /**\n     * Registers functions to listen to bundle loading progress events.\n     * @param next - Called when there is a progress update from bundle loading. Typically `next` calls occur\n     *   each time a Firestore document is loaded from the bundle.\n     * @param error - Called when an error occurs during bundle loading. The task aborts after reporting the\n     *   error, and there should be no more updates after this.\n     * @param complete - Called when the loading task is complete.\n     */    onProgress(t, e, n) {\n        this._progressObserver = {\n            next: t,\n            error: e,\n            complete: n\n        };\n    }\n    /**\n     * Implements the `Promise<LoadBundleTaskProgress>.catch` interface.\n     *\n     * @param onRejected - Called when an error occurs during bundle loading.\n     */    catch(t) {\n        return this._taskCompletionResolver.promise.catch(t);\n    }\n    /**\n     * Implements the `Promise<LoadBundleTaskProgress>.then` interface.\n     *\n     * @param onFulfilled - Called on the completion of the loading task with a final `LoadBundleTaskProgress` update.\n     *   The update will always have its `taskState` set to `\"Success\"`.\n     * @param onRejected - Called when an error occurs during bundle loading.\n     */    then(t, e) {\n        return this._taskCompletionResolver.promise.then(t, e);\n    }\n    /**\n     * Notifies all observers that bundle loading has completed, with a provided\n     * `LoadBundleTaskProgress` object.\n     *\n     * @private\n     */    _completeWith(t) {\n        this._updateProgress(t), this._progressObserver.complete && this._progressObserver.complete(), \n        this._taskCompletionResolver.resolve(t);\n    }\n    /**\n     * Notifies all observers that bundle loading has failed, with a provided\n     * `Error` as the reason.\n     *\n     * @private\n     */    _failWith(t) {\n        this._lastProgress.taskState = \"Error\", this._progressObserver.next && this._progressObserver.next(this._lastProgress), \n        this._progressObserver.error && this._progressObserver.error(t), this._taskCompletionResolver.reject(t);\n    }\n    /**\n     * Notifies a progress update of loading a bundle.\n     * @param progress - The new progress.\n     *\n     * @private\n     */    _updateProgress(t) {\n        this._lastProgress = t, this._progressObserver.next && this._progressObserver.next(t);\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/** DOMException error code constants. */ const sh = -1;\n\n/**\n * The Cloud Firestore service interface.\n *\n * Do not call this constructor directly. Instead, use {@link (getFirestore:1)}.\n */\nclass ih extends ma {\n    /** @hideconstructor */\n    constructor(t, e, n, s) {\n        super(t, e, n, s), \n        /**\n         * Whether it's a {@link Firestore} or Firestore Lite instance.\n         */\n        this.type = \"firestore\", this._queue = new th, this._persistenceKey = (null == s ? void 0 : s.name) || \"[DEFAULT]\";\n    }\n    _terminate() {\n        return this._firestoreClient || \n        // The client must be initialized to ensure that all subsequent API\n        // usage throws an exception.\n        ch(this), this._firestoreClient.terminate();\n    }\n}\n\n/**\n * Initializes a new instance of {@link Firestore} with the provided settings.\n * Can only be called before any other function, including\n * {@link (getFirestore:1)}. If the custom settings are empty, this function is\n * equivalent to calling {@link (getFirestore:1)}.\n *\n * @param app - The {@link @firebase/app#FirebaseApp} with which the {@link Firestore} instance will\n * be associated.\n * @param settings - A settings object to configure the {@link Firestore} instance.\n * @param databaseId - The name of database.\n * @returns A newly initialized {@link Firestore} instance.\n */ function rh(t, e, n) {\n    n || (n = \"(default)\");\n    const s = _getProvider(t, \"firestore\");\n    if (s.isInitialized(n)) {\n        const t = s.getImmediate({\n            identifier: n\n        }), i = s.getOptions(n);\n        if (_(i, e)) return t;\n        throw new L(B.FAILED_PRECONDITION, \"initializeFirestore() has already been called with different options. To avoid this error, call initializeFirestore() with the same options as when it was originally called, or call getFirestore() to return the already initialized instance.\");\n    }\n    if (void 0 !== e.cacheSizeBytes && -1 !== e.cacheSizeBytes && e.cacheSizeBytes < 1048576) throw new L(B.INVALID_ARGUMENT, \"cacheSizeBytes must be at least 1048576\");\n    return s.initialize({\n        options: e,\n        instanceIdentifier: n\n    });\n}\n\nfunction oh(e, n) {\n    const s = \"object\" == typeof e ? e : t(), i = \"string\" == typeof e ? e : n || \"(default)\", r = _getProvider(s, \"firestore\").getImmediate({\n        identifier: i\n    });\n    if (!r._initialized) {\n        const t = w(\"firestore\");\n        t && ga(r, ...t);\n    }\n    return r;\n}\n\n/**\n * @internal\n */ function uh(t) {\n    return t._firestoreClient || ch(t), t._firestoreClient.verifyNotTerminated(), t._firestoreClient;\n}\n\nfunction ch(t) {\n    var e;\n    const n = t._freezeSettings(), s = function(t, e, n, s) {\n        return new Mt(t, e, n, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, s.useFetchStreams);\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    // settings() defaults:\n    (t._databaseId, (null === (e = t._app) || void 0 === e ? void 0 : e.options.appId) || \"\", t._persistenceKey, n);\n    t._firestoreClient = new ka(t._authCredentials, t._appCheckCredentials, t._queue, s);\n}\n\n/**\n * Attempts to enable persistent storage, if possible.\n *\n * Must be called before any other functions (other than\n * {@link initializeFirestore}, {@link (getFirestore:1)} or\n * {@link clearIndexedDbPersistence}.\n *\n * If this fails, `enableIndexedDbPersistence()` will reject the promise it\n * returns. Note that even after this failure, the {@link Firestore} instance will\n * remain usable, however offline persistence will be disabled.\n *\n * There are several reasons why this can fail, which can be identified by\n * the `code` on the error.\n *\n *   * failed-precondition: The app is already open in another browser tab.\n *   * unimplemented: The browser is incompatible with the offline\n *     persistence implementation.\n *\n * @param firestore - The {@link Firestore} instance to enable persistence for.\n * @param persistenceSettings - Optional settings object to configure\n * persistence.\n * @returns A `Promise` that represents successfully enabling persistent storage.\n */ function ah(t, e) {\n    ph(t = fa(t, ih));\n    const n = uh(t), s = t._freezeSettings(), i = new oa;\n    return lh(n, i, new ia(i, s.cacheSizeBytes, null == e ? void 0 : e.forceOwnership));\n}\n\n/**\n * Attempts to enable multi-tab persistent storage, if possible. If enabled\n * across all tabs, all operations share access to local persistence, including\n * shared execution of queries and latency-compensated local document updates\n * across all connected instances.\n *\n * If this fails, `enableMultiTabIndexedDbPersistence()` will reject the promise\n * it returns. Note that even after this failure, the {@link Firestore} instance will\n * remain usable, however offline persistence will be disabled.\n *\n * There are several reasons why this can fail, which can be identified by\n * the `code` on the error.\n *\n *   * failed-precondition: The app is already open in another browser tab and\n *     multi-tab is not enabled.\n *   * unimplemented: The browser is incompatible with the offline\n *     persistence implementation.\n *\n * @param firestore - The {@link Firestore} instance to enable persistence for.\n * @returns A `Promise` that represents successfully enabling persistent\n * storage.\n */ function hh(t) {\n    ph(t = fa(t, ih));\n    const e = uh(t), n = t._freezeSettings(), s = new oa;\n    return lh(e, s, new ra(s, n.cacheSizeBytes));\n}\n\n/**\n * Registers both the `OfflineComponentProvider` and `OnlineComponentProvider`.\n * If the operation fails with a recoverable error (see\n * `canRecoverFromIndexedDbError()` below), the returned Promise is rejected\n * but the client remains usable.\n */ function lh(t, e, n) {\n    const s = new q;\n    return t.asyncQueue.enqueue((async () => {\n        try {\n            await Oa(t, n), await Ma(t, e), s.resolve();\n        } catch (t) {\n            const e = t;\n            if (!\n            /**\n * Decides whether the provided error allows us to gracefully disable\n * persistence (as opposed to crashing the client).\n */\n            function(t) {\n                if (\"FirebaseError\" === t.name) return t.code === B.FAILED_PRECONDITION || t.code === B.UNIMPLEMENTED;\n                if (\"undefined\" != typeof DOMException && t instanceof DOMException) \n                // There are a few known circumstances where we can open IndexedDb but\n                // trying to read/write will fail (e.g. quota exceeded). For\n                // well-understood cases, we attempt to detect these and then gracefully\n                // fall back to memory persistence.\n                // NOTE: Rather than continue to add to this list, we could decide to\n                // always fall back, with the risk that we might accidentally hide errors\n                // representing actual SDK bugs.\n                // When the browser is out of quota we could get either quota exceeded\n                // or an aborted error depending on whether the error happened during\n                // schema migration.\n                return 22 === t.code || 20 === t.code || \n                // Firefox Private Browsing mode disables IndexedDb and returns\n                // INVALID_STATE for any usage.\n                11 === t.code;\n                return !0;\n            }\n            /**\n * Clears the persistent storage. This includes pending writes and cached\n * documents.\n *\n * Must be called while the {@link Firestore} instance is not started (after the app is\n * terminated or when the app is first initialized). On startup, this function\n * must be called before other functions (other than {@link\n * initializeFirestore} or {@link (getFirestore:1)})). If the {@link Firestore}\n * instance is still running, the promise will be rejected with the error code\n * of `failed-precondition`.\n *\n * Note: `clearIndexedDbPersistence()` is primarily intended to help write\n * reliable tests that use Cloud Firestore. It uses an efficient mechanism for\n * dropping existing data but does not attempt to securely overwrite or\n * otherwise make cached data unrecoverable. For applications that are sensitive\n * to the disclosure of cached data in between user sessions, we strongly\n * recommend not enabling persistence at all.\n *\n * @param firestore - The {@link Firestore} instance to clear persistence for.\n * @returns A `Promise` that is resolved when the persistent storage is\n * cleared. Otherwise, the promise is rejected with an error.\n */ (e)) throw e;\n            N(\"Error enabling offline persistence. Falling back to persistence disabled: \" + e), \n            s.reject(e);\n        }\n    })).then((() => s.promise));\n}\n\nfunction fh(t) {\n    if (t._initialized && !t._terminated) throw new L(B.FAILED_PRECONDITION, \"Persistence can only be cleared before a Firestore instance is initialized or after it is terminated.\");\n    const e = new q;\n    return t._queue.enqueueAndForgetEvenWhileRestricted((async () => {\n        try {\n            await async function(t) {\n                if (!bt.C()) return Promise.resolve();\n                const e = t + \"main\";\n                await bt.delete(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 */\n            /**\n * Compares two array for equality using comparator. The method computes the\n * intersection and invokes `onAdd` for every element that is in `after` but not\n * `before`. `onRemove` is invoked for every element in `before` but missing\n * from `after`.\n *\n * The method creates a copy of both `before` and `after` and runs in O(n log\n * n), where n is the size of the two lists.\n *\n * @param before - The elements that exist in the original array.\n * @param after - The elements to diff against the original array.\n * @param comparator - The comparator for the elements in before and after.\n * @param onAdd - A function to invoke for every element that is part of `\n * after` but not `before`.\n * @param onRemove - A function to invoke for every element that is part of\n * `before` but not `after`.\n */ (Fo(t._databaseId, t._persistenceKey)), e.resolve();\n        } catch (t) {\n            e.reject(t);\n        }\n    })), e.promise;\n}\n\n/**\n * Waits until all currently pending writes for the active user have been\n * acknowledged by the backend.\n *\n * The returned promise resolves immediately if there are no outstanding writes.\n * Otherwise, the promise waits for all previously issued writes (including\n * those written in a previous app session), but it does not wait for writes\n * that were added after the function is called. If you want to wait for\n * additional writes, call `waitForPendingWrites()` again.\n *\n * Any outstanding `waitForPendingWrites()` promises are rejected during user\n * changes.\n *\n * @returns A `Promise` which resolves when all currently pending writes have been\n * acknowledged by the backend.\n */ function dh(t) {\n    return function(t) {\n        const e = new q;\n        return t.asyncQueue.enqueueAndForget((async () => kc(await Ua(t), e))), e.promise;\n    }(uh(t = fa(t, ih)));\n}\n\n/**\n * Re-enables use of the network for this {@link Firestore} instance after a prior\n * call to {@link disableNetwork}.\n *\n * @returns A `Promise` that is resolved once the network has been enabled.\n */ function _h(t) {\n    return Qa(uh(t = fa(t, ih)));\n}\n\n/**\n * Disables network usage for this instance. It can be re-enabled via {@link\n * enableNetwork}. While the network is disabled, any snapshot listeners,\n * `getDoc()` or `getDocs()` calls will return results from cache, and any write\n * operations will be queued until the network is restored.\n *\n * @returns A `Promise` that is resolved once the network has been disabled.\n */ function wh(t) {\n    return ja(uh(t = fa(t, ih)));\n}\n\n/**\n * Terminates the provided {@link Firestore} instance.\n *\n * After calling `terminate()` only the `clearIndexedDbPersistence()` function\n * may be used. Any other function will throw a `FirestoreError`.\n *\n * To restart after termination, create a new instance of FirebaseFirestore with\n * {@link (getFirestore:1)}.\n *\n * Termination does not cancel any pending writes, and any promises that are\n * awaiting a response from the server will not be resolved. If you have\n * persistence enabled, the next time you start this instance, it will resume\n * sending these writes to the server.\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\n * of its resources or in combination with `clearIndexedDbPersistence()` to\n * ensure that all local state is destroyed between test runs.\n *\n * @returns A `Promise` that is resolved when the instance has been successfully\n * terminated.\n */ function mh(t) {\n    return e(t.app, \"firestore\", t._databaseId.database), t._delete();\n}\n\n/**\n * Loads a Firestore bundle into the local cache.\n *\n * @param firestore - The {@link Firestore} instance to load bundles for.\n * @param bundleData - An object representing the bundle to be loaded. Valid\n * objects are `ArrayBuffer`, `ReadableStream<Uint8Array>` or `string`.\n *\n * @returns A `LoadBundleTask` object, which notifies callers with progress\n * updates, and completion or error events. It can be used as a\n * `Promise<LoadBundleTaskProgress>`.\n */ function gh(t, e) {\n    const n = uh(t = fa(t, ih)), s = new nh;\n    return Xa(n, t._databaseId, e, s), s;\n}\n\n/**\n * Reads a Firestore {@link Query} from local cache, identified by the given\n * name.\n *\n * The named queries are packaged  into bundles on the server side (along\n * with resulting documents), and loaded to local cache using `loadBundle`. Once\n * in local cache, use this method to extract a {@link Query} by name.\n *\n * @param firestore - The {@link Firestore} instance to read the query from.\n * @param name - The name of the query.\n * @returns A `Promise` that is resolved with the Query or `null`.\n */ function yh(t, e) {\n    return Za(uh(t = fa(t, ih)), e).then((e => e ? new pa(t, null, e.query) : null));\n}\n\nfunction ph(t) {\n    if (t._initialized || t._terminated) throw new L(B.FAILED_PRECONDITION, \"Firestore has already been started and persistence can no longer be enabled. You can only enable persistence before calling any other methods on a Firestore object.\");\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 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 */\nclass Ih {\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 Ih(Qt.fromBase64String(t));\n        } catch (t) {\n            throw new L(B.INVALID_ARGUMENT, \"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 Ih(Qt.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 Th {\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 L(B.INVALID_ARGUMENT, \"Invalid field name at argument $(i + 1). Field names must not be empty.\");\n        this._internalPath = new ut(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 Eh() {\n    return new Th(\"__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 Ah {\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 Rh {\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 L(B.INVALID_ARGUMENT, \"Latitude must be a number between -90 and 90, but was: \" + t);\n        if (!isFinite(e) || e < -180 || e > 180) throw new L(B.INVALID_ARGUMENT, \"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 Z(this._lat, t._lat) || Z(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 bh = /^__.*__$/;\n\n/** The result of parsing document data (e.g. for a setData call). */ class Ph {\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 ts(t, this.data, this.fieldMask, e, this.fieldTransforms) : new Zn(t, this.data, e, this.fieldTransforms);\n    }\n}\n\n/** The result of parsing \"update\" data (i.e. for an updateData call). */ class vh {\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 ts(t, this.data, this.fieldMask, e, this.fieldTransforms);\n    }\n}\n\nfunction Vh(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 O();\n    }\n}\n\n/** A \"context\" object passed around while parsing user data. */ class Sh {\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, s, i, r) {\n        this.settings = t, this.databaseId = e, this.yt = n, this.ignoreUndefinedProperties = s, \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 === i && this.na(), this.fieldTransforms = i || [], this.fieldMask = r || [];\n    }\n    get path() {\n        return this.settings.path;\n    }\n    get sa() {\n        return this.settings.sa;\n    }\n    /** Returns a new context with the specified settings overwritten. */    ia(t) {\n        return new Sh(Object.assign(Object.assign({}, this.settings), t), this.databaseId, this.yt, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);\n    }\n    ra(t) {\n        var e;\n        const n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), s = this.ia({\n            path: n,\n            oa: !1\n        });\n        return s.ua(t), s;\n    }\n    ca(t) {\n        var e;\n        const n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), s = this.ia({\n            path: n,\n            oa: !1\n        });\n        return s.na(), s;\n    }\n    aa(t) {\n        // TODO(b/34871131): We don't support array paths right now; so make path\n        // undefined.\n        return this.ia({\n            path: void 0,\n            oa: !0\n        });\n    }\n    ha(t) {\n        return Hh(t, this.settings.methodName, this.settings.la || !1, this.path, this.settings.fa);\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    na() {\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.ua(this.path.get(t));\n    }\n    ua(t) {\n        if (0 === t.length) throw this.ha(\"Document fields must not be empty\");\n        if (Vh(this.sa) && bh.test(t)) throw this.ha('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 Dh {\n    constructor(t, e, n) {\n        this.databaseId = t, this.ignoreUndefinedProperties = e, this.yt = n || pu(t);\n    }\n    /** Creates a new top-level parse context. */    da(t, e, n, s = !1) {\n        return new Sh({\n            sa: t,\n            methodName: e,\n            fa: n,\n            path: ut.emptyPath(),\n            oa: !1,\n            la: s\n        }, this.databaseId, this.yt, this.ignoreUndefinedProperties);\n    }\n}\n\nfunction Ch(t) {\n    const e = t._freezeSettings(), n = pu(t._databaseId);\n    return new Dh(t._databaseId, !!e.ignoreUndefinedProperties, n);\n}\n\n/** Parse document data from a set() call. */ function xh(t, e, n, s, i, r = {}) {\n    const o = t.da(r.merge || r.mergeFields ? 2 /* UserDataSource.MergeSet */ : 0 /* UserDataSource.Set */ , e, n, i);\n    Qh(\"Data must be an object, but it was:\", o, s);\n    const u = Kh(s, o);\n    let c, a;\n    if (r.merge) c = new Je(o.fieldMask), a = o.fieldTransforms; else if (r.mergeFields) {\n        const t = [];\n        for (const s of r.mergeFields) {\n            const i = jh(e, s, n);\n            if (!o.contains(i)) throw new L(B.INVALID_ARGUMENT, `Field '${i}' is specified in your field mask but missing from your input data.`);\n            Jh(t, i) || t.push(i);\n        }\n        c = new Je(t), a = o.fieldTransforms.filter((t => c.covers(t.field)));\n    } else c = null, a = o.fieldTransforms;\n    return new Ph(new Ye(u), c, a);\n}\n\nclass Nh extends Ah {\n    _toFieldTransform(t) {\n        if (2 /* UserDataSource.MergeSet */ !== t.sa) throw 1 /* UserDataSource.Update */ === t.sa ? t.ha(`${this._methodName}() can only appear at the top level of your update data`) : t.ha(`${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 Nh;\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 kh(t, e, n) {\n    return new Sh({\n        sa: 3 /* UserDataSource.Argument */ ,\n        fa: e.settings.fa,\n        methodName: t._methodName,\n        oa: n\n    }, e.databaseId, e.yt, e.ignoreUndefinedProperties);\n}\n\nclass Oh extends Ah {\n    _toFieldTransform(t) {\n        return new Un(t.path, new kn);\n    }\n    isEqual(t) {\n        return t instanceof Oh;\n    }\n}\n\nclass Mh extends Ah {\n    constructor(t, e) {\n        super(t), this._a = e;\n    }\n    _toFieldTransform(t) {\n        const e = kh(this, t, \n        /*array=*/ !0), n = this._a.map((t => Uh(t, e))), s = new On(n);\n        return new Un(t.path, s);\n    }\n    isEqual(t) {\n        // TODO(mrschmidt): Implement isEquals\n        return this === t;\n    }\n}\n\nclass Fh extends Ah {\n    constructor(t, e) {\n        super(t), this._a = e;\n    }\n    _toFieldTransform(t) {\n        const e = kh(this, t, \n        /*array=*/ !0), n = this._a.map((t => Uh(t, e))), s = new Fn(n);\n        return new Un(t.path, s);\n    }\n    isEqual(t) {\n        // TODO(mrschmidt): Implement isEquals\n        return this === t;\n    }\n}\n\nclass $h extends Ah {\n    constructor(t, e) {\n        super(t), this.wa = e;\n    }\n    _toFieldTransform(t) {\n        const e = new Bn(t.yt, Sn(t.yt, this.wa));\n        return new Un(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 Bh(t, e, n, s) {\n    const i = t.da(1 /* UserDataSource.Update */ , e, n);\n    Qh(\"Data must be an object, but it was:\", i, s);\n    const r = [], o = Ye.empty();\n    Bt(s, ((t, s) => {\n        const u = zh(e, t, n);\n        // For Compat types, we have to \"extract\" the underlying types before\n        // performing validation.\n                s = d(s);\n        const c = i.ca(u);\n        if (s instanceof Nh) \n        // Add it to the field mask, but don't add anything to updateData.\n        r.push(u); else {\n            const t = Uh(s, c);\n            null != t && (r.push(u), o.set(u, t));\n        }\n    }));\n    const u = new Je(r);\n    return new vh(o, u, i.fieldTransforms);\n}\n\n/** Parse update data from a list of field/value arguments. */ function Lh(t, e, n, s, i, r) {\n    const o = t.da(1 /* UserDataSource.Update */ , e, n), u = [ jh(e, s, n) ], c = [ i ];\n    if (r.length % 2 != 0) throw new L(B.INVALID_ARGUMENT, `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 < r.length; t += 2) u.push(jh(e, r[t])), c.push(r[t + 1]);\n    const a = [], h = Ye.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 (!Jh(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 = d(n);\n        const s = o.ca(e);\n        if (n instanceof Nh) \n        // Add it to the field mask, but don't add anything to updateData.\n        a.push(e); else {\n            const t = Uh(n, s);\n            null != t && (a.push(e), h.set(e, t));\n        }\n    }\n    const l = new Je(a);\n    return new vh(h, l, 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 qh(t, e, n, s = !1) {\n    return Uh(n, t.da(s ? 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 Uh(t, e) {\n    if (Gh(\n    // Unwrap the API type from the Compat SDK. This will return the API type\n    // from firestore-exp.\n    t = d(t))) return Qh(\"Unsupported field value:\", e, t), Kh(t, e);\n    if (t instanceof Ah) \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 (!Vh(e.sa)) throw e.ha(`${t._methodName}() can only be used with update() and set()`);\n        if (!e.path) throw e.ha(`${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.oa && 4 /* UserDataSource.ArrayArgument */ !== e.sa) throw e.ha(\"Nested arrays are not supported\");\n        return function(t, e) {\n            const n = [];\n            let s = 0;\n            for (const i of t) {\n                let t = Uh(i, e.aa(s));\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), s++;\n            }\n            return {\n                arrayValue: {\n                    values: n\n                }\n            };\n        }(t, e);\n    }\n    return function(t, e) {\n        if (null === (t = d(t))) return {\n            nullValue: \"NULL_VALUE\"\n        };\n        if (\"number\" == typeof t) return Sn(e.yt, 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 = nt.fromDate(t);\n            return {\n                timestampValue: $s(e.yt, n)\n            };\n        }\n        if (t instanceof nt) {\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 nt(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));\n            return {\n                timestampValue: $s(e.yt, n)\n            };\n        }\n        if (t instanceof Rh) return {\n            geoPointValue: {\n                latitude: t.latitude,\n                longitude: t.longitude\n            }\n        };\n        if (t instanceof Ih) return {\n            bytesValue: Bs(e.yt, t._byteString)\n        };\n        if (t instanceof ya) {\n            const n = e.databaseId, s = t.firestore._databaseId;\n            if (!s.isEqual(n)) throw e.ha(`Document reference is for database ${s.projectId}/${s.database} but should be for database ${n.projectId}/${n.database}`);\n            return {\n                referenceValue: Us(t.firestore._databaseId || e.databaseId, t._key.path)\n            };\n        }\n        throw e.ha(`Unsupported field value: ${la(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 Kh(t, e) {\n    const n = {};\n    return Lt(t) ? \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) : Bt(t, ((t, s) => {\n        const i = Uh(s, e.ra(t));\n        null != i && (n[t] = i);\n    })), {\n        mapValue: {\n            fields: n\n        }\n    };\n}\n\nfunction Gh(t) {\n    return !(\"object\" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof nt || t instanceof Rh || t instanceof Ih || t instanceof ya || t instanceof Ah);\n}\n\nfunction Qh(t, e, n) {\n    if (!Gh(n) || !function(t) {\n        return \"object\" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));\n    }(n)) {\n        const s = la(n);\n        throw \"an object\" === s ? e.ha(t + \" a custom object\") : e.ha(t + \" \" + s);\n    }\n}\n\n/**\n * Helper that calls fromDotSeparatedString() but wraps any error thrown.\n */ function jh(t, e, n) {\n    if ((\n    // If required, replace the FieldPath Compat class with with the firestore-exp\n    // FieldPath.\n    e = d(e)) instanceof Th) return e._internalPath;\n    if (\"string\" == typeof e) return zh(t, e);\n    throw Hh(\"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 Wh = 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 zh(t, e, n) {\n    if (e.search(Wh) >= 0) throw Hh(`Invalid field path (${e}). Paths must not contain '~', '*', '/', '[', or ']'`, t, \n    /* hasConverter= */ !1, \n    /* path= */ void 0, n);\n    try {\n        return new Th(...e.split(\".\"))._internalPath;\n    } catch (s) {\n        throw Hh(`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 Hh(t, e, n, s, i) {\n    const r = s && !s.isEmpty(), o = void 0 !== i;\n    let u = `Function ${e}() called with invalid data`;\n    n && (u += \" (via `toFirestore()`)\"), u += \". \";\n    let c = \"\";\n    return (r || o) && (c += \" (found\", r && (c += ` in field ${s}`), o && (c += ` in document ${i}`), \n    c += \")\"), new L(B.INVALID_ARGUMENT, u + t + c);\n}\n\n/** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */ function Jh(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 Yh {\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, s, i) {\n        this._firestore = t, this._userDataWriter = e, this._key = n, this._document = s, \n        this._converter = i;\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 ya(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 Xh(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(Zh(\"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 Xh extends Yh {\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 * Helper that calls `fromDotSeparatedString()` but wraps any error thrown.\n */ function Zh(t, e) {\n    return \"string\" == typeof e ? zh(t, e) : e instanceof Th ? 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 */ function tl(t) {\n    if (\"L\" /* LimitType.Last */ === t.limitType && 0 === t.explicitOrderBy.length) throw new L(B.UNIMPLEMENTED, \"limitToLast() queries require specifying at least one orderBy() clause\");\n}\n\n/**\n * An `AppliableConstraint` is an abstraction of a constraint that can be applied\n * to a Firestore query.\n */ class el {}\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}, {@link startAfter}, {@link\n * endBefore}, {@link endAt}, {@link limit}, {@link limitToLast} and\n * can then be passed to {@link query} to create a new query instance that\n * also contains this `QueryConstraint`.\n */ class nl extends el {}\n\nfunction sl(t, e, ...n) {\n    let s = [];\n    e instanceof el && s.push(e), s = s.concat(n), function(t) {\n        const e = t.filter((t => t instanceof ol)).length, n = t.filter((t => t instanceof il)).length;\n        if (e > 1 || e > 0 && n > 0) throw new L(B.INVALID_ARGUMENT, \"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 */ (s);\n    for (const e of s) 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} to create a new query instance that also contains\n * this `QueryFieldFilterConstraint`.\n */ class il extends nl {\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 il(t, e, n);\n    }\n    _apply(t) {\n        const e = this._parse(t);\n        return Al(t._query, e), new pa(t.firestore, t.converter, yn(t._query, e));\n    }\n    _parse(t) {\n        const e = Ch(t.firestore), n = function(t, e, n, s, i, r, o) {\n            let u;\n            if (i.isKeyField()) {\n                if (\"array-contains\" /* Operator.ARRAY_CONTAINS */ === r || \"array-contains-any\" /* Operator.ARRAY_CONTAINS_ANY */ === r) throw new L(B.INVALID_ARGUMENT, `Invalid Query. You can't perform '${r}' queries on documentId().`);\n                if (\"in\" /* Operator.IN */ === r || \"not-in\" /* Operator.NOT_IN */ === r) {\n                    El(o, r);\n                    const e = [];\n                    for (const n of o) e.push(Tl(s, t, n));\n                    u = {\n                        arrayValue: {\n                            values: e\n                        }\n                    };\n                } else u = Tl(s, t, o);\n            } else \"in\" /* Operator.IN */ !== r && \"not-in\" /* Operator.NOT_IN */ !== r && \"array-contains-any\" /* Operator.ARRAY_CONTAINS_ANY */ !== r || El(o, r), \n            u = qh(n, e, o, \n            /* allowArrays= */ \"in\" /* Operator.IN */ === r || \"not-in\" /* Operator.NOT_IN */ === r);\n            return Re.create(i, r, 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 rl(t, e, n) {\n    const s = e, i = Zh(\"where\", t);\n    return il._create(i, s, 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} to create a new query\n * instance that also contains the `QueryCompositeFilterConstraint`.\n * @internal TODO remove this internal tag with OR Query support in the server\n */ class ol extends el {\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 ol(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] : be.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 s = e.getFlattenedFilters();\n            for (const t of s) Al(n, t), n = yn(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 pa(t.firestore, t.converter, yn(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 * @internal TODO remove this internal tag with OR Query support in the server\n */ function ul(...t) {\n    // Only support QueryFilterConstraints\n    return t.forEach((t => bl(\"or\", t))), ol._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 * @internal TODO remove this internal tag with OR Query support in the server\n */ function cl(...t) {\n    // Only support QueryFilterConstraints\n    return t.forEach((t => bl(\"and\", t))), ol._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} 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 al extends nl {\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 al(t, e);\n    }\n    _apply(t) {\n        const e = function(t, e, n) {\n            if (null !== t.startAt) throw new L(B.INVALID_ARGUMENT, \"Invalid query. You must not call startAt() or startAfter() before calling orderBy().\");\n            if (null !== t.endAt) throw new L(B.INVALID_ARGUMENT, \"Invalid query. You must not call endAt() or endBefore() before calling orderBy().\");\n            const s = new Ue(e, n);\n            return function(t, e) {\n                if (null === dn(t)) {\n                    // This is the first order by. It must match any inequality.\n                    const n = _n(t);\n                    null !== n && Rl(t, n, e.field);\n                }\n            }(t, s), s;\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 pa(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 an(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 hl(t, e = \"asc\") {\n    const n = e, s = Zh(\"orderBy\", t);\n    return al._create(s, 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} to create a new\n * query instance that also contains this `QueryLimitConstraint`.\n */ class ll extends nl {\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 ll(t, e, n);\n    }\n    _apply(t) {\n        return new pa(t.firestore, t.converter, pn(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 fl(t) {\n    return da(\"limit\", t), ll._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 dl(t) {\n    return da(\"limitToLast\", t), ll._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} to create a\n * new query instance that also contains this `QueryStartAtConstraint`.\n */ class _l extends nl {\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 _l(t, e, n);\n    }\n    _apply(t) {\n        const e = Il(t, this.type, this._docOrFields, this._inclusive);\n        return new pa(t.firestore, t.converter, function(t, e) {\n            return new an(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 wl(...t) {\n    return _l._create(\"startAt\", t, \n    /*inclusive=*/ !0);\n}\n\nfunction ml(...t) {\n    return _l._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} to create a new\n * query instance that also contains this `QueryEndAtConstraint`.\n */ class gl extends nl {\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 gl(t, e, n);\n    }\n    _apply(t) {\n        const e = Il(t, this.type, this._docOrFields, this._inclusive);\n        return new pa(t.firestore, t.converter, function(t, e) {\n            return new an(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 yl(...t) {\n    return gl._create(\"endBefore\", t, \n    /*inclusive=*/ !1);\n}\n\nfunction pl(...t) {\n    return gl._create(\"endAt\", t, \n    /*inclusive=*/ !0);\n}\n\n/** Helper function to create a bound from a document or fields */ function Il(t, e, n, s) {\n    if (n[0] = d(n[0]), n[0] instanceof Yh) return function(t, e, n, s, i) {\n        if (!s) throw new L(B.NOT_FOUND, `Can't use a DocumentSnapshot that doesn't exist for ${n}().`);\n        const r = [];\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 mn(t)) if (n.field.isKeyField()) r.push(ce(e, s.key)); else {\n            const t = s.data.field(n.field);\n            if (Jt(t)) throw new L(B.INVALID_ARGUMENT, '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 L(B.INVALID_ARGUMENT, `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            r.push(t);\n        }\n        return new Ie(r, i);\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, s);\n    {\n        const i = Ch(t.firestore);\n        return function(t, e, n, s, i, r) {\n            // Use explicit order by's because it has to match the query the user made\n            const o = t.explicitOrderBy;\n            if (i.length > o.length) throw new L(B.INVALID_ARGUMENT, `Too many arguments provided to ${s}(). The number of arguments must be less than or equal to the number of orderBy() clauses`);\n            const u = [];\n            for (let r = 0; r < i.length; r++) {\n                const c = i[r];\n                if (o[r].field.isKeyField()) {\n                    if (\"string\" != typeof c) throw new L(B.INVALID_ARGUMENT, `Invalid query. Expected a string for document ID in ${s}(), but got a ${typeof c}`);\n                    if (!wn(t) && -1 !== c.indexOf(\"/\")) throw new L(B.INVALID_ARGUMENT, `Invalid query. When querying a collection and ordering by documentId(), the value passed to ${s}() must be a plain document ID, but '${c}' contains a slash.`);\n                    const n = t.path.child(rt.fromString(c));\n                    if (!ct.isDocumentKey(n)) throw new L(B.INVALID_ARGUMENT, `Invalid query. When querying a collection group and ordering by documentId(), the value passed to ${s}() must result in a valid document path, but '${n}' is not because it contains an odd number of segments.`);\n                    const i = new ct(n);\n                    u.push(ce(e, i));\n                } else {\n                    const t = qh(n, s, c);\n                    u.push(t);\n                }\n            }\n            return new Ie(u, r);\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, i, e, n, s);\n    }\n}\n\nfunction Tl(t, e, n) {\n    if (\"string\" == typeof (n = d(n))) {\n        if (\"\" === n) throw new L(B.INVALID_ARGUMENT, \"Invalid query. When querying with documentId(), you must provide a valid document ID, but it was an empty string.\");\n        if (!wn(e) && -1 !== n.indexOf(\"/\")) throw new L(B.INVALID_ARGUMENT, `Invalid query. When querying a collection by documentId(), you must provide a plain document ID, but '${n}' contains a '/' character.`);\n        const s = e.path.child(rt.fromString(n));\n        if (!ct.isDocumentKey(s)) throw new L(B.INVALID_ARGUMENT, `Invalid query. When querying a collection group by documentId(), the value provided must result in a valid document path, but '${s}' is not because it has an odd number of segments (${s.length}).`);\n        return ce(t, new ct(s));\n    }\n    if (n instanceof ya) return ce(t, n._key);\n    throw new L(B.INVALID_ARGUMENT, `Invalid query. When querying with documentId(), you must provide a valid string or a DocumentReference, but it was: ${la(n)}.`);\n}\n\n/**\n * Validates that the value passed into a disjunctive filter satisfies all\n * array requirements.\n */ function El(t, e) {\n    if (!Array.isArray(t) || 0 === t.length) throw new L(B.INVALID_ARGUMENT, `Invalid Query. A non-empty array is required for '${e.toString()}' filters.`);\n    if (t.length > 10) throw new L(B.INVALID_ARGUMENT, `Invalid Query. '${e.toString()}' filters support a maximum of 10 elements in the value array.`);\n}\n\n/**\n * Given an operator, returns the set of operators that cannot be used with it.\n *\n * Operators in a query must adhere to the following set of rules:\n * 1. Only one array operator is allowed.\n * 2. Only one disjunctive operator is allowed.\n * 3. `NOT_EQUAL` cannot be used with another `NOT_EQUAL` operator.\n * 4. `NOT_IN` cannot be used with array, disjunctive, or `NOT_EQUAL` operators.\n *\n * Array operators: `ARRAY_CONTAINS`, `ARRAY_CONTAINS_ANY`\n * Disjunctive operators: `IN`, `ARRAY_CONTAINS_ANY`, `NOT_IN`\n */ function Al(t, e) {\n    if (e.isInequality()) {\n        const n = _n(t), s = e.field;\n        if (null !== n && !n.isEqual(s)) throw new L(B.INVALID_ARGUMENT, `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 '${s.toString()}'`);\n        const i = dn(t);\n        null !== i && Rl(t, s, i);\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\" /* Operator.ARRAY_CONTAINS */ :\n            return [ \"array-contains\" /* Operator.ARRAY_CONTAINS */ , \"array-contains-any\" /* Operator.ARRAY_CONTAINS_ANY */ , \"not-in\" /* Operator.NOT_IN */ ];\n\n          case \"in\" /* Operator.IN */ :\n            return [ \"array-contains-any\" /* Operator.ARRAY_CONTAINS_ANY */ , \"in\" /* Operator.IN */ , \"not-in\" /* Operator.NOT_IN */ ];\n\n          case \"array-contains-any\" /* Operator.ARRAY_CONTAINS_ANY */ :\n            return [ \"array-contains\" /* Operator.ARRAY_CONTAINS */ , \"array-contains-any\" /* Operator.ARRAY_CONTAINS_ANY */ , \"in\" /* Operator.IN */ , \"not-in\" /* Operator.NOT_IN */ ];\n\n          case \"not-in\" /* Operator.NOT_IN */ :\n            return [ \"array-contains\" /* Operator.ARRAY_CONTAINS */ , \"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 L(B.INVALID_ARGUMENT, `Invalid query. You cannot use more than one '${e.op.toString()}' filter.`) : new L(B.INVALID_ARGUMENT, `Invalid query. You cannot use '${e.op.toString()}' filters with '${n.toString()}' filters.`);\n}\n\nfunction Rl(t, e, n) {\n    if (!n.isEqual(e)) throw new L(B.INVALID_ARGUMENT, `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 bl(t, e) {\n    if (!(e instanceof il || e instanceof ol)) throw new L(B.INVALID_ARGUMENT, `Function ${t}() requires AppliableConstraints created with a call to 'where(...)', 'or(...)', or 'and(...)'.`);\n}\n\nclass Pl {\n    convertValue(t, e = \"none\") {\n        switch (ee(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 zt(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(Ht(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 O();\n        }\n    }\n    convertObject(t, e) {\n        const n = {};\n        return Bt(t.fields, ((t, s) => {\n            n[t] = this.convertValue(s, e);\n        })), n;\n    }\n    convertGeoPoint(t) {\n        return new Rh(zt(t.latitude), zt(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 = Yt(t);\n            return null == n ? null : this.convertValue(n, e);\n\n          case \"estimate\":\n            return this.convertTimestamp(Xt(t));\n\n          default:\n            return null;\n        }\n    }\n    convertTimestamp(t) {\n        const e = Wt(t);\n        return new nt(e.seconds, e.nanos);\n    }\n    convertDocumentKey(t, e) {\n        const n = rt.fromString(t);\n        M(wi(n));\n        const s = new Ft(n.get(1), n.get(3)), i = new ct(n.popFirst(5));\n        return s.isEqual(e) || \n        // TODO(b/64130202): Somehow support foreign references.\n        x(`Document ${i} contains a document reference within a different database (${s.projectId}/${s.database}) which is not supported. It will be treated as a reference in the current database (${e.projectId}/${e.database}) instead.`), \n        i;\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 * 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 */ function vl(t, e, n) {\n    let s;\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 s = t ? n && (n.merge || n.mergeFields) ? t.toFirestore(e, n) : t.toFirestore(e) : e, \n    s;\n}\n\nclass Vl extends Pl {\n    constructor(t) {\n        super(), this.firestore = t;\n    }\n    convertBytes(t) {\n        return new Ih(t);\n    }\n    convertReference(t) {\n        const e = this.convertDocumentKey(t, this.firestore._databaseId);\n        return new ya(this.firestore, /* converter= */ null, e);\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 * Metadata about a snapshot, describing the state of the snapshot.\n */ class Sl {\n    /** @hideconstructor */\n    constructor(t, e) {\n        this.hasPendingWrites = t, this.fromCache = e;\n    }\n    /**\n     * Returns true if this `SnapshotMetadata` is equal to the provided one.\n     *\n     * @param other - The `SnapshotMetadata` to compare against.\n     * @returns true if this `SnapshotMetadata` is equal to the provided one.\n     */    isEqual(t) {\n        return this.hasPendingWrites === t.hasPendingWrites && this.fromCache === t.fromCache;\n    }\n}\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 Dl extends Yh {\n    /** @hideconstructor protected */\n    constructor(t, e, n, s, i, r) {\n        super(t, e, n, s, r), this._firestore = t, this._firestoreImpl = t, this.metadata = i;\n    }\n    /**\n     * Returns whether or not the data exists. True if the document exists.\n     */    exists() {\n        return super.exists();\n    }\n    /**\n     * Retrieves all fields in the document as an `Object`. Returns `undefined` if\n     * the document doesn't exist.\n     *\n     * By default, `serverTimestamp()` values that have not yet been\n     * set to their final value will be returned as `null`. You can override\n     * this by passing an options object.\n     *\n     * @param options - An options object to configure how data is retrieved from\n     * the snapshot (for example the desired behavior for server timestamps that\n     * have not yet been set to their final value).\n     * @returns An `Object` containing all fields in the document or `undefined` if\n     * the document doesn't exist.\n     */    data(t = {}) {\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 e = new Cl(this._firestore, this._userDataWriter, this._key, this._document, this.metadata, \n                /* converter= */ null);\n                return this._converter.fromFirestore(e, t);\n            }\n            return this._userDataWriter.convertValue(this._document.data.value, t.serverTimestamps);\n        }\n    }\n    /**\n     * Retrieves the field specified by `fieldPath`. Returns `undefined` if the\n     * document or field doesn't exist.\n     *\n     * By default, a `serverTimestamp()` that has not yet been set to\n     * its final value will be returned as `null`. You can override this by\n     * passing an options object.\n     *\n     * @param fieldPath - The path (for example 'foo' or 'foo.bar') to a specific\n     * field.\n     * @param options - An options object to configure how the field is retrieved\n     * from the snapshot (for example the desired behavior for server timestamps\n     * that have not yet been set to their final value).\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, e = {}) {\n        if (this._document) {\n            const n = this._document.data.field(Zh(\"DocumentSnapshot.get\", t));\n            if (null !== n) return this._userDataWriter.convertValue(n, e.serverTimestamps);\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 Cl extends Dl {\n    /**\n     * Retrieves all fields in the document as an `Object`.\n     *\n     * By default, `serverTimestamp()` values that have not yet been\n     * set to their final value will be returned as `null`. You can override\n     * this by passing an options object.\n     *\n     * @override\n     * @param options - An options object to configure how data is retrieved from\n     * the snapshot (for example the desired behavior for server timestamps that\n     * have not yet been set to their final value).\n     * @returns An `Object` containing all fields in the document.\n     */\n    data(t = {}) {\n        return super.data(t);\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 xl {\n    /** @hideconstructor */\n    constructor(t, e, n, s) {\n        this._firestore = t, this._userDataWriter = e, this._snapshot = s, this.metadata = new Sl(s.hasPendingWrites, s.fromCache), \n        this.query = n;\n    }\n    /** An array of all the documents in the `QuerySnapshot`. */    get docs() {\n        const t = [];\n        return this.forEach((e => t.push(e))), t;\n    }\n    /** The number of documents in the `QuerySnapshot`. */    get size() {\n        return this._snapshot.docs.size;\n    }\n    /** True if there are no documents in the `QuerySnapshot`. */    get empty() {\n        return 0 === this.size;\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._snapshot.docs.forEach((n => {\n            t.call(e, new Cl(this._firestore, this._userDataWriter, n.key, n, new Sl(this._snapshot.mutatedKeys.has(n.key), this._snapshot.fromCache), this.query.converter));\n        }));\n    }\n    /**\n     * Returns an array of the documents changes since the last snapshot. If this\n     * is the first snapshot, all documents will be in the list as 'added'\n     * changes.\n     *\n     * @param options - `SnapshotListenOptions` that control whether metadata-only\n     * changes (i.e. only `DocumentSnapshot.metadata` changed) should trigger\n     * snapshot events.\n     */    docChanges(t = {}) {\n        const e = !!t.includeMetadataChanges;\n        if (e && this._snapshot.excludesMetadataChanges) throw new L(B.INVALID_ARGUMENT, \"To include metadata changes with your document changes, you must also pass { includeMetadataChanges:true } to onSnapshot().\");\n        return this._cachedChanges && this._cachedChangesIncludeMetadataChanges === e || (this._cachedChanges = \n        /** Calculates the array of `DocumentChange`s for a given `ViewSnapshot`. */\n        function(t, e) {\n            if (t._snapshot.oldDocs.isEmpty()) {\n                let e = 0;\n                return t._snapshot.docChanges.map((n => {\n                    const s = new Cl(t._firestore, t._userDataWriter, n.doc.key, n.doc, new Sl(t._snapshot.mutatedKeys.has(n.doc.key), t._snapshot.fromCache), t.query.converter);\n                    return n.doc, {\n                        type: \"added\",\n                        doc: s,\n                        oldIndex: -1,\n                        newIndex: e++\n                    };\n                }));\n            }\n            {\n                // A `DocumentSet` that is updated incrementally as changes are applied to use\n                // to lookup the index of a document.\n                let n = t._snapshot.oldDocs;\n                return t._snapshot.docChanges.filter((t => e || 3 /* ChangeType.Metadata */ !== t.type)).map((e => {\n                    const s = new Cl(t._firestore, t._userDataWriter, e.doc.key, e.doc, new Sl(t._snapshot.mutatedKeys.has(e.doc.key), t._snapshot.fromCache), t.query.converter);\n                    let i = -1, r = -1;\n                    return 0 /* ChangeType.Added */ !== e.type && (i = n.indexOf(e.doc.key), n = n.delete(e.doc.key)), \n                    1 /* ChangeType.Removed */ !== e.type && (n = n.add(e.doc), r = n.indexOf(e.doc.key)), \n                    {\n                        type: Nl(e.type),\n                        doc: s,\n                        oldIndex: i,\n                        newIndex: r\n                    };\n                }));\n            }\n        }(this, e), this._cachedChangesIncludeMetadataChanges = e), this._cachedChanges;\n    }\n}\n\nfunction Nl(t) {\n    switch (t) {\n      case 0 /* ChangeType.Added */ :\n        return \"added\";\n\n      case 2 /* ChangeType.Modified */ :\n      case 3 /* ChangeType.Metadata */ :\n        return \"modified\";\n\n      case 1 /* ChangeType.Removed */ :\n        return \"removed\";\n\n      default:\n        return O();\n    }\n}\n\n// TODO(firestoreexp): Add tests for snapshotEqual with different snapshot\n// metadata\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 kl(t, e) {\n    return t instanceof Dl && e instanceof Dl ? 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 xl && e instanceof xl && (t._firestore === e._firestore && ba(t.query, e.query) && t.metadata.isEqual(e.metadata) && t._snapshot.isEqual(e._snapshot));\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 * Reads the document referred to by this `DocumentReference`.\n *\n * Note: `getDoc()` attempts to provide up-to-date data when possible by waiting\n * for data from the server, but it may return cached data or fail if you are\n * offline and the server cannot be reached. To specify this behavior, invoke\n * {@link getDocFromCache} or {@link getDocFromServer}.\n *\n * @param reference - The reference of the document to fetch.\n * @returns A Promise resolved with a `DocumentSnapshot` containing the\n * current document contents.\n */ function Ol(t) {\n    t = fa(t, ya);\n    const e = fa(t.firestore, ih);\n    return za(uh(e), t._key).then((n => Hl(e, t, n)));\n}\n\nclass Ml extends Pl {\n    constructor(t) {\n        super(), this.firestore = t;\n    }\n    convertBytes(t) {\n        return new Ih(t);\n    }\n    convertReference(t) {\n        const e = this.convertDocumentKey(t, this.firestore._databaseId);\n        return new ya(this.firestore, /* converter= */ null, e);\n    }\n}\n\n/**\n * Reads the document referred to by this `DocumentReference` from cache.\n * Returns an error if the document is not currently cached.\n *\n * @returns A `Promise` resolved with a `DocumentSnapshot` containing the\n * current document contents.\n */ function Fl(t) {\n    t = fa(t, ya);\n    const e = fa(t.firestore, ih), n = uh(e), s = new Ml(e);\n    return Wa(n, t._key).then((n => new Dl(e, s, t._key, n, new Sl(null !== n && n.hasLocalMutations, \n    /* fromCache= */ !0), t.converter)));\n}\n\n/**\n * Reads the document referred to by this `DocumentReference` from the server.\n * Returns an error if the network is not available.\n *\n * @returns A `Promise` resolved with a `DocumentSnapshot` containing the\n * current document contents.\n */ function $l(t) {\n    t = fa(t, ya);\n    const e = fa(t.firestore, ih);\n    return za(uh(e), t._key, {\n        source: \"server\"\n    }).then((n => Hl(e, t, n)));\n}\n\n/**\n * Executes the query and returns the results as a `QuerySnapshot`.\n *\n * Note: `getDocs()` attempts to provide up-to-date data when possible by\n * waiting for data from the server, but it may return cached data or fail if\n * you are offline and the server cannot be reached. To specify this behavior,\n * invoke {@link getDocsFromCache} or {@link getDocsFromServer}.\n *\n * @returns A `Promise` that will be resolved with the results of the query.\n */ function Bl(t) {\n    t = fa(t, pa);\n    const e = fa(t.firestore, ih), n = uh(e), s = new Ml(e);\n    return tl(t._query), Ja(n, t._query).then((n => new xl(e, s, t, n)));\n}\n\n/**\n * Executes the query and returns the results as a `QuerySnapshot` from cache.\n * Returns an empty result set if no documents matching the query are currently\n * cached.\n *\n * @returns A `Promise` that will be resolved with the results of the query.\n */ function Ll(t) {\n    t = fa(t, pa);\n    const e = fa(t.firestore, ih), n = uh(e), s = new Ml(e);\n    return Ha(n, t._query).then((n => new xl(e, s, t, n)));\n}\n\n/**\n * Executes the query and returns the results as a `QuerySnapshot` from the\n * server. Returns an error if the network is not available.\n *\n * @returns A `Promise` that will be resolved with the results of the query.\n */ function ql(t) {\n    t = fa(t, pa);\n    const e = fa(t.firestore, ih), n = uh(e), s = new Ml(e);\n    return Ja(n, t._query, {\n        source: \"server\"\n    }).then((n => new xl(e, s, t, n)));\n}\n\nfunction Ul(t, e, n) {\n    t = fa(t, ya);\n    const s = fa(t.firestore, ih), i = vl(t.converter, e, n);\n    return zl(s, [ xh(Ch(s), \"setDoc\", t._key, i, null !== t.converter, n).toMutation(t._key, Qn.none()) ]);\n}\n\nfunction Kl(t, e, n, ...s) {\n    t = fa(t, ya);\n    const i = fa(t.firestore, ih), r = Ch(i);\n    let o;\n    o = \"string\" == typeof (\n    // For Compat types, we have to \"extract\" the underlying types before\n    // performing validation.\n    e = d(e)) || e instanceof Th ? Lh(r, \"updateDoc\", t._key, e, n, s) : Bh(r, \"updateDoc\", t._key, e);\n    return zl(i, [ o.toMutation(t._key, Qn.exists(!0)) ]);\n}\n\n/**\n * Deletes the document referred to by the specified `DocumentReference`.\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 (note that it won't resolve while you're offline).\n */ function Gl(t) {\n    return zl(fa(t.firestore, ih), [ new is(t._key, Qn.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 * @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 * @returns A `Promise` resolved with a `DocumentReference` pointing to the\n * newly created document after it has been written to the backend (Note that it\n * won't resolve while you're offline).\n */ function Ql(t, e) {\n    const n = fa(t.firestore, ih), s = Aa(t), i = vl(t.converter, e);\n    return zl(n, [ xh(Ch(t.firestore), \"addDoc\", s._key, i, null !== t.converter, {}).toMutation(s._key, Qn.exists(!1)) ]).then((() => s));\n}\n\nfunction jl(t, ...e) {\n    var n, s, i;\n    t = d(t);\n    let r = {\n        includeMetadataChanges: !1\n    }, o = 0;\n    \"object\" != typeof e[o] || eh(e[o]) || (r = e[o], o++);\n    const u = {\n        includeMetadataChanges: r.includeMetadataChanges\n    };\n    if (eh(e[o])) {\n        const t = e[o];\n        e[o] = null === (n = t.next) || void 0 === n ? void 0 : n.bind(t), e[o + 1] = null === (s = t.error) || void 0 === s ? void 0 : s.bind(t), \n        e[o + 2] = null === (i = t.complete) || void 0 === i ? void 0 : i.bind(t);\n    }\n    let c, a, h;\n    if (t instanceof ya) a = fa(t.firestore, ih), h = ln(t._key.path), c = {\n        next: n => {\n            e[o] && e[o](Hl(a, t, n));\n        },\n        error: e[o + 1],\n        complete: e[o + 2]\n    }; else {\n        const n = fa(t, pa);\n        a = fa(n.firestore, ih), h = n._query;\n        const s = new Ml(a);\n        c = {\n            next: t => {\n                e[o] && e[o](new xl(a, s, n, t));\n            },\n            error: e[o + 1],\n            complete: e[o + 2]\n        }, tl(t._query);\n    }\n    return function(t, e, n, s) {\n        const i = new va(s), r = new _c(e, i, n);\n        return t.asyncQueue.enqueueAndForget((async () => ac(await Ga(t), r))), () => {\n            i.bc(), t.asyncQueue.enqueueAndForget((async () => hc(await Ga(t), r)));\n        };\n    }(uh(a), h, u, c);\n}\n\nfunction Wl(t, e) {\n    return Ya(uh(t = fa(t, ih)), eh(e) ? e : {\n        next: e\n    });\n}\n\n/**\n * Locally writes `mutations` on the async queue.\n * @internal\n */ function zl(t, e) {\n    return function(t, e) {\n        const n = new q;\n        return t.asyncQueue.enqueueAndForget((async () => Vc(await Ua(t), e, n))), n.promise;\n    }(uh(t), e);\n}\n\n/**\n * Converts a {@link ViewSnapshot} that contains the single document specified by `ref`\n * to a {@link DocumentSnapshot}.\n */ function Hl(t, e, n) {\n    const s = n.docs.get(e._key), i = new Ml(t);\n    return new Dl(t, i, e._key, s, new Sl(n.hasPendingWrites, n.fromCache), e.converter);\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 * 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 Jl(t, e) {\n    return ba(t.query, e.query) && _(t.data(), e.data());\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 * The result received from the server is presented, unaltered, without\n * considering any local state. That is, documents in the local cache are not\n * taken into consideration, neither are local modifications not yet\n * synchronized with the server. Previously-downloaded results, if any, are not\n * used: every request using this source necessarily involves a round trip to\n * the server.\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 Yl(t) {\n    const e = fa(t.firestore, ih);\n    return function(t, e, n) {\n        const s = new q;\n        return t.asyncQueue.enqueueAndForget((async () => {\n            try {\n                if (Mu(await qa(t))) {\n                    const i = await Ka(t), r = new Ca(e, i, n).run();\n                    s.resolve(r);\n                } else s.reject(new L(B.UNAVAILABLE, \"Failed to get count result because the client is offline.\"));\n            } catch (t) {\n                s.reject(t);\n            }\n        })), s.promise;\n    }(uh(e), t, new Ml(e));\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 Xl = {\n    maxAttempts: 5\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 */\nclass Zl {\n    /** @hideconstructor */\n    constructor(t, e) {\n        this._firestore = t, this._commitHandler = e, this._mutations = [], this._committed = !1, \n        this._dataReader = Ch(t);\n    }\n    set(t, e, n) {\n        this._verifyNotCommitted();\n        const s = tf(t, this._firestore), i = vl(s.converter, e, n), r = xh(this._dataReader, \"WriteBatch.set\", s._key, i, null !== s.converter, n);\n        return this._mutations.push(r.toMutation(s._key, Qn.none())), this;\n    }\n    update(t, e, n, ...s) {\n        this._verifyNotCommitted();\n        const i = tf(t, this._firestore);\n        // For Compat types, we have to \"extract\" the underlying types before\n        // performing validation.\n                let r;\n        return r = \"string\" == typeof (e = d(e)) || e instanceof Th ? Lh(this._dataReader, \"WriteBatch.update\", i._key, e, n, s) : Bh(this._dataReader, \"WriteBatch.update\", i._key, e), \n        this._mutations.push(r.toMutation(i._key, Qn.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 = tf(t, this._firestore);\n        return this._mutations = this._mutations.concat(new is(e._key, Qn.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 L(B.FAILED_PRECONDITION, \"A write batch can no longer be used after commit() has been called.\");\n    }\n}\n\nfunction tf(t, e) {\n    if ((t = d(t)).firestore !== e) throw new L(B.INVALID_ARGUMENT, \"Provided document reference is from a different Firestore instance.\");\n    return 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// 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 */\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 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 */\nclass ef extends class {\n    /** @hideconstructor */\n    constructor(t, e) {\n        this._firestore = t, this._transaction = e, this._dataReader = Ch(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 = tf(t, this._firestore), n = new Vl(this._firestore);\n        return this._transaction.lookup([ e._key ]).then((t => {\n            if (!t || 1 !== t.length) return O();\n            const s = t[0];\n            if (s.isFoundDocument()) return new Yh(this._firestore, n, s.key, s, e.converter);\n            if (s.isNoDocument()) return new Yh(this._firestore, n, e._key, null, e.converter);\n            throw O();\n        }));\n    }\n    set(t, e, n) {\n        const s = tf(t, this._firestore), i = vl(s.converter, e, n), r = xh(this._dataReader, \"Transaction.set\", s._key, i, null !== s.converter, n);\n        return this._transaction.set(s._key, r), this;\n    }\n    update(t, e, n, ...s) {\n        const i = tf(t, this._firestore);\n        // For Compat types, we have to \"extract\" the underlying types before\n        // performing validation.\n                let r;\n        return r = \"string\" == typeof (e = d(e)) || e instanceof Th ? Lh(this._dataReader, \"Transaction.update\", i._key, e, n, s) : Bh(this._dataReader, \"Transaction.update\", i._key, e), \n        this._transaction.update(i._key, r), 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 = tf(t, this._firestore);\n        return this._transaction.delete(e._key), this;\n    }\n} {\n    // This class implements the same logic as the Transaction API in the Lite SDK\n    // but is subclassed in order to return its own DocumentSnapshot types.\n    /** @hideconstructor */\n    constructor(t, e) {\n        super(t, e), this._firestore = 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 = tf(t, this._firestore), n = new Ml(this._firestore);\n        return super.get(t).then((t => new Dl(this._firestore, n, e._key, t._document, new Sl(\n        /* hasPendingWrites= */ !1, \n        /* fromCache= */ !1), e.converter)));\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 nf(t, e, n) {\n    t = fa(t, ih);\n    const s = Object.assign(Object.assign({}, Xl), n);\n    !function(t) {\n        if (t.maxAttempts < 1) throw new L(B.INVALID_ARGUMENT, \"Max attempts must be at least 1\");\n    }(s);\n    return function(t, e, n) {\n        const s = new q;\n        return t.asyncQueue.enqueueAndForget((async () => {\n            const i = await Ka(t);\n            new Na(t.asyncQueue, i, n, e, s).run();\n        })), s.promise;\n    }(uh(t), (n => e(new ef(t, n))), s);\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 sf() {\n    return new Nh(\"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 rf() {\n    return new Oh(\"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 of(...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 Mh(\"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 uf(...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 Fh(\"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 cf(t) {\n    return new $h(\"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 * Creates a write batch, used for performing multiple writes as a single\n * atomic operation. The maximum number of writes allowed in a single {@link WriteBatch}\n * is 500.\n *\n * Unlike transactions, write batches are persisted offline and therefore are\n * preferable when you don't need to condition your writes on read data.\n *\n * @returns A {@link WriteBatch} that can be used to atomically execute multiple\n * writes.\n */ function af(t) {\n    return uh(t = fa(t, ih)), new Zl(t, (e => zl(t, e)));\n}\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 */ function hf(t, e) {\n    var n;\n    const s = uh(t = fa(t, ih));\n    // PORTING NOTE: We don't return an error if the user has not enabled\n    // persistence since `enableIndexeddbPersistence()` can fail on the Web.\n        if (!(null === (n = s.offlineComponents) || void 0 === n ? void 0 : n.indexBackfillerScheduler)) return N(\"Cannot enable indexes when persistence is disabled\"), \n    Promise.resolve();\n    const i = function(t) {\n        const e = \"string\" == typeof t ? function(t) {\n            try {\n                return JSON.parse(t);\n            } catch (t) {\n                throw new L(B.INVALID_ARGUMENT, \"Failed to parse JSON: \" + (null == t ? void 0 : t.message));\n            }\n        }(t) : t, n = [];\n        if (Array.isArray(e.indexes)) for (const t of e.indexes) {\n            const e = lf(t, \"collectionGroup\"), s = [];\n            if (Array.isArray(t.fields)) for (const e of t.fields) {\n                const t = zh(\"setIndexConfiguration\", lf(e, \"fieldPath\"));\n                \"CONTAINS\" === e.arrayConfig ? s.push(new dt(t, 2 /* IndexKind.CONTAINS */)) : \"ASCENDING\" === e.order ? s.push(new dt(t, 0 /* IndexKind.ASCENDING */)) : \"DESCENDING\" === e.order && s.push(new dt(t, 1 /* IndexKind.DESCENDING */));\n            }\n            n.push(new at(at.UNKNOWN_ID, e, s, wt.empty()));\n        }\n        return n;\n    }(e);\n    return La(s).then((t => async function(t, e) {\n        const n = $(t), s = n.indexManager, i = [];\n        return n.persistence.runTransaction(\"Configure indexes\", \"readwrite\", (t => s.getFieldIndexes(t).next((n => function(t, e, n, s, i) {\n            t = [ ...t ], e = [ ...e ], t.sort(n), e.sort(n);\n            const r = t.length, o = e.length;\n            let u = 0, c = 0;\n            for (;u < o && c < r; ) {\n                const r = n(t[c], e[u]);\n                r < 0 ? \n                // The element was removed if the next element in our ordered\n                // walkthrough is only in `before`.\n                i(t[c++]) : r > 0 ? \n                // The element was added if the next element in our ordered walkthrough\n                // is only in `after`.\n                s(e[u++]) : (u++, c++);\n            }\n            for (;u < o; ) s(e[u++]);\n            for (;c < r; ) i(t[c++]);\n        }(n, e, ft, (e => {\n            i.push(s.addFieldIndex(t, e));\n        }), (e => {\n            i.push(s.deleteFieldIndex(t, e));\n        })))).next((() => At.waitFor(i)))));\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    // The format of the LocalStorage key that stores the client state is:\n    //     firestore_clients_<persistence_prefix>_<instance_key>\n    (t, i)));\n}\n\nfunction lf(t, e) {\n    if (\"string\" != typeof t[e]) throw new L(B.INVALID_ARGUMENT, \"Missing string value for: \" + e);\n    return t[e];\n}\n\n/**\n * Cloud Firestore\n *\n * @packageDocumentation\n */ !function(t, e = !0) {\n    !function(t) {\n        v = t;\n    }(i), n(new r(\"firestore\", ((t, {instanceIdentifier: n, options: s}) => {\n        const i = t.getProvider(\"app\").getImmediate(), r = new ih(new Q(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 L(B.INVALID_ARGUMENT, '\"projectId\" not provided in firebase.initializeApp.');\n            return new Ft(t.options.projectId, e);\n        }(i, n), i);\n        return s = Object.assign({\n            useFetchStreams: e\n        }, s), r._setSettings(s), r;\n    }), \"PUBLIC\").setMultipleInstances(!0)), s(b, \"3.8.1\", t), \n    // BUILD_TARGET will be replaced by values like esm5, esm2017, cjs5, etc during the compilation\n    s(b, \"3.8.1\", \"__BUILD_TARGET__\");\n}();\n\nexport { Pl as AbstractUserDataWriter, Sa as AggregateField, Da as AggregateQuerySnapshot, Ih as Bytes, sh as CACHE_SIZE_UNLIMITED, Ia as CollectionReference, ya as DocumentReference, Dl as DocumentSnapshot, Th as FieldPath, Ah as FieldValue, ih as Firestore, L as FirestoreError, Rh as GeoPoint, nh as LoadBundleTask, pa as Query, ol as QueryCompositeFilterConstraint, nl as QueryConstraint, Cl as QueryDocumentSnapshot, gl as QueryEndAtConstraint, il as QueryFieldFilterConstraint, ll as QueryLimitConstraint, al as QueryOrderByConstraint, xl as QuerySnapshot, _l as QueryStartAtConstraint, Sl as SnapshotMetadata, nt as Timestamp, ef as Transaction, Zl as WriteBatch, Ft as _DatabaseId, ct as _DocumentKey, J as _EmptyAppCheckTokenProvider, K as _EmptyAuthCredentialsProvider, ut as _FieldPath, fa as _cast, F as _debugAssert, Gt as _isBase64Available, N as _logWarn, ca as _validateIsNotUsedTogether, Ql as addDoc, Jl as aggregateQuerySnapshotEqual, cl as and, uf as arrayRemove, of as arrayUnion, fh as clearIndexedDbPersistence, Ta as collection, Ea as collectionGroup, ga as connectFirestoreEmulator, Gl as deleteDoc, sf as deleteField, wh as disableNetwork, Aa as doc, Eh as documentId, ah as enableIndexedDbPersistence, hh as enableMultiTabIndexedDbPersistence, _h as enableNetwork, pl as endAt, yl as endBefore, uh as ensureFirestoreConfigured, zl as executeWrite, Yl as getCountFromServer, Ol as getDoc, Fl as getDocFromCache, $l as getDocFromServer, Bl as getDocs, Ll as getDocsFromCache, ql as getDocsFromServer, oh as getFirestore, cf as increment, rh as initializeFirestore, fl as limit, dl as limitToLast, gh as loadBundle, yh as namedQuery, jl as onSnapshot, Wl as onSnapshotsInSync, ul as or, hl as orderBy, sl as query, ba as queryEqual, Ra as refEqual, nf as runTransaction, rf as serverTimestamp, Ul as setDoc, hf as setIndexConfiguration, D as setLogLevel, kl as snapshotEqual, ml as startAfter, wl as startAt, mh as terminate, Kl as updateDoc, dh as waitForPendingWrites, rl as where, af as writeBatch };\n//# sourceMappingURL=index.esm2017.js.map\n","/**\n * @license\n * Copyright The Closure Library Authors.\n * SPDX-License-Identifier: Apache-2.0\n */\n\n/**\n * @fileoverview Default factory for <code>WebChannelTransport</code> to\n * avoid exposing concrete classes to clients.\n */\n\ngoog.provide('goog.net.createWebChannelTransport');\n\ngoog.require('goog.labs.net.webChannel.WebChannelBaseTransport');\ngoog.requireType('goog.net.WebChannelTransport');\n\n\n/**\n * Create a new WebChannelTransport instance using the default implementation.\n * Throws an error message if no default transport available in the current\n * environment.\n *\n * @return {!goog.net.WebChannelTransport} the newly created transport instance.\n */\ngoog.net.createWebChannelTransport = function() {\n  'use strict';\n  return new goog.labs.net.webChannel.WebChannelBaseTransport();\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\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"],"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","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","getUA","navigator","isSafari","forceEnvironment","Object","prototype","toString","call","isNode","userAgent","includes","FirebaseError","constructor","code","message","customData","super","name","setPrototypeOf","captureStackTrace","ErrorFactory","create","service","serviceName","errors","data","fullCode","template","PATTERN","_","key","value","replaceTemplate","fullMessage","deepEqual","a","b","aKeys","keys","bKeys","k","aProp","bProp","isObject","thing","getModularInstance","_delegate","Component","instanceFactory","type","multipleInstances","serviceProps","instantiationMode","onInstanceCreated","setInstantiationMode","mode","setMultipleInstances","setServiceProps","props","setInstanceCreatedCallback","callback","LogLevel","levelStringToEnum","debug","DEBUG","verbose","VERBOSE","INFO","warn","WARN","ERROR","silent","SILENT","defaultLogLevel","ConsoleMethod","defaultLogHandler","instance","logType","args","logLevel","now","Date","toISOString","method","goog","goog.global","aa","goog.isArrayLike","ba","val","s","goog.isObject","goog.UID_PROPERTY_","Math","random","goog.uidCounter_","fa","fn","selfObj","var_args","apply","bind","arguments","goog.bindJs_","ha","boundArgs","slice","newArgs","unshift","goog.bind","goog.bind.apply","Function","indexOf","goog.bindNative_","goog.partial","ia","goog.inherits","t","childCtor","parentCtor","tempCtor","superClass_","base","childCtor.base","me","methodName","goog.Disposable","v","disposed_","onDisposeCallbacks_","dispose","goog.Disposable.prototype.dispose","goog.getUid","obj","disposeInternal","goog.Disposable.MONITORING_MODE","hasOwnProperty","goog.Disposable.prototype.disposeInternal","shift","arr","opt_fromIndex","fromIndex","toArray","object","rv","extend","arr1","arr2","len1","len2","j","goog.events.Event","w","opt_target","currentTarget","target","defaultPrevented","preventDefault","goog.events.Event.prototype.preventDefault","PASSIVE_EVENTS","goog.global.addEventListener","addEventListener","defineProperty","passive","options","get","goog.nullFunction","goog.global.removeEventListener","removeEventListener","goog.string.internal.isEmptyOrWhitespace","pa","test","goog.string.internal.trim","trim","exec","ra","left","right","getNativeUserAgentString","sa","goog.global.navigator","matchUserAgent","x","goog.reflect.sinkValue","ta","goog.userAgent.VERSION","goog.userAgent.OPERA","goog.userAgent.IE","goog.userAgent.EDGE","goog.userAgent.EDGE_OR_IE","goog.userAgent.GECKO","toLowerCase","subString","goog.userAgent.WEBKIT","Ba","doc","documentMode","undefined","version","docMode","goog.userAgent.getDocumentMode_","parseFloat","Ea","Ja","goog.userAgent.isVersionOrHigherCache_","Ia","valueFn","cacheObj","ua","order","v1Subs","split","v2Subs","subCount","max","subIdx","v1Sub","v2Sub","v1Comp","v2Comp","goog.string.internal.compareElements_","goog.userAgent.DOCUMENT_MODE","goog.events.BrowserEvent","z","opt_e","opt_currentTarget","goog.events.Event.call","goog.events.BrowserEvent.base","relatedTarget","button","screenY","screenX","clientY","clientX","metaKey","shiftKey","altKey","ctrlKey","state","pointerId","pointerType","event_","init","relevantTouch","changedTouches","srcElement","nodeName","MOUSEOVER","fromElement","MOUSEOUT","toElement","pageX","pageY","goog.events.BrowserEvent.IE_POINTER_TYPE_MAP","goog.events.BrowserEvent.superClass_.preventDefault.call","arg","TOUCH","PEN","MOUSE","goog.events.BrowserEvent.prototype.preventDefault","be","returnValue","goog.events.Listenable.IMPLEMENTED_BY_PROP","goog.events.ListenableKey.counter_","goog.events.Listener","Oa","listener","src","capture","opt_handler","proxy","handler","removed","callOnce","goog.events.Listener.prototype.markAsRemoved","forEach","f","opt_obj","clone","Ra","res","PROTOTYPE_FIELDS","Ta","source","d","goog.events.ListenerMap","Ua","listeners","typeCount_","Wa","goog.events.ListenerMap.prototype.removeByKey","splice","markAsRemoved","goog.events.ListenerMap.findListenerIndex_","Va","listenerArray","opt_useCapture","opt_listenerScope","listenerObj","add","goog.events.ListenerMap.prototype.add","typeStr","index","goog.events.LISTENER_MAP_PROP_","goog.events.onStringMap_","goog.events.listen","opt_options","once","ab","goog.events.wrapListener","listen","goog.events.listen_","cb","listenerMap","goog.events.getListenerMap_","n","goog.events.getProxy","eventObject","proxyCallbackFunction","goog.events.handleBrowserEvent_","goog.events.BrowserFeature.PASSIVE_EVENTS","attachEvent","goog.events.getOnString_","addListener","removeListener","goog.events.listenOnce","listenOnce","goog.events.unlisten","hb","eventTargetListeners_","goog.events.unlistenByKey","ib","removeByKey","detachEvent","fb","Ya","goog.events.onString_","gb","opt_evt","listenerFn","listenerHandler","db","goog.events.LISTENER_WRAPPER_PROP_","bb","handleEvent","goog.events.EventTarget","B","goog.Disposable.call","actualEventTarget_","parentEventTarget_","C","goog.events.EventTarget.prototype.dispatchEvent","ancestorsTree","ancestor","getParentEventTarget","oldEvent","opt_ancestorsTree","fireListeners","kb","goog.events.EventTarget.prototype.fireListeners","concat","unlistenByKey","goog.events.EventTarget.prototype.removeEventListener","opt_capture","opt_handlerScope","goog.events.EventTarget.prototype.disposeInternal","goog.events.EventTarget.superClass_.disposeInternal.call","removeAllListeners","goog.events.EventTarget.prototype.listen","goog.events.EventTarget.prototype.listenOnce","goog.json.serialize","stringify","remove","mb","goog.async.run.workQueue_.remove","item","workHead_","next","workTail_","ub","module$contents$goog$async$WorkQueue_WorkQueue.freelist_","goog.async.FreeList","reset","create_","reset_","occupants_","head_","WorkItem","qb","scope","set","throwException","rb","exception","goog.global.setTimeout","setTimeout","goog.async.run","sb","opt_context","goog.async.run.schedule_","promise","goog.global.Promise.resolve","Promise","resolve","then","goog.async.run.processWorkQueue","goog.async.run.initializeRunner_","wb","goog.async.run.workQueueScheduled_","goog.async.run.workQueue_","module$contents$goog$async$WorkQueue_WorkQueue.freelist_.get","put","module$contents$goog$async$WorkQueue_WorkQueue.freelist_.put","goog.Timer","opt_interval","opt_timerObject","goog.events.EventTarget.call","interval_","timerObject_","boundTick_","tick_","last_","zb","goog.Timer.prototype.stop","enabled","timer_","clearTimeout","goog.Timer.callOnce","Ab","opt_delay","Number","doAction_","Bb","onTimer_","shouldFire_","args_","listener_","yb","JSC$2088_enabled","goog.Timer.prototype","JSC$2088_timer_","goog.Timer.prototype.tick_","elapsed","goog.Timer.intervalScale","dispatchEvent","dispatchTick","goog.Timer.TICK","stop","start","goog.Timer.prototype.start","goog.Timer.prototype.disposeInternal","goog.Timer.superClass_.disposeInternal.call","Throttle","interval","fire","goog.global.clearTimeout","goog.events.EventHandler","D","opt_scope","handler_","keys_","goog.events.EventHandler.typeArray_","Eb","goog.events.EventHandler.prototype.listen_","opt_fn","goog.events.EventHandler.prototype.removeAll","Fb","goog.labs.net.webChannel.WebChannelDebug","Gb","redactEnabled_","WebChannelDebug.prototype.xmlHttpChannelResponseText","E","id","responseText","opt_desc","WebChannelDebug.prototype.redactResponse_","responseArray","array","dataPart","redactResponse_","goog.events.EventHandler.prototype.disposeInternal","goog.events.EventHandler.superClass_.disposeInternal.call","removeAll","goog.events.EventHandler.prototype.handleEvent","disableRedact","WebChannelDebug.prototype.disableRedact","WebChannelDebug.prototype.info","goog.labs.net.webChannel.requestStats.Event","goog.labs.net.webChannel.requestStats.eventTarget_","Mb","Lb","Nb","goog.labs.net.webChannel.requestStats.Event.SERVER_REACHABILITY_EVENT","SERVER_REACHABILITY_EVENT","requestStats.notifyServerReachabilityEvent","H","reachabilityType","goog.labs.net.webChannel.requestStats.getStatEventTarget_","goog.labs.net.webChannel.requestStats.ServerReachabilityEvent","Ob","eventTarget","stat","goog.labs.net.webChannel.requestStats.Event.STAT_EVENT","STAT_EVENT","requestStats.notifyStatEvent","goog.labs.net.webChannel.requestStats.StatEvent","Pb","size","goog.labs.net.webChannel.requestStats.Event.TIMING_EVENT","TIMING_EVENT","J","ms","goog.labs.net.webChannel.requestStats.TimingEvent","goog.net.ErrorCode","NO_ERROR","ACCESS_DENIED","FILE_NOT_FOUND","FF_SILENT_ERROR","CUSTOM_ERROR","EXCEPTION","HTTP_ERROR","ABORT","TIMEOUT","OFFLINE","goog.net.EventType","COMPLETE","SUCCESS","READY","READY_STATE_CHANGE","INCREMENTAL_DATA","PROGRESS","DOWNLOAD_PROGRESS","UPLOAD_PROGRESS","goog.net.XmlHttpFactory","Sb","goog.net.XmlHttpFactory.prototype.getOptions","Tb","cachedOptions_","internalGetOptions","goog.net.WebChannel","Ub","Xb","goog.net.WebChannel.EventType","OPEN","CLOSE","MESSAGE","goog.net.WebChannel.MessageEvent","Vb","goog.net.WebChannel.MessageEvent.base","goog.net.WebChannel.ErrorEvent","Wb","goog.net.WebChannel.ErrorEvent.base","goog.net.DefaultXmlHttpFactory","Yb","goog.labs.net.webChannel.ChannelRequest","L","channel","channelDebug","opt_requestId","opt_retryId","channel_","channelDebug_","rid_","retryId_","eventHandler_","timeout_","goog.labs.net.webChannel.ChannelRequest.TIMEOUT_MS_","EDGE_POLLING_INTERVAL_","pollingTimer_","extraHeaders_","successful_","postData_","requestUri_","baseUri_","type_","requestStartTime_","watchDogTimeoutTime_","watchDogTimerId_","pendingMessages_","xmlHttp_","xmlHttpChunkStart_","lastError_","verb_","lastStatusCode_","cancelled_","readyStateChangeThrottleMs_","readyStateChangeThrottle_","firstByteReceived_","initialResponseDecoded_","decodeInitialResponse_","decodeChunks_","fetchResponseState_","goog.labs.net.webChannel.FetchResponseState","$b","textDecoder","responseBuffer","responseArrivedForFetch","createInstance","goog.net.DefaultXmlHttpFactory.prototype.createInstance","XMLHttpRequest","goog.net.DefaultXmlHttpFactory.prototype.internalGetOptions","goog.net.XmlHttp.factory_","factory","goog.labs.net.webChannel.ChannelRequest.INVALID_CHUNK_","goog.labs.net.webChannel.ChannelRequest.INCOMPLETE_CHUNK_","cc","ChannelRequest.prototype.xmlHttpPost","uri","postData","XML_HTTP","makeUnique","decodeChunks","sendXmlHttp_","ChannelRequest.prototype.sendXmlHttp_","ec","hostPrefix","N","ensureWatchDogTimer_","values","fc","queryData_","useSecondaryDomains","supportsCrossDomainXhrs_","createXhrIo","xmlHttpHandler_","readyStateChangeHandler_","headers","send","goog.labs.net.webChannel.requestStats.notifyServerReachabilityEvent","WebChannelDebug.prototype.xmlHttpChannelRequest","verb","attempt","params","keyValue","keyParts","h","Hb","ChannelRequest.prototype.useFetchStreamsForResponse_","jc","CLOSE_REQUEST","usesFetchStreams_","ChannelRequest.prototype.decodeNextChunks_","lc","readyState","chunkText","decodeNextChunksSuccessful","getNextChunk_","BAD_DATA","goog.labs.net.webChannel.requestStats.notifyStatEvent","REQUEST_INCOMPLETE_DATA","REQUEST_BAD_DATA","safeOnRequestData_","maybeResetBuffer_","NO_DATA","REQUEST_NO_DATA","backChannelRequest_","request","detectBufferingProxy_","bpDetectionDone_","clearBpDetectionTimer_","NOPROXY","xmlHttpChannelResponseText","cleanup_","dispatchFailure_","ChannelRequest.prototype.getNextChunk_","nc","sizeStartIndex","sizeEndIndex","isNaN","chunkStartIndex","substr","ChannelRequest.prototype.ensureWatchDogTimer_","pc","startWatchDogTimer_","ChannelRequest.prototype.startWatchDogTimer_","time","goog.labs.net.webChannel.requestStats.setTimeout","onWatchDogTimeout_","ChannelRequest.prototype.cancelWatchDogTimer_","ic","Q","ChannelRequest.prototype.dispatchFailure_","CLOSED","state_","onRequestComplete","ChannelRequest.prototype.cleanup_","P","cancelWatchDogTimer_","xmlhttp","abort","ChannelRequest.prototype.safeOnRequestData_","hasRequest","forwardChannelRequestPool_","OPENED","response","wireCodec_","parser_","ex","responseValues","handlePostResponse_","backChannelTimerId_","goog.labs.net.webChannel.WebChannelBase.RTT_ESTIMATE","clearDeadBackchannelTimer_","cancelBackChannelRequest_","tc","BACKCHANNEL_MISSING","lastPostResponseArrayId_","lastArrayId_","goog.labs.net.webChannel.WebChannelBase.OUTSTANDING_DATA_BACKCHANNEL_RETRY_CUTOFF","enableStreaming_","backChannelRetryCount_","deadBackChannelTimerId_","onBackChannelDead_","getRequestCount","onForwardChannelFlushed_","forwardChannelFlushedCallback_","signalError_","BAD_RESPONSE","respArray","nextArray","onInput_","OPENING","sid_","hostPrefix_","negotiatedVersion","channelVersion_","negotiatedServerVersion","serverVersion_","serverKeepaliveMs","Ca","timeout","backChannelRequestTimeoutMs_","applyControlHeaders_","xhr","clientProtocol","xhr_","getResponseHeader","goog.net.WebChannel.X_CLIENT_WIRE_PROTOCOL","requestPool_","maxSize_","maxPoolSizeConfigured_","Set","request_","addRequest","getHttpSessionIdParam","httpSessionIdParam_","httpSessionIdHeader","goog.net.WebChannel.X_HTTP_SESSION_ID","setHttpSessionId","httpSessionId_","setParameterValue","forwardChannelUri_","channelOpened","handshakeRttMs_","startBackchannelAfterHandshake_","backChannelUri_","createDataUri","getBackChannelUri","path_","removeRequest","opt_timeout","ensureBackChannel_","outgoingMaps_","ensureForwardChannel_","STOP","disconnect","channelHandleArray","goog.structs.forEach","Dc","col","goog.structs.getKeys","getKeys","getValues","Map","from","l","goog.structs.getValues","ChannelRequest.prototype.setTimeout","goog.labs.net.webChannel.ChannelRequest.prototype","ChannelRequest.prototype.readyStateChangeHandler_","evt","throttle","INTERACTIVE","getReadyState","ChannelRequest.prototype.xmlHttpHandler_","onXmlHttpReadyStateChanged_","errorCode","getLastErrorCode","getStatus","getResponseText","getResponse","status","useFetchStreamsForResponse_","responseChunks","responseLength","requestCompleted","TextDecoder","goog.global.TextDecoder","decode","stream","WebChannelDebug.prototype.xmlHttpChannelResponseMetaData","statusCode","xmlHttpChannelResponseMetaData","goog.net.WebChannel.X_HTTP_INITIAL_RESPONSE","m","initialResponse","UNKNOWN_SESSION_ID","I","REQUEST_UNKNOWN_SESSION_ID","decodeNextChunks_","listen_","pollResponse_","STATUS","REQUEST_BAD_STATUS","ChannelRequest.prototype.pollResponse_","cancel","ChannelRequest.prototype.cancel","ChannelRequest.prototype.onWatchDogTimeout_","WebChannelDebug.prototype.timeoutResponse","timeoutResponse","handleTimeout_","REQUEST_TIMEOUT","goog.uri.utils.splitRe_","RegExp","goog.Uri","T","opt_uri","opt_ignoreCase","domain_","userInfo_","scheme_","port_","fragment_","ignoreCase_","Gc","setScheme","setUserInfo","setPort","setPath","goog.Uri.QueryData","encodedQuery_","keyMap_","count_","Jc","setQueryData","SCHEME","goog.Uri.decodeOrEmpty_","USER_INFO","setDomain","DOMAIN","PORT","PATH","QUERY_DATA","setFragment","FRAGMENT","goog.Uri.prototype.clone","M","goog.Uri.prototype.setScheme","newScheme","opt_decode","goog.Uri.prototype.setPort","Hc","newPort","goog.Uri.prototype.setQueryData","queryData","goog.Uri.QueryData.prototype.setIgnoreCase","ignoreCase","ensureKeyMapInitialized_","invalidateCache_","lowerCase","setValues","setIgnoreCase","goog.Uri.encodeSpecialChars_","goog.Uri.reDisallowedInQuery_","goog.Uri.prototype.setParameterValue","S","goog.Uri.prototype.makeUnique","RANDOM","floor","abs","opt_preserveReserved","decodeURI","decodeURIComponent","Lc","unescapedPart","extra","opt_removeDoubleEncoding","encoded","encodeURI","goog.Uri.encodeChar_","Sc","ch","goog.Uri.prototype.toString","scheme","getScheme","goog.Uri.reDisallowedInSchemeOrUserInfo_","domain","getDomain","userInfo","getUserInfo","encodeURIComponent","getPort","path","getPath","hasDomain","goog.Uri.reDisallowedInAbsolutePath_","goog.Uri.reDisallowedInRelativePath_","query","getEncodedQuery","fragment","getFragment","goog.Uri.reDisallowedInFragment_","Ic","opt_query","goog.Uri.QueryData.prototype.ensureKeyMapInitialized_","U","goog.uri.utils.parseQueryData","encodedQuery","pairs","indexOfEquals","Tc","goog.Uri.QueryData.prototype.remove","getKeyName_","has","delete","goog.Uri.QueryData.prototype.containsKey","Uc","goog.Uri.QueryData.prototype.setValues","goog.Uri.QueryData.prototype.getKeyName_","V","keyName","goog.Uri.QueryData.prototype.add","goog.Uri.QueryData.prototype","goog.Uri.QueryData.prototype.forEach","goog.Uri.QueryData.prototype.getKeys","vals","goog.Uri.QueryData.prototype.getValues","opt_key","containsKey","goog.Uri.QueryData.prototype.set","goog.Uri.QueryData.prototype.get","opt_default","goog.Uri.QueryData.prototype.toString","encodedKey","param","ForwardChannelRequestPool","Wc","opt_maxPoolSize","module$contents$goog$labs$net$webChannel$ForwardChannelRequestPool_ForwardChannelRequestPool.MAX_POOL_SIZE_","goog.global.PerformanceNavigationTiming","PerformanceNavigationTiming","entrys","goog.global.performance.getEntriesByType","performance","getEntriesByType","nextHopProtocol","goog.global.chrome","chrome","goog.global.chrome.loadTimes","loadTimes","wasFetchedViaSpdy","Yc","ForwardChannelRequestPool.prototype.isFull","ForwardChannelRequestPool.prototype.getRequestCount","uc","ForwardChannelRequestPool.prototype.hasRequest","req","ForwardChannelRequestPool.prototype.addRequest","vc","ForwardChannelRequestPool.prototype.removeRequest","ForwardChannelRequestPool.prototype.getPendingMessages","Zc","result","goog.json.NativeJsonProcessor","goog.labs.net.webChannel.WireV8","WireV8.prototype.encodeMessage","bd","buffer","opt_prefix","prefix","encodedValue","netUtils.imageCallback_","dd","img","debugText","onload","onerror","onabort","ontimeout","goog.net.FetchXmlHttpFactory","opts","worker_","worker","streamBinaryChunks_","streamBinaryChunks","goog.net.FetchXmlHttp","goog.net.FetchXmlHttp.base","credentialsMode_","goog.net.FetchXmlHttp.RequestState.UNSENT","responseType","statusText","onreadystatechange","requestHeaders_","Headers","responseHeaders_","method_","url_","inProgress_","textDecoder_","currentReader_","fetchResponse_","ForwardChannelRequestPool.prototype.cancel","getPendingMessages","clear","goog.json.NativeJsonProcessor.prototype.stringify","opt_replacer","goog.json.NativeJsonProcessor.prototype.parse","opt_reviver","goog.net.FetchXmlHttpFactory.prototype.createInstance","goog.functions.constant","retValue","UNSENT","goog.net.FetchXmlHttp.prototype.readInputFromFetch_","read","handleDataFromStream_","catch","handleSendFailure_","goog.net.FetchXmlHttp.prototype.requestDone_","DONE","hd","dispatchCallback_","goog.net.FetchXmlHttp.prototype.dispatchCallback_","fd","open","goog.net.FetchXmlHttp.prototype.open","url","goog.net.FetchXmlHttp.prototype","goog.net.FetchXmlHttp.prototype.send","opt_data","requestInit","credentials","cache","body","fetch","Request","handleResponse_","goog.net.FetchXmlHttp.prototype.abort","requestDone_","goog.net.FetchXmlHttp.prototype.handleResponse_","HEADER_RECEIVED","LOADING","arrayBuffer","handleResponseArrayBuffer_","ReadableStream","getReader","readInputFromFetch_","text","handleResponseText_","goog.net.FetchXmlHttp.prototype.handleDataFromStream_","dataPacket","Uint8Array","newText","done","goog.net.FetchXmlHttp.prototype.handleResponseText_","goog.net.FetchXmlHttp.prototype.handleResponseArrayBuffer_","responseArrayBuffer","goog.net.FetchXmlHttp.prototype.handleSendFailure_","setRequestHeader","goog.net.FetchXmlHttp.prototype.setRequestHeader","header","append","goog.net.FetchXmlHttp.prototype.getResponseHeader","getAllResponseHeaders","goog.net.FetchXmlHttp.prototype.getAllResponseHeaders","lines","iter","entries","entry","pair","getCredentialsMode","setCredentialsMode","goog.json.hybrid.parse","goog.net.XhrIo","W","opt_xmlHttpFactory","goog.net.XhrIo.base","xmlHttpFactory_","active_","xhrOptions_","lastUri_","lastErrorCode_","inAbort_","inOpen_","inSend_","errorDispatched_","timeoutInterval_","timeoutId_","responseType_","goog.net.XhrIo.ResponseType.DEFAULT","useXhr2Timeout_","withCredentials_","DEFAULT","goog.net.XhrIo.HTTP_SCHEME_PATTERN","goog.net.XhrIo.METHODS_WITH_FORM_DATA","od","goog.net.XhrIo.prototype.error_","err","rd","dispatchErrors_","sd","cleanUpXhr_","goog.net.XhrIo.prototype.dispatchErrors_","td","goog.net.XhrIo.prototype.onReadyStateChangeHelper_","LOCAL_REQUEST_ERROR","onReadyStateChange_","isComplete","isSuccess","OK","CREATED","ACCEPTED","NO_CONTENT","PARTIAL_CONTENT","NOT_MODIFIED","QUIRK_IE_NO_CONTENT","goog.global.self","goog.global.self.location","location","protocol","goog.global.self.location.protocol","goog.net.XhrIo.HTTP_SCHEME_PATTERN.test","LOADED","getStatusText","goog.net.XhrIo.prototype.cleanUpXhr_","opt_fromDispose","cleanUpTimeoutTimer_","clearedOnReadyStateChange","USE_NULL_FUNCTION","goog.net.XhrIo.prototype.cleanUpTimeoutTimer_","pd","goog.net.XhrIo.prototype.getReadyState","O","UNINITIALIZED","hc","goog.net.XhrIo.prototype.getResponse","TEXT","ARRAY_BUFFER","mozResponseArrayBuffer","exports.generateHttpHeadersOverwriteParam","Qa","exports.setHttpHeadersWithOverwriteParam","urlParam","extraHeaders","httpHeaders","module$exports$goog$net$rpc$HttpCors.generateHttpHeadersOverwriteParam","getInternalChannelParam","paramName","defaultValue","internalChannelParams","goog.labs.net.webChannel.WebChannelBase","xd","extraParams_","httpHeadersOverwriteParam_","initHeaders_","nextMapId_","nextRid_","failFast_","$jscomp.scope.getInternalChannelParam","forwardChannelTimerId_","allowStreamingMode_","backChannelAttemptId_","forwardChannelRetryCount_","baseRetryDelayMs_","retryDelaySeedMs_","forwardChannelMaxRetries_","forwardChannelRequestTimeoutMs_","xmlHttpFactory","useFetchStreams","supportsCrossDomainXhr","concurrentRequestLimit","fastHandshake_","fastHandshake","encodeInitMessageHeaders_","encodeInitMessageHeaders","blockingHandshake_","blockingHandshake","forceLongPolling","detectBufferingProxy","nonAckedMapsAtChannelClose_","bpDetectionTimerId_","Ac","WebChannelBase.prototype.disconnect","cancelRequests_","rid","zd","addAdditionalParams_","requestSent","goog.global.navigator.sendBeacon","sendBeacon","goog.global.Image","Image","onClose_","WebChannelBase.prototype.cancelBackChannelRequest_","sc","WebChannelBase.prototype.cancelRequests_","yd","clearForwardChannelTimer_","WebChannelBase.prototype.ensureForwardChannel_","zc","isFull","onStartForwardChannelTimer_","Ed","WebChannelBase.prototype.makeForwardChannelRequest_","opt_retryRequest","module$exports$goog$net$rpc$HttpCors.setHttpHeadersWithOverwriteParam","requeuePendingMaps_","requestText","dequeueOutgoingMaps_","goog.labs.net.webChannel.WebChannelBase.MAX_MAPS_PER_REQUEST_","round","WebChannelBase.prototype.addAdditionalParams_","WebChannelBase.prototype.dequeueOutgoingMaps_","Dd","maxNum","count","min","badMapHandler","badMapError","offset","messageQueue","mapId","map","encodeMessage","pendingMessages","WebChannelBase.prototype.ensureBackChannel_","yc","onStartBackChannelTimer_","WebChannelBase.prototype.maybeRetryBackChannel_","goog.labs.net.webChannel.WebChannelBase.BACK_CHANNEL_MAX_RETRIES","getRetryTime_","oc","WebChannelBase.prototype.clearBpDetectionTimer_","WebChannelBase.prototype.startBackChannel_","Fd","WebChannelBase.prototype.clearDeadBackchannelTimer_","rc","WebChannelBase.prototype.onRequestComplete","mc","BACK_CHANNEL","FORWARD_CHANNEL","lastError","WebChannelBase.prototype.maybeRetryForwardChannel_","INIT","getForwardChannelMaxRetries","maybeRetryForwardChannel_","maybeRetryBackChannel_","REQUEST_FAILED","WebChannelBase.prototype.getRetryTime_","Cd","retryCount","retryTime","goog.labs.net.webChannel.WebChannelBase.INACTIVE_CHANNEL_RETRY_FACTOR","WebChannelBase.prototype.signalError_","R","imageUri","testNetworkCallback_","goog.global.location","goog.global.location.protocol","netUtils.testLoadImage","goog.labs.net.webChannel.netUtils.imageCallback_","goog.labs.net.webChannel.netUtils.NETWORK_TIMEOUT","cd","ERROR_OTHER","onError_","channelError","Ad","WebChannelBase.prototype.onClose_","channelClosed","WebChannelBase.prototype.createDataUri","wc","locationPage","hostName","hostname","opt_scheme","opt_domain","opt_port","getHttpSessionId","WebChannelBase.prototype.createXhrIo","isStreaming","setWithCredentials","WebChannelBase.Handler","Gd","goog.labs.net.webChannel.WebChannelBaseTransport","Hd","X","goog.labs.net.webChannel.WebChannelBaseTransport.Channel.base","messageUrlParams_","messageUrlParams","messageHeaders","clientProtocolHeaderRequired","goog.net.WebChannel.X_CLIENT_PROTOCOL","goog.net.WebChannel.X_CLIENT_PROTOCOL_WEB_CHANNEL","initHeaders","initMessageHeaders","messageContentType","goog.net.WebChannel.X_WEBCHANNEL_CONTENT_TYPE","clientProfile","goog.net.WebChannel.X_WEBCHANNEL_CLIENT_PROFILE","httpHeadersOverwriteParam","supportsCrossDomainXhr_","sendRawJson_","sendRawJson","httpSessionIdParam","channelHandler_","goog.labs.net.webChannel.WebChannelBaseTransport.Channel.Handler_","WebChannelBaseTransport.Channel.MessageEvent","Id","goog.net.WebChannel.MessageEvent.call","goog.labs.net.webChannel.WebChannelBaseTransport.Channel.MessageEvent.base","metadata","__sm__","metadataKey","Jd","goog.net.WebChannel.ErrorEvent.call","goog.labs.net.webChannel.WebChannelBaseTransport.Channel.ErrorEvent.base","NETWORK_ERROR","Y","goog.net.XhrIo.prototype.setWithCredentials","withCredentials","JSC$2188_send","goog.net.XhrIo.prototype.send","opt_method","opt_content","opt_headers","toUpperCase","createXhr","goog.net.XmlHttp.factory_.createInstance","getOptions","goog.net.XmlHttp.factory_.getOptions","error_","content","getPrototypeOf","contentTypeKey","find","contentIsFormData","FormData","goog.net.XhrIo.CONTENT_TYPE_HEADER","goog.net.XhrIo.FORM_CONTENT_TYPE","goog.net.XhrIo.shouldUseXhr2Timeout_","y","goog.userAgent.isVersionOrHigher","goog.net.XhrIo.prototype","JSC$2188_timeout_","goog.net.XhrIo.prototype.timeout_","goog.net.XhrIo.prototype.abort","opt_failureCode","goog.net.XhrIo.prototype.disposeInternal","goog.net.XhrIo.prototype.disposeInternal.base","goog.net.XhrIo.prototype.onReadyStateChange_","isDisposed","onReadyStateChangeHelper_","onReadyStateChangeEntryPoint_","goog.net.XhrIo.prototype.onReadyStateChangeEntryPoint_","goog.net.XhrIo.prototype.getStatus","goog.net.XhrIo.prototype.getResponseText","getResponseJson","goog.net.XhrIo.prototype.getResponseJson","opt_xssiPrefix","kd","goog.net.XhrIo.prototype.getLastErrorCode","JSC$2188_getLastError","goog.net.XhrIo.prototype.getLastError","goog.labs.net.webChannel.Wire.LATEST_CHANNEL_VERSION","goog.labs.net.webChannel.WebChannelBase.prototype","JSC$2195_state_","WebChannelBase.prototype.onStartForwardChannelTimer_","startForwardChannel_","total","goog.labs.net.webChannel.Wire.RAW_DATA_KEY","__data__","goog.labs.net.webChannel.WebChannelBase.MAX_CHARS_PER_GET_","goog.net.WebChannelTransport.CLIENT_VERSION","xmlHttpPost","makeForwardChannelRequest_","WebChannelBase.prototype.onStartBackChannelTimer_","startBackChannel_","bpDetectionTimeout","onBpDetectionTimer_","WebChannelBase.prototype.onBpDetectionTimer_","PROXY","WebChannelBase.prototype.onBackChannelDead_","BACKCHANNEL_DEAD","WebChannelBase.prototype.testNetworkCallback_","networkUp","ERROR_NETWORK","WebChannelBase.Handler.prototype.channelOpened","goog.labs.net.webChannel.WebChannelBase.Handler.prototype","WebChannelBase.Handler.prototype.channelHandleArray","WebChannelBase.Handler.prototype.channelError","WebChannelBase.Handler.prototype.channelClosed","WebChannelBase.Handler.prototype.badMapError","createWebChannel","WebChannelBaseTransport.prototype.createWebChannel","goog.labs.net.webChannel.WebChannelBaseTransport.Channel","WebChannelBaseTransport.Channel.prototype.open","supportCrossDomain","CONNECT_ATTEMPT","channelPath","opt_extraParams","connectChannel_","close","WebChannelBaseTransport.Channel.prototype.close","WebChannelBaseTransport.Channel.prototype.send","rawJson","messageToMapObject_","WebChannelBaseTransport.Channel.prototype.disposeInternal","goog.labs.net.webChannel.WebChannelBaseTransport.Channel.superClass_.disposeInternal.call","goog.labs.net.webChannel.WebChannelBaseTransport.Channel.prototype.disposeInternal.base","goog.labs.net.webChannel.WebChannelBaseTransport.Channel.MessageEvent","goog.labs.net.webChannel.WebChannelBaseTransport.Channel.ErrorEvent","goog.labs.net.webChannel.WebChannelBase.Handler","WebChannelBaseTransport.Channel.Handler_.prototype.channelOpened","WebChannelBaseTransport.Channel.Handler_.prototype.channelHandleArray","WebChannelBaseTransport.Channel.Handler_.prototype.channelError","WebChannelBaseTransport.Channel.Handler_.prototype.channelClosed","Qb","Rb","EventType","K","getLastError","ErrorCode","module","Event","FetchXmlHttpFactory","WebChannel","XhrIo","uid","isAuthenticated","toKey","isEqual","UNAUTHENTICATED","GOOGLE_CREDENTIALS","FIRST_PARTY","MOCK_USER","_logLevel","_logHandler","_userLogHandler","TypeError","setLogLevel","logHandler","userLogHandler","log","F","$","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","q","reject","user","getToken","invalidateToken","enqueueRetryable","shutdown","G","token","changeListener","currentUser","forceRefresh","auth","o","r","addAuthTokenListener","onInit","getImmediate","optional","accessToken","removeAuthTokenListener","getUid","g","getAuthHeaderValueForFirstParty","appCheck","A","addTokenListener","removeTokenListener","crypto","msCrypto","getRandomValues","static","Z","tt","every","et","nt","seconds","nanoseconds","fromMillis","getTime","toDate","toMillis","_compareTo","toJSON","valueOf","padStart","st","timestamp","compareTo","toMicroseconds","toTimestamp","it","segments","len","comparator","child","limit","construct","popFirst","popLast","firstSegment","lastSegment","isEmpty","isPrefixOf","isImmediateParentOf","rt","canonicalString","filter","ot","ut","isValidIdentifier","isKeyField","ct","fromString","emptyPath","collectionGroup","hasCollectionId","getCollectionGroup","getCollectionPath","at","indexId","fields","indexState","ht","kind","lt","ft","_t","UNKNOWN_ID","dt","fieldPath","wt","sequenceNumber","yt","mt","fromTimestamp","empty","gt","readTime","documentKey","largestBatchId","pt","It","Tt","onCommittedListeners","addOnCommittedListener","raiseOnCommittedEvent","async","Et","At","nextCallback","catchCallback","isDone","callbackAttached","wrapFailure","wrapSuccess","toPromise","wrapUserFunction","waitFor","Rt","action","transaction","aborted","oncomplete","vt","xt","commit","store","objectStore","St","bt","Dt","indexedDB","deleteDatabase","onsuccess","onblocked","onupgradeneeded","oldVersion","onversionchange","Pt","cursor","Vt","getAll","range","primaryKey","continue","reverse","openKeyCursor","openCursor","Ct","Nt","asyncQueue","task","started","enqueueAfterDelay","kt","localStore","persistence","runTransaction","doWhile","indexManager","getNextCollectionGroupToUpdate","getMinOffsetFromCollectionGroup","localDocuments","getNextDocuments","changes","updateIndexEntries","updateCollectionGroup","batchId","Ot","previousValue","sequenceNumberHandler","writeSequenceNumber","Mt","databaseId","appId","persistenceKey","ssl","autoDetectLongPolling","Ft","projectId","database","isDefaultDatabase","$t","Bt","Lt","qt","Ut","Kt","isInteger","MAX_SAFE_INTEGER","MIN_SAFE_INTEGER","Gt","Qt","binaryString","Symbol","iterator","toBase64","toUint8Array","approximateByteSize","EMPTY_BYTE_STRING","jt","Wt","nanos","zt","Ht","fromBase64String","fromUint8Array","Jt","mapValue","__type__","stringValue","Yt","__previous_value__","Xt","__local_write_time__","timestampValue","Zt","te","nullValue","ee","we","ne","booleanValue","bytesValue","referenceValue","geoPointValue","latitude","longitude","integerValue","doubleValue","arrayValue","se","ie","re","sort","oe","ue","fromName","ce","ae","he","le","fe","de","_e","assign","NaN","ge","ye","inclusive","pe","Ie","position","Te","field","dir","Ee","Ae","Re","op","createKeyFieldInFilter","ke","$e","Be","Le","qe","Oe","Me","matches","matchesComparison","isInequality","getFlattenedFilters","getFilters","getFirstInequalityField","filters","Pe","reduce","ve","Ve","Se","De","Ce","xe","Ne","Fe","some","Ue","Ke","Ge","root","je","EMPTY","insert","copy","BLACK","minKey","maxKey","inorderTraversal","reverseTraversal","getIterator","Qe","getIteratorFrom","getReverseIterator","getReverseIteratorFrom","isReverse","nodeStack","getNext","pop","hasNext","peek","color","RED","fixUp","removeMin","isRed","moveRedLeft","rotateRight","moveRedRight","rotateLeft","colorFlip","checkMaxDepth","check","pow","We","first","last","forEachInRange","forEachWhile","firstAfterOrEqual","ze","unionWith","He","Je","covers","Ye","getFieldsMap","setAll","applyChanges","Xe","Ze","documentType","createTime","documentState","convertToFoundDocument","convertToNoDocument","convertToUnknownDocument","setHasCommittedMutations","setHasLocalMutations","setReadTime","hasLocalMutations","hasCommittedMutations","hasPendingWrites","isValidDocument","isFoundDocument","isNoDocument","isUnknownDocument","mutableCopy","tn","orderBy","startAt","endAt","en","nn","sn","rn","isDocumentKey","on","un","cn","an","explicitOrderBy","limitType","hn","ln","dn","_n","wn","mn","keyField","gn","yn","pn","In","Tn","En","An","Rn","bn","Pn","vn","Vn","Sn","Dn","Cn","kn","On","Mn","Fn","$n","Nn","Ln","xn","Bn","elements","qn","Un","transform","Gn","transformResults","Qn","updateTime","exists","isNone","jn","Wn","zn","is","none","Zn","ts","Hn","ns","fieldTransforms","precondition","es","Jn","ss","fieldMask","Yn","Xn","Kn","getFieldMask","rs","os","us","cs","as","hs","ls","mapKeyFn","equalsFn","inner","innerSize","fs","ds","_s","ws","overlayedDocument","gs","ps","ys","Is","Ts","Es","As","Rs","bs","snapshotVersion","targetChanges","targetMismatches","documentUpdates","resolvedLimboDocuments","Ps","createSynthesizedTargetChangeForCurrentChange","resumeToken","current","addedDocuments","modifiedDocuments","removedDocuments","vs","removedTargetIds","Vs","targetId","Ss","targetIds","cause","Ds","Ns","Cs","xs","forEachTarget","removeTarget","newNoDocument","purpose","getRemoteKeysForTarget","ks","asc","desc","Os","in","Ms","and","or","Fs","$s","Bs","Ls","qs","Us","Ks","wi","Gs","Qs","Hs","js","Ws","zs","Js","Ys","newFoundDocument","ti","update","updateMask","_i","verify","updateTransforms","setToServerValue","appendMissingElements","removeAllFromArray","increment","currentDocument","ei","fromServerFormat","fieldPaths","si","documents","ii","structuredQuery","parent","collectionId","allDescendants","di","where","li","direction","ci","before","ri","ui","fi","unaryFilter","fieldFilter","compositeFilter","ai","hi","mi","yi","gi","pi","Ii","Ti","Ei","Ai","Ri","bi","Pi","vi","Vi","Si","Di","Ci","xi","Ni","ki","Oi","Mi","Fi","$i","Bi","Li","qi","Ui","Ki","currentSequenceNumber","Gi","Qi","localWriteTime","baseMutations","mutations","applyToRemoteDocument","mutationResults","applyToLocalView","applyToLocalDocumentSet","mutatedFields","ji","batch","commitVersion","docVersions","Wi","mutation","getKey","zi","lastLimboFreeSnapshotVersion","withSequenceNumber","withResumeToken","withLastLimboFreeSnapshotVersion","Hi","Yi","prefixPath","documentId","Xi","noDocument","Zi","unknownDocument","tr","er","localWriteTimeMs","nr","lastListenSequenceNumber","sr","canonicalId","ir","rr","overlayMutation","ur","cr","getBundleMetadata","ar","bundleId","saveBundleMetadata","getNamedQuery","hr","bundledQuery","saveNamedQuery","lr","userId","getOverlay","fr","getOverlays","saveOverlays","removeOverlaysForBatchId","IDBKeyRange","bound","getOverlaysForCollection","POSITIVE_INFINITY","getOverlaysForCollectionGroup","collectionPath","dr","_r","wr","ceil","mr","codePointAt","seed","DataView","ArrayBuffer","setFloat64","gr","yr","pr","Ir","directionalValue","Tr","Er","Ar","Rr","br","Sr","Vr","Pr","vr","xr","Dr","Cr","Nr","kr","addToCollectionParentIndex","getCollectionParents","getEntries","addFieldIndex","deleteFieldIndex","getDocumentsMatchingTarget","getIndexType","getFieldIndexes","getMinOffset","Or","Mr","Fr","Br","Lr","$r","fromSegments","createRange","orderedDocumentKey","only","upperBound","qr","mapArray","Ur","didRun","sequenceNumbersCollected","targetsRemoved","documentsRemoved","Kr","cacheSizeCollectionThreshold","percentileToCollect","maximumSequenceNumbersToCollect","DEFAULT_COLLECTION_PERCENTILE","DEFAULT_MAX_SEQUENCE_NUMBERS_TO_COLLECT","Gr","Qr","DISABLED","jr","referenceDelegate","checkEmpty","NEGATIVE_INFINITY","zr","addMutationBatch","Hr","lookupMutationBatch","getNextMutationBatchAfterBatchId","lowerBound","getHighestUnacknowledgedBatchId","getAllMutationBatches","getAllMutationBatchesAffectingDocumentKey","getAllMutationBatchesAffectingDocumentKeys","getAllMutationBatchesAffectingQuery","removeMutationBatch","markPotentiallyOrphaned","performConsistencyCheck","Wr","Jr","lastAcknowledgedBatchId","lastStreamToken","Yr","Xr","allocateTargetId","highestTargetId","getLastRemoteSnapshotVersion","lastRemoteSnapshotVersion","getHighestSequenceNumber","highestListenSequenceNumber","setTargetsMetadata","addTargetData","targetCount","updateTargetData","removeTargetData","removeMatchingKeysForTargetId","Zr","removeTargets","to","getTargetCount","getTargetData","addMatchingKeys","eo","addReference","removeMatchingKeys","removeReference","getMatchingKeysForTargetId","no","so","maxValue","io","garbageCollector","collectGarbage","ro","calculateTargetCount","nthSequenceNumber","removeOrphanedDocuments","collect","getCacheSize","oo","getTargetCache","uo","getRemoteDocumentCache","newChangeBuffer","getEntry","removeEntry","updateLimboDocument","getSize","co","changesApplied","addEntry","assertNotApplied","newInvalidDocument","getFromCache","getAllFromCache","ao","setIndexManager","_o","updateMetadata","getMetadata","byteSize","wo","go","getAllFromCollection","getAllFromCollectionGroup","mo","lo","trackRemovals","fo","newUnknownDocument","Ji","ho","yo","po","remoteDocumentCache","mutationQueue","documentOverlayCache","getDocument","getDocuments","getLocalViewOfDocuments","populateOverlays","computeViews","getOverlayedDocuments","recalculateAndSaveOverlays","recalculateAndSaveOverlaysForDocumentKeys","getDocumentsMatchingQuery","getDocumentsMatchingDocumentQuery","getDocumentsMatchingCollectionGroupQuery","getDocumentsMatchingCollectionQuery","Io","To","overlays","Eo","Ao","Ro","bo","docs","Po","vo","Vo","setDatabaseDeletedListener","setNetworkEnabled","getIndexManager","getDocumentOverlayCache","getMutationQueue","getBundleCache","So","Do","fromPath","Co","createObjectStore","keyPath","autoIncrement","createIndex","unique","xo","deleteObjectStore","objectStoreNames","contains","No","ko","allowTabSynchronization","clientId","Xs","isPrimary","networkEnabled","Zs","inForeground","ni","localStorage","oi","newVersion","enqueueAndForget","Mo","updateTimeMs","Oo","removeItem","ownerId","leaseTimestampMs","visibilityState","appVersion","enterRestrictedMode","getItem","setItem","Fo","$o","fromCache","docChanges","Bo","initialize","Lo","qo","Uo","removedBatchIds","addedBatchIds","Go","jo","Wo","zo","Ho","Jo","Zo","Yo","Xo","eu","nu","su","iu","ru","ou","uu","activeTargetIds","cu","onlineState","au","hu","syncEngine","onlineStateHandler","storage","getAllActiveQueryTargets","isActiveQueryTarget","addPendingMutation","updateMutationState","addLocalQueryTarget","removeLocalQueryTarget","isLocalQueryTarget","clearQueryState","updateQueryState","handleUserChange","setOnlineState","notifyBundleLoaded","storageArea","newValue","all","lu","fu","du","_u","BatchGetDocuments","Commit","RunQuery","RunAggregationQuery","wu","onMessage","mu","databaseInfo","forwardChannelRequestTimeoutMs","gu","yu","pu","Iu","timerId","skipDelay","Tu","connection","authCredentialsProvider","appCheckCredentialsProvider","Ko","Qo","Eu","targetChange","targetChangeType","documentChange","documentDelete","documentRemove","addTarget","labels","Au","streamToken","writeResults","commitTime","tu","writes","Ru","authCredentials","appCheckCredentials","terminate","Pu","vu","datastore","remoteSyncer","Mu","Su","Vu","Du","Ou","ku","xu","Cu","Nu","Fu","$u","Bu","Lu","rejectListen","qu","applyRemoteEvent","Uu","Ku","Gu","Qu","ju","Wu","zu","Hu","Ju","applySuccessfulWrite","Yu","rejectFailedWrite","Xu","verifyOperationInProgress","handleCredentialChange","Zu","targetTimeMs","removalCallback","deferred","timerHandle","handleDelayElapsed","keyedMap","sortedSet","track","oldDocs","mutatedKeys","syncStateChanged","excludesMetadataChanges","hasCachedResults","emptySet","queries","ac","onListen","onError","bu","dc","onUnlisten","_c","includeMetadataChanges","fromInitialDocuments","byteLength","gc","collectionGroups","progress","bytesLoaded","documentsLoaded","namedQuery","documentMetadata","taskState","totalDocuments","totalBytes","snapshot","Ec","view","Rc","remoteStore","eventManager","sharedClientState","maxConcurrentLimboResolutions","isPrimaryClient","bc","Pc","Bc","Fc","Cc","qc","xc","Mc","Oc","Nc","$c","Kc","Qc","Xc","createSynthesizedRemoteEventForCurrentChange","ea","synchronizeTabs","gcScheduler","indexBackfillerScheduler","initialUser","cacheSizeBytes","forceOwnership","withCacheSize","oa","createDatastore","createRemoteStore","createEventManager","createSyncEngine","ca","la","da","wa","ignoreUndefinedProperties","experimentalForceLongPolling","experimentalAutoDetectLongPolling","ma","_authCredentials","_appCheckCredentials","_databaseId","_app","_persistenceKey","_settings","_settingsFrozen","app","_initialized","_terminated","_terminateTask","_setSettings","client","sessionIndex","iamToken","authTokenFactory","_getSettings","_freezeSettings","_delete","_terminate","settings","ga","mockUserToken","project","iat","sub","user_id","payload","iss","aud","exp","auth_time","firebase","sign_in_provider","identities","alg","ya","converter","_key","firestore","_path","withConverter","_query","Aa","Pa","releaseLock","closed","va","observer","muted","Vc","findIndex","Sa","Da","_data","userDataWriter","run","structuredAggregationQuery","aggregations","alias","aggregateFields","convertValue","xa","readVersions","committed","lastWriteError","writtenDocs","ensureCommitNotCalled","found","missing","recordVersion","write","toMutation","preconditionForUpdate","Na","updateFunction","kc","maxAttempts","ka","authCredentialListener","appCheckCredentialListener","setCredentialChangeListener","setAppCheckTokenChangeListener","verifyNotTerminated","isShuttingDown","enqueueAndForgetEvenWhileRestricted","onlineComponents","offlineComponents","getConfiguration","Ma","Fa","$a","La","qa","Ka","Ga","za","Xa","TextEncoder","encode","_completeWith","_updateProgress","complete","_failWith","na","th","enqueue","stack","createAndSchedule","eh","nh","_progressObserver","_taskCompletionResolver","_lastProgress","onProgress","sh","ih","_queue","_firestoreClient","rh","_getProvider","isInitialized","identifier","instanceIdentifier","oh","uh","ah","ph","lh","hh","DOMException","fh","dh","_h","wh","ja","mh","gh","yh","Za","Ih","_byteString","Th","_internalPath","Eh","Ah","_methodName","Rh","isFinite","_lat","_long","bh","Ph","vh","Vh","Sh","Hh","Dh","Ch","xh","merge","mergeFields","Qh","Kh","jh","Jh","Nh","_toFieldTransform","kh","Oh","Mh","Uh","Fh","$h","Bh","zh","Lh","qh","Gh","fromDate","Wh","search","Yh","_firestore","_userDataWriter","_document","_converter","ref","Xh","fromFirestore","Zh","tl","el","nl","sl","ol","il","_apply","_field","_op","_value","_parse","Al","El","Tl","rl","_create","_queryConstraints","_getOperator","_getQueryConstraints","ul","bl","cl","al","_direction","Rl","hl","ll","_limit","_limitType","fl","dl","_l","_docOrFields","_inclusive","Il","wl","ml","gl","yl","pl","Pl","convertTimestamp","convertServerTimestamp","convertBytes","convertReference","convertGeoPoint","convertArray","convertObject","convertDocumentKey","vl","toFirestore","Vl","Sl","Dl","_firestoreImpl","Cl","serverTimestamps","xl","_snapshot","_cachedChanges","_cachedChangesIncludeMetadataChanges","oldIndex","newIndex","Nl","kl","Ol","Hl","Ml","Fl","$l","Bl","Ll","Ha","ql","Ul","zl","Kl","Gl","Ql","jl","Wl","Jl","Yl","Xl","Zl","_commitHandler","_mutations","_committed","_dataReader","_verifyNotCommitted","tf","ef","_transaction","lookup","nf","sf","rf","of","uf","cf","af","hf","indexes","lf","arrayConfig","getProvider"],"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,MAAM9B,QAGR,MAAMS,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,MAmBvDmD,EAAgC,SAAUtD,GAErD,OAX0B,SAAUA,GACpC,MAAMuD,EAAYxD,EAAkBC,GACpC,OAAOO,EAAOW,gBAAgBqC,GAAW,GASlCC,CAAaxD,GAAKyD,QAAQ,MAAO,KCtS1C,MAAMC,EAAwB,ICjCd,WACd,GAAoB,oBAATC,KACT,OAAOA,KAET,GAAsB,oBAAXC,OACT,OAAOA,OAET,GAAsB,oBAAXC,OACT,OAAOA,OAET,MAAM,IAAItC,MAAM,mCDwBhBuC,GAAYC,sBAoBRC,EAAwB,KAC5B,GAAwB,oBAAbC,SACT,OAEF,IAAIC,EACJ,IACEA,EAAQD,SAASE,OAAOD,MAAM,iCAC9B,MAAOE,GAGP,OAEF,MAAMC,EAAUH,GDiRU,SAAUlE,GACpC,IACE,OAAOO,EAAOiC,aAAaxC,GAAK,GAChC,MAAOoE,GACPE,QAAQC,MAAM,wBAAyBH,GAEzC,OAAO,KCvRkBI,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,EAAK/E,OACrD,MAAM,IAAImB,MAAM,gBAAgB4D,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,IE/H/B,SAAAG,IACd,MACuB,oBAAdC,WAC2B,iBAA3BA,UAAqB,UAErBA,UAAqB,UAErB,GA0GK,SAAAC,IACd,OAhFc,iBACd,MAAMC,EAAgC,QAAbZ,EAAAT,WAAa,IAAAS,OAAA,EAAAA,EAAEY,iBACxC,GAAyB,SAArBA,EACF,OAAO,EACF,GAAyB,YAArBA,EACT,OAAO,EAGT,IACE,MACqD,qBAAnDC,OAAOC,UAAUC,SAASC,KAAKvC,OAAOe,SAExC,MAAOR,GACP,OAAO,GAoENiC,IACDP,UAAUQ,UAAUC,SAAS,YAC5BT,UAAUQ,UAAUC,SAAS,UCpE5B,MAAOC,UAAsBjF,MAIjCkF,YAEWC,EACTC,EAEOC,GAEPC,MAAMF,GALG7F,KAAI4F,KAAJA,EAGF5F,KAAU8F,WAAVA,EAPA9F,KAAIgG,KAdI,gBA2Bfb,OAAOc,eAAejG,KAAM0F,EAAcN,WAItC3E,MAAMyF,mBACRzF,MAAMyF,kBAAkBlG,KAAMmG,EAAaf,UAAUgB,SAK9C,MAAAD,EAIXR,YACmBU,EACAC,EACAC,GAFAvG,KAAOqG,QAAPA,EACArG,KAAWsG,YAAXA,EACAtG,KAAMuG,OAANA,EAGnBH,OACER,KACGY,GAEH,MAAMV,EAAcU,EAAK,IAAoB,GACvCC,EAAW,GAAGzG,KAAKqG,WAAWT,IAC9Bc,EAAW1G,KAAKuG,OAAOX,GAEvBC,EAAUa,EAUpB,SAAyBA,EAAkBF,GACzC,OAAOE,EAAS/D,QAAQgE,GAAS,CAACC,EAAGC,KACnC,MAAMC,EAAQN,EAAKK,GACnB,OAAgB,MAATC,EAAgBhF,OAAOgF,GAAS,IAAID,SAbhBE,CAAgBL,EAAUZ,GAAc,QAE7DkB,EAAc,GAAGhH,KAAKsG,gBAAgBT,MAAYY,MAIxD,OAFc,IAAIf,EAAce,EAAUO,EAAalB,IAa3D,MAAMa,EAAU,gBC3EA,SAAAM,EAAUC,EAAWC,GACnC,GAAID,IAAMC,EACR,OAAO,EAGT,MAAMC,EAAQjC,OAAOkC,KAAKH,GACpBI,EAAQnC,OAAOkC,KAAKF,GAC1B,IAAK,MAAMI,KAAKH,EAAO,CACrB,IAAKE,EAAM7B,SAAS8B,GAClB,OAAO,EAGT,MAAMC,EAASN,EAA8BK,GACvCE,EAASN,EAA8BI,GAC7C,GAAIG,EAASF,IAAUE,EAASD,IAC9B,IAAKR,EAAUO,EAAOC,GACpB,OAAO,OAEJ,GAAID,IAAUC,EACnB,OAAO,EAIX,IAAK,MAAMF,KAAKD,EACd,IAAKF,EAAM3B,SAAS8B,GAClB,OAAO,EAGX,OAAO,EAGT,SAASG,EAASC,GAChB,OAAiB,OAAVA,GAAmC,iBAAVA,ECrE5B,SAAUC,EACdvB,GAEA,OAAIA,GAAYA,EAA+BwB,UACrCxB,EAA+BwB,UAEhCxB,ECCE,MAAAyB,EAiBXnC,YACWK,EACA+B,EACAC,GAFAhI,KAAIgG,KAAJA,EACAhG,KAAe+H,gBAAfA,EACA/H,KAAIgI,KAAJA,EAnBXhI,KAAiBiI,mBAAG,EAIpBjI,KAAYkI,aAAe,GAE3BlI,KAAAmI,kBAA2C,OAE3CnI,KAAiBoI,kBAAwC,KAczDC,qBAAqBC,GAEnB,OADAtI,KAAKmI,kBAAoBG,EAClBtI,KAGTuI,qBAAqBN,GAEnB,OADAjI,KAAKiI,kBAAoBA,EAClBjI,KAGTwI,gBAAgBC,GAEd,OADAzI,KAAKkI,aAAeO,EACbzI,KAGT0I,2BAA2BC,GAEzB,OADA3I,KAAKoI,kBAAoBO,EAClB3I,UCdC4I,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,QACpB/E,KAAQ0E,EAASM,KACjBC,KAAQP,EAASQ,KACjB3F,MAASmF,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,IAAIzJ,MACR,8DAA8DmJ,MANhEpG,QAAQ0G,GACN,IAAIH,OAASJ,EAAS3D,WACnB6D,QC7FTtC,mJAUI4C,EAAOA,GAAQ,GAanBC,EAMIpK,GAGA6C,KAq2BgB,SAAAwH,KAkYDC,SAAQC,EAACC,GA1BtBC,IAAAA,SA2BmBD,EAEvB,MAAe,UA3BfrD,EAAS,UAALsD,EACKA,EAwBcD,EAjBnBjK,MAAMC,QAiBagK,GAhBd,QAEFC,EANE,SAsByB,UAARzC,GAAyC,iBAAdwC,EAAIlL,OAqB3CoL,SAAAtL,EAASoL,GACvB,IAAIxC,SAAcwC,EAClB,MAAe,UAARxC,GAA2B,MAAPwC,GAAuB,YAARxC,EAkE5C,IAAA2C,EAAqB,gBAAmC,IAAhBC,KAAKC,WAAoB,GAQjEC,EAAmB,WAoDQC,EAACC,EAAIC,EAASC,GACvC,OAAoC5F,EAAAA,KAAK6F,MAAMH,EAAGI,KAAMC,WAgB3CC,SAAQC,EAACP,EAAIC,EAASC,GACnC,IAAKF,EACH,MAAMvK,QAGR,GAAuB,EAAnB4K,UAAU/L,OAAY,CACxB,IAAIkM,EAAYjL,MAAM6E,UAAUqG,MAAMnG,KAAK+F,UAAW,GACtD,OAAkB,WAEhB,IAAIK,EAAUnL,MAAM6E,UAAUqG,MAAMnG,KAAK+F,WAE/BF,OADV5K,MAAM6E,UAAUuG,QAAQR,MAAMO,EAASF,GAC7BL,EAAAA,MAAMF,EAASS,IAI3B,OAAe,WACb,OAAUP,EAAAA,MAAMF,EAASI,YA+BnBO,SAAAA,EAASZ,EAAIC,EAASC,GAcpBW,OAJLD,EARHE,SAAS1G,UAAUgG,OAO2C,GAA9DU,SAAS1G,UAAUgG,KAAK/F,WAAW0G,QAAQ,eAC5BC,EAEAV,GAEFH,MAAM,KAAME,WAiBhBY,SAAAC,EAASlB,EAAIE,GAC1B,IAAIrB,EAAOtJ,MAAM6E,UAAUqG,MAAMnG,KAAK+F,UAAW,GACjD,OAAe,WAGb,IAAIK,EAAU7B,EAAK4B,QAEZT,OADC1J,EAAAA,KAAK6J,MAAMO,EAASL,WACrBL,EAAGG,MAAwBnL,KAAO0L,IA4V7BS,SAAQC,EAACC,EAAWC,GAElCC,SAASA,KACTA,EAASnH,UAAYkH,EAAWlH,UAChCiH,EAAUG,EAAcF,EAAWlH,UACnCiH,EAAUjH,UAAY,IAAImH,EAEhBnH,EAAAA,UAAUO,YAAc0G,EAmBxBI,EAAAA,GAAOC,SAASC,EAAIC,EAAY1B,GAIxC,IADA,IAAIrB,EAAWtJ,MAAM8K,UAAU/L,OAAS,GAC/BD,EAAI,EAAGA,EAAIgM,UAAU/L,OAAQD,IACpCwK,EAAKxK,EAAI,GAAKgM,UAAUhM,GAE1B,OAAkB+F,EAAAA,UAAUwH,GAAYzB,MAAMwB,EAAI9C,IC53DpCgD,SAAQC,IAgBnBC,KAAAA,EAAY/M,KAAK+M,EACjBC,KAAAA,EAAsBhN,KAAKgN,EAsF7BH,EAAWzH,UAAU2H,GAAY,EAqCtB3H,EAAAA,UAAU6H,GAAUC,WDgqCtBC,IAASC,GC9pChBpN,KAAK+M,IAGR/M,KAAK+M,GAAY,EACjB/M,KAAKqN,IA7F0CC,KDuvC5BF,ECxpCKpN,KD0pCnBmF,OAAOC,UAAUmI,eAAejI,KAAK8H,EAAUzC,IAClDyC,EAASzC,KACRyC,EAASzC,KAAwBG,KCxkCnC+B,EAAWzH,UAAUiI,EAAkBG,WAE1C,GAAIxN,KAAKgN,EACP,KAAOhN,KAAKgN,EAAoB1N,QAC9BU,KAAKgN,EAAoBS,OAAzBzN,ICjLN,MAAM+L,EAC8BxL,MAAM6E,UAAU2G,QAChD,SAAS2B,EAAKN,GAGZ,OAAO7M,MAAM6E,UAAU2G,QAAQzG,KAAKoI,EAAKN,OAHxBO,IAKnB,SAASD,EAAKN,GAMZ,GAAmB,iBAAnBlG,EAEE,MAAmB,iBAAnBC,GAA6C,GAAdiG,EAAI9N,QACzB,EAEHoO,EAAI3B,QAAQqB,EATjBQ,GAYC,IAAA,IAAIvO,EAZLuO,EAYoBvO,EAAIqO,EAAIpO,OAAQD,IACtC,GAAIA,KAAKqO,GAAOA,EAAIrO,KAAO+N,EAAK,OAElC7N,EAAA,OAAQ,GA6tBLsO,SAAAA,EAAQC,GACf,MAAMxO,EAASwO,EAAOxO,OAKT,GAAA,EAATA,EAAY,CACd,MAAMyO,EAASxN,MAAMjB,GACrB,IAAK,IAAID,EAAI,EAAGA,EAAIC,EAAQD,IAC1B0O,EAAG1O,GAAKyO,EAAOzO,GAEV0O,OAAAA,EAET,MAAO,GAgCTC,SAASA,EAAOC,EAAM/C,GACpB,IAAK,IAAI7L,EAAI,EAAGA,EAAIgM,UAAU/L,OAAQD,IAAK,CACzC,MAAM6O,EAAO7C,UAAUhM,GACvB,GAASiL,EAAY4D,GAAO,CAC1B,MAAMC,EAAOF,EAAK3O,QAAU,EACtB8O,EAAOF,EAAK5O,QAAU,EACvBA,EAAAA,OAAS6O,EAAOC,EACrB,IAAK,IAAIC,EAAI,EAAGA,EAAID,EAAMC,IACxBJ,EAAKE,EAAOE,GAAKH,EAAKG,QAGnB/M,EAAAA,KAAK4M,ICr2BII,SAAQC,EAACvG,EAAMwG,GAMjCxO,KAAKgI,KAA4DA,EAe5DyG,KAAAA,EANLzO,KAAK0O,OAASF,EAuBdxO,KAAK2O,kBAAmB,EAyBdL,EAAMlJ,UAAUwJ,EAAiBC,WAE3C7O,KAAK2O,kBAAmB,GCjCxBG,IAAAA,EAAuBA,WAErBA,IAAUC,EAAOC,mBAAqB7J,OAAO8J,eAC3CH,OAAOA,EAGLI,IAAAA,GAAUJ,EACVK,EAAUhK,OAAO8J,eAAeH,GAAIA,UAAWA,CACjDM,IAAKA,WACHF,GAAUJ,KAGVA,IACGC,EAAOC,iBAAiBF,OAAaO,EAAcF,GACnDG,EAAOC,oBAAoBT,OAAaO,EAAcF,GAC3DL,MAAOxL,IAGTwL,OAAOI,EAlBcJ,GC8BkBU,SAAQC,EAACvQ,GAOlD,MAAO,cAAcwQ,KAAKxQ,GAS5B,IAAAyQ,EAC0B7N,OAAOsD,UAAUwK,KAAQ,SAAS1Q,GAEtD,OAAOA,EAAI0Q,QACT,SAAS1Q,GAQX,MAAO,iCAAiC2Q,KAAK3Q,GAAK,IAuQhB,SAAA4Q,EAASC,EAAMC,GAErD,OAAID,EAAOC,GACD,EACCD,EAAOC,EACT,EAEF,ECzWTC,SAAiCC,IAC/B,IAAMlL,EAiCMmL,EAAOnL,UAhCfA,OAAAA,IACIQ,EAAYR,EAAUQ,WAEnBA,EAGJ,GAwGT4K,SAAuBC,EAACnR,GAEtB,ODuJkC,GCvMC+Q,IDuMxBlE,QCvJgB7M,GCnFJoR,SAAAC,EAASF,GAGhC,OADaC,EAAU,KAAKD,GAFOnJ,EAWxBoJ,EAAU,KAAYjB,ECiDnC,IAkYAmB,EAxCMhL,GA1VNiL,GFmFEL,EGjG2B,SDuB7BM,GF0EEN,EGxF2B,YHwF3BA,EGxF6D,QDuB/DO,GFiEEP,EItK2B,QF8G7BQ,GAA2CD,IAAuBD,GAQlEG,GFgDET,EIvJ2B,aLkPO,GCvMCH,IDqN3Ba,cAdG/E,QAcYgF,YCzGvBX,EItK2B,YJsK3BA,EI7K2B,YJ6K3BA,EI7K6D,WJ6K7DA,EItK2B,QFgI7BY,IHiIoC,GCvMCf,IDqN3Ba,cAdG/E,QAcYgF,YCzGvBX,EItK2B,QFwcK,SAAAa,KAGhC,IAAIC,EAAW9G,EAALjH,SACV,OAAO+D,EAAMgK,EAAAC,kBAAsBC,EArESlK,EAAA,CAM5C,IAAImK,GAAU,GACV3D,IA+BAlI,GFnX+ByK,IEoXhBY,GACV,qBAAsBhB,KAAKrK,IAEjBmL,GACV,kBAAkBd,KAAKrK,IAEbkL,GACV,mCAAmCb,KAAKrK,IAE9BwL,GAEV,gBAAgBnB,KAAKrK,IAEXiL,GAGV,yBAAyBZ,KAAKrK,SAHpBiL,GAxCnB,GAJI/C,KACF2D,GAAU3D,GAAMA,GAAI,GAAK,IAGRgD,GAAI,CAMrB,IAAIY,GAAyBC,KAC7B,GAAe,MAAXD,IAAmBA,GAAUE,WAAWH,IAAU,CACpDI,EAAO3P,OAAOwP,IAAd,MAAApK,GAIJuK,EAAOJ,GAiFT,IAkE+BK,GAlE/BC,GAAyC,GAiBE,SAAAC,KAEzC,ODhbmB,SAAwBC,GAAfC,IAAAA,ECkbLH,GD9avB,OAAWvM,OAAAA,UAAUmI,eAAejI,KAAKwM,EIukBoBT,GJtkBpDS,EIskBoDT,GJnkBrDS,EImkBqDT,GJnkB/BQ,EImkB+BR,GH1JzDU,EACqD,WHrOzD,IAAIC,EAAQ,EAGNC,MAAAA,EAA8BtC,EAAK7N,OGqOL0O,IHrOuB0B,MAAM,KAC3DC,EAA8BxC,EAAK,KAAkBuC,MAAM,KAC3DE,EAAWxH,KAAKyH,IAAIJ,EAAO3S,OAAQ6S,EAAO7S,QAGhD,IAAK,IAAIgT,EAAS,EAAY,GAATN,GAAcM,EAASF,EAAUE,IAAU,CAC9D,IAAIC,EAAQN,EAAOK,IAAW,GAC1BE,EAAQL,EAAOG,IAAW,GAE9B,EAAG,CAOD,GAHMG,EAAS,iBAAiB5C,KAAK0C,IAAU,CAAC,GAAI,GAAI,GAAI,IACtDG,EAAS,iBAAiB7C,KAAK2C,IAAU,CAAC,GAAI,GAAI,GAAI,IAEpC,GAApBC,EAAO,GAAGnT,QAAmC,GAApBoT,EAAO,GAAGpT,OACrC,MAYF4H,EAA6ByL,EAPS,GAApBF,EAAO,GAAGnT,OAAc,EAAIuF,SAAS4N,EAAO,GAAI,IAC5B,GAApBC,EAAO,GAAGpT,OAAc,EAAIuF,SAAS6N,EAAO,GAAI,MAOzCC,EACG,GAApBF,EAAO,GAAGnT,OAAiC,GAApBoT,EAAO,GAAGpT,SAChBqT,EAAiBF,EAAO,GAAIC,EAAO,IAG5DH,EAAQE,EAAO,GACfD,EAAQE,EAAO,SACC,GAATV,GG+LD,OAC+C,GH7LlDA,QGyOQ5H,EAAL8G,UACkBR,GAA5B,CAEA,IAAIS,GAA8BI,KAClCG,GAAIP,KAGYtM,SAAwB2L,EAAS,UAC7BY,QAVqBM,QAAA,EAA3C,IAAAkB,GAA+BlB,GIhiBJmB,SAAAC,GAASC,EAAOC,GA0IzC,GAxIyBC,EAAAC,KAAKlT,KAAqB+S,EAAQA,EAAM/K,KAAO,IAoBnEmL,KAAAA,cANLnT,KAAKyO,EAPLzO,KAAK0O,OAAS,KAuDd1O,KAAKoT,OANLpT,KAAKqT,QANLrT,KAAKsT,QANLtT,KAAKuT,QANLvT,KAAKwT,QAAU,EA8BfxT,KAAK6G,IAAM,GAoCX7G,KAAKyT,QANLzT,KAAK0T,SANL1T,KAAK2T,OANL3T,KAAK4T,SAAU,EAyBf5T,KAAK6T,MAAQ,KAYRC,KAAAA,UAAY,EAKZC,KAAAA,YAAc,GAMdC,KAAAA,EAAS,KAEVjB,EAAJ,CA4EA,IAAI/K,EA3EFiM,KA2EcjM,KA3EJ+K,EA2Ea/K,KAMrBkM,EAjFQnB,EAkFNoB,gBAlFMpB,EAkFcoB,eAAe7U,OAlF7ByT,EAkFwCoB,eAAe,GAAK,KAQpEhB,GALCzE,KAAAA,OArFOqE,EAqFyBrE,QArFzBqE,EAqFsCqB,WArFhDH,KAwFGxF,EAxFcuE,EA0FfG,EA1FQJ,EA0F+BI,eAMzC,GAAmBtC,GAAnB,CLjNiD3J,EAAA,CAEnD,IACeoJ,EK+MyB6C,EL/MfkB,UACvB,IAAA/Q,GAAO,EAAP,MAAA4D,EACA,MAAO5D,IAETA,GAAO,EK2MEA,IACH6P,EAAgB,WCtPXmB,aDyPAtM,EACTmL,EAtGUJ,EAsGQwB,YCzPVC,YD0PCxM,IACTmL,EAxGUJ,EAwGQ0B,WAGftB,KAAAA,cAAgBA,KA3GnBc,KA8GKT,aAAoCpC,IAA1B8C,EAAcV,QAAwBU,EAAcV,QACdU,EAAcQ,MA/GnET,KAgHKV,aAAoCnC,IAA1B8C,EAAcX,QAAwBW,EAAcX,QACdW,EAAcS,MAjHnEV,KAkHKX,QAAUY,EAAcZ,SAAW,EAlHxCW,KAmHKZ,QAAUa,EAAcb,SAAW,IAnHxCY,KAkIKT,aAAwBpC,IAlInB2B,EAkIOS,QAlIPT,EAkIiCS,QAlIjCT,EAkI6C2B,MAlIvDT,KAmIKV,aAAwBnC,IAnInB2B,EAmIOQ,QAnIPR,EAmIiCQ,QAnIjCR,EAmI6C4B,MAnIvDV,KAoIKX,QApIKP,EAoIOO,SAAW,EApI5BW,KAqIKZ,QArIKN,EAqIOM,SAAW,GArI5BY,KAwIGb,OAxIOL,EAwIIK,OAxIda,KA2IGpN,IA3IOkM,EA2IClM,KAAO,GA3IlBoN,KA6IGL,QA7IOb,EA6IKa,QACZD,KAAAA,OA9IOZ,EA8IIY,OA9IdM,KA+IGP,SA/IOX,EA+IMW,SA/IhBO,KAgJGR,QAhJOV,EAgJKU,QAhJfQ,KAkJGH,UAlJOf,EAkJOe,WAAa,EAC3BC,KAAAA,YAiG0B,iBAAjBA,EAAAA,YApPFhB,EAqPDgB,YAIqBa,GAzPpB7B,EAyP0CgB,cAAgB,GArGjEF,KAAAA,MApJOd,EAoJGc,MACVG,KAAAA,EArJOjB,EAsJNpE,EAAAA,kBAGQkG,GAAarI,EAAYoC,EAAetJ,KAzJpD2O,OAGC9H,EAAqB0G,GAA0BvE,GAyDpDsG,IAAAA,GAAiEE,CAC/D,EA5BOC,QA6BP,EA9BKC,MA+BL,EAhCOC,SAwLGpC,GAAazN,UAAUwJ,EAAiBsG,WAEtCL,GAAarI,EAAYoC,EAAetJ,KAAKtF,MACrDmV,IAAAA,EAAKnV,KAAKgU,EACNpF,EAAAA,eAGNuG,EAAGvG,iBAFHuG,EAAGC,aAAc,GExWrB,IAAAC,GACI,uBAA0C,IAAhBzK,KAAKC,SAAkB,GC/BrDyK,GAAqC,ECIdC,SAAAC,GACnBC,EAAiBC,EAAK1N,EAAM2N,EAASC,GAOvC5V,KAAKyV,SAAWA,EAQXI,KAAAA,MCoEWA,UD9DXH,IAAMA,EAMX1V,KAAKgI,KAAOA,EAMZhI,KAAK2V,UAAYA,EAMjB3V,KAAK8V,GAAUF,EAOf5V,KAAK6G,MDzC8ByO,GCqD9BS,KAAAA,GANL/V,KAAKgW,IAAW,EAiC6BC,YAAAA,GAE7C/O,EAAK6O,IAAU,EACVN,EAAAA,SAAW,KACXI,EAAAA,MAAQ,KACRH,EAAAA,IAAM,KACNI,EAAAA,GAAU,KEpGjBI,SAASA,GAAQ9I,EAAK+I,EAAGC,GACvB,IAAK,MAAMvP,KAAOuG,EAChB+I,EAAE7Q,KAAuB8Q,EAAUhJ,EAAIvG,GAAMA,EAAKuG,GAqZtDiJ,SAAcC,GAAClJ,GACb,MAAMmJ,EAAM,GACZ,IAAK,MAAM1P,KAAXK,EACEqP,EAAI1P,GAAOuG,EAAIvG,GAEjB,SAsDF,MAAM2P,GAAmB,gGAAAtE,MAAA,cA0BVuE,GAAC/H,EAAQxD,GACtB,IAAIrE,EACA6P,EACC,IAAA,IAAIrX,EAAI,EAAGA,EAAIgM,UAAU/L,OAAQD,IAAK,CAEzC,IAAKwH,KADL6P,EAASrL,UAAUhM,GACnBsX,EACEjI,EAAO7H,GAAO6P,EAAO7P,GASlB,IAAA,IAAIwH,EAAI,EAAGA,EAAImI,GAAiBlX,OAAQ+O,IAC3CxH,EAAM2P,GAAiBnI,GACnBlJ,OAAOC,UAAUmI,eAAejI,KAAKoR,EAAQ7P,KAC/C6H,EAAO7H,GAAO6P,EAAO7P,KDpfH+P,SAAAC,GAASnB,GAGjC1V,KAAK0V,IAAMA,EAMX1V,KAAK8W,EAAY,GAMjB9W,KAAK+W,EAAa,WAkHoCC,GAARC,EAASxB,GAEvD,IAAIzN,EAAOyN,EAASzN,KACdA,GAAAA,KAAa8O,EAAAA,EAAnB,CAIgC,IfghB5B/I,EehhB4B4I,EAAAzP,EAAK4P,EAAU9O,Gf+gBzC3I,EAAI0M,EAAQ2B,Ee/gBoC+H,IfihBjD1H,EAAU,GAAL1O,IAuCHkB,MAAM6E,UAAU8R,OAAO5R,KAtCnBoI,EAAKrO,EAsC2B,GevjB3C8W,IACkDgB,GAAV1B,GACH,GAA/BvO,EAAK4P,EAAU9O,GAAM1I,gBAChB4H,EAAK4P,EAAU9O,GACtBd,EAAK6P,OA4HkCK,SAAAC,GACzCC,EAAe7B,EAAU8B,EAAgBC,GAE3C,IAAK,IAAInY,EAAI,EAAGA,EAAIiY,EAAchY,SAAUD,EAAG,CAC7C,IAAIoY,EAAcH,EAAcjY,GAC5B,IAACoY,EAAY1B,IAAW0B,EAAYhC,UAAYA,GAChDgC,EAAY9B,WAAa4B,GACzBE,EAAY3B,IAAW0B,EACzB,OAL2ClU,EAQ/C,OAAQ,EAxNEsT,GAAYxR,UAAUsS,IAAMC,SACpC3P,EAAMyN,EAAUO,EAAUuB,EAAgBC,GAE5C,IAAII,EAAU5P,EAAK3C,YACfiS,EAAgBtX,KAAK8W,EAAUc,MAEjCN,EAAgBtX,KAAK8W,EAAUc,GAAW,GAC1C5X,KAAK+W,SAIHc,EAAgCT,GAChCE,EAAe7B,EAAU8B,EAAgBC,GAc7C,OAba,EAATK,GACFJ,EAAcH,EAAcO,GACvB7B,IAGHyB,EAAYzB,IAAW,MAGzByB,EAAc,IAAgBlC,GAC1BE,EAAgBzV,KAAK0V,IAAKkC,IAAWL,EAAgBC,IAC7CxB,GAAWA,EACvBsB,EAAchW,KAAKmW,IAvB0CtQ,GEbjE2Q,IAAAA,GAAiC,eAAkC,IAAhBlN,KAAKC,SAAkB,GAmB1EkN,GAA2B,GA+DNC,SAAAA,GAAStC,EAAK1N,EAAMyN,EAAUwC,EAAarC,GAE9D,GAAIqC,GAAeA,EAAYC,KAC7B,OAAOC,GACHzC,EAAK1N,EAAMyN,EAAUwC,EAAarC,GAExC,GAAIrV,MAAMC,QAAQwH,GAAO,CACvB,IAAK,IAAI3I,EAAI,EAAGA,EAAI2I,EAAK1I,OAAQD,IACnB2Y,GAAOtC,EAAK1N,EAAK3I,GAAIoW,EAAUwC,EAAarC,GAEnD,OAAA,KAIT,OADAH,EAAuB2C,GAAa3C,GACpCvO,GAA2CwO,ELhGCL,IKmGnCK,EAAI2C,EACqCrQ,EAAOyN,EAF9C/K,EAASuN,KAAiBA,EAAYtC,UAAYsC,EAGvDrC,GAEe0C,GACc5C,EAAM1N,EAAMyN,GAC1B,EAAOwC,EAAarC,GAyBrB0C,SAAQC,GAC1B7C,EAAK1N,EAAMyN,EAAUO,EAAUiC,EAAarC,GAE9C,IAAK5N,EACH,MAAUvH,MAAM,sBAGlB,IAAIkV,EACKjL,EAASuN,KAAiBA,EAAYtC,UAAYsC,EAEvDO,EAA0BC,GAAgB/C,GAW1C+B,GAVJiB,IACEhD,EAAgBoC,IAAsBU,EAClC,IAAgB5B,GAAYlB,KAG9B+B,EACAe,EAAYd,IAAI1P,EAAMyN,EAAUO,EAAUL,EAASC,IAIvCC,MACd,OAGEA,EAOAH,GAPAG,EA0CiB8C,WAGXxC,SAAAA,EAASyC,GACjB,OAAOC,EAAsBvT,KAAK6Q,EAAET,IAAKS,EAAEV,SAAUmD,GAFvD,MAAMC,EAAoCC,GAI1C,OANgC5R,EA1CRyR,KACZ9C,MAAQA,EAEpBA,EAAMH,IAAMA,EACZG,EAAMJ,SAAWgC,EAGb/B,EAAI1G,iBAE0B+J,IAC9Bd,EAActC,QAGIvE,IAAhB6G,IAA2BA,GAAc,GAC7CvC,EAAI1G,iBAAiBhH,EAAK3C,WAAYwQ,EAAOoC,QACpCvC,GAAAA,EAAIsD,YAMbtD,EAAIsD,YAAwBC,GAAajR,EAAK3C,YAAawQ,OANtD,CAAA,IAOIH,EAAIwD,cAAexD,EAAIyD,eAQtB1Y,MAAAA,MAAM,qDAFhBiV,EAAIwD,YAAYrD,GAEhB,OAtDyDtW,EAqGpC6Z,SAAQjB,GAC7BzC,EAAK1N,EAAMyN,EAAUwC,EAAarC,GAEpC,GAAIrV,MAAMC,QAAQwH,GAAO,CACvB,IAAK,IAAI3I,EAAI,EAAGA,EAAI2I,EAAK1I,OAAQD,IACnB+Z,GAAW1D,EAAK1N,EAAK3I,GAAIoW,EAAUwC,EAAarC,GAEvD,OAAA,KAIkCF,OAD3CD,EAAuB2C,GAAa3C,GACOC,GAAAA,ELnPCL,IKsPnCK,EAAI2D,EACqCrR,EAAOyN,EAF9C/K,EAASuN,KAAiBA,EAAYtC,UAAYsC,EAGvDrC,GAEe0C,GACc5C,EAAM1N,EAAMyN,GAC1B,EAAMwC,EAAarC,GA4CnB0D,SAAAC,GAAS7D,EAAK1N,EAAMyN,EAAUwC,EAAarC,GAEhE,GAAIrV,MAAMC,QAAQwH,GAChB,IAAK,IAAI3I,EAAI,EAAGA,EAAI2I,EAAK1I,OAAQD,IACnBia,GAAS5D,EAAK1N,EAAK3I,GAAIoW,EAAUwC,EAAarC,QAI1DD,EACKjL,EAASuN,KAAiBA,EAAYtC,UAAYsC,EAE3DxC,EAAuB2C,GAAa3C,GACOC,GAAAA,ELpTCL,KMuMhCmE,ED8GH9D,EC9GG8D,GHjJR5B,EGkJA9V,OD8G8CkG,GFhQ/B3C,cACGyR,EAAAA,KAOT,GAFTe,EAAgCT,GADhCE,EAAgBpQ,EAAK4P,EAAUc,GE2PsBnC,EAAUE,EAC7DC,MFvPQuB,GADMG,EAAcO,IfilB3BtX,MAAM6E,UAAU8R,OAAO5R,Ke/kBRgS,EAAeO,Ef+kBM,Ge9kBb,GAAxBP,EAAchY,gBACT4H,EAAK4P,EAAUc,GACtB1Q,EAAK6P,QEsPJrB,IAMD8C,EAA0BC,GACG/C,MF5J7B4B,EE8JgBkB,EF9JK1B,EE+JyB9O,EF/JV3C,YACpChG,GAAK,EACLiY,IACFjY,EAA4B+X,GACxBE,EE2JmD7B,EAAUE,EAC7DC,KF1JNrW,GAAY,EAALF,EAASiY,EAAcjY,GAAK,OE4JZoa,GAAchC,IAgBXgC,SAAAC,GAAS7S,GASnC,GALmB,iBAARA,GAIIA,IAAAA,EACWkP,GAA1B,CAIA,IAAIL,EALW7O,EAKI6O,IACnB,GAA2CA,GAAAA,ELrWCL,IMoNVsE,GDkJejE,EClJrC8D,ED2IG3S,OAMf,CAIA,IAAImB,EAVWnB,EAUKmB,KAChB6N,EAXWhP,EAWMgP,MACbtG,EAAAA,oBACNmG,EAAInG,oBAAoBvH,EAAM6N,EAbjBhP,EAaiC8O,SACrCD,EAAIkE,YACblE,EAAIkE,YAAwBX,GAAajR,GAAO6N,GACvCH,EAAIwD,aAAexD,EAAIyD,gBAChCzD,EAAIyD,eAAetD,IAIjB2C,EAA0BC,GACG/C,KAInBiE,GAAZnB,EA1Ba3R,GA2BqB,GAA9B2R,EFjZMzB,IEoZRyB,EAAY9C,IAAM,KAGlBA,EAAgBoC,IAAsB,OAGQX,GApCnCtQ,KAsOUoS,SAAQY,GAAC7R,GAElC,OAAIA,KAAJ8R,GACqB/B,GAAa/P,GAEf+P,GAAa/P,GAlkBV+R,KAkkB0C/R,EAkJhC8Q,SAAQkB,GAACvE,EAAUwE,GAEnD,GAAIxE,EAASM,GACJ7O,GAAA,MADT,CAKOC,EAAA,IAAA2L,GAAA3L,EAAAnH,MAlFHka,IAAAA,EAkFGzE,EAlFmBA,SACtB0E,EAiFG1E,EAjFwBK,IAiFxBL,EAjF4CC,IAiF5CD,EA/EMO,IACCyD,GA8EPhE,GA5EPvO,EAAOgT,EAAW5U,KAAK6U,EAAiBvB,GAuExC,OAF4D1R,EA0FhCuR,SAAQ2B,GAAC1E,GAKrC,OAHI8C,EAAc9C,EAAgBoC,kBAGsBU,EAAc,KASxE,IAAA6B,GACI,wBAA2C,IAAhBzP,KAAKC,WAAoB,GAW7BuN,SAAQkC,GAAC7E,GAIlC,MAAwB,mBAApBvO,EAMCuO,GAAAA,EAAqB4E,MACxB5E,EAAqB4E,IAA0B,SAAS/W,GAEtD,OAAmCiX,EAAAA,YAAYjX,KAG5CmS,EAAqB4E,KCl3BJG,SAAAC,KAEnBC,EAAWpV,KAAKtF,MAMhBwZ,KAAAA,EAAwB,IAAgB5C,GAAY5W,MAOzDA,KAAK2a,EAAqB3a,KAW1BA,KAAK4a,EAAqB,cAgG8BC,GAARC,EAASxX,GAAG,IAIxDyX,EAAeC,EAAWC,EA5ElBL,EA6ERI,GAAAA,EAGF,IAFAD,EAAgB,GAETC,EAAUA,EAAWA,EAhFlBJ,EAiFRG,EAAczZ,KAAK0Z,GAqQN,GA7PRL,EAALA,EAAKA,EAyPL3S,EAAO1E,EAAE0E,MAA+B1E,EAI3B,iBAAjB6D,EACE7D,EAAI,IAAgBgL,EAAMhL,EAAGoL,QAClBpL,GAAAA,aAAyBgL,EAKpChL,EAAEoL,OAASpL,EAAEoL,QAAUA,MALqB,CAC5C,IAAIwM,EAAW5X,EAEfmT,GADAtP,EAAI,IAAgBmH,EAAMtG,EAAM0G,GACVwM,GAQxB,GAHInN,GAAK,EAGLoN,EACF,IAAK,IAAI9b,EAAI8b,EAAkB7b,OAAS,EACA,GAALD,EAAQA,IAAK,CAC9C,IAAAoP,EAAgBnL,EAAEmL,EAAgB0M,EAAkB9b,GACpDiE,EAAmB8X,GAAd3M,EAA4BzG,GAAM,EAAM1E,IAAMyK,EAcnDoN,GAPFpN,EAAmBqN,GADnB3M,EAAkCnL,EAAEmL,EAAgBC,EACnB1G,GAAM,EAAM1E,IAAMyK,EAEjDA,EAAmBqN,GAAd3M,EAA4BzG,GAAM,EAAO1E,IAAMyK,EAKpDoN,EACF,IAAK9b,EAAI,EAAiCA,EAAI8b,EAAkB7b,OAC3DD,IAEH0O,EAAmBqN,GADnB3M,EAAgBnL,EAAEmL,EAAgB0M,EAAkB9b,GACnB2I,GAAM,EAAO1E,IAAMyK,EAnKR,SAAAsN,GAAAC,EAC9CtT,EAAM2N,EAASiD,GAOjB,KADItB,EAAgBpQ,EAAKsS,EAAsB1C,EAAUhV,OAAOkG,KAE9D,OAAO,EAETsP,EAAgBA,EAAciE,SAG9B,IADA,IAAIxN,GAAK,EACA1O,EAAI,EAAGA,EAAIiY,EAAchY,SAAUD,EAAG,CAC7C,IAAIoW,EAAW6B,EAAcjY,GAEzBoW,GAAAA,IAAaA,EAASM,IAAWN,EAASE,SAAWA,EAAS,CAChE,IAAIuE,EAAazE,EAASA,SACtB0E,EAAkB1E,EAASK,IAAWL,EAASC,IAE/CD,EAASO,IAvDiB2D,GAwD5B6B,EAxDMhC,EAwDa/D,GAErBnS,GAAuD,IAAlD4W,EAAW5U,KAAK6U,EAAiBvB,IAA0B7K,GAIpE,OAAAzK,IAAcsV,EAAYjK,iBAxQvBxC,EAAqBqO,GAAkB3N,GACS2N,GNtB/CpV,UAAiCiQ,KAAuB,EMsGlDmF,GAAYpV,UAAUmK,oBAAsBkM,SACpDzT,EAAM8N,EAAS4F,EAAaC,GAElBrC,GAAStZ,KAAMgI,EAAM8N,EAAS4F,EAAaC,IAsC7CnB,GAAYpV,UAAUiI,EAAkBuO,WA+FlD,GA7FYC,GAAYrP,EAAYa,EAAgB/H,KAAKtF,MAEzD8b,KA2FUtC,EAAV,CAGYA,IHxHHxR,EGwHGwR,EA9FZsC,KA8FYtC,EHxHZ,IAASxR,KAAQd,EAAK4P,EAAW,CAG7B,IADA,IAAIQ,EAAgBpQ,EAAK4P,EAAU9O,GAC1B3I,EAAI,EAAGA,EAAIiY,EAAchY,OAAQD,IAEvB8X,GAAjBG,EAAcjY,WAET6H,EAAK4P,EAAU9O,GACtBd,EAAK6P,KGmBT/W,KAAK4a,EAAqB,MAgBJxV,GAAAA,UAAUiT,EAAS0D,SACvC/T,EAAMyN,EAAU8B,EAAgBC,GAGlC,OAAAxX,KAAYwZ,EAAsB9B,IAC9B5V,OAAOkG,GAAOyN,GAAU,EAAsB8B,EAC9CC,IAgBMgD,GAAYpV,UAAUiU,EAAa2C,SAC3ChU,EAAMyN,EAAU8B,EAAgBC,GAElC,OAAYgC,KAAAA,EAAsB9B,IAC9B5V,OAAOkG,GAAOyN,GAAU,EAAqB8B,EAC7CC,ICnFN,IAAAyE,GAEU7R,EAALzG,KAAAuY,UChIHC,SAAMC,KAAND,IAAAA,ECsF6BE,GDrF3B,IAAIC,EAAO,KAUX,OARSC,EAAAA,IACPD,EAAOpV,EAAKqV,EACZrV,EAAKqV,EAAYrV,EAAKqV,EAAUC,KAC3BtV,EAAKqV,IACRrV,EAAKuV,EAAY,MAEnBH,EAAKE,KAAO,MAEdrV,EAwBJ,IC3DAuV,GD2DAC,GAAsB,IElEAC,MAMpBjX,YAAYS,EAAQyW,GAIlB7c,KAAK8c,EAAU1W,EAEV2W,KAAAA,EAASF,OAGTG,EAAa,EAElBhd,KAAKid,EAAQ,KAMf7N,MACE,IAAIkN,EASJ,OARsB,EAAlBtc,KAAKgd,GACPhd,KAAKgd,IACLV,EAAOtc,KAAKid,EACZjd,KAAKid,EAAQX,EAAKE,KAClBF,EAAKE,KAAO,MAEZF,EAAOtc,KAAK8c,IARV5V,KF4CJ,IAAM,IAAIgW,KAAYZ,GAAQA,EAAKO,gBAMvCM,GACExX,cAME3F,KAAKwc,KAFLxc,KAAKod,EAFLpd,KAAKgL,EAAK,KAWZqS,IAAIrS,EAAIoS,GAENpd,KAAKgL,EAAKA,EACVhL,KAAKod,EAAQA,EACbpd,KAAKwc,KAAO,KAIdK,QAGE7c,KAAKwc,KADLxc,KAAKod,EADLpd,KAAKgL,EAAK,MG/FdsS,SAAuBC,GAACC,GAEjBC,EAAOC,YAAW,KACrB,MAAMF,IACL,GFEYG,SAAQC,GAACjV,EAAUkV,GAEdC,IAiBa,WAQ/B,IAAIC,EAAeC,EAAOC,QAAQC,aAAQ9M,GAC3B0M,GAAYA,WAEzBC,EAAQI,KAAoBC,KA3BfC,GAEjBC,KAEiBR,KACAS,IAAsB,GAGb7G,GAAAA,IAAI/O,EAAUkV,GA+D1C,IAAAU,IAAqC,EAIrCC,GAA4B,IDjF5B,MACE7Y,cAEE3F,KAAKyc,EADLzc,KAAKuc,EAAY,KAQnB7E,IAAI1M,EAAIoS,GACN,MAAMd,EA0CWmC,GAAUrP,MAzC3BkN,EAAKe,IAAIrS,EAAIoS,GAEJX,KAAAA,EACPzc,KAAKyc,EAAUD,KAAOF,EAItBtc,KAAKuc,EAAYD,EAHZG,KAAAA,EAAYH,IC6FW8B,SAAAA,KAIhC,IADA,IAAI9B,EACGA,EAAiCH,MAAU,CAChD,IACEG,EAAKtR,EAAG1F,KAAKgX,EAAKc,GAClB,MAAO9Z,GEjHHga,GFkHsBha,GClF9Bob,IAAAA,EFUYC,GETVxX,EAAK4V,EAAOT,GACZ,IAAInV,EAAK6V,IACP7V,EAAK6V,IACLV,EAAKE,KAAOrV,EAAK8V,EACjB9V,EAAK8V,EAAQX,GDmFFiC,IAAsB,EGpH1BK,SAAAA,GAASC,EAAcC,GAEtBC,GAAYzZ,KAAKtF,MAM7BA,KAAKgf,EAAYH,GAAgB,EAUjC7e,KAAKif,EACDH,GA6D+B1U,EAtDnCpK,KAAKkf,EAAkBtT,EAAK5L,KAAKmf,GAAOnf,MASxCA,KAAKof,E1BigDEpV,KAAKD,M0B71Cc,SAAAsV,GAAAC,GAE1BpY,EAAKqY,IAAU,EACXrY,EAAKsY,IACPtY,EAAK+X,EAAaQ,aAAavY,EAAKsY,GACpCtY,EAAKsY,EAAS,MAmCIE,SAAQC,GAAClK,EAAUmK,EAAWhK,GAElD,GAAwB,mBAAxB1O,EACM0O,IACFH,EAAgB7J,EAAK6J,EAAUG,QAExBH,CAAAA,IAAAA,GAA2C,mBAAf8E,EAAAA,YAIrC,MAAM9Z,MAAU,6BAFhBgV,EAAgB7J,EAAK6J,EAAS8E,YAAa9E,GAK7C,OAAA,WAAIoK,OAAOD,IA9LqB,EAkBGnC,EAkLIC,WAAWjI,EAAUmK,GAAa,GCrIzEE,SAAAC,GAAAD,GACE5Y,EAAKsY,EAAeE,IAAS,KAAMM,EAb9BR,EAAS,KAaqBQ,EAX1BC,IAW0BD,EAV5BC,GAAc,EACdH,GAS4BE,MAAiB9Y,EAAK8X,GACzD,MAAMnV,EAAO3C,EAAKgZ,EAEbA,EAAAA,EAAQ,KACRC,EAAAA,EAAUhV,MAAM,KAAMtB,GD7F1BsC,EAAcyS,GAAmBpE,KAgCtCjT,EAAA6Y,GAAAhb,WAAAib,IAA+B,EA4BVC,EAArBC,EAA8B,KAkC9BpB,EAAAA,GAA6BqB,WAE3B,GAAIxgB,KAAKuf,GAAS,CAChB,IAAIkB,E1B85CCzW,KAAKD,M0B95CiB/J,KAAKof,EAClB,EAAVqB,GAAeA,EA7CIC,GA6CM1gB,KAAKgf,EAChChf,KAAKwf,EAASxf,KAAKif,EAAavB,WAC5B1d,KAAKkf,EAAYlf,KAAKgf,EAAYyB,IAMpCzgB,KAAKwf,IACPxf,KAAKif,EAAaQ,aAAazf,KAAKwf,GACpCxf,KAAKwf,EAAS,MAoBbmB,GAjBHC,KA0EcC,QAxEV7gB,KAAKuf,KAGFuB,GAALA,MACA9gB,KAAK+gB,YAkBXA,EAAAA,MAA6BC,WAE3BhhB,KAAKuf,IAAU,EAGVvf,KAAKwf,IAaRxf,KAAKwf,EAASxf,KAAKif,EAAavB,WAAW1d,KAAKkf,EAAYlf,KAAKgf,GACjEhf,KAAKof,E1Bq2CApV,KAAKD,Q0Bl1COuW,EAArBjT,EAAuC4T,WAEhCC,GAAM1U,EAAYa,EAAgB/H,KAAKtF,MACvC8gB,GAALA,aACO9gB,KAAKif,GC1Nd,MAAMkC,WAANrU,EAQEnH,YAAY8P,EAAU2L,GACpBrb,QAMKoa,KAAAA,EAAuD1K,EAOvDuJ,KAAAA,EAAYoC,EAOjBphB,KAAKkgB,EAAQ,KAOblgB,KAAKigB,GAAc,EAgBnBjgB,KAAKwf,EAAS,KAUhB6B,EAAKnW,GACHlL,KAAKkgB,EAAQ7U,UACRrL,KAAKwf,EAGRxf,KAAKigB,GAAc,EAFdH,GAALA,MA0CJzS,IACEtH,MAAMsH,IAhCGmS,KAAAA,IDQwB8B,EA6LL7B,aCpK5BqB,KAhCmBtB,GAgCnBsB,KA/BOtB,EAAS,KA+BhBsB,KA9BOb,GAAc,EA8BrBa,KA7BOZ,EAAQ,OCtCQqB,SAAQC,GAACC,GAE7B/G,EAAWpV,KAAKtF,MAGhB0hB,KAAAA,EAAWD,EAOXE,KAAAA,EAAQ,GAEVxV,EAAqBoV,GAAmB1U,GAW7C+U,IAAAA,GAAsC,GAoEO,SAAAC,GAAAC,EACzCpM,EAAK1N,EAAM+Z,GAGRxhB,MAAMC,QAAQwH,KACbA,IACuB4Z,GAAW,GAAK5Z,EAAK3C,YAEhD2C,EAAgC4Z,IAE7B,IAAA,IAAIviB,EAAI,EAAGA,EAAI2I,EAAK1I,OAAQD,IAAK,CACpC,IAAIoY,EAA0BO,GAC1BtC,EAAK1N,EAAK3I,GAAI0iB,GATiClf,EASlB0X,aAA4B,EATV1X,EAU7B6e,GAV6B7e,GAYnD,IAAK4U,EAIH,MAhBiD5U,EAoB9C8e,EADKlK,EAAY5Q,KACJ4Q,GA8QyBuK,SAAQC,GAARD,GVuO7C9L,GUrOoBhP,EAAKya,GAAO,SAASlK,EAAa5Q,GAEhD7G,KAAK2hB,EAAMpU,eAAe1G,IAChB4S,GAAchC,KAE3BvQ,KAEEya,EAAQ,GCnb4BO,SAAQC,KAajDniB,KAAKoiB,GAAiB,EA6E+BC,SAAQC,GAARD,EACnDE,EAAIC,EAAcC,GAGpBvb,EAAKhD,MAAK,WAER,MAAO,iBAAmBqe,EAAK,MA8ES,SAAAG,EAASF,GAEnD,IAAKtb,EAAKkb,EACR,OAGFjb,EAAA,IAAKqb,EACH,OAAO,KAGL,IACF,IAAIG,EAAgBhf,KAAKC,MAAM4e,GAC/B,GAAIG,EACF,IAAStjB,EAAI,EAAGA,EAAIsjB,EAAcrjB,OAAQD,IACxC,GAAIkB,MAAMC,QAAQmiB,EAActjB,IAAhC,CACyB,IAAAsX,EAAAgM,EAActjB,GAoB7C,KAAmB,EAAfujB,EAAMtjB,QAAV,CAGA,IAAIujB,EAAWD,EAAM,GACrB,GAAKriB,MAAMC,QAAQqiB,MAGG,EAAlBA,EAASvjB,QAAb,CAIA,IAAI0I,EAAO6a,EAAS,GACR,GAAA,QAAR7a,GAA0B,QAARA,GAA0B,SAARA,EAEtC,IAAK,IAAI3I,EAAI,EAAGA,EAAIwjB,EAASvjB,OAAQD,IACnCwjB,EAASxjB,GAAK,KA9BhB,OAAiB4c,GAAU0G,GAC3B,MAAOrf,GAEP,OAAOkf,GArGqCM,CAHnCjgB,EAGmD2f,IACvDC,EAAW,IAAMA,EAAW,OD2VzBlB,GAAanc,UAAUiI,EAAkB0V,WAEvCC,GAAaxW,EAAYa,EAAgB/H,KAAKtF,MAC1DiiB,GAAAgB,OAQuB7d,GAAAA,UAAUmV,YAAc2I,WAE/C,MAAUziB,MAAM,6CChblByhB,GAAgB9c,UAAU+d,GAAgBC,WAExCpjB,KAAKoiB,GAAiB,GAkHxBF,GAAgB9c,UAAUlB,KAAOmf,aCxIjC,IAAAC,GAAqB,GAQrBC,GAA4B,KAOO,SAAAC,KAIjC,OAAAC,GADiBF,IAAgB,IAAgB/I,YAmCJkJ,GAAChV,GAElCuE,EAAM3N,KACdtF,KAAmB2jB,GAAMC,GAA2BlV,GAgBbmV,SAAQC,GAACC,GAEpD,MAAMrV,EAAsBsV,QAC5BtV,EACI,IAAiBuV,GAAwBvV,IAgHtB,SAAAwV,GAASC,EAAaC,GAEjCnR,EAAM3N,KAAKtF,KAAmBqkB,GAAMC,WAAYH,GAM5DnkB,KAAKokB,KAAOA,EAmBiBG,SAAAA,GAASH,GAEtC,MAAM1V,EAAsBsV,KACrBrD,GAAPjS,EAAqB,IAAiB8V,GAAU9V,EAAQ0V,IAuB/B,SAAAK,GAAS/V,EAAQgW,GAE9BzR,EAAM3N,KAAKtF,KAAmB2kB,GAAMC,GAAclW,GAKzDgW,KAAAA,KAAOA,EAiGoB,SAAAG,GAAC7Z,EAAI8Z,GAErC,GAAkB,mBAAlB5d,EACE,MAAMzG,MAAU,8CAElB,OAAmBid,EAAAA,YAAW,WAI1B1S,MAID8Z,GA5UQnB,GAAMC,GAA4B,qBAqC1CzX,EAAsB8X,GAAqC3V,GAqBnD+V,GAAMC,WAAa,YAkH3BnY,EAAsBqY,GAAuBlW,GA4BrCqW,GAAMC,GAAe,cAkC7BzY,EAAsB4Y,GAAyBzW,GCpRpD,IAAA0W,GAAqB,CAKnBC,SAAUA,EASVC,GAAeA,EAOfC,GAAgBA,EAOhBC,GAAiBA,EAKjBC,GAAcA,EAKdC,GAAWA,EAKXC,GAAYA,EAKZC,GAAOA,EAKPC,QAASA,EAKTC,GAASA,GC1DXC,GAAqB,CACnBC,GAAUA,WACVC,GAASA,UACTxc,GAAOA,QACPmc,GAAOA,QACPM,GAAOA,QACPC,GAAoBA,mBACpBN,QAASA,UACTO,GAAkBA,kBAClBC,GAAUA,WAIVC,GAAmBA,mBACnBC,GAAiBA,kBCVOC,SAAQC,MAqBaC,SAAQC,GAARD,GAE7C,OAAOpf,EAAKsf,IACPtf,EAAKsf,EAAiBtf,EAAKuf,KCKZC,SAAQC,MDrBrBP,GAAehhB,UAAUohB,EAAiB,KC+WnD,ICnXAI,GDmXAC,GAAgC,CAE9BC,KAAMA,IAGNC,GAAOA,IASP1d,GAAOA,IAGP2d,GAASA,KAWwBC,SAAQC,KAERjU,EAAAkU,KAC7BnnB,KAdKgnB,KAkHsBI,SAAQC,KAERpU,EAAAqU,KAC3BtnB,KAxHGqJ,KC7PwBke,SAAQC,MCtGCC,SAAQC,GAC9CC,EAASC,EAA6BC,EAAeC,GAMvD9nB,KAAK+nB,EAAWJ,EAMhB3nB,KAAKgoB,EAAgBJ,EAYhBK,KAAAA,EAAOJ,EAMPK,KAAAA,EAAWJ,GAAe,EAO1BK,KAAAA,EAAgB,IAAgB5G,GAAavhB,MAM7CooB,KAAAA,EAAmDC,GCtCtDnhB,EADY0J,GAjCa0X,SAgCW,ED+CjCC,KAAAA,EACD,IAAS3J,GAAM1X,GAMdshB,KAAAA,EAAgB,KAQhBC,KAAAA,GAAc,EA6CdC,KAAAA,EANL1oB,KAAK2oB,EANL3oB,KAAK4oB,EAPL5oB,KAAK6oB,EANL7oB,KAAK8oB,EANL9oB,KAAK+oB,EANL/oB,KAAKgpB,EAAmB,KA6CxBhpB,KAAKipB,EAAmB,GAMnBC,KAAAA,EAAW,KAOXC,KAAAA,EAAqB,EAYrBC,KAAAA,EANLppB,KAAKqpB,EAAQ,KAYRC,KAAAA,GAAmB,EAMnBC,KAAAA,GAAa,EAWlBvpB,KAAKwpB,EAA8B,EAOnCxpB,KAAKypB,EAA4B,KA0B5BC,KAAAA,EAPL1pB,KAAK2pB,EANL3pB,KAAK4pB,EANL5pB,KAAK6pB,GAAgB,EA0BhBC,KAAAA,EAAsB,IAA6BC,GAQZA,SAAAC,KAM5ChqB,KAAKiqB,EAAc,KAMdC,KAAAA,EAAiB,GAMtBlqB,KAAKmqB,GAA0B,EF6I5Bhe,EAA6B8a,GAA0B3Y,GAuGvDnC,EAA6Bib,GAAwB9Y,GCnXrDnC,EAAkBob,GAAgCnB,IAIxBhhB,GAAAA,UAAUglB,EAAiBC,WAGxD,OAGS,IAAIC,gBAMgBllB,GAAAA,UAAUqhB,EAAqB8D,WAQ5D,MALgBpb,IAlCCqb,GAsGeC,IAAalD,GC2D/C,IAAAc,GAA6B,KAyF7BqC,GAAgC,GAQhCC,GAAmC,GA4FI,SAAAC,GAAAC,EAASC,EAAKC,GAEnD7jB,EAAK2hB,EAnLKmC,EAoLV9jB,EAAK0hB,EAAuBqC,GAAR5U,GAAJyU,IACXpC,EAAAA,EAAYqC,EACZlB,EAAAA,GEy7B4BqB,EFx7B5BC,GAALA,EAAkB,MAiCoBC,SAAQC,GAARD,EAASE,GAE/CpkB,EAAK4hB,EAAoB9e,KAAKD,MAC9BwhB,GAAAC,GAIAtkB,EAAKyhB,EAA4BtS,GAAdnP,EAAK0hB,GACnBD,IAAAA,EAALA,EAAKA,EAAyCT,EAALA,EAAKA,EGgGnC1nB,MAAAA,QAAQirB,KACjBA,EAAS,CAAC3pB,OAAO2pB,KAGnBC,GAAAnsB,EAAKosB,EHpG+B9kB,IGoGL4kB,GHjG1BtC,EAAAA,EAAqB,EACpByC,EAAsB1kB,EAAK6gB,EEmgErB8D,EFlgEP/B,EAAAA,EAAsB,IAAIC,GAK/B7iB,EAAKgiB,EAAyB4C,GAAd5kB,EAAK6gB,EACjB6D,EAAsBN,EAAa,MAAOpkB,EAAKwhB,GAEnD,EAAIxhB,EAAKsiB,IACPtiB,EAAKuiB,EAA4B,ITzY3BtI,GS0YGvV,EAAK1E,EAAK6kB,GAAiB7kB,EAAMA,EAAKgiB,GAC3ChiB,EAAKsiB,IR5bJ3H,GQ+bP3a,EAAKihB,EACDjhB,EAAKgiB,EJ5hBWnD,mBI6hBhB7e,EAAK8kB,IAEHC,EACF/kB,EAAKshB,ElByGTnS,GkBzG2CnP,EAAKshB,GAAiB,GAC7DthB,EAAKwhB,GACFxhB,EAAKmiB,IACRniB,EAAKmiB,EAAQ,QAEf4C,EAAQ,gBAAkB,oCAC1B/kB,EAAKgiB,EAASgD,GAAKhlB,EAAKyhB,EAAazhB,EAAKmiB,EAAOniB,EAAKwhB,EAAWuD,KAEjE/kB,EAAKmiB,EAAQ,MACbniB,EAAKgiB,EAASgD,GAAKhlB,EAAKyhB,EAAazhB,EAAKmiB,EAAO,KAAM4C,IAE5CE,KPlfmCC,SAAAA,EAC9CC,EAAMvB,EAAKvI,EAAI+J,EAASvB,GAG1B7jB,EAAKhD,MAAK,WAuLV,GAxLWrB,EAwLDuf,EAIV,GAxLoD2I,EA4LpD,IADI5rB,IAAAA,EAAM,GACNotB,EA5LgDxB,EA4LlC7Y,MAAM,KACf7S,EAAI,EAAGA,EAAIktB,EAAOjtB,OAAQD,IAAK,CAEtC,IAAImtB,EADQD,EAAOltB,GACE6S,MAAM,KAC3B,GAAsB,EAAlBsa,EAASltB,OAAY,CACvB,IAAIuH,EAAM2lB,EAAS,GACf1lB,EAAQ0lB,EAAS,GAEjBC,IAAAA,EAAW5lB,EAAIqL,MAAM,KAEvB/S,EADqB,GAAnBstB,EAASntB,QAA8B,QAAfmtB,EAAS,GACnCttB,GAAO0H,EAAM,KAAMC,EAAQ,IAE3B3H,GAAO0H,EAAM,oBAfjB6lB,EAAO,UAJPA,EArLkD3B,EAD3C,MAAA,gBAAkBxI,EAAK,cAAgB+J,EAAU,MAAQD,EAC5D,KAAOvB,EAAM,KAAO4B,KO6e1BC,CAAAzlB,EAAK8gB,EACD9gB,EAAKmiB,EAAOniB,EAAKyhB,EAAazhB,EAAK+gB,EAAM/gB,EAAKghB,EAAUhhB,EAAKwhB,GAmTZkE,SAAQC,GAARD,GAErD,QAAK1lB,EAAKgiB,IAIQ,OAAdhiB,EAAKmiB,GA1jBMyD,GA0jBY5lB,EAAK2hB,GAC5B3hB,EAAK6gB,EEkzDGgF,IFxxD+BC,SAAQC,GAARD,EACzCE,EAAY1K,GAEd,IAEI2K,EAFAC,GAA6B,EAGjC,MAAQlmB,EAAKqiB,GAAcriB,EAAKiiB,EAAqB3G,EAAaljB,QAEhE,CAAA,GADA6tB,EAAiBE,GAALA,EAAmB7K,GAC3B2K,GAA4BxC,GAAmB,CD9yB3C/E,GC+yBFsH,IAEFhmB,EAAKkiB,EAhkBDkE,EAikBSC,GNjvBMC,IMkvBnBJ,GAA6B,GAE/B9K,GAAApb,EAAK8gB,EACD9gB,EAAK+gB,EAAM,KAAM,yBAR4B,MAU5C,GAAIkF,GAA4BzC,GAAgB,CACrDxjB,EAAKkiB,EAxkBCkE,EAykBOC,GNtvBCE,IMuvBdnL,GAAApb,EAAK8gB,EACD9gB,EAAK+gB,EAAMzF,EAAc,mBAC7B7L,GAA6B,EAC7B,MAEA2L,GAAApb,EAAK8gB,EACD9gB,EAAK+gB,EAA6BkF,EAAY,MAC7CO,GAALA,EAA+CP,GA3C/CN,GA+CJc,IAAuBR,GA9CSxC,IA8CTwC,GA7CSzC,KA6ChCiD,EA5CO7D,EAAoBI,EAAiB,GA4C5CyD,EA3COxE,EAAqB,GA6C5B,GAAI+D,GACuB,GAAvB1K,EAAaljB,QACZ4H,EAAK4iB,EAAoBK,IAE5BjjB,EAAKkiB,EA1mBEwE,EA2mBML,GNtwBEM,IMuwBfT,GAA6B,GAG1B3E,EAAAA,EAAcvhB,EAAKuhB,GAAe2E,EAEvCzW,EAO4B,EAAtB6L,EAAaljB,SAAe4H,EAAKwiB,IACnCxiB,EAAKwiB,GAAqB,GACrB3B,EAALA,EAAKA,GEm1BA+F,GFn1B6BC,GEm1BK5mB,EAAK6mB,IACzC7mB,EAAK8mB,IACR9mB,EAAK6gB,EAAc9jB,KACf,uDFt1BoCse,EEu1BvBljB,QAGZ4uB,GAALA,GACA/mB,EAAK8mB,GAAmB,EACXV,GRhoDRY,OM6xBYC,GAAnBlnB,EAAK8gB,EACD9gB,EAAK+gB,EAAMzF,EAAc,8BACxB6L,GAALA,GACKC,GAALA,IA8DqCC,SAAQC,GAARD,EAAS/L,GAEhD,IAAMiM,EAAiBvnB,EAAKiiB,EACtBuF,EAAelM,EAAazW,QAAQ,KAAM0iB,GAC5B,OAAC,GAAjBC,EACoB/D,MAIX9K,OADQ2C,EAAa1d,UAAU2pB,EAAgBC,IAExDC,MAAMjK,GAIcgK,IAAlBE,GAAiC,GACjBlK,EAAOlC,EAAaljB,OAIpC6tB,IAAAA,EAAY3K,EAAaqM,OAAOD,EAAiBlK,GAClDyE,EAAAA,EAAqByF,EAAkBlK,MAwFEoK,SAAQvD,GAARuD,GAE9C5nB,EAAK6hB,EAAuB/e,KAAKD,MAAQ7C,EAAKkhB,EAC9C2G,GAAAC,EAAyB9nB,EAAKkhB,GAUe6G,SAAAF,GAAAE,EAASC,GAEtD,GAA6B,MAAzBhoB,EAAK8hB,EAEP,MAAUvoB,MAAM,2BAElByG,EAAK8hB,EACYmG,GAAgBvjB,EAAK1E,EAAKkoB,GAAoBloB,GAAOgoB,GASxBG,SAAQC,GAARD,GAE1CnoB,EAAK8hB,IACF1H,EAAO7B,aAAavY,EAAK8hB,GAC9B9hB,EAAK8hB,EAAmB,MAiEgB,SAAAuG,GAAAC,GE/sBlCC,GFitBJvoB,EAAK6gB,EElDG2H,GFkDoBxoB,EAAKqiB,GAIvBoG,GAAdzoB,EAAK6gB,EAA2B7gB,GAUE0oB,SAAAC,GAAAD,GAE7BE,GAALA,GAEkBrG,IAAAA,EAALA,EAAKA,EIxtClBtiB,GAAiC,mBAAfiG,EAAIH,IACpBG,EAAIH,KJwtCN/F,EAAKuiB,EAA4B,KAGjCpK,GAAAnY,EAAKqhB,GAGLtG,GAAA/a,EAAKihB,GAEDjhB,EAAKgiB,IAGD6G,EAAU7oB,EAAKgiB,EACrBhiB,EAAKgiB,EAAW,KAChB6G,EAAQC,QACRD,EAAQ9iB,MAoGkCgjB,SAAAA,GAAAA,EAASzpB,GAErD,IACOuhB,IAAAA,EAALA,EAAKA,EEqdP,GA9yCQ0H,GA8yCJlwB,EAAKmwB,IACJnwB,EAAKuuB,GFtdoBC,GEudQmC,GAAhC3wB,EAAK4wB,EFvdmBpC,IE6d9B,IF7d8BA,EAnjBlBpE,GEihCwBuG,GAAhC3wB,EAAK4wB,EF9dqBpC,IEh1BtBqC,GA+yCJ7wB,EAAKmwB,EAAuC,CAE9C,IACE,IAAAW,EAAW9wB,EAAK+wB,GG/qDEC,EAAQ3sB,ML6sCM4C,GEmehC,MAAOgqB,GACPH,EAAW,KAEb,GAAI9vB,MAAMC,QAAQ6vB,IAAgC,GAAnBA,EAAS/wB,OAAa,CACA+wB,IAAAA,EAAAA,EAsDvD,GAAyB,GAArBI,EAAe,IA+BqDvpB,EAMxE,IA3FIwpB,EA2FKC,EAGF,CAAA,GA9FHD,EA8Fa5C,EAEV,CAAA,KAhGH4C,EAiGK5C,EFrlBGhF,EEnyBgB8H,IFgzBE7C,EAblBjF,GE2lBV,MAAA5hB,EAHK2pB,GApGHH,GAqGGI,GArGHJ,GAyGJK,GAzGIL,MRroDiBM,UQ+rDhBC,EAAAA,GAA2BR,EAAe,GAE3C,EA5DAC,EA2D2BO,GA3D3BP,EA2D2DQ,GA/vCNC,MAiwChBV,EAAe,IA7DpDC,EAjzBSU,GA46B4C,GA3HrDV,EA2H2BW,IA3H3BX,EAoEQY,IApERZ,EAsEKY,EAAuCnC,GACnCvjB,EAvET8kB,EAuEmBa,GAvEnBb,GAwEI,MA7CR,GAAyD,GAArBc,GA1BhCC,EA0BKtB,IA1BLsB,EA2BOC,GAAgC,CACvC,IA5BAD,EA6BOC,KACL,MAAOlB,IA9BTiB,EAmCKC,QAAiCtgB,WAhCtCugB,EAlvCUC,SA0vCR,IFnfwB7D,EAnjBlBpE,GEkiCNpqB,EAAKuuB,GF/emBC,IEgfrB8C,GAALA,IIpsDiDrhB,ENotCjBhJ,GEs1BpC,IAjW4C6pB,EADzB9wB,EAAK+wB,GGjsDFC,EAAQ3sB,ML6sCM4C,GEs1B3BnH,EAAI,EAAGA,EAAIwyB,EAAUvyB,OAAQD,IAAK,CACzC,IAAIyyB,EAAYD,EAAUxyB,GAG1B,GArWE0yB,EAmWGb,EAAeY,EAAU,GAC9BA,EAAYA,EAAU,GA5qDfE,GAw0CLD,EAqWOrC,EACP,GAAoB,KAAhBoC,EAAU,GAAW,CAtWzBC,EAuWOE,EAAOH,EAAU,GAvWxBC,EAwWOG,GAAqCJ,EAAU,GAEpD,MAAMK,EAAoBL,EAAU,GACX,MAArBK,IA3WNJ,EA4WSK,GAAkBD,EA5W3BJ,EA6WS/J,EAAc9jB,KAAK,OA7W5B6tB,EA6W0CK,KAGlCC,MAAAA,EAA0BP,EAAU,GAC1C,MAAIO,IAjXNN,EAkXSO,GAAiBD,EAlX1BN,EAmXS/J,EAAc9jB,KAAK,QAnX5B6tB,EAmX2CO,KAIzC,MAAMC,EAAoBT,EAAU,GACX,MAArBS,GAC6B,iBADjCC,GACiE,EAApBD,IACrCE,EAAU,IAAMF,EA1X1BR,EA2XSW,EAA+BD,EA3XxCV,EA4XS/J,EAAc9jB,KAAK,gCAAkCuuB,IAG5DE,EA/XFZ,EA0TJ,MAAMa,EF/yBwB7E,EAxBlB7E,EEw0BR0J,GAAAA,EAAK,CACP,MAAMC,EACFD,E3B/xBME,E2B+xBNF,E3B/xBkBE,EAAKC,kBuB1hBcC,0BvB0hBW,K2BgyBhDH,GAAAA,EAAJ,CACO1C,IAAAA,EAALA,EAAKA,EKliELha,EAAK8c,ItCoLyB,GiC82DsBJ,EjC92D7C9mB,QsChL6BgF,UtCgLN,GiC82DsB8hB,EjC92D7C9mB,QsC/K6BgF,UtC+KN,GiC82DsB8hB,EjC92D7C9mB,QsC9K6BgF,QACtCoF,EAAK+c,EAAW/c,EAAKgd,EACrBhd,EAAK8c,EAAe,IAAIG,IACpBjd,EAAKkd,IACFC,GAALA,EAAgBnd,EAAKkd,GACrBld,EAAKkd,EAAW,OL0hElB,GAAIE,EA3uCMC,EA2uCwB,CAChC,MAAMC,EACFb,E3BtyBIE,E2BsyBJF,E3BtyBgBE,EAAKC,kBuBhhBSW,qBvBghBgB,K2BuyB9CD,IACFE,EAtuCDC,GAsuCuBH,EAIEI,GAAxBld,EAAKmd,EAFsBP,EAjvCrBC,EAqvCFC,KA5UN1B,EAiYOrC,EAtsDHU,EAq0CJ2B,EAkYWrQ,GAlYXqQ,EAmYSrQ,EAASqS,KAnYlBhC,EAsYW/D,IAtYX+D,EAuYSiC,EAAkBhqB,KAAKD,MF53BNgkB,EAblBjF,EEkgBRiJ,EAwYS/J,EAAc9jB,KACf,kBAzYR6tB,EAyYiCiC,EAAkB,OAGZjG,IAAAA,EFj4BbA,EEw7B9B,IAvDMkG,EA5YFlC,GAgcCmC,GAwLYC,GAxLMC,EAAAA,EAgRXvI,EA/QRlV,EAAKub,GAwL2C,KAxLPvb,EAAK0d,GAE9CtG,EF3+CQpE,EE2+C4B,CAEN2K,GAAhC3d,EAAKwZ,EAAyCpC,GAC9CA,IAAAA,EAAAA,EAA0B2E,EAALA,EAAKA,EFxrCxB6B,GACF7b,EAAKgF,WAAW6W,KAGTvL,IACF8G,GAALA,GACKtE,GAALA,IEmrCKsC,EAAAA,EAAsBC,OAEtByG,GAALA,GA3DoC,EA9YlCzC,EA8YW0C,EAAcn1B,QAChBo1B,GA/YT3C,OAiZ2B,QAAhBD,EAAU,IAAgC,SAAhBA,EAAU,IAExCH,GAnZPI,EArwCE4C,QAhEEvE,GAq0CJ2B,EAqZcrC,IACM,QAAhBoC,EAAU,IAAgC,SAAhBA,EAAU,GAKlB,QAAhBA,EAAU,GACPH,GA5ZTI,EArwCE4C,GAmqDOC,GA9ZT7C,GAga2B,QAAhBD,EAAU,IAharBC,EAqakBrQ,GAralBqQ,EAsaSrQ,EAASmT,GAAyB/C,GAta3CC,EA+aKV,EAAyB,GFl6BnBlF,KACb,MAAO7oB,KQpqCYwxB,SAAQC,GAACC,EAAK7e,GAEnC,GAAI6e,EAAI9e,SAAiC,mBAAf8e,EAAI9e,QAC5B8e,EAAI9e,QAAQC,OAHwBC,QAItB9L,GAAAA,EAAY0qB,IAAuB,iBAARA,EACzCz0B,MAAM6E,UAAU8Q,QAAQ5Q,KAA+B0vB,EAAM7e,OALzBC,QAUpC,IAHA,IAAI/O,EAtHe4tB,SAASD,GAE9B,GAAIA,EAAIE,IAAiC,mBAAXA,EAAAA,GAC5B,OAAOF,EAAIE,KAGb,IAAIF,EAAIG,GAAqC,mBAAjBH,EAAIG,EAAhC,CAOA,GAAmB,oBAAnBC,KAAkCJ,aAAlCI,IACE,OAAaC,MAAAA,KAAKL,EAAI3tB,QAGxB,KAAmB,oBAAf+rB,KAA8B4B,aAAe5B,KAAjD,CAGA,GAAS9oB,EAAY0qB,IAAuB,iBAA5C9tB,EAAsD,CACpD,IAAI6G,EAAK,GACLunB,EAAIN,EAAI11B,OACP,IAAA,IAAID,EAAI,EAAGA,EAAIi2B,EAAGj2B,IACrB0O,EAAGzM,KAAKjC,GAEV,OANoD8H,E1BsFhDoP,EAAM,GACRlX,EAAI,EACR,IAAK,MAAMwH,K0B/EgBmuB,E1BgFzBze,EAAIlX,KAAOwH,EAEN0P,OAAAA,I0BOmB0e,CAAQD,GAC5BvJ,EAxJiB8J,SAASP,GAEhC,GAAIA,EAAIG,GAAqC,mBAAbA,EAAAA,EAC9B,OAAWA,EAAAA,IAKb,GAAoB,oBAApBC,KAAmCJ,aAAeI,KAC9B,oBADpBhC,KACmC4B,aAAe5B,IAChD,OAAO7yB,MAAM80B,KAAKL,EAAIvJ,UAEL,GAAA,iBAARuJ,EACT,OAAOA,EAAI9iB,MAAM,IAEV5H,GAAAA,EAAY0qB,GAAM,CAGzB,IAFA,IAAIjnB,EAAK,GACLunB,EAAIN,EAAI11B,OACHD,EAAI,EAAGA,EAAIi2B,EAAGj2B,IACrB0O,EAAGzM,KAAK0zB,EAAI31B,IAEd,OAAA8H,E1B0GF,IAAWN,KAFL0P,EAAM,GACRlX,EAAI,EACR6H,EACEqP,EAAIlX,K0BzGuB21B,E1ByGZnuB,G0BzGjB,OAvBqCM,EAwJTouB,CAAUP,GAChCM,EAAI7J,EAAOnsB,OACND,EAAI,EAAGA,EAAIi2B,EAAGj2B,IACrB8W,EAAE7Q,UAXgC8Q,EAWCqV,EAAOpsB,GAAIgI,GAAQA,EAAKhI,GAAI21B,IRmPrEztB,EAAAmgB,GAAAtiB,WAAAsY,WAAsC8X,SAAS/C,GAE7CzyB,KAAKooB,EAAWqK,GA8IOgD,EAAzBzJ,GAAoD0J,SAASC,GAErD/C,EAAqC+C,EAAIjnB,OACzCknB,MAAAA,EAAW51B,KAAKypB,EAClBmM,GDpeSC,GCqeLC,GAAJlD,GAGFgD,EAASvU,IAGTrhB,KAAK+rB,GAAgB6G,IAUzB7G,EAAAA,GAA2CgK,SAAShG,GAIlD,IACE,GAAIA,GAAW/vB,KAAKkpB,EA6B0ChiB,EAAA,CAEhE,MAAMgmB,EAA2B4I,GA9B7BE,KA8BoB9M,GACxB,IAAM+M,EA/BFD,KA+BmB9M,EAASgN,KA/B5BF,KAgCoB9M,EAASiN,KAKjC,KDhiBaN,ECgiBT3I,KDhiBS2I,GCiiBR3I,GC/lBYtc,IDyjBbolB,KAiQM9M,IAjQN8M,KAoQKlM,EAAoBK,GApQzB6L,KAuQW9M,EAASkN,MAAoCC,GAvQxDL,KAuQ+C9M,KAlOnD,CArCI8M,KA6CMzM,GDniBA3D,GCmiBcsH,GLrlBjB1H,GKslBHyQ,GAIa9J,KASZ2D,GA3DDkG,MA6DJ,IAAMM,EA7DFN,KA6DgB9M,EAASiN,KA7DzBH,KA8DC1M,EAAkBgN,EA0JoCnvB,EAE3D,GAAUovB,GA1NNP,MA0NJ,CAGA,IAAMQ,EACgDH,GA9NlDL,KA8NyC9M,GACzC1G,EAAe,GACnB,IAAMiU,EAAiBD,EAAel3B,OAChCo3B,EDvtBI9Q,GCwtBQkQ,GAlOdE,KAkOK9M,GACL,IAnOA8M,KAmOMlM,EAAoBG,EAAa,CACzC,GAA2B,oBAAhB0M,YAA6B,CAGjCtI,GAvOL2H,MAwOAzG,GAxOAyG,MAyOA,IAAAtJ,EAAO,GAAP,MAAAvlB,EAzOA6uB,KA2OGlM,EAAoBG,EAAc,IAAS2M,EAAOD,YAEzD,IAASt3B,EAAI,EAAGA,EAAIo3B,EAAgBp3B,IA7OhC22B,KA8OGlM,EAAoBK,GAA0B,EAEnD3H,GAhPEwT,KAgPmBlM,EAAoBG,EAAY4M,OACjDL,EAAen3B,GAAI,CAACy3B,OAFJJ,GAAoBr3B,GAAKo3B,EAAiB,IAIhED,EAAetf,OAAO,EAAGuf,GACpB3M,KAAAA,EAAoBI,GAAkB1H,EACtC2G,KAAAA,EAAqB,EAC1BuD,EAtPIsJ,KAsPQlM,EAAoBI,OA3B9BwC,EA3NEsJ,KA2NU9M,EAASkN,KA5IvB,GANK3N,KAAAA,EAAyB,KAAV6N,EP7kBqCS,SAAAA,EACvD1K,EAAMvB,EAAKvI,EAAI+J,EAASY,EAAY8J,GAEtC9vB,EAAKhD,MAAK,WAER,MAAO,iBAAmBqe,EAAK,eAAiB+J,EAAU,MAAQD,EAC9D,KAAOvB,EAAM,KAAOoC,EAAa,IAAM8J,KOykB1BC,CA3EfjB,KA2EChO,EA3EDgO,KA4E4B3M,EA5E5B2M,KA4EyCrN,EA5EzCqN,KA4E2D/N,EA5E3D+N,KA6EK9N,EAAUgF,EAAYoJ,GA7E3BN,KA+EMvN,EAAV,CAqBA,GApGIuN,KAsKQpM,IAtKRoM,KAsKwCrM,EAlEJ,CA4EgBxiB,EAAA,CAExD,GAlLI6uB,KAkLK9M,EAAU,CACH,IAAAxQ,EAAKwQ,EAnLjB8M,KAmLiB9M,EAEnB,IzBslBFxQ,EAAOzW,EAAK6wB,EAAO7wB,EAAK6wB,EAAKC,kBuBtgBemE,2BvBsgBU,Q+BvuCD1nB,EN+oBrC1I,GAEwC,CACpD,IAAAqwB,EAHYrwB,EAGZ,MAAAK,GAIJgwB,EAAO,KApFL,KADMC,EAAkBD,GAQjB,CA7GLnB,KA8GKvN,GAAc,EACdW,KAAAA,EAzXWiO,EA0XhBC,GN3iBwBC,IMgjBxB1H,GArHAmG,MAsHK1H,GAtHL0H,MAuHA,MAAA9uB,EAhBmBknB,GAvGnB4H,KAuGKhO,EAvGLgO,KAwGS/N,EAAMmP,EACX,0DAzGJpB,KA2GKrM,GAA0B,EAC1B+D,GA5GLsI,KA4GwBoB,GA5GxBpB,KA2HKnM,GACF2N,GA5HHxB,KA4HqB9I,EAAY1K,GCrrBpB5R,IDyjBbolB,KA6H0CvN,GDxnBjCoN,GCynBP3I,IRpnBMuK,GQsfRzB,KA2YC7N,EA3YD6N,KA4YKzN,EVzvBO1H,OU6WZmV,KA4Y0C0B,IA5Y1C1B,KA6YCzN,EAAcxH,WA3QEqN,GAlIjB4H,KAkIGhO,EAlIHgO,KAmIO/N,EAAMzF,EAAc,MACxBkL,GApIHsI,KAoIsBxT,ID1nBhBoD,GC6nBNsH,GACGmB,GAxIH2H,MAAAA,KA2IMvN,IA3INuN,KA+IMzM,IDroBA3D,GCsoBJsH,EACYyC,GAjJdqG,KAiJKjO,EAjJLiO,OAAAA,KAsJKvN,GAAc,EACd+C,GAvJLwK,aAgFF,KAAIM,GAAuD,EAAtC9T,EAAazW,QAAQ,gBAhFxCiqB,KAqFK5M,EA/VWiO,EAgWH9J,GNjhBWgK,MM2bxBvB,KA0FK5M,EAnXDuO,EAoXSpK,GNnhBGqK,KMuhBbvJ,GA/FH2H,MAgGG1H,GAhGH0H,QAMF,MAAOxF,MA0WciF,EAAzBiC,GAAyCG,WAEvC,GAAK73B,KAAKkpB,EAAV,CAGA,IAAMgE,EAA2B4I,GAAd91B,KAAKkpB,GAClB1G,EAAexiB,KAAKkpB,EAASkN,KAC1BjN,KAAAA,EAAqB3G,EAAaljB,SACpCwwB,GAALA,MACK0H,GAALA,KAAuBtK,EAAY1K,GAC/BxiB,KAAKyoB,GDh3BD7C,GCi3BJsH,GACG1B,GAALA,SAiHmBiK,EAAzBqC,OAAkCC,WAEhC/3B,KAAKupB,GAAa,EACb8E,GAALA,OAyEuBoH,EAAzBrG,GAA8C4I,WAE5Ch4B,KAAKgpB,EAAmB,KACxB,MAAMjf,EAAMC,KAAKD,MAGsB,GAAnCA,EAAM/J,KAAK+oB,GPliC2BkP,SAAAA,EAASnN,GAEnD5jB,EAAKhD,MAAK,WAER,MAAO,YAAc4mB,KOsjCJoN,CAvBjBC,KAuBGnQ,EAvBHmQ,KAuBsCxP,GA53BzBmE,GAq2BbqL,KA2BOtP,IACMsD,KAEAoB,GN1gCE6K,KM6gCZ/J,GAjCH8J,MAAAA,KAqCG/O,EAp3BI3D,EAq3BJ6I,GAtCH6J,OAIKnJ,GAALA,KAAyBhvB,KAAK+oB,EAAuBhf,ISl/BzD,IAAAsuB,GAA8BC,OAC1B,qINpHOC,SAAAC,GAASC,EAASC,GA0DvBD,GAxCJz4B,KAAK24B,EANL34B,KAAK44B,EANL54B,KAAK64B,EAAU,GAkBf74B,KAAK84B,EAAQ,KAYRC,KAAAA,EANL/4B,KAAKq0B,EAAQ,GAkBR2E,KAAAA,GAAc,EAUfP,aAAwBF,GAAK,CAC/Bv4B,KAAKg5B,OAAkC5nB,IAAnBsnB,EAAgCA,EACAD,EAqqB1CO,EApqBVC,GAAAC,KAAeT,EA0MLI,GAzMVM,KAiQGP,EAjQcH,EAkPPG,EAkDPD,KAAAA,EAnSYF,EAoRLE,EAnRLS,GAALA,KAAaX,EAsTHK,GArTVO,KA6WGhF,EA7WUoE,EA8VHpE,EAsGA1I,EAncQ8M,EAmcR9M,EA06BR5d,IAAAA,EAAK,IAAaurB,GACnBC,EAAAA,EAAgBpyB,EAAKoyB,EACpBpyB,EAAKqyB,IACPzrB,EAAGyrB,EAAkD,IAAIpE,IAAIjuB,EAAKqyB,GAClEzrB,EAAG0rB,EAAStyB,EAAKsyB,GAj3CjBC,GAAAC,KAm3CK5rB,GAr0BFgrB,KAAAA,EA7iBcN,EA8hBPM,OA7hBDN,IAAYtB,EAAyBr1B,OAAO22B,GMsH/Cr1B,MAAqBi1B,MNrH3Br4B,KAAKg5B,IAAgBN,EAKhBQ,GAALA,KAAe/B,EMoETyC,INpEoD,IAAI,GAC9DT,KAoPGP,EACqBiB,GArPP1C,EMoER2C,INpEsD,IAC/DC,KAsRGpB,EACqBkB,GAvRT1C,EMoET6C,INpEoD,IAuRR,GAtR7CZ,GAALA,KAAajC,EMoET8C,INnEJZ,KAgWGhF,EAA8BwF,GAhWpB1C,EMoET+C,INpEkD,IAgWG,GA/VpDP,GAALA,KAAkBxC,EMoERgD,INpEuD,IAAI,GACrEC,KAgiBGrB,EACqBc,GAjiBP1C,EMoETkD,INpEsD,MAG9Dr6B,KAAKg5B,IAAgBN,EACrB14B,KAAK2rB,EAAa,IAAa2N,GAAU,KAAMt5B,KAAKg5B,IAwK7BsB,SAAQC,GAARD,GAEzB,OAAgB/B,IAAAA,GAAIrxB,GAqBSszB,SAAAvB,GAAAuB,EAASC,EAAWC,GAGjDxzB,EAAK2xB,EACD6B,EAAsBb,GAAeY,GAAW,GAAQA,EAIxDvzB,EAAK2xB,IACP3xB,EAAK2xB,EAAU3xB,EAAK2xB,EAAQl2B,QAAQ,KAAM,KAmGjBg4B,SAAAC,GAAAD,EAASE,GAIpC,GAAIA,EAAS,CAEX,GADAA,EAAUhb,OAAOgb,GACblM,MAAMkM,IAAsB,EAAVA,EACpB,MAAMp6B,MAAU,mBAAqBo6B,GAEvC3zB,EAAK4xB,EAAQ+B,OAEb3zB,EAAK4xB,EAAQ,KAkEiBgC,SAAApB,GAAAoB,EAASC,EAAWL,GAIhDK,aAA8BzB,IAChCpyB,EAAKykB,EAAaoP,EA+/BuBC,SAAAA,EAASC,GAEpCA,IAAe/zB,EAAK8xB,IAE7BkC,GAALA,GACAC,EAlEG5B,EAAgB,KAmEnBryB,EAAKsyB,EAAQtjB,SAAQ,SAASpP,EAAOD,GAEnC,IAAIu0B,EAAYv0B,EAAIiK,cACpB6F,GAAWykB,IACJjf,GAALA,KAAYtV,GACPw0B,GAALA,KAAeD,EAAWt0B,MAE3BI,IAEA8xB,EAAAA,EAAciC,EA7gCDK,CAAhBp0B,EAAKykB,EAAyBzkB,EAAK8xB,KAE9B0B,IAGHK,EAAqBQ,GACjBR,EAAoBS,KAE1Bt0B,EAAKykB,EAAa,IAAa2N,GAAUyB,EAAW7zB,EAAK8xB,IAmEtByC,SAAQC,GAARD,EAAS50B,EAAKC,GAGnDI,EAAKykB,EAAWtO,IAAIxW,EAAKC,GAiHK60B,SAAAA,GAAAA,GAK9B,OAFK9H,GAALA,EMmaQ+H,KHlBDhxB,KAAKixB,MADFxrB,WACQzF,KAAKC,UAAcxF,SAAS,IAC1CuF,KAAKkxB,IAAIlxB,KAAKixB,MAFRxrB,WAEczF,KAAKC,U1CodtBb,KAAKD,O0Cpd6C1E,SAAS,KHrZzB6B,EA6NjB2yB,SAAAA,GAASrvB,EAAKuxB,GAGtC,OAAA70B,EAOO60B,EAAuBC,UAAUxxB,EAAI7H,QAAQ,OAAQ,UAC9Bs5B,mBAAmBzxB,GAPxC,GAuBoB+wB,SAAAW,GAC3BC,EAAeC,EAAOC,GAExB,MAA6B,iBAAlBF,GACLG,EAAUC,UAAUJ,GAAex5B,QAAQy5B,EAAgBI,IAC3DH,IAGFC,EAAyCA,EA6BlB35B,QAAQ,uBAAwB,QA3BlD25B,GAEF,KAUcE,SAAQC,GAACC,GAG9B,MAAO,MADHhkB,EAAIgkB,EAAGl9B,WAAW,KACF,EAAK,IAAK6F,SAAS,KAAW,GAAJqT,GAASrT,SAAS,IA9zB7DkzB,GAAInzB,UAAUC,SAAWs3B,WAE5B,IAAIx9B,EAAM,GAENy9B,EAASC,KA+JDhE,EA9JR+D,GACFz9B,EAAImC,KACSi6B,GACLqB,EAAiBE,IAAiC,GACtD,KAGFC,IAAAA,EAASC,KAmODrE,EAvLLx5B,OA3CH49B,GAAoB,QAAVH,KACZz9B,EAAImC,KAAK,OAEL27B,EAAWC,KA4LLtE,IA1LRz5B,EAAImC,KACSi6B,GACL0B,EAAmBH,IAAiC,GACxD,KAGN39B,EAAImC,KGwSC67B,mBAAmBr7B,OHxSsCi7B,IAkzBrCp6B,QAAQ,uBAAwB,QA/yB7C,OADRiC,EAAOw4B,KAwPDtE,IAtPR35B,EAAImC,KAAK,IAAKQ,OAAO8C,MAIrBy4B,EAAOC,KA2RCjJ,KAzRNkJ,KAuOQ5E,GAvO8B,KAAlB0E,EAAK/6B,OAAO,IAClCnD,EAAImC,KAAK,KAEXnC,EAAImC,KAAci6B,GACd8B,EACkB,KAAlBA,EAAK/6B,OAAO,GAAqBk7B,GACAC,IACjC,MAGFC,EAAQC,KAkWAhS,EAAWtmB,aAhWrBlG,EAAImC,KAAK,IAAKo8B,IAGZE,EAAWC,KA4cH9E,IA1cV55B,EAAImC,KACA,IACSi6B,GACLqC,EAAmBE,KAEtB3+B,EAAIoC,KAAK,KA4xBlB,IAAAu7B,GAA2C,YAS3CW,GAAuC,UAQvCD,GAAuC,SAQvChC,GAAgC,UAQhCsC,GAAmC,KAqCd,SAAAC,GAASC,EAAWtF,GAiBvC14B,KAAKy5B,EANLz5B,KAAKw5B,EAAU,KAYfx5B,KAAKu5B,EAAgByE,GAAa,KAM7BhF,KAAAA,IAAgBN,EASiCuF,SAAAC,GAAAD,GAEjD/2B,EAAKsyB,IACRtyB,EAAKsyB,EAAkD,IAAIpE,IAC3DluB,EAAKuyB,EAAS,EACVvyB,EAAKqyB,GMrgBmB4E,SAASC,EAAcz1B,GAErD,GAAKy1B,EAAL,CAGIC,EAAQD,EAAalsB,MAAM,KAC1B,IAAA,IAAI7S,EAAI,EAAGA,EAAIg/B,EAAM/+B,OAAQD,IAAK,CACrC,IAAIi/B,EAAgBD,EAAMh/B,GAAG0M,QAAQ,KAEjCjF,EAAQ,KACS,GAAA,GAAjBw3B,EAAoB,CACtB,IAAAt4B,EAAOq4B,EAAMh/B,GAAGyF,UAAU,EAAGw5B,GAC7Bx3B,EAAQu3B,EAAMh/B,GAAGyF,UAAUw5B,EAAgB,QAE3Ct4B,EAAOq4B,EAAMh/B,GAEfsJ,EAAS3C,EAAMc,EHpIVm1B,mBGoIwCn1B,EHpIjBnE,QAAQ,MAAO,MGoIW,MNufrCw7B,CAAej3B,EAAKqyB,GAAe,SAASvzB,EAAMc,GADtDjE,EAGJ6U,IG7nBJukB,mBH6nB8Bj2B,EG7nBPrD,QAAQ,MAAO,MH6nBDmE,OAsGR,SAAAy3B,GAAAC,EAAS33B,GAExCq0B,GAALA,GAEAr0B,EAAW43B,GAALA,EAAiB53B,GACd2yB,EAAAA,EAAQkF,IAAI73B,KACnBs0B,EA0PG5B,EAAgB,KAvPnBryB,EAAKuyB,GACwCvyB,EAAKsyB,EAAQpqB,IAAIvI,GAAKvH,OAC5D4H,EAAKsyB,EAAQmF,OAAO93B,IAgCY+3B,SAAAC,GAAAD,EAAS/3B,GAIlD,OAFKq0B,GAALA,GACA/zB,EAAWs3B,GAALA,EAAiB53B,GACX2yB,EAAAA,EAAQkF,IAAI73B,YA6IuB6kB,GAARoT,EAASj4B,EAAK4kB,GAEhDtP,GAALA,EAAYtV,KAER4kB,EAAOnsB,SACT67B,EA+DG5B,EAAgB,KA9DnBryB,EAAKsyB,EAAQnc,IAASohB,GAALA,EAAiB53B,GrCxjBxBgH,EqCwjB+C4d,IACzDvkB,EAAKuyB,GAAkDhO,EAAOnsB,QA0GvBy/B,SAAQC,GAARD,EAASjqB,GAMlD,OAJImqB,EAAUn9B,OAAOgT,KACZkkB,IACPiG,EAAUA,EAAQnuB,eAJmC3J,GAlUzDI,EAAAw2B,GAAA34B,WAAAsS,IAAmCwnB,SAASr4B,EAAKC,GAE1Co0B,GAALA,MACAC,KAkRK5B,EAAgB,KAhRrB1yB,EAAW43B,GAALA,KAAiB53B,GACnB4kB,IAAAA,EAASzrB,KAAKw5B,EAAQpqB,IAAIvI,GAMvB,OALPtH,GACES,KAAKw5B,EAAQnc,IAAIxW,EAAM4kB,EAAS,IAE3BnqB,EAAAA,KAAKwF,QACP2yB,GAAkD,EAChDz5B,MAmFoBm/B,EAA7BjpB,QAAuCkpB,SAASjpB,EAAGsL,GAE5CyZ,GAALA,MACK1B,KAAAA,EAAQtjB,SAAQ,SAASuV,EAAQ5kB,GAEpC4kB,EAAOvV,SAAQ,SAASpP,GAEtBqP,EAAE7Q,KAAKmc,EAAW3a,EAAOD,EAAK7G,QAC7BA,QACFA,OASwBm/B,EAA7BjK,GAAuCmK,WAEhCnE,GAALA,MAEA,MAAMoE,EAAO/+B,MAAM80B,KAAKr1B,KAAKw5B,EAAQ/N,UAC/BpkB,EAAO9G,MAAM80B,KAAKr1B,KAAKw5B,EAAQnyB,QAC/B0G,EAAK,GACN,IAAA,IAAI1O,EAAI,EAAGA,EAAIgI,EAAK/H,OAAQD,IAAK,CACpC,MAAMmL,EAAM80B,EAAKjgC,GACjB,IAAK,IAAIgP,EAAI,EAAGA,EAAI7D,EAAIlL,OAAQ+O,IAC9BN,EAAGzM,KAAK+F,EAAKhI,IAGjB,OAbgDE,GAwBlD41B,EAAAA,EAAyCoK,SAASC,GAE3CtE,GAALA,MACIntB,IAAAA,EAAK,GACT,GAAuB,iBAAvB7G,EACWu4B,GAALA,KAAiBD,KACnBzxB,EAAKA,EAAGwN,OAAOvb,KAAKw5B,EAAQpqB,IAASqvB,GAALA,KAAiBe,UAE9C,CAEC/T,EAASlrB,MAAM80B,KAAKr1B,KAAKw5B,EAAQ/N,UAClC,IAAA,IAAIpsB,EAAI,EAAGA,EAAIosB,EAAOnsB,OAAQD,IACjC0O,EAAKA,EAAGwN,OAAOkQ,EAAOpsB,IAG1B,OAAO0O,GAWTsP,EAAAA,IAAmCqiB,SAAS74B,EAAKC,GAiB/C,OAfKo0B,GAALA,WAgHK3B,EAAgB,QAvGjBkG,KADJ54B,EAAW43B,GAALA,KAAiB53B,MAErB7G,KAAKy5B,GACwCz5B,KAAKw5B,EAAQpqB,IAAIvI,GAAKvH,QAEhEk6B,KAAAA,EAAQnc,IAAIxW,EAAK,CAACC,IACvB9G,KAAKy5B,GAAkD,EAhBDz5B,MA8B3Bm/B,EAA7B/vB,IAAmCuwB,SAAS94B,EAAK+4B,GAE/C,OAAK/4B,GAIE,GADH4kB,EAASzrB,KAAKm1B,EAAUtuB,IACdvH,OAAawC,OAAO2pB,EAAO,OA0Bd0T,EAA7B95B,SAAwCw6B,WAEtC,GAAI7/B,KAAKu5B,EACP,OAAOv5B,KAAKu5B,MAGTv5B,KAAKw5B,EACR,MAAO,GAGH5b,MAAAA,EAAK,GAKLvW,EAAO9G,MAAM80B,KAAKr1B,KAAKw5B,EAAQnyB,QAChC,IAAA,IAAIhI,EAAI,EAAGA,EAAIgI,EAAK/H,OAAQD,IAAK,CACpC,IAAMwH,EAAMQ,EAAKhI,GACXygC,MAAAA,EG78BD3C,mBAAmBr7B,OH68BiB+E,IACnC2D,EAAMxK,KAAKm1B,EAAUtuB,GAC3B,IAASwH,EAAI,EAAGA,EAAI7D,EAAIlL,OAAQ+O,IAAK,CACnC,IAAI0xB,EAAQD,EAGG,KAAXt1B,EAAI6D,KACN0xB,GAAS,IGp9BR5C,mBAAmBr7B,OHo9BiB0I,EAAI6D,MAE3CuP,EAAGtc,KAAKy+B,IAIZ,OAAYxG,KAAAA,EAAgB3b,EAAGrc,KAAK,MI16CJy+B,SAAQC,GAACC,GAMzClgC,KAAKmzB,EACD+M,GAA6CC,GAyDxCC,EAAOC,4BAGdn5B,EAAuB,GAFjBo5B,EACGC,EAAOC,YAAYC,iBAAiB,eAC/BnhC,SACoB,MAA7BghC,EAAO,GAAGI,iBACmB,MAA7BJ,EAAO,GAAGI,iBAEjBx5B,KACSy5B,EAAOC,GAAeC,EAAOD,EAAOE,IACpCD,EAAOD,EAAOE,MACdD,EAAOD,EAAOE,KAAYC,IAxD9B7N,KAAAA,EAAWhsB,EACZlH,KAAKmzB,EACL,EAOCF,KAAAA,EAAe,OAEhBjzB,KAAKkzB,IACPlzB,KAAKizB,EAAe,IAAIG,KAQ1BpzB,KAAKqzB,EAAW,KAOhBrzB,KAAKipB,EAAmB,GAS1B,IAAAkX,GAA2C,YAqDUa,GAARC,GAC3C,QAAS5N,EAAAA,KAILnsB,EAAK+rB,GACA/rB,EAAK+rB,EAAavO,MAAQxd,EAAKgsB,EAkBYgO,SAAAC,GAAAD,GACpD,OAAS7N,EAAAA,EACA,EAGLnsB,EAAK+rB,EACA/rB,EAAK+rB,EAAavO,KAGpB,EAQwC0c,YAAAA,EAASC,GACxD,OAAAn6B,EAASmsB,EACAnsB,EAAKmsB,GAAYgO,IAGtBn6B,EAAK+rB,GACA/rB,EAAK+rB,EAAayL,IAAI2C,GAYgBC,SAAAC,GAAAD,EAASD,GACpDn6B,EAAK+rB,EACP/rB,EAAK+rB,EAAavb,IAAI2pB,GAEtBn6B,EAAKmsB,EAAWgO,EAWgCG,SAAAA,GAAAA,EAASH,GACvDn6B,EAAKmsB,GAAYnsB,EAAKmsB,GAAYgO,EACpCn6B,EAAKmsB,EAAW,KAIdnsB,EAAK+rB,GAAgB/rB,EAAK+rB,EAAayL,IAAI2C,IAC7Cn6B,EAAK+rB,EAAa0L,OAAO0C,GA2C4BI,SAAQC,GAARD,GACvD,GAAqB,MAAjBv6B,EAAKmsB,EACP,OAAYpK,EAAAA,EAAiB1N,OAAOrU,EAAKmsB,EP+N/BpK,GO5NZ,GAAyB,MAArB/hB,EAAK+rB,GAAmD,IAA3B/rB,EAAK+rB,EAAavO,KAAY,CAC7D,IAAIid,EAASz6B,EAAK+hB,MACb,MAAMze,KAAYyoB,EAAAA,EAAaxH,SAClCkW,EAASA,EAAOpmB,OAAO/Q,EPyNfye,GOvNH0Y,OAAAA,EAGT,OzCqlBY9zB,EyCrlBO3G,EAAK+hB,GG3OM2Y,SAAAA,MLLEC,SAAAA,KAMhC7hC,KAAKuwB,EAAU,IAAcqR,GAoBEE,SAAAC,GAASl8B,EAASm8B,EAAQC,GAEzD,MAAMC,EAASD,GAAc,GAC7B,IACenN,GAAQjvB,GAAS,SAASiB,EAAOD,GAE5C,IAAIs7B,EAAer7B,EACV4D,EAAS5D,KAChBq7B,EAAyBlmB,GAAUnV,IAErCk7B,EAAO1gC,KAAK4gC,EAASr7B,EAAM,IAAMs2B,mBAAmBgF,OAEtD,MAAO3R,GAMP,MAHAwR,EAAO1gC,KACH4gC,EAAS,QACH/E,mBAAmB,YACvB3M,GMqEgB4R,SAAQC,GAC9Bza,EAAc0a,EAAKC,EAAWZ,EAAQh5B,GAExC,IAEgC25B,EAgB5BE,OAAS,KAhBmBF,EAiB5BG,QAAU,KAjBkBH,EAkB5BI,QAAU,KAlBkBJ,EAmB5BK,UAAY,KAlBdh6B,EAASg5B,GACT,MAAOr+B,KC5GoBs/B,YAASC,GAKtC7iC,KAAK8iC,EAAUD,EAAKE,IAAU,KAG9B/iC,KAAKgjC,EAAsBH,EAAKI,KAAsB,EA6DhCC,SAAAA,GAASH,EAAQE,GAEjBlkB,GAAAokB,KAAKnjC,MAG3BA,KAAK8iC,EAAUC,EAGVC,KAAAA,EAAsBC,EAGtBG,KAAAA,OAAmBhyB,EASnB8b,KAAAA,WAAgDmW,GAMhD/M,KAAAA,OAAS,OAyBTgN,aAPLtjC,KAAKwiB,aANLxiB,KAAKqwB,SANLrwB,KAAKujC,WAAa,QAgCbC,mBAAqB,KAG1BxjC,KAAKyjC,EAAkB,IAAIC,QAG3B1jC,KAAK2jC,EAAmB,KAMxB3jC,KAAK4jC,EAAU,MAMVC,KAAAA,EAAO,GAMPC,KAAAA,GAAc,EAYdC,KAAAA,EAHL/jC,KAAKgkC,EAHLhkC,KAAKikC,EAAiB,KLoBxBjE,GAA0B56B,UAAU0yB,OAASoM,cAE3ClkC,KAAKipB,EAAwBkb,GAALA,MAEpBnkC,KAAKqzB,EACPrzB,KAAKqzB,EAASyE,SACd93B,KAAKqzB,EAAW,UAId,GAAArzB,KAAKizB,GAA2C,IAA3BjzB,KAAKizB,EAAavO,KAAY,CACrD,IAAK,MAAMla,KAAOxK,KAAKizB,EAAaxH,SAClCjhB,EAAIstB,SAEN93B,KAAKizB,EAAamR,UGzLZxC,GAAoBx8B,UAAU8W,UAAYmoB,SAASv2B,GAE3D,OAAOwnB,EAAA3xB,KAAoBuY,UAAUpO,OArBEw2B,IA0B/B1C,GAAoBx8B,UAAUxB,MAAQ2gC,SAAS95B,GAEvD,OAAA6qB,EAAO3xB,KAAoBC,MAAM6G,OA5BoB+5B,IEuBlDr4B,EAAkBy2B,GAA8Bxc,OAIxBhhB,UAAUglB,EAAiBqa,WAUtD,OAPI96B,IAAau5B,GAAaljC,KAAK8iC,EAAS9iC,KAAKgjC,IAY1CJ,GAAoBx9B,UAAUqhB,ECnDbie,SAASC,GAEjC,OAAkB,WAEhB,OAAOA,GAJeD,CDoDE,IAuIvBv4B,EAAkB+2B,GAA0B1oB,IAQ/CoqB,IAAAA,GAAQA,EA+I4CC,YAAAA,GAEpD39B,EAAK88B,EAAec,OACf3mB,KAAKjX,EAAK69B,GAAsB35B,KAAKlE,IACrC89B,MAAM99B,EAAK+9B,GAAmB75B,KAAKlE,IAgGK,SAAAqb,GAAA2iB,GAE7Ch+B,EAAKgmB,WAjPCiY,EAmPDlB,EAAAA,EAAiB,KACjBD,EAAAA,EAAiB,KACjBD,EAAAA,EAAe,KAEpBqB,GAAAC,GAgFkD,SAAAD,GAAAE,GAE9Cp+B,EAAKs8B,oBACPt8B,EAAKs8B,mBAAmBl+B,KAAK4B,IArUjCK,EAAAg+B,GAAAngC,WAAAogC,KAAuCC,SAASv7B,EAAQw7B,GAGtD,GAAI1lC,KAAKktB,YAAiDmW,GAExD,MADKrT,KAAAA,QACKvvB,MAAM,gCAGlBT,KAAK4jC,EAAU15B,EACflK,KAAK6jC,EAAO6B,EAEZ1lC,KAAKktB,WAnBGkD,EAoBHiV,GAALA,OAK8BM,EAAhCzZ,KAAuC0Z,SAASC,GAE9C,GA3BQzV,GA2BJpwB,KAAKktB,WAEP,MADAltB,KAAKgwB,QACKvvB,MAAM,+BAGlBT,KAAK8jC,GAAc,EACnB,MAAMgC,EAAc,CAClB7Z,QAASjsB,KAAKyjC,EACdv5B,OAAQlK,KAAK4jC,EACbmC,YAAa/lC,KAAKojC,EAClB4C,WAtIgB50B,GAwIdy0B,IACFC,EAAAG,KAAsBJ,IAGvB7lC,KAAK8iC,GAAgB14B,GACjB87B,MAAM,IAAIC,QAAQnmC,KAAK6jC,EAAmCiC,IAC1D3nB,KACGne,KAAKomC,GAAgBh7B,KAAKpL,MAAOA,KAAKilC,GAAmB75B,KAAKpL,QAKxEgwB,EAAAA,MAAwCqW,WAEtCrmC,KAAKqwB,SAAWrwB,KAAKwiB,aAAe,GACpCxiB,KAAKyjC,EAAkB,IAAIC,aACtBpN,OAAS,OAEH0N,GACThkC,KAAKgkC,EAAelM,OAAO,wBACtBkN,OACG,SA5DF5U,GAgEFpwB,KAAKktB,YACNltB,KAAK8jC,GA9DJqB,GA+DDnlC,KAAKktB,aACRltB,KAAK8jC,GAAc,EACdwC,GAALA,OAGFtmC,KAAKktB,WAAgDmW,IASvD+C,EAAAA,GAAkDG,SAASlW,GAEzD,GAAKrwB,KAAK8jC,IAKV9jC,KAAKikC,EAAiB5T,EAEjBrwB,KAAK2jC,IACR3jC,KAAKs2B,OAASt2B,KAAKikC,EAAe3N,OAClCt2B,KAAKujC,WAAavjC,KAAKikC,EAAeV,WACtCvjC,KAAK2jC,EAAmBtT,EAASpE,QACjCjsB,KAAKktB,WA5FUsZ,EA6FVnB,GAALA,OAGGrlC,KAAK8jC,IAKV9jC,KAAKktB,WApGIuZ,EAqGJpB,GAALA,MAEKrlC,KAAK8jC,IAKV,GAA0B,gBAAtB9jC,KAAKsjC,aACPjT,EAASqW,cAAcvoB,KACnBne,KAAK2mC,GAA2Bv7B,KAAKpL,MACrCA,KAAKilC,GAAmB75B,KAAKpL,YAC5B,QACqC,IAApB4mC,EAAAA,gBACpB,SAAUvW,EAAU,CAGtB,GAFArwB,KAAKgkC,EAC4C3T,EAAS4V,KAAKY,YAC3D7mC,KAAKgjC,EAAqB,CAC5B,GAAIhjC,KAAKsjC,aACP,MAAU7iC,MACN,uEAENT,KAAKqwB,SAAW,QAEXA,KAAAA,SAAWrwB,KAAKwiB,aAAe,GACpCxiB,KAAK+jC,EAAe,IAAIpN,YAErBmQ,GAALA,WAESC,EAAAA,OAAO5oB,KACZne,KAAKgnC,GAAoB57B,KAAKpL,MAC9BA,KAAKilC,GAAmB75B,KAAKpL,QAsBL2lC,EAAhCZ,GAAwDkC,SAAStF,GAE/D,GAAK3hC,KAAK8jC,EAAV,CAKA,GAAI9jC,KAAKgjC,GAAuBrB,EAAO76B,MAEd9G,KAAKqwB,SACvB/uB,KAAiCqgC,EAAO76B,YACpC,IAAC9G,KAAKgjC,EAAqB,CACpC,IAAMkE,EAAavF,EAAO76B,MACM66B,EAAO76B,MACnC,IAAIqgC,WAAW,IACbC,EACFpnC,KAAK+jC,EAAalN,OAAOqQ,EAAY,CAACpQ,QAAS6K,EAAO0F,UAGxDrnC,KAAKqwB,SADLrwB,KAAKwiB,cAAgB4kB,GAIrBzF,EAAO0F,KACJf,GAALA,MAEKjB,GAALA,MAlLOoB,GAqLLzmC,KAAKktB,YACF4Z,GAALA,QASJE,EAAAA,GAAsDM,SAAS9kB,GAExDxiB,KAAK8jC,IAIV9jC,KAAKqwB,SAAWrwB,KAAKwiB,aAAeA,EAC/B8jB,GAALA,QAS8BX,EAAhCgB,GAA6DY,SACzDC,GAEGxnC,KAAK8jC,IAIV9jC,KAAKqwB,SAAWmX,EACXlB,GAALA,QASFrB,EAAAA,GAAqDwC,WAI9CznC,KAAK8jC,GAILwC,GAALA,OAqB8BX,EAAhC+B,iBAAmDC,SAASC,EAAQ9gC,GAElE9G,KAAKyjC,EAAgBoE,OAAOD,EAAQ9gC,IAKN6+B,EAAhC5S,kBAAoD+U,SAASF,GAI3D,OAAK5nC,KAAK2jC,GAOH3jC,KAAK2jC,EAAiBv0B,IAAIw4B,EAAO92B,gBAF/B,IAOXi3B,EAAAA,sBAAwDC,WAEtD,IAAKhoC,KAAK2jC,EAKR,MAAO,GAEHsE,MAAAA,EAAQ,GACRC,EAAOloC,KAAK2jC,EAAiBwE,UACnC,IAAA,IAAIC,EAAQF,EAAK1rB,QACT4rB,EAAMf,MACNgB,EAAOD,EAAMthC,MACnBmhC,EAAM3mC,KAAK+mC,EAAK,GAAK,KAAOA,EAAK,IACjCD,EAAQF,EAAK1rB,OAERyrB,OAAAA,EAAM1mC,KAAK,SA4CpB4D,OAAO8J,eAAwBi0B,GAAa99B,UAAW,kBAAmB,CACxEgK,IAMIA,WAEE,MAAqC,YAA9Bk5B,KAlCDlF,GAqCZ/lB,IAMIA,SAASvW,GAEPyhC,KAtDDnF,EAsDyBt8B,EAAQ,UAAY,iBE7fpD,IAAA0hC,GACSp+B,EAALzG,KAAAC,MvCNa6kC,SAAAC,GAASC,GAElB5pB,GAAA6pB,KAAK5oC,MAOXA,KAAKisB,QAAU,IAAImJ,IAMnBp1B,KAAK6oC,EAAkBF,GAAsB,KAQ7C3oC,KAAK8oC,GAAU,EAYVC,KAAAA,EANL/oC,KAAK8yB,EAAO,KAYPkW,KAAAA,EAAW,GAYhBhpC,KAAKipC,EoBpGKhkB,EpB0GVjlB,KAAKopB,EAAa,GA6Bb8f,KAAAA,EAPLlpC,KAAKmpC,EAPLnpC,KAAKopC,EANLppC,KAAKqpC,GAAmB,EA4BxBrpC,KAAKspC,EAAmB,EAMnBC,KAAAA,EAAa,KAObC,KAAAA,EAA6BC,GAuClCzpC,KAAK0pC,EA3BL1pC,KAAK2pC,GAAmB,EAoCrBx9B,EAAkBs8B,GAAmBjuB,IAUxCovB,IAAAA,GAASA,GAqCXC,GAAqC,YAUrCC,GAAwC,CAAC,OAAQ,OAudf,SAAAC,GAAAC,EAAoBC,GAEpD/iC,EAAK4hC,GAAU,EACNhW,EAAAA,IACP5rB,EAAKgiC,GAAW,EAChBhiC,EAAK4rB,EAAK9C,QACV9oB,EAAKgiC,GAAW,GAElBhiC,EAAKkiB,EAAa6gB,EACbhB,EAAAA,EoBpsBM3jB,EpBqsBX4kB,GAAAC,GACAC,GAAAC,GASyCC,SAAQJ,GAARI,GAEpCpjC,EAAKmiC,IACRniC,EAAKmiC,GAAmB,EACnB1oB,GAALA,EqBxvBQiF,YrByvBHjF,GAALA,EqBvvBKtX,mBrBs1BoDkhC,GAARC,GAEnD,GAAKtjC,EAAK4hC,QAKS,IAAR3+B,KAKPjD,EAAK6hC,EwBpyBY0B,IAiCX7kB,GxBowBDkQ,GAALA,IACoB,GAApB5uB,EAAKivB,MAaP,GAAIjvB,EAAKkiC,GwBlxBDxjB,GxBmxBCkQ,GAALA,GACSpW,GAASxY,EAAKwjC,GAAqB,EAAGxjC,QAI9CyZ,GAAAA,GAALA,EqBp3BkBoF,oBG4FVH,GxB26BEkQ,GAhJN6U,GAAmB,CAGrBzjC,EAAK4hC,GAAU,EAEf,IAoJJ,MAAMxS,EAjJIsU,EAiJUzU,KwCl8B2BjvB,EAE/C,OxCk8BqCovB,GwCj8BnC,KA9EEuU,IA+EF,KA9EOC,IA+EP,KA9EQC,IA+ER,KA7EUC,IA8EV,KA5EeC,IA6Ef,KArEYC,IAsEZ,KAvBmBC,KAwBjB,IAAAhkC,GAAO,EAAP,MAAAD,EAGA,QAAAC,GAAO,ExCu7BJ,IAAA5H,EAAA,KAAAA,EAAA4H,GAAA,CACH,IAAAwP,EAAA,GAAAA,EAAA,IAAA+B,EAAA,CkCtuBJ,IAAIkkB,ElCivB6C96B,OAX7CoF,EAWyD8hC,GkCnzBrD5lC,MAAqBi1B,IA5CrBuB,IAsF4C,KAyBpD,IAAKgD,GAAewO,EAAOvoC,MAAawoC,EAAOxoC,KAAKyoC,SAAU,CAC5D,IAAIC,EAAgBC,EAAO3oC,KAAKyoC,SAASC,SACzCjoC,EAASioC,EAAS1c,OAAO,EAAG0c,EAASjsC,OAAS,GlCmuB5CqX,GAYG80B,GAAoB/7B,KkC3uBpBktB,EAASA,EAAO9rB,cAAgB,IlC+tBnCvR,EAAAoX,EApJE,GAmJCpX,EAlJMohB,GAALA,EqBr4BEiF,YrBs4BGjF,GAALA,EqBr4BCkF,erBs4BI,CACL3e,EAAK+hC,EoB91BD1jB,EpB6iCR,IACF,IAAAmH,EwBjgCMgf,ExBigCM5V,GA9MF6V,GAAAA,EA+MD7Y,EAAKyQ,WACV,GACJ,MAAOjgC,GAEPopB,EAAO,GApNDxlB,EAAKkiB,EACDsD,EAAuB,KAAOxlB,EAAKivB,KAAc,IACrD+T,GAAAC,IAVJ,QAaOE,GAALA,KA0D+BuB,SAAQxB,GAARwB,EAASC,GAE9C,GAAI3kC,EAAK4rB,EAAM,CAERgZ,GAALA,GAIMlZ,MAAAA,EAAM1rB,EAAK4rB,EACXiZ,EACF7kC,EAAK6hC,EwBz5BQiD,GxB05BR38B,EACL,KACCyjB,EAAAA,EAAO,KACZ5rB,EAAK6hC,EAAc,KAEnB5hC,GACOwZ,GAALA,EqBr9BGmF,SrBw9BL,IAKE8M,EAAI4Q,mBAAqBuI,EACzB,MAAOzoC,MAgBmC2oC,SAAQC,GAARD,GAE1C/kC,EAAK4rB,GAAQ5rB,EAAKwiC,IACpBxiC,EAAK4rB,EAAL6P,UAA6C,MAEtC4G,EAAAA,Ie35B0BjoB,EA6LL7B,af+tBXvY,EAAKqiC,GACtBriC,EAAKqiC,EAAa,MAoDmB4C,SAAAC,GAAAD,GAEvC,OAAYrZ,EAAAA,EACoC5rB,EAAK4rB,EAAK5F,WwBn+B3Cmf,ExBopC8B,SAAAC,GAARC,GAErC,IACE,IAAKrlC,EAAK4rB,EACR,YAEE,GAAA,aAAmBA,EAAAA,EACrB,OAAYA,EAAAA,EAAKzC,SAEX,OAAAnpB,EAAKsiC,GACX,KAAkBC,GAClB,IAjhCE+C,OAkhCA,OAAOtlC,EAAK4rB,EAAKtQ,aAMnB,IAphCUiqB,cAqhCR,GAAI,2BAAJvlC,EAAqC4rB,EACnC,OAAYA,EAAAA,EAAK4Z,uBAQvB,OA1BE,KA2BF,MAAOppC,GAEP,OAFU,MyC9tC8BqpC,SAAAA,GAAS1gB,GACnD,IAAI0V,EAAS,GAONA,OANPiL,GAAmB3gB,GAAS,SAASnlB,EAAOD,GAC1C86B,GAAU96B,EACVM,GAAU,IACVw6B,GAAU76B,EACV66B,GAAU,UAELA,EA0BkCkL,SAAAA,GACvCnH,EAAKoH,EAAUC,GlC6MG7lC,EAAA,CACpB,IAAWL,KkC7MYkmC,ElC6MA,CACrB,IAAAp2B,GAAO,EAAP,MAAAzP,EAEFyP,GAAO,EkChNHA,IAGEq2B,EAAsBC,GAAkCF,GAC3C,iBAAf7lC,EP+vBsB,MO7vBiB8lC,GVgZpC7P,mBAAmBr7B,OUhZiBkrC,IAErCnZ,GAAJ6R,EAAsBoH,EAAUE,IdzBpCE,SAAgCA,GAACC,EAAWC,EAAcj+B,GACxD+9B,OAAK/9B,GAAYA,EAAQk+B,uBAGAl+B,EAAQk+B,sBAAsBF,IAF9CC,EAqB+BE,SAAAC,GACtCt1B,GAYFjY,KAAKsyB,GAAiB,EAOtBtyB,KAAKy0B,EAAgB,GAMrBz0B,KAAKgoB,EAAgB,IAAI9F,GA2EpBgQ,KAAAA,GAPLlyB,KAAKk0B,GANLl0B,KAAK8zB,EANL9zB,KAAKq0B,EAPLr0B,KAAK8tB,EANL9tB,KAAK4zB,GAPL5zB,KAAKwzB,EANLxzB,KAAKwtC,GANLxtC,KAAKytC,EANLztC,KAAK0tC,EANL1tC,KAAKwoB,EAAgB,KAmFhBmlB,KAAAA,GAPL3tC,KAAK4tC,EAAW,EAaXC,KAAAA,GAAYC,GAAwB,YAAY,EAAO71B,GAiCvDmZ,KAAAA,EANLpxB,KAAKsxB,EAPLtxB,KAAK2wB,EANL3wB,KAAK+tC,EARL/tC,KAAK0hB,EAAW,KAkChB1hB,KAAKguC,GAAsB,EAmBtB1kB,KAAAA,GANLtpB,KAAKixB,GANLjxB,KAAKkxB,GAAgB,EAiChB+c,KAAAA,EARLjuC,KAAKqxB,EAPLrxB,KAAKkuC,EAA4B,EAwB5BC,KAAAA,GACDL,GAAwB,mBAAoB,IAAU71B,GAOrDm2B,KAAAA,GACDN,GAAwB,mBAAoB,IAAW71B,GAO3DjY,KAAKquC,GACDP,GAAwB,2BAA4B,EAAG71B,GAOtDq2B,KAAAA,GAAkCR,GACnC,iCAAkC,IAAW71B,GAM5C4wB,KAAAA,GACA5wB,GAAeA,EAAYs2B,qBAAmBn9B,EAM9C2b,KAAAA,GACA9U,GAAeA,EAAYu2B,KAAoB,EAU/C9b,KAAAA,OAA+BthB,EAuB/Bya,KAAAA,EACA5T,GAAeA,EAAYw2B,yBAA2B,EAM3DzuC,KAAKiyB,EAAO,GAMZjyB,KAAKmwB,EAA6B,IKxE1B6P,GLyEJ/nB,GAAeA,EAAYy2B,6BAM1Bpe,GAAa,IAAIuR,QAOjB8M,EAAkB12B,GAAeA,EAAY22B,gBAAkB,EAO/DC,KAAAA,EACA52B,GAAeA,EAAY62B,2BAA6B,EAEpDH,KAAAA,GAAkB3uC,KAAK6uC,IAG9B7uC,KAAK6uC,GAA4B,GAQnC7uC,KAAK+uC,GACA92B,GAAeA,EAAY+2B,KAAsB,KAGnC/2B,EAAYkL,IAC7BnjB,KAAKgoB,EAAc7E,KAGrBjc,GAAmB+Q,EAAYg3B,mBAC7BjvC,KAAKguC,GAAsB,GAU7BhuC,KAAKguB,GACChuB,KAAK2uC,GAAkB3uC,KAAKguC,GAAuB/1B,GACpDA,EAAYi3B,uBACb,EAOCxd,KAAAA,QAAiCtgB,EAYjC4iB,KAAAA,EAAkB,EAOvBh0B,KAAKiuB,GAAmB,EAuBxBjuB,KAAKmvC,GAhBLnvC,KAAKovC,EAAsB,cAwPiBC,GAARC,GAMpC,GAFKC,GAALA,GA9MQnf,GAgNJlpB,EAAKwoB,EAAuC,CAC9C,IAAM8f,EAAMtoC,EAAK0mC,IACX9iB,EAA8BzU,GAAxBnP,EAAK4sB,GACjB4H,GAAA5Q,EAAsB,MAAO5jB,EAAK+qB,GAClCyJ,GAAA5Q,EAAsB,MAAO0kB,GACzB3b,GAAJ/I,EAAsB,OAAQ,aAE9B2kB,GAAAC,EAA0B5kB,IFgpBrBiD,EAAAA,IAAItG,GE7oBLE,EAAMoG,EAAK/F,EAA0BwnB,OADzBzhB,IF6UblF,EAnvBUiE,EAovBf3lB,EAAKyhB,EAAuBqC,GAAR5U,GAAJyU,IAEZ6kB,GAAc,EAEF3qC,EAAAA,WAAkB4qC,EAAO5qC,UAAU6qC,aAEjDF,EACSC,EAAO5qC,UAAU6qC,WAAW1oC,EAAKyhB,EAASvjB,WAAY,MAG5DsqC,GAAoBG,EAAOC,SAEvBr6B,IADYq6B,OACZr6B,IAAMvO,EAAKyhB,EAClB+mB,GAAc,GAGXA,IAEHxoC,EAAK+hB,EAAyB4C,GAAd3kB,EAAK4gB,EAAqB,MAC1C5gB,EAAK+hB,EAASgD,GAAK/kB,EAAKyhB,IAG1BzhB,EAAK2hB,EAAoB9e,KAAKD,MAC9BwhB,GAAAC,GEhWKwkB,GAALA,GAwEmDC,SAAQC,GAARD,GAE/C/oC,EAAK4mB,IACFI,GAALA,GACAhnB,EAAK4mB,EAAoBgK,SACzB5wB,EAAK4mB,EAAsB,MASYqiB,SAAAC,GAAAD,GAEpCrf,GAALA,GAEI5pB,EAAKypB,IACFrP,EAAO7B,aAAavY,EAAKypB,GAC9BzpB,EAAKypB,EAAsB,MAGxBE,GAALA,GAEA3pB,EAAKipB,EAA2B2H,SAEvBiW,EAAAA,IAYkC,iBAA3BA,EAAAA,GACTzsB,EAAO7B,aAZZ4wB,EAY8BtC,GAZ9BsC,EAeGtC,EAAyB,MAoYiBuC,SAAQC,GAARD,GAEXE,GAAhCtpC,EAAKipB,IAKLjpB,EAAK6mC,IAOT7mC,EAAK6mC,GAAyB,EACnBpwB,GAAIzW,EAAKupC,GAA6BvpC,GAEjDA,EAAKgnC,EAA4B,GAmO2B,SAAAwC,GAARC,EAClDC,GAEF,IAAIpB,EAEFA,EADEoB,EACIA,EF5KI3oB,EE8KJ/gB,EAAK0mC,IAGb,MAAM9iB,EAA8BzU,GAAxBnP,EAAK4sB,GACbD,GAAJ/I,EAAsB,MAAO5jB,EAAK+qB,GAC9B4B,GAAJ/I,EAAsB,MAAO0kB,GACzB3b,GAAJ/I,EAAsB,MAAO5jB,EAAKgqB,GAE7Bwe,GAALA,EAA0B5kB,GAEtB5jB,EAAKumC,GAA8BvmC,EAAKshB,GACjCqoB,GACL/lB,EAAK5jB,EAAKumC,EAA4BvmC,EAAKshB,GAG3CuF,EFxHC,IAAItG,GEyHPE,EAAMzgB,EAAK8gB,EAA0BwnB,EACrCtoC,EAAKgnC,EAA4B,GAErC,OAAIhnC,EAAKumC,IACP1f,EF3kCGvF,EE2kCqBthB,EAAKshB,GAI/BrhB,IACE2pC,EA0EGrc,EA1EsBmc,EFthCf3nB,EEimC0B1N,OA3EpCu1B,EA2EgDrc,IAzElDsc,EACSC,GAALA,EAA0BjjB,EA74BOkjB,KAi5BrCljB,EAAQrQ,WACJ9S,KAAKsmC,MAA6C,GAAvChqC,EAAKonC,IAChB1jC,KAAKsmC,MAA6C,GAAvChqC,EAAKonC,GAAyC1jC,KAAKC,WAClE02B,GAAAr6B,EAAKipB,EAAsCpC,GAC3CnD,GAAAmD,EAAoBjD,EAAKimB,GAUqBI,SAAQ1B,GAAR0B,EAASrmB,GAEnD5jB,EAAKsmC,IpBp2BTt3B,GoBq2BsBhP,EAAKsmC,IAAc,SAAS1mC,EAAOD,GAEjDgtB,GAAJ/I,EAAsBjkB,EAAKC,MAItB4a,EAAAA,GAGQoT,GAqnCVvI,IArnC0B,SAASzlB,EAAOD,GAEvCgtB,GAAJ/I,EAAsBjkB,EAAKC,MAeasqC,SAAQC,GAARD,EAASrjB,EAASujB,GAE1DC,EAAQ3mC,KAAK4mC,IAAItqC,EAAKutB,EAAcn1B,OAAQgyC,GAE5CG,IAAAA,EAAgBvqC,EAAKwa,EAClB9V,EAAK1E,EAAKwa,EAASgwB,GAAaxqC,EAAKwa,EAAUxa,GACpD,KGv9CkCA,EAAA,CHy9C7ButB,IAAAA,EAALA,EAAKA,EGv9CLkd,IAAAA,GAAU,EACd,OAAa,CACX,MAAM/zB,EAAK,CAAC,SHq9CU2zB,IGl9CP,GAAXI,EACU,EHi9CQJ,GGh9ClBI,EAASC,EAAa,GAAGC,EACzBj0B,EAAGtc,KAAK,OAASqwC,IAEjBA,EAAS,EAGX/zB,EAAGtc,KAAK,OAASqwC,GAEftK,IAAAA,GAAO,EACN,IAAA,IAAIhoC,EAAI,EAAGA,EHu8CMkyC,EGv8CKlyC,IAAK,CAC9B,IAAIwyC,EAAQD,EAAavyC,GAAGwyC,EACtBC,MAAAA,EAAMF,EAAavyC,GAAGyyC,EAE5B,GADA3a,GAASwa,EACG,EAARE,EAEFF,EAAS/mC,KAAKyH,IAAI,EAAGu/B,EAAavyC,GAAGwyC,EAAQ,KAC7CxK,GAAO,OAGT,IACO0K,GAAcD,EAAKl0B,EAAI,MAAQi0B,EAAQ,KAC5C,MAAOrhB,GH27CkBihB,GAAAA,EGz7CTK,IAIpB,GAAIzK,EAAM,CACR1wB,EAAOiH,EAAGrc,KAAK,KAAf,MAAA2F,IHw7CJ,OAF2BA,EAAAA,EAAKutB,EAAcvd,OAAO,EAAGq6B,GF9lCnDtoB,EAAAA,EAAmB+oB,EEolCgDr7B,EAiC5Bs7B,SAAQC,GAARD,GAExC/qC,EAAK4mB,GAKL5mB,EAAKypB,IAKTzpB,EAAK+mC,EAAwB,EAKlBtwB,GAAIzW,EAAKirC,GAA0BjrC,GAE9CA,EAAKmqB,EAAyB,GASkB+gB,SAAArhB,GAAAqhB,GAQhD,QANIlrC,EAAK4mB,GAAuB5mB,EAAKypB,GAnkCG0hB,GAykCpCnrC,EAAKmqB,KAMTnqB,EAAK+mC,IACAtd,EAAAA,EAAmCxB,GAC/BvjB,EAAK1E,EAAKirC,GAA0BjrC,GACpCorC,GAALA,EAAmBprC,EAAKmqB,IAC5BnqB,EAAKmqB,KACE,GAmFyC,SAAAkhB,GAAAC,GAEhB,MAA5BtrC,EAAKkoC,IAEF9tB,EAAO7B,aAAavY,EAAKkoC,GAC9BloC,EAAKkoC,EAAsB,MAScqD,SAAAC,GAAAD,GAQ3CvrC,EAAK4mB,EF7WE,IAAIrG,GE8WPE,EAAMzgB,EAAK8gB,EAA0BH,MAAO3gB,EAAK+mC,GAEb,OAApC/mC,EAAKumC,IACPvmC,EAAK4mB,EF/zCFtF,EE+zCsCthB,EAAKshB,GAGhDthB,EAAK4mB,EFhyCAtE,EExF8BA,EA03C7BsB,IAAAA,EAA2BzU,GAArBnP,EAAKgtB,IACbL,GAAJ/I,EAAsB,MAAO,OACzB+I,GAAJ/I,EAAsB,MAAO5jB,EAAK+qB,GAC9B4B,GAAJ/I,EAAsB,KAAM5jB,EAAKkqB,EAAmB,IAAM,KACtDyC,GAAJ/I,EAAsB,MAAO5jB,EAAKgqB,GAClCwK,GAAA5Q,EAAsB,OAAQ,WAEzB4kB,GAALA,EAA0B5kB,GAEjB2iB,EAAAA,GAA8BvmC,EAAKshB,GACjCqoB,GACL/lB,EAAK5jB,EAAKumC,EAA4BvmC,EAAKshB,GAG7CthB,EAAKwrB,GACPxrB,EAAK4mB,EAAoBpQ,WAAWxW,EAAKwrB,GAGtC5E,IAAAA,EAALA,EAAKA,EACkCoE,EAALA,EAAKA,GF3vCvC3yB,EAAKspB,EAvMKmC,EAwMLpC,EAAAA,EAAuBqC,GAAR5U,GE0vChByU,IFzvCJvrB,EAAKmpB,EAAY,KACZmB,EAAAA,GEwvCIqB,EFtvCJC,GAALA,EAAkBG,GEs+CkCqnB,SAAQC,GAARD,GAEhB,MAAhCzrC,EAAKoqB,IACFhQ,EAAO7B,aAAavY,EAAKoqB,GAC9BpqB,EAAKoqB,EAA0B,MAyBUuhB,SAAQC,GAARD,EAAS9kB,GAGpD,IACIikB,EAAkB,KAClB,GAAA9qC,EAAK4mB,GAAuBC,EAAS,CAClC8C,GAALA,GACA0hB,GAAArkB,GACKJ,EAAAA,EAAsB,KAC3B9lB,IAAAA,EAj7CY+qC,MAk7CP,CAAA,IAAoC7iB,GAAhChpB,EAAKipB,EAAsCpC,GAMpD,OALAikB,EAAkBjkB,EFrjDR9E,EEsjDsBqL,GAAhCptB,EAAKipB,EAAyCpC,GAC9C/lB,EAv7CegrC,EA5FTvjB,GAAAA,GAyhDJvoB,EAAKwoB,EAMT,GAFAxoB,EAAKoiB,GAAkByE,EFzwBXzE,EE2wBRyE,EFhyBQtF,EEiyBV,GAp8CeuqB,GAo8CXhrC,EAAqD,CAC1C0c,EAAAqJ,EF3uBLrF,EE2uB6BqF,EF3uB7BrF,EE2uBmDppB,OAASolB,EAE1Dvd,EAAA6C,KAAKD,MAAQgkB,EFvtBfjF,EEwtBColB,IAAAA,EAALA,EAAKA,ER1vDNvtB,GADDjS,EAAsBsV,KAExB,IAAiBe,GAAYrW,EAAQgW,IQ0vDrC6rB,GAAA7b,QAGAwd,GAAA1d,QAOJ,GFxtDoB6C,IEutDd4b,EAAYllB,EFpyBN3E,IAl8BJuO,GEuuD0Bsb,GAhDwB,EAgDb/rC,EAAKoiB,MAn9CjC0pB,GA29CXhrC,GA7zB6CkrC,SAAAA,EAASnlB,GAE5D,QAAoCyD,GAAhCtqB,EAAKipB,IACLjpB,EAAKipB,EK7mCG+C,GL8mCHhsB,EAAK6mC,EAAyB,EAAI,KAMvC7mC,EAAK6mC,GAGFtZ,EAAAA,EACD1G,EF5yBM9E,EE4yBuB1N,OAAOrU,EAAKutB,GACtC,GAtwBH0e,GA0wBFjsC,EAAKwoB,GAvwBAsC,GAwwBL9qB,EAAKwoB,GACJxoB,EAAKgnC,IAA6BkF,EAxJ3BvF,GAAY,EAwJeuF,EAxJN/E,MA8JjCnnC,EAAK6mC,EAAsC5e,GAClCvjB,EAAK1E,EAAKupC,GAA6BvpC,EAAM6mB,GAC7CukB,GAALA,EAAmBprC,EAAKgnC,IACvBA,EAAAA,IACE,KA+xBMmF,CAALA,EAA+BtlB,IA19CzBglB,GA89CR/qC,GACOsrC,GAALA,IAoBR,OALItB,GAA4C,EAAzBA,EAAgB1yC,SAChC6wB,EAALA,EAAKA,EK3zDPhpB,EAAK8hB,EAAmB9hB,EAAK8hB,EAAiB1N,OL2zDOy2B,IAI7CiB,GACN,KFrwDOrlB,EEswDA+D,GAALA,EAhhDK/D,GAkhDP,MAAA,KFzvDQN,EE0vDDqE,GAALA,EAvgDMrE,IAwgDN,MFhwDgB+J,KAAAA,EEkwDX1F,GAALA,EAnhDgB0F,GAohDhB,MAEK1F,QAAAA,GAALA,EA/hDY4hB,IA0iDuBC,SAAAC,GAAAD,EAASE,GAEhD,IAAIC,EAAYzsC,EAAKinC,GACjBvjC,KAAKixB,MAAMjxB,KAAKC,SAAW3D,EAAKknC,IAOpC,SAoac1sB,IAxaAiyB,GA5jD+BC,GAgkD7Cr0C,EADam0C,EA+LyBG,SAAAC,GAAAD,EAASpwC,GAG/C,GADAyD,EAAK8gB,EAAc9jB,KAAK,cAAgBT,GApvDxB8vC,GAqvDZ9vC,EAA8C,CAGhD,IAAIswC,EAAW,KACX7sC,EAAKwa,IACPqyB,EA4VG,MA1VgB,IAAAp9B,EAAK/K,EAAK1E,EAAK8sC,GAAsB9sC,GSrxE5D3H,IAEEurB,EAAM,IAASyN,GAAI,wCAER0b,EAAO3I,UAA6C,QAA5B4I,EAAO5I,SAASC,UAC7CrS,GAAJpO,EAAc,SAEZG,GAAJH,IAoDqBqpB,SAASzO,EAAc/8B,GAE9C,MAAMif,EAAe,IAAI1F,GAEhB4tB,GAAAA,EAAOC,MAAO,CACrB,MAAMzN,EAAM,IAAIyN,MACZvN,EAAAA,OAAcv2B,EACLmoC,GAAgBxsB,EAAc0a,EAAK,yBAC5C,EAAM35B,GACN85B,EAAAA,QAAex2B,EACNmoC,GAAgBxsB,EAAc0a,EAAK,wBAC5C,EAAO35B,GACX25B,EAAII,QAAez2B,EACNmoC,GAAgBxsB,EAAc0a,EAAK,wBAC5C,EAAO35B,GACPg6B,EAAAA,UAAiB12B,EACRmoC,GAAgBxsB,EAAc0a,EAAK,0BAC5C,EAAO35B,GAEN8U,EAAOC,YAAW,WAEjB4kB,EAAIK,WACNL,EAAIK,cAlGe0R,KAqGnB3+B,EAAAA,IAAMgwB,OAGV/8B,GAAS,GA7EX2rC,CAAuBxpB,EAAIzlB,WAAsCsD,QT6wElD4kB,GR5rEFgnB,GQ8rEbC,EA4CK9kB,EAz2DGD,EA6zDR+kB,EA6CS9yB,GA7CT8yB,EA8CO9yB,EAAS+yB,GA9CFhxC,GAgDdixC,GAhDAF,GAiDKjF,GAjDLiF,GA0DkC,SAAAE,GAAAC,GAIlC,GAFAztC,EAAKwoB,EAz3DGD,EA03DRvoB,EAAKioC,GAA8B,GAC/BjoC,EAAKwa,EAAU,CACjB,MAAMswB,EAC8B7N,GAAhCj9B,EAAKipB,GAEqB,GAA1B6hB,EAAgB1yC,QAA4C,GAA7B4H,EAAKutB,EAAcn1B,SpC//CzC0O,EoCugDO9G,EAAKioC,GAA6B6C,GpCvgDzChkC,EoCwgDO9G,EAAKioC,GAA6BjoC,EAAKutB,GAEzDvtB,EAAKipB,EKhnEJlH,EAAiB3pB,OAAS,EzCmkBnBuO,EoC+iDuC3G,EAAKutB,GACpDvtB,EAAKutB,EAAcn1B,OAAS,GAbvBoiB,EAAAA,EAASkzB,MAgFqBC,SAAAC,GAAAD,EACrCvpB,EAAY+R,GAEd,IAAIvS,EAAqBuS,aC3pDE9E,GAAUliB,GD2pDZgnB,GC1pDQ,IAAS9E,GD0pDjB8E,OC7pDI3E,GD8pDW,GAAA,IAAnB5N,ECjkET6N,EDmkENrN,IACFR,ECrjEC6N,EDqjEarN,EAAa,IAAMR,ECpkEzB6N,GDukENS,GAAJtO,EAAgCA,ECpiEtBgO,ODqiEL,CACL,IAAMic,EAAoBd,EAAO3I,SAUEC,EAAbwJ,EAAaxJ,SARnCyJ,EAAI1pB,EACSA,EAAa0pB,IAAMD,EAAaE,SAEhCF,EAAaE,SAGbrwC,GAAqBmwC,EAAanwC,KCppD7CkmB,IAAAA,EAAM,IAASyN,GAAI,UAFPG,GAKhBwc,GAAkBhc,GAAJpO,EAAcoqB,GAE5B/tC,IAAc2jB,EAnbT6N,EAmbuBwc,GAC5B7xC,GAAgB81B,GAAJtO,EAAYsqB,GDgpD6C/X,IC/oDzDvS,EAzWPuJ,EDw/DgEgJ,GC3oDrE1mB,EAAOmU,EDypDP,OAXMiV,EAAQxM,EApkDFC,EAqkDN1sB,EAAQuuC,EAnjDFzhB,GAojDZr0B,GAAauH,GACP+sB,GAAJ/I,EAAsBiV,EAAOj5B,GAI3B+sB,GAAJ/I,EAAsB,MAAO5jB,EAAKkrB,IAElCqd,GAAAC,EAA0B5kB,GAjCYnU,EA8CD2+B,SAAAA,GAAAA,EAAShqB,EAAYiqB,GAE1D,GAAIjqB,IAAepkB,EAAK2kB,EACtB,MAAMprB,MAAU,uDAUlB,OANEmyB,EADE2iB,GAAeruC,EAAK6lB,KAAsB7lB,EAAK2hC,GAC3C,IAAaJ,GACf,IAAa7F,GAAoB,CAACK,IAAoB,KAEpD,IAAawF,GAAMvhC,EAAK2hC,KAE5B2M,GAAmBtuC,EAAK2kB,GAZ2C1kB,EAmDhDsuC,SAAAC,MejhF0BC,SAAAC,KAEjD,GjBoXuBllC,MAA4CS,I5B+J5D0O,OAAsBjN,K6ClhB3B,YAAgB,gDAoCc,SAAAijC,GAASnQ,EAAKztB,GAEd8G,GAAA+2B,KAAK91C,MAKrCA,KAAK+nB,EAAW,IAAIulB,GAChBr1B,GAKJjY,KAAK6jC,EAAO6B,EAYZ1lC,KAAK+1C,EACA99B,GAAeA,EAAY+9B,kBAAqB,KAEjDC,EAAkBh+B,GAAeA,EAAYg+B,gBAAmB,KAGhEh+B,GAAeA,EAAYi+B,+BACzBD,EAEEA,EnBqtB8BE,qBAQYC,amB1tB9CH,EAAiB,CnBktBiBE,oBAQYC,emBptB7CruB,KAAAA,Ef6vBAS,Ee7vByBytB,EAE1BI,EAAep+B,GAAeA,EAAYq+B,oBAAuB,KAEjEr+B,GAAeA,EAAYs+B,qBACzBF,EAEEA,EnBsvBsCG,6BmBrvBtCv+B,EAAYs+B,mBAEhBF,EAAc,CnBmvB4BG,4BmBjvBtCv+B,EAAYs+B,qBAIpBpvC,GAAmB8Q,EAAYw+B,KACzBJ,EAEEA,EnBmvBwCK,+BmBlvBxCz+B,EAAYw+B,GAEhBJ,EAAc,CnBgvB8BK,8BmB9uBxCz+B,EAAYw+B,KAIpBz2C,KAAK+nB,EfwvBA2lB,EexvBwB2I,GAEvBM,EACF1+B,GAAeA,EAAY0+B,MXbsBnnC,EWehBmnC,KACnC32C,KAAK+nB,Ef8vBF0lB,Ee9vBwCkJ,GAM7C32C,KAAK42C,EACA3+B,GAAeA,EAAYw2B,yBAA2B,EAK3DzuC,KAAK62C,EAAgB5+B,GAAeA,EAAY6+B,cAAgB,GAI1DC,EAAqB9+B,GAAeA,EAAY8+B,sBXhCDvnC,EWkChBunC,KACnC/2C,KAAK+nB,EfovBFyL,EepvBiCujB,EnCoDvB,QmCnDoBhB,EAALA,KAAKA,IAAmBgB,KAApD7vC,IAC6C6vC,KAAnBhB,EAALA,KAAKA,WnC2InB3oC,EmC3IsC2pC,KAa1CC,KAAAA,EAAkB,IAAoCC,GAASj3C,MAiIvBk3C,SAAQC,GAACv0B,GAETw0B,GAAAC,KAAKr3C,MAG5Cs3C,IAAAA,EAAW10B,EAAA20B,OACjB,GAAID,EAAU,CnChMQpwC,EAAA,CACtB,IAAK,MAAML,KmCgMgCywC,EnChMpB,CACrBpwC,EAAOL,EAAP,MAAAK,EAFoBA,OAAA,GmCiMpBlH,KAAKw3C,EAActwC,KAELA,EAAAlH,KAAAX,EnCmBhB8H,EAAY,OmCnBIiG,GnCmBIvG,KAApBM,EmCnBgBiG,EnCoBHvG,QAFQ2D,GmClBZhE,KAAAA,KADPW,OAMAnH,KAAKwG,KAAOoc,EAiB6B,SAAA60B,KAEAC,GAAAC,KAAK33C,MAKhDA,KAAKs2B,OnB2JUshB,WmBtIkCC,GAAClwB,GAQlD3nB,KAAK+nB,EAAWJ,K1CyFlB+gB,GAAAtjC,WAAAowC,GAA8CsC,SAASC,GAErD/3C,KAAK2pC,EAAmBoO,KAyD1BC,GAAgCC,SAC5BvS,EAAKwS,EAAYC,EAAaC,GAEhC,GAAIp4C,KAAK8yB,EACP,MAAMryB,MACF,0DACAT,KAAKgpC,EAAW,YAActD,GAG9Bx7B,EAASguC,EAAaA,EAAWG,cAAgB,MAEvDr4C,KAAKgpC,EAAWtD,EAChB1lC,KAAKopB,EAAa,GAClBppB,KAAKipC,EoB9gBKhkB,EpBghBVjlB,KAAKqpC,GAAmB,EACnBP,KAAAA,GAAU,EAGf9oC,KAAK8yB,EAAOwlB,KAuKAzP,EAvKAyP,KAuKuBzP,EAAgBze,IwBtrB3BmuB,GAASnuB,IxBghBjCpqB,KAAK+oC,EAAc/oC,KAAK6oC,EAAuC2P,GAArBx4C,KAAK6oC,GwB7ed2P,GAATC,IxBifnB3lB,KAAAA,EAAK0Q,mBAA0B53B,EAAK5L,KAAK0qC,GAAqB1qC,MAiB/D,IAEFA,KAAKmpC,GAAU,EACfnpC,KAAK8yB,EAAK0S,KAAKt7B,EAAQpI,OAAO4jC,IAAM,GACpC1lC,KAAKmpC,GAAU,EACf,MAAOc,GAIP,YADKyO,GAALA,KAA0CzO,GAY5C,GALM0O,EAAUR,GAAe,GAEzBlsB,EAAU,IAAImJ,IAAIp1B,KAAKisB,SAGzBmsB,EACF,GAAIjzC,OAAOyzC,eAAeR,KAAiBjzC,OAAOC,UAChD,IAAK,IAAIyB,KAAOuxC,EACdnsB,EAAQ5O,IAAIxW,EAAKuxC,EAAYvxC,QAE1B,CAAA,GACyB,mBAA5B8P,EAAmBtP,MACQ,mBAApB+wC,EAAYhpC,IAKrB,MAAM3O,MACF,uCAAyCqB,OAAOs2C,IALpD,IAAK,MAAMvxC,KAAmBQ,EAAAA,OAC5B4kB,EAAQ5O,IAAIxW,EAAKuxC,EAAYhpC,IAAIvI,IAWjCgyC,EACFt4C,MAAM80B,KAAKpJ,EAAQ5kB,QACdyxC,MACGlR,GNxhBL,gBMyhB6CA,ENzhBlB92B,gBM2hB5BioC,EACI3uC,EAAL4uC,UAA4BL,aAAmBrjB,EAAA0jB,WT9BxB,GAArBjtC,ES+BgC+9B,GAAwB5/B,KAC1D2uC,GAAmBE,GAKtB9sB,EAAQ5O,IAnXyB47B,eAgCjCC,mDAwVF,IAAK,MAAOryC,EAAKC,KAAjBvH,EACES,KAAK8yB,EAAK4U,iBAAiB7gC,EAAKC,GAG9B9G,KAAKwpC,IACPxpC,KAAK8yB,EAAKwQ,aAAetjC,KAAKwpC,GAKhC,oBAA8B1W,KAAAA,GAC1B9yB,KAAK8yB,EAAKilB,kBAAoB/3C,KAAK2pC,IACrC3pC,KAAK8yB,EAAKilB,gBAAkB/3C,KAAK2pC,OAe5BmC,GAALA,MAC4B,EAAxB9rC,KAAKspC,KACPtpC,KAAK0pC,EA0C4ByP,SAASvmB,GAE9C,OAAAwmB,IAA2CC,MACM,mBAAtC5mB,cACkCrhB,IAAzCwhB,EAAA+P,UA9CsCwW,CAAsBn5C,KAAK8yB,KAO/D9yB,KAAK8yB,EAALL,QAA0CzyB,KAAKspC,EAC/CtpC,KAAK8yB,EAAL6P,UACS/2B,EAAK5L,KAAKooB,GAAUpoB,OAE7BA,KAAKupC,EACU7pB,GAAS1f,KAAKooB,GAAUpoB,KAAKspC,EAAkBtpC,OAIlEA,KAAKopC,GAAU,EACfppC,KAAK8yB,EAAK5G,KAAKysB,GACf34C,KAAKopC,GAAU,EAEf,MAAOa,GAEFyO,GAALA,KAA0CzO,KA8CrBqP,EAAzBC,GAAoCC,gBAEf,IAAnBrvC,GAGWnK,KAAK8yB,IACd9yB,KAAKopB,EACD,mBAAqBppB,KAAKspC,EAAmB,eACjDtpC,KAAKipC,EoB9pBExjB,EpBgqBF9E,GAALA,KqB9sBO8E,WrB+sBPzlB,KAAKgwB,MoBjqBEvK,KpB+sBc6zB,EAAzBtpB,MAAiCypB,SAASC,GAEpC15C,KAAK8yB,GAAQ9yB,KAAK8oC,IAEpB9oC,KAAK8oC,GAAU,EACf9oC,KAAKkpC,GAAW,EAChBlpC,KAAK8yB,EAAK9C,QACVhwB,KAAKkpC,GAAW,EAChBlpC,KAAKipC,EAAiByQ,GoB5tBjBl0B,EpB6tBA7E,GAALA,KqB5wBQiF,YrB6wBHjF,GAALA,KqB1wBK6E,SrB2wBA6kB,GAALA,QAUJh9B,EAAAA,EAA2CssC,WAErC35C,KAAK8yB,IAMH9yB,KAAK8oC,IACP9oC,KAAK8oC,GAAU,EACf9oC,KAAKkpC,GAAW,EAChBlpC,KAAK8yB,EAAK9C,QACVhwB,KAAKkpC,GAAW,GAEbmB,GAALA,MAAiB,IAGb59B,GAAAA,EAAAA,EAAAmtC,KAAK55C,OAWb0qC,EAAAA,GAA+CmP,WAEzCC,KVprBQ/sC,IUwrBP/M,KAAKmpC,GAAYnpC,KAAKopC,GAAYppC,KAAKkpC,EAKrC6Q,GAALA,MAFA/5C,KAAKg6C,OAeTA,EAAAA,GAAyDC,WAElDF,GAALA,OA4OuBT,EAAzBnjB,GAAqC+jB,WAOnC,IACE,OAAO,EAAKpkB,GAALA,MACH91B,KAAK8yB,EAAKwD,QACT,EACL,MAAOhzB,GACP,OAAQ,IA2CZ8yB,EAAAA,GAA2C+jB,WAEzC,IACE,OAAYrnB,KAAAA,EAAO9yB,KAAK8yB,EAAKtQ,aAAe,GAC5C,MAAOlf,GAOP,MAAO,KA8Dcg2C,EAAzBc,GAA2CC,SAASC,GAElD,GAAKt6C,KAAK8yB,EAAV,CAIA,IAAItQ,EAAexiB,KAAK8yB,EAAKtQ,aAK7B,OAJAtb,GAA8D,GAAxCsb,EAAazW,QAAQuuC,KACzC93B,EAAeA,EAAa1d,UAAUw1C,EAAeh7C,SAGhDi7C,GAAuB/3B,KAiLP82B,EAAzBpjB,GAA4CskB,WAE1C,OAAYvR,KAAAA,GAQdwR,EAAAA,GAAwCC,WAEtC,MAAkC,iBAApB16C,KAAKopB,EAA0BppB,KAAKopB,EACLtnB,OAAO9B,KAAKopB,K2Bt5B3D7hB,EAAAgmC,GAAAnoC,WAAAgtB,GgB9duDuoB,EhBwf9BC,EAAzBC,EAdQ1H,EAgyBiByH,EAAzBnK,GAAuDqK,SACnDlK,GAGF,GAAI5wC,KAAK+tC,EAiBF,GAhBL/tC,KAAK+tC,EAAyB,KAryB1BoF,GAsyBJ4H,KAecrrB,GACd,IAhB0BkhB,EAgB1B,CAhBAmK,KAyDGnN,EAAWhjC,KAAKixB,MAAsB,IAAhBjxB,KAAKC,UAE1B2kC,EA3DJuL,KA2DenN,IACX7f,MAAAA,EFWC,IAAItG,GEvETszB,KAAAA,KA6DiD/yB,EAAmBwnB,OAAlE1nB,GAGJ,IAAIilB,EAhEFgO,KAgEsBvyB,EAhEtBuyB,GAiEOrN,KAAAA,IACHX,GACFA,EpBptBJ12B,GoBotBqC02B,GpB3sBrC/+B,GoB4sBuB++B,EApErBgO,KAoEwCrN,IAEtCX,EAtEFgO,KAsEsBrN,GAIxB,OA1EEqN,KA0EOtN,GA1EPsN,KA2EQlM,IACR9gB,EFn9BGvF,EEm9BqBukB,EACxBA,EAAe,MA7EfgO,KAkFOpM,EAwD8DznC,EAAA,CAGlE,IADD8zC,IAAAA,EAAQ,EACH37C,EAAI,EAAGA,EA7Id07C,KA6IuBtmB,EAAcn1B,OAAQD,IAAK,CACtCyyC,IAAAA,EA9IZiJ,KA8IiBtmB,EAAcp1B,GAE/B,QAAa+R,KgB92CTuF,EA3CqCskC,aAwCcnJ,EAAAA,GAEjC,iBADdtrC,EAAOmQ,EAAKm7B,EAALoJ,UAEJ10C,EAAKlH,YALD,GhBo3Cb,MAz0B8B67C,GAAAA,MA20BhCH,GAASt2B,GAEsC,CAC7Cvd,EAAO9H,EAAP,MAAA6H,EAGF,GAj1BgCi0C,OAi1B5BH,GACA37C,IA1JJ07C,KA0JetmB,EAAcn1B,OAAS,EAAG,CACvC6H,EAAO9H,EAAI,EAAX,MAAA6H,GAIJC,EAh2BqC8pC,SAAAA,EAAAA,IAixBjCF,EAAmBC,GAhFrB+J,KAiFEhtB,EACA5mB,GAIA0sB,KADgCxd,GArFlC0kC,KAqFejnB,GACK,MAAO0b,GAG3B9T,GAAA5Q,EAAsB,OiBt1CoBswB,IjBy3BhC5nB,KAAAA,GAkeNK,GAAJ/I,EJ3iBoC4I,oBI6cpCqnB,KApYUvnB,GAsePkc,GAlGHqL,KAkGwBjwB,GAEtBiiB,IApGFgO,KAqGSlM,EAGPkC,EAAc,WI76BX5T,mBAAmBr7B,OUradmrC,Gdi1C8CF,KACV,IAAMgE,EAxGpDgK,KAyGgBtN,GACLoD,GACL/lB,EA3GNiwB,KA2GgBtN,EAA4BV,IAI9CxL,GA/GEwZ,KA+GG5qB,EAAsCpC,GAElCghB,KAAAA,IACHlb,GAAJ/I,EAAsB,OAAQ,QAlH9BiwB,KAsHOpM,GACH9a,GAAJ/I,EAAsB,OAAQimB,GAG1Bld,GAAJ/I,EAAsB,MAAO,QAC7BiD,EFrnBGnE,GAAyB,EEunBpByxB,GAARttB,EAAoBjD,EAAK,OAEjBuwB,GAARttB,EAAoBjD,EAAKimB,GA1GpBrhB,KAAAA,EAxzBEsC,QAGD5B,GAgyBN2qB,KAsBcrrB,IAtBYkhB,EAwBnB0K,GAxBPP,KAA0BnK,GA4BO,GA5BjCmK,KA4BStmB,EAAcn1B,QAQakxC,GApCpCuK,KAoCS5qB,IAQJmrB,GA5CLP,QAmVqBH,EAAzBzI,GAAoDoJ,WAKlD,GAHAv7C,KAAK2wB,EAAsB,KAC3B+hB,GAAA8I,MAEKx7C,KAAKguB,KAINhuB,KAAKiuB,GAIuB,MAA5BjuB,KAAK8tB,GAAuD,GAAxB9tB,KAAKg0B,GAA7C,CAQA,IAAMynB,EAAqB,EAAIz7C,KAAKg0B,EAC/BhM,KAAAA,EAAc9jB,KAAK,+BAAiCu3C,GAEzDz7C,KAAKovC,EAAmCjgB,GAC/BvjB,EAAK5L,KAAK07C,GAAqB17C,MAAOy7C,KAQjDC,EAAAA,GAA+CC,WAExC37C,KAAKovC,IAKVpvC,KAAKovC,EAAsB,KAC3BpvC,KAAKgoB,EAAc9jB,KAAK,iCAiBxBlE,KAAKgoB,EAAc9jB,KACf,wDACJlE,KAAKoxB,GAAmB,EAExBpxB,KAAKiuB,GAAmB,EACXV,GR9hDNquB,IQiiDF9qB,GAALA,MACK0qB,GAALA,QA0RuBZ,EAAzBrpB,GAA8CsqB,WAER,MAAhC77C,KAAKsxB,IACPtxB,KAAKsxB,EAA0B,KAC1BR,GAALA,MACKwiB,GAALA,MACa/lB,GR9xDGuuB,MQqoEKlB,EAAzB5G,GAAgD+H,SAASC,GAEnDA,GACFh8C,KAAKgoB,EAAc9jB,KAAK,kCACXqpB,GR3sEFgnB,KQ6sEXv0C,KAAKgoB,EAAc9jB,KAAK,6BACXqpB,GRptEA0uB,MQw9EjB10C,EAAAmuC,GAAAtwC,WAAA2uB,GAAiDmoB,aAShBC,EAAjCtnB,GAAsDunB,aAoBtD3H,EAAAA,GAAgD4H,aAchDzH,EAAAA,GAAiD0H,aAsDjD5K,EAAAA,GAA+C6K,ae9nF/C5G,GAAwBvwC,UAAUo3C,EAAmBC,SACjD/W,EAAKztB,GAEP,OAAmCykC,IAAAA,GAAQhX,EAAKztB,IAkI7C9L,EAAiCuwC,GAAqBliC,IAMnCkiC,GAAQt3C,UAAUogC,EAAOmX,WAE/C38C,KAAK+nB,Ef2yBArG,Ee3yBoB1hB,KAAKg3C,EACrBJ,KAAAA,IACP52C,KAAK+nB,EfoxBF8D,GepxBsC+wB,GAEtC70B,IAAAA,EAALA,KAAKA,EAAsB8b,EAALA,KAAKA,EAAOtkC,EAAAS,KAAK+1C,QAAqB3kC,Ef2f5DkmB,GR1kBiBulB,GQ4kBjB31C,EAAKmtB,EAAQyoB,EACRtP,EAAAA,GAAeuP,GAAmB,GAQlC3rB,EAAAA,EAAmBlqB,EAAK8mC,EAC7BgP,EAkDKlpB,EAorDYK,GAtuDjB6oB,EAsuD+B,KAtuD/BA,EAmD0D3oB,GAC1Dkc,GApDAyM,IehgB8B53C,GAAAA,UAAU63C,MAAQC,WAElCtoB,GAAd50B,KAAK+nB,IAqByB3iB,GAAAA,UAAU8mB,EAAOixB,SAASt3C,GAEnDkiB,IAAAA,EAAL/nB,KAAK+nB,EAiBkB,GAAA,iBAAvB7gB,EAAiC,CAC/B,IAAMk2C,EAAU,GAChB79C,EAAA27C,SAnB6Cr1C,EAoB7CqB,EAAOk2C,OApBaC,KAuBbxG,KACDuG,EAAU,IAChBlC,SAAuCj/B,GAzBMpW,GA0B7CqB,EAAOk2C,GA1BJr1B,Efi2BA0M,EAAcnzB,KACf,IgBhiCoC,MAMxCqE,YAAYksC,EAAOC,GAMjB9xC,KAAK6xC,EAAQA,EAMb7xC,KAAK8xC,EAAMA,ID4KR/pB,Efk2BuB4lB,Kel2BNmE,IfoSd1hB,GepSHrI,Efq2BI2H,GACFgF,Get2BF3M,IA+DiB20B,GAAQt3C,UAAUiI,EAAkBiwC,WAE1Dt9C,KAAK+nB,EfssBArG,EetsBoB5L,YAClB9V,KAAKg3C,EACZ3H,GAAArvC,KAAK+nB,UACE/nB,KAAK+nB,EAEoBw1B,GAAA9wC,EAAAA,EAAA+wC,KAAKx9C,OA8BlCmM,EAC+BsxC,GACZx2B,IA0BnB9a,EAC+BuxC,GAAgCt2B,IAuB/Djb,EAAyC8qC,GAAyB0G,IAMvC1G,GAAS7xC,UAAU2uB,GAAgB6pB,WAKnDj9B,GAAd3gB,KAAK+nB,EnBFCjB,MmBSwBmwB,GAAS7xC,UAAUyvB,GAC/CgpB,SAAkBj7B,GAGNjC,GAAd3gB,KAAK+nB,EACD,IAAoC01B,GAAa76B,KAOvBq0B,GAAS7xC,UAAUqvC,GAAeqJ,SACrDr6C,GAMGkd,GAAd3gB,KAAK+nB,EACD,IAAoC21B,KAOVzG,GAAS7xC,UAAUwvC,GAAgBmJ,WAKnDp9B,GAAd3gB,KAAK+nB,EnBtCEhB,MsBhXgB4uB,GAAwBvwC,UAAjDo3C,iBAC2B7G,GAAwBvwC,UAAUo3C,EACJp3C,GAAAA,UAAzD8mB,KACmDwwB,GAAQt3C,UAAU8mB,EACpBwwB,GAAQt3C,UAAzDogC,KACmDkX,GAAQt3C,UAAUogC,EACZpgC,GAAAA,UAAzD63C,MACmDP,GAAQt3C,UAAU63C,MAI5Dj4B,GAATC,SzBtBYA,EyBuBHD,GAATS,QzByBWA,EyBxBXu4B,GAAAz4B,WzBccA,EyBVd04B,GAAAr4B,SxBhCYA,WwBqCZe,GAAAu3B,UAAuDr3B,GACvDs3B,GAAAr3B,KtBsVQA,OsBrVRC,MtBwVSA,IsBvVTo3B,GAAA90C,MtBgWSA,IsB/VT80C,GAAAn3B,QtBkWWA,IsBhWa5hB,GAAAA,UAAxBiT,OACcmC,GAAYpV,UAAUiT,EAG3BowB,GAAMrjC,UAAfiU,WAAkDovB,GAAMrjC,UAAUiU,EACnDjU,GAAAA,UAAfg5C,aACW3V,GAAMrjC,UAAUg5C,GAClB3V,GAAMrjC,UAAf8wB,iBACWuS,GAAMrjC,UAAU8wB,GAClBuS,GAAMrjC,UAAf+wB,UAAiDsS,GAAMrjC,UAAU+wB,GAClD/wB,GAAAA,UAAfg1C,gBACW3R,GAAMrjC,UAAUg1C,GACZh1C,GAAAA,UAAfgxB,gBACWqS,GAAMrjC,UAAUgxB,GACZhxB,GAAAA,UAAf8mB,KAA4Cuc,GAAMrjC,UAAU8mB,GAC7C9mB,GAAAA,UAAfowC,mBACW/M,GAAMrjC,UAAUowC,GAE3B,IAIA6I,GAA0Cr5B,GAC1Cs5B,GAA0C34B,GAC1C44B,GAAmEj7B,GACnEg7B,G1B+ES1C,G0B/ET0C,G1BqFWnwB,G0BpFXqwB,GAAoD5b,GACpD6b,GAA2C/3B,GAC3Cg4B,GAAsCjW,GChFtC,MAAMthC,GAAI,sBAsBV,MAAM0oB,GACFlqB,YAAYyG,GACRpM,KAAK2+C,IAAMvyC,EAEfwyC,kBACI,OAAO,MAAQ5+C,KAAK2+C,IAKjBE,QACH,OAAO7+C,KAAK4+C,kBAAoB,OAAS5+C,KAAK2+C,IAAM,iBAExDG,QAAQ1yC,GACJ,OAAOA,EAAEuyC,MAAQ3+C,KAAK2+C,KAIC9uB,GAAEkvB,gBAAkB,IAAIlvB,GAAE,MAGzDA,GAAEmvB,mBAAqB,IAAInvB,GAAE,0BAA2BA,GAAEovB,YAAc,IAAIpvB,GAAE,mBAC9EA,GAAEqvB,UAAY,IAAIrvB,GAAE,aAkBpB,IAAI/iB,GAAI,SAkBR,MAAMkyB,GAAI,I1DmCG,MAOXr5B,YAAmBK,GAAAhG,KAAIgG,KAAJA,EAUXhG,KAASm/C,UAAG31C,EAsBZxJ,KAAWo/C,YAAe11C,EAc1B1J,KAAeq/C,gBAAsB,KAlCzCv1C,eACF,OAAO9J,KAAKm/C,UAGVr1C,aAASU,GACX,KAAMA,KAAO5B,GACX,MAAM,IAAI02C,UAAU,kBAAkB90C,+BAExCxK,KAAKm/C,UAAY30C,EAInB+0C,YAAY/0C,GACVxK,KAAKm/C,UAA2B,iBAAR30C,EAAmB3B,EAAkB2B,GAAOA,EAQlEg1C,iBACF,OAAOx/C,KAAKo/C,YAEVI,eAAWh1C,GACb,GAAmB,mBAARA,EACT,MAAM,IAAI80C,UAAU,qDAEtBt/C,KAAKo/C,YAAc50C,EAOjBi1C,qBACF,OAAOz/C,KAAKq/C,gBAEVI,mBAAej1C,GACjBxK,KAAKq/C,gBAAkB70C,EAOzB1B,SAASe,GACP7J,KAAKq/C,iBAAmBr/C,KAAKq/C,gBAAgBr/C,KAAM4I,EAASG,SAAUc,GACtE7J,KAAKo/C,YAAYp/C,KAAM4I,EAASG,SAAUc,GAE5C61C,OAAO71C,GACL7J,KAAKq/C,iBACHr/C,KAAKq/C,gBAAgBr/C,KAAM4I,EAASK,WAAYY,GAClD7J,KAAKo/C,YAAYp/C,KAAM4I,EAASK,WAAYY,GAE9C3F,QAAQ2F,GACN7J,KAAKq/C,iBAAmBr/C,KAAKq/C,gBAAgBr/C,KAAM4I,EAASM,QAASW,GACrE7J,KAAKo/C,YAAYp/C,KAAM4I,EAASM,QAASW,GAE3CV,QAAQU,GACN7J,KAAKq/C,iBAAmBr/C,KAAKq/C,gBAAgBr/C,KAAM4I,EAASQ,QAASS,GACrE7J,KAAKo/C,YAAYp/C,KAAM4I,EAASQ,QAASS,GAE3CpG,SAASoG,GACP7J,KAAKq/C,iBAAmBr/C,KAAKq/C,gBAAgBr/C,KAAM4I,EAASS,SAAUQ,GACtE7J,KAAKo/C,YAAYp/C,KAAM4I,EAASS,SAAUQ,K0DvH9B,uBAGhB,SAAS6xB,KACL,OAAOsD,GAAEl1B,SAeT,SAAS0X,GAAEpV,GACX4yB,GAAEugB,YAAYnzC,GAGlB,SAASyO,GAAEzO,KAAM9I,GACb,GAAI07B,GAAEl1B,UAAY7H,EAAE8G,MAAO,CACvB,MAAM2P,EAAIpV,EAAEwuC,IAAIvqC,IAChBy3B,GAAEl2B,MAAM,cAAcgE,QAAOV,OAAQsM,IAI7C,SAASrI,GAAEjE,KAAM9I,GACb,GAAI07B,GAAEl1B,UAAY7H,EAAEoH,MAAO,CACvB,MAAMqP,EAAIpV,EAAEwuC,IAAIvqC,IAChBy3B,GAAEv7B,MAAM,cAAcqJ,QAAOV,OAAQsM,IAMzC,SAAS6S,GAAEnf,KAAM9I,GACjB,GAAI07B,GAAEl1B,UAAY7H,EAAEmH,KAAM,CACtB,MAAMsP,EAAIpV,EAAEwuC,IAAIvqC,IAChBy3B,GAAE71B,KAAK,cAAc2D,QAAOV,OAAQsM,IAMxC,SAASnR,GAAE6E,GACX,GAAI,iBAAmBA,EAAG,OAAOA,EACjC,IACI,OAAO9I,EAAI8I,EAAGzI,KAAKuY,UAAU5Y,GAC/B,MAAOA,GAEL,OAAO8I,EAmBX,IAAI9I,EA0BJ,SAAS8oC,GAAEhgC,EAAI,oBAGf,MAAM9I,EAAI,cAAcwJ,kCAAmCV,EAI3D,MAAMiE,GAAE/M,GAAI,IAAI7C,MAAM6C,GAQtB,SAASi3B,GAAEnuB,EAAG9I,GACd8I,GAAKggC,KAYL,SAASuT,GAAEvzC,EAAG9I,GACd8I,GAAKggC,KAML,SAASwT,GAAExzC,EAEf9I,GACI,OAAO8I,EAkBP,MAAMqO,GAAI,CAIVowB,GAAI,KAEJgV,UAAW,YAEXC,QAAS,UAOTC,iBAAkB,mBAQlBC,kBAAmB,oBAEnBC,UAAW,YAKXC,eAAgB,iBAQhBC,kBAAmB,oBAKnBpB,gBAAiB,kBAKjBqB,mBAAoB,qBAqBpBC,oBAAqB,sBAQrBC,QAAS,UAgBTC,aAAc,eAEdC,cAAe,gBAKfC,SAAU,WAQVC,YAAa,cAEbC,UAAW,aAGoC,MAAMj5B,WAAUnoB,EAE/DoG,YAIAyG,EAIA9I,GACIyC,MAAMqG,EAAG9I,GAAItD,KAAK4F,KAAOwG,EAAGpM,KAAK6F,QAAUvC,EAI3CtD,KAAKqF,SAAW,IAAM,GAAGrF,KAAKgG,eAAehG,KAAK4F,UAAU5F,KAAK6F,WAmBrE,MAAM+6C,GACNj7C,cACI3F,KAAK+d,QAAU,IAAIE,SAAO,CAAG7R,EAAG9I,KAC5BtD,KAAKke,QAAU9R,EAAGpM,KAAK6gD,OAASv9C,MAoBxC,MAAM46B,GACNv4B,YAAYyG,EAAG9I,GACXtD,KAAK8gD,KAAOx9C,EAAGtD,KAAKgI,KAAO,QAAShI,KAAKisB,QAAU,IAAImJ,IAAKp1B,KAAKisB,QAAQ5O,IAAI,gBAAiB,UAAUjR,MAO5G,MAAM+xC,GACN4C,WACI,OAAO9iC,QAAQC,QAAQ,MAE3B8iC,mBACAjgC,MAAM3U,EAAG9I,GAEL8I,EAAE60C,kBAAgB,IAAQ39C,EAAEusB,GAAEkvB,mBAElCmC,aAMA,MAAMC,GACNx7C,YAAYyG,GACRpM,KAAKohD,MAAQh1C,EAMbpM,KAAKqhD,eAAiB,KAE1BN,WACI,OAAO9iC,QAAQC,QAAQle,KAAKohD,OAEhCJ,mBACAjgC,MAAM3U,EAAG9I,GACLtD,KAAKqhD,eAAiB/9C,EAEtB8I,EAAE60C,kBAAgB,IAAQ39C,EAAEtD,KAAKohD,MAAMN,QAE3CI,WACIlhD,KAAKqhD,eAAiB,MAI9B,MAAM9xB,GACF5pB,YAAYyG,GACRpM,KAAKoM,EAAIA,EAETpM,KAAKshD,YAAczxB,GAAEkvB,gBAKrB/+C,KAAKX,EAAI,EAAGW,KAAKuhD,cAAe,EAAIvhD,KAAKwhD,KAAO,KAEpDzgC,MAAM3U,EAAG9I,GACL,IAAIoV,EAAI1Y,KAAKX,EAEL,MAAMoL,EAAI2B,GAAKpM,KAAKX,IAAMqZ,GAAKA,EAAI1Y,KAAKX,EAAGiE,EAAE8I,IAAM6R,QAAQC,UAG3D,IAAI7e,EAAI,IAAIuhD,GACpB5gD,KAAKyhD,EAAI,KACLzhD,KAAKX,IAAKW,KAAKshD,YAActhD,KAAKiC,IAAK5C,EAAE6e,UAAW7e,EAAI,IAAIuhD,GAAGx0C,EAAE60C,kBAAgB,IAAQx2C,EAAEzK,KAAKshD,gBAEpG,MAAMI,EAAI,KACN,MAAMp+C,EAAIjE,EACV+M,EAAE60C,kBAAgB,gBACR39C,EAAEya,cAAetT,EAAEzK,KAAKshD,iBAEnCG,EAAIr1C,IACHyO,GAAE,kCAAmC,iBAAkB7a,KAAKwhD,KAAOp1C,EAAGpM,KAAKwhD,KAAKG,qBAAqB3hD,KAAKyhD,GAC1GC,KAEJ1hD,KAAKoM,EAAEw1C,QAAQx1C,GAAKq1C,EAAEr1C,KAItBsR,iBACI,IAAK1d,KAAKwhD,KAAM,CACZ,MAAMp1C,EAAIpM,KAAKoM,EAAEy1C,aAAa,CAC1BC,UAAU,IAEd11C,EAAIq1C,EAAEr1C,IAENyO,GAAE,kCAAmC,yBAA0Bxb,EAAE6e,UAAW7e,EAAI,IAAIuhD,OAExF,GAAIc,IAEZX,WAII,MAAM30C,EAAIpM,KAAKX,EAAGiE,EAAItD,KAAKuhD,aAC3B,OAAOvhD,KAAKuhD,cAAe,EAAIvhD,KAAKwhD,KAAOxhD,KAAKwhD,KAAKT,SAASz9C,GAAG6a,MAAM7a,GAIvEtD,KAAKX,IAAM+M,GAAKyO,GAAE,kCAAmC,yCACrD7a,KAAK+gD,YAAcz9C,GAAKi3B,GAAE,iBAAmBj3B,EAAEy+C,aAAc,IAAI7jB,GAAE56B,EAAEy+C,YAAa/hD,KAAKshD,cAAgB,OAASrjC,QAAQC,QAAQ,MAEpI8iC,kBACIhhD,KAAKuhD,cAAe,EAExBL,WACIlhD,KAAKwhD,MAAQxhD,KAAKwhD,KAAKQ,wBAAwBhiD,KAAKyhD,GAMxDx/C,IACI,MAAMmK,EAAIpM,KAAKwhD,MAAQxhD,KAAKwhD,KAAKS,SACjC,OAAO1nB,GAAE,OAASnuB,GAAK,iBAAmBA,GAAI,IAAIyjB,GAAEzjB,IAUxD,MAAMiC,GACN1I,YAAYyG,EAAG9I,EAAGoV,EAAGjO,GACjBzK,KAAK0sB,EAAItgB,EAAGpM,KAAKs1B,EAAIhyB,EAAGtD,KAAKm3B,EAAIze,EAAG1Y,KAAKkiD,EAAIz3C,EAAGzK,KAAKgI,KAAO,aAAchI,KAAK8gD,KAAOjxB,GAAEovB,YACxFj/C,KAAKZ,EAAI,IAAIg2B,IAE8FkC,IAC3G,OAAOt3B,KAAKkiD,EAAIliD,KAAKkiD,KAErB3nB,KAAI,iBAAmBv6B,KAAK0sB,GAAK,OAAS1sB,KAAK0sB,IAAM1sB,KAAK0sB,EAAE80B,OAASxhD,KAAK0sB,EAAE80B,KAAKW,kCACjFniD,KAAK0sB,EAAE80B,KAAKW,gCAAgC,KAE5Cl2B,cACAjsB,KAAKZ,EAAEie,IAAI,kBAAmBrd,KAAKs1B,GAEnC,MAAMlpB,EAAIpM,KAAKs3B,IACf,OAAOlrB,GAAKpM,KAAKZ,EAAEie,IAAI,gBAAiBjR,GAAIpM,KAAKm3B,GAAKn3B,KAAKZ,EAAEie,IAAI,iCAAkCrd,KAAKm3B,GACxGn3B,KAAKZ,GAQT,MAAMspC,GACN/iC,YAAYyG,EAAG9I,EAAGoV,EAAGjO,GACjBzK,KAAK0sB,EAAItgB,EAAGpM,KAAKs1B,EAAIhyB,EAAGtD,KAAKm3B,EAAIze,EAAG1Y,KAAKkiD,EAAIz3C,EAEjDs2C,WACI,OAAO9iC,QAAQC,QAAQ,IAAI7P,GAAErO,KAAK0sB,EAAG1sB,KAAKs1B,EAAGt1B,KAAKm3B,EAAGn3B,KAAKkiD,IAE9DnhC,MAAM3U,EAAG9I,GAEL8I,EAAE60C,kBAAgB,IAAQ39C,EAAEusB,GAAEovB,eAElCiC,YACAF,oBAGJ,MAAMluC,GACFnN,YAAYyG,GACRpM,KAAK8G,MAAQsF,EAAGpM,KAAKgI,KAAO,WAAYhI,KAAKisB,QAAU,IAAImJ,IAAKhpB,GAAKA,EAAE9M,OAAS,GAAKU,KAAKisB,QAAQ5O,IAAI,sBAAuBrd,KAAK8G,QAI1I,MAAMgd,GACFne,YAAYyG,GACRpM,KAAKw4B,EAAIpsB,EAAGpM,KAAKuhD,cAAe,EAAIvhD,KAAKoiD,SAAW,KAAMpiD,KAAKqiD,EAAI,KAEvEthC,MAAM3U,EAAG9I,GACL,MAAMoV,EAAItM,IACN,MAAQA,EAAE3I,OAASoX,GAAE,gCAAiC,0EAA0EzO,EAAE3I,MAAMoC,WACxI,MAAM6S,EAAItM,EAAEg1C,QAAUphD,KAAKqiD,EAC3B,OAAOriD,KAAKqiD,EAAIj2C,EAAEg1C,MAAOvmC,GAAE,gCAAiC,YAAYnC,EAAI,MAAQ,qBACpFA,EAAIpV,EAAE8I,EAAEg1C,OAASnjC,QAAQC,WAE7Ble,KAAKyhD,EAAIn+C,IACL8I,EAAE60C,kBAAkB,IAAMvoC,EAAEpV,MAEhC,MAAMmH,EAAI2B,IACNyO,GAAE,gCAAiC,qBAAsB7a,KAAKoiD,SAAWh2C,EAAGpM,KAAKoiD,SAASE,iBAAiBtiD,KAAKyhD,IAEpHzhD,KAAKw4B,EAAEopB,QAAQx1C,GAAK3B,EAAE2B,KAGtBsR,iBACI,IAAK1d,KAAKoiD,SAAU,CAChB,MAAMh2C,EAAIpM,KAAKw4B,EAAEqpB,aAAa,CAC1BC,UAAU,IAEd11C,EAAI3B,EAAE2B,GAENyO,GAAE,gCAAiC,gCAEvC,GAERkmC,WACI,MAAM30C,EAAIpM,KAAKuhD,aACf,OAAOvhD,KAAKuhD,cAAe,EAAIvhD,KAAKoiD,SAAWpiD,KAAKoiD,SAASrB,SAAS30C,GAAG+R,MAAM/R,GAAKA,GAAKmuB,GAAE,iBAAmBnuB,EAAEg1C,OAChHphD,KAAKqiD,EAAIj2C,EAAEg1C,MAAO,IAAItuC,GAAE1G,EAAEg1C,QAAU,OAASnjC,QAAQC,QAAQ,MAEjE8iC,kBACIhhD,KAAKuhD,cAAe,EAExBL,WACIlhD,KAAKoiD,UAAYpiD,KAAKoiD,SAASG,oBAAoBviD,KAAKyhD,IAO5D,MAAM58B,GACNk8B,WACI,OAAO9iC,QAAQC,QAAQ,IAAIpL,GAAE,KAEjCkuC,mBACAjgC,MAAM3U,EAAG9I,IACT49C,aA4BJ,SAASrJ,GAAEzrC,GAEP,MAAM9I,EAEN,oBAAsBT,OAASA,KAAK2/C,QAAU3/C,KAAK4/C,UAAW/pC,EAAI,IAAIyuB,WAAW/6B,GACjF,GAAI9I,GAAK,mBAAqBA,EAAEo/C,gBAAiBp/C,EAAEo/C,gBAAgBhqC,QAEnE,IAAK,IAAIpV,EAAI,EAAGA,EAAI8I,EAAG9I,IAAKoV,EAAEpV,GAAKsH,KAAKixB,MAAM,IAAMjxB,KAAKC,UACzD,OAAO6N,EAkBP,MAAMm9B,GACN8M,WAEI,MAAMv2C,EAAI,iEAAkE9I,EAAIsH,KAAKixB,MAAM,IAAMzvB,EAAE9M,QAAU8M,EAAE9M,OAEvG,IAAIoZ,EAAI,GAChB,KAAMA,EAAEpZ,OAAS,IAAM,CACnB,MAAMmL,EAAIotC,GAAE,IACZ,IAAK,IAAIx4C,EAAI,EAAGA,EAAIoL,EAAEnL,SAAUD,EAGhCqZ,EAAEpZ,OAAS,IAAMmL,EAAEpL,GAAKiE,IAAMoV,GAAKtM,EAAE9J,OAAOmI,EAAEpL,GAAK+M,EAAE9M,SAEzD,OAAOoZ,GAIf,SAASkqC,GAAEx2C,EAAG9I,GACV,OAAO8I,EAAI9I,GAAK,EAAI8I,EAAI9I,EAAI,EAAI,EAGa,SAASu/C,GAAGz2C,EAAG9I,EAAGoV,GAC/D,OAAOtM,EAAE9M,SAAWgE,EAAEhE,QAAU8M,EAAE02C,OAAO,CAAC12C,EAAG3B,IAAMiO,EAAEtM,EAAG9I,EAAEmH,MAM1D,SAASs4C,GAAG32C,GAEZ,OAAOA,EAAI,KAkCf,MAAM42C,GAYFr9C,YAIAyG,EAIA9I,GACI,GAAItD,KAAKijD,QAAU72C,EAAGpM,KAAKkjD,YAAc5/C,EAAGA,EAAI,EAAG,MAAM,IAAIokB,GAAEjN,GAAEslC,iBAAkB,uCAAyCz8C,GAC5H,GAAIA,GAAK,IAAK,MAAM,IAAIokB,GAAEjN,GAAEslC,iBAAkB,uCAAyCz8C,GACvF,GAAI8I,GAAK,YAAa,MAAM,IAAIsb,GAAEjN,GAAEslC,iBAAkB,mCAAqC3zC,GAEnF,GAAIA,GAAK,aAAc,MAAM,IAAIsb,GAAEjN,GAAEslC,iBAAkB,mCAAqC3zC,GAMjGu2C,aACH,OAAOK,GAAGG,WAAWn5C,KAAKD,OAQvB44C,gBAAgBv2C,GACnB,OAAO42C,GAAGG,WAAW/2C,EAAEg3C,WASpBT,kBAAkBv2C,GACrB,MAAM9I,EAAIsH,KAAKixB,MAAMzvB,EAAI,KAAMsM,EAAI9N,KAAKixB,MAAM,KAAOzvB,EAAI,IAAM9I,IAC/D,OAAO,IAAI0/C,GAAG1/C,EAAGoV,GASd2qC,SACH,OAAO,IAAIr5C,KAAKhK,KAAKsjD,YAQlBA,WACH,OAAO,IAAMtjD,KAAKijD,QAAUjjD,KAAKkjD,YAAc,IAEnDK,WAAWn3C,GACP,OAAOpM,KAAKijD,UAAY72C,EAAE62C,QAAUL,GAAE5iD,KAAKkjD,YAAa92C,EAAE82C,aAAeN,GAAE5iD,KAAKijD,QAAS72C,EAAE62C,SAOxFnE,QAAQ1yC,GACX,OAAOA,EAAE62C,UAAYjjD,KAAKijD,SAAW72C,EAAE82C,cAAgBljD,KAAKkjD,YAEA79C,WAC5D,MAAO,qBAAuBrF,KAAKijD,QAAU,iBAAmBjjD,KAAKkjD,YAAc,IAEbM,SACtE,MAAO,CACHP,QAASjjD,KAAKijD,QACdC,YAAaljD,KAAKkjD,aAMnBO,UAQH,MAAMr3C,EAAIpM,KAAKijD,UAAW,YAGlB,OAAOnhD,OAAOsK,GAAGs3C,SAAS,GAAI,KAAO,IAAM5hD,OAAO9B,KAAKkjD,aAAaQ,SAAS,EAAG,MAuB5F,MAAMC,GACNh+C,YAAYyG,GACRpM,KAAK4jD,UAAYx3C,EAErBu2C,qBAAqBv2C,GACjB,OAAO,IAAIu3C,GAAGv3C,GAElBu2C,aACI,OAAO,IAAIgB,GAAG,IAAIX,GAAG,EAAG,IAE5BL,aACI,OAAO,IAAIgB,GAAG,IAAIX,GAAG,aAAc,YAEvCa,UAAUz3C,GACN,OAAOpM,KAAK4jD,UAAUL,WAAWn3C,EAAEw3C,WAEvC9E,QAAQ1yC,GACJ,OAAOpM,KAAK4jD,UAAU9E,QAAQ1yC,EAAEw3C,WAE4CE,iBAE5E,OAAO,IAAM9jD,KAAK4jD,UAAUX,QAAUjjD,KAAK4jD,UAAUV,YAAc,IAEvE79C,WACI,MAAO,mBAAqBrF,KAAK4jD,UAAUv+C,WAAa,IAE5D0+C,cACI,OAAO/jD,KAAK4jD,WAuBpB,MAAMI,GACFr+C,YAAYyG,EAAG9I,EAAGoV,QACd,IAAWpV,EAAIA,EAAI,EAAIA,EAAI8I,EAAE9M,QAAU8sC,UAAK,IAAW1zB,EAAIA,EAAItM,EAAE9M,OAASgE,EAAIoV,EAAItM,EAAE9M,OAASgE,GAAK8oC,KAClGpsC,KAAKikD,SAAW73C,EAAGpM,KAAK2xC,OAASruC,EAAGtD,KAAKkkD,IAAMxrC,EAE/CpZ,aACA,OAAOU,KAAKkkD,IAEhBpF,QAAQ1yC,GACJ,OAAO,IAAM43C,GAAGG,WAAWnkD,KAAMoM,GAErCg4C,MAAMh4C,GACF,MAAM9I,EAAItD,KAAKikD,SAASx4C,MAAMzL,KAAK2xC,OAAQ3xC,KAAKqkD,SAChD,OAAOj4C,aAAa43C,GAAK53C,EAAE8J,SAAS9J,IAChC9I,EAAEhC,KAAK8K,MACL9I,EAAEhC,KAAK8K,GAAIpM,KAAKskD,UAAUhhD,GAE0B+gD,QAC1D,OAAOrkD,KAAK2xC,OAAS3xC,KAAKV,OAE9BilD,SAASn4C,GACL,OAAOA,OAAI,IAAWA,EAAI,EAAIA,EAAGpM,KAAKskD,UAAUtkD,KAAKikD,SAAUjkD,KAAK2xC,OAASvlC,EAAGpM,KAAKV,OAAS8M,GAElGo4C,UACI,OAAOxkD,KAAKskD,UAAUtkD,KAAKikD,SAAUjkD,KAAK2xC,OAAQ3xC,KAAKV,OAAS,GAEpEmlD,eACI,OAAOzkD,KAAKikD,SAASjkD,KAAK2xC,QAE9B+S,cACI,OAAO1kD,KAAKoP,IAAIpP,KAAKV,OAAS,GAElC8P,IAAIhD,GACA,OAAOpM,KAAKikD,SAASjkD,KAAK2xC,OAASvlC,GAEvCu4C,UACI,OAAO,IAAM3kD,KAAKV,OAEtBslD,WAAWx4C,GACP,GAAIA,EAAE9M,OAASU,KAAKV,OAAQ,OAAO,EACnC,IAAK,IAAIgE,EAAI,EAAGA,EAAItD,KAAKV,OAAQgE,IAAK,GAAItD,KAAKoP,IAAI9L,KAAO8I,EAAEgD,IAAI9L,GAAI,OAAO,EAC3E,OAAO,EAEXuhD,oBAAoBz4C,GAChB,GAAIpM,KAAKV,OAAS,IAAM8M,EAAE9M,OAAQ,OAAO,EACzC,IAAK,IAAIgE,EAAI,EAAGA,EAAItD,KAAKV,OAAQgE,IAAK,GAAItD,KAAKoP,IAAI9L,KAAO8I,EAAEgD,IAAI9L,GAAI,OAAO,EAC3E,OAAO,EAEX4S,QAAQ9J,GACJ,IAAK,IAAI9I,EAAItD,KAAK2xC,OAAQj5B,EAAI1Y,KAAKqkD,QAAS/gD,EAAIoV,EAAGpV,IAAK8I,EAAEpM,KAAKikD,SAAS3gD,IAE5EuK,UACI,OAAO7N,KAAKikD,SAASx4C,MAAMzL,KAAK2xC,OAAQ3xC,KAAKqkD,SAEjD1B,kBAAkBv2C,EAAG9I,GACjB,MAAMoV,EAAI9N,KAAK4mC,IAAIplC,EAAE9M,OAAQgE,EAAEhE,QAC/B,IAAK,IAAImL,EAAI,EAAGA,EAAIiO,EAAGjO,IAAK,CACxB,MAAMiO,EAAItM,EAAEgD,IAAI3E,GAAIpL,EAAIiE,EAAE8L,IAAI3E,GAC9B,GAAIiO,EAAIrZ,EAAG,OAAQ,EACnB,GAAIqZ,EAAIrZ,EAAG,OAAO,EAEtB,OAAO+M,EAAE9M,OAASgE,EAAEhE,QAAU,EAAI8M,EAAE9M,OAASgE,EAAEhE,OAAS,EAAI,GAShE,MAAMwlD,WAAWd,GACjBM,UAAUl4C,EAAG9I,EAAGoV,GACZ,OAAO,IAAIosC,GAAG14C,EAAG9I,EAAGoV,GAExBqsC,kBAII,OAAO/kD,KAAK6N,UAAUtM,KAAK,KAE/B8D,WACI,OAAOrF,KAAK+kD,kBAMTpC,qBAAqBv2C,GAIxB,MAAM9I,EAAI,GACV,IAAK,MAAMoV,KAAKtM,EAAG,CACf,GAAIsM,EAAE3M,QAAQ,OAAS,EAAG,MAAM,IAAI2b,GAAEjN,GAAEslC,iBAAkB,oBAAoBrnC,0CAElEpV,EAAEhC,QAAQoX,EAAExG,MAAM,KAAK8yC,QAAQ54C,GAAKA,EAAE9M,OAAS,KAE/D,OAAO,IAAIwlD,GAAGxhD,GAElBq/C,mBACI,OAAO,IAAImC,GAAG,KAItB,MAAMG,GAAK,2BAKP,MAAMC,WAAWlB,GACjBM,UAAUl4C,EAAG9I,EAAGoV,GACZ,OAAO,IAAIwsC,GAAG94C,EAAG9I,EAAGoV,GAKjBiqC,yBAAyBv2C,GAC5B,OAAO64C,GAAGv1C,KAAKtD,GAEnB24C,kBACI,OAAO/kD,KAAK6N,UAAUikC,KAAK1lC,IAAMA,EAAIA,EAAEzJ,QAAQ,MAAO,QAAQA,QAAQ,KAAM,OAC5EuiD,GAAGC,kBAAkB/4C,KAAOA,EAAI,IAAMA,EAAI,KAAMA,KAAK7K,KAAK,KAE9D8D,WACI,OAAOrF,KAAK+kD,kBAITK,aACH,OAAO,IAAMplD,KAAKV,QAAU,aAAeU,KAAKoP,IAAI,GAIjDuzC,kBACH,OAAO,IAAIuC,GAAG,CAAE,aAWbvC,wBAAwBv2C,GAC3B,MAAM9I,EAAI,GACV,IAAIoV,EAAI,GAAIjO,EAAI,EAChB,MAAMpL,EAAI,KACN,GAAI,IAAMqZ,EAAEpZ,OAAQ,MAAM,IAAIooB,GAAEjN,GAAEslC,iBAAkB,uBAAuB3zC,8EAC3E9I,EAAEhC,KAAKoX,GAAIA,EAAI,IAEnB,IAAIgpC,GAAI,EACR,KAAMj3C,EAAI2B,EAAE9M,QAAU,CAClB,MAAMgE,EAAI8I,EAAE3B,GACZ,GAAI,OAASnH,EAAG,CACZ,GAAImH,EAAI,IAAM2B,EAAE9M,OAAQ,MAAM,IAAIooB,GAAEjN,GAAEslC,iBAAkB,uCAAyC3zC,GACjG,MAAM9I,EAAI8I,EAAE3B,EAAI,GAChB,GAAI,OAASnH,GAAK,MAAQA,GAAK,MAAQA,EAAG,MAAM,IAAIokB,GAAEjN,GAAEslC,iBAAkB,qCAAuC3zC,GACjHsM,GAAKpV,EAAGmH,GAAK,MACV,MAAQnH,GAAKo+C,GAAKA,EAAGj3C,KAAO,MAAQnH,GAAKo+C,GAAKhpC,GAAKpV,EAAGmH,MAAQpL,IAAKoL,KAE9E,GAAIpL,IAAKqiD,EAAG,MAAM,IAAIh6B,GAAEjN,GAAEslC,iBAAkB,2BAA6B3zC,GACzE,OAAO,IAAI84C,GAAG5hD,GAElBq/C,mBACI,OAAO,IAAIuC,GAAG,KAsBlB,MAAMG,GACN1/C,YAAYyG,GACRpM,KAAKq9B,KAAOjxB,EAEhBu2C,gBAAgBv2C,GACZ,OAAO,IAAIi5C,GAAGP,GAAGQ,WAAWl5C,IAEhCu2C,gBAAgBv2C,GACZ,OAAO,IAAIi5C,GAAGP,GAAGQ,WAAWl5C,GAAGm4C,SAAS,IAE5C5B,eACI,OAAO,IAAI0C,GAAGP,GAAGS,aAEjBC,sBACA,OAAOxlD,KAAKq9B,KAAKmnB,UAAUE,cAE0Ce,gBAAgBr5C,GACrF,OAAOpM,KAAKq9B,KAAK/9B,QAAU,GAAKU,KAAKq9B,KAAKjuB,IAAIpP,KAAKq9B,KAAK/9B,OAAS,KAAO8M,EAEkBs5C,qBAC1F,OAAO1lD,KAAKq9B,KAAKjuB,IAAIpP,KAAKq9B,KAAK/9B,OAAS,GAEyBqmD,oBACjE,OAAO3lD,KAAKq9B,KAAKmnB,UAErB1F,QAAQ1yC,GACJ,OAAO,OAASA,GAAK,IAAM04C,GAAGX,WAAWnkD,KAAKq9B,KAAMjxB,EAAEixB,MAE1Dh4B,WACI,OAAOrF,KAAKq9B,KAAKh4B,WAErBs9C,kBAAkBv2C,EAAG9I,GACjB,OAAOwhD,GAAGX,WAAW/3C,EAAEixB,KAAM/5B,EAAE+5B,MAEnCslB,qBAAqBv2C,GACjB,OAAOA,EAAE9M,OAAS,GAAK,EAOpBqjD,oBAAoBv2C,GACvB,OAAO,IAAIi5C,GAAG,IAAIP,GAAG14C,EAAEX,WAmC/B,MAAMm6C,GACFjgD,YAKAyG,EAEA9I,EAEAoV,EAEAjO,GACIzK,KAAK6lD,QAAUz5C,EAAGpM,KAAKwlD,gBAAkBliD,EAAGtD,KAAK8lD,OAASptC,EAAG1Y,KAAK+lD,WAAat7C,GAMvF,SAASu7C,GAAG55C,GACR,OAAOA,EAAE05C,OAAOhN,MAAM1sC,GAAK,IAA+BA,EAAE65C,OAGe,SAASC,GAAG95C,GACvF,OAAOA,EAAE05C,OAAOd,QAAQ54C,GAAK,IAA+BA,EAAE65C,OAYlE,SAASE,GAAG/5C,EAAG9I,GACX,IAAIoV,EAAIkqC,GAAEx2C,EAAEo5C,gBAAiBliD,EAAEkiD,iBAC/B,GAAI,IAAM9sC,EAAG,OAAOA,EACpB,IAAK,IAAIjO,EAAI,EAAGA,EAAIG,KAAK4mC,IAAIplC,EAAE05C,OAAOxmD,OAAQgE,EAAEwiD,OAAOxmD,UAAWmL,EAAG,GAAIiO,EAAI0tC,GAAGh6C,EAAE05C,OAAOr7C,GAAInH,EAAEwiD,OAAOr7C,IACtG,IAAMiO,EAAG,OAAOA,EAChB,OAAOkqC,GAAEx2C,EAAE05C,OAAOxmD,OAAQgE,EAAEwiD,OAAOxmD,QAGkBsmD,GAAGS,YAAc,EAG1E,MAAMC,GACF3gD,YAEAyG,EAEA9I,GACItD,KAAKumD,UAAYn6C,EAAGpM,KAAKimD,KAAO3iD,GAIxC,SAAS8iD,GAAGh6C,EAAG9I,GACX,MAAMoV,EAAIwsC,GAAGf,WAAW/3C,EAAEm6C,UAAWjjD,EAAEijD,WACvC,OAAO,IAAM7tC,EAAIA,EAAIkqC,GAAEx2C,EAAE65C,KAAM3iD,EAAE2iD,MAMjC,MAAMO,GACN7gD,YAIAyG,EAEA9I,GACItD,KAAKymD,eAAiBr6C,EAAGpM,KAAK2xC,OAASruC,EAEuBq/C,eAC9D,OAAO,IAAI6D,GAAG,EAAGE,GAAGlV,QAOxB,SAASmV,GAAGv6C,EAAG9I,GAOf,MAAMoV,EAAItM,EAAE23C,cAAcd,QAASx4C,EAAI2B,EAAE23C,cAAcb,YAAc,EAAG7jD,EAAIskD,GAAGiD,cAAc,MAAQn8C,EAAI,IAAIu4C,GAAGtqC,EAAI,EAAG,GAAK,IAAIsqC,GAAGtqC,EAAGjO,IACtI,OAAO,IAAIi8C,GAAGrnD,EAAGgmD,GAAGwB,QAASvjD,GAG2B,SAASwjD,GAAG16C,GACpE,OAAO,IAAIs6C,GAAGt6C,EAAE26C,SAAU36C,EAAEvF,KAAM,GAMlC,MAAM6/C,GACN/gD,YAKAyG,EAKA9I,EAIAoV,GACI1Y,KAAK+mD,SAAW36C,EAAGpM,KAAKgnD,YAAc1jD,EAAGtD,KAAKinD,eAAiBvuC,EAEAiqC,aAC/D,OAAO,IAAI+D,GAAG/C,GAAGnS,MAAO6T,GAAGwB,SAAU,GAEyBlE,aAC9D,OAAO,IAAI+D,GAAG/C,GAAGtxC,MAAOgzC,GAAGwB,SAAU,IAI7C,SAASK,GAAG96C,EAAG9I,GACX,IAAIoV,EAAItM,EAAE26C,SAASlD,UAAUvgD,EAAEyjD,UAC/B,OAAO,IAAMruC,EAAIA,GAAKA,EAAI2sC,GAAGlB,WAAW/3C,EAAE46C,YAAa1jD,EAAE0jD,aAAc,IAAMtuC,EAAIA,EAAIkqC,GAAEx2C,EAAE66C,eAAgB3jD,EAAE2jD,iBAkB3G,MAAME,GAAK,4HASX,MAAMC,GACNzhD,cACI3F,KAAKqnD,qBAAuB,GAEhCC,uBAAuBl7C,GACnBpM,KAAKqnD,qBAAqB/lD,KAAK8K,GAEnCm7C,wBACIvnD,KAAKqnD,qBAAqBnxC,SAAS9J,GAAKA,OA6B5Co7C,eAAeC,GAAGr7C,GAClB,GAAIA,EAAExG,OAAS6U,GAAE4lC,qBAAuBj0C,EAAEvG,UAAYshD,GAAI,MAAM/6C,EAChEyO,GAAE,aAAc,mCA+BhB,MAAM6sC,GACN/hD,YAAYyG,GAGRpM,KAAK2nD,aAAe,KAAM3nD,KAAK4nD,cAAgB,KAE/C5nD,KAAK2hC,YAAS,EAAQ3hC,KAAKyD,WAAQ,EAAQzD,KAAK6nD,QAAS,EAGzD7nD,KAAK8nD,kBAAmB,EAAI17C,GAAGA,IAC3BpM,KAAK6nD,QAAS,EAAI7nD,KAAK2hC,OAASv1B,EAAGpM,KAAK2nD,cAGxC3nD,KAAK2nD,aAAav7C,MACjBA,IACDpM,KAAK6nD,QAAS,EAAI7nD,KAAKyD,MAAQ2I,EAAGpM,KAAK4nD,eAAiB5nD,KAAK4nD,cAAcx7C,MAGnF44B,MAAM54B,GACF,OAAOpM,KAAKwc,UAAK,EAAQpQ,GAE7BoQ,KAAKpQ,EAAG9I,GACJ,OAAOtD,KAAK8nD,kBAAoB1b,KAAKpsC,KAAK8nD,kBAAmB,EAAI9nD,KAAK6nD,OAAS7nD,KAAKyD,MAAQzD,KAAK+nD,YAAYzkD,EAAGtD,KAAKyD,OAASzD,KAAKgoD,YAAY57C,EAAGpM,KAAK2hC,QAAU,IAAI+lB,KAAKhvC,EAAGjO,KACzKzK,KAAK2nD,aAAerkD,IAChBtD,KAAKgoD,YAAY57C,EAAG9I,GAAGkZ,KAAK9D,EAAGjO,IAChCzK,KAAK4nD,cAAgBx7C,IACpBpM,KAAK+nD,YAAYzkD,EAAG8I,GAAGoQ,KAAK9D,EAAGjO,OAI3Cw9C,YACI,OAAO,IAAIhqC,SAAO,CAAG7R,EAAG9I,KACpBtD,KAAKwc,KAAKpQ,EAAG9I,MAGrB4kD,iBAAiB97C,GACb,IACI,MAAM9I,EAAI8I,IACV,OAAO9I,aAAaokD,GAAKpkD,EAAIokD,GAAGxpC,QAAQ5a,GAC1C,MAAO8I,GACL,OAAOs7C,GAAG7G,OAAOz0C,IAGzB47C,YAAY57C,EAAG9I,GACX,OAAO8I,EAAIpM,KAAKkoD,kBAAgB,IAAQ97C,EAAE9I,KAAOokD,GAAGxpC,QAAQ5a,GAEhEykD,YAAY37C,EAAG9I,GACX,OAAO8I,EAAIpM,KAAKkoD,kBAAgB,IAAQ97C,EAAE9I,KAAOokD,GAAG7G,OAAOv9C,GAE/Dq/C,eAAev2C,GACX,OAAO,IAAIs7C,IAAE,CAAGpkD,EAAGoV,KACfpV,EAAE8I,MAGVu2C,cAAcv2C,GACV,OAAO,IAAIs7C,IAAE,CAAGpkD,EAAGoV,KACfA,EAAEtM,MAGVu2C,eAGAv2C,GACI,OAAO,IAAIs7C,IAAE,CAAGpkD,EAAGoV,KACf,IAAIjO,EAAI,EAAGpL,EAAI,EAAGqiD,GAAI,EACtBt1C,EAAE8J,SAAS9J,MACL3B,EAAG2B,EAAEoQ,aACDnd,EAAGqiD,GAAKriD,IAAMoL,GAAKnH,OACpB8I,GAAKsM,EAAEtM,QACXs1C,GAAI,EAAIriD,IAAMoL,GAAKnH,OAQzBq/C,UAAUv2C,GACb,IAAI9I,EAAIokD,GAAGxpC,SAAQ,GACnB,IAAK,MAAMxF,KAAKtM,EAAG9I,EAAIA,EAAEkZ,MAAMpQ,GAAKA,EAAIs7C,GAAGxpC,QAAQ9R,GAAKsM,MACxD,OAAOpV,EAEXq/C,eAAev2C,EAAG9I,GACd,MAAMoV,EAAI,GACV,OAAOtM,EAAE8J,UAAU9J,EAAG3B,KAClBiO,EAAEpX,KAAKgC,EAAEgC,KAAKtF,KAAMoM,EAAG3B,OACtBzK,KAAKmoD,QAAQzvC,GAIfiqC,gBAAgBv2C,EAAG9I,GACtB,OAAO,IAAIokD,IAAE,CAAGhvC,EAAGjO,KACf,MAAMpL,EAAI+M,EAAE9M,OAAQoiD,EAAI,IAAInhD,MAAMlB,GAClC,IAAIoiD,EAAI,EACR,IAAK,IAAIx/C,EAAI,EAAGA,EAAI5C,EAAG4C,IAAK,CACxB,MAAM1C,EAAI0C,EACVqB,EAAE8I,EAAE7M,IAAIid,MAAMpQ,IACVs1C,EAAEniD,GAAK6M,IAAKq1C,EAAGA,IAAMpiD,GAAKqZ,EAAEgpC,MAC3Bt1C,GAAK3B,EAAE2B,SASjBu2C,eAAev2C,EAAG9I,GACrB,OAAO,IAAIokD,IAAE,CAAGhvC,EAAGjO,KACf,MAAMpL,EAAI,MACN,IAAO+M,IAAM9I,IAAIkZ,MAAI,KACjBnd,MACAoL,GAAKiO,KAEbrZ,QA2BZ,MAAM+oD,GACFziD,YAAYyG,EAAG9I,GACXtD,KAAKqoD,OAASj8C,EAAGpM,KAAKsoD,YAAchlD,EAAGtD,KAAKuoD,SAAU,EAItDvoD,KAAK6vB,EAAI,IAAI+wB,GAAG5gD,KAAKsoD,YAAYE,WAAa,KAC1CxoD,KAAK6vB,EAAE3R,WACRle,KAAKsoD,YAAY5lB,QAAU,KAC1Bp/B,EAAEG,MAAQzD,KAAK6vB,EAAEgxB,OAAO,IAAI4H,GAAGr8C,EAAG9I,EAAEG,QAAUzD,KAAK6vB,EAAE3R,WACtDle,KAAKsoD,YAAY7lB,QAAUn/B,IAC1B,MAAMoV,EAAIgwC,GAAGplD,EAAEoL,OAAOjL,OACtBzD,KAAK6vB,EAAEgxB,OAAO,IAAI4H,GAAGr8C,EAAGsM,KAGhCiqC,YAAYv2C,EAAG9I,EAAGoV,EAAGjO,GACjB,IACI,OAAO,IAAI29C,GAAG9kD,EAAG8I,EAAEk8C,YAAY79C,EAAGiO,IACpC,MAAOtM,GACL,MAAM,IAAIq8C,GAAGnlD,EAAG8I,IAGpBU,QACA,OAAO9M,KAAK6vB,EAAE9R,QAElBiS,MAAM5jB,GACFA,GAAKpM,KAAK6vB,EAAEgxB,OAAOz0C,GAAIpM,KAAKuoD,UAAY1tC,GAAE,WAAY,wBAAyBzO,EAAIA,EAAEvG,QAAU,0BAC/F7F,KAAKuoD,SAAU,EAAIvoD,KAAKsoD,YAAYt4B,SAExCgP,IAII,MAAM5yB,EAAIpM,KAAKsoD,YACftoD,KAAKuoD,SAAW,mBAAqBn8C,EAAEu8C,QAAUv8C,EAAEu8C,SAUhDC,MAAMx8C,GACT,MAAM9I,EAAItD,KAAKsoD,YAAYO,YAAYz8C,GACvC,OAAO,IAAI08C,GAAGxlD,IAUlB,MAAMylD,GAUNpjD,YAAYyG,EAAG9I,EAAGoV,GACd1Y,KAAKgG,KAAOoG,EAAGpM,KAAKqR,QAAU/N,EAAGtD,KAAK07B,EAAIhjB,EAK1C,OAASqwC,GAAGvnC,EAAEta,MAAQmJ,GAAE,gMAEcsyC,cAAcv2C,GACpD,OAAOyO,GAAE,WAAY,qBAAsBzO,GAAI48C,GAAGlmD,OAAOmmD,UAAUC,eAAe98C,IAAI67C,YAEbtF,WACzE,I/D59CQ,WACd,IACE,MAA4B,iBAAdsG,UACd,MAAO3lD,GACP,OAAO,G+Dw9CEopB,GAAK,OAAO,EACjB,GAAIq8B,GAAGx9B,IAAK,OAAO,EAQX,MAAMnf,EAAIlF,IAAK5D,EAAIylD,GAAGvnC,EAAEpV,GAAIsM,EAAI,EAAIpV,GAAKA,EAAI,GAAImH,EAAIs+C,GAAGxhD,EAAE6E,GAAI/M,EAAI,EAAIoL,GAAKA,EAAI,IAS/E,QAAS2B,EAAEL,QAAQ,SAAW,GAAKK,EAAEL,QAAQ,YAAc,GAAKK,EAAEL,QAAQ,SAAW,GAAK2M,GAAKrZ,GAKpGsjD,WACH,IAAIv2C,EACJ,MAAO,oBAAsBtI,SAAW,SAAW,QAAUsI,EAAItI,QAAQC,WAAQ,IAAWqI,OAAI,EAASA,EAAEggC,GAE7CuW,SAASv2C,EAAG9I,GAC1E,OAAO8I,EAAEw8C,MAAMtlD,GAInBq/C,SAASv2C,GACL,MAAM9I,EAAI8I,EAAEhJ,MAAM,mCAAoCsV,EAAIpV,EAAIA,EAAE,GAAG4O,MAAM,KAAKzG,MAAM,EAAG,GAAGlK,KAAK,KAAO,KACtG,OAAOse,OAAOnH,GAIlBiqC,SAASv2C,GACL,MAAM9I,EAAI8I,EAAEhJ,MAAM,qBAAsBsV,EAAIpV,EAAIA,EAAE,GAAG4O,MAAM,KAAKzG,MAAM,EAAG,GAAGlK,KAAK,KAAO,KACxF,OAAOse,OAAOnH,GAIX8uC,QAAQp7C,GACX,OAAOpM,KAAKoa,KAAOS,GAAE,WAAY,oBAAqB7a,KAAKgG,MAAOhG,KAAKoa,SAAW,IAAI6D,SAAO,CAAG3a,EAAGoV,KAM/F,MAAMjO,EAAIw+C,UAAUzjB,KAAKxlC,KAAKgG,KAAMhG,KAAKqR,SACzC5G,EAAE0+C,UAAY/8C,IACV,MAAMsM,EAAItM,EAAEsC,OAAOizB,OACnBr+B,EAAEoV,IACHjO,EAAE2+C,UAAY,KACb1wC,EAAE,IAAI+vC,GAAGr8C,EAAG,sIACb3B,EAAEg4B,QAAUn/B,IACX,MAAMmH,EAAInH,EAAEoL,OAAOjL,MACnB,iBAAmBgH,EAAEzE,KAAO0S,EAAE,IAAIgP,GAAEjN,GAAE4lC,oBAAqB,yVAA2V,sBAAwB51C,EAAEzE,KAAO0S,EAAE,IAAIgP,GAAEjN,GAAE4lC,oBAAqB,6KAA+K51C,IAAMiO,EAAE,IAAI+vC,GAAGr8C,EAAG3B,KACxpBA,EAAE4+C,gBAAkBj9C,IACnByO,GAAE,WAAY,aAAe7a,KAAKgG,KAAO,mCAAoCoG,EAAEk9C,YAC/E,MAAMhmD,EAAI8I,EAAEsC,OAAOizB,OACnB3hC,KAAK07B,EAAEkkB,EAAEt8C,EAAGmH,EAAE69C,YAAal8C,EAAEk9C,WAAYtpD,KAAKqR,SAASmL,MAAI,KACvD3B,GAAE,WAAY,+BAAiC7a,KAAKqR,QAAU,qBAGpErR,KAAKya,IAAMza,KAAKoa,GAAGmvC,gBAAkBn9C,GAAKpM,KAAKya,EAAErO,IAAKpM,KAAKoa,GAErEsN,EAAEtb,GACEpM,KAAKya,EAAIrO,EAAGpM,KAAKoa,KAAOpa,KAAKoa,GAAGmvC,gBAAkBjmD,GAAK8I,EAAE9I,IAE7DkkD,qBAAqBp7C,EAAG9I,EAAGoV,EAAGjO,GAC1B,MAAMpL,EAAI,aAAeiE,EACzB,IAAIo+C,EAAI,EACR,OAAS,GACHA,EACF,IACI1hD,KAAKoa,SAAWpa,KAAK2/C,EAAEvzC,GACvB,MAAM9I,EAAI8kD,GAAG5iB,KAAKxlC,KAAKoa,GAAIhO,EAAG/M,EAAI,WAAa,YAAaqZ,GAAIgpC,EAAIj3C,EAAEnH,GAAGkZ,MAAMpQ,IAAM9I,EAAE07B,IACvF5yB,KAAK44B,OAAO54B,IAEZ9I,EAAE0sB,MAAM5jB,GAAIs7C,GAAG7G,OAAOz0C,MAAM67C,YAG5B,OAAOvG,EAAE1c,OAAO,eAIV1hC,EAAEwJ,EAAG40C,EACb,MAAOt1C,GACL,MAAM9I,EAAI8I,EAAGsM,EAAI,kBAAoBpV,EAAE0C,MAAQ07C,EAAI,EAMnC,GAAI7mC,GAAE,WAAY,iCAAkCvX,EAAEuC,QAAS,YAAa6S,GAC5F1Y,KAAKi9C,SAAUvkC,EAAG,OAAOuF,QAAQ4iC,OAAOv9C,KAIpD25C,QACIj9C,KAAKoa,IAAMpa,KAAKoa,GAAG6iC,QAASj9C,KAAKoa,QAAK,GAQ1C,MAAMovC,GACN7jD,YAAYyG,GACRpM,KAAK4gD,EAAIx0C,EAAGpM,KAAKk+B,GAAI,EAAIl+B,KAAKm+C,EAAI,KAElC0J,aACA,OAAO7nD,KAAKk+B,EAEZijB,QACA,OAAOnhD,KAAKm+C,EAEZsL,WAAOr9C,GACPpM,KAAK4gD,EAAIx0C,EAINi7B,OACHrnC,KAAKk+B,GAAI,EAKN7vB,EAAEjC,GACLpM,KAAKm+C,EAAI/xC,EAMNuyB,SACH,OAAOqqB,GAAGhpD,KAAK4gD,EAAEjiB,WAIqD,MAAM8pB,WAAW/gC,GAC3F/hB,YAAYyG,EAAG9I,GACXyC,MAAM0U,GAAEimC,YAAa,0BAA0Bt0C,cAAc9I,KAAMtD,KAAKgG,KAAO,6BAI1B,SAAS0jD,GAAGt9C,GAGrE,MAAO,8BAAgCA,EAAEpG,KAYzC,MAAM8iD,GACNnjD,YAAYyG,GACRpM,KAAK4oD,MAAQx8C,EAEjBsS,IAAItS,EAAG9I,GACH,IAAIoV,EACJ,YAAO,IAAWpV,GAAKuX,GAAE,WAAY,MAAO7a,KAAK4oD,MAAM5iD,KAAMoG,EAAG9I,GAAIoV,EAAI1Y,KAAK4oD,MAAMlqC,IAAIpb,EAAG8I,KAAOyO,GAAE,WAAY,MAAO7a,KAAK4oD,MAAM5iD,KAAM,aAAcoG,GACrJsM,EAAI1Y,KAAK4oD,MAAMlqC,IAAItS,IAAK48C,GAAGtwC,GAQxBhB,IAAItL,GAEP,OADAyO,GAAE,WAAY,MAAO7a,KAAK4oD,MAAM5iD,KAAMoG,EAAGA,GAClC48C,GAAGhpD,KAAK4oD,MAAMlxC,IAAItL,IAQtBgD,IAAIhD,GAGP,OAAO48C,GAAGhpD,KAAK4oD,MAAMx5C,IAAIhD,IAAIoQ,MAAMlZ,SAEnC,IAAWA,IAAMA,EAAI,MAAOuX,GAAE,WAAY,MAAO7a,KAAK4oD,MAAM5iD,KAAMoG,EAAG9I,GAAIA,KAE7Eq7B,OAAOvyB,GAEH,OADAyO,GAAE,WAAY,SAAU7a,KAAK4oD,MAAM5iD,KAAMoG,GAClC48C,GAAGhpD,KAAK4oD,MAAMjqB,OAAOvyB,IAOzBmlC,QAEH,OADA12B,GAAE,WAAY,QAAS7a,KAAK4oD,MAAM5iD,MAC3BgjD,GAAGhpD,KAAK4oD,MAAMrX,SAEzB7I,EAAEt8B,EAAG9I,GACD,MAAMoV,EAAI1Y,KAAKmP,QAAQ/C,EAAG9I,GAGlB,GAAIoV,EAAEb,OAAS,mBAAqB7X,KAAK4oD,MAAMe,OAAQ,CAC3D,MAAMv9C,EAAIpM,KAAKypD,OAAO/wC,GAAIpV,EAAI,GAC9B,OAAOtD,KAAK8jB,EAAE1X,GAAC,CAAIA,EAAGsM,KAClBpV,EAAEhC,KAAKoX,MACP8D,UAAYlZ,IAEpB,CACI,MAAM8I,EAAIpM,KAAK4oD,MAAMe,OAAOjxC,EAAEkxC,OAC9B,OAAO,IAAIlC,IAAE,CAAGpkD,EAAGoV,KACftM,EAAEq2B,QAAUr2B,IACRsM,EAAEtM,EAAEsC,OAAOjL,QACZ2I,EAAE+8C,UAAY/8C,IACb9I,EAAE8I,EAAEsC,OAAOizB,aAQpB9c,EAAEzY,EAAG9I,GACR,MAAMoV,EAAI1Y,KAAK4oD,MAAMe,OAAOv9C,EAAG,OAAS9I,OAAI,EAASA,GACrD,OAAO,IAAIokD,IAAE,CAAGt7C,EAAG9I,KACfoV,EAAE+pB,QAAUr2B,IACR9I,EAAE8I,EAAEsC,OAAOjL,QACZiV,EAAEywC,UAAY7lD,IACb8I,EAAE9I,EAAEoL,OAAOizB,YAIvBkW,EAAEzrC,EAAG9I,GACDuX,GAAE,WAAY,aAAc7a,KAAK4oD,MAAM5iD,MACvC,MAAM0S,EAAI1Y,KAAKmP,QAAQ/C,EAAG9I,GAC1BoV,EAAEm9B,GAAI,EACN,MAAMprC,EAAIzK,KAAKypD,OAAO/wC,GACtB,OAAO1Y,KAAK8jB,EAAErZ,IAAK2B,EAAG9I,EAAGoV,IAAMA,EAAEimB,WAErCikB,EAAEx2C,EAAG9I,GACD,IAAIoV,EACJpV,EAAIoV,EAAItM,GAAKsM,EAAI,GAAIpV,EAAI8I,GACzB,MAAM3B,EAAIzK,KAAKypD,OAAO/wC,GACtB,OAAO1Y,KAAK8jB,EAAErZ,EAAGnH,GASdu/C,GAAGz2C,GACN,MAAM9I,EAAItD,KAAKypD,OAAO,IACtB,OAAO,IAAI/B,IAAE,CAAGhvC,EAAGjO,KACfnH,EAAEm/B,QAAUr2B,IACR,MAAM9I,EAAIolD,GAAGt8C,EAAEsC,OAAOjL,OACtBgH,EAAEnH,IACHA,EAAE6lD,UAAY7lD,IACb,MAAMmH,EAAInH,EAAEoL,OAAOizB,OACnBl3B,EAAI2B,EAAE3B,EAAEo/C,WAAYp/C,EAAE3D,OAAO0V,MAAMpQ,IAC/BA,EAAI3B,EAAEq/C,WAAapxC,OACjBA,QAIlBoL,EAAE1X,EAAG9I,GACD,MAAMoV,EAAI,GACV,OAAO,IAAIgvC,IAAE,CAAGj9C,EAAGpL,KACf+M,EAAEq2B,QAAUr2B,IACR/M,EAAE+M,EAAEsC,OAAOjL,QACZ2I,EAAE+8C,UAAY/8C,IACb,MAAM/M,EAAI+M,EAAEsC,OAAOizB,OACnB,IAAKtiC,EAAG,YAAYoL,IACpB,MAAMi3C,EAAI,IAAI8H,GAAGnqD,GAAIoiD,EAAIn+C,EAAEjE,EAAEwqD,WAAYxqD,EAAEyH,MAAO46C,GAClD,GAAID,aAAaiG,GAAI,CACjB,MAAMt7C,EAAIq1C,EAAEzc,OAAO54B,IAAMs1C,EAAEra,OAAQqgB,GAAG7G,OAAOz0C,MAC7CsM,EAAEpX,KAAK8K,GAEXs1C,EAAEmG,OAASp9C,IAAM,OAASi3C,EAAEP,EAAI9hD,EAAEyqD,WAAazqD,EAAEyqD,SAASpI,EAAEP,OAEhE3kC,MAAI,IAAQkrC,GAAGS,QAAQzvC,KAE/BvJ,QAAQ/C,EAAG9I,GACP,IAAIoV,EACJ,YAAO,IAAWtM,IAAM,iBAAmBA,EAAIsM,EAAItM,EAAI9I,EAAI8I,GAAI,CAC3DyL,MAAOa,EACPkxC,MAAOtmD,GAGfmmD,OAAOr9C,GACH,IAAI9I,EAAI,OACR,GAAI8I,EAAE29C,UAAYzmD,EAAI,QAAS8I,EAAEyL,MAAO,CACpC,MAAMa,EAAI1Y,KAAK4oD,MAAM/wC,MAAMzL,EAAEyL,OAC7B,OAAOzL,EAAEypC,EAAIn9B,EAAEsxC,cAAc59C,EAAEw9C,MAAOtmD,GAAKoV,EAAEuxC,WAAW79C,EAAEw9C,MAAOtmD,GAErE,OAAOtD,KAAK4oD,MAAMqB,WAAW79C,EAAEw9C,MAAOtmD,IAO1C,SAAS0lD,GAAG58C,GACZ,OAAO,IAAIs7C,IAAE,CAAGpkD,EAAGoV,KACftM,EAAE+8C,UAAY/8C,IACV,MAAMsM,EAAItM,EAAEsC,OAAOizB,OACnBr+B,EAAEoV,IACHtM,EAAEq2B,QAAUr2B,IACX,MAAM9I,EAAIolD,GAAGt8C,EAAEsC,OAAOjL,OACtBiV,EAAEpV,OAMd,IAAI4mD,IAAK,EAET,SAASxB,GAAGt8C,GACR,MAAM9I,EAAIylD,GAAGvnC,EAAEta,KACf,GAAI5D,GAAK,MAAQA,EAAI,GAAI,CACrB,MAAMA,EAAI,mEACV,GAAI8I,EAAEvG,QAAQkG,QAAQzI,IAAM,EAAG,CAE3B,MAAM8I,EAAI,IAAIsb,GAAE,WAAY,6CAA6CpkB,gJACzE,OAAO4mD,KAAOA,IAAK,EAGnBxsC,iBACI,MAAMtR,IACN,IAAKA,GAGjB,OAAOA,EAIX,MAAM+9C,GACFxkD,YAAYyG,EAAG9I,GACXtD,KAAKoqD,WAAah+C,EAAGpM,KAAK+iD,GAAKz/C,EAAGtD,KAAKqqD,KAAO,KAElDtpC,QACI/gB,KAAKgjD,GAAG,MAEZliC,OACI9gB,KAAKqqD,OAASrqD,KAAKqqD,KAAKvyB,SAAU93B,KAAKqqD,KAAO,MAE9CC,cACA,OAAO,OAAStqD,KAAKqqD,KAEzBrH,GAAG52C,GACCyO,GAAE,iBAAkB,gBAAgBzO,OAAQpM,KAAKqqD,KAAOrqD,KAAKoqD,WAAWG,kBAAkB,iBAA+Cn+C,GAAC,UACtIpM,KAAKqqD,KAAO,KACZ,IACIxvC,GAAE,iBAAkB,4BAA4B7a,KAAK+iD,GAAGY,QAC1D,MAAOv3C,GACLs9C,GAAGt9C,GAAKyO,GAAE,iBAAkB,mDAAoDzO,SAAWq7C,GAAGr7C,SAE5FpM,KAAKgjD,GAAG,SAK2B,MAAMwH,GACvD7kD,YAQAyG,EAAG9I,GACCtD,KAAKyqD,WAAar+C,EAAGpM,KAAK0qD,YAAcpnD,EAE5CkkD,SAASp7C,EAAI,IACT,OAAOpM,KAAK0qD,YAAYC,eAAe,mBAAoB,qBAAsBrnD,GAAKtD,KAAKgkD,GAAG1gD,EAAG8I,KAED43C,GAAG53C,EAAG9I,GACtG,MAAMoV,EAAI,IAAI0a,IACd,IAAI3oB,EAAInH,EAAGjE,GAAI,EACf,OAAOqoD,GAAGkD,SAAS,KAAM,IAAOvrD,GAAKoL,EAAI,IAAC,IAAUzK,KAAKyqD,WAAWI,aAAaC,+BAA+B1+C,GAAGoQ,MAAMlZ,IACrH,GAAI,OAASA,IAAMoV,EAAEgmB,IAAIp7B,GAAI,OAAOuX,GAAE,iBAAkB,0BAA0BvX,KAClFtD,KAAK8kD,GAAG14C,EAAG9I,EAAGmH,GAAG+R,MAAMpQ,IACnB3B,GAAK2B,EAAGsM,EAAEhB,IAAIpU,MAElBjE,GAAI,OACFmd,MAAI,IAAQlZ,EAAImH,IAInBq6C,GAAG14C,EAAG9I,EAAGoV,GAEZ,OAAO1Y,KAAKyqD,WAAWI,aAAaE,gCAAgC3+C,EAAG9I,GAAGkZ,MAAM/R,GAAKzK,KAAKyqD,WAAWO,eAAeC,iBAAiB7+C,EAAG9I,EAAGmH,EAAGiO,GAAG8D,MAAM9D,IACnJ,MAAMrZ,EAAIqZ,EAAEwyC,QACZ,OAAOlrD,KAAKyqD,WAAWI,aAAaM,mBAAmB/+C,EAAG/M,GAAGmd,MAAM,IAAMxc,KAAKilD,GAAGx6C,EAAGiO,KAAK8D,MAAM9D,IAAMmC,GAAE,iBAAkB,oBAAoBnC,KAC7I1Y,KAAKyqD,WAAWI,aAAaO,sBAAsBh/C,EAAG9I,EAAGoV,MAAM8D,MAAI,IAAQnd,EAAEqlB,YAGlBugC,GAAG74C,EAAG9I,GACrE,IAAIoV,EAAItM,EACR,OAAO9I,EAAE4nD,QAAQh1C,SAAO,CAAG9J,EAAG9I,KAC1B,MAAMmH,EAAIq8C,GAAGxjD,GACb4jD,GAAGz8C,EAAGiO,GAAK,IAAMA,EAAIjO,MACpB,IAAIi8C,GAAGhuC,EAAEquC,SAAUruC,EAAEsuC,YAAap8C,KAAKyH,IAAI/O,EAAE+nD,QAASj/C,EAAE66C,kBAyBjE,MAAMqE,GACN3lD,YAAYyG,EAAG9I,GACXtD,KAAKurD,cAAgBn/C,EAAG9I,IAAMA,EAAEkoD,sBAAwBp/C,GAAKpM,KAAKklD,GAAG94C,GAAIpM,KAAKqlD,GAAKj5C,GAAK9I,EAAEmoD,oBAAoBr/C,IAElH84C,GAAG94C,GACC,OAAOpM,KAAKurD,cAAgB3gD,KAAKyH,IAAIjG,EAAGpM,KAAKurD,eAAgBvrD,KAAKurD,cAEtE/uC,OACI,MAAMpQ,IAAMpM,KAAKurD,cACjB,OAAOvrD,KAAKqlD,IAAMrlD,KAAKqlD,GAAGj5C,GAAIA,GAItCk/C,GAAG1F,IAAM,EAkBT,MAAM8F,GAkBF/lD,YAAYyG,EAAG9I,EAAGoV,EAAGjO,EAAGpL,EAAGqiD,EAAGD,EAAGx/C,GAC7BjC,KAAK2rD,WAAav/C,EAAGpM,KAAK4rD,MAAQtoD,EAAGtD,KAAK6rD,eAAiBnzC,EAAG1Y,KAAKqE,KAAOoG,EAAGzK,KAAK8rD,IAAMzsD,EACxFW,KAAKivC,iBAAmByS,EAAG1hD,KAAK+rD,sBAAwBtK,EAAGzhD,KAAKwuC,gBAAkBvsC,GAS1F,MAAM+pD,GACFrmD,YAAYyG,EAAG9I,GACXtD,KAAKisD,UAAY7/C,EAAGpM,KAAKksD,SAAW5oD,GAAK,YAE7Cq/C,eACI,OAAO,IAAIqJ,GAAG,GAAI,IAElBG,wBACA,MAAO,cAAgBnsD,KAAKksD,SAEhCpN,QAAQ1yC,GACJ,OAAOA,aAAa4/C,IAAM5/C,EAAE6/C,YAAcjsD,KAAKisD,WAAa7/C,EAAE8/C,WAAalsD,KAAKksD,UAoBxF,SAASE,GAAGhgD,GACR,IAAI9I,EAAI,EACR,IAAK,MAAMoV,KAAKtM,EAAGjH,OAAOC,UAAUmI,eAAejI,KAAK8G,EAAGsM,IAAMpV,IACjE,OAAOA,EAGX,SAAS+oD,GAAGjgD,EAAG9I,GACX,IAAK,MAAMoV,KAAKtM,EAAGjH,OAAOC,UAAUmI,eAAejI,KAAK8G,EAAGsM,IAAMpV,EAAEoV,EAAGtM,EAAEsM,IAG5E,SAAS4zC,GAAGlgD,GACR,IAAK,MAAM9I,KAAK8I,EAAG,GAAIjH,OAAOC,UAAUmI,eAAejI,KAAK8G,EAAG9I,GAAI,OAAO,EAC1E,OAAO,EAuBX,SAASipD,GAAGngD,GACR,OAAO,MAAQA,EAG6B,SAASogD,GAAGpgD,GAGxD,OAAO,IAAMA,GAAK,EAAIA,IAAK,EAAA,EAM3B,SAASqgD,GAAGrgD,GACZ,MAAO,iBAAmBA,GAAKyT,OAAO6sC,UAAUtgD,KAAOogD,GAAGpgD,IAAMA,GAAKyT,OAAO8sC,kBAAoBvgD,GAAKyT,OAAO+sC,iBAqBhH,SAASC,KACL,MAAO,oBAAsB1sD,KA2B7B,MAAM2sD,GACNnnD,YAAYyG,GACRpM,KAAK+sD,aAAe3gD,EAExBu2C,wBAAwBv2C,GACpB,MAAM9I,EAAInD,KAAKiM,GACf,OAAO,IAAI0gD,GAAGxpD,GAElBq/C,sBAAsBv2C,GAGlB,MAAM9I,EAIN,SAAS8I,GACL,IAAI9I,EAAI,GACR,IAAK,IAAIoV,EAAI,EAAGA,EAAItM,EAAE9M,SAAUoZ,EAAGpV,GAAKxB,OAAOC,aAAaqK,EAAEsM,IAC9D,OAAOpV,EAHX,CAOH8I,GACG,OAAO,IAAI0gD,GAAGxpD,GAElB,CAAC0pD,OAAOC,YACJ,IAAI7gD,EAAI,EACR,MAAO,CACHoQ,KAAM,IAAMpQ,EAAIpM,KAAK+sD,aAAaztD,OAAS,CACvCwH,MAAO9G,KAAK+sD,aAAavtD,WAAW4M,KACpCi7B,MAAM,GACN,CACAvgC,WAAO,EACPugC,MAAM,IAIlB6lB,WACI,OAAO9gD,EAAIpM,KAAK+sD,aAActrD,KAAK2K,GAEnC,IAAIA,EAER+gD,eACI,OAAO,SAAS/gD,GACZ,MAAM9I,EAAI,IAAI6jC,WAAW/6B,EAAE9M,QAC3B,IAAK,IAAIoZ,EAAI,EAAGA,EAAItM,EAAE9M,OAAQoZ,IAAKpV,EAAEoV,GAAKtM,EAAE5M,WAAWkZ,GACvD,OAAOpV,EAHJ,CAsBNtD,KAAK+sD,cAEVK,sBACI,OAAO,EAAIptD,KAAK+sD,aAAaztD,OAEjCukD,UAAUz3C,GACN,OAAOw2C,GAAE5iD,KAAK+sD,aAAc3gD,EAAE2gD,cAElCjO,QAAQ1yC,GACJ,OAAOpM,KAAK+sD,eAAiB3gD,EAAE2gD,cAIvCD,GAAGO,kBAAoB,IAAIP,GAAG,IAE9B,MAAMQ,GAAK,IAAIh1B,OAAO,iDAKlB,SAASi1B,GAAGnhD,GAIZ,GAAImuB,KAAInuB,GAAI,iBAAmBA,EAAG,CAI9B,IAAI9I,EAAI,EACR,MAAMoV,EAAI40C,GAAGz9C,KAAKzD,GAClB,GAAImuB,KAAI7hB,GAAIA,EAAE,GAAI,CAEd,IAAItM,EAAIsM,EAAE,GACVtM,GAAKA,EAAI,aAAayiB,OAAO,EAAG,GAAIvrB,EAAIuc,OAAOzT,GAG3C,MAAM3B,EAAI,IAAIT,KAAKoC,GAC3B,MAAO,CACH62C,QAASr4C,KAAKixB,MAAMpxB,EAAE24C,UAAY,KAClCoK,MAAOlqD,GAGf,MAAO,CACH2/C,QAASwK,GAAGrhD,EAAE62C,SACduK,MAAOC,GAAGrhD,EAAEohD,QAOhB,SAASC,GAAGrhD,GAEZ,MAAO,iBAAmBA,EAAIA,EAAI,iBAAmBA,EAAIyT,OAAOzT,GAAK,EAGH,SAASshD,GAAGthD,GAC9E,MAAO,iBAAmBA,EAAI0gD,GAAGa,iBAAiBvhD,GAAK0gD,GAAGc,eAAexhD,GAoCzE,SAASyhD,GAAGzhD,GACZ,IAAI9I,EAAGoV,EACP,MAAO,sBAAwB,QAAUA,IAAM,QAAUpV,EAAI,MAAQ8I,OAAI,EAASA,EAAE0hD,gBAAa,IAAWxqD,OAAI,EAASA,EAAEwiD,SAAW,IAAIiI,gBAAa,IAAWr1C,OAAI,EAASA,EAAEs1C,aAYrL,SAASC,GAAG7hD,GACR,MAAM9I,EAAI8I,EAAE0hD,SAAShI,OAAOoI,mBAC5B,OAAOL,GAAGvqD,GAAK2qD,GAAG3qD,GAAKA,EAKvB,SAAS6qD,GAAG/hD,GACZ,MAAM9I,EAAIiqD,GAAGnhD,EAAE0hD,SAAShI,OAAOsI,qBAAqBC,gBACpD,OAAO,IAAIrL,GAAG1/C,EAAE2/C,QAAS3/C,EAAEkqD,OAkB3B,MAAMc,GAAK,CACXR,SAAU,CACNhI,OAAQ,CACJiI,SAAU,CACNC,YAAa,cAI1BO,GAAK,CACJC,UAAW,cAIf,SAASC,GAAGriD,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,EAAIyhD,GAAGzhD,GAAK,EAAyCsiD,GAAGtiD,GAAK,iBAA4C,GAAiCggC,KAG7kB,SAASuiB,GAAGviD,EAAG9I,GACxF,GAAI8I,IAAM9I,EAAG,OAAO,EACpB,MAAMoV,EAAI+1C,GAAGriD,GACb,GAAIsM,IAAM+1C,GAAGnrD,GAAI,OAAO,EACxB,OAAQoV,GACN,KAAK,EACL,KAAK,iBACH,OAAO,EAET,KAAK,EACH,OAAOtM,EAAEwiD,eAAiBtrD,EAAEsrD,aAE9B,KAAK,EACH,OAAOT,GAAG/hD,GAAG0yC,QAAQqP,GAAG7qD,IAE1B,KAAK,EACH,OAAO,SAAS8I,EAAG9I,GACf,GAAI,iBAAmB8I,EAAEiiD,gBAAkB,iBAAmB/qD,EAAE+qD,gBAAkBjiD,EAAEiiD,eAAe/uD,SAAWgE,EAAE+qD,eAAe/uD,OAE/H,OAAO8M,EAAEiiD,iBAAmB/qD,EAAE+qD,eAC9B,MAAM31C,EAAI60C,GAAGnhD,EAAEiiD,gBAAiB5jD,EAAI8iD,GAAGjqD,EAAE+qD,gBACzC,OAAO31C,EAAEuqC,UAAYx4C,EAAEw4C,SAAWvqC,EAAE80C,QAAU/iD,EAAE+iD,MAL7C,CAMLphD,EAAG9I,GAEP,KAAK,EACH,OAAO8I,EAAE4hD,cAAgB1qD,EAAE0qD,YAE7B,KAAK,EACH,OAAO,SAAS5hD,EAAG9I,GACf,OAAOoqD,GAAGthD,EAAEyiD,YAAY/P,QAAQ4O,GAAGpqD,EAAEurD,aADlC,CAELziD,EAAG9I,GAEP,KAAK,EACH,OAAO8I,EAAE0iD,iBAAmBxrD,EAAEwrD,eAEhC,KAAK,EACH,OAAO,SAAS1iD,EAAG9I,GACf,OAAOmqD,GAAGrhD,EAAE2iD,cAAcC,YAAcvB,GAAGnqD,EAAEyrD,cAAcC,WAAavB,GAAGrhD,EAAE2iD,cAAcE,aAAexB,GAAGnqD,EAAEyrD,cAAcE,WAD1H,CAEL7iD,EAAG9I,GAEP,KAAK,EACH,OAAO,SAAS8I,EAAG9I,GACf,GAAI,iBAAkB8I,GAAK,iBAAkB9I,EAAG,OAAOmqD,GAAGrhD,EAAE8iD,gBAAkBzB,GAAGnqD,EAAE4rD,cACnF,GAAI,gBAAiB9iD,GAAK,gBAAiB9I,EAAG,CAC1C,MAAMoV,EAAI+0C,GAAGrhD,EAAE+iD,aAAc1kD,EAAIgjD,GAAGnqD,EAAE6rD,aACtC,OAAOz2C,IAAMjO,EAAI+hD,GAAG9zC,KAAO8zC,GAAG/hD,GAAKkkB,MAAMjW,IAAMiW,MAAMlkB,GAEzD,OAAO,EANJ,CAOL2B,EAAG9I,GAEP,KAAK,EACH,OAAOu/C,GAAGz2C,EAAEgjD,WAAW3jC,QAAU,GAAInoB,EAAE8rD,WAAW3jC,QAAU,GAAIkjC,IAElE,KAAK,GACH,OAAO,SAASviD,EAAG9I,GACf,MAAMoV,EAAItM,EAAE0hD,SAAShI,QAAU,GAAIr7C,EAAInH,EAAEwqD,SAAShI,QAAU,GAC5D,GAAIsG,GAAG1zC,KAAO0zC,GAAG3hD,GAAI,OAAO,EAC5B,IAAK,MAAM2B,KAAKsM,EAAG,GAAIA,EAAEnL,eAAenB,UAAO,IAAW3B,EAAE2B,KAAOuiD,GAAGj2C,EAAEtM,GAAI3B,EAAE2B,KAAM,OAAO,EAC3F,OAAO,EAJJ,CAMgEA,EAAG9I,GAE5E,QACE,OAAO8oC,MAIf,SAASijB,GAAGjjD,EAAG9I,GACX,YAAO,KAAY8I,EAAEqf,QAAU,IAAIqtB,MAAM1sC,GAAKuiD,GAAGviD,EAAG9I,KAGxD,SAASgsD,GAAGljD,EAAG9I,GACX,GAAI8I,IAAM9I,EAAG,OAAO,EACpB,MAAMoV,EAAI+1C,GAAGriD,GAAI3B,EAAIgkD,GAAGnrD,GACxB,GAAIoV,IAAMjO,EAAG,OAAOm4C,GAAElqC,EAAGjO,GACzB,OAAQiO,GACN,KAAK,EACL,KAAK,iBACH,OAAO,EAET,KAAK,EACH,OAAOkqC,GAAEx2C,EAAEwiD,aAActrD,EAAEsrD,cAE7B,KAAK,EACH,OAAO,SAASxiD,EAAG9I,GACf,MAAMoV,EAAI+0C,GAAGrhD,EAAE8iD,cAAgB9iD,EAAE+iD,aAAc1kD,EAAIgjD,GAAGnqD,EAAE4rD,cAAgB5rD,EAAE6rD,aAC1E,OAAOz2C,EAAIjO,GAAK,EAAIiO,EAAIjO,EAAI,EAAIiO,IAAMjO,EAAI,EAE1CkkB,MAAMjW,GAAKiW,MAAMlkB,GAAK,GAAK,EAAI,EAJ5B,CAKL2B,EAAG9I,GAEP,KAAK,EACH,OAAOisD,GAAGnjD,EAAEiiD,eAAgB/qD,EAAE+qD,gBAEhC,KAAK,EACH,OAAOkB,GAAGpB,GAAG/hD,GAAI+hD,GAAG7qD,IAEtB,KAAK,EACH,OAAOs/C,GAAEx2C,EAAE4hD,YAAa1qD,EAAE0qD,aAE5B,KAAK,EACH,OAAO,SAAS5hD,EAAG9I,GACf,MAAMoV,EAAIg1C,GAAGthD,GAAI3B,EAAIijD,GAAGpqD,GACxB,OAAOoV,EAAEmrC,UAAUp5C,GAFhB,CAGL2B,EAAEyiD,WAAYvrD,EAAEurD,YAEpB,KAAK,EACH,OAAO,SAASziD,EAAG9I,GACf,MAAMoV,EAAItM,EAAE8F,MAAM,KAAMzH,EAAInH,EAAE4O,MAAM,KACpC,IAAK,IAAI9F,EAAI,EAAGA,EAAIsM,EAAEpZ,QAAU8M,EAAI3B,EAAEnL,OAAQ8M,IAAK,CAC/C,MAAM9I,EAAIs/C,GAAElqC,EAAEtM,GAAI3B,EAAE2B,IACpB,GAAI,IAAM9I,EAAG,OAAOA,EAExB,OAAOs/C,GAAElqC,EAAEpZ,OAAQmL,EAAEnL,QANlB,CAOL8M,EAAE0iD,eAAgBxrD,EAAEwrD,gBAExB,KAAK,EACH,OAAO,SAAS1iD,EAAG9I,GACf,MAAMoV,EAAIkqC,GAAE6K,GAAGrhD,EAAE4iD,UAAWvB,GAAGnqD,EAAE0rD,WACjC,OAAI,IAAMt2C,EAAUA,EACbkqC,GAAE6K,GAAGrhD,EAAE6iD,WAAYxB,GAAGnqD,EAAE2rD,YAH5B,CAIL7iD,EAAE2iD,cAAezrD,EAAEyrD,eAEvB,KAAK,EACH,OAAO,SAAS3iD,EAAG9I,GACf,MAAMoV,EAAItM,EAAEqf,QAAU,GAAIhhB,EAAInH,EAAEmoB,QAAU,GAC1C,IAAK,IAAIrf,EAAI,EAAGA,EAAIsM,EAAEpZ,QAAU8M,EAAI3B,EAAEnL,SAAU8M,EAAG,CAC/C,MAAM9I,EAAIgsD,GAAG52C,EAAEtM,GAAI3B,EAAE2B,IACrB,GAAI9I,EAAG,OAAOA,EAElB,OAAOs/C,GAAElqC,EAAEpZ,OAAQmL,EAAEnL,QANlB,CAOL8M,EAAEgjD,WAAY9rD,EAAE8rD,YAEpB,KAAK,GACH,OAAO,SAAShjD,EAAG9I,GACf,GAAI8I,IAAMkiD,GAAGR,UAAYxqD,IAAMgrD,GAAGR,SAAU,OAAO,EACnD,GAAI1hD,IAAMkiD,GAAGR,SAAU,OAAO,EAC9B,GAAIxqD,IAAMgrD,GAAGR,SAAU,OAAQ,EAC/B,MAAMp1C,EAAItM,EAAE05C,QAAU,GAAIr7C,EAAItF,OAAOkC,KAAKqR,GAAIrZ,EAAIiE,EAAEwiD,QAAU,GAAIpE,EAAIv8C,OAAOkC,KAAKhI,GAKlFoL,EAAE+kD,OAAQ9N,EAAE8N,OACZ,IAAK,IAAIpjD,EAAI,EAAGA,EAAI3B,EAAEnL,QAAU8M,EAAIs1C,EAAEpiD,SAAU8M,EAAG,CAC/C,MAAM9I,EAAIs/C,GAAEn4C,EAAE2B,GAAIs1C,EAAEt1C,IACpB,GAAI,IAAM9I,EAAG,OAAOA,EACpB,MAAMm+C,EAAI6N,GAAG52C,EAAEjO,EAAE2B,IAAK/M,EAAEqiD,EAAEt1C,KAC1B,GAAI,IAAMq1C,EAAG,OAAOA,EAExB,OAAOmB,GAAEn4C,EAAEnL,OAAQoiD,EAAEpiD,QAhBlB,CAqBV8M,EAAE0hD,SAAUxqD,EAAEwqD,UAEb,QACE,MAAM1hB,MAId,SAASmjB,GAAGnjD,EAAG9I,GACX,GAAI,iBAAmB8I,GAAK,iBAAmB9I,GAAK8I,EAAE9M,SAAWgE,EAAEhE,OAAQ,OAAOsjD,GAAEx2C,EAAG9I,GACvF,MAAMoV,EAAI60C,GAAGnhD,GAAI3B,EAAI8iD,GAAGjqD,GAAIjE,EAAIujD,GAAElqC,EAAEuqC,QAASx4C,EAAEw4C,SAC/C,OAAO,IAAM5jD,EAAIA,EAAIujD,GAAElqC,EAAE80C,MAAO/iD,EAAE+iD,OAGtC,SAASiC,GAAGrjD,GACR,OAAOsjD,GAAGtjD,GAGd,SAASsjD,GAAGtjD,GACR,MAAO,cAAeA,EAAI,OAAS,iBAAkBA,EAAI,GAAKA,EAAEwiD,aAAe,iBAAkBxiD,EAAI,GAAKA,EAAE8iD,aAAe,gBAAiB9iD,EAAI,GAAKA,EAAE+iD,YAAc,mBAAoB/iD,EAAI,SAASA,GAClM,MAAM9I,EAAIiqD,GAAGnhD,GACb,MAAO,QAAQ9I,EAAE2/C,WAAW3/C,EAAEkqD,SAF2J,CAG3LphD,EAAEiiD,gBAAkB,gBAAiBjiD,EAAIA,EAAE4hD,YAAc,eAAgB5hD,EAAIshD,GAAGthD,EAAEyiD,YAAY3B,WAAa,mBAAoB9gD,GAAKsM,EAAItM,EAAE0iD,eAC5IzJ,GAAGsK,SAASj3C,GAAGrT,YAAc,kBAAmB+G,EAAI,QAAQ9I,EAAI8I,EAAE2iD,eAAeC,YAAY1rD,EAAE2rD,aAAe,eAAgB7iD,EAAI,SAASA,GACvI,IAAI9I,EAAI,IAAKoV,GAAI,EACjB,IAAK,MAAMjO,KAAK2B,EAAEqf,QAAU,GAAI/S,EAAIA,GAAI,EAAKpV,GAAK,IAAKA,GAAKosD,GAAGjlD,GAC/D,OAAOnH,EAAI,IAHmH,CAK7D8I,EAAEgjD,YAAc,aAAchjD,EAAI,SAASA,GAG5G,MAAM9I,EAAI6B,OAAOkC,KAAK+E,EAAE05C,QAAU,IAAI0J,OACtC,IAAI92C,EAAI,IAAKjO,GAAI,EACjB,IAAK,MAAMpL,KAAKiE,EAAGmH,EAAIA,GAAI,EAAKiO,GAAK,IAAKA,GAAK,GAAGrZ,KAAKqwD,GAAGtjD,EAAE05C,OAAOzmD,MACnE,OAAOqZ,EAAI,IANwF,CAOrGtM,EAAE0hD,UAAY1hB,KAChB,IAAI9oC,EAAGoV,EAGX,SAASk3C,GAAGxjD,EAAG9I,GACX,MAAO,CACHwrD,eAAgB,YAAY1iD,EAAE6/C,uBAAuB7/C,EAAE8/C,sBAAsB5oD,EAAE+5B,KAAK0nB,qBAIxC,SAAS8K,GAAGzjD,GAC5D,QAASA,GAAK,iBAAkBA,EAKpC,SAAS0jD,GAAG1jD,GACR,QAASA,GAAK,eAAgBA,EAGa,SAAS2jD,GAAG3jD,GACvD,QAASA,GAAK,cAAeA,EAGM,SAAS4jD,GAAG5jD,GAC/C,QAASA,GAAK,gBAAiBA,GAAKuiB,MAAM9O,OAAOzT,EAAE+iD,cAGT,SAASc,GAAG7jD,GACtD,QAASA,GAAK,aAAcA,EAGQ,SAAS8jD,GAAG9jD,GAChD,GAAIA,EAAE2iD,cAAe,MAAO,CACxBA,cAAe5pD,OAAOgrD,OAAO,GAAI/jD,EAAE2iD,gBAEvC,GAAI3iD,EAAEiiD,gBAAkB,iBAAmBjiD,EAAEiiD,eAAgB,MAAO,CAChEA,eAAgBlpD,OAAOgrD,OAAO,GAAI/jD,EAAEiiD,iBAExC,GAAIjiD,EAAE0hD,SAAU,CACZ,MAAMxqD,EAAI,CACNwqD,SAAU,CACNhI,OAAQ,KAGhB,OAAOuG,GAAGjgD,EAAE0hD,SAAShI,QAAS,CAAC15C,EAAGsM,IAAMpV,EAAEwqD,SAAShI,OAAO15C,GAAK8jD,GAAGx3C,KAAMpV,EAE5E,GAAI8I,EAAEgjD,WAAY,CACd,MAAM9rD,EAAI,CACN8rD,WAAY,CACR3jC,OAAQ,KAGhB,IAAK,IAAI/S,EAAI,EAAGA,GAAKtM,EAAEgjD,WAAW3jC,QAAU,IAAInsB,SAAUoZ,EAAGpV,EAAE8rD,WAAW3jC,OAAO/S,GAAKw3C,GAAG9jD,EAAEgjD,WAAW3jC,OAAO/S,IAC7G,OAAOpV,EAEX,OAAO6B,OAAOgrD,OAAO,GAAI/jD,GAGkD,SAASsiD,GAAGtiD,GACvF,MAAO,eAAiBA,EAAE0hD,UAAY,IAAIhI,QAAU,IAAIiI,UAAY,IAAIC,YAGN,SAASrhD,GAAGP,GAC9E,MAAO,cAAeA,EAAImiD,GAAK,iBAAkBniD,EAAI,CACjDwiD,cAAc,GACd,iBAAkBxiD,GAAK,gBAAiBA,EAAI,CAC5C+iD,YAAaiB,KACb,mBAAoBhkD,EAAI,CACxBiiD,eAAgB,CACZpL,QAASpjC,OAAO+sC,mBAEpB,gBAAiBxgD,EAAI,CACrB4hD,YAAa,IACb,eAAgB5hD,EAAI,CACpByiD,WAAY,IACZ,mBAAoBziD,EAAIwjD,GAAG5D,GAAGnF,QAASxB,GAAGwB,SAAW,kBAAmBz6C,EAAI,CAC5E2iD,cAAe,CACXC,UAAW,GACXC,WAAY,MAEhB,eAAgB7iD,EAAI,CACpBgjD,WAAY,IACZ,aAAchjD,EAAI,CAClB0hD,SAAU,IACV1hB,KAG+D,SAASikB,GAAGjkD,GAC/E,MAAO,cAAeA,EAAI,CACtBwiD,cAAc,GACd,iBAAkBxiD,EAAI,CACtB+iD,YAAaiB,KACb,iBAAkBhkD,GAAK,gBAAiBA,EAAI,CAC5CiiD,eAAgB,CACZpL,QAASpjC,OAAO+sC,mBAEpB,mBAAoBxgD,EAAI,CACxB4hD,YAAa,IACb,gBAAiB5hD,EAAI,CACrByiD,WAAY,IACZ,eAAgBziD,EAAIwjD,GAAG5D,GAAGnF,QAASxB,GAAGwB,SAAW,mBAAoBz6C,EAAI,CACzE2iD,cAAe,CACXC,UAAW,GACXC,WAAY,MAEhB,kBAAmB7iD,EAAI,CACvBgjD,WAAY,IACZ,eAAgBhjD,EAAI,CACpB0hD,SAAU,IACV,aAAc1hD,EAAIkiD,GAAKliB,KAG/B,SAASkkB,GAAGlkD,EAAG9I,GACX,MAAMoV,EAAI42C,GAAGljD,EAAEtF,MAAOxD,EAAEwD,OACxB,OAAO,IAAM4R,EAAIA,EAAItM,EAAEmkD,YAAcjtD,EAAEitD,WAAa,GAAKnkD,EAAEmkD,WAAajtD,EAAEitD,UAAY,EAAI,EAG9F,SAASC,GAAGpkD,EAAG9I,GACX,MAAMoV,EAAI42C,GAAGljD,EAAEtF,MAAOxD,EAAEwD,OACxB,OAAO,IAAM4R,EAAIA,EAAItM,EAAEmkD,YAAcjtD,EAAEitD,UAAY,GAAKnkD,EAAEmkD,WAAajtD,EAAEitD,WAAa,EAAI,EAgC1F,MAAME,GACN9qD,YAAYyG,EAAG9I,GACXtD,KAAK0wD,SAAWtkD,EAAGpM,KAAKuwD,UAAYjtD,GAI5C,SAASqtD,GAAGvkD,EAAG9I,EAAGoV,GACd,IAAIjO,EAAI,EACR,IAAK,IAAIpL,EAAI,EAAGA,EAAI+M,EAAEskD,SAASpxD,OAAQD,IAAK,CACxC,MAAMqiD,EAAIp+C,EAAEjE,GAAIoiD,EAAIr1C,EAAEskD,SAASrxD,GAI/B,GAH0BoL,EAAtBi3C,EAAEkP,MAAMxL,aAAkBC,GAAGlB,WAAWkB,GAAGsK,SAASlO,EAAEqN,gBAAiBp2C,EAAE7R,KACrEyoD,GAAG7N,EAAG/oC,EAAElS,KAAKoqD,MAAMlP,EAAEkP,QAEzB,SAAsClP,EAAEmP,MAAQpmD,IAAM,GAAI,IAAMA,EAAG,MAE3E,OAAOA,EAMP,SAASqmD,GAAG1kD,EAAG9I,GACf,GAAI,OAAS8I,EAAG,OAAO,OAAS9I,EAChC,GAAI,OAASA,EAAG,OAAO,EACvB,GAAI8I,EAAEmkD,YAAcjtD,EAAEitD,WAAankD,EAAEskD,SAASpxD,SAAWgE,EAAEotD,SAASpxD,OAAQ,OAAO,EACnF,IAAK,IAAIoZ,EAAI,EAAGA,EAAItM,EAAEskD,SAASpxD,OAAQoZ,IACnC,IAAKi2C,GAAGviD,EAAEskD,SAASh4C,GAAIpV,EAAEotD,SAASh4C,IAAK,OAAO,EAElD,OAAO,EAkBP,MAAMq4C,IAEV,MAAMC,WAAWD,GACbprD,YAAYyG,EAAG9I,EAAGoV,GACd3S,QAAS/F,KAAK4wD,MAAQxkD,EAAGpM,KAAKixD,GAAK3tD,EAAGtD,KAAK8G,MAAQ4R,EAIhDiqC,cAAcv2C,EAAG9I,EAAGoV,GACvB,OAAOtM,EAAEg5C,aAAe,OAA2B9hD,GAAK,WAAmCA,EAAItD,KAAKkxD,uBAAuB9kD,EAAG9I,EAAGoV,GAAK,IAAIy4C,GAAG/kD,EAAG9I,EAAGoV,GAAK,mBAAmDpV,EAAI,IAAI8tD,GAAGhlD,EAAGsM,GAAK,OAA2BpV,EAAI,IAAI+tD,GAAGjlD,EAAGsM,GAAK,WAAmCpV,EAAI,IAAIguD,GAAGllD,EAAGsM,GAAK,uBAA2DpV,EAAI,IAAIiuD,GAAGnlD,EAAGsM,GAAK,IAAIs4C,GAAG5kD,EAAG9I,EAAGoV,GAEjaiqC,8BAA8Bv2C,EAAG9I,EAAGoV,GAChC,MAAO,OAA2BpV,EAAI,IAAIkuD,GAAGplD,EAAGsM,GAAK,IAAI+4C,GAAGrlD,EAAGsM,GAEnEg5C,QAAQtlD,GACJ,MAAM9I,EAAI8I,EAAE5F,KAAKoqD,MAAM5wD,KAAK4wD,OAEpB,MAAO,OAAkC5wD,KAAKixD,GAAK,OAAS3tD,GAAKtD,KAAK2xD,kBAAkBrC,GAAGhsD,EAAGtD,KAAK8G,QAAU,OAASxD,GAAKmrD,GAAGzuD,KAAK8G,SAAW2nD,GAAGnrD,IAAMtD,KAAK2xD,kBAAkBrC,GAAGhsD,EAAGtD,KAAK8G,QAGrM6qD,kBAAkBvlD,GACd,OAAQpM,KAAKixD,IACX,IAAK,IACH,OAAO7kD,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,OAAOggC,MAGfwlB,eACI,MAAO,CAAE,IAA+B,KAAyC,IAAkC,KAA4C,KAAgC,UAAiC7lD,QAAQ/L,KAAKixD,KAAO,EAExPY,sBACI,MAAO,CAAE7xD,MAEb8xD,aACI,MAAO,CAAE9xD,MAEb+xD,0BACI,OAAO/xD,KAAK4xD,eAAiB5xD,KAAK4wD,MAAQ,MAIlD,MAAMz7C,WAAW47C,GACbprD,YAAYyG,EAAG9I,GACXyC,QAAS/F,KAAKgyD,QAAU5lD,EAAGpM,KAAKixD,GAAK3tD,EAAGtD,KAAKgmD,GAAK,KAI/CrD,cAAcv2C,EAAG9I,GACpB,OAAO,IAAI6R,GAAG/I,EAAG9I,GAErBouD,QAAQtlD,GACJ,OAAO6lD,GAAGjyD,WAAQ,IAAWA,KAAKgyD,QAAQlZ,MAAMx1C,IAAMA,EAAEouD,QAAQtlD,UAAO,IAAWpM,KAAKgyD,QAAQlZ,MAAMx1C,GAAKA,EAAEouD,QAAQtlD,KAExHylD,sBACI,OAAO,OAAS7xD,KAAKgmD,KAAOhmD,KAAKgmD,GAAKhmD,KAAKgyD,QAAQE,QAAM,CAAG9lD,EAAG9I,IAAM8I,EAAEmP,OAAOjY,EAAEuuD,wBAAyB,KACzG7xD,KAAKgmD,GAGT8L,aACI,OAAO3sD,OAAOgrD,OAAO,GAAInwD,KAAKgyD,SAElCD,0BACI,MAAM3lD,EAAIpM,KAAKkmD,IAAI95C,GAAKA,EAAEwlD,iBAC1B,OAAO,OAASxlD,EAAIA,EAAEwkD,MAAQ,KAKlC1K,GAAG95C,GACC,IAAK,MAAM9I,KAAKtD,KAAK6xD,sBAAuB,GAAIzlD,EAAE9I,GAAI,OAAOA,EAC7D,OAAO,MAIf,SAAS2uD,GAAG7lD,GACR,MAAO,QAAsCA,EAAE6kD,GAGnD,SAASkB,GAAG/lD,GACR,MAAO,OAAoCA,EAAE6kD,GAK7C,SAASmB,GAAGhmD,GACZ,OAAOimD,GAAGjmD,IAAM6lD,GAAG7lD,GAKnB,SAASimD,GAAGjmD,GACZ,IAAK,MAAM9I,KAAK8I,EAAE4lD,QAAS,GAAI1uD,aAAa6R,GAAI,OAAO,EACvD,OAAO,EAGX,SAASm9C,GAAGlmD,GACR,GAAIA,aAAa4kD,GAIjB,OAAO5kD,EAAEwkD,MAAM7L,kBAAoB34C,EAAE6kD,GAAG5rD,WAAaoqD,GAAGrjD,EAAEtF,OAC1D,GAAIsrD,GAAGhmD,GAOP,OAAOA,EAAE4lD,QAAQlgB,KAAK1lC,GAAKkmD,GAAGlmD,KAAK7K,KAAK,KACxC,CAEI,MAAM+B,EAAI8I,EAAE4lD,QAAQlgB,KAAK1lC,GAAKkmD,GAAGlmD,KAAK7K,KAAK,KAC3C,MAAO,GAAG6K,EAAE6kD,MAAM3tD,MAI1B,SAASivD,GAAGnmD,EAAG9I,GACX,OAAO8I,aAAa4kD,GAAK,SAAS5kD,EAAG9I,GACjC,OAAOA,aAAa0tD,IAAM5kD,EAAE6kD,KAAO3tD,EAAE2tD,IAAM7kD,EAAEwkD,MAAM9R,QAAQx7C,EAAEstD,QAAUjC,GAAGviD,EAAEtF,MAAOxD,EAAEwD,OADhE,CAEvBsF,EAAG9I,GAAK8I,aAAa+I,GAAK,SAAS/I,EAAG9I,GACpC,OAAIA,aAAa6R,IAAM/I,EAAE6kD,KAAO3tD,EAAE2tD,IAAM7kD,EAAE4lD,QAAQ1yD,SAAWgE,EAAE0uD,QAAQ1yD,QAC5D8M,EAAE4lD,QAAQE,QAAQ,CAAC9lD,EAAGsM,EAAGjO,IAAM2B,GAAKmmD,GAAG75C,EAAGpV,EAAE0uD,QAAQvnD,MAAM,GAF7C,CAS3B2B,EAAG9I,QAAU8oC,KAGlB,SAASomB,GAAGpmD,EAAG9I,GACX,MAAMoV,EAAItM,EAAE4lD,QAAQz2C,OAAOjY,GAC3B,OAAO6R,GAAG/O,OAAOsS,EAAGtM,EAAE6kD,IAGuB,SAASwB,GAAGrmD,GACzD,OAAOA,aAAa4kD,GAAK,SAAS5kD,GAC9B,MAAO,GAAGA,EAAEwkD,MAAM7L,qBAAqB34C,EAAE6kD,MAAMxB,GAAGrjD,EAAEtF,SAD/B,CAGoCsF,GAAKA,aAAa+I,GAAK,SAAS/I,GACzF,OAAOA,EAAE6kD,GAAG5rD,WAAa,KAAO+G,EAAE0lD,aAAahgB,IAAI2gB,IAAIlxD,KAAK,MAAQ,IADY,CAElF6K,GAAK,SAGX,MAAM+kD,WAAWH,GACbrrD,YAAYyG,EAAG9I,EAAGoV,GACd3S,MAAMqG,EAAG9I,EAAGoV,GAAI1Y,KAAK6G,IAAMw+C,GAAGsK,SAASj3C,EAAEo2C,gBAE7C4C,QAAQtlD,GACJ,MAAM9I,EAAI+hD,GAAGlB,WAAW/3C,EAAEvF,IAAK7G,KAAK6G,KACpC,OAAO7G,KAAK2xD,kBAAkBruD,IAIoB,MAAMkuD,WAAWR,GACvErrD,YAAYyG,EAAG9I,GACXyC,MAAMqG,EAAG,KAAyB9I,GAAItD,KAAKqH,KAAOqrD,GAAG,KAAyBpvD,GAElFouD,QAAQtlD,GACJ,OAAOpM,KAAKqH,KAAKsrD,MAAMrvD,GAAKA,EAAEw7C,QAAQ1yC,EAAEvF,QAIsB,MAAM4qD,WAAWT,GACnFrrD,YAAYyG,EAAG9I,GACXyC,MAAMqG,EAAG,SAAiC9I,GAAItD,KAAKqH,KAAOqrD,GAAG,SAAiCpvD,GAElGouD,QAAQtlD,GACJ,OAAQpM,KAAKqH,KAAKsrD,MAAMrvD,GAAKA,EAAEw7C,QAAQ1yC,EAAEvF,QAIjD,SAAS6rD,GAAGtmD,EAAG9I,GACX,IAAIoV,EACJ,QAAS,QAAUA,EAAIpV,EAAE8rD,kBAAe,IAAW12C,OAAI,EAASA,EAAE+S,SAAW,IAAIqmB,KAAK1lC,GAAKi5C,GAAGsK,SAASvjD,EAAE0iD,kBAGhD,MAAMsC,WAAWJ,GAC1ErrD,YAAYyG,EAAG9I,GACXyC,MAAMqG,EAAG,iBAAiD9I,GAE9DouD,QAAQtlD,GACJ,MAAM9I,EAAI8I,EAAE5F,KAAKoqD,MAAM5wD,KAAK4wD,OAC5B,OAAOd,GAAGxsD,IAAM+rD,GAAG/rD,EAAE8rD,WAAYpvD,KAAK8G,QAIG,MAAMuqD,WAAWL,GAC9DrrD,YAAYyG,EAAG9I,GACXyC,MAAMqG,EAAG,KAAyB9I,GAEtCouD,QAAQtlD,GACJ,MAAM9I,EAAI8I,EAAE5F,KAAKoqD,MAAM5wD,KAAK4wD,OAC5B,OAAO,OAASttD,GAAK+rD,GAAGrvD,KAAK8G,MAAMsoD,WAAY9rD,IAIF,MAAMguD,WAAWN,GAClErrD,YAAYyG,EAAG9I,GACXyC,MAAMqG,EAAG,SAAiC9I,GAE9CouD,QAAQtlD,GACJ,GAAIijD,GAAGrvD,KAAK8G,MAAMsoD,WAAY,CAC1BZ,UAAW,eACX,OAAO,EACX,MAAMlrD,EAAI8I,EAAE5F,KAAKoqD,MAAM5wD,KAAK4wD,OAC5B,OAAO,OAASttD,IAAM+rD,GAAGrvD,KAAK8G,MAAMsoD,WAAY9rD,IAIS,MAAMiuD,WAAWP,GAC9ErrD,YAAYyG,EAAG9I,GACXyC,MAAMqG,EAAG,qBAAyD9I,GAEtEouD,QAAQtlD,GACJ,MAAM9I,EAAI8I,EAAE5F,KAAKoqD,MAAM5wD,KAAK4wD,OAC5B,SAAUd,GAAGxsD,KAAOA,EAAE8rD,WAAW3jC,SAAWnoB,EAAE8rD,WAAW3jC,OAAOknC,MAAMvmD,GAAKijD,GAAGrvD,KAAK8G,MAAMsoD,WAAYhjD,MAsBzG,MAAMwmD,GACNjtD,YAAYyG,EAAG9I,EAAI,OACftD,KAAK4wD,MAAQxkD,EAAGpM,KAAK6wD,IAAMvtD,GAInC,SAASuvD,GAAGzmD,EAAG9I,GACX,OAAO8I,EAAEykD,MAAQvtD,EAAEutD,KAAOzkD,EAAEwkD,MAAM9R,QAAQx7C,EAAEstD,OAqBhD,MAAMkC,GACFntD,YAAYyG,EAAG9I,GACXtD,KAAKmkD,WAAa/3C,EAAGpM,KAAK+yD,KAAOzvD,GAAK0vD,GAAGC,MAG7CC,OAAO9mD,EAAG9I,GACN,OAAO,IAAIwvD,GAAG9yD,KAAKmkD,WAAYnkD,KAAK+yD,KAAKG,OAAO9mD,EAAG9I,EAAGtD,KAAKmkD,YAAYgP,KAAK,KAAM,KAAMH,GAAGI,MAAO,KAAM,OAG5Gj3C,OAAO/P,GACH,OAAO,IAAI0mD,GAAG9yD,KAAKmkD,WAAYnkD,KAAK+yD,KAAK52C,OAAO/P,EAAGpM,KAAKmkD,YAAYgP,KAAK,KAAM,KAAMH,GAAGI,MAAO,KAAM,OAGzGhkD,IAAIhD,GACA,IAAI9I,EAAItD,KAAK+yD,KACb,MAAOzvD,EAAEqhD,WAAa,CAClB,MAAMjsC,EAAI1Y,KAAKmkD,WAAW/3C,EAAG9I,EAAEuD,KAC/B,GAAI,IAAM6R,EAAG,OAAOpV,EAAEwD,MACtB4R,EAAI,EAAIpV,EAAIA,EAAEyM,KAAO2I,EAAI,IAAMpV,EAAIA,EAAE0M,OAEzC,OAAO,KAIXjE,QAAQK,GAEJ,IAAI9I,EAAI,EAAGoV,EAAI1Y,KAAK+yD,KACpB,MAAOr6C,EAAEisC,WAAa,CAClB,MAAMl6C,EAAIzK,KAAKmkD,WAAW/3C,EAAGsM,EAAE7R,KAC/B,GAAI,IAAM4D,EAAG,OAAOnH,EAAIoV,EAAE3I,KAAK2U,KAC/Bja,EAAI,EAAIiO,EAAIA,EAAE3I,MAEdzM,GAAKoV,EAAE3I,KAAK2U,KAAO,EAAGhM,EAAIA,EAAE1I,OAGxB,OAAQ,EAEpB20C,UACI,OAAO3kD,KAAK+yD,KAAKpO,UAGjBjgC,WACA,OAAO1kB,KAAK+yD,KAAKruC,KAGrB2uC,SACI,OAAOrzD,KAAK+yD,KAAKM,SAGrBC,SACI,OAAOtzD,KAAK+yD,KAAKO,SAMrBC,iBAAiBnnD,GACb,OAAOpM,KAAK+yD,KAAKQ,iBAAiBnnD,GAEtC8J,QAAQ9J,GACJpM,KAAKuzD,kBAAgB,CAAGjwD,EAAGoV,KAAOtM,EAAE9I,EAAGoV,IAAI,KAE/CrT,WACI,MAAM+G,EAAI,GACV,OAAOpM,KAAKuzD,kBAAkB,CAACjwD,EAAGoV,KAAOtM,EAAE9K,KAAK,GAAGgC,KAAKoV,MAAM,KAAO,IAAItM,EAAE7K,KAAK,SAOpFiyD,iBAAiBpnD,GACb,OAAOpM,KAAK+yD,KAAKS,iBAAiBpnD,GAGtCqnD,cACI,OAAO,IAAIC,GAAG1zD,KAAK+yD,KAAM,KAAM/yD,KAAKmkD,YAAY,GAEpDwP,gBAAgBvnD,GACZ,OAAO,IAAIsnD,GAAG1zD,KAAK+yD,KAAM3mD,EAAGpM,KAAKmkD,YAAY,GAEjDyP,qBACI,OAAO,IAAIF,GAAG1zD,KAAK+yD,KAAM,KAAM/yD,KAAKmkD,YAAY,GAEpD0P,uBAAuBznD,GACnB,OAAO,IAAIsnD,GAAG1zD,KAAK+yD,KAAM3mD,EAAGpM,KAAKmkD,YAAY,IAMrD,MAAMuP,GACF/tD,YAAYyG,EAAG9I,EAAGoV,EAAGjO,GACjBzK,KAAK8zD,UAAYrpD,EAAGzK,KAAK+zD,UAAY,GACrC,IAAI10D,EAAI,EACR,MAAO+M,EAAEu4C,WAAa,GAAItlD,EAAIiE,EAAIoV,EAAEtM,EAAEvF,IAAKvD,GAAK,EAEhDA,GAAKmH,IAAMpL,IAAM,GAAIA,EAAI,EAEzB+M,EAAIpM,KAAK8zD,UAAY1nD,EAAE2D,KAAO3D,EAAE4D,UAAY,CACxC,GAAI,IAAM3Q,EAAG,CAGTW,KAAK+zD,UAAUzyD,KAAK8K,GACpB,MAIJpM,KAAK+zD,UAAUzyD,KAAK8K,GAAIA,EAAIpM,KAAK8zD,UAAY1nD,EAAE4D,MAAQ5D,EAAE2D,MAGjEikD,UACI,IAAI5nD,EAAIpM,KAAK+zD,UAAUE,MACvB,MAAM3wD,EAAI,CACNuD,IAAKuF,EAAEvF,IACPC,MAAOsF,EAAEtF,OAEb,GAAI9G,KAAK8zD,UAAW,IAAK1nD,EAAIA,EAAE2D,MAAO3D,EAAEu4C,WAAa3kD,KAAK+zD,UAAUzyD,KAAK8K,GAAIA,EAAIA,EAAE4D,WAAY,IAAK5D,EAAIA,EAAE4D,OAAQ5D,EAAEu4C,WAAa3kD,KAAK+zD,UAAUzyD,KAAK8K,GACrJA,EAAIA,EAAE2D,KACN,OAAOzM,EAEX4wD,UACI,OAAOl0D,KAAK+zD,UAAUz0D,OAAS,EAEnC60D,OACI,GAAI,IAAMn0D,KAAK+zD,UAAUz0D,OAAQ,OAAO,KACxC,MAAM8M,EAAIpM,KAAK+zD,UAAU/zD,KAAK+zD,UAAUz0D,OAAS,GACjD,MAAO,CACHuH,IAAKuF,EAAEvF,IACPC,MAAOsF,EAAEtF,QAOrB,MAAMksD,GACFrtD,YAAYyG,EAAG9I,EAAGoV,EAAGjO,EAAGpL,GACpBW,KAAK6G,IAAMuF,EAAGpM,KAAK8G,MAAQxD,EAAGtD,KAAKo0D,MAAQ,MAAQ17C,EAAIA,EAAIs6C,GAAGqB,IAAKr0D,KAAK+P,KAAO,MAAQtF,EAAIA,EAAIuoD,GAAGC,MAClGjzD,KAAKgQ,MAAQ,MAAQ3Q,EAAIA,EAAI2zD,GAAGC,MAAOjzD,KAAK0kB,KAAO1kB,KAAK+P,KAAK2U,KAAO,EAAI1kB,KAAKgQ,MAAM0U,KAGvFyuC,KAAK/mD,EAAG9I,EAAGoV,EAAGjO,EAAGpL,GACb,OAAO,IAAI2zD,GAAG,MAAQ5mD,EAAIA,EAAIpM,KAAK6G,IAAK,MAAQvD,EAAIA,EAAItD,KAAK8G,MAAO,MAAQ4R,EAAIA,EAAI1Y,KAAKo0D,MAAO,MAAQ3pD,EAAIA,EAAIzK,KAAK+P,KAAM,MAAQ1Q,EAAIA,EAAIW,KAAKgQ,OAEpJ20C,UACI,OAAO,EAMX4O,iBAAiBnnD,GACb,OAAOpM,KAAK+P,KAAKwjD,iBAAiBnnD,IAAMA,EAAEpM,KAAK6G,IAAK7G,KAAK8G,QAAU9G,KAAKgQ,MAAMujD,iBAAiBnnD,GAMnGonD,iBAAiBpnD,GACb,OAAOpM,KAAKgQ,MAAMwjD,iBAAiBpnD,IAAMA,EAAEpM,KAAK6G,IAAK7G,KAAK8G,QAAU9G,KAAK+P,KAAKyjD,iBAAiBpnD,GAGnGolC,MACI,OAAOxxC,KAAK+P,KAAK40C,UAAY3kD,KAAOA,KAAK+P,KAAKyhC,MAGlD6hB,SACI,OAAOrzD,KAAKwxC,MAAM3qC,IAGtBysD,SACI,OAAOtzD,KAAKgQ,MAAM20C,UAAY3kD,KAAK6G,IAAM7G,KAAKgQ,MAAMsjD,SAGxDJ,OAAO9mD,EAAG9I,EAAGoV,GACT,IAAIjO,EAAIzK,KACR,MAAMX,EAAIqZ,EAAEtM,EAAG3B,EAAE5D,KACjB,OAAO4D,EAAIpL,EAAI,EAAIoL,EAAE0oD,KAAK,KAAM,KAAM,KAAM1oD,EAAEsF,KAAKmjD,OAAO9mD,EAAG9I,EAAGoV,GAAI,MAAQ,IAAMrZ,EAAIoL,EAAE0oD,KAAK,KAAM7vD,EAAG,KAAM,KAAM,MAAQmH,EAAE0oD,KAAK,KAAM,KAAM,KAAM,KAAM1oD,EAAEuF,MAAMkjD,OAAO9mD,EAAG9I,EAAGoV,IAC9KjO,EAAE6pD,QAENC,YACI,GAAIv0D,KAAK+P,KAAK40C,UAAW,OAAOqO,GAAGC,MACnC,IAAI7mD,EAAIpM,KACR,OAAOoM,EAAE2D,KAAKykD,SAAWpoD,EAAE2D,KAAKA,KAAKykD,UAAYpoD,EAAIA,EAAEqoD,eAAgBroD,EAAIA,EAAE+mD,KAAK,KAAM,KAAM,KAAM/mD,EAAE2D,KAAKwkD,YAAa,MACxHnoD,EAAEkoD,QAGNn4C,OAAO/P,EAAG9I,GACN,IAAIoV,EAAGjO,EAAIzK,KACX,GAAIsD,EAAE8I,EAAG3B,EAAE5D,KAAO,EAAG4D,EAAEsF,KAAK40C,WAAal6C,EAAEsF,KAAKykD,SAAW/pD,EAAEsF,KAAKA,KAAKykD,UAAY/pD,EAAIA,EAAEgqD,eACzFhqD,EAAIA,EAAE0oD,KAAK,KAAM,KAAM,KAAM1oD,EAAEsF,KAAKoM,OAAO/P,EAAG9I,GAAI,UAAY,CAC1D,GAAImH,EAAEsF,KAAKykD,UAAY/pD,EAAIA,EAAEiqD,eAAgBjqD,EAAEuF,MAAM20C,WAAal6C,EAAEuF,MAAMwkD,SAAW/pD,EAAEuF,MAAMD,KAAKykD,UAAY/pD,EAAIA,EAAEkqD,gBACpH,IAAMrxD,EAAE8I,EAAG3B,EAAE5D,KAAM,CACf,GAAI4D,EAAEuF,MAAM20C,UAAW,OAAOqO,GAAGC,MACjCv6C,EAAIjO,EAAEuF,MAAMwhC,MAAO/mC,EAAIA,EAAE0oD,KAAKz6C,EAAE7R,IAAK6R,EAAE5R,MAAO,KAAM,KAAM2D,EAAEuF,MAAMukD,aAEtE9pD,EAAIA,EAAE0oD,KAAK,KAAM,KAAM,KAAM,KAAM1oD,EAAEuF,MAAMmM,OAAO/P,EAAG9I,IAEzD,OAAOmH,EAAE6pD,QAEbE,QACI,OAAOx0D,KAAKo0D,MAGhBE,QACI,IAAIloD,EAAIpM,KACR,OAAOoM,EAAE4D,MAAMwkD,UAAYpoD,EAAE2D,KAAKykD,UAAYpoD,EAAIA,EAAEwoD,cAAexoD,EAAE2D,KAAKykD,SAAWpoD,EAAE2D,KAAKA,KAAKykD,UAAYpoD,EAAIA,EAAEsoD,eACnHtoD,EAAE2D,KAAKykD,SAAWpoD,EAAE4D,MAAMwkD,UAAYpoD,EAAIA,EAAEyoD,aAAczoD,EAE9DqoD,cACI,IAAIroD,EAAIpM,KAAK60D,YACb,OAAOzoD,EAAE4D,MAAMD,KAAKykD,UAAYpoD,EAAIA,EAAE+mD,KAAK,KAAM,KAAM,KAAM,KAAM/mD,EAAE4D,MAAM0kD,eAC3EtoD,EAAIA,EAAEwoD,aAAcxoD,EAAIA,EAAEyoD,aAAczoD,EAE5CuoD,eACI,IAAIvoD,EAAIpM,KAAK60D,YACb,OAAOzoD,EAAE2D,KAAKA,KAAKykD,UAAYpoD,EAAIA,EAAEsoD,cAAetoD,EAAIA,EAAEyoD,aAAczoD,EAE5EwoD,aACI,MAAMxoD,EAAIpM,KAAKmzD,KAAK,KAAM,KAAMH,GAAGqB,IAAK,KAAMr0D,KAAKgQ,MAAMD,MACzD,OAAO/P,KAAKgQ,MAAMmjD,KAAK,KAAM,KAAMnzD,KAAKo0D,MAAOhoD,EAAG,MAEtDsoD,cACI,MAAMtoD,EAAIpM,KAAKmzD,KAAK,KAAM,KAAMH,GAAGqB,IAAKr0D,KAAK+P,KAAKC,MAAO,MACzD,OAAOhQ,KAAK+P,KAAKojD,KAAK,KAAM,KAAMnzD,KAAKo0D,MAAO,KAAMhoD,GAExDyoD,YACI,MAAMzoD,EAAIpM,KAAK+P,KAAKojD,KAAK,KAAM,MAAOnzD,KAAK+P,KAAKqkD,MAAO,KAAM,MAAO9wD,EAAItD,KAAKgQ,MAAMmjD,KAAK,KAAM,MAAOnzD,KAAKgQ,MAAMokD,MAAO,KAAM,MAC7H,OAAOp0D,KAAKmzD,KAAK,KAAM,MAAOnzD,KAAKo0D,MAAOhoD,EAAG9I,GAGjDwxD,gBACI,MAAM1oD,EAAIpM,KAAK+0D,QACf,OAAOnqD,KAAKoqD,IAAI,EAAG5oD,IAAMpM,KAAK0kB,KAAO,EAIzCqwC,QACI,GAAI/0D,KAAKw0D,SAAWx0D,KAAK+P,KAAKykD,QAAS,MAAMpoB,KAC7C,GAAIpsC,KAAKgQ,MAAMwkD,QAAS,MAAMpoB,KAC9B,MAAMhgC,EAAIpM,KAAK+P,KAAKglD,QACpB,GAAI3oD,IAAMpM,KAAKgQ,MAAM+kD,QAAS,MAAM3oB,KACpC,OAAOhgC,GAAKpM,KAAKw0D,QAAU,EAAI,IAOvCxB,GAAGC,MAAQ,KAAMD,GAAGqB,KAAM,EAAIrB,GAAGI,OAAQ,EAGzCJ,GAAGC,MAAQ,IAEX,MACIttD,cACI3F,KAAK0kB,KAAO,EAEZ7d,UACA,MAAMulC,KAENtlC,YACA,MAAMslC,KAENgoB,YACA,MAAMhoB,KAENr8B,WACA,MAAMq8B,KAENp8B,YACA,MAAMo8B,KAGV+mB,KAAK/mD,EAAG9I,EAAGoV,EAAGjO,EAAGpL,GACb,OAAOW,KAGXkzD,OAAO9mD,EAAG9I,EAAGoV,GACT,OAAO,IAAIs6C,GAAG5mD,EAAG9I,GAGrB6Y,OAAO/P,EAAG9I,GACN,OAAOtD,KAEX2kD,UACI,OAAO,EAEX4O,iBAAiBnnD,GACb,OAAO,EAEXonD,iBAAiBpnD,GACb,OAAO,EAEXinD,SACI,OAAO,KAEXC,SACI,OAAO,KAEXkB,QACI,OAAO,EAGXM,gBACI,OAAO,EAEXC,QACI,OAAO,IA2Bf,MAAME,GACFtvD,YAAYyG,GACRpM,KAAKmkD,WAAa/3C,EAAGpM,KAAKwG,KAAO,IAAIssD,GAAG9yD,KAAKmkD,YAEjDzlB,IAAItyB,GACA,OAAO,OAASpM,KAAKwG,KAAK4I,IAAIhD,GAElC8oD,QACI,OAAOl1D,KAAKwG,KAAK6sD,SAErB8B,OACI,OAAOn1D,KAAKwG,KAAK8sD,SAEjB5uC,WACA,OAAO1kB,KAAKwG,KAAKke,KAErB3Y,QAAQK,GACJ,OAAOpM,KAAKwG,KAAKuF,QAAQK,GAEgC8J,QAAQ9J,GACjEpM,KAAKwG,KAAK+sD,kBAAkB,CAACjwD,EAAGoV,KAAOtM,EAAE9I,IAAI,KAE6B8xD,eAAehpD,EAAG9I,GAC5F,MAAMoV,EAAI1Y,KAAKwG,KAAKmtD,gBAAgBvnD,EAAE,IACtC,KAAMsM,EAAEw7C,WAAa,CACjB,MAAMzpD,EAAIiO,EAAEs7C,UACZ,GAAIh0D,KAAKmkD,WAAW15C,EAAE5D,IAAKuF,EAAE,KAAO,EAAG,OACvC9I,EAAEmH,EAAE5D,MAKLwuD,aAAajpD,EAAG9I,GACnB,IAAIoV,EACJ,IAAKA,OAAI,IAAWpV,EAAItD,KAAKwG,KAAKmtD,gBAAgBrwD,GAAKtD,KAAKwG,KAAKitD,cAAe/6C,EAAEw7C,WAC9E,IAAK9nD,EAAEsM,EAAEs7C,UAAUntD,KAAM,OAGkCyuD,kBAAkBlpD,GACjF,MAAM9I,EAAItD,KAAKwG,KAAKmtD,gBAAgBvnD,GACpC,OAAO9I,EAAE4wD,UAAY5wD,EAAE0wD,UAAUntD,IAAM,KAE3C4sD,cACI,OAAO,IAAI8B,GAAGv1D,KAAKwG,KAAKitD,eAE5BE,gBAAgBvnD,GACZ,OAAO,IAAImpD,GAAGv1D,KAAKwG,KAAKmtD,gBAAgBvnD,IAEJsL,IAAItL,GACxC,OAAOpM,KAAKmzD,KAAKnzD,KAAKwG,KAAK2V,OAAO/P,GAAG8mD,OAAO9mD,GAAG,IAEtBuyB,OAAOvyB,GAChC,OAAOpM,KAAK0+B,IAAItyB,GAAKpM,KAAKmzD,KAAKnzD,KAAKwG,KAAK2V,OAAO/P,IAAMpM,KAE1D2kD,UACI,OAAO3kD,KAAKwG,KAAKm+C,UAErB6Q,UAAUppD,GACN,IAAI9I,EAAItD,KAEA,OAAOsD,EAAEohB,KAAOtY,EAAEsY,OAASphB,EAAI8I,EAAGA,EAAIpM,MAAOoM,EAAE8J,SAAS9J,IAC5D9I,EAAIA,EAAEoU,IAAItL,MACT9I,EAETw7C,QAAQ1yC,GACJ,KAAMA,aAAa6oD,IAAK,OAAO,EAC/B,GAAIj1D,KAAK0kB,OAAStY,EAAEsY,KAAM,OAAO,EACjC,MAAMphB,EAAItD,KAAKwG,KAAKitD,cAAe/6C,EAAItM,EAAE5F,KAAKitD,cAC9C,KAAMnwD,EAAE4wD,WAAa,CACjB,MAAM9nD,EAAI9I,EAAE0wD,UAAUntD,IAAK4D,EAAIiO,EAAEs7C,UAAUntD,IAC3C,GAAI,IAAM7G,KAAKmkD,WAAW/3C,EAAG3B,GAAI,OAAO,EAE5C,OAAO,EAEXoD,UACI,MAAMzB,EAAI,GACV,OAAOpM,KAAKkW,SAAS5S,IACjB8I,EAAE9K,KAAKgC,MACN8I,EAET/G,WACI,MAAM+G,EAAI,GACV,OAAOpM,KAAKkW,SAAS5S,GAAK8I,EAAE9K,KAAKgC,KAAM,aAAe8I,EAAE/G,WAAa,IAEzE8tD,KAAK/mD,GACD,MAAM9I,EAAI,IAAI2xD,GAAGj1D,KAAKmkD,YACtB,OAAO7gD,EAAEkD,KAAO4F,EAAG9I,GAI3B,MAAMiyD,GACF5vD,YAAYyG,GACRpM,KAAKkoC,KAAO97B,EAEhB4nD,UACI,OAAOh0D,KAAKkoC,KAAK8rB,UAAUntD,IAE/BqtD,UACI,OAAOl0D,KAAKkoC,KAAKgsB,WAwBzB,SAASuB,GAAGrpD,GACR,OAAOA,EAAE8nD,UAAY9nD,EAAE4nD,eAAY,EA4BnC,MAAM0B,GACN/vD,YAAYyG,GACRpM,KAAK8lD,OAAS15C,EAGdA,EAAEojD,KAAKtK,GAAGf,YAEdxB,eACI,OAAO,IAAI+S,GAAG,IAKXF,UAAUppD,GACb,IAAI9I,EAAI,IAAI2xD,GAAG/P,GAAGf,YAClB,IAAK,MAAM/3C,KAAKpM,KAAK8lD,OAAQxiD,EAAIA,EAAEoU,IAAItL,GACvC,IAAK,MAAMsM,KAAKtM,EAAG9I,EAAIA,EAAEoU,IAAIgB,GAC7B,OAAO,IAAIg9C,GAAGpyD,EAAEuK,WAOb8nD,OAAOvpD,GACV,IAAK,MAAM9I,KAAKtD,KAAK8lD,OAAQ,GAAIxiD,EAAEshD,WAAWx4C,GAAI,OAAO,EACzD,OAAO,EAEX0yC,QAAQ1yC,GACJ,OAAOy2C,GAAG7iD,KAAK8lD,OAAQ15C,EAAE05C,QAAM,CAAI15C,EAAG9I,IAAM8I,EAAE0yC,QAAQx7C,MAuB1D,MAAMsyD,GACNjwD,YAAYyG,GACRpM,KAAK8G,MAAQsF,EAEjBu2C,eACI,OAAO,IAAIiT,GAAG,CACV9H,SAAU,KAQX8C,MAAMxkD,GACT,GAAIA,EAAEu4C,UAAW,OAAO3kD,KAAK8G,MAC7B,CACI,IAAIxD,EAAItD,KAAK8G,MACb,IAAK,IAAI4R,EAAI,EAAGA,EAAItM,EAAE9M,OAAS,IAAKoZ,EAAG,GAAIpV,GAAKA,EAAEwqD,SAAShI,QAAU,IAAI15C,EAAEgD,IAAIsJ,KAC9Eu3C,GAAG3sD,GAAI,OAAO,KACf,OAAOA,GAAKA,EAAEwqD,SAAShI,QAAU,IAAI15C,EAAEs4C,eAAgBphD,GAAK,MAQ7D+Z,IAAIjR,EAAG9I,GACVtD,KAAK61D,aAAazpD,EAAEo4C,WAAWp4C,EAAEs4C,eAAiBwL,GAAG5sD,GAMlDwyD,OAAO1pD,GACV,IAAI9I,EAAI4hD,GAAGK,YAAa7sC,EAAI,GAAIjO,EAAI,GACpC2B,EAAE8J,SAAO,CAAG9J,EAAG/M,KACX,IAAKiE,EAAEuhD,oBAAoBxlD,GAAI,CAE3B,MAAM+M,EAAIpM,KAAK61D,aAAavyD,GAC5BtD,KAAK+1D,aAAa3pD,EAAGsM,EAAGjO,GAAIiO,EAAI,GAAIjO,EAAI,GAAInH,EAAIjE,EAAEmlD,UAEtDp4C,EAAIsM,EAAErZ,EAAEqlD,eAAiBwL,GAAG9jD,GAAK3B,EAAEnJ,KAAKjC,EAAEqlD,kBAE9C,MAAMrlD,EAAIW,KAAK61D,aAAavyD,GAC5BtD,KAAK+1D,aAAa12D,EAAGqZ,EAAGjO,GAOrBk0B,OAAOvyB,GACV,MAAM9I,EAAItD,KAAK4wD,MAAMxkD,EAAEo4C,WACvByL,GAAG3sD,IAAMA,EAAEwqD,SAAShI,eAAiBxiD,EAAEwqD,SAAShI,OAAO15C,EAAEs4C,eAE7D5F,QAAQ1yC,GACJ,OAAOuiD,GAAG3uD,KAAK8G,MAAOsF,EAAEtF,OAKrB+uD,aAAazpD,GAChB,IAAI9I,EAAItD,KAAK8G,MACbxD,EAAEwqD,SAAShI,SAAWxiD,EAAEwqD,SAAW,CAC/BhI,OAAQ,KAEZ,IAAK,IAAIptC,EAAI,EAAGA,EAAItM,EAAE9M,SAAUoZ,EAAG,CAC/B,IAAIjO,EAAInH,EAAEwqD,SAAShI,OAAO15C,EAAEgD,IAAIsJ,IAChCu3C,GAAGxlD,IAAMA,EAAEqjD,SAAShI,SAAWr7C,EAAI,CAC/BqjD,SAAU,CACNhI,OAAQ,KAEbxiD,EAAEwqD,SAAShI,OAAO15C,EAAEgD,IAAIsJ,IAAMjO,GAAInH,EAAImH,EAE7C,OAAOnH,EAAEwqD,SAAShI,OAKfiQ,aAAa3pD,EAAG9I,EAAGoV,GACtB2zC,GAAG/oD,GAAI,CAACA,EAAGoV,IAAMtM,EAAE9I,GAAKoV,IACxB,IAAK,MAAMpV,KAAKoV,SAAUtM,EAAE9I,GAEhC+S,QACI,OAAO,IAAIu/C,GAAG1F,GAAGlwD,KAAK8G,SAM1B,SAASkvD,GAAG5pD,GACZ,MAAM9I,EAAI,GACV,OAAO+oD,GAAGjgD,EAAE05C,QAAM,CAAI15C,EAAGsM,KACrB,MAAMjO,EAAI,IAAIy6C,GAAG,CAAE94C,IACnB,GAAI6jD,GAAGv3C,GAAI,CACP,MAAMtM,EAAI4pD,GAAGt9C,EAAEo1C,UAAUhI,OACzB,GAAI,IAAM15C,EAAE9M,OAEZgE,EAAEhC,KAAKmJ,QAGP,IAAK,MAAMiO,KAAKtM,EAAG9I,EAAEhC,KAAKmJ,EAAE25C,MAAM1rC,SAItCpV,EAAEhC,KAAKmJ,MACN,IAAIirD,GAAGpyD,GA4BZ,MAAM2yD,GACNtwD,YAAYyG,EAAG9I,EAAGoV,EAAGjO,EAAGpL,EAAGqiD,EAAGD,GAC1BzhD,KAAK6G,IAAMuF,EAAGpM,KAAKk2D,aAAe5yD,EAAGtD,KAAKqR,QAAUqH,EAAG1Y,KAAK+mD,SAAWt8C,EAAGzK,KAAKm2D,WAAa92D,EAC5FW,KAAKwG,KAAOk7C,EAAG1hD,KAAKo2D,cAAgB3U,EAKjCkB,0BAA0Bv2C,GAC7B,OAAO,IAAI6pD,GAAG7pD,EAAG,EACHu3C,GAAGnS,MACFmS,GAAGnS,MACDmS,GAAGnS,MAAOokB,GAAG/O,QAAS,GAKpClE,wBAAwBv2C,EAAG9I,EAAGoV,EAAGjO,GACpC,OAAO,IAAIwrD,GAAG7pD,EAAG,EACH9I,EACCqgD,GAAGnS,MACD94B,EAAGjO,EAAG,GAEuDk4C,qBAAqBv2C,EAAG9I,GACtG,OAAO,IAAI2yD,GAAG7pD,EAAG,EACH9I,EACCqgD,GAAGnS,MACDmS,GAAGnS,MAAOokB,GAAG/O,QAAS,GAMpClE,0BAA0Bv2C,EAAG9I,GAChC,OAAO,IAAI2yD,GAAG7pD,EAAG,EACH9I,EACCqgD,GAAGnS,MACDmS,GAAGnS,MAAOokB,GAAG/O,QAAS,GAKpCwP,uBAAuBjqD,EAAG9I,GAM7B,OAAQtD,KAAKm2D,WAAWrX,QAAQ6E,GAAGnS,QAAU,IAAqCxxC,KAAKk2D,cAAgB,IAAiCl2D,KAAKk2D,eAAiBl2D,KAAKm2D,WAAa/pD,GAChLpM,KAAKqR,QAAUjF,EAAGpM,KAAKk2D,aAAe,EAAsCl2D,KAAKwG,KAAOlD,EACxFtD,KAAKo2D,cAAgB,EAA+Bp2D,KAKjDs2D,oBAAoBlqD,GACvB,OAAOpM,KAAKqR,QAAUjF,EAAGpM,KAAKk2D,aAAe,EAC7Cl2D,KAAKwG,KAAOovD,GAAG/O,QAAS7mD,KAAKo2D,cAAgB,EAA+Bp2D,KAMzEu2D,yBAAyBnqD,GAC5B,OAAOpM,KAAKqR,QAAUjF,EAAGpM,KAAKk2D,aAAe,EAC7Cl2D,KAAKwG,KAAOovD,GAAG/O,QAAS7mD,KAAKo2D,cAAgB,EAC7Cp2D,KAEJw2D,2BACI,OAAOx2D,KAAKo2D,cAAgB,EAAgDp2D,KAEhFy2D,uBACI,OAAOz2D,KAAKo2D,cAAgB,EAA4Cp2D,KAAKqR,QAAUsyC,GAAGnS,MAC1FxxC,KAEJ02D,YAAYtqD,GACR,OAAOpM,KAAK+mD,SAAW36C,EAAGpM,KAE1B22D,wBACA,OAAO,IAA8C32D,KAAKo2D,cAE1DQ,4BACA,OAAO,IAAkD52D,KAAKo2D,cAE9DS,uBACA,OAAO72D,KAAK22D,mBAAqB32D,KAAK42D,sBAE1CE,kBACI,OAAO,IAAiC92D,KAAKk2D,aAEjDa,kBACI,OAAO,IAAwC/2D,KAAKk2D,aAExDc,eACI,OAAO,IAAqCh3D,KAAKk2D,aAErDe,oBACI,OAAO,IAA0Cj3D,KAAKk2D,aAE1DpX,QAAQ1yC,GACJ,OAAOA,aAAa6pD,IAAMj2D,KAAK6G,IAAIi4C,QAAQ1yC,EAAEvF,MAAQ7G,KAAKqR,QAAQytC,QAAQ1yC,EAAEiF,UAAYrR,KAAKk2D,eAAiB9pD,EAAE8pD,cAAgBl2D,KAAKo2D,gBAAkBhqD,EAAEgqD,eAAiBp2D,KAAKwG,KAAKs4C,QAAQ1yC,EAAE5F,MAElM0wD,cACI,OAAO,IAAIjB,GAAGj2D,KAAK6G,IAAK7G,KAAKk2D,aAAcl2D,KAAKqR,QAASrR,KAAK+mD,SAAU/mD,KAAKm2D,WAAYn2D,KAAKwG,KAAK6P,QAASrW,KAAKo2D,eAErH/wD,WACI,MAAO,YAAYrF,KAAK6G,QAAQ7G,KAAKqR,YAAY1N,KAAKuY,UAAUlc,KAAKwG,KAAKM,wBAAwB9G,KAAKm2D,gCAAgCn2D,KAAKk2D,mCAAmCl2D,KAAKo2D,mBAyB5L,MAAMe,GACFxxD,YAAYyG,EAAG9I,EAAI,KAAMoV,EAAI,GAAIjO,EAAI,GAAIpL,EAAI,KAAMqiD,EAAI,KAAMD,EAAI,MAC7DzhD,KAAKq9B,KAAOjxB,EAAGpM,KAAKwlD,gBAAkBliD,EAAGtD,KAAKo3D,QAAU1+C,EAAG1Y,KAAKgyD,QAAUvnD,EAAGzK,KAAKqkD,MAAQhlD,EAC1FW,KAAKq3D,QAAU3V,EAAG1hD,KAAKs3D,MAAQ7V,EAAGzhD,KAAKmmD,GAAK,MAWhD,SAASoR,GAAGnrD,EAAG9I,EAAI,KAAMoV,EAAI,GAAIjO,EAAI,GAAIpL,EAAI,KAAMqiD,EAAI,KAAMD,EAAI,MACjE,OAAO,IAAI0V,GAAG/qD,EAAG9I,EAAGoV,EAAGjO,EAAGpL,EAAGqiD,EAAGD,GAGpC,SAAS+V,GAAGprD,GACR,MAAM9I,EAAIs8C,GAAExzC,GACZ,GAAI,OAAS9I,EAAE6iD,GAAI,CACf,IAAI/5C,EAAI9I,EAAE+5B,KAAK0nB,kBACf,OAASzhD,EAAEkiD,kBAAoBp5C,GAAK,OAAS9I,EAAEkiD,iBAAkBp5C,GAAK,MAAOA,GAAK9I,EAAE0uD,QAAQlgB,KAAK1lC,GAAKkmD,GAAGlmD,KAAK7K,KAAK,KACnH6K,GAAK,OAAQA,GAAK9I,EAAE8zD,QAAQtlB,KAAK1lC,GAAK,SAASA,GAE3C,OAAOA,EAAEwkD,MAAM7L,kBAAoB34C,EAAEykD,IAFH,CAGpCzkD,KAAK7K,KAAK,KAAMgrD,GAAGjpD,EAAE+gD,SAAWj4C,GAAK,MAAOA,GAAK9I,EAAE+gD,OAAQ/gD,EAAE+zD,UAAYjrD,GAAK,OAChFA,GAAK9I,EAAE+zD,QAAQ9G,UAAY,KAAO,KAAMnkD,GAAK9I,EAAE+zD,QAAQ3G,SAAS5e,KAAK1lC,GAAKqjD,GAAGrjD,KAAK7K,KAAK,MACvF+B,EAAEg0D,QAAUlrD,GAAK,OAAQA,GAAK9I,EAAEg0D,MAAM/G,UAAY,KAAO,KAAMnkD,GAAK9I,EAAEg0D,MAAM5G,SAAS5e,KAAK1lC,GAAKqjD,GAAGrjD,KAAK7K,KAAK,MAC5G+B,EAAE6iD,GAAK/5C,EAEX,OAAO9I,EAAE6iD,GAGb,SAASsR,GAAGrrD,EAAG9I,GACX,GAAI8I,EAAEi4C,QAAU/gD,EAAE+gD,MAAO,OAAO,EAChC,GAAIj4C,EAAEgrD,QAAQ93D,SAAWgE,EAAE8zD,QAAQ93D,OAAQ,OAAO,EAClD,IAAK,IAAIoZ,EAAI,EAAGA,EAAItM,EAAEgrD,QAAQ93D,OAAQoZ,IAAK,IAAKm6C,GAAGzmD,EAAEgrD,QAAQ1+C,GAAIpV,EAAE8zD,QAAQ1+C,IAAK,OAAO,EACvF,GAAItM,EAAE4lD,QAAQ1yD,SAAWgE,EAAE0uD,QAAQ1yD,OAAQ,OAAO,EAClD,IAAK,IAAIoZ,EAAI,EAAGA,EAAItM,EAAE4lD,QAAQ1yD,OAAQoZ,IAAK,IAAK65C,GAAGnmD,EAAE4lD,QAAQt5C,GAAIpV,EAAE0uD,QAAQt5C,IAAK,OAAO,EACvF,OAAOtM,EAAEo5C,kBAAoBliD,EAAEkiD,mBAAsBp5C,EAAEixB,KAAKyhB,QAAQx7C,EAAE+5B,SAAYyzB,GAAG1kD,EAAEirD,QAAS/zD,EAAE+zD,UAAYvG,GAAG1kD,EAAEkrD,MAAOh0D,EAAEg0D,OAGhI,SAASI,GAAGtrD,GACR,OAAOi5C,GAAGsS,cAAcvrD,EAAEixB,OAAS,OAASjxB,EAAEo5C,iBAAmB,IAAMp5C,EAAE4lD,QAAQ1yD,OAGlB,SAASs4D,GAAGxrD,EAAG9I,GAC9E,OAAO8I,EAAE4lD,QAAQhN,QAAQ54C,GAAKA,aAAa4kD,IAAM5kD,EAAEwkD,MAAM9R,QAAQx7C,KAWrE,SAASu0D,GAAGzrD,EAAG9I,EAAGoV,GACd,IAAIjO,EAAI8jD,GAAIlvD,GAAI,EAEhB,IAAK,MAAMqZ,KAAKk/C,GAAGxrD,EAAG9I,GAAI,CACtB,IAAI8I,EAAImiD,GAAIjrD,GAAI,EAChB,OAAQoV,EAAEu4C,IACR,IAAK,IACL,IAAK,KACH7kD,EAAIO,GAAG+L,EAAE5R,OACT,MAEF,IAAK,KACL,IAAK,KACL,IAAK,KACHsF,EAAIsM,EAAE5R,MACN,MAEF,IAAK,IACHsF,EAAIsM,EAAE5R,MAAOxD,GAAI,EACjB,MAEF,IAAK,KACL,IAAK,SACH8I,EAAImiD,GAGR+B,GAAG,CACCxpD,MAAO2D,EACP8lD,UAAWlxD,GACZ,CACCyH,MAAOsF,EACPmkD,UAAWjtD,IACV,IAAMmH,EAAI2B,EAAG/M,EAAIiE,GAItB,GAAI,OAASoV,EAAG,IAAK,IAAIgpC,EAAI,EAAGA,EAAIt1C,EAAEgrD,QAAQ93D,SAAUoiD,EACxD,GAAIt1C,EAAEgrD,QAAQ1V,GAAGkP,MAAM9R,QAAQx7C,GAAI,CAC/B,MAAM8I,EAAIsM,EAAEg4C,SAAShP,GACrB4O,GAAG,CACCxpD,MAAO2D,EACP8lD,UAAWlxD,GACZ,CACCyH,MAAOsF,EACPmkD,UAAW73C,EAAE63C,YACZ,IAAM9lD,EAAI2B,EAAG/M,EAAIqZ,EAAE63C,WACxB,MAGR,MAAO,CACHzpD,MAAO2D,EACP8lD,UAAWlxD,GAOf,SAASy4D,GAAG1rD,EAAG9I,EAAGoV,GAClB,IAAIjO,EAAI6jD,GAAIjvD,GAAI,EAEhB,IAAK,MAAMqZ,KAAKk/C,GAAGxrD,EAAG9I,GAAI,CACtB,IAAI8I,EAAIkiD,GAAIhrD,GAAI,EAChB,OAAQoV,EAAEu4C,IACR,IAAK,KACL,IAAK,IACH7kD,EAAIikD,GAAG33C,EAAE5R,OAAQxD,GAAI,EACrB,MAEF,IAAK,KACL,IAAK,KACL,IAAK,KACH8I,EAAIsM,EAAE5R,MACN,MAEF,IAAK,IACHsF,EAAIsM,EAAE5R,MAAOxD,GAAI,EACjB,MAEF,IAAK,KACL,IAAK,SACH8I,EAAIkiD,GAGRkC,GAAG,CACC1pD,MAAO2D,EACP8lD,UAAWlxD,GACZ,CACCyH,MAAOsF,EACPmkD,UAAWjtD,IACV,IAAMmH,EAAI2B,EAAG/M,EAAIiE,GAItB,GAAI,OAASoV,EAAG,IAAK,IAAIgpC,EAAI,EAAGA,EAAIt1C,EAAEgrD,QAAQ93D,SAAUoiD,EACxD,GAAIt1C,EAAEgrD,QAAQ1V,GAAGkP,MAAM9R,QAAQx7C,GAAI,CAC/B,MAAM8I,EAAIsM,EAAEg4C,SAAShP,GACrB8O,GAAG,CACC1pD,MAAO2D,EACP8lD,UAAWlxD,GACZ,CACCyH,MAAOsF,EACPmkD,UAAW73C,EAAE63C,YACZ,IAAM9lD,EAAI2B,EAAG/M,EAAIqZ,EAAE63C,WACxB,MAGR,MAAO,CACHzpD,MAAO2D,EACP8lD,UAAWlxD,GA4BnB,MAAM04D,GAKFpyD,YAAYyG,EAAG9I,EAAI,KAAMoV,EAAI,GAAIjO,EAAI,GAAIpL,EAAI,KAAMqiD,EAAI,IAA4BD,EAAI,KAAMx/C,EAAI,MAC7FjC,KAAKq9B,KAAOjxB,EAAGpM,KAAKwlD,gBAAkBliD,EAAGtD,KAAKg4D,gBAAkBt/C,EAAG1Y,KAAKgyD,QAAUvnD,EAClFzK,KAAKqkD,MAAQhlD,EAAGW,KAAKi4D,UAAYvW,EAAG1hD,KAAKq3D,QAAU5V,EAAGzhD,KAAKs3D,MAAQr1D,EAAGjC,KAAKsmD,GAAK,KAEhFtmD,KAAKomD,GAAK,KAAMpmD,KAAKq3D,QAASr3D,KAAKs3D,OAIoB,SAASY,GAAG9rD,EAAG9I,EAAGoV,EAAGjO,EAAGpL,EAAGqiD,EAAGD,EAAGx/C,GAC5F,OAAO,IAAI81D,GAAG3rD,EAAG9I,EAAGoV,EAAGjO,EAAGpL,EAAGqiD,EAAGD,EAAGx/C,GAGqC,SAASk2D,GAAG/rD,GACpF,OAAO,IAAI2rD,GAAG3rD,GAalB,SAASpB,GAAGoB,GACR,OAAO,IAAMA,EAAE4lD,QAAQ1yD,QAAU,OAAS8M,EAAEi4C,OAAS,MAAQj4C,EAAEirD,SAAW,MAAQjrD,EAAEkrD,QAAU,IAAMlrD,EAAE4rD,gBAAgB14D,QAAU,IAAM8M,EAAE4rD,gBAAgB14D,QAAU8M,EAAE4rD,gBAAgB,GAAGpH,MAAMxL,cAGjM,SAASgT,GAAGhsD,GACR,OAAOA,EAAE4rD,gBAAgB14D,OAAS,EAAI8M,EAAE4rD,gBAAgB,GAAGpH,MAAQ,KAGvE,SAASyH,GAAGjsD,GACR,IAAK,MAAM9I,KAAK8I,EAAE4lD,QAAS,CACvB,MAAM5lD,EAAI9I,EAAEyuD,0BACZ,GAAI,OAAS3lD,EAAG,OAAOA,EAE3B,OAAO,KAWX,SAASksD,GAAGlsD,GACR,OAAO,OAASA,EAAEo5C,gBAOlB,SAAS+S,GAAGnsD,GACZ,MAAM9I,EAAIs8C,GAAExzC,GACZ,GAAI,OAAS9I,EAAEgjD,GAAI,CACfhjD,EAAEgjD,GAAK,GACP,MAAMl6C,EAAIisD,GAAG/0D,GAAIoV,EAAI0/C,GAAG90D,GACxB,GAAI,OAAS8I,GAAK,OAASsM,EAI3BtM,EAAEg5C,cAAgB9hD,EAAEgjD,GAAGhlD,KAAK,IAAIsxD,GAAGxmD,IAAK9I,EAAEgjD,GAAGhlD,KAAK,IAAIsxD,GAAG1N,GAAGsT,WAAY,YAAwC,CAC5G,IAAIpsD,GAAI,EACR,IAAK,MAAMsM,KAAKpV,EAAE00D,gBAAiB10D,EAAEgjD,GAAGhlD,KAAKoX,GAAIA,EAAEk4C,MAAMxL,eAAiBh5C,GAAI,GAC9E,IAAKA,EAAG,CAGJ,MAAMA,EAAI9I,EAAE00D,gBAAgB14D,OAAS,EAAIgE,EAAE00D,gBAAgB10D,EAAE00D,gBAAgB14D,OAAS,GAAGuxD,IAAM,MAC/FvtD,EAAEgjD,GAAGhlD,KAAK,IAAIsxD,GAAG1N,GAAGsT,WAAYpsD,MAI5C,OAAO9I,EAAEgjD,GAKT,SAASmS,GAAGrsD,GACZ,MAAM9I,EAAIs8C,GAAExzC,GACZ,IAAK9I,EAAE8iD,GAAI,GAAI,MAA8B9iD,EAAE20D,UAAW30D,EAAE8iD,GAAKmR,GAAGj0D,EAAE+5B,KAAM/5B,EAAEkiD,gBAAiB+S,GAAGj1D,GAAIA,EAAE0uD,QAAS1uD,EAAE+gD,MAAO/gD,EAAE+zD,QAAS/zD,EAAEg0D,WAAa,CAEhJ,MAAMlrD,EAAI,GACV,IAAK,MAAMsM,KAAK6/C,GAAGj1D,GAAI,CACnB,MAAMA,EAAI,SAAsCoV,EAAEm4C,IAAM,MAAkC,OAC1FzkD,EAAE9K,KAAK,IAAIsxD,GAAGl6C,EAAEk4C,MAAOttD,IAGnB,MAAMoV,EAAIpV,EAAEg0D,MAAQ,IAAI7G,GAAGntD,EAAEg0D,MAAM5G,SAAUptD,EAAEg0D,MAAM/G,WAAa,KAAM9lD,EAAInH,EAAE+zD,QAAU,IAAI5G,GAAGntD,EAAE+zD,QAAQ3G,SAAUptD,EAAE+zD,QAAQ9G,WAAa,KAElJjtD,EAAE8iD,GAAKmR,GAAGj0D,EAAE+5B,KAAM/5B,EAAEkiD,gBAAiBp5C,EAAG9I,EAAE0uD,QAAS1uD,EAAE+gD,MAAO3rC,EAAGjO,GAEnE,OAAOnH,EAAE8iD,GAGb,SAASsS,GAAGtsD,EAAG9I,GACXA,EAAEyuD,0BAA2BsG,GAAGjsD,GAChC,MAAMsM,EAAItM,EAAE4lD,QAAQz2C,OAAO,CAAEjY,IAC7B,OAAO,IAAIy0D,GAAG3rD,EAAEixB,KAAMjxB,EAAEo5C,gBAAiBp5C,EAAE4rD,gBAAgBvsD,QAASiN,EAAGtM,EAAEi4C,MAAOj4C,EAAE6rD,UAAW7rD,EAAEirD,QAASjrD,EAAEkrD,OAG9G,SAASqB,GAAGvsD,EAAG9I,EAAGoV,GACd,OAAO,IAAIq/C,GAAG3rD,EAAEixB,KAAMjxB,EAAEo5C,gBAAiBp5C,EAAE4rD,gBAAgBvsD,QAASW,EAAE4lD,QAAQvmD,QAASnI,EAAGoV,EAAGtM,EAAEirD,QAASjrD,EAAEkrD,OAG9G,SAASsB,GAAGxsD,EAAG9I,GACX,OAAOm0D,GAAGgB,GAAGrsD,GAAIqsD,GAAGn1D,KAAO8I,EAAE6rD,YAAc30D,EAAE20D,UAMjD,SAASY,GAAGzsD,GACR,MAAO,GAAGorD,GAAGiB,GAAGrsD,UAAUA,EAAE6rD,YAGhC,SAASa,GAAG1sD,GACR,MAAO,gBAAgB,SAASA,GAC5B,IAAI9I,EAAI8I,EAAEixB,KAAK0nB,kBACf,OAAO,OAAS34C,EAAEo5C,kBAAoBliD,GAAK,oBAAsB8I,EAAEo5C,iBACnEp5C,EAAE4lD,QAAQ1yD,OAAS,IAAMgE,GAAK,eAAe8I,EAAE4lD,QAAQlgB,KAAK1lC,GAAKqmD,GAAGrmD,KAAK7K,KAAK,UAC9EgrD,GAAGngD,EAAEi4C,SAAW/gD,GAAK,YAAc8I,EAAEi4C,OAAQj4C,EAAEgrD,QAAQ93D,OAAS,IAAMgE,GAAK,eAAe8I,EAAEgrD,QAAQtlB,KAAK1lC,GAAK,SAASA,GACnH,MAAO,GAAGA,EAAEwkD,MAAM7L,sBAAsB34C,EAAEykD,OADgE,CAE5GzkD,KAAK7K,KAAK,UAAW6K,EAAEirD,UAAY/zD,GAAK,cAAeA,GAAK8I,EAAEirD,QAAQ9G,UAAY,KAAO,KAC3FjtD,GAAK8I,EAAEirD,QAAQ3G,SAAS5e,KAAK1lC,GAAKqjD,GAAGrjD,KAAK7K,KAAK,MAAO6K,EAAEkrD,QAAUh0D,GAAK,YACvEA,GAAK8I,EAAEkrD,MAAM/G,UAAY,KAAO,KAAMjtD,GAAK8I,EAAEkrD,MAAM5G,SAAS5e,KAAK1lC,GAAKqjD,GAAGrjD,KAAK7K,KAAK,MACnF,UAAU+B,KATS,CAUrBm1D,GAAGrsD,kBAAkBA,EAAE6rD,aAGoC,SAASc,GAAG3sD,EAAG9I,GAC5E,OAAOA,EAAEyzD,mBAAqB,SAAS3qD,EAAG9I,GACtC,MAAMoV,EAAIpV,EAAEuD,IAAIw2B,KAChB,OAAO,OAASjxB,EAAEo5C,gBAAkBliD,EAAEuD,IAAI4+C,gBAAgBr5C,EAAEo5C,kBAAoBp5C,EAAEixB,KAAKunB,WAAWlsC,GAAK2sC,GAAGsS,cAAcvrD,EAAEixB,MAAQjxB,EAAEixB,KAAKyhB,QAAQpmC,GAAKtM,EAAEixB,KAAKwnB,oBAAoBnsC,GAFvJ,CAO7BtM,EAAG9I,IAAM,SAAS8I,EAAG9I,GAOlB,IAAK,MAAMoV,KAAK6/C,GAAGnsD,GAEnB,IAAKsM,EAAEk4C,MAAMxL,cAAgB,OAAS9hD,EAAEkD,KAAKoqD,MAAMl4C,EAAEk4C,OAAQ,OAAO,EACpE,OAAO,EAVD,CAWRxkD,EAAG9I,IAAM,SAAS8I,EAAG9I,GACnB,IAAK,MAAMoV,KAAKtM,EAAE4lD,QAAS,IAAKt5C,EAAEg5C,QAAQpuD,GAAI,OAAO,EACrD,OAAO,EAFA,CAIsD8I,EAAG9I,IAAM,SAAS8I,EAAG9I,GAClF,QAAI8I,EAAEirD,UAKN,SAASjrD,EAAG9I,EAAGoV,GACX,MAAMjO,EAAIkmD,GAAGvkD,EAAG9I,EAAGoV,GACnB,OAAOtM,EAAEmkD,UAAY9lD,GAAK,EAAIA,EAAI,EAFtC,CAGE2B,EAAEirD,QAASkB,GAAGnsD,GAAI9I,OAChB8I,EAAEkrD,QAAU,SAASlrD,EAAG9I,EAAGoV,GAC3B,MAAMjO,EAAIkmD,GAAGvkD,EAAG9I,EAAGoV,GACnB,OAAOtM,EAAEmkD,UAAY9lD,GAAK,EAAIA,EAAI,EAFtB,CAGd2B,EAAEkrD,MAAOiB,GAAGnsD,GAAI9I,IAboD,CAqBzE8I,EAAG9I,GAGR,SAAS01D,GAAG5sD,GACR,OAAOA,EAAEo5C,kBAAoBp5C,EAAEixB,KAAK/9B,OAAS,GAAK,EAAI8M,EAAEixB,KAAKqnB,cAAgBt4C,EAAEixB,KAAKjuB,IAAIhD,EAAEixB,KAAK/9B,OAAS,IAMxG,SAAS25D,GAAG7sD,GACZ,MAAO,CAAC9I,EAAGoV,KACP,IAAIjO,GAAI,EACR,IAAK,MAAMpL,KAAKk5D,GAAGnsD,GAAI,CACnB,MAAMA,EAAI8sD,GAAG75D,EAAGiE,EAAGoV,GACnB,GAAI,IAAMtM,EAAG,OAAOA,EACpB3B,EAAIA,GAAKpL,EAAEuxD,MAAMxL,aAErB,OAAO,GAIf,SAAS8T,GAAG9sD,EAAG9I,EAAGoV,GACd,MAAMjO,EAAI2B,EAAEwkD,MAAMxL,aAAeC,GAAGlB,WAAW7gD,EAAEuD,IAAK6R,EAAE7R,KAAO,SAASuF,EAAG9I,EAAGoV,GAC1E,MAAMjO,EAAInH,EAAEkD,KAAKoqD,MAAMxkD,GAAI/M,EAAIqZ,EAAElS,KAAKoqD,MAAMxkD,GAC5C,OAAO,OAAS3B,GAAK,OAASpL,EAAIiwD,GAAG7kD,EAAGpL,GAAK+sC,KAFc,CAG7DhgC,EAAEwkD,MAAOttD,EAAGoV,GACd,OAAQtM,EAAEykD,KACR,IAAK,MACH,OAAOpmD,EAET,IAAK,OACH,OAAQ,EAAIA,EAEd,QACE,OAAO2hC,MAuBX,SAAS+sB,GAAG/sD,EAAG9I,GACf,GAAI8I,EAAEo6C,GAAI,CACN,GAAI73B,MAAMrrB,GAAI,MAAO,CACjB6rD,YAAa,OAEjB,GAAI7rD,IAAM,EAAA,EAAO,MAAO,CACpB6rD,YAAa,YAEjB,GAAI7rD,KAAM,EAAA,EAAQ,MAAO,CACrB6rD,YAAa,aAGrB,MAAO,CACHA,YAAa3C,GAAGlpD,GAAK,KAAOA,GAMhC,SAAS81D,GAAGhtD,GACZ,MAAO,CACH8iD,aAAc,GAAK9iD,GAQvB,SAASitD,GAAGjtD,EAAG9I,GACf,OAAOmpD,GAAGnpD,GAAK81D,GAAG91D,GAAK61D,GAAG/sD,EAAG9I,GAmByB,MAAMg2D,GAC5D3zD,cAGI3F,KAAK4G,OAAI,GAOb,SAAS2yD,GAAGntD,EAAG9I,EAAGoV,GAClB,OAAOtM,aAAaotD,GAAK,SAASptD,EAAG9I,GACjC,MAAMoV,EAAI,CACNotC,OAAQ,CACJiI,SAAU,CACNC,YAAa,oBAEjBI,qBAAsB,CAClBC,eAAgB,CACZpL,QAAS72C,EAAE62C,QACXuK,MAAOphD,EAAE82C,gBAKzB,OAAO5/C,IAAMoV,EAAEotC,OAAOoI,mBAAqB5qD,GAAI,CAC3CwqD,SAAUp1C,GAfO,CAiBvBA,EAAGpV,GAAK8I,aAAaqtD,GAAKC,GAAGttD,EAAG9I,GAAK8I,aAAautD,GAAKC,GAAGxtD,EAAG9I,GAAK,SAAS8I,EAAG9I,GAI5E,MAAMoV,EAAImhD,GAAGztD,EAAG9I,GAAImH,EAAIqvD,GAAGphD,GAAKohD,GAAG1tD,EAAE06C,IACrC,OAAO+I,GAAGn3C,IAAMm3C,GAAGzjD,EAAE06C,IAAMsS,GAAG3uD,GAAK0uD,GAAG/sD,EAAEs6C,GAAIj8C,GALoB,CAMlE2B,EAAG9I,GAML,SAASy2D,GAAG3tD,EAAG9I,EAAGoV,GAIlB,OAAOtM,aAAaqtD,GAAKC,GAAGttD,EAAG9I,GAAK8I,aAAautD,GAAKC,GAAGxtD,EAAG9I,GAAKoV,EAiBjE,SAASmhD,GAAGztD,EAAG9I,GACf,OAAO8I,aAAa4tD,GAAKnK,GAAGn3C,EAAIpV,IAAM,SAAS8I,GAC3C,QAASA,GAAK,gBAAiBA,EADG,CAGsCsM,GAAKpV,EAAI,CACjF4rD,aAAc,GACd,KACJ,IAAIx2C,EAIR,MAAM8gD,WAAWF,IAEuC,MAAMG,WAAWH,GACrE3zD,YAAYyG,GACRrG,QAAS/F,KAAKi6D,SAAW7tD,GAIjC,SAASstD,GAAGttD,EAAG9I,GACX,MAAMoV,EAAIwhD,GAAG52D,GACb,IAAK,MAAMA,KAAK8I,EAAE6tD,SAAUvhD,EAAEi6C,MAAMvmD,GAAKuiD,GAAGviD,EAAG9I,MAAQoV,EAAEpX,KAAKgC,GAC9D,MAAO,CACH8rD,WAAY,CACR3jC,OAAQ/S,IAKqC,MAAMihD,WAAWL,GACtE3zD,YAAYyG,GACRrG,QAAS/F,KAAKi6D,SAAW7tD,GAIjC,SAASwtD,GAAGxtD,EAAG9I,GACX,IAAIoV,EAAIwhD,GAAG52D,GACX,IAAK,MAAMA,KAAK8I,EAAE6tD,SAAUvhD,EAAIA,EAAEssC,QAAQ54C,IAAMuiD,GAAGviD,EAAG9I,KACtD,MAAO,CACH8rD,WAAY,CACR3jC,OAAQ/S,IAUhB,MAAMshD,WAAWV,GACjB3zD,YAAYyG,EAAG9I,GACXyC,QAAS/F,KAAK0mD,GAAKt6C,EAAGpM,KAAK8mD,GAAKxjD,GAIxC,SAASw2D,GAAG1tD,GACR,OAAOqhD,GAAGrhD,EAAE8iD,cAAgB9iD,EAAE+iD,aAGlC,SAAS+K,GAAG9tD,GACR,OAAO0jD,GAAG1jD,IAAMA,EAAEgjD,WAAW3jC,OAASrf,EAAEgjD,WAAW3jC,OAAOhgB,QAAU,GAmBL,MAAM0uD,GACrEx0D,YAAYyG,EAAG9I,GACXtD,KAAK4wD,MAAQxkD,EAAGpM,KAAKo6D,UAAY92D,GAWzC,MAAM+2D,GACF10D,YAWAyG,EAQA9I,GACItD,KAAKqR,QAAUjF,EAAGpM,KAAKs6D,iBAAmBh3D,GAQ9C,MAAMi3D,GACN50D,YAAYyG,EAAG9I,GACXtD,KAAKw6D,WAAapuD,EAAGpM,KAAKy6D,OAASn3D,EAEKq/C,cACxC,OAAO,IAAI4X,GAE2C5X,cAAcv2C,GACpE,OAAO,IAAImuD,QAAG,EAAQnuD,GAEoDu2C,kBAAkBv2C,GAC5F,OAAO,IAAImuD,GAAGnuD,GAEwCsuD,aACtD,YAAO,IAAW16D,KAAKw6D,iBAAc,IAAWx6D,KAAKy6D,OAEzD3b,QAAQ1yC,GACJ,OAAOpM,KAAKy6D,SAAWruD,EAAEquD,SAAWz6D,KAAKw6D,aAAepuD,EAAEouD,YAAcx6D,KAAKw6D,WAAW1b,QAAQ1yC,EAAEouD,aAAepuD,EAAEouD,aAIjD,SAASG,GAAGvuD,EAAG9I,GACrF,YAAO,IAAW8I,EAAEouD,WAAal3D,EAAEyzD,mBAAqBzzD,EAAE+N,QAAQytC,QAAQ1yC,EAAEouD,iBAAc,IAAWpuD,EAAEquD,QAAUruD,EAAEquD,SAAWn3D,EAAEyzD,kBA8ChI,MAAM6D,IAMN,SAASC,GAAGzuD,EAAG9I,GACf,IAAK8I,EAAEuqD,mBAAqBrzD,GAAK,IAAMA,EAAEwiD,OAAOxmD,OAAQ,OAAO,KAE3D,GAAI,OAASgE,EAAG,OAAO8I,EAAE4qD,eAAiB,IAAI8D,GAAG1uD,EAAEvF,IAAK0zD,GAAGQ,QAAU,IAAIC,GAAG5uD,EAAEvF,IAAKuF,EAAE5F,KAAM+zD,GAAGQ,QAClG,CACI,MAAMriD,EAAItM,EAAE5F,KAAMiE,EAAImrD,GAAG/O,QACzB,IAAIxnD,EAAI,IAAI41D,GAAG/P,GAAGf,YAClB,IAAK,IAAI/3C,KAAK9I,EAAEwiD,OAAQ,IAAKzmD,EAAEq/B,IAAItyB,GAAI,CACnC,IAAI9I,EAAIoV,EAAEk4C,MAAMxkD,GAUJ,OAAS9I,GAAK8I,EAAE9M,OAAS,IAAM8M,EAAIA,EAAEo4C,UAAWlhD,EAAIoV,EAAEk4C,MAAMxkD,IAAK,OAAS9I,EAAImH,EAAEk0B,OAAOvyB,GAAK3B,EAAE4S,IAAIjR,EAAG9I,GACjHjE,EAAIA,EAAEqY,IAAItL,GAEd,OAAO,IAAI6uD,GAAG7uD,EAAEvF,IAAK4D,EAAG,IAAIirD,GAAGr2D,EAAEwO,WAAY0sD,GAAGQ,SAepD,SAASG,GAAG9uD,EAAG9I,EAAGoV,GAClBtM,aAAa4uD,GAAK,SAAS5uD,EAAG9I,EAAGoV,GAI7B,MAAMjO,EAAI2B,EAAEtF,MAAMuP,QAAShX,EAAI87D,GAAG/uD,EAAEgvD,gBAAiB93D,EAAGoV,EAAE4hD,kBAC1D7vD,EAAEqrD,OAAOz2D,GAAIiE,EAAE+yD,uBAAuB39C,EAAErH,QAAS5G,GAAG+rD,2BALtC,CAMhBpqD,EAAG9I,EAAGoV,GAAKtM,aAAa6uD,GAAK,SAAS7uD,EAAG9I,EAAGoV,GAC1C,IAAKiiD,GAAGvuD,EAAEivD,aAAc/3D,GAKxB,YAAYA,EAAEizD,yBAAyB79C,EAAErH,SACzC,MAAM5G,EAAI0wD,GAAG/uD,EAAEgvD,gBAAiB93D,EAAGoV,EAAE4hD,kBAAmBj7D,EAAIiE,EAAEkD,KAC9DnH,EAAEy2D,OAAOwF,GAAGlvD,IAAK/M,EAAEy2D,OAAOrrD,GAAInH,EAAE+yD,uBAAuB39C,EAAErH,QAAShS,GAAGm3D,2BAR1C,CAS7BpqD,EAAG9I,EAAGoV,GAAK,SAAStM,EAAG9I,EAAGoV,GAIxBpV,EAAEgzD,oBAAoB59C,EAAErH,SAASmlD,2BAJxB,CAKX,EAAGlzD,EAAGoV,GAgBR,SAAS6iD,GAAGnvD,EAAG9I,EAAGoV,EAAGjO,GACrB,OAAO2B,aAAa4uD,GAAK,SAAS5uD,EAAG9I,EAAGoV,EAAGjO,GACvC,IAAKkwD,GAAGvuD,EAAEivD,aAAc/3D,GAGxB,OAAOoV,EACP,MAAMrZ,EAAI+M,EAAEtF,MAAMuP,QAASqrC,EAAI8Z,GAAGpvD,EAAEgvD,gBAAiB3wD,EAAGnH,GACxD,OAAOjE,EAAEy2D,OAAOpU,GAAIp+C,EAAE+yD,uBAAuB/yD,EAAE+N,QAAShS,GAAGo3D,uBAC3D,KAPqB,CAsBxBrqD,EAAG9I,EAAGoV,EAAGjO,GAAK2B,aAAa6uD,GAAK,SAAS7uD,EAAG9I,EAAGoV,EAAGjO,GAC/C,IAAKkwD,GAAGvuD,EAAEivD,aAAc/3D,GAAI,OAAOoV,EACnC,MAAMrZ,EAAIm8D,GAAGpvD,EAAEgvD,gBAAiB3wD,EAAGnH,GAAIo+C,EAAIp+C,EAAEkD,KAC7C,OAAIk7C,EAAEoU,OAAOwF,GAAGlvD,IAAKs1C,EAAEoU,OAAOz2D,GAAIiE,EAAE+yD,uBAAuB/yD,EAAE+N,QAASqwC,GAAG+U,uBACzE,OAAS/9C,EAAU,KACZA,EAAE88C,UAAUppD,EAAEqvD,UAAU3V,QAAQ0P,UAAUppD,EAAEgvD,gBAAgBtpB,KAAK1lC,GAAKA,EAAEwkD,SALlD,CAShCxkD,EAAG9I,EAAGoV,EAAGjO,GAAK,SAAS2B,EAAG9I,EAAGoV,GAC1B,OAAIiiD,GAAGvuD,EAAEivD,aAAc/3D,IAAWA,EAAEgzD,oBAAoBhzD,EAAE+N,SAASolD,uBACnE,MACO/9C,EAHI,CAWdtM,EAAG9I,EAAGoV,GAkBP,SAASgjD,GAAGtvD,EAAG9I,GACf,IAAIoV,EAAI,KACR,IAAK,MAAMjO,KAAK2B,EAAEgvD,gBAAiB,CAC/B,MAAMhvD,EAAI9I,EAAEkD,KAAKoqD,MAAMnmD,EAAEmmD,OAAQvxD,EAAIw6D,GAAGpvD,EAAE2vD,UAAWhuD,GAAK,MAC1D,MAAQ/M,IAAM,OAASqZ,IAAMA,EAAIk9C,GAAG/O,SAAUnuC,EAAE2E,IAAI5S,EAAEmmD,MAAOvxD,IAEjE,OAAOqZ,GAAK,KAGhB,SAASijD,GAAGvvD,EAAG9I,GACX,OAAO8I,EAAEpE,OAAS1E,EAAE0E,QAAWoE,EAAEvF,IAAIi4C,QAAQx7C,EAAEuD,QAAWuF,EAAEivD,aAAavc,QAAQx7C,EAAE+3D,iBAAoB,SAASjvD,EAAG9I,GAC/G,YAAO,IAAW8I,QAAK,IAAW9I,MAAQ8I,IAAM9I,IAAMu/C,GAAGz2C,EAAG9I,GAAC,CAAI8I,EAAG9I,IA/P5E,SAAY8I,EAAG9I,GACX,OAAO8I,EAAEwkD,MAAM9R,QAAQx7C,EAAEstD,QAAU,SAASxkD,EAAG9I,GAC3C,OAAO8I,aAAaqtD,IAAMn2D,aAAam2D,IAAMrtD,aAAautD,IAAMr2D,aAAaq2D,GAAK9W,GAAGz2C,EAAE6tD,SAAU32D,EAAE22D,SAAUtL,IAAMviD,aAAa4tD,IAAM12D,aAAa02D,GAAKrL,GAAGviD,EAAE06C,GAAIxjD,EAAEwjD,IAAM16C,aAAaotD,IAAMl2D,aAAak2D,GAD1K,CAEjCptD,EAAEguD,UAAW92D,EAAE82D,WA4P6DwB,CAAGxvD,EAAG9I,KADmB,CAErG8I,EAAEgvD,gBAAiB93D,EAAE83D,mBAAqB,IAA6BhvD,EAAEpE,KAAOoE,EAAEtF,MAAMg4C,QAAQx7C,EAAEwD,OAAS,IAA+BsF,EAAEpE,MAAQoE,EAAE5F,KAAKs4C,QAAQx7C,EAAEkD,OAAS4F,EAAEqvD,UAAU3c,QAAQx7C,EAAEm4D,YAMtM,MAAMT,WAAWJ,GACjBj1D,YAAYyG,EAAG9I,EAAGoV,EAAGjO,EAAI,IACrB1E,QAAS/F,KAAK6G,IAAMuF,EAAGpM,KAAK8G,MAAQxD,EAAGtD,KAAKq7D,aAAe3iD,EAAG1Y,KAAKo7D,gBAAkB3wD,EACrFzK,KAAKgI,KAAO,EAEhB6zD,eACI,OAAO,MAIf,MAAMZ,WAAWL,GACbj1D,YAAYyG,EAAG9I,EAAGoV,EAAGjO,EAAGpL,EAAI,IACxB0G,QAAS/F,KAAK6G,IAAMuF,EAAGpM,KAAKwG,KAAOlD,EAAGtD,KAAKy7D,UAAY/iD,EAAG1Y,KAAKq7D,aAAe5wD,EAC9EzK,KAAKo7D,gBAAkB/7D,EAAGW,KAAKgI,KAAO,EAE1C6zD,eACI,OAAO77D,KAAKy7D,WAIpB,SAASH,GAAGlvD,GACR,MAAM9I,EAAI,IAAI8xB,IACd,OAAOhpB,EAAEqvD,UAAU3V,OAAO5vC,SAASwC,IAC/B,IAAKA,EAAEisC,UAAW,CACd,MAAMl6C,EAAI2B,EAAE5F,KAAKoqD,MAAMl4C,GACvBpV,EAAE+Z,IAAI3E,EAAGjO,OAEZnH,EAaL,SAAS63D,GAAG/uD,EAAG9I,EAAGoV,GAClB,MAAMjO,EAAI,IAAI2qB,IACdmF,GAAEnuB,EAAE9M,SAAWoZ,EAAEpZ,QACjB,IAAK,IAAID,EAAI,EAAGA,EAAIqZ,EAAEpZ,OAAQD,IAAK,CAC/B,MAAMqiD,EAAIt1C,EAAE/M,GAAIoiD,EAAIC,EAAE0Y,UAAWn4D,EAAIqB,EAAEkD,KAAKoqD,MAAMlP,EAAEkP,OACpDnmD,EAAE4S,IAAIqkC,EAAEkP,MAAOmJ,GAAGtY,EAAGx/C,EAAGyW,EAAErZ,KAE9B,OAAOoL,EAaP,SAAS+wD,GAAGpvD,EAAG9I,EAAGoV,GAClB,MAAMjO,EAAI,IAAI2qB,IACd,IAAK,MAAM/1B,KAAK+M,EAAG,CACf,MAAMA,EAAI/M,EAAE+6D,UAAW1Y,EAAIhpC,EAAElS,KAAKoqD,MAAMvxD,EAAEuxD,OAC1CnmD,EAAE4S,IAAIhe,EAAEuxD,MAAO2I,GAAGntD,EAAGs1C,EAAGp+C,IAE5B,OAAOmH,EAGmD,MAAMqwD,WAAWF,GAC3Ej1D,YAAYyG,EAAG9I,GACXyC,QAAS/F,KAAK6G,IAAMuF,EAAGpM,KAAKq7D,aAAe/3D,EAAGtD,KAAKgI,KAAO,EAC1DhI,KAAKo7D,gBAAkB,GAE3BS,eACI,OAAO,MAIf,MAAMC,WAAWlB,GACbj1D,YAAYyG,EAAG9I,GACXyC,QAAS/F,KAAK6G,IAAMuF,EAAGpM,KAAKq7D,aAAe/3D,EAAGtD,KAAKgI,KAAO,EAC1DhI,KAAKo7D,gBAAkB,GAE3BS,eACI,OAAO,MAmBX,MAAME,GAENp2D,YAAYyG,GACRpM,KAAKuxC,MAAQnlC,GA6BjB,IAAI4vD,GAAIC,GAQZ,SAASC,GAAG9vD,GACR,OAAQA,GACN,QACE,OAAOggC,KAET,KAAK3xB,GAAEolC,UACP,KAAKplC,GAAEqlC,QACP,KAAKrlC,GAAEulC,kBACP,KAAKvlC,GAAE2lC,mBACP,KAAK3lC,GAAEgmC,SACP,KAAKhmC,GAAEimC,YAGC,KAAKjmC,GAAEskC,gBACb,OAAO,EAET,KAAKtkC,GAAEslC,iBACP,KAAKtlC,GAAEwlC,UACP,KAAKxlC,GAAEylC,eACP,KAAKzlC,GAAE0lC,kBACP,KAAK1lC,GAAE4lC,oBAIC,KAAK5lC,GAAE6lC,QACf,KAAK7lC,GAAE8lC,aACP,KAAK9lC,GAAE+lC,cACP,KAAK/lC,GAAEkmC,UACL,OAAO,GAuBf,SAASwb,GAAG/vD,GACR,QAAI,IAAWA,EAGf,OAAOiE,GAAE,2BAA4BoK,GAAEqlC,QACvC,OAAQ1zC,GACN,KAAK4vD,GAAGnxB,GACN,OAAOpwB,GAAEowB,GAEX,KAAKmxB,GAAGnc,UACN,OAAOplC,GAAEolC,UAEX,KAAKmc,GAAGlc,QACN,OAAOrlC,GAAEqlC,QAEX,KAAKkc,GAAGhc,kBACN,OAAOvlC,GAAEulC,kBAEX,KAAKgc,GAAG5b,mBACN,OAAO3lC,GAAE2lC,mBAEX,KAAK4b,GAAGvb,SACN,OAAOhmC,GAAEgmC,SAEX,KAAKub,GAAGtb,YACN,OAAOjmC,GAAEimC,YAEX,KAAKsb,GAAGjd,gBACN,OAAOtkC,GAAEskC,gBAEX,KAAKid,GAAGjc,iBACN,OAAOtlC,GAAEslC,iBAEX,KAAKic,GAAG/b,UACN,OAAOxlC,GAAEwlC,UAEX,KAAK+b,GAAG9b,eACN,OAAOzlC,GAAEylC,eAEX,KAAK8b,GAAG7b,kBACN,OAAO1lC,GAAE0lC,kBAEX,KAAK6b,GAAG3b,oBACN,OAAO5lC,GAAE4lC,oBAEX,KAAK2b,GAAG1b,QACN,OAAO7lC,GAAE6lC,QAEX,KAAK0b,GAAGzb,aACN,OAAO9lC,GAAE8lC,aAEX,KAAKyb,GAAGxb,cACN,OAAO/lC,GAAE+lC,cAEX,KAAKwb,GAAGrb,UACN,OAAOlmC,GAAEkmC,UAEX,QACE,OAAOvU,OAWV6vB,GAAKD,KAAOA,GAAK,KAAKC,GAAGpxB,GAAK,GAAK,KAAMoxB,GAAGA,GAAGpc,UAAY,GAAK,YACrEoc,GAAGA,GAAGnc,QAAU,GAAK,UAAWmc,GAAGA,GAAGlc,iBAAmB,GAAK,mBAC9Dkc,GAAGA,GAAGjc,kBAAoB,GAAK,oBAAqBic,GAAGA,GAAGhc,UAAY,GAAK,YAC3Egc,GAAGA,GAAG/b,eAAiB,GAAK,iBAAkB+b,GAAGA,GAAG9b,kBAAoB,GAAK,oBAC7E8b,GAAGA,GAAGld,gBAAkB,IAAM,kBAAmBkd,GAAGA,GAAG7b,mBAAqB,GAAK,qBACjF6b,GAAGA,GAAG5b,oBAAsB,GAAK,sBAAuB4b,GAAGA,GAAG3b,QAAU,IAAM,UAC9E2b,GAAGA,GAAG1b,aAAe,IAAM,eAAgB0b,GAAGA,GAAGzb,cAAgB,IAAM,gBACvEyb,GAAGA,GAAGxb,SAAW,IAAM,WAAYwb,GAAGA,GAAGvb,YAAc,IAAM,cAAeub,GAAGA,GAAGtb,UAAY,IAAM,YAwBpG,MAAMyb,GACFz2D,YAAYyG,EAAG9I,GACXtD,KAAKq8D,SAAWjwD,EAAGpM,KAAKs8D,SAAWh5D,EAOnCtD,KAAKu8D,MAAQ,GAEbv8D,KAAKw8D,UAAY,EAEkDptD,IAAIhD,GACvE,MAAM9I,EAAItD,KAAKq8D,SAASjwD,GAAIsM,EAAI1Y,KAAKu8D,MAAMj5D,GAC3C,QAAI,IAAWoV,EAAG,IAAK,MAAOpV,EAAGmH,KAAMiO,EAAG,GAAI1Y,KAAKs8D,SAASh5D,EAAG8I,GAAI,OAAO3B,EAE9Ei0B,IAAItyB,GACA,YAAO,IAAWpM,KAAKoP,IAAIhD,GAEciR,IAAIjR,EAAG9I,GAChD,MAAMoV,EAAI1Y,KAAKq8D,SAASjwD,GAAI3B,EAAIzK,KAAKu8D,MAAM7jD,GAC3C,QAAI,IAAWjO,EAAG,OAAOzK,KAAKu8D,MAAM7jD,GAAK,CAAE,CAAEtM,EAAG9I,SAAYtD,KAAKw8D,YACjE,IAAK,IAAI9jD,EAAI,EAAGA,EAAIjO,EAAEnL,OAAQoZ,IAAK,GAAI1Y,KAAKs8D,SAAS7xD,EAAEiO,GAAG,GAAItM,GAE9D,YAAa3B,EAAEiO,GAAK,CAAEtM,EAAG9I,IACzBmH,EAAEnJ,KAAK,CAAE8K,EAAG9I,IAAMtD,KAAKw8D,YAIpB79B,OAAOvyB,GACV,MAAM9I,EAAItD,KAAKq8D,SAASjwD,GAAIsM,EAAI1Y,KAAKu8D,MAAMj5D,GAC3C,QAAI,IAAWoV,EAAG,OAAO,EACzB,IAAK,IAAIjO,EAAI,EAAGA,EAAIiO,EAAEpZ,OAAQmL,IAAK,GAAIzK,KAAKs8D,SAAS5jD,EAAEjO,GAAG,GAAI2B,GAAI,OAAO,IAAMsM,EAAEpZ,cAAgBU,KAAKu8D,MAAMj5D,GAAKoV,EAAExB,OAAOzM,EAAG,GAC7HzK,KAAKw8D,aAAa,EAClB,OAAO,EAEXtmD,QAAQ9J,GACJigD,GAAGrsD,KAAKu8D,QAASj5D,EAAGoV,KAChB,IAAK,MAAOpV,EAAGmH,KAAMiO,EAAGtM,EAAE9I,EAAGmH,MAGrCk6C,UACI,OAAO2H,GAAGtsD,KAAKu8D,OAEnB73C,OACI,OAAO1kB,KAAKw8D,WAmBhB,MAAMC,GAAK,IAAI3J,GAAGzN,GAAGlB,YAEzB,SAASuY,KACL,OAAOD,GAGX,MAAME,GAAK,IAAI7J,GAAGzN,GAAGlB,YAErB,SAASyY,MAAMxwD,GACX,IAAI9I,EAAIq5D,GACR,IAAK,MAAMjkD,KAAKtM,EAAG9I,EAAIA,EAAE4vD,OAAOx6C,EAAE7R,IAAK6R,GACvC,OAAOpV,EAGX,SAASwhB,GAAG1Y,GACR,IAAI9I,EAAIq5D,GACR,OAAOvwD,EAAE8J,SAAO,CAAG9J,EAAGsM,IAAMpV,EAAIA,EAAE4vD,OAAO9mD,EAAGsM,EAAEmkD,qBAAsBv5D,EAGxE,SAASw5D,KACL,OAAOC,KAGX,SAASC,KACL,OAAOD,KAGX,SAASA,KACL,OAAO,IAAIX,IAAIhwD,GAAKA,EAAE/G,aAAU,CAAK+G,EAAG9I,IAAM8I,EAAE0yC,QAAQx7C,KAG5D,MAAM25D,GAAK,IAAInK,GAAGzN,GAAGlB,YAEf+Y,GAAK,IAAIjI,GAAG5P,GAAGlB,YAErB,SAASgZ,MAAM/wD,GACX,IAAI9I,EAAI45D,GACR,IAAK,MAAMxkD,KAAKtM,EAAG9I,EAAIA,EAAEoU,IAAIgB,GAC7B,OAAOpV,EAGX,MAAM85D,GAAK,IAAInI,GAAGrS,IAElB,SAASya,KACL,OAAOD,GAuBP,MAAME,GACN33D,YAIAyG,EAIA9I,EAKAoV,EAKAjO,EAIApL,GACIW,KAAKu9D,gBAAkBnxD,EAAGpM,KAAKw9D,cAAgBl6D,EAAGtD,KAAKy9D,iBAAmB/kD,EAAG1Y,KAAK09D,gBAAkBjzD,EACpGzK,KAAK29D,uBAAyBt+D,EASlCsjD,oDAAoDv2C,EAAG9I,EAAGoV,GACtD,MAAMjO,EAAI,IAAI2qB,IACd,OAAO3qB,EAAE4S,IAAIjR,EAAGwxD,GAAGC,8CAA8CzxD,EAAG9I,EAAGoV,IAAK,IAAI4kD,GAAG3Z,GAAGnS,MAAO/mC,EAAG4yD,KAAMX,KAAMS,OAWhH,MAAMS,GACNj4D,YAOAyG,EAMA9I,EAKAoV,EAKAjO,EAKApL,GACIW,KAAK89D,YAAc1xD,EAAGpM,KAAK+9D,QAAUz6D,EAAGtD,KAAKg+D,eAAiBtlD,EAAG1Y,KAAKi+D,kBAAoBxzD,EAC1FzK,KAAKk+D,iBAAmB7+D,EAMrBsjD,qDAAqDv2C,EAAG9I,EAAGoV,GAC9D,OAAO,IAAIklD,GAAGllD,EAAGpV,EAAG65D,KAAMA,KAAMA,OAyBpC,MAAMgB,GACNx4D,YAEAyG,EAEA9I,EAEAoV,EAKAjO,GACIzK,KAAKmnD,GAAK/6C,EAAGpM,KAAKo+D,iBAAmB96D,EAAGtD,KAAK6G,IAAM6R,EAAG1Y,KAAKonD,GAAK38C,GAIxE,MAAM4zD,GACF14D,YAAYyG,EAAG9I,GACXtD,KAAKs+D,SAAWlyD,EAAGpM,KAAKynD,GAAKnkD,GAIrC,MAAMi7D,GACF54D,YAEAyG,EAEA9I,EAOAoV,EAAIo0C,GAAGO,kBACgD5iD,EAAI,MACvDzK,KAAK6T,MAAQzH,EAAGpM,KAAKw+D,UAAYl7D,EAAGtD,KAAK89D,YAAcplD,EAAG1Y,KAAKy+D,MAAQh0D,GAI3B,MAAMi0D,GACtD/4D,cAKI3F,KAAK0nD,GAAK,EAOV1nD,KAAKooD,GAAKuW,KAEV3+D,KAAK+oD,GAAK+D,GAAGO,kBAAmBrtD,KAAKwpD,IAAK,EAM1CxpD,KAAKyoD,IAAK,EASHsV,cACP,OAAO/9D,KAAKwpD,GAEgDsU,kBAC5D,OAAO99D,KAAK+oD,GAE6DW,SACzE,OAAO,IAAM1pD,KAAK0nD,GAE2DoB,SAC7E,OAAO9oD,KAAKyoD,GAKTO,GAAG58C,GACNA,EAAEghD,sBAAwB,IAAMptD,KAAKyoD,IAAK,EAAIzoD,KAAK+oD,GAAK38C,GAOrD89C,KACH,IAAI99C,EAAI+wD,KAAM75D,EAAI65D,KAAMzkD,EAAIykD,KAC5B,OAAOn9D,KAAKooD,GAAGlyC,SAAO,CAAGzL,EAAGpL,KACxB,OAAQA,GACN,KAAK,EACH+M,EAAIA,EAAEsL,IAAIjN,GACV,MAEF,KAAK,EACHnH,EAAIA,EAAEoU,IAAIjN,GACV,MAEF,KAAK,EACHiO,EAAIA,EAAEhB,IAAIjN,GACV,MAEF,QACE2hC,SAEH,IAAIwxB,GAAG59D,KAAK+oD,GAAI/oD,KAAKwpD,GAAIp9C,EAAG9I,EAAGoV,GAIjCgwC,KACH1oD,KAAKyoD,IAAK,EAAIzoD,KAAKooD,GAAKuW,KAE5BxU,GAAG/9C,EAAG9I,GACFtD,KAAKyoD,IAAK,EAAIzoD,KAAKooD,GAAKpoD,KAAKooD,GAAG8K,OAAO9mD,EAAG9I,GAE9CknD,GAAGp+C,GACCpM,KAAKyoD,IAAK,EAAIzoD,KAAKooD,GAAKpoD,KAAKooD,GAAGjsC,OAAO/P,GAE3Ck/C,KACItrD,KAAK0nD,IAAM,EAEfgE,KACI1rD,KAAK0nD,IAAM,EAEfsE,KACIhsD,KAAKyoD,IAAK,EAAIzoD,KAAKwpD,IAAK,GAOhC,MAAMoV,GACFj5D,YAAYyG,GACRpM,KAAKosD,GAAKhgD,EAEVpM,KAAKqsD,GAAK,IAAIj3B,IAEdp1B,KAAKssD,GAAKoQ,KAEV18D,KAAKusD,GAAKsS,KAMV7+D,KAAKwsD,GAAK,IAAIyI,GAAGrS,IAId6J,GAAGrgD,GACN,IAAK,MAAM9I,KAAK8I,EAAE+6C,GAAI/6C,EAAEg7C,IAAMh7C,EAAEg7C,GAAG2P,kBAAoB/2D,KAAK6sD,GAAGvpD,EAAG8I,EAAEg7C,IAAMpnD,KAAK8sD,GAAGxpD,EAAG8I,EAAEvF,IAAKuF,EAAEg7C,IAC9F,IAAK,MAAM9jD,KAAK8I,EAAEgyD,iBAAkBp+D,KAAK8sD,GAAGxpD,EAAG8I,EAAEvF,IAAKuF,EAAEg7C,IAEsBkG,GAAGlhD,GACjFpM,KAAK8+D,cAAc1yD,GAAI9I,IACnB,MAAMoV,EAAI1Y,KAAKutD,GAAGjqD,GAClB,OAAQ8I,EAAEyH,OACR,KAAK,EACH7T,KAAKytD,GAAGnqD,IAAMoV,EAAEswC,GAAG58C,EAAE0xD,aACrB,MAEF,KAAK,EAGHplD,EAAEgzC,KAAMhzC,EAAEgxC,IAIVhxC,EAAEgwC,KAAMhwC,EAAEswC,GAAG58C,EAAE0xD,aACf,MAEF,KAAK,EAKHplD,EAAEgzC,KAAMhzC,EAAEgxC,IAAM1pD,KAAK++D,aAAaz7D,GAClC,MAEF,KAAK,EACHtD,KAAKytD,GAAGnqD,KAAOoV,EAAEszC,KAAMtzC,EAAEswC,GAAG58C,EAAE0xD,cAC9B,MAEF,KAAK,EACH99D,KAAKytD,GAAGnqD,KAIRtD,KAAK0tD,GAAGpqD,GAAIoV,EAAEswC,GAAG58C,EAAE0xD,cACnB,MAEF,QACE1xB,SAQL0yB,cAAc1yD,EAAG9I,GACpB8I,EAAEoyD,UAAUl/D,OAAS,EAAI8M,EAAEoyD,UAAUtoD,QAAQ5S,GAAKtD,KAAKqsD,GAAGn2C,SAAO,CAAG9J,EAAGsM,KACnE1Y,KAAKytD,GAAG/0C,IAAMpV,EAAEoV,MAOjBm1C,GAAGzhD,GACN,MAAM9I,EAAI8I,EAAEkyD,SAAU5lD,EAAItM,EAAEq7C,GAAGlW,MAAO9mC,EAAIzK,KAAKiuD,GAAG3qD,GAClD,GAAImH,EAAG,CACH,MAAM2B,EAAI3B,EAAEiE,OACZ,GAAIgpD,GAAGtrD,GAAI,GAAI,IAAMsM,EAAG,CAOpB,MAAMA,EAAI,IAAI2sC,GAAGj5C,EAAEixB,MACnBr9B,KAAK8sD,GAAGxpD,EAAGoV,EAAGu9C,GAAG+I,cAActmD,EAAGirC,GAAGnS,aAClCjX,GAAE,IAAM7hB,QACX1Y,KAAKmuD,GAAG7qD,KAAOoV,IAGf1Y,KAAK0tD,GAAGpqD,GAAItD,KAAKwsD,GAAKxsD,KAAKwsD,GAAG90C,IAAIpU,KAOvCgrD,GAAGliD,GACN,MAAM9I,EAAI,IAAI8xB,IACdp1B,KAAKqsD,GAAGn2C,UAAUwC,EAAGjO,KACjB,MAAMpL,EAAIW,KAAKiuD,GAAGxjD,GAClB,GAAIpL,EAAG,CACH,GAAIqZ,EAAEqlD,SAAWrG,GAAGr4D,EAAEqP,QAAS,CAS3B,MAAMpL,EAAI,IAAI+hD,GAAGhmD,EAAEqP,OAAO2uB,MAC1B,OAASr9B,KAAKssD,GAAGl9C,IAAI9L,IAAMtD,KAAKuuD,GAAG9jD,EAAGnH,IAAMtD,KAAK8sD,GAAGriD,EAAGnH,EAAG2yD,GAAG+I,cAAc17D,EAAG8I,IAElFsM,EAAEowC,KAAOxlD,EAAE+Z,IAAI5S,EAAGiO,EAAEwxC,MAAOxxC,EAAEgwC,UAGrC,IAAIhwC,EAAIykD,KAMAn9D,KAAKusD,GAAGr2C,UAAU9J,EAAG9I,KACzB,IAAImH,GAAI,EACRnH,EAAE+xD,cAAcjpD,IACZ,MAAM9I,EAAItD,KAAKiuD,GAAG7hD,GAClB,OAAQ9I,GAAK,IAA0CA,EAAE27D,UAAYx0D,GAAI,GAAI,MAC5EA,IAAMiO,EAAIA,EAAEhB,IAAItL,OACpBpM,KAAKssD,GAAGp2C,UAAU5S,EAAGoV,IAAMA,EAAEg+C,YAAYtqD,KAC9C,MAAM3B,EAAI,IAAI6yD,GAAGlxD,EAAG9I,EAAGtD,KAAKwsD,GAAIxsD,KAAKssD,GAAI5zC,GACzC,OAAO1Y,KAAKssD,GAAKoQ,KAAM18D,KAAKusD,GAAKsS,KAAM7+D,KAAKwsD,GAAK,IAAIyI,GAAGrS,IAAIn4C,EAOhEoiD,GAAGzgD,EAAG9I,GACF,IAAKtD,KAAKytD,GAAGrhD,GAAI,OACjB,MAAMsM,EAAI1Y,KAAKuuD,GAAGniD,EAAG9I,EAAEuD,KAAO,EAA8B,EAC5D7G,KAAKutD,GAAGnhD,GAAG+9C,GAAG7mD,EAAEuD,IAAK6R,GAAI1Y,KAAKssD,GAAKtsD,KAAKssD,GAAG4G,OAAO5vD,EAAEuD,IAAKvD,GAAItD,KAAKusD,GAAKvsD,KAAKusD,GAAG2G,OAAO5vD,EAAEuD,IAAK7G,KAAKyuD,GAAGnrD,EAAEuD,KAAK6Q,IAAItL,IAUpH0gD,GAAG1gD,EAAG9I,EAAGoV,GACL,IAAK1Y,KAAKytD,GAAGrhD,GAAI,OACjB,MAAM3B,EAAIzK,KAAKutD,GAAGnhD,GAClBpM,KAAKuuD,GAAGniD,EAAG9I,GAAKmH,EAAE0/C,GAAG7mD,EAAG,GAGxBmH,EAAE+/C,GAAGlnD,GAAItD,KAAKusD,GAAKvsD,KAAKusD,GAAG2G,OAAO5vD,EAAGtD,KAAKyuD,GAAGnrD,GAAGq7B,OAAOvyB,IAAKsM,IAAM1Y,KAAKssD,GAAKtsD,KAAKssD,GAAG4G,OAAO5vD,EAAGoV,IAElGqmD,aAAa3yD,GACTpM,KAAKqsD,GAAG1tB,OAAOvyB,GAMZ+hD,GAAG/hD,GACN,MAAM9I,EAAItD,KAAKutD,GAAGnhD,GAAG89C,KACrB,OAAOlqD,KAAKosD,GAAG8S,uBAAuB9yD,GAAGsY,KAAOphB,EAAE06D,eAAet5C,KAAOphB,EAAE46D,iBAAiBx5C,KAKxF4mC,GAAGl/C,GACNpM,KAAKutD,GAAGnhD,GAAGk/C,KAEfiC,GAAGnhD,GACC,IAAI9I,EAAItD,KAAKqsD,GAAGj9C,IAAIhD,GACpB,OAAO9I,IAAMA,EAAI,IAAIo7D,GAAI1+D,KAAKqsD,GAAGhvC,IAAIjR,EAAG9I,IAAKA,EAEjDmrD,GAAGriD,GACC,IAAI9I,EAAItD,KAAKusD,GAAGn9C,IAAIhD,GACpB,OAAO9I,IAAMA,EAAI,IAAI2xD,GAAGrS,IAAI5iD,KAAKusD,GAAKvsD,KAAKusD,GAAG2G,OAAO9mD,EAAG9I,IAAKA,EAM1DmqD,GAAGrhD,GACN,MAAM9I,EAAI,OAAStD,KAAKiuD,GAAG7hD,GAC3B,OAAO9I,GAAKuX,GAAE,wBAAyB,2BAA4BzO,GAAI9I,EAKpE2qD,GAAG7hD,GACN,MAAM9I,EAAItD,KAAKqsD,GAAGj9C,IAAIhD,GACtB,OAAO9I,GAAKA,EAAEomD,GAAK,KAAO1pD,KAAKosD,GAAGuC,GAAGviD,GAMlCshD,GAAGthD,GACNpM,KAAKqsD,GAAGhvC,IAAIjR,EAAG,IAAIsyD,IACnB1+D,KAAKosD,GAAG8S,uBAAuB9yD,GAAG8J,SAAS5S,IACvCtD,KAAK8sD,GAAG1gD,EAAG9I,EAAwB,SAMpCirD,GAAGniD,EAAG9I,GACT,OAAOtD,KAAKosD,GAAG8S,uBAAuB9yD,GAAGsyB,IAAIp7B,IAIrD,SAASu7D,KACL,OAAO,IAAI/L,GAAGzN,GAAGlB,YAGrB,SAASwa,KACL,OAAO,IAAI7L,GAAGzN,GAAGlB,YAkBjB,MAAMgb,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,GACFh6D,YAAYyG,EAAG9I,GACXtD,KAAK2rD,WAAav/C,EAAGpM,KAAKwmD,GAAKljD,GAOvC,SAASs8D,GAAGxzD,EAAG9I,GACX,OAAI8I,EAAEo6C,GACK,GAAG,IAAIx8C,KAAK,IAAM1G,EAAE2/C,SAASh5C,cAActH,QAAQ,QAAS,IAAIA,QAAQ,IAAK,QAAQ,YAAcW,EAAE4/C,aAAaz3C,OAAO,MAE7H,CACHw3C,QAAS,GAAK3/C,EAAE2/C,QAChBuK,MAAOlqD,EAAE4/C,aASjB,SAAS2c,GAAGzzD,EAAG9I,GACX,OAAO8I,EAAEo6C,GAAKljD,EAAE4pD,WAAa5pD,EAAE6pD,eAK/B,SAAS2S,GAAG1zD,EAAG9I,GACf,OAAOs8D,GAAGxzD,EAAG9I,EAAEygD,eAGnB,SAASgc,GAAG3zD,GACR,OAAOmuB,KAAInuB,GAAIu3C,GAAGiD,cAAc,SAASx6C,GACrC,MAAM9I,EAAIiqD,GAAGnhD,GACb,OAAO,IAAI42C,GAAG1/C,EAAE2/C,QAAS3/C,EAAEkqD,OAFC,CAG9BphD,IAGN,SAAS4zD,GAAG5zD,EAAG9I,GACX,OAAO,SAAS8I,GACZ,OAAO,IAAI04C,GAAG,CAAE,WAAY14C,EAAE6/C,UAAW,YAAa7/C,EAAE8/C,WADrD,CAEL9/C,GAAGg4C,MAAM,aAAaA,MAAM9gD,GAAGyhD,kBAGrC,SAASkb,GAAG7zD,GACR,MAAM9I,EAAIwhD,GAAGQ,WAAWl5C,GACxB,OAAOmuB,GAAE2lC,GAAG58D,IAAKA,EAGrB,SAAS68D,GAAG/zD,EAAG9I,GACX,OAAO08D,GAAG5zD,EAAEu/C,WAAYroD,EAAE+5B,MAG9B,SAAS+iC,GAAGh0D,EAAG9I,GACX,MAAMoV,EAAIunD,GAAG38D,GACb,GAAIoV,EAAEtJ,IAAI,KAAOhD,EAAEu/C,WAAWM,UAAW,MAAM,IAAIvkC,GAAEjN,GAAEslC,iBAAkB,oDAAsDrnC,EAAEtJ,IAAI,GAAK,OAAShD,EAAEu/C,WAAWM,WAChK,GAAIvzC,EAAEtJ,IAAI,KAAOhD,EAAEu/C,WAAWO,SAAU,MAAM,IAAIxkC,GAAEjN,GAAEslC,iBAAkB,qDAAuDrnC,EAAEtJ,IAAI,GAAK,OAAShD,EAAEu/C,WAAWO,UAChK,OAAO,IAAI7G,GAAGgb,GAAG3nD,IAGrB,SAAS4nD,GAAGl0D,EAAG9I,GACX,OAAO08D,GAAG5zD,EAAEu/C,WAAYroD,GAG5B,SAASi9D,GAAGn0D,GACR,MAAM9I,EAAI28D,GAAG7zD,GAKT,OAAO,IAAM9I,EAAEhE,OAASwlD,GAAGS,YAAc8a,GAAG/8D,GAGpD,SAASk9D,GAAGp0D,GACR,OAAO,IAAI04C,GAAG,CAAE,WAAY14C,EAAEu/C,WAAWM,UAAW,YAAa7/C,EAAEu/C,WAAWO,WAAYnH,kBAG9F,SAASsb,GAAGj0D,GACR,OAAOmuB,GAAEnuB,EAAE9M,OAAS,GAAK,cAAgB8M,EAAEgD,IAAI,IAAKhD,EAAEm4C,SAAS,GAGa,SAASkc,GAAGr0D,EAAG9I,EAAGoV,GAC9F,MAAO,CACH1S,KAAMm6D,GAAG/zD,EAAG9I,GACZwiD,OAAQptC,EAAE5R,MAAMgnD,SAAShI,QAIjC,SAAS4a,GAAGt0D,EAAG9I,EAAGoV,GACd,MAAMjO,EAAI21D,GAAGh0D,EAAG9I,EAAE0C,MAAO3G,EAAI0gE,GAAGz8D,EAAEk3D,YAAa9Y,EAAIp+C,EAAE6yD,WAAa4J,GAAGz8D,EAAE6yD,YAAcxS,GAAGnS,MAAOiQ,EAAI,IAAImU,GAAG,CACtG9H,SAAU,CACNhI,OAAQxiD,EAAEwiD,UAEd7jD,EAAIg0D,GAAG0K,iBAAiBl2D,EAAGpL,EAAGqiD,EAAGD,GACrC,OAAO/oC,GAAKzW,EAAEu0D,2BAA4B99C,EAAIzW,EAAEu0D,2BAA6Bv0D,EA8EjF,SAAS2+D,GAAGx0D,EAAG9I,GACX,IAAIoV,EACJ,GAAIpV,aAAa03D,GAAItiD,EAAI,CACrBmoD,OAAQJ,GAAGr0D,EAAG9I,EAAEuD,IAAKvD,EAAEwD,aACnB,GAAIxD,aAAaw3D,GAAIpiD,EAAI,CAC7BimB,OAAQwhC,GAAG/zD,EAAG9I,EAAEuD,WACZ,GAAIvD,aAAa23D,GAAIviD,EAAI,CAC7BmoD,OAAQJ,GAAGr0D,EAAG9I,EAAEuD,IAAKvD,EAAEkD,MACvBs6D,WAAYC,GAAGz9D,EAAEm4D,gBACb,CACJ,KAAMn4D,aAAaw4D,IAAK,OAAO1vB,KAC/B1zB,EAAI,CACAsoD,OAAQb,GAAG/zD,EAAG9I,EAAEuD,MAGxB,OAAOvD,EAAE83D,gBAAgB97D,OAAS,IAAMoZ,EAAEuoD,iBAAmB39D,EAAE83D,gBAAgBtpB,KAAK1lC,GAAK,SAASA,EAAG9I,GACjG,MAAMoV,EAAIpV,EAAE82D,UACZ,GAAI1hD,aAAa8gD,GAAI,MAAO,CACxBjT,UAAWjjD,EAAEstD,MAAM7L,kBACnBmc,iBAAkB,gBAEtB,GAAIxoD,aAAa+gD,GAAI,MAAO,CACxBlT,UAAWjjD,EAAEstD,MAAM7L,kBACnBoc,sBAAuB,CACnB11C,OAAQ/S,EAAEuhD,WAGlB,GAAIvhD,aAAaihD,GAAI,MAAO,CACxBpT,UAAWjjD,EAAEstD,MAAM7L,kBACnBqc,mBAAoB,CAChB31C,OAAQ/S,EAAEuhD,WAGlB,GAAIvhD,aAAashD,GAAI,MAAO,CACxBzT,UAAWjjD,EAAEstD,MAAM7L,kBACnBsc,UAAW3oD,EAAEouC,IAEjB,MAAM1a,KAtB+E,CAuBvF,EAAGhgC,MAAO9I,EAAE+3D,aAAaX,SAAWhiD,EAAE4oD,gBAAkB,SAASl1D,EAAG9I,GAClE,YAAO,IAAWA,EAAEk3D,WAAa,CAC7BA,WAAYsF,GAAG1zD,EAAG9I,EAAEk3D,kBACpB,IAAWl3D,EAAEm3D,OAAS,CACtBA,OAAQn3D,EAAEm3D,QACVruB,KALkD,CAMxDhgC,EAAG9I,EAAE+3D,eAAgB3iD,EAG3B,SAAS6oD,GAAGn1D,EAAG9I,GACX,MAAMoV,EAAIpV,EAAEg+D,gBAAkB,SAASl1D,GACnC,YAAO,IAAWA,EAAEouD,WAAaD,GAAGC,WAAWuF,GAAG3zD,EAAEouD,kBAAe,IAAWpuD,EAAEquD,OAASF,GAAGE,OAAOruD,EAAEquD,QAAUF,GAAGQ,OADxF,CAE5Bz3D,EAAEg+D,iBAAmB/G,GAAGQ,OAAQtwD,EAAInH,EAAE29D,iBAAmB39D,EAAE29D,iBAAiBnvB,KAAKxuC,GAAK,SAAS8I,EAAG9I,GAChG,IAAIoV,EAAI,KACR,GAAI,qBAAsBpV,EAAGi3B,GAAE,iBAAmBj3B,EAAE49D,kBAAmBxoD,EAAI,IAAI8gD,QAAS,GAAI,0BAA2Bl2D,EAAG,CACtH,MAAM8I,EAAI9I,EAAE69D,sBAAsB11C,QAAU,GAC5C/S,EAAI,IAAI+gD,GAAGrtD,QACR,GAAI,uBAAwB9I,EAAG,CAClC,MAAM8I,EAAI9I,EAAE89D,mBAAmB31C,QAAU,GACzC/S,EAAI,IAAIihD,GAAGvtD,OACR,cAAe9I,EAAIoV,EAAI,IAAIshD,GAAG5tD,EAAG9I,EAAE+9D,WAAaj1B,KACvD,MAAM3hC,EAAIy6C,GAAGsc,iBAAiBl+D,EAAEijD,WAChC,OAAO,IAAI4T,GAAG1vD,EAAGiO,GAVmE,CAWtFtM,EAAG9I,KAAO,GACZ,GAAIA,EAAEu9D,OAAQ,CACVv9D,EAAEu9D,OAAO76D,KACT,MAAM3G,EAAI+gE,GAAGh0D,EAAG9I,EAAEu9D,OAAO76D,MAAO07C,EAAI,IAAIkU,GAAG,CACvC9H,SAAU,CACNhI,OAAQxiD,EAAEu9D,OAAO/a,UAGzB,GAAIxiD,EAAEw9D,WAAY,CACd,MAAM10D,EAAI,SAASA,GACf,MAAM9I,EAAI8I,EAAEq1D,YAAc,GAC1B,OAAO,IAAI/L,GAAGpyD,EAAEwuC,KAAK1lC,GAAK84C,GAAGsc,iBAAiBp1D,MAFxC,CAGR9I,EAAEw9D,YACJ,OAAO,IAAI7F,GAAG57D,EAAGqiD,EAAGt1C,EAAGsM,EAAGjO,GAE9B,OAAO,IAAIuwD,GAAG37D,EAAGqiD,EAAGhpC,EAAGjO,GAE3B,GAAInH,EAAEq7B,OAAQ,CACV,MAAMl0B,EAAI21D,GAAGh0D,EAAG9I,EAAEq7B,QAClB,OAAO,IAAIm8B,GAAGrwD,EAAGiO,GAErB,GAAIpV,EAAE09D,OAAQ,CACV,MAAMv2D,EAAI21D,GAAGh0D,EAAG9I,EAAE09D,QAClB,OAAO,IAAIlF,GAAGrxD,EAAGiO,GAErB,OAAO0zB,KAiBX,SAASs1B,GAAGt1D,EAAG9I,GACX,MAAO,CACHq+D,UAAW,CAAErB,GAAGl0D,EAAG9I,EAAE+5B,QAI7B,SAASukC,GAAGx1D,EAAG9I,GAEX,MAAMoV,EAAI,CACNmpD,gBAAiB,IAClBp3D,EAAInH,EAAE+5B,KACT,OAAS/5B,EAAEkiD,iBAAmB9sC,EAAEopD,OAASxB,GAAGl0D,EAAG3B,GAAIiO,EAAEmpD,gBAAgBxsC,KAAO,CAAE,CAC1E0sC,aAAcz+D,EAAEkiD,gBAChBwc,gBAAgB,MACZtpD,EAAEopD,OAASxB,GAAGl0D,EAAG3B,EAAE+5C,WAAY9rC,EAAEmpD,gBAAgBxsC,KAAO,CAAE,CAC9D0sC,aAAct3D,EAAEi6C,iBAEpB,MAAMrlD,EAAI,SAAS+M,GACf,GAAI,IAAMA,EAAE9M,OACZ,OAAO2iE,GAAG9sD,GAAG/O,OAAOgG,EAAG,QAFjB,CAGR9I,EAAE0uD,SACJ3yD,IAAMqZ,EAAEmpD,gBAAgBK,MAAQ7iE,GAChC,MAAMqiD,EAAI,SAASt1C,GACf,GAAI,IAAMA,EAAE9M,OACZ,OAAO8M,EAAE0lC,KAAK1lC,GAEd,SAASA,GACL,MAAO,CACHwkD,MAAOuR,GAAG/1D,EAAEwkD,OACZwR,UAAWC,GAAGj2D,EAAEykD,MAHxB,CAKEzkD,KATI,CAUR9I,EAAE8zD,SACJ1V,IAAMhpC,EAAEmpD,gBAAgBzK,QAAU1V,GAClC,MAAMD,EAAI,SAASr1C,EAAG9I,GAClB,OAAO8I,EAAEo6C,IAAM+F,GAAGjpD,GAAKA,EAAI,CACvBwD,MAAOxD,GAFL,CAOT8I,EAAG9I,EAAE+gD,OACN,IAAIpiD,EACJ,OAAO,OAASw/C,IAAM/oC,EAAEmpD,gBAAgBxd,MAAQ5C,GAAIn+C,EAAE+zD,UAAY3+C,EAAEmpD,gBAAgBxK,QAAU,CAC1FiL,QAASrgE,EAAIqB,EAAE+zD,SAAS9G,UACxB9kC,OAAQxpB,EAAEyuD,WACVptD,EAAEg0D,QAAU5+C,EAAEmpD,gBAAgBvK,MAAQ,SAASlrD,GAC/C,MAAO,CACHk2D,QAASl2D,EAAEmkD,UACX9kC,OAAQrf,EAAEskD,UAHwB,CAKxCptD,EAAEg0D,QAAS5+C,EAGjB,SAAS6pD,GAAGn2D,GACR,IAAI9I,EAAIi9D,GAAGn0D,EAAE01D,QACb,MAAMppD,EAAItM,EAAEy1D,gBAAiBp3D,EAAIiO,EAAE2c,KAAO3c,EAAE2c,KAAK/1B,OAAS,EAC1D,IAAID,EAAI,KACR,GAAIoL,EAAI,EAAG,CACP8vB,GAAE,IAAM9vB,GACR,MAAM2B,EAAIsM,EAAE2c,KAAK,GACjBjpB,EAAE41D,eAAiB3iE,EAAI+M,EAAE21D,aAAez+D,EAAIA,EAAE8gD,MAAMh4C,EAAE21D,cAE1D,IAAIrgB,EAAI,GACRhpC,EAAEwpD,QAAUxgB,EAAI,SAASt1C,GACrB,MAAM9I,EAAIk/D,GAAGp2D,GACb,OAAI9I,aAAa6R,IAAMi9C,GAAG9uD,GAAWA,EAAEwuD,aAChC,CAAExuD,GAHG,CAIdoV,EAAEwpD,QACJ,IAAIzgB,EAAI,GACR/oC,EAAE0+C,UAAY3V,EAAI/oC,EAAE0+C,QAAQtlB,KAAK1lC,GAAK,SAASA,GAC3C,OAAO,IAAIwmD,GAAG6P,GAAGr2D,EAAEwkD,OAEnB,SAASxkD,GACL,OAAQA,GACN,IAAK,YACH,MAAO,MAET,IAAK,aACH,MAAO,OAET,QACE,QATR,CAaCA,EAAEg2D,YAhB+B,CAmBrCh2D,MACD,IAAInK,EAAI,KACRyW,EAAE2rC,QAAUpiD,EAAI,SAASmK,GACrB,IAAI9I,EACJ,OAAOA,EAAI,iBAAmB8I,EAAIA,EAAEtF,MAAQsF,EAAGmgD,GAAGjpD,GAAK,KAAOA,EAFlD,CAGdoV,EAAE2rC,QACJ,IAAI9kD,EAAI,KACRmZ,EAAE2+C,UAAY93D,EAAI,SAAS6M,GACvB,MAAM9I,IAAM8I,EAAEk2D,OAAQ5pD,EAAItM,EAAEqf,QAAU,GACtC,OAAO,IAAIglC,GAAG/3C,EAAGpV,GAFH,CAGhBoV,EAAE2+C,UACJ,IAAInwD,EAAI,KACR,OAAOwR,EAAE4+C,QAAUpwD,EAAI,SAASkF,GAC5B,MAAM9I,GAAK8I,EAAEk2D,OAAQ5pD,EAAItM,EAAEqf,QAAU,GACrC,OAAO,IAAIglC,GAAG/3C,EAAGpV,GAFE,CAKtBoV,EAAE4+C,QAASY,GAAG50D,EAAGjE,EAAGoiD,EAAGC,EAAGz/C,EAAG,IAA4B1C,EAAG2H,GAwBjE,SAASs7D,GAAGp2D,GACR,YAAO,IAAWA,EAAEs2D,YAAc,SAASt2D,GACvC,OAAQA,EAAEs2D,YAAYzR,IACpB,IAAK,SACH,MAAM3tD,EAAIm/D,GAAGr2D,EAAEs2D,YAAY9R,OAC3B,OAAOI,GAAG5qD,OAAO9C,EAAG,KAA4B,CAC5C6rD,YAAaiB,MAGnB,IAAK,UACH,MAAM13C,EAAI+pD,GAAGr2D,EAAEs2D,YAAY9R,OAC3B,OAAOI,GAAG5qD,OAAOsS,EAAG,KAA4B,CAC5C81C,UAAW,eAGjB,IAAK,aACH,MAAM/jD,EAAIg4D,GAAGr2D,EAAEs2D,YAAY9R,OAC3B,OAAOI,GAAG5qD,OAAOqE,EAAG,KAAgC,CAChD0kD,YAAaiB,MAGnB,IAAK,cACH,MAAM/wD,EAAIojE,GAAGr2D,EAAEs2D,YAAY9R,OAC3B,OAAOI,GAAG5qD,OAAO/G,EAAG,KAAgC,CAChDmvD,UAAW,eAGjB,QACE,OAAOpiB,MA3BmB,CA6BhChgC,QAAK,IAAWA,EAAEu2D,YAAc,SAASv2D,GACvC,OAAO4kD,GAAG5qD,OAAOq8D,GAAGr2D,EAAEu2D,YAAY/R,OAAQ,SAASxkD,GAC/C,OAAQA,GACN,IAAK,QACH,MAAO,KAET,IAAK,YACH,MAAO,KAET,IAAK,eACH,MAAO,IAET,IAAK,wBACH,MAAO,KAET,IAAK,YACH,MAAO,IAET,IAAK,qBACH,MAAO,KAET,IAAK,iBACH,MAAO,iBAET,IAAK,KACH,MAAO,KAET,IAAK,SACH,MAAO,SAET,IAAK,qBACH,MAAO,qBAET,QACE,OAAOggC,MAjC2B,CAmCxChgC,EAAEu2D,YAAY1R,IAAK7kD,EAAEu2D,YAAY77D,OApCL,CAqChCsF,QAAK,IAAWA,EAAEw2D,gBAAkB,SAASx2D,GAC3C,OAAO+I,GAAG/O,OAAOgG,EAAEw2D,gBAAgB5Q,QAAQlgB,KAAK1lC,GAAKo2D,GAAGp2D,KAAM,SAASA,GACnE,OAAQA,GACN,IAAK,MACH,MAAO,MAET,IAAK,KACH,MAAO,KAET,QACE,OAAOggC,MAT+C,CAW5DhgC,EAAEw2D,gBAAgB3R,KAZc,CAapC7kD,GAAKggC,KAGX,SAASi2B,GAAGj2D,GACR,OAAO+yD,GAAG/yD,GAGd,SAASy2D,GAAGz2D,GACR,OAAOkzD,GAAGlzD,GAGd,SAAS02D,GAAG12D,GACR,OAAOozD,GAAGpzD,GAGd,SAAS+1D,GAAG/1D,GACR,MAAO,CACHm6C,UAAWn6C,EAAE24C,mBAIrB,SAAS0d,GAAGr2D,GACR,OAAO84C,GAAGsc,iBAAiBp1D,EAAEm6C,WAGjC,SAAS0b,GAAG71D,GACR,OAAOA,aAAa4kD,GAAK,SAAS5kD,GAC9B,GAAI,OAA8BA,EAAE6kD,GAAI,CACpC,GAAIjB,GAAG5jD,EAAEtF,OAAQ,MAAO,CACpB47D,YAAa,CACT9R,MAAOuR,GAAG/1D,EAAEwkD,OACZK,GAAI,WAGZ,GAAIlB,GAAG3jD,EAAEtF,OAAQ,MAAO,CACpB47D,YAAa,CACT9R,MAAOuR,GAAG/1D,EAAEwkD,OACZK,GAAI,iBAGT,GAAI,OAAkC7kD,EAAE6kD,GAAI,CAC/C,GAAIjB,GAAG5jD,EAAEtF,OAAQ,MAAO,CACpB47D,YAAa,CACT9R,MAAOuR,GAAG/1D,EAAEwkD,OACZK,GAAI,eAGZ,GAAIlB,GAAG3jD,EAAEtF,OAAQ,MAAO,CACpB47D,YAAa,CACT9R,MAAOuR,GAAG/1D,EAAEwkD,OACZK,GAAI,gBAIhB,MAAO,CACH0R,YAAa,CACT/R,MAAOuR,GAAG/1D,EAAEwkD,OACZK,GAAI4R,GAAGz2D,EAAE6kD,IACTnqD,MAAOsF,EAAEtF,QAhCI,CAmCvBsF,GAAKA,aAAa+I,GAAK,SAAS/I,GAC9B,MAAM9I,EAAI8I,EAAE0lD,aAAahgB,KAAK1lC,GAAK61D,GAAG71D,KACtC,OAAI,IAAM9I,EAAEhE,OAAegE,EAAE,GACtB,CACHs/D,gBAAiB,CACb3R,GAAI6R,GAAG12D,EAAE6kD,IACTe,QAAS1uD,IANI,CASvB8I,GAAKggC,KAGX,SAAS20B,GAAG30D,GACR,MAAM9I,EAAI,GACV,OAAO8I,EAAE05C,OAAO5vC,SAAS9J,GAAK9I,EAAEhC,KAAK8K,EAAE24C,qBAAsB,CACzD0c,WAAYn+D,GAIpB,SAAS48D,GAAG9zD,GAER,OAAOA,EAAE9M,QAAU,GAAK,aAAe8M,EAAEgD,IAAI,IAAM,cAAgBhD,EAAEgD,IAAI,GAsB7E,SAAS2zD,GAAG32D,GACR,IAAI9I,EAAI,GACR,IAAK,IAAIoV,EAAI,EAAGA,EAAItM,EAAE9M,OAAQoZ,IAAKpV,EAAEhE,OAAS,IAAMgE,EAAI0/D,GAAG1/D,IAAKA,EAAI2/D,GAAG72D,EAAEgD,IAAIsJ,GAAIpV,GACjF,OAAO0/D,GAAG1/D,GAG2D,SAAS2/D,GAAG72D,EAAG9I,GACpF,IAAIoV,EAAIpV,EACR,MAAMmH,EAAI2B,EAAE9M,OACZ,IAAK,IAAIgE,EAAI,EAAGA,EAAImH,EAAGnH,IAAK,CACxB,MAAMmH,EAAI2B,EAAE9J,OAAOgB,GACnB,OAAQmH,GACN,IAAK,KACHiO,GAAK,KACL,MAEF,IAAK,IACHA,GAAK,KACL,MAEF,QACEA,GAAKjO,GAGb,OAAOiO,EAG2C,SAASsqD,GAAG52D,GAC9D,OAAOA,EAAI,KAQX,SAAS82D,GAAG92D,GAGZ,MAAM9I,EAAI8I,EAAE9M,OACZ,GAAIi7B,GAAEj3B,GAAK,GAAI,IAAMA,EAAG,OAAOi3B,GAAE,MAAQnuB,EAAE9J,OAAO,IAAM,MAAQ8J,EAAE9J,OAAO,IAAKwiD,GAAGS,YAG7E,MAAM7sC,EAAIpV,EAAI,EAAGmH,EAAI,GACzB,IAAIpL,EAAI,GACR,IAAK,IAAIqiD,EAAI,EAAGA,EAAIp+C,GAAK,CAGrB,MAAMA,EAAI8I,EAAEL,QAAQ,IAAK21C,GAEzB,QADCp+C,EAAI,GAAKA,EAAIoV,IAAM0zB,KACZhgC,EAAE9J,OAAOgB,EAAI,IACnB,IAAK,IACH,MAAMoV,EAAItM,EAAEtH,UAAU48C,EAAGp+C,GACzB,IAAIm+C,EACJ,IAAMpiD,EAAEC,OAGRmiD,EAAI/oC,GAAKrZ,GAAKqZ,EAAG+oC,EAAIpiD,EAAGA,EAAI,IAAKoL,EAAEnJ,KAAKmgD,GACxC,MAEF,IAAK,IACHpiD,GAAK+M,EAAEtH,UAAU48C,EAAGp+C,GAAIjE,GAAK,KAC7B,MAEF,IAAK,IAEHA,GAAK+M,EAAEtH,UAAU48C,EAAGp+C,EAAI,GACxB,MAEF,QACE8oC,KAEJsV,EAAIp+C,EAAI,EAEZ,OAAO,IAAIwhD,GAAGr6C,GAkBd,MAAM04D,GAAK,CAAE,SAAU,WA6B3B,SAASC,GAAGh3D,EAAG9I,GACX,MAAO,CAAE8I,EAAG22D,GAAGz/D,IAMf,SAAS+/D,GAAGj3D,EAAG9I,EAAGoV,GAClB,MAAO,CAAEtM,EAAG22D,GAAGz/D,GAAIoV,GAQnB,MAAM4qD,GAAK,GAAIC,GAAK,CAAE,aAAc,kBAAmB,WAAY,cAAgBC,GAAK,CAAE,aAAc,kBAAmB,cAAgBC,GAAK,CAAE,kBAAmB,WAAY,aAAc,cAAgBC,GAAK,CAAE,cAAe,YAAcC,GAAK,CAAE,WAAY,QAAUC,GAAK,CAAE,OAAQ,YAAcC,GAAK,CAAE,eAAgB,UAAYC,GAAK,CAAE,UAAW,OAASC,GAAK,CAAE,MAAO,kBAAoBC,GAAK,CAAE,UAAW,MAAO,aAAc,mBAAoB,qBAAsB,eAAiBC,GAAK,CAAE,UAAW,MAAO,sBAAwBC,GAAK,CAAE,SAAU,iBAAkB,cAAgBC,GAAK,CAAE,SAAU,iBAAkB,kBAAoBC,GAAK,CAAE,SAAU,kBAAmB,kBAAoBC,GAAK,CAAsB,iBAAkB,YAAa,oBAAqB,kBAAmB,UAAW,QAAS,eAAgB,kBAAqB,iBAAoB,uBAA0B,oBAAuB,UAAW,gBAAkBC,GAAK,IAAKD,GAAI,oBAAsBE,GAAK,CAAE,iBAAkB,YAAa,oBAAqB,qBAAsB,UAAW,QAAS,eAAgB,kBAAmB,iBAAkB,uBAAwB,oBAAqB,UAAW,eAAgB,oBAAsBC,GAAKD,GAAIE,GAAK,IAAKD,GAAI,qBAAsB,aAAc,gBAkB1xC,MAAME,WAAWtd,GACbzhD,YAAYyG,EAAG9I,GACXyC,QAAS/F,KAAKqvD,GAAKjjD,EAAGpM,KAAK2kE,sBAAwBrhE,GAI3D,SAASshE,GAAGx4D,EAAG9I,GACX,MAAMoV,EAAIknC,GAAExzC,GACZ,OAAO28C,GAAGxuB,EAAE7hB,EAAE22C,GAAI/rD,GAqBlB,MAAMuhE,GAYNl/D,YAAYyG,EAAG9I,EAAGoV,EAAGjO,GACjBzK,KAAKqrD,QAAUj/C,EAAGpM,KAAK8kE,eAAiBxhE,EAAGtD,KAAK+kE,cAAgBrsD,EAAG1Y,KAAKglE,UAAYv6D,EASjFw6D,sBAAsB74D,EAAG9I,GAC5B,MAAMoV,EAAIpV,EAAE4hE,gBACZ,IAAK,IAAI5hE,EAAI,EAAGA,EAAItD,KAAKglE,UAAU1lE,OAAQgE,IAAK,CAC5C,MAAMmH,EAAIzK,KAAKglE,UAAU1hE,GACrBmH,EAAE5D,IAAIi4C,QAAQ1yC,EAAEvF,MAChBq0D,GAAGzwD,EAAG2B,EAAGsM,EAAEpV,KAWhB6hE,iBAAiB/4D,EAAG9I,GAGvB,IAAK,MAAMoV,KAAK1Y,KAAK+kE,cAAersD,EAAE7R,IAAIi4C,QAAQ1yC,EAAEvF,OAASvD,EAAIi4D,GAAG7iD,EAAGtM,EAAG9I,EAAGtD,KAAK8kE,iBAE1E,IAAK,MAAMpsD,KAAK1Y,KAAKglE,UAAWtsD,EAAE7R,IAAIi4C,QAAQ1yC,EAAEvF,OAASvD,EAAIi4D,GAAG7iD,EAAGtM,EAAG9I,EAAGtD,KAAK8kE,iBACtF,OAAOxhE,EAMJ8hE,wBAAwBh5D,EAAG9I,GAI9B,MAAMoV,EAAIskD,KACV,OAAOh9D,KAAKglE,UAAU9uD,SAASzL,IAC3B,MAAMpL,EAAI+M,EAAEgD,IAAI3E,EAAE5D,KAAM66C,EAAIriD,EAAEw9D,kBAGlB,IAAIpb,EAAIzhD,KAAKmlE,iBAAiBzjB,EAAGriD,EAAEgmE,eAInC5jB,EAAIn+C,EAAEo7B,IAAIj0B,EAAE5D,KAAO,KAAO46C,EACtC,MAAMx/C,EAAI44D,GAAGnZ,EAAGD,GAChB,OAASx/C,GAAKyW,EAAE2E,IAAI5S,EAAE5D,IAAK5E,GAAIy/C,EAAEoV,mBAAqBpV,EAAE4U,oBAAoB3S,GAAGnS,UAC9E94B,EAETrR,OACI,OAAOrH,KAAKglE,UAAU9S,QAAQ,CAAC9lD,EAAG9I,IAAM8I,EAAEsL,IAAIpU,EAAEuD,MAAOs2D,MAE3Dre,QAAQ1yC,GACJ,OAAOpM,KAAKqrD,UAAYj/C,EAAEi/C,SAAWxI,GAAG7iD,KAAKglE,UAAW54D,EAAE44D,WAAS,CAAI54D,EAAG9I,IAAMq4D,GAAGvvD,EAAG9I,MAAQu/C,GAAG7iD,KAAK+kE,cAAe34D,EAAE24D,gBAAiB34D,EAAG9I,IAAMq4D,GAAGvvD,EAAG9I,MAIhG,MAAMgiE,GACjE3/D,YAAYyG,EAAG9I,EAAGoV,EAKlBjO,GACIzK,KAAKulE,MAAQn5D,EAAGpM,KAAKwlE,cAAgBliE,EAAGtD,KAAKklE,gBAAkBxsD,EAAG1Y,KAAKylE,YAAch7D,EAMlFk4C,YAAYv2C,EAAG9I,EAAGoV,GACrB6hB,GAAEnuB,EAAE44D,UAAU1lE,SAAWoZ,EAAEpZ,QAC3B,IAAImL,EAAIwyD,GACR,MAAM59D,EAAI+M,EAAE44D,UACZ,IAAK,IAAI54D,EAAI,EAAGA,EAAI/M,EAAEC,OAAQ8M,IAAK3B,EAAIA,EAAEyoD,OAAO7zD,EAAE+M,GAAGvF,IAAK6R,EAAEtM,GAAGiF,SAC/D,OAAO,IAAIi0D,GAAGl5D,EAAG9I,EAAGoV,EAAGjO,IAyB3B,MAAMi7D,GACN//D,YAAYyG,EAAG9I,GACXtD,KAAKinD,eAAiB76C,EAAGpM,KAAK2lE,SAAWriE,EAE7CsiE,SACI,OAAO5lE,KAAK2lE,SAAS9+D,IAEzBi4C,QAAQ1yC,GACJ,OAAO,OAASA,GAAKpM,KAAK2lE,WAAav5D,EAAEu5D,SAE7CtgE,WACI,MAAO,mCAAmCrF,KAAKinD,oCAAoCjnD,KAAK2lE,SAAStgE,qBAsBrG,MAAMwgE,GACNlgE,YAEAyG,EAKA9I,EAEAoV,EAKAjO,EAEApL,EAAIskD,GAAGnS,MAIDkQ,EAAIiC,GAAGnS,MAMPiQ,EAAIqL,GAAGO,mBACTrtD,KAAK0O,OAAStC,EAAGpM,KAAKs+D,SAAWh7D,EAAGtD,KAAKi/D,QAAUvmD,EAAG1Y,KAAKymD,eAAiBh8C,EAAGzK,KAAKu9D,gBAAkBl+D,EACtGW,KAAK8lE,6BAA+BpkB,EAAG1hD,KAAK89D,YAAcrc,EAEgBskB,mBAAmB35D,GAC7F,OAAO,IAAIy5D,GAAG7lE,KAAK0O,OAAQ1O,KAAKs+D,SAAUt+D,KAAKi/D,QAAS7yD,EAAGpM,KAAKu9D,gBAAiBv9D,KAAK8lE,6BAA8B9lE,KAAK89D,aAKtHkI,gBAAgB55D,EAAG9I,GACtB,OAAO,IAAIuiE,GAAG7lE,KAAK0O,OAAQ1O,KAAKs+D,SAAUt+D,KAAKi/D,QAASj/D,KAAKymD,eAAgBnjD,EAAGtD,KAAK8lE,6BAA8B15D,GAKhH65D,iCAAiC75D,GACpC,OAAO,IAAIy5D,GAAG7lE,KAAK0O,OAAQ1O,KAAKs+D,SAAUt+D,KAAKi/D,QAASj/D,KAAKymD,eAAgBzmD,KAAKu9D,gBAAiBnxD,EAAGpM,KAAK89D,cAoB5D,MAAMoI,GACzDvgE,YAAYyG,GACRpM,KAAKsvD,GAAKljD,GAsB6B,SAAS+5D,GAAG/5D,EAAG9I,GAC1D,MAAMoV,EAAIpV,EAAEuD,IAAK4D,EAAI,CACjB27D,WAAY1tD,EAAEitC,oBAAoBnB,UAAU32C,UAC5C23C,gBAAiB9sC,EAAE8sC,gBACnB6gB,WAAY3tD,EAAE2kB,KAAKqnB,cACnBqC,SAAUuf,GAAGhjE,EAAEyjD,UACf6P,sBAAuBtzD,EAAEszD,uBAE7B,GAAItzD,EAAEyzD,kBAAmBtsD,EAAEtH,SAAW,SAASiJ,EAAG9I,GAC9C,MAAO,CACH0C,KAAMm6D,GAAG/zD,EAAG9I,EAAEuD,KACdi/C,OAAQxiD,EAAEkD,KAAKM,MAAMgnD,SAAShI,OAC9B0U,WAAYoF,GAAGxzD,EAAG9I,EAAE+N,QAAQ0yC,eAC5BoS,WAAYyJ,GAAGxzD,EAAG9I,EAAE6yD,WAAWpS,gBALD,CAOpC33C,EAAEkjD,GAAIhsD,QAAS,GAAIA,EAAE0zD,eAAgBvsD,EAAE87D,WAAa,CAClDlpC,KAAM3kB,EAAE2kB,KAAKxvB,UACbk5C,SAAUyf,GAAGljE,EAAE+N,cACX,CACJ,IAAK/N,EAAE2zD,oBAAqB,OAAO7qB,KACnC3hC,EAAEg8D,gBAAkB,CAChBppC,KAAM3kB,EAAE2kB,KAAKxvB,UACbwD,QAASm1D,GAAGljE,EAAE+N,UAGtB,OAAO5G,EAGX,SAAS67D,GAAGl6D,GACR,MAAM9I,EAAI8I,EAAE23C,cACZ,MAAO,CAAEzgD,EAAE2/C,QAAS3/C,EAAE4/C,aAG1B,SAASsjB,GAAGp6D,GACR,MAAM9I,EAAI8I,EAAE23C,cACZ,MAAO,CACHd,QAAS3/C,EAAE2/C,QACXC,YAAa5/C,EAAE4/C,aAIvB,SAASwjB,GAAGt6D,GACR,MAAM9I,EAAI,IAAI0/C,GAAG52C,EAAE62C,QAAS72C,EAAE82C,aAC9B,OAAOS,GAAGiD,cAActjD,GAK5B,SAASqjE,GAAGv6D,EAAG9I,GACX,MAAMoV,GAAKpV,EAAEyhE,eAAiB,IAAIjzB,KAAKxuC,GAAKi+D,GAAGn1D,EAAEkjD,GAAIhsD,KAMjD,IAAK,IAAI8I,EAAI,EAAGA,EAAI9I,EAAE0hE,UAAU1lE,OAAS,IAAK8M,EAAG,CACjD,MAAMsM,EAAIpV,EAAE0hE,UAAU54D,GACtB,GAAIA,EAAI,EAAI9I,EAAE0hE,UAAU1lE,aAAU,IAAWgE,EAAE0hE,UAAU54D,EAAI,GAAGguD,UAAW,CACvE,MAAM3vD,EAAInH,EAAE0hE,UAAU54D,EAAI,GAC1BsM,EAAEuoD,iBAAmBx2D,EAAE2vD,UAAUgB,gBAAiB93D,EAAE0hE,UAAU9tD,OAAO9K,EAAI,EAAG,KAC1EA,GAGV,MAAM3B,EAAInH,EAAE0hE,UAAUlzB,KAAKxuC,GAAKi+D,GAAGn1D,EAAEkjD,GAAIhsD,KAAMjE,EAAI2jD,GAAGG,WAAW7/C,EAAEsjE,kBACnE,OAAO,IAAI/B,GAAGvhE,EAAE+nD,QAAShsD,EAAGqZ,EAAGjO,GAGO,SAASo8D,GAAGz6D,GAClD,MAAM9I,EAAIojE,GAAGt6D,EAAE26C,UAAWruC,OAAI,IAAWtM,EAAE05D,6BAA+BY,GAAGt6D,EAAE05D,8BAAgCniB,GAAGnS,MAClH,IAAI/mC,EACJ,IAAIpL,EACJ,YAAO,IAAW+M,EAAEsxB,MAAMikC,WAAapnC,GAAE,KAAOl7B,EAAI+M,EAAEsxB,OAAOikC,UAAUriE,QACvEmL,EAAIguD,GAAGN,GAAGoI,GAAGlhE,EAAEsiE,UAAU,OAASl3D,EAAI,SAAS2B,GAC3C,OAAOqsD,GAAG8J,GAAGn2D,IADqB,CAEpCA,EAAEsxB,OAAQ,IAAImoC,GAAGp7D,EAAG2B,EAAEkyD,SAAU,EAA+BlyD,EAAE06D,yBAA0BxjE,EAAGoV,EAAGo0C,GAAGa,iBAAiBvhD,EAAE0xD,cAG9D,SAASiJ,GAAG36D,EAAG9I,GAC1E,MAAMoV,EAAI8tD,GAAGljE,EAAEi6D,iBAAkB9yD,EAAI+7D,GAAGljE,EAAEwiE,8BAC1C,IAAIzmE,EACJA,EAAIq4D,GAAGp0D,EAAEoL,QAAUgzD,GAAGt1D,EAAEkjD,GAAIhsD,EAAEoL,QAAUkzD,GAAGx1D,EAAEkjD,GAAIhsD,EAAEoL,QAG/C,MAAMgzC,EAAIp+C,EAAEw6D,YAAY5Q,WAExB,MAAO,CACPoR,SAAUh7D,EAAEg7D,SACZ0I,YAAaxP,GAAGl0D,EAAEoL,QAClBq4C,SAAUruC,EACVolD,YAAapc,EACbolB,yBAA0BxjE,EAAEmjD,eAC5Bqf,6BAA8Br7D,EAC9BizB,MAAOr+B,GAaf,SAAS4nE,GAAG76D,GACR,MAAM9I,EAAIi/D,GAAG,CACTT,OAAQ11D,EAAE01D,OACVD,gBAAiBz1D,EAAEy1D,kBAEvB,MAAO,SAAWz1D,EAAE6rD,UAAYU,GAAGr1D,EAAGA,EAAE+gD,MAAO,KAA4B/gD,EAK/E,SAAS4jE,GAAG96D,EAAG9I,GACX,OAAO,IAAIoiE,GAAGpiE,EAAE2jD,eAAgBsa,GAAGn1D,EAAEkjD,GAAIhsD,EAAE6jE,kBAQ/C,SAASzH,GAAGtzD,EAAG9I,GACX,MAAMoV,EAAIpV,EAAE+5B,KAAKqnB,cACjB,MAAO,CAAEt4C,EAAG22D,GAAGz/D,EAAE+5B,KAAKmnB,WAAY9rC,GAGtC,SAAS0uD,GAAGh7D,EAAG9I,EAAGoV,EAAGjO,GACjB,MAAO,CACHo7C,QAASz5C,EACTuyC,IAAKr7C,EAAEq7C,KAAO,GACd8H,eAAgB/tC,EAChBquC,SAAUyf,GAAG/7D,EAAEs8C,UACfC,YAAa+b,GAAGt4D,EAAEu8C,YAAY3pB,MAC9B4pB,eAAgBx8C,EAAEw8C,gBAmBtB,MAAMogB,GACNC,kBAAkBl7D,EAAG9I,GACjB,OAAOikE,GAAGn7D,GAAGgD,IAAI9L,GAAGkZ,MAAMpQ,IACtB,GAAIA,EAAG,MAAO,CACVmW,IAAKjf,EAAI8I,GAAGo7D,SACZrR,WAAYuQ,GAAGpjE,EAAE6yD,YACjB9kD,QAAS/N,EAAE+N,SAGf,IAAI/N,KAGZmkE,mBAAmBr7D,EAAG9I,GAClB,OAAOikE,GAAGn7D,GAAGsS,IAAI,CACb8oD,UAAW9uD,EAAIpV,GAAGif,GAClB4zC,WAAYqQ,GAAGzG,GAAGrnD,EAAEy9C,aACpB9kD,QAASqH,EAAErH,UAEf,IAAIqH,EAERgvD,cAAct7D,EAAG9I,GACb,OAAOqkE,GAAGv7D,GAAGgD,IAAI9L,GAAGkZ,MAAMpQ,IACtB,GAAIA,EAAG,MAAO,CACVpG,MAAO1C,EAAI8I,GAAGpG,KACd03B,MAAOupC,GAAG3jE,EAAEskE,cACZ7gB,SAAU2f,GAAGpjE,EAAEyjD,WAEnB,IAAIzjD,KAGZukE,eAAez7D,EAAG9I,GACd,OAAOqkE,GAAGv7D,GAAGsS,IAAI,SAAStS,GACtB,MAAO,CACHpG,KAAMoG,EAAEpG,KACR+gD,SAAUyf,GAAGzG,GAAG3zD,EAAE26C,WAClB6gB,aAAcx7D,EAAEw7D,cAJP,CAMftkE,KAMN,SAASikE,GAAGn7D,GACZ,OAAOw4D,GAAGx4D,EAAG,WAKb,SAASu7D,GAAGv7D,GACZ,OAAOw4D,GAAGx4D,EAAG,gBAqBb,MAAM07D,GAKNniE,YAAYyG,EAAG9I,GACXtD,KAAK0mD,GAAKt6C,EAAGpM,KAAK+nE,OAASzkE,EAE/Bq/C,UAAUv2C,EAAG9I,GACT,MAAMoV,EAAIpV,EAAEq7C,KAAO,GACnB,OAAO,IAAImpB,GAAG17D,EAAGsM,GAErBsvD,WAAW57D,EAAG9I,GACV,OAAO2kE,GAAG77D,GAAGgD,IAAIswD,GAAG1/D,KAAK+nE,OAAQzkE,IAAIkZ,MAAMpQ,GAAKA,EAAI86D,GAAGlnE,KAAK0mD,GAAIt6C,GAAK,OAEzE87D,YAAY97D,EAAG9I,GACX,MAAMoV,EAAIokD,KACV,OAAOpV,GAAGxxC,QAAQ5S,GAAIA,GAAKtD,KAAKgoE,WAAW57D,EAAG9I,GAAGkZ,MAAMpQ,IACnD,OAASA,GAAKsM,EAAE2E,IAAI/Z,EAAG8I,QACrBoQ,UAAY9D,IAEtByvD,aAAa/7D,EAAG9I,EAAGoV,GACf,MAAMjO,EAAI,GACV,OAAOiO,EAAExC,UAAUwC,EAAGrZ,KAClB,MAAMqiD,EAAI,IAAIgkB,GAAGpiE,EAAGjE,GACpBoL,EAAEnJ,KAAKtB,KAAKyvD,GAAGrjD,EAAGs1C,OACjBgG,GAAGS,QAAQ19C,GAEpB29D,yBAAyBh8D,EAAG9I,EAAGoV,GAC3B,MAAMjO,EAAI,IAAI2oB,IAEN9vB,EAAE4S,SAAS9J,GAAK3B,EAAEiN,IAAIqrD,GAAG32D,EAAEu5C,wBACnC,MAAMtmD,EAAI,GACV,OAAOoL,EAAEyL,SAAS5S,IACd,MAAMmH,EAAI49D,YAAYC,MAAM,CAAEtoE,KAAK+nE,OAAQzkE,EAAGoV,GAAK,CAAE1Y,KAAK+nE,OAAQzkE,EAAGoV,EAAI,IAC1D,GACA,GACfrZ,EAAEiC,KAAK2mE,GAAG77D,GAAGyrC,EAAE,6BAA8BptC,OAC5Ci9C,GAAGS,QAAQ9oD,GAEpBkpE,yBAAyBn8D,EAAG9I,EAAGoV,GAC3B,MAAMjO,EAAIqyD,KAAMz9D,EAAI0jE,GAAGz/D,GAAIo+C,EAAI2mB,YAAYC,MAAM,CAAEtoE,KAAK+nE,OAAQ1oE,EAAGqZ,GAAK,CAAE1Y,KAAK+nE,OAAQ1oE,EAAGwgB,OAAO2oD,oBAClF,GACf,OAAOP,GAAG77D,GAAGs8B,EAAE,6BAA8BgZ,GAAGllC,MAAMpQ,IAClD,IAAK,MAAM9I,KAAK8I,EAAG,CACf,MAAMA,EAAI86D,GAAGlnE,KAAK0mD,GAAIpjD,GACtBmH,EAAE4S,IAAIjR,EAAEw5D,SAAUx5D,GAEtB,OAAO3B,KAGfg+D,8BAA8Br8D,EAAG9I,EAAGoV,EAAGjO,GACnC,MAAMpL,EAAIy9D,KACV,IAAIpb,EAGI,MAAMD,EAAI4mB,YAAYC,MAAM,CAAEtoE,KAAK+nE,OAAQzkE,EAAGoV,GAAK,CAAE1Y,KAAK+nE,OAAQzkE,EAAGuc,OAAO2oD,oBACrE,GACf,OAAOP,GAAG77D,GAAGw2C,EAAE,CACX/qC,MAAO,8BACP+xC,MAAOnI,KACNr1C,EAAG9I,EAAGoV,KAKP,MAAM+oC,EAAIylB,GAAGlnE,KAAK0mD,GAAIpjD,GACtBjE,EAAEqlB,OAASja,GAAKg3C,EAAEwF,iBAAmBvF,GAAKriD,EAAEge,IAAIokC,EAAEmkB,SAAUnkB,GAAIC,EAAID,EAAEwF,gBAAkBvuC,EAAE2uB,UAC1F7qB,UAAYnd,IAEpBowD,GAAGrjD,EAAG9I,GACF,OAAO2kE,GAAG77D,GAAGsS,IAAI,SAAStS,EAAG9I,EAAGoV,GAC5B,MAAOjO,EAAGpL,EAAGqiD,GAAKge,GAAGp8D,EAAGoV,EAAEitD,SAAS9+D,KACnC,MAAO,CACHkhE,OAAQzkE,EACRolE,eAAgBrpE,EAChBgnE,WAAY3kB,EACZ8D,gBAAiB9sC,EAAEitD,SAAS9+D,IAAI6+C,qBAChCuB,eAAgBvuC,EAAEuuC,eAClBkgB,gBAAiBvG,GAAGx0D,EAAEkjD,GAAI52C,EAAEitD,WARnB,CAUf3lE,KAAK0mD,GAAI1mD,KAAK+nE,OAAQzkE,KAM5B,SAAS2kE,GAAG77D,GACZ,OAAOw4D,GAAGx4D,EAAG,oBAsBjB,MAAMu8D,GACFhjE,eAQA+pD,GAAGtjD,EAAG9I,GACFtD,KAAK4vD,GAAGxjD,EAAG9I,GAGXA,EAAEusD,KAEND,GAAGxjD,EAAG9I,GACF,GAAI,cAAe8I,EAAGpM,KAAK8vD,GAAGxsD,EAAG,QAAS,GAAI,iBAAkB8I,EAAGpM,KAAK8vD,GAAGxsD,EAAG,IAC9EA,EAAEysD,GAAG3jD,EAAEwiD,aAAe,EAAI,QAAS,GAAI,iBAAkBxiD,EAAGpM,KAAK8vD,GAAGxsD,EAAG,IAAKA,EAAEysD,GAAGtC,GAAGrhD,EAAE8iD,oBAAqB,GAAI,gBAAiB9iD,EAAG,CAC/H,MAAMsM,EAAI+0C,GAAGrhD,EAAE+iD,aACfxgC,MAAMjW,GAAK1Y,KAAK8vD,GAAGxsD,EAAG,KAAOtD,KAAK8vD,GAAGxsD,EAAG,IAAKkpD,GAAG9zC,GAEhDpV,EAAEysD,GAAG,GAAKzsD,EAAEysD,GAAGr3C,SACZ,GAAI,mBAAoBtM,EAAG,CAC9B,MAAMsM,EAAItM,EAAEiiD,eACZruD,KAAK8vD,GAAGxsD,EAAG,IAAK,iBAAmBoV,EAAIpV,EAAE0sD,GAAGt3C,IAAMpV,EAAE0sD,GAAG,GAAGt3C,EAAEuqC,SAAW,MAAO3/C,EAAEysD,GAAGr3C,EAAE80C,OAAS,SAC3F,GAAI,gBAAiBphD,EAAGpM,KAAKiwD,GAAG7jD,EAAE4hD,YAAa1qD,GAAItD,KAAKkwD,GAAG5sD,QAAS,GAAI,eAAgB8I,EAAGpM,KAAK8vD,GAAGxsD,EAAG,IAC7GA,EAAEorD,GAAGhB,GAAGthD,EAAEyiD,aAAc7uD,KAAKkwD,GAAG5sD,QAAS,GAAI,mBAAoB8I,EAAGpM,KAAK2M,GAAGP,EAAE0iD,eAAgBxrD,QAAS,GAAI,kBAAmB8I,EAAG,CAC7H,MAAMsM,EAAItM,EAAE2iD,cACZ/uD,KAAK8vD,GAAGxsD,EAAG,IAAKA,EAAEysD,GAAGr3C,EAAEs2C,UAAY,GAAI1rD,EAAEysD,GAAGr3C,EAAEu2C,WAAa,OACxD,aAAc7iD,EAAIsiD,GAAGtiD,GAAKpM,KAAK8vD,GAAGxsD,EAAGuc,OAAO8sC,mBAAqB3sD,KAAKqwD,GAAGjkD,EAAE0hD,SAAUxqD,GAC5FtD,KAAKkwD,GAAG5sD,IAAM,eAAgB8I,GAAKpM,KAAKswD,GAAGlkD,EAAEgjD,WAAY9rD,GAAItD,KAAKkwD,GAAG5sD,IAAM8oC,KAE/E6jB,GAAG7jD,EAAG9I,GACFtD,KAAK8vD,GAAGxsD,EAAG,IAAKtD,KAAKwwD,GAAGpkD,EAAG9I,GAE/BktD,GAAGpkD,EAAG9I,GACFA,EAAE0sD,GAAG5jD,GAETikD,GAAGjkD,EAAG9I,GACF,MAAMoV,EAAItM,EAAE05C,QAAU,GACtB9lD,KAAK8vD,GAAGxsD,EAAG,IACX,IAAK,MAAM8I,KAAKjH,OAAOkC,KAAKqR,GAAI1Y,KAAKiwD,GAAG7jD,EAAG9I,GAAItD,KAAK4vD,GAAGl3C,EAAEtM,GAAI9I,GAEjEgtD,GAAGlkD,EAAG9I,GACF,MAAMoV,EAAItM,EAAEqf,QAAU,GACtBzrB,KAAK8vD,GAAGxsD,EAAG,IACX,IAAK,MAAM8I,KAAKsM,EAAG1Y,KAAK4vD,GAAGxjD,EAAG9I,GAElCqJ,GAAGP,EAAG9I,GACFtD,KAAK8vD,GAAGxsD,EAAG,IACX+hD,GAAGsK,SAASvjD,GAAGixB,KAAKnnB,SAAS9J,IACzBpM,KAAK8vD,GAAGxsD,EAAG,IAAKtD,KAAKwwD,GAAGpkD,EAAG9I,MAGnCwsD,GAAG1jD,EAAG9I,GACF8I,EAAE2jD,GAAGzsD,GAET4sD,GAAG9jD,GAICA,EAAE2jD,GAAG,IAWb,SAAS6Y,GAAGx8D,GACR,GAAI,IAAMA,EAAG,OAAO,EACpB,IAAI9I,EAAI,EACR,OAAO8I,GAAK,GAAK,IAEjB9I,GAAK,EAAG8I,IAAM,GAAIA,GAAK,GAAK,IAE5B9I,GAAK,EAAG8I,IAAM,GAAIA,GAAK,GAAK,IAE5B9I,GAAK,GAAIA,EAQb,SAASulE,GAAGz8D,GAER,MAAM9I,EAAI,GAAK,SAAS8I,GACpB,IAAI9I,EAAI,EACR,IAAK,IAAIoV,EAAI,EAAGA,EAAI,IAAKA,EAAG,CACxB,MAAMjO,EAAIm+D,GAAG,IAAMx8D,EAAEsM,IACrB,GAAIpV,GAAKmH,EAAG,IAAMA,EAAG,MAEzB,OAAOnH,EANI,CAOb8I,GACF,OAAOxB,KAAKk+D,KAAKxlE,EAAI,GAlCzBqlE,GAAGlY,GAAK,IAAIkY,GA0CR,MAAMI,GACNpjE,cACI3F,KAAKgiC,OAAS,IAAImF,WAAW,MAAOnnC,KAAK0wD,SAAW,EAExDC,GAAGvkD,GACC,MAAM9I,EAAI8I,EAAE4gD,OAAOC,YACnB,IAAIv0C,EAAIpV,EAAEkZ,OACV,MAAO9D,EAAE2uB,MAAQrnC,KAAK8wD,GAAGp4C,EAAE5R,OAAQ4R,EAAIpV,EAAEkZ,OACzCxc,KAAK+wD,KAETC,GAAG5kD,GACC,MAAM9I,EAAI8I,EAAE4gD,OAAOC,YACnB,IAAIv0C,EAAIpV,EAAEkZ,OACV,MAAO9D,EAAE2uB,MAAQrnC,KAAKmV,GAAGuD,EAAE5R,OAAQ4R,EAAIpV,EAAEkZ,OACzCxc,KAAKiyD,KAEuDE,GAAG/lD,GAC/D,IAAK,MAAM9I,KAAK8I,EAAG,CACf,MAAMA,EAAI9I,EAAE9D,WAAW,GACvB,GAAI4M,EAAI,IAAKpM,KAAK8wD,GAAG1kD,QAAS,GAAIA,EAAI,KAAMpM,KAAK8wD,GAAG,IAAM1kD,IAAM,GAAIpM,KAAK8wD,GAAG,IAAM,GAAK1kD,QAAS,GAAI9I,EAAI,UAAY,SAAWA,EAAGtD,KAAK8wD,GAAG,IAAM1kD,IAAM,IACtJpM,KAAK8wD,GAAG,IAAM,GAAK1kD,IAAM,GAAIpM,KAAK8wD,GAAG,IAAM,GAAK1kD,OAAS,CACrD,MAAMA,EAAI9I,EAAE0lE,YAAY,GACxBhpE,KAAK8wD,GAAG,IAAM1kD,IAAM,IAAKpM,KAAK8wD,GAAG,IAAM,GAAK1kD,IAAM,IAAKpM,KAAK8wD,GAAG,IAAM,GAAK1kD,IAAM,GAChFpM,KAAK8wD,GAAG,IAAM,GAAK1kD,IAG3BpM,KAAK+wD,KAEuDqB,GAAGhmD,GAC/D,IAAK,MAAM9I,KAAK8I,EAAG,CACf,MAAMA,EAAI9I,EAAE9D,WAAW,GACvB,GAAI4M,EAAI,IAAKpM,KAAKmV,GAAG/I,QAAS,GAAIA,EAAI,KAAMpM,KAAKmV,GAAG,IAAM/I,IAAM,GAAIpM,KAAKmV,GAAG,IAAM,GAAK/I,QAAS,GAAI9I,EAAI,UAAY,SAAWA,EAAGtD,KAAKmV,GAAG,IAAM/I,IAAM,IACtJpM,KAAKmV,GAAG,IAAM,GAAK/I,IAAM,GAAIpM,KAAKmV,GAAG,IAAM,GAAK/I,OAAS,CACrD,MAAMA,EAAI9I,EAAE0lE,YAAY,GACxBhpE,KAAKmV,GAAG,IAAM/I,IAAM,IAAKpM,KAAKmV,GAAG,IAAM,GAAK/I,IAAM,IAAKpM,KAAKmV,GAAG,IAAM,GAAK/I,IAAM,GAChFpM,KAAKmV,GAAG,IAAM,GAAK/I,IAG3BpM,KAAKiyD,KAETI,GAAGjmD,GAGC,MAAM9I,EAAItD,KAAKsyD,GAAGlmD,GAAIsM,EAAImwD,GAAGvlE,GAC7BtD,KAAKuyD,GAAG,EAAI75C,GAAI1Y,KAAKgiC,OAAOhiC,KAAK0wD,YAAc,IAAMh4C,EAErD,IAAK,IAAItM,EAAI9I,EAAEhE,OAASoZ,EAAGtM,EAAI9I,EAAEhE,SAAU8M,EAAGpM,KAAKgiC,OAAOhiC,KAAK0wD,YAAc,IAAMptD,EAAE8I,GAEzFomD,GAAGpmD,GAGC,MAAM9I,EAAItD,KAAKsyD,GAAGlmD,GAAIsM,EAAImwD,GAAGvlE,GAC7BtD,KAAKuyD,GAAG,EAAI75C,GAAI1Y,KAAKgiC,OAAOhiC,KAAK0wD,cAAgB,IAAMh4C,GAEvD,IAAK,IAAItM,EAAI9I,EAAEhE,OAASoZ,EAAGtM,EAAI9I,EAAEhE,SAAU8M,EAAGpM,KAAKgiC,OAAOhiC,KAAK0wD,cAAgB,IAAMptD,EAAE8I,IAKpFqmD,KACHzyD,KAAKmxD,GAAG,KAAMnxD,KAAKmxD,GAAG,KAKnBK,KACHxxD,KAAKyxD,GAAG,KAAMzxD,KAAKyxD,GAAG,KAKnB50C,QACH7c,KAAK0wD,SAAW,EAEpBuY,KAAK78D,GACDpM,KAAKuyD,GAAGnmD,EAAE9M,QAASU,KAAKgiC,OAAO3kB,IAAIjR,EAAGpM,KAAK0wD,UAAW1wD,KAAK0wD,UAAYtkD,EAAE9M,OAEhBozD,KACzD,OAAO1yD,KAAKgiC,OAAOv2B,MAAM,EAAGzL,KAAK0wD,UAQ9B4B,GAAGlmD,GACN,MAAM9I,EAEN,SAAS8I,GACL,MAAM9I,EAAI,IAAI4lE,SAAS,IAAIC,YAAY,IACvC,OAAO7lE,EAAE8lE,WAAW,EAAGh9D,GAAuB,GAAK,IAAI+6B,WAAW7jC,EAAE0+B,QAFxE,CAGE51B,GAAIsM,EAAI,IAAM,IAAMpV,EAAE,IAIxBA,EAAE,IAAMoV,EAAI,IAAM,IAClB,IAAK,IAAItM,EAAI,EAAGA,EAAI9I,EAAEhE,SAAU8M,EAAG9I,EAAE8I,IAAMsM,EAAI,IAAM,EACrD,OAAOpV,EAE6CwtD,GAAG1kD,GACvD,MAAM9I,EAAI,IAAM8I,EAChB,IAAM9I,GAAKtD,KAAKmxD,GAAG,GAAInxD,KAAKmxD,GAAG,MAAQ,MAAQ7tD,GAAKtD,KAAKmxD,GAAG,KAAMnxD,KAAKmxD,GAAG,IAAMnxD,KAAKmxD,GAAG7tD,GAElC6R,GAAG/I,GACzD,MAAM9I,EAAI,IAAM8I,EAChB,IAAM9I,GAAKtD,KAAKyxD,GAAG,GAAIzxD,KAAKyxD,GAAG,MAAQ,MAAQnuD,GAAKtD,KAAKyxD,GAAG,KAAMzxD,KAAKyxD,GAAG,IAAMzxD,KAAKyxD,GAAGrlD,GAE5F2kD,KACI/wD,KAAKmxD,GAAG,GAAInxD,KAAKmxD,GAAG,GAExBc,KACIjyD,KAAKyxD,GAAG,GAAIzxD,KAAKyxD,GAAG,GAExBN,GAAG/kD,GACCpM,KAAKuyD,GAAG,GAAIvyD,KAAKgiC,OAAOhiC,KAAK0wD,YAActkD,EAE/CqlD,GAAGrlD,GACCpM,KAAKuyD,GAAG,GAAIvyD,KAAKgiC,OAAOhiC,KAAK0wD,aAAetkD,EAEhDmmD,GAAGnmD,GACC,MAAM9I,EAAI8I,EAAIpM,KAAK0wD,SACnB,GAAIptD,GAAKtD,KAAKgiC,OAAO1iC,OAAQ,OAErB,IAAIoZ,EAAI,EAAI1Y,KAAKgiC,OAAO1iC,OAExBoZ,EAAIpV,IAAMoV,EAAIpV,GAEd,MAAMmH,EAAI,IAAI08B,WAAWzuB,GACjCjO,EAAE4S,IAAIrd,KAAKgiC,QACXhiC,KAAKgiC,OAASv3B,GAItB,MAAM4+D,GACF1jE,YAAYyG,GACRpM,KAAKoxD,GAAKhlD,EAEdsiD,GAAGtiD,GACCpM,KAAKoxD,GAAGT,GAAGvkD,GAEf4jD,GAAG5jD,GACCpM,KAAKoxD,GAAGe,GAAG/lD,GAEf2jD,GAAG3jD,GACCpM,KAAKoxD,GAAGiB,GAAGjmD,GAEfyjD,KACI7vD,KAAKoxD,GAAGqB,MAIhB,MAAM6W,GACF3jE,YAAYyG,GACRpM,KAAKoxD,GAAKhlD,EAEdsiD,GAAGtiD,GACCpM,KAAKoxD,GAAGJ,GAAG5kD,GAEf4jD,GAAG5jD,GACCpM,KAAKoxD,GAAGgB,GAAGhmD,GAEf2jD,GAAG3jD,GACCpM,KAAKoxD,GAAGoB,GAAGpmD,GAEfyjD,KACI7vD,KAAKoxD,GAAGI,MAOZ,MAAM+X,GACN5jE,cACI3F,KAAKoxD,GAAK,IAAI2X,GAAI/oE,KAAKqxD,GAAK,IAAIgY,GAAGrpE,KAAKoxD,IAAKpxD,KAAKsxD,GAAK,IAAIgY,GAAGtpE,KAAKoxD,IAEvE6X,KAAK78D,GACDpM,KAAKoxD,GAAG6X,KAAK78D,GAEjBmlD,GAAGnlD,GACC,OAAO,IAAgCA,EAAIpM,KAAKqxD,GAAKrxD,KAAKsxD,GAE9DoB,KACI,OAAO1yD,KAAKoxD,GAAGsB,KAEnB71C,QACI7c,KAAKoxD,GAAGv0C,SAoBwD,MAAM2sD,GAC1E7jE,YAAYyG,EAAG9I,EAAGoV,EAAGjO,GACjBzK,KAAK6lD,QAAUz5C,EAAGpM,KAAKgnD,YAAc1jD,EAAGtD,KAAKovD,WAAa12C,EAAG1Y,KAAKypE,iBAAmBh/D,EAKlFmoD,KACH,MAAMxmD,EAAIpM,KAAKypE,iBAAiBnqE,OAAQgE,EAAI,IAAM8I,GAAK,MAAQpM,KAAKypE,iBAAiBr9D,EAAI,GAAKA,EAAI,EAAIA,EAAGsM,EAAI,IAAIyuB,WAAW7jC,GAC5H,OAAOoV,EAAE2E,IAAIrd,KAAKypE,iBAAkB,GAAInmE,IAAM8I,EAAIsM,EAAE2E,IAAI,CAAE,GAAKrd,KAAKypE,iBAAiBnqE,UAAYoZ,EAAEA,EAAEpZ,OAAS,GAC9G,IAAIkqE,GAAGxpE,KAAK6lD,QAAS7lD,KAAKgnD,YAAahnD,KAAKovD,WAAY12C,IAIhE,SAASgxD,GAAGt9D,EAAG9I,GACX,IAAIoV,EAAItM,EAAEy5C,QAAUviD,EAAEuiD,QACtB,OAAO,IAAMntC,EAAIA,GAAKA,EAAIixD,GAAGv9D,EAAEgjD,WAAY9rD,EAAE8rD,YAAa,IAAM12C,EAAIA,GAAKA,EAAIixD,GAAGv9D,EAAEq9D,iBAAkBnmE,EAAEmmE,kBACtG,IAAM/wD,EAAIA,EAAI2sC,GAAGlB,WAAW/3C,EAAE46C,YAAa1jD,EAAE0jD,eAGjD,SAAS2iB,GAAGv9D,EAAG9I,GACX,IAAK,IAAIoV,EAAI,EAAGA,EAAItM,EAAE9M,QAAUoZ,EAAIpV,EAAEhE,SAAUoZ,EAAG,CAC/C,MAAMjO,EAAI2B,EAAEsM,GAAKpV,EAAEoV,GACnB,GAAI,IAAMjO,EAAG,OAAOA,EAExB,OAAO2B,EAAE9M,OAASgE,EAAEhE,OAsCpB,MAAMsqE,GACNjkE,YAAYyG,GACRpM,KAAK+hE,aAAe,MAAQ31D,EAAEo5C,gBAAkBp5C,EAAEo5C,gBAAkBp5C,EAAEixB,KAAKqnB,cAC3E1kD,KAAK6yD,GAAKzmD,EAAEgrD,QAASp3D,KAAK8yD,GAAK,GAC/B,IAAK,MAAMxvD,KAAK8I,EAAE4lD,QAAS,CACvB,MAAM5lD,EAAI9I,EACV8I,EAAEwlD,eAAiB5xD,KAAK0zD,GAAKtnD,EAAIpM,KAAK8yD,GAAGxxD,KAAK8K,IAuB/C4mD,GAAG5mD,GACNmuB,GAAEnuB,EAAEo5C,kBAAoBxlD,KAAK+hE,cAE7B,MAAMz+D,EAAI0iD,GAAG55C,GACb,QAAI,IAAW9I,IAAMtD,KAAKi1D,GAAG3xD,GAAI,OAAO,EACxC,MAAMoV,EAAIwtC,GAAG95C,GACb,IAAI3B,EAAI,EAAGpL,EAAI,EAEf,KAAMoL,EAAIiO,EAAEpZ,QAAUU,KAAKi1D,GAAGv8C,EAAEjO,MAAOA,GAI/B,GAAIA,IAAMiO,EAAEpZ,OAAQ,OAAO,EAG3B,QAAI,IAAWU,KAAK0zD,GAAI,CAC5B,MAAMtnD,EAAIsM,EAAEjO,GACZ,IAAKzK,KAAKu1D,GAAGv1D,KAAK0zD,GAAItnD,KAAOpM,KAAKy1D,GAAGz1D,KAAK6yD,GAAGxzD,KAAM+M,GAAI,OAAO,IAC5D3B,EAIE,KAAMA,EAAIiO,EAAEpZ,SAAUmL,EAAG,CAC7B,MAAM2B,EAAIsM,EAAEjO,GACZ,GAAIpL,GAAKW,KAAK6yD,GAAGvzD,SAAWU,KAAKy1D,GAAGz1D,KAAK6yD,GAAGxzD,KAAM+M,GAAI,OAAO,EAEjE,OAAO,EAEX6oD,GAAG7oD,GACC,IAAK,MAAM9I,KAAKtD,KAAK8yD,GAAI,GAAI9yD,KAAKu1D,GAAGjyD,EAAG8I,GAAI,OAAO,EACnD,OAAO,EAEXmpD,GAAGnpD,EAAG9I,GACF,QAAI,IAAW8I,IAAMA,EAAEwkD,MAAM9R,QAAQx7C,EAAEijD,WAAY,OAAO,EAC1D,MAAM7tC,EAAI,mBAAmDtM,EAAE6kD,IAAM,uBAA2D7kD,EAAE6kD,GAClI,OAAO,IAA+B3tD,EAAE2iD,OAASvtC,EAErD+8C,GAAGrpD,EAAG9I,GACF,QAAS8I,EAAEwkD,MAAM9R,QAAQx7C,EAAEijD,aAAe,IAAgCjjD,EAAE2iD,MAAQ,QAAoC75C,EAAEykD,KAAO,IAAiCvtD,EAAE2iD,MAAQ,SAAsC75C,EAAEykD,MA4BxN,SAASgZ,GAAGz9D,GACZ,IAAI9I,EAAGoV,EACP,GAAI6hB,GAAEnuB,aAAa4kD,IAAM5kD,aAAa+I,IAAK/I,aAAa4kD,GAAI,CACxD,GAAI5kD,aAAailD,GAAI,CACjB,MAAM5mD,GAAK,QAAUiO,EAAI,QAAUpV,EAAI8I,EAAEtF,MAAMsoD,kBAAe,IAAW9rD,OAAI,EAASA,EAAEmoB,cAAW,IAAW/S,OAAI,EAASA,EAAEo5B,KAAKxuC,GAAK0tD,GAAG5qD,OAAOgG,EAAEwkD,MAAO,KAA4BttD,OAAS,GAC/L,OAAO6R,GAAG/O,OAAOqE,EAAG,MAGxB,OAAO2B,EAGP,MAAM3B,EAAI2B,EAAE4lD,QAAQlgB,KAAK1lC,GAAKy9D,GAAGz9D,KACrC,OAAO+I,GAAG/O,OAAOqE,EAAG2B,EAAE6kD,IAatB,SAAS6Y,GAAG19D,GACZ,GAAI,IAAMA,EAAE0lD,aAAaxyD,OAAQ,MAAO,GACxC,MAAMgE,EAAIymE,GAAGF,GAAGz9D,IAChB,OAAOmuB,GAAEyvC,GAAG1mE,IAAK2mE,GAAG3mE,IAAM4mE,GAAG5mE,GAAK,CAAEA,GAAMA,EAAEwuD,aAGkC,SAASmY,GAAG79D,GAC1F,OAAOA,aAAa4kD,GAMpB,SAASkZ,GAAG99D,GACZ,OAAOA,aAAa+I,IAAMi9C,GAAGhmD,GAU7B,SAAS49D,GAAG59D,GACZ,OAAO69D,GAAG79D,IAAM89D,GAAG99D,IAKnB,SAASA,GACL,GAAIA,aAAa+I,IAAMg9C,GAAG/lD,GAAI,CAC1B,IAAK,MAAM9I,KAAK8I,EAAE0lD,aAAc,IAAKmY,GAAG3mE,KAAO4mE,GAAG5mE,GAAI,OAAO,EAC7D,OAAO,EAEX,OAAO,EALX,CAME8I,GAGN,SAAS29D,GAAG39D,GACR,GAAImuB,GAAEnuB,aAAa4kD,IAAM5kD,aAAa+I,IAAK/I,aAAa4kD,GAAI,OAAO5kD,EACnE,GAAI,IAAMA,EAAE4lD,QAAQ1yD,OAAQ,OAAOyqE,GAAG39D,EAAE4lD,QAAQ,IAE5C,MAAM1uD,EAAI8I,EAAE4lD,QAAQlgB,KAAK1lC,GAAK29D,GAAG39D,KACrC,IAAIsM,EAAIvD,GAAG/O,OAAO9C,EAAG8I,EAAE6kD,IACvB,OAAOv4C,EAAIyxD,GAAGzxD,GAAIsxD,GAAGtxD,GAAKA,GAAK6hB,GAAE7hB,aAAavD,IAAKolB,GAAE03B,GAAGv5C,IAAK6hB,GAAE7hB,EAAEs5C,QAAQ1yD,OAAS,GAClFoZ,EAAEs5C,QAAQE,QAAM,CAAG9lD,EAAG9I,IAAM8mE,GAAGh+D,EAAG9I,MAGtC,SAAS8mE,GAAGh+D,EAAG9I,GACX,IAAIoV,EACJ,OAAO6hB,GAAEnuB,aAAa4kD,IAAM5kD,aAAa+I,IAAKolB,GAAEj3B,aAAa0tD,IAAM1tD,aAAa6R,IAEhFuD,EAAItM,aAAa4kD,GAAK1tD,aAAa0tD,GAAK,SAAS5kD,EAAG9I,GAEhD,OAAO6R,GAAG/O,OAAO,CAAEgG,EAAG9I,GAAK,OAFS,CAGtC8I,EAAG9I,GAAK+mE,GAAGj+D,EAAG9I,GAAKA,aAAa0tD,GAAKqZ,GAAG/mE,EAAG8I,GAAK,SAASA,EAAG9I,GAO1D,GAAIi3B,GAAEnuB,EAAE4lD,QAAQ1yD,OAAS,GAAKgE,EAAE0uD,QAAQ1yD,OAAS,GAAI2yD,GAAG7lD,IAAM6lD,GAAG3uD,GAAI,OAAOkvD,GAAGpmD,EAAG9I,EAAEwuD,cAI5E,MAAMp5C,EAAIy5C,GAAG/lD,GAAKA,EAAI9I,EAAGmH,EAAI0nD,GAAG/lD,GAAK9I,EAAI8I,EAAG/M,EAAIqZ,EAAEs5C,QAAQlgB,KAAK1lC,GAAKg+D,GAAGh+D,EAAG3B,KAClF,OAAO0K,GAAG/O,OAAO/G,EAAG,MAZ0B,CAahD+M,EAAG9I,GAAI6mE,GAAGzxD,GAGhB,SAAS2xD,GAAGj+D,EAAG9I,GAIX,GAAI2uD,GAAG3uD,GAEP,OAAOkvD,GAAGlvD,EAAG8I,EAAE0lD,cACf,CAEI,MAAMp5C,EAAIpV,EAAE0uD,QAAQlgB,KAAKxuC,GAAK8mE,GAAGh+D,EAAG9I,KACpC,OAAO6R,GAAG/O,OAAOsS,EAAG,OAaxB,SAASyxD,GAAG/9D,GACZ,GAAImuB,GAAEnuB,aAAa4kD,IAAM5kD,aAAa+I,IAAK/I,aAAa4kD,GAAI,OAAO5kD,EACnE,MAAM9I,EAAI8I,EAAE0lD,aAER,GAAI,IAAMxuD,EAAEhE,OAAQ,OAAO6qE,GAAG7mE,EAAE,IAEhC,GAAI+uD,GAAGjmD,GAAI,OAAOA,EAGlB,MAAMsM,EAAIpV,EAAEwuC,KAAK1lC,GAAK+9D,GAAG/9D,KAAM3B,EAAI,GAQnC,OAAOiO,EAAExC,SAAS5S,IAClBA,aAAa0tD,GAAKvmD,EAAEnJ,KAAKgC,GAAKA,aAAa6R,KAAO7R,EAAE2tD,KAAO7kD,EAAE6kD,GAI7DxmD,EAAEnJ,QAAQgC,EAAE0uD,SAIZvnD,EAAEnJ,KAAKgC,OACN,IAAMmH,EAAEnL,OAASmL,EAAE,GAAK0K,GAAG/O,OAAOqE,EAAG2B,EAAE6kD,IAqB5C,MAAMqZ,GACN3kE,cACI3F,KAAK01D,GAAK,IAAI6U,GAElBC,2BAA2Bp+D,EAAG9I,GAC1B,OAAOtD,KAAK01D,GAAGh+C,IAAIpU,GAAIokD,GAAGxpC,UAE9BusD,qBAAqBr+D,EAAG9I,GACpB,OAAOokD,GAAGxpC,QAAQle,KAAK01D,GAAGgV,WAAWpnE,IAEzCqnE,cAAcv+D,EAAG9I,GAEb,OAAOokD,GAAGxpC,UAEd0sD,iBAAiBx+D,EAAG9I,GAEhB,OAAOokD,GAAGxpC,UAEd2sD,2BAA2Bz+D,EAAG9I,GAE1B,OAAOokD,GAAGxpC,QAAQ,MAEtB4sD,aAAa1+D,EAAG9I,GAEZ,OAAOokD,GAAGxpC,QAAQ,GAEtB6sD,gBAAgB3+D,EAAG9I,GAEf,OAAOokD,GAAGxpC,QAAQ,IAEtB4sC,+BAA+B1+C,GAE3B,OAAOs7C,GAAGxpC,QAAQ,MAEtB8sD,aAAa5+D,EAAG9I,GACZ,OAAOokD,GAAGxpC,QAAQwoC,GAAGlV,OAEzBuZ,gCAAgC3+C,EAAG9I,GAC/B,OAAOokD,GAAGxpC,QAAQwoC,GAAGlV,OAEzB4Z,sBAAsBh/C,EAAG9I,EAAGoV,GAExB,OAAOgvC,GAAGxpC,UAEditC,mBAAmB/+C,EAAG9I,GAElB,OAAOokD,GAAGxpC,WAQd,MAAMqsD,GACN5kE,cACI3F,KAAK6X,MAAQ,GAGjBH,IAAItL,GACA,MAAM9I,EAAI8I,EAAEs4C,cAAehsC,EAAItM,EAAEo4C,UAAW/5C,EAAIzK,KAAK6X,MAAMvU,IAAM,IAAI2xD,GAAGnQ,GAAGX,YAAa9kD,GAAKoL,EAAEi0B,IAAIhmB,GACnG,OAAO1Y,KAAK6X,MAAMvU,GAAKmH,EAAEiN,IAAIgB,GAAIrZ,EAErCq/B,IAAItyB,GACA,MAAM9I,EAAI8I,EAAEs4C,cAAehsC,EAAItM,EAAEo4C,UAAW/5C,EAAIzK,KAAK6X,MAAMvU,GAC3D,OAAOmH,GAAKA,EAAEi0B,IAAIhmB,GAEtBgyD,WAAWt+D,GACP,OAAQpM,KAAK6X,MAAMzL,IAAM,IAAI6oD,GAAGnQ,GAAGX,aAAat2C,WAmBpD,MAAMo9D,GAAK,IAAI9jC,WAAW,GAQ9B,MAAM+jC,GACFvlE,YAAYyG,EAAG9I,GACXtD,KAAK8gD,KAAO10C,EAAGpM,KAAK2rD,WAAaroD,EAQjCtD,KAAK41D,GAAK,IAAI2U,GAKdvqE,KAAKg2D,GAAK,IAAIoG,IAAIhwD,GAAKorD,GAAGprD,KAAM,CAACA,EAAG9I,IAAMm0D,GAAGrrD,EAAG9I,KAAMtD,KAAK2+C,IAAMvyC,EAAEuyC,KAAO,GAQvE6rB,2BAA2Bp+D,EAAG9I,GACjC,IAAKtD,KAAK41D,GAAGl3B,IAAIp7B,GAAI,CACjB,MAAMoV,EAAIpV,EAAEohD,cAAej6C,EAAInH,EAAEkhD,UACjCp4C,EAAEk7C,wBAAsB,KAGpBtnD,KAAK41D,GAAGl+C,IAAIpU,MAEhB,MAAMjE,EAAI,CACN0iE,aAAcrpD,EACdopD,OAAQiB,GAAGt4D,IAEf,OAAO0gE,GAAG/+D,GAAGsS,IAAIrf,GAErB,OAAOqoD,GAAGxpC,UAEdusD,qBAAqBr+D,EAAG9I,GACpB,MAAMoV,EAAI,GAAIjO,EAAI49D,YAAYC,MAAM,CAAEhlE,EAAG,IAAM,CAAEy/C,GAAGz/C,GAAI,KACzC,GACA,GACf,OAAO6nE,GAAG/+D,GAAGs8B,EAAEj+B,GAAG+R,MAAMpQ,IACpB,IAAK,MAAM3B,KAAK2B,EAAG,CAKf,GAAI3B,EAAEs3D,eAAiBz+D,EAAG,MAC1BoV,EAAEpX,KAAK4hE,GAAGz4D,EAAEq3D,SAEhB,OAAOppD,KAGfiyD,cAAcv+D,EAAG9I,GAGb,MAAMoV,EAAI0yD,GAAGh/D,GAAI3B,EAAI,SAAS2B,GAC1B,MAAO,CACHy5C,QAASz5C,EAAEy5C,QACXL,gBAAiBp5C,EAAEo5C,gBACnBM,OAAQ15C,EAAE05C,OAAOhU,KAAK1lC,GAAK,CAAEA,EAAEm6C,UAAUxB,kBAAmB34C,EAAE65C,SAJjD,CAMnB3iD,UACKmH,EAAEo7C,QAET,MAAMxmD,EAAIqZ,EAAEhB,IAAIjN,GAChB,GAAInH,EAAEyiD,WAAY,CACd,MAAMrtC,EAAI2yD,GAAGj/D,GACb,OAAO/M,EAAEmd,MAAMpQ,IACXsM,EAAEgG,IAAI0oD,GAAGh7D,EAAGpM,KAAK8gD,KAAMx9C,EAAEyiD,WAAWU,eAAgBnjD,EAAEyiD,WAAWpU,YAGzE,OAAOtyC,EAAEmd,OAEbouD,iBAAiBx+D,EAAG9I,GAChB,MAAMoV,EAAI0yD,GAAGh/D,GAAI3B,EAAI4gE,GAAGj/D,GAAI/M,EAAIisE,GAAGl/D,GACnC,OAAOsM,EAAEimB,OAAOr7B,EAAEuiD,SAASrpC,MAAM,IAAM/R,EAAEk0B,OAAO0pC,YAAYC,MAAM,CAAEhlE,EAAEuiD,SAAW,CAAEviD,EAAEuiD,QAAU,IAChF,GACA,MAAOrpC,MAAI,IAAQnd,EAAEs/B,OAAO0pC,YAAYC,MAAM,CAAEhlE,EAAEuiD,SAAW,CAAEviD,EAAEuiD,QAAU,IAC3E,GACA,MAEnBglB,2BAA2Bz+D,EAAG9I,GAC1B,MAAMoV,EAAI4yD,GAAGl/D,GACb,IAAI3B,GAAI,EACR,MAAMpL,EAAI,IAAI+1B,IACd,OAAOsyB,GAAGxxC,QAAQlW,KAAKi2D,GAAG3yD,IAAKA,GAAKtD,KAAKm3D,GAAG/qD,EAAG9I,GAAGkZ,MAAMpQ,IACpD3B,IAAMA,IAAM2B,GAAI/M,EAAEge,IAAI/Z,EAAG8I,QACvBoQ,WACF,GAAI/R,EAAG,CACH,IAAI2B,EAAI+wD,KACR,MAAM1yD,EAAI,GACV,OAAOi9C,GAAGxxC,QAAQ7W,GAAC,CAAIA,EAAGqiD,KACtB,IAAID,EACJ5mC,GAAE,wBAAyB,eAAe4mC,EAAIpiD,EAAG,MAAMoiD,EAAEoE,cAAcpE,EAAE+D,qBAAqB/D,EAAEqE,OAAOhU,KAAK1lC,GAAK,GAAGA,EAAEm6C,aAAan6C,EAAE65C,SAAS1kD,KAAK,qBAAqBi2D,GAAGl0D,MAC3K,MAAMrB,EAAI,SAASmK,EAAG9I,GAClB,MAAMoV,EAAIstC,GAAG1iD,GACb,QAAI,IAAWoV,EAAG,OAAO,KACzB,IAAK,MAAMpV,KAAKs0D,GAAGxrD,EAAGsM,EAAE6tC,WAAY,OAAQjjD,EAAE2tD,IAC5C,IAAK,qBACH,OAAO3tD,EAAEwD,MAAMsoD,WAAW3jC,QAAU,GAEtC,IAAK,iBACH,MAAO,CAAEnoB,EAAEwD,OAGf,OAAO,KAXD,CAgBzB46C,EAAGriD,GAAIE,EAAI,SAAS6M,EAAG9I,GACJ,MAAMoV,EAAI,IAAI0c,IACd,IAAK,MAAM3qB,KAAKy7C,GAAG5iD,GAAI,IAAK,MAAMA,KAAKs0D,GAAGxrD,EAAG3B,EAAE87C,WAAY,OAAQjjD,EAAE2tD,IACnE,IAAK,KACL,IAAK,KAIHv4C,EAAE2E,IAAI5S,EAAE87C,UAAUxB,kBAAmBzhD,EAAEwD,OACvC,MAEF,IAAK,SACL,IAAK,KAGH,OAAO4R,EAAE2E,IAAI5S,EAAE87C,UAAUxB,kBAAmBzhD,EAAEwD,OAAQvG,MAAM80B,KAAK3c,EAAE+S,UAGvE,OAAO,KAlBf,CAwBXi2B,EAAGriD,GAAI6H,EAAI,SAASkF,EAAG9I,GACJ,MAAMoV,EAAI,GACV,IAAIjO,GAAI,EAGgB,IAAK,MAAMpL,KAAK6mD,GAAG5iD,GAAI,CAC3C,MAAMA,EAAI,IAAgCjE,EAAE4mD,KAAO4R,GAAGzrD,EAAG/M,EAAEknD,UAAWn6C,EAAEirD,SAAWS,GAAG1rD,EAAG/M,EAAEknD,UAAWn6C,EAAEirD,SACxG3+C,EAAEpX,KAAKgC,EAAEwD,OAAQ2D,IAAMA,EAAInH,EAAEitD,WAEjC,OAAO,IAAIE,GAAG/3C,EAAGjO,GATzB,CAeXi3C,EAAGriD,GAAIqtB,EAAI,SAAStgB,EAAG9I,GACJ,MAAMoV,EAAI,GACV,IAAIjO,GAAI,EAGgB,IAAK,MAAMpL,KAAK6mD,GAAG5iD,GAAI,CAC3C,MAAMA,EAAI,IAAgCjE,EAAE4mD,KAAO6R,GAAG1rD,EAAG/M,EAAEknD,UAAWn6C,EAAEkrD,OAASO,GAAGzrD,EAAG/M,EAAEknD,UAAWn6C,EAAEkrD,OACtG5+C,EAAEpX,KAAKgC,EAAEwD,OAAQ2D,IAAMA,EAAInH,EAAEitD,WAEjC,OAAO,IAAIE,GAAG/3C,EAAGjO,GATzB,CAUMi3C,EAAGriD,GAAIi2B,EAAIt1B,KAAKu3D,GAAGl4D,EAAGqiD,EAAGx6C,GAAIiP,EAAInW,KAAKu3D,GAAGl4D,EAAGqiD,EAAGh1B,GAAI/V,EAAI3W,KAAKw3D,GAAGn4D,EAAGqiD,EAAGniD,GAAIqH,EAAI5G,KAAKy3D,GAAGp4D,EAAEwmD,QAAS5jD,EAAGqzB,EAAGpuB,EAAEqpD,UAAWp6C,EAAGuW,EAAE6jC,UAAW55C,GACrI,OAAO+wC,GAAGxxC,QAAQtP,GAAIvH,GAAKqZ,EAAEmM,EAAExlB,EAAGiE,EAAE+gD,OAAO7nC,MAAMlZ,IAC7CA,EAAE4S,SAAS5S,IACP,MAAMoV,EAAI2sC,GAAGkmB,aAAajoE,EAAE0jD,aAC5B56C,EAAEsyB,IAAIhmB,KAAOtM,EAAIA,EAAEsL,IAAIgB,GAAIjO,EAAEnJ,KAAKoX,eAG1C8D,UAAY/R,IAEpB,OAAOi9C,GAAGxpC,QAAQ,SAG1B+3C,GAAG7pD,GACC,IAAI9I,EAAItD,KAAKg2D,GAAG5mD,IAAIhD,GACpB,OAAI9I,IACwBA,EAAxB,IAAM8I,EAAE4lD,QAAQ1yD,OAAY,CAAE8M,GAC1B09D,GAAG30D,GAAG/O,OAAOgG,EAAE4lD,QAAS,QAAoClgB,KAAKxuC,GAAKi0D,GAAGnrD,EAAEixB,KAAMjxB,EAAEo5C,gBAAiBp5C,EAAEgrD,QAAS9zD,EAAEwuD,aAAc1lD,EAAEi4C,MAAOj4C,EAAEirD,QAASjrD,EAAEkrD,SAEtJt3D,KAAKg2D,GAAG34C,IAAIjR,EAAG9I,GAAIA,GAKvBm0D,GAAGrrD,EAAG9I,EAAGoV,EAAGjO,EAAGpL,EAAGqiD,EAAGD,GAKxB,MAAMx/C,GAAK,MAAQqB,EAAIA,EAAEhE,OAAS,GAAKsL,KAAKyH,IAAIqG,EAAEpZ,OAAQD,EAAEC,QAASC,EAAI0C,GAAK,MAAQqB,EAAIA,EAAEhE,OAAS,GAAI4H,EAAI,GAC7G,IAAK,IAAIwlB,EAAI,EAAGA,EAAIzqB,IAAKyqB,EAAG,CACxB,MAAMzqB,EAAIqB,EAAItD,KAAK03D,GAAGp0D,EAAEopB,EAAIntB,IAAM0rE,GAAI31C,EAAIt1B,KAAK43D,GAAGxrD,EAAGnK,EAAGyW,EAAEgU,EAAIntB,GAAIkL,GAAI0L,EAAInW,KAAK63D,GAAGzrD,EAAGnK,EAAG5C,EAAEqtB,EAAIntB,GAAImiD,GAAI/qC,EAAI8qC,EAAE3P,KAAKxuC,GAAKtD,KAAK43D,GAAGxrD,EAAGnK,EAAGqB,GACnH,KACjB4D,EAAE5F,QAAQtB,KAAKwrE,YAAYl2C,EAAGnf,EAAGQ,IAErC,OAAOzP,EAEkE0wD,GAAGxrD,EAAG9I,EAAGoV,EAAGjO,GACrF,MAAMpL,EAAI,IAAImqE,GAAGp9D,EAAGi5C,GAAGwB,QAASvjD,EAAGoV,GACnC,OAAOjO,EAAIpL,EAAIA,EAAEuzD,KAEwDiF,GAAGzrD,EAAG9I,EAAGoV,EAAGjO,GACrF,MAAMpL,EAAI,IAAImqE,GAAGp9D,EAAGi5C,GAAGwB,QAASvjD,EAAGoV,GACnC,OAAOjO,EAAIpL,EAAEuzD,KAAOvzD,EAExB83D,GAAG/qD,EAAG9I,GACF,MAAMoV,EAAI,IAAIkxD,GAAGtmE,GAAImH,EAAI,MAAQnH,EAAEkiD,gBAAkBliD,EAAEkiD,gBAAkBliD,EAAE+5B,KAAKqnB,cAChF,OAAO1kD,KAAK+qE,gBAAgB3+D,EAAG3B,GAAG+R,MAAMpQ,IAEpC,IAAI9I,EAAI,KACR,IAAK,MAAMmH,KAAK2B,EACZsM,EAAEs6C,GAAGvoD,MAAQnH,GAAKmH,EAAEq7C,OAAOxmD,OAASgE,EAAEwiD,OAAOxmD,UAAYgE,EAAImH,GAEjE,OAAOnH,KAGfwnE,aAAa1+D,EAAG9I,GACZ,IAAIoV,EAAI,EACR,MAAMjO,EAAIzK,KAAKi2D,GAAG3yD,GAClB,OAAOokD,GAAGxxC,QAAQzL,GAAInH,GAAKtD,KAAKm3D,GAAG/qD,EAAG9I,GAAGkZ,MAAMpQ,IAC3CA,EAAI,IAA2BsM,GAAKtM,EAAE05C,OAAOxmD,OAAS,SAAS8M,GAC3D,IAAI9I,EAAI,IAAI2xD,GAAG/P,GAAGf,YAAazrC,GAAI,EACnC,IAAK,MAAMjO,KAAK2B,EAAE4lD,QAAS,IAAK,MAAM5lD,KAAK3B,EAAEonD,sBAG7CzlD,EAAEwkD,MAAMxL,eAKR,mBAAmDh5C,EAAE6kD,IAAM,uBAA2D7kD,EAAE6kD,GAAKv4C,GAAI,EAAKpV,EAAIA,EAAEoU,IAAItL,EAAEwkD,QAClJ,IAAK,MAAMl4C,KAAKtM,EAAEgrD,QAGlB1+C,EAAEk4C,MAAMxL,eAAiB9hD,EAAIA,EAAEoU,IAAIgB,EAAEk4C,QACrC,OAAOttD,EAAEohB,MAAQhM,EAAI,EAAI,GAfyB,CAgBpDpV,KAAOoV,EAAI,GAA6BA,EAAI,OAC5C8D,MAAM,IAIZ,SAASpQ,GACL,OAAO,OAASA,EAAEi4C,MADtB,CAEE/gD,IAAMmH,EAAEnL,OAAS,GAAK,IAA2BoZ,EAAI,EAA4BA,IAMhFo/C,GAAG1rD,EAAG9I,GACT,MAAMoV,EAAI,IAAI6wD,GACd,IAAK,MAAM9+D,KAAKy7C,GAAG95C,GAAI,CACnB,MAAMA,EAAI9I,EAAEkD,KAAKoqD,MAAMnmD,EAAE87C,WACzB,GAAI,MAAQn6C,EAAG,OAAO,KACtB,MAAM/M,EAAIqZ,EAAE64C,GAAG9mD,EAAEw7C,MACjB0iB,GAAGlY,GAAGf,GAAGtjD,EAAG/M,GAEhB,OAAOqZ,EAAEg6C,KAEmDgF,GAAGtrD,GAC/D,MAAM9I,EAAI,IAAIimE,GACd,OAAOZ,GAAGlY,GAAGf,GAAGtjD,EAAG9I,EAAEiuD,GAAG,IAA+BjuD,EAAEovD,KAKtDqF,GAAG3rD,EAAG9I,GACT,MAAMoV,EAAI,IAAI6wD,GACd,OAAOZ,GAAGlY,GAAGf,GAAGE,GAAG5vD,KAAK2rD,WAAYroD,GAAIoV,EAAE64C,GAAG,SAASnlD,GAClD,MAAM9I,EAAI4iD,GAAG95C,GACb,OAAO,IAAM9I,EAAEhE,OAAS,EAA8BgE,EAAEA,EAAEhE,OAAS,GAAG2mD,KAF7B,CAG3C75C,KAAMsM,EAAEg6C,KAKP8E,GAAGprD,EAAG9I,EAAGoV,GACZ,GAAI,OAASA,EAAG,MAAO,GACvB,IAAIjO,EAAI,GACRA,EAAEnJ,KAAK,IAAIioE,IACX,IAAIlqE,EAAI,EACR,IAAK,MAAMqiD,KAAKwE,GAAG95C,GAAI,CACnB,MAAMA,EAAIsM,EAAErZ,KACZ,IAAK,MAAMqZ,KAAKjO,EAAG,GAAIzK,KAAKk4D,GAAG50D,EAAGo+C,EAAE6E,YAAcuJ,GAAG1jD,GAAI3B,EAAIzK,KAAKm4D,GAAG1tD,EAAGi3C,EAAGt1C,OAAS,CAChF,MAAM9I,EAAIoV,EAAE64C,GAAG7P,EAAEuE,MACjB0iB,GAAGlY,GAAGf,GAAGtjD,EAAG9I,IAGpB,OAAOtD,KAAKgL,GAAGP,GAKZ8sD,GAAGnrD,EAAG9I,EAAGoV,GACZ,OAAO1Y,KAAKw3D,GAAGprD,EAAG9I,EAAGoV,EAAEg4C,UAE0C1lD,GAAGoB,GACpE,MAAM9I,EAAI,GACV,IAAK,IAAIoV,EAAI,EAAGA,EAAItM,EAAE9M,SAAUoZ,EAAGpV,EAAEoV,GAAKtM,EAAEsM,GAAGg6C,KAC/C,OAAOpvD,EAQJ60D,GAAG/rD,EAAG9I,EAAGoV,GACZ,MAAMjO,EAAI,IAAK2B,GAAK/M,EAAI,GACxB,IAAK,MAAM+M,KAAKsM,EAAE02C,WAAW3jC,QAAU,GAAI,IAAK,MAAM/S,KAAKjO,EAAG,CAC1D,MAAMA,EAAI,IAAI8+D,GACd9+D,EAAEw+D,KAAKvwD,EAAEg6C,MAAOiW,GAAGlY,GAAGf,GAAGtjD,EAAG3B,EAAE8mD,GAAGjuD,EAAE2iD,OAAQ5mD,EAAEiC,KAAKmJ,GAEtD,OAAOpL,EAEX64D,GAAG9rD,EAAG9I,GACF,QAAS8I,EAAE4lD,QAAQlZ,MAAM1sC,GAAKA,aAAa4kD,IAAM5kD,EAAEwkD,MAAM9R,QAAQx7C,KAAO,OAA2B8I,EAAE6kD,IAAM,WAAmC7kD,EAAE6kD,MAEpJ8Z,gBAAgB3+D,EAAG9I,GACf,MAAMoV,EAAI0yD,GAAGh/D,GAAI3B,EAAI4gE,GAAGj/D,GACxB,OAAQ9I,EAAIoV,EAAEgwB,EAAE,uBAAwB2/B,YAAYC,MAAMhlE,EAAGA,IAAMoV,EAAEgwB,KAAKlsB,MAAMpQ,IAC5E,MAAM9I,EAAI,GACV,OAAOokD,GAAGxxC,QAAQ9J,GAAIA,GAAK3B,EAAE2E,IAAI,CAAEhD,EAAEy5C,QAAS7lD,KAAK2+C,MAAOniC,MAAM9D,IAC5DpV,EAAEhC,KAAK,SAAS8K,EAAG9I,GACf,MAAMoV,EAAIpV,EAAI,IAAIkjD,GAAGljD,EAAEmjD,eAAgB,IAAIC,GAAGggB,GAAGpjE,EAAEyjD,UAAW,IAAI1B,GAAG6d,GAAG5/D,EAAE0jD,cAAe1jD,EAAE2jD,iBAAmBT,GAAGK,QAASp8C,EAAI2B,EAAE05C,OAAOhU,KAAG,EAAI1lC,EAAG9I,KAAO,IAAIgjD,GAAGpB,GAAGsc,iBAAiBp1D,GAAI9I,KACvL,OAAO,IAAIsiD,GAAGx5C,EAAEy5C,QAASz5C,EAAEo5C,gBAAiB/6C,EAAGiO,GAF5C,CAGLtM,EAAGsM,SACH8D,UAAYlZ,OAG1BwnD,+BAA+B1+C,GAC3B,OAAOpM,KAAK+qE,gBAAgB3+D,GAAGoQ,MAAMpQ,GAAK,IAAMA,EAAE9M,OAAS,MAAQ8M,EAAEojD,MAAI,CAAGpjD,EAAG9I,KAC3E,MAAMoV,EAAItM,EAAE25C,WAAWU,eAAiBnjD,EAAEyiD,WAAWU,eACrD,OAAO,IAAM/tC,EAAIA,EAAIkqC,GAAEx2C,EAAEo5C,gBAAiBliD,EAAEkiD,oBAC3Cp5C,EAAE,GAAGo5C,mBAEd4F,sBAAsBh/C,EAAG9I,EAAGoV,GACxB,MAAMjO,EAAI2gE,GAAGh/D,GAAI/M,EAAIgsE,GAAGj/D,GACxB,OAAOpM,KAAKo4D,GAAGhsD,GAAGoQ,MAAMpQ,GAAK3B,EAAEi+B,EAAE,uBAAwB2/B,YAAYC,MAAMhlE,EAAGA,IAAIkZ,MAAMlZ,GAAKokD,GAAGxxC,QAAQ5S,GAAIA,GAAKjE,EAAEqf,IAAI0oD,GAAG9jE,EAAEuiD,QAAS7lD,KAAK8gD,KAAM10C,EAAGsM,UAEvJyyC,mBAAmB/+C,EAAG9I,GAMlB,MAAMoV,EAAI,IAAI0c,IACd,OAAOsyB,GAAGxxC,QAAQ5S,GAAC,CAAIA,EAAGmH,KACtB,MAAMpL,EAAIqZ,EAAEtJ,IAAI9L,EAAEkiD,iBAClB,OAAQnmD,EAAIqoD,GAAGxpC,QAAQ7e,GAAKW,KAAK+qE,gBAAgB3+D,EAAG9I,EAAEkiD,kBAAkBhpC,MAAMnd,IAAMqZ,EAAE2E,IAAI/Z,EAAEkiD,gBAAiBnmD,GAC7GqoD,GAAGxxC,QAAQ7W,GAAIqZ,GAAK1Y,KAAKq4D,GAAGjsD,EAAG9I,EAAGoV,GAAG8D,MAAMlZ,IACvC,MAAMjE,EAAIW,KAAKs4D,GAAG7tD,EAAGiO,GACrB,OAAOpV,EAAEw7C,QAAQz/C,GAAKqoD,GAAGxpC,UAAYle,KAAKu4D,GAAGnsD,EAAG3B,EAAGiO,EAAGpV,EAAGjE,cAIrEo5D,GAAGrsD,EAAG9I,EAAGoV,EAAGjO,GACR,OAAO6gE,GAAGl/D,GAAGsS,IAAI,CACbmnC,QAASp7C,EAAEo7C,QACXlH,IAAK3+C,KAAK2+C,IACVyQ,WAAY3kD,EAAE2kD,WACdqa,iBAAkBh/D,EAAEg/D,iBACpBgC,mBAAoBzrE,KAAK+3D,GAAGr/C,EAAGpV,EAAEuD,KACjCmgD,YAAa1jD,EAAEuD,IAAIw2B,KAAKxvB,YAGhC6qD,GAAGtsD,EAAG9I,EAAGoV,EAAGjO,GACR,OAAO6gE,GAAGl/D,GAAGuyB,OAAO,CAAEl0B,EAAEo7C,QAAS7lD,KAAK2+C,IAAKl0C,EAAE2kD,WAAY3kD,EAAEg/D,iBAAkBzpE,KAAK+3D,GAAGr/C,EAAGpV,EAAEuD,KAAMvD,EAAEuD,IAAIw2B,KAAKxvB,YAE/GwqD,GAAGjsD,EAAG9I,EAAGoV,GACL,MAAMjO,EAAI6gE,GAAGl/D,GACb,IAAI/M,EAAI,IAAI41D,GAAGyU,IACf,OAAOj/D,EAAEm4C,EAAE,CACP/qC,MAAO,mBACP+xC,MAAOye,YAAYqD,KAAK,CAAEhzD,EAAEmtC,QAAS7lD,KAAK2+C,IAAK3+C,KAAK+3D,GAAGr/C,EAAGpV,OAC1D,CAAC8I,EAAG3B,KACJpL,EAAIA,EAAEqY,IAAI,IAAI8xD,GAAG9wD,EAAEmtC,QAASviD,EAAGmH,EAAE2kD,WAAY3kD,EAAEg/D,sBAC/CjtD,UAAYnd,IAEwCi5D,GAAGlsD,EAAG9I,GAC9D,IAAIoV,EAAI,IAAIu8C,GAAGyU,IACf,MAAMj/D,EAAIzK,KAAK83D,GAAGx0D,EAAG8I,GACrB,GAAI,MAAQ3B,EAAG,OAAOiO,EACtB,MAAMrZ,EAAI2mD,GAAG1iD,GACb,GAAI,MAAQjE,EAAG,CACX,MAAMqiD,EAAIt1C,EAAE5F,KAAKoqD,MAAMvxD,EAAEknD,WACzB,GAAIuJ,GAAGpO,GAAI,IAAK,MAAMriD,KAAKqiD,EAAE0N,WAAW3jC,QAAU,GAAI/S,EAAIA,EAAEhB,IAAI,IAAI8xD,GAAGlmE,EAAEuiD,QAASz5C,EAAEvF,IAAK7G,KAAK03D,GAAGr4D,GAAIoL,SAClGiO,EAAIA,EAAEhB,IAAI,IAAI8xD,GAAGlmE,EAAEuiD,QAASz5C,EAAEvF,IAAKokE,GAAIxgE,IAC9C,OAAOiO,EAMJ6/C,GAAGnsD,EAAG9I,EAAGoV,EAAGjO,EAAGpL,GAClBwb,GAAE,wBAAyB,2CAA4CvX,EAAEuD,KACzE,MAAM66C,EAAI,GACV,OAAO,SAASt1C,EAAG9I,EAAGoV,EAAGjO,EAAGpL,GACxB,MAAMqiD,EAAIt1C,EAAEqnD,cAAehS,EAAIn+C,EAAEmwD,cACjC,IAAIxxD,EAAIwzD,GAAG/T,GAAIniD,EAAIk2D,GAAGhU,GAGtB,KAAMx/C,GAAK1C,GAAK,CACZ,IAAI6M,GAAI,EAAI9I,GAAI,EAChB,GAAIrB,GAAK1C,EAAG,CACR,MAAMkL,EAAIiO,EAAEzW,EAAG1C,GACfkL,EAAI,EAGJnH,GAAI,EAAKmH,EAAI,IAGb2B,GAAI,QACD,MAAQnK,EAAIqB,GAAI,EAAK8I,GAAI,EAChCA,GAAK3B,EAAElL,GAAIA,EAAIk2D,GAAGhU,IAAMn+C,GAAKjE,EAAE4C,GAAIA,EAAIwzD,GAAG/T,KAAOz/C,EAAIwzD,GAAG/T,GAAIniD,EAAIk2D,GAAGhU,KAjBpE,CAmBLh3C,EAAGpL,EAAGqqE,IACKj/D,IACTi3C,EAAEpgD,KAAKtB,KAAKy4D,GAAGrsD,EAAG9I,EAAGoV,EAAGjO,OAEZA,IACZi3C,EAAEpgD,KAAKtB,KAAK04D,GAAGtsD,EAAG9I,EAAGoV,EAAGjO,OACvBi9C,GAAGS,QAAQzG,GAEpB0W,GAAGhsD,GACC,IAAI9I,EAAI,EACR,OAAO+nE,GAAGj/D,GAAGw2C,EAAE,CACX/qC,MAAO,sBACPkyC,SAAS,EACTH,MAAOye,YAAYsD,WAAW,CAAE3rE,KAAK2+C,IAAK9+B,OAAO8sC,sBAChDvgD,EAAGsM,EAAGjO,KACPA,EAAE48B,OAAQ/jC,EAAIoV,EAAE+tC,eAAiB,KACjCjqC,UAAYlZ,IAMbkoE,YAAYp/D,EAAG9I,EAAGoV,GAGrBA,EAAIA,EAAE82C,MAAM,CAACpjD,EAAG9I,IAAMomE,GAAGt9D,EAAG9I,KAAK0hD,QAAQ,CAAC54C,EAAG9I,EAAGoV,KAAOpV,GAAK,IAAMomE,GAAGt9D,EAAGsM,EAAEpV,EAAI,MAC9E,MAAMmH,EAAI,GACVA,EAAEnJ,KAAK8K,GACP,IAAK,MAAM/M,KAAKqZ,EAAG,CACf,MAAMA,EAAIgxD,GAAGrqE,EAAG+M,GAAIs1C,EAAIgoB,GAAGrqE,EAAGiE,GAC9B,GAAI,IAAMoV,EAGVjO,EAAE,GAAK2B,EAAEwmD,UAAW,GAAIl6C,EAAI,GAAKgpC,EAAI,EAErCj3C,EAAEnJ,KAAKjC,GAAIoL,EAAEnJ,KAAKjC,EAAEuzD,WAAY,GAAIlR,EAAI,EAExC,MAEJj3C,EAAEnJ,KAAKgC,GACP,MAAMjE,EAAI,GACV,IAAK,IAAI+M,EAAI,EAAGA,EAAI3B,EAAEnL,OAAQ8M,GAAK,EAAG,CAGlC,GAAIpM,KAAK24D,GAAGluD,EAAE2B,GAAI3B,EAAE2B,EAAI,IAAK,MAAO,GACpC,MAAM9I,EAAI,CAAEmH,EAAE2B,GAAGy5C,QAAS7lD,KAAK2+C,IAAKl0C,EAAE2B,GAAGgjD,WAAY3kD,EAAE2B,GAAGq9D,iBAAkBwB,GAAI,IAAMvyD,EAAI,CAAEjO,EAAE2B,EAAI,GAAGy5C,QAAS7lD,KAAK2+C,IAAKl0C,EAAE2B,EAAI,GAAGgjD,WAAY3kD,EAAE2B,EAAI,GAAGq9D,iBAAkBwB,GAAI,IAC5K5rE,EAAEiC,KAAK+mE,YAAYC,MAAMhlE,EAAGoV,IAEhC,OAAOrZ,EAEXs5D,GAAGvsD,EAAG9I,GAGF,OAAOomE,GAAGt9D,EAAG9I,GAAK,EAEtBynD,gCAAgC3+C,EAAG9I,GAC/B,OAAOtD,KAAK+qE,gBAAgB3+D,EAAG9I,GAAGkZ,KAAKovD,IAE3CZ,aAAa5+D,EAAG9I,GACZ,OAAOokD,GAAGmkB,SAAS7rE,KAAKi2D,GAAG3yD,IAAKA,GAAKtD,KAAKm3D,GAAG/qD,EAAG9I,GAAGkZ,MAAMpQ,GAAKA,GAAKggC,SAAQ5vB,KAAKovD,KAOpF,SAAST,GAAG/+D,GACZ,OAAOw4D,GAAGx4D,EAAG,qBAKb,SAASk/D,GAAGl/D,GACZ,OAAOw4D,GAAGx4D,EAAG,gBAKb,SAASg/D,GAAGh/D,GACZ,OAAOw4D,GAAGx4D,EAAG,sBAKb,SAASi/D,GAAGj/D,GACZ,OAAOw4D,GAAGx4D,EAAG,cAGjB,SAASw/D,GAAGx/D,GACRmuB,GAAE,IAAMnuB,EAAE9M,QACV,IAAIgE,EAAI8I,EAAE,GAAG25C,WAAWpU,OAAQj5B,EAAIpV,EAAE2jD,eACtC,IAAK,IAAIx8C,EAAI,EAAGA,EAAI2B,EAAE9M,OAAQmL,IAAK,CAC/B,MAAMpL,EAAI+M,EAAE3B,GAAGs7C,WAAWpU,OAC1BuV,GAAG7nD,EAAGiE,GAAK,IAAMA,EAAIjE,GAAIqZ,EAAIrZ,EAAE4nD,iBAAmBvuC,EAAIrZ,EAAE4nD,gBAE5D,OAAO,IAAIP,GAAGpjD,EAAEyjD,SAAUzjD,EAAE0jD,YAAatuC,GAkBzC,MAAMozD,GAAK,CACXC,QAAQ,EACRC,yBAA0B,EAC1BC,eAAgB,EAChBC,iBAAkB,GAGtB,MAAMC,GACFxmE,YAGAyG,EAEA9I,EAGAoV,GACI1Y,KAAKosE,6BAA+BhgE,EAAGpM,KAAKqsE,oBAAsB/oE,EAAGtD,KAAKssE,gCAAkC5zD,EAEhHiqC,qBAAqBv2C,GACjB,OAAO,IAAI+/D,GAAG//D,EAAG+/D,GAAGI,8BAA+BJ,GAAGK,0CAwB9D,SAASC,GAAGrgE,EAAG9I,EAAGoV,GACd,MAAMjO,EAAI2B,EAAEw8C,MAAM,aAAcvpD,EAAI+M,EAAEw8C,MAAM,qBAAsBlH,EAAI,GAAID,EAAI4mB,YAAYqD,KAAKhzD,EAAE2yC,SACjG,IAAIppD,EAAI,EACR,MAAM1C,EAAIkL,EAAEm4C,EAAE,CACVgH,MAAOnI,KACNr1C,EAAG9I,EAAGoV,KAAOzW,IAAKyW,EAAEimB,YACzB+iB,EAAEpgD,KAAK/B,EAAEid,WACL+d,GAAE,IAAMt4B,OAEZ,MAAMiF,EAAI,GACV,IAAK,MAAMkF,KAAKsM,EAAEssD,UAAW,CACzB,MAAMv6D,EAAI44D,GAAG//D,EAAG8I,EAAEvF,IAAIw2B,KAAM3kB,EAAE2yC,SAC9B3J,EAAEpgD,KAAKjC,EAAEs/B,OAAOl0B,IAAKvD,EAAE5F,KAAK8K,EAAEvF,KAElC,OAAO6gD,GAAGS,QAAQzG,GAAGllC,MAAI,IAAQtV,IAKjC,SAASwlE,GAAGtgE,GACZ,IAAKA,EAAG,OAAO,EACf,IAAI9I,EACJ,GAAI8I,EAAEjJ,SAAUG,EAAI8I,EAAEjJ,cAAe,GAAIiJ,EAAEq6D,gBAAiBnjE,EAAI8I,EAAEq6D,oBAAsB,CACpF,IAAKr6D,EAAEm6D,WAAY,MAAMn6B,KACzB9oC,EAAI8I,EAAEm6D,WAEV,OAAO5iE,KAAKuY,UAAU5Y,GAAGhE,OAmBqC6sE,GAAGI,8BAAgC,GACrGJ,GAAGK,wCAA0C,IAAKL,GAAGviC,QAAU,IAAIuiC,GAAG,SAAUA,GAAGI,8BAA+BJ,GAAGK,yCACrHL,GAAGQ,SAAW,IAAIR,IAAI,EAAG,EAAG,GAE5B,MAAMS,GACFjnE,YAKAyG,EAAG9I,EAAGoV,EAAGjO,GACLzK,KAAK+nE,OAAS37D,EAAGpM,KAAK0mD,GAAKpjD,EAAGtD,KAAK6qD,aAAenyC,EAAG1Y,KAAK6sE,kBAAoBpiE,EAa9EzK,KAAK44D,GAAK,GAMPjW,UAAUv2C,EAAG9I,EAAGoV,EAAGjO,GAKtB8vB,GAAE,KAAOnuB,EAAEuyC,KACX,MAAMt/C,EAAI+M,EAAEwyC,kBAAoBxyC,EAAEuyC,IAAM,GACxC,OAAO,IAAIiuB,GAAGvtE,EAAGiE,EAAGoV,EAAGjO,GAE3BqiE,WAAW1gE,GACP,IAAI9I,GAAI,EACR,MAAMoV,EAAI2vD,YAAYC,MAAM,CAAEtoE,KAAK+nE,OAAQloD,OAAOktD,mBAAqB,CAAE/sE,KAAK+nE,OAAQloD,OAAO2oD,oBAC7F,OAAOwE,GAAG5gE,GAAGw2C,EAAE,CACX/qC,MAAO,qBACP+xC,MAAOlxC,KACNtM,EAAGsM,EAAGjO,KACPnH,GAAI,EAAImH,EAAE48B,UACV7qB,UAAYlZ,IAEpB2pE,iBAAiB7gE,EAAG9I,EAAGoV,EAAGjO,GACtB,MAAMpL,EAAI6tE,GAAG9gE,GAAIs1C,EAAIsrB,GAAG5gE,GAUxB,OAAOs1C,EAAEhqC,IAAI,IAAI8E,MAAMilC,IACnBlnB,GAAE,iBAAmBknB,GACrB,MAAMx/C,EAAI,IAAI4iE,GAAGpjB,EAAGn+C,EAAGoV,EAAGjO,GAAIlL,EAAI,SAAS6M,EAAG9I,EAAGoV,GAC7C,MAAMjO,EAAIiO,EAAEqsD,cAAcjzB,KAAKxuC,GAAKs9D,GAAGx0D,EAAEkjD,GAAIhsD,KAAMjE,EAAIqZ,EAAEssD,UAAUlzB,KAAKxuC,GAAKs9D,GAAGx0D,EAAEkjD,GAAIhsD,KACtF,MAAO,CACHykE,OAAQzkE,EACR+nD,QAAS3yC,EAAE2yC,QACXub,iBAAkBluD,EAAEosD,eAAexhB,WACnCyhB,cAAet6D,EACfu6D,UAAW3lE,GAPe,CAShCW,KAAK0mD,GAAI1mD,KAAK+nE,OAAQ9lE,GAAIiF,EAAI,GAChC,IAAIwlB,EAAI,IAAIuoC,KAAK7oD,EAAG9I,IAAMs/C,GAAEx2C,EAAE24C,kBAAmBzhD,EAAEyhD,qBACnD,IAAK,MAAM34C,KAAK3B,EAAG,CACf,MAAMnH,EAAI+/D,GAAGrjE,KAAK+nE,OAAQ37D,EAAEvF,IAAIw2B,KAAMokB,GACtC/0B,EAAIA,EAAEhV,IAAItL,EAAEvF,IAAIw2B,KAAKmnB,WAAYt9C,EAAE5F,KAAKogD,EAAEhjC,IAAInf,IAAK2H,EAAE5F,KAAKjC,EAAEqf,IAAIpb,EAAGggE,KAEvE,OAAO52C,EAAExW,SAAS5S,IACd4D,EAAE5F,KAAKtB,KAAK6qD,aAAa2f,2BAA2Bp+D,EAAG9I,OACtD8I,EAAEk7C,6BACHtnD,KAAK44D,GAAGnX,GAAKx/C,EAAEoF,UACdqgD,GAAGS,QAAQjhD,GAAGsV,MAAI,IAAQva,OAGvCkrE,oBAAoB/gE,EAAG9I,GACnB,OAAO0pE,GAAG5gE,GAAGgD,IAAI9L,GAAGkZ,MAAMpQ,GAAKA,GAAKmuB,GAAEnuB,EAAE27D,SAAW/nE,KAAK+nE,QAASpB,GAAG3mE,KAAK0mD,GAAIt6C,IAAM,OASvFysD,GAAGzsD,EAAG9I,GACF,OAAOtD,KAAK44D,GAAGt1D,GAAKokD,GAAGxpC,QAAQle,KAAK44D,GAAGt1D,IAAMtD,KAAKmtE,oBAAoB/gE,EAAG9I,GAAGkZ,MAAMpQ,IAC9E,GAAIA,EAAG,CACH,MAAMsM,EAAItM,EAAE/E,OACZ,OAAOrH,KAAK44D,GAAGt1D,GAAKoV,EAAGA,EAE3B,OAAO,QAGf00D,iCAAiChhE,EAAG9I,GAChC,MAAMoV,EAAIpV,EAAI,EAAGmH,EAAI49D,YAAYgF,WAAW,CAAErtE,KAAK+nE,OAAQrvD,IAC3D,IAAIrZ,EAAI,KACR,OAAO2tE,GAAG5gE,GAAGw2C,EAAE,CACX/qC,MAAO,qBACP+xC,MAAOn/C,KACN2B,EAAG9I,EAAGmH,KACPnH,EAAEykE,SAAW/nE,KAAK+nE,SAAWxtC,GAAEj3B,EAAE+nD,SAAW3yC,GAAIrZ,EAAIsnE,GAAG3mE,KAAK0mD,GAAIpjD,IAAKmH,EAAE48B,UACvE7qB,UAAYnd,IAEpBiuE,gCAAgClhE,GAC5B,MAAM9I,EAAI+kE,YAAYsD,WAAW,CAAE3rE,KAAK+nE,OAAQloD,OAAO2oD,oBACvD,IAAI9vD,GAAK,EACT,OAAOs0D,GAAG5gE,GAAGw2C,EAAE,CACX/qC,MAAO,qBACP+xC,MAAOtmD,EACPymD,SAAS,KACR39C,EAAG9I,EAAGmH,KACPiO,EAAIpV,EAAE+nD,QAAS5gD,EAAE48B,UACjB7qB,UAAY9D,IAEpB60D,sBAAsBnhE,GAClB,MAAM9I,EAAI+kE,YAAYC,MAAM,CAAEtoE,KAAK+nE,QAAS,GAAK,CAAE/nE,KAAK+nE,OAAQloD,OAAO2oD,oBACvE,OAAOwE,GAAG5gE,GAAGs8B,EAAE,qBAAsBplC,GAAGkZ,MAAMpQ,GAAKA,EAAE0lC,KAAK1lC,GAAKu6D,GAAG3mE,KAAK0mD,GAAIt6C,OAE/EohE,0CAA0CphE,EAAG9I,GAGzC,MAAMoV,EAAI0qD,GAAGpjE,KAAK+nE,OAAQzkE,EAAE+5B,MAAO5yB,EAAI49D,YAAYgF,WAAW30D,GAAIrZ,EAAI,GACtE,OAAO6tE,GAAG9gE,GAAGw2C,EAAE,CACXgH,MAAOn/C,KACNiO,EAAGjO,EAAGi3C,KACP,MAAOD,EAAGx/C,EAAG1C,GAAKmZ,EAAGxR,EAAIg8D,GAAGjhE,GAQhB,GAAIw/C,IAAMzhD,KAAK+nE,QAAUzkE,EAAE+5B,KAAKyhB,QAAQ53C,GAEpD,OAAO8lE,GAAG5gE,GAAGgD,IAAI7P,GAAGid,MAAMpQ,IACtB,IAAKA,EAAG,MAAMggC,KACd7R,GAAEnuB,EAAE27D,SAAW/nE,KAAK+nE,QAAS1oE,EAAEiC,KAAKqlE,GAAG3mE,KAAK0mD,GAAIt6C,OAEpDs1C,EAAEra,UACF7qB,UAAYnd,IAEpBouE,2CAA2CrhE,EAAG9I,GAC1C,IAAIoV,EAAI,IAAIu8C,GAAGrS,IACf,MAAMn4C,EAAI,GACV,OAAOnH,EAAE4S,SAAS5S,IACd,MAAMjE,EAAI+jE,GAAGpjE,KAAK+nE,OAAQzkE,EAAE+5B,MAAOqkB,EAAI2mB,YAAYgF,WAAWhuE,GAAIoiD,EAAIyrB,GAAG9gE,GAAGw2C,EAAE,CAC1EgH,MAAOlI,KACNt1C,EAAG3B,EAAGpL,KACP,MAAOqiD,EAAGD,EAAGx/C,GAAKmK,EAAG7M,EAAI2jE,GAAGzhB,GAQZC,IAAM1hD,KAAK+nE,QAAUzkE,EAAE+5B,KAAKyhB,QAAQv/C,GAAKmZ,EAAIA,EAAEhB,IAAIzV,GAAK5C,EAAEgoC,UAE9E58B,EAAEnJ,KAAKmgD,MACNiG,GAAGS,QAAQ19C,GAAG+R,UAAYxc,KAAK84D,GAAG1sD,EAAGsM,KAE9Cg1D,oCAAoCthE,EAAG9I,GACnC,MAAMoV,EAAIpV,EAAE+5B,KAAM5yB,EAAIiO,EAAEpZ,OAAS,EAAGD,EAAI+jE,GAAGpjE,KAAK+nE,OAAQrvD,GAAIgpC,EAAI2mB,YAAYgF,WAAWhuE,GAIvF,IAAIoiD,EAAI,IAAIwT,GAAGrS,IACf,OAAOsqB,GAAG9gE,GAAGw2C,EAAE,CACXgH,MAAOlI,KACNt1C,EAAG9I,EAAGjE,KACP,MAAOqiD,EAAGz/C,EAAG1C,GAAK6M,EAAGlF,EAAIg8D,GAAGjhE,GAC5By/C,IAAM1hD,KAAK+nE,QAAUrvD,EAAEksC,WAAW19C,GAMlCA,EAAE5H,SAAWmL,IAAMg3C,EAAIA,EAAE/pC,IAAInY,IAAMF,EAAEgoC,UACrC7qB,MAAI,IAAQxc,KAAK84D,GAAG1sD,EAAGq1C,KAE/BqX,GAAG1sD,EAAG9I,GACF,MAAMoV,EAAI,GAAIjO,EAAI,GAElB,OAAOnH,EAAE4S,SAAS5S,IACdmH,EAAEnJ,KAAK0rE,GAAG5gE,GAAGgD,IAAI9L,GAAGkZ,MAAMpQ,IACtB,GAAI,OAASA,EAAG,MAAMggC,KACtB7R,GAAEnuB,EAAE27D,SAAW/nE,KAAK+nE,QAASrvD,EAAEpX,KAAKqlE,GAAG3mE,KAAK0mD,GAAIt6C,WAEnDs7C,GAAGS,QAAQ19C,GAAG+R,MAAI,IAAQ9D,IAEnCi1D,oBAAoBvhE,EAAG9I,GACnB,OAAOmpE,GAAGrgE,EAAEijD,GAAIrvD,KAAK+nE,OAAQzkE,GAAGkZ,MAAM9D,IAAMtM,EAAEk7C,wBAAsB,KAChEtnD,KAAK+4D,GAAGz1D,EAAE+nD,YACT3D,GAAGxxC,QAAQwC,GAAIpV,GAAKtD,KAAK6sE,kBAAkBe,wBAAwBxhE,EAAG9I,QAW/Ey1D,GAAG3sD,UACQpM,KAAK44D,GAAGxsD,GAEnByhE,wBAAwBzhE,GACpB,OAAOpM,KAAK8sE,WAAW1gE,GAAGoQ,MAAMlZ,IAC5B,IAAKA,EAAG,OAAOokD,GAAGxpC,UAGN,MAAMxF,EAAI2vD,YAAYgF,WAAW,CAAErtE,KAAK+nE,SAC9Ct9D,EAAI,GACV,OAAOyiE,GAAG9gE,GAAGw2C,EAAE,CACXgH,MAAOlxC,KACNtM,EAAG9I,EAAGoV,KACP,GAAItM,EAAE,KAAOpM,KAAK+nE,OAAQ,CACtB,MAAMzkE,EAAI4/D,GAAG92D,EAAE,IACf3B,EAAEnJ,KAAKgC,QACJoV,EAAE2uB,UACT7qB,MAAI,KACJ+d,GAAE,IAAM9vB,EAAEnL,cAItBmgC,YAAYrzB,EAAG9I,GACX,OAAOwqE,GAAG1hE,EAAGpM,KAAK+nE,OAAQzkE,GAI9B01D,GAAG5sD,GACC,OAAO2hE,GAAG3hE,GAAGgD,IAAIpP,KAAK+nE,QAAQvrD,MAAMpQ,GAAKA,GAAK,CAC1C27D,OAAQ/nE,KAAK+nE,OACbiG,yBAA0B,EAC1BC,gBAAiB,OAQzB,SAASH,GAAG1hE,EAAG9I,EAAGoV,GAClB,MAAMjO,EAAI24D,GAAG9/D,EAAGoV,EAAE2kB,MAAOh+B,EAAIoL,EAAE,GAAIi3C,EAAI2mB,YAAYgF,WAAW5iE,GAC9D,IAAIg3C,GAAI,EACR,OAAOyrB,GAAG9gE,GAAGw2C,EAAE,CACXgH,MAAOlI,EACP7L,GAAG,KACFzpC,EAAGsM,EAAGjO,KACP,MAAOi3C,EAAGz/C,EAAe1C,GAAK6M,EAC9Bs1C,IAAMp+C,GAAKrB,IAAM5C,IAAMoiD,GAAI,GAAKh3C,EAAE48B,UAClC7qB,UAAYilC,IAOpB,SAASurB,GAAG5gE,GACR,OAAOw4D,GAAGx4D,EAAG,aAKb,SAAS8gE,GAAG9gE,GACZ,OAAOw4D,GAAGx4D,EAAG,qBAKb,SAAS2hE,GAAG3hE,GACZ,OAAOw4D,GAAGx4D,EAAG,kBAkCjB,MAAM8hE,GACFvoE,YAAYyG,GACRpM,KAAKi5D,GAAK7sD,EAEdoQ,OACI,OAAOxc,KAAKi5D,IAAM,EAAGj5D,KAAKi5D,GAE9BtW,YAKI,OAAO,IAAIurB,GAAG,GAElBvrB,YAEI,OAAO,IAAIurB,IAAI,IAmBnB,MAAMC,GACNxoE,YAAYyG,EAAG9I,GACXtD,KAAK6sE,kBAAoBzgE,EAAGpM,KAAK0mD,GAAKpjD,EAQ1C8qE,iBAAiBhiE,GACb,OAAOpM,KAAKo5D,GAAGhtD,GAAGoQ,MAAMlZ,IACpB,MAAMoV,EAAI,IAAIw1D,GAAG5qE,EAAE+qE,iBACnB,OAAO/qE,EAAE+qE,gBAAkB31D,EAAE8D,OAAQxc,KAAKq5D,GAAGjtD,EAAG9I,GAAGkZ,MAAM,IAAMlZ,EAAE+qE,qBAGzEC,6BAA6BliE,GACzB,OAAOpM,KAAKo5D,GAAGhtD,GAAGoQ,MAAMpQ,GAAKu3C,GAAGiD,cAAc,IAAI5D,GAAG52C,EAAEmiE,0BAA0BtrB,QAAS72C,EAAEmiE,0BAA0BrrB,gBAE1HsrB,yBAAyBpiE,GACrB,OAAOpM,KAAKo5D,GAAGhtD,GAAGoQ,MAAMpQ,GAAKA,EAAEqiE,8BAEnCC,mBAAmBtiE,EAAG9I,EAAGoV,GACrB,OAAO1Y,KAAKo5D,GAAGhtD,GAAGoQ,MAAM/R,IAAMA,EAAEgkE,4BAA8BnrE,EAAGoV,IAAMjO,EAAE8jE,0BAA4B71D,EAAEqrC,eACvGzgD,EAAImH,EAAEgkE,8BAAgChkE,EAAEgkE,4BAA8BnrE,GAAItD,KAAKq5D,GAAGjtD,EAAG3B,MAEzFkkE,cAAcviE,EAAG9I,GACb,OAAOtD,KAAKs5D,GAAGltD,EAAG9I,GAAGkZ,MAAM,IAAMxc,KAAKo5D,GAAGhtD,GAAGoQ,MAAM9D,IAAMA,EAAEk2D,aAAe,EAAG5uE,KAAKu5D,GAAGj2D,EAAGoV,GACvF1Y,KAAKq5D,GAAGjtD,EAAGsM,QAEfm2D,iBAAiBziE,EAAG9I,GAChB,OAAOtD,KAAKs5D,GAAGltD,EAAG9I,GAEtBwrE,iBAAiB1iE,EAAG9I,GAChB,OAAOtD,KAAK+uE,8BAA8B3iE,EAAG9I,EAAEg7D,UAAU9hD,MAAI,IAAQwyD,GAAG5iE,GAAGuyB,OAAOr7B,EAAEg7D,YAAY9hD,MAAM,IAAMxc,KAAKo5D,GAAGhtD,KAAKoQ,MAAMlZ,IAAMi3B,GAAEj3B,EAAEsrE,YAAc,GACvJtrE,EAAEsrE,aAAe,EAAG5uE,KAAKq5D,GAAGjtD,EAAG9I,MAM5B2rE,cAAc7iE,EAAG9I,EAAGoV,GACvB,IAAIjO,EAAI,EACR,MAAMpL,EAAI,GACV,OAAO2vE,GAAG5iE,GAAGw2C,GAAC,CAAGlB,EAAGD,KAChB,MAAMx/C,EAAI4kE,GAAGplB,GACbx/C,EAAEwkD,gBAAkBnjD,GAAK,OAASoV,EAAEtJ,IAAInN,EAAEq8D,YAAc7zD,IAAKpL,EAAEiC,KAAKtB,KAAK8uE,iBAAiB1iE,EAAGnK,QAC7Fua,UAAYkrC,GAAGS,QAAQ9oD,KAAKmd,UAAY/R,IAIzCq0D,cAAc1yD,EAAG9I,GACpB,OAAO0rE,GAAG5iE,GAAGw2C,GAAC,CAAGx2C,EAAGsM,KAChB,MAAMjO,EAAIo8D,GAAGnuD,GACbpV,EAAEmH,MAGV2uD,GAAGhtD,GACC,OAAO8iE,GAAG9iE,GAAGgD,IAAI,mBAAmBoN,MAAMpQ,IAAMmuB,GAAE,OAASnuB,GAAIA,KAEnEitD,GAAGjtD,EAAG9I,GACF,OAAO4rE,GAAG9iE,GAAGsS,IAAI,kBAAmBpb,GAExCg2D,GAAGltD,EAAG9I,GACF,OAAO0rE,GAAG5iE,GAAGsS,IAAIqoD,GAAG/mE,KAAK0mD,GAAIpjD,IAM1Bi2D,GAAGntD,EAAG9I,GACT,IAAIoV,GAAI,EACR,OAAOtM,EAAEkyD,SAAWh7D,EAAE+qE,kBAAoB/qE,EAAE+qE,gBAAkBjiE,EAAEkyD,SAAU5lD,GAAI,GAC9EtM,EAAEq6C,eAAiBnjD,EAAEmrE,8BAAgCnrE,EAAEmrE,4BAA8BriE,EAAEq6C,eACvF/tC,GAAI,GAAKA,EAEby2D,eAAe/iE,GACX,OAAOpM,KAAKo5D,GAAGhtD,GAAGoQ,MAAMpQ,GAAKA,EAAEwiE,cAEnCQ,cAAchjE,EAAG9I,GAIb,MAAMoV,EAAI8+C,GAAGl0D,GAAImH,EAAI49D,YAAYC,MAAM,CAAE5vD,EAAGmH,OAAOktD,mBAAqB,CAAEr0D,EAAGmH,OAAO2oD,oBACpF,IAAInpE,EAAI,KACR,OAAO2vE,GAAG5iE,GAAGw2C,EAAE,CACXgH,MAAOn/C,EACPoN,MAAO,uBACNzL,EAAGsM,EAAGjO,KACP,MAAMi3C,EAAImlB,GAAGnuD,GAGD++C,GAAGn0D,EAAGo+C,EAAEhzC,UAAYrP,EAAIqiD,EAAGj3C,EAAE48B,WACzC7qB,UAAYnd,IAEpBgwE,gBAAgBjjE,EAAG9I,EAAGoV,GAGlB,MAAMjO,EAAI,GAAIpL,EAAIiwE,GAAGljE,GACrB,OAAO9I,EAAE4S,SAAS5S,IACd,MAAMo+C,EAAIqhB,GAAGz/D,EAAE+5B,MACf5yB,EAAEnJ,KAAKjC,EAAEqf,IAAI,CACT4/C,SAAU5lD,EACV2kB,KAAMqkB,KACLj3C,EAAEnJ,KAAKtB,KAAK6sE,kBAAkB0C,aAAanjE,EAAGsM,EAAGpV,OACrDokD,GAAGS,QAAQ19C,GAEpB+kE,mBAAmBpjE,EAAG9I,EAAGoV,GAGrB,MAAMjO,EAAI6kE,GAAGljE,GACb,OAAOs7C,GAAGxxC,QAAQ5S,GAAIA,IAClB,MAAMjE,EAAI0jE,GAAGz/D,EAAE+5B,MACf,OAAOqqB,GAAGS,QAAQ,CAAE19C,EAAEk0B,OAAO,CAAEjmB,EAAGrZ,IAAMW,KAAK6sE,kBAAkB4C,gBAAgBrjE,EAAGsM,EAAGpV,QAG7FyrE,8BAA8B3iE,EAAG9I,GAC7B,MAAMoV,EAAI42D,GAAGljE,GAAI3B,EAAI49D,YAAYC,MAAM,CAAEhlE,GAAK,CAAEA,EAAI,IACrC,GACA,GACf,OAAOoV,EAAEimB,OAAOl0B,GAEpBilE,2BAA2BtjE,EAAG9I,GAC1B,MAAMoV,EAAI2vD,YAAYC,MAAM,CAAEhlE,GAAK,CAAEA,EAAI,IAC1B,GACA,GAAKmH,EAAI6kE,GAAGljE,GAC3B,IAAI/M,EAAI89D,KACR,OAAO1yD,EAAEm4C,EAAE,CACPgH,MAAOlxC,EACPm9B,GAAG,KACFzpC,EAAG9I,EAAGoV,KACP,MAAMjO,EAAIy4D,GAAG92D,EAAE,IAAKs1C,EAAI,IAAI2D,GAAG56C,GAC/BpL,EAAIA,EAAEqY,IAAIgqC,MACVllC,UAAYnd,IAEpBogC,YAAYrzB,EAAG9I,GACX,MAAMoV,EAAIqqD,GAAGz/D,EAAE+5B,MAAO5yB,EAAI49D,YAAYC,MAAM,CAAE5vD,GAAK,CAAEqqC,GAAGrqC,KACzC,GACA,GACf,IAAIrZ,EAAI,EACR,OAAOiwE,GAAGljE,GAAGw2C,EAAE,CACX/qC,MAAO,uBACPg+B,GAAG,EACH+T,MAAOn/C,IACV,EAAK2B,EAAG9I,GAAIoV,EAAGjO,KAIZ,IAAM2B,IAAM/M,IAAKoL,EAAE48B,WACnB7qB,MAAI,IAAQnd,EAAI,IAUxBsvD,GAAGviD,EAAG9I,GACF,OAAO0rE,GAAG5iE,GAAGgD,IAAI9L,GAAGkZ,MAAMpQ,GAAKA,EAAIy6D,GAAGz6D,GAAK,QAM/C,SAAS4iE,GAAG5iE,GACZ,OAAOw4D,GAAGx4D,EAAG,WAKb,SAAS8iE,GAAG9iE,GACZ,OAAOw4D,GAAGx4D,EAAG,gBAKb,SAASkjE,GAAGljE,GACZ,OAAOw4D,GAAGx4D,EAAG,mBAkBb,SAASujE,IAAIvjE,EAAG9I,IAAKoV,EAAGjO,IACxB,MAAMpL,EAAIujD,GAAEx2C,EAAGsM,GACf,OAAO,IAAMrZ,EAAIujD,GAAEt/C,EAAGmH,GAAKpL,EAO3B,MAAMuwE,GACNjqE,YAAYyG,GACRpM,KAAK+5D,GAAK3tD,EAAGpM,KAAKgiC,OAAS,IAAIizB,GAAG0a,IAAK3vE,KAAK65D,GAAK,EAErDL,KACI,QAASx5D,KAAK65D,GAElBJ,GAAGrtD,GACC,MAAM9I,EAAI,CAAE8I,EAAGpM,KAAKw5D,MACpB,GAAIx5D,KAAKgiC,OAAOtd,KAAO1kB,KAAK+5D,GAAI/5D,KAAKgiC,OAAShiC,KAAKgiC,OAAOtqB,IAAIpU,OAAS,CACnE,MAAM8I,EAAIpM,KAAKgiC,OAAOmzB,OACtBwa,GAAGrsE,EAAG8I,GAAK,IAAMpM,KAAKgiC,OAAShiC,KAAKgiC,OAAOrD,OAAOvyB,GAAGsL,IAAIpU,KAG7DusE,eAOA,OAAO7vE,KAAKgiC,OAAOmzB,OAAO,IAO9B,MAAM2a,GACNnqE,YAAYyG,EAAG9I,EAAGoV,GACd1Y,KAAK+vE,iBAAmB3jE,EAAGpM,KAAKoqD,WAAa9mD,EAAGtD,KAAKyqD,WAAa/xC,EAAG1Y,KAAK05D,GAAK,KAEnF34C,SACK,IAAM/gB,KAAK+vE,iBAAiBxjD,OAAO6/C,8BAAgCpsE,KAAK25D,GAAG,KAEhF74C,OACI9gB,KAAK05D,KAAO15D,KAAK05D,GAAG5hC,SAAU93B,KAAK05D,GAAK,MAExCpP,cACA,OAAO,OAAStqD,KAAK05D,GAEzBC,GAAGvtD,GACCyO,GAAE,sBAAuB,mCAAmCzO,OAAQpM,KAAK05D,GAAK15D,KAAKoqD,WAAWG,kBAAkB,yBAA8Dn+C,GAAC,UAC3KpM,KAAK05D,GAAK,KACV,UACU15D,KAAKyqD,WAAWulB,eAAehwE,KAAK+vE,kBAC5C,MAAO3jE,GACLs9C,GAAGt9C,GAAKyO,GAAE,sBAAuB,uDAAwDzO,SAAWq7C,GAAGr7C,SAErGpM,KAAK25D,GAAG,SAK8B,MAAMsW,GAC1DtqE,YAAYyG,EAAG9I,GACXtD,KAAK45D,GAAKxtD,EAAGpM,KAAKusB,OAASjpB,EAE/B4sE,qBAAqB9jE,EAAG9I,GACpB,OAAOtD,KAAK45D,GAAGI,GAAG5tD,GAAGoQ,MAAMpQ,GAAKxB,KAAKixB,MAAMv4B,EAAI,IAAM8I,KAEzD+jE,kBAAkB/jE,EAAG9I,GACjB,GAAI,IAAMA,EAAG,OAAOokD,GAAGxpC,QAAQotC,GAAG1F,IAClC,MAAMltC,EAAI,IAAIk3D,GAAGtsE,GACjB,OAAOtD,KAAK45D,GAAGkF,cAAc1yD,GAAIA,GAAKsM,EAAE+gD,GAAGrtD,EAAEq6C,kBAAkBjqC,MAAI,IAAQxc,KAAK45D,GAAGE,GAAG1tD,GAAIA,GAAKsM,EAAE+gD,GAAGrtD,OAAOoQ,MAAI,IAAQ9D,EAAEm3D,WAE7HZ,cAAc7iE,EAAG9I,EAAGoV,GAChB,OAAO1Y,KAAK45D,GAAGqV,cAAc7iE,EAAG9I,EAAGoV,GAEvC03D,wBAAwBhkE,EAAG9I,GACvB,OAAOtD,KAAK45D,GAAGwW,wBAAwBhkE,EAAG9I,GAE9C+sE,QAAQjkE,EAAG9I,GACP,OAAQ,IAAMtD,KAAKusB,OAAO6/C,8BAAgCvxD,GAAE,sBAAuB,wCACnF6sC,GAAGxpC,QAAQ4tD,KAAO9rE,KAAKswE,aAAalkE,GAAGoQ,MAAM9D,GAAKA,EAAI1Y,KAAKusB,OAAO6/C,8BAAgCvxD,GAAE,sBAAuB,0CAA0CnC,6BAA6B1Y,KAAKusB,OAAO6/C,gCAC9MN,IAAM9rE,KAAKk6D,GAAG9tD,EAAG9I,KAErBgtE,aAAalkE,GACT,OAAOpM,KAAK45D,GAAG0W,aAAalkE,GAEhC8tD,GAAG9tD,EAAG9I,GACF,IAAIoV,EAAGjO,EAAGpL,EAAGqiD,EAAGD,EAAGliD,EAAG2H,EACtB,MAAMwlB,EAAI1iB,KAAKD,MACf,OAAO/J,KAAKkwE,qBAAqB9jE,EAAGpM,KAAKusB,OAAO8/C,qBAAqB7vD,MAAMlZ,IAE3EA,EAAItD,KAAKusB,OAAO+/C,iCAAmCzxD,GAAE,sBAAuB,8DAA8D7a,KAAKusB,OAAO+/C,wCAAwChpE,KAC9LmH,EAAIzK,KAAKusB,OAAO+/C,iCAAmC7hE,EAAInH,EAAGo+C,EAAI13C,KAAKD,MAAO/J,KAAKmwE,kBAAkB/jE,EAAG3B,MAAM+R,MAAM/R,IAAMiO,EAAIjO,EAC1Hg3C,EAAIz3C,KAAKD,MAAO/J,KAAKivE,cAAc7iE,EAAGsM,EAAGpV,MAAMkZ,MAAMlZ,IAAMjE,EAAIiE,EAAG/D,EAAIyK,KAAKD,MAC3E/J,KAAKowE,wBAAwBhkE,EAAGsM,MAAM8D,MAAMpQ,IACpClF,EAAI8C,KAAKD,MAAO2xB,MAAOz5B,EAAE8G,OACzB8R,GAAE,sBAAuB,gDAAgD6mC,EAAIh1B,yCAAyCjiB,SAAWg3C,EAAIC,GAAK,OAAS,aAAariD,iBAAmBE,EAAIkiD,GAAK,OAAS,aAAar1C,mBAAqBlF,EAAI3H,GAAK,OAAS,mBAAmB2H,EAAIwlB,OAE7Qg7B,GAAGxpC,QAAQ,CACd6tD,QAAQ,EACRC,yBAA0BvhE,EAC1BwhE,eAAgB5sE,EAChB6sE,iBAAkB9/D,QAuBlC,MAAMmkE,GACF5qE,YAAYyG,EAAG9I,GACXtD,KAAKoa,GAAKhO,EAAGpM,KAAK+vE,iBAAmB,SAAS3jE,EAAG9I,GAC7C,OAAO,IAAI2sE,GAAG7jE,EAAG9I,GADgB,CAEnCtD,KAAMsD,GAEZ02D,GAAG5tD,GACC,MAAM9I,EAAItD,KAAKm6D,GAAG/tD,GAClB,OAAOpM,KAAKoa,GAAGo2D,iBAAiBrB,eAAe/iE,GAAGoQ,MAAMpQ,GAAK9I,EAAEkZ,MAAMlZ,GAAK8I,EAAI9I,MAElF62D,GAAG/tD,GACC,IAAI9I,EAAI,EACR,OAAOtD,KAAK85D,GAAG1tD,GAAIA,IACf9I,OACAkZ,UAAYlZ,IAEpBw7D,cAAc1yD,EAAG9I,GACb,OAAOtD,KAAKoa,GAAGo2D,iBAAiB1R,cAAc1yD,EAAG9I,GAErDw2D,GAAG1tD,EAAG9I,GACF,OAAOtD,KAAK47D,GAAGxvD,GAAI,CAACA,EAAGsM,IAAMpV,EAAEoV,KAEnC62D,aAAanjE,EAAG9I,EAAGoV,GACf,OAAO+3D,GAAGrkE,EAAGsM,GAEjB+2D,gBAAgBrjE,EAAG9I,EAAGoV,GAClB,OAAO+3D,GAAGrkE,EAAGsM,GAEjBu2D,cAAc7iE,EAAG9I,EAAGoV,GAChB,OAAO1Y,KAAKoa,GAAGo2D,iBAAiBvB,cAAc7iE,EAAG9I,EAAGoV,GAExDk1D,wBAAwBxhE,EAAG9I,GACvB,OAAOmtE,GAAGrkE,EAAG9I,GAOV+2D,GAAGjuD,EAAG9I,GACT,OAAO,SAAS8I,EAAG9I,GACf,IAAIoV,GAAI,EACR,OAAOq1D,GAAG3hE,GAAGy2C,IAAIp4C,GAAKqjE,GAAG1hE,EAAG3B,EAAGnH,GAAGkZ,MAAMpQ,IAAMA,IAAMsM,GAAI,GAAKgvC,GAAGxpC,SAAS9R,QAAQoQ,MAAM,IAAM9D,IAF1F,CAGLtM,EAAG9I,GAET8sE,wBAAwBhkE,EAAG9I,GACvB,MAAMoV,EAAI1Y,KAAKoa,GAAGs2D,yBAAyBC,kBAAmBlmE,EAAI,GAClE,IAAIpL,EAAI,EACR,OAAOW,KAAK47D,GAAGxvD,GAAC,CAAIs1C,EAAGD,KACnB,GAAIA,GAAKn+C,EAAG,CACR,MAAMA,EAAItD,KAAKq6D,GAAGjuD,EAAGs1C,GAAGllC,MAAMlZ,IAC1B,IAAKA,EAGL,OAAOjE,IAAKqZ,EAAEk4D,SAASxkE,EAAGs1C,GAAGllC,WAAa9D,EAAEm4D,YAAYnvB,EAAGiC,GAAGnS,OAAQ89B,GAAGljE,GAAGuyB,OAAO,CAAE,EAAGokC,GAAGrhB,EAAErkB,cAEjG5yB,EAAEnJ,KAAKgC,OAEXkZ,MAAI,IAAQkrC,GAAGS,QAAQ19C,KAAK+R,MAAM,IAAM9D,EAAEvN,MAAMiB,KAAKoQ,MAAI,IAAQnd,IAEzE0/D,aAAa3yD,EAAG9I,GACZ,MAAMoV,EAAIpV,EAAEyiE,mBAAmB35D,EAAEu4D,uBACjC,OAAO3kE,KAAKoa,GAAGo2D,iBAAiB3B,iBAAiBziE,EAAGsM,GAExDo4D,oBAAoB1kE,EAAG9I,GACnB,OAAOmtE,GAAGrkE,EAAG9I,GAOVs4D,GAAGxvD,EAAG9I,GACT,MAAMoV,EAAI42D,GAAGljE,GACb,IAAI3B,EAAGpL,EAAIisD,GAAG1F,GACd,OAAOltC,EAAEkqC,EAAE,CACP/qC,MAAO,2BACLzL,EAAGsM,IAAK2kB,KAAMqkB,EAAG+E,eAAgBhF,MACnC,IAAMr1C,GAGN/M,IAAMisD,GAAG1F,IAAMtiD,EAAE,IAAI+hD,GAAG6d,GAAGz4D,IAAKpL,GAKhCA,EAAIoiD,EAAGh3C,EAAIi3C,GAGXriD,EAAIisD,GAAG1F,MACPppC,MAAI,KAIJnd,IAAMisD,GAAG1F,IAAMtiD,EAAE,IAAI+hD,GAAG6d,GAAGz4D,IAAKpL,MAGxCixE,aAAalkE,GACT,OAAOpM,KAAKoa,GAAGs2D,yBAAyBK,QAAQ3kE,IAIxD,SAASqkE,GAAGrkE,EAAG9I,GACX,OAAOgsE,GAAGljE,GAAGsS,IAKb,SAAStS,EAAG9I,GACR,MAAO,CACHg7D,SAAU,EACVjhC,KAAM0lC,GAAG32D,EAAEixB,MACXopB,eAAgBnjD,GAJxB,CAMEA,EAAG8I,EAAEu4D,wBAgCP,MAAMqM,GACNrrE,cAEI3F,KAAKkrD,QAAU,IAAIkR,IAAIhwD,GAAKA,EAAE/G,cAAe+G,EAAG9I,IAAM8I,EAAE0yC,QAAQx7C,KAAMtD,KAAKixE,gBAAiB,EAOzFC,SAAS9kE,GACZpM,KAAKmxE,mBAAoBnxE,KAAKkrD,QAAQ7tC,IAAIjR,EAAEvF,IAAKuF,GAO9CykE,YAAYzkE,EAAG9I,GAClBtD,KAAKmxE,mBAAoBnxE,KAAKkrD,QAAQ7tC,IAAIjR,EAAG6pD,GAAGmb,mBAAmBhlE,GAAGsqD,YAAYpzD,IAY/EstE,SAASxkE,EAAG9I,GACftD,KAAKmxE,mBACL,MAAMz4D,EAAI1Y,KAAKkrD,QAAQ97C,IAAI9L,GAC3B,YAAO,IAAWoV,EAAIgvC,GAAGxpC,QAAQxF,GAAK1Y,KAAKqxE,aAAajlE,EAAG9I,GAWxDonE,WAAWt+D,EAAG9I,GACjB,OAAOtD,KAAKsxE,gBAAgBllE,EAAG9I,GAK5B6H,MAAMiB,GACT,OAAOpM,KAAKmxE,mBAAoBnxE,KAAKixE,gBAAiB,EAAIjxE,KAAK+1D,aAAa3pD,GAE3B+kE,qBAsBrD,MAAMI,GACN5rE,YAAYyG,GACRpM,KAAK0mD,GAAKt6C,EAEdolE,gBAAgBplE,GACZpM,KAAK6qD,aAAez+C,EAOjB8kE,SAAS9kE,EAAG9I,EAAGoV,GAClB,OAAO+4D,GAAGrlE,GAAGsS,IAAIhG,GAOdm4D,YAAYzkE,EAAG9I,EAAGoV,GACrB,OAAO+4D,GAAGrlE,GAAGuyB,OAKb,SAASvyB,EAAG9I,GACR,MAAMoV,EAAItM,EAAEixB,KAAKxvB,UACjB,MAAO,CACW6K,EAAEjN,MAAM,EAAGiN,EAAEpZ,OAAS,GACpBoZ,EAAEA,EAAEpZ,OAAS,GAAIgnE,GAAGhjE,GACtBoV,EAAEA,EAAEpZ,OAAS,IALnC,CAUHgE,EAAGoV,IAOGg5D,eAAetlE,EAAG9I,GACrB,OAAOtD,KAAK2xE,YAAYvlE,GAAGoQ,MAAM9D,IAAMA,EAAEk5D,UAAYtuE,EAAGtD,KAAKu6D,GAAGnuD,EAAGsM,MAEvEk4D,SAASxkE,EAAG9I,GACR,IAAIoV,EAAIu9C,GAAGmb,mBAAmB9tE,GAC9B,OAAOmuE,GAAGrlE,GAAGw2C,EAAE,CACX/qC,MAAO,mBACP+xC,MAAOye,YAAYqD,KAAKmG,GAAGvuE,MAC3B,CAAC8I,EAAG3B,KACJiO,EAAI1Y,KAAK26D,GAAGr3D,EAAGmH,MACf+R,UAAY9D,IAObkiD,GAAGxuD,EAAG9I,GACT,IAAIoV,EAAI,CACJgM,KAAM,EACNvhB,SAAU8yD,GAAGmb,mBAAmB9tE,IAEpC,OAAOmuE,GAAGrlE,GAAGw2C,EAAE,CACX/qC,MAAO,mBACP+xC,MAAOye,YAAYqD,KAAKmG,GAAGvuE,MAC3B,CAAC8I,EAAG3B,KACJiO,EAAI,CACAvV,SAAUnD,KAAK26D,GAAGr3D,EAAGmH,GACrBia,KAAMgoD,GAAGjiE,OAEb+R,UAAY9D,IAEpBgyD,WAAWt+D,EAAG9I,GACV,IAAIoV,EAAIgkD,KACR,OAAO18D,KAAK66D,GAAGzuD,EAAG9I,GAAI,CAAC8I,EAAG9I,KACtB,MAAMmH,EAAIzK,KAAK26D,GAAGvuD,EAAG9I,GACrBoV,EAAIA,EAAEw6C,OAAO9mD,EAAG3B,MAChB+R,UAAY9D,IAQbwiD,GAAG9uD,EAAG9I,GACT,IAAIoV,EAAIgkD,KAAMjyD,EAAI,IAAIqoD,GAAGzN,GAAGlB,YAC5B,OAAOnkD,KAAK66D,GAAGzuD,EAAG9I,GAAI,CAAC8I,EAAG9I,KACtB,MAAMjE,EAAIW,KAAK26D,GAAGvuD,EAAG9I,GACrBoV,EAAIA,EAAEw6C,OAAO9mD,EAAG/M,GAAIoL,EAAIA,EAAEyoD,OAAO9mD,EAAGsgE,GAAGppE,OACvCkZ,MAAI,KAAS,CACbmlD,UAAWjpD,EACX6iD,GAAI9wD,MAGZowD,GAAGzuD,EAAG9I,EAAGoV,GACL,GAAIpV,EAAEqhD,UAAW,OAAO+C,GAAGxpC,UAC3B,IAAIzT,EAAI,IAAIwqD,GAAG6c,IACfxuE,EAAE4S,SAAS9J,GAAK3B,EAAIA,EAAEiN,IAAItL,KAC1B,MAAM/M,EAAIgpE,YAAYC,MAAMuJ,GAAGpnE,EAAEyqD,SAAU2c,GAAGpnE,EAAE0qD,SAAUzT,EAAIj3C,EAAEgpD,cAChE,IAAIhS,EAAIC,EAAEsS,UACV,OAAOyd,GAAGrlE,GAAGw2C,EAAE,CACX/qC,MAAO,mBACP+xC,MAAOvqD,KACN+M,EAAG9I,EAAGmH,KACP,MAAMpL,EAAIgmD,GAAGkmB,aAAa,IAAKjoE,EAAE8iE,WAAY9iE,EAAEkiD,gBAAiBliD,EAAE+iE,aAEtD,KAAM5kB,GAAKqwB,GAAGrwB,EAAGpiD,GAAK,GAAKqZ,EAAE+oC,EAAG,MAAOA,EAAIC,EAAEsS,UACzDvS,GAAKA,EAAE3C,QAAQz/C,KAEfqZ,EAAE+oC,EAAGn+C,GAAIm+C,EAAIC,EAAEwS,UAAYxS,EAAEsS,UAAY,MAEzCvS,EAAIh3C,EAAE4D,EAAEwjE,GAAGpwB,IAAMh3C,EAAE48B,UACnB7qB,MAAI,KAGJ,KAAMilC,GAAK/oC,EAAE+oC,EAAG,MAAOA,EAAIC,EAAEwS,UAAYxS,EAAEsS,UAAY,QAG/D+d,qBAAqB3lE,EAAG9I,EAAGoV,GACvB,MAAMjO,EAAI,CAAEnH,EAAEkhD,UAAU32C,UAAWvK,EAAEohD,cAAe4hB,GAAG5tD,EAAEquC,UAAWruC,EAAEsuC,YAAY3pB,KAAKsnB,UAAY,GAAKjsC,EAAEsuC,YAAY3pB,KAAKqnB,eAAiBrlD,EAAI,CAAEiE,EAAEkhD,UAAU32C,UAAWvK,EAAEohD,cAAe,CAAE7kC,OAAO8sC,iBAAkB9sC,OAAO8sC,kBAAoB,IAChP,OAAO8kB,GAAGrlE,GAAGs8B,EAAE2/B,YAAYC,MAAM79D,EAAGpL,GAAG,IAAKmd,MAAMpQ,IAC9C,IAAI9I,EAAIo5D,KACR,IAAK,MAAMhkD,KAAKtM,EAAG,CACf,MAAMA,EAAIpM,KAAK26D,GAAGtV,GAAGkmB,aAAa7yD,EAAE0tD,WAAW7qD,OAAO7C,EAAE8sC,gBAAiB9sC,EAAE2tD,aAAc3tD,GACzFpV,EAAIA,EAAE4vD,OAAO9mD,EAAEvF,IAAKuF,GAExB,OAAO9I,KAGf0uE,0BAA0B5lE,EAAG9I,EAAGoV,EAAGjO,GAC/B,IAAIpL,EAAIq9D,KACR,MAAMhb,EAAIuwB,GAAG3uE,EAAGoV,GAAI+oC,EAAIwwB,GAAG3uE,EAAGojD,GAAGr0C,OACjC,OAAOo/D,GAAGrlE,GAAGw2C,EAAE,CACX/qC,MAAO,uBACP+xC,MAAOye,YAAYC,MAAM5mB,EAAGD,GAAG,MAC9Br1C,EAAG9I,EAAGoV,KACP,MAAMgpC,EAAI1hD,KAAK26D,GAAGtV,GAAGkmB,aAAajoE,EAAE8iE,WAAW7qD,OAAOjY,EAAEkiD,gBAAiBliD,EAAE+iE,aAAc/iE,GACzFjE,EAAIA,EAAE6zD,OAAOxR,EAAE76C,IAAK66C,GAAIriD,EAAEqlB,OAASja,GAAKiO,EAAE2uB,UAC1C7qB,UAAYnd,IAEpBsxE,gBAAgBvkE,GACZ,OAAO,IAAI8lE,GAAGlyE,OAAQoM,GAAKA,EAAE+lE,eAEjCpB,QAAQ3kE,GACJ,OAAOpM,KAAK2xE,YAAYvlE,GAAGoQ,MAAMpQ,GAAKA,EAAEwlE,WAE5CD,YAAYvlE,GACR,OAAOgmE,GAAGhmE,GAAGgD,IAAI,2BAA2BoN,MAAMpQ,IAAMmuB,KAAInuB,GAAIA,KAEpEmuD,GAAGnuD,EAAG9I,GACF,OAAO8uE,GAAGhmE,GAAGsS,IAAI,0BAA2Bpb,GAKzCq3D,GAAGvuD,EAAG9I,GACT,GAAIA,EAAG,CACH,MAAM8I,EAhtFmD,SAAYA,EAAG9I,GAChF,IAAIoV,EACJ,GAAIpV,EAAEH,SAAUuV,EAAIgoD,GAAGt0D,EAAEkjD,GAAIhsD,EAAEH,WAAYG,EAAEszD,4BAA6B,GAAItzD,EAAEijE,WAAY,CACxF,MAAMn6D,EAAIi5C,GAAGkmB,aAAajoE,EAAEijE,WAAWlpC,MAAO5yB,EAAIi8D,GAAGpjE,EAAEijE,WAAWxf,UAClEruC,EAAIu9C,GAAG+I,cAAc5yD,EAAG3B,GAAInH,EAAEszD,uBAAyBl+C,EAAE89C,+BACtD,CACH,IAAKlzD,EAAEmjE,gBAAiB,OAAOr6B,KAC/B,CACI,MAAMhgC,EAAIi5C,GAAGkmB,aAAajoE,EAAEmjE,gBAAgBppC,MAAO5yB,EAAIi8D,GAAGpjE,EAAEmjE,gBAAgBp1D,SAC5EqH,EAAIu9C,GAAGoc,mBAAmBjmE,EAAG3B,IAGrC,OAAOnH,EAAEyjD,UAAYruC,EAAEg+C,YAAY,SAAStqD,GACxC,MAAM9I,EAAI,IAAI0/C,GAAG52C,EAAE,GAAIA,EAAE,IACzB,OAAOu3C,GAAGiD,cAActjD,GAFO,CAGjCA,EAAEyjD,WAAYruC,EAisFE45D,CAAGtyE,KAAK0mD,GAAIpjD,GAGV,IAAM8I,EAAE4qD,iBAAkB5qD,EAAEiF,QAAQytC,QAAQ6E,GAAGnS,OAAS,OAAOplC,EAE/E,OAAO6pD,GAAGmb,mBAAmBhlE,IAIc,SAASmmE,GAAGnmE,GAC3D,OAAO,IAAImlE,GAAGnlE,GASd,MAAM8lE,WAAWlB,GAMjBrrE,YAAYyG,EAAG9I,GACXyC,QAAS/F,KAAK07D,GAAKtvD,EAAGpM,KAAKmyE,cAAgB7uE,EAG3CtD,KAAK27D,GAAK,IAAIS,IAAIhwD,GAAKA,EAAE/G,cAAe+G,EAAG9I,IAAM8I,EAAE0yC,QAAQx7C,KAE/DyyD,aAAa3pD,GACT,MAAM9I,EAAI,GACV,IAAIoV,EAAI,EAAGjO,EAAI,IAAIwqD,IAAE,CAAG7oD,EAAG9I,IAAMs/C,GAAEx2C,EAAE24C,kBAAmBzhD,EAAEyhD,qBAC1D,OAAO/kD,KAAKkrD,QAAQh1C,SAAO,CAAG7W,EAAGqiD,KAC7B,MAAMD,EAAIzhD,KAAK27D,GAAGvsD,IAAI/P,GACtB,GAAIiE,EAAEhC,KAAKtB,KAAK07D,GAAGmV,YAAYzkE,EAAG/M,EAAGoiD,EAAEsF,WAAYrF,EAAEoV,kBAAmB,CACpE,MAAM70D,EAAIkkE,GAAGnmE,KAAK07D,GAAGhV,GAAIhF,GACzBj3C,EAAIA,EAAEiN,IAAIrY,EAAEg+B,KAAKmnB,WACjB,MAAMjlD,EAAImtE,GAAGzqE,GACbyW,GAAKnZ,EAAIkiD,EAAE/8B,KAAMphB,EAAEhC,KAAKtB,KAAK07D,GAAGwV,SAAS9kE,EAAG/M,EAAG4C,SAC5C,GAAIyW,GAAK+oC,EAAE/8B,KAAM1kB,KAAKmyE,cAAe,CAKxC,MAAMz5D,EAAIytD,GAAGnmE,KAAK07D,GAAGhV,GAAIhF,EAAE4U,oBAAoB3S,GAAGnS,QAClDluC,EAAEhC,KAAKtB,KAAK07D,GAAGwV,SAAS9kE,EAAG/M,EAAGqZ,QAEjCjO,EAAEyL,SAASwC,IACZpV,EAAEhC,KAAKtB,KAAK07D,GAAG7Q,aAAa2f,2BAA2Bp+D,EAAGsM,OACzDpV,EAAEhC,KAAKtB,KAAK07D,GAAGgW,eAAetlE,EAAGsM,IAAKgvC,GAAGS,QAAQ7kD,GAE1D+tE,aAAajlE,EAAG9I,GAEZ,OAAOtD,KAAK07D,GAAGd,GAAGxuD,EAAG9I,GAAGkZ,MAAMpQ,IAAMpM,KAAK27D,GAAGt+C,IAAI/Z,EAAG,CAC/CohB,KAAMtY,EAAEsY,KACRqiC,SAAU36C,EAAEjJ,SAAS4jD,WACrB36C,EAAEjJ,YAEVmuE,gBAAgBllE,EAAG9I,GAGf,OAAOtD,KAAK07D,GAAGR,GAAG9uD,EAAG9I,GAAGkZ,MAAI,EAAImlD,UAAWv1D,EAAGmvD,GAAIj4D,MAIlDA,EAAE4S,SAAO,CAAG5S,EAAGoV,KACX1Y,KAAK27D,GAAGt+C,IAAI/Z,EAAG,CACXohB,KAAMhM,EACNquC,SAAU36C,EAAEgD,IAAI9L,GAAGyjD,cAEtB36C,MAIb,SAASgmE,GAAGhmE,GACR,OAAOw4D,GAAGx4D,EAAG,wBAKb,SAASqlE,GAAGrlE,GACZ,OAAOw4D,GAAGx4D,EAAG,sBAMb,SAASylE,GAAGzlE,GACZ,MAAM9I,EAAI8I,EAAEixB,KAAKxvB,UACjB,MAAO,CACWvK,EAAEmI,MAAM,EAAGnI,EAAEhE,OAAS,GACpBgE,EAAEA,EAAEhE,OAAS,GACfgE,EAAEA,EAAEhE,OAAS,IAGnC,SAAS2yE,GAAG7lE,EAAG9I,GACX,MAAMoV,EAAIpV,EAAE0jD,YAAY3pB,KAAKxvB,UAC7B,MAAO,CACazB,EAAGk6D,GAAGhjE,EAAEyjD,UACVruC,EAAEjN,MAAM,EAAGiN,EAAEpZ,OAAS,GACtBoZ,EAAEpZ,OAAS,EAAIoZ,EAAEA,EAAEpZ,OAAS,GAAK,IASnD,SAASwyE,GAAG1lE,EAAG9I,GACf,MAAMoV,EAAItM,EAAEixB,KAAKxvB,UAAWpD,EAAInH,EAAE+5B,KAAKxvB,UAEvC,IAAIxO,EAAI,EACR,IAAK,IAAI+M,EAAI,EAAGA,EAAIsM,EAAEpZ,OAAS,GAAK8M,EAAI3B,EAAEnL,OAAS,IAAK8M,EAAG,GAAI/M,EAAIujD,GAAElqC,EAAEtM,GAAI3B,EAAE2B,IAC7E/M,EAAG,OAAOA,EACV,OAAOA,EAAIujD,GAAElqC,EAAEpZ,OAAQmL,EAAEnL,QAASD,IAAMA,EAAIujD,GAAElqC,EAAEA,EAAEpZ,OAAS,GAAImL,EAAEA,EAAEnL,OAAS,IAC5ED,GAAKujD,GAAElqC,EAAEA,EAAEpZ,OAAS,GAAImL,EAAEA,EAAEnL,OAAS,KA+DzC,MAAMkzE,GACF7sE,YAAYyG,EAOZ9I,GACItD,KAAK68D,kBAAoBzwD,EAAGpM,KAAKqlE,cAAgB/hE,GAyBrD,MAAMmvE,GACN9sE,YAAYyG,EAAG9I,EAAGoV,EAAGjO,GACjBzK,KAAK0yE,oBAAsBtmE,EAAGpM,KAAK2yE,cAAgBrvE,EAAGtD,KAAK4yE,qBAAuBl6D,EAClF1Y,KAAK6qD,aAAepgD,EAOjBooE,YAAYzmE,EAAG9I,GAClB,IAAIoV,EAAI,KACR,OAAO1Y,KAAK4yE,qBAAqB5K,WAAW57D,EAAG9I,GAAGkZ,MAAM/R,IAAMiO,EAAIjO,EAAGzK,KAAK0yE,oBAAoB9B,SAASxkE,EAAG9I,MAAMkZ,MAAMpQ,IAAM,OAASsM,GAAK6iD,GAAG7iD,EAAEitD,SAAUv5D,EAAGspD,GAAG7O,QAAS7D,GAAGj5C,OAC3KqC,KAOG0mE,aAAa1mE,EAAG9I,GACnB,OAAOtD,KAAK0yE,oBAAoBhI,WAAWt+D,EAAG9I,GAAGkZ,MAAMlZ,GAAKtD,KAAK+yE,wBAAwB3mE,EAAG9I,EAAG65D,MAAM3gD,MAAM,IAAMlZ,MAW9GyvE,wBAAwB3mE,EAAG9I,EAAGoV,EAAIykD,MACrC,MAAM1yD,EAAIqyD,KACV,OAAO98D,KAAKgzE,iBAAiB5mE,EAAG3B,EAAGnH,GAAGkZ,MAAM,IAAMxc,KAAKizE,aAAa7mE,EAAG9I,EAAGmH,EAAGiO,GAAG8D,MAAMpQ,IAClF,IAAI9I,EAAIs5D,KACR,OAAOxwD,EAAE8J,UAAU9J,EAAGsM,KAClBpV,EAAIA,EAAE4vD,OAAO9mD,EAAGsM,EAAEmkD,sBACjBv5D,OAON4vE,sBAAsB9mE,EAAG9I,GAC5B,MAAMoV,EAAIokD,KACV,OAAO98D,KAAKgzE,iBAAiB5mE,EAAGsM,EAAGpV,GAAGkZ,MAAI,IAAQxc,KAAKizE,aAAa7mE,EAAG9I,EAAGoV,EAAGykD,QAK1E6V,iBAAiB5mE,EAAG9I,EAAGoV,GAC1B,MAAMjO,EAAI,GACV,OAAOiO,EAAExC,SAAS9J,IACd9I,EAAEo7B,IAAItyB,IAAM3B,EAAEnJ,KAAK8K,MAClBpM,KAAK4yE,qBAAqB1K,YAAY97D,EAAG3B,GAAG+R,MAAMpQ,IACnDA,EAAE8J,SAAO,CAAG9J,EAAGsM,KACXpV,EAAE+Z,IAAIjR,EAAGsM,SAedu6D,aAAa7mE,EAAG9I,EAAGoV,EAAGjO,GACzB,IAAIpL,EAAIq9D,KACR,MAAMhb,EAAIqb,KAAMtb,EAAIsb,KACpB,OAAOz5D,EAAE4S,UAAU9J,EAAG9I,KAClB,MAAMm+C,EAAI/oC,EAAEtJ,IAAI9L,EAAEuD,KAQN4D,EAAEi0B,IAAIp7B,EAAEuD,YAAS,IAAW46C,GAAKA,EAAEkkB,oBAAoB1K,IAAM57D,EAAIA,EAAE6zD,OAAO5vD,EAAEuD,IAAKvD,QAAK,IAAWm+C,GAAKC,EAAErkC,IAAI/Z,EAAEuD,IAAK46C,EAAEkkB,SAAS9J,gBAC1IN,GAAG9Z,EAAEkkB,SAAUriE,EAAGm+C,EAAEkkB,SAAS9J,eAAgB7Y,GAAGj5C,QAGhD23C,EAAErkC,IAAI/Z,EAAEuD,IAAK6uD,GAAG7O,YACf7mD,KAAKmzE,2BAA2B/mE,EAAG/M,GAAGmd,MAAMpQ,IAAMA,EAAE8J,SAAS,CAAC9J,EAAG9I,IAAMo+C,EAAErkC,IAAIjR,EAAG9I,KACrFA,EAAE4S,SAAO,CAAG9J,EAAG9I,KACX,IAAIoV,EACJ,OAAO+oC,EAAEpkC,IAAIjR,EAAG,IAAIomE,GAAGlvE,EAAG,QAAUoV,EAAIgpC,EAAEtyC,IAAIhD,UAAO,IAAWsM,EAAIA,EAAI,UACvE+oC,KAET0xB,2BAA2B/mE,EAAG9I,GAC1B,MAAMoV,EAAIqkD,KAEF,IAAItyD,EAAI,IAAIqoD,IAAI,CAAC1mD,EAAG9I,IAAM8I,EAAI9I,IAAKjE,EAAI89D,KAC/C,OAAOn9D,KAAK2yE,cAAclF,2CAA2CrhE,EAAG9I,GAAGkZ,MAAMpQ,IAC7E,IAAK,MAAM/M,KAAK+M,EAAG/M,EAAEgI,OAAO6O,SAAS9J,IACjC,MAAMs1C,EAAIp+C,EAAE8L,IAAIhD,GAChB,GAAI,OAASs1C,EAAG,OAChB,IAAID,EAAI/oC,EAAEtJ,IAAIhD,IAAMspD,GAAG7O,QACvBpF,EAAIpiD,EAAE8lE,iBAAiBzjB,EAAGD,GAAI/oC,EAAE2E,IAAIjR,EAAGq1C,GACvC,MAAMx/C,GAAKwI,EAAE2E,IAAI/P,EAAEgsD,UAAY8R,MAAMzlD,IAAItL,GACzC3B,EAAIA,EAAEyoD,OAAO7zD,EAAEgsD,QAASppD,SAE5Bua,MAAI,KACJ,MAAMklC,EAAI,GAAID,EAAIh3C,EAAEmpD,qBAGR,KAAMnS,EAAEyS,WAAa,CAC7B,MAAMzpD,EAAIg3C,EAAEuS,UAAW/xD,EAAIwI,EAAE5D,IAAKtH,EAAIkL,EAAE3D,MAAOI,EAAI81D,KACnDz9D,EAAE2W,SAAS9J,IACP,IAAK/M,EAAEq/B,IAAItyB,GAAI,CACX,MAAM3B,EAAIowD,GAAGv3D,EAAE8L,IAAIhD,GAAIsM,EAAEtJ,IAAIhD,IAC7B,OAAS3B,GAAKvD,EAAEmW,IAAIjR,EAAG3B,GAAIpL,EAAIA,EAAEqY,IAAItL,OAExCs1C,EAAEpgD,KAAKtB,KAAK4yE,qBAAqBzK,aAAa/7D,EAAGnK,EAAGiF,IAE7D,OAAOwgD,GAAGS,QAAQzG,MAClBllC,UAAY9D,IAKb06D,0CAA0ChnE,EAAG9I,GAChD,OAAOtD,KAAK0yE,oBAAoBhI,WAAWt+D,EAAG9I,GAAGkZ,MAAMlZ,GAAKtD,KAAKmzE,2BAA2B/mE,EAAG9I,KAQ5F+vE,0BAA0BjnE,EAAG9I,EAAGoV,GAKnC,OAAO,SAAStM,GACZ,OAAOi5C,GAAGsS,cAAcvrD,EAAEixB,OAAS,OAASjxB,EAAEo5C,iBAAmB,IAAMp5C,EAAE4lD,QAAQ1yD,OAD9E,CAELgE,GAAKtD,KAAKszE,kCAAkClnE,EAAG9I,EAAE+5B,MAAQi7B,GAAGh1D,GAAKtD,KAAKuzE,yCAAyCnnE,EAAG9I,EAAGoV,GAAK1Y,KAAKwzE,oCAAoCpnE,EAAG9I,EAAGoV,GAgBxKuyC,iBAAiB7+C,EAAG9I,EAAGoV,EAAGjO,GAC7B,OAAOzK,KAAK0yE,oBAAoBV,0BAA0B5lE,EAAG9I,EAAGoV,EAAGjO,GAAG+R,MAAMnd,IACxE,MAAMqiD,EAAIj3C,EAAIpL,EAAEqlB,KAAO,EAAI1kB,KAAK4yE,qBAAqBnK,8BAA8Br8D,EAAG9I,EAAGoV,EAAEuuC,eAAgBx8C,EAAIpL,EAAEqlB,MAAQgjC,GAAGxpC,QAAQ4+C,MAKxH,IAAIrb,GAAK,EAAGx/C,EAAI5C,EAC5B,OAAOqiD,EAAEllC,MAAMlZ,GAAKokD,GAAGxxC,QAAQ5S,GAAI,CAACA,EAAGoV,KAAO+oC,EAAI/oC,EAAEuuC,iBAAmBxF,EAAI/oC,EAAEuuC,gBAC7E5nD,EAAE+P,IAAI9L,GAAKokD,GAAGxpC,UAAYle,KAAK0yE,oBAAoB9B,SAASxkE,EAAG9I,GAAGkZ,MAAMpQ,IACpEnK,EAAIA,EAAEixD,OAAO5vD,EAAG8I,SACboQ,MAAI,IAAQxc,KAAKgzE,iBAAiB5mE,EAAG9I,EAAGjE,KAAKmd,MAAM,IAAMxc,KAAKizE,aAAa7mE,EAAGnK,EAAGqB,EAAG65D,QAAQ3gD,MAAMpQ,IAAM,CAC3Gi/C,QAAS5J,EACTyJ,QAASpmC,GAAG1Y,YAIxBknE,kCAAkClnE,EAAG9I,GAEjC,OAAOtD,KAAK6yE,YAAYzmE,EAAG,IAAIi5C,GAAG/hD,IAAIkZ,MAAMpQ,IACxC,IAAI9I,EAAIs5D,KACR,OAAOxwD,EAAE2qD,oBAAsBzzD,EAAIA,EAAE4vD,OAAO9mD,EAAEvF,IAAKuF,IAAK9I,KAGhEiwE,yCAAyCnnE,EAAG9I,EAAGoV,GAC3C,MAAMjO,EAAInH,EAAEkiD,gBACZ,IAAInmD,EAAIu9D,KACR,OAAO58D,KAAK6qD,aAAa4f,qBAAqBr+D,EAAG3B,GAAG+R,MAAMklC,GAAKgG,GAAGxxC,QAAQwrC,GAAIA,IAC1E,MAAMD,EAAI,SAASr1C,EAAG9I,GAClB,OAAO,IAAIy0D,GAAGz0D,EACO,KAAM8I,EAAE4rD,gBAAgBvsD,QAASW,EAAE4lD,QAAQvmD,QAASW,EAAEi4C,MAAOj4C,EAAE6rD,UAAW7rD,EAAEirD,QAASjrD,EAAEkrD,OAFtG,CAGRh0D,EAAGo+C,EAAE0C,MAAM35C,IACb,OAAOzK,KAAKwzE,oCAAoCpnE,EAAGq1C,EAAG/oC,GAAG8D,MAAMpQ,IAC3DA,EAAE8J,SAAO,CAAG9J,EAAG9I,KACXjE,EAAIA,EAAE6zD,OAAO9mD,EAAG9I,YAGxBkZ,MAAI,IAAQnd,MAEpBm0E,oCAAoCpnE,EAAG9I,EAAGoV,GAEtC,IAAIjO,EACJ,OAAOzK,KAAK0yE,oBAAoBX,qBAAqB3lE,EAAG9I,EAAE+5B,KAAM3kB,GAAG8D,MAAMnd,IAAMoL,EAAIpL,EACnFW,KAAK4yE,qBAAqBrK,yBAAyBn8D,EAAG9I,EAAE+5B,KAAM3kB,EAAEuuC,mBAAmBzqC,MAAMpQ,IAGrFA,EAAE8J,SAAO,CAAG9J,EAAG9I,KACX,MAAMoV,EAAIpV,EAAEsiE,SACZ,OAASn7D,EAAE2E,IAAIsJ,KAAOjO,EAAIA,EAAEyoD,OAAOx6C,EAAGu9C,GAAGmb,mBAAmB14D,QAGhE,IAAIA,EAAIkkD,KACR,OAAOnyD,EAAEyL,UAAUzL,EAAGpL,KAClB,MAAMqiD,EAAIt1C,EAAEgD,IAAI3E,QAChB,IAAWi3C,GAAK6Z,GAAG7Z,EAAEikB,SAAUtmE,EAAGq2D,GAAG7O,QAAS7D,GAAGj5C,OAEjDgvD,GAAGz1D,EAAGjE,KAAOqZ,EAAIA,EAAEw6C,OAAOzoD,EAAGpL,OAC5BqZ,MAoBb,MAAM+6D,GACN9tE,YAAYyG,GACRpM,KAAK0mD,GAAKt6C,EAAGpM,KAAKg7D,GAAK,IAAI5lC,IAAKp1B,KAAKi7D,GAAK,IAAI7lC,IAElDkyC,kBAAkBl7D,EAAG9I,GACjB,OAAOokD,GAAGxpC,QAAQle,KAAKg7D,GAAG5rD,IAAI9L,IAElCmkE,mBAAmBr7D,EAAG9I,GAElB,IAAIoV,EACJ,OAAO1Y,KAAKg7D,GAAG39C,IAAI/Z,EAAEif,GAAI,CACrBA,IAAK7J,EAAIpV,GAAGif,GACZlR,QAASqH,EAAErH,QACX8kD,WAAY4J,GAAGrnD,EAAEy9C,cACjBzO,GAAGxpC,UAEXwpD,cAAct7D,EAAG9I,GACb,OAAOokD,GAAGxpC,QAAQle,KAAKi7D,GAAG7rD,IAAI9L,IAElCukE,eAAez7D,EAAG9I,GACd,OAAOtD,KAAKi7D,GAAG59C,IAAI/Z,EAAE0C,KAAM,SAASoG,GAChC,MAAO,CACHpG,KAAMoG,EAAEpG,KACR03B,MAAOupC,GAAG76D,EAAEw7D,cACZ7gB,SAAUgZ,GAAG3zD,EAAE26C,WAJI,CAMzBzjD,IAAKokD,GAAGxpC,WAsBd,MAAMw1D,GACN/tE,cAGI3F,KAAK2zE,SAAW,IAAI7gB,GAAGzN,GAAGlB,YAAankD,KAAKs7D,GAAK,IAAIlmC,IAEzD4yC,WAAW57D,EAAG9I,GACV,OAAOokD,GAAGxpC,QAAQle,KAAK2zE,SAASvkE,IAAI9L,IAExC4kE,YAAY97D,EAAG9I,GACX,MAAMoV,EAAIokD,KACV,OAAOpV,GAAGxxC,QAAQ5S,GAAIA,GAAKtD,KAAKgoE,WAAW57D,EAAG9I,GAAGkZ,MAAMpQ,IACnD,OAASA,GAAKsM,EAAE2E,IAAI/Z,EAAG8I,QACrBoQ,UAAY9D,IAEtByvD,aAAa/7D,EAAG9I,EAAGoV,GACf,OAAOA,EAAExC,UAAUwC,EAAGjO,KAClBzK,KAAKyvD,GAAGrjD,EAAG9I,EAAGmH,MACbi9C,GAAGxpC,UAEZkqD,yBAAyBh8D,EAAG9I,EAAGoV,GAC3B,MAAMjO,EAAIzK,KAAKs7D,GAAGlsD,IAAIsJ,GACtB,YAAO,IAAWjO,IAAMA,EAAEyL,SAAS9J,GAAKpM,KAAK2zE,SAAW3zE,KAAK2zE,SAASx3D,OAAO/P,KAC7EpM,KAAKs7D,GAAG38B,OAAOjmB,IAAKgvC,GAAGxpC,UAE3BqqD,yBAAyBn8D,EAAG9I,EAAGoV,GAC3B,MAAMjO,EAAIqyD,KAAMz9D,EAAIiE,EAAEhE,OAAS,EAAGoiD,EAAI,IAAI2D,GAAG/hD,EAAE8gD,MAAM,KAAM3C,EAAIzhD,KAAK2zE,SAAShgB,gBAAgBjS,GAC7F,KAAMD,EAAEyS,WAAa,CACjB,MAAM9nD,EAAIq1C,EAAEuS,UAAUltD,MAAO46C,EAAIt1C,EAAEw5D,SACnC,IAAKtiE,EAAEshD,WAAWlD,EAAErkB,MAAO,MAEfqkB,EAAErkB,KAAK/9B,SAAWD,GAAM+M,EAAE66C,eAAiBvuC,GAAKjO,EAAE4S,IAAIjR,EAAEw5D,SAAUx5D,GAElF,OAAOs7C,GAAGxpC,QAAQzT,GAEtBg+D,8BAA8Br8D,EAAG9I,EAAGoV,EAAGjO,GACnC,IAAIpL,EAAI,IAAIyzD,IAAI,CAAC1mD,EAAG9I,IAAM8I,EAAI9I,IAC9B,MAAMo+C,EAAI1hD,KAAK2zE,SAASlgB,cACxB,KAAM/R,EAAEwS,WAAa,CACjB,MAAM9nD,EAAIs1C,EAAEsS,UAAUltD,MACtB,GAAIsF,EAAEw5D,SAASlgB,uBAAyBpiD,GAAK8I,EAAE66C,eAAiBvuC,EAAG,CAC/D,IAAIpV,EAAIjE,EAAE+P,IAAIhD,EAAE66C,gBAChB,OAAS3jD,IAAMA,EAAIw5D,KAAMz9D,EAAIA,EAAE6zD,OAAO9mD,EAAE66C,eAAgB3jD,IAAKA,EAAE+Z,IAAIjR,EAAEw5D,SAAUx5D,IAGvF,MAAMq1C,EAAIqb,KAAM76D,EAAI5C,EAAEo0D,cACtB,KAAMxxD,EAAEiyD,YACAjyD,EAAE+xD,UAAUltD,MAAMoP,SAAS,CAAC9J,EAAG9I,IAAMm+C,EAAEpkC,IAAIjR,EAAG9I,OAAMm+C,EAAE/8B,QAAUja,MAExE,OAAOi9C,GAAGxpC,QAAQujC,GAEtBgO,GAAGrjD,EAAG9I,EAAGoV,GAEL,MAAMjO,EAAIzK,KAAK2zE,SAASvkE,IAAIsJ,EAAE7R,KAC9B,GAAI,OAAS4D,EAAG,CACZ,MAAM2B,EAAIpM,KAAKs7D,GAAGlsD,IAAI3E,EAAEw8C,gBAAgBtoB,OAAOjmB,EAAE7R,KACjD7G,KAAKs7D,GAAGj+C,IAAI5S,EAAEw8C,eAAgB76C,GAElCpM,KAAK2zE,SAAW3zE,KAAK2zE,SAASzgB,OAAOx6C,EAAE7R,IAAK,IAAI6+D,GAAGpiE,EAAGoV,IAEtD,IAAIrZ,EAAIW,KAAKs7D,GAAGlsD,IAAI9L,QACpB,IAAWjE,IAAMA,EAAI89D,KAAMn9D,KAAKs7D,GAAGj+C,IAAI/Z,EAAGjE,IAAKW,KAAKs7D,GAAGj+C,IAAI/Z,EAAGjE,EAAEqY,IAAIgB,EAAE7R,OAkC1E,MAAM+sE,GACNjuE,cAEI3F,KAAKm7D,GAAK,IAAIlG,GAAG4e,GAAGrY,IAEpBx7D,KAAK87D,GAAK,IAAI7G,GAAG4e,GAAG9X,IAE4CpX,UAChE,OAAO3kD,KAAKm7D,GAAGxW,UAEoD4qB,aAAanjE,EAAG9I,GACnF,MAAMoV,EAAI,IAAIm7D,GAAGznE,EAAG9I,GACpBtD,KAAKm7D,GAAKn7D,KAAKm7D,GAAGzjD,IAAIgB,GAAI1Y,KAAK87D,GAAK97D,KAAK87D,GAAGpkD,IAAIgB,GAEkBsjD,GAAG5vD,EAAG9I,GACxE8I,EAAE8J,SAAS9J,GAAKpM,KAAKuvE,aAAanjE,EAAG9I,KAKlCmsE,gBAAgBrjE,EAAG9I,GACtBtD,KAAKi8D,GAAG,IAAI4X,GAAGznE,EAAG9I,IAEtB64D,GAAG/vD,EAAG9I,GACF8I,EAAE8J,SAAS9J,GAAKpM,KAAKyvE,gBAAgBrjE,EAAG9I,KAKrC84D,GAAGhwD,GACN,MAAM9I,EAAI,IAAI+hD,GAAG,IAAIP,GAAG,KAAMpsC,EAAI,IAAIm7D,GAAGvwE,EAAG8I,GAAI3B,EAAI,IAAIopE,GAAGvwE,EAAG8I,EAAI,GAAI/M,EAAI,GAC1E,OAAOW,KAAK87D,GAAG1G,eAAe,CAAE18C,EAAGjO,IAAM2B,IACrCpM,KAAKi8D,GAAG7vD,GAAI/M,EAAEiC,KAAK8K,EAAEvF,QACpBxH,EAETo9D,KACIz8D,KAAKm7D,GAAGjlD,SAAS9J,GAAKpM,KAAKi8D,GAAG7vD,KAElC6vD,GAAG7vD,GACCpM,KAAKm7D,GAAKn7D,KAAKm7D,GAAGx8B,OAAOvyB,GAAIpM,KAAK87D,GAAK97D,KAAK87D,GAAGn9B,OAAOvyB,GAE1DswD,GAAGtwD,GACC,MAAM9I,EAAI,IAAI+hD,GAAG,IAAIP,GAAG,KAAMpsC,EAAI,IAAIm7D,GAAGvwE,EAAG8I,GAAI3B,EAAI,IAAIopE,GAAGvwE,EAAG8I,EAAI,GAClE,IAAI/M,EAAI89D,KACR,OAAOn9D,KAAK87D,GAAG1G,eAAe,CAAE18C,EAAGjO,IAAM2B,IACrC/M,EAAIA,EAAEqY,IAAItL,EAAEvF,QACXxH,EAETogC,YAAYrzB,GACR,MAAM9I,EAAI,IAAIuwE,GAAGznE,EAAG,GAAIsM,EAAI1Y,KAAKm7D,GAAG7F,kBAAkBhyD,GACtD,OAAO,OAASoV,GAAKtM,EAAE0yC,QAAQpmC,EAAE7R,MAIzC,MAAMgtE,GACFluE,YAAYyG,EAAG9I,GACXtD,KAAK6G,IAAMuF,EAAGpM,KAAK28D,GAAKr5D,EAEQq/C,UAAUv2C,EAAG9I,GAC7C,OAAO+hD,GAAGlB,WAAW/3C,EAAEvF,IAAKvD,EAAEuD,MAAQ+7C,GAAEx2C,EAAEuwD,GAAIr5D,EAAEq5D,IAEhBha,UAAUv2C,EAAG9I,GAC7C,OAAOs/C,GAAEx2C,EAAEuwD,GAAIr5D,EAAEq5D,KAAOtX,GAAGlB,WAAW/3C,EAAEvF,IAAKvD,EAAEuD,MAmBnD,MAAMitE,GACNnuE,YAAYyG,EAAG9I,GACXtD,KAAK6qD,aAAez+C,EAAGpM,KAAK6sE,kBAAoBvpE,EAKhDtD,KAAK2yE,cAAgB,GAErB3yE,KAAK48D,GAAK,EAEV58D,KAAK88D,GAAK,IAAI7H,GAAG4e,GAAGrY,IAExBsR,WAAW1gE,GACP,OAAOs7C,GAAGxpC,QAAQ,IAAMle,KAAK2yE,cAAcrzE,QAE/C2tE,iBAAiB7gE,EAAG9I,EAAGoV,EAAGjO,GACtB,MAAMpL,EAAIW,KAAK48D,GACf58D,KAAK48D,KAAM58D,KAAK2yE,cAAcrzE,OAAS,GAAKU,KAAK2yE,cAAc3yE,KAAK2yE,cAAcrzE,OAAS,GAC3F,MAAMoiD,EAAI,IAAImjB,GAAGxlE,EAAGiE,EAAGoV,EAAGjO,GAC1BzK,KAAK2yE,cAAcrxE,KAAKogD,GAExB,IAAK,MAAMp+C,KAAKmH,EAAGzK,KAAK88D,GAAK98D,KAAK88D,GAAGplD,IAAI,IAAIm8D,GAAGvwE,EAAEuD,IAAKxH,IAAKW,KAAK6qD,aAAa2f,2BAA2Bp+D,EAAG9I,EAAEuD,IAAIw2B,KAAKmnB,WACvH,OAAOkD,GAAGxpC,QAAQwjC,GAEtByrB,oBAAoB/gE,EAAG9I,GACnB,OAAOokD,GAAGxpC,QAAQle,KAAKg9D,GAAG15D,IAE9B8pE,iCAAiChhE,EAAG9I,GAChC,MAAMoV,EAAIpV,EAAI,EAAGmH,EAAIzK,KAAK+8D,GAAGrkD,GAAIrZ,EAAIoL,EAAI,EAAI,EAAIA,EAGzC,OAAOi9C,GAAGxpC,QAAQle,KAAK2yE,cAAcrzE,OAASD,EAAIW,KAAK2yE,cAActzE,GAAK,MAEtFiuE,kCACI,OAAO5lB,GAAGxpC,QAAQ,IAAMle,KAAK2yE,cAAcrzE,QAAU,EAAIU,KAAK48D,GAAK,GAEvE2Q,sBAAsBnhE,GAClB,OAAOs7C,GAAGxpC,QAAQle,KAAK2yE,cAAclnE,SAEzC+hE,0CAA0CphE,EAAG9I,GACzC,MAAMoV,EAAI,IAAIm7D,GAAGvwE,EAAG,GAAImH,EAAI,IAAIopE,GAAGvwE,EAAGuc,OAAO2oD,mBAAoBnpE,EAAI,GACrE,OAAOW,KAAK88D,GAAG1H,eAAe,CAAE18C,EAAGjO,IAAM2B,IACrC,MAAM9I,EAAItD,KAAKg9D,GAAG5wD,EAAEuwD,IACpBt9D,EAAEiC,KAAKgC,MACNokD,GAAGxpC,QAAQ7e,GAEpBouE,2CAA2CrhE,EAAG9I,GAC1C,IAAIoV,EAAI,IAAIu8C,GAAGrS,IACf,OAAOt/C,EAAE4S,SAAS9J,IACd,MAAM9I,EAAI,IAAIuwE,GAAGznE,EAAG,GAAI3B,EAAI,IAAIopE,GAAGznE,EAAGyT,OAAO2oD,mBAC7CxoE,KAAK88D,GAAG1H,eAAe,CAAE9xD,EAAGmH,IAAM2B,IAC9BsM,EAAIA,EAAEhB,IAAItL,EAAEuwD,UAEfjV,GAAGxpC,QAAQle,KAAKi9D,GAAGvkD,IAE5Bg1D,oCAAoCthE,EAAG9I,GAGnC,MAAMoV,EAAIpV,EAAE+5B,KAAM5yB,EAAIiO,EAAEpZ,OAAS,EAKjC,IAAID,EAAIqZ,EACR2sC,GAAGsS,cAAct4D,KAAOA,EAAIA,EAAE+kD,MAAM,KACpC,MAAM1C,EAAI,IAAImyB,GAAG,IAAIxuB,GAAGhmD,GAAI,GAGpB,IAAIoiD,EAAI,IAAIwT,GAAGrS,IACvB,OAAO5iD,KAAK88D,GAAGzH,cAAcjpD,IACzB,MAAM9I,EAAI8I,EAAEvF,IAAIw2B,KAChB,QAAS3kB,EAAEksC,WAAWthD,KAMtBA,EAAEhE,SAAWmL,IAAMg3C,EAAIA,EAAE/pC,IAAItL,EAAEuwD,MAAM,KACrCjb,GAAIgG,GAAGxpC,QAAQle,KAAKi9D,GAAGxb,IAE/Bwb,GAAG7wD,GAGC,MAAM9I,EAAI,GACV,OAAO8I,EAAE8J,SAAS9J,IACd,MAAMsM,EAAI1Y,KAAKg9D,GAAG5wD,GAClB,OAASsM,GAAKpV,EAAEhC,KAAKoX,MACpBpV,EAETqqE,oBAAoBvhE,EAAG9I,GACnBi3B,GAAE,IAAMv6B,KAAKk9D,GAAG55D,EAAE+nD,QAAS,YAAarrD,KAAK2yE,cAAcllE,QAC3D,IAAIiL,EAAI1Y,KAAK88D,GACb,OAAOpV,GAAGxxC,QAAQ5S,EAAE0hE,WAAYv6D,IAC5B,MAAMpL,EAAI,IAAIw0E,GAAGppE,EAAE5D,IAAKvD,EAAE+nD,SAC1B,OAAO3yC,EAAIA,EAAEimB,OAAOt/B,GAAIW,KAAK6sE,kBAAkBe,wBAAwBxhE,EAAG3B,EAAE5D,QAC5E2V,MAAI,KACJxc,KAAK88D,GAAKpkD,KAGlBqgD,GAAG3sD,IAGHqzB,YAAYrzB,EAAG9I,GACX,MAAMoV,EAAI,IAAIm7D,GAAGvwE,EAAG,GAAImH,EAAIzK,KAAK88D,GAAGxH,kBAAkB58C,GACtD,OAAOgvC,GAAGxpC,QAAQ5a,EAAEw7C,QAAQr0C,GAAKA,EAAE5D,MAEvCgnE,wBAAwBzhE,GACpB,OAAOpM,KAAK2yE,cAAcrzE,OAAQooD,GAAGxpC,UASlCg/C,GAAG9wD,EAAG9I,GACT,OAAOtD,KAAK+8D,GAAG3wD,GAUZ2wD,GAAG3wD,GACN,OAAI,IAAMpM,KAAK2yE,cAAcrzE,OAEtB,EAKQ8M,EAAIpM,KAAK2yE,cAAc,GAAGtnB,QAKtC2R,GAAG5wD,GACN,MAAM9I,EAAItD,KAAK+8D,GAAG3wD,GAClB,OAAI9I,EAAI,GAAKA,GAAKtD,KAAK2yE,cAAcrzE,OAAe,KAC7CU,KAAK2yE,cAAcrvE,IAwBlC,MAAMywE,GAMFpuE,YAAYyG,GACRpM,KAAKm9D,GAAK/wD,EAEVpM,KAAKg0E,KAAO,IAAIlhB,GAAGzN,GAAGlB,YAEtBnkD,KAAK0kB,KAAO,EAEhB8sD,gBAAgBplE,GACZpM,KAAK6qD,aAAez+C,EAOjB8kE,SAAS9kE,EAAG9I,GACf,MAAMoV,EAAIpV,EAAEuD,IAAK4D,EAAIzK,KAAKg0E,KAAK5kE,IAAIsJ,GAAIrZ,EAAIoL,EAAIA,EAAEia,KAAO,EAAGg9B,EAAI1hD,KAAKm9D,GAAG75D,GACvE,OAAOtD,KAAKg0E,KAAOh0E,KAAKg0E,KAAK9gB,OAAOx6C,EAAG,CACnCvV,SAAUG,EAAE4zD,cACZxyC,KAAMg9B,IACN1hD,KAAK0kB,MAAQg9B,EAAIriD,EAAGW,KAAK6qD,aAAa2f,2BAA2Bp+D,EAAGsM,EAAE2kB,KAAKmnB,WAO5EqsB,YAAYzkE,GACf,MAAM9I,EAAItD,KAAKg0E,KAAK5kE,IAAIhD,GACxB9I,IAAMtD,KAAKg0E,KAAOh0E,KAAKg0E,KAAK73D,OAAO/P,GAAIpM,KAAK0kB,MAAQphB,EAAEohB,MAE1DksD,SAASxkE,EAAG9I,GACR,MAAMoV,EAAI1Y,KAAKg0E,KAAK5kE,IAAI9L,GACxB,OAAOokD,GAAGxpC,QAAQxF,EAAIA,EAAEvV,SAAS+zD,cAAgBjB,GAAGmb,mBAAmB9tE,IAE3EonE,WAAWt+D,EAAG9I,GACV,IAAIoV,EAAIgkD,KACR,OAAOp5D,EAAE4S,SAAS9J,IACd,MAAM9I,EAAItD,KAAKg0E,KAAK5kE,IAAIhD,GACxBsM,EAAIA,EAAEw6C,OAAO9mD,EAAG9I,EAAIA,EAAEH,SAAS+zD,cAAgBjB,GAAGmb,mBAAmBhlE,OACpEs7C,GAAGxpC,QAAQxF,GAEpBq5D,qBAAqB3lE,EAAG9I,EAAGoV,GACvB,IAAIjO,EAAIiyD,KAGA,MAAMr9D,EAAI,IAAIgmD,GAAG/hD,EAAE8gD,MAAM,KAAM1C,EAAI1hD,KAAKg0E,KAAKrgB,gBAAgBt0D,GACrE,KAAMqiD,EAAEwS,WAAa,CACjB,MAAOrtD,IAAKuF,EAAGtF,OAAQ3D,SAAU9D,IAAMqiD,EAAEsS,UACzC,IAAK1wD,EAAEshD,WAAWx4C,EAAEixB,MAAO,MAC3BjxB,EAAEixB,KAAK/9B,OAASgE,EAAEhE,OAAS,GAAM4nD,GAAGJ,GAAGznD,GAAIqZ,IAAM,IAAMjO,EAAIA,EAAEyoD,OAAO7zD,EAAEwH,IAAKxH,EAAE63D,gBAEjF,OAAOxP,GAAGxpC,QAAQzT,GAEtBunE,0BAA0B5lE,EAAG9I,EAAGoV,EAAGjO,GAG/B2hC,KAEJgxB,GAAGhxD,EAAG9I,GACF,OAAOokD,GAAGxxC,QAAQlW,KAAKg0E,MAAO5nE,GAAK9I,EAAE8I,KAEzCukE,gBAAgBvkE,GAGZ,OAAO,IAAI6nE,GAAGj0E,MAElB+wE,QAAQ3kE,GACJ,OAAOs7C,GAAGxpC,QAAQle,KAAK0kB,OAc/B,MAAMuvD,WAAWjD,GACbrrE,YAAYyG,GACRrG,QAAS/F,KAAK07D,GAAKtvD,EAEvB2pD,aAAa3pD,GACT,MAAM9I,EAAI,GACV,OAAOtD,KAAKkrD,QAAQh1C,SAAO,CAAGwC,EAAGjO,KAC7BA,EAAEqsD,kBAAoBxzD,EAAEhC,KAAKtB,KAAK07D,GAAGwV,SAAS9kE,EAAG3B,IAAMzK,KAAK07D,GAAGmV,YAAYn4D,MAC1EgvC,GAAGS,QAAQ7kD,GAEpB+tE,aAAajlE,EAAG9I,GACZ,OAAOtD,KAAK07D,GAAGkV,SAASxkE,EAAG9I,GAE/BguE,gBAAgBllE,EAAG9I,GACf,OAAOtD,KAAK07D,GAAGgP,WAAWt+D,EAAG9I,IAmBjC,MAAM4wE,GACNvuE,YAAYyG,GACRpM,KAAK0qD,YAAct+C,EAInBpM,KAAKq9D,GAAK,IAAIjB,IAAIhwD,GAAKorD,GAAGprD,IAAKqrD,IAE/Bz3D,KAAKuuE,0BAA4B5qB,GAAGnS,MAEpCxxC,KAAKquE,gBAAkB,EAEvBruE,KAAKs9D,GAAK,EAKVt9D,KAAK49D,GAAK,IAAIgW,GAAI5zE,KAAK4uE,YAAc,EAAG5uE,KAAKm+D,GAAK+P,GAAGhV,KAEzD4F,cAAc1yD,EAAG9I,GACb,OAAOtD,KAAKq9D,GAAGnnD,SAAO,CAAG9J,EAAGsM,IAAMpV,EAAEoV,KAAMgvC,GAAGxpC,UAEjDowD,6BAA6BliE,GACzB,OAAOs7C,GAAGxpC,QAAQle,KAAKuuE,2BAE3BC,yBAAyBpiE,GACrB,OAAOs7C,GAAGxpC,QAAQle,KAAKs9D,IAE3B8Q,iBAAiBhiE,GACb,OAAOpM,KAAKquE,gBAAkBruE,KAAKm+D,GAAG3hD,OAAQkrC,GAAGxpC,QAAQle,KAAKquE,iBAElEK,mBAAmBtiE,EAAG9I,EAAGoV,GACrB,OAAOA,IAAM1Y,KAAKuuE,0BAA4B71D,GAAIpV,EAAItD,KAAKs9D,KAAOt9D,KAAKs9D,GAAKh6D,GAC5EokD,GAAGxpC,UAEPo7C,GAAGltD,GACCpM,KAAKq9D,GAAGhgD,IAAIjR,EAAEsC,OAAQtC,GACtB,MAAM9I,EAAI8I,EAAEkyD,SACZh7D,EAAItD,KAAKquE,kBAAoBruE,KAAKm+D,GAAK,IAAI+P,GAAG5qE,GAAItD,KAAKquE,gBAAkB/qE,GAAI8I,EAAEq6C,eAAiBzmD,KAAKs9D,KAAOt9D,KAAKs9D,GAAKlxD,EAAEq6C,gBAE5HkoB,cAAcviE,EAAG9I,GACb,OAAOtD,KAAKs5D,GAAGh2D,GAAItD,KAAK4uE,aAAe,EAAGlnB,GAAGxpC,UAEjD2wD,iBAAiBziE,EAAG9I,GAChB,OAAOtD,KAAKs5D,GAAGh2D,GAAIokD,GAAGxpC,UAE1B4wD,iBAAiB1iE,EAAG9I,GAChB,OAAOtD,KAAKq9D,GAAG1+B,OAAOr7B,EAAEoL,QAAS1O,KAAK49D,GAAGxB,GAAG94D,EAAEg7D,UAAWt+D,KAAK4uE,aAAe,EAC7ElnB,GAAGxpC,UAEP+wD,cAAc7iE,EAAG9I,EAAGoV,GAChB,IAAIjO,EAAI,EACR,MAAMpL,EAAI,GACV,OAAOW,KAAKq9D,GAAGnnD,SAAO,CAAGwrC,EAAGD,KACxBA,EAAEgF,gBAAkBnjD,GAAK,OAASoV,EAAEtJ,IAAIqyC,EAAE6c,YAAct+D,KAAKq9D,GAAG1+B,OAAO+iB,GAAIriD,EAAEiC,KAAKtB,KAAK+uE,8BAA8B3iE,EAAGq1C,EAAE6c,WAC1H7zD,QACCi9C,GAAGS,QAAQ9oD,GAAGmd,MAAI,IAAQ/R,IAEnC0kE,eAAe/iE,GACX,OAAOs7C,GAAGxpC,QAAQle,KAAK4uE,aAE3BQ,cAAchjE,EAAG9I,GACb,MAAMoV,EAAI1Y,KAAKq9D,GAAGjuD,IAAI9L,IAAM,KAC5B,OAAOokD,GAAGxpC,QAAQxF,GAEtB22D,gBAAgBjjE,EAAG9I,EAAGoV,GAClB,OAAO1Y,KAAK49D,GAAG5B,GAAG14D,EAAGoV,GAAIgvC,GAAGxpC,UAEhCsxD,mBAAmBpjE,EAAG9I,EAAGoV,GACrB1Y,KAAK49D,GAAGzB,GAAG74D,EAAGoV,GACd,MAAMjO,EAAIzK,KAAK0qD,YAAYmiB,kBAAmBxtE,EAAI,GAClD,OAAOoL,GAAKnH,EAAE4S,SAAS5S,IACnBjE,EAAEiC,KAAKmJ,EAAEmjE,wBAAwBxhE,EAAG9I,OACnCokD,GAAGS,QAAQ9oD,GAEpB0vE,8BAA8B3iE,EAAG9I,GAC7B,OAAOtD,KAAK49D,GAAGxB,GAAG94D,GAAIokD,GAAGxpC,UAE7BwxD,2BAA2BtjE,EAAG9I,GAC1B,MAAMoV,EAAI1Y,KAAK49D,GAAGlB,GAAGp5D,GACrB,OAAOokD,GAAGxpC,QAAQxF,GAEtB+mB,YAAYrzB,EAAG9I,GACX,OAAOokD,GAAGxpC,QAAQle,KAAK49D,GAAGn+B,YAAYn8B,KAwB9C,MAAM6wE,GAOFxuE,YAAYyG,EAAG9I,GACXtD,KAAKq+D,GAAK,GAAIr+D,KAAK2zE,SAAW,GAAI3zE,KAAKu+D,GAAK,IAAIjT,GAAG,GAAItrD,KAAK0+D,IAAK,EAAI1+D,KAAK0+D,IAAK,EAC/E1+D,KAAK6sE,kBAAoBzgE,EAAEpM,MAAOA,KAAK4+D,GAAK,IAAIsV,GAAGl0E,MACnDA,KAAK6qD,aAAe,IAAIyf,GAAItqE,KAAK0yE,oBAAsB,SAAStmE,GAC5D,OAAO,IAAI2nE,GAAG3nE,GADqC,EAEpDA,GAAKpM,KAAK6sE,kBAAkBhO,GAAGzyD,KAAMpM,KAAK0mD,GAAK,IAAIwf,GAAG5iE,GAAItD,KAAK2+D,GAAK,IAAI8U,GAAGzzE,KAAK0mD,IAEvF3lC,QACI,OAAO9C,QAAQC,UAEnBgjC,WAEI,OAAOlhD,KAAK0+D,IAAK,EAAIzgD,QAAQC,UAE7BosC,cACA,OAAOtqD,KAAK0+D,GAEhB0V,8BAGAC,qBAGAC,gBAAgBloE,GAGZ,OAAOpM,KAAK6qD,aAEhB0pB,wBAAwBnoE,GACpB,IAAI9I,EAAItD,KAAK2zE,SAASvnE,EAAEyyC,SACxB,OAAOv7C,IAAMA,EAAI,IAAIowE,GAAI1zE,KAAK2zE,SAASvnE,EAAEyyC,SAAWv7C,GAAIA,EAE5DkxE,iBAAiBpoE,EAAG9I,GAChB,IAAIoV,EAAI1Y,KAAKq+D,GAAGjyD,EAAEyyC,SAClB,OAAOnmC,IAAMA,EAAI,IAAIo7D,GAAGxwE,EAAGtD,KAAK6sE,mBAAoB7sE,KAAKq+D,GAAGjyD,EAAEyyC,SAAWnmC,GAAIA,EAEjF83D,iBACI,OAAOxwE,KAAK4+D,GAEhB8R,yBACI,OAAO1wE,KAAK0yE,oBAEhB+B,iBACI,OAAOz0E,KAAK2+D,GAEhBhU,eAAev+C,EAAG9I,EAAGoV,GACjBmC,GAAE,oBAAqB,wBAAyBzO,GAChD,MAAM3B,EAAI,IAAIiqE,GAAG10E,KAAKu+D,GAAG/hD,QACzB,OAAOxc,KAAK6sE,kBAAkB1N,KAAMzmD,EAAEjO,GAAG+R,MAAMpQ,GAAKpM,KAAK6sE,kBAAkBvN,GAAG70D,GAAG+R,UAAYpQ,MAAM67C,YAAY9pC,MAAM/R,IAAM3B,EAAE88C,wBAC7Hn7C,KAEJozD,GAAGpzD,EAAG9I,GACF,OAAOokD,GAAGgY,GAAGv6D,OAAOsmB,OAAOzrB,KAAKq+D,IAAIvsB,KAAKp5B,GAAK,IAAMA,EAAE+mB,YAAYrzB,EAAG9I,OAOzE,MAAMoxE,WAAWttB,GACjBzhD,YAAYyG,GACRrG,QAAS/F,KAAK2kE,sBAAwBv4D,GAI9C,MAAMuoE,GACFhvE,YAAYyG,GACRpM,KAAK0qD,YAAct+C,EAEnBpM,KAAK2/D,GAAK,IAAIiU,GAEd5zE,KAAK4/D,GAAK,KAEdjd,UAAUv2C,GACN,OAAO,IAAIuoE,GAAGvoE,GAEd0zD,SACA,GAAI9/D,KAAK4/D,GAAI,OAAO5/D,KAAK4/D,GACzB,MAAMxzB,KAEVmjC,aAAanjE,EAAG9I,EAAGoV,GACf,OAAO1Y,KAAK2/D,GAAG4P,aAAa72D,EAAGpV,GAAItD,KAAK8/D,GAAGnhC,OAAOjmB,EAAErT,YAAaqiD,GAAGxpC,UAExEuxD,gBAAgBrjE,EAAG9I,EAAGoV,GAClB,OAAO1Y,KAAK2/D,GAAG8P,gBAAgB/2D,EAAGpV,GAAItD,KAAK8/D,GAAGpoD,IAAIgB,EAAErT,YAAaqiD,GAAGxpC,UAExE0vD,wBAAwBxhE,EAAG9I,GACvB,OAAOtD,KAAK8/D,GAAGpoD,IAAIpU,EAAE+B,YAAaqiD,GAAGxpC,UAEzC6gD,aAAa3yD,EAAG9I,GACZtD,KAAK2/D,GAAGvD,GAAG94D,EAAEg7D,UAAUpoD,SAAS9J,GAAKpM,KAAK8/D,GAAGpoD,IAAItL,EAAE/G,cACnD,MAAMqT,EAAI1Y,KAAK0qD,YAAY8lB,iBAC3B,OAAO93D,EAAEg3D,2BAA2BtjE,EAAG9I,EAAEg7D,UAAU9hD,MAAMpQ,IACrDA,EAAE8J,SAAS9J,GAAKpM,KAAK8/D,GAAGpoD,IAAItL,EAAE/G,iBAC9BmX,MAAI,IAAQ9D,EAAEo2D,iBAAiB1iE,EAAG9I,KAE1C67D,KACIn/D,KAAK4/D,GAAK,IAAIxsC,IAElBksC,GAAGlzD,GAEC,MAAM9I,EAAItD,KAAK0qD,YAAYgmB,yBAAyBC,kBACpD,OAAOjpB,GAAGxxC,QAAQlW,KAAK8/D,IAAKpnD,IACxB,MAAMjO,EAAI46C,GAAGuvB,SAASl8D,GACtB,OAAO1Y,KAAK+/D,GAAG3zD,EAAG3B,GAAG+R,MAAMpQ,IACvBA,GAAK9I,EAAEutE,YAAYpmE,EAAGk5C,GAAGnS,aAE7Bh1B,WAAaxc,KAAK4/D,GAAK,KAAMt8D,EAAE6H,MAAMiB,MAE7C0kE,oBAAoB1kE,EAAG9I,GACnB,OAAOtD,KAAK+/D,GAAG3zD,EAAG9I,GAAGkZ,MAAMpQ,IACvBA,EAAIpM,KAAK8/D,GAAGnhC,OAAOr7B,EAAE+B,YAAcrF,KAAK8/D,GAAGpoD,IAAIpU,EAAE+B,eAGzDw5D,GAAGzyD,GAEC,OAAO,EAEX2zD,GAAG3zD,EAAG9I,GACF,OAAOokD,GAAGgY,GAAG,CAAE,IAAMhY,GAAGxpC,QAAQle,KAAK2/D,GAAGlgC,YAAYn8B,IAAK,IAAMtD,KAAK0qD,YAAY8lB,iBAAiB/wC,YAAYrzB,EAAG9I,GAAI,IAAMtD,KAAK0qD,YAAY8U,GAAGpzD,EAAG9I,MAoBlG,MAAMuxE,GACzDlvE,YAAYyG,GACRpM,KAAK0mD,GAAKt6C,EAQPwzC,EAAExzC,EAAG9I,EAAGoV,EAAGjO,GACd,MAAMpL,EAAI,IAAI+oD,GAAG,kBAAmB9kD,GACpCoV,EAAI,GAAKjO,GAAK,IAAM,SAAS2B,GACzBA,EAAE0oE,kBAAkB,SADJ,CAElB1oE,GAAI,SAASA,GACXA,EAAE0oE,kBAAkB,iBAAkB,CAClCC,QAAS,WAEb3oE,EAAE0oE,kBAAkB,YAAa,CAC7BC,QAAS,UACTC,eAAe,IAChBC,YAAY,qBAAsB9R,GAAI,CACrC+R,QAAQ,IACR9oE,EAAE0oE,kBAAkB,qBATtB,CAcT1oE,GAAI+oE,GAAG/oE,GAAI,SAASA,GACbA,EAAE0oE,kBAAkB,mBADhB,CAEN1oE,IAGM,IAAIs1C,EAAIgG,GAAGxpC,UACnB,OAAOxF,EAAI,GAAKjO,GAAK,IAGrB,IAAMiO,IAAO,SAAStM,GAClBA,EAAEgpE,kBAAkB,mBAAoBhpE,EAAEgpE,kBAAkB,WAAYhpE,EAAEgpE,kBAAkB,gBADnF,CAEXhpE,GAAI+oE,GAAG/oE,IAAKs1C,EAAIA,EAAEllC,MAAM,IAM1B,SAASpQ,GACL,MAAM9I,EAAI8I,EAAEw8C,MAAM,gBAAiBlwC,EAAI,CACnC21D,gBAAiB,EACjBI,4BAA6B,EAC7BF,0BAA2B5qB,GAAGnS,MAAMuS,cACpC6qB,YAAa,GAEjB,OAAOtrE,EAAEob,IAAI,kBAAmBhG,GAPpC,CAQErZ,MAAOqZ,EAAI,GAAKjO,GAAK,IAAM,IAAMiO,IAOnCgpC,EAAIA,EAAEllC,MAAM,IAAM,SAASpQ,EAAG9I,GAC1B,OAAOA,EAAEslD,MAAM,aAAalgB,IAAIlsB,MAAM9D,IAClCtM,EAAEgpE,kBAAkB,aACpBhpE,EAAE0oE,kBAAkB,YAAa,CAC7BC,QAAS,UACTC,eAAe,IAChBC,YAAY,qBAAsB9R,GAAI,CACrC+R,QAAQ,IAEZ,MAAMzqE,EAAInH,EAAEslD,MAAM,aAAcvpD,EAAIqZ,EAAEo5B,KAAK1lC,GAAK3B,EAAEiU,IAAItS,KACtD,OAAOs7C,GAAGS,QAAQ9oD,MAVR,CAYhB+M,EAAG/M,MAAOqiD,EAAIA,EAAEllC,YACb,SAASpQ,GACNA,EAAE0oE,kBAAkB,iBAAkB,CAClCC,QAAS,aAFhB,CAIC3oE,OACAsM,EAAI,GAAKjO,GAAK,IAAMi3C,EAAIA,EAAEllC,UAAYxc,KAAKggE,GAAG3gE,MAAOqZ,EAAI,GAAKjO,GAAK,IAAMi3C,EAAIA,EAAEllC,WAAa,SAASpQ,GACvGA,EAAE0oE,kBAAkB,wBAD0E,CAEhG1oE,GAAIpM,KAAKigE,GAAG5gE,OAAQqZ,EAAI,GAAKjO,GAAK,IAAMi3C,EAAIA,EAAEllC,MAAI,IAAQxc,KAAKmgE,GAAG9gE,MAAOqZ,EAAI,GAAKjO,GAAK,IAAMi3C,EAAIA,EAAEllC,MAAM,IAAMxc,KAAKogE,GAAGh0D,EAAG/M,MAC5HqZ,EAAI,GAAKjO,GAAK,IAAMi3C,EAAIA,EAAEllC,YAIrB,SAASpQ,GACNA,EAAEipE,iBAAiBC,SAAS,0BAA4BlpE,EAAEgpE,kBAAkB,yBAD/E,CAEChpE,OAGQsM,EAAI,IAAMjO,GAAK,KAAOi3C,EAAIA,EAAEllC,MAAI,IAAQxc,KAAKsgE,GAAGjhE,MAAOqZ,EAAI,IAAMjO,GAAK,KAAOi3C,EAAIA,EAAEllC,YAC5F,SAASpQ,GACNA,EAAE0oE,kBAAkB,UAAW,CAC3BC,QAAS,aAFhB,CAIC3oE,GAAI,SAASA,GACXA,EAAE0oE,kBAAkB,eAAgB,CAChCC,QAAS,SAFX,CAIJ3oE,OACAsM,EAAI,IAAMjO,GAAK,KAAOi3C,EAAIA,EAAEllC,YAC7B,SAASpQ,GACN,MAAM9I,EAAI8I,EAAE0oE,kBAAkB,mBAAoB,CAC9CC,QAAS7Q,KAEb5gE,EAAE2xE,YAAY,6BAA8B9Q,GAAI,CAC5C+Q,QAAQ,IACR5xE,EAAE2xE,YAAY,8BAA+B7Q,GAAI,CACjD8Q,QAAQ,IAPf,CASC9oE,OACAsM,EAAI,IAAMjO,GAAK,KAAOi3C,EAAIA,EAAEllC,UAAY,SAASpQ,GACnD,MAAM9I,EAAI8I,EAAE0oE,kBAAkB,qBAAsB,CAChDC,QAASxR,KAEbjgE,EAAE2xE,YAAY,mBAAoBzR,IAAKlgE,EAAE2xE,YAAY,uBAAwBxR,IAJnC,CAK5Cr3D,KAAKoQ,MAAM,IAAMxc,KAAKugE,GAAGn0D,EAAG/M,KAAKmd,MAAI,IAAQpQ,EAAEgpE,kBAAkB,sBACnE18D,EAAI,IAAMjO,GAAK,KAAOi3C,EAAIA,EAAEllC,MAAM,IAAMxc,KAAKwgE,GAAGp0D,EAAG/M,MAAOqZ,EAAI,IAAMjO,GAAK,KAAOi3C,EAAIA,EAAEllC,UAAY,SAASpQ,GACvGA,EAAE0oE,kBAAkB,qBAAsB,CACtCC,QAAS,UACTC,eAAe,IAChBC,YAAY,uBAAwB,kBAAmB,CACtDC,QAAQ,IAEZ9oE,EAAE0oE,kBAAkB,aAAc,CAC9BC,QAASjR,KACVmR,YAAY,sBAAuBlR,GAAI,CACtCmR,QAAQ,IAEZ9oE,EAAE0oE,kBAAkB,eAAgB,CAChCC,QAAS/Q,KACViR,YAAY,mBAAoBhR,GAAI,CACnCiR,QAAQ,IAfkF,CAiBhG9oE,MAAOs1C,EAEbue,GAAG7zD,GACC,IAAI9I,EAAI,EACR,OAAO8I,EAAEw8C,MAAM,mBAAmBhG,GAAG,CAACx2C,EAAGsM,KACrCpV,GAAKopE,GAAGh0D,MACR8D,MAAI,KACJ,MAAM9D,EAAI,CACNk5D,SAAUtuE,GAEd,OAAO8I,EAAEw8C,MAAM,wBAAwBlqC,IAAI,0BAA2BhG,MAG9EsnD,GAAG5zD,GACC,MAAM9I,EAAI8I,EAAEw8C,MAAM,kBAAmBlwC,EAAItM,EAAEw8C,MAAM,aACjD,OAAOtlD,EAAEolC,IAAIlsB,MAAMlZ,GAAKokD,GAAGxxC,QAAQ5S,GAAIA,IACnC,MAAMmH,EAAI49D,YAAYC,MAAM,CAAEhlE,EAAEykE,QAAS,GAAK,CAAEzkE,EAAEykE,OAAQzkE,EAAE0qE,0BAC5D,OAAOt1D,EAAEgwB,EAAE,qBAAsBj+B,GAAG+R,MAAM9D,GAAKgvC,GAAGxxC,QAAQwC,GAAIA,IAC1D6hB,GAAE7hB,EAAEqvD,SAAWzkE,EAAEykE,QACjB,MAAMt9D,EAAIk8D,GAAG3mE,KAAK0mD,GAAIhuC,GACtB,OAAO+zD,GAAGrgE,EAAG9I,EAAEykE,OAAQt9D,GAAG+R,yBAO/B2jD,GAAG/zD,GACN,MAAM9I,EAAI8I,EAAEw8C,MAAM,mBAAoBlwC,EAAItM,EAAEw8C,MAAM,mBAClD,OAAOx8C,EAAEw8C,MAAM,gBAAgBx5C,IAAI,mBAAmBoN,MAAMpQ,IACxD,MAAM3B,EAAI,GACV,OAAOiO,EAAEkqC,IAAIlqC,EAAGrZ,KACZ,MAAMqiD,EAAI,IAAIoD,GAAGpsC,GAAI+oC,EAAI,SAASr1C,GAC9B,MAAO,CAAE,EAAG22D,GAAG32D,IADM,CAEvBs1C,GACFj3C,EAAEnJ,KAAKgC,EAAE8L,IAAIqyC,GAAGjlC,MAAM9D,GAAKA,EAAIgvC,GAAGxpC,UAAY,CAACxF,GAAKpV,EAAEob,IAAI,CACtD4/C,SAAU,EACVjhC,KAAM0lC,GAAGrqD,GACT+tC,eAAgBr6C,EAAEqiE,8BAHwB,CAI1C/sB,SACJllC,MAAI,IAAQkrC,GAAGS,QAAQ19C,QAGnC21D,GAAGh0D,EAAG9I,GAEF8I,EAAE0oE,kBAAkB,oBAAqB,CACrCC,QAASlR,KAEb,MAAMnrD,EAAIpV,EAAEslD,MAAM,qBAAsBn+C,EAAI,IAAI8/D,GAAIlrE,EAAI+M,IACpD,GAAI3B,EAAEiN,IAAItL,GAAI,CACV,MAAM9I,EAAI8I,EAAEs4C,cAAej6C,EAAI2B,EAAEo4C,UACjC,OAAO9rC,EAAEgG,IAAI,CACTqjD,aAAcz+D,EACdw+D,OAAQiB,GAAGt4D,OAMvB,OAAOnH,EAAEslD,MAAM,mBAAmBhG,EAAE,CAChC/M,GAAG,IACH,CAACzpC,EAAG9I,KACJ,MAAMoV,EAAI,IAAIosC,GAAG14C,GACjB,OAAO/M,EAAEqZ,EAAE8rC,cACXhoC,MAAI,IAAQlZ,EAAEslD,MAAM,qBAAqBhG,EAAE,CAC3C/M,GAAG,IACN,EAAKzpC,EAAG9I,EAAGoV,GAAIjO,KACZ,MAAMi3C,EAAIwhB,GAAG5/D,GACb,OAAOjE,EAAEqiD,EAAE8C,gBAGnB8b,GAAGl0D,GACC,MAAM9I,EAAI8I,EAAEw8C,MAAM,WAClB,OAAOtlD,EAAEs/C,IAAIx2C,EAAGsM,KACZ,MAAMjO,EAAIo8D,GAAGnuD,GAAIrZ,EAAI0nE,GAAG/mE,KAAK0mD,GAAIj8C,GACjC,OAAOnH,EAAEob,IAAIrf,MAGrBkhE,GAAGn0D,EAAG9I,GACF,MAAMoV,EAAIpV,EAAEslD,MAAM,mBAAoBn+C,EAAI,GAC1C,OAAOiO,EAAEkqC,IAAIx2C,EAAGsM,KACZ,MAAMrZ,EAAIiE,EAAEslD,MAAM,sBAAuBlH,GAAKD,EAAI/oC,EAAG+oC,EAAEt+C,SAAW,IAAIkiD,GAAGP,GAAGQ,WAAW7D,EAAEt+C,SAAS6C,MAAMu+C,SAAS,IAAM9C,EAAE8kB,WAAalhB,GAAGkmB,aAAa9pB,EAAE8kB,WAAWlpC,MAAQokB,EAAEglB,gBAAkBphB,GAAGkmB,aAAa9pB,EAAEglB,gBAAgBppC,MAAQ+O,MAAK/O,KAAKxvB,UACnP,IAAI4zC,EAgBD,MAAMx/C,EAAI,CACTmkE,WAAY1kB,EAAEj2C,MAAM,EAAGi2C,EAAEpiD,OAAS,GAClCkmD,gBAAiB9D,EAAEA,EAAEpiD,OAAS,GAC9B+mE,WAAY3kB,EAAEA,EAAEpiD,OAAS,GACzBynD,SAAUruC,EAAEquC,UAAY,CAAE,EAAG,GAC7B0f,gBAAiB/tD,EAAE+tD,gBACnBF,WAAY7tD,EAAE6tD,WACdpjE,SAAUuV,EAAEvV,SACZyzD,wBAAyBl+C,EAAEk+C,uBAE/BnsD,EAAEnJ,KAAKjC,EAAEqf,IAAIzc,OACbua,MAAI,IAAQkrC,GAAGS,QAAQ19C,KAE/B+1D,GAAGp0D,EAAG9I,GACF,MAAMoV,EAAIpV,EAAEslD,MAAM,aAAcn+C,EAAI8nE,GAAGvyE,KAAK0mD,IAAKrnD,EAAI,IAAI80E,GAAGQ,GAAG9U,GAAI7/D,KAAK0mD,GAAG4I,IAC3E,OAAO52C,EAAEgwB,IAAIlsB,MAAMpQ,IACf,MAAMsM,EAAI,IAAI0c,IACd,OAAOhpB,EAAE8J,SAAS9J,IACd,IAAI9I,EACJ,IAAImH,EAAI,QAAUnH,EAAIoV,EAAEtJ,IAAIhD,EAAE27D,eAAY,IAAWzkE,EAAIA,EAAI65D,KAC7DwJ,GAAG3mE,KAAK0mD,GAAIt6C,GAAG/E,OAAO6O,SAAS9J,GAAK3B,EAAIA,EAAEiN,IAAItL,KAAMsM,EAAE2E,IAAIjR,EAAE27D,OAAQt9D,MACnEi9C,GAAGxxC,QAAQwC,GAAC,CAAItM,EAAGsM,KACpB,MAAMgpC,EAAI,IAAI7xB,GAAEnX,GAAI+oC,EAAIqmB,GAAGvY,GAAGvvD,KAAK0mD,GAAIhF,GAAIz/C,EAAI5C,EAAEi1E,gBAAgB5yB,GAAIniD,EAAIqtE,GAAGrd,GAAG7N,EAAG1hD,KAAK0mD,GAAIzkD,EAAG5C,EAAEwtE,mBAChG,OAAO,IAAI4F,GAAGhoE,EAAGlL,EAAGkiD,EAAGx/C,GAAGmxE,0CAA0C,IAAI1O,GAAGphE,EAAGgoD,GAAG1F,IAAKx5C,GAAGoQ,cAMzG,SAAS24D,GAAG/oE,GACRA,EAAE0oE,kBAAkB,kBAAmB,CACnCC,QAASpR,KACVsR,YAAY,uBAAwBrR,GAAI,CACvCsR,QAAQ,IAGZ9oE,EAAE0oE,kBAAkB,UAAW,CAC3BC,QAAS,aACVE,YAAY,oBAAqBvR,GAAI,CACpCwR,QAAQ,IACR9oE,EAAE0oE,kBAAkB,gBAG5B,MAAMS,GAAK,0QAoDX,MAAMC,GACF7vE,YAKAyG,EAAG9I,EAAGoV,EAAGjO,EAAGpL,EAAGqiD,EAAGD,EAAGx/C,EAAG1C,EAKxB2H,EAAGwlB,EAAI,IACH,GAAI1sB,KAAKy1E,wBAA0BrpE,EAAGpM,KAAK6rD,eAAiBvoD,EAAGtD,KAAK01E,SAAWh9D,EAC/E1Y,KAAKqgE,GAAKhhE,EAAGW,KAAK8C,OAAS4+C,EAAG1hD,KAAKmD,SAAWs+C,EAAGzhD,KAAKygE,GAAKlhE,EAAGS,KAAK0gE,GAAKx5D,EAAGlH,KAAK21E,GAAKjpD,EACrF1sB,KAAKu+D,GAAK,KAAMv+D,KAAK0+D,IAAK,EAAI1+D,KAAK41E,WAAY,EAAI51E,KAAK61E,gBAAiB,EAEzE71E,KAAK81E,GAAK,KAAM91E,KAAK+1E,cAAe,EAEpC/1E,KAAK4gE,GAAK,KAEV5gE,KAAKuhE,GAAK,KAEVvhE,KAAKg2E,GAAKn2D,OAAOktD,kBAEjB/sE,KAAK0hE,GAAKt1D,GAAK6R,QAAQC,WAAYs3D,GAAG36D,IAAK,MAAM,IAAI6M,GAAEjN,GAAE+lC,cAAe,sIACxExgD,KAAK6sE,kBAAoB,IAAI0D,GAAGvwE,KAAMyK,GAAIzK,KAAK4hE,GAAKt+D,EAAI,OAAQtD,KAAK0mD,GAAK,IAAIwf,GAAGjkE,GACjFjC,KAAKuiE,GAAK,IAAIxZ,GAAG/oD,KAAK4hE,GAAI5hE,KAAK21E,GAAI,IAAId,GAAG70E,KAAK0mD,KAAM1mD,KAAK4+D,GAAK,IAAIuP,GAAGnuE,KAAK6sE,kBAAmB7sE,KAAK0mD,IACnG1mD,KAAK0yE,oBAAsBH,GAAGvyE,KAAK0mD,IAAK1mD,KAAK2+D,GAAK,IAAI0I,GAAIrnE,KAAK8C,QAAU9C,KAAK8C,OAAOmzE,aAAej2E,KAAKk2E,GAAKl2E,KAAK8C,OAAOmzE,cAAgBj2E,KAAKk2E,GAAK,MACpJ,IAAOhvE,GAAKmJ,GAAE,uBAAwB,qKAMnC0Q,QAIH,OAAO/gB,KAAKwiE,KAAKrkD,WACb,IAAKne,KAAK41E,YAAc51E,KAAKy1E,wBAG7B,MAAM,IAAI/tD,GAAEjN,GAAE4lC,oBAAqBk1B,IACnC,OAAOv1E,KAAKqiE,KAAMriE,KAAK6iE,KAAM7iE,KAAK8iE,KAAM9iE,KAAK2qD,eAAe,iCAAkC,YAAav+C,GAAKpM,KAAK4+D,GAAG4P,yBAAyBpiE,QACjJ+R,MAAM/R,IACNpM,KAAKu+D,GAAK,IAAIjT,GAAGl/C,EAAGpM,KAAKygE,OACzBtiD,MAAI,KACJne,KAAK0+D,IAAK,KACV15B,OAAO54B,IAAMpM,KAAKuiE,IAAMviE,KAAKuiE,GAAGtlB,QAASh/B,QAAQ4iC,OAAOz0C,MAQzD+1D,GAAG/1D,GACN,OAAOpM,KAAK0hE,GAAKla,MAAAA,IACb,GAAIxnD,KAAKsqD,QAAS,OAAOl+C,EAAE9I,IAC5B8I,EAAEpM,KAAK41E,WAOPxB,2BAA2BhoE,GAC9BpM,KAAKuiE,GAAG76C,GAAG,MAAA8/B,IAEP,OAASlkD,EAAE6yE,kBAAoB/pE,OAQhCioE,kBAAkBjoE,GACrBpM,KAAK61E,iBAAmBzpE,IAAMpM,KAAK61E,eAAiBzpE,EAGpDpM,KAAKqgE,GAAG+V,4BACJp2E,KAAKsqD,eAAiBtqD,KAAKwiE,SAQ5BA,KACH,OAAOxiE,KAAK2qD,eAAe,0CAA2C,aAAcv+C,GAAKiqE,GAAGjqE,GAAGsS,IAAI,CAC/Fg3D,SAAU11E,KAAK01E,SACfY,aAActsE,KAAKD,MACnB8rE,eAAgB71E,KAAK61E,eACrBE,aAAc/1E,KAAK+1E,eACpBv5D,MAAI,KACH,GAAIxc,KAAK41E,UAAW,OAAO51E,KAAKyiE,GAAGr2D,GAAGoQ,MAAMpQ,IACxCA,IAAMpM,KAAK41E,WAAY,EAAI51E,KAAKqgE,GAAGpf,kBAAgB,IAAQjhD,KAAK0hE,IAAG,YAEvEllD,MAAI,IAAQxc,KAAKiiE,GAAG71D,KAAKoQ,MAAMlZ,GAAKtD,KAAK41E,YAActyE,EAAItD,KAAK+gE,GAAG30D,GAAGoQ,MAAM,KAAM,MAASlZ,GAAKtD,KAAKkgE,GAAG9zD,GAAGoQ,MAAM,KAAM,QAASwoB,OAAO54B,IACvI,GAAIs9C,GAAGt9C,GAGP,OAAOyO,GAAE,uBAAwB,iCAAkCzO,GAAIpM,KAAK41E,UAC5E,IAAK51E,KAAKy1E,wBAAyB,MAAMrpE,EACzC,OAAOyO,GAAE,uBAAwB,yDAA0DzO,IAC1E,KACjB+R,MAAM/R,IACNpM,KAAK41E,YAAcxpE,GAAKpM,KAAKqgE,GAAGpf,kBAAkB,IAAMjhD,KAAK0hE,GAAGt1D,KAAMpM,KAAK41E,UAAYxpE,KAG/Fq2D,GAAGr2D,GACC,OAAOmqE,GAAGnqE,GAAGgD,IAAI,SAASoN,MAAMpQ,GAAKs7C,GAAGxpC,QAAQle,KAAK+iE,GAAG32D,MAE5D62D,GAAG72D,GACC,OAAOiqE,GAAGjqE,GAAGuyB,OAAO3+B,KAAK01E,UAMtBluB,WACH,GAAIxnD,KAAK41E,YAAc51E,KAAKkjE,GAAGljE,KAAKg2E,GAAI,MAAO,CAC3Ch2E,KAAKg2E,GAAKhsE,KAAKD,MACf,MAAMqC,QAAUpM,KAAK2qD,eAAe,sCAAuC,qBAAsBv+C,IAC7F,MAAM9I,EAAIshE,GAAGx4D,EAAG,kBAChB,OAAO9I,EAAEolC,IAAIlsB,MAAMpQ,IACf,MAAMsM,EAAI1Y,KAAKmjE,GAAG/2D,EAAG,MAAO3B,EAAI2B,EAAE44C,QAAQ54C,IAAM,IAAMsM,EAAE3M,QAAQK,KAEhE,OAAOs7C,GAAGxxC,QAAQzL,GAAI2B,GAAK9I,EAAEq7B,OAAOvyB,EAAEspE,YAAYl5D,MAAM,IAAM/R,UAElEu6B,WAAa,KAML,GAAIhlC,KAAKk2E,GAAI,IAAK,MAAM5yE,KAAK8I,EAAGpM,KAAKk2E,GAAGM,WAAWx2E,KAAKojE,GAAG9/D,EAAEoyE,YAM1E5S,KACH9iE,KAAKuhE,GAAKvhE,KAAKqgE,GAAG9V,kBAAkB,0BAAgE,SAAYvqD,KAAKwiE,KAAKrkD,UAAYne,KAAKgjE,OAAO7kD,MAAI,IAAQne,KAAK8iE,SAEhHC,GAAG32D,GACtD,QAASA,GAAKA,EAAEqqE,UAAYz2E,KAAK01E,SAQ9BzT,GAAG71D,GACN,OAAIpM,KAAK0gE,GAAWhZ,GAAGxpC,SAAQ,GACxBq4D,GAAGnqE,GAAGgD,IAAI,SAASoN,MAAMlZ,IAU5B,GAAI,OAASA,GAAKtD,KAAKkjE,GAAG5/D,EAAEozE,iBAAkB,OAAS12E,KAAKqjE,GAAG//D,EAAEmzE,SAAU,CACvE,GAAIz2E,KAAK+iE,GAAGz/D,IAAMtD,KAAK61E,eAAgB,OAAO,EAC9C,IAAK71E,KAAK+iE,GAAGz/D,GAAI,CACb,IAAKA,EAAEmyE,wBAYP,MAAM,IAAI/tD,GAAEjN,GAAE4lC,oBAAqBk1B,IACnC,OAAO,GAGf,SAAUv1E,KAAK61E,iBAAmB71E,KAAK+1E,eAAiBM,GAAGjqE,GAAGs8B,IAAIlsB,MAAMpQ,QAAK,IAAWpM,KAAKmjE,GAAG/2D,EAAG,KAAK0sC,MAAM1sC,IAC1G,GAAIpM,KAAK01E,WAAatpE,EAAEspE,SAAU,CAC9B,MAAMpyE,GAAKtD,KAAK61E,gBAAkBzpE,EAAEypE,eAAgBn9D,GAAK1Y,KAAK+1E,cAAgB3pE,EAAE2pE,aAActrE,EAAIzK,KAAK61E,iBAAmBzpE,EAAEypE,eAC5H,GAAIvyE,GAAKoV,GAAKjO,EAAG,OAAO,EAE5B,OAAO,UAEX+R,MAAMpQ,IAAMpM,KAAK41E,YAAcxpE,GAAKyO,GAAE,uBAAwB,UAAUzO,EAAI,KAAO,0CACvFA,KAEJo7C,iBAGIxnD,KAAK0+D,IAAK,EAAI1+D,KAAKsjE,KAAMtjE,KAAKuhE,KAAOvhE,KAAKuhE,GAAGzpC,SAAU93B,KAAKuhE,GAAK,MAAOvhE,KAAKujE,KAC7EvjE,KAAKwjE,WAGCxjE,KAAKuiE,GAAG5X,eAAe,WAAY,YAAa,CAAE,QAAS,mBAAqBv+C,IAClF,MAAM9I,EAAI,IAAIohE,GAAGt4D,EAAGk/C,GAAG1F,IACvB,OAAO5lD,KAAK+gE,GAAGz9D,GAAGkZ,MAAM,IAAMxc,KAAKijE,GAAG3/D,QACrCtD,KAAKuiE,GAAGtlB,QAGbj9C,KAAKyjE,KAKFN,GAAG/2D,EAAG9I,GACT,OAAO8I,EAAE44C,QAAQ54C,GAAKpM,KAAKkjE,GAAG92D,EAAEkqE,aAAchzE,KAAOtD,KAAKqjE,GAAGj3D,EAAEspE,YAQ5DhS,KACH,OAAO1jE,KAAK2qD,eAAe,mBAAoB,YAAav+C,GAAKiqE,GAAGjqE,GAAGs8B,IAAIlsB,MAAMpQ,GAAKpM,KAAKmjE,GAAG/2D,EAAG,MAAM0lC,KAAK1lC,GAAKA,EAAEspE,eAEnHprB,cACA,OAAOtqD,KAAK0+D,GAEhB8V,iBAAiBpoE,EAAG9I,GAChB,OAAOspE,GAAGrd,GAAGnjD,EAAGpM,KAAK0mD,GAAIpjD,EAAGtD,KAAK6sE,mBAErC2D,iBACI,OAAOxwE,KAAK4+D,GAEhB8R,yBACI,OAAO1wE,KAAK0yE,oBAEhB4B,gBAAgBloE,GACZ,OAAO,IAAI8+D,GAAG9+D,EAAGpM,KAAK0mD,GAAG4I,GAAG3D,YAEhC4oB,wBAAwBnoE,GACpB,OAAO07D,GAAGvY,GAAGvvD,KAAK0mD,GAAIt6C,GAE1BqoE,iBACI,OAAOz0E,KAAK2+D,GAEhBhU,eAAev+C,EAAG9I,EAAGoV,GACjBmC,GAAE,uBAAwB,wBAAyBzO,GACnD,MAAM3B,EAAI,aAAenH,EAAI,WAAa,YAAajE,EAAI,MAAQqiD,EAAI1hD,KAAK21E,IAAMlR,GAAK,KAAO/iB,EAAI8iB,GAAK,KAAO9iB,EAAI6iB,GAAK,KAAO7iB,EAAI4iB,GAAK,KAAO5iB,EAAI2iB,QAAUj4B,KAE5J,IAAIsV,EACJ,IAAID,EAGI,OAAOzhD,KAAKuiE,GAAG5X,eAAev+C,EAAG3B,EAAGpL,GAAIoL,IAAMg3C,EAAI,IAAIijB,GAAGj6D,EAAGzK,KAAKu+D,GAAKv+D,KAAKu+D,GAAG/hD,OAAS8uC,GAAG1F,IAClG,sBAAwBtiD,EAAItD,KAAKyiE,GAAGhhB,GAAGjlC,MAAMpQ,KAAOA,GAAKpM,KAAKiiE,GAAGxgB,KAAKjlC,MAAMlZ,IACxE,IAAKA,EAAG,MAAM+M,GAAE,8CAA8CjE,OAAQpM,KAAK41E,WAAY,EACvF51E,KAAKqgE,GAAGpf,sBAAwBjhD,KAAK0hE,IAAG,KAAO,IAAIh6C,GAAEjN,GAAE4lC,oBAAqB8G,IAC5E,OAAOzuC,EAAE+oC,MACTjlC,MAAMpQ,GAAKpM,KAAKkgE,GAAGze,GAAGjlC,MAAM,IAAMpQ,MAAQpM,KAAK2jE,GAAGliB,GAAGjlC,UAAY9D,EAAE+oC,QAAQtjC,MAAM/R,IAAMq1C,EAAE8F,wBAC7Fn7C,KAQJu3D,GAAGv3D,GACC,OAAOmqE,GAAGnqE,GAAGgD,IAAI,SAASoN,MAAMpQ,IAC5B,GAAI,OAASA,GAAKpM,KAAKkjE,GAAG92D,EAAEsqE,iBAAkB,OAAS12E,KAAKqjE,GAAGj3D,EAAEqqE,WAAaz2E,KAAK+iE,GAAG32D,MAAQpM,KAAK0gE,IAAM1gE,KAAKy1E,yBAA2BrpE,EAAEqpE,yBAA0B,MAAM,IAAI/tD,GAAEjN,GAAE4lC,oBAAqBk1B,OAMzMrV,GAAG9zD,GACN,MAAM9I,EAAI,CACNmzE,QAASz2E,KAAK01E,SACdD,wBAAyBz1E,KAAKy1E,wBAC9BiB,iBAAkB1sE,KAAKD,OAE3B,OAAOwsE,GAAGnqE,GAAGsS,IAAI,QAASpb,GAE9Bq/C,WACI,OAAOoG,GAAGluC,IAEmEkmD,GAAG30D,GAChF,MAAM9I,EAAIizE,GAAGnqE,GACb,OAAO9I,EAAE8L,IAAI,SAASoN,MAAMpQ,GAAKpM,KAAK+iE,GAAG32D,IAAMyO,GAAE,uBAAwB,4BACzEvX,EAAEq7B,OAAO,UAAY+oB,GAAGxpC,YAEiCglD,GAAG92D,EAAG9I,GAC/D,MAAMoV,EAAI1O,KAAKD,MACf,QAASqC,EAAIsM,EAAIpV,GAAS8I,EAAIsM,IAAOrI,GAAE,kDAAkDjE,OAAOsM,KAChG,IAEJ2pD,KACI,OAASriE,KAAKmD,UAAY,mBAAqBnD,KAAKmD,SAAS6L,mBAAqBhP,KAAK4gE,GAAK,KACxF5gE,KAAKqgE,GAAG+V,uBAAyBp2E,KAAK+1E,aAAe,YAAc/1E,KAAKmD,SAASwzE,gBACjF32E,KAAKwiE,SACNxiE,KAAKmD,SAAS6L,iBAAiB,mBAAoBhP,KAAK4gE,IAAK5gE,KAAK+1E,aAAe,YAAc/1E,KAAKmD,SAASwzE,iBAEpHpT,KACIvjE,KAAK4gE,KAAO5gE,KAAKmD,SAASoM,oBAAoB,mBAAoBvP,KAAK4gE,IAAK5gE,KAAK4gE,GAAK,MAWnFiC,KACH,IAAIz2D,EACJ,mBAAsB,QAAUA,EAAIpM,KAAK8C,cAAW,IAAWsJ,OAAI,EAASA,EAAE4C,oBAAsBhP,KAAK81E,GAAK,KAI1G91E,KAAKsjE,KAAMhuC,KAAOtwB,UAAU4xE,WAAWxzE,MAAM,mBAK7CpD,KAAKqgE,GAAGwW,qBAA8C,GAAK72E,KAAKqgE,GAAG+V,kBAAkB,IAAMp2E,KAAKkhD,cACjGlhD,KAAK8C,OAAOkM,iBAAiB,WAAYhP,KAAK81E,KAErDtS,KACIxjE,KAAK81E,KAAO91E,KAAK8C,OAAOyM,oBAAoB,WAAYvP,KAAK81E,IAAK91E,KAAK81E,GAAK,MAMzEzS,GAAGj3D,GACN,IAAI9I,EACJ,IACI,MAAMoV,EAAI,QAAU,QAAUpV,EAAItD,KAAKk2E,UAAO,IAAW5yE,OAAI,EAASA,EAAEwzE,QAAQ92E,KAAKojE,GAAGh3D,KACxF,OAAOyO,GAAE,uBAAwB,WAAWzO,MAAMsM,EAAI,KAAO,oCAC7DA,EACF,MAAOtM,GAEL,OAAOiE,GAAE,uBAAwB,mCAAoCjE,IAAI,GAM1Ek3D,KACH,GAAItjE,KAAKk2E,GAAI,IACTl2E,KAAKk2E,GAAGa,QAAQ/2E,KAAKojE,GAAGpjE,KAAK01E,UAAW5zE,OAAOkI,KAAKD,QACtD,MAAOqC,GAELiE,GAAE,kCAAmCjE,IAGYq3D,KACrD,GAAIzjE,KAAKk2E,GAAI,IACTl2E,KAAKk2E,GAAGM,WAAWx2E,KAAKojE,GAAGpjE,KAAK01E,WAClC,MAAOtpE,KAIbg3D,GAAGh3D,GACC,MAAO,oBAAoBpM,KAAK6rD,kBAAkBz/C,KAMtD,SAASmqE,GAAGnqE,GACZ,OAAOw4D,GAAGx4D,EAAG,SAKb,SAASiqE,GAAGjqE,GACZ,OAAOw4D,GAAGx4D,EAAG,kBAMb,SAAS4qE,GAAG5qE,EAAG9I,GAMf,IAAIoV,EAAItM,EAAE6/C,UACV,OAAO7/C,EAAE+/C,oBAAsBzzC,GAAK,IAAMtM,EAAE8/C,UAAW,aAAe5oD,EAAI,IAAMoV,EAAI,IAwBxF,MAAMu+D,GACFtxE,YAAYyG,EAAG9I,EAAGoV,EAAGjO,GACjBzK,KAAKs+D,SAAWlyD,EAAGpM,KAAKk3E,UAAY5zE,EAAGtD,KAAK4jE,GAAKlrD,EAAG1Y,KAAK6jE,GAAKp5D,EAElEk4C,UAAUv2C,EAAG9I,GACT,IAAIoV,EAAIykD,KAAM1yD,EAAI0yD,KAClB,IAAK,MAAM/wD,KAAK9I,EAAE6zE,WAAY,OAAQ/qE,EAAEpE,MACtC,KAAK,EACH0Q,EAAIA,EAAEhB,IAAItL,EAAE8E,IAAIrK,KAChB,MAEF,KAAK,EACH4D,EAAIA,EAAEiN,IAAItL,EAAE8E,IAAIrK,KAGpB,OAAO,IAAIowE,GAAG7qE,EAAG9I,EAAE4zE,UAAWx+D,EAAGjO,IAyDrC,MAAM2sE,GACNzxE,cACI3F,KAAK+jE,IAAK,EAEqCsT,WAAWjrE,EAAG9I,GAC7DtD,KAAKgkE,GAAK53D,EAAGpM,KAAK6qD,aAAevnD,EAAGtD,KAAK+jE,IAAK,EAEkBsP,0BAA0BjnE,EAAG9I,EAAGoV,EAAGjO,GACnG,OAAOzK,KAAKikE,GAAG73D,EAAG9I,GAAGkZ,MAAMnd,GAAKA,GAAKW,KAAKkkE,GAAG93D,EAAG9I,EAAGmH,EAAGiO,KAAK8D,MAAM9D,GAAKA,GAAK1Y,KAAKmkE,GAAG/3D,EAAG9I,KAKnF2gE,GAAG73D,EAAG9I,GACT,GAAI0H,GAAG1H,GAIP,OAAOokD,GAAGxpC,QAAQ,MAClB,IAAIxF,EAAI+/C,GAAGn1D,GACX,OAAOtD,KAAK6qD,aAAaigB,aAAa1+D,EAAGsM,GAAG8D,MAAM/R,GAAK,IAA2BA,EAAI,MAAQ,OAASnH,EAAE+gD,OAAS,IAA8B55C,IAQhJnH,EAAIq1D,GAAGr1D,EAAG,KAAM,KAA4BoV,EAAI+/C,GAAGn1D,IAAKtD,KAAK6qD,aAAaggB,2BAA2Bz+D,EAAGsM,GAAG8D,MAAM/R,IAC7G,MAAMpL,EAAI89D,MAAM1yD,GAChB,OAAOzK,KAAKgkE,GAAG8O,aAAa1mE,EAAG/M,GAAGmd,MAAM/R,GAAKzK,KAAK6qD,aAAamgB,aAAa5+D,EAAGsM,GAAG8D,MAAM9D,IACpF,MAAMgpC,EAAI1hD,KAAKokE,GAAG9gE,EAAGmH,GACrB,OAAOzK,KAAKqkE,GAAG/gE,EAAGo+C,EAAGriD,EAAGqZ,EAAEquC,UAAY/mD,KAAKikE,GAAG73D,EAAGusD,GAAGr1D,EAAG,KAAM,MAA8BtD,KAAKskE,GAAGl4D,EAAGs1C,EAAGp+C,EAAGoV,cAOjHwrD,GAAG93D,EAAG9I,EAAGoV,EAAGjO,GACf,OAAOO,GAAG1H,IAAMmH,EAAEq0C,QAAQ6E,GAAGnS,OAASxxC,KAAKmkE,GAAG/3D,EAAG9I,GAAKtD,KAAKgkE,GAAG8O,aAAa1mE,EAAGsM,GAAG8D,MAAMnd,IACnF,MAAMqiD,EAAI1hD,KAAKokE,GAAG9gE,EAAGjE,GACrB,OAAOW,KAAKqkE,GAAG/gE,EAAGo+C,EAAGhpC,EAAGjO,GAAKzK,KAAKmkE,GAAG/3D,EAAG9I,IAAMo4B,MAAOz5B,EAAE8G,OAAS8R,GAAE,cAAe,wDAAyDpQ,EAAEpF,WAAYyzD,GAAGx1D,IAC3JtD,KAAKskE,GAAGl4D,EAAGs1C,EAAGp+C,EAAGqjD,GAAGl8C,GAAI,QAK2C25D,GAAGh4D,EAAG9I,GAG7E,IAAIoV,EAAI,IAAIu8C,GAAGgE,GAAG7sD,IAClB,OAAO9I,EAAE4S,UAAU5S,EAAGmH,KAClBsuD,GAAG3sD,EAAG3B,KAAOiO,EAAIA,EAAEhB,IAAIjN,OACtBiO,EAaF2rD,GAAGj4D,EAAG9I,EAAGoV,EAAGjO,GACf,GAAI,OAAS2B,EAAEi4C,MAEf,OAAO,EACP,GAAI3rC,EAAEgM,OAASphB,EAAEohB,KAGjB,OAAO,EASC,MAAMrlB,EAAI,MAA8B+M,EAAE6rD,UAAY30D,EAAE6xD,OAAS7xD,EAAE4xD,QAC3E,QAAS71D,IAAMA,EAAEw3D,kBAAoBx3D,EAAEgS,QAAQwyC,UAAUp5C,GAAK,GAElE05D,GAAG/3D,EAAG9I,GACF,OAAOo4B,MAAOz5B,EAAE8G,OAAS8R,GAAE,cAAe,+CAAgDi+C,GAAGx1D,IAC7FtD,KAAKgkE,GAAGqP,0BAA0BjnE,EAAG9I,EAAGojD,GAAGlV,OAKxC8yB,GAAGl4D,EAAG9I,EAAGoV,EAAGjO,GAEf,OAAOzK,KAAKgkE,GAAGqP,0BAA0BjnE,EAAGsM,EAAGjO,GAAG+R,MAAMpQ,IAExD9I,EAAE4S,SAAS5S,IACP8I,EAAIA,EAAE8mD,OAAO5vD,EAAEuD,IAAKvD,MACnB8I,MA4Bb,MAAMkrE,GACF3xE,YAEAyG,EAAG9I,EAAGoV,EAAGjO,GACLzK,KAAK0qD,YAAct+C,EAAGpM,KAAKukE,GAAKjhE,EAAGtD,KAAK0mD,GAAKj8C,EAO7CzK,KAAKwkE,GAAK,IAAI1R,GAAGlQ,IAGjB5iD,KAAKykE,GAAK,IAAIrI,IAAIhwD,GAAKorD,GAAGprD,IAAKqrD,IAO/Bz3D,KAAK0kE,GAAK,IAAItvC,IAAKp1B,KAAK4kE,GAAKx4D,EAAEskE,yBAA0B1wE,KAAK4+D,GAAKxyD,EAAEokE,iBACrExwE,KAAK2+D,GAAKvyD,EAAEqoE,iBAAkBz0E,KAAK6kE,GAAGnsD,GAE1CmsD,GAAGz4D,GAGCpM,KAAK4yE,qBAAuB5yE,KAAK0qD,YAAY6pB,wBAAwBnoE,GAAIpM,KAAK6qD,aAAe7qD,KAAK0qD,YAAY4pB,gBAAgBloE,GAC9HpM,KAAK2yE,cAAgB3yE,KAAK0qD,YAAY8pB,iBAAiBpoE,EAAGpM,KAAK6qD,cAAe7qD,KAAKgrD,eAAiB,IAAIynB,GAAGzyE,KAAK4kE,GAAI5kE,KAAK2yE,cAAe3yE,KAAK4yE,qBAAsB5yE,KAAK6qD,cACxK7qD,KAAK4kE,GAAG4M,gBAAgBxxE,KAAK6qD,cAAe7qD,KAAKukE,GAAG8S,WAAWr3E,KAAKgrD,eAAgBhrD,KAAK6qD,cAE7FmlB,eAAe5jE,GACX,OAAOpM,KAAK0qD,YAAYC,eAAe,kBAAmB,qBAAsBrnD,GAAK8I,EAAEikE,QAAQ/sE,EAAGtD,KAAKwkE,OAI/G,SAAS+S,GAETnrE,EAAG9I,EAAGoV,EAAGjO,GACL,OAAO,IAAI6sE,GAAGlrE,EAAG9I,EAAGoV,EAAGjO,GAW3B+8C,eAAegwB,GAAGprE,EAAG9I,GACjB,MAAMoV,EAAIknC,GAAExzC,GACZ,aAAasM,EAAEgyC,YAAYC,eAAe,qBAAsB,YAAav+C,IAGzE,IAAI3B,EACJ,OAAOiO,EAAEi6D,cAAcpF,sBAAsBnhE,GAAGoQ,MAAMnd,IAAMoL,EAAIpL,EAAGqZ,EAAEmsD,GAAGvhE,GAAIoV,EAAEi6D,cAAcpF,sBAAsBnhE,MAAMoQ,MAAMlZ,IAC1H,MAAMjE,EAAI,GAAIqiD,EAAI,GAElB,IAAID,EAAI0b,KACR,IAAK,MAAM/wD,KAAK3B,EAAG,CACfpL,EAAEiC,KAAK8K,EAAEi/C,SACT,IAAK,MAAM/nD,KAAK8I,EAAE44D,UAAWvjB,EAAIA,EAAE/pC,IAAIpU,EAAEuD,KAE7C,IAAK,MAAMuF,KAAK9I,EAAG,CACfo+C,EAAEpgD,KAAK8K,EAAEi/C,SACT,IAAK,MAAM/nD,KAAK8I,EAAE44D,UAAWvjB,EAAIA,EAAE/pC,IAAIpU,EAAEuD,KAIjC,OAAO6R,EAAEsyC,eAAe8nB,aAAa1mE,EAAGq1C,GAAGjlC,MAAMpQ,IAAM,CAC/Dk5D,GAAIl5D,EACJqrE,gBAAiBp4E,EACjBq4E,cAAeh2B,YA+D/B,SAASi2B,GAAGvrE,GACR,MAAM9I,EAAIs8C,GAAExzC,GACZ,OAAO9I,EAAEonD,YAAYC,eAAe,mCAAoC,YAAav+C,GAAK9I,EAAEs7D,GAAG0P,6BAA6BliE,KA4F5H,SAASwrE,GAAGxrE,EAAG9I,EAAGoV,GAClB,IAAIjO,EAAI0yD,KAAM99D,EAAI89D,KAClB,OAAOzkD,EAAExC,SAAS9J,GAAK3B,EAAIA,EAAEiN,IAAItL,KAAM9I,EAAEonE,WAAWt+D,EAAG3B,GAAG+R,MAAMpQ,IAC5D,IAAI3B,EAAIiyD,KACR,OAAOhkD,EAAExC,UAAUwC,EAAGgpC,KAClB,MAAMD,EAAIr1C,EAAEgD,IAAIsJ,GAEJgpC,EAAEqV,oBAAsBtV,EAAEsV,oBAAsB13D,EAAIA,EAAEqY,IAAIgB,IAKtEgpC,EAAEsV,gBAAkBtV,EAAErwC,QAAQytC,QAAQ6E,GAAGnS,QAIzCluC,EAAEutE,YAAYn4D,EAAGgpC,EAAEqF,UAAWt8C,EAAIA,EAAEyoD,OAAOx6C,EAAGgpC,KAAOD,EAAEqV,mBAAqBpV,EAAErwC,QAAQwyC,UAAUpC,EAAEpwC,SAAW,GAAK,IAAMqwC,EAAErwC,QAAQwyC,UAAUpC,EAAEpwC,UAAYowC,EAAEoV,kBAAoBvzD,EAAE4tE,SAASxvB,GAC3Lj3C,EAAIA,EAAEyoD,OAAOx6C,EAAGgpC,IAAM7mC,GAAE,aAAc,sCAAuCnC,EAAG,qBAAsB+oC,EAAEpwC,QAAS,kBAAmBqwC,EAAErwC,YACrI,CACDq0D,GAAIj7D,EACJo7D,GAAIxmE,MAWhB,SAASw4E,GAAGzrE,EAAG9I,GACX,MAAMoV,EAAIknC,GAAExzC,GACZ,OAAOsM,EAAEgyC,YAAYC,eAAe,0BAA2B,YAAav+C,SAAM,IAAW9I,IAAMA,GAAK,GACxGoV,EAAEi6D,cAAcvF,iCAAiChhE,EAAG9I,MAexD,SAASw0E,GAAG1rE,EAAG9I,GACX,MAAMoV,EAAIknC,GAAExzC,GACZ,OAAOsM,EAAEgyC,YAAYC,eAAe,kBAAmB,aAAcv+C,IACjE,IAAI3B,EACJ,OAAOiO,EAAEkmD,GAAGwQ,cAAchjE,EAAG9I,GAAGkZ,MAAMnd,GAAKA,GAI3CoL,EAAIpL,EAAGqoD,GAAGxpC,QAAQzT,IAAMiO,EAAEkmD,GAAGwP,iBAAiBhiE,GAAGoQ,MAAMnd,IAAMoL,EAAI,IAAIo7D,GAAGviE,EAAGjE,EAAG,EAA+B+M,EAAEu4D,uBAC/GjsD,EAAEkmD,GAAG+P,cAAcviE,EAAG3B,GAAG+R,UAAY/R,YACrC0T,MAAM/R,IAGN,MAAM3B,EAAIiO,EAAE8rD,GAAGp1D,IAAIhD,EAAEkyD,UACrB,OAAQ,OAAS7zD,GAAK2B,EAAEmxD,gBAAgB1Z,UAAUp5C,EAAE8yD,iBAAmB,KAAO7kD,EAAE8rD,GAAK9rD,EAAE8rD,GAAGtR,OAAO9mD,EAAEkyD,SAAUlyD,GAC7GsM,EAAE+rD,GAAGpnD,IAAI/Z,EAAG8I,EAAEkyD,WAAYlyD,KAiBlCo7C,eAAeuwB,GAAG3rE,EAAG9I,EAAGoV,GACpB,MAAMjO,EAAIm1C,GAAExzC,GAAI/M,EAAIoL,EAAE+5D,GAAGp1D,IAAI9L,GAAIo+C,EAAIhpC,EAAI,YAAc,oBACvD,IACIA,SAAWjO,EAAEigD,YAAYC,eAAe,iBAAkBjJ,GAAIt1C,GAAK3B,EAAEigD,YAAYmiB,kBAAkB9N,aAAa3yD,EAAG/M,KACrH,MAAO+M,GACL,IAAKs9C,GAAGt9C,GAAI,MAAMA,EAMlByO,GAAE,aAAc,gDAAgDvX,MAAM8I,KAE1E3B,EAAE+5D,GAAK/5D,EAAE+5D,GAAGroD,OAAO7Y,GAAImH,EAAEg6D,GAAG9lC,OAAOt/B,EAAEqP,QAUrC,SAASspE,GAAG5rE,EAAG9I,EAAGoV,GAClB,MAAMjO,EAAIm1C,GAAExzC,GACZ,IAAI/M,EAAIskD,GAAGnS,MAAOkQ,EAAIyb,KACtB,OAAO1yD,EAAEigD,YAAYC,eAAe,gBAAiB,YAAav+C,GAAK,SAASA,EAAG9I,EAAGoV,GAClF,MAAMjO,EAAIm1C,GAAExzC,GAAI/M,EAAIoL,EAAEg6D,GAAGr1D,IAAIsJ,GAC7B,YAAO,IAAWrZ,EAAIqoD,GAAGxpC,QAAQzT,EAAE+5D,GAAGp1D,IAAI/P,IAAMoL,EAAEm0D,GAAGwQ,cAAc9rE,EAAGoV,GAFH,CAGrEjO,EAAG2B,EAAGqsD,GAAGn1D,IAAIkZ,MAAMlZ,IACjB,GAAIA,EAAG,OAAOjE,EAAIiE,EAAEwiE,6BAA8Br7D,EAAEm0D,GAAG8Q,2BAA2BtjE,EAAG9I,EAAEg7D,UAAU9hD,MAAMpQ,IACnGs1C,EAAIt1C,QAERoQ,MAAI,IAAQ/R,EAAE85D,GAAG8O,0BAA0BjnE,EAAG9I,EAAGoV,EAAIrZ,EAAIskD,GAAGnS,MAAO94B,EAAIgpC,EAAIyb,QAAQ3gD,MAAMpQ,IAAM6rE,GAAGxtE,EAAGuuD,GAAG11D,GAAI8I,GAChH,CACIu1D,UAAWv1D,EACX85D,GAAIxkB,QAKZ,SAASw2B,GAAG9rE,EAAG9I,GACX,MAAMoV,EAAIknC,GAAExzC,GAAI3B,EAAIm1C,GAAElnC,EAAEkmD,IAAKv/D,EAAIqZ,EAAE8rD,GAAGp1D,IAAI9L,GAC1C,OAAOjE,EAAI4e,QAAQC,QAAQ7e,EAAEqP,QAAUgK,EAAEgyC,YAAYC,eAAe,kBAAmB,YAAav+C,GAAK3B,EAAEkkD,GAAGviD,EAAG9I,GAAGkZ,MAAMpQ,GAAKA,EAAIA,EAAEsC,OAAS,SAUlJ,SAASypE,GAAG/rE,EAAG9I,GACX,MAAMoV,EAAIknC,GAAExzC,GAAI3B,EAAIiO,EAAEgsD,GAAGt1D,IAAI9L,IAAMqgD,GAAGnS,MAKlC,OAAO94B,EAAEgyC,YAAYC,eAAe,2BAA4B,YAAav+C,GAAKsM,EAAEksD,GAAGoN,0BAA0B5lE,EAAG9I,EAAGqjD,GAAGl8C,GAAI,GACrHoV,OAAO8sC,oBAAoBxuC,MAAM/R,IAAM6rE,GAAGv/D,EAAGpV,EAAG8I,GAAIA,KAKrE,SAAS6rE,GAAG7rE,EAAG9I,EAAGoV,GACd,IAAIjO,EAAI2B,EAAEs4D,GAAGt1D,IAAI9L,IAAMqgD,GAAGnS,MAC1B94B,EAAExC,SAAO,CAAG9J,EAAG9I,KACXA,EAAEyjD,SAASlD,UAAUp5C,GAAK,IAAMA,EAAInH,EAAEyjD,aACrC36C,EAAEs4D,GAAGrnD,IAAI/Z,EAAGmH,GA6CrB+8C,eAAe4wB,GAAGhsE,EAAG9I,EAAGoV,EAAIykD,MAMxB,MAAM1yD,QAAUqtE,GAAG1rE,EAAGqsD,GAAGwO,GAAG3jE,EAAEskE,gBAAiBvoE,EAAIugD,GAAExzC,GACrD,OAAO/M,EAAEqrD,YAAYC,eAAe,mBAAoB,aAAcv+C,IAClE,MAAMs1C,EAAIqe,GAAGz8D,EAAEyjD,UAGP,GAAIt8C,EAAE8yD,gBAAgB1Z,UAAUnC,IAAM,EAAG,OAAOriD,EAAEs/D,GAAGkJ,eAAez7D,EAAG9I,GAEvE,MAAMm+C,EAAIh3C,EAAEu7D,gBAAgBlZ,GAAGO,kBAAmB3L,GAC1D,OAAOriD,EAAEmlE,GAAKnlE,EAAEmlE,GAAGtR,OAAOzR,EAAE6c,SAAU7c,GAAIpiD,EAAEu/D,GAAGiQ,iBAAiBziE,EAAGq1C,GAAGjlC,UAAYnd,EAAEu/D,GAAGmQ,8BAA8B3iE,EAAG3B,EAAE6zD,YAAY9hD,MAAM,IAAMnd,EAAEu/D,GAAGyQ,gBAAgBjjE,EAAGsM,EAAGjO,EAAE6zD,YAAY9hD,MAAI,IAAQnd,EAAEs/D,GAAGkJ,eAAez7D,EAAG9I,QAKtO,SAAS+0E,GAAGjsE,EAAG9I,GACX,MAAO,qBAAqB8I,KAAK9I,IAWrC,SAASg1E,GAAGlsE,EAAG9I,EAAGoV,GACd,IAAIjO,EAAI,uBAAuB2B,KAAKsM,IACpC,OAAOpV,EAAEs7C,oBAAsBn0C,GAAK,IAAInH,EAAEq7C,OAAQl0C,EAMtD,SAAS8tE,GAAGnsE,EAAG9I,GACX,MAAO,qBAAqB8I,KAAK9I,IAWrC,MAAMk1E,GACF7yE,YAAYyG,EAAG9I,EAAGoV,EAAGjO,GACjBzK,KAAK8gD,KAAO10C,EAAGpM,KAAKqrD,QAAU/nD,EAAGtD,KAAK6T,MAAQ6E,EAAG1Y,KAAKyD,MAAQgH,EAK3Dk4C,UAAUv2C,EAAG9I,EAAGoV,GACnB,MAAMjO,EAAI9G,KAAKC,MAAM8U,GACrB,IAAIrZ,EAAGqiD,EAAI,iBAAmBj3C,IAAM,IAAM,CAAE,UAAW,eAAgB,YAAasB,QAAQtB,EAAEoJ,cAAW,IAAWpJ,EAAEhH,OAAS,iBAAmBgH,EAAEhH,OACpJ,OAAOi+C,GAAKj3C,EAAEhH,QAAUi+C,EAAI,iBAAmBj3C,EAAEhH,MAAMoC,SAAW,iBAAmB4E,EAAEhH,MAAMmC,KAC7F87C,IAAMriD,EAAI,IAAIqoB,GAAEjd,EAAEhH,MAAMmC,KAAM6E,EAAEhH,MAAMoC,WAAY67C,EAAI,IAAI82B,GAAGpsE,EAAG9I,EAAGmH,EAAEoJ,MAAOxU,IAAMgR,GAAE,oBAAqB,0CAA0C/M,OAAOoV,KAC1J,MAEJguD,KACI,MAAMt6D,EAAI,CACNyH,MAAO7T,KAAK6T,MACZyiE,aAActsE,KAAKD,OAEvB,OAAO/J,KAAKyD,QAAU2I,EAAE3I,MAAQ,CAC5BmC,KAAM5F,KAAKyD,MAAMmC,KACjBC,QAAS7F,KAAKyD,MAAMoC,UACpBlC,KAAKuY,UAAU9P,IAS3B,MAAMqsE,GACF9yE,YAAYyG,EAAG9I,EAAGoV,GACd1Y,KAAKs+D,SAAWlyD,EAAGpM,KAAK6T,MAAQvQ,EAAGtD,KAAKyD,MAAQiV,EAK7CiqC,UAAUv2C,EAAG9I,GAChB,MAAMoV,EAAI/U,KAAKC,MAAMN,GACrB,IAAImH,EAAGpL,EAAI,iBAAmBqZ,IAAM,IAAM,CAAE,cAAe,UAAW,YAAa3M,QAAQ2M,EAAE7E,cAAW,IAAW6E,EAAEjV,OAAS,iBAAmBiV,EAAEjV,OACnJ,OAAOpE,GAAKqZ,EAAEjV,QAAUpE,EAAI,iBAAmBqZ,EAAEjV,MAAMoC,SAAW,iBAAmB6S,EAAEjV,MAAMmC,KAC7FvG,IAAMoL,EAAI,IAAIid,GAAEhP,EAAEjV,MAAMmC,KAAM8S,EAAEjV,MAAMoC,WAAYxG,EAAI,IAAIo5E,GAAGrsE,EAAGsM,EAAE7E,MAAOpJ,IAAM4F,GAAE,oBAAqB,wCAAwCjE,OAAO9I,KACrJ,MAEJojE,KACI,MAAMt6D,EAAI,CACNyH,MAAO7T,KAAK6T,MACZyiE,aAActsE,KAAKD,OAEvB,OAAO/J,KAAKyD,QAAU2I,EAAE3I,MAAQ,CAC5BmC,KAAM5F,KAAKyD,MAAMmC,KACjBC,QAAS7F,KAAKyD,MAAMoC,UACpBlC,KAAKuY,UAAU9P,IAOvB,MAAMssE,GACN/yE,YAAYyG,EAAG9I,GACXtD,KAAK01E,SAAWtpE,EAAGpM,KAAK24E,gBAAkBr1E,EAKvCq/C,UAAUv2C,EAAG9I,GAChB,MAAMoV,EAAI/U,KAAKC,MAAMN,GACrB,IAAImH,EAAI,iBAAmBiO,GAAKA,EAAEigE,2BAA2Bp4E,MAAOlB,EAAIg+D,KACxE,IAAK,IAAIjxD,EAAI,EAAG3B,GAAK2B,EAAIsM,EAAEigE,gBAAgBr5E,SAAU8M,EAAG3B,EAAIgiD,GAAG/zC,EAAEigE,gBAAgBvsE,IACjF/M,EAAIA,EAAEqY,IAAIgB,EAAEigE,gBAAgBvsE,IAC5B,OAAO3B,EAAI,IAAIiuE,GAAGtsE,EAAG/M,IAAMgR,GAAE,oBAAqB,6CAA6CjE,OAAO9I,KACtG,OAQJ,MAAMs1E,GACNjzE,YAAYyG,EAAG9I,GACXtD,KAAK01E,SAAWtpE,EAAGpM,KAAK64E,YAAcv1E,EAKnCq/C,UAAUv2C,GACb,MAAM9I,EAAIK,KAAKC,MAAMwI,GACrB,MAAO,iBAAmB9I,IAAM,IAAM,CAAE,UAAW,SAAU,WAAYyI,QAAQzI,EAAEu1E,cAAgB,iBAAmBv1E,EAAEoyE,SAAW,IAAIkD,GAAGt1E,EAAEoyE,SAAUpyE,EAAEu1E,cAAgBxoE,GAAE,oBAAqB,iCAAiCjE,KAChO,OAeR,MAAM0sE,GACFnzE,cACI3F,KAAK24E,gBAAkBtb,KAE3BsJ,GAAGv6D,GACCpM,KAAK24E,gBAAkB34E,KAAK24E,gBAAgBjhE,IAAItL,GAEpDy6D,GAAGz6D,GACCpM,KAAK24E,gBAAkB34E,KAAK24E,gBAAgBh6C,OAAOvyB,GAKhDs6D,KACH,MAAMt6D,EAAI,CACNusE,gBAAiB34E,KAAK24E,gBAAgB9qE,UACtCyoE,aAActsE,KAAKD,OAEvB,OAAOpG,KAAKuY,UAAU9P,IAQ1B,MAAM2sE,GACNpzE,YAAYyG,EAAG9I,EAAGoV,EAAGjO,EAAGpL,GACpBW,KAAK8C,OAASsJ,EAAGpM,KAAKqgE,GAAK/8D,EAAGtD,KAAK6rD,eAAiBnzC,EAAG1Y,KAAK+mE,GAAKt8D,EAAGzK,KAAKg5E,WAAa,KACtFh5E,KAAKi5E,mBAAqB,KAAMj5E,KAAKwrD,sBAAwB,KAAMxrD,KAAKinE,GAAKjnE,KAAKknE,GAAG97D,KAAKpL,MAC1FA,KAAKonE,GAAK,IAAItU,GAAGlQ,IAAI5iD,KAAKsqD,SAAU,EAKpCtqD,KAAKqnE,GAAK,GAGV,MAAM3lB,EAAIhpC,EAAE/V,QAAQ,sBAAuB,QAC3C3C,KAAKk5E,QAAUl5E,KAAK8C,OAAOmzE,aAAcj2E,KAAKshD,YAAcjiD,EAAGW,KAAKunE,GAAK8Q,GAAGr4E,KAAK6rD,eAAgB7rD,KAAK+mE,IACtG/mE,KAAK2nE,GAEL,SAASv7D,GACL,MAAO,6BAA6BA,IADxC,CAkBHpM,KAAK6rD,gBAAiB7rD,KAAKonE,GAAKpnE,KAAKonE,GAAGlU,OAAOlzD,KAAK+mE,GAAI,IAAI+R,IAAK94E,KAAK8nE,GAAK,IAAIxvC,OAAO,sBAAsBopB,cACzG1hD,KAAK2oE,GAAK,IAAIrwC,OAAO,wBAAwBopB,uBAAwB1hD,KAAK4oE,GAAK,IAAItwC,OAAO,sBAAsBopB,aAChH1hD,KAAK6oE,GAEL,SAASz8D,GACL,MAAO,0BAA0BA,IADrC,CAQCpM,KAAK6rD,gBAAiB7rD,KAAK+oE,GAAK,SAAS38D,GACtC,MAAO,8BAA8BA,IADR,CAKhCpM,KAAK6rD,gBAON7rD,KAAK8C,OAAOkM,iBAAiB,UAAWhP,KAAKinE,IAE+BtkB,SAASv2C,GACrF,SAAUA,IAAMA,EAAE6pE,cAEtBzuB,cAGI,MAAMp7C,QAAUpM,KAAKg5E,WAAWtV,KAChC,IAAK,MAAMpgE,KAAK8I,EAAG,CACf,GAAI9I,IAAMtD,KAAK+mE,GAAI,SACnB,MAAM36D,EAAIpM,KAAK82E,QAAQuB,GAAGr4E,KAAK6rD,eAAgBvoD,IAC/C,GAAI8I,EAAG,CACH,MAAMsM,EAAIggE,GAAGlS,GAAGljE,EAAG8I,GACnBsM,IAAM1Y,KAAKonE,GAAKpnE,KAAKonE,GAAGlU,OAAOx6C,EAAEg9D,SAAUh9D,KAGnD1Y,KAAKqpE,KAGL,MAAM/lE,EAAItD,KAAKk5E,QAAQpC,QAAQ92E,KAAK6oE,IACpC,GAAIvlE,EAAG,CACH,MAAM8I,EAAIpM,KAAKspE,GAAGhmE,GAClB8I,GAAKpM,KAAKupE,GAAGn9D,GAEjB,IAAK,MAAMA,KAAKpM,KAAKqnE,GAAIrnE,KAAKknE,GAAG96D,GACjCpM,KAAKqnE,GAAK,GAGVrnE,KAAK8C,OAAOkM,iBAAiB,gBAAmBhP,KAAKkhD,aAAclhD,KAAKsqD,SAAU,EAEtFmB,oBAAoBr/C,GAChBpM,KAAK+2E,QAAQ/2E,KAAK2nE,GAAIhkE,KAAKuY,UAAU9P,IAEzC+sE,2BACI,OAAOn5E,KAAKwpE,GAAGxpE,KAAKonE,IAExBgS,oBAAoBhtE,GAChB,IAAI9I,GAAI,EACR,OAAOtD,KAAKonE,GAAGlxD,SAAO,CAAGwC,EAAGjO,KACxBA,EAAEkuE,gBAAgBj6C,IAAItyB,KAAO9I,GAAI,MAChCA,EAET+1E,mBAAmBjtE,GACfpM,KAAK0pE,GAAGt9D,EAAG,WAEfktE,oBAAoBltE,EAAG9I,EAAGoV,GACtB1Y,KAAK0pE,GAAGt9D,EAAG9I,EAAGoV,GAId1Y,KAAK2pE,GAAGv9D,GAEZmtE,oBAAoBntE,GAChB,IAAI9I,EAAI,cAGA,GAAItD,KAAKo5E,oBAAoBhtE,GAAI,CACrC,MAAMsM,EAAI1Y,KAAKk5E,QAAQpC,QAAQyB,GAAGv4E,KAAK6rD,eAAgBz/C,IACvD,GAAIsM,EAAG,CACH,MAAMjO,EAAIguE,GAAGjS,GAAGp6D,EAAGsM,GACnBjO,IAAMnH,EAAImH,EAAEoJ,QAGpB,OAAO7T,KAAK4pE,GAAGjD,GAAGv6D,GAAIpM,KAAKqpE,KAAM/lE,EAErCk2E,uBAAuBptE,GACnBpM,KAAK4pE,GAAG/C,GAAGz6D,GAAIpM,KAAKqpE,KAExBoQ,mBAAmBrtE,GACf,OAAOpM,KAAK4pE,GAAG+O,gBAAgBj6C,IAAItyB,GAEvCstE,gBAAgBttE,GACZpM,KAAKw2E,WAAW+B,GAAGv4E,KAAK6rD,eAAgBz/C,IAE5CutE,iBAAiBvtE,EAAG9I,EAAGoV,GACnB1Y,KAAK6pE,GAAGz9D,EAAG9I,EAAGoV,GAElBkhE,iBAAiBxtE,EAAG9I,EAAGoV,GACnBpV,EAAE4S,SAAS9J,IACPpM,KAAK2pE,GAAGv9D,MACPpM,KAAKshD,YAAcl1C,EAAGsM,EAAExC,SAAS9J,IAClCpM,KAAKq5E,mBAAmBjtE,MAGhCytE,eAAeztE,GACXpM,KAAK8pE,GAAG19D,GAEZ0tE,mBAAmB1tE,GACfpM,KAAKiqE,GAAG79D,GAEZ80C,WACIlhD,KAAKsqD,UAAYtqD,KAAK8C,OAAOyM,oBAAoB,UAAWvP,KAAKinE,IAAKjnE,KAAKw2E,WAAWx2E,KAAKunE,IAC3FvnE,KAAKsqD,SAAU,GAEnBwsB,QAAQ1qE,GACJ,MAAM9I,EAAItD,KAAKk5E,QAAQpC,QAAQ1qE,GAC/B,OAAOyO,GAAE,oBAAqB,OAAQzO,EAAG9I,GAAIA,EAEjDyzE,QAAQ3qE,EAAG9I,GACPuX,GAAE,oBAAqB,MAAOzO,EAAG9I,GAAItD,KAAKk5E,QAAQnC,QAAQ3qE,EAAG9I,GAEjEkzE,WAAWpqE,GACPyO,GAAE,oBAAqB,SAAUzO,GAAIpM,KAAKk5E,QAAQ1C,WAAWpqE,GAEjE86D,GAAG96D,GAGC,MAAM9I,EAAI8I,EACV,GAAI9I,EAAEy2E,cAAgB/5E,KAAKk5E,QAAS,CAChC,GAAIr+D,GAAE,oBAAqB,QAASvX,EAAEuD,IAAKvD,EAAE02E,UAAW12E,EAAEuD,MAAQ7G,KAAKunE,GAAI,YAAYl3D,GAAE,4GACzFrQ,KAAKqgE,GAAGpf,4BACJ,GAAIjhD,KAAKsqD,SACL,GAAI,OAAShnD,EAAEuD,IAAK,GAAI7G,KAAK8nE,GAAGp4D,KAAKpM,EAAEuD,KAAM,CACzC,GAAI,MAAQvD,EAAE02E,SAAU,CACpB,MAAM5tE,EAAIpM,KAAKkqE,GAAG5mE,EAAEuD,KACpB,OAAO7G,KAAKgqE,GAAG59D,EAAG,MAEtB,CACI,MAAMA,EAAIpM,KAAK+pE,GAAGzmE,EAAEuD,IAAKvD,EAAE02E,UAC3B,GAAI5tE,EAAG,OAAOpM,KAAKgqE,GAAG59D,EAAEspE,SAAUtpE,SAEnC,GAAIpM,KAAK2oE,GAAGj5D,KAAKpM,EAAEuD,MACtB,GAAI,OAASvD,EAAE02E,SAAU,CACrB,MAAM5tE,EAAIpM,KAAKoqE,GAAG9mE,EAAEuD,IAAKvD,EAAE02E,UAC3B,GAAI5tE,EAAG,OAAOpM,KAAKqqE,GAAGj+D,SAEvB,GAAIpM,KAAK4oE,GAAGl5D,KAAKpM,EAAEuD,MACtB,GAAI,OAASvD,EAAE02E,SAAU,CACrB,MAAM5tE,EAAIpM,KAAKsqE,GAAGhnE,EAAEuD,IAAKvD,EAAE02E,UAC3B,GAAI5tE,EAAG,OAAOpM,KAAKuqE,GAAGn+D,SAEvB,GAAI9I,EAAEuD,MAAQ7G,KAAK6oE,IACtB,GAAI,OAASvlE,EAAE02E,SAAU,CACrB,MAAM5tE,EAAIpM,KAAKspE,GAAGhmE,EAAE02E,UACpB,GAAI5tE,EAAG,OAAOpM,KAAKupE,GAAGn9D,SAEvB,GAAI9I,EAAEuD,MAAQ7G,KAAK2nE,GAAI,CAC1B,MAAMv7D,EAAI,SAASA,GACf,IAAI9I,EAAIgoD,GAAG1F,GACX,GAAI,MAAQx5C,EAAG,IACX,MAAMsM,EAAI/U,KAAKC,MAAMwI,GACrBmuB,GAAE,iBAAmB7hB,GAAIpV,EAAIoV,EAC/B,MAAOtM,GACLiE,GAAE,oBAAqB,iDAAkDjE,GAE7E,OAAO9I,EARD,CAc7BA,EAAE02E,UACiB5tE,IAAMk/C,GAAG1F,IAAM5lD,KAAKwrD,sBAAsBp/C,QACvC,GAAI9I,EAAEuD,MAAQ7G,KAAK+oE,GAAI,CAC1B,MAAM38D,EAAIpM,KAAKirE,GAAG3nE,EAAE02E,gBACd/7D,QAAQg8D,IAAI7tE,EAAE0lC,KAAK1lC,GAAKpM,KAAKg5E,WAAW9N,GAAG9+D,YAElDpM,KAAKqnE,GAAG/lE,KAAKgC,OAI5BsmE,SACA,OAAO5pE,KAAKonE,GAAGh4D,IAAIpP,KAAK+mE,IAE5BsC,KACIrpE,KAAK+2E,QAAQ/2E,KAAKunE,GAAIvnE,KAAK4pE,GAAGlD,MAElCgD,GAAGt9D,EAAG9I,EAAGoV,GACL,MAAMjO,EAAI,IAAI+tE,GAAGx4E,KAAKshD,YAAal1C,EAAG9I,EAAGoV,GAAIrZ,EAAIi5E,GAAGt4E,KAAK6rD,eAAgB7rD,KAAKshD,YAAal1C,GAC3FpM,KAAK+2E,QAAQ13E,EAAGoL,EAAEi8D,MAEtBiD,GAAGv9D,GACC,MAAM9I,EAAIg1E,GAAGt4E,KAAK6rD,eAAgB7rD,KAAKshD,YAAal1C,GACpDpM,KAAKw2E,WAAWlzE,GAEpBwmE,GAAG19D,GACC,MAAM9I,EAAI,CACNoyE,SAAU11E,KAAK+mE,GACf8R,YAAazsE,GAEjBpM,KAAKk5E,QAAQnC,QAAQ/2E,KAAK6oE,GAAIllE,KAAKuY,UAAU5Y,IAEjDumE,GAAGz9D,EAAG9I,EAAGoV,GACL,MAAMjO,EAAI8tE,GAAGv4E,KAAK6rD,eAAgBz/C,GAAI/M,EAAI,IAAIo5E,GAAGrsE,EAAG9I,EAAGoV,GACvD1Y,KAAK+2E,QAAQtsE,EAAGpL,EAAEqnE,MAEtBuD,GAAG79D,GACC,MAAM9I,EAAIK,KAAKuY,UAAU3b,MAAM80B,KAAKjpB,IACpCpM,KAAK+2E,QAAQ/2E,KAAK+oE,GAAIzlE,GAKnB4mE,GAAG99D,GACN,MAAM9I,EAAItD,KAAK8nE,GAAGj4D,KAAKzD,GACvB,OAAO9I,EAAIA,EAAE,GAAK,KAKfymE,GAAG39D,EAAG9I,GACT,MAAMoV,EAAI1Y,KAAKkqE,GAAG99D,GAClB,OAAOssE,GAAGlS,GAAG9tD,EAAGpV,GAKb8mE,GAAGh+D,EAAG9I,GACT,MAAMoV,EAAI1Y,KAAK2oE,GAAG94D,KAAKzD,GAAI3B,EAAIoV,OAAOnH,EAAE,IAAKrZ,OAAI,IAAWqZ,EAAE,GAAKA,EAAE,GAAK,KAC1E,OAAO8/D,GAAGhS,GAAG,IAAI32C,GAAExwB,GAAIoL,EAAGnH,GAKvBgnE,GAAGl+D,EAAG9I,GACT,MAAMoV,EAAI1Y,KAAK4oE,GAAG/4D,KAAKzD,GAAI3B,EAAIoV,OAAOnH,EAAE,IACxC,OAAO+/D,GAAGjS,GAAG/7D,EAAGnH,GAKbgmE,GAAGl9D,GACN,OAAOwsE,GAAGpS,GAAGp6D,GAEjB6+D,GAAG7+D,GACC,OAAOzI,KAAKC,MAAMwI,GAEtBo7C,SAASp7C,GACL,GAAIA,EAAE00C,KAAKnC,MAAQ3+C,KAAKshD,YAAY3C,IAAK,OAAO3+C,KAAKg5E,WAAW7N,GAAG/+D,EAAEi/C,QAASj/C,EAAEyH,MAAOzH,EAAE3I,OACzFoX,GAAE,oBAAqB,yCAAyCzO,EAAE00C,KAAKnC,OAE3E4rB,GAAGn+D,GACC,OAAOpM,KAAKg5E,WAAW1N,GAAGl/D,EAAEkyD,SAAUlyD,EAAEyH,MAAOzH,EAAE3I,OAErDumE,GAAG59D,EAAG9I,GACF,MAAMoV,EAAIpV,EAAItD,KAAKonE,GAAGlU,OAAO9mD,EAAG9I,GAAKtD,KAAKonE,GAAGjrD,OAAO/P,GAAI3B,EAAIzK,KAAKwpE,GAAGxpE,KAAKonE,IAAK/nE,EAAIW,KAAKwpE,GAAG9wD,GAAIgpC,EAAI,GAAID,EAAI,GAC1G,OAAOpiD,EAAE6W,SAAS9J,IACd3B,EAAEi0B,IAAItyB,IAAMs1C,EAAEpgD,KAAK8K,MAClB3B,EAAEyL,SAAS9J,IACZ/M,EAAEq/B,IAAItyB,IAAMq1C,EAAEngD,KAAK8K,MAClBpM,KAAKg5E,WAAW5N,GAAG1pB,EAAGD,GAAGtjC,WAC1Bne,KAAKonE,GAAK1uD,KAGlB6wD,GAAGn9D,GAMCpM,KAAKonE,GAAGh4D,IAAIhD,EAAEspE,WAAa11E,KAAKi5E,mBAAmB7sE,EAAEysE,aAEzDrP,GAAGp9D,GACC,IAAI9I,EAAI+5D,KACR,OAAOjxD,EAAE8J,UAAU9J,EAAGsM,KAClBpV,EAAIA,EAAEkyD,UAAU98C,EAAEigE,oBACjBr1E,GAIb,MAAM42E,GACFv0E,cACI3F,KAAKqrE,GAAK,IAAIyN,GAAI94E,KAAK4rE,GAAK,GAAI5rE,KAAKi5E,mBAAqB,KAAMj5E,KAAKwrD,sBAAwB,KAEjG6tB,mBAAmBjtE,IAGnBktE,oBAAoBltE,EAAG9I,EAAGoV,IAG1B6gE,oBAAoBntE,GAChB,OAAOpM,KAAKqrE,GAAG1E,GAAGv6D,GAAIpM,KAAK4rE,GAAGx/D,IAAM,cAExCutE,iBAAiBvtE,EAAG9I,EAAGoV,GACnB1Y,KAAK4rE,GAAGx/D,GAAK9I,EAEjBk2E,uBAAuBptE,GACnBpM,KAAKqrE,GAAGxE,GAAGz6D,GAEfqtE,mBAAmBrtE,GACf,OAAOpM,KAAKqrE,GAAGsN,gBAAgBj6C,IAAItyB,GAEvCstE,gBAAgBttE,UACLpM,KAAK4rE,GAAGx/D,GAEnB+sE,2BACI,OAAOn5E,KAAKqrE,GAAGsN,gBAEnBS,oBAAoBhtE,GAChB,OAAOpM,KAAKqrE,GAAGsN,gBAAgBj6C,IAAItyB,GAEvC2U,QACI,OAAO/gB,KAAKqrE,GAAK,IAAIyN,GAAI76D,QAAQC,UAErC07D,iBAAiBxtE,EAAG9I,EAAGoV,IAGvBmhE,eAAeztE,IAGf80C,YACAuK,oBAAoBr/C,IACpB0tE,mBAAmB1tE,KAoBnB,MAAM+tE,GACNrO,GAAG1/D,IAGH80C,aA0BJ,MAAMk5B,GACFz0E,cACI3F,KAAKmsE,GAAK,IAAMnsE,KAAKysE,KAAMzsE,KAAK0sE,GAAK,IAAM1sE,KAAK4sE,KAAM5sE,KAAK8tE,GAAK,GAAI9tE,KAAKgtE,KAE7ElB,GAAG1/D,GACCpM,KAAK8tE,GAAGxsE,KAAK8K,GAEjB80C,WACIp+C,OAAOyM,oBAAoB,SAAUvP,KAAKmsE,IAAKrpE,OAAOyM,oBAAoB,UAAWvP,KAAK0sE,IAE9FM,KACIlqE,OAAOkM,iBAAiB,SAAUhP,KAAKmsE,IAAKrpE,OAAOkM,iBAAiB,UAAWhP,KAAK0sE,IAExFD,KACI5xD,GAAE,sBAAuB,2CACzB,IAAK,MAAMzO,KAAKpM,KAAK8tE,GAAI1hE,EAAE,GAE/BwgE,KACI/xD,GAAE,sBAAuB,6CACzB,IAAK,MAAMzO,KAAKpM,KAAK8tE,GAAI1hE,EAAE,GAK/Bu2C,WACI,MAAO,oBAAsB7/C,aAAU,IAAWA,OAAOkM,uBAAoB,IAAWlM,OAAOyM,qBAmBnG,MAAM8qE,GAAK,CACXC,kBAAmB,WACnBC,OAAQ,SACRC,SAAU,WACVC,oBAAqB,uBA6BzB,MAAMC,GACF/0E,YAAYyG,GACRpM,KAAKktE,GAAK9gE,EAAE8gE,GAAIltE,KAAK+tE,GAAK3hE,EAAE2hE,GAEhCG,GAAG9hE,GACCpM,KAAKmuE,GAAK/hE,EAEd4iE,GAAG5iE,GACCpM,KAAKsvE,GAAKljE,EAEduuE,UAAUvuE,GACNpM,KAAK2vE,GAAKvjE,EAEd6wC,QACIj9C,KAAK+tE,KAET7hD,KAAK9f,GACDpM,KAAKktE,GAAG9gE,GAEZwjE,KACI5vE,KAAKmuE,KAET2B,GAAG1jE,GACCpM,KAAKsvE,GAAGljE,GAEZ6jE,GAAG7jE,GACCpM,KAAK2vE,GAAGvjE,IAmBZ,MAAMwuE,WAKV,MACIj1E,YAAYyG,GACRpM,KAAK66E,aAAezuE,EAAGpM,KAAK2rD,WAAav/C,EAAEu/C,WAC3C,MAAMroD,EAAI8I,EAAE0/C,IAAM,QAAU,OAC5B9rD,KAAKuwE,GAAKjtE,EAAI,MAAQ8I,EAAE/H,KAAMrE,KAAKywE,GAAK,YAAczwE,KAAK2rD,WAAWM,UAAY,cAAgBjsD,KAAK2rD,WAAWO,SAAW,aAE7H8kB,SAGA,OAAO,EAEXO,GAAGnlE,EAAG9I,EAAGoV,EAAGjO,EAAGpL,GACX,MAAMqiD,EAAI1hD,KAAKuyE,GAAGnmE,EAAG9I,GACrBuX,GAAE,iBAAkB,YAAa6mC,EAAGhpC,GACpC,MAAM+oC,EAAI,GACV,OAAOzhD,KAAKkyE,GAAGzwB,EAAGh3C,EAAGpL,GAAIW,KAAKoyE,GAAGhmE,EAAGs1C,EAAGD,EAAG/oC,GAAGyF,MAAM/R,IAAMyO,GAAE,iBAAkB,aAAczO,GAC3FA,KAAM9I,IACF,MAAMioB,GAAE,iBAAkB,GAAGnf,wBAAyB9I,EAAG,QAASo+C,EAAG,WAAYhpC,GACjFpV,KAGRmuE,GAAGrlE,EAAG9I,EAAGoV,EAAGjO,EAAGpL,EAAGqiD,GAGd,OAAO1hD,KAAKuxE,GAAGnlE,EAAG9I,EAAGoV,EAAGjO,EAAGpL,GAKxB6yE,GAAG9lE,EAAG9I,EAAGoV,GACZtM,EAAE,qBAAuB,eAAiBU,GAK1CV,EAAE,gBAAkB,aAAcpM,KAAK66E,aAAajvB,QAAUx/C,EAAE,oBAAsBpM,KAAK66E,aAAajvB,OACxGtoD,GAAKA,EAAE2oB,QAAQ/V,SAAS,CAAC5S,EAAGoV,IAAMtM,EAAEsM,GAAKpV,IAAKoV,GAAKA,EAAEuT,QAAQ/V,UAAU5S,EAAGoV,IAAMtM,EAAEsM,GAAKpV,IAE3FivE,GAAGnmE,EAAG9I,GACF,MAAMoV,EAAI2hE,GAAGjuE,GACb,MAAO,GAAGpM,KAAKuwE,SAASjtE,KAAKoV,MAGjC/S,YAAYyG,GACRrG,MAAMqG,GAAIpM,KAAKivC,iBAAmB7iC,EAAE6iC,iBAAkBjvC,KAAK+rD,sBAAwB3/C,EAAE2/C,sBACrF/rD,KAAKwuC,gBAAkBpiC,EAAEoiC,gBAE7B4jC,GAAGhmE,EAAG9I,EAAGoV,EAAGjO,GACR,OAAO,IAAIwT,SAAO,CAAG5e,EAAGqiD,KACpB,MAAMD,EAAI,IAAItqB,GACdsqB,EAAEjM,oBAAmB,GAAKiM,EAAEpoC,WAAW6oC,GAAEt8B,eACrC,IACI,OAAQ67B,EAAEvrB,oBACR,KAAKkjB,GAAEn0B,SACL,MAAM3hB,EAAIm+C,EAAErH,kBACZv/B,GAAE,aAAc,gBAAiBlX,KAAKuY,UAAU5Y,IAAKjE,EAAEiE,GACvD,MAEF,KAAK81C,GAAE3zB,QACL5K,GAAE,aAAc,QAAUzO,EAAI,eAAgBs1C,EAAE,IAAIh6B,GAAEjN,GAAEulC,kBAAmB,qBAC3E,MAEF,KAAK5G,GAAE7zB,WACL,MAAM7M,EAAI+oC,EAAEtrB,YACZ,GAAItb,GAAE,aAAc,QAAUzO,EAAI,wBAAyBsM,EAAG,iBAAkB+oC,EAAErrB,mBAClF1d,EAAI,EAAG,CACH,IAAItM,EAAIq1C,EAAErH,kBACV75C,MAAMC,QAAQ4L,KAAOA,EAAIA,EAAE,IAC3B,MAAM9I,EAAI,MAAQ8I,OAAI,EAASA,EAAE3I,MACjC,GAAIH,GAAKA,EAAEgzB,QAAUhzB,EAAEuC,QAAS,CAC5B,MAAMuG,EAAI,SAASA,GACf,MAAM9I,EAAI8I,EAAE0E,cAAcnO,QAAQ,KAAM,KACxC,OAAOwC,OAAOsmB,OAAOhR,IAAG1O,QAAQzI,IAAM,EAAIA,EAAImX,GAAEqlC,QAF1C,CAGRx8C,EAAEgzB,QACJorB,EAAE,IAAIh6B,GAAEtb,EAAG9I,EAAEuC,eACV67C,EAAE,IAAIh6B,GAAEjN,GAAEqlC,QAAS,gCAAkC2B,EAAEtrB,mBAIlEurB,EAAE,IAAIh6B,GAAEjN,GAAEimC,YAAa,uBACvB,MAEF,QACEtU,MAEE,QACNvxB,GAAE,aAAc,QAAUzO,EAAI,oBAGtC,MAAMnK,EAAI0B,KAAKuY,UAAUzR,GACzBg3C,EAAEv1B,KAAK5oB,EAAG,OAAQrB,EAAGyW,EAAG,OAGhCm5D,GAAGzlE,EAAG9I,EAAGoV,GACL,MAAMjO,EAAI,CAAEzK,KAAKuwE,GAAI,IAAK,gCAAiC,IAAKnkE,EAAG,YAAc/M,EC/qZvF,IAAoCs2C,GD+qZ4D+L,E3Bx9YzFl+B,K2Bw9YkGi+B,EAAI,CAGnG1K,mBAAoB,aACpBT,mBAAoB,GACpBN,iBAAkB,CAGdkW,SAAU,YAAYlsD,KAAK2rD,WAAWM,uBAAuBjsD,KAAK2rD,WAAWO,YAEjFpV,aAAa,EACbrI,wBAAwB,EACxBpB,sBAAuB,CAOnBytC,+BAAgC,KAEpC7rC,iBAAkBjvC,KAAKivC,iBACvBC,qBAAsBlvC,KAAK+rD,uBAE/B/rD,KAAKwuC,kBAAoBiT,EAAElT,eAAiB,IAAI/V,GAAE,KAAMx4B,KAAKkyE,GAAGzwB,EAAEnL,mBAAoBhzC,EAAGoV,GAUzF+oC,EAAE3S,0BAA2B,EAC7B,MAAM7sC,EAAIwI,EAAElJ,KAAK,IACjBsZ,GAAE,aAAc,wBAA0B5Y,EAAGw/C,GAC7C,MAAMliD,EAAIF,EAAEm9C,iBAAiBv6C,EAAGw/C,GAMxB,IAAIv6C,GAAI,EAAIwlB,GAAI,EAIhB,MAAM4I,EAAI,IAAIolD,GAAG,CACrBxN,GAAI9gE,IACAsgB,EAAI7R,GAAE,aAAc,4CAA6CzO,IAAMlF,IAAM2T,GAAE,aAAc,iCAC7Ftb,EAAEimC,OAAQt+B,GAAI,GAAK2T,GAAE,aAAc,sBAAuBzO,GAAI7M,EAAE2sB,KAAK9f,KAEzE2hE,GAAI,IAAMxuE,EAAE09C,UACZ9mC,EAAI,CAAC/J,EAAG9I,EAAGoV,KAGXtM,EAAEiM,OAAO/U,GAAI8I,IACT,IACIsM,EAAEtM,GACJ,MAAOA,GACLsR,iBACI,MAAMtR,IACN,QAQR,OAAO+J,EAAE5W,EAAG+iB,GAAE47B,UAAUp3B,MAAI,KAChC4F,GAAK7R,GAAE,aAAc,mCACpB1E,EAAE5W,EAAG+iB,GAAE47B,UAAUn3B,OAAK,KACvB2F,IAAMA,GAAI,EAAI7R,GAAE,aAAc,+BAAgCya,EAAEw6C,SAC/D35D,EAAE5W,EAAG+iB,GAAE47B,UAAU70C,OAAQ+C,IAC1BsgB,IAAMA,GAAI,EAAInB,GAAE,aAAc,gCAAiCnf,GAAIkpB,EAAEw6C,GAAG,IAAIpoD,GAAEjN,GAAEimC,YAAa,6CAC5FvqC,EAAE5W,EAAG+iB,GAAE47B,UAAUl3B,SAAU5a,IAC5B,IAAI9I,EACJ,IAAKopB,EAAG,CACJ,MAAMhU,EAAItM,EAAE5F,KAAK,GACjB+zB,KAAI7hB,GAMJ,MAAMjO,EAAIiO,EAAGrZ,EAAIoL,EAAEhH,QAAU,QAAUH,EAAImH,EAAE,UAAO,IAAWnH,OAAI,EAASA,EAAEG,OAC9E,GAAIpE,EAAG,CACHwb,GAAE,aAAc,6BAA8Bxb,GAE9C,MAAM+M,EAAI/M,EAAEi3B,OACZ,IAAIhzB,EAOJ,SAAS8I,GAGL,MAAM9I,EAAI04D,GAAG5vD,GACb,QAAI,IAAW9I,EAAG,OAAO64D,GAAG74D,GAJhC,CAKE8I,GAAIsM,EAAIrZ,EAAEwG,aACZ,IAAWvC,IAAMA,EAAImX,GAAEgmC,SAAU/nC,EAAI,yBAA2BtM,EAAI,iBAAmB/M,EAAEwG,SAEzF6mB,GAAI,EAAI4I,EAAEw6C,GAAG,IAAIpoD,GAAEpkB,EAAGoV,IAAKnZ,EAAE09C,aAC1BpiC,GAAE,aAAc,uBAAwBnC,GAAI4c,EAAE26C,GAAGv3D,OAE3DvC,EAAEurC,EAAGW,GAAE/9B,YAAalY,IACrBA,EAAEgY,OAAS0vB,GAAUj5B,GAAE,aAAc,4BAA8BzO,EAAEgY,OAAS0vB,IAAaj5B,GAAE,aAAc,kCAC1G6C,YAAU,KAKX4X,EAAEs6C,OACF,GAAIt6C,GAsChB,SAASylD,KAGL,MAAO,oBAAsBj4E,OAASA,OAAS,KAGuB,SAASk4E,KAG/E,MAAO,oBAAsB73E,SAAWA,SAAW,KAkBnD,SAAS83E,GAAG7uE,GACZ,OAAO,IAAIuzD,GAAGvzD,GAAwB,GAe1C,MAAM8uE,GACFv1E,YAIAyG,EAIA9I,EAMAoV,EAAI,IAIEjO,EAAI,IAKJpL,EAAI,KACNW,KAAKqgE,GAAKj0D,EAAGpM,KAAKm7E,QAAU73E,EAAGtD,KAAKiyE,GAAKv5D,EAAG1Y,KAAKwyE,GAAK/nE,EAAGzK,KAAKyyE,GAAKpzE,EAAGW,KAAKyzE,GAAK,EAChFzzE,KAAK0zE,GAAK,KAEV1zE,KAAK4zE,GAAK5pE,KAAKD,MAAO/J,KAAK6c,QAQxBA,QACH7c,KAAKyzE,GAAK,EAKPI,KACH7zE,KAAKyzE,GAAKzzE,KAAKyyE,GAMZqB,GAAG1nE,GAENpM,KAAK83B,SAGL,MAAMx0B,EAAIsH,KAAKixB,MAAM77B,KAAKyzE,GAAKzzE,KAAK+zE,MAAOr7D,EAAI9N,KAAKyH,IAAI,EAAGrI,KAAKD,MAAQ/J,KAAK4zE,IAAKnpE,EAAIG,KAAKyH,IAAI,EAAG/O,EAAIoV,GAE9FjO,EAAI,GAAKoQ,GAAE,qBAAsB,mBAAmBpQ,qBAAqBzK,KAAKyzE,6BAA6BnwE,uBAAuBoV,aAC1I1Y,KAAK0zE,GAAK1zE,KAAKqgE,GAAG9V,kBAAkBvqD,KAAKm7E,QAAS1wE,GAAI,KAAOzK,KAAK4zE,GAAK5pE,KAAKD,MAC5EqC,OAGApM,KAAKyzE,IAAMzzE,KAAKwyE,GAAIxyE,KAAKyzE,GAAKzzE,KAAKiyE,KAAOjyE,KAAKyzE,GAAKzzE,KAAKiyE,IAAKjyE,KAAKyzE,GAAKzzE,KAAKyyE,KAAOzyE,KAAKyzE,GAAKzzE,KAAKyyE,IAEvGwB,KACI,OAASj0E,KAAK0zE,KAAO1zE,KAAK0zE,GAAG0H,YAAap7E,KAAK0zE,GAAK,MAExD57C,SACI,OAAS93B,KAAK0zE,KAAO1zE,KAAK0zE,GAAG57C,SAAU93B,KAAK0zE,GAAK,MAE6BK,KAC9E,OAAQnpE,KAAKC,SAAW,IAAM7K,KAAKyzE,IAoD3C,MAAM4H,GACF11E,YAAYyG,EAAG9I,EAAGoV,EAAGjO,EAAGpL,EAAGqiD,EAAGD,EAAGx/C,GAC7BjC,KAAKqgE,GAAKj0D,EAAGpM,KAAKk0E,GAAKx7D,EAAG1Y,KAAKm0E,GAAK1pE,EAAGzK,KAAKs7E,WAAaj8E,EAAGW,KAAKu7E,wBAA0B75B,EAC3F1hD,KAAKw7E,4BAA8B/5B,EAAGzhD,KAAKyV,SAAWxT,EAAGjC,KAAK6T,MAAQ,EAMtE7T,KAAK00E,GAAK,EAAG10E,KAAK20E,GAAK,KAAM30E,KAAK60E,GAAK,KAAM70E,KAAK82B,OAAS,KAAM92B,KAAKm1E,GAAK,IAAI+F,GAAG9uE,EAAG9I,GAQlFiyE,KACH,OAAO,IAA2Cv1E,KAAK6T,OAAS,IAA0C7T,KAAK6T,OAAS7T,KAAKw1E,KAK1HA,KACH,OAAO,IAAuCx1E,KAAK6T,OAAS,IAA0C7T,KAAK6T,MAQxGkN,QACH,IAAwC/gB,KAAK6T,MAAQ7T,KAAKwhD,OAASxhD,KAAKu2E,KAOrE/uB,aACHxnD,KAAKu1E,YAAcv1E,KAAKi9C,MAAM,GAS3Bo5B,KACHr2E,KAAK6T,MAAQ,EAAwC7T,KAAKm1E,GAAGt4D,QAW1Dm6D,KAGHh3E,KAAKw1E,MAAQ,OAASx1E,KAAK20E,KAAO30E,KAAK20E,GAAK30E,KAAKqgE,GAAG9V,kBAAkBvqD,KAAKk0E,GAAI,KAAM,IAAMl0E,KAAKi3E,QAEhDG,GAAGhrE,GACnDpM,KAAKs3E,KAAMt3E,KAAK82B,OAAO5K,KAAK9f,GAEmDo7C,WAC/E,GAAIxnD,KAAKw1E,KAGT,OAAOx1E,KAAKi9C,MAAM,GAEsBq6B,KACxCt3E,KAAK20E,KAAO30E,KAAK20E,GAAG78C,SAAU93B,KAAK20E,GAAK,MAEU4C,KAClDv3E,KAAK60E,KAAO70E,KAAK60E,GAAG/8C,SAAU93B,KAAK60E,GAAK,MAcrCrtB,YAAYp7C,EAAG9I,GAElBtD,KAAKs3E,KAAMt3E,KAAKu3E,KAAMv3E,KAAKm1E,GAAGr9C,SAG9B93B,KAAK00E,KAAM,IAAwCtoE,EAEnDpM,KAAKm1E,GAAGt4D,QAAUvZ,GAAKA,EAAEsC,OAAS6U,GAAE2lC,oBAEpC/vC,GAAE/M,EAAE+B,YAAagL,GAAE,mEACnBrQ,KAAKm1E,GAAGtB,MAAQvwE,GAAKA,EAAEsC,OAAS6U,GAAEskC,iBAAmB,IAA0C/+C,KAAK6T,QAOpG7T,KAAKu7E,wBAAwBv6B,kBAAmBhhD,KAAKw7E,4BAA4Bx6B,mBAEjF,OAAShhD,KAAK82B,SAAW92B,KAAKw3E,KAAMx3E,KAAK82B,OAAOmmB,QAASj9C,KAAK82B,OAAS,MAGvE92B,KAAK6T,MAAQzH,QAEPpM,KAAKyV,SAASu5D,GAAG1rE,GAKpBk0E,MACPh2B,OACIxhD,KAAK6T,MAAQ,EACb,MAAMzH,EAAIpM,KAAKy7E,GAAGz7E,KAAK00E,IAAKpxE,EAAItD,KAAK00E,GAE7Bz2D,QAAQg8D,IAAI,CAAEj6E,KAAKu7E,wBAAwBx6B,WAAY/gD,KAAKw7E,4BAA4Bz6B,aAAc5iC,MAAM,EAAE/R,EAAGsM,MAKrH1Y,KAAK00E,KAAOpxE,GAIZtD,KAAK23E,GAAGvrE,EAAGsM,MACVpV,IACD8I,QACI,MAAMA,EAAI,IAAIsb,GAAEjN,GAAEqlC,QAAS,+BAAiCx8C,EAAEuC,SAC9D,OAAO7F,KAAK07E,GAAGtvE,SAI3BurE,GAAGvrE,EAAG9I,GACF,MAAMoV,EAAI1Y,KAAKy7E,GAAGz7E,KAAK00E,IACvB10E,KAAK82B,OAAS92B,KAAK43E,GAAGxrE,EAAG9I,GAAItD,KAAK82B,OAAOo3C,SACrCx1D,GAAG,KAAO1Y,KAAK6T,MAAQ,EAAqC7T,KAAK60E,GAAK70E,KAAKqgE,GAAG9V,kBAAkBvqD,KAAKm0E,GAAI,KAAG,KAAUn0E,KAAKw1E,OAASx1E,KAAK6T,MAAQ,GACjJoK,QAAQC,aAAcle,KAAKyV,SAASy4D,WACnCluE,KAAK82B,OAAOk4C,IAAI5iE,IACjBsM,GAAG,IAAM1Y,KAAK07E,GAAGtvE,QAChBpM,KAAK82B,OAAO6jD,WAAWvuE,IACxBsM,GAAG,IAAM1Y,KAAK26E,UAAUvuE,QAGhCmqE,KACIv2E,KAAK6T,MAAQ,EAAwC7T,KAAKm1E,GAAGrB,IAAE,UAC3D9zE,KAAK6T,MAAQ,EAAwC7T,KAAK+gB,WAIlE26D,GAAGtvE,GAKC,OAAOyO,GAAE,mBAAoB,qBAAqBzO,KAAMpM,KAAK82B,OAAS,KAAM92B,KAAKi9C,MAAM,EAAsC7wC,GAO1HqvE,GAAGrvE,GACN,OAAO9I,IACHtD,KAAKqgE,GAAG+V,kBAAkB,IAAMp2E,KAAK00E,KAAOtoE,EAAI9I,KAAOuX,GAAE,mBAAoB,yDAC7EoD,QAAQC,eAWhB,MAAMy9D,WAAWN,GACjB11E,YAAYyG,EAAG9I,EAAGoV,EAAGjO,EAAGpL,EAAGqiD,GACvB37C,MAAMqG,EAAG,mCAAiF,qBAAsD,uBAA0D9I,EAAGoV,EAAGjO,EAAGi3C,GACnN1hD,KAAK0mD,GAAKrnD,EAEdu4E,GAAGxrE,EAAG9I,GACF,OAAOtD,KAAKs7E,WAAWzJ,GAAG,SAAUzlE,EAAG9I,GAE3Cq3E,UAAUvuE,GAENpM,KAAKm1E,GAAGt4D,QACR,MAAMvZ,EAn5Od,SAAY8I,EAAG9I,GACX,IAAIoV,EACJ,GAAI,iBAAkBpV,EAAG,CACrBA,EAAEs4E,aAGF,MAAMnxE,EAAI,SAAS2B,GACf,MAAO,cAAgBA,EAAI,EAA0C,QAAUA,EAAI,EAAuC,WAAaA,EAAI,EAAyC,YAAcA,EAAI,EAAyC,UAAYA,EAAI,EAAuCggC,KADhS,CAER9oC,EAAEs4E,aAAaC,kBAAoB,aAAcx8E,EAAIiE,EAAEs4E,aAAapd,WAAa,GAAI9c,EAAI,SAASt1C,EAAG9I,GACnG,OAAO8I,EAAEo6C,IAAMjsB,QAAE,IAAWj3B,GAAK,iBAAmBA,GAAIwpD,GAAGa,iBAAiBrqD,GAAK,MAAQi3B,QAAE,IAAWj3B,GAAKA,aAAa6jC,YACxH2lB,GAAGc,eAAetqD,GAAK,IAAI6jC,aAF4D,CAGzF/6B,EAAG9I,EAAEs4E,aAAa9d,aAAcrc,EAAIn+C,EAAEs4E,aAAand,MAAOx8D,EAAIw/C,GAAK,SAASr1C,GAC1E,MAAM9I,OAAI,IAAW8I,EAAExG,KAAO6U,GAAEqlC,QAAUqc,GAAG/vD,EAAExG,MAC/C,OAAO,IAAI8hB,GAAEpkB,EAAG8I,EAAEvG,SAAW,IAFoC,CAWxE47C,GACG/oC,EAAI,IAAI6lD,GAAG9zD,EAAGpL,EAAGqiD,EAAGz/C,GAAK,WACtB,GAAI,mBAAoBqB,EAAG,CAC9BA,EAAEw4E,eACF,MAAMrxE,EAAInH,EAAEw4E,eACZrxE,EAAEtH,SAAUsH,EAAEtH,SAAS6C,KAAMyE,EAAEtH,SAASq3D,WACxC,MAAMn7D,EAAI+gE,GAAGh0D,EAAG3B,EAAEtH,SAAS6C,MAAO07C,EAAIqe,GAAGt1D,EAAEtH,SAASq3D,YAAa/Y,EAAIh3C,EAAEtH,SAASgzD,WAAa4J,GAAGt1D,EAAEtH,SAASgzD,YAAcxS,GAAGnS,MAAOvvC,EAAI,IAAI2zD,GAAG,CAC1I9H,SAAU,CACNhI,OAAQr7C,EAAEtH,SAAS2iD,UAEvBvmD,EAAI02D,GAAG0K,iBAAiBthE,EAAGqiD,EAAGD,EAAGx/C,GAAIiF,EAAIuD,EAAE+zD,WAAa,GAAI9xC,EAAIjiB,EAAE2zD,kBAAoB,GAC1F1lD,EAAI,IAAIylD,GAAGj3D,EAAGwlB,EAAGntB,EAAEsH,IAAKtH,QACrB,GAAI,mBAAoB+D,EAAG,CAC9BA,EAAEy4E,eACF,MAAMtxE,EAAInH,EAAEy4E,eACZtxE,EAAEtH,SACF,MAAM9D,EAAI+gE,GAAGh0D,EAAG3B,EAAEtH,UAAWu+C,EAAIj3C,EAAEs8C,SAAWgZ,GAAGt1D,EAAEs8C,UAAYpD,GAAGnS,MAAOiQ,EAAIwU,GAAG+I,cAAc3/D,EAAGqiD,GAAIz/C,EAAIwI,EAAE2zD,kBAAoB,GAC/H1lD,EAAI,IAAIylD,GAAG,GAAIl8D,EAAGw/C,EAAE56C,IAAK46C,QACtB,GAAI,mBAAoBn+C,EAAG,CAC9BA,EAAE04E,eACF,MAAMvxE,EAAInH,EAAE04E,eACZvxE,EAAEtH,SACF,MAAM9D,EAAI+gE,GAAGh0D,EAAG3B,EAAEtH,UAAWu+C,EAAIj3C,EAAE2zD,kBAAoB,GACvD1lD,EAAI,IAAIylD,GAAG,GAAIzc,EAAGriD,EAAG,UAClB,CACH,KAAM,WAAYiE,GAAI,OAAO8oC,KAC7B,CACI9oC,EAAE0hD,OACF,MAAM54C,EAAI9I,EAAE0hD,OACZ54C,EAAEkyD,SACF,MAAM7zD,EAAI2B,EAAEmlC,OAAS,EAAGlyC,EAAI,IAAI08D,GAAGtxD,GAAIi3C,EAAIt1C,EAAEkyD,SAC7C5lD,EAAI,IAAI2lD,GAAG3c,EAAGriD,IAGtB,OAAOqZ,EA21OOo9D,CAAG91E,KAAK0mD,GAAIt6C,GAAIsM,EAAI,SAAStM,GAInC,KAAM,iBAAkBA,GAAI,OAAOu3C,GAAGnS,MACtC,MAAMluC,EAAI8I,EAAEwvE,aACZ,OAAOt4E,EAAEk7D,WAAal7D,EAAEk7D,UAAUl/D,OAASqkD,GAAGnS,MAAQluC,EAAEyjD,SAAWgZ,GAAGz8D,EAAEyjD,UAAYpD,GAAGnS,MAN7D,CAO5BplC,GACF,OAAOpM,KAAKyV,SAASoiE,GAAGv0E,EAAGoV,GAOxBo/D,GAAG1rE,GACN,MAAM9I,EAAI,GACVA,EAAE4oD,SAAWsU,GAAGxgE,KAAK0mD,IAAKpjD,EAAE24E,UAAY,SAAS7vE,EAAG9I,GAChD,IAAIoV,EACJ,MAAMjO,EAAInH,EAAEoL,OACZ,OAAOgK,EAAIg/C,GAAGjtD,GAAK,CACfk3D,UAAWD,GAAGt1D,EAAG3B,IACjB,CACAizB,MAAOkkC,GAAGx1D,EAAG3B,IACdiO,EAAE4lD,SAAWh7D,EAAEg7D,SAAUh7D,EAAEw6D,YAAY1Q,sBAAwB,EAAI10C,EAAEolD,YAAc+B,GAAGzzD,EAAG9I,EAAEw6D,aAAex6D,EAAEi6D,gBAAgB1Z,UAAUF,GAAGnS,OAAS,IAIrJ94B,EAAEquC,SAAW6Y,GAAGxzD,EAAG9I,EAAEi6D,gBAAgBxZ,gBAAiBrrC,EAXlB,CAYtC1Y,KAAK0mD,GAAIt6C,GACX,MAAMsM,EAlqOd,SAAYtM,EAAG9I,GACX,MAAMoV,EAAI,SAAStM,EAAG9I,GAClB,OAAQA,GACN,KAAK,EACH,OAAO,KAET,KAAK,EACH,MAAO,4BAET,KAAK,EACH,MAAO,iBAET,QACE,OAAO8oC,MAZL,CAcR,EAAG9oC,EAAE27D,SACP,OAAO,MAAQvmD,EAAI,KAAO,CACtB,mBAAoBA,GAipOVw9D,CAAGl2E,KAAK0mD,GAAIt6C,GACtBsM,IAAMpV,EAAE44E,OAASxjE,GAAI1Y,KAAKo3E,GAAG9zE,GAK1By0E,GAAG3rE,GACN,MAAM9I,EAAI,GACVA,EAAE4oD,SAAWsU,GAAGxgE,KAAK0mD,IAAKpjD,EAAEy7D,aAAe3yD,EAAGpM,KAAKo3E,GAAG9zE,IAoB1D,MAAM64E,WAAWd,GACjB11E,YAAYyG,EAAG9I,EAAGoV,EAAGjO,EAAGpL,EAAGqiD,GACvB37C,MAAMqG,EAAG,kCAA+E,oBAAoD,uBAA0D9I,EAAGoV,EAAGjO,EAAGi3C,GAC/M1hD,KAAK0mD,GAAKrnD,EAAGW,KAAKg4E,IAAK,EAKhBE,SACP,OAAOl4E,KAAKg4E,GAGhBj3D,QACI/gB,KAAKg4E,IAAK,EAAIh4E,KAAKiuE,qBAAkB,EAAQloE,MAAMgb,QAEvDy2D,KACIx3E,KAAKg4E,IAAMh4E,KAAKm4E,GAAG,IAEvBP,GAAGxrE,EAAG9I,GACF,OAAOtD,KAAKs7E,WAAWzJ,GAAG,QAASzlE,EAAG9I,GAE1Cq3E,UAAUvuE,GACN,GAEAmuB,KAAInuB,EAAEgwE,aAAcp8E,KAAKiuE,gBAAkB7hE,EAAEgwE,YAAap8E,KAAKg4E,GAAI,CAI/Dh4E,KAAKm1E,GAAGt4D,QACR,MAAMvZ,EAt1OlB,SAAY8I,EAAG9I,GACX,OAAO8I,GAAKA,EAAE9M,OAAS,GAAKi7B,QAAE,IAAWj3B,GAAI8I,EAAE0lC,KAAK1lC,GAAK,SAASA,EAAG9I,GAEjE,IAAIoV,EAAItM,EAAEouD,WAAauF,GAAG3zD,EAAEouD,YAAcuF,GAAGz8D,GAC7C,OAAOoV,EAAEomC,QAAQ6E,GAAGnS,SAMpB94B,EAAIqnD,GAAGz8D,IAAK,IAAI+2D,GAAG3hD,EAAGtM,EAAEkuD,kBAAoB,IATS,CAUvDluD,EAAG9I,MAAQ,GA20OK0yE,CAAG5pE,EAAEiwE,aAAcjwE,EAAEkwE,YAAa5jE,EAAIqnD,GAAG3zD,EAAEkwE,YACrD,OAAOt8E,KAAKyV,SAASwiE,GAAGv/D,EAAGpV,GAG/B,OAAOi3B,IAAGnuB,EAAEiwE,cAAgB,IAAMjwE,EAAEiwE,aAAa/8E,QAASU,KAAKg4E,IAAK,EAAIh4E,KAAKyV,SAAS8mE,KAMnFnE,KAGH,MAAMhsE,EAAI,GACVA,EAAE8/C,SAAWsU,GAAGxgE,KAAK0mD,IAAK1mD,KAAKo3E,GAAGhrE,GAEkC+rE,GAAG/rE,GACvE,MAAM9I,EAAI,CACN84E,YAAap8E,KAAKiuE,gBAClBuO,OAAQpwE,EAAE0lC,KAAK1lC,GAAKw0D,GAAG5gE,KAAK0mD,GAAIt6C,MAEpCpM,KAAKo3E,GAAG9zE,IA6BhB,MAAMm5E,WAAW,QACb92E,YAAYyG,EAAG9I,EAAGoV,EAAGjO,GACjB1E,QAAS/F,KAAK08E,gBAAkBtwE,EAAGpM,KAAK28E,oBAAsBr5E,EAAGtD,KAAKs7E,WAAa5iE,EACnF1Y,KAAK0mD,GAAKj8C,EAAGzK,KAAKq4E,IAAK,EAE3BC,KACI,GAAIt4E,KAAKq4E,GAAI,MAAM,IAAI3wD,GAAEjN,GAAE4lC,oBAAqB,2CAEckxB,GAAGnlE,EAAG9I,EAAGoV,GACvE,OAAO1Y,KAAKs4E,KAAMr6D,QAAQg8D,IAAI,CAAEj6E,KAAK08E,gBAAgB37B,WAAY/gD,KAAK28E,oBAAoB57B,aAAc5iC,QAAQ1T,EAAGpL,KAAOW,KAAKs7E,WAAW/J,GAAGnlE,EAAG9I,EAAGoV,EAAGjO,EAAGpL,KAAK2lC,OAAO54B,IACjK,KAAM,kBAAoBA,EAAEpG,MAAQoG,EAAExG,OAAS6U,GAAEskC,kBAAoB/+C,KAAK08E,gBAAgB17B,kBAC1FhhD,KAAK28E,oBAAoB37B,mBAAoB50C,GAAK,IAAIsb,GAAEjN,GAAEqlC,QAAS1zC,EAAE/G,eAGWosE,GAAGrlE,EAAG9I,EAAGoV,EAAGjO,GAChG,OAAOzK,KAAKs4E,KAAMr6D,QAAQg8D,IAAI,CAAEj6E,KAAK08E,gBAAgB37B,WAAY/gD,KAAK28E,oBAAoB57B,aAAc5iC,MAAI,EAAI9e,EAAGqiD,KAAO1hD,KAAKs7E,WAAW7J,GAAGrlE,EAAG9I,EAAGoV,EAAGrZ,EAAGqiD,EAAGj3C,KAAKu6B,OAAO54B,IACpK,KAAM,kBAAoBA,EAAEpG,MAAQoG,EAAExG,OAAS6U,GAAEskC,kBAAoB/+C,KAAK08E,gBAAgB17B,kBAC1FhhD,KAAK28E,oBAAoB37B,mBAAoB50C,GAAK,IAAIsb,GAAEjN,GAAEqlC,QAAS1zC,EAAE/G,eAG7Eu3E,YACI58E,KAAKq4E,IAAK,GAmClB,MAAMwE,GACFl3E,YAAYyG,EAAG9I,GACXtD,KAAKoqD,WAAah+C,EAAGpM,KAAKi5E,mBAAqB31E,EAE/CtD,KAAK6T,MAAQ,UAMb7T,KAAKu4E,GAAK,EAMVv4E,KAAKw4E,GAAK,KAMVx4E,KAAKy4E,IAAK,EAQPC,KACH,IAAM14E,KAAKu4E,KAAOv4E,KAAK44E,GAAG,WAAsC54E,KAAKw4E,GAAKx4E,KAAKoqD,WAAWG,kBAAkB,uBAA0D,KAAG,KAAUvqD,KAAKw4E,GAAK,KAC7Lx4E,KAAK84E,GAAG,6CAA8C94E,KAAK44E,GAAG,WAC9D36D,QAAQC,cAOL66D,GAAG3sE,GACN,WAAsCpM,KAAK6T,MAAQ7T,KAAK44E,GAAG,YAAwC54E,KAAKu4E,KACxGv4E,KAAKu4E,IAAM,IAAMv4E,KAAKk6E,KAAMl6E,KAAK84E,GAAG,iDAAiD1sE,EAAE/G,cACvFrF,KAAK44E,GAAG,aAQLv7D,IAAIjR,GACPpM,KAAKk6E,KAAMl6E,KAAKu4E,GAAK,EAAG,WAAsCnsE,IAG9DpM,KAAKy4E,IAAK,GAAKz4E,KAAK44E,GAAGxsE,GAE3BwsE,GAAGxsE,GACCA,IAAMpM,KAAK6T,QAAU7T,KAAK6T,MAAQzH,EAAGpM,KAAKi5E,mBAAmB7sE,IAEjE0sE,GAAG1sE,GACC,MAAM9I,EAAI,4CAA4C8I,2MACtDpM,KAAKy4E,IAAMpoE,GAAE/M,GAAItD,KAAKy4E,IAAK,GAAM59D,GAAE,qBAAsBvX,GAE7D42E,KACI,OAASl6E,KAAKw4E,KAAOx4E,KAAKw4E,GAAG1gD,SAAU93B,KAAKw4E,GAAK,OAmBrD,MAAMsE,GACNn3E,YAIAyG,EAEA9I,EAAGoV,EAAGjO,EAAGpL,GACLW,KAAKyqD,WAAar+C,EAAGpM,KAAK+8E,UAAYz5E,EAAGtD,KAAKoqD,WAAa1xC,EAAG1Y,KAAKg9E,aAAe,GAkBlFh9E,KAAKm6E,GAAK,GAUVn6E,KAAKo6E,GAAK,IAAIhlD,IAKdp1B,KAAKq6E,GAAK,IAAIjnD,IAQdpzB,KAAK06E,GAAK,GAAI16E,KAAK46E,GAAKv7E,EAAGW,KAAK46E,GAAG9O,IAAI1/D,IACnCsM,EAAE09D,kBAAgB,UAId6G,GAAGj9E,QAAU6a,GAAE,cAAe,6DACxB2sC,eAAep7C,GACjB,MAAM9I,EAAIs8C,GAAExzC,GACZ9I,EAAE+2E,GAAG3iE,IAAI,SAAgDwlE,GAAG55E,GAAIA,EAAEy3E,GAAG19D,IAAI,WACzE/Z,EAAE+2E,GAAG17C,OAAO,SAAgDw+C,GAAG75E,GAH7DkkD,CAIJxnD,aAELA,KAAK+6E,GAAK,IAAI8B,GAAGnkE,EAAGjO,IAIjC+8C,eAAe21B,GAAG/wE,GACd,GAAI6wE,GAAG7wE,GAAI,IAAK,MAAM9I,KAAK8I,EAAEsuE,SAAUp3E,GAAiB,GAMxDkkD,eAAe01B,GAAG9wE,GAClB,IAAK,MAAM9I,KAAK8I,EAAEsuE,SAAUp3E,GAAiB,GAOjD,SAAS85E,GAAGhxE,EAAG9I,GACX,MAAMoV,EAAIknC,GAAExzC,GACZsM,EAAE0hE,GAAG17C,IAAIp7B,EAAEg7D,YAEX5lD,EAAE0hE,GAAG/8D,IAAI/Z,EAAEg7D,SAAUh7D,GAAI+5E,GAAG3kE,GAE5B4kE,GAAG5kE,GAAKqY,GAAGrY,GAAG88D,MAAQ+H,GAAG7kE,EAAGpV,IAM5B,SAASk6E,GAAGpxE,EAAG9I,GACf,MAAMoV,EAAIknC,GAAExzC,GAAI3B,EAAIsmB,GAAGrY,GACvBA,EAAE0hE,GAAGz7C,OAAOr7B,GAAImH,EAAE+qE,MAAQiI,GAAG/kE,EAAGpV,GAAI,IAAMoV,EAAE0hE,GAAG11D,OAASja,EAAE+qE,KAAO/qE,EAAEusE,KAAOiG,GAAGvkE,IAI7EA,EAAEqiE,GAAG19D,IAAI,YAMT,SAASkgE,GAAGnxE,EAAG9I,GACf8I,EAAE4uE,GAAG1vB,GAAGhoD,EAAEg7D,UAAWvtC,GAAG3kB,GAAG0rE,GAAGx0E,GAO9B,SAASm6E,GAAGrxE,EAAG9I,GACf8I,EAAE4uE,GAAG1vB,GAAGhoD,GAAIytB,GAAG3kB,GAAG2rE,GAAGz0E,GAGzB,SAASg6E,GAAGlxE,GACRA,EAAE4uE,GAAK,IAAIpc,GAAG,CACVM,uBAAwB57D,GAAK8I,EAAE4wE,aAAa9d,uBAAuB57D,GACnEqrD,GAAIrrD,GAAK8I,EAAEguE,GAAGhrE,IAAI9L,IAAM,OACxBytB,GAAG3kB,GAAG2U,QAAS3U,EAAE2uE,GAAGrC,KAMxB,SAAS2E,GAAGjxE,GACZ,OAAO6wE,GAAG7wE,KAAO2kB,GAAG3kB,GAAGmpE,MAAQnpE,EAAEguE,GAAG11D,KAAO,EAG/C,SAASu4D,GAAG7wE,GACR,OAAO,IAAMwzC,GAAExzC,GAAGiuE,GAAG31D,KAGzB,SAASg5D,GAAGtxE,GACRA,EAAE4uE,QAAK,EAGXxzB,eAAem2B,GAAGvxE,GACdA,EAAEguE,GAAGlkE,UAAU5S,EAAGoV,KACd6kE,GAAGnxE,EAAG9I,MAIdkkD,eAAeo2B,GAAGxxE,EAAG9I,GACjBo6E,GAAGtxE,GAEHixE,GAAGjxE,IAAMA,EAAE2uE,GAAGhC,GAAGz1E,GAAIg6E,GAAGlxE,IAIxBA,EAAE2uE,GAAG19D,IAAI,WAGbmqC,eAAeq2B,GAAGzxE,EAAG9I,EAAGoV,GACpB,GAEAtM,EAAE2uE,GAAG19D,IAAI,UAAoC/Z,aAAai7D,IAAM,IAA2Cj7D,EAAEuQ,OAASvQ,EAAEm7D,MAGxH,UAGIjX,eAAep7C,EAAG9I,GACd,MAAMoV,EAAIpV,EAAEm7D,MACZ,IAAK,MAAMh0D,KAAKnH,EAAEk7D,UAElBpyD,EAAEguE,GAAG17C,IAAIj0B,WAAa2B,EAAE4wE,aAAac,aAAarzE,EAAGiO,GAAItM,EAAEguE,GAAGz7C,OAAOl0B,GAAI2B,EAAE4uE,GAAGjc,aAAat0D,IAJ/F+8C,CAaHp7C,EAAG9I,GACF,MAAOoV,GACLmC,GAAE,cAAe,mCAAoCvX,EAAEk7D,UAAUj9D,KAAK,KAAMmX,SACtEqlE,GAAG3xE,EAAGsM,QACT,GAAIpV,aAAa66D,GAAK/xD,EAAE4uE,GAAGvuB,GAAGnpD,GAAKA,aAAa+6D,GAAKjyD,EAAE4uE,GAAGntB,GAAGvqD,GAAK8I,EAAE4uE,GAAG1tB,GAAGhqD,IAChFoV,EAAEomC,QAAQ6E,GAAGnS,OAAQ,IAClB,MAAMluC,QAAUq0E,GAAGvrE,EAAEq+C,YACrB/xC,EAAEmrC,UAAUvgD,IAAM,SASlB,SAAS8I,EAAG9I,GACR,MAAMoV,EAAItM,EAAE4uE,GAAG1sB,GAAGhrD,GAGN,OAAOoV,EAAE8kD,cAActnD,SAAO,CAAGwC,EAAGjO,KAC5C,GAAIiO,EAAEolD,YAAY1Q,sBAAwB,EAAG,CACzC,MAAM/tD,EAAI+M,EAAEguE,GAAGhrE,IAAI3E,GAECpL,GAAK+M,EAAEguE,GAAG/8D,IAAI5S,EAAGpL,EAAE2mE,gBAAgBttD,EAAEolD,YAAax6D,QAK9EoV,EAAE+kD,iBAAiBvnD,SAAS5S,IACxB,MAAMoV,EAAItM,EAAEguE,GAAGhrE,IAAI9L,GACnB,IAAKoV,EAEL,OAGgBtM,EAAEguE,GAAG/8D,IAAI/Z,EAAGoV,EAAEstD,gBAAgBlZ,GAAGO,kBAAmB30C,EAAE6kD,kBAGtEkgB,GAAGrxE,EAAG9I,GAKN,MAAMmH,EAAI,IAAIo7D,GAAGntD,EAAEhK,OAAQpL,EAAG,EAAgDoV,EAAE+tC,gBAChF82B,GAAGnxE,EAAG3B,MACL2B,EAAE4wE,aAAagB,iBAAiBtlE,GA9BzC,CA+BEtM,EAAGsM,GACP,MAAOpV,GACLuX,GAAE,cAAe,4BAA6BvX,SAAUy6E,GAAG3xE,EAAG9I,IAYlEkkD,eAAeu2B,GAAG3xE,EAAG9I,EAAGoV,GACxB,IAAKgxC,GAAGpmD,GAAI,MAAMA,EAClB8I,EAAEiuE,GAAG3iE,IAAI,SAEHwlE,GAAG9wE,GAAIA,EAAE2uE,GAAG19D,IAAI,WAAsC3E,IAI5DA,EAAI,IAAMi/D,GAAGvrE,EAAEq+C,aAEfr+C,EAAEg+C,WAAWnJ,4BACTpmC,GAAE,cAAe,mCAAoCnC,IAAKtM,EAAEiuE,GAAG17C,OAAO,SAChEw+C,GAAG/wE,MAOb,SAAS6xE,GAAG7xE,EAAG9I,GACf,OAAOA,IAAI0hC,OAAOtsB,GAAKqlE,GAAG3xE,EAAGsM,EAAGpV,KAGpCkkD,eAAe02B,GAAG9xE,GACd,MAAM9I,EAAIs8C,GAAExzC,GAAIsM,EAAI2S,GAAG/nB,GACvB,IAAImH,EAAInH,EAAE62E,GAAG76E,OAAS,EAAIgE,EAAE62E,GAAG72E,EAAE62E,GAAG76E,OAAS,GAAG+rD,SAAW,EAC3D,KAAM8yB,GAAG76E,IAAM,IACX,MAAM8I,QAAUyrE,GAAGv0E,EAAEmnD,WAAYhgD,GACjC,GAAI,OAAS2B,EAAG,CACZ,IAAM9I,EAAE62E,GAAG76E,QAAUoZ,EAAEs+D,KACvB,MAEJvsE,EAAI2B,EAAEi/C,QAAS+yB,GAAG96E,EAAG8I,GACvB,MAAOA,SACC2xE,GAAGz6E,EAAG8I,GAEhBiyE,GAAG/6E,IAAMg7E,GAAGh7E,GAMZ,SAAS66E,GAAG/xE,GACZ,OAAO6wE,GAAG7wE,IAAMA,EAAE+tE,GAAG76E,OAAS,GAM9B,SAAS8+E,GAAGhyE,EAAG9I,GACf8I,EAAE+tE,GAAG74E,KAAKgC,GACV,MAAMoV,EAAI2S,GAAGjf,GACbsM,EAAE88D,MAAQ98D,EAAEw/D,IAAMx/D,EAAEy/D,GAAG70E,EAAE0hE,WAG7B,SAASqZ,GAAGjyE,GACR,OAAO6wE,GAAG7wE,KAAOif,GAAGjf,GAAGmpE,MAAQnpE,EAAE+tE,GAAG76E,OAAS,EAGjD,SAASg/E,GAAGlyE,GACRif,GAAGjf,GAAG2U,QAGVymC,eAAe+2B,GAAGnyE,GACdif,GAAGjf,GAAGgsE,KAGV5wB,eAAeg3B,GAAGpyE,GACd,MAAM9I,EAAI+nB,GAAGjf,GAET,IAAK,MAAMsM,KAAKtM,EAAE+tE,GAAI72E,EAAE60E,GAAGz/D,EAAEssD,WAGrCxd,eAAei3B,GAAGryE,EAAG9I,EAAGoV,GACpB,MAAMjO,EAAI2B,EAAE+tE,GAAG1sE,QAASpO,EAAIimE,GAAGjwC,KAAK5qB,EAAGnH,EAAGoV,SACpCulE,GAAG7xE,OAAUA,EAAE4wE,aAAa0B,qBAAqBr/E,WAGjD6+E,GAAG9xE,GAGbo7C,eAAem3B,GAAGvyE,EAAG9I,GAGjBA,GAAK+nB,GAAGjf,GAAG8rE,UAEL1wB,eAAep7C,EAAG9I,GAGpB,GAAgB44D,GAAZxjD,EAAIpV,EAAEsC,OAAe8S,IAAM+B,GAAE6lC,QAAS,CAGtC,MAAM5nC,EAAItM,EAAE+tE,GAAG1sE,QAIH4d,GAAGjf,GAAGiqE,WAAY4H,GAAG7xE,GAAC,IAASA,EAAE4wE,aAAa4B,kBAAkBlmE,EAAE2yC,QAAS/nD,WAGjF46E,GAAG9xE,GAEb,IAAIsM,EAfF8uC,CAgBJp7C,EAAG9I,GAGL+6E,GAAGjyE,IAAMkyE,GAAGlyE,GAGhBo7C,eAAeq3B,GAAGzyE,EAAG9I,GACjB,MAAMoV,EAAIknC,GAAExzC,GACZsM,EAAE0xC,WAAW00B,4BAA6BjkE,GAAE,cAAe,wCAC3D,MAAMpQ,EAAIwyE,GAAGvkE,GAITA,EAAE2hE,GAAG3iE,IAAI,SAA8CwlE,GAAGxkE,GAAIjO,GAElEiO,EAAEqiE,GAAG19D,IAAI,iBAA4C3E,EAAEskE,aAAa+B,uBAAuBz7E,GAC3FoV,EAAE2hE,GAAG17C,OAAO,SAA8Cw+C,GAAGzkE,GAK7D8uC,eAAew3B,GAAG5yE,EAAG9I,GACrB,MAAMoV,EAAIknC,GAAExzC,GACZ9I,GAAKoV,EAAE2hE,GAAG17C,OAAO,SAAyCw+C,GAAGzkE,IAAMpV,IAAMoV,EAAE2hE,GAAG3iE,IAAI,SAC5EwlE,GAAGxkE,GAAIA,EAAEqiE,GAAG19D,IAAI,YAUtB,SAAS0T,GAAG3kB,GACZ,OAAOA,EAAE6uE,KAET7uE,EAAE6uE,GAAK,SAAS7uE,EAAG9I,EAAGoV,GAClB,MAAMjO,EAAIm1C,GAAExzC,GACZ,OAAO3B,EAAE6tE,KAAM,IAAIqD,GAAGr4E,EAAGmH,EAAE6wE,WAAY7wE,EAAEiyE,gBAAiBjyE,EAAEkyE,oBAAqBlyE,EAAEi8C,GAAIhuC,GAFpF,CAmBNtM,EAAE2wE,UAAW3wE,EAAEg+C,WAAY,CACxB8jB,GAAIyP,GAAGvyE,KAAK,KAAMgB,GAClB4iE,GAAI4O,GAAGxyE,KAAK,KAAMgB,GAClByrE,GAAIgG,GAAGzyE,KAAK,KAAMgB,KAClBA,EAAEsuE,GAAGp5E,MAAI,MAAEkmD,IACXlkD,GAAK8I,EAAE6uE,GAAG5E,KAAMgH,GAAGjxE,GAAKkxE,GAAGlxE,GAAKA,EAAE2uE,GAAG19D,IAAI,mBAA+CjR,EAAE6uE,GAAGn6D,OAC7F48D,GAAGtxE,QACDA,EAAE6uE,GAUR,SAAS5vD,GAAGjf,GACZ,OAAOA,EAAE8uE,KAET9uE,EAAE8uE,GAAK,SAAS9uE,EAAG9I,EAAGoV,GAClB,MAAMjO,EAAIm1C,GAAExzC,GACZ,OAAO3B,EAAE6tE,KAAM,IAAI6D,GAAG74E,EAAGmH,EAAE6wE,WAAY7wE,EAAEiyE,gBAAiBjyE,EAAEkyE,oBAAqBlyE,EAAEi8C,GAAIhuC,GAFpF,CAGLtM,EAAE2wE,UAAW3wE,EAAEg+C,WAAY,CACzB8jB,GAAIqQ,GAAGnzE,KAAK,KAAMgB,GAClB4iE,GAAI2P,GAAGvzE,KAAK,KAAMgB,GAClBmwE,GAAIiC,GAAGpzE,KAAK,KAAMgB,GAClB6rE,GAAIwG,GAAGrzE,KAAK,KAAMgB,KAClBA,EAAEsuE,GAAGp5E,MAAI,MAAEkmD,IACXlkD,GAAK8I,EAAE8uE,GAAG7E,WAEJ6H,GAAG9xE,WAAaA,EAAE8uE,GAAGp6D,OAAQ1U,EAAE+tE,GAAG76E,OAAS,IAAMub,GAAE,cAAe,8BAA8BzO,EAAE+tE,GAAG76E,yBAC3G8M,EAAE+tE,GAAK,SACL/tE,EAAE8uE,GA8BZ,MAAM1sD,GACF7oB,YAAYyG,EAAG9I,EAAGoV,EAAGjO,EAAGpL,GACpBW,KAAKoqD,WAAah+C,EAAGpM,KAAKm7E,QAAU73E,EAAGtD,KAAKi/E,aAAevmE,EAAG1Y,KAAKixD,GAAKxmD,EAAGzK,KAAKk/E,gBAAkB7/E,EAClGW,KAAKm/E,SAAW,IAAIv+B,GAAG5gD,KAAKme,KAAOne,KAAKm/E,SAASphE,QAAQI,KAAK/S,KAAKpL,KAAKm/E,SAASphE,SAIjF/d,KAAKm/E,SAASphE,QAAQinB,OAAO54B,QAe1Bu2C,yBAAyBv2C,EAAG9I,EAAGoV,EAAGjO,EAAGpL,GACxC,MAAMqiD,EAAI13C,KAAKD,MAAQ2O,EAAG+oC,EAAI,IAAIjzB,GAAGpiB,EAAG9I,EAAGo+C,EAAGj3C,EAAGpL,GACjD,OAAOoiD,EAAE1gC,MAAMrI,GAAI+oC,EAKhB1gC,MAAM3U,GACTpM,KAAKo/E,YAAc1hE,YAAY,IAAM1d,KAAKq/E,sBAAuBjzE,GAK9DgvE,YACH,OAAOp7E,KAAKq/E,qBAQTvnD,OAAO1rB,GACV,OAASpM,KAAKo/E,cAAgBp/E,KAAKyf,eAAgBzf,KAAKm/E,SAASt+B,OAAO,IAAIn5B,GAAEjN,GAAEolC,UAAW,uBAAyBzzC,EAAI,KAAOA,EAAI,OAEvIizE,qBACIr/E,KAAKoqD,WAAWgsB,sBAAwB,OAASp2E,KAAKo/E,aAAep/E,KAAKyf,eAC1Ezf,KAAKixD,KAAK9yC,MAAM/R,GAAKpM,KAAKm/E,SAASjhE,QAAQ9R,MAAQ6R,QAAQC,YAE/DuB,eACI,OAASzf,KAAKo/E,cAAgBp/E,KAAKk/E,gBAAgBl/E,MAAOyf,aAAazf,KAAKo/E,aAC5Ep/E,KAAKo/E,YAAc,OAOvB,SAASlvC,GAAG9jC,EAAG9I,GACf,GAAI+M,GAAE,aAAc,GAAG/M,MAAM8I,KAAMs9C,GAAGt9C,GAAI,OAAO,IAAIsb,GAAEjN,GAAEimC,YAAa,GAAGp9C,MAAM8I,KAC/E,MAAMA,EAwBN,MAAMkjB,GAEN3pB,YAAYyG,GAGRpM,KAAKmkD,WAAa/3C,EAAI,CAAC9I,EAAGoV,IAAMtM,EAAE9I,EAAGoV,IAAM2sC,GAAGlB,WAAW7gD,EAAEuD,IAAK6R,EAAE7R,KAAO,CAACuF,EAAG9I,IAAM+hD,GAAGlB,WAAW/3C,EAAEvF,IAAKvD,EAAEuD,KAC1G7G,KAAKs/E,SAAW1iB,KAAM58D,KAAKu/E,UAAY,IAAIzsB,GAAG9yD,KAAKmkD,YAKhDxB,gBAAgBv2C,GACnB,OAAO,IAAIkjB,GAAGljB,EAAE+3C,YAEpBzlB,IAAItyB,GACA,OAAO,MAAQpM,KAAKs/E,SAASlwE,IAAIhD,GAErCgD,IAAIhD,GACA,OAAOpM,KAAKs/E,SAASlwE,IAAIhD,GAE7B8oD,QACI,OAAOl1D,KAAKu/E,UAAUlsB,SAE1B8B,OACI,OAAOn1D,KAAKu/E,UAAUjsB,SAE1B3O,UACI,OAAO3kD,KAAKu/E,UAAU56B,UAKnB54C,QAAQK,GACX,MAAM9I,EAAItD,KAAKs/E,SAASlwE,IAAIhD,GAC5B,OAAO9I,EAAItD,KAAKu/E,UAAUxzE,QAAQzI,IAAM,EAExCohB,WACA,OAAO1kB,KAAKu/E,UAAU76D,KAEoCxO,QAAQ9J,GAClEpM,KAAKu/E,UAAUhsB,kBAAkB,CAACjwD,EAAGoV,KAAOtM,EAAE9I,IAAI,KAEIoU,IAAItL,GAE1D,MAAM9I,EAAItD,KAAK2+B,OAAOvyB,EAAEvF,KACxB,OAAOvD,EAAE6vD,KAAK7vD,EAAEg8E,SAASpsB,OAAO9mD,EAAEvF,IAAKuF,GAAI9I,EAAEi8E,UAAUrsB,OAAO9mD,EAAG,OAEvBuyB,OAAOvyB,GACjD,MAAM9I,EAAItD,KAAKoP,IAAIhD,GACnB,OAAO9I,EAAItD,KAAKmzD,KAAKnzD,KAAKs/E,SAASnjE,OAAO/P,GAAIpM,KAAKu/E,UAAUpjE,OAAO7Y,IAAMtD,KAE9E8+C,QAAQ1yC,GACJ,KAAMA,aAAakjB,IAAK,OAAO,EAC/B,GAAItvB,KAAK0kB,OAAStY,EAAEsY,KAAM,OAAO,EACjC,MAAMphB,EAAItD,KAAKu/E,UAAU9rB,cAAe/6C,EAAItM,EAAEmzE,UAAU9rB,cACxD,KAAMnwD,EAAE4wD,WAAa,CACjB,MAAM9nD,EAAI9I,EAAE0wD,UAAUntD,IAAK4D,EAAIiO,EAAEs7C,UAAUntD,IAC3C,IAAKuF,EAAE0yC,QAAQr0C,GAAI,OAAO,EAE9B,OAAO,EAEXpF,WACI,MAAM+G,EAAI,GACV,OAAOpM,KAAKkW,SAAS5S,IACjB8I,EAAE9K,KAAKgC,EAAE+B,eACR,IAAM+G,EAAE9M,OAAS,iBAAmB,oBAAsB8M,EAAE7K,KAAK,QAAU,MAEpF4xD,KAAK/mD,EAAG9I,GACJ,MAAMoV,EAAI,IAAI4W,GACd,OAAO5W,EAAEyrC,WAAankD,KAAKmkD,WAAYzrC,EAAE4mE,SAAWlzE,EAAGsM,EAAE6mE,UAAYj8E,EAAGoV,GAuB5E,MAAMk6B,GACNjtC,cACI3F,KAAKq7E,GAAK,IAAIvoB,GAAGzN,GAAGlB,YAExBq7B,MAAMpzE,GACF,MAAM9I,EAAI8I,EAAE8E,IAAIrK,IAAK6R,EAAI1Y,KAAKq7E,GAAGjsE,IAAI9L,GACrCoV,EAEA,IAA6BtM,EAAEpE,MAAQ,IAAgC0Q,EAAE1Q,KAAOhI,KAAKq7E,GAAKr7E,KAAKq7E,GAAGnoB,OAAO5vD,EAAG8I,GAAK,IAAgCA,EAAEpE,MAAQ,IAA+B0Q,EAAE1Q,KAAOhI,KAAKq7E,GAAKr7E,KAAKq7E,GAAGnoB,OAAO5vD,EAAG,CAC3N0E,KAAM0Q,EAAE1Q,KACRkJ,IAAK9E,EAAE8E,MACN,IAAgC9E,EAAEpE,MAAQ,IAAgC0Q,EAAE1Q,KAAOhI,KAAKq7E,GAAKr7E,KAAKq7E,GAAGnoB,OAAO5vD,EAAG,CAChH0E,KAAM,EACNkJ,IAAK9E,EAAE8E,MACN,IAAgC9E,EAAEpE,MAAQ,IAA6B0Q,EAAE1Q,KAAOhI,KAAKq7E,GAAKr7E,KAAKq7E,GAAGnoB,OAAO5vD,EAAG,CAC7G0E,KAAM,EACNkJ,IAAK9E,EAAE8E,MACN,IAA+B9E,EAAEpE,MAAQ,IAA6B0Q,EAAE1Q,KAAOhI,KAAKq7E,GAAKr7E,KAAKq7E,GAAGl/D,OAAO7Y,GAAK,IAA+B8I,EAAEpE,MAAQ,IAAgC0Q,EAAE1Q,KAAOhI,KAAKq7E,GAAKr7E,KAAKq7E,GAAGnoB,OAAO5vD,EAAG,CAC5N0E,KAAM,EACNkJ,IAAKwH,EAAExH,MACN,IAA6B9E,EAAEpE,MAAQ,IAA+B0Q,EAAE1Q,KAAOhI,KAAKq7E,GAAKr7E,KAAKq7E,GAAGnoB,OAAO5vD,EAAG,CAC5G0E,KAAM,EACNkJ,IAAK9E,EAAE8E,MASXk7B,KAAMpsC,KAAKq7E,GAAKr7E,KAAKq7E,GAAGnoB,OAAO5vD,EAAG8I,GAEtCuvE,KACI,MAAMvvE,EAAI,GACV,OAAOpM,KAAKq7E,GAAG9nB,kBAAgB,CAAGjwD,EAAGoV,KACjCtM,EAAE9K,KAAKoX,MACNtM,GAIb,MAAMmmC,GACF5sC,YAAYyG,EAAG9I,EAAGoV,EAAGjO,EAAGpL,EAAGqiD,EAAGD,EAAGx/C,EAAG1C,GAChCS,KAAK09B,MAAQtxB,EAAGpM,KAAKg0E,KAAO1wE,EAAGtD,KAAKy/E,QAAU/mE,EAAG1Y,KAAKm3E,WAAa1sE,EAAGzK,KAAK0/E,YAAcrgF,EACzFW,KAAKk3E,UAAYx1B,EAAG1hD,KAAK2/E,iBAAmBl+B,EAAGzhD,KAAK4/E,wBAA0B39E,EAC9EjC,KAAK6/E,iBAAmBtgF,EAEsDojD,4BAA4Bv2C,EAAG9I,EAAGoV,EAAGjO,EAAGpL,GACtH,MAAMqiD,EAAI,GACV,OAAOp+C,EAAE4S,SAAS9J,IACds1C,EAAEpgD,KAAK,CACH0G,KAAM,EACNkJ,IAAK9E,OAER,IAAImmC,GAAGnmC,EAAG9I,EAAGgsB,GAAGwwD,SAASx8E,GAAIo+C,EAAGhpC,EAAGjO,GAChB,GACO,EAAIpL,GAEnCw3D,uBACA,OAAQ72D,KAAK0/E,YAAY/6B,UAE7B7F,QAAQ1yC,GACJ,KAAMpM,KAAKk3E,YAAc9qE,EAAE8qE,WAAal3E,KAAK6/E,mBAAqBzzE,EAAEyzE,kBAAoB7/E,KAAK2/E,mBAAqBvzE,EAAEuzE,kBAAoB3/E,KAAK0/E,YAAY5gC,QAAQ1yC,EAAEszE,cAAgB9mB,GAAG54D,KAAK09B,MAAOtxB,EAAEsxB,QAAU19B,KAAKg0E,KAAKl1B,QAAQ1yC,EAAE4nE,OAASh0E,KAAKy/E,QAAQ3gC,QAAQ1yC,EAAEqzE,UAAW,OAAO,EACpR,MAAMn8E,EAAItD,KAAKm3E,WAAYz+D,EAAItM,EAAE+qE,WACjC,GAAI7zE,EAAEhE,SAAWoZ,EAAEpZ,OAAQ,OAAO,EAClC,IAAK,IAAI8M,EAAI,EAAGA,EAAI9I,EAAEhE,OAAQ8M,IAAK,GAAI9I,EAAE8I,GAAGpE,OAAS0Q,EAAEtM,GAAGpE,OAAS1E,EAAE8I,GAAG8E,IAAI4tC,QAAQpmC,EAAEtM,GAAG8E,KAAM,OAAO,EACtG,OAAO,GAuBX,MAAMiwB,GACNx7B,cACI3F,KAAKm8E,QAAK,EAAQn8E,KAAK8W,UAAY,IAI3C,MAAM8T,GACFjlB,cACI3F,KAAK+/E,QAAU,IAAI3jB,IAAIhwD,GAAKysD,GAAGzsD,IAAKwsD,IAAK54D,KAAK64E,YAAc,UAC5D74E,KAAKy8E,GAAK,IAAIrpD,KAItBo0B,eAAew4B,GAAG5zE,EAAG9I,GACjB,MAAMoV,EAAIknC,GAAExzC,GAAI3B,EAAInH,EAAEo6B,MACtB,IAAIr+B,GAAI,EAAIqiD,EAAIhpC,EAAEqnE,QAAQ3wE,IAAI3E,GAC9B,GAAIi3C,IAAMriD,GAAI,EAAIqiD,EAAI,IAAIvgB,IAAK9hC,EAAG,IAC9BqiD,EAAEy6B,SAAWzjE,EAAEunE,SAASx1E,GAC1B,MAAO2B,GACL,MAAMsM,EAAIw3B,GAAG9jC,EAAG,4BAA4B0sD,GAAGx1D,EAAEo6B,kBACjD,YAAYp6B,EAAE48E,QAAQxnE,GAEtBA,EAAEqnE,QAAQ1iE,IAAI5S,EAAGi3C,GAAIA,EAAE5qC,UAAUxV,KAAKgC,GAE1CA,EAAE68E,GAAGznE,EAAEmgE,aAAcn3B,EAAEy6B,IACnB74E,EAAEu5E,GAAGn7B,EAAEy6B,KAAOiE,GAAG1nE,GAIzB8uC,eAAelb,GAAGlgC,EAAG9I,GACjB,MAAMoV,EAAIknC,GAAExzC,GAAI3B,EAAInH,EAAEo6B,MACtB,IAAIr+B,GAAI,EACR,MAAMqiD,EAAIhpC,EAAEqnE,QAAQ3wE,IAAI3E,GACxB,GAAIi3C,EAAG,CACH,MAAMt1C,EAAIs1C,EAAE5qC,UAAU/K,QAAQzI,GAC9B8I,GAAK,IAAMs1C,EAAE5qC,UAAUI,OAAO9K,EAAG,GAAI/M,EAAI,IAAMqiD,EAAE5qC,UAAUxX,QAE/D,GAAID,EAAG,OAAOqZ,EAAEqnE,QAAQphD,OAAOl0B,GAAIiO,EAAE2nE,WAAW51E,GAGpD,SAASwiB,GAAG7gB,EAAG9I,GACX,MAAMoV,EAAIknC,GAAExzC,GACZ,IAAI3B,GAAI,EACR,IAAK,MAAM2B,KAAK9I,EAAG,CACf,MAAMA,EAAI8I,EAAEsxB,MAAOr+B,EAAIqZ,EAAEqnE,QAAQ3wE,IAAI9L,GACrC,GAAIjE,EAAG,CACH,IAAK,MAAMiE,KAAKjE,EAAEyX,UAAWxT,EAAEu5E,GAAGzwE,KAAO3B,GAAI,GAC7CpL,EAAE88E,GAAK/vE,GAGf3B,GAAK21E,GAAG1nE,GAGZ,SAASgT,GAAGtf,EAAG9I,EAAGoV,GACd,MAAMjO,EAAIm1C,GAAExzC,GAAI/M,EAAIoL,EAAEs1E,QAAQ3wE,IAAI9L,GAClC,GAAIjE,EAAG,IAAK,MAAM+M,KAAK/M,EAAEyX,UAAW1K,EAAE8zE,QAAQxnE,GAG1CjO,EAAEs1E,QAAQphD,OAAOr7B,GAIzB,SAAS88E,GAAGh0E,GACRA,EAAEqwE,GAAGvmE,SAAS9J,IACVA,EAAEoQ,UASN,MAAM8jE,GACN36E,YAAYyG,EAAG9I,EAAGoV,GACd1Y,KAAK09B,MAAQtxB,EAAGpM,KAAK88E,GAAKx5E,EAK1BtD,KAAKm9E,IAAK,EAAIn9E,KAAKk9E,GAAK,KAAMl9E,KAAK64E,YAAc,UACjD74E,KAAKmP,QAAUuJ,GAAK,GAOjBmkE,GAAGzwE,GACN,IAAKpM,KAAKmP,QAAQoxE,uBAAwB,CAEtC,MAAMj9E,EAAI,GACV,IAAK,MAAMoV,KAAKtM,EAAE+qE,WAAY,IAAgCz+D,EAAE1Q,MAAQ1E,EAAEhC,KAAKoX,GAC/EtM,EAAI,IAAImmC,GAAGnmC,EAAEsxB,MAAOtxB,EAAE4nE,KAAM5nE,EAAEqzE,QAASn8E,EAAG8I,EAAEszE,YAAatzE,EAAE8qE,UAAW9qE,EAAEuzE,kBACzC,EAAIvzE,EAAEyzE,kBAEzC,IAAIv8E,GAAI,EACR,OAAOtD,KAAKm9E,GAAKn9E,KAAKo9E,GAAGhxE,KAAOpM,KAAK88E,GAAGtgE,KAAKpQ,GAAI9I,GAAI,GAAMtD,KAAKw9E,GAAGpxE,EAAGpM,KAAK64E,eAAiB74E,KAAKu9E,GAAGnxE,GACpG9I,GAAI,GAAKtD,KAAKk9E,GAAK9wE,EAAG9I,EAE1B48E,QAAQ9zE,GACJpM,KAAK88E,GAAGr5E,MAAM2I,GAE+B+zE,GAAG/zE,GAChDpM,KAAK64E,YAAczsE,EACnB,IAAI9I,GAAI,EACR,OAAOtD,KAAKk9E,KAAOl9E,KAAKm9E,IAAMn9E,KAAKw9E,GAAGx9E,KAAKk9E,GAAI9wE,KAAOpM,KAAKu9E,GAAGv9E,KAAKk9E,IAAK55E,GAAI,GAC5EA,EAEJk6E,GAAGpxE,EAAG9I,GAEF,IAAK8I,EAAE8qE,UAAW,OAAO,EAGjB,MAAMx+D,EAAI,YAAwCpV,EAGlD,QAAStD,KAAKmP,QAAQsuE,KAAO/kE,MAAQtM,EAAE4nE,KAAKrvB,WAAav4C,EAAEyzE,kBAAoB,YAAwCv8E,GAInI85E,GAAGhxE,GAKC,GAAIA,EAAE+qE,WAAW73E,OAAS,EAAG,OAAO,EACpC,MAAMgE,EAAItD,KAAKk9E,IAAMl9E,KAAKk9E,GAAGrmB,mBAAqBzqD,EAAEyqD,iBACpD,SAAUzqD,EAAEuzE,mBAAqBr8E,KAAM,IAAOtD,KAAKmP,QAAQoxE,uBAK/DhD,GAAGnxE,GACCA,EAAImmC,GAAGiuC,qBAAqBp0E,EAAEsxB,MAAOtxB,EAAE4nE,KAAM5nE,EAAEszE,YAAatzE,EAAE8qE,UAAW9qE,EAAEyzE,kBAC3E7/E,KAAKm9E,IAAK,EAAIn9E,KAAK88E,GAAGtgE,KAAKpQ,IAuB/B,MAAM0oC,GACNnvC,YAAYyG,EAEZ9I,GACItD,KAAKs9E,GAAKlxE,EAAGpM,KAAKygF,WAAan9E,EAEnC+5E,KACI,MAAO,aAAcr9E,KAAKs9E,IAsB9B,MAAMxqC,GACNntC,YAAYyG,GACRpM,KAAK0mD,GAAKt6C,EAEdkmE,GAAGlmE,GACC,OAAOg0D,GAAGpgE,KAAK0mD,GAAIt6C,GAIhB+5D,GAAG/5D,GACN,OAAOA,EAAEkrC,SAASmjB,OAASiG,GAAG1gE,KAAK0mD,GAAIt6C,EAAEjJ,UAAU,GAAM8yD,GAAG+I,cAAch/D,KAAKsyE,GAAGlmE,EAAEkrC,SAAStxC,MAAOhG,KAAKsmE,GAAGl6D,EAAEkrC,SAASyP,WAE3Huf,GAAGl6D,GACC,OAAO2zD,GAAG3zD,IAOd,MAAMs0E,GACN/6E,YAAYyG,EAAG9I,EAAGoV,GACd1Y,KAAKi9E,GAAK7wE,EAAGpM,KAAKyqD,WAAannD,EAAGtD,KAAK0mD,GAAKhuC,EAE5C1Y,KAAK+/E,QAAU,GAEf//E,KAAK2hE,UAAY,GAEjB3hE,KAAK2gF,iBAAmB,IAAIvtD,IAAKpzB,KAAK4gF,SAAW1uC,GAAG9lC,GAOjDsxE,GAAGtxE,GACNpM,KAAK4gF,SAASC,aAAez0E,EAAEq0E,WAC/B,IAAIn9E,EAAItD,KAAK4gF,SAASE,gBACtB,GAAI10E,EAAEkxE,GAAGyD,WAAY/gF,KAAK+/E,QAAQz+E,KAAK8K,EAAEkxE,GAAGyD,iBAAkB,GAAI30E,EAAEkxE,GAAG0D,iBAAkB,CACrFhhF,KAAK2hE,UAAUrgE,KAAK,CAChBg2C,SAAUlrC,EAAEkxE,GAAG0D,mBACf50E,EAAEkxE,GAAG0D,iBAAiBvmB,UAAYn3D,EACtC,MAAMoV,EAAIosC,GAAGQ,WAAWl5C,EAAEkxE,GAAG0D,iBAAiBh7E,MAC9ChG,KAAK2gF,iBAAiBjpE,IAAIgB,EAAEtJ,IAAIsJ,EAAEpZ,OAAS,SACxC8M,EAAEkxE,GAAGn6E,WAAanD,KAAK2hE,UAAU3hE,KAAK2hE,UAAUriE,OAAS,GAAG6D,SAAWiJ,EAAEkxE,GAAGn6E,WACjFG,GACF,OAAOA,IAAMtD,KAAK4gF,SAASE,iBAAmB9gF,KAAK4gF,SAASE,gBAAkBx9E,EAC9E6B,OAAOgrD,OAAO,GAAInwD,KAAK4gF,WAAa,KAExCjD,GAAGvxE,GACC,MAAM9I,EAAI,IAAI8xB,IAAK1c,EAAI,IAAIo6B,GAAG9yC,KAAK0mD,IACnC,IAAK,MAAMj8C,KAAK2B,EAAG,GAAI3B,EAAE6sC,SAASyoC,QAAS,CACvC,MAAM3zE,EAAIsM,EAAE45D,GAAG7nE,EAAE6sC,SAAStxC,MAC1B,IAAK,MAAM0S,KAAKjO,EAAE6sC,SAASyoC,QAAS,CAChC,MAAMt1E,GAAKnH,EAAE8L,IAAIsJ,IAAMykD,MAAMzlD,IAAItL,GACjC9I,EAAE+Z,IAAI3E,EAAGjO,IAGjB,OAAOnH,EAIJkkD,iBACH,MAAMp7C,QAvjFdo7C,eAAkBp7C,EAAG9I,EAAGoV,EAAGjO,GACvB,MAAMpL,EAAIugD,GAAExzC,GACZ,IAAIs1C,EAAIyb,KAAM1b,EAAIib,KAClB,IAAK,MAAMtwD,KAAKsM,EAAG,CACf,MAAMA,EAAIpV,EAAEgvE,GAAGlmE,EAAEkrC,SAAStxC,MAC1BoG,EAAEjJ,WAAau+C,EAAIA,EAAEhqC,IAAIgB,IACzB,MAAMjO,EAAInH,EAAE6iE,GAAG/5D,GACf3B,EAAEisD,YAAYpzD,EAAEgjE,GAAGl6D,EAAEkrC,SAASyP,WAAYtF,EAAIA,EAAEyR,OAAOx6C,EAAGjO,GAE9D,MAAMxI,EAAI5C,EAAEulE,GAAG+L,gBAAgB,CAC3BwB,eAAe,IACf5yE,QAAUu4E,GAAGz4E,EAAG,SAAS+M,GAGzB,OAAOqsD,GAAGN,GAAGrT,GAAGQ,WAAW,mBAAmBl5C,OAH9B,CAIlB3B,IAGE,OAAOpL,EAAEqrD,YAAYC,eAAe,yBAA0B,aAAcv+C,GAAKwrE,GAAGxrE,EAAGnK,EAAGw/C,GAAGjlC,MAAMlZ,IAAMrB,EAAEkJ,MAAMiB,GACrH9I,KAAKkZ,MAAMlZ,GAAKjE,EAAEu/D,GAAGmQ,8BAA8B3iE,EAAG7M,EAAE++D,UAAU9hD,UAAYnd,EAAEu/D,GAAGyQ,gBAAgBjjE,EAAGs1C,EAAGniD,EAAE++D,YAAY9hD,UAAYnd,EAAE2rD,eAAe+nB,wBAAwB3mE,EAAG9I,EAAEoiE,GAAIpiE,EAAEuiE,MAAMrpD,MAAM,IAAMlZ,EAAEoiE,SAoiFvL6W,CAAGv8E,KAAKyqD,WAAY,IAAI3X,GAAG9yC,KAAK0mD,IAAK1mD,KAAK2hE,UAAW3hE,KAAKi9E,GAAG16D,IAAKjf,EAAItD,KAAK29E,GAAG39E,KAAK2hE,WACnG,IAAK,MAAMv1D,KAAKpM,KAAK+/E,cAAe3H,GAAGp4E,KAAKyqD,WAAYr+C,EAAG9I,EAAE8L,IAAIhD,EAAEpG,OACnE,OAAOhG,KAAK4gF,SAASK,UAAY,UAAW,CACxCL,SAAU5gF,KAAK4gF,SACfhD,GAAI59E,KAAK2gF,iBACT9C,GAAIzxE,IAQZ,SAAS8lC,GAAG9lC,GACZ,MAAO,CACH60E,UAAW,UACXH,gBAAiB,EACjBD,YAAa,EACbK,eAAgB90E,EAAE80E,eAClBC,WAAY/0E,EAAE+0E,YAwBtB,MAAMpyD,GACFppB,YAAYyG,GACRpM,KAAK6G,IAAMuF,GAInB,MAAM2xB,GACFp4B,YAAYyG,GACRpM,KAAK6G,IAAMuF,GAQf,MAAMmyB,GACN54B,YAAYyG,EAEZ9I,GACItD,KAAK09B,MAAQtxB,EAAGpM,KAAK+9E,GAAKz6E,EAAGtD,KAAKi+E,GAAK,KAAMj+E,KAAK6/E,kBAAmB,EAOrE7/E,KAAK+9D,SAAU,EAEf/9D,KAAKk+E,GAAK/gB,KAEVn9D,KAAK0/E,YAAcviB,KAAMn9D,KAAKm+E,GAAKllB,GAAG7sD,GAAIpM,KAAKo+E,GAAK,IAAI9uD,GAAGtvB,KAAKm+E,IAKzDE,SACP,OAAOr+E,KAAK+9E,GAWTO,GAAGlyE,EAAG9I,GACT,MAAMoV,EAAIpV,EAAIA,EAAEi7E,GAAK,IAAI3rC,GAAInoC,EAAInH,EAAIA,EAAE86E,GAAKp+E,KAAKo+E,GACjD,IAAI/+E,EAAIiE,EAAIA,EAAEo8E,YAAc1/E,KAAK0/E,YAAah+B,EAAIj3C,EAAGg3C,GAAI,EASzD,MAAMx/C,EAAI,MAA8BjC,KAAK09B,MAAMu6B,WAAaxtD,EAAEia,OAAS1kB,KAAK09B,MAAM2mB,MAAQ55C,EAAE0qD,OAAS,KAAM51D,EAAI,MAA6BS,KAAK09B,MAAMu6B,WAAaxtD,EAAEia,OAAS1kB,KAAK09B,MAAM2mB,MAAQ55C,EAAEyqD,QAAU,KAElN,GAAI9oD,EAAEmnD,mBAAmBnnD,EAAG9I,KACxB,MAAM4D,EAAIuD,EAAE2E,IAAIhD,GAAIsgB,EAAIqsC,GAAG/4D,KAAK09B,MAAOp6B,GAAKA,EAAI,KAAMgyB,IAAMpuB,GAAKlH,KAAK0/E,YAAYhhD,IAAIx3B,EAAEL,KAAMsP,IAAMuW,IAAMA,EAAEiqC,mBAG5G32D,KAAK0/E,YAAYhhD,IAAIhS,EAAE7lB,MAAQ6lB,EAAEkqC,uBACjC,IAAIjgD,GAAI,EAEQzP,GAAKwlB,EACjBxlB,EAAEV,KAAKs4C,QAAQpyB,EAAElmB,MAAQ8uB,IAAMnf,IAAMuC,EAAE8mE,MAAM,CACzCx3E,KAAM,EACNkJ,IAAKwb,IACL/V,GAAI,GAAM3W,KAAKw+E,GAAGt3E,EAAGwlB,KAAOhU,EAAE8mE,MAAM,CACpCx3E,KAAM,EACNkJ,IAAKwb,IACL/V,GAAI,GAAK1U,GAAKjC,KAAKm+E,GAAGzxD,EAAGzqB,GAAK,GAAK1C,GAAKS,KAAKm+E,GAAGzxD,EAAGntB,GAAK,KAI5DkiD,GAAI,KACAv6C,GAAKwlB,GAAKhU,EAAE8mE,MAAM,CACtBx3E,KAAM,EACNkJ,IAAKwb,IACL/V,GAAI,GAAMzP,IAAMwlB,IAAMhU,EAAE8mE,MAAM,CAC9Bx3E,KAAM,EACNkJ,IAAKhK,IACLyP,GAAI,GAAK1U,GAAK1C,KAIlBkiD,GAAI,IACJ9qC,IAAM+V,GAAKg1B,EAAIA,EAAEhqC,IAAIgV,GAAIrtB,EAAI8W,EAAI9W,EAAEqY,IAAItL,GAAK/M,EAAEs/B,OAAOvyB,KAAOs1C,EAAIA,EAAE/iB,OAAOvyB,GAAI/M,EAAIA,EAAEs/B,OAAOvyB,QACzF,OAASpM,KAAK09B,MAAM2mB,MAAO,KAAM3C,EAAEh9B,KAAO1kB,KAAK09B,MAAM2mB,OAAS,CAC/D,MAAMj4C,EAAI,MAA8BpM,KAAK09B,MAAMu6B,UAAYvW,EAAEyT,OAASzT,EAAEwT,QAC5ExT,EAAIA,EAAE/iB,OAAOvyB,EAAEvF,KAAMxH,EAAIA,EAAEs/B,OAAOvyB,EAAEvF,KAAM6R,EAAE8mE,MAAM,CAC9Cx3E,KAAM,EACNkJ,IAAK9E,IAGb,MAAO,CACHgyE,GAAI18B,EACJ68B,GAAI7lE,EACJ2rD,GAAI5iB,EACJi+B,YAAargF,GAGrBm/E,GAAGpyE,EAAG9I,GAQF,OAAO8I,EAAEuqD,mBAAqBrzD,EAAEszD,wBAA0BtzD,EAAEqzD,kBAahEZ,aAAa3pD,EAAG9I,EAAGoV,GACf,MAAMjO,EAAIzK,KAAKo+E,GACfp+E,KAAKo+E,GAAKhyE,EAAEgyE,GAAIp+E,KAAK0/E,YAActzE,EAAEszE,YAErC,MAAMrgF,EAAI+M,EAAEmyE,GAAG5C,KACft8E,EAAEmwD,MAAI,CAAGpjD,EAAG9I,IAAM,SAAS8I,EAAG9I,GAC1B,MAAMoV,EAAItM,IACN,OAAQA,GACN,KAAK,EACH,OAAO,EAET,KAAK,EACL,KAAK,EAIH,OAAO,EAET,KAAK,EACH,OAAO,EAET,QACE,OAAOggC,OAGf,OAAO1zB,EAAEtM,GAAKsM,EAAEpV,GApBF,CAqCrB8I,EAAEpE,KAAM1E,EAAE0E,OAAShI,KAAKm+E,GAAG/xE,EAAE8E,IAAK5N,EAAE4N,OAAQlR,KAAKy+E,GAAG/lE,GACjD,MAAMgpC,EAAIp+C,EAAItD,KAAK2+E,KAAO,GAAIl9B,EAAI,IAAMzhD,KAAKk+E,GAAGx5D,MAAQ1kB,KAAK+9D,QAAU,EAA2B,EAA0B97D,EAAIw/C,IAAMzhD,KAAKi+E,GAC3I,OAAIj+E,KAAKi+E,GAAKx8B,EAAG,IAAMpiD,EAAEC,QAAU2C,EACxB,CACHm/E,SAAU,IAAI7uC,GAAGvyC,KAAK09B,MAAOtxB,EAAEgyE,GAAI3zE,EAAGpL,EAAG+M,EAAEszE,YAAa,IAA4Bj+B,EAAGx/C,GACxD,IAAMyW,GAAKA,EAAEolD,YAAY1Q,sBAAwB,GAChFyxB,GAAIn9B,GAIL,CACHm9B,GAAIn9B,GAMLy+B,GAAG/zE,GACN,OAAOpM,KAAK+9D,SAAW,YAAwC3xD,GAK/DpM,KAAK+9D,SAAU,EAAI/9D,KAAK+1D,aAAa,CACjCqoB,GAAIp+E,KAAKo+E,GACTG,GAAI,IAAI3rC,GACR8sC,YAAa1/E,KAAK0/E,YAClBrb,IAAI,IAEoB,IAAO,CAC/Bwa,GAAI,IAKLG,GAAG5yE,GAEN,OAAQpM,KAAK+9E,GAAGr/C,IAAItyB,MAElBpM,KAAKo+E,GAAG1/C,IAAItyB,KAAOpM,KAAKo+E,GAAGhvE,IAAIhD,GAAGuqD,kBAKjC8nB,GAAGryE,GACNA,IAAMA,EAAE4xD,eAAe9nD,SAAS9J,GAAKpM,KAAK+9E,GAAK/9E,KAAK+9E,GAAGrmE,IAAItL,KAAMA,EAAE6xD,kBAAkB/nD,SAAS9J,QAC9FA,EAAE8xD,iBAAiBhoD,SAAS9J,GAAKpM,KAAK+9E,GAAK/9E,KAAK+9E,GAAGp/C,OAAOvyB,KAAMpM,KAAK+9D,QAAU3xD,EAAE2xD,SAErF4gB,KAEI,IAAK3+E,KAAK+9D,QAAS,MAAO,GAGlB,MAAM3xD,EAAIpM,KAAKk+E,GACvBl+E,KAAKk+E,GAAK/gB,KAAMn9D,KAAKo+E,GAAGloE,SAAS9J,IAC7BpM,KAAKg/E,GAAG5yE,EAAEvF,OAAS7G,KAAKk+E,GAAKl+E,KAAKk+E,GAAGxmE,IAAItL,EAAEvF,SAG/C,MAAMvD,EAAI,GACV,OAAO8I,EAAE8J,SAAS9J,IACdpM,KAAKk+E,GAAGx/C,IAAItyB,IAAM9I,EAAEhC,KAAK,IAAIy8B,GAAG3xB,OAC/BpM,KAAKk+E,GAAGhoE,SAASwC,IAClBtM,EAAEsyB,IAAIhmB,IAAMpV,EAAEhC,KAAK,IAAIytB,GAAGrW,OACzBpV,EAsBTytB,GAAG3kB,GACCpM,KAAK+9E,GAAK3xE,EAAE85D,GAAIlmE,KAAKk+E,GAAK/gB,KAC1B,MAAM75D,EAAItD,KAAKs+E,GAAGlyE,EAAEu1D,WACpB,OAAO3hE,KAAK+1D,aAAazyD,GAA6B,GAQ1D+nB,KACI,OAAOknB,GAAGiuC,qBAAqBxgF,KAAK09B,MAAO19B,KAAKo+E,GAAIp+E,KAAK0/E,YAAa,IAA4B1/E,KAAKi+E,GAAIj+E,KAAK6/E,mBAQxH,MAAMwB,GACF17E,YAIAyG,EAKA9I,EAOAoV,GACI1Y,KAAK09B,MAAQtxB,EAAGpM,KAAKs+D,SAAWh7D,EAAGtD,KAAKshF,KAAO5oE,GAIrB,MAAM22B,GACpC1pC,YAAYyG,GACRpM,KAAK6G,IAAMuF,EAOXpM,KAAKwuB,IAAK,GAgBd,MAAM+yD,GACN57E,YAAYyG,EAAG9I,EAAGoV,EAElBjO,EAAGpL,EAAGqiD,GACF1hD,KAAKyqD,WAAar+C,EAAGpM,KAAKwhF,YAAcl+E,EAAGtD,KAAKyhF,aAAe/oE,EAAG1Y,KAAK0hF,kBAAoBj3E,EAC3FzK,KAAKshD,YAAcjiD,EAAGW,KAAK2hF,8BAAgCjgC,EAAG1hD,KAAKkwC,GAAK,GAAIlwC,KAAKsvB,GAAK,IAAI8sC,IAAIhwD,GAAKysD,GAAGzsD,IAAKwsD,IAC3G54D,KAAK4yC,GAAK,IAAIxd,IAUdp1B,KAAKuyC,GAAK,IAAInf,IAKdpzB,KAAKmhC,GAAK,IAAI2xB,GAAGzN,GAAGlB,YAKpBnkD,KAAK4qB,GAAK,IAAIwK,IAAKp1B,KAAKggF,GAAK,IAAIpM,GAEjC5zE,KAAKssC,GAAK,GAEVtsC,KAAKitB,GAAK,IAAImI,IAAKp1B,KAAK0rB,GAAKwiD,GAAG/U,KAAMn5D,KAAK64E,YAAc,UAIzD74E,KAAKogF,QAAK,EAEVwB,sBACA,OAAO,IAAO5hF,KAAKogF,IAS3B54B,eAAeq6B,GAAGz1E,EAAG9I,GACjB,MAAMoV,EAAInI,GAAGnE,GACb,IAAI3B,EAAGpL,EACP,MAAMqiD,EAAIhpC,EAAE4W,GAAGlgB,IAAI9L,GACnB,GAAIo+C,EAOJj3C,EAAIi3C,EAAE4c,SAAU5lD,EAAEgpE,kBAAkBnI,oBAAoB9uE,GAAIpL,EAAIqiD,EAAE4/B,KAAKj2D,SAAW,CAC9E,MAAMjf,QAAU0rE,GAAGp/D,EAAE+xC,WAAYgO,GAAGn1D,IACpCoV,EAAEkpE,iBAAmBxE,GAAG1kE,EAAE8oE,YAAap1E,GACvC,MAAMs1C,EAAIhpC,EAAEgpE,kBAAkBnI,oBAAoBntE,EAAEkyD,UACpD7zD,EAAI2B,EAAEkyD,SAAUj/D,QAAUyiF,GAAGppE,EAAGpV,EAAGmH,EAAG,YAAci3C,EAAGt1C,EAAE0xD,aAE7D,OAAOz+D,EAMPmoD,eAAes6B,GAAG11E,EAAG9I,EAAGoV,EAAGjO,EAAGpL,GAI9B+M,EAAEk0E,GAAK,CAACh9E,EAAGoV,EAAGjO,IAAM+8C,eAAep7C,EAAG9I,EAAGoV,EAAGjO,GACxC,IAAIpL,EAAIiE,EAAEg+E,KAAKhD,GAAG5lE,GAClBrZ,EAAEglE,KAIFhlE,QAAU24E,GAAG5rE,EAAEq+C,WAAYnnD,EAAEo6B,OACH,GAAIvf,QAAQwjD,UAAWv1D,KAAO9I,EAAEg+E,KAAKhD,GAAGlyE,EAAG/M,MACrE,MAAMqiD,EAAIj3C,GAAKA,EAAE+yD,cAAcpuD,IAAI9L,EAAEg7D,UAAW7c,EAAIn+C,EAAEg+E,KAAKvrB,aAAa12D,EAC5C+M,EAAEw1E,gBAAiBlgC,GAC/C,OAAOqgC,GAAG31E,EAAG9I,EAAEg7D,SAAU7c,EAAEo9B,IAAKp9B,EAAE2/B,SAVlB55B,CAWlBp7C,EAAG9I,EAAGoV,EAAGjO,GACX,MAAMi3C,QAAUs2B,GAAG5rE,EAAEq+C,WAAYnnD,GACP,GAAKm+C,EAAI,IAAIljB,GAAGj7B,EAAGo+C,EAAEwkB,IAAKjkE,EAAIw/C,EAAE68B,GAAG58B,EAAEigB,WAAYpiE,EAAIq+D,GAAGC,8CAA8CnlD,EAAGjO,GAAK,YAAwC2B,EAAEysE,YAAax5E,GAAI6H,EAAIu6C,EAAEsU,aAAa9zD,EAC1LmK,EAAEw1E,gBAAiBriF,GAC/CwiF,GAAG31E,EAAGsM,EAAGxR,EAAE23E,IACX,MAAMnyD,EAAI,IAAI20D,GAAG/9E,EAAGoV,EAAG+oC,GACvB,OAAOr1C,EAAEkjB,GAAGjS,IAAI/Z,EAAGopB,GAAItgB,EAAEwmC,GAAGlU,IAAIhmB,GAAKtM,EAAEwmC,GAAGxjC,IAAIsJ,GAAGpX,KAAKgC,GAAK8I,EAAEwmC,GAAGv1B,IAAI3E,EAAG,CAAEpV,IAAM4D,EAAEk6E,SAGhD55B,eAAejmB,GAAGn1B,EAAG9I,GACtD,MAAMoV,EAAIknC,GAAExzC,GAAI3B,EAAIiO,EAAE4W,GAAGlgB,IAAI9L,GAAIjE,EAAIqZ,EAAEk6B,GAAGxjC,IAAI3E,EAAE6zD,UAChD,GAAIj/D,EAAEC,OAAS,EAAG,OAAOoZ,EAAEk6B,GAAGv1B,IAAI5S,EAAE6zD,SAAUj/D,EAAE2lD,QAAQ54C,IAAMwsD,GAAGxsD,EAAG9I,WAAYoV,EAAE4W,GAAGqP,OAAOr7B,GAEpFoV,EAAEkpE,iBAGNlpE,EAAEgpE,kBAAkBlI,uBAAuB/uE,EAAE6zD,UAC7C5lD,EAAEgpE,kBAAkBtI,oBAAoB3uE,EAAE6zD,iBAAmByZ,GAAGr/D,EAAE+xC,WAAYhgD,EAAE6zD,UACnD,GAAIngD,WAC7BzF,EAAEgpE,kBAAkBhI,gBAAgBjvE,EAAE6zD,UAAWkf,GAAG9kE,EAAE8oE,YAAa/2E,EAAE6zD,UACrE0jB,GAAGtpE,EAAGjO,EAAE6zD,aACRt5B,MAAMyiB,MACPu6B,GAAGtpE,EAAGjO,EAAE6zD,gBAAiByZ,GAAGr/D,EAAE+xC,WAAYhgD,EAAE6zD,UACtB,IA8E7B9W,eAAe/qB,GAAGrwB,EAAG9I,GACrB,MAAMoV,EAAIknC,GAAExzC,GACZ,IACI,MAAMA,QAv1GV,SAAYA,EAAG9I,GACf,MAAMoV,EAAIknC,GAAExzC,GAAI3B,EAAInH,EAAEi6D,gBACtB,IAAIl+D,EAAIqZ,EAAE8rD,GACV,OAAO9rD,EAAEgyC,YAAYC,eAAe,qBAAsB,qBAAsBv+C,IAC5E,MAAMs1C,EAAIhpC,EAAEksD,GAAG+L,gBAAgB,CAC3BwB,eAAe,IAGX9yE,EAAIqZ,EAAE8rD,GACd,MAAM/iB,EAAI,GACVn+C,EAAEk6D,cAActnD,UAAUwrC,EAAGz/C,KACzB,MAAM1C,EAAIF,EAAE+P,IAAInN,GAChB,IAAK1C,EAAG,OAIIkiD,EAAEngD,KAAKoX,EAAEkmD,GAAG4Q,mBAAmBpjE,EAAGs1C,EAAEwc,iBAAkBj8D,GAAGua,MAAI,IAAQ9D,EAAEkmD,GAAGyQ,gBAAgBjjE,EAAGs1C,EAAEsc,eAAgB/7D,MAC3H,IAAIiF,EAAI3H,EAAEwmE,mBAAmB35D,EAAEu4D,uBAC/BrhE,EAAEm6D,iBAAiB/+B,IAAIz8B,GAAKiF,EAAIA,EAAE8+D,gBAAgBlZ,GAAGO,kBAAmB1J,GAAGnS,OAAOy0B,iCAAiCtiB,GAAGnS,OAASkQ,EAAEoc,YAAY1Q,sBAAwB,IAAMlmD,EAAIA,EAAE8+D,gBAAgBtkB,EAAEoc,YAAarzD,IAChNpL,EAAIA,EAAE6zD,OAAOjxD,EAAGiF,GAchB,SAASkF,EAAG9I,EAAGoV,GAEX,OAAI,IAAMtM,EAAE0xD,YAAY1Q,uBAMJ9pD,EAAEi6D,gBAAgBzZ,iBAAmB13C,EAAEmxD,gBAAgBzZ,kBAAoB,KAMxEprC,EAAEslD,eAAet5C,KAAOhM,EAAEulD,kBAAkBv5C,KAAOhM,EAAEwlD,iBAAiBx5C,KAAO,EAdxG,CAkBPnlB,EAAG2H,EAAGw6C,IAAMD,EAAEngD,KAAKoX,EAAEkmD,GAAGiQ,iBAAiBziE,EAAGlF,OAEzC,IAAIjF,EAAIy6D,KAAMn9D,EAAI49D,KAKlB,GAAI75D,EAAEo6D,gBAAgBxnD,SAASzL,IAC3BnH,EAAEq6D,uBAAuBj/B,IAAIj0B,IAAMg3C,EAAEngD,KAAKoX,EAAEgyC,YAAYmiB,kBAAkBiE,oBAAoB1kE,EAAG3B,OAIrGg3C,EAAEngD,KAAKs2E,GAAGxrE,EAAGs1C,EAAGp+C,EAAEo6D,iBAAiBlhD,MAAMpQ,IACrCnK,EAAImK,EAAEs5D,GAAInmE,EAAI6M,EAAEy5D,QACbp7D,EAAEq0C,QAAQ6E,GAAGnS,OAAQ,CACxB,MAAMluC,EAAIoV,EAAEkmD,GAAG0P,6BAA6BliE,GAAGoQ,MAAMlZ,GAAKoV,EAAEkmD,GAAG8P,mBAAmBtiE,EAAGA,EAAEu4D,sBAAuBl6D,KAC9Gg3C,EAAEngD,KAAKgC,GAEX,OAAOokD,GAAGS,QAAQ1G,GAAGjlC,MAAM,IAAMklC,EAAEv2C,MAAMiB,KAAKoQ,MAAM,IAAM9D,EAAEsyC,eAAe+nB,wBAAwB3mE,EAAGnK,EAAG1C,KAAKid,UAAYva,OAC1Hkc,MAAM/R,IAAMsM,EAAE8rD,GAAKnlE,EAAG+M,KAixGNsvE,CAAGhjE,EAAE+xC,WAAYnnD,GAEzBA,EAAEk6D,cAActnD,UAAU9J,EAAG9I,KACjC,MAAMmH,EAAIiO,EAAEkS,GAAGxb,IAAI9L,GACnBmH,IAGA8vB,GAAEnuB,EAAE4xD,eAAet5C,KAAOtY,EAAE6xD,kBAAkBv5C,KAAOtY,EAAE8xD,iBAAiBx5C,MAAQ,GAChFtY,EAAE4xD,eAAet5C,KAAO,EAAIja,EAAE+jB,IAAK,EAAKpiB,EAAE6xD,kBAAkBv5C,KAAO,EAAI6V,GAAE9vB,EAAE+jB,IAAMpiB,EAAE8xD,iBAAiBx5C,KAAO,IAAM6V,GAAE9vB,EAAE+jB,IACrH/jB,EAAE+jB,IAAK,aACAqQ,GAAGnmB,EAAGtM,EAAG9I,GACtB,MAAO8I,SACCq7C,GAAGr7C,IAOb,SAAS2oB,GAAG3oB,EAAG9I,EAAGoV,GAClB,MAAMjO,EAAIm1C,GAAExzC,GAKR,GAAI3B,EAAEm3E,iBAAmB,IAA0ClpE,IAAMjO,EAAEm3E,iBAAmB,IAAgDlpE,EAAG,CACjJ,MAAMtM,EAAI,GACV3B,EAAE6kB,GAAGpZ,UAAUwC,EAAGjO,KACd,MAAMpL,EAAIoL,EAAE62E,KAAKnB,GAAG78E,GACpBjE,EAAE+hF,UAAYh1E,EAAE9K,KAAKjC,EAAE+hF,aACtB,SAASh1E,EAAG9I,GACb,MAAMoV,EAAIknC,GAAExzC,GACZsM,EAAEmgE,YAAcv1E,EAChB,IAAImH,GAAI,EACRiO,EAAEqnE,QAAQ7pE,UAAU9J,EAAGsM,KACnB,IAAK,MAAMtM,KAAKsM,EAAE5B,UAElB1K,EAAE+zE,GAAG78E,KAAOmH,GAAI,MACfA,GAAK21E,GAAG1nE,GARZ,CASHjO,EAAEg3E,aAAcn+E,GAAI8I,EAAE9M,QAAUmL,EAAEylC,GAAG2nC,GAAGzrE,GAAI3B,EAAEouE,YAAcv1E,EAAGmH,EAAEm3E,iBAAmBn3E,EAAEi3E,kBAAkB7H,eAAev2E,IAc7HkkD,eAAey6B,GAAG71E,EAAG9I,EAAGoV,GACxB,MAAMjO,EAAIm1C,GAAExzC,GAER3B,EAAEi3E,kBAAkB/H,iBAAiBr2E,EAAG,WAAYoV,GACxD,MAAMrZ,EAAIoL,EAAEmgB,GAAGxb,IAAI9L,GAAIo+C,EAAIriD,GAAKA,EAAEwH,IAClC,GAAI66C,EAAG,CAOH,IAAIt1C,EAAI,IAAI0mD,GAAGzN,GAAGlB,YAIV/3C,EAAIA,EAAE8mD,OAAOxR,EAAGuU,GAAG+I,cAActd,EAAGiC,GAAGnS,QAC/C,MAAM94B,EAAIykD,KAAKzlD,IAAIgqC,GAAIriD,EAAI,IAAIi+D,GAAG3Z,GAAGnS,MAChB,IAAIpc,IACD,IAAI6/B,GAAGrS,IAAIx2C,EAAGsM,SAChC+jB,GAAGhyB,EAAGpL,GAMZoL,EAAE02B,GAAK12B,EAAE02B,GAAGhlB,OAAOulC,GAAIj3C,EAAEmgB,GAAG+T,OAAOr7B,GAAI4+E,GAAGz3E,cACjCstE,GAAGttE,EAAEggD,WAAYnnD,GACA,GAAI6a,MAAM,IAAM6jE,GAAGv3E,EAAGnH,EAAGoV,KAAKssB,MAAMyiB,IAGtED,eAAe26B,GAAG/1E,EAAG9I,GACjB,MAAMoV,EAAIknC,GAAExzC,GAAI3B,EAAInH,EAAEiiE,MAAMla,QAC5B,IACI,MAAMj/C,QAp+Gd,SAAYA,EAAG9I,GACX,MAAMoV,EAAIknC,GAAExzC,GACZ,OAAOsM,EAAEgyC,YAAYC,eAAe,oBAAqB,qBAAsBv+C,IAC3E,MAAM3B,EAAInH,EAAEiiE,MAAMl+D,OAAQhI,EAAIqZ,EAAEksD,GAAG+L,gBAAgB,CAC/CwB,eAAe,IAEnB,OAAO,SAAS/lE,EAAG9I,EAAGoV,EAAGjO,GACrB,MAAMpL,EAAIqZ,EAAE6sD,MAAO7jB,EAAIriD,EAAEgI,OACzB,IAAIo6C,EAAIiG,GAAGxpC,UACX,OAAOwjC,EAAExrC,SAAS9J,IACdq1C,EAAIA,EAAEjlC,MAAM,IAAM/R,EAAEmmE,SAASttE,EAAG8I,KAAKoQ,MAAMlZ,IACvC,MAAMo+C,EAAIhpC,EAAE+sD,YAAYr2D,IAAIhD,GAC5BmuB,GAAE,OAASmnB,GAAIp+C,EAAE+N,QAAQwyC,UAAUnC,GAAK,IAAMriD,EAAE4lE,sBAAsB3hE,EAAGoV,GAAIpV,EAAEwzD,oBAI/ExzD,EAAEozD,YAAYh+C,EAAE8sD,eAAgB/6D,EAAEymE,SAAS5tE,WAE9Cm+C,EAAEjlC,MAAI,IAAQpQ,EAAEumE,cAAchF,oBAAoBrqE,EAAGjE,KAZvD,CAgBNqZ,EAAGtM,EAAG9I,EAAGjE,GAAGmd,MAAM,IAAMnd,EAAE8L,MAAMiB,KAAKoQ,UAAY9D,EAAEi6D,cAAc9E,wBAAwBzhE,KAAKoQ,MAAI,IAAQ9D,EAAEk6D,qBAAqBxK,yBAAyBh8D,EAAG3B,EAAGnH,EAAEiiE,MAAMla,WAAW7uC,MAAM,IAAM9D,EAAEsyC,eAAeooB,0CAA0ChnE,EAAG,SAASA,GACnQ,IAAI9I,EAAI65D,KACR,IAAK,IAAIzkD,EAAI,EAAGA,EAAItM,EAAE84D,gBAAgB5lE,SAAUoZ,EAC5CtM,EAAE84D,gBAAgBxsD,GAAG4hD,iBAAiBh7D,OAAS,IAAMgE,EAAIA,EAAEoU,IAAItL,EAAEm5D,MAAMP,UAAUtsD,GAAG7R,MAExF,OAAOvD,EALmP,CAYjQA,MAAMkZ,UAAY9D,EAAEsyC,eAAe8nB,aAAa1mE,EAAG3B,QAk8GhCgxE,CAAG/iE,EAAE+xC,WAAYnnD,GAKzB8+E,GAAG1pE,EAAGjO,EAAc,MAAO43E,GAAG3pE,EAAGjO,GAAIiO,EAAEgpE,kBAAkBpI,oBAAoB7uE,EAAG,sBAClFo0B,GAAGnmB,EAAGtM,GACd,MAAOA,SACCq7C,GAAGr7C,IAIjBo7C,eAAe86B,GAAGl2E,EAAG9I,EAAGoV,GACpB,MAAMjO,EAAIm1C,GAAExzC,GACZ,IACI,MAAMA,QAAU,SAASA,EAAG9I,GACxB,MAAMoV,EAAIknC,GAAExzC,GACZ,OAAOsM,EAAEgyC,YAAYC,eAAe,eAAgB,qBAAsBv+C,IACtE,IAAI3B,EACJ,OAAOiO,EAAEi6D,cAAcxF,oBAAoB/gE,EAAG9I,GAAGkZ,MAAMlZ,IAAMi3B,GAAE,OAASj3B,GAAImH,EAAInH,EAAE+D,OAClFqR,EAAEi6D,cAAchF,oBAAoBvhE,EAAG9I,MAAMkZ,UAAY9D,EAAEi6D,cAAc9E,wBAAwBzhE,KAAKoQ,MAAI,IAAQ9D,EAAEk6D,qBAAqBxK,yBAAyBh8D,EAAG3B,EAAGnH,KAAKkZ,MAAI,IAAQ9D,EAAEsyC,eAAeooB,0CAA0ChnE,EAAG3B,KAAK+R,MAAM,IAAM9D,EAAEsyC,eAAe8nB,aAAa1mE,EAAG3B,QALjS,CAanBA,EAAEggD,WAAYnnD,GAKH8+E,GAAG33E,EAAGnH,EAAGoV,GAAI2pE,GAAG53E,EAAGnH,GAAImH,EAAEi3E,kBAAkBpI,oBAAoBh2E,EAAG,WAAYoV,SAChFmmB,GAAGp0B,EAAG2B,GACd,MAAOsM,SACC+uC,GAAG/uC,IA6Bb,SAAS2pE,GAAGj2E,EAAG9I,IACd8I,EAAE6gB,GAAG7d,IAAI9L,IAAM,IAAI4S,SAAS9J,IACzBA,EAAE8R,aACD9R,EAAE6gB,GAAG0R,OAAOr7B,GAG2D,SAAS8+E,GAAGh2E,EAAG9I,EAAGoV,GAC9F,MAAMjO,EAAIm1C,GAAExzC,GACZ,IAAI/M,EAAIoL,EAAE6hC,GAAG7hC,EAAE62C,YAAYzC,SAGvB,GAAIx/C,EAAG,CACP,MAAM+M,EAAI/M,EAAE+P,IAAI9L,GAChB8I,IAAMsM,EAAItM,EAAEy0C,OAAOnoC,GAAKtM,EAAE8R,UAAW7e,EAAIA,EAAE8c,OAAO7Y,IAAKmH,EAAE6hC,GAAG7hC,EAAE62C,YAAYzC,SAAWx/C,GAI7F,SAAS2iF,GAAG51E,EAAG9I,EAAGoV,EAAI,MAClBtM,EAAEs1E,kBAAkBlI,uBAAuBl2E,GAC3C,IAAK,MAAMmH,KAAK2B,EAAEwmC,GAAGxjC,IAAI9L,GAAI8I,EAAEkjB,GAAGqP,OAAOl0B,GAAIiO,GAAKtM,EAAE8jC,GAAG4E,GAAGrqC,EAAGiO,GACzDtM,EAAEwmC,GAAGjU,OAAOr7B,GAAI8I,EAAEw1E,iBAClBx1E,EAAE4zE,GAAG5jB,GAAG94D,GAAG4S,SAAS5S,IAChB8I,EAAE4zE,GAAGvgD,YAAYn8B,IAEjBi/E,GAAGn2E,EAAG9I,MAKlB,SAASi/E,GAAGn2E,EAAG9I,GACX8I,EAAEmmC,GAAG5T,OAAOr7B,EAAE+5B,KAAK0nB,mBAGnB,MAAMrsC,EAAItM,EAAE+0B,GAAG/xB,IAAI9L,GACnB,OAASoV,IAAM8kE,GAAGpxE,EAAEo1E,YAAa9oE,GAAItM,EAAE+0B,GAAK/0B,EAAE+0B,GAAGhlB,OAAO7Y,GAAI8I,EAAEwe,GAAG+T,OAAOjmB,GAAIwpE,GAAG91E,IAGnF,SAAS21E,GAAG31E,EAAG9I,EAAGoV,GACd,IAAK,MAAMjO,KAAKiO,EAAOjO,aAAaskB,IAAI3iB,EAAE4zE,GAAGzQ,aAAa9kE,EAAE5D,IAAKvD,GAAI44B,GAAG9vB,EAAG3B,IAAaA,aAAaszB,IACjGljB,GAAE,aAAc,gCAAkCpQ,EAAE5D,KAAMuF,EAAE4zE,GAAGvQ,gBAAgBhlE,EAAE5D,IAAKvD,GACtF8I,EAAE4zE,GAAGvgD,YAAYh1B,EAAE5D,MAEnB07E,GAAGn2E,EAAG3B,EAAE5D,MACLulC,KAGX,SAASlQ,GAAG9vB,EAAG9I,GACX,MAAMoV,EAAIpV,EAAEuD,IAAK4D,EAAIiO,EAAE2kB,KAAK0nB,kBAC5B34C,EAAE+0B,GAAG/xB,IAAIsJ,IAAMtM,EAAEmmC,GAAG7T,IAAIj0B,KAAOoQ,GAAE,aAAc,0BAA4BnC,GAAItM,EAAEmmC,GAAG76B,IAAIjN,GACxFy3E,GAAG91E,IAUH,SAAS81E,GAAG91E,GACZ,KAAMA,EAAEmmC,GAAG7tB,KAAO,GAAKtY,EAAE+0B,GAAGzc,KAAOtY,EAAEu1E,+BAAiC,CAClE,MAAMr+E,EAAI8I,EAAEmmC,GAAG9mB,SAASjP,OAAO1V,MAC/BsF,EAAEmmC,GAAG5T,OAAOr7B,GACZ,MAAMoV,EAAI,IAAI2sC,GAAGP,GAAGQ,WAAWhiD,IAAKmH,EAAI2B,EAAEsf,GAAGlP,OAC7CpQ,EAAEwe,GAAGvN,IAAI5S,EAAG,IAAI4kC,GAAG32B,IAAKtM,EAAE+0B,GAAK/0B,EAAE+0B,GAAG+xB,OAAOx6C,EAAGjO,GAAI2yE,GAAGhxE,EAAEo1E,YAAa,IAAI3b,GAAGpN,GAAGN,GAAGz/C,EAAE2kB,OAAQ5yB,EAAG,EAAwC6gD,GAAG1F,MAIjJ4B,eAAe3oB,GAAGzyB,EAAG9I,EAAGoV,GACpB,MAAMjO,EAAIm1C,GAAExzC,GAAI/M,EAAI,GAAIqiD,EAAI,GAAID,EAAI,GACpCh3C,EAAE6kB,GAAGq1B,YAAcl6C,EAAE6kB,GAAGpZ,SAAO,CAAG9J,EAAGnK,KACjCw/C,EAAEngD,KAAKmJ,EAAE61E,GAAGr+E,EAAGqB,EAAGoV,GAAGyF,MAAM/R,IAEvB,IAGCA,GAAKsM,IAAMjO,EAAEm3E,iBAAmBn3E,EAAEi3E,kBAAkB/H,iBAAiB13E,EAAEq8D,UAAW,MAAQlyD,OAAI,EAASA,EAAE8qE,WAAa,cAAgB,WACvI9qE,EAAG,CACC/M,EAAEiC,KAAK8K,GACP,MAAM9I,EAAI2zE,GAAGnT,GAAG7hE,EAAEq8D,SAAUlyD,GAC5Bs1C,EAAEpgD,KAAKgC,iBAGR2a,QAAQg8D,IAAIx4B,GAAIh3C,EAAEylC,GAAG2nC,GAAGx4E,SAAUmoD,eAAep7C,EAAG9I,GAC3D,MAAMoV,EAAIknC,GAAExzC,GACZ,UACUsM,EAAEgyC,YAAYC,eAAe,yBAA0B,aAAcv+C,GAAKs7C,GAAGxxC,QAAQ5S,GAAIA,GAAKokD,GAAGxxC,QAAQ5S,EAAEsgE,IAAKn5D,GAAKiO,EAAEgyC,YAAYmiB,kBAAkB0C,aAAanjE,EAAG9I,EAAEg7D,SAAU7zD,KAAK+R,MAAI,IAAQkrC,GAAGxxC,QAAQ5S,EAAEugE,IAAKp5D,GAAKiO,EAAEgyC,YAAYmiB,kBAAkB4C,gBAAgBrjE,EAAG9I,EAAEg7D,SAAU7zD,WAChS,MAAO2B,GACL,IAAKs9C,GAAGt9C,GAAI,MAAMA,EAKlByO,GAAE,aAAc,sCAAwCzO,GAE5D,IAAK,MAAMA,KAAK9I,EAAG,CACf,MAAMA,EAAI8I,EAAEkyD,SACZ,IAAKlyD,EAAE8qE,UAAW,CACd,MAAM9qE,EAAIsM,EAAE8rD,GAAGp1D,IAAI9L,GAAImH,EAAI2B,EAAEmxD,gBAAiBl+D,EAAI+M,EAAE65D,iCAAiCx7D,GAErEiO,EAAE8rD,GAAK9rD,EAAE8rD,GAAGtR,OAAO5vD,EAAGjE,KAjBLmoD,CAoB3C/8C,EAAEggD,WAAY/I,IAGpB8F,eAAeg7B,GAAGp2E,EAAG9I,GACjB,MAAMoV,EAAIknC,GAAExzC,GACZ,IAAKsM,EAAE4oC,YAAYxC,QAAQx7C,GAAI,CAC3BuX,GAAE,aAAc,yBAA0BvX,EAAEu7C,SAC5C,MAAMzyC,QAAUorE,GAAG9+D,EAAE+xC,WAAYnnD,GACjCoV,EAAE4oC,YAAch+C,EAEhB,SAAS8I,EAAG9I,GACR8I,EAAE6gB,GAAG/W,SAAS9J,IACVA,EAAE8J,SAAS9J,IACPA,EAAEy0C,OAAO,IAAIn5B,GAAEjN,GAAEolC,UAGxB,2EADIzzC,EAAE6gB,GAAGmX,QALd,CAME1rB,GAEFA,EAAEgpE,kBAAkB9H,iBAAiBt2E,EAAG8I,EAAEqrE,gBAAiBrrE,EAAEsrE,qBAAsB74C,GAAGnmB,EAAGtM,EAAEk5D,KAInG,SAASrsC,GAAG7sB,EAAG9I,GACX,MAAMoV,EAAIknC,GAAExzC,GAAI3B,EAAIiO,EAAEkS,GAAGxb,IAAI9L,GAC7B,GAAImH,GAAKA,EAAE+jB,GAAI,OAAO2uC,KAAKzlD,IAAIjN,EAAE5D,KACjC,CACI,IAAIuF,EAAI+wD,KACR,MAAM1yD,EAAIiO,EAAEk6B,GAAGxjC,IAAI9L,GACnB,IAAKmH,EAAG,OAAO2B,EACf,IAAK,MAAM9I,KAAKmH,EAAG,CACf,MAAMA,EAAIiO,EAAE4W,GAAGlgB,IAAI9L,GACnB8I,EAAIA,EAAEopD,UAAU/qD,EAAE62E,KAAKjD,IAE3B,OAAOjyE,GAOXo7C,eAAei7B,GAAGr2E,EAAG9I,GACrB,MAAMoV,EAAIknC,GAAExzC,GAAI3B,QAAUutE,GAAGt/D,EAAE+xC,WAAYnnD,EAAEo6B,OACnB,GAAKr+B,EAAIiE,EAAEg+E,KAAKvwD,GAAGtmB,GAC7C,OAAOiO,EAAEkpE,iBAAmBG,GAAGrpE,EAAGpV,EAAEg7D,SAAUj/D,EAAEw/E,IAAKx/E,EAQzDmoD,eAAe36B,GAAGzgB,EAAG9I,GACjB,MAAMoV,EAAIknC,GAAExzC,GACZ,OAAO+rE,GAAGz/D,EAAE+xC,WAAYnnD,GAAG6a,MAAM/R,GAAKyyB,GAAGnmB,EAAGtM,KAKhDo7C,eAAevnB,GAAG7zB,EAAG9I,EAAGoV,EAAGjO,GACvB,MAAMpL,EAAIugD,GAAExzC,GAAIs1C,QAAU,SAASt1C,EAAG9I,GAClC,MAAMoV,EAAIknC,GAAExzC,GAAI3B,EAAIm1C,GAAElnC,EAAEi6D,eACxB,OAAOj6D,EAAEgyC,YAAYC,eAAe,4BAA6B,YAAav+C,GAAK3B,EAAEouD,GAAGzsD,EAAG9I,GAAGkZ,MAAMlZ,GAAKA,EAAIoV,EAAEsyC,eAAe8nB,aAAa1mE,EAAG9I,GAAKokD,GAAGxpC,QAAQ,UAFxI,CAKzB7e,EAAEorD,WAAYnnD,GACf,OAASo+C,GAAK,YAAchpC,QAItBwlE,GAAG7+E,EAAEmiF,aAAe,iBAAmB9oE,GAAK,aAAeA,GAGjE0pE,GAAG/iF,EAAGiE,EAAGmH,GAAK,MAAO43E,GAAGhjF,EAAGiE,GAAI,SAAS8I,EAAG9I,GACvCs8C,GAAEA,GAAExzC,GAAGumE,eAAe5Z,GAAGz1D,GADE,CAI9BjE,EAAEorD,WAAYnnD,IAAM8oC,WAAWvN,GAAGx/B,EAAGqiD,IAQtC7mC,GAAE,aAAc,wCAA0CvX,GA+C9DkkD,eAAe5sB,GAAGxuB,EAAG9I,EAAGoV,GACpB,MAAMjO,EAAIm1C,GAAExzC,GAAI/M,EAAI,GAAIqiD,EAAI,GAC5B,IAAK,MAAMt1C,KAAK9I,EAAG,CACf,IAAIA,EACJ,MAAMoV,EAAIjO,EAAEmoC,GAAGxjC,IAAIhD,GACnB,GAAIsM,GAAK,IAAMA,EAAEpZ,OAAQ,CAKrBgE,QAAUw0E,GAAGrtE,EAAEggD,WAAYgO,GAAG//C,EAAE,KAChC,IAAK,MAAMtM,KAAKsM,EAAG,CACf,MAAMpV,EAAImH,EAAE6kB,GAAGlgB,IAAIhD,GAAIsM,QAAU+pE,GAAGh4E,EAAGnH,GACvCoV,EAAE0oE,UAAY1/B,EAAEpgD,KAAKoX,EAAE0oE,eAExB,CAGH,MAAM1oE,QAAUw/D,GAAGztE,EAAEggD,WAAYr+C,GACjC9I,QAAUw0E,GAAGrtE,EAAEggD,WAAY/xC,SAAUopE,GAAGr3E,EAAGivB,GAAGhhB,GAAItM,GACrC,EAAI9I,EAAEw6D,aAEvBz+D,EAAEiC,KAAKgC,GAEX,OAAOmH,EAAEylC,GAAG2nC,GAAGn2B,GAAIriD,EAcvB,SAASq6B,GAAGttB,GACR,OAAO8rD,GAAG9rD,EAAEixB,KAAMjxB,EAAEo5C,gBAAiBp5C,EAAEgrD,QAAShrD,EAAE4lD,QAAS5lD,EAAEi4C,MAAO,IAA4Bj4C,EAAEirD,QAASjrD,EAAEkrD,OAKjH,SAASt2B,GAAG50B,GACR,MAAM9I,EAAIs8C,GAAExzC,GACZ,OAAOwzC,GAAEA,GAAEt8C,EAAEmnD,YAAYC,aAAagZ,KAK1Clc,eAAek7B,GAAGt2E,EAAG9I,EAAGoV,EAAGjO,GACvB,MAAMpL,EAAIugD,GAAExzC,GACZ,GAAI/M,EAAE+gF,GAGN,YAAYvlE,GAAE,aAAc,iDAC5B,MAAM6mC,EAAIriD,EAAEuzC,GAAGxjC,IAAI9L,GACnB,GAAIo+C,GAAKA,EAAEpiD,OAAS,EAAG,OAAQoZ,GAC7B,IAAK,UACL,IAAK,cACH,CACI,MAAMtM,QAAU+rE,GAAG94E,EAAEorD,WAAYuO,GAAGtX,EAAE,KAAMj3C,EAAI6yD,GAAGqlB,6CAA6Cr/E,EAAG,YAAcoV,EAAGo0C,GAAGO,yBACjHxuB,GAAGx/B,EAAG+M,EAAG3B,GACf,MAGN,IAAK,iBACGstE,GAAG14E,EAAEorD,WAAYnnD,GACO,GAAK0+E,GAAG3iF,EAAGiE,EAAGmH,GAC5C,MAEF,QACE2hC,MAI8Dob,eAAe9lB,GAAGt1B,EAAG9I,EAAGoV,GAC1F,MAAMjO,EAAI8F,GAAGnE,GACb,GAAI3B,EAAE21E,GAAI,CACN,IAAK,MAAMh0E,KAAK9I,EAAG,CACf,GAAImH,EAAEmoC,GAAGlU,IAAItyB,GAAI,CAEbyO,GAAE,aAAc,mCAAqCzO,GACrD,SAEJ,MAAM9I,QAAU40E,GAAGztE,EAAEggD,WAAYr+C,GAAIsM,QAAUo/D,GAAGrtE,EAAEggD,WAAYnnD,SAC1Dw+E,GAAGr3E,EAAGivB,GAAGp2B,GAAIoV,EAAE4lD,UACR,EAAI5lD,EAAEolD,aAAcsf,GAAG3yE,EAAE+2E,YAAa9oE,GAEvD,IAAK,MAAMtM,KAAKsM,EAGhBjO,EAAEmoC,GAAGlU,IAAItyB,UAEH2rE,GAAGttE,EAAEggD,WAAYr+C,GACO,GAAI+R,WAC9Bq/D,GAAG/yE,EAAE+2E,YAAap1E,GAAI41E,GAAGv3E,EAAG2B,MAC5B44B,MAAMyiB,KAIlB,SAASl3C,GAAGnE,GACR,MAAM9I,EAAIs8C,GAAExzC,GACZ,OAAO9I,EAAEk+E,YAAYxE,aAAagB,iBAAmBvhD,GAAGrxB,KAAK,KAAM9H,GAAIA,EAAEk+E,YAAYxE,aAAa9d,uBAAyBjmC,GAAG7tB,KAAK,KAAM9H,GACzIA,EAAEk+E,YAAYxE,aAAac,aAAemE,GAAG72E,KAAK,KAAM9H,GAAIA,EAAE4sC,GAAG2nC,GAAK5qD,GAAG7hB,KAAK,KAAM9H,EAAEm+E,cACtFn+E,EAAE4sC,GAAG4E,GAAKppB,GAAGtgB,KAAK,KAAM9H,EAAEm+E,cAAen+E,EAG7C,SAASs/E,GAAGx2E,GACR,MAAM9I,EAAIs8C,GAAExzC,GACZ,OAAO9I,EAAEk+E,YAAYxE,aAAa0B,qBAAuByD,GAAG/2E,KAAK,KAAM9H,GAAIA,EAAEk+E,YAAYxE,aAAa4B,kBAAoB0D,GAAGl3E,KAAK,KAAM9H,GACxIA,EAgFJ,MAAM4M,GACFvK,cACI3F,KAAK6iF,iBAAkB,EAE3Br7B,iBAAiBp7C,GACbpM,KAAK0mD,GAAKu0B,GAAG7uE,EAAEyuE,aAAalvB,YAAa3rD,KAAK0hF,kBAAoB1hF,KAAK0gF,GAAGt0E,GAAIpM,KAAK0qD,YAAc1qD,KAAKkyC,GAAG9lC,SACnGpM,KAAK0qD,YAAY3pC,QAAS/gB,KAAKyqD,WAAazqD,KAAK+9B,GAAG3xB,GAAIpM,KAAK8iF,YAAc9iF,KAAKu+B,GAAGnyB,EAAGpM,KAAKyqD,YACjGzqD,KAAK+iF,yBAA2B/iF,KAAKqhF,GAAGj1E,EAAGpM,KAAKyqD,YAEpDlsB,GAAGnyB,EAAG9I,GACF,OAAO,KAEX+9E,GAAGj1E,EAAG9I,GACF,OAAO,KAEXy6B,GAAG3xB,GACC,OAAOmrE,GAAGv3E,KAAK0qD,YAAa,IAAI0sB,GAAIhrE,EAAE42E,YAAahjF,KAAK0mD,IAE5DxU,GAAG9lC,GACC,OAAO,IAAI+nE,GAAGQ,GAAG9U,GAAI7/D,KAAK0mD,IAE9Bg6B,GAAGt0E,GACC,OAAO,IAAI8tE,GAEf1yB,kBACIxnD,KAAK8iF,aAAe9iF,KAAK8iF,YAAYhiE,aAAc9gB,KAAK0hF,kBAAkBxgC,iBACpElhD,KAAK0qD,YAAYxJ,YAM3B,MAAMh1C,WAAWgE,GACjBvK,YAAYyG,EAAG9I,EAAGoV,GACd3S,QAAS/F,KAAKqvC,GAAKjjC,EAAGpM,KAAKijF,eAAiB3/E,EAAGtD,KAAKkjF,eAAiBxqE,EAAG1Y,KAAK6iF,iBAAkB,EAEnGr7B,iBAAiBp7C,SACPrG,MAAMsxE,WAAWjrE,SAAUpM,KAAKqvC,GAAGgoC,WAAWr3E,KAAMoM,SAEpDw2E,GAAG5iF,KAAKqvC,GAAG2pC,kBAAmBkF,GAAGl+E,KAAKqvC,GAAGmyC,mBAGzCxhF,KAAK0qD,YAAYyX,IAAI,KAAOniE,KAAK8iF,cAAgB9iF,KAAK8iF,YAAYx4B,SAAWtqD,KAAK8iF,YAAY/hE,QACpG/gB,KAAK+iF,2BAA6B/iF,KAAK+iF,yBAAyBz4B,SAAWtqD,KAAK+iF,yBAAyBhiE,QACzG9C,QAAQC,aAEZ6f,GAAG3xB,GACC,OAAOmrE,GAAGv3E,KAAK0qD,YAAa,IAAI0sB,GAAIhrE,EAAE42E,YAAahjF,KAAK0mD,IAE5DnoB,GAAGnyB,EAAG9I,GACF,MAAMoV,EAAI1Y,KAAK0qD,YAAYmiB,kBAAkBkD,iBAC7C,OAAO,IAAID,GAAGp3D,EAAGtM,EAAEg+C,WAAY9mD,GAEnC+9E,GAAGj1E,EAAG9I,GACF,MAAMoV,EAAI,IAAI8xC,GAAGlnD,EAAGtD,KAAK0qD,aACzB,OAAO,IAAIP,GAAG/9C,EAAEg+C,WAAY1xC,GAEhCw5B,GAAG9lC,GACC,MAAM9I,EAAI0zE,GAAG5qE,EAAEyuE,aAAalvB,WAAYv/C,EAAEyuE,aAAahvB,gBAAiBnzC,OAAI,IAAW1Y,KAAKijF,eAAiB9W,GAAGgX,cAAcnjF,KAAKijF,gBAAkB9W,GAAGviC,QACxJ,OAAO,IAAI4rC,GAAGx1E,KAAK6iF,gBAAiBv/E,EAAG8I,EAAEspE,SAAUh9D,EAAGtM,EAAEg+C,WAAY2wB,KAAMC,KAAMh7E,KAAK0mD,GAAI1mD,KAAK0hF,oBAAqB1hF,KAAKkjF,gBAE5HxC,GAAGt0E,GACC,OAAO,IAAI8tE,IAWf,MAAMpqE,WAAW5D,GACjBvG,YAAYyG,EAAG9I,GACXyC,MAAMqG,EAAG9I,GAAyB,GAAKtD,KAAKqvC,GAAKjjC,EAAGpM,KAAKijF,eAAiB3/E,EAAGtD,KAAK6iF,iBAAkB,EAExGr7B,iBAAiBp7C,SACPrG,MAAMsxE,WAAWjrE,GACvB,MAAM9I,EAAItD,KAAKqvC,GAAG2pC,WAClBh5E,KAAK0hF,6BAA6B3I,KAAO/4E,KAAK0hF,kBAAkB1I,WAAa,CACzE7N,GAAIlrC,GAAG70B,KAAK,KAAM9H,GAClBgoE,GAAIoX,GAAGt3E,KAAK,KAAM9H,GAClB8nE,GAAI1pC,GAAGt2B,KAAK,KAAM9H,GAClBogE,GAAI1iC,GAAG51B,KAAK,KAAM9H,GAClB4nE,GAAIr+C,GAAGzhB,KAAK,KAAM9H,UACbtD,KAAK0hF,kBAAkB3gE,eAG1B/gB,KAAK0qD,YAAYyX,IAAE,MAAE3a,UAnUnCA,eAAkBp7C,EAAG9I,GACjB,MAAMoV,EAAIknC,GAAExzC,GACZ,GAAImE,GAAGmI,GAAIkqE,GAAGlqE,IAAI,IAAOpV,IAAK,IAAOoV,EAAE0nE,GAAI,CAOvC,MAAMh0E,EAAIsM,EAAEgpE,kBAAkBvI,2BAA4B71E,QAAUs3B,GAAGliB,EAAGtM,EAAEyB,WAC5E6K,EAAE0nE,IAAK,QAAUpB,GAAGtmE,EAAE8oE,aAAa,GACnC,IAAK,MAAMp1E,KAAK9I,EAAG85E,GAAG1kE,EAAE8oE,YAAap1E,QAClC,IAAI,IAAO9I,IAAK,IAAOoV,EAAE0nE,GAAI,CAChC,MAAMh0E,EAAI,GACV,IAAI9I,EAAI2a,QAAQC,UAChBxF,EAAEk6B,GAAG18B,UAAUzL,EAAGpL,KACdqZ,EAAEgpE,kBAAkBjI,mBAAmBp6E,GAAK+M,EAAE9K,KAAKjC,GAAKiE,EAAIA,EAAE6a,MAAI,KAAS6jE,GAAGtpE,EAAGrZ,GACjF04E,GAAGr/D,EAAE+xC,WAAYprD,GACY,MAAQm+E,GAAG9kE,EAAE8oE,YAAaniF,YAChDiE,QAASs3B,GAAGliB,EAAGtM,GAE1B,SAASA,GACL,MAAM9I,EAAIs8C,GAAExzC,GACZ9I,EAAEsnB,GAAG1U,UAAU9J,EAAGsM,KACd8kE,GAAGl6E,EAAEk+E,YAAa9oE,MACjBpV,EAAE08E,GAAGvjB,KAAMn5D,EAAEsnB,GAAK,IAAIwK,IAAK9xB,EAAE69B,GAAK,IAAI2xB,GAAGzN,GAAGlB,YAJrD,CAiBCzrC,GAAIA,EAAE0nE,IAAK,QAAUpB,GAAGtmE,EAAE8oE,aAAa,IA8R9BjxC,CAAGvwC,KAAKqvC,GAAG2pC,WAAY5sE,GAAIpM,KAAK8iF,cAAgB12E,IAAMpM,KAAK8iF,YAAYx4B,QAAUtqD,KAAK8iF,YAAY/hE,QAAU3U,GAAKpM,KAAK8iF,YAAYhiE,QACxI9gB,KAAK+iF,2BAA6B32E,IAAMpM,KAAK+iF,yBAAyBz4B,QAAUtqD,KAAK+iF,yBAAyBhiE,QAAU3U,GAAKpM,KAAK+iF,yBAAyBjiE,WAGnK4/D,GAAGt0E,GACC,MAAM9I,EAAIy3E,KACV,IAAKhC,GAAGl+D,EAAEvX,GAAI,MAAM,IAAIokB,GAAEjN,GAAE+lC,cAAe,mFAC3C,MAAM9nC,EAAIs+D,GAAG5qE,EAAEyuE,aAAalvB,WAAYv/C,EAAEyuE,aAAahvB,gBACvD,OAAO,IAAIktB,GAAGz1E,EAAG8I,EAAEg+C,WAAY1xC,EAAGtM,EAAEspE,SAAUtpE,EAAE42E,cAOpD,MAAMI,GACN57B,iBAAiBp7C,EAAG9I,GAChBtD,KAAKyqD,aAAezqD,KAAKyqD,WAAar+C,EAAEq+C,WAAYzqD,KAAK0hF,kBAAoBt1E,EAAEs1E,kBAC/E1hF,KAAK+8E,UAAY/8E,KAAKqjF,gBAAgB//E,GAAItD,KAAKwhF,YAAcxhF,KAAKsjF,kBAAkBhgF,GACpFtD,KAAKyhF,aAAezhF,KAAKujF,mBAAmBjgF,GAAItD,KAAKg5E,WAAah5E,KAAKwjF,iBAAiBlgF,GAClE8I,EAAEy2E,iBAAkB7iF,KAAK0hF,kBAAkBzI,mBAAqB7sE,GAAK2oB,GAAG/0B,KAAKg5E,WAAY5sE,EAAG,GAClHpM,KAAKwhF,YAAYxE,aAAa+B,uBAAyByD,GAAGp3E,KAAK,KAAMpL,KAAKg5E,kBACpEgG,GAAGh/E,KAAKwhF,YAAaxhF,KAAKg5E,WAAW4I,kBAE/C2B,mBAAmBn3E,GACf,OAAO,IAAIwe,GAEfy4D,gBAAgBj3E,GACZ,MAAM9I,EAAI23E,GAAG7uE,EAAEyuE,aAAalvB,YAAajzC,GAAKjO,EAAI2B,EAAEyuE,aAAc,IAAID,GAAGnwE,IACzE,IAAIA,EAC6D,OAAO,SAAS2B,EAAG9I,EAAGoV,EAAGjO,GACtF,OAAO,IAAIgyE,GAAGrwE,EAAG9I,EAAGoV,EAAGjO,GAD6C,CAEtE2B,EAAEswE,gBAAiBtwE,EAAEuwE,oBAAqBjkE,EAAGpV,GAEnDggF,kBAAkBl3E,GACd,OAAO9I,EAAItD,KAAKyqD,WAAY/xC,EAAI1Y,KAAK+8E,UAAWtyE,EAAI2B,EAAEg+C,WAAY/qD,EAAI+M,GAAK2oB,GAAG/0B,KAAKg5E,WAAY5sE,EAAG,GAClGs1C,EAAI04B,GAAGv/D,IAAM,IAAIu/D,GAAK,IAAID,GAAI,IAAI2C,GAAGx5E,EAAGoV,EAAGjO,EAAGpL,EAAGqiD,GACjD,IAAIp+C,EAAGoV,EAAGjO,EAAGpL,EAAGqiD,EAEpB8hC,iBAAiBp3E,EAAG9I,GAChB,OAAO,SAAS8I,EAAG9I,EAAGoV,EAEtBjO,EAAGpL,EAAGqiD,EAAGD,GACL,MAAMx/C,EAAI,IAAIs/E,GAAGn1E,EAAG9I,EAAGoV,EAAGjO,EAAGpL,EAAGqiD,GAChC,OAAOD,IAAMx/C,EAAEm+E,IAAK,GAAKn+E,EAJtB,CAKLjC,KAAKyqD,WAAYzqD,KAAKwhF,YAAaxhF,KAAKyhF,aAAczhF,KAAK0hF,kBAAmBt1E,EAAE42E,YAAa52E,EAAEu1E,8BAA+Br+E,GAEpIs5E,YACI,OAAOp1B,eAAep7C,GAClB,MAAM9I,EAAIs8C,GAAExzC,GACZyO,GAAE,cAAe,8BAA+BvX,EAAE+2E,GAAG3iE,IAAI,SACnDwlE,GAAG55E,GAAIA,EAAEs3E,GAAG15B,WAGlB59C,EAAEy3E,GAAG19D,IAAI,WANNmqC,CAOLxnD,KAAKwhF,cAmBX,SAASzvE,GAAG3F,EAAG9I,EAAGoV,GAClB,IAAKA,EAAG,MAAM,IAAIgP,GAAEjN,GAAEslC,iBAAkB,YAAY3zC,sCAAsC9I,MAM1F,SAASmgF,GAAGr3E,EAAG9I,EAAGoV,EAAGjO,GACrB,IAAI,IAAOnH,IAAK,IAAOmH,EAAG,MAAM,IAAIid,GAAEjN,GAAEslC,iBAAkB,GAAG3zC,SAASsM,8BAMtE,SAASrO,GAAG+B,GACZ,IAAKi5C,GAAGsS,cAAcvrD,GAAI,MAAM,IAAIsb,GAAEjN,GAAEslC,iBAAkB,6FAA6F3zC,SAASA,EAAE9M,WAMlK,SAASiM,GAAGa,GACZ,GAAIi5C,GAAGsS,cAAcvrD,GAAI,MAAM,IAAIsb,GAAEjN,GAAEslC,iBAAkB,gGAAgG3zC,SAASA,EAAE9M,WAQxK,SAASokF,GAAGt3E,GACR,QAAI,IAAWA,EAAG,MAAO,YACzB,GAAI,OAASA,EAAG,MAAO,OACvB,GAAI,iBAAmBA,EAAG,OAAOA,EAAE9M,OAAS,KAAO8M,EAAI,GAAGA,EAAEtH,UAAU,EAAG,UACzEnB,KAAKuY,UAAU9P,GACf,GAAI,iBAAmBA,GAAK,kBAAoBA,EAAG,MAAO,GAAKA,EAC/D,GAAI,iBAAmBA,EAAG,CACtB,GAAIA,aAAa7L,MAAO,MAAO,WAC/B,CACI,MAAM+C,EAEN,SAAS8I,GACL,OAAIA,EAAEzG,YAAoByG,EAAEzG,YAAYK,KACjC,KAFX,CAWPoG,GACO,OAAO9I,EAAI,YAAYA,WAAa,aAG5C,MAAO,mBAAqB8I,EAAI,aAAeggC,KAGnD,SAASrhC,GAAGqB,EAEZ9I,GACI,GAAI,cAAe8I,IAGnBA,EAAIA,EAAEvE,aAAcuE,aAAa9I,GAAI,CACjC,GAAIA,EAAE0C,OAASoG,EAAEzG,YAAYK,KAAM,MAAM,IAAI0hB,GAAEjN,GAAEslC,iBAAkB,uGACnE,CACI,MAAMrnC,EAAIgrE,GAAGt3E,GACb,MAAM,IAAIsb,GAAEjN,GAAEslC,iBAAkB,kBAAkBz8C,EAAE0C,sBAAsB0S,MAGlF,OAAOtM,EAGX,SAASu3E,GAAGv3E,EAAG9I,GACX,GAAIA,GAAK,EAAG,MAAM,IAAIokB,GAAEjN,GAAEslC,iBAAkB,YAAY3zC,+CAA+C9I,MAkBvG,MAAMgB,GAAK,IAAI8wB,IAWnB,MAAMwuD,GACFj+E,YAAYyG,GACR,IAAI9I,EACJ,QAAI,IAAW8I,EAAE/H,KAAM,CACnB,QAAI,IAAW+H,EAAE0/C,IAAK,MAAM,IAAIpkC,GAAEjN,GAAEslC,iBAAkB,sDACtD//C,KAAKqE,KAAO,2BAA4BrE,KAAK8rD,KAAM,OAChD9rD,KAAKqE,KAAO+H,EAAE/H,KAAMrE,KAAK8rD,IAAM,QAAUxoD,EAAI8I,EAAE0/C,WAAQ,IAAWxoD,GAAKA,EAC9E,GAAItD,KAAK+lC,YAAc35B,EAAE25B,YAAa/lC,KAAK6jF,4BAA8Bz3E,EAAEy3E,+BAC3E,IAAWz3E,EAAE62E,eAAgBjjF,KAAKijF,eAAiB,aAAe,CAC9D,IAAK,IAAM72E,EAAE62E,gBAAkB72E,EAAE62E,eAAiB,QAAS,MAAM,IAAIv7D,GAAEjN,GAAEslC,iBAAkB,2CAC3F//C,KAAKijF,eAAiB72E,EAAE62E,eAE5BjjF,KAAK8jF,+BAAiC13E,EAAE03E,6BAA8B9jF,KAAK+jF,oCAAsC33E,EAAE23E,kCACnH/jF,KAAKwuC,kBAAoBpiC,EAAEoiC,gBAAiBi1C,GAAG,+BAAgCr3E,EAAE03E,6BAA8B,oCAAqC13E,EAAE23E,mCAE1JjlC,QAAQ1yC,GACJ,OAAOpM,KAAKqE,OAAS+H,EAAE/H,MAAQrE,KAAK8rD,MAAQ1/C,EAAE0/C,KAAO9rD,KAAK+lC,cAAgB35B,EAAE25B,aAAe/lC,KAAKijF,iBAAmB72E,EAAE62E,gBAAkBjjF,KAAK8jF,+BAAiC13E,EAAE03E,8BAAgC9jF,KAAK+jF,oCAAsC33E,EAAE23E,mCAAqC/jF,KAAK6jF,4BAA8Bz3E,EAAEy3E,2BAA6B7jF,KAAKwuC,kBAAoBpiC,EAAEoiC,iBAwBlY,MAAMw1C,GAENr+E,YAAYyG,EAAG9I,EAAGoV,EAAGjO,GACjBzK,KAAKikF,iBAAmB73E,EAAGpM,KAAKkkF,qBAAuB5gF,EAAGtD,KAAKmkF,YAAczrE,EAC7E1Y,KAAKokF,KAAO35E,EAIZzK,KAAKgI,KAAO,iBAAkBhI,KAAKqkF,gBAAkB,SAAUrkF,KAAKskF,UAAY,IAAIV,GAAG,IACvF5jF,KAAKukF,iBAAkB,EAKhBC,UACP,IAAKxkF,KAAKokF,KAAM,MAAM,IAAI18D,GAAEjN,GAAE4lC,oBAAqB,gFACnD,OAAOrgD,KAAKokF,KAEZK,mBACA,OAAOzkF,KAAKukF,gBAEZG,kBACA,YAAO,IAAW1kF,KAAK2kF,eAE3BC,aAAax4E,GACT,GAAIpM,KAAKukF,gBAAiB,MAAM,IAAI78D,GAAEjN,GAAE4lC,oBAAqB,sKAC7DrgD,KAAKskF,UAAY,IAAIV,GAAGx3E,QAAI,IAAWA,EAAE25B,cAAgB/lC,KAAKikF,iBAAmB,SAAS73E,GACtF,IAAKA,EAAG,OAAO,IAAI+xC,GACnB,OAAQ/xC,EAAEpE,MACR,IAAK,OACH,MAAM1E,EAAI8I,EAAEy4E,OACZ,OAAO,IAAIn8C,GAAEplC,EAAG8I,EAAE04E,cAAgB,IAAK14E,EAAE24E,UAAY,KAAM34E,EAAE44E,kBAAoB,MAEnF,IAAK,WACH,OAAO54E,EAAEy4E,OAEX,QACE,MAAM,IAAIn9D,GAAEjN,GAAEslC,iBAAkB,sEAXyC,CAa/E3zC,EAAE25B,cAERk/C,eACI,OAAOjlF,KAAKskF,UAEhBY,kBACI,OAAOllF,KAAKukF,iBAAkB,EAAIvkF,KAAKskF,UAE3Ca,UACI,OAAOnlF,KAAK2kF,iBAAmB3kF,KAAK2kF,eAAiB3kF,KAAKolF,cAAeplF,KAAK2kF,eAECnhC,SAC/E,MAAO,CACHghC,IAAKxkF,KAAKokF,KACVz4B,WAAY3rD,KAAKmkF,YACjBkB,SAAUrlF,KAAKskF,WAShBc,aAKH,OAAO,SAASh5E,GACZ,MAAM9I,EAAIgB,GAAG8K,IAAIhD,GACjB9I,IAAMuX,GAAE,oBAAqB,sBAAuBvW,GAAGq6B,OAAOvyB,GAAI9I,EAAEs5E,aAFjE,CAGL58E,MAAOie,QAAQC,WAgBrB,SAASonE,GAAGl5E,EAAG9I,EAAGoV,EAAGjO,EAAI,IACzB,IAAIpL,EACJ,MAAMqiD,GAAKt1C,EAAIrB,GAAGqB,EAAG43E,KAAKiB,eAC1B,GAAI,6BAA+BvjC,EAAEr9C,MAAQq9C,EAAEr9C,OAASf,GAAKioB,GAAE,sFAC/Dnf,EAAEw4E,aAAaz/E,OAAOgrD,OAAOhrD,OAAOgrD,OAAO,GAAIzO,GAAI,CAC/Cr9C,KAAM,GAAGf,KAAKoV,IACdozC,KAAK,KACJrhD,EAAE86E,cAAe,CAClB,IAAIjiF,EAAGoV,EACP,GAAI,iBAAmBjO,EAAE86E,cAAejiF,EAAImH,EAAE86E,cAAe7sE,EAAImX,GAAEqvB,cAAgB,CAG/E57C,EEx1fI,SACd89C,EACA6K,GAEA,GAAI7K,EAAMzC,IACR,MAAM,IAAIl+C,MACR,gHAIJ,MAKM+kF,EAAUv5B,GAAa,eACvBw5B,EAAMrkC,EAAMqkC,KAAO,EACnBC,EAAMtkC,EAAMskC,KAAOtkC,EAAMukC,QAC/B,IAAKD,EACH,MAAM,IAAIjlF,MAAM,wDAGlB,MAAMmlF,EAAOzgF,OAAAgrD,OAAA,CAEX01B,IAAK,kCAAkCL,IACvCM,IAAKN,EACLC,IAAAA,EACAM,IAAKN,EAAM,KACXO,UAAWP,EACXC,IAAAA,EACAC,QAASD,EACTO,SAAU,CACRC,iBAAkB,SAClBC,WAAY,KAIX/kC,GAKL,MAAO,CACL5+C,EAA8BmB,KAAKuY,UAjCtB,CACbkqE,IAAK,OACLp+E,KAAM,SAgCNxF,EAA8BmB,KAAKuY,UAAU0pE,IAH7B,IAKhBrkF,KAAK,KF0yfO4U,CAAE1L,EAAE86E,cAAe,QAAUlmF,EAAI+M,EAAEg4E,YAAS,IAAW/kF,OAAI,EAASA,EAAE8P,QAAQ88C,WAClF,MAAMvK,EAAIj3C,EAAE86E,cAAcG,KAAOj7E,EAAE86E,cAAcI,QACjD,IAAKjkC,EAAG,MAAM,IAAIh6B,GAAEjN,GAAEslC,iBAAkB,wDACxCrnC,EAAI,IAAImX,GAAE6xB,GAEdt1C,EAAE63E,iBAAmB,IAAI9iC,GAAE,IAAIjjB,GAAE56B,EAAGoV,KAwBxC,MAAM2tE,GAEN1gF,YAAYyG,EAIZ9I,EAAGoV,GACC1Y,KAAKsmF,UAAYhjF,EAAGtD,KAAKumF,KAAO7tE,EAEhC1Y,KAAKgI,KAAO,WAAYhI,KAAKwmF,UAAYp6E,EAEzCq6E,YACA,OAAOzmF,KAAKumF,KAAKlpD,KAIV9a,SACP,OAAOviB,KAAKumF,KAAKlpD,KAAKqnB,cAKfrnB,WACP,OAAOr9B,KAAKumF,KAAKlpD,KAAK0nB,kBAIf+c,aACP,OAAO,IAAIlwD,GAAG5R,KAAKwmF,UAAWxmF,KAAKsmF,UAAWtmF,KAAKumF,KAAKlpD,KAAKmnB,WAEjEkiC,cAAct6E,GACV,OAAO,IAAIi6E,GAAGrmF,KAAKwmF,UAAWp6E,EAAGpM,KAAKumF,OAO1C,MAAM92E,GAGN9J,YAAYyG,EAIZ9I,EAAGoV,GACC1Y,KAAKsmF,UAAYhjF,EAAGtD,KAAK2mF,OAASjuE,EAElC1Y,KAAKgI,KAAO,QAAShI,KAAKwmF,UAAYp6E,EAE1Cs6E,cAAct6E,GACV,OAAO,IAAIqD,GAAGzP,KAAKwmF,UAAWp6E,EAAGpM,KAAK2mF,SAO1C,MAAM/0E,WAAWnC,GAEjB9J,YAAYyG,EAAG9I,EAAGoV,GACd3S,MAAMqG,EAAG9I,EAAG60D,GAAGz/C,IAAK1Y,KAAKymF,MAAQ/tE,EAEjC1Y,KAAKgI,KAAO,aAE2Bua,SACvC,OAAOviB,KAAK2mF,OAAOtpD,KAAKqnB,cAKjBrnB,WACP,OAAOr9B,KAAK2mF,OAAOtpD,KAAK0nB,kBAKjB+c,aACP,MAAM11D,EAAIpM,KAAKymF,MAAMjiC,UACrB,OAAOp4C,EAAEu4C,UAAY,KAAO,IAAI0hC,GAAGrmF,KAAKwmF,UACvB,KAAM,IAAInhC,GAAGj5C,IAElCs6E,cAAct6E,GACV,OAAO,IAAIwF,GAAG5R,KAAKwmF,UAAWp6E,EAAGpM,KAAKymF,QAI9C,SAAShwE,GAAGrK,EAAG9I,KAAMoV,GACjB,GAAItM,EAAIuK,EAAEvK,GAAI2F,GAAG,aAAc,OAAQzO,GAAI8I,aAAa43E,GAAI,CACxD,MAAMv5E,EAAIq6C,GAAGQ,WAAWhiD,KAAMoV,GAC9B,OAAOnN,GAAGd,GAAI,IAAImH,GAAGxF,EAAoB,KAAM3B,GAEnD,CACI,KAAM2B,aAAai6E,IAAMj6E,aAAawF,IAAK,MAAM,IAAI8V,GAAEjN,GAAEslC,iBAAkB,iHAC3E,MAAMt1C,EAAI2B,EAAEq6E,MAAMriC,MAAMU,GAAGQ,WAAWhiD,KAAMoV,IAC5C,OAAOnN,GAAGd,GAAI,IAAImH,GAAGxF,EAAEo6E,UACN,KAAM/7E,IAgB3B,SAASgH,GAAGrF,EAAG9I,GACf,GAAI8I,EAAIrB,GAAGqB,EAAG43E,IAAKjyE,GAAG,kBAAmB,gBAAiBzO,GAAIA,EAAEyI,QAAQ,MAAQ,EAAG,MAAM,IAAI2b,GAAEjN,GAAEslC,iBAAkB,0BAA0Bz8C,iFAC7I,OAAO,IAAImM,GAAGrD,EACG,KAAM,SAASA,GAC5B,OAAO,IAAI2rD,GAAGjT,GAAGS,YAAan5C,GADX,CAErB9I,IAGN,SAASsjF,GAAGx6E,EAAG9I,KAAMoV,GACjB,GAAItM,EAAIuK,EAAEvK,GAGV,IAAMf,UAAU/L,SAAWgE,EAAIuyC,GAAE/B,KAAM/hC,GAAG,MAAO,OAAQzO,GAAI8I,aAAa43E,GAAI,CAC1E,MAAMv5E,EAAIq6C,GAAGQ,WAAWhiD,KAAMoV,GAC9B,OAAOrO,GAAGI,GAAI,IAAI47E,GAAGj6E,EACJ,KAAM,IAAIi5C,GAAG56C,IAElC,CACI,KAAM2B,aAAai6E,IAAMj6E,aAAawF,IAAK,MAAM,IAAI8V,GAAEjN,GAAEslC,iBAAkB,iHAC3E,MAAMt1C,EAAI2B,EAAEq6E,MAAMriC,MAAMU,GAAGQ,WAAWhiD,KAAMoV,IAC5C,OAAOrO,GAAGI,GAAI,IAAI47E,GAAGj6E,EAAEo6E,UAAWp6E,aAAawF,GAAKxF,EAAEk6E,UAAY,KAAM,IAAIjhC,GAAG56C,KAWnF,SAAS6L,GAAGlK,EAAG9I,GACf,OAAO8I,EAAIuK,EAAEvK,GAAI9I,EAAIqT,EAAErT,IAAK8I,aAAai6E,IAAMj6E,aAAawF,MAAQtO,aAAa+iF,IAAM/iF,aAAasO,KAAQxF,EAAEo6E,YAAcljF,EAAEkjF,WAAap6E,EAAEixB,OAAS/5B,EAAE+5B,MAAQjxB,EAAEk6E,YAAchjF,EAAEgjF,UAWlL,SAAS/7E,GAAG6B,EAAG9I,GACf,OAAO8I,EAAIuK,EAAEvK,GAAI9I,EAAIqT,EAAErT,GAAI8I,aAAaqD,IAAMnM,aAAamM,IAAOrD,EAAEo6E,YAAcljF,EAAEkjF,WAAa5tB,GAAGxsD,EAAEu6E,OAAQrjF,EAAEqjF,SAAWv6E,EAAEk6E,YAAchjF,EAAEgjF,UA8BjJ,SAASO,GAAGz6E,EAAG9I,EAAI,OACf,IAAIoV,EAAI,EAKJ,MAAO,CAEP8uC,aACI,GAAI9uC,EAAItM,EAAEq0E,WAAY,CAClB,MAAMh2E,EAAI,CACN3D,MAAOsF,EAAEX,MAAMiN,EAAGA,EAAIpV,GACtB+jC,MAAM,GAEV,OAAO3uB,GAAKpV,EAAGmH,EAEnB,MAAO,CACH48B,MAAM,IAGdmgB,iBACAs/B,gBACAC,OAAQ9oE,QAAQ4iC,OAAO,kBA4C/B,MAAMmmC,GACFrhF,YAAYyG,GACRpM,KAAKinF,SAAW76E,EAKhBpM,KAAKknF,OAAQ,EAEjB1qE,KAAKpQ,GACDpM,KAAKinF,SAASzqE,MAAQxc,KAAKuhF,GAAGvhF,KAAKinF,SAASzqE,KAAMpQ,GAEtD3I,MAAM2I,GACFpM,KAAKinF,SAASxjF,MAAQzD,KAAKuhF,GAAGvhF,KAAKinF,SAASxjF,MAAO2I,GAAKiE,GAAE,uCAAwCjE,EAAE/G,YAExGw8E,KACI7hF,KAAKknF,OAAQ,EAEjB3F,GAAGn1E,EAAG9I,GACFtD,KAAKknF,OAASxpE,iBACV1d,KAAKknF,OAAS96E,EAAE9I,KAChB,IAyBR,MAAM+T,GACN1R,YAEAyG,EAAG9I,GACCtD,KAAK8hF,GAAK11E,EAAGpM,KAAK0mD,GAAKpjD,EAEvBtD,KAAKs3C,SAAW,IAAIsJ,GAKpB5gD,KAAKgiC,OAAS,IAAImF,WAAYnnC,KAAKuhC,GAAK,IAAI5K,YAAY,SAExD32B,KAAKmnF,KAAKhpE,MAAM/R,IACZA,GAAKA,EAAEixE,KAAOr9E,KAAKs3C,SAASp5B,QAAQ9R,EAAEkxE,GAAGhmC,UAAYt3C,KAAKs3C,SAASuJ,OAAO,IAAIpgD,MAAM,0EAA0EkD,KAAKuY,UAAU,MAAQ9P,OAAI,EAASA,EAAEkxE,WACnMlxE,GAAKpM,KAAKs3C,SAASuJ,OAAOz0C,KAEnC6wC,QACI,OAAOj9C,KAAK8hF,GAAGhqD,SAEnB0vB,oBACI,OAAOxnD,KAAKs3C,SAASv5B,QAEzBypC,WAEI,aAAaxnD,KAAK2xE,cAAe3xE,KAAKmnF,KAWnC3/B,WACH,MAAMp7C,QAAUpM,KAAKy8B,KACrB,GAAI,OAASrwB,EAAG,OAAO,KACvB,MAAM9I,EAAItD,KAAKuhC,GAAG1K,OAAOzqB,GAAIsM,EAAImH,OAAOvc,GACxCqrB,MAAMjW,IAAM1Y,KAAK+0B,GAAG,kBAAkBzxB,0BACtC,MAAMmH,QAAUzK,KAAKiiF,GAAGvpE,GACxB,OAAO,IAAIo8B,GAAGnxC,KAAKC,MAAM6G,GAAI2B,EAAE9M,OAASoZ,GAEaypE,KACrD,OAAOniF,KAAKgiC,OAAOolD,WAAWh7E,GAAKA,IAAM,IAAI5M,WAAW,KAOrDgoD,WACH,KAAMxnD,KAAKmiF,KAAO,UACJniF,KAAKsiF,OAIX,GAAI,IAAMtiF,KAAKgiC,OAAO1iC,OAAQ,OAAO,KAC7C,MAAM8M,EAAIpM,KAAKmiF,KAGP/1E,EAAI,GAAKpM,KAAK+0B,GAAG,+DACzB,MAAMzxB,EAAItD,KAAKgiC,OAAOv2B,MAAM,EAAGW,GAEvB,OAAOpM,KAAKgiC,OAAShiC,KAAKgiC,OAAOv2B,MAAMW,GAAI9I,EAOhDkkD,SAASp7C,GACZ,KAAMpM,KAAKgiC,OAAO1iC,OAAS8M,SACjBpM,KAAKsiF,MAAQtiF,KAAK+0B,GAAG,oDAE/B,MAAMzxB,EAAItD,KAAKuhC,GAAG1K,OAAO72B,KAAKgiC,OAAOv2B,MAAM,EAAGW,IAEtC,OAAOpM,KAAKgiC,OAAShiC,KAAKgiC,OAAOv2B,MAAMW,GAAI9I,EAEvDyxB,GAAG3oB,GAEC,MAAMpM,KAAK8hF,GAAGhqD,SAAU,IAAIr3B,MAAM,0BAA0B2L,KAKzDo7C,WACH,MAAMp7C,QAAUpM,KAAK8hF,GAAGh9C,OACxB,IAAK14B,EAAEi7B,KAAM,CACT,MAAM/jC,EAAI,IAAI6jC,WAAWnnC,KAAKgiC,OAAO1iC,OAAS8M,EAAEtF,MAAMxH,QACtDgE,EAAE+Z,IAAIrd,KAAKgiC,QAAS1+B,EAAE+Z,IAAIjR,EAAEtF,MAAO9G,KAAKgiC,OAAO1iC,QAASU,KAAKgiC,OAAS1+B,EAE1E,OAAO8I,EAAEi7B,MAwBjB,MAAMggD,GACF1hF,cAEI3F,KAAKgI,KAAO,kBAMhB,MAAMs/E,GAEN3hF,YAAYyG,EAAG9I,GACXtD,KAAKunF,MAAQjkF,EAEbtD,KAAKgI,KAAO,yBAA0BhI,KAAK09B,MAAQtxB,EAYhD5F,OACH,OAAOxG,KAAKunF,OAuBhB,MAAM/0D,GACN7sB,YAAYyG,EAAG9I,EAAGoV,GACd1Y,KAAK09B,MAAQtxB,EAAGpM,KAAK+8E,UAAYz5E,EAAGtD,KAAKwnF,eAAiB9uE,EAE9D+uE,MACI,OArjGRjgC,eAAkBp7C,EAAG9I,GACjB,MAAMoV,EAAIknC,GAAExzC,GAAI3B,EAAI,SAAS2B,EAAG9I,GAC5B,MAAMoV,EAAIkpD,GAAGx1D,EAAG9I,GAChB,MAAO,CACHokF,2BAA4B,CACxBC,aAAc,CAAE,CACZp2C,MAAO,GACPq2C,MAAO,gBAEX/lB,gBAAiBnpD,EAAEmpD,iBAEvBC,OAAQppD,EAAEopD,QAVE,CAYlBppD,EAAEguC,GAAI+R,GAAGn1D,IAAKjE,EAAIoL,EAAEq3D,OAEtB,OADAppD,EAAE4iE,WAAWtK,WAAavmE,EAAEq3D,cACdppD,EAAE+4D,GAAG,sBAAuBpyE,EAAGoL,EAA8B,IAAIu6C,QAAQ54C,KAAOA,EAAEu1B,SAASmQ,KAAK1lC,GAAKA,EAAEu1B,OAAOkmD,kBAsiGjH1H,CAAGngF,KAAK+8E,UAAW/8E,KAAK09B,MAAMipD,QAAQxoE,MAAM/R,IAC/CmuB,QAAE,IAAWnuB,EAAE,IACf,MAAM9I,EAAI6B,OAAOgjC,QAAQ/7B,EAAE,IAAI44C,UAAU54C,EAAG9I,KAAO,gBAAkB8I,IAAI0lC,KAAK,EAAE1lC,EAAG9I,KAAOtD,KAAKwnF,eAAeM,aAAaxkF,KAAK,GAChI,OAAOi3B,GAAE,iBAAmBj3B,GAAI2a,QAAQC,QAAQ,IAAIopE,GAAGtnF,KAAK09B,MAAO,CAC/D6T,MAAOjuC,SAyBnB,MAAMykF,GACNpiF,YAAYyG,GACRpM,KAAK+8E,UAAY3wE,EAEjBpM,KAAKgoF,aAAe,IAAI5yD,IAAKp1B,KAAKglE,UAAY,GAAIhlE,KAAKioF,WAAY,EAKnEjoF,KAAKkoF,eAAiB,KAOtBloF,KAAKmoF,YAAc,IAAI/0D,IAE3Bo0B,aAAap7C,GACT,GAAIpM,KAAKooF,wBAAyBpoF,KAAKglE,UAAU1lE,OAAS,EAAG,MAAM,IAAIooB,GAAEjN,GAAEslC,iBAAkB,8EAC7F,MAAMz8C,QAAUkkD,eAAep7C,EAAG9I,GAC9B,MAAMoV,EAAIknC,GAAExzC,GAAI3B,EAAI+1D,GAAG9nD,EAAEguC,IAAM,aAAcrnD,EAAI,CAC7CsiE,UAAWr+D,EAAEwuC,KAAK1lC,GAAK+zD,GAAGznD,EAAEguC,GAAIt6C,MACjCs1C,QAAUhpC,EAAE+4D,GAAG,oBAAqBhnE,EAAGpL,EAAGiE,EAAEhE,QAASmiD,EAAI,IAAIrsB,IAChEssB,EAAExrC,SAAS9J,IACP,MAAM9I,EAlrVtB,SAAY8I,EAAG9I,GACX,MAAO,UAAWA,EAAI,SAAS8I,EAAG9I,GAC9Bi3B,KAAIj3B,EAAE+kF,OAAQ/kF,EAAE+kF,MAAMriF,KAAM1C,EAAE+kF,MAAM7tB,WACpC,MAAM9hD,EAAI0nD,GAAGh0D,EAAG9I,EAAE+kF,MAAMriF,MAAOyE,EAAIs1D,GAAGz8D,EAAE+kF,MAAM7tB,YAAan7D,EAAIiE,EAAE+kF,MAAMlyB,WAAa4J,GAAGz8D,EAAE+kF,MAAMlyB,YAAcxS,GAAGnS,MAAOkQ,EAAI,IAAIkU,GAAG,CAC9H9H,SAAU,CACNhI,OAAQxiD,EAAE+kF,MAAMviC,UAGxB,OAAOmQ,GAAG0K,iBAAiBjoD,EAAGjO,EAAGpL,EAAGqiD,GAPlB,CAQpBt1C,EAAG9I,GAAK,YAAaA,EAAI,SAAS8I,EAAG9I,GACnCi3B,KAAIj3B,EAAEglF,SAAU/tD,KAAIj3B,EAAEyjD,UACtB,MAAMruC,EAAI0nD,GAAGh0D,EAAG9I,EAAEglF,SAAU79E,EAAIs1D,GAAGz8D,EAAEyjD,UACrC,OAAOkP,GAAG+I,cAActmD,EAAGjO,GAHJ,CAIzB2B,EAAG9I,GAAK8oC,KAqqVYupC,CAAGj9D,EAAEguC,GAAIt6C,GACnBq1C,EAAEpkC,IAAI/Z,EAAEuD,IAAIxB,WAAY/B,MAE5B,MAAMrB,EAAI,GACV,OAAOqB,EAAE4S,SAAS9J,IACd,MAAM9I,EAAIm+C,EAAEryC,IAAIhD,EAAE/G,YAClBk1B,KAAIj3B,GAAIrB,EAAEX,KAAKgC,MACdrB,EAZOulD,CAadxnD,KAAK+8E,UAAW3wE,GAClB,OAAO9I,EAAE4S,SAAS9J,GAAKpM,KAAKuoF,cAAcn8E,KAAM9I,EAEpD+Z,IAAIjR,EAAG9I,GACHtD,KAAKwoF,MAAMllF,EAAEmlF,WAAWr8E,EAAGpM,KAAKq7D,aAAajvD,KAAMpM,KAAKmoF,YAAYzwE,IAAItL,EAAE/G,YAE9Ew7D,OAAOz0D,EAAG9I,GACN,IACItD,KAAKwoF,MAAMllF,EAAEmlF,WAAWr8E,EAAGpM,KAAK0oF,sBAAsBt8E,KACxD,MAAOA,GACLpM,KAAKkoF,eAAiB97E,EAE1BpM,KAAKmoF,YAAYzwE,IAAItL,EAAE/G,YAE3Bs5B,OAAOvyB,GACHpM,KAAKwoF,MAAM,IAAI1tB,GAAG1uD,EAAGpM,KAAKq7D,aAAajvD,KAAMpM,KAAKmoF,YAAYzwE,IAAItL,EAAE/G,YAExEmiD,eACI,GAAIxnD,KAAKooF,wBAAyBpoF,KAAKkoF,eAAgB,MAAMloF,KAAKkoF,eAClE,MAAM97E,EAAIpM,KAAKgoF,aAEPhoF,KAAKglE,UAAU9uD,SAAS5S,IAC5B8I,EAAEuyB,OAAOr7B,EAAEuD,IAAIxB,eAInB+G,EAAE8J,SAAO,CAAG9J,EAAG9I,KACX,MAAMoV,EAAI2sC,GAAGuvB,SAAStxE,GACtBtD,KAAKglE,UAAU1jE,KAAK,IAAIw6D,GAAGpjD,EAAG1Y,KAAKq7D,aAAa3iD,cACzC8uC,eAAep7C,EAAG9I,GACzB,MAAMoV,EAAIknC,GAAExzC,GAAI3B,EAAI+1D,GAAG9nD,EAAEguC,IAAM,aAAcrnD,EAAI,CAC7Cm9E,OAAQl5E,EAAEwuC,KAAK1lC,GAAKw0D,GAAGloD,EAAEguC,GAAIt6C,YAE3BsM,EAAE64D,GAAG,SAAU9mE,EAAGpL,GAJjBmoD,CAKTxnD,KAAK+8E,UAAW/8E,KAAKglE,WAAYhlE,KAAKioF,WAAY,EAExDM,cAAcn8E,GACV,IAAI9I,EACJ,GAAI8I,EAAE2qD,kBAAmBzzD,EAAI8I,EAAEiF,YAAc,CACzC,IAAKjF,EAAE4qD,eAAgB,MAAM5qB,KAE7B9oC,EAAIqgD,GAAGnS,MAEX,MAAM94B,EAAI1Y,KAAKgoF,aAAa54E,IAAIhD,EAAEvF,IAAIxB,YACtC,GAAIqT,GACA,IAAKpV,EAAEw7C,QAAQpmC,GAEf,MAAM,IAAIgP,GAAEjN,GAAE6lC,QAAS,oDACpBtgD,KAAKgoF,aAAa3qE,IAAIjR,EAAEvF,IAAIxB,WAAY/B,GAK5C+3D,aAAajvD,GAChB,MAAM9I,EAAItD,KAAKgoF,aAAa54E,IAAIhD,EAAE/G,YAClC,OAAQrF,KAAKmoF,YAAYzpD,IAAItyB,EAAE/G,aAAe/B,EAAIA,EAAEw7C,QAAQ6E,GAAGnS,OAAS+oB,GAAGE,QAAO,GAAMF,GAAGC,WAAWl3D,GAAKi3D,GAAGQ,OAI3G2tB,sBAAsBt8E,GACzB,MAAM9I,EAAItD,KAAKgoF,aAAa54E,IAAIhD,EAAE/G,YAG1B,IAAKrF,KAAKmoF,YAAYzpD,IAAItyB,EAAE/G,aAAe/B,EAAG,CAClD,GAAIA,EAAEw7C,QAAQ6E,GAAGnS,OAUjB,MAAM,IAAI9pB,GAAEjN,GAAEslC,iBAAkB,+CAEpB,OAAOwa,GAAGC,WAAWl3D,GAIrC,OAAOi3D,GAAGE,QAAO,GAErB+tB,MAAMp8E,GACFpM,KAAKooF,wBAAyBpoF,KAAKglE,UAAU1jE,KAAK8K,GAEtDg8E,0BAsBA,MAAMO,GACNhjF,YAAYyG,EAAG9I,EAAGoV,EAAGjO,EAAGpL,GACpBW,KAAKoqD,WAAah+C,EAAGpM,KAAK+8E,UAAYz5E,EAAGtD,KAAKmP,QAAUuJ,EAAG1Y,KAAK4oF,eAAiBn+E,EACjFzK,KAAKm/E,SAAW9/E,EAAGW,KAAK6oF,GAAKnwE,EAAEowE,YAAa9oF,KAAKm1E,GAAK,IAAI+F,GAAGl7E,KAAKoqD,WAAY,qBAElBq9B,MAC5DznF,KAAK6oF,IAAM,EAAG7oF,KAAKqiF,KAEvBA,KACIriF,KAAKm1E,GAAGrB,cACJ,MAAM1nE,EAAI,IAAI27E,GAAG/nF,KAAK+8E,WAAYz5E,EAAItD,KAAKoiF,GAAGh2E,GAC9C9I,GAAKA,EAAE6a,MAAM7a,IACTtD,KAAKoqD,WAAWgsB,kBAAkB,IAAMhqE,EAAEu8C,SAASxqC,WAC/Cne,KAAKm/E,SAASjhE,QAAQ5a,MACtB0hC,OAAO54B,IACPpM,KAAKgiF,GAAG51E,WAEZ44B,OAAO54B,IACPpM,KAAKgiF,GAAG51E,SAIpBg2E,GAAGh2E,GACC,IACI,MAAM9I,EAAItD,KAAK4oF,eAAex8E,GAC9B,OAAQmgD,GAAGjpD,IAAMA,EAAE0hC,OAAS1hC,EAAE6a,KAAO7a,GAAKtD,KAAKm/E,SAASt+B,OAAOpgD,MAAM,+CACrE,MACF,MAAO2L,GAEL,OAAOpM,KAAKm/E,SAASt+B,OAAOz0C,GAAI,MAGxC41E,GAAG51E,GACCpM,KAAK6oF,GAAK,GAAK7oF,KAAKuiF,GAAGn2E,IAAMpM,KAAK6oF,IAAM,EAAG7oF,KAAKoqD,WAAWgsB,kBAAkB,KAAOp2E,KAAKqiF,KACzFpkE,QAAQC,cAAgBle,KAAKm/E,SAASt+B,OAAOz0C,GAEjDm2E,GAAGn2E,GACC,GAAI,kBAAoBA,EAAEpG,KAAM,CAG5B,MAAM1C,EAAI8I,EAAExG,KACZ,MAAO,YAActC,GAAK,wBAA0BA,GAAK,mBAAqBA,IAAM44D,GAAG54D,GAE3F,OAAO,GAyBf,MAAMylF,GACFpjF,YAAYyG,EAAG9I,EASfoV,EAAGjO,GACCzK,KAAK08E,gBAAkBtwE,EAAGpM,KAAK28E,oBAAsBr5E,EAAGtD,KAAKoqD,WAAa1xC,EAAG1Y,KAAK66E,aAAepwE,EACjGzK,KAAK8gD,KAAOjxB,GAAEkvB,gBAAiB/+C,KAAK01E,SAAW7/B,GAAE/B,IAAK9zC,KAAKgpF,uBAAyB,IAAM/qE,QAAQC,UAClGle,KAAKipF,2BAA6B,IAAMhrE,QAAQC,UAAWle,KAAK08E,gBAAgB37D,MAAMrI,GAAI,MAAA8uC,IACtF3sC,GAAE,kBAAmB,iBAAkBzO,EAAEuyC,WAAY3+C,KAAKgpF,uBAAuB58E,GACjFpM,KAAK8gD,KAAO10C,KACXpM,KAAK28E,oBAAoB57D,MAAMrI,GAAItM,IAAMyO,GAAE,kBAAmB,gCAAiCzO,GACpGpM,KAAKipF,2BAA2B78E,EAAGpM,KAAK8gD,SAE5C0G,yBACI,MAAO,CACH4C,WAAYpqD,KAAKoqD,WACjBywB,aAAc76E,KAAK66E,aACnBnF,SAAU11E,KAAK01E,SACfgH,gBAAiB18E,KAAK08E,gBACtBC,oBAAqB38E,KAAK28E,oBAC1BqG,YAAahjF,KAAK8gD,KAClB6gC,8BAA+B,KAGvCuH,4BAA4B98E,GACxBpM,KAAKgpF,uBAAyB58E,EAElC+8E,+BAA+B/8E,GAC3BpM,KAAKipF,2BAA6B78E,EAK/Bg9E,sBACH,GAAIppF,KAAKoqD,WAAWi/B,eAAgB,MAAM,IAAI3hE,GAAEjN,GAAE4lC,oBAAqB,2CAE3Eu8B,YACI58E,KAAKoqD,WAAWysB,sBAChB,MAAMzqE,EAAI,IAAIw0C,GACd,OAAO5gD,KAAKoqD,WAAWk/B,+CACnB,IACItpF,KAAKupF,wBAA0BvpF,KAAKupF,iBAAiB3M,YAAa58E,KAAKwpF,yBAA2BxpF,KAAKwpF,kBAAkB5M,YAIzH58E,KAAK08E,gBAAgBx7B,WAAYlhD,KAAK28E,oBAAoBz7B,WAAY90C,EAAE8R,UAC1E,MAAO5a,GACL,MAAMoV,EAAIw3B,GAAG5sC,EAAG,kCAChB8I,EAAEy0C,OAAOnoC,OAEZtM,EAAE2R,SAIfypC,eAAehyC,GAAGpJ,EAAG9I,GACjB8I,EAAEg+C,WAAW00B,4BAA6BjkE,GAAE,kBAAmB,yCAC/D,MAAMnC,QAAUtM,EAAEq9E,yBACZnmF,EAAE+zE,WAAW3+D,GACnB,IAAIjO,EAAIiO,EAAEsqE,YACV52E,EAAE88E,6BAA6B,MAAA1hC,IAC3B/8C,EAAEq0C,QAAQ1yC,WAAaorE,GAAGl0E,EAAEmnD,WAAYr+C,GAAI3B,EAAI2B,MAIpD9I,EAAEonD,YAAY0pB,4BAA0B,IAAQhoE,EAAEwwE,cAAexwE,EAAEo9E,kBAAoBlmF,EAG3FkkD,eAAekiC,GAAGt9E,EAAG9I,GACjB8I,EAAEg+C,WAAW00B,4BACb,MAAMpmE,QAAUixE,GAAGv9E,GACnByO,GAAE,kBAAmB,wCACrB,MAAMpQ,QAAU2B,EAAEq9E,yBACZnmF,EAAE+zE,WAAW3+D,EAAGjO,GAGtB2B,EAAE88E,6BAA6B98E,GAAKyyE,GAAGv7E,EAAEk+E,YAAap1E,KAAMA,EAAE+8E,gCAA8B,CAAG/8E,EAAGsM,IAAMmmE,GAAGv7E,EAAEk+E,YAAa9oE,KAC1HtM,EAAEm9E,iBAAmBjmF,EAGzBkkD,eAAemiC,GAAGv9E,GACd,OAAOA,EAAEo9E,oBAAsB3uE,GAAE,kBAAmB,gDAC9CrF,GAAGpJ,EAAG,IAAI8D,KAAM9D,EAAEo9E,kBAG5BhiC,eAAeoiC,GAAGx9E,GACd,OAAOA,EAAEm9E,mBAAqB1uE,GAAE,kBAAmB,+CAC7C6uE,GAAGt9E,EAAG,IAAIg3E,KAAMh3E,EAAEm9E,iBAG5B,SAASt4E,GAAG7E,GACR,OAAOu9E,GAAGv9E,GAAG+R,MAAM/R,GAAKA,EAAEs+C,cAG9B,SAASm/B,GAAGz9E,GACR,OAAOu9E,GAAGv9E,GAAG+R,MAAM/R,GAAKA,EAAEq+C,aAG9B,SAASq/B,GAAG19E,GACR,OAAOw9E,GAAGx9E,GAAG+R,MAAM/R,GAAKA,EAAEo1E,cAG9B,SAAS3qE,GAAGzK,GACR,OAAOw9E,GAAGx9E,GAAG+R,MAAM/R,GAAKA,EAAE4sE,aAG9B,SAAS+Q,GAAG39E,GACR,OAAOw9E,GAAGx9E,GAAG+R,MAAM/R,GAAKA,EAAE2wE,YAG9Bv1B,eAAewiC,GAAG59E,GACd,MAAM9I,QAAUsmF,GAAGx9E,GAAIsM,EAAIpV,EAAEm+E,aAC7B,OAAO/oE,EAAEunE,SAAW4B,GAAGz2E,KAAK,KAAM9H,EAAE01E,YAAatgE,EAAE2nE,WAAa9+C,GAAGn2B,KAAK,KAAM9H,EAAE01E,YAChFtgE,EAiDJ,SAASuxE,GAAG79E,EAAG9I,EAAGoV,EAAI,IAClB,MAAMjO,EAAI,IAAIm2C,GACd,OAAOx0C,EAAEg+C,WAAWgsB,2BAA8B,SAAShqE,EAAG9I,EAAGoV,EAAGjO,EAAGpL,GACnE,MAAMqiD,EAAI,IAAIslC,GAAG,CACbxqE,KAAMklC,IAGFp+C,EAAE8yE,kBAAgB,IAAQ9pC,GAAGlgC,EAAGq1C,KAChC,MAAMx/C,EAAIy/C,EAAEsyB,KAAKt1C,IAAIhmB,IACpBzW,GAAKy/C,EAAEw1B,UAQR73E,EAAEwhD,OAAO,IAAIn5B,GAAEjN,GAAEimC,YAAa,0DAA4Dz+C,GAAKy/C,EAAEw1B,WAAazsE,GAAK,WAAaA,EAAEiM,OAASrX,EAAEwhD,OAAO,IAAIn5B,GAAEjN,GAAEimC,YAAa,8KAAgLrhD,EAAE6e,QAAQwjC,IAEvWj+C,MAAO2I,GAAK/M,EAAEwhD,OAAOz0C,KACrBq1C,EAAI,IAAI6+B,GAAGnoB,GAAGz/C,EAAE2kB,MAAOqkB,EAAG,CAC1B6+B,wBAAwB,EACxB9C,IAAI,IAER,OAAOuC,GAAG5zE,EAAGq1C,GAtBiC,OAuB1CuoC,GAAG59E,GAAIA,EAAEg+C,WAAY9mD,EAAGoV,EAAGjO,KAAMA,EAAEsT,QAsB/C,SAASrM,GAAGtF,EAAG9I,EAAGoV,EAAI,IAClB,MAAMjO,EAAI,IAAIm2C,GACd,OAAOx0C,EAAEg+C,WAAWgsB,2BAA8B,SAAShqE,EAAG9I,EAAGoV,EAAGjO,EAAGpL,GACnE,MAAMqiD,EAAI,IAAIslC,GAAG,CACbxqE,KAAM9D,IAGFpV,EAAE8yE,kBAAgB,IAAQ9pC,GAAGlgC,EAAGq1C,KAAM/oC,EAAEw+D,WAAa,WAAazsE,EAAEiM,OAASrX,EAAEwhD,OAAO,IAAIn5B,GAAEjN,GAAEimC,YAAa,iLAAmLrhD,EAAE6e,QAAQxF,IAE5SjV,MAAO2I,GAAK/M,EAAEwhD,OAAOz0C,KACrBq1C,EAAI,IAAI6+B,GAAG5nE,EAAGgpC,EAAG,CACjB6+B,wBAAwB,EACxB9C,IAAI,IAER,OAAOuC,GAAG5zE,EAAGq1C,GAZiC,OAa1CuoC,GAAG59E,GAAIA,EAAEg+C,WAAY9mD,EAAGoV,EAAGjO,KAAMA,EAAEsT,QA+B3C,SAASmsE,GAAG99E,EAAG9I,EAAGoV,EAAGjO,GACrB,MAAMpL,EAAI,SAAS+M,EAAG9I,GAClB,IAAIoV,EAEJ,OADAA,EAAI,iBAAmBtM,GAAI,IAAK+9E,aAAaC,OAAOh+E,GAAKA,EAClD,SAASA,EAAG9I,GACf,OAAO,IAAI+T,GAAGjL,EAAG9I,GADd,CAEL,SAAS8I,EAAG9I,GACV,GAAI8I,aAAa+6B,WAAY,OAAO0/C,GAAGz6E,EAAG9I,GAC1C,GAAI8I,aAAa+8D,YAAa,OAAO0d,GAAG,IAAI1/C,WAAW/6B,GAAI9I,GAC3D,GAAI8I,aAAaw6B,eAAgB,OAAOx6B,EAAEy6B,YAC1C,MAAM,IAAIpmC,MAAM,4EAJlB,CAKAiY,GAAIpV,GAVA,CA2BToV,EAAGuiE,GAAG33E,IACP8I,EAAEg+C,WAAWgsB,6BA/9Cb,SAAYhqE,EAAG9I,EAAGoV,GAClB,MAAMjO,EAAIm1C,GAAExzC,IAER,eAEWA,EAAG9I,EAAGoV,GACjB,IACI,MAAMjO,QAAUnH,EAAEquE,cAClB,SAAU,SAASvlE,EAAG9I,GAClB,MAAMoV,EAAIknC,GAAExzC,GAAI3B,EAAIs1D,GAAGz8D,EAAE6yD,YACzB,OAAOz9C,EAAEgyC,YAAYC,eAAe,iBAAkB,YAAav+C,GAAKsM,EAAEimD,GAAG2I,kBAAkBl7D,EAAG9I,EAAEif,MAAMpE,MAAM/R,KAAOA,GAAKA,EAAE+pD,WAAWtS,UAAUp5C,IAAM,IAFnJ,CAMjB2B,EAAEq+C,WAAYhgD,GAAI,aAAanH,EAAE25C,QAASvkC,EAAE2xE,cAAc,SAASj+E,GACxD,MAAO,CACH60E,UAAW,UACXH,gBAAiB10E,EAAE80E,eACnBL,YAAaz0E,EAAE+0E,WACfD,eAAgB90E,EAAE80E,eAClBC,WAAY/0E,EAAE+0E,YAN6B,CAQjD12E,IAAKwT,QAAQC,QAAQ,IAAIkV,KAC3B1a,EAAE4xE,gBAAgBp4C,GAAGznC,IACrB,MAAMpL,EAAI,IAAIqhF,GAAGj2E,EAAG2B,EAAEq+C,WAAYnnD,EAAEojD,IACpC,IAAIhF,QAAUp+C,EAAEwvC,KAChB,KAAM4O,GAAK,CACP,MAAMt1C,QAAU/M,EAAEq+E,GAAGh8B,GACrBt1C,GAAKsM,EAAE4xE,gBAAgBl+E,GAAIs1C,QAAUp+C,EAAEwvC,KAE3C,MAAM2O,QAAUpiD,EAAEkrF,WAClB,aAAa1rD,GAAGzyB,EAAGq1C,EAAEo8B,QACH,SAEZ,SAASzxE,EAAG9I,GACd,MAAMoV,EAAIknC,GAAExzC,GACZ,OAAOsM,EAAEgyC,YAAYC,eAAe,cAAe,aAAcv+C,GAAKsM,EAAEimD,GAAG8I,mBAAmBr7D,EAAG9I,KAF/F,CAOb8I,EAAEq+C,WAAYhgD,GAAIiO,EAAE2xE,cAAc5oC,EAAEm/B,UAAW3iE,QAAQC,QAAQujC,EAAEm8B,IAC5D,MAAOxxE,GACL,OAAOmf,GAAE,aAAc,8BAA8Bnf,KAAMsM,EAAE8xE,UAAUp+E,GAAI6R,QAAQC,QAAQ,IAAIkV,OAxCnG,CA8DH3oB,EAAGnH,EAAGoV,GAAGyF,MAAM/R,IACZ3B,EAAEi3E,kBAAkB5H,mBAAmB1tE,MA85CvCq+E,OAAS5zE,GAAGzK,GAAI/M,EAAGoL,MAW3B,MAAMigF,GACF/kF,cAEI3F,KAAK+hF,GAAK9jE,QAAQC,UAGlBle,KAAKk8B,GAAK,GAGVl8B,KAAKkiF,IAAK,EAGVliF,KAAK6+B,GAAK,GAEV7+B,KAAKwiF,GAAK,KAGVxiF,KAAKi5B,IAAK,EAEVj5B,KAAKyiF,IAAK,EAEVziF,KAAK6sB,GAAK,GAEV7sB,KAAKm1E,GAAK,IAAI+F,GAAGl7E,KAAM,qBAIvBA,KAAKigC,GAAK,KACN,MAAM7zB,EAAI4uE,KACV5uE,GAAKyO,GAAE,aAAc,+BAAiCzO,EAAEuqE,iBAAkB32E,KAAKm1E,GAAGlB,MAEtF,MAAM7nE,EAAI4uE,KACV5uE,GAAK,mBAAqBA,EAAE4C,kBAAoB5C,EAAE4C,iBAAiB,mBAAoBhP,KAAKigC,IAE5FopD,qBACA,OAAOrpF,KAAKkiF,GAKT9L,iBAAiBhqE,GAEpBpM,KAAK2qF,QAAQv+E,GAEjBk9E,oCAAoCl9E,GAChCpM,KAAKuwC,KAELvwC,KAAK46B,GAAGxuB,GAEZyqE,oBAAoBzqE,GAChB,IAAKpM,KAAKkiF,GAAI,CACVliF,KAAKkiF,IAAK,EAAIliF,KAAKyiF,GAAKr2E,IAAK,EAC7B,MAAM9I,EAAI03E,KACV13E,GAAK,mBAAqBA,EAAEiM,qBAAuBjM,EAAEiM,oBAAoB,mBAAoBvP,KAAKigC,KAG1G0qD,QAAQv+E,GACJ,GAAIpM,KAAKuwC,KAAMvwC,KAAKkiF,GAEpB,OAAO,IAAIjkE,kBAIH,MAAM3a,EAAI,IAAIs9C,GACtB,OAAO5gD,KAAK46B,IAAI,IAAM56B,KAAKkiF,IAAMliF,KAAKyiF,GAAKxkE,QAAQC,WAAa9R,IAAI+R,KAAK7a,EAAE4a,QAAS5a,EAAEu9C,QACtFv9C,EAAEya,WAAWI,MAAI,IAAQ7a,EAAEya,UAE/BkjC,iBAAiB70C,GACbpM,KAAKo2E,kBAAgB,KAASp2E,KAAKk8B,GAAG56B,KAAK8K,GAAIpM,KAAK05B,QAKjD8tB,WACH,GAAI,IAAMxnD,KAAKk8B,GAAG58B,OAAQ,CACtB,UACUU,KAAKk8B,GAAG,KAAMl8B,KAAKk8B,GAAGzuB,QAASzN,KAAKm1E,GAAGt4D,QAC/C,MAAOzQ,GACL,IAAKs9C,GAAGt9C,GAAI,MAAMA,EAEFyO,GAAE,aAAc,0CAA4CzO,GAEhFpM,KAAKk8B,GAAG58B,OAAS,GAWjBU,KAAKm1E,GAAGrB,IAAE,IAAQ9zE,KAAK05B,QAG/BkB,GAAGxuB,GACC,MAAM9I,EAAItD,KAAK+hF,GAAG5jE,MAAI,KAASne,KAAKi5B,IAAK,EAAI7sB,IAAI44B,OAAO54B,IACpDpM,KAAKwiF,GAAKp2E,EAAGpM,KAAKi5B,IAAK,EACvB,MAAM31B,EAMN,SAAS8I,GACL,IAAI9I,EAAI8I,EAAEvG,SAAW,GAErB,OADAuG,EAAEw+E,QAAUtnF,EAAI8I,EAAEw+E,MAAMnlF,SAAS2G,EAAEvG,SAAWuG,EAAEw+E,MAAQx+E,EAAEvG,QAAU,KAAOuG,EAAEw+E,OACtEtnF,EAHX,CAoBP8I,GAIO,MAAMiE,GAAE,6BAA8B/M,GAAI8I,KAC1C+R,MAAM/R,IAAMpM,KAAKi5B,IAAK,EAAI7sB,QAC9B,OAAOpM,KAAK+hF,GAAKz+E,EAAGA,EAExBinD,kBAAkBn+C,EAAG9I,EAAGoV,GACpB1Y,KAAKuwC,KAELvwC,KAAK6sB,GAAG9gB,QAAQK,IAAM,IAAM9I,EAAI,GAChC,MAAMmH,EAAI+jB,GAAGq8D,kBAAkB7qF,KAAMoM,EAAG9I,EAAGoV,GAAItM,GAAKpM,KAAKghC,GAAG50B,KAC5D,OAAOpM,KAAK6+B,GAAGv9B,KAAKmJ,GAAIA,EAE5B8lC,KACIvwC,KAAKwiF,IAAMp2C,KAEf0yC,6BAIOt3B,WAKH,IAAIp7C,EACJ,GACIA,EAAIpM,KAAK+hF,SAAU31E,QACdA,IAAMpM,KAAK+hF,IAKjBrgD,GAAGt1B,GACN,IAAK,MAAM9I,KAAKtD,KAAK6+B,GAAI,GAAIv7B,EAAE63E,UAAY/uE,EAAG,OAAO,EACrD,OAAO,EAQJmE,GAAGnE,GAEN,OAAOpM,KAAK0iF,KAAKvkE,WAEbne,KAAK6+B,GAAG2wB,MAAI,CAAGpjD,EAAG9I,IAAM8I,EAAE6yE,aAAe37E,EAAE27E,eAC3C,IAAK,MAAM37E,KAAKtD,KAAK6+B,GAAI,GAAIv7B,EAAE83E,YAAa,QAA4BhvE,GAAK9I,EAAE63E,UAAY/uE,EAAG,MAC9F,OAAOpM,KAAK0iF,QAKbE,GAAGx2E,GACNpM,KAAK6sB,GAAGvrB,KAAK8K,GAE4C40B,GAAG50B,GAE5D,MAAM9I,EAAItD,KAAK6+B,GAAG9yB,QAAQK,GAC1BpM,KAAK6+B,GAAG3nB,OAAO5T,EAAG,IAI1B,SAASwnF,GAAG1+E,GAKR,OAAO,SAASA,EAAG9I,GACf,GAAI,iBAAmB8I,GAAK,OAASA,EAAG,OAAO,EAC/C,MAAMsM,EAAItM,EACV,IAAK,MAAMA,IAwBX,CAAE,OAAQ,QAAS,YAxBA,GAAIA,KAAKsM,GAAK,mBAAqBA,EAAEtM,GAAI,OAAO,EACnE,OAAO,EAJJ,CA2BNA,GAGL,MAAM2+E,GACFplF,cACI3F,KAAKgrF,kBAAoB,GAAIhrF,KAAKirF,wBAA0B,IAAIrqC,GAAG5gD,KAAKkrF,cAAgB,CACpFjK,UAAW,UACXE,WAAY,EACZD,eAAgB,EAChBL,YAAa,EACbC,gBAAiB,GAUlBqK,WAAW/+E,EAAG9I,EAAGoV,GACpB1Y,KAAKgrF,kBAAoB,CACrBxuE,KAAMpQ,EACN3I,MAAOH,EACPinF,SAAU7xE,GAOXssB,MAAM54B,GACT,OAAOpM,KAAKirF,wBAAwBltE,QAAQinB,MAAM54B,GAQ/C+R,KAAK/R,EAAG9I,GACX,OAAOtD,KAAKirF,wBAAwBltE,QAAQI,KAAK/R,EAAG9I,GAOjD+mF,cAAcj+E,GACjBpM,KAAKsqF,gBAAgBl+E,GAAIpM,KAAKgrF,kBAAkBT,UAAYvqF,KAAKgrF,kBAAkBT,WACnFvqF,KAAKirF,wBAAwB/sE,QAAQ9R,GAOlCo+E,UAAUp+E,GACbpM,KAAKkrF,cAAcjK,UAAY,QAASjhF,KAAKgrF,kBAAkBxuE,MAAQxc,KAAKgrF,kBAAkBxuE,KAAKxc,KAAKkrF,eACxGlrF,KAAKgrF,kBAAkBvnF,OAASzD,KAAKgrF,kBAAkBvnF,MAAM2I,GAAIpM,KAAKirF,wBAAwBpqC,OAAOz0C,GAOlGk+E,gBAAgBl+E,GACnBpM,KAAKkrF,cAAgB9+E,EAAGpM,KAAKgrF,kBAAkBxuE,MAAQxc,KAAKgrF,kBAAkBxuE,KAAKpQ,IAoB3C,MAAAg/E,IAAM,EAOtD,MAAMC,WAAWrH,GAEbr+E,YAAYyG,EAAG9I,EAAGoV,EAAGjO,GACjB1E,MAAMqG,EAAG9I,EAAGoV,EAAGjO,GAIfzK,KAAKgI,KAAO,YAAahI,KAAKsrF,OAAS,IAAIZ,GAAI1qF,KAAKqkF,iBAAmB,MAAQ55E,OAAI,EAASA,EAAEzE,OAAS,YAE3Go/E,aACI,OAAOplF,KAAKurF,kBAGZ7uD,GAAG18B,MAAOA,KAAKurF,iBAAiB3O,aAepC,SAAS4O,GAAGp/E,EAAG9I,EAAGoV,GAClBA,IAAMA,EAAI,aACV,MAAMjO,EAAIghF,EAAar/E,EAAG,aAC1B,GAAI3B,EAAEihF,cAAchzE,GAAI,CACpB,MAAMtM,EAAI3B,EAAEo3C,aAAa,CACrB8pC,WAAYjzE,IAEhB,GAAI9R,EADI6D,EAAE+tC,WAAW9/B,GACZpV,GAAI,OAAO8I,EACpB,MAAM,IAAIsb,GAAEjN,GAAE4lC,oBAAqB,oPAEvC,QAAI,IAAW/8C,EAAE2/E,iBAAmB,IAAM3/E,EAAE2/E,gBAAkB3/E,EAAE2/E,eAAiB,QAAS,MAAM,IAAIv7D,GAAEjN,GAAEslC,iBAAkB,2CAC1H,OAAOt1C,EAAE4sE,WAAW,CAChBloE,QAAS7L,EACTsoF,mBAAoBlzE,IAI5B,SAASmzE,GAAGvoF,EAAGoV,GACX,MAAMjO,EAAI,iBAAmBnH,EAAIA,EAAI8I,IAAK/M,EAAI,iBAAmBiE,EAAIA,EAAIoV,GAAK,YAAagpC,EAAI+pC,EAAahhF,EAAG,aAAao3C,aAAa,CACrI8pC,WAAYtsF,IAEhB,IAAKqiD,EAAE+iC,aAAc,CACjB,MAAMr4E,EAAImC,EAAE,aACZnC,GAAKk5E,GAAG5jC,KAAMt1C,GAElB,OAAOs1C,EAKP,SAASoqC,GAAG1/E,GACZ,OAAOA,EAAEm/E,kBAAoB7uD,GAAGtwB,GAAIA,EAAEm/E,iBAAiBnC,sBAAuBh9E,EAAEm/E,iBAGpF,SAAS7uD,GAAGtwB,GACR,IAAI9I,EACJ,MAAMoV,EAAItM,EAAE84E,kBAAmBz6E,EAAI,SAAS2B,EAAG9I,EAAGoV,EAAGjO,GACjD,OAAO,IAAIihD,GAAGt/C,EAAG9I,EAAGoV,EAAGjO,EAAEpG,KAAMoG,EAAEqhD,IAAKrhD,EAAEq5E,6BAA8Br5E,EAAEs5E,kCAAmCt5E,EAAE+jC,iBAD9E,CAoBlCpiC,EAAE+3E,aAAc,QAAU7gF,EAAI8I,EAAEg4E,YAAS,IAAW9gF,OAAI,EAASA,EAAE6L,QAAQy8C,QAAU,GAAIx/C,EAAEi4E,gBAAiB3rE,GAC7GtM,EAAEm/E,iBAAmB,IAAIxC,GAAG38E,EAAE63E,iBAAkB73E,EAAE83E,qBAAsB93E,EAAEk/E,OAAQ7gF,GAyBlF,SAASshF,GAAG3/E,EAAG9I,GACf0oF,GAAG5/E,EAAIrB,GAAGqB,EAAGi/E,KACb,MAAM3yE,EAAIozE,GAAG1/E,GAAI3B,EAAI2B,EAAE84E,kBAAmB7lF,EAAI,IAAI+jF,GAClD,OAAO6I,GAAGvzE,EAAGrZ,EAAG,IAAI6M,GAAG7M,EAAGoL,EAAEw4E,eAAgB,MAAQ3/E,OAAI,EAASA,EAAE4/E,iBAwBnE,SAASgJ,GAAG9/E,GACZ4/E,GAAG5/E,EAAIrB,GAAGqB,EAAGi/E,KACb,MAAM/nF,EAAIwoF,GAAG1/E,GAAIsM,EAAItM,EAAE84E,kBAAmBz6E,EAAI,IAAI24E,GAClD,OAAO6I,GAAG3oF,EAAGmH,EAAG,IAAIqF,GAAGrF,EAAGiO,EAAEuqE,iBAQ5B,SAASgJ,GAAG7/E,EAAG9I,EAAGoV,GAClB,MAAMjO,EAAI,IAAIm2C,GACd,OAAOx0C,EAAEg+C,WAAWugC,mBAChB,UACUn1E,GAAGpJ,EAAGsM,SAAUgxE,GAAGt9E,EAAG9I,GAAImH,EAAEyT,UACpC,MAAO9R,GACL,MAAM9I,EAAI8I,EACV,IAKA,SAASA,GACL,MAAI,kBAAoBA,EAAEpG,KAAaoG,EAAExG,OAAS6U,GAAE4lC,qBAAuBj0C,EAAExG,OAAS6U,GAAE+lC,gBACpF,oBAAsB2rC,cAAgB//E,aAAa+/E,gBAWhD,KAAO//E,EAAExG,MAAQ,KAAOwG,EAAExG,MAGjC,KAAOwG,EAAExG,MAhBb,CAwCPtC,GAAI,MAAMA,EACHioB,GAAE,6EAA+EjoB,GACjFmH,EAAEo2C,OAAOv9C,OAEb6a,MAAI,IAAQ1T,EAAEsT,UAGtB,SAASquE,GAAGhgF,GACR,GAAIA,EAAEq4E,eAAiBr4E,EAAEs4E,YAAa,MAAM,IAAIh9D,GAAEjN,GAAE4lC,oBAAqB,yGACzE,MAAM/8C,EAAI,IAAIs9C,GACd,OAAOx0C,EAAEk/E,OAAOhC,+CACZ,UACU9hC,eAAep7C,GACjB,IAAK28C,GAAGluC,IAAK,OAAOoD,QAAQC,UAC5B,MAAM5a,EAAI8I,EAAI,aACR28C,GAAGpqB,OAAOr7B,GAHdkkD,CAqCbwvB,GAAG5qE,EAAE+3E,YAAa/3E,EAAEi4E,kBAAmB/gF,EAAE4a,UACpC,MAAO9R,GACL9I,EAAEu9C,OAAOz0C,OAEZ9I,EAAEya,QAkBP,SAASsuE,GAAGjgF,GACZ,OAAO,SAASA,GACZ,MAAM9I,EAAI,IAAIs9C,GACd,OAAOx0C,EAAEg+C,WAAWgsB,kBAAgB,SAp7ExC5uB,eAAkBp7C,EAAG9I,GACrB,MAAMoV,EAAIknC,GAAExzC,GACZ6wE,GAAGvkE,EAAE8oE,cAAgB3mE,GAAE,aAAc,wHACrC,IACI,MAAMzO,QAAU,SAASA,GACrB,MAAM9I,EAAIs8C,GAAExzC,GACZ,OAAO9I,EAAEonD,YAAYC,eAAe,sCAAuC,YAAav+C,GAAK9I,EAAEqvE,cAAcrF,gCAAgClhE,KAFjI,CAGdsM,EAAE+xC,YACJ,IAAK,IAAMr+C,EAEX,YAAY9I,EAAE4a,UACd,MAAMzT,EAAIiO,EAAEuU,GAAG7d,IAAIhD,IAAM,GACzB3B,EAAEnJ,KAAKgC,GAAIoV,EAAEuU,GAAG5P,IAAIjR,EAAG3B,GACzB,MAAO2B,GACL,MAAMsM,EAAIw3B,GAAG9jC,EAAG,6DAChB9I,EAAEu9C,OAAOnoC,IAq6EyCmwE,OAAShyE,GAAGzK,GAAI9I,KAAMA,EAAEya,QAFvE,CAGL+tE,GAAG1/E,EAAIrB,GAAGqB,EAAGi/E,MAQf,SAASiB,GAAGlgF,GACZ,OA7wB0E,SAAYA,GACtF,OAAOA,EAAEg+C,WAAWugC,mBAChB,MAAMrnF,QAAU2N,GAAG7E,GAAIsM,QAAUoxE,GAAG19E,GACpC,OAAO9I,EAAE+wE,mBAAkB,GAAK,SAASjoE,GACrC,MAAM9I,EAAIs8C,GAAExzC,GACZ,OAAO9I,EAAE+2E,GAAG17C,OAAO,GAAoCw+C,GAAG75E,GAF9B,CAG9BoV,MAuwBCk0B,CAAGk/C,GAAG1/E,EAAIrB,GAAGqB,EAAGi/E,MAUvB,SAASkB,GAAGngF,GACZ,OA9wB0E,SAAYA,GACtF,OAAOA,EAAEg+C,WAAWugC,mBAChB,MAAMrnF,QAAU2N,GAAG7E,GAAIsM,QAAUoxE,GAAG19E,GACpC,OAAO9I,EAAE+wE,mBAAkB,GAAK7sB,eAAep7C,GAC3C,MAAM9I,EAAIs8C,GAAExzC,GACZ9I,EAAE+2E,GAAG3iE,IAAI,SAA0CwlE,GAAG55E,GAEtDA,EAAEy3E,GAAG19D,IAAI,WAJmBmqC,CAK9B9uC,MAswBC8zE,CAAGV,GAAG1/E,EAAIrB,GAAGqB,EAAGi/E,MAwBvB,SAASoB,GAAGrgF,GACZ,OAAO9I,EAAE8I,EAAEo4E,IAAK,YAAap4E,EAAE+3E,YAAYj4B,UAAW9/C,EAAE+4E,UAaxD,SAASuH,GAAGtgF,EAAG9I,GACf,MAAMoV,EAAIozE,GAAG1/E,EAAIrB,GAAGqB,EAAGi/E,KAAM5gF,EAAI,IAAIsgF,GACrC,OAAOb,GAAGxxE,EAAGtM,EAAE+3E,YAAa7gF,EAAGmH,GAAIA,EAcnC,SAASkiF,GAAGvgF,EAAG9I,GACf,OAlqBJ,SAAY8I,EAAG9I,GACX,OAAO8I,EAAEg+C,WAAWugC,SAAS,SAAY,SAASv+E,EAAG9I,GACjD,MAAMoV,EAAIknC,GAAExzC,GACZ,OAAOsM,EAAEgyC,YAAYC,eAAe,kBAAmB,YAAav+C,GAAKsM,EAAEimD,GAAG+I,cAAct7D,EAAG9I,KAF1D,OAGjCumF,GAAGz9E,GAAI9I,KA8pBRspF,CAAGd,GAAG1/E,EAAIrB,GAAGqB,EAAGi/E,KAAM/nF,GAAG6a,MAAM7a,GAAKA,EAAI,IAAImM,GAAGrD,EAAG,KAAM9I,EAAEo6B,OAAS,OAG9E,SAASsuD,GAAG5/E,GACR,GAAIA,EAAEq4E,cAAgBr4E,EAAEs4E,YAAa,MAAM,IAAIh9D,GAAEjN,GAAE4lC,oBAAqB,wKAsC5E,MAAMwsC,GAEFlnF,YAAYyG,GACRpM,KAAK8sF,YAAc1gF,EAOhBu2C,wBAAwBv2C,GAC3B,IACI,OAAO,IAAIygF,GAAG//B,GAAGa,iBAAiBvhD,IACpC,MAAOA,GACL,MAAM,IAAIsb,GAAEjN,GAAEslC,iBAAkB,gDAAkD3zC,IAOnFu2C,sBAAsBv2C,GACzB,OAAO,IAAIygF,GAAG//B,GAAGc,eAAexhD,IAM7B8gD,WACH,OAAOltD,KAAK8sF,YAAY5/B,WAMrBC,eACH,OAAOntD,KAAK8sF,YAAY3/B,eAMrB9nD,WACH,MAAO,iBAAmBrF,KAAKktD,WAAa,IAOzCpO,QAAQ1yC,GACX,OAAOpM,KAAK8sF,YAAYhuC,QAAQ1yC,EAAE0gF,cA2BtC,MAAMC,GAONpnF,eAAeyG,GACX,IAAK,IAAI9I,EAAI,EAAGA,EAAI8I,EAAE9M,SAAUgE,EAAG,GAAI,IAAM8I,EAAE9I,GAAGhE,OAAQ,MAAM,IAAIooB,GAAEjN,GAAEslC,iBAAkB,2EAC1F//C,KAAKgtF,cAAgB,IAAI9nC,GAAG94C,GAOzB0yC,QAAQ1yC,GACX,OAAOpM,KAAKgtF,cAAcluC,QAAQ1yC,EAAE4gF,gBAOxC,SAASC,KACT,OAAO,IAAIF,GAAG,YAsBd,MAAMG,GAKNvnF,YAAYyG,GACRpM,KAAKmtF,YAAc/gF,GA0BvB,MAAMghF,GAONznF,YAAYyG,EAAG9I,GACX,IAAK+pF,SAASjhF,IAAMA,GAAK,IAAMA,EAAI,GAAI,MAAM,IAAIsb,GAAEjN,GAAEslC,iBAAkB,0DAA4D3zC,GACnI,IAAKihF,SAAS/pF,IAAMA,GAAK,KAAOA,EAAI,IAAK,MAAM,IAAIokB,GAAEjN,GAAEslC,iBAAkB,6DAA+Dz8C,GACxItD,KAAKstF,KAAOlhF,EAAGpM,KAAKutF,MAAQjqF,EAIrB0rD,eACP,OAAOhvD,KAAKstF,KAILr+B,gBACP,OAAOjvD,KAAKutF,MAOTzuC,QAAQ1yC,GACX,OAAOpM,KAAKstF,OAASlhF,EAAEkhF,MAAQttF,KAAKutF,QAAUnhF,EAAEmhF,MAEmB/pC,SACnE,MAAO,CACHwL,SAAUhvD,KAAKstF,KACfr+B,UAAWjvD,KAAKutF,OAMjBhqC,WAAWn3C,GACd,OAAOw2C,GAAE5iD,KAAKstF,KAAMlhF,EAAEkhF,OAAS1qC,GAAE5iD,KAAKutF,MAAOnhF,EAAEmhF,QAmBnD,MAAMC,GAAK,WAEuD,MAAMC,GACxE9nF,YAAYyG,EAAG9I,EAAGoV,GACd1Y,KAAKwG,KAAO4F,EAAGpM,KAAKy7D,UAAYn4D,EAAGtD,KAAKo7D,gBAAkB1iD,EAE9D+vE,WAAWr8E,EAAG9I,GACV,OAAO,OAAStD,KAAKy7D,UAAY,IAAIR,GAAG7uD,EAAGpM,KAAKwG,KAAMxG,KAAKy7D,UAAWn4D,EAAGtD,KAAKo7D,iBAAmB,IAAIJ,GAAG5uD,EAAGpM,KAAKwG,KAAMlD,EAAGtD,KAAKo7D,kBAI5D,MAAMsyB,GAC5E/nF,YAAYyG,EAEZ9I,EAAGoV,GACC1Y,KAAKwG,KAAO4F,EAAGpM,KAAKy7D,UAAYn4D,EAAGtD,KAAKo7D,gBAAkB1iD,EAE9D+vE,WAAWr8E,EAAG9I,GACV,OAAO,IAAI23D,GAAG7uD,EAAGpM,KAAKwG,KAAMxG,KAAKy7D,UAAWn4D,EAAGtD,KAAKo7D,kBAI5D,SAASuyB,GAAGvhF,GACR,OAAQA,GACN,KAAK,EAEG,KAAK,EAEL,KAAK,EACX,OAAO,EAET,KAAK,EACL,KAAK,EACH,OAAO,EAET,QACE,MAAMggC,MAImD,MAAMwhD,GAmBnEjoF,YAAYyG,EAAG9I,EAAGoV,EAAGjO,EAAGpL,EAAGqiD,GACvB1hD,KAAKqlF,SAAWj5E,EAAGpM,KAAK2rD,WAAaroD,EAAGtD,KAAK0mD,GAAKhuC,EAAG1Y,KAAK6jF,0BAA4Bp5E,OAGtF,IAAWpL,GAAKW,KAAKyqF,KAAMzqF,KAAKo7D,gBAAkB/7D,GAAK,GAAIW,KAAKy7D,UAAY/Z,GAAK,GAEjFrkB,WACA,OAAOr9B,KAAKqlF,SAAShoD,KAErBntB,SACA,OAAOlQ,KAAKqlF,SAASn1E,GAEgDhE,GAAGE,GACxE,OAAO,IAAIwhF,GAAGzoF,OAAOgrD,OAAOhrD,OAAOgrD,OAAO,GAAInwD,KAAKqlF,UAAWj5E,GAAIpM,KAAK2rD,WAAY3rD,KAAK0mD,GAAI1mD,KAAK6jF,0BAA2B7jF,KAAKo7D,gBAAiBp7D,KAAKy7D,WAE3J3rD,GAAG1D,GACC,IAAI9I,EACJ,MAAMoV,EAAI,QAAUpV,EAAItD,KAAKq9B,YAAS,IAAW/5B,OAAI,EAASA,EAAE8gD,MAAMh4C,GAAI3B,EAAIzK,KAAKkM,GAAG,CAClFmxB,KAAM3kB,EACN0qE,IAAI,IAER,OAAO34E,EAAEsH,GAAG3F,GAAI3B,EAEpBg5E,GAAGr3E,GACC,IAAI9I,EACJ,MAAMoV,EAAI,QAAUpV,EAAItD,KAAKq9B,YAAS,IAAW/5B,OAAI,EAASA,EAAE8gD,MAAMh4C,GAAI3B,EAAIzK,KAAKkM,GAAG,CAClFmxB,KAAM3kB,EACN0qE,IAAI,IAER,OAAO34E,EAAEggF,KAAMhgF,EAEnBJ,GAAG+B,GAGC,OAAOpM,KAAKkM,GAAG,CACXmxB,UAAM,EACN+lD,IAAI,IAGZ73E,GAAGa,GACC,OAAOyhF,GAAGzhF,EAAGpM,KAAKqlF,SAASz4E,WAAY5M,KAAKqlF,SAAS3B,KAAM,EAAI1jF,KAAKq9B,KAAMr9B,KAAKqlF,SAASt6E,IAEVuqE,SAASlpE,GACvF,YAAO,IAAWpM,KAAKy7D,UAAU3iB,MAAMx1C,GAAK8I,EAAEw4C,WAAWthD,WAAQ,IAAWtD,KAAKo7D,gBAAgBtiB,MAAMx1C,GAAK8I,EAAEw4C,WAAWthD,EAAEstD,SAE/H65B,KAGI,GAAIzqF,KAAKq9B,KAAM,IAAK,IAAIjxB,EAAI,EAAGA,EAAIpM,KAAKq9B,KAAK/9B,OAAQ8M,IAAKpM,KAAK+R,GAAG/R,KAAKq9B,KAAKjuB,IAAIhD,IAEpF2F,GAAG3F,GACC,GAAI,IAAMA,EAAE9M,OAAQ,MAAMU,KAAKuL,GAAG,qCAClC,GAAIoiF,GAAG3tF,KAAKkQ,KAAOs9E,GAAG99E,KAAKtD,GAAI,MAAMpM,KAAKuL,GAAG,mDAOjD,MAAMuiF,GACNnoF,YAAYyG,EAAG9I,EAAGoV,GACd1Y,KAAK2rD,WAAav/C,EAAGpM,KAAK6jF,0BAA4BvgF,EAAGtD,KAAK0mD,GAAKhuC,GAAKuiE,GAAG7uE,GAE9Bu3E,GAAGv3E,EAAG9I,EAAGoV,EAAGjO,GAAI,GAC7D,OAAO,IAAImjF,GAAG,CACV19E,GAAI9D,EACJQ,WAAYtJ,EACZyH,GAAI2N,EACJ2kB,KAAM6nB,GAAGK,YACT69B,IAAI,EACJM,GAAIj5E,GACLzK,KAAK2rD,WAAY3rD,KAAK0mD,GAAI1mD,KAAK6jF,4BAI1C,SAASkK,GAAG3hF,GACR,MAAM9I,EAAI8I,EAAE84E,kBAAmBxsE,EAAIuiE,GAAG7uE,EAAE+3E,aACxC,OAAO,IAAI2J,GAAG1hF,EAAE+3E,cAAe7gF,EAAEugF,0BAA2BnrE,GAGlB,SAASs1E,GAAG5hF,EAAG9I,EAAGoV,EAAGjO,EAAGpL,EAAGqiD,EAAI,IACzE,MAAMD,EAAIr1C,EAAEu3E,GAAGjiC,EAAEusC,OAASvsC,EAAEwsC,YAAc,EAAkC,EAA6B5qF,EAAGoV,EAAGrZ,GAC/G8uF,GAAG,sCAAuC1sC,EAAGh3C,GAC7C,MAAMxI,EAAImsF,GAAG3jF,EAAGg3C,GAChB,IAAIliD,EAAG2H,EACP,GAAIw6C,EAAEusC,MAAO1uF,EAAI,IAAIm2D,GAAGjU,EAAEga,WAAYv0D,EAAIu6C,EAAE2Z,qBAAsB,GAAI1Z,EAAEwsC,YAAa,CACjF,MAAM9hF,EAAI,GACV,IAAK,MAAM3B,KAAKi3C,EAAEwsC,YAAa,CAC3B,MAAM7uF,EAAIgvF,GAAG/qF,EAAGmH,EAAGiO,GACnB,IAAK+oC,EAAE6zB,SAASj2E,GAAI,MAAM,IAAIqoB,GAAEjN,GAAEslC,iBAAkB,UAAU1gD,wEAC9DivF,GAAGliF,EAAG/M,IAAM+M,EAAE9K,KAAKjC,GAEvBE,EAAI,IAAIm2D,GAAGtpD,GAAIlF,EAAIu6C,EAAE2Z,gBAAgBpW,QAAQ54C,GAAK7M,EAAEo2D,OAAOvpD,EAAEwkD,cAC1DrxD,EAAI,KAAM2H,EAAIu6C,EAAE2Z,gBACvB,OAAO,IAAIqyB,GAAG,IAAI73B,GAAG3zD,GAAI1C,EAAG2H,GAGhC,MAAMqnF,WAAWrB,GACbsB,kBAAkBpiF,GACd,GAAI,IAAoCA,EAAE8D,GAAI,MAAM,IAAkC9D,EAAE8D,GAAK9D,EAAEb,GAAG,GAAGvL,KAAKmtF,sEAAwE/gF,EAAEb,GAAG,GAAGvL,KAAKmtF,wEAG/L,OAAO/gF,EAAEqvD,UAAUn6D,KAAK8K,EAAEixB,MAAO,KAErCyhB,QAAQ1yC,GACJ,OAAOA,aAAamiF,IAmBxB,SAASE,GAAGriF,EAAG9I,EAAGoV,GAClB,OAAO,IAAIk1E,GAAG,CACV19E,GAAI,EACJnF,GAAIzH,EAAE+hF,SAASt6E,GACf6B,WAAYR,EAAE+gF,YACd/J,GAAI1qE,GACLpV,EAAEqoD,WAAYroD,EAAEojD,GAAIpjD,EAAEugF,2BAG7B,MAAM6K,WAAWxB,GACbsB,kBAAkBpiF,GACd,OAAO,IAAI+tD,GAAG/tD,EAAEixB,KAAM,IAAIm8B,IAE9B1a,QAAQ1yC,GACJ,OAAOA,aAAasiF,IAI5B,MAAMC,WAAWzB,GACbvnF,YAAYyG,EAAG9I,GACXyC,MAAMqG,GAAIpM,KAAKsE,GAAKhB,EAExBkrF,kBAAkBpiF,GACd,MAAM9I,EAAImrF,GAAGzuF,KAAMoM,GACR,GAAKsM,EAAI1Y,KAAKsE,GAAGwtC,KAAK1lC,GAAKwiF,GAAGxiF,EAAG9I,KAAMmH,EAAI,IAAIgvD,GAAG/gD,GAC7D,OAAO,IAAIyhD,GAAG/tD,EAAEixB,KAAM5yB,GAE1Bq0C,QAAQ1yC,GAEJ,OAAOpM,OAASoM,GAIxB,MAAMyiF,WAAW3B,GACbvnF,YAAYyG,EAAG9I,GACXyC,MAAMqG,GAAIpM,KAAKsE,GAAKhB,EAExBkrF,kBAAkBpiF,GACd,MAAM9I,EAAImrF,GAAGzuF,KAAMoM,GACR,GAAKsM,EAAI1Y,KAAKsE,GAAGwtC,KAAK1lC,GAAKwiF,GAAGxiF,EAAG9I,KAAMmH,EAAI,IAAIkvD,GAAGjhD,GAC7D,OAAO,IAAIyhD,GAAG/tD,EAAEixB,KAAM5yB,GAE1Bq0C,QAAQ1yC,GAEJ,OAAOpM,OAASoM,GAIxB,MAAM0iF,WAAW5B,GACbvnF,YAAYyG,EAAG9I,GACXyC,MAAMqG,GAAIpM,KAAK4jF,GAAKtgF,EAExBkrF,kBAAkBpiF,GACd,MAAM9I,EAAI,IAAI02D,GAAG5tD,EAAEs6C,GAAI2S,GAAGjtD,EAAEs6C,GAAI1mD,KAAK4jF,KACrC,OAAO,IAAIzpB,GAAG/tD,EAAEixB,KAAM/5B,GAE1Bw7C,QAAQ1yC,GAEJ,OAAOpM,OAASoM,GAIwB,SAAS2iF,GAAG3iF,EAAG9I,EAAGoV,EAAGjO,GACjE,MAAMpL,EAAI+M,EAAEu3E,GAAG,EAAgCrgF,EAAGoV,GAClDy1E,GAAG,sCAAuC9uF,EAAGoL,GAC7C,MAAMi3C,EAAI,GAAID,EAAImU,GAAG/O,QACrBwF,GAAG5hD,GAAC,CAAI2B,EAAG3B,KACP,MAAMxI,EAAI+sF,GAAG1rF,EAAG8I,EAAGsM,GAGXjO,EAAIkM,EAAElM,GACd,MAAMlL,EAAIF,EAAEokF,GAAGxhF,GACf,GAAIwI,aAAa8jF,GAEjB7sC,EAAEpgD,KAAKW,OAAS,CACZ,MAAMmK,EAAIwiF,GAAGnkF,EAAGlL,GAChB,MAAQ6M,IAAMs1C,EAAEpgD,KAAKW,GAAIw/C,EAAEpkC,IAAIpb,EAAGmK,QAG1C,MAAMnK,EAAI,IAAIyzD,GAAGhU,GACjB,OAAO,IAAIgsC,GAAGjsC,EAAGx/C,EAAG5C,EAAE+7D,iBAGqC,SAAS6zB,GAAG7iF,EAAG9I,EAAGoV,EAAGjO,EAAGpL,EAAGqiD,GACtF,MAAMD,EAAIr1C,EAAEu3E,GAAG,EAAgCrgF,EAAGoV,GAAIzW,EAAI,CAAEosF,GAAG/qF,EAAGmH,EAAGiO,IAAMnZ,EAAI,CAAEF,GACjF,GAAIqiD,EAAEpiD,OAAS,GAAK,EAAG,MAAM,IAAIooB,GAAEjN,GAAEslC,iBAAkB,YAAYz8C,0GACnE,IAAK,IAAI8I,EAAI,EAAGA,EAAIs1C,EAAEpiD,OAAQ8M,GAAK,EAAGnK,EAAEX,KAAK+sF,GAAG/qF,EAAGo+C,EAAEt1C,KAAM7M,EAAE+B,KAAKogD,EAAEt1C,EAAI,IACxE,MAAMlF,EAAI,GAAIwlB,EAAIkpC,GAAG/O,QAGrB,IAAK,IAAIz6C,EAAInK,EAAE3C,OAAS,EAAG8M,GAAK,IAAKA,EAAG,IAAKkiF,GAAGpnF,EAAGjF,EAAEmK,IAAK,CACtD,MAAM9I,EAAIrB,EAAEmK,GACZ,IAAIsM,EAAInZ,EAAE6M,GAGFsM,EAAI/B,EAAE+B,GACd,MAAMjO,EAAIg3C,EAAEgiC,GAAGngF,GACf,GAAIoV,aAAa61E,GAEjBrnF,EAAE5F,KAAKgC,OAAS,CACZ,MAAM8I,EAAIwiF,GAAGl2E,EAAGjO,GAChB,MAAQ2B,IAAMlF,EAAE5F,KAAKgC,GAAIopB,EAAErP,IAAI/Z,EAAG8I,KAG1C,MAAMkpB,EAAI,IAAIogC,GAAGxuD,GACjB,OAAO,IAAIwmF,GAAGhhE,EAAG4I,EAAGmsB,EAAE2Z,iBAStB,SAAS8zB,GAAG9iF,EAAG9I,EAAGoV,EAAGjO,GAAI,GACzB,OAAOmkF,GAAGl2E,EAAGtM,EAAEu3E,GAAGl5E,EAAI,EAAuC,EAAkCnH,IAW/F,SAASsrF,GAAGxiF,EAAG9I,GACf,GAAI6rF,GAGJ/iF,EAAIuK,EAAEvK,IAAK,OAAO+hF,GAAG,2BAA4B7qF,EAAG8I,GAAIgiF,GAAGhiF,EAAG9I,GAC9D,GAAI8I,aAAa8gF,GAUjB,OAAO,SAAS9gF,EAAG9I,GAEf,IAAKqqF,GAAGrqF,EAAE4M,IAAK,MAAM5M,EAAEiI,GAAG,GAAGa,EAAE+gF,0DAC/B,IAAK7pF,EAAE+5B,KAAM,MAAM/5B,EAAEiI,GAAG,GAAGa,EAAE+gF,0DAC7B,MAAMz0E,EAAItM,EAAEoiF,kBAAkBlrF,GAC9BoV,GAAKpV,EAAE83D,gBAAgB95D,KAAKoX,GALzB,CAWNtM,EAAG9I,GAAI,KACR,QAAI,IAAW8I,GAAK9I,EAAEugF,0BAItB,OAAO,KACP,GAGAvgF,EAAE+5B,MAAQ/5B,EAAEm4D,UAAUn6D,KAAKgC,EAAE+5B,MAAOjxB,aAAa7L,MAAO,CAOpD,GAAI+C,EAAE+hF,SAASjC,IAAM,IAAyC9/E,EAAE4M,GAAI,MAAM5M,EAAEiI,GAAG,mCAC/E,OAAO,SAASa,EAAG9I,GACf,MAAMoV,EAAI,GACV,IAAIjO,EAAI,EACR,IAAK,MAAMpL,KAAK+M,EAAG,CACf,IAAIA,EAAIwiF,GAAGvvF,EAAGiE,EAAE+G,GAAGI,IACnB,MAAQ2B,IAGRA,EAAI,CACAoiD,UAAW,eACX91C,EAAEpX,KAAK8K,GAAI3B,IAEnB,MAAO,CACH2kD,WAAY,CACR3jC,OAAQ/S,IAdb,CAiBLtM,EAAG9I,GAET,OAAO,SAAS8I,EAAG9I,GACf,GAAI,QAAU8I,EAAIuK,EAAEvK,IAAK,MAAO,CAC5BoiD,UAAW,cAEf,GAAI,iBAAmBpiD,EAAG,OAAOitD,GAAG/1D,EAAEojD,GAAIt6C,GAC1C,GAAI,kBAAoBA,EAAG,MAAO,CAC9BwiD,aAAcxiD,GAElB,GAAI,iBAAmBA,EAAG,MAAO,CAC7B4hD,YAAa5hD,GAEjB,GAAIA,aAAapC,KAAM,CACnB,MAAM0O,EAAIsqC,GAAGosC,SAAShjF,GACtB,MAAO,CACHiiD,eAAgBuR,GAAGt8D,EAAEojD,GAAIhuC,IAGjC,GAAItM,aAAa42C,GAAI,CAIjB,MAAMtqC,EAAI,IAAIsqC,GAAG52C,EAAE62C,QAAS,IAAMr4C,KAAKixB,MAAMzvB,EAAE82C,YAAc,MAC7D,MAAO,CACHmL,eAAgBuR,GAAGt8D,EAAEojD,GAAIhuC,IAGjC,GAAItM,aAAaghF,GAAI,MAAO,CACxBr+B,cAAe,CACXC,SAAU5iD,EAAE4iD,SACZC,UAAW7iD,EAAE6iD,YAGrB,GAAI7iD,aAAaygF,GAAI,MAAO,CACxBh+B,WAAYgR,GAAGv8D,EAAEojD,GAAIt6C,EAAE0gF,cAE3B,GAAI1gF,aAAai6E,GAAI,CACjB,MAAM3tE,EAAIpV,EAAEqoD,WAAYlhD,EAAI2B,EAAEo6E,UAAUrC,YACxC,IAAK15E,EAAEq0C,QAAQpmC,GAAI,MAAMpV,EAAEiI,GAAG,sCAAsCd,EAAEwhD,aAAaxhD,EAAEyhD,uCAAuCxzC,EAAEuzC,aAAavzC,EAAEwzC,YAC7I,MAAO,CACH4C,eAAgBkR,GAAG5zD,EAAEo6E,UAAUrC,aAAe7gF,EAAEqoD,WAAYv/C,EAAEm6E,KAAKlpD,OAG3E,MAAM/5B,EAAEiI,GAAG,4BAA4Bm4E,GAAGt3E,MA1CvC,CAkDNA,EAAG9I,GAGR,SAAS8qF,GAAGhiF,EAAG9I,GACX,MAAMoV,EAAI,GACV,OAAO4zC,GAAGlgD,GAGV9I,EAAE+5B,MAAQ/5B,EAAE+5B,KAAK/9B,OAAS,GAAKgE,EAAEm4D,UAAUn6D,KAAKgC,EAAE+5B,MAAQgvB,GAAGjgD,GAAI,CAACA,EAAG3B,KACjE,MAAMpL,EAAIuvF,GAAGnkF,EAAGnH,EAAEwM,GAAG1D,IACrB,MAAQ/M,IAAMqZ,EAAEtM,GAAK/M,MACpB,CACDyuD,SAAU,CACNhI,OAAQptC,IAKpB,SAASy2E,GAAG/iF,GACR,QAAS,iBAAmBA,GAAK,OAASA,GAAKA,aAAa7L,OAAS6L,aAAapC,MAAQoC,aAAa42C,IAAM52C,aAAaghF,IAAMhhF,aAAaygF,IAAMzgF,aAAai6E,IAAMj6E,aAAa8gF,IAGvL,SAASiB,GAAG/hF,EAAG9I,EAAGoV,GACd,IAAKy2E,GAAGz2E,KAAO,SAAStM,GACpB,MAAO,iBAAmBA,GAAK,OAASA,IAAMjH,OAAOyzC,eAAexsC,KAAOjH,OAAOC,WAAa,OAASD,OAAOyzC,eAAexsC,IADnH,CAEbsM,GAAI,CACF,MAAMjO,EAAIi5E,GAAGhrE,GACb,KAAM,cAAgBjO,EAAInH,EAAEiI,GAAGa,EAAI,oBAAsB9I,EAAEiI,GAAGa,EAAI,IAAM3B,IAM5E,SAAS4jF,GAAGjiF,EAAG9I,EAAGoV,GAClB,IAGApV,EAAIqT,EAAErT,cAAeypF,GAAI,OAAOzpF,EAAE0pF,cAClC,GAAI,iBAAmB1pF,EAAG,OAAO0rF,GAAG5iF,EAAG9I,GACvC,MAAMuqF,GAAG,kDAAmDzhF,GACxC,OACR,EAAQsM,GAKpB,MAAM22E,GAAK,IAAI/2D,OAAO,iBAUtB,SAAS02D,GAAG5iF,EAAG9I,EAAGoV,GAClB,GAAIpV,EAAEgsF,OAAOD,KAAO,EAAG,MAAMxB,GAAG,uBAAuBvqF,wDAAyD8I,GAC5F,OACR,EAAQsM,GACpB,IACI,OAAO,IAAIq0E,MAAMzpF,EAAE4O,MAAM,MAAM86E,cACjC,MAAOviF,GACL,MAAMojF,GAAG,uBAAuBvqF,6EAA8E8I,GAC1F,OACR,EAAQsM,IAI5B,SAASm1E,GAAGzhF,EAAG9I,EAAGoV,EAAGjO,EAAGpL,GACpB,MAAMqiD,EAAIj3C,IAAMA,EAAEk6C,UAAWlD,OAAI,IAAWpiD,EAC5C,IAAI4C,EAAI,YAAYqB,+BACpBoV,IAAMzW,GAAK,0BAA2BA,GAAK,KAC3C,IAAI1C,EAAI,GACR,OAAQmiD,GAAKD,KAAOliD,GAAK,UAAWmiD,IAAMniD,GAAK,aAAakL,KAAMg3C,IAAMliD,GAAK,gBAAgBF,KAC7FE,GAAK,KAAM,IAAImoB,GAAEjN,GAAEslC,iBAAkB99C,EAAImK,EAAI7M,GAGwB,SAAS+uF,GAAGliF,EAAG9I,GACpF,OAAO8I,EAAEumD,MAAMvmD,GAAKA,EAAE0yC,QAAQx7C,KA2B9B,MAAMisF,GAMN5pF,YAAYyG,EAAG9I,EAAGoV,EAAGjO,EAAGpL,GACpBW,KAAKwvF,WAAapjF,EAAGpM,KAAKyvF,gBAAkBnsF,EAAGtD,KAAKumF,KAAO7tE,EAAG1Y,KAAK0vF,UAAYjlF,EAC/EzK,KAAK2vF,WAAatwF,EAE4DkjB,SAC9E,OAAOviB,KAAKumF,KAAKlpD,KAAKqnB,cAIfkrC,UACP,OAAO,IAAIvJ,GAAGrmF,KAAKwvF,WAAYxvF,KAAK2vF,WAAY3vF,KAAKumF,MAMlD9rB,SACH,OAAO,OAASz6D,KAAK0vF,UAQlBlpF,OACH,GAAIxG,KAAK0vF,UAAW,CAChB,GAAI1vF,KAAK2vF,WAAY,CAGjB,MAAMvjF,EAAI,IAAIyjF,GAAG7vF,KAAKwvF,WAAYxvF,KAAKyvF,gBAAiBzvF,KAAKumF,KAAMvmF,KAAK0vF,UACvD,MACjB,OAAO1vF,KAAK2vF,WAAWG,cAAc1jF,GAEzC,OAAOpM,KAAKyvF,gBAAgB3H,aAAa9nF,KAAK0vF,UAAUlpF,KAAKM,QAcrEsI,IAAIhD,GACA,GAAIpM,KAAK0vF,UAAW,CAChB,MAAMpsF,EAAItD,KAAK0vF,UAAUlpF,KAAKoqD,MAAMm/B,GAAG,uBAAwB3jF,IAC/D,GAAI,OAAS9I,EAAG,OAAOtD,KAAKyvF,gBAAgB3H,aAAaxkF,KAejE,MAAMusF,WAAWN,GAOjB/oF,OACI,OAAOT,MAAMS,QAMjB,SAASupF,GAAG3jF,EAAG9I,GACf,MAAO,iBAAmBA,EAAI0rF,GAAG5iF,EAAG9I,GAAKA,aAAaypF,GAAKzpF,EAAE0pF,cAAgB1pF,EAAEuE,UAAUmlF,cAkBzF,SAASgD,GAAG5jF,GACZ,GAAI,MAA6BA,EAAE6rD,WAAa,IAAM7rD,EAAE4rD,gBAAgB14D,OAAQ,MAAM,IAAIooB,GAAEjN,GAAE+lC,cAAe,0EAM7G,MAAMyvC,IASN,MAAMC,WAAWD,IAErB,SAASE,GAAG/jF,EAAG9I,KAAMoV,GACjB,IAAIjO,EAAI,GACRnH,aAAa2sF,IAAMxlF,EAAEnJ,KAAKgC,GAAImH,EAAIA,EAAE8Q,OAAO7C,GAAI,SAAStM,GACpD,MAAM9I,EAAI8I,EAAE44C,QAAQ54C,GAAKA,aAAagkF,KAAK9wF,OAAQoZ,EAAItM,EAAE44C,QAAQ54C,GAAKA,aAAaikF,KAAK/wF,OACxF,GAAIgE,EAAI,GAAKA,EAAI,GAAKoV,EAAI,EAAG,MAAM,IAAIgP,GAAEjN,GAAEslC,iBAAkB,gRAFlB,CAyB9Ct1C,GACD,IAAK,MAAMnH,KAAKmH,EAAG2B,EAAI9I,EAAEgtF,OAAOlkF,GAChC,OAAOA,EASP,MAAMikF,WAAWH,GAIjBvqF,YAAYyG,EAAG9I,EAAGoV,GACd3S,QAAS/F,KAAKuwF,OAASnkF,EAAGpM,KAAKwwF,IAAMltF,EAAGtD,KAAKywF,OAAS/3E,EAEtD1Y,KAAKgI,KAAO,QAEhB26C,eAAev2C,EAAG9I,EAAGoV,GACjB,OAAO,IAAI23E,GAAGjkF,EAAG9I,EAAGoV,GAExB43E,OAAOlkF,GACH,MAAM9I,EAAItD,KAAK0wF,OAAOtkF,GACtB,OAAOukF,GAAGvkF,EAAEu6E,OAAQrjF,GAAI,IAAImM,GAAGrD,EAAEo6E,UAAWp6E,EAAEk6E,UAAW5tB,GAAGtsD,EAAEu6E,OAAQrjF,IAE1EotF,OAAOtkF,GACH,MAAM9I,EAAIyqF,GAAG3hF,EAAEo6E,WAAY9tE,EAAI,SAAStM,EAAG9I,EAAGoV,EAAGjO,EAAGpL,EAAGqiD,EAAGD,GACtD,IAAIx/C,EACJ,GAAI5C,EAAE+lD,aAAc,CAChB,GAAI,mBAAmD1D,GAAK,uBAA2DA,EAAG,MAAM,IAAIh6B,GAAEjN,GAAEslC,iBAAkB,qCAAqC2B,+BAC/L,GAAI,OAA2BA,GAAK,WAAmCA,EAAG,CACtEkvC,GAAGnvC,EAAGC,GACN,MAAMp+C,EAAI,GACV,IAAK,MAAMoV,KAAK+oC,EAAGn+C,EAAEhC,KAAKuvF,GAAGpmF,EAAG2B,EAAGsM,IACnCzW,EAAI,CACAmtD,WAAY,CACR3jC,OAAQnoB,SAGbrB,EAAI4uF,GAAGpmF,EAAG2B,EAAGq1C,OACjB,OAA2BC,GAAK,WAAmCA,GAAK,uBAA2DA,GAAKkvC,GAAGnvC,EAAGC,GACrJz/C,EAAIitF,GAAGx2E,EAGC,QAHK+oC,EACM,OAA2BC,GAAK,WAAmCA,GACtF,OAAOsP,GAAG5qD,OAAO/G,EAAGqiD,EAAGz/C,GAjBI,CAkB7BmK,EAAEu6E,OAAQ,EAASrjF,EAAG8I,EAAEo6E,UAAUrC,YAAankF,KAAKuwF,OAAQvwF,KAAKwwF,IAAKxwF,KAAKywF,QAC7E,OAAO/3E,GAcX,SAASo4E,GAAG1kF,EAAG9I,EAAGoV,GAClB,MAAMjO,EAAInH,EAAGjE,EAAI0wF,GAAG,QAAS3jF,GAC7B,OAAOikF,GAAGU,QAAQ1xF,EAAGoL,EAAGiO,GAWxB,MAAM03E,WAAWH,GAIjBtqF,YAEAyG,EAAG9I,GACCyC,QAAS/F,KAAKgI,KAAOoE,EAAGpM,KAAKgxF,kBAAoB1tF,EAErDq/C,eAAev2C,EAAG9I,GACd,OAAO,IAAI8sF,GAAGhkF,EAAG9I,GAErBotF,OAAOtkF,GACH,MAAM9I,EAAItD,KAAKgxF,kBAAkBl/C,KAAKxuC,GAAKA,EAAEotF,OAAOtkF,KAAK44C,QAAQ54C,GAAKA,EAAE0lD,aAAaxyD,OAAS,IAC9F,OAAO,IAAMgE,EAAEhE,OAASgE,EAAE,GAAK6R,GAAG/O,OAAO9C,EAAGtD,KAAKixF,gBAErDX,OAAOlkF,GACH,MAAM9I,EAAItD,KAAK0wF,OAAOtkF,GACtB,OAAO,IAAM9I,EAAEwuD,aAAaxyD,OAAS8M,GAAK,SAASA,EAAG9I,GAClD,IAAIoV,EAAItM,EACR,MAAM3B,EAAInH,EAAEuuD,sBACZ,IAAK,MAAMzlD,KAAK3B,EAAGkmF,GAAGj4E,EAAGtM,GAAIsM,EAAIggD,GAAGhgD,EAAGtM,GAHD,CAOzCA,EAAEu6E,OAAQrjF,GAAI,IAAImM,GAAGrD,EAAEo6E,UAAWp6E,EAAEk6E,UAAW5tB,GAAGtsD,EAAEu6E,OAAQrjF,KAEjE4tF,uBACI,OAAOlxF,KAAKgxF,kBAEhBC,eACI,MAAO,QAAUjxF,KAAKgI,KAAO,MAAoC,MAcrE,SAASmpF,MAAM/kF,GAEf,OAAOA,EAAE8J,SAAS9J,GAAKglF,GAAG,KAAMhlF,KAAMgkF,GAAGW,QAAQ,KAAkC3kF,GAanF,SAASilF,MAAMjlF,GAEf,OAAOA,EAAE8J,SAAS9J,GAAKglF,GAAG,MAAOhlF,KAAMgkF,GAAGW,QAAQ,MAAoC3kF,GAWtF,MAAMklF,WAAWpB,GAIjBvqF,YAAYyG,EAAG9I,GACXyC,QAAS/F,KAAKuwF,OAASnkF,EAAGpM,KAAKuxF,WAAajuF,EAE5CtD,KAAKgI,KAAO,UAEhB26C,eAAev2C,EAAG9I,GACd,OAAO,IAAIguF,GAAGllF,EAAG9I,GAErBgtF,OAAOlkF,GACH,MAAM9I,EAAI,SAAS8I,EAAG9I,EAAGoV,GACrB,GAAI,OAAStM,EAAEirD,QAAS,MAAM,IAAI3vC,GAAEjN,GAAEslC,iBAAkB,wFACxD,GAAI,OAAS3zC,EAAEkrD,MAAO,MAAM,IAAI5vC,GAAEjN,GAAEslC,iBAAkB,qFACtD,MAAMt1C,EAAI,IAAImoD,GAAGtvD,EAAGoV,GACpB,OAAO,SAAStM,EAAG9I,GACf,GAAI,OAAS80D,GAAGhsD,GAAI,CAEhB,MAAMsM,EAAI2/C,GAAGjsD,GACb,OAASsM,GAAK84E,GAAGplF,EAAGsM,EAAGpV,EAAEstD,QAJ1B,CAMLxkD,EAAG3B,GAAIA,EAVH,CAsBb2B,EAAEu6E,OAAQ3mF,KAAKuwF,OAAQvwF,KAAKuxF,YACzB,OAAO,IAAI9hF,GAAGrD,EAAEo6E,UAAWp6E,EAAEk6E,UAAW,SAASl6E,EAAG9I,GAEhD,MAAMoV,EAAItM,EAAE4rD,gBAAgBz8C,OAAO,CAAEjY,IACrC,OAAO,IAAIy0D,GAAG3rD,EAAEixB,KAAMjxB,EAAEo5C,gBAAiB9sC,EAAGtM,EAAE4lD,QAAQvmD,QAASW,EAAEi4C,MAAOj4C,EAAE6rD,UAAW7rD,EAAEirD,QAASjrD,EAAEkrD,OAH9D,CAItClrD,EAAEu6E,OAAQrjF,KAehB,SAASmuF,GAAGrlF,EAAG9I,EAAI,OACnB,MAAMoV,EAAIpV,EAAGmH,EAAIslF,GAAG,UAAW3jF,GAC/B,OAAOklF,GAAGP,QAAQtmF,EAAGiO,GASrB,MAAMg5E,WAAWxB,GAIjBvqF,YAEAyG,EAAG9I,EAAGoV,GACF3S,QAAS/F,KAAKgI,KAAOoE,EAAGpM,KAAK2xF,OAASruF,EAAGtD,KAAK4xF,WAAal5E,EAE/DiqC,eAAev2C,EAAG9I,EAAGoV,GACjB,OAAO,IAAIg5E,GAAGtlF,EAAG9I,EAAGoV,GAExB43E,OAAOlkF,GACH,OAAO,IAAIqD,GAAGrD,EAAEo6E,UAAWp6E,EAAEk6E,UAAW3tB,GAAGvsD,EAAEu6E,OAAQ3mF,KAAK2xF,OAAQ3xF,KAAK4xF,cAU3E,SAASC,GAAGzlF,GACZ,OAAOu3E,GAAG,QAASv3E,GAAIslF,GAAGX,QAAQ,QAAS3kF,EAAG,KAY9C,SAAS0lF,GAAG1lF,GACZ,OAAOu3E,GAAG,cAAev3E,GAAIslF,GAAGX,QAAQ,cAAe3kF,EAAG,KAS1D,MAAM2lF,WAAW7B,GAIjBvqF,YAEAyG,EAAG9I,EAAGoV,GACF3S,QAAS/F,KAAKgI,KAAOoE,EAAGpM,KAAKgyF,aAAe1uF,EAAGtD,KAAKiyF,WAAav5E,EAErEiqC,eAAev2C,EAAG9I,EAAGoV,GACjB,OAAO,IAAIq5E,GAAG3lF,EAAG9I,EAAGoV,GAExB43E,OAAOlkF,GACH,MAAM9I,EAAI4uF,GAAG9lF,EAAGpM,KAAKgI,KAAMhI,KAAKgyF,aAAchyF,KAAKiyF,YACnD,OAAO,IAAIxiF,GAAGrD,EAAEo6E,UAAWp6E,EAAEk6E,UAAW,SAASl6E,EAAG9I,GAChD,OAAO,IAAIy0D,GAAG3rD,EAAEixB,KAAMjxB,EAAEo5C,gBAAiBp5C,EAAE4rD,gBAAgBvsD,QAASW,EAAE4lD,QAAQvmD,QAASW,EAAEi4C,MAAOj4C,EAAE6rD,UAAW30D,EAAG8I,EAAEkrD,OAD9E,CAEtClrD,EAAEu6E,OAAQrjF,KAIpB,SAAS6uF,MAAM/lF,GACX,OAAO2lF,GAAGhB,QAAQ,UAAW3kF,GACd,GAGnB,SAASgmF,MAAMhmF,GACX,OAAO2lF,GAAGhB,QAAQ,aAAc3kF,GACjB,GASf,MAAMimF,WAAWnC,GAIjBvqF,YAEAyG,EAAG9I,EAAGoV,GACF3S,QAAS/F,KAAKgI,KAAOoE,EAAGpM,KAAKgyF,aAAe1uF,EAAGtD,KAAKiyF,WAAav5E,EAErEiqC,eAAev2C,EAAG9I,EAAGoV,GACjB,OAAO,IAAI25E,GAAGjmF,EAAG9I,EAAGoV,GAExB43E,OAAOlkF,GACH,MAAM9I,EAAI4uF,GAAG9lF,EAAGpM,KAAKgI,KAAMhI,KAAKgyF,aAAchyF,KAAKiyF,YACnD,OAAO,IAAIxiF,GAAGrD,EAAEo6E,UAAWp6E,EAAEk6E,UAAW,SAASl6E,EAAG9I,GAChD,OAAO,IAAIy0D,GAAG3rD,EAAEixB,KAAMjxB,EAAEo5C,gBAAiBp5C,EAAE4rD,gBAAgBvsD,QAASW,EAAE4lD,QAAQvmD,QAASW,EAAEi4C,MAAOj4C,EAAE6rD,UAAW7rD,EAAEirD,QAAS/zD,GADpF,CAEtC8I,EAAEu6E,OAAQrjF,KAIpB,SAASgvF,MAAMlmF,GACX,OAAOimF,GAAGtB,QAAQ,YAAa3kF,GAChB,GAGnB,SAASmmF,MAAMnmF,GACX,OAAOimF,GAAGtB,QAAQ,QAAS3kF,GACZ,GAGgD,SAAS8lF,GAAG9lF,EAAG9I,EAAGoV,EAAGjO,GACpF,GAAIiO,EAAE,GAAK/B,EAAE+B,EAAE,IAAKA,EAAE,aAAc62E,GAAI,OAAO,SAASnjF,EAAG9I,EAAGoV,EAAGjO,EAAGpL,GAChE,IAAKoL,EAAG,MAAM,IAAIid,GAAEjN,GAAEwlC,UAAW,uDAAuDvnC,QACxF,MAAMgpC,EAAI,GAQF,IAAK,MAAMhpC,KAAK6/C,GAAGnsD,GAAI,GAAIsM,EAAEk4C,MAAMxL,aAAc1D,EAAEpgD,KAAKsuD,GAAGtsD,EAAGmH,EAAE5D,UAAY,CAChF,MAAMuF,EAAI3B,EAAEjE,KAAKoqD,MAAMl4C,EAAEk4C,OACzB,GAAI/C,GAAGzhD,GAAI,MAAM,IAAIsb,GAAEjN,GAAEslC,iBAAkB,+FAAiGrnC,EAAEk4C,MAAQ,2HACtJ,GAAI,OAASxkD,EAAG,CACZ,MAAMA,EAAIsM,EAAEk4C,MAAM7L,kBAClB,MAAM,IAAIr9B,GAAEjN,GAAEslC,iBAAkB,+FAA+F3zC,4CAEnIs1C,EAAEpgD,KAAK8K,GAEX,OAAO,IAAIqkD,GAAG/O,EAAGriD,GAnB0B,CAuB9C+M,EAAEu6E,OAAQv6E,EAAEo6E,UAAUrC,YAAa7gF,EAAGoV,EAAE,GAAGg3E,UAAWjlF,GACvD,CACI,MAAMpL,EAAI0uF,GAAG3hF,EAAEo6E,WACf,OAAO,SAASp6E,EAAG9I,EAAGoV,EAAGjO,EAAGpL,EAAGqiD,GAE3B,MAAMD,EAAIr1C,EAAE4rD,gBACZ,GAAI34D,EAAEC,OAASmiD,EAAEniD,OAAQ,MAAM,IAAIooB,GAAEjN,GAAEslC,iBAAkB,kCAAkCt1C,8FAC3F,MAAMxI,EAAI,GACV,IAAK,IAAIy/C,EAAI,EAAGA,EAAIriD,EAAEC,OAAQoiD,IAAK,CAC/B,MAAMniD,EAAIF,EAAEqiD,GACZ,GAAID,EAAEC,GAAGkP,MAAMxL,aAAc,CACzB,GAAI,iBAAmB7lD,EAAG,MAAM,IAAImoB,GAAEjN,GAAEslC,iBAAkB,uDAAuDt1C,yBAAyBlL,KAC1I,IAAK+4D,GAAGlsD,KAAO,IAAM7M,EAAEwM,QAAQ,KAAM,MAAM,IAAI2b,GAAEjN,GAAEslC,iBAAkB,+FAA+Ft1C,yCAAyClL,wBAC7M,MAAMmZ,EAAItM,EAAEixB,KAAK+mB,MAAMU,GAAGQ,WAAW/lD,IACrC,IAAK8lD,GAAGsS,cAAcj/C,GAAI,MAAM,IAAIgP,GAAEjN,GAAEslC,iBAAkB,qGAAqGt1C,kDAAkDiO,4DACjN,MAAMrZ,EAAI,IAAIgmD,GAAG3sC,GACjBzW,EAAEX,KAAKsuD,GAAGtsD,EAAGjE,QACV,CACH,MAAM+M,EAAI8iF,GAAGx2E,EAAGjO,EAAGlL,GACnB0C,EAAEX,KAAK8K,IAGf,OAAO,IAAIqkD,GAAGxuD,EAAGy/C,GAnBd,CAyBVt1C,EAAEu6E,OAAQv6E,EAAEo6E,UAAUrC,YAAa9kF,EAAGiE,EAAGoV,EAAGjO,IAIjD,SAASomF,GAAGzkF,EAAG9I,EAAGoV,GACd,GAAI,iBAAoBA,EAAI/B,EAAE+B,IAAK,CAC/B,GAAI,KAAOA,EAAG,MAAM,IAAIgP,GAAEjN,GAAEslC,iBAAkB,qHAC9C,IAAKuY,GAAGh1D,KAAO,IAAMoV,EAAE3M,QAAQ,KAAM,MAAM,IAAI2b,GAAEjN,GAAEslC,iBAAkB,yGAAyGrnC,gCAC9K,MAAMjO,EAAInH,EAAE+5B,KAAK+mB,MAAMU,GAAGQ,WAAW5sC,IACrC,IAAK2sC,GAAGsS,cAAcltD,GAAI,MAAM,IAAIid,GAAEjN,GAAEslC,iBAAkB,kIAAkIt1C,uDAAuDA,EAAEnL,YACrP,OAAOswD,GAAGxjD,EAAG,IAAIi5C,GAAG56C,IAExB,GAAIiO,aAAa2tE,GAAI,OAAOz2B,GAAGxjD,EAAGsM,EAAE6tE,MACpC,MAAM,IAAI7+D,GAAEjN,GAAEslC,iBAAkB,uHAAuH2jC,GAAGhrE,OAM1J,SAASk4E,GAAGxkF,EAAG9I,GACf,IAAK/C,MAAMC,QAAQ4L,IAAM,IAAMA,EAAE9M,OAAQ,MAAM,IAAIooB,GAAEjN,GAAEslC,iBAAkB,qDAAqDz8C,EAAE+B,wBAChI,GAAI+G,EAAE9M,OAAS,GAAI,MAAM,IAAIooB,GAAEjN,GAAEslC,iBAAkB,mBAAmBz8C,EAAE+B,4EAcxE,SAASsrF,GAAGvkF,EAAG9I,GACf,GAAIA,EAAEsuD,eAAgB,CAClB,MAAMl5C,EAAI2/C,GAAGjsD,GAAI3B,EAAInH,EAAEstD,MACvB,GAAI,OAASl4C,IAAMA,EAAEomC,QAAQr0C,GAAI,MAAM,IAAIid,GAAEjN,GAAEslC,iBAAkB,oJAAoJrnC,EAAErT,oBAAoBoF,EAAEpF,eAC7O,MAAMhG,EAAI+4D,GAAGhsD,GACb,OAAS/M,GAAKmyF,GAAGplF,EAAG3B,EAAGpL,GAE3B,MAAMqZ,EAAI,SAAStM,EAAG9I,GAClB,IAAK,MAAMoV,KAAKtM,EAAG,IAAK,MAAMA,KAAKsM,EAAEm5C,sBAAuB,GAAIvuD,EAAEyI,QAAQK,EAAE6kD,KAAO,EAAG,OAAO7kD,EAAE6kD,GAC/F,OAAO,KAFD,CAGR7kD,EAAE4lD,QAAS,SAAS5lD,GAClB,OAAQA,GACN,IAAK,KACH,MAAO,CAAE,KAAgC,UAE3C,IAAK,iBACH,MAAO,CAAE,iBAAiD,qBAAyD,UAErH,IAAK,KACH,MAAO,CAAE,qBAAyD,KAAyB,UAE7F,IAAK,qBACH,MAAO,CAAE,iBAAiD,qBAAyD,KAAyB,UAE9I,IAAK,SACH,MAAO,CAAE,iBAAiD,qBAAyD,KAAyB,SAAiC,MAE/K,QACE,MAAO,IAlBF,CAoBX9I,EAAE2tD,KACJ,GAAI,OAASv4C,EAEb,MAAMA,IAAMpV,EAAE2tD,GAAK,IAAIvpC,GAAEjN,GAAEslC,iBAAkB,gDAAgDz8C,EAAE2tD,GAAG5rD,uBAAyB,IAAIqiB,GAAEjN,GAAEslC,iBAAkB,kCAAkCz8C,EAAE2tD,GAAG5rD,6BAA6BqT,EAAErT,wBAG/N,SAASmsF,GAAGplF,EAAG9I,EAAGoV,GACd,IAAKA,EAAEomC,QAAQx7C,GAAI,MAAM,IAAIokB,GAAEjN,GAAEslC,iBAAkB,qGAAqGz8C,EAAE+B,yCAAyC/B,EAAE+B,0FAA0FqT,EAAErT,wBAGrS,SAAS+rF,GAAGhlF,EAAG9I,GACX,KAAMA,aAAa+sF,IAAM/sF,aAAa8sF,IAAK,MAAM,IAAI1oE,GAAEjN,GAAEslC,iBAAkB,YAAY3zC,oGAG3F,MAAMomF,GACF1K,aAAa17E,EAAG9I,EAAI,QAChB,OAAQmrD,GAAGriD,IACT,KAAK,EACH,OAAO,KAET,KAAK,EACH,OAAOA,EAAEwiD,aAEX,KAAK,EACH,OAAOnB,GAAGrhD,EAAE8iD,cAAgB9iD,EAAE+iD,aAEhC,KAAK,EACH,OAAOnvD,KAAKyyF,iBAAiBrmF,EAAEiiD,gBAEjC,KAAK,EACH,OAAOruD,KAAK0yF,uBAAuBtmF,EAAG9I,GAExC,KAAK,EACH,OAAO8I,EAAE4hD,YAEX,KAAK,EACH,OAAOhuD,KAAK2yF,aAAajlC,GAAGthD,EAAEyiD,aAEhC,KAAK,EACH,OAAO7uD,KAAK4yF,iBAAiBxmF,EAAE0iD,gBAEjC,KAAK,EACH,OAAO9uD,KAAK6yF,gBAAgBzmF,EAAE2iD,eAEhC,KAAK,EACH,OAAO/uD,KAAK8yF,aAAa1mF,EAAEgjD,WAAY9rD,GAEzC,KAAK,GACH,OAAOtD,KAAK+yF,cAAc3mF,EAAE0hD,SAAUxqD,GAExC,QACE,MAAM8oC,MAGd2mD,cAAc3mF,EAAG9I,GACb,MAAMoV,EAAI,GACV,OAAO2zC,GAAGjgD,EAAE05C,QAAM,CAAI15C,EAAG3B,KACrBiO,EAAEtM,GAAKpM,KAAK8nF,aAAar9E,EAAGnH,MAC3BoV,EAETm6E,gBAAgBzmF,GACZ,OAAO,IAAIghF,GAAG3/B,GAAGrhD,EAAE4iD,UAAWvB,GAAGrhD,EAAE6iD,YAEvC6jC,aAAa1mF,EAAG9I,GACZ,OAAQ8I,EAAEqf,QAAU,IAAIqmB,KAAK1lC,GAAKpM,KAAK8nF,aAAa17E,EAAG9I,KAE3DovF,uBAAuBtmF,EAAG9I,GACtB,OAAQA,GACN,IAAK,WACH,MAAMoV,EAAIu1C,GAAG7hD,GACb,OAAO,MAAQsM,EAAI,KAAO1Y,KAAK8nF,aAAapvE,EAAGpV,GAEjD,IAAK,WACH,OAAOtD,KAAKyyF,iBAAiBtkC,GAAG/hD,IAElC,QACE,OAAO,MAGfqmF,iBAAiBrmF,GACb,MAAM9I,EAAIiqD,GAAGnhD,GACb,OAAO,IAAI42C,GAAG1/C,EAAE2/C,QAAS3/C,EAAEkqD,OAE/BwlC,mBAAmB5mF,EAAG9I,GAClB,MAAMoV,EAAIosC,GAAGQ,WAAWl5C,GACxBmuB,GAAE2lC,GAAGxnD,IACL,MAAMjO,EAAI,IAAIuhD,GAAGtzC,EAAEtJ,IAAI,GAAIsJ,EAAEtJ,IAAI,IAAK/P,EAAI,IAAIgmD,GAAG3sC,EAAE6rC,SAAS,IAC5D,OAAO95C,EAAEq0C,QAAQx7C,IAEjB+M,GAAE,YAAYhR,gEAAgEoL,EAAEwhD,aAAaxhD,EAAEyhD,gGAAgG5oD,EAAE2oD,aAAa3oD,EAAE4oD,sBAChN7sD,GA4BJ,SAAS4zF,GAAG7mF,EAAG9I,EAAGoV,GAClB,IAAIjO,EAIJ,OAAOA,EAAI2B,EAAIsM,IAAMA,EAAEu1E,OAASv1E,EAAEw1E,aAAe9hF,EAAE8mF,YAAY5vF,EAAGoV,GAAKtM,EAAE8mF,YAAY5vF,GAAKA,EAC1FmH,EAGJ,MAAM0oF,WAAWX,GACb7sF,YAAYyG,GACRrG,QAAS/F,KAAKwmF,UAAYp6E,EAE9BumF,aAAavmF,GACT,OAAO,IAAIygF,GAAGzgF,GAElBwmF,iBAAiBxmF,GACb,MAAM9I,EAAItD,KAAKgzF,mBAAmB5mF,EAAGpM,KAAKwmF,UAAUrC,aACpD,OAAO,IAAIkC,GAAGrmF,KAAKwmF,UAA4B,KAAMljF,IAsBzD,MAAM8vF,GAENztF,YAAYyG,EAAG9I,GACXtD,KAAK62D,iBAAmBzqD,EAAGpM,KAAKk3E,UAAY5zE,EAOzCw7C,QAAQ1yC,GACX,OAAOpM,KAAK62D,mBAAqBzqD,EAAEyqD,kBAAoB72D,KAAKk3E,YAAc9qE,EAAE8qE,WAYhF,MAAMmc,WAAW9D,GAEjB5pF,YAAYyG,EAAG9I,EAAGoV,EAAGjO,EAAGpL,EAAGqiD,GACvB37C,MAAMqG,EAAG9I,EAAGoV,EAAGjO,EAAGi3C,GAAI1hD,KAAKwvF,WAAapjF,EAAGpM,KAAKszF,eAAiBlnF,EAAGpM,KAAKs3C,SAAWj4C,EAIjFo7D,SACH,OAAO10D,MAAM00D,SAeVj0D,KAAK4F,EAAI,IACZ,GAAIpM,KAAK0vF,UAAW,CAChB,GAAI1vF,KAAK2vF,WAAY,CAGjB,MAAMrsF,EAAI,IAAIiwF,GAAGvzF,KAAKwvF,WAAYxvF,KAAKyvF,gBAAiBzvF,KAAKumF,KAAMvmF,KAAK0vF,UAAW1vF,KAAKs3C,SACvE,MACjB,OAAOt3C,KAAK2vF,WAAWG,cAAcxsF,EAAG8I,GAE5C,OAAOpM,KAAKyvF,gBAAgB3H,aAAa9nF,KAAK0vF,UAAUlpF,KAAKM,MAAOsF,EAAEonF,mBAqB9EpkF,IAAIhD,EAAG9I,EAAI,IACP,GAAItD,KAAK0vF,UAAW,CAChB,MAAMh3E,EAAI1Y,KAAK0vF,UAAUlpF,KAAKoqD,MAAMm/B,GAAG,uBAAwB3jF,IAC/D,GAAI,OAASsM,EAAG,OAAO1Y,KAAKyvF,gBAAgB3H,aAAapvE,EAAGpV,EAAEkwF,oBAetE,MAAMD,WAAWF,GAcjB7sF,KAAK4F,EAAI,IACL,OAAOrG,MAAMS,KAAK4F,IAUtB,MAAMqnF,GAEN9tF,YAAYyG,EAAG9I,EAAGoV,EAAGjO,GACjBzK,KAAKwvF,WAAapjF,EAAGpM,KAAKyvF,gBAAkBnsF,EAAGtD,KAAK0zF,UAAYjpF,EAAGzK,KAAKs3C,SAAW,IAAI87C,GAAG3oF,EAAEosD,iBAAkBpsD,EAAEysE,WAChHl3E,KAAK09B,MAAQhlB,EAEmDs7D,WAChE,MAAM5nE,EAAI,GACV,OAAOpM,KAAKkW,SAAS5S,GAAK8I,EAAE9K,KAAKgC,KAAM8I,EAEmBsY,WAC1D,OAAO1kB,KAAK0zF,UAAU1f,KAAKtvD,KAEsCmiC,YACjE,OAAO,IAAM7mD,KAAK0kB,KAQfxO,QAAQ9J,EAAG9I,GACdtD,KAAK0zF,UAAU1f,KAAK99D,SAASwC,IACzBtM,EAAE9G,KAAKhC,EAAG,IAAIiwF,GAAGvzF,KAAKwvF,WAAYxvF,KAAKyvF,gBAAiB/2E,EAAE7R,IAAK6R,EAAG,IAAI06E,GAAGpzF,KAAK0zF,UAAUhU,YAAYhhD,IAAIhmB,EAAE7R,KAAM7G,KAAK0zF,UAAUxc,WAAYl3E,KAAK09B,MAAM4oD,eAWvJnP,WAAW/qE,EAAI,IAClB,MAAM9I,IAAM8I,EAAEm0E,uBACd,GAAIj9E,GAAKtD,KAAK0zF,UAAU9T,wBAAyB,MAAM,IAAIl4D,GAAEjN,GAAEslC,iBAAkB,+HACjF,OAAO//C,KAAK2zF,gBAAkB3zF,KAAK4zF,uCAAyCtwF,IAAMtD,KAAK2zF,eAEvF,SAASvnF,EAAG9I,GACR,GAAI8I,EAAEsnF,UAAUjU,QAAQ96B,UAAW,CAC/B,IAAIrhD,EAAI,EACR,OAAO8I,EAAEsnF,UAAUvc,WAAWrlC,KAAKp5B,IAC/B,MAAMjO,EAAI,IAAI8oF,GAAGnnF,EAAEojF,WAAYpjF,EAAEqjF,gBAAiB/2E,EAAExH,IAAIrK,IAAK6R,EAAExH,IAAK,IAAIkiF,GAAGhnF,EAAEsnF,UAAUhU,YAAYhhD,IAAIhmB,EAAExH,IAAIrK,KAAMuF,EAAEsnF,UAAUxc,WAAY9qE,EAAEsxB,MAAM4oD,WACnJ,OAAO5tE,EAAExH,IAAK,CACVlJ,KAAM,QACNkJ,IAAKzG,EACLopF,UAAW,EACXC,SAAUxwF,QAItB,CAGI,IAAIoV,EAAItM,EAAEsnF,UAAUjU,QACpB,OAAOrzE,EAAEsnF,UAAUvc,WAAWnyB,QAAQ54C,GAAK9I,GAAK,IAAgC8I,EAAEpE,OAAO8pC,KAAKxuC,IAC1F,MAAMmH,EAAI,IAAI8oF,GAAGnnF,EAAEojF,WAAYpjF,EAAEqjF,gBAAiBnsF,EAAE4N,IAAIrK,IAAKvD,EAAE4N,IAAK,IAAIkiF,GAAGhnF,EAAEsnF,UAAUhU,YAAYhhD,IAAIp7B,EAAE4N,IAAIrK,KAAMuF,EAAEsnF,UAAUxc,WAAY9qE,EAAEsxB,MAAM4oD,WACnJ,IAAIjnF,GAAK,EAAGqiD,GAAK,EACjB,OAAO,IAA6Bp+C,EAAE0E,OAAS3I,EAAIqZ,EAAE3M,QAAQzI,EAAE4N,IAAIrK,KAAM6R,EAAIA,EAAEimB,OAAOr7B,EAAE4N,IAAIrK,MAC5F,IAA+BvD,EAAE0E,OAAS0Q,EAAIA,EAAEhB,IAAIpU,EAAE4N,KAAMwwC,EAAIhpC,EAAE3M,QAAQzI,EAAE4N,IAAIrK,MAChF,CACImB,KAAM+rF,GAAGzwF,EAAE0E,MACXkJ,IAAKzG,EACLopF,SAAUx0F,EACVy0F,SAAUpyC,OA1B1B,CA8BE1hD,KAAMsD,GAAItD,KAAK4zF,qCAAuCtwF,GAAItD,KAAK2zF,gBAIzE,SAASI,GAAG3nF,GACR,OAAQA,GACN,KAAK,EACH,MAAO,QAET,KAAK,EACL,KAAK,EACH,MAAO,WAET,KAAK,EACH,MAAO,UAET,QACE,OAAOggC,MAYX,SAAS4nD,GAAG5nF,EAAG9I,GACf,OAAO8I,aAAainF,IAAM/vF,aAAa+vF,GAAKjnF,EAAEojF,aAAelsF,EAAEksF,YAAcpjF,EAAEm6E,KAAKznC,QAAQx7C,EAAEijF,QAAU,OAASn6E,EAAEsjF,UAAY,OAASpsF,EAAEosF,UAAYtjF,EAAEsjF,UAAU5wC,QAAQx7C,EAAEosF,aAAetjF,EAAEujF,aAAersF,EAAEqsF,WAAavjF,aAAaqnF,IAAMnwF,aAAamwF,IAAOrnF,EAAEojF,aAAelsF,EAAEksF,YAAcjlF,GAAG6B,EAAEsxB,MAAOp6B,EAAEo6B,QAAUtxB,EAAEkrC,SAASwH,QAAQx7C,EAAEg0C,WAAalrC,EAAEsnF,UAAU50C,QAAQx7C,EAAEowF,WA8BnX,SAASO,GAAG7nF,GACZA,EAAIrB,GAAGqB,EAAGi6E,IACV,MAAM/iF,EAAIyH,GAAGqB,EAAEo6E,UAAW6E,IAC1B,OAAOpB,GAAG6B,GAAGxoF,GAAI8I,EAAEm6E,MAAMpoE,MAAMzF,GAAKw7E,GAAG5wF,EAAG8I,EAAGsM,KAGjD,MAAMy7E,WAAW3B,GACb7sF,YAAYyG,GACRrG,QAAS/F,KAAKwmF,UAAYp6E,EAE9BumF,aAAavmF,GACT,OAAO,IAAIygF,GAAGzgF,GAElBwmF,iBAAiBxmF,GACb,MAAM9I,EAAItD,KAAKgzF,mBAAmB5mF,EAAGpM,KAAKwmF,UAAUrC,aACpD,OAAO,IAAIkC,GAAGrmF,KAAKwmF,UAA4B,KAAMljF,IAUzD,SAAS8wF,GAAGhoF,GACZA,EAAIrB,GAAGqB,EAAGi6E,IACV,MAAM/iF,EAAIyH,GAAGqB,EAAEo6E,UAAW6E,IAAK3yE,EAAIozE,GAAGxoF,GAAImH,EAAI,IAAI0pF,GAAG7wF,GACrD,OAzkFA,SAAY8I,EAAG9I,GACf,MAAMoV,EAAI,IAAIkoC,GACd,OAAOx0C,EAAEg+C,WAAWgsB,kBAAgB,SAAc5uB,eAAep7C,EAAG9I,EAAGoV,GACnE,IACI,MAAMjO,QAAU,SAAS2B,EAAG9I,GACxB,MAAMoV,EAAIknC,GAAExzC,GACZ,OAAOsM,EAAEgyC,YAAYC,eAAe,gBAAiB,YAAav+C,GAAKsM,EAAEsyC,eAAe6nB,YAAYzmE,EAAG9I,KAF3F,CAGd8I,EAAG9I,GACLmH,EAAEssD,kBAAoBr+C,EAAEwF,QAAQzT,GAAKA,EAAEusD,eAAiBt+C,EAAEwF,QAAQ,MAAQxF,EAAEmoC,OAAO,IAAIn5B,GAAEjN,GAAEimC,YAAa,mMAC1G,MAAOt0C,GACL,MAAM3B,EAAIylC,GAAG9jC,EAAG,2BAA2B9I,gBAC3CoV,EAAEmoC,OAAOp2C,IATiC+8C,OAe3CqiC,GAAGz9E,GAAI9I,EAAGoV,KAAMA,EAAEqF,QAwjFlB/G,CAAG0B,EAAGtM,EAAEm6E,MAAMpoE,MAAMzF,GAAK,IAAI26E,GAAG/vF,EAAGmH,EAAG2B,EAAEm6E,KAAM7tE,EAAG,IAAI06E,GAAG,OAAS16E,GAAKA,EAAEi+C,mBAC9D,GAAKvqD,EAAEk6E,aASxB,SAAS+N,GAAGjoF,GACZA,EAAIrB,GAAGqB,EAAGi6E,IACV,MAAM/iF,EAAIyH,GAAGqB,EAAEo6E,UAAW6E,IAC1B,OAAOpB,GAAG6B,GAAGxoF,GAAI8I,EAAEm6E,KAAM,CACrB7vE,OAAQ,WACTyH,MAAMzF,GAAKw7E,GAAG5wF,EAAG8I,EAAGsM,KAYvB,SAAS47E,GAAGloF,GACZA,EAAIrB,GAAGqB,EAAGqD,IACV,MAAMnM,EAAIyH,GAAGqB,EAAEo6E,UAAW6E,IAAK3yE,EAAIozE,GAAGxoF,GAAImH,EAAI,IAAI0pF,GAAG7wF,GACrD,OAAO0sF,GAAG5jF,EAAEu6E,QAASj1E,GAAGgH,EAAGtM,EAAEu6E,QAAQxoE,MAAMzF,GAAK,IAAI+6E,GAAGnwF,EAAGmH,EAAG2B,EAAGsM,KAShE,SAAS67E,GAAGnoF,GACZA,EAAIrB,GAAGqB,EAAGqD,IACV,MAAMnM,EAAIyH,GAAGqB,EAAEo6E,UAAW6E,IAAK3yE,EAAIozE,GAAGxoF,GAAImH,EAAI,IAAI0pF,GAAG7wF,GACrD,OAnkFJ,SAAY8I,EAAG9I,GACX,MAAMoV,EAAI,IAAIkoC,GACd,OAAOx0C,EAAEg+C,WAAWgsB,kBAAgB,SAAc5uB,eAAep7C,EAAG9I,EAAGoV,GACnE,IACI,MAAMjO,QAAUutE,GAAG5rE,EAAG9I,GACI,GAAKjE,EAAI,IAAIk/B,GAAGj7B,EAAGmH,EAAEy7D,IAAKxkB,EAAIriD,EAAEi/E,GAAG7zE,EAAEk3D,WAAYlgB,EAAIpiD,EAAE02D,aAAarU,GAClE,GAC5BhpC,EAAEwF,QAAQujC,EAAE2/B,UACd,MAAOh1E,GACL,MAAM3B,EAAIylC,GAAG9jC,EAAG,4BAA4B9I,mBAC5CoV,EAAEmoC,OAAOp2C,IARiC+8C,OAc3CqiC,GAAGz9E,GAAI9I,EAAGoV,KAAMA,EAAEqF,QAmjFlBy2E,CAAG97E,EAAGtM,EAAEu6E,QAAQxoE,MAAMzF,GAAK,IAAI+6E,GAAGnwF,EAAGmH,EAAG2B,EAAGsM,KAQlD,SAAS+7E,GAAGroF,GACZA,EAAIrB,GAAGqB,EAAGqD,IACV,MAAMnM,EAAIyH,GAAGqB,EAAEo6E,UAAW6E,IAAK3yE,EAAIozE,GAAGxoF,GAAImH,EAAI,IAAI0pF,GAAG7wF,GACrD,OAAOoO,GAAGgH,EAAGtM,EAAEu6E,OAAQ,CACnBjwE,OAAQ,WACTyH,MAAMzF,GAAK,IAAI+6E,GAAGnwF,EAAGmH,EAAG2B,EAAGsM,KAGlC,SAASg8E,GAAGtoF,EAAG9I,EAAGoV,GACdtM,EAAIrB,GAAGqB,EAAGi6E,IACV,MAAM57E,EAAIM,GAAGqB,EAAEo6E,UAAW6E,IAAKhsF,EAAI4zF,GAAG7mF,EAAEk6E,UAAWhjF,EAAGoV,GACtD,OAAOi8E,GAAGlqF,EAAG,CAAEujF,GAAGD,GAAGtjF,GAAI,SAAU2B,EAAEm6E,KAAMlnF,EAAG,OAAS+M,EAAEk6E,UAAW5tE,GAAG+vE,WAAWr8E,EAAEm6E,KAAMhsB,GAAGQ,UAGjG,SAAS65B,GAAGxoF,EAAG9I,EAAGoV,KAAMjO,GACpB2B,EAAIrB,GAAGqB,EAAGi6E,IACV,MAAMhnF,EAAI0L,GAAGqB,EAAEo6E,UAAW6E,IAAK3pC,EAAIqsC,GAAG1uF,GACtC,IAAIoiD,EAKJ,OAJAA,EAAI,iBAGJn+C,EAAIqT,EAAErT,KAAOA,aAAaypF,GAAKkC,GAAGvtC,EAAG,YAAat1C,EAAEm6E,KAAMjjF,EAAGoV,EAAGjO,GAAKskF,GAAGrtC,EAAG,YAAat1C,EAAEm6E,KAAMjjF,GACzFqxF,GAAGt1F,EAAG,CAAEoiD,EAAEgnC,WAAWr8E,EAAEm6E,KAAMhsB,GAAGE,QAAO,MAS9C,SAASo6B,GAAGzoF,GACZ,OAAOuoF,GAAG5pF,GAAGqB,EAAEo6E,UAAW6E,IAAK,CAAE,IAAIvwB,GAAG1uD,EAAEm6E,KAAMhsB,GAAGQ,UAYnD,SAAS+5B,GAAG1oF,EAAG9I,GACf,MAAMoV,EAAI3N,GAAGqB,EAAEo6E,UAAW6E,IAAK5gF,EAAIm8E,GAAGx6E,GAAI/M,EAAI4zF,GAAG7mF,EAAEk6E,UAAWhjF,GAC9D,OAAOqxF,GAAGj8E,EAAG,CAAEs1E,GAAGD,GAAG3hF,EAAEo6E,WAAY,SAAU/7E,EAAE87E,KAAMlnF,EAAG,OAAS+M,EAAEk6E,UAAW,IAAImC,WAAWh+E,EAAE87E,KAAMhsB,GAAGE,QAAO,MAAQt8C,MAAM,IAAM1T,IAGvI,SAASsqF,GAAG3oF,KAAM9I,GACd,IAAIoV,EAAGjO,EAAGpL,EACV+M,EAAIuK,EAAEvK,GACN,IAAIs1C,EAAI,CACJ6+B,wBAAwB,GACzB9+B,EAAI,EACP,iBAAmBn+C,EAAEm+C,IAAMqpC,GAAGxnF,EAAEm+C,MAAQC,EAAIp+C,EAAEm+C,GAAIA,KAClD,MAAMx/C,EAAI,CACNs+E,uBAAwB7+B,EAAE6+B,wBAE9B,GAAIuK,GAAGxnF,EAAEm+C,IAAK,CACV,MAAMr1C,EAAI9I,EAAEm+C,GACZn+C,EAAEm+C,GAAK,QAAU/oC,EAAItM,EAAEoQ,YAAS,IAAW9D,OAAI,EAASA,EAAEtN,KAAKgB,GAAI9I,EAAEm+C,EAAI,GAAK,QAAUh3C,EAAI2B,EAAE3I,aAAU,IAAWgH,OAAI,EAASA,EAAEW,KAAKgB,GACvI9I,EAAEm+C,EAAI,GAAK,QAAUpiD,EAAI+M,EAAEm+E,gBAAa,IAAWlrF,OAAI,EAASA,EAAE+L,KAAKgB,GAE3E,IAAI7M,EAAG2H,EAAGwlB,EACV,GAAItgB,aAAai6E,GAAIn/E,EAAI6D,GAAGqB,EAAEo6E,UAAW6E,IAAK3+D,EAAIyrC,GAAG/rD,EAAEm6E,KAAKlpD,MAAO99B,EAAI,CACnEid,KAAM9D,IACFpV,EAAEm+C,IAAMn+C,EAAEm+C,GAAGyyC,GAAGhtF,EAAGkF,EAAGsM,KAE1BjV,MAAOH,EAAEm+C,EAAI,GACb8oC,SAAUjnF,EAAEm+C,EAAI,QACZ,CACJ,MAAM/oC,EAAI3N,GAAGqB,EAAGqD,IAChBvI,EAAI6D,GAAG2N,EAAE8tE,UAAW6E,IAAK3+D,EAAIhU,EAAEiuE,OAC/B,MAAMl8E,EAAI,IAAI0pF,GAAGjtF,GACjB3H,EAAI,CACAid,KAAMpQ,IACF9I,EAAEm+C,IAAMn+C,EAAEm+C,GAAG,IAAIgyC,GAAGvsF,EAAGuD,EAAGiO,EAAGtM,KAEjC3I,MAAOH,EAAEm+C,EAAI,GACb8oC,SAAUjnF,EAAEm+C,EAAI,IACjBuuC,GAAG5jF,EAAEu6E,QAEZ,OAAO,SAASv6E,EAAG9I,EAAGoV,EAAGjO,GACrB,MAAMpL,EAAI,IAAI2nF,GAAGv8E,GAAIi3C,EAAI,IAAI4+B,GAAGh9E,EAAGjE,EAAGqZ,GACtC,OAAOtM,EAAEg+C,WAAWgsB,kBAAgB,SAAc4J,SAASgK,GAAG59E,GAAIs1C,KAAM,KACpEriD,EAAEwiF,KAAMz1E,EAAEg+C,WAAWgsB,kBAAgB,SAAc9pC,SAAS09C,GAAG59E,GAAIs1C,MAHpE,CAKLoqC,GAAG5kF,GAAIwlB,EAAGzqB,EAAG1C,GAGnB,SAASy1F,GAAG5oF,EAAG9I,GACX,OAloFJ,SAAY8I,EAAG9I,GACX,MAAMoV,EAAI,IAAIsuE,GAAG1jF,GACjB,OAAO8I,EAAEg+C,WAAWgsB,kBAAkB,SAAY,SAAShqE,EAAG9I,GAC1Ds8C,GAAExzC,GAAGqwE,GAAG/kE,IAAIpU,GAGZA,EAAEkZ,OAJ4C,OAK1CwtE,GAAG59E,GAAIsM,KAAM,KACjBA,EAAEmpE,KAAMz1E,EAAEg+C,WAAWgsB,2BAA8B,SAAShqE,EAAG9I,GAC3Ds8C,GAAExzC,GAAGqwE,GAAG99C,OAAOr7B,GADgC,OAE3C0mF,GAAG59E,GAAIsM,MAwnFZoB,CAAGgyE,GAAG1/E,EAAIrB,GAAGqB,EAAGi/E,KAAMP,GAAGxnF,GAAKA,EAAI,CACrCkZ,KAAMlZ,IAOV,SAASqxF,GAAGvoF,EAAG9I,GACf,OAAO,SAAS8I,EAAG9I,GACf,MAAMoV,EAAI,IAAIkoC,GACd,OAAOx0C,EAAEg+C,WAAWgsB,kBAAkB,SApnJ1C5uB,eAAkBp7C,EAAG9I,EAAGoV,GACxB,MAAMjO,EAAIm4E,GAAGx2E,GACb,IACI,MAAMA,QAAU,SAASA,EAAG9I,GACxB,MAAMoV,EAAIknC,GAAExzC,GAAI3B,EAAIu4C,GAAGj5C,MAAO1K,EAAIiE,EAAE4uD,QAAM,CAAG9lD,EAAG9I,IAAM8I,EAAEsL,IAAIpU,EAAEuD,MAAOs2D,MACrE,IAAIzb,EAAGD,EACP,OAAO/oC,EAAEgyC,YAAYC,eAAe,0BAA2B,aAAcv+C,IAOzE,IAAInK,EAAIy6D,KAAMn9D,EAAI49D,KAClB,OAAOzkD,EAAEksD,GAAG8F,WAAWt+D,EAAG/M,GAAGmd,MAAMpQ,IAC/BnK,EAAImK,EAAGnK,EAAEiU,SAAO,CAAG9J,EAAG9I,KAClBA,EAAEwzD,oBAAsBv3D,EAAIA,EAAEmY,IAAItL,UAEtCoQ,MAAI,IAAQ9D,EAAEsyC,eAAekoB,sBAAsB9mE,EAAGnK,KAAKua,MAAMnd,IACjEqiD,EAAIriD,EAMJ,MAAMoiD,EAAI,GACV,IAAK,MAAMr1C,KAAK9I,EAAG,CACf,MAAMA,EAAIo4D,GAAGtvD,EAAGs1C,EAAEtyC,IAAIhD,EAAEvF,KAAKg2D,mBAC7B,MAAQv5D,GAIRm+C,EAAEngD,KAAK,IAAI25D,GAAG7uD,EAAEvF,IAAKvD,EAAG0yD,GAAG1yD,EAAEwD,MAAMgnD,UAAWyM,GAAGE,QAAO,KAE5D,OAAO/hD,EAAEi6D,cAAc1F,iBAAiB7gE,EAAG3B,EAAGg3C,EAAGn+C,MACjDkZ,MAAMlZ,IACNm+C,EAAIn+C,EACJ,MAAMmH,EAAInH,EAAE8hE,wBAAwB1jB,EAAGniD,GACvC,OAAOmZ,EAAEk6D,qBAAqBzK,aAAa/7D,EAAG9I,EAAE+nD,QAAS5gD,SAE7D0T,MAAI,KAAS,CACbktC,QAAS5J,EAAE4J,QACXH,QAASpmC,GAAG48B,OAvCJ,CAyCdj3C,EAAEggD,WAAYnnD,GAChBmH,EAAEi3E,kBAAkBrI,mBAAmBjtE,EAAEi/C,SAAU,SAASj/C,EAAG9I,EAAGoV,GAC9D,IAAIjO,EAAI2B,EAAEkgC,GAAGlgC,EAAEk1C,YAAYzC,SAC3Bp0C,IAAMA,EAAI,IAAIqoD,GAAGlQ,KACjBn4C,EAAIA,EAAEyoD,OAAO5vD,EAAGoV,GAAItM,EAAEkgC,GAAGlgC,EAAEk1C,YAAYzC,SAAWp0C,EAHH,CAQtDA,EAAG2B,EAAEi/C,QAAS3yC,SAAUmmB,GAAGp0B,EAAG2B,EAAE8+C,eAAgBgzB,GAAGzzE,EAAE+2E,aACpD,MAAOp1E,GAGL,MAAM9I,EAAI4sC,GAAG9jC,EAAG,2BAChBsM,EAAEmoC,OAAOv9C,IA0jJyC6jF,OAAStwE,GAAGzK,GAAI9I,EAAGoV,KAAMA,EAAEqF,QAF1E,CAGL+tE,GAAG1/E,GAAI9I,GAMT,SAAS4wF,GAAG9nF,EAAG9I,EAAGoV,GAClB,MAAMjO,EAAIiO,EAAEs7D,KAAK5kE,IAAI9L,EAAEijF,MAAOlnF,EAAI,IAAI80F,GAAG/nF,GACzC,OAAO,IAAIinF,GAAGjnF,EAAG/M,EAAGiE,EAAEijF,KAAM97E,EAAG,IAAI2oF,GAAG16E,EAAEm+C,iBAAkBn+C,EAAEw+D,WAAY5zE,EAAEgjF,WA8B1E,SAAS2O,GAAG7oF,EAAG9I,GACf,OAAOiH,GAAG6B,EAAEsxB,MAAOp6B,EAAEo6B,QAAU92B,EAAEwF,EAAE5F,OAAQlD,EAAEkD,QAuC7C,SAAS0uF,GAAG9oF,GACZ,MAAM9I,EAAIyH,GAAGqB,EAAEo6E,UAAW6E,IAC1B,OAAO,SAASj/E,EAAG9I,EAAGoV,GAClB,MAAMjO,EAAI,IAAIm2C,GACd,OAAOx0C,EAAEg+C,WAAWgsB,4BAChB,IACI,GAAI6G,SAAS6M,GAAG19E,IAAK,CACjB,MAAM/M,QAAU0qF,GAAG39E,GAAIs1C,EAAI,IAAIlvB,GAAGlvB,EAAGjE,EAAGqZ,GAAG+uE,MAC3Ch9E,EAAEyT,QAAQwjC,QACPj3C,EAAEo2C,OAAO,IAAIn5B,GAAEjN,GAAEimC,YAAa,8DACvC,MAAOt0C,GACL3B,EAAEo2C,OAAOz0C,OAEZ3B,EAAEsT,QAXJ,CAYL+tE,GAAGxoF,GAAI8I,EAAG,IAAI+nF,GAAG7wF,IAkBnB,MAAM6xF,GAAK,CACXrM,YAAa,GA2BjB,MAAMsM,GAEFzvF,YAAYyG,EAAG9I,GACXtD,KAAKwvF,WAAapjF,EAAGpM,KAAKq1F,eAAiB/xF,EAAGtD,KAAKs1F,WAAa,GAAIt1F,KAAKu1F,YAAa,EACtFv1F,KAAKw1F,YAAczH,GAAG3hF,GAE1BiR,IAAIjR,EAAG9I,EAAGoV,GACN1Y,KAAKy1F,sBACL,MAAMhrF,EAAIirF,GAAGtpF,EAAGpM,KAAKwvF,YAAanwF,EAAI4zF,GAAGxoF,EAAE67E,UAAWhjF,EAAGoV,GAAIgpC,EAAIssC,GAAGhuF,KAAKw1F,YAAa,iBAAkB/qF,EAAE87E,KAAMlnF,EAAG,OAASoL,EAAE67E,UAAW5tE,GACzI,OAAO1Y,KAAKs1F,WAAWh0F,KAAKogD,EAAE+mC,WAAWh+E,EAAE87E,KAAMhsB,GAAGQ,SAAU/6D,KAElE6gE,OAAOz0D,EAAG9I,EAAGoV,KAAMjO,GACfzK,KAAKy1F,sBACL,MAAMp2F,EAAIq2F,GAAGtpF,EAAGpM,KAAKwvF,YAGb,IAAI9tC,EACZ,OAAOA,EAAI,iBAAoBp+C,EAAIqT,EAAErT,KAAOA,aAAaypF,GAAKkC,GAAGjvF,KAAKw1F,YAAa,oBAAqBn2F,EAAEknF,KAAMjjF,EAAGoV,EAAGjO,GAAKskF,GAAG/uF,KAAKw1F,YAAa,oBAAqBn2F,EAAEknF,KAAMjjF,GAC7KtD,KAAKs1F,WAAWh0F,KAAKogD,EAAE+mC,WAAWppF,EAAEknF,KAAMhsB,GAAGE,QAAO,KAAOz6D,KAOxD2+B,OAAOvyB,GACVpM,KAAKy1F,sBACL,MAAMnyF,EAAIoyF,GAAGtpF,EAAGpM,KAAKwvF,YACrB,OAAOxvF,KAAKs1F,WAAat1F,KAAKs1F,WAAW/5E,OAAO,IAAIu/C,GAAGx3D,EAAEijF,KAAMhsB,GAAGQ,SAAU/6D,KAazE2oD,SACH,OAAO3oD,KAAKy1F,sBAAuBz1F,KAAKu1F,YAAa,EAAIv1F,KAAKs1F,WAAWh2F,OAAS,EAAIU,KAAKq1F,eAAer1F,KAAKs1F,YAAcr3E,QAAQC,UAEzIu3E,sBACI,GAAIz1F,KAAKu1F,WAAY,MAAM,IAAI7tE,GAAEjN,GAAE4lC,oBAAqB,wEAIhE,SAASq1C,GAAGtpF,EAAG9I,GACX,IAAK8I,EAAIuK,EAAEvK,IAAIo6E,YAAcljF,EAAG,MAAM,IAAIokB,GAAEjN,GAAEslC,iBAAkB,uEAChE,OAAO3zC,EAmDX,MAAMupF,WAAW,MAEbhwF,YAAYyG,EAAG9I,GACXtD,KAAKwvF,WAAapjF,EAAGpM,KAAK41F,aAAetyF,EAAGtD,KAAKw1F,YAAczH,GAAG3hF,GAO/DgD,IAAIhD,GACP,MAAM9I,EAAIoyF,GAAGtpF,EAAGpM,KAAKwvF,YAAa92E,EAAI,IAAIy6E,GAAGnzF,KAAKwvF,YAClD,OAAOxvF,KAAK41F,aAAaC,OAAO,CAAEvyF,EAAEijF,OAAQpoE,MAAM/R,IAC9C,IAAKA,GAAK,IAAMA,EAAE9M,OAAQ,OAAO8sC,KACjC,MAAM3hC,EAAI2B,EAAE,GACZ,GAAI3B,EAAEssD,kBAAmB,OAAO,IAAIw4B,GAAGvvF,KAAKwvF,WAAY92E,EAAGjO,EAAE5D,IAAK4D,EAAGnH,EAAEgjF,WACvE,GAAI77E,EAAEusD,eAAgB,OAAO,IAAIu4B,GAAGvvF,KAAKwvF,WAAY92E,EAAGpV,EAAEijF,KAAM,KAAMjjF,EAAEgjF,WACxE,MAAMl6C,QAGd/uB,IAAIjR,EAAG9I,EAAGoV,GACN,MAAMjO,EAAIirF,GAAGtpF,EAAGpM,KAAKwvF,YAAanwF,EAAI4zF,GAAGxoF,EAAE67E,UAAWhjF,EAAGoV,GAAIgpC,EAAIssC,GAAGhuF,KAAKw1F,YAAa,kBAAmB/qF,EAAE87E,KAAMlnF,EAAG,OAASoL,EAAE67E,UAAW5tE,GAC1I,OAAO1Y,KAAK41F,aAAav4E,IAAI5S,EAAE87E,KAAM7kC,GAAI1hD,KAE7C6gE,OAAOz0D,EAAG9I,EAAGoV,KAAMjO,GACf,MAAMpL,EAAIq2F,GAAGtpF,EAAGpM,KAAKwvF,YAGb,IAAI9tC,EACZ,OAAOA,EAAI,iBAAoBp+C,EAAIqT,EAAErT,KAAOA,aAAaypF,GAAKkC,GAAGjvF,KAAKw1F,YAAa,qBAAsBn2F,EAAEknF,KAAMjjF,EAAGoV,EAAGjO,GAAKskF,GAAG/uF,KAAKw1F,YAAa,qBAAsBn2F,EAAEknF,KAAMjjF,GAC/KtD,KAAK41F,aAAa/0B,OAAOxhE,EAAEknF,KAAM7kC,GAAI1hD,KAOlC2+B,OAAOvyB,GACV,MAAM9I,EAAIoyF,GAAGtpF,EAAGpM,KAAKwvF,YACrB,OAAOxvF,KAAK41F,aAAaj3D,OAAOr7B,EAAEijF,MAAOvmF,OAM7C2F,YAAYyG,EAAG9I,GACXyC,MAAMqG,EAAG9I,GAAItD,KAAKwvF,WAAapjF,EAO5BgD,IAAIhD,GACP,MAAM9I,EAAIoyF,GAAGtpF,EAAGpM,KAAKwvF,YAAa92E,EAAI,IAAIy7E,GAAGn0F,KAAKwvF,YAClD,OAAOzpF,MAAMqJ,IAAIhD,GAAG+R,MAAM/R,GAAK,IAAIinF,GAAGrzF,KAAKwvF,WAAY92E,EAAGpV,EAAEijF,KAAMn6E,EAAEsjF,UAAW,IAAI0D,IAC3D,GACP,GAAK9vF,EAAEgjF,cAsB5B,SAASwP,GAAG1pF,EAAG9I,EAAGoV,GAClBtM,EAAIrB,GAAGqB,EAAGi/E,IACV,MAAM5gF,EAAItF,OAAOgrD,OAAOhrD,OAAOgrD,OAAO,GAAIglC,IAAKz8E,GAI/C,OAHC,SAAStM,GACN,GAAIA,EAAE08E,YAAc,EAAG,MAAM,IAAIphE,GAAEjN,GAAEslC,iBAAkB,mCAD1D,CAECt1C,GACK,SAAS2B,EAAG9I,EAAGoV,GAClB,MAAMjO,EAAI,IAAIm2C,GACd,OAAOx0C,EAAEg+C,WAAWgsB,4BAChB,MAAM/2E,QAAU0qF,GAAG39E,GACnB,IAAIu8E,GAAGv8E,EAAEg+C,WAAY/qD,EAAGqZ,EAAGpV,EAAGmH,GAAGg9E,SAChCh9E,EAAEsT,QALJ,CAML+tE,GAAG1/E,IAAKsM,GAAKpV,EAAE,IAAIqyF,GAAGvpF,EAAGsM,KAAMjO,GAsBjC,SAASsrF,KACT,OAAO,IAAIxH,GAAG,eAMd,SAASyH,KACT,OAAO,IAAItH,GAAG,mBAcd,SAASuH,MAAM7pF,GAGf,OAAO,IAAIuiF,GAAG,aAAcviF,GAa5B,SAAS8pF,MAAM9pF,GAGf,OAAO,IAAIyiF,GAAG,cAAeziF,GAqB7B,SAAS+pF,GAAG/pF,GACZ,OAAO,IAAI0iF,GAAG,YAAa1iF,GA6B3B,SAASgqF,GAAGhqF,GACZ,OAAO0/E,GAAG1/E,EAAIrB,GAAGqB,EAAGi/E,KAAM,IAAI+J,GAAGhpF,GAAI9I,GAAKqxF,GAAGvoF,EAAG9I,KAkBhD,SAAS+yF,GAAGjqF,EAAG9I,GACf,IAAIoV,EACJ,MAAMjO,EAAIqhF,GAAG1/E,EAAIrB,GAAGqB,EAAGi/E,KAGnB,KAAM,QAAU3yE,EAAIjO,EAAE++E,yBAAsB,IAAW9wE,OAAI,EAASA,EAAEqqE,0BAA2B,OAAOx3D,GAAE,sDAC9GtN,QAAQC,UACR,MAAM7e,EAAI,SAAS+M,GACf,MAAM9I,EAAI,iBAAmB8I,EAAI,SAASA,GACtC,IACI,OAAOzI,KAAKC,MAAMwI,GACpB,MAAOA,GACL,MAAM,IAAIsb,GAAEjN,GAAEslC,iBAAkB,0BAA4B,MAAQ3zC,OAAI,EAASA,EAAEvG,WAJ1D,CAM/BuG,GAAKA,EAAGsM,EAAI,GACd,GAAInY,MAAMC,QAAQ8C,EAAEgzF,SAAU,IAAK,MAAMlqF,KAAK9I,EAAEgzF,QAAS,CACrD,MAAMhzF,EAAIizF,GAAGnqF,EAAG,mBAAoB3B,EAAI,GACxC,GAAIlK,MAAMC,QAAQ4L,EAAE05C,QAAS,IAAK,MAAMxiD,KAAK8I,EAAE05C,OAAQ,CACnD,MAAM15C,EAAI4iF,GAAG,wBAAyBuH,GAAGjzF,EAAG,cAC5C,aAAeA,EAAEkzF,YAAc/rF,EAAEnJ,KAAK,IAAIglD,GAAGl6C,EAAG,IAA+B,cAAgB9I,EAAE0O,MAAQvH,EAAEnJ,KAAK,IAAIglD,GAAGl6C,EAAG,IAAgC,eAAiB9I,EAAE0O,OAASvH,EAAEnJ,KAAK,IAAIglD,GAAGl6C,EAAG,IAE3MsM,EAAEpX,KAAK,IAAIskD,GAAGA,GAAGS,WAAY/iD,EAAGmH,EAAG+7C,GAAGK,UAE1C,OAAOnuC,EAhBD,CAiBRpV,GACF,OAAOumF,GAAGp/E,GAAG0T,MAAM/R,GAAKo7C,eAAep7C,EAAG9I,GACtC,MAAMoV,EAAIknC,GAAExzC,GAAI3B,EAAIiO,EAAEmyC,aAAcxrD,EAAI,GACxC,OAAOqZ,EAAEgyC,YAAYC,eAAe,oBAAqB,aAAcv+C,GAAK3B,EAAEsgE,gBAAgB3+D,GAAGoQ,MAAM9D,GAAK,SAAStM,EAAG9I,EAAGoV,EAAGjO,EAAGpL,GAC7H+M,EAAI,IAAKA,GAAK9I,EAAI,IAAKA,GAAK8I,EAAEojD,KAAK92C,GAAIpV,EAAEksD,KAAK92C,GAC9C,MAAMgpC,EAAIt1C,EAAE9M,OAAQmiD,EAAIn+C,EAAEhE,OAC1B,IAAI2C,EAAI,EAAG1C,EAAI,EACf,KAAM0C,EAAIw/C,GAAKliD,EAAImiD,GAAK,CACpB,MAAMA,EAAIhpC,EAAEtM,EAAE7M,GAAI+D,EAAErB,IACpBy/C,EAAI,EAGJriD,EAAE+M,EAAE7M,MAAQmiD,EAAI,EAGhBj3C,EAAEnH,EAAErB,OAASA,IAAK1C,KAEtB,KAAM0C,EAAIw/C,GAAKh3C,EAAEnH,EAAErB,MACnB,KAAM1C,EAAImiD,GAAKriD,EAAE+M,EAAE7M,MAfqF,CAgB1GmZ,EAAGpV,EAAG6iD,IAAK7iD,IACTjE,EAAEiC,KAAKmJ,EAAEkgE,cAAcv+D,EAAG9I,OACzBA,IACDjE,EAAEiC,KAAKmJ,EAAEmgE,iBAAiBx+D,EAAG9I,SAC3BkZ,UAAYkrC,GAAGS,QAAQ9oD,OAtBTmoD,CA0CvBp7C,EAAG/M,KAGR,SAASk3F,GAAGnqF,EAAG9I,GACX,GAAI,iBAAmB8I,EAAE9I,GAAI,MAAM,IAAIokB,GAAEjN,GAAEslC,iBAAkB,6BAA+Bz8C,GAC5F,OAAO8I,EAAE9I,IAOR,SAAS8I,EAAG9I,GAAI,GAEbwJ,GACFzN,EAAIqZ,EAAE,IAAIgpC,EAAE,aAAW,CAAIt1C,GAAIw/E,mBAAoBlzE,EAAGvJ,QAAS1E,MAC7D,MAAMpL,EAAI+M,EAAEqqF,YAAY,OAAO50C,eAAgBH,EAAI,IAAI2pC,GAAG,IAAI97D,GAAEnjB,EAAEqqF,YAAY,kBAAmB,IAAI3yE,GAAE1X,EAAEqqF,YAAY,uBAAwB,SAASrqF,EAAG9I,GACrJ,IAAK6B,OAAOC,UAAUmI,eAAepC,MAAMiB,EAAE+C,QAAS,CAAE,cAAgB,MAAM,IAAIuY,GAAEjN,GAAEslC,iBAAkB,uDACxG,OAAO,IAAIiM,GAAG5/C,EAAE+C,QAAQ88C,UAAW3oD,GAFsG,CAG3IjE,EAAGqZ,GAAIrZ,GACT,OAAOoL,EAAItF,OAAOgrD,OAAO,CACrB3hB,gBAAiBlrC,GAClBmH,GAAIi3C,EAAEkjC,aAAan6E,GAAIi3C,IAC1B,UAAUn5C,sBAAqB,IAAMkC,EAAEtD,GAAG,QAASiF,GAEvD3B,EAAEtD,GAAG,QAAS,WAbb","preExistingComment":"firebase-firestore.js.map"}